[ Started: 2024-08-15 23:38:13 CEST ] [ CARNIVAL v2.7.2 for BioC-3.20 from https://github.com/saezlab/CARNIVAL@master (2b8887a 2023-12-06 13:18:32) ] [1] "Libraries: " "/home/omnipath/local/R/4.4-3.20" [3] "/home/omnipath/local/R/4.4" "/usr/lib/R/library" 'getOption("repos")' replaces Bioconductor standard repositories, see 'help("repositories", package = "BiocManager")' for details. Replacement repositories: CRAN: https://cloud.r-project.org Bioconductor version 3.20 (BiocManager 1.30.23), R 4.4.1 (2024-06-14) Installing package(s) 'BiocVersion' trying URL 'https://bioconductor.org/packages/3.20/bioc/src/contrib/BiocVersion_3.20.0.tar.gz' Content type 'application/x-gzip' length 983 bytes ================================================== downloaded 983 bytes * installing *source* package ‘BiocVersion’ ... ** using staged installation ** 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 (BiocVersion) The downloaded source packages are in ‘/tmp/RtmpSoQTSW/downloaded_packages’ Installing package(s) 'foreign', 'lattice', 'mgcv', 'nlme', 'nnet' trying URL 'https://cloud.r-project.org/src/contrib/foreign_0.8-87.tar.gz' Content type 'application/x-gzip' length 365280 bytes (356 KB) ================================================== downloaded 356 KB trying URL 'https://cloud.r-project.org/src/contrib/lattice_0.22-6.tar.gz' Content type 'application/x-gzip' length 598581 bytes (584 KB) ================================================== downloaded 584 KB trying URL 'https://cloud.r-project.org/src/contrib/mgcv_1.9-1.tar.gz' Content type 'application/x-gzip' length 1083217 bytes (1.0 MB) ================================================== downloaded 1.0 MB trying URL 'https://cloud.r-project.org/src/contrib/nlme_3.1-166.tar.gz' Content type 'application/x-gzip' length 847668 bytes (827 KB) ================================================== downloaded 827 KB trying URL 'https://cloud.r-project.org/src/contrib/nnet_7.3-19.tar.gz' Content type 'application/x-gzip' length 29152 bytes (28 KB) ================================================== downloaded 28 KB * installing *source* package ‘foreign’ ... ** package ‘foreign’ successfully unpacked and MD5 sums checked ** using staged installation ** libs using C compiler: ‘gcc (Ubuntu 13.2.0-23ubuntu4) 13.2.0’ gcc -I"/usr/share/R/include" -DNDEBUG -fpic -g -O2 -fno-omit-frame-pointer -mno-omit-leaf-frame-pointer -ffile-prefix-map=/build/r-base-EawLoD/r-base-4.4.1=. -fstack-protector-strong -fstack-clash-protection -Wformat -Werror=format-security -fcf-protection -fdebug-prefix-map=/build/r-base-EawLoD/r-base-4.4.1=/usr/src/r-base-4.4.1-1.2404.0 -Wdate-time -D_FORTIFY_SOURCE=3 -c R_systat.c -o R_systat.o gcc -I"/usr/share/R/include" -DNDEBUG -fpic -g -O2 -fno-omit-frame-pointer -mno-omit-leaf-frame-pointer -ffile-prefix-map=/build/r-base-EawLoD/r-base-4.4.1=. -fstack-protector-strong -fstack-clash-protection -Wformat -Werror=format-security -fcf-protection -fdebug-prefix-map=/build/r-base-EawLoD/r-base-4.4.1=/usr/src/r-base-4.4.1-1.2404.0 -Wdate-time -D_FORTIFY_SOURCE=3 -c Rdbfread.c -o Rdbfread.o gcc -I"/usr/share/R/include" -DNDEBUG -fpic -g -O2 -fno-omit-frame-pointer -mno-omit-leaf-frame-pointer -ffile-prefix-map=/build/r-base-EawLoD/r-base-4.4.1=. -fstack-protector-strong -fstack-clash-protection -Wformat -Werror=format-security -fcf-protection -fdebug-prefix-map=/build/r-base-EawLoD/r-base-4.4.1=/usr/src/r-base-4.4.1-1.2404.0 -Wdate-time -D_FORTIFY_SOURCE=3 -c Rdbfwrite.c -o Rdbfwrite.o gcc -I"/usr/share/R/include" -DNDEBUG -fpic -g -O2 -fno-omit-frame-pointer -mno-omit-leaf-frame-pointer -ffile-prefix-map=/build/r-base-EawLoD/r-base-4.4.1=. -fstack-protector-strong -fstack-clash-protection -Wformat -Werror=format-security -fcf-protection -fdebug-prefix-map=/build/r-base-EawLoD/r-base-4.4.1=/usr/src/r-base-4.4.1-1.2404.0 -Wdate-time -D_FORTIFY_SOURCE=3 -c SASxport.c -o SASxport.o gcc -I"/usr/share/R/include" -DNDEBUG -fpic -g -O2 -fno-omit-frame-pointer -mno-omit-leaf-frame-pointer -ffile-prefix-map=/build/r-base-EawLoD/r-base-4.4.1=. -fstack-protector-strong -fstack-clash-protection -Wformat -Werror=format-security -fcf-protection -fdebug-prefix-map=/build/r-base-EawLoD/r-base-4.4.1=/usr/src/r-base-4.4.1-1.2404.0 -Wdate-time -D_FORTIFY_SOURCE=3 -c avl.c -o avl.o gcc -I"/usr/share/R/include" -DNDEBUG -fpic -g -O2 -fno-omit-frame-pointer -mno-omit-leaf-frame-pointer -ffile-prefix-map=/build/r-base-EawLoD/r-base-4.4.1=. -fstack-protector-strong -fstack-clash-protection -Wformat -Werror=format-security -fcf-protection -fdebug-prefix-map=/build/r-base-EawLoD/r-base-4.4.1=/usr/src/r-base-4.4.1-1.2404.0 -Wdate-time -D_FORTIFY_SOURCE=3 -c dbfopen.c -o dbfopen.o gcc -I"/usr/share/R/include" -DNDEBUG -fpic -g -O2 -fno-omit-frame-pointer -mno-omit-leaf-frame-pointer -ffile-prefix-map=/build/r-base-EawLoD/r-base-4.4.1=. -fstack-protector-strong -fstack-clash-protection -Wformat -Werror=format-security -fcf-protection -fdebug-prefix-map=/build/r-base-EawLoD/r-base-4.4.1=/usr/src/r-base-4.4.1-1.2404.0 -Wdate-time -D_FORTIFY_SOURCE=3 -c file-handle.c -o file-handle.o gcc -I"/usr/share/R/include" -DNDEBUG -fpic -g -O2 -fno-omit-frame-pointer -mno-omit-leaf-frame-pointer -ffile-prefix-map=/build/r-base-EawLoD/r-base-4.4.1=. -fstack-protector-strong -fstack-clash-protection -Wformat -Werror=format-security -fcf-protection -fdebug-prefix-map=/build/r-base-EawLoD/r-base-4.4.1=/usr/src/r-base-4.4.1-1.2404.0 -Wdate-time -D_FORTIFY_SOURCE=3 -c format.c -o format.o gcc -I"/usr/share/R/include" -DNDEBUG -fpic -g -O2 -fno-omit-frame-pointer -mno-omit-leaf-frame-pointer -ffile-prefix-map=/build/r-base-EawLoD/r-base-4.4.1=. -fstack-protector-strong -fstack-clash-protection -Wformat -Werror=format-security -fcf-protection -fdebug-prefix-map=/build/r-base-EawLoD/r-base-4.4.1=/usr/src/r-base-4.4.1-1.2404.0 -Wdate-time -D_FORTIFY_SOURCE=3 -c init.c -o init.o gcc -I"/usr/share/R/include" -DNDEBUG -fpic -g -O2 -fno-omit-frame-pointer -mno-omit-leaf-frame-pointer -ffile-prefix-map=/build/r-base-EawLoD/r-base-4.4.1=. -fstack-protector-strong -fstack-clash-protection -Wformat -Werror=format-security -fcf-protection -fdebug-prefix-map=/build/r-base-EawLoD/r-base-4.4.1=/usr/src/r-base-4.4.1-1.2404.0 -Wdate-time -D_FORTIFY_SOURCE=3 -c minitab.c -o minitab.o gcc -I"/usr/share/R/include" -DNDEBUG -fpic -g -O2 -fno-omit-frame-pointer -mno-omit-leaf-frame-pointer -ffile-prefix-map=/build/r-base-EawLoD/r-base-4.4.1=. -fstack-protector-strong -fstack-clash-protection -Wformat -Werror=format-security -fcf-protection -fdebug-prefix-map=/build/r-base-EawLoD/r-base-4.4.1=/usr/src/r-base-4.4.1-1.2404.0 -Wdate-time -D_FORTIFY_SOURCE=3 -c pfm-read.c -o pfm-read.o gcc -I"/usr/share/R/include" -DNDEBUG -fpic -g -O2 -fno-omit-frame-pointer -mno-omit-leaf-frame-pointer -ffile-prefix-map=/build/r-base-EawLoD/r-base-4.4.1=. -fstack-protector-strong -fstack-clash-protection -Wformat -Werror=format-security -fcf-protection -fdebug-prefix-map=/build/r-base-EawLoD/r-base-4.4.1=/usr/src/r-base-4.4.1-1.2404.0 -Wdate-time -D_FORTIFY_SOURCE=3 -c sfm-read.c -o sfm-read.o gcc -I"/usr/share/R/include" -DNDEBUG -fpic -g -O2 -fno-omit-frame-pointer -mno-omit-leaf-frame-pointer -ffile-prefix-map=/build/r-base-EawLoD/r-base-4.4.1=. -fstack-protector-strong -fstack-clash-protection -Wformat -Werror=format-security -fcf-protection -fdebug-prefix-map=/build/r-base-EawLoD/r-base-4.4.1=/usr/src/r-base-4.4.1-1.2404.0 -Wdate-time -D_FORTIFY_SOURCE=3 -c spss.c -o spss.o gcc -I"/usr/share/R/include" -DNDEBUG -fpic -g -O2 -fno-omit-frame-pointer -mno-omit-leaf-frame-pointer -ffile-prefix-map=/build/r-base-EawLoD/r-base-4.4.1=. -fstack-protector-strong -fstack-clash-protection -Wformat -Werror=format-security -fcf-protection -fdebug-prefix-map=/build/r-base-EawLoD/r-base-4.4.1=/usr/src/r-base-4.4.1-1.2404.0 -Wdate-time -D_FORTIFY_SOURCE=3 -c stataread.c -o stataread.o gcc -shared -L/usr/lib/R/lib -Wl,-Bsymbolic-functions -flto=auto -ffat-lto-objects -Wl,-z,relro -o foreign.so R_systat.o Rdbfread.o Rdbfwrite.o SASxport.o avl.o dbfopen.o file-handle.o format.o init.o minitab.o pfm-read.o sfm-read.o spss.o stataread.o -L/usr/lib/R/lib -lR installing to /home/omnipath/local/R/4.4-3.20/00LOCK-foreign/00new/foreign/libs ** R ** inst ** byte-compile and prepare package for lazy loading ** help *** installing help indices ** building package indices ** testing if installed package can be loaded from temporary location ** checking absolute paths in shared objects and dynamic libraries ** testing if installed package can be loaded from final location ** testing if installed package keeps a record of temporary installation path * DONE (foreign) * installing *source* package ‘lattice’ ... ** package ‘lattice’ successfully unpacked and MD5 sums checked ** using staged installation ** libs using C compiler: ‘gcc (Ubuntu 13.2.0-23ubuntu4) 13.2.0’ gcc -I"/usr/share/R/include" -DNDEBUG -fpic -g -O2 -fno-omit-frame-pointer -mno-omit-leaf-frame-pointer -ffile-prefix-map=/build/r-base-EawLoD/r-base-4.4.1=. -fstack-protector-strong -fstack-clash-protection -Wformat -Werror=format-security -fcf-protection -fdebug-prefix-map=/build/r-base-EawLoD/r-base-4.4.1=/usr/src/r-base-4.4.1-1.2404.0 -Wdate-time -D_FORTIFY_SOURCE=3 -c init.c -o init.o gcc -I"/usr/share/R/include" -DNDEBUG -fpic -g -O2 -fno-omit-frame-pointer -mno-omit-leaf-frame-pointer -ffile-prefix-map=/build/r-base-EawLoD/r-base-4.4.1=. -fstack-protector-strong -fstack-clash-protection -Wformat -Werror=format-security -fcf-protection -fdebug-prefix-map=/build/r-base-EawLoD/r-base-4.4.1=/usr/src/r-base-4.4.1-1.2404.0 -Wdate-time -D_FORTIFY_SOURCE=3 -c threeDplot.c -o threeDplot.o gcc -shared -L/usr/lib/R/lib -Wl,-Bsymbolic-functions -flto=auto -ffat-lto-objects -Wl,-z,relro -o lattice.so init.o threeDplot.o -L/usr/lib/R/lib -lR installing to /home/omnipath/local/R/4.4-3.20/00LOCK-lattice/00new/lattice/libs ** R ** data *** moving datasets to lazyload DB ** demo ** inst ** byte-compile and prepare package for lazy loading ** help *** installing help indices ** building package indices ** installing vignettes ** testing if installed package can be loaded from temporary location ** checking absolute paths in shared objects and dynamic libraries ** testing if installed package can be loaded from final location ** testing if installed package keeps a record of temporary installation path * DONE (lattice) * installing *source* package ‘nnet’ ... ** package ‘nnet’ successfully unpacked and MD5 sums checked ** using staged installation ** libs using C compiler: ‘gcc (Ubuntu 13.2.0-23ubuntu4) 13.2.0’ gcc -I"/usr/share/R/include" -DNDEBUG -fpic -g -O2 -fno-omit-frame-pointer -mno-omit-leaf-frame-pointer -ffile-prefix-map=/build/r-base-EawLoD/r-base-4.4.1=. -fstack-protector-strong -fstack-clash-protection -Wformat -Werror=format-security -fcf-protection -fdebug-prefix-map=/build/r-base-EawLoD/r-base-4.4.1=/usr/src/r-base-4.4.1-1.2404.0 -Wdate-time -D_FORTIFY_SOURCE=3 -c nnet.c -o nnet.o gcc -shared -L/usr/lib/R/lib -Wl,-Bsymbolic-functions -flto=auto -ffat-lto-objects -Wl,-z,relro -o nnet.so nnet.o -L/usr/lib/R/lib -lR installing to /home/omnipath/local/R/4.4-3.20/00LOCK-nnet/00new/nnet/libs ** R ** inst ** byte-compile and prepare package for lazy loading ** help *** installing help indices ** building package indices ** testing if installed package can be loaded from temporary location ** checking absolute paths in shared objects and dynamic libraries ** testing if installed package can be loaded from final location ** testing if installed package keeps a record of temporary installation path * DONE (nnet) * installing *source* package ‘nlme’ ... ** package ‘nlme’ successfully unpacked and MD5 sums checked ** using staged installation ** libs using C compiler: ‘gcc (Ubuntu 13.2.0-23ubuntu4) 13.2.0’ using Fortran compiler: ‘GNU Fortran (Ubuntu 13.2.0-23ubuntu4) 13.2.0’ gfortran -fpic -g -O2 -fno-omit-frame-pointer -mno-omit-leaf-frame-pointer -ffile-prefix-map=/build/r-base-EawLoD/r-base-4.4.1=. -fstack-protector-strong -fstack-clash-protection -fcf-protection -fdebug-prefix-map=/build/r-base-EawLoD/r-base-4.4.1=/usr/src/r-base-4.4.1-1.2404.0 -c chol.f -o chol.o gcc -I"/usr/share/R/include" -DNDEBUG -fvisibility=hidden -fpic -g -O2 -fno-omit-frame-pointer -mno-omit-leaf-frame-pointer -ffile-prefix-map=/build/r-base-EawLoD/r-base-4.4.1=. -fstack-protector-strong -fstack-clash-protection -Wformat -Werror=format-security -fcf-protection -fdebug-prefix-map=/build/r-base-EawLoD/r-base-4.4.1=/usr/src/r-base-4.4.1-1.2404.0 -Wdate-time -D_FORTIFY_SOURCE=3 -c corStruct.c -o corStruct.o gcc -I"/usr/share/R/include" -DNDEBUG -fvisibility=hidden -fpic -g -O2 -fno-omit-frame-pointer -mno-omit-leaf-frame-pointer -ffile-prefix-map=/build/r-base-EawLoD/r-base-4.4.1=. -fstack-protector-strong -fstack-clash-protection -Wformat -Werror=format-security -fcf-protection -fdebug-prefix-map=/build/r-base-EawLoD/r-base-4.4.1=/usr/src/r-base-4.4.1-1.2404.0 -Wdate-time -D_FORTIFY_SOURCE=3 -c gnls.c -o gnls.o gcc -I"/usr/share/R/include" -DNDEBUG -fvisibility=hidden -fpic -g -O2 -fno-omit-frame-pointer -mno-omit-leaf-frame-pointer -ffile-prefix-map=/build/r-base-EawLoD/r-base-4.4.1=. -fstack-protector-strong -fstack-clash-protection -Wformat -Werror=format-security -fcf-protection -fdebug-prefix-map=/build/r-base-EawLoD/r-base-4.4.1=/usr/src/r-base-4.4.1-1.2404.0 -Wdate-time -D_FORTIFY_SOURCE=3 -c init.c -o init.o gcc -I"/usr/share/R/include" -DNDEBUG -fvisibility=hidden -fpic -g -O2 -fno-omit-frame-pointer -mno-omit-leaf-frame-pointer -ffile-prefix-map=/build/r-base-EawLoD/r-base-4.4.1=. -fstack-protector-strong -fstack-clash-protection -Wformat -Werror=format-security -fcf-protection -fdebug-prefix-map=/build/r-base-EawLoD/r-base-4.4.1=/usr/src/r-base-4.4.1-1.2404.0 -Wdate-time -D_FORTIFY_SOURCE=3 -c matrix.c -o matrix.o gcc -I"/usr/share/R/include" -DNDEBUG -fvisibility=hidden -fpic -g -O2 -fno-omit-frame-pointer -mno-omit-leaf-frame-pointer -ffile-prefix-map=/build/r-base-EawLoD/r-base-4.4.1=. -fstack-protector-strong -fstack-clash-protection -Wformat -Werror=format-security -fcf-protection -fdebug-prefix-map=/build/r-base-EawLoD/r-base-4.4.1=/usr/src/r-base-4.4.1-1.2404.0 -Wdate-time -D_FORTIFY_SOURCE=3 -c nlOptimizer.c -o nlOptimizer.o gcc -I"/usr/share/R/include" -DNDEBUG -fvisibility=hidden -fpic -g -O2 -fno-omit-frame-pointer -mno-omit-leaf-frame-pointer -ffile-prefix-map=/build/r-base-EawLoD/r-base-4.4.1=. -fstack-protector-strong -fstack-clash-protection -Wformat -Werror=format-security -fcf-protection -fdebug-prefix-map=/build/r-base-EawLoD/r-base-4.4.1=/usr/src/r-base-4.4.1-1.2404.0 -Wdate-time -D_FORTIFY_SOURCE=3 -c nlme.c -o nlme.o gcc -I"/usr/share/R/include" -DNDEBUG -fvisibility=hidden -fpic -g -O2 -fno-omit-frame-pointer -mno-omit-leaf-frame-pointer -ffile-prefix-map=/build/r-base-EawLoD/r-base-4.4.1=. -fstack-protector-strong -fstack-clash-protection -Wformat -Werror=format-security -fcf-protection -fdebug-prefix-map=/build/r-base-EawLoD/r-base-4.4.1=/usr/src/r-base-4.4.1-1.2404.0 -Wdate-time -D_FORTIFY_SOURCE=3 -c nlmefit.c -o nlmefit.o gcc -I"/usr/share/R/include" -DNDEBUG -fvisibility=hidden -fpic -g -O2 -fno-omit-frame-pointer -mno-omit-leaf-frame-pointer -ffile-prefix-map=/build/r-base-EawLoD/r-base-4.4.1=. -fstack-protector-strong -fstack-clash-protection -Wformat -Werror=format-security -fcf-protection -fdebug-prefix-map=/build/r-base-EawLoD/r-base-4.4.1=/usr/src/r-base-4.4.1-1.2404.0 -Wdate-time -D_FORTIFY_SOURCE=3 -c pdMat.c -o pdMat.o gcc -I"/usr/share/R/include" -DNDEBUG -fvisibility=hidden -fpic -g -O2 -fno-omit-frame-pointer -mno-omit-leaf-frame-pointer -ffile-prefix-map=/build/r-base-EawLoD/r-base-4.4.1=. -fstack-protector-strong -fstack-clash-protection -Wformat -Werror=format-security -fcf-protection -fdebug-prefix-map=/build/r-base-EawLoD/r-base-4.4.1=/usr/src/r-base-4.4.1-1.2404.0 -Wdate-time -D_FORTIFY_SOURCE=3 -c pythag.c -o pythag.o gfortran -fpic -g -O2 -fno-omit-frame-pointer -mno-omit-leaf-frame-pointer -ffile-prefix-map=/build/r-base-EawLoD/r-base-4.4.1=. -fstack-protector-strong -fstack-clash-protection -fcf-protection -fdebug-prefix-map=/build/r-base-EawLoD/r-base-4.4.1=/usr/src/r-base-4.4.1-1.2404.0 -c rs.f -o rs.o gcc -shared -L/usr/lib/R/lib -Wl,-Bsymbolic-functions -flto=auto -ffat-lto-objects -Wl,-z,relro -o nlme.so chol.o corStruct.o gnls.o init.o matrix.o nlOptimizer.o nlme.o nlmefit.o pdMat.o pythag.o rs.o -lgfortran -lm -lquadmath -L/usr/lib/R/lib -lR installing to /home/omnipath/local/R/4.4-3.20/00LOCK-nlme/00new/nlme/libs ** R ** data *** moving datasets to lazyload DB ** inst ** byte-compile and prepare package for lazy loading ** help *** installing help indices ** building package indices ** testing if installed package can be loaded from temporary location ** checking absolute paths in shared objects and dynamic libraries ** testing if installed package can be loaded from final location ** testing if installed package keeps a record of temporary installation path * DONE (nlme) * installing *source* package ‘mgcv’ ... ** package ‘mgcv’ successfully unpacked and MD5 sums checked ** using staged installation ** libs using C compiler: ‘gcc (Ubuntu 13.2.0-23ubuntu4) 13.2.0’ gcc -I"/usr/share/R/include" -DNDEBUG -fopenmp -fpic -g -O2 -fno-omit-frame-pointer -mno-omit-leaf-frame-pointer -ffile-prefix-map=/build/r-base-EawLoD/r-base-4.4.1=. -fstack-protector-strong -fstack-clash-protection -Wformat -Werror=format-security -fcf-protection -fdebug-prefix-map=/build/r-base-EawLoD/r-base-4.4.1=/usr/src/r-base-4.4.1-1.2404.0 -Wdate-time -D_FORTIFY_SOURCE=3 -c coxph.c -o coxph.o gcc -I"/usr/share/R/include" -DNDEBUG -fopenmp -fpic -g -O2 -fno-omit-frame-pointer -mno-omit-leaf-frame-pointer -ffile-prefix-map=/build/r-base-EawLoD/r-base-4.4.1=. -fstack-protector-strong -fstack-clash-protection -Wformat -Werror=format-security -fcf-protection -fdebug-prefix-map=/build/r-base-EawLoD/r-base-4.4.1=/usr/src/r-base-4.4.1-1.2404.0 -Wdate-time -D_FORTIFY_SOURCE=3 -c davies.c -o davies.o gcc -I"/usr/share/R/include" -DNDEBUG -fopenmp -fpic -g -O2 -fno-omit-frame-pointer -mno-omit-leaf-frame-pointer -ffile-prefix-map=/build/r-base-EawLoD/r-base-4.4.1=. -fstack-protector-strong -fstack-clash-protection -Wformat -Werror=format-security -fcf-protection -fdebug-prefix-map=/build/r-base-EawLoD/r-base-4.4.1=/usr/src/r-base-4.4.1-1.2404.0 -Wdate-time -D_FORTIFY_SOURCE=3 -c discrete.c -o discrete.o gcc -I"/usr/share/R/include" -DNDEBUG -fopenmp -fpic -g -O2 -fno-omit-frame-pointer -mno-omit-leaf-frame-pointer -ffile-prefix-map=/build/r-base-EawLoD/r-base-4.4.1=. -fstack-protector-strong -fstack-clash-protection -Wformat -Werror=format-security -fcf-protection -fdebug-prefix-map=/build/r-base-EawLoD/r-base-4.4.1=/usr/src/r-base-4.4.1-1.2404.0 -Wdate-time -D_FORTIFY_SOURCE=3 -c gdi.c -o gdi.o gcc -I"/usr/share/R/include" -DNDEBUG -fopenmp -fpic -g -O2 -fno-omit-frame-pointer -mno-omit-leaf-frame-pointer -ffile-prefix-map=/build/r-base-EawLoD/r-base-4.4.1=. -fstack-protector-strong -fstack-clash-protection -Wformat -Werror=format-security -fcf-protection -fdebug-prefix-map=/build/r-base-EawLoD/r-base-4.4.1=/usr/src/r-base-4.4.1-1.2404.0 -Wdate-time -D_FORTIFY_SOURCE=3 -c init.c -o init.o gcc -I"/usr/share/R/include" -DNDEBUG -fopenmp -fpic -g -O2 -fno-omit-frame-pointer -mno-omit-leaf-frame-pointer -ffile-prefix-map=/build/r-base-EawLoD/r-base-4.4.1=. -fstack-protector-strong -fstack-clash-protection -Wformat -Werror=format-security -fcf-protection -fdebug-prefix-map=/build/r-base-EawLoD/r-base-4.4.1=/usr/src/r-base-4.4.1-1.2404.0 -Wdate-time -D_FORTIFY_SOURCE=3 -c magic.c -o magic.o gcc -I"/usr/share/R/include" -DNDEBUG -fopenmp -fpic -g -O2 -fno-omit-frame-pointer -mno-omit-leaf-frame-pointer -ffile-prefix-map=/build/r-base-EawLoD/r-base-4.4.1=. -fstack-protector-strong -fstack-clash-protection -Wformat -Werror=format-security -fcf-protection -fdebug-prefix-map=/build/r-base-EawLoD/r-base-4.4.1=/usr/src/r-base-4.4.1-1.2404.0 -Wdate-time -D_FORTIFY_SOURCE=3 -c mat.c -o mat.o gcc -I"/usr/share/R/include" -DNDEBUG -fopenmp -fpic -g -O2 -fno-omit-frame-pointer -mno-omit-leaf-frame-pointer -ffile-prefix-map=/build/r-base-EawLoD/r-base-4.4.1=. -fstack-protector-strong -fstack-clash-protection -Wformat -Werror=format-security -fcf-protection -fdebug-prefix-map=/build/r-base-EawLoD/r-base-4.4.1=/usr/src/r-base-4.4.1-1.2404.0 -Wdate-time -D_FORTIFY_SOURCE=3 -c matrix.c -o matrix.o gcc -I"/usr/share/R/include" -DNDEBUG -fopenmp -fpic -g -O2 -fno-omit-frame-pointer -mno-omit-leaf-frame-pointer -ffile-prefix-map=/build/r-base-EawLoD/r-base-4.4.1=. -fstack-protector-strong -fstack-clash-protection -Wformat -Werror=format-security -fcf-protection -fdebug-prefix-map=/build/r-base-EawLoD/r-base-4.4.1=/usr/src/r-base-4.4.1-1.2404.0 -Wdate-time -D_FORTIFY_SOURCE=3 -c mgcv.c -o mgcv.o gcc -I"/usr/share/R/include" -DNDEBUG -fopenmp -fpic -g -O2 -fno-omit-frame-pointer -mno-omit-leaf-frame-pointer -ffile-prefix-map=/build/r-base-EawLoD/r-base-4.4.1=. -fstack-protector-strong -fstack-clash-protection -Wformat -Werror=format-security -fcf-protection -fdebug-prefix-map=/build/r-base-EawLoD/r-base-4.4.1=/usr/src/r-base-4.4.1-1.2404.0 -Wdate-time -D_FORTIFY_SOURCE=3 -c misc.c -o misc.o gcc -I"/usr/share/R/include" -DNDEBUG -fopenmp -fpic -g -O2 -fno-omit-frame-pointer -mno-omit-leaf-frame-pointer -ffile-prefix-map=/build/r-base-EawLoD/r-base-4.4.1=. -fstack-protector-strong -fstack-clash-protection -Wformat -Werror=format-security -fcf-protection -fdebug-prefix-map=/build/r-base-EawLoD/r-base-4.4.1=/usr/src/r-base-4.4.1-1.2404.0 -Wdate-time -D_FORTIFY_SOURCE=3 -c mvn.c -o mvn.o gcc -I"/usr/share/R/include" -DNDEBUG -fopenmp -fpic -g -O2 -fno-omit-frame-pointer -mno-omit-leaf-frame-pointer -ffile-prefix-map=/build/r-base-EawLoD/r-base-4.4.1=. -fstack-protector-strong -fstack-clash-protection -Wformat -Werror=format-security -fcf-protection -fdebug-prefix-map=/build/r-base-EawLoD/r-base-4.4.1=/usr/src/r-base-4.4.1-1.2404.0 -Wdate-time -D_FORTIFY_SOURCE=3 -c ncv.c -o ncv.o gcc -I"/usr/share/R/include" -DNDEBUG -fopenmp -fpic -g -O2 -fno-omit-frame-pointer -mno-omit-leaf-frame-pointer -ffile-prefix-map=/build/r-base-EawLoD/r-base-4.4.1=. -fstack-protector-strong -fstack-clash-protection -Wformat -Werror=format-security -fcf-protection -fdebug-prefix-map=/build/r-base-EawLoD/r-base-4.4.1=/usr/src/r-base-4.4.1-1.2404.0 -Wdate-time -D_FORTIFY_SOURCE=3 -c qp.c -o qp.o gcc -I"/usr/share/R/include" -DNDEBUG -fopenmp -fpic -g -O2 -fno-omit-frame-pointer -mno-omit-leaf-frame-pointer -ffile-prefix-map=/build/r-base-EawLoD/r-base-4.4.1=. -fstack-protector-strong -fstack-clash-protection -Wformat -Werror=format-security -fcf-protection -fdebug-prefix-map=/build/r-base-EawLoD/r-base-4.4.1=/usr/src/r-base-4.4.1-1.2404.0 -Wdate-time -D_FORTIFY_SOURCE=3 -c soap.c -o soap.o gcc -I"/usr/share/R/include" -DNDEBUG -fopenmp -fpic -g -O2 -fno-omit-frame-pointer -mno-omit-leaf-frame-pointer -ffile-prefix-map=/build/r-base-EawLoD/r-base-4.4.1=. -fstack-protector-strong -fstack-clash-protection -Wformat -Werror=format-security -fcf-protection -fdebug-prefix-map=/build/r-base-EawLoD/r-base-4.4.1=/usr/src/r-base-4.4.1-1.2404.0 -Wdate-time -D_FORTIFY_SOURCE=3 -c sparse-smooth.c -o sparse-smooth.o gcc -I"/usr/share/R/include" -DNDEBUG -fopenmp -fpic -g -O2 -fno-omit-frame-pointer -mno-omit-leaf-frame-pointer -ffile-prefix-map=/build/r-base-EawLoD/r-base-4.4.1=. -fstack-protector-strong -fstack-clash-protection -Wformat -Werror=format-security -fcf-protection -fdebug-prefix-map=/build/r-base-EawLoD/r-base-4.4.1=/usr/src/r-base-4.4.1-1.2404.0 -Wdate-time -D_FORTIFY_SOURCE=3 -c sparse.c -o sparse.o gcc -I"/usr/share/R/include" -DNDEBUG -fopenmp -fpic -g -O2 -fno-omit-frame-pointer -mno-omit-leaf-frame-pointer -ffile-prefix-map=/build/r-base-EawLoD/r-base-4.4.1=. -fstack-protector-strong -fstack-clash-protection -Wformat -Werror=format-security -fcf-protection -fdebug-prefix-map=/build/r-base-EawLoD/r-base-4.4.1=/usr/src/r-base-4.4.1-1.2404.0 -Wdate-time -D_FORTIFY_SOURCE=3 -c tprs.c -o tprs.o gcc -shared -L/usr/lib/R/lib -Wl,-Bsymbolic-functions -flto=auto -ffat-lto-objects -Wl,-z,relro -o mgcv.so coxph.o davies.o discrete.o gdi.o init.o magic.o mat.o matrix.o mgcv.o misc.o mvn.o ncv.o qp.o soap.o sparse-smooth.o sparse.o tprs.o -llapack -lblas -lgfortran -lm -lquadmath -fopenmp -L/usr/lib/R/lib -lR installing to /home/omnipath/local/R/4.4-3.20/00LOCK-mgcv/00new/mgcv/libs ** R ** data ** inst ** byte-compile and prepare package for lazy loading ** help *** installing help indices ** building package indices ** testing if installed package can be loaded from temporary location ** 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 (mgcv) The downloaded source packages are in ‘/tmp/RtmpSoQTSW/downloaded_packages’ 'getOption("repos")' replaces Bioconductor standard repositories, see 'help("repositories", package = "BiocManager")' for details. Replacement repositories: CRAN: https://cloud.r-project.org Bioconductor version 3.20 (BiocManager 1.30.23), R 4.4.1 (2024-06-14) Installing package(s) 'BiocCheck' also installing the dependencies ‘fastmap’, ‘utf8’, ‘bit’, ‘cachem’, ‘sys’, ‘stringi’, ‘blob’, ‘pillar’, ‘purrr’, ‘tidyr’, ‘tidyselect’, ‘generics’, ‘bit64’, ‘memoise’, ‘pkgconfig’, ‘plogr’, ‘cpp11’, ‘jsonlite’, ‘mime’, ‘BH’, ‘bitops’, ‘ps’, ‘askpass’, ‘stringr’, ‘fansi’, ‘dbplyr’, ‘dplyr’, ‘RSQLite’, ‘DBI’, ‘filelock’, ‘curl’, ‘httr’, ‘Biobase’, ‘RBGL’, ‘XML’, ‘RCurl’, ‘RUnit’, ‘processx’, ‘R6’, ‘BiocGenerics’, ‘glue’, ‘lifecycle’, ‘magrittr’, ‘openssl’, ‘rappdirs’, ‘rlang’, ‘vctrs’, ‘withr’, ‘evaluate’, ‘highr’, ‘xfun’, ‘yaml’, ‘selectr’, ‘tibble’, ‘xml2’, ‘BiocBaseUtils’, ‘BiocFileCache’, ‘biocViews’, ‘callr’, ‘cli’, ‘graph’, ‘httr2’, ‘knitr’, ‘rvest’, ‘stringdist’ trying URL 'https://cloud.r-project.org/src/contrib/fastmap_1.2.0.tar.gz' Content type 'application/x-gzip' length 46710 bytes (45 KB) ================================================== downloaded 45 KB trying URL 'https://cloud.r-project.org/src/contrib/utf8_1.2.4.tar.gz' Content type 'application/x-gzip' length 241081 bytes (235 KB) ================================================== downloaded 235 KB trying URL 'https://cloud.r-project.org/src/contrib/bit_4.0.5.tar.gz' Content type 'application/x-gzip' length 827745 bytes (808 KB) ================================================== downloaded 808 KB trying URL 'https://cloud.r-project.org/src/contrib/cachem_1.1.0.tar.gz' Content type 'application/x-gzip' length 27192 bytes (26 KB) ================================================== downloaded 26 KB trying URL 'https://cloud.r-project.org/src/contrib/sys_3.4.2.tar.gz' Content type 'application/x-gzip' length 20169 bytes (19 KB) ================================================== downloaded 19 KB trying URL 'https://cloud.r-project.org/src/contrib/stringi_1.8.4.tar.gz' Content type 'application/x-gzip' length 11917497 bytes (11.4 MB) ================================================== downloaded 11.4 MB trying URL 'https://cloud.r-project.org/src/contrib/blob_1.2.4.tar.gz' Content type 'application/x-gzip' length 10620 bytes (10 KB) ================================================== downloaded 10 KB trying URL 'https://cloud.r-project.org/src/contrib/pillar_1.9.0.tar.gz' Content type 'application/x-gzip' length 444528 bytes (434 KB) ================================================== downloaded 434 KB trying URL 'https://cloud.r-project.org/src/contrib/purrr_1.0.2.tar.gz' Content type 'application/x-gzip' length 220868 bytes (215 KB) ================================================== downloaded 215 KB trying URL 'https://cloud.r-project.org/src/contrib/tidyr_1.3.1.tar.gz' Content type 'application/x-gzip' length 809058 bytes (790 KB) ================================================== downloaded 790 KB trying URL 'https://cloud.r-project.org/src/contrib/tidyselect_1.2.1.tar.gz' Content type 'application/x-gzip' length 103591 bytes (101 KB) ================================================== downloaded 101 KB trying URL 'https://cloud.r-project.org/src/contrib/generics_0.1.3.tar.gz' Content type 'application/x-gzip' length 172201 bytes (168 KB) ================================================== downloaded 168 KB trying URL 'https://cloud.r-project.org/src/contrib/bit64_4.0.5.tar.gz' Content type 'application/x-gzip' length 135091 bytes (131 KB) ================================================== downloaded 131 KB trying URL 'https://cloud.r-project.org/src/contrib/memoise_2.0.1.tar.gz' Content type 'application/x-gzip' length 17852 bytes (17 KB) ================================================== downloaded 17 KB trying URL 'https://cloud.r-project.org/src/contrib/pkgconfig_2.0.3.tar.gz' Content type 'application/x-gzip' length 6080 bytes ================================================== downloaded 6080 bytes trying URL 'https://cloud.r-project.org/src/contrib/plogr_0.2.0.tar.gz' Content type 'application/x-gzip' length 7795 bytes ================================================== downloaded 7795 bytes trying URL 'https://cloud.r-project.org/src/contrib/cpp11_0.4.7.tar.gz' Content type 'application/x-gzip' length 285779 bytes (279 KB) ================================================== downloaded 279 KB trying URL 'https://cloud.r-project.org/src/contrib/jsonlite_1.8.8.tar.gz' Content type 'application/x-gzip' length 1053028 bytes (1.0 MB) ================================================== downloaded 1.0 MB trying URL 'https://cloud.r-project.org/src/contrib/mime_0.12.tar.gz' Content type 'application/x-gzip' length 12562 bytes (12 KB) ================================================== downloaded 12 KB trying URL 'https://cloud.r-project.org/src/contrib/BH_1.84.0-0.tar.gz' Content type 'application/x-gzip' length 14017751 bytes (13.4 MB) ================================================== downloaded 13.4 MB trying URL 'https://cloud.r-project.org/src/contrib/bitops_1.0-8.tar.gz' Content type 'application/x-gzip' length 10915 bytes (10 KB) ================================================== downloaded 10 KB trying URL 'https://cloud.r-project.org/src/contrib/ps_1.7.7.tar.gz' Content type 'application/x-gzip' length 128844 bytes (125 KB) ================================================== downloaded 125 KB trying URL 'https://cloud.r-project.org/src/contrib/askpass_1.2.0.tar.gz' Content type 'application/x-gzip' length 6040 bytes ================================================== downloaded 6040 bytes trying URL 'https://cloud.r-project.org/src/contrib/stringr_1.5.1.tar.gz' Content type 'application/x-gzip' length 176599 bytes (172 KB) ================================================== downloaded 172 KB trying URL 'https://cloud.r-project.org/src/contrib/fansi_1.0.6.tar.gz' Content type 'application/x-gzip' length 482480 bytes (471 KB) ================================================== downloaded 471 KB trying URL 'https://cloud.r-project.org/src/contrib/dbplyr_2.5.0.tar.gz' Content type 'application/x-gzip' length 770647 bytes (752 KB) ================================================== downloaded 752 KB trying URL 'https://cloud.r-project.org/src/contrib/dplyr_1.1.4.tar.gz' Content type 'application/x-gzip' length 1207521 bytes (1.2 MB) ================================================== downloaded 1.2 MB trying URL 'https://cloud.r-project.org/src/contrib/RSQLite_2.3.7.tar.gz' Content type 'application/x-gzip' length 4268085 bytes (4.1 MB) ================================================== downloaded 4.1 MB trying URL 'https://cloud.r-project.org/src/contrib/DBI_1.2.3.tar.gz' Content type 'application/x-gzip' length 1137307 bytes (1.1 MB) ================================================== downloaded 1.1 MB trying URL 'https://cloud.r-project.org/src/contrib/filelock_1.0.3.tar.gz' Content type 'application/x-gzip' length 15443 bytes (15 KB) ================================================== downloaded 15 KB trying URL 'https://cloud.r-project.org/src/contrib/curl_5.2.1.tar.gz' Content type 'application/x-gzip' length 716695 bytes (699 KB) ================================================== downloaded 699 KB trying URL 'https://cloud.r-project.org/src/contrib/httr_1.4.7.tar.gz' Content type 'application/x-gzip' length 118500 bytes (115 KB) ================================================== downloaded 115 KB trying URL 'https://bioconductor.org/packages/3.20/bioc/src/contrib/Biobase_2.65.0.tar.gz' Content type 'application/x-gzip' length 1795950 bytes (1.7 MB) ================================================== downloaded 1.7 MB trying URL 'https://bioconductor.org/packages/3.20/bioc/src/contrib/RBGL_1.81.0.tar.gz' Content type 'application/x-gzip' length 3076155 bytes (2.9 MB) ================================================== downloaded 2.9 MB trying URL 'https://cloud.r-project.org/src/contrib/XML_3.99-0.17.tar.gz' Content type 'application/x-gzip' length 968686 bytes (945 KB) ================================================== downloaded 945 KB trying URL 'https://cloud.r-project.org/src/contrib/RCurl_1.98-1.16.tar.gz' Content type 'application/x-gzip' length 728943 bytes (711 KB) ================================================== downloaded 711 KB trying URL 'https://cloud.r-project.org/src/contrib/RUnit_0.4.33.tar.gz' Content type 'application/x-gzip' length 430737 bytes (420 KB) ================================================== downloaded 420 KB trying URL 'https://cloud.r-project.org/src/contrib/processx_3.8.4.tar.gz' Content type 'application/x-gzip' length 163983 bytes (160 KB) ================================================== downloaded 160 KB trying URL 'https://cloud.r-project.org/src/contrib/R6_2.5.1.tar.gz' Content type 'application/x-gzip' length 63422 bytes (61 KB) ================================================== downloaded 61 KB trying URL 'https://bioconductor.org/packages/3.20/bioc/src/contrib/BiocGenerics_0.51.0.tar.gz' Content type 'application/x-gzip' length 49520 bytes (48 KB) ================================================== downloaded 48 KB trying URL 'https://cloud.r-project.org/src/contrib/glue_1.7.0.tar.gz' Content type 'application/x-gzip' length 105420 bytes (102 KB) ================================================== downloaded 102 KB trying URL 'https://cloud.r-project.org/src/contrib/lifecycle_1.0.4.tar.gz' Content type 'application/x-gzip' length 107656 bytes (105 KB) ================================================== downloaded 105 KB trying URL 'https://cloud.r-project.org/src/contrib/magrittr_2.0.3.tar.gz' Content type 'application/x-gzip' length 267074 bytes (260 KB) ================================================== downloaded 260 KB trying URL 'https://cloud.r-project.org/src/contrib/openssl_2.2.0.tar.gz' Content type 'application/x-gzip' length 1207404 bytes (1.2 MB) ================================================== downloaded 1.2 MB trying URL 'https://cloud.r-project.org/src/contrib/rappdirs_0.3.3.tar.gz' Content type 'application/x-gzip' length 12288 bytes (12 KB) ================================================== downloaded 12 KB trying URL 'https://cloud.r-project.org/src/contrib/rlang_1.1.4.tar.gz' Content type 'application/x-gzip' length 767041 bytes (749 KB) ================================================== downloaded 749 KB trying URL 'https://cloud.r-project.org/src/contrib/vctrs_0.6.5.tar.gz' Content type 'application/x-gzip' length 969066 bytes (946 KB) ================================================== downloaded 946 KB trying URL 'https://cloud.r-project.org/src/contrib/withr_3.0.1.tar.gz' Content type 'application/x-gzip' length 103375 bytes (100 KB) ================================================== downloaded 100 KB trying URL 'https://cloud.r-project.org/src/contrib/evaluate_0.24.0.tar.gz' Content type 'application/x-gzip' length 28675 bytes (28 KB) ================================================== downloaded 28 KB trying URL 'https://cloud.r-project.org/src/contrib/highr_0.11.tar.gz' Content type 'application/x-gzip' length 13851 bytes (13 KB) ================================================== downloaded 13 KB trying URL 'https://cloud.r-project.org/src/contrib/xfun_0.46.tar.gz' Content type 'application/x-gzip' length 158386 bytes (154 KB) ================================================== downloaded 154 KB trying URL 'https://cloud.r-project.org/src/contrib/yaml_2.3.10.tar.gz' Content type 'application/x-gzip' length 94556 bytes (92 KB) ================================================== downloaded 92 KB trying URL 'https://cloud.r-project.org/src/contrib/selectr_0.4-2.tar.gz' Content type 'application/x-gzip' length 41371 bytes (40 KB) ================================================== downloaded 40 KB trying URL 'https://cloud.r-project.org/src/contrib/tibble_3.2.1.tar.gz' Content type 'application/x-gzip' length 565982 bytes (552 KB) ================================================== downloaded 552 KB trying URL 'https://cloud.r-project.org/src/contrib/xml2_1.3.6.tar.gz' Content type 'application/x-gzip' length 294715 bytes (287 KB) ================================================== downloaded 287 KB trying URL 'https://bioconductor.org/packages/3.20/bioc/src/contrib/BiocBaseUtils_1.7.0.tar.gz' Content type 'application/x-gzip' length 229417 bytes (224 KB) ================================================== downloaded 224 KB trying URL 'https://bioconductor.org/packages/3.20/bioc/src/contrib/BiocFileCache_2.13.0.tar.gz' Content type 'application/x-gzip' length 299496 bytes (292 KB) ================================================== downloaded 292 KB trying URL 'https://bioconductor.org/packages/3.20/bioc/src/contrib/biocViews_1.73.1.tar.gz' Content type 'application/x-gzip' length 521792 bytes (509 KB) ================================================== downloaded 509 KB trying URL 'https://cloud.r-project.org/src/contrib/callr_3.7.6.tar.gz' Content type 'application/x-gzip' length 104358 bytes (101 KB) ================================================== downloaded 101 KB trying URL 'https://cloud.r-project.org/src/contrib/cli_3.6.3.tar.gz' Content type 'application/x-gzip' length 568162 bytes (554 KB) ================================================== downloaded 554 KB trying URL 'https://bioconductor.org/packages/3.20/bioc/src/contrib/graph_1.83.0.tar.gz' Content type 'application/x-gzip' length 1497534 bytes (1.4 MB) ================================================== downloaded 1.4 MB trying URL 'https://cloud.r-project.org/src/contrib/httr2_1.0.2.tar.gz' Content type 'application/x-gzip' length 215147 bytes (210 KB) ================================================== downloaded 210 KB trying URL 'https://cloud.r-project.org/src/contrib/knitr_1.48.tar.gz' Content type 'application/x-gzip' length 583007 bytes (569 KB) ================================================== downloaded 569 KB trying URL 'https://cloud.r-project.org/src/contrib/rvest_1.0.4.tar.gz' Content type 'application/x-gzip' length 115876 bytes (113 KB) ================================================== downloaded 113 KB trying URL 'https://cloud.r-project.org/src/contrib/stringdist_0.9.12.tar.gz' Content type 'application/x-gzip' length 862306 bytes (842 KB) ================================================== downloaded 842 KB trying URL 'https://bioconductor.org/packages/3.20/bioc/src/contrib/BiocCheck_1.41.12.tar.gz' Content type 'application/x-gzip' length 317560 bytes (310 KB) ================================================== downloaded 310 KB * installing *source* package ‘fastmap’ ... ** package ‘fastmap’ successfully unpacked and MD5 sums checked ** using staged installation ** libs using C compiler: ‘gcc (Ubuntu 13.2.0-23ubuntu4) 13.2.0’ using C++ compiler: ‘g++ (Ubuntu 13.2.0-23ubuntu4) 13.2.0’ g++ -std=gnu++17 -I"/usr/share/R/include" -DNDEBUG -Ilib/ -DR_NO_REMAP -fpic -g -O2 -fno-omit-frame-pointer -mno-omit-leaf-frame-pointer -ffile-prefix-map=/build/r-base-EawLoD/r-base-4.4.1=. -fstack-protector-strong -fstack-clash-protection -Wformat -Werror=format-security -fcf-protection -fdebug-prefix-map=/build/r-base-EawLoD/r-base-4.4.1=/usr/src/r-base-4.4.1-1.2404.0 -Wdate-time -D_FORTIFY_SOURCE=3 -c fastmap.cpp -o fastmap.o gcc -I"/usr/share/R/include" -DNDEBUG -Ilib/ -fpic -g -O2 -fno-omit-frame-pointer -mno-omit-leaf-frame-pointer -ffile-prefix-map=/build/r-base-EawLoD/r-base-4.4.1=. -fstack-protector-strong -fstack-clash-protection -Wformat -Werror=format-security -fcf-protection -fdebug-prefix-map=/build/r-base-EawLoD/r-base-4.4.1=/usr/src/r-base-4.4.1-1.2404.0 -Wdate-time -D_FORTIFY_SOURCE=3 -c init.c -o init.o g++ -std=gnu++17 -shared -L/usr/lib/R/lib -Wl,-Bsymbolic-functions -flto=auto -ffat-lto-objects -Wl,-z,relro -o fastmap.so fastmap.o init.o -L/usr/lib/R/lib -lR installing to /home/omnipath/local/R/4.4-3.20/00LOCK-fastmap/00new/fastmap/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 (fastmap) * installing *source* package ‘utf8’ ... ** package ‘utf8’ successfully unpacked and MD5 sums checked ** using staged installation ** libs using C compiler: ‘gcc (Ubuntu 13.2.0-23ubuntu4) 13.2.0’ gcc -I"/usr/share/R/include" -DNDEBUG -Iutf8lite/src -fpic -g -O2 -fno-omit-frame-pointer -mno-omit-leaf-frame-pointer -ffile-prefix-map=/build/r-base-EawLoD/r-base-4.4.1=. -fstack-protector-strong -fstack-clash-protection -Wformat -Werror=format-security -fcf-protection -fdebug-prefix-map=/build/r-base-EawLoD/r-base-4.4.1=/usr/src/r-base-4.4.1-1.2404.0 -Wdate-time -D_FORTIFY_SOURCE=3 -c as_utf8.c -o as_utf8.o gcc -I"/usr/share/R/include" -DNDEBUG -Iutf8lite/src -fpic -g -O2 -fno-omit-frame-pointer -mno-omit-leaf-frame-pointer -ffile-prefix-map=/build/r-base-EawLoD/r-base-4.4.1=. -fstack-protector-strong -fstack-clash-protection -Wformat -Werror=format-security -fcf-protection -fdebug-prefix-map=/build/r-base-EawLoD/r-base-4.4.1=/usr/src/r-base-4.4.1-1.2404.0 -Wdate-time -D_FORTIFY_SOURCE=3 -c bytes.c -o bytes.o gcc -I"/usr/share/R/include" -DNDEBUG -Iutf8lite/src -fpic -g -O2 -fno-omit-frame-pointer -mno-omit-leaf-frame-pointer -ffile-prefix-map=/build/r-base-EawLoD/r-base-4.4.1=. -fstack-protector-strong -fstack-clash-protection -Wformat -Werror=format-security -fcf-protection -fdebug-prefix-map=/build/r-base-EawLoD/r-base-4.4.1=/usr/src/r-base-4.4.1-1.2404.0 -Wdate-time -D_FORTIFY_SOURCE=3 -c context.c -o context.o gcc -I"/usr/share/R/include" -DNDEBUG -Iutf8lite/src -fpic -g -O2 -fno-omit-frame-pointer -mno-omit-leaf-frame-pointer -ffile-prefix-map=/build/r-base-EawLoD/r-base-4.4.1=. -fstack-protector-strong -fstack-clash-protection -Wformat -Werror=format-security -fcf-protection -fdebug-prefix-map=/build/r-base-EawLoD/r-base-4.4.1=/usr/src/r-base-4.4.1-1.2404.0 -Wdate-time -D_FORTIFY_SOURCE=3 -c init.c -o init.o gcc -I"/usr/share/R/include" -DNDEBUG -Iutf8lite/src -fpic -g -O2 -fno-omit-frame-pointer -mno-omit-leaf-frame-pointer -ffile-prefix-map=/build/r-base-EawLoD/r-base-4.4.1=. -fstack-protector-strong -fstack-clash-protection -Wformat -Werror=format-security -fcf-protection -fdebug-prefix-map=/build/r-base-EawLoD/r-base-4.4.1=/usr/src/r-base-4.4.1-1.2404.0 -Wdate-time -D_FORTIFY_SOURCE=3 -c render.c -o render.o gcc -I"/usr/share/R/include" -DNDEBUG -Iutf8lite/src -fpic -g -O2 -fno-omit-frame-pointer -mno-omit-leaf-frame-pointer -ffile-prefix-map=/build/r-base-EawLoD/r-base-4.4.1=. -fstack-protector-strong -fstack-clash-protection -Wformat -Werror=format-security -fcf-protection -fdebug-prefix-map=/build/r-base-EawLoD/r-base-4.4.1=/usr/src/r-base-4.4.1-1.2404.0 -Wdate-time -D_FORTIFY_SOURCE=3 -c render_table.c -o render_table.o gcc -I"/usr/share/R/include" -DNDEBUG -Iutf8lite/src -fpic -g -O2 -fno-omit-frame-pointer -mno-omit-leaf-frame-pointer -ffile-prefix-map=/build/r-base-EawLoD/r-base-4.4.1=. -fstack-protector-strong -fstack-clash-protection -Wformat -Werror=format-security -fcf-protection -fdebug-prefix-map=/build/r-base-EawLoD/r-base-4.4.1=/usr/src/r-base-4.4.1-1.2404.0 -Wdate-time -D_FORTIFY_SOURCE=3 -c string.c -o string.o gcc -I"/usr/share/R/include" -DNDEBUG -Iutf8lite/src -fpic -g -O2 -fno-omit-frame-pointer -mno-omit-leaf-frame-pointer -ffile-prefix-map=/build/r-base-EawLoD/r-base-4.4.1=. -fstack-protector-strong -fstack-clash-protection -Wformat -Werror=format-security -fcf-protection -fdebug-prefix-map=/build/r-base-EawLoD/r-base-4.4.1=/usr/src/r-base-4.4.1-1.2404.0 -Wdate-time -D_FORTIFY_SOURCE=3 -c text.c -o text.o gcc -I"/usr/share/R/include" -DNDEBUG -Iutf8lite/src -fpic -g -O2 -fno-omit-frame-pointer -mno-omit-leaf-frame-pointer -ffile-prefix-map=/build/r-base-EawLoD/r-base-4.4.1=. -fstack-protector-strong -fstack-clash-protection -Wformat -Werror=format-security -fcf-protection -fdebug-prefix-map=/build/r-base-EawLoD/r-base-4.4.1=/usr/src/r-base-4.4.1-1.2404.0 -Wdate-time -D_FORTIFY_SOURCE=3 -c utf8_encode.c -o utf8_encode.o gcc -I"/usr/share/R/include" -DNDEBUG -Iutf8lite/src -fpic -g -O2 -fno-omit-frame-pointer -mno-omit-leaf-frame-pointer -ffile-prefix-map=/build/r-base-EawLoD/r-base-4.4.1=. -fstack-protector-strong -fstack-clash-protection -Wformat -Werror=format-security -fcf-protection -fdebug-prefix-map=/build/r-base-EawLoD/r-base-4.4.1=/usr/src/r-base-4.4.1-1.2404.0 -Wdate-time -D_FORTIFY_SOURCE=3 -c utf8_format.c -o utf8_format.o gcc -I"/usr/share/R/include" -DNDEBUG -Iutf8lite/src -fpic -g -O2 -fno-omit-frame-pointer -mno-omit-leaf-frame-pointer -ffile-prefix-map=/build/r-base-EawLoD/r-base-4.4.1=. -fstack-protector-strong -fstack-clash-protection -Wformat -Werror=format-security -fcf-protection -fdebug-prefix-map=/build/r-base-EawLoD/r-base-4.4.1=/usr/src/r-base-4.4.1-1.2404.0 -Wdate-time -D_FORTIFY_SOURCE=3 -c utf8_normalize.c -o utf8_normalize.o gcc -I"/usr/share/R/include" -DNDEBUG -Iutf8lite/src -fpic -g -O2 -fno-omit-frame-pointer -mno-omit-leaf-frame-pointer -ffile-prefix-map=/build/r-base-EawLoD/r-base-4.4.1=. -fstack-protector-strong -fstack-clash-protection -Wformat -Werror=format-security -fcf-protection -fdebug-prefix-map=/build/r-base-EawLoD/r-base-4.4.1=/usr/src/r-base-4.4.1-1.2404.0 -Wdate-time -D_FORTIFY_SOURCE=3 -c utf8_valid.c -o utf8_valid.o gcc -I"/usr/share/R/include" -DNDEBUG -Iutf8lite/src -fpic -g -O2 -fno-omit-frame-pointer -mno-omit-leaf-frame-pointer -ffile-prefix-map=/build/r-base-EawLoD/r-base-4.4.1=. -fstack-protector-strong -fstack-clash-protection -Wformat -Werror=format-security -fcf-protection -fdebug-prefix-map=/build/r-base-EawLoD/r-base-4.4.1=/usr/src/r-base-4.4.1-1.2404.0 -Wdate-time -D_FORTIFY_SOURCE=3 -c utf8_width.c -o utf8_width.o gcc -I"/usr/share/R/include" -DNDEBUG -Iutf8lite/src -fpic -g -O2 -fno-omit-frame-pointer -mno-omit-leaf-frame-pointer -ffile-prefix-map=/build/r-base-EawLoD/r-base-4.4.1=. -fstack-protector-strong -fstack-clash-protection -Wformat -Werror=format-security -fcf-protection -fdebug-prefix-map=/build/r-base-EawLoD/r-base-4.4.1=/usr/src/r-base-4.4.1-1.2404.0 -Wdate-time -D_FORTIFY_SOURCE=3 -c util.c -o util.o gcc -I"/usr/share/R/include" -DNDEBUG -Iutf8lite/src -fpic -g -O2 -fno-omit-frame-pointer -mno-omit-leaf-frame-pointer -ffile-prefix-map=/build/r-base-EawLoD/r-base-4.4.1=. -fstack-protector-strong -fstack-clash-protection -Wformat -Werror=format-security -fcf-protection -fdebug-prefix-map=/build/r-base-EawLoD/r-base-4.4.1=/usr/src/r-base-4.4.1-1.2404.0 -Wdate-time -D_FORTIFY_SOURCE=3 -c utf8lite/src/array.c -o utf8lite/src/array.o gcc -I"/usr/share/R/include" -DNDEBUG -Iutf8lite/src -fpic -g -O2 -fno-omit-frame-pointer -mno-omit-leaf-frame-pointer -ffile-prefix-map=/build/r-base-EawLoD/r-base-4.4.1=. -fstack-protector-strong -fstack-clash-protection -Wformat -Werror=format-security -fcf-protection -fdebug-prefix-map=/build/r-base-EawLoD/r-base-4.4.1=/usr/src/r-base-4.4.1-1.2404.0 -Wdate-time -D_FORTIFY_SOURCE=3 -c utf8lite/src/char.c -o utf8lite/src/char.o gcc -I"/usr/share/R/include" -DNDEBUG -Iutf8lite/src -fpic -g -O2 -fno-omit-frame-pointer -mno-omit-leaf-frame-pointer -ffile-prefix-map=/build/r-base-EawLoD/r-base-4.4.1=. -fstack-protector-strong -fstack-clash-protection -Wformat -Werror=format-security -fcf-protection -fdebug-prefix-map=/build/r-base-EawLoD/r-base-4.4.1=/usr/src/r-base-4.4.1-1.2404.0 -Wdate-time -D_FORTIFY_SOURCE=3 -c utf8lite/src/encode.c -o utf8lite/src/encode.o gcc -I"/usr/share/R/include" -DNDEBUG -Iutf8lite/src -fpic -g -O2 -fno-omit-frame-pointer -mno-omit-leaf-frame-pointer -ffile-prefix-map=/build/r-base-EawLoD/r-base-4.4.1=. -fstack-protector-strong -fstack-clash-protection -Wformat -Werror=format-security -fcf-protection -fdebug-prefix-map=/build/r-base-EawLoD/r-base-4.4.1=/usr/src/r-base-4.4.1-1.2404.0 -Wdate-time -D_FORTIFY_SOURCE=3 -c utf8lite/src/error.c -o utf8lite/src/error.o gcc -I"/usr/share/R/include" -DNDEBUG -Iutf8lite/src -fpic -g -O2 -fno-omit-frame-pointer -mno-omit-leaf-frame-pointer -ffile-prefix-map=/build/r-base-EawLoD/r-base-4.4.1=. -fstack-protector-strong -fstack-clash-protection -Wformat -Werror=format-security -fcf-protection -fdebug-prefix-map=/build/r-base-EawLoD/r-base-4.4.1=/usr/src/r-base-4.4.1-1.2404.0 -Wdate-time -D_FORTIFY_SOURCE=3 -c utf8lite/src/escape.c -o utf8lite/src/escape.o gcc -I"/usr/share/R/include" -DNDEBUG -Iutf8lite/src -fpic -g -O2 -fno-omit-frame-pointer -mno-omit-leaf-frame-pointer -ffile-prefix-map=/build/r-base-EawLoD/r-base-4.4.1=. -fstack-protector-strong -fstack-clash-protection -Wformat -Werror=format-security -fcf-protection -fdebug-prefix-map=/build/r-base-EawLoD/r-base-4.4.1=/usr/src/r-base-4.4.1-1.2404.0 -Wdate-time -D_FORTIFY_SOURCE=3 -c utf8lite/src/graph.c -o utf8lite/src/graph.o gcc -I"/usr/share/R/include" -DNDEBUG -Iutf8lite/src -fpic -g -O2 -fno-omit-frame-pointer -mno-omit-leaf-frame-pointer -ffile-prefix-map=/build/r-base-EawLoD/r-base-4.4.1=. -fstack-protector-strong -fstack-clash-protection -Wformat -Werror=format-security -fcf-protection -fdebug-prefix-map=/build/r-base-EawLoD/r-base-4.4.1=/usr/src/r-base-4.4.1-1.2404.0 -Wdate-time -D_FORTIFY_SOURCE=3 -c utf8lite/src/graphscan.c -o utf8lite/src/graphscan.o gcc -I"/usr/share/R/include" -DNDEBUG -Iutf8lite/src -fpic -g -O2 -fno-omit-frame-pointer -mno-omit-leaf-frame-pointer -ffile-prefix-map=/build/r-base-EawLoD/r-base-4.4.1=. -fstack-protector-strong -fstack-clash-protection -Wformat -Werror=format-security -fcf-protection -fdebug-prefix-map=/build/r-base-EawLoD/r-base-4.4.1=/usr/src/r-base-4.4.1-1.2404.0 -Wdate-time -D_FORTIFY_SOURCE=3 -c utf8lite/src/normalize.c -o utf8lite/src/normalize.o gcc -I"/usr/share/R/include" -DNDEBUG -Iutf8lite/src -fpic -g -O2 -fno-omit-frame-pointer -mno-omit-leaf-frame-pointer -ffile-prefix-map=/build/r-base-EawLoD/r-base-4.4.1=. -fstack-protector-strong -fstack-clash-protection -Wformat -Werror=format-security -fcf-protection -fdebug-prefix-map=/build/r-base-EawLoD/r-base-4.4.1=/usr/src/r-base-4.4.1-1.2404.0 -Wdate-time -D_FORTIFY_SOURCE=3 -c utf8lite/src/render.c -o utf8lite/src/render.o gcc -I"/usr/share/R/include" -DNDEBUG -Iutf8lite/src -fpic -g -O2 -fno-omit-frame-pointer -mno-omit-leaf-frame-pointer -ffile-prefix-map=/build/r-base-EawLoD/r-base-4.4.1=. -fstack-protector-strong -fstack-clash-protection -Wformat -Werror=format-security -fcf-protection -fdebug-prefix-map=/build/r-base-EawLoD/r-base-4.4.1=/usr/src/r-base-4.4.1-1.2404.0 -Wdate-time -D_FORTIFY_SOURCE=3 -c utf8lite/src/text.c -o utf8lite/src/text.o gcc -I"/usr/share/R/include" -DNDEBUG -Iutf8lite/src -fpic -g -O2 -fno-omit-frame-pointer -mno-omit-leaf-frame-pointer -ffile-prefix-map=/build/r-base-EawLoD/r-base-4.4.1=. -fstack-protector-strong -fstack-clash-protection -Wformat -Werror=format-security -fcf-protection -fdebug-prefix-map=/build/r-base-EawLoD/r-base-4.4.1=/usr/src/r-base-4.4.1-1.2404.0 -Wdate-time -D_FORTIFY_SOURCE=3 -c utf8lite/src/textassign.c -o utf8lite/src/textassign.o gcc -I"/usr/share/R/include" -DNDEBUG -Iutf8lite/src -fpic -g -O2 -fno-omit-frame-pointer -mno-omit-leaf-frame-pointer -ffile-prefix-map=/build/r-base-EawLoD/r-base-4.4.1=. -fstack-protector-strong -fstack-clash-protection -Wformat -Werror=format-security -fcf-protection -fdebug-prefix-map=/build/r-base-EawLoD/r-base-4.4.1=/usr/src/r-base-4.4.1-1.2404.0 -Wdate-time -D_FORTIFY_SOURCE=3 -c utf8lite/src/textiter.c -o utf8lite/src/textiter.o gcc -I"/usr/share/R/include" -DNDEBUG -Iutf8lite/src -fpic -g -O2 -fno-omit-frame-pointer -mno-omit-leaf-frame-pointer -ffile-prefix-map=/build/r-base-EawLoD/r-base-4.4.1=. -fstack-protector-strong -fstack-clash-protection -Wformat -Werror=format-security -fcf-protection -fdebug-prefix-map=/build/r-base-EawLoD/r-base-4.4.1=/usr/src/r-base-4.4.1-1.2404.0 -Wdate-time -D_FORTIFY_SOURCE=3 -c utf8lite/src/textmap.c -o utf8lite/src/textmap.o ar rcs libcutf8lite.a utf8lite/src/array.o utf8lite/src/char.o utf8lite/src/encode.o utf8lite/src/error.o utf8lite/src/escape.o utf8lite/src/graph.o utf8lite/src/graphscan.o utf8lite/src/normalize.o utf8lite/src/render.o utf8lite/src/text.o utf8lite/src/textassign.o utf8lite/src/textiter.o utf8lite/src/textmap.o gcc -shared -L/usr/lib/R/lib -Wl,-Bsymbolic-functions -flto=auto -ffat-lto-objects -Wl,-z,relro -o utf8.so as_utf8.o bytes.o context.o init.o render.o render_table.o string.o text.o utf8_encode.o utf8_format.o utf8_normalize.o utf8_valid.o utf8_width.o util.o -L. -lcutf8lite -L/usr/lib/R/lib -lR installing to /home/omnipath/local/R/4.4-3.20/00LOCK-utf8/00new/utf8/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 (utf8) * installing *source* package ‘bit’ ... ** package ‘bit’ successfully unpacked and MD5 sums checked ** using staged installation ** libs using C compiler: ‘gcc (Ubuntu 13.2.0-23ubuntu4) 13.2.0’ gcc -I"/usr/share/R/include" -DNDEBUG -fpic -g -O2 -fno-omit-frame-pointer -mno-omit-leaf-frame-pointer -ffile-prefix-map=/build/r-base-EawLoD/r-base-4.4.1=. -fstack-protector-strong -fstack-clash-protection -Wformat -Werror=format-security -fcf-protection -fdebug-prefix-map=/build/r-base-EawLoD/r-base-4.4.1=/usr/src/r-base-4.4.1-1.2404.0 -Wdate-time -D_FORTIFY_SOURCE=3 -c attrutil.c -o attrutil.o gcc -I"/usr/share/R/include" -DNDEBUG -fpic -g -O2 -fno-omit-frame-pointer -mno-omit-leaf-frame-pointer -ffile-prefix-map=/build/r-base-EawLoD/r-base-4.4.1=. -fstack-protector-strong -fstack-clash-protection -Wformat -Werror=format-security -fcf-protection -fdebug-prefix-map=/build/r-base-EawLoD/r-base-4.4.1=/usr/src/r-base-4.4.1-1.2404.0 -Wdate-time -D_FORTIFY_SOURCE=3 -c bit.c -o bit.o gcc -I"/usr/share/R/include" -DNDEBUG -fpic -g -O2 -fno-omit-frame-pointer -mno-omit-leaf-frame-pointer -ffile-prefix-map=/build/r-base-EawLoD/r-base-4.4.1=. -fstack-protector-strong -fstack-clash-protection -Wformat -Werror=format-security -fcf-protection -fdebug-prefix-map=/build/r-base-EawLoD/r-base-4.4.1=/usr/src/r-base-4.4.1-1.2404.0 -Wdate-time -D_FORTIFY_SOURCE=3 -c chunkutil.c -o chunkutil.o gcc -I"/usr/share/R/include" -DNDEBUG -fpic -g -O2 -fno-omit-frame-pointer -mno-omit-leaf-frame-pointer -ffile-prefix-map=/build/r-base-EawLoD/r-base-4.4.1=. -fstack-protector-strong -fstack-clash-protection -Wformat -Werror=format-security -fcf-protection -fdebug-prefix-map=/build/r-base-EawLoD/r-base-4.4.1=/usr/src/r-base-4.4.1-1.2404.0 -Wdate-time -D_FORTIFY_SOURCE=3 -c clone.c -o clone.o gcc -I"/usr/share/R/include" -DNDEBUG -fpic -g -O2 -fno-omit-frame-pointer -mno-omit-leaf-frame-pointer -ffile-prefix-map=/build/r-base-EawLoD/r-base-4.4.1=. -fstack-protector-strong -fstack-clash-protection -Wformat -Werror=format-security -fcf-protection -fdebug-prefix-map=/build/r-base-EawLoD/r-base-4.4.1=/usr/src/r-base-4.4.1-1.2404.0 -Wdate-time -D_FORTIFY_SOURCE=3 -c init.c -o init.o gcc -I"/usr/share/R/include" -DNDEBUG -fpic -g -O2 -fno-omit-frame-pointer -mno-omit-leaf-frame-pointer -ffile-prefix-map=/build/r-base-EawLoD/r-base-4.4.1=. -fstack-protector-strong -fstack-clash-protection -Wformat -Werror=format-security -fcf-protection -fdebug-prefix-map=/build/r-base-EawLoD/r-base-4.4.1=/usr/src/r-base-4.4.1-1.2404.0 -Wdate-time -D_FORTIFY_SOURCE=3 -c integerutil.c -o integerutil.o gcc -I"/usr/share/R/include" -DNDEBUG -fpic -g -O2 -fno-omit-frame-pointer -mno-omit-leaf-frame-pointer -ffile-prefix-map=/build/r-base-EawLoD/r-base-4.4.1=. -fstack-protector-strong -fstack-clash-protection -Wformat -Werror=format-security -fcf-protection -fdebug-prefix-map=/build/r-base-EawLoD/r-base-4.4.1=/usr/src/r-base-4.4.1-1.2404.0 -Wdate-time -D_FORTIFY_SOURCE=3 -c merge.c -o merge.o gcc -I"/usr/share/R/include" -DNDEBUG -fpic -g -O2 -fno-omit-frame-pointer -mno-omit-leaf-frame-pointer -ffile-prefix-map=/build/r-base-EawLoD/r-base-4.4.1=. -fstack-protector-strong -fstack-clash-protection -Wformat -Werror=format-security -fcf-protection -fdebug-prefix-map=/build/r-base-EawLoD/r-base-4.4.1=/usr/src/r-base-4.4.1-1.2404.0 -Wdate-time -D_FORTIFY_SOURCE=3 -c rle.c -o rle.o gcc -I"/usr/share/R/include" -DNDEBUG -fpic -g -O2 -fno-omit-frame-pointer -mno-omit-leaf-frame-pointer -ffile-prefix-map=/build/r-base-EawLoD/r-base-4.4.1=. -fstack-protector-strong -fstack-clash-protection -Wformat -Werror=format-security -fcf-protection -fdebug-prefix-map=/build/r-base-EawLoD/r-base-4.4.1=/usr/src/r-base-4.4.1-1.2404.0 -Wdate-time -D_FORTIFY_SOURCE=3 -c sort.c -o sort.o gcc -shared -L/usr/lib/R/lib -Wl,-Bsymbolic-functions -flto=auto -ffat-lto-objects -Wl,-z,relro -o bit.so attrutil.o bit.o chunkutil.o clone.o init.o integerutil.o merge.o rle.o sort.o -L/usr/lib/R/lib -lR installing to /home/omnipath/local/R/4.4-3.20/00LOCK-bit/00new/bit/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 (bit) * installing *source* package ‘sys’ ... ** package ‘sys’ successfully unpacked and MD5 sums checked ** using staged installation ** libs using C compiler: ‘gcc (Ubuntu 13.2.0-23ubuntu4) 13.2.0’ gcc -I"/usr/share/R/include" -DNDEBUG -fpic -g -O2 -fno-omit-frame-pointer -mno-omit-leaf-frame-pointer -ffile-prefix-map=/build/r-base-EawLoD/r-base-4.4.1=. -fstack-protector-strong -fstack-clash-protection -Wformat -Werror=format-security -fcf-protection -fdebug-prefix-map=/build/r-base-EawLoD/r-base-4.4.1=/usr/src/r-base-4.4.1-1.2404.0 -Wdate-time -D_FORTIFY_SOURCE=3 -c exec.c -o exec.o gcc -I"/usr/share/R/include" -DNDEBUG -fpic -g -O2 -fno-omit-frame-pointer -mno-omit-leaf-frame-pointer -ffile-prefix-map=/build/r-base-EawLoD/r-base-4.4.1=. -fstack-protector-strong -fstack-clash-protection -Wformat -Werror=format-security -fcf-protection -fdebug-prefix-map=/build/r-base-EawLoD/r-base-4.4.1=/usr/src/r-base-4.4.1-1.2404.0 -Wdate-time -D_FORTIFY_SOURCE=3 -c init.c -o init.o gcc -shared -L/usr/lib/R/lib -Wl,-Bsymbolic-functions -flto=auto -ffat-lto-objects -Wl,-z,relro -o sys.so exec.o init.o -L/usr/lib/R/lib -lR installing to /home/omnipath/local/R/4.4-3.20/00LOCK-sys/00new/sys/libs ** R ** inst ** byte-compile and prepare package for lazy loading ** help *** installing help indices ** building package indices ** testing if installed package can be loaded from temporary location ** checking absolute paths in shared objects and dynamic libraries ** testing if installed package can be loaded from final location ** testing if installed package keeps a record of temporary installation path * DONE (sys) * installing *source* package ‘stringi’ ... ** package ‘stringi’ successfully unpacked and MD5 sums checked ** using staged installation checking for R_HOME... /usr/lib/R checking for R... /usr/lib/R/bin/R checking for endianness... little checking for cat... /usr/bin/cat checking whether the C++ compiler works... yes checking for C++ compiler default output file name... a.out checking for suffix of executables... checking whether we are cross compiling... no checking for suffix of object files... o checking whether the compiler supports GNU C++... yes checking whether g++ -std=gnu++17 accepts -g... yes checking for g++ -std=gnu++17 option to enable C++11 features... none needed checking whether the C++ compiler supports the 'long long' type... yes checking whether the compiler implements namespaces... yes checking whether the compiler supports the Standard Template Library... yes checking whether std::map is available... yes checking for pkg-config... /usr/bin/pkg-config checking with 'pkg-config' for the system ICU4C (icu-i18n icu-uc)... 74.2 checking for ICU4C >= 61... yes checking for additional CPPFLAGS, LDFLAGS, and LIBS required... done checking whether an ICU4C-based project can be built... yes checking programmatically for sufficient U_ICU_VERSION_MAJOR_NUM... yes checking the capabilities of the ICU data library (ucnv, uloc, utrans)... yes checking the capabilities of the ICU data library (ucol)... yes checking for stdio.h... yes checking for stdlib.h... yes checking for string.h... yes checking for inttypes.h... yes checking for stdint.h... yes checking for strings.h... yes checking for sys/stat.h... yes checking for sys/types.h... yes checking for unistd.h... yes checking for elf.h... yes configure: creating ./config.status config.status: creating src/Makevars config.status: creating src/uconfig_local.h config.status: creating src/install.libs.R *** stringi configure summary: ICU_FOUND=1 STRINGI_CXXSTD= STRINGI_CXXFLAGS= -fpic STRINGI_CPPFLAGS=-I. -UDEBUG -DNDEBUG -DU_HAVE_ELF_H STRINGI_LDFLAGS= -L/usr/lib/x86_64-linux-gnu STRINGI_LIBS= -licui18n -licuuc -licudata *** Compiler settings used: CXX=g++ -std=gnu++17 LD=g++ -std=gnu++17 CXXFLAGS=-g -O2 -fno-omit-frame-pointer -mno-omit-leaf-frame-pointer -ffile-prefix-map=/build/r-base-EawLoD/r-base-4.4.1=. -fstack-protector-strong -fstack-clash-protection -Wformat -Werror=format-security -fcf-protection -fdebug-prefix-map=/build/r-base-EawLoD/r-base-4.4.1=/usr/src/r-base-4.4.1-1.2404.0 -Wdate-time -D_FORTIFY_SOURCE=3 CPPFLAGS= LDFLAGS= LIBS= ** libs using C++ compiler: ‘g++ (Ubuntu 13.2.0-23ubuntu4) 13.2.0’ g++ -std=gnu++17 -I"/usr/share/R/include" -DNDEBUG -I. -UDEBUG -DNDEBUG -DU_HAVE_ELF_H -fpic -fpic -g -O2 -fno-omit-frame-pointer -mno-omit-leaf-frame-pointer -ffile-prefix-map=/build/r-base-EawLoD/r-base-4.4.1=. -fstack-protector-strong -fstack-clash-protection -Wformat -Werror=format-security -fcf-protection -fdebug-prefix-map=/build/r-base-EawLoD/r-base-4.4.1=/usr/src/r-base-4.4.1-1.2404.0 -Wdate-time -D_FORTIFY_SOURCE=3 -c stri_brkiter.cpp -o stri_brkiter.o g++ -std=gnu++17 -I"/usr/share/R/include" -DNDEBUG -I. -UDEBUG -DNDEBUG -DU_HAVE_ELF_H -fpic -fpic -g -O2 -fno-omit-frame-pointer -mno-omit-leaf-frame-pointer -ffile-prefix-map=/build/r-base-EawLoD/r-base-4.4.1=. -fstack-protector-strong -fstack-clash-protection -Wformat -Werror=format-security -fcf-protection -fdebug-prefix-map=/build/r-base-EawLoD/r-base-4.4.1=/usr/src/r-base-4.4.1-1.2404.0 -Wdate-time -D_FORTIFY_SOURCE=3 -c stri_collator.cpp -o stri_collator.o g++ -std=gnu++17 -I"/usr/share/R/include" -DNDEBUG -I. -UDEBUG -DNDEBUG -DU_HAVE_ELF_H -fpic -fpic -g -O2 -fno-omit-frame-pointer -mno-omit-leaf-frame-pointer -ffile-prefix-map=/build/r-base-EawLoD/r-base-4.4.1=. -fstack-protector-strong -fstack-clash-protection -Wformat -Werror=format-security -fcf-protection -fdebug-prefix-map=/build/r-base-EawLoD/r-base-4.4.1=/usr/src/r-base-4.4.1-1.2404.0 -Wdate-time -D_FORTIFY_SOURCE=3 -c stri_common.cpp -o stri_common.o g++ -std=gnu++17 -I"/usr/share/R/include" -DNDEBUG -I. -UDEBUG -DNDEBUG -DU_HAVE_ELF_H -fpic -fpic -g -O2 -fno-omit-frame-pointer -mno-omit-leaf-frame-pointer -ffile-prefix-map=/build/r-base-EawLoD/r-base-4.4.1=. -fstack-protector-strong -fstack-clash-protection -Wformat -Werror=format-security -fcf-protection -fdebug-prefix-map=/build/r-base-EawLoD/r-base-4.4.1=/usr/src/r-base-4.4.1-1.2404.0 -Wdate-time -D_FORTIFY_SOURCE=3 -c stri_compare.cpp -o stri_compare.o g++ -std=gnu++17 -I"/usr/share/R/include" -DNDEBUG -I. -UDEBUG -DNDEBUG -DU_HAVE_ELF_H -fpic -fpic -g -O2 -fno-omit-frame-pointer -mno-omit-leaf-frame-pointer -ffile-prefix-map=/build/r-base-EawLoD/r-base-4.4.1=. -fstack-protector-strong -fstack-clash-protection -Wformat -Werror=format-security -fcf-protection -fdebug-prefix-map=/build/r-base-EawLoD/r-base-4.4.1=/usr/src/r-base-4.4.1-1.2404.0 -Wdate-time -D_FORTIFY_SOURCE=3 -c stri_container_base.cpp -o stri_container_base.o g++ -std=gnu++17 -I"/usr/share/R/include" -DNDEBUG -I. -UDEBUG -DNDEBUG -DU_HAVE_ELF_H -fpic -fpic -g -O2 -fno-omit-frame-pointer -mno-omit-leaf-frame-pointer -ffile-prefix-map=/build/r-base-EawLoD/r-base-4.4.1=. -fstack-protector-strong -fstack-clash-protection -Wformat -Werror=format-security -fcf-protection -fdebug-prefix-map=/build/r-base-EawLoD/r-base-4.4.1=/usr/src/r-base-4.4.1-1.2404.0 -Wdate-time -D_FORTIFY_SOURCE=3 -c stri_container_bytesearch.cpp -o stri_container_bytesearch.o g++ -std=gnu++17 -I"/usr/share/R/include" -DNDEBUG -I. -UDEBUG -DNDEBUG -DU_HAVE_ELF_H -fpic -fpic -g -O2 -fno-omit-frame-pointer -mno-omit-leaf-frame-pointer -ffile-prefix-map=/build/r-base-EawLoD/r-base-4.4.1=. -fstack-protector-strong -fstack-clash-protection -Wformat -Werror=format-security -fcf-protection -fdebug-prefix-map=/build/r-base-EawLoD/r-base-4.4.1=/usr/src/r-base-4.4.1-1.2404.0 -Wdate-time -D_FORTIFY_SOURCE=3 -c stri_container_listint.cpp -o stri_container_listint.o g++ -std=gnu++17 -I"/usr/share/R/include" -DNDEBUG -I. -UDEBUG -DNDEBUG -DU_HAVE_ELF_H -fpic -fpic -g -O2 -fno-omit-frame-pointer -mno-omit-leaf-frame-pointer -ffile-prefix-map=/build/r-base-EawLoD/r-base-4.4.1=. -fstack-protector-strong -fstack-clash-protection -Wformat -Werror=format-security -fcf-protection -fdebug-prefix-map=/build/r-base-EawLoD/r-base-4.4.1=/usr/src/r-base-4.4.1-1.2404.0 -Wdate-time -D_FORTIFY_SOURCE=3 -c stri_container_listraw.cpp -o stri_container_listraw.o g++ -std=gnu++17 -I"/usr/share/R/include" -DNDEBUG -I. -UDEBUG -DNDEBUG -DU_HAVE_ELF_H -fpic -fpic -g -O2 -fno-omit-frame-pointer -mno-omit-leaf-frame-pointer -ffile-prefix-map=/build/r-base-EawLoD/r-base-4.4.1=. -fstack-protector-strong -fstack-clash-protection -Wformat -Werror=format-security -fcf-protection -fdebug-prefix-map=/build/r-base-EawLoD/r-base-4.4.1=/usr/src/r-base-4.4.1-1.2404.0 -Wdate-time -D_FORTIFY_SOURCE=3 -c stri_container_listutf8.cpp -o stri_container_listutf8.o g++ -std=gnu++17 -I"/usr/share/R/include" -DNDEBUG -I. -UDEBUG -DNDEBUG -DU_HAVE_ELF_H -fpic -fpic -g -O2 -fno-omit-frame-pointer -mno-omit-leaf-frame-pointer -ffile-prefix-map=/build/r-base-EawLoD/r-base-4.4.1=. -fstack-protector-strong -fstack-clash-protection -Wformat -Werror=format-security -fcf-protection -fdebug-prefix-map=/build/r-base-EawLoD/r-base-4.4.1=/usr/src/r-base-4.4.1-1.2404.0 -Wdate-time -D_FORTIFY_SOURCE=3 -c stri_container_regex.cpp -o stri_container_regex.o g++ -std=gnu++17 -I"/usr/share/R/include" -DNDEBUG -I. -UDEBUG -DNDEBUG -DU_HAVE_ELF_H -fpic -fpic -g -O2 -fno-omit-frame-pointer -mno-omit-leaf-frame-pointer -ffile-prefix-map=/build/r-base-EawLoD/r-base-4.4.1=. -fstack-protector-strong -fstack-clash-protection -Wformat -Werror=format-security -fcf-protection -fdebug-prefix-map=/build/r-base-EawLoD/r-base-4.4.1=/usr/src/r-base-4.4.1-1.2404.0 -Wdate-time -D_FORTIFY_SOURCE=3 -c stri_container_usearch.cpp -o stri_container_usearch.o g++ -std=gnu++17 -I"/usr/share/R/include" -DNDEBUG -I. -UDEBUG -DNDEBUG -DU_HAVE_ELF_H -fpic -fpic -g -O2 -fno-omit-frame-pointer -mno-omit-leaf-frame-pointer -ffile-prefix-map=/build/r-base-EawLoD/r-base-4.4.1=. -fstack-protector-strong -fstack-clash-protection -Wformat -Werror=format-security -fcf-protection -fdebug-prefix-map=/build/r-base-EawLoD/r-base-4.4.1=/usr/src/r-base-4.4.1-1.2404.0 -Wdate-time -D_FORTIFY_SOURCE=3 -c stri_container_utf16.cpp -o stri_container_utf16.o g++ -std=gnu++17 -I"/usr/share/R/include" -DNDEBUG -I. -UDEBUG -DNDEBUG -DU_HAVE_ELF_H -fpic -fpic -g -O2 -fno-omit-frame-pointer -mno-omit-leaf-frame-pointer -ffile-prefix-map=/build/r-base-EawLoD/r-base-4.4.1=. -fstack-protector-strong -fstack-clash-protection -Wformat -Werror=format-security -fcf-protection -fdebug-prefix-map=/build/r-base-EawLoD/r-base-4.4.1=/usr/src/r-base-4.4.1-1.2404.0 -Wdate-time -D_FORTIFY_SOURCE=3 -c stri_container_utf8.cpp -o stri_container_utf8.o g++ -std=gnu++17 -I"/usr/share/R/include" -DNDEBUG -I. -UDEBUG -DNDEBUG -DU_HAVE_ELF_H -fpic -fpic -g -O2 -fno-omit-frame-pointer -mno-omit-leaf-frame-pointer -ffile-prefix-map=/build/r-base-EawLoD/r-base-4.4.1=. -fstack-protector-strong -fstack-clash-protection -Wformat -Werror=format-security -fcf-protection -fdebug-prefix-map=/build/r-base-EawLoD/r-base-4.4.1=/usr/src/r-base-4.4.1-1.2404.0 -Wdate-time -D_FORTIFY_SOURCE=3 -c stri_container_utf8_indexable.cpp -o stri_container_utf8_indexable.o g++ -std=gnu++17 -I"/usr/share/R/include" -DNDEBUG -I. -UDEBUG -DNDEBUG -DU_HAVE_ELF_H -fpic -fpic -g -O2 -fno-omit-frame-pointer -mno-omit-leaf-frame-pointer -ffile-prefix-map=/build/r-base-EawLoD/r-base-4.4.1=. -fstack-protector-strong -fstack-clash-protection -Wformat -Werror=format-security -fcf-protection -fdebug-prefix-map=/build/r-base-EawLoD/r-base-4.4.1=/usr/src/r-base-4.4.1-1.2404.0 -Wdate-time -D_FORTIFY_SOURCE=3 -c stri_encoding_conversion.cpp -o stri_encoding_conversion.o g++ -std=gnu++17 -I"/usr/share/R/include" -DNDEBUG -I. -UDEBUG -DNDEBUG -DU_HAVE_ELF_H -fpic -fpic -g -O2 -fno-omit-frame-pointer -mno-omit-leaf-frame-pointer -ffile-prefix-map=/build/r-base-EawLoD/r-base-4.4.1=. -fstack-protector-strong -fstack-clash-protection -Wformat -Werror=format-security -fcf-protection -fdebug-prefix-map=/build/r-base-EawLoD/r-base-4.4.1=/usr/src/r-base-4.4.1-1.2404.0 -Wdate-time -D_FORTIFY_SOURCE=3 -c stri_encoding_detection.cpp -o stri_encoding_detection.o g++ -std=gnu++17 -I"/usr/share/R/include" -DNDEBUG -I. -UDEBUG -DNDEBUG -DU_HAVE_ELF_H -fpic -fpic -g -O2 -fno-omit-frame-pointer -mno-omit-leaf-frame-pointer -ffile-prefix-map=/build/r-base-EawLoD/r-base-4.4.1=. -fstack-protector-strong -fstack-clash-protection -Wformat -Werror=format-security -fcf-protection -fdebug-prefix-map=/build/r-base-EawLoD/r-base-4.4.1=/usr/src/r-base-4.4.1-1.2404.0 -Wdate-time -D_FORTIFY_SOURCE=3 -c stri_encoding_management.cpp -o stri_encoding_management.o g++ -std=gnu++17 -I"/usr/share/R/include" -DNDEBUG -I. -UDEBUG -DNDEBUG -DU_HAVE_ELF_H -fpic -fpic -g -O2 -fno-omit-frame-pointer -mno-omit-leaf-frame-pointer -ffile-prefix-map=/build/r-base-EawLoD/r-base-4.4.1=. -fstack-protector-strong -fstack-clash-protection -Wformat -Werror=format-security -fcf-protection -fdebug-prefix-map=/build/r-base-EawLoD/r-base-4.4.1=/usr/src/r-base-4.4.1-1.2404.0 -Wdate-time -D_FORTIFY_SOURCE=3 -c stri_escape.cpp -o stri_escape.o g++ -std=gnu++17 -I"/usr/share/R/include" -DNDEBUG -I. -UDEBUG -DNDEBUG -DU_HAVE_ELF_H -fpic -fpic -g -O2 -fno-omit-frame-pointer -mno-omit-leaf-frame-pointer -ffile-prefix-map=/build/r-base-EawLoD/r-base-4.4.1=. -fstack-protector-strong -fstack-clash-protection -Wformat -Werror=format-security -fcf-protection -fdebug-prefix-map=/build/r-base-EawLoD/r-base-4.4.1=/usr/src/r-base-4.4.1-1.2404.0 -Wdate-time -D_FORTIFY_SOURCE=3 -c stri_exception.cpp -o stri_exception.o g++ -std=gnu++17 -I"/usr/share/R/include" -DNDEBUG -I. -UDEBUG -DNDEBUG -DU_HAVE_ELF_H -fpic -fpic -g -O2 -fno-omit-frame-pointer -mno-omit-leaf-frame-pointer -ffile-prefix-map=/build/r-base-EawLoD/r-base-4.4.1=. -fstack-protector-strong -fstack-clash-protection -Wformat -Werror=format-security -fcf-protection -fdebug-prefix-map=/build/r-base-EawLoD/r-base-4.4.1=/usr/src/r-base-4.4.1-1.2404.0 -Wdate-time -D_FORTIFY_SOURCE=3 -c stri_ICU_settings.cpp -o stri_ICU_settings.o In file included from stri_ICU_settings.cpp:37: uconfig_local.h:42: warning: "UCONFIG_USE_WINDOWS_LCID_MAPPING_API" redefined 42 | #define UCONFIG_USE_WINDOWS_LCID_MAPPING_API 0 | In file included from /usr/include/unicode/platform.h:24, from /usr/include/unicode/ptypes.h:52, from stri_external.h:52, from stri_stringi.h:36, from stri_ICU_settings.cpp:33: /usr/include/unicode/uconfig.h:391: note: this is the location of the previous definition 391 | # define UCONFIG_USE_WINDOWS_LCID_MAPPING_API 1 | g++ -std=gnu++17 -I"/usr/share/R/include" -DNDEBUG -I. -UDEBUG -DNDEBUG -DU_HAVE_ELF_H -fpic -fpic -g -O2 -fno-omit-frame-pointer -mno-omit-leaf-frame-pointer -ffile-prefix-map=/build/r-base-EawLoD/r-base-4.4.1=. -fstack-protector-strong -fstack-clash-protection -Wformat -Werror=format-security -fcf-protection -fdebug-prefix-map=/build/r-base-EawLoD/r-base-4.4.1=/usr/src/r-base-4.4.1-1.2404.0 -Wdate-time -D_FORTIFY_SOURCE=3 -c stri_join.cpp -o stri_join.o g++ -std=gnu++17 -I"/usr/share/R/include" -DNDEBUG -I. -UDEBUG -DNDEBUG -DU_HAVE_ELF_H -fpic -fpic -g -O2 -fno-omit-frame-pointer -mno-omit-leaf-frame-pointer -ffile-prefix-map=/build/r-base-EawLoD/r-base-4.4.1=. -fstack-protector-strong -fstack-clash-protection -Wformat -Werror=format-security -fcf-protection -fdebug-prefix-map=/build/r-base-EawLoD/r-base-4.4.1=/usr/src/r-base-4.4.1-1.2404.0 -Wdate-time -D_FORTIFY_SOURCE=3 -c stri_length.cpp -o stri_length.o g++ -std=gnu++17 -I"/usr/share/R/include" -DNDEBUG -I. -UDEBUG -DNDEBUG -DU_HAVE_ELF_H -fpic -fpic -g -O2 -fno-omit-frame-pointer -mno-omit-leaf-frame-pointer -ffile-prefix-map=/build/r-base-EawLoD/r-base-4.4.1=. -fstack-protector-strong -fstack-clash-protection -Wformat -Werror=format-security -fcf-protection -fdebug-prefix-map=/build/r-base-EawLoD/r-base-4.4.1=/usr/src/r-base-4.4.1-1.2404.0 -Wdate-time -D_FORTIFY_SOURCE=3 -c stri_pad.cpp -o stri_pad.o g++ -std=gnu++17 -I"/usr/share/R/include" -DNDEBUG -I. -UDEBUG -DNDEBUG -DU_HAVE_ELF_H -fpic -fpic -g -O2 -fno-omit-frame-pointer -mno-omit-leaf-frame-pointer -ffile-prefix-map=/build/r-base-EawLoD/r-base-4.4.1=. -fstack-protector-strong -fstack-clash-protection -Wformat -Werror=format-security -fcf-protection -fdebug-prefix-map=/build/r-base-EawLoD/r-base-4.4.1=/usr/src/r-base-4.4.1-1.2404.0 -Wdate-time -D_FORTIFY_SOURCE=3 -c stri_prepare_arg.cpp -o stri_prepare_arg.o g++ -std=gnu++17 -I"/usr/share/R/include" -DNDEBUG -I. -UDEBUG -DNDEBUG -DU_HAVE_ELF_H -fpic -fpic -g -O2 -fno-omit-frame-pointer -mno-omit-leaf-frame-pointer -ffile-prefix-map=/build/r-base-EawLoD/r-base-4.4.1=. -fstack-protector-strong -fstack-clash-protection -Wformat -Werror=format-security -fcf-protection -fdebug-prefix-map=/build/r-base-EawLoD/r-base-4.4.1=/usr/src/r-base-4.4.1-1.2404.0 -Wdate-time -D_FORTIFY_SOURCE=3 -c stri_random.cpp -o stri_random.o g++ -std=gnu++17 -I"/usr/share/R/include" -DNDEBUG -I. -UDEBUG -DNDEBUG -DU_HAVE_ELF_H -fpic -fpic -g -O2 -fno-omit-frame-pointer -mno-omit-leaf-frame-pointer -ffile-prefix-map=/build/r-base-EawLoD/r-base-4.4.1=. -fstack-protector-strong -fstack-clash-protection -Wformat -Werror=format-security -fcf-protection -fdebug-prefix-map=/build/r-base-EawLoD/r-base-4.4.1=/usr/src/r-base-4.4.1-1.2404.0 -Wdate-time -D_FORTIFY_SOURCE=3 -c stri_reverse.cpp -o stri_reverse.o g++ -std=gnu++17 -I"/usr/share/R/include" -DNDEBUG -I. -UDEBUG -DNDEBUG -DU_HAVE_ELF_H -fpic -fpic -g -O2 -fno-omit-frame-pointer -mno-omit-leaf-frame-pointer -ffile-prefix-map=/build/r-base-EawLoD/r-base-4.4.1=. -fstack-protector-strong -fstack-clash-protection -Wformat -Werror=format-security -fcf-protection -fdebug-prefix-map=/build/r-base-EawLoD/r-base-4.4.1=/usr/src/r-base-4.4.1-1.2404.0 -Wdate-time -D_FORTIFY_SOURCE=3 -c stri_search_class_count.cpp -o stri_search_class_count.o g++ -std=gnu++17 -I"/usr/share/R/include" -DNDEBUG -I. -UDEBUG -DNDEBUG -DU_HAVE_ELF_H -fpic -fpic -g -O2 -fno-omit-frame-pointer -mno-omit-leaf-frame-pointer -ffile-prefix-map=/build/r-base-EawLoD/r-base-4.4.1=. -fstack-protector-strong -fstack-clash-protection -Wformat -Werror=format-security -fcf-protection -fdebug-prefix-map=/build/r-base-EawLoD/r-base-4.4.1=/usr/src/r-base-4.4.1-1.2404.0 -Wdate-time -D_FORTIFY_SOURCE=3 -c stri_search_class_detect.cpp -o stri_search_class_detect.o g++ -std=gnu++17 -I"/usr/share/R/include" -DNDEBUG -I. -UDEBUG -DNDEBUG -DU_HAVE_ELF_H -fpic -fpic -g -O2 -fno-omit-frame-pointer -mno-omit-leaf-frame-pointer -ffile-prefix-map=/build/r-base-EawLoD/r-base-4.4.1=. -fstack-protector-strong -fstack-clash-protection -Wformat -Werror=format-security -fcf-protection -fdebug-prefix-map=/build/r-base-EawLoD/r-base-4.4.1=/usr/src/r-base-4.4.1-1.2404.0 -Wdate-time -D_FORTIFY_SOURCE=3 -c stri_search_class_extract.cpp -o stri_search_class_extract.o g++ -std=gnu++17 -I"/usr/share/R/include" -DNDEBUG -I. -UDEBUG -DNDEBUG -DU_HAVE_ELF_H -fpic -fpic -g -O2 -fno-omit-frame-pointer -mno-omit-leaf-frame-pointer -ffile-prefix-map=/build/r-base-EawLoD/r-base-4.4.1=. -fstack-protector-strong -fstack-clash-protection -Wformat -Werror=format-security -fcf-protection -fdebug-prefix-map=/build/r-base-EawLoD/r-base-4.4.1=/usr/src/r-base-4.4.1-1.2404.0 -Wdate-time -D_FORTIFY_SOURCE=3 -c stri_search_class_locate.cpp -o stri_search_class_locate.o g++ -std=gnu++17 -I"/usr/share/R/include" -DNDEBUG -I. -UDEBUG -DNDEBUG -DU_HAVE_ELF_H -fpic -fpic -g -O2 -fno-omit-frame-pointer -mno-omit-leaf-frame-pointer -ffile-prefix-map=/build/r-base-EawLoD/r-base-4.4.1=. -fstack-protector-strong -fstack-clash-protection -Wformat -Werror=format-security -fcf-protection -fdebug-prefix-map=/build/r-base-EawLoD/r-base-4.4.1=/usr/src/r-base-4.4.1-1.2404.0 -Wdate-time -D_FORTIFY_SOURCE=3 -c stri_search_class_replace.cpp -o stri_search_class_replace.o g++ -std=gnu++17 -I"/usr/share/R/include" -DNDEBUG -I. -UDEBUG -DNDEBUG -DU_HAVE_ELF_H -fpic -fpic -g -O2 -fno-omit-frame-pointer -mno-omit-leaf-frame-pointer -ffile-prefix-map=/build/r-base-EawLoD/r-base-4.4.1=. -fstack-protector-strong -fstack-clash-protection -Wformat -Werror=format-security -fcf-protection -fdebug-prefix-map=/build/r-base-EawLoD/r-base-4.4.1=/usr/src/r-base-4.4.1-1.2404.0 -Wdate-time -D_FORTIFY_SOURCE=3 -c stri_search_class_split.cpp -o stri_search_class_split.o g++ -std=gnu++17 -I"/usr/share/R/include" -DNDEBUG -I. -UDEBUG -DNDEBUG -DU_HAVE_ELF_H -fpic -fpic -g -O2 -fno-omit-frame-pointer -mno-omit-leaf-frame-pointer -ffile-prefix-map=/build/r-base-EawLoD/r-base-4.4.1=. -fstack-protector-strong -fstack-clash-protection -Wformat -Werror=format-security -fcf-protection -fdebug-prefix-map=/build/r-base-EawLoD/r-base-4.4.1=/usr/src/r-base-4.4.1-1.2404.0 -Wdate-time -D_FORTIFY_SOURCE=3 -c stri_search_class_startsendswith.cpp -o stri_search_class_startsendswith.o g++ -std=gnu++17 -I"/usr/share/R/include" -DNDEBUG -I. -UDEBUG -DNDEBUG -DU_HAVE_ELF_H -fpic -fpic -g -O2 -fno-omit-frame-pointer -mno-omit-leaf-frame-pointer -ffile-prefix-map=/build/r-base-EawLoD/r-base-4.4.1=. -fstack-protector-strong -fstack-clash-protection -Wformat -Werror=format-security -fcf-protection -fdebug-prefix-map=/build/r-base-EawLoD/r-base-4.4.1=/usr/src/r-base-4.4.1-1.2404.0 -Wdate-time -D_FORTIFY_SOURCE=3 -c stri_search_class_subset.cpp -o stri_search_class_subset.o g++ -std=gnu++17 -I"/usr/share/R/include" -DNDEBUG -I. -UDEBUG -DNDEBUG -DU_HAVE_ELF_H -fpic -fpic -g -O2 -fno-omit-frame-pointer -mno-omit-leaf-frame-pointer -ffile-prefix-map=/build/r-base-EawLoD/r-base-4.4.1=. -fstack-protector-strong -fstack-clash-protection -Wformat -Werror=format-security -fcf-protection -fdebug-prefix-map=/build/r-base-EawLoD/r-base-4.4.1=/usr/src/r-base-4.4.1-1.2404.0 -Wdate-time -D_FORTIFY_SOURCE=3 -c stri_search_class_trim.cpp -o stri_search_class_trim.o g++ -std=gnu++17 -I"/usr/share/R/include" -DNDEBUG -I. -UDEBUG -DNDEBUG -DU_HAVE_ELF_H -fpic -fpic -g -O2 -fno-omit-frame-pointer -mno-omit-leaf-frame-pointer -ffile-prefix-map=/build/r-base-EawLoD/r-base-4.4.1=. -fstack-protector-strong -fstack-clash-protection -Wformat -Werror=format-security -fcf-protection -fdebug-prefix-map=/build/r-base-EawLoD/r-base-4.4.1=/usr/src/r-base-4.4.1-1.2404.0 -Wdate-time -D_FORTIFY_SOURCE=3 -c stri_search_common.cpp -o stri_search_common.o g++ -std=gnu++17 -I"/usr/share/R/include" -DNDEBUG -I. -UDEBUG -DNDEBUG -DU_HAVE_ELF_H -fpic -fpic -g -O2 -fno-omit-frame-pointer -mno-omit-leaf-frame-pointer -ffile-prefix-map=/build/r-base-EawLoD/r-base-4.4.1=. -fstack-protector-strong -fstack-clash-protection -Wformat -Werror=format-security -fcf-protection -fdebug-prefix-map=/build/r-base-EawLoD/r-base-4.4.1=/usr/src/r-base-4.4.1-1.2404.0 -Wdate-time -D_FORTIFY_SOURCE=3 -c stri_search_coll_count.cpp -o stri_search_coll_count.o g++ -std=gnu++17 -I"/usr/share/R/include" -DNDEBUG -I. -UDEBUG -DNDEBUG -DU_HAVE_ELF_H -fpic -fpic -g -O2 -fno-omit-frame-pointer -mno-omit-leaf-frame-pointer -ffile-prefix-map=/build/r-base-EawLoD/r-base-4.4.1=. -fstack-protector-strong -fstack-clash-protection -Wformat -Werror=format-security -fcf-protection -fdebug-prefix-map=/build/r-base-EawLoD/r-base-4.4.1=/usr/src/r-base-4.4.1-1.2404.0 -Wdate-time -D_FORTIFY_SOURCE=3 -c stri_search_coll_detect.cpp -o stri_search_coll_detect.o g++ -std=gnu++17 -I"/usr/share/R/include" -DNDEBUG -I. -UDEBUG -DNDEBUG -DU_HAVE_ELF_H -fpic -fpic -g -O2 -fno-omit-frame-pointer -mno-omit-leaf-frame-pointer -ffile-prefix-map=/build/r-base-EawLoD/r-base-4.4.1=. -fstack-protector-strong -fstack-clash-protection -Wformat -Werror=format-security -fcf-protection -fdebug-prefix-map=/build/r-base-EawLoD/r-base-4.4.1=/usr/src/r-base-4.4.1-1.2404.0 -Wdate-time -D_FORTIFY_SOURCE=3 -c stri_search_coll_extract.cpp -o stri_search_coll_extract.o g++ -std=gnu++17 -I"/usr/share/R/include" -DNDEBUG -I. -UDEBUG -DNDEBUG -DU_HAVE_ELF_H -fpic -fpic -g -O2 -fno-omit-frame-pointer -mno-omit-leaf-frame-pointer -ffile-prefix-map=/build/r-base-EawLoD/r-base-4.4.1=. -fstack-protector-strong -fstack-clash-protection -Wformat -Werror=format-security -fcf-protection -fdebug-prefix-map=/build/r-base-EawLoD/r-base-4.4.1=/usr/src/r-base-4.4.1-1.2404.0 -Wdate-time -D_FORTIFY_SOURCE=3 -c stri_search_coll_locate.cpp -o stri_search_coll_locate.o g++ -std=gnu++17 -I"/usr/share/R/include" -DNDEBUG -I. -UDEBUG -DNDEBUG -DU_HAVE_ELF_H -fpic -fpic -g -O2 -fno-omit-frame-pointer -mno-omit-leaf-frame-pointer -ffile-prefix-map=/build/r-base-EawLoD/r-base-4.4.1=. -fstack-protector-strong -fstack-clash-protection -Wformat -Werror=format-security -fcf-protection -fdebug-prefix-map=/build/r-base-EawLoD/r-base-4.4.1=/usr/src/r-base-4.4.1-1.2404.0 -Wdate-time -D_FORTIFY_SOURCE=3 -c stri_search_coll_replace.cpp -o stri_search_coll_replace.o g++ -std=gnu++17 -I"/usr/share/R/include" -DNDEBUG -I. -UDEBUG -DNDEBUG -DU_HAVE_ELF_H -fpic -fpic -g -O2 -fno-omit-frame-pointer -mno-omit-leaf-frame-pointer -ffile-prefix-map=/build/r-base-EawLoD/r-base-4.4.1=. -fstack-protector-strong -fstack-clash-protection -Wformat -Werror=format-security -fcf-protection -fdebug-prefix-map=/build/r-base-EawLoD/r-base-4.4.1=/usr/src/r-base-4.4.1-1.2404.0 -Wdate-time -D_FORTIFY_SOURCE=3 -c stri_search_coll_split.cpp -o stri_search_coll_split.o g++ -std=gnu++17 -I"/usr/share/R/include" -DNDEBUG -I. -UDEBUG -DNDEBUG -DU_HAVE_ELF_H -fpic -fpic -g -O2 -fno-omit-frame-pointer -mno-omit-leaf-frame-pointer -ffile-prefix-map=/build/r-base-EawLoD/r-base-4.4.1=. -fstack-protector-strong -fstack-clash-protection -Wformat -Werror=format-security -fcf-protection -fdebug-prefix-map=/build/r-base-EawLoD/r-base-4.4.1=/usr/src/r-base-4.4.1-1.2404.0 -Wdate-time -D_FORTIFY_SOURCE=3 -c stri_search_coll_startsendswith.cpp -o stri_search_coll_startsendswith.o g++ -std=gnu++17 -I"/usr/share/R/include" -DNDEBUG -I. -UDEBUG -DNDEBUG -DU_HAVE_ELF_H -fpic -fpic -g -O2 -fno-omit-frame-pointer -mno-omit-leaf-frame-pointer -ffile-prefix-map=/build/r-base-EawLoD/r-base-4.4.1=. -fstack-protector-strong -fstack-clash-protection -Wformat -Werror=format-security -fcf-protection -fdebug-prefix-map=/build/r-base-EawLoD/r-base-4.4.1=/usr/src/r-base-4.4.1-1.2404.0 -Wdate-time -D_FORTIFY_SOURCE=3 -c stri_search_coll_subset.cpp -o stri_search_coll_subset.o g++ -std=gnu++17 -I"/usr/share/R/include" -DNDEBUG -I. -UDEBUG -DNDEBUG -DU_HAVE_ELF_H -fpic -fpic -g -O2 -fno-omit-frame-pointer -mno-omit-leaf-frame-pointer -ffile-prefix-map=/build/r-base-EawLoD/r-base-4.4.1=. -fstack-protector-strong -fstack-clash-protection -Wformat -Werror=format-security -fcf-protection -fdebug-prefix-map=/build/r-base-EawLoD/r-base-4.4.1=/usr/src/r-base-4.4.1-1.2404.0 -Wdate-time -D_FORTIFY_SOURCE=3 -c stri_search_boundaries_count.cpp -o stri_search_boundaries_count.o g++ -std=gnu++17 -I"/usr/share/R/include" -DNDEBUG -I. -UDEBUG -DNDEBUG -DU_HAVE_ELF_H -fpic -fpic -g -O2 -fno-omit-frame-pointer -mno-omit-leaf-frame-pointer -ffile-prefix-map=/build/r-base-EawLoD/r-base-4.4.1=. -fstack-protector-strong -fstack-clash-protection -Wformat -Werror=format-security -fcf-protection -fdebug-prefix-map=/build/r-base-EawLoD/r-base-4.4.1=/usr/src/r-base-4.4.1-1.2404.0 -Wdate-time -D_FORTIFY_SOURCE=3 -c stri_search_boundaries_extract.cpp -o stri_search_boundaries_extract.o g++ -std=gnu++17 -I"/usr/share/R/include" -DNDEBUG -I. -UDEBUG -DNDEBUG -DU_HAVE_ELF_H -fpic -fpic -g -O2 -fno-omit-frame-pointer -mno-omit-leaf-frame-pointer -ffile-prefix-map=/build/r-base-EawLoD/r-base-4.4.1=. -fstack-protector-strong -fstack-clash-protection -Wformat -Werror=format-security -fcf-protection -fdebug-prefix-map=/build/r-base-EawLoD/r-base-4.4.1=/usr/src/r-base-4.4.1-1.2404.0 -Wdate-time -D_FORTIFY_SOURCE=3 -c stri_search_boundaries_locate.cpp -o stri_search_boundaries_locate.o g++ -std=gnu++17 -I"/usr/share/R/include" -DNDEBUG -I. -UDEBUG -DNDEBUG -DU_HAVE_ELF_H -fpic -fpic -g -O2 -fno-omit-frame-pointer -mno-omit-leaf-frame-pointer -ffile-prefix-map=/build/r-base-EawLoD/r-base-4.4.1=. -fstack-protector-strong -fstack-clash-protection -Wformat -Werror=format-security -fcf-protection -fdebug-prefix-map=/build/r-base-EawLoD/r-base-4.4.1=/usr/src/r-base-4.4.1-1.2404.0 -Wdate-time -D_FORTIFY_SOURCE=3 -c stri_search_boundaries_split.cpp -o stri_search_boundaries_split.o g++ -std=gnu++17 -I"/usr/share/R/include" -DNDEBUG -I. -UDEBUG -DNDEBUG -DU_HAVE_ELF_H -fpic -fpic -g -O2 -fno-omit-frame-pointer -mno-omit-leaf-frame-pointer -ffile-prefix-map=/build/r-base-EawLoD/r-base-4.4.1=. -fstack-protector-strong -fstack-clash-protection -Wformat -Werror=format-security -fcf-protection -fdebug-prefix-map=/build/r-base-EawLoD/r-base-4.4.1=/usr/src/r-base-4.4.1-1.2404.0 -Wdate-time -D_FORTIFY_SOURCE=3 -c stri_search_fixed_count.cpp -o stri_search_fixed_count.o g++ -std=gnu++17 -I"/usr/share/R/include" -DNDEBUG -I. -UDEBUG -DNDEBUG -DU_HAVE_ELF_H -fpic -fpic -g -O2 -fno-omit-frame-pointer -mno-omit-leaf-frame-pointer -ffile-prefix-map=/build/r-base-EawLoD/r-base-4.4.1=. -fstack-protector-strong -fstack-clash-protection -Wformat -Werror=format-security -fcf-protection -fdebug-prefix-map=/build/r-base-EawLoD/r-base-4.4.1=/usr/src/r-base-4.4.1-1.2404.0 -Wdate-time -D_FORTIFY_SOURCE=3 -c stri_search_fixed_detect.cpp -o stri_search_fixed_detect.o g++ -std=gnu++17 -I"/usr/share/R/include" -DNDEBUG -I. -UDEBUG -DNDEBUG -DU_HAVE_ELF_H -fpic -fpic -g -O2 -fno-omit-frame-pointer -mno-omit-leaf-frame-pointer -ffile-prefix-map=/build/r-base-EawLoD/r-base-4.4.1=. -fstack-protector-strong -fstack-clash-protection -Wformat -Werror=format-security -fcf-protection -fdebug-prefix-map=/build/r-base-EawLoD/r-base-4.4.1=/usr/src/r-base-4.4.1-1.2404.0 -Wdate-time -D_FORTIFY_SOURCE=3 -c stri_search_fixed_extract.cpp -o stri_search_fixed_extract.o g++ -std=gnu++17 -I"/usr/share/R/include" -DNDEBUG -I. -UDEBUG -DNDEBUG -DU_HAVE_ELF_H -fpic -fpic -g -O2 -fno-omit-frame-pointer -mno-omit-leaf-frame-pointer -ffile-prefix-map=/build/r-base-EawLoD/r-base-4.4.1=. -fstack-protector-strong -fstack-clash-protection -Wformat -Werror=format-security -fcf-protection -fdebug-prefix-map=/build/r-base-EawLoD/r-base-4.4.1=/usr/src/r-base-4.4.1-1.2404.0 -Wdate-time -D_FORTIFY_SOURCE=3 -c stri_search_fixed_locate.cpp -o stri_search_fixed_locate.o g++ -std=gnu++17 -I"/usr/share/R/include" -DNDEBUG -I. -UDEBUG -DNDEBUG -DU_HAVE_ELF_H -fpic -fpic -g -O2 -fno-omit-frame-pointer -mno-omit-leaf-frame-pointer -ffile-prefix-map=/build/r-base-EawLoD/r-base-4.4.1=. -fstack-protector-strong -fstack-clash-protection -Wformat -Werror=format-security -fcf-protection -fdebug-prefix-map=/build/r-base-EawLoD/r-base-4.4.1=/usr/src/r-base-4.4.1-1.2404.0 -Wdate-time -D_FORTIFY_SOURCE=3 -c stri_search_fixed_replace.cpp -o stri_search_fixed_replace.o g++ -std=gnu++17 -I"/usr/share/R/include" -DNDEBUG -I. -UDEBUG -DNDEBUG -DU_HAVE_ELF_H -fpic -fpic -g -O2 -fno-omit-frame-pointer -mno-omit-leaf-frame-pointer -ffile-prefix-map=/build/r-base-EawLoD/r-base-4.4.1=. -fstack-protector-strong -fstack-clash-protection -Wformat -Werror=format-security -fcf-protection -fdebug-prefix-map=/build/r-base-EawLoD/r-base-4.4.1=/usr/src/r-base-4.4.1-1.2404.0 -Wdate-time -D_FORTIFY_SOURCE=3 -c stri_search_fixed_split.cpp -o stri_search_fixed_split.o g++ -std=gnu++17 -I"/usr/share/R/include" -DNDEBUG -I. -UDEBUG -DNDEBUG -DU_HAVE_ELF_H -fpic -fpic -g -O2 -fno-omit-frame-pointer -mno-omit-leaf-frame-pointer -ffile-prefix-map=/build/r-base-EawLoD/r-base-4.4.1=. -fstack-protector-strong -fstack-clash-protection -Wformat -Werror=format-security -fcf-protection -fdebug-prefix-map=/build/r-base-EawLoD/r-base-4.4.1=/usr/src/r-base-4.4.1-1.2404.0 -Wdate-time -D_FORTIFY_SOURCE=3 -c stri_search_fixed_subset.cpp -o stri_search_fixed_subset.o g++ -std=gnu++17 -I"/usr/share/R/include" -DNDEBUG -I. -UDEBUG -DNDEBUG -DU_HAVE_ELF_H -fpic -fpic -g -O2 -fno-omit-frame-pointer -mno-omit-leaf-frame-pointer -ffile-prefix-map=/build/r-base-EawLoD/r-base-4.4.1=. -fstack-protector-strong -fstack-clash-protection -Wformat -Werror=format-security -fcf-protection -fdebug-prefix-map=/build/r-base-EawLoD/r-base-4.4.1=/usr/src/r-base-4.4.1-1.2404.0 -Wdate-time -D_FORTIFY_SOURCE=3 -c stri_search_fixed_startsendswith.cpp -o stri_search_fixed_startsendswith.o g++ -std=gnu++17 -I"/usr/share/R/include" -DNDEBUG -I. -UDEBUG -DNDEBUG -DU_HAVE_ELF_H -fpic -fpic -g -O2 -fno-omit-frame-pointer -mno-omit-leaf-frame-pointer -ffile-prefix-map=/build/r-base-EawLoD/r-base-4.4.1=. -fstack-protector-strong -fstack-clash-protection -Wformat -Werror=format-security -fcf-protection -fdebug-prefix-map=/build/r-base-EawLoD/r-base-4.4.1=/usr/src/r-base-4.4.1-1.2404.0 -Wdate-time -D_FORTIFY_SOURCE=3 -c stri_search_in.cpp -o stri_search_in.o g++ -std=gnu++17 -I"/usr/share/R/include" -DNDEBUG -I. -UDEBUG -DNDEBUG -DU_HAVE_ELF_H -fpic -fpic -g -O2 -fno-omit-frame-pointer -mno-omit-leaf-frame-pointer -ffile-prefix-map=/build/r-base-EawLoD/r-base-4.4.1=. -fstack-protector-strong -fstack-clash-protection -Wformat -Werror=format-security -fcf-protection -fdebug-prefix-map=/build/r-base-EawLoD/r-base-4.4.1=/usr/src/r-base-4.4.1-1.2404.0 -Wdate-time -D_FORTIFY_SOURCE=3 -c stri_search_other_split.cpp -o stri_search_other_split.o g++ -std=gnu++17 -I"/usr/share/R/include" -DNDEBUG -I. -UDEBUG -DNDEBUG -DU_HAVE_ELF_H -fpic -fpic -g -O2 -fno-omit-frame-pointer -mno-omit-leaf-frame-pointer -ffile-prefix-map=/build/r-base-EawLoD/r-base-4.4.1=. -fstack-protector-strong -fstack-clash-protection -Wformat -Werror=format-security -fcf-protection -fdebug-prefix-map=/build/r-base-EawLoD/r-base-4.4.1=/usr/src/r-base-4.4.1-1.2404.0 -Wdate-time -D_FORTIFY_SOURCE=3 -c stri_search_regex_count.cpp -o stri_search_regex_count.o g++ -std=gnu++17 -I"/usr/share/R/include" -DNDEBUG -I. -UDEBUG -DNDEBUG -DU_HAVE_ELF_H -fpic -fpic -g -O2 -fno-omit-frame-pointer -mno-omit-leaf-frame-pointer -ffile-prefix-map=/build/r-base-EawLoD/r-base-4.4.1=. -fstack-protector-strong -fstack-clash-protection -Wformat -Werror=format-security -fcf-protection -fdebug-prefix-map=/build/r-base-EawLoD/r-base-4.4.1=/usr/src/r-base-4.4.1-1.2404.0 -Wdate-time -D_FORTIFY_SOURCE=3 -c stri_search_regex_detect.cpp -o stri_search_regex_detect.o g++ -std=gnu++17 -I"/usr/share/R/include" -DNDEBUG -I. -UDEBUG -DNDEBUG -DU_HAVE_ELF_H -fpic -fpic -g -O2 -fno-omit-frame-pointer -mno-omit-leaf-frame-pointer -ffile-prefix-map=/build/r-base-EawLoD/r-base-4.4.1=. -fstack-protector-strong -fstack-clash-protection -Wformat -Werror=format-security -fcf-protection -fdebug-prefix-map=/build/r-base-EawLoD/r-base-4.4.1=/usr/src/r-base-4.4.1-1.2404.0 -Wdate-time -D_FORTIFY_SOURCE=3 -c stri_search_regex_extract.cpp -o stri_search_regex_extract.o g++ -std=gnu++17 -I"/usr/share/R/include" -DNDEBUG -I. -UDEBUG -DNDEBUG -DU_HAVE_ELF_H -fpic -fpic -g -O2 -fno-omit-frame-pointer -mno-omit-leaf-frame-pointer -ffile-prefix-map=/build/r-base-EawLoD/r-base-4.4.1=. -fstack-protector-strong -fstack-clash-protection -Wformat -Werror=format-security -fcf-protection -fdebug-prefix-map=/build/r-base-EawLoD/r-base-4.4.1=/usr/src/r-base-4.4.1-1.2404.0 -Wdate-time -D_FORTIFY_SOURCE=3 -c stri_search_regex_locate.cpp -o stri_search_regex_locate.o g++ -std=gnu++17 -I"/usr/share/R/include" -DNDEBUG -I. -UDEBUG -DNDEBUG -DU_HAVE_ELF_H -fpic -fpic -g -O2 -fno-omit-frame-pointer -mno-omit-leaf-frame-pointer -ffile-prefix-map=/build/r-base-EawLoD/r-base-4.4.1=. -fstack-protector-strong -fstack-clash-protection -Wformat -Werror=format-security -fcf-protection -fdebug-prefix-map=/build/r-base-EawLoD/r-base-4.4.1=/usr/src/r-base-4.4.1-1.2404.0 -Wdate-time -D_FORTIFY_SOURCE=3 -c stri_search_regex_match.cpp -o stri_search_regex_match.o g++ -std=gnu++17 -I"/usr/share/R/include" -DNDEBUG -I. -UDEBUG -DNDEBUG -DU_HAVE_ELF_H -fpic -fpic -g -O2 -fno-omit-frame-pointer -mno-omit-leaf-frame-pointer -ffile-prefix-map=/build/r-base-EawLoD/r-base-4.4.1=. -fstack-protector-strong -fstack-clash-protection -Wformat -Werror=format-security -fcf-protection -fdebug-prefix-map=/build/r-base-EawLoD/r-base-4.4.1=/usr/src/r-base-4.4.1-1.2404.0 -Wdate-time -D_FORTIFY_SOURCE=3 -c stri_search_regex_replace.cpp -o stri_search_regex_replace.o g++ -std=gnu++17 -I"/usr/share/R/include" -DNDEBUG -I. -UDEBUG -DNDEBUG -DU_HAVE_ELF_H -fpic -fpic -g -O2 -fno-omit-frame-pointer -mno-omit-leaf-frame-pointer -ffile-prefix-map=/build/r-base-EawLoD/r-base-4.4.1=. -fstack-protector-strong -fstack-clash-protection -Wformat -Werror=format-security -fcf-protection -fdebug-prefix-map=/build/r-base-EawLoD/r-base-4.4.1=/usr/src/r-base-4.4.1-1.2404.0 -Wdate-time -D_FORTIFY_SOURCE=3 -c stri_search_regex_split.cpp -o stri_search_regex_split.o g++ -std=gnu++17 -I"/usr/share/R/include" -DNDEBUG -I. -UDEBUG -DNDEBUG -DU_HAVE_ELF_H -fpic -fpic -g -O2 -fno-omit-frame-pointer -mno-omit-leaf-frame-pointer -ffile-prefix-map=/build/r-base-EawLoD/r-base-4.4.1=. -fstack-protector-strong -fstack-clash-protection -Wformat -Werror=format-security -fcf-protection -fdebug-prefix-map=/build/r-base-EawLoD/r-base-4.4.1=/usr/src/r-base-4.4.1-1.2404.0 -Wdate-time -D_FORTIFY_SOURCE=3 -c stri_search_regex_subset.cpp -o stri_search_regex_subset.o g++ -std=gnu++17 -I"/usr/share/R/include" -DNDEBUG -I. -UDEBUG -DNDEBUG -DU_HAVE_ELF_H -fpic -fpic -g -O2 -fno-omit-frame-pointer -mno-omit-leaf-frame-pointer -ffile-prefix-map=/build/r-base-EawLoD/r-base-4.4.1=. -fstack-protector-strong -fstack-clash-protection -Wformat -Werror=format-security -fcf-protection -fdebug-prefix-map=/build/r-base-EawLoD/r-base-4.4.1=/usr/src/r-base-4.4.1-1.2404.0 -Wdate-time -D_FORTIFY_SOURCE=3 -c stri_sort.cpp -o stri_sort.o g++ -std=gnu++17 -I"/usr/share/R/include" -DNDEBUG -I. -UDEBUG -DNDEBUG -DU_HAVE_ELF_H -fpic -fpic -g -O2 -fno-omit-frame-pointer -mno-omit-leaf-frame-pointer -ffile-prefix-map=/build/r-base-EawLoD/r-base-4.4.1=. -fstack-protector-strong -fstack-clash-protection -Wformat -Werror=format-security -fcf-protection -fdebug-prefix-map=/build/r-base-EawLoD/r-base-4.4.1=/usr/src/r-base-4.4.1-1.2404.0 -Wdate-time -D_FORTIFY_SOURCE=3 -c stri_sprintf.cpp -o stri_sprintf.o g++ -std=gnu++17 -I"/usr/share/R/include" -DNDEBUG -I. -UDEBUG -DNDEBUG -DU_HAVE_ELF_H -fpic -fpic -g -O2 -fno-omit-frame-pointer -mno-omit-leaf-frame-pointer -ffile-prefix-map=/build/r-base-EawLoD/r-base-4.4.1=. -fstack-protector-strong -fstack-clash-protection -Wformat -Werror=format-security -fcf-protection -fdebug-prefix-map=/build/r-base-EawLoD/r-base-4.4.1=/usr/src/r-base-4.4.1-1.2404.0 -Wdate-time -D_FORTIFY_SOURCE=3 -c stri_stats.cpp -o stri_stats.o g++ -std=gnu++17 -I"/usr/share/R/include" -DNDEBUG -I. -UDEBUG -DNDEBUG -DU_HAVE_ELF_H -fpic -fpic -g -O2 -fno-omit-frame-pointer -mno-omit-leaf-frame-pointer -ffile-prefix-map=/build/r-base-EawLoD/r-base-4.4.1=. -fstack-protector-strong -fstack-clash-protection -Wformat -Werror=format-security -fcf-protection -fdebug-prefix-map=/build/r-base-EawLoD/r-base-4.4.1=/usr/src/r-base-4.4.1-1.2404.0 -Wdate-time -D_FORTIFY_SOURCE=3 -c stri_string8.cpp -o stri_string8.o g++ -std=gnu++17 -I"/usr/share/R/include" -DNDEBUG -I. -UDEBUG -DNDEBUG -DU_HAVE_ELF_H -fpic -fpic -g -O2 -fno-omit-frame-pointer -mno-omit-leaf-frame-pointer -ffile-prefix-map=/build/r-base-EawLoD/r-base-4.4.1=. -fstack-protector-strong -fstack-clash-protection -Wformat -Werror=format-security -fcf-protection -fdebug-prefix-map=/build/r-base-EawLoD/r-base-4.4.1=/usr/src/r-base-4.4.1-1.2404.0 -Wdate-time -D_FORTIFY_SOURCE=3 -c stri_stringi.cpp -o stri_stringi.o In file included from stri_stringi.cpp:39: uconfig_local.h:42: warning: "UCONFIG_USE_WINDOWS_LCID_MAPPING_API" redefined 42 | #define UCONFIG_USE_WINDOWS_LCID_MAPPING_API 0 | In file included from /usr/include/unicode/platform.h:24, from /usr/include/unicode/ptypes.h:52, from stri_external.h:52, from stri_stringi.h:36, from stri_stringi.cpp:33: /usr/include/unicode/uconfig.h:391: note: this is the location of the previous definition 391 | # define UCONFIG_USE_WINDOWS_LCID_MAPPING_API 1 | g++ -std=gnu++17 -I"/usr/share/R/include" -DNDEBUG -I. -UDEBUG -DNDEBUG -DU_HAVE_ELF_H -fpic -fpic -g -O2 -fno-omit-frame-pointer -mno-omit-leaf-frame-pointer -ffile-prefix-map=/build/r-base-EawLoD/r-base-4.4.1=. -fstack-protector-strong -fstack-clash-protection -Wformat -Werror=format-security -fcf-protection -fdebug-prefix-map=/build/r-base-EawLoD/r-base-4.4.1=/usr/src/r-base-4.4.1-1.2404.0 -Wdate-time -D_FORTIFY_SOURCE=3 -c stri_sub.cpp -o stri_sub.o g++ -std=gnu++17 -I"/usr/share/R/include" -DNDEBUG -I. -UDEBUG -DNDEBUG -DU_HAVE_ELF_H -fpic -fpic -g -O2 -fno-omit-frame-pointer -mno-omit-leaf-frame-pointer -ffile-prefix-map=/build/r-base-EawLoD/r-base-4.4.1=. -fstack-protector-strong -fstack-clash-protection -Wformat -Werror=format-security -fcf-protection -fdebug-prefix-map=/build/r-base-EawLoD/r-base-4.4.1=/usr/src/r-base-4.4.1-1.2404.0 -Wdate-time -D_FORTIFY_SOURCE=3 -c stri_test.cpp -o stri_test.o g++ -std=gnu++17 -I"/usr/share/R/include" -DNDEBUG -I. -UDEBUG -DNDEBUG -DU_HAVE_ELF_H -fpic -fpic -g -O2 -fno-omit-frame-pointer -mno-omit-leaf-frame-pointer -ffile-prefix-map=/build/r-base-EawLoD/r-base-4.4.1=. -fstack-protector-strong -fstack-clash-protection -Wformat -Werror=format-security -fcf-protection -fdebug-prefix-map=/build/r-base-EawLoD/r-base-4.4.1=/usr/src/r-base-4.4.1-1.2404.0 -Wdate-time -D_FORTIFY_SOURCE=3 -c stri_time_zone.cpp -o stri_time_zone.o g++ -std=gnu++17 -I"/usr/share/R/include" -DNDEBUG -I. -UDEBUG -DNDEBUG -DU_HAVE_ELF_H -fpic -fpic -g -O2 -fno-omit-frame-pointer -mno-omit-leaf-frame-pointer -ffile-prefix-map=/build/r-base-EawLoD/r-base-4.4.1=. -fstack-protector-strong -fstack-clash-protection -Wformat -Werror=format-security -fcf-protection -fdebug-prefix-map=/build/r-base-EawLoD/r-base-4.4.1=/usr/src/r-base-4.4.1-1.2404.0 -Wdate-time -D_FORTIFY_SOURCE=3 -c stri_time_calendar.cpp -o stri_time_calendar.o g++ -std=gnu++17 -I"/usr/share/R/include" -DNDEBUG -I. -UDEBUG -DNDEBUG -DU_HAVE_ELF_H -fpic -fpic -g -O2 -fno-omit-frame-pointer -mno-omit-leaf-frame-pointer -ffile-prefix-map=/build/r-base-EawLoD/r-base-4.4.1=. -fstack-protector-strong -fstack-clash-protection -Wformat -Werror=format-security -fcf-protection -fdebug-prefix-map=/build/r-base-EawLoD/r-base-4.4.1=/usr/src/r-base-4.4.1-1.2404.0 -Wdate-time -D_FORTIFY_SOURCE=3 -c stri_time_symbols.cpp -o stri_time_symbols.o g++ -std=gnu++17 -I"/usr/share/R/include" -DNDEBUG -I. -UDEBUG -DNDEBUG -DU_HAVE_ELF_H -fpic -fpic -g -O2 -fno-omit-frame-pointer -mno-omit-leaf-frame-pointer -ffile-prefix-map=/build/r-base-EawLoD/r-base-4.4.1=. -fstack-protector-strong -fstack-clash-protection -Wformat -Werror=format-security -fcf-protection -fdebug-prefix-map=/build/r-base-EawLoD/r-base-4.4.1=/usr/src/r-base-4.4.1-1.2404.0 -Wdate-time -D_FORTIFY_SOURCE=3 -c stri_time_format.cpp -o stri_time_format.o g++ -std=gnu++17 -I"/usr/share/R/include" -DNDEBUG -I. -UDEBUG -DNDEBUG -DU_HAVE_ELF_H -fpic -fpic -g -O2 -fno-omit-frame-pointer -mno-omit-leaf-frame-pointer -ffile-prefix-map=/build/r-base-EawLoD/r-base-4.4.1=. -fstack-protector-strong -fstack-clash-protection -Wformat -Werror=format-security -fcf-protection -fdebug-prefix-map=/build/r-base-EawLoD/r-base-4.4.1=/usr/src/r-base-4.4.1-1.2404.0 -Wdate-time -D_FORTIFY_SOURCE=3 -c stri_trans_casemap.cpp -o stri_trans_casemap.o g++ -std=gnu++17 -I"/usr/share/R/include" -DNDEBUG -I. -UDEBUG -DNDEBUG -DU_HAVE_ELF_H -fpic -fpic -g -O2 -fno-omit-frame-pointer -mno-omit-leaf-frame-pointer -ffile-prefix-map=/build/r-base-EawLoD/r-base-4.4.1=. -fstack-protector-strong -fstack-clash-protection -Wformat -Werror=format-security -fcf-protection -fdebug-prefix-map=/build/r-base-EawLoD/r-base-4.4.1=/usr/src/r-base-4.4.1-1.2404.0 -Wdate-time -D_FORTIFY_SOURCE=3 -c stri_trans_other.cpp -o stri_trans_other.o g++ -std=gnu++17 -I"/usr/share/R/include" -DNDEBUG -I. -UDEBUG -DNDEBUG -DU_HAVE_ELF_H -fpic -fpic -g -O2 -fno-omit-frame-pointer -mno-omit-leaf-frame-pointer -ffile-prefix-map=/build/r-base-EawLoD/r-base-4.4.1=. -fstack-protector-strong -fstack-clash-protection -Wformat -Werror=format-security -fcf-protection -fdebug-prefix-map=/build/r-base-EawLoD/r-base-4.4.1=/usr/src/r-base-4.4.1-1.2404.0 -Wdate-time -D_FORTIFY_SOURCE=3 -c stri_trans_normalization.cpp -o stri_trans_normalization.o g++ -std=gnu++17 -I"/usr/share/R/include" -DNDEBUG -I. -UDEBUG -DNDEBUG -DU_HAVE_ELF_H -fpic -fpic -g -O2 -fno-omit-frame-pointer -mno-omit-leaf-frame-pointer -ffile-prefix-map=/build/r-base-EawLoD/r-base-4.4.1=. -fstack-protector-strong -fstack-clash-protection -Wformat -Werror=format-security -fcf-protection -fdebug-prefix-map=/build/r-base-EawLoD/r-base-4.4.1=/usr/src/r-base-4.4.1-1.2404.0 -Wdate-time -D_FORTIFY_SOURCE=3 -c stri_trans_transliterate.cpp -o stri_trans_transliterate.o g++ -std=gnu++17 -I"/usr/share/R/include" -DNDEBUG -I. -UDEBUG -DNDEBUG -DU_HAVE_ELF_H -fpic -fpic -g -O2 -fno-omit-frame-pointer -mno-omit-leaf-frame-pointer -ffile-prefix-map=/build/r-base-EawLoD/r-base-4.4.1=. -fstack-protector-strong -fstack-clash-protection -Wformat -Werror=format-security -fcf-protection -fdebug-prefix-map=/build/r-base-EawLoD/r-base-4.4.1=/usr/src/r-base-4.4.1-1.2404.0 -Wdate-time -D_FORTIFY_SOURCE=3 -c stri_ucnv.cpp -o stri_ucnv.o g++ -std=gnu++17 -I"/usr/share/R/include" -DNDEBUG -I. -UDEBUG -DNDEBUG -DU_HAVE_ELF_H -fpic -fpic -g -O2 -fno-omit-frame-pointer -mno-omit-leaf-frame-pointer -ffile-prefix-map=/build/r-base-EawLoD/r-base-4.4.1=. -fstack-protector-strong -fstack-clash-protection -Wformat -Werror=format-security -fcf-protection -fdebug-prefix-map=/build/r-base-EawLoD/r-base-4.4.1=/usr/src/r-base-4.4.1-1.2404.0 -Wdate-time -D_FORTIFY_SOURCE=3 -c stri_uloc.cpp -o stri_uloc.o g++ -std=gnu++17 -I"/usr/share/R/include" -DNDEBUG -I. -UDEBUG -DNDEBUG -DU_HAVE_ELF_H -fpic -fpic -g -O2 -fno-omit-frame-pointer -mno-omit-leaf-frame-pointer -ffile-prefix-map=/build/r-base-EawLoD/r-base-4.4.1=. -fstack-protector-strong -fstack-clash-protection -Wformat -Werror=format-security -fcf-protection -fdebug-prefix-map=/build/r-base-EawLoD/r-base-4.4.1=/usr/src/r-base-4.4.1-1.2404.0 -Wdate-time -D_FORTIFY_SOURCE=3 -c stri_utils.cpp -o stri_utils.o g++ -std=gnu++17 -I"/usr/share/R/include" -DNDEBUG -I. -UDEBUG -DNDEBUG -DU_HAVE_ELF_H -fpic -fpic -g -O2 -fno-omit-frame-pointer -mno-omit-leaf-frame-pointer -ffile-prefix-map=/build/r-base-EawLoD/r-base-4.4.1=. -fstack-protector-strong -fstack-clash-protection -Wformat -Werror=format-security -fcf-protection -fdebug-prefix-map=/build/r-base-EawLoD/r-base-4.4.1=/usr/src/r-base-4.4.1-1.2404.0 -Wdate-time -D_FORTIFY_SOURCE=3 -c stri_wrap.cpp -o stri_wrap.o g++ -std=gnu++17 -shared -L/usr/lib/R/lib -Wl,-Bsymbolic-functions -flto=auto -ffat-lto-objects -Wl,-z,relro -o stringi.so stri_brkiter.o stri_collator.o stri_common.o stri_compare.o stri_container_base.o stri_container_bytesearch.o stri_container_listint.o stri_container_listraw.o stri_container_listutf8.o stri_container_regex.o stri_container_usearch.o stri_container_utf16.o stri_container_utf8.o stri_container_utf8_indexable.o stri_encoding_conversion.o stri_encoding_detection.o stri_encoding_management.o stri_escape.o stri_exception.o stri_ICU_settings.o stri_join.o stri_length.o stri_pad.o stri_prepare_arg.o stri_random.o stri_reverse.o stri_search_class_count.o stri_search_class_detect.o stri_search_class_extract.o stri_search_class_locate.o stri_search_class_replace.o stri_search_class_split.o stri_search_class_startsendswith.o stri_search_class_subset.o stri_search_class_trim.o stri_search_common.o stri_search_coll_count.o stri_search_coll_detect.o stri_search_coll_extract.o stri_search_coll_locate.o stri_search_coll_replace.o stri_search_coll_split.o stri_search_coll_startsendswith.o stri_search_coll_subset.o stri_search_boundaries_count.o stri_search_boundaries_extract.o stri_search_boundaries_locate.o stri_search_boundaries_split.o stri_search_fixed_count.o stri_search_fixed_detect.o stri_search_fixed_extract.o stri_search_fixed_locate.o stri_search_fixed_replace.o stri_search_fixed_split.o stri_search_fixed_subset.o stri_search_fixed_startsendswith.o stri_search_in.o stri_search_other_split.o stri_search_regex_count.o stri_search_regex_detect.o stri_search_regex_extract.o stri_search_regex_locate.o stri_search_regex_match.o stri_search_regex_replace.o stri_search_regex_split.o stri_search_regex_subset.o stri_sort.o stri_sprintf.o stri_stats.o stri_string8.o stri_stringi.o stri_sub.o stri_test.o stri_time_zone.o stri_time_calendar.o stri_time_symbols.o stri_time_format.o stri_trans_casemap.o stri_trans_other.o stri_trans_normalization.o stri_trans_transliterate.o stri_ucnv.o stri_uloc.o stri_utils.o stri_wrap.o -L/usr/lib/x86_64-linux-gnu -licui18n -licuuc -licudata -L/usr/lib/R/lib -lR installing via 'install.libs.R' to /home/omnipath/local/R/4.4-3.20/00LOCK-stringi/00new/stringi ** R ** inst ** byte-compile and prepare package for lazy loading ** help *** installing help indices ** building package indices ** testing if installed package can be loaded from temporary location ** checking absolute paths in shared objects and dynamic libraries ** testing if installed package can be loaded from final location ** testing if installed package keeps a record of temporary installation path * DONE (stringi) * installing *source* package ‘generics’ ... ** package ‘generics’ 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 (generics) * installing *source* package ‘pkgconfig’ ... ** package ‘pkgconfig’ 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 (pkgconfig) * installing *source* package ‘plogr’ ... ** package ‘plogr’ 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 (plogr) * installing *source* package ‘cpp11’ ... ** package ‘cpp11’ successfully unpacked and MD5 sums checked ** using staged installation ** R ** inst ** byte-compile and prepare package for lazy loading ** help *** installing help indices ** building package indices ** installing vignettes ** testing if installed package can be loaded from temporary location ** testing if installed package can be loaded from final location ** testing if installed package keeps a record of temporary installation path * DONE (cpp11) * installing *source* package ‘jsonlite’ ... ** package ‘jsonlite’ successfully unpacked and MD5 sums checked ** using staged installation ** libs using C compiler: ‘gcc (Ubuntu 13.2.0-23ubuntu4) 13.2.0’ gcc -I"/usr/share/R/include" -DNDEBUG -Iyajl/api -fvisibility=hidden -fpic -g -O2 -fno-omit-frame-pointer -mno-omit-leaf-frame-pointer -ffile-prefix-map=/build/r-base-EawLoD/r-base-4.4.1=. -fstack-protector-strong -fstack-clash-protection -Wformat -Werror=format-security -fcf-protection -fdebug-prefix-map=/build/r-base-EawLoD/r-base-4.4.1=/usr/src/r-base-4.4.1-1.2404.0 -Wdate-time -D_FORTIFY_SOURCE=3 -c base64.c -o base64.o gcc -I"/usr/share/R/include" -DNDEBUG -Iyajl/api -fvisibility=hidden -fpic -g -O2 -fno-omit-frame-pointer -mno-omit-leaf-frame-pointer -ffile-prefix-map=/build/r-base-EawLoD/r-base-4.4.1=. -fstack-protector-strong -fstack-clash-protection -Wformat -Werror=format-security -fcf-protection -fdebug-prefix-map=/build/r-base-EawLoD/r-base-4.4.1=/usr/src/r-base-4.4.1-1.2404.0 -Wdate-time -D_FORTIFY_SOURCE=3 -c collapse_array.c -o collapse_array.o gcc -I"/usr/share/R/include" -DNDEBUG -Iyajl/api -fvisibility=hidden -fpic -g -O2 -fno-omit-frame-pointer -mno-omit-leaf-frame-pointer -ffile-prefix-map=/build/r-base-EawLoD/r-base-4.4.1=. -fstack-protector-strong -fstack-clash-protection -Wformat -Werror=format-security -fcf-protection -fdebug-prefix-map=/build/r-base-EawLoD/r-base-4.4.1=/usr/src/r-base-4.4.1-1.2404.0 -Wdate-time -D_FORTIFY_SOURCE=3 -c collapse_object.c -o collapse_object.o gcc -I"/usr/share/R/include" -DNDEBUG -Iyajl/api -fvisibility=hidden -fpic -g -O2 -fno-omit-frame-pointer -mno-omit-leaf-frame-pointer -ffile-prefix-map=/build/r-base-EawLoD/r-base-4.4.1=. -fstack-protector-strong -fstack-clash-protection -Wformat -Werror=format-security -fcf-protection -fdebug-prefix-map=/build/r-base-EawLoD/r-base-4.4.1=/usr/src/r-base-4.4.1-1.2404.0 -Wdate-time -D_FORTIFY_SOURCE=3 -c collapse_pretty.c -o collapse_pretty.o gcc -I"/usr/share/R/include" -DNDEBUG -Iyajl/api -fvisibility=hidden -fpic -g -O2 -fno-omit-frame-pointer -mno-omit-leaf-frame-pointer -ffile-prefix-map=/build/r-base-EawLoD/r-base-4.4.1=. -fstack-protector-strong -fstack-clash-protection -Wformat -Werror=format-security -fcf-protection -fdebug-prefix-map=/build/r-base-EawLoD/r-base-4.4.1=/usr/src/r-base-4.4.1-1.2404.0 -Wdate-time -D_FORTIFY_SOURCE=3 -c escape_chars.c -o escape_chars.o gcc -I"/usr/share/R/include" -DNDEBUG -Iyajl/api -fvisibility=hidden -fpic -g -O2 -fno-omit-frame-pointer -mno-omit-leaf-frame-pointer -ffile-prefix-map=/build/r-base-EawLoD/r-base-4.4.1=. -fstack-protector-strong -fstack-clash-protection -Wformat -Werror=format-security -fcf-protection -fdebug-prefix-map=/build/r-base-EawLoD/r-base-4.4.1=/usr/src/r-base-4.4.1-1.2404.0 -Wdate-time -D_FORTIFY_SOURCE=3 -c integer64_to_na.c -o integer64_to_na.o gcc -I"/usr/share/R/include" -DNDEBUG -Iyajl/api -fvisibility=hidden -fpic -g -O2 -fno-omit-frame-pointer -mno-omit-leaf-frame-pointer -ffile-prefix-map=/build/r-base-EawLoD/r-base-4.4.1=. -fstack-protector-strong -fstack-clash-protection -Wformat -Werror=format-security -fcf-protection -fdebug-prefix-map=/build/r-base-EawLoD/r-base-4.4.1=/usr/src/r-base-4.4.1-1.2404.0 -Wdate-time -D_FORTIFY_SOURCE=3 -c is_datelist.c -o is_datelist.o gcc -I"/usr/share/R/include" -DNDEBUG -Iyajl/api -fvisibility=hidden -fpic -g -O2 -fno-omit-frame-pointer -mno-omit-leaf-frame-pointer -ffile-prefix-map=/build/r-base-EawLoD/r-base-4.4.1=. -fstack-protector-strong -fstack-clash-protection -Wformat -Werror=format-security -fcf-protection -fdebug-prefix-map=/build/r-base-EawLoD/r-base-4.4.1=/usr/src/r-base-4.4.1-1.2404.0 -Wdate-time -D_FORTIFY_SOURCE=3 -c is_recordlist.c -o is_recordlist.o gcc -I"/usr/share/R/include" -DNDEBUG -Iyajl/api -fvisibility=hidden -fpic -g -O2 -fno-omit-frame-pointer -mno-omit-leaf-frame-pointer -ffile-prefix-map=/build/r-base-EawLoD/r-base-4.4.1=. -fstack-protector-strong -fstack-clash-protection -Wformat -Werror=format-security -fcf-protection -fdebug-prefix-map=/build/r-base-EawLoD/r-base-4.4.1=/usr/src/r-base-4.4.1-1.2404.0 -Wdate-time -D_FORTIFY_SOURCE=3 -c is_scalarlist.c -o is_scalarlist.o gcc -I"/usr/share/R/include" -DNDEBUG -Iyajl/api -fvisibility=hidden -fpic -g -O2 -fno-omit-frame-pointer -mno-omit-leaf-frame-pointer -ffile-prefix-map=/build/r-base-EawLoD/r-base-4.4.1=. -fstack-protector-strong -fstack-clash-protection -Wformat -Werror=format-security -fcf-protection -fdebug-prefix-map=/build/r-base-EawLoD/r-base-4.4.1=/usr/src/r-base-4.4.1-1.2404.0 -Wdate-time -D_FORTIFY_SOURCE=3 -c modp_numtoa.c -o modp_numtoa.o gcc -I"/usr/share/R/include" -DNDEBUG -Iyajl/api -fvisibility=hidden -fpic -g -O2 -fno-omit-frame-pointer -mno-omit-leaf-frame-pointer -ffile-prefix-map=/build/r-base-EawLoD/r-base-4.4.1=. -fstack-protector-strong -fstack-clash-protection -Wformat -Werror=format-security -fcf-protection -fdebug-prefix-map=/build/r-base-EawLoD/r-base-4.4.1=/usr/src/r-base-4.4.1-1.2404.0 -Wdate-time -D_FORTIFY_SOURCE=3 -c null_to_na.c -o null_to_na.o gcc -I"/usr/share/R/include" -DNDEBUG -Iyajl/api -fvisibility=hidden -fpic -g -O2 -fno-omit-frame-pointer -mno-omit-leaf-frame-pointer -ffile-prefix-map=/build/r-base-EawLoD/r-base-4.4.1=. -fstack-protector-strong -fstack-clash-protection -Wformat -Werror=format-security -fcf-protection -fdebug-prefix-map=/build/r-base-EawLoD/r-base-4.4.1=/usr/src/r-base-4.4.1-1.2404.0 -Wdate-time -D_FORTIFY_SOURCE=3 -c num_to_char.c -o num_to_char.o gcc -I"/usr/share/R/include" -DNDEBUG -Iyajl/api -fvisibility=hidden -fpic -g -O2 -fno-omit-frame-pointer -mno-omit-leaf-frame-pointer -ffile-prefix-map=/build/r-base-EawLoD/r-base-4.4.1=. -fstack-protector-strong -fstack-clash-protection -Wformat -Werror=format-security -fcf-protection -fdebug-prefix-map=/build/r-base-EawLoD/r-base-4.4.1=/usr/src/r-base-4.4.1-1.2404.0 -Wdate-time -D_FORTIFY_SOURCE=3 -c parse.c -o parse.o gcc -I"/usr/share/R/include" -DNDEBUG -Iyajl/api -fvisibility=hidden -fpic -g -O2 -fno-omit-frame-pointer -mno-omit-leaf-frame-pointer -ffile-prefix-map=/build/r-base-EawLoD/r-base-4.4.1=. -fstack-protector-strong -fstack-clash-protection -Wformat -Werror=format-security -fcf-protection -fdebug-prefix-map=/build/r-base-EawLoD/r-base-4.4.1=/usr/src/r-base-4.4.1-1.2404.0 -Wdate-time -D_FORTIFY_SOURCE=3 -c prettify.c -o prettify.o gcc -I"/usr/share/R/include" -DNDEBUG -Iyajl/api -fvisibility=hidden -fpic -g -O2 -fno-omit-frame-pointer -mno-omit-leaf-frame-pointer -ffile-prefix-map=/build/r-base-EawLoD/r-base-4.4.1=. -fstack-protector-strong -fstack-clash-protection -Wformat -Werror=format-security -fcf-protection -fdebug-prefix-map=/build/r-base-EawLoD/r-base-4.4.1=/usr/src/r-base-4.4.1-1.2404.0 -Wdate-time -D_FORTIFY_SOURCE=3 -c push_parser.c -o push_parser.o gcc -I"/usr/share/R/include" -DNDEBUG -Iyajl/api -fvisibility=hidden -fpic -g -O2 -fno-omit-frame-pointer -mno-omit-leaf-frame-pointer -ffile-prefix-map=/build/r-base-EawLoD/r-base-4.4.1=. -fstack-protector-strong -fstack-clash-protection -Wformat -Werror=format-security -fcf-protection -fdebug-prefix-map=/build/r-base-EawLoD/r-base-4.4.1=/usr/src/r-base-4.4.1-1.2404.0 -Wdate-time -D_FORTIFY_SOURCE=3 -c r-base64.c -o r-base64.o gcc -I"/usr/share/R/include" -DNDEBUG -Iyajl/api -fvisibility=hidden -fpic -g -O2 -fno-omit-frame-pointer -mno-omit-leaf-frame-pointer -ffile-prefix-map=/build/r-base-EawLoD/r-base-4.4.1=. -fstack-protector-strong -fstack-clash-protection -Wformat -Werror=format-security -fcf-protection -fdebug-prefix-map=/build/r-base-EawLoD/r-base-4.4.1=/usr/src/r-base-4.4.1-1.2404.0 -Wdate-time -D_FORTIFY_SOURCE=3 -c register.c -o register.o gcc -I"/usr/share/R/include" -DNDEBUG -Iyajl/api -fvisibility=hidden -fpic -g -O2 -fno-omit-frame-pointer -mno-omit-leaf-frame-pointer -ffile-prefix-map=/build/r-base-EawLoD/r-base-4.4.1=. -fstack-protector-strong -fstack-clash-protection -Wformat -Werror=format-security -fcf-protection -fdebug-prefix-map=/build/r-base-EawLoD/r-base-4.4.1=/usr/src/r-base-4.4.1-1.2404.0 -Wdate-time -D_FORTIFY_SOURCE=3 -c row_collapse.c -o row_collapse.o gcc -I"/usr/share/R/include" -DNDEBUG -Iyajl/api -fvisibility=hidden -fpic -g -O2 -fno-omit-frame-pointer -mno-omit-leaf-frame-pointer -ffile-prefix-map=/build/r-base-EawLoD/r-base-4.4.1=. -fstack-protector-strong -fstack-clash-protection -Wformat -Werror=format-security -fcf-protection -fdebug-prefix-map=/build/r-base-EawLoD/r-base-4.4.1=/usr/src/r-base-4.4.1-1.2404.0 -Wdate-time -D_FORTIFY_SOURCE=3 -c transpose_list.c -o transpose_list.o gcc -I"/usr/share/R/include" -DNDEBUG -Iyajl/api -fvisibility=hidden -fpic -g -O2 -fno-omit-frame-pointer -mno-omit-leaf-frame-pointer -ffile-prefix-map=/build/r-base-EawLoD/r-base-4.4.1=. -fstack-protector-strong -fstack-clash-protection -Wformat -Werror=format-security -fcf-protection -fdebug-prefix-map=/build/r-base-EawLoD/r-base-4.4.1=/usr/src/r-base-4.4.1-1.2404.0 -Wdate-time -D_FORTIFY_SOURCE=3 -c validate.c -o validate.o gcc -I"/usr/share/R/include" -DNDEBUG -Iyajl/api -fvisibility=hidden -fpic -g -O2 -fno-omit-frame-pointer -mno-omit-leaf-frame-pointer -ffile-prefix-map=/build/r-base-EawLoD/r-base-4.4.1=. -fstack-protector-strong -fstack-clash-protection -Wformat -Werror=format-security -fcf-protection -fdebug-prefix-map=/build/r-base-EawLoD/r-base-4.4.1=/usr/src/r-base-4.4.1-1.2404.0 -Wdate-time -D_FORTIFY_SOURCE=3 -c yajl/yajl.c -o yajl/yajl.o gcc -I"/usr/share/R/include" -DNDEBUG -Iyajl/api -fvisibility=hidden -fpic -g -O2 -fno-omit-frame-pointer -mno-omit-leaf-frame-pointer -ffile-prefix-map=/build/r-base-EawLoD/r-base-4.4.1=. -fstack-protector-strong -fstack-clash-protection -Wformat -Werror=format-security -fcf-protection -fdebug-prefix-map=/build/r-base-EawLoD/r-base-4.4.1=/usr/src/r-base-4.4.1-1.2404.0 -Wdate-time -D_FORTIFY_SOURCE=3 -c yajl/yajl_alloc.c -o yajl/yajl_alloc.o gcc -I"/usr/share/R/include" -DNDEBUG -Iyajl/api -fvisibility=hidden -fpic -g -O2 -fno-omit-frame-pointer -mno-omit-leaf-frame-pointer -ffile-prefix-map=/build/r-base-EawLoD/r-base-4.4.1=. -fstack-protector-strong -fstack-clash-protection -Wformat -Werror=format-security -fcf-protection -fdebug-prefix-map=/build/r-base-EawLoD/r-base-4.4.1=/usr/src/r-base-4.4.1-1.2404.0 -Wdate-time -D_FORTIFY_SOURCE=3 -c yajl/yajl_buf.c -o yajl/yajl_buf.o gcc -I"/usr/share/R/include" -DNDEBUG -Iyajl/api -fvisibility=hidden -fpic -g -O2 -fno-omit-frame-pointer -mno-omit-leaf-frame-pointer -ffile-prefix-map=/build/r-base-EawLoD/r-base-4.4.1=. -fstack-protector-strong -fstack-clash-protection -Wformat -Werror=format-security -fcf-protection -fdebug-prefix-map=/build/r-base-EawLoD/r-base-4.4.1=/usr/src/r-base-4.4.1-1.2404.0 -Wdate-time -D_FORTIFY_SOURCE=3 -c yajl/yajl_encode.c -o yajl/yajl_encode.o gcc -I"/usr/share/R/include" -DNDEBUG -Iyajl/api -fvisibility=hidden -fpic -g -O2 -fno-omit-frame-pointer -mno-omit-leaf-frame-pointer -ffile-prefix-map=/build/r-base-EawLoD/r-base-4.4.1=. -fstack-protector-strong -fstack-clash-protection -Wformat -Werror=format-security -fcf-protection -fdebug-prefix-map=/build/r-base-EawLoD/r-base-4.4.1=/usr/src/r-base-4.4.1-1.2404.0 -Wdate-time -D_FORTIFY_SOURCE=3 -c yajl/yajl_gen.c -o yajl/yajl_gen.o gcc -I"/usr/share/R/include" -DNDEBUG -Iyajl/api -fvisibility=hidden -fpic -g -O2 -fno-omit-frame-pointer -mno-omit-leaf-frame-pointer -ffile-prefix-map=/build/r-base-EawLoD/r-base-4.4.1=. -fstack-protector-strong -fstack-clash-protection -Wformat -Werror=format-security -fcf-protection -fdebug-prefix-map=/build/r-base-EawLoD/r-base-4.4.1=/usr/src/r-base-4.4.1-1.2404.0 -Wdate-time -D_FORTIFY_SOURCE=3 -c yajl/yajl_lex.c -o yajl/yajl_lex.o gcc -I"/usr/share/R/include" -DNDEBUG -Iyajl/api -fvisibility=hidden -fpic -g -O2 -fno-omit-frame-pointer -mno-omit-leaf-frame-pointer -ffile-prefix-map=/build/r-base-EawLoD/r-base-4.4.1=. -fstack-protector-strong -fstack-clash-protection -Wformat -Werror=format-security -fcf-protection -fdebug-prefix-map=/build/r-base-EawLoD/r-base-4.4.1=/usr/src/r-base-4.4.1-1.2404.0 -Wdate-time -D_FORTIFY_SOURCE=3 -c yajl/yajl_parser.c -o yajl/yajl_parser.o gcc -I"/usr/share/R/include" -DNDEBUG -Iyajl/api -fvisibility=hidden -fpic -g -O2 -fno-omit-frame-pointer -mno-omit-leaf-frame-pointer -ffile-prefix-map=/build/r-base-EawLoD/r-base-4.4.1=. -fstack-protector-strong -fstack-clash-protection -Wformat -Werror=format-security -fcf-protection -fdebug-prefix-map=/build/r-base-EawLoD/r-base-4.4.1=/usr/src/r-base-4.4.1-1.2404.0 -Wdate-time -D_FORTIFY_SOURCE=3 -c yajl/yajl_tree.c -o yajl/yajl_tree.o ar rcs yajl/libstatyajl.a yajl/yajl.o yajl/yajl_alloc.o yajl/yajl_buf.o yajl/yajl_encode.o yajl/yajl_gen.o yajl/yajl_lex.o yajl/yajl_parser.o yajl/yajl_tree.o gcc -shared -L/usr/lib/R/lib -Wl,-Bsymbolic-functions -flto=auto -ffat-lto-objects -Wl,-z,relro -o jsonlite.so base64.o collapse_array.o collapse_object.o collapse_pretty.o escape_chars.o integer64_to_na.o is_datelist.o is_recordlist.o is_scalarlist.o modp_numtoa.o null_to_na.o num_to_char.o parse.o prettify.o push_parser.o r-base64.o register.o row_collapse.o transpose_list.o validate.o -Lyajl -lstatyajl -L/usr/lib/R/lib -lR installing to /home/omnipath/local/R/4.4-3.20/00LOCK-jsonlite/00new/jsonlite/libs ** R ** inst ** byte-compile and prepare package for lazy loading in method for ‘asJSON’ with signature ‘"AsIs"’: no definition for class “AsIs” in method for ‘asJSON’ with signature ‘"ITime"’: no definition for class “ITime” in method for ‘asJSON’ with signature ‘"hms"’: no definition for class “hms” in method for ‘asJSON’ with signature ‘"json"’: no definition for class “json” in method for ‘asJSON’ with signature ‘"integer64"’: no definition for class “integer64” in method for ‘asJSON’ with signature ‘"pairlist"’: no definition for class “pairlist” in method for ‘asJSON’ with signature ‘"blob"’: no definition for class “blob” in method for ‘asJSON’ with signature ‘"scalar"’: no definition for class “scalar” in method for ‘asJSON’ with signature ‘"sf"’: no definition for class “sf” in method for ‘asJSON’ with signature ‘"sfc"’: no definition for class “sfc” in method for ‘asJSON’ with signature ‘"vctrs_vctr"’: no definition for class “vctrs_vctr” ** 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 (jsonlite) * installing *source* package ‘mime’ ... ** package ‘mime’ successfully unpacked and MD5 sums checked ** using staged installation ** libs using C compiler: ‘gcc (Ubuntu 13.2.0-23ubuntu4) 13.2.0’ gcc -I"/usr/share/R/include" -DNDEBUG -fpic -g -O2 -fno-omit-frame-pointer -mno-omit-leaf-frame-pointer -ffile-prefix-map=/build/r-base-EawLoD/r-base-4.4.1=. -fstack-protector-strong -fstack-clash-protection -Wformat -Werror=format-security -fcf-protection -fdebug-prefix-map=/build/r-base-EawLoD/r-base-4.4.1=/usr/src/r-base-4.4.1-1.2404.0 -Wdate-time -D_FORTIFY_SOURCE=3 -c init.c -o init.o gcc -I"/usr/share/R/include" -DNDEBUG -fpic -g -O2 -fno-omit-frame-pointer -mno-omit-leaf-frame-pointer -ffile-prefix-map=/build/r-base-EawLoD/r-base-4.4.1=. -fstack-protector-strong -fstack-clash-protection -Wformat -Werror=format-security -fcf-protection -fdebug-prefix-map=/build/r-base-EawLoD/r-base-4.4.1=/usr/src/r-base-4.4.1-1.2404.0 -Wdate-time -D_FORTIFY_SOURCE=3 -c rawmatch.c -o rawmatch.o gcc -shared -L/usr/lib/R/lib -Wl,-Bsymbolic-functions -flto=auto -ffat-lto-objects -Wl,-z,relro -o mime.so init.o rawmatch.o -L/usr/lib/R/lib -lR installing to /home/omnipath/local/R/4.4-3.20/00LOCK-mime/00new/mime/libs ** R ** inst ** byte-compile and prepare package for lazy loading ** help *** installing help indices ** building package indices ** testing if installed package can be loaded from temporary location ** checking absolute paths in shared objects and dynamic libraries ** testing if installed package can be loaded from final location ** testing if installed package keeps a record of temporary installation path * DONE (mime) * installing *source* package ‘BH’ ... ** package ‘BH’ successfully unpacked and MD5 sums checked ** using staged installation ** inst ** 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 (BH) * installing *source* package ‘bitops’ ... ** package ‘bitops’ successfully unpacked and MD5 sums checked ** using staged installation ** libs using C compiler: ‘gcc (Ubuntu 13.2.0-23ubuntu4) 13.2.0’ gcc -I"/usr/share/R/include" -DNDEBUG -fpic -g -O2 -fno-omit-frame-pointer -mno-omit-leaf-frame-pointer -ffile-prefix-map=/build/r-base-EawLoD/r-base-4.4.1=. -fstack-protector-strong -fstack-clash-protection -Wformat -Werror=format-security -fcf-protection -fdebug-prefix-map=/build/r-base-EawLoD/r-base-4.4.1=/usr/src/r-base-4.4.1-1.2404.0 -Wdate-time -D_FORTIFY_SOURCE=3 -c bit-ops.c -o bit-ops.o gcc -I"/usr/share/R/include" -DNDEBUG -fpic -g -O2 -fno-omit-frame-pointer -mno-omit-leaf-frame-pointer -ffile-prefix-map=/build/r-base-EawLoD/r-base-4.4.1=. -fstack-protector-strong -fstack-clash-protection -Wformat -Werror=format-security -fcf-protection -fdebug-prefix-map=/build/r-base-EawLoD/r-base-4.4.1=/usr/src/r-base-4.4.1-1.2404.0 -Wdate-time -D_FORTIFY_SOURCE=3 -c cksum.c -o cksum.o gcc -I"/usr/share/R/include" -DNDEBUG -fpic -g -O2 -fno-omit-frame-pointer -mno-omit-leaf-frame-pointer -ffile-prefix-map=/build/r-base-EawLoD/r-base-4.4.1=. -fstack-protector-strong -fstack-clash-protection -Wformat -Werror=format-security -fcf-protection -fdebug-prefix-map=/build/r-base-EawLoD/r-base-4.4.1=/usr/src/r-base-4.4.1-1.2404.0 -Wdate-time -D_FORTIFY_SOURCE=3 -c init.c -o init.o gcc -shared -L/usr/lib/R/lib -Wl,-Bsymbolic-functions -flto=auto -ffat-lto-objects -Wl,-z,relro -o bitops.so bit-ops.o cksum.o init.o -L/usr/lib/R/lib -lR installing to /home/omnipath/local/R/4.4-3.20/00LOCK-bitops/00new/bitops/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 (bitops) * installing *source* package ‘ps’ ... ** package ‘ps’ successfully unpacked and MD5 sums checked ** using staged installation ** libs using C compiler: ‘gcc (Ubuntu 13.2.0-23ubuntu4) 13.2.0’ gcc -g -O2 -fno-omit-frame-pointer -mno-omit-leaf-frame-pointer -ffile-prefix-map=/build/r-base-EawLoD/r-base-4.4.1=. -fstack-protector-strong -fstack-clash-protection -Wformat -Werror=format-security -fcf-protection -fdebug-prefix-map=/build/r-base-EawLoD/r-base-4.4.1=/usr/src/r-base-4.4.1-1.2404.0 -Wdate-time -D_FORTIFY_SOURCE=3 -Wl,-Bsymbolic-functions -flto=auto -ffat-lto-objects -Wl,-z,relro -Wall px.c -o px In file included from /usr/include/features.h:502, from /usr/include/unistd.h:25, from px.c:6: In function ‘read’, inlined from ‘echo_from_fd’ at px.c:79:9: /usr/include/x86_64-linux-gnu/bits/unistd.h:28:10: warning: ‘*read’ specified size 18446744073709551614 exceeds maximum object size 9223372036854775807 [-Wstringop-overflow=] 28 | return __glibc_fortify (read, __nbytes, sizeof (char), | ^~~~~~~~~~~~~~~ /usr/include/x86_64-linux-gnu/bits/unistd-decl.h: In function ‘echo_from_fd’: /usr/include/x86_64-linux-gnu/bits/unistd-decl.h:29:16: note: in a call to function ‘*read’ declared with attribute ‘access (write_only, 2, 3)’ 29 | extern ssize_t __REDIRECT_FORTIFY (__read_alias, (int __fd, void *__buf, | ^~~~~~~~~~~~~~~~~~ In function ‘read’, inlined from ‘echo_from_fd’ at px.c:79:9, inlined from ‘main’ at px.c:170:11: /usr/include/x86_64-linux-gnu/bits/unistd.h:28:10: warning: ‘__read_alias’ specified size 18446744073709551614 exceeds maximum object size 9223372036854775807 [-Wstringop-overflow=] 28 | return __glibc_fortify (read, __nbytes, sizeof (char), | ^ /usr/include/x86_64-linux-gnu/bits/unistd-decl.h: In function ‘main’: /usr/include/x86_64-linux-gnu/bits/unistd-decl.h:29:16: note: in a call to function ‘__read_alias’ declared with attribute ‘access (write_only, 2, 3)’ 29 | extern ssize_t __REDIRECT_FORTIFY (__read_alias, (int __fd, void *__buf, | ^ gcc -I"/usr/share/R/include" -DNDEBUG -fpic -g -O2 -fno-omit-frame-pointer -mno-omit-leaf-frame-pointer -ffile-prefix-map=/build/r-base-EawLoD/r-base-4.4.1=. -fstack-protector-strong -fstack-clash-protection -Wformat -Werror=format-security -fcf-protection -fdebug-prefix-map=/build/r-base-EawLoD/r-base-4.4.1=/usr/src/r-base-4.4.1-1.2404.0 -Wdate-time -D_FORTIFY_SOURCE=3 -c init.c -o init.o gcc -I"/usr/share/R/include" -DNDEBUG -fpic -g -O2 -fno-omit-frame-pointer -mno-omit-leaf-frame-pointer -ffile-prefix-map=/build/r-base-EawLoD/r-base-4.4.1=. -fstack-protector-strong -fstack-clash-protection -Wformat -Werror=format-security -fcf-protection -fdebug-prefix-map=/build/r-base-EawLoD/r-base-4.4.1=/usr/src/r-base-4.4.1-1.2404.0 -Wdate-time -D_FORTIFY_SOURCE=3 -c api-common.c -o api-common.o gcc -I"/usr/share/R/include" -DNDEBUG -fpic -g -O2 -fno-omit-frame-pointer -mno-omit-leaf-frame-pointer -ffile-prefix-map=/build/r-base-EawLoD/r-base-4.4.1=. -fstack-protector-strong -fstack-clash-protection -Wformat -Werror=format-security -fcf-protection -fdebug-prefix-map=/build/r-base-EawLoD/r-base-4.4.1=/usr/src/r-base-4.4.1-1.2404.0 -Wdate-time -D_FORTIFY_SOURCE=3 -c common.c -o common.o gcc -I"/usr/share/R/include" -DNDEBUG -fpic -g -O2 -fno-omit-frame-pointer -mno-omit-leaf-frame-pointer -ffile-prefix-map=/build/r-base-EawLoD/r-base-4.4.1=. -fstack-protector-strong -fstack-clash-protection -Wformat -Werror=format-security -fcf-protection -fdebug-prefix-map=/build/r-base-EawLoD/r-base-4.4.1=/usr/src/r-base-4.4.1-1.2404.0 -Wdate-time -D_FORTIFY_SOURCE=3 -c extra.c -o extra.o gcc -I"/usr/share/R/include" -DNDEBUG -fpic -g -O2 -fno-omit-frame-pointer -mno-omit-leaf-frame-pointer -ffile-prefix-map=/build/r-base-EawLoD/r-base-4.4.1=. -fstack-protector-strong -fstack-clash-protection -Wformat -Werror=format-security -fcf-protection -fdebug-prefix-map=/build/r-base-EawLoD/r-base-4.4.1=/usr/src/r-base-4.4.1-1.2404.0 -Wdate-time -D_FORTIFY_SOURCE=3 -c dummy.c -o dummy.o gcc -I"/usr/share/R/include" -DNDEBUG -fpic -g -O2 -fno-omit-frame-pointer -mno-omit-leaf-frame-pointer -ffile-prefix-map=/build/r-base-EawLoD/r-base-4.4.1=. -fstack-protector-strong -fstack-clash-protection -Wformat -Werror=format-security -fcf-protection -fdebug-prefix-map=/build/r-base-EawLoD/r-base-4.4.1=/usr/src/r-base-4.4.1-1.2404.0 -Wdate-time -D_FORTIFY_SOURCE=3 -c error-codes.c -o error-codes.o gcc -I"/usr/share/R/include" -DNDEBUG -fpic -g -O2 -fno-omit-frame-pointer -mno-omit-leaf-frame-pointer -ffile-prefix-map=/build/r-base-EawLoD/r-base-4.4.1=. -fstack-protector-strong -fstack-clash-protection -Wformat -Werror=format-security -fcf-protection -fdebug-prefix-map=/build/r-base-EawLoD/r-base-4.4.1=/usr/src/r-base-4.4.1-1.2404.0 -Wdate-time -D_FORTIFY_SOURCE=3 -c posix.c -o posix.o gcc -I"/usr/share/R/include" -DNDEBUG -fpic -g -O2 -fno-omit-frame-pointer -mno-omit-leaf-frame-pointer -ffile-prefix-map=/build/r-base-EawLoD/r-base-4.4.1=. -fstack-protector-strong -fstack-clash-protection -Wformat -Werror=format-security -fcf-protection -fdebug-prefix-map=/build/r-base-EawLoD/r-base-4.4.1=/usr/src/r-base-4.4.1-1.2404.0 -Wdate-time -D_FORTIFY_SOURCE=3 -c api-posix.c -o api-posix.o gcc -I"/usr/share/R/include" -DNDEBUG -fpic -g -O2 -fno-omit-frame-pointer -mno-omit-leaf-frame-pointer -ffile-prefix-map=/build/r-base-EawLoD/r-base-4.4.1=. -fstack-protector-strong -fstack-clash-protection -Wformat -Werror=format-security -fcf-protection -fdebug-prefix-map=/build/r-base-EawLoD/r-base-4.4.1=/usr/src/r-base-4.4.1-1.2404.0 -Wdate-time -D_FORTIFY_SOURCE=3 -c linux.c -o linux.o gcc -I"/usr/share/R/include" -DNDEBUG -fpic -g -O2 -fno-omit-frame-pointer -mno-omit-leaf-frame-pointer -ffile-prefix-map=/build/r-base-EawLoD/r-base-4.4.1=. -fstack-protector-strong -fstack-clash-protection -Wformat -Werror=format-security -fcf-protection -fdebug-prefix-map=/build/r-base-EawLoD/r-base-4.4.1=/usr/src/r-base-4.4.1-1.2404.0 -Wdate-time -D_FORTIFY_SOURCE=3 -c api-linux.c -o api-linux.o gcc -shared -L/usr/lib/R/lib -Wl,-Bsymbolic-functions -flto=auto -ffat-lto-objects -Wl,-z,relro -o ps.so init.o api-common.o common.o extra.o dummy.o error-codes.o posix.o api-posix.o linux.o api-linux.o -L/usr/lib/R/lib -lR installing via 'install.libs.R' to /home/omnipath/local/R/4.4-3.20/00LOCK-ps/00new/ps ** R ** inst ** byte-compile and prepare package for lazy loading ** help *** installing help indices ** building package indices ** testing if installed package can be loaded from temporary location ** checking absolute paths in shared objects and dynamic libraries ** testing if installed package can be loaded from final location ** testing if installed package keeps a record of temporary installation path * DONE (ps) * installing *source* package ‘fansi’ ... ** package ‘fansi’ successfully unpacked and MD5 sums checked ** using staged installation ** libs using C compiler: ‘gcc (Ubuntu 13.2.0-23ubuntu4) 13.2.0’ gcc -I"/usr/share/R/include" -DNDEBUG -fvisibility=hidden -fpic -g -O2 -fno-omit-frame-pointer -mno-omit-leaf-frame-pointer -ffile-prefix-map=/build/r-base-EawLoD/r-base-4.4.1=. -fstack-protector-strong -fstack-clash-protection -Wformat -Werror=format-security -fcf-protection -fdebug-prefix-map=/build/r-base-EawLoD/r-base-4.4.1=/usr/src/r-base-4.4.1-1.2404.0 -Wdate-time -D_FORTIFY_SOURCE=3 -c assumptions.c -o assumptions.o gcc -I"/usr/share/R/include" -DNDEBUG -fvisibility=hidden -fpic -g -O2 -fno-omit-frame-pointer -mno-omit-leaf-frame-pointer -ffile-prefix-map=/build/r-base-EawLoD/r-base-4.4.1=. -fstack-protector-strong -fstack-clash-protection -Wformat -Werror=format-security -fcf-protection -fdebug-prefix-map=/build/r-base-EawLoD/r-base-4.4.1=/usr/src/r-base-4.4.1-1.2404.0 -Wdate-time -D_FORTIFY_SOURCE=3 -c carry.c -o carry.o gcc -I"/usr/share/R/include" -DNDEBUG -fvisibility=hidden -fpic -g -O2 -fno-omit-frame-pointer -mno-omit-leaf-frame-pointer -ffile-prefix-map=/build/r-base-EawLoD/r-base-4.4.1=. -fstack-protector-strong -fstack-clash-protection -Wformat -Werror=format-security -fcf-protection -fdebug-prefix-map=/build/r-base-EawLoD/r-base-4.4.1=/usr/src/r-base-4.4.1-1.2404.0 -Wdate-time -D_FORTIFY_SOURCE=3 -c has.c -o has.o gcc -I"/usr/share/R/include" -DNDEBUG -fvisibility=hidden -fpic -g -O2 -fno-omit-frame-pointer -mno-omit-leaf-frame-pointer -ffile-prefix-map=/build/r-base-EawLoD/r-base-4.4.1=. -fstack-protector-strong -fstack-clash-protection -Wformat -Werror=format-security -fcf-protection -fdebug-prefix-map=/build/r-base-EawLoD/r-base-4.4.1=/usr/src/r-base-4.4.1-1.2404.0 -Wdate-time -D_FORTIFY_SOURCE=3 -c init.c -o init.o gcc -I"/usr/share/R/include" -DNDEBUG -fvisibility=hidden -fpic -g -O2 -fno-omit-frame-pointer -mno-omit-leaf-frame-pointer -ffile-prefix-map=/build/r-base-EawLoD/r-base-4.4.1=. -fstack-protector-strong -fstack-clash-protection -Wformat -Werror=format-security -fcf-protection -fdebug-prefix-map=/build/r-base-EawLoD/r-base-4.4.1=/usr/src/r-base-4.4.1-1.2404.0 -Wdate-time -D_FORTIFY_SOURCE=3 -c nchar.c -o nchar.o gcc -I"/usr/share/R/include" -DNDEBUG -fvisibility=hidden -fpic -g -O2 -fno-omit-frame-pointer -mno-omit-leaf-frame-pointer -ffile-prefix-map=/build/r-base-EawLoD/r-base-4.4.1=. -fstack-protector-strong -fstack-clash-protection -Wformat -Werror=format-security -fcf-protection -fdebug-prefix-map=/build/r-base-EawLoD/r-base-4.4.1=/usr/src/r-base-4.4.1-1.2404.0 -Wdate-time -D_FORTIFY_SOURCE=3 -c normalize.c -o normalize.o gcc -I"/usr/share/R/include" -DNDEBUG -fvisibility=hidden -fpic -g -O2 -fno-omit-frame-pointer -mno-omit-leaf-frame-pointer -ffile-prefix-map=/build/r-base-EawLoD/r-base-4.4.1=. -fstack-protector-strong -fstack-clash-protection -Wformat -Werror=format-security -fcf-protection -fdebug-prefix-map=/build/r-base-EawLoD/r-base-4.4.1=/usr/src/r-base-4.4.1-1.2404.0 -Wdate-time -D_FORTIFY_SOURCE=3 -c read.c -o read.o gcc -I"/usr/share/R/include" -DNDEBUG -fvisibility=hidden -fpic -g -O2 -fno-omit-frame-pointer -mno-omit-leaf-frame-pointer -ffile-prefix-map=/build/r-base-EawLoD/r-base-4.4.1=. -fstack-protector-strong -fstack-clash-protection -Wformat -Werror=format-security -fcf-protection -fdebug-prefix-map=/build/r-base-EawLoD/r-base-4.4.1=/usr/src/r-base-4.4.1-1.2404.0 -Wdate-time -D_FORTIFY_SOURCE=3 -c rnchar.c -o rnchar.o gcc -I"/usr/share/R/include" -DNDEBUG -fvisibility=hidden -fpic -g -O2 -fno-omit-frame-pointer -mno-omit-leaf-frame-pointer -ffile-prefix-map=/build/r-base-EawLoD/r-base-4.4.1=. -fstack-protector-strong -fstack-clash-protection -Wformat -Werror=format-security -fcf-protection -fdebug-prefix-map=/build/r-base-EawLoD/r-base-4.4.1=/usr/src/r-base-4.4.1-1.2404.0 -Wdate-time -D_FORTIFY_SOURCE=3 -c state.c -o state.o gcc -I"/usr/share/R/include" -DNDEBUG -fvisibility=hidden -fpic -g -O2 -fno-omit-frame-pointer -mno-omit-leaf-frame-pointer -ffile-prefix-map=/build/r-base-EawLoD/r-base-4.4.1=. -fstack-protector-strong -fstack-clash-protection -Wformat -Werror=format-security -fcf-protection -fdebug-prefix-map=/build/r-base-EawLoD/r-base-4.4.1=/usr/src/r-base-4.4.1-1.2404.0 -Wdate-time -D_FORTIFY_SOURCE=3 -c strip.c -o strip.o gcc -I"/usr/share/R/include" -DNDEBUG -fvisibility=hidden -fpic -g -O2 -fno-omit-frame-pointer -mno-omit-leaf-frame-pointer -ffile-prefix-map=/build/r-base-EawLoD/r-base-4.4.1=. -fstack-protector-strong -fstack-clash-protection -Wformat -Werror=format-security -fcf-protection -fdebug-prefix-map=/build/r-base-EawLoD/r-base-4.4.1=/usr/src/r-base-4.4.1-1.2404.0 -Wdate-time -D_FORTIFY_SOURCE=3 -c substr.c -o substr.o gcc -I"/usr/share/R/include" -DNDEBUG -fvisibility=hidden -fpic -g -O2 -fno-omit-frame-pointer -mno-omit-leaf-frame-pointer -ffile-prefix-map=/build/r-base-EawLoD/r-base-4.4.1=. -fstack-protector-strong -fstack-clash-protection -Wformat -Werror=format-security -fcf-protection -fdebug-prefix-map=/build/r-base-EawLoD/r-base-4.4.1=/usr/src/r-base-4.4.1-1.2404.0 -Wdate-time -D_FORTIFY_SOURCE=3 -c tabs.c -o tabs.o gcc -I"/usr/share/R/include" -DNDEBUG -fvisibility=hidden -fpic -g -O2 -fno-omit-frame-pointer -mno-omit-leaf-frame-pointer -ffile-prefix-map=/build/r-base-EawLoD/r-base-4.4.1=. -fstack-protector-strong -fstack-clash-protection -Wformat -Werror=format-security -fcf-protection -fdebug-prefix-map=/build/r-base-EawLoD/r-base-4.4.1=/usr/src/r-base-4.4.1-1.2404.0 -Wdate-time -D_FORTIFY_SOURCE=3 -c tohtml.c -o tohtml.o gcc -I"/usr/share/R/include" -DNDEBUG -fvisibility=hidden -fpic -g -O2 -fno-omit-frame-pointer -mno-omit-leaf-frame-pointer -ffile-prefix-map=/build/r-base-EawLoD/r-base-4.4.1=. -fstack-protector-strong -fstack-clash-protection -Wformat -Werror=format-security -fcf-protection -fdebug-prefix-map=/build/r-base-EawLoD/r-base-4.4.1=/usr/src/r-base-4.4.1-1.2404.0 -Wdate-time -D_FORTIFY_SOURCE=3 -c trimws.c -o trimws.o gcc -I"/usr/share/R/include" -DNDEBUG -fvisibility=hidden -fpic -g -O2 -fno-omit-frame-pointer -mno-omit-leaf-frame-pointer -ffile-prefix-map=/build/r-base-EawLoD/r-base-4.4.1=. -fstack-protector-strong -fstack-clash-protection -Wformat -Werror=format-security -fcf-protection -fdebug-prefix-map=/build/r-base-EawLoD/r-base-4.4.1=/usr/src/r-base-4.4.1-1.2404.0 -Wdate-time -D_FORTIFY_SOURCE=3 -c unhandled.c -o unhandled.o gcc -I"/usr/share/R/include" -DNDEBUG -fvisibility=hidden -fpic -g -O2 -fno-omit-frame-pointer -mno-omit-leaf-frame-pointer -ffile-prefix-map=/build/r-base-EawLoD/r-base-4.4.1=. -fstack-protector-strong -fstack-clash-protection -Wformat -Werror=format-security -fcf-protection -fdebug-prefix-map=/build/r-base-EawLoD/r-base-4.4.1=/usr/src/r-base-4.4.1-1.2404.0 -Wdate-time -D_FORTIFY_SOURCE=3 -c utf8.c -o utf8.o gcc -I"/usr/share/R/include" -DNDEBUG -fvisibility=hidden -fpic -g -O2 -fno-omit-frame-pointer -mno-omit-leaf-frame-pointer -ffile-prefix-map=/build/r-base-EawLoD/r-base-4.4.1=. -fstack-protector-strong -fstack-clash-protection -Wformat -Werror=format-security -fcf-protection -fdebug-prefix-map=/build/r-base-EawLoD/r-base-4.4.1=/usr/src/r-base-4.4.1-1.2404.0 -Wdate-time -D_FORTIFY_SOURCE=3 -c utils.c -o utils.o gcc -I"/usr/share/R/include" -DNDEBUG -fvisibility=hidden -fpic -g -O2 -fno-omit-frame-pointer -mno-omit-leaf-frame-pointer -ffile-prefix-map=/build/r-base-EawLoD/r-base-4.4.1=. -fstack-protector-strong -fstack-clash-protection -Wformat -Werror=format-security -fcf-protection -fdebug-prefix-map=/build/r-base-EawLoD/r-base-4.4.1=/usr/src/r-base-4.4.1-1.2404.0 -Wdate-time -D_FORTIFY_SOURCE=3 -c wrap.c -o wrap.o gcc -I"/usr/share/R/include" -DNDEBUG -fvisibility=hidden -fpic -g -O2 -fno-omit-frame-pointer -mno-omit-leaf-frame-pointer -ffile-prefix-map=/build/r-base-EawLoD/r-base-4.4.1=. -fstack-protector-strong -fstack-clash-protection -Wformat -Werror=format-security -fcf-protection -fdebug-prefix-map=/build/r-base-EawLoD/r-base-4.4.1=/usr/src/r-base-4.4.1-1.2404.0 -Wdate-time -D_FORTIFY_SOURCE=3 -c write.c -o write.o gcc -shared -L/usr/lib/R/lib -Wl,-Bsymbolic-functions -flto=auto -ffat-lto-objects -Wl,-z,relro -o fansi.so assumptions.o carry.o has.o init.o nchar.o normalize.o read.o rnchar.o state.o strip.o substr.o tabs.o tohtml.o trimws.o unhandled.o utf8.o utils.o wrap.o write.o -L/usr/lib/R/lib -lR installing to /home/omnipath/local/R/4.4-3.20/00LOCK-fansi/00new/fansi/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 (fansi) * installing *source* package ‘DBI’ ... ** package ‘DBI’ 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 (DBI) * installing *source* package ‘filelock’ ... ** package ‘filelock’ successfully unpacked and MD5 sums checked ** using staged installation ** libs using C compiler: ‘gcc (Ubuntu 13.2.0-23ubuntu4) 13.2.0’ rm -f filelock.so init.o filelock-unix.o locklist.o gcc -I"/usr/share/R/include" -DNDEBUG -fpic -g -O2 -fno-omit-frame-pointer -mno-omit-leaf-frame-pointer -ffile-prefix-map=/build/r-base-EawLoD/r-base-4.4.1=. -fstack-protector-strong -fstack-clash-protection -Wformat -Werror=format-security -fcf-protection -fdebug-prefix-map=/build/r-base-EawLoD/r-base-4.4.1=/usr/src/r-base-4.4.1-1.2404.0 -Wdate-time -D_FORTIFY_SOURCE=3 -c init.c -o init.o gcc -I"/usr/share/R/include" -DNDEBUG -fpic -g -O2 -fno-omit-frame-pointer -mno-omit-leaf-frame-pointer -ffile-prefix-map=/build/r-base-EawLoD/r-base-4.4.1=. -fstack-protector-strong -fstack-clash-protection -Wformat -Werror=format-security -fcf-protection -fdebug-prefix-map=/build/r-base-EawLoD/r-base-4.4.1=/usr/src/r-base-4.4.1-1.2404.0 -Wdate-time -D_FORTIFY_SOURCE=3 -c filelock-unix.c -o filelock-unix.o gcc -I"/usr/share/R/include" -DNDEBUG -fpic -g -O2 -fno-omit-frame-pointer -mno-omit-leaf-frame-pointer -ffile-prefix-map=/build/r-base-EawLoD/r-base-4.4.1=. -fstack-protector-strong -fstack-clash-protection -Wformat -Werror=format-security -fcf-protection -fdebug-prefix-map=/build/r-base-EawLoD/r-base-4.4.1=/usr/src/r-base-4.4.1-1.2404.0 -Wdate-time -D_FORTIFY_SOURCE=3 -c locklist.c -o locklist.o gcc -shared -L/usr/lib/R/lib -Wl,-Bsymbolic-functions -flto=auto -ffat-lto-objects -Wl,-z,relro -o filelock.so init.o filelock-unix.o locklist.o -L/usr/lib/R/lib -lR installing to /home/omnipath/local/R/4.4-3.20/00LOCK-filelock/00new/filelock/libs ** R ** inst ** byte-compile and prepare package for lazy loading ** help *** installing help indices ** building package indices ** testing if installed package can be loaded from temporary location ** checking absolute paths in shared objects and dynamic libraries ** testing if installed package can be loaded from final location ** testing if installed package keeps a record of temporary installation path * DONE (filelock) * installing *source* package ‘curl’ ... ** package ‘curl’ successfully unpacked and MD5 sums checked ** using staged installation Found pkg-config cflags and libs! Using PKG_CFLAGS=-I/usr/include/x86_64-linux-gnu Using PKG_LIBS=-lcurl ** libs using C compiler: ‘gcc (Ubuntu 13.2.0-23ubuntu4) 13.2.0’ rm -f curl.so callbacks.o curl.o download.o escape.o fetch.o findport.o form.o getdate.o handle.o ieproxy.o init.o interrupt.o multi.o nslookup.o options.o reflist.o split.o ssl.o typechecking.o utils.o version.o winidn.o writer.o gcc -I"/usr/share/R/include" -DNDEBUG -I/usr/include/x86_64-linux-gnu -DSTRICT_R_HEADERS -DR_NO_REMAP -fvisibility=hidden -fpic -g -O2 -fno-omit-frame-pointer -mno-omit-leaf-frame-pointer -ffile-prefix-map=/build/r-base-EawLoD/r-base-4.4.1=. -fstack-protector-strong -fstack-clash-protection -Wformat -Werror=format-security -fcf-protection -fdebug-prefix-map=/build/r-base-EawLoD/r-base-4.4.1=/usr/src/r-base-4.4.1-1.2404.0 -Wdate-time -D_FORTIFY_SOURCE=3 -c callbacks.c -o callbacks.o gcc -I"/usr/share/R/include" -DNDEBUG -I/usr/include/x86_64-linux-gnu -DSTRICT_R_HEADERS -DR_NO_REMAP -fvisibility=hidden -fpic -g -O2 -fno-omit-frame-pointer -mno-omit-leaf-frame-pointer -ffile-prefix-map=/build/r-base-EawLoD/r-base-4.4.1=. -fstack-protector-strong -fstack-clash-protection -Wformat -Werror=format-security -fcf-protection -fdebug-prefix-map=/build/r-base-EawLoD/r-base-4.4.1=/usr/src/r-base-4.4.1-1.2404.0 -Wdate-time -D_FORTIFY_SOURCE=3 -c curl.c -o curl.o gcc -I"/usr/share/R/include" -DNDEBUG -I/usr/include/x86_64-linux-gnu -DSTRICT_R_HEADERS -DR_NO_REMAP -fvisibility=hidden -fpic -g -O2 -fno-omit-frame-pointer -mno-omit-leaf-frame-pointer -ffile-prefix-map=/build/r-base-EawLoD/r-base-4.4.1=. -fstack-protector-strong -fstack-clash-protection -Wformat -Werror=format-security -fcf-protection -fdebug-prefix-map=/build/r-base-EawLoD/r-base-4.4.1=/usr/src/r-base-4.4.1-1.2404.0 -Wdate-time -D_FORTIFY_SOURCE=3 -c download.c -o download.o gcc -I"/usr/share/R/include" -DNDEBUG -I/usr/include/x86_64-linux-gnu -DSTRICT_R_HEADERS -DR_NO_REMAP -fvisibility=hidden -fpic -g -O2 -fno-omit-frame-pointer -mno-omit-leaf-frame-pointer -ffile-prefix-map=/build/r-base-EawLoD/r-base-4.4.1=. -fstack-protector-strong -fstack-clash-protection -Wformat -Werror=format-security -fcf-protection -fdebug-prefix-map=/build/r-base-EawLoD/r-base-4.4.1=/usr/src/r-base-4.4.1-1.2404.0 -Wdate-time -D_FORTIFY_SOURCE=3 -c escape.c -o escape.o gcc -I"/usr/share/R/include" -DNDEBUG -I/usr/include/x86_64-linux-gnu -DSTRICT_R_HEADERS -DR_NO_REMAP -fvisibility=hidden -fpic -g -O2 -fno-omit-frame-pointer -mno-omit-leaf-frame-pointer -ffile-prefix-map=/build/r-base-EawLoD/r-base-4.4.1=. -fstack-protector-strong -fstack-clash-protection -Wformat -Werror=format-security -fcf-protection -fdebug-prefix-map=/build/r-base-EawLoD/r-base-4.4.1=/usr/src/r-base-4.4.1-1.2404.0 -Wdate-time -D_FORTIFY_SOURCE=3 -c fetch.c -o fetch.o gcc -I"/usr/share/R/include" -DNDEBUG -I/usr/include/x86_64-linux-gnu -DSTRICT_R_HEADERS -DR_NO_REMAP -fvisibility=hidden -fpic -g -O2 -fno-omit-frame-pointer -mno-omit-leaf-frame-pointer -ffile-prefix-map=/build/r-base-EawLoD/r-base-4.4.1=. -fstack-protector-strong -fstack-clash-protection -Wformat -Werror=format-security -fcf-protection -fdebug-prefix-map=/build/r-base-EawLoD/r-base-4.4.1=/usr/src/r-base-4.4.1-1.2404.0 -Wdate-time -D_FORTIFY_SOURCE=3 -c findport.c -o findport.o gcc -I"/usr/share/R/include" -DNDEBUG -I/usr/include/x86_64-linux-gnu -DSTRICT_R_HEADERS -DR_NO_REMAP -fvisibility=hidden -fpic -g -O2 -fno-omit-frame-pointer -mno-omit-leaf-frame-pointer -ffile-prefix-map=/build/r-base-EawLoD/r-base-4.4.1=. -fstack-protector-strong -fstack-clash-protection -Wformat -Werror=format-security -fcf-protection -fdebug-prefix-map=/build/r-base-EawLoD/r-base-4.4.1=/usr/src/r-base-4.4.1-1.2404.0 -Wdate-time -D_FORTIFY_SOURCE=3 -c form.c -o form.o gcc -I"/usr/share/R/include" -DNDEBUG -I/usr/include/x86_64-linux-gnu -DSTRICT_R_HEADERS -DR_NO_REMAP -fvisibility=hidden -fpic -g -O2 -fno-omit-frame-pointer -mno-omit-leaf-frame-pointer -ffile-prefix-map=/build/r-base-EawLoD/r-base-4.4.1=. -fstack-protector-strong -fstack-clash-protection -Wformat -Werror=format-security -fcf-protection -fdebug-prefix-map=/build/r-base-EawLoD/r-base-4.4.1=/usr/src/r-base-4.4.1-1.2404.0 -Wdate-time -D_FORTIFY_SOURCE=3 -c getdate.c -o getdate.o gcc -I"/usr/share/R/include" -DNDEBUG -I/usr/include/x86_64-linux-gnu -DSTRICT_R_HEADERS -DR_NO_REMAP -fvisibility=hidden -fpic -g -O2 -fno-omit-frame-pointer -mno-omit-leaf-frame-pointer -ffile-prefix-map=/build/r-base-EawLoD/r-base-4.4.1=. -fstack-protector-strong -fstack-clash-protection -Wformat -Werror=format-security -fcf-protection -fdebug-prefix-map=/build/r-base-EawLoD/r-base-4.4.1=/usr/src/r-base-4.4.1-1.2404.0 -Wdate-time -D_FORTIFY_SOURCE=3 -c handle.c -o handle.o gcc -I"/usr/share/R/include" -DNDEBUG -I/usr/include/x86_64-linux-gnu -DSTRICT_R_HEADERS -DR_NO_REMAP -fvisibility=hidden -fpic -g -O2 -fno-omit-frame-pointer -mno-omit-leaf-frame-pointer -ffile-prefix-map=/build/r-base-EawLoD/r-base-4.4.1=. -fstack-protector-strong -fstack-clash-protection -Wformat -Werror=format-security -fcf-protection -fdebug-prefix-map=/build/r-base-EawLoD/r-base-4.4.1=/usr/src/r-base-4.4.1-1.2404.0 -Wdate-time -D_FORTIFY_SOURCE=3 -c ieproxy.c -o ieproxy.o gcc -I"/usr/share/R/include" -DNDEBUG -I/usr/include/x86_64-linux-gnu -DSTRICT_R_HEADERS -DR_NO_REMAP -fvisibility=hidden -fpic -g -O2 -fno-omit-frame-pointer -mno-omit-leaf-frame-pointer -ffile-prefix-map=/build/r-base-EawLoD/r-base-4.4.1=. -fstack-protector-strong -fstack-clash-protection -Wformat -Werror=format-security -fcf-protection -fdebug-prefix-map=/build/r-base-EawLoD/r-base-4.4.1=/usr/src/r-base-4.4.1-1.2404.0 -Wdate-time -D_FORTIFY_SOURCE=3 -c init.c -o init.o gcc -I"/usr/share/R/include" -DNDEBUG -I/usr/include/x86_64-linux-gnu -DSTRICT_R_HEADERS -DR_NO_REMAP -fvisibility=hidden -fpic -g -O2 -fno-omit-frame-pointer -mno-omit-leaf-frame-pointer -ffile-prefix-map=/build/r-base-EawLoD/r-base-4.4.1=. -fstack-protector-strong -fstack-clash-protection -Wformat -Werror=format-security -fcf-protection -fdebug-prefix-map=/build/r-base-EawLoD/r-base-4.4.1=/usr/src/r-base-4.4.1-1.2404.0 -Wdate-time -D_FORTIFY_SOURCE=3 -c interrupt.c -o interrupt.o gcc -I"/usr/share/R/include" -DNDEBUG -I/usr/include/x86_64-linux-gnu -DSTRICT_R_HEADERS -DR_NO_REMAP -fvisibility=hidden -fpic -g -O2 -fno-omit-frame-pointer -mno-omit-leaf-frame-pointer -ffile-prefix-map=/build/r-base-EawLoD/r-base-4.4.1=. -fstack-protector-strong -fstack-clash-protection -Wformat -Werror=format-security -fcf-protection -fdebug-prefix-map=/build/r-base-EawLoD/r-base-4.4.1=/usr/src/r-base-4.4.1-1.2404.0 -Wdate-time -D_FORTIFY_SOURCE=3 -c multi.c -o multi.o gcc -I"/usr/share/R/include" -DNDEBUG -I/usr/include/x86_64-linux-gnu -DSTRICT_R_HEADERS -DR_NO_REMAP -fvisibility=hidden -fpic -g -O2 -fno-omit-frame-pointer -mno-omit-leaf-frame-pointer -ffile-prefix-map=/build/r-base-EawLoD/r-base-4.4.1=. -fstack-protector-strong -fstack-clash-protection -Wformat -Werror=format-security -fcf-protection -fdebug-prefix-map=/build/r-base-EawLoD/r-base-4.4.1=/usr/src/r-base-4.4.1-1.2404.0 -Wdate-time -D_FORTIFY_SOURCE=3 -c nslookup.c -o nslookup.o gcc -I"/usr/share/R/include" -DNDEBUG -I/usr/include/x86_64-linux-gnu -DSTRICT_R_HEADERS -DR_NO_REMAP -fvisibility=hidden -fpic -g -O2 -fno-omit-frame-pointer -mno-omit-leaf-frame-pointer -ffile-prefix-map=/build/r-base-EawLoD/r-base-4.4.1=. -fstack-protector-strong -fstack-clash-protection -Wformat -Werror=format-security -fcf-protection -fdebug-prefix-map=/build/r-base-EawLoD/r-base-4.4.1=/usr/src/r-base-4.4.1-1.2404.0 -Wdate-time -D_FORTIFY_SOURCE=3 -c options.c -o options.o gcc -I"/usr/share/R/include" -DNDEBUG -I/usr/include/x86_64-linux-gnu -DSTRICT_R_HEADERS -DR_NO_REMAP -fvisibility=hidden -fpic -g -O2 -fno-omit-frame-pointer -mno-omit-leaf-frame-pointer -ffile-prefix-map=/build/r-base-EawLoD/r-base-4.4.1=. -fstack-protector-strong -fstack-clash-protection -Wformat -Werror=format-security -fcf-protection -fdebug-prefix-map=/build/r-base-EawLoD/r-base-4.4.1=/usr/src/r-base-4.4.1-1.2404.0 -Wdate-time -D_FORTIFY_SOURCE=3 -c reflist.c -o reflist.o gcc -I"/usr/share/R/include" -DNDEBUG -I/usr/include/x86_64-linux-gnu -DSTRICT_R_HEADERS -DR_NO_REMAP -fvisibility=hidden -fpic -g -O2 -fno-omit-frame-pointer -mno-omit-leaf-frame-pointer -ffile-prefix-map=/build/r-base-EawLoD/r-base-4.4.1=. -fstack-protector-strong -fstack-clash-protection -Wformat -Werror=format-security -fcf-protection -fdebug-prefix-map=/build/r-base-EawLoD/r-base-4.4.1=/usr/src/r-base-4.4.1-1.2404.0 -Wdate-time -D_FORTIFY_SOURCE=3 -c split.c -o split.o gcc -I"/usr/share/R/include" -DNDEBUG -I/usr/include/x86_64-linux-gnu -DSTRICT_R_HEADERS -DR_NO_REMAP -fvisibility=hidden -fpic -g -O2 -fno-omit-frame-pointer -mno-omit-leaf-frame-pointer -ffile-prefix-map=/build/r-base-EawLoD/r-base-4.4.1=. -fstack-protector-strong -fstack-clash-protection -Wformat -Werror=format-security -fcf-protection -fdebug-prefix-map=/build/r-base-EawLoD/r-base-4.4.1=/usr/src/r-base-4.4.1-1.2404.0 -Wdate-time -D_FORTIFY_SOURCE=3 -c ssl.c -o ssl.o gcc -I"/usr/share/R/include" -DNDEBUG -I/usr/include/x86_64-linux-gnu -DSTRICT_R_HEADERS -DR_NO_REMAP -fvisibility=hidden -fpic -g -O2 -fno-omit-frame-pointer -mno-omit-leaf-frame-pointer -ffile-prefix-map=/build/r-base-EawLoD/r-base-4.4.1=. -fstack-protector-strong -fstack-clash-protection -Wformat -Werror=format-security -fcf-protection -fdebug-prefix-map=/build/r-base-EawLoD/r-base-4.4.1=/usr/src/r-base-4.4.1-1.2404.0 -Wdate-time -D_FORTIFY_SOURCE=3 -c typechecking.c -o typechecking.o gcc -I"/usr/share/R/include" -DNDEBUG -I/usr/include/x86_64-linux-gnu -DSTRICT_R_HEADERS -DR_NO_REMAP -fvisibility=hidden -fpic -g -O2 -fno-omit-frame-pointer -mno-omit-leaf-frame-pointer -ffile-prefix-map=/build/r-base-EawLoD/r-base-4.4.1=. -fstack-protector-strong -fstack-clash-protection -Wformat -Werror=format-security -fcf-protection -fdebug-prefix-map=/build/r-base-EawLoD/r-base-4.4.1=/usr/src/r-base-4.4.1-1.2404.0 -Wdate-time -D_FORTIFY_SOURCE=3 -c utils.c -o utils.o gcc -I"/usr/share/R/include" -DNDEBUG -I/usr/include/x86_64-linux-gnu -DSTRICT_R_HEADERS -DR_NO_REMAP -fvisibility=hidden -fpic -g -O2 -fno-omit-frame-pointer -mno-omit-leaf-frame-pointer -ffile-prefix-map=/build/r-base-EawLoD/r-base-4.4.1=. -fstack-protector-strong -fstack-clash-protection -Wformat -Werror=format-security -fcf-protection -fdebug-prefix-map=/build/r-base-EawLoD/r-base-4.4.1=/usr/src/r-base-4.4.1-1.2404.0 -Wdate-time -D_FORTIFY_SOURCE=3 -c version.c -o version.o gcc -I"/usr/share/R/include" -DNDEBUG -I/usr/include/x86_64-linux-gnu -DSTRICT_R_HEADERS -DR_NO_REMAP -fvisibility=hidden -fpic -g -O2 -fno-omit-frame-pointer -mno-omit-leaf-frame-pointer -ffile-prefix-map=/build/r-base-EawLoD/r-base-4.4.1=. -fstack-protector-strong -fstack-clash-protection -Wformat -Werror=format-security -fcf-protection -fdebug-prefix-map=/build/r-base-EawLoD/r-base-4.4.1=/usr/src/r-base-4.4.1-1.2404.0 -Wdate-time -D_FORTIFY_SOURCE=3 -c winidn.c -o winidn.o gcc -I"/usr/share/R/include" -DNDEBUG -I/usr/include/x86_64-linux-gnu -DSTRICT_R_HEADERS -DR_NO_REMAP -fvisibility=hidden -fpic -g -O2 -fno-omit-frame-pointer -mno-omit-leaf-frame-pointer -ffile-prefix-map=/build/r-base-EawLoD/r-base-4.4.1=. -fstack-protector-strong -fstack-clash-protection -Wformat -Werror=format-security -fcf-protection -fdebug-prefix-map=/build/r-base-EawLoD/r-base-4.4.1=/usr/src/r-base-4.4.1-1.2404.0 -Wdate-time -D_FORTIFY_SOURCE=3 -c writer.c -o writer.o gcc -shared -L/usr/lib/R/lib -Wl,-Bsymbolic-functions -flto=auto -ffat-lto-objects -Wl,-z,relro -o curl.so callbacks.o curl.o download.o escape.o fetch.o findport.o form.o getdate.o handle.o ieproxy.o init.o interrupt.o multi.o nslookup.o options.o reflist.o split.o ssl.o typechecking.o utils.o version.o winidn.o writer.o -lcurl -L/usr/lib/R/lib -lR installing to /home/omnipath/local/R/4.4-3.20/00LOCK-curl/00new/curl/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 (curl) * installing *source* package ‘XML’ ... ** package ‘XML’ successfully unpacked and MD5 sums checked ** using staged installation checking for gcc... gcc checking whether the C compiler works... yes checking for C compiler default output file name... a.out checking for suffix of executables... checking whether we are cross compiling... no checking for suffix of object files... o checking whether the compiler supports GNU C... yes checking whether gcc accepts -g... yes checking for gcc option to enable C11 features... none needed checking how to run the C preprocessor... gcc -E checking for sed... /bin/sed checking for pkg-config... /usr/bin/pkg-config checking for xml2-config... /usr/bin/xml2-config USE_XML2 = yes SED_EXTENDED_ARG: -E Minor 9, Patch 14 for 2.9.14 Located parser file -I/usr/include/libxml2/parser.h Checking for 1.8: -I/usr/include/libxml2 Using libxml2.* checking for gzopen in -lz... yes checking for xmlParseFile in -lxml2... yes checking for xmlHashSize in -lxml2... yes Using built-in xmlHashSize Checking DTD parsing (presence of externalSubset)... checking for xmlHashSize in -lxml2... (cached) yes Found xmlHashSize checking for xmlOutputBufferCreateBuffer in -lxml2... yes have xmlOutputBufferCreateBuffer() checking for xmlDocDumpFormatMemoryEnc in -lxml2... yes checking for libxml/xmlversion.h... yes Expat: FALSE Checking for return type of xmlHashScan element routine. No return value for xmlHashScan xmlNs has a context field Checking for cetype_t enumeration No cetype_t enumeration defined in R headers. checking for xmlsec1-config... no nodegc default xml-debug default Version has XML_WITH_ZLIB Version has xmlHasFeature() **************************************** Configuration information: Libxml settings libxml include directory: -I/usr/include/libxml2 libxml library directory: -lxml2 -lz -lxml2 libxml 2: -DLIBXML2=1 Compilation flags: -DLIBXML -I/usr/include/libxml2 -DUSE_EXTERNAL_SUBSET=1 -DROOT_HAS_DTD_NODE=1 -DDUMP_WITH_ENCODING=1 -DUSE_XML_VERSION_H=1 -DXML_ELEMENT_ETYPE=1 -DXML_ATTRIBUTE_ATYPE=1 -DNO_XML_HASH_SCANNER_RETURN=1 -DLIBXML_NAMESPACE_HAS_CONTEXT=1 -DHAVE_XML_WITH_ZLIB=1 -DHAVE_XML_HAS_FEATURE=1 -DUSE_R=1 -D_R_=1 -DHAVE_VALIDITY=1 -DXML_REF_COUNT_NODES=1 Link flags: -lxml2 -lz -lxml2 **************************************** configure: creating ./config.status config.status: creating src/Makevars config.status: creating R/supports.R config.status: creating inst/scripts/RSXML.csh config.status: creating inst/scripts/RSXML.bsh ** libs using C compiler: ‘gcc (Ubuntu 13.2.0-23ubuntu4) 13.2.0’ gcc -I"/usr/share/R/include" -DNDEBUG -DLIBXML -I/usr/include/libxml2 -DUSE_EXTERNAL_SUBSET=1 -DROOT_HAS_DTD_NODE=1 -DDUMP_WITH_ENCODING=1 -DUSE_XML_VERSION_H=1 -DXML_ELEMENT_ETYPE=1 -DXML_ATTRIBUTE_ATYPE=1 -DNO_XML_HASH_SCANNER_RETURN=1 -DLIBXML_NAMESPACE_HAS_CONTEXT=1 -DHAVE_XML_WITH_ZLIB=1 -DHAVE_XML_HAS_FEATURE=1 -DUSE_R=1 -D_R_=1 -DHAVE_VALIDITY=1 -DXML_REF_COUNT_NODES=1 -I. -DLIBXML2=1 -fpic -g -O2 -fno-omit-frame-pointer -mno-omit-leaf-frame-pointer -ffile-prefix-map=/build/r-base-EawLoD/r-base-4.4.1=. -fstack-protector-strong -fstack-clash-protection -Wformat -Werror=format-security -fcf-protection -fdebug-prefix-map=/build/r-base-EawLoD/r-base-4.4.1=/usr/src/r-base-4.4.1-1.2404.0 -Wdate-time -D_FORTIFY_SOURCE=3 -c DocParse.c -o DocParse.o gcc -I"/usr/share/R/include" -DNDEBUG -DLIBXML -I/usr/include/libxml2 -DUSE_EXTERNAL_SUBSET=1 -DROOT_HAS_DTD_NODE=1 -DDUMP_WITH_ENCODING=1 -DUSE_XML_VERSION_H=1 -DXML_ELEMENT_ETYPE=1 -DXML_ATTRIBUTE_ATYPE=1 -DNO_XML_HASH_SCANNER_RETURN=1 -DLIBXML_NAMESPACE_HAS_CONTEXT=1 -DHAVE_XML_WITH_ZLIB=1 -DHAVE_XML_HAS_FEATURE=1 -DUSE_R=1 -D_R_=1 -DHAVE_VALIDITY=1 -DXML_REF_COUNT_NODES=1 -I. -DLIBXML2=1 -fpic -g -O2 -fno-omit-frame-pointer -mno-omit-leaf-frame-pointer -ffile-prefix-map=/build/r-base-EawLoD/r-base-4.4.1=. -fstack-protector-strong -fstack-clash-protection -Wformat -Werror=format-security -fcf-protection -fdebug-prefix-map=/build/r-base-EawLoD/r-base-4.4.1=/usr/src/r-base-4.4.1-1.2404.0 -Wdate-time -D_FORTIFY_SOURCE=3 -c EventParse.c -o EventParse.o gcc -I"/usr/share/R/include" -DNDEBUG -DLIBXML -I/usr/include/libxml2 -DUSE_EXTERNAL_SUBSET=1 -DROOT_HAS_DTD_NODE=1 -DDUMP_WITH_ENCODING=1 -DUSE_XML_VERSION_H=1 -DXML_ELEMENT_ETYPE=1 -DXML_ATTRIBUTE_ATYPE=1 -DNO_XML_HASH_SCANNER_RETURN=1 -DLIBXML_NAMESPACE_HAS_CONTEXT=1 -DHAVE_XML_WITH_ZLIB=1 -DHAVE_XML_HAS_FEATURE=1 -DUSE_R=1 -D_R_=1 -DHAVE_VALIDITY=1 -DXML_REF_COUNT_NODES=1 -I. -DLIBXML2=1 -fpic -g -O2 -fno-omit-frame-pointer -mno-omit-leaf-frame-pointer -ffile-prefix-map=/build/r-base-EawLoD/r-base-4.4.1=. -fstack-protector-strong -fstack-clash-protection -Wformat -Werror=format-security -fcf-protection -fdebug-prefix-map=/build/r-base-EawLoD/r-base-4.4.1=/usr/src/r-base-4.4.1-1.2404.0 -Wdate-time -D_FORTIFY_SOURCE=3 -c ExpatParse.c -o ExpatParse.o gcc -I"/usr/share/R/include" -DNDEBUG -DLIBXML -I/usr/include/libxml2 -DUSE_EXTERNAL_SUBSET=1 -DROOT_HAS_DTD_NODE=1 -DDUMP_WITH_ENCODING=1 -DUSE_XML_VERSION_H=1 -DXML_ELEMENT_ETYPE=1 -DXML_ATTRIBUTE_ATYPE=1 -DNO_XML_HASH_SCANNER_RETURN=1 -DLIBXML_NAMESPACE_HAS_CONTEXT=1 -DHAVE_XML_WITH_ZLIB=1 -DHAVE_XML_HAS_FEATURE=1 -DUSE_R=1 -D_R_=1 -DHAVE_VALIDITY=1 -DXML_REF_COUNT_NODES=1 -I. -DLIBXML2=1 -fpic -g -O2 -fno-omit-frame-pointer -mno-omit-leaf-frame-pointer -ffile-prefix-map=/build/r-base-EawLoD/r-base-4.4.1=. -fstack-protector-strong -fstack-clash-protection -Wformat -Werror=format-security -fcf-protection -fdebug-prefix-map=/build/r-base-EawLoD/r-base-4.4.1=/usr/src/r-base-4.4.1-1.2404.0 -Wdate-time -D_FORTIFY_SOURCE=3 -c HTMLParse.c -o HTMLParse.o gcc -I"/usr/share/R/include" -DNDEBUG -DLIBXML -I/usr/include/libxml2 -DUSE_EXTERNAL_SUBSET=1 -DROOT_HAS_DTD_NODE=1 -DDUMP_WITH_ENCODING=1 -DUSE_XML_VERSION_H=1 -DXML_ELEMENT_ETYPE=1 -DXML_ATTRIBUTE_ATYPE=1 -DNO_XML_HASH_SCANNER_RETURN=1 -DLIBXML_NAMESPACE_HAS_CONTEXT=1 -DHAVE_XML_WITH_ZLIB=1 -DHAVE_XML_HAS_FEATURE=1 -DUSE_R=1 -D_R_=1 -DHAVE_VALIDITY=1 -DXML_REF_COUNT_NODES=1 -I. -DLIBXML2=1 -fpic -g -O2 -fno-omit-frame-pointer -mno-omit-leaf-frame-pointer -ffile-prefix-map=/build/r-base-EawLoD/r-base-4.4.1=. -fstack-protector-strong -fstack-clash-protection -Wformat -Werror=format-security -fcf-protection -fdebug-prefix-map=/build/r-base-EawLoD/r-base-4.4.1=/usr/src/r-base-4.4.1-1.2404.0 -Wdate-time -D_FORTIFY_SOURCE=3 -c NodeGC.c -o NodeGC.o gcc -I"/usr/share/R/include" -DNDEBUG -DLIBXML -I/usr/include/libxml2 -DUSE_EXTERNAL_SUBSET=1 -DROOT_HAS_DTD_NODE=1 -DDUMP_WITH_ENCODING=1 -DUSE_XML_VERSION_H=1 -DXML_ELEMENT_ETYPE=1 -DXML_ATTRIBUTE_ATYPE=1 -DNO_XML_HASH_SCANNER_RETURN=1 -DLIBXML_NAMESPACE_HAS_CONTEXT=1 -DHAVE_XML_WITH_ZLIB=1 -DHAVE_XML_HAS_FEATURE=1 -DUSE_R=1 -D_R_=1 -DHAVE_VALIDITY=1 -DXML_REF_COUNT_NODES=1 -I. -DLIBXML2=1 -fpic -g -O2 -fno-omit-frame-pointer -mno-omit-leaf-frame-pointer -ffile-prefix-map=/build/r-base-EawLoD/r-base-4.4.1=. -fstack-protector-strong -fstack-clash-protection -Wformat -Werror=format-security -fcf-protection -fdebug-prefix-map=/build/r-base-EawLoD/r-base-4.4.1=/usr/src/r-base-4.4.1-1.2404.0 -Wdate-time -D_FORTIFY_SOURCE=3 -c RSDTD.c -o RSDTD.o gcc -I"/usr/share/R/include" -DNDEBUG -DLIBXML -I/usr/include/libxml2 -DUSE_EXTERNAL_SUBSET=1 -DROOT_HAS_DTD_NODE=1 -DDUMP_WITH_ENCODING=1 -DUSE_XML_VERSION_H=1 -DXML_ELEMENT_ETYPE=1 -DXML_ATTRIBUTE_ATYPE=1 -DNO_XML_HASH_SCANNER_RETURN=1 -DLIBXML_NAMESPACE_HAS_CONTEXT=1 -DHAVE_XML_WITH_ZLIB=1 -DHAVE_XML_HAS_FEATURE=1 -DUSE_R=1 -D_R_=1 -DHAVE_VALIDITY=1 -DXML_REF_COUNT_NODES=1 -I. -DLIBXML2=1 -fpic -g -O2 -fno-omit-frame-pointer -mno-omit-leaf-frame-pointer -ffile-prefix-map=/build/r-base-EawLoD/r-base-4.4.1=. -fstack-protector-strong -fstack-clash-protection -Wformat -Werror=format-security -fcf-protection -fdebug-prefix-map=/build/r-base-EawLoD/r-base-4.4.1=/usr/src/r-base-4.4.1-1.2404.0 -Wdate-time -D_FORTIFY_SOURCE=3 -c RUtils.c -o RUtils.o gcc -I"/usr/share/R/include" -DNDEBUG -DLIBXML -I/usr/include/libxml2 -DUSE_EXTERNAL_SUBSET=1 -DROOT_HAS_DTD_NODE=1 -DDUMP_WITH_ENCODING=1 -DUSE_XML_VERSION_H=1 -DXML_ELEMENT_ETYPE=1 -DXML_ATTRIBUTE_ATYPE=1 -DNO_XML_HASH_SCANNER_RETURN=1 -DLIBXML_NAMESPACE_HAS_CONTEXT=1 -DHAVE_XML_WITH_ZLIB=1 -DHAVE_XML_HAS_FEATURE=1 -DUSE_R=1 -D_R_=1 -DHAVE_VALIDITY=1 -DXML_REF_COUNT_NODES=1 -I. -DLIBXML2=1 -fpic -g -O2 -fno-omit-frame-pointer -mno-omit-leaf-frame-pointer -ffile-prefix-map=/build/r-base-EawLoD/r-base-4.4.1=. -fstack-protector-strong -fstack-clash-protection -Wformat -Werror=format-security -fcf-protection -fdebug-prefix-map=/build/r-base-EawLoD/r-base-4.4.1=/usr/src/r-base-4.4.1-1.2404.0 -Wdate-time -D_FORTIFY_SOURCE=3 -c Rcatalog.c -o Rcatalog.o gcc -I"/usr/share/R/include" -DNDEBUG -DLIBXML -I/usr/include/libxml2 -DUSE_EXTERNAL_SUBSET=1 -DROOT_HAS_DTD_NODE=1 -DDUMP_WITH_ENCODING=1 -DUSE_XML_VERSION_H=1 -DXML_ELEMENT_ETYPE=1 -DXML_ATTRIBUTE_ATYPE=1 -DNO_XML_HASH_SCANNER_RETURN=1 -DLIBXML_NAMESPACE_HAS_CONTEXT=1 -DHAVE_XML_WITH_ZLIB=1 -DHAVE_XML_HAS_FEATURE=1 -DUSE_R=1 -D_R_=1 -DHAVE_VALIDITY=1 -DXML_REF_COUNT_NODES=1 -I. -DLIBXML2=1 -fpic -g -O2 -fno-omit-frame-pointer -mno-omit-leaf-frame-pointer -ffile-prefix-map=/build/r-base-EawLoD/r-base-4.4.1=. -fstack-protector-strong -fstack-clash-protection -Wformat -Werror=format-security -fcf-protection -fdebug-prefix-map=/build/r-base-EawLoD/r-base-4.4.1=/usr/src/r-base-4.4.1-1.2404.0 -Wdate-time -D_FORTIFY_SOURCE=3 -c Utils.c -o Utils.o gcc -I"/usr/share/R/include" -DNDEBUG -DLIBXML -I/usr/include/libxml2 -DUSE_EXTERNAL_SUBSET=1 -DROOT_HAS_DTD_NODE=1 -DDUMP_WITH_ENCODING=1 -DUSE_XML_VERSION_H=1 -DXML_ELEMENT_ETYPE=1 -DXML_ATTRIBUTE_ATYPE=1 -DNO_XML_HASH_SCANNER_RETURN=1 -DLIBXML_NAMESPACE_HAS_CONTEXT=1 -DHAVE_XML_WITH_ZLIB=1 -DHAVE_XML_HAS_FEATURE=1 -DUSE_R=1 -D_R_=1 -DHAVE_VALIDITY=1 -DXML_REF_COUNT_NODES=1 -I. -DLIBXML2=1 -fpic -g -O2 -fno-omit-frame-pointer -mno-omit-leaf-frame-pointer -ffile-prefix-map=/build/r-base-EawLoD/r-base-4.4.1=. -fstack-protector-strong -fstack-clash-protection -Wformat -Werror=format-security -fcf-protection -fdebug-prefix-map=/build/r-base-EawLoD/r-base-4.4.1=/usr/src/r-base-4.4.1-1.2404.0 -Wdate-time -D_FORTIFY_SOURCE=3 -c XMLEventParse.c -o XMLEventParse.o gcc -I"/usr/share/R/include" -DNDEBUG -DLIBXML -I/usr/include/libxml2 -DUSE_EXTERNAL_SUBSET=1 -DROOT_HAS_DTD_NODE=1 -DDUMP_WITH_ENCODING=1 -DUSE_XML_VERSION_H=1 -DXML_ELEMENT_ETYPE=1 -DXML_ATTRIBUTE_ATYPE=1 -DNO_XML_HASH_SCANNER_RETURN=1 -DLIBXML_NAMESPACE_HAS_CONTEXT=1 -DHAVE_XML_WITH_ZLIB=1 -DHAVE_XML_HAS_FEATURE=1 -DUSE_R=1 -D_R_=1 -DHAVE_VALIDITY=1 -DXML_REF_COUNT_NODES=1 -I. -DLIBXML2=1 -fpic -g -O2 -fno-omit-frame-pointer -mno-omit-leaf-frame-pointer -ffile-prefix-map=/build/r-base-EawLoD/r-base-4.4.1=. -fstack-protector-strong -fstack-clash-protection -Wformat -Werror=format-security -fcf-protection -fdebug-prefix-map=/build/r-base-EawLoD/r-base-4.4.1=/usr/src/r-base-4.4.1-1.2404.0 -Wdate-time -D_FORTIFY_SOURCE=3 -c XMLHashTree.c -o XMLHashTree.o gcc -I"/usr/share/R/include" -DNDEBUG -DLIBXML -I/usr/include/libxml2 -DUSE_EXTERNAL_SUBSET=1 -DROOT_HAS_DTD_NODE=1 -DDUMP_WITH_ENCODING=1 -DUSE_XML_VERSION_H=1 -DXML_ELEMENT_ETYPE=1 -DXML_ATTRIBUTE_ATYPE=1 -DNO_XML_HASH_SCANNER_RETURN=1 -DLIBXML_NAMESPACE_HAS_CONTEXT=1 -DHAVE_XML_WITH_ZLIB=1 -DHAVE_XML_HAS_FEATURE=1 -DUSE_R=1 -D_R_=1 -DHAVE_VALIDITY=1 -DXML_REF_COUNT_NODES=1 -I. -DLIBXML2=1 -fpic -g -O2 -fno-omit-frame-pointer -mno-omit-leaf-frame-pointer -ffile-prefix-map=/build/r-base-EawLoD/r-base-4.4.1=. -fstack-protector-strong -fstack-clash-protection -Wformat -Werror=format-security -fcf-protection -fdebug-prefix-map=/build/r-base-EawLoD/r-base-4.4.1=/usr/src/r-base-4.4.1-1.2404.0 -Wdate-time -D_FORTIFY_SOURCE=3 -c XMLTree.c -o XMLTree.o gcc -I"/usr/share/R/include" -DNDEBUG -DLIBXML -I/usr/include/libxml2 -DUSE_EXTERNAL_SUBSET=1 -DROOT_HAS_DTD_NODE=1 -DDUMP_WITH_ENCODING=1 -DUSE_XML_VERSION_H=1 -DXML_ELEMENT_ETYPE=1 -DXML_ATTRIBUTE_ATYPE=1 -DNO_XML_HASH_SCANNER_RETURN=1 -DLIBXML_NAMESPACE_HAS_CONTEXT=1 -DHAVE_XML_WITH_ZLIB=1 -DHAVE_XML_HAS_FEATURE=1 -DUSE_R=1 -D_R_=1 -DHAVE_VALIDITY=1 -DXML_REF_COUNT_NODES=1 -I. -DLIBXML2=1 -fpic -g -O2 -fno-omit-frame-pointer -mno-omit-leaf-frame-pointer -ffile-prefix-map=/build/r-base-EawLoD/r-base-4.4.1=. -fstack-protector-strong -fstack-clash-protection -Wformat -Werror=format-security -fcf-protection -fdebug-prefix-map=/build/r-base-EawLoD/r-base-4.4.1=/usr/src/r-base-4.4.1-1.2404.0 -Wdate-time -D_FORTIFY_SOURCE=3 -c fixNS.c -o fixNS.o gcc -I"/usr/share/R/include" -DNDEBUG -DLIBXML -I/usr/include/libxml2 -DUSE_EXTERNAL_SUBSET=1 -DROOT_HAS_DTD_NODE=1 -DDUMP_WITH_ENCODING=1 -DUSE_XML_VERSION_H=1 -DXML_ELEMENT_ETYPE=1 -DXML_ATTRIBUTE_ATYPE=1 -DNO_XML_HASH_SCANNER_RETURN=1 -DLIBXML_NAMESPACE_HAS_CONTEXT=1 -DHAVE_XML_WITH_ZLIB=1 -DHAVE_XML_HAS_FEATURE=1 -DUSE_R=1 -D_R_=1 -DHAVE_VALIDITY=1 -DXML_REF_COUNT_NODES=1 -I. -DLIBXML2=1 -fpic -g -O2 -fno-omit-frame-pointer -mno-omit-leaf-frame-pointer -ffile-prefix-map=/build/r-base-EawLoD/r-base-4.4.1=. -fstack-protector-strong -fstack-clash-protection -Wformat -Werror=format-security -fcf-protection -fdebug-prefix-map=/build/r-base-EawLoD/r-base-4.4.1=/usr/src/r-base-4.4.1-1.2404.0 -Wdate-time -D_FORTIFY_SOURCE=3 -c libxmlFeatures.c -o libxmlFeatures.o gcc -I"/usr/share/R/include" -DNDEBUG -DLIBXML -I/usr/include/libxml2 -DUSE_EXTERNAL_SUBSET=1 -DROOT_HAS_DTD_NODE=1 -DDUMP_WITH_ENCODING=1 -DUSE_XML_VERSION_H=1 -DXML_ELEMENT_ETYPE=1 -DXML_ATTRIBUTE_ATYPE=1 -DNO_XML_HASH_SCANNER_RETURN=1 -DLIBXML_NAMESPACE_HAS_CONTEXT=1 -DHAVE_XML_WITH_ZLIB=1 -DHAVE_XML_HAS_FEATURE=1 -DUSE_R=1 -D_R_=1 -DHAVE_VALIDITY=1 -DXML_REF_COUNT_NODES=1 -I. -DLIBXML2=1 -fpic -g -O2 -fno-omit-frame-pointer -mno-omit-leaf-frame-pointer -ffile-prefix-map=/build/r-base-EawLoD/r-base-4.4.1=. -fstack-protector-strong -fstack-clash-protection -Wformat -Werror=format-security -fcf-protection -fdebug-prefix-map=/build/r-base-EawLoD/r-base-4.4.1=/usr/src/r-base-4.4.1-1.2404.0 -Wdate-time -D_FORTIFY_SOURCE=3 -c schema.c -o schema.o gcc -I"/usr/share/R/include" -DNDEBUG -DLIBXML -I/usr/include/libxml2 -DUSE_EXTERNAL_SUBSET=1 -DROOT_HAS_DTD_NODE=1 -DDUMP_WITH_ENCODING=1 -DUSE_XML_VERSION_H=1 -DXML_ELEMENT_ETYPE=1 -DXML_ATTRIBUTE_ATYPE=1 -DNO_XML_HASH_SCANNER_RETURN=1 -DLIBXML_NAMESPACE_HAS_CONTEXT=1 -DHAVE_XML_WITH_ZLIB=1 -DHAVE_XML_HAS_FEATURE=1 -DUSE_R=1 -D_R_=1 -DHAVE_VALIDITY=1 -DXML_REF_COUNT_NODES=1 -I. -DLIBXML2=1 -fpic -g -O2 -fno-omit-frame-pointer -mno-omit-leaf-frame-pointer -ffile-prefix-map=/build/r-base-EawLoD/r-base-4.4.1=. -fstack-protector-strong -fstack-clash-protection -Wformat -Werror=format-security -fcf-protection -fdebug-prefix-map=/build/r-base-EawLoD/r-base-4.4.1=/usr/src/r-base-4.4.1-1.2404.0 -Wdate-time -D_FORTIFY_SOURCE=3 -c xmlsecurity.c -o xmlsecurity.o gcc -I"/usr/share/R/include" -DNDEBUG -DLIBXML -I/usr/include/libxml2 -DUSE_EXTERNAL_SUBSET=1 -DROOT_HAS_DTD_NODE=1 -DDUMP_WITH_ENCODING=1 -DUSE_XML_VERSION_H=1 -DXML_ELEMENT_ETYPE=1 -DXML_ATTRIBUTE_ATYPE=1 -DNO_XML_HASH_SCANNER_RETURN=1 -DLIBXML_NAMESPACE_HAS_CONTEXT=1 -DHAVE_XML_WITH_ZLIB=1 -DHAVE_XML_HAS_FEATURE=1 -DUSE_R=1 -D_R_=1 -DHAVE_VALIDITY=1 -DXML_REF_COUNT_NODES=1 -I. -DLIBXML2=1 -fpic -g -O2 -fno-omit-frame-pointer -mno-omit-leaf-frame-pointer -ffile-prefix-map=/build/r-base-EawLoD/r-base-4.4.1=. -fstack-protector-strong -fstack-clash-protection -Wformat -Werror=format-security -fcf-protection -fdebug-prefix-map=/build/r-base-EawLoD/r-base-4.4.1=/usr/src/r-base-4.4.1-1.2404.0 -Wdate-time -D_FORTIFY_SOURCE=3 -c xpath.c -o xpath.o gcc -shared -L/usr/lib/R/lib -Wl,-Bsymbolic-functions -flto=auto -ffat-lto-objects -Wl,-z,relro -o XML.so DocParse.o EventParse.o ExpatParse.o HTMLParse.o NodeGC.o RSDTD.o RUtils.o Rcatalog.o Utils.o XMLEventParse.o XMLHashTree.o XMLTree.o fixNS.o libxmlFeatures.o schema.o xmlsecurity.o xpath.o -lxml2 -lz -lxml2 -L/usr/lib/R/lib -lR installing to /home/omnipath/local/R/4.4-3.20/00LOCK-XML/00new/XML/libs ** R ** inst ** byte-compile and prepare package for lazy loading Creating a generic function for ‘source’ from package ‘base’ in package ‘XML’ in method for ‘xmlAttrsToDataFrame’ with signature ‘"AsIs"’: no definition for class “AsIs” in method for ‘readKeyValueDB’ with signature ‘"AsIs"’: no definition for class “AsIs” in method for ‘readSolrDoc’ with signature ‘"AsIs"’: no definition for class “AsIs” ** 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 (XML) * installing *source* package ‘RUnit’ ... ** package ‘RUnit’ successfully unpacked and MD5 sums checked ** using staged installation ** R ** inst ** byte-compile and prepare package for lazy loading ** help *** installing help indices ** building package indices ** installing vignettes ** testing if installed package can be loaded from temporary location ** testing if installed package can be loaded from final location ** testing if installed package keeps a record of temporary installation path * DONE (RUnit) * installing *source* package ‘R6’ ... ** package ‘R6’ 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 (R6) * installing *source* package ‘BiocGenerics’ ... ** using staged installation ** R ** inst ** byte-compile and prepare package for lazy loading Creating a new generic function for ‘aperm’ in package ‘BiocGenerics’ Creating a new generic function for ‘append’ in package ‘BiocGenerics’ Creating a new generic function for ‘as.data.frame’ in package ‘BiocGenerics’ Creating a new generic function for ‘cbind’ in package ‘BiocGenerics’ Creating a new generic function for ‘rbind’ in package ‘BiocGenerics’ Creating a new generic function for ‘do.call’ in package ‘BiocGenerics’ Creating a new generic function for ‘duplicated’ in package ‘BiocGenerics’ Creating a new generic function for ‘anyDuplicated’ in package ‘BiocGenerics’ Creating a new generic function for ‘eval’ in package ‘BiocGenerics’ Creating a new generic function for ‘pmax’ in package ‘BiocGenerics’ Creating a new generic function for ‘pmin’ in package ‘BiocGenerics’ Creating a new generic function for ‘pmax.int’ in package ‘BiocGenerics’ Creating a new generic function for ‘pmin.int’ in package ‘BiocGenerics’ Creating a new generic function for ‘Reduce’ in package ‘BiocGenerics’ Creating a new generic function for ‘Filter’ in package ‘BiocGenerics’ Creating a new generic function for ‘Find’ in package ‘BiocGenerics’ Creating a new generic function for ‘Map’ in package ‘BiocGenerics’ Creating a new generic function for ‘Position’ in package ‘BiocGenerics’ Creating a new generic function for ‘get’ in package ‘BiocGenerics’ Creating a new generic function for ‘mget’ in package ‘BiocGenerics’ Creating a new generic function for ‘grep’ in package ‘BiocGenerics’ Creating a new generic function for ‘grepl’ in package ‘BiocGenerics’ Creating a new generic function for ‘is.unsorted’ in package ‘BiocGenerics’ Creating a new generic function for ‘lapply’ in package ‘BiocGenerics’ Creating a new generic function for ‘sapply’ in package ‘BiocGenerics’ Creating a new generic function for ‘mapply’ in package ‘BiocGenerics’ Creating a new generic function for ‘match’ in package ‘BiocGenerics’ Creating a new generic function for ‘order’ in package ‘BiocGenerics’ Creating a new generic function for ‘paste’ in package ‘BiocGenerics’ Creating a new generic function for ‘rank’ in package ‘BiocGenerics’ Creating a new generic function for ‘rownames’ in package ‘BiocGenerics’ Creating a new generic function for ‘colnames’ in package ‘BiocGenerics’ Creating a new generic function for ‘union’ in package ‘BiocGenerics’ Creating a new generic function for ‘intersect’ in package ‘BiocGenerics’ Creating a new generic function for ‘setdiff’ in package ‘BiocGenerics’ Creating a new generic function for ‘table’ in package ‘BiocGenerics’ Creating a new generic function for ‘tapply’ in package ‘BiocGenerics’ Creating a new generic function for ‘unique’ in package ‘BiocGenerics’ Creating a new generic function for ‘unsplit’ in package ‘BiocGenerics’ Creating a new generic function for ‘var’ in package ‘BiocGenerics’ Creating a new generic function for ‘sd’ in package ‘BiocGenerics’ Creating a new generic function for ‘which.min’ in package ‘BiocGenerics’ Creating a new generic function for ‘which.max’ in package ‘BiocGenerics’ Creating a new generic function for ‘IQR’ in package ‘BiocGenerics’ Creating a new generic function for ‘mad’ in package ‘BiocGenerics’ Creating a new generic function for ‘xtabs’ in package ‘BiocGenerics’ Creating a new generic function for ‘basename’ in package ‘BiocGenerics’ Creating a new generic function for ‘dirname’ in package ‘BiocGenerics’ ** help *** installing help indices ** building package indices ** testing if installed package can be loaded from temporary location ** testing if installed package can be loaded from final location ** testing if installed package keeps a record of temporary installation path * DONE (BiocGenerics) * installing *source* package ‘glue’ ... ** package ‘glue’ successfully unpacked and MD5 sums checked ** using staged installation ** libs using C compiler: ‘gcc (Ubuntu 13.2.0-23ubuntu4) 13.2.0’ gcc -I"/usr/share/R/include" -DNDEBUG -fvisibility=hidden -fpic -g -O2 -fno-omit-frame-pointer -mno-omit-leaf-frame-pointer -ffile-prefix-map=/build/r-base-EawLoD/r-base-4.4.1=. -fstack-protector-strong -fstack-clash-protection -Wformat -Werror=format-security -fcf-protection -fdebug-prefix-map=/build/r-base-EawLoD/r-base-4.4.1=/usr/src/r-base-4.4.1-1.2404.0 -Wdate-time -D_FORTIFY_SOURCE=3 -c glue.c -o glue.o gcc -I"/usr/share/R/include" -DNDEBUG -fvisibility=hidden -fpic -g -O2 -fno-omit-frame-pointer -mno-omit-leaf-frame-pointer -ffile-prefix-map=/build/r-base-EawLoD/r-base-4.4.1=. -fstack-protector-strong -fstack-clash-protection -Wformat -Werror=format-security -fcf-protection -fdebug-prefix-map=/build/r-base-EawLoD/r-base-4.4.1=/usr/src/r-base-4.4.1-1.2404.0 -Wdate-time -D_FORTIFY_SOURCE=3 -c init.c -o init.o gcc -I"/usr/share/R/include" -DNDEBUG -fvisibility=hidden -fpic -g -O2 -fno-omit-frame-pointer -mno-omit-leaf-frame-pointer -ffile-prefix-map=/build/r-base-EawLoD/r-base-4.4.1=. -fstack-protector-strong -fstack-clash-protection -Wformat -Werror=format-security -fcf-protection -fdebug-prefix-map=/build/r-base-EawLoD/r-base-4.4.1=/usr/src/r-base-4.4.1-1.2404.0 -Wdate-time -D_FORTIFY_SOURCE=3 -c trim.c -o trim.o gcc -shared -L/usr/lib/R/lib -Wl,-Bsymbolic-functions -flto=auto -ffat-lto-objects -Wl,-z,relro -o glue.so glue.o init.o trim.o -L/usr/lib/R/lib -lR installing to /home/omnipath/local/R/4.4-3.20/00LOCK-glue/00new/glue/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 (glue) * installing *source* package ‘magrittr’ ... ** package ‘magrittr’ successfully unpacked and MD5 sums checked ** using staged installation ** libs using C compiler: ‘gcc (Ubuntu 13.2.0-23ubuntu4) 13.2.0’ gcc -I"/usr/share/R/include" -DNDEBUG -fpic -g -O2 -fno-omit-frame-pointer -mno-omit-leaf-frame-pointer -ffile-prefix-map=/build/r-base-EawLoD/r-base-4.4.1=. -fstack-protector-strong -fstack-clash-protection -Wformat -Werror=format-security -fcf-protection -fdebug-prefix-map=/build/r-base-EawLoD/r-base-4.4.1=/usr/src/r-base-4.4.1-1.2404.0 -Wdate-time -D_FORTIFY_SOURCE=3 -c pipe.c -o pipe.o gcc -I"/usr/share/R/include" -DNDEBUG -fpic -g -O2 -fno-omit-frame-pointer -mno-omit-leaf-frame-pointer -ffile-prefix-map=/build/r-base-EawLoD/r-base-4.4.1=. -fstack-protector-strong -fstack-clash-protection -Wformat -Werror=format-security -fcf-protection -fdebug-prefix-map=/build/r-base-EawLoD/r-base-4.4.1=/usr/src/r-base-4.4.1-1.2404.0 -Wdate-time -D_FORTIFY_SOURCE=3 -c utils.c -o utils.o gcc -shared -L/usr/lib/R/lib -Wl,-Bsymbolic-functions -flto=auto -ffat-lto-objects -Wl,-z,relro -o magrittr.so pipe.o utils.o -L/usr/lib/R/lib -lR installing to /home/omnipath/local/R/4.4-3.20/00LOCK-magrittr/00new/magrittr/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 (magrittr) * installing *source* package ‘rappdirs’ ... ** package ‘rappdirs’ successfully unpacked and MD5 sums checked ** using staged installation ** libs using C compiler: ‘gcc (Ubuntu 13.2.0-23ubuntu4) 13.2.0’ gcc -I"/usr/share/R/include" -DNDEBUG -fpic -g -O2 -fno-omit-frame-pointer -mno-omit-leaf-frame-pointer -ffile-prefix-map=/build/r-base-EawLoD/r-base-4.4.1=. -fstack-protector-strong -fstack-clash-protection -Wformat -Werror=format-security -fcf-protection -fdebug-prefix-map=/build/r-base-EawLoD/r-base-4.4.1=/usr/src/r-base-4.4.1-1.2404.0 -Wdate-time -D_FORTIFY_SOURCE=3 -c init.c -o init.o gcc -I"/usr/share/R/include" -DNDEBUG -fpic -g -O2 -fno-omit-frame-pointer -mno-omit-leaf-frame-pointer -ffile-prefix-map=/build/r-base-EawLoD/r-base-4.4.1=. -fstack-protector-strong -fstack-clash-protection -Wformat -Werror=format-security -fcf-protection -fdebug-prefix-map=/build/r-base-EawLoD/r-base-4.4.1=/usr/src/r-base-4.4.1-1.2404.0 -Wdate-time -D_FORTIFY_SOURCE=3 -c win-path.c -o win-path.o gcc -shared -L/usr/lib/R/lib -Wl,-Bsymbolic-functions -flto=auto -ffat-lto-objects -Wl,-z,relro -o rappdirs.so init.o win-path.o -L/usr/lib/R/lib -lR installing to /home/omnipath/local/R/4.4-3.20/00LOCK-rappdirs/00new/rappdirs/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 (rappdirs) * installing *source* package ‘rlang’ ... ** package ‘rlang’ successfully unpacked and MD5 sums checked ** using staged installation ** libs using C compiler: ‘gcc (Ubuntu 13.2.0-23ubuntu4) 13.2.0’ gcc -I"/usr/share/R/include" -DNDEBUG -I./rlang/ -fvisibility=hidden -fpic -g -O2 -fno-omit-frame-pointer -mno-omit-leaf-frame-pointer -ffile-prefix-map=/build/r-base-EawLoD/r-base-4.4.1=. -fstack-protector-strong -fstack-clash-protection -Wformat -Werror=format-security -fcf-protection -fdebug-prefix-map=/build/r-base-EawLoD/r-base-4.4.1=/usr/src/r-base-4.4.1-1.2404.0 -Wdate-time -D_FORTIFY_SOURCE=3 -c capture.c -o capture.o gcc -I"/usr/share/R/include" -DNDEBUG -I./rlang/ -fvisibility=hidden -fpic -g -O2 -fno-omit-frame-pointer -mno-omit-leaf-frame-pointer -ffile-prefix-map=/build/r-base-EawLoD/r-base-4.4.1=. -fstack-protector-strong -fstack-clash-protection -Wformat -Werror=format-security -fcf-protection -fdebug-prefix-map=/build/r-base-EawLoD/r-base-4.4.1=/usr/src/r-base-4.4.1-1.2404.0 -Wdate-time -D_FORTIFY_SOURCE=3 -c internal.c -o internal.o gcc -I"/usr/share/R/include" -DNDEBUG -I./rlang/ -fvisibility=hidden -fpic -g -O2 -fno-omit-frame-pointer -mno-omit-leaf-frame-pointer -ffile-prefix-map=/build/r-base-EawLoD/r-base-4.4.1=. -fstack-protector-strong -fstack-clash-protection -Wformat -Werror=format-security -fcf-protection -fdebug-prefix-map=/build/r-base-EawLoD/r-base-4.4.1=/usr/src/r-base-4.4.1-1.2404.0 -Wdate-time -D_FORTIFY_SOURCE=3 -c rlang.c -o rlang.o gcc -I"/usr/share/R/include" -DNDEBUG -I./rlang/ -fvisibility=hidden -fpic -g -O2 -fno-omit-frame-pointer -mno-omit-leaf-frame-pointer -ffile-prefix-map=/build/r-base-EawLoD/r-base-4.4.1=. -fstack-protector-strong -fstack-clash-protection -Wformat -Werror=format-security -fcf-protection -fdebug-prefix-map=/build/r-base-EawLoD/r-base-4.4.1=/usr/src/r-base-4.4.1-1.2404.0 -Wdate-time -D_FORTIFY_SOURCE=3 -c version.c -o version.o gcc -shared -L/usr/lib/R/lib -Wl,-Bsymbolic-functions -flto=auto -ffat-lto-objects -Wl,-z,relro -o rlang.so capture.o internal.o rlang.o version.o -L/usr/lib/R/lib -lR installing to /home/omnipath/local/R/4.4-3.20/00LOCK-rlang/00new/rlang/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 (rlang) * installing *source* package ‘withr’ ... ** package ‘withr’ 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 (withr) * installing *source* package ‘evaluate’ ... ** package ‘evaluate’ 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 (evaluate) * installing *source* package ‘xfun’ ... ** package ‘xfun’ successfully unpacked and MD5 sums checked ** using staged installation ** libs using C compiler: ‘gcc (Ubuntu 13.2.0-23ubuntu4) 13.2.0’ gcc -I"/usr/share/R/include" -DNDEBUG -fpic -g -O2 -fno-omit-frame-pointer -mno-omit-leaf-frame-pointer -ffile-prefix-map=/build/r-base-EawLoD/r-base-4.4.1=. -fstack-protector-strong -fstack-clash-protection -Wformat -Werror=format-security -fcf-protection -fdebug-prefix-map=/build/r-base-EawLoD/r-base-4.4.1=/usr/src/r-base-4.4.1-1.2404.0 -Wdate-time -D_FORTIFY_SOURCE=3 -c base64.c -o base64.o gcc -I"/usr/share/R/include" -DNDEBUG -fpic -g -O2 -fno-omit-frame-pointer -mno-omit-leaf-frame-pointer -ffile-prefix-map=/build/r-base-EawLoD/r-base-4.4.1=. -fstack-protector-strong -fstack-clash-protection -Wformat -Werror=format-security -fcf-protection -fdebug-prefix-map=/build/r-base-EawLoD/r-base-4.4.1=/usr/src/r-base-4.4.1-1.2404.0 -Wdate-time -D_FORTIFY_SOURCE=3 -c init.c -o init.o gcc -shared -L/usr/lib/R/lib -Wl,-Bsymbolic-functions -flto=auto -ffat-lto-objects -Wl,-z,relro -o xfun.so base64.o init.o -L/usr/lib/R/lib -lR installing to /home/omnipath/local/R/4.4-3.20/00LOCK-xfun/00new/xfun/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 (xfun) * installing *source* package ‘yaml’ ... ** package ‘yaml’ successfully unpacked and MD5 sums checked ** using staged installation ** libs using C compiler: ‘gcc (Ubuntu 13.2.0-23ubuntu4) 13.2.0’ gcc -I"/usr/share/R/include" -DNDEBUG -I. -DNDEBUG -fpic -g -O2 -fno-omit-frame-pointer -mno-omit-leaf-frame-pointer -ffile-prefix-map=/build/r-base-EawLoD/r-base-4.4.1=. -fstack-protector-strong -fstack-clash-protection -Wformat -Werror=format-security -fcf-protection -fdebug-prefix-map=/build/r-base-EawLoD/r-base-4.4.1=/usr/src/r-base-4.4.1-1.2404.0 -Wdate-time -D_FORTIFY_SOURCE=3 -c api.c -o api.o gcc -I"/usr/share/R/include" -DNDEBUG -I. -DNDEBUG -fpic -g -O2 -fno-omit-frame-pointer -mno-omit-leaf-frame-pointer -ffile-prefix-map=/build/r-base-EawLoD/r-base-4.4.1=. -fstack-protector-strong -fstack-clash-protection -Wformat -Werror=format-security -fcf-protection -fdebug-prefix-map=/build/r-base-EawLoD/r-base-4.4.1=/usr/src/r-base-4.4.1-1.2404.0 -Wdate-time -D_FORTIFY_SOURCE=3 -c dumper.c -o dumper.o gcc -I"/usr/share/R/include" -DNDEBUG -I. -DNDEBUG -fpic -g -O2 -fno-omit-frame-pointer -mno-omit-leaf-frame-pointer -ffile-prefix-map=/build/r-base-EawLoD/r-base-4.4.1=. -fstack-protector-strong -fstack-clash-protection -Wformat -Werror=format-security -fcf-protection -fdebug-prefix-map=/build/r-base-EawLoD/r-base-4.4.1=/usr/src/r-base-4.4.1-1.2404.0 -Wdate-time -D_FORTIFY_SOURCE=3 -c emitter.c -o emitter.o gcc -I"/usr/share/R/include" -DNDEBUG -I. -DNDEBUG -fpic -g -O2 -fno-omit-frame-pointer -mno-omit-leaf-frame-pointer -ffile-prefix-map=/build/r-base-EawLoD/r-base-4.4.1=. -fstack-protector-strong -fstack-clash-protection -Wformat -Werror=format-security -fcf-protection -fdebug-prefix-map=/build/r-base-EawLoD/r-base-4.4.1=/usr/src/r-base-4.4.1-1.2404.0 -Wdate-time -D_FORTIFY_SOURCE=3 -c implicit.c -o implicit.o gcc -I"/usr/share/R/include" -DNDEBUG -I. -DNDEBUG -fpic -g -O2 -fno-omit-frame-pointer -mno-omit-leaf-frame-pointer -ffile-prefix-map=/build/r-base-EawLoD/r-base-4.4.1=. -fstack-protector-strong -fstack-clash-protection -Wformat -Werror=format-security -fcf-protection -fdebug-prefix-map=/build/r-base-EawLoD/r-base-4.4.1=/usr/src/r-base-4.4.1-1.2404.0 -Wdate-time -D_FORTIFY_SOURCE=3 -c loader.c -o loader.o gcc -I"/usr/share/R/include" -DNDEBUG -I. -DNDEBUG -fpic -g -O2 -fno-omit-frame-pointer -mno-omit-leaf-frame-pointer -ffile-prefix-map=/build/r-base-EawLoD/r-base-4.4.1=. -fstack-protector-strong -fstack-clash-protection -Wformat -Werror=format-security -fcf-protection -fdebug-prefix-map=/build/r-base-EawLoD/r-base-4.4.1=/usr/src/r-base-4.4.1-1.2404.0 -Wdate-time -D_FORTIFY_SOURCE=3 -c parser.c -o parser.o gcc -I"/usr/share/R/include" -DNDEBUG -I. -DNDEBUG -fpic -g -O2 -fno-omit-frame-pointer -mno-omit-leaf-frame-pointer -ffile-prefix-map=/build/r-base-EawLoD/r-base-4.4.1=. -fstack-protector-strong -fstack-clash-protection -Wformat -Werror=format-security -fcf-protection -fdebug-prefix-map=/build/r-base-EawLoD/r-base-4.4.1=/usr/src/r-base-4.4.1-1.2404.0 -Wdate-time -D_FORTIFY_SOURCE=3 -c r_emit.c -o r_emit.o gcc -I"/usr/share/R/include" -DNDEBUG -I. -DNDEBUG -fpic -g -O2 -fno-omit-frame-pointer -mno-omit-leaf-frame-pointer -ffile-prefix-map=/build/r-base-EawLoD/r-base-4.4.1=. -fstack-protector-strong -fstack-clash-protection -Wformat -Werror=format-security -fcf-protection -fdebug-prefix-map=/build/r-base-EawLoD/r-base-4.4.1=/usr/src/r-base-4.4.1-1.2404.0 -Wdate-time -D_FORTIFY_SOURCE=3 -c r_ext.c -o r_ext.o gcc -I"/usr/share/R/include" -DNDEBUG -I. -DNDEBUG -fpic -g -O2 -fno-omit-frame-pointer -mno-omit-leaf-frame-pointer -ffile-prefix-map=/build/r-base-EawLoD/r-base-4.4.1=. -fstack-protector-strong -fstack-clash-protection -Wformat -Werror=format-security -fcf-protection -fdebug-prefix-map=/build/r-base-EawLoD/r-base-4.4.1=/usr/src/r-base-4.4.1-1.2404.0 -Wdate-time -D_FORTIFY_SOURCE=3 -c r_parse.c -o r_parse.o gcc -I"/usr/share/R/include" -DNDEBUG -I. -DNDEBUG -fpic -g -O2 -fno-omit-frame-pointer -mno-omit-leaf-frame-pointer -ffile-prefix-map=/build/r-base-EawLoD/r-base-4.4.1=. -fstack-protector-strong -fstack-clash-protection -Wformat -Werror=format-security -fcf-protection -fdebug-prefix-map=/build/r-base-EawLoD/r-base-4.4.1=/usr/src/r-base-4.4.1-1.2404.0 -Wdate-time -D_FORTIFY_SOURCE=3 -c reader.c -o reader.o gcc -I"/usr/share/R/include" -DNDEBUG -I. -DNDEBUG -fpic -g -O2 -fno-omit-frame-pointer -mno-omit-leaf-frame-pointer -ffile-prefix-map=/build/r-base-EawLoD/r-base-4.4.1=. -fstack-protector-strong -fstack-clash-protection -Wformat -Werror=format-security -fcf-protection -fdebug-prefix-map=/build/r-base-EawLoD/r-base-4.4.1=/usr/src/r-base-4.4.1-1.2404.0 -Wdate-time -D_FORTIFY_SOURCE=3 -c scanner.c -o scanner.o gcc -I"/usr/share/R/include" -DNDEBUG -I. -DNDEBUG -fpic -g -O2 -fno-omit-frame-pointer -mno-omit-leaf-frame-pointer -ffile-prefix-map=/build/r-base-EawLoD/r-base-4.4.1=. -fstack-protector-strong -fstack-clash-protection -Wformat -Werror=format-security -fcf-protection -fdebug-prefix-map=/build/r-base-EawLoD/r-base-4.4.1=/usr/src/r-base-4.4.1-1.2404.0 -Wdate-time -D_FORTIFY_SOURCE=3 -c writer.c -o writer.o gcc -shared -L/usr/lib/R/lib -Wl,-Bsymbolic-functions -flto=auto -ffat-lto-objects -Wl,-z,relro -o yaml.so api.o dumper.o emitter.o implicit.o loader.o parser.o r_emit.o r_ext.o r_parse.o reader.o scanner.o writer.o -L/usr/lib/R/lib -lR installing to /home/omnipath/local/R/4.4-3.20/00LOCK-yaml/00new/yaml/libs ** R ** inst ** byte-compile and prepare package for lazy loading ** help *** installing help indices ** building package indices ** testing if installed package can be loaded from temporary location ** checking absolute paths in shared objects and dynamic libraries ** testing if installed package can be loaded from final location ** testing if installed package keeps a record of temporary installation path * DONE (yaml) * installing *source* package ‘BiocBaseUtils’ ... ** using staged installation ** R ** inst ** byte-compile and prepare package for lazy loading ** help *** installing help indices ** building package indices ** installing vignettes ** testing if installed package can be loaded from temporary location ** testing if installed package can be loaded from final location ** testing if installed package keeps a record of temporary installation path * DONE (BiocBaseUtils) * installing *source* package ‘cli’ ... ** package ‘cli’ successfully unpacked and MD5 sums checked ** using staged installation ** libs using C compiler: ‘gcc (Ubuntu 13.2.0-23ubuntu4) 13.2.0’ gcc -I"/usr/share/R/include" -DNDEBUG -fvisibility=hidden -I../inst/include -fpic -g -O2 -fno-omit-frame-pointer -mno-omit-leaf-frame-pointer -ffile-prefix-map=/build/r-base-EawLoD/r-base-4.4.1=. -fstack-protector-strong -fstack-clash-protection -Wformat -Werror=format-security -fcf-protection -fdebug-prefix-map=/build/r-base-EawLoD/r-base-4.4.1=/usr/src/r-base-4.4.1-1.2404.0 -Wdate-time -D_FORTIFY_SOURCE=3 -c ansi.c -o ansi.o gcc -I"/usr/share/R/include" -DNDEBUG -fvisibility=hidden -I../inst/include -fpic -g -O2 -fno-omit-frame-pointer -mno-omit-leaf-frame-pointer -ffile-prefix-map=/build/r-base-EawLoD/r-base-4.4.1=. -fstack-protector-strong -fstack-clash-protection -Wformat -Werror=format-security -fcf-protection -fdebug-prefix-map=/build/r-base-EawLoD/r-base-4.4.1=/usr/src/r-base-4.4.1-1.2404.0 -Wdate-time -D_FORTIFY_SOURCE=3 -c cleancall.c -o cleancall.o gcc -I"/usr/share/R/include" -DNDEBUG -fvisibility=hidden -I../inst/include -fpic -g -O2 -fno-omit-frame-pointer -mno-omit-leaf-frame-pointer -ffile-prefix-map=/build/r-base-EawLoD/r-base-4.4.1=. -fstack-protector-strong -fstack-clash-protection -Wformat -Werror=format-security -fcf-protection -fdebug-prefix-map=/build/r-base-EawLoD/r-base-4.4.1=/usr/src/r-base-4.4.1-1.2404.0 -Wdate-time -D_FORTIFY_SOURCE=3 -c diff.c -o diff.o gcc -I"/usr/share/R/include" -DNDEBUG -fvisibility=hidden -I../inst/include -fpic -g -O2 -fno-omit-frame-pointer -mno-omit-leaf-frame-pointer -ffile-prefix-map=/build/r-base-EawLoD/r-base-4.4.1=. -fstack-protector-strong -fstack-clash-protection -Wformat -Werror=format-security -fcf-protection -fdebug-prefix-map=/build/r-base-EawLoD/r-base-4.4.1=/usr/src/r-base-4.4.1-1.2404.0 -Wdate-time -D_FORTIFY_SOURCE=3 -c errors.c -o errors.o gcc -I"/usr/share/R/include" -DNDEBUG -fvisibility=hidden -I../inst/include -fpic -g -O2 -fno-omit-frame-pointer -mno-omit-leaf-frame-pointer -ffile-prefix-map=/build/r-base-EawLoD/r-base-4.4.1=. -fstack-protector-strong -fstack-clash-protection -Wformat -Werror=format-security -fcf-protection -fdebug-prefix-map=/build/r-base-EawLoD/r-base-4.4.1=/usr/src/r-base-4.4.1-1.2404.0 -Wdate-time -D_FORTIFY_SOURCE=3 -c glue.c -o glue.o gcc -I"/usr/share/R/include" -DNDEBUG -fvisibility=hidden -I../inst/include -fpic -g -O2 -fno-omit-frame-pointer -mno-omit-leaf-frame-pointer -ffile-prefix-map=/build/r-base-EawLoD/r-base-4.4.1=. -fstack-protector-strong -fstack-clash-protection -Wformat -Werror=format-security -fcf-protection -fdebug-prefix-map=/build/r-base-EawLoD/r-base-4.4.1=/usr/src/r-base-4.4.1-1.2404.0 -Wdate-time -D_FORTIFY_SOURCE=3 -c init.c -o init.o gcc -I"/usr/share/R/include" -DNDEBUG -fvisibility=hidden -I../inst/include -fpic -g -O2 -fno-omit-frame-pointer -mno-omit-leaf-frame-pointer -ffile-prefix-map=/build/r-base-EawLoD/r-base-4.4.1=. -fstack-protector-strong -fstack-clash-protection -Wformat -Werror=format-security -fcf-protection -fdebug-prefix-map=/build/r-base-EawLoD/r-base-4.4.1=/usr/src/r-base-4.4.1-1.2404.0 -Wdate-time -D_FORTIFY_SOURCE=3 -c inst.c -o inst.o gcc -I"/usr/share/R/include" -DNDEBUG -fvisibility=hidden -I../inst/include -fpic -g -O2 -fno-omit-frame-pointer -mno-omit-leaf-frame-pointer -ffile-prefix-map=/build/r-base-EawLoD/r-base-4.4.1=. -fstack-protector-strong -fstack-clash-protection -Wformat -Werror=format-security -fcf-protection -fdebug-prefix-map=/build/r-base-EawLoD/r-base-4.4.1=/usr/src/r-base-4.4.1-1.2404.0 -Wdate-time -D_FORTIFY_SOURCE=3 -c keypress-unix.c -o keypress-unix.o gcc -I"/usr/share/R/include" -DNDEBUG -fvisibility=hidden -I../inst/include -fpic -g -O2 -fno-omit-frame-pointer -mno-omit-leaf-frame-pointer -ffile-prefix-map=/build/r-base-EawLoD/r-base-4.4.1=. -fstack-protector-strong -fstack-clash-protection -Wformat -Werror=format-security -fcf-protection -fdebug-prefix-map=/build/r-base-EawLoD/r-base-4.4.1=/usr/src/r-base-4.4.1-1.2404.0 -Wdate-time -D_FORTIFY_SOURCE=3 -c keypress-win.c -o keypress-win.o gcc -I"/usr/share/R/include" -DNDEBUG -fvisibility=hidden -I../inst/include -fpic -g -O2 -fno-omit-frame-pointer -mno-omit-leaf-frame-pointer -ffile-prefix-map=/build/r-base-EawLoD/r-base-4.4.1=. -fstack-protector-strong -fstack-clash-protection -Wformat -Werror=format-security -fcf-protection -fdebug-prefix-map=/build/r-base-EawLoD/r-base-4.4.1=/usr/src/r-base-4.4.1-1.2404.0 -Wdate-time -D_FORTIFY_SOURCE=3 -c keypress.c -o keypress.o gcc -I"/usr/share/R/include" -DNDEBUG -fvisibility=hidden -I../inst/include -fpic -g -O2 -fno-omit-frame-pointer -mno-omit-leaf-frame-pointer -ffile-prefix-map=/build/r-base-EawLoD/r-base-4.4.1=. -fstack-protector-strong -fstack-clash-protection -Wformat -Werror=format-security -fcf-protection -fdebug-prefix-map=/build/r-base-EawLoD/r-base-4.4.1=/usr/src/r-base-4.4.1-1.2404.0 -Wdate-time -D_FORTIFY_SOURCE=3 -c md5.c -o md5.o gcc -I"/usr/share/R/include" -DNDEBUG -fvisibility=hidden -I../inst/include -fpic -g -O2 -fno-omit-frame-pointer -mno-omit-leaf-frame-pointer -ffile-prefix-map=/build/r-base-EawLoD/r-base-4.4.1=. -fstack-protector-strong -fstack-clash-protection -Wformat -Werror=format-security -fcf-protection -fdebug-prefix-map=/build/r-base-EawLoD/r-base-4.4.1=/usr/src/r-base-4.4.1-1.2404.0 -Wdate-time -D_FORTIFY_SOURCE=3 -c progress-altrep.c -o progress-altrep.o gcc -I"/usr/share/R/include" -DNDEBUG -fvisibility=hidden -I../inst/include -fpic -g -O2 -fno-omit-frame-pointer -mno-omit-leaf-frame-pointer -ffile-prefix-map=/build/r-base-EawLoD/r-base-4.4.1=. -fstack-protector-strong -fstack-clash-protection -Wformat -Werror=format-security -fcf-protection -fdebug-prefix-map=/build/r-base-EawLoD/r-base-4.4.1=/usr/src/r-base-4.4.1-1.2404.0 -Wdate-time -D_FORTIFY_SOURCE=3 -c progress.c -o progress.o gcc -I"/usr/share/R/include" -DNDEBUG -fvisibility=hidden -I../inst/include -fpic -g -O2 -fno-omit-frame-pointer -mno-omit-leaf-frame-pointer -ffile-prefix-map=/build/r-base-EawLoD/r-base-4.4.1=. -fstack-protector-strong -fstack-clash-protection -Wformat -Werror=format-security -fcf-protection -fdebug-prefix-map=/build/r-base-EawLoD/r-base-4.4.1=/usr/src/r-base-4.4.1-1.2404.0 -Wdate-time -D_FORTIFY_SOURCE=3 -c sha1.c -o sha1.o gcc -I"/usr/share/R/include" -DNDEBUG -fvisibility=hidden -I../inst/include -fpic -g -O2 -fno-omit-frame-pointer -mno-omit-leaf-frame-pointer -ffile-prefix-map=/build/r-base-EawLoD/r-base-4.4.1=. -fstack-protector-strong -fstack-clash-protection -Wformat -Werror=format-security -fcf-protection -fdebug-prefix-map=/build/r-base-EawLoD/r-base-4.4.1=/usr/src/r-base-4.4.1-1.2404.0 -Wdate-time -D_FORTIFY_SOURCE=3 -c sha256.c -o sha256.o gcc -I"/usr/share/R/include" -DNDEBUG -fvisibility=hidden -I../inst/include -fpic -g -O2 -fno-omit-frame-pointer -mno-omit-leaf-frame-pointer -ffile-prefix-map=/build/r-base-EawLoD/r-base-4.4.1=. -fstack-protector-strong -fstack-clash-protection -Wformat -Werror=format-security -fcf-protection -fdebug-prefix-map=/build/r-base-EawLoD/r-base-4.4.1=/usr/src/r-base-4.4.1-1.2404.0 -Wdate-time -D_FORTIFY_SOURCE=3 -c thread.c -o thread.o gcc -I"/usr/share/R/include" -DNDEBUG -fvisibility=hidden -I../inst/include -fpic -g -O2 -fno-omit-frame-pointer -mno-omit-leaf-frame-pointer -ffile-prefix-map=/build/r-base-EawLoD/r-base-4.4.1=. -fstack-protector-strong -fstack-clash-protection -Wformat -Werror=format-security -fcf-protection -fdebug-prefix-map=/build/r-base-EawLoD/r-base-4.4.1=/usr/src/r-base-4.4.1-1.2404.0 -Wdate-time -D_FORTIFY_SOURCE=3 -c tty.c -o tty.o gcc -I"/usr/share/R/include" -DNDEBUG -fvisibility=hidden -I../inst/include -fpic -g -O2 -fno-omit-frame-pointer -mno-omit-leaf-frame-pointer -ffile-prefix-map=/build/r-base-EawLoD/r-base-4.4.1=. -fstack-protector-strong -fstack-clash-protection -Wformat -Werror=format-security -fcf-protection -fdebug-prefix-map=/build/r-base-EawLoD/r-base-4.4.1=/usr/src/r-base-4.4.1-1.2404.0 -Wdate-time -D_FORTIFY_SOURCE=3 -c utf8.c -o utf8.o gcc -I"/usr/share/R/include" -DNDEBUG -fvisibility=hidden -I../inst/include -fpic -g -O2 -fno-omit-frame-pointer -mno-omit-leaf-frame-pointer -ffile-prefix-map=/build/r-base-EawLoD/r-base-4.4.1=. -fstack-protector-strong -fstack-clash-protection -Wformat -Werror=format-security -fcf-protection -fdebug-prefix-map=/build/r-base-EawLoD/r-base-4.4.1=/usr/src/r-base-4.4.1-1.2404.0 -Wdate-time -D_FORTIFY_SOURCE=3 -c utils.c -o utils.o gcc -I"/usr/share/R/include" -DNDEBUG -fvisibility=hidden -I../inst/include -fpic -g -O2 -fno-omit-frame-pointer -mno-omit-leaf-frame-pointer -ffile-prefix-map=/build/r-base-EawLoD/r-base-4.4.1=. -fstack-protector-strong -fstack-clash-protection -Wformat -Werror=format-security -fcf-protection -fdebug-prefix-map=/build/r-base-EawLoD/r-base-4.4.1=/usr/src/r-base-4.4.1-1.2404.0 -Wdate-time -D_FORTIFY_SOURCE=3 -c vt.c -o vt.o gcc -I"/usr/share/R/include" -DNDEBUG -fvisibility=hidden -I../inst/include -fpic -g -O2 -fno-omit-frame-pointer -mno-omit-leaf-frame-pointer -ffile-prefix-map=/build/r-base-EawLoD/r-base-4.4.1=. -fstack-protector-strong -fstack-clash-protection -Wformat -Werror=format-security -fcf-protection -fdebug-prefix-map=/build/r-base-EawLoD/r-base-4.4.1=/usr/src/r-base-4.4.1-1.2404.0 -Wdate-time -D_FORTIFY_SOURCE=3 -c vtparse.c -o vtparse.o gcc -I"/usr/share/R/include" -DNDEBUG -fvisibility=hidden -I../inst/include -fpic -g -O2 -fno-omit-frame-pointer -mno-omit-leaf-frame-pointer -ffile-prefix-map=/build/r-base-EawLoD/r-base-4.4.1=. -fstack-protector-strong -fstack-clash-protection -Wformat -Werror=format-security -fcf-protection -fdebug-prefix-map=/build/r-base-EawLoD/r-base-4.4.1=/usr/src/r-base-4.4.1-1.2404.0 -Wdate-time -D_FORTIFY_SOURCE=3 -c vtparse_table.c -o vtparse_table.o gcc -I"/usr/share/R/include" -DNDEBUG -fvisibility=hidden -I../inst/include -fpic -g -O2 -fno-omit-frame-pointer -mno-omit-leaf-frame-pointer -ffile-prefix-map=/build/r-base-EawLoD/r-base-4.4.1=. -fstack-protector-strong -fstack-clash-protection -Wformat -Werror=format-security -fcf-protection -fdebug-prefix-map=/build/r-base-EawLoD/r-base-4.4.1=/usr/src/r-base-4.4.1-1.2404.0 -Wdate-time -D_FORTIFY_SOURCE=3 -c win-utf8.c -o win-utf8.o gcc -I"/usr/share/R/include" -DNDEBUG -fvisibility=hidden -I../inst/include -fpic -g -O2 -fno-omit-frame-pointer -mno-omit-leaf-frame-pointer -ffile-prefix-map=/build/r-base-EawLoD/r-base-4.4.1=. -fstack-protector-strong -fstack-clash-protection -Wformat -Werror=format-security -fcf-protection -fdebug-prefix-map=/build/r-base-EawLoD/r-base-4.4.1=/usr/src/r-base-4.4.1-1.2404.0 -Wdate-time -D_FORTIFY_SOURCE=3 -c winfiles.c -o winfiles.o gcc -shared -L/usr/lib/R/lib -Wl,-Bsymbolic-functions -flto=auto -ffat-lto-objects -Wl,-z,relro -o cli.so ansi.o cleancall.o diff.o errors.o glue.o init.o inst.o keypress-unix.o keypress-win.o keypress.o md5.o progress-altrep.o progress.o sha1.o sha256.o thread.o tty.o utf8.o utils.o vt.o vtparse.o vtparse_table.o win-utf8.o winfiles.o -lpthread -L/usr/lib/R/lib -lR installing to /home/omnipath/local/R/4.4-3.20/00LOCK-cli/00new/cli/libs ** R ** exec ** 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 (cli) * installing *source* package ‘stringdist’ ... ** package ‘stringdist’ successfully unpacked and MD5 sums checked ** using staged installation ** libs using C compiler: ‘gcc (Ubuntu 13.2.0-23ubuntu4) 13.2.0’ gcc -I"/usr/share/R/include" -DNDEBUG -I../inst/include -fopenmp -fpic -g -O2 -fno-omit-frame-pointer -mno-omit-leaf-frame-pointer -ffile-prefix-map=/build/r-base-EawLoD/r-base-4.4.1=. -fstack-protector-strong -fstack-clash-protection -Wformat -Werror=format-security -fcf-protection -fdebug-prefix-map=/build/r-base-EawLoD/r-base-4.4.1=/usr/src/r-base-4.4.1-1.2404.0 -Wdate-time -D_FORTIFY_SOURCE=3 -c R_register_native.c -o R_register_native.o gcc -I"/usr/share/R/include" -DNDEBUG -I../inst/include -fopenmp -fpic -g -O2 -fno-omit-frame-pointer -mno-omit-leaf-frame-pointer -ffile-prefix-map=/build/r-base-EawLoD/r-base-4.4.1=. -fstack-protector-strong -fstack-clash-protection -Wformat -Werror=format-security -fcf-protection -fdebug-prefix-map=/build/r-base-EawLoD/r-base-4.4.1=/usr/src/r-base-4.4.1-1.2404.0 -Wdate-time -D_FORTIFY_SOURCE=3 -c Rstringdist.c -o Rstringdist.o gcc -I"/usr/share/R/include" -DNDEBUG -I../inst/include -fopenmp -fpic -g -O2 -fno-omit-frame-pointer -mno-omit-leaf-frame-pointer -ffile-prefix-map=/build/r-base-EawLoD/r-base-4.4.1=. -fstack-protector-strong -fstack-clash-protection -Wformat -Werror=format-security -fcf-protection -fdebug-prefix-map=/build/r-base-EawLoD/r-base-4.4.1=/usr/src/r-base-4.4.1-1.2404.0 -Wdate-time -D_FORTIFY_SOURCE=3 -c dl.c -o dl.o gcc -I"/usr/share/R/include" -DNDEBUG -I../inst/include -fopenmp -fpic -g -O2 -fno-omit-frame-pointer -mno-omit-leaf-frame-pointer -ffile-prefix-map=/build/r-base-EawLoD/r-base-4.4.1=. -fstack-protector-strong -fstack-clash-protection -Wformat -Werror=format-security -fcf-protection -fdebug-prefix-map=/build/r-base-EawLoD/r-base-4.4.1=/usr/src/r-base-4.4.1-1.2404.0 -Wdate-time -D_FORTIFY_SOURCE=3 -c hamming.c -o hamming.o gcc -I"/usr/share/R/include" -DNDEBUG -I../inst/include -fopenmp -fpic -g -O2 -fno-omit-frame-pointer -mno-omit-leaf-frame-pointer -ffile-prefix-map=/build/r-base-EawLoD/r-base-4.4.1=. -fstack-protector-strong -fstack-clash-protection -Wformat -Werror=format-security -fcf-protection -fdebug-prefix-map=/build/r-base-EawLoD/r-base-4.4.1=/usr/src/r-base-4.4.1-1.2404.0 -Wdate-time -D_FORTIFY_SOURCE=3 -c jaro.c -o jaro.o gcc -I"/usr/share/R/include" -DNDEBUG -I../inst/include -fopenmp -fpic -g -O2 -fno-omit-frame-pointer -mno-omit-leaf-frame-pointer -ffile-prefix-map=/build/r-base-EawLoD/r-base-4.4.1=. -fstack-protector-strong -fstack-clash-protection -Wformat -Werror=format-security -fcf-protection -fdebug-prefix-map=/build/r-base-EawLoD/r-base-4.4.1=/usr/src/r-base-4.4.1-1.2404.0 -Wdate-time -D_FORTIFY_SOURCE=3 -c lcs.c -o lcs.o gcc -I"/usr/share/R/include" -DNDEBUG -I../inst/include -fopenmp -fpic -g -O2 -fno-omit-frame-pointer -mno-omit-leaf-frame-pointer -ffile-prefix-map=/build/r-base-EawLoD/r-base-4.4.1=. -fstack-protector-strong -fstack-clash-protection -Wformat -Werror=format-security -fcf-protection -fdebug-prefix-map=/build/r-base-EawLoD/r-base-4.4.1=/usr/src/r-base-4.4.1-1.2404.0 -Wdate-time -D_FORTIFY_SOURCE=3 -c lv.c -o lv.o gcc -I"/usr/share/R/include" -DNDEBUG -I../inst/include -fopenmp -fpic -g -O2 -fno-omit-frame-pointer -mno-omit-leaf-frame-pointer -ffile-prefix-map=/build/r-base-EawLoD/r-base-4.4.1=. -fstack-protector-strong -fstack-clash-protection -Wformat -Werror=format-security -fcf-protection -fdebug-prefix-map=/build/r-base-EawLoD/r-base-4.4.1=/usr/src/r-base-4.4.1-1.2404.0 -Wdate-time -D_FORTIFY_SOURCE=3 -c osa.c -o osa.o gcc -I"/usr/share/R/include" -DNDEBUG -I../inst/include -fopenmp -fpic -g -O2 -fno-omit-frame-pointer -mno-omit-leaf-frame-pointer -ffile-prefix-map=/build/r-base-EawLoD/r-base-4.4.1=. -fstack-protector-strong -fstack-clash-protection -Wformat -Werror=format-security -fcf-protection -fdebug-prefix-map=/build/r-base-EawLoD/r-base-4.4.1=/usr/src/r-base-4.4.1-1.2404.0 -Wdate-time -D_FORTIFY_SOURCE=3 -c qgram.c -o qgram.o gcc -I"/usr/share/R/include" -DNDEBUG -I../inst/include -fopenmp -fpic -g -O2 -fno-omit-frame-pointer -mno-omit-leaf-frame-pointer -ffile-prefix-map=/build/r-base-EawLoD/r-base-4.4.1=. -fstack-protector-strong -fstack-clash-protection -Wformat -Werror=format-security -fcf-protection -fdebug-prefix-map=/build/r-base-EawLoD/r-base-4.4.1=/usr/src/r-base-4.4.1-1.2404.0 -Wdate-time -D_FORTIFY_SOURCE=3 -c soundex.c -o soundex.o gcc -I"/usr/share/R/include" -DNDEBUG -I../inst/include -fopenmp -fpic -g -O2 -fno-omit-frame-pointer -mno-omit-leaf-frame-pointer -ffile-prefix-map=/build/r-base-EawLoD/r-base-4.4.1=. -fstack-protector-strong -fstack-clash-protection -Wformat -Werror=format-security -fcf-protection -fdebug-prefix-map=/build/r-base-EawLoD/r-base-4.4.1=/usr/src/r-base-4.4.1-1.2404.0 -Wdate-time -D_FORTIFY_SOURCE=3 -c stringdist.c -o stringdist.o gcc -I"/usr/share/R/include" -DNDEBUG -I../inst/include -fopenmp -fpic -g -O2 -fno-omit-frame-pointer -mno-omit-leaf-frame-pointer -ffile-prefix-map=/build/r-base-EawLoD/r-base-4.4.1=. -fstack-protector-strong -fstack-clash-protection -Wformat -Werror=format-security -fcf-protection -fdebug-prefix-map=/build/r-base-EawLoD/r-base-4.4.1=/usr/src/r-base-4.4.1-1.2404.0 -Wdate-time -D_FORTIFY_SOURCE=3 -c utf8ToInt.c -o utf8ToInt.o gcc -I"/usr/share/R/include" -DNDEBUG -I../inst/include -fopenmp -fpic -g -O2 -fno-omit-frame-pointer -mno-omit-leaf-frame-pointer -ffile-prefix-map=/build/r-base-EawLoD/r-base-4.4.1=. -fstack-protector-strong -fstack-clash-protection -Wformat -Werror=format-security -fcf-protection -fdebug-prefix-map=/build/r-base-EawLoD/r-base-4.4.1=/usr/src/r-base-4.4.1-1.2404.0 -Wdate-time -D_FORTIFY_SOURCE=3 -c utils.c -o utils.o gcc -shared -L/usr/lib/R/lib -Wl,-Bsymbolic-functions -flto=auto -ffat-lto-objects -Wl,-z,relro -o stringdist.so R_register_native.o Rstringdist.o dl.o hamming.o jaro.o lcs.o lv.o osa.o qgram.o soundex.o stringdist.o utf8ToInt.o utils.o -fopenmp -L/usr/lib/R/lib -lR installing to /home/omnipath/local/R/4.4-3.20/00LOCK-stringdist/00new/stringdist/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 (stringdist) * installing *source* package ‘cachem’ ... ** package ‘cachem’ successfully unpacked and MD5 sums checked ** using staged installation ** libs using C compiler: ‘gcc (Ubuntu 13.2.0-23ubuntu4) 13.2.0’ gcc -I"/usr/share/R/include" -DNDEBUG -fpic -g -O2 -fno-omit-frame-pointer -mno-omit-leaf-frame-pointer -ffile-prefix-map=/build/r-base-EawLoD/r-base-4.4.1=. -fstack-protector-strong -fstack-clash-protection -Wformat -Werror=format-security -fcf-protection -fdebug-prefix-map=/build/r-base-EawLoD/r-base-4.4.1=/usr/src/r-base-4.4.1-1.2404.0 -Wdate-time -D_FORTIFY_SOURCE=3 -c cache.c -o cache.o gcc -I"/usr/share/R/include" -DNDEBUG -fpic -g -O2 -fno-omit-frame-pointer -mno-omit-leaf-frame-pointer -ffile-prefix-map=/build/r-base-EawLoD/r-base-4.4.1=. -fstack-protector-strong -fstack-clash-protection -Wformat -Werror=format-security -fcf-protection -fdebug-prefix-map=/build/r-base-EawLoD/r-base-4.4.1=/usr/src/r-base-4.4.1-1.2404.0 -Wdate-time -D_FORTIFY_SOURCE=3 -c init.c -o init.o gcc -shared -L/usr/lib/R/lib -Wl,-Bsymbolic-functions -flto=auto -ffat-lto-objects -Wl,-z,relro -o cachem.so cache.o init.o -L/usr/lib/R/lib -lR installing to /home/omnipath/local/R/4.4-3.20/00LOCK-cachem/00new/cachem/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 (cachem) * installing *source* package ‘bit64’ ... ** package ‘bit64’ successfully unpacked and MD5 sums checked ** using staged installation ** libs using C compiler: ‘gcc (Ubuntu 13.2.0-23ubuntu4) 13.2.0’ gcc -I"/usr/share/R/include" -DNDEBUG -fpic -g -O2 -fno-omit-frame-pointer -mno-omit-leaf-frame-pointer -ffile-prefix-map=/build/r-base-EawLoD/r-base-4.4.1=. -fstack-protector-strong -fstack-clash-protection -Wformat -Werror=format-security -fcf-protection -fdebug-prefix-map=/build/r-base-EawLoD/r-base-4.4.1=/usr/src/r-base-4.4.1-1.2404.0 -Wdate-time -D_FORTIFY_SOURCE=3 -c bsearch.c -o bsearch.o gcc -I"/usr/share/R/include" -DNDEBUG -fpic -g -O2 -fno-omit-frame-pointer -mno-omit-leaf-frame-pointer -ffile-prefix-map=/build/r-base-EawLoD/r-base-4.4.1=. -fstack-protector-strong -fstack-clash-protection -Wformat -Werror=format-security -fcf-protection -fdebug-prefix-map=/build/r-base-EawLoD/r-base-4.4.1=/usr/src/r-base-4.4.1-1.2404.0 -Wdate-time -D_FORTIFY_SOURCE=3 -c cache.c -o cache.o gcc -I"/usr/share/R/include" -DNDEBUG -fpic -g -O2 -fno-omit-frame-pointer -mno-omit-leaf-frame-pointer -ffile-prefix-map=/build/r-base-EawLoD/r-base-4.4.1=. -fstack-protector-strong -fstack-clash-protection -Wformat -Werror=format-security -fcf-protection -fdebug-prefix-map=/build/r-base-EawLoD/r-base-4.4.1=/usr/src/r-base-4.4.1-1.2404.0 -Wdate-time -D_FORTIFY_SOURCE=3 -c hash64.c -o hash64.o gcc -I"/usr/share/R/include" -DNDEBUG -fpic -g -O2 -fno-omit-frame-pointer -mno-omit-leaf-frame-pointer -ffile-prefix-map=/build/r-base-EawLoD/r-base-4.4.1=. -fstack-protector-strong -fstack-clash-protection -Wformat -Werror=format-security -fcf-protection -fdebug-prefix-map=/build/r-base-EawLoD/r-base-4.4.1=/usr/src/r-base-4.4.1-1.2404.0 -Wdate-time -D_FORTIFY_SOURCE=3 -c init.c -o init.o gcc -I"/usr/share/R/include" -DNDEBUG -fpic -g -O2 -fno-omit-frame-pointer -mno-omit-leaf-frame-pointer -ffile-prefix-map=/build/r-base-EawLoD/r-base-4.4.1=. -fstack-protector-strong -fstack-clash-protection -Wformat -Werror=format-security -fcf-protection -fdebug-prefix-map=/build/r-base-EawLoD/r-base-4.4.1=/usr/src/r-base-4.4.1-1.2404.0 -Wdate-time -D_FORTIFY_SOURCE=3 -c integer64.c -o integer64.o gcc -I"/usr/share/R/include" -DNDEBUG -fpic -g -O2 -fno-omit-frame-pointer -mno-omit-leaf-frame-pointer -ffile-prefix-map=/build/r-base-EawLoD/r-base-4.4.1=. -fstack-protector-strong -fstack-clash-protection -Wformat -Werror=format-security -fcf-protection -fdebug-prefix-map=/build/r-base-EawLoD/r-base-4.4.1=/usr/src/r-base-4.4.1-1.2404.0 -Wdate-time -D_FORTIFY_SOURCE=3 -c sort64.c -o sort64.o gcc -I"/usr/share/R/include" -DNDEBUG -fpic -g -O2 -fno-omit-frame-pointer -mno-omit-leaf-frame-pointer -ffile-prefix-map=/build/r-base-EawLoD/r-base-4.4.1=. -fstack-protector-strong -fstack-clash-protection -Wformat -Werror=format-security -fcf-protection -fdebug-prefix-map=/build/r-base-EawLoD/r-base-4.4.1=/usr/src/r-base-4.4.1-1.2404.0 -Wdate-time -D_FORTIFY_SOURCE=3 -c sortuse64.c -o sortuse64.o gcc -shared -L/usr/lib/R/lib -Wl,-Bsymbolic-functions -flto=auto -ffat-lto-objects -Wl,-z,relro -o bit64.so bsearch.o cache.o hash64.o init.o integer64.o sort64.o sortuse64.o -lm -L/usr/lib/R/lib -lR installing to /home/omnipath/local/R/4.4-3.20/00LOCK-bit64/00new/bit64/libs ** R ** data ** exec ** inst ** byte-compile and prepare package for lazy loading ** help *** installing help indices ** building package indices ** testing if installed package can be loaded from temporary location ** checking absolute paths in shared objects and dynamic libraries ** testing if installed package can be loaded from final location ** testing if installed package keeps a record of temporary installation path * DONE (bit64) * installing *source* package ‘askpass’ ... ** package ‘askpass’ successfully unpacked and MD5 sums checked ** using staged installation ** libs using C compiler: ‘gcc (Ubuntu 13.2.0-23ubuntu4) 13.2.0’ gcc -I"/usr/share/R/include" -DNDEBUG -fpic -g -O2 -fno-omit-frame-pointer -mno-omit-leaf-frame-pointer -ffile-prefix-map=/build/r-base-EawLoD/r-base-4.4.1=. -fstack-protector-strong -fstack-clash-protection -Wformat -Werror=format-security -fcf-protection -fdebug-prefix-map=/build/r-base-EawLoD/r-base-4.4.1=/usr/src/r-base-4.4.1-1.2404.0 -Wdate-time -D_FORTIFY_SOURCE=3 -c askpass.c -o askpass.o gcc -shared -L/usr/lib/R/lib -Wl,-Bsymbolic-functions -flto=auto -ffat-lto-objects -Wl,-z,relro -o askpass.so askpass.o -L/usr/lib/R/lib -lR installing to /home/omnipath/local/R/4.4-3.20/00LOCK-askpass/00new/askpass/libs ** R ** inst ** byte-compile and prepare package for lazy loading ** help *** installing help indices ** building package indices ** testing if installed package can be loaded from temporary location ** checking absolute paths in shared objects and dynamic libraries ** testing if installed package can be loaded from final location ** testing if installed package keeps a record of temporary installation path * DONE (askpass) * installing *source* package ‘Biobase’ ... ** using staged installation ** libs using C compiler: ‘gcc (Ubuntu 13.2.0-23ubuntu4) 13.2.0’ gcc -I"/usr/share/R/include" -DNDEBUG -fpic -g -O2 -fno-omit-frame-pointer -mno-omit-leaf-frame-pointer -ffile-prefix-map=/build/r-base-EawLoD/r-base-4.4.1=. -fstack-protector-strong -fstack-clash-protection -Wformat -Werror=format-security -fcf-protection -fdebug-prefix-map=/build/r-base-EawLoD/r-base-4.4.1=/usr/src/r-base-4.4.1-1.2404.0 -Wdate-time -D_FORTIFY_SOURCE=3 -c Rinit.c -o Rinit.o gcc -I"/usr/share/R/include" -DNDEBUG -fpic -g -O2 -fno-omit-frame-pointer -mno-omit-leaf-frame-pointer -ffile-prefix-map=/build/r-base-EawLoD/r-base-4.4.1=. -fstack-protector-strong -fstack-clash-protection -Wformat -Werror=format-security -fcf-protection -fdebug-prefix-map=/build/r-base-EawLoD/r-base-4.4.1=/usr/src/r-base-4.4.1-1.2404.0 -Wdate-time -D_FORTIFY_SOURCE=3 -c anyMissing.c -o anyMissing.o gcc -I"/usr/share/R/include" -DNDEBUG -fpic -g -O2 -fno-omit-frame-pointer -mno-omit-leaf-frame-pointer -ffile-prefix-map=/build/r-base-EawLoD/r-base-4.4.1=. -fstack-protector-strong -fstack-clash-protection -Wformat -Werror=format-security -fcf-protection -fdebug-prefix-map=/build/r-base-EawLoD/r-base-4.4.1=/usr/src/r-base-4.4.1-1.2404.0 -Wdate-time -D_FORTIFY_SOURCE=3 -c envir.c -o envir.o gcc -I"/usr/share/R/include" -DNDEBUG -fpic -g -O2 -fno-omit-frame-pointer -mno-omit-leaf-frame-pointer -ffile-prefix-map=/build/r-base-EawLoD/r-base-4.4.1=. -fstack-protector-strong -fstack-clash-protection -Wformat -Werror=format-security -fcf-protection -fdebug-prefix-map=/build/r-base-EawLoD/r-base-4.4.1=/usr/src/r-base-4.4.1-1.2404.0 -Wdate-time -D_FORTIFY_SOURCE=3 -c matchpt.c -o matchpt.o gcc -I"/usr/share/R/include" -DNDEBUG -fpic -g -O2 -fno-omit-frame-pointer -mno-omit-leaf-frame-pointer -ffile-prefix-map=/build/r-base-EawLoD/r-base-4.4.1=. -fstack-protector-strong -fstack-clash-protection -Wformat -Werror=format-security -fcf-protection -fdebug-prefix-map=/build/r-base-EawLoD/r-base-4.4.1=/usr/src/r-base-4.4.1-1.2404.0 -Wdate-time -D_FORTIFY_SOURCE=3 -c rowMedians.c -o rowMedians.o gcc -I"/usr/share/R/include" -DNDEBUG -fpic -g -O2 -fno-omit-frame-pointer -mno-omit-leaf-frame-pointer -ffile-prefix-map=/build/r-base-EawLoD/r-base-4.4.1=. -fstack-protector-strong -fstack-clash-protection -Wformat -Werror=format-security -fcf-protection -fdebug-prefix-map=/build/r-base-EawLoD/r-base-4.4.1=/usr/src/r-base-4.4.1-1.2404.0 -Wdate-time -D_FORTIFY_SOURCE=3 -c sublist_extract.c -o sublist_extract.o gcc -shared -L/usr/lib/R/lib -Wl,-Bsymbolic-functions -flto=auto -ffat-lto-objects -Wl,-z,relro -o Biobase.so Rinit.o anyMissing.o envir.o matchpt.o rowMedians.o sublist_extract.o -L/usr/lib/R/lib -lR installing to /home/omnipath/local/R/4.4-3.20/00LOCK-Biobase/00new/Biobase/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 (Biobase) * installing *source* package ‘RCurl’ ... ** package ‘RCurl’ successfully unpacked and MD5 sums checked ** using staged installation checking for curl-config... /usr/bin/curl-config checking for gcc... gcc checking whether the C compiler works... yes checking for C compiler default output file name... a.out checking for suffix of executables... checking whether we are cross compiling... no checking for suffix of object files... o checking whether the compiler supports GNU C... yes checking whether gcc accepts -g... yes checking for gcc option to enable C11 features... none needed checking how to run the C preprocessor... gcc -E Version has a libidn field Version has CURLOPT_URL Version has CURLINFO_EFFECTIVE_URL Version has CURLINFO_RESPONSE_CODE Version has CURLINFO_TOTAL_TIME Version has CURLINFO_NAMELOOKUP_TIME Version has CURLINFO_CONNECT_TIME Version has CURLINFO_PRETRANSFER_TIME Version has CURLINFO_SIZE_UPLOAD Version has CURLINFO_SIZE_DOWNLOAD Version has CURLINFO_SPEED_DOWNLOAD Version has CURLINFO_SPEED_UPLOAD Version has CURLINFO_HEADER_SIZE Version has CURLINFO_REQUEST_SIZE Version has CURLINFO_SSL_VERIFYRESULT Version has CURLINFO_FILETIME Version has CURLINFO_CONTENT_LENGTH_DOWNLOAD Version has CURLINFO_CONTENT_LENGTH_UPLOAD Version has CURLINFO_STARTTRANSFER_TIME Version has CURLINFO_CONTENT_TYPE Version has CURLINFO_REDIRECT_TIME Version has CURLINFO_REDIRECT_COUNT Version has CURLINFO_PRIVATE Version has CURLINFO_HTTP_CONNECTCODE Version has CURLINFO_HTTPAUTH_AVAIL Version has CURLINFO_PROXYAUTH_AVAIL Version has CURLINFO_OS_ERRNO Version has CURLINFO_NUM_CONNECTS Version has CURLINFO_SSL_ENGINES Version has CURLINFO_COOKIELIST Version has CURLINFO_LASTSOCKET Version has CURLINFO_FTP_ENTRY_PATH Version has CURLINFO_REDIRECT_URL Version has CURLINFO_PRIMARY_IP Version has CURLINFO_APPCONNECT_TIME Version has CURLINFO_CERTINFO Version has CURLINFO_CONDITION_UNMET Version has CURLOPT_WRITEDATA Version has CURLOPT_KEYPASSWD Version has CURLOPT_DIRLISTONLY Version has CURLOPT_APPEND Version has CURLOPT_KRBLEVEL Version has CURLOPT_USE_SSL Version has CURLOPT_TIMEOUT_MS Version has CURLOPT_CONNECTTIMEOUT_MS Version has CURLOPT_HTTP_TRANSFER_DECODING Version has CURLOPT_HTTP_CONTENT_DECODING Version has CURLOPT_NEW_FILE_PERMS Version has CURLOPT_NEW_DIRECTORY_PERMS Version has CURLOPT_POSTREDIR Version has CURLOPT_OPENSOCKETFUNCTION Version has CURLOPT_OPENSOCKETDATA Version has CURLOPT_COPYPOSTFIELDS Version has CURLOPT_PROXY_TRANSFER_MODE Version has CURLOPT_SEEKFUNCTION Version has CURLOPT_SEEKDATA Version has CURLOPT_CRLFILE Version has CURLOPT_ISSUERCERT Version has CURLOPT_ADDRESS_SCOPE Version has CURLOPT_CERTINFO Version has CURLOPT_USERNAME Version has CURLOPT_PASSWORD Version has CURLOPT_PROXYUSERNAME Version has CURLOPT_PROXYPASSWORD Version has CURLOPT_SSH_HOST_PUBLIC_KEY_MD5 Version has CURLOPT_NOPROXY Version has CURLOPT_TFTP_BLKSIZE Version has CURLOPT_SOCKS5_GSSAPI_SERVICE Version has CURLOPT_SOCKS5_GSSAPI_NEC Version has CURLOPT_PROTOCOLS Version has CURLOPT_REDIR_PROTOCOLS Version has CURLOPT_SSH_AUTH_TYPES Version has CURLOPT_SSH_PUBLIC_KEYFILE Version has CURLOPT_SSH_PRIVATE_KEYFILE Version has CURLOPT_FTP_SSL_CCC Version has CURLOPT_COOKIELIST Version has CURLOPT_IGNORE_CONTENT_LENGTH Version has CURLOPT_FTP_SKIP_PASV_IP Version has CURLOPT_FTP_FILEMETHOD Version has CURLOPT_LOCALPORT Version has CURLOPT_LOCALPORTRANGE Version has CURLOPT_CONNECT_ONLY Version has CURLOPT_CONV_FROM_NETWORK_FUNCTION Version has CURLOPT_CONV_TO_NETWORK_FUNCTION Version has CURLOPT_CONV_FROM_UTF8_FUNCTION Version has CURLOPT_MAX_SEND_SPEED_LARGE Version has CURLOPT_MAX_RECV_SPEED_LARGE Version has CURLOPT_FTP_ALTERNATIVE_TO_USER Version has CURLOPT_SOCKOPTFUNCTION Version has CURLOPT_SOCKOPTDATA Version has CURLOPT_SSL_SESSIONID_CACHE libcurl version: libcurl 8.5.0 configure: creating ./config.status config.status: creating src/Makevars ** libs using C compiler: ‘gcc (Ubuntu 13.2.0-23ubuntu4) 13.2.0’ gcc -I"/usr/share/R/include" -DNDEBUG -DCURL_DISABLE_DEPRECATION -DHAVE_LIBIDN_FIELD=1 -DHAVE_CURLOPT_URL=1 -DHAVE_CURLINFO_EFFECTIVE_URL=1 -DHAVE_CURLINFO_RESPONSE_CODE=1 -DHAVE_CURLINFO_TOTAL_TIME=1 -DHAVE_CURLINFO_NAMELOOKUP_TIME=1 -DHAVE_CURLINFO_CONNECT_TIME=1 -DHAVE_CURLINFO_PRETRANSFER_TIME=1 -DHAVE_CURLINFO_SIZE_UPLOAD=1 -DHAVE_CURLINFO_SIZE_DOWNLOAD=1 -DHAVE_CURLINFO_SPEED_DOWNLOAD=1 -DHAVE_CURLINFO_SPEED_UPLOAD=1 -DHAVE_CURLINFO_HEADER_SIZE=1 -DHAVE_CURLINFO_REQUEST_SIZE=1 -DHAVE_CURLINFO_SSL_VERIFYRESULT=1 -DHAVE_CURLINFO_FILETIME=1 -DHAVE_CURLINFO_CONTENT_LENGTH_DOWNLOAD=1 -DHAVE_CURLINFO_CONTENT_LENGTH_UPLOAD=1 -DHAVE_CURLINFO_STARTTRANSFER_TIME=1 -DHAVE_CURLINFO_CONTENT_TYPE=1 -DHAVE_CURLINFO_REDIRECT_TIME=1 -DHAVE_CURLINFO_REDIRECT_COUNT=1 -DHAVE_CURLINFO_PRIVATE=1 -DHAVE_CURLINFO_HTTP_CONNECTCODE=1 -DHAVE_CURLINFO_HTTPAUTH_AVAIL=1 -DHAVE_CURLINFO_PROXYAUTH_AVAIL=1 -DHAVE_CURLINFO_OS_ERRNO=1 -DHAVE_CURLINFO_NUM_CONNECTS=1 -DHAVE_CURLINFO_SSL_ENGINES=1 -DHAVE_CURLINFO_COOKIELIST=1 -DHAVE_CURLINFO_LASTSOCKET=1 -DHAVE_CURLINFO_FTP_ENTRY_PATH=1 -DHAVE_CURLINFO_REDIRECT_URL=1 -DHAVE_CURLINFO_PRIMARY_IP=1 -DHAVE_CURLINFO_APPCONNECT_TIME=1 -DHAVE_CURLINFO_CERTINFO=1 -DHAVE_CURLINFO_CONDITION_UNMET=1 -DHAVE_CURLOPT_WRITEDATA=1 -DHAVE_CURLOPT_KEYPASSWD=1 -DHAVE_CURLOPT_DIRLISTONLY=1 -DHAVE_CURLOPT_APPEND=1 -DHAVE_CURLOPT_KRBLEVEL=1 -DHAVE_CURLOPT_USE_SSL=1 -DHAVE_CURLOPT_TIMEOUT_MS=1 -DHAVE_CURLOPT_CONNECTTIMEOUT_MS=1 -DHAVE_CURLOPT_HTTP_TRANSFER_DECODING=1 -DHAVE_CURLOPT_HTTP_CONTENT_DECODING=1 -DHAVE_CURLOPT_NEW_FILE_PERMS=1 -DHAVE_CURLOPT_NEW_DIRECTORY_PERMS=1 -DHAVE_CURLOPT_POSTREDIR=1 -DHAVE_CURLOPT_OPENSOCKETFUNCTION=1 -DHAVE_CURLOPT_OPENSOCKETDATA=1 -DHAVE_CURLOPT_COPYPOSTFIELDS=1 -DHAVE_CURLOPT_PROXY_TRANSFER_MODE=1 -DHAVE_CURLOPT_SEEKFUNCTION=1 -DHAVE_CURLOPT_SEEKDATA=1 -DHAVE_CURLOPT_CRLFILE=1 -DHAVE_CURLOPT_ISSUERCERT=1 -DHAVE_CURLOPT_ADDRESS_SCOPE=1 -DHAVE_CURLOPT_CERTINFO=1 -DHAVE_CURLOPT_USERNAME=1 -DHAVE_CURLOPT_PASSWORD=1 -DHAVE_CURLOPT_PROXYUSERNAME=1 -DHAVE_CURLOPT_PROXYPASSWORD=1 -DHAVE_CURLOPT_SSH_HOST_PUBLIC_KEY_MD5=1 -DHAVE_CURLOPT_NOPROXY=1 -DHAVE_CURLOPT_TFTP_BLKSIZE=1 -DHAVE_CURLOPT_SOCKS5_GSSAPI_SERVICE=1 -DHAVE_CURLOPT_SOCKS5_GSSAPI_NEC=1 -DHAVE_CURLOPT_PROTOCOLS=1 -DHAVE_CURLOPT_REDIR_PROTOCOLS=1 -DHAVE_CURLOPT_SSH_AUTH_TYPES=1 -DHAVE_CURLOPT_SSH_PUBLIC_KEYFILE=1 -DHAVE_CURLOPT_SSH_PRIVATE_KEYFILE=1 -DHAVE_CURLOPT_FTP_SSL_CCC=1 -DHAVE_CURLOPT_COOKIELIST=1 -DHAVE_CURLOPT_IGNORE_CONTENT_LENGTH=1 -DHAVE_CURLOPT_FTP_SKIP_PASV_IP=1 -DHAVE_CURLOPT_FTP_FILEMETHOD=1 -DHAVE_CURLOPT_LOCALPORT=1 -DHAVE_CURLOPT_LOCALPORTRANGE=1 -DHAVE_CURLOPT_CONNECT_ONLY=1 -DHAVE_CURLOPT_CONV_FROM_NETWORK_FUNCTION=1 -DHAVE_CURLOPT_CONV_TO_NETWORK_FUNCTION=1 -DHAVE_CURLOPT_CONV_FROM_UTF8_FUNCTION=1 -DHAVE_CURLOPT_MAX_SEND_SPEED_LARGE=1 -DHAVE_CURLOPT_MAX_RECV_SPEED_LARGE=1 -DHAVE_CURLOPT_FTP_ALTERNATIVE_TO_USER=1 -DHAVE_CURLOPT_SOCKOPTFUNCTION=1 -DHAVE_CURLOPT_SOCKOPTDATA=1 -DHAVE_CURLOPT_SSL_SESSIONID_CACHE=1 -I/usr/include/libxml2 -fpic -g -O2 -fno-omit-frame-pointer -mno-omit-leaf-frame-pointer -ffile-prefix-map=/build/r-base-EawLoD/r-base-4.4.1=. -fstack-protector-strong -fstack-clash-protection -Wformat -Werror=format-security -fcf-protection -fdebug-prefix-map=/build/r-base-EawLoD/r-base-4.4.1=/usr/src/r-base-4.4.1-1.2404.0 -Wdate-time -D_FORTIFY_SOURCE=3 -c base64.c -o base64.o gcc -I"/usr/share/R/include" -DNDEBUG -DCURL_DISABLE_DEPRECATION -DHAVE_LIBIDN_FIELD=1 -DHAVE_CURLOPT_URL=1 -DHAVE_CURLINFO_EFFECTIVE_URL=1 -DHAVE_CURLINFO_RESPONSE_CODE=1 -DHAVE_CURLINFO_TOTAL_TIME=1 -DHAVE_CURLINFO_NAMELOOKUP_TIME=1 -DHAVE_CURLINFO_CONNECT_TIME=1 -DHAVE_CURLINFO_PRETRANSFER_TIME=1 -DHAVE_CURLINFO_SIZE_UPLOAD=1 -DHAVE_CURLINFO_SIZE_DOWNLOAD=1 -DHAVE_CURLINFO_SPEED_DOWNLOAD=1 -DHAVE_CURLINFO_SPEED_UPLOAD=1 -DHAVE_CURLINFO_HEADER_SIZE=1 -DHAVE_CURLINFO_REQUEST_SIZE=1 -DHAVE_CURLINFO_SSL_VERIFYRESULT=1 -DHAVE_CURLINFO_FILETIME=1 -DHAVE_CURLINFO_CONTENT_LENGTH_DOWNLOAD=1 -DHAVE_CURLINFO_CONTENT_LENGTH_UPLOAD=1 -DHAVE_CURLINFO_STARTTRANSFER_TIME=1 -DHAVE_CURLINFO_CONTENT_TYPE=1 -DHAVE_CURLINFO_REDIRECT_TIME=1 -DHAVE_CURLINFO_REDIRECT_COUNT=1 -DHAVE_CURLINFO_PRIVATE=1 -DHAVE_CURLINFO_HTTP_CONNECTCODE=1 -DHAVE_CURLINFO_HTTPAUTH_AVAIL=1 -DHAVE_CURLINFO_PROXYAUTH_AVAIL=1 -DHAVE_CURLINFO_OS_ERRNO=1 -DHAVE_CURLINFO_NUM_CONNECTS=1 -DHAVE_CURLINFO_SSL_ENGINES=1 -DHAVE_CURLINFO_COOKIELIST=1 -DHAVE_CURLINFO_LASTSOCKET=1 -DHAVE_CURLINFO_FTP_ENTRY_PATH=1 -DHAVE_CURLINFO_REDIRECT_URL=1 -DHAVE_CURLINFO_PRIMARY_IP=1 -DHAVE_CURLINFO_APPCONNECT_TIME=1 -DHAVE_CURLINFO_CERTINFO=1 -DHAVE_CURLINFO_CONDITION_UNMET=1 -DHAVE_CURLOPT_WRITEDATA=1 -DHAVE_CURLOPT_KEYPASSWD=1 -DHAVE_CURLOPT_DIRLISTONLY=1 -DHAVE_CURLOPT_APPEND=1 -DHAVE_CURLOPT_KRBLEVEL=1 -DHAVE_CURLOPT_USE_SSL=1 -DHAVE_CURLOPT_TIMEOUT_MS=1 -DHAVE_CURLOPT_CONNECTTIMEOUT_MS=1 -DHAVE_CURLOPT_HTTP_TRANSFER_DECODING=1 -DHAVE_CURLOPT_HTTP_CONTENT_DECODING=1 -DHAVE_CURLOPT_NEW_FILE_PERMS=1 -DHAVE_CURLOPT_NEW_DIRECTORY_PERMS=1 -DHAVE_CURLOPT_POSTREDIR=1 -DHAVE_CURLOPT_OPENSOCKETFUNCTION=1 -DHAVE_CURLOPT_OPENSOCKETDATA=1 -DHAVE_CURLOPT_COPYPOSTFIELDS=1 -DHAVE_CURLOPT_PROXY_TRANSFER_MODE=1 -DHAVE_CURLOPT_SEEKFUNCTION=1 -DHAVE_CURLOPT_SEEKDATA=1 -DHAVE_CURLOPT_CRLFILE=1 -DHAVE_CURLOPT_ISSUERCERT=1 -DHAVE_CURLOPT_ADDRESS_SCOPE=1 -DHAVE_CURLOPT_CERTINFO=1 -DHAVE_CURLOPT_USERNAME=1 -DHAVE_CURLOPT_PASSWORD=1 -DHAVE_CURLOPT_PROXYUSERNAME=1 -DHAVE_CURLOPT_PROXYPASSWORD=1 -DHAVE_CURLOPT_SSH_HOST_PUBLIC_KEY_MD5=1 -DHAVE_CURLOPT_NOPROXY=1 -DHAVE_CURLOPT_TFTP_BLKSIZE=1 -DHAVE_CURLOPT_SOCKS5_GSSAPI_SERVICE=1 -DHAVE_CURLOPT_SOCKS5_GSSAPI_NEC=1 -DHAVE_CURLOPT_PROTOCOLS=1 -DHAVE_CURLOPT_REDIR_PROTOCOLS=1 -DHAVE_CURLOPT_SSH_AUTH_TYPES=1 -DHAVE_CURLOPT_SSH_PUBLIC_KEYFILE=1 -DHAVE_CURLOPT_SSH_PRIVATE_KEYFILE=1 -DHAVE_CURLOPT_FTP_SSL_CCC=1 -DHAVE_CURLOPT_COOKIELIST=1 -DHAVE_CURLOPT_IGNORE_CONTENT_LENGTH=1 -DHAVE_CURLOPT_FTP_SKIP_PASV_IP=1 -DHAVE_CURLOPT_FTP_FILEMETHOD=1 -DHAVE_CURLOPT_LOCALPORT=1 -DHAVE_CURLOPT_LOCALPORTRANGE=1 -DHAVE_CURLOPT_CONNECT_ONLY=1 -DHAVE_CURLOPT_CONV_FROM_NETWORK_FUNCTION=1 -DHAVE_CURLOPT_CONV_TO_NETWORK_FUNCTION=1 -DHAVE_CURLOPT_CONV_FROM_UTF8_FUNCTION=1 -DHAVE_CURLOPT_MAX_SEND_SPEED_LARGE=1 -DHAVE_CURLOPT_MAX_RECV_SPEED_LARGE=1 -DHAVE_CURLOPT_FTP_ALTERNATIVE_TO_USER=1 -DHAVE_CURLOPT_SOCKOPTFUNCTION=1 -DHAVE_CURLOPT_SOCKOPTDATA=1 -DHAVE_CURLOPT_SSL_SESSIONID_CACHE=1 -I/usr/include/libxml2 -fpic -g -O2 -fno-omit-frame-pointer -mno-omit-leaf-frame-pointer -ffile-prefix-map=/build/r-base-EawLoD/r-base-4.4.1=. -fstack-protector-strong -fstack-clash-protection -Wformat -Werror=format-security -fcf-protection -fdebug-prefix-map=/build/r-base-EawLoD/r-base-4.4.1=/usr/src/r-base-4.4.1-1.2404.0 -Wdate-time -D_FORTIFY_SOURCE=3 -c curl.c -o curl.o gcc -I"/usr/share/R/include" -DNDEBUG -DCURL_DISABLE_DEPRECATION -DHAVE_LIBIDN_FIELD=1 -DHAVE_CURLOPT_URL=1 -DHAVE_CURLINFO_EFFECTIVE_URL=1 -DHAVE_CURLINFO_RESPONSE_CODE=1 -DHAVE_CURLINFO_TOTAL_TIME=1 -DHAVE_CURLINFO_NAMELOOKUP_TIME=1 -DHAVE_CURLINFO_CONNECT_TIME=1 -DHAVE_CURLINFO_PRETRANSFER_TIME=1 -DHAVE_CURLINFO_SIZE_UPLOAD=1 -DHAVE_CURLINFO_SIZE_DOWNLOAD=1 -DHAVE_CURLINFO_SPEED_DOWNLOAD=1 -DHAVE_CURLINFO_SPEED_UPLOAD=1 -DHAVE_CURLINFO_HEADER_SIZE=1 -DHAVE_CURLINFO_REQUEST_SIZE=1 -DHAVE_CURLINFO_SSL_VERIFYRESULT=1 -DHAVE_CURLINFO_FILETIME=1 -DHAVE_CURLINFO_CONTENT_LENGTH_DOWNLOAD=1 -DHAVE_CURLINFO_CONTENT_LENGTH_UPLOAD=1 -DHAVE_CURLINFO_STARTTRANSFER_TIME=1 -DHAVE_CURLINFO_CONTENT_TYPE=1 -DHAVE_CURLINFO_REDIRECT_TIME=1 -DHAVE_CURLINFO_REDIRECT_COUNT=1 -DHAVE_CURLINFO_PRIVATE=1 -DHAVE_CURLINFO_HTTP_CONNECTCODE=1 -DHAVE_CURLINFO_HTTPAUTH_AVAIL=1 -DHAVE_CURLINFO_PROXYAUTH_AVAIL=1 -DHAVE_CURLINFO_OS_ERRNO=1 -DHAVE_CURLINFO_NUM_CONNECTS=1 -DHAVE_CURLINFO_SSL_ENGINES=1 -DHAVE_CURLINFO_COOKIELIST=1 -DHAVE_CURLINFO_LASTSOCKET=1 -DHAVE_CURLINFO_FTP_ENTRY_PATH=1 -DHAVE_CURLINFO_REDIRECT_URL=1 -DHAVE_CURLINFO_PRIMARY_IP=1 -DHAVE_CURLINFO_APPCONNECT_TIME=1 -DHAVE_CURLINFO_CERTINFO=1 -DHAVE_CURLINFO_CONDITION_UNMET=1 -DHAVE_CURLOPT_WRITEDATA=1 -DHAVE_CURLOPT_KEYPASSWD=1 -DHAVE_CURLOPT_DIRLISTONLY=1 -DHAVE_CURLOPT_APPEND=1 -DHAVE_CURLOPT_KRBLEVEL=1 -DHAVE_CURLOPT_USE_SSL=1 -DHAVE_CURLOPT_TIMEOUT_MS=1 -DHAVE_CURLOPT_CONNECTTIMEOUT_MS=1 -DHAVE_CURLOPT_HTTP_TRANSFER_DECODING=1 -DHAVE_CURLOPT_HTTP_CONTENT_DECODING=1 -DHAVE_CURLOPT_NEW_FILE_PERMS=1 -DHAVE_CURLOPT_NEW_DIRECTORY_PERMS=1 -DHAVE_CURLOPT_POSTREDIR=1 -DHAVE_CURLOPT_OPENSOCKETFUNCTION=1 -DHAVE_CURLOPT_OPENSOCKETDATA=1 -DHAVE_CURLOPT_COPYPOSTFIELDS=1 -DHAVE_CURLOPT_PROXY_TRANSFER_MODE=1 -DHAVE_CURLOPT_SEEKFUNCTION=1 -DHAVE_CURLOPT_SEEKDATA=1 -DHAVE_CURLOPT_CRLFILE=1 -DHAVE_CURLOPT_ISSUERCERT=1 -DHAVE_CURLOPT_ADDRESS_SCOPE=1 -DHAVE_CURLOPT_CERTINFO=1 -DHAVE_CURLOPT_USERNAME=1 -DHAVE_CURLOPT_PASSWORD=1 -DHAVE_CURLOPT_PROXYUSERNAME=1 -DHAVE_CURLOPT_PROXYPASSWORD=1 -DHAVE_CURLOPT_SSH_HOST_PUBLIC_KEY_MD5=1 -DHAVE_CURLOPT_NOPROXY=1 -DHAVE_CURLOPT_TFTP_BLKSIZE=1 -DHAVE_CURLOPT_SOCKS5_GSSAPI_SERVICE=1 -DHAVE_CURLOPT_SOCKS5_GSSAPI_NEC=1 -DHAVE_CURLOPT_PROTOCOLS=1 -DHAVE_CURLOPT_REDIR_PROTOCOLS=1 -DHAVE_CURLOPT_SSH_AUTH_TYPES=1 -DHAVE_CURLOPT_SSH_PUBLIC_KEYFILE=1 -DHAVE_CURLOPT_SSH_PRIVATE_KEYFILE=1 -DHAVE_CURLOPT_FTP_SSL_CCC=1 -DHAVE_CURLOPT_COOKIELIST=1 -DHAVE_CURLOPT_IGNORE_CONTENT_LENGTH=1 -DHAVE_CURLOPT_FTP_SKIP_PASV_IP=1 -DHAVE_CURLOPT_FTP_FILEMETHOD=1 -DHAVE_CURLOPT_LOCALPORT=1 -DHAVE_CURLOPT_LOCALPORTRANGE=1 -DHAVE_CURLOPT_CONNECT_ONLY=1 -DHAVE_CURLOPT_CONV_FROM_NETWORK_FUNCTION=1 -DHAVE_CURLOPT_CONV_TO_NETWORK_FUNCTION=1 -DHAVE_CURLOPT_CONV_FROM_UTF8_FUNCTION=1 -DHAVE_CURLOPT_MAX_SEND_SPEED_LARGE=1 -DHAVE_CURLOPT_MAX_RECV_SPEED_LARGE=1 -DHAVE_CURLOPT_FTP_ALTERNATIVE_TO_USER=1 -DHAVE_CURLOPT_SOCKOPTFUNCTION=1 -DHAVE_CURLOPT_SOCKOPTDATA=1 -DHAVE_CURLOPT_SSL_SESSIONID_CACHE=1 -I/usr/include/libxml2 -fpic -g -O2 -fno-omit-frame-pointer -mno-omit-leaf-frame-pointer -ffile-prefix-map=/build/r-base-EawLoD/r-base-4.4.1=. -fstack-protector-strong -fstack-clash-protection -Wformat -Werror=format-security -fcf-protection -fdebug-prefix-map=/build/r-base-EawLoD/r-base-4.4.1=/usr/src/r-base-4.4.1-1.2404.0 -Wdate-time -D_FORTIFY_SOURCE=3 -c curlInit.c -o curlInit.o gcc -I"/usr/share/R/include" -DNDEBUG -DCURL_DISABLE_DEPRECATION -DHAVE_LIBIDN_FIELD=1 -DHAVE_CURLOPT_URL=1 -DHAVE_CURLINFO_EFFECTIVE_URL=1 -DHAVE_CURLINFO_RESPONSE_CODE=1 -DHAVE_CURLINFO_TOTAL_TIME=1 -DHAVE_CURLINFO_NAMELOOKUP_TIME=1 -DHAVE_CURLINFO_CONNECT_TIME=1 -DHAVE_CURLINFO_PRETRANSFER_TIME=1 -DHAVE_CURLINFO_SIZE_UPLOAD=1 -DHAVE_CURLINFO_SIZE_DOWNLOAD=1 -DHAVE_CURLINFO_SPEED_DOWNLOAD=1 -DHAVE_CURLINFO_SPEED_UPLOAD=1 -DHAVE_CURLINFO_HEADER_SIZE=1 -DHAVE_CURLINFO_REQUEST_SIZE=1 -DHAVE_CURLINFO_SSL_VERIFYRESULT=1 -DHAVE_CURLINFO_FILETIME=1 -DHAVE_CURLINFO_CONTENT_LENGTH_DOWNLOAD=1 -DHAVE_CURLINFO_CONTENT_LENGTH_UPLOAD=1 -DHAVE_CURLINFO_STARTTRANSFER_TIME=1 -DHAVE_CURLINFO_CONTENT_TYPE=1 -DHAVE_CURLINFO_REDIRECT_TIME=1 -DHAVE_CURLINFO_REDIRECT_COUNT=1 -DHAVE_CURLINFO_PRIVATE=1 -DHAVE_CURLINFO_HTTP_CONNECTCODE=1 -DHAVE_CURLINFO_HTTPAUTH_AVAIL=1 -DHAVE_CURLINFO_PROXYAUTH_AVAIL=1 -DHAVE_CURLINFO_OS_ERRNO=1 -DHAVE_CURLINFO_NUM_CONNECTS=1 -DHAVE_CURLINFO_SSL_ENGINES=1 -DHAVE_CURLINFO_COOKIELIST=1 -DHAVE_CURLINFO_LASTSOCKET=1 -DHAVE_CURLINFO_FTP_ENTRY_PATH=1 -DHAVE_CURLINFO_REDIRECT_URL=1 -DHAVE_CURLINFO_PRIMARY_IP=1 -DHAVE_CURLINFO_APPCONNECT_TIME=1 -DHAVE_CURLINFO_CERTINFO=1 -DHAVE_CURLINFO_CONDITION_UNMET=1 -DHAVE_CURLOPT_WRITEDATA=1 -DHAVE_CURLOPT_KEYPASSWD=1 -DHAVE_CURLOPT_DIRLISTONLY=1 -DHAVE_CURLOPT_APPEND=1 -DHAVE_CURLOPT_KRBLEVEL=1 -DHAVE_CURLOPT_USE_SSL=1 -DHAVE_CURLOPT_TIMEOUT_MS=1 -DHAVE_CURLOPT_CONNECTTIMEOUT_MS=1 -DHAVE_CURLOPT_HTTP_TRANSFER_DECODING=1 -DHAVE_CURLOPT_HTTP_CONTENT_DECODING=1 -DHAVE_CURLOPT_NEW_FILE_PERMS=1 -DHAVE_CURLOPT_NEW_DIRECTORY_PERMS=1 -DHAVE_CURLOPT_POSTREDIR=1 -DHAVE_CURLOPT_OPENSOCKETFUNCTION=1 -DHAVE_CURLOPT_OPENSOCKETDATA=1 -DHAVE_CURLOPT_COPYPOSTFIELDS=1 -DHAVE_CURLOPT_PROXY_TRANSFER_MODE=1 -DHAVE_CURLOPT_SEEKFUNCTION=1 -DHAVE_CURLOPT_SEEKDATA=1 -DHAVE_CURLOPT_CRLFILE=1 -DHAVE_CURLOPT_ISSUERCERT=1 -DHAVE_CURLOPT_ADDRESS_SCOPE=1 -DHAVE_CURLOPT_CERTINFO=1 -DHAVE_CURLOPT_USERNAME=1 -DHAVE_CURLOPT_PASSWORD=1 -DHAVE_CURLOPT_PROXYUSERNAME=1 -DHAVE_CURLOPT_PROXYPASSWORD=1 -DHAVE_CURLOPT_SSH_HOST_PUBLIC_KEY_MD5=1 -DHAVE_CURLOPT_NOPROXY=1 -DHAVE_CURLOPT_TFTP_BLKSIZE=1 -DHAVE_CURLOPT_SOCKS5_GSSAPI_SERVICE=1 -DHAVE_CURLOPT_SOCKS5_GSSAPI_NEC=1 -DHAVE_CURLOPT_PROTOCOLS=1 -DHAVE_CURLOPT_REDIR_PROTOCOLS=1 -DHAVE_CURLOPT_SSH_AUTH_TYPES=1 -DHAVE_CURLOPT_SSH_PUBLIC_KEYFILE=1 -DHAVE_CURLOPT_SSH_PRIVATE_KEYFILE=1 -DHAVE_CURLOPT_FTP_SSL_CCC=1 -DHAVE_CURLOPT_COOKIELIST=1 -DHAVE_CURLOPT_IGNORE_CONTENT_LENGTH=1 -DHAVE_CURLOPT_FTP_SKIP_PASV_IP=1 -DHAVE_CURLOPT_FTP_FILEMETHOD=1 -DHAVE_CURLOPT_LOCALPORT=1 -DHAVE_CURLOPT_LOCALPORTRANGE=1 -DHAVE_CURLOPT_CONNECT_ONLY=1 -DHAVE_CURLOPT_CONV_FROM_NETWORK_FUNCTION=1 -DHAVE_CURLOPT_CONV_TO_NETWORK_FUNCTION=1 -DHAVE_CURLOPT_CONV_FROM_UTF8_FUNCTION=1 -DHAVE_CURLOPT_MAX_SEND_SPEED_LARGE=1 -DHAVE_CURLOPT_MAX_RECV_SPEED_LARGE=1 -DHAVE_CURLOPT_FTP_ALTERNATIVE_TO_USER=1 -DHAVE_CURLOPT_SOCKOPTFUNCTION=1 -DHAVE_CURLOPT_SOCKOPTDATA=1 -DHAVE_CURLOPT_SSL_SESSIONID_CACHE=1 -I/usr/include/libxml2 -fpic -g -O2 -fno-omit-frame-pointer -mno-omit-leaf-frame-pointer -ffile-prefix-map=/build/r-base-EawLoD/r-base-4.4.1=. -fstack-protector-strong -fstack-clash-protection -Wformat -Werror=format-security -fcf-protection -fdebug-prefix-map=/build/r-base-EawLoD/r-base-4.4.1=/usr/src/r-base-4.4.1-1.2404.0 -Wdate-time -D_FORTIFY_SOURCE=3 -c curl_base64.c -o curl_base64.o gcc -I"/usr/share/R/include" -DNDEBUG -DCURL_DISABLE_DEPRECATION -DHAVE_LIBIDN_FIELD=1 -DHAVE_CURLOPT_URL=1 -DHAVE_CURLINFO_EFFECTIVE_URL=1 -DHAVE_CURLINFO_RESPONSE_CODE=1 -DHAVE_CURLINFO_TOTAL_TIME=1 -DHAVE_CURLINFO_NAMELOOKUP_TIME=1 -DHAVE_CURLINFO_CONNECT_TIME=1 -DHAVE_CURLINFO_PRETRANSFER_TIME=1 -DHAVE_CURLINFO_SIZE_UPLOAD=1 -DHAVE_CURLINFO_SIZE_DOWNLOAD=1 -DHAVE_CURLINFO_SPEED_DOWNLOAD=1 -DHAVE_CURLINFO_SPEED_UPLOAD=1 -DHAVE_CURLINFO_HEADER_SIZE=1 -DHAVE_CURLINFO_REQUEST_SIZE=1 -DHAVE_CURLINFO_SSL_VERIFYRESULT=1 -DHAVE_CURLINFO_FILETIME=1 -DHAVE_CURLINFO_CONTENT_LENGTH_DOWNLOAD=1 -DHAVE_CURLINFO_CONTENT_LENGTH_UPLOAD=1 -DHAVE_CURLINFO_STARTTRANSFER_TIME=1 -DHAVE_CURLINFO_CONTENT_TYPE=1 -DHAVE_CURLINFO_REDIRECT_TIME=1 -DHAVE_CURLINFO_REDIRECT_COUNT=1 -DHAVE_CURLINFO_PRIVATE=1 -DHAVE_CURLINFO_HTTP_CONNECTCODE=1 -DHAVE_CURLINFO_HTTPAUTH_AVAIL=1 -DHAVE_CURLINFO_PROXYAUTH_AVAIL=1 -DHAVE_CURLINFO_OS_ERRNO=1 -DHAVE_CURLINFO_NUM_CONNECTS=1 -DHAVE_CURLINFO_SSL_ENGINES=1 -DHAVE_CURLINFO_COOKIELIST=1 -DHAVE_CURLINFO_LASTSOCKET=1 -DHAVE_CURLINFO_FTP_ENTRY_PATH=1 -DHAVE_CURLINFO_REDIRECT_URL=1 -DHAVE_CURLINFO_PRIMARY_IP=1 -DHAVE_CURLINFO_APPCONNECT_TIME=1 -DHAVE_CURLINFO_CERTINFO=1 -DHAVE_CURLINFO_CONDITION_UNMET=1 -DHAVE_CURLOPT_WRITEDATA=1 -DHAVE_CURLOPT_KEYPASSWD=1 -DHAVE_CURLOPT_DIRLISTONLY=1 -DHAVE_CURLOPT_APPEND=1 -DHAVE_CURLOPT_KRBLEVEL=1 -DHAVE_CURLOPT_USE_SSL=1 -DHAVE_CURLOPT_TIMEOUT_MS=1 -DHAVE_CURLOPT_CONNECTTIMEOUT_MS=1 -DHAVE_CURLOPT_HTTP_TRANSFER_DECODING=1 -DHAVE_CURLOPT_HTTP_CONTENT_DECODING=1 -DHAVE_CURLOPT_NEW_FILE_PERMS=1 -DHAVE_CURLOPT_NEW_DIRECTORY_PERMS=1 -DHAVE_CURLOPT_POSTREDIR=1 -DHAVE_CURLOPT_OPENSOCKETFUNCTION=1 -DHAVE_CURLOPT_OPENSOCKETDATA=1 -DHAVE_CURLOPT_COPYPOSTFIELDS=1 -DHAVE_CURLOPT_PROXY_TRANSFER_MODE=1 -DHAVE_CURLOPT_SEEKFUNCTION=1 -DHAVE_CURLOPT_SEEKDATA=1 -DHAVE_CURLOPT_CRLFILE=1 -DHAVE_CURLOPT_ISSUERCERT=1 -DHAVE_CURLOPT_ADDRESS_SCOPE=1 -DHAVE_CURLOPT_CERTINFO=1 -DHAVE_CURLOPT_USERNAME=1 -DHAVE_CURLOPT_PASSWORD=1 -DHAVE_CURLOPT_PROXYUSERNAME=1 -DHAVE_CURLOPT_PROXYPASSWORD=1 -DHAVE_CURLOPT_SSH_HOST_PUBLIC_KEY_MD5=1 -DHAVE_CURLOPT_NOPROXY=1 -DHAVE_CURLOPT_TFTP_BLKSIZE=1 -DHAVE_CURLOPT_SOCKS5_GSSAPI_SERVICE=1 -DHAVE_CURLOPT_SOCKS5_GSSAPI_NEC=1 -DHAVE_CURLOPT_PROTOCOLS=1 -DHAVE_CURLOPT_REDIR_PROTOCOLS=1 -DHAVE_CURLOPT_SSH_AUTH_TYPES=1 -DHAVE_CURLOPT_SSH_PUBLIC_KEYFILE=1 -DHAVE_CURLOPT_SSH_PRIVATE_KEYFILE=1 -DHAVE_CURLOPT_FTP_SSL_CCC=1 -DHAVE_CURLOPT_COOKIELIST=1 -DHAVE_CURLOPT_IGNORE_CONTENT_LENGTH=1 -DHAVE_CURLOPT_FTP_SKIP_PASV_IP=1 -DHAVE_CURLOPT_FTP_FILEMETHOD=1 -DHAVE_CURLOPT_LOCALPORT=1 -DHAVE_CURLOPT_LOCALPORTRANGE=1 -DHAVE_CURLOPT_CONNECT_ONLY=1 -DHAVE_CURLOPT_CONV_FROM_NETWORK_FUNCTION=1 -DHAVE_CURLOPT_CONV_TO_NETWORK_FUNCTION=1 -DHAVE_CURLOPT_CONV_FROM_UTF8_FUNCTION=1 -DHAVE_CURLOPT_MAX_SEND_SPEED_LARGE=1 -DHAVE_CURLOPT_MAX_RECV_SPEED_LARGE=1 -DHAVE_CURLOPT_FTP_ALTERNATIVE_TO_USER=1 -DHAVE_CURLOPT_SOCKOPTFUNCTION=1 -DHAVE_CURLOPT_SOCKOPTDATA=1 -DHAVE_CURLOPT_SSL_SESSIONID_CACHE=1 -I/usr/include/libxml2 -fpic -g -O2 -fno-omit-frame-pointer -mno-omit-leaf-frame-pointer -ffile-prefix-map=/build/r-base-EawLoD/r-base-4.4.1=. -fstack-protector-strong -fstack-clash-protection -Wformat -Werror=format-security -fcf-protection -fdebug-prefix-map=/build/r-base-EawLoD/r-base-4.4.1=/usr/src/r-base-4.4.1-1.2404.0 -Wdate-time -D_FORTIFY_SOURCE=3 -c enums.c -o enums.o gcc -I"/usr/share/R/include" -DNDEBUG -DCURL_DISABLE_DEPRECATION -DHAVE_LIBIDN_FIELD=1 -DHAVE_CURLOPT_URL=1 -DHAVE_CURLINFO_EFFECTIVE_URL=1 -DHAVE_CURLINFO_RESPONSE_CODE=1 -DHAVE_CURLINFO_TOTAL_TIME=1 -DHAVE_CURLINFO_NAMELOOKUP_TIME=1 -DHAVE_CURLINFO_CONNECT_TIME=1 -DHAVE_CURLINFO_PRETRANSFER_TIME=1 -DHAVE_CURLINFO_SIZE_UPLOAD=1 -DHAVE_CURLINFO_SIZE_DOWNLOAD=1 -DHAVE_CURLINFO_SPEED_DOWNLOAD=1 -DHAVE_CURLINFO_SPEED_UPLOAD=1 -DHAVE_CURLINFO_HEADER_SIZE=1 -DHAVE_CURLINFO_REQUEST_SIZE=1 -DHAVE_CURLINFO_SSL_VERIFYRESULT=1 -DHAVE_CURLINFO_FILETIME=1 -DHAVE_CURLINFO_CONTENT_LENGTH_DOWNLOAD=1 -DHAVE_CURLINFO_CONTENT_LENGTH_UPLOAD=1 -DHAVE_CURLINFO_STARTTRANSFER_TIME=1 -DHAVE_CURLINFO_CONTENT_TYPE=1 -DHAVE_CURLINFO_REDIRECT_TIME=1 -DHAVE_CURLINFO_REDIRECT_COUNT=1 -DHAVE_CURLINFO_PRIVATE=1 -DHAVE_CURLINFO_HTTP_CONNECTCODE=1 -DHAVE_CURLINFO_HTTPAUTH_AVAIL=1 -DHAVE_CURLINFO_PROXYAUTH_AVAIL=1 -DHAVE_CURLINFO_OS_ERRNO=1 -DHAVE_CURLINFO_NUM_CONNECTS=1 -DHAVE_CURLINFO_SSL_ENGINES=1 -DHAVE_CURLINFO_COOKIELIST=1 -DHAVE_CURLINFO_LASTSOCKET=1 -DHAVE_CURLINFO_FTP_ENTRY_PATH=1 -DHAVE_CURLINFO_REDIRECT_URL=1 -DHAVE_CURLINFO_PRIMARY_IP=1 -DHAVE_CURLINFO_APPCONNECT_TIME=1 -DHAVE_CURLINFO_CERTINFO=1 -DHAVE_CURLINFO_CONDITION_UNMET=1 -DHAVE_CURLOPT_WRITEDATA=1 -DHAVE_CURLOPT_KEYPASSWD=1 -DHAVE_CURLOPT_DIRLISTONLY=1 -DHAVE_CURLOPT_APPEND=1 -DHAVE_CURLOPT_KRBLEVEL=1 -DHAVE_CURLOPT_USE_SSL=1 -DHAVE_CURLOPT_TIMEOUT_MS=1 -DHAVE_CURLOPT_CONNECTTIMEOUT_MS=1 -DHAVE_CURLOPT_HTTP_TRANSFER_DECODING=1 -DHAVE_CURLOPT_HTTP_CONTENT_DECODING=1 -DHAVE_CURLOPT_NEW_FILE_PERMS=1 -DHAVE_CURLOPT_NEW_DIRECTORY_PERMS=1 -DHAVE_CURLOPT_POSTREDIR=1 -DHAVE_CURLOPT_OPENSOCKETFUNCTION=1 -DHAVE_CURLOPT_OPENSOCKETDATA=1 -DHAVE_CURLOPT_COPYPOSTFIELDS=1 -DHAVE_CURLOPT_PROXY_TRANSFER_MODE=1 -DHAVE_CURLOPT_SEEKFUNCTION=1 -DHAVE_CURLOPT_SEEKDATA=1 -DHAVE_CURLOPT_CRLFILE=1 -DHAVE_CURLOPT_ISSUERCERT=1 -DHAVE_CURLOPT_ADDRESS_SCOPE=1 -DHAVE_CURLOPT_CERTINFO=1 -DHAVE_CURLOPT_USERNAME=1 -DHAVE_CURLOPT_PASSWORD=1 -DHAVE_CURLOPT_PROXYUSERNAME=1 -DHAVE_CURLOPT_PROXYPASSWORD=1 -DHAVE_CURLOPT_SSH_HOST_PUBLIC_KEY_MD5=1 -DHAVE_CURLOPT_NOPROXY=1 -DHAVE_CURLOPT_TFTP_BLKSIZE=1 -DHAVE_CURLOPT_SOCKS5_GSSAPI_SERVICE=1 -DHAVE_CURLOPT_SOCKS5_GSSAPI_NEC=1 -DHAVE_CURLOPT_PROTOCOLS=1 -DHAVE_CURLOPT_REDIR_PROTOCOLS=1 -DHAVE_CURLOPT_SSH_AUTH_TYPES=1 -DHAVE_CURLOPT_SSH_PUBLIC_KEYFILE=1 -DHAVE_CURLOPT_SSH_PRIVATE_KEYFILE=1 -DHAVE_CURLOPT_FTP_SSL_CCC=1 -DHAVE_CURLOPT_COOKIELIST=1 -DHAVE_CURLOPT_IGNORE_CONTENT_LENGTH=1 -DHAVE_CURLOPT_FTP_SKIP_PASV_IP=1 -DHAVE_CURLOPT_FTP_FILEMETHOD=1 -DHAVE_CURLOPT_LOCALPORT=1 -DHAVE_CURLOPT_LOCALPORTRANGE=1 -DHAVE_CURLOPT_CONNECT_ONLY=1 -DHAVE_CURLOPT_CONV_FROM_NETWORK_FUNCTION=1 -DHAVE_CURLOPT_CONV_TO_NETWORK_FUNCTION=1 -DHAVE_CURLOPT_CONV_FROM_UTF8_FUNCTION=1 -DHAVE_CURLOPT_MAX_SEND_SPEED_LARGE=1 -DHAVE_CURLOPT_MAX_RECV_SPEED_LARGE=1 -DHAVE_CURLOPT_FTP_ALTERNATIVE_TO_USER=1 -DHAVE_CURLOPT_SOCKOPTFUNCTION=1 -DHAVE_CURLOPT_SOCKOPTDATA=1 -DHAVE_CURLOPT_SSL_SESSIONID_CACHE=1 -I/usr/include/libxml2 -fpic -g -O2 -fno-omit-frame-pointer -mno-omit-leaf-frame-pointer -ffile-prefix-map=/build/r-base-EawLoD/r-base-4.4.1=. -fstack-protector-strong -fstack-clash-protection -Wformat -Werror=format-security -fcf-protection -fdebug-prefix-map=/build/r-base-EawLoD/r-base-4.4.1=/usr/src/r-base-4.4.1-1.2404.0 -Wdate-time -D_FORTIFY_SOURCE=3 -c json.c -o json.o gcc -I"/usr/share/R/include" -DNDEBUG -DCURL_DISABLE_DEPRECATION -DHAVE_LIBIDN_FIELD=1 -DHAVE_CURLOPT_URL=1 -DHAVE_CURLINFO_EFFECTIVE_URL=1 -DHAVE_CURLINFO_RESPONSE_CODE=1 -DHAVE_CURLINFO_TOTAL_TIME=1 -DHAVE_CURLINFO_NAMELOOKUP_TIME=1 -DHAVE_CURLINFO_CONNECT_TIME=1 -DHAVE_CURLINFO_PRETRANSFER_TIME=1 -DHAVE_CURLINFO_SIZE_UPLOAD=1 -DHAVE_CURLINFO_SIZE_DOWNLOAD=1 -DHAVE_CURLINFO_SPEED_DOWNLOAD=1 -DHAVE_CURLINFO_SPEED_UPLOAD=1 -DHAVE_CURLINFO_HEADER_SIZE=1 -DHAVE_CURLINFO_REQUEST_SIZE=1 -DHAVE_CURLINFO_SSL_VERIFYRESULT=1 -DHAVE_CURLINFO_FILETIME=1 -DHAVE_CURLINFO_CONTENT_LENGTH_DOWNLOAD=1 -DHAVE_CURLINFO_CONTENT_LENGTH_UPLOAD=1 -DHAVE_CURLINFO_STARTTRANSFER_TIME=1 -DHAVE_CURLINFO_CONTENT_TYPE=1 -DHAVE_CURLINFO_REDIRECT_TIME=1 -DHAVE_CURLINFO_REDIRECT_COUNT=1 -DHAVE_CURLINFO_PRIVATE=1 -DHAVE_CURLINFO_HTTP_CONNECTCODE=1 -DHAVE_CURLINFO_HTTPAUTH_AVAIL=1 -DHAVE_CURLINFO_PROXYAUTH_AVAIL=1 -DHAVE_CURLINFO_OS_ERRNO=1 -DHAVE_CURLINFO_NUM_CONNECTS=1 -DHAVE_CURLINFO_SSL_ENGINES=1 -DHAVE_CURLINFO_COOKIELIST=1 -DHAVE_CURLINFO_LASTSOCKET=1 -DHAVE_CURLINFO_FTP_ENTRY_PATH=1 -DHAVE_CURLINFO_REDIRECT_URL=1 -DHAVE_CURLINFO_PRIMARY_IP=1 -DHAVE_CURLINFO_APPCONNECT_TIME=1 -DHAVE_CURLINFO_CERTINFO=1 -DHAVE_CURLINFO_CONDITION_UNMET=1 -DHAVE_CURLOPT_WRITEDATA=1 -DHAVE_CURLOPT_KEYPASSWD=1 -DHAVE_CURLOPT_DIRLISTONLY=1 -DHAVE_CURLOPT_APPEND=1 -DHAVE_CURLOPT_KRBLEVEL=1 -DHAVE_CURLOPT_USE_SSL=1 -DHAVE_CURLOPT_TIMEOUT_MS=1 -DHAVE_CURLOPT_CONNECTTIMEOUT_MS=1 -DHAVE_CURLOPT_HTTP_TRANSFER_DECODING=1 -DHAVE_CURLOPT_HTTP_CONTENT_DECODING=1 -DHAVE_CURLOPT_NEW_FILE_PERMS=1 -DHAVE_CURLOPT_NEW_DIRECTORY_PERMS=1 -DHAVE_CURLOPT_POSTREDIR=1 -DHAVE_CURLOPT_OPENSOCKETFUNCTION=1 -DHAVE_CURLOPT_OPENSOCKETDATA=1 -DHAVE_CURLOPT_COPYPOSTFIELDS=1 -DHAVE_CURLOPT_PROXY_TRANSFER_MODE=1 -DHAVE_CURLOPT_SEEKFUNCTION=1 -DHAVE_CURLOPT_SEEKDATA=1 -DHAVE_CURLOPT_CRLFILE=1 -DHAVE_CURLOPT_ISSUERCERT=1 -DHAVE_CURLOPT_ADDRESS_SCOPE=1 -DHAVE_CURLOPT_CERTINFO=1 -DHAVE_CURLOPT_USERNAME=1 -DHAVE_CURLOPT_PASSWORD=1 -DHAVE_CURLOPT_PROXYUSERNAME=1 -DHAVE_CURLOPT_PROXYPASSWORD=1 -DHAVE_CURLOPT_SSH_HOST_PUBLIC_KEY_MD5=1 -DHAVE_CURLOPT_NOPROXY=1 -DHAVE_CURLOPT_TFTP_BLKSIZE=1 -DHAVE_CURLOPT_SOCKS5_GSSAPI_SERVICE=1 -DHAVE_CURLOPT_SOCKS5_GSSAPI_NEC=1 -DHAVE_CURLOPT_PROTOCOLS=1 -DHAVE_CURLOPT_REDIR_PROTOCOLS=1 -DHAVE_CURLOPT_SSH_AUTH_TYPES=1 -DHAVE_CURLOPT_SSH_PUBLIC_KEYFILE=1 -DHAVE_CURLOPT_SSH_PRIVATE_KEYFILE=1 -DHAVE_CURLOPT_FTP_SSL_CCC=1 -DHAVE_CURLOPT_COOKIELIST=1 -DHAVE_CURLOPT_IGNORE_CONTENT_LENGTH=1 -DHAVE_CURLOPT_FTP_SKIP_PASV_IP=1 -DHAVE_CURLOPT_FTP_FILEMETHOD=1 -DHAVE_CURLOPT_LOCALPORT=1 -DHAVE_CURLOPT_LOCALPORTRANGE=1 -DHAVE_CURLOPT_CONNECT_ONLY=1 -DHAVE_CURLOPT_CONV_FROM_NETWORK_FUNCTION=1 -DHAVE_CURLOPT_CONV_TO_NETWORK_FUNCTION=1 -DHAVE_CURLOPT_CONV_FROM_UTF8_FUNCTION=1 -DHAVE_CURLOPT_MAX_SEND_SPEED_LARGE=1 -DHAVE_CURLOPT_MAX_RECV_SPEED_LARGE=1 -DHAVE_CURLOPT_FTP_ALTERNATIVE_TO_USER=1 -DHAVE_CURLOPT_SOCKOPTFUNCTION=1 -DHAVE_CURLOPT_SOCKOPTDATA=1 -DHAVE_CURLOPT_SSL_SESSIONID_CACHE=1 -I/usr/include/libxml2 -fpic -g -O2 -fno-omit-frame-pointer -mno-omit-leaf-frame-pointer -ffile-prefix-map=/build/r-base-EawLoD/r-base-4.4.1=. -fstack-protector-strong -fstack-clash-protection -Wformat -Werror=format-security -fcf-protection -fdebug-prefix-map=/build/r-base-EawLoD/r-base-4.4.1=/usr/src/r-base-4.4.1-1.2404.0 -Wdate-time -D_FORTIFY_SOURCE=3 -c memoryManagement.c -o memoryManagement.o gcc -I"/usr/share/R/include" -DNDEBUG -DCURL_DISABLE_DEPRECATION -DHAVE_LIBIDN_FIELD=1 -DHAVE_CURLOPT_URL=1 -DHAVE_CURLINFO_EFFECTIVE_URL=1 -DHAVE_CURLINFO_RESPONSE_CODE=1 -DHAVE_CURLINFO_TOTAL_TIME=1 -DHAVE_CURLINFO_NAMELOOKUP_TIME=1 -DHAVE_CURLINFO_CONNECT_TIME=1 -DHAVE_CURLINFO_PRETRANSFER_TIME=1 -DHAVE_CURLINFO_SIZE_UPLOAD=1 -DHAVE_CURLINFO_SIZE_DOWNLOAD=1 -DHAVE_CURLINFO_SPEED_DOWNLOAD=1 -DHAVE_CURLINFO_SPEED_UPLOAD=1 -DHAVE_CURLINFO_HEADER_SIZE=1 -DHAVE_CURLINFO_REQUEST_SIZE=1 -DHAVE_CURLINFO_SSL_VERIFYRESULT=1 -DHAVE_CURLINFO_FILETIME=1 -DHAVE_CURLINFO_CONTENT_LENGTH_DOWNLOAD=1 -DHAVE_CURLINFO_CONTENT_LENGTH_UPLOAD=1 -DHAVE_CURLINFO_STARTTRANSFER_TIME=1 -DHAVE_CURLINFO_CONTENT_TYPE=1 -DHAVE_CURLINFO_REDIRECT_TIME=1 -DHAVE_CURLINFO_REDIRECT_COUNT=1 -DHAVE_CURLINFO_PRIVATE=1 -DHAVE_CURLINFO_HTTP_CONNECTCODE=1 -DHAVE_CURLINFO_HTTPAUTH_AVAIL=1 -DHAVE_CURLINFO_PROXYAUTH_AVAIL=1 -DHAVE_CURLINFO_OS_ERRNO=1 -DHAVE_CURLINFO_NUM_CONNECTS=1 -DHAVE_CURLINFO_SSL_ENGINES=1 -DHAVE_CURLINFO_COOKIELIST=1 -DHAVE_CURLINFO_LASTSOCKET=1 -DHAVE_CURLINFO_FTP_ENTRY_PATH=1 -DHAVE_CURLINFO_REDIRECT_URL=1 -DHAVE_CURLINFO_PRIMARY_IP=1 -DHAVE_CURLINFO_APPCONNECT_TIME=1 -DHAVE_CURLINFO_CERTINFO=1 -DHAVE_CURLINFO_CONDITION_UNMET=1 -DHAVE_CURLOPT_WRITEDATA=1 -DHAVE_CURLOPT_KEYPASSWD=1 -DHAVE_CURLOPT_DIRLISTONLY=1 -DHAVE_CURLOPT_APPEND=1 -DHAVE_CURLOPT_KRBLEVEL=1 -DHAVE_CURLOPT_USE_SSL=1 -DHAVE_CURLOPT_TIMEOUT_MS=1 -DHAVE_CURLOPT_CONNECTTIMEOUT_MS=1 -DHAVE_CURLOPT_HTTP_TRANSFER_DECODING=1 -DHAVE_CURLOPT_HTTP_CONTENT_DECODING=1 -DHAVE_CURLOPT_NEW_FILE_PERMS=1 -DHAVE_CURLOPT_NEW_DIRECTORY_PERMS=1 -DHAVE_CURLOPT_POSTREDIR=1 -DHAVE_CURLOPT_OPENSOCKETFUNCTION=1 -DHAVE_CURLOPT_OPENSOCKETDATA=1 -DHAVE_CURLOPT_COPYPOSTFIELDS=1 -DHAVE_CURLOPT_PROXY_TRANSFER_MODE=1 -DHAVE_CURLOPT_SEEKFUNCTION=1 -DHAVE_CURLOPT_SEEKDATA=1 -DHAVE_CURLOPT_CRLFILE=1 -DHAVE_CURLOPT_ISSUERCERT=1 -DHAVE_CURLOPT_ADDRESS_SCOPE=1 -DHAVE_CURLOPT_CERTINFO=1 -DHAVE_CURLOPT_USERNAME=1 -DHAVE_CURLOPT_PASSWORD=1 -DHAVE_CURLOPT_PROXYUSERNAME=1 -DHAVE_CURLOPT_PROXYPASSWORD=1 -DHAVE_CURLOPT_SSH_HOST_PUBLIC_KEY_MD5=1 -DHAVE_CURLOPT_NOPROXY=1 -DHAVE_CURLOPT_TFTP_BLKSIZE=1 -DHAVE_CURLOPT_SOCKS5_GSSAPI_SERVICE=1 -DHAVE_CURLOPT_SOCKS5_GSSAPI_NEC=1 -DHAVE_CURLOPT_PROTOCOLS=1 -DHAVE_CURLOPT_REDIR_PROTOCOLS=1 -DHAVE_CURLOPT_SSH_AUTH_TYPES=1 -DHAVE_CURLOPT_SSH_PUBLIC_KEYFILE=1 -DHAVE_CURLOPT_SSH_PRIVATE_KEYFILE=1 -DHAVE_CURLOPT_FTP_SSL_CCC=1 -DHAVE_CURLOPT_COOKIELIST=1 -DHAVE_CURLOPT_IGNORE_CONTENT_LENGTH=1 -DHAVE_CURLOPT_FTP_SKIP_PASV_IP=1 -DHAVE_CURLOPT_FTP_FILEMETHOD=1 -DHAVE_CURLOPT_LOCALPORT=1 -DHAVE_CURLOPT_LOCALPORTRANGE=1 -DHAVE_CURLOPT_CONNECT_ONLY=1 -DHAVE_CURLOPT_CONV_FROM_NETWORK_FUNCTION=1 -DHAVE_CURLOPT_CONV_TO_NETWORK_FUNCTION=1 -DHAVE_CURLOPT_CONV_FROM_UTF8_FUNCTION=1 -DHAVE_CURLOPT_MAX_SEND_SPEED_LARGE=1 -DHAVE_CURLOPT_MAX_RECV_SPEED_LARGE=1 -DHAVE_CURLOPT_FTP_ALTERNATIVE_TO_USER=1 -DHAVE_CURLOPT_SOCKOPTFUNCTION=1 -DHAVE_CURLOPT_SOCKOPTDATA=1 -DHAVE_CURLOPT_SSL_SESSIONID_CACHE=1 -I/usr/include/libxml2 -fpic -g -O2 -fno-omit-frame-pointer -mno-omit-leaf-frame-pointer -ffile-prefix-map=/build/r-base-EawLoD/r-base-4.4.1=. -fstack-protector-strong -fstack-clash-protection -Wformat -Werror=format-security -fcf-protection -fdebug-prefix-map=/build/r-base-EawLoD/r-base-4.4.1=/usr/src/r-base-4.4.1-1.2404.0 -Wdate-time -D_FORTIFY_SOURCE=3 -c myUTF8.c -o myUTF8.o gcc -shared -L/usr/lib/R/lib -Wl,-Bsymbolic-functions -flto=auto -ffat-lto-objects -Wl,-z,relro -o RCurl.so base64.o curl.o curlInit.o curl_base64.o enums.o json.o memoryManagement.o myUTF8.o -lcurl -lxml2 -L/usr/lib/R/lib -lR installing to /home/omnipath/local/R/4.4-3.20/00LOCK-RCurl/00new/RCurl/libs ** R ** data ** inst ** byte-compile and prepare package for lazy loading ** help *** installing help indices ** building package indices ** testing if installed package can be loaded from temporary location ** 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 (RCurl) * installing *source* package ‘processx’ ... ** package ‘processx’ successfully unpacked and MD5 sums checked ** using staged installation ** libs using C compiler: ‘gcc (Ubuntu 13.2.0-23ubuntu4) 13.2.0’ gcc -g -O2 -fno-omit-frame-pointer -mno-omit-leaf-frame-pointer -ffile-prefix-map=/build/r-base-EawLoD/r-base-4.4.1=. -fstack-protector-strong -fstack-clash-protection -Wformat -Werror=format-security -fcf-protection -fdebug-prefix-map=/build/r-base-EawLoD/r-base-4.4.1=/usr/src/r-base-4.4.1-1.2404.0 -Wdate-time -D_FORTIFY_SOURCE=3 -Wl,-Bsymbolic-functions -flto=auto -ffat-lto-objects -Wl,-z,relro -Wall tools/px.c -o tools/px In file included from /usr/include/features.h:502, from /usr/include/unistd.h:25, from tools/px.c:11: In function ‘read’, inlined from ‘echo_from_fd’ at tools/px.c:93:9: /usr/include/x86_64-linux-gnu/bits/unistd.h:28:10: warning: ‘*read’ specified size 18446744073709551614 exceeds maximum object size 9223372036854775807 [-Wstringop-overflow=] 28 | return __glibc_fortify (read, __nbytes, sizeof (char), | ^~~~~~~~~~~~~~~ /usr/include/x86_64-linux-gnu/bits/unistd-decl.h: In function ‘echo_from_fd’: /usr/include/x86_64-linux-gnu/bits/unistd-decl.h:29:16: note: in a call to function ‘*read’ declared with attribute ‘access (write_only, 2, 3)’ 29 | extern ssize_t __REDIRECT_FORTIFY (__read_alias, (int __fd, void *__buf, | ^~~~~~~~~~~~~~~~~~ In function ‘read’, inlined from ‘echo_from_fd’ at tools/px.c:93:9, inlined from ‘main’ at tools/px.c:201:11: /usr/include/x86_64-linux-gnu/bits/unistd.h:28:10: warning: ‘__read_alias’ specified size 18446744073709551614 exceeds maximum object size 9223372036854775807 [-Wstringop-overflow=] 28 | return __glibc_fortify (read, __nbytes, sizeof (char), | ^ /usr/include/x86_64-linux-gnu/bits/unistd-decl.h: In function ‘main’: /usr/include/x86_64-linux-gnu/bits/unistd-decl.h:29:16: note: in a call to function ‘__read_alias’ declared with attribute ‘access (write_only, 2, 3)’ 29 | extern ssize_t __REDIRECT_FORTIFY (__read_alias, (int __fd, void *__buf, | ^ gcc -g -O2 -fno-omit-frame-pointer -mno-omit-leaf-frame-pointer -ffile-prefix-map=/build/r-base-EawLoD/r-base-4.4.1=. -fstack-protector-strong -fstack-clash-protection -Wformat -Werror=format-security -fcf-protection -fdebug-prefix-map=/build/r-base-EawLoD/r-base-4.4.1=/usr/src/r-base-4.4.1-1.2404.0 -Wdate-time -D_FORTIFY_SOURCE=3 -Wl,-Bsymbolic-functions -flto=auto -ffat-lto-objects -Wl,-z,relro -I../inst/include -Wall tools/sock.c -o tools/sock gcc -g -O2 -fno-omit-frame-pointer -mno-omit-leaf-frame-pointer -ffile-prefix-map=/build/r-base-EawLoD/r-base-4.4.1=. -fstack-protector-strong -fstack-clash-protection -Wformat -Werror=format-security -fcf-protection -fdebug-prefix-map=/build/r-base-EawLoD/r-base-4.4.1=/usr/src/r-base-4.4.1-1.2404.0 -Wdate-time -D_FORTIFY_SOURCE=3 -Wl,-Bsymbolic-functions -flto=auto -ffat-lto-objects -Wl,-z,relro supervisor/supervisor.c \ supervisor/utils.c -o supervisor/supervisor gcc -I"/usr/share/R/include" -DNDEBUG -fpic -g -O2 -fno-omit-frame-pointer -mno-omit-leaf-frame-pointer -ffile-prefix-map=/build/r-base-EawLoD/r-base-4.4.1=. -fstack-protector-strong -fstack-clash-protection -Wformat -Werror=format-security -fcf-protection -fdebug-prefix-map=/build/r-base-EawLoD/r-base-4.4.1=/usr/src/r-base-4.4.1-1.2404.0 -Wdate-time -D_FORTIFY_SOURCE=3 -c base64.c -o base64.o gcc -I"/usr/share/R/include" -DNDEBUG -fpic -g -O2 -fno-omit-frame-pointer -mno-omit-leaf-frame-pointer -ffile-prefix-map=/build/r-base-EawLoD/r-base-4.4.1=. -fstack-protector-strong -fstack-clash-protection -Wformat -Werror=format-security -fcf-protection -fdebug-prefix-map=/build/r-base-EawLoD/r-base-4.4.1=/usr/src/r-base-4.4.1-1.2404.0 -Wdate-time -D_FORTIFY_SOURCE=3 -c client.c -o client.o gcc -I"/usr/share/R/include" -DNDEBUG -fpic -g -O2 -fno-omit-frame-pointer -mno-omit-leaf-frame-pointer -ffile-prefix-map=/build/r-base-EawLoD/r-base-4.4.1=. -fstack-protector-strong -fstack-clash-protection -Wformat -Werror=format-security -fcf-protection -fdebug-prefix-map=/build/r-base-EawLoD/r-base-4.4.1=/usr/src/r-base-4.4.1-1.2404.0 -Wdate-time -D_FORTIFY_SOURCE=3 -c errors.c -o errors.o gcc -shared -L"/usr/lib/R/lib" -Wl,-Bsymbolic-functions -flto=auto -ffat-lto-objects -Wl,-z,relro -o client.so base64.o client.o errors.o \ -L"/usr/lib/R/lib" -lR if [ -n "" ]; then \ echo Removing libR.so dependency from client.so; \ patchelf --remove-needed libR.so client.so; \ fi gcc -I"/usr/share/R/include" -DNDEBUG -fpic -g -O2 -fno-omit-frame-pointer -mno-omit-leaf-frame-pointer -ffile-prefix-map=/build/r-base-EawLoD/r-base-4.4.1=. -fstack-protector-strong -fstack-clash-protection -Wformat -Werror=format-security -fcf-protection -fdebug-prefix-map=/build/r-base-EawLoD/r-base-4.4.1=/usr/src/r-base-4.4.1-1.2404.0 -Wdate-time -D_FORTIFY_SOURCE=3 -c init.c -o init.o gcc -I"/usr/share/R/include" -DNDEBUG -fpic -g -O2 -fno-omit-frame-pointer -mno-omit-leaf-frame-pointer -ffile-prefix-map=/build/r-base-EawLoD/r-base-4.4.1=. -fstack-protector-strong -fstack-clash-protection -Wformat -Werror=format-security -fcf-protection -fdebug-prefix-map=/build/r-base-EawLoD/r-base-4.4.1=/usr/src/r-base-4.4.1-1.2404.0 -Wdate-time -D_FORTIFY_SOURCE=3 -c poll.c -o poll.o gcc -I"/usr/share/R/include" -DNDEBUG -fpic -g -O2 -fno-omit-frame-pointer -mno-omit-leaf-frame-pointer -ffile-prefix-map=/build/r-base-EawLoD/r-base-4.4.1=. -fstack-protector-strong -fstack-clash-protection -Wformat -Werror=format-security -fcf-protection -fdebug-prefix-map=/build/r-base-EawLoD/r-base-4.4.1=/usr/src/r-base-4.4.1-1.2404.0 -Wdate-time -D_FORTIFY_SOURCE=3 -c processx-connection.c -o processx-connection.o gcc -I"/usr/share/R/include" -DNDEBUG -fpic -g -O2 -fno-omit-frame-pointer -mno-omit-leaf-frame-pointer -ffile-prefix-map=/build/r-base-EawLoD/r-base-4.4.1=. -fstack-protector-strong -fstack-clash-protection -Wformat -Werror=format-security -fcf-protection -fdebug-prefix-map=/build/r-base-EawLoD/r-base-4.4.1=/usr/src/r-base-4.4.1-1.2404.0 -Wdate-time -D_FORTIFY_SOURCE=3 -c processx-vector.c -o processx-vector.o gcc -I"/usr/share/R/include" -DNDEBUG -fpic -g -O2 -fno-omit-frame-pointer -mno-omit-leaf-frame-pointer -ffile-prefix-map=/build/r-base-EawLoD/r-base-4.4.1=. -fstack-protector-strong -fstack-clash-protection -Wformat -Werror=format-security -fcf-protection -fdebug-prefix-map=/build/r-base-EawLoD/r-base-4.4.1=/usr/src/r-base-4.4.1-1.2404.0 -Wdate-time -D_FORTIFY_SOURCE=3 -c create-time.c -o create-time.o gcc -I"/usr/share/R/include" -DNDEBUG -fpic -g -O2 -fno-omit-frame-pointer -mno-omit-leaf-frame-pointer -ffile-prefix-map=/build/r-base-EawLoD/r-base-4.4.1=. -fstack-protector-strong -fstack-clash-protection -Wformat -Werror=format-security -fcf-protection -fdebug-prefix-map=/build/r-base-EawLoD/r-base-4.4.1=/usr/src/r-base-4.4.1-1.2404.0 -Wdate-time -D_FORTIFY_SOURCE=3 -c unix/childlist.c -o unix/childlist.o gcc -I"/usr/share/R/include" -DNDEBUG -fpic -g -O2 -fno-omit-frame-pointer -mno-omit-leaf-frame-pointer -ffile-prefix-map=/build/r-base-EawLoD/r-base-4.4.1=. -fstack-protector-strong -fstack-clash-protection -Wformat -Werror=format-security -fcf-protection -fdebug-prefix-map=/build/r-base-EawLoD/r-base-4.4.1=/usr/src/r-base-4.4.1-1.2404.0 -Wdate-time -D_FORTIFY_SOURCE=3 -c unix/connection.c -o unix/connection.o gcc -I"/usr/share/R/include" -DNDEBUG -fpic -g -O2 -fno-omit-frame-pointer -mno-omit-leaf-frame-pointer -ffile-prefix-map=/build/r-base-EawLoD/r-base-4.4.1=. -fstack-protector-strong -fstack-clash-protection -Wformat -Werror=format-security -fcf-protection -fdebug-prefix-map=/build/r-base-EawLoD/r-base-4.4.1=/usr/src/r-base-4.4.1-1.2404.0 -Wdate-time -D_FORTIFY_SOURCE=3 -c unix/processx.c -o unix/processx.o gcc -I"/usr/share/R/include" -DNDEBUG -fpic -g -O2 -fno-omit-frame-pointer -mno-omit-leaf-frame-pointer -ffile-prefix-map=/build/r-base-EawLoD/r-base-4.4.1=. -fstack-protector-strong -fstack-clash-protection -Wformat -Werror=format-security -fcf-protection -fdebug-prefix-map=/build/r-base-EawLoD/r-base-4.4.1=/usr/src/r-base-4.4.1-1.2404.0 -Wdate-time -D_FORTIFY_SOURCE=3 -c unix/sigchld.c -o unix/sigchld.o gcc -I"/usr/share/R/include" -DNDEBUG -fpic -g -O2 -fno-omit-frame-pointer -mno-omit-leaf-frame-pointer -ffile-prefix-map=/build/r-base-EawLoD/r-base-4.4.1=. -fstack-protector-strong -fstack-clash-protection -Wformat -Werror=format-security -fcf-protection -fdebug-prefix-map=/build/r-base-EawLoD/r-base-4.4.1=/usr/src/r-base-4.4.1-1.2404.0 -Wdate-time -D_FORTIFY_SOURCE=3 -c unix/utils.c -o unix/utils.o gcc -I"/usr/share/R/include" -DNDEBUG -fpic -g -O2 -fno-omit-frame-pointer -mno-omit-leaf-frame-pointer -ffile-prefix-map=/build/r-base-EawLoD/r-base-4.4.1=. -fstack-protector-strong -fstack-clash-protection -Wformat -Werror=format-security -fcf-protection -fdebug-prefix-map=/build/r-base-EawLoD/r-base-4.4.1=/usr/src/r-base-4.4.1-1.2404.0 -Wdate-time -D_FORTIFY_SOURCE=3 -c unix/named_pipe.c -o unix/named_pipe.o gcc -I"/usr/share/R/include" -DNDEBUG -fpic -g -O2 -fno-omit-frame-pointer -mno-omit-leaf-frame-pointer -ffile-prefix-map=/build/r-base-EawLoD/r-base-4.4.1=. -fstack-protector-strong -fstack-clash-protection -Wformat -Werror=format-security -fcf-protection -fdebug-prefix-map=/build/r-base-EawLoD/r-base-4.4.1=/usr/src/r-base-4.4.1-1.2404.0 -Wdate-time -D_FORTIFY_SOURCE=3 -c cleancall.c -o cleancall.o gcc -shared -L/usr/lib/R/lib -Wl,-Bsymbolic-functions -flto=auto -ffat-lto-objects -Wl,-z,relro -o processx.so init.o poll.o errors.o processx-connection.o processx-vector.o create-time.o base64.o unix/childlist.o unix/connection.o unix/processx.o unix/sigchld.o unix/utils.o unix/named_pipe.o cleancall.o -L/usr/lib/R/lib -lR installing via 'install.libs.R' to /home/omnipath/local/R/4.4-3.20/00LOCK-processx/00new/processx ** 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 (processx) * installing *source* package ‘lifecycle’ ... ** package ‘lifecycle’ 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 (lifecycle) * installing *source* package ‘highr’ ... ** package ‘highr’ successfully unpacked and MD5 sums checked ** using staged installation ** R ** inst ** byte-compile and prepare package for lazy loading ** help *** installing help indices ** building package indices ** installing vignettes ** testing if installed package can be loaded from temporary location ** testing if installed package can be loaded from final location ** testing if installed package keeps a record of temporary installation path * DONE (highr) * installing *source* package ‘xml2’ ... ** package ‘xml2’ successfully unpacked and MD5 sums checked ** using staged installation Found pkg-config cflags and libs! Using PKG_CFLAGS=-I/usr/include/libxml2 Using PKG_LIBS=-lxml2 ** libs using C compiler: ‘gcc (Ubuntu 13.2.0-23ubuntu4) 13.2.0’ using C++ compiler: ‘g++ (Ubuntu 13.2.0-23ubuntu4) 13.2.0’ g++ -std=gnu++17 -I"/usr/share/R/include" -DNDEBUG -I../inst/include -I/usr/include/libxml2 -DUCHAR_TYPE=wchar_t -DU_SHOW_CPLUSPLUS_API=0 -fvisibility=hidden -fpic -g -O2 -fno-omit-frame-pointer -mno-omit-leaf-frame-pointer -ffile-prefix-map=/build/r-base-EawLoD/r-base-4.4.1=. -fstack-protector-strong -fstack-clash-protection -Wformat -Werror=format-security -fcf-protection -fdebug-prefix-map=/build/r-base-EawLoD/r-base-4.4.1=/usr/src/r-base-4.4.1-1.2404.0 -Wdate-time -D_FORTIFY_SOURCE=3 -c connection.cpp -o connection.o gcc -I"/usr/share/R/include" -DNDEBUG -I../inst/include -I/usr/include/libxml2 -DUCHAR_TYPE=wchar_t -DU_SHOW_CPLUSPLUS_API=0 -fpic -g -O2 -fno-omit-frame-pointer -mno-omit-leaf-frame-pointer -ffile-prefix-map=/build/r-base-EawLoD/r-base-4.4.1=. -fstack-protector-strong -fstack-clash-protection -Wformat -Werror=format-security -fcf-protection -fdebug-prefix-map=/build/r-base-EawLoD/r-base-4.4.1=/usr/src/r-base-4.4.1-1.2404.0 -Wdate-time -D_FORTIFY_SOURCE=3 -c init.c -o init.o g++ -std=gnu++17 -I"/usr/share/R/include" -DNDEBUG -I../inst/include -I/usr/include/libxml2 -DUCHAR_TYPE=wchar_t -DU_SHOW_CPLUSPLUS_API=0 -fvisibility=hidden -fpic -g -O2 -fno-omit-frame-pointer -mno-omit-leaf-frame-pointer -ffile-prefix-map=/build/r-base-EawLoD/r-base-4.4.1=. -fstack-protector-strong -fstack-clash-protection -Wformat -Werror=format-security -fcf-protection -fdebug-prefix-map=/build/r-base-EawLoD/r-base-4.4.1=/usr/src/r-base-4.4.1-1.2404.0 -Wdate-time -D_FORTIFY_SOURCE=3 -c xml2_doc.cpp -o xml2_doc.o g++ -std=gnu++17 -I"/usr/share/R/include" -DNDEBUG -I../inst/include -I/usr/include/libxml2 -DUCHAR_TYPE=wchar_t -DU_SHOW_CPLUSPLUS_API=0 -fvisibility=hidden -fpic -g -O2 -fno-omit-frame-pointer -mno-omit-leaf-frame-pointer -ffile-prefix-map=/build/r-base-EawLoD/r-base-4.4.1=. -fstack-protector-strong -fstack-clash-protection -Wformat -Werror=format-security -fcf-protection -fdebug-prefix-map=/build/r-base-EawLoD/r-base-4.4.1=/usr/src/r-base-4.4.1-1.2404.0 -Wdate-time -D_FORTIFY_SOURCE=3 -c xml2_init.cpp -o xml2_init.o g++ -std=gnu++17 -I"/usr/share/R/include" -DNDEBUG -I../inst/include -I/usr/include/libxml2 -DUCHAR_TYPE=wchar_t -DU_SHOW_CPLUSPLUS_API=0 -fvisibility=hidden -fpic -g -O2 -fno-omit-frame-pointer -mno-omit-leaf-frame-pointer -ffile-prefix-map=/build/r-base-EawLoD/r-base-4.4.1=. -fstack-protector-strong -fstack-clash-protection -Wformat -Werror=format-security -fcf-protection -fdebug-prefix-map=/build/r-base-EawLoD/r-base-4.4.1=/usr/src/r-base-4.4.1-1.2404.0 -Wdate-time -D_FORTIFY_SOURCE=3 -c xml2_namespace.cpp -o xml2_namespace.o g++ -std=gnu++17 -I"/usr/share/R/include" -DNDEBUG -I../inst/include -I/usr/include/libxml2 -DUCHAR_TYPE=wchar_t -DU_SHOW_CPLUSPLUS_API=0 -fvisibility=hidden -fpic -g -O2 -fno-omit-frame-pointer -mno-omit-leaf-frame-pointer -ffile-prefix-map=/build/r-base-EawLoD/r-base-4.4.1=. -fstack-protector-strong -fstack-clash-protection -Wformat -Werror=format-security -fcf-protection -fdebug-prefix-map=/build/r-base-EawLoD/r-base-4.4.1=/usr/src/r-base-4.4.1-1.2404.0 -Wdate-time -D_FORTIFY_SOURCE=3 -c xml2_node.cpp -o xml2_node.o g++ -std=gnu++17 -I"/usr/share/R/include" -DNDEBUG -I../inst/include -I/usr/include/libxml2 -DUCHAR_TYPE=wchar_t -DU_SHOW_CPLUSPLUS_API=0 -fvisibility=hidden -fpic -g -O2 -fno-omit-frame-pointer -mno-omit-leaf-frame-pointer -ffile-prefix-map=/build/r-base-EawLoD/r-base-4.4.1=. -fstack-protector-strong -fstack-clash-protection -Wformat -Werror=format-security -fcf-protection -fdebug-prefix-map=/build/r-base-EawLoD/r-base-4.4.1=/usr/src/r-base-4.4.1-1.2404.0 -Wdate-time -D_FORTIFY_SOURCE=3 -c xml2_output.cpp -o xml2_output.o g++ -std=gnu++17 -I"/usr/share/R/include" -DNDEBUG -I../inst/include -I/usr/include/libxml2 -DUCHAR_TYPE=wchar_t -DU_SHOW_CPLUSPLUS_API=0 -fvisibility=hidden -fpic -g -O2 -fno-omit-frame-pointer -mno-omit-leaf-frame-pointer -ffile-prefix-map=/build/r-base-EawLoD/r-base-4.4.1=. -fstack-protector-strong -fstack-clash-protection -Wformat -Werror=format-security -fcf-protection -fdebug-prefix-map=/build/r-base-EawLoD/r-base-4.4.1=/usr/src/r-base-4.4.1-1.2404.0 -Wdate-time -D_FORTIFY_SOURCE=3 -c xml2_schema.cpp -o xml2_schema.o g++ -std=gnu++17 -I"/usr/share/R/include" -DNDEBUG -I../inst/include -I/usr/include/libxml2 -DUCHAR_TYPE=wchar_t -DU_SHOW_CPLUSPLUS_API=0 -fvisibility=hidden -fpic -g -O2 -fno-omit-frame-pointer -mno-omit-leaf-frame-pointer -ffile-prefix-map=/build/r-base-EawLoD/r-base-4.4.1=. -fstack-protector-strong -fstack-clash-protection -Wformat -Werror=format-security -fcf-protection -fdebug-prefix-map=/build/r-base-EawLoD/r-base-4.4.1=/usr/src/r-base-4.4.1-1.2404.0 -Wdate-time -D_FORTIFY_SOURCE=3 -c xml2_url.cpp -o xml2_url.o g++ -std=gnu++17 -I"/usr/share/R/include" -DNDEBUG -I../inst/include -I/usr/include/libxml2 -DUCHAR_TYPE=wchar_t -DU_SHOW_CPLUSPLUS_API=0 -fvisibility=hidden -fpic -g -O2 -fno-omit-frame-pointer -mno-omit-leaf-frame-pointer -ffile-prefix-map=/build/r-base-EawLoD/r-base-4.4.1=. -fstack-protector-strong -fstack-clash-protection -Wformat -Werror=format-security -fcf-protection -fdebug-prefix-map=/build/r-base-EawLoD/r-base-4.4.1=/usr/src/r-base-4.4.1-1.2404.0 -Wdate-time -D_FORTIFY_SOURCE=3 -c xml2_xpath.cpp -o xml2_xpath.o g++ -std=gnu++17 -shared -L/usr/lib/R/lib -Wl,-Bsymbolic-functions -flto=auto -ffat-lto-objects -Wl,-z,relro -o xml2.so connection.o init.o xml2_doc.o xml2_init.o xml2_namespace.o xml2_node.o xml2_output.o xml2_schema.o xml2_url.o xml2_xpath.o -lxml2 -L/usr/lib/R/lib -lR installing to /home/omnipath/local/R/4.4-3.20/00LOCK-xml2/00new/xml2/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 (xml2) * installing *source* package ‘graph’ ... ** using staged installation ** libs using C compiler: ‘gcc (Ubuntu 13.2.0-23ubuntu4) 13.2.0’ gcc -I"/usr/share/R/include" -DNDEBUG -fpic -g -O2 -fno-omit-frame-pointer -mno-omit-leaf-frame-pointer -ffile-prefix-map=/build/r-base-EawLoD/r-base-4.4.1=. -fstack-protector-strong -fstack-clash-protection -Wformat -Werror=format-security -fcf-protection -fdebug-prefix-map=/build/r-base-EawLoD/r-base-4.4.1=/usr/src/r-base-4.4.1-1.2404.0 -Wdate-time -D_FORTIFY_SOURCE=3 -c graph.c -o graph.o gcc -shared -L/usr/lib/R/lib -Wl,-Bsymbolic-functions -flto=auto -ffat-lto-objects -Wl,-z,relro -o graph.so graph.o -L/usr/lib/R/lib -lR mv graph.so BioC_graph.so installing to /home/omnipath/local/R/4.4-3.20/00LOCK-graph/00new/graph/libs ** R ** data ** inst ** byte-compile and prepare package for lazy loading ** help *** installing help indices ** building package indices ** installing vignettes ** testing if installed package can be loaded from temporary location ** checking absolute paths in shared objects and dynamic libraries ** testing if installed package can be loaded from final location ** testing if installed package keeps a record of temporary installation path * DONE (graph) * installing *source* package ‘memoise’ ... ** package ‘memoise’ 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 (memoise) * installing *source* package ‘RBGL’ ... ** using staged installation ** libs using C++ compiler: ‘g++ (Ubuntu 13.2.0-23ubuntu4) 13.2.0’ g++ -std=gnu++17 -I"/usr/share/R/include" -DNDEBUG -I'/home/omnipath/local/R/4.4-3.20/BH/include' -fpic -g -O2 -fno-omit-frame-pointer -mno-omit-leaf-frame-pointer -ffile-prefix-map=/build/r-base-EawLoD/r-base-4.4.1=. -fstack-protector-strong -fstack-clash-protection -Wformat -Werror=format-security -fcf-protection -fdebug-prefix-map=/build/r-base-EawLoD/r-base-4.4.1=/usr/src/r-base-4.4.1-1.2404.0 -Wdate-time -D_FORTIFY_SOURCE=3 -c bbc.cpp -o bbc.o In file included from /home/omnipath/local/R/4.4-3.20/BH/include/boost/smart_ptr/shared_ptr.hpp:18, from /home/omnipath/local/R/4.4-3.20/BH/include/boost/property_map/vector_property_map.hpp:14, from /home/omnipath/local/R/4.4-3.20/BH/include/boost/property_map/property_map.hpp:598, from RBGL.hpp:17, from bbc.cpp:1: /home/omnipath/local/R/4.4-3.20/BH/include/boost/smart_ptr/detail/shared_count.hpp:361:33: warning: ‘template class std::auto_ptr’ is deprecated: use 'std::unique_ptr' instead [-Wdeprecated-declarations] 361 | explicit shared_count( std::auto_ptr & r ): pi_( new sp_counted_impl_p( r.get() ) ) | ^~~~~~~~ In file included from /usr/include/c++/13/memory:78, from /home/omnipath/local/R/4.4-3.20/BH/include/boost/smart_ptr/detail/sp_counted_impl.hpp:35, from /home/omnipath/local/R/4.4-3.20/BH/include/boost/smart_ptr/detail/shared_count.hpp:27: /usr/include/c++/13/bits/unique_ptr.h:65:28: note: declared here 65 | template class auto_ptr; | ^~~~~~~~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/smart_ptr/shared_ptr.hpp:251:65: warning: ‘template class std::auto_ptr’ is deprecated: use 'std::unique_ptr' instead [-Wdeprecated-declarations] 251 | template< class T, class R > struct sp_enable_if_auto_ptr< std::auto_ptr< T >, R > | ^~~~~~~~ /usr/include/c++/13/bits/unique_ptr.h:65:28: note: declared here 65 | template class auto_ptr; | ^~~~~~~~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/smart_ptr/shared_ptr.hpp:508:31: warning: ‘template class std::auto_ptr’ is deprecated: use 'std::unique_ptr' instead [-Wdeprecated-declarations] 508 | explicit shared_ptr( std::auto_ptr & r ): px(r.get()), pn() | ^~~~~~~~ /usr/include/c++/13/bits/unique_ptr.h:65:28: note: declared here 65 | template class auto_ptr; | ^~~~~~~~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/smart_ptr/shared_ptr.hpp:521:22: warning: ‘template class std::auto_ptr’ is deprecated: use 'std::unique_ptr' instead [-Wdeprecated-declarations] 521 | shared_ptr( std::auto_ptr && r ): px(r.get()), pn() | ^~~~~~~~ /usr/include/c++/13/bits/unique_ptr.h:65:28: note: declared here 65 | template class auto_ptr; | ^~~~~~~~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/smart_ptr/shared_ptr.hpp:604:34: warning: ‘template class std::auto_ptr’ is deprecated: use 'std::unique_ptr' instead [-Wdeprecated-declarations] 604 | shared_ptr & operator=( std::auto_ptr & r ) | ^~~~~~~~ /usr/include/c++/13/bits/unique_ptr.h:65:28: note: declared here 65 | template class auto_ptr; | ^~~~~~~~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/smart_ptr/shared_ptr.hpp:613:34: warning: ‘template class std::auto_ptr’ is deprecated: use 'std::unique_ptr' instead [-Wdeprecated-declarations] 613 | shared_ptr & operator=( std::auto_ptr && r ) | ^~~~~~~~ /usr/include/c++/13/bits/unique_ptr.h:65:28: note: declared here 65 | template class auto_ptr; | ^~~~~~~~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/smart_ptr/shared_ptr.hpp: In member function ‘boost::shared_ptr& boost::shared_ptr::operator=(std::auto_ptr<_Up>&&)’: /home/omnipath/local/R/4.4-3.20/BH/include/boost/smart_ptr/shared_ptr.hpp:615:38: warning: ‘template class std::auto_ptr’ is deprecated: use 'std::unique_ptr' instead [-Wdeprecated-declarations] 615 | this_type( static_cast< std::auto_ptr && >( r ) ).swap( *this ); | ^~~~~~~~ /usr/include/c++/13/bits/unique_ptr.h:65:28: note: declared here 65 | template class auto_ptr; | ^~~~~~~~ In file included from /home/omnipath/local/R/4.4-3.20/BH/include/boost/scoped_ptr.hpp:13, from /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/adjacency_list.hpp:22, from RBGL.hpp:38: /home/omnipath/local/R/4.4-3.20/BH/include/boost/smart_ptr/scoped_ptr.hpp: At global scope: /home/omnipath/local/R/4.4-3.20/BH/include/boost/smart_ptr/scoped_ptr.hpp:75:31: warning: ‘template class std::auto_ptr’ is deprecated: use 'std::unique_ptr' instead [-Wdeprecated-declarations] 75 | explicit scoped_ptr( std::auto_ptr p ) BOOST_SP_NOEXCEPT : px( p.release() ) | ^~~~~~~~ /usr/include/c++/13/bits/unique_ptr.h:65:28: note: declared here 65 | template class auto_ptr; | ^~~~~~~~ In file included from /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/assert.hpp:35, from /home/omnipath/local/R/4.4-3.20/BH/include/boost/property_map/property_map.hpp:19: /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements, std::allocator > >*, std::vector, std::allocator > >, std::allocator, std::allocator > > > > > > >]’: /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:145:5: required from ‘struct boost::Assignable<__gnu_cxx::__normal_iterator, std::allocator > >*, std::vector, std::allocator > >, std::allocator, std::allocator > > > > > >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:502:3: required from ‘struct boost::InputIterator<__gnu_cxx::__normal_iterator, std::allocator > >*, std::vector, std::allocator > >, std::allocator, std::allocator > > > > > >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:540:3: required from ‘struct boost::ForwardIterator<__gnu_cxx::__normal_iterator, std::allocator > >*, std::vector, std::allocator > >, std::allocator, std::allocator > > > > > >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:568:3: required from ‘struct boost::BidirectionalIterator<__gnu_cxx::__normal_iterator, std::allocator > >*, std::vector, std::allocator > >, std::allocator, std::allocator > > > > > >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:597:3: required from ‘struct boost::RandomAccessIterator<__gnu_cxx::__normal_iterator, std::allocator > >*, std::vector, std::allocator > >, std::allocator, std::allocator > > > > > >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:597:3: [ skipping 4 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_, std::allocator > >*, std::vector, std::allocator > >, std::allocator, std::allocator > > > > > >)>’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/property_map/property_map.hpp:354:5: required from ‘boost::iterator_property_map >::value_type, typename std::iterator_traits< >::reference> boost::make_iterator_property_map(RAIter, ID) [with RAIter = __gnu_cxx::__normal_iterator, std::allocator > >*, std::vector, std::allocator > >, std::allocator, std::allocator > > > > >; ID = vec_adj_list_vertex_id_map >, long unsigned int>; typename std::iterator_traits< >::value_type = std::vector, std::allocator > >; typename std::iterator_traits< >::reference = std::vector, std::allocator > >&]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/betweenness_centrality.hpp:469:43: required from ‘void boost::detail::graph::brandes_betweenness_centrality_dispatch2(const Graph&, CentralityMap, EdgeCentralityMap, WeightMap, VertexIndexMap) [with Graph = boost::adjacency_list >, boost::property > >; CentralityMap = boost::vec_adj_list_vertex_property_map >, boost::property > >, boost::adjacency_list >, boost::property > >*, double, double&, boost::vertex_centrality_t>; EdgeCentralityMap = boost::adj_list_edge_property_map >, boost::edge_centrality_t>; WeightMap = boost::adj_list_edge_property_map >, boost::edge_weight_t>; VertexIndexMap = boost::vec_adj_list_vertex_id_map >, long unsigned int>]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/betweenness_centrality.hpp:517:57: required from ‘static void boost::detail::graph::brandes_betweenness_centrality_dispatch1::run(const Graph&, CentralityMap, EdgeCentralityMap, VertexIndexMap, WeightMap) [with Graph = boost::adjacency_list >, boost::property > >; CentralityMap = boost::vec_adj_list_vertex_property_map >, boost::property > >, boost::adjacency_list >, boost::property > >*, double, double&, boost::vertex_centrality_t>; EdgeCentralityMap = boost::adj_list_edge_property_map >, boost::edge_centrality_t>; VertexIndexMap = boost::vec_adj_list_vertex_id_map >, long unsigned int>; WeightMap = boost::adj_list_edge_property_map >, boost::edge_weight_t>]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/betweenness_centrality.hpp:558:71: required from ‘void boost::brandes_betweenness_centrality(const Graph&, const bgl_named_params&, typename enable_if_c::traversal_category>::value, graph::detail::no_parameter>::type) [with Graph = adjacency_list >, property > >; Param = adj_list_edge_property_map >, edge_weight_t>; Tag = edge_weight_t; Rest = bgl_named_params >, edge_centrality_t>, edge_centrality_t, bgl_named_params >, property > >, adjacency_list >, property > >*, double, double&, vertex_centrality_t>, vertex_centrality_t, no_property> >; typename enable_if_c::traversal_category>::value, graph::detail::no_parameter>::type = graph::detail::no_parameter; typename graph_traits::traversal_category = undir_adj_list_traversal_tag]’ bbc.cpp:67:33: required from here /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ In file included from /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:31, from /home/omnipath/local/R/4.4-3.20/BH/include/boost/property_map/property_map.hpp:20: /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::Assignable<__gnu_cxx::__normal_iterator, std::allocator > >*, std::vector, std::allocator > >, std::allocator, std::allocator > > > > > >]’ 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ^ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements, std::allocator > >*, std::vector, std::allocator > >, std::allocator, std::allocator > > > > > > >]’: /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:233:5: required from ‘struct boost::EqualityComparable<__gnu_cxx::__normal_iterator, std::allocator > >*, std::vector, std::allocator > >, std::allocator, std::allocator > > > > > >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:502:3: required from ‘struct boost::InputIterator<__gnu_cxx::__normal_iterator, std::allocator > >*, std::vector, std::allocator > >, std::allocator, std::allocator > > > > > >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:540:3: required from ‘struct boost::ForwardIterator<__gnu_cxx::__normal_iterator, std::allocator > >*, std::vector, std::allocator > >, std::allocator, std::allocator > > > > > >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:568:3: required from ‘struct boost::BidirectionalIterator<__gnu_cxx::__normal_iterator, std::allocator > >*, std::vector, std::allocator > >, std::allocator, std::allocator > > > > > >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:597:3: required from ‘struct boost::RandomAccessIterator<__gnu_cxx::__normal_iterator, std::allocator > >*, std::vector, std::allocator > >, std::allocator, std::allocator > > > > > >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:597:3: [ skipping 4 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_, std::allocator > >*, std::vector, std::allocator > >, std::allocator, std::allocator > > > > > >)>’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/property_map/property_map.hpp:354:5: required from ‘boost::iterator_property_map >::value_type, typename std::iterator_traits< >::reference> boost::make_iterator_property_map(RAIter, ID) [with RAIter = __gnu_cxx::__normal_iterator, std::allocator > >*, std::vector, std::allocator > >, std::allocator, std::allocator > > > > >; ID = vec_adj_list_vertex_id_map >, long unsigned int>; typename std::iterator_traits< >::value_type = std::vector, std::allocator > >; typename std::iterator_traits< >::reference = std::vector, std::allocator > >&]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/betweenness_centrality.hpp:469:43: required from ‘void boost::detail::graph::brandes_betweenness_centrality_dispatch2(const Graph&, CentralityMap, EdgeCentralityMap, WeightMap, VertexIndexMap) [with Graph = boost::adjacency_list >, boost::property > >; CentralityMap = boost::vec_adj_list_vertex_property_map >, boost::property > >, boost::adjacency_list >, boost::property > >*, double, double&, boost::vertex_centrality_t>; EdgeCentralityMap = boost::adj_list_edge_property_map >, boost::edge_centrality_t>; WeightMap = boost::adj_list_edge_property_map >, boost::edge_weight_t>; VertexIndexMap = boost::vec_adj_list_vertex_id_map >, long unsigned int>]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/betweenness_centrality.hpp:517:57: required from ‘static void boost::detail::graph::brandes_betweenness_centrality_dispatch1::run(const Graph&, CentralityMap, EdgeCentralityMap, VertexIndexMap, WeightMap) [with Graph = boost::adjacency_list >, boost::property > >; CentralityMap = boost::vec_adj_list_vertex_property_map >, boost::property > >, boost::adjacency_list >, boost::property > >*, double, double&, boost::vertex_centrality_t>; EdgeCentralityMap = boost::adj_list_edge_property_map >, boost::edge_centrality_t>; VertexIndexMap = boost::vec_adj_list_vertex_id_map >, long unsigned int>; WeightMap = boost::adj_list_edge_property_map >, boost::edge_weight_t>]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/betweenness_centrality.hpp:558:71: required from ‘void boost::brandes_betweenness_centrality(const Graph&, const bgl_named_params&, typename enable_if_c::traversal_category>::value, graph::detail::no_parameter>::type) [with Graph = adjacency_list >, property > >; Param = adj_list_edge_property_map >, edge_weight_t>; Tag = edge_weight_t; Rest = bgl_named_params >, edge_centrality_t>, edge_centrality_t, bgl_named_params >, property > >, adjacency_list >, property > >*, double, double&, vertex_centrality_t>, vertex_centrality_t, no_property> >; typename enable_if_c::traversal_category>::value, graph::detail::no_parameter>::type = graph::detail::no_parameter; typename graph_traits::traversal_category = undir_adj_list_traversal_tag]’ bbc.cpp:67:33: required from here /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::EqualityComparable<__gnu_cxx::__normal_iterator, std::allocator > >*, std::vector, std::allocator > >, std::allocator, std::allocator > > > > > >]’ 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ^ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements, std::allocator > >*, std::vector, std::allocator > >, std::allocator, std::allocator > > > > > > >]’: /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:512:7: required from ‘struct boost::InputIterator<__gnu_cxx::__normal_iterator, std::allocator > >*, std::vector, std::allocator > >, std::allocator, std::allocator > > > > > >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:540:3: required from ‘struct boost::ForwardIterator<__gnu_cxx::__normal_iterator, std::allocator > >*, std::vector, std::allocator > >, std::allocator, std::allocator > > > > > >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:568:3: required from ‘struct boost::BidirectionalIterator<__gnu_cxx::__normal_iterator, std::allocator > >*, std::vector, std::allocator > >, std::allocator, std::allocator > > > > > >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:597:3: required from ‘struct boost::RandomAccessIterator<__gnu_cxx::__normal_iterator, std::allocator > >*, std::vector, std::allocator > >, std::allocator, std::allocator > > > > > >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:597:3: required from ‘struct boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator, std::allocator > >*, std::vector, std::allocator > >, std::allocator, std::allocator > > > > > >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:32:62: [ skipping 3 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_, std::allocator > >*, std::vector, std::allocator > >, std::allocator, std::allocator > > > > > >)>’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/property_map/property_map.hpp:354:5: required from ‘boost::iterator_property_map >::value_type, typename std::iterator_traits< >::reference> boost::make_iterator_property_map(RAIter, ID) [with RAIter = __gnu_cxx::__normal_iterator, std::allocator > >*, std::vector, std::allocator > >, std::allocator, std::allocator > > > > >; ID = vec_adj_list_vertex_id_map >, long unsigned int>; typename std::iterator_traits< >::value_type = std::vector, std::allocator > >; typename std::iterator_traits< >::reference = std::vector, std::allocator > >&]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/betweenness_centrality.hpp:469:43: required from ‘void boost::detail::graph::brandes_betweenness_centrality_dispatch2(const Graph&, CentralityMap, EdgeCentralityMap, WeightMap, VertexIndexMap) [with Graph = boost::adjacency_list >, boost::property > >; CentralityMap = boost::vec_adj_list_vertex_property_map >, boost::property > >, boost::adjacency_list >, boost::property > >*, double, double&, boost::vertex_centrality_t>; EdgeCentralityMap = boost::adj_list_edge_property_map >, boost::edge_centrality_t>; WeightMap = boost::adj_list_edge_property_map >, boost::edge_weight_t>; VertexIndexMap = boost::vec_adj_list_vertex_id_map >, long unsigned int>]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/betweenness_centrality.hpp:517:57: required from ‘static void boost::detail::graph::brandes_betweenness_centrality_dispatch1::run(const Graph&, CentralityMap, EdgeCentralityMap, VertexIndexMap, WeightMap) [with Graph = boost::adjacency_list >, boost::property > >; CentralityMap = boost::vec_adj_list_vertex_property_map >, boost::property > >, boost::adjacency_list >, boost::property > >*, double, double&, boost::vertex_centrality_t>; EdgeCentralityMap = boost::adj_list_edge_property_map >, boost::edge_centrality_t>; VertexIndexMap = boost::vec_adj_list_vertex_id_map >, long unsigned int>; WeightMap = boost::adj_list_edge_property_map >, boost::edge_weight_t>]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/betweenness_centrality.hpp:558:71: required from ‘void boost::brandes_betweenness_centrality(const Graph&, const bgl_named_params&, typename enable_if_c::traversal_category>::value, graph::detail::no_parameter>::type) [with Graph = adjacency_list >, property > >; Param = adj_list_edge_property_map >, edge_weight_t>; Tag = edge_weight_t; Rest = bgl_named_params >, edge_centrality_t>, edge_centrality_t, bgl_named_params >, property > >, adjacency_list >, property > >*, double, double&, vertex_centrality_t>, vertex_centrality_t, no_property> >; typename enable_if_c::traversal_category>::value, graph::detail::no_parameter>::type = graph::detail::no_parameter; typename graph_traits::traversal_category = undir_adj_list_traversal_tag]’ bbc.cpp:67:33: required from here /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::InputIterator<__gnu_cxx::__normal_iterator, std::allocator > >*, std::vector, std::allocator > >, std::allocator, std::allocator > > > > > >]’ 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ^ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements, std::allocator > >*, std::vector, std::allocator > >, std::allocator, std::allocator > > > > > > >]’: /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:543:7: required from ‘struct boost::ForwardIterator<__gnu_cxx::__normal_iterator, std::allocator > >*, std::vector, std::allocator > >, std::allocator, std::allocator > > > > > >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:568:3: required from ‘struct boost::BidirectionalIterator<__gnu_cxx::__normal_iterator, std::allocator > >*, std::vector, std::allocator > >, std::allocator, std::allocator > > > > > >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:597:3: required from ‘struct boost::RandomAccessIterator<__gnu_cxx::__normal_iterator, std::allocator > >*, std::vector, std::allocator > >, std::allocator, std::allocator > > > > > >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:597:3: required from ‘struct boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator, std::allocator > >*, std::vector, std::allocator > >, std::allocator, std::allocator > > > > > >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator, std::allocator > >*, std::vector, std::allocator > >, std::allocator, std::allocator > > > > > >]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:42:5: [ skipping 2 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_, std::allocator > >*, std::vector, std::allocator > >, std::allocator, std::allocator > > > > > >)>’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/property_map/property_map.hpp:354:5: required from ‘boost::iterator_property_map >::value_type, typename std::iterator_traits< >::reference> boost::make_iterator_property_map(RAIter, ID) [with RAIter = __gnu_cxx::__normal_iterator, std::allocator > >*, std::vector, std::allocator > >, std::allocator, std::allocator > > > > >; ID = vec_adj_list_vertex_id_map >, long unsigned int>; typename std::iterator_traits< >::value_type = std::vector, std::allocator > >; typename std::iterator_traits< >::reference = std::vector, std::allocator > >&]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/betweenness_centrality.hpp:469:43: required from ‘void boost::detail::graph::brandes_betweenness_centrality_dispatch2(const Graph&, CentralityMap, EdgeCentralityMap, WeightMap, VertexIndexMap) [with Graph = boost::adjacency_list >, boost::property > >; CentralityMap = boost::vec_adj_list_vertex_property_map >, boost::property > >, boost::adjacency_list >, boost::property > >*, double, double&, boost::vertex_centrality_t>; EdgeCentralityMap = boost::adj_list_edge_property_map >, boost::edge_centrality_t>; WeightMap = boost::adj_list_edge_property_map >, boost::edge_weight_t>; VertexIndexMap = boost::vec_adj_list_vertex_id_map >, long unsigned int>]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/betweenness_centrality.hpp:517:57: required from ‘static void boost::detail::graph::brandes_betweenness_centrality_dispatch1::run(const Graph&, CentralityMap, EdgeCentralityMap, VertexIndexMap, WeightMap) [with Graph = boost::adjacency_list >, boost::property > >; CentralityMap = boost::vec_adj_list_vertex_property_map >, boost::property > >, boost::adjacency_list >, boost::property > >*, double, double&, boost::vertex_centrality_t>; EdgeCentralityMap = boost::adj_list_edge_property_map >, boost::edge_centrality_t>; VertexIndexMap = boost::vec_adj_list_vertex_id_map >, long unsigned int>; WeightMap = boost::adj_list_edge_property_map >, boost::edge_weight_t>]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/betweenness_centrality.hpp:558:71: required from ‘void boost::brandes_betweenness_centrality(const Graph&, const bgl_named_params&, typename enable_if_c::traversal_category>::value, graph::detail::no_parameter>::type) [with Graph = adjacency_list >, property > >; Param = adj_list_edge_property_map >, edge_weight_t>; Tag = edge_weight_t; Rest = bgl_named_params >, edge_centrality_t>, edge_centrality_t, bgl_named_params >, property > >, adjacency_list >, property > >*, double, double&, vertex_centrality_t>, vertex_centrality_t, no_property> >; typename enable_if_c::traversal_category>::value, graph::detail::no_parameter>::type = graph::detail::no_parameter; typename graph_traits::traversal_category = undir_adj_list_traversal_tag]’ bbc.cpp:67:33: required from here /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::ForwardIterator<__gnu_cxx::__normal_iterator, std::allocator > >*, std::vector, std::allocator > >, std::allocator, std::allocator > > > > > >]’ 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ^ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements, std::allocator > >*, std::vector, std::allocator > >, std::allocator, std::allocator > > > > > > >]’: /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:571:7: required from ‘struct boost::BidirectionalIterator<__gnu_cxx::__normal_iterator, std::allocator > >*, std::vector, std::allocator > >, std::allocator, std::allocator > > > > > >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:597:3: required from ‘struct boost::RandomAccessIterator<__gnu_cxx::__normal_iterator, std::allocator > >*, std::vector, std::allocator > >, std::allocator, std::allocator > > > > > >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:597:3: required from ‘struct boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator, std::allocator > >*, std::vector, std::allocator > >, std::allocator, std::allocator > > > > > >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator, std::allocator > >*, std::vector, std::allocator > >, std::allocator, std::allocator > > > > > >]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:42:5: [ skipping 2 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_, std::allocator > >*, std::vector, std::allocator > >, std::allocator, std::allocator > > > > > >)>’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/property_map/property_map.hpp:354:5: required from ‘boost::iterator_property_map >::value_type, typename std::iterator_traits< >::reference> boost::make_iterator_property_map(RAIter, ID) [with RAIter = __gnu_cxx::__normal_iterator, std::allocator > >*, std::vector, std::allocator > >, std::allocator, std::allocator > > > > >; ID = vec_adj_list_vertex_id_map >, long unsigned int>; typename std::iterator_traits< >::value_type = std::vector, std::allocator > >; typename std::iterator_traits< >::reference = std::vector, std::allocator > >&]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/betweenness_centrality.hpp:469:43: required from ‘void boost::detail::graph::brandes_betweenness_centrality_dispatch2(const Graph&, CentralityMap, EdgeCentralityMap, WeightMap, VertexIndexMap) [with Graph = boost::adjacency_list >, boost::property > >; CentralityMap = boost::vec_adj_list_vertex_property_map >, boost::property > >, boost::adjacency_list >, boost::property > >*, double, double&, boost::vertex_centrality_t>; EdgeCentralityMap = boost::adj_list_edge_property_map >, boost::edge_centrality_t>; WeightMap = boost::adj_list_edge_property_map >, boost::edge_weight_t>; VertexIndexMap = boost::vec_adj_list_vertex_id_map >, long unsigned int>]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/betweenness_centrality.hpp:517:57: required from ‘static void boost::detail::graph::brandes_betweenness_centrality_dispatch1::run(const Graph&, CentralityMap, EdgeCentralityMap, VertexIndexMap, WeightMap) [with Graph = boost::adjacency_list >, boost::property > >; CentralityMap = boost::vec_adj_list_vertex_property_map >, boost::property > >, boost::adjacency_list >, boost::property > >*, double, double&, boost::vertex_centrality_t>; EdgeCentralityMap = boost::adj_list_edge_property_map >, boost::edge_centrality_t>; VertexIndexMap = boost::vec_adj_list_vertex_id_map >, long unsigned int>; WeightMap = boost::adj_list_edge_property_map >, boost::edge_weight_t>]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/betweenness_centrality.hpp:558:71: required from ‘void boost::brandes_betweenness_centrality(const Graph&, const bgl_named_params&, typename enable_if_c::traversal_category>::value, graph::detail::no_parameter>::type) [with Graph = adjacency_list >, property > >; Param = adj_list_edge_property_map >, edge_weight_t>; Tag = edge_weight_t; Rest = bgl_named_params >, edge_centrality_t>, edge_centrality_t, bgl_named_params >, property > >, adjacency_list >, property > >*, double, double&, vertex_centrality_t>, vertex_centrality_t, no_property> >; typename enable_if_c::traversal_category>::value, graph::detail::no_parameter>::type = graph::detail::no_parameter; typename graph_traits::traversal_category = undir_adj_list_traversal_tag]’ bbc.cpp:67:33: required from here /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::BidirectionalIterator<__gnu_cxx::__normal_iterator, std::allocator > >*, std::vector, std::allocator > >, std::allocator, std::allocator > > > > > >]’ 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ^ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements, std::allocator > >*, std::vector, std::allocator > >, std::allocator, std::allocator > > > > > > >]’: /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:253:5: required from ‘struct boost::Comparable<__gnu_cxx::__normal_iterator, std::allocator > >*, std::vector, std::allocator > >, std::allocator, std::allocator > > > > > >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:597:3: required from ‘struct boost::RandomAccessIterator<__gnu_cxx::__normal_iterator, std::allocator > >*, std::vector, std::allocator > >, std::allocator, std::allocator > > > > > >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:597:3: required from ‘struct boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator, std::allocator > >*, std::vector, std::allocator > >, std::allocator, std::allocator > > > > > >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator, std::allocator > >*, std::vector, std::allocator > >, std::allocator, std::allocator > > > > > >]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:42:5: [ skipping 2 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_, std::allocator > >*, std::vector, std::allocator > >, std::allocator, std::allocator > > > > > >)>’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/property_map/property_map.hpp:354:5: required from ‘boost::iterator_property_map >::value_type, typename std::iterator_traits< >::reference> boost::make_iterator_property_map(RAIter, ID) [with RAIter = __gnu_cxx::__normal_iterator, std::allocator > >*, std::vector, std::allocator > >, std::allocator, std::allocator > > > > >; ID = vec_adj_list_vertex_id_map >, long unsigned int>; typename std::iterator_traits< >::value_type = std::vector, std::allocator > >; typename std::iterator_traits< >::reference = std::vector, std::allocator > >&]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/betweenness_centrality.hpp:469:43: required from ‘void boost::detail::graph::brandes_betweenness_centrality_dispatch2(const Graph&, CentralityMap, EdgeCentralityMap, WeightMap, VertexIndexMap) [with Graph = boost::adjacency_list >, boost::property > >; CentralityMap = boost::vec_adj_list_vertex_property_map >, boost::property > >, boost::adjacency_list >, boost::property > >*, double, double&, boost::vertex_centrality_t>; EdgeCentralityMap = boost::adj_list_edge_property_map >, boost::edge_centrality_t>; WeightMap = boost::adj_list_edge_property_map >, boost::edge_weight_t>; VertexIndexMap = boost::vec_adj_list_vertex_id_map >, long unsigned int>]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/betweenness_centrality.hpp:517:57: required from ‘static void boost::detail::graph::brandes_betweenness_centrality_dispatch1::run(const Graph&, CentralityMap, EdgeCentralityMap, VertexIndexMap, WeightMap) [with Graph = boost::adjacency_list >, boost::property > >; CentralityMap = boost::vec_adj_list_vertex_property_map >, boost::property > >, boost::adjacency_list >, boost::property > >*, double, double&, boost::vertex_centrality_t>; EdgeCentralityMap = boost::adj_list_edge_property_map >, boost::edge_centrality_t>; VertexIndexMap = boost::vec_adj_list_vertex_id_map >, long unsigned int>; WeightMap = boost::adj_list_edge_property_map >, boost::edge_weight_t>]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/betweenness_centrality.hpp:558:71: required from ‘void boost::brandes_betweenness_centrality(const Graph&, const bgl_named_params&, typename enable_if_c::traversal_category>::value, graph::detail::no_parameter>::type) [with Graph = adjacency_list >, property > >; Param = adj_list_edge_property_map >, edge_weight_t>; Tag = edge_weight_t; Rest = bgl_named_params >, edge_centrality_t>, edge_centrality_t, bgl_named_params >, property > >, adjacency_list >, property > >*, double, double&, vertex_centrality_t>, vertex_centrality_t, no_property> >; typename enable_if_c::traversal_category>::value, graph::detail::no_parameter>::type = graph::detail::no_parameter; typename graph_traits::traversal_category = undir_adj_list_traversal_tag]’ bbc.cpp:67:33: required from here /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::Comparable<__gnu_cxx::__normal_iterator, std::allocator > >*, std::vector, std::allocator > >, std::allocator, std::allocator > > > > > >]’ 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ^ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements, std::allocator > >*, std::vector, std::allocator > >, std::allocator, std::allocator > > > > > > >]’: /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:601:7: required from ‘struct boost::RandomAccessIterator<__gnu_cxx::__normal_iterator, std::allocator > >*, std::vector, std::allocator > >, std::allocator, std::allocator > > > > > >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:597:3: required from ‘struct boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator, std::allocator > >*, std::vector, std::allocator > >, std::allocator, std::allocator > > > > > >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator, std::allocator > >*, std::vector, std::allocator > >, std::allocator, std::allocator > > > > > >]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied, std::allocator > >*, std::vector, std::allocator > >, std::allocator, std::allocator > > > > > > >::value’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied, std::allocator > >*, std::vector, std::allocator > >, std::allocator, std::allocator > > > > > > >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_, std::allocator > >*, std::vector, std::allocator > >, std::allocator, std::allocator > > > > > >)>’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/property_map/property_map.hpp:354:5: required from ‘boost::iterator_property_map >::value_type, typename std::iterator_traits< >::reference> boost::make_iterator_property_map(RAIter, ID) [with RAIter = __gnu_cxx::__normal_iterator, std::allocator > >*, std::vector, std::allocator > >, std::allocator, std::allocator > > > > >; ID = vec_adj_list_vertex_id_map >, long unsigned int>; typename std::iterator_traits< >::value_type = std::vector, std::allocator > >; typename std::iterator_traits< >::reference = std::vector, std::allocator > >&]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/betweenness_centrality.hpp:469:43: required from ‘void boost::detail::graph::brandes_betweenness_centrality_dispatch2(const Graph&, CentralityMap, EdgeCentralityMap, WeightMap, VertexIndexMap) [with Graph = boost::adjacency_list >, boost::property > >; CentralityMap = boost::vec_adj_list_vertex_property_map >, boost::property > >, boost::adjacency_list >, boost::property > >*, double, double&, boost::vertex_centrality_t>; EdgeCentralityMap = boost::adj_list_edge_property_map >, boost::edge_centrality_t>; WeightMap = boost::adj_list_edge_property_map >, boost::edge_weight_t>; VertexIndexMap = boost::vec_adj_list_vertex_id_map >, long unsigned int>]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/betweenness_centrality.hpp:517:57: required from ‘static void boost::detail::graph::brandes_betweenness_centrality_dispatch1::run(const Graph&, CentralityMap, EdgeCentralityMap, VertexIndexMap, WeightMap) [with Graph = boost::adjacency_list >, boost::property > >; CentralityMap = boost::vec_adj_list_vertex_property_map >, boost::property > >, boost::adjacency_list >, boost::property > >*, double, double&, boost::vertex_centrality_t>; EdgeCentralityMap = boost::adj_list_edge_property_map >, boost::edge_centrality_t>; VertexIndexMap = boost::vec_adj_list_vertex_id_map >, long unsigned int>; WeightMap = boost::adj_list_edge_property_map >, boost::edge_weight_t>]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/betweenness_centrality.hpp:558:71: required from ‘void boost::brandes_betweenness_centrality(const Graph&, const bgl_named_params&, typename enable_if_c::traversal_category>::value, graph::detail::no_parameter>::type) [with Graph = adjacency_list >, property > >; Param = adj_list_edge_property_map >, edge_weight_t>; Tag = edge_weight_t; Rest = bgl_named_params >, edge_centrality_t>, edge_centrality_t, bgl_named_params >, property > >, adjacency_list >, property > >*, double, double&, vertex_centrality_t>, vertex_centrality_t, no_property> >; typename enable_if_c::traversal_category>::value, graph::detail::no_parameter>::type = graph::detail::no_parameter; typename graph_traits::traversal_category = undir_adj_list_traversal_tag]’ bbc.cpp:67:33: required from here /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::RandomAccessIterator<__gnu_cxx::__normal_iterator, std::allocator > >*, std::vector, std::allocator > >, std::allocator, std::allocator > > > > > >]’ 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ^ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator, std::allocator > >*, std::vector, std::allocator > >, std::allocator, std::allocator > > > > > >]’: /home/omnipath/local/R/4.4-3.20/BH/include/boost/property_map/property_map.hpp:354:5: required from ‘boost::iterator_property_map >::value_type, typename std::iterator_traits< >::reference> boost::make_iterator_property_map(RAIter, ID) [with RAIter = __gnu_cxx::__normal_iterator, std::allocator > >*, std::vector, std::allocator > >, std::allocator, std::allocator > > > > >; ID = vec_adj_list_vertex_id_map >, long unsigned int>; typename std::iterator_traits< >::value_type = std::vector, std::allocator > >; typename std::iterator_traits< >::reference = std::vector, std::allocator > >&]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/betweenness_centrality.hpp:469:43: required from ‘void boost::detail::graph::brandes_betweenness_centrality_dispatch2(const Graph&, CentralityMap, EdgeCentralityMap, WeightMap, VertexIndexMap) [with Graph = boost::adjacency_list >, boost::property > >; CentralityMap = boost::vec_adj_list_vertex_property_map >, boost::property > >, boost::adjacency_list >, boost::property > >*, double, double&, boost::vertex_centrality_t>; EdgeCentralityMap = boost::adj_list_edge_property_map >, boost::edge_centrality_t>; WeightMap = boost::adj_list_edge_property_map >, boost::edge_weight_t>; VertexIndexMap = boost::vec_adj_list_vertex_id_map >, long unsigned int>]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/betweenness_centrality.hpp:517:57: required from ‘static void boost::detail::graph::brandes_betweenness_centrality_dispatch1::run(const Graph&, CentralityMap, EdgeCentralityMap, VertexIndexMap, WeightMap) [with Graph = boost::adjacency_list >, boost::property > >; CentralityMap = boost::vec_adj_list_vertex_property_map >, boost::property > >, boost::adjacency_list >, boost::property > >*, double, double&, boost::vertex_centrality_t>; EdgeCentralityMap = boost::adj_list_edge_property_map >, boost::edge_centrality_t>; VertexIndexMap = boost::vec_adj_list_vertex_id_map >, long unsigned int>; WeightMap = boost::adj_list_edge_property_map >, boost::edge_weight_t>]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/betweenness_centrality.hpp:558:71: required from ‘void boost::brandes_betweenness_centrality(const Graph&, const bgl_named_params&, typename enable_if_c::traversal_category>::value, graph::detail::no_parameter>::type) [with Graph = adjacency_list >, property > >; Param = adj_list_edge_property_map >, edge_weight_t>; Tag = edge_weight_t; Rest = bgl_named_params >, edge_centrality_t>, edge_centrality_t, bgl_named_params >, property > >, adjacency_list >, property > >*, double, double&, vertex_centrality_t>, vertex_centrality_t, no_property> >; typename enable_if_c::traversal_category>::value, graph::detail::no_parameter>::type = graph::detail::no_parameter; typename graph_traits::traversal_category = undir_adj_list_traversal_tag]’ bbc.cpp:67:33: required from here /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ In file included from /home/omnipath/local/R/4.4-3.20/BH/include/boost/preprocessor/repetition/enum_binary_params.hpp:15, from /home/omnipath/local/R/4.4-3.20/BH/include/boost/utility/base_from_member.hpp:15, from /home/omnipath/local/R/4.4-3.20/BH/include/boost/utility.hpp:15, from RBGL.hpp:16: /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:597:17: note: in a call to non-static member function ‘boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator, std::allocator > >*, std::vector, std::allocator > >, std::allocator, std::allocator > > > > > >::~RandomAccessIteratorConcept()’ 597 | BOOST_concept(RandomAccessIterator,(TT)) | ^~~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/preprocessor/cat.hpp:29:34: note: in definition of macro ‘BOOST_PP_CAT_I’ 29 | # define BOOST_PP_CAT_I(a, b) a ## b | ^ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/concept_def.hpp:23:12: note: in expansion of macro ‘BOOST_PP_CAT’ 23 | struct BOOST_PP_CAT(name,Concept) \ | ^~~~~~~~~~~~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:597:3: note: in expansion of macro ‘BOOST_concept’ 597 | BOOST_concept(RandomAccessIterator,(TT)) | ^~~~~~~~~~~~~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements > > > >]’: /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:145:5: required from ‘struct boost::Assignable<__gnu_cxx::__normal_iterator > > >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:502:3: required from ‘struct boost::InputIterator<__gnu_cxx::__normal_iterator > > >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:540:3: required from ‘struct boost::ForwardIterator<__gnu_cxx::__normal_iterator > > >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:568:3: required from ‘struct boost::BidirectionalIterator<__gnu_cxx::__normal_iterator > > >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:597:3: required from ‘struct boost::RandomAccessIterator<__gnu_cxx::__normal_iterator > > >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:597:3: [ skipping 4 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_ > > >)>’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/property_map/property_map.hpp:354:5: required from ‘boost::iterator_property_map >::value_type, typename std::iterator_traits< >::reference> boost::make_iterator_property_map(RAIter, ID) [with RAIter = __gnu_cxx::__normal_iterator > >; ID = vec_adj_list_vertex_id_map >, long unsigned int>; typename std::iterator_traits< >::value_type = double; typename std::iterator_traits< >::reference = double&]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/betweenness_centrality.hpp:470:43: required from ‘void boost::detail::graph::brandes_betweenness_centrality_dispatch2(const Graph&, CentralityMap, EdgeCentralityMap, WeightMap, VertexIndexMap) [with Graph = boost::adjacency_list >, boost::property > >; CentralityMap = boost::vec_adj_list_vertex_property_map >, boost::property > >, boost::adjacency_list >, boost::property > >*, double, double&, boost::vertex_centrality_t>; EdgeCentralityMap = boost::adj_list_edge_property_map >, boost::edge_centrality_t>; WeightMap = boost::adj_list_edge_property_map >, boost::edge_weight_t>; VertexIndexMap = boost::vec_adj_list_vertex_id_map >, long unsigned int>]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/betweenness_centrality.hpp:517:57: required from ‘static void boost::detail::graph::brandes_betweenness_centrality_dispatch1::run(const Graph&, CentralityMap, EdgeCentralityMap, VertexIndexMap, WeightMap) [with Graph = boost::adjacency_list >, boost::property > >; CentralityMap = boost::vec_adj_list_vertex_property_map >, boost::property > >, boost::adjacency_list >, boost::property > >*, double, double&, boost::vertex_centrality_t>; EdgeCentralityMap = boost::adj_list_edge_property_map >, boost::edge_centrality_t>; VertexIndexMap = boost::vec_adj_list_vertex_id_map >, long unsigned int>; WeightMap = boost::adj_list_edge_property_map >, boost::edge_weight_t>]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/betweenness_centrality.hpp:558:71: required from ‘void boost::brandes_betweenness_centrality(const Graph&, const bgl_named_params&, typename enable_if_c::traversal_category>::value, graph::detail::no_parameter>::type) [with Graph = adjacency_list >, property > >; Param = adj_list_edge_property_map >, edge_weight_t>; Tag = edge_weight_t; Rest = bgl_named_params >, edge_centrality_t>, edge_centrality_t, bgl_named_params >, property > >, adjacency_list >, property > >*, double, double&, vertex_centrality_t>, vertex_centrality_t, no_property> >; typename enable_if_c::traversal_category>::value, graph::detail::no_parameter>::type = graph::detail::no_parameter; typename graph_traits::traversal_category = undir_adj_list_traversal_tag]’ bbc.cpp:67:33: required from here /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::Assignable<__gnu_cxx::__normal_iterator > > >]’ 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ^ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements > > > >]’: /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:233:5: required from ‘struct boost::EqualityComparable<__gnu_cxx::__normal_iterator > > >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:502:3: required from ‘struct boost::InputIterator<__gnu_cxx::__normal_iterator > > >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:540:3: required from ‘struct boost::ForwardIterator<__gnu_cxx::__normal_iterator > > >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:568:3: required from ‘struct boost::BidirectionalIterator<__gnu_cxx::__normal_iterator > > >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:597:3: required from ‘struct boost::RandomAccessIterator<__gnu_cxx::__normal_iterator > > >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:597:3: [ skipping 4 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_ > > >)>’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/property_map/property_map.hpp:354:5: required from ‘boost::iterator_property_map >::value_type, typename std::iterator_traits< >::reference> boost::make_iterator_property_map(RAIter, ID) [with RAIter = __gnu_cxx::__normal_iterator > >; ID = vec_adj_list_vertex_id_map >, long unsigned int>; typename std::iterator_traits< >::value_type = double; typename std::iterator_traits< >::reference = double&]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/betweenness_centrality.hpp:470:43: required from ‘void boost::detail::graph::brandes_betweenness_centrality_dispatch2(const Graph&, CentralityMap, EdgeCentralityMap, WeightMap, VertexIndexMap) [with Graph = boost::adjacency_list >, boost::property > >; CentralityMap = boost::vec_adj_list_vertex_property_map >, boost::property > >, boost::adjacency_list >, boost::property > >*, double, double&, boost::vertex_centrality_t>; EdgeCentralityMap = boost::adj_list_edge_property_map >, boost::edge_centrality_t>; WeightMap = boost::adj_list_edge_property_map >, boost::edge_weight_t>; VertexIndexMap = boost::vec_adj_list_vertex_id_map >, long unsigned int>]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/betweenness_centrality.hpp:517:57: required from ‘static void boost::detail::graph::brandes_betweenness_centrality_dispatch1::run(const Graph&, CentralityMap, EdgeCentralityMap, VertexIndexMap, WeightMap) [with Graph = boost::adjacency_list >, boost::property > >; CentralityMap = boost::vec_adj_list_vertex_property_map >, boost::property > >, boost::adjacency_list >, boost::property > >*, double, double&, boost::vertex_centrality_t>; EdgeCentralityMap = boost::adj_list_edge_property_map >, boost::edge_centrality_t>; VertexIndexMap = boost::vec_adj_list_vertex_id_map >, long unsigned int>; WeightMap = boost::adj_list_edge_property_map >, boost::edge_weight_t>]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/betweenness_centrality.hpp:558:71: required from ‘void boost::brandes_betweenness_centrality(const Graph&, const bgl_named_params&, typename enable_if_c::traversal_category>::value, graph::detail::no_parameter>::type) [with Graph = adjacency_list >, property > >; Param = adj_list_edge_property_map >, edge_weight_t>; Tag = edge_weight_t; Rest = bgl_named_params >, edge_centrality_t>, edge_centrality_t, bgl_named_params >, property > >, adjacency_list >, property > >*, double, double&, vertex_centrality_t>, vertex_centrality_t, no_property> >; typename enable_if_c::traversal_category>::value, graph::detail::no_parameter>::type = graph::detail::no_parameter; typename graph_traits::traversal_category = undir_adj_list_traversal_tag]’ bbc.cpp:67:33: required from here /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::EqualityComparable<__gnu_cxx::__normal_iterator > > >]’ 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ^ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements > > > >]’: /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:512:7: required from ‘struct boost::InputIterator<__gnu_cxx::__normal_iterator > > >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:540:3: required from ‘struct boost::ForwardIterator<__gnu_cxx::__normal_iterator > > >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:568:3: required from ‘struct boost::BidirectionalIterator<__gnu_cxx::__normal_iterator > > >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:597:3: required from ‘struct boost::RandomAccessIterator<__gnu_cxx::__normal_iterator > > >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:597:3: required from ‘struct boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator > > >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:32:62: [ skipping 3 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_ > > >)>’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/property_map/property_map.hpp:354:5: required from ‘boost::iterator_property_map >::value_type, typename std::iterator_traits< >::reference> boost::make_iterator_property_map(RAIter, ID) [with RAIter = __gnu_cxx::__normal_iterator > >; ID = vec_adj_list_vertex_id_map >, long unsigned int>; typename std::iterator_traits< >::value_type = double; typename std::iterator_traits< >::reference = double&]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/betweenness_centrality.hpp:470:43: required from ‘void boost::detail::graph::brandes_betweenness_centrality_dispatch2(const Graph&, CentralityMap, EdgeCentralityMap, WeightMap, VertexIndexMap) [with Graph = boost::adjacency_list >, boost::property > >; CentralityMap = boost::vec_adj_list_vertex_property_map >, boost::property > >, boost::adjacency_list >, boost::property > >*, double, double&, boost::vertex_centrality_t>; EdgeCentralityMap = boost::adj_list_edge_property_map >, boost::edge_centrality_t>; WeightMap = boost::adj_list_edge_property_map >, boost::edge_weight_t>; VertexIndexMap = boost::vec_adj_list_vertex_id_map >, long unsigned int>]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/betweenness_centrality.hpp:517:57: required from ‘static void boost::detail::graph::brandes_betweenness_centrality_dispatch1::run(const Graph&, CentralityMap, EdgeCentralityMap, VertexIndexMap, WeightMap) [with Graph = boost::adjacency_list >, boost::property > >; CentralityMap = boost::vec_adj_list_vertex_property_map >, boost::property > >, boost::adjacency_list >, boost::property > >*, double, double&, boost::vertex_centrality_t>; EdgeCentralityMap = boost::adj_list_edge_property_map >, boost::edge_centrality_t>; VertexIndexMap = boost::vec_adj_list_vertex_id_map >, long unsigned int>; WeightMap = boost::adj_list_edge_property_map >, boost::edge_weight_t>]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/betweenness_centrality.hpp:558:71: required from ‘void boost::brandes_betweenness_centrality(const Graph&, const bgl_named_params&, typename enable_if_c::traversal_category>::value, graph::detail::no_parameter>::type) [with Graph = adjacency_list >, property > >; Param = adj_list_edge_property_map >, edge_weight_t>; Tag = edge_weight_t; Rest = bgl_named_params >, edge_centrality_t>, edge_centrality_t, bgl_named_params >, property > >, adjacency_list >, property > >*, double, double&, vertex_centrality_t>, vertex_centrality_t, no_property> >; typename enable_if_c::traversal_category>::value, graph::detail::no_parameter>::type = graph::detail::no_parameter; typename graph_traits::traversal_category = undir_adj_list_traversal_tag]’ bbc.cpp:67:33: required from here /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::InputIterator<__gnu_cxx::__normal_iterator > > >]’ 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ^ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements > > > >]’: /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:543:7: required from ‘struct boost::ForwardIterator<__gnu_cxx::__normal_iterator > > >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:568:3: required from ‘struct boost::BidirectionalIterator<__gnu_cxx::__normal_iterator > > >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:597:3: required from ‘struct boost::RandomAccessIterator<__gnu_cxx::__normal_iterator > > >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:597:3: required from ‘struct boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator > > >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator > > >]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:42:5: [ skipping 2 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_ > > >)>’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/property_map/property_map.hpp:354:5: required from ‘boost::iterator_property_map >::value_type, typename std::iterator_traits< >::reference> boost::make_iterator_property_map(RAIter, ID) [with RAIter = __gnu_cxx::__normal_iterator > >; ID = vec_adj_list_vertex_id_map >, long unsigned int>; typename std::iterator_traits< >::value_type = double; typename std::iterator_traits< >::reference = double&]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/betweenness_centrality.hpp:470:43: required from ‘void boost::detail::graph::brandes_betweenness_centrality_dispatch2(const Graph&, CentralityMap, EdgeCentralityMap, WeightMap, VertexIndexMap) [with Graph = boost::adjacency_list >, boost::property > >; CentralityMap = boost::vec_adj_list_vertex_property_map >, boost::property > >, boost::adjacency_list >, boost::property > >*, double, double&, boost::vertex_centrality_t>; EdgeCentralityMap = boost::adj_list_edge_property_map >, boost::edge_centrality_t>; WeightMap = boost::adj_list_edge_property_map >, boost::edge_weight_t>; VertexIndexMap = boost::vec_adj_list_vertex_id_map >, long unsigned int>]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/betweenness_centrality.hpp:517:57: required from ‘static void boost::detail::graph::brandes_betweenness_centrality_dispatch1::run(const Graph&, CentralityMap, EdgeCentralityMap, VertexIndexMap, WeightMap) [with Graph = boost::adjacency_list >, boost::property > >; CentralityMap = boost::vec_adj_list_vertex_property_map >, boost::property > >, boost::adjacency_list >, boost::property > >*, double, double&, boost::vertex_centrality_t>; EdgeCentralityMap = boost::adj_list_edge_property_map >, boost::edge_centrality_t>; VertexIndexMap = boost::vec_adj_list_vertex_id_map >, long unsigned int>; WeightMap = boost::adj_list_edge_property_map >, boost::edge_weight_t>]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/betweenness_centrality.hpp:558:71: required from ‘void boost::brandes_betweenness_centrality(const Graph&, const bgl_named_params&, typename enable_if_c::traversal_category>::value, graph::detail::no_parameter>::type) [with Graph = adjacency_list >, property > >; Param = adj_list_edge_property_map >, edge_weight_t>; Tag = edge_weight_t; Rest = bgl_named_params >, edge_centrality_t>, edge_centrality_t, bgl_named_params >, property > >, adjacency_list >, property > >*, double, double&, vertex_centrality_t>, vertex_centrality_t, no_property> >; typename enable_if_c::traversal_category>::value, graph::detail::no_parameter>::type = graph::detail::no_parameter; typename graph_traits::traversal_category = undir_adj_list_traversal_tag]’ bbc.cpp:67:33: required from here /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::ForwardIterator<__gnu_cxx::__normal_iterator > > >]’ 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ^ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements > > > >]’: /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:571:7: required from ‘struct boost::BidirectionalIterator<__gnu_cxx::__normal_iterator > > >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:597:3: required from ‘struct boost::RandomAccessIterator<__gnu_cxx::__normal_iterator > > >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:597:3: required from ‘struct boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator > > >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator > > >]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:42:5: [ skipping 2 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_ > > >)>’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/property_map/property_map.hpp:354:5: required from ‘boost::iterator_property_map >::value_type, typename std::iterator_traits< >::reference> boost::make_iterator_property_map(RAIter, ID) [with RAIter = __gnu_cxx::__normal_iterator > >; ID = vec_adj_list_vertex_id_map >, long unsigned int>; typename std::iterator_traits< >::value_type = double; typename std::iterator_traits< >::reference = double&]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/betweenness_centrality.hpp:470:43: required from ‘void boost::detail::graph::brandes_betweenness_centrality_dispatch2(const Graph&, CentralityMap, EdgeCentralityMap, WeightMap, VertexIndexMap) [with Graph = boost::adjacency_list >, boost::property > >; CentralityMap = boost::vec_adj_list_vertex_property_map >, boost::property > >, boost::adjacency_list >, boost::property > >*, double, double&, boost::vertex_centrality_t>; EdgeCentralityMap = boost::adj_list_edge_property_map >, boost::edge_centrality_t>; WeightMap = boost::adj_list_edge_property_map >, boost::edge_weight_t>; VertexIndexMap = boost::vec_adj_list_vertex_id_map >, long unsigned int>]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/betweenness_centrality.hpp:517:57: required from ‘static void boost::detail::graph::brandes_betweenness_centrality_dispatch1::run(const Graph&, CentralityMap, EdgeCentralityMap, VertexIndexMap, WeightMap) [with Graph = boost::adjacency_list >, boost::property > >; CentralityMap = boost::vec_adj_list_vertex_property_map >, boost::property > >, boost::adjacency_list >, boost::property > >*, double, double&, boost::vertex_centrality_t>; EdgeCentralityMap = boost::adj_list_edge_property_map >, boost::edge_centrality_t>; VertexIndexMap = boost::vec_adj_list_vertex_id_map >, long unsigned int>; WeightMap = boost::adj_list_edge_property_map >, boost::edge_weight_t>]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/betweenness_centrality.hpp:558:71: required from ‘void boost::brandes_betweenness_centrality(const Graph&, const bgl_named_params&, typename enable_if_c::traversal_category>::value, graph::detail::no_parameter>::type) [with Graph = adjacency_list >, property > >; Param = adj_list_edge_property_map >, edge_weight_t>; Tag = edge_weight_t; Rest = bgl_named_params >, edge_centrality_t>, edge_centrality_t, bgl_named_params >, property > >, adjacency_list >, property > >*, double, double&, vertex_centrality_t>, vertex_centrality_t, no_property> >; typename enable_if_c::traversal_category>::value, graph::detail::no_parameter>::type = graph::detail::no_parameter; typename graph_traits::traversal_category = undir_adj_list_traversal_tag]’ bbc.cpp:67:33: required from here /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::BidirectionalIterator<__gnu_cxx::__normal_iterator > > >]’ 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ^ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements > > > >]’: /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:253:5: required from ‘struct boost::Comparable<__gnu_cxx::__normal_iterator > > >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:597:3: required from ‘struct boost::RandomAccessIterator<__gnu_cxx::__normal_iterator > > >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:597:3: required from ‘struct boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator > > >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator > > >]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:42:5: [ skipping 2 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_ > > >)>’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/property_map/property_map.hpp:354:5: required from ‘boost::iterator_property_map >::value_type, typename std::iterator_traits< >::reference> boost::make_iterator_property_map(RAIter, ID) [with RAIter = __gnu_cxx::__normal_iterator > >; ID = vec_adj_list_vertex_id_map >, long unsigned int>; typename std::iterator_traits< >::value_type = double; typename std::iterator_traits< >::reference = double&]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/betweenness_centrality.hpp:470:43: required from ‘void boost::detail::graph::brandes_betweenness_centrality_dispatch2(const Graph&, CentralityMap, EdgeCentralityMap, WeightMap, VertexIndexMap) [with Graph = boost::adjacency_list >, boost::property > >; CentralityMap = boost::vec_adj_list_vertex_property_map >, boost::property > >, boost::adjacency_list >, boost::property > >*, double, double&, boost::vertex_centrality_t>; EdgeCentralityMap = boost::adj_list_edge_property_map >, boost::edge_centrality_t>; WeightMap = boost::adj_list_edge_property_map >, boost::edge_weight_t>; VertexIndexMap = boost::vec_adj_list_vertex_id_map >, long unsigned int>]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/betweenness_centrality.hpp:517:57: required from ‘static void boost::detail::graph::brandes_betweenness_centrality_dispatch1::run(const Graph&, CentralityMap, EdgeCentralityMap, VertexIndexMap, WeightMap) [with Graph = boost::adjacency_list >, boost::property > >; CentralityMap = boost::vec_adj_list_vertex_property_map >, boost::property > >, boost::adjacency_list >, boost::property > >*, double, double&, boost::vertex_centrality_t>; EdgeCentralityMap = boost::adj_list_edge_property_map >, boost::edge_centrality_t>; VertexIndexMap = boost::vec_adj_list_vertex_id_map >, long unsigned int>; WeightMap = boost::adj_list_edge_property_map >, boost::edge_weight_t>]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/betweenness_centrality.hpp:558:71: required from ‘void boost::brandes_betweenness_centrality(const Graph&, const bgl_named_params&, typename enable_if_c::traversal_category>::value, graph::detail::no_parameter>::type) [with Graph = adjacency_list >, property > >; Param = adj_list_edge_property_map >, edge_weight_t>; Tag = edge_weight_t; Rest = bgl_named_params >, edge_centrality_t>, edge_centrality_t, bgl_named_params >, property > >, adjacency_list >, property > >*, double, double&, vertex_centrality_t>, vertex_centrality_t, no_property> >; typename enable_if_c::traversal_category>::value, graph::detail::no_parameter>::type = graph::detail::no_parameter; typename graph_traits::traversal_category = undir_adj_list_traversal_tag]’ bbc.cpp:67:33: required from here /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::Comparable<__gnu_cxx::__normal_iterator > > >]’ 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ^ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements > > > >]’: /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:601:7: required from ‘struct boost::RandomAccessIterator<__gnu_cxx::__normal_iterator > > >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:597:3: required from ‘struct boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator > > >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator > > >]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied > > > >::value’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied > > > >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_ > > >)>’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/property_map/property_map.hpp:354:5: required from ‘boost::iterator_property_map >::value_type, typename std::iterator_traits< >::reference> boost::make_iterator_property_map(RAIter, ID) [with RAIter = __gnu_cxx::__normal_iterator > >; ID = vec_adj_list_vertex_id_map >, long unsigned int>; typename std::iterator_traits< >::value_type = double; typename std::iterator_traits< >::reference = double&]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/betweenness_centrality.hpp:470:43: required from ‘void boost::detail::graph::brandes_betweenness_centrality_dispatch2(const Graph&, CentralityMap, EdgeCentralityMap, WeightMap, VertexIndexMap) [with Graph = boost::adjacency_list >, boost::property > >; CentralityMap = boost::vec_adj_list_vertex_property_map >, boost::property > >, boost::adjacency_list >, boost::property > >*, double, double&, boost::vertex_centrality_t>; EdgeCentralityMap = boost::adj_list_edge_property_map >, boost::edge_centrality_t>; WeightMap = boost::adj_list_edge_property_map >, boost::edge_weight_t>; VertexIndexMap = boost::vec_adj_list_vertex_id_map >, long unsigned int>]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/betweenness_centrality.hpp:517:57: required from ‘static void boost::detail::graph::brandes_betweenness_centrality_dispatch1::run(const Graph&, CentralityMap, EdgeCentralityMap, VertexIndexMap, WeightMap) [with Graph = boost::adjacency_list >, boost::property > >; CentralityMap = boost::vec_adj_list_vertex_property_map >, boost::property > >, boost::adjacency_list >, boost::property > >*, double, double&, boost::vertex_centrality_t>; EdgeCentralityMap = boost::adj_list_edge_property_map >, boost::edge_centrality_t>; VertexIndexMap = boost::vec_adj_list_vertex_id_map >, long unsigned int>; WeightMap = boost::adj_list_edge_property_map >, boost::edge_weight_t>]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/betweenness_centrality.hpp:558:71: required from ‘void boost::brandes_betweenness_centrality(const Graph&, const bgl_named_params&, typename enable_if_c::traversal_category>::value, graph::detail::no_parameter>::type) [with Graph = adjacency_list >, property > >; Param = adj_list_edge_property_map >, edge_weight_t>; Tag = edge_weight_t; Rest = bgl_named_params >, edge_centrality_t>, edge_centrality_t, bgl_named_params >, property > >, adjacency_list >, property > >*, double, double&, vertex_centrality_t>, vertex_centrality_t, no_property> >; typename enable_if_c::traversal_category>::value, graph::detail::no_parameter>::type = graph::detail::no_parameter; typename graph_traits::traversal_category = undir_adj_list_traversal_tag]’ bbc.cpp:67:33: required from here /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::RandomAccessIterator<__gnu_cxx::__normal_iterator > > >]’ 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ^ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator > > >]’: /home/omnipath/local/R/4.4-3.20/BH/include/boost/property_map/property_map.hpp:354:5: required from ‘boost::iterator_property_map >::value_type, typename std::iterator_traits< >::reference> boost::make_iterator_property_map(RAIter, ID) [with RAIter = __gnu_cxx::__normal_iterator > >; ID = vec_adj_list_vertex_id_map >, long unsigned int>; typename std::iterator_traits< >::value_type = double; typename std::iterator_traits< >::reference = double&]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/betweenness_centrality.hpp:470:43: required from ‘void boost::detail::graph::brandes_betweenness_centrality_dispatch2(const Graph&, CentralityMap, EdgeCentralityMap, WeightMap, VertexIndexMap) [with Graph = boost::adjacency_list >, boost::property > >; CentralityMap = boost::vec_adj_list_vertex_property_map >, boost::property > >, boost::adjacency_list >, boost::property > >*, double, double&, boost::vertex_centrality_t>; EdgeCentralityMap = boost::adj_list_edge_property_map >, boost::edge_centrality_t>; WeightMap = boost::adj_list_edge_property_map >, boost::edge_weight_t>; VertexIndexMap = boost::vec_adj_list_vertex_id_map >, long unsigned int>]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/betweenness_centrality.hpp:517:57: required from ‘static void boost::detail::graph::brandes_betweenness_centrality_dispatch1::run(const Graph&, CentralityMap, EdgeCentralityMap, VertexIndexMap, WeightMap) [with Graph = boost::adjacency_list >, boost::property > >; CentralityMap = boost::vec_adj_list_vertex_property_map >, boost::property > >, boost::adjacency_list >, boost::property > >*, double, double&, boost::vertex_centrality_t>; EdgeCentralityMap = boost::adj_list_edge_property_map >, boost::edge_centrality_t>; VertexIndexMap = boost::vec_adj_list_vertex_id_map >, long unsigned int>; WeightMap = boost::adj_list_edge_property_map >, boost::edge_weight_t>]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/betweenness_centrality.hpp:558:71: required from ‘void boost::brandes_betweenness_centrality(const Graph&, const bgl_named_params&, typename enable_if_c::traversal_category>::value, graph::detail::no_parameter>::type) [with Graph = adjacency_list >, property > >; Param = adj_list_edge_property_map >, edge_weight_t>; Tag = edge_weight_t; Rest = bgl_named_params >, edge_centrality_t>, edge_centrality_t, bgl_named_params >, property > >, adjacency_list >, property > >*, double, double&, vertex_centrality_t>, vertex_centrality_t, no_property> >; typename enable_if_c::traversal_category>::value, graph::detail::no_parameter>::type = graph::detail::no_parameter; typename graph_traits::traversal_category = undir_adj_list_traversal_tag]’ bbc.cpp:67:33: required from here /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:597:17: note: in a call to non-static member function ‘boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator > > >::~RandomAccessIteratorConcept()’ 597 | BOOST_concept(RandomAccessIterator,(TT)) | ^~~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/preprocessor/cat.hpp:29:34: note: in definition of macro ‘BOOST_PP_CAT_I’ 29 | # define BOOST_PP_CAT_I(a, b) a ## b | ^ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/concept_def.hpp:23:12: note: in expansion of macro ‘BOOST_PP_CAT’ 23 | struct BOOST_PP_CAT(name,Concept) \ | ^~~~~~~~~~~~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:597:3: note: in expansion of macro ‘BOOST_concept’ 597 | BOOST_concept(RandomAccessIterator,(TT)) | ^~~~~~~~~~~~~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements > > > >]’: /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:145:5: required from ‘struct boost::Assignable<__gnu_cxx::__normal_iterator > > >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:502:3: required from ‘struct boost::InputIterator<__gnu_cxx::__normal_iterator > > >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:540:3: required from ‘struct boost::ForwardIterator<__gnu_cxx::__normal_iterator > > >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:568:3: required from ‘struct boost::BidirectionalIterator<__gnu_cxx::__normal_iterator > > >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:597:3: required from ‘struct boost::RandomAccessIterator<__gnu_cxx::__normal_iterator > > >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:597:3: [ skipping 4 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_ > > >)>’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/property_map/property_map.hpp:354:5: required from ‘boost::iterator_property_map >::value_type, typename std::iterator_traits< >::reference> boost::make_iterator_property_map(RAIter, ID) [with RAIter = __gnu_cxx::__normal_iterator > >; ID = vec_adj_list_vertex_id_map >, long unsigned int>; typename std::iterator_traits< >::value_type = long unsigned int; typename std::iterator_traits< >::reference = long unsigned int&]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/betweenness_centrality.hpp:472:43: required from ‘void boost::detail::graph::brandes_betweenness_centrality_dispatch2(const Graph&, CentralityMap, EdgeCentralityMap, WeightMap, VertexIndexMap) [with Graph = boost::adjacency_list >, boost::property > >; CentralityMap = boost::vec_adj_list_vertex_property_map >, boost::property > >, boost::adjacency_list >, boost::property > >*, double, double&, boost::vertex_centrality_t>; EdgeCentralityMap = boost::adj_list_edge_property_map >, boost::edge_centrality_t>; WeightMap = boost::adj_list_edge_property_map >, boost::edge_weight_t>; VertexIndexMap = boost::vec_adj_list_vertex_id_map >, long unsigned int>]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/betweenness_centrality.hpp:517:57: required from ‘static void boost::detail::graph::brandes_betweenness_centrality_dispatch1::run(const Graph&, CentralityMap, EdgeCentralityMap, VertexIndexMap, WeightMap) [with Graph = boost::adjacency_list >, boost::property > >; CentralityMap = boost::vec_adj_list_vertex_property_map >, boost::property > >, boost::adjacency_list >, boost::property > >*, double, double&, boost::vertex_centrality_t>; EdgeCentralityMap = boost::adj_list_edge_property_map >, boost::edge_centrality_t>; VertexIndexMap = boost::vec_adj_list_vertex_id_map >, long unsigned int>; WeightMap = boost::adj_list_edge_property_map >, boost::edge_weight_t>]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/betweenness_centrality.hpp:558:71: required from ‘void boost::brandes_betweenness_centrality(const Graph&, const bgl_named_params&, typename enable_if_c::traversal_category>::value, graph::detail::no_parameter>::type) [with Graph = adjacency_list >, property > >; Param = adj_list_edge_property_map >, edge_weight_t>; Tag = edge_weight_t; Rest = bgl_named_params >, edge_centrality_t>, edge_centrality_t, bgl_named_params >, property > >, adjacency_list >, property > >*, double, double&, vertex_centrality_t>, vertex_centrality_t, no_property> >; typename enable_if_c::traversal_category>::value, graph::detail::no_parameter>::type = graph::detail::no_parameter; typename graph_traits::traversal_category = undir_adj_list_traversal_tag]’ bbc.cpp:67:33: required from here /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::Assignable<__gnu_cxx::__normal_iterator > > >]’ 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ^ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements > > > >]’: /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:233:5: required from ‘struct boost::EqualityComparable<__gnu_cxx::__normal_iterator > > >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:502:3: required from ‘struct boost::InputIterator<__gnu_cxx::__normal_iterator > > >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:540:3: required from ‘struct boost::ForwardIterator<__gnu_cxx::__normal_iterator > > >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:568:3: required from ‘struct boost::BidirectionalIterator<__gnu_cxx::__normal_iterator > > >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:597:3: required from ‘struct boost::RandomAccessIterator<__gnu_cxx::__normal_iterator > > >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:597:3: [ skipping 4 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_ > > >)>’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/property_map/property_map.hpp:354:5: required from ‘boost::iterator_property_map >::value_type, typename std::iterator_traits< >::reference> boost::make_iterator_property_map(RAIter, ID) [with RAIter = __gnu_cxx::__normal_iterator > >; ID = vec_adj_list_vertex_id_map >, long unsigned int>; typename std::iterator_traits< >::value_type = long unsigned int; typename std::iterator_traits< >::reference = long unsigned int&]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/betweenness_centrality.hpp:472:43: required from ‘void boost::detail::graph::brandes_betweenness_centrality_dispatch2(const Graph&, CentralityMap, EdgeCentralityMap, WeightMap, VertexIndexMap) [with Graph = boost::adjacency_list >, boost::property > >; CentralityMap = boost::vec_adj_list_vertex_property_map >, boost::property > >, boost::adjacency_list >, boost::property > >*, double, double&, boost::vertex_centrality_t>; EdgeCentralityMap = boost::adj_list_edge_property_map >, boost::edge_centrality_t>; WeightMap = boost::adj_list_edge_property_map >, boost::edge_weight_t>; VertexIndexMap = boost::vec_adj_list_vertex_id_map >, long unsigned int>]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/betweenness_centrality.hpp:517:57: required from ‘static void boost::detail::graph::brandes_betweenness_centrality_dispatch1::run(const Graph&, CentralityMap, EdgeCentralityMap, VertexIndexMap, WeightMap) [with Graph = boost::adjacency_list >, boost::property > >; CentralityMap = boost::vec_adj_list_vertex_property_map >, boost::property > >, boost::adjacency_list >, boost::property > >*, double, double&, boost::vertex_centrality_t>; EdgeCentralityMap = boost::adj_list_edge_property_map >, boost::edge_centrality_t>; VertexIndexMap = boost::vec_adj_list_vertex_id_map >, long unsigned int>; WeightMap = boost::adj_list_edge_property_map >, boost::edge_weight_t>]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/betweenness_centrality.hpp:558:71: required from ‘void boost::brandes_betweenness_centrality(const Graph&, const bgl_named_params&, typename enable_if_c::traversal_category>::value, graph::detail::no_parameter>::type) [with Graph = adjacency_list >, property > >; Param = adj_list_edge_property_map >, edge_weight_t>; Tag = edge_weight_t; Rest = bgl_named_params >, edge_centrality_t>, edge_centrality_t, bgl_named_params >, property > >, adjacency_list >, property > >*, double, double&, vertex_centrality_t>, vertex_centrality_t, no_property> >; typename enable_if_c::traversal_category>::value, graph::detail::no_parameter>::type = graph::detail::no_parameter; typename graph_traits::traversal_category = undir_adj_list_traversal_tag]’ bbc.cpp:67:33: required from here /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::EqualityComparable<__gnu_cxx::__normal_iterator > > >]’ 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ^ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements > > > >]’: /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:512:7: required from ‘struct boost::InputIterator<__gnu_cxx::__normal_iterator > > >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:540:3: required from ‘struct boost::ForwardIterator<__gnu_cxx::__normal_iterator > > >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:568:3: required from ‘struct boost::BidirectionalIterator<__gnu_cxx::__normal_iterator > > >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:597:3: required from ‘struct boost::RandomAccessIterator<__gnu_cxx::__normal_iterator > > >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:597:3: required from ‘struct boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator > > >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:32:62: [ skipping 3 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_ > > >)>’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/property_map/property_map.hpp:354:5: required from ‘boost::iterator_property_map >::value_type, typename std::iterator_traits< >::reference> boost::make_iterator_property_map(RAIter, ID) [with RAIter = __gnu_cxx::__normal_iterator > >; ID = vec_adj_list_vertex_id_map >, long unsigned int>; typename std::iterator_traits< >::value_type = long unsigned int; typename std::iterator_traits< >::reference = long unsigned int&]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/betweenness_centrality.hpp:472:43: required from ‘void boost::detail::graph::brandes_betweenness_centrality_dispatch2(const Graph&, CentralityMap, EdgeCentralityMap, WeightMap, VertexIndexMap) [with Graph = boost::adjacency_list >, boost::property > >; CentralityMap = boost::vec_adj_list_vertex_property_map >, boost::property > >, boost::adjacency_list >, boost::property > >*, double, double&, boost::vertex_centrality_t>; EdgeCentralityMap = boost::adj_list_edge_property_map >, boost::edge_centrality_t>; WeightMap = boost::adj_list_edge_property_map >, boost::edge_weight_t>; VertexIndexMap = boost::vec_adj_list_vertex_id_map >, long unsigned int>]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/betweenness_centrality.hpp:517:57: required from ‘static void boost::detail::graph::brandes_betweenness_centrality_dispatch1::run(const Graph&, CentralityMap, EdgeCentralityMap, VertexIndexMap, WeightMap) [with Graph = boost::adjacency_list >, boost::property > >; CentralityMap = boost::vec_adj_list_vertex_property_map >, boost::property > >, boost::adjacency_list >, boost::property > >*, double, double&, boost::vertex_centrality_t>; EdgeCentralityMap = boost::adj_list_edge_property_map >, boost::edge_centrality_t>; VertexIndexMap = boost::vec_adj_list_vertex_id_map >, long unsigned int>; WeightMap = boost::adj_list_edge_property_map >, boost::edge_weight_t>]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/betweenness_centrality.hpp:558:71: required from ‘void boost::brandes_betweenness_centrality(const Graph&, const bgl_named_params&, typename enable_if_c::traversal_category>::value, graph::detail::no_parameter>::type) [with Graph = adjacency_list >, property > >; Param = adj_list_edge_property_map >, edge_weight_t>; Tag = edge_weight_t; Rest = bgl_named_params >, edge_centrality_t>, edge_centrality_t, bgl_named_params >, property > >, adjacency_list >, property > >*, double, double&, vertex_centrality_t>, vertex_centrality_t, no_property> >; typename enable_if_c::traversal_category>::value, graph::detail::no_parameter>::type = graph::detail::no_parameter; typename graph_traits::traversal_category = undir_adj_list_traversal_tag]’ bbc.cpp:67:33: required from here /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::InputIterator<__gnu_cxx::__normal_iterator > > >]’ 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ^ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements > > > >]’: /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:543:7: required from ‘struct boost::ForwardIterator<__gnu_cxx::__normal_iterator > > >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:568:3: required from ‘struct boost::BidirectionalIterator<__gnu_cxx::__normal_iterator > > >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:597:3: required from ‘struct boost::RandomAccessIterator<__gnu_cxx::__normal_iterator > > >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:597:3: required from ‘struct boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator > > >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator > > >]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:42:5: [ skipping 2 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_ > > >)>’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/property_map/property_map.hpp:354:5: required from ‘boost::iterator_property_map >::value_type, typename std::iterator_traits< >::reference> boost::make_iterator_property_map(RAIter, ID) [with RAIter = __gnu_cxx::__normal_iterator > >; ID = vec_adj_list_vertex_id_map >, long unsigned int>; typename std::iterator_traits< >::value_type = long unsigned int; typename std::iterator_traits< >::reference = long unsigned int&]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/betweenness_centrality.hpp:472:43: required from ‘void boost::detail::graph::brandes_betweenness_centrality_dispatch2(const Graph&, CentralityMap, EdgeCentralityMap, WeightMap, VertexIndexMap) [with Graph = boost::adjacency_list >, boost::property > >; CentralityMap = boost::vec_adj_list_vertex_property_map >, boost::property > >, boost::adjacency_list >, boost::property > >*, double, double&, boost::vertex_centrality_t>; EdgeCentralityMap = boost::adj_list_edge_property_map >, boost::edge_centrality_t>; WeightMap = boost::adj_list_edge_property_map >, boost::edge_weight_t>; VertexIndexMap = boost::vec_adj_list_vertex_id_map >, long unsigned int>]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/betweenness_centrality.hpp:517:57: required from ‘static void boost::detail::graph::brandes_betweenness_centrality_dispatch1::run(const Graph&, CentralityMap, EdgeCentralityMap, VertexIndexMap, WeightMap) [with Graph = boost::adjacency_list >, boost::property > >; CentralityMap = boost::vec_adj_list_vertex_property_map >, boost::property > >, boost::adjacency_list >, boost::property > >*, double, double&, boost::vertex_centrality_t>; EdgeCentralityMap = boost::adj_list_edge_property_map >, boost::edge_centrality_t>; VertexIndexMap = boost::vec_adj_list_vertex_id_map >, long unsigned int>; WeightMap = boost::adj_list_edge_property_map >, boost::edge_weight_t>]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/betweenness_centrality.hpp:558:71: required from ‘void boost::brandes_betweenness_centrality(const Graph&, const bgl_named_params&, typename enable_if_c::traversal_category>::value, graph::detail::no_parameter>::type) [with Graph = adjacency_list >, property > >; Param = adj_list_edge_property_map >, edge_weight_t>; Tag = edge_weight_t; Rest = bgl_named_params >, edge_centrality_t>, edge_centrality_t, bgl_named_params >, property > >, adjacency_list >, property > >*, double, double&, vertex_centrality_t>, vertex_centrality_t, no_property> >; typename enable_if_c::traversal_category>::value, graph::detail::no_parameter>::type = graph::detail::no_parameter; typename graph_traits::traversal_category = undir_adj_list_traversal_tag]’ bbc.cpp:67:33: required from here /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::ForwardIterator<__gnu_cxx::__normal_iterator > > >]’ 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ^ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements > > > >]’: /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:571:7: required from ‘struct boost::BidirectionalIterator<__gnu_cxx::__normal_iterator > > >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:597:3: required from ‘struct boost::RandomAccessIterator<__gnu_cxx::__normal_iterator > > >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:597:3: required from ‘struct boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator > > >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator > > >]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:42:5: [ skipping 2 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_ > > >)>’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/property_map/property_map.hpp:354:5: required from ‘boost::iterator_property_map >::value_type, typename std::iterator_traits< >::reference> boost::make_iterator_property_map(RAIter, ID) [with RAIter = __gnu_cxx::__normal_iterator > >; ID = vec_adj_list_vertex_id_map >, long unsigned int>; typename std::iterator_traits< >::value_type = long unsigned int; typename std::iterator_traits< >::reference = long unsigned int&]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/betweenness_centrality.hpp:472:43: required from ‘void boost::detail::graph::brandes_betweenness_centrality_dispatch2(const Graph&, CentralityMap, EdgeCentralityMap, WeightMap, VertexIndexMap) [with Graph = boost::adjacency_list >, boost::property > >; CentralityMap = boost::vec_adj_list_vertex_property_map >, boost::property > >, boost::adjacency_list >, boost::property > >*, double, double&, boost::vertex_centrality_t>; EdgeCentralityMap = boost::adj_list_edge_property_map >, boost::edge_centrality_t>; WeightMap = boost::adj_list_edge_property_map >, boost::edge_weight_t>; VertexIndexMap = boost::vec_adj_list_vertex_id_map >, long unsigned int>]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/betweenness_centrality.hpp:517:57: required from ‘static void boost::detail::graph::brandes_betweenness_centrality_dispatch1::run(const Graph&, CentralityMap, EdgeCentralityMap, VertexIndexMap, WeightMap) [with Graph = boost::adjacency_list >, boost::property > >; CentralityMap = boost::vec_adj_list_vertex_property_map >, boost::property > >, boost::adjacency_list >, boost::property > >*, double, double&, boost::vertex_centrality_t>; EdgeCentralityMap = boost::adj_list_edge_property_map >, boost::edge_centrality_t>; VertexIndexMap = boost::vec_adj_list_vertex_id_map >, long unsigned int>; WeightMap = boost::adj_list_edge_property_map >, boost::edge_weight_t>]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/betweenness_centrality.hpp:558:71: required from ‘void boost::brandes_betweenness_centrality(const Graph&, const bgl_named_params&, typename enable_if_c::traversal_category>::value, graph::detail::no_parameter>::type) [with Graph = adjacency_list >, property > >; Param = adj_list_edge_property_map >, edge_weight_t>; Tag = edge_weight_t; Rest = bgl_named_params >, edge_centrality_t>, edge_centrality_t, bgl_named_params >, property > >, adjacency_list >, property > >*, double, double&, vertex_centrality_t>, vertex_centrality_t, no_property> >; typename enable_if_c::traversal_category>::value, graph::detail::no_parameter>::type = graph::detail::no_parameter; typename graph_traits::traversal_category = undir_adj_list_traversal_tag]’ bbc.cpp:67:33: required from here /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::BidirectionalIterator<__gnu_cxx::__normal_iterator > > >]’ 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ^ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements > > > >]’: /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:253:5: required from ‘struct boost::Comparable<__gnu_cxx::__normal_iterator > > >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:597:3: required from ‘struct boost::RandomAccessIterator<__gnu_cxx::__normal_iterator > > >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:597:3: required from ‘struct boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator > > >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator > > >]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:42:5: [ skipping 2 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_ > > >)>’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/property_map/property_map.hpp:354:5: required from ‘boost::iterator_property_map >::value_type, typename std::iterator_traits< >::reference> boost::make_iterator_property_map(RAIter, ID) [with RAIter = __gnu_cxx::__normal_iterator > >; ID = vec_adj_list_vertex_id_map >, long unsigned int>; typename std::iterator_traits< >::value_type = long unsigned int; typename std::iterator_traits< >::reference = long unsigned int&]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/betweenness_centrality.hpp:472:43: required from ‘void boost::detail::graph::brandes_betweenness_centrality_dispatch2(const Graph&, CentralityMap, EdgeCentralityMap, WeightMap, VertexIndexMap) [with Graph = boost::adjacency_list >, boost::property > >; CentralityMap = boost::vec_adj_list_vertex_property_map >, boost::property > >, boost::adjacency_list >, boost::property > >*, double, double&, boost::vertex_centrality_t>; EdgeCentralityMap = boost::adj_list_edge_property_map >, boost::edge_centrality_t>; WeightMap = boost::adj_list_edge_property_map >, boost::edge_weight_t>; VertexIndexMap = boost::vec_adj_list_vertex_id_map >, long unsigned int>]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/betweenness_centrality.hpp:517:57: required from ‘static void boost::detail::graph::brandes_betweenness_centrality_dispatch1::run(const Graph&, CentralityMap, EdgeCentralityMap, VertexIndexMap, WeightMap) [with Graph = boost::adjacency_list >, boost::property > >; CentralityMap = boost::vec_adj_list_vertex_property_map >, boost::property > >, boost::adjacency_list >, boost::property > >*, double, double&, boost::vertex_centrality_t>; EdgeCentralityMap = boost::adj_list_edge_property_map >, boost::edge_centrality_t>; VertexIndexMap = boost::vec_adj_list_vertex_id_map >, long unsigned int>; WeightMap = boost::adj_list_edge_property_map >, boost::edge_weight_t>]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/betweenness_centrality.hpp:558:71: required from ‘void boost::brandes_betweenness_centrality(const Graph&, const bgl_named_params&, typename enable_if_c::traversal_category>::value, graph::detail::no_parameter>::type) [with Graph = adjacency_list >, property > >; Param = adj_list_edge_property_map >, edge_weight_t>; Tag = edge_weight_t; Rest = bgl_named_params >, edge_centrality_t>, edge_centrality_t, bgl_named_params >, property > >, adjacency_list >, property > >*, double, double&, vertex_centrality_t>, vertex_centrality_t, no_property> >; typename enable_if_c::traversal_category>::value, graph::detail::no_parameter>::type = graph::detail::no_parameter; typename graph_traits::traversal_category = undir_adj_list_traversal_tag]’ bbc.cpp:67:33: required from here /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::Comparable<__gnu_cxx::__normal_iterator > > >]’ 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ^ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements > > > >]’: /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:601:7: required from ‘struct boost::RandomAccessIterator<__gnu_cxx::__normal_iterator > > >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:597:3: required from ‘struct boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator > > >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator > > >]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied > > > >::value’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied > > > >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_ > > >)>’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/property_map/property_map.hpp:354:5: required from ‘boost::iterator_property_map >::value_type, typename std::iterator_traits< >::reference> boost::make_iterator_property_map(RAIter, ID) [with RAIter = __gnu_cxx::__normal_iterator > >; ID = vec_adj_list_vertex_id_map >, long unsigned int>; typename std::iterator_traits< >::value_type = long unsigned int; typename std::iterator_traits< >::reference = long unsigned int&]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/betweenness_centrality.hpp:472:43: required from ‘void boost::detail::graph::brandes_betweenness_centrality_dispatch2(const Graph&, CentralityMap, EdgeCentralityMap, WeightMap, VertexIndexMap) [with Graph = boost::adjacency_list >, boost::property > >; CentralityMap = boost::vec_adj_list_vertex_property_map >, boost::property > >, boost::adjacency_list >, boost::property > >*, double, double&, boost::vertex_centrality_t>; EdgeCentralityMap = boost::adj_list_edge_property_map >, boost::edge_centrality_t>; WeightMap = boost::adj_list_edge_property_map >, boost::edge_weight_t>; VertexIndexMap = boost::vec_adj_list_vertex_id_map >, long unsigned int>]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/betweenness_centrality.hpp:517:57: required from ‘static void boost::detail::graph::brandes_betweenness_centrality_dispatch1::run(const Graph&, CentralityMap, EdgeCentralityMap, VertexIndexMap, WeightMap) [with Graph = boost::adjacency_list >, boost::property > >; CentralityMap = boost::vec_adj_list_vertex_property_map >, boost::property > >, boost::adjacency_list >, boost::property > >*, double, double&, boost::vertex_centrality_t>; EdgeCentralityMap = boost::adj_list_edge_property_map >, boost::edge_centrality_t>; VertexIndexMap = boost::vec_adj_list_vertex_id_map >, long unsigned int>; WeightMap = boost::adj_list_edge_property_map >, boost::edge_weight_t>]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/betweenness_centrality.hpp:558:71: required from ‘void boost::brandes_betweenness_centrality(const Graph&, const bgl_named_params&, typename enable_if_c::traversal_category>::value, graph::detail::no_parameter>::type) [with Graph = adjacency_list >, property > >; Param = adj_list_edge_property_map >, edge_weight_t>; Tag = edge_weight_t; Rest = bgl_named_params >, edge_centrality_t>, edge_centrality_t, bgl_named_params >, property > >, adjacency_list >, property > >*, double, double&, vertex_centrality_t>, vertex_centrality_t, no_property> >; typename enable_if_c::traversal_category>::value, graph::detail::no_parameter>::type = graph::detail::no_parameter; typename graph_traits::traversal_category = undir_adj_list_traversal_tag]’ bbc.cpp:67:33: required from here /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::RandomAccessIterator<__gnu_cxx::__normal_iterator > > >]’ 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ^ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator > > >]’: /home/omnipath/local/R/4.4-3.20/BH/include/boost/property_map/property_map.hpp:354:5: required from ‘boost::iterator_property_map >::value_type, typename std::iterator_traits< >::reference> boost::make_iterator_property_map(RAIter, ID) [with RAIter = __gnu_cxx::__normal_iterator > >; ID = vec_adj_list_vertex_id_map >, long unsigned int>; typename std::iterator_traits< >::value_type = long unsigned int; typename std::iterator_traits< >::reference = long unsigned int&]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/betweenness_centrality.hpp:472:43: required from ‘void boost::detail::graph::brandes_betweenness_centrality_dispatch2(const Graph&, CentralityMap, EdgeCentralityMap, WeightMap, VertexIndexMap) [with Graph = boost::adjacency_list >, boost::property > >; CentralityMap = boost::vec_adj_list_vertex_property_map >, boost::property > >, boost::adjacency_list >, boost::property > >*, double, double&, boost::vertex_centrality_t>; EdgeCentralityMap = boost::adj_list_edge_property_map >, boost::edge_centrality_t>; WeightMap = boost::adj_list_edge_property_map >, boost::edge_weight_t>; VertexIndexMap = boost::vec_adj_list_vertex_id_map >, long unsigned int>]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/betweenness_centrality.hpp:517:57: required from ‘static void boost::detail::graph::brandes_betweenness_centrality_dispatch1::run(const Graph&, CentralityMap, EdgeCentralityMap, VertexIndexMap, WeightMap) [with Graph = boost::adjacency_list >, boost::property > >; CentralityMap = boost::vec_adj_list_vertex_property_map >, boost::property > >, boost::adjacency_list >, boost::property > >*, double, double&, boost::vertex_centrality_t>; EdgeCentralityMap = boost::adj_list_edge_property_map >, boost::edge_centrality_t>; VertexIndexMap = boost::vec_adj_list_vertex_id_map >, long unsigned int>; WeightMap = boost::adj_list_edge_property_map >, boost::edge_weight_t>]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/betweenness_centrality.hpp:558:71: required from ‘void boost::brandes_betweenness_centrality(const Graph&, const bgl_named_params&, typename enable_if_c::traversal_category>::value, graph::detail::no_parameter>::type) [with Graph = adjacency_list >, property > >; Param = adj_list_edge_property_map >, edge_weight_t>; Tag = edge_weight_t; Rest = bgl_named_params >, edge_centrality_t>, edge_centrality_t, bgl_named_params >, property > >, adjacency_list >, property > >*, double, double&, vertex_centrality_t>, vertex_centrality_t, no_property> >; typename enable_if_c::traversal_category>::value, graph::detail::no_parameter>::type = graph::detail::no_parameter; typename graph_traits::traversal_category = undir_adj_list_traversal_tag]’ bbc.cpp:67:33: required from here /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:597:17: note: in a call to non-static member function ‘boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator > > >::~RandomAccessIteratorConcept()’ 597 | BOOST_concept(RandomAccessIterator,(TT)) | ^~~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/preprocessor/cat.hpp:29:34: note: in definition of macro ‘BOOST_PP_CAT_I’ 29 | # define BOOST_PP_CAT_I(a, b) a ## b | ^ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/concept_def.hpp:23:12: note: in expansion of macro ‘BOOST_PP_CAT’ 23 | struct BOOST_PP_CAT(name,Concept) \ | ^~~~~~~~~~~~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:597:3: note: in expansion of macro ‘BOOST_concept’ 597 | BOOST_concept(RandomAccessIterator,(TT)) | ^~~~~~~~~~~~~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::Assignable<__gnu_cxx::__normal_iterator, std::allocator > >*, std::vector, std::allocator > >, std::allocator, std::allocator > > > > > >]’: /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements, std::allocator > >*, std::vector, std::allocator > >, std::allocator, std::allocator > > > > > > >]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:145:5: required from ‘struct boost::Assignable<__gnu_cxx::__normal_iterator, std::allocator > >*, std::vector, std::allocator > >, std::allocator, std::allocator > > > > > >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:502:3: required from ‘struct boost::InputIterator<__gnu_cxx::__normal_iterator, std::allocator > >*, std::vector, std::allocator > >, std::allocator, std::allocator > > > > > >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:540:3: required from ‘struct boost::ForwardIterator<__gnu_cxx::__normal_iterator, std::allocator > >*, std::vector, std::allocator > >, std::allocator, std::allocator > > > > > >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:568:3: required from ‘struct boost::BidirectionalIterator<__gnu_cxx::__normal_iterator, std::allocator > >*, std::vector, std::allocator > >, std::allocator, std::allocator > > > > > >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:597:3: [ skipping 5 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_, std::allocator > >*, std::vector, std::allocator > >, std::allocator, std::allocator > > > > > >)>’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/property_map/property_map.hpp:354:5: required from ‘boost::iterator_property_map >::value_type, typename std::iterator_traits< >::reference> boost::make_iterator_property_map(RAIter, ID) [with RAIter = __gnu_cxx::__normal_iterator, std::allocator > >*, std::vector, std::allocator > >, std::allocator, std::allocator > > > > >; ID = vec_adj_list_vertex_id_map >, long unsigned int>; typename std::iterator_traits< >::value_type = std::vector, std::allocator > >; typename std::iterator_traits< >::reference = std::vector, std::allocator > >&]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/betweenness_centrality.hpp:469:43: required from ‘void boost::detail::graph::brandes_betweenness_centrality_dispatch2(const Graph&, CentralityMap, EdgeCentralityMap, WeightMap, VertexIndexMap) [with Graph = boost::adjacency_list >, boost::property > >; CentralityMap = boost::vec_adj_list_vertex_property_map >, boost::property > >, boost::adjacency_list >, boost::property > >*, double, double&, boost::vertex_centrality_t>; EdgeCentralityMap = boost::adj_list_edge_property_map >, boost::edge_centrality_t>; WeightMap = boost::adj_list_edge_property_map >, boost::edge_weight_t>; VertexIndexMap = boost::vec_adj_list_vertex_id_map >, long unsigned int>]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/betweenness_centrality.hpp:517:57: required from ‘static void boost::detail::graph::brandes_betweenness_centrality_dispatch1::run(const Graph&, CentralityMap, EdgeCentralityMap, VertexIndexMap, WeightMap) [with Graph = boost::adjacency_list >, boost::property > >; CentralityMap = boost::vec_adj_list_vertex_property_map >, boost::property > >, boost::adjacency_list >, boost::property > >*, double, double&, boost::vertex_centrality_t>; EdgeCentralityMap = boost::adj_list_edge_property_map >, boost::edge_centrality_t>; VertexIndexMap = boost::vec_adj_list_vertex_id_map >, long unsigned int>; WeightMap = boost::adj_list_edge_property_map >, boost::edge_weight_t>]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/betweenness_centrality.hpp:558:71: required from ‘void boost::brandes_betweenness_centrality(const Graph&, const bgl_named_params&, typename enable_if_c::traversal_category>::value, graph::detail::no_parameter>::type) [with Graph = adjacency_list >, property > >; Param = adj_list_edge_property_map >, edge_weight_t>; Tag = edge_weight_t; Rest = bgl_named_params >, edge_centrality_t>, edge_centrality_t, bgl_named_params >, property > >, adjacency_list >, property > >*, double, double&, vertex_centrality_t>, vertex_centrality_t, no_property> >; typename enable_if_c::traversal_category>::value, graph::detail::no_parameter>::type = graph::detail::no_parameter; typename graph_traits::traversal_category = undir_adj_list_traversal_tag]’ bbc.cpp:67:33: required from here /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::Assignable::~Assignable() [with TT = __gnu_cxx::__normal_iterator, std::allocator > >*, std::vector, std::allocator > >, std::allocator, std::allocator > > > > >]’ 37 | ~model() | ^ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:145:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 145 | BOOST_CONCEPT_USAGE(Assignable) { | ^~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::EqualityComparable<__gnu_cxx::__normal_iterator, std::allocator > >*, std::vector, std::allocator > >, std::allocator, std::allocator > > > > > >]’: /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements, std::allocator > >*, std::vector, std::allocator > >, std::allocator, std::allocator > > > > > > >]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:233:5: required from ‘struct boost::EqualityComparable<__gnu_cxx::__normal_iterator, std::allocator > >*, std::vector, std::allocator > >, std::allocator, std::allocator > > > > > >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:502:3: required from ‘struct boost::InputIterator<__gnu_cxx::__normal_iterator, std::allocator > >*, std::vector, std::allocator > >, std::allocator, std::allocator > > > > > >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:540:3: required from ‘struct boost::ForwardIterator<__gnu_cxx::__normal_iterator, std::allocator > >*, std::vector, std::allocator > >, std::allocator, std::allocator > > > > > >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:568:3: required from ‘struct boost::BidirectionalIterator<__gnu_cxx::__normal_iterator, std::allocator > >*, std::vector, std::allocator > >, std::allocator, std::allocator > > > > > >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:597:3: [ skipping 5 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_, std::allocator > >*, std::vector, std::allocator > >, std::allocator, std::allocator > > > > > >)>’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/property_map/property_map.hpp:354:5: required from ‘boost::iterator_property_map >::value_type, typename std::iterator_traits< >::reference> boost::make_iterator_property_map(RAIter, ID) [with RAIter = __gnu_cxx::__normal_iterator, std::allocator > >*, std::vector, std::allocator > >, std::allocator, std::allocator > > > > >; ID = vec_adj_list_vertex_id_map >, long unsigned int>; typename std::iterator_traits< >::value_type = std::vector, std::allocator > >; typename std::iterator_traits< >::reference = std::vector, std::allocator > >&]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/betweenness_centrality.hpp:469:43: required from ‘void boost::detail::graph::brandes_betweenness_centrality_dispatch2(const Graph&, CentralityMap, EdgeCentralityMap, WeightMap, VertexIndexMap) [with Graph = boost::adjacency_list >, boost::property > >; CentralityMap = boost::vec_adj_list_vertex_property_map >, boost::property > >, boost::adjacency_list >, boost::property > >*, double, double&, boost::vertex_centrality_t>; EdgeCentralityMap = boost::adj_list_edge_property_map >, boost::edge_centrality_t>; WeightMap = boost::adj_list_edge_property_map >, boost::edge_weight_t>; VertexIndexMap = boost::vec_adj_list_vertex_id_map >, long unsigned int>]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/betweenness_centrality.hpp:517:57: required from ‘static void boost::detail::graph::brandes_betweenness_centrality_dispatch1::run(const Graph&, CentralityMap, EdgeCentralityMap, VertexIndexMap, WeightMap) [with Graph = boost::adjacency_list >, boost::property > >; CentralityMap = boost::vec_adj_list_vertex_property_map >, boost::property > >, boost::adjacency_list >, boost::property > >*, double, double&, boost::vertex_centrality_t>; EdgeCentralityMap = boost::adj_list_edge_property_map >, boost::edge_centrality_t>; VertexIndexMap = boost::vec_adj_list_vertex_id_map >, long unsigned int>; WeightMap = boost::adj_list_edge_property_map >, boost::edge_weight_t>]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/betweenness_centrality.hpp:558:71: required from ‘void boost::brandes_betweenness_centrality(const Graph&, const bgl_named_params&, typename enable_if_c::traversal_category>::value, graph::detail::no_parameter>::type) [with Graph = adjacency_list >, property > >; Param = adj_list_edge_property_map >, edge_weight_t>; Tag = edge_weight_t; Rest = bgl_named_params >, edge_centrality_t>, edge_centrality_t, bgl_named_params >, property > >, adjacency_list >, property > >*, double, double&, vertex_centrality_t>, vertex_centrality_t, no_property> >; typename enable_if_c::traversal_category>::value, graph::detail::no_parameter>::type = graph::detail::no_parameter; typename graph_traits::traversal_category = undir_adj_list_traversal_tag]’ bbc.cpp:67:33: required from here /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::EqualityComparable::~EqualityComparable() [with TT = __gnu_cxx::__normal_iterator, std::allocator > >*, std::vector, std::allocator > >, std::allocator, std::allocator > > > > >]’ 37 | ~model() | ^ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:233:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 233 | BOOST_CONCEPT_USAGE(EqualityComparable) { | ^~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::InputIterator<__gnu_cxx::__normal_iterator, std::allocator > >*, std::vector, std::allocator > >, std::allocator, std::allocator > > > > > >]’: /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements, std::allocator > >*, std::vector, std::allocator > >, std::allocator, std::allocator > > > > > > >]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:512:7: required from ‘struct boost::InputIterator<__gnu_cxx::__normal_iterator, std::allocator > >*, std::vector, std::allocator > >, std::allocator, std::allocator > > > > > >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:540:3: required from ‘struct boost::ForwardIterator<__gnu_cxx::__normal_iterator, std::allocator > >*, std::vector, std::allocator > >, std::allocator, std::allocator > > > > > >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:568:3: required from ‘struct boost::BidirectionalIterator<__gnu_cxx::__normal_iterator, std::allocator > >*, std::vector, std::allocator > >, std::allocator, std::allocator > > > > > >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:597:3: required from ‘struct boost::RandomAccessIterator<__gnu_cxx::__normal_iterator, std::allocator > >*, std::vector, std::allocator > >, std::allocator, std::allocator > > > > > >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:597:3: [ skipping 4 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_, std::allocator > >*, std::vector, std::allocator > >, std::allocator, std::allocator > > > > > >)>’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/property_map/property_map.hpp:354:5: required from ‘boost::iterator_property_map >::value_type, typename std::iterator_traits< >::reference> boost::make_iterator_property_map(RAIter, ID) [with RAIter = __gnu_cxx::__normal_iterator, std::allocator > >*, std::vector, std::allocator > >, std::allocator, std::allocator > > > > >; ID = vec_adj_list_vertex_id_map >, long unsigned int>; typename std::iterator_traits< >::value_type = std::vector, std::allocator > >; typename std::iterator_traits< >::reference = std::vector, std::allocator > >&]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/betweenness_centrality.hpp:469:43: required from ‘void boost::detail::graph::brandes_betweenness_centrality_dispatch2(const Graph&, CentralityMap, EdgeCentralityMap, WeightMap, VertexIndexMap) [with Graph = boost::adjacency_list >, boost::property > >; CentralityMap = boost::vec_adj_list_vertex_property_map >, boost::property > >, boost::adjacency_list >, boost::property > >*, double, double&, boost::vertex_centrality_t>; EdgeCentralityMap = boost::adj_list_edge_property_map >, boost::edge_centrality_t>; WeightMap = boost::adj_list_edge_property_map >, boost::edge_weight_t>; VertexIndexMap = boost::vec_adj_list_vertex_id_map >, long unsigned int>]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/betweenness_centrality.hpp:517:57: required from ‘static void boost::detail::graph::brandes_betweenness_centrality_dispatch1::run(const Graph&, CentralityMap, EdgeCentralityMap, VertexIndexMap, WeightMap) [with Graph = boost::adjacency_list >, boost::property > >; CentralityMap = boost::vec_adj_list_vertex_property_map >, boost::property > >, boost::adjacency_list >, boost::property > >*, double, double&, boost::vertex_centrality_t>; EdgeCentralityMap = boost::adj_list_edge_property_map >, boost::edge_centrality_t>; VertexIndexMap = boost::vec_adj_list_vertex_id_map >, long unsigned int>; WeightMap = boost::adj_list_edge_property_map >, boost::edge_weight_t>]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/betweenness_centrality.hpp:558:71: required from ‘void boost::brandes_betweenness_centrality(const Graph&, const bgl_named_params&, typename enable_if_c::traversal_category>::value, graph::detail::no_parameter>::type) [with Graph = adjacency_list >, property > >; Param = adj_list_edge_property_map >, edge_weight_t>; Tag = edge_weight_t; Rest = bgl_named_params >, edge_centrality_t>, edge_centrality_t, bgl_named_params >, property > >, adjacency_list >, property > >*, double, double&, vertex_centrality_t>, vertex_centrality_t, no_property> >; typename enable_if_c::traversal_category>::value, graph::detail::no_parameter>::type = graph::detail::no_parameter; typename graph_traits::traversal_category = undir_adj_list_traversal_tag]’ bbc.cpp:67:33: required from here /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::InputIterator::~InputIterator() [with TT = __gnu_cxx::__normal_iterator, std::allocator > >*, std::vector, std::allocator > >, std::allocator, std::allocator > > > > >]’ 37 | ~model() | ^ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:512:7: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 512 | BOOST_CONCEPT_USAGE(InputIterator) | ^~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::ForwardIterator<__gnu_cxx::__normal_iterator, std::allocator > >*, std::vector, std::allocator > >, std::allocator, std::allocator > > > > > >]’: /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements, std::allocator > >*, std::vector, std::allocator > >, std::allocator, std::allocator > > > > > > >]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:543:7: required from ‘struct boost::ForwardIterator<__gnu_cxx::__normal_iterator, std::allocator > >*, std::vector, std::allocator > >, std::allocator, std::allocator > > > > > >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:568:3: required from ‘struct boost::BidirectionalIterator<__gnu_cxx::__normal_iterator, std::allocator > >*, std::vector, std::allocator > >, std::allocator, std::allocator > > > > > >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:597:3: required from ‘struct boost::RandomAccessIterator<__gnu_cxx::__normal_iterator, std::allocator > >*, std::vector, std::allocator > >, std::allocator, std::allocator > > > > > >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:597:3: required from ‘struct boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator, std::allocator > >*, std::vector, std::allocator > >, std::allocator, std::allocator > > > > > >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:32:62: [ skipping 3 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_, std::allocator > >*, std::vector, std::allocator > >, std::allocator, std::allocator > > > > > >)>’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/property_map/property_map.hpp:354:5: required from ‘boost::iterator_property_map >::value_type, typename std::iterator_traits< >::reference> boost::make_iterator_property_map(RAIter, ID) [with RAIter = __gnu_cxx::__normal_iterator, std::allocator > >*, std::vector, std::allocator > >, std::allocator, std::allocator > > > > >; ID = vec_adj_list_vertex_id_map >, long unsigned int>; typename std::iterator_traits< >::value_type = std::vector, std::allocator > >; typename std::iterator_traits< >::reference = std::vector, std::allocator > >&]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/betweenness_centrality.hpp:469:43: required from ‘void boost::detail::graph::brandes_betweenness_centrality_dispatch2(const Graph&, CentralityMap, EdgeCentralityMap, WeightMap, VertexIndexMap) [with Graph = boost::adjacency_list >, boost::property > >; CentralityMap = boost::vec_adj_list_vertex_property_map >, boost::property > >, boost::adjacency_list >, boost::property > >*, double, double&, boost::vertex_centrality_t>; EdgeCentralityMap = boost::adj_list_edge_property_map >, boost::edge_centrality_t>; WeightMap = boost::adj_list_edge_property_map >, boost::edge_weight_t>; VertexIndexMap = boost::vec_adj_list_vertex_id_map >, long unsigned int>]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/betweenness_centrality.hpp:517:57: required from ‘static void boost::detail::graph::brandes_betweenness_centrality_dispatch1::run(const Graph&, CentralityMap, EdgeCentralityMap, VertexIndexMap, WeightMap) [with Graph = boost::adjacency_list >, boost::property > >; CentralityMap = boost::vec_adj_list_vertex_property_map >, boost::property > >, boost::adjacency_list >, boost::property > >*, double, double&, boost::vertex_centrality_t>; EdgeCentralityMap = boost::adj_list_edge_property_map >, boost::edge_centrality_t>; VertexIndexMap = boost::vec_adj_list_vertex_id_map >, long unsigned int>; WeightMap = boost::adj_list_edge_property_map >, boost::edge_weight_t>]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/betweenness_centrality.hpp:558:71: required from ‘void boost::brandes_betweenness_centrality(const Graph&, const bgl_named_params&, typename enable_if_c::traversal_category>::value, graph::detail::no_parameter>::type) [with Graph = adjacency_list >, property > >; Param = adj_list_edge_property_map >, edge_weight_t>; Tag = edge_weight_t; Rest = bgl_named_params >, edge_centrality_t>, edge_centrality_t, bgl_named_params >, property > >, adjacency_list >, property > >*, double, double&, vertex_centrality_t>, vertex_centrality_t, no_property> >; typename enable_if_c::traversal_category>::value, graph::detail::no_parameter>::type = graph::detail::no_parameter; typename graph_traits::traversal_category = undir_adj_list_traversal_tag]’ bbc.cpp:67:33: required from here /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::ForwardIterator::~ForwardIterator() [with TT = __gnu_cxx::__normal_iterator, std::allocator > >*, std::vector, std::allocator > >, std::allocator, std::allocator > > > > >]’ 37 | ~model() | ^ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:543:7: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 543 | BOOST_CONCEPT_USAGE(ForwardIterator) | ^~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::BidirectionalIterator<__gnu_cxx::__normal_iterator, std::allocator > >*, std::vector, std::allocator > >, std::allocator, std::allocator > > > > > >]’: /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements, std::allocator > >*, std::vector, std::allocator > >, std::allocator, std::allocator > > > > > > >]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:571:7: required from ‘struct boost::BidirectionalIterator<__gnu_cxx::__normal_iterator, std::allocator > >*, std::vector, std::allocator > >, std::allocator, std::allocator > > > > > >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:597:3: required from ‘struct boost::RandomAccessIterator<__gnu_cxx::__normal_iterator, std::allocator > >*, std::vector, std::allocator > >, std::allocator, std::allocator > > > > > >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:597:3: required from ‘struct boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator, std::allocator > >*, std::vector, std::allocator > >, std::allocator, std::allocator > > > > > >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator, std::allocator > >*, std::vector, std::allocator > >, std::allocator, std::allocator > > > > > >]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:42:5: [ skipping 2 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_, std::allocator > >*, std::vector, std::allocator > >, std::allocator, std::allocator > > > > > >)>’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/property_map/property_map.hpp:354:5: required from ‘boost::iterator_property_map >::value_type, typename std::iterator_traits< >::reference> boost::make_iterator_property_map(RAIter, ID) [with RAIter = __gnu_cxx::__normal_iterator, std::allocator > >*, std::vector, std::allocator > >, std::allocator, std::allocator > > > > >; ID = vec_adj_list_vertex_id_map >, long unsigned int>; typename std::iterator_traits< >::value_type = std::vector, std::allocator > >; typename std::iterator_traits< >::reference = std::vector, std::allocator > >&]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/betweenness_centrality.hpp:469:43: required from ‘void boost::detail::graph::brandes_betweenness_centrality_dispatch2(const Graph&, CentralityMap, EdgeCentralityMap, WeightMap, VertexIndexMap) [with Graph = boost::adjacency_list >, boost::property > >; CentralityMap = boost::vec_adj_list_vertex_property_map >, boost::property > >, boost::adjacency_list >, boost::property > >*, double, double&, boost::vertex_centrality_t>; EdgeCentralityMap = boost::adj_list_edge_property_map >, boost::edge_centrality_t>; WeightMap = boost::adj_list_edge_property_map >, boost::edge_weight_t>; VertexIndexMap = boost::vec_adj_list_vertex_id_map >, long unsigned int>]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/betweenness_centrality.hpp:517:57: required from ‘static void boost::detail::graph::brandes_betweenness_centrality_dispatch1::run(const Graph&, CentralityMap, EdgeCentralityMap, VertexIndexMap, WeightMap) [with Graph = boost::adjacency_list >, boost::property > >; CentralityMap = boost::vec_adj_list_vertex_property_map >, boost::property > >, boost::adjacency_list >, boost::property > >*, double, double&, boost::vertex_centrality_t>; EdgeCentralityMap = boost::adj_list_edge_property_map >, boost::edge_centrality_t>; VertexIndexMap = boost::vec_adj_list_vertex_id_map >, long unsigned int>; WeightMap = boost::adj_list_edge_property_map >, boost::edge_weight_t>]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/betweenness_centrality.hpp:558:71: required from ‘void boost::brandes_betweenness_centrality(const Graph&, const bgl_named_params&, typename enable_if_c::traversal_category>::value, graph::detail::no_parameter>::type) [with Graph = adjacency_list >, property > >; Param = adj_list_edge_property_map >, edge_weight_t>; Tag = edge_weight_t; Rest = bgl_named_params >, edge_centrality_t>, edge_centrality_t, bgl_named_params >, property > >, adjacency_list >, property > >*, double, double&, vertex_centrality_t>, vertex_centrality_t, no_property> >; typename enable_if_c::traversal_category>::value, graph::detail::no_parameter>::type = graph::detail::no_parameter; typename graph_traits::traversal_category = undir_adj_list_traversal_tag]’ bbc.cpp:67:33: required from here /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::BidirectionalIterator::~BidirectionalIterator() [with TT = __gnu_cxx::__normal_iterator, std::allocator > >*, std::vector, std::allocator > >, std::allocator, std::allocator > > > > >]’ 37 | ~model() | ^ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:571:7: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 571 | BOOST_CONCEPT_USAGE(BidirectionalIterator) | ^~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::Comparable<__gnu_cxx::__normal_iterator, std::allocator > >*, std::vector, std::allocator > >, std::allocator, std::allocator > > > > > >]’: /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements, std::allocator > >*, std::vector, std::allocator > >, std::allocator, std::allocator > > > > > > >]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:253:5: required from ‘struct boost::Comparable<__gnu_cxx::__normal_iterator, std::allocator > >*, std::vector, std::allocator > >, std::allocator, std::allocator > > > > > >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:597:3: required from ‘struct boost::RandomAccessIterator<__gnu_cxx::__normal_iterator, std::allocator > >*, std::vector, std::allocator > >, std::allocator, std::allocator > > > > > >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:597:3: required from ‘struct boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator, std::allocator > >*, std::vector, std::allocator > >, std::allocator, std::allocator > > > > > >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator, std::allocator > >*, std::vector, std::allocator > >, std::allocator, std::allocator > > > > > >]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:42:5: [ skipping 2 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_, std::allocator > >*, std::vector, std::allocator > >, std::allocator, std::allocator > > > > > >)>’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/property_map/property_map.hpp:354:5: required from ‘boost::iterator_property_map >::value_type, typename std::iterator_traits< >::reference> boost::make_iterator_property_map(RAIter, ID) [with RAIter = __gnu_cxx::__normal_iterator, std::allocator > >*, std::vector, std::allocator > >, std::allocator, std::allocator > > > > >; ID = vec_adj_list_vertex_id_map >, long unsigned int>; typename std::iterator_traits< >::value_type = std::vector, std::allocator > >; typename std::iterator_traits< >::reference = std::vector, std::allocator > >&]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/betweenness_centrality.hpp:469:43: required from ‘void boost::detail::graph::brandes_betweenness_centrality_dispatch2(const Graph&, CentralityMap, EdgeCentralityMap, WeightMap, VertexIndexMap) [with Graph = boost::adjacency_list >, boost::property > >; CentralityMap = boost::vec_adj_list_vertex_property_map >, boost::property > >, boost::adjacency_list >, boost::property > >*, double, double&, boost::vertex_centrality_t>; EdgeCentralityMap = boost::adj_list_edge_property_map >, boost::edge_centrality_t>; WeightMap = boost::adj_list_edge_property_map >, boost::edge_weight_t>; VertexIndexMap = boost::vec_adj_list_vertex_id_map >, long unsigned int>]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/betweenness_centrality.hpp:517:57: required from ‘static void boost::detail::graph::brandes_betweenness_centrality_dispatch1::run(const Graph&, CentralityMap, EdgeCentralityMap, VertexIndexMap, WeightMap) [with Graph = boost::adjacency_list >, boost::property > >; CentralityMap = boost::vec_adj_list_vertex_property_map >, boost::property > >, boost::adjacency_list >, boost::property > >*, double, double&, boost::vertex_centrality_t>; EdgeCentralityMap = boost::adj_list_edge_property_map >, boost::edge_centrality_t>; VertexIndexMap = boost::vec_adj_list_vertex_id_map >, long unsigned int>; WeightMap = boost::adj_list_edge_property_map >, boost::edge_weight_t>]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/betweenness_centrality.hpp:558:71: required from ‘void boost::brandes_betweenness_centrality(const Graph&, const bgl_named_params&, typename enable_if_c::traversal_category>::value, graph::detail::no_parameter>::type) [with Graph = adjacency_list >, property > >; Param = adj_list_edge_property_map >, edge_weight_t>; Tag = edge_weight_t; Rest = bgl_named_params >, edge_centrality_t>, edge_centrality_t, bgl_named_params >, property > >, adjacency_list >, property > >*, double, double&, vertex_centrality_t>, vertex_centrality_t, no_property> >; typename enable_if_c::traversal_category>::value, graph::detail::no_parameter>::type = graph::detail::no_parameter; typename graph_traits::traversal_category = undir_adj_list_traversal_tag]’ bbc.cpp:67:33: required from here /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::Comparable::~Comparable() [with TT = __gnu_cxx::__normal_iterator, std::allocator > >*, std::vector, std::allocator > >, std::allocator, std::allocator > > > > >]’ 37 | ~model() | ^ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:253:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 253 | BOOST_CONCEPT_USAGE(Comparable) { | ^~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::RandomAccessIterator<__gnu_cxx::__normal_iterator, std::allocator > >*, std::vector, std::allocator > >, std::allocator, std::allocator > > > > > >]’: /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements, std::allocator > >*, std::vector, std::allocator > >, std::allocator, std::allocator > > > > > > >]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:601:7: required from ‘struct boost::RandomAccessIterator<__gnu_cxx::__normal_iterator, std::allocator > >*, std::vector, std::allocator > >, std::allocator, std::allocator > > > > > >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:597:3: required from ‘struct boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator, std::allocator > >*, std::vector, std::allocator > >, std::allocator, std::allocator > > > > > >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator, std::allocator > >*, std::vector, std::allocator > >, std::allocator, std::allocator > > > > > >]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:42:5: [ skipping 2 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_, std::allocator > >*, std::vector, std::allocator > >, std::allocator, std::allocator > > > > > >)>’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/property_map/property_map.hpp:354:5: required from ‘boost::iterator_property_map >::value_type, typename std::iterator_traits< >::reference> boost::make_iterator_property_map(RAIter, ID) [with RAIter = __gnu_cxx::__normal_iterator, std::allocator > >*, std::vector, std::allocator > >, std::allocator, std::allocator > > > > >; ID = vec_adj_list_vertex_id_map >, long unsigned int>; typename std::iterator_traits< >::value_type = std::vector, std::allocator > >; typename std::iterator_traits< >::reference = std::vector, std::allocator > >&]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/betweenness_centrality.hpp:469:43: required from ‘void boost::detail::graph::brandes_betweenness_centrality_dispatch2(const Graph&, CentralityMap, EdgeCentralityMap, WeightMap, VertexIndexMap) [with Graph = boost::adjacency_list >, boost::property > >; CentralityMap = boost::vec_adj_list_vertex_property_map >, boost::property > >, boost::adjacency_list >, boost::property > >*, double, double&, boost::vertex_centrality_t>; EdgeCentralityMap = boost::adj_list_edge_property_map >, boost::edge_centrality_t>; WeightMap = boost::adj_list_edge_property_map >, boost::edge_weight_t>; VertexIndexMap = boost::vec_adj_list_vertex_id_map >, long unsigned int>]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/betweenness_centrality.hpp:517:57: required from ‘static void boost::detail::graph::brandes_betweenness_centrality_dispatch1::run(const Graph&, CentralityMap, EdgeCentralityMap, VertexIndexMap, WeightMap) [with Graph = boost::adjacency_list >, boost::property > >; CentralityMap = boost::vec_adj_list_vertex_property_map >, boost::property > >, boost::adjacency_list >, boost::property > >*, double, double&, boost::vertex_centrality_t>; EdgeCentralityMap = boost::adj_list_edge_property_map >, boost::edge_centrality_t>; VertexIndexMap = boost::vec_adj_list_vertex_id_map >, long unsigned int>; WeightMap = boost::adj_list_edge_property_map >, boost::edge_weight_t>]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/betweenness_centrality.hpp:558:71: required from ‘void boost::brandes_betweenness_centrality(const Graph&, const bgl_named_params&, typename enable_if_c::traversal_category>::value, graph::detail::no_parameter>::type) [with Graph = adjacency_list >, property > >; Param = adj_list_edge_property_map >, edge_weight_t>; Tag = edge_weight_t; Rest = bgl_named_params >, edge_centrality_t>, edge_centrality_t, bgl_named_params >, property > >, adjacency_list >, property > >*, double, double&, vertex_centrality_t>, vertex_centrality_t, no_property> >; typename enable_if_c::traversal_category>::value, graph::detail::no_parameter>::type = graph::detail::no_parameter; typename graph_traits::traversal_category = undir_adj_list_traversal_tag]’ bbc.cpp:67:33: required from here /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::RandomAccessIterator::~RandomAccessIterator() [with TT = __gnu_cxx::__normal_iterator, std::allocator > >*, std::vector, std::allocator > >, std::allocator, std::allocator > > > > >]’ 37 | ~model() | ^ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:601:7: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 601 | BOOST_CONCEPT_USAGE(RandomAccessIterator) | ^~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::Assignable<__gnu_cxx::__normal_iterator > > >]’: /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements > > > >]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:145:5: required from ‘struct boost::Assignable<__gnu_cxx::__normal_iterator > > >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:502:3: required from ‘struct boost::InputIterator<__gnu_cxx::__normal_iterator > > >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:540:3: required from ‘struct boost::ForwardIterator<__gnu_cxx::__normal_iterator > > >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:568:3: required from ‘struct boost::BidirectionalIterator<__gnu_cxx::__normal_iterator > > >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:597:3: [ skipping 5 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_ > > >)>’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/property_map/property_map.hpp:354:5: required from ‘boost::iterator_property_map >::value_type, typename std::iterator_traits< >::reference> boost::make_iterator_property_map(RAIter, ID) [with RAIter = __gnu_cxx::__normal_iterator > >; ID = vec_adj_list_vertex_id_map >, long unsigned int>; typename std::iterator_traits< >::value_type = double; typename std::iterator_traits< >::reference = double&]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/betweenness_centrality.hpp:470:43: required from ‘void boost::detail::graph::brandes_betweenness_centrality_dispatch2(const Graph&, CentralityMap, EdgeCentralityMap, WeightMap, VertexIndexMap) [with Graph = boost::adjacency_list >, boost::property > >; CentralityMap = boost::vec_adj_list_vertex_property_map >, boost::property > >, boost::adjacency_list >, boost::property > >*, double, double&, boost::vertex_centrality_t>; EdgeCentralityMap = boost::adj_list_edge_property_map >, boost::edge_centrality_t>; WeightMap = boost::adj_list_edge_property_map >, boost::edge_weight_t>; VertexIndexMap = boost::vec_adj_list_vertex_id_map >, long unsigned int>]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/betweenness_centrality.hpp:517:57: required from ‘static void boost::detail::graph::brandes_betweenness_centrality_dispatch1::run(const Graph&, CentralityMap, EdgeCentralityMap, VertexIndexMap, WeightMap) [with Graph = boost::adjacency_list >, boost::property > >; CentralityMap = boost::vec_adj_list_vertex_property_map >, boost::property > >, boost::adjacency_list >, boost::property > >*, double, double&, boost::vertex_centrality_t>; EdgeCentralityMap = boost::adj_list_edge_property_map >, boost::edge_centrality_t>; VertexIndexMap = boost::vec_adj_list_vertex_id_map >, long unsigned int>; WeightMap = boost::adj_list_edge_property_map >, boost::edge_weight_t>]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/betweenness_centrality.hpp:558:71: required from ‘void boost::brandes_betweenness_centrality(const Graph&, const bgl_named_params&, typename enable_if_c::traversal_category>::value, graph::detail::no_parameter>::type) [with Graph = adjacency_list >, property > >; Param = adj_list_edge_property_map >, edge_weight_t>; Tag = edge_weight_t; Rest = bgl_named_params >, edge_centrality_t>, edge_centrality_t, bgl_named_params >, property > >, adjacency_list >, property > >*, double, double&, vertex_centrality_t>, vertex_centrality_t, no_property> >; typename enable_if_c::traversal_category>::value, graph::detail::no_parameter>::type = graph::detail::no_parameter; typename graph_traits::traversal_category = undir_adj_list_traversal_tag]’ bbc.cpp:67:33: required from here /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::Assignable::~Assignable() [with TT = __gnu_cxx::__normal_iterator > >]’ 37 | ~model() | ^ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:145:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 145 | BOOST_CONCEPT_USAGE(Assignable) { | ^~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::EqualityComparable<__gnu_cxx::__normal_iterator > > >]’: /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements > > > >]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:233:5: required from ‘struct boost::EqualityComparable<__gnu_cxx::__normal_iterator > > >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:502:3: required from ‘struct boost::InputIterator<__gnu_cxx::__normal_iterator > > >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:540:3: required from ‘struct boost::ForwardIterator<__gnu_cxx::__normal_iterator > > >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:568:3: required from ‘struct boost::BidirectionalIterator<__gnu_cxx::__normal_iterator > > >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:597:3: [ skipping 5 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_ > > >)>’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/property_map/property_map.hpp:354:5: required from ‘boost::iterator_property_map >::value_type, typename std::iterator_traits< >::reference> boost::make_iterator_property_map(RAIter, ID) [with RAIter = __gnu_cxx::__normal_iterator > >; ID = vec_adj_list_vertex_id_map >, long unsigned int>; typename std::iterator_traits< >::value_type = double; typename std::iterator_traits< >::reference = double&]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/betweenness_centrality.hpp:470:43: required from ‘void boost::detail::graph::brandes_betweenness_centrality_dispatch2(const Graph&, CentralityMap, EdgeCentralityMap, WeightMap, VertexIndexMap) [with Graph = boost::adjacency_list >, boost::property > >; CentralityMap = boost::vec_adj_list_vertex_property_map >, boost::property > >, boost::adjacency_list >, boost::property > >*, double, double&, boost::vertex_centrality_t>; EdgeCentralityMap = boost::adj_list_edge_property_map >, boost::edge_centrality_t>; WeightMap = boost::adj_list_edge_property_map >, boost::edge_weight_t>; VertexIndexMap = boost::vec_adj_list_vertex_id_map >, long unsigned int>]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/betweenness_centrality.hpp:517:57: required from ‘static void boost::detail::graph::brandes_betweenness_centrality_dispatch1::run(const Graph&, CentralityMap, EdgeCentralityMap, VertexIndexMap, WeightMap) [with Graph = boost::adjacency_list >, boost::property > >; CentralityMap = boost::vec_adj_list_vertex_property_map >, boost::property > >, boost::adjacency_list >, boost::property > >*, double, double&, boost::vertex_centrality_t>; EdgeCentralityMap = boost::adj_list_edge_property_map >, boost::edge_centrality_t>; VertexIndexMap = boost::vec_adj_list_vertex_id_map >, long unsigned int>; WeightMap = boost::adj_list_edge_property_map >, boost::edge_weight_t>]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/betweenness_centrality.hpp:558:71: required from ‘void boost::brandes_betweenness_centrality(const Graph&, const bgl_named_params&, typename enable_if_c::traversal_category>::value, graph::detail::no_parameter>::type) [with Graph = adjacency_list >, property > >; Param = adj_list_edge_property_map >, edge_weight_t>; Tag = edge_weight_t; Rest = bgl_named_params >, edge_centrality_t>, edge_centrality_t, bgl_named_params >, property > >, adjacency_list >, property > >*, double, double&, vertex_centrality_t>, vertex_centrality_t, no_property> >; typename enable_if_c::traversal_category>::value, graph::detail::no_parameter>::type = graph::detail::no_parameter; typename graph_traits::traversal_category = undir_adj_list_traversal_tag]’ bbc.cpp:67:33: required from here /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::EqualityComparable::~EqualityComparable() [with TT = __gnu_cxx::__normal_iterator > >]’ 37 | ~model() | ^ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:233:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 233 | BOOST_CONCEPT_USAGE(EqualityComparable) { | ^~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::InputIterator<__gnu_cxx::__normal_iterator > > >]’: /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements > > > >]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:512:7: required from ‘struct boost::InputIterator<__gnu_cxx::__normal_iterator > > >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:540:3: required from ‘struct boost::ForwardIterator<__gnu_cxx::__normal_iterator > > >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:568:3: required from ‘struct boost::BidirectionalIterator<__gnu_cxx::__normal_iterator > > >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:597:3: required from ‘struct boost::RandomAccessIterator<__gnu_cxx::__normal_iterator > > >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:597:3: [ skipping 4 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_ > > >)>’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/property_map/property_map.hpp:354:5: required from ‘boost::iterator_property_map >::value_type, typename std::iterator_traits< >::reference> boost::make_iterator_property_map(RAIter, ID) [with RAIter = __gnu_cxx::__normal_iterator > >; ID = vec_adj_list_vertex_id_map >, long unsigned int>; typename std::iterator_traits< >::value_type = double; typename std::iterator_traits< >::reference = double&]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/betweenness_centrality.hpp:470:43: required from ‘void boost::detail::graph::brandes_betweenness_centrality_dispatch2(const Graph&, CentralityMap, EdgeCentralityMap, WeightMap, VertexIndexMap) [with Graph = boost::adjacency_list >, boost::property > >; CentralityMap = boost::vec_adj_list_vertex_property_map >, boost::property > >, boost::adjacency_list >, boost::property > >*, double, double&, boost::vertex_centrality_t>; EdgeCentralityMap = boost::adj_list_edge_property_map >, boost::edge_centrality_t>; WeightMap = boost::adj_list_edge_property_map >, boost::edge_weight_t>; VertexIndexMap = boost::vec_adj_list_vertex_id_map >, long unsigned int>]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/betweenness_centrality.hpp:517:57: required from ‘static void boost::detail::graph::brandes_betweenness_centrality_dispatch1::run(const Graph&, CentralityMap, EdgeCentralityMap, VertexIndexMap, WeightMap) [with Graph = boost::adjacency_list >, boost::property > >; CentralityMap = boost::vec_adj_list_vertex_property_map >, boost::property > >, boost::adjacency_list >, boost::property > >*, double, double&, boost::vertex_centrality_t>; EdgeCentralityMap = boost::adj_list_edge_property_map >, boost::edge_centrality_t>; VertexIndexMap = boost::vec_adj_list_vertex_id_map >, long unsigned int>; WeightMap = boost::adj_list_edge_property_map >, boost::edge_weight_t>]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/betweenness_centrality.hpp:558:71: required from ‘void boost::brandes_betweenness_centrality(const Graph&, const bgl_named_params&, typename enable_if_c::traversal_category>::value, graph::detail::no_parameter>::type) [with Graph = adjacency_list >, property > >; Param = adj_list_edge_property_map >, edge_weight_t>; Tag = edge_weight_t; Rest = bgl_named_params >, edge_centrality_t>, edge_centrality_t, bgl_named_params >, property > >, adjacency_list >, property > >*, double, double&, vertex_centrality_t>, vertex_centrality_t, no_property> >; typename enable_if_c::traversal_category>::value, graph::detail::no_parameter>::type = graph::detail::no_parameter; typename graph_traits::traversal_category = undir_adj_list_traversal_tag]’ bbc.cpp:67:33: required from here /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::InputIterator::~InputIterator() [with TT = __gnu_cxx::__normal_iterator > >]’ 37 | ~model() | ^ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:512:7: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 512 | BOOST_CONCEPT_USAGE(InputIterator) | ^~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::ForwardIterator<__gnu_cxx::__normal_iterator > > >]’: /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements > > > >]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:543:7: required from ‘struct boost::ForwardIterator<__gnu_cxx::__normal_iterator > > >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:568:3: required from ‘struct boost::BidirectionalIterator<__gnu_cxx::__normal_iterator > > >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:597:3: required from ‘struct boost::RandomAccessIterator<__gnu_cxx::__normal_iterator > > >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:597:3: required from ‘struct boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator > > >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:32:62: [ skipping 3 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_ > > >)>’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/property_map/property_map.hpp:354:5: required from ‘boost::iterator_property_map >::value_type, typename std::iterator_traits< >::reference> boost::make_iterator_property_map(RAIter, ID) [with RAIter = __gnu_cxx::__normal_iterator > >; ID = vec_adj_list_vertex_id_map >, long unsigned int>; typename std::iterator_traits< >::value_type = double; typename std::iterator_traits< >::reference = double&]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/betweenness_centrality.hpp:470:43: required from ‘void boost::detail::graph::brandes_betweenness_centrality_dispatch2(const Graph&, CentralityMap, EdgeCentralityMap, WeightMap, VertexIndexMap) [with Graph = boost::adjacency_list >, boost::property > >; CentralityMap = boost::vec_adj_list_vertex_property_map >, boost::property > >, boost::adjacency_list >, boost::property > >*, double, double&, boost::vertex_centrality_t>; EdgeCentralityMap = boost::adj_list_edge_property_map >, boost::edge_centrality_t>; WeightMap = boost::adj_list_edge_property_map >, boost::edge_weight_t>; VertexIndexMap = boost::vec_adj_list_vertex_id_map >, long unsigned int>]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/betweenness_centrality.hpp:517:57: required from ‘static void boost::detail::graph::brandes_betweenness_centrality_dispatch1::run(const Graph&, CentralityMap, EdgeCentralityMap, VertexIndexMap, WeightMap) [with Graph = boost::adjacency_list >, boost::property > >; CentralityMap = boost::vec_adj_list_vertex_property_map >, boost::property > >, boost::adjacency_list >, boost::property > >*, double, double&, boost::vertex_centrality_t>; EdgeCentralityMap = boost::adj_list_edge_property_map >, boost::edge_centrality_t>; VertexIndexMap = boost::vec_adj_list_vertex_id_map >, long unsigned int>; WeightMap = boost::adj_list_edge_property_map >, boost::edge_weight_t>]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/betweenness_centrality.hpp:558:71: required from ‘void boost::brandes_betweenness_centrality(const Graph&, const bgl_named_params&, typename enable_if_c::traversal_category>::value, graph::detail::no_parameter>::type) [with Graph = adjacency_list >, property > >; Param = adj_list_edge_property_map >, edge_weight_t>; Tag = edge_weight_t; Rest = bgl_named_params >, edge_centrality_t>, edge_centrality_t, bgl_named_params >, property > >, adjacency_list >, property > >*, double, double&, vertex_centrality_t>, vertex_centrality_t, no_property> >; typename enable_if_c::traversal_category>::value, graph::detail::no_parameter>::type = graph::detail::no_parameter; typename graph_traits::traversal_category = undir_adj_list_traversal_tag]’ bbc.cpp:67:33: required from here /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::ForwardIterator::~ForwardIterator() [with TT = __gnu_cxx::__normal_iterator > >]’ 37 | ~model() | ^ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:543:7: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 543 | BOOST_CONCEPT_USAGE(ForwardIterator) | ^~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::BidirectionalIterator<__gnu_cxx::__normal_iterator > > >]’: /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements > > > >]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:571:7: required from ‘struct boost::BidirectionalIterator<__gnu_cxx::__normal_iterator > > >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:597:3: required from ‘struct boost::RandomAccessIterator<__gnu_cxx::__normal_iterator > > >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:597:3: required from ‘struct boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator > > >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator > > >]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:42:5: [ skipping 2 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_ > > >)>’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/property_map/property_map.hpp:354:5: required from ‘boost::iterator_property_map >::value_type, typename std::iterator_traits< >::reference> boost::make_iterator_property_map(RAIter, ID) [with RAIter = __gnu_cxx::__normal_iterator > >; ID = vec_adj_list_vertex_id_map >, long unsigned int>; typename std::iterator_traits< >::value_type = double; typename std::iterator_traits< >::reference = double&]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/betweenness_centrality.hpp:470:43: required from ‘void boost::detail::graph::brandes_betweenness_centrality_dispatch2(const Graph&, CentralityMap, EdgeCentralityMap, WeightMap, VertexIndexMap) [with Graph = boost::adjacency_list >, boost::property > >; CentralityMap = boost::vec_adj_list_vertex_property_map >, boost::property > >, boost::adjacency_list >, boost::property > >*, double, double&, boost::vertex_centrality_t>; EdgeCentralityMap = boost::adj_list_edge_property_map >, boost::edge_centrality_t>; WeightMap = boost::adj_list_edge_property_map >, boost::edge_weight_t>; VertexIndexMap = boost::vec_adj_list_vertex_id_map >, long unsigned int>]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/betweenness_centrality.hpp:517:57: required from ‘static void boost::detail::graph::brandes_betweenness_centrality_dispatch1::run(const Graph&, CentralityMap, EdgeCentralityMap, VertexIndexMap, WeightMap) [with Graph = boost::adjacency_list >, boost::property > >; CentralityMap = boost::vec_adj_list_vertex_property_map >, boost::property > >, boost::adjacency_list >, boost::property > >*, double, double&, boost::vertex_centrality_t>; EdgeCentralityMap = boost::adj_list_edge_property_map >, boost::edge_centrality_t>; VertexIndexMap = boost::vec_adj_list_vertex_id_map >, long unsigned int>; WeightMap = boost::adj_list_edge_property_map >, boost::edge_weight_t>]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/betweenness_centrality.hpp:558:71: required from ‘void boost::brandes_betweenness_centrality(const Graph&, const bgl_named_params&, typename enable_if_c::traversal_category>::value, graph::detail::no_parameter>::type) [with Graph = adjacency_list >, property > >; Param = adj_list_edge_property_map >, edge_weight_t>; Tag = edge_weight_t; Rest = bgl_named_params >, edge_centrality_t>, edge_centrality_t, bgl_named_params >, property > >, adjacency_list >, property > >*, double, double&, vertex_centrality_t>, vertex_centrality_t, no_property> >; typename enable_if_c::traversal_category>::value, graph::detail::no_parameter>::type = graph::detail::no_parameter; typename graph_traits::traversal_category = undir_adj_list_traversal_tag]’ bbc.cpp:67:33: required from here /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::BidirectionalIterator::~BidirectionalIterator() [with TT = __gnu_cxx::__normal_iterator > >]’ 37 | ~model() | ^ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:571:7: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 571 | BOOST_CONCEPT_USAGE(BidirectionalIterator) | ^~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::Comparable<__gnu_cxx::__normal_iterator > > >]’: /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements > > > >]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:253:5: required from ‘struct boost::Comparable<__gnu_cxx::__normal_iterator > > >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:597:3: required from ‘struct boost::RandomAccessIterator<__gnu_cxx::__normal_iterator > > >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:597:3: required from ‘struct boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator > > >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator > > >]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:42:5: [ skipping 2 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_ > > >)>’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/property_map/property_map.hpp:354:5: required from ‘boost::iterator_property_map >::value_type, typename std::iterator_traits< >::reference> boost::make_iterator_property_map(RAIter, ID) [with RAIter = __gnu_cxx::__normal_iterator > >; ID = vec_adj_list_vertex_id_map >, long unsigned int>; typename std::iterator_traits< >::value_type = double; typename std::iterator_traits< >::reference = double&]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/betweenness_centrality.hpp:470:43: required from ‘void boost::detail::graph::brandes_betweenness_centrality_dispatch2(const Graph&, CentralityMap, EdgeCentralityMap, WeightMap, VertexIndexMap) [with Graph = boost::adjacency_list >, boost::property > >; CentralityMap = boost::vec_adj_list_vertex_property_map >, boost::property > >, boost::adjacency_list >, boost::property > >*, double, double&, boost::vertex_centrality_t>; EdgeCentralityMap = boost::adj_list_edge_property_map >, boost::edge_centrality_t>; WeightMap = boost::adj_list_edge_property_map >, boost::edge_weight_t>; VertexIndexMap = boost::vec_adj_list_vertex_id_map >, long unsigned int>]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/betweenness_centrality.hpp:517:57: required from ‘static void boost::detail::graph::brandes_betweenness_centrality_dispatch1::run(const Graph&, CentralityMap, EdgeCentralityMap, VertexIndexMap, WeightMap) [with Graph = boost::adjacency_list >, boost::property > >; CentralityMap = boost::vec_adj_list_vertex_property_map >, boost::property > >, boost::adjacency_list >, boost::property > >*, double, double&, boost::vertex_centrality_t>; EdgeCentralityMap = boost::adj_list_edge_property_map >, boost::edge_centrality_t>; VertexIndexMap = boost::vec_adj_list_vertex_id_map >, long unsigned int>; WeightMap = boost::adj_list_edge_property_map >, boost::edge_weight_t>]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/betweenness_centrality.hpp:558:71: required from ‘void boost::brandes_betweenness_centrality(const Graph&, const bgl_named_params&, typename enable_if_c::traversal_category>::value, graph::detail::no_parameter>::type) [with Graph = adjacency_list >, property > >; Param = adj_list_edge_property_map >, edge_weight_t>; Tag = edge_weight_t; Rest = bgl_named_params >, edge_centrality_t>, edge_centrality_t, bgl_named_params >, property > >, adjacency_list >, property > >*, double, double&, vertex_centrality_t>, vertex_centrality_t, no_property> >; typename enable_if_c::traversal_category>::value, graph::detail::no_parameter>::type = graph::detail::no_parameter; typename graph_traits::traversal_category = undir_adj_list_traversal_tag]’ bbc.cpp:67:33: required from here /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::Comparable::~Comparable() [with TT = __gnu_cxx::__normal_iterator > >]’ 37 | ~model() | ^ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:253:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 253 | BOOST_CONCEPT_USAGE(Comparable) { | ^~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::RandomAccessIterator<__gnu_cxx::__normal_iterator > > >]’: /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements > > > >]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:601:7: required from ‘struct boost::RandomAccessIterator<__gnu_cxx::__normal_iterator > > >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:597:3: required from ‘struct boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator > > >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator > > >]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:42:5: [ skipping 2 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_ > > >)>’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/property_map/property_map.hpp:354:5: required from ‘boost::iterator_property_map >::value_type, typename std::iterator_traits< >::reference> boost::make_iterator_property_map(RAIter, ID) [with RAIter = __gnu_cxx::__normal_iterator > >; ID = vec_adj_list_vertex_id_map >, long unsigned int>; typename std::iterator_traits< >::value_type = double; typename std::iterator_traits< >::reference = double&]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/betweenness_centrality.hpp:470:43: required from ‘void boost::detail::graph::brandes_betweenness_centrality_dispatch2(const Graph&, CentralityMap, EdgeCentralityMap, WeightMap, VertexIndexMap) [with Graph = boost::adjacency_list >, boost::property > >; CentralityMap = boost::vec_adj_list_vertex_property_map >, boost::property > >, boost::adjacency_list >, boost::property > >*, double, double&, boost::vertex_centrality_t>; EdgeCentralityMap = boost::adj_list_edge_property_map >, boost::edge_centrality_t>; WeightMap = boost::adj_list_edge_property_map >, boost::edge_weight_t>; VertexIndexMap = boost::vec_adj_list_vertex_id_map >, long unsigned int>]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/betweenness_centrality.hpp:517:57: required from ‘static void boost::detail::graph::brandes_betweenness_centrality_dispatch1::run(const Graph&, CentralityMap, EdgeCentralityMap, VertexIndexMap, WeightMap) [with Graph = boost::adjacency_list >, boost::property > >; CentralityMap = boost::vec_adj_list_vertex_property_map >, boost::property > >, boost::adjacency_list >, boost::property > >*, double, double&, boost::vertex_centrality_t>; EdgeCentralityMap = boost::adj_list_edge_property_map >, boost::edge_centrality_t>; VertexIndexMap = boost::vec_adj_list_vertex_id_map >, long unsigned int>; WeightMap = boost::adj_list_edge_property_map >, boost::edge_weight_t>]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/betweenness_centrality.hpp:558:71: required from ‘void boost::brandes_betweenness_centrality(const Graph&, const bgl_named_params&, typename enable_if_c::traversal_category>::value, graph::detail::no_parameter>::type) [with Graph = adjacency_list >, property > >; Param = adj_list_edge_property_map >, edge_weight_t>; Tag = edge_weight_t; Rest = bgl_named_params >, edge_centrality_t>, edge_centrality_t, bgl_named_params >, property > >, adjacency_list >, property > >*, double, double&, vertex_centrality_t>, vertex_centrality_t, no_property> >; typename enable_if_c::traversal_category>::value, graph::detail::no_parameter>::type = graph::detail::no_parameter; typename graph_traits::traversal_category = undir_adj_list_traversal_tag]’ bbc.cpp:67:33: required from here /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::RandomAccessIterator::~RandomAccessIterator() [with TT = __gnu_cxx::__normal_iterator > >]’ 37 | ~model() | ^ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:601:7: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 601 | BOOST_CONCEPT_USAGE(RandomAccessIterator) | ^~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::Assignable<__gnu_cxx::__normal_iterator > > >]’: /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements > > > >]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:145:5: required from ‘struct boost::Assignable<__gnu_cxx::__normal_iterator > > >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:502:3: required from ‘struct boost::InputIterator<__gnu_cxx::__normal_iterator > > >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:540:3: required from ‘struct boost::ForwardIterator<__gnu_cxx::__normal_iterator > > >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:568:3: required from ‘struct boost::BidirectionalIterator<__gnu_cxx::__normal_iterator > > >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:597:3: [ skipping 5 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_ > > >)>’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/property_map/property_map.hpp:354:5: required from ‘boost::iterator_property_map >::value_type, typename std::iterator_traits< >::reference> boost::make_iterator_property_map(RAIter, ID) [with RAIter = __gnu_cxx::__normal_iterator > >; ID = vec_adj_list_vertex_id_map >, long unsigned int>; typename std::iterator_traits< >::value_type = long unsigned int; typename std::iterator_traits< >::reference = long unsigned int&]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/betweenness_centrality.hpp:472:43: required from ‘void boost::detail::graph::brandes_betweenness_centrality_dispatch2(const Graph&, CentralityMap, EdgeCentralityMap, WeightMap, VertexIndexMap) [with Graph = boost::adjacency_list >, boost::property > >; CentralityMap = boost::vec_adj_list_vertex_property_map >, boost::property > >, boost::adjacency_list >, boost::property > >*, double, double&, boost::vertex_centrality_t>; EdgeCentralityMap = boost::adj_list_edge_property_map >, boost::edge_centrality_t>; WeightMap = boost::adj_list_edge_property_map >, boost::edge_weight_t>; VertexIndexMap = boost::vec_adj_list_vertex_id_map >, long unsigned int>]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/betweenness_centrality.hpp:517:57: required from ‘static void boost::detail::graph::brandes_betweenness_centrality_dispatch1::run(const Graph&, CentralityMap, EdgeCentralityMap, VertexIndexMap, WeightMap) [with Graph = boost::adjacency_list >, boost::property > >; CentralityMap = boost::vec_adj_list_vertex_property_map >, boost::property > >, boost::adjacency_list >, boost::property > >*, double, double&, boost::vertex_centrality_t>; EdgeCentralityMap = boost::adj_list_edge_property_map >, boost::edge_centrality_t>; VertexIndexMap = boost::vec_adj_list_vertex_id_map >, long unsigned int>; WeightMap = boost::adj_list_edge_property_map >, boost::edge_weight_t>]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/betweenness_centrality.hpp:558:71: required from ‘void boost::brandes_betweenness_centrality(const Graph&, const bgl_named_params&, typename enable_if_c::traversal_category>::value, graph::detail::no_parameter>::type) [with Graph = adjacency_list >, property > >; Param = adj_list_edge_property_map >, edge_weight_t>; Tag = edge_weight_t; Rest = bgl_named_params >, edge_centrality_t>, edge_centrality_t, bgl_named_params >, property > >, adjacency_list >, property > >*, double, double&, vertex_centrality_t>, vertex_centrality_t, no_property> >; typename enable_if_c::traversal_category>::value, graph::detail::no_parameter>::type = graph::detail::no_parameter; typename graph_traits::traversal_category = undir_adj_list_traversal_tag]’ bbc.cpp:67:33: required from here /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::Assignable::~Assignable() [with TT = __gnu_cxx::__normal_iterator > >]’ 37 | ~model() | ^ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:145:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 145 | BOOST_CONCEPT_USAGE(Assignable) { | ^~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::EqualityComparable<__gnu_cxx::__normal_iterator > > >]’: /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements > > > >]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:233:5: required from ‘struct boost::EqualityComparable<__gnu_cxx::__normal_iterator > > >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:502:3: required from ‘struct boost::InputIterator<__gnu_cxx::__normal_iterator > > >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:540:3: required from ‘struct boost::ForwardIterator<__gnu_cxx::__normal_iterator > > >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:568:3: required from ‘struct boost::BidirectionalIterator<__gnu_cxx::__normal_iterator > > >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:597:3: [ skipping 5 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_ > > >)>’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/property_map/property_map.hpp:354:5: required from ‘boost::iterator_property_map >::value_type, typename std::iterator_traits< >::reference> boost::make_iterator_property_map(RAIter, ID) [with RAIter = __gnu_cxx::__normal_iterator > >; ID = vec_adj_list_vertex_id_map >, long unsigned int>; typename std::iterator_traits< >::value_type = long unsigned int; typename std::iterator_traits< >::reference = long unsigned int&]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/betweenness_centrality.hpp:472:43: required from ‘void boost::detail::graph::brandes_betweenness_centrality_dispatch2(const Graph&, CentralityMap, EdgeCentralityMap, WeightMap, VertexIndexMap) [with Graph = boost::adjacency_list >, boost::property > >; CentralityMap = boost::vec_adj_list_vertex_property_map >, boost::property > >, boost::adjacency_list >, boost::property > >*, double, double&, boost::vertex_centrality_t>; EdgeCentralityMap = boost::adj_list_edge_property_map >, boost::edge_centrality_t>; WeightMap = boost::adj_list_edge_property_map >, boost::edge_weight_t>; VertexIndexMap = boost::vec_adj_list_vertex_id_map >, long unsigned int>]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/betweenness_centrality.hpp:517:57: required from ‘static void boost::detail::graph::brandes_betweenness_centrality_dispatch1::run(const Graph&, CentralityMap, EdgeCentralityMap, VertexIndexMap, WeightMap) [with Graph = boost::adjacency_list >, boost::property > >; CentralityMap = boost::vec_adj_list_vertex_property_map >, boost::property > >, boost::adjacency_list >, boost::property > >*, double, double&, boost::vertex_centrality_t>; EdgeCentralityMap = boost::adj_list_edge_property_map >, boost::edge_centrality_t>; VertexIndexMap = boost::vec_adj_list_vertex_id_map >, long unsigned int>; WeightMap = boost::adj_list_edge_property_map >, boost::edge_weight_t>]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/betweenness_centrality.hpp:558:71: required from ‘void boost::brandes_betweenness_centrality(const Graph&, const bgl_named_params&, typename enable_if_c::traversal_category>::value, graph::detail::no_parameter>::type) [with Graph = adjacency_list >, property > >; Param = adj_list_edge_property_map >, edge_weight_t>; Tag = edge_weight_t; Rest = bgl_named_params >, edge_centrality_t>, edge_centrality_t, bgl_named_params >, property > >, adjacency_list >, property > >*, double, double&, vertex_centrality_t>, vertex_centrality_t, no_property> >; typename enable_if_c::traversal_category>::value, graph::detail::no_parameter>::type = graph::detail::no_parameter; typename graph_traits::traversal_category = undir_adj_list_traversal_tag]’ bbc.cpp:67:33: required from here /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::EqualityComparable::~EqualityComparable() [with TT = __gnu_cxx::__normal_iterator > >]’ 37 | ~model() | ^ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:233:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 233 | BOOST_CONCEPT_USAGE(EqualityComparable) { | ^~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::InputIterator<__gnu_cxx::__normal_iterator > > >]’: /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements > > > >]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:512:7: required from ‘struct boost::InputIterator<__gnu_cxx::__normal_iterator > > >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:540:3: required from ‘struct boost::ForwardIterator<__gnu_cxx::__normal_iterator > > >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:568:3: required from ‘struct boost::BidirectionalIterator<__gnu_cxx::__normal_iterator > > >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:597:3: required from ‘struct boost::RandomAccessIterator<__gnu_cxx::__normal_iterator > > >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:597:3: [ skipping 4 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_ > > >)>’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/property_map/property_map.hpp:354:5: required from ‘boost::iterator_property_map >::value_type, typename std::iterator_traits< >::reference> boost::make_iterator_property_map(RAIter, ID) [with RAIter = __gnu_cxx::__normal_iterator > >; ID = vec_adj_list_vertex_id_map >, long unsigned int>; typename std::iterator_traits< >::value_type = long unsigned int; typename std::iterator_traits< >::reference = long unsigned int&]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/betweenness_centrality.hpp:472:43: required from ‘void boost::detail::graph::brandes_betweenness_centrality_dispatch2(const Graph&, CentralityMap, EdgeCentralityMap, WeightMap, VertexIndexMap) [with Graph = boost::adjacency_list >, boost::property > >; CentralityMap = boost::vec_adj_list_vertex_property_map >, boost::property > >, boost::adjacency_list >, boost::property > >*, double, double&, boost::vertex_centrality_t>; EdgeCentralityMap = boost::adj_list_edge_property_map >, boost::edge_centrality_t>; WeightMap = boost::adj_list_edge_property_map >, boost::edge_weight_t>; VertexIndexMap = boost::vec_adj_list_vertex_id_map >, long unsigned int>]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/betweenness_centrality.hpp:517:57: required from ‘static void boost::detail::graph::brandes_betweenness_centrality_dispatch1::run(const Graph&, CentralityMap, EdgeCentralityMap, VertexIndexMap, WeightMap) [with Graph = boost::adjacency_list >, boost::property > >; CentralityMap = boost::vec_adj_list_vertex_property_map >, boost::property > >, boost::adjacency_list >, boost::property > >*, double, double&, boost::vertex_centrality_t>; EdgeCentralityMap = boost::adj_list_edge_property_map >, boost::edge_centrality_t>; VertexIndexMap = boost::vec_adj_list_vertex_id_map >, long unsigned int>; WeightMap = boost::adj_list_edge_property_map >, boost::edge_weight_t>]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/betweenness_centrality.hpp:558:71: required from ‘void boost::brandes_betweenness_centrality(const Graph&, const bgl_named_params&, typename enable_if_c::traversal_category>::value, graph::detail::no_parameter>::type) [with Graph = adjacency_list >, property > >; Param = adj_list_edge_property_map >, edge_weight_t>; Tag = edge_weight_t; Rest = bgl_named_params >, edge_centrality_t>, edge_centrality_t, bgl_named_params >, property > >, adjacency_list >, property > >*, double, double&, vertex_centrality_t>, vertex_centrality_t, no_property> >; typename enable_if_c::traversal_category>::value, graph::detail::no_parameter>::type = graph::detail::no_parameter; typename graph_traits::traversal_category = undir_adj_list_traversal_tag]’ bbc.cpp:67:33: required from here /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::InputIterator::~InputIterator() [with TT = __gnu_cxx::__normal_iterator > >]’ 37 | ~model() | ^ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:512:7: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 512 | BOOST_CONCEPT_USAGE(InputIterator) | ^~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::ForwardIterator<__gnu_cxx::__normal_iterator > > >]’: /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements > > > >]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:543:7: required from ‘struct boost::ForwardIterator<__gnu_cxx::__normal_iterator > > >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:568:3: required from ‘struct boost::BidirectionalIterator<__gnu_cxx::__normal_iterator > > >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:597:3: required from ‘struct boost::RandomAccessIterator<__gnu_cxx::__normal_iterator > > >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:597:3: required from ‘struct boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator > > >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:32:62: [ skipping 3 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_ > > >)>’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/property_map/property_map.hpp:354:5: required from ‘boost::iterator_property_map >::value_type, typename std::iterator_traits< >::reference> boost::make_iterator_property_map(RAIter, ID) [with RAIter = __gnu_cxx::__normal_iterator > >; ID = vec_adj_list_vertex_id_map >, long unsigned int>; typename std::iterator_traits< >::value_type = long unsigned int; typename std::iterator_traits< >::reference = long unsigned int&]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/betweenness_centrality.hpp:472:43: required from ‘void boost::detail::graph::brandes_betweenness_centrality_dispatch2(const Graph&, CentralityMap, EdgeCentralityMap, WeightMap, VertexIndexMap) [with Graph = boost::adjacency_list >, boost::property > >; CentralityMap = boost::vec_adj_list_vertex_property_map >, boost::property > >, boost::adjacency_list >, boost::property > >*, double, double&, boost::vertex_centrality_t>; EdgeCentralityMap = boost::adj_list_edge_property_map >, boost::edge_centrality_t>; WeightMap = boost::adj_list_edge_property_map >, boost::edge_weight_t>; VertexIndexMap = boost::vec_adj_list_vertex_id_map >, long unsigned int>]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/betweenness_centrality.hpp:517:57: required from ‘static void boost::detail::graph::brandes_betweenness_centrality_dispatch1::run(const Graph&, CentralityMap, EdgeCentralityMap, VertexIndexMap, WeightMap) [with Graph = boost::adjacency_list >, boost::property > >; CentralityMap = boost::vec_adj_list_vertex_property_map >, boost::property > >, boost::adjacency_list >, boost::property > >*, double, double&, boost::vertex_centrality_t>; EdgeCentralityMap = boost::adj_list_edge_property_map >, boost::edge_centrality_t>; VertexIndexMap = boost::vec_adj_list_vertex_id_map >, long unsigned int>; WeightMap = boost::adj_list_edge_property_map >, boost::edge_weight_t>]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/betweenness_centrality.hpp:558:71: required from ‘void boost::brandes_betweenness_centrality(const Graph&, const bgl_named_params&, typename enable_if_c::traversal_category>::value, graph::detail::no_parameter>::type) [with Graph = adjacency_list >, property > >; Param = adj_list_edge_property_map >, edge_weight_t>; Tag = edge_weight_t; Rest = bgl_named_params >, edge_centrality_t>, edge_centrality_t, bgl_named_params >, property > >, adjacency_list >, property > >*, double, double&, vertex_centrality_t>, vertex_centrality_t, no_property> >; typename enable_if_c::traversal_category>::value, graph::detail::no_parameter>::type = graph::detail::no_parameter; typename graph_traits::traversal_category = undir_adj_list_traversal_tag]’ bbc.cpp:67:33: required from here /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::ForwardIterator::~ForwardIterator() [with TT = __gnu_cxx::__normal_iterator > >]’ 37 | ~model() | ^ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:543:7: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 543 | BOOST_CONCEPT_USAGE(ForwardIterator) | ^~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::BidirectionalIterator<__gnu_cxx::__normal_iterator > > >]’: /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements > > > >]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:571:7: required from ‘struct boost::BidirectionalIterator<__gnu_cxx::__normal_iterator > > >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:597:3: required from ‘struct boost::RandomAccessIterator<__gnu_cxx::__normal_iterator > > >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:597:3: required from ‘struct boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator > > >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator > > >]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:42:5: [ skipping 2 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_ > > >)>’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/property_map/property_map.hpp:354:5: required from ‘boost::iterator_property_map >::value_type, typename std::iterator_traits< >::reference> boost::make_iterator_property_map(RAIter, ID) [with RAIter = __gnu_cxx::__normal_iterator > >; ID = vec_adj_list_vertex_id_map >, long unsigned int>; typename std::iterator_traits< >::value_type = long unsigned int; typename std::iterator_traits< >::reference = long unsigned int&]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/betweenness_centrality.hpp:472:43: required from ‘void boost::detail::graph::brandes_betweenness_centrality_dispatch2(const Graph&, CentralityMap, EdgeCentralityMap, WeightMap, VertexIndexMap) [with Graph = boost::adjacency_list >, boost::property > >; CentralityMap = boost::vec_adj_list_vertex_property_map >, boost::property > >, boost::adjacency_list >, boost::property > >*, double, double&, boost::vertex_centrality_t>; EdgeCentralityMap = boost::adj_list_edge_property_map >, boost::edge_centrality_t>; WeightMap = boost::adj_list_edge_property_map >, boost::edge_weight_t>; VertexIndexMap = boost::vec_adj_list_vertex_id_map >, long unsigned int>]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/betweenness_centrality.hpp:517:57: required from ‘static void boost::detail::graph::brandes_betweenness_centrality_dispatch1::run(const Graph&, CentralityMap, EdgeCentralityMap, VertexIndexMap, WeightMap) [with Graph = boost::adjacency_list >, boost::property > >; CentralityMap = boost::vec_adj_list_vertex_property_map >, boost::property > >, boost::adjacency_list >, boost::property > >*, double, double&, boost::vertex_centrality_t>; EdgeCentralityMap = boost::adj_list_edge_property_map >, boost::edge_centrality_t>; VertexIndexMap = boost::vec_adj_list_vertex_id_map >, long unsigned int>; WeightMap = boost::adj_list_edge_property_map >, boost::edge_weight_t>]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/betweenness_centrality.hpp:558:71: required from ‘void boost::brandes_betweenness_centrality(const Graph&, const bgl_named_params&, typename enable_if_c::traversal_category>::value, graph::detail::no_parameter>::type) [with Graph = adjacency_list >, property > >; Param = adj_list_edge_property_map >, edge_weight_t>; Tag = edge_weight_t; Rest = bgl_named_params >, edge_centrality_t>, edge_centrality_t, bgl_named_params >, property > >, adjacency_list >, property > >*, double, double&, vertex_centrality_t>, vertex_centrality_t, no_property> >; typename enable_if_c::traversal_category>::value, graph::detail::no_parameter>::type = graph::detail::no_parameter; typename graph_traits::traversal_category = undir_adj_list_traversal_tag]’ bbc.cpp:67:33: required from here /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::BidirectionalIterator::~BidirectionalIterator() [with TT = __gnu_cxx::__normal_iterator > >]’ 37 | ~model() | ^ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:571:7: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 571 | BOOST_CONCEPT_USAGE(BidirectionalIterator) | ^~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::Comparable<__gnu_cxx::__normal_iterator > > >]’: /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements > > > >]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:253:5: required from ‘struct boost::Comparable<__gnu_cxx::__normal_iterator > > >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:597:3: required from ‘struct boost::RandomAccessIterator<__gnu_cxx::__normal_iterator > > >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:597:3: required from ‘struct boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator > > >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator > > >]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:42:5: [ skipping 2 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_ > > >)>’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/property_map/property_map.hpp:354:5: required from ‘boost::iterator_property_map >::value_type, typename std::iterator_traits< >::reference> boost::make_iterator_property_map(RAIter, ID) [with RAIter = __gnu_cxx::__normal_iterator > >; ID = vec_adj_list_vertex_id_map >, long unsigned int>; typename std::iterator_traits< >::value_type = long unsigned int; typename std::iterator_traits< >::reference = long unsigned int&]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/betweenness_centrality.hpp:472:43: required from ‘void boost::detail::graph::brandes_betweenness_centrality_dispatch2(const Graph&, CentralityMap, EdgeCentralityMap, WeightMap, VertexIndexMap) [with Graph = boost::adjacency_list >, boost::property > >; CentralityMap = boost::vec_adj_list_vertex_property_map >, boost::property > >, boost::adjacency_list >, boost::property > >*, double, double&, boost::vertex_centrality_t>; EdgeCentralityMap = boost::adj_list_edge_property_map >, boost::edge_centrality_t>; WeightMap = boost::adj_list_edge_property_map >, boost::edge_weight_t>; VertexIndexMap = boost::vec_adj_list_vertex_id_map >, long unsigned int>]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/betweenness_centrality.hpp:517:57: required from ‘static void boost::detail::graph::brandes_betweenness_centrality_dispatch1::run(const Graph&, CentralityMap, EdgeCentralityMap, VertexIndexMap, WeightMap) [with Graph = boost::adjacency_list >, boost::property > >; CentralityMap = boost::vec_adj_list_vertex_property_map >, boost::property > >, boost::adjacency_list >, boost::property > >*, double, double&, boost::vertex_centrality_t>; EdgeCentralityMap = boost::adj_list_edge_property_map >, boost::edge_centrality_t>; VertexIndexMap = boost::vec_adj_list_vertex_id_map >, long unsigned int>; WeightMap = boost::adj_list_edge_property_map >, boost::edge_weight_t>]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/betweenness_centrality.hpp:558:71: required from ‘void boost::brandes_betweenness_centrality(const Graph&, const bgl_named_params&, typename enable_if_c::traversal_category>::value, graph::detail::no_parameter>::type) [with Graph = adjacency_list >, property > >; Param = adj_list_edge_property_map >, edge_weight_t>; Tag = edge_weight_t; Rest = bgl_named_params >, edge_centrality_t>, edge_centrality_t, bgl_named_params >, property > >, adjacency_list >, property > >*, double, double&, vertex_centrality_t>, vertex_centrality_t, no_property> >; typename enable_if_c::traversal_category>::value, graph::detail::no_parameter>::type = graph::detail::no_parameter; typename graph_traits::traversal_category = undir_adj_list_traversal_tag]’ bbc.cpp:67:33: required from here /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::Comparable::~Comparable() [with TT = __gnu_cxx::__normal_iterator > >]’ 37 | ~model() | ^ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:253:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 253 | BOOST_CONCEPT_USAGE(Comparable) { | ^~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::RandomAccessIterator<__gnu_cxx::__normal_iterator > > >]’: /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements > > > >]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:601:7: required from ‘struct boost::RandomAccessIterator<__gnu_cxx::__normal_iterator > > >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:597:3: required from ‘struct boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator > > >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator > > >]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:42:5: [ skipping 2 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_ > > >)>’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/property_map/property_map.hpp:354:5: required from ‘boost::iterator_property_map >::value_type, typename std::iterator_traits< >::reference> boost::make_iterator_property_map(RAIter, ID) [with RAIter = __gnu_cxx::__normal_iterator > >; ID = vec_adj_list_vertex_id_map >, long unsigned int>; typename std::iterator_traits< >::value_type = long unsigned int; typename std::iterator_traits< >::reference = long unsigned int&]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/betweenness_centrality.hpp:472:43: required from ‘void boost::detail::graph::brandes_betweenness_centrality_dispatch2(const Graph&, CentralityMap, EdgeCentralityMap, WeightMap, VertexIndexMap) [with Graph = boost::adjacency_list >, boost::property > >; CentralityMap = boost::vec_adj_list_vertex_property_map >, boost::property > >, boost::adjacency_list >, boost::property > >*, double, double&, boost::vertex_centrality_t>; EdgeCentralityMap = boost::adj_list_edge_property_map >, boost::edge_centrality_t>; WeightMap = boost::adj_list_edge_property_map >, boost::edge_weight_t>; VertexIndexMap = boost::vec_adj_list_vertex_id_map >, long unsigned int>]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/betweenness_centrality.hpp:517:57: required from ‘static void boost::detail::graph::brandes_betweenness_centrality_dispatch1::run(const Graph&, CentralityMap, EdgeCentralityMap, VertexIndexMap, WeightMap) [with Graph = boost::adjacency_list >, boost::property > >; CentralityMap = boost::vec_adj_list_vertex_property_map >, boost::property > >, boost::adjacency_list >, boost::property > >*, double, double&, boost::vertex_centrality_t>; EdgeCentralityMap = boost::adj_list_edge_property_map >, boost::edge_centrality_t>; VertexIndexMap = boost::vec_adj_list_vertex_id_map >, long unsigned int>; WeightMap = boost::adj_list_edge_property_map >, boost::edge_weight_t>]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/betweenness_centrality.hpp:558:71: required from ‘void boost::brandes_betweenness_centrality(const Graph&, const bgl_named_params&, typename enable_if_c::traversal_category>::value, graph::detail::no_parameter>::type) [with Graph = adjacency_list >, property > >; Param = adj_list_edge_property_map >, edge_weight_t>; Tag = edge_weight_t; Rest = bgl_named_params >, edge_centrality_t>, edge_centrality_t, bgl_named_params >, property > >, adjacency_list >, property > >*, double, double&, vertex_centrality_t>, vertex_centrality_t, no_property> >; typename enable_if_c::traversal_category>::value, graph::detail::no_parameter>::type = graph::detail::no_parameter; typename graph_traits::traversal_category = undir_adj_list_traversal_tag]’ bbc.cpp:67:33: required from here /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::RandomAccessIterator::~RandomAccessIterator() [with TT = __gnu_cxx::__normal_iterator > >]’ 37 | ~model() | ^ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:601:7: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 601 | BOOST_CONCEPT_USAGE(RandomAccessIterator) | ^~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements >]’: /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:208:5: required from ‘struct boost::Convertible’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::Convertible]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied >::value’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:72:8: [ skipping 2 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:597:3: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator, std::allocator > >*, std::vector, std::allocator > >, std::allocator, std::allocator > > > > > >]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/property_map/property_map.hpp:354:5: required from ‘boost::iterator_property_map >::value_type, typename std::iterator_traits< >::reference> boost::make_iterator_property_map(RAIter, ID) [with RAIter = __gnu_cxx::__normal_iterator, std::allocator > >*, std::vector, std::allocator > >, std::allocator, std::allocator > > > > >; ID = vec_adj_list_vertex_id_map >, long unsigned int>; typename std::iterator_traits< >::value_type = std::vector, std::allocator > >; typename std::iterator_traits< >::reference = std::vector, std::allocator > >&]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/betweenness_centrality.hpp:469:43: required from ‘void boost::detail::graph::brandes_betweenness_centrality_dispatch2(const Graph&, CentralityMap, EdgeCentralityMap, WeightMap, VertexIndexMap) [with Graph = boost::adjacency_list >, boost::property > >; CentralityMap = boost::vec_adj_list_vertex_property_map >, boost::property > >, boost::adjacency_list >, boost::property > >*, double, double&, boost::vertex_centrality_t>; EdgeCentralityMap = boost::adj_list_edge_property_map >, boost::edge_centrality_t>; WeightMap = boost::adj_list_edge_property_map >, boost::edge_weight_t>; VertexIndexMap = boost::vec_adj_list_vertex_id_map >, long unsigned int>]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/betweenness_centrality.hpp:517:57: required from ‘static void boost::detail::graph::brandes_betweenness_centrality_dispatch1::run(const Graph&, CentralityMap, EdgeCentralityMap, VertexIndexMap, WeightMap) [with Graph = boost::adjacency_list >, boost::property > >; CentralityMap = boost::vec_adj_list_vertex_property_map >, boost::property > >, boost::adjacency_list >, boost::property > >*, double, double&, boost::vertex_centrality_t>; EdgeCentralityMap = boost::adj_list_edge_property_map >, boost::edge_centrality_t>; VertexIndexMap = boost::vec_adj_list_vertex_id_map >, long unsigned int>; WeightMap = boost::adj_list_edge_property_map >, boost::edge_weight_t>]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/betweenness_centrality.hpp:558:71: required from ‘void boost::brandes_betweenness_centrality(const Graph&, const bgl_named_params&, typename enable_if_c::traversal_category>::value, graph::detail::no_parameter>::type) [with Graph = adjacency_list >, property > >; Param = adj_list_edge_property_map >, edge_weight_t>; Tag = edge_weight_t; Rest = bgl_named_params >, edge_centrality_t>, edge_centrality_t, bgl_named_params >, property > >, adjacency_list >, property > >*, double, double&, vertex_centrality_t>, vertex_centrality_t, no_property> >; typename enable_if_c::traversal_category>::value, graph::detail::no_parameter>::type = graph::detail::no_parameter; typename graph_traits::traversal_category = undir_adj_list_traversal_tag]’ bbc.cpp:67:33: required from here /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::Convertible]’ 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ^ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::Convertible]’: /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:603:11: required from ‘boost::RandomAccessIterator::~RandomAccessIterator() [with TT = __gnu_cxx::__normal_iterator, std::allocator > >*, std::vector, std::allocator > >, std::allocator, std::allocator > > > > >]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:597:3: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator, std::allocator > >*, std::vector, std::allocator > >, std::allocator, std::allocator > > > > > >]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/property_map/property_map.hpp:354:5: required from ‘boost::iterator_property_map >::value_type, typename std::iterator_traits< >::reference> boost::make_iterator_property_map(RAIter, ID) [with RAIter = __gnu_cxx::__normal_iterator, std::allocator > >*, std::vector, std::allocator > >, std::allocator, std::allocator > > > > >; ID = vec_adj_list_vertex_id_map >, long unsigned int>; typename std::iterator_traits< >::value_type = std::vector, std::allocator > >; typename std::iterator_traits< >::reference = std::vector, std::allocator > >&]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/betweenness_centrality.hpp:469:43: required from ‘void boost::detail::graph::brandes_betweenness_centrality_dispatch2(const Graph&, CentralityMap, EdgeCentralityMap, WeightMap, VertexIndexMap) [with Graph = boost::adjacency_list >, boost::property > >; CentralityMap = boost::vec_adj_list_vertex_property_map >, boost::property > >, boost::adjacency_list >, boost::property > >*, double, double&, boost::vertex_centrality_t>; EdgeCentralityMap = boost::adj_list_edge_property_map >, boost::edge_centrality_t>; WeightMap = boost::adj_list_edge_property_map >, boost::edge_weight_t>; VertexIndexMap = boost::vec_adj_list_vertex_id_map >, long unsigned int>]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/betweenness_centrality.hpp:517:57: required from ‘static void boost::detail::graph::brandes_betweenness_centrality_dispatch1::run(const Graph&, CentralityMap, EdgeCentralityMap, VertexIndexMap, WeightMap) [with Graph = boost::adjacency_list >, boost::property > >; CentralityMap = boost::vec_adj_list_vertex_property_map >, boost::property > >, boost::adjacency_list >, boost::property > >*, double, double&, boost::vertex_centrality_t>; EdgeCentralityMap = boost::adj_list_edge_property_map >, boost::edge_centrality_t>; VertexIndexMap = boost::vec_adj_list_vertex_id_map >, long unsigned int>; WeightMap = boost::adj_list_edge_property_map >, boost::edge_weight_t>]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/betweenness_centrality.hpp:558:71: required from ‘void boost::brandes_betweenness_centrality(const Graph&, const bgl_named_params&, typename enable_if_c::traversal_category>::value, graph::detail::no_parameter>::type) [with Graph = adjacency_list >, property > >; Param = adj_list_edge_property_map >, edge_weight_t>; Tag = edge_weight_t; Rest = bgl_named_params >, edge_centrality_t>, edge_centrality_t, bgl_named_params >, property > >, adjacency_list >, property > >*, double, double&, vertex_centrality_t>, vertex_centrality_t, no_property> >; typename enable_if_c::traversal_category>::value, graph::detail::no_parameter>::type = graph::detail::no_parameter; typename graph_traits::traversal_category = undir_adj_list_traversal_tag]’ bbc.cpp:67:33: required from here /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::Convertible::~Convertible() [with X = std::random_access_iterator_tag; Y = std::random_access_iterator_tag]’ 37 | ~model() | ^ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:208:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 208 | BOOST_CONCEPT_USAGE(Convertible) { | ^~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::SignedInteger]’: /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:514:9: required from ‘boost::InputIterator::~InputIterator() [with TT = __gnu_cxx::__normal_iterator, std::allocator > >*, std::vector, std::allocator > >, std::allocator, std::allocator > > > > >]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/usage.hpp:20:48: required from ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::InputIterator<__gnu_cxx::__normal_iterator, std::allocator > >*, std::vector, std::allocator > >, std::allocator, std::allocator > > > > > >]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements, std::allocator > >*, std::vector, std::allocator > >, std::allocator, std::allocator > > > > > > >]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:512:7: required from ‘struct boost::InputIterator<__gnu_cxx::__normal_iterator, std::allocator > >*, std::vector, std::allocator > >, std::allocator, std::allocator > > > > > >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:540:3: required from ‘struct boost::ForwardIterator<__gnu_cxx::__normal_iterator, std::allocator > >*, std::vector, std::allocator > >, std::allocator, std::allocator > > > > > >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:568:3: [ skipping 6 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_, std::allocator > >*, std::vector, std::allocator > >, std::allocator, std::allocator > > > > > >)>’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/property_map/property_map.hpp:354:5: required from ‘boost::iterator_property_map >::value_type, typename std::iterator_traits< >::reference> boost::make_iterator_property_map(RAIter, ID) [with RAIter = __gnu_cxx::__normal_iterator, std::allocator > >*, std::vector, std::allocator > >, std::allocator, std::allocator > > > > >; ID = vec_adj_list_vertex_id_map >, long unsigned int>; typename std::iterator_traits< >::value_type = std::vector, std::allocator > >; typename std::iterator_traits< >::reference = std::vector, std::allocator > >&]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/betweenness_centrality.hpp:469:43: required from ‘void boost::detail::graph::brandes_betweenness_centrality_dispatch2(const Graph&, CentralityMap, EdgeCentralityMap, WeightMap, VertexIndexMap) [with Graph = boost::adjacency_list >, boost::property > >; CentralityMap = boost::vec_adj_list_vertex_property_map >, boost::property > >, boost::adjacency_list >, boost::property > >*, double, double&, boost::vertex_centrality_t>; EdgeCentralityMap = boost::adj_list_edge_property_map >, boost::edge_centrality_t>; WeightMap = boost::adj_list_edge_property_map >, boost::edge_weight_t>; VertexIndexMap = boost::vec_adj_list_vertex_id_map >, long unsigned int>]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/betweenness_centrality.hpp:517:57: required from ‘static void boost::detail::graph::brandes_betweenness_centrality_dispatch1::run(const Graph&, CentralityMap, EdgeCentralityMap, VertexIndexMap, WeightMap) [with Graph = boost::adjacency_list >, boost::property > >; CentralityMap = boost::vec_adj_list_vertex_property_map >, boost::property > >, boost::adjacency_list >, boost::property > >*, double, double&, boost::vertex_centrality_t>; EdgeCentralityMap = boost::adj_list_edge_property_map >, boost::edge_centrality_t>; VertexIndexMap = boost::vec_adj_list_vertex_id_map >, long unsigned int>; WeightMap = boost::adj_list_edge_property_map >, boost::edge_weight_t>]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/betweenness_centrality.hpp:558:71: required from ‘void boost::brandes_betweenness_centrality(const Graph&, const bgl_named_params&, typename enable_if_c::traversal_category>::value, graph::detail::no_parameter>::type) [with Graph = adjacency_list >, property > >; Param = adj_list_edge_property_map >, edge_weight_t>; Tag = edge_weight_t; Rest = bgl_named_params >, edge_centrality_t>, edge_centrality_t, bgl_named_params >, property > >, adjacency_list >, property > >*, double, double&, vertex_centrality_t>, vertex_centrality_t, no_property> >; typename enable_if_c::traversal_category>::value, graph::detail::no_parameter>::type = graph::detail::no_parameter; typename graph_traits::traversal_category = undir_adj_list_traversal_tag]’ bbc.cpp:67:33: required from here /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:107:22: note: in a call to non-static member function ‘boost::SignedInteger::~SignedInteger()’ 107 | template <> struct SignedInteger {}; | ^~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements >]’: /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:208:5: required from ‘struct boost::Convertible’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::Convertible]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied >::value’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_)>’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:515:9: [ skipping 11 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_, std::allocator > >*, std::vector, std::allocator > >, std::allocator, std::allocator > > > > > >)>’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/property_map/property_map.hpp:354:5: required from ‘boost::iterator_property_map >::value_type, typename std::iterator_traits< >::reference> boost::make_iterator_property_map(RAIter, ID) [with RAIter = __gnu_cxx::__normal_iterator, std::allocator > >*, std::vector, std::allocator > >, std::allocator, std::allocator > > > > >; ID = vec_adj_list_vertex_id_map >, long unsigned int>; typename std::iterator_traits< >::value_type = std::vector, std::allocator > >; typename std::iterator_traits< >::reference = std::vector, std::allocator > >&]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/betweenness_centrality.hpp:469:43: required from ‘void boost::detail::graph::brandes_betweenness_centrality_dispatch2(const Graph&, CentralityMap, EdgeCentralityMap, WeightMap, VertexIndexMap) [with Graph = boost::adjacency_list >, boost::property > >; CentralityMap = boost::vec_adj_list_vertex_property_map >, boost::property > >, boost::adjacency_list >, boost::property > >*, double, double&, boost::vertex_centrality_t>; EdgeCentralityMap = boost::adj_list_edge_property_map >, boost::edge_centrality_t>; WeightMap = boost::adj_list_edge_property_map >, boost::edge_weight_t>; VertexIndexMap = boost::vec_adj_list_vertex_id_map >, long unsigned int>]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/betweenness_centrality.hpp:517:57: required from ‘static void boost::detail::graph::brandes_betweenness_centrality_dispatch1::run(const Graph&, CentralityMap, EdgeCentralityMap, VertexIndexMap, WeightMap) [with Graph = boost::adjacency_list >, boost::property > >; CentralityMap = boost::vec_adj_list_vertex_property_map >, boost::property > >, boost::adjacency_list >, boost::property > >*, double, double&, boost::vertex_centrality_t>; EdgeCentralityMap = boost::adj_list_edge_property_map >, boost::edge_centrality_t>; VertexIndexMap = boost::vec_adj_list_vertex_id_map >, long unsigned int>; WeightMap = boost::adj_list_edge_property_map >, boost::edge_weight_t>]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/betweenness_centrality.hpp:558:71: required from ‘void boost::brandes_betweenness_centrality(const Graph&, const bgl_named_params&, typename enable_if_c::traversal_category>::value, graph::detail::no_parameter>::type) [with Graph = adjacency_list >, property > >; Param = adj_list_edge_property_map >, edge_weight_t>; Tag = edge_weight_t; Rest = bgl_named_params >, edge_centrality_t>, edge_centrality_t, bgl_named_params >, property > >, adjacency_list >, property > >*, double, double&, vertex_centrality_t>, vertex_centrality_t, no_property> >; typename enable_if_c::traversal_category>::value, graph::detail::no_parameter>::type = graph::detail::no_parameter; typename graph_traits::traversal_category = undir_adj_list_traversal_tag]’ bbc.cpp:67:33: required from here /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::Convertible]’ 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ^ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::Convertible]’: /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:515:9: required from ‘boost::InputIterator::~InputIterator() [with TT = __gnu_cxx::__normal_iterator, std::allocator > >*, std::vector, std::allocator > >, std::allocator, std::allocator > > > > >]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/usage.hpp:20:48: required from ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::InputIterator<__gnu_cxx::__normal_iterator, std::allocator > >*, std::vector, std::allocator > >, std::allocator, std::allocator > > > > > >]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements, std::allocator > >*, std::vector, std::allocator > >, std::allocator, std::allocator > > > > > > >]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:512:7: required from ‘struct boost::InputIterator<__gnu_cxx::__normal_iterator, std::allocator > >*, std::vector, std::allocator > >, std::allocator, std::allocator > > > > > >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:540:3: required from ‘struct boost::ForwardIterator<__gnu_cxx::__normal_iterator, std::allocator > >*, std::vector, std::allocator > >, std::allocator, std::allocator > > > > > >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:568:3: [ skipping 6 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_, std::allocator > >*, std::vector, std::allocator > >, std::allocator, std::allocator > > > > > >)>’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/property_map/property_map.hpp:354:5: required from ‘boost::iterator_property_map >::value_type, typename std::iterator_traits< >::reference> boost::make_iterator_property_map(RAIter, ID) [with RAIter = __gnu_cxx::__normal_iterator, std::allocator > >*, std::vector, std::allocator > >, std::allocator, std::allocator > > > > >; ID = vec_adj_list_vertex_id_map >, long unsigned int>; typename std::iterator_traits< >::value_type = std::vector, std::allocator > >; typename std::iterator_traits< >::reference = std::vector, std::allocator > >&]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/betweenness_centrality.hpp:469:43: required from ‘void boost::detail::graph::brandes_betweenness_centrality_dispatch2(const Graph&, CentralityMap, EdgeCentralityMap, WeightMap, VertexIndexMap) [with Graph = boost::adjacency_list >, boost::property > >; CentralityMap = boost::vec_adj_list_vertex_property_map >, boost::property > >, boost::adjacency_list >, boost::property > >*, double, double&, boost::vertex_centrality_t>; EdgeCentralityMap = boost::adj_list_edge_property_map >, boost::edge_centrality_t>; WeightMap = boost::adj_list_edge_property_map >, boost::edge_weight_t>; VertexIndexMap = boost::vec_adj_list_vertex_id_map >, long unsigned int>]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/betweenness_centrality.hpp:517:57: required from ‘static void boost::detail::graph::brandes_betweenness_centrality_dispatch1::run(const Graph&, CentralityMap, EdgeCentralityMap, VertexIndexMap, WeightMap) [with Graph = boost::adjacency_list >, boost::property > >; CentralityMap = boost::vec_adj_list_vertex_property_map >, boost::property > >, boost::adjacency_list >, boost::property > >*, double, double&, boost::vertex_centrality_t>; EdgeCentralityMap = boost::adj_list_edge_property_map >, boost::edge_centrality_t>; VertexIndexMap = boost::vec_adj_list_vertex_id_map >, long unsigned int>; WeightMap = boost::adj_list_edge_property_map >, boost::edge_weight_t>]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/betweenness_centrality.hpp:558:71: required from ‘void boost::brandes_betweenness_centrality(const Graph&, const bgl_named_params&, typename enable_if_c::traversal_category>::value, graph::detail::no_parameter>::type) [with Graph = adjacency_list >, property > >; Param = adj_list_edge_property_map >, edge_weight_t>; Tag = edge_weight_t; Rest = bgl_named_params >, edge_centrality_t>, edge_centrality_t, bgl_named_params >, property > >, adjacency_list >, property > >*, double, double&, vertex_centrality_t>, vertex_centrality_t, no_property> >; typename enable_if_c::traversal_category>::value, graph::detail::no_parameter>::type = graph::detail::no_parameter; typename graph_traits::traversal_category = undir_adj_list_traversal_tag]’ bbc.cpp:67:33: required from here /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::Convertible::~Convertible() [with X = std::random_access_iterator_tag; Y = std::input_iterator_tag]’ 37 | ~model() | ^ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:208:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 208 | BOOST_CONCEPT_USAGE(Convertible) { | ^~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements >]’: /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:208:5: required from ‘struct boost::Convertible’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::Convertible]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied >::value’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_)>’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:545:11: [ skipping 10 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_, std::allocator > >*, std::vector, std::allocator > >, std::allocator, std::allocator > > > > > >)>’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/property_map/property_map.hpp:354:5: required from ‘boost::iterator_property_map >::value_type, typename std::iterator_traits< >::reference> boost::make_iterator_property_map(RAIter, ID) [with RAIter = __gnu_cxx::__normal_iterator, std::allocator > >*, std::vector, std::allocator > >, std::allocator, std::allocator > > > > >; ID = vec_adj_list_vertex_id_map >, long unsigned int>; typename std::iterator_traits< >::value_type = std::vector, std::allocator > >; typename std::iterator_traits< >::reference = std::vector, std::allocator > >&]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/betweenness_centrality.hpp:469:43: required from ‘void boost::detail::graph::brandes_betweenness_centrality_dispatch2(const Graph&, CentralityMap, EdgeCentralityMap, WeightMap, VertexIndexMap) [with Graph = boost::adjacency_list >, boost::property > >; CentralityMap = boost::vec_adj_list_vertex_property_map >, boost::property > >, boost::adjacency_list >, boost::property > >*, double, double&, boost::vertex_centrality_t>; EdgeCentralityMap = boost::adj_list_edge_property_map >, boost::edge_centrality_t>; WeightMap = boost::adj_list_edge_property_map >, boost::edge_weight_t>; VertexIndexMap = boost::vec_adj_list_vertex_id_map >, long unsigned int>]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/betweenness_centrality.hpp:517:57: required from ‘static void boost::detail::graph::brandes_betweenness_centrality_dispatch1::run(const Graph&, CentralityMap, EdgeCentralityMap, VertexIndexMap, WeightMap) [with Graph = boost::adjacency_list >, boost::property > >; CentralityMap = boost::vec_adj_list_vertex_property_map >, boost::property > >, boost::adjacency_list >, boost::property > >*, double, double&, boost::vertex_centrality_t>; EdgeCentralityMap = boost::adj_list_edge_property_map >, boost::edge_centrality_t>; VertexIndexMap = boost::vec_adj_list_vertex_id_map >, long unsigned int>; WeightMap = boost::adj_list_edge_property_map >, boost::edge_weight_t>]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/betweenness_centrality.hpp:558:71: required from ‘void boost::brandes_betweenness_centrality(const Graph&, const bgl_named_params&, typename enable_if_c::traversal_category>::value, graph::detail::no_parameter>::type) [with Graph = adjacency_list >, property > >; Param = adj_list_edge_property_map >, edge_weight_t>; Tag = edge_weight_t; Rest = bgl_named_params >, edge_centrality_t>, edge_centrality_t, bgl_named_params >, property > >, adjacency_list >, property > >*, double, double&, vertex_centrality_t>, vertex_centrality_t, no_property> >; typename enable_if_c::traversal_category>::value, graph::detail::no_parameter>::type = graph::detail::no_parameter; typename graph_traits::traversal_category = undir_adj_list_traversal_tag]’ bbc.cpp:67:33: required from here /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::Convertible]’ 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ^ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::Convertible]’: /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:545:11: required from ‘boost::ForwardIterator::~ForwardIterator() [with TT = __gnu_cxx::__normal_iterator, std::allocator > >*, std::vector, std::allocator > >, std::allocator, std::allocator > > > > >]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/usage.hpp:20:48: required from ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::ForwardIterator<__gnu_cxx::__normal_iterator, std::allocator > >*, std::vector, std::allocator > >, std::allocator, std::allocator > > > > > >]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements, std::allocator > >*, std::vector, std::allocator > >, std::allocator, std::allocator > > > > > > >]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:543:7: required from ‘struct boost::ForwardIterator<__gnu_cxx::__normal_iterator, std::allocator > >*, std::vector, std::allocator > >, std::allocator, std::allocator > > > > > >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:568:3: required from ‘struct boost::BidirectionalIterator<__gnu_cxx::__normal_iterator, std::allocator > >*, std::vector, std::allocator > >, std::allocator, std::allocator > > > > > >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:597:3: [ skipping 5 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_, std::allocator > >*, std::vector, std::allocator > >, std::allocator, std::allocator > > > > > >)>’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/property_map/property_map.hpp:354:5: required from ‘boost::iterator_property_map >::value_type, typename std::iterator_traits< >::reference> boost::make_iterator_property_map(RAIter, ID) [with RAIter = __gnu_cxx::__normal_iterator, std::allocator > >*, std::vector, std::allocator > >, std::allocator, std::allocator > > > > >; ID = vec_adj_list_vertex_id_map >, long unsigned int>; typename std::iterator_traits< >::value_type = std::vector, std::allocator > >; typename std::iterator_traits< >::reference = std::vector, std::allocator > >&]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/betweenness_centrality.hpp:469:43: required from ‘void boost::detail::graph::brandes_betweenness_centrality_dispatch2(const Graph&, CentralityMap, EdgeCentralityMap, WeightMap, VertexIndexMap) [with Graph = boost::adjacency_list >, boost::property > >; CentralityMap = boost::vec_adj_list_vertex_property_map >, boost::property > >, boost::adjacency_list >, boost::property > >*, double, double&, boost::vertex_centrality_t>; EdgeCentralityMap = boost::adj_list_edge_property_map >, boost::edge_centrality_t>; WeightMap = boost::adj_list_edge_property_map >, boost::edge_weight_t>; VertexIndexMap = boost::vec_adj_list_vertex_id_map >, long unsigned int>]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/betweenness_centrality.hpp:517:57: required from ‘static void boost::detail::graph::brandes_betweenness_centrality_dispatch1::run(const Graph&, CentralityMap, EdgeCentralityMap, VertexIndexMap, WeightMap) [with Graph = boost::adjacency_list >, boost::property > >; CentralityMap = boost::vec_adj_list_vertex_property_map >, boost::property > >, boost::adjacency_list >, boost::property > >*, double, double&, boost::vertex_centrality_t>; EdgeCentralityMap = boost::adj_list_edge_property_map >, boost::edge_centrality_t>; VertexIndexMap = boost::vec_adj_list_vertex_id_map >, long unsigned int>; WeightMap = boost::adj_list_edge_property_map >, boost::edge_weight_t>]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/betweenness_centrality.hpp:558:71: required from ‘void boost::brandes_betweenness_centrality(const Graph&, const bgl_named_params&, typename enable_if_c::traversal_category>::value, graph::detail::no_parameter>::type) [with Graph = adjacency_list >, property > >; Param = adj_list_edge_property_map >, edge_weight_t>; Tag = edge_weight_t; Rest = bgl_named_params >, edge_centrality_t>, edge_centrality_t, bgl_named_params >, property > >, adjacency_list >, property > >*, double, double&, vertex_centrality_t>, vertex_centrality_t, no_property> >; typename enable_if_c::traversal_category>::value, graph::detail::no_parameter>::type = graph::detail::no_parameter; typename graph_traits::traversal_category = undir_adj_list_traversal_tag]’ bbc.cpp:67:33: required from here /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::Convertible::~Convertible() [with X = std::random_access_iterator_tag; Y = std::forward_iterator_tag]’ 37 | ~model() | ^ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:208:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 208 | BOOST_CONCEPT_USAGE(Convertible) { | ^~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements >]’: /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:208:5: required from ‘struct boost::Convertible’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::Convertible]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied >::value’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_)>’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:573:11: [ skipping 9 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_, std::allocator > >*, std::vector, std::allocator > >, std::allocator, std::allocator > > > > > >)>’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/property_map/property_map.hpp:354:5: required from ‘boost::iterator_property_map >::value_type, typename std::iterator_traits< >::reference> boost::make_iterator_property_map(RAIter, ID) [with RAIter = __gnu_cxx::__normal_iterator, std::allocator > >*, std::vector, std::allocator > >, std::allocator, std::allocator > > > > >; ID = vec_adj_list_vertex_id_map >, long unsigned int>; typename std::iterator_traits< >::value_type = std::vector, std::allocator > >; typename std::iterator_traits< >::reference = std::vector, std::allocator > >&]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/betweenness_centrality.hpp:469:43: required from ‘void boost::detail::graph::brandes_betweenness_centrality_dispatch2(const Graph&, CentralityMap, EdgeCentralityMap, WeightMap, VertexIndexMap) [with Graph = boost::adjacency_list >, boost::property > >; CentralityMap = boost::vec_adj_list_vertex_property_map >, boost::property > >, boost::adjacency_list >, boost::property > >*, double, double&, boost::vertex_centrality_t>; EdgeCentralityMap = boost::adj_list_edge_property_map >, boost::edge_centrality_t>; WeightMap = boost::adj_list_edge_property_map >, boost::edge_weight_t>; VertexIndexMap = boost::vec_adj_list_vertex_id_map >, long unsigned int>]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/betweenness_centrality.hpp:517:57: required from ‘static void boost::detail::graph::brandes_betweenness_centrality_dispatch1::run(const Graph&, CentralityMap, EdgeCentralityMap, VertexIndexMap, WeightMap) [with Graph = boost::adjacency_list >, boost::property > >; CentralityMap = boost::vec_adj_list_vertex_property_map >, boost::property > >, boost::adjacency_list >, boost::property > >*, double, double&, boost::vertex_centrality_t>; EdgeCentralityMap = boost::adj_list_edge_property_map >, boost::edge_centrality_t>; VertexIndexMap = boost::vec_adj_list_vertex_id_map >, long unsigned int>; WeightMap = boost::adj_list_edge_property_map >, boost::edge_weight_t>]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/betweenness_centrality.hpp:558:71: required from ‘void boost::brandes_betweenness_centrality(const Graph&, const bgl_named_params&, typename enable_if_c::traversal_category>::value, graph::detail::no_parameter>::type) [with Graph = adjacency_list >, property > >; Param = adj_list_edge_property_map >, edge_weight_t>; Tag = edge_weight_t; Rest = bgl_named_params >, edge_centrality_t>, edge_centrality_t, bgl_named_params >, property > >, adjacency_list >, property > >*, double, double&, vertex_centrality_t>, vertex_centrality_t, no_property> >; typename enable_if_c::traversal_category>::value, graph::detail::no_parameter>::type = graph::detail::no_parameter; typename graph_traits::traversal_category = undir_adj_list_traversal_tag]’ bbc.cpp:67:33: required from here /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::Convertible]’ 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ^ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::Convertible]’: /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:573:11: required from ‘boost::BidirectionalIterator::~BidirectionalIterator() [with TT = __gnu_cxx::__normal_iterator, std::allocator > >*, std::vector, std::allocator > >, std::allocator, std::allocator > > > > >]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/usage.hpp:20:48: required from ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::BidirectionalIterator<__gnu_cxx::__normal_iterator, std::allocator > >*, std::vector, std::allocator > >, std::allocator, std::allocator > > > > > >]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements, std::allocator > >*, std::vector, std::allocator > >, std::allocator, std::allocator > > > > > > >]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:571:7: required from ‘struct boost::BidirectionalIterator<__gnu_cxx::__normal_iterator, std::allocator > >*, std::vector, std::allocator > >, std::allocator, std::allocator > > > > > >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:597:3: required from ‘struct boost::RandomAccessIterator<__gnu_cxx::__normal_iterator, std::allocator > >*, std::vector, std::allocator > >, std::allocator, std::allocator > > > > > >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:597:3: [ skipping 4 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_, std::allocator > >*, std::vector, std::allocator > >, std::allocator, std::allocator > > > > > >)>’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/property_map/property_map.hpp:354:5: required from ‘boost::iterator_property_map >::value_type, typename std::iterator_traits< >::reference> boost::make_iterator_property_map(RAIter, ID) [with RAIter = __gnu_cxx::__normal_iterator, std::allocator > >*, std::vector, std::allocator > >, std::allocator, std::allocator > > > > >; ID = vec_adj_list_vertex_id_map >, long unsigned int>; typename std::iterator_traits< >::value_type = std::vector, std::allocator > >; typename std::iterator_traits< >::reference = std::vector, std::allocator > >&]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/betweenness_centrality.hpp:469:43: required from ‘void boost::detail::graph::brandes_betweenness_centrality_dispatch2(const Graph&, CentralityMap, EdgeCentralityMap, WeightMap, VertexIndexMap) [with Graph = boost::adjacency_list >, boost::property > >; CentralityMap = boost::vec_adj_list_vertex_property_map >, boost::property > >, boost::adjacency_list >, boost::property > >*, double, double&, boost::vertex_centrality_t>; EdgeCentralityMap = boost::adj_list_edge_property_map >, boost::edge_centrality_t>; WeightMap = boost::adj_list_edge_property_map >, boost::edge_weight_t>; VertexIndexMap = boost::vec_adj_list_vertex_id_map >, long unsigned int>]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/betweenness_centrality.hpp:517:57: required from ‘static void boost::detail::graph::brandes_betweenness_centrality_dispatch1::run(const Graph&, CentralityMap, EdgeCentralityMap, VertexIndexMap, WeightMap) [with Graph = boost::adjacency_list >, boost::property > >; CentralityMap = boost::vec_adj_list_vertex_property_map >, boost::property > >, boost::adjacency_list >, boost::property > >*, double, double&, boost::vertex_centrality_t>; EdgeCentralityMap = boost::adj_list_edge_property_map >, boost::edge_centrality_t>; VertexIndexMap = boost::vec_adj_list_vertex_id_map >, long unsigned int>; WeightMap = boost::adj_list_edge_property_map >, boost::edge_weight_t>]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/betweenness_centrality.hpp:558:71: required from ‘void boost::brandes_betweenness_centrality(const Graph&, const bgl_named_params&, typename enable_if_c::traversal_category>::value, graph::detail::no_parameter>::type) [with Graph = adjacency_list >, property > >; Param = adj_list_edge_property_map >, edge_weight_t>; Tag = edge_weight_t; Rest = bgl_named_params >, edge_centrality_t>, edge_centrality_t, bgl_named_params >, property > >, adjacency_list >, property > >*, double, double&, vertex_centrality_t>, vertex_centrality_t, no_property> >; typename enable_if_c::traversal_category>::value, graph::detail::no_parameter>::type = graph::detail::no_parameter; typename graph_traits::traversal_category = undir_adj_list_traversal_tag]’ bbc.cpp:67:33: required from here /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::Convertible::~Convertible() [with X = std::random_access_iterator_tag; Y = std::bidirectional_iterator_tag]’ 37 | ~model() | ^ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:208:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 208 | BOOST_CONCEPT_USAGE(Convertible) { | ^~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::Convertible]’: /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements >]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:208:5: required from ‘struct boost::Convertible’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::Convertible]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied >::value’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:72:8: [ skipping 2 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:597:3: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator, std::allocator > >*, std::vector, std::allocator > >, std::allocator, std::allocator > > > > > >]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/property_map/property_map.hpp:354:5: required from ‘boost::iterator_property_map >::value_type, typename std::iterator_traits< >::reference> boost::make_iterator_property_map(RAIter, ID) [with RAIter = __gnu_cxx::__normal_iterator, std::allocator > >*, std::vector, std::allocator > >, std::allocator, std::allocator > > > > >; ID = vec_adj_list_vertex_id_map >, long unsigned int>; typename std::iterator_traits< >::value_type = std::vector, std::allocator > >; typename std::iterator_traits< >::reference = std::vector, std::allocator > >&]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/betweenness_centrality.hpp:469:43: required from ‘void boost::detail::graph::brandes_betweenness_centrality_dispatch2(const Graph&, CentralityMap, EdgeCentralityMap, WeightMap, VertexIndexMap) [with Graph = boost::adjacency_list >, boost::property > >; CentralityMap = boost::vec_adj_list_vertex_property_map >, boost::property > >, boost::adjacency_list >, boost::property > >*, double, double&, boost::vertex_centrality_t>; EdgeCentralityMap = boost::adj_list_edge_property_map >, boost::edge_centrality_t>; WeightMap = boost::adj_list_edge_property_map >, boost::edge_weight_t>; VertexIndexMap = boost::vec_adj_list_vertex_id_map >, long unsigned int>]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/betweenness_centrality.hpp:517:57: required from ‘static void boost::detail::graph::brandes_betweenness_centrality_dispatch1::run(const Graph&, CentralityMap, EdgeCentralityMap, VertexIndexMap, WeightMap) [with Graph = boost::adjacency_list >, boost::property > >; CentralityMap = boost::vec_adj_list_vertex_property_map >, boost::property > >, boost::adjacency_list >, boost::property > >*, double, double&, boost::vertex_centrality_t>; EdgeCentralityMap = boost::adj_list_edge_property_map >, boost::edge_centrality_t>; VertexIndexMap = boost::vec_adj_list_vertex_id_map >, long unsigned int>; WeightMap = boost::adj_list_edge_property_map >, boost::edge_weight_t>]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/betweenness_centrality.hpp:558:71: required from ‘void boost::brandes_betweenness_centrality(const Graph&, const bgl_named_params&, typename enable_if_c::traversal_category>::value, graph::detail::no_parameter>::type) [with Graph = adjacency_list >, property > >; Param = adj_list_edge_property_map >, edge_weight_t>; Tag = edge_weight_t; Rest = bgl_named_params >, edge_centrality_t>, edge_centrality_t, bgl_named_params >, property > >, adjacency_list >, property > >*, double, double&, vertex_centrality_t>, vertex_centrality_t, no_property> >; typename enable_if_c::traversal_category>::value, graph::detail::no_parameter>::type = graph::detail::no_parameter; typename graph_traits::traversal_category = undir_adj_list_traversal_tag]’ bbc.cpp:67:33: required from here /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::Convertible::~Convertible() [with X = std::random_access_iterator_tag; Y = std::random_access_iterator_tag]’ 37 | ~model() | ^ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:208:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 208 | BOOST_CONCEPT_USAGE(Convertible) { | ^~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::Convertible]’: /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements >]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:208:5: required from ‘struct boost::Convertible’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::Convertible]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied >::value’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:72:8: [ skipping 12 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_, std::allocator > >*, std::vector, std::allocator > >, std::allocator, std::allocator > > > > > >)>’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/property_map/property_map.hpp:354:5: required from ‘boost::iterator_property_map >::value_type, typename std::iterator_traits< >::reference> boost::make_iterator_property_map(RAIter, ID) [with RAIter = __gnu_cxx::__normal_iterator, std::allocator > >*, std::vector, std::allocator > >, std::allocator, std::allocator > > > > >; ID = vec_adj_list_vertex_id_map >, long unsigned int>; typename std::iterator_traits< >::value_type = std::vector, std::allocator > >; typename std::iterator_traits< >::reference = std::vector, std::allocator > >&]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/betweenness_centrality.hpp:469:43: required from ‘void boost::detail::graph::brandes_betweenness_centrality_dispatch2(const Graph&, CentralityMap, EdgeCentralityMap, WeightMap, VertexIndexMap) [with Graph = boost::adjacency_list >, boost::property > >; CentralityMap = boost::vec_adj_list_vertex_property_map >, boost::property > >, boost::adjacency_list >, boost::property > >*, double, double&, boost::vertex_centrality_t>; EdgeCentralityMap = boost::adj_list_edge_property_map >, boost::edge_centrality_t>; WeightMap = boost::adj_list_edge_property_map >, boost::edge_weight_t>; VertexIndexMap = boost::vec_adj_list_vertex_id_map >, long unsigned int>]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/betweenness_centrality.hpp:517:57: required from ‘static void boost::detail::graph::brandes_betweenness_centrality_dispatch1::run(const Graph&, CentralityMap, EdgeCentralityMap, VertexIndexMap, WeightMap) [with Graph = boost::adjacency_list >, boost::property > >; CentralityMap = boost::vec_adj_list_vertex_property_map >, boost::property > >, boost::adjacency_list >, boost::property > >*, double, double&, boost::vertex_centrality_t>; EdgeCentralityMap = boost::adj_list_edge_property_map >, boost::edge_centrality_t>; VertexIndexMap = boost::vec_adj_list_vertex_id_map >, long unsigned int>; WeightMap = boost::adj_list_edge_property_map >, boost::edge_weight_t>]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/betweenness_centrality.hpp:558:71: required from ‘void boost::brandes_betweenness_centrality(const Graph&, const bgl_named_params&, typename enable_if_c::traversal_category>::value, graph::detail::no_parameter>::type) [with Graph = adjacency_list >, property > >; Param = adj_list_edge_property_map >, edge_weight_t>; Tag = edge_weight_t; Rest = bgl_named_params >, edge_centrality_t>, edge_centrality_t, bgl_named_params >, property > >, adjacency_list >, property > >*, double, double&, vertex_centrality_t>, vertex_centrality_t, no_property> >; typename enable_if_c::traversal_category>::value, graph::detail::no_parameter>::type = graph::detail::no_parameter; typename graph_traits::traversal_category = undir_adj_list_traversal_tag]’ bbc.cpp:67:33: required from here /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::Convertible::~Convertible() [with X = std::random_access_iterator_tag; Y = std::input_iterator_tag]’ 37 | ~model() | ^ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:208:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 208 | BOOST_CONCEPT_USAGE(Convertible) { | ^~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::Convertible]’: /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements >]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:208:5: required from ‘struct boost::Convertible’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::Convertible]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied >::value’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:72:8: [ skipping 11 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_, std::allocator > >*, std::vector, std::allocator > >, std::allocator, std::allocator > > > > > >)>’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/property_map/property_map.hpp:354:5: required from ‘boost::iterator_property_map >::value_type, typename std::iterator_traits< >::reference> boost::make_iterator_property_map(RAIter, ID) [with RAIter = __gnu_cxx::__normal_iterator, std::allocator > >*, std::vector, std::allocator > >, std::allocator, std::allocator > > > > >; ID = vec_adj_list_vertex_id_map >, long unsigned int>; typename std::iterator_traits< >::value_type = std::vector, std::allocator > >; typename std::iterator_traits< >::reference = std::vector, std::allocator > >&]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/betweenness_centrality.hpp:469:43: required from ‘void boost::detail::graph::brandes_betweenness_centrality_dispatch2(const Graph&, CentralityMap, EdgeCentralityMap, WeightMap, VertexIndexMap) [with Graph = boost::adjacency_list >, boost::property > >; CentralityMap = boost::vec_adj_list_vertex_property_map >, boost::property > >, boost::adjacency_list >, boost::property > >*, double, double&, boost::vertex_centrality_t>; EdgeCentralityMap = boost::adj_list_edge_property_map >, boost::edge_centrality_t>; WeightMap = boost::adj_list_edge_property_map >, boost::edge_weight_t>; VertexIndexMap = boost::vec_adj_list_vertex_id_map >, long unsigned int>]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/betweenness_centrality.hpp:517:57: required from ‘static void boost::detail::graph::brandes_betweenness_centrality_dispatch1::run(const Graph&, CentralityMap, EdgeCentralityMap, VertexIndexMap, WeightMap) [with Graph = boost::adjacency_list >, boost::property > >; CentralityMap = boost::vec_adj_list_vertex_property_map >, boost::property > >, boost::adjacency_list >, boost::property > >*, double, double&, boost::vertex_centrality_t>; EdgeCentralityMap = boost::adj_list_edge_property_map >, boost::edge_centrality_t>; VertexIndexMap = boost::vec_adj_list_vertex_id_map >, long unsigned int>; WeightMap = boost::adj_list_edge_property_map >, boost::edge_weight_t>]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/betweenness_centrality.hpp:558:71: required from ‘void boost::brandes_betweenness_centrality(const Graph&, const bgl_named_params&, typename enable_if_c::traversal_category>::value, graph::detail::no_parameter>::type) [with Graph = adjacency_list >, property > >; Param = adj_list_edge_property_map >, edge_weight_t>; Tag = edge_weight_t; Rest = bgl_named_params >, edge_centrality_t>, edge_centrality_t, bgl_named_params >, property > >, adjacency_list >, property > >*, double, double&, vertex_centrality_t>, vertex_centrality_t, no_property> >; typename enable_if_c::traversal_category>::value, graph::detail::no_parameter>::type = graph::detail::no_parameter; typename graph_traits::traversal_category = undir_adj_list_traversal_tag]’ bbc.cpp:67:33: required from here /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::Convertible::~Convertible() [with X = std::random_access_iterator_tag; Y = std::forward_iterator_tag]’ 37 | ~model() | ^ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:208:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 208 | BOOST_CONCEPT_USAGE(Convertible) { | ^~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::Convertible]’: /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements >]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:208:5: required from ‘struct boost::Convertible’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::Convertible]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied >::value’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:72:8: [ skipping 10 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_, std::allocator > >*, std::vector, std::allocator > >, std::allocator, std::allocator > > > > > >)>’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/property_map/property_map.hpp:354:5: required from ‘boost::iterator_property_map >::value_type, typename std::iterator_traits< >::reference> boost::make_iterator_property_map(RAIter, ID) [with RAIter = __gnu_cxx::__normal_iterator, std::allocator > >*, std::vector, std::allocator > >, std::allocator, std::allocator > > > > >; ID = vec_adj_list_vertex_id_map >, long unsigned int>; typename std::iterator_traits< >::value_type = std::vector, std::allocator > >; typename std::iterator_traits< >::reference = std::vector, std::allocator > >&]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/betweenness_centrality.hpp:469:43: required from ‘void boost::detail::graph::brandes_betweenness_centrality_dispatch2(const Graph&, CentralityMap, EdgeCentralityMap, WeightMap, VertexIndexMap) [with Graph = boost::adjacency_list >, boost::property > >; CentralityMap = boost::vec_adj_list_vertex_property_map >, boost::property > >, boost::adjacency_list >, boost::property > >*, double, double&, boost::vertex_centrality_t>; EdgeCentralityMap = boost::adj_list_edge_property_map >, boost::edge_centrality_t>; WeightMap = boost::adj_list_edge_property_map >, boost::edge_weight_t>; VertexIndexMap = boost::vec_adj_list_vertex_id_map >, long unsigned int>]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/betweenness_centrality.hpp:517:57: required from ‘static void boost::detail::graph::brandes_betweenness_centrality_dispatch1::run(const Graph&, CentralityMap, EdgeCentralityMap, VertexIndexMap, WeightMap) [with Graph = boost::adjacency_list >, boost::property > >; CentralityMap = boost::vec_adj_list_vertex_property_map >, boost::property > >, boost::adjacency_list >, boost::property > >*, double, double&, boost::vertex_centrality_t>; EdgeCentralityMap = boost::adj_list_edge_property_map >, boost::edge_centrality_t>; VertexIndexMap = boost::vec_adj_list_vertex_id_map >, long unsigned int>; WeightMap = boost::adj_list_edge_property_map >, boost::edge_weight_t>]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/betweenness_centrality.hpp:558:71: required from ‘void boost::brandes_betweenness_centrality(const Graph&, const bgl_named_params&, typename enable_if_c::traversal_category>::value, graph::detail::no_parameter>::type) [with Graph = adjacency_list >, property > >; Param = adj_list_edge_property_map >, edge_weight_t>; Tag = edge_weight_t; Rest = bgl_named_params >, edge_centrality_t>, edge_centrality_t, bgl_named_params >, property > >, adjacency_list >, property > >*, double, double&, vertex_centrality_t>, vertex_centrality_t, no_property> >; typename enable_if_c::traversal_category>::value, graph::detail::no_parameter>::type = graph::detail::no_parameter; typename graph_traits::traversal_category = undir_adj_list_traversal_tag]’ bbc.cpp:67:33: required from here /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::Convertible::~Convertible() [with X = std::random_access_iterator_tag; Y = std::bidirectional_iterator_tag]’ 37 | ~model() | ^ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:208:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 208 | BOOST_CONCEPT_USAGE(Convertible) { | ^~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements > > >]’: /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:145:5: required from ‘struct boost::Assignable<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:502:3: required from ‘struct boost::InputIterator<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:540:3: required from ‘struct boost::ForwardIterator<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:568:3: required from ‘struct boost::BidirectionalIterator<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:597:3: required from ‘struct boost::RandomAccessIterator<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:597:3: [ skipping 9 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/betweenness_centrality.hpp:500:43: required from ‘void boost::detail::graph::brandes_betweenness_centrality_dispatch2(const Graph&, CentralityMap, EdgeCentralityMap, VertexIndexMap) [with Graph = boost::adjacency_list >, boost::property > >; CentralityMap = boost::dummy_property_map; EdgeCentralityMap = boost::adj_list_edge_property_map >, boost::edge_centrality_t>; VertexIndexMap = boost::vec_adj_list_vertex_id_map >, long unsigned int>]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/betweenness_centrality.hpp:531:57: required from ‘static void boost::detail::graph::brandes_betweenness_centrality_dispatch1::run(const Graph&, CentralityMap, EdgeCentralityMap, VertexIndexMap, boost::param_not_found) [with Graph = boost::adjacency_list >, boost::property > >; CentralityMap = boost::dummy_property_map; EdgeCentralityMap = boost::adj_list_edge_property_map >, boost::edge_centrality_t>; VertexIndexMap = boost::vec_adj_list_vertex_id_map >, long unsigned int>]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/betweenness_centrality.hpp:558:71: required from ‘void boost::brandes_betweenness_centrality(const Graph&, const bgl_named_params&, typename enable_if_c::traversal_category>::value, graph::detail::no_parameter>::type) [with Graph = adjacency_list >, property > >; Param = vec_adj_list_vertex_id_map >, long unsigned int>; Tag = vertex_index_t; Rest = bgl_named_params >, edge_centrality_t>, edge_centrality_t, no_property>; typename enable_if_c::traversal_category>::value, graph::detail::no_parameter>::type = graph::detail::no_parameter; typename graph_traits::traversal_category = undir_adj_list_traversal_tag]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/bc_clustering.hpp:131:39: required from ‘void boost::betweenness_centrality_clustering(MutableGraph&, Done, EdgeCentralityMap, VertexIndexMap) [with MutableGraph = adjacency_list >, property > >; Done = clustering_threshold; EdgeCentralityMap = adj_list_edge_property_map >, edge_centrality_t>; VertexIndexMap = vec_adj_list_vertex_id_map >, long unsigned int>]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/bc_clustering.hpp:150:38: required from ‘void boost::betweenness_centrality_clustering(MutableGraph&, Done, EdgeCentralityMap) [with MutableGraph = adjacency_list >, property > >; Done = clustering_threshold; EdgeCentralityMap = adj_list_edge_property_map >, edge_centrality_t>]’ bbc.cpp:149:36: required from here /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::Assignable<__gnu_cxx::__normal_iterator > >]’ 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ^ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements > > >]’: /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:233:5: required from ‘struct boost::EqualityComparable<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:502:3: required from ‘struct boost::InputIterator<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:540:3: required from ‘struct boost::ForwardIterator<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:568:3: required from ‘struct boost::BidirectionalIterator<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:597:3: required from ‘struct boost::RandomAccessIterator<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:597:3: [ skipping 9 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/betweenness_centrality.hpp:500:43: required from ‘void boost::detail::graph::brandes_betweenness_centrality_dispatch2(const Graph&, CentralityMap, EdgeCentralityMap, VertexIndexMap) [with Graph = boost::adjacency_list >, boost::property > >; CentralityMap = boost::dummy_property_map; EdgeCentralityMap = boost::adj_list_edge_property_map >, boost::edge_centrality_t>; VertexIndexMap = boost::vec_adj_list_vertex_id_map >, long unsigned int>]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/betweenness_centrality.hpp:531:57: required from ‘static void boost::detail::graph::brandes_betweenness_centrality_dispatch1::run(const Graph&, CentralityMap, EdgeCentralityMap, VertexIndexMap, boost::param_not_found) [with Graph = boost::adjacency_list >, boost::property > >; CentralityMap = boost::dummy_property_map; EdgeCentralityMap = boost::adj_list_edge_property_map >, boost::edge_centrality_t>; VertexIndexMap = boost::vec_adj_list_vertex_id_map >, long unsigned int>]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/betweenness_centrality.hpp:558:71: required from ‘void boost::brandes_betweenness_centrality(const Graph&, const bgl_named_params&, typename enable_if_c::traversal_category>::value, graph::detail::no_parameter>::type) [with Graph = adjacency_list >, property > >; Param = vec_adj_list_vertex_id_map >, long unsigned int>; Tag = vertex_index_t; Rest = bgl_named_params >, edge_centrality_t>, edge_centrality_t, no_property>; typename enable_if_c::traversal_category>::value, graph::detail::no_parameter>::type = graph::detail::no_parameter; typename graph_traits::traversal_category = undir_adj_list_traversal_tag]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/bc_clustering.hpp:131:39: required from ‘void boost::betweenness_centrality_clustering(MutableGraph&, Done, EdgeCentralityMap, VertexIndexMap) [with MutableGraph = adjacency_list >, property > >; Done = clustering_threshold; EdgeCentralityMap = adj_list_edge_property_map >, edge_centrality_t>; VertexIndexMap = vec_adj_list_vertex_id_map >, long unsigned int>]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/bc_clustering.hpp:150:38: required from ‘void boost::betweenness_centrality_clustering(MutableGraph&, Done, EdgeCentralityMap) [with MutableGraph = adjacency_list >, property > >; Done = clustering_threshold; EdgeCentralityMap = adj_list_edge_property_map >, edge_centrality_t>]’ bbc.cpp:149:36: required from here /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::EqualityComparable<__gnu_cxx::__normal_iterator > >]’ 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ^ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements > > >]’: /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:512:7: required from ‘struct boost::InputIterator<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:540:3: required from ‘struct boost::ForwardIterator<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:568:3: required from ‘struct boost::BidirectionalIterator<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:597:3: required from ‘struct boost::RandomAccessIterator<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:597:3: required from ‘struct boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:32:62: [ skipping 8 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/betweenness_centrality.hpp:500:43: required from ‘void boost::detail::graph::brandes_betweenness_centrality_dispatch2(const Graph&, CentralityMap, EdgeCentralityMap, VertexIndexMap) [with Graph = boost::adjacency_list >, boost::property > >; CentralityMap = boost::dummy_property_map; EdgeCentralityMap = boost::adj_list_edge_property_map >, boost::edge_centrality_t>; VertexIndexMap = boost::vec_adj_list_vertex_id_map >, long unsigned int>]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/betweenness_centrality.hpp:531:57: required from ‘static void boost::detail::graph::brandes_betweenness_centrality_dispatch1::run(const Graph&, CentralityMap, EdgeCentralityMap, VertexIndexMap, boost::param_not_found) [with Graph = boost::adjacency_list >, boost::property > >; CentralityMap = boost::dummy_property_map; EdgeCentralityMap = boost::adj_list_edge_property_map >, boost::edge_centrality_t>; VertexIndexMap = boost::vec_adj_list_vertex_id_map >, long unsigned int>]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/betweenness_centrality.hpp:558:71: required from ‘void boost::brandes_betweenness_centrality(const Graph&, const bgl_named_params&, typename enable_if_c::traversal_category>::value, graph::detail::no_parameter>::type) [with Graph = adjacency_list >, property > >; Param = vec_adj_list_vertex_id_map >, long unsigned int>; Tag = vertex_index_t; Rest = bgl_named_params >, edge_centrality_t>, edge_centrality_t, no_property>; typename enable_if_c::traversal_category>::value, graph::detail::no_parameter>::type = graph::detail::no_parameter; typename graph_traits::traversal_category = undir_adj_list_traversal_tag]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/bc_clustering.hpp:131:39: required from ‘void boost::betweenness_centrality_clustering(MutableGraph&, Done, EdgeCentralityMap, VertexIndexMap) [with MutableGraph = adjacency_list >, property > >; Done = clustering_threshold; EdgeCentralityMap = adj_list_edge_property_map >, edge_centrality_t>; VertexIndexMap = vec_adj_list_vertex_id_map >, long unsigned int>]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/bc_clustering.hpp:150:38: required from ‘void boost::betweenness_centrality_clustering(MutableGraph&, Done, EdgeCentralityMap) [with MutableGraph = adjacency_list >, property > >; Done = clustering_threshold; EdgeCentralityMap = adj_list_edge_property_map >, edge_centrality_t>]’ bbc.cpp:149:36: required from here /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::InputIterator<__gnu_cxx::__normal_iterator > >]’ 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ^ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements > > >]’: /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:543:7: required from ‘struct boost::ForwardIterator<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:568:3: required from ‘struct boost::BidirectionalIterator<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:597:3: required from ‘struct boost::RandomAccessIterator<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:597:3: required from ‘struct boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator > >]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:42:5: [ skipping 7 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/betweenness_centrality.hpp:500:43: required from ‘void boost::detail::graph::brandes_betweenness_centrality_dispatch2(const Graph&, CentralityMap, EdgeCentralityMap, VertexIndexMap) [with Graph = boost::adjacency_list >, boost::property > >; CentralityMap = boost::dummy_property_map; EdgeCentralityMap = boost::adj_list_edge_property_map >, boost::edge_centrality_t>; VertexIndexMap = boost::vec_adj_list_vertex_id_map >, long unsigned int>]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/betweenness_centrality.hpp:531:57: required from ‘static void boost::detail::graph::brandes_betweenness_centrality_dispatch1::run(const Graph&, CentralityMap, EdgeCentralityMap, VertexIndexMap, boost::param_not_found) [with Graph = boost::adjacency_list >, boost::property > >; CentralityMap = boost::dummy_property_map; EdgeCentralityMap = boost::adj_list_edge_property_map >, boost::edge_centrality_t>; VertexIndexMap = boost::vec_adj_list_vertex_id_map >, long unsigned int>]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/betweenness_centrality.hpp:558:71: required from ‘void boost::brandes_betweenness_centrality(const Graph&, const bgl_named_params&, typename enable_if_c::traversal_category>::value, graph::detail::no_parameter>::type) [with Graph = adjacency_list >, property > >; Param = vec_adj_list_vertex_id_map >, long unsigned int>; Tag = vertex_index_t; Rest = bgl_named_params >, edge_centrality_t>, edge_centrality_t, no_property>; typename enable_if_c::traversal_category>::value, graph::detail::no_parameter>::type = graph::detail::no_parameter; typename graph_traits::traversal_category = undir_adj_list_traversal_tag]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/bc_clustering.hpp:131:39: required from ‘void boost::betweenness_centrality_clustering(MutableGraph&, Done, EdgeCentralityMap, VertexIndexMap) [with MutableGraph = adjacency_list >, property > >; Done = clustering_threshold; EdgeCentralityMap = adj_list_edge_property_map >, edge_centrality_t>; VertexIndexMap = vec_adj_list_vertex_id_map >, long unsigned int>]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/bc_clustering.hpp:150:38: required from ‘void boost::betweenness_centrality_clustering(MutableGraph&, Done, EdgeCentralityMap) [with MutableGraph = adjacency_list >, property > >; Done = clustering_threshold; EdgeCentralityMap = adj_list_edge_property_map >, edge_centrality_t>]’ bbc.cpp:149:36: required from here /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::ForwardIterator<__gnu_cxx::__normal_iterator > >]’ 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ^ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements > > >]’: /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:571:7: required from ‘struct boost::BidirectionalIterator<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:597:3: required from ‘struct boost::RandomAccessIterator<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:597:3: required from ‘struct boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator > >]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied > > >::value’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:45:51: [ skipping 6 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/betweenness_centrality.hpp:500:43: required from ‘void boost::detail::graph::brandes_betweenness_centrality_dispatch2(const Graph&, CentralityMap, EdgeCentralityMap, VertexIndexMap) [with Graph = boost::adjacency_list >, boost::property > >; CentralityMap = boost::dummy_property_map; EdgeCentralityMap = boost::adj_list_edge_property_map >, boost::edge_centrality_t>; VertexIndexMap = boost::vec_adj_list_vertex_id_map >, long unsigned int>]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/betweenness_centrality.hpp:531:57: required from ‘static void boost::detail::graph::brandes_betweenness_centrality_dispatch1::run(const Graph&, CentralityMap, EdgeCentralityMap, VertexIndexMap, boost::param_not_found) [with Graph = boost::adjacency_list >, boost::property > >; CentralityMap = boost::dummy_property_map; EdgeCentralityMap = boost::adj_list_edge_property_map >, boost::edge_centrality_t>; VertexIndexMap = boost::vec_adj_list_vertex_id_map >, long unsigned int>]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/betweenness_centrality.hpp:558:71: required from ‘void boost::brandes_betweenness_centrality(const Graph&, const bgl_named_params&, typename enable_if_c::traversal_category>::value, graph::detail::no_parameter>::type) [with Graph = adjacency_list >, property > >; Param = vec_adj_list_vertex_id_map >, long unsigned int>; Tag = vertex_index_t; Rest = bgl_named_params >, edge_centrality_t>, edge_centrality_t, no_property>; typename enable_if_c::traversal_category>::value, graph::detail::no_parameter>::type = graph::detail::no_parameter; typename graph_traits::traversal_category = undir_adj_list_traversal_tag]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/bc_clustering.hpp:131:39: required from ‘void boost::betweenness_centrality_clustering(MutableGraph&, Done, EdgeCentralityMap, VertexIndexMap) [with MutableGraph = adjacency_list >, property > >; Done = clustering_threshold; EdgeCentralityMap = adj_list_edge_property_map >, edge_centrality_t>; VertexIndexMap = vec_adj_list_vertex_id_map >, long unsigned int>]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/bc_clustering.hpp:150:38: required from ‘void boost::betweenness_centrality_clustering(MutableGraph&, Done, EdgeCentralityMap) [with MutableGraph = adjacency_list >, property > >; Done = clustering_threshold; EdgeCentralityMap = adj_list_edge_property_map >, edge_centrality_t>]’ bbc.cpp:149:36: required from here /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::BidirectionalIterator<__gnu_cxx::__normal_iterator > >]’ 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ^ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements > > >]’: /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:253:5: required from ‘struct boost::Comparable<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:597:3: required from ‘struct boost::RandomAccessIterator<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:597:3: required from ‘struct boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator > >]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied > > >::value’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:45:51: [ skipping 6 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/betweenness_centrality.hpp:500:43: required from ‘void boost::detail::graph::brandes_betweenness_centrality_dispatch2(const Graph&, CentralityMap, EdgeCentralityMap, VertexIndexMap) [with Graph = boost::adjacency_list >, boost::property > >; CentralityMap = boost::dummy_property_map; EdgeCentralityMap = boost::adj_list_edge_property_map >, boost::edge_centrality_t>; VertexIndexMap = boost::vec_adj_list_vertex_id_map >, long unsigned int>]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/betweenness_centrality.hpp:531:57: required from ‘static void boost::detail::graph::brandes_betweenness_centrality_dispatch1::run(const Graph&, CentralityMap, EdgeCentralityMap, VertexIndexMap, boost::param_not_found) [with Graph = boost::adjacency_list >, boost::property > >; CentralityMap = boost::dummy_property_map; EdgeCentralityMap = boost::adj_list_edge_property_map >, boost::edge_centrality_t>; VertexIndexMap = boost::vec_adj_list_vertex_id_map >, long unsigned int>]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/betweenness_centrality.hpp:558:71: required from ‘void boost::brandes_betweenness_centrality(const Graph&, const bgl_named_params&, typename enable_if_c::traversal_category>::value, graph::detail::no_parameter>::type) [with Graph = adjacency_list >, property > >; Param = vec_adj_list_vertex_id_map >, long unsigned int>; Tag = vertex_index_t; Rest = bgl_named_params >, edge_centrality_t>, edge_centrality_t, no_property>; typename enable_if_c::traversal_category>::value, graph::detail::no_parameter>::type = graph::detail::no_parameter; typename graph_traits::traversal_category = undir_adj_list_traversal_tag]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/bc_clustering.hpp:131:39: required from ‘void boost::betweenness_centrality_clustering(MutableGraph&, Done, EdgeCentralityMap, VertexIndexMap) [with MutableGraph = adjacency_list >, property > >; Done = clustering_threshold; EdgeCentralityMap = adj_list_edge_property_map >, edge_centrality_t>; VertexIndexMap = vec_adj_list_vertex_id_map >, long unsigned int>]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/bc_clustering.hpp:150:38: required from ‘void boost::betweenness_centrality_clustering(MutableGraph&, Done, EdgeCentralityMap) [with MutableGraph = adjacency_list >, property > >; Done = clustering_threshold; EdgeCentralityMap = adj_list_edge_property_map >, edge_centrality_t>]’ bbc.cpp:149:36: required from here /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::Comparable<__gnu_cxx::__normal_iterator > >]’ 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ^ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements > > >]’: /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:601:7: required from ‘struct boost::RandomAccessIterator<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:597:3: required from ‘struct boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator > >]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied > > >::value’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied > > >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:72:8: [ skipping 5 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/betweenness_centrality.hpp:500:43: required from ‘void boost::detail::graph::brandes_betweenness_centrality_dispatch2(const Graph&, CentralityMap, EdgeCentralityMap, VertexIndexMap) [with Graph = boost::adjacency_list >, boost::property > >; CentralityMap = boost::dummy_property_map; EdgeCentralityMap = boost::adj_list_edge_property_map >, boost::edge_centrality_t>; VertexIndexMap = boost::vec_adj_list_vertex_id_map >, long unsigned int>]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/betweenness_centrality.hpp:531:57: required from ‘static void boost::detail::graph::brandes_betweenness_centrality_dispatch1::run(const Graph&, CentralityMap, EdgeCentralityMap, VertexIndexMap, boost::param_not_found) [with Graph = boost::adjacency_list >, boost::property > >; CentralityMap = boost::dummy_property_map; EdgeCentralityMap = boost::adj_list_edge_property_map >, boost::edge_centrality_t>; VertexIndexMap = boost::vec_adj_list_vertex_id_map >, long unsigned int>]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/betweenness_centrality.hpp:558:71: required from ‘void boost::brandes_betweenness_centrality(const Graph&, const bgl_named_params&, typename enable_if_c::traversal_category>::value, graph::detail::no_parameter>::type) [with Graph = adjacency_list >, property > >; Param = vec_adj_list_vertex_id_map >, long unsigned int>; Tag = vertex_index_t; Rest = bgl_named_params >, edge_centrality_t>, edge_centrality_t, no_property>; typename enable_if_c::traversal_category>::value, graph::detail::no_parameter>::type = graph::detail::no_parameter; typename graph_traits::traversal_category = undir_adj_list_traversal_tag]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/bc_clustering.hpp:131:39: required from ‘void boost::betweenness_centrality_clustering(MutableGraph&, Done, EdgeCentralityMap, VertexIndexMap) [with MutableGraph = adjacency_list >, property > >; Done = clustering_threshold; EdgeCentralityMap = adj_list_edge_property_map >, edge_centrality_t>; VertexIndexMap = vec_adj_list_vertex_id_map >, long unsigned int>]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/bc_clustering.hpp:150:38: required from ‘void boost::betweenness_centrality_clustering(MutableGraph&, Done, EdgeCentralityMap) [with MutableGraph = adjacency_list >, property > >; Done = clustering_threshold; EdgeCentralityMap = adj_list_edge_property_map >, edge_centrality_t>]’ bbc.cpp:149:36: required from here /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::RandomAccessIterator<__gnu_cxx::__normal_iterator > >]’ 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ^ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator > >]’: /home/omnipath/local/R/4.4-3.20/BH/include/boost/property_map/property_map.hpp:354:5: required from ‘boost::iterator_property_map >::value_type, typename std::iterator_traits< >::reference> boost::make_iterator_property_map(RAIter, ID) [with RAIter = __gnu_cxx::__normal_iterator >; ID = vec_adj_list_vertex_id_map >, long unsigned int>; typename std::iterator_traits< >::value_type = default_color_type; typename std::iterator_traits< >::reference = default_color_type&]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/betweenness_centrality.hpp:249:47: required from ‘void boost::detail::graph::brandes_unweighted_shortest_paths::operator()(Graph&, typename boost::graph_traits::vertex_descriptor, std::stack::vertex_descriptor>&, IncomingMap, DistanceMap, PathCountMap, VertexIndexMap) [with Graph = const boost::adjacency_list >, boost::property > >; IncomingMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator, std::allocator > >*, std::vector, std::allocator > >, std::allocator, std::allocator > > > > >, boost::vec_adj_list_vertex_id_map >, long unsigned int>, std::vector, std::allocator > >, std::vector, std::allocator > >&>; DistanceMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator > >, boost::vec_adj_list_vertex_id_map >, long unsigned int>, double, double&>; PathCountMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator > >, boost::vec_adj_list_vertex_id_map >, long unsigned int>, long unsigned int, long unsigned int&>; VertexIndexMap = boost::vec_adj_list_vertex_id_map >, long unsigned int>; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/betweenness_centrality.hpp:349:31: required from ‘void boost::detail::graph::brandes_betweenness_centrality_impl(const Graph&, CentralityMap, EdgeCentralityMap, IncomingMap, DistanceMap, DependencyMap, PathCountMap, VertexIndexMap, ShortestPaths) [with Graph = boost::adjacency_list >, boost::property > >; CentralityMap = boost::dummy_property_map; EdgeCentralityMap = boost::adj_list_edge_property_map >, boost::edge_centrality_t>; IncomingMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator, std::allocator > >*, std::vector, std::allocator > >, std::allocator, std::allocator > > > > >, boost::vec_adj_list_vertex_id_map >, long unsigned int>, std::vector, std::allocator > >, std::vector, std::allocator > >&>; DistanceMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator > >, boost::vec_adj_list_vertex_id_map >, long unsigned int>, double, double&>; DependencyMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator > >, boost::vec_adj_list_vertex_id_map >, long unsigned int>, double, double&>; PathCountMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator > >, boost::vec_adj_list_vertex_id_map >, long unsigned int>, long unsigned int, long unsigned int&>; VertexIndexMap = boost::vec_adj_list_vertex_id_map >, long unsigned int>; ShortestPaths = brandes_unweighted_shortest_paths]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/betweenness_centrality.hpp:412:55: required from ‘void boost::brandes_betweenness_centrality(const Graph&, CentralityMap, EdgeCentralityMap, IncomingMap, DistanceMap, DependencyMap, PathCountMap, VertexIndexMap, typename enable_if_c::traversal_category>::value, graph::detail::no_parameter>::type) [with Graph = adjacency_list >, property > >; CentralityMap = dummy_property_map; EdgeCentralityMap = adj_list_edge_property_map >, edge_centrality_t>; IncomingMap = iterator_property_map<__gnu_cxx::__normal_iterator, std::allocator > >*, std::vector, std::allocator > >, std::allocator, std::allocator > > > > >, vec_adj_list_vertex_id_map >, long unsigned int>, std::vector, std::allocator > >, std::vector, std::allocator > >&>; DistanceMap = iterator_property_map<__gnu_cxx::__normal_iterator > >, vec_adj_list_vertex_id_map >, long unsigned int>, double, double&>; DependencyMap = iterator_property_map<__gnu_cxx::__normal_iterator > >, vec_adj_list_vertex_id_map >, long unsigned int>, double, double&>; PathCountMap = iterator_property_map<__gnu_cxx::__normal_iterator > >, vec_adj_list_vertex_id_map >, long unsigned int>, long unsigned int, long unsigned int&>; VertexIndexMap = vec_adj_list_vertex_id_map >, long unsigned int>; typename enable_if_c::traversal_category>::value, graph::detail::no_parameter>::type = graph::detail::no_parameter; typename graph_traits::traversal_category = undir_adj_list_traversal_tag]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/betweenness_centrality.hpp:500:43: required from ‘void boost::detail::graph::brandes_betweenness_centrality_dispatch2(const Graph&, CentralityMap, EdgeCentralityMap, VertexIndexMap) [with Graph = boost::adjacency_list >, boost::property > >; CentralityMap = boost::dummy_property_map; EdgeCentralityMap = boost::adj_list_edge_property_map >, boost::edge_centrality_t>; VertexIndexMap = boost::vec_adj_list_vertex_id_map >, long unsigned int>]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/betweenness_centrality.hpp:531:57: required from ‘static void boost::detail::graph::brandes_betweenness_centrality_dispatch1::run(const Graph&, CentralityMap, EdgeCentralityMap, VertexIndexMap, boost::param_not_found) [with Graph = boost::adjacency_list >, boost::property > >; CentralityMap = boost::dummy_property_map; EdgeCentralityMap = boost::adj_list_edge_property_map >, boost::edge_centrality_t>; VertexIndexMap = boost::vec_adj_list_vertex_id_map >, long unsigned int>]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/betweenness_centrality.hpp:558:71: required from ‘void boost::brandes_betweenness_centrality(const Graph&, const bgl_named_params&, typename enable_if_c::traversal_category>::value, graph::detail::no_parameter>::type) [with Graph = adjacency_list >, property > >; Param = vec_adj_list_vertex_id_map >, long unsigned int>; Tag = vertex_index_t; Rest = bgl_named_params >, edge_centrality_t>, edge_centrality_t, no_property>; typename enable_if_c::traversal_category>::value, graph::detail::no_parameter>::type = graph::detail::no_parameter; typename graph_traits::traversal_category = undir_adj_list_traversal_tag]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/bc_clustering.hpp:131:39: required from ‘void boost::betweenness_centrality_clustering(MutableGraph&, Done, EdgeCentralityMap, VertexIndexMap) [with MutableGraph = adjacency_list >, property > >; Done = clustering_threshold; EdgeCentralityMap = adj_list_edge_property_map >, edge_centrality_t>; VertexIndexMap = vec_adj_list_vertex_id_map >, long unsigned int>]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/bc_clustering.hpp:150:38: required from ‘void boost::betweenness_centrality_clustering(MutableGraph&, Done, EdgeCentralityMap) [with MutableGraph = adjacency_list >, property > >; Done = clustering_threshold; EdgeCentralityMap = adj_list_edge_property_map >, edge_centrality_t>]’ bbc.cpp:149:36: required from here /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:597:17: note: in a call to non-static member function ‘boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator > >::~RandomAccessIteratorConcept()’ 597 | BOOST_concept(RandomAccessIterator,(TT)) | ^~~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/preprocessor/cat.hpp:29:34: note: in definition of macro ‘BOOST_PP_CAT_I’ 29 | # define BOOST_PP_CAT_I(a, b) a ## b | ^ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/concept_def.hpp:23:12: note: in expansion of macro ‘BOOST_PP_CAT’ 23 | struct BOOST_PP_CAT(name,Concept) \ | ^~~~~~~~~~~~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:597:3: note: in expansion of macro ‘BOOST_concept’ 597 | BOOST_concept(RandomAccessIterator,(TT)) | ^~~~~~~~~~~~~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::Assignable<__gnu_cxx::__normal_iterator > >]’: /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements > > >]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:145:5: required from ‘struct boost::Assignable<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:502:3: required from ‘struct boost::InputIterator<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:540:3: required from ‘struct boost::ForwardIterator<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:568:3: required from ‘struct boost::BidirectionalIterator<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:597:3: [ skipping 10 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/betweenness_centrality.hpp:500:43: required from ‘void boost::detail::graph::brandes_betweenness_centrality_dispatch2(const Graph&, CentralityMap, EdgeCentralityMap, VertexIndexMap) [with Graph = boost::adjacency_list >, boost::property > >; CentralityMap = boost::dummy_property_map; EdgeCentralityMap = boost::adj_list_edge_property_map >, boost::edge_centrality_t>; VertexIndexMap = boost::vec_adj_list_vertex_id_map >, long unsigned int>]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/betweenness_centrality.hpp:531:57: required from ‘static void boost::detail::graph::brandes_betweenness_centrality_dispatch1::run(const Graph&, CentralityMap, EdgeCentralityMap, VertexIndexMap, boost::param_not_found) [with Graph = boost::adjacency_list >, boost::property > >; CentralityMap = boost::dummy_property_map; EdgeCentralityMap = boost::adj_list_edge_property_map >, boost::edge_centrality_t>; VertexIndexMap = boost::vec_adj_list_vertex_id_map >, long unsigned int>]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/betweenness_centrality.hpp:558:71: required from ‘void boost::brandes_betweenness_centrality(const Graph&, const bgl_named_params&, typename enable_if_c::traversal_category>::value, graph::detail::no_parameter>::type) [with Graph = adjacency_list >, property > >; Param = vec_adj_list_vertex_id_map >, long unsigned int>; Tag = vertex_index_t; Rest = bgl_named_params >, edge_centrality_t>, edge_centrality_t, no_property>; typename enable_if_c::traversal_category>::value, graph::detail::no_parameter>::type = graph::detail::no_parameter; typename graph_traits::traversal_category = undir_adj_list_traversal_tag]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/bc_clustering.hpp:131:39: required from ‘void boost::betweenness_centrality_clustering(MutableGraph&, Done, EdgeCentralityMap, VertexIndexMap) [with MutableGraph = adjacency_list >, property > >; Done = clustering_threshold; EdgeCentralityMap = adj_list_edge_property_map >, edge_centrality_t>; VertexIndexMap = vec_adj_list_vertex_id_map >, long unsigned int>]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/bc_clustering.hpp:150:38: required from ‘void boost::betweenness_centrality_clustering(MutableGraph&, Done, EdgeCentralityMap) [with MutableGraph = adjacency_list >, property > >; Done = clustering_threshold; EdgeCentralityMap = adj_list_edge_property_map >, edge_centrality_t>]’ bbc.cpp:149:36: required from here /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::Assignable::~Assignable() [with TT = __gnu_cxx::__normal_iterator >]’ 37 | ~model() | ^ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:145:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 145 | BOOST_CONCEPT_USAGE(Assignable) { | ^~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::EqualityComparable<__gnu_cxx::__normal_iterator > >]’: /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements > > >]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:233:5: required from ‘struct boost::EqualityComparable<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:502:3: required from ‘struct boost::InputIterator<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:540:3: required from ‘struct boost::ForwardIterator<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:568:3: required from ‘struct boost::BidirectionalIterator<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:597:3: [ skipping 10 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/betweenness_centrality.hpp:500:43: required from ‘void boost::detail::graph::brandes_betweenness_centrality_dispatch2(const Graph&, CentralityMap, EdgeCentralityMap, VertexIndexMap) [with Graph = boost::adjacency_list >, boost::property > >; CentralityMap = boost::dummy_property_map; EdgeCentralityMap = boost::adj_list_edge_property_map >, boost::edge_centrality_t>; VertexIndexMap = boost::vec_adj_list_vertex_id_map >, long unsigned int>]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/betweenness_centrality.hpp:531:57: required from ‘static void boost::detail::graph::brandes_betweenness_centrality_dispatch1::run(const Graph&, CentralityMap, EdgeCentralityMap, VertexIndexMap, boost::param_not_found) [with Graph = boost::adjacency_list >, boost::property > >; CentralityMap = boost::dummy_property_map; EdgeCentralityMap = boost::adj_list_edge_property_map >, boost::edge_centrality_t>; VertexIndexMap = boost::vec_adj_list_vertex_id_map >, long unsigned int>]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/betweenness_centrality.hpp:558:71: required from ‘void boost::brandes_betweenness_centrality(const Graph&, const bgl_named_params&, typename enable_if_c::traversal_category>::value, graph::detail::no_parameter>::type) [with Graph = adjacency_list >, property > >; Param = vec_adj_list_vertex_id_map >, long unsigned int>; Tag = vertex_index_t; Rest = bgl_named_params >, edge_centrality_t>, edge_centrality_t, no_property>; typename enable_if_c::traversal_category>::value, graph::detail::no_parameter>::type = graph::detail::no_parameter; typename graph_traits::traversal_category = undir_adj_list_traversal_tag]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/bc_clustering.hpp:131:39: required from ‘void boost::betweenness_centrality_clustering(MutableGraph&, Done, EdgeCentralityMap, VertexIndexMap) [with MutableGraph = adjacency_list >, property > >; Done = clustering_threshold; EdgeCentralityMap = adj_list_edge_property_map >, edge_centrality_t>; VertexIndexMap = vec_adj_list_vertex_id_map >, long unsigned int>]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/bc_clustering.hpp:150:38: required from ‘void boost::betweenness_centrality_clustering(MutableGraph&, Done, EdgeCentralityMap) [with MutableGraph = adjacency_list >, property > >; Done = clustering_threshold; EdgeCentralityMap = adj_list_edge_property_map >, edge_centrality_t>]’ bbc.cpp:149:36: required from here /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::EqualityComparable::~EqualityComparable() [with TT = __gnu_cxx::__normal_iterator >]’ 37 | ~model() | ^ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:233:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 233 | BOOST_CONCEPT_USAGE(EqualityComparable) { | ^~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::InputIterator<__gnu_cxx::__normal_iterator > >]’: /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements > > >]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:512:7: required from ‘struct boost::InputIterator<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:540:3: required from ‘struct boost::ForwardIterator<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:568:3: required from ‘struct boost::BidirectionalIterator<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:597:3: required from ‘struct boost::RandomAccessIterator<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:597:3: [ skipping 9 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/betweenness_centrality.hpp:500:43: required from ‘void boost::detail::graph::brandes_betweenness_centrality_dispatch2(const Graph&, CentralityMap, EdgeCentralityMap, VertexIndexMap) [with Graph = boost::adjacency_list >, boost::property > >; CentralityMap = boost::dummy_property_map; EdgeCentralityMap = boost::adj_list_edge_property_map >, boost::edge_centrality_t>; VertexIndexMap = boost::vec_adj_list_vertex_id_map >, long unsigned int>]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/betweenness_centrality.hpp:531:57: required from ‘static void boost::detail::graph::brandes_betweenness_centrality_dispatch1::run(const Graph&, CentralityMap, EdgeCentralityMap, VertexIndexMap, boost::param_not_found) [with Graph = boost::adjacency_list >, boost::property > >; CentralityMap = boost::dummy_property_map; EdgeCentralityMap = boost::adj_list_edge_property_map >, boost::edge_centrality_t>; VertexIndexMap = boost::vec_adj_list_vertex_id_map >, long unsigned int>]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/betweenness_centrality.hpp:558:71: required from ‘void boost::brandes_betweenness_centrality(const Graph&, const bgl_named_params&, typename enable_if_c::traversal_category>::value, graph::detail::no_parameter>::type) [with Graph = adjacency_list >, property > >; Param = vec_adj_list_vertex_id_map >, long unsigned int>; Tag = vertex_index_t; Rest = bgl_named_params >, edge_centrality_t>, edge_centrality_t, no_property>; typename enable_if_c::traversal_category>::value, graph::detail::no_parameter>::type = graph::detail::no_parameter; typename graph_traits::traversal_category = undir_adj_list_traversal_tag]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/bc_clustering.hpp:131:39: required from ‘void boost::betweenness_centrality_clustering(MutableGraph&, Done, EdgeCentralityMap, VertexIndexMap) [with MutableGraph = adjacency_list >, property > >; Done = clustering_threshold; EdgeCentralityMap = adj_list_edge_property_map >, edge_centrality_t>; VertexIndexMap = vec_adj_list_vertex_id_map >, long unsigned int>]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/bc_clustering.hpp:150:38: required from ‘void boost::betweenness_centrality_clustering(MutableGraph&, Done, EdgeCentralityMap) [with MutableGraph = adjacency_list >, property > >; Done = clustering_threshold; EdgeCentralityMap = adj_list_edge_property_map >, edge_centrality_t>]’ bbc.cpp:149:36: required from here /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::InputIterator::~InputIterator() [with TT = __gnu_cxx::__normal_iterator >]’ 37 | ~model() | ^ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:512:7: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 512 | BOOST_CONCEPT_USAGE(InputIterator) | ^~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::ForwardIterator<__gnu_cxx::__normal_iterator > >]’: /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements > > >]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:543:7: required from ‘struct boost::ForwardIterator<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:568:3: required from ‘struct boost::BidirectionalIterator<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:597:3: required from ‘struct boost::RandomAccessIterator<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:597:3: required from ‘struct boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:32:62: [ skipping 8 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/betweenness_centrality.hpp:500:43: required from ‘void boost::detail::graph::brandes_betweenness_centrality_dispatch2(const Graph&, CentralityMap, EdgeCentralityMap, VertexIndexMap) [with Graph = boost::adjacency_list >, boost::property > >; CentralityMap = boost::dummy_property_map; EdgeCentralityMap = boost::adj_list_edge_property_map >, boost::edge_centrality_t>; VertexIndexMap = boost::vec_adj_list_vertex_id_map >, long unsigned int>]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/betweenness_centrality.hpp:531:57: required from ‘static void boost::detail::graph::brandes_betweenness_centrality_dispatch1::run(const Graph&, CentralityMap, EdgeCentralityMap, VertexIndexMap, boost::param_not_found) [with Graph = boost::adjacency_list >, boost::property > >; CentralityMap = boost::dummy_property_map; EdgeCentralityMap = boost::adj_list_edge_property_map >, boost::edge_centrality_t>; VertexIndexMap = boost::vec_adj_list_vertex_id_map >, long unsigned int>]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/betweenness_centrality.hpp:558:71: required from ‘void boost::brandes_betweenness_centrality(const Graph&, const bgl_named_params&, typename enable_if_c::traversal_category>::value, graph::detail::no_parameter>::type) [with Graph = adjacency_list >, property > >; Param = vec_adj_list_vertex_id_map >, long unsigned int>; Tag = vertex_index_t; Rest = bgl_named_params >, edge_centrality_t>, edge_centrality_t, no_property>; typename enable_if_c::traversal_category>::value, graph::detail::no_parameter>::type = graph::detail::no_parameter; typename graph_traits::traversal_category = undir_adj_list_traversal_tag]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/bc_clustering.hpp:131:39: required from ‘void boost::betweenness_centrality_clustering(MutableGraph&, Done, EdgeCentralityMap, VertexIndexMap) [with MutableGraph = adjacency_list >, property > >; Done = clustering_threshold; EdgeCentralityMap = adj_list_edge_property_map >, edge_centrality_t>; VertexIndexMap = vec_adj_list_vertex_id_map >, long unsigned int>]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/bc_clustering.hpp:150:38: required from ‘void boost::betweenness_centrality_clustering(MutableGraph&, Done, EdgeCentralityMap) [with MutableGraph = adjacency_list >, property > >; Done = clustering_threshold; EdgeCentralityMap = adj_list_edge_property_map >, edge_centrality_t>]’ bbc.cpp:149:36: required from here /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::ForwardIterator::~ForwardIterator() [with TT = __gnu_cxx::__normal_iterator >]’ 37 | ~model() | ^ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:543:7: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 543 | BOOST_CONCEPT_USAGE(ForwardIterator) | ^~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::BidirectionalIterator<__gnu_cxx::__normal_iterator > >]’: /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements > > >]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:571:7: required from ‘struct boost::BidirectionalIterator<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:597:3: required from ‘struct boost::RandomAccessIterator<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:597:3: required from ‘struct boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator > >]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:42:5: [ skipping 7 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/betweenness_centrality.hpp:500:43: required from ‘void boost::detail::graph::brandes_betweenness_centrality_dispatch2(const Graph&, CentralityMap, EdgeCentralityMap, VertexIndexMap) [with Graph = boost::adjacency_list >, boost::property > >; CentralityMap = boost::dummy_property_map; EdgeCentralityMap = boost::adj_list_edge_property_map >, boost::edge_centrality_t>; VertexIndexMap = boost::vec_adj_list_vertex_id_map >, long unsigned int>]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/betweenness_centrality.hpp:531:57: required from ‘static void boost::detail::graph::brandes_betweenness_centrality_dispatch1::run(const Graph&, CentralityMap, EdgeCentralityMap, VertexIndexMap, boost::param_not_found) [with Graph = boost::adjacency_list >, boost::property > >; CentralityMap = boost::dummy_property_map; EdgeCentralityMap = boost::adj_list_edge_property_map >, boost::edge_centrality_t>; VertexIndexMap = boost::vec_adj_list_vertex_id_map >, long unsigned int>]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/betweenness_centrality.hpp:558:71: required from ‘void boost::brandes_betweenness_centrality(const Graph&, const bgl_named_params&, typename enable_if_c::traversal_category>::value, graph::detail::no_parameter>::type) [with Graph = adjacency_list >, property > >; Param = vec_adj_list_vertex_id_map >, long unsigned int>; Tag = vertex_index_t; Rest = bgl_named_params >, edge_centrality_t>, edge_centrality_t, no_property>; typename enable_if_c::traversal_category>::value, graph::detail::no_parameter>::type = graph::detail::no_parameter; typename graph_traits::traversal_category = undir_adj_list_traversal_tag]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/bc_clustering.hpp:131:39: required from ‘void boost::betweenness_centrality_clustering(MutableGraph&, Done, EdgeCentralityMap, VertexIndexMap) [with MutableGraph = adjacency_list >, property > >; Done = clustering_threshold; EdgeCentralityMap = adj_list_edge_property_map >, edge_centrality_t>; VertexIndexMap = vec_adj_list_vertex_id_map >, long unsigned int>]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/bc_clustering.hpp:150:38: required from ‘void boost::betweenness_centrality_clustering(MutableGraph&, Done, EdgeCentralityMap) [with MutableGraph = adjacency_list >, property > >; Done = clustering_threshold; EdgeCentralityMap = adj_list_edge_property_map >, edge_centrality_t>]’ bbc.cpp:149:36: required from here /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::BidirectionalIterator::~BidirectionalIterator() [with TT = __gnu_cxx::__normal_iterator >]’ 37 | ~model() | ^ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:571:7: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 571 | BOOST_CONCEPT_USAGE(BidirectionalIterator) | ^~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::Comparable<__gnu_cxx::__normal_iterator > >]’: /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements > > >]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:253:5: required from ‘struct boost::Comparable<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:597:3: required from ‘struct boost::RandomAccessIterator<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:597:3: required from ‘struct boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator > >]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:42:5: [ skipping 7 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/betweenness_centrality.hpp:500:43: required from ‘void boost::detail::graph::brandes_betweenness_centrality_dispatch2(const Graph&, CentralityMap, EdgeCentralityMap, VertexIndexMap) [with Graph = boost::adjacency_list >, boost::property > >; CentralityMap = boost::dummy_property_map; EdgeCentralityMap = boost::adj_list_edge_property_map >, boost::edge_centrality_t>; VertexIndexMap = boost::vec_adj_list_vertex_id_map >, long unsigned int>]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/betweenness_centrality.hpp:531:57: required from ‘static void boost::detail::graph::brandes_betweenness_centrality_dispatch1::run(const Graph&, CentralityMap, EdgeCentralityMap, VertexIndexMap, boost::param_not_found) [with Graph = boost::adjacency_list >, boost::property > >; CentralityMap = boost::dummy_property_map; EdgeCentralityMap = boost::adj_list_edge_property_map >, boost::edge_centrality_t>; VertexIndexMap = boost::vec_adj_list_vertex_id_map >, long unsigned int>]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/betweenness_centrality.hpp:558:71: required from ‘void boost::brandes_betweenness_centrality(const Graph&, const bgl_named_params&, typename enable_if_c::traversal_category>::value, graph::detail::no_parameter>::type) [with Graph = adjacency_list >, property > >; Param = vec_adj_list_vertex_id_map >, long unsigned int>; Tag = vertex_index_t; Rest = bgl_named_params >, edge_centrality_t>, edge_centrality_t, no_property>; typename enable_if_c::traversal_category>::value, graph::detail::no_parameter>::type = graph::detail::no_parameter; typename graph_traits::traversal_category = undir_adj_list_traversal_tag]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/bc_clustering.hpp:131:39: required from ‘void boost::betweenness_centrality_clustering(MutableGraph&, Done, EdgeCentralityMap, VertexIndexMap) [with MutableGraph = adjacency_list >, property > >; Done = clustering_threshold; EdgeCentralityMap = adj_list_edge_property_map >, edge_centrality_t>; VertexIndexMap = vec_adj_list_vertex_id_map >, long unsigned int>]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/bc_clustering.hpp:150:38: required from ‘void boost::betweenness_centrality_clustering(MutableGraph&, Done, EdgeCentralityMap) [with MutableGraph = adjacency_list >, property > >; Done = clustering_threshold; EdgeCentralityMap = adj_list_edge_property_map >, edge_centrality_t>]’ bbc.cpp:149:36: required from here /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::Comparable::~Comparable() [with TT = __gnu_cxx::__normal_iterator >]’ 37 | ~model() | ^ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:253:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 253 | BOOST_CONCEPT_USAGE(Comparable) { | ^~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::RandomAccessIterator<__gnu_cxx::__normal_iterator > >]’: /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements > > >]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:601:7: required from ‘struct boost::RandomAccessIterator<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:597:3: required from ‘struct boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator > >]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied > > >::value’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:45:51: [ skipping 6 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/betweenness_centrality.hpp:500:43: required from ‘void boost::detail::graph::brandes_betweenness_centrality_dispatch2(const Graph&, CentralityMap, EdgeCentralityMap, VertexIndexMap) [with Graph = boost::adjacency_list >, boost::property > >; CentralityMap = boost::dummy_property_map; EdgeCentralityMap = boost::adj_list_edge_property_map >, boost::edge_centrality_t>; VertexIndexMap = boost::vec_adj_list_vertex_id_map >, long unsigned int>]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/betweenness_centrality.hpp:531:57: required from ‘static void boost::detail::graph::brandes_betweenness_centrality_dispatch1::run(const Graph&, CentralityMap, EdgeCentralityMap, VertexIndexMap, boost::param_not_found) [with Graph = boost::adjacency_list >, boost::property > >; CentralityMap = boost::dummy_property_map; EdgeCentralityMap = boost::adj_list_edge_property_map >, boost::edge_centrality_t>; VertexIndexMap = boost::vec_adj_list_vertex_id_map >, long unsigned int>]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/betweenness_centrality.hpp:558:71: required from ‘void boost::brandes_betweenness_centrality(const Graph&, const bgl_named_params&, typename enable_if_c::traversal_category>::value, graph::detail::no_parameter>::type) [with Graph = adjacency_list >, property > >; Param = vec_adj_list_vertex_id_map >, long unsigned int>; Tag = vertex_index_t; Rest = bgl_named_params >, edge_centrality_t>, edge_centrality_t, no_property>; typename enable_if_c::traversal_category>::value, graph::detail::no_parameter>::type = graph::detail::no_parameter; typename graph_traits::traversal_category = undir_adj_list_traversal_tag]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/bc_clustering.hpp:131:39: required from ‘void boost::betweenness_centrality_clustering(MutableGraph&, Done, EdgeCentralityMap, VertexIndexMap) [with MutableGraph = adjacency_list >, property > >; Done = clustering_threshold; EdgeCentralityMap = adj_list_edge_property_map >, edge_centrality_t>; VertexIndexMap = vec_adj_list_vertex_id_map >, long unsigned int>]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/bc_clustering.hpp:150:38: required from ‘void boost::betweenness_centrality_clustering(MutableGraph&, Done, EdgeCentralityMap) [with MutableGraph = adjacency_list >, property > >; Done = clustering_threshold; EdgeCentralityMap = adj_list_edge_property_map >, edge_centrality_t>]’ bbc.cpp:149:36: required from here /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::RandomAccessIterator::~RandomAccessIterator() [with TT = __gnu_cxx::__normal_iterator >]’ 37 | ~model() | ^ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:601:7: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 601 | BOOST_CONCEPT_USAGE(RandomAccessIterator) | ^~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements >, boost::property > > > >]’: /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/graph_concepts.hpp:66:5: required from ‘struct boost::concepts::Graph >, boost::property > > >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/graph_concepts.hpp:75:1: required from ‘struct boost::concepts::IncidenceGraph >, boost::property > > >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/graph_concepts.hpp:75:1: required from ‘struct boost::concepts::IncidenceGraphConcept >, boost::property > > >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::concepts::IncidenceGraphConcept >, boost::property > > >]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied >, boost::property > > > >::value’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:45:51: [ skipping 7 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/betweenness_centrality.hpp:500:43: required from ‘void boost::detail::graph::brandes_betweenness_centrality_dispatch2(const Graph&, CentralityMap, EdgeCentralityMap, VertexIndexMap) [with Graph = boost::adjacency_list >, boost::property > >; CentralityMap = boost::dummy_property_map; EdgeCentralityMap = boost::adj_list_edge_property_map >, boost::edge_centrality_t>; VertexIndexMap = boost::vec_adj_list_vertex_id_map >, long unsigned int>]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/betweenness_centrality.hpp:531:57: required from ‘static void boost::detail::graph::brandes_betweenness_centrality_dispatch1::run(const Graph&, CentralityMap, EdgeCentralityMap, VertexIndexMap, boost::param_not_found) [with Graph = boost::adjacency_list >, boost::property > >; CentralityMap = boost::dummy_property_map; EdgeCentralityMap = boost::adj_list_edge_property_map >, boost::edge_centrality_t>; VertexIndexMap = boost::vec_adj_list_vertex_id_map >, long unsigned int>]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/betweenness_centrality.hpp:558:71: required from ‘void boost::brandes_betweenness_centrality(const Graph&, const bgl_named_params&, typename enable_if_c::traversal_category>::value, graph::detail::no_parameter>::type) [with Graph = adjacency_list >, property > >; Param = vec_adj_list_vertex_id_map >, long unsigned int>; Tag = vertex_index_t; Rest = bgl_named_params >, edge_centrality_t>, edge_centrality_t, no_property>; typename enable_if_c::traversal_category>::value, graph::detail::no_parameter>::type = graph::detail::no_parameter; typename graph_traits::traversal_category = undir_adj_list_traversal_tag]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/bc_clustering.hpp:131:39: required from ‘void boost::betweenness_centrality_clustering(MutableGraph&, Done, EdgeCentralityMap, VertexIndexMap) [with MutableGraph = adjacency_list >, property > >; Done = clustering_threshold; EdgeCentralityMap = adj_list_edge_property_map >, edge_centrality_t>; VertexIndexMap = vec_adj_list_vertex_id_map >, long unsigned int>]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/bc_clustering.hpp:150:38: required from ‘void boost::betweenness_centrality_clustering(MutableGraph&, Done, EdgeCentralityMap) [with MutableGraph = adjacency_list >, property > >; Done = clustering_threshold; EdgeCentralityMap = adj_list_edge_property_map >, edge_centrality_t>]’ bbc.cpp:149:36: required from here /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::concepts::Graph >, boost::property > > >]’ 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ^ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements >, boost::property > > > >]’: /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/graph_concepts.hpp:87:5: required from ‘struct boost::concepts::IncidenceGraph >, boost::property > > >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/graph_concepts.hpp:75:1: required from ‘struct boost::concepts::IncidenceGraphConcept >, boost::property > > >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::concepts::IncidenceGraphConcept >, boost::property > > >]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied >, boost::property > > > >::value’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied >, boost::property > > > >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:72:8: [ skipping 6 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/betweenness_centrality.hpp:500:43: required from ‘void boost::detail::graph::brandes_betweenness_centrality_dispatch2(const Graph&, CentralityMap, EdgeCentralityMap, VertexIndexMap) [with Graph = boost::adjacency_list >, boost::property > >; CentralityMap = boost::dummy_property_map; EdgeCentralityMap = boost::adj_list_edge_property_map >, boost::edge_centrality_t>; VertexIndexMap = boost::vec_adj_list_vertex_id_map >, long unsigned int>]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/betweenness_centrality.hpp:531:57: required from ‘static void boost::detail::graph::brandes_betweenness_centrality_dispatch1::run(const Graph&, CentralityMap, EdgeCentralityMap, VertexIndexMap, boost::param_not_found) [with Graph = boost::adjacency_list >, boost::property > >; CentralityMap = boost::dummy_property_map; EdgeCentralityMap = boost::adj_list_edge_property_map >, boost::edge_centrality_t>; VertexIndexMap = boost::vec_adj_list_vertex_id_map >, long unsigned int>]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/betweenness_centrality.hpp:558:71: required from ‘void boost::brandes_betweenness_centrality(const Graph&, const bgl_named_params&, typename enable_if_c::traversal_category>::value, graph::detail::no_parameter>::type) [with Graph = adjacency_list >, property > >; Param = vec_adj_list_vertex_id_map >, long unsigned int>; Tag = vertex_index_t; Rest = bgl_named_params >, edge_centrality_t>, edge_centrality_t, no_property>; typename enable_if_c::traversal_category>::value, graph::detail::no_parameter>::type = graph::detail::no_parameter; typename graph_traits::traversal_category = undir_adj_list_traversal_tag]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/bc_clustering.hpp:131:39: required from ‘void boost::betweenness_centrality_clustering(MutableGraph&, Done, EdgeCentralityMap, VertexIndexMap) [with MutableGraph = adjacency_list >, property > >; Done = clustering_threshold; EdgeCentralityMap = adj_list_edge_property_map >, edge_centrality_t>; VertexIndexMap = vec_adj_list_vertex_id_map >, long unsigned int>]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/bc_clustering.hpp:150:38: required from ‘void boost::betweenness_centrality_clustering(MutableGraph&, Done, EdgeCentralityMap) [with MutableGraph = adjacency_list >, property > >; Done = clustering_threshold; EdgeCentralityMap = adj_list_edge_property_map >, edge_centrality_t>]’ bbc.cpp:149:36: required from here /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::concepts::IncidenceGraph >, boost::property > > >]’ 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ^ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::IncidenceGraphConcept >, boost::property > > >]’: /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/depth_first_search.hpp:129:9: required from ‘void boost::breadth_first_visit(const IncidenceGraph&, SourceIterator, SourceIterator, Buffer&, BFSVisitor, ColorMap) [with IncidenceGraph = adjacency_list >, property > >; Buffer = queue > >; BFSVisitor = detail::graph::brandes_unweighted_shortest_paths::visitor_type >, property > >, iterator_property_map<__gnu_cxx::__normal_iterator, std::allocator > >*, std::vector, std::allocator > >, std::allocator, std::allocator > > > > >, vec_adj_list_vertex_id_map >, long unsigned int>, std::vector, std::allocator > >, std::vector, std::allocator > >&>, iterator_property_map<__gnu_cxx::__normal_iterator > >, vec_adj_list_vertex_id_map >, long unsigned int>, double, double&>, iterator_property_map<__gnu_cxx::__normal_iterator > >, vec_adj_list_vertex_id_map >, long unsigned int>, long unsigned int, long unsigned int&> >; ColorMap = iterator_property_map<__gnu_cxx::__normal_iterator >, vec_adj_list_vertex_id_map >, long unsigned int>, default_color_type, default_color_type&>; SourceIterator = long unsigned int*]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/breadth_first_search.hpp:118:24: required from ‘void boost::breadth_first_visit(const IncidenceGraph&, typename graph_traits::vertex_descriptor, Buffer&, BFSVisitor, ColorMap) [with IncidenceGraph = adjacency_list >, property > >; Buffer = queue > >; BFSVisitor = detail::graph::brandes_unweighted_shortest_paths::visitor_type >, property > >, iterator_property_map<__gnu_cxx::__normal_iterator, std::allocator > >*, std::vector, std::allocator > >, std::allocator, std::allocator > > > > >, vec_adj_list_vertex_id_map >, long unsigned int>, std::vector, std::allocator > >, std::vector, std::allocator > >&>, iterator_property_map<__gnu_cxx::__normal_iterator > >, vec_adj_list_vertex_id_map >, long unsigned int>, double, double&>, iterator_property_map<__gnu_cxx::__normal_iterator > >, vec_adj_list_vertex_id_map >, long unsigned int>, long unsigned int, long unsigned int&> >; ColorMap = iterator_property_map<__gnu_cxx::__normal_iterator >, vec_adj_list_vertex_id_map >, long unsigned int>, default_color_type, default_color_type&>; typename graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/betweenness_centrality.hpp:248:36: required from ‘void boost::detail::graph::brandes_unweighted_shortest_paths::operator()(Graph&, typename boost::graph_traits::vertex_descriptor, std::stack::vertex_descriptor>&, IncomingMap, DistanceMap, PathCountMap, VertexIndexMap) [with Graph = const boost::adjacency_list >, boost::property > >; IncomingMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator, std::allocator > >*, std::vector, std::allocator > >, std::allocator, std::allocator > > > > >, boost::vec_adj_list_vertex_id_map >, long unsigned int>, std::vector, std::allocator > >, std::vector, std::allocator > >&>; DistanceMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator > >, boost::vec_adj_list_vertex_id_map >, long unsigned int>, double, double&>; PathCountMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator > >, boost::vec_adj_list_vertex_id_map >, long unsigned int>, long unsigned int, long unsigned int&>; VertexIndexMap = boost::vec_adj_list_vertex_id_map >, long unsigned int>; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/betweenness_centrality.hpp:349:31: required from ‘void boost::detail::graph::brandes_betweenness_centrality_impl(const Graph&, CentralityMap, EdgeCentralityMap, IncomingMap, DistanceMap, DependencyMap, PathCountMap, VertexIndexMap, ShortestPaths) [with Graph = boost::adjacency_list >, boost::property > >; CentralityMap = boost::dummy_property_map; EdgeCentralityMap = boost::adj_list_edge_property_map >, boost::edge_centrality_t>; IncomingMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator, std::allocator > >*, std::vector, std::allocator > >, std::allocator, std::allocator > > > > >, boost::vec_adj_list_vertex_id_map >, long unsigned int>, std::vector, std::allocator > >, std::vector, std::allocator > >&>; DistanceMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator > >, boost::vec_adj_list_vertex_id_map >, long unsigned int>, double, double&>; DependencyMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator > >, boost::vec_adj_list_vertex_id_map >, long unsigned int>, double, double&>; PathCountMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator > >, boost::vec_adj_list_vertex_id_map >, long unsigned int>, long unsigned int, long unsigned int&>; VertexIndexMap = boost::vec_adj_list_vertex_id_map >, long unsigned int>; ShortestPaths = brandes_unweighted_shortest_paths]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/betweenness_centrality.hpp:412:55: required from ‘void boost::brandes_betweenness_centrality(const Graph&, CentralityMap, EdgeCentralityMap, IncomingMap, DistanceMap, DependencyMap, PathCountMap, VertexIndexMap, typename enable_if_c::traversal_category>::value, graph::detail::no_parameter>::type) [with Graph = adjacency_list >, property > >; CentralityMap = dummy_property_map; EdgeCentralityMap = adj_list_edge_property_map >, edge_centrality_t>; IncomingMap = iterator_property_map<__gnu_cxx::__normal_iterator, std::allocator > >*, std::vector, std::allocator > >, std::allocator, std::allocator > > > > >, vec_adj_list_vertex_id_map >, long unsigned int>, std::vector, std::allocator > >, std::vector, std::allocator > >&>; DistanceMap = iterator_property_map<__gnu_cxx::__normal_iterator > >, vec_adj_list_vertex_id_map >, long unsigned int>, double, double&>; DependencyMap = iterator_property_map<__gnu_cxx::__normal_iterator > >, vec_adj_list_vertex_id_map >, long unsigned int>, double, double&>; PathCountMap = iterator_property_map<__gnu_cxx::__normal_iterator > >, vec_adj_list_vertex_id_map >, long unsigned int>, long unsigned int, long unsigned int&>; VertexIndexMap = vec_adj_list_vertex_id_map >, long unsigned int>; typename enable_if_c::traversal_category>::value, graph::detail::no_parameter>::type = graph::detail::no_parameter; typename graph_traits::traversal_category = undir_adj_list_traversal_tag]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/betweenness_centrality.hpp:500:43: required from ‘void boost::detail::graph::brandes_betweenness_centrality_dispatch2(const Graph&, CentralityMap, EdgeCentralityMap, VertexIndexMap) [with Graph = boost::adjacency_list >, boost::property > >; CentralityMap = boost::dummy_property_map; EdgeCentralityMap = boost::adj_list_edge_property_map >, boost::edge_centrality_t>; VertexIndexMap = boost::vec_adj_list_vertex_id_map >, long unsigned int>]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/betweenness_centrality.hpp:531:57: required from ‘static void boost::detail::graph::brandes_betweenness_centrality_dispatch1::run(const Graph&, CentralityMap, EdgeCentralityMap, VertexIndexMap, boost::param_not_found) [with Graph = boost::adjacency_list >, boost::property > >; CentralityMap = boost::dummy_property_map; EdgeCentralityMap = boost::adj_list_edge_property_map >, boost::edge_centrality_t>; VertexIndexMap = boost::vec_adj_list_vertex_id_map >, long unsigned int>]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/betweenness_centrality.hpp:558:71: required from ‘void boost::brandes_betweenness_centrality(const Graph&, const bgl_named_params&, typename enable_if_c::traversal_category>::value, graph::detail::no_parameter>::type) [with Graph = adjacency_list >, property > >; Param = vec_adj_list_vertex_id_map >, long unsigned int>; Tag = vertex_index_t; Rest = bgl_named_params >, edge_centrality_t>, edge_centrality_t, no_property>; typename enable_if_c::traversal_category>::value, graph::detail::no_parameter>::type = graph::detail::no_parameter; typename graph_traits::traversal_category = undir_adj_list_traversal_tag]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/bc_clustering.hpp:131:39: required from ‘void boost::betweenness_centrality_clustering(MutableGraph&, Done, EdgeCentralityMap, VertexIndexMap) [with MutableGraph = adjacency_list >, property > >; Done = clustering_threshold; EdgeCentralityMap = adj_list_edge_property_map >, edge_centrality_t>; VertexIndexMap = vec_adj_list_vertex_id_map >, long unsigned int>]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/bc_clustering.hpp:150:38: required from ‘void boost::betweenness_centrality_clustering(MutableGraph&, Done, EdgeCentralityMap) [with MutableGraph = adjacency_list >, property > >; Done = clustering_threshold; EdgeCentralityMap = adj_list_edge_property_map >, edge_centrality_t>]’ bbc.cpp:149:36: required from here /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/graph_concepts.hpp:75:15: note: in a call to non-static member function ‘boost::concepts::IncidenceGraphConcept >, boost::property > > >::~IncidenceGraphConcept()’ 75 | BOOST_concept(IncidenceGraph, (G)) : Graph< G > | ^~~~~~~~~~~~~~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/preprocessor/cat.hpp:29:34: note: in definition of macro ‘BOOST_PP_CAT_I’ 29 | # define BOOST_PP_CAT_I(a, b) a ## b | ^ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/concept_def.hpp:23:12: note: in expansion of macro ‘BOOST_PP_CAT’ 23 | struct BOOST_PP_CAT(name,Concept) \ | ^~~~~~~~~~~~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/graph_concepts.hpp:75:1: note: in expansion of macro ‘BOOST_concept’ 75 | BOOST_concept(IncidenceGraph, (G)) : Graph< G > | ^~~~~~~~~~~~~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::constraint::failed() [with Model = boost::BFSVisitorConcept >, boost::property > >, boost::iterator_property_map<__gnu_cxx::__normal_iterator, std::allocator > >*, std::vector, std::allocator > >, std::allocator, std::allocator > > > > >, boost::vec_adj_list_vertex_id_map >, long unsigned int>, std::vector, std::allocator > >, std::vector, std::allocator > >&>, boost::iterator_property_map<__gnu_cxx::__normal_iterator > >, boost::vec_adj_list_vertex_id_map >, long unsigned int>, double, double&>, boost::iterator_property_map<__gnu_cxx::__normal_iterator > >, boost::vec_adj_list_vertex_id_map >, long unsigned int>, long unsigned int, long unsigned int&> >, boost::adjacency_list >, boost::property > > >]’: /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/breadth_first_search.hpp:65:5: required from ‘void boost::breadth_first_visit(const IncidenceGraph&, SourceIterator, SourceIterator, Buffer&, BFSVisitor, ColorMap) [with IncidenceGraph = adjacency_list >, property > >; Buffer = queue > >; BFSVisitor = detail::graph::brandes_unweighted_shortest_paths::visitor_type >, property > >, iterator_property_map<__gnu_cxx::__normal_iterator, std::allocator > >*, std::vector, std::allocator > >, std::allocator, std::allocator > > > > >, vec_adj_list_vertex_id_map >, long unsigned int>, std::vector, std::allocator > >, std::vector, std::allocator > >&>, iterator_property_map<__gnu_cxx::__normal_iterator > >, vec_adj_list_vertex_id_map >, long unsigned int>, double, double&>, iterator_property_map<__gnu_cxx::__normal_iterator > >, vec_adj_list_vertex_id_map >, long unsigned int>, long unsigned int, long unsigned int&> >; ColorMap = iterator_property_map<__gnu_cxx::__normal_iterator >, vec_adj_list_vertex_id_map >, long unsigned int>, default_color_type, default_color_type&>; SourceIterator = long unsigned int*]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/breadth_first_search.hpp:118:24: required from ‘void boost::breadth_first_visit(const IncidenceGraph&, typename graph_traits::vertex_descriptor, Buffer&, BFSVisitor, ColorMap) [with IncidenceGraph = adjacency_list >, property > >; Buffer = queue > >; BFSVisitor = detail::graph::brandes_unweighted_shortest_paths::visitor_type >, property > >, iterator_property_map<__gnu_cxx::__normal_iterator, std::allocator > >*, std::vector, std::allocator > >, std::allocator, std::allocator > > > > >, vec_adj_list_vertex_id_map >, long unsigned int>, std::vector, std::allocator > >, std::vector, std::allocator > >&>, iterator_property_map<__gnu_cxx::__normal_iterator > >, vec_adj_list_vertex_id_map >, long unsigned int>, double, double&>, iterator_property_map<__gnu_cxx::__normal_iterator > >, vec_adj_list_vertex_id_map >, long unsigned int>, long unsigned int, long unsigned int&> >; ColorMap = iterator_property_map<__gnu_cxx::__normal_iterator >, vec_adj_list_vertex_id_map >, long unsigned int>, default_color_type, default_color_type&>; typename graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/betweenness_centrality.hpp:248:36: required from ‘void boost::detail::graph::brandes_unweighted_shortest_paths::operator()(Graph&, typename boost::graph_traits::vertex_descriptor, std::stack::vertex_descriptor>&, IncomingMap, DistanceMap, PathCountMap, VertexIndexMap) [with Graph = const boost::adjacency_list >, boost::property > >; IncomingMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator, std::allocator > >*, std::vector, std::allocator > >, std::allocator, std::allocator > > > > >, boost::vec_adj_list_vertex_id_map >, long unsigned int>, std::vector, std::allocator > >, std::vector, std::allocator > >&>; DistanceMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator > >, boost::vec_adj_list_vertex_id_map >, long unsigned int>, double, double&>; PathCountMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator > >, boost::vec_adj_list_vertex_id_map >, long unsigned int>, long unsigned int, long unsigned int&>; VertexIndexMap = boost::vec_adj_list_vertex_id_map >, long unsigned int>; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/betweenness_centrality.hpp:349:31: required from ‘void boost::detail::graph::brandes_betweenness_centrality_impl(const Graph&, CentralityMap, EdgeCentralityMap, IncomingMap, DistanceMap, DependencyMap, PathCountMap, VertexIndexMap, ShortestPaths) [with Graph = boost::adjacency_list >, boost::property > >; CentralityMap = boost::dummy_property_map; EdgeCentralityMap = boost::adj_list_edge_property_map >, boost::edge_centrality_t>; IncomingMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator, std::allocator > >*, std::vector, std::allocator > >, std::allocator, std::allocator > > > > >, boost::vec_adj_list_vertex_id_map >, long unsigned int>, std::vector, std::allocator > >, std::vector, std::allocator > >&>; DistanceMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator > >, boost::vec_adj_list_vertex_id_map >, long unsigned int>, double, double&>; DependencyMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator > >, boost::vec_adj_list_vertex_id_map >, long unsigned int>, double, double&>; PathCountMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator > >, boost::vec_adj_list_vertex_id_map >, long unsigned int>, long unsigned int, long unsigned int&>; VertexIndexMap = boost::vec_adj_list_vertex_id_map >, long unsigned int>; ShortestPaths = brandes_unweighted_shortest_paths]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/betweenness_centrality.hpp:412:55: required from ‘void boost::brandes_betweenness_centrality(const Graph&, CentralityMap, EdgeCentralityMap, IncomingMap, DistanceMap, DependencyMap, PathCountMap, VertexIndexMap, typename enable_if_c::traversal_category>::value, graph::detail::no_parameter>::type) [with Graph = adjacency_list >, property > >; CentralityMap = dummy_property_map; EdgeCentralityMap = adj_list_edge_property_map >, edge_centrality_t>; IncomingMap = iterator_property_map<__gnu_cxx::__normal_iterator, std::allocator > >*, std::vector, std::allocator > >, std::allocator, std::allocator > > > > >, vec_adj_list_vertex_id_map >, long unsigned int>, std::vector, std::allocator > >, std::vector, std::allocator > >&>; DistanceMap = iterator_property_map<__gnu_cxx::__normal_iterator > >, vec_adj_list_vertex_id_map >, long unsigned int>, double, double&>; DependencyMap = iterator_property_map<__gnu_cxx::__normal_iterator > >, vec_adj_list_vertex_id_map >, long unsigned int>, double, double&>; PathCountMap = iterator_property_map<__gnu_cxx::__normal_iterator > >, vec_adj_list_vertex_id_map >, long unsigned int>, long unsigned int, long unsigned int&>; VertexIndexMap = vec_adj_list_vertex_id_map >, long unsigned int>; typename enable_if_c::traversal_category>::value, graph::detail::no_parameter>::type = graph::detail::no_parameter; typename graph_traits::traversal_category = undir_adj_list_traversal_tag]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/betweenness_centrality.hpp:500:43: required from ‘void boost::detail::graph::brandes_betweenness_centrality_dispatch2(const Graph&, CentralityMap, EdgeCentralityMap, VertexIndexMap) [with Graph = boost::adjacency_list >, boost::property > >; CentralityMap = boost::dummy_property_map; EdgeCentralityMap = boost::adj_list_edge_property_map >, boost::edge_centrality_t>; VertexIndexMap = boost::vec_adj_list_vertex_id_map >, long unsigned int>]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/betweenness_centrality.hpp:531:57: required from ‘static void boost::detail::graph::brandes_betweenness_centrality_dispatch1::run(const Graph&, CentralityMap, EdgeCentralityMap, VertexIndexMap, boost::param_not_found) [with Graph = boost::adjacency_list >, boost::property > >; CentralityMap = boost::dummy_property_map; EdgeCentralityMap = boost::adj_list_edge_property_map >, boost::edge_centrality_t>; VertexIndexMap = boost::vec_adj_list_vertex_id_map >, long unsigned int>]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/betweenness_centrality.hpp:558:71: required from ‘void boost::brandes_betweenness_centrality(const Graph&, const bgl_named_params&, typename enable_if_c::traversal_category>::value, graph::detail::no_parameter>::type) [with Graph = adjacency_list >, property > >; Param = vec_adj_list_vertex_id_map >, long unsigned int>; Tag = vertex_index_t; Rest = bgl_named_params >, edge_centrality_t>, edge_centrality_t, no_property>; typename enable_if_c::traversal_category>::value, graph::detail::no_parameter>::type = graph::detail::no_parameter; typename graph_traits::traversal_category = undir_adj_list_traversal_tag]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/bc_clustering.hpp:131:39: required from ‘void boost::betweenness_centrality_clustering(MutableGraph&, Done, EdgeCentralityMap, VertexIndexMap) [with MutableGraph = adjacency_list >, property > >; Done = clustering_threshold; EdgeCentralityMap = adj_list_edge_property_map >, edge_centrality_t>; VertexIndexMap = vec_adj_list_vertex_id_map >, long unsigned int>]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/bc_clustering.hpp:150:38: required from ‘void boost::betweenness_centrality_clustering(MutableGraph&, Done, EdgeCentralityMap) [with MutableGraph = adjacency_list >, property > >; Done = clustering_threshold; EdgeCentralityMap = adj_list_edge_property_map >, edge_centrality_t>]’ bbc.cpp:149:36: required from here /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:65:52: warning: ‘this’ pointer is null [-Wnonnull] 65 | static void failed() { ((Model*)0)->constraints(); } | ~~~~~~~~~~~~~~~~~~~~~~~~^~ In file included from /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/dijkstra_shortest_paths.hpp:21, from /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/betweenness_centrality.hpp:15, from /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/bc_clustering.hpp:13, from bbc.cpp:37: /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/breadth_first_search.hpp:37:10: note: in a call to non-static member function ‘void boost::BFSVisitorConcept::constraints() [with Visitor = boost::detail::graph::brandes_unweighted_shortest_paths::visitor_type >, boost::property > >, boost::iterator_property_map<__gnu_cxx::__normal_iterator, std::allocator > >*, std::vector, std::allocator > >, std::allocator, std::allocator > > > > >, boost::vec_adj_list_vertex_id_map >, long unsigned int>, std::vector, std::allocator > >, std::vector, std::allocator > >&>, boost::iterator_property_map<__gnu_cxx::__normal_iterator > >, boost::vec_adj_list_vertex_id_map >, long unsigned int>, double, double&>, boost::iterator_property_map<__gnu_cxx::__normal_iterator > >, boost::vec_adj_list_vertex_id_map >, long unsigned int>, long unsigned int, long unsigned int&> >; Graph = boost::adjacency_list >, boost::property > >]’ 37 | void constraints() | ^~~~~~~~~~~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::constraint::failed() [with Model = boost::ReadWritePropertyMapConcept >, boost::vec_adj_list_vertex_id_map >, long unsigned int>, boost::default_color_type, boost::default_color_type&>, long unsigned int>]’: /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/breadth_first_search.hpp:66:5: required from ‘void boost::breadth_first_visit(const IncidenceGraph&, SourceIterator, SourceIterator, Buffer&, BFSVisitor, ColorMap) [with IncidenceGraph = adjacency_list >, property > >; Buffer = queue > >; BFSVisitor = detail::graph::brandes_unweighted_shortest_paths::visitor_type >, property > >, iterator_property_map<__gnu_cxx::__normal_iterator, std::allocator > >*, std::vector, std::allocator > >, std::allocator, std::allocator > > > > >, vec_adj_list_vertex_id_map >, long unsigned int>, std::vector, std::allocator > >, std::vector, std::allocator > >&>, iterator_property_map<__gnu_cxx::__normal_iterator > >, vec_adj_list_vertex_id_map >, long unsigned int>, double, double&>, iterator_property_map<__gnu_cxx::__normal_iterator > >, vec_adj_list_vertex_id_map >, long unsigned int>, long unsigned int, long unsigned int&> >; ColorMap = iterator_property_map<__gnu_cxx::__normal_iterator >, vec_adj_list_vertex_id_map >, long unsigned int>, default_color_type, default_color_type&>; SourceIterator = long unsigned int*]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/breadth_first_search.hpp:118:24: required from ‘void boost::breadth_first_visit(const IncidenceGraph&, typename graph_traits::vertex_descriptor, Buffer&, BFSVisitor, ColorMap) [with IncidenceGraph = adjacency_list >, property > >; Buffer = queue > >; BFSVisitor = detail::graph::brandes_unweighted_shortest_paths::visitor_type >, property > >, iterator_property_map<__gnu_cxx::__normal_iterator, std::allocator > >*, std::vector, std::allocator > >, std::allocator, std::allocator > > > > >, vec_adj_list_vertex_id_map >, long unsigned int>, std::vector, std::allocator > >, std::vector, std::allocator > >&>, iterator_property_map<__gnu_cxx::__normal_iterator > >, vec_adj_list_vertex_id_map >, long unsigned int>, double, double&>, iterator_property_map<__gnu_cxx::__normal_iterator > >, vec_adj_list_vertex_id_map >, long unsigned int>, long unsigned int, long unsigned int&> >; ColorMap = iterator_property_map<__gnu_cxx::__normal_iterator >, vec_adj_list_vertex_id_map >, long unsigned int>, default_color_type, default_color_type&>; typename graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/betweenness_centrality.hpp:248:36: required from ‘void boost::detail::graph::brandes_unweighted_shortest_paths::operator()(Graph&, typename boost::graph_traits::vertex_descriptor, std::stack::vertex_descriptor>&, IncomingMap, DistanceMap, PathCountMap, VertexIndexMap) [with Graph = const boost::adjacency_list >, boost::property > >; IncomingMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator, std::allocator > >*, std::vector, std::allocator > >, std::allocator, std::allocator > > > > >, boost::vec_adj_list_vertex_id_map >, long unsigned int>, std::vector, std::allocator > >, std::vector, std::allocator > >&>; DistanceMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator > >, boost::vec_adj_list_vertex_id_map >, long unsigned int>, double, double&>; PathCountMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator > >, boost::vec_adj_list_vertex_id_map >, long unsigned int>, long unsigned int, long unsigned int&>; VertexIndexMap = boost::vec_adj_list_vertex_id_map >, long unsigned int>; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/betweenness_centrality.hpp:349:31: required from ‘void boost::detail::graph::brandes_betweenness_centrality_impl(const Graph&, CentralityMap, EdgeCentralityMap, IncomingMap, DistanceMap, DependencyMap, PathCountMap, VertexIndexMap, ShortestPaths) [with Graph = boost::adjacency_list >, boost::property > >; CentralityMap = boost::dummy_property_map; EdgeCentralityMap = boost::adj_list_edge_property_map >, boost::edge_centrality_t>; IncomingMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator, std::allocator > >*, std::vector, std::allocator > >, std::allocator, std::allocator > > > > >, boost::vec_adj_list_vertex_id_map >, long unsigned int>, std::vector, std::allocator > >, std::vector, std::allocator > >&>; DistanceMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator > >, boost::vec_adj_list_vertex_id_map >, long unsigned int>, double, double&>; DependencyMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator > >, boost::vec_adj_list_vertex_id_map >, long unsigned int>, double, double&>; PathCountMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator > >, boost::vec_adj_list_vertex_id_map >, long unsigned int>, long unsigned int, long unsigned int&>; VertexIndexMap = boost::vec_adj_list_vertex_id_map >, long unsigned int>; ShortestPaths = brandes_unweighted_shortest_paths]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/betweenness_centrality.hpp:412:55: required from ‘void boost::brandes_betweenness_centrality(const Graph&, CentralityMap, EdgeCentralityMap, IncomingMap, DistanceMap, DependencyMap, PathCountMap, VertexIndexMap, typename enable_if_c::traversal_category>::value, graph::detail::no_parameter>::type) [with Graph = adjacency_list >, property > >; CentralityMap = dummy_property_map; EdgeCentralityMap = adj_list_edge_property_map >, edge_centrality_t>; IncomingMap = iterator_property_map<__gnu_cxx::__normal_iterator, std::allocator > >*, std::vector, std::allocator > >, std::allocator, std::allocator > > > > >, vec_adj_list_vertex_id_map >, long unsigned int>, std::vector, std::allocator > >, std::vector, std::allocator > >&>; DistanceMap = iterator_property_map<__gnu_cxx::__normal_iterator > >, vec_adj_list_vertex_id_map >, long unsigned int>, double, double&>; DependencyMap = iterator_property_map<__gnu_cxx::__normal_iterator > >, vec_adj_list_vertex_id_map >, long unsigned int>, double, double&>; PathCountMap = iterator_property_map<__gnu_cxx::__normal_iterator > >, vec_adj_list_vertex_id_map >, long unsigned int>, long unsigned int, long unsigned int&>; VertexIndexMap = vec_adj_list_vertex_id_map >, long unsigned int>; typename enable_if_c::traversal_category>::value, graph::detail::no_parameter>::type = graph::detail::no_parameter; typename graph_traits::traversal_category = undir_adj_list_traversal_tag]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/betweenness_centrality.hpp:500:43: required from ‘void boost::detail::graph::brandes_betweenness_centrality_dispatch2(const Graph&, CentralityMap, EdgeCentralityMap, VertexIndexMap) [with Graph = boost::adjacency_list >, boost::property > >; CentralityMap = boost::dummy_property_map; EdgeCentralityMap = boost::adj_list_edge_property_map >, boost::edge_centrality_t>; VertexIndexMap = boost::vec_adj_list_vertex_id_map >, long unsigned int>]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/betweenness_centrality.hpp:531:57: required from ‘static void boost::detail::graph::brandes_betweenness_centrality_dispatch1::run(const Graph&, CentralityMap, EdgeCentralityMap, VertexIndexMap, boost::param_not_found) [with Graph = boost::adjacency_list >, boost::property > >; CentralityMap = boost::dummy_property_map; EdgeCentralityMap = boost::adj_list_edge_property_map >, boost::edge_centrality_t>; VertexIndexMap = boost::vec_adj_list_vertex_id_map >, long unsigned int>]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/betweenness_centrality.hpp:558:71: required from ‘void boost::brandes_betweenness_centrality(const Graph&, const bgl_named_params&, typename enable_if_c::traversal_category>::value, graph::detail::no_parameter>::type) [with Graph = adjacency_list >, property > >; Param = vec_adj_list_vertex_id_map >, long unsigned int>; Tag = vertex_index_t; Rest = bgl_named_params >, edge_centrality_t>, edge_centrality_t, no_property>; typename enable_if_c::traversal_category>::value, graph::detail::no_parameter>::type = graph::detail::no_parameter; typename graph_traits::traversal_category = undir_adj_list_traversal_tag]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/bc_clustering.hpp:131:39: required from ‘void boost::betweenness_centrality_clustering(MutableGraph&, Done, EdgeCentralityMap, VertexIndexMap) [with MutableGraph = adjacency_list >, property > >; Done = clustering_threshold; EdgeCentralityMap = adj_list_edge_property_map >, edge_centrality_t>; VertexIndexMap = vec_adj_list_vertex_id_map >, long unsigned int>]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/bc_clustering.hpp:150:38: required from ‘void boost::betweenness_centrality_clustering(MutableGraph&, Done, EdgeCentralityMap) [with MutableGraph = adjacency_list >, property > >; Done = clustering_threshold; EdgeCentralityMap = adj_list_edge_property_map >, edge_centrality_t>]’ bbc.cpp:149:36: required from here /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:65:52: warning: ‘this’ pointer is null [-Wnonnull] 65 | static void failed() { ((Model*)0)->constraints(); } | ~~~~~~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/property_map/property_map.hpp:205:10: note: in a call to non-static member function ‘void boost::ReadWritePropertyMapConcept::constraints() [with PMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map >, long unsigned int>, boost::default_color_type, boost::default_color_type&>; Key = long unsigned int]’ 205 | void constraints() { | ^~~~~~~~~~~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::concepts::Graph >, boost::property > > >]’: /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements >, boost::property > > > >]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/graph_concepts.hpp:66:5: required from ‘struct boost::concepts::Graph >, boost::property > > >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/graph_concepts.hpp:75:1: required from ‘struct boost::concepts::IncidenceGraph >, boost::property > > >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/graph_concepts.hpp:75:1: required from ‘struct boost::concepts::IncidenceGraphConcept >, boost::property > > >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::concepts::IncidenceGraphConcept >, boost::property > > >]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:42:5: [ skipping 8 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/betweenness_centrality.hpp:500:43: required from ‘void boost::detail::graph::brandes_betweenness_centrality_dispatch2(const Graph&, CentralityMap, EdgeCentralityMap, VertexIndexMap) [with Graph = boost::adjacency_list >, boost::property > >; CentralityMap = boost::dummy_property_map; EdgeCentralityMap = boost::adj_list_edge_property_map >, boost::edge_centrality_t>; VertexIndexMap = boost::vec_adj_list_vertex_id_map >, long unsigned int>]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/betweenness_centrality.hpp:531:57: required from ‘static void boost::detail::graph::brandes_betweenness_centrality_dispatch1::run(const Graph&, CentralityMap, EdgeCentralityMap, VertexIndexMap, boost::param_not_found) [with Graph = boost::adjacency_list >, boost::property > >; CentralityMap = boost::dummy_property_map; EdgeCentralityMap = boost::adj_list_edge_property_map >, boost::edge_centrality_t>; VertexIndexMap = boost::vec_adj_list_vertex_id_map >, long unsigned int>]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/betweenness_centrality.hpp:558:71: required from ‘void boost::brandes_betweenness_centrality(const Graph&, const bgl_named_params&, typename enable_if_c::traversal_category>::value, graph::detail::no_parameter>::type) [with Graph = adjacency_list >, property > >; Param = vec_adj_list_vertex_id_map >, long unsigned int>; Tag = vertex_index_t; Rest = bgl_named_params >, edge_centrality_t>, edge_centrality_t, no_property>; typename enable_if_c::traversal_category>::value, graph::detail::no_parameter>::type = graph::detail::no_parameter; typename graph_traits::traversal_category = undir_adj_list_traversal_tag]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/bc_clustering.hpp:131:39: required from ‘void boost::betweenness_centrality_clustering(MutableGraph&, Done, EdgeCentralityMap, VertexIndexMap) [with MutableGraph = adjacency_list >, property > >; Done = clustering_threshold; EdgeCentralityMap = adj_list_edge_property_map >, edge_centrality_t>; VertexIndexMap = vec_adj_list_vertex_id_map >, long unsigned int>]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/bc_clustering.hpp:150:38: required from ‘void boost::betweenness_centrality_clustering(MutableGraph&, Done, EdgeCentralityMap) [with MutableGraph = adjacency_list >, property > >; Done = clustering_threshold; EdgeCentralityMap = adj_list_edge_property_map >, edge_centrality_t>]’ bbc.cpp:149:36: required from here /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::concepts::Graph::~Graph() [with G = boost::adjacency_list >, boost::property > >]’ 37 | ~model() | ^ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/graph_concepts.hpp:66:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 66 | BOOST_CONCEPT_USAGE(Graph) | ^~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::concepts::IncidenceGraph >, boost::property > > >]’: /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements >, boost::property > > > >]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/graph_concepts.hpp:87:5: required from ‘struct boost::concepts::IncidenceGraph >, boost::property > > >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/graph_concepts.hpp:75:1: required from ‘struct boost::concepts::IncidenceGraphConcept >, boost::property > > >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::concepts::IncidenceGraphConcept >, boost::property > > >]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied >, boost::property > > > >::value’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:45:51: [ skipping 7 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/betweenness_centrality.hpp:500:43: required from ‘void boost::detail::graph::brandes_betweenness_centrality_dispatch2(const Graph&, CentralityMap, EdgeCentralityMap, VertexIndexMap) [with Graph = boost::adjacency_list >, boost::property > >; CentralityMap = boost::dummy_property_map; EdgeCentralityMap = boost::adj_list_edge_property_map >, boost::edge_centrality_t>; VertexIndexMap = boost::vec_adj_list_vertex_id_map >, long unsigned int>]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/betweenness_centrality.hpp:531:57: required from ‘static void boost::detail::graph::brandes_betweenness_centrality_dispatch1::run(const Graph&, CentralityMap, EdgeCentralityMap, VertexIndexMap, boost::param_not_found) [with Graph = boost::adjacency_list >, boost::property > >; CentralityMap = boost::dummy_property_map; EdgeCentralityMap = boost::adj_list_edge_property_map >, boost::edge_centrality_t>; VertexIndexMap = boost::vec_adj_list_vertex_id_map >, long unsigned int>]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/betweenness_centrality.hpp:558:71: required from ‘void boost::brandes_betweenness_centrality(const Graph&, const bgl_named_params&, typename enable_if_c::traversal_category>::value, graph::detail::no_parameter>::type) [with Graph = adjacency_list >, property > >; Param = vec_adj_list_vertex_id_map >, long unsigned int>; Tag = vertex_index_t; Rest = bgl_named_params >, edge_centrality_t>, edge_centrality_t, no_property>; typename enable_if_c::traversal_category>::value, graph::detail::no_parameter>::type = graph::detail::no_parameter; typename graph_traits::traversal_category = undir_adj_list_traversal_tag]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/bc_clustering.hpp:131:39: required from ‘void boost::betweenness_centrality_clustering(MutableGraph&, Done, EdgeCentralityMap, VertexIndexMap) [with MutableGraph = adjacency_list >, property > >; Done = clustering_threshold; EdgeCentralityMap = adj_list_edge_property_map >, edge_centrality_t>; VertexIndexMap = vec_adj_list_vertex_id_map >, long unsigned int>]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/bc_clustering.hpp:150:38: required from ‘void boost::betweenness_centrality_clustering(MutableGraph&, Done, EdgeCentralityMap) [with MutableGraph = adjacency_list >, property > >; Done = clustering_threshold; EdgeCentralityMap = adj_list_edge_property_map >, edge_centrality_t>]’ bbc.cpp:149:36: required from here /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::concepts::IncidenceGraph::~IncidenceGraph() [with G = boost::adjacency_list >, boost::property > >]’ 37 | ~model() | ^ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/graph_concepts.hpp:87:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 87 | BOOST_CONCEPT_USAGE(IncidenceGraph) | ^~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements >, boost::property > >, boost::iterator_property_map<__gnu_cxx::__normal_iterator, std::allocator > >*, std::vector, std::allocator > >, std::allocator, std::allocator > > > > >, boost::vec_adj_list_vertex_id_map >, long unsigned int>, std::vector, std::allocator > >, std::vector, std::allocator > >&>, boost::iterator_property_map<__gnu_cxx::__normal_iterator > >, boost::vec_adj_list_vertex_id_map >, long unsigned int>, double, double&>, boost::iterator_property_map<__gnu_cxx::__normal_iterator > >, boost::vec_adj_list_vertex_id_map >, long unsigned int>, long unsigned int, long unsigned int&> > > >]’: /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:167:5: required from ‘struct boost::CopyConstructible >, boost::property > >, boost::iterator_property_map<__gnu_cxx::__normal_iterator, std::allocator > >*, std::vector, std::allocator > >, std::allocator, std::allocator > > > > >, boost::vec_adj_list_vertex_id_map >, long unsigned int>, std::vector, std::allocator > >, std::vector, std::allocator > >&>, boost::iterator_property_map<__gnu_cxx::__normal_iterator > >, boost::vec_adj_list_vertex_id_map >, long unsigned int>, double, double&>, boost::iterator_property_map<__gnu_cxx::__normal_iterator > >, boost::vec_adj_list_vertex_id_map >, long unsigned int>, long unsigned int, long unsigned int&> > >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:165:3: required from ‘struct boost::CopyConstructibleConcept >, boost::property > >, boost::iterator_property_map<__gnu_cxx::__normal_iterator, std::allocator > >*, std::vector, std::allocator > >, std::allocator, std::allocator > > > > >, boost::vec_adj_list_vertex_id_map >, long unsigned int>, std::vector, std::allocator > >, std::vector, std::allocator > >&>, boost::iterator_property_map<__gnu_cxx::__normal_iterator > >, boost::vec_adj_list_vertex_id_map >, long unsigned int>, double, double&>, boost::iterator_property_map<__gnu_cxx::__normal_iterator > >, boost::vec_adj_list_vertex_id_map >, long unsigned int>, long unsigned int, long unsigned int&> > >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::CopyConstructibleConcept >, boost::property > >, boost::iterator_property_map<__gnu_cxx::__normal_iterator, std::allocator > >*, std::vector, std::allocator > >, std::allocator, std::allocator > > > > >, boost::vec_adj_list_vertex_id_map >, long unsigned int>, std::vector, std::allocator > >, std::vector, std::allocator > >&>, boost::iterator_property_map<__gnu_cxx::__normal_iterator > >, boost::vec_adj_list_vertex_id_map >, long unsigned int>, double, double&>, boost::iterator_property_map<__gnu_cxx::__normal_iterator > >, boost::vec_adj_list_vertex_id_map >, long unsigned int>, long unsigned int, long unsigned int&> > >]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied >, boost::property > >, boost::iterator_property_map<__gnu_cxx::__normal_iterator, std::allocator > >*, std::vector, std::allocator > >, std::allocator, std::allocator > > > > >, boost::vec_adj_list_vertex_id_map >, long unsigned int>, std::vector, std::allocator > >, std::vector, std::allocator > >&>, boost::iterator_property_map<__gnu_cxx::__normal_iterator > >, boost::vec_adj_list_vertex_id_map >, long unsigned int>, double, double&>, boost::iterator_property_map<__gnu_cxx::__normal_iterator > >, boost::vec_adj_list_vertex_id_map >, long unsigned int>, long unsigned int, long unsigned int&> > > >::value’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied >, boost::property > >, boost::iterator_property_map<__gnu_cxx::__normal_iterator, std::allocator > >*, std::vector, std::allocator > >, std::allocator, std::allocator > > > > >, boost::vec_adj_list_vertex_id_map >, long unsigned int>, std::vector, std::allocator > >, std::vector, std::allocator > >&>, boost::iterator_property_map<__gnu_cxx::__normal_iterator > >, boost::vec_adj_list_vertex_id_map >, long unsigned int>, double, double&>, boost::iterator_property_map<__gnu_cxx::__normal_iterator > >, boost::vec_adj_list_vertex_id_map >, long unsigned int>, long unsigned int, long unsigned int&> > > >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:72:8: [ skipping 11 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/betweenness_centrality.hpp:500:43: required from ‘void boost::detail::graph::brandes_betweenness_centrality_dispatch2(const Graph&, CentralityMap, EdgeCentralityMap, VertexIndexMap) [with Graph = boost::adjacency_list >, boost::property > >; CentralityMap = boost::dummy_property_map; EdgeCentralityMap = boost::adj_list_edge_property_map >, boost::edge_centrality_t>; VertexIndexMap = boost::vec_adj_list_vertex_id_map >, long unsigned int>]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/betweenness_centrality.hpp:531:57: required from ‘static void boost::detail::graph::brandes_betweenness_centrality_dispatch1::run(const Graph&, CentralityMap, EdgeCentralityMap, VertexIndexMap, boost::param_not_found) [with Graph = boost::adjacency_list >, boost::property > >; CentralityMap = boost::dummy_property_map; EdgeCentralityMap = boost::adj_list_edge_property_map >, boost::edge_centrality_t>; VertexIndexMap = boost::vec_adj_list_vertex_id_map >, long unsigned int>]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/betweenness_centrality.hpp:558:71: required from ‘void boost::brandes_betweenness_centrality(const Graph&, const bgl_named_params&, typename enable_if_c::traversal_category>::value, graph::detail::no_parameter>::type) [with Graph = adjacency_list >, property > >; Param = vec_adj_list_vertex_id_map >, long unsigned int>; Tag = vertex_index_t; Rest = bgl_named_params >, edge_centrality_t>, edge_centrality_t, no_property>; typename enable_if_c::traversal_category>::value, graph::detail::no_parameter>::type = graph::detail::no_parameter; typename graph_traits::traversal_category = undir_adj_list_traversal_tag]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/bc_clustering.hpp:131:39: required from ‘void boost::betweenness_centrality_clustering(MutableGraph&, Done, EdgeCentralityMap, VertexIndexMap) [with MutableGraph = adjacency_list >, property > >; Done = clustering_threshold; EdgeCentralityMap = adj_list_edge_property_map >, edge_centrality_t>; VertexIndexMap = vec_adj_list_vertex_id_map >, long unsigned int>]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/bc_clustering.hpp:150:38: required from ‘void boost::betweenness_centrality_clustering(MutableGraph&, Done, EdgeCentralityMap) [with MutableGraph = adjacency_list >, property > >; Done = clustering_threshold; EdgeCentralityMap = adj_list_edge_property_map >, edge_centrality_t>]’ bbc.cpp:149:36: required from here /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::CopyConstructible >, boost::property > >, boost::iterator_property_map<__gnu_cxx::__normal_iterator, std::allocator > >*, std::vector, std::allocator > >, std::allocator, std::allocator > > > > >, boost::vec_adj_list_vertex_id_map >, long unsigned int>, std::vector, std::allocator > >, std::vector, std::allocator > >&>, boost::iterator_property_map<__gnu_cxx::__normal_iterator > >, boost::vec_adj_list_vertex_id_map >, long unsigned int>, double, double&>, boost::iterator_property_map<__gnu_cxx::__normal_iterator > >, boost::vec_adj_list_vertex_id_map >, long unsigned int>, long unsigned int, long unsigned int&> > >]’ 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ^ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::CopyConstructibleConcept >, boost::property > >, boost::iterator_property_map<__gnu_cxx::__normal_iterator, std::allocator > >*, std::vector, std::allocator > >, std::allocator, std::allocator > > > > >, boost::vec_adj_list_vertex_id_map >, long unsigned int>, std::vector, std::allocator > >, std::vector, std::allocator > >&>, boost::iterator_property_map<__gnu_cxx::__normal_iterator > >, boost::vec_adj_list_vertex_id_map >, long unsigned int>, double, double&>, boost::iterator_property_map<__gnu_cxx::__normal_iterator > >, boost::vec_adj_list_vertex_id_map >, long unsigned int>, long unsigned int, long unsigned int&> > >]’: /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/depth_first_search.hpp:41:9: required from ‘void boost::BFSVisitorConcept::constraints() [with Visitor = boost::detail::graph::brandes_unweighted_shortest_paths::visitor_type >, boost::property > >, boost::iterator_property_map<__gnu_cxx::__normal_iterator, std::allocator > >*, std::vector, std::allocator > >, std::allocator, std::allocator > > > > >, boost::vec_adj_list_vertex_id_map >, long unsigned int>, std::vector, std::allocator > >, std::vector, std::allocator > >&>, boost::iterator_property_map<__gnu_cxx::__normal_iterator > >, boost::vec_adj_list_vertex_id_map >, long unsigned int>, double, double&>, boost::iterator_property_map<__gnu_cxx::__normal_iterator > >, boost::vec_adj_list_vertex_id_map >, long unsigned int>, long unsigned int, long unsigned int&> >; Graph = boost::adjacency_list >, boost::property > >]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::BFSVisitorConcept >, boost::property > >, boost::iterator_property_map<__gnu_cxx::__normal_iterator, std::allocator > >*, std::vector, std::allocator > >, std::allocator, std::allocator > > > > >, boost::vec_adj_list_vertex_id_map >, long unsigned int>, std::vector, std::allocator > >, std::vector, std::allocator > >&>, boost::iterator_property_map<__gnu_cxx::__normal_iterator > >, boost::vec_adj_list_vertex_id_map >, long unsigned int>, double, double&>, boost::iterator_property_map<__gnu_cxx::__normal_iterator > >, boost::vec_adj_list_vertex_id_map >, long unsigned int>, long unsigned int, long unsigned int&> >, boost::adjacency_list >, boost::property > > >]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied >, boost::property > >, boost::iterator_property_map<__gnu_cxx::__normal_iterator, std::allocator > >*, std::vector, std::allocator > >, std::allocator, std::allocator > > > > >, boost::vec_adj_list_vertex_id_map >, long unsigned int>, std::vector, std::allocator > >, std::vector, std::allocator > >&>, boost::iterator_property_map<__gnu_cxx::__normal_iterator > >, boost::vec_adj_list_vertex_id_map >, long unsigned int>, double, double&>, boost::iterator_property_map<__gnu_cxx::__normal_iterator > >, boost::vec_adj_list_vertex_id_map >, long unsigned int>, long unsigned int, long unsigned int&> >, boost::adjacency_list >, boost::property > > > >::value’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied >, boost::property > >, boost::iterator_property_map<__gnu_cxx::__normal_iterator, std::allocator > >*, std::vector, std::allocator > >, std::allocator, std::allocator > > > > >, boost::vec_adj_list_vertex_id_map >, long unsigned int>, std::vector, std::allocator > >, std::vector, std::allocator > >&>, boost::iterator_property_map<__gnu_cxx::__normal_iterator > >, boost::vec_adj_list_vertex_id_map >, long unsigned int>, double, double&>, boost::iterator_property_map<__gnu_cxx::__normal_iterator > >, boost::vec_adj_list_vertex_id_map >, long unsigned int>, long unsigned int, long unsigned int&> >, boost::adjacency_list >, boost::property > > > >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_ >, boost::property > >, boost::iterator_property_map<__gnu_cxx::__normal_iterator, std::allocator > >*, std::vector, std::allocator > >, std::allocator, std::allocator > > > > >, boost::vec_adj_list_vertex_id_map >, long unsigned int>, std::vector, std::allocator > >, std::vector, std::allocator > >&>, boost::iterator_property_map<__gnu_cxx::__normal_iterator > >, boost::vec_adj_list_vertex_id_map >, long unsigned int>, double, double&>, boost::iterator_property_map<__gnu_cxx::__normal_iterator > >, boost::vec_adj_list_vertex_id_map >, long unsigned int>, long unsigned int, long unsigned int&> >, boost::adjacency_list >, boost::property > > >)>’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/breadth_first_search.hpp:65:5: [ skipping 5 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/betweenness_centrality.hpp:500:43: required from ‘void boost::detail::graph::brandes_betweenness_centrality_dispatch2(const Graph&, CentralityMap, EdgeCentralityMap, VertexIndexMap) [with Graph = boost::adjacency_list >, boost::property > >; CentralityMap = boost::dummy_property_map; EdgeCentralityMap = boost::adj_list_edge_property_map >, boost::edge_centrality_t>; VertexIndexMap = boost::vec_adj_list_vertex_id_map >, long unsigned int>]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/betweenness_centrality.hpp:531:57: required from ‘static void boost::detail::graph::brandes_betweenness_centrality_dispatch1::run(const Graph&, CentralityMap, EdgeCentralityMap, VertexIndexMap, boost::param_not_found) [with Graph = boost::adjacency_list >, boost::property > >; CentralityMap = boost::dummy_property_map; EdgeCentralityMap = boost::adj_list_edge_property_map >, boost::edge_centrality_t>; VertexIndexMap = boost::vec_adj_list_vertex_id_map >, long unsigned int>]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/betweenness_centrality.hpp:558:71: required from ‘void boost::brandes_betweenness_centrality(const Graph&, const bgl_named_params&, typename enable_if_c::traversal_category>::value, graph::detail::no_parameter>::type) [with Graph = adjacency_list >, property > >; Param = vec_adj_list_vertex_id_map >, long unsigned int>; Tag = vertex_index_t; Rest = bgl_named_params >, edge_centrality_t>, edge_centrality_t, no_property>; typename enable_if_c::traversal_category>::value, graph::detail::no_parameter>::type = graph::detail::no_parameter; typename graph_traits::traversal_category = undir_adj_list_traversal_tag]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/bc_clustering.hpp:131:39: required from ‘void boost::betweenness_centrality_clustering(MutableGraph&, Done, EdgeCentralityMap, VertexIndexMap) [with MutableGraph = adjacency_list >, property > >; Done = clustering_threshold; EdgeCentralityMap = adj_list_edge_property_map >, edge_centrality_t>; VertexIndexMap = vec_adj_list_vertex_id_map >, long unsigned int>]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/bc_clustering.hpp:150:38: required from ‘void boost::betweenness_centrality_clustering(MutableGraph&, Done, EdgeCentralityMap) [with MutableGraph = adjacency_list >, property > >; Done = clustering_threshold; EdgeCentralityMap = adj_list_edge_property_map >, edge_centrality_t>]’ bbc.cpp:149:36: required from here /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:165:17: note: in a call to non-static member function ‘boost::CopyConstructibleConcept >, boost::property > >, boost::iterator_property_map<__gnu_cxx::__normal_iterator, std::allocator > >*, std::vector, std::allocator > >, std::allocator, std::allocator > > > > >, boost::vec_adj_list_vertex_id_map >, long unsigned int>, std::vector, std::allocator > >, std::vector, std::allocator > >&>, boost::iterator_property_map<__gnu_cxx::__normal_iterator > >, boost::vec_adj_list_vertex_id_map >, long unsigned int>, double, double&>, boost::iterator_property_map<__gnu_cxx::__normal_iterator > >, boost::vec_adj_list_vertex_id_map >, long unsigned int>, long unsigned int, long unsigned int&> > >::~CopyConstructibleConcept()’ 165 | BOOST_concept(CopyConstructible,(TT)) | ^~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/preprocessor/cat.hpp:29:34: note: in definition of macro ‘BOOST_PP_CAT_I’ 29 | # define BOOST_PP_CAT_I(a, b) a ## b | ^ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/concept_def.hpp:23:12: note: in expansion of macro ‘BOOST_PP_CAT’ 23 | struct BOOST_PP_CAT(name,Concept) \ | ^~~~~~~~~~~~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:165:3: note: in expansion of macro ‘BOOST_concept’ 165 | BOOST_concept(CopyConstructible,(TT)) | ^~~~~~~~~~~~~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::constraint::failed() [with Model = boost::ReadablePropertyMapConcept >, boost::vec_adj_list_vertex_id_map >, long unsigned int>, boost::default_color_type, boost::default_color_type&>, long unsigned int>]’: /home/omnipath/local/R/4.4-3.20/BH/include/boost/property_map/property_map.hpp:206:7: required from ‘void boost::ReadWritePropertyMapConcept::constraints() [with PMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map >, long unsigned int>, boost::default_color_type, boost::default_color_type&>; Key = long unsigned int]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::ReadWritePropertyMapConcept >, boost::vec_adj_list_vertex_id_map >, long unsigned int>, boost::default_color_type, boost::default_color_type&>, long unsigned int>]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied >, boost::vec_adj_list_vertex_id_map >, long unsigned int>, boost::default_color_type, boost::default_color_type&>, long unsigned int> >::value’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied >, boost::vec_adj_list_vertex_id_map >, long unsigned int>, boost::default_color_type, boost::default_color_type&>, long unsigned int> >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_ >, boost::vec_adj_list_vertex_id_map >, long unsigned int>, boost::default_color_type, boost::default_color_type&>, long unsigned int>)>’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/breadth_first_search.hpp:66:5: [ skipping 5 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/betweenness_centrality.hpp:500:43: required from ‘void boost::detail::graph::brandes_betweenness_centrality_dispatch2(const Graph&, CentralityMap, EdgeCentralityMap, VertexIndexMap) [with Graph = boost::adjacency_list >, boost::property > >; CentralityMap = boost::dummy_property_map; EdgeCentralityMap = boost::adj_list_edge_property_map >, boost::edge_centrality_t>; VertexIndexMap = boost::vec_adj_list_vertex_id_map >, long unsigned int>]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/betweenness_centrality.hpp:531:57: required from ‘static void boost::detail::graph::brandes_betweenness_centrality_dispatch1::run(const Graph&, CentralityMap, EdgeCentralityMap, VertexIndexMap, boost::param_not_found) [with Graph = boost::adjacency_list >, boost::property > >; CentralityMap = boost::dummy_property_map; EdgeCentralityMap = boost::adj_list_edge_property_map >, boost::edge_centrality_t>; VertexIndexMap = boost::vec_adj_list_vertex_id_map >, long unsigned int>]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/betweenness_centrality.hpp:558:71: required from ‘void boost::brandes_betweenness_centrality(const Graph&, const bgl_named_params&, typename enable_if_c::traversal_category>::value, graph::detail::no_parameter>::type) [with Graph = adjacency_list >, property > >; Param = vec_adj_list_vertex_id_map >, long unsigned int>; Tag = vertex_index_t; Rest = bgl_named_params >, edge_centrality_t>, edge_centrality_t, no_property>; typename enable_if_c::traversal_category>::value, graph::detail::no_parameter>::type = graph::detail::no_parameter; typename graph_traits::traversal_category = undir_adj_list_traversal_tag]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/bc_clustering.hpp:131:39: required from ‘void boost::betweenness_centrality_clustering(MutableGraph&, Done, EdgeCentralityMap, VertexIndexMap) [with MutableGraph = adjacency_list >, property > >; Done = clustering_threshold; EdgeCentralityMap = adj_list_edge_property_map >, edge_centrality_t>; VertexIndexMap = vec_adj_list_vertex_id_map >, long unsigned int>]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/bc_clustering.hpp:150:38: required from ‘void boost::betweenness_centrality_clustering(MutableGraph&, Done, EdgeCentralityMap) [with MutableGraph = adjacency_list >, property > >; Done = clustering_threshold; EdgeCentralityMap = adj_list_edge_property_map >, edge_centrality_t>]’ bbc.cpp:149:36: required from here /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:65:52: warning: ‘this’ pointer is null [-Wnonnull] 65 | static void failed() { ((Model*)0)->constraints(); } | ~~~~~~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/property_map/property_map.hpp:147:10: note: in a call to non-static member function ‘void boost::ReadablePropertyMapConcept::constraints() [with PMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map >, long unsigned int>, boost::default_color_type, boost::default_color_type&>; Key = long unsigned int]’ 147 | void constraints() { | ^~~~~~~~~~~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::constraint::failed() [with Model = boost::WritablePropertyMapConcept >, boost::vec_adj_list_vertex_id_map >, long unsigned int>, boost::default_color_type, boost::default_color_type&>, long unsigned int>]’: /home/omnipath/local/R/4.4-3.20/BH/include/boost/property_map/property_map.hpp:207:7: required from ‘void boost::ReadWritePropertyMapConcept::constraints() [with PMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map >, long unsigned int>, boost::default_color_type, boost::default_color_type&>; Key = long unsigned int]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::ReadWritePropertyMapConcept >, boost::vec_adj_list_vertex_id_map >, long unsigned int>, boost::default_color_type, boost::default_color_type&>, long unsigned int>]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied >, boost::vec_adj_list_vertex_id_map >, long unsigned int>, boost::default_color_type, boost::default_color_type&>, long unsigned int> >::value’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied >, boost::vec_adj_list_vertex_id_map >, long unsigned int>, boost::default_color_type, boost::default_color_type&>, long unsigned int> >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_ >, boost::vec_adj_list_vertex_id_map >, long unsigned int>, boost::default_color_type, boost::default_color_type&>, long unsigned int>)>’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/breadth_first_search.hpp:66:5: [ skipping 5 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/betweenness_centrality.hpp:500:43: required from ‘void boost::detail::graph::brandes_betweenness_centrality_dispatch2(const Graph&, CentralityMap, EdgeCentralityMap, VertexIndexMap) [with Graph = boost::adjacency_list >, boost::property > >; CentralityMap = boost::dummy_property_map; EdgeCentralityMap = boost::adj_list_edge_property_map >, boost::edge_centrality_t>; VertexIndexMap = boost::vec_adj_list_vertex_id_map >, long unsigned int>]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/betweenness_centrality.hpp:531:57: required from ‘static void boost::detail::graph::brandes_betweenness_centrality_dispatch1::run(const Graph&, CentralityMap, EdgeCentralityMap, VertexIndexMap, boost::param_not_found) [with Graph = boost::adjacency_list >, boost::property > >; CentralityMap = boost::dummy_property_map; EdgeCentralityMap = boost::adj_list_edge_property_map >, boost::edge_centrality_t>; VertexIndexMap = boost::vec_adj_list_vertex_id_map >, long unsigned int>]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/betweenness_centrality.hpp:558:71: required from ‘void boost::brandes_betweenness_centrality(const Graph&, const bgl_named_params&, typename enable_if_c::traversal_category>::value, graph::detail::no_parameter>::type) [with Graph = adjacency_list >, property > >; Param = vec_adj_list_vertex_id_map >, long unsigned int>; Tag = vertex_index_t; Rest = bgl_named_params >, edge_centrality_t>, edge_centrality_t, no_property>; typename enable_if_c::traversal_category>::value, graph::detail::no_parameter>::type = graph::detail::no_parameter; typename graph_traits::traversal_category = undir_adj_list_traversal_tag]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/bc_clustering.hpp:131:39: required from ‘void boost::betweenness_centrality_clustering(MutableGraph&, Done, EdgeCentralityMap, VertexIndexMap) [with MutableGraph = adjacency_list >, property > >; Done = clustering_threshold; EdgeCentralityMap = adj_list_edge_property_map >, edge_centrality_t>; VertexIndexMap = vec_adj_list_vertex_id_map >, long unsigned int>]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/bc_clustering.hpp:150:38: required from ‘void boost::betweenness_centrality_clustering(MutableGraph&, Done, EdgeCentralityMap) [with MutableGraph = adjacency_list >, property > >; Done = clustering_threshold; EdgeCentralityMap = adj_list_edge_property_map >, edge_centrality_t>]’ bbc.cpp:149:36: required from here /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:65:52: warning: ‘this’ pointer is null [-Wnonnull] 65 | static void failed() { ((Model*)0)->constraints(); } | ~~~~~~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/property_map/property_map.hpp:179:10: note: in a call to non-static member function ‘void boost::WritablePropertyMapConcept::constraints() [with PMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map >, long unsigned int>, boost::default_color_type, boost::default_color_type&>; Key = long unsigned int]’ 179 | void constraints() { | ^~~~~~~~~~~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements >]’: /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:208:5: required from ‘struct boost::Convertible’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:206:3: required from ‘struct boost::ConvertibleConcept’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::ConvertibleConcept]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied >::value’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:72:8: [ skipping 11 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/betweenness_centrality.hpp:500:43: required from ‘void boost::detail::graph::brandes_betweenness_centrality_dispatch2(const Graph&, CentralityMap, EdgeCentralityMap, VertexIndexMap) [with Graph = boost::adjacency_list >, boost::property > >; CentralityMap = boost::dummy_property_map; EdgeCentralityMap = boost::adj_list_edge_property_map >, boost::edge_centrality_t>; VertexIndexMap = boost::vec_adj_list_vertex_id_map >, long unsigned int>]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/betweenness_centrality.hpp:531:57: required from ‘static void boost::detail::graph::brandes_betweenness_centrality_dispatch1::run(const Graph&, CentralityMap, EdgeCentralityMap, VertexIndexMap, boost::param_not_found) [with Graph = boost::adjacency_list >, boost::property > >; CentralityMap = boost::dummy_property_map; EdgeCentralityMap = boost::adj_list_edge_property_map >, boost::edge_centrality_t>; VertexIndexMap = boost::vec_adj_list_vertex_id_map >, long unsigned int>]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/betweenness_centrality.hpp:558:71: required from ‘void boost::brandes_betweenness_centrality(const Graph&, const bgl_named_params&, typename enable_if_c::traversal_category>::value, graph::detail::no_parameter>::type) [with Graph = adjacency_list >, property > >; Param = vec_adj_list_vertex_id_map >, long unsigned int>; Tag = vertex_index_t; Rest = bgl_named_params >, edge_centrality_t>, edge_centrality_t, no_property>; typename enable_if_c::traversal_category>::value, graph::detail::no_parameter>::type = graph::detail::no_parameter; typename graph_traits::traversal_category = undir_adj_list_traversal_tag]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/bc_clustering.hpp:131:39: required from ‘void boost::betweenness_centrality_clustering(MutableGraph&, Done, EdgeCentralityMap, VertexIndexMap) [with MutableGraph = adjacency_list >, property > >; Done = clustering_threshold; EdgeCentralityMap = adj_list_edge_property_map >, edge_centrality_t>; VertexIndexMap = vec_adj_list_vertex_id_map >, long unsigned int>]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/bc_clustering.hpp:150:38: required from ‘void boost::betweenness_centrality_clustering(MutableGraph&, Done, EdgeCentralityMap) [with MutableGraph = adjacency_list >, property > >; Done = clustering_threshold; EdgeCentralityMap = adj_list_edge_property_map >, edge_centrality_t>]’ bbc.cpp:149:36: required from here /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::Convertible]’ 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ^ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::ConvertibleConcept]’: /home/omnipath/local/R/4.4-3.20/BH/include/boost/property_map/property_map.hpp:208:7: required from ‘void boost::ReadWritePropertyMapConcept::constraints() [with PMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map >, long unsigned int>, boost::default_color_type, boost::default_color_type&>; Key = long unsigned int]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::ReadWritePropertyMapConcept >, boost::vec_adj_list_vertex_id_map >, long unsigned int>, boost::default_color_type, boost::default_color_type&>, long unsigned int>]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied >, boost::vec_adj_list_vertex_id_map >, long unsigned int>, boost::default_color_type, boost::default_color_type&>, long unsigned int> >::value’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied >, boost::vec_adj_list_vertex_id_map >, long unsigned int>, boost::default_color_type, boost::default_color_type&>, long unsigned int> >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_ >, boost::vec_adj_list_vertex_id_map >, long unsigned int>, boost::default_color_type, boost::default_color_type&>, long unsigned int>)>’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/breadth_first_search.hpp:66:5: [ skipping 5 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/betweenness_centrality.hpp:500:43: required from ‘void boost::detail::graph::brandes_betweenness_centrality_dispatch2(const Graph&, CentralityMap, EdgeCentralityMap, VertexIndexMap) [with Graph = boost::adjacency_list >, boost::property > >; CentralityMap = boost::dummy_property_map; EdgeCentralityMap = boost::adj_list_edge_property_map >, boost::edge_centrality_t>; VertexIndexMap = boost::vec_adj_list_vertex_id_map >, long unsigned int>]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/betweenness_centrality.hpp:531:57: required from ‘static void boost::detail::graph::brandes_betweenness_centrality_dispatch1::run(const Graph&, CentralityMap, EdgeCentralityMap, VertexIndexMap, boost::param_not_found) [with Graph = boost::adjacency_list >, boost::property > >; CentralityMap = boost::dummy_property_map; EdgeCentralityMap = boost::adj_list_edge_property_map >, boost::edge_centrality_t>; VertexIndexMap = boost::vec_adj_list_vertex_id_map >, long unsigned int>]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/betweenness_centrality.hpp:558:71: required from ‘void boost::brandes_betweenness_centrality(const Graph&, const bgl_named_params&, typename enable_if_c::traversal_category>::value, graph::detail::no_parameter>::type) [with Graph = adjacency_list >, property > >; Param = vec_adj_list_vertex_id_map >, long unsigned int>; Tag = vertex_index_t; Rest = bgl_named_params >, edge_centrality_t>, edge_centrality_t, no_property>; typename enable_if_c::traversal_category>::value, graph::detail::no_parameter>::type = graph::detail::no_parameter; typename graph_traits::traversal_category = undir_adj_list_traversal_tag]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/bc_clustering.hpp:131:39: required from ‘void boost::betweenness_centrality_clustering(MutableGraph&, Done, EdgeCentralityMap, VertexIndexMap) [with MutableGraph = adjacency_list >, property > >; Done = clustering_threshold; EdgeCentralityMap = adj_list_edge_property_map >, edge_centrality_t>; VertexIndexMap = vec_adj_list_vertex_id_map >, long unsigned int>]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/bc_clustering.hpp:150:38: required from ‘void boost::betweenness_centrality_clustering(MutableGraph&, Done, EdgeCentralityMap) [with MutableGraph = adjacency_list >, property > >; Done = clustering_threshold; EdgeCentralityMap = adj_list_edge_property_map >, edge_centrality_t>]’ bbc.cpp:149:36: required from here /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:206:17: note: in a call to non-static member function ‘boost::ConvertibleConcept::~ConvertibleConcept()’ 206 | BOOST_concept(Convertible,(X)(Y)) | ^~~~~~~~~~~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/preprocessor/cat.hpp:29:34: note: in definition of macro ‘BOOST_PP_CAT_I’ 29 | # define BOOST_PP_CAT_I(a, b) a ## b | ^ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/concept_def.hpp:23:12: note: in expansion of macro ‘BOOST_PP_CAT’ 23 | struct BOOST_PP_CAT(name,Concept) \ | ^~~~~~~~~~~~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:206:3: note: in expansion of macro ‘BOOST_concept’ 206 | BOOST_concept(Convertible,(X)(Y)) | ^~~~~~~~~~~~~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements > > >, boost::property > >*, std::vector > > >, boost::property > >, std::allocator > > >, boost::property > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >]’: /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/graph_concepts.hpp:52:50: required from ‘struct boost::concepts::MultiPassInputIterator > > >, boost::property > >*, std::vector > > >, boost::property > >, std::allocator > > >, boost::property > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::concepts::MultiPassInputIterator > > >, boost::property > >*, std::vector > > >, boost::property > >, std::allocator > > >, boost::property > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> >]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied > > >, boost::property > >*, std::vector > > >, boost::property > >, std::allocator > > >, boost::property > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::value’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied > > >, boost::property > >*, std::vector > > >, boost::property > >, std::allocator > > >, boost::property > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_ > > >, boost::property > >*, std::vector > > >, boost::property > >, std::allocator > > >, boost::property > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> >)>’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/graph_concepts.hpp:89:9: [ skipping 7 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/betweenness_centrality.hpp:500:43: required from ‘void boost::detail::graph::brandes_betweenness_centrality_dispatch2(const Graph&, CentralityMap, EdgeCentralityMap, VertexIndexMap) [with Graph = boost::adjacency_list >, boost::property > >; CentralityMap = boost::dummy_property_map; EdgeCentralityMap = boost::adj_list_edge_property_map >, boost::edge_centrality_t>; VertexIndexMap = boost::vec_adj_list_vertex_id_map >, long unsigned int>]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/betweenness_centrality.hpp:531:57: required from ‘static void boost::detail::graph::brandes_betweenness_centrality_dispatch1::run(const Graph&, CentralityMap, EdgeCentralityMap, VertexIndexMap, boost::param_not_found) [with Graph = boost::adjacency_list >, boost::property > >; CentralityMap = boost::dummy_property_map; EdgeCentralityMap = boost::adj_list_edge_property_map >, boost::edge_centrality_t>; VertexIndexMap = boost::vec_adj_list_vertex_id_map >, long unsigned int>]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/betweenness_centrality.hpp:558:71: required from ‘void boost::brandes_betweenness_centrality(const Graph&, const bgl_named_params&, typename enable_if_c::traversal_category>::value, graph::detail::no_parameter>::type) [with Graph = adjacency_list >, property > >; Param = vec_adj_list_vertex_id_map >, long unsigned int>; Tag = vertex_index_t; Rest = bgl_named_params >, edge_centrality_t>, edge_centrality_t, no_property>; typename enable_if_c::traversal_category>::value, graph::detail::no_parameter>::type = graph::detail::no_parameter; typename graph_traits::traversal_category = undir_adj_list_traversal_tag]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/bc_clustering.hpp:131:39: required from ‘void boost::betweenness_centrality_clustering(MutableGraph&, Done, EdgeCentralityMap, VertexIndexMap) [with MutableGraph = adjacency_list >, property > >; Done = clustering_threshold; EdgeCentralityMap = adj_list_edge_property_map >, edge_centrality_t>; VertexIndexMap = vec_adj_list_vertex_id_map >, long unsigned int>]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/bc_clustering.hpp:150:38: required from ‘void boost::betweenness_centrality_clustering(MutableGraph&, Done, EdgeCentralityMap) [with MutableGraph = adjacency_list >, property > >; Done = clustering_threshold; EdgeCentralityMap = adj_list_edge_property_map >, edge_centrality_t>]’ bbc.cpp:149:36: required from here /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::concepts::MultiPassInputIterator > > >, boost::property > >*, std::vector > > >, boost::property > >, std::allocator > > >, boost::property > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> >]’ 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ^ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::MultiPassInputIterator > > >, boost::property > >*, std::vector > > >, boost::property > >, std::allocator > > >, boost::property > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> >]’: /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/graph_concepts.hpp:89:9: required from ‘boost::concepts::IncidenceGraph::~IncidenceGraph() [with G = boost::adjacency_list >, boost::property > >]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/graph_concepts.hpp:75:1: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::IncidenceGraphConcept >, boost::property > > >]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/depth_first_search.hpp:129:9: required from ‘void boost::breadth_first_visit(const IncidenceGraph&, SourceIterator, SourceIterator, Buffer&, BFSVisitor, ColorMap) [with IncidenceGraph = adjacency_list >, property > >; Buffer = queue > >; BFSVisitor = detail::graph::brandes_unweighted_shortest_paths::visitor_type >, property > >, iterator_property_map<__gnu_cxx::__normal_iterator, std::allocator > >*, std::vector, std::allocator > >, std::allocator, std::allocator > > > > >, vec_adj_list_vertex_id_map >, long unsigned int>, std::vector, std::allocator > >, std::vector, std::allocator > >&>, iterator_property_map<__gnu_cxx::__normal_iterator > >, vec_adj_list_vertex_id_map >, long unsigned int>, double, double&>, iterator_property_map<__gnu_cxx::__normal_iterator > >, vec_adj_list_vertex_id_map >, long unsigned int>, long unsigned int, long unsigned int&> >; ColorMap = iterator_property_map<__gnu_cxx::__normal_iterator >, vec_adj_list_vertex_id_map >, long unsigned int>, default_color_type, default_color_type&>; SourceIterator = long unsigned int*]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/breadth_first_search.hpp:118:24: required from ‘void boost::breadth_first_visit(const IncidenceGraph&, typename graph_traits::vertex_descriptor, Buffer&, BFSVisitor, ColorMap) [with IncidenceGraph = adjacency_list >, property > >; Buffer = queue > >; BFSVisitor = detail::graph::brandes_unweighted_shortest_paths::visitor_type >, property > >, iterator_property_map<__gnu_cxx::__normal_iterator, std::allocator > >*, std::vector, std::allocator > >, std::allocator, std::allocator > > > > >, vec_adj_list_vertex_id_map >, long unsigned int>, std::vector, std::allocator > >, std::vector, std::allocator > >&>, iterator_property_map<__gnu_cxx::__normal_iterator > >, vec_adj_list_vertex_id_map >, long unsigned int>, double, double&>, iterator_property_map<__gnu_cxx::__normal_iterator > >, vec_adj_list_vertex_id_map >, long unsigned int>, long unsigned int, long unsigned int&> >; ColorMap = iterator_property_map<__gnu_cxx::__normal_iterator >, vec_adj_list_vertex_id_map >, long unsigned int>, default_color_type, default_color_type&>; typename graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/betweenness_centrality.hpp:248:36: required from ‘void boost::detail::graph::brandes_unweighted_shortest_paths::operator()(Graph&, typename boost::graph_traits::vertex_descriptor, std::stack::vertex_descriptor>&, IncomingMap, DistanceMap, PathCountMap, VertexIndexMap) [with Graph = const boost::adjacency_list >, boost::property > >; IncomingMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator, std::allocator > >*, std::vector, std::allocator > >, std::allocator, std::allocator > > > > >, boost::vec_adj_list_vertex_id_map >, long unsigned int>, std::vector, std::allocator > >, std::vector, std::allocator > >&>; DistanceMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator > >, boost::vec_adj_list_vertex_id_map >, long unsigned int>, double, double&>; PathCountMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator > >, boost::vec_adj_list_vertex_id_map >, long unsigned int>, long unsigned int, long unsigned int&>; VertexIndexMap = boost::vec_adj_list_vertex_id_map >, long unsigned int>; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/betweenness_centrality.hpp:349:31: [ skipping 2 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/betweenness_centrality.hpp:500:43: required from ‘void boost::detail::graph::brandes_betweenness_centrality_dispatch2(const Graph&, CentralityMap, EdgeCentralityMap, VertexIndexMap) [with Graph = boost::adjacency_list >, boost::property > >; CentralityMap = boost::dummy_property_map; EdgeCentralityMap = boost::adj_list_edge_property_map >, boost::edge_centrality_t>; VertexIndexMap = boost::vec_adj_list_vertex_id_map >, long unsigned int>]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/betweenness_centrality.hpp:531:57: required from ‘static void boost::detail::graph::brandes_betweenness_centrality_dispatch1::run(const Graph&, CentralityMap, EdgeCentralityMap, VertexIndexMap, boost::param_not_found) [with Graph = boost::adjacency_list >, boost::property > >; CentralityMap = boost::dummy_property_map; EdgeCentralityMap = boost::adj_list_edge_property_map >, boost::edge_centrality_t>; VertexIndexMap = boost::vec_adj_list_vertex_id_map >, long unsigned int>]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/betweenness_centrality.hpp:558:71: required from ‘void boost::brandes_betweenness_centrality(const Graph&, const bgl_named_params&, typename enable_if_c::traversal_category>::value, graph::detail::no_parameter>::type) [with Graph = adjacency_list >, property > >; Param = vec_adj_list_vertex_id_map >, long unsigned int>; Tag = vertex_index_t; Rest = bgl_named_params >, edge_centrality_t>, edge_centrality_t, no_property>; typename enable_if_c::traversal_category>::value, graph::detail::no_parameter>::type = graph::detail::no_parameter; typename graph_traits::traversal_category = undir_adj_list_traversal_tag]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/bc_clustering.hpp:131:39: required from ‘void boost::betweenness_centrality_clustering(MutableGraph&, Done, EdgeCentralityMap, VertexIndexMap) [with MutableGraph = adjacency_list >, property > >; Done = clustering_threshold; EdgeCentralityMap = adj_list_edge_property_map >, edge_centrality_t>; VertexIndexMap = vec_adj_list_vertex_id_map >, long unsigned int>]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/bc_clustering.hpp:150:38: required from ‘void boost::betweenness_centrality_clustering(MutableGraph&, Done, EdgeCentralityMap) [with MutableGraph = adjacency_list >, property > >; Done = clustering_threshold; EdgeCentralityMap = adj_list_edge_property_map >, edge_centrality_t>]’ bbc.cpp:149:36: required from here /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::concepts::MultiPassInputIterator::~MultiPassInputIterator() [with T = boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > > >, boost::property > >*, std::vector > > >, boost::property > >, std::allocator > > >, boost::property > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>]’ 37 | ~model() | ^ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/graph_concepts.hpp:52:50: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 52 | BOOST_concept(MultiPassInputIterator, (T)) { BOOST_CONCEPT_USAGE( | ^~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements > >]’: /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:137:5: required from ‘struct boost::DefaultConstructible >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::DefaultConstructible >]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied > >::value’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied > >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_ >)>’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/graph_concepts.hpp:90:9: [ skipping 7 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/betweenness_centrality.hpp:500:43: required from ‘void boost::detail::graph::brandes_betweenness_centrality_dispatch2(const Graph&, CentralityMap, EdgeCentralityMap, VertexIndexMap) [with Graph = boost::adjacency_list >, boost::property > >; CentralityMap = boost::dummy_property_map; EdgeCentralityMap = boost::adj_list_edge_property_map >, boost::edge_centrality_t>; VertexIndexMap = boost::vec_adj_list_vertex_id_map >, long unsigned int>]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/betweenness_centrality.hpp:531:57: required from ‘static void boost::detail::graph::brandes_betweenness_centrality_dispatch1::run(const Graph&, CentralityMap, EdgeCentralityMap, VertexIndexMap, boost::param_not_found) [with Graph = boost::adjacency_list >, boost::property > >; CentralityMap = boost::dummy_property_map; EdgeCentralityMap = boost::adj_list_edge_property_map >, boost::edge_centrality_t>; VertexIndexMap = boost::vec_adj_list_vertex_id_map >, long unsigned int>]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/betweenness_centrality.hpp:558:71: required from ‘void boost::brandes_betweenness_centrality(const Graph&, const bgl_named_params&, typename enable_if_c::traversal_category>::value, graph::detail::no_parameter>::type) [with Graph = adjacency_list >, property > >; Param = vec_adj_list_vertex_id_map >, long unsigned int>; Tag = vertex_index_t; Rest = bgl_named_params >, edge_centrality_t>, edge_centrality_t, no_property>; typename enable_if_c::traversal_category>::value, graph::detail::no_parameter>::type = graph::detail::no_parameter; typename graph_traits::traversal_category = undir_adj_list_traversal_tag]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/bc_clustering.hpp:131:39: required from ‘void boost::betweenness_centrality_clustering(MutableGraph&, Done, EdgeCentralityMap, VertexIndexMap) [with MutableGraph = adjacency_list >, property > >; Done = clustering_threshold; EdgeCentralityMap = adj_list_edge_property_map >, edge_centrality_t>; VertexIndexMap = vec_adj_list_vertex_id_map >, long unsigned int>]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/bc_clustering.hpp:150:38: required from ‘void boost::betweenness_centrality_clustering(MutableGraph&, Done, EdgeCentralityMap) [with MutableGraph = adjacency_list >, property > >; Done = clustering_threshold; EdgeCentralityMap = adj_list_edge_property_map >, edge_centrality_t>]’ bbc.cpp:149:36: required from here /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::DefaultConstructible >]’ 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ^ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::DefaultConstructible >]’: /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/graph_concepts.hpp:90:9: required from ‘boost::concepts::IncidenceGraph::~IncidenceGraph() [with G = boost::adjacency_list >, boost::property > >]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/graph_concepts.hpp:75:1: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::IncidenceGraphConcept >, boost::property > > >]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/depth_first_search.hpp:129:9: required from ‘void boost::breadth_first_visit(const IncidenceGraph&, SourceIterator, SourceIterator, Buffer&, BFSVisitor, ColorMap) [with IncidenceGraph = adjacency_list >, property > >; Buffer = queue > >; BFSVisitor = detail::graph::brandes_unweighted_shortest_paths::visitor_type >, property > >, iterator_property_map<__gnu_cxx::__normal_iterator, std::allocator > >*, std::vector, std::allocator > >, std::allocator, std::allocator > > > > >, vec_adj_list_vertex_id_map >, long unsigned int>, std::vector, std::allocator > >, std::vector, std::allocator > >&>, iterator_property_map<__gnu_cxx::__normal_iterator > >, vec_adj_list_vertex_id_map >, long unsigned int>, double, double&>, iterator_property_map<__gnu_cxx::__normal_iterator > >, vec_adj_list_vertex_id_map >, long unsigned int>, long unsigned int, long unsigned int&> >; ColorMap = iterator_property_map<__gnu_cxx::__normal_iterator >, vec_adj_list_vertex_id_map >, long unsigned int>, default_color_type, default_color_type&>; SourceIterator = long unsigned int*]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/breadth_first_search.hpp:118:24: required from ‘void boost::breadth_first_visit(const IncidenceGraph&, typename graph_traits::vertex_descriptor, Buffer&, BFSVisitor, ColorMap) [with IncidenceGraph = adjacency_list >, property > >; Buffer = queue > >; BFSVisitor = detail::graph::brandes_unweighted_shortest_paths::visitor_type >, property > >, iterator_property_map<__gnu_cxx::__normal_iterator, std::allocator > >*, std::vector, std::allocator > >, std::allocator, std::allocator > > > > >, vec_adj_list_vertex_id_map >, long unsigned int>, std::vector, std::allocator > >, std::vector, std::allocator > >&>, iterator_property_map<__gnu_cxx::__normal_iterator > >, vec_adj_list_vertex_id_map >, long unsigned int>, double, double&>, iterator_property_map<__gnu_cxx::__normal_iterator > >, vec_adj_list_vertex_id_map >, long unsigned int>, long unsigned int, long unsigned int&> >; ColorMap = iterator_property_map<__gnu_cxx::__normal_iterator >, vec_adj_list_vertex_id_map >, long unsigned int>, default_color_type, default_color_type&>; typename graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/betweenness_centrality.hpp:248:36: required from ‘void boost::detail::graph::brandes_unweighted_shortest_paths::operator()(Graph&, typename boost::graph_traits::vertex_descriptor, std::stack::vertex_descriptor>&, IncomingMap, DistanceMap, PathCountMap, VertexIndexMap) [with Graph = const boost::adjacency_list >, boost::property > >; IncomingMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator, std::allocator > >*, std::vector, std::allocator > >, std::allocator, std::allocator > > > > >, boost::vec_adj_list_vertex_id_map >, long unsigned int>, std::vector, std::allocator > >, std::vector, std::allocator > >&>; DistanceMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator > >, boost::vec_adj_list_vertex_id_map >, long unsigned int>, double, double&>; PathCountMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator > >, boost::vec_adj_list_vertex_id_map >, long unsigned int>, long unsigned int, long unsigned int&>; VertexIndexMap = boost::vec_adj_list_vertex_id_map >, long unsigned int>; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/betweenness_centrality.hpp:349:31: [ skipping 2 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/betweenness_centrality.hpp:500:43: required from ‘void boost::detail::graph::brandes_betweenness_centrality_dispatch2(const Graph&, CentralityMap, EdgeCentralityMap, VertexIndexMap) [with Graph = boost::adjacency_list >, boost::property > >; CentralityMap = boost::dummy_property_map; EdgeCentralityMap = boost::adj_list_edge_property_map >, boost::edge_centrality_t>; VertexIndexMap = boost::vec_adj_list_vertex_id_map >, long unsigned int>]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/betweenness_centrality.hpp:531:57: required from ‘static void boost::detail::graph::brandes_betweenness_centrality_dispatch1::run(const Graph&, CentralityMap, EdgeCentralityMap, VertexIndexMap, boost::param_not_found) [with Graph = boost::adjacency_list >, boost::property > >; CentralityMap = boost::dummy_property_map; EdgeCentralityMap = boost::adj_list_edge_property_map >, boost::edge_centrality_t>; VertexIndexMap = boost::vec_adj_list_vertex_id_map >, long unsigned int>]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/betweenness_centrality.hpp:558:71: required from ‘void boost::brandes_betweenness_centrality(const Graph&, const bgl_named_params&, typename enable_if_c::traversal_category>::value, graph::detail::no_parameter>::type) [with Graph = adjacency_list >, property > >; Param = vec_adj_list_vertex_id_map >, long unsigned int>; Tag = vertex_index_t; Rest = bgl_named_params >, edge_centrality_t>, edge_centrality_t, no_property>; typename enable_if_c::traversal_category>::value, graph::detail::no_parameter>::type = graph::detail::no_parameter; typename graph_traits::traversal_category = undir_adj_list_traversal_tag]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/bc_clustering.hpp:131:39: required from ‘void boost::betweenness_centrality_clustering(MutableGraph&, Done, EdgeCentralityMap, VertexIndexMap) [with MutableGraph = adjacency_list >, property > >; Done = clustering_threshold; EdgeCentralityMap = adj_list_edge_property_map >, edge_centrality_t>; VertexIndexMap = vec_adj_list_vertex_id_map >, long unsigned int>]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/bc_clustering.hpp:150:38: required from ‘void boost::betweenness_centrality_clustering(MutableGraph&, Done, EdgeCentralityMap) [with MutableGraph = adjacency_list >, property > >; Done = clustering_threshold; EdgeCentralityMap = adj_list_edge_property_map >, edge_centrality_t>]’ bbc.cpp:149:36: required from here /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::DefaultConstructible::~DefaultConstructible() [with TT = boost::detail::edge_desc_impl]’ 37 | ~model() | ^ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:137:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 137 | BOOST_CONCEPT_USAGE(DefaultConstructible) { | ^~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements > >]’: /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:233:5: required from ‘struct boost::EqualityComparable >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::EqualityComparable >]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied > >::value’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied > >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_ >)>’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/graph_concepts.hpp:91:9: [ skipping 7 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/betweenness_centrality.hpp:500:43: required from ‘void boost::detail::graph::brandes_betweenness_centrality_dispatch2(const Graph&, CentralityMap, EdgeCentralityMap, VertexIndexMap) [with Graph = boost::adjacency_list >, boost::property > >; CentralityMap = boost::dummy_property_map; EdgeCentralityMap = boost::adj_list_edge_property_map >, boost::edge_centrality_t>; VertexIndexMap = boost::vec_adj_list_vertex_id_map >, long unsigned int>]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/betweenness_centrality.hpp:531:57: required from ‘static void boost::detail::graph::brandes_betweenness_centrality_dispatch1::run(const Graph&, CentralityMap, EdgeCentralityMap, VertexIndexMap, boost::param_not_found) [with Graph = boost::adjacency_list >, boost::property > >; CentralityMap = boost::dummy_property_map; EdgeCentralityMap = boost::adj_list_edge_property_map >, boost::edge_centrality_t>; VertexIndexMap = boost::vec_adj_list_vertex_id_map >, long unsigned int>]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/betweenness_centrality.hpp:558:71: required from ‘void boost::brandes_betweenness_centrality(const Graph&, const bgl_named_params&, typename enable_if_c::traversal_category>::value, graph::detail::no_parameter>::type) [with Graph = adjacency_list >, property > >; Param = vec_adj_list_vertex_id_map >, long unsigned int>; Tag = vertex_index_t; Rest = bgl_named_params >, edge_centrality_t>, edge_centrality_t, no_property>; typename enable_if_c::traversal_category>::value, graph::detail::no_parameter>::type = graph::detail::no_parameter; typename graph_traits::traversal_category = undir_adj_list_traversal_tag]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/bc_clustering.hpp:131:39: required from ‘void boost::betweenness_centrality_clustering(MutableGraph&, Done, EdgeCentralityMap, VertexIndexMap) [with MutableGraph = adjacency_list >, property > >; Done = clustering_threshold; EdgeCentralityMap = adj_list_edge_property_map >, edge_centrality_t>; VertexIndexMap = vec_adj_list_vertex_id_map >, long unsigned int>]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/bc_clustering.hpp:150:38: required from ‘void boost::betweenness_centrality_clustering(MutableGraph&, Done, EdgeCentralityMap) [with MutableGraph = adjacency_list >, property > >; Done = clustering_threshold; EdgeCentralityMap = adj_list_edge_property_map >, edge_centrality_t>]’ bbc.cpp:149:36: required from here /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::EqualityComparable >]’ 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ^ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::EqualityComparable >]’: /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/graph_concepts.hpp:91:9: required from ‘boost::concepts::IncidenceGraph::~IncidenceGraph() [with G = boost::adjacency_list >, boost::property > >]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/graph_concepts.hpp:75:1: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::IncidenceGraphConcept >, boost::property > > >]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/depth_first_search.hpp:129:9: required from ‘void boost::breadth_first_visit(const IncidenceGraph&, SourceIterator, SourceIterator, Buffer&, BFSVisitor, ColorMap) [with IncidenceGraph = adjacency_list >, property > >; Buffer = queue > >; BFSVisitor = detail::graph::brandes_unweighted_shortest_paths::visitor_type >, property > >, iterator_property_map<__gnu_cxx::__normal_iterator, std::allocator > >*, std::vector, std::allocator > >, std::allocator, std::allocator > > > > >, vec_adj_list_vertex_id_map >, long unsigned int>, std::vector, std::allocator > >, std::vector, std::allocator > >&>, iterator_property_map<__gnu_cxx::__normal_iterator > >, vec_adj_list_vertex_id_map >, long unsigned int>, double, double&>, iterator_property_map<__gnu_cxx::__normal_iterator > >, vec_adj_list_vertex_id_map >, long unsigned int>, long unsigned int, long unsigned int&> >; ColorMap = iterator_property_map<__gnu_cxx::__normal_iterator >, vec_adj_list_vertex_id_map >, long unsigned int>, default_color_type, default_color_type&>; SourceIterator = long unsigned int*]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/breadth_first_search.hpp:118:24: required from ‘void boost::breadth_first_visit(const IncidenceGraph&, typename graph_traits::vertex_descriptor, Buffer&, BFSVisitor, ColorMap) [with IncidenceGraph = adjacency_list >, property > >; Buffer = queue > >; BFSVisitor = detail::graph::brandes_unweighted_shortest_paths::visitor_type >, property > >, iterator_property_map<__gnu_cxx::__normal_iterator, std::allocator > >*, std::vector, std::allocator > >, std::allocator, std::allocator > > > > >, vec_adj_list_vertex_id_map >, long unsigned int>, std::vector, std::allocator > >, std::vector, std::allocator > >&>, iterator_property_map<__gnu_cxx::__normal_iterator > >, vec_adj_list_vertex_id_map >, long unsigned int>, double, double&>, iterator_property_map<__gnu_cxx::__normal_iterator > >, vec_adj_list_vertex_id_map >, long unsigned int>, long unsigned int, long unsigned int&> >; ColorMap = iterator_property_map<__gnu_cxx::__normal_iterator >, vec_adj_list_vertex_id_map >, long unsigned int>, default_color_type, default_color_type&>; typename graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/betweenness_centrality.hpp:248:36: required from ‘void boost::detail::graph::brandes_unweighted_shortest_paths::operator()(Graph&, typename boost::graph_traits::vertex_descriptor, std::stack::vertex_descriptor>&, IncomingMap, DistanceMap, PathCountMap, VertexIndexMap) [with Graph = const boost::adjacency_list >, boost::property > >; IncomingMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator, std::allocator > >*, std::vector, std::allocator > >, std::allocator, std::allocator > > > > >, boost::vec_adj_list_vertex_id_map >, long unsigned int>, std::vector, std::allocator > >, std::vector, std::allocator > >&>; DistanceMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator > >, boost::vec_adj_list_vertex_id_map >, long unsigned int>, double, double&>; PathCountMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator > >, boost::vec_adj_list_vertex_id_map >, long unsigned int>, long unsigned int, long unsigned int&>; VertexIndexMap = boost::vec_adj_list_vertex_id_map >, long unsigned int>; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/betweenness_centrality.hpp:349:31: [ skipping 2 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/betweenness_centrality.hpp:500:43: required from ‘void boost::detail::graph::brandes_betweenness_centrality_dispatch2(const Graph&, CentralityMap, EdgeCentralityMap, VertexIndexMap) [with Graph = boost::adjacency_list >, boost::property > >; CentralityMap = boost::dummy_property_map; EdgeCentralityMap = boost::adj_list_edge_property_map >, boost::edge_centrality_t>; VertexIndexMap = boost::vec_adj_list_vertex_id_map >, long unsigned int>]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/betweenness_centrality.hpp:531:57: required from ‘static void boost::detail::graph::brandes_betweenness_centrality_dispatch1::run(const Graph&, CentralityMap, EdgeCentralityMap, VertexIndexMap, boost::param_not_found) [with Graph = boost::adjacency_list >, boost::property > >; CentralityMap = boost::dummy_property_map; EdgeCentralityMap = boost::adj_list_edge_property_map >, boost::edge_centrality_t>; VertexIndexMap = boost::vec_adj_list_vertex_id_map >, long unsigned int>]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/betweenness_centrality.hpp:558:71: required from ‘void boost::brandes_betweenness_centrality(const Graph&, const bgl_named_params&, typename enable_if_c::traversal_category>::value, graph::detail::no_parameter>::type) [with Graph = adjacency_list >, property > >; Param = vec_adj_list_vertex_id_map >, long unsigned int>; Tag = vertex_index_t; Rest = bgl_named_params >, edge_centrality_t>, edge_centrality_t, no_property>; typename enable_if_c::traversal_category>::value, graph::detail::no_parameter>::type = graph::detail::no_parameter; typename graph_traits::traversal_category = undir_adj_list_traversal_tag]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/bc_clustering.hpp:131:39: required from ‘void boost::betweenness_centrality_clustering(MutableGraph&, Done, EdgeCentralityMap, VertexIndexMap) [with MutableGraph = adjacency_list >, property > >; Done = clustering_threshold; EdgeCentralityMap = adj_list_edge_property_map >, edge_centrality_t>; VertexIndexMap = vec_adj_list_vertex_id_map >, long unsigned int>]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/bc_clustering.hpp:150:38: required from ‘void boost::betweenness_centrality_clustering(MutableGraph&, Done, EdgeCentralityMap) [with MutableGraph = adjacency_list >, property > >; Done = clustering_threshold; EdgeCentralityMap = adj_list_edge_property_map >, edge_centrality_t>]’ bbc.cpp:149:36: required from here /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::EqualityComparable::~EqualityComparable() [with TT = boost::detail::edge_desc_impl]’ 37 | ~model() | ^ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:233:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 233 | BOOST_CONCEPT_USAGE(EqualityComparable) { | ^~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements > >]’: /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:145:5: required from ‘struct boost::Assignable >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::Assignable >]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied > >::value’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied > >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_ >)>’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/graph_concepts.hpp:92:9: [ skipping 7 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/betweenness_centrality.hpp:500:43: required from ‘void boost::detail::graph::brandes_betweenness_centrality_dispatch2(const Graph&, CentralityMap, EdgeCentralityMap, VertexIndexMap) [with Graph = boost::adjacency_list >, boost::property > >; CentralityMap = boost::dummy_property_map; EdgeCentralityMap = boost::adj_list_edge_property_map >, boost::edge_centrality_t>; VertexIndexMap = boost::vec_adj_list_vertex_id_map >, long unsigned int>]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/betweenness_centrality.hpp:531:57: required from ‘static void boost::detail::graph::brandes_betweenness_centrality_dispatch1::run(const Graph&, CentralityMap, EdgeCentralityMap, VertexIndexMap, boost::param_not_found) [with Graph = boost::adjacency_list >, boost::property > >; CentralityMap = boost::dummy_property_map; EdgeCentralityMap = boost::adj_list_edge_property_map >, boost::edge_centrality_t>; VertexIndexMap = boost::vec_adj_list_vertex_id_map >, long unsigned int>]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/betweenness_centrality.hpp:558:71: required from ‘void boost::brandes_betweenness_centrality(const Graph&, const bgl_named_params&, typename enable_if_c::traversal_category>::value, graph::detail::no_parameter>::type) [with Graph = adjacency_list >, property > >; Param = vec_adj_list_vertex_id_map >, long unsigned int>; Tag = vertex_index_t; Rest = bgl_named_params >, edge_centrality_t>, edge_centrality_t, no_property>; typename enable_if_c::traversal_category>::value, graph::detail::no_parameter>::type = graph::detail::no_parameter; typename graph_traits::traversal_category = undir_adj_list_traversal_tag]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/bc_clustering.hpp:131:39: required from ‘void boost::betweenness_centrality_clustering(MutableGraph&, Done, EdgeCentralityMap, VertexIndexMap) [with MutableGraph = adjacency_list >, property > >; Done = clustering_threshold; EdgeCentralityMap = adj_list_edge_property_map >, edge_centrality_t>; VertexIndexMap = vec_adj_list_vertex_id_map >, long unsigned int>]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/bc_clustering.hpp:150:38: required from ‘void boost::betweenness_centrality_clustering(MutableGraph&, Done, EdgeCentralityMap) [with MutableGraph = adjacency_list >, property > >; Done = clustering_threshold; EdgeCentralityMap = adj_list_edge_property_map >, edge_centrality_t>]’ bbc.cpp:149:36: required from here /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::Assignable >]’ 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ^ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::Assignable >]’: /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/graph_concepts.hpp:92:9: required from ‘boost::concepts::IncidenceGraph::~IncidenceGraph() [with G = boost::adjacency_list >, boost::property > >]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/graph_concepts.hpp:75:1: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::IncidenceGraphConcept >, boost::property > > >]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/depth_first_search.hpp:129:9: required from ‘void boost::breadth_first_visit(const IncidenceGraph&, SourceIterator, SourceIterator, Buffer&, BFSVisitor, ColorMap) [with IncidenceGraph = adjacency_list >, property > >; Buffer = queue > >; BFSVisitor = detail::graph::brandes_unweighted_shortest_paths::visitor_type >, property > >, iterator_property_map<__gnu_cxx::__normal_iterator, std::allocator > >*, std::vector, std::allocator > >, std::allocator, std::allocator > > > > >, vec_adj_list_vertex_id_map >, long unsigned int>, std::vector, std::allocator > >, std::vector, std::allocator > >&>, iterator_property_map<__gnu_cxx::__normal_iterator > >, vec_adj_list_vertex_id_map >, long unsigned int>, double, double&>, iterator_property_map<__gnu_cxx::__normal_iterator > >, vec_adj_list_vertex_id_map >, long unsigned int>, long unsigned int, long unsigned int&> >; ColorMap = iterator_property_map<__gnu_cxx::__normal_iterator >, vec_adj_list_vertex_id_map >, long unsigned int>, default_color_type, default_color_type&>; SourceIterator = long unsigned int*]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/breadth_first_search.hpp:118:24: required from ‘void boost::breadth_first_visit(const IncidenceGraph&, typename graph_traits::vertex_descriptor, Buffer&, BFSVisitor, ColorMap) [with IncidenceGraph = adjacency_list >, property > >; Buffer = queue > >; BFSVisitor = detail::graph::brandes_unweighted_shortest_paths::visitor_type >, property > >, iterator_property_map<__gnu_cxx::__normal_iterator, std::allocator > >*, std::vector, std::allocator > >, std::allocator, std::allocator > > > > >, vec_adj_list_vertex_id_map >, long unsigned int>, std::vector, std::allocator > >, std::vector, std::allocator > >&>, iterator_property_map<__gnu_cxx::__normal_iterator > >, vec_adj_list_vertex_id_map >, long unsigned int>, double, double&>, iterator_property_map<__gnu_cxx::__normal_iterator > >, vec_adj_list_vertex_id_map >, long unsigned int>, long unsigned int, long unsigned int&> >; ColorMap = iterator_property_map<__gnu_cxx::__normal_iterator >, vec_adj_list_vertex_id_map >, long unsigned int>, default_color_type, default_color_type&>; typename graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/betweenness_centrality.hpp:248:36: required from ‘void boost::detail::graph::brandes_unweighted_shortest_paths::operator()(Graph&, typename boost::graph_traits::vertex_descriptor, std::stack::vertex_descriptor>&, IncomingMap, DistanceMap, PathCountMap, VertexIndexMap) [with Graph = const boost::adjacency_list >, boost::property > >; IncomingMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator, std::allocator > >*, std::vector, std::allocator > >, std::allocator, std::allocator > > > > >, boost::vec_adj_list_vertex_id_map >, long unsigned int>, std::vector, std::allocator > >, std::vector, std::allocator > >&>; DistanceMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator > >, boost::vec_adj_list_vertex_id_map >, long unsigned int>, double, double&>; PathCountMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator > >, boost::vec_adj_list_vertex_id_map >, long unsigned int>, long unsigned int, long unsigned int&>; VertexIndexMap = boost::vec_adj_list_vertex_id_map >, long unsigned int>; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/betweenness_centrality.hpp:349:31: [ skipping 2 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/betweenness_centrality.hpp:500:43: required from ‘void boost::detail::graph::brandes_betweenness_centrality_dispatch2(const Graph&, CentralityMap, EdgeCentralityMap, VertexIndexMap) [with Graph = boost::adjacency_list >, boost::property > >; CentralityMap = boost::dummy_property_map; EdgeCentralityMap = boost::adj_list_edge_property_map >, boost::edge_centrality_t>; VertexIndexMap = boost::vec_adj_list_vertex_id_map >, long unsigned int>]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/betweenness_centrality.hpp:531:57: required from ‘static void boost::detail::graph::brandes_betweenness_centrality_dispatch1::run(const Graph&, CentralityMap, EdgeCentralityMap, VertexIndexMap, boost::param_not_found) [with Graph = boost::adjacency_list >, boost::property > >; CentralityMap = boost::dummy_property_map; EdgeCentralityMap = boost::adj_list_edge_property_map >, boost::edge_centrality_t>; VertexIndexMap = boost::vec_adj_list_vertex_id_map >, long unsigned int>]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/betweenness_centrality.hpp:558:71: required from ‘void boost::brandes_betweenness_centrality(const Graph&, const bgl_named_params&, typename enable_if_c::traversal_category>::value, graph::detail::no_parameter>::type) [with Graph = adjacency_list >, property > >; Param = vec_adj_list_vertex_id_map >, long unsigned int>; Tag = vertex_index_t; Rest = bgl_named_params >, edge_centrality_t>, edge_centrality_t, no_property>; typename enable_if_c::traversal_category>::value, graph::detail::no_parameter>::type = graph::detail::no_parameter; typename graph_traits::traversal_category = undir_adj_list_traversal_tag]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/bc_clustering.hpp:131:39: required from ‘void boost::betweenness_centrality_clustering(MutableGraph&, Done, EdgeCentralityMap, VertexIndexMap) [with MutableGraph = adjacency_list >, property > >; Done = clustering_threshold; EdgeCentralityMap = adj_list_edge_property_map >, edge_centrality_t>; VertexIndexMap = vec_adj_list_vertex_id_map >, long unsigned int>]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/bc_clustering.hpp:150:38: required from ‘void boost::betweenness_centrality_clustering(MutableGraph&, Done, EdgeCentralityMap) [with MutableGraph = adjacency_list >, property > >; Done = clustering_threshold; EdgeCentralityMap = adj_list_edge_property_map >, edge_centrality_t>]’ bbc.cpp:149:36: required from here /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::Assignable::~Assignable() [with TT = boost::detail::edge_desc_impl]’ 37 | ~model() | ^ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:145:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 145 | BOOST_CONCEPT_USAGE(Assignable) { | ^~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements >]’: /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:208:5: required from ‘struct boost::Convertible’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::Convertible]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied >::value’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_)>’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/graph_concepts.hpp:93:9: [ skipping 7 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/betweenness_centrality.hpp:500:43: required from ‘void boost::detail::graph::brandes_betweenness_centrality_dispatch2(const Graph&, CentralityMap, EdgeCentralityMap, VertexIndexMap) [with Graph = boost::adjacency_list >, boost::property > >; CentralityMap = boost::dummy_property_map; EdgeCentralityMap = boost::adj_list_edge_property_map >, boost::edge_centrality_t>; VertexIndexMap = boost::vec_adj_list_vertex_id_map >, long unsigned int>]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/betweenness_centrality.hpp:531:57: required from ‘static void boost::detail::graph::brandes_betweenness_centrality_dispatch1::run(const Graph&, CentralityMap, EdgeCentralityMap, VertexIndexMap, boost::param_not_found) [with Graph = boost::adjacency_list >, boost::property > >; CentralityMap = boost::dummy_property_map; EdgeCentralityMap = boost::adj_list_edge_property_map >, boost::edge_centrality_t>; VertexIndexMap = boost::vec_adj_list_vertex_id_map >, long unsigned int>]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/betweenness_centrality.hpp:558:71: required from ‘void boost::brandes_betweenness_centrality(const Graph&, const bgl_named_params&, typename enable_if_c::traversal_category>::value, graph::detail::no_parameter>::type) [with Graph = adjacency_list >, property > >; Param = vec_adj_list_vertex_id_map >, long unsigned int>; Tag = vertex_index_t; Rest = bgl_named_params >, edge_centrality_t>, edge_centrality_t, no_property>; typename enable_if_c::traversal_category>::value, graph::detail::no_parameter>::type = graph::detail::no_parameter; typename graph_traits::traversal_category = undir_adj_list_traversal_tag]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/bc_clustering.hpp:131:39: required from ‘void boost::betweenness_centrality_clustering(MutableGraph&, Done, EdgeCentralityMap, VertexIndexMap) [with MutableGraph = adjacency_list >, property > >; Done = clustering_threshold; EdgeCentralityMap = adj_list_edge_property_map >, edge_centrality_t>; VertexIndexMap = vec_adj_list_vertex_id_map >, long unsigned int>]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/bc_clustering.hpp:150:38: required from ‘void boost::betweenness_centrality_clustering(MutableGraph&, Done, EdgeCentralityMap) [with MutableGraph = adjacency_list >, property > >; Done = clustering_threshold; EdgeCentralityMap = adj_list_edge_property_map >, edge_centrality_t>]’ bbc.cpp:149:36: required from here /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::Convertible]’ 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ^ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::Convertible]’: /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/graph_concepts.hpp:93:9: required from ‘boost::concepts::IncidenceGraph::~IncidenceGraph() [with G = boost::adjacency_list >, boost::property > >]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/graph_concepts.hpp:75:1: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::IncidenceGraphConcept >, boost::property > > >]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/depth_first_search.hpp:129:9: required from ‘void boost::breadth_first_visit(const IncidenceGraph&, SourceIterator, SourceIterator, Buffer&, BFSVisitor, ColorMap) [with IncidenceGraph = adjacency_list >, property > >; Buffer = queue > >; BFSVisitor = detail::graph::brandes_unweighted_shortest_paths::visitor_type >, property > >, iterator_property_map<__gnu_cxx::__normal_iterator, std::allocator > >*, std::vector, std::allocator > >, std::allocator, std::allocator > > > > >, vec_adj_list_vertex_id_map >, long unsigned int>, std::vector, std::allocator > >, std::vector, std::allocator > >&>, iterator_property_map<__gnu_cxx::__normal_iterator > >, vec_adj_list_vertex_id_map >, long unsigned int>, double, double&>, iterator_property_map<__gnu_cxx::__normal_iterator > >, vec_adj_list_vertex_id_map >, long unsigned int>, long unsigned int, long unsigned int&> >; ColorMap = iterator_property_map<__gnu_cxx::__normal_iterator >, vec_adj_list_vertex_id_map >, long unsigned int>, default_color_type, default_color_type&>; SourceIterator = long unsigned int*]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/breadth_first_search.hpp:118:24: required from ‘void boost::breadth_first_visit(const IncidenceGraph&, typename graph_traits::vertex_descriptor, Buffer&, BFSVisitor, ColorMap) [with IncidenceGraph = adjacency_list >, property > >; Buffer = queue > >; BFSVisitor = detail::graph::brandes_unweighted_shortest_paths::visitor_type >, property > >, iterator_property_map<__gnu_cxx::__normal_iterator, std::allocator > >*, std::vector, std::allocator > >, std::allocator, std::allocator > > > > >, vec_adj_list_vertex_id_map >, long unsigned int>, std::vector, std::allocator > >, std::vector, std::allocator > >&>, iterator_property_map<__gnu_cxx::__normal_iterator > >, vec_adj_list_vertex_id_map >, long unsigned int>, double, double&>, iterator_property_map<__gnu_cxx::__normal_iterator > >, vec_adj_list_vertex_id_map >, long unsigned int>, long unsigned int, long unsigned int&> >; ColorMap = iterator_property_map<__gnu_cxx::__normal_iterator >, vec_adj_list_vertex_id_map >, long unsigned int>, default_color_type, default_color_type&>; typename graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/betweenness_centrality.hpp:248:36: required from ‘void boost::detail::graph::brandes_unweighted_shortest_paths::operator()(Graph&, typename boost::graph_traits::vertex_descriptor, std::stack::vertex_descriptor>&, IncomingMap, DistanceMap, PathCountMap, VertexIndexMap) [with Graph = const boost::adjacency_list >, boost::property > >; IncomingMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator, std::allocator > >*, std::vector, std::allocator > >, std::allocator, std::allocator > > > > >, boost::vec_adj_list_vertex_id_map >, long unsigned int>, std::vector, std::allocator > >, std::vector, std::allocator > >&>; DistanceMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator > >, boost::vec_adj_list_vertex_id_map >, long unsigned int>, double, double&>; PathCountMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator > >, boost::vec_adj_list_vertex_id_map >, long unsigned int>, long unsigned int, long unsigned int&>; VertexIndexMap = boost::vec_adj_list_vertex_id_map >, long unsigned int>; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/betweenness_centrality.hpp:349:31: [ skipping 2 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/betweenness_centrality.hpp:500:43: required from ‘void boost::detail::graph::brandes_betweenness_centrality_dispatch2(const Graph&, CentralityMap, EdgeCentralityMap, VertexIndexMap) [with Graph = boost::adjacency_list >, boost::property > >; CentralityMap = boost::dummy_property_map; EdgeCentralityMap = boost::adj_list_edge_property_map >, boost::edge_centrality_t>; VertexIndexMap = boost::vec_adj_list_vertex_id_map >, long unsigned int>]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/betweenness_centrality.hpp:531:57: required from ‘static void boost::detail::graph::brandes_betweenness_centrality_dispatch1::run(const Graph&, CentralityMap, EdgeCentralityMap, VertexIndexMap, boost::param_not_found) [with Graph = boost::adjacency_list >, boost::property > >; CentralityMap = boost::dummy_property_map; EdgeCentralityMap = boost::adj_list_edge_property_map >, boost::edge_centrality_t>; VertexIndexMap = boost::vec_adj_list_vertex_id_map >, long unsigned int>]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/betweenness_centrality.hpp:558:71: required from ‘void boost::brandes_betweenness_centrality(const Graph&, const bgl_named_params&, typename enable_if_c::traversal_category>::value, graph::detail::no_parameter>::type) [with Graph = adjacency_list >, property > >; Param = vec_adj_list_vertex_id_map >, long unsigned int>; Tag = vertex_index_t; Rest = bgl_named_params >, edge_centrality_t>, edge_centrality_t, no_property>; typename enable_if_c::traversal_category>::value, graph::detail::no_parameter>::type = graph::detail::no_parameter; typename graph_traits::traversal_category = undir_adj_list_traversal_tag]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/bc_clustering.hpp:131:39: required from ‘void boost::betweenness_centrality_clustering(MutableGraph&, Done, EdgeCentralityMap, VertexIndexMap) [with MutableGraph = adjacency_list >, property > >; Done = clustering_threshold; EdgeCentralityMap = adj_list_edge_property_map >, edge_centrality_t>; VertexIndexMap = vec_adj_list_vertex_id_map >, long unsigned int>]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/bc_clustering.hpp:150:38: required from ‘void boost::betweenness_centrality_clustering(MutableGraph&, Done, EdgeCentralityMap) [with MutableGraph = adjacency_list >, property > >; Done = clustering_threshold; EdgeCentralityMap = adj_list_edge_property_map >, edge_centrality_t>]’ bbc.cpp:149:36: required from here /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::Convertible::~Convertible() [with X = boost::undir_adj_list_traversal_tag; Y = boost::incidence_graph_tag]’ 37 | ~model() | ^ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:208:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 208 | BOOST_CONCEPT_USAGE(Convertible) { | ^~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::CopyConstructible >, boost::property > >, boost::iterator_property_map<__gnu_cxx::__normal_iterator, std::allocator > >*, std::vector, std::allocator > >, std::allocator, std::allocator > > > > >, boost::vec_adj_list_vertex_id_map >, long unsigned int>, std::vector, std::allocator > >, std::vector, std::allocator > >&>, boost::iterator_property_map<__gnu_cxx::__normal_iterator > >, boost::vec_adj_list_vertex_id_map >, long unsigned int>, double, double&>, boost::iterator_property_map<__gnu_cxx::__normal_iterator > >, boost::vec_adj_list_vertex_id_map >, long unsigned int>, long unsigned int, long unsigned int&> > >]’: /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements >, boost::property > >, boost::iterator_property_map<__gnu_cxx::__normal_iterator, std::allocator > >*, std::vector, std::allocator > >, std::allocator, std::allocator > > > > >, boost::vec_adj_list_vertex_id_map >, long unsigned int>, std::vector, std::allocator > >, std::vector, std::allocator > >&>, boost::iterator_property_map<__gnu_cxx::__normal_iterator > >, boost::vec_adj_list_vertex_id_map >, long unsigned int>, double, double&>, boost::iterator_property_map<__gnu_cxx::__normal_iterator > >, boost::vec_adj_list_vertex_id_map >, long unsigned int>, long unsigned int, long unsigned int&> > > >]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:167:5: required from ‘struct boost::CopyConstructible >, boost::property > >, boost::iterator_property_map<__gnu_cxx::__normal_iterator, std::allocator > >*, std::vector, std::allocator > >, std::allocator, std::allocator > > > > >, boost::vec_adj_list_vertex_id_map >, long unsigned int>, std::vector, std::allocator > >, std::vector, std::allocator > >&>, boost::iterator_property_map<__gnu_cxx::__normal_iterator > >, boost::vec_adj_list_vertex_id_map >, long unsigned int>, double, double&>, boost::iterator_property_map<__gnu_cxx::__normal_iterator > >, boost::vec_adj_list_vertex_id_map >, long unsigned int>, long unsigned int, long unsigned int&> > >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:165:3: required from ‘struct boost::CopyConstructibleConcept >, boost::property > >, boost::iterator_property_map<__gnu_cxx::__normal_iterator, std::allocator > >*, std::vector, std::allocator > >, std::allocator, std::allocator > > > > >, boost::vec_adj_list_vertex_id_map >, long unsigned int>, std::vector, std::allocator > >, std::vector, std::allocator > >&>, boost::iterator_property_map<__gnu_cxx::__normal_iterator > >, boost::vec_adj_list_vertex_id_map >, long unsigned int>, double, double&>, boost::iterator_property_map<__gnu_cxx::__normal_iterator > >, boost::vec_adj_list_vertex_id_map >, long unsigned int>, long unsigned int, long unsigned int&> > >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::CopyConstructibleConcept >, boost::property > >, boost::iterator_property_map<__gnu_cxx::__normal_iterator, std::allocator > >*, std::vector, std::allocator > >, std::allocator, std::allocator > > > > >, boost::vec_adj_list_vertex_id_map >, long unsigned int>, std::vector, std::allocator > >, std::vector, std::allocator > >&>, boost::iterator_property_map<__gnu_cxx::__normal_iterator > >, boost::vec_adj_list_vertex_id_map >, long unsigned int>, double, double&>, boost::iterator_property_map<__gnu_cxx::__normal_iterator > >, boost::vec_adj_list_vertex_id_map >, long unsigned int>, long unsigned int, long unsigned int&> > >]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied >, boost::property > >, boost::iterator_property_map<__gnu_cxx::__normal_iterator, std::allocator > >*, std::vector, std::allocator > >, std::allocator, std::allocator > > > > >, boost::vec_adj_list_vertex_id_map >, long unsigned int>, std::vector, std::allocator > >, std::vector, std::allocator > >&>, boost::iterator_property_map<__gnu_cxx::__normal_iterator > >, boost::vec_adj_list_vertex_id_map >, long unsigned int>, double, double&>, boost::iterator_property_map<__gnu_cxx::__normal_iterator > >, boost::vec_adj_list_vertex_id_map >, long unsigned int>, long unsigned int, long unsigned int&> > > >::value’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:45:51: [ skipping 12 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/betweenness_centrality.hpp:500:43: required from ‘void boost::detail::graph::brandes_betweenness_centrality_dispatch2(const Graph&, CentralityMap, EdgeCentralityMap, VertexIndexMap) [with Graph = boost::adjacency_list >, boost::property > >; CentralityMap = boost::dummy_property_map; EdgeCentralityMap = boost::adj_list_edge_property_map >, boost::edge_centrality_t>; VertexIndexMap = boost::vec_adj_list_vertex_id_map >, long unsigned int>]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/betweenness_centrality.hpp:531:57: required from ‘static void boost::detail::graph::brandes_betweenness_centrality_dispatch1::run(const Graph&, CentralityMap, EdgeCentralityMap, VertexIndexMap, boost::param_not_found) [with Graph = boost::adjacency_list >, boost::property > >; CentralityMap = boost::dummy_property_map; EdgeCentralityMap = boost::adj_list_edge_property_map >, boost::edge_centrality_t>; VertexIndexMap = boost::vec_adj_list_vertex_id_map >, long unsigned int>]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/betweenness_centrality.hpp:558:71: required from ‘void boost::brandes_betweenness_centrality(const Graph&, const bgl_named_params&, typename enable_if_c::traversal_category>::value, graph::detail::no_parameter>::type) [with Graph = adjacency_list >, property > >; Param = vec_adj_list_vertex_id_map >, long unsigned int>; Tag = vertex_index_t; Rest = bgl_named_params >, edge_centrality_t>, edge_centrality_t, no_property>; typename enable_if_c::traversal_category>::value, graph::detail::no_parameter>::type = graph::detail::no_parameter; typename graph_traits::traversal_category = undir_adj_list_traversal_tag]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/bc_clustering.hpp:131:39: required from ‘void boost::betweenness_centrality_clustering(MutableGraph&, Done, EdgeCentralityMap, VertexIndexMap) [with MutableGraph = adjacency_list >, property > >; Done = clustering_threshold; EdgeCentralityMap = adj_list_edge_property_map >, edge_centrality_t>; VertexIndexMap = vec_adj_list_vertex_id_map >, long unsigned int>]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/bc_clustering.hpp:150:38: required from ‘void boost::betweenness_centrality_clustering(MutableGraph&, Done, EdgeCentralityMap) [with MutableGraph = adjacency_list >, property > >; Done = clustering_threshold; EdgeCentralityMap = adj_list_edge_property_map >, edge_centrality_t>]’ bbc.cpp:149:36: required from here /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::CopyConstructible::~CopyConstructible() [with TT = boost::detail::graph::brandes_unweighted_shortest_paths::visitor_type >, boost::property > >, boost::iterator_property_map<__gnu_cxx::__normal_iterator, std::allocator > >*, std::vector, std::allocator > >, std::allocator, std::allocator > > > > >, boost::vec_adj_list_vertex_id_map >, long unsigned int>, std::vector, std::allocator > >, std::vector, std::allocator > >&>, boost::iterator_property_map<__gnu_cxx::__normal_iterator > >, boost::vec_adj_list_vertex_id_map >, long unsigned int>, double, double&>, boost::iterator_property_map<__gnu_cxx::__normal_iterator > >, boost::vec_adj_list_vertex_id_map >, long unsigned int>, long unsigned int, long unsigned int&> >]’ 37 | ~model() | ^ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:167:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 167 | BOOST_CONCEPT_USAGE(CopyConstructible) { | ^~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements >]’: /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:208:5: required from ‘struct boost::Convertible’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:206:3: required from ‘struct boost::ConvertibleConcept’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::ConvertibleConcept]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied >::value’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:72:8: [ skipping 16 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/betweenness_centrality.hpp:500:43: required from ‘void boost::detail::graph::brandes_betweenness_centrality_dispatch2(const Graph&, CentralityMap, EdgeCentralityMap, VertexIndexMap) [with Graph = boost::adjacency_list >, boost::property > >; CentralityMap = boost::dummy_property_map; EdgeCentralityMap = boost::adj_list_edge_property_map >, boost::edge_centrality_t>; VertexIndexMap = boost::vec_adj_list_vertex_id_map >, long unsigned int>]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/betweenness_centrality.hpp:531:57: required from ‘static void boost::detail::graph::brandes_betweenness_centrality_dispatch1::run(const Graph&, CentralityMap, EdgeCentralityMap, VertexIndexMap, boost::param_not_found) [with Graph = boost::adjacency_list >, boost::property > >; CentralityMap = boost::dummy_property_map; EdgeCentralityMap = boost::adj_list_edge_property_map >, boost::edge_centrality_t>; VertexIndexMap = boost::vec_adj_list_vertex_id_map >, long unsigned int>]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/betweenness_centrality.hpp:558:71: required from ‘void boost::brandes_betweenness_centrality(const Graph&, const bgl_named_params&, typename enable_if_c::traversal_category>::value, graph::detail::no_parameter>::type) [with Graph = adjacency_list >, property > >; Param = vec_adj_list_vertex_id_map >, long unsigned int>; Tag = vertex_index_t; Rest = bgl_named_params >, edge_centrality_t>, edge_centrality_t, no_property>; typename enable_if_c::traversal_category>::value, graph::detail::no_parameter>::type = graph::detail::no_parameter; typename graph_traits::traversal_category = undir_adj_list_traversal_tag]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/bc_clustering.hpp:131:39: required from ‘void boost::betweenness_centrality_clustering(MutableGraph&, Done, EdgeCentralityMap, VertexIndexMap) [with MutableGraph = adjacency_list >, property > >; Done = clustering_threshold; EdgeCentralityMap = adj_list_edge_property_map >, edge_centrality_t>; VertexIndexMap = vec_adj_list_vertex_id_map >, long unsigned int>]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/bc_clustering.hpp:150:38: required from ‘void boost::betweenness_centrality_clustering(MutableGraph&, Done, EdgeCentralityMap) [with MutableGraph = adjacency_list >, property > >; Done = clustering_threshold; EdgeCentralityMap = adj_list_edge_property_map >, edge_centrality_t>]’ bbc.cpp:149:36: required from here /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::Convertible]’ 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ^ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::ConvertibleConcept]’: /home/omnipath/local/R/4.4-3.20/BH/include/boost/property_map/property_map.hpp:148:7: required from ‘void boost::ReadablePropertyMapConcept::constraints() [with PMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map >, long unsigned int>, boost::default_color_type, boost::default_color_type&>; Key = long unsigned int]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::ReadablePropertyMapConcept >, boost::vec_adj_list_vertex_id_map >, long unsigned int>, boost::default_color_type, boost::default_color_type&>, long unsigned int>]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied >, boost::vec_adj_list_vertex_id_map >, long unsigned int>, boost::default_color_type, boost::default_color_type&>, long unsigned int> >::value’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied >, boost::vec_adj_list_vertex_id_map >, long unsigned int>, boost::default_color_type, boost::default_color_type&>, long unsigned int> >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_ >, boost::vec_adj_list_vertex_id_map >, long unsigned int>, boost::default_color_type, boost::default_color_type&>, long unsigned int>)>’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/property_map/property_map.hpp:206:7: [ skipping 10 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/betweenness_centrality.hpp:500:43: required from ‘void boost::detail::graph::brandes_betweenness_centrality_dispatch2(const Graph&, CentralityMap, EdgeCentralityMap, VertexIndexMap) [with Graph = boost::adjacency_list >, boost::property > >; CentralityMap = boost::dummy_property_map; EdgeCentralityMap = boost::adj_list_edge_property_map >, boost::edge_centrality_t>; VertexIndexMap = boost::vec_adj_list_vertex_id_map >, long unsigned int>]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/betweenness_centrality.hpp:531:57: required from ‘static void boost::detail::graph::brandes_betweenness_centrality_dispatch1::run(const Graph&, CentralityMap, EdgeCentralityMap, VertexIndexMap, boost::param_not_found) [with Graph = boost::adjacency_list >, boost::property > >; CentralityMap = boost::dummy_property_map; EdgeCentralityMap = boost::adj_list_edge_property_map >, boost::edge_centrality_t>; VertexIndexMap = boost::vec_adj_list_vertex_id_map >, long unsigned int>]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/betweenness_centrality.hpp:558:71: required from ‘void boost::brandes_betweenness_centrality(const Graph&, const bgl_named_params&, typename enable_if_c::traversal_category>::value, graph::detail::no_parameter>::type) [with Graph = adjacency_list >, property > >; Param = vec_adj_list_vertex_id_map >, long unsigned int>; Tag = vertex_index_t; Rest = bgl_named_params >, edge_centrality_t>, edge_centrality_t, no_property>; typename enable_if_c::traversal_category>::value, graph::detail::no_parameter>::type = graph::detail::no_parameter; typename graph_traits::traversal_category = undir_adj_list_traversal_tag]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/bc_clustering.hpp:131:39: required from ‘void boost::betweenness_centrality_clustering(MutableGraph&, Done, EdgeCentralityMap, VertexIndexMap) [with MutableGraph = adjacency_list >, property > >; Done = clustering_threshold; EdgeCentralityMap = adj_list_edge_property_map >, edge_centrality_t>; VertexIndexMap = vec_adj_list_vertex_id_map >, long unsigned int>]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/bc_clustering.hpp:150:38: required from ‘void boost::betweenness_centrality_clustering(MutableGraph&, Done, EdgeCentralityMap) [with MutableGraph = adjacency_list >, property > >; Done = clustering_threshold; EdgeCentralityMap = adj_list_edge_property_map >, edge_centrality_t>]’ bbc.cpp:149:36: required from here /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:206:17: note: in a call to non-static member function ‘boost::ConvertibleConcept::~ConvertibleConcept()’ 206 | BOOST_concept(Convertible,(X)(Y)) | ^~~~~~~~~~~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/preprocessor/cat.hpp:29:34: note: in definition of macro ‘BOOST_PP_CAT_I’ 29 | # define BOOST_PP_CAT_I(a, b) a ## b | ^ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/concept_def.hpp:23:12: note: in expansion of macro ‘BOOST_PP_CAT’ 23 | struct BOOST_PP_CAT(name,Concept) \ | ^~~~~~~~~~~~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:206:3: note: in expansion of macro ‘BOOST_concept’ 206 | BOOST_concept(Convertible,(X)(Y)) | ^~~~~~~~~~~~~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements >]’: /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:208:5: required from ‘struct boost::Convertible’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:206:3: required from ‘struct boost::ConvertibleConcept’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::ConvertibleConcept]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied >::value’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:72:8: [ skipping 16 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/betweenness_centrality.hpp:500:43: required from ‘void boost::detail::graph::brandes_betweenness_centrality_dispatch2(const Graph&, CentralityMap, EdgeCentralityMap, VertexIndexMap) [with Graph = boost::adjacency_list >, boost::property > >; CentralityMap = boost::dummy_property_map; EdgeCentralityMap = boost::adj_list_edge_property_map >, boost::edge_centrality_t>; VertexIndexMap = boost::vec_adj_list_vertex_id_map >, long unsigned int>]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/betweenness_centrality.hpp:531:57: required from ‘static void boost::detail::graph::brandes_betweenness_centrality_dispatch1::run(const Graph&, CentralityMap, EdgeCentralityMap, VertexIndexMap, boost::param_not_found) [with Graph = boost::adjacency_list >, boost::property > >; CentralityMap = boost::dummy_property_map; EdgeCentralityMap = boost::adj_list_edge_property_map >, boost::edge_centrality_t>; VertexIndexMap = boost::vec_adj_list_vertex_id_map >, long unsigned int>]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/betweenness_centrality.hpp:558:71: required from ‘void boost::brandes_betweenness_centrality(const Graph&, const bgl_named_params&, typename enable_if_c::traversal_category>::value, graph::detail::no_parameter>::type) [with Graph = adjacency_list >, property > >; Param = vec_adj_list_vertex_id_map >, long unsigned int>; Tag = vertex_index_t; Rest = bgl_named_params >, edge_centrality_t>, edge_centrality_t, no_property>; typename enable_if_c::traversal_category>::value, graph::detail::no_parameter>::type = graph::detail::no_parameter; typename graph_traits::traversal_category = undir_adj_list_traversal_tag]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/bc_clustering.hpp:131:39: required from ‘void boost::betweenness_centrality_clustering(MutableGraph&, Done, EdgeCentralityMap, VertexIndexMap) [with MutableGraph = adjacency_list >, property > >; Done = clustering_threshold; EdgeCentralityMap = adj_list_edge_property_map >, edge_centrality_t>; VertexIndexMap = vec_adj_list_vertex_id_map >, long unsigned int>]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/bc_clustering.hpp:150:38: required from ‘void boost::betweenness_centrality_clustering(MutableGraph&, Done, EdgeCentralityMap) [with MutableGraph = adjacency_list >, property > >; Done = clustering_threshold; EdgeCentralityMap = adj_list_edge_property_map >, edge_centrality_t>]’ bbc.cpp:149:36: required from here /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::Convertible]’ 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ^ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::ConvertibleConcept]’: /home/omnipath/local/R/4.4-3.20/BH/include/boost/property_map/property_map.hpp:180:7: required from ‘void boost::WritablePropertyMapConcept::constraints() [with PMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map >, long unsigned int>, boost::default_color_type, boost::default_color_type&>; Key = long unsigned int]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::WritablePropertyMapConcept >, boost::vec_adj_list_vertex_id_map >, long unsigned int>, boost::default_color_type, boost::default_color_type&>, long unsigned int>]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied >, boost::vec_adj_list_vertex_id_map >, long unsigned int>, boost::default_color_type, boost::default_color_type&>, long unsigned int> >::value’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied >, boost::vec_adj_list_vertex_id_map >, long unsigned int>, boost::default_color_type, boost::default_color_type&>, long unsigned int> >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_ >, boost::vec_adj_list_vertex_id_map >, long unsigned int>, boost::default_color_type, boost::default_color_type&>, long unsigned int>)>’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/property_map/property_map.hpp:207:7: [ skipping 10 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/betweenness_centrality.hpp:500:43: required from ‘void boost::detail::graph::brandes_betweenness_centrality_dispatch2(const Graph&, CentralityMap, EdgeCentralityMap, VertexIndexMap) [with Graph = boost::adjacency_list >, boost::property > >; CentralityMap = boost::dummy_property_map; EdgeCentralityMap = boost::adj_list_edge_property_map >, boost::edge_centrality_t>; VertexIndexMap = boost::vec_adj_list_vertex_id_map >, long unsigned int>]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/betweenness_centrality.hpp:531:57: required from ‘static void boost::detail::graph::brandes_betweenness_centrality_dispatch1::run(const Graph&, CentralityMap, EdgeCentralityMap, VertexIndexMap, boost::param_not_found) [with Graph = boost::adjacency_list >, boost::property > >; CentralityMap = boost::dummy_property_map; EdgeCentralityMap = boost::adj_list_edge_property_map >, boost::edge_centrality_t>; VertexIndexMap = boost::vec_adj_list_vertex_id_map >, long unsigned int>]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/betweenness_centrality.hpp:558:71: required from ‘void boost::brandes_betweenness_centrality(const Graph&, const bgl_named_params&, typename enable_if_c::traversal_category>::value, graph::detail::no_parameter>::type) [with Graph = adjacency_list >, property > >; Param = vec_adj_list_vertex_id_map >, long unsigned int>; Tag = vertex_index_t; Rest = bgl_named_params >, edge_centrality_t>, edge_centrality_t, no_property>; typename enable_if_c::traversal_category>::value, graph::detail::no_parameter>::type = graph::detail::no_parameter; typename graph_traits::traversal_category = undir_adj_list_traversal_tag]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/bc_clustering.hpp:131:39: required from ‘void boost::betweenness_centrality_clustering(MutableGraph&, Done, EdgeCentralityMap, VertexIndexMap) [with MutableGraph = adjacency_list >, property > >; Done = clustering_threshold; EdgeCentralityMap = adj_list_edge_property_map >, edge_centrality_t>; VertexIndexMap = vec_adj_list_vertex_id_map >, long unsigned int>]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/bc_clustering.hpp:150:38: required from ‘void boost::betweenness_centrality_clustering(MutableGraph&, Done, EdgeCentralityMap) [with MutableGraph = adjacency_list >, property > >; Done = clustering_threshold; EdgeCentralityMap = adj_list_edge_property_map >, edge_centrality_t>]’ bbc.cpp:149:36: required from here /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:206:17: note: in a call to non-static member function ‘boost::ConvertibleConcept::~ConvertibleConcept()’ 206 | BOOST_concept(Convertible,(X)(Y)) | ^~~~~~~~~~~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/preprocessor/cat.hpp:29:34: note: in definition of macro ‘BOOST_PP_CAT_I’ 29 | # define BOOST_PP_CAT_I(a, b) a ## b | ^ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/concept_def.hpp:23:12: note: in expansion of macro ‘BOOST_PP_CAT’ 23 | struct BOOST_PP_CAT(name,Concept) \ | ^~~~~~~~~~~~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:206:3: note: in expansion of macro ‘BOOST_concept’ 206 | BOOST_concept(Convertible,(X)(Y)) | ^~~~~~~~~~~~~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::Convertible]’: /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements >]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:208:5: required from ‘struct boost::Convertible’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:206:3: required from ‘struct boost::ConvertibleConcept’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::ConvertibleConcept]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied >::value’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:45:51: [ skipping 12 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/betweenness_centrality.hpp:500:43: required from ‘void boost::detail::graph::brandes_betweenness_centrality_dispatch2(const Graph&, CentralityMap, EdgeCentralityMap, VertexIndexMap) [with Graph = boost::adjacency_list >, boost::property > >; CentralityMap = boost::dummy_property_map; EdgeCentralityMap = boost::adj_list_edge_property_map >, boost::edge_centrality_t>; VertexIndexMap = boost::vec_adj_list_vertex_id_map >, long unsigned int>]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/betweenness_centrality.hpp:531:57: required from ‘static void boost::detail::graph::brandes_betweenness_centrality_dispatch1::run(const Graph&, CentralityMap, EdgeCentralityMap, VertexIndexMap, boost::param_not_found) [with Graph = boost::adjacency_list >, boost::property > >; CentralityMap = boost::dummy_property_map; EdgeCentralityMap = boost::adj_list_edge_property_map >, boost::edge_centrality_t>; VertexIndexMap = boost::vec_adj_list_vertex_id_map >, long unsigned int>]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/betweenness_centrality.hpp:558:71: required from ‘void boost::brandes_betweenness_centrality(const Graph&, const bgl_named_params&, typename enable_if_c::traversal_category>::value, graph::detail::no_parameter>::type) [with Graph = adjacency_list >, property > >; Param = vec_adj_list_vertex_id_map >, long unsigned int>; Tag = vertex_index_t; Rest = bgl_named_params >, edge_centrality_t>, edge_centrality_t, no_property>; typename enable_if_c::traversal_category>::value, graph::detail::no_parameter>::type = graph::detail::no_parameter; typename graph_traits::traversal_category = undir_adj_list_traversal_tag]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/bc_clustering.hpp:131:39: required from ‘void boost::betweenness_centrality_clustering(MutableGraph&, Done, EdgeCentralityMap, VertexIndexMap) [with MutableGraph = adjacency_list >, property > >; Done = clustering_threshold; EdgeCentralityMap = adj_list_edge_property_map >, edge_centrality_t>; VertexIndexMap = vec_adj_list_vertex_id_map >, long unsigned int>]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/bc_clustering.hpp:150:38: required from ‘void boost::betweenness_centrality_clustering(MutableGraph&, Done, EdgeCentralityMap) [with MutableGraph = adjacency_list >, property > >; Done = clustering_threshold; EdgeCentralityMap = adj_list_edge_property_map >, edge_centrality_t>]’ bbc.cpp:149:36: required from here /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::Convertible::~Convertible() [with X = boost::lvalue_property_map_tag; Y = boost::read_write_property_map_tag]’ 37 | ~model() | ^ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:208:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 208 | BOOST_CONCEPT_USAGE(Convertible) { | ^~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements >]’: /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:137:5: required from ‘struct boost::DefaultConstructible’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::DefaultConstructible]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied >::value’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_)>’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/graph_concepts.hpp:68:9: [ skipping 15 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/betweenness_centrality.hpp:500:43: required from ‘void boost::detail::graph::brandes_betweenness_centrality_dispatch2(const Graph&, CentralityMap, EdgeCentralityMap, VertexIndexMap) [with Graph = boost::adjacency_list >, boost::property > >; CentralityMap = boost::dummy_property_map; EdgeCentralityMap = boost::adj_list_edge_property_map >, boost::edge_centrality_t>; VertexIndexMap = boost::vec_adj_list_vertex_id_map >, long unsigned int>]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/betweenness_centrality.hpp:531:57: required from ‘static void boost::detail::graph::brandes_betweenness_centrality_dispatch1::run(const Graph&, CentralityMap, EdgeCentralityMap, VertexIndexMap, boost::param_not_found) [with Graph = boost::adjacency_list >, boost::property > >; CentralityMap = boost::dummy_property_map; EdgeCentralityMap = boost::adj_list_edge_property_map >, boost::edge_centrality_t>; VertexIndexMap = boost::vec_adj_list_vertex_id_map >, long unsigned int>]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/betweenness_centrality.hpp:558:71: required from ‘void boost::brandes_betweenness_centrality(const Graph&, const bgl_named_params&, typename enable_if_c::traversal_category>::value, graph::detail::no_parameter>::type) [with Graph = adjacency_list >, property > >; Param = vec_adj_list_vertex_id_map >, long unsigned int>; Tag = vertex_index_t; Rest = bgl_named_params >, edge_centrality_t>, edge_centrality_t, no_property>; typename enable_if_c::traversal_category>::value, graph::detail::no_parameter>::type = graph::detail::no_parameter; typename graph_traits::traversal_category = undir_adj_list_traversal_tag]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/bc_clustering.hpp:131:39: required from ‘void boost::betweenness_centrality_clustering(MutableGraph&, Done, EdgeCentralityMap, VertexIndexMap) [with MutableGraph = adjacency_list >, property > >; Done = clustering_threshold; EdgeCentralityMap = adj_list_edge_property_map >, edge_centrality_t>; VertexIndexMap = vec_adj_list_vertex_id_map >, long unsigned int>]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/bc_clustering.hpp:150:38: required from ‘void boost::betweenness_centrality_clustering(MutableGraph&, Done, EdgeCentralityMap) [with MutableGraph = adjacency_list >, property > >; Done = clustering_threshold; EdgeCentralityMap = adj_list_edge_property_map >, edge_centrality_t>]’ bbc.cpp:149:36: required from here /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::DefaultConstructible]’ 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ^ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::DefaultConstructible]’: /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/graph_concepts.hpp:68:9: required from ‘boost::concepts::Graph::~Graph() [with G = boost::adjacency_list >, boost::property > >]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/usage.hpp:20:48: required from ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::concepts::Graph >, boost::property > > >]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements >, boost::property > > > >]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/graph_concepts.hpp:66:5: required from ‘struct boost::concepts::Graph >, boost::property > > >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/graph_concepts.hpp:75:1: required from ‘struct boost::concepts::IncidenceGraph >, boost::property > > >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/graph_concepts.hpp:75:1: [ skipping 10 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/betweenness_centrality.hpp:500:43: required from ‘void boost::detail::graph::brandes_betweenness_centrality_dispatch2(const Graph&, CentralityMap, EdgeCentralityMap, VertexIndexMap) [with Graph = boost::adjacency_list >, boost::property > >; CentralityMap = boost::dummy_property_map; EdgeCentralityMap = boost::adj_list_edge_property_map >, boost::edge_centrality_t>; VertexIndexMap = boost::vec_adj_list_vertex_id_map >, long unsigned int>]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/betweenness_centrality.hpp:531:57: required from ‘static void boost::detail::graph::brandes_betweenness_centrality_dispatch1::run(const Graph&, CentralityMap, EdgeCentralityMap, VertexIndexMap, boost::param_not_found) [with Graph = boost::adjacency_list >, boost::property > >; CentralityMap = boost::dummy_property_map; EdgeCentralityMap = boost::adj_list_edge_property_map >, boost::edge_centrality_t>; VertexIndexMap = boost::vec_adj_list_vertex_id_map >, long unsigned int>]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/betweenness_centrality.hpp:558:71: required from ‘void boost::brandes_betweenness_centrality(const Graph&, const bgl_named_params&, typename enable_if_c::traversal_category>::value, graph::detail::no_parameter>::type) [with Graph = adjacency_list >, property > >; Param = vec_adj_list_vertex_id_map >, long unsigned int>; Tag = vertex_index_t; Rest = bgl_named_params >, edge_centrality_t>, edge_centrality_t, no_property>; typename enable_if_c::traversal_category>::value, graph::detail::no_parameter>::type = graph::detail::no_parameter; typename graph_traits::traversal_category = undir_adj_list_traversal_tag]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/bc_clustering.hpp:131:39: required from ‘void boost::betweenness_centrality_clustering(MutableGraph&, Done, EdgeCentralityMap, VertexIndexMap) [with MutableGraph = adjacency_list >, property > >; Done = clustering_threshold; EdgeCentralityMap = adj_list_edge_property_map >, edge_centrality_t>; VertexIndexMap = vec_adj_list_vertex_id_map >, long unsigned int>]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/bc_clustering.hpp:150:38: required from ‘void boost::betweenness_centrality_clustering(MutableGraph&, Done, EdgeCentralityMap) [with MutableGraph = adjacency_list >, property > >; Done = clustering_threshold; EdgeCentralityMap = adj_list_edge_property_map >, edge_centrality_t>]’ bbc.cpp:149:36: required from here /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::DefaultConstructible::~DefaultConstructible() [with TT = long unsigned int]’ 37 | ~model() | ^ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:137:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 137 | BOOST_CONCEPT_USAGE(DefaultConstructible) { | ^~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements >]’: /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:233:5: required from ‘struct boost::EqualityComparable’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::EqualityComparable]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied >::value’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_)>’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/graph_concepts.hpp:69:9: [ skipping 15 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/betweenness_centrality.hpp:500:43: required from ‘void boost::detail::graph::brandes_betweenness_centrality_dispatch2(const Graph&, CentralityMap, EdgeCentralityMap, VertexIndexMap) [with Graph = boost::adjacency_list >, boost::property > >; CentralityMap = boost::dummy_property_map; EdgeCentralityMap = boost::adj_list_edge_property_map >, boost::edge_centrality_t>; VertexIndexMap = boost::vec_adj_list_vertex_id_map >, long unsigned int>]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/betweenness_centrality.hpp:531:57: required from ‘static void boost::detail::graph::brandes_betweenness_centrality_dispatch1::run(const Graph&, CentralityMap, EdgeCentralityMap, VertexIndexMap, boost::param_not_found) [with Graph = boost::adjacency_list >, boost::property > >; CentralityMap = boost::dummy_property_map; EdgeCentralityMap = boost::adj_list_edge_property_map >, boost::edge_centrality_t>; VertexIndexMap = boost::vec_adj_list_vertex_id_map >, long unsigned int>]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/betweenness_centrality.hpp:558:71: required from ‘void boost::brandes_betweenness_centrality(const Graph&, const bgl_named_params&, typename enable_if_c::traversal_category>::value, graph::detail::no_parameter>::type) [with Graph = adjacency_list >, property > >; Param = vec_adj_list_vertex_id_map >, long unsigned int>; Tag = vertex_index_t; Rest = bgl_named_params >, edge_centrality_t>, edge_centrality_t, no_property>; typename enable_if_c::traversal_category>::value, graph::detail::no_parameter>::type = graph::detail::no_parameter; typename graph_traits::traversal_category = undir_adj_list_traversal_tag]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/bc_clustering.hpp:131:39: required from ‘void boost::betweenness_centrality_clustering(MutableGraph&, Done, EdgeCentralityMap, VertexIndexMap) [with MutableGraph = adjacency_list >, property > >; Done = clustering_threshold; EdgeCentralityMap = adj_list_edge_property_map >, edge_centrality_t>; VertexIndexMap = vec_adj_list_vertex_id_map >, long unsigned int>]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/bc_clustering.hpp:150:38: required from ‘void boost::betweenness_centrality_clustering(MutableGraph&, Done, EdgeCentralityMap) [with MutableGraph = adjacency_list >, property > >; Done = clustering_threshold; EdgeCentralityMap = adj_list_edge_property_map >, edge_centrality_t>]’ bbc.cpp:149:36: required from here /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::EqualityComparable]’ 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ^ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::EqualityComparable]’: /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/graph_concepts.hpp:69:9: required from ‘boost::concepts::Graph::~Graph() [with G = boost::adjacency_list >, boost::property > >]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/usage.hpp:20:48: required from ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::concepts::Graph >, boost::property > > >]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements >, boost::property > > > >]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/graph_concepts.hpp:66:5: required from ‘struct boost::concepts::Graph >, boost::property > > >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/graph_concepts.hpp:75:1: required from ‘struct boost::concepts::IncidenceGraph >, boost::property > > >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/graph_concepts.hpp:75:1: [ skipping 10 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/betweenness_centrality.hpp:500:43: required from ‘void boost::detail::graph::brandes_betweenness_centrality_dispatch2(const Graph&, CentralityMap, EdgeCentralityMap, VertexIndexMap) [with Graph = boost::adjacency_list >, boost::property > >; CentralityMap = boost::dummy_property_map; EdgeCentralityMap = boost::adj_list_edge_property_map >, boost::edge_centrality_t>; VertexIndexMap = boost::vec_adj_list_vertex_id_map >, long unsigned int>]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/betweenness_centrality.hpp:531:57: required from ‘static void boost::detail::graph::brandes_betweenness_centrality_dispatch1::run(const Graph&, CentralityMap, EdgeCentralityMap, VertexIndexMap, boost::param_not_found) [with Graph = boost::adjacency_list >, boost::property > >; CentralityMap = boost::dummy_property_map; EdgeCentralityMap = boost::adj_list_edge_property_map >, boost::edge_centrality_t>; VertexIndexMap = boost::vec_adj_list_vertex_id_map >, long unsigned int>]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/betweenness_centrality.hpp:558:71: required from ‘void boost::brandes_betweenness_centrality(const Graph&, const bgl_named_params&, typename enable_if_c::traversal_category>::value, graph::detail::no_parameter>::type) [with Graph = adjacency_list >, property > >; Param = vec_adj_list_vertex_id_map >, long unsigned int>; Tag = vertex_index_t; Rest = bgl_named_params >, edge_centrality_t>, edge_centrality_t, no_property>; typename enable_if_c::traversal_category>::value, graph::detail::no_parameter>::type = graph::detail::no_parameter; typename graph_traits::traversal_category = undir_adj_list_traversal_tag]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/bc_clustering.hpp:131:39: required from ‘void boost::betweenness_centrality_clustering(MutableGraph&, Done, EdgeCentralityMap, VertexIndexMap) [with MutableGraph = adjacency_list >, property > >; Done = clustering_threshold; EdgeCentralityMap = adj_list_edge_property_map >, edge_centrality_t>; VertexIndexMap = vec_adj_list_vertex_id_map >, long unsigned int>]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/bc_clustering.hpp:150:38: required from ‘void boost::betweenness_centrality_clustering(MutableGraph&, Done, EdgeCentralityMap) [with MutableGraph = adjacency_list >, property > >; Done = clustering_threshold; EdgeCentralityMap = adj_list_edge_property_map >, edge_centrality_t>]’ bbc.cpp:149:36: required from here /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::EqualityComparable::~EqualityComparable() [with TT = long unsigned int]’ 37 | ~model() | ^ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:233:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 233 | BOOST_CONCEPT_USAGE(EqualityComparable) { | ^~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements >]’: /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:145:5: required from ‘struct boost::Assignable’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::Assignable]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied >::value’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_)>’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/graph_concepts.hpp:70:9: [ skipping 15 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/betweenness_centrality.hpp:500:43: required from ‘void boost::detail::graph::brandes_betweenness_centrality_dispatch2(const Graph&, CentralityMap, EdgeCentralityMap, VertexIndexMap) [with Graph = boost::adjacency_list >, boost::property > >; CentralityMap = boost::dummy_property_map; EdgeCentralityMap = boost::adj_list_edge_property_map >, boost::edge_centrality_t>; VertexIndexMap = boost::vec_adj_list_vertex_id_map >, long unsigned int>]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/betweenness_centrality.hpp:531:57: required from ‘static void boost::detail::graph::brandes_betweenness_centrality_dispatch1::run(const Graph&, CentralityMap, EdgeCentralityMap, VertexIndexMap, boost::param_not_found) [with Graph = boost::adjacency_list >, boost::property > >; CentralityMap = boost::dummy_property_map; EdgeCentralityMap = boost::adj_list_edge_property_map >, boost::edge_centrality_t>; VertexIndexMap = boost::vec_adj_list_vertex_id_map >, long unsigned int>]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/betweenness_centrality.hpp:558:71: required from ‘void boost::brandes_betweenness_centrality(const Graph&, const bgl_named_params&, typename enable_if_c::traversal_category>::value, graph::detail::no_parameter>::type) [with Graph = adjacency_list >, property > >; Param = vec_adj_list_vertex_id_map >, long unsigned int>; Tag = vertex_index_t; Rest = bgl_named_params >, edge_centrality_t>, edge_centrality_t, no_property>; typename enable_if_c::traversal_category>::value, graph::detail::no_parameter>::type = graph::detail::no_parameter; typename graph_traits::traversal_category = undir_adj_list_traversal_tag]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/bc_clustering.hpp:131:39: required from ‘void boost::betweenness_centrality_clustering(MutableGraph&, Done, EdgeCentralityMap, VertexIndexMap) [with MutableGraph = adjacency_list >, property > >; Done = clustering_threshold; EdgeCentralityMap = adj_list_edge_property_map >, edge_centrality_t>; VertexIndexMap = vec_adj_list_vertex_id_map >, long unsigned int>]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/bc_clustering.hpp:150:38: required from ‘void boost::betweenness_centrality_clustering(MutableGraph&, Done, EdgeCentralityMap) [with MutableGraph = adjacency_list >, property > >; Done = clustering_threshold; EdgeCentralityMap = adj_list_edge_property_map >, edge_centrality_t>]’ bbc.cpp:149:36: required from here /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::Assignable]’ 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ^ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::Assignable]’: /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/graph_concepts.hpp:70:9: required from ‘boost::concepts::Graph::~Graph() [with G = boost::adjacency_list >, boost::property > >]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/usage.hpp:20:48: required from ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::concepts::Graph >, boost::property > > >]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements >, boost::property > > > >]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/graph_concepts.hpp:66:5: required from ‘struct boost::concepts::Graph >, boost::property > > >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/graph_concepts.hpp:75:1: required from ‘struct boost::concepts::IncidenceGraph >, boost::property > > >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/graph_concepts.hpp:75:1: [ skipping 10 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/betweenness_centrality.hpp:500:43: required from ‘void boost::detail::graph::brandes_betweenness_centrality_dispatch2(const Graph&, CentralityMap, EdgeCentralityMap, VertexIndexMap) [with Graph = boost::adjacency_list >, boost::property > >; CentralityMap = boost::dummy_property_map; EdgeCentralityMap = boost::adj_list_edge_property_map >, boost::edge_centrality_t>; VertexIndexMap = boost::vec_adj_list_vertex_id_map >, long unsigned int>]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/betweenness_centrality.hpp:531:57: required from ‘static void boost::detail::graph::brandes_betweenness_centrality_dispatch1::run(const Graph&, CentralityMap, EdgeCentralityMap, VertexIndexMap, boost::param_not_found) [with Graph = boost::adjacency_list >, boost::property > >; CentralityMap = boost::dummy_property_map; EdgeCentralityMap = boost::adj_list_edge_property_map >, boost::edge_centrality_t>; VertexIndexMap = boost::vec_adj_list_vertex_id_map >, long unsigned int>]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/betweenness_centrality.hpp:558:71: required from ‘void boost::brandes_betweenness_centrality(const Graph&, const bgl_named_params&, typename enable_if_c::traversal_category>::value, graph::detail::no_parameter>::type) [with Graph = adjacency_list >, property > >; Param = vec_adj_list_vertex_id_map >, long unsigned int>; Tag = vertex_index_t; Rest = bgl_named_params >, edge_centrality_t>, edge_centrality_t, no_property>; typename enable_if_c::traversal_category>::value, graph::detail::no_parameter>::type = graph::detail::no_parameter; typename graph_traits::traversal_category = undir_adj_list_traversal_tag]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/bc_clustering.hpp:131:39: required from ‘void boost::betweenness_centrality_clustering(MutableGraph&, Done, EdgeCentralityMap, VertexIndexMap) [with MutableGraph = adjacency_list >, property > >; Done = clustering_threshold; EdgeCentralityMap = adj_list_edge_property_map >, edge_centrality_t>; VertexIndexMap = vec_adj_list_vertex_id_map >, long unsigned int>]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/bc_clustering.hpp:150:38: required from ‘void boost::betweenness_centrality_clustering(MutableGraph&, Done, EdgeCentralityMap) [with MutableGraph = adjacency_list >, property > >; Done = clustering_threshold; EdgeCentralityMap = adj_list_edge_property_map >, edge_centrality_t>]’ bbc.cpp:149:36: required from here /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::Assignable::~Assignable() [with TT = long unsigned int]’ 37 | ~model() | ^ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:145:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 145 | BOOST_CONCEPT_USAGE(Assignable) { | ^~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::concepts::MultiPassInputIterator > > >, boost::property > >*, std::vector > > >, boost::property > >, std::allocator > > >, boost::property > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> >]’: /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements > > >, boost::property > >*, std::vector > > >, boost::property > >, std::allocator > > >, boost::property > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/graph_concepts.hpp:52:50: required from ‘struct boost::concepts::MultiPassInputIterator > > >, boost::property > >*, std::vector > > >, boost::property > >, std::allocator > > >, boost::property > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::concepts::MultiPassInputIterator > > >, boost::property > >*, std::vector > > >, boost::property > >, std::allocator > > >, boost::property > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> >]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied > > >, boost::property > >*, std::vector > > >, boost::property > >, std::allocator > > >, boost::property > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::value’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied > > >, boost::property > >*, std::vector > > >, boost::property > >, std::allocator > > >, boost::property > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:72:8: [ skipping 8 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/betweenness_centrality.hpp:500:43: required from ‘void boost::detail::graph::brandes_betweenness_centrality_dispatch2(const Graph&, CentralityMap, EdgeCentralityMap, VertexIndexMap) [with Graph = boost::adjacency_list >, boost::property > >; CentralityMap = boost::dummy_property_map; EdgeCentralityMap = boost::adj_list_edge_property_map >, boost::edge_centrality_t>; VertexIndexMap = boost::vec_adj_list_vertex_id_map >, long unsigned int>]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/betweenness_centrality.hpp:531:57: required from ‘static void boost::detail::graph::brandes_betweenness_centrality_dispatch1::run(const Graph&, CentralityMap, EdgeCentralityMap, VertexIndexMap, boost::param_not_found) [with Graph = boost::adjacency_list >, boost::property > >; CentralityMap = boost::dummy_property_map; EdgeCentralityMap = boost::adj_list_edge_property_map >, boost::edge_centrality_t>; VertexIndexMap = boost::vec_adj_list_vertex_id_map >, long unsigned int>]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/betweenness_centrality.hpp:558:71: required from ‘void boost::brandes_betweenness_centrality(const Graph&, const bgl_named_params&, typename enable_if_c::traversal_category>::value, graph::detail::no_parameter>::type) [with Graph = adjacency_list >, property > >; Param = vec_adj_list_vertex_id_map >, long unsigned int>; Tag = vertex_index_t; Rest = bgl_named_params >, edge_centrality_t>, edge_centrality_t, no_property>; typename enable_if_c::traversal_category>::value, graph::detail::no_parameter>::type = graph::detail::no_parameter; typename graph_traits::traversal_category = undir_adj_list_traversal_tag]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/bc_clustering.hpp:131:39: required from ‘void boost::betweenness_centrality_clustering(MutableGraph&, Done, EdgeCentralityMap, VertexIndexMap) [with MutableGraph = adjacency_list >, property > >; Done = clustering_threshold; EdgeCentralityMap = adj_list_edge_property_map >, edge_centrality_t>; VertexIndexMap = vec_adj_list_vertex_id_map >, long unsigned int>]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/bc_clustering.hpp:150:38: required from ‘void boost::betweenness_centrality_clustering(MutableGraph&, Done, EdgeCentralityMap) [with MutableGraph = adjacency_list >, property > >; Done = clustering_threshold; EdgeCentralityMap = adj_list_edge_property_map >, edge_centrality_t>]’ bbc.cpp:149:36: required from here /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::concepts::MultiPassInputIterator::~MultiPassInputIterator() [with T = boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > > >, boost::property > >*, std::vector > > >, boost::property > >, std::allocator > > >, boost::property > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>]’ 37 | ~model() | ^ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/graph_concepts.hpp:52:50: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 52 | BOOST_concept(MultiPassInputIterator, (T)) { BOOST_CONCEPT_USAGE( | ^~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::DefaultConstructible >]’: /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements > >]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:137:5: required from ‘struct boost::DefaultConstructible >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::DefaultConstructible >]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied > >::value’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied > >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:72:8: [ skipping 8 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/betweenness_centrality.hpp:500:43: required from ‘void boost::detail::graph::brandes_betweenness_centrality_dispatch2(const Graph&, CentralityMap, EdgeCentralityMap, VertexIndexMap) [with Graph = boost::adjacency_list >, boost::property > >; CentralityMap = boost::dummy_property_map; EdgeCentralityMap = boost::adj_list_edge_property_map >, boost::edge_centrality_t>; VertexIndexMap = boost::vec_adj_list_vertex_id_map >, long unsigned int>]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/betweenness_centrality.hpp:531:57: required from ‘static void boost::detail::graph::brandes_betweenness_centrality_dispatch1::run(const Graph&, CentralityMap, EdgeCentralityMap, VertexIndexMap, boost::param_not_found) [with Graph = boost::adjacency_list >, boost::property > >; CentralityMap = boost::dummy_property_map; EdgeCentralityMap = boost::adj_list_edge_property_map >, boost::edge_centrality_t>; VertexIndexMap = boost::vec_adj_list_vertex_id_map >, long unsigned int>]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/betweenness_centrality.hpp:558:71: required from ‘void boost::brandes_betweenness_centrality(const Graph&, const bgl_named_params&, typename enable_if_c::traversal_category>::value, graph::detail::no_parameter>::type) [with Graph = adjacency_list >, property > >; Param = vec_adj_list_vertex_id_map >, long unsigned int>; Tag = vertex_index_t; Rest = bgl_named_params >, edge_centrality_t>, edge_centrality_t, no_property>; typename enable_if_c::traversal_category>::value, graph::detail::no_parameter>::type = graph::detail::no_parameter; typename graph_traits::traversal_category = undir_adj_list_traversal_tag]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/bc_clustering.hpp:131:39: required from ‘void boost::betweenness_centrality_clustering(MutableGraph&, Done, EdgeCentralityMap, VertexIndexMap) [with MutableGraph = adjacency_list >, property > >; Done = clustering_threshold; EdgeCentralityMap = adj_list_edge_property_map >, edge_centrality_t>; VertexIndexMap = vec_adj_list_vertex_id_map >, long unsigned int>]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/bc_clustering.hpp:150:38: required from ‘void boost::betweenness_centrality_clustering(MutableGraph&, Done, EdgeCentralityMap) [with MutableGraph = adjacency_list >, property > >; Done = clustering_threshold; EdgeCentralityMap = adj_list_edge_property_map >, edge_centrality_t>]’ bbc.cpp:149:36: required from here /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::DefaultConstructible::~DefaultConstructible() [with TT = boost::detail::edge_desc_impl]’ 37 | ~model() | ^ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:137:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 137 | BOOST_CONCEPT_USAGE(DefaultConstructible) { | ^~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::EqualityComparable >]’: /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements > >]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:233:5: required from ‘struct boost::EqualityComparable >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::EqualityComparable >]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied > >::value’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied > >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:72:8: [ skipping 8 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/betweenness_centrality.hpp:500:43: required from ‘void boost::detail::graph::brandes_betweenness_centrality_dispatch2(const Graph&, CentralityMap, EdgeCentralityMap, VertexIndexMap) [with Graph = boost::adjacency_list >, boost::property > >; CentralityMap = boost::dummy_property_map; EdgeCentralityMap = boost::adj_list_edge_property_map >, boost::edge_centrality_t>; VertexIndexMap = boost::vec_adj_list_vertex_id_map >, long unsigned int>]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/betweenness_centrality.hpp:531:57: required from ‘static void boost::detail::graph::brandes_betweenness_centrality_dispatch1::run(const Graph&, CentralityMap, EdgeCentralityMap, VertexIndexMap, boost::param_not_found) [with Graph = boost::adjacency_list >, boost::property > >; CentralityMap = boost::dummy_property_map; EdgeCentralityMap = boost::adj_list_edge_property_map >, boost::edge_centrality_t>; VertexIndexMap = boost::vec_adj_list_vertex_id_map >, long unsigned int>]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/betweenness_centrality.hpp:558:71: required from ‘void boost::brandes_betweenness_centrality(const Graph&, const bgl_named_params&, typename enable_if_c::traversal_category>::value, graph::detail::no_parameter>::type) [with Graph = adjacency_list >, property > >; Param = vec_adj_list_vertex_id_map >, long unsigned int>; Tag = vertex_index_t; Rest = bgl_named_params >, edge_centrality_t>, edge_centrality_t, no_property>; typename enable_if_c::traversal_category>::value, graph::detail::no_parameter>::type = graph::detail::no_parameter; typename graph_traits::traversal_category = undir_adj_list_traversal_tag]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/bc_clustering.hpp:131:39: required from ‘void boost::betweenness_centrality_clustering(MutableGraph&, Done, EdgeCentralityMap, VertexIndexMap) [with MutableGraph = adjacency_list >, property > >; Done = clustering_threshold; EdgeCentralityMap = adj_list_edge_property_map >, edge_centrality_t>; VertexIndexMap = vec_adj_list_vertex_id_map >, long unsigned int>]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/bc_clustering.hpp:150:38: required from ‘void boost::betweenness_centrality_clustering(MutableGraph&, Done, EdgeCentralityMap) [with MutableGraph = adjacency_list >, property > >; Done = clustering_threshold; EdgeCentralityMap = adj_list_edge_property_map >, edge_centrality_t>]’ bbc.cpp:149:36: required from here /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::EqualityComparable::~EqualityComparable() [with TT = boost::detail::edge_desc_impl]’ 37 | ~model() | ^ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:233:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 233 | BOOST_CONCEPT_USAGE(EqualityComparable) { | ^~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::Assignable >]’: /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements > >]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:145:5: required from ‘struct boost::Assignable >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::Assignable >]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied > >::value’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied > >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:72:8: [ skipping 8 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/betweenness_centrality.hpp:500:43: required from ‘void boost::detail::graph::brandes_betweenness_centrality_dispatch2(const Graph&, CentralityMap, EdgeCentralityMap, VertexIndexMap) [with Graph = boost::adjacency_list >, boost::property > >; CentralityMap = boost::dummy_property_map; EdgeCentralityMap = boost::adj_list_edge_property_map >, boost::edge_centrality_t>; VertexIndexMap = boost::vec_adj_list_vertex_id_map >, long unsigned int>]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/betweenness_centrality.hpp:531:57: required from ‘static void boost::detail::graph::brandes_betweenness_centrality_dispatch1::run(const Graph&, CentralityMap, EdgeCentralityMap, VertexIndexMap, boost::param_not_found) [with Graph = boost::adjacency_list >, boost::property > >; CentralityMap = boost::dummy_property_map; EdgeCentralityMap = boost::adj_list_edge_property_map >, boost::edge_centrality_t>; VertexIndexMap = boost::vec_adj_list_vertex_id_map >, long unsigned int>]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/betweenness_centrality.hpp:558:71: required from ‘void boost::brandes_betweenness_centrality(const Graph&, const bgl_named_params&, typename enable_if_c::traversal_category>::value, graph::detail::no_parameter>::type) [with Graph = adjacency_list >, property > >; Param = vec_adj_list_vertex_id_map >, long unsigned int>; Tag = vertex_index_t; Rest = bgl_named_params >, edge_centrality_t>, edge_centrality_t, no_property>; typename enable_if_c::traversal_category>::value, graph::detail::no_parameter>::type = graph::detail::no_parameter; typename graph_traits::traversal_category = undir_adj_list_traversal_tag]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/bc_clustering.hpp:131:39: required from ‘void boost::betweenness_centrality_clustering(MutableGraph&, Done, EdgeCentralityMap, VertexIndexMap) [with MutableGraph = adjacency_list >, property > >; Done = clustering_threshold; EdgeCentralityMap = adj_list_edge_property_map >, edge_centrality_t>; VertexIndexMap = vec_adj_list_vertex_id_map >, long unsigned int>]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/bc_clustering.hpp:150:38: required from ‘void boost::betweenness_centrality_clustering(MutableGraph&, Done, EdgeCentralityMap) [with MutableGraph = adjacency_list >, property > >; Done = clustering_threshold; EdgeCentralityMap = adj_list_edge_property_map >, edge_centrality_t>]’ bbc.cpp:149:36: required from here /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::Assignable::~Assignable() [with TT = boost::detail::edge_desc_impl]’ 37 | ~model() | ^ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:145:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 145 | BOOST_CONCEPT_USAGE(Assignable) { | ^~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::Convertible]’: /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements >]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:208:5: required from ‘struct boost::Convertible’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::Convertible]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied >::value’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:72:8: [ skipping 8 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/betweenness_centrality.hpp:500:43: required from ‘void boost::detail::graph::brandes_betweenness_centrality_dispatch2(const Graph&, CentralityMap, EdgeCentralityMap, VertexIndexMap) [with Graph = boost::adjacency_list >, boost::property > >; CentralityMap = boost::dummy_property_map; EdgeCentralityMap = boost::adj_list_edge_property_map >, boost::edge_centrality_t>; VertexIndexMap = boost::vec_adj_list_vertex_id_map >, long unsigned int>]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/betweenness_centrality.hpp:531:57: required from ‘static void boost::detail::graph::brandes_betweenness_centrality_dispatch1::run(const Graph&, CentralityMap, EdgeCentralityMap, VertexIndexMap, boost::param_not_found) [with Graph = boost::adjacency_list >, boost::property > >; CentralityMap = boost::dummy_property_map; EdgeCentralityMap = boost::adj_list_edge_property_map >, boost::edge_centrality_t>; VertexIndexMap = boost::vec_adj_list_vertex_id_map >, long unsigned int>]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/betweenness_centrality.hpp:558:71: required from ‘void boost::brandes_betweenness_centrality(const Graph&, const bgl_named_params&, typename enable_if_c::traversal_category>::value, graph::detail::no_parameter>::type) [with Graph = adjacency_list >, property > >; Param = vec_adj_list_vertex_id_map >, long unsigned int>; Tag = vertex_index_t; Rest = bgl_named_params >, edge_centrality_t>, edge_centrality_t, no_property>; typename enable_if_c::traversal_category>::value, graph::detail::no_parameter>::type = graph::detail::no_parameter; typename graph_traits::traversal_category = undir_adj_list_traversal_tag]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/bc_clustering.hpp:131:39: required from ‘void boost::betweenness_centrality_clustering(MutableGraph&, Done, EdgeCentralityMap, VertexIndexMap) [with MutableGraph = adjacency_list >, property > >; Done = clustering_threshold; EdgeCentralityMap = adj_list_edge_property_map >, edge_centrality_t>; VertexIndexMap = vec_adj_list_vertex_id_map >, long unsigned int>]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/bc_clustering.hpp:150:38: required from ‘void boost::betweenness_centrality_clustering(MutableGraph&, Done, EdgeCentralityMap) [with MutableGraph = adjacency_list >, property > >; Done = clustering_threshold; EdgeCentralityMap = adj_list_edge_property_map >, edge_centrality_t>]’ bbc.cpp:149:36: required from here /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::Convertible::~Convertible() [with X = boost::undir_adj_list_traversal_tag; Y = boost::incidence_graph_tag]’ 37 | ~model() | ^ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:208:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 208 | BOOST_CONCEPT_USAGE(Convertible) { | ^~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::Convertible]’: /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements >]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:208:5: required from ‘struct boost::Convertible’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:206:3: required from ‘struct boost::ConvertibleConcept’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::ConvertibleConcept]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied >::value’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:45:51: [ skipping 17 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/betweenness_centrality.hpp:500:43: required from ‘void boost::detail::graph::brandes_betweenness_centrality_dispatch2(const Graph&, CentralityMap, EdgeCentralityMap, VertexIndexMap) [with Graph = boost::adjacency_list >, boost::property > >; CentralityMap = boost::dummy_property_map; EdgeCentralityMap = boost::adj_list_edge_property_map >, boost::edge_centrality_t>; VertexIndexMap = boost::vec_adj_list_vertex_id_map >, long unsigned int>]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/betweenness_centrality.hpp:531:57: required from ‘static void boost::detail::graph::brandes_betweenness_centrality_dispatch1::run(const Graph&, CentralityMap, EdgeCentralityMap, VertexIndexMap, boost::param_not_found) [with Graph = boost::adjacency_list >, boost::property > >; CentralityMap = boost::dummy_property_map; EdgeCentralityMap = boost::adj_list_edge_property_map >, boost::edge_centrality_t>; VertexIndexMap = boost::vec_adj_list_vertex_id_map >, long unsigned int>]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/betweenness_centrality.hpp:558:71: required from ‘void boost::brandes_betweenness_centrality(const Graph&, const bgl_named_params&, typename enable_if_c::traversal_category>::value, graph::detail::no_parameter>::type) [with Graph = adjacency_list >, property > >; Param = vec_adj_list_vertex_id_map >, long unsigned int>; Tag = vertex_index_t; Rest = bgl_named_params >, edge_centrality_t>, edge_centrality_t, no_property>; typename enable_if_c::traversal_category>::value, graph::detail::no_parameter>::type = graph::detail::no_parameter; typename graph_traits::traversal_category = undir_adj_list_traversal_tag]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/bc_clustering.hpp:131:39: required from ‘void boost::betweenness_centrality_clustering(MutableGraph&, Done, EdgeCentralityMap, VertexIndexMap) [with MutableGraph = adjacency_list >, property > >; Done = clustering_threshold; EdgeCentralityMap = adj_list_edge_property_map >, edge_centrality_t>; VertexIndexMap = vec_adj_list_vertex_id_map >, long unsigned int>]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/bc_clustering.hpp:150:38: required from ‘void boost::betweenness_centrality_clustering(MutableGraph&, Done, EdgeCentralityMap) [with MutableGraph = adjacency_list >, property > >; Done = clustering_threshold; EdgeCentralityMap = adj_list_edge_property_map >, edge_centrality_t>]’ bbc.cpp:149:36: required from here /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::Convertible::~Convertible() [with X = boost::lvalue_property_map_tag; Y = boost::readable_property_map_tag]’ 37 | ~model() | ^ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:208:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 208 | BOOST_CONCEPT_USAGE(Convertible) { | ^~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::Convertible]’: /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements >]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:208:5: required from ‘struct boost::Convertible’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:206:3: required from ‘struct boost::ConvertibleConcept’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::ConvertibleConcept]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied >::value’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:45:51: [ skipping 17 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/betweenness_centrality.hpp:500:43: required from ‘void boost::detail::graph::brandes_betweenness_centrality_dispatch2(const Graph&, CentralityMap, EdgeCentralityMap, VertexIndexMap) [with Graph = boost::adjacency_list >, boost::property > >; CentralityMap = boost::dummy_property_map; EdgeCentralityMap = boost::adj_list_edge_property_map >, boost::edge_centrality_t>; VertexIndexMap = boost::vec_adj_list_vertex_id_map >, long unsigned int>]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/betweenness_centrality.hpp:531:57: required from ‘static void boost::detail::graph::brandes_betweenness_centrality_dispatch1::run(const Graph&, CentralityMap, EdgeCentralityMap, VertexIndexMap, boost::param_not_found) [with Graph = boost::adjacency_list >, boost::property > >; CentralityMap = boost::dummy_property_map; EdgeCentralityMap = boost::adj_list_edge_property_map >, boost::edge_centrality_t>; VertexIndexMap = boost::vec_adj_list_vertex_id_map >, long unsigned int>]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/betweenness_centrality.hpp:558:71: required from ‘void boost::brandes_betweenness_centrality(const Graph&, const bgl_named_params&, typename enable_if_c::traversal_category>::value, graph::detail::no_parameter>::type) [with Graph = adjacency_list >, property > >; Param = vec_adj_list_vertex_id_map >, long unsigned int>; Tag = vertex_index_t; Rest = bgl_named_params >, edge_centrality_t>, edge_centrality_t, no_property>; typename enable_if_c::traversal_category>::value, graph::detail::no_parameter>::type = graph::detail::no_parameter; typename graph_traits::traversal_category = undir_adj_list_traversal_tag]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/bc_clustering.hpp:131:39: required from ‘void boost::betweenness_centrality_clustering(MutableGraph&, Done, EdgeCentralityMap, VertexIndexMap) [with MutableGraph = adjacency_list >, property > >; Done = clustering_threshold; EdgeCentralityMap = adj_list_edge_property_map >, edge_centrality_t>; VertexIndexMap = vec_adj_list_vertex_id_map >, long unsigned int>]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/bc_clustering.hpp:150:38: required from ‘void boost::betweenness_centrality_clustering(MutableGraph&, Done, EdgeCentralityMap) [with MutableGraph = adjacency_list >, property > >; Done = clustering_threshold; EdgeCentralityMap = adj_list_edge_property_map >, edge_centrality_t>]’ bbc.cpp:149:36: required from here /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::Convertible::~Convertible() [with X = boost::lvalue_property_map_tag; Y = boost::writable_property_map_tag]’ 37 | ~model() | ^ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:208:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 208 | BOOST_CONCEPT_USAGE(Convertible) { | ^~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::DefaultConstructible]’: /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements >]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:137:5: required from ‘struct boost::DefaultConstructible’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::DefaultConstructible]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied >::value’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:72:8: [ skipping 16 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/betweenness_centrality.hpp:500:43: required from ‘void boost::detail::graph::brandes_betweenness_centrality_dispatch2(const Graph&, CentralityMap, EdgeCentralityMap, VertexIndexMap) [with Graph = boost::adjacency_list >, boost::property > >; CentralityMap = boost::dummy_property_map; EdgeCentralityMap = boost::adj_list_edge_property_map >, boost::edge_centrality_t>; VertexIndexMap = boost::vec_adj_list_vertex_id_map >, long unsigned int>]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/betweenness_centrality.hpp:531:57: required from ‘static void boost::detail::graph::brandes_betweenness_centrality_dispatch1::run(const Graph&, CentralityMap, EdgeCentralityMap, VertexIndexMap, boost::param_not_found) [with Graph = boost::adjacency_list >, boost::property > >; CentralityMap = boost::dummy_property_map; EdgeCentralityMap = boost::adj_list_edge_property_map >, boost::edge_centrality_t>; VertexIndexMap = boost::vec_adj_list_vertex_id_map >, long unsigned int>]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/betweenness_centrality.hpp:558:71: required from ‘void boost::brandes_betweenness_centrality(const Graph&, const bgl_named_params&, typename enable_if_c::traversal_category>::value, graph::detail::no_parameter>::type) [with Graph = adjacency_list >, property > >; Param = vec_adj_list_vertex_id_map >, long unsigned int>; Tag = vertex_index_t; Rest = bgl_named_params >, edge_centrality_t>, edge_centrality_t, no_property>; typename enable_if_c::traversal_category>::value, graph::detail::no_parameter>::type = graph::detail::no_parameter; typename graph_traits::traversal_category = undir_adj_list_traversal_tag]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/bc_clustering.hpp:131:39: required from ‘void boost::betweenness_centrality_clustering(MutableGraph&, Done, EdgeCentralityMap, VertexIndexMap) [with MutableGraph = adjacency_list >, property > >; Done = clustering_threshold; EdgeCentralityMap = adj_list_edge_property_map >, edge_centrality_t>; VertexIndexMap = vec_adj_list_vertex_id_map >, long unsigned int>]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/bc_clustering.hpp:150:38: required from ‘void boost::betweenness_centrality_clustering(MutableGraph&, Done, EdgeCentralityMap) [with MutableGraph = adjacency_list >, property > >; Done = clustering_threshold; EdgeCentralityMap = adj_list_edge_property_map >, edge_centrality_t>]’ bbc.cpp:149:36: required from here /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::DefaultConstructible::~DefaultConstructible() [with TT = long unsigned int]’ 37 | ~model() | ^ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:137:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 137 | BOOST_CONCEPT_USAGE(DefaultConstructible) { | ^~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::EqualityComparable]’: /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements >]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:233:5: required from ‘struct boost::EqualityComparable’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::EqualityComparable]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied >::value’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:72:8: [ skipping 16 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/betweenness_centrality.hpp:500:43: required from ‘void boost::detail::graph::brandes_betweenness_centrality_dispatch2(const Graph&, CentralityMap, EdgeCentralityMap, VertexIndexMap) [with Graph = boost::adjacency_list >, boost::property > >; CentralityMap = boost::dummy_property_map; EdgeCentralityMap = boost::adj_list_edge_property_map >, boost::edge_centrality_t>; VertexIndexMap = boost::vec_adj_list_vertex_id_map >, long unsigned int>]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/betweenness_centrality.hpp:531:57: required from ‘static void boost::detail::graph::brandes_betweenness_centrality_dispatch1::run(const Graph&, CentralityMap, EdgeCentralityMap, VertexIndexMap, boost::param_not_found) [with Graph = boost::adjacency_list >, boost::property > >; CentralityMap = boost::dummy_property_map; EdgeCentralityMap = boost::adj_list_edge_property_map >, boost::edge_centrality_t>; VertexIndexMap = boost::vec_adj_list_vertex_id_map >, long unsigned int>]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/betweenness_centrality.hpp:558:71: required from ‘void boost::brandes_betweenness_centrality(const Graph&, const bgl_named_params&, typename enable_if_c::traversal_category>::value, graph::detail::no_parameter>::type) [with Graph = adjacency_list >, property > >; Param = vec_adj_list_vertex_id_map >, long unsigned int>; Tag = vertex_index_t; Rest = bgl_named_params >, edge_centrality_t>, edge_centrality_t, no_property>; typename enable_if_c::traversal_category>::value, graph::detail::no_parameter>::type = graph::detail::no_parameter; typename graph_traits::traversal_category = undir_adj_list_traversal_tag]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/bc_clustering.hpp:131:39: required from ‘void boost::betweenness_centrality_clustering(MutableGraph&, Done, EdgeCentralityMap, VertexIndexMap) [with MutableGraph = adjacency_list >, property > >; Done = clustering_threshold; EdgeCentralityMap = adj_list_edge_property_map >, edge_centrality_t>; VertexIndexMap = vec_adj_list_vertex_id_map >, long unsigned int>]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/bc_clustering.hpp:150:38: required from ‘void boost::betweenness_centrality_clustering(MutableGraph&, Done, EdgeCentralityMap) [with MutableGraph = adjacency_list >, property > >; Done = clustering_threshold; EdgeCentralityMap = adj_list_edge_property_map >, edge_centrality_t>]’ bbc.cpp:149:36: required from here /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::EqualityComparable::~EqualityComparable() [with TT = long unsigned int]’ 37 | ~model() | ^ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:233:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 233 | BOOST_CONCEPT_USAGE(EqualityComparable) { | ^~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::Assignable]’: /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements >]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:145:5: required from ‘struct boost::Assignable’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::Assignable]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied >::value’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:72:8: [ skipping 16 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/betweenness_centrality.hpp:500:43: required from ‘void boost::detail::graph::brandes_betweenness_centrality_dispatch2(const Graph&, CentralityMap, EdgeCentralityMap, VertexIndexMap) [with Graph = boost::adjacency_list >, boost::property > >; CentralityMap = boost::dummy_property_map; EdgeCentralityMap = boost::adj_list_edge_property_map >, boost::edge_centrality_t>; VertexIndexMap = boost::vec_adj_list_vertex_id_map >, long unsigned int>]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/betweenness_centrality.hpp:531:57: required from ‘static void boost::detail::graph::brandes_betweenness_centrality_dispatch1::run(const Graph&, CentralityMap, EdgeCentralityMap, VertexIndexMap, boost::param_not_found) [with Graph = boost::adjacency_list >, boost::property > >; CentralityMap = boost::dummy_property_map; EdgeCentralityMap = boost::adj_list_edge_property_map >, boost::edge_centrality_t>; VertexIndexMap = boost::vec_adj_list_vertex_id_map >, long unsigned int>]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/betweenness_centrality.hpp:558:71: required from ‘void boost::brandes_betweenness_centrality(const Graph&, const bgl_named_params&, typename enable_if_c::traversal_category>::value, graph::detail::no_parameter>::type) [with Graph = adjacency_list >, property > >; Param = vec_adj_list_vertex_id_map >, long unsigned int>; Tag = vertex_index_t; Rest = bgl_named_params >, edge_centrality_t>, edge_centrality_t, no_property>; typename enable_if_c::traversal_category>::value, graph::detail::no_parameter>::type = graph::detail::no_parameter; typename graph_traits::traversal_category = undir_adj_list_traversal_tag]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/bc_clustering.hpp:131:39: required from ‘void boost::betweenness_centrality_clustering(MutableGraph&, Done, EdgeCentralityMap, VertexIndexMap) [with MutableGraph = adjacency_list >, property > >; Done = clustering_threshold; EdgeCentralityMap = adj_list_edge_property_map >, edge_centrality_t>; VertexIndexMap = vec_adj_list_vertex_id_map >, long unsigned int>]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/bc_clustering.hpp:150:38: required from ‘void boost::betweenness_centrality_clustering(MutableGraph&, Done, EdgeCentralityMap) [with MutableGraph = adjacency_list >, property > >; Done = clustering_threshold; EdgeCentralityMap = adj_list_edge_property_map >, edge_centrality_t>]’ bbc.cpp:149:36: required from here /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::Assignable::~Assignable() [with TT = long unsigned int]’ 37 | ~model() | ^ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:145:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 145 | BOOST_CONCEPT_USAGE(Assignable) { | ^~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements > > >, boost::property > >*, std::vector > > >, boost::property > >, std::allocator > > >, boost::property > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >]’: /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:145:5: required from ‘struct boost::Assignable > > >, boost::property > >*, std::vector > > >, boost::property > >, std::allocator > > >, boost::property > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:502:3: required from ‘struct boost::InputIterator > > >, boost::property > >*, std::vector > > >, boost::property > >, std::allocator > > >, boost::property > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::InputIterator > > >, boost::property > >*, std::vector > > >, boost::property > >, std::allocator > > >, boost::property > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> >]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied > > >, boost::property > >*, std::vector > > >, boost::property > >, std::allocator > > >, boost::property > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::value’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied > > >, boost::property > >*, std::vector > > >, boost::property > >, std::allocator > > >, boost::property > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:72:8: [ skipping 10 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/betweenness_centrality.hpp:500:43: required from ‘void boost::detail::graph::brandes_betweenness_centrality_dispatch2(const Graph&, CentralityMap, EdgeCentralityMap, VertexIndexMap) [with Graph = boost::adjacency_list >, boost::property > >; CentralityMap = boost::dummy_property_map; EdgeCentralityMap = boost::adj_list_edge_property_map >, boost::edge_centrality_t>; VertexIndexMap = boost::vec_adj_list_vertex_id_map >, long unsigned int>]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/betweenness_centrality.hpp:531:57: required from ‘static void boost::detail::graph::brandes_betweenness_centrality_dispatch1::run(const Graph&, CentralityMap, EdgeCentralityMap, VertexIndexMap, boost::param_not_found) [with Graph = boost::adjacency_list >, boost::property > >; CentralityMap = boost::dummy_property_map; EdgeCentralityMap = boost::adj_list_edge_property_map >, boost::edge_centrality_t>; VertexIndexMap = boost::vec_adj_list_vertex_id_map >, long unsigned int>]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/betweenness_centrality.hpp:558:71: required from ‘void boost::brandes_betweenness_centrality(const Graph&, const bgl_named_params&, typename enable_if_c::traversal_category>::value, graph::detail::no_parameter>::type) [with Graph = adjacency_list >, property > >; Param = vec_adj_list_vertex_id_map >, long unsigned int>; Tag = vertex_index_t; Rest = bgl_named_params >, edge_centrality_t>, edge_centrality_t, no_property>; typename enable_if_c::traversal_category>::value, graph::detail::no_parameter>::type = graph::detail::no_parameter; typename graph_traits::traversal_category = undir_adj_list_traversal_tag]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/bc_clustering.hpp:131:39: required from ‘void boost::betweenness_centrality_clustering(MutableGraph&, Done, EdgeCentralityMap, VertexIndexMap) [with MutableGraph = adjacency_list >, property > >; Done = clustering_threshold; EdgeCentralityMap = adj_list_edge_property_map >, edge_centrality_t>; VertexIndexMap = vec_adj_list_vertex_id_map >, long unsigned int>]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/bc_clustering.hpp:150:38: required from ‘void boost::betweenness_centrality_clustering(MutableGraph&, Done, EdgeCentralityMap) [with MutableGraph = adjacency_list >, property > >; Done = clustering_threshold; EdgeCentralityMap = adj_list_edge_property_map >, edge_centrality_t>]’ bbc.cpp:149:36: required from here /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::Assignable > > >, boost::property > >*, std::vector > > >, boost::property > >, std::allocator > > >, boost::property > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> >]’ 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ^ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements > > >, boost::property > >*, std::vector > > >, boost::property > >, std::allocator > > >, boost::property > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >]’: /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:233:5: required from ‘struct boost::EqualityComparable > > >, boost::property > >*, std::vector > > >, boost::property > >, std::allocator > > >, boost::property > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:502:3: required from ‘struct boost::InputIterator > > >, boost::property > >*, std::vector > > >, boost::property > >, std::allocator > > >, boost::property > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::InputIterator > > >, boost::property > >*, std::vector > > >, boost::property > >, std::allocator > > >, boost::property > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> >]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied > > >, boost::property > >*, std::vector > > >, boost::property > >, std::allocator > > >, boost::property > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::value’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied > > >, boost::property > >*, std::vector > > >, boost::property > >, std::allocator > > >, boost::property > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:72:8: [ skipping 10 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/betweenness_centrality.hpp:500:43: required from ‘void boost::detail::graph::brandes_betweenness_centrality_dispatch2(const Graph&, CentralityMap, EdgeCentralityMap, VertexIndexMap) [with Graph = boost::adjacency_list >, boost::property > >; CentralityMap = boost::dummy_property_map; EdgeCentralityMap = boost::adj_list_edge_property_map >, boost::edge_centrality_t>; VertexIndexMap = boost::vec_adj_list_vertex_id_map >, long unsigned int>]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/betweenness_centrality.hpp:531:57: required from ‘static void boost::detail::graph::brandes_betweenness_centrality_dispatch1::run(const Graph&, CentralityMap, EdgeCentralityMap, VertexIndexMap, boost::param_not_found) [with Graph = boost::adjacency_list >, boost::property > >; CentralityMap = boost::dummy_property_map; EdgeCentralityMap = boost::adj_list_edge_property_map >, boost::edge_centrality_t>; VertexIndexMap = boost::vec_adj_list_vertex_id_map >, long unsigned int>]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/betweenness_centrality.hpp:558:71: required from ‘void boost::brandes_betweenness_centrality(const Graph&, const bgl_named_params&, typename enable_if_c::traversal_category>::value, graph::detail::no_parameter>::type) [with Graph = adjacency_list >, property > >; Param = vec_adj_list_vertex_id_map >, long unsigned int>; Tag = vertex_index_t; Rest = bgl_named_params >, edge_centrality_t>, edge_centrality_t, no_property>; typename enable_if_c::traversal_category>::value, graph::detail::no_parameter>::type = graph::detail::no_parameter; typename graph_traits::traversal_category = undir_adj_list_traversal_tag]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/bc_clustering.hpp:131:39: required from ‘void boost::betweenness_centrality_clustering(MutableGraph&, Done, EdgeCentralityMap, VertexIndexMap) [with MutableGraph = adjacency_list >, property > >; Done = clustering_threshold; EdgeCentralityMap = adj_list_edge_property_map >, edge_centrality_t>; VertexIndexMap = vec_adj_list_vertex_id_map >, long unsigned int>]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/bc_clustering.hpp:150:38: required from ‘void boost::betweenness_centrality_clustering(MutableGraph&, Done, EdgeCentralityMap) [with MutableGraph = adjacency_list >, property > >; Done = clustering_threshold; EdgeCentralityMap = adj_list_edge_property_map >, edge_centrality_t>]’ bbc.cpp:149:36: required from here /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::EqualityComparable > > >, boost::property > >*, std::vector > > >, boost::property > >, std::allocator > > >, boost::property > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> >]’ 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ^ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements > > >, boost::property > >*, std::vector > > >, boost::property > >, std::allocator > > >, boost::property > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >]’: /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:512:7: required from ‘struct boost::InputIterator > > >, boost::property > >*, std::vector > > >, boost::property > >, std::allocator > > >, boost::property > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::InputIterator > > >, boost::property > >*, std::vector > > >, boost::property > >, std::allocator > > >, boost::property > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> >]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied > > >, boost::property > >*, std::vector > > >, boost::property > >, std::allocator > > >, boost::property > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::value’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied > > >, boost::property > >*, std::vector > > >, boost::property > >, std::allocator > > >, boost::property > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_ > > >, boost::property > >*, std::vector > > >, boost::property > >, std::allocator > > >, boost::property > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> >)>’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/graph_concepts.hpp:53:35: [ skipping 9 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/betweenness_centrality.hpp:500:43: required from ‘void boost::detail::graph::brandes_betweenness_centrality_dispatch2(const Graph&, CentralityMap, EdgeCentralityMap, VertexIndexMap) [with Graph = boost::adjacency_list >, boost::property > >; CentralityMap = boost::dummy_property_map; EdgeCentralityMap = boost::adj_list_edge_property_map >, boost::edge_centrality_t>; VertexIndexMap = boost::vec_adj_list_vertex_id_map >, long unsigned int>]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/betweenness_centrality.hpp:531:57: required from ‘static void boost::detail::graph::brandes_betweenness_centrality_dispatch1::run(const Graph&, CentralityMap, EdgeCentralityMap, VertexIndexMap, boost::param_not_found) [with Graph = boost::adjacency_list >, boost::property > >; CentralityMap = boost::dummy_property_map; EdgeCentralityMap = boost::adj_list_edge_property_map >, boost::edge_centrality_t>; VertexIndexMap = boost::vec_adj_list_vertex_id_map >, long unsigned int>]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/betweenness_centrality.hpp:558:71: required from ‘void boost::brandes_betweenness_centrality(const Graph&, const bgl_named_params&, typename enable_if_c::traversal_category>::value, graph::detail::no_parameter>::type) [with Graph = adjacency_list >, property > >; Param = vec_adj_list_vertex_id_map >, long unsigned int>; Tag = vertex_index_t; Rest = bgl_named_params >, edge_centrality_t>, edge_centrality_t, no_property>; typename enable_if_c::traversal_category>::value, graph::detail::no_parameter>::type = graph::detail::no_parameter; typename graph_traits::traversal_category = undir_adj_list_traversal_tag]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/bc_clustering.hpp:131:39: required from ‘void boost::betweenness_centrality_clustering(MutableGraph&, Done, EdgeCentralityMap, VertexIndexMap) [with MutableGraph = adjacency_list >, property > >; Done = clustering_threshold; EdgeCentralityMap = adj_list_edge_property_map >, edge_centrality_t>; VertexIndexMap = vec_adj_list_vertex_id_map >, long unsigned int>]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/bc_clustering.hpp:150:38: required from ‘void boost::betweenness_centrality_clustering(MutableGraph&, Done, EdgeCentralityMap) [with MutableGraph = adjacency_list >, property > >; Done = clustering_threshold; EdgeCentralityMap = adj_list_edge_property_map >, edge_centrality_t>]’ bbc.cpp:149:36: required from here /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::InputIterator > > >, boost::property > >*, std::vector > > >, boost::property > >, std::allocator > > >, boost::property > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> >]’ 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ^ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::InputIterator > > >, boost::property > >*, std::vector > > >, boost::property > >, std::allocator > > >, boost::property > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> >]’: /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/graph_concepts.hpp:53:35: required from ‘boost::concepts::MultiPassInputIterator::~MultiPassInputIterator() [with T = boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > > >, boost::property > >*, std::vector > > >, boost::property > >, std::allocator > > >, boost::property > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::MultiPassInputIterator > > >, boost::property > >*, std::vector > > >, boost::property > >, std::allocator > > >, boost::property > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> >]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/graph_concepts.hpp:89:9: required from ‘boost::concepts::IncidenceGraph::~IncidenceGraph() [with G = boost::adjacency_list >, boost::property > >]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/graph_concepts.hpp:75:1: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::IncidenceGraphConcept >, boost::property > > >]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/depth_first_search.hpp:129:9: required from ‘void boost::breadth_first_visit(const IncidenceGraph&, SourceIterator, SourceIterator, Buffer&, BFSVisitor, ColorMap) [with IncidenceGraph = adjacency_list >, property > >; Buffer = queue > >; BFSVisitor = detail::graph::brandes_unweighted_shortest_paths::visitor_type >, property > >, iterator_property_map<__gnu_cxx::__normal_iterator, std::allocator > >*, std::vector, std::allocator > >, std::allocator, std::allocator > > > > >, vec_adj_list_vertex_id_map >, long unsigned int>, std::vector, std::allocator > >, std::vector, std::allocator > >&>, iterator_property_map<__gnu_cxx::__normal_iterator > >, vec_adj_list_vertex_id_map >, long unsigned int>, double, double&>, iterator_property_map<__gnu_cxx::__normal_iterator > >, vec_adj_list_vertex_id_map >, long unsigned int>, long unsigned int, long unsigned int&> >; ColorMap = iterator_property_map<__gnu_cxx::__normal_iterator >, vec_adj_list_vertex_id_map >, long unsigned int>, default_color_type, default_color_type&>; SourceIterator = long unsigned int*]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/breadth_first_search.hpp:118:24: [ skipping 4 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/betweenness_centrality.hpp:500:43: required from ‘void boost::detail::graph::brandes_betweenness_centrality_dispatch2(const Graph&, CentralityMap, EdgeCentralityMap, VertexIndexMap) [with Graph = boost::adjacency_list >, boost::property > >; CentralityMap = boost::dummy_property_map; EdgeCentralityMap = boost::adj_list_edge_property_map >, boost::edge_centrality_t>; VertexIndexMap = boost::vec_adj_list_vertex_id_map >, long unsigned int>]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/betweenness_centrality.hpp:531:57: required from ‘static void boost::detail::graph::brandes_betweenness_centrality_dispatch1::run(const Graph&, CentralityMap, EdgeCentralityMap, VertexIndexMap, boost::param_not_found) [with Graph = boost::adjacency_list >, boost::property > >; CentralityMap = boost::dummy_property_map; EdgeCentralityMap = boost::adj_list_edge_property_map >, boost::edge_centrality_t>; VertexIndexMap = boost::vec_adj_list_vertex_id_map >, long unsigned int>]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/betweenness_centrality.hpp:558:71: required from ‘void boost::brandes_betweenness_centrality(const Graph&, const bgl_named_params&, typename enable_if_c::traversal_category>::value, graph::detail::no_parameter>::type) [with Graph = adjacency_list >, property > >; Param = vec_adj_list_vertex_id_map >, long unsigned int>; Tag = vertex_index_t; Rest = bgl_named_params >, edge_centrality_t>, edge_centrality_t, no_property>; typename enable_if_c::traversal_category>::value, graph::detail::no_parameter>::type = graph::detail::no_parameter; typename graph_traits::traversal_category = undir_adj_list_traversal_tag]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/bc_clustering.hpp:131:39: required from ‘void boost::betweenness_centrality_clustering(MutableGraph&, Done, EdgeCentralityMap, VertexIndexMap) [with MutableGraph = adjacency_list >, property > >; Done = clustering_threshold; EdgeCentralityMap = adj_list_edge_property_map >, edge_centrality_t>; VertexIndexMap = vec_adj_list_vertex_id_map >, long unsigned int>]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/bc_clustering.hpp:150:38: required from ‘void boost::betweenness_centrality_clustering(MutableGraph&, Done, EdgeCentralityMap) [with MutableGraph = adjacency_list >, property > >; Done = clustering_threshold; EdgeCentralityMap = adj_list_edge_property_map >, edge_centrality_t>]’ bbc.cpp:149:36: required from here /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::InputIterator::~InputIterator() [with TT = boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > > >, boost::property > >*, std::vector > > >, boost::property > >, std::allocator > > >, boost::property > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>]’ 37 | ~model() | ^ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:512:7: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 512 | BOOST_CONCEPT_USAGE(InputIterator) | ^~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::constraint::failed() [with Model = boost::BFSVisitorConcept >, boost::property > >, boost::adj_list_edge_property_map >, boost::edge_weight_t>, boost::iterator_property_map<__gnu_cxx::__normal_iterator, std::allocator > >*, std::vector, std::allocator > >, std::allocator, std::allocator > > > > >, boost::vec_adj_list_vertex_id_map >, long unsigned int>, std::vector, std::allocator > >, std::vector, std::allocator > >&>, boost::iterator_property_map<__gnu_cxx::__normal_iterator > >, boost::vec_adj_list_vertex_id_map >, long unsigned int>, double, double&>, boost::iterator_property_map<__gnu_cxx::__normal_iterator > >, boost::vec_adj_list_vertex_id_map >, long unsigned int>, long unsigned int, long unsigned int&> >, boost::d_ary_heap_indirect >, long unsigned int>, long unsigned int, long unsigned int&>, boost::iterator_property_map<__gnu_cxx::__normal_iterator > >, boost::vec_adj_list_vertex_id_map >, long unsigned int>, double, double&>, std::less, std::vector > >, boost::adj_list_edge_property_map >, boost::edge_weight_t>, boost::dummy_property_map, boost::iterator_property_map<__gnu_cxx::__normal_iterator > >, boost::vec_adj_list_vertex_id_map >, long unsigned int>, double, double&>, std::plus, std::less >, boost::adjacency_list >, boost::property > > >]’: /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/breadth_first_search.hpp:65:5: required from ‘void boost::breadth_first_visit(const IncidenceGraph&, SourceIterator, SourceIterator, Buffer&, BFSVisitor, ColorMap) [with IncidenceGraph = adjacency_list >, property > >; Buffer = d_ary_heap_indirect >, long unsigned int>, long unsigned int, long unsigned int&>, iterator_property_map<__gnu_cxx::__normal_iterator > >, vec_adj_list_vertex_id_map >, long unsigned int>, double, double&>, std::less, std::vector > >; BFSVisitor = detail::dijkstra_bfs_visitor >, property > >, adj_list_edge_property_map >, edge_weight_t>, iterator_property_map<__gnu_cxx::__normal_iterator, std::allocator > >*, std::vector, std::allocator > >, std::allocator, std::allocator > > > > >, vec_adj_list_vertex_id_map >, long unsigned int>, std::vector, std::allocator > >, std::vector, std::allocator > >&>, iterator_property_map<__gnu_cxx::__normal_iterator > >, vec_adj_list_vertex_id_map >, long unsigned int>, double, double&>, iterator_property_map<__gnu_cxx::__normal_iterator > >, vec_adj_list_vertex_id_map >, long unsigned int>, long unsigned int, long unsigned int&> >, d_ary_heap_indirect >, long unsigned int>, long unsigned int, long unsigned int&>, iterator_property_map<__gnu_cxx::__normal_iterator > >, vec_adj_list_vertex_id_map >, long unsigned int>, double, double&>, std::less, std::vector > >, adj_list_edge_property_map >, edge_weight_t>, dummy_property_map, iterator_property_map<__gnu_cxx::__normal_iterator > >, vec_adj_list_vertex_id_map >, long unsigned int>, double, double&>, std::plus, std::less >; ColorMap = two_bit_color_map >, long unsigned int> >; SourceIterator = long unsigned int*]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/dijkstra_shortest_paths.hpp:387:24: required from ‘void boost::dijkstra_shortest_paths_no_init(const Graph&, SourceInputIter, SourceInputIter, PredecessorMap, DistanceMap, WeightMap, IndexMap, Compare, Combine, DistZero, DijkstraVisitor, ColorMap) [with Graph = adjacency_list >, property > >; SourceInputIter = long unsigned int*; DijkstraVisitor = detail::graph::brandes_dijkstra_visitor >, property > >, adj_list_edge_property_map >, edge_weight_t>, iterator_property_map<__gnu_cxx::__normal_iterator, std::allocator > >*, std::vector, std::allocator > >, std::allocator, std::allocator > > > > >, vec_adj_list_vertex_id_map >, long unsigned int>, std::vector, std::allocator > >, std::vector, std::allocator > >&>, iterator_property_map<__gnu_cxx::__normal_iterator > >, vec_adj_list_vertex_id_map >, long unsigned int>, double, double&>, iterator_property_map<__gnu_cxx::__normal_iterator > >, vec_adj_list_vertex_id_map >, long unsigned int>, long unsigned int, long unsigned int&> >; PredecessorMap = dummy_property_map; DistanceMap = iterator_property_map<__gnu_cxx::__normal_iterator > >, vec_adj_list_vertex_id_map >, long unsigned int>, double, double&>; WeightMap = adj_list_edge_property_map >, edge_weight_t>; IndexMap = vec_adj_list_vertex_id_map >, long unsigned int>; Compare = std::less; Combine = std::plus; DistZero = double; ColorMap = two_bit_color_map >, long unsigned int> >]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/dijkstra_shortest_paths.hpp:464:36: required from ‘void boost::dijkstra_shortest_paths(const VertexListGraph&, SourceInputIter, SourceInputIter, PredecessorMap, DistanceMap, WeightMap, IndexMap, Compare, Combine, DistInf, DistZero, DijkstraVisitor, ColorMap) [with VertexListGraph = adjacency_list >, property > >; SourceInputIter = long unsigned int*; DijkstraVisitor = detail::graph::brandes_dijkstra_visitor >, property > >, adj_list_edge_property_map >, edge_weight_t>, iterator_property_map<__gnu_cxx::__normal_iterator, std::allocator > >*, std::vector, std::allocator > >, std::allocator, std::allocator > > > > >, vec_adj_list_vertex_id_map >, long unsigned int>, std::vector, std::allocator > >, std::vector, std::allocator > >&>, iterator_property_map<__gnu_cxx::__normal_iterator > >, vec_adj_list_vertex_id_map >, long unsigned int>, double, double&>, iterator_property_map<__gnu_cxx::__normal_iterator > >, vec_adj_list_vertex_id_map >, long unsigned int>, long unsigned int, long unsigned int&> >; PredecessorMap = dummy_property_map; DistanceMap = iterator_property_map<__gnu_cxx::__normal_iterator > >, vec_adj_list_vertex_id_map >, long unsigned int>, double, double&>; WeightMap = adj_list_edge_property_map >, edge_weight_t>; IndexMap = vec_adj_list_vertex_id_map >, long unsigned int>; Compare = std::less; Combine = std::plus; DistInf = double; DistZero = double; ColorMap = two_bit_color_map >, long unsigned int> >]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/dijkstra_shortest_paths.hpp:417:28: required from ‘void boost::dijkstra_shortest_paths(const VertexListGraph&, SourceInputIter, SourceInputIter, PredecessorMap, DistanceMap, WeightMap, IndexMap, Compare, Combine, DistInf, DistZero, DijkstraVisitor, const bgl_named_params&, typename enable_if_c::traversal_category>::value, graph::detail::no_parameter>::type) [with VertexListGraph = adjacency_list >, property > >; SourceInputIter = long unsigned int*; DijkstraVisitor = detail::graph::brandes_dijkstra_visitor >, property > >, adj_list_edge_property_map >, edge_weight_t>, iterator_property_map<__gnu_cxx::__normal_iterator, std::allocator > >*, std::vector, std::allocator > >, std::allocator, std::allocator > > > > >, vec_adj_list_vertex_id_map >, long unsigned int>, std::vector, std::allocator > >, std::vector, std::allocator > >&>, iterator_property_map<__gnu_cxx::__normal_iterator > >, vec_adj_list_vertex_id_map >, long unsigned int>, double, double&>, iterator_property_map<__gnu_cxx::__normal_iterator > >, vec_adj_list_vertex_id_map >, long unsigned int>, long unsigned int, long unsigned int&> >; PredecessorMap = dummy_property_map; DistanceMap = iterator_property_map<__gnu_cxx::__normal_iterator > >, vec_adj_list_vertex_id_map >, long unsigned int>, double, double&>; WeightMap = adj_list_edge_property_map >, edge_weight_t>; IndexMap = vec_adj_list_vertex_id_map >, long unsigned int>; Compare = std::less; Combine = std::plus; DistInf = double; DistZero = double; T = char; Tag = detail::unused_tag_type; Base = no_property; typename enable_if_c::traversal_category>::value, graph::detail::no_parameter>::type = graph::detail::no_parameter; typename graph_traits::traversal_category = undir_adj_list_traversal_tag]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/dijkstra_shortest_paths.hpp:491:28: required from ‘void boost::dijkstra_shortest_paths(const VertexListGraph&, SourceInputIter, SourceInputIter, PredecessorMap, DistanceMap, WeightMap, IndexMap, Compare, Combine, DistInf, DistZero, DijkstraVisitor) [with VertexListGraph = adjacency_list >, property > >; SourceInputIter = long unsigned int*; DijkstraVisitor = detail::graph::brandes_dijkstra_visitor >, property > >, adj_list_edge_property_map >, edge_weight_t>, iterator_property_map<__gnu_cxx::__normal_iterator, std::allocator > >*, std::vector, std::allocator > >, std::allocator, std::allocator > > > > >, vec_adj_list_vertex_id_map >, long unsigned int>, std::vector, std::allocator > >, std::vector, std::allocator > >&>, iterator_property_map<__gnu_cxx::__normal_iterator > >, vec_adj_list_vertex_id_map >, long unsigned int>, double, double&>, iterator_property_map<__gnu_cxx::__normal_iterator > >, vec_adj_list_vertex_id_map >, long unsigned int>, long unsigned int, long unsigned int&> >; PredecessorMap = dummy_property_map; DistanceMap = iterator_property_map<__gnu_cxx::__normal_iterator > >, vec_adj_list_vertex_id_map >, long unsigned int>, double, double&>; WeightMap = adj_list_edge_property_map >, edge_weight_t>; IndexMap = vec_adj_list_vertex_id_map >, long unsigned int>; Compare = std::less; Combine = std::plus; DistInf = double; DistZero = double]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/dijkstra_shortest_paths.hpp:434:28: [ skipping 5 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/betweenness_centrality.hpp:349:31: required from ‘void boost::detail::graph::brandes_betweenness_centrality_impl(const Graph&, CentralityMap, EdgeCentralityMap, IncomingMap, DistanceMap, DependencyMap, PathCountMap, VertexIndexMap, ShortestPaths) [with Graph = boost::adjacency_list >, boost::property > >; CentralityMap = boost::vec_adj_list_vertex_property_map >, boost::property > >, boost::adjacency_list >, boost::property > >*, double, double&, boost::vertex_centrality_t>; EdgeCentralityMap = boost::adj_list_edge_property_map >, boost::edge_centrality_t>; IncomingMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator, std::allocator > >*, std::vector, std::allocator > >, std::allocator, std::allocator > > > > >, boost::vec_adj_list_vertex_id_map >, long unsigned int>, std::vector, std::allocator > >, std::vector, std::allocator > >&>; DistanceMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator > >, boost::vec_adj_list_vertex_id_map >, long unsigned int>, double, double&>; DependencyMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator > >, boost::vec_adj_list_vertex_id_map >, long unsigned int>, double, double&>; PathCountMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator > >, boost::vec_adj_list_vertex_id_map >, long unsigned int>, long unsigned int, long unsigned int&>; VertexIndexMap = boost::vec_adj_list_vertex_id_map >, long unsigned int>; ShortestPaths = brandes_dijkstra_shortest_paths >, boost::edge_weight_t> >]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/betweenness_centrality.hpp:434:55: required from ‘void boost::brandes_betweenness_centrality(const Graph&, CentralityMap, EdgeCentralityMap, IncomingMap, DistanceMap, DependencyMap, PathCountMap, VertexIndexMap, WeightMap, typename enable_if_c::traversal_category>::value, graph::detail::no_parameter>::type) [with Graph = adjacency_list >, property > >; CentralityMap = vec_adj_list_vertex_property_map >, property > >, adjacency_list >, property > >*, double, double&, vertex_centrality_t>; EdgeCentralityMap = adj_list_edge_property_map >, edge_centrality_t>; IncomingMap = iterator_property_map<__gnu_cxx::__normal_iterator, std::allocator > >*, std::vector, std::allocator > >, std::allocator, std::allocator > > > > >, vec_adj_list_vertex_id_map >, long unsigned int>, std::vector, std::allocator > >, std::vector, std::allocator > >&>; DistanceMap = iterator_property_map<__gnu_cxx::__normal_iterator > >, vec_adj_list_vertex_id_map >, long unsigned int>, double, double&>; DependencyMap = iterator_property_map<__gnu_cxx::__normal_iterator > >, vec_adj_list_vertex_id_map >, long unsigned int>, double, double&>; PathCountMap = iterator_property_map<__gnu_cxx::__normal_iterator > >, vec_adj_list_vertex_id_map >, long unsigned int>, long unsigned int, long unsigned int&>; VertexIndexMap = vec_adj_list_vertex_id_map >, long unsigned int>; WeightMap = adj_list_edge_property_map >, edge_weight_t>; typename enable_if_c::traversal_category>::value, graph::detail::no_parameter>::type = graph::detail::no_parameter; typename graph_traits::traversal_category = undir_adj_list_traversal_tag]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/betweenness_centrality.hpp:468:43: required from ‘void boost::detail::graph::brandes_betweenness_centrality_dispatch2(const Graph&, CentralityMap, EdgeCentralityMap, WeightMap, VertexIndexMap) [with Graph = boost::adjacency_list >, boost::property > >; CentralityMap = boost::vec_adj_list_vertex_property_map >, boost::property > >, boost::adjacency_list >, boost::property > >*, double, double&, boost::vertex_centrality_t>; EdgeCentralityMap = boost::adj_list_edge_property_map >, boost::edge_centrality_t>; WeightMap = boost::adj_list_edge_property_map >, boost::edge_weight_t>; VertexIndexMap = boost::vec_adj_list_vertex_id_map >, long unsigned int>]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/betweenness_centrality.hpp:517:57: required from ‘static void boost::detail::graph::brandes_betweenness_centrality_dispatch1::run(const Graph&, CentralityMap, EdgeCentralityMap, VertexIndexMap, WeightMap) [with Graph = boost::adjacency_list >, boost::property > >; CentralityMap = boost::vec_adj_list_vertex_property_map >, boost::property > >, boost::adjacency_list >, boost::property > >*, double, double&, boost::vertex_centrality_t>; EdgeCentralityMap = boost::adj_list_edge_property_map >, boost::edge_centrality_t>; VertexIndexMap = boost::vec_adj_list_vertex_id_map >, long unsigned int>; WeightMap = boost::adj_list_edge_property_map >, boost::edge_weight_t>]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/betweenness_centrality.hpp:558:71: required from ‘void boost::brandes_betweenness_centrality(const Graph&, const bgl_named_params&, typename enable_if_c::traversal_category>::value, graph::detail::no_parameter>::type) [with Graph = adjacency_list >, property > >; Param = adj_list_edge_property_map >, edge_weight_t>; Tag = edge_weight_t; Rest = bgl_named_params >, edge_centrality_t>, edge_centrality_t, bgl_named_params >, property > >, adjacency_list >, property > >*, double, double&, vertex_centrality_t>, vertex_centrality_t, no_property> >; typename enable_if_c::traversal_category>::value, graph::detail::no_parameter>::type = graph::detail::no_parameter; typename graph_traits::traversal_category = undir_adj_list_traversal_tag]’ bbc.cpp:67:33: required from here /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:65:52: warning: ‘this’ pointer is null [-Wnonnull] 65 | static void failed() { ((Model*)0)->constraints(); } | ~~~~~~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/breadth_first_search.hpp:37:10: note: in a call to non-static member function ‘void boost::BFSVisitorConcept::constraints() [with Visitor = boost::detail::dijkstra_bfs_visitor >, boost::property > >, boost::adj_list_edge_property_map >, boost::edge_weight_t>, boost::iterator_property_map<__gnu_cxx::__normal_iterator, std::allocator > >*, std::vector, std::allocator > >, std::allocator, std::allocator > > > > >, boost::vec_adj_list_vertex_id_map >, long unsigned int>, std::vector, std::allocator > >, std::vector, std::allocator > >&>, boost::iterator_property_map<__gnu_cxx::__normal_iterator > >, boost::vec_adj_list_vertex_id_map >, long unsigned int>, double, double&>, boost::iterator_property_map<__gnu_cxx::__normal_iterator > >, boost::vec_adj_list_vertex_id_map >, long unsigned int>, long unsigned int, long unsigned int&> >, boost::d_ary_heap_indirect >, long unsigned int>, long unsigned int, long unsigned int&>, boost::iterator_property_map<__gnu_cxx::__normal_iterator > >, boost::vec_adj_list_vertex_id_map >, long unsigned int>, double, double&>, std::less, std::vector > >, boost::adj_list_edge_property_map >, boost::edge_weight_t>, boost::dummy_property_map, boost::iterator_property_map<__gnu_cxx::__normal_iterator > >, boost::vec_adj_list_vertex_id_map >, long unsigned int>, double, double&>, std::plus, std::less >; Graph = boost::adjacency_list >, boost::property > >]’ 37 | void constraints() | ^~~~~~~~~~~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::constraint::failed() [with Model = boost::ReadWritePropertyMapConcept >, long unsigned int> >, long unsigned int>]’: /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/breadth_first_search.hpp:66:5: required from ‘void boost::breadth_first_visit(const IncidenceGraph&, SourceIterator, SourceIterator, Buffer&, BFSVisitor, ColorMap) [with IncidenceGraph = adjacency_list >, property > >; Buffer = d_ary_heap_indirect >, long unsigned int>, long unsigned int, long unsigned int&>, iterator_property_map<__gnu_cxx::__normal_iterator > >, vec_adj_list_vertex_id_map >, long unsigned int>, double, double&>, std::less, std::vector > >; BFSVisitor = detail::dijkstra_bfs_visitor >, property > >, adj_list_edge_property_map >, edge_weight_t>, iterator_property_map<__gnu_cxx::__normal_iterator, std::allocator > >*, std::vector, std::allocator > >, std::allocator, std::allocator > > > > >, vec_adj_list_vertex_id_map >, long unsigned int>, std::vector, std::allocator > >, std::vector, std::allocator > >&>, iterator_property_map<__gnu_cxx::__normal_iterator > >, vec_adj_list_vertex_id_map >, long unsigned int>, double, double&>, iterator_property_map<__gnu_cxx::__normal_iterator > >, vec_adj_list_vertex_id_map >, long unsigned int>, long unsigned int, long unsigned int&> >, d_ary_heap_indirect >, long unsigned int>, long unsigned int, long unsigned int&>, iterator_property_map<__gnu_cxx::__normal_iterator > >, vec_adj_list_vertex_id_map >, long unsigned int>, double, double&>, std::less, std::vector > >, adj_list_edge_property_map >, edge_weight_t>, dummy_property_map, iterator_property_map<__gnu_cxx::__normal_iterator > >, vec_adj_list_vertex_id_map >, long unsigned int>, double, double&>, std::plus, std::less >; ColorMap = two_bit_color_map >, long unsigned int> >; SourceIterator = long unsigned int*]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/dijkstra_shortest_paths.hpp:387:24: required from ‘void boost::dijkstra_shortest_paths_no_init(const Graph&, SourceInputIter, SourceInputIter, PredecessorMap, DistanceMap, WeightMap, IndexMap, Compare, Combine, DistZero, DijkstraVisitor, ColorMap) [with Graph = adjacency_list >, property > >; SourceInputIter = long unsigned int*; DijkstraVisitor = detail::graph::brandes_dijkstra_visitor >, property > >, adj_list_edge_property_map >, edge_weight_t>, iterator_property_map<__gnu_cxx::__normal_iterator, std::allocator > >*, std::vector, std::allocator > >, std::allocator, std::allocator > > > > >, vec_adj_list_vertex_id_map >, long unsigned int>, std::vector, std::allocator > >, std::vector, std::allocator > >&>, iterator_property_map<__gnu_cxx::__normal_iterator > >, vec_adj_list_vertex_id_map >, long unsigned int>, double, double&>, iterator_property_map<__gnu_cxx::__normal_iterator > >, vec_adj_list_vertex_id_map >, long unsigned int>, long unsigned int, long unsigned int&> >; PredecessorMap = dummy_property_map; DistanceMap = iterator_property_map<__gnu_cxx::__normal_iterator > >, vec_adj_list_vertex_id_map >, long unsigned int>, double, double&>; WeightMap = adj_list_edge_property_map >, edge_weight_t>; IndexMap = vec_adj_list_vertex_id_map >, long unsigned int>; Compare = std::less; Combine = std::plus; DistZero = double; ColorMap = two_bit_color_map >, long unsigned int> >]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/dijkstra_shortest_paths.hpp:464:36: required from ‘void boost::dijkstra_shortest_paths(const VertexListGraph&, SourceInputIter, SourceInputIter, PredecessorMap, DistanceMap, WeightMap, IndexMap, Compare, Combine, DistInf, DistZero, DijkstraVisitor, ColorMap) [with VertexListGraph = adjacency_list >, property > >; SourceInputIter = long unsigned int*; DijkstraVisitor = detail::graph::brandes_dijkstra_visitor >, property > >, adj_list_edge_property_map >, edge_weight_t>, iterator_property_map<__gnu_cxx::__normal_iterator, std::allocator > >*, std::vector, std::allocator > >, std::allocator, std::allocator > > > > >, vec_adj_list_vertex_id_map >, long unsigned int>, std::vector, std::allocator > >, std::vector, std::allocator > >&>, iterator_property_map<__gnu_cxx::__normal_iterator > >, vec_adj_list_vertex_id_map >, long unsigned int>, double, double&>, iterator_property_map<__gnu_cxx::__normal_iterator > >, vec_adj_list_vertex_id_map >, long unsigned int>, long unsigned int, long unsigned int&> >; PredecessorMap = dummy_property_map; DistanceMap = iterator_property_map<__gnu_cxx::__normal_iterator > >, vec_adj_list_vertex_id_map >, long unsigned int>, double, double&>; WeightMap = adj_list_edge_property_map >, edge_weight_t>; IndexMap = vec_adj_list_vertex_id_map >, long unsigned int>; Compare = std::less; Combine = std::plus; DistInf = double; DistZero = double; ColorMap = two_bit_color_map >, long unsigned int> >]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/dijkstra_shortest_paths.hpp:417:28: required from ‘void boost::dijkstra_shortest_paths(const VertexListGraph&, SourceInputIter, SourceInputIter, PredecessorMap, DistanceMap, WeightMap, IndexMap, Compare, Combine, DistInf, DistZero, DijkstraVisitor, const bgl_named_params&, typename enable_if_c::traversal_category>::value, graph::detail::no_parameter>::type) [with VertexListGraph = adjacency_list >, property > >; SourceInputIter = long unsigned int*; DijkstraVisitor = detail::graph::brandes_dijkstra_visitor >, property > >, adj_list_edge_property_map >, edge_weight_t>, iterator_property_map<__gnu_cxx::__normal_iterator, std::allocator > >*, std::vector, std::allocator > >, std::allocator, std::allocator > > > > >, vec_adj_list_vertex_id_map >, long unsigned int>, std::vector, std::allocator > >, std::vector, std::allocator > >&>, iterator_property_map<__gnu_cxx::__normal_iterator > >, vec_adj_list_vertex_id_map >, long unsigned int>, double, double&>, iterator_property_map<__gnu_cxx::__normal_iterator > >, vec_adj_list_vertex_id_map >, long unsigned int>, long unsigned int, long unsigned int&> >; PredecessorMap = dummy_property_map; DistanceMap = iterator_property_map<__gnu_cxx::__normal_iterator > >, vec_adj_list_vertex_id_map >, long unsigned int>, double, double&>; WeightMap = adj_list_edge_property_map >, edge_weight_t>; IndexMap = vec_adj_list_vertex_id_map >, long unsigned int>; Compare = std::less; Combine = std::plus; DistInf = double; DistZero = double; T = char; Tag = detail::unused_tag_type; Base = no_property; typename enable_if_c::traversal_category>::value, graph::detail::no_parameter>::type = graph::detail::no_parameter; typename graph_traits::traversal_category = undir_adj_list_traversal_tag]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/dijkstra_shortest_paths.hpp:491:28: required from ‘void boost::dijkstra_shortest_paths(const VertexListGraph&, SourceInputIter, SourceInputIter, PredecessorMap, DistanceMap, WeightMap, IndexMap, Compare, Combine, DistInf, DistZero, DijkstraVisitor) [with VertexListGraph = adjacency_list >, property > >; SourceInputIter = long unsigned int*; DijkstraVisitor = detail::graph::brandes_dijkstra_visitor >, property > >, adj_list_edge_property_map >, edge_weight_t>, iterator_property_map<__gnu_cxx::__normal_iterator, std::allocator > >*, std::vector, std::allocator > >, std::allocator, std::allocator > > > > >, vec_adj_list_vertex_id_map >, long unsigned int>, std::vector, std::allocator > >, std::vector, std::allocator > >&>, iterator_property_map<__gnu_cxx::__normal_iterator > >, vec_adj_list_vertex_id_map >, long unsigned int>, double, double&>, iterator_property_map<__gnu_cxx::__normal_iterator > >, vec_adj_list_vertex_id_map >, long unsigned int>, long unsigned int, long unsigned int&> >; PredecessorMap = dummy_property_map; DistanceMap = iterator_property_map<__gnu_cxx::__normal_iterator > >, vec_adj_list_vertex_id_map >, long unsigned int>, double, double&>; WeightMap = adj_list_edge_property_map >, edge_weight_t>; IndexMap = vec_adj_list_vertex_id_map >, long unsigned int>; Compare = std::less; Combine = std::plus; DistInf = double; DistZero = double]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/dijkstra_shortest_paths.hpp:434:28: [ skipping 5 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/betweenness_centrality.hpp:349:31: required from ‘void boost::detail::graph::brandes_betweenness_centrality_impl(const Graph&, CentralityMap, EdgeCentralityMap, IncomingMap, DistanceMap, DependencyMap, PathCountMap, VertexIndexMap, ShortestPaths) [with Graph = boost::adjacency_list >, boost::property > >; CentralityMap = boost::vec_adj_list_vertex_property_map >, boost::property > >, boost::adjacency_list >, boost::property > >*, double, double&, boost::vertex_centrality_t>; EdgeCentralityMap = boost::adj_list_edge_property_map >, boost::edge_centrality_t>; IncomingMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator, std::allocator > >*, std::vector, std::allocator > >, std::allocator, std::allocator > > > > >, boost::vec_adj_list_vertex_id_map >, long unsigned int>, std::vector, std::allocator > >, std::vector, std::allocator > >&>; DistanceMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator > >, boost::vec_adj_list_vertex_id_map >, long unsigned int>, double, double&>; DependencyMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator > >, boost::vec_adj_list_vertex_id_map >, long unsigned int>, double, double&>; PathCountMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator > >, boost::vec_adj_list_vertex_id_map >, long unsigned int>, long unsigned int, long unsigned int&>; VertexIndexMap = boost::vec_adj_list_vertex_id_map >, long unsigned int>; ShortestPaths = brandes_dijkstra_shortest_paths >, boost::edge_weight_t> >]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/betweenness_centrality.hpp:434:55: required from ‘void boost::brandes_betweenness_centrality(const Graph&, CentralityMap, EdgeCentralityMap, IncomingMap, DistanceMap, DependencyMap, PathCountMap, VertexIndexMap, WeightMap, typename enable_if_c::traversal_category>::value, graph::detail::no_parameter>::type) [with Graph = adjacency_list >, property > >; CentralityMap = vec_adj_list_vertex_property_map >, property > >, adjacency_list >, property > >*, double, double&, vertex_centrality_t>; EdgeCentralityMap = adj_list_edge_property_map >, edge_centrality_t>; IncomingMap = iterator_property_map<__gnu_cxx::__normal_iterator, std::allocator > >*, std::vector, std::allocator > >, std::allocator, std::allocator > > > > >, vec_adj_list_vertex_id_map >, long unsigned int>, std::vector, std::allocator > >, std::vector, std::allocator > >&>; DistanceMap = iterator_property_map<__gnu_cxx::__normal_iterator > >, vec_adj_list_vertex_id_map >, long unsigned int>, double, double&>; DependencyMap = iterator_property_map<__gnu_cxx::__normal_iterator > >, vec_adj_list_vertex_id_map >, long unsigned int>, double, double&>; PathCountMap = iterator_property_map<__gnu_cxx::__normal_iterator > >, vec_adj_list_vertex_id_map >, long unsigned int>, long unsigned int, long unsigned int&>; VertexIndexMap = vec_adj_list_vertex_id_map >, long unsigned int>; WeightMap = adj_list_edge_property_map >, edge_weight_t>; typename enable_if_c::traversal_category>::value, graph::detail::no_parameter>::type = graph::detail::no_parameter; typename graph_traits::traversal_category = undir_adj_list_traversal_tag]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/betweenness_centrality.hpp:468:43: required from ‘void boost::detail::graph::brandes_betweenness_centrality_dispatch2(const Graph&, CentralityMap, EdgeCentralityMap, WeightMap, VertexIndexMap) [with Graph = boost::adjacency_list >, boost::property > >; CentralityMap = boost::vec_adj_list_vertex_property_map >, boost::property > >, boost::adjacency_list >, boost::property > >*, double, double&, boost::vertex_centrality_t>; EdgeCentralityMap = boost::adj_list_edge_property_map >, boost::edge_centrality_t>; WeightMap = boost::adj_list_edge_property_map >, boost::edge_weight_t>; VertexIndexMap = boost::vec_adj_list_vertex_id_map >, long unsigned int>]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/betweenness_centrality.hpp:517:57: required from ‘static void boost::detail::graph::brandes_betweenness_centrality_dispatch1::run(const Graph&, CentralityMap, EdgeCentralityMap, VertexIndexMap, WeightMap) [with Graph = boost::adjacency_list >, boost::property > >; CentralityMap = boost::vec_adj_list_vertex_property_map >, boost::property > >, boost::adjacency_list >, boost::property > >*, double, double&, boost::vertex_centrality_t>; EdgeCentralityMap = boost::adj_list_edge_property_map >, boost::edge_centrality_t>; VertexIndexMap = boost::vec_adj_list_vertex_id_map >, long unsigned int>; WeightMap = boost::adj_list_edge_property_map >, boost::edge_weight_t>]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/betweenness_centrality.hpp:558:71: required from ‘void boost::brandes_betweenness_centrality(const Graph&, const bgl_named_params&, typename enable_if_c::traversal_category>::value, graph::detail::no_parameter>::type) [with Graph = adjacency_list >, property > >; Param = adj_list_edge_property_map >, edge_weight_t>; Tag = edge_weight_t; Rest = bgl_named_params >, edge_centrality_t>, edge_centrality_t, bgl_named_params >, property > >, adjacency_list >, property > >*, double, double&, vertex_centrality_t>, vertex_centrality_t, no_property> >; typename enable_if_c::traversal_category>::value, graph::detail::no_parameter>::type = graph::detail::no_parameter; typename graph_traits::traversal_category = undir_adj_list_traversal_tag]’ bbc.cpp:67:33: required from here /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:65:52: warning: ‘this’ pointer is null [-Wnonnull] 65 | static void failed() { ((Model*)0)->constraints(); } | ~~~~~~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/property_map/property_map.hpp:205:10: note: in a call to non-static member function ‘void boost::ReadWritePropertyMapConcept::constraints() [with PMap = boost::two_bit_color_map >, long unsigned int> >; Key = long unsigned int]’ 205 | void constraints() { | ^~~~~~~~~~~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::Assignable > > >, boost::property > >*, std::vector > > >, boost::property > >, std::allocator > > >, boost::property > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> >]’: /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements > > >, boost::property > >*, std::vector > > >, boost::property > >, std::allocator > > >, boost::property > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:145:5: required from ‘struct boost::Assignable > > >, boost::property > >*, std::vector > > >, boost::property > >, std::allocator > > >, boost::property > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:502:3: required from ‘struct boost::InputIterator > > >, boost::property > >*, std::vector > > >, boost::property > >, std::allocator > > >, boost::property > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::InputIterator > > >, boost::property > >*, std::vector > > >, boost::property > >, std::allocator > > >, boost::property > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> >]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied > > >, boost::property > >*, std::vector > > >, boost::property > >, std::allocator > > >, boost::property > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::value’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:45:51: [ skipping 11 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/betweenness_centrality.hpp:500:43: required from ‘void boost::detail::graph::brandes_betweenness_centrality_dispatch2(const Graph&, CentralityMap, EdgeCentralityMap, VertexIndexMap) [with Graph = boost::adjacency_list >, boost::property > >; CentralityMap = boost::dummy_property_map; EdgeCentralityMap = boost::adj_list_edge_property_map >, boost::edge_centrality_t>; VertexIndexMap = boost::vec_adj_list_vertex_id_map >, long unsigned int>]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/betweenness_centrality.hpp:531:57: required from ‘static void boost::detail::graph::brandes_betweenness_centrality_dispatch1::run(const Graph&, CentralityMap, EdgeCentralityMap, VertexIndexMap, boost::param_not_found) [with Graph = boost::adjacency_list >, boost::property > >; CentralityMap = boost::dummy_property_map; EdgeCentralityMap = boost::adj_list_edge_property_map >, boost::edge_centrality_t>; VertexIndexMap = boost::vec_adj_list_vertex_id_map >, long unsigned int>]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/betweenness_centrality.hpp:558:71: required from ‘void boost::brandes_betweenness_centrality(const Graph&, const bgl_named_params&, typename enable_if_c::traversal_category>::value, graph::detail::no_parameter>::type) [with Graph = adjacency_list >, property > >; Param = vec_adj_list_vertex_id_map >, long unsigned int>; Tag = vertex_index_t; Rest = bgl_named_params >, edge_centrality_t>, edge_centrality_t, no_property>; typename enable_if_c::traversal_category>::value, graph::detail::no_parameter>::type = graph::detail::no_parameter; typename graph_traits::traversal_category = undir_adj_list_traversal_tag]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/bc_clustering.hpp:131:39: required from ‘void boost::betweenness_centrality_clustering(MutableGraph&, Done, EdgeCentralityMap, VertexIndexMap) [with MutableGraph = adjacency_list >, property > >; Done = clustering_threshold; EdgeCentralityMap = adj_list_edge_property_map >, edge_centrality_t>; VertexIndexMap = vec_adj_list_vertex_id_map >, long unsigned int>]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/bc_clustering.hpp:150:38: required from ‘void boost::betweenness_centrality_clustering(MutableGraph&, Done, EdgeCentralityMap) [with MutableGraph = adjacency_list >, property > >; Done = clustering_threshold; EdgeCentralityMap = adj_list_edge_property_map >, edge_centrality_t>]’ bbc.cpp:149:36: required from here /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::Assignable::~Assignable() [with TT = boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > > >, boost::property > >*, std::vector > > >, boost::property > >, std::allocator > > >, boost::property > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>]’ 37 | ~model() | ^ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:145:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 145 | BOOST_CONCEPT_USAGE(Assignable) { | ^~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::EqualityComparable > > >, boost::property > >*, std::vector > > >, boost::property > >, std::allocator > > >, boost::property > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> >]’: /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements > > >, boost::property > >*, std::vector > > >, boost::property > >, std::allocator > > >, boost::property > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:233:5: required from ‘struct boost::EqualityComparable > > >, boost::property > >*, std::vector > > >, boost::property > >, std::allocator > > >, boost::property > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:502:3: required from ‘struct boost::InputIterator > > >, boost::property > >*, std::vector > > >, boost::property > >, std::allocator > > >, boost::property > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::InputIterator > > >, boost::property > >*, std::vector > > >, boost::property > >, std::allocator > > >, boost::property > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> >]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied > > >, boost::property > >*, std::vector > > >, boost::property > >, std::allocator > > >, boost::property > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::value’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:45:51: [ skipping 11 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/betweenness_centrality.hpp:500:43: required from ‘void boost::detail::graph::brandes_betweenness_centrality_dispatch2(const Graph&, CentralityMap, EdgeCentralityMap, VertexIndexMap) [with Graph = boost::adjacency_list >, boost::property > >; CentralityMap = boost::dummy_property_map; EdgeCentralityMap = boost::adj_list_edge_property_map >, boost::edge_centrality_t>; VertexIndexMap = boost::vec_adj_list_vertex_id_map >, long unsigned int>]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/betweenness_centrality.hpp:531:57: required from ‘static void boost::detail::graph::brandes_betweenness_centrality_dispatch1::run(const Graph&, CentralityMap, EdgeCentralityMap, VertexIndexMap, boost::param_not_found) [with Graph = boost::adjacency_list >, boost::property > >; CentralityMap = boost::dummy_property_map; EdgeCentralityMap = boost::adj_list_edge_property_map >, boost::edge_centrality_t>; VertexIndexMap = boost::vec_adj_list_vertex_id_map >, long unsigned int>]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/betweenness_centrality.hpp:558:71: required from ‘void boost::brandes_betweenness_centrality(const Graph&, const bgl_named_params&, typename enable_if_c::traversal_category>::value, graph::detail::no_parameter>::type) [with Graph = adjacency_list >, property > >; Param = vec_adj_list_vertex_id_map >, long unsigned int>; Tag = vertex_index_t; Rest = bgl_named_params >, edge_centrality_t>, edge_centrality_t, no_property>; typename enable_if_c::traversal_category>::value, graph::detail::no_parameter>::type = graph::detail::no_parameter; typename graph_traits::traversal_category = undir_adj_list_traversal_tag]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/bc_clustering.hpp:131:39: required from ‘void boost::betweenness_centrality_clustering(MutableGraph&, Done, EdgeCentralityMap, VertexIndexMap) [with MutableGraph = adjacency_list >, property > >; Done = clustering_threshold; EdgeCentralityMap = adj_list_edge_property_map >, edge_centrality_t>; VertexIndexMap = vec_adj_list_vertex_id_map >, long unsigned int>]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/bc_clustering.hpp:150:38: required from ‘void boost::betweenness_centrality_clustering(MutableGraph&, Done, EdgeCentralityMap) [with MutableGraph = adjacency_list >, property > >; Done = clustering_threshold; EdgeCentralityMap = adj_list_edge_property_map >, edge_centrality_t>]’ bbc.cpp:149:36: required from here /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::EqualityComparable::~EqualityComparable() [with TT = boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > > >, boost::property > >*, std::vector > > >, boost::property > >, std::allocator > > >, boost::property > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>]’ 37 | ~model() | ^ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:233:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 233 | BOOST_CONCEPT_USAGE(EqualityComparable) { | ^~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::InputIterator > > >, boost::property > >*, std::vector > > >, boost::property > >, std::allocator > > >, boost::property > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> >]’: /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements > > >, boost::property > >*, std::vector > > >, boost::property > >, std::allocator > > >, boost::property > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:512:7: required from ‘struct boost::InputIterator > > >, boost::property > >*, std::vector > > >, boost::property > >, std::allocator > > >, boost::property > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::InputIterator > > >, boost::property > >*, std::vector > > >, boost::property > >, std::allocator > > >, boost::property > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> >]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied > > >, boost::property > >*, std::vector > > >, boost::property > >, std::allocator > > >, boost::property > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::value’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied > > >, boost::property > >*, std::vector > > >, boost::property > >, std::allocator > > >, boost::property > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:72:8: [ skipping 10 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/betweenness_centrality.hpp:500:43: required from ‘void boost::detail::graph::brandes_betweenness_centrality_dispatch2(const Graph&, CentralityMap, EdgeCentralityMap, VertexIndexMap) [with Graph = boost::adjacency_list >, boost::property > >; CentralityMap = boost::dummy_property_map; EdgeCentralityMap = boost::adj_list_edge_property_map >, boost::edge_centrality_t>; VertexIndexMap = boost::vec_adj_list_vertex_id_map >, long unsigned int>]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/betweenness_centrality.hpp:531:57: required from ‘static void boost::detail::graph::brandes_betweenness_centrality_dispatch1::run(const Graph&, CentralityMap, EdgeCentralityMap, VertexIndexMap, boost::param_not_found) [with Graph = boost::adjacency_list >, boost::property > >; CentralityMap = boost::dummy_property_map; EdgeCentralityMap = boost::adj_list_edge_property_map >, boost::edge_centrality_t>; VertexIndexMap = boost::vec_adj_list_vertex_id_map >, long unsigned int>]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/betweenness_centrality.hpp:558:71: required from ‘void boost::brandes_betweenness_centrality(const Graph&, const bgl_named_params&, typename enable_if_c::traversal_category>::value, graph::detail::no_parameter>::type) [with Graph = adjacency_list >, property > >; Param = vec_adj_list_vertex_id_map >, long unsigned int>; Tag = vertex_index_t; Rest = bgl_named_params >, edge_centrality_t>, edge_centrality_t, no_property>; typename enable_if_c::traversal_category>::value, graph::detail::no_parameter>::type = graph::detail::no_parameter; typename graph_traits::traversal_category = undir_adj_list_traversal_tag]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/bc_clustering.hpp:131:39: required from ‘void boost::betweenness_centrality_clustering(MutableGraph&, Done, EdgeCentralityMap, VertexIndexMap) [with MutableGraph = adjacency_list >, property > >; Done = clustering_threshold; EdgeCentralityMap = adj_list_edge_property_map >, edge_centrality_t>; VertexIndexMap = vec_adj_list_vertex_id_map >, long unsigned int>]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/bc_clustering.hpp:150:38: required from ‘void boost::betweenness_centrality_clustering(MutableGraph&, Done, EdgeCentralityMap) [with MutableGraph = adjacency_list >, property > >; Done = clustering_threshold; EdgeCentralityMap = adj_list_edge_property_map >, edge_centrality_t>]’ bbc.cpp:149:36: required from here /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::InputIterator::~InputIterator() [with TT = boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > > >, boost::property > >*, std::vector > > >, boost::property > >, std::allocator > > >, boost::property > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>]’ 37 | ~model() | ^ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:512:7: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 512 | BOOST_CONCEPT_USAGE(InputIterator) | ^~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements >, boost::property > >, boost::adj_list_edge_property_map >, boost::edge_weight_t>, boost::iterator_property_map<__gnu_cxx::__normal_iterator, std::allocator > >*, std::vector, std::allocator > >, std::allocator, std::allocator > > > > >, boost::vec_adj_list_vertex_id_map >, long unsigned int>, std::vector, std::allocator > >, std::vector, std::allocator > >&>, boost::iterator_property_map<__gnu_cxx::__normal_iterator > >, boost::vec_adj_list_vertex_id_map >, long unsigned int>, double, double&>, boost::iterator_property_map<__gnu_cxx::__normal_iterator > >, boost::vec_adj_list_vertex_id_map >, long unsigned int>, long unsigned int, long unsigned int&> >, boost::d_ary_heap_indirect >, long unsigned int>, long unsigned int, long unsigned int&>, boost::iterator_property_map<__gnu_cxx::__normal_iterator > >, boost::vec_adj_list_vertex_id_map >, long unsigned int>, double, double&>, std::less, std::vector > >, boost::adj_list_edge_property_map >, boost::edge_weight_t>, boost::dummy_property_map, boost::iterator_property_map<__gnu_cxx::__normal_iterator > >, boost::vec_adj_list_vertex_id_map >, long unsigned int>, double, double&>, std::plus, std::less > > >]’: /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:167:5: required from ‘struct boost::CopyConstructible >, boost::property > >, boost::adj_list_edge_property_map >, boost::edge_weight_t>, boost::iterator_property_map<__gnu_cxx::__normal_iterator, std::allocator > >*, std::vector, std::allocator > >, std::allocator, std::allocator > > > > >, boost::vec_adj_list_vertex_id_map >, long unsigned int>, std::vector, std::allocator > >, std::vector, std::allocator > >&>, boost::iterator_property_map<__gnu_cxx::__normal_iterator > >, boost::vec_adj_list_vertex_id_map >, long unsigned int>, double, double&>, boost::iterator_property_map<__gnu_cxx::__normal_iterator > >, boost::vec_adj_list_vertex_id_map >, long unsigned int>, long unsigned int, long unsigned int&> >, boost::d_ary_heap_indirect >, long unsigned int>, long unsigned int, long unsigned int&>, boost::iterator_property_map<__gnu_cxx::__normal_iterator > >, boost::vec_adj_list_vertex_id_map >, long unsigned int>, double, double&>, std::less, std::vector > >, boost::adj_list_edge_property_map >, boost::edge_weight_t>, boost::dummy_property_map, boost::iterator_property_map<__gnu_cxx::__normal_iterator > >, boost::vec_adj_list_vertex_id_map >, long unsigned int>, double, double&>, std::plus, std::less > >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:165:3: required from ‘struct boost::CopyConstructibleConcept >, boost::property > >, boost::adj_list_edge_property_map >, boost::edge_weight_t>, boost::iterator_property_map<__gnu_cxx::__normal_iterator, std::allocator > >*, std::vector, std::allocator > >, std::allocator, std::allocator > > > > >, boost::vec_adj_list_vertex_id_map >, long unsigned int>, std::vector, std::allocator > >, std::vector, std::allocator > >&>, boost::iterator_property_map<__gnu_cxx::__normal_iterator > >, boost::vec_adj_list_vertex_id_map >, long unsigned int>, double, double&>, boost::iterator_property_map<__gnu_cxx::__normal_iterator > >, boost::vec_adj_list_vertex_id_map >, long unsigned int>, long unsigned int, long unsigned int&> >, boost::d_ary_heap_indirect >, long unsigned int>, long unsigned int, long unsigned int&>, boost::iterator_property_map<__gnu_cxx::__normal_iterator > >, boost::vec_adj_list_vertex_id_map >, long unsigned int>, double, double&>, std::less, std::vector > >, boost::adj_list_edge_property_map >, boost::edge_weight_t>, boost::dummy_property_map, boost::iterator_property_map<__gnu_cxx::__normal_iterator > >, boost::vec_adj_list_vertex_id_map >, long unsigned int>, double, double&>, std::plus, std::less > >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::CopyConstructibleConcept >, boost::property > >, boost::adj_list_edge_property_map >, boost::edge_weight_t>, boost::iterator_property_map<__gnu_cxx::__normal_iterator, std::allocator > >*, std::vector, std::allocator > >, std::allocator, std::allocator > > > > >, boost::vec_adj_list_vertex_id_map >, long unsigned int>, std::vector, std::allocator > >, std::vector, std::allocator > >&>, boost::iterator_property_map<__gnu_cxx::__normal_iterator > >, boost::vec_adj_list_vertex_id_map >, long unsigned int>, double, double&>, boost::iterator_property_map<__gnu_cxx::__normal_iterator > >, boost::vec_adj_list_vertex_id_map >, long unsigned int>, long unsigned int, long unsigned int&> >, boost::d_ary_heap_indirect >, long unsigned int>, long unsigned int, long unsigned int&>, boost::iterator_property_map<__gnu_cxx::__normal_iterator > >, boost::vec_adj_list_vertex_id_map >, long unsigned int>, double, double&>, std::less, std::vector > >, boost::adj_list_edge_property_map >, boost::edge_weight_t>, boost::dummy_property_map, boost::iterator_property_map<__gnu_cxx::__normal_iterator > >, boost::vec_adj_list_vertex_id_map >, long unsigned int>, double, double&>, std::plus, std::less > >]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied >, boost::property > >, boost::adj_list_edge_property_map >, boost::edge_weight_t>, boost::iterator_property_map<__gnu_cxx::__normal_iterator, std::allocator > >*, std::vector, std::allocator > >, std::allocator, std::allocator > > > > >, boost::vec_adj_list_vertex_id_map >, long unsigned int>, std::vector, std::allocator > >, std::vector, std::allocator > >&>, boost::iterator_property_map<__gnu_cxx::__normal_iterator > >, boost::vec_adj_list_vertex_id_map >, long unsigned int>, double, double&>, boost::iterator_property_map<__gnu_cxx::__normal_iterator > >, boost::vec_adj_list_vertex_id_map >, long unsigned int>, long unsigned int, long unsigned int&> >, boost::d_ary_heap_indirect >, long unsigned int>, long unsigned int, long unsigned int&>, boost::iterator_property_map<__gnu_cxx::__normal_iterator > >, boost::vec_adj_list_vertex_id_map >, long unsigned int>, double, double&>, std::less, std::vector > >, boost::adj_list_edge_property_map >, boost::edge_weight_t>, boost::dummy_property_map, boost::iterator_property_map<__gnu_cxx::__normal_iterator > >, boost::vec_adj_list_vertex_id_map >, long unsigned int>, double, double&>, std::plus, std::less > > >::value’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied >, boost::property > >, boost::adj_list_edge_property_map >, boost::edge_weight_t>, boost::iterator_property_map<__gnu_cxx::__normal_iterator, std::allocator > >*, std::vector, std::allocator > >, std::allocator, std::allocator > > > > >, boost::vec_adj_list_vertex_id_map >, long unsigned int>, std::vector, std::allocator > >, std::vector, std::allocator > >&>, boost::iterator_property_map<__gnu_cxx::__normal_iterator > >, boost::vec_adj_list_vertex_id_map >, long unsigned int>, double, double&>, boost::iterator_property_map<__gnu_cxx::__normal_iterator > >, boost::vec_adj_list_vertex_id_map >, long unsigned int>, long unsigned int, long unsigned int&> >, boost::d_ary_heap_indirect >, long unsigned int>, long unsigned int, long unsigned int&>, boost::iterator_property_map<__gnu_cxx::__normal_iterator > >, boost::vec_adj_list_vertex_id_map >, long unsigned int>, double, double&>, std::less, std::vector > >, boost::adj_list_edge_property_map >, boost::edge_weight_t>, boost::dummy_property_map, boost::iterator_property_map<__gnu_cxx::__normal_iterator > >, boost::vec_adj_list_vertex_id_map >, long unsigned int>, double, double&>, std::plus, std::less > > >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:72:8: [ skipping 16 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/betweenness_centrality.hpp:349:31: required from ‘void boost::detail::graph::brandes_betweenness_centrality_impl(const Graph&, CentralityMap, EdgeCentralityMap, IncomingMap, DistanceMap, DependencyMap, PathCountMap, VertexIndexMap, ShortestPaths) [with Graph = boost::adjacency_list >, boost::property > >; CentralityMap = boost::vec_adj_list_vertex_property_map >, boost::property > >, boost::adjacency_list >, boost::property > >*, double, double&, boost::vertex_centrality_t>; EdgeCentralityMap = boost::adj_list_edge_property_map >, boost::edge_centrality_t>; IncomingMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator, std::allocator > >*, std::vector, std::allocator > >, std::allocator, std::allocator > > > > >, boost::vec_adj_list_vertex_id_map >, long unsigned int>, std::vector, std::allocator > >, std::vector, std::allocator > >&>; DistanceMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator > >, boost::vec_adj_list_vertex_id_map >, long unsigned int>, double, double&>; DependencyMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator > >, boost::vec_adj_list_vertex_id_map >, long unsigned int>, double, double&>; PathCountMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator > >, boost::vec_adj_list_vertex_id_map >, long unsigned int>, long unsigned int, long unsigned int&>; VertexIndexMap = boost::vec_adj_list_vertex_id_map >, long unsigned int>; ShortestPaths = brandes_dijkstra_shortest_paths >, boost::edge_weight_t> >]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/betweenness_centrality.hpp:434:55: required from ‘void boost::brandes_betweenness_centrality(const Graph&, CentralityMap, EdgeCentralityMap, IncomingMap, DistanceMap, DependencyMap, PathCountMap, VertexIndexMap, WeightMap, typename enable_if_c::traversal_category>::value, graph::detail::no_parameter>::type) [with Graph = adjacency_list >, property > >; CentralityMap = vec_adj_list_vertex_property_map >, property > >, adjacency_list >, property > >*, double, double&, vertex_centrality_t>; EdgeCentralityMap = adj_list_edge_property_map >, edge_centrality_t>; IncomingMap = iterator_property_map<__gnu_cxx::__normal_iterator, std::allocator > >*, std::vector, std::allocator > >, std::allocator, std::allocator > > > > >, vec_adj_list_vertex_id_map >, long unsigned int>, std::vector, std::allocator > >, std::vector, std::allocator > >&>; DistanceMap = iterator_property_map<__gnu_cxx::__normal_iterator > >, vec_adj_list_vertex_id_map >, long unsigned int>, double, double&>; DependencyMap = iterator_property_map<__gnu_cxx::__normal_iterator > >, vec_adj_list_vertex_id_map >, long unsigned int>, double, double&>; PathCountMap = iterator_property_map<__gnu_cxx::__normal_iterator > >, vec_adj_list_vertex_id_map >, long unsigned int>, long unsigned int, long unsigned int&>; VertexIndexMap = vec_adj_list_vertex_id_map >, long unsigned int>; WeightMap = adj_list_edge_property_map >, edge_weight_t>; typename enable_if_c::traversal_category>::value, graph::detail::no_parameter>::type = graph::detail::no_parameter; typename graph_traits::traversal_category = undir_adj_list_traversal_tag]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/betweenness_centrality.hpp:468:43: required from ‘void boost::detail::graph::brandes_betweenness_centrality_dispatch2(const Graph&, CentralityMap, EdgeCentralityMap, WeightMap, VertexIndexMap) [with Graph = boost::adjacency_list >, boost::property > >; CentralityMap = boost::vec_adj_list_vertex_property_map >, boost::property > >, boost::adjacency_list >, boost::property > >*, double, double&, boost::vertex_centrality_t>; EdgeCentralityMap = boost::adj_list_edge_property_map >, boost::edge_centrality_t>; WeightMap = boost::adj_list_edge_property_map >, boost::edge_weight_t>; VertexIndexMap = boost::vec_adj_list_vertex_id_map >, long unsigned int>]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/betweenness_centrality.hpp:517:57: required from ‘static void boost::detail::graph::brandes_betweenness_centrality_dispatch1::run(const Graph&, CentralityMap, EdgeCentralityMap, VertexIndexMap, WeightMap) [with Graph = boost::adjacency_list >, boost::property > >; CentralityMap = boost::vec_adj_list_vertex_property_map >, boost::property > >, boost::adjacency_list >, boost::property > >*, double, double&, boost::vertex_centrality_t>; EdgeCentralityMap = boost::adj_list_edge_property_map >, boost::edge_centrality_t>; VertexIndexMap = boost::vec_adj_list_vertex_id_map >, long unsigned int>; WeightMap = boost::adj_list_edge_property_map >, boost::edge_weight_t>]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/betweenness_centrality.hpp:558:71: required from ‘void boost::brandes_betweenness_centrality(const Graph&, const bgl_named_params&, typename enable_if_c::traversal_category>::value, graph::detail::no_parameter>::type) [with Graph = adjacency_list >, property > >; Param = adj_list_edge_property_map >, edge_weight_t>; Tag = edge_weight_t; Rest = bgl_named_params >, edge_centrality_t>, edge_centrality_t, bgl_named_params >, property > >, adjacency_list >, property > >*, double, double&, vertex_centrality_t>, vertex_centrality_t, no_property> >; typename enable_if_c::traversal_category>::value, graph::detail::no_parameter>::type = graph::detail::no_parameter; typename graph_traits::traversal_category = undir_adj_list_traversal_tag]’ bbc.cpp:67:33: required from here /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::CopyConstructible >, boost::property > >, boost::adj_list_edge_property_map >, boost::edge_weight_t>, boost::iterator_property_map<__gnu_cxx::__normal_iterator, std::allocator > >*, std::vector, std::allocator > >, std::allocator, std::allocator > > > > >, boost::vec_adj_list_vertex_id_map >, long unsigned int>, std::vector, std::allocator > >, std::vector, std::allocator > >&>, boost::iterator_property_map<__gnu_cxx::__normal_iterator > >, boost::vec_adj_list_vertex_id_map >, long unsigned int>, double, double&>, boost::iterator_property_map<__gnu_cxx::__normal_iterator > >, boost::vec_adj_list_vertex_id_map >, long unsigned int>, long unsigned int, long unsigned int&> >, boost::d_ary_heap_indirect >, long unsigned int>, long unsigned int, long unsigned int&>, boost::iterator_property_map<__gnu_cxx::__normal_iterator > >, boost::vec_adj_list_vertex_id_map >, long unsigned int>, double, double&>, std::less, std::vector > >, boost::adj_list_edge_property_map >, boost::edge_weight_t>, boost::dummy_property_map, boost::iterator_property_map<__gnu_cxx::__normal_iterator > >, boost::vec_adj_list_vertex_id_map >, long unsigned int>, double, double&>, std::plus, std::less > >]’ 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ^ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::CopyConstructibleConcept >, boost::property > >, boost::adj_list_edge_property_map >, boost::edge_weight_t>, boost::iterator_property_map<__gnu_cxx::__normal_iterator, std::allocator > >*, std::vector, std::allocator > >, std::allocator, std::allocator > > > > >, boost::vec_adj_list_vertex_id_map >, long unsigned int>, std::vector, std::allocator > >, std::vector, std::allocator > >&>, boost::iterator_property_map<__gnu_cxx::__normal_iterator > >, boost::vec_adj_list_vertex_id_map >, long unsigned int>, double, double&>, boost::iterator_property_map<__gnu_cxx::__normal_iterator > >, boost::vec_adj_list_vertex_id_map >, long unsigned int>, long unsigned int, long unsigned int&> >, boost::d_ary_heap_indirect >, long unsigned int>, long unsigned int, long unsigned int&>, boost::iterator_property_map<__gnu_cxx::__normal_iterator > >, boost::vec_adj_list_vertex_id_map >, long unsigned int>, double, double&>, std::less, std::vector > >, boost::adj_list_edge_property_map >, boost::edge_weight_t>, boost::dummy_property_map, boost::iterator_property_map<__gnu_cxx::__normal_iterator > >, boost::vec_adj_list_vertex_id_map >, long unsigned int>, double, double&>, std::plus, std::less > >]’: /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/depth_first_search.hpp:41:9: required from ‘void boost::BFSVisitorConcept::constraints() [with Visitor = boost::detail::dijkstra_bfs_visitor >, boost::property > >, boost::adj_list_edge_property_map >, boost::edge_weight_t>, boost::iterator_property_map<__gnu_cxx::__normal_iterator, std::allocator > >*, std::vector, std::allocator > >, std::allocator, std::allocator > > > > >, boost::vec_adj_list_vertex_id_map >, long unsigned int>, std::vector, std::allocator > >, std::vector, std::allocator > >&>, boost::iterator_property_map<__gnu_cxx::__normal_iterator > >, boost::vec_adj_list_vertex_id_map >, long unsigned int>, double, double&>, boost::iterator_property_map<__gnu_cxx::__normal_iterator > >, boost::vec_adj_list_vertex_id_map >, long unsigned int>, long unsigned int, long unsigned int&> >, boost::d_ary_heap_indirect >, long unsigned int>, long unsigned int, long unsigned int&>, boost::iterator_property_map<__gnu_cxx::__normal_iterator > >, boost::vec_adj_list_vertex_id_map >, long unsigned int>, double, double&>, std::less, std::vector > >, boost::adj_list_edge_property_map >, boost::edge_weight_t>, boost::dummy_property_map, boost::iterator_property_map<__gnu_cxx::__normal_iterator > >, boost::vec_adj_list_vertex_id_map >, long unsigned int>, double, double&>, std::plus, std::less >; Graph = boost::adjacency_list >, boost::property > >]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::BFSVisitorConcept >, boost::property > >, boost::adj_list_edge_property_map >, boost::edge_weight_t>, boost::iterator_property_map<__gnu_cxx::__normal_iterator, std::allocator > >*, std::vector, std::allocator > >, std::allocator, std::allocator > > > > >, boost::vec_adj_list_vertex_id_map >, long unsigned int>, std::vector, std::allocator > >, std::vector, std::allocator > >&>, boost::iterator_property_map<__gnu_cxx::__normal_iterator > >, boost::vec_adj_list_vertex_id_map >, long unsigned int>, double, double&>, boost::iterator_property_map<__gnu_cxx::__normal_iterator > >, boost::vec_adj_list_vertex_id_map >, long unsigned int>, long unsigned int, long unsigned int&> >, boost::d_ary_heap_indirect >, long unsigned int>, long unsigned int, long unsigned int&>, boost::iterator_property_map<__gnu_cxx::__normal_iterator > >, boost::vec_adj_list_vertex_id_map >, long unsigned int>, double, double&>, std::less, std::vector > >, boost::adj_list_edge_property_map >, boost::edge_weight_t>, boost::dummy_property_map, boost::iterator_property_map<__gnu_cxx::__normal_iterator > >, boost::vec_adj_list_vertex_id_map >, long unsigned int>, double, double&>, std::plus, std::less >, boost::adjacency_list >, boost::property > > >]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied >, boost::property > >, boost::adj_list_edge_property_map >, boost::edge_weight_t>, boost::iterator_property_map<__gnu_cxx::__normal_iterator, std::allocator > >*, std::vector, std::allocator > >, std::allocator, std::allocator > > > > >, boost::vec_adj_list_vertex_id_map >, long unsigned int>, std::vector, std::allocator > >, std::vector, std::allocator > >&>, boost::iterator_property_map<__gnu_cxx::__normal_iterator > >, boost::vec_adj_list_vertex_id_map >, long unsigned int>, double, double&>, boost::iterator_property_map<__gnu_cxx::__normal_iterator > >, boost::vec_adj_list_vertex_id_map >, long unsigned int>, long unsigned int, long unsigned int&> >, boost::d_ary_heap_indirect >, long unsigned int>, long unsigned int, long unsigned int&>, boost::iterator_property_map<__gnu_cxx::__normal_iterator > >, boost::vec_adj_list_vertex_id_map >, long unsigned int>, double, double&>, std::less, std::vector > >, boost::adj_list_edge_property_map >, boost::edge_weight_t>, boost::dummy_property_map, boost::iterator_property_map<__gnu_cxx::__normal_iterator > >, boost::vec_adj_list_vertex_id_map >, long unsigned int>, double, double&>, std::plus, std::less >, boost::adjacency_list >, boost::property > > > >::value’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied >, boost::property > >, boost::adj_list_edge_property_map >, boost::edge_weight_t>, boost::iterator_property_map<__gnu_cxx::__normal_iterator, std::allocator > >*, std::vector, std::allocator > >, std::allocator, std::allocator > > > > >, boost::vec_adj_list_vertex_id_map >, long unsigned int>, std::vector, std::allocator > >, std::vector, std::allocator > >&>, boost::iterator_property_map<__gnu_cxx::__normal_iterator > >, boost::vec_adj_list_vertex_id_map >, long unsigned int>, double, double&>, boost::iterator_property_map<__gnu_cxx::__normal_iterator > >, boost::vec_adj_list_vertex_id_map >, long unsigned int>, long unsigned int, long unsigned int&> >, boost::d_ary_heap_indirect >, long unsigned int>, long unsigned int, long unsigned int&>, boost::iterator_property_map<__gnu_cxx::__normal_iterator > >, boost::vec_adj_list_vertex_id_map >, long unsigned int>, double, double&>, std::less, std::vector > >, boost::adj_list_edge_property_map >, boost::edge_weight_t>, boost::dummy_property_map, boost::iterator_property_map<__gnu_cxx::__normal_iterator > >, boost::vec_adj_list_vertex_id_map >, long unsigned int>, double, double&>, std::plus, std::less >, boost::adjacency_list >, boost::property > > > >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_ >, boost::property > >, boost::adj_list_edge_property_map >, boost::edge_weight_t>, boost::iterator_property_map<__gnu_cxx::__normal_iterator, std::allocator > >*, std::vector, std::allocator > >, std::allocator, std::allocator > > > > >, boost::vec_adj_list_vertex_id_map >, long unsigned int>, std::vector, std::allocator > >, std::vector, std::allocator > >&>, boost::iterator_property_map<__gnu_cxx::__normal_iterator > >, boost::vec_adj_list_vertex_id_map >, long unsigned int>, double, double&>, boost::iterator_property_map<__gnu_cxx::__normal_iterator > >, boost::vec_adj_list_vertex_id_map >, long unsigned int>, long unsigned int, long unsigned int&> >, boost::d_ary_heap_indirect >, long unsigned int>, long unsigned int, long unsigned int&>, boost::iterator_property_map<__gnu_cxx::__normal_iterator > >, boost::vec_adj_list_vertex_id_map >, long unsigned int>, double, double&>, std::less, std::vector > >, boost::adj_list_edge_property_map >, boost::edge_weight_t>, boost::dummy_property_map, boost::iterator_property_map<__gnu_cxx::__normal_iterator > >, boost::vec_adj_list_vertex_id_map >, long unsigned int>, double, double&>, std::plus, std::less >, boost::adjacency_list >, boost::property > > >)>’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/breadth_first_search.hpp:65:5: [ skipping 10 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/betweenness_centrality.hpp:349:31: required from ‘void boost::detail::graph::brandes_betweenness_centrality_impl(const Graph&, CentralityMap, EdgeCentralityMap, IncomingMap, DistanceMap, DependencyMap, PathCountMap, VertexIndexMap, ShortestPaths) [with Graph = boost::adjacency_list >, boost::property > >; CentralityMap = boost::vec_adj_list_vertex_property_map >, boost::property > >, boost::adjacency_list >, boost::property > >*, double, double&, boost::vertex_centrality_t>; EdgeCentralityMap = boost::adj_list_edge_property_map >, boost::edge_centrality_t>; IncomingMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator, std::allocator > >*, std::vector, std::allocator > >, std::allocator, std::allocator > > > > >, boost::vec_adj_list_vertex_id_map >, long unsigned int>, std::vector, std::allocator > >, std::vector, std::allocator > >&>; DistanceMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator > >, boost::vec_adj_list_vertex_id_map >, long unsigned int>, double, double&>; DependencyMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator > >, boost::vec_adj_list_vertex_id_map >, long unsigned int>, double, double&>; PathCountMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator > >, boost::vec_adj_list_vertex_id_map >, long unsigned int>, long unsigned int, long unsigned int&>; VertexIndexMap = boost::vec_adj_list_vertex_id_map >, long unsigned int>; ShortestPaths = brandes_dijkstra_shortest_paths >, boost::edge_weight_t> >]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/betweenness_centrality.hpp:434:55: required from ‘void boost::brandes_betweenness_centrality(const Graph&, CentralityMap, EdgeCentralityMap, IncomingMap, DistanceMap, DependencyMap, PathCountMap, VertexIndexMap, WeightMap, typename enable_if_c::traversal_category>::value, graph::detail::no_parameter>::type) [with Graph = adjacency_list >, property > >; CentralityMap = vec_adj_list_vertex_property_map >, property > >, adjacency_list >, property > >*, double, double&, vertex_centrality_t>; EdgeCentralityMap = adj_list_edge_property_map >, edge_centrality_t>; IncomingMap = iterator_property_map<__gnu_cxx::__normal_iterator, std::allocator > >*, std::vector, std::allocator > >, std::allocator, std::allocator > > > > >, vec_adj_list_vertex_id_map >, long unsigned int>, std::vector, std::allocator > >, std::vector, std::allocator > >&>; DistanceMap = iterator_property_map<__gnu_cxx::__normal_iterator > >, vec_adj_list_vertex_id_map >, long unsigned int>, double, double&>; DependencyMap = iterator_property_map<__gnu_cxx::__normal_iterator > >, vec_adj_list_vertex_id_map >, long unsigned int>, double, double&>; PathCountMap = iterator_property_map<__gnu_cxx::__normal_iterator > >, vec_adj_list_vertex_id_map >, long unsigned int>, long unsigned int, long unsigned int&>; VertexIndexMap = vec_adj_list_vertex_id_map >, long unsigned int>; WeightMap = adj_list_edge_property_map >, edge_weight_t>; typename enable_if_c::traversal_category>::value, graph::detail::no_parameter>::type = graph::detail::no_parameter; typename graph_traits::traversal_category = undir_adj_list_traversal_tag]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/betweenness_centrality.hpp:468:43: required from ‘void boost::detail::graph::brandes_betweenness_centrality_dispatch2(const Graph&, CentralityMap, EdgeCentralityMap, WeightMap, VertexIndexMap) [with Graph = boost::adjacency_list >, boost::property > >; CentralityMap = boost::vec_adj_list_vertex_property_map >, boost::property > >, boost::adjacency_list >, boost::property > >*, double, double&, boost::vertex_centrality_t>; EdgeCentralityMap = boost::adj_list_edge_property_map >, boost::edge_centrality_t>; WeightMap = boost::adj_list_edge_property_map >, boost::edge_weight_t>; VertexIndexMap = boost::vec_adj_list_vertex_id_map >, long unsigned int>]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/betweenness_centrality.hpp:517:57: required from ‘static void boost::detail::graph::brandes_betweenness_centrality_dispatch1::run(const Graph&, CentralityMap, EdgeCentralityMap, VertexIndexMap, WeightMap) [with Graph = boost::adjacency_list >, boost::property > >; CentralityMap = boost::vec_adj_list_vertex_property_map >, boost::property > >, boost::adjacency_list >, boost::property > >*, double, double&, boost::vertex_centrality_t>; EdgeCentralityMap = boost::adj_list_edge_property_map >, boost::edge_centrality_t>; VertexIndexMap = boost::vec_adj_list_vertex_id_map >, long unsigned int>; WeightMap = boost::adj_list_edge_property_map >, boost::edge_weight_t>]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/betweenness_centrality.hpp:558:71: required from ‘void boost::brandes_betweenness_centrality(const Graph&, const bgl_named_params&, typename enable_if_c::traversal_category>::value, graph::detail::no_parameter>::type) [with Graph = adjacency_list >, property > >; Param = adj_list_edge_property_map >, edge_weight_t>; Tag = edge_weight_t; Rest = bgl_named_params >, edge_centrality_t>, edge_centrality_t, bgl_named_params >, property > >, adjacency_list >, property > >*, double, double&, vertex_centrality_t>, vertex_centrality_t, no_property> >; typename enable_if_c::traversal_category>::value, graph::detail::no_parameter>::type = graph::detail::no_parameter; typename graph_traits::traversal_category = undir_adj_list_traversal_tag]’ bbc.cpp:67:33: required from here /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:165:17: note: in a call to non-static member function ‘boost::CopyConstructibleConcept >, boost::property > >, boost::adj_list_edge_property_map >, boost::edge_weight_t>, boost::iterator_property_map<__gnu_cxx::__normal_iterator, std::allocator > >*, std::vector, std::allocator > >, std::allocator, std::allocator > > > > >, boost::vec_adj_list_vertex_id_map >, long unsigned int>, std::vector, std::allocator > >, std::vector, std::allocator > >&>, boost::iterator_property_map<__gnu_cxx::__normal_iterator > >, boost::vec_adj_list_vertex_id_map >, long unsigned int>, double, double&>, boost::iterator_property_map<__gnu_cxx::__normal_iterator > >, boost::vec_adj_list_vertex_id_map >, long unsigned int>, long unsigned int, long unsigned int&> >, boost::d_ary_heap_indirect >, long unsigned int>, long unsigned int, long unsigned int&>, boost::iterator_property_map<__gnu_cxx::__normal_iterator > >, boost::vec_adj_list_vertex_id_map >, long unsigned int>, double, double&>, std::less, std::vector > >, boost::adj_list_edge_property_map >, boost::edge_weight_t>, boost::dummy_property_map, boost::iterator_property_map<__gnu_cxx::__normal_iterator > >, boost::vec_adj_list_vertex_id_map >, long unsigned int>, double, double&>, std::plus, std::less > >::~CopyConstructibleConcept()’ 165 | BOOST_concept(CopyConstructible,(TT)) | ^~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/preprocessor/cat.hpp:29:34: note: in definition of macro ‘BOOST_PP_CAT_I’ 29 | # define BOOST_PP_CAT_I(a, b) a ## b | ^ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/concept_def.hpp:23:12: note: in expansion of macro ‘BOOST_PP_CAT’ 23 | struct BOOST_PP_CAT(name,Concept) \ | ^~~~~~~~~~~~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:165:3: note: in expansion of macro ‘BOOST_concept’ 165 | BOOST_concept(CopyConstructible,(TT)) | ^~~~~~~~~~~~~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::constraint::failed() [with Model = boost::ReadablePropertyMapConcept >, long unsigned int> >, long unsigned int>]’: /home/omnipath/local/R/4.4-3.20/BH/include/boost/property_map/property_map.hpp:206:7: required from ‘void boost::ReadWritePropertyMapConcept::constraints() [with PMap = boost::two_bit_color_map >, long unsigned int> >; Key = long unsigned int]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::ReadWritePropertyMapConcept >, long unsigned int> >, long unsigned int>]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied >, long unsigned int> >, long unsigned int> >::value’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied >, long unsigned int> >, long unsigned int> >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_ >, long unsigned int> >, long unsigned int>)>’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/breadth_first_search.hpp:66:5: [ skipping 10 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/betweenness_centrality.hpp:349:31: required from ‘void boost::detail::graph::brandes_betweenness_centrality_impl(const Graph&, CentralityMap, EdgeCentralityMap, IncomingMap, DistanceMap, DependencyMap, PathCountMap, VertexIndexMap, ShortestPaths) [with Graph = boost::adjacency_list >, boost::property > >; CentralityMap = boost::vec_adj_list_vertex_property_map >, boost::property > >, boost::adjacency_list >, boost::property > >*, double, double&, boost::vertex_centrality_t>; EdgeCentralityMap = boost::adj_list_edge_property_map >, boost::edge_centrality_t>; IncomingMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator, std::allocator > >*, std::vector, std::allocator > >, std::allocator, std::allocator > > > > >, boost::vec_adj_list_vertex_id_map >, long unsigned int>, std::vector, std::allocator > >, std::vector, std::allocator > >&>; DistanceMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator > >, boost::vec_adj_list_vertex_id_map >, long unsigned int>, double, double&>; DependencyMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator > >, boost::vec_adj_list_vertex_id_map >, long unsigned int>, double, double&>; PathCountMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator > >, boost::vec_adj_list_vertex_id_map >, long unsigned int>, long unsigned int, long unsigned int&>; VertexIndexMap = boost::vec_adj_list_vertex_id_map >, long unsigned int>; ShortestPaths = brandes_dijkstra_shortest_paths >, boost::edge_weight_t> >]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/betweenness_centrality.hpp:434:55: required from ‘void boost::brandes_betweenness_centrality(const Graph&, CentralityMap, EdgeCentralityMap, IncomingMap, DistanceMap, DependencyMap, PathCountMap, VertexIndexMap, WeightMap, typename enable_if_c::traversal_category>::value, graph::detail::no_parameter>::type) [with Graph = adjacency_list >, property > >; CentralityMap = vec_adj_list_vertex_property_map >, property > >, adjacency_list >, property > >*, double, double&, vertex_centrality_t>; EdgeCentralityMap = adj_list_edge_property_map >, edge_centrality_t>; IncomingMap = iterator_property_map<__gnu_cxx::__normal_iterator, std::allocator > >*, std::vector, std::allocator > >, std::allocator, std::allocator > > > > >, vec_adj_list_vertex_id_map >, long unsigned int>, std::vector, std::allocator > >, std::vector, std::allocator > >&>; DistanceMap = iterator_property_map<__gnu_cxx::__normal_iterator > >, vec_adj_list_vertex_id_map >, long unsigned int>, double, double&>; DependencyMap = iterator_property_map<__gnu_cxx::__normal_iterator > >, vec_adj_list_vertex_id_map >, long unsigned int>, double, double&>; PathCountMap = iterator_property_map<__gnu_cxx::__normal_iterator > >, vec_adj_list_vertex_id_map >, long unsigned int>, long unsigned int, long unsigned int&>; VertexIndexMap = vec_adj_list_vertex_id_map >, long unsigned int>; WeightMap = adj_list_edge_property_map >, edge_weight_t>; typename enable_if_c::traversal_category>::value, graph::detail::no_parameter>::type = graph::detail::no_parameter; typename graph_traits::traversal_category = undir_adj_list_traversal_tag]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/betweenness_centrality.hpp:468:43: required from ‘void boost::detail::graph::brandes_betweenness_centrality_dispatch2(const Graph&, CentralityMap, EdgeCentralityMap, WeightMap, VertexIndexMap) [with Graph = boost::adjacency_list >, boost::property > >; CentralityMap = boost::vec_adj_list_vertex_property_map >, boost::property > >, boost::adjacency_list >, boost::property > >*, double, double&, boost::vertex_centrality_t>; EdgeCentralityMap = boost::adj_list_edge_property_map >, boost::edge_centrality_t>; WeightMap = boost::adj_list_edge_property_map >, boost::edge_weight_t>; VertexIndexMap = boost::vec_adj_list_vertex_id_map >, long unsigned int>]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/betweenness_centrality.hpp:517:57: required from ‘static void boost::detail::graph::brandes_betweenness_centrality_dispatch1::run(const Graph&, CentralityMap, EdgeCentralityMap, VertexIndexMap, WeightMap) [with Graph = boost::adjacency_list >, boost::property > >; CentralityMap = boost::vec_adj_list_vertex_property_map >, boost::property > >, boost::adjacency_list >, boost::property > >*, double, double&, boost::vertex_centrality_t>; EdgeCentralityMap = boost::adj_list_edge_property_map >, boost::edge_centrality_t>; VertexIndexMap = boost::vec_adj_list_vertex_id_map >, long unsigned int>; WeightMap = boost::adj_list_edge_property_map >, boost::edge_weight_t>]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/betweenness_centrality.hpp:558:71: required from ‘void boost::brandes_betweenness_centrality(const Graph&, const bgl_named_params&, typename enable_if_c::traversal_category>::value, graph::detail::no_parameter>::type) [with Graph = adjacency_list >, property > >; Param = adj_list_edge_property_map >, edge_weight_t>; Tag = edge_weight_t; Rest = bgl_named_params >, edge_centrality_t>, edge_centrality_t, bgl_named_params >, property > >, adjacency_list >, property > >*, double, double&, vertex_centrality_t>, vertex_centrality_t, no_property> >; typename enable_if_c::traversal_category>::value, graph::detail::no_parameter>::type = graph::detail::no_parameter; typename graph_traits::traversal_category = undir_adj_list_traversal_tag]’ bbc.cpp:67:33: required from here /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:65:52: warning: ‘this’ pointer is null [-Wnonnull] 65 | static void failed() { ((Model*)0)->constraints(); } | ~~~~~~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/property_map/property_map.hpp:147:10: note: in a call to non-static member function ‘void boost::ReadablePropertyMapConcept::constraints() [with PMap = boost::two_bit_color_map >, long unsigned int> >; Key = long unsigned int]’ 147 | void constraints() { | ^~~~~~~~~~~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::constraint::failed() [with Model = boost::WritablePropertyMapConcept >, long unsigned int> >, long unsigned int>]’: /home/omnipath/local/R/4.4-3.20/BH/include/boost/property_map/property_map.hpp:207:7: required from ‘void boost::ReadWritePropertyMapConcept::constraints() [with PMap = boost::two_bit_color_map >, long unsigned int> >; Key = long unsigned int]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::ReadWritePropertyMapConcept >, long unsigned int> >, long unsigned int>]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied >, long unsigned int> >, long unsigned int> >::value’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied >, long unsigned int> >, long unsigned int> >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_ >, long unsigned int> >, long unsigned int>)>’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/breadth_first_search.hpp:66:5: [ skipping 10 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/betweenness_centrality.hpp:349:31: required from ‘void boost::detail::graph::brandes_betweenness_centrality_impl(const Graph&, CentralityMap, EdgeCentralityMap, IncomingMap, DistanceMap, DependencyMap, PathCountMap, VertexIndexMap, ShortestPaths) [with Graph = boost::adjacency_list >, boost::property > >; CentralityMap = boost::vec_adj_list_vertex_property_map >, boost::property > >, boost::adjacency_list >, boost::property > >*, double, double&, boost::vertex_centrality_t>; EdgeCentralityMap = boost::adj_list_edge_property_map >, boost::edge_centrality_t>; IncomingMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator, std::allocator > >*, std::vector, std::allocator > >, std::allocator, std::allocator > > > > >, boost::vec_adj_list_vertex_id_map >, long unsigned int>, std::vector, std::allocator > >, std::vector, std::allocator > >&>; DistanceMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator > >, boost::vec_adj_list_vertex_id_map >, long unsigned int>, double, double&>; DependencyMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator > >, boost::vec_adj_list_vertex_id_map >, long unsigned int>, double, double&>; PathCountMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator > >, boost::vec_adj_list_vertex_id_map >, long unsigned int>, long unsigned int, long unsigned int&>; VertexIndexMap = boost::vec_adj_list_vertex_id_map >, long unsigned int>; ShortestPaths = brandes_dijkstra_shortest_paths >, boost::edge_weight_t> >]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/betweenness_centrality.hpp:434:55: required from ‘void boost::brandes_betweenness_centrality(const Graph&, CentralityMap, EdgeCentralityMap, IncomingMap, DistanceMap, DependencyMap, PathCountMap, VertexIndexMap, WeightMap, typename enable_if_c::traversal_category>::value, graph::detail::no_parameter>::type) [with Graph = adjacency_list >, property > >; CentralityMap = vec_adj_list_vertex_property_map >, property > >, adjacency_list >, property > >*, double, double&, vertex_centrality_t>; EdgeCentralityMap = adj_list_edge_property_map >, edge_centrality_t>; IncomingMap = iterator_property_map<__gnu_cxx::__normal_iterator, std::allocator > >*, std::vector, std::allocator > >, std::allocator, std::allocator > > > > >, vec_adj_list_vertex_id_map >, long unsigned int>, std::vector, std::allocator > >, std::vector, std::allocator > >&>; DistanceMap = iterator_property_map<__gnu_cxx::__normal_iterator > >, vec_adj_list_vertex_id_map >, long unsigned int>, double, double&>; DependencyMap = iterator_property_map<__gnu_cxx::__normal_iterator > >, vec_adj_list_vertex_id_map >, long unsigned int>, double, double&>; PathCountMap = iterator_property_map<__gnu_cxx::__normal_iterator > >, vec_adj_list_vertex_id_map >, long unsigned int>, long unsigned int, long unsigned int&>; VertexIndexMap = vec_adj_list_vertex_id_map >, long unsigned int>; WeightMap = adj_list_edge_property_map >, edge_weight_t>; typename enable_if_c::traversal_category>::value, graph::detail::no_parameter>::type = graph::detail::no_parameter; typename graph_traits::traversal_category = undir_adj_list_traversal_tag]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/betweenness_centrality.hpp:468:43: required from ‘void boost::detail::graph::brandes_betweenness_centrality_dispatch2(const Graph&, CentralityMap, EdgeCentralityMap, WeightMap, VertexIndexMap) [with Graph = boost::adjacency_list >, boost::property > >; CentralityMap = boost::vec_adj_list_vertex_property_map >, boost::property > >, boost::adjacency_list >, boost::property > >*, double, double&, boost::vertex_centrality_t>; EdgeCentralityMap = boost::adj_list_edge_property_map >, boost::edge_centrality_t>; WeightMap = boost::adj_list_edge_property_map >, boost::edge_weight_t>; VertexIndexMap = boost::vec_adj_list_vertex_id_map >, long unsigned int>]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/betweenness_centrality.hpp:517:57: required from ‘static void boost::detail::graph::brandes_betweenness_centrality_dispatch1::run(const Graph&, CentralityMap, EdgeCentralityMap, VertexIndexMap, WeightMap) [with Graph = boost::adjacency_list >, boost::property > >; CentralityMap = boost::vec_adj_list_vertex_property_map >, boost::property > >, boost::adjacency_list >, boost::property > >*, double, double&, boost::vertex_centrality_t>; EdgeCentralityMap = boost::adj_list_edge_property_map >, boost::edge_centrality_t>; VertexIndexMap = boost::vec_adj_list_vertex_id_map >, long unsigned int>; WeightMap = boost::adj_list_edge_property_map >, boost::edge_weight_t>]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/betweenness_centrality.hpp:558:71: required from ‘void boost::brandes_betweenness_centrality(const Graph&, const bgl_named_params&, typename enable_if_c::traversal_category>::value, graph::detail::no_parameter>::type) [with Graph = adjacency_list >, property > >; Param = adj_list_edge_property_map >, edge_weight_t>; Tag = edge_weight_t; Rest = bgl_named_params >, edge_centrality_t>, edge_centrality_t, bgl_named_params >, property > >, adjacency_list >, property > >*, double, double&, vertex_centrality_t>, vertex_centrality_t, no_property> >; typename enable_if_c::traversal_category>::value, graph::detail::no_parameter>::type = graph::detail::no_parameter; typename graph_traits::traversal_category = undir_adj_list_traversal_tag]’ bbc.cpp:67:33: required from here /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:65:52: warning: ‘this’ pointer is null [-Wnonnull] 65 | static void failed() { ((Model*)0)->constraints(); } | ~~~~~~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/property_map/property_map.hpp:179:10: note: in a call to non-static member function ‘void boost::WritablePropertyMapConcept::constraints() [with PMap = boost::two_bit_color_map >, long unsigned int> >; Key = long unsigned int]’ 179 | void constraints() { | ^~~~~~~~~~~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements >]’: /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:208:5: required from ‘struct boost::Convertible’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:206:3: required from ‘struct boost::ConvertibleConcept’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::ConvertibleConcept]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied >::value’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:72:8: [ skipping 16 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/betweenness_centrality.hpp:349:31: required from ‘void boost::detail::graph::brandes_betweenness_centrality_impl(const Graph&, CentralityMap, EdgeCentralityMap, IncomingMap, DistanceMap, DependencyMap, PathCountMap, VertexIndexMap, ShortestPaths) [with Graph = boost::adjacency_list >, boost::property > >; CentralityMap = boost::vec_adj_list_vertex_property_map >, boost::property > >, boost::adjacency_list >, boost::property > >*, double, double&, boost::vertex_centrality_t>; EdgeCentralityMap = boost::adj_list_edge_property_map >, boost::edge_centrality_t>; IncomingMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator, std::allocator > >*, std::vector, std::allocator > >, std::allocator, std::allocator > > > > >, boost::vec_adj_list_vertex_id_map >, long unsigned int>, std::vector, std::allocator > >, std::vector, std::allocator > >&>; DistanceMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator > >, boost::vec_adj_list_vertex_id_map >, long unsigned int>, double, double&>; DependencyMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator > >, boost::vec_adj_list_vertex_id_map >, long unsigned int>, double, double&>; PathCountMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator > >, boost::vec_adj_list_vertex_id_map >, long unsigned int>, long unsigned int, long unsigned int&>; VertexIndexMap = boost::vec_adj_list_vertex_id_map >, long unsigned int>; ShortestPaths = brandes_dijkstra_shortest_paths >, boost::edge_weight_t> >]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/betweenness_centrality.hpp:434:55: required from ‘void boost::brandes_betweenness_centrality(const Graph&, CentralityMap, EdgeCentralityMap, IncomingMap, DistanceMap, DependencyMap, PathCountMap, VertexIndexMap, WeightMap, typename enable_if_c::traversal_category>::value, graph::detail::no_parameter>::type) [with Graph = adjacency_list >, property > >; CentralityMap = vec_adj_list_vertex_property_map >, property > >, adjacency_list >, property > >*, double, double&, vertex_centrality_t>; EdgeCentralityMap = adj_list_edge_property_map >, edge_centrality_t>; IncomingMap = iterator_property_map<__gnu_cxx::__normal_iterator, std::allocator > >*, std::vector, std::allocator > >, std::allocator, std::allocator > > > > >, vec_adj_list_vertex_id_map >, long unsigned int>, std::vector, std::allocator > >, std::vector, std::allocator > >&>; DistanceMap = iterator_property_map<__gnu_cxx::__normal_iterator > >, vec_adj_list_vertex_id_map >, long unsigned int>, double, double&>; DependencyMap = iterator_property_map<__gnu_cxx::__normal_iterator > >, vec_adj_list_vertex_id_map >, long unsigned int>, double, double&>; PathCountMap = iterator_property_map<__gnu_cxx::__normal_iterator > >, vec_adj_list_vertex_id_map >, long unsigned int>, long unsigned int, long unsigned int&>; VertexIndexMap = vec_adj_list_vertex_id_map >, long unsigned int>; WeightMap = adj_list_edge_property_map >, edge_weight_t>; typename enable_if_c::traversal_category>::value, graph::detail::no_parameter>::type = graph::detail::no_parameter; typename graph_traits::traversal_category = undir_adj_list_traversal_tag]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/betweenness_centrality.hpp:468:43: required from ‘void boost::detail::graph::brandes_betweenness_centrality_dispatch2(const Graph&, CentralityMap, EdgeCentralityMap, WeightMap, VertexIndexMap) [with Graph = boost::adjacency_list >, boost::property > >; CentralityMap = boost::vec_adj_list_vertex_property_map >, boost::property > >, boost::adjacency_list >, boost::property > >*, double, double&, boost::vertex_centrality_t>; EdgeCentralityMap = boost::adj_list_edge_property_map >, boost::edge_centrality_t>; WeightMap = boost::adj_list_edge_property_map >, boost::edge_weight_t>; VertexIndexMap = boost::vec_adj_list_vertex_id_map >, long unsigned int>]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/betweenness_centrality.hpp:517:57: required from ‘static void boost::detail::graph::brandes_betweenness_centrality_dispatch1::run(const Graph&, CentralityMap, EdgeCentralityMap, VertexIndexMap, WeightMap) [with Graph = boost::adjacency_list >, boost::property > >; CentralityMap = boost::vec_adj_list_vertex_property_map >, boost::property > >, boost::adjacency_list >, boost::property > >*, double, double&, boost::vertex_centrality_t>; EdgeCentralityMap = boost::adj_list_edge_property_map >, boost::edge_centrality_t>; VertexIndexMap = boost::vec_adj_list_vertex_id_map >, long unsigned int>; WeightMap = boost::adj_list_edge_property_map >, boost::edge_weight_t>]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/betweenness_centrality.hpp:558:71: required from ‘void boost::brandes_betweenness_centrality(const Graph&, const bgl_named_params&, typename enable_if_c::traversal_category>::value, graph::detail::no_parameter>::type) [with Graph = adjacency_list >, property > >; Param = adj_list_edge_property_map >, edge_weight_t>; Tag = edge_weight_t; Rest = bgl_named_params >, edge_centrality_t>, edge_centrality_t, bgl_named_params >, property > >, adjacency_list >, property > >*, double, double&, vertex_centrality_t>, vertex_centrality_t, no_property> >; typename enable_if_c::traversal_category>::value, graph::detail::no_parameter>::type = graph::detail::no_parameter; typename graph_traits::traversal_category = undir_adj_list_traversal_tag]’ bbc.cpp:67:33: required from here /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::Convertible]’ 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ^ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::ConvertibleConcept]’: /home/omnipath/local/R/4.4-3.20/BH/include/boost/property_map/property_map.hpp:208:7: required from ‘void boost::ReadWritePropertyMapConcept::constraints() [with PMap = boost::two_bit_color_map >, long unsigned int> >; Key = long unsigned int]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::ReadWritePropertyMapConcept >, long unsigned int> >, long unsigned int>]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied >, long unsigned int> >, long unsigned int> >::value’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied >, long unsigned int> >, long unsigned int> >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_ >, long unsigned int> >, long unsigned int>)>’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/breadth_first_search.hpp:66:5: [ skipping 10 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/betweenness_centrality.hpp:349:31: required from ‘void boost::detail::graph::brandes_betweenness_centrality_impl(const Graph&, CentralityMap, EdgeCentralityMap, IncomingMap, DistanceMap, DependencyMap, PathCountMap, VertexIndexMap, ShortestPaths) [with Graph = boost::adjacency_list >, boost::property > >; CentralityMap = boost::vec_adj_list_vertex_property_map >, boost::property > >, boost::adjacency_list >, boost::property > >*, double, double&, boost::vertex_centrality_t>; EdgeCentralityMap = boost::adj_list_edge_property_map >, boost::edge_centrality_t>; IncomingMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator, std::allocator > >*, std::vector, std::allocator > >, std::allocator, std::allocator > > > > >, boost::vec_adj_list_vertex_id_map >, long unsigned int>, std::vector, std::allocator > >, std::vector, std::allocator > >&>; DistanceMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator > >, boost::vec_adj_list_vertex_id_map >, long unsigned int>, double, double&>; DependencyMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator > >, boost::vec_adj_list_vertex_id_map >, long unsigned int>, double, double&>; PathCountMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator > >, boost::vec_adj_list_vertex_id_map >, long unsigned int>, long unsigned int, long unsigned int&>; VertexIndexMap = boost::vec_adj_list_vertex_id_map >, long unsigned int>; ShortestPaths = brandes_dijkstra_shortest_paths >, boost::edge_weight_t> >]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/betweenness_centrality.hpp:434:55: required from ‘void boost::brandes_betweenness_centrality(const Graph&, CentralityMap, EdgeCentralityMap, IncomingMap, DistanceMap, DependencyMap, PathCountMap, VertexIndexMap, WeightMap, typename enable_if_c::traversal_category>::value, graph::detail::no_parameter>::type) [with Graph = adjacency_list >, property > >; CentralityMap = vec_adj_list_vertex_property_map >, property > >, adjacency_list >, property > >*, double, double&, vertex_centrality_t>; EdgeCentralityMap = adj_list_edge_property_map >, edge_centrality_t>; IncomingMap = iterator_property_map<__gnu_cxx::__normal_iterator, std::allocator > >*, std::vector, std::allocator > >, std::allocator, std::allocator > > > > >, vec_adj_list_vertex_id_map >, long unsigned int>, std::vector, std::allocator > >, std::vector, std::allocator > >&>; DistanceMap = iterator_property_map<__gnu_cxx::__normal_iterator > >, vec_adj_list_vertex_id_map >, long unsigned int>, double, double&>; DependencyMap = iterator_property_map<__gnu_cxx::__normal_iterator > >, vec_adj_list_vertex_id_map >, long unsigned int>, double, double&>; PathCountMap = iterator_property_map<__gnu_cxx::__normal_iterator > >, vec_adj_list_vertex_id_map >, long unsigned int>, long unsigned int, long unsigned int&>; VertexIndexMap = vec_adj_list_vertex_id_map >, long unsigned int>; WeightMap = adj_list_edge_property_map >, edge_weight_t>; typename enable_if_c::traversal_category>::value, graph::detail::no_parameter>::type = graph::detail::no_parameter; typename graph_traits::traversal_category = undir_adj_list_traversal_tag]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/betweenness_centrality.hpp:468:43: required from ‘void boost::detail::graph::brandes_betweenness_centrality_dispatch2(const Graph&, CentralityMap, EdgeCentralityMap, WeightMap, VertexIndexMap) [with Graph = boost::adjacency_list >, boost::property > >; CentralityMap = boost::vec_adj_list_vertex_property_map >, boost::property > >, boost::adjacency_list >, boost::property > >*, double, double&, boost::vertex_centrality_t>; EdgeCentralityMap = boost::adj_list_edge_property_map >, boost::edge_centrality_t>; WeightMap = boost::adj_list_edge_property_map >, boost::edge_weight_t>; VertexIndexMap = boost::vec_adj_list_vertex_id_map >, long unsigned int>]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/betweenness_centrality.hpp:517:57: required from ‘static void boost::detail::graph::brandes_betweenness_centrality_dispatch1::run(const Graph&, CentralityMap, EdgeCentralityMap, VertexIndexMap, WeightMap) [with Graph = boost::adjacency_list >, boost::property > >; CentralityMap = boost::vec_adj_list_vertex_property_map >, boost::property > >, boost::adjacency_list >, boost::property > >*, double, double&, boost::vertex_centrality_t>; EdgeCentralityMap = boost::adj_list_edge_property_map >, boost::edge_centrality_t>; VertexIndexMap = boost::vec_adj_list_vertex_id_map >, long unsigned int>; WeightMap = boost::adj_list_edge_property_map >, boost::edge_weight_t>]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/betweenness_centrality.hpp:558:71: required from ‘void boost::brandes_betweenness_centrality(const Graph&, const bgl_named_params&, typename enable_if_c::traversal_category>::value, graph::detail::no_parameter>::type) [with Graph = adjacency_list >, property > >; Param = adj_list_edge_property_map >, edge_weight_t>; Tag = edge_weight_t; Rest = bgl_named_params >, edge_centrality_t>, edge_centrality_t, bgl_named_params >, property > >, adjacency_list >, property > >*, double, double&, vertex_centrality_t>, vertex_centrality_t, no_property> >; typename enable_if_c::traversal_category>::value, graph::detail::no_parameter>::type = graph::detail::no_parameter; typename graph_traits::traversal_category = undir_adj_list_traversal_tag]’ bbc.cpp:67:33: required from here /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:206:17: note: in a call to non-static member function ‘boost::ConvertibleConcept::~ConvertibleConcept()’ 206 | BOOST_concept(Convertible,(X)(Y)) | ^~~~~~~~~~~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/preprocessor/cat.hpp:29:34: note: in definition of macro ‘BOOST_PP_CAT_I’ 29 | # define BOOST_PP_CAT_I(a, b) a ## b | ^ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/concept_def.hpp:23:12: note: in expansion of macro ‘BOOST_PP_CAT’ 23 | struct BOOST_PP_CAT(name,Concept) \ | ^~~~~~~~~~~~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:206:3: note: in expansion of macro ‘BOOST_concept’ 206 | BOOST_concept(Convertible,(X)(Y)) | ^~~~~~~~~~~~~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements, std::input_iterator_tag> >]’: /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:208:5: required from ‘struct boost::Convertible, std::input_iterator_tag>’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::Convertible, std::input_iterator_tag>]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied, std::input_iterator_tag> >::value’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied, std::input_iterator_tag> >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_, std::input_iterator_tag>)>’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:515:9: [ skipping 11 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/betweenness_centrality.hpp:500:43: required from ‘void boost::detail::graph::brandes_betweenness_centrality_dispatch2(const Graph&, CentralityMap, EdgeCentralityMap, VertexIndexMap) [with Graph = boost::adjacency_list >, boost::property > >; CentralityMap = boost::dummy_property_map; EdgeCentralityMap = boost::adj_list_edge_property_map >, boost::edge_centrality_t>; VertexIndexMap = boost::vec_adj_list_vertex_id_map >, long unsigned int>]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/betweenness_centrality.hpp:531:57: required from ‘static void boost::detail::graph::brandes_betweenness_centrality_dispatch1::run(const Graph&, CentralityMap, EdgeCentralityMap, VertexIndexMap, boost::param_not_found) [with Graph = boost::adjacency_list >, boost::property > >; CentralityMap = boost::dummy_property_map; EdgeCentralityMap = boost::adj_list_edge_property_map >, boost::edge_centrality_t>; VertexIndexMap = boost::vec_adj_list_vertex_id_map >, long unsigned int>]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/betweenness_centrality.hpp:558:71: required from ‘void boost::brandes_betweenness_centrality(const Graph&, const bgl_named_params&, typename enable_if_c::traversal_category>::value, graph::detail::no_parameter>::type) [with Graph = adjacency_list >, property > >; Param = vec_adj_list_vertex_id_map >, long unsigned int>; Tag = vertex_index_t; Rest = bgl_named_params >, edge_centrality_t>, edge_centrality_t, no_property>; typename enable_if_c::traversal_category>::value, graph::detail::no_parameter>::type = graph::detail::no_parameter; typename graph_traits::traversal_category = undir_adj_list_traversal_tag]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/bc_clustering.hpp:131:39: required from ‘void boost::betweenness_centrality_clustering(MutableGraph&, Done, EdgeCentralityMap, VertexIndexMap) [with MutableGraph = adjacency_list >, property > >; Done = clustering_threshold; EdgeCentralityMap = adj_list_edge_property_map >, edge_centrality_t>; VertexIndexMap = vec_adj_list_vertex_id_map >, long unsigned int>]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/bc_clustering.hpp:150:38: required from ‘void boost::betweenness_centrality_clustering(MutableGraph&, Done, EdgeCentralityMap) [with MutableGraph = adjacency_list >, property > >; Done = clustering_threshold; EdgeCentralityMap = adj_list_edge_property_map >, edge_centrality_t>]’ bbc.cpp:149:36: required from here /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::Convertible, std::input_iterator_tag>]’ 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ^ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::Convertible, std::input_iterator_tag>]’: /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:515:9: required from ‘boost::InputIterator::~InputIterator() [with TT = boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > > >, boost::property > >*, std::vector > > >, boost::property > >, std::allocator > > >, boost::property > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::InputIterator > > >, boost::property > >*, std::vector > > >, boost::property > >, std::allocator > > >, boost::property > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> >]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/graph_concepts.hpp:53:35: required from ‘boost::concepts::MultiPassInputIterator::~MultiPassInputIterator() [with T = boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > > >, boost::property > >*, std::vector > > >, boost::property > >, std::allocator > > >, boost::property > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::MultiPassInputIterator > > >, boost::property > >*, std::vector > > >, boost::property > >, std::allocator > > >, boost::property > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> >]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/graph_concepts.hpp:89:9: required from ‘boost::concepts::IncidenceGraph::~IncidenceGraph() [with G = boost::adjacency_list >, boost::property > >]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/graph_concepts.hpp:75:1: [ skipping 6 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/betweenness_centrality.hpp:500:43: required from ‘void boost::detail::graph::brandes_betweenness_centrality_dispatch2(const Graph&, CentralityMap, EdgeCentralityMap, VertexIndexMap) [with Graph = boost::adjacency_list >, boost::property > >; CentralityMap = boost::dummy_property_map; EdgeCentralityMap = boost::adj_list_edge_property_map >, boost::edge_centrality_t>; VertexIndexMap = boost::vec_adj_list_vertex_id_map >, long unsigned int>]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/betweenness_centrality.hpp:531:57: required from ‘static void boost::detail::graph::brandes_betweenness_centrality_dispatch1::run(const Graph&, CentralityMap, EdgeCentralityMap, VertexIndexMap, boost::param_not_found) [with Graph = boost::adjacency_list >, boost::property > >; CentralityMap = boost::dummy_property_map; EdgeCentralityMap = boost::adj_list_edge_property_map >, boost::edge_centrality_t>; VertexIndexMap = boost::vec_adj_list_vertex_id_map >, long unsigned int>]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/betweenness_centrality.hpp:558:71: required from ‘void boost::brandes_betweenness_centrality(const Graph&, const bgl_named_params&, typename enable_if_c::traversal_category>::value, graph::detail::no_parameter>::type) [with Graph = adjacency_list >, property > >; Param = vec_adj_list_vertex_id_map >, long unsigned int>; Tag = vertex_index_t; Rest = bgl_named_params >, edge_centrality_t>, edge_centrality_t, no_property>; typename enable_if_c::traversal_category>::value, graph::detail::no_parameter>::type = graph::detail::no_parameter; typename graph_traits::traversal_category = undir_adj_list_traversal_tag]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/bc_clustering.hpp:131:39: required from ‘void boost::betweenness_centrality_clustering(MutableGraph&, Done, EdgeCentralityMap, VertexIndexMap) [with MutableGraph = adjacency_list >, property > >; Done = clustering_threshold; EdgeCentralityMap = adj_list_edge_property_map >, edge_centrality_t>; VertexIndexMap = vec_adj_list_vertex_id_map >, long unsigned int>]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/bc_clustering.hpp:150:38: required from ‘void boost::betweenness_centrality_clustering(MutableGraph&, Done, EdgeCentralityMap) [with MutableGraph = adjacency_list >, property > >; Done = clustering_threshold; EdgeCentralityMap = adj_list_edge_property_map >, edge_centrality_t>]’ bbc.cpp:149:36: required from here /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::Convertible::~Convertible() [with X = boost::iterators::detail::iterator_category_with_traversal; Y = std::input_iterator_tag]’ 37 | ~model() | ^ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:208:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 208 | BOOST_CONCEPT_USAGE(Convertible) { | ^~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements >]’: /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:145:5: required from ‘struct boost::Assignable’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:502:3: required from ‘struct boost::InputIterator’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:540:3: required from ‘struct boost::ForwardIterator’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:568:3: required from ‘struct boost::BidirectionalIterator’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:597:3: required from ‘struct boost::RandomAccessIterator’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:597:3: [ skipping 17 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/betweenness_centrality.hpp:349:31: required from ‘void boost::detail::graph::brandes_betweenness_centrality_impl(const Graph&, CentralityMap, EdgeCentralityMap, IncomingMap, DistanceMap, DependencyMap, PathCountMap, VertexIndexMap, ShortestPaths) [with Graph = boost::adjacency_list >, boost::property > >; CentralityMap = boost::vec_adj_list_vertex_property_map >, boost::property > >, boost::adjacency_list >, boost::property > >*, double, double&, boost::vertex_centrality_t>; EdgeCentralityMap = boost::adj_list_edge_property_map >, boost::edge_centrality_t>; IncomingMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator, std::allocator > >*, std::vector, std::allocator > >, std::allocator, std::allocator > > > > >, boost::vec_adj_list_vertex_id_map >, long unsigned int>, std::vector, std::allocator > >, std::vector, std::allocator > >&>; DistanceMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator > >, boost::vec_adj_list_vertex_id_map >, long unsigned int>, double, double&>; DependencyMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator > >, boost::vec_adj_list_vertex_id_map >, long unsigned int>, double, double&>; PathCountMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator > >, boost::vec_adj_list_vertex_id_map >, long unsigned int>, long unsigned int, long unsigned int&>; VertexIndexMap = boost::vec_adj_list_vertex_id_map >, long unsigned int>; ShortestPaths = brandes_dijkstra_shortest_paths >, boost::edge_weight_t> >]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/betweenness_centrality.hpp:434:55: required from ‘void boost::brandes_betweenness_centrality(const Graph&, CentralityMap, EdgeCentralityMap, IncomingMap, DistanceMap, DependencyMap, PathCountMap, VertexIndexMap, WeightMap, typename enable_if_c::traversal_category>::value, graph::detail::no_parameter>::type) [with Graph = adjacency_list >, property > >; CentralityMap = vec_adj_list_vertex_property_map >, property > >, adjacency_list >, property > >*, double, double&, vertex_centrality_t>; EdgeCentralityMap = adj_list_edge_property_map >, edge_centrality_t>; IncomingMap = iterator_property_map<__gnu_cxx::__normal_iterator, std::allocator > >*, std::vector, std::allocator > >, std::allocator, std::allocator > > > > >, vec_adj_list_vertex_id_map >, long unsigned int>, std::vector, std::allocator > >, std::vector, std::allocator > >&>; DistanceMap = iterator_property_map<__gnu_cxx::__normal_iterator > >, vec_adj_list_vertex_id_map >, long unsigned int>, double, double&>; DependencyMap = iterator_property_map<__gnu_cxx::__normal_iterator > >, vec_adj_list_vertex_id_map >, long unsigned int>, double, double&>; PathCountMap = iterator_property_map<__gnu_cxx::__normal_iterator > >, vec_adj_list_vertex_id_map >, long unsigned int>, long unsigned int, long unsigned int&>; VertexIndexMap = vec_adj_list_vertex_id_map >, long unsigned int>; WeightMap = adj_list_edge_property_map >, edge_weight_t>; typename enable_if_c::traversal_category>::value, graph::detail::no_parameter>::type = graph::detail::no_parameter; typename graph_traits::traversal_category = undir_adj_list_traversal_tag]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/betweenness_centrality.hpp:468:43: required from ‘void boost::detail::graph::brandes_betweenness_centrality_dispatch2(const Graph&, CentralityMap, EdgeCentralityMap, WeightMap, VertexIndexMap) [with Graph = boost::adjacency_list >, boost::property > >; CentralityMap = boost::vec_adj_list_vertex_property_map >, boost::property > >, boost::adjacency_list >, boost::property > >*, double, double&, boost::vertex_centrality_t>; EdgeCentralityMap = boost::adj_list_edge_property_map >, boost::edge_centrality_t>; WeightMap = boost::adj_list_edge_property_map >, boost::edge_weight_t>; VertexIndexMap = boost::vec_adj_list_vertex_id_map >, long unsigned int>]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/betweenness_centrality.hpp:517:57: required from ‘static void boost::detail::graph::brandes_betweenness_centrality_dispatch1::run(const Graph&, CentralityMap, EdgeCentralityMap, VertexIndexMap, WeightMap) [with Graph = boost::adjacency_list >, boost::property > >; CentralityMap = boost::vec_adj_list_vertex_property_map >, boost::property > >, boost::adjacency_list >, boost::property > >*, double, double&, boost::vertex_centrality_t>; EdgeCentralityMap = boost::adj_list_edge_property_map >, boost::edge_centrality_t>; VertexIndexMap = boost::vec_adj_list_vertex_id_map >, long unsigned int>; WeightMap = boost::adj_list_edge_property_map >, boost::edge_weight_t>]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/betweenness_centrality.hpp:558:71: required from ‘void boost::brandes_betweenness_centrality(const Graph&, const bgl_named_params&, typename enable_if_c::traversal_category>::value, graph::detail::no_parameter>::type) [with Graph = adjacency_list >, property > >; Param = adj_list_edge_property_map >, edge_weight_t>; Tag = edge_weight_t; Rest = bgl_named_params >, edge_centrality_t>, edge_centrality_t, bgl_named_params >, property > >, adjacency_list >, property > >*, double, double&, vertex_centrality_t>, vertex_centrality_t, no_property> >; typename enable_if_c::traversal_category>::value, graph::detail::no_parameter>::type = graph::detail::no_parameter; typename graph_traits::traversal_category = undir_adj_list_traversal_tag]’ bbc.cpp:67:33: required from here /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::Assignable]’ 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ^ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements >]’: /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:233:5: required from ‘struct boost::EqualityComparable’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:502:3: required from ‘struct boost::InputIterator’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:540:3: required from ‘struct boost::ForwardIterator’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:568:3: required from ‘struct boost::BidirectionalIterator’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:597:3: required from ‘struct boost::RandomAccessIterator’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:597:3: [ skipping 17 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/betweenness_centrality.hpp:349:31: required from ‘void boost::detail::graph::brandes_betweenness_centrality_impl(const Graph&, CentralityMap, EdgeCentralityMap, IncomingMap, DistanceMap, DependencyMap, PathCountMap, VertexIndexMap, ShortestPaths) [with Graph = boost::adjacency_list >, boost::property > >; CentralityMap = boost::vec_adj_list_vertex_property_map >, boost::property > >, boost::adjacency_list >, boost::property > >*, double, double&, boost::vertex_centrality_t>; EdgeCentralityMap = boost::adj_list_edge_property_map >, boost::edge_centrality_t>; IncomingMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator, std::allocator > >*, std::vector, std::allocator > >, std::allocator, std::allocator > > > > >, boost::vec_adj_list_vertex_id_map >, long unsigned int>, std::vector, std::allocator > >, std::vector, std::allocator > >&>; DistanceMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator > >, boost::vec_adj_list_vertex_id_map >, long unsigned int>, double, double&>; DependencyMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator > >, boost::vec_adj_list_vertex_id_map >, long unsigned int>, double, double&>; PathCountMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator > >, boost::vec_adj_list_vertex_id_map >, long unsigned int>, long unsigned int, long unsigned int&>; VertexIndexMap = boost::vec_adj_list_vertex_id_map >, long unsigned int>; ShortestPaths = brandes_dijkstra_shortest_paths >, boost::edge_weight_t> >]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/betweenness_centrality.hpp:434:55: required from ‘void boost::brandes_betweenness_centrality(const Graph&, CentralityMap, EdgeCentralityMap, IncomingMap, DistanceMap, DependencyMap, PathCountMap, VertexIndexMap, WeightMap, typename enable_if_c::traversal_category>::value, graph::detail::no_parameter>::type) [with Graph = adjacency_list >, property > >; CentralityMap = vec_adj_list_vertex_property_map >, property > >, adjacency_list >, property > >*, double, double&, vertex_centrality_t>; EdgeCentralityMap = adj_list_edge_property_map >, edge_centrality_t>; IncomingMap = iterator_property_map<__gnu_cxx::__normal_iterator, std::allocator > >*, std::vector, std::allocator > >, std::allocator, std::allocator > > > > >, vec_adj_list_vertex_id_map >, long unsigned int>, std::vector, std::allocator > >, std::vector, std::allocator > >&>; DistanceMap = iterator_property_map<__gnu_cxx::__normal_iterator > >, vec_adj_list_vertex_id_map >, long unsigned int>, double, double&>; DependencyMap = iterator_property_map<__gnu_cxx::__normal_iterator > >, vec_adj_list_vertex_id_map >, long unsigned int>, double, double&>; PathCountMap = iterator_property_map<__gnu_cxx::__normal_iterator > >, vec_adj_list_vertex_id_map >, long unsigned int>, long unsigned int, long unsigned int&>; VertexIndexMap = vec_adj_list_vertex_id_map >, long unsigned int>; WeightMap = adj_list_edge_property_map >, edge_weight_t>; typename enable_if_c::traversal_category>::value, graph::detail::no_parameter>::type = graph::detail::no_parameter; typename graph_traits::traversal_category = undir_adj_list_traversal_tag]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/betweenness_centrality.hpp:468:43: required from ‘void boost::detail::graph::brandes_betweenness_centrality_dispatch2(const Graph&, CentralityMap, EdgeCentralityMap, WeightMap, VertexIndexMap) [with Graph = boost::adjacency_list >, boost::property > >; CentralityMap = boost::vec_adj_list_vertex_property_map >, boost::property > >, boost::adjacency_list >, boost::property > >*, double, double&, boost::vertex_centrality_t>; EdgeCentralityMap = boost::adj_list_edge_property_map >, boost::edge_centrality_t>; WeightMap = boost::adj_list_edge_property_map >, boost::edge_weight_t>; VertexIndexMap = boost::vec_adj_list_vertex_id_map >, long unsigned int>]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/betweenness_centrality.hpp:517:57: required from ‘static void boost::detail::graph::brandes_betweenness_centrality_dispatch1::run(const Graph&, CentralityMap, EdgeCentralityMap, VertexIndexMap, WeightMap) [with Graph = boost::adjacency_list >, boost::property > >; CentralityMap = boost::vec_adj_list_vertex_property_map >, boost::property > >, boost::adjacency_list >, boost::property > >*, double, double&, boost::vertex_centrality_t>; EdgeCentralityMap = boost::adj_list_edge_property_map >, boost::edge_centrality_t>; VertexIndexMap = boost::vec_adj_list_vertex_id_map >, long unsigned int>; WeightMap = boost::adj_list_edge_property_map >, boost::edge_weight_t>]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/betweenness_centrality.hpp:558:71: required from ‘void boost::brandes_betweenness_centrality(const Graph&, const bgl_named_params&, typename enable_if_c::traversal_category>::value, graph::detail::no_parameter>::type) [with Graph = adjacency_list >, property > >; Param = adj_list_edge_property_map >, edge_weight_t>; Tag = edge_weight_t; Rest = bgl_named_params >, edge_centrality_t>, edge_centrality_t, bgl_named_params >, property > >, adjacency_list >, property > >*, double, double&, vertex_centrality_t>, vertex_centrality_t, no_property> >; typename enable_if_c::traversal_category>::value, graph::detail::no_parameter>::type = graph::detail::no_parameter; typename graph_traits::traversal_category = undir_adj_list_traversal_tag]’ bbc.cpp:67:33: required from here /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::EqualityComparable]’ 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ^ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements >]’: /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:512:7: required from ‘struct boost::InputIterator’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:540:3: required from ‘struct boost::ForwardIterator’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:568:3: required from ‘struct boost::BidirectionalIterator’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:597:3: required from ‘struct boost::RandomAccessIterator’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:597:3: required from ‘struct boost::RandomAccessIteratorConcept’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:32:62: [ skipping 16 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/betweenness_centrality.hpp:349:31: required from ‘void boost::detail::graph::brandes_betweenness_centrality_impl(const Graph&, CentralityMap, EdgeCentralityMap, IncomingMap, DistanceMap, DependencyMap, PathCountMap, VertexIndexMap, ShortestPaths) [with Graph = boost::adjacency_list >, boost::property > >; CentralityMap = boost::vec_adj_list_vertex_property_map >, boost::property > >, boost::adjacency_list >, boost::property > >*, double, double&, boost::vertex_centrality_t>; EdgeCentralityMap = boost::adj_list_edge_property_map >, boost::edge_centrality_t>; IncomingMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator, std::allocator > >*, std::vector, std::allocator > >, std::allocator, std::allocator > > > > >, boost::vec_adj_list_vertex_id_map >, long unsigned int>, std::vector, std::allocator > >, std::vector, std::allocator > >&>; DistanceMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator > >, boost::vec_adj_list_vertex_id_map >, long unsigned int>, double, double&>; DependencyMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator > >, boost::vec_adj_list_vertex_id_map >, long unsigned int>, double, double&>; PathCountMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator > >, boost::vec_adj_list_vertex_id_map >, long unsigned int>, long unsigned int, long unsigned int&>; VertexIndexMap = boost::vec_adj_list_vertex_id_map >, long unsigned int>; ShortestPaths = brandes_dijkstra_shortest_paths >, boost::edge_weight_t> >]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/betweenness_centrality.hpp:434:55: required from ‘void boost::brandes_betweenness_centrality(const Graph&, CentralityMap, EdgeCentralityMap, IncomingMap, DistanceMap, DependencyMap, PathCountMap, VertexIndexMap, WeightMap, typename enable_if_c::traversal_category>::value, graph::detail::no_parameter>::type) [with Graph = adjacency_list >, property > >; CentralityMap = vec_adj_list_vertex_property_map >, property > >, adjacency_list >, property > >*, double, double&, vertex_centrality_t>; EdgeCentralityMap = adj_list_edge_property_map >, edge_centrality_t>; IncomingMap = iterator_property_map<__gnu_cxx::__normal_iterator, std::allocator > >*, std::vector, std::allocator > >, std::allocator, std::allocator > > > > >, vec_adj_list_vertex_id_map >, long unsigned int>, std::vector, std::allocator > >, std::vector, std::allocator > >&>; DistanceMap = iterator_property_map<__gnu_cxx::__normal_iterator > >, vec_adj_list_vertex_id_map >, long unsigned int>, double, double&>; DependencyMap = iterator_property_map<__gnu_cxx::__normal_iterator > >, vec_adj_list_vertex_id_map >, long unsigned int>, double, double&>; PathCountMap = iterator_property_map<__gnu_cxx::__normal_iterator > >, vec_adj_list_vertex_id_map >, long unsigned int>, long unsigned int, long unsigned int&>; VertexIndexMap = vec_adj_list_vertex_id_map >, long unsigned int>; WeightMap = adj_list_edge_property_map >, edge_weight_t>; typename enable_if_c::traversal_category>::value, graph::detail::no_parameter>::type = graph::detail::no_parameter; typename graph_traits::traversal_category = undir_adj_list_traversal_tag]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/betweenness_centrality.hpp:468:43: required from ‘void boost::detail::graph::brandes_betweenness_centrality_dispatch2(const Graph&, CentralityMap, EdgeCentralityMap, WeightMap, VertexIndexMap) [with Graph = boost::adjacency_list >, boost::property > >; CentralityMap = boost::vec_adj_list_vertex_property_map >, boost::property > >, boost::adjacency_list >, boost::property > >*, double, double&, boost::vertex_centrality_t>; EdgeCentralityMap = boost::adj_list_edge_property_map >, boost::edge_centrality_t>; WeightMap = boost::adj_list_edge_property_map >, boost::edge_weight_t>; VertexIndexMap = boost::vec_adj_list_vertex_id_map >, long unsigned int>]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/betweenness_centrality.hpp:517:57: required from ‘static void boost::detail::graph::brandes_betweenness_centrality_dispatch1::run(const Graph&, CentralityMap, EdgeCentralityMap, VertexIndexMap, WeightMap) [with Graph = boost::adjacency_list >, boost::property > >; CentralityMap = boost::vec_adj_list_vertex_property_map >, boost::property > >, boost::adjacency_list >, boost::property > >*, double, double&, boost::vertex_centrality_t>; EdgeCentralityMap = boost::adj_list_edge_property_map >, boost::edge_centrality_t>; VertexIndexMap = boost::vec_adj_list_vertex_id_map >, long unsigned int>; WeightMap = boost::adj_list_edge_property_map >, boost::edge_weight_t>]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/betweenness_centrality.hpp:558:71: required from ‘void boost::brandes_betweenness_centrality(const Graph&, const bgl_named_params&, typename enable_if_c::traversal_category>::value, graph::detail::no_parameter>::type) [with Graph = adjacency_list >, property > >; Param = adj_list_edge_property_map >, edge_weight_t>; Tag = edge_weight_t; Rest = bgl_named_params >, edge_centrality_t>, edge_centrality_t, bgl_named_params >, property > >, adjacency_list >, property > >*, double, double&, vertex_centrality_t>, vertex_centrality_t, no_property> >; typename enable_if_c::traversal_category>::value, graph::detail::no_parameter>::type = graph::detail::no_parameter; typename graph_traits::traversal_category = undir_adj_list_traversal_tag]’ bbc.cpp:67:33: required from here /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::InputIterator]’ 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ^ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements >]’: /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:543:7: required from ‘struct boost::ForwardIterator’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:568:3: required from ‘struct boost::BidirectionalIterator’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:597:3: required from ‘struct boost::RandomAccessIterator’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:597:3: required from ‘struct boost::RandomAccessIteratorConcept’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::RandomAccessIteratorConcept]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:42:5: [ skipping 15 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/betweenness_centrality.hpp:349:31: required from ‘void boost::detail::graph::brandes_betweenness_centrality_impl(const Graph&, CentralityMap, EdgeCentralityMap, IncomingMap, DistanceMap, DependencyMap, PathCountMap, VertexIndexMap, ShortestPaths) [with Graph = boost::adjacency_list >, boost::property > >; CentralityMap = boost::vec_adj_list_vertex_property_map >, boost::property > >, boost::adjacency_list >, boost::property > >*, double, double&, boost::vertex_centrality_t>; EdgeCentralityMap = boost::adj_list_edge_property_map >, boost::edge_centrality_t>; IncomingMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator, std::allocator > >*, std::vector, std::allocator > >, std::allocator, std::allocator > > > > >, boost::vec_adj_list_vertex_id_map >, long unsigned int>, std::vector, std::allocator > >, std::vector, std::allocator > >&>; DistanceMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator > >, boost::vec_adj_list_vertex_id_map >, long unsigned int>, double, double&>; DependencyMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator > >, boost::vec_adj_list_vertex_id_map >, long unsigned int>, double, double&>; PathCountMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator > >, boost::vec_adj_list_vertex_id_map >, long unsigned int>, long unsigned int, long unsigned int&>; VertexIndexMap = boost::vec_adj_list_vertex_id_map >, long unsigned int>; ShortestPaths = brandes_dijkstra_shortest_paths >, boost::edge_weight_t> >]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/betweenness_centrality.hpp:434:55: required from ‘void boost::brandes_betweenness_centrality(const Graph&, CentralityMap, EdgeCentralityMap, IncomingMap, DistanceMap, DependencyMap, PathCountMap, VertexIndexMap, WeightMap, typename enable_if_c::traversal_category>::value, graph::detail::no_parameter>::type) [with Graph = adjacency_list >, property > >; CentralityMap = vec_adj_list_vertex_property_map >, property > >, adjacency_list >, property > >*, double, double&, vertex_centrality_t>; EdgeCentralityMap = adj_list_edge_property_map >, edge_centrality_t>; IncomingMap = iterator_property_map<__gnu_cxx::__normal_iterator, std::allocator > >*, std::vector, std::allocator > >, std::allocator, std::allocator > > > > >, vec_adj_list_vertex_id_map >, long unsigned int>, std::vector, std::allocator > >, std::vector, std::allocator > >&>; DistanceMap = iterator_property_map<__gnu_cxx::__normal_iterator > >, vec_adj_list_vertex_id_map >, long unsigned int>, double, double&>; DependencyMap = iterator_property_map<__gnu_cxx::__normal_iterator > >, vec_adj_list_vertex_id_map >, long unsigned int>, double, double&>; PathCountMap = iterator_property_map<__gnu_cxx::__normal_iterator > >, vec_adj_list_vertex_id_map >, long unsigned int>, long unsigned int, long unsigned int&>; VertexIndexMap = vec_adj_list_vertex_id_map >, long unsigned int>; WeightMap = adj_list_edge_property_map >, edge_weight_t>; typename enable_if_c::traversal_category>::value, graph::detail::no_parameter>::type = graph::detail::no_parameter; typename graph_traits::traversal_category = undir_adj_list_traversal_tag]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/betweenness_centrality.hpp:468:43: required from ‘void boost::detail::graph::brandes_betweenness_centrality_dispatch2(const Graph&, CentralityMap, EdgeCentralityMap, WeightMap, VertexIndexMap) [with Graph = boost::adjacency_list >, boost::property > >; CentralityMap = boost::vec_adj_list_vertex_property_map >, boost::property > >, boost::adjacency_list >, boost::property > >*, double, double&, boost::vertex_centrality_t>; EdgeCentralityMap = boost::adj_list_edge_property_map >, boost::edge_centrality_t>; WeightMap = boost::adj_list_edge_property_map >, boost::edge_weight_t>; VertexIndexMap = boost::vec_adj_list_vertex_id_map >, long unsigned int>]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/betweenness_centrality.hpp:517:57: required from ‘static void boost::detail::graph::brandes_betweenness_centrality_dispatch1::run(const Graph&, CentralityMap, EdgeCentralityMap, VertexIndexMap, WeightMap) [with Graph = boost::adjacency_list >, boost::property > >; CentralityMap = boost::vec_adj_list_vertex_property_map >, boost::property > >, boost::adjacency_list >, boost::property > >*, double, double&, boost::vertex_centrality_t>; EdgeCentralityMap = boost::adj_list_edge_property_map >, boost::edge_centrality_t>; VertexIndexMap = boost::vec_adj_list_vertex_id_map >, long unsigned int>; WeightMap = boost::adj_list_edge_property_map >, boost::edge_weight_t>]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/betweenness_centrality.hpp:558:71: required from ‘void boost::brandes_betweenness_centrality(const Graph&, const bgl_named_params&, typename enable_if_c::traversal_category>::value, graph::detail::no_parameter>::type) [with Graph = adjacency_list >, property > >; Param = adj_list_edge_property_map >, edge_weight_t>; Tag = edge_weight_t; Rest = bgl_named_params >, edge_centrality_t>, edge_centrality_t, bgl_named_params >, property > >, adjacency_list >, property > >*, double, double&, vertex_centrality_t>, vertex_centrality_t, no_property> >; typename enable_if_c::traversal_category>::value, graph::detail::no_parameter>::type = graph::detail::no_parameter; typename graph_traits::traversal_category = undir_adj_list_traversal_tag]’ bbc.cpp:67:33: required from here /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::ForwardIterator]’ 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ^ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements >]’: /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:571:7: required from ‘struct boost::BidirectionalIterator’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:597:3: required from ‘struct boost::RandomAccessIterator’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:597:3: required from ‘struct boost::RandomAccessIteratorConcept’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::RandomAccessIteratorConcept]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied >::value’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:45:51: [ skipping 14 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/betweenness_centrality.hpp:349:31: required from ‘void boost::detail::graph::brandes_betweenness_centrality_impl(const Graph&, CentralityMap, EdgeCentralityMap, IncomingMap, DistanceMap, DependencyMap, PathCountMap, VertexIndexMap, ShortestPaths) [with Graph = boost::adjacency_list >, boost::property > >; CentralityMap = boost::vec_adj_list_vertex_property_map >, boost::property > >, boost::adjacency_list >, boost::property > >*, double, double&, boost::vertex_centrality_t>; EdgeCentralityMap = boost::adj_list_edge_property_map >, boost::edge_centrality_t>; IncomingMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator, std::allocator > >*, std::vector, std::allocator > >, std::allocator, std::allocator > > > > >, boost::vec_adj_list_vertex_id_map >, long unsigned int>, std::vector, std::allocator > >, std::vector, std::allocator > >&>; DistanceMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator > >, boost::vec_adj_list_vertex_id_map >, long unsigned int>, double, double&>; DependencyMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator > >, boost::vec_adj_list_vertex_id_map >, long unsigned int>, double, double&>; PathCountMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator > >, boost::vec_adj_list_vertex_id_map >, long unsigned int>, long unsigned int, long unsigned int&>; VertexIndexMap = boost::vec_adj_list_vertex_id_map >, long unsigned int>; ShortestPaths = brandes_dijkstra_shortest_paths >, boost::edge_weight_t> >]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/betweenness_centrality.hpp:434:55: required from ‘void boost::brandes_betweenness_centrality(const Graph&, CentralityMap, EdgeCentralityMap, IncomingMap, DistanceMap, DependencyMap, PathCountMap, VertexIndexMap, WeightMap, typename enable_if_c::traversal_category>::value, graph::detail::no_parameter>::type) [with Graph = adjacency_list >, property > >; CentralityMap = vec_adj_list_vertex_property_map >, property > >, adjacency_list >, property > >*, double, double&, vertex_centrality_t>; EdgeCentralityMap = adj_list_edge_property_map >, edge_centrality_t>; IncomingMap = iterator_property_map<__gnu_cxx::__normal_iterator, std::allocator > >*, std::vector, std::allocator > >, std::allocator, std::allocator > > > > >, vec_adj_list_vertex_id_map >, long unsigned int>, std::vector, std::allocator > >, std::vector, std::allocator > >&>; DistanceMap = iterator_property_map<__gnu_cxx::__normal_iterator > >, vec_adj_list_vertex_id_map >, long unsigned int>, double, double&>; DependencyMap = iterator_property_map<__gnu_cxx::__normal_iterator > >, vec_adj_list_vertex_id_map >, long unsigned int>, double, double&>; PathCountMap = iterator_property_map<__gnu_cxx::__normal_iterator > >, vec_adj_list_vertex_id_map >, long unsigned int>, long unsigned int, long unsigned int&>; VertexIndexMap = vec_adj_list_vertex_id_map >, long unsigned int>; WeightMap = adj_list_edge_property_map >, edge_weight_t>; typename enable_if_c::traversal_category>::value, graph::detail::no_parameter>::type = graph::detail::no_parameter; typename graph_traits::traversal_category = undir_adj_list_traversal_tag]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/betweenness_centrality.hpp:468:43: required from ‘void boost::detail::graph::brandes_betweenness_centrality_dispatch2(const Graph&, CentralityMap, EdgeCentralityMap, WeightMap, VertexIndexMap) [with Graph = boost::adjacency_list >, boost::property > >; CentralityMap = boost::vec_adj_list_vertex_property_map >, boost::property > >, boost::adjacency_list >, boost::property > >*, double, double&, boost::vertex_centrality_t>; EdgeCentralityMap = boost::adj_list_edge_property_map >, boost::edge_centrality_t>; WeightMap = boost::adj_list_edge_property_map >, boost::edge_weight_t>; VertexIndexMap = boost::vec_adj_list_vertex_id_map >, long unsigned int>]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/betweenness_centrality.hpp:517:57: required from ‘static void boost::detail::graph::brandes_betweenness_centrality_dispatch1::run(const Graph&, CentralityMap, EdgeCentralityMap, VertexIndexMap, WeightMap) [with Graph = boost::adjacency_list >, boost::property > >; CentralityMap = boost::vec_adj_list_vertex_property_map >, boost::property > >, boost::adjacency_list >, boost::property > >*, double, double&, boost::vertex_centrality_t>; EdgeCentralityMap = boost::adj_list_edge_property_map >, boost::edge_centrality_t>; VertexIndexMap = boost::vec_adj_list_vertex_id_map >, long unsigned int>; WeightMap = boost::adj_list_edge_property_map >, boost::edge_weight_t>]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/betweenness_centrality.hpp:558:71: required from ‘void boost::brandes_betweenness_centrality(const Graph&, const bgl_named_params&, typename enable_if_c::traversal_category>::value, graph::detail::no_parameter>::type) [with Graph = adjacency_list >, property > >; Param = adj_list_edge_property_map >, edge_weight_t>; Tag = edge_weight_t; Rest = bgl_named_params >, edge_centrality_t>, edge_centrality_t, bgl_named_params >, property > >, adjacency_list >, property > >*, double, double&, vertex_centrality_t>, vertex_centrality_t, no_property> >; typename enable_if_c::traversal_category>::value, graph::detail::no_parameter>::type = graph::detail::no_parameter; typename graph_traits::traversal_category = undir_adj_list_traversal_tag]’ bbc.cpp:67:33: required from here /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::BidirectionalIterator]’ 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ^ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements >]’: /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:253:5: required from ‘struct boost::Comparable’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:597:3: required from ‘struct boost::RandomAccessIterator’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:597:3: required from ‘struct boost::RandomAccessIteratorConcept’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::RandomAccessIteratorConcept]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied >::value’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:45:51: [ skipping 14 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/betweenness_centrality.hpp:349:31: required from ‘void boost::detail::graph::brandes_betweenness_centrality_impl(const Graph&, CentralityMap, EdgeCentralityMap, IncomingMap, DistanceMap, DependencyMap, PathCountMap, VertexIndexMap, ShortestPaths) [with Graph = boost::adjacency_list >, boost::property > >; CentralityMap = boost::vec_adj_list_vertex_property_map >, boost::property > >, boost::adjacency_list >, boost::property > >*, double, double&, boost::vertex_centrality_t>; EdgeCentralityMap = boost::adj_list_edge_property_map >, boost::edge_centrality_t>; IncomingMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator, std::allocator > >*, std::vector, std::allocator > >, std::allocator, std::allocator > > > > >, boost::vec_adj_list_vertex_id_map >, long unsigned int>, std::vector, std::allocator > >, std::vector, std::allocator > >&>; DistanceMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator > >, boost::vec_adj_list_vertex_id_map >, long unsigned int>, double, double&>; DependencyMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator > >, boost::vec_adj_list_vertex_id_map >, long unsigned int>, double, double&>; PathCountMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator > >, boost::vec_adj_list_vertex_id_map >, long unsigned int>, long unsigned int, long unsigned int&>; VertexIndexMap = boost::vec_adj_list_vertex_id_map >, long unsigned int>; ShortestPaths = brandes_dijkstra_shortest_paths >, boost::edge_weight_t> >]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/betweenness_centrality.hpp:434:55: required from ‘void boost::brandes_betweenness_centrality(const Graph&, CentralityMap, EdgeCentralityMap, IncomingMap, DistanceMap, DependencyMap, PathCountMap, VertexIndexMap, WeightMap, typename enable_if_c::traversal_category>::value, graph::detail::no_parameter>::type) [with Graph = adjacency_list >, property > >; CentralityMap = vec_adj_list_vertex_property_map >, property > >, adjacency_list >, property > >*, double, double&, vertex_centrality_t>; EdgeCentralityMap = adj_list_edge_property_map >, edge_centrality_t>; IncomingMap = iterator_property_map<__gnu_cxx::__normal_iterator, std::allocator > >*, std::vector, std::allocator > >, std::allocator, std::allocator > > > > >, vec_adj_list_vertex_id_map >, long unsigned int>, std::vector, std::allocator > >, std::vector, std::allocator > >&>; DistanceMap = iterator_property_map<__gnu_cxx::__normal_iterator > >, vec_adj_list_vertex_id_map >, long unsigned int>, double, double&>; DependencyMap = iterator_property_map<__gnu_cxx::__normal_iterator > >, vec_adj_list_vertex_id_map >, long unsigned int>, double, double&>; PathCountMap = iterator_property_map<__gnu_cxx::__normal_iterator > >, vec_adj_list_vertex_id_map >, long unsigned int>, long unsigned int, long unsigned int&>; VertexIndexMap = vec_adj_list_vertex_id_map >, long unsigned int>; WeightMap = adj_list_edge_property_map >, edge_weight_t>; typename enable_if_c::traversal_category>::value, graph::detail::no_parameter>::type = graph::detail::no_parameter; typename graph_traits::traversal_category = undir_adj_list_traversal_tag]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/betweenness_centrality.hpp:468:43: required from ‘void boost::detail::graph::brandes_betweenness_centrality_dispatch2(const Graph&, CentralityMap, EdgeCentralityMap, WeightMap, VertexIndexMap) [with Graph = boost::adjacency_list >, boost::property > >; CentralityMap = boost::vec_adj_list_vertex_property_map >, boost::property > >, boost::adjacency_list >, boost::property > >*, double, double&, boost::vertex_centrality_t>; EdgeCentralityMap = boost::adj_list_edge_property_map >, boost::edge_centrality_t>; WeightMap = boost::adj_list_edge_property_map >, boost::edge_weight_t>; VertexIndexMap = boost::vec_adj_list_vertex_id_map >, long unsigned int>]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/betweenness_centrality.hpp:517:57: required from ‘static void boost::detail::graph::brandes_betweenness_centrality_dispatch1::run(const Graph&, CentralityMap, EdgeCentralityMap, VertexIndexMap, WeightMap) [with Graph = boost::adjacency_list >, boost::property > >; CentralityMap = boost::vec_adj_list_vertex_property_map >, boost::property > >, boost::adjacency_list >, boost::property > >*, double, double&, boost::vertex_centrality_t>; EdgeCentralityMap = boost::adj_list_edge_property_map >, boost::edge_centrality_t>; VertexIndexMap = boost::vec_adj_list_vertex_id_map >, long unsigned int>; WeightMap = boost::adj_list_edge_property_map >, boost::edge_weight_t>]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/betweenness_centrality.hpp:558:71: required from ‘void boost::brandes_betweenness_centrality(const Graph&, const bgl_named_params&, typename enable_if_c::traversal_category>::value, graph::detail::no_parameter>::type) [with Graph = adjacency_list >, property > >; Param = adj_list_edge_property_map >, edge_weight_t>; Tag = edge_weight_t; Rest = bgl_named_params >, edge_centrality_t>, edge_centrality_t, bgl_named_params >, property > >, adjacency_list >, property > >*, double, double&, vertex_centrality_t>, vertex_centrality_t, no_property> >; typename enable_if_c::traversal_category>::value, graph::detail::no_parameter>::type = graph::detail::no_parameter; typename graph_traits::traversal_category = undir_adj_list_traversal_tag]’ bbc.cpp:67:33: required from here /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::Comparable]’ 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ^ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements >]’: /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:601:7: required from ‘struct boost::RandomAccessIterator’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:597:3: required from ‘struct boost::RandomAccessIteratorConcept’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::RandomAccessIteratorConcept]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied >::value’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:72:8: [ skipping 13 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/betweenness_centrality.hpp:349:31: required from ‘void boost::detail::graph::brandes_betweenness_centrality_impl(const Graph&, CentralityMap, EdgeCentralityMap, IncomingMap, DistanceMap, DependencyMap, PathCountMap, VertexIndexMap, ShortestPaths) [with Graph = boost::adjacency_list >, boost::property > >; CentralityMap = boost::vec_adj_list_vertex_property_map >, boost::property > >, boost::adjacency_list >, boost::property > >*, double, double&, boost::vertex_centrality_t>; EdgeCentralityMap = boost::adj_list_edge_property_map >, boost::edge_centrality_t>; IncomingMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator, std::allocator > >*, std::vector, std::allocator > >, std::allocator, std::allocator > > > > >, boost::vec_adj_list_vertex_id_map >, long unsigned int>, std::vector, std::allocator > >, std::vector, std::allocator > >&>; DistanceMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator > >, boost::vec_adj_list_vertex_id_map >, long unsigned int>, double, double&>; DependencyMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator > >, boost::vec_adj_list_vertex_id_map >, long unsigned int>, double, double&>; PathCountMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator > >, boost::vec_adj_list_vertex_id_map >, long unsigned int>, long unsigned int, long unsigned int&>; VertexIndexMap = boost::vec_adj_list_vertex_id_map >, long unsigned int>; ShortestPaths = brandes_dijkstra_shortest_paths >, boost::edge_weight_t> >]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/betweenness_centrality.hpp:434:55: required from ‘void boost::brandes_betweenness_centrality(const Graph&, CentralityMap, EdgeCentralityMap, IncomingMap, DistanceMap, DependencyMap, PathCountMap, VertexIndexMap, WeightMap, typename enable_if_c::traversal_category>::value, graph::detail::no_parameter>::type) [with Graph = adjacency_list >, property > >; CentralityMap = vec_adj_list_vertex_property_map >, property > >, adjacency_list >, property > >*, double, double&, vertex_centrality_t>; EdgeCentralityMap = adj_list_edge_property_map >, edge_centrality_t>; IncomingMap = iterator_property_map<__gnu_cxx::__normal_iterator, std::allocator > >*, std::vector, std::allocator > >, std::allocator, std::allocator > > > > >, vec_adj_list_vertex_id_map >, long unsigned int>, std::vector, std::allocator > >, std::vector, std::allocator > >&>; DistanceMap = iterator_property_map<__gnu_cxx::__normal_iterator > >, vec_adj_list_vertex_id_map >, long unsigned int>, double, double&>; DependencyMap = iterator_property_map<__gnu_cxx::__normal_iterator > >, vec_adj_list_vertex_id_map >, long unsigned int>, double, double&>; PathCountMap = iterator_property_map<__gnu_cxx::__normal_iterator > >, vec_adj_list_vertex_id_map >, long unsigned int>, long unsigned int, long unsigned int&>; VertexIndexMap = vec_adj_list_vertex_id_map >, long unsigned int>; WeightMap = adj_list_edge_property_map >, edge_weight_t>; typename enable_if_c::traversal_category>::value, graph::detail::no_parameter>::type = graph::detail::no_parameter; typename graph_traits::traversal_category = undir_adj_list_traversal_tag]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/betweenness_centrality.hpp:468:43: required from ‘void boost::detail::graph::brandes_betweenness_centrality_dispatch2(const Graph&, CentralityMap, EdgeCentralityMap, WeightMap, VertexIndexMap) [with Graph = boost::adjacency_list >, boost::property > >; CentralityMap = boost::vec_adj_list_vertex_property_map >, boost::property > >, boost::adjacency_list >, boost::property > >*, double, double&, boost::vertex_centrality_t>; EdgeCentralityMap = boost::adj_list_edge_property_map >, boost::edge_centrality_t>; WeightMap = boost::adj_list_edge_property_map >, boost::edge_weight_t>; VertexIndexMap = boost::vec_adj_list_vertex_id_map >, long unsigned int>]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/betweenness_centrality.hpp:517:57: required from ‘static void boost::detail::graph::brandes_betweenness_centrality_dispatch1::run(const Graph&, CentralityMap, EdgeCentralityMap, VertexIndexMap, WeightMap) [with Graph = boost::adjacency_list >, boost::property > >; CentralityMap = boost::vec_adj_list_vertex_property_map >, boost::property > >, boost::adjacency_list >, boost::property > >*, double, double&, boost::vertex_centrality_t>; EdgeCentralityMap = boost::adj_list_edge_property_map >, boost::edge_centrality_t>; VertexIndexMap = boost::vec_adj_list_vertex_id_map >, long unsigned int>; WeightMap = boost::adj_list_edge_property_map >, boost::edge_weight_t>]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/betweenness_centrality.hpp:558:71: required from ‘void boost::brandes_betweenness_centrality(const Graph&, const bgl_named_params&, typename enable_if_c::traversal_category>::value, graph::detail::no_parameter>::type) [with Graph = adjacency_list >, property > >; Param = adj_list_edge_property_map >, edge_weight_t>; Tag = edge_weight_t; Rest = bgl_named_params >, edge_centrality_t>, edge_centrality_t, bgl_named_params >, property > >, adjacency_list >, property > >*, double, double&, vertex_centrality_t>, vertex_centrality_t, no_property> >; typename enable_if_c::traversal_category>::value, graph::detail::no_parameter>::type = graph::detail::no_parameter; typename graph_traits::traversal_category = undir_adj_list_traversal_tag]’ bbc.cpp:67:33: required from here /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::RandomAccessIterator]’ 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ^ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::RandomAccessIteratorConcept]’: /home/omnipath/local/R/4.4-3.20/BH/include/boost/property_map/property_map.hpp:354:5: required from ‘boost::iterator_property_map >::value_type, typename std::iterator_traits< >::reference> boost::make_iterator_property_map(RAIter, ID) [with RAIter = long unsigned int*; ID = vec_adj_list_vertex_id_map >, long unsigned int>; typename std::iterator_traits< >::value_type = long unsigned int; typename std::iterator_traits< >::reference = long unsigned int&]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/dijkstra_shortest_paths.hpp:245:46: required from ‘static boost::detail::vertex_property_map_generator_helper::type boost::detail::vertex_property_map_generator_helper::build(const Graph&, const IndexMap&, boost::scoped_array&) [with Graph = boost::adjacency_list >, boost::property > >; IndexMap = boost::vec_adj_list_vertex_id_map >, long unsigned int>; Value = long unsigned int; type = boost::iterator_property_map >, long unsigned int>, long unsigned int, long unsigned int&>]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/dijkstra_shortest_paths.hpp:273:33: required from ‘static boost::detail::vertex_property_map_generator::type boost::detail::vertex_property_map_generator::build(const Graph&, const IndexMap&, boost::scoped_array&) [with Graph = boost::adjacency_list >, boost::property > >; IndexMap = boost::vec_adj_list_vertex_id_map >, long unsigned int>; Value = long unsigned int; type = boost::iterator_property_map >, long unsigned int>, long unsigned int, long unsigned int&>]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/dijkstra_shortest_paths.hpp:377:38: required from ‘void boost::dijkstra_shortest_paths_no_init(const Graph&, SourceInputIter, SourceInputIter, PredecessorMap, DistanceMap, WeightMap, IndexMap, Compare, Combine, DistZero, DijkstraVisitor, ColorMap) [with Graph = adjacency_list >, property > >; SourceInputIter = long unsigned int*; DijkstraVisitor = detail::graph::brandes_dijkstra_visitor >, property > >, adj_list_edge_property_map >, edge_weight_t>, iterator_property_map<__gnu_cxx::__normal_iterator, std::allocator > >*, std::vector, std::allocator > >, std::allocator, std::allocator > > > > >, vec_adj_list_vertex_id_map >, long unsigned int>, std::vector, std::allocator > >, std::vector, std::allocator > >&>, iterator_property_map<__gnu_cxx::__normal_iterator > >, vec_adj_list_vertex_id_map >, long unsigned int>, double, double&>, iterator_property_map<__gnu_cxx::__normal_iterator > >, vec_adj_list_vertex_id_map >, long unsigned int>, long unsigned int, long unsigned int&> >; PredecessorMap = dummy_property_map; DistanceMap = iterator_property_map<__gnu_cxx::__normal_iterator > >, vec_adj_list_vertex_id_map >, long unsigned int>, double, double&>; WeightMap = adj_list_edge_property_map >, edge_weight_t>; IndexMap = vec_adj_list_vertex_id_map >, long unsigned int>; Compare = std::less; Combine = std::plus; DistZero = double; ColorMap = two_bit_color_map >, long unsigned int> >]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/dijkstra_shortest_paths.hpp:464:36: required from ‘void boost::dijkstra_shortest_paths(const VertexListGraph&, SourceInputIter, SourceInputIter, PredecessorMap, DistanceMap, WeightMap, IndexMap, Compare, Combine, DistInf, DistZero, DijkstraVisitor, ColorMap) [with VertexListGraph = adjacency_list >, property > >; SourceInputIter = long unsigned int*; DijkstraVisitor = detail::graph::brandes_dijkstra_visitor >, property > >, adj_list_edge_property_map >, edge_weight_t>, iterator_property_map<__gnu_cxx::__normal_iterator, std::allocator > >*, std::vector, std::allocator > >, std::allocator, std::allocator > > > > >, vec_adj_list_vertex_id_map >, long unsigned int>, std::vector, std::allocator > >, std::vector, std::allocator > >&>, iterator_property_map<__gnu_cxx::__normal_iterator > >, vec_adj_list_vertex_id_map >, long unsigned int>, double, double&>, iterator_property_map<__gnu_cxx::__normal_iterator > >, vec_adj_list_vertex_id_map >, long unsigned int>, long unsigned int, long unsigned int&> >; PredecessorMap = dummy_property_map; DistanceMap = iterator_property_map<__gnu_cxx::__normal_iterator > >, vec_adj_list_vertex_id_map >, long unsigned int>, double, double&>; WeightMap = adj_list_edge_property_map >, edge_weight_t>; IndexMap = vec_adj_list_vertex_id_map >, long unsigned int>; Compare = std::less; Combine = std::plus; DistInf = double; DistZero = double; ColorMap = two_bit_color_map >, long unsigned int> >]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/dijkstra_shortest_paths.hpp:417:28: [ skipping 7 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/betweenness_centrality.hpp:349:31: required from ‘void boost::detail::graph::brandes_betweenness_centrality_impl(const Graph&, CentralityMap, EdgeCentralityMap, IncomingMap, DistanceMap, DependencyMap, PathCountMap, VertexIndexMap, ShortestPaths) [with Graph = boost::adjacency_list >, boost::property > >; CentralityMap = boost::vec_adj_list_vertex_property_map >, boost::property > >, boost::adjacency_list >, boost::property > >*, double, double&, boost::vertex_centrality_t>; EdgeCentralityMap = boost::adj_list_edge_property_map >, boost::edge_centrality_t>; IncomingMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator, std::allocator > >*, std::vector, std::allocator > >, std::allocator, std::allocator > > > > >, boost::vec_adj_list_vertex_id_map >, long unsigned int>, std::vector, std::allocator > >, std::vector, std::allocator > >&>; DistanceMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator > >, boost::vec_adj_list_vertex_id_map >, long unsigned int>, double, double&>; DependencyMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator > >, boost::vec_adj_list_vertex_id_map >, long unsigned int>, double, double&>; PathCountMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator > >, boost::vec_adj_list_vertex_id_map >, long unsigned int>, long unsigned int, long unsigned int&>; VertexIndexMap = boost::vec_adj_list_vertex_id_map >, long unsigned int>; ShortestPaths = brandes_dijkstra_shortest_paths >, boost::edge_weight_t> >]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/betweenness_centrality.hpp:434:55: required from ‘void boost::brandes_betweenness_centrality(const Graph&, CentralityMap, EdgeCentralityMap, IncomingMap, DistanceMap, DependencyMap, PathCountMap, VertexIndexMap, WeightMap, typename enable_if_c::traversal_category>::value, graph::detail::no_parameter>::type) [with Graph = adjacency_list >, property > >; CentralityMap = vec_adj_list_vertex_property_map >, property > >, adjacency_list >, property > >*, double, double&, vertex_centrality_t>; EdgeCentralityMap = adj_list_edge_property_map >, edge_centrality_t>; IncomingMap = iterator_property_map<__gnu_cxx::__normal_iterator, std::allocator > >*, std::vector, std::allocator > >, std::allocator, std::allocator > > > > >, vec_adj_list_vertex_id_map >, long unsigned int>, std::vector, std::allocator > >, std::vector, std::allocator > >&>; DistanceMap = iterator_property_map<__gnu_cxx::__normal_iterator > >, vec_adj_list_vertex_id_map >, long unsigned int>, double, double&>; DependencyMap = iterator_property_map<__gnu_cxx::__normal_iterator > >, vec_adj_list_vertex_id_map >, long unsigned int>, double, double&>; PathCountMap = iterator_property_map<__gnu_cxx::__normal_iterator > >, vec_adj_list_vertex_id_map >, long unsigned int>, long unsigned int, long unsigned int&>; VertexIndexMap = vec_adj_list_vertex_id_map >, long unsigned int>; WeightMap = adj_list_edge_property_map >, edge_weight_t>; typename enable_if_c::traversal_category>::value, graph::detail::no_parameter>::type = graph::detail::no_parameter; typename graph_traits::traversal_category = undir_adj_list_traversal_tag]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/betweenness_centrality.hpp:468:43: required from ‘void boost::detail::graph::brandes_betweenness_centrality_dispatch2(const Graph&, CentralityMap, EdgeCentralityMap, WeightMap, VertexIndexMap) [with Graph = boost::adjacency_list >, boost::property > >; CentralityMap = boost::vec_adj_list_vertex_property_map >, boost::property > >, boost::adjacency_list >, boost::property > >*, double, double&, boost::vertex_centrality_t>; EdgeCentralityMap = boost::adj_list_edge_property_map >, boost::edge_centrality_t>; WeightMap = boost::adj_list_edge_property_map >, boost::edge_weight_t>; VertexIndexMap = boost::vec_adj_list_vertex_id_map >, long unsigned int>]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/betweenness_centrality.hpp:517:57: required from ‘static void boost::detail::graph::brandes_betweenness_centrality_dispatch1::run(const Graph&, CentralityMap, EdgeCentralityMap, VertexIndexMap, WeightMap) [with Graph = boost::adjacency_list >, boost::property > >; CentralityMap = boost::vec_adj_list_vertex_property_map >, boost::property > >, boost::adjacency_list >, boost::property > >*, double, double&, boost::vertex_centrality_t>; EdgeCentralityMap = boost::adj_list_edge_property_map >, boost::edge_centrality_t>; VertexIndexMap = boost::vec_adj_list_vertex_id_map >, long unsigned int>; WeightMap = boost::adj_list_edge_property_map >, boost::edge_weight_t>]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/betweenness_centrality.hpp:558:71: required from ‘void boost::brandes_betweenness_centrality(const Graph&, const bgl_named_params&, typename enable_if_c::traversal_category>::value, graph::detail::no_parameter>::type) [with Graph = adjacency_list >, property > >; Param = adj_list_edge_property_map >, edge_weight_t>; Tag = edge_weight_t; Rest = bgl_named_params >, edge_centrality_t>, edge_centrality_t, bgl_named_params >, property > >, adjacency_list >, property > >*, double, double&, vertex_centrality_t>, vertex_centrality_t, no_property> >; typename enable_if_c::traversal_category>::value, graph::detail::no_parameter>::type = graph::detail::no_parameter; typename graph_traits::traversal_category = undir_adj_list_traversal_tag]’ bbc.cpp:67:33: required from here /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:597:17: note: in a call to non-static member function ‘boost::RandomAccessIteratorConcept::~RandomAccessIteratorConcept()’ 597 | BOOST_concept(RandomAccessIterator,(TT)) | ^~~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/preprocessor/cat.hpp:29:34: note: in definition of macro ‘BOOST_PP_CAT_I’ 29 | # define BOOST_PP_CAT_I(a, b) a ## b | ^ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/concept_def.hpp:23:12: note: in expansion of macro ‘BOOST_PP_CAT’ 23 | struct BOOST_PP_CAT(name,Concept) \ | ^~~~~~~~~~~~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:597:3: note: in expansion of macro ‘BOOST_concept’ 597 | BOOST_concept(RandomAccessIterator,(TT)) | ^~~~~~~~~~~~~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::CopyConstructible >, boost::property > >, boost::adj_list_edge_property_map >, boost::edge_weight_t>, boost::iterator_property_map<__gnu_cxx::__normal_iterator, std::allocator > >*, std::vector, std::allocator > >, std::allocator, std::allocator > > > > >, boost::vec_adj_list_vertex_id_map >, long unsigned int>, std::vector, std::allocator > >, std::vector, std::allocator > >&>, boost::iterator_property_map<__gnu_cxx::__normal_iterator > >, boost::vec_adj_list_vertex_id_map >, long unsigned int>, double, double&>, boost::iterator_property_map<__gnu_cxx::__normal_iterator > >, boost::vec_adj_list_vertex_id_map >, long unsigned int>, long unsigned int, long unsigned int&> >, boost::d_ary_heap_indirect >, long unsigned int>, long unsigned int, long unsigned int&>, boost::iterator_property_map<__gnu_cxx::__normal_iterator > >, boost::vec_adj_list_vertex_id_map >, long unsigned int>, double, double&>, std::less, std::vector > >, boost::adj_list_edge_property_map >, boost::edge_weight_t>, boost::dummy_property_map, boost::iterator_property_map<__gnu_cxx::__normal_iterator > >, boost::vec_adj_list_vertex_id_map >, long unsigned int>, double, double&>, std::plus, std::less > >]’: /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements >, boost::property > >, boost::adj_list_edge_property_map >, boost::edge_weight_t>, boost::iterator_property_map<__gnu_cxx::__normal_iterator, std::allocator > >*, std::vector, std::allocator > >, std::allocator, std::allocator > > > > >, boost::vec_adj_list_vertex_id_map >, long unsigned int>, std::vector, std::allocator > >, std::vector, std::allocator > >&>, boost::iterator_property_map<__gnu_cxx::__normal_iterator > >, boost::vec_adj_list_vertex_id_map >, long unsigned int>, double, double&>, boost::iterator_property_map<__gnu_cxx::__normal_iterator > >, boost::vec_adj_list_vertex_id_map >, long unsigned int>, long unsigned int, long unsigned int&> >, boost::d_ary_heap_indirect >, long unsigned int>, long unsigned int, long unsigned int&>, boost::iterator_property_map<__gnu_cxx::__normal_iterator > >, boost::vec_adj_list_vertex_id_map >, long unsigned int>, double, double&>, std::less, std::vector > >, boost::adj_list_edge_property_map >, boost::edge_weight_t>, boost::dummy_property_map, boost::iterator_property_map<__gnu_cxx::__normal_iterator > >, boost::vec_adj_list_vertex_id_map >, long unsigned int>, double, double&>, std::plus, std::less > > >]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:167:5: required from ‘struct boost::CopyConstructible >, boost::property > >, boost::adj_list_edge_property_map >, boost::edge_weight_t>, boost::iterator_property_map<__gnu_cxx::__normal_iterator, std::allocator > >*, std::vector, std::allocator > >, std::allocator, std::allocator > > > > >, boost::vec_adj_list_vertex_id_map >, long unsigned int>, std::vector, std::allocator > >, std::vector, std::allocator > >&>, boost::iterator_property_map<__gnu_cxx::__normal_iterator > >, boost::vec_adj_list_vertex_id_map >, long unsigned int>, double, double&>, boost::iterator_property_map<__gnu_cxx::__normal_iterator > >, boost::vec_adj_list_vertex_id_map >, long unsigned int>, long unsigned int, long unsigned int&> >, boost::d_ary_heap_indirect >, long unsigned int>, long unsigned int, long unsigned int&>, boost::iterator_property_map<__gnu_cxx::__normal_iterator > >, boost::vec_adj_list_vertex_id_map >, long unsigned int>, double, double&>, std::less, std::vector > >, boost::adj_list_edge_property_map >, boost::edge_weight_t>, boost::dummy_property_map, boost::iterator_property_map<__gnu_cxx::__normal_iterator > >, boost::vec_adj_list_vertex_id_map >, long unsigned int>, double, double&>, std::plus, std::less > >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:165:3: required from ‘struct boost::CopyConstructibleConcept >, boost::property > >, boost::adj_list_edge_property_map >, boost::edge_weight_t>, boost::iterator_property_map<__gnu_cxx::__normal_iterator, std::allocator > >*, std::vector, std::allocator > >, std::allocator, std::allocator > > > > >, boost::vec_adj_list_vertex_id_map >, long unsigned int>, std::vector, std::allocator > >, std::vector, std::allocator > >&>, boost::iterator_property_map<__gnu_cxx::__normal_iterator > >, boost::vec_adj_list_vertex_id_map >, long unsigned int>, double, double&>, boost::iterator_property_map<__gnu_cxx::__normal_iterator > >, boost::vec_adj_list_vertex_id_map >, long unsigned int>, long unsigned int, long unsigned int&> >, boost::d_ary_heap_indirect >, long unsigned int>, long unsigned int, long unsigned int&>, boost::iterator_property_map<__gnu_cxx::__normal_iterator > >, boost::vec_adj_list_vertex_id_map >, long unsigned int>, double, double&>, std::less, std::vector > >, boost::adj_list_edge_property_map >, boost::edge_weight_t>, boost::dummy_property_map, boost::iterator_property_map<__gnu_cxx::__normal_iterator > >, boost::vec_adj_list_vertex_id_map >, long unsigned int>, double, double&>, std::plus, std::less > >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::CopyConstructibleConcept >, boost::property > >, boost::adj_list_edge_property_map >, boost::edge_weight_t>, boost::iterator_property_map<__gnu_cxx::__normal_iterator, std::allocator > >*, std::vector, std::allocator > >, std::allocator, std::allocator > > > > >, boost::vec_adj_list_vertex_id_map >, long unsigned int>, std::vector, std::allocator > >, std::vector, std::allocator > >&>, boost::iterator_property_map<__gnu_cxx::__normal_iterator > >, boost::vec_adj_list_vertex_id_map >, long unsigned int>, double, double&>, boost::iterator_property_map<__gnu_cxx::__normal_iterator > >, boost::vec_adj_list_vertex_id_map >, long unsigned int>, long unsigned int, long unsigned int&> >, boost::d_ary_heap_indirect >, long unsigned int>, long unsigned int, long unsigned int&>, boost::iterator_property_map<__gnu_cxx::__normal_iterator > >, boost::vec_adj_list_vertex_id_map >, long unsigned int>, double, double&>, std::less, std::vector > >, boost::adj_list_edge_property_map >, boost::edge_weight_t>, boost::dummy_property_map, boost::iterator_property_map<__gnu_cxx::__normal_iterator > >, boost::vec_adj_list_vertex_id_map >, long unsigned int>, double, double&>, std::plus, std::less > >]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied >, boost::property > >, boost::adj_list_edge_property_map >, boost::edge_weight_t>, boost::iterator_property_map<__gnu_cxx::__normal_iterator, std::allocator > >*, std::vector, std::allocator > >, std::allocator, std::allocator > > > > >, boost::vec_adj_list_vertex_id_map >, long unsigned int>, std::vector, std::allocator > >, std::vector, std::allocator > >&>, boost::iterator_property_map<__gnu_cxx::__normal_iterator > >, boost::vec_adj_list_vertex_id_map >, long unsigned int>, double, double&>, boost::iterator_property_map<__gnu_cxx::__normal_iterator > >, boost::vec_adj_list_vertex_id_map >, long unsigned int>, long unsigned int, long unsigned int&> >, boost::d_ary_heap_indirect >, long unsigned int>, long unsigned int, long unsigned int&>, boost::iterator_property_map<__gnu_cxx::__normal_iterator > >, boost::vec_adj_list_vertex_id_map >, long unsigned int>, double, double&>, std::less, std::vector > >, boost::adj_list_edge_property_map >, boost::edge_weight_t>, boost::dummy_property_map, boost::iterator_property_map<__gnu_cxx::__normal_iterator > >, boost::vec_adj_list_vertex_id_map >, long unsigned int>, double, double&>, std::plus, std::less > > >::value’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:45:51: [ skipping 17 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/betweenness_centrality.hpp:349:31: required from ‘void boost::detail::graph::brandes_betweenness_centrality_impl(const Graph&, CentralityMap, EdgeCentralityMap, IncomingMap, DistanceMap, DependencyMap, PathCountMap, VertexIndexMap, ShortestPaths) [with Graph = boost::adjacency_list >, boost::property > >; CentralityMap = boost::vec_adj_list_vertex_property_map >, boost::property > >, boost::adjacency_list >, boost::property > >*, double, double&, boost::vertex_centrality_t>; EdgeCentralityMap = boost::adj_list_edge_property_map >, boost::edge_centrality_t>; IncomingMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator, std::allocator > >*, std::vector, std::allocator > >, std::allocator, std::allocator > > > > >, boost::vec_adj_list_vertex_id_map >, long unsigned int>, std::vector, std::allocator > >, std::vector, std::allocator > >&>; DistanceMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator > >, boost::vec_adj_list_vertex_id_map >, long unsigned int>, double, double&>; DependencyMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator > >, boost::vec_adj_list_vertex_id_map >, long unsigned int>, double, double&>; PathCountMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator > >, boost::vec_adj_list_vertex_id_map >, long unsigned int>, long unsigned int, long unsigned int&>; VertexIndexMap = boost::vec_adj_list_vertex_id_map >, long unsigned int>; ShortestPaths = brandes_dijkstra_shortest_paths >, boost::edge_weight_t> >]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/betweenness_centrality.hpp:434:55: required from ‘void boost::brandes_betweenness_centrality(const Graph&, CentralityMap, EdgeCentralityMap, IncomingMap, DistanceMap, DependencyMap, PathCountMap, VertexIndexMap, WeightMap, typename enable_if_c::traversal_category>::value, graph::detail::no_parameter>::type) [with Graph = adjacency_list >, property > >; CentralityMap = vec_adj_list_vertex_property_map >, property > >, adjacency_list >, property > >*, double, double&, vertex_centrality_t>; EdgeCentralityMap = adj_list_edge_property_map >, edge_centrality_t>; IncomingMap = iterator_property_map<__gnu_cxx::__normal_iterator, std::allocator > >*, std::vector, std::allocator > >, std::allocator, std::allocator > > > > >, vec_adj_list_vertex_id_map >, long unsigned int>, std::vector, std::allocator > >, std::vector, std::allocator > >&>; DistanceMap = iterator_property_map<__gnu_cxx::__normal_iterator > >, vec_adj_list_vertex_id_map >, long unsigned int>, double, double&>; DependencyMap = iterator_property_map<__gnu_cxx::__normal_iterator > >, vec_adj_list_vertex_id_map >, long unsigned int>, double, double&>; PathCountMap = iterator_property_map<__gnu_cxx::__normal_iterator > >, vec_adj_list_vertex_id_map >, long unsigned int>, long unsigned int, long unsigned int&>; VertexIndexMap = vec_adj_list_vertex_id_map >, long unsigned int>; WeightMap = adj_list_edge_property_map >, edge_weight_t>; typename enable_if_c::traversal_category>::value, graph::detail::no_parameter>::type = graph::detail::no_parameter; typename graph_traits::traversal_category = undir_adj_list_traversal_tag]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/betweenness_centrality.hpp:468:43: required from ‘void boost::detail::graph::brandes_betweenness_centrality_dispatch2(const Graph&, CentralityMap, EdgeCentralityMap, WeightMap, VertexIndexMap) [with Graph = boost::adjacency_list >, boost::property > >; CentralityMap = boost::vec_adj_list_vertex_property_map >, boost::property > >, boost::adjacency_list >, boost::property > >*, double, double&, boost::vertex_centrality_t>; EdgeCentralityMap = boost::adj_list_edge_property_map >, boost::edge_centrality_t>; WeightMap = boost::adj_list_edge_property_map >, boost::edge_weight_t>; VertexIndexMap = boost::vec_adj_list_vertex_id_map >, long unsigned int>]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/betweenness_centrality.hpp:517:57: required from ‘static void boost::detail::graph::brandes_betweenness_centrality_dispatch1::run(const Graph&, CentralityMap, EdgeCentralityMap, VertexIndexMap, WeightMap) [with Graph = boost::adjacency_list >, boost::property > >; CentralityMap = boost::vec_adj_list_vertex_property_map >, boost::property > >, boost::adjacency_list >, boost::property > >*, double, double&, boost::vertex_centrality_t>; EdgeCentralityMap = boost::adj_list_edge_property_map >, boost::edge_centrality_t>; VertexIndexMap = boost::vec_adj_list_vertex_id_map >, long unsigned int>; WeightMap = boost::adj_list_edge_property_map >, boost::edge_weight_t>]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/betweenness_centrality.hpp:558:71: required from ‘void boost::brandes_betweenness_centrality(const Graph&, const bgl_named_params&, typename enable_if_c::traversal_category>::value, graph::detail::no_parameter>::type) [with Graph = adjacency_list >, property > >; Param = adj_list_edge_property_map >, edge_weight_t>; Tag = edge_weight_t; Rest = bgl_named_params >, edge_centrality_t>, edge_centrality_t, bgl_named_params >, property > >, adjacency_list >, property > >*, double, double&, vertex_centrality_t>, vertex_centrality_t, no_property> >; typename enable_if_c::traversal_category>::value, graph::detail::no_parameter>::type = graph::detail::no_parameter; typename graph_traits::traversal_category = undir_adj_list_traversal_tag]’ bbc.cpp:67:33: required from here /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::CopyConstructible::~CopyConstructible() [with TT = boost::detail::dijkstra_bfs_visitor >, boost::property > >, boost::adj_list_edge_property_map >, boost::edge_weight_t>, boost::iterator_property_map<__gnu_cxx::__normal_iterator, std::allocator > >*, std::vector, std::allocator > >, std::allocator, std::allocator > > > > >, boost::vec_adj_list_vertex_id_map >, long unsigned int>, std::vector, std::allocator > >, std::vector, std::allocator > >&>, boost::iterator_property_map<__gnu_cxx::__normal_iterator > >, boost::vec_adj_list_vertex_id_map >, long unsigned int>, double, double&>, boost::iterator_property_map<__gnu_cxx::__normal_iterator > >, boost::vec_adj_list_vertex_id_map >, long unsigned int>, long unsigned int, long unsigned int&> >, boost::d_ary_heap_indirect >, long unsigned int>, long unsigned int, long unsigned int&>, boost::iterator_property_map<__gnu_cxx::__normal_iterator > >, boost::vec_adj_list_vertex_id_map >, long unsigned int>, double, double&>, std::less, std::vector > >, boost::adj_list_edge_property_map >, boost::edge_weight_t>, boost::dummy_property_map, boost::iterator_property_map<__gnu_cxx::__normal_iterator > >, boost::vec_adj_list_vertex_id_map >, long unsigned int>, double, double&>, std::plus, std::less >]’ 37 | ~model() | ^ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:167:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 167 | BOOST_CONCEPT_USAGE(CopyConstructible) { | ^~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements >]’: /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:208:5: required from ‘struct boost::Convertible’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:206:3: required from ‘struct boost::ConvertibleConcept’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::ConvertibleConcept]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied >::value’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:72:8: [ skipping 21 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/betweenness_centrality.hpp:349:31: required from ‘void boost::detail::graph::brandes_betweenness_centrality_impl(const Graph&, CentralityMap, EdgeCentralityMap, IncomingMap, DistanceMap, DependencyMap, PathCountMap, VertexIndexMap, ShortestPaths) [with Graph = boost::adjacency_list >, boost::property > >; CentralityMap = boost::vec_adj_list_vertex_property_map >, boost::property > >, boost::adjacency_list >, boost::property > >*, double, double&, boost::vertex_centrality_t>; EdgeCentralityMap = boost::adj_list_edge_property_map >, boost::edge_centrality_t>; IncomingMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator, std::allocator > >*, std::vector, std::allocator > >, std::allocator, std::allocator > > > > >, boost::vec_adj_list_vertex_id_map >, long unsigned int>, std::vector, std::allocator > >, std::vector, std::allocator > >&>; DistanceMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator > >, boost::vec_adj_list_vertex_id_map >, long unsigned int>, double, double&>; DependencyMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator > >, boost::vec_adj_list_vertex_id_map >, long unsigned int>, double, double&>; PathCountMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator > >, boost::vec_adj_list_vertex_id_map >, long unsigned int>, long unsigned int, long unsigned int&>; VertexIndexMap = boost::vec_adj_list_vertex_id_map >, long unsigned int>; ShortestPaths = brandes_dijkstra_shortest_paths >, boost::edge_weight_t> >]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/betweenness_centrality.hpp:434:55: required from ‘void boost::brandes_betweenness_centrality(const Graph&, CentralityMap, EdgeCentralityMap, IncomingMap, DistanceMap, DependencyMap, PathCountMap, VertexIndexMap, WeightMap, typename enable_if_c::traversal_category>::value, graph::detail::no_parameter>::type) [with Graph = adjacency_list >, property > >; CentralityMap = vec_adj_list_vertex_property_map >, property > >, adjacency_list >, property > >*, double, double&, vertex_centrality_t>; EdgeCentralityMap = adj_list_edge_property_map >, edge_centrality_t>; IncomingMap = iterator_property_map<__gnu_cxx::__normal_iterator, std::allocator > >*, std::vector, std::allocator > >, std::allocator, std::allocator > > > > >, vec_adj_list_vertex_id_map >, long unsigned int>, std::vector, std::allocator > >, std::vector, std::allocator > >&>; DistanceMap = iterator_property_map<__gnu_cxx::__normal_iterator > >, vec_adj_list_vertex_id_map >, long unsigned int>, double, double&>; DependencyMap = iterator_property_map<__gnu_cxx::__normal_iterator > >, vec_adj_list_vertex_id_map >, long unsigned int>, double, double&>; PathCountMap = iterator_property_map<__gnu_cxx::__normal_iterator > >, vec_adj_list_vertex_id_map >, long unsigned int>, long unsigned int, long unsigned int&>; VertexIndexMap = vec_adj_list_vertex_id_map >, long unsigned int>; WeightMap = adj_list_edge_property_map >, edge_weight_t>; typename enable_if_c::traversal_category>::value, graph::detail::no_parameter>::type = graph::detail::no_parameter; typename graph_traits::traversal_category = undir_adj_list_traversal_tag]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/betweenness_centrality.hpp:468:43: required from ‘void boost::detail::graph::brandes_betweenness_centrality_dispatch2(const Graph&, CentralityMap, EdgeCentralityMap, WeightMap, VertexIndexMap) [with Graph = boost::adjacency_list >, boost::property > >; CentralityMap = boost::vec_adj_list_vertex_property_map >, boost::property > >, boost::adjacency_list >, boost::property > >*, double, double&, boost::vertex_centrality_t>; EdgeCentralityMap = boost::adj_list_edge_property_map >, boost::edge_centrality_t>; WeightMap = boost::adj_list_edge_property_map >, boost::edge_weight_t>; VertexIndexMap = boost::vec_adj_list_vertex_id_map >, long unsigned int>]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/betweenness_centrality.hpp:517:57: required from ‘static void boost::detail::graph::brandes_betweenness_centrality_dispatch1::run(const Graph&, CentralityMap, EdgeCentralityMap, VertexIndexMap, WeightMap) [with Graph = boost::adjacency_list >, boost::property > >; CentralityMap = boost::vec_adj_list_vertex_property_map >, boost::property > >, boost::adjacency_list >, boost::property > >*, double, double&, boost::vertex_centrality_t>; EdgeCentralityMap = boost::adj_list_edge_property_map >, boost::edge_centrality_t>; VertexIndexMap = boost::vec_adj_list_vertex_id_map >, long unsigned int>; WeightMap = boost::adj_list_edge_property_map >, boost::edge_weight_t>]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/betweenness_centrality.hpp:558:71: required from ‘void boost::brandes_betweenness_centrality(const Graph&, const bgl_named_params&, typename enable_if_c::traversal_category>::value, graph::detail::no_parameter>::type) [with Graph = adjacency_list >, property > >; Param = adj_list_edge_property_map >, edge_weight_t>; Tag = edge_weight_t; Rest = bgl_named_params >, edge_centrality_t>, edge_centrality_t, bgl_named_params >, property > >, adjacency_list >, property > >*, double, double&, vertex_centrality_t>, vertex_centrality_t, no_property> >; typename enable_if_c::traversal_category>::value, graph::detail::no_parameter>::type = graph::detail::no_parameter; typename graph_traits::traversal_category = undir_adj_list_traversal_tag]’ bbc.cpp:67:33: required from here /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::Convertible]’ 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ^ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::ConvertibleConcept]’: /home/omnipath/local/R/4.4-3.20/BH/include/boost/property_map/property_map.hpp:148:7: required from ‘void boost::ReadablePropertyMapConcept::constraints() [with PMap = boost::two_bit_color_map >, long unsigned int> >; Key = long unsigned int]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::ReadablePropertyMapConcept >, long unsigned int> >, long unsigned int>]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied >, long unsigned int> >, long unsigned int> >::value’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied >, long unsigned int> >, long unsigned int> >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_ >, long unsigned int> >, long unsigned int>)>’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/property_map/property_map.hpp:206:7: [ skipping 15 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/betweenness_centrality.hpp:349:31: required from ‘void boost::detail::graph::brandes_betweenness_centrality_impl(const Graph&, CentralityMap, EdgeCentralityMap, IncomingMap, DistanceMap, DependencyMap, PathCountMap, VertexIndexMap, ShortestPaths) [with Graph = boost::adjacency_list >, boost::property > >; CentralityMap = boost::vec_adj_list_vertex_property_map >, boost::property > >, boost::adjacency_list >, boost::property > >*, double, double&, boost::vertex_centrality_t>; EdgeCentralityMap = boost::adj_list_edge_property_map >, boost::edge_centrality_t>; IncomingMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator, std::allocator > >*, std::vector, std::allocator > >, std::allocator, std::allocator > > > > >, boost::vec_adj_list_vertex_id_map >, long unsigned int>, std::vector, std::allocator > >, std::vector, std::allocator > >&>; DistanceMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator > >, boost::vec_adj_list_vertex_id_map >, long unsigned int>, double, double&>; DependencyMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator > >, boost::vec_adj_list_vertex_id_map >, long unsigned int>, double, double&>; PathCountMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator > >, boost::vec_adj_list_vertex_id_map >, long unsigned int>, long unsigned int, long unsigned int&>; VertexIndexMap = boost::vec_adj_list_vertex_id_map >, long unsigned int>; ShortestPaths = brandes_dijkstra_shortest_paths >, boost::edge_weight_t> >]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/betweenness_centrality.hpp:434:55: required from ‘void boost::brandes_betweenness_centrality(const Graph&, CentralityMap, EdgeCentralityMap, IncomingMap, DistanceMap, DependencyMap, PathCountMap, VertexIndexMap, WeightMap, typename enable_if_c::traversal_category>::value, graph::detail::no_parameter>::type) [with Graph = adjacency_list >, property > >; CentralityMap = vec_adj_list_vertex_property_map >, property > >, adjacency_list >, property > >*, double, double&, vertex_centrality_t>; EdgeCentralityMap = adj_list_edge_property_map >, edge_centrality_t>; IncomingMap = iterator_property_map<__gnu_cxx::__normal_iterator, std::allocator > >*, std::vector, std::allocator > >, std::allocator, std::allocator > > > > >, vec_adj_list_vertex_id_map >, long unsigned int>, std::vector, std::allocator > >, std::vector, std::allocator > >&>; DistanceMap = iterator_property_map<__gnu_cxx::__normal_iterator > >, vec_adj_list_vertex_id_map >, long unsigned int>, double, double&>; DependencyMap = iterator_property_map<__gnu_cxx::__normal_iterator > >, vec_adj_list_vertex_id_map >, long unsigned int>, double, double&>; PathCountMap = iterator_property_map<__gnu_cxx::__normal_iterator > >, vec_adj_list_vertex_id_map >, long unsigned int>, long unsigned int, long unsigned int&>; VertexIndexMap = vec_adj_list_vertex_id_map >, long unsigned int>; WeightMap = adj_list_edge_property_map >, edge_weight_t>; typename enable_if_c::traversal_category>::value, graph::detail::no_parameter>::type = graph::detail::no_parameter; typename graph_traits::traversal_category = undir_adj_list_traversal_tag]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/betweenness_centrality.hpp:468:43: required from ‘void boost::detail::graph::brandes_betweenness_centrality_dispatch2(const Graph&, CentralityMap, EdgeCentralityMap, WeightMap, VertexIndexMap) [with Graph = boost::adjacency_list >, boost::property > >; CentralityMap = boost::vec_adj_list_vertex_property_map >, boost::property > >, boost::adjacency_list >, boost::property > >*, double, double&, boost::vertex_centrality_t>; EdgeCentralityMap = boost::adj_list_edge_property_map >, boost::edge_centrality_t>; WeightMap = boost::adj_list_edge_property_map >, boost::edge_weight_t>; VertexIndexMap = boost::vec_adj_list_vertex_id_map >, long unsigned int>]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/betweenness_centrality.hpp:517:57: required from ‘static void boost::detail::graph::brandes_betweenness_centrality_dispatch1::run(const Graph&, CentralityMap, EdgeCentralityMap, VertexIndexMap, WeightMap) [with Graph = boost::adjacency_list >, boost::property > >; CentralityMap = boost::vec_adj_list_vertex_property_map >, boost::property > >, boost::adjacency_list >, boost::property > >*, double, double&, boost::vertex_centrality_t>; EdgeCentralityMap = boost::adj_list_edge_property_map >, boost::edge_centrality_t>; VertexIndexMap = boost::vec_adj_list_vertex_id_map >, long unsigned int>; WeightMap = boost::adj_list_edge_property_map >, boost::edge_weight_t>]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/betweenness_centrality.hpp:558:71: required from ‘void boost::brandes_betweenness_centrality(const Graph&, const bgl_named_params&, typename enable_if_c::traversal_category>::value, graph::detail::no_parameter>::type) [with Graph = adjacency_list >, property > >; Param = adj_list_edge_property_map >, edge_weight_t>; Tag = edge_weight_t; Rest = bgl_named_params >, edge_centrality_t>, edge_centrality_t, bgl_named_params >, property > >, adjacency_list >, property > >*, double, double&, vertex_centrality_t>, vertex_centrality_t, no_property> >; typename enable_if_c::traversal_category>::value, graph::detail::no_parameter>::type = graph::detail::no_parameter; typename graph_traits::traversal_category = undir_adj_list_traversal_tag]’ bbc.cpp:67:33: required from here /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:206:17: note: in a call to non-static member function ‘boost::ConvertibleConcept::~ConvertibleConcept()’ 206 | BOOST_concept(Convertible,(X)(Y)) | ^~~~~~~~~~~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/preprocessor/cat.hpp:29:34: note: in definition of macro ‘BOOST_PP_CAT_I’ 29 | # define BOOST_PP_CAT_I(a, b) a ## b | ^ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/concept_def.hpp:23:12: note: in expansion of macro ‘BOOST_PP_CAT’ 23 | struct BOOST_PP_CAT(name,Concept) \ | ^~~~~~~~~~~~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:206:3: note: in expansion of macro ‘BOOST_concept’ 206 | BOOST_concept(Convertible,(X)(Y)) | ^~~~~~~~~~~~~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements >]’: /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:208:5: required from ‘struct boost::Convertible’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:206:3: required from ‘struct boost::ConvertibleConcept’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::ConvertibleConcept]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied >::value’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:72:8: [ skipping 21 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/betweenness_centrality.hpp:349:31: required from ‘void boost::detail::graph::brandes_betweenness_centrality_impl(const Graph&, CentralityMap, EdgeCentralityMap, IncomingMap, DistanceMap, DependencyMap, PathCountMap, VertexIndexMap, ShortestPaths) [with Graph = boost::adjacency_list >, boost::property > >; CentralityMap = boost::vec_adj_list_vertex_property_map >, boost::property > >, boost::adjacency_list >, boost::property > >*, double, double&, boost::vertex_centrality_t>; EdgeCentralityMap = boost::adj_list_edge_property_map >, boost::edge_centrality_t>; IncomingMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator, std::allocator > >*, std::vector, std::allocator > >, std::allocator, std::allocator > > > > >, boost::vec_adj_list_vertex_id_map >, long unsigned int>, std::vector, std::allocator > >, std::vector, std::allocator > >&>; DistanceMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator > >, boost::vec_adj_list_vertex_id_map >, long unsigned int>, double, double&>; DependencyMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator > >, boost::vec_adj_list_vertex_id_map >, long unsigned int>, double, double&>; PathCountMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator > >, boost::vec_adj_list_vertex_id_map >, long unsigned int>, long unsigned int, long unsigned int&>; VertexIndexMap = boost::vec_adj_list_vertex_id_map >, long unsigned int>; ShortestPaths = brandes_dijkstra_shortest_paths >, boost::edge_weight_t> >]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/betweenness_centrality.hpp:434:55: required from ‘void boost::brandes_betweenness_centrality(const Graph&, CentralityMap, EdgeCentralityMap, IncomingMap, DistanceMap, DependencyMap, PathCountMap, VertexIndexMap, WeightMap, typename enable_if_c::traversal_category>::value, graph::detail::no_parameter>::type) [with Graph = adjacency_list >, property > >; CentralityMap = vec_adj_list_vertex_property_map >, property > >, adjacency_list >, property > >*, double, double&, vertex_centrality_t>; EdgeCentralityMap = adj_list_edge_property_map >, edge_centrality_t>; IncomingMap = iterator_property_map<__gnu_cxx::__normal_iterator, std::allocator > >*, std::vector, std::allocator > >, std::allocator, std::allocator > > > > >, vec_adj_list_vertex_id_map >, long unsigned int>, std::vector, std::allocator > >, std::vector, std::allocator > >&>; DistanceMap = iterator_property_map<__gnu_cxx::__normal_iterator > >, vec_adj_list_vertex_id_map >, long unsigned int>, double, double&>; DependencyMap = iterator_property_map<__gnu_cxx::__normal_iterator > >, vec_adj_list_vertex_id_map >, long unsigned int>, double, double&>; PathCountMap = iterator_property_map<__gnu_cxx::__normal_iterator > >, vec_adj_list_vertex_id_map >, long unsigned int>, long unsigned int, long unsigned int&>; VertexIndexMap = vec_adj_list_vertex_id_map >, long unsigned int>; WeightMap = adj_list_edge_property_map >, edge_weight_t>; typename enable_if_c::traversal_category>::value, graph::detail::no_parameter>::type = graph::detail::no_parameter; typename graph_traits::traversal_category = undir_adj_list_traversal_tag]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/betweenness_centrality.hpp:468:43: required from ‘void boost::detail::graph::brandes_betweenness_centrality_dispatch2(const Graph&, CentralityMap, EdgeCentralityMap, WeightMap, VertexIndexMap) [with Graph = boost::adjacency_list >, boost::property > >; CentralityMap = boost::vec_adj_list_vertex_property_map >, boost::property > >, boost::adjacency_list >, boost::property > >*, double, double&, boost::vertex_centrality_t>; EdgeCentralityMap = boost::adj_list_edge_property_map >, boost::edge_centrality_t>; WeightMap = boost::adj_list_edge_property_map >, boost::edge_weight_t>; VertexIndexMap = boost::vec_adj_list_vertex_id_map >, long unsigned int>]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/betweenness_centrality.hpp:517:57: required from ‘static void boost::detail::graph::brandes_betweenness_centrality_dispatch1::run(const Graph&, CentralityMap, EdgeCentralityMap, VertexIndexMap, WeightMap) [with Graph = boost::adjacency_list >, boost::property > >; CentralityMap = boost::vec_adj_list_vertex_property_map >, boost::property > >, boost::adjacency_list >, boost::property > >*, double, double&, boost::vertex_centrality_t>; EdgeCentralityMap = boost::adj_list_edge_property_map >, boost::edge_centrality_t>; VertexIndexMap = boost::vec_adj_list_vertex_id_map >, long unsigned int>; WeightMap = boost::adj_list_edge_property_map >, boost::edge_weight_t>]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/betweenness_centrality.hpp:558:71: required from ‘void boost::brandes_betweenness_centrality(const Graph&, const bgl_named_params&, typename enable_if_c::traversal_category>::value, graph::detail::no_parameter>::type) [with Graph = adjacency_list >, property > >; Param = adj_list_edge_property_map >, edge_weight_t>; Tag = edge_weight_t; Rest = bgl_named_params >, edge_centrality_t>, edge_centrality_t, bgl_named_params >, property > >, adjacency_list >, property > >*, double, double&, vertex_centrality_t>, vertex_centrality_t, no_property> >; typename enable_if_c::traversal_category>::value, graph::detail::no_parameter>::type = graph::detail::no_parameter; typename graph_traits::traversal_category = undir_adj_list_traversal_tag]’ bbc.cpp:67:33: required from here /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::Convertible]’ 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ^ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::ConvertibleConcept]’: /home/omnipath/local/R/4.4-3.20/BH/include/boost/property_map/property_map.hpp:180:7: required from ‘void boost::WritablePropertyMapConcept::constraints() [with PMap = boost::two_bit_color_map >, long unsigned int> >; Key = long unsigned int]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::WritablePropertyMapConcept >, long unsigned int> >, long unsigned int>]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied >, long unsigned int> >, long unsigned int> >::value’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied >, long unsigned int> >, long unsigned int> >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_ >, long unsigned int> >, long unsigned int>)>’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/property_map/property_map.hpp:207:7: [ skipping 15 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/betweenness_centrality.hpp:349:31: required from ‘void boost::detail::graph::brandes_betweenness_centrality_impl(const Graph&, CentralityMap, EdgeCentralityMap, IncomingMap, DistanceMap, DependencyMap, PathCountMap, VertexIndexMap, ShortestPaths) [with Graph = boost::adjacency_list >, boost::property > >; CentralityMap = boost::vec_adj_list_vertex_property_map >, boost::property > >, boost::adjacency_list >, boost::property > >*, double, double&, boost::vertex_centrality_t>; EdgeCentralityMap = boost::adj_list_edge_property_map >, boost::edge_centrality_t>; IncomingMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator, std::allocator > >*, std::vector, std::allocator > >, std::allocator, std::allocator > > > > >, boost::vec_adj_list_vertex_id_map >, long unsigned int>, std::vector, std::allocator > >, std::vector, std::allocator > >&>; DistanceMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator > >, boost::vec_adj_list_vertex_id_map >, long unsigned int>, double, double&>; DependencyMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator > >, boost::vec_adj_list_vertex_id_map >, long unsigned int>, double, double&>; PathCountMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator > >, boost::vec_adj_list_vertex_id_map >, long unsigned int>, long unsigned int, long unsigned int&>; VertexIndexMap = boost::vec_adj_list_vertex_id_map >, long unsigned int>; ShortestPaths = brandes_dijkstra_shortest_paths >, boost::edge_weight_t> >]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/betweenness_centrality.hpp:434:55: required from ‘void boost::brandes_betweenness_centrality(const Graph&, CentralityMap, EdgeCentralityMap, IncomingMap, DistanceMap, DependencyMap, PathCountMap, VertexIndexMap, WeightMap, typename enable_if_c::traversal_category>::value, graph::detail::no_parameter>::type) [with Graph = adjacency_list >, property > >; CentralityMap = vec_adj_list_vertex_property_map >, property > >, adjacency_list >, property > >*, double, double&, vertex_centrality_t>; EdgeCentralityMap = adj_list_edge_property_map >, edge_centrality_t>; IncomingMap = iterator_property_map<__gnu_cxx::__normal_iterator, std::allocator > >*, std::vector, std::allocator > >, std::allocator, std::allocator > > > > >, vec_adj_list_vertex_id_map >, long unsigned int>, std::vector, std::allocator > >, std::vector, std::allocator > >&>; DistanceMap = iterator_property_map<__gnu_cxx::__normal_iterator > >, vec_adj_list_vertex_id_map >, long unsigned int>, double, double&>; DependencyMap = iterator_property_map<__gnu_cxx::__normal_iterator > >, vec_adj_list_vertex_id_map >, long unsigned int>, double, double&>; PathCountMap = iterator_property_map<__gnu_cxx::__normal_iterator > >, vec_adj_list_vertex_id_map >, long unsigned int>, long unsigned int, long unsigned int&>; VertexIndexMap = vec_adj_list_vertex_id_map >, long unsigned int>; WeightMap = adj_list_edge_property_map >, edge_weight_t>; typename enable_if_c::traversal_category>::value, graph::detail::no_parameter>::type = graph::detail::no_parameter; typename graph_traits::traversal_category = undir_adj_list_traversal_tag]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/betweenness_centrality.hpp:468:43: required from ‘void boost::detail::graph::brandes_betweenness_centrality_dispatch2(const Graph&, CentralityMap, EdgeCentralityMap, WeightMap, VertexIndexMap) [with Graph = boost::adjacency_list >, boost::property > >; CentralityMap = boost::vec_adj_list_vertex_property_map >, boost::property > >, boost::adjacency_list >, boost::property > >*, double, double&, boost::vertex_centrality_t>; EdgeCentralityMap = boost::adj_list_edge_property_map >, boost::edge_centrality_t>; WeightMap = boost::adj_list_edge_property_map >, boost::edge_weight_t>; VertexIndexMap = boost::vec_adj_list_vertex_id_map >, long unsigned int>]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/betweenness_centrality.hpp:517:57: required from ‘static void boost::detail::graph::brandes_betweenness_centrality_dispatch1::run(const Graph&, CentralityMap, EdgeCentralityMap, VertexIndexMap, WeightMap) [with Graph = boost::adjacency_list >, boost::property > >; CentralityMap = boost::vec_adj_list_vertex_property_map >, boost::property > >, boost::adjacency_list >, boost::property > >*, double, double&, boost::vertex_centrality_t>; EdgeCentralityMap = boost::adj_list_edge_property_map >, boost::edge_centrality_t>; VertexIndexMap = boost::vec_adj_list_vertex_id_map >, long unsigned int>; WeightMap = boost::adj_list_edge_property_map >, boost::edge_weight_t>]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/betweenness_centrality.hpp:558:71: required from ‘void boost::brandes_betweenness_centrality(const Graph&, const bgl_named_params&, typename enable_if_c::traversal_category>::value, graph::detail::no_parameter>::type) [with Graph = adjacency_list >, property > >; Param = adj_list_edge_property_map >, edge_weight_t>; Tag = edge_weight_t; Rest = bgl_named_params >, edge_centrality_t>, edge_centrality_t, bgl_named_params >, property > >, adjacency_list >, property > >*, double, double&, vertex_centrality_t>, vertex_centrality_t, no_property> >; typename enable_if_c::traversal_category>::value, graph::detail::no_parameter>::type = graph::detail::no_parameter; typename graph_traits::traversal_category = undir_adj_list_traversal_tag]’ bbc.cpp:67:33: required from here /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:206:17: note: in a call to non-static member function ‘boost::ConvertibleConcept::~ConvertibleConcept()’ 206 | BOOST_concept(Convertible,(X)(Y)) | ^~~~~~~~~~~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/preprocessor/cat.hpp:29:34: note: in definition of macro ‘BOOST_PP_CAT_I’ 29 | # define BOOST_PP_CAT_I(a, b) a ## b | ^ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/concept_def.hpp:23:12: note: in expansion of macro ‘BOOST_PP_CAT’ 23 | struct BOOST_PP_CAT(name,Concept) \ | ^~~~~~~~~~~~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:206:3: note: in expansion of macro ‘BOOST_concept’ 206 | BOOST_concept(Convertible,(X)(Y)) | ^~~~~~~~~~~~~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::Convertible]’: /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements >]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:208:5: required from ‘struct boost::Convertible’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:206:3: required from ‘struct boost::ConvertibleConcept’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::ConvertibleConcept]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied >::value’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:45:51: [ skipping 17 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/betweenness_centrality.hpp:349:31: required from ‘void boost::detail::graph::brandes_betweenness_centrality_impl(const Graph&, CentralityMap, EdgeCentralityMap, IncomingMap, DistanceMap, DependencyMap, PathCountMap, VertexIndexMap, ShortestPaths) [with Graph = boost::adjacency_list >, boost::property > >; CentralityMap = boost::vec_adj_list_vertex_property_map >, boost::property > >, boost::adjacency_list >, boost::property > >*, double, double&, boost::vertex_centrality_t>; EdgeCentralityMap = boost::adj_list_edge_property_map >, boost::edge_centrality_t>; IncomingMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator, std::allocator > >*, std::vector, std::allocator > >, std::allocator, std::allocator > > > > >, boost::vec_adj_list_vertex_id_map >, long unsigned int>, std::vector, std::allocator > >, std::vector, std::allocator > >&>; DistanceMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator > >, boost::vec_adj_list_vertex_id_map >, long unsigned int>, double, double&>; DependencyMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator > >, boost::vec_adj_list_vertex_id_map >, long unsigned int>, double, double&>; PathCountMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator > >, boost::vec_adj_list_vertex_id_map >, long unsigned int>, long unsigned int, long unsigned int&>; VertexIndexMap = boost::vec_adj_list_vertex_id_map >, long unsigned int>; ShortestPaths = brandes_dijkstra_shortest_paths >, boost::edge_weight_t> >]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/betweenness_centrality.hpp:434:55: required from ‘void boost::brandes_betweenness_centrality(const Graph&, CentralityMap, EdgeCentralityMap, IncomingMap, DistanceMap, DependencyMap, PathCountMap, VertexIndexMap, WeightMap, typename enable_if_c::traversal_category>::value, graph::detail::no_parameter>::type) [with Graph = adjacency_list >, property > >; CentralityMap = vec_adj_list_vertex_property_map >, property > >, adjacency_list >, property > >*, double, double&, vertex_centrality_t>; EdgeCentralityMap = adj_list_edge_property_map >, edge_centrality_t>; IncomingMap = iterator_property_map<__gnu_cxx::__normal_iterator, std::allocator > >*, std::vector, std::allocator > >, std::allocator, std::allocator > > > > >, vec_adj_list_vertex_id_map >, long unsigned int>, std::vector, std::allocator > >, std::vector, std::allocator > >&>; DistanceMap = iterator_property_map<__gnu_cxx::__normal_iterator > >, vec_adj_list_vertex_id_map >, long unsigned int>, double, double&>; DependencyMap = iterator_property_map<__gnu_cxx::__normal_iterator > >, vec_adj_list_vertex_id_map >, long unsigned int>, double, double&>; PathCountMap = iterator_property_map<__gnu_cxx::__normal_iterator > >, vec_adj_list_vertex_id_map >, long unsigned int>, long unsigned int, long unsigned int&>; VertexIndexMap = vec_adj_list_vertex_id_map >, long unsigned int>; WeightMap = adj_list_edge_property_map >, edge_weight_t>; typename enable_if_c::traversal_category>::value, graph::detail::no_parameter>::type = graph::detail::no_parameter; typename graph_traits::traversal_category = undir_adj_list_traversal_tag]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/betweenness_centrality.hpp:468:43: required from ‘void boost::detail::graph::brandes_betweenness_centrality_dispatch2(const Graph&, CentralityMap, EdgeCentralityMap, WeightMap, VertexIndexMap) [with Graph = boost::adjacency_list >, boost::property > >; CentralityMap = boost::vec_adj_list_vertex_property_map >, boost::property > >, boost::adjacency_list >, boost::property > >*, double, double&, boost::vertex_centrality_t>; EdgeCentralityMap = boost::adj_list_edge_property_map >, boost::edge_centrality_t>; WeightMap = boost::adj_list_edge_property_map >, boost::edge_weight_t>; VertexIndexMap = boost::vec_adj_list_vertex_id_map >, long unsigned int>]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/betweenness_centrality.hpp:517:57: required from ‘static void boost::detail::graph::brandes_betweenness_centrality_dispatch1::run(const Graph&, CentralityMap, EdgeCentralityMap, VertexIndexMap, WeightMap) [with Graph = boost::adjacency_list >, boost::property > >; CentralityMap = boost::vec_adj_list_vertex_property_map >, boost::property > >, boost::adjacency_list >, boost::property > >*, double, double&, boost::vertex_centrality_t>; EdgeCentralityMap = boost::adj_list_edge_property_map >, boost::edge_centrality_t>; VertexIndexMap = boost::vec_adj_list_vertex_id_map >, long unsigned int>; WeightMap = boost::adj_list_edge_property_map >, boost::edge_weight_t>]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/betweenness_centrality.hpp:558:71: required from ‘void boost::brandes_betweenness_centrality(const Graph&, const bgl_named_params&, typename enable_if_c::traversal_category>::value, graph::detail::no_parameter>::type) [with Graph = adjacency_list >, property > >; Param = adj_list_edge_property_map >, edge_weight_t>; Tag = edge_weight_t; Rest = bgl_named_params >, edge_centrality_t>, edge_centrality_t, bgl_named_params >, property > >, adjacency_list >, property > >*, double, double&, vertex_centrality_t>, vertex_centrality_t, no_property> >; typename enable_if_c::traversal_category>::value, graph::detail::no_parameter>::type = graph::detail::no_parameter; typename graph_traits::traversal_category = undir_adj_list_traversal_tag]’ bbc.cpp:67:33: required from here /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::Convertible::~Convertible() [with X = boost::read_write_property_map_tag; Y = boost::read_write_property_map_tag]’ 37 | ~model() | ^ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:208:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 208 | BOOST_CONCEPT_USAGE(Convertible) { | ^~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::Convertible, std::input_iterator_tag>]’: /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements, std::input_iterator_tag> >]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:208:5: required from ‘struct boost::Convertible, std::input_iterator_tag>’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::Convertible, std::input_iterator_tag>]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied, std::input_iterator_tag> >::value’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied, std::input_iterator_tag> >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:72:8: [ skipping 12 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/betweenness_centrality.hpp:500:43: required from ‘void boost::detail::graph::brandes_betweenness_centrality_dispatch2(const Graph&, CentralityMap, EdgeCentralityMap, VertexIndexMap) [with Graph = boost::adjacency_list >, boost::property > >; CentralityMap = boost::dummy_property_map; EdgeCentralityMap = boost::adj_list_edge_property_map >, boost::edge_centrality_t>; VertexIndexMap = boost::vec_adj_list_vertex_id_map >, long unsigned int>]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/betweenness_centrality.hpp:531:57: required from ‘static void boost::detail::graph::brandes_betweenness_centrality_dispatch1::run(const Graph&, CentralityMap, EdgeCentralityMap, VertexIndexMap, boost::param_not_found) [with Graph = boost::adjacency_list >, boost::property > >; CentralityMap = boost::dummy_property_map; EdgeCentralityMap = boost::adj_list_edge_property_map >, boost::edge_centrality_t>; VertexIndexMap = boost::vec_adj_list_vertex_id_map >, long unsigned int>]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/betweenness_centrality.hpp:558:71: required from ‘void boost::brandes_betweenness_centrality(const Graph&, const bgl_named_params&, typename enable_if_c::traversal_category>::value, graph::detail::no_parameter>::type) [with Graph = adjacency_list >, property > >; Param = vec_adj_list_vertex_id_map >, long unsigned int>; Tag = vertex_index_t; Rest = bgl_named_params >, edge_centrality_t>, edge_centrality_t, no_property>; typename enable_if_c::traversal_category>::value, graph::detail::no_parameter>::type = graph::detail::no_parameter; typename graph_traits::traversal_category = undir_adj_list_traversal_tag]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/bc_clustering.hpp:131:39: required from ‘void boost::betweenness_centrality_clustering(MutableGraph&, Done, EdgeCentralityMap, VertexIndexMap) [with MutableGraph = adjacency_list >, property > >; Done = clustering_threshold; EdgeCentralityMap = adj_list_edge_property_map >, edge_centrality_t>; VertexIndexMap = vec_adj_list_vertex_id_map >, long unsigned int>]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/bc_clustering.hpp:150:38: required from ‘void boost::betweenness_centrality_clustering(MutableGraph&, Done, EdgeCentralityMap) [with MutableGraph = adjacency_list >, property > >; Done = clustering_threshold; EdgeCentralityMap = adj_list_edge_property_map >, edge_centrality_t>]’ bbc.cpp:149:36: required from here /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::Convertible::~Convertible() [with X = boost::iterators::detail::iterator_category_with_traversal; Y = std::input_iterator_tag]’ 37 | ~model() | ^ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:208:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 208 | BOOST_CONCEPT_USAGE(Convertible) { | ^~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::Assignable]’: /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements >]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:145:5: required from ‘struct boost::Assignable’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:502:3: required from ‘struct boost::InputIterator’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:540:3: required from ‘struct boost::ForwardIterator’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:568:3: required from ‘struct boost::BidirectionalIterator’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:597:3: [ skipping 18 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/betweenness_centrality.hpp:349:31: required from ‘void boost::detail::graph::brandes_betweenness_centrality_impl(const Graph&, CentralityMap, EdgeCentralityMap, IncomingMap, DistanceMap, DependencyMap, PathCountMap, VertexIndexMap, ShortestPaths) [with Graph = boost::adjacency_list >, boost::property > >; CentralityMap = boost::vec_adj_list_vertex_property_map >, boost::property > >, boost::adjacency_list >, boost::property > >*, double, double&, boost::vertex_centrality_t>; EdgeCentralityMap = boost::adj_list_edge_property_map >, boost::edge_centrality_t>; IncomingMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator, std::allocator > >*, std::vector, std::allocator > >, std::allocator, std::allocator > > > > >, boost::vec_adj_list_vertex_id_map >, long unsigned int>, std::vector, std::allocator > >, std::vector, std::allocator > >&>; DistanceMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator > >, boost::vec_adj_list_vertex_id_map >, long unsigned int>, double, double&>; DependencyMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator > >, boost::vec_adj_list_vertex_id_map >, long unsigned int>, double, double&>; PathCountMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator > >, boost::vec_adj_list_vertex_id_map >, long unsigned int>, long unsigned int, long unsigned int&>; VertexIndexMap = boost::vec_adj_list_vertex_id_map >, long unsigned int>; ShortestPaths = brandes_dijkstra_shortest_paths >, boost::edge_weight_t> >]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/betweenness_centrality.hpp:434:55: required from ‘void boost::brandes_betweenness_centrality(const Graph&, CentralityMap, EdgeCentralityMap, IncomingMap, DistanceMap, DependencyMap, PathCountMap, VertexIndexMap, WeightMap, typename enable_if_c::traversal_category>::value, graph::detail::no_parameter>::type) [with Graph = adjacency_list >, property > >; CentralityMap = vec_adj_list_vertex_property_map >, property > >, adjacency_list >, property > >*, double, double&, vertex_centrality_t>; EdgeCentralityMap = adj_list_edge_property_map >, edge_centrality_t>; IncomingMap = iterator_property_map<__gnu_cxx::__normal_iterator, std::allocator > >*, std::vector, std::allocator > >, std::allocator, std::allocator > > > > >, vec_adj_list_vertex_id_map >, long unsigned int>, std::vector, std::allocator > >, std::vector, std::allocator > >&>; DistanceMap = iterator_property_map<__gnu_cxx::__normal_iterator > >, vec_adj_list_vertex_id_map >, long unsigned int>, double, double&>; DependencyMap = iterator_property_map<__gnu_cxx::__normal_iterator > >, vec_adj_list_vertex_id_map >, long unsigned int>, double, double&>; PathCountMap = iterator_property_map<__gnu_cxx::__normal_iterator > >, vec_adj_list_vertex_id_map >, long unsigned int>, long unsigned int, long unsigned int&>; VertexIndexMap = vec_adj_list_vertex_id_map >, long unsigned int>; WeightMap = adj_list_edge_property_map >, edge_weight_t>; typename enable_if_c::traversal_category>::value, graph::detail::no_parameter>::type = graph::detail::no_parameter; typename graph_traits::traversal_category = undir_adj_list_traversal_tag]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/betweenness_centrality.hpp:468:43: required from ‘void boost::detail::graph::brandes_betweenness_centrality_dispatch2(const Graph&, CentralityMap, EdgeCentralityMap, WeightMap, VertexIndexMap) [with Graph = boost::adjacency_list >, boost::property > >; CentralityMap = boost::vec_adj_list_vertex_property_map >, boost::property > >, boost::adjacency_list >, boost::property > >*, double, double&, boost::vertex_centrality_t>; EdgeCentralityMap = boost::adj_list_edge_property_map >, boost::edge_centrality_t>; WeightMap = boost::adj_list_edge_property_map >, boost::edge_weight_t>; VertexIndexMap = boost::vec_adj_list_vertex_id_map >, long unsigned int>]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/betweenness_centrality.hpp:517:57: required from ‘static void boost::detail::graph::brandes_betweenness_centrality_dispatch1::run(const Graph&, CentralityMap, EdgeCentralityMap, VertexIndexMap, WeightMap) [with Graph = boost::adjacency_list >, boost::property > >; CentralityMap = boost::vec_adj_list_vertex_property_map >, boost::property > >, boost::adjacency_list >, boost::property > >*, double, double&, boost::vertex_centrality_t>; EdgeCentralityMap = boost::adj_list_edge_property_map >, boost::edge_centrality_t>; VertexIndexMap = boost::vec_adj_list_vertex_id_map >, long unsigned int>; WeightMap = boost::adj_list_edge_property_map >, boost::edge_weight_t>]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/betweenness_centrality.hpp:558:71: required from ‘void boost::brandes_betweenness_centrality(const Graph&, const bgl_named_params&, typename enable_if_c::traversal_category>::value, graph::detail::no_parameter>::type) [with Graph = adjacency_list >, property > >; Param = adj_list_edge_property_map >, edge_weight_t>; Tag = edge_weight_t; Rest = bgl_named_params >, edge_centrality_t>, edge_centrality_t, bgl_named_params >, property > >, adjacency_list >, property > >*, double, double&, vertex_centrality_t>, vertex_centrality_t, no_property> >; typename enable_if_c::traversal_category>::value, graph::detail::no_parameter>::type = graph::detail::no_parameter; typename graph_traits::traversal_category = undir_adj_list_traversal_tag]’ bbc.cpp:67:33: required from here /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::Assignable::~Assignable() [with TT = long unsigned int*]’ 37 | ~model() | ^ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:145:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 145 | BOOST_CONCEPT_USAGE(Assignable) { | ^~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::EqualityComparable]’: /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements >]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:233:5: required from ‘struct boost::EqualityComparable’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:502:3: required from ‘struct boost::InputIterator’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:540:3: required from ‘struct boost::ForwardIterator’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:568:3: required from ‘struct boost::BidirectionalIterator’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:597:3: [ skipping 18 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/betweenness_centrality.hpp:349:31: required from ‘void boost::detail::graph::brandes_betweenness_centrality_impl(const Graph&, CentralityMap, EdgeCentralityMap, IncomingMap, DistanceMap, DependencyMap, PathCountMap, VertexIndexMap, ShortestPaths) [with Graph = boost::adjacency_list >, boost::property > >; CentralityMap = boost::vec_adj_list_vertex_property_map >, boost::property > >, boost::adjacency_list >, boost::property > >*, double, double&, boost::vertex_centrality_t>; EdgeCentralityMap = boost::adj_list_edge_property_map >, boost::edge_centrality_t>; IncomingMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator, std::allocator > >*, std::vector, std::allocator > >, std::allocator, std::allocator > > > > >, boost::vec_adj_list_vertex_id_map >, long unsigned int>, std::vector, std::allocator > >, std::vector, std::allocator > >&>; DistanceMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator > >, boost::vec_adj_list_vertex_id_map >, long unsigned int>, double, double&>; DependencyMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator > >, boost::vec_adj_list_vertex_id_map >, long unsigned int>, double, double&>; PathCountMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator > >, boost::vec_adj_list_vertex_id_map >, long unsigned int>, long unsigned int, long unsigned int&>; VertexIndexMap = boost::vec_adj_list_vertex_id_map >, long unsigned int>; ShortestPaths = brandes_dijkstra_shortest_paths >, boost::edge_weight_t> >]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/betweenness_centrality.hpp:434:55: required from ‘void boost::brandes_betweenness_centrality(const Graph&, CentralityMap, EdgeCentralityMap, IncomingMap, DistanceMap, DependencyMap, PathCountMap, VertexIndexMap, WeightMap, typename enable_if_c::traversal_category>::value, graph::detail::no_parameter>::type) [with Graph = adjacency_list >, property > >; CentralityMap = vec_adj_list_vertex_property_map >, property > >, adjacency_list >, property > >*, double, double&, vertex_centrality_t>; EdgeCentralityMap = adj_list_edge_property_map >, edge_centrality_t>; IncomingMap = iterator_property_map<__gnu_cxx::__normal_iterator, std::allocator > >*, std::vector, std::allocator > >, std::allocator, std::allocator > > > > >, vec_adj_list_vertex_id_map >, long unsigned int>, std::vector, std::allocator > >, std::vector, std::allocator > >&>; DistanceMap = iterator_property_map<__gnu_cxx::__normal_iterator > >, vec_adj_list_vertex_id_map >, long unsigned int>, double, double&>; DependencyMap = iterator_property_map<__gnu_cxx::__normal_iterator > >, vec_adj_list_vertex_id_map >, long unsigned int>, double, double&>; PathCountMap = iterator_property_map<__gnu_cxx::__normal_iterator > >, vec_adj_list_vertex_id_map >, long unsigned int>, long unsigned int, long unsigned int&>; VertexIndexMap = vec_adj_list_vertex_id_map >, long unsigned int>; WeightMap = adj_list_edge_property_map >, edge_weight_t>; typename enable_if_c::traversal_category>::value, graph::detail::no_parameter>::type = graph::detail::no_parameter; typename graph_traits::traversal_category = undir_adj_list_traversal_tag]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/betweenness_centrality.hpp:468:43: required from ‘void boost::detail::graph::brandes_betweenness_centrality_dispatch2(const Graph&, CentralityMap, EdgeCentralityMap, WeightMap, VertexIndexMap) [with Graph = boost::adjacency_list >, boost::property > >; CentralityMap = boost::vec_adj_list_vertex_property_map >, boost::property > >, boost::adjacency_list >, boost::property > >*, double, double&, boost::vertex_centrality_t>; EdgeCentralityMap = boost::adj_list_edge_property_map >, boost::edge_centrality_t>; WeightMap = boost::adj_list_edge_property_map >, boost::edge_weight_t>; VertexIndexMap = boost::vec_adj_list_vertex_id_map >, long unsigned int>]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/betweenness_centrality.hpp:517:57: required from ‘static void boost::detail::graph::brandes_betweenness_centrality_dispatch1::run(const Graph&, CentralityMap, EdgeCentralityMap, VertexIndexMap, WeightMap) [with Graph = boost::adjacency_list >, boost::property > >; CentralityMap = boost::vec_adj_list_vertex_property_map >, boost::property > >, boost::adjacency_list >, boost::property > >*, double, double&, boost::vertex_centrality_t>; EdgeCentralityMap = boost::adj_list_edge_property_map >, boost::edge_centrality_t>; VertexIndexMap = boost::vec_adj_list_vertex_id_map >, long unsigned int>; WeightMap = boost::adj_list_edge_property_map >, boost::edge_weight_t>]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/betweenness_centrality.hpp:558:71: required from ‘void boost::brandes_betweenness_centrality(const Graph&, const bgl_named_params&, typename enable_if_c::traversal_category>::value, graph::detail::no_parameter>::type) [with Graph = adjacency_list >, property > >; Param = adj_list_edge_property_map >, edge_weight_t>; Tag = edge_weight_t; Rest = bgl_named_params >, edge_centrality_t>, edge_centrality_t, bgl_named_params >, property > >, adjacency_list >, property > >*, double, double&, vertex_centrality_t>, vertex_centrality_t, no_property> >; typename enable_if_c::traversal_category>::value, graph::detail::no_parameter>::type = graph::detail::no_parameter; typename graph_traits::traversal_category = undir_adj_list_traversal_tag]’ bbc.cpp:67:33: required from here /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::EqualityComparable::~EqualityComparable() [with TT = long unsigned int*]’ 37 | ~model() | ^ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:233:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 233 | BOOST_CONCEPT_USAGE(EqualityComparable) { | ^~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::InputIterator]’: /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements >]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:512:7: required from ‘struct boost::InputIterator’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:540:3: required from ‘struct boost::ForwardIterator’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:568:3: required from ‘struct boost::BidirectionalIterator’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:597:3: required from ‘struct boost::RandomAccessIterator’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:597:3: [ skipping 17 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/betweenness_centrality.hpp:349:31: required from ‘void boost::detail::graph::brandes_betweenness_centrality_impl(const Graph&, CentralityMap, EdgeCentralityMap, IncomingMap, DistanceMap, DependencyMap, PathCountMap, VertexIndexMap, ShortestPaths) [with Graph = boost::adjacency_list >, boost::property > >; CentralityMap = boost::vec_adj_list_vertex_property_map >, boost::property > >, boost::adjacency_list >, boost::property > >*, double, double&, boost::vertex_centrality_t>; EdgeCentralityMap = boost::adj_list_edge_property_map >, boost::edge_centrality_t>; IncomingMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator, std::allocator > >*, std::vector, std::allocator > >, std::allocator, std::allocator > > > > >, boost::vec_adj_list_vertex_id_map >, long unsigned int>, std::vector, std::allocator > >, std::vector, std::allocator > >&>; DistanceMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator > >, boost::vec_adj_list_vertex_id_map >, long unsigned int>, double, double&>; DependencyMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator > >, boost::vec_adj_list_vertex_id_map >, long unsigned int>, double, double&>; PathCountMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator > >, boost::vec_adj_list_vertex_id_map >, long unsigned int>, long unsigned int, long unsigned int&>; VertexIndexMap = boost::vec_adj_list_vertex_id_map >, long unsigned int>; ShortestPaths = brandes_dijkstra_shortest_paths >, boost::edge_weight_t> >]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/betweenness_centrality.hpp:434:55: required from ‘void boost::brandes_betweenness_centrality(const Graph&, CentralityMap, EdgeCentralityMap, IncomingMap, DistanceMap, DependencyMap, PathCountMap, VertexIndexMap, WeightMap, typename enable_if_c::traversal_category>::value, graph::detail::no_parameter>::type) [with Graph = adjacency_list >, property > >; CentralityMap = vec_adj_list_vertex_property_map >, property > >, adjacency_list >, property > >*, double, double&, vertex_centrality_t>; EdgeCentralityMap = adj_list_edge_property_map >, edge_centrality_t>; IncomingMap = iterator_property_map<__gnu_cxx::__normal_iterator, std::allocator > >*, std::vector, std::allocator > >, std::allocator, std::allocator > > > > >, vec_adj_list_vertex_id_map >, long unsigned int>, std::vector, std::allocator > >, std::vector, std::allocator > >&>; DistanceMap = iterator_property_map<__gnu_cxx::__normal_iterator > >, vec_adj_list_vertex_id_map >, long unsigned int>, double, double&>; DependencyMap = iterator_property_map<__gnu_cxx::__normal_iterator > >, vec_adj_list_vertex_id_map >, long unsigned int>, double, double&>; PathCountMap = iterator_property_map<__gnu_cxx::__normal_iterator > >, vec_adj_list_vertex_id_map >, long unsigned int>, long unsigned int, long unsigned int&>; VertexIndexMap = vec_adj_list_vertex_id_map >, long unsigned int>; WeightMap = adj_list_edge_property_map >, edge_weight_t>; typename enable_if_c::traversal_category>::value, graph::detail::no_parameter>::type = graph::detail::no_parameter; typename graph_traits::traversal_category = undir_adj_list_traversal_tag]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/betweenness_centrality.hpp:468:43: required from ‘void boost::detail::graph::brandes_betweenness_centrality_dispatch2(const Graph&, CentralityMap, EdgeCentralityMap, WeightMap, VertexIndexMap) [with Graph = boost::adjacency_list >, boost::property > >; CentralityMap = boost::vec_adj_list_vertex_property_map >, boost::property > >, boost::adjacency_list >, boost::property > >*, double, double&, boost::vertex_centrality_t>; EdgeCentralityMap = boost::adj_list_edge_property_map >, boost::edge_centrality_t>; WeightMap = boost::adj_list_edge_property_map >, boost::edge_weight_t>; VertexIndexMap = boost::vec_adj_list_vertex_id_map >, long unsigned int>]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/betweenness_centrality.hpp:517:57: required from ‘static void boost::detail::graph::brandes_betweenness_centrality_dispatch1::run(const Graph&, CentralityMap, EdgeCentralityMap, VertexIndexMap, WeightMap) [with Graph = boost::adjacency_list >, boost::property > >; CentralityMap = boost::vec_adj_list_vertex_property_map >, boost::property > >, boost::adjacency_list >, boost::property > >*, double, double&, boost::vertex_centrality_t>; EdgeCentralityMap = boost::adj_list_edge_property_map >, boost::edge_centrality_t>; VertexIndexMap = boost::vec_adj_list_vertex_id_map >, long unsigned int>; WeightMap = boost::adj_list_edge_property_map >, boost::edge_weight_t>]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/betweenness_centrality.hpp:558:71: required from ‘void boost::brandes_betweenness_centrality(const Graph&, const bgl_named_params&, typename enable_if_c::traversal_category>::value, graph::detail::no_parameter>::type) [with Graph = adjacency_list >, property > >; Param = adj_list_edge_property_map >, edge_weight_t>; Tag = edge_weight_t; Rest = bgl_named_params >, edge_centrality_t>, edge_centrality_t, bgl_named_params >, property > >, adjacency_list >, property > >*, double, double&, vertex_centrality_t>, vertex_centrality_t, no_property> >; typename enable_if_c::traversal_category>::value, graph::detail::no_parameter>::type = graph::detail::no_parameter; typename graph_traits::traversal_category = undir_adj_list_traversal_tag]’ bbc.cpp:67:33: required from here /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::InputIterator::~InputIterator() [with TT = long unsigned int*]’ 37 | ~model() | ^ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:512:7: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 512 | BOOST_CONCEPT_USAGE(InputIterator) | ^~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::ForwardIterator]’: /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements >]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:543:7: required from ‘struct boost::ForwardIterator’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:568:3: required from ‘struct boost::BidirectionalIterator’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:597:3: required from ‘struct boost::RandomAccessIterator’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:597:3: required from ‘struct boost::RandomAccessIteratorConcept’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:32:62: [ skipping 16 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/betweenness_centrality.hpp:349:31: required from ‘void boost::detail::graph::brandes_betweenness_centrality_impl(const Graph&, CentralityMap, EdgeCentralityMap, IncomingMap, DistanceMap, DependencyMap, PathCountMap, VertexIndexMap, ShortestPaths) [with Graph = boost::adjacency_list >, boost::property > >; CentralityMap = boost::vec_adj_list_vertex_property_map >, boost::property > >, boost::adjacency_list >, boost::property > >*, double, double&, boost::vertex_centrality_t>; EdgeCentralityMap = boost::adj_list_edge_property_map >, boost::edge_centrality_t>; IncomingMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator, std::allocator > >*, std::vector, std::allocator > >, std::allocator, std::allocator > > > > >, boost::vec_adj_list_vertex_id_map >, long unsigned int>, std::vector, std::allocator > >, std::vector, std::allocator > >&>; DistanceMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator > >, boost::vec_adj_list_vertex_id_map >, long unsigned int>, double, double&>; DependencyMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator > >, boost::vec_adj_list_vertex_id_map >, long unsigned int>, double, double&>; PathCountMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator > >, boost::vec_adj_list_vertex_id_map >, long unsigned int>, long unsigned int, long unsigned int&>; VertexIndexMap = boost::vec_adj_list_vertex_id_map >, long unsigned int>; ShortestPaths = brandes_dijkstra_shortest_paths >, boost::edge_weight_t> >]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/betweenness_centrality.hpp:434:55: required from ‘void boost::brandes_betweenness_centrality(const Graph&, CentralityMap, EdgeCentralityMap, IncomingMap, DistanceMap, DependencyMap, PathCountMap, VertexIndexMap, WeightMap, typename enable_if_c::traversal_category>::value, graph::detail::no_parameter>::type) [with Graph = adjacency_list >, property > >; CentralityMap = vec_adj_list_vertex_property_map >, property > >, adjacency_list >, property > >*, double, double&, vertex_centrality_t>; EdgeCentralityMap = adj_list_edge_property_map >, edge_centrality_t>; IncomingMap = iterator_property_map<__gnu_cxx::__normal_iterator, std::allocator > >*, std::vector, std::allocator > >, std::allocator, std::allocator > > > > >, vec_adj_list_vertex_id_map >, long unsigned int>, std::vector, std::allocator > >, std::vector, std::allocator > >&>; DistanceMap = iterator_property_map<__gnu_cxx::__normal_iterator > >, vec_adj_list_vertex_id_map >, long unsigned int>, double, double&>; DependencyMap = iterator_property_map<__gnu_cxx::__normal_iterator > >, vec_adj_list_vertex_id_map >, long unsigned int>, double, double&>; PathCountMap = iterator_property_map<__gnu_cxx::__normal_iterator > >, vec_adj_list_vertex_id_map >, long unsigned int>, long unsigned int, long unsigned int&>; VertexIndexMap = vec_adj_list_vertex_id_map >, long unsigned int>; WeightMap = adj_list_edge_property_map >, edge_weight_t>; typename enable_if_c::traversal_category>::value, graph::detail::no_parameter>::type = graph::detail::no_parameter; typename graph_traits::traversal_category = undir_adj_list_traversal_tag]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/betweenness_centrality.hpp:468:43: required from ‘void boost::detail::graph::brandes_betweenness_centrality_dispatch2(const Graph&, CentralityMap, EdgeCentralityMap, WeightMap, VertexIndexMap) [with Graph = boost::adjacency_list >, boost::property > >; CentralityMap = boost::vec_adj_list_vertex_property_map >, boost::property > >, boost::adjacency_list >, boost::property > >*, double, double&, boost::vertex_centrality_t>; EdgeCentralityMap = boost::adj_list_edge_property_map >, boost::edge_centrality_t>; WeightMap = boost::adj_list_edge_property_map >, boost::edge_weight_t>; VertexIndexMap = boost::vec_adj_list_vertex_id_map >, long unsigned int>]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/betweenness_centrality.hpp:517:57: required from ‘static void boost::detail::graph::brandes_betweenness_centrality_dispatch1::run(const Graph&, CentralityMap, EdgeCentralityMap, VertexIndexMap, WeightMap) [with Graph = boost::adjacency_list >, boost::property > >; CentralityMap = boost::vec_adj_list_vertex_property_map >, boost::property > >, boost::adjacency_list >, boost::property > >*, double, double&, boost::vertex_centrality_t>; EdgeCentralityMap = boost::adj_list_edge_property_map >, boost::edge_centrality_t>; VertexIndexMap = boost::vec_adj_list_vertex_id_map >, long unsigned int>; WeightMap = boost::adj_list_edge_property_map >, boost::edge_weight_t>]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/betweenness_centrality.hpp:558:71: required from ‘void boost::brandes_betweenness_centrality(const Graph&, const bgl_named_params&, typename enable_if_c::traversal_category>::value, graph::detail::no_parameter>::type) [with Graph = adjacency_list >, property > >; Param = adj_list_edge_property_map >, edge_weight_t>; Tag = edge_weight_t; Rest = bgl_named_params >, edge_centrality_t>, edge_centrality_t, bgl_named_params >, property > >, adjacency_list >, property > >*, double, double&, vertex_centrality_t>, vertex_centrality_t, no_property> >; typename enable_if_c::traversal_category>::value, graph::detail::no_parameter>::type = graph::detail::no_parameter; typename graph_traits::traversal_category = undir_adj_list_traversal_tag]’ bbc.cpp:67:33: required from here /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::ForwardIterator::~ForwardIterator() [with TT = long unsigned int*]’ 37 | ~model() | ^ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:543:7: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 543 | BOOST_CONCEPT_USAGE(ForwardIterator) | ^~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::BidirectionalIterator]’: /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements >]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:571:7: required from ‘struct boost::BidirectionalIterator’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:597:3: required from ‘struct boost::RandomAccessIterator’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:597:3: required from ‘struct boost::RandomAccessIteratorConcept’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::RandomAccessIteratorConcept]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:42:5: [ skipping 15 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/betweenness_centrality.hpp:349:31: required from ‘void boost::detail::graph::brandes_betweenness_centrality_impl(const Graph&, CentralityMap, EdgeCentralityMap, IncomingMap, DistanceMap, DependencyMap, PathCountMap, VertexIndexMap, ShortestPaths) [with Graph = boost::adjacency_list >, boost::property > >; CentralityMap = boost::vec_adj_list_vertex_property_map >, boost::property > >, boost::adjacency_list >, boost::property > >*, double, double&, boost::vertex_centrality_t>; EdgeCentralityMap = boost::adj_list_edge_property_map >, boost::edge_centrality_t>; IncomingMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator, std::allocator > >*, std::vector, std::allocator > >, std::allocator, std::allocator > > > > >, boost::vec_adj_list_vertex_id_map >, long unsigned int>, std::vector, std::allocator > >, std::vector, std::allocator > >&>; DistanceMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator > >, boost::vec_adj_list_vertex_id_map >, long unsigned int>, double, double&>; DependencyMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator > >, boost::vec_adj_list_vertex_id_map >, long unsigned int>, double, double&>; PathCountMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator > >, boost::vec_adj_list_vertex_id_map >, long unsigned int>, long unsigned int, long unsigned int&>; VertexIndexMap = boost::vec_adj_list_vertex_id_map >, long unsigned int>; ShortestPaths = brandes_dijkstra_shortest_paths >, boost::edge_weight_t> >]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/betweenness_centrality.hpp:434:55: required from ‘void boost::brandes_betweenness_centrality(const Graph&, CentralityMap, EdgeCentralityMap, IncomingMap, DistanceMap, DependencyMap, PathCountMap, VertexIndexMap, WeightMap, typename enable_if_c::traversal_category>::value, graph::detail::no_parameter>::type) [with Graph = adjacency_list >, property > >; CentralityMap = vec_adj_list_vertex_property_map >, property > >, adjacency_list >, property > >*, double, double&, vertex_centrality_t>; EdgeCentralityMap = adj_list_edge_property_map >, edge_centrality_t>; IncomingMap = iterator_property_map<__gnu_cxx::__normal_iterator, std::allocator > >*, std::vector, std::allocator > >, std::allocator, std::allocator > > > > >, vec_adj_list_vertex_id_map >, long unsigned int>, std::vector, std::allocator > >, std::vector, std::allocator > >&>; DistanceMap = iterator_property_map<__gnu_cxx::__normal_iterator > >, vec_adj_list_vertex_id_map >, long unsigned int>, double, double&>; DependencyMap = iterator_property_map<__gnu_cxx::__normal_iterator > >, vec_adj_list_vertex_id_map >, long unsigned int>, double, double&>; PathCountMap = iterator_property_map<__gnu_cxx::__normal_iterator > >, vec_adj_list_vertex_id_map >, long unsigned int>, long unsigned int, long unsigned int&>; VertexIndexMap = vec_adj_list_vertex_id_map >, long unsigned int>; WeightMap = adj_list_edge_property_map >, edge_weight_t>; typename enable_if_c::traversal_category>::value, graph::detail::no_parameter>::type = graph::detail::no_parameter; typename graph_traits::traversal_category = undir_adj_list_traversal_tag]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/betweenness_centrality.hpp:468:43: required from ‘void boost::detail::graph::brandes_betweenness_centrality_dispatch2(const Graph&, CentralityMap, EdgeCentralityMap, WeightMap, VertexIndexMap) [with Graph = boost::adjacency_list >, boost::property > >; CentralityMap = boost::vec_adj_list_vertex_property_map >, boost::property > >, boost::adjacency_list >, boost::property > >*, double, double&, boost::vertex_centrality_t>; EdgeCentralityMap = boost::adj_list_edge_property_map >, boost::edge_centrality_t>; WeightMap = boost::adj_list_edge_property_map >, boost::edge_weight_t>; VertexIndexMap = boost::vec_adj_list_vertex_id_map >, long unsigned int>]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/betweenness_centrality.hpp:517:57: required from ‘static void boost::detail::graph::brandes_betweenness_centrality_dispatch1::run(const Graph&, CentralityMap, EdgeCentralityMap, VertexIndexMap, WeightMap) [with Graph = boost::adjacency_list >, boost::property > >; CentralityMap = boost::vec_adj_list_vertex_property_map >, boost::property > >, boost::adjacency_list >, boost::property > >*, double, double&, boost::vertex_centrality_t>; EdgeCentralityMap = boost::adj_list_edge_property_map >, boost::edge_centrality_t>; VertexIndexMap = boost::vec_adj_list_vertex_id_map >, long unsigned int>; WeightMap = boost::adj_list_edge_property_map >, boost::edge_weight_t>]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/betweenness_centrality.hpp:558:71: required from ‘void boost::brandes_betweenness_centrality(const Graph&, const bgl_named_params&, typename enable_if_c::traversal_category>::value, graph::detail::no_parameter>::type) [with Graph = adjacency_list >, property > >; Param = adj_list_edge_property_map >, edge_weight_t>; Tag = edge_weight_t; Rest = bgl_named_params >, edge_centrality_t>, edge_centrality_t, bgl_named_params >, property > >, adjacency_list >, property > >*, double, double&, vertex_centrality_t>, vertex_centrality_t, no_property> >; typename enable_if_c::traversal_category>::value, graph::detail::no_parameter>::type = graph::detail::no_parameter; typename graph_traits::traversal_category = undir_adj_list_traversal_tag]’ bbc.cpp:67:33: required from here /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::BidirectionalIterator::~BidirectionalIterator() [with TT = long unsigned int*]’ 37 | ~model() | ^ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:571:7: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 571 | BOOST_CONCEPT_USAGE(BidirectionalIterator) | ^~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::Comparable]’: /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements >]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:253:5: required from ‘struct boost::Comparable’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:597:3: required from ‘struct boost::RandomAccessIterator’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:597:3: required from ‘struct boost::RandomAccessIteratorConcept’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::RandomAccessIteratorConcept]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:42:5: [ skipping 15 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/betweenness_centrality.hpp:349:31: required from ‘void boost::detail::graph::brandes_betweenness_centrality_impl(const Graph&, CentralityMap, EdgeCentralityMap, IncomingMap, DistanceMap, DependencyMap, PathCountMap, VertexIndexMap, ShortestPaths) [with Graph = boost::adjacency_list >, boost::property > >; CentralityMap = boost::vec_adj_list_vertex_property_map >, boost::property > >, boost::adjacency_list >, boost::property > >*, double, double&, boost::vertex_centrality_t>; EdgeCentralityMap = boost::adj_list_edge_property_map >, boost::edge_centrality_t>; IncomingMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator, std::allocator > >*, std::vector, std::allocator > >, std::allocator, std::allocator > > > > >, boost::vec_adj_list_vertex_id_map >, long unsigned int>, std::vector, std::allocator > >, std::vector, std::allocator > >&>; DistanceMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator > >, boost::vec_adj_list_vertex_id_map >, long unsigned int>, double, double&>; DependencyMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator > >, boost::vec_adj_list_vertex_id_map >, long unsigned int>, double, double&>; PathCountMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator > >, boost::vec_adj_list_vertex_id_map >, long unsigned int>, long unsigned int, long unsigned int&>; VertexIndexMap = boost::vec_adj_list_vertex_id_map >, long unsigned int>; ShortestPaths = brandes_dijkstra_shortest_paths >, boost::edge_weight_t> >]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/betweenness_centrality.hpp:434:55: required from ‘void boost::brandes_betweenness_centrality(const Graph&, CentralityMap, EdgeCentralityMap, IncomingMap, DistanceMap, DependencyMap, PathCountMap, VertexIndexMap, WeightMap, typename enable_if_c::traversal_category>::value, graph::detail::no_parameter>::type) [with Graph = adjacency_list >, property > >; CentralityMap = vec_adj_list_vertex_property_map >, property > >, adjacency_list >, property > >*, double, double&, vertex_centrality_t>; EdgeCentralityMap = adj_list_edge_property_map >, edge_centrality_t>; IncomingMap = iterator_property_map<__gnu_cxx::__normal_iterator, std::allocator > >*, std::vector, std::allocator > >, std::allocator, std::allocator > > > > >, vec_adj_list_vertex_id_map >, long unsigned int>, std::vector, std::allocator > >, std::vector, std::allocator > >&>; DistanceMap = iterator_property_map<__gnu_cxx::__normal_iterator > >, vec_adj_list_vertex_id_map >, long unsigned int>, double, double&>; DependencyMap = iterator_property_map<__gnu_cxx::__normal_iterator > >, vec_adj_list_vertex_id_map >, long unsigned int>, double, double&>; PathCountMap = iterator_property_map<__gnu_cxx::__normal_iterator > >, vec_adj_list_vertex_id_map >, long unsigned int>, long unsigned int, long unsigned int&>; VertexIndexMap = vec_adj_list_vertex_id_map >, long unsigned int>; WeightMap = adj_list_edge_property_map >, edge_weight_t>; typename enable_if_c::traversal_category>::value, graph::detail::no_parameter>::type = graph::detail::no_parameter; typename graph_traits::traversal_category = undir_adj_list_traversal_tag]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/betweenness_centrality.hpp:468:43: required from ‘void boost::detail::graph::brandes_betweenness_centrality_dispatch2(const Graph&, CentralityMap, EdgeCentralityMap, WeightMap, VertexIndexMap) [with Graph = boost::adjacency_list >, boost::property > >; CentralityMap = boost::vec_adj_list_vertex_property_map >, boost::property > >, boost::adjacency_list >, boost::property > >*, double, double&, boost::vertex_centrality_t>; EdgeCentralityMap = boost::adj_list_edge_property_map >, boost::edge_centrality_t>; WeightMap = boost::adj_list_edge_property_map >, boost::edge_weight_t>; VertexIndexMap = boost::vec_adj_list_vertex_id_map >, long unsigned int>]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/betweenness_centrality.hpp:517:57: required from ‘static void boost::detail::graph::brandes_betweenness_centrality_dispatch1::run(const Graph&, CentralityMap, EdgeCentralityMap, VertexIndexMap, WeightMap) [with Graph = boost::adjacency_list >, boost::property > >; CentralityMap = boost::vec_adj_list_vertex_property_map >, boost::property > >, boost::adjacency_list >, boost::property > >*, double, double&, boost::vertex_centrality_t>; EdgeCentralityMap = boost::adj_list_edge_property_map >, boost::edge_centrality_t>; VertexIndexMap = boost::vec_adj_list_vertex_id_map >, long unsigned int>; WeightMap = boost::adj_list_edge_property_map >, boost::edge_weight_t>]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/betweenness_centrality.hpp:558:71: required from ‘void boost::brandes_betweenness_centrality(const Graph&, const bgl_named_params&, typename enable_if_c::traversal_category>::value, graph::detail::no_parameter>::type) [with Graph = adjacency_list >, property > >; Param = adj_list_edge_property_map >, edge_weight_t>; Tag = edge_weight_t; Rest = bgl_named_params >, edge_centrality_t>, edge_centrality_t, bgl_named_params >, property > >, adjacency_list >, property > >*, double, double&, vertex_centrality_t>, vertex_centrality_t, no_property> >; typename enable_if_c::traversal_category>::value, graph::detail::no_parameter>::type = graph::detail::no_parameter; typename graph_traits::traversal_category = undir_adj_list_traversal_tag]’ bbc.cpp:67:33: required from here /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::Comparable::~Comparable() [with TT = long unsigned int*]’ 37 | ~model() | ^ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:253:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 253 | BOOST_CONCEPT_USAGE(Comparable) { | ^~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::RandomAccessIterator]’: /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements >]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:601:7: required from ‘struct boost::RandomAccessIterator’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:597:3: required from ‘struct boost::RandomAccessIteratorConcept’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::RandomAccessIteratorConcept]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied >::value’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:45:51: [ skipping 14 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/betweenness_centrality.hpp:349:31: required from ‘void boost::detail::graph::brandes_betweenness_centrality_impl(const Graph&, CentralityMap, EdgeCentralityMap, IncomingMap, DistanceMap, DependencyMap, PathCountMap, VertexIndexMap, ShortestPaths) [with Graph = boost::adjacency_list >, boost::property > >; CentralityMap = boost::vec_adj_list_vertex_property_map >, boost::property > >, boost::adjacency_list >, boost::property > >*, double, double&, boost::vertex_centrality_t>; EdgeCentralityMap = boost::adj_list_edge_property_map >, boost::edge_centrality_t>; IncomingMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator, std::allocator > >*, std::vector, std::allocator > >, std::allocator, std::allocator > > > > >, boost::vec_adj_list_vertex_id_map >, long unsigned int>, std::vector, std::allocator > >, std::vector, std::allocator > >&>; DistanceMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator > >, boost::vec_adj_list_vertex_id_map >, long unsigned int>, double, double&>; DependencyMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator > >, boost::vec_adj_list_vertex_id_map >, long unsigned int>, double, double&>; PathCountMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator > >, boost::vec_adj_list_vertex_id_map >, long unsigned int>, long unsigned int, long unsigned int&>; VertexIndexMap = boost::vec_adj_list_vertex_id_map >, long unsigned int>; ShortestPaths = brandes_dijkstra_shortest_paths >, boost::edge_weight_t> >]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/betweenness_centrality.hpp:434:55: required from ‘void boost::brandes_betweenness_centrality(const Graph&, CentralityMap, EdgeCentralityMap, IncomingMap, DistanceMap, DependencyMap, PathCountMap, VertexIndexMap, WeightMap, typename enable_if_c::traversal_category>::value, graph::detail::no_parameter>::type) [with Graph = adjacency_list >, property > >; CentralityMap = vec_adj_list_vertex_property_map >, property > >, adjacency_list >, property > >*, double, double&, vertex_centrality_t>; EdgeCentralityMap = adj_list_edge_property_map >, edge_centrality_t>; IncomingMap = iterator_property_map<__gnu_cxx::__normal_iterator, std::allocator > >*, std::vector, std::allocator > >, std::allocator, std::allocator > > > > >, vec_adj_list_vertex_id_map >, long unsigned int>, std::vector, std::allocator > >, std::vector, std::allocator > >&>; DistanceMap = iterator_property_map<__gnu_cxx::__normal_iterator > >, vec_adj_list_vertex_id_map >, long unsigned int>, double, double&>; DependencyMap = iterator_property_map<__gnu_cxx::__normal_iterator > >, vec_adj_list_vertex_id_map >, long unsigned int>, double, double&>; PathCountMap = iterator_property_map<__gnu_cxx::__normal_iterator > >, vec_adj_list_vertex_id_map >, long unsigned int>, long unsigned int, long unsigned int&>; VertexIndexMap = vec_adj_list_vertex_id_map >, long unsigned int>; WeightMap = adj_list_edge_property_map >, edge_weight_t>; typename enable_if_c::traversal_category>::value, graph::detail::no_parameter>::type = graph::detail::no_parameter; typename graph_traits::traversal_category = undir_adj_list_traversal_tag]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/betweenness_centrality.hpp:468:43: required from ‘void boost::detail::graph::brandes_betweenness_centrality_dispatch2(const Graph&, CentralityMap, EdgeCentralityMap, WeightMap, VertexIndexMap) [with Graph = boost::adjacency_list >, boost::property > >; CentralityMap = boost::vec_adj_list_vertex_property_map >, boost::property > >, boost::adjacency_list >, boost::property > >*, double, double&, boost::vertex_centrality_t>; EdgeCentralityMap = boost::adj_list_edge_property_map >, boost::edge_centrality_t>; WeightMap = boost::adj_list_edge_property_map >, boost::edge_weight_t>; VertexIndexMap = boost::vec_adj_list_vertex_id_map >, long unsigned int>]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/betweenness_centrality.hpp:517:57: required from ‘static void boost::detail::graph::brandes_betweenness_centrality_dispatch1::run(const Graph&, CentralityMap, EdgeCentralityMap, VertexIndexMap, WeightMap) [with Graph = boost::adjacency_list >, boost::property > >; CentralityMap = boost::vec_adj_list_vertex_property_map >, boost::property > >, boost::adjacency_list >, boost::property > >*, double, double&, boost::vertex_centrality_t>; EdgeCentralityMap = boost::adj_list_edge_property_map >, boost::edge_centrality_t>; VertexIndexMap = boost::vec_adj_list_vertex_id_map >, long unsigned int>; WeightMap = boost::adj_list_edge_property_map >, boost::edge_weight_t>]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/betweenness_centrality.hpp:558:71: required from ‘void boost::brandes_betweenness_centrality(const Graph&, const bgl_named_params&, typename enable_if_c::traversal_category>::value, graph::detail::no_parameter>::type) [with Graph = adjacency_list >, property > >; Param = adj_list_edge_property_map >, edge_weight_t>; Tag = edge_weight_t; Rest = bgl_named_params >, edge_centrality_t>, edge_centrality_t, bgl_named_params >, property > >, adjacency_list >, property > >*, double, double&, vertex_centrality_t>, vertex_centrality_t, no_property> >; typename enable_if_c::traversal_category>::value, graph::detail::no_parameter>::type = graph::detail::no_parameter; typename graph_traits::traversal_category = undir_adj_list_traversal_tag]’ bbc.cpp:67:33: required from here /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::RandomAccessIterator::~RandomAccessIterator() [with TT = long unsigned int*]’ 37 | ~model() | ^ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:601:7: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 601 | BOOST_CONCEPT_USAGE(RandomAccessIterator) | ^~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::Convertible]’: /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements >]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:208:5: required from ‘struct boost::Convertible’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:206:3: required from ‘struct boost::ConvertibleConcept’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::ConvertibleConcept]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied >::value’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:45:51: [ skipping 22 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/betweenness_centrality.hpp:349:31: required from ‘void boost::detail::graph::brandes_betweenness_centrality_impl(const Graph&, CentralityMap, EdgeCentralityMap, IncomingMap, DistanceMap, DependencyMap, PathCountMap, VertexIndexMap, ShortestPaths) [with Graph = boost::adjacency_list >, boost::property > >; CentralityMap = boost::vec_adj_list_vertex_property_map >, boost::property > >, boost::adjacency_list >, boost::property > >*, double, double&, boost::vertex_centrality_t>; EdgeCentralityMap = boost::adj_list_edge_property_map >, boost::edge_centrality_t>; IncomingMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator, std::allocator > >*, std::vector, std::allocator > >, std::allocator, std::allocator > > > > >, boost::vec_adj_list_vertex_id_map >, long unsigned int>, std::vector, std::allocator > >, std::vector, std::allocator > >&>; DistanceMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator > >, boost::vec_adj_list_vertex_id_map >, long unsigned int>, double, double&>; DependencyMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator > >, boost::vec_adj_list_vertex_id_map >, long unsigned int>, double, double&>; PathCountMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator > >, boost::vec_adj_list_vertex_id_map >, long unsigned int>, long unsigned int, long unsigned int&>; VertexIndexMap = boost::vec_adj_list_vertex_id_map >, long unsigned int>; ShortestPaths = brandes_dijkstra_shortest_paths >, boost::edge_weight_t> >]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/betweenness_centrality.hpp:434:55: required from ‘void boost::brandes_betweenness_centrality(const Graph&, CentralityMap, EdgeCentralityMap, IncomingMap, DistanceMap, DependencyMap, PathCountMap, VertexIndexMap, WeightMap, typename enable_if_c::traversal_category>::value, graph::detail::no_parameter>::type) [with Graph = adjacency_list >, property > >; CentralityMap = vec_adj_list_vertex_property_map >, property > >, adjacency_list >, property > >*, double, double&, vertex_centrality_t>; EdgeCentralityMap = adj_list_edge_property_map >, edge_centrality_t>; IncomingMap = iterator_property_map<__gnu_cxx::__normal_iterator, std::allocator > >*, std::vector, std::allocator > >, std::allocator, std::allocator > > > > >, vec_adj_list_vertex_id_map >, long unsigned int>, std::vector, std::allocator > >, std::vector, std::allocator > >&>; DistanceMap = iterator_property_map<__gnu_cxx::__normal_iterator > >, vec_adj_list_vertex_id_map >, long unsigned int>, double, double&>; DependencyMap = iterator_property_map<__gnu_cxx::__normal_iterator > >, vec_adj_list_vertex_id_map >, long unsigned int>, double, double&>; PathCountMap = iterator_property_map<__gnu_cxx::__normal_iterator > >, vec_adj_list_vertex_id_map >, long unsigned int>, long unsigned int, long unsigned int&>; VertexIndexMap = vec_adj_list_vertex_id_map >, long unsigned int>; WeightMap = adj_list_edge_property_map >, edge_weight_t>; typename enable_if_c::traversal_category>::value, graph::detail::no_parameter>::type = graph::detail::no_parameter; typename graph_traits::traversal_category = undir_adj_list_traversal_tag]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/betweenness_centrality.hpp:468:43: required from ‘void boost::detail::graph::brandes_betweenness_centrality_dispatch2(const Graph&, CentralityMap, EdgeCentralityMap, WeightMap, VertexIndexMap) [with Graph = boost::adjacency_list >, boost::property > >; CentralityMap = boost::vec_adj_list_vertex_property_map >, boost::property > >, boost::adjacency_list >, boost::property > >*, double, double&, boost::vertex_centrality_t>; EdgeCentralityMap = boost::adj_list_edge_property_map >, boost::edge_centrality_t>; WeightMap = boost::adj_list_edge_property_map >, boost::edge_weight_t>; VertexIndexMap = boost::vec_adj_list_vertex_id_map >, long unsigned int>]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/betweenness_centrality.hpp:517:57: required from ‘static void boost::detail::graph::brandes_betweenness_centrality_dispatch1::run(const Graph&, CentralityMap, EdgeCentralityMap, VertexIndexMap, WeightMap) [with Graph = boost::adjacency_list >, boost::property > >; CentralityMap = boost::vec_adj_list_vertex_property_map >, boost::property > >, boost::adjacency_list >, boost::property > >*, double, double&, boost::vertex_centrality_t>; EdgeCentralityMap = boost::adj_list_edge_property_map >, boost::edge_centrality_t>; VertexIndexMap = boost::vec_adj_list_vertex_id_map >, long unsigned int>; WeightMap = boost::adj_list_edge_property_map >, boost::edge_weight_t>]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/betweenness_centrality.hpp:558:71: required from ‘void boost::brandes_betweenness_centrality(const Graph&, const bgl_named_params&, typename enable_if_c::traversal_category>::value, graph::detail::no_parameter>::type) [with Graph = adjacency_list >, property > >; Param = adj_list_edge_property_map >, edge_weight_t>; Tag = edge_weight_t; Rest = bgl_named_params >, edge_centrality_t>, edge_centrality_t, bgl_named_params >, property > >, adjacency_list >, property > >*, double, double&, vertex_centrality_t>, vertex_centrality_t, no_property> >; typename enable_if_c::traversal_category>::value, graph::detail::no_parameter>::type = graph::detail::no_parameter; typename graph_traits::traversal_category = undir_adj_list_traversal_tag]’ bbc.cpp:67:33: required from here /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::Convertible::~Convertible() [with X = boost::read_write_property_map_tag; Y = boost::readable_property_map_tag]’ 37 | ~model() | ^ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:208:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 208 | BOOST_CONCEPT_USAGE(Convertible) { | ^~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::Convertible]’: /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements >]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:208:5: required from ‘struct boost::Convertible’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:206:3: required from ‘struct boost::ConvertibleConcept’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::ConvertibleConcept]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied >::value’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:45:51: [ skipping 22 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/betweenness_centrality.hpp:349:31: required from ‘void boost::detail::graph::brandes_betweenness_centrality_impl(const Graph&, CentralityMap, EdgeCentralityMap, IncomingMap, DistanceMap, DependencyMap, PathCountMap, VertexIndexMap, ShortestPaths) [with Graph = boost::adjacency_list >, boost::property > >; CentralityMap = boost::vec_adj_list_vertex_property_map >, boost::property > >, boost::adjacency_list >, boost::property > >*, double, double&, boost::vertex_centrality_t>; EdgeCentralityMap = boost::adj_list_edge_property_map >, boost::edge_centrality_t>; IncomingMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator, std::allocator > >*, std::vector, std::allocator > >, std::allocator, std::allocator > > > > >, boost::vec_adj_list_vertex_id_map >, long unsigned int>, std::vector, std::allocator > >, std::vector, std::allocator > >&>; DistanceMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator > >, boost::vec_adj_list_vertex_id_map >, long unsigned int>, double, double&>; DependencyMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator > >, boost::vec_adj_list_vertex_id_map >, long unsigned int>, double, double&>; PathCountMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator > >, boost::vec_adj_list_vertex_id_map >, long unsigned int>, long unsigned int, long unsigned int&>; VertexIndexMap = boost::vec_adj_list_vertex_id_map >, long unsigned int>; ShortestPaths = brandes_dijkstra_shortest_paths >, boost::edge_weight_t> >]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/betweenness_centrality.hpp:434:55: required from ‘void boost::brandes_betweenness_centrality(const Graph&, CentralityMap, EdgeCentralityMap, IncomingMap, DistanceMap, DependencyMap, PathCountMap, VertexIndexMap, WeightMap, typename enable_if_c::traversal_category>::value, graph::detail::no_parameter>::type) [with Graph = adjacency_list >, property > >; CentralityMap = vec_adj_list_vertex_property_map >, property > >, adjacency_list >, property > >*, double, double&, vertex_centrality_t>; EdgeCentralityMap = adj_list_edge_property_map >, edge_centrality_t>; IncomingMap = iterator_property_map<__gnu_cxx::__normal_iterator, std::allocator > >*, std::vector, std::allocator > >, std::allocator, std::allocator > > > > >, vec_adj_list_vertex_id_map >, long unsigned int>, std::vector, std::allocator > >, std::vector, std::allocator > >&>; DistanceMap = iterator_property_map<__gnu_cxx::__normal_iterator > >, vec_adj_list_vertex_id_map >, long unsigned int>, double, double&>; DependencyMap = iterator_property_map<__gnu_cxx::__normal_iterator > >, vec_adj_list_vertex_id_map >, long unsigned int>, double, double&>; PathCountMap = iterator_property_map<__gnu_cxx::__normal_iterator > >, vec_adj_list_vertex_id_map >, long unsigned int>, long unsigned int, long unsigned int&>; VertexIndexMap = vec_adj_list_vertex_id_map >, long unsigned int>; WeightMap = adj_list_edge_property_map >, edge_weight_t>; typename enable_if_c::traversal_category>::value, graph::detail::no_parameter>::type = graph::detail::no_parameter; typename graph_traits::traversal_category = undir_adj_list_traversal_tag]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/betweenness_centrality.hpp:468:43: required from ‘void boost::detail::graph::brandes_betweenness_centrality_dispatch2(const Graph&, CentralityMap, EdgeCentralityMap, WeightMap, VertexIndexMap) [with Graph = boost::adjacency_list >, boost::property > >; CentralityMap = boost::vec_adj_list_vertex_property_map >, boost::property > >, boost::adjacency_list >, boost::property > >*, double, double&, boost::vertex_centrality_t>; EdgeCentralityMap = boost::adj_list_edge_property_map >, boost::edge_centrality_t>; WeightMap = boost::adj_list_edge_property_map >, boost::edge_weight_t>; VertexIndexMap = boost::vec_adj_list_vertex_id_map >, long unsigned int>]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/betweenness_centrality.hpp:517:57: required from ‘static void boost::detail::graph::brandes_betweenness_centrality_dispatch1::run(const Graph&, CentralityMap, EdgeCentralityMap, VertexIndexMap, WeightMap) [with Graph = boost::adjacency_list >, boost::property > >; CentralityMap = boost::vec_adj_list_vertex_property_map >, boost::property > >, boost::adjacency_list >, boost::property > >*, double, double&, boost::vertex_centrality_t>; EdgeCentralityMap = boost::adj_list_edge_property_map >, boost::edge_centrality_t>; VertexIndexMap = boost::vec_adj_list_vertex_id_map >, long unsigned int>; WeightMap = boost::adj_list_edge_property_map >, boost::edge_weight_t>]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/betweenness_centrality.hpp:558:71: required from ‘void boost::brandes_betweenness_centrality(const Graph&, const bgl_named_params&, typename enable_if_c::traversal_category>::value, graph::detail::no_parameter>::type) [with Graph = adjacency_list >, property > >; Param = adj_list_edge_property_map >, edge_weight_t>; Tag = edge_weight_t; Rest = bgl_named_params >, edge_centrality_t>, edge_centrality_t, bgl_named_params >, property > >, adjacency_list >, property > >*, double, double&, vertex_centrality_t>, vertex_centrality_t, no_property> >; typename enable_if_c::traversal_category>::value, graph::detail::no_parameter>::type = graph::detail::no_parameter; typename graph_traits::traversal_category = undir_adj_list_traversal_tag]’ bbc.cpp:67:33: required from here /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::Convertible::~Convertible() [with X = boost::read_write_property_map_tag; Y = boost::writable_property_map_tag]’ 37 | ~model() | ^ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:208:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 208 | BOOST_CONCEPT_USAGE(Convertible) { | ^~~~~~~~~~~~~~~~~~~ g++ -std=gnu++17 -I"/usr/share/R/include" -DNDEBUG -I'/home/omnipath/local/R/4.4-3.20/BH/include' -fpic -g -O2 -fno-omit-frame-pointer -mno-omit-leaf-frame-pointer -ffile-prefix-map=/build/r-base-EawLoD/r-base-4.4.1=. -fstack-protector-strong -fstack-clash-protection -Wformat -Werror=format-security -fcf-protection -fdebug-prefix-map=/build/r-base-EawLoD/r-base-4.4.1=/usr/src/r-base-4.4.1-1.2404.0 -Wdate-time -D_FORTIFY_SOURCE=3 -c cliques.cpp -o cliques.o In file included from /home/omnipath/local/R/4.4-3.20/BH/include/boost/smart_ptr/shared_ptr.hpp:18, from /home/omnipath/local/R/4.4-3.20/BH/include/boost/property_map/vector_property_map.hpp:14, from /home/omnipath/local/R/4.4-3.20/BH/include/boost/property_map/property_map.hpp:598, from RBGL.hpp:17, from cliques.cpp:1: /home/omnipath/local/R/4.4-3.20/BH/include/boost/smart_ptr/detail/shared_count.hpp:361:33: warning: ‘template class std::auto_ptr’ is deprecated: use 'std::unique_ptr' instead [-Wdeprecated-declarations] 361 | explicit shared_count( std::auto_ptr & r ): pi_( new sp_counted_impl_p( r.get() ) ) | ^~~~~~~~ In file included from /usr/include/c++/13/memory:78, from /home/omnipath/local/R/4.4-3.20/BH/include/boost/smart_ptr/detail/sp_counted_impl.hpp:35, from /home/omnipath/local/R/4.4-3.20/BH/include/boost/smart_ptr/detail/shared_count.hpp:27: /usr/include/c++/13/bits/unique_ptr.h:65:28: note: declared here 65 | template class auto_ptr; | ^~~~~~~~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/smart_ptr/shared_ptr.hpp:251:65: warning: ‘template class std::auto_ptr’ is deprecated: use 'std::unique_ptr' instead [-Wdeprecated-declarations] 251 | template< class T, class R > struct sp_enable_if_auto_ptr< std::auto_ptr< T >, R > | ^~~~~~~~ /usr/include/c++/13/bits/unique_ptr.h:65:28: note: declared here 65 | template class auto_ptr; | ^~~~~~~~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/smart_ptr/shared_ptr.hpp:508:31: warning: ‘template class std::auto_ptr’ is deprecated: use 'std::unique_ptr' instead [-Wdeprecated-declarations] 508 | explicit shared_ptr( std::auto_ptr & r ): px(r.get()), pn() | ^~~~~~~~ /usr/include/c++/13/bits/unique_ptr.h:65:28: note: declared here 65 | template class auto_ptr; | ^~~~~~~~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/smart_ptr/shared_ptr.hpp:521:22: warning: ‘template class std::auto_ptr’ is deprecated: use 'std::unique_ptr' instead [-Wdeprecated-declarations] 521 | shared_ptr( std::auto_ptr && r ): px(r.get()), pn() | ^~~~~~~~ /usr/include/c++/13/bits/unique_ptr.h:65:28: note: declared here 65 | template class auto_ptr; | ^~~~~~~~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/smart_ptr/shared_ptr.hpp:604:34: warning: ‘template class std::auto_ptr’ is deprecated: use 'std::unique_ptr' instead [-Wdeprecated-declarations] 604 | shared_ptr & operator=( std::auto_ptr & r ) | ^~~~~~~~ /usr/include/c++/13/bits/unique_ptr.h:65:28: note: declared here 65 | template class auto_ptr; | ^~~~~~~~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/smart_ptr/shared_ptr.hpp:613:34: warning: ‘template class std::auto_ptr’ is deprecated: use 'std::unique_ptr' instead [-Wdeprecated-declarations] 613 | shared_ptr & operator=( std::auto_ptr && r ) | ^~~~~~~~ /usr/include/c++/13/bits/unique_ptr.h:65:28: note: declared here 65 | template class auto_ptr; | ^~~~~~~~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/smart_ptr/shared_ptr.hpp: In member function ‘boost::shared_ptr& boost::shared_ptr::operator=(std::auto_ptr<_Up>&&)’: /home/omnipath/local/R/4.4-3.20/BH/include/boost/smart_ptr/shared_ptr.hpp:615:38: warning: ‘template class std::auto_ptr’ is deprecated: use 'std::unique_ptr' instead [-Wdeprecated-declarations] 615 | this_type( static_cast< std::auto_ptr && >( r ) ).swap( *this ); | ^~~~~~~~ /usr/include/c++/13/bits/unique_ptr.h:65:28: note: declared here 65 | template class auto_ptr; | ^~~~~~~~ In file included from /home/omnipath/local/R/4.4-3.20/BH/include/boost/scoped_ptr.hpp:13, from /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/adjacency_list.hpp:22, from RBGL.hpp:38: /home/omnipath/local/R/4.4-3.20/BH/include/boost/smart_ptr/scoped_ptr.hpp: At global scope: /home/omnipath/local/R/4.4-3.20/BH/include/boost/smart_ptr/scoped_ptr.hpp:75:31: warning: ‘template class std::auto_ptr’ is deprecated: use 'std::unique_ptr' instead [-Wdeprecated-declarations] 75 | explicit scoped_ptr( std::auto_ptr p ) BOOST_SP_NOEXCEPT : px( p.release() ) | ^~~~~~~~ /usr/include/c++/13/bits/unique_ptr.h:65:28: note: declared here 65 | template class auto_ptr; | ^~~~~~~~ g++ -std=gnu++17 -I"/usr/share/R/include" -DNDEBUG -I'/home/omnipath/local/R/4.4-3.20/BH/include' -fpic -g -O2 -fno-omit-frame-pointer -mno-omit-leaf-frame-pointer -ffile-prefix-map=/build/r-base-EawLoD/r-base-4.4.1=. -fstack-protector-strong -fstack-clash-protection -Wformat -Werror=format-security -fcf-protection -fdebug-prefix-map=/build/r-base-EawLoD/r-base-4.4.1=/usr/src/r-base-4.4.1-1.2404.0 -Wdate-time -D_FORTIFY_SOURCE=3 -c clusteringCoef.cpp -o clusteringCoef.o In file included from /home/omnipath/local/R/4.4-3.20/BH/include/boost/smart_ptr/shared_ptr.hpp:18, from /home/omnipath/local/R/4.4-3.20/BH/include/boost/property_map/vector_property_map.hpp:14, from /home/omnipath/local/R/4.4-3.20/BH/include/boost/property_map/property_map.hpp:598, from RBGL.hpp:17, from clusteringCoef.cpp:1: /home/omnipath/local/R/4.4-3.20/BH/include/boost/smart_ptr/detail/shared_count.hpp:361:33: warning: ‘template class std::auto_ptr’ is deprecated: use 'std::unique_ptr' instead [-Wdeprecated-declarations] 361 | explicit shared_count( std::auto_ptr & r ): pi_( new sp_counted_impl_p( r.get() ) ) | ^~~~~~~~ In file included from /usr/include/c++/13/memory:78, from /home/omnipath/local/R/4.4-3.20/BH/include/boost/smart_ptr/detail/sp_counted_impl.hpp:35, from /home/omnipath/local/R/4.4-3.20/BH/include/boost/smart_ptr/detail/shared_count.hpp:27: /usr/include/c++/13/bits/unique_ptr.h:65:28: note: declared here 65 | template class auto_ptr; | ^~~~~~~~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/smart_ptr/shared_ptr.hpp:251:65: warning: ‘template class std::auto_ptr’ is deprecated: use 'std::unique_ptr' instead [-Wdeprecated-declarations] 251 | template< class T, class R > struct sp_enable_if_auto_ptr< std::auto_ptr< T >, R > | ^~~~~~~~ /usr/include/c++/13/bits/unique_ptr.h:65:28: note: declared here 65 | template class auto_ptr; | ^~~~~~~~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/smart_ptr/shared_ptr.hpp:508:31: warning: ‘template class std::auto_ptr’ is deprecated: use 'std::unique_ptr' instead [-Wdeprecated-declarations] 508 | explicit shared_ptr( std::auto_ptr & r ): px(r.get()), pn() | ^~~~~~~~ /usr/include/c++/13/bits/unique_ptr.h:65:28: note: declared here 65 | template class auto_ptr; | ^~~~~~~~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/smart_ptr/shared_ptr.hpp:521:22: warning: ‘template class std::auto_ptr’ is deprecated: use 'std::unique_ptr' instead [-Wdeprecated-declarations] 521 | shared_ptr( std::auto_ptr && r ): px(r.get()), pn() | ^~~~~~~~ /usr/include/c++/13/bits/unique_ptr.h:65:28: note: declared here 65 | template class auto_ptr; | ^~~~~~~~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/smart_ptr/shared_ptr.hpp:604:34: warning: ‘template class std::auto_ptr’ is deprecated: use 'std::unique_ptr' instead [-Wdeprecated-declarations] 604 | shared_ptr & operator=( std::auto_ptr & r ) | ^~~~~~~~ /usr/include/c++/13/bits/unique_ptr.h:65:28: note: declared here 65 | template class auto_ptr; | ^~~~~~~~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/smart_ptr/shared_ptr.hpp:613:34: warning: ‘template class std::auto_ptr’ is deprecated: use 'std::unique_ptr' instead [-Wdeprecated-declarations] 613 | shared_ptr & operator=( std::auto_ptr && r ) | ^~~~~~~~ /usr/include/c++/13/bits/unique_ptr.h:65:28: note: declared here 65 | template class auto_ptr; | ^~~~~~~~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/smart_ptr/shared_ptr.hpp: In member function ‘boost::shared_ptr& boost::shared_ptr::operator=(std::auto_ptr<_Up>&&)’: /home/omnipath/local/R/4.4-3.20/BH/include/boost/smart_ptr/shared_ptr.hpp:615:38: warning: ‘template class std::auto_ptr’ is deprecated: use 'std::unique_ptr' instead [-Wdeprecated-declarations] 615 | this_type( static_cast< std::auto_ptr && >( r ) ).swap( *this ); | ^~~~~~~~ /usr/include/c++/13/bits/unique_ptr.h:65:28: note: declared here 65 | template class auto_ptr; | ^~~~~~~~ In file included from /home/omnipath/local/R/4.4-3.20/BH/include/boost/scoped_ptr.hpp:13, from /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/adjacency_list.hpp:22, from RBGL.hpp:38: /home/omnipath/local/R/4.4-3.20/BH/include/boost/smart_ptr/scoped_ptr.hpp: At global scope: /home/omnipath/local/R/4.4-3.20/BH/include/boost/smart_ptr/scoped_ptr.hpp:75:31: warning: ‘template class std::auto_ptr’ is deprecated: use 'std::unique_ptr' instead [-Wdeprecated-declarations] 75 | explicit scoped_ptr( std::auto_ptr p ) BOOST_SP_NOEXCEPT : px( p.release() ) | ^~~~~~~~ /usr/include/c++/13/bits/unique_ptr.h:65:28: note: declared here 65 | template class auto_ptr; | ^~~~~~~~ g++ -std=gnu++17 -I"/usr/share/R/include" -DNDEBUG -I'/home/omnipath/local/R/4.4-3.20/BH/include' -fpic -g -O2 -fno-omit-frame-pointer -mno-omit-leaf-frame-pointer -ffile-prefix-map=/build/r-base-EawLoD/r-base-4.4.1=. -fstack-protector-strong -fstack-clash-protection -Wformat -Werror=format-security -fcf-protection -fdebug-prefix-map=/build/r-base-EawLoD/r-base-4.4.1=/usr/src/r-base-4.4.1-1.2404.0 -Wdate-time -D_FORTIFY_SOURCE=3 -c dominatorTree.cpp -o dominatorTree.o In file included from /home/omnipath/local/R/4.4-3.20/BH/include/boost/smart_ptr/shared_ptr.hpp:18, from /home/omnipath/local/R/4.4-3.20/BH/include/boost/property_map/vector_property_map.hpp:14, from /home/omnipath/local/R/4.4-3.20/BH/include/boost/property_map/property_map.hpp:598, from RBGL.hpp:17, from dominatorTree.cpp:1: /home/omnipath/local/R/4.4-3.20/BH/include/boost/smart_ptr/detail/shared_count.hpp:361:33: warning: ‘template class std::auto_ptr’ is deprecated: use 'std::unique_ptr' instead [-Wdeprecated-declarations] 361 | explicit shared_count( std::auto_ptr & r ): pi_( new sp_counted_impl_p( r.get() ) ) | ^~~~~~~~ In file included from /usr/include/c++/13/memory:78, from /home/omnipath/local/R/4.4-3.20/BH/include/boost/smart_ptr/detail/sp_counted_impl.hpp:35, from /home/omnipath/local/R/4.4-3.20/BH/include/boost/smart_ptr/detail/shared_count.hpp:27: /usr/include/c++/13/bits/unique_ptr.h:65:28: note: declared here 65 | template class auto_ptr; | ^~~~~~~~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/smart_ptr/shared_ptr.hpp:251:65: warning: ‘template class std::auto_ptr’ is deprecated: use 'std::unique_ptr' instead [-Wdeprecated-declarations] 251 | template< class T, class R > struct sp_enable_if_auto_ptr< std::auto_ptr< T >, R > | ^~~~~~~~ /usr/include/c++/13/bits/unique_ptr.h:65:28: note: declared here 65 | template class auto_ptr; | ^~~~~~~~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/smart_ptr/shared_ptr.hpp:508:31: warning: ‘template class std::auto_ptr’ is deprecated: use 'std::unique_ptr' instead [-Wdeprecated-declarations] 508 | explicit shared_ptr( std::auto_ptr & r ): px(r.get()), pn() | ^~~~~~~~ /usr/include/c++/13/bits/unique_ptr.h:65:28: note: declared here 65 | template class auto_ptr; | ^~~~~~~~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/smart_ptr/shared_ptr.hpp:521:22: warning: ‘template class std::auto_ptr’ is deprecated: use 'std::unique_ptr' instead [-Wdeprecated-declarations] 521 | shared_ptr( std::auto_ptr && r ): px(r.get()), pn() | ^~~~~~~~ /usr/include/c++/13/bits/unique_ptr.h:65:28: note: declared here 65 | template class auto_ptr; | ^~~~~~~~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/smart_ptr/shared_ptr.hpp:604:34: warning: ‘template class std::auto_ptr’ is deprecated: use 'std::unique_ptr' instead [-Wdeprecated-declarations] 604 | shared_ptr & operator=( std::auto_ptr & r ) | ^~~~~~~~ /usr/include/c++/13/bits/unique_ptr.h:65:28: note: declared here 65 | template class auto_ptr; | ^~~~~~~~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/smart_ptr/shared_ptr.hpp:613:34: warning: ‘template class std::auto_ptr’ is deprecated: use 'std::unique_ptr' instead [-Wdeprecated-declarations] 613 | shared_ptr & operator=( std::auto_ptr && r ) | ^~~~~~~~ /usr/include/c++/13/bits/unique_ptr.h:65:28: note: declared here 65 | template class auto_ptr; | ^~~~~~~~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/smart_ptr/shared_ptr.hpp: In member function ‘boost::shared_ptr& boost::shared_ptr::operator=(std::auto_ptr<_Up>&&)’: /home/omnipath/local/R/4.4-3.20/BH/include/boost/smart_ptr/shared_ptr.hpp:615:38: warning: ‘template class std::auto_ptr’ is deprecated: use 'std::unique_ptr' instead [-Wdeprecated-declarations] 615 | this_type( static_cast< std::auto_ptr && >( r ) ).swap( *this ); | ^~~~~~~~ /usr/include/c++/13/bits/unique_ptr.h:65:28: note: declared here 65 | template class auto_ptr; | ^~~~~~~~ In file included from /home/omnipath/local/R/4.4-3.20/BH/include/boost/scoped_ptr.hpp:13, from /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/adjacency_list.hpp:22, from RBGL.hpp:38: /home/omnipath/local/R/4.4-3.20/BH/include/boost/smart_ptr/scoped_ptr.hpp: At global scope: /home/omnipath/local/R/4.4-3.20/BH/include/boost/smart_ptr/scoped_ptr.hpp:75:31: warning: ‘template class std::auto_ptr’ is deprecated: use 'std::unique_ptr' instead [-Wdeprecated-declarations] 75 | explicit scoped_ptr( std::auto_ptr p ) BOOST_SP_NOEXCEPT : px( p.release() ) | ^~~~~~~~ /usr/include/c++/13/bits/unique_ptr.h:65:28: note: declared here 65 | template class auto_ptr; | ^~~~~~~~ In file included from /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/assert.hpp:35, from /home/omnipath/local/R/4.4-3.20/BH/include/boost/property_map/property_map.hpp:19: /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements > > >]’: /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:145:5: required from ‘struct boost::Assignable<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:502:3: required from ‘struct boost::InputIterator<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:540:3: required from ‘struct boost::ForwardIterator<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:568:3: required from ‘struct boost::BidirectionalIterator<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:597:3: [ skipping 2 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator > >]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied > > >::value’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied > > >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_ > >)>’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/property_map/property_map.hpp:354:5: required from ‘boost::iterator_property_map >::value_type, typename std::iterator_traits< >::reference> boost::make_iterator_property_map(RAIter, ID) [with RAIter = __gnu_cxx::__normal_iterator >; ID = adj_list_vertex_property_map >, int, int&, vertex_index_t>; typename std::iterator_traits< >::value_type = void*; typename std::iterator_traits< >::reference = void*&]’ dominatorTree.cpp:44:40: required from here /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ In file included from /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:31, from /home/omnipath/local/R/4.4-3.20/BH/include/boost/property_map/property_map.hpp:20: /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::Assignable<__gnu_cxx::__normal_iterator > >]’ 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ^ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements > > >]’: /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:233:5: required from ‘struct boost::EqualityComparable<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:502:3: required from ‘struct boost::InputIterator<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:540:3: required from ‘struct boost::ForwardIterator<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:568:3: required from ‘struct boost::BidirectionalIterator<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:597:3: [ skipping 2 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator > >]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied > > >::value’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied > > >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_ > >)>’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/property_map/property_map.hpp:354:5: required from ‘boost::iterator_property_map >::value_type, typename std::iterator_traits< >::reference> boost::make_iterator_property_map(RAIter, ID) [with RAIter = __gnu_cxx::__normal_iterator >; ID = adj_list_vertex_property_map >, int, int&, vertex_index_t>; typename std::iterator_traits< >::value_type = void*; typename std::iterator_traits< >::reference = void*&]’ dominatorTree.cpp:44:40: required from here /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::EqualityComparable<__gnu_cxx::__normal_iterator > >]’ 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ^ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements > > >]’: /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:512:7: required from ‘struct boost::InputIterator<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:540:3: required from ‘struct boost::ForwardIterator<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:568:3: required from ‘struct boost::BidirectionalIterator<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:597:3: required from ‘struct boost::RandomAccessIterator<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:597:3: required from ‘struct boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator > >]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied > > >::value’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied > > >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_ > >)>’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/property_map/property_map.hpp:354:5: required from ‘boost::iterator_property_map >::value_type, typename std::iterator_traits< >::reference> boost::make_iterator_property_map(RAIter, ID) [with RAIter = __gnu_cxx::__normal_iterator >; ID = adj_list_vertex_property_map >, int, int&, vertex_index_t>; typename std::iterator_traits< >::value_type = void*; typename std::iterator_traits< >::reference = void*&]’ dominatorTree.cpp:44:40: required from here /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::InputIterator<__gnu_cxx::__normal_iterator > >]’ 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ^ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements > > >]’: /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:543:7: required from ‘struct boost::ForwardIterator<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:568:3: required from ‘struct boost::BidirectionalIterator<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:597:3: required from ‘struct boost::RandomAccessIterator<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:597:3: required from ‘struct boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator > >]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied > > >::value’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied > > >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_ > >)>’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/property_map/property_map.hpp:354:5: required from ‘boost::iterator_property_map >::value_type, typename std::iterator_traits< >::reference> boost::make_iterator_property_map(RAIter, ID) [with RAIter = __gnu_cxx::__normal_iterator >; ID = adj_list_vertex_property_map >, int, int&, vertex_index_t>; typename std::iterator_traits< >::value_type = void*; typename std::iterator_traits< >::reference = void*&]’ dominatorTree.cpp:44:40: required from here /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::ForwardIterator<__gnu_cxx::__normal_iterator > >]’ 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ^ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements > > >]’: /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:571:7: required from ‘struct boost::BidirectionalIterator<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:597:3: required from ‘struct boost::RandomAccessIterator<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:597:3: required from ‘struct boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator > >]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied > > >::value’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied > > >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_ > >)>’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/property_map/property_map.hpp:354:5: required from ‘boost::iterator_property_map >::value_type, typename std::iterator_traits< >::reference> boost::make_iterator_property_map(RAIter, ID) [with RAIter = __gnu_cxx::__normal_iterator >; ID = adj_list_vertex_property_map >, int, int&, vertex_index_t>; typename std::iterator_traits< >::value_type = void*; typename std::iterator_traits< >::reference = void*&]’ dominatorTree.cpp:44:40: required from here /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::BidirectionalIterator<__gnu_cxx::__normal_iterator > >]’ 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ^ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements > > >]’: /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:253:5: required from ‘struct boost::Comparable<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:597:3: required from ‘struct boost::RandomAccessIterator<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:597:3: required from ‘struct boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator > >]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied > > >::value’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied > > >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_ > >)>’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/property_map/property_map.hpp:354:5: required from ‘boost::iterator_property_map >::value_type, typename std::iterator_traits< >::reference> boost::make_iterator_property_map(RAIter, ID) [with RAIter = __gnu_cxx::__normal_iterator >; ID = adj_list_vertex_property_map >, int, int&, vertex_index_t>; typename std::iterator_traits< >::value_type = void*; typename std::iterator_traits< >::reference = void*&]’ dominatorTree.cpp:44:40: required from here /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::Comparable<__gnu_cxx::__normal_iterator > >]’ 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ^ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements > > >]’: /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:601:7: required from ‘struct boost::RandomAccessIterator<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:597:3: required from ‘struct boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator > >]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied > > >::value’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied > > >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_ > >)>’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/property_map/property_map.hpp:354:5: required from ‘boost::iterator_property_map >::value_type, typename std::iterator_traits< >::reference> boost::make_iterator_property_map(RAIter, ID) [with RAIter = __gnu_cxx::__normal_iterator >; ID = adj_list_vertex_property_map >, int, int&, vertex_index_t>; typename std::iterator_traits< >::value_type = void*; typename std::iterator_traits< >::reference = void*&]’ dominatorTree.cpp:44:40: required from here /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::RandomAccessIterator<__gnu_cxx::__normal_iterator > >]’ 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ^ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator > >]’: /home/omnipath/local/R/4.4-3.20/BH/include/boost/property_map/property_map.hpp:354:5: required from ‘boost::iterator_property_map >::value_type, typename std::iterator_traits< >::reference> boost::make_iterator_property_map(RAIter, ID) [with RAIter = __gnu_cxx::__normal_iterator >; ID = adj_list_vertex_property_map >, int, int&, vertex_index_t>; typename std::iterator_traits< >::value_type = void*; typename std::iterator_traits< >::reference = void*&]’ dominatorTree.cpp:44:40: required from here /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ In file included from /home/omnipath/local/R/4.4-3.20/BH/include/boost/preprocessor/repetition/enum_binary_params.hpp:15, from /home/omnipath/local/R/4.4-3.20/BH/include/boost/utility/base_from_member.hpp:15, from /home/omnipath/local/R/4.4-3.20/BH/include/boost/utility.hpp:15, from RBGL.hpp:16: /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:597:17: note: in a call to non-static member function ‘boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator > >::~RandomAccessIteratorConcept()’ 597 | BOOST_concept(RandomAccessIterator,(TT)) | ^~~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/preprocessor/cat.hpp:29:34: note: in definition of macro ‘BOOST_PP_CAT_I’ 29 | # define BOOST_PP_CAT_I(a, b) a ## b | ^ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/concept_def.hpp:23:12: note: in expansion of macro ‘BOOST_PP_CAT’ 23 | struct BOOST_PP_CAT(name,Concept) \ | ^~~~~~~~~~~~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:597:3: note: in expansion of macro ‘BOOST_concept’ 597 | BOOST_concept(RandomAccessIterator,(TT)) | ^~~~~~~~~~~~~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::Assignable<__gnu_cxx::__normal_iterator > >]’: /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements > > >]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:145:5: required from ‘struct boost::Assignable<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:502:3: required from ‘struct boost::InputIterator<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:540:3: required from ‘struct boost::ForwardIterator<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:568:3: required from ‘struct boost::BidirectionalIterator<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:597:3: [ skipping 2 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator > >]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied > > >::value’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied > > >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_ > >)>’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/property_map/property_map.hpp:354:5: required from ‘boost::iterator_property_map >::value_type, typename std::iterator_traits< >::reference> boost::make_iterator_property_map(RAIter, ID) [with RAIter = __gnu_cxx::__normal_iterator >; ID = adj_list_vertex_property_map >, int, int&, vertex_index_t>; typename std::iterator_traits< >::value_type = void*; typename std::iterator_traits< >::reference = void*&]’ dominatorTree.cpp:44:40: required from here /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::Assignable::~Assignable() [with TT = __gnu_cxx::__normal_iterator >]’ 37 | ~model() | ^ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:145:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 145 | BOOST_CONCEPT_USAGE(Assignable) { | ^~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::EqualityComparable<__gnu_cxx::__normal_iterator > >]’: /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements > > >]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:233:5: required from ‘struct boost::EqualityComparable<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:502:3: required from ‘struct boost::InputIterator<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:540:3: required from ‘struct boost::ForwardIterator<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:568:3: required from ‘struct boost::BidirectionalIterator<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:597:3: [ skipping 2 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator > >]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied > > >::value’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied > > >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_ > >)>’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/property_map/property_map.hpp:354:5: required from ‘boost::iterator_property_map >::value_type, typename std::iterator_traits< >::reference> boost::make_iterator_property_map(RAIter, ID) [with RAIter = __gnu_cxx::__normal_iterator >; ID = adj_list_vertex_property_map >, int, int&, vertex_index_t>; typename std::iterator_traits< >::value_type = void*; typename std::iterator_traits< >::reference = void*&]’ dominatorTree.cpp:44:40: required from here /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::EqualityComparable::~EqualityComparable() [with TT = __gnu_cxx::__normal_iterator >]’ 37 | ~model() | ^ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:233:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 233 | BOOST_CONCEPT_USAGE(EqualityComparable) { | ^~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::InputIterator<__gnu_cxx::__normal_iterator > >]’: /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements > > >]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:512:7: required from ‘struct boost::InputIterator<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:540:3: required from ‘struct boost::ForwardIterator<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:568:3: required from ‘struct boost::BidirectionalIterator<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:597:3: [ skipping 2 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator > >]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied > > >::value’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied > > >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_ > >)>’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/property_map/property_map.hpp:354:5: required from ‘boost::iterator_property_map >::value_type, typename std::iterator_traits< >::reference> boost::make_iterator_property_map(RAIter, ID) [with RAIter = __gnu_cxx::__normal_iterator >; ID = adj_list_vertex_property_map >, int, int&, vertex_index_t>; typename std::iterator_traits< >::value_type = void*; typename std::iterator_traits< >::reference = void*&]’ dominatorTree.cpp:44:40: required from here /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::InputIterator::~InputIterator() [with TT = __gnu_cxx::__normal_iterator >]’ 37 | ~model() | ^ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:512:7: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 512 | BOOST_CONCEPT_USAGE(InputIterator) | ^~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::ForwardIterator<__gnu_cxx::__normal_iterator > >]’: /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements > > >]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:543:7: required from ‘struct boost::ForwardIterator<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:568:3: required from ‘struct boost::BidirectionalIterator<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:597:3: required from ‘struct boost::RandomAccessIterator<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:597:3: required from ‘struct boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator > >]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied > > >::value’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied > > >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_ > >)>’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/property_map/property_map.hpp:354:5: required from ‘boost::iterator_property_map >::value_type, typename std::iterator_traits< >::reference> boost::make_iterator_property_map(RAIter, ID) [with RAIter = __gnu_cxx::__normal_iterator >; ID = adj_list_vertex_property_map >, int, int&, vertex_index_t>; typename std::iterator_traits< >::value_type = void*; typename std::iterator_traits< >::reference = void*&]’ dominatorTree.cpp:44:40: required from here /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::ForwardIterator::~ForwardIterator() [with TT = __gnu_cxx::__normal_iterator >]’ 37 | ~model() | ^ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:543:7: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 543 | BOOST_CONCEPT_USAGE(ForwardIterator) | ^~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::BidirectionalIterator<__gnu_cxx::__normal_iterator > >]’: /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements > > >]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:571:7: required from ‘struct boost::BidirectionalIterator<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:597:3: required from ‘struct boost::RandomAccessIterator<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:597:3: required from ‘struct boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator > >]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied > > >::value’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied > > >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_ > >)>’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/property_map/property_map.hpp:354:5: required from ‘boost::iterator_property_map >::value_type, typename std::iterator_traits< >::reference> boost::make_iterator_property_map(RAIter, ID) [with RAIter = __gnu_cxx::__normal_iterator >; ID = adj_list_vertex_property_map >, int, int&, vertex_index_t>; typename std::iterator_traits< >::value_type = void*; typename std::iterator_traits< >::reference = void*&]’ dominatorTree.cpp:44:40: required from here /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::BidirectionalIterator::~BidirectionalIterator() [with TT = __gnu_cxx::__normal_iterator >]’ 37 | ~model() | ^ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:571:7: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 571 | BOOST_CONCEPT_USAGE(BidirectionalIterator) | ^~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::Comparable<__gnu_cxx::__normal_iterator > >]’: /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements > > >]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:253:5: required from ‘struct boost::Comparable<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:597:3: required from ‘struct boost::RandomAccessIterator<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:597:3: required from ‘struct boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator > >]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied > > >::value’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied > > >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_ > >)>’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/property_map/property_map.hpp:354:5: required from ‘boost::iterator_property_map >::value_type, typename std::iterator_traits< >::reference> boost::make_iterator_property_map(RAIter, ID) [with RAIter = __gnu_cxx::__normal_iterator >; ID = adj_list_vertex_property_map >, int, int&, vertex_index_t>; typename std::iterator_traits< >::value_type = void*; typename std::iterator_traits< >::reference = void*&]’ dominatorTree.cpp:44:40: required from here /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::Comparable::~Comparable() [with TT = __gnu_cxx::__normal_iterator >]’ 37 | ~model() | ^ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:253:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 253 | BOOST_CONCEPT_USAGE(Comparable) { | ^~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::RandomAccessIterator<__gnu_cxx::__normal_iterator > >]’: /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements > > >]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:601:7: required from ‘struct boost::RandomAccessIterator<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:597:3: required from ‘struct boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator > >]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied > > >::value’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied > > >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_ > >)>’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/property_map/property_map.hpp:354:5: required from ‘boost::iterator_property_map >::value_type, typename std::iterator_traits< >::reference> boost::make_iterator_property_map(RAIter, ID) [with RAIter = __gnu_cxx::__normal_iterator >; ID = adj_list_vertex_property_map >, int, int&, vertex_index_t>; typename std::iterator_traits< >::value_type = void*; typename std::iterator_traits< >::reference = void*&]’ dominatorTree.cpp:44:40: required from here /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::RandomAccessIterator::~RandomAccessIterator() [with TT = __gnu_cxx::__normal_iterator >]’ 37 | ~model() | ^ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:601:7: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 601 | BOOST_CONCEPT_USAGE(RandomAccessIterator) | ^~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements > > > >]’: /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:145:5: required from ‘struct boost::Assignable<__gnu_cxx::__normal_iterator > > >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:502:3: required from ‘struct boost::InputIterator<__gnu_cxx::__normal_iterator > > >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:540:3: required from ‘struct boost::ForwardIterator<__gnu_cxx::__normal_iterator > > >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:568:3: required from ‘struct boost::BidirectionalIterator<__gnu_cxx::__normal_iterator > > >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:597:3: required from ‘struct boost::RandomAccessIterator<__gnu_cxx::__normal_iterator > > >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:597:3: [ skipping 2 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied > > > >::value’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied > > > >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_ > > >)>’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/property_map/property_map.hpp:354:5: required from ‘boost::iterator_property_map >::value_type, typename std::iterator_traits< >::reference> boost::make_iterator_property_map(RAIter, ID) [with RAIter = __gnu_cxx::__normal_iterator > >; ID = adj_list_vertex_property_map >, int, const int&, vertex_index_t>; typename std::iterator_traits< >::value_type = long unsigned int; typename std::iterator_traits< >::reference = long unsigned int&]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/dominator_tree.hpp:351:48: required from ‘void boost::lengauer_tarjan_dominator_tree(const Graph&, const typename graph_traits::vertex_descriptor&, DomTreePredMap) [with Graph = adjacency_list >; DomTreePredMap = iterator_property_map<__gnu_cxx::__normal_iterator >, adj_list_vertex_property_map >, int, int&, vertex_index_t> >; typename graph_traits::vertex_descriptor = void*]’ dominatorTree.cpp:46:36: required from here /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::Assignable<__gnu_cxx::__normal_iterator > > >]’ 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ^ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements > > > >]’: /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:233:5: required from ‘struct boost::EqualityComparable<__gnu_cxx::__normal_iterator > > >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:502:3: required from ‘struct boost::InputIterator<__gnu_cxx::__normal_iterator > > >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:540:3: required from ‘struct boost::ForwardIterator<__gnu_cxx::__normal_iterator > > >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:568:3: required from ‘struct boost::BidirectionalIterator<__gnu_cxx::__normal_iterator > > >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:597:3: required from ‘struct boost::RandomAccessIterator<__gnu_cxx::__normal_iterator > > >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:597:3: [ skipping 2 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied > > > >::value’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied > > > >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_ > > >)>’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/property_map/property_map.hpp:354:5: required from ‘boost::iterator_property_map >::value_type, typename std::iterator_traits< >::reference> boost::make_iterator_property_map(RAIter, ID) [with RAIter = __gnu_cxx::__normal_iterator > >; ID = adj_list_vertex_property_map >, int, const int&, vertex_index_t>; typename std::iterator_traits< >::value_type = long unsigned int; typename std::iterator_traits< >::reference = long unsigned int&]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/dominator_tree.hpp:351:48: required from ‘void boost::lengauer_tarjan_dominator_tree(const Graph&, const typename graph_traits::vertex_descriptor&, DomTreePredMap) [with Graph = adjacency_list >; DomTreePredMap = iterator_property_map<__gnu_cxx::__normal_iterator >, adj_list_vertex_property_map >, int, int&, vertex_index_t> >; typename graph_traits::vertex_descriptor = void*]’ dominatorTree.cpp:46:36: required from here /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::EqualityComparable<__gnu_cxx::__normal_iterator > > >]’ 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ^ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements > > > >]’: /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:512:7: required from ‘struct boost::InputIterator<__gnu_cxx::__normal_iterator > > >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:540:3: required from ‘struct boost::ForwardIterator<__gnu_cxx::__normal_iterator > > >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:568:3: required from ‘struct boost::BidirectionalIterator<__gnu_cxx::__normal_iterator > > >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:597:3: required from ‘struct boost::RandomAccessIterator<__gnu_cxx::__normal_iterator > > >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:597:3: [ skipping 2 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied > > > >::value’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied > > > >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_ > > >)>’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/property_map/property_map.hpp:354:5: required from ‘boost::iterator_property_map >::value_type, typename std::iterator_traits< >::reference> boost::make_iterator_property_map(RAIter, ID) [with RAIter = __gnu_cxx::__normal_iterator > >; ID = adj_list_vertex_property_map >, int, const int&, vertex_index_t>; typename std::iterator_traits< >::value_type = long unsigned int; typename std::iterator_traits< >::reference = long unsigned int&]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/dominator_tree.hpp:351:48: required from ‘void boost::lengauer_tarjan_dominator_tree(const Graph&, const typename graph_traits::vertex_descriptor&, DomTreePredMap) [with Graph = adjacency_list >; DomTreePredMap = iterator_property_map<__gnu_cxx::__normal_iterator >, adj_list_vertex_property_map >, int, int&, vertex_index_t> >; typename graph_traits::vertex_descriptor = void*]’ dominatorTree.cpp:46:36: required from here /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::InputIterator<__gnu_cxx::__normal_iterator > > >]’ 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ^ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements > > > >]’: /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:543:7: required from ‘struct boost::ForwardIterator<__gnu_cxx::__normal_iterator > > >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:568:3: required from ‘struct boost::BidirectionalIterator<__gnu_cxx::__normal_iterator > > >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:597:3: required from ‘struct boost::RandomAccessIterator<__gnu_cxx::__normal_iterator > > >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:597:3: required from ‘struct boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator > > >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator > > >]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied > > > >::value’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied > > > >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_ > > >)>’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/property_map/property_map.hpp:354:5: required from ‘boost::iterator_property_map >::value_type, typename std::iterator_traits< >::reference> boost::make_iterator_property_map(RAIter, ID) [with RAIter = __gnu_cxx::__normal_iterator > >; ID = adj_list_vertex_property_map >, int, const int&, vertex_index_t>; typename std::iterator_traits< >::value_type = long unsigned int; typename std::iterator_traits< >::reference = long unsigned int&]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/dominator_tree.hpp:351:48: required from ‘void boost::lengauer_tarjan_dominator_tree(const Graph&, const typename graph_traits::vertex_descriptor&, DomTreePredMap) [with Graph = adjacency_list >; DomTreePredMap = iterator_property_map<__gnu_cxx::__normal_iterator >, adj_list_vertex_property_map >, int, int&, vertex_index_t> >; typename graph_traits::vertex_descriptor = void*]’ dominatorTree.cpp:46:36: required from here /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::ForwardIterator<__gnu_cxx::__normal_iterator > > >]’ 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ^ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements > > > >]’: /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:571:7: required from ‘struct boost::BidirectionalIterator<__gnu_cxx::__normal_iterator > > >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:597:3: required from ‘struct boost::RandomAccessIterator<__gnu_cxx::__normal_iterator > > >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:597:3: required from ‘struct boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator > > >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator > > >]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied > > > >::value’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied > > > >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_ > > >)>’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/property_map/property_map.hpp:354:5: required from ‘boost::iterator_property_map >::value_type, typename std::iterator_traits< >::reference> boost::make_iterator_property_map(RAIter, ID) [with RAIter = __gnu_cxx::__normal_iterator > >; ID = adj_list_vertex_property_map >, int, const int&, vertex_index_t>; typename std::iterator_traits< >::value_type = long unsigned int; typename std::iterator_traits< >::reference = long unsigned int&]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/dominator_tree.hpp:351:48: required from ‘void boost::lengauer_tarjan_dominator_tree(const Graph&, const typename graph_traits::vertex_descriptor&, DomTreePredMap) [with Graph = adjacency_list >; DomTreePredMap = iterator_property_map<__gnu_cxx::__normal_iterator >, adj_list_vertex_property_map >, int, int&, vertex_index_t> >; typename graph_traits::vertex_descriptor = void*]’ dominatorTree.cpp:46:36: required from here /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::BidirectionalIterator<__gnu_cxx::__normal_iterator > > >]’ 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ^ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements > > > >]’: /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:253:5: required from ‘struct boost::Comparable<__gnu_cxx::__normal_iterator > > >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:597:3: required from ‘struct boost::RandomAccessIterator<__gnu_cxx::__normal_iterator > > >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:597:3: required from ‘struct boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator > > >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator > > >]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied > > > >::value’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied > > > >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_ > > >)>’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/property_map/property_map.hpp:354:5: required from ‘boost::iterator_property_map >::value_type, typename std::iterator_traits< >::reference> boost::make_iterator_property_map(RAIter, ID) [with RAIter = __gnu_cxx::__normal_iterator > >; ID = adj_list_vertex_property_map >, int, const int&, vertex_index_t>; typename std::iterator_traits< >::value_type = long unsigned int; typename std::iterator_traits< >::reference = long unsigned int&]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/dominator_tree.hpp:351:48: required from ‘void boost::lengauer_tarjan_dominator_tree(const Graph&, const typename graph_traits::vertex_descriptor&, DomTreePredMap) [with Graph = adjacency_list >; DomTreePredMap = iterator_property_map<__gnu_cxx::__normal_iterator >, adj_list_vertex_property_map >, int, int&, vertex_index_t> >; typename graph_traits::vertex_descriptor = void*]’ dominatorTree.cpp:46:36: required from here /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::Comparable<__gnu_cxx::__normal_iterator > > >]’ 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ^ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements > > > >]’: /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:601:7: required from ‘struct boost::RandomAccessIterator<__gnu_cxx::__normal_iterator > > >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:597:3: required from ‘struct boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator > > >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator > > >]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied > > > >::value’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied > > > >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_ > > >)>’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/property_map/property_map.hpp:354:5: required from ‘boost::iterator_property_map >::value_type, typename std::iterator_traits< >::reference> boost::make_iterator_property_map(RAIter, ID) [with RAIter = __gnu_cxx::__normal_iterator > >; ID = adj_list_vertex_property_map >, int, const int&, vertex_index_t>; typename std::iterator_traits< >::value_type = long unsigned int; typename std::iterator_traits< >::reference = long unsigned int&]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/dominator_tree.hpp:351:48: required from ‘void boost::lengauer_tarjan_dominator_tree(const Graph&, const typename graph_traits::vertex_descriptor&, DomTreePredMap) [with Graph = adjacency_list >; DomTreePredMap = iterator_property_map<__gnu_cxx::__normal_iterator >, adj_list_vertex_property_map >, int, int&, vertex_index_t> >; typename graph_traits::vertex_descriptor = void*]’ dominatorTree.cpp:46:36: required from here /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::RandomAccessIterator<__gnu_cxx::__normal_iterator > > >]’ 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ^ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator > > >]’: /home/omnipath/local/R/4.4-3.20/BH/include/boost/property_map/property_map.hpp:354:5: required from ‘boost::iterator_property_map >::value_type, typename std::iterator_traits< >::reference> boost::make_iterator_property_map(RAIter, ID) [with RAIter = __gnu_cxx::__normal_iterator > >; ID = adj_list_vertex_property_map >, int, const int&, vertex_index_t>; typename std::iterator_traits< >::value_type = long unsigned int; typename std::iterator_traits< >::reference = long unsigned int&]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/dominator_tree.hpp:351:48: required from ‘void boost::lengauer_tarjan_dominator_tree(const Graph&, const typename graph_traits::vertex_descriptor&, DomTreePredMap) [with Graph = adjacency_list >; DomTreePredMap = iterator_property_map<__gnu_cxx::__normal_iterator >, adj_list_vertex_property_map >, int, int&, vertex_index_t> >; typename graph_traits::vertex_descriptor = void*]’ dominatorTree.cpp:46:36: required from here /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:597:17: note: in a call to non-static member function ‘boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator > > >::~RandomAccessIteratorConcept()’ 597 | BOOST_concept(RandomAccessIterator,(TT)) | ^~~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/preprocessor/cat.hpp:29:34: note: in definition of macro ‘BOOST_PP_CAT_I’ 29 | # define BOOST_PP_CAT_I(a, b) a ## b | ^ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/concept_def.hpp:23:12: note: in expansion of macro ‘BOOST_PP_CAT’ 23 | struct BOOST_PP_CAT(name,Concept) \ | ^~~~~~~~~~~~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:597:3: note: in expansion of macro ‘BOOST_concept’ 597 | BOOST_concept(RandomAccessIterator,(TT)) | ^~~~~~~~~~~~~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements > > >]’: /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/graph_concepts.hpp:66:5: required from ‘struct boost::concepts::Graph > >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/graph_concepts.hpp:75:1: required from ‘struct boost::concepts::IncidenceGraph > >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/graph_concepts.hpp:118:1: required from ‘struct boost::concepts::BidirectionalGraph > >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/graph_concepts.hpp:118:1: required from ‘struct boost::concepts::BidirectionalGraphConcept > >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::concepts::BidirectionalGraphConcept > >]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied > > >::value’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied > > >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_ > >)>’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/dominator_tree.hpp:245:5: required from ‘void boost::lengauer_tarjan_dominator_tree(const Graph&, const typename graph_traits::vertex_descriptor&, const IndexMap&, TimeMap, PredMap, VertexVector&, DomTreePredMap) [with Graph = adjacency_list >; IndexMap = adj_list_vertex_property_map >, int, const int&, vertex_index_t>; TimeMap = iterator_property_map<__gnu_cxx::__normal_iterator > >, adj_list_vertex_property_map >, int, const int&, vertex_index_t>, long unsigned int, long unsigned int&>; PredMap = iterator_property_map<__gnu_cxx::__normal_iterator >, adj_list_vertex_property_map >, int, const int&, vertex_index_t>, void*, void*&>; VertexVector = std::vector; DomTreePredMap = iterator_property_map<__gnu_cxx::__normal_iterator >, adj_list_vertex_property_map >, int, int&, vertex_index_t> >; typename graph_traits::vertex_descriptor = void*]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/dominator_tree.hpp:360:35: required from ‘void boost::lengauer_tarjan_dominator_tree(const Graph&, const typename graph_traits::vertex_descriptor&, DomTreePredMap) [with Graph = adjacency_list >; DomTreePredMap = iterator_property_map<__gnu_cxx::__normal_iterator >, adj_list_vertex_property_map >, int, int&, vertex_index_t> >; typename graph_traits::vertex_descriptor = void*]’ dominatorTree.cpp:46:36: required from here /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::concepts::Graph > >]’ 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ^ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements > > >]’: /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/graph_concepts.hpp:87:5: required from ‘struct boost::concepts::IncidenceGraph > >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/graph_concepts.hpp:118:1: required from ‘struct boost::concepts::BidirectionalGraph > >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/graph_concepts.hpp:118:1: required from ‘struct boost::concepts::BidirectionalGraphConcept > >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::concepts::BidirectionalGraphConcept > >]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied > > >::value’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied > > >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_ > >)>’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/dominator_tree.hpp:245:5: required from ‘void boost::lengauer_tarjan_dominator_tree(const Graph&, const typename graph_traits::vertex_descriptor&, const IndexMap&, TimeMap, PredMap, VertexVector&, DomTreePredMap) [with Graph = adjacency_list >; IndexMap = adj_list_vertex_property_map >, int, const int&, vertex_index_t>; TimeMap = iterator_property_map<__gnu_cxx::__normal_iterator > >, adj_list_vertex_property_map >, int, const int&, vertex_index_t>, long unsigned int, long unsigned int&>; PredMap = iterator_property_map<__gnu_cxx::__normal_iterator >, adj_list_vertex_property_map >, int, const int&, vertex_index_t>, void*, void*&>; VertexVector = std::vector; DomTreePredMap = iterator_property_map<__gnu_cxx::__normal_iterator >, adj_list_vertex_property_map >, int, int&, vertex_index_t> >; typename graph_traits::vertex_descriptor = void*]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/dominator_tree.hpp:360:35: required from ‘void boost::lengauer_tarjan_dominator_tree(const Graph&, const typename graph_traits::vertex_descriptor&, DomTreePredMap) [with Graph = adjacency_list >; DomTreePredMap = iterator_property_map<__gnu_cxx::__normal_iterator >, adj_list_vertex_property_map >, int, int&, vertex_index_t> >; typename graph_traits::vertex_descriptor = void*]’ dominatorTree.cpp:46:36: required from here /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::concepts::IncidenceGraph > >]’ 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ^ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements > > >]’: /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/graph_concepts.hpp:123:5: required from ‘struct boost::concepts::BidirectionalGraph > >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/graph_concepts.hpp:118:1: required from ‘struct boost::concepts::BidirectionalGraphConcept > >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::concepts::BidirectionalGraphConcept > >]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied > > >::value’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied > > >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_ > >)>’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/dominator_tree.hpp:245:5: required from ‘void boost::lengauer_tarjan_dominator_tree(const Graph&, const typename graph_traits::vertex_descriptor&, const IndexMap&, TimeMap, PredMap, VertexVector&, DomTreePredMap) [with Graph = adjacency_list >; IndexMap = adj_list_vertex_property_map >, int, const int&, vertex_index_t>; TimeMap = iterator_property_map<__gnu_cxx::__normal_iterator > >, adj_list_vertex_property_map >, int, const int&, vertex_index_t>, long unsigned int, long unsigned int&>; PredMap = iterator_property_map<__gnu_cxx::__normal_iterator >, adj_list_vertex_property_map >, int, const int&, vertex_index_t>, void*, void*&>; VertexVector = std::vector; DomTreePredMap = iterator_property_map<__gnu_cxx::__normal_iterator >, adj_list_vertex_property_map >, int, int&, vertex_index_t> >; typename graph_traits::vertex_descriptor = void*]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/dominator_tree.hpp:360:35: required from ‘void boost::lengauer_tarjan_dominator_tree(const Graph&, const typename graph_traits::vertex_descriptor&, DomTreePredMap) [with Graph = adjacency_list >; DomTreePredMap = iterator_property_map<__gnu_cxx::__normal_iterator >, adj_list_vertex_property_map >, int, int&, vertex_index_t> >; typename graph_traits::vertex_descriptor = void*]’ dominatorTree.cpp:46:36: required from here /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::concepts::BidirectionalGraph > >]’ 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ^ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::BidirectionalGraphConcept > >]’: /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/dominator_tree.hpp:245:5: required from ‘void boost::lengauer_tarjan_dominator_tree(const Graph&, const typename graph_traits::vertex_descriptor&, const IndexMap&, TimeMap, PredMap, VertexVector&, DomTreePredMap) [with Graph = adjacency_list >; IndexMap = adj_list_vertex_property_map >, int, const int&, vertex_index_t>; TimeMap = iterator_property_map<__gnu_cxx::__normal_iterator > >, adj_list_vertex_property_map >, int, const int&, vertex_index_t>, long unsigned int, long unsigned int&>; PredMap = iterator_property_map<__gnu_cxx::__normal_iterator >, adj_list_vertex_property_map >, int, const int&, vertex_index_t>, void*, void*&>; VertexVector = std::vector; DomTreePredMap = iterator_property_map<__gnu_cxx::__normal_iterator >, adj_list_vertex_property_map >, int, int&, vertex_index_t> >; typename graph_traits::vertex_descriptor = void*]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/dominator_tree.hpp:360:35: required from ‘void boost::lengauer_tarjan_dominator_tree(const Graph&, const typename graph_traits::vertex_descriptor&, DomTreePredMap) [with Graph = adjacency_list >; DomTreePredMap = iterator_property_map<__gnu_cxx::__normal_iterator >, adj_list_vertex_property_map >, int, int&, vertex_index_t> >; typename graph_traits::vertex_descriptor = void*]’ dominatorTree.cpp:46:36: required from here /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/graph_concepts.hpp:118:15: note: in a call to non-static member function ‘boost::concepts::BidirectionalGraphConcept > >::~BidirectionalGraphConcept()’ 118 | BOOST_concept(BidirectionalGraph, (G)) : IncidenceGraph< G > | ^~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/preprocessor/cat.hpp:29:34: note: in definition of macro ‘BOOST_PP_CAT_I’ 29 | # define BOOST_PP_CAT_I(a, b) a ## b | ^ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/concept_def.hpp:23:12: note: in expansion of macro ‘BOOST_PP_CAT’ 23 | struct BOOST_PP_CAT(name,Concept) \ | ^~~~~~~~~~~~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/graph_concepts.hpp:118:1: note: in expansion of macro ‘BOOST_concept’ 118 | BOOST_concept(BidirectionalGraph, (G)) : IncidenceGraph< G > | ^~~~~~~~~~~~~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements >]’: /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:208:5: required from ‘struct boost::Convertible’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::Convertible]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied >::value’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_)>’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:603:11: required from ‘boost::RandomAccessIterator::~RandomAccessIterator() [with TT = __gnu_cxx::__normal_iterator >]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:597:3: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator > >]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/property_map/property_map.hpp:354:5: required from ‘boost::iterator_property_map >::value_type, typename std::iterator_traits< >::reference> boost::make_iterator_property_map(RAIter, ID) [with RAIter = __gnu_cxx::__normal_iterator >; ID = adj_list_vertex_property_map >, int, int&, vertex_index_t>; typename std::iterator_traits< >::value_type = void*; typename std::iterator_traits< >::reference = void*&]’ dominatorTree.cpp:44:40: required from here /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::Convertible]’ 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ^ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::Convertible]’: /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:603:11: required from ‘boost::RandomAccessIterator::~RandomAccessIterator() [with TT = __gnu_cxx::__normal_iterator >]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:597:3: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator > >]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/property_map/property_map.hpp:354:5: required from ‘boost::iterator_property_map >::value_type, typename std::iterator_traits< >::reference> boost::make_iterator_property_map(RAIter, ID) [with RAIter = __gnu_cxx::__normal_iterator >; ID = adj_list_vertex_property_map >, int, int&, vertex_index_t>; typename std::iterator_traits< >::value_type = void*; typename std::iterator_traits< >::reference = void*&]’ dominatorTree.cpp:44:40: required from here /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::Convertible::~Convertible() [with X = std::random_access_iterator_tag; Y = std::random_access_iterator_tag]’ 37 | ~model() | ^ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:208:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 208 | BOOST_CONCEPT_USAGE(Convertible) { | ^~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::Assignable<__gnu_cxx::__normal_iterator > > >]’: /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements > > > >]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:145:5: required from ‘struct boost::Assignable<__gnu_cxx::__normal_iterator > > >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:502:3: required from ‘struct boost::InputIterator<__gnu_cxx::__normal_iterator > > >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:540:3: required from ‘struct boost::ForwardIterator<__gnu_cxx::__normal_iterator > > >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:568:3: required from ‘struct boost::BidirectionalIterator<__gnu_cxx::__normal_iterator > > >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:597:3: [ skipping 3 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied > > > >::value’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied > > > >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_ > > >)>’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/property_map/property_map.hpp:354:5: required from ‘boost::iterator_property_map >::value_type, typename std::iterator_traits< >::reference> boost::make_iterator_property_map(RAIter, ID) [with RAIter = __gnu_cxx::__normal_iterator > >; ID = adj_list_vertex_property_map >, int, const int&, vertex_index_t>; typename std::iterator_traits< >::value_type = long unsigned int; typename std::iterator_traits< >::reference = long unsigned int&]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/dominator_tree.hpp:351:48: required from ‘void boost::lengauer_tarjan_dominator_tree(const Graph&, const typename graph_traits::vertex_descriptor&, DomTreePredMap) [with Graph = adjacency_list >; DomTreePredMap = iterator_property_map<__gnu_cxx::__normal_iterator >, adj_list_vertex_property_map >, int, int&, vertex_index_t> >; typename graph_traits::vertex_descriptor = void*]’ dominatorTree.cpp:46:36: required from here /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::Assignable::~Assignable() [with TT = __gnu_cxx::__normal_iterator > >]’ 37 | ~model() | ^ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:145:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 145 | BOOST_CONCEPT_USAGE(Assignable) { | ^~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::EqualityComparable<__gnu_cxx::__normal_iterator > > >]’: /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements > > > >]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:233:5: required from ‘struct boost::EqualityComparable<__gnu_cxx::__normal_iterator > > >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:502:3: required from ‘struct boost::InputIterator<__gnu_cxx::__normal_iterator > > >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:540:3: required from ‘struct boost::ForwardIterator<__gnu_cxx::__normal_iterator > > >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:568:3: required from ‘struct boost::BidirectionalIterator<__gnu_cxx::__normal_iterator > > >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:597:3: [ skipping 3 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied > > > >::value’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied > > > >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_ > > >)>’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/property_map/property_map.hpp:354:5: required from ‘boost::iterator_property_map >::value_type, typename std::iterator_traits< >::reference> boost::make_iterator_property_map(RAIter, ID) [with RAIter = __gnu_cxx::__normal_iterator > >; ID = adj_list_vertex_property_map >, int, const int&, vertex_index_t>; typename std::iterator_traits< >::value_type = long unsigned int; typename std::iterator_traits< >::reference = long unsigned int&]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/dominator_tree.hpp:351:48: required from ‘void boost::lengauer_tarjan_dominator_tree(const Graph&, const typename graph_traits::vertex_descriptor&, DomTreePredMap) [with Graph = adjacency_list >; DomTreePredMap = iterator_property_map<__gnu_cxx::__normal_iterator >, adj_list_vertex_property_map >, int, int&, vertex_index_t> >; typename graph_traits::vertex_descriptor = void*]’ dominatorTree.cpp:46:36: required from here /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::EqualityComparable::~EqualityComparable() [with TT = __gnu_cxx::__normal_iterator > >]’ 37 | ~model() | ^ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:233:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 233 | BOOST_CONCEPT_USAGE(EqualityComparable) { | ^~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::InputIterator<__gnu_cxx::__normal_iterator > > >]’: /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements > > > >]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:512:7: required from ‘struct boost::InputIterator<__gnu_cxx::__normal_iterator > > >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:540:3: required from ‘struct boost::ForwardIterator<__gnu_cxx::__normal_iterator > > >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:568:3: required from ‘struct boost::BidirectionalIterator<__gnu_cxx::__normal_iterator > > >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:597:3: required from ‘struct boost::RandomAccessIterator<__gnu_cxx::__normal_iterator > > >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:597:3: [ skipping 2 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied > > > >::value’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied > > > >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_ > > >)>’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/property_map/property_map.hpp:354:5: required from ‘boost::iterator_property_map >::value_type, typename std::iterator_traits< >::reference> boost::make_iterator_property_map(RAIter, ID) [with RAIter = __gnu_cxx::__normal_iterator > >; ID = adj_list_vertex_property_map >, int, const int&, vertex_index_t>; typename std::iterator_traits< >::value_type = long unsigned int; typename std::iterator_traits< >::reference = long unsigned int&]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/dominator_tree.hpp:351:48: required from ‘void boost::lengauer_tarjan_dominator_tree(const Graph&, const typename graph_traits::vertex_descriptor&, DomTreePredMap) [with Graph = adjacency_list >; DomTreePredMap = iterator_property_map<__gnu_cxx::__normal_iterator >, adj_list_vertex_property_map >, int, int&, vertex_index_t> >; typename graph_traits::vertex_descriptor = void*]’ dominatorTree.cpp:46:36: required from here /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::InputIterator::~InputIterator() [with TT = __gnu_cxx::__normal_iterator > >]’ 37 | ~model() | ^ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:512:7: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 512 | BOOST_CONCEPT_USAGE(InputIterator) | ^~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::ForwardIterator<__gnu_cxx::__normal_iterator > > >]’: /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements > > > >]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:543:7: required from ‘struct boost::ForwardIterator<__gnu_cxx::__normal_iterator > > >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:568:3: required from ‘struct boost::BidirectionalIterator<__gnu_cxx::__normal_iterator > > >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:597:3: required from ‘struct boost::RandomAccessIterator<__gnu_cxx::__normal_iterator > > >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:597:3: [ skipping 2 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied > > > >::value’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied > > > >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_ > > >)>’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/property_map/property_map.hpp:354:5: required from ‘boost::iterator_property_map >::value_type, typename std::iterator_traits< >::reference> boost::make_iterator_property_map(RAIter, ID) [with RAIter = __gnu_cxx::__normal_iterator > >; ID = adj_list_vertex_property_map >, int, const int&, vertex_index_t>; typename std::iterator_traits< >::value_type = long unsigned int; typename std::iterator_traits< >::reference = long unsigned int&]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/dominator_tree.hpp:351:48: required from ‘void boost::lengauer_tarjan_dominator_tree(const Graph&, const typename graph_traits::vertex_descriptor&, DomTreePredMap) [with Graph = adjacency_list >; DomTreePredMap = iterator_property_map<__gnu_cxx::__normal_iterator >, adj_list_vertex_property_map >, int, int&, vertex_index_t> >; typename graph_traits::vertex_descriptor = void*]’ dominatorTree.cpp:46:36: required from here /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::ForwardIterator::~ForwardIterator() [with TT = __gnu_cxx::__normal_iterator > >]’ 37 | ~model() | ^ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:543:7: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 543 | BOOST_CONCEPT_USAGE(ForwardIterator) | ^~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::BidirectionalIterator<__gnu_cxx::__normal_iterator > > >]’: /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements > > > >]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:571:7: required from ‘struct boost::BidirectionalIterator<__gnu_cxx::__normal_iterator > > >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:597:3: required from ‘struct boost::RandomAccessIterator<__gnu_cxx::__normal_iterator > > >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:597:3: required from ‘struct boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator > > >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator > > >]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied > > > >::value’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied > > > >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_ > > >)>’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/property_map/property_map.hpp:354:5: required from ‘boost::iterator_property_map >::value_type, typename std::iterator_traits< >::reference> boost::make_iterator_property_map(RAIter, ID) [with RAIter = __gnu_cxx::__normal_iterator > >; ID = adj_list_vertex_property_map >, int, const int&, vertex_index_t>; typename std::iterator_traits< >::value_type = long unsigned int; typename std::iterator_traits< >::reference = long unsigned int&]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/dominator_tree.hpp:351:48: required from ‘void boost::lengauer_tarjan_dominator_tree(const Graph&, const typename graph_traits::vertex_descriptor&, DomTreePredMap) [with Graph = adjacency_list >; DomTreePredMap = iterator_property_map<__gnu_cxx::__normal_iterator >, adj_list_vertex_property_map >, int, int&, vertex_index_t> >; typename graph_traits::vertex_descriptor = void*]’ dominatorTree.cpp:46:36: required from here /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::BidirectionalIterator::~BidirectionalIterator() [with TT = __gnu_cxx::__normal_iterator > >]’ 37 | ~model() | ^ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:571:7: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 571 | BOOST_CONCEPT_USAGE(BidirectionalIterator) | ^~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::Comparable<__gnu_cxx::__normal_iterator > > >]’: /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements > > > >]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:253:5: required from ‘struct boost::Comparable<__gnu_cxx::__normal_iterator > > >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:597:3: required from ‘struct boost::RandomAccessIterator<__gnu_cxx::__normal_iterator > > >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:597:3: required from ‘struct boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator > > >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator > > >]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied > > > >::value’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied > > > >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_ > > >)>’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/property_map/property_map.hpp:354:5: required from ‘boost::iterator_property_map >::value_type, typename std::iterator_traits< >::reference> boost::make_iterator_property_map(RAIter, ID) [with RAIter = __gnu_cxx::__normal_iterator > >; ID = adj_list_vertex_property_map >, int, const int&, vertex_index_t>; typename std::iterator_traits< >::value_type = long unsigned int; typename std::iterator_traits< >::reference = long unsigned int&]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/dominator_tree.hpp:351:48: required from ‘void boost::lengauer_tarjan_dominator_tree(const Graph&, const typename graph_traits::vertex_descriptor&, DomTreePredMap) [with Graph = adjacency_list >; DomTreePredMap = iterator_property_map<__gnu_cxx::__normal_iterator >, adj_list_vertex_property_map >, int, int&, vertex_index_t> >; typename graph_traits::vertex_descriptor = void*]’ dominatorTree.cpp:46:36: required from here /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::Comparable::~Comparable() [with TT = __gnu_cxx::__normal_iterator > >]’ 37 | ~model() | ^ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:253:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 253 | BOOST_CONCEPT_USAGE(Comparable) { | ^~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::RandomAccessIterator<__gnu_cxx::__normal_iterator > > >]’: /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements > > > >]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:601:7: required from ‘struct boost::RandomAccessIterator<__gnu_cxx::__normal_iterator > > >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:597:3: required from ‘struct boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator > > >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator > > >]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied > > > >::value’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied > > > >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_ > > >)>’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/property_map/property_map.hpp:354:5: required from ‘boost::iterator_property_map >::value_type, typename std::iterator_traits< >::reference> boost::make_iterator_property_map(RAIter, ID) [with RAIter = __gnu_cxx::__normal_iterator > >; ID = adj_list_vertex_property_map >, int, const int&, vertex_index_t>; typename std::iterator_traits< >::value_type = long unsigned int; typename std::iterator_traits< >::reference = long unsigned int&]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/dominator_tree.hpp:351:48: required from ‘void boost::lengauer_tarjan_dominator_tree(const Graph&, const typename graph_traits::vertex_descriptor&, DomTreePredMap) [with Graph = adjacency_list >; DomTreePredMap = iterator_property_map<__gnu_cxx::__normal_iterator >, adj_list_vertex_property_map >, int, int&, vertex_index_t> >; typename graph_traits::vertex_descriptor = void*]’ dominatorTree.cpp:46:36: required from here /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::RandomAccessIterator::~RandomAccessIterator() [with TT = __gnu_cxx::__normal_iterator > >]’ 37 | ~model() | ^ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:601:7: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 601 | BOOST_CONCEPT_USAGE(RandomAccessIterator) | ^~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::concepts::Graph > >]’: /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements > > >]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/graph_concepts.hpp:66:5: required from ‘struct boost::concepts::Graph > >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/graph_concepts.hpp:75:1: required from ‘struct boost::concepts::IncidenceGraph > >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/graph_concepts.hpp:118:1: required from ‘struct boost::concepts::BidirectionalGraph > >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/graph_concepts.hpp:118:1: [ skipping 2 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied > > >::value’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied > > >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_ > >)>’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/dominator_tree.hpp:245:5: required from ‘void boost::lengauer_tarjan_dominator_tree(const Graph&, const typename graph_traits::vertex_descriptor&, const IndexMap&, TimeMap, PredMap, VertexVector&, DomTreePredMap) [with Graph = adjacency_list >; IndexMap = adj_list_vertex_property_map >, int, const int&, vertex_index_t>; TimeMap = iterator_property_map<__gnu_cxx::__normal_iterator > >, adj_list_vertex_property_map >, int, const int&, vertex_index_t>, long unsigned int, long unsigned int&>; PredMap = iterator_property_map<__gnu_cxx::__normal_iterator >, adj_list_vertex_property_map >, int, const int&, vertex_index_t>, void*, void*&>; VertexVector = std::vector; DomTreePredMap = iterator_property_map<__gnu_cxx::__normal_iterator >, adj_list_vertex_property_map >, int, int&, vertex_index_t> >; typename graph_traits::vertex_descriptor = void*]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/dominator_tree.hpp:360:35: required from ‘void boost::lengauer_tarjan_dominator_tree(const Graph&, const typename graph_traits::vertex_descriptor&, DomTreePredMap) [with Graph = adjacency_list >; DomTreePredMap = iterator_property_map<__gnu_cxx::__normal_iterator >, adj_list_vertex_property_map >, int, int&, vertex_index_t> >; typename graph_traits::vertex_descriptor = void*]’ dominatorTree.cpp:46:36: required from here /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::concepts::Graph::~Graph() [with G = boost::adjacency_list >]’ 37 | ~model() | ^ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/graph_concepts.hpp:66:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 66 | BOOST_CONCEPT_USAGE(Graph) | ^~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::concepts::IncidenceGraph > >]’: /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements > > >]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/graph_concepts.hpp:87:5: required from ‘struct boost::concepts::IncidenceGraph > >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/graph_concepts.hpp:118:1: required from ‘struct boost::concepts::BidirectionalGraph > >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/graph_concepts.hpp:118:1: required from ‘struct boost::concepts::BidirectionalGraphConcept > >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::concepts::BidirectionalGraphConcept > >]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied > > >::value’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied > > >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_ > >)>’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/dominator_tree.hpp:245:5: required from ‘void boost::lengauer_tarjan_dominator_tree(const Graph&, const typename graph_traits::vertex_descriptor&, const IndexMap&, TimeMap, PredMap, VertexVector&, DomTreePredMap) [with Graph = adjacency_list >; IndexMap = adj_list_vertex_property_map >, int, const int&, vertex_index_t>; TimeMap = iterator_property_map<__gnu_cxx::__normal_iterator > >, adj_list_vertex_property_map >, int, const int&, vertex_index_t>, long unsigned int, long unsigned int&>; PredMap = iterator_property_map<__gnu_cxx::__normal_iterator >, adj_list_vertex_property_map >, int, const int&, vertex_index_t>, void*, void*&>; VertexVector = std::vector; DomTreePredMap = iterator_property_map<__gnu_cxx::__normal_iterator >, adj_list_vertex_property_map >, int, int&, vertex_index_t> >; typename graph_traits::vertex_descriptor = void*]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/dominator_tree.hpp:360:35: required from ‘void boost::lengauer_tarjan_dominator_tree(const Graph&, const typename graph_traits::vertex_descriptor&, DomTreePredMap) [with Graph = adjacency_list >; DomTreePredMap = iterator_property_map<__gnu_cxx::__normal_iterator >, adj_list_vertex_property_map >, int, int&, vertex_index_t> >; typename graph_traits::vertex_descriptor = void*]’ dominatorTree.cpp:46:36: required from here /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::concepts::IncidenceGraph::~IncidenceGraph() [with G = boost::adjacency_list >]’ 37 | ~model() | ^ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/graph_concepts.hpp:87:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 87 | BOOST_CONCEPT_USAGE(IncidenceGraph) | ^~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::concepts::BidirectionalGraph > >]’: /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements > > >]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/graph_concepts.hpp:123:5: required from ‘struct boost::concepts::BidirectionalGraph > >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/graph_concepts.hpp:118:1: required from ‘struct boost::concepts::BidirectionalGraphConcept > >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::concepts::BidirectionalGraphConcept > >]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied > > >::value’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied > > >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_ > >)>’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/dominator_tree.hpp:245:5: required from ‘void boost::lengauer_tarjan_dominator_tree(const Graph&, const typename graph_traits::vertex_descriptor&, const IndexMap&, TimeMap, PredMap, VertexVector&, DomTreePredMap) [with Graph = adjacency_list >; IndexMap = adj_list_vertex_property_map >, int, const int&, vertex_index_t>; TimeMap = iterator_property_map<__gnu_cxx::__normal_iterator > >, adj_list_vertex_property_map >, int, const int&, vertex_index_t>, long unsigned int, long unsigned int&>; PredMap = iterator_property_map<__gnu_cxx::__normal_iterator >, adj_list_vertex_property_map >, int, const int&, vertex_index_t>, void*, void*&>; VertexVector = std::vector; DomTreePredMap = iterator_property_map<__gnu_cxx::__normal_iterator >, adj_list_vertex_property_map >, int, int&, vertex_index_t> >; typename graph_traits::vertex_descriptor = void*]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/dominator_tree.hpp:360:35: required from ‘void boost::lengauer_tarjan_dominator_tree(const Graph&, const typename graph_traits::vertex_descriptor&, DomTreePredMap) [with Graph = adjacency_list >; DomTreePredMap = iterator_property_map<__gnu_cxx::__normal_iterator >, adj_list_vertex_property_map >, int, int&, vertex_index_t> >; typename graph_traits::vertex_descriptor = void*]’ dominatorTree.cpp:46:36: required from here /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::concepts::BidirectionalGraph::~BidirectionalGraph() [with G = boost::adjacency_list >]’ 37 | ~model() | ^ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/graph_concepts.hpp:123:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 123 | BOOST_CONCEPT_USAGE(BidirectionalGraph) | ^~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements > > >]’: /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:145:5: required from ‘struct boost::Assignable<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:502:3: required from ‘struct boost::InputIterator<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:540:3: required from ‘struct boost::ForwardIterator<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:568:3: required from ‘struct boost::BidirectionalIterator<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:597:3: required from ‘struct boost::RandomAccessIterator<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:597:3: [ skipping 3 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied > > >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_ > >)>’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/property_map/property_map.hpp:354:5: required from ‘boost::iterator_property_map >::value_type, typename std::iterator_traits< >::reference> boost::make_iterator_property_map(RAIter, ID) [with RAIter = __gnu_cxx::__normal_iterator >; ID = adj_list_vertex_property_map >, int, const int&, vertex_index_t>; typename std::iterator_traits< >::value_type = default_color_type; typename std::iterator_traits< >::reference = default_color_type&]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/dominator_tree.hpp:314:35: required from ‘void boost::lengauer_tarjan_dominator_tree(const Graph&, const typename graph_traits::vertex_descriptor&, const IndexMap&, TimeMap, PredMap, VertexVector&, DomTreePredMap) [with Graph = adjacency_list >; IndexMap = adj_list_vertex_property_map >, int, const int&, vertex_index_t>; TimeMap = iterator_property_map<__gnu_cxx::__normal_iterator > >, adj_list_vertex_property_map >, int, const int&, vertex_index_t>, long unsigned int, long unsigned int&>; PredMap = iterator_property_map<__gnu_cxx::__normal_iterator >, adj_list_vertex_property_map >, int, const int&, vertex_index_t>, void*, void*&>; VertexVector = std::vector; DomTreePredMap = iterator_property_map<__gnu_cxx::__normal_iterator >, adj_list_vertex_property_map >, int, int&, vertex_index_t> >; typename graph_traits::vertex_descriptor = void*]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/dominator_tree.hpp:360:35: required from ‘void boost::lengauer_tarjan_dominator_tree(const Graph&, const typename graph_traits::vertex_descriptor&, DomTreePredMap) [with Graph = adjacency_list >; DomTreePredMap = iterator_property_map<__gnu_cxx::__normal_iterator >, adj_list_vertex_property_map >, int, int&, vertex_index_t> >; typename graph_traits::vertex_descriptor = void*]’ dominatorTree.cpp:46:36: required from here /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::Assignable<__gnu_cxx::__normal_iterator > >]’ 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ^ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements > > >]’: /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:233:5: required from ‘struct boost::EqualityComparable<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:502:3: required from ‘struct boost::InputIterator<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:540:3: required from ‘struct boost::ForwardIterator<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:568:3: required from ‘struct boost::BidirectionalIterator<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:597:3: required from ‘struct boost::RandomAccessIterator<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:597:3: [ skipping 3 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied > > >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_ > >)>’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/property_map/property_map.hpp:354:5: required from ‘boost::iterator_property_map >::value_type, typename std::iterator_traits< >::reference> boost::make_iterator_property_map(RAIter, ID) [with RAIter = __gnu_cxx::__normal_iterator >; ID = adj_list_vertex_property_map >, int, const int&, vertex_index_t>; typename std::iterator_traits< >::value_type = default_color_type; typename std::iterator_traits< >::reference = default_color_type&]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/dominator_tree.hpp:314:35: required from ‘void boost::lengauer_tarjan_dominator_tree(const Graph&, const typename graph_traits::vertex_descriptor&, const IndexMap&, TimeMap, PredMap, VertexVector&, DomTreePredMap) [with Graph = adjacency_list >; IndexMap = adj_list_vertex_property_map >, int, const int&, vertex_index_t>; TimeMap = iterator_property_map<__gnu_cxx::__normal_iterator > >, adj_list_vertex_property_map >, int, const int&, vertex_index_t>, long unsigned int, long unsigned int&>; PredMap = iterator_property_map<__gnu_cxx::__normal_iterator >, adj_list_vertex_property_map >, int, const int&, vertex_index_t>, void*, void*&>; VertexVector = std::vector; DomTreePredMap = iterator_property_map<__gnu_cxx::__normal_iterator >, adj_list_vertex_property_map >, int, int&, vertex_index_t> >; typename graph_traits::vertex_descriptor = void*]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/dominator_tree.hpp:360:35: required from ‘void boost::lengauer_tarjan_dominator_tree(const Graph&, const typename graph_traits::vertex_descriptor&, DomTreePredMap) [with Graph = adjacency_list >; DomTreePredMap = iterator_property_map<__gnu_cxx::__normal_iterator >, adj_list_vertex_property_map >, int, int&, vertex_index_t> >; typename graph_traits::vertex_descriptor = void*]’ dominatorTree.cpp:46:36: required from here /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::EqualityComparable<__gnu_cxx::__normal_iterator > >]’ 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ^ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements > > >]’: /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:512:7: required from ‘struct boost::InputIterator<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:540:3: required from ‘struct boost::ForwardIterator<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:568:3: required from ‘struct boost::BidirectionalIterator<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:597:3: required from ‘struct boost::RandomAccessIterator<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:597:3: required from ‘struct boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:32:62: [ skipping 2 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied > > >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_ > >)>’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/property_map/property_map.hpp:354:5: required from ‘boost::iterator_property_map >::value_type, typename std::iterator_traits< >::reference> boost::make_iterator_property_map(RAIter, ID) [with RAIter = __gnu_cxx::__normal_iterator >; ID = adj_list_vertex_property_map >, int, const int&, vertex_index_t>; typename std::iterator_traits< >::value_type = default_color_type; typename std::iterator_traits< >::reference = default_color_type&]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/dominator_tree.hpp:314:35: required from ‘void boost::lengauer_tarjan_dominator_tree(const Graph&, const typename graph_traits::vertex_descriptor&, const IndexMap&, TimeMap, PredMap, VertexVector&, DomTreePredMap) [with Graph = adjacency_list >; IndexMap = adj_list_vertex_property_map >, int, const int&, vertex_index_t>; TimeMap = iterator_property_map<__gnu_cxx::__normal_iterator > >, adj_list_vertex_property_map >, int, const int&, vertex_index_t>, long unsigned int, long unsigned int&>; PredMap = iterator_property_map<__gnu_cxx::__normal_iterator >, adj_list_vertex_property_map >, int, const int&, vertex_index_t>, void*, void*&>; VertexVector = std::vector; DomTreePredMap = iterator_property_map<__gnu_cxx::__normal_iterator >, adj_list_vertex_property_map >, int, int&, vertex_index_t> >; typename graph_traits::vertex_descriptor = void*]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/dominator_tree.hpp:360:35: required from ‘void boost::lengauer_tarjan_dominator_tree(const Graph&, const typename graph_traits::vertex_descriptor&, DomTreePredMap) [with Graph = adjacency_list >; DomTreePredMap = iterator_property_map<__gnu_cxx::__normal_iterator >, adj_list_vertex_property_map >, int, int&, vertex_index_t> >; typename graph_traits::vertex_descriptor = void*]’ dominatorTree.cpp:46:36: required from here /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::InputIterator<__gnu_cxx::__normal_iterator > >]’ 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ^ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements > > >]’: /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:543:7: required from ‘struct boost::ForwardIterator<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:568:3: required from ‘struct boost::BidirectionalIterator<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:597:3: required from ‘struct boost::RandomAccessIterator<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:597:3: required from ‘struct boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:32:62: [ skipping 2 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied > > >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_ > >)>’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/property_map/property_map.hpp:354:5: required from ‘boost::iterator_property_map >::value_type, typename std::iterator_traits< >::reference> boost::make_iterator_property_map(RAIter, ID) [with RAIter = __gnu_cxx::__normal_iterator >; ID = adj_list_vertex_property_map >, int, const int&, vertex_index_t>; typename std::iterator_traits< >::value_type = default_color_type; typename std::iterator_traits< >::reference = default_color_type&]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/dominator_tree.hpp:314:35: required from ‘void boost::lengauer_tarjan_dominator_tree(const Graph&, const typename graph_traits::vertex_descriptor&, const IndexMap&, TimeMap, PredMap, VertexVector&, DomTreePredMap) [with Graph = adjacency_list >; IndexMap = adj_list_vertex_property_map >, int, const int&, vertex_index_t>; TimeMap = iterator_property_map<__gnu_cxx::__normal_iterator > >, adj_list_vertex_property_map >, int, const int&, vertex_index_t>, long unsigned int, long unsigned int&>; PredMap = iterator_property_map<__gnu_cxx::__normal_iterator >, adj_list_vertex_property_map >, int, const int&, vertex_index_t>, void*, void*&>; VertexVector = std::vector; DomTreePredMap = iterator_property_map<__gnu_cxx::__normal_iterator >, adj_list_vertex_property_map >, int, int&, vertex_index_t> >; typename graph_traits::vertex_descriptor = void*]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/dominator_tree.hpp:360:35: required from ‘void boost::lengauer_tarjan_dominator_tree(const Graph&, const typename graph_traits::vertex_descriptor&, DomTreePredMap) [with Graph = adjacency_list >; DomTreePredMap = iterator_property_map<__gnu_cxx::__normal_iterator >, adj_list_vertex_property_map >, int, int&, vertex_index_t> >; typename graph_traits::vertex_descriptor = void*]’ dominatorTree.cpp:46:36: required from here /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::ForwardIterator<__gnu_cxx::__normal_iterator > >]’ 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ^ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements > > >]’: /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:571:7: required from ‘struct boost::BidirectionalIterator<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:597:3: required from ‘struct boost::RandomAccessIterator<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:597:3: required from ‘struct boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator > >]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied > > >::value’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied > > >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_ > >)>’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/property_map/property_map.hpp:354:5: required from ‘boost::iterator_property_map >::value_type, typename std::iterator_traits< >::reference> boost::make_iterator_property_map(RAIter, ID) [with RAIter = __gnu_cxx::__normal_iterator >; ID = adj_list_vertex_property_map >, int, const int&, vertex_index_t>; typename std::iterator_traits< >::value_type = default_color_type; typename std::iterator_traits< >::reference = default_color_type&]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/dominator_tree.hpp:314:35: required from ‘void boost::lengauer_tarjan_dominator_tree(const Graph&, const typename graph_traits::vertex_descriptor&, const IndexMap&, TimeMap, PredMap, VertexVector&, DomTreePredMap) [with Graph = adjacency_list >; IndexMap = adj_list_vertex_property_map >, int, const int&, vertex_index_t>; TimeMap = iterator_property_map<__gnu_cxx::__normal_iterator > >, adj_list_vertex_property_map >, int, const int&, vertex_index_t>, long unsigned int, long unsigned int&>; PredMap = iterator_property_map<__gnu_cxx::__normal_iterator >, adj_list_vertex_property_map >, int, const int&, vertex_index_t>, void*, void*&>; VertexVector = std::vector; DomTreePredMap = iterator_property_map<__gnu_cxx::__normal_iterator >, adj_list_vertex_property_map >, int, int&, vertex_index_t> >; typename graph_traits::vertex_descriptor = void*]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/dominator_tree.hpp:360:35: required from ‘void boost::lengauer_tarjan_dominator_tree(const Graph&, const typename graph_traits::vertex_descriptor&, DomTreePredMap) [with Graph = adjacency_list >; DomTreePredMap = iterator_property_map<__gnu_cxx::__normal_iterator >, adj_list_vertex_property_map >, int, int&, vertex_index_t> >; typename graph_traits::vertex_descriptor = void*]’ dominatorTree.cpp:46:36: required from here /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::BidirectionalIterator<__gnu_cxx::__normal_iterator > >]’ 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ^ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements > > >]’: /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:253:5: required from ‘struct boost::Comparable<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:597:3: required from ‘struct boost::RandomAccessIterator<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:597:3: required from ‘struct boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator > >]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied > > >::value’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied > > >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_ > >)>’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/property_map/property_map.hpp:354:5: required from ‘boost::iterator_property_map >::value_type, typename std::iterator_traits< >::reference> boost::make_iterator_property_map(RAIter, ID) [with RAIter = __gnu_cxx::__normal_iterator >; ID = adj_list_vertex_property_map >, int, const int&, vertex_index_t>; typename std::iterator_traits< >::value_type = default_color_type; typename std::iterator_traits< >::reference = default_color_type&]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/dominator_tree.hpp:314:35: required from ‘void boost::lengauer_tarjan_dominator_tree(const Graph&, const typename graph_traits::vertex_descriptor&, const IndexMap&, TimeMap, PredMap, VertexVector&, DomTreePredMap) [with Graph = adjacency_list >; IndexMap = adj_list_vertex_property_map >, int, const int&, vertex_index_t>; TimeMap = iterator_property_map<__gnu_cxx::__normal_iterator > >, adj_list_vertex_property_map >, int, const int&, vertex_index_t>, long unsigned int, long unsigned int&>; PredMap = iterator_property_map<__gnu_cxx::__normal_iterator >, adj_list_vertex_property_map >, int, const int&, vertex_index_t>, void*, void*&>; VertexVector = std::vector; DomTreePredMap = iterator_property_map<__gnu_cxx::__normal_iterator >, adj_list_vertex_property_map >, int, int&, vertex_index_t> >; typename graph_traits::vertex_descriptor = void*]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/dominator_tree.hpp:360:35: required from ‘void boost::lengauer_tarjan_dominator_tree(const Graph&, const typename graph_traits::vertex_descriptor&, DomTreePredMap) [with Graph = adjacency_list >; DomTreePredMap = iterator_property_map<__gnu_cxx::__normal_iterator >, adj_list_vertex_property_map >, int, int&, vertex_index_t> >; typename graph_traits::vertex_descriptor = void*]’ dominatorTree.cpp:46:36: required from here /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::Comparable<__gnu_cxx::__normal_iterator > >]’ 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ^ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements > > >]’: /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:601:7: required from ‘struct boost::RandomAccessIterator<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:597:3: required from ‘struct boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator > >]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied > > >::value’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied > > >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_ > >)>’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/property_map/property_map.hpp:354:5: required from ‘boost::iterator_property_map >::value_type, typename std::iterator_traits< >::reference> boost::make_iterator_property_map(RAIter, ID) [with RAIter = __gnu_cxx::__normal_iterator >; ID = adj_list_vertex_property_map >, int, const int&, vertex_index_t>; typename std::iterator_traits< >::value_type = default_color_type; typename std::iterator_traits< >::reference = default_color_type&]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/dominator_tree.hpp:314:35: required from ‘void boost::lengauer_tarjan_dominator_tree(const Graph&, const typename graph_traits::vertex_descriptor&, const IndexMap&, TimeMap, PredMap, VertexVector&, DomTreePredMap) [with Graph = adjacency_list >; IndexMap = adj_list_vertex_property_map >, int, const int&, vertex_index_t>; TimeMap = iterator_property_map<__gnu_cxx::__normal_iterator > >, adj_list_vertex_property_map >, int, const int&, vertex_index_t>, long unsigned int, long unsigned int&>; PredMap = iterator_property_map<__gnu_cxx::__normal_iterator >, adj_list_vertex_property_map >, int, const int&, vertex_index_t>, void*, void*&>; VertexVector = std::vector; DomTreePredMap = iterator_property_map<__gnu_cxx::__normal_iterator >, adj_list_vertex_property_map >, int, int&, vertex_index_t> >; typename graph_traits::vertex_descriptor = void*]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/dominator_tree.hpp:360:35: required from ‘void boost::lengauer_tarjan_dominator_tree(const Graph&, const typename graph_traits::vertex_descriptor&, DomTreePredMap) [with Graph = adjacency_list >; DomTreePredMap = iterator_property_map<__gnu_cxx::__normal_iterator >, adj_list_vertex_property_map >, int, int&, vertex_index_t> >; typename graph_traits::vertex_descriptor = void*]’ dominatorTree.cpp:46:36: required from here /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::RandomAccessIterator<__gnu_cxx::__normal_iterator > >]’ 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ^ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator > >]’: /home/omnipath/local/R/4.4-3.20/BH/include/boost/property_map/property_map.hpp:354:5: required from ‘boost::iterator_property_map >::value_type, typename std::iterator_traits< >::reference> boost::make_iterator_property_map(RAIter, ID) [with RAIter = __gnu_cxx::__normal_iterator >; ID = adj_list_vertex_property_map >, int, const int&, vertex_index_t>; typename std::iterator_traits< >::value_type = default_color_type; typename std::iterator_traits< >::reference = default_color_type&]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/dominator_tree.hpp:314:35: required from ‘void boost::lengauer_tarjan_dominator_tree(const Graph&, const typename graph_traits::vertex_descriptor&, const IndexMap&, TimeMap, PredMap, VertexVector&, DomTreePredMap) [with Graph = adjacency_list >; IndexMap = adj_list_vertex_property_map >, int, const int&, vertex_index_t>; TimeMap = iterator_property_map<__gnu_cxx::__normal_iterator > >, adj_list_vertex_property_map >, int, const int&, vertex_index_t>, long unsigned int, long unsigned int&>; PredMap = iterator_property_map<__gnu_cxx::__normal_iterator >, adj_list_vertex_property_map >, int, const int&, vertex_index_t>, void*, void*&>; VertexVector = std::vector; DomTreePredMap = iterator_property_map<__gnu_cxx::__normal_iterator >, adj_list_vertex_property_map >, int, int&, vertex_index_t> >; typename graph_traits::vertex_descriptor = void*]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/dominator_tree.hpp:360:35: required from ‘void boost::lengauer_tarjan_dominator_tree(const Graph&, const typename graph_traits::vertex_descriptor&, DomTreePredMap) [with Graph = adjacency_list >; DomTreePredMap = iterator_property_map<__gnu_cxx::__normal_iterator >, adj_list_vertex_property_map >, int, int&, vertex_index_t> >; typename graph_traits::vertex_descriptor = void*]’ dominatorTree.cpp:46:36: required from here /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:597:17: note: in a call to non-static member function ‘boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator > >::~RandomAccessIteratorConcept()’ 597 | BOOST_concept(RandomAccessIterator,(TT)) | ^~~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/preprocessor/cat.hpp:29:34: note: in definition of macro ‘BOOST_PP_CAT_I’ 29 | # define BOOST_PP_CAT_I(a, b) a ## b | ^ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/concept_def.hpp:23:12: note: in expansion of macro ‘BOOST_PP_CAT’ 23 | struct BOOST_PP_CAT(name,Concept) \ | ^~~~~~~~~~~~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:597:3: note: in expansion of macro ‘BOOST_concept’ 597 | BOOST_concept(RandomAccessIterator,(TT)) | ^~~~~~~~~~~~~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::SignedInteger]’: /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:514:9: required from ‘boost::InputIterator::~InputIterator() [with TT = __gnu_cxx::__normal_iterator >]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/usage.hpp:20:48: required from ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::InputIterator<__gnu_cxx::__normal_iterator > >]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements > > >]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:512:7: required from ‘struct boost::InputIterator<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:540:3: required from ‘struct boost::ForwardIterator<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:568:3: [ skipping 3 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator > >]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied > > >::value’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied > > >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_ > >)>’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/property_map/property_map.hpp:354:5: required from ‘boost::iterator_property_map >::value_type, typename std::iterator_traits< >::reference> boost::make_iterator_property_map(RAIter, ID) [with RAIter = __gnu_cxx::__normal_iterator >; ID = adj_list_vertex_property_map >, int, int&, vertex_index_t>; typename std::iterator_traits< >::value_type = void*; typename std::iterator_traits< >::reference = void*&]’ dominatorTree.cpp:44:40: required from here /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:107:22: note: in a call to non-static member function ‘boost::SignedInteger::~SignedInteger()’ 107 | template <> struct SignedInteger {}; | ^~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements >]’: /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:208:5: required from ‘struct boost::Convertible’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::Convertible]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied >::value’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_)>’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:515:9: [ skipping 8 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator > >]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied > > >::value’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied > > >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_ > >)>’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/property_map/property_map.hpp:354:5: required from ‘boost::iterator_property_map >::value_type, typename std::iterator_traits< >::reference> boost::make_iterator_property_map(RAIter, ID) [with RAIter = __gnu_cxx::__normal_iterator >; ID = adj_list_vertex_property_map >, int, int&, vertex_index_t>; typename std::iterator_traits< >::value_type = void*; typename std::iterator_traits< >::reference = void*&]’ dominatorTree.cpp:44:40: required from here /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::Convertible]’ 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ^ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::Convertible]’: /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:515:9: required from ‘boost::InputIterator::~InputIterator() [with TT = __gnu_cxx::__normal_iterator >]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/usage.hpp:20:48: required from ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::InputIterator<__gnu_cxx::__normal_iterator > >]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements > > >]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:512:7: required from ‘struct boost::InputIterator<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:540:3: required from ‘struct boost::ForwardIterator<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:568:3: [ skipping 3 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator > >]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied > > >::value’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied > > >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_ > >)>’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/property_map/property_map.hpp:354:5: required from ‘boost::iterator_property_map >::value_type, typename std::iterator_traits< >::reference> boost::make_iterator_property_map(RAIter, ID) [with RAIter = __gnu_cxx::__normal_iterator >; ID = adj_list_vertex_property_map >, int, int&, vertex_index_t>; typename std::iterator_traits< >::value_type = void*; typename std::iterator_traits< >::reference = void*&]’ dominatorTree.cpp:44:40: required from here /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::Convertible::~Convertible() [with X = std::random_access_iterator_tag; Y = std::input_iterator_tag]’ 37 | ~model() | ^ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:208:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 208 | BOOST_CONCEPT_USAGE(Convertible) { | ^~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements >]’: /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:208:5: required from ‘struct boost::Convertible’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::Convertible]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied >::value’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_)>’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:545:11: [ skipping 7 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator > >]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied > > >::value’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied > > >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_ > >)>’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/property_map/property_map.hpp:354:5: required from ‘boost::iterator_property_map >::value_type, typename std::iterator_traits< >::reference> boost::make_iterator_property_map(RAIter, ID) [with RAIter = __gnu_cxx::__normal_iterator >; ID = adj_list_vertex_property_map >, int, int&, vertex_index_t>; typename std::iterator_traits< >::value_type = void*; typename std::iterator_traits< >::reference = void*&]’ dominatorTree.cpp:44:40: required from here /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::Convertible]’ 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ^ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::Convertible]’: /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:545:11: required from ‘boost::ForwardIterator::~ForwardIterator() [with TT = __gnu_cxx::__normal_iterator >]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/usage.hpp:20:48: required from ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::ForwardIterator<__gnu_cxx::__normal_iterator > >]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements > > >]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:543:7: required from ‘struct boost::ForwardIterator<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:568:3: required from ‘struct boost::BidirectionalIterator<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:597:3: [ skipping 2 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator > >]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied > > >::value’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied > > >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_ > >)>’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/property_map/property_map.hpp:354:5: required from ‘boost::iterator_property_map >::value_type, typename std::iterator_traits< >::reference> boost::make_iterator_property_map(RAIter, ID) [with RAIter = __gnu_cxx::__normal_iterator >; ID = adj_list_vertex_property_map >, int, int&, vertex_index_t>; typename std::iterator_traits< >::value_type = void*; typename std::iterator_traits< >::reference = void*&]’ dominatorTree.cpp:44:40: required from here /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::Convertible::~Convertible() [with X = std::random_access_iterator_tag; Y = std::forward_iterator_tag]’ 37 | ~model() | ^ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:208:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 208 | BOOST_CONCEPT_USAGE(Convertible) { | ^~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements >]’: /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:208:5: required from ‘struct boost::Convertible’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::Convertible]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied >::value’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_)>’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:573:11: [ skipping 6 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator > >]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied > > >::value’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied > > >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_ > >)>’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/property_map/property_map.hpp:354:5: required from ‘boost::iterator_property_map >::value_type, typename std::iterator_traits< >::reference> boost::make_iterator_property_map(RAIter, ID) [with RAIter = __gnu_cxx::__normal_iterator >; ID = adj_list_vertex_property_map >, int, int&, vertex_index_t>; typename std::iterator_traits< >::value_type = void*; typename std::iterator_traits< >::reference = void*&]’ dominatorTree.cpp:44:40: required from here /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::Convertible]’ 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ^ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::Convertible]’: /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:573:11: required from ‘boost::BidirectionalIterator::~BidirectionalIterator() [with TT = __gnu_cxx::__normal_iterator >]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/usage.hpp:20:48: required from ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::BidirectionalIterator<__gnu_cxx::__normal_iterator > >]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements > > >]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:571:7: required from ‘struct boost::BidirectionalIterator<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:597:3: [ skipping 2 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator > >]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied > > >::value’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied > > >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_ > >)>’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/property_map/property_map.hpp:354:5: required from ‘boost::iterator_property_map >::value_type, typename std::iterator_traits< >::reference> boost::make_iterator_property_map(RAIter, ID) [with RAIter = __gnu_cxx::__normal_iterator >; ID = adj_list_vertex_property_map >, int, int&, vertex_index_t>; typename std::iterator_traits< >::value_type = void*; typename std::iterator_traits< >::reference = void*&]’ dominatorTree.cpp:44:40: required from here /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::Convertible::~Convertible() [with X = std::random_access_iterator_tag; Y = std::bidirectional_iterator_tag]’ 37 | ~model() | ^ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:208:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 208 | BOOST_CONCEPT_USAGE(Convertible) { | ^~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::Convertible]’: /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements >]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:208:5: required from ‘struct boost::Convertible’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::Convertible]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied >::value’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_)>’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:603:11: required from ‘boost::RandomAccessIterator::~RandomAccessIterator() [with TT = __gnu_cxx::__normal_iterator >]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:597:3: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator > >]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/property_map/property_map.hpp:354:5: required from ‘boost::iterator_property_map >::value_type, typename std::iterator_traits< >::reference> boost::make_iterator_property_map(RAIter, ID) [with RAIter = __gnu_cxx::__normal_iterator >; ID = adj_list_vertex_property_map >, int, int&, vertex_index_t>; typename std::iterator_traits< >::value_type = void*; typename std::iterator_traits< >::reference = void*&]’ dominatorTree.cpp:44:40: required from here /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::Convertible::~Convertible() [with X = std::random_access_iterator_tag; Y = std::random_access_iterator_tag]’ 37 | ~model() | ^ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:208:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 208 | BOOST_CONCEPT_USAGE(Convertible) { | ^~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements >, boost::no_property>*, std::vector >, boost::no_property>, std::allocator >, boost::no_property> > > >, void*, boost::detail::edge_desc_impl, long int> > >]’: /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/graph_concepts.hpp:52:50: required from ‘struct boost::concepts::MultiPassInputIterator >, boost::no_property>*, std::vector >, boost::no_property>, std::allocator >, boost::no_property> > > >, void*, boost::detail::edge_desc_impl, long int> >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::concepts::MultiPassInputIterator >, boost::no_property>*, std::vector >, boost::no_property>, std::allocator >, boost::no_property> > > >, void*, boost::detail::edge_desc_impl, long int> >]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied >, boost::no_property>*, std::vector >, boost::no_property>, std::allocator >, boost::no_property> > > >, void*, boost::detail::edge_desc_impl, long int> > >::value’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied >, boost::no_property>*, std::vector >, boost::no_property>, std::allocator >, boost::no_property> > > >, void*, boost::detail::edge_desc_impl, long int> > >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_ >, boost::no_property>*, std::vector >, boost::no_property>, std::allocator >, boost::no_property> > > >, void*, boost::detail::edge_desc_impl, long int> >)>’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/graph_concepts.hpp:125:9: required from ‘boost::concepts::BidirectionalGraph::~BidirectionalGraph() [with G = boost::adjacency_list >]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/graph_concepts.hpp:118:1: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::BidirectionalGraphConcept > >]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/dominator_tree.hpp:245:5: required from ‘void boost::lengauer_tarjan_dominator_tree(const Graph&, const typename graph_traits::vertex_descriptor&, const IndexMap&, TimeMap, PredMap, VertexVector&, DomTreePredMap) [with Graph = adjacency_list >; IndexMap = adj_list_vertex_property_map >, int, const int&, vertex_index_t>; TimeMap = iterator_property_map<__gnu_cxx::__normal_iterator > >, adj_list_vertex_property_map >, int, const int&, vertex_index_t>, long unsigned int, long unsigned int&>; PredMap = iterator_property_map<__gnu_cxx::__normal_iterator >, adj_list_vertex_property_map >, int, const int&, vertex_index_t>, void*, void*&>; VertexVector = std::vector; DomTreePredMap = iterator_property_map<__gnu_cxx::__normal_iterator >, adj_list_vertex_property_map >, int, int&, vertex_index_t> >; typename graph_traits::vertex_descriptor = void*]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/dominator_tree.hpp:360:35: required from ‘void boost::lengauer_tarjan_dominator_tree(const Graph&, const typename graph_traits::vertex_descriptor&, DomTreePredMap) [with Graph = adjacency_list >; DomTreePredMap = iterator_property_map<__gnu_cxx::__normal_iterator >, adj_list_vertex_property_map >, int, int&, vertex_index_t> >; typename graph_traits::vertex_descriptor = void*]’ dominatorTree.cpp:46:36: required from here /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::concepts::MultiPassInputIterator >, boost::no_property>*, std::vector >, boost::no_property>, std::allocator >, boost::no_property> > > >, void*, boost::detail::edge_desc_impl, long int> >]’ 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ^ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::MultiPassInputIterator >, boost::no_property>*, std::vector >, boost::no_property>, std::allocator >, boost::no_property> > > >, void*, boost::detail::edge_desc_impl, long int> >]’: /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/graph_concepts.hpp:125:9: required from ‘boost::concepts::BidirectionalGraph::~BidirectionalGraph() [with G = boost::adjacency_list >]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/graph_concepts.hpp:118:1: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::BidirectionalGraphConcept > >]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/dominator_tree.hpp:245:5: required from ‘void boost::lengauer_tarjan_dominator_tree(const Graph&, const typename graph_traits::vertex_descriptor&, const IndexMap&, TimeMap, PredMap, VertexVector&, DomTreePredMap) [with Graph = adjacency_list >; IndexMap = adj_list_vertex_property_map >, int, const int&, vertex_index_t>; TimeMap = iterator_property_map<__gnu_cxx::__normal_iterator > >, adj_list_vertex_property_map >, int, const int&, vertex_index_t>, long unsigned int, long unsigned int&>; PredMap = iterator_property_map<__gnu_cxx::__normal_iterator >, adj_list_vertex_property_map >, int, const int&, vertex_index_t>, void*, void*&>; VertexVector = std::vector; DomTreePredMap = iterator_property_map<__gnu_cxx::__normal_iterator >, adj_list_vertex_property_map >, int, int&, vertex_index_t> >; typename graph_traits::vertex_descriptor = void*]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/dominator_tree.hpp:360:35: required from ‘void boost::lengauer_tarjan_dominator_tree(const Graph&, const typename graph_traits::vertex_descriptor&, DomTreePredMap) [with Graph = adjacency_list >; DomTreePredMap = iterator_property_map<__gnu_cxx::__normal_iterator >, adj_list_vertex_property_map >, int, int&, vertex_index_t> >; typename graph_traits::vertex_descriptor = void*]’ dominatorTree.cpp:46:36: required from here /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::concepts::MultiPassInputIterator::~MultiPassInputIterator() [with T = boost::detail::in_edge_iter<__gnu_cxx::__normal_iterator >, boost::no_property>*, std::vector >, boost::no_property>, std::allocator >, boost::no_property> > > >, void*, boost::detail::edge_desc_impl, long int>]’ 37 | ~model() | ^ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/graph_concepts.hpp:52:50: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 52 | BOOST_concept(MultiPassInputIterator, (T)) { BOOST_CONCEPT_USAGE( | ^~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements >]’: /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:208:5: required from ‘struct boost::Convertible’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::Convertible]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied >::value’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_)>’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/graph_concepts.hpp:126:9: required from ‘boost::concepts::BidirectionalGraph::~BidirectionalGraph() [with G = boost::adjacency_list >]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/graph_concepts.hpp:118:1: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::BidirectionalGraphConcept > >]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/dominator_tree.hpp:245:5: required from ‘void boost::lengauer_tarjan_dominator_tree(const Graph&, const typename graph_traits::vertex_descriptor&, const IndexMap&, TimeMap, PredMap, VertexVector&, DomTreePredMap) [with Graph = adjacency_list >; IndexMap = adj_list_vertex_property_map >, int, const int&, vertex_index_t>; TimeMap = iterator_property_map<__gnu_cxx::__normal_iterator > >, adj_list_vertex_property_map >, int, const int&, vertex_index_t>, long unsigned int, long unsigned int&>; PredMap = iterator_property_map<__gnu_cxx::__normal_iterator >, adj_list_vertex_property_map >, int, const int&, vertex_index_t>, void*, void*&>; VertexVector = std::vector; DomTreePredMap = iterator_property_map<__gnu_cxx::__normal_iterator >, adj_list_vertex_property_map >, int, int&, vertex_index_t> >; typename graph_traits::vertex_descriptor = void*]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/dominator_tree.hpp:360:35: required from ‘void boost::lengauer_tarjan_dominator_tree(const Graph&, const typename graph_traits::vertex_descriptor&, DomTreePredMap) [with Graph = adjacency_list >; DomTreePredMap = iterator_property_map<__gnu_cxx::__normal_iterator >, adj_list_vertex_property_map >, int, int&, vertex_index_t> >; typename graph_traits::vertex_descriptor = void*]’ dominatorTree.cpp:46:36: required from here /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::Convertible]’ 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ^ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::Convertible]’: /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/graph_concepts.hpp:126:9: required from ‘boost::concepts::BidirectionalGraph::~BidirectionalGraph() [with G = boost::adjacency_list >]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/graph_concepts.hpp:118:1: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::BidirectionalGraphConcept > >]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/dominator_tree.hpp:245:5: required from ‘void boost::lengauer_tarjan_dominator_tree(const Graph&, const typename graph_traits::vertex_descriptor&, const IndexMap&, TimeMap, PredMap, VertexVector&, DomTreePredMap) [with Graph = adjacency_list >; IndexMap = adj_list_vertex_property_map >, int, const int&, vertex_index_t>; TimeMap = iterator_property_map<__gnu_cxx::__normal_iterator > >, adj_list_vertex_property_map >, int, const int&, vertex_index_t>, long unsigned int, long unsigned int&>; PredMap = iterator_property_map<__gnu_cxx::__normal_iterator >, adj_list_vertex_property_map >, int, const int&, vertex_index_t>, void*, void*&>; VertexVector = std::vector; DomTreePredMap = iterator_property_map<__gnu_cxx::__normal_iterator >, adj_list_vertex_property_map >, int, int&, vertex_index_t> >; typename graph_traits::vertex_descriptor = void*]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/dominator_tree.hpp:360:35: required from ‘void boost::lengauer_tarjan_dominator_tree(const Graph&, const typename graph_traits::vertex_descriptor&, DomTreePredMap) [with Graph = adjacency_list >; DomTreePredMap = iterator_property_map<__gnu_cxx::__normal_iterator >, adj_list_vertex_property_map >, int, int&, vertex_index_t> >; typename graph_traits::vertex_descriptor = void*]’ dominatorTree.cpp:46:36: required from here /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::Convertible::~Convertible() [with X = boost::bidir_adj_list_traversal_tag; Y = boost::bidirectional_graph_tag]’ 37 | ~model() | ^ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:208:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 208 | BOOST_CONCEPT_USAGE(Convertible) { | ^~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::Assignable<__gnu_cxx::__normal_iterator > >]’: /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements > > >]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:145:5: required from ‘struct boost::Assignable<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:502:3: required from ‘struct boost::InputIterator<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:540:3: required from ‘struct boost::ForwardIterator<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:568:3: required from ‘struct boost::BidirectionalIterator<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:597:3: [ skipping 4 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied > > >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_ > >)>’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/property_map/property_map.hpp:354:5: required from ‘boost::iterator_property_map >::value_type, typename std::iterator_traits< >::reference> boost::make_iterator_property_map(RAIter, ID) [with RAIter = __gnu_cxx::__normal_iterator >; ID = adj_list_vertex_property_map >, int, const int&, vertex_index_t>; typename std::iterator_traits< >::value_type = default_color_type; typename std::iterator_traits< >::reference = default_color_type&]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/dominator_tree.hpp:314:35: required from ‘void boost::lengauer_tarjan_dominator_tree(const Graph&, const typename graph_traits::vertex_descriptor&, const IndexMap&, TimeMap, PredMap, VertexVector&, DomTreePredMap) [with Graph = adjacency_list >; IndexMap = adj_list_vertex_property_map >, int, const int&, vertex_index_t>; TimeMap = iterator_property_map<__gnu_cxx::__normal_iterator > >, adj_list_vertex_property_map >, int, const int&, vertex_index_t>, long unsigned int, long unsigned int&>; PredMap = iterator_property_map<__gnu_cxx::__normal_iterator >, adj_list_vertex_property_map >, int, const int&, vertex_index_t>, void*, void*&>; VertexVector = std::vector; DomTreePredMap = iterator_property_map<__gnu_cxx::__normal_iterator >, adj_list_vertex_property_map >, int, int&, vertex_index_t> >; typename graph_traits::vertex_descriptor = void*]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/dominator_tree.hpp:360:35: required from ‘void boost::lengauer_tarjan_dominator_tree(const Graph&, const typename graph_traits::vertex_descriptor&, DomTreePredMap) [with Graph = adjacency_list >; DomTreePredMap = iterator_property_map<__gnu_cxx::__normal_iterator >, adj_list_vertex_property_map >, int, int&, vertex_index_t> >; typename graph_traits::vertex_descriptor = void*]’ dominatorTree.cpp:46:36: required from here /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::Assignable::~Assignable() [with TT = __gnu_cxx::__normal_iterator >]’ 37 | ~model() | ^ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:145:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 145 | BOOST_CONCEPT_USAGE(Assignable) { | ^~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::EqualityComparable<__gnu_cxx::__normal_iterator > >]’: /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements > > >]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:233:5: required from ‘struct boost::EqualityComparable<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:502:3: required from ‘struct boost::InputIterator<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:540:3: required from ‘struct boost::ForwardIterator<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:568:3: required from ‘struct boost::BidirectionalIterator<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:597:3: [ skipping 4 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied > > >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_ > >)>’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/property_map/property_map.hpp:354:5: required from ‘boost::iterator_property_map >::value_type, typename std::iterator_traits< >::reference> boost::make_iterator_property_map(RAIter, ID) [with RAIter = __gnu_cxx::__normal_iterator >; ID = adj_list_vertex_property_map >, int, const int&, vertex_index_t>; typename std::iterator_traits< >::value_type = default_color_type; typename std::iterator_traits< >::reference = default_color_type&]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/dominator_tree.hpp:314:35: required from ‘void boost::lengauer_tarjan_dominator_tree(const Graph&, const typename graph_traits::vertex_descriptor&, const IndexMap&, TimeMap, PredMap, VertexVector&, DomTreePredMap) [with Graph = adjacency_list >; IndexMap = adj_list_vertex_property_map >, int, const int&, vertex_index_t>; TimeMap = iterator_property_map<__gnu_cxx::__normal_iterator > >, adj_list_vertex_property_map >, int, const int&, vertex_index_t>, long unsigned int, long unsigned int&>; PredMap = iterator_property_map<__gnu_cxx::__normal_iterator >, adj_list_vertex_property_map >, int, const int&, vertex_index_t>, void*, void*&>; VertexVector = std::vector; DomTreePredMap = iterator_property_map<__gnu_cxx::__normal_iterator >, adj_list_vertex_property_map >, int, int&, vertex_index_t> >; typename graph_traits::vertex_descriptor = void*]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/dominator_tree.hpp:360:35: required from ‘void boost::lengauer_tarjan_dominator_tree(const Graph&, const typename graph_traits::vertex_descriptor&, DomTreePredMap) [with Graph = adjacency_list >; DomTreePredMap = iterator_property_map<__gnu_cxx::__normal_iterator >, adj_list_vertex_property_map >, int, int&, vertex_index_t> >; typename graph_traits::vertex_descriptor = void*]’ dominatorTree.cpp:46:36: required from here /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::EqualityComparable::~EqualityComparable() [with TT = __gnu_cxx::__normal_iterator >]’ 37 | ~model() | ^ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:233:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 233 | BOOST_CONCEPT_USAGE(EqualityComparable) { | ^~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::InputIterator<__gnu_cxx::__normal_iterator > >]’: /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements > > >]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:512:7: required from ‘struct boost::InputIterator<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:540:3: required from ‘struct boost::ForwardIterator<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:568:3: required from ‘struct boost::BidirectionalIterator<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:597:3: required from ‘struct boost::RandomAccessIterator<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:597:3: [ skipping 3 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied > > >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_ > >)>’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/property_map/property_map.hpp:354:5: required from ‘boost::iterator_property_map >::value_type, typename std::iterator_traits< >::reference> boost::make_iterator_property_map(RAIter, ID) [with RAIter = __gnu_cxx::__normal_iterator >; ID = adj_list_vertex_property_map >, int, const int&, vertex_index_t>; typename std::iterator_traits< >::value_type = default_color_type; typename std::iterator_traits< >::reference = default_color_type&]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/dominator_tree.hpp:314:35: required from ‘void boost::lengauer_tarjan_dominator_tree(const Graph&, const typename graph_traits::vertex_descriptor&, const IndexMap&, TimeMap, PredMap, VertexVector&, DomTreePredMap) [with Graph = adjacency_list >; IndexMap = adj_list_vertex_property_map >, int, const int&, vertex_index_t>; TimeMap = iterator_property_map<__gnu_cxx::__normal_iterator > >, adj_list_vertex_property_map >, int, const int&, vertex_index_t>, long unsigned int, long unsigned int&>; PredMap = iterator_property_map<__gnu_cxx::__normal_iterator >, adj_list_vertex_property_map >, int, const int&, vertex_index_t>, void*, void*&>; VertexVector = std::vector; DomTreePredMap = iterator_property_map<__gnu_cxx::__normal_iterator >, adj_list_vertex_property_map >, int, int&, vertex_index_t> >; typename graph_traits::vertex_descriptor = void*]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/dominator_tree.hpp:360:35: required from ‘void boost::lengauer_tarjan_dominator_tree(const Graph&, const typename graph_traits::vertex_descriptor&, DomTreePredMap) [with Graph = adjacency_list >; DomTreePredMap = iterator_property_map<__gnu_cxx::__normal_iterator >, adj_list_vertex_property_map >, int, int&, vertex_index_t> >; typename graph_traits::vertex_descriptor = void*]’ dominatorTree.cpp:46:36: required from here /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::InputIterator::~InputIterator() [with TT = __gnu_cxx::__normal_iterator >]’ 37 | ~model() | ^ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:512:7: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 512 | BOOST_CONCEPT_USAGE(InputIterator) | ^~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::ForwardIterator<__gnu_cxx::__normal_iterator > >]’: /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements > > >]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:543:7: required from ‘struct boost::ForwardIterator<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:568:3: required from ‘struct boost::BidirectionalIterator<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:597:3: required from ‘struct boost::RandomAccessIterator<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:597:3: required from ‘struct boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:32:62: [ skipping 2 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied > > >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_ > >)>’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/property_map/property_map.hpp:354:5: required from ‘boost::iterator_property_map >::value_type, typename std::iterator_traits< >::reference> boost::make_iterator_property_map(RAIter, ID) [with RAIter = __gnu_cxx::__normal_iterator >; ID = adj_list_vertex_property_map >, int, const int&, vertex_index_t>; typename std::iterator_traits< >::value_type = default_color_type; typename std::iterator_traits< >::reference = default_color_type&]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/dominator_tree.hpp:314:35: required from ‘void boost::lengauer_tarjan_dominator_tree(const Graph&, const typename graph_traits::vertex_descriptor&, const IndexMap&, TimeMap, PredMap, VertexVector&, DomTreePredMap) [with Graph = adjacency_list >; IndexMap = adj_list_vertex_property_map >, int, const int&, vertex_index_t>; TimeMap = iterator_property_map<__gnu_cxx::__normal_iterator > >, adj_list_vertex_property_map >, int, const int&, vertex_index_t>, long unsigned int, long unsigned int&>; PredMap = iterator_property_map<__gnu_cxx::__normal_iterator >, adj_list_vertex_property_map >, int, const int&, vertex_index_t>, void*, void*&>; VertexVector = std::vector; DomTreePredMap = iterator_property_map<__gnu_cxx::__normal_iterator >, adj_list_vertex_property_map >, int, int&, vertex_index_t> >; typename graph_traits::vertex_descriptor = void*]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/dominator_tree.hpp:360:35: required from ‘void boost::lengauer_tarjan_dominator_tree(const Graph&, const typename graph_traits::vertex_descriptor&, DomTreePredMap) [with Graph = adjacency_list >; DomTreePredMap = iterator_property_map<__gnu_cxx::__normal_iterator >, adj_list_vertex_property_map >, int, int&, vertex_index_t> >; typename graph_traits::vertex_descriptor = void*]’ dominatorTree.cpp:46:36: required from here /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::ForwardIterator::~ForwardIterator() [with TT = __gnu_cxx::__normal_iterator >]’ 37 | ~model() | ^ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:543:7: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 543 | BOOST_CONCEPT_USAGE(ForwardIterator) | ^~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::BidirectionalIterator<__gnu_cxx::__normal_iterator > >]’: /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements > > >]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:571:7: required from ‘struct boost::BidirectionalIterator<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:597:3: required from ‘struct boost::RandomAccessIterator<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:597:3: required from ‘struct boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:32:62: [ skipping 2 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied > > >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_ > >)>’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/property_map/property_map.hpp:354:5: required from ‘boost::iterator_property_map >::value_type, typename std::iterator_traits< >::reference> boost::make_iterator_property_map(RAIter, ID) [with RAIter = __gnu_cxx::__normal_iterator >; ID = adj_list_vertex_property_map >, int, const int&, vertex_index_t>; typename std::iterator_traits< >::value_type = default_color_type; typename std::iterator_traits< >::reference = default_color_type&]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/dominator_tree.hpp:314:35: required from ‘void boost::lengauer_tarjan_dominator_tree(const Graph&, const typename graph_traits::vertex_descriptor&, const IndexMap&, TimeMap, PredMap, VertexVector&, DomTreePredMap) [with Graph = adjacency_list >; IndexMap = adj_list_vertex_property_map >, int, const int&, vertex_index_t>; TimeMap = iterator_property_map<__gnu_cxx::__normal_iterator > >, adj_list_vertex_property_map >, int, const int&, vertex_index_t>, long unsigned int, long unsigned int&>; PredMap = iterator_property_map<__gnu_cxx::__normal_iterator >, adj_list_vertex_property_map >, int, const int&, vertex_index_t>, void*, void*&>; VertexVector = std::vector; DomTreePredMap = iterator_property_map<__gnu_cxx::__normal_iterator >, adj_list_vertex_property_map >, int, int&, vertex_index_t> >; typename graph_traits::vertex_descriptor = void*]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/dominator_tree.hpp:360:35: required from ‘void boost::lengauer_tarjan_dominator_tree(const Graph&, const typename graph_traits::vertex_descriptor&, DomTreePredMap) [with Graph = adjacency_list >; DomTreePredMap = iterator_property_map<__gnu_cxx::__normal_iterator >, adj_list_vertex_property_map >, int, int&, vertex_index_t> >; typename graph_traits::vertex_descriptor = void*]’ dominatorTree.cpp:46:36: required from here /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::BidirectionalIterator::~BidirectionalIterator() [with TT = __gnu_cxx::__normal_iterator >]’ 37 | ~model() | ^ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:571:7: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 571 | BOOST_CONCEPT_USAGE(BidirectionalIterator) | ^~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::Comparable<__gnu_cxx::__normal_iterator > >]’: /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements > > >]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:253:5: required from ‘struct boost::Comparable<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:597:3: required from ‘struct boost::RandomAccessIterator<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:597:3: required from ‘struct boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:32:62: [ skipping 2 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied > > >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_ > >)>’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/property_map/property_map.hpp:354:5: required from ‘boost::iterator_property_map >::value_type, typename std::iterator_traits< >::reference> boost::make_iterator_property_map(RAIter, ID) [with RAIter = __gnu_cxx::__normal_iterator >; ID = adj_list_vertex_property_map >, int, const int&, vertex_index_t>; typename std::iterator_traits< >::value_type = default_color_type; typename std::iterator_traits< >::reference = default_color_type&]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/dominator_tree.hpp:314:35: required from ‘void boost::lengauer_tarjan_dominator_tree(const Graph&, const typename graph_traits::vertex_descriptor&, const IndexMap&, TimeMap, PredMap, VertexVector&, DomTreePredMap) [with Graph = adjacency_list >; IndexMap = adj_list_vertex_property_map >, int, const int&, vertex_index_t>; TimeMap = iterator_property_map<__gnu_cxx::__normal_iterator > >, adj_list_vertex_property_map >, int, const int&, vertex_index_t>, long unsigned int, long unsigned int&>; PredMap = iterator_property_map<__gnu_cxx::__normal_iterator >, adj_list_vertex_property_map >, int, const int&, vertex_index_t>, void*, void*&>; VertexVector = std::vector; DomTreePredMap = iterator_property_map<__gnu_cxx::__normal_iterator >, adj_list_vertex_property_map >, int, int&, vertex_index_t> >; typename graph_traits::vertex_descriptor = void*]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/dominator_tree.hpp:360:35: required from ‘void boost::lengauer_tarjan_dominator_tree(const Graph&, const typename graph_traits::vertex_descriptor&, DomTreePredMap) [with Graph = adjacency_list >; DomTreePredMap = iterator_property_map<__gnu_cxx::__normal_iterator >, adj_list_vertex_property_map >, int, int&, vertex_index_t> >; typename graph_traits::vertex_descriptor = void*]’ dominatorTree.cpp:46:36: required from here /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::Comparable::~Comparable() [with TT = __gnu_cxx::__normal_iterator >]’ 37 | ~model() | ^ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:253:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 253 | BOOST_CONCEPT_USAGE(Comparable) { | ^~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::RandomAccessIterator<__gnu_cxx::__normal_iterator > >]’: /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements > > >]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:601:7: required from ‘struct boost::RandomAccessIterator<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:597:3: required from ‘struct boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator > >]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied > > >::value’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied > > >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_ > >)>’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/property_map/property_map.hpp:354:5: required from ‘boost::iterator_property_map >::value_type, typename std::iterator_traits< >::reference> boost::make_iterator_property_map(RAIter, ID) [with RAIter = __gnu_cxx::__normal_iterator >; ID = adj_list_vertex_property_map >, int, const int&, vertex_index_t>; typename std::iterator_traits< >::value_type = default_color_type; typename std::iterator_traits< >::reference = default_color_type&]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/dominator_tree.hpp:314:35: required from ‘void boost::lengauer_tarjan_dominator_tree(const Graph&, const typename graph_traits::vertex_descriptor&, const IndexMap&, TimeMap, PredMap, VertexVector&, DomTreePredMap) [with Graph = adjacency_list >; IndexMap = adj_list_vertex_property_map >, int, const int&, vertex_index_t>; TimeMap = iterator_property_map<__gnu_cxx::__normal_iterator > >, adj_list_vertex_property_map >, int, const int&, vertex_index_t>, long unsigned int, long unsigned int&>; PredMap = iterator_property_map<__gnu_cxx::__normal_iterator >, adj_list_vertex_property_map >, int, const int&, vertex_index_t>, void*, void*&>; VertexVector = std::vector; DomTreePredMap = iterator_property_map<__gnu_cxx::__normal_iterator >, adj_list_vertex_property_map >, int, int&, vertex_index_t> >; typename graph_traits::vertex_descriptor = void*]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/dominator_tree.hpp:360:35: required from ‘void boost::lengauer_tarjan_dominator_tree(const Graph&, const typename graph_traits::vertex_descriptor&, DomTreePredMap) [with Graph = adjacency_list >; DomTreePredMap = iterator_property_map<__gnu_cxx::__normal_iterator >, adj_list_vertex_property_map >, int, int&, vertex_index_t> >; typename graph_traits::vertex_descriptor = void*]’ dominatorTree.cpp:46:36: required from here /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::RandomAccessIterator::~RandomAccessIterator() [with TT = __gnu_cxx::__normal_iterator >]’ 37 | ~model() | ^ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:601:7: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 601 | BOOST_CONCEPT_USAGE(RandomAccessIterator) | ^~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::IncidenceGraphConcept > >]’: /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/depth_first_search.hpp:129:9: required from ‘void boost::detail::depth_first_visit_impl(const IncidenceGraph&, typename boost::graph_traits::vertex_descriptor, DFSVisitor&, ColorMap, TerminatorFunc) [with IncidenceGraph = boost::adjacency_list >; DFSVisitor = boost::dfs_visitor >, boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>, void*, void*&>, boost::on_tree_edge>, time_stamper_with_vertex_vector > >, boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>, long unsigned int, long unsigned int&>, std::vector, long unsigned int, boost::on_discover_vertex> > >; ColorMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>, boost::default_color_type, boost::default_color_type&>; TerminatorFunc = nontruth2; typename boost::graph_traits::vertex_descriptor = void*]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/depth_first_search.hpp:417:35: required from ‘void boost::depth_first_visit(const IncidenceGraph&, typename graph_traits::vertex_descriptor, DFSVisitor, ColorMap) [with IncidenceGraph = adjacency_list >; DFSVisitor = dfs_visitor >, adj_list_vertex_property_map >, int, const int&, vertex_index_t>, void*, void*&>, on_tree_edge>, detail::time_stamper_with_vertex_vector > >, adj_list_vertex_property_map >, int, const int&, vertex_index_t>, long unsigned int, long unsigned int&>, std::vector, long unsigned int, on_discover_vertex> > >; ColorMap = iterator_property_map<__gnu_cxx::__normal_iterator >, adj_list_vertex_property_map >, int, const int&, vertex_index_t>, default_color_type, default_color_type&>; typename graph_traits::vertex_descriptor = void*]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/dominator_tree.hpp:309:22: required from ‘void boost::lengauer_tarjan_dominator_tree(const Graph&, const typename graph_traits::vertex_descriptor&, const IndexMap&, TimeMap, PredMap, VertexVector&, DomTreePredMap) [with Graph = adjacency_list >; IndexMap = adj_list_vertex_property_map >, int, const int&, vertex_index_t>; TimeMap = iterator_property_map<__gnu_cxx::__normal_iterator > >, adj_list_vertex_property_map >, int, const int&, vertex_index_t>, long unsigned int, long unsigned int&>; PredMap = iterator_property_map<__gnu_cxx::__normal_iterator >, adj_list_vertex_property_map >, int, const int&, vertex_index_t>, void*, void*&>; VertexVector = std::vector; DomTreePredMap = iterator_property_map<__gnu_cxx::__normal_iterator >, adj_list_vertex_property_map >, int, int&, vertex_index_t> >; typename graph_traits::vertex_descriptor = void*]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/dominator_tree.hpp:360:35: required from ‘void boost::lengauer_tarjan_dominator_tree(const Graph&, const typename graph_traits::vertex_descriptor&, DomTreePredMap) [with Graph = adjacency_list >; DomTreePredMap = iterator_property_map<__gnu_cxx::__normal_iterator >, adj_list_vertex_property_map >, int, int&, vertex_index_t> >; typename graph_traits::vertex_descriptor = void*]’ dominatorTree.cpp:46:36: required from here /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/graph_concepts.hpp:75:15: note: in a call to non-static member function ‘boost::concepts::IncidenceGraphConcept > >::~IncidenceGraphConcept()’ 75 | BOOST_concept(IncidenceGraph, (G)) : Graph< G > | ^~~~~~~~~~~~~~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/preprocessor/cat.hpp:29:34: note: in definition of macro ‘BOOST_PP_CAT_I’ 29 | # define BOOST_PP_CAT_I(a, b) a ## b | ^ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/concept_def.hpp:23:12: note: in expansion of macro ‘BOOST_PP_CAT’ 23 | struct BOOST_PP_CAT(name,Concept) \ | ^~~~~~~~~~~~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/graph_concepts.hpp:75:1: note: in expansion of macro ‘BOOST_concept’ 75 | BOOST_concept(IncidenceGraph, (G)) : Graph< G > | ^~~~~~~~~~~~~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::constraint::failed() [with Model = boost::DFSVisitorConcept >, boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>, void*, void*&>, boost::on_tree_edge>, boost::detail::time_stamper_with_vertex_vector > >, boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>, long unsigned int, long unsigned int&>, std::vector, long unsigned int, boost::on_discover_vertex> > >, boost::adjacency_list > >]’: /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/depth_first_search.hpp:130:9: required from ‘void boost::detail::depth_first_visit_impl(const IncidenceGraph&, typename boost::graph_traits::vertex_descriptor, DFSVisitor&, ColorMap, TerminatorFunc) [with IncidenceGraph = boost::adjacency_list >; DFSVisitor = boost::dfs_visitor >, boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>, void*, void*&>, boost::on_tree_edge>, time_stamper_with_vertex_vector > >, boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>, long unsigned int, long unsigned int&>, std::vector, long unsigned int, boost::on_discover_vertex> > >; ColorMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>, boost::default_color_type, boost::default_color_type&>; TerminatorFunc = nontruth2; typename boost::graph_traits::vertex_descriptor = void*]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/depth_first_search.hpp:417:35: required from ‘void boost::depth_first_visit(const IncidenceGraph&, typename graph_traits::vertex_descriptor, DFSVisitor, ColorMap) [with IncidenceGraph = adjacency_list >; DFSVisitor = dfs_visitor >, adj_list_vertex_property_map >, int, const int&, vertex_index_t>, void*, void*&>, on_tree_edge>, detail::time_stamper_with_vertex_vector > >, adj_list_vertex_property_map >, int, const int&, vertex_index_t>, long unsigned int, long unsigned int&>, std::vector, long unsigned int, on_discover_vertex> > >; ColorMap = iterator_property_map<__gnu_cxx::__normal_iterator >, adj_list_vertex_property_map >, int, const int&, vertex_index_t>, default_color_type, default_color_type&>; typename graph_traits::vertex_descriptor = void*]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/dominator_tree.hpp:309:22: required from ‘void boost::lengauer_tarjan_dominator_tree(const Graph&, const typename graph_traits::vertex_descriptor&, const IndexMap&, TimeMap, PredMap, VertexVector&, DomTreePredMap) [with Graph = adjacency_list >; IndexMap = adj_list_vertex_property_map >, int, const int&, vertex_index_t>; TimeMap = iterator_property_map<__gnu_cxx::__normal_iterator > >, adj_list_vertex_property_map >, int, const int&, vertex_index_t>, long unsigned int, long unsigned int&>; PredMap = iterator_property_map<__gnu_cxx::__normal_iterator >, adj_list_vertex_property_map >, int, const int&, vertex_index_t>, void*, void*&>; VertexVector = std::vector; DomTreePredMap = iterator_property_map<__gnu_cxx::__normal_iterator >, adj_list_vertex_property_map >, int, int&, vertex_index_t> >; typename graph_traits::vertex_descriptor = void*]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/dominator_tree.hpp:360:35: required from ‘void boost::lengauer_tarjan_dominator_tree(const Graph&, const typename graph_traits::vertex_descriptor&, DomTreePredMap) [with Graph = adjacency_list >; DomTreePredMap = iterator_property_map<__gnu_cxx::__normal_iterator >, adj_list_vertex_property_map >, int, int&, vertex_index_t> >; typename graph_traits::vertex_descriptor = void*]’ dominatorTree.cpp:46:36: required from here /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:65:52: warning: ‘this’ pointer is null [-Wnonnull] 65 | static void failed() { ((Model*)0)->constraints(); } | ~~~~~~~~~~~~~~~~~~~~~~~~^~ In file included from /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/dominator_tree.hpp:15, from dominatorTree.cpp:2: /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/depth_first_search.hpp:39:10: note: in a call to non-static member function ‘void boost::DFSVisitorConcept::constraints() [with Visitor = boost::dfs_visitor >, boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>, void*, void*&>, boost::on_tree_edge>, boost::detail::time_stamper_with_vertex_vector > >, boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>, long unsigned int, long unsigned int&>, std::vector, long unsigned int, boost::on_discover_vertex> > >; Graph = boost::adjacency_list >]’ 39 | void constraints() | ^~~~~~~~~~~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::constraint::failed() [with Model = boost::ReadWritePropertyMapConcept >, boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>, boost::default_color_type, boost::default_color_type&>, void*>]’: /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/depth_first_search.hpp:134:9: required from ‘void boost::detail::depth_first_visit_impl(const IncidenceGraph&, typename boost::graph_traits::vertex_descriptor, DFSVisitor&, ColorMap, TerminatorFunc) [with IncidenceGraph = boost::adjacency_list >; DFSVisitor = boost::dfs_visitor >, boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>, void*, void*&>, boost::on_tree_edge>, time_stamper_with_vertex_vector > >, boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>, long unsigned int, long unsigned int&>, std::vector, long unsigned int, boost::on_discover_vertex> > >; ColorMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>, boost::default_color_type, boost::default_color_type&>; TerminatorFunc = nontruth2; typename boost::graph_traits::vertex_descriptor = void*]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/depth_first_search.hpp:417:35: required from ‘void boost::depth_first_visit(const IncidenceGraph&, typename graph_traits::vertex_descriptor, DFSVisitor, ColorMap) [with IncidenceGraph = adjacency_list >; DFSVisitor = dfs_visitor >, adj_list_vertex_property_map >, int, const int&, vertex_index_t>, void*, void*&>, on_tree_edge>, detail::time_stamper_with_vertex_vector > >, adj_list_vertex_property_map >, int, const int&, vertex_index_t>, long unsigned int, long unsigned int&>, std::vector, long unsigned int, on_discover_vertex> > >; ColorMap = iterator_property_map<__gnu_cxx::__normal_iterator >, adj_list_vertex_property_map >, int, const int&, vertex_index_t>, default_color_type, default_color_type&>; typename graph_traits::vertex_descriptor = void*]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/dominator_tree.hpp:309:22: required from ‘void boost::lengauer_tarjan_dominator_tree(const Graph&, const typename graph_traits::vertex_descriptor&, const IndexMap&, TimeMap, PredMap, VertexVector&, DomTreePredMap) [with Graph = adjacency_list >; IndexMap = adj_list_vertex_property_map >, int, const int&, vertex_index_t>; TimeMap = iterator_property_map<__gnu_cxx::__normal_iterator > >, adj_list_vertex_property_map >, int, const int&, vertex_index_t>, long unsigned int, long unsigned int&>; PredMap = iterator_property_map<__gnu_cxx::__normal_iterator >, adj_list_vertex_property_map >, int, const int&, vertex_index_t>, void*, void*&>; VertexVector = std::vector; DomTreePredMap = iterator_property_map<__gnu_cxx::__normal_iterator >, adj_list_vertex_property_map >, int, int&, vertex_index_t> >; typename graph_traits::vertex_descriptor = void*]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/dominator_tree.hpp:360:35: required from ‘void boost::lengauer_tarjan_dominator_tree(const Graph&, const typename graph_traits::vertex_descriptor&, DomTreePredMap) [with Graph = adjacency_list >; DomTreePredMap = iterator_property_map<__gnu_cxx::__normal_iterator >, adj_list_vertex_property_map >, int, int&, vertex_index_t> >; typename graph_traits::vertex_descriptor = void*]’ dominatorTree.cpp:46:36: required from here /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:65:52: warning: ‘this’ pointer is null [-Wnonnull] 65 | static void failed() { ((Model*)0)->constraints(); } | ~~~~~~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/property_map/property_map.hpp:205:10: note: in a call to non-static member function ‘void boost::ReadWritePropertyMapConcept::constraints() [with PMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>, boost::default_color_type, boost::default_color_type&>; Key = void*]’ 205 | void constraints() { | ^~~~~~~~~~~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements >]’: /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:233:5: required from ‘struct boost::EqualityComparable’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/graph_concepts.hpp:502:1: required from ‘struct boost::concepts::ColorValue’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/graph_concepts.hpp:502:1: required from ‘struct boost::concepts::ColorValueConcept’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::concepts::ColorValueConcept]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:42:5: [ skipping 2 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_)>’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/depth_first_search.hpp:136:9: required from ‘void boost::detail::depth_first_visit_impl(const IncidenceGraph&, typename boost::graph_traits::vertex_descriptor, DFSVisitor&, ColorMap, TerminatorFunc) [with IncidenceGraph = boost::adjacency_list >; DFSVisitor = boost::dfs_visitor >, boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>, void*, void*&>, boost::on_tree_edge>, time_stamper_with_vertex_vector > >, boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>, long unsigned int, long unsigned int&>, std::vector, long unsigned int, boost::on_discover_vertex> > >; ColorMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>, boost::default_color_type, boost::default_color_type&>; TerminatorFunc = nontruth2; typename boost::graph_traits::vertex_descriptor = void*]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/depth_first_search.hpp:417:35: required from ‘void boost::depth_first_visit(const IncidenceGraph&, typename graph_traits::vertex_descriptor, DFSVisitor, ColorMap) [with IncidenceGraph = adjacency_list >; DFSVisitor = dfs_visitor >, adj_list_vertex_property_map >, int, const int&, vertex_index_t>, void*, void*&>, on_tree_edge>, detail::time_stamper_with_vertex_vector > >, adj_list_vertex_property_map >, int, const int&, vertex_index_t>, long unsigned int, long unsigned int&>, std::vector, long unsigned int, on_discover_vertex> > >; ColorMap = iterator_property_map<__gnu_cxx::__normal_iterator >, adj_list_vertex_property_map >, int, const int&, vertex_index_t>, default_color_type, default_color_type&>; typename graph_traits::vertex_descriptor = void*]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/dominator_tree.hpp:309:22: required from ‘void boost::lengauer_tarjan_dominator_tree(const Graph&, const typename graph_traits::vertex_descriptor&, const IndexMap&, TimeMap, PredMap, VertexVector&, DomTreePredMap) [with Graph = adjacency_list >; IndexMap = adj_list_vertex_property_map >, int, const int&, vertex_index_t>; TimeMap = iterator_property_map<__gnu_cxx::__normal_iterator > >, adj_list_vertex_property_map >, int, const int&, vertex_index_t>, long unsigned int, long unsigned int&>; PredMap = iterator_property_map<__gnu_cxx::__normal_iterator >, adj_list_vertex_property_map >, int, const int&, vertex_index_t>, void*, void*&>; VertexVector = std::vector; DomTreePredMap = iterator_property_map<__gnu_cxx::__normal_iterator >, adj_list_vertex_property_map >, int, int&, vertex_index_t> >; typename graph_traits::vertex_descriptor = void*]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/dominator_tree.hpp:360:35: required from ‘void boost::lengauer_tarjan_dominator_tree(const Graph&, const typename graph_traits::vertex_descriptor&, DomTreePredMap) [with Graph = adjacency_list >; DomTreePredMap = iterator_property_map<__gnu_cxx::__normal_iterator >, adj_list_vertex_property_map >, int, int&, vertex_index_t> >; typename graph_traits::vertex_descriptor = void*]’ dominatorTree.cpp:46:36: required from here /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::EqualityComparable]’ 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ^ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements >]’: /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:137:5: required from ‘struct boost::DefaultConstructible’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/graph_concepts.hpp:502:1: required from ‘struct boost::concepts::ColorValue’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/graph_concepts.hpp:502:1: required from ‘struct boost::concepts::ColorValueConcept’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::concepts::ColorValueConcept]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:42:5: [ skipping 2 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_)>’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/depth_first_search.hpp:136:9: required from ‘void boost::detail::depth_first_visit_impl(const IncidenceGraph&, typename boost::graph_traits::vertex_descriptor, DFSVisitor&, ColorMap, TerminatorFunc) [with IncidenceGraph = boost::adjacency_list >; DFSVisitor = boost::dfs_visitor >, boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>, void*, void*&>, boost::on_tree_edge>, time_stamper_with_vertex_vector > >, boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>, long unsigned int, long unsigned int&>, std::vector, long unsigned int, boost::on_discover_vertex> > >; ColorMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>, boost::default_color_type, boost::default_color_type&>; TerminatorFunc = nontruth2; typename boost::graph_traits::vertex_descriptor = void*]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/depth_first_search.hpp:417:35: required from ‘void boost::depth_first_visit(const IncidenceGraph&, typename graph_traits::vertex_descriptor, DFSVisitor, ColorMap) [with IncidenceGraph = adjacency_list >; DFSVisitor = dfs_visitor >, adj_list_vertex_property_map >, int, const int&, vertex_index_t>, void*, void*&>, on_tree_edge>, detail::time_stamper_with_vertex_vector > >, adj_list_vertex_property_map >, int, const int&, vertex_index_t>, long unsigned int, long unsigned int&>, std::vector, long unsigned int, on_discover_vertex> > >; ColorMap = iterator_property_map<__gnu_cxx::__normal_iterator >, adj_list_vertex_property_map >, int, const int&, vertex_index_t>, default_color_type, default_color_type&>; typename graph_traits::vertex_descriptor = void*]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/dominator_tree.hpp:309:22: required from ‘void boost::lengauer_tarjan_dominator_tree(const Graph&, const typename graph_traits::vertex_descriptor&, const IndexMap&, TimeMap, PredMap, VertexVector&, DomTreePredMap) [with Graph = adjacency_list >; IndexMap = adj_list_vertex_property_map >, int, const int&, vertex_index_t>; TimeMap = iterator_property_map<__gnu_cxx::__normal_iterator > >, adj_list_vertex_property_map >, int, const int&, vertex_index_t>, long unsigned int, long unsigned int&>; PredMap = iterator_property_map<__gnu_cxx::__normal_iterator >, adj_list_vertex_property_map >, int, const int&, vertex_index_t>, void*, void*&>; VertexVector = std::vector; DomTreePredMap = iterator_property_map<__gnu_cxx::__normal_iterator >, adj_list_vertex_property_map >, int, int&, vertex_index_t> >; typename graph_traits::vertex_descriptor = void*]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/dominator_tree.hpp:360:35: required from ‘void boost::lengauer_tarjan_dominator_tree(const Graph&, const typename graph_traits::vertex_descriptor&, DomTreePredMap) [with Graph = adjacency_list >; DomTreePredMap = iterator_property_map<__gnu_cxx::__normal_iterator >, adj_list_vertex_property_map >, int, int&, vertex_index_t> >; typename graph_traits::vertex_descriptor = void*]’ dominatorTree.cpp:46:36: required from here /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::DefaultConstructible]’ 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ^ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements >]’: /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/graph_concepts.hpp:505:5: required from ‘struct boost::concepts::ColorValue’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/graph_concepts.hpp:502:1: required from ‘struct boost::concepts::ColorValueConcept’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::concepts::ColorValueConcept]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied >::value’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_)>’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/depth_first_search.hpp:136:9: required from ‘void boost::detail::depth_first_visit_impl(const IncidenceGraph&, typename boost::graph_traits::vertex_descriptor, DFSVisitor&, ColorMap, TerminatorFunc) [with IncidenceGraph = boost::adjacency_list >; DFSVisitor = boost::dfs_visitor >, boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>, void*, void*&>, boost::on_tree_edge>, time_stamper_with_vertex_vector > >, boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>, long unsigned int, long unsigned int&>, std::vector, long unsigned int, boost::on_discover_vertex> > >; ColorMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>, boost::default_color_type, boost::default_color_type&>; TerminatorFunc = nontruth2; typename boost::graph_traits::vertex_descriptor = void*]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/depth_first_search.hpp:417:35: required from ‘void boost::depth_first_visit(const IncidenceGraph&, typename graph_traits::vertex_descriptor, DFSVisitor, ColorMap) [with IncidenceGraph = adjacency_list >; DFSVisitor = dfs_visitor >, adj_list_vertex_property_map >, int, const int&, vertex_index_t>, void*, void*&>, on_tree_edge>, detail::time_stamper_with_vertex_vector > >, adj_list_vertex_property_map >, int, const int&, vertex_index_t>, long unsigned int, long unsigned int&>, std::vector, long unsigned int, on_discover_vertex> > >; ColorMap = iterator_property_map<__gnu_cxx::__normal_iterator >, adj_list_vertex_property_map >, int, const int&, vertex_index_t>, default_color_type, default_color_type&>; typename graph_traits::vertex_descriptor = void*]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/dominator_tree.hpp:309:22: required from ‘void boost::lengauer_tarjan_dominator_tree(const Graph&, const typename graph_traits::vertex_descriptor&, const IndexMap&, TimeMap, PredMap, VertexVector&, DomTreePredMap) [with Graph = adjacency_list >; IndexMap = adj_list_vertex_property_map >, int, const int&, vertex_index_t>; TimeMap = iterator_property_map<__gnu_cxx::__normal_iterator > >, adj_list_vertex_property_map >, int, const int&, vertex_index_t>, long unsigned int, long unsigned int&>; PredMap = iterator_property_map<__gnu_cxx::__normal_iterator >, adj_list_vertex_property_map >, int, const int&, vertex_index_t>, void*, void*&>; VertexVector = std::vector; DomTreePredMap = iterator_property_map<__gnu_cxx::__normal_iterator >, adj_list_vertex_property_map >, int, int&, vertex_index_t> >; typename graph_traits::vertex_descriptor = void*]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/dominator_tree.hpp:360:35: required from ‘void boost::lengauer_tarjan_dominator_tree(const Graph&, const typename graph_traits::vertex_descriptor&, DomTreePredMap) [with Graph = adjacency_list >; DomTreePredMap = iterator_property_map<__gnu_cxx::__normal_iterator >, adj_list_vertex_property_map >, int, int&, vertex_index_t> >; typename graph_traits::vertex_descriptor = void*]’ dominatorTree.cpp:46:36: required from here /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::concepts::ColorValue]’ 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ^ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::ColorValueConcept]’: /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/depth_first_search.hpp:136:9: required from ‘void boost::detail::depth_first_visit_impl(const IncidenceGraph&, typename boost::graph_traits::vertex_descriptor, DFSVisitor&, ColorMap, TerminatorFunc) [with IncidenceGraph = boost::adjacency_list >; DFSVisitor = boost::dfs_visitor >, boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>, void*, void*&>, boost::on_tree_edge>, time_stamper_with_vertex_vector > >, boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>, long unsigned int, long unsigned int&>, std::vector, long unsigned int, boost::on_discover_vertex> > >; ColorMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>, boost::default_color_type, boost::default_color_type&>; TerminatorFunc = nontruth2; typename boost::graph_traits::vertex_descriptor = void*]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/depth_first_search.hpp:417:35: required from ‘void boost::depth_first_visit(const IncidenceGraph&, typename graph_traits::vertex_descriptor, DFSVisitor, ColorMap) [with IncidenceGraph = adjacency_list >; DFSVisitor = dfs_visitor >, adj_list_vertex_property_map >, int, const int&, vertex_index_t>, void*, void*&>, on_tree_edge>, detail::time_stamper_with_vertex_vector > >, adj_list_vertex_property_map >, int, const int&, vertex_index_t>, long unsigned int, long unsigned int&>, std::vector, long unsigned int, on_discover_vertex> > >; ColorMap = iterator_property_map<__gnu_cxx::__normal_iterator >, adj_list_vertex_property_map >, int, const int&, vertex_index_t>, default_color_type, default_color_type&>; typename graph_traits::vertex_descriptor = void*]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/dominator_tree.hpp:309:22: required from ‘void boost::lengauer_tarjan_dominator_tree(const Graph&, const typename graph_traits::vertex_descriptor&, const IndexMap&, TimeMap, PredMap, VertexVector&, DomTreePredMap) [with Graph = adjacency_list >; IndexMap = adj_list_vertex_property_map >, int, const int&, vertex_index_t>; TimeMap = iterator_property_map<__gnu_cxx::__normal_iterator > >, adj_list_vertex_property_map >, int, const int&, vertex_index_t>, long unsigned int, long unsigned int&>; PredMap = iterator_property_map<__gnu_cxx::__normal_iterator >, adj_list_vertex_property_map >, int, const int&, vertex_index_t>, void*, void*&>; VertexVector = std::vector; DomTreePredMap = iterator_property_map<__gnu_cxx::__normal_iterator >, adj_list_vertex_property_map >, int, int&, vertex_index_t> >; typename graph_traits::vertex_descriptor = void*]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/dominator_tree.hpp:360:35: required from ‘void boost::lengauer_tarjan_dominator_tree(const Graph&, const typename graph_traits::vertex_descriptor&, DomTreePredMap) [with Graph = adjacency_list >; DomTreePredMap = iterator_property_map<__gnu_cxx::__normal_iterator >, adj_list_vertex_property_map >, int, int&, vertex_index_t> >; typename graph_traits::vertex_descriptor = void*]’ dominatorTree.cpp:46:36: required from here /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/graph_concepts.hpp:502:15: note: in a call to non-static member function ‘boost::concepts::ColorValueConcept::~ColorValueConcept()’ 502 | BOOST_concept(ColorValue, (C)) | ^~~~~~~~~~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/preprocessor/cat.hpp:29:34: note: in definition of macro ‘BOOST_PP_CAT_I’ 29 | # define BOOST_PP_CAT_I(a, b) a ## b | ^ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/concept_def.hpp:23:12: note: in expansion of macro ‘BOOST_PP_CAT’ 23 | struct BOOST_PP_CAT(name,Concept) \ | ^~~~~~~~~~~~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/graph_concepts.hpp:502:1: note: in expansion of macro ‘BOOST_concept’ 502 | BOOST_concept(ColorValue, (C)) | ^~~~~~~~~~~~~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::Convertible]’: /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements >]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:208:5: required from ‘struct boost::Convertible’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::Convertible]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied >::value’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:72:8: [ skipping 9 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator > >]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied > > >::value’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied > > >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_ > >)>’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/property_map/property_map.hpp:354:5: required from ‘boost::iterator_property_map >::value_type, typename std::iterator_traits< >::reference> boost::make_iterator_property_map(RAIter, ID) [with RAIter = __gnu_cxx::__normal_iterator >; ID = adj_list_vertex_property_map >, int, int&, vertex_index_t>; typename std::iterator_traits< >::value_type = void*; typename std::iterator_traits< >::reference = void*&]’ dominatorTree.cpp:44:40: required from here /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::Convertible::~Convertible() [with X = std::random_access_iterator_tag; Y = std::input_iterator_tag]’ 37 | ~model() | ^ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:208:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 208 | BOOST_CONCEPT_USAGE(Convertible) { | ^~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::Convertible]’: /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements >]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:208:5: required from ‘struct boost::Convertible’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::Convertible]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied >::value’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:72:8: [ skipping 8 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator > >]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied > > >::value’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied > > >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_ > >)>’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/property_map/property_map.hpp:354:5: required from ‘boost::iterator_property_map >::value_type, typename std::iterator_traits< >::reference> boost::make_iterator_property_map(RAIter, ID) [with RAIter = __gnu_cxx::__normal_iterator >; ID = adj_list_vertex_property_map >, int, int&, vertex_index_t>; typename std::iterator_traits< >::value_type = void*; typename std::iterator_traits< >::reference = void*&]’ dominatorTree.cpp:44:40: required from here /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::Convertible::~Convertible() [with X = std::random_access_iterator_tag; Y = std::forward_iterator_tag]’ 37 | ~model() | ^ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:208:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 208 | BOOST_CONCEPT_USAGE(Convertible) { | ^~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::Convertible]’: /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements >]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:208:5: required from ‘struct boost::Convertible’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::Convertible]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied >::value’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:72:8: [ skipping 7 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator > >]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied > > >::value’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied > > >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_ > >)>’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/property_map/property_map.hpp:354:5: required from ‘boost::iterator_property_map >::value_type, typename std::iterator_traits< >::reference> boost::make_iterator_property_map(RAIter, ID) [with RAIter = __gnu_cxx::__normal_iterator >; ID = adj_list_vertex_property_map >, int, int&, vertex_index_t>; typename std::iterator_traits< >::value_type = void*; typename std::iterator_traits< >::reference = void*&]’ dominatorTree.cpp:44:40: required from here /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::Convertible::~Convertible() [with X = std::random_access_iterator_tag; Y = std::bidirectional_iterator_tag]’ 37 | ~model() | ^ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:208:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 208 | BOOST_CONCEPT_USAGE(Convertible) { | ^~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements >]’: /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:137:5: required from ‘struct boost::DefaultConstructible’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::DefaultConstructible]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied >::value’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_)>’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/graph_concepts.hpp:68:9: [ skipping 8 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied > > >::value’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied > > >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_ > >)>’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/dominator_tree.hpp:245:5: required from ‘void boost::lengauer_tarjan_dominator_tree(const Graph&, const typename graph_traits::vertex_descriptor&, const IndexMap&, TimeMap, PredMap, VertexVector&, DomTreePredMap) [with Graph = adjacency_list >; IndexMap = adj_list_vertex_property_map >, int, const int&, vertex_index_t>; TimeMap = iterator_property_map<__gnu_cxx::__normal_iterator > >, adj_list_vertex_property_map >, int, const int&, vertex_index_t>, long unsigned int, long unsigned int&>; PredMap = iterator_property_map<__gnu_cxx::__normal_iterator >, adj_list_vertex_property_map >, int, const int&, vertex_index_t>, void*, void*&>; VertexVector = std::vector; DomTreePredMap = iterator_property_map<__gnu_cxx::__normal_iterator >, adj_list_vertex_property_map >, int, int&, vertex_index_t> >; typename graph_traits::vertex_descriptor = void*]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/dominator_tree.hpp:360:35: required from ‘void boost::lengauer_tarjan_dominator_tree(const Graph&, const typename graph_traits::vertex_descriptor&, DomTreePredMap) [with Graph = adjacency_list >; DomTreePredMap = iterator_property_map<__gnu_cxx::__normal_iterator >, adj_list_vertex_property_map >, int, int&, vertex_index_t> >; typename graph_traits::vertex_descriptor = void*]’ dominatorTree.cpp:46:36: required from here /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::DefaultConstructible]’ 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ^ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::DefaultConstructible]’: /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/graph_concepts.hpp:68:9: required from ‘boost::concepts::Graph::~Graph() [with G = boost::adjacency_list >]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/usage.hpp:20:48: required from ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::concepts::Graph > >]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements > > >]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/graph_concepts.hpp:66:5: required from ‘struct boost::concepts::Graph > >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/graph_concepts.hpp:75:1: required from ‘struct boost::concepts::IncidenceGraph > >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/graph_concepts.hpp:118:1: [ skipping 3 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied > > >::value’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied > > >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_ > >)>’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/dominator_tree.hpp:245:5: required from ‘void boost::lengauer_tarjan_dominator_tree(const Graph&, const typename graph_traits::vertex_descriptor&, const IndexMap&, TimeMap, PredMap, VertexVector&, DomTreePredMap) [with Graph = adjacency_list >; IndexMap = adj_list_vertex_property_map >, int, const int&, vertex_index_t>; TimeMap = iterator_property_map<__gnu_cxx::__normal_iterator > >, adj_list_vertex_property_map >, int, const int&, vertex_index_t>, long unsigned int, long unsigned int&>; PredMap = iterator_property_map<__gnu_cxx::__normal_iterator >, adj_list_vertex_property_map >, int, const int&, vertex_index_t>, void*, void*&>; VertexVector = std::vector; DomTreePredMap = iterator_property_map<__gnu_cxx::__normal_iterator >, adj_list_vertex_property_map >, int, int&, vertex_index_t> >; typename graph_traits::vertex_descriptor = void*]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/dominator_tree.hpp:360:35: required from ‘void boost::lengauer_tarjan_dominator_tree(const Graph&, const typename graph_traits::vertex_descriptor&, DomTreePredMap) [with Graph = adjacency_list >; DomTreePredMap = iterator_property_map<__gnu_cxx::__normal_iterator >, adj_list_vertex_property_map >, int, int&, vertex_index_t> >; typename graph_traits::vertex_descriptor = void*]’ dominatorTree.cpp:46:36: required from here /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::DefaultConstructible::~DefaultConstructible() [with TT = void*]’ 37 | ~model() | ^ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:137:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 137 | BOOST_CONCEPT_USAGE(DefaultConstructible) { | ^~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements >]’: /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:233:5: required from ‘struct boost::EqualityComparable’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::EqualityComparable]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied >::value’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_)>’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/graph_concepts.hpp:69:9: [ skipping 8 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied > > >::value’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied > > >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_ > >)>’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/dominator_tree.hpp:245:5: required from ‘void boost::lengauer_tarjan_dominator_tree(const Graph&, const typename graph_traits::vertex_descriptor&, const IndexMap&, TimeMap, PredMap, VertexVector&, DomTreePredMap) [with Graph = adjacency_list >; IndexMap = adj_list_vertex_property_map >, int, const int&, vertex_index_t>; TimeMap = iterator_property_map<__gnu_cxx::__normal_iterator > >, adj_list_vertex_property_map >, int, const int&, vertex_index_t>, long unsigned int, long unsigned int&>; PredMap = iterator_property_map<__gnu_cxx::__normal_iterator >, adj_list_vertex_property_map >, int, const int&, vertex_index_t>, void*, void*&>; VertexVector = std::vector; DomTreePredMap = iterator_property_map<__gnu_cxx::__normal_iterator >, adj_list_vertex_property_map >, int, int&, vertex_index_t> >; typename graph_traits::vertex_descriptor = void*]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/dominator_tree.hpp:360:35: required from ‘void boost::lengauer_tarjan_dominator_tree(const Graph&, const typename graph_traits::vertex_descriptor&, DomTreePredMap) [with Graph = adjacency_list >; DomTreePredMap = iterator_property_map<__gnu_cxx::__normal_iterator >, adj_list_vertex_property_map >, int, int&, vertex_index_t> >; typename graph_traits::vertex_descriptor = void*]’ dominatorTree.cpp:46:36: required from here /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::EqualityComparable]’ 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ^ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::EqualityComparable]’: /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/graph_concepts.hpp:69:9: required from ‘boost::concepts::Graph::~Graph() [with G = boost::adjacency_list >]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/usage.hpp:20:48: required from ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::concepts::Graph > >]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements > > >]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/graph_concepts.hpp:66:5: required from ‘struct boost::concepts::Graph > >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/graph_concepts.hpp:75:1: required from ‘struct boost::concepts::IncidenceGraph > >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/graph_concepts.hpp:118:1: [ skipping 3 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied > > >::value’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied > > >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_ > >)>’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/dominator_tree.hpp:245:5: required from ‘void boost::lengauer_tarjan_dominator_tree(const Graph&, const typename graph_traits::vertex_descriptor&, const IndexMap&, TimeMap, PredMap, VertexVector&, DomTreePredMap) [with Graph = adjacency_list >; IndexMap = adj_list_vertex_property_map >, int, const int&, vertex_index_t>; TimeMap = iterator_property_map<__gnu_cxx::__normal_iterator > >, adj_list_vertex_property_map >, int, const int&, vertex_index_t>, long unsigned int, long unsigned int&>; PredMap = iterator_property_map<__gnu_cxx::__normal_iterator >, adj_list_vertex_property_map >, int, const int&, vertex_index_t>, void*, void*&>; VertexVector = std::vector; DomTreePredMap = iterator_property_map<__gnu_cxx::__normal_iterator >, adj_list_vertex_property_map >, int, int&, vertex_index_t> >; typename graph_traits::vertex_descriptor = void*]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/dominator_tree.hpp:360:35: required from ‘void boost::lengauer_tarjan_dominator_tree(const Graph&, const typename graph_traits::vertex_descriptor&, DomTreePredMap) [with Graph = adjacency_list >; DomTreePredMap = iterator_property_map<__gnu_cxx::__normal_iterator >, adj_list_vertex_property_map >, int, int&, vertex_index_t> >; typename graph_traits::vertex_descriptor = void*]’ dominatorTree.cpp:46:36: required from here /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::EqualityComparable::~EqualityComparable() [with TT = void*]’ 37 | ~model() | ^ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:233:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 233 | BOOST_CONCEPT_USAGE(EqualityComparable) { | ^~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements >]’: /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:145:5: required from ‘struct boost::Assignable’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::Assignable]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied >::value’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_)>’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/graph_concepts.hpp:70:9: [ skipping 8 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied > > >::value’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied > > >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_ > >)>’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/dominator_tree.hpp:245:5: required from ‘void boost::lengauer_tarjan_dominator_tree(const Graph&, const typename graph_traits::vertex_descriptor&, const IndexMap&, TimeMap, PredMap, VertexVector&, DomTreePredMap) [with Graph = adjacency_list >; IndexMap = adj_list_vertex_property_map >, int, const int&, vertex_index_t>; TimeMap = iterator_property_map<__gnu_cxx::__normal_iterator > >, adj_list_vertex_property_map >, int, const int&, vertex_index_t>, long unsigned int, long unsigned int&>; PredMap = iterator_property_map<__gnu_cxx::__normal_iterator >, adj_list_vertex_property_map >, int, const int&, vertex_index_t>, void*, void*&>; VertexVector = std::vector; DomTreePredMap = iterator_property_map<__gnu_cxx::__normal_iterator >, adj_list_vertex_property_map >, int, int&, vertex_index_t> >; typename graph_traits::vertex_descriptor = void*]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/dominator_tree.hpp:360:35: required from ‘void boost::lengauer_tarjan_dominator_tree(const Graph&, const typename graph_traits::vertex_descriptor&, DomTreePredMap) [with Graph = adjacency_list >; DomTreePredMap = iterator_property_map<__gnu_cxx::__normal_iterator >, adj_list_vertex_property_map >, int, int&, vertex_index_t> >; typename graph_traits::vertex_descriptor = void*]’ dominatorTree.cpp:46:36: required from here /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::Assignable]’ 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ^ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::Assignable]’: /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/graph_concepts.hpp:70:9: required from ‘boost::concepts::Graph::~Graph() [with G = boost::adjacency_list >]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/usage.hpp:20:48: required from ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::concepts::Graph > >]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements > > >]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/graph_concepts.hpp:66:5: required from ‘struct boost::concepts::Graph > >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/graph_concepts.hpp:75:1: required from ‘struct boost::concepts::IncidenceGraph > >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/graph_concepts.hpp:118:1: [ skipping 3 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied > > >::value’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied > > >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_ > >)>’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/dominator_tree.hpp:245:5: required from ‘void boost::lengauer_tarjan_dominator_tree(const Graph&, const typename graph_traits::vertex_descriptor&, const IndexMap&, TimeMap, PredMap, VertexVector&, DomTreePredMap) [with Graph = adjacency_list >; IndexMap = adj_list_vertex_property_map >, int, const int&, vertex_index_t>; TimeMap = iterator_property_map<__gnu_cxx::__normal_iterator > >, adj_list_vertex_property_map >, int, const int&, vertex_index_t>, long unsigned int, long unsigned int&>; PredMap = iterator_property_map<__gnu_cxx::__normal_iterator >, adj_list_vertex_property_map >, int, const int&, vertex_index_t>, void*, void*&>; VertexVector = std::vector; DomTreePredMap = iterator_property_map<__gnu_cxx::__normal_iterator >, adj_list_vertex_property_map >, int, int&, vertex_index_t> >; typename graph_traits::vertex_descriptor = void*]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/dominator_tree.hpp:360:35: required from ‘void boost::lengauer_tarjan_dominator_tree(const Graph&, const typename graph_traits::vertex_descriptor&, DomTreePredMap) [with Graph = adjacency_list >; DomTreePredMap = iterator_property_map<__gnu_cxx::__normal_iterator >, adj_list_vertex_property_map >, int, int&, vertex_index_t> >; typename graph_traits::vertex_descriptor = void*]’ dominatorTree.cpp:46:36: required from here /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::Assignable::~Assignable() [with TT = void*]’ 37 | ~model() | ^ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:145:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 145 | BOOST_CONCEPT_USAGE(Assignable) { | ^~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements >, boost::no_property>*, std::vector >, boost::no_property>, std::allocator >, boost::no_property> > > >, void*, boost::detail::edge_desc_impl, long int> > >]’: /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/graph_concepts.hpp:52:50: required from ‘struct boost::concepts::MultiPassInputIterator >, boost::no_property>*, std::vector >, boost::no_property>, std::allocator >, boost::no_property> > > >, void*, boost::detail::edge_desc_impl, long int> >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::concepts::MultiPassInputIterator >, boost::no_property>*, std::vector >, boost::no_property>, std::allocator >, boost::no_property> > > >, void*, boost::detail::edge_desc_impl, long int> >]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied >, boost::no_property>*, std::vector >, boost::no_property>, std::allocator >, boost::no_property> > > >, void*, boost::detail::edge_desc_impl, long int> > >::value’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied >, boost::no_property>*, std::vector >, boost::no_property>, std::allocator >, boost::no_property> > > >, void*, boost::detail::edge_desc_impl, long int> > >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_ >, boost::no_property>*, std::vector >, boost::no_property>, std::allocator >, boost::no_property> > > >, void*, boost::detail::edge_desc_impl, long int> >)>’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/graph_concepts.hpp:89:9: [ skipping 7 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied > > >::value’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied > > >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_ > >)>’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/dominator_tree.hpp:245:5: required from ‘void boost::lengauer_tarjan_dominator_tree(const Graph&, const typename graph_traits::vertex_descriptor&, const IndexMap&, TimeMap, PredMap, VertexVector&, DomTreePredMap) [with Graph = adjacency_list >; IndexMap = adj_list_vertex_property_map >, int, const int&, vertex_index_t>; TimeMap = iterator_property_map<__gnu_cxx::__normal_iterator > >, adj_list_vertex_property_map >, int, const int&, vertex_index_t>, long unsigned int, long unsigned int&>; PredMap = iterator_property_map<__gnu_cxx::__normal_iterator >, adj_list_vertex_property_map >, int, const int&, vertex_index_t>, void*, void*&>; VertexVector = std::vector; DomTreePredMap = iterator_property_map<__gnu_cxx::__normal_iterator >, adj_list_vertex_property_map >, int, int&, vertex_index_t> >; typename graph_traits::vertex_descriptor = void*]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/dominator_tree.hpp:360:35: required from ‘void boost::lengauer_tarjan_dominator_tree(const Graph&, const typename graph_traits::vertex_descriptor&, DomTreePredMap) [with Graph = adjacency_list >; DomTreePredMap = iterator_property_map<__gnu_cxx::__normal_iterator >, adj_list_vertex_property_map >, int, int&, vertex_index_t> >; typename graph_traits::vertex_descriptor = void*]’ dominatorTree.cpp:46:36: required from here /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::concepts::MultiPassInputIterator >, boost::no_property>*, std::vector >, boost::no_property>, std::allocator >, boost::no_property> > > >, void*, boost::detail::edge_desc_impl, long int> >]’ 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ^ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::MultiPassInputIterator >, boost::no_property>*, std::vector >, boost::no_property>, std::allocator >, boost::no_property> > > >, void*, boost::detail::edge_desc_impl, long int> >]’: /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/graph_concepts.hpp:89:9: required from ‘boost::concepts::IncidenceGraph::~IncidenceGraph() [with G = boost::adjacency_list >]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/usage.hpp:20:48: required from ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::concepts::IncidenceGraph > >]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements > > >]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/graph_concepts.hpp:87:5: required from ‘struct boost::concepts::IncidenceGraph > >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/graph_concepts.hpp:118:1: required from ‘struct boost::concepts::BidirectionalGraph > >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/graph_concepts.hpp:118:1: [ skipping 2 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied > > >::value’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied > > >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_ > >)>’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/dominator_tree.hpp:245:5: required from ‘void boost::lengauer_tarjan_dominator_tree(const Graph&, const typename graph_traits::vertex_descriptor&, const IndexMap&, TimeMap, PredMap, VertexVector&, DomTreePredMap) [with Graph = adjacency_list >; IndexMap = adj_list_vertex_property_map >, int, const int&, vertex_index_t>; TimeMap = iterator_property_map<__gnu_cxx::__normal_iterator > >, adj_list_vertex_property_map >, int, const int&, vertex_index_t>, long unsigned int, long unsigned int&>; PredMap = iterator_property_map<__gnu_cxx::__normal_iterator >, adj_list_vertex_property_map >, int, const int&, vertex_index_t>, void*, void*&>; VertexVector = std::vector; DomTreePredMap = iterator_property_map<__gnu_cxx::__normal_iterator >, adj_list_vertex_property_map >, int, int&, vertex_index_t> >; typename graph_traits::vertex_descriptor = void*]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/dominator_tree.hpp:360:35: required from ‘void boost::lengauer_tarjan_dominator_tree(const Graph&, const typename graph_traits::vertex_descriptor&, DomTreePredMap) [with Graph = adjacency_list >; DomTreePredMap = iterator_property_map<__gnu_cxx::__normal_iterator >, adj_list_vertex_property_map >, int, int&, vertex_index_t> >; typename graph_traits::vertex_descriptor = void*]’ dominatorTree.cpp:46:36: required from here /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::concepts::MultiPassInputIterator::~MultiPassInputIterator() [with T = boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator >, boost::no_property>*, std::vector >, boost::no_property>, std::allocator >, boost::no_property> > > >, void*, boost::detail::edge_desc_impl, long int>]’ 37 | ~model() | ^ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/graph_concepts.hpp:52:50: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 52 | BOOST_concept(MultiPassInputIterator, (T)) { BOOST_CONCEPT_USAGE( | ^~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements > >]’: /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:137:5: required from ‘struct boost::DefaultConstructible >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::DefaultConstructible >]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied > >::value’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied > >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_ >)>’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/graph_concepts.hpp:90:9: [ skipping 7 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied > > >::value’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied > > >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_ > >)>’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/dominator_tree.hpp:245:5: required from ‘void boost::lengauer_tarjan_dominator_tree(const Graph&, const typename graph_traits::vertex_descriptor&, const IndexMap&, TimeMap, PredMap, VertexVector&, DomTreePredMap) [with Graph = adjacency_list >; IndexMap = adj_list_vertex_property_map >, int, const int&, vertex_index_t>; TimeMap = iterator_property_map<__gnu_cxx::__normal_iterator > >, adj_list_vertex_property_map >, int, const int&, vertex_index_t>, long unsigned int, long unsigned int&>; PredMap = iterator_property_map<__gnu_cxx::__normal_iterator >, adj_list_vertex_property_map >, int, const int&, vertex_index_t>, void*, void*&>; VertexVector = std::vector; DomTreePredMap = iterator_property_map<__gnu_cxx::__normal_iterator >, adj_list_vertex_property_map >, int, int&, vertex_index_t> >; typename graph_traits::vertex_descriptor = void*]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/dominator_tree.hpp:360:35: required from ‘void boost::lengauer_tarjan_dominator_tree(const Graph&, const typename graph_traits::vertex_descriptor&, DomTreePredMap) [with Graph = adjacency_list >; DomTreePredMap = iterator_property_map<__gnu_cxx::__normal_iterator >, adj_list_vertex_property_map >, int, int&, vertex_index_t> >; typename graph_traits::vertex_descriptor = void*]’ dominatorTree.cpp:46:36: required from here /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::DefaultConstructible >]’ 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ^ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::DefaultConstructible >]’: /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/graph_concepts.hpp:90:9: required from ‘boost::concepts::IncidenceGraph::~IncidenceGraph() [with G = boost::adjacency_list >]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/usage.hpp:20:48: required from ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::concepts::IncidenceGraph > >]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements > > >]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/graph_concepts.hpp:87:5: required from ‘struct boost::concepts::IncidenceGraph > >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/graph_concepts.hpp:118:1: required from ‘struct boost::concepts::BidirectionalGraph > >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/graph_concepts.hpp:118:1: [ skipping 2 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied > > >::value’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied > > >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_ > >)>’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/dominator_tree.hpp:245:5: required from ‘void boost::lengauer_tarjan_dominator_tree(const Graph&, const typename graph_traits::vertex_descriptor&, const IndexMap&, TimeMap, PredMap, VertexVector&, DomTreePredMap) [with Graph = adjacency_list >; IndexMap = adj_list_vertex_property_map >, int, const int&, vertex_index_t>; TimeMap = iterator_property_map<__gnu_cxx::__normal_iterator > >, adj_list_vertex_property_map >, int, const int&, vertex_index_t>, long unsigned int, long unsigned int&>; PredMap = iterator_property_map<__gnu_cxx::__normal_iterator >, adj_list_vertex_property_map >, int, const int&, vertex_index_t>, void*, void*&>; VertexVector = std::vector; DomTreePredMap = iterator_property_map<__gnu_cxx::__normal_iterator >, adj_list_vertex_property_map >, int, int&, vertex_index_t> >; typename graph_traits::vertex_descriptor = void*]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/dominator_tree.hpp:360:35: required from ‘void boost::lengauer_tarjan_dominator_tree(const Graph&, const typename graph_traits::vertex_descriptor&, DomTreePredMap) [with Graph = adjacency_list >; DomTreePredMap = iterator_property_map<__gnu_cxx::__normal_iterator >, adj_list_vertex_property_map >, int, int&, vertex_index_t> >; typename graph_traits::vertex_descriptor = void*]’ dominatorTree.cpp:46:36: required from here /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::DefaultConstructible::~DefaultConstructible() [with TT = boost::detail::edge_desc_impl]’ 37 | ~model() | ^ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:137:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 137 | BOOST_CONCEPT_USAGE(DefaultConstructible) { | ^~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements > >]’: /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:233:5: required from ‘struct boost::EqualityComparable >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::EqualityComparable >]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied > >::value’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied > >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_ >)>’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/graph_concepts.hpp:91:9: [ skipping 7 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied > > >::value’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied > > >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_ > >)>’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/dominator_tree.hpp:245:5: required from ‘void boost::lengauer_tarjan_dominator_tree(const Graph&, const typename graph_traits::vertex_descriptor&, const IndexMap&, TimeMap, PredMap, VertexVector&, DomTreePredMap) [with Graph = adjacency_list >; IndexMap = adj_list_vertex_property_map >, int, const int&, vertex_index_t>; TimeMap = iterator_property_map<__gnu_cxx::__normal_iterator > >, adj_list_vertex_property_map >, int, const int&, vertex_index_t>, long unsigned int, long unsigned int&>; PredMap = iterator_property_map<__gnu_cxx::__normal_iterator >, adj_list_vertex_property_map >, int, const int&, vertex_index_t>, void*, void*&>; VertexVector = std::vector; DomTreePredMap = iterator_property_map<__gnu_cxx::__normal_iterator >, adj_list_vertex_property_map >, int, int&, vertex_index_t> >; typename graph_traits::vertex_descriptor = void*]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/dominator_tree.hpp:360:35: required from ‘void boost::lengauer_tarjan_dominator_tree(const Graph&, const typename graph_traits::vertex_descriptor&, DomTreePredMap) [with Graph = adjacency_list >; DomTreePredMap = iterator_property_map<__gnu_cxx::__normal_iterator >, adj_list_vertex_property_map >, int, int&, vertex_index_t> >; typename graph_traits::vertex_descriptor = void*]’ dominatorTree.cpp:46:36: required from here /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::EqualityComparable >]’ 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ^ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::EqualityComparable >]’: /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/graph_concepts.hpp:91:9: required from ‘boost::concepts::IncidenceGraph::~IncidenceGraph() [with G = boost::adjacency_list >]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/usage.hpp:20:48: required from ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::concepts::IncidenceGraph > >]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements > > >]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/graph_concepts.hpp:87:5: required from ‘struct boost::concepts::IncidenceGraph > >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/graph_concepts.hpp:118:1: required from ‘struct boost::concepts::BidirectionalGraph > >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/graph_concepts.hpp:118:1: [ skipping 2 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied > > >::value’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied > > >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_ > >)>’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/dominator_tree.hpp:245:5: required from ‘void boost::lengauer_tarjan_dominator_tree(const Graph&, const typename graph_traits::vertex_descriptor&, const IndexMap&, TimeMap, PredMap, VertexVector&, DomTreePredMap) [with Graph = adjacency_list >; IndexMap = adj_list_vertex_property_map >, int, const int&, vertex_index_t>; TimeMap = iterator_property_map<__gnu_cxx::__normal_iterator > >, adj_list_vertex_property_map >, int, const int&, vertex_index_t>, long unsigned int, long unsigned int&>; PredMap = iterator_property_map<__gnu_cxx::__normal_iterator >, adj_list_vertex_property_map >, int, const int&, vertex_index_t>, void*, void*&>; VertexVector = std::vector; DomTreePredMap = iterator_property_map<__gnu_cxx::__normal_iterator >, adj_list_vertex_property_map >, int, int&, vertex_index_t> >; typename graph_traits::vertex_descriptor = void*]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/dominator_tree.hpp:360:35: required from ‘void boost::lengauer_tarjan_dominator_tree(const Graph&, const typename graph_traits::vertex_descriptor&, DomTreePredMap) [with Graph = adjacency_list >; DomTreePredMap = iterator_property_map<__gnu_cxx::__normal_iterator >, adj_list_vertex_property_map >, int, int&, vertex_index_t> >; typename graph_traits::vertex_descriptor = void*]’ dominatorTree.cpp:46:36: required from here /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::EqualityComparable::~EqualityComparable() [with TT = boost::detail::edge_desc_impl]’ 37 | ~model() | ^ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:233:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 233 | BOOST_CONCEPT_USAGE(EqualityComparable) { | ^~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements > >]’: /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:145:5: required from ‘struct boost::Assignable >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::Assignable >]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied > >::value’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied > >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_ >)>’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/graph_concepts.hpp:92:9: [ skipping 7 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied > > >::value’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied > > >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_ > >)>’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/dominator_tree.hpp:245:5: required from ‘void boost::lengauer_tarjan_dominator_tree(const Graph&, const typename graph_traits::vertex_descriptor&, const IndexMap&, TimeMap, PredMap, VertexVector&, DomTreePredMap) [with Graph = adjacency_list >; IndexMap = adj_list_vertex_property_map >, int, const int&, vertex_index_t>; TimeMap = iterator_property_map<__gnu_cxx::__normal_iterator > >, adj_list_vertex_property_map >, int, const int&, vertex_index_t>, long unsigned int, long unsigned int&>; PredMap = iterator_property_map<__gnu_cxx::__normal_iterator >, adj_list_vertex_property_map >, int, const int&, vertex_index_t>, void*, void*&>; VertexVector = std::vector; DomTreePredMap = iterator_property_map<__gnu_cxx::__normal_iterator >, adj_list_vertex_property_map >, int, int&, vertex_index_t> >; typename graph_traits::vertex_descriptor = void*]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/dominator_tree.hpp:360:35: required from ‘void boost::lengauer_tarjan_dominator_tree(const Graph&, const typename graph_traits::vertex_descriptor&, DomTreePredMap) [with Graph = adjacency_list >; DomTreePredMap = iterator_property_map<__gnu_cxx::__normal_iterator >, adj_list_vertex_property_map >, int, int&, vertex_index_t> >; typename graph_traits::vertex_descriptor = void*]’ dominatorTree.cpp:46:36: required from here /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::Assignable >]’ 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ^ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::Assignable >]’: /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/graph_concepts.hpp:92:9: required from ‘boost::concepts::IncidenceGraph::~IncidenceGraph() [with G = boost::adjacency_list >]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/usage.hpp:20:48: required from ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::concepts::IncidenceGraph > >]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements > > >]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/graph_concepts.hpp:87:5: required from ‘struct boost::concepts::IncidenceGraph > >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/graph_concepts.hpp:118:1: required from ‘struct boost::concepts::BidirectionalGraph > >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/graph_concepts.hpp:118:1: [ skipping 2 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied > > >::value’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied > > >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_ > >)>’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/dominator_tree.hpp:245:5: required from ‘void boost::lengauer_tarjan_dominator_tree(const Graph&, const typename graph_traits::vertex_descriptor&, const IndexMap&, TimeMap, PredMap, VertexVector&, DomTreePredMap) [with Graph = adjacency_list >; IndexMap = adj_list_vertex_property_map >, int, const int&, vertex_index_t>; TimeMap = iterator_property_map<__gnu_cxx::__normal_iterator > >, adj_list_vertex_property_map >, int, const int&, vertex_index_t>, long unsigned int, long unsigned int&>; PredMap = iterator_property_map<__gnu_cxx::__normal_iterator >, adj_list_vertex_property_map >, int, const int&, vertex_index_t>, void*, void*&>; VertexVector = std::vector; DomTreePredMap = iterator_property_map<__gnu_cxx::__normal_iterator >, adj_list_vertex_property_map >, int, int&, vertex_index_t> >; typename graph_traits::vertex_descriptor = void*]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/dominator_tree.hpp:360:35: required from ‘void boost::lengauer_tarjan_dominator_tree(const Graph&, const typename graph_traits::vertex_descriptor&, DomTreePredMap) [with Graph = adjacency_list >; DomTreePredMap = iterator_property_map<__gnu_cxx::__normal_iterator >, adj_list_vertex_property_map >, int, int&, vertex_index_t> >; typename graph_traits::vertex_descriptor = void*]’ dominatorTree.cpp:46:36: required from here /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::Assignable::~Assignable() [with TT = boost::detail::edge_desc_impl]’ 37 | ~model() | ^ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:145:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 145 | BOOST_CONCEPT_USAGE(Assignable) { | ^~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements >]’: /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:208:5: required from ‘struct boost::Convertible’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::Convertible]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied >::value’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_)>’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/graph_concepts.hpp:93:9: [ skipping 7 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied > > >::value’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied > > >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_ > >)>’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/dominator_tree.hpp:245:5: required from ‘void boost::lengauer_tarjan_dominator_tree(const Graph&, const typename graph_traits::vertex_descriptor&, const IndexMap&, TimeMap, PredMap, VertexVector&, DomTreePredMap) [with Graph = adjacency_list >; IndexMap = adj_list_vertex_property_map >, int, const int&, vertex_index_t>; TimeMap = iterator_property_map<__gnu_cxx::__normal_iterator > >, adj_list_vertex_property_map >, int, const int&, vertex_index_t>, long unsigned int, long unsigned int&>; PredMap = iterator_property_map<__gnu_cxx::__normal_iterator >, adj_list_vertex_property_map >, int, const int&, vertex_index_t>, void*, void*&>; VertexVector = std::vector; DomTreePredMap = iterator_property_map<__gnu_cxx::__normal_iterator >, adj_list_vertex_property_map >, int, int&, vertex_index_t> >; typename graph_traits::vertex_descriptor = void*]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/dominator_tree.hpp:360:35: required from ‘void boost::lengauer_tarjan_dominator_tree(const Graph&, const typename graph_traits::vertex_descriptor&, DomTreePredMap) [with Graph = adjacency_list >; DomTreePredMap = iterator_property_map<__gnu_cxx::__normal_iterator >, adj_list_vertex_property_map >, int, int&, vertex_index_t> >; typename graph_traits::vertex_descriptor = void*]’ dominatorTree.cpp:46:36: required from here /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::Convertible]’ 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ^ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::Convertible]’: /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/graph_concepts.hpp:93:9: required from ‘boost::concepts::IncidenceGraph::~IncidenceGraph() [with G = boost::adjacency_list >]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/usage.hpp:20:48: required from ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::concepts::IncidenceGraph > >]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements > > >]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/graph_concepts.hpp:87:5: required from ‘struct boost::concepts::IncidenceGraph > >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/graph_concepts.hpp:118:1: required from ‘struct boost::concepts::BidirectionalGraph > >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/graph_concepts.hpp:118:1: [ skipping 2 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied > > >::value’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied > > >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_ > >)>’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/dominator_tree.hpp:245:5: required from ‘void boost::lengauer_tarjan_dominator_tree(const Graph&, const typename graph_traits::vertex_descriptor&, const IndexMap&, TimeMap, PredMap, VertexVector&, DomTreePredMap) [with Graph = adjacency_list >; IndexMap = adj_list_vertex_property_map >, int, const int&, vertex_index_t>; TimeMap = iterator_property_map<__gnu_cxx::__normal_iterator > >, adj_list_vertex_property_map >, int, const int&, vertex_index_t>, long unsigned int, long unsigned int&>; PredMap = iterator_property_map<__gnu_cxx::__normal_iterator >, adj_list_vertex_property_map >, int, const int&, vertex_index_t>, void*, void*&>; VertexVector = std::vector; DomTreePredMap = iterator_property_map<__gnu_cxx::__normal_iterator >, adj_list_vertex_property_map >, int, int&, vertex_index_t> >; typename graph_traits::vertex_descriptor = void*]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/dominator_tree.hpp:360:35: required from ‘void boost::lengauer_tarjan_dominator_tree(const Graph&, const typename graph_traits::vertex_descriptor&, DomTreePredMap) [with Graph = adjacency_list >; DomTreePredMap = iterator_property_map<__gnu_cxx::__normal_iterator >, adj_list_vertex_property_map >, int, int&, vertex_index_t> >; typename graph_traits::vertex_descriptor = void*]’ dominatorTree.cpp:46:36: required from here /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::Convertible::~Convertible() [with X = boost::bidir_adj_list_traversal_tag; Y = boost::incidence_graph_tag]’ 37 | ~model() | ^ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:208:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 208 | BOOST_CONCEPT_USAGE(Convertible) { | ^~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::concepts::MultiPassInputIterator >, boost::no_property>*, std::vector >, boost::no_property>, std::allocator >, boost::no_property> > > >, void*, boost::detail::edge_desc_impl, long int> >]’: /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements >, boost::no_property>*, std::vector >, boost::no_property>, std::allocator >, boost::no_property> > > >, void*, boost::detail::edge_desc_impl, long int> > >]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/graph_concepts.hpp:52:50: required from ‘struct boost::concepts::MultiPassInputIterator >, boost::no_property>*, std::vector >, boost::no_property>, std::allocator >, boost::no_property> > > >, void*, boost::detail::edge_desc_impl, long int> >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::concepts::MultiPassInputIterator >, boost::no_property>*, std::vector >, boost::no_property>, std::allocator >, boost::no_property> > > >, void*, boost::detail::edge_desc_impl, long int> >]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied >, boost::no_property>*, std::vector >, boost::no_property>, std::allocator >, boost::no_property> > > >, void*, boost::detail::edge_desc_impl, long int> > >::value’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied >, boost::no_property>*, std::vector >, boost::no_property>, std::allocator >, boost::no_property> > > >, void*, boost::detail::edge_desc_impl, long int> > >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_ >, boost::no_property>*, std::vector >, boost::no_property>, std::allocator >, boost::no_property> > > >, void*, boost::detail::edge_desc_impl, long int> >)>’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/graph_concepts.hpp:125:9: required from ‘boost::concepts::BidirectionalGraph::~BidirectionalGraph() [with G = boost::adjacency_list >]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/graph_concepts.hpp:118:1: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::BidirectionalGraphConcept > >]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/dominator_tree.hpp:245:5: required from ‘void boost::lengauer_tarjan_dominator_tree(const Graph&, const typename graph_traits::vertex_descriptor&, const IndexMap&, TimeMap, PredMap, VertexVector&, DomTreePredMap) [with Graph = adjacency_list >; IndexMap = adj_list_vertex_property_map >, int, const int&, vertex_index_t>; TimeMap = iterator_property_map<__gnu_cxx::__normal_iterator > >, adj_list_vertex_property_map >, int, const int&, vertex_index_t>, long unsigned int, long unsigned int&>; PredMap = iterator_property_map<__gnu_cxx::__normal_iterator >, adj_list_vertex_property_map >, int, const int&, vertex_index_t>, void*, void*&>; VertexVector = std::vector; DomTreePredMap = iterator_property_map<__gnu_cxx::__normal_iterator >, adj_list_vertex_property_map >, int, int&, vertex_index_t> >; typename graph_traits::vertex_descriptor = void*]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/dominator_tree.hpp:360:35: required from ‘void boost::lengauer_tarjan_dominator_tree(const Graph&, const typename graph_traits::vertex_descriptor&, DomTreePredMap) [with Graph = adjacency_list >; DomTreePredMap = iterator_property_map<__gnu_cxx::__normal_iterator >, adj_list_vertex_property_map >, int, int&, vertex_index_t> >; typename graph_traits::vertex_descriptor = void*]’ dominatorTree.cpp:46:36: required from here /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::concepts::MultiPassInputIterator::~MultiPassInputIterator() [with T = boost::detail::in_edge_iter<__gnu_cxx::__normal_iterator >, boost::no_property>*, std::vector >, boost::no_property>, std::allocator >, boost::no_property> > > >, void*, boost::detail::edge_desc_impl, long int>]’ 37 | ~model() | ^ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/graph_concepts.hpp:52:50: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 52 | BOOST_concept(MultiPassInputIterator, (T)) { BOOST_CONCEPT_USAGE( | ^~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::Convertible]’: /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements >]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:208:5: required from ‘struct boost::Convertible’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::Convertible]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied >::value’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_)>’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/graph_concepts.hpp:126:9: required from ‘boost::concepts::BidirectionalGraph::~BidirectionalGraph() [with G = boost::adjacency_list >]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/graph_concepts.hpp:118:1: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::BidirectionalGraphConcept > >]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/dominator_tree.hpp:245:5: required from ‘void boost::lengauer_tarjan_dominator_tree(const Graph&, const typename graph_traits::vertex_descriptor&, const IndexMap&, TimeMap, PredMap, VertexVector&, DomTreePredMap) [with Graph = adjacency_list >; IndexMap = adj_list_vertex_property_map >, int, const int&, vertex_index_t>; TimeMap = iterator_property_map<__gnu_cxx::__normal_iterator > >, adj_list_vertex_property_map >, int, const int&, vertex_index_t>, long unsigned int, long unsigned int&>; PredMap = iterator_property_map<__gnu_cxx::__normal_iterator >, adj_list_vertex_property_map >, int, const int&, vertex_index_t>, void*, void*&>; VertexVector = std::vector; DomTreePredMap = iterator_property_map<__gnu_cxx::__normal_iterator >, adj_list_vertex_property_map >, int, int&, vertex_index_t> >; typename graph_traits::vertex_descriptor = void*]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/dominator_tree.hpp:360:35: required from ‘void boost::lengauer_tarjan_dominator_tree(const Graph&, const typename graph_traits::vertex_descriptor&, DomTreePredMap) [with Graph = adjacency_list >; DomTreePredMap = iterator_property_map<__gnu_cxx::__normal_iterator >, adj_list_vertex_property_map >, int, int&, vertex_index_t> >; typename graph_traits::vertex_descriptor = void*]’ dominatorTree.cpp:46:36: required from here /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::Convertible::~Convertible() [with X = boost::bidir_adj_list_traversal_tag; Y = boost::bidirectional_graph_tag]’ 37 | ~model() | ^ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:208:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 208 | BOOST_CONCEPT_USAGE(Convertible) { | ^~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements >, boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>, void*, void*&>, boost::on_tree_edge>, boost::detail::time_stamper_with_vertex_vector > >, boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>, long unsigned int, long unsigned int&>, std::vector, long unsigned int, boost::on_discover_vertex> > > > >]’: /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:167:5: required from ‘struct boost::CopyConstructible >, boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>, void*, void*&>, boost::on_tree_edge>, boost::detail::time_stamper_with_vertex_vector > >, boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>, long unsigned int, long unsigned int&>, std::vector, long unsigned int, boost::on_discover_vertex> > > >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:165:3: required from ‘struct boost::CopyConstructibleConcept >, boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>, void*, void*&>, boost::on_tree_edge>, boost::detail::time_stamper_with_vertex_vector > >, boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>, long unsigned int, long unsigned int&>, std::vector, long unsigned int, boost::on_discover_vertex> > > >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::CopyConstructibleConcept >, boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>, void*, void*&>, boost::on_tree_edge>, boost::detail::time_stamper_with_vertex_vector > >, boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>, long unsigned int, long unsigned int&>, std::vector, long unsigned int, boost::on_discover_vertex> > > >]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied >, boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>, void*, void*&>, boost::on_tree_edge>, boost::detail::time_stamper_with_vertex_vector > >, boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>, long unsigned int, long unsigned int&>, std::vector, long unsigned int, boost::on_discover_vertex> > > > >::value’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied >, boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>, void*, void*&>, boost::on_tree_edge>, boost::detail::time_stamper_with_vertex_vector > >, boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>, long unsigned int, long unsigned int&>, std::vector, long unsigned int, boost::on_discover_vertex> > > > >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:72:8: [ skipping 5 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_ >, boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>, void*, void*&>, boost::on_tree_edge>, boost::detail::time_stamper_with_vertex_vector > >, boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>, long unsigned int, long unsigned int&>, std::vector, long unsigned int, boost::on_discover_vertex> > >, boost::adjacency_list > >)>’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/depth_first_search.hpp:130:9: required from ‘void boost::detail::depth_first_visit_impl(const IncidenceGraph&, typename boost::graph_traits::vertex_descriptor, DFSVisitor&, ColorMap, TerminatorFunc) [with IncidenceGraph = boost::adjacency_list >; DFSVisitor = boost::dfs_visitor >, boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>, void*, void*&>, boost::on_tree_edge>, time_stamper_with_vertex_vector > >, boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>, long unsigned int, long unsigned int&>, std::vector, long unsigned int, boost::on_discover_vertex> > >; ColorMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>, boost::default_color_type, boost::default_color_type&>; TerminatorFunc = nontruth2; typename boost::graph_traits::vertex_descriptor = void*]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/depth_first_search.hpp:417:35: required from ‘void boost::depth_first_visit(const IncidenceGraph&, typename graph_traits::vertex_descriptor, DFSVisitor, ColorMap) [with IncidenceGraph = adjacency_list >; DFSVisitor = dfs_visitor >, adj_list_vertex_property_map >, int, const int&, vertex_index_t>, void*, void*&>, on_tree_edge>, detail::time_stamper_with_vertex_vector > >, adj_list_vertex_property_map >, int, const int&, vertex_index_t>, long unsigned int, long unsigned int&>, std::vector, long unsigned int, on_discover_vertex> > >; ColorMap = iterator_property_map<__gnu_cxx::__normal_iterator >, adj_list_vertex_property_map >, int, const int&, vertex_index_t>, default_color_type, default_color_type&>; typename graph_traits::vertex_descriptor = void*]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/dominator_tree.hpp:309:22: required from ‘void boost::lengauer_tarjan_dominator_tree(const Graph&, const typename graph_traits::vertex_descriptor&, const IndexMap&, TimeMap, PredMap, VertexVector&, DomTreePredMap) [with Graph = adjacency_list >; IndexMap = adj_list_vertex_property_map >, int, const int&, vertex_index_t>; TimeMap = iterator_property_map<__gnu_cxx::__normal_iterator > >, adj_list_vertex_property_map >, int, const int&, vertex_index_t>, long unsigned int, long unsigned int&>; PredMap = iterator_property_map<__gnu_cxx::__normal_iterator >, adj_list_vertex_property_map >, int, const int&, vertex_index_t>, void*, void*&>; VertexVector = std::vector; DomTreePredMap = iterator_property_map<__gnu_cxx::__normal_iterator >, adj_list_vertex_property_map >, int, int&, vertex_index_t> >; typename graph_traits::vertex_descriptor = void*]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/dominator_tree.hpp:360:35: required from ‘void boost::lengauer_tarjan_dominator_tree(const Graph&, const typename graph_traits::vertex_descriptor&, DomTreePredMap) [with Graph = adjacency_list >; DomTreePredMap = iterator_property_map<__gnu_cxx::__normal_iterator >, adj_list_vertex_property_map >, int, int&, vertex_index_t> >; typename graph_traits::vertex_descriptor = void*]’ dominatorTree.cpp:46:36: required from here /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::CopyConstructible >, boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>, void*, void*&>, boost::on_tree_edge>, boost::detail::time_stamper_with_vertex_vector > >, boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>, long unsigned int, long unsigned int&>, std::vector, long unsigned int, boost::on_discover_vertex> > > >]’ 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ^ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::CopyConstructibleConcept >, boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>, void*, void*&>, boost::on_tree_edge>, boost::detail::time_stamper_with_vertex_vector > >, boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>, long unsigned int, long unsigned int&>, std::vector, long unsigned int, boost::on_discover_vertex> > > >]’: /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/depth_first_search.hpp:41:9: required from ‘void boost::DFSVisitorConcept::constraints() [with Visitor = boost::dfs_visitor >, boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>, void*, void*&>, boost::on_tree_edge>, boost::detail::time_stamper_with_vertex_vector > >, boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>, long unsigned int, long unsigned int&>, std::vector, long unsigned int, boost::on_discover_vertex> > >; Graph = boost::adjacency_list >]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::DFSVisitorConcept >, boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>, void*, void*&>, boost::on_tree_edge>, boost::detail::time_stamper_with_vertex_vector > >, boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>, long unsigned int, long unsigned int&>, std::vector, long unsigned int, boost::on_discover_vertex> > >, boost::adjacency_list > >]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied >, boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>, void*, void*&>, boost::on_tree_edge>, boost::detail::time_stamper_with_vertex_vector > >, boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>, long unsigned int, long unsigned int&>, std::vector, long unsigned int, boost::on_discover_vertex> > >, boost::adjacency_list > > >::value’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied >, boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>, void*, void*&>, boost::on_tree_edge>, boost::detail::time_stamper_with_vertex_vector > >, boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>, long unsigned int, long unsigned int&>, std::vector, long unsigned int, boost::on_discover_vertex> > >, boost::adjacency_list > > >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_ >, boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>, void*, void*&>, boost::on_tree_edge>, boost::detail::time_stamper_with_vertex_vector > >, boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>, long unsigned int, long unsigned int&>, std::vector, long unsigned int, boost::on_discover_vertex> > >, boost::adjacency_list > >)>’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/depth_first_search.hpp:130:9: required from ‘void boost::detail::depth_first_visit_impl(const IncidenceGraph&, typename boost::graph_traits::vertex_descriptor, DFSVisitor&, ColorMap, TerminatorFunc) [with IncidenceGraph = boost::adjacency_list >; DFSVisitor = boost::dfs_visitor >, boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>, void*, void*&>, boost::on_tree_edge>, time_stamper_with_vertex_vector > >, boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>, long unsigned int, long unsigned int&>, std::vector, long unsigned int, boost::on_discover_vertex> > >; ColorMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>, boost::default_color_type, boost::default_color_type&>; TerminatorFunc = nontruth2; typename boost::graph_traits::vertex_descriptor = void*]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/depth_first_search.hpp:417:35: required from ‘void boost::depth_first_visit(const IncidenceGraph&, typename graph_traits::vertex_descriptor, DFSVisitor, ColorMap) [with IncidenceGraph = adjacency_list >; DFSVisitor = dfs_visitor >, adj_list_vertex_property_map >, int, const int&, vertex_index_t>, void*, void*&>, on_tree_edge>, detail::time_stamper_with_vertex_vector > >, adj_list_vertex_property_map >, int, const int&, vertex_index_t>, long unsigned int, long unsigned int&>, std::vector, long unsigned int, on_discover_vertex> > >; ColorMap = iterator_property_map<__gnu_cxx::__normal_iterator >, adj_list_vertex_property_map >, int, const int&, vertex_index_t>, default_color_type, default_color_type&>; typename graph_traits::vertex_descriptor = void*]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/dominator_tree.hpp:309:22: required from ‘void boost::lengauer_tarjan_dominator_tree(const Graph&, const typename graph_traits::vertex_descriptor&, const IndexMap&, TimeMap, PredMap, VertexVector&, DomTreePredMap) [with Graph = adjacency_list >; IndexMap = adj_list_vertex_property_map >, int, const int&, vertex_index_t>; TimeMap = iterator_property_map<__gnu_cxx::__normal_iterator > >, adj_list_vertex_property_map >, int, const int&, vertex_index_t>, long unsigned int, long unsigned int&>; PredMap = iterator_property_map<__gnu_cxx::__normal_iterator >, adj_list_vertex_property_map >, int, const int&, vertex_index_t>, void*, void*&>; VertexVector = std::vector; DomTreePredMap = iterator_property_map<__gnu_cxx::__normal_iterator >, adj_list_vertex_property_map >, int, int&, vertex_index_t> >; typename graph_traits::vertex_descriptor = void*]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/dominator_tree.hpp:360:35: required from ‘void boost::lengauer_tarjan_dominator_tree(const Graph&, const typename graph_traits::vertex_descriptor&, DomTreePredMap) [with Graph = adjacency_list >; DomTreePredMap = iterator_property_map<__gnu_cxx::__normal_iterator >, adj_list_vertex_property_map >, int, int&, vertex_index_t> >; typename graph_traits::vertex_descriptor = void*]’ dominatorTree.cpp:46:36: required from here /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:165:17: note: in a call to non-static member function ‘boost::CopyConstructibleConcept >, boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>, void*, void*&>, boost::on_tree_edge>, boost::detail::time_stamper_with_vertex_vector > >, boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>, long unsigned int, long unsigned int&>, std::vector, long unsigned int, boost::on_discover_vertex> > > >::~CopyConstructibleConcept()’ 165 | BOOST_concept(CopyConstructible,(TT)) | ^~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/preprocessor/cat.hpp:29:34: note: in definition of macro ‘BOOST_PP_CAT_I’ 29 | # define BOOST_PP_CAT_I(a, b) a ## b | ^ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/concept_def.hpp:23:12: note: in expansion of macro ‘BOOST_PP_CAT’ 23 | struct BOOST_PP_CAT(name,Concept) \ | ^~~~~~~~~~~~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:165:3: note: in expansion of macro ‘BOOST_concept’ 165 | BOOST_concept(CopyConstructible,(TT)) | ^~~~~~~~~~~~~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::constraint::failed() [with Model = boost::ReadablePropertyMapConcept >, boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>, boost::default_color_type, boost::default_color_type&>, void*>]’: /home/omnipath/local/R/4.4-3.20/BH/include/boost/property_map/property_map.hpp:206:7: required from ‘void boost::ReadWritePropertyMapConcept::constraints() [with PMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>, boost::default_color_type, boost::default_color_type&>; Key = void*]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::ReadWritePropertyMapConcept >, boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>, boost::default_color_type, boost::default_color_type&>, void*>]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied >, boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>, boost::default_color_type, boost::default_color_type&>, void*> >::value’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied >, boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>, boost::default_color_type, boost::default_color_type&>, void*> >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_ >, boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>, boost::default_color_type, boost::default_color_type&>, void*>)>’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/depth_first_search.hpp:134:9: required from ‘void boost::detail::depth_first_visit_impl(const IncidenceGraph&, typename boost::graph_traits::vertex_descriptor, DFSVisitor&, ColorMap, TerminatorFunc) [with IncidenceGraph = boost::adjacency_list >; DFSVisitor = boost::dfs_visitor >, boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>, void*, void*&>, boost::on_tree_edge>, time_stamper_with_vertex_vector > >, boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>, long unsigned int, long unsigned int&>, std::vector, long unsigned int, boost::on_discover_vertex> > >; ColorMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>, boost::default_color_type, boost::default_color_type&>; TerminatorFunc = nontruth2; typename boost::graph_traits::vertex_descriptor = void*]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/depth_first_search.hpp:417:35: required from ‘void boost::depth_first_visit(const IncidenceGraph&, typename graph_traits::vertex_descriptor, DFSVisitor, ColorMap) [with IncidenceGraph = adjacency_list >; DFSVisitor = dfs_visitor >, adj_list_vertex_property_map >, int, const int&, vertex_index_t>, void*, void*&>, on_tree_edge>, detail::time_stamper_with_vertex_vector > >, adj_list_vertex_property_map >, int, const int&, vertex_index_t>, long unsigned int, long unsigned int&>, std::vector, long unsigned int, on_discover_vertex> > >; ColorMap = iterator_property_map<__gnu_cxx::__normal_iterator >, adj_list_vertex_property_map >, int, const int&, vertex_index_t>, default_color_type, default_color_type&>; typename graph_traits::vertex_descriptor = void*]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/dominator_tree.hpp:309:22: required from ‘void boost::lengauer_tarjan_dominator_tree(const Graph&, const typename graph_traits::vertex_descriptor&, const IndexMap&, TimeMap, PredMap, VertexVector&, DomTreePredMap) [with Graph = adjacency_list >; IndexMap = adj_list_vertex_property_map >, int, const int&, vertex_index_t>; TimeMap = iterator_property_map<__gnu_cxx::__normal_iterator > >, adj_list_vertex_property_map >, int, const int&, vertex_index_t>, long unsigned int, long unsigned int&>; PredMap = iterator_property_map<__gnu_cxx::__normal_iterator >, adj_list_vertex_property_map >, int, const int&, vertex_index_t>, void*, void*&>; VertexVector = std::vector; DomTreePredMap = iterator_property_map<__gnu_cxx::__normal_iterator >, adj_list_vertex_property_map >, int, int&, vertex_index_t> >; typename graph_traits::vertex_descriptor = void*]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/dominator_tree.hpp:360:35: required from ‘void boost::lengauer_tarjan_dominator_tree(const Graph&, const typename graph_traits::vertex_descriptor&, DomTreePredMap) [with Graph = adjacency_list >; DomTreePredMap = iterator_property_map<__gnu_cxx::__normal_iterator >, adj_list_vertex_property_map >, int, int&, vertex_index_t> >; typename graph_traits::vertex_descriptor = void*]’ dominatorTree.cpp:46:36: required from here /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:65:52: warning: ‘this’ pointer is null [-Wnonnull] 65 | static void failed() { ((Model*)0)->constraints(); } | ~~~~~~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/property_map/property_map.hpp:147:10: note: in a call to non-static member function ‘void boost::ReadablePropertyMapConcept::constraints() [with PMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>, boost::default_color_type, boost::default_color_type&>; Key = void*]’ 147 | void constraints() { | ^~~~~~~~~~~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::constraint::failed() [with Model = boost::WritablePropertyMapConcept >, boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>, boost::default_color_type, boost::default_color_type&>, void*>]’: /home/omnipath/local/R/4.4-3.20/BH/include/boost/property_map/property_map.hpp:207:7: required from ‘void boost::ReadWritePropertyMapConcept::constraints() [with PMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>, boost::default_color_type, boost::default_color_type&>; Key = void*]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::ReadWritePropertyMapConcept >, boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>, boost::default_color_type, boost::default_color_type&>, void*>]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied >, boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>, boost::default_color_type, boost::default_color_type&>, void*> >::value’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied >, boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>, boost::default_color_type, boost::default_color_type&>, void*> >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_ >, boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>, boost::default_color_type, boost::default_color_type&>, void*>)>’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/depth_first_search.hpp:134:9: required from ‘void boost::detail::depth_first_visit_impl(const IncidenceGraph&, typename boost::graph_traits::vertex_descriptor, DFSVisitor&, ColorMap, TerminatorFunc) [with IncidenceGraph = boost::adjacency_list >; DFSVisitor = boost::dfs_visitor >, boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>, void*, void*&>, boost::on_tree_edge>, time_stamper_with_vertex_vector > >, boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>, long unsigned int, long unsigned int&>, std::vector, long unsigned int, boost::on_discover_vertex> > >; ColorMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>, boost::default_color_type, boost::default_color_type&>; TerminatorFunc = nontruth2; typename boost::graph_traits::vertex_descriptor = void*]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/depth_first_search.hpp:417:35: required from ‘void boost::depth_first_visit(const IncidenceGraph&, typename graph_traits::vertex_descriptor, DFSVisitor, ColorMap) [with IncidenceGraph = adjacency_list >; DFSVisitor = dfs_visitor >, adj_list_vertex_property_map >, int, const int&, vertex_index_t>, void*, void*&>, on_tree_edge>, detail::time_stamper_with_vertex_vector > >, adj_list_vertex_property_map >, int, const int&, vertex_index_t>, long unsigned int, long unsigned int&>, std::vector, long unsigned int, on_discover_vertex> > >; ColorMap = iterator_property_map<__gnu_cxx::__normal_iterator >, adj_list_vertex_property_map >, int, const int&, vertex_index_t>, default_color_type, default_color_type&>; typename graph_traits::vertex_descriptor = void*]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/dominator_tree.hpp:309:22: required from ‘void boost::lengauer_tarjan_dominator_tree(const Graph&, const typename graph_traits::vertex_descriptor&, const IndexMap&, TimeMap, PredMap, VertexVector&, DomTreePredMap) [with Graph = adjacency_list >; IndexMap = adj_list_vertex_property_map >, int, const int&, vertex_index_t>; TimeMap = iterator_property_map<__gnu_cxx::__normal_iterator > >, adj_list_vertex_property_map >, int, const int&, vertex_index_t>, long unsigned int, long unsigned int&>; PredMap = iterator_property_map<__gnu_cxx::__normal_iterator >, adj_list_vertex_property_map >, int, const int&, vertex_index_t>, void*, void*&>; VertexVector = std::vector; DomTreePredMap = iterator_property_map<__gnu_cxx::__normal_iterator >, adj_list_vertex_property_map >, int, int&, vertex_index_t> >; typename graph_traits::vertex_descriptor = void*]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/dominator_tree.hpp:360:35: required from ‘void boost::lengauer_tarjan_dominator_tree(const Graph&, const typename graph_traits::vertex_descriptor&, DomTreePredMap) [with Graph = adjacency_list >; DomTreePredMap = iterator_property_map<__gnu_cxx::__normal_iterator >, adj_list_vertex_property_map >, int, int&, vertex_index_t> >; typename graph_traits::vertex_descriptor = void*]’ dominatorTree.cpp:46:36: required from here /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:65:52: warning: ‘this’ pointer is null [-Wnonnull] 65 | static void failed() { ((Model*)0)->constraints(); } | ~~~~~~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/property_map/property_map.hpp:179:10: note: in a call to non-static member function ‘void boost::WritablePropertyMapConcept::constraints() [with PMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>, boost::default_color_type, boost::default_color_type&>; Key = void*]’ 179 | void constraints() { | ^~~~~~~~~~~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements >]’: /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:208:5: required from ‘struct boost::Convertible’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:206:3: required from ‘struct boost::ConvertibleConcept’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::ConvertibleConcept]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied >::value’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:72:8: [ skipping 5 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_ >, boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>, boost::default_color_type, boost::default_color_type&>, void*>)>’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/depth_first_search.hpp:134:9: required from ‘void boost::detail::depth_first_visit_impl(const IncidenceGraph&, typename boost::graph_traits::vertex_descriptor, DFSVisitor&, ColorMap, TerminatorFunc) [with IncidenceGraph = boost::adjacency_list >; DFSVisitor = boost::dfs_visitor >, boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>, void*, void*&>, boost::on_tree_edge>, time_stamper_with_vertex_vector > >, boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>, long unsigned int, long unsigned int&>, std::vector, long unsigned int, boost::on_discover_vertex> > >; ColorMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>, boost::default_color_type, boost::default_color_type&>; TerminatorFunc = nontruth2; typename boost::graph_traits::vertex_descriptor = void*]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/depth_first_search.hpp:417:35: required from ‘void boost::depth_first_visit(const IncidenceGraph&, typename graph_traits::vertex_descriptor, DFSVisitor, ColorMap) [with IncidenceGraph = adjacency_list >; DFSVisitor = dfs_visitor >, adj_list_vertex_property_map >, int, const int&, vertex_index_t>, void*, void*&>, on_tree_edge>, detail::time_stamper_with_vertex_vector > >, adj_list_vertex_property_map >, int, const int&, vertex_index_t>, long unsigned int, long unsigned int&>, std::vector, long unsigned int, on_discover_vertex> > >; ColorMap = iterator_property_map<__gnu_cxx::__normal_iterator >, adj_list_vertex_property_map >, int, const int&, vertex_index_t>, default_color_type, default_color_type&>; typename graph_traits::vertex_descriptor = void*]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/dominator_tree.hpp:309:22: required from ‘void boost::lengauer_tarjan_dominator_tree(const Graph&, const typename graph_traits::vertex_descriptor&, const IndexMap&, TimeMap, PredMap, VertexVector&, DomTreePredMap) [with Graph = adjacency_list >; IndexMap = adj_list_vertex_property_map >, int, const int&, vertex_index_t>; TimeMap = iterator_property_map<__gnu_cxx::__normal_iterator > >, adj_list_vertex_property_map >, int, const int&, vertex_index_t>, long unsigned int, long unsigned int&>; PredMap = iterator_property_map<__gnu_cxx::__normal_iterator >, adj_list_vertex_property_map >, int, const int&, vertex_index_t>, void*, void*&>; VertexVector = std::vector; DomTreePredMap = iterator_property_map<__gnu_cxx::__normal_iterator >, adj_list_vertex_property_map >, int, int&, vertex_index_t> >; typename graph_traits::vertex_descriptor = void*]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/dominator_tree.hpp:360:35: required from ‘void boost::lengauer_tarjan_dominator_tree(const Graph&, const typename graph_traits::vertex_descriptor&, DomTreePredMap) [with Graph = adjacency_list >; DomTreePredMap = iterator_property_map<__gnu_cxx::__normal_iterator >, adj_list_vertex_property_map >, int, int&, vertex_index_t> >; typename graph_traits::vertex_descriptor = void*]’ dominatorTree.cpp:46:36: required from here /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::Convertible]’ 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ^ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::ConvertibleConcept]’: /home/omnipath/local/R/4.4-3.20/BH/include/boost/property_map/property_map.hpp:208:7: required from ‘void boost::ReadWritePropertyMapConcept::constraints() [with PMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>, boost::default_color_type, boost::default_color_type&>; Key = void*]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::ReadWritePropertyMapConcept >, boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>, boost::default_color_type, boost::default_color_type&>, void*>]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied >, boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>, boost::default_color_type, boost::default_color_type&>, void*> >::value’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied >, boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>, boost::default_color_type, boost::default_color_type&>, void*> >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_ >, boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>, boost::default_color_type, boost::default_color_type&>, void*>)>’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/depth_first_search.hpp:134:9: required from ‘void boost::detail::depth_first_visit_impl(const IncidenceGraph&, typename boost::graph_traits::vertex_descriptor, DFSVisitor&, ColorMap, TerminatorFunc) [with IncidenceGraph = boost::adjacency_list >; DFSVisitor = boost::dfs_visitor >, boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>, void*, void*&>, boost::on_tree_edge>, time_stamper_with_vertex_vector > >, boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>, long unsigned int, long unsigned int&>, std::vector, long unsigned int, boost::on_discover_vertex> > >; ColorMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>, boost::default_color_type, boost::default_color_type&>; TerminatorFunc = nontruth2; typename boost::graph_traits::vertex_descriptor = void*]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/depth_first_search.hpp:417:35: required from ‘void boost::depth_first_visit(const IncidenceGraph&, typename graph_traits::vertex_descriptor, DFSVisitor, ColorMap) [with IncidenceGraph = adjacency_list >; DFSVisitor = dfs_visitor >, adj_list_vertex_property_map >, int, const int&, vertex_index_t>, void*, void*&>, on_tree_edge>, detail::time_stamper_with_vertex_vector > >, adj_list_vertex_property_map >, int, const int&, vertex_index_t>, long unsigned int, long unsigned int&>, std::vector, long unsigned int, on_discover_vertex> > >; ColorMap = iterator_property_map<__gnu_cxx::__normal_iterator >, adj_list_vertex_property_map >, int, const int&, vertex_index_t>, default_color_type, default_color_type&>; typename graph_traits::vertex_descriptor = void*]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/dominator_tree.hpp:309:22: required from ‘void boost::lengauer_tarjan_dominator_tree(const Graph&, const typename graph_traits::vertex_descriptor&, const IndexMap&, TimeMap, PredMap, VertexVector&, DomTreePredMap) [with Graph = adjacency_list >; IndexMap = adj_list_vertex_property_map >, int, const int&, vertex_index_t>; TimeMap = iterator_property_map<__gnu_cxx::__normal_iterator > >, adj_list_vertex_property_map >, int, const int&, vertex_index_t>, long unsigned int, long unsigned int&>; PredMap = iterator_property_map<__gnu_cxx::__normal_iterator >, adj_list_vertex_property_map >, int, const int&, vertex_index_t>, void*, void*&>; VertexVector = std::vector; DomTreePredMap = iterator_property_map<__gnu_cxx::__normal_iterator >, adj_list_vertex_property_map >, int, int&, vertex_index_t> >; typename graph_traits::vertex_descriptor = void*]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/dominator_tree.hpp:360:35: required from ‘void boost::lengauer_tarjan_dominator_tree(const Graph&, const typename graph_traits::vertex_descriptor&, DomTreePredMap) [with Graph = adjacency_list >; DomTreePredMap = iterator_property_map<__gnu_cxx::__normal_iterator >, adj_list_vertex_property_map >, int, int&, vertex_index_t> >; typename graph_traits::vertex_descriptor = void*]’ dominatorTree.cpp:46:36: required from here /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:206:17: note: in a call to non-static member function ‘boost::ConvertibleConcept::~ConvertibleConcept()’ 206 | BOOST_concept(Convertible,(X)(Y)) | ^~~~~~~~~~~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/preprocessor/cat.hpp:29:34: note: in definition of macro ‘BOOST_PP_CAT_I’ 29 | # define BOOST_PP_CAT_I(a, b) a ## b | ^ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/concept_def.hpp:23:12: note: in expansion of macro ‘BOOST_PP_CAT’ 23 | struct BOOST_PP_CAT(name,Concept) \ | ^~~~~~~~~~~~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:206:3: note: in expansion of macro ‘BOOST_concept’ 206 | BOOST_concept(Convertible,(X)(Y)) | ^~~~~~~~~~~~~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::EqualityComparable]’: /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements >]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:233:5: required from ‘struct boost::EqualityComparable’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/graph_concepts.hpp:502:1: required from ‘struct boost::concepts::ColorValue’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/graph_concepts.hpp:502:1: required from ‘struct boost::concepts::ColorValueConcept’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::concepts::ColorValueConcept]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:42:5: [ skipping 2 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_)>’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/depth_first_search.hpp:136:9: required from ‘void boost::detail::depth_first_visit_impl(const IncidenceGraph&, typename boost::graph_traits::vertex_descriptor, DFSVisitor&, ColorMap, TerminatorFunc) [with IncidenceGraph = boost::adjacency_list >; DFSVisitor = boost::dfs_visitor >, boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>, void*, void*&>, boost::on_tree_edge>, time_stamper_with_vertex_vector > >, boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>, long unsigned int, long unsigned int&>, std::vector, long unsigned int, boost::on_discover_vertex> > >; ColorMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>, boost::default_color_type, boost::default_color_type&>; TerminatorFunc = nontruth2; typename boost::graph_traits::vertex_descriptor = void*]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/depth_first_search.hpp:417:35: required from ‘void boost::depth_first_visit(const IncidenceGraph&, typename graph_traits::vertex_descriptor, DFSVisitor, ColorMap) [with IncidenceGraph = adjacency_list >; DFSVisitor = dfs_visitor >, adj_list_vertex_property_map >, int, const int&, vertex_index_t>, void*, void*&>, on_tree_edge>, detail::time_stamper_with_vertex_vector > >, adj_list_vertex_property_map >, int, const int&, vertex_index_t>, long unsigned int, long unsigned int&>, std::vector, long unsigned int, on_discover_vertex> > >; ColorMap = iterator_property_map<__gnu_cxx::__normal_iterator >, adj_list_vertex_property_map >, int, const int&, vertex_index_t>, default_color_type, default_color_type&>; typename graph_traits::vertex_descriptor = void*]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/dominator_tree.hpp:309:22: required from ‘void boost::lengauer_tarjan_dominator_tree(const Graph&, const typename graph_traits::vertex_descriptor&, const IndexMap&, TimeMap, PredMap, VertexVector&, DomTreePredMap) [with Graph = adjacency_list >; IndexMap = adj_list_vertex_property_map >, int, const int&, vertex_index_t>; TimeMap = iterator_property_map<__gnu_cxx::__normal_iterator > >, adj_list_vertex_property_map >, int, const int&, vertex_index_t>, long unsigned int, long unsigned int&>; PredMap = iterator_property_map<__gnu_cxx::__normal_iterator >, adj_list_vertex_property_map >, int, const int&, vertex_index_t>, void*, void*&>; VertexVector = std::vector; DomTreePredMap = iterator_property_map<__gnu_cxx::__normal_iterator >, adj_list_vertex_property_map >, int, int&, vertex_index_t> >; typename graph_traits::vertex_descriptor = void*]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/dominator_tree.hpp:360:35: required from ‘void boost::lengauer_tarjan_dominator_tree(const Graph&, const typename graph_traits::vertex_descriptor&, DomTreePredMap) [with Graph = adjacency_list >; DomTreePredMap = iterator_property_map<__gnu_cxx::__normal_iterator >, adj_list_vertex_property_map >, int, int&, vertex_index_t> >; typename graph_traits::vertex_descriptor = void*]’ dominatorTree.cpp:46:36: required from here /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::EqualityComparable::~EqualityComparable() [with TT = boost::default_color_type]’ 37 | ~model() | ^ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:233:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 233 | BOOST_CONCEPT_USAGE(EqualityComparable) { | ^~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::DefaultConstructible]’: /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements >]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:137:5: required from ‘struct boost::DefaultConstructible’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/graph_concepts.hpp:502:1: required from ‘struct boost::concepts::ColorValue’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/graph_concepts.hpp:502:1: required from ‘struct boost::concepts::ColorValueConcept’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::concepts::ColorValueConcept]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:42:5: [ skipping 2 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_)>’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/depth_first_search.hpp:136:9: required from ‘void boost::detail::depth_first_visit_impl(const IncidenceGraph&, typename boost::graph_traits::vertex_descriptor, DFSVisitor&, ColorMap, TerminatorFunc) [with IncidenceGraph = boost::adjacency_list >; DFSVisitor = boost::dfs_visitor >, boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>, void*, void*&>, boost::on_tree_edge>, time_stamper_with_vertex_vector > >, boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>, long unsigned int, long unsigned int&>, std::vector, long unsigned int, boost::on_discover_vertex> > >; ColorMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>, boost::default_color_type, boost::default_color_type&>; TerminatorFunc = nontruth2; typename boost::graph_traits::vertex_descriptor = void*]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/depth_first_search.hpp:417:35: required from ‘void boost::depth_first_visit(const IncidenceGraph&, typename graph_traits::vertex_descriptor, DFSVisitor, ColorMap) [with IncidenceGraph = adjacency_list >; DFSVisitor = dfs_visitor >, adj_list_vertex_property_map >, int, const int&, vertex_index_t>, void*, void*&>, on_tree_edge>, detail::time_stamper_with_vertex_vector > >, adj_list_vertex_property_map >, int, const int&, vertex_index_t>, long unsigned int, long unsigned int&>, std::vector, long unsigned int, on_discover_vertex> > >; ColorMap = iterator_property_map<__gnu_cxx::__normal_iterator >, adj_list_vertex_property_map >, int, const int&, vertex_index_t>, default_color_type, default_color_type&>; typename graph_traits::vertex_descriptor = void*]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/dominator_tree.hpp:309:22: required from ‘void boost::lengauer_tarjan_dominator_tree(const Graph&, const typename graph_traits::vertex_descriptor&, const IndexMap&, TimeMap, PredMap, VertexVector&, DomTreePredMap) [with Graph = adjacency_list >; IndexMap = adj_list_vertex_property_map >, int, const int&, vertex_index_t>; TimeMap = iterator_property_map<__gnu_cxx::__normal_iterator > >, adj_list_vertex_property_map >, int, const int&, vertex_index_t>, long unsigned int, long unsigned int&>; PredMap = iterator_property_map<__gnu_cxx::__normal_iterator >, adj_list_vertex_property_map >, int, const int&, vertex_index_t>, void*, void*&>; VertexVector = std::vector; DomTreePredMap = iterator_property_map<__gnu_cxx::__normal_iterator >, adj_list_vertex_property_map >, int, int&, vertex_index_t> >; typename graph_traits::vertex_descriptor = void*]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/dominator_tree.hpp:360:35: required from ‘void boost::lengauer_tarjan_dominator_tree(const Graph&, const typename graph_traits::vertex_descriptor&, DomTreePredMap) [with Graph = adjacency_list >; DomTreePredMap = iterator_property_map<__gnu_cxx::__normal_iterator >, adj_list_vertex_property_map >, int, int&, vertex_index_t> >; typename graph_traits::vertex_descriptor = void*]’ dominatorTree.cpp:46:36: required from here /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::DefaultConstructible::~DefaultConstructible() [with TT = boost::default_color_type]’ 37 | ~model() | ^ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:137:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 137 | BOOST_CONCEPT_USAGE(DefaultConstructible) { | ^~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::concepts::ColorValue]’: /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements >]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/graph_concepts.hpp:505:5: required from ‘struct boost::concepts::ColorValue’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/graph_concepts.hpp:502:1: required from ‘struct boost::concepts::ColorValueConcept’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::concepts::ColorValueConcept]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:42:5: [ skipping 2 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_)>’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/depth_first_search.hpp:136:9: required from ‘void boost::detail::depth_first_visit_impl(const IncidenceGraph&, typename boost::graph_traits::vertex_descriptor, DFSVisitor&, ColorMap, TerminatorFunc) [with IncidenceGraph = boost::adjacency_list >; DFSVisitor = boost::dfs_visitor >, boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>, void*, void*&>, boost::on_tree_edge>, time_stamper_with_vertex_vector > >, boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>, long unsigned int, long unsigned int&>, std::vector, long unsigned int, boost::on_discover_vertex> > >; ColorMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>, boost::default_color_type, boost::default_color_type&>; TerminatorFunc = nontruth2; typename boost::graph_traits::vertex_descriptor = void*]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/depth_first_search.hpp:417:35: required from ‘void boost::depth_first_visit(const IncidenceGraph&, typename graph_traits::vertex_descriptor, DFSVisitor, ColorMap) [with IncidenceGraph = adjacency_list >; DFSVisitor = dfs_visitor >, adj_list_vertex_property_map >, int, const int&, vertex_index_t>, void*, void*&>, on_tree_edge>, detail::time_stamper_with_vertex_vector > >, adj_list_vertex_property_map >, int, const int&, vertex_index_t>, long unsigned int, long unsigned int&>, std::vector, long unsigned int, on_discover_vertex> > >; ColorMap = iterator_property_map<__gnu_cxx::__normal_iterator >, adj_list_vertex_property_map >, int, const int&, vertex_index_t>, default_color_type, default_color_type&>; typename graph_traits::vertex_descriptor = void*]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/dominator_tree.hpp:309:22: required from ‘void boost::lengauer_tarjan_dominator_tree(const Graph&, const typename graph_traits::vertex_descriptor&, const IndexMap&, TimeMap, PredMap, VertexVector&, DomTreePredMap) [with Graph = adjacency_list >; IndexMap = adj_list_vertex_property_map >, int, const int&, vertex_index_t>; TimeMap = iterator_property_map<__gnu_cxx::__normal_iterator > >, adj_list_vertex_property_map >, int, const int&, vertex_index_t>, long unsigned int, long unsigned int&>; PredMap = iterator_property_map<__gnu_cxx::__normal_iterator >, adj_list_vertex_property_map >, int, const int&, vertex_index_t>, void*, void*&>; VertexVector = std::vector; DomTreePredMap = iterator_property_map<__gnu_cxx::__normal_iterator >, adj_list_vertex_property_map >, int, int&, vertex_index_t> >; typename graph_traits::vertex_descriptor = void*]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/dominator_tree.hpp:360:35: required from ‘void boost::lengauer_tarjan_dominator_tree(const Graph&, const typename graph_traits::vertex_descriptor&, DomTreePredMap) [with Graph = adjacency_list >; DomTreePredMap = iterator_property_map<__gnu_cxx::__normal_iterator >, adj_list_vertex_property_map >, int, int&, vertex_index_t> >; typename graph_traits::vertex_descriptor = void*]’ dominatorTree.cpp:46:36: required from here /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::concepts::ColorValue::~ColorValue() [with C = boost::default_color_type]’ 37 | ~model() | ^ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/graph_concepts.hpp:505:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 505 | BOOST_CONCEPT_USAGE(ColorValue) | ^~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements >*, std::vector >, std::allocator > > > > > >]’: /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:145:5: required from ‘struct boost::Assignable<__gnu_cxx::__normal_iterator >*, std::vector >, std::allocator > > > > >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:502:3: required from ‘struct boost::InputIterator<__gnu_cxx::__normal_iterator >*, std::vector >, std::allocator > > > > >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:540:3: required from ‘struct boost::ForwardIterator<__gnu_cxx::__normal_iterator >*, std::vector >, std::allocator > > > > >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:568:3: required from ‘struct boost::BidirectionalIterator<__gnu_cxx::__normal_iterator >*, std::vector >, std::allocator > > > > >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:597:3: required from ‘struct boost::RandomAccessIterator<__gnu_cxx::__normal_iterator >*, std::vector >, std::allocator > > > > >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:597:3: [ skipping 5 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.4-3.20/BH/include/boost/property_map/property_map.hpp:354:5: required from ‘boost::iterator_property_map >::value_type, typename std::iterator_traits< >::reference> boost::make_iterator_property_map(RAIter, ID) [with RAIter = __gnu_cxx::__normal_iterator >*, std::vector >, std::allocator > > > >; ID = adj_list_vertex_property_map >, int, const int&, vertex_index_t>; typename std::iterator_traits< >::value_type = std::deque >; typename std::iterator_traits< >::reference = std::deque >&]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/dominator_tree.hpp:91:48: required from ‘boost::detail::dominator_visitor::dominator_visitor(const Graph&, const Vertex&, const IndexMap&, DomTreePredMap) [with Graph = boost::adjacency_list >; IndexMap = boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>; TimeMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator > >, boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>, long unsigned int, long unsigned int&>; PredMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>, void*, void*&>; DomTreePredMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t> >; Vertex = void*]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/dominator_tree.hpp:254:9: required from ‘void boost::lengauer_tarjan_dominator_tree_without_dfs(const Graph&, const typename graph_traits::vertex_descriptor&, const IndexMap&, TimeMap, PredMap, VertexVector&, DomTreePredMap) [with Graph = adjacency_list >; IndexMap = adj_list_vertex_property_map >, int, const int&, vertex_index_t>; TimeMap = iterator_property_map<__gnu_cxx::__normal_iterator > >, adj_list_vertex_property_map >, int, const int&, vertex_index_t>, long unsigned int, long unsigned int&>; PredMap = iterator_property_map<__gnu_cxx::__normal_iterator >, adj_list_vertex_property_map >, int, const int&, vertex_index_t>, void*, void*&>; VertexVector = std::vector; DomTreePredMap = iterator_property_map<__gnu_cxx::__normal_iterator >, adj_list_vertex_property_map >, int, int&, vertex_index_t> >; typename graph_traits::vertex_descriptor = void*]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/dominator_tree.hpp:317:47: required from ‘void boost::lengauer_tarjan_dominator_tree(const Graph&, const typename graph_traits::vertex_descriptor&, const IndexMap&, TimeMap, PredMap, VertexVector&, DomTreePredMap) [with Graph = adjacency_list >; IndexMap = adj_list_vertex_property_map >, int, const int&, vertex_index_t>; TimeMap = iterator_property_map<__gnu_cxx::__normal_iterator > >, adj_list_vertex_property_map >, int, const int&, vertex_index_t>, long unsigned int, long unsigned int&>; PredMap = iterator_property_map<__gnu_cxx::__normal_iterator >, adj_list_vertex_property_map >, int, const int&, vertex_index_t>, void*, void*&>; VertexVector = std::vector; DomTreePredMap = iterator_property_map<__gnu_cxx::__normal_iterator >, adj_list_vertex_property_map >, int, int&, vertex_index_t> >; typename graph_traits::vertex_descriptor = void*]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/dominator_tree.hpp:360:35: required from ‘void boost::lengauer_tarjan_dominator_tree(const Graph&, const typename graph_traits::vertex_descriptor&, DomTreePredMap) [with Graph = adjacency_list >; DomTreePredMap = iterator_property_map<__gnu_cxx::__normal_iterator >, adj_list_vertex_property_map >, int, int&, vertex_index_t> >; typename graph_traits::vertex_descriptor = void*]’ dominatorTree.cpp:46:36: required from here /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::Assignable<__gnu_cxx::__normal_iterator >*, std::vector >, std::allocator > > > > >]’ 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ^ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements >*, std::vector >, std::allocator > > > > > >]’: /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:233:5: required from ‘struct boost::EqualityComparable<__gnu_cxx::__normal_iterator >*, std::vector >, std::allocator > > > > >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:502:3: required from ‘struct boost::InputIterator<__gnu_cxx::__normal_iterator >*, std::vector >, std::allocator > > > > >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:540:3: required from ‘struct boost::ForwardIterator<__gnu_cxx::__normal_iterator >*, std::vector >, std::allocator > > > > >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:568:3: required from ‘struct boost::BidirectionalIterator<__gnu_cxx::__normal_iterator >*, std::vector >, std::allocator > > > > >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:597:3: required from ‘struct boost::RandomAccessIterator<__gnu_cxx::__normal_iterator >*, std::vector >, std::allocator > > > > >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:597:3: [ skipping 5 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.4-3.20/BH/include/boost/property_map/property_map.hpp:354:5: required from ‘boost::iterator_property_map >::value_type, typename std::iterator_traits< >::reference> boost::make_iterator_property_map(RAIter, ID) [with RAIter = __gnu_cxx::__normal_iterator >*, std::vector >, std::allocator > > > >; ID = adj_list_vertex_property_map >, int, const int&, vertex_index_t>; typename std::iterator_traits< >::value_type = std::deque >; typename std::iterator_traits< >::reference = std::deque >&]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/dominator_tree.hpp:91:48: required from ‘boost::detail::dominator_visitor::dominator_visitor(const Graph&, const Vertex&, const IndexMap&, DomTreePredMap) [with Graph = boost::adjacency_list >; IndexMap = boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>; TimeMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator > >, boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>, long unsigned int, long unsigned int&>; PredMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>, void*, void*&>; DomTreePredMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t> >; Vertex = void*]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/dominator_tree.hpp:254:9: required from ‘void boost::lengauer_tarjan_dominator_tree_without_dfs(const Graph&, const typename graph_traits::vertex_descriptor&, const IndexMap&, TimeMap, PredMap, VertexVector&, DomTreePredMap) [with Graph = adjacency_list >; IndexMap = adj_list_vertex_property_map >, int, const int&, vertex_index_t>; TimeMap = iterator_property_map<__gnu_cxx::__normal_iterator > >, adj_list_vertex_property_map >, int, const int&, vertex_index_t>, long unsigned int, long unsigned int&>; PredMap = iterator_property_map<__gnu_cxx::__normal_iterator >, adj_list_vertex_property_map >, int, const int&, vertex_index_t>, void*, void*&>; VertexVector = std::vector; DomTreePredMap = iterator_property_map<__gnu_cxx::__normal_iterator >, adj_list_vertex_property_map >, int, int&, vertex_index_t> >; typename graph_traits::vertex_descriptor = void*]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/dominator_tree.hpp:317:47: required from ‘void boost::lengauer_tarjan_dominator_tree(const Graph&, const typename graph_traits::vertex_descriptor&, const IndexMap&, TimeMap, PredMap, VertexVector&, DomTreePredMap) [with Graph = adjacency_list >; IndexMap = adj_list_vertex_property_map >, int, const int&, vertex_index_t>; TimeMap = iterator_property_map<__gnu_cxx::__normal_iterator > >, adj_list_vertex_property_map >, int, const int&, vertex_index_t>, long unsigned int, long unsigned int&>; PredMap = iterator_property_map<__gnu_cxx::__normal_iterator >, adj_list_vertex_property_map >, int, const int&, vertex_index_t>, void*, void*&>; VertexVector = std::vector; DomTreePredMap = iterator_property_map<__gnu_cxx::__normal_iterator >, adj_list_vertex_property_map >, int, int&, vertex_index_t> >; typename graph_traits::vertex_descriptor = void*]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/dominator_tree.hpp:360:35: required from ‘void boost::lengauer_tarjan_dominator_tree(const Graph&, const typename graph_traits::vertex_descriptor&, DomTreePredMap) [with Graph = adjacency_list >; DomTreePredMap = iterator_property_map<__gnu_cxx::__normal_iterator >, adj_list_vertex_property_map >, int, int&, vertex_index_t> >; typename graph_traits::vertex_descriptor = void*]’ dominatorTree.cpp:46:36: required from here /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::EqualityComparable<__gnu_cxx::__normal_iterator >*, std::vector >, std::allocator > > > > >]’ 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ^ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements >*, std::vector >, std::allocator > > > > > >]’: /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:512:7: required from ‘struct boost::InputIterator<__gnu_cxx::__normal_iterator >*, std::vector >, std::allocator > > > > >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:540:3: required from ‘struct boost::ForwardIterator<__gnu_cxx::__normal_iterator >*, std::vector >, std::allocator > > > > >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:568:3: required from ‘struct boost::BidirectionalIterator<__gnu_cxx::__normal_iterator >*, std::vector >, std::allocator > > > > >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:597:3: required from ‘struct boost::RandomAccessIterator<__gnu_cxx::__normal_iterator >*, std::vector >, std::allocator > > > > >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:597:3: required from ‘struct boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator >*, std::vector >, std::allocator > > > > >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:32:62: [ skipping 4 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.4-3.20/BH/include/boost/property_map/property_map.hpp:354:5: required from ‘boost::iterator_property_map >::value_type, typename std::iterator_traits< >::reference> boost::make_iterator_property_map(RAIter, ID) [with RAIter = __gnu_cxx::__normal_iterator >*, std::vector >, std::allocator > > > >; ID = adj_list_vertex_property_map >, int, const int&, vertex_index_t>; typename std::iterator_traits< >::value_type = std::deque >; typename std::iterator_traits< >::reference = std::deque >&]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/dominator_tree.hpp:91:48: required from ‘boost::detail::dominator_visitor::dominator_visitor(const Graph&, const Vertex&, const IndexMap&, DomTreePredMap) [with Graph = boost::adjacency_list >; IndexMap = boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>; TimeMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator > >, boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>, long unsigned int, long unsigned int&>; PredMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>, void*, void*&>; DomTreePredMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t> >; Vertex = void*]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/dominator_tree.hpp:254:9: required from ‘void boost::lengauer_tarjan_dominator_tree_without_dfs(const Graph&, const typename graph_traits::vertex_descriptor&, const IndexMap&, TimeMap, PredMap, VertexVector&, DomTreePredMap) [with Graph = adjacency_list >; IndexMap = adj_list_vertex_property_map >, int, const int&, vertex_index_t>; TimeMap = iterator_property_map<__gnu_cxx::__normal_iterator > >, adj_list_vertex_property_map >, int, const int&, vertex_index_t>, long unsigned int, long unsigned int&>; PredMap = iterator_property_map<__gnu_cxx::__normal_iterator >, adj_list_vertex_property_map >, int, const int&, vertex_index_t>, void*, void*&>; VertexVector = std::vector; DomTreePredMap = iterator_property_map<__gnu_cxx::__normal_iterator >, adj_list_vertex_property_map >, int, int&, vertex_index_t> >; typename graph_traits::vertex_descriptor = void*]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/dominator_tree.hpp:317:47: required from ‘void boost::lengauer_tarjan_dominator_tree(const Graph&, const typename graph_traits::vertex_descriptor&, const IndexMap&, TimeMap, PredMap, VertexVector&, DomTreePredMap) [with Graph = adjacency_list >; IndexMap = adj_list_vertex_property_map >, int, const int&, vertex_index_t>; TimeMap = iterator_property_map<__gnu_cxx::__normal_iterator > >, adj_list_vertex_property_map >, int, const int&, vertex_index_t>, long unsigned int, long unsigned int&>; PredMap = iterator_property_map<__gnu_cxx::__normal_iterator >, adj_list_vertex_property_map >, int, const int&, vertex_index_t>, void*, void*&>; VertexVector = std::vector; DomTreePredMap = iterator_property_map<__gnu_cxx::__normal_iterator >, adj_list_vertex_property_map >, int, int&, vertex_index_t> >; typename graph_traits::vertex_descriptor = void*]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/dominator_tree.hpp:360:35: required from ‘void boost::lengauer_tarjan_dominator_tree(const Graph&, const typename graph_traits::vertex_descriptor&, DomTreePredMap) [with Graph = adjacency_list >; DomTreePredMap = iterator_property_map<__gnu_cxx::__normal_iterator >, adj_list_vertex_property_map >, int, int&, vertex_index_t> >; typename graph_traits::vertex_descriptor = void*]’ dominatorTree.cpp:46:36: required from here /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::InputIterator<__gnu_cxx::__normal_iterator >*, std::vector >, std::allocator > > > > >]’ 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ^ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements >*, std::vector >, std::allocator > > > > > >]’: /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:543:7: required from ‘struct boost::ForwardIterator<__gnu_cxx::__normal_iterator >*, std::vector >, std::allocator > > > > >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:568:3: required from ‘struct boost::BidirectionalIterator<__gnu_cxx::__normal_iterator >*, std::vector >, std::allocator > > > > >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:597:3: required from ‘struct boost::RandomAccessIterator<__gnu_cxx::__normal_iterator >*, std::vector >, std::allocator > > > > >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:597:3: required from ‘struct boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator >*, std::vector >, std::allocator > > > > >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator >*, std::vector >, std::allocator > > > > >]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:42:5: [ skipping 3 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.4-3.20/BH/include/boost/property_map/property_map.hpp:354:5: required from ‘boost::iterator_property_map >::value_type, typename std::iterator_traits< >::reference> boost::make_iterator_property_map(RAIter, ID) [with RAIter = __gnu_cxx::__normal_iterator >*, std::vector >, std::allocator > > > >; ID = adj_list_vertex_property_map >, int, const int&, vertex_index_t>; typename std::iterator_traits< >::value_type = std::deque >; typename std::iterator_traits< >::reference = std::deque >&]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/dominator_tree.hpp:91:48: required from ‘boost::detail::dominator_visitor::dominator_visitor(const Graph&, const Vertex&, const IndexMap&, DomTreePredMap) [with Graph = boost::adjacency_list >; IndexMap = boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>; TimeMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator > >, boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>, long unsigned int, long unsigned int&>; PredMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>, void*, void*&>; DomTreePredMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t> >; Vertex = void*]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/dominator_tree.hpp:254:9: required from ‘void boost::lengauer_tarjan_dominator_tree_without_dfs(const Graph&, const typename graph_traits::vertex_descriptor&, const IndexMap&, TimeMap, PredMap, VertexVector&, DomTreePredMap) [with Graph = adjacency_list >; IndexMap = adj_list_vertex_property_map >, int, const int&, vertex_index_t>; TimeMap = iterator_property_map<__gnu_cxx::__normal_iterator > >, adj_list_vertex_property_map >, int, const int&, vertex_index_t>, long unsigned int, long unsigned int&>; PredMap = iterator_property_map<__gnu_cxx::__normal_iterator >, adj_list_vertex_property_map >, int, const int&, vertex_index_t>, void*, void*&>; VertexVector = std::vector; DomTreePredMap = iterator_property_map<__gnu_cxx::__normal_iterator >, adj_list_vertex_property_map >, int, int&, vertex_index_t> >; typename graph_traits::vertex_descriptor = void*]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/dominator_tree.hpp:317:47: required from ‘void boost::lengauer_tarjan_dominator_tree(const Graph&, const typename graph_traits::vertex_descriptor&, const IndexMap&, TimeMap, PredMap, VertexVector&, DomTreePredMap) [with Graph = adjacency_list >; IndexMap = adj_list_vertex_property_map >, int, const int&, vertex_index_t>; TimeMap = iterator_property_map<__gnu_cxx::__normal_iterator > >, adj_list_vertex_property_map >, int, const int&, vertex_index_t>, long unsigned int, long unsigned int&>; PredMap = iterator_property_map<__gnu_cxx::__normal_iterator >, adj_list_vertex_property_map >, int, const int&, vertex_index_t>, void*, void*&>; VertexVector = std::vector; DomTreePredMap = iterator_property_map<__gnu_cxx::__normal_iterator >, adj_list_vertex_property_map >, int, int&, vertex_index_t> >; typename graph_traits::vertex_descriptor = void*]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/dominator_tree.hpp:360:35: required from ‘void boost::lengauer_tarjan_dominator_tree(const Graph&, const typename graph_traits::vertex_descriptor&, DomTreePredMap) [with Graph = adjacency_list >; DomTreePredMap = iterator_property_map<__gnu_cxx::__normal_iterator >, adj_list_vertex_property_map >, int, int&, vertex_index_t> >; typename graph_traits::vertex_descriptor = void*]’ dominatorTree.cpp:46:36: required from here /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::ForwardIterator<__gnu_cxx::__normal_iterator >*, std::vector >, std::allocator > > > > >]’ 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ^ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements >*, std::vector >, std::allocator > > > > > >]’: /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:571:7: required from ‘struct boost::BidirectionalIterator<__gnu_cxx::__normal_iterator >*, std::vector >, std::allocator > > > > >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:597:3: required from ‘struct boost::RandomAccessIterator<__gnu_cxx::__normal_iterator >*, std::vector >, std::allocator > > > > >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:597:3: required from ‘struct boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator >*, std::vector >, std::allocator > > > > >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator >*, std::vector >, std::allocator > > > > >]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied >*, std::vector >, std::allocator > > > > > >::value’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:45:51: [ skipping 2 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.4-3.20/BH/include/boost/property_map/property_map.hpp:354:5: required from ‘boost::iterator_property_map >::value_type, typename std::iterator_traits< >::reference> boost::make_iterator_property_map(RAIter, ID) [with RAIter = __gnu_cxx::__normal_iterator >*, std::vector >, std::allocator > > > >; ID = adj_list_vertex_property_map >, int, const int&, vertex_index_t>; typename std::iterator_traits< >::value_type = std::deque >; typename std::iterator_traits< >::reference = std::deque >&]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/dominator_tree.hpp:91:48: required from ‘boost::detail::dominator_visitor::dominator_visitor(const Graph&, const Vertex&, const IndexMap&, DomTreePredMap) [with Graph = boost::adjacency_list >; IndexMap = boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>; TimeMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator > >, boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>, long unsigned int, long unsigned int&>; PredMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>, void*, void*&>; DomTreePredMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t> >; Vertex = void*]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/dominator_tree.hpp:254:9: required from ‘void boost::lengauer_tarjan_dominator_tree_without_dfs(const Graph&, const typename graph_traits::vertex_descriptor&, const IndexMap&, TimeMap, PredMap, VertexVector&, DomTreePredMap) [with Graph = adjacency_list >; IndexMap = adj_list_vertex_property_map >, int, const int&, vertex_index_t>; TimeMap = iterator_property_map<__gnu_cxx::__normal_iterator > >, adj_list_vertex_property_map >, int, const int&, vertex_index_t>, long unsigned int, long unsigned int&>; PredMap = iterator_property_map<__gnu_cxx::__normal_iterator >, adj_list_vertex_property_map >, int, const int&, vertex_index_t>, void*, void*&>; VertexVector = std::vector; DomTreePredMap = iterator_property_map<__gnu_cxx::__normal_iterator >, adj_list_vertex_property_map >, int, int&, vertex_index_t> >; typename graph_traits::vertex_descriptor = void*]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/dominator_tree.hpp:317:47: required from ‘void boost::lengauer_tarjan_dominator_tree(const Graph&, const typename graph_traits::vertex_descriptor&, const IndexMap&, TimeMap, PredMap, VertexVector&, DomTreePredMap) [with Graph = adjacency_list >; IndexMap = adj_list_vertex_property_map >, int, const int&, vertex_index_t>; TimeMap = iterator_property_map<__gnu_cxx::__normal_iterator > >, adj_list_vertex_property_map >, int, const int&, vertex_index_t>, long unsigned int, long unsigned int&>; PredMap = iterator_property_map<__gnu_cxx::__normal_iterator >, adj_list_vertex_property_map >, int, const int&, vertex_index_t>, void*, void*&>; VertexVector = std::vector; DomTreePredMap = iterator_property_map<__gnu_cxx::__normal_iterator >, adj_list_vertex_property_map >, int, int&, vertex_index_t> >; typename graph_traits::vertex_descriptor = void*]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/dominator_tree.hpp:360:35: required from ‘void boost::lengauer_tarjan_dominator_tree(const Graph&, const typename graph_traits::vertex_descriptor&, DomTreePredMap) [with Graph = adjacency_list >; DomTreePredMap = iterator_property_map<__gnu_cxx::__normal_iterator >, adj_list_vertex_property_map >, int, int&, vertex_index_t> >; typename graph_traits::vertex_descriptor = void*]’ dominatorTree.cpp:46:36: required from here /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::BidirectionalIterator<__gnu_cxx::__normal_iterator >*, std::vector >, std::allocator > > > > >]’ 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ^ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements >*, std::vector >, std::allocator > > > > > >]’: /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:253:5: required from ‘struct boost::Comparable<__gnu_cxx::__normal_iterator >*, std::vector >, std::allocator > > > > >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:597:3: required from ‘struct boost::RandomAccessIterator<__gnu_cxx::__normal_iterator >*, std::vector >, std::allocator > > > > >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:597:3: required from ‘struct boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator >*, std::vector >, std::allocator > > > > >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator >*, std::vector >, std::allocator > > > > >]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied >*, std::vector >, std::allocator > > > > > >::value’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:45:51: [ skipping 2 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.4-3.20/BH/include/boost/property_map/property_map.hpp:354:5: required from ‘boost::iterator_property_map >::value_type, typename std::iterator_traits< >::reference> boost::make_iterator_property_map(RAIter, ID) [with RAIter = __gnu_cxx::__normal_iterator >*, std::vector >, std::allocator > > > >; ID = adj_list_vertex_property_map >, int, const int&, vertex_index_t>; typename std::iterator_traits< >::value_type = std::deque >; typename std::iterator_traits< >::reference = std::deque >&]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/dominator_tree.hpp:91:48: required from ‘boost::detail::dominator_visitor::dominator_visitor(const Graph&, const Vertex&, const IndexMap&, DomTreePredMap) [with Graph = boost::adjacency_list >; IndexMap = boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>; TimeMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator > >, boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>, long unsigned int, long unsigned int&>; PredMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>, void*, void*&>; DomTreePredMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t> >; Vertex = void*]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/dominator_tree.hpp:254:9: required from ‘void boost::lengauer_tarjan_dominator_tree_without_dfs(const Graph&, const typename graph_traits::vertex_descriptor&, const IndexMap&, TimeMap, PredMap, VertexVector&, DomTreePredMap) [with Graph = adjacency_list >; IndexMap = adj_list_vertex_property_map >, int, const int&, vertex_index_t>; TimeMap = iterator_property_map<__gnu_cxx::__normal_iterator > >, adj_list_vertex_property_map >, int, const int&, vertex_index_t>, long unsigned int, long unsigned int&>; PredMap = iterator_property_map<__gnu_cxx::__normal_iterator >, adj_list_vertex_property_map >, int, const int&, vertex_index_t>, void*, void*&>; VertexVector = std::vector; DomTreePredMap = iterator_property_map<__gnu_cxx::__normal_iterator >, adj_list_vertex_property_map >, int, int&, vertex_index_t> >; typename graph_traits::vertex_descriptor = void*]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/dominator_tree.hpp:317:47: required from ‘void boost::lengauer_tarjan_dominator_tree(const Graph&, const typename graph_traits::vertex_descriptor&, const IndexMap&, TimeMap, PredMap, VertexVector&, DomTreePredMap) [with Graph = adjacency_list >; IndexMap = adj_list_vertex_property_map >, int, const int&, vertex_index_t>; TimeMap = iterator_property_map<__gnu_cxx::__normal_iterator > >, adj_list_vertex_property_map >, int, const int&, vertex_index_t>, long unsigned int, long unsigned int&>; PredMap = iterator_property_map<__gnu_cxx::__normal_iterator >, adj_list_vertex_property_map >, int, const int&, vertex_index_t>, void*, void*&>; VertexVector = std::vector; DomTreePredMap = iterator_property_map<__gnu_cxx::__normal_iterator >, adj_list_vertex_property_map >, int, int&, vertex_index_t> >; typename graph_traits::vertex_descriptor = void*]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/dominator_tree.hpp:360:35: required from ‘void boost::lengauer_tarjan_dominator_tree(const Graph&, const typename graph_traits::vertex_descriptor&, DomTreePredMap) [with Graph = adjacency_list >; DomTreePredMap = iterator_property_map<__gnu_cxx::__normal_iterator >, adj_list_vertex_property_map >, int, int&, vertex_index_t> >; typename graph_traits::vertex_descriptor = void*]’ dominatorTree.cpp:46:36: required from here /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::Comparable<__gnu_cxx::__normal_iterator >*, std::vector >, std::allocator > > > > >]’ 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ^ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements >*, std::vector >, std::allocator > > > > > >]’: /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:601:7: required from ‘struct boost::RandomAccessIterator<__gnu_cxx::__normal_iterator >*, std::vector >, std::allocator > > > > >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:597:3: required from ‘struct boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator >*, std::vector >, std::allocator > > > > >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator >*, std::vector >, std::allocator > > > > >]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied >*, std::vector >, std::allocator > > > > > >::value’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:45:51: [ skipping 2 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.4-3.20/BH/include/boost/property_map/property_map.hpp:354:5: required from ‘boost::iterator_property_map >::value_type, typename std::iterator_traits< >::reference> boost::make_iterator_property_map(RAIter, ID) [with RAIter = __gnu_cxx::__normal_iterator >*, std::vector >, std::allocator > > > >; ID = adj_list_vertex_property_map >, int, const int&, vertex_index_t>; typename std::iterator_traits< >::value_type = std::deque >; typename std::iterator_traits< >::reference = std::deque >&]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/dominator_tree.hpp:91:48: required from ‘boost::detail::dominator_visitor::dominator_visitor(const Graph&, const Vertex&, const IndexMap&, DomTreePredMap) [with Graph = boost::adjacency_list >; IndexMap = boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>; TimeMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator > >, boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>, long unsigned int, long unsigned int&>; PredMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>, void*, void*&>; DomTreePredMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t> >; Vertex = void*]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/dominator_tree.hpp:254:9: required from ‘void boost::lengauer_tarjan_dominator_tree_without_dfs(const Graph&, const typename graph_traits::vertex_descriptor&, const IndexMap&, TimeMap, PredMap, VertexVector&, DomTreePredMap) [with Graph = adjacency_list >; IndexMap = adj_list_vertex_property_map >, int, const int&, vertex_index_t>; TimeMap = iterator_property_map<__gnu_cxx::__normal_iterator > >, adj_list_vertex_property_map >, int, const int&, vertex_index_t>, long unsigned int, long unsigned int&>; PredMap = iterator_property_map<__gnu_cxx::__normal_iterator >, adj_list_vertex_property_map >, int, const int&, vertex_index_t>, void*, void*&>; VertexVector = std::vector; DomTreePredMap = iterator_property_map<__gnu_cxx::__normal_iterator >, adj_list_vertex_property_map >, int, int&, vertex_index_t> >; typename graph_traits::vertex_descriptor = void*]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/dominator_tree.hpp:317:47: required from ‘void boost::lengauer_tarjan_dominator_tree(const Graph&, const typename graph_traits::vertex_descriptor&, const IndexMap&, TimeMap, PredMap, VertexVector&, DomTreePredMap) [with Graph = adjacency_list >; IndexMap = adj_list_vertex_property_map >, int, const int&, vertex_index_t>; TimeMap = iterator_property_map<__gnu_cxx::__normal_iterator > >, adj_list_vertex_property_map >, int, const int&, vertex_index_t>, long unsigned int, long unsigned int&>; PredMap = iterator_property_map<__gnu_cxx::__normal_iterator >, adj_list_vertex_property_map >, int, const int&, vertex_index_t>, void*, void*&>; VertexVector = std::vector; DomTreePredMap = iterator_property_map<__gnu_cxx::__normal_iterator >, adj_list_vertex_property_map >, int, int&, vertex_index_t> >; typename graph_traits::vertex_descriptor = void*]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/dominator_tree.hpp:360:35: required from ‘void boost::lengauer_tarjan_dominator_tree(const Graph&, const typename graph_traits::vertex_descriptor&, DomTreePredMap) [with Graph = adjacency_list >; DomTreePredMap = iterator_property_map<__gnu_cxx::__normal_iterator >, adj_list_vertex_property_map >, int, int&, vertex_index_t> >; typename graph_traits::vertex_descriptor = void*]’ dominatorTree.cpp:46:36: required from here /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::RandomAccessIterator<__gnu_cxx::__normal_iterator >*, std::vector >, std::allocator > > > > >]’ 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ^ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator >*, std::vector >, std::allocator > > > > >]’: /home/omnipath/local/R/4.4-3.20/BH/include/boost/property_map/property_map.hpp:354:5: required from ‘boost::iterator_property_map >::value_type, typename std::iterator_traits< >::reference> boost::make_iterator_property_map(RAIter, ID) [with RAIter = __gnu_cxx::__normal_iterator >*, std::vector >, std::allocator > > > >; ID = adj_list_vertex_property_map >, int, const int&, vertex_index_t>; typename std::iterator_traits< >::value_type = std::deque >; typename std::iterator_traits< >::reference = std::deque >&]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/dominator_tree.hpp:91:48: required from ‘boost::detail::dominator_visitor::dominator_visitor(const Graph&, const Vertex&, const IndexMap&, DomTreePredMap) [with Graph = boost::adjacency_list >; IndexMap = boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>; TimeMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator > >, boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>, long unsigned int, long unsigned int&>; PredMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>, void*, void*&>; DomTreePredMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t> >; Vertex = void*]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/dominator_tree.hpp:254:9: required from ‘void boost::lengauer_tarjan_dominator_tree_without_dfs(const Graph&, const typename graph_traits::vertex_descriptor&, const IndexMap&, TimeMap, PredMap, VertexVector&, DomTreePredMap) [with Graph = adjacency_list >; IndexMap = adj_list_vertex_property_map >, int, const int&, vertex_index_t>; TimeMap = iterator_property_map<__gnu_cxx::__normal_iterator > >, adj_list_vertex_property_map >, int, const int&, vertex_index_t>, long unsigned int, long unsigned int&>; PredMap = iterator_property_map<__gnu_cxx::__normal_iterator >, adj_list_vertex_property_map >, int, const int&, vertex_index_t>, void*, void*&>; VertexVector = std::vector; DomTreePredMap = iterator_property_map<__gnu_cxx::__normal_iterator >, adj_list_vertex_property_map >, int, int&, vertex_index_t> >; typename graph_traits::vertex_descriptor = void*]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/dominator_tree.hpp:317:47: required from ‘void boost::lengauer_tarjan_dominator_tree(const Graph&, const typename graph_traits::vertex_descriptor&, const IndexMap&, TimeMap, PredMap, VertexVector&, DomTreePredMap) [with Graph = adjacency_list >; IndexMap = adj_list_vertex_property_map >, int, const int&, vertex_index_t>; TimeMap = iterator_property_map<__gnu_cxx::__normal_iterator > >, adj_list_vertex_property_map >, int, const int&, vertex_index_t>, long unsigned int, long unsigned int&>; PredMap = iterator_property_map<__gnu_cxx::__normal_iterator >, adj_list_vertex_property_map >, int, const int&, vertex_index_t>, void*, void*&>; VertexVector = std::vector; DomTreePredMap = iterator_property_map<__gnu_cxx::__normal_iterator >, adj_list_vertex_property_map >, int, int&, vertex_index_t> >; typename graph_traits::vertex_descriptor = void*]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/dominator_tree.hpp:360:35: required from ‘void boost::lengauer_tarjan_dominator_tree(const Graph&, const typename graph_traits::vertex_descriptor&, DomTreePredMap) [with Graph = adjacency_list >; DomTreePredMap = iterator_property_map<__gnu_cxx::__normal_iterator >, adj_list_vertex_property_map >, int, int&, vertex_index_t> >; typename graph_traits::vertex_descriptor = void*]’ dominatorTree.cpp:46:36: required from here /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:597:17: note: in a call to non-static member function ‘boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator >*, std::vector >, std::allocator > > > > >::~RandomAccessIteratorConcept()’ 597 | BOOST_concept(RandomAccessIterator,(TT)) | ^~~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/preprocessor/cat.hpp:29:34: note: in definition of macro ‘BOOST_PP_CAT_I’ 29 | # define BOOST_PP_CAT_I(a, b) a ## b | ^ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/concept_def.hpp:23:12: note: in expansion of macro ‘BOOST_PP_CAT’ 23 | struct BOOST_PP_CAT(name,Concept) \ | ^~~~~~~~~~~~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:597:3: note: in expansion of macro ‘BOOST_concept’ 597 | BOOST_concept(RandomAccessIterator,(TT)) | ^~~~~~~~~~~~~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::DefaultConstructible]’: /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements >]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:137:5: required from ‘struct boost::DefaultConstructible’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::DefaultConstructible]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied >::value’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:72:8: [ skipping 9 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied > > >::value’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied > > >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_ > >)>’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/dominator_tree.hpp:245:5: required from ‘void boost::lengauer_tarjan_dominator_tree(const Graph&, const typename graph_traits::vertex_descriptor&, const IndexMap&, TimeMap, PredMap, VertexVector&, DomTreePredMap) [with Graph = adjacency_list >; IndexMap = adj_list_vertex_property_map >, int, const int&, vertex_index_t>; TimeMap = iterator_property_map<__gnu_cxx::__normal_iterator > >, adj_list_vertex_property_map >, int, const int&, vertex_index_t>, long unsigned int, long unsigned int&>; PredMap = iterator_property_map<__gnu_cxx::__normal_iterator >, adj_list_vertex_property_map >, int, const int&, vertex_index_t>, void*, void*&>; VertexVector = std::vector; DomTreePredMap = iterator_property_map<__gnu_cxx::__normal_iterator >, adj_list_vertex_property_map >, int, int&, vertex_index_t> >; typename graph_traits::vertex_descriptor = void*]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/dominator_tree.hpp:360:35: required from ‘void boost::lengauer_tarjan_dominator_tree(const Graph&, const typename graph_traits::vertex_descriptor&, DomTreePredMap) [with Graph = adjacency_list >; DomTreePredMap = iterator_property_map<__gnu_cxx::__normal_iterator >, adj_list_vertex_property_map >, int, int&, vertex_index_t> >; typename graph_traits::vertex_descriptor = void*]’ dominatorTree.cpp:46:36: required from here /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::DefaultConstructible::~DefaultConstructible() [with TT = void*]’ 37 | ~model() | ^ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:137:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 137 | BOOST_CONCEPT_USAGE(DefaultConstructible) { | ^~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::EqualityComparable]’: /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements >]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:233:5: required from ‘struct boost::EqualityComparable’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::EqualityComparable]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied >::value’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:72:8: [ skipping 9 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied > > >::value’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied > > >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_ > >)>’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/dominator_tree.hpp:245:5: required from ‘void boost::lengauer_tarjan_dominator_tree(const Graph&, const typename graph_traits::vertex_descriptor&, const IndexMap&, TimeMap, PredMap, VertexVector&, DomTreePredMap) [with Graph = adjacency_list >; IndexMap = adj_list_vertex_property_map >, int, const int&, vertex_index_t>; TimeMap = iterator_property_map<__gnu_cxx::__normal_iterator > >, adj_list_vertex_property_map >, int, const int&, vertex_index_t>, long unsigned int, long unsigned int&>; PredMap = iterator_property_map<__gnu_cxx::__normal_iterator >, adj_list_vertex_property_map >, int, const int&, vertex_index_t>, void*, void*&>; VertexVector = std::vector; DomTreePredMap = iterator_property_map<__gnu_cxx::__normal_iterator >, adj_list_vertex_property_map >, int, int&, vertex_index_t> >; typename graph_traits::vertex_descriptor = void*]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/dominator_tree.hpp:360:35: required from ‘void boost::lengauer_tarjan_dominator_tree(const Graph&, const typename graph_traits::vertex_descriptor&, DomTreePredMap) [with Graph = adjacency_list >; DomTreePredMap = iterator_property_map<__gnu_cxx::__normal_iterator >, adj_list_vertex_property_map >, int, int&, vertex_index_t> >; typename graph_traits::vertex_descriptor = void*]’ dominatorTree.cpp:46:36: required from here /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::EqualityComparable::~EqualityComparable() [with TT = void*]’ 37 | ~model() | ^ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:233:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 233 | BOOST_CONCEPT_USAGE(EqualityComparable) { | ^~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::Assignable]’: /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements >]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:145:5: required from ‘struct boost::Assignable’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::Assignable]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied >::value’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:72:8: [ skipping 9 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied > > >::value’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied > > >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_ > >)>’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/dominator_tree.hpp:245:5: required from ‘void boost::lengauer_tarjan_dominator_tree(const Graph&, const typename graph_traits::vertex_descriptor&, const IndexMap&, TimeMap, PredMap, VertexVector&, DomTreePredMap) [with Graph = adjacency_list >; IndexMap = adj_list_vertex_property_map >, int, const int&, vertex_index_t>; TimeMap = iterator_property_map<__gnu_cxx::__normal_iterator > >, adj_list_vertex_property_map >, int, const int&, vertex_index_t>, long unsigned int, long unsigned int&>; PredMap = iterator_property_map<__gnu_cxx::__normal_iterator >, adj_list_vertex_property_map >, int, const int&, vertex_index_t>, void*, void*&>; VertexVector = std::vector; DomTreePredMap = iterator_property_map<__gnu_cxx::__normal_iterator >, adj_list_vertex_property_map >, int, int&, vertex_index_t> >; typename graph_traits::vertex_descriptor = void*]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/dominator_tree.hpp:360:35: required from ‘void boost::lengauer_tarjan_dominator_tree(const Graph&, const typename graph_traits::vertex_descriptor&, DomTreePredMap) [with Graph = adjacency_list >; DomTreePredMap = iterator_property_map<__gnu_cxx::__normal_iterator >, adj_list_vertex_property_map >, int, int&, vertex_index_t> >; typename graph_traits::vertex_descriptor = void*]’ dominatorTree.cpp:46:36: required from here /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::Assignable::~Assignable() [with TT = void*]’ 37 | ~model() | ^ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:145:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 145 | BOOST_CONCEPT_USAGE(Assignable) { | ^~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::concepts::MultiPassInputIterator >, boost::no_property>*, std::vector >, boost::no_property>, std::allocator >, boost::no_property> > > >, void*, boost::detail::edge_desc_impl, long int> >]’: /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements >, boost::no_property>*, std::vector >, boost::no_property>, std::allocator >, boost::no_property> > > >, void*, boost::detail::edge_desc_impl, long int> > >]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/graph_concepts.hpp:52:50: required from ‘struct boost::concepts::MultiPassInputIterator >, boost::no_property>*, std::vector >, boost::no_property>, std::allocator >, boost::no_property> > > >, void*, boost::detail::edge_desc_impl, long int> >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::concepts::MultiPassInputIterator >, boost::no_property>*, std::vector >, boost::no_property>, std::allocator >, boost::no_property> > > >, void*, boost::detail::edge_desc_impl, long int> >]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied >, boost::no_property>*, std::vector >, boost::no_property>, std::allocator >, boost::no_property> > > >, void*, boost::detail::edge_desc_impl, long int> > >::value’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied >, boost::no_property>*, std::vector >, boost::no_property>, std::allocator >, boost::no_property> > > >, void*, boost::detail::edge_desc_impl, long int> > >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:72:8: [ skipping 8 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied > > >::value’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied > > >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_ > >)>’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/dominator_tree.hpp:245:5: required from ‘void boost::lengauer_tarjan_dominator_tree(const Graph&, const typename graph_traits::vertex_descriptor&, const IndexMap&, TimeMap, PredMap, VertexVector&, DomTreePredMap) [with Graph = adjacency_list >; IndexMap = adj_list_vertex_property_map >, int, const int&, vertex_index_t>; TimeMap = iterator_property_map<__gnu_cxx::__normal_iterator > >, adj_list_vertex_property_map >, int, const int&, vertex_index_t>, long unsigned int, long unsigned int&>; PredMap = iterator_property_map<__gnu_cxx::__normal_iterator >, adj_list_vertex_property_map >, int, const int&, vertex_index_t>, void*, void*&>; VertexVector = std::vector; DomTreePredMap = iterator_property_map<__gnu_cxx::__normal_iterator >, adj_list_vertex_property_map >, int, int&, vertex_index_t> >; typename graph_traits::vertex_descriptor = void*]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/dominator_tree.hpp:360:35: required from ‘void boost::lengauer_tarjan_dominator_tree(const Graph&, const typename graph_traits::vertex_descriptor&, DomTreePredMap) [with Graph = adjacency_list >; DomTreePredMap = iterator_property_map<__gnu_cxx::__normal_iterator >, adj_list_vertex_property_map >, int, int&, vertex_index_t> >; typename graph_traits::vertex_descriptor = void*]’ dominatorTree.cpp:46:36: required from here /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::concepts::MultiPassInputIterator::~MultiPassInputIterator() [with T = boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator >, boost::no_property>*, std::vector >, boost::no_property>, std::allocator >, boost::no_property> > > >, void*, boost::detail::edge_desc_impl, long int>]’ 37 | ~model() | ^ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/graph_concepts.hpp:52:50: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 52 | BOOST_concept(MultiPassInputIterator, (T)) { BOOST_CONCEPT_USAGE( | ^~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::DefaultConstructible >]’: /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements > >]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:137:5: required from ‘struct boost::DefaultConstructible >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::DefaultConstructible >]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied > >::value’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied > >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:72:8: [ skipping 8 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied > > >::value’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied > > >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_ > >)>’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/dominator_tree.hpp:245:5: required from ‘void boost::lengauer_tarjan_dominator_tree(const Graph&, const typename graph_traits::vertex_descriptor&, const IndexMap&, TimeMap, PredMap, VertexVector&, DomTreePredMap) [with Graph = adjacency_list >; IndexMap = adj_list_vertex_property_map >, int, const int&, vertex_index_t>; TimeMap = iterator_property_map<__gnu_cxx::__normal_iterator > >, adj_list_vertex_property_map >, int, const int&, vertex_index_t>, long unsigned int, long unsigned int&>; PredMap = iterator_property_map<__gnu_cxx::__normal_iterator >, adj_list_vertex_property_map >, int, const int&, vertex_index_t>, void*, void*&>; VertexVector = std::vector; DomTreePredMap = iterator_property_map<__gnu_cxx::__normal_iterator >, adj_list_vertex_property_map >, int, int&, vertex_index_t> >; typename graph_traits::vertex_descriptor = void*]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/dominator_tree.hpp:360:35: required from ‘void boost::lengauer_tarjan_dominator_tree(const Graph&, const typename graph_traits::vertex_descriptor&, DomTreePredMap) [with Graph = adjacency_list >; DomTreePredMap = iterator_property_map<__gnu_cxx::__normal_iterator >, adj_list_vertex_property_map >, int, int&, vertex_index_t> >; typename graph_traits::vertex_descriptor = void*]’ dominatorTree.cpp:46:36: required from here /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::DefaultConstructible::~DefaultConstructible() [with TT = boost::detail::edge_desc_impl]’ 37 | ~model() | ^ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:137:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 137 | BOOST_CONCEPT_USAGE(DefaultConstructible) { | ^~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::EqualityComparable >]’: /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements > >]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:233:5: required from ‘struct boost::EqualityComparable >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::EqualityComparable >]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied > >::value’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied > >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:72:8: [ skipping 8 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied > > >::value’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied > > >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_ > >)>’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/dominator_tree.hpp:245:5: required from ‘void boost::lengauer_tarjan_dominator_tree(const Graph&, const typename graph_traits::vertex_descriptor&, const IndexMap&, TimeMap, PredMap, VertexVector&, DomTreePredMap) [with Graph = adjacency_list >; IndexMap = adj_list_vertex_property_map >, int, const int&, vertex_index_t>; TimeMap = iterator_property_map<__gnu_cxx::__normal_iterator > >, adj_list_vertex_property_map >, int, const int&, vertex_index_t>, long unsigned int, long unsigned int&>; PredMap = iterator_property_map<__gnu_cxx::__normal_iterator >, adj_list_vertex_property_map >, int, const int&, vertex_index_t>, void*, void*&>; VertexVector = std::vector; DomTreePredMap = iterator_property_map<__gnu_cxx::__normal_iterator >, adj_list_vertex_property_map >, int, int&, vertex_index_t> >; typename graph_traits::vertex_descriptor = void*]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/dominator_tree.hpp:360:35: required from ‘void boost::lengauer_tarjan_dominator_tree(const Graph&, const typename graph_traits::vertex_descriptor&, DomTreePredMap) [with Graph = adjacency_list >; DomTreePredMap = iterator_property_map<__gnu_cxx::__normal_iterator >, adj_list_vertex_property_map >, int, int&, vertex_index_t> >; typename graph_traits::vertex_descriptor = void*]’ dominatorTree.cpp:46:36: required from here /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::EqualityComparable::~EqualityComparable() [with TT = boost::detail::edge_desc_impl]’ 37 | ~model() | ^ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:233:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 233 | BOOST_CONCEPT_USAGE(EqualityComparable) { | ^~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::Assignable >]’: /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements > >]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:145:5: required from ‘struct boost::Assignable >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::Assignable >]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied > >::value’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied > >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:72:8: [ skipping 8 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied > > >::value’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied > > >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_ > >)>’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/dominator_tree.hpp:245:5: required from ‘void boost::lengauer_tarjan_dominator_tree(const Graph&, const typename graph_traits::vertex_descriptor&, const IndexMap&, TimeMap, PredMap, VertexVector&, DomTreePredMap) [with Graph = adjacency_list >; IndexMap = adj_list_vertex_property_map >, int, const int&, vertex_index_t>; TimeMap = iterator_property_map<__gnu_cxx::__normal_iterator > >, adj_list_vertex_property_map >, int, const int&, vertex_index_t>, long unsigned int, long unsigned int&>; PredMap = iterator_property_map<__gnu_cxx::__normal_iterator >, adj_list_vertex_property_map >, int, const int&, vertex_index_t>, void*, void*&>; VertexVector = std::vector; DomTreePredMap = iterator_property_map<__gnu_cxx::__normal_iterator >, adj_list_vertex_property_map >, int, int&, vertex_index_t> >; typename graph_traits::vertex_descriptor = void*]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/dominator_tree.hpp:360:35: required from ‘void boost::lengauer_tarjan_dominator_tree(const Graph&, const typename graph_traits::vertex_descriptor&, DomTreePredMap) [with Graph = adjacency_list >; DomTreePredMap = iterator_property_map<__gnu_cxx::__normal_iterator >, adj_list_vertex_property_map >, int, int&, vertex_index_t> >; typename graph_traits::vertex_descriptor = void*]’ dominatorTree.cpp:46:36: required from here /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::Assignable::~Assignable() [with TT = boost::detail::edge_desc_impl]’ 37 | ~model() | ^ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:145:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 145 | BOOST_CONCEPT_USAGE(Assignable) { | ^~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::Convertible]’: /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements >]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:208:5: required from ‘struct boost::Convertible’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::Convertible]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied >::value’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:72:8: [ skipping 8 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied > > >::value’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied > > >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_ > >)>’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/dominator_tree.hpp:245:5: required from ‘void boost::lengauer_tarjan_dominator_tree(const Graph&, const typename graph_traits::vertex_descriptor&, const IndexMap&, TimeMap, PredMap, VertexVector&, DomTreePredMap) [with Graph = adjacency_list >; IndexMap = adj_list_vertex_property_map >, int, const int&, vertex_index_t>; TimeMap = iterator_property_map<__gnu_cxx::__normal_iterator > >, adj_list_vertex_property_map >, int, const int&, vertex_index_t>, long unsigned int, long unsigned int&>; PredMap = iterator_property_map<__gnu_cxx::__normal_iterator >, adj_list_vertex_property_map >, int, const int&, vertex_index_t>, void*, void*&>; VertexVector = std::vector; DomTreePredMap = iterator_property_map<__gnu_cxx::__normal_iterator >, adj_list_vertex_property_map >, int, int&, vertex_index_t> >; typename graph_traits::vertex_descriptor = void*]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/dominator_tree.hpp:360:35: required from ‘void boost::lengauer_tarjan_dominator_tree(const Graph&, const typename graph_traits::vertex_descriptor&, DomTreePredMap) [with Graph = adjacency_list >; DomTreePredMap = iterator_property_map<__gnu_cxx::__normal_iterator >, adj_list_vertex_property_map >, int, int&, vertex_index_t> >; typename graph_traits::vertex_descriptor = void*]’ dominatorTree.cpp:46:36: required from here /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::Convertible::~Convertible() [with X = boost::bidir_adj_list_traversal_tag; Y = boost::incidence_graph_tag]’ 37 | ~model() | ^ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:208:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 208 | BOOST_CONCEPT_USAGE(Convertible) { | ^~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements >, boost::no_property>*, std::vector >, boost::no_property>, std::allocator >, boost::no_property> > > >, void*, boost::detail::edge_desc_impl, long int> > >]’: /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:145:5: required from ‘struct boost::Assignable >, boost::no_property>*, std::vector >, boost::no_property>, std::allocator >, boost::no_property> > > >, void*, boost::detail::edge_desc_impl, long int> >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:502:3: required from ‘struct boost::InputIterator >, boost::no_property>*, std::vector >, boost::no_property>, std::allocator >, boost::no_property> > > >, void*, boost::detail::edge_desc_impl, long int> >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::InputIterator >, boost::no_property>*, std::vector >, boost::no_property>, std::allocator >, boost::no_property> > > >, void*, boost::detail::edge_desc_impl, long int> >]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied >, boost::no_property>*, std::vector >, boost::no_property>, std::allocator >, boost::no_property> > > >, void*, boost::detail::edge_desc_impl, long int> > >::value’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied >, boost::no_property>*, std::vector >, boost::no_property>, std::allocator >, boost::no_property> > > >, void*, boost::detail::edge_desc_impl, long int> > >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:72:8: [ skipping 2 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::MultiPassInputIterator >, boost::no_property>*, std::vector >, boost::no_property>, std::allocator >, boost::no_property> > > >, void*, boost::detail::edge_desc_impl, long int> >]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/graph_concepts.hpp:125:9: required from ‘boost::concepts::BidirectionalGraph::~BidirectionalGraph() [with G = boost::adjacency_list >]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/graph_concepts.hpp:118:1: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::BidirectionalGraphConcept > >]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/dominator_tree.hpp:245:5: required from ‘void boost::lengauer_tarjan_dominator_tree(const Graph&, const typename graph_traits::vertex_descriptor&, const IndexMap&, TimeMap, PredMap, VertexVector&, DomTreePredMap) [with Graph = adjacency_list >; IndexMap = adj_list_vertex_property_map >, int, const int&, vertex_index_t>; TimeMap = iterator_property_map<__gnu_cxx::__normal_iterator > >, adj_list_vertex_property_map >, int, const int&, vertex_index_t>, long unsigned int, long unsigned int&>; PredMap = iterator_property_map<__gnu_cxx::__normal_iterator >, adj_list_vertex_property_map >, int, const int&, vertex_index_t>, void*, void*&>; VertexVector = std::vector; DomTreePredMap = iterator_property_map<__gnu_cxx::__normal_iterator >, adj_list_vertex_property_map >, int, int&, vertex_index_t> >; typename graph_traits::vertex_descriptor = void*]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/dominator_tree.hpp:360:35: required from ‘void boost::lengauer_tarjan_dominator_tree(const Graph&, const typename graph_traits::vertex_descriptor&, DomTreePredMap) [with Graph = adjacency_list >; DomTreePredMap = iterator_property_map<__gnu_cxx::__normal_iterator >, adj_list_vertex_property_map >, int, int&, vertex_index_t> >; typename graph_traits::vertex_descriptor = void*]’ dominatorTree.cpp:46:36: required from here /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::Assignable >, boost::no_property>*, std::vector >, boost::no_property>, std::allocator >, boost::no_property> > > >, void*, boost::detail::edge_desc_impl, long int> >]’ 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ^ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements >, boost::no_property>*, std::vector >, boost::no_property>, std::allocator >, boost::no_property> > > >, void*, boost::detail::edge_desc_impl, long int> > >]’: /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:233:5: required from ‘struct boost::EqualityComparable >, boost::no_property>*, std::vector >, boost::no_property>, std::allocator >, boost::no_property> > > >, void*, boost::detail::edge_desc_impl, long int> >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:502:3: required from ‘struct boost::InputIterator >, boost::no_property>*, std::vector >, boost::no_property>, std::allocator >, boost::no_property> > > >, void*, boost::detail::edge_desc_impl, long int> >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::InputIterator >, boost::no_property>*, std::vector >, boost::no_property>, std::allocator >, boost::no_property> > > >, void*, boost::detail::edge_desc_impl, long int> >]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied >, boost::no_property>*, std::vector >, boost::no_property>, std::allocator >, boost::no_property> > > >, void*, boost::detail::edge_desc_impl, long int> > >::value’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied >, boost::no_property>*, std::vector >, boost::no_property>, std::allocator >, boost::no_property> > > >, void*, boost::detail::edge_desc_impl, long int> > >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:72:8: [ skipping 2 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::MultiPassInputIterator >, boost::no_property>*, std::vector >, boost::no_property>, std::allocator >, boost::no_property> > > >, void*, boost::detail::edge_desc_impl, long int> >]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/graph_concepts.hpp:125:9: required from ‘boost::concepts::BidirectionalGraph::~BidirectionalGraph() [with G = boost::adjacency_list >]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/graph_concepts.hpp:118:1: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::BidirectionalGraphConcept > >]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/dominator_tree.hpp:245:5: required from ‘void boost::lengauer_tarjan_dominator_tree(const Graph&, const typename graph_traits::vertex_descriptor&, const IndexMap&, TimeMap, PredMap, VertexVector&, DomTreePredMap) [with Graph = adjacency_list >; IndexMap = adj_list_vertex_property_map >, int, const int&, vertex_index_t>; TimeMap = iterator_property_map<__gnu_cxx::__normal_iterator > >, adj_list_vertex_property_map >, int, const int&, vertex_index_t>, long unsigned int, long unsigned int&>; PredMap = iterator_property_map<__gnu_cxx::__normal_iterator >, adj_list_vertex_property_map >, int, const int&, vertex_index_t>, void*, void*&>; VertexVector = std::vector; DomTreePredMap = iterator_property_map<__gnu_cxx::__normal_iterator >, adj_list_vertex_property_map >, int, int&, vertex_index_t> >; typename graph_traits::vertex_descriptor = void*]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/dominator_tree.hpp:360:35: required from ‘void boost::lengauer_tarjan_dominator_tree(const Graph&, const typename graph_traits::vertex_descriptor&, DomTreePredMap) [with Graph = adjacency_list >; DomTreePredMap = iterator_property_map<__gnu_cxx::__normal_iterator >, adj_list_vertex_property_map >, int, int&, vertex_index_t> >; typename graph_traits::vertex_descriptor = void*]’ dominatorTree.cpp:46:36: required from here /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::EqualityComparable >, boost::no_property>*, std::vector >, boost::no_property>, std::allocator >, boost::no_property> > > >, void*, boost::detail::edge_desc_impl, long int> >]’ 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ^ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements >, boost::no_property>*, std::vector >, boost::no_property>, std::allocator >, boost::no_property> > > >, void*, boost::detail::edge_desc_impl, long int> > >]’: /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:512:7: required from ‘struct boost::InputIterator >, boost::no_property>*, std::vector >, boost::no_property>, std::allocator >, boost::no_property> > > >, void*, boost::detail::edge_desc_impl, long int> >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::InputIterator >, boost::no_property>*, std::vector >, boost::no_property>, std::allocator >, boost::no_property> > > >, void*, boost::detail::edge_desc_impl, long int> >]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied >, boost::no_property>*, std::vector >, boost::no_property>, std::allocator >, boost::no_property> > > >, void*, boost::detail::edge_desc_impl, long int> > >::value’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied >, boost::no_property>*, std::vector >, boost::no_property>, std::allocator >, boost::no_property> > > >, void*, boost::detail::edge_desc_impl, long int> > >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:72:8: [ skipping 2 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::MultiPassInputIterator >, boost::no_property>*, std::vector >, boost::no_property>, std::allocator >, boost::no_property> > > >, void*, boost::detail::edge_desc_impl, long int> >]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/graph_concepts.hpp:125:9: required from ‘boost::concepts::BidirectionalGraph::~BidirectionalGraph() [with G = boost::adjacency_list >]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/graph_concepts.hpp:118:1: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::BidirectionalGraphConcept > >]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/dominator_tree.hpp:245:5: required from ‘void boost::lengauer_tarjan_dominator_tree(const Graph&, const typename graph_traits::vertex_descriptor&, const IndexMap&, TimeMap, PredMap, VertexVector&, DomTreePredMap) [with Graph = adjacency_list >; IndexMap = adj_list_vertex_property_map >, int, const int&, vertex_index_t>; TimeMap = iterator_property_map<__gnu_cxx::__normal_iterator > >, adj_list_vertex_property_map >, int, const int&, vertex_index_t>, long unsigned int, long unsigned int&>; PredMap = iterator_property_map<__gnu_cxx::__normal_iterator >, adj_list_vertex_property_map >, int, const int&, vertex_index_t>, void*, void*&>; VertexVector = std::vector; DomTreePredMap = iterator_property_map<__gnu_cxx::__normal_iterator >, adj_list_vertex_property_map >, int, int&, vertex_index_t> >; typename graph_traits::vertex_descriptor = void*]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/dominator_tree.hpp:360:35: required from ‘void boost::lengauer_tarjan_dominator_tree(const Graph&, const typename graph_traits::vertex_descriptor&, DomTreePredMap) [with Graph = adjacency_list >; DomTreePredMap = iterator_property_map<__gnu_cxx::__normal_iterator >, adj_list_vertex_property_map >, int, int&, vertex_index_t> >; typename graph_traits::vertex_descriptor = void*]’ dominatorTree.cpp:46:36: required from here /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::InputIterator >, boost::no_property>*, std::vector >, boost::no_property>, std::allocator >, boost::no_property> > > >, void*, boost::detail::edge_desc_impl, long int> >]’ 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ^ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::InputIterator >, boost::no_property>*, std::vector >, boost::no_property>, std::allocator >, boost::no_property> > > >, void*, boost::detail::edge_desc_impl, long int> >]’: /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/graph_concepts.hpp:53:35: required from ‘boost::concepts::MultiPassInputIterator::~MultiPassInputIterator() [with T = boost::detail::in_edge_iter<__gnu_cxx::__normal_iterator >, boost::no_property>*, std::vector >, boost::no_property>, std::allocator >, boost::no_property> > > >, void*, boost::detail::edge_desc_impl, long int>]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::MultiPassInputIterator >, boost::no_property>*, std::vector >, boost::no_property>, std::allocator >, boost::no_property> > > >, void*, boost::detail::edge_desc_impl, long int> >]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/graph_concepts.hpp:125:9: required from ‘boost::concepts::BidirectionalGraph::~BidirectionalGraph() [with G = boost::adjacency_list >]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/graph_concepts.hpp:118:1: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::BidirectionalGraphConcept > >]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/dominator_tree.hpp:245:5: required from ‘void boost::lengauer_tarjan_dominator_tree(const Graph&, const typename graph_traits::vertex_descriptor&, const IndexMap&, TimeMap, PredMap, VertexVector&, DomTreePredMap) [with Graph = adjacency_list >; IndexMap = adj_list_vertex_property_map >, int, const int&, vertex_index_t>; TimeMap = iterator_property_map<__gnu_cxx::__normal_iterator > >, adj_list_vertex_property_map >, int, const int&, vertex_index_t>, long unsigned int, long unsigned int&>; PredMap = iterator_property_map<__gnu_cxx::__normal_iterator >, adj_list_vertex_property_map >, int, const int&, vertex_index_t>, void*, void*&>; VertexVector = std::vector; DomTreePredMap = iterator_property_map<__gnu_cxx::__normal_iterator >, adj_list_vertex_property_map >, int, int&, vertex_index_t> >; typename graph_traits::vertex_descriptor = void*]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/dominator_tree.hpp:360:35: required from ‘void boost::lengauer_tarjan_dominator_tree(const Graph&, const typename graph_traits::vertex_descriptor&, DomTreePredMap) [with Graph = adjacency_list >; DomTreePredMap = iterator_property_map<__gnu_cxx::__normal_iterator >, adj_list_vertex_property_map >, int, int&, vertex_index_t> >; typename graph_traits::vertex_descriptor = void*]’ dominatorTree.cpp:46:36: required from here /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::InputIterator::~InputIterator() [with TT = boost::detail::in_edge_iter<__gnu_cxx::__normal_iterator >, boost::no_property>*, std::vector >, boost::no_property>, std::allocator >, boost::no_property> > > >, void*, boost::detail::edge_desc_impl, long int>]’ 37 | ~model() | ^ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:512:7: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 512 | BOOST_CONCEPT_USAGE(InputIterator) | ^~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::CopyConstructible >, boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>, void*, void*&>, boost::on_tree_edge>, boost::detail::time_stamper_with_vertex_vector > >, boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>, long unsigned int, long unsigned int&>, std::vector, long unsigned int, boost::on_discover_vertex> > > >]’: /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements >, boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>, void*, void*&>, boost::on_tree_edge>, boost::detail::time_stamper_with_vertex_vector > >, boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>, long unsigned int, long unsigned int&>, std::vector, long unsigned int, boost::on_discover_vertex> > > > >]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:167:5: required from ‘struct boost::CopyConstructible >, boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>, void*, void*&>, boost::on_tree_edge>, boost::detail::time_stamper_with_vertex_vector > >, boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>, long unsigned int, long unsigned int&>, std::vector, long unsigned int, boost::on_discover_vertex> > > >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:165:3: required from ‘struct boost::CopyConstructibleConcept >, boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>, void*, void*&>, boost::on_tree_edge>, boost::detail::time_stamper_with_vertex_vector > >, boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>, long unsigned int, long unsigned int&>, std::vector, long unsigned int, boost::on_discover_vertex> > > >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::CopyConstructibleConcept >, boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>, void*, void*&>, boost::on_tree_edge>, boost::detail::time_stamper_with_vertex_vector > >, boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>, long unsigned int, long unsigned int&>, std::vector, long unsigned int, boost::on_discover_vertex> > > >]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied >, boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>, void*, void*&>, boost::on_tree_edge>, boost::detail::time_stamper_with_vertex_vector > >, boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>, long unsigned int, long unsigned int&>, std::vector, long unsigned int, boost::on_discover_vertex> > > > >::value’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:45:51: [ skipping 6 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_ >, boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>, void*, void*&>, boost::on_tree_edge>, boost::detail::time_stamper_with_vertex_vector > >, boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>, long unsigned int, long unsigned int&>, std::vector, long unsigned int, boost::on_discover_vertex> > >, boost::adjacency_list > >)>’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/depth_first_search.hpp:130:9: required from ‘void boost::detail::depth_first_visit_impl(const IncidenceGraph&, typename boost::graph_traits::vertex_descriptor, DFSVisitor&, ColorMap, TerminatorFunc) [with IncidenceGraph = boost::adjacency_list >; DFSVisitor = boost::dfs_visitor >, boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>, void*, void*&>, boost::on_tree_edge>, time_stamper_with_vertex_vector > >, boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>, long unsigned int, long unsigned int&>, std::vector, long unsigned int, boost::on_discover_vertex> > >; ColorMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>, boost::default_color_type, boost::default_color_type&>; TerminatorFunc = nontruth2; typename boost::graph_traits::vertex_descriptor = void*]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/depth_first_search.hpp:417:35: required from ‘void boost::depth_first_visit(const IncidenceGraph&, typename graph_traits::vertex_descriptor, DFSVisitor, ColorMap) [with IncidenceGraph = adjacency_list >; DFSVisitor = dfs_visitor >, adj_list_vertex_property_map >, int, const int&, vertex_index_t>, void*, void*&>, on_tree_edge>, detail::time_stamper_with_vertex_vector > >, adj_list_vertex_property_map >, int, const int&, vertex_index_t>, long unsigned int, long unsigned int&>, std::vector, long unsigned int, on_discover_vertex> > >; ColorMap = iterator_property_map<__gnu_cxx::__normal_iterator >, adj_list_vertex_property_map >, int, const int&, vertex_index_t>, default_color_type, default_color_type&>; typename graph_traits::vertex_descriptor = void*]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/dominator_tree.hpp:309:22: required from ‘void boost::lengauer_tarjan_dominator_tree(const Graph&, const typename graph_traits::vertex_descriptor&, const IndexMap&, TimeMap, PredMap, VertexVector&, DomTreePredMap) [with Graph = adjacency_list >; IndexMap = adj_list_vertex_property_map >, int, const int&, vertex_index_t>; TimeMap = iterator_property_map<__gnu_cxx::__normal_iterator > >, adj_list_vertex_property_map >, int, const int&, vertex_index_t>, long unsigned int, long unsigned int&>; PredMap = iterator_property_map<__gnu_cxx::__normal_iterator >, adj_list_vertex_property_map >, int, const int&, vertex_index_t>, void*, void*&>; VertexVector = std::vector; DomTreePredMap = iterator_property_map<__gnu_cxx::__normal_iterator >, adj_list_vertex_property_map >, int, int&, vertex_index_t> >; typename graph_traits::vertex_descriptor = void*]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/dominator_tree.hpp:360:35: required from ‘void boost::lengauer_tarjan_dominator_tree(const Graph&, const typename graph_traits::vertex_descriptor&, DomTreePredMap) [with Graph = adjacency_list >; DomTreePredMap = iterator_property_map<__gnu_cxx::__normal_iterator >, adj_list_vertex_property_map >, int, int&, vertex_index_t> >; typename graph_traits::vertex_descriptor = void*]’ dominatorTree.cpp:46:36: required from here /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::CopyConstructible::~CopyConstructible() [with TT = boost::dfs_visitor >, boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>, void*, void*&>, boost::on_tree_edge>, boost::detail::time_stamper_with_vertex_vector > >, boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>, long unsigned int, long unsigned int&>, std::vector, long unsigned int, boost::on_discover_vertex> > >]’ 37 | ~model() | ^ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:167:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 167 | BOOST_CONCEPT_USAGE(CopyConstructible) { | ^~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements >]’: /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:208:5: required from ‘struct boost::Convertible’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:206:3: required from ‘struct boost::ConvertibleConcept’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::ConvertibleConcept]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied >::value’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:72:8: [ skipping 10 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_ >, boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>, boost::default_color_type, boost::default_color_type&>, void*>)>’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/depth_first_search.hpp:134:9: required from ‘void boost::detail::depth_first_visit_impl(const IncidenceGraph&, typename boost::graph_traits::vertex_descriptor, DFSVisitor&, ColorMap, TerminatorFunc) [with IncidenceGraph = boost::adjacency_list >; DFSVisitor = boost::dfs_visitor >, boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>, void*, void*&>, boost::on_tree_edge>, time_stamper_with_vertex_vector > >, boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>, long unsigned int, long unsigned int&>, std::vector, long unsigned int, boost::on_discover_vertex> > >; ColorMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>, boost::default_color_type, boost::default_color_type&>; TerminatorFunc = nontruth2; typename boost::graph_traits::vertex_descriptor = void*]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/depth_first_search.hpp:417:35: required from ‘void boost::depth_first_visit(const IncidenceGraph&, typename graph_traits::vertex_descriptor, DFSVisitor, ColorMap) [with IncidenceGraph = adjacency_list >; DFSVisitor = dfs_visitor >, adj_list_vertex_property_map >, int, const int&, vertex_index_t>, void*, void*&>, on_tree_edge>, detail::time_stamper_with_vertex_vector > >, adj_list_vertex_property_map >, int, const int&, vertex_index_t>, long unsigned int, long unsigned int&>, std::vector, long unsigned int, on_discover_vertex> > >; ColorMap = iterator_property_map<__gnu_cxx::__normal_iterator >, adj_list_vertex_property_map >, int, const int&, vertex_index_t>, default_color_type, default_color_type&>; typename graph_traits::vertex_descriptor = void*]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/dominator_tree.hpp:309:22: required from ‘void boost::lengauer_tarjan_dominator_tree(const Graph&, const typename graph_traits::vertex_descriptor&, const IndexMap&, TimeMap, PredMap, VertexVector&, DomTreePredMap) [with Graph = adjacency_list >; IndexMap = adj_list_vertex_property_map >, int, const int&, vertex_index_t>; TimeMap = iterator_property_map<__gnu_cxx::__normal_iterator > >, adj_list_vertex_property_map >, int, const int&, vertex_index_t>, long unsigned int, long unsigned int&>; PredMap = iterator_property_map<__gnu_cxx::__normal_iterator >, adj_list_vertex_property_map >, int, const int&, vertex_index_t>, void*, void*&>; VertexVector = std::vector; DomTreePredMap = iterator_property_map<__gnu_cxx::__normal_iterator >, adj_list_vertex_property_map >, int, int&, vertex_index_t> >; typename graph_traits::vertex_descriptor = void*]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/dominator_tree.hpp:360:35: required from ‘void boost::lengauer_tarjan_dominator_tree(const Graph&, const typename graph_traits::vertex_descriptor&, DomTreePredMap) [with Graph = adjacency_list >; DomTreePredMap = iterator_property_map<__gnu_cxx::__normal_iterator >, adj_list_vertex_property_map >, int, int&, vertex_index_t> >; typename graph_traits::vertex_descriptor = void*]’ dominatorTree.cpp:46:36: required from here /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::Convertible]’ 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ^ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::ConvertibleConcept]’: /home/omnipath/local/R/4.4-3.20/BH/include/boost/property_map/property_map.hpp:148:7: required from ‘void boost::ReadablePropertyMapConcept::constraints() [with PMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>, boost::default_color_type, boost::default_color_type&>; Key = void*]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::ReadablePropertyMapConcept >, boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>, boost::default_color_type, boost::default_color_type&>, void*>]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied >, boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>, boost::default_color_type, boost::default_color_type&>, void*> >::value’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied >, boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>, boost::default_color_type, boost::default_color_type&>, void*> >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_ >, boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>, boost::default_color_type, boost::default_color_type&>, void*>)>’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/property_map/property_map.hpp:206:7: [ skipping 4 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_ >, boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>, boost::default_color_type, boost::default_color_type&>, void*>)>’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/depth_first_search.hpp:134:9: required from ‘void boost::detail::depth_first_visit_impl(const IncidenceGraph&, typename boost::graph_traits::vertex_descriptor, DFSVisitor&, ColorMap, TerminatorFunc) [with IncidenceGraph = boost::adjacency_list >; DFSVisitor = boost::dfs_visitor >, boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>, void*, void*&>, boost::on_tree_edge>, time_stamper_with_vertex_vector > >, boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>, long unsigned int, long unsigned int&>, std::vector, long unsigned int, boost::on_discover_vertex> > >; ColorMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>, boost::default_color_type, boost::default_color_type&>; TerminatorFunc = nontruth2; typename boost::graph_traits::vertex_descriptor = void*]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/depth_first_search.hpp:417:35: required from ‘void boost::depth_first_visit(const IncidenceGraph&, typename graph_traits::vertex_descriptor, DFSVisitor, ColorMap) [with IncidenceGraph = adjacency_list >; DFSVisitor = dfs_visitor >, adj_list_vertex_property_map >, int, const int&, vertex_index_t>, void*, void*&>, on_tree_edge>, detail::time_stamper_with_vertex_vector > >, adj_list_vertex_property_map >, int, const int&, vertex_index_t>, long unsigned int, long unsigned int&>, std::vector, long unsigned int, on_discover_vertex> > >; ColorMap = iterator_property_map<__gnu_cxx::__normal_iterator >, adj_list_vertex_property_map >, int, const int&, vertex_index_t>, default_color_type, default_color_type&>; typename graph_traits::vertex_descriptor = void*]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/dominator_tree.hpp:309:22: required from ‘void boost::lengauer_tarjan_dominator_tree(const Graph&, const typename graph_traits::vertex_descriptor&, const IndexMap&, TimeMap, PredMap, VertexVector&, DomTreePredMap) [with Graph = adjacency_list >; IndexMap = adj_list_vertex_property_map >, int, const int&, vertex_index_t>; TimeMap = iterator_property_map<__gnu_cxx::__normal_iterator > >, adj_list_vertex_property_map >, int, const int&, vertex_index_t>, long unsigned int, long unsigned int&>; PredMap = iterator_property_map<__gnu_cxx::__normal_iterator >, adj_list_vertex_property_map >, int, const int&, vertex_index_t>, void*, void*&>; VertexVector = std::vector; DomTreePredMap = iterator_property_map<__gnu_cxx::__normal_iterator >, adj_list_vertex_property_map >, int, int&, vertex_index_t> >; typename graph_traits::vertex_descriptor = void*]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/dominator_tree.hpp:360:35: required from ‘void boost::lengauer_tarjan_dominator_tree(const Graph&, const typename graph_traits::vertex_descriptor&, DomTreePredMap) [with Graph = adjacency_list >; DomTreePredMap = iterator_property_map<__gnu_cxx::__normal_iterator >, adj_list_vertex_property_map >, int, int&, vertex_index_t> >; typename graph_traits::vertex_descriptor = void*]’ dominatorTree.cpp:46:36: required from here /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:206:17: note: in a call to non-static member function ‘boost::ConvertibleConcept::~ConvertibleConcept()’ 206 | BOOST_concept(Convertible,(X)(Y)) | ^~~~~~~~~~~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/preprocessor/cat.hpp:29:34: note: in definition of macro ‘BOOST_PP_CAT_I’ 29 | # define BOOST_PP_CAT_I(a, b) a ## b | ^ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/concept_def.hpp:23:12: note: in expansion of macro ‘BOOST_PP_CAT’ 23 | struct BOOST_PP_CAT(name,Concept) \ | ^~~~~~~~~~~~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:206:3: note: in expansion of macro ‘BOOST_concept’ 206 | BOOST_concept(Convertible,(X)(Y)) | ^~~~~~~~~~~~~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements >]’: /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:208:5: required from ‘struct boost::Convertible’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:206:3: required from ‘struct boost::ConvertibleConcept’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::ConvertibleConcept]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied >::value’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:72:8: [ skipping 10 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_ >, boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>, boost::default_color_type, boost::default_color_type&>, void*>)>’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/depth_first_search.hpp:134:9: required from ‘void boost::detail::depth_first_visit_impl(const IncidenceGraph&, typename boost::graph_traits::vertex_descriptor, DFSVisitor&, ColorMap, TerminatorFunc) [with IncidenceGraph = boost::adjacency_list >; DFSVisitor = boost::dfs_visitor >, boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>, void*, void*&>, boost::on_tree_edge>, time_stamper_with_vertex_vector > >, boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>, long unsigned int, long unsigned int&>, std::vector, long unsigned int, boost::on_discover_vertex> > >; ColorMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>, boost::default_color_type, boost::default_color_type&>; TerminatorFunc = nontruth2; typename boost::graph_traits::vertex_descriptor = void*]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/depth_first_search.hpp:417:35: required from ‘void boost::depth_first_visit(const IncidenceGraph&, typename graph_traits::vertex_descriptor, DFSVisitor, ColorMap) [with IncidenceGraph = adjacency_list >; DFSVisitor = dfs_visitor >, adj_list_vertex_property_map >, int, const int&, vertex_index_t>, void*, void*&>, on_tree_edge>, detail::time_stamper_with_vertex_vector > >, adj_list_vertex_property_map >, int, const int&, vertex_index_t>, long unsigned int, long unsigned int&>, std::vector, long unsigned int, on_discover_vertex> > >; ColorMap = iterator_property_map<__gnu_cxx::__normal_iterator >, adj_list_vertex_property_map >, int, const int&, vertex_index_t>, default_color_type, default_color_type&>; typename graph_traits::vertex_descriptor = void*]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/dominator_tree.hpp:309:22: required from ‘void boost::lengauer_tarjan_dominator_tree(const Graph&, const typename graph_traits::vertex_descriptor&, const IndexMap&, TimeMap, PredMap, VertexVector&, DomTreePredMap) [with Graph = adjacency_list >; IndexMap = adj_list_vertex_property_map >, int, const int&, vertex_index_t>; TimeMap = iterator_property_map<__gnu_cxx::__normal_iterator > >, adj_list_vertex_property_map >, int, const int&, vertex_index_t>, long unsigned int, long unsigned int&>; PredMap = iterator_property_map<__gnu_cxx::__normal_iterator >, adj_list_vertex_property_map >, int, const int&, vertex_index_t>, void*, void*&>; VertexVector = std::vector; DomTreePredMap = iterator_property_map<__gnu_cxx::__normal_iterator >, adj_list_vertex_property_map >, int, int&, vertex_index_t> >; typename graph_traits::vertex_descriptor = void*]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/dominator_tree.hpp:360:35: required from ‘void boost::lengauer_tarjan_dominator_tree(const Graph&, const typename graph_traits::vertex_descriptor&, DomTreePredMap) [with Graph = adjacency_list >; DomTreePredMap = iterator_property_map<__gnu_cxx::__normal_iterator >, adj_list_vertex_property_map >, int, int&, vertex_index_t> >; typename graph_traits::vertex_descriptor = void*]’ dominatorTree.cpp:46:36: required from here /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::Convertible]’ 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ^ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::ConvertibleConcept]’: /home/omnipath/local/R/4.4-3.20/BH/include/boost/property_map/property_map.hpp:180:7: required from ‘void boost::WritablePropertyMapConcept::constraints() [with PMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>, boost::default_color_type, boost::default_color_type&>; Key = void*]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::WritablePropertyMapConcept >, boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>, boost::default_color_type, boost::default_color_type&>, void*>]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied >, boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>, boost::default_color_type, boost::default_color_type&>, void*> >::value’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied >, boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>, boost::default_color_type, boost::default_color_type&>, void*> >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_ >, boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>, boost::default_color_type, boost::default_color_type&>, void*>)>’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/property_map/property_map.hpp:207:7: [ skipping 4 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_ >, boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>, boost::default_color_type, boost::default_color_type&>, void*>)>’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/depth_first_search.hpp:134:9: required from ‘void boost::detail::depth_first_visit_impl(const IncidenceGraph&, typename boost::graph_traits::vertex_descriptor, DFSVisitor&, ColorMap, TerminatorFunc) [with IncidenceGraph = boost::adjacency_list >; DFSVisitor = boost::dfs_visitor >, boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>, void*, void*&>, boost::on_tree_edge>, time_stamper_with_vertex_vector > >, boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>, long unsigned int, long unsigned int&>, std::vector, long unsigned int, boost::on_discover_vertex> > >; ColorMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>, boost::default_color_type, boost::default_color_type&>; TerminatorFunc = nontruth2; typename boost::graph_traits::vertex_descriptor = void*]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/depth_first_search.hpp:417:35: required from ‘void boost::depth_first_visit(const IncidenceGraph&, typename graph_traits::vertex_descriptor, DFSVisitor, ColorMap) [with IncidenceGraph = adjacency_list >; DFSVisitor = dfs_visitor >, adj_list_vertex_property_map >, int, const int&, vertex_index_t>, void*, void*&>, on_tree_edge>, detail::time_stamper_with_vertex_vector > >, adj_list_vertex_property_map >, int, const int&, vertex_index_t>, long unsigned int, long unsigned int&>, std::vector, long unsigned int, on_discover_vertex> > >; ColorMap = iterator_property_map<__gnu_cxx::__normal_iterator >, adj_list_vertex_property_map >, int, const int&, vertex_index_t>, default_color_type, default_color_type&>; typename graph_traits::vertex_descriptor = void*]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/dominator_tree.hpp:309:22: required from ‘void boost::lengauer_tarjan_dominator_tree(const Graph&, const typename graph_traits::vertex_descriptor&, const IndexMap&, TimeMap, PredMap, VertexVector&, DomTreePredMap) [with Graph = adjacency_list >; IndexMap = adj_list_vertex_property_map >, int, const int&, vertex_index_t>; TimeMap = iterator_property_map<__gnu_cxx::__normal_iterator > >, adj_list_vertex_property_map >, int, const int&, vertex_index_t>, long unsigned int, long unsigned int&>; PredMap = iterator_property_map<__gnu_cxx::__normal_iterator >, adj_list_vertex_property_map >, int, const int&, vertex_index_t>, void*, void*&>; VertexVector = std::vector; DomTreePredMap = iterator_property_map<__gnu_cxx::__normal_iterator >, adj_list_vertex_property_map >, int, int&, vertex_index_t> >; typename graph_traits::vertex_descriptor = void*]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/dominator_tree.hpp:360:35: required from ‘void boost::lengauer_tarjan_dominator_tree(const Graph&, const typename graph_traits::vertex_descriptor&, DomTreePredMap) [with Graph = adjacency_list >; DomTreePredMap = iterator_property_map<__gnu_cxx::__normal_iterator >, adj_list_vertex_property_map >, int, int&, vertex_index_t> >; typename graph_traits::vertex_descriptor = void*]’ dominatorTree.cpp:46:36: required from here /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:206:17: note: in a call to non-static member function ‘boost::ConvertibleConcept::~ConvertibleConcept()’ 206 | BOOST_concept(Convertible,(X)(Y)) | ^~~~~~~~~~~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/preprocessor/cat.hpp:29:34: note: in definition of macro ‘BOOST_PP_CAT_I’ 29 | # define BOOST_PP_CAT_I(a, b) a ## b | ^ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/concept_def.hpp:23:12: note: in expansion of macro ‘BOOST_PP_CAT’ 23 | struct BOOST_PP_CAT(name,Concept) \ | ^~~~~~~~~~~~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:206:3: note: in expansion of macro ‘BOOST_concept’ 206 | BOOST_concept(Convertible,(X)(Y)) | ^~~~~~~~~~~~~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::Convertible]’: /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements >]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:208:5: required from ‘struct boost::Convertible’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:206:3: required from ‘struct boost::ConvertibleConcept’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::ConvertibleConcept]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied >::value’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:45:51: [ skipping 6 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_ >, boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>, boost::default_color_type, boost::default_color_type&>, void*>)>’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/depth_first_search.hpp:134:9: required from ‘void boost::detail::depth_first_visit_impl(const IncidenceGraph&, typename boost::graph_traits::vertex_descriptor, DFSVisitor&, ColorMap, TerminatorFunc) [with IncidenceGraph = boost::adjacency_list >; DFSVisitor = boost::dfs_visitor >, boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>, void*, void*&>, boost::on_tree_edge>, time_stamper_with_vertex_vector > >, boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>, long unsigned int, long unsigned int&>, std::vector, long unsigned int, boost::on_discover_vertex> > >; ColorMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>, boost::default_color_type, boost::default_color_type&>; TerminatorFunc = nontruth2; typename boost::graph_traits::vertex_descriptor = void*]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/depth_first_search.hpp:417:35: required from ‘void boost::depth_first_visit(const IncidenceGraph&, typename graph_traits::vertex_descriptor, DFSVisitor, ColorMap) [with IncidenceGraph = adjacency_list >; DFSVisitor = dfs_visitor >, adj_list_vertex_property_map >, int, const int&, vertex_index_t>, void*, void*&>, on_tree_edge>, detail::time_stamper_with_vertex_vector > >, adj_list_vertex_property_map >, int, const int&, vertex_index_t>, long unsigned int, long unsigned int&>, std::vector, long unsigned int, on_discover_vertex> > >; ColorMap = iterator_property_map<__gnu_cxx::__normal_iterator >, adj_list_vertex_property_map >, int, const int&, vertex_index_t>, default_color_type, default_color_type&>; typename graph_traits::vertex_descriptor = void*]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/dominator_tree.hpp:309:22: required from ‘void boost::lengauer_tarjan_dominator_tree(const Graph&, const typename graph_traits::vertex_descriptor&, const IndexMap&, TimeMap, PredMap, VertexVector&, DomTreePredMap) [with Graph = adjacency_list >; IndexMap = adj_list_vertex_property_map >, int, const int&, vertex_index_t>; TimeMap = iterator_property_map<__gnu_cxx::__normal_iterator > >, adj_list_vertex_property_map >, int, const int&, vertex_index_t>, long unsigned int, long unsigned int&>; PredMap = iterator_property_map<__gnu_cxx::__normal_iterator >, adj_list_vertex_property_map >, int, const int&, vertex_index_t>, void*, void*&>; VertexVector = std::vector; DomTreePredMap = iterator_property_map<__gnu_cxx::__normal_iterator >, adj_list_vertex_property_map >, int, int&, vertex_index_t> >; typename graph_traits::vertex_descriptor = void*]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/dominator_tree.hpp:360:35: required from ‘void boost::lengauer_tarjan_dominator_tree(const Graph&, const typename graph_traits::vertex_descriptor&, DomTreePredMap) [with Graph = adjacency_list >; DomTreePredMap = iterator_property_map<__gnu_cxx::__normal_iterator >, adj_list_vertex_property_map >, int, int&, vertex_index_t> >; typename graph_traits::vertex_descriptor = void*]’ dominatorTree.cpp:46:36: required from here /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::Convertible::~Convertible() [with X = boost::lvalue_property_map_tag; Y = boost::read_write_property_map_tag]’ 37 | ~model() | ^ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:208:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 208 | BOOST_CONCEPT_USAGE(Convertible) { | ^~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::Assignable<__gnu_cxx::__normal_iterator >*, std::vector >, std::allocator > > > > >]’: /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements >*, std::vector >, std::allocator > > > > > >]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:145:5: required from ‘struct boost::Assignable<__gnu_cxx::__normal_iterator >*, std::vector >, std::allocator > > > > >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:502:3: required from ‘struct boost::InputIterator<__gnu_cxx::__normal_iterator >*, std::vector >, std::allocator > > > > >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:540:3: required from ‘struct boost::ForwardIterator<__gnu_cxx::__normal_iterator >*, std::vector >, std::allocator > > > > >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:568:3: required from ‘struct boost::BidirectionalIterator<__gnu_cxx::__normal_iterator >*, std::vector >, std::allocator > > > > >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:597:3: [ skipping 6 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.4-3.20/BH/include/boost/property_map/property_map.hpp:354:5: required from ‘boost::iterator_property_map >::value_type, typename std::iterator_traits< >::reference> boost::make_iterator_property_map(RAIter, ID) [with RAIter = __gnu_cxx::__normal_iterator >*, std::vector >, std::allocator > > > >; ID = adj_list_vertex_property_map >, int, const int&, vertex_index_t>; typename std::iterator_traits< >::value_type = std::deque >; typename std::iterator_traits< >::reference = std::deque >&]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/dominator_tree.hpp:91:48: required from ‘boost::detail::dominator_visitor::dominator_visitor(const Graph&, const Vertex&, const IndexMap&, DomTreePredMap) [with Graph = boost::adjacency_list >; IndexMap = boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>; TimeMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator > >, boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>, long unsigned int, long unsigned int&>; PredMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>, void*, void*&>; DomTreePredMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t> >; Vertex = void*]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/dominator_tree.hpp:254:9: required from ‘void boost::lengauer_tarjan_dominator_tree_without_dfs(const Graph&, const typename graph_traits::vertex_descriptor&, const IndexMap&, TimeMap, PredMap, VertexVector&, DomTreePredMap) [with Graph = adjacency_list >; IndexMap = adj_list_vertex_property_map >, int, const int&, vertex_index_t>; TimeMap = iterator_property_map<__gnu_cxx::__normal_iterator > >, adj_list_vertex_property_map >, int, const int&, vertex_index_t>, long unsigned int, long unsigned int&>; PredMap = iterator_property_map<__gnu_cxx::__normal_iterator >, adj_list_vertex_property_map >, int, const int&, vertex_index_t>, void*, void*&>; VertexVector = std::vector; DomTreePredMap = iterator_property_map<__gnu_cxx::__normal_iterator >, adj_list_vertex_property_map >, int, int&, vertex_index_t> >; typename graph_traits::vertex_descriptor = void*]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/dominator_tree.hpp:317:47: required from ‘void boost::lengauer_tarjan_dominator_tree(const Graph&, const typename graph_traits::vertex_descriptor&, const IndexMap&, TimeMap, PredMap, VertexVector&, DomTreePredMap) [with Graph = adjacency_list >; IndexMap = adj_list_vertex_property_map >, int, const int&, vertex_index_t>; TimeMap = iterator_property_map<__gnu_cxx::__normal_iterator > >, adj_list_vertex_property_map >, int, const int&, vertex_index_t>, long unsigned int, long unsigned int&>; PredMap = iterator_property_map<__gnu_cxx::__normal_iterator >, adj_list_vertex_property_map >, int, const int&, vertex_index_t>, void*, void*&>; VertexVector = std::vector; DomTreePredMap = iterator_property_map<__gnu_cxx::__normal_iterator >, adj_list_vertex_property_map >, int, int&, vertex_index_t> >; typename graph_traits::vertex_descriptor = void*]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/dominator_tree.hpp:360:35: required from ‘void boost::lengauer_tarjan_dominator_tree(const Graph&, const typename graph_traits::vertex_descriptor&, DomTreePredMap) [with Graph = adjacency_list >; DomTreePredMap = iterator_property_map<__gnu_cxx::__normal_iterator >, adj_list_vertex_property_map >, int, int&, vertex_index_t> >; typename graph_traits::vertex_descriptor = void*]’ dominatorTree.cpp:46:36: required from here /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::Assignable::~Assignable() [with TT = __gnu_cxx::__normal_iterator >*, std::vector >, std::allocator > > > >]’ 37 | ~model() | ^ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:145:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 145 | BOOST_CONCEPT_USAGE(Assignable) { | ^~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::EqualityComparable<__gnu_cxx::__normal_iterator >*, std::vector >, std::allocator > > > > >]’: /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements >*, std::vector >, std::allocator > > > > > >]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:233:5: required from ‘struct boost::EqualityComparable<__gnu_cxx::__normal_iterator >*, std::vector >, std::allocator > > > > >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:502:3: required from ‘struct boost::InputIterator<__gnu_cxx::__normal_iterator >*, std::vector >, std::allocator > > > > >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:540:3: required from ‘struct boost::ForwardIterator<__gnu_cxx::__normal_iterator >*, std::vector >, std::allocator > > > > >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:568:3: required from ‘struct boost::BidirectionalIterator<__gnu_cxx::__normal_iterator >*, std::vector >, std::allocator > > > > >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:597:3: [ skipping 6 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.4-3.20/BH/include/boost/property_map/property_map.hpp:354:5: required from ‘boost::iterator_property_map >::value_type, typename std::iterator_traits< >::reference> boost::make_iterator_property_map(RAIter, ID) [with RAIter = __gnu_cxx::__normal_iterator >*, std::vector >, std::allocator > > > >; ID = adj_list_vertex_property_map >, int, const int&, vertex_index_t>; typename std::iterator_traits< >::value_type = std::deque >; typename std::iterator_traits< >::reference = std::deque >&]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/dominator_tree.hpp:91:48: required from ‘boost::detail::dominator_visitor::dominator_visitor(const Graph&, const Vertex&, const IndexMap&, DomTreePredMap) [with Graph = boost::adjacency_list >; IndexMap = boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>; TimeMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator > >, boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>, long unsigned int, long unsigned int&>; PredMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>, void*, void*&>; DomTreePredMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t> >; Vertex = void*]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/dominator_tree.hpp:254:9: required from ‘void boost::lengauer_tarjan_dominator_tree_without_dfs(const Graph&, const typename graph_traits::vertex_descriptor&, const IndexMap&, TimeMap, PredMap, VertexVector&, DomTreePredMap) [with Graph = adjacency_list >; IndexMap = adj_list_vertex_property_map >, int, const int&, vertex_index_t>; TimeMap = iterator_property_map<__gnu_cxx::__normal_iterator > >, adj_list_vertex_property_map >, int, const int&, vertex_index_t>, long unsigned int, long unsigned int&>; PredMap = iterator_property_map<__gnu_cxx::__normal_iterator >, adj_list_vertex_property_map >, int, const int&, vertex_index_t>, void*, void*&>; VertexVector = std::vector; DomTreePredMap = iterator_property_map<__gnu_cxx::__normal_iterator >, adj_list_vertex_property_map >, int, int&, vertex_index_t> >; typename graph_traits::vertex_descriptor = void*]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/dominator_tree.hpp:317:47: required from ‘void boost::lengauer_tarjan_dominator_tree(const Graph&, const typename graph_traits::vertex_descriptor&, const IndexMap&, TimeMap, PredMap, VertexVector&, DomTreePredMap) [with Graph = adjacency_list >; IndexMap = adj_list_vertex_property_map >, int, const int&, vertex_index_t>; TimeMap = iterator_property_map<__gnu_cxx::__normal_iterator > >, adj_list_vertex_property_map >, int, const int&, vertex_index_t>, long unsigned int, long unsigned int&>; PredMap = iterator_property_map<__gnu_cxx::__normal_iterator >, adj_list_vertex_property_map >, int, const int&, vertex_index_t>, void*, void*&>; VertexVector = std::vector; DomTreePredMap = iterator_property_map<__gnu_cxx::__normal_iterator >, adj_list_vertex_property_map >, int, int&, vertex_index_t> >; typename graph_traits::vertex_descriptor = void*]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/dominator_tree.hpp:360:35: required from ‘void boost::lengauer_tarjan_dominator_tree(const Graph&, const typename graph_traits::vertex_descriptor&, DomTreePredMap) [with Graph = adjacency_list >; DomTreePredMap = iterator_property_map<__gnu_cxx::__normal_iterator >, adj_list_vertex_property_map >, int, int&, vertex_index_t> >; typename graph_traits::vertex_descriptor = void*]’ dominatorTree.cpp:46:36: required from here /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::EqualityComparable::~EqualityComparable() [with TT = __gnu_cxx::__normal_iterator >*, std::vector >, std::allocator > > > >]’ 37 | ~model() | ^ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:233:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 233 | BOOST_CONCEPT_USAGE(EqualityComparable) { | ^~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::InputIterator<__gnu_cxx::__normal_iterator >*, std::vector >, std::allocator > > > > >]’: /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements >*, std::vector >, std::allocator > > > > > >]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:512:7: required from ‘struct boost::InputIterator<__gnu_cxx::__normal_iterator >*, std::vector >, std::allocator > > > > >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:540:3: required from ‘struct boost::ForwardIterator<__gnu_cxx::__normal_iterator >*, std::vector >, std::allocator > > > > >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:568:3: required from ‘struct boost::BidirectionalIterator<__gnu_cxx::__normal_iterator >*, std::vector >, std::allocator > > > > >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:597:3: required from ‘struct boost::RandomAccessIterator<__gnu_cxx::__normal_iterator >*, std::vector >, std::allocator > > > > >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:597:3: [ skipping 5 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.4-3.20/BH/include/boost/property_map/property_map.hpp:354:5: required from ‘boost::iterator_property_map >::value_type, typename std::iterator_traits< >::reference> boost::make_iterator_property_map(RAIter, ID) [with RAIter = __gnu_cxx::__normal_iterator >*, std::vector >, std::allocator > > > >; ID = adj_list_vertex_property_map >, int, const int&, vertex_index_t>; typename std::iterator_traits< >::value_type = std::deque >; typename std::iterator_traits< >::reference = std::deque >&]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/dominator_tree.hpp:91:48: required from ‘boost::detail::dominator_visitor::dominator_visitor(const Graph&, const Vertex&, const IndexMap&, DomTreePredMap) [with Graph = boost::adjacency_list >; IndexMap = boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>; TimeMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator > >, boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>, long unsigned int, long unsigned int&>; PredMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>, void*, void*&>; DomTreePredMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t> >; Vertex = void*]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/dominator_tree.hpp:254:9: required from ‘void boost::lengauer_tarjan_dominator_tree_without_dfs(const Graph&, const typename graph_traits::vertex_descriptor&, const IndexMap&, TimeMap, PredMap, VertexVector&, DomTreePredMap) [with Graph = adjacency_list >; IndexMap = adj_list_vertex_property_map >, int, const int&, vertex_index_t>; TimeMap = iterator_property_map<__gnu_cxx::__normal_iterator > >, adj_list_vertex_property_map >, int, const int&, vertex_index_t>, long unsigned int, long unsigned int&>; PredMap = iterator_property_map<__gnu_cxx::__normal_iterator >, adj_list_vertex_property_map >, int, const int&, vertex_index_t>, void*, void*&>; VertexVector = std::vector; DomTreePredMap = iterator_property_map<__gnu_cxx::__normal_iterator >, adj_list_vertex_property_map >, int, int&, vertex_index_t> >; typename graph_traits::vertex_descriptor = void*]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/dominator_tree.hpp:317:47: required from ‘void boost::lengauer_tarjan_dominator_tree(const Graph&, const typename graph_traits::vertex_descriptor&, const IndexMap&, TimeMap, PredMap, VertexVector&, DomTreePredMap) [with Graph = adjacency_list >; IndexMap = adj_list_vertex_property_map >, int, const int&, vertex_index_t>; TimeMap = iterator_property_map<__gnu_cxx::__normal_iterator > >, adj_list_vertex_property_map >, int, const int&, vertex_index_t>, long unsigned int, long unsigned int&>; PredMap = iterator_property_map<__gnu_cxx::__normal_iterator >, adj_list_vertex_property_map >, int, const int&, vertex_index_t>, void*, void*&>; VertexVector = std::vector; DomTreePredMap = iterator_property_map<__gnu_cxx::__normal_iterator >, adj_list_vertex_property_map >, int, int&, vertex_index_t> >; typename graph_traits::vertex_descriptor = void*]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/dominator_tree.hpp:360:35: required from ‘void boost::lengauer_tarjan_dominator_tree(const Graph&, const typename graph_traits::vertex_descriptor&, DomTreePredMap) [with Graph = adjacency_list >; DomTreePredMap = iterator_property_map<__gnu_cxx::__normal_iterator >, adj_list_vertex_property_map >, int, int&, vertex_index_t> >; typename graph_traits::vertex_descriptor = void*]’ dominatorTree.cpp:46:36: required from here /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::InputIterator::~InputIterator() [with TT = __gnu_cxx::__normal_iterator >*, std::vector >, std::allocator > > > >]’ 37 | ~model() | ^ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:512:7: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 512 | BOOST_CONCEPT_USAGE(InputIterator) | ^~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::ForwardIterator<__gnu_cxx::__normal_iterator >*, std::vector >, std::allocator > > > > >]’: /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements >*, std::vector >, std::allocator > > > > > >]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:543:7: required from ‘struct boost::ForwardIterator<__gnu_cxx::__normal_iterator >*, std::vector >, std::allocator > > > > >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:568:3: required from ‘struct boost::BidirectionalIterator<__gnu_cxx::__normal_iterator >*, std::vector >, std::allocator > > > > >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:597:3: required from ‘struct boost::RandomAccessIterator<__gnu_cxx::__normal_iterator >*, std::vector >, std::allocator > > > > >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:597:3: required from ‘struct boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator >*, std::vector >, std::allocator > > > > >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:32:62: [ skipping 4 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.4-3.20/BH/include/boost/property_map/property_map.hpp:354:5: required from ‘boost::iterator_property_map >::value_type, typename std::iterator_traits< >::reference> boost::make_iterator_property_map(RAIter, ID) [with RAIter = __gnu_cxx::__normal_iterator >*, std::vector >, std::allocator > > > >; ID = adj_list_vertex_property_map >, int, const int&, vertex_index_t>; typename std::iterator_traits< >::value_type = std::deque >; typename std::iterator_traits< >::reference = std::deque >&]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/dominator_tree.hpp:91:48: required from ‘boost::detail::dominator_visitor::dominator_visitor(const Graph&, const Vertex&, const IndexMap&, DomTreePredMap) [with Graph = boost::adjacency_list >; IndexMap = boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>; TimeMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator > >, boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>, long unsigned int, long unsigned int&>; PredMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>, void*, void*&>; DomTreePredMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t> >; Vertex = void*]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/dominator_tree.hpp:254:9: required from ‘void boost::lengauer_tarjan_dominator_tree_without_dfs(const Graph&, const typename graph_traits::vertex_descriptor&, const IndexMap&, TimeMap, PredMap, VertexVector&, DomTreePredMap) [with Graph = adjacency_list >; IndexMap = adj_list_vertex_property_map >, int, const int&, vertex_index_t>; TimeMap = iterator_property_map<__gnu_cxx::__normal_iterator > >, adj_list_vertex_property_map >, int, const int&, vertex_index_t>, long unsigned int, long unsigned int&>; PredMap = iterator_property_map<__gnu_cxx::__normal_iterator >, adj_list_vertex_property_map >, int, const int&, vertex_index_t>, void*, void*&>; VertexVector = std::vector; DomTreePredMap = iterator_property_map<__gnu_cxx::__normal_iterator >, adj_list_vertex_property_map >, int, int&, vertex_index_t> >; typename graph_traits::vertex_descriptor = void*]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/dominator_tree.hpp:317:47: required from ‘void boost::lengauer_tarjan_dominator_tree(const Graph&, const typename graph_traits::vertex_descriptor&, const IndexMap&, TimeMap, PredMap, VertexVector&, DomTreePredMap) [with Graph = adjacency_list >; IndexMap = adj_list_vertex_property_map >, int, const int&, vertex_index_t>; TimeMap = iterator_property_map<__gnu_cxx::__normal_iterator > >, adj_list_vertex_property_map >, int, const int&, vertex_index_t>, long unsigned int, long unsigned int&>; PredMap = iterator_property_map<__gnu_cxx::__normal_iterator >, adj_list_vertex_property_map >, int, const int&, vertex_index_t>, void*, void*&>; VertexVector = std::vector; DomTreePredMap = iterator_property_map<__gnu_cxx::__normal_iterator >, adj_list_vertex_property_map >, int, int&, vertex_index_t> >; typename graph_traits::vertex_descriptor = void*]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/dominator_tree.hpp:360:35: required from ‘void boost::lengauer_tarjan_dominator_tree(const Graph&, const typename graph_traits::vertex_descriptor&, DomTreePredMap) [with Graph = adjacency_list >; DomTreePredMap = iterator_property_map<__gnu_cxx::__normal_iterator >, adj_list_vertex_property_map >, int, int&, vertex_index_t> >; typename graph_traits::vertex_descriptor = void*]’ dominatorTree.cpp:46:36: required from here /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::ForwardIterator::~ForwardIterator() [with TT = __gnu_cxx::__normal_iterator >*, std::vector >, std::allocator > > > >]’ 37 | ~model() | ^ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:543:7: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 543 | BOOST_CONCEPT_USAGE(ForwardIterator) | ^~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::BidirectionalIterator<__gnu_cxx::__normal_iterator >*, std::vector >, std::allocator > > > > >]’: /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements >*, std::vector >, std::allocator > > > > > >]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:571:7: required from ‘struct boost::BidirectionalIterator<__gnu_cxx::__normal_iterator >*, std::vector >, std::allocator > > > > >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:597:3: required from ‘struct boost::RandomAccessIterator<__gnu_cxx::__normal_iterator >*, std::vector >, std::allocator > > > > >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:597:3: required from ‘struct boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator >*, std::vector >, std::allocator > > > > >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator >*, std::vector >, std::allocator > > > > >]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:42:5: [ skipping 3 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.4-3.20/BH/include/boost/property_map/property_map.hpp:354:5: required from ‘boost::iterator_property_map >::value_type, typename std::iterator_traits< >::reference> boost::make_iterator_property_map(RAIter, ID) [with RAIter = __gnu_cxx::__normal_iterator >*, std::vector >, std::allocator > > > >; ID = adj_list_vertex_property_map >, int, const int&, vertex_index_t>; typename std::iterator_traits< >::value_type = std::deque >; typename std::iterator_traits< >::reference = std::deque >&]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/dominator_tree.hpp:91:48: required from ‘boost::detail::dominator_visitor::dominator_visitor(const Graph&, const Vertex&, const IndexMap&, DomTreePredMap) [with Graph = boost::adjacency_list >; IndexMap = boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>; TimeMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator > >, boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>, long unsigned int, long unsigned int&>; PredMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>, void*, void*&>; DomTreePredMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t> >; Vertex = void*]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/dominator_tree.hpp:254:9: required from ‘void boost::lengauer_tarjan_dominator_tree_without_dfs(const Graph&, const typename graph_traits::vertex_descriptor&, const IndexMap&, TimeMap, PredMap, VertexVector&, DomTreePredMap) [with Graph = adjacency_list >; IndexMap = adj_list_vertex_property_map >, int, const int&, vertex_index_t>; TimeMap = iterator_property_map<__gnu_cxx::__normal_iterator > >, adj_list_vertex_property_map >, int, const int&, vertex_index_t>, long unsigned int, long unsigned int&>; PredMap = iterator_property_map<__gnu_cxx::__normal_iterator >, adj_list_vertex_property_map >, int, const int&, vertex_index_t>, void*, void*&>; VertexVector = std::vector; DomTreePredMap = iterator_property_map<__gnu_cxx::__normal_iterator >, adj_list_vertex_property_map >, int, int&, vertex_index_t> >; typename graph_traits::vertex_descriptor = void*]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/dominator_tree.hpp:317:47: required from ‘void boost::lengauer_tarjan_dominator_tree(const Graph&, const typename graph_traits::vertex_descriptor&, const IndexMap&, TimeMap, PredMap, VertexVector&, DomTreePredMap) [with Graph = adjacency_list >; IndexMap = adj_list_vertex_property_map >, int, const int&, vertex_index_t>; TimeMap = iterator_property_map<__gnu_cxx::__normal_iterator > >, adj_list_vertex_property_map >, int, const int&, vertex_index_t>, long unsigned int, long unsigned int&>; PredMap = iterator_property_map<__gnu_cxx::__normal_iterator >, adj_list_vertex_property_map >, int, const int&, vertex_index_t>, void*, void*&>; VertexVector = std::vector; DomTreePredMap = iterator_property_map<__gnu_cxx::__normal_iterator >, adj_list_vertex_property_map >, int, int&, vertex_index_t> >; typename graph_traits::vertex_descriptor = void*]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/dominator_tree.hpp:360:35: required from ‘void boost::lengauer_tarjan_dominator_tree(const Graph&, const typename graph_traits::vertex_descriptor&, DomTreePredMap) [with Graph = adjacency_list >; DomTreePredMap = iterator_property_map<__gnu_cxx::__normal_iterator >, adj_list_vertex_property_map >, int, int&, vertex_index_t> >; typename graph_traits::vertex_descriptor = void*]’ dominatorTree.cpp:46:36: required from here /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::BidirectionalIterator::~BidirectionalIterator() [with TT = __gnu_cxx::__normal_iterator >*, std::vector >, std::allocator > > > >]’ 37 | ~model() | ^ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:571:7: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 571 | BOOST_CONCEPT_USAGE(BidirectionalIterator) | ^~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::Comparable<__gnu_cxx::__normal_iterator >*, std::vector >, std::allocator > > > > >]’: /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements >*, std::vector >, std::allocator > > > > > >]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:253:5: required from ‘struct boost::Comparable<__gnu_cxx::__normal_iterator >*, std::vector >, std::allocator > > > > >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:597:3: required from ‘struct boost::RandomAccessIterator<__gnu_cxx::__normal_iterator >*, std::vector >, std::allocator > > > > >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:597:3: required from ‘struct boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator >*, std::vector >, std::allocator > > > > >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator >*, std::vector >, std::allocator > > > > >]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:42:5: [ skipping 3 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.4-3.20/BH/include/boost/property_map/property_map.hpp:354:5: required from ‘boost::iterator_property_map >::value_type, typename std::iterator_traits< >::reference> boost::make_iterator_property_map(RAIter, ID) [with RAIter = __gnu_cxx::__normal_iterator >*, std::vector >, std::allocator > > > >; ID = adj_list_vertex_property_map >, int, const int&, vertex_index_t>; typename std::iterator_traits< >::value_type = std::deque >; typename std::iterator_traits< >::reference = std::deque >&]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/dominator_tree.hpp:91:48: required from ‘boost::detail::dominator_visitor::dominator_visitor(const Graph&, const Vertex&, const IndexMap&, DomTreePredMap) [with Graph = boost::adjacency_list >; IndexMap = boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>; TimeMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator > >, boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>, long unsigned int, long unsigned int&>; PredMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>, void*, void*&>; DomTreePredMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t> >; Vertex = void*]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/dominator_tree.hpp:254:9: required from ‘void boost::lengauer_tarjan_dominator_tree_without_dfs(const Graph&, const typename graph_traits::vertex_descriptor&, const IndexMap&, TimeMap, PredMap, VertexVector&, DomTreePredMap) [with Graph = adjacency_list >; IndexMap = adj_list_vertex_property_map >, int, const int&, vertex_index_t>; TimeMap = iterator_property_map<__gnu_cxx::__normal_iterator > >, adj_list_vertex_property_map >, int, const int&, vertex_index_t>, long unsigned int, long unsigned int&>; PredMap = iterator_property_map<__gnu_cxx::__normal_iterator >, adj_list_vertex_property_map >, int, const int&, vertex_index_t>, void*, void*&>; VertexVector = std::vector; DomTreePredMap = iterator_property_map<__gnu_cxx::__normal_iterator >, adj_list_vertex_property_map >, int, int&, vertex_index_t> >; typename graph_traits::vertex_descriptor = void*]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/dominator_tree.hpp:317:47: required from ‘void boost::lengauer_tarjan_dominator_tree(const Graph&, const typename graph_traits::vertex_descriptor&, const IndexMap&, TimeMap, PredMap, VertexVector&, DomTreePredMap) [with Graph = adjacency_list >; IndexMap = adj_list_vertex_property_map >, int, const int&, vertex_index_t>; TimeMap = iterator_property_map<__gnu_cxx::__normal_iterator > >, adj_list_vertex_property_map >, int, const int&, vertex_index_t>, long unsigned int, long unsigned int&>; PredMap = iterator_property_map<__gnu_cxx::__normal_iterator >, adj_list_vertex_property_map >, int, const int&, vertex_index_t>, void*, void*&>; VertexVector = std::vector; DomTreePredMap = iterator_property_map<__gnu_cxx::__normal_iterator >, adj_list_vertex_property_map >, int, int&, vertex_index_t> >; typename graph_traits::vertex_descriptor = void*]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/dominator_tree.hpp:360:35: required from ‘void boost::lengauer_tarjan_dominator_tree(const Graph&, const typename graph_traits::vertex_descriptor&, DomTreePredMap) [with Graph = adjacency_list >; DomTreePredMap = iterator_property_map<__gnu_cxx::__normal_iterator >, adj_list_vertex_property_map >, int, int&, vertex_index_t> >; typename graph_traits::vertex_descriptor = void*]’ dominatorTree.cpp:46:36: required from here /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::Comparable::~Comparable() [with TT = __gnu_cxx::__normal_iterator >*, std::vector >, std::allocator > > > >]’ 37 | ~model() | ^ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:253:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 253 | BOOST_CONCEPT_USAGE(Comparable) { | ^~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::RandomAccessIterator<__gnu_cxx::__normal_iterator >*, std::vector >, std::allocator > > > > >]’: /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements >*, std::vector >, std::allocator > > > > > >]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:601:7: required from ‘struct boost::RandomAccessIterator<__gnu_cxx::__normal_iterator >*, std::vector >, std::allocator > > > > >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:597:3: required from ‘struct boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator >*, std::vector >, std::allocator > > > > >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator >*, std::vector >, std::allocator > > > > >]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied >*, std::vector >, std::allocator > > > > > >::value’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:45:51: [ skipping 2 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.4-3.20/BH/include/boost/property_map/property_map.hpp:354:5: required from ‘boost::iterator_property_map >::value_type, typename std::iterator_traits< >::reference> boost::make_iterator_property_map(RAIter, ID) [with RAIter = __gnu_cxx::__normal_iterator >*, std::vector >, std::allocator > > > >; ID = adj_list_vertex_property_map >, int, const int&, vertex_index_t>; typename std::iterator_traits< >::value_type = std::deque >; typename std::iterator_traits< >::reference = std::deque >&]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/dominator_tree.hpp:91:48: required from ‘boost::detail::dominator_visitor::dominator_visitor(const Graph&, const Vertex&, const IndexMap&, DomTreePredMap) [with Graph = boost::adjacency_list >; IndexMap = boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>; TimeMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator > >, boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>, long unsigned int, long unsigned int&>; PredMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>, void*, void*&>; DomTreePredMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t> >; Vertex = void*]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/dominator_tree.hpp:254:9: required from ‘void boost::lengauer_tarjan_dominator_tree_without_dfs(const Graph&, const typename graph_traits::vertex_descriptor&, const IndexMap&, TimeMap, PredMap, VertexVector&, DomTreePredMap) [with Graph = adjacency_list >; IndexMap = adj_list_vertex_property_map >, int, const int&, vertex_index_t>; TimeMap = iterator_property_map<__gnu_cxx::__normal_iterator > >, adj_list_vertex_property_map >, int, const int&, vertex_index_t>, long unsigned int, long unsigned int&>; PredMap = iterator_property_map<__gnu_cxx::__normal_iterator >, adj_list_vertex_property_map >, int, const int&, vertex_index_t>, void*, void*&>; VertexVector = std::vector; DomTreePredMap = iterator_property_map<__gnu_cxx::__normal_iterator >, adj_list_vertex_property_map >, int, int&, vertex_index_t> >; typename graph_traits::vertex_descriptor = void*]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/dominator_tree.hpp:317:47: required from ‘void boost::lengauer_tarjan_dominator_tree(const Graph&, const typename graph_traits::vertex_descriptor&, const IndexMap&, TimeMap, PredMap, VertexVector&, DomTreePredMap) [with Graph = adjacency_list >; IndexMap = adj_list_vertex_property_map >, int, const int&, vertex_index_t>; TimeMap = iterator_property_map<__gnu_cxx::__normal_iterator > >, adj_list_vertex_property_map >, int, const int&, vertex_index_t>, long unsigned int, long unsigned int&>; PredMap = iterator_property_map<__gnu_cxx::__normal_iterator >, adj_list_vertex_property_map >, int, const int&, vertex_index_t>, void*, void*&>; VertexVector = std::vector; DomTreePredMap = iterator_property_map<__gnu_cxx::__normal_iterator >, adj_list_vertex_property_map >, int, int&, vertex_index_t> >; typename graph_traits::vertex_descriptor = void*]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/dominator_tree.hpp:360:35: required from ‘void boost::lengauer_tarjan_dominator_tree(const Graph&, const typename graph_traits::vertex_descriptor&, DomTreePredMap) [with Graph = adjacency_list >; DomTreePredMap = iterator_property_map<__gnu_cxx::__normal_iterator >, adj_list_vertex_property_map >, int, int&, vertex_index_t> >; typename graph_traits::vertex_descriptor = void*]’ dominatorTree.cpp:46:36: required from here /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::RandomAccessIterator::~RandomAccessIterator() [with TT = __gnu_cxx::__normal_iterator >*, std::vector >, std::allocator > > > >]’ 37 | ~model() | ^ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:601:7: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 601 | BOOST_CONCEPT_USAGE(RandomAccessIterator) | ^~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements >, boost::no_property>*, std::vector >, boost::no_property>, std::allocator >, boost::no_property> > > >, void*, boost::detail::edge_desc_impl, long int> > >]’: /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:145:5: required from ‘struct boost::Assignable >, boost::no_property>*, std::vector >, boost::no_property>, std::allocator >, boost::no_property> > > >, void*, boost::detail::edge_desc_impl, long int> >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:502:3: required from ‘struct boost::InputIterator >, boost::no_property>*, std::vector >, boost::no_property>, std::allocator >, boost::no_property> > > >, void*, boost::detail::edge_desc_impl, long int> >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::InputIterator >, boost::no_property>*, std::vector >, boost::no_property>, std::allocator >, boost::no_property> > > >, void*, boost::detail::edge_desc_impl, long int> >]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied >, boost::no_property>*, std::vector >, boost::no_property>, std::allocator >, boost::no_property> > > >, void*, boost::detail::edge_desc_impl, long int> > >::value’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied >, boost::no_property>*, std::vector >, boost::no_property>, std::allocator >, boost::no_property> > > >, void*, boost::detail::edge_desc_impl, long int> > >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:72:8: [ skipping 10 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied > > >::value’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied > > >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_ > >)>’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/dominator_tree.hpp:245:5: required from ‘void boost::lengauer_tarjan_dominator_tree(const Graph&, const typename graph_traits::vertex_descriptor&, const IndexMap&, TimeMap, PredMap, VertexVector&, DomTreePredMap) [with Graph = adjacency_list >; IndexMap = adj_list_vertex_property_map >, int, const int&, vertex_index_t>; TimeMap = iterator_property_map<__gnu_cxx::__normal_iterator > >, adj_list_vertex_property_map >, int, const int&, vertex_index_t>, long unsigned int, long unsigned int&>; PredMap = iterator_property_map<__gnu_cxx::__normal_iterator >, adj_list_vertex_property_map >, int, const int&, vertex_index_t>, void*, void*&>; VertexVector = std::vector; DomTreePredMap = iterator_property_map<__gnu_cxx::__normal_iterator >, adj_list_vertex_property_map >, int, int&, vertex_index_t> >; typename graph_traits::vertex_descriptor = void*]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/dominator_tree.hpp:360:35: required from ‘void boost::lengauer_tarjan_dominator_tree(const Graph&, const typename graph_traits::vertex_descriptor&, DomTreePredMap) [with Graph = adjacency_list >; DomTreePredMap = iterator_property_map<__gnu_cxx::__normal_iterator >, adj_list_vertex_property_map >, int, int&, vertex_index_t> >; typename graph_traits::vertex_descriptor = void*]’ dominatorTree.cpp:46:36: required from here /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::Assignable >, boost::no_property>*, std::vector >, boost::no_property>, std::allocator >, boost::no_property> > > >, void*, boost::detail::edge_desc_impl, long int> >]’ 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ^ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements >, boost::no_property>*, std::vector >, boost::no_property>, std::allocator >, boost::no_property> > > >, void*, boost::detail::edge_desc_impl, long int> > >]’: /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:233:5: required from ‘struct boost::EqualityComparable >, boost::no_property>*, std::vector >, boost::no_property>, std::allocator >, boost::no_property> > > >, void*, boost::detail::edge_desc_impl, long int> >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:502:3: required from ‘struct boost::InputIterator >, boost::no_property>*, std::vector >, boost::no_property>, std::allocator >, boost::no_property> > > >, void*, boost::detail::edge_desc_impl, long int> >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::InputIterator >, boost::no_property>*, std::vector >, boost::no_property>, std::allocator >, boost::no_property> > > >, void*, boost::detail::edge_desc_impl, long int> >]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied >, boost::no_property>*, std::vector >, boost::no_property>, std::allocator >, boost::no_property> > > >, void*, boost::detail::edge_desc_impl, long int> > >::value’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied >, boost::no_property>*, std::vector >, boost::no_property>, std::allocator >, boost::no_property> > > >, void*, boost::detail::edge_desc_impl, long int> > >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:72:8: [ skipping 10 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied > > >::value’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied > > >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_ > >)>’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/dominator_tree.hpp:245:5: required from ‘void boost::lengauer_tarjan_dominator_tree(const Graph&, const typename graph_traits::vertex_descriptor&, const IndexMap&, TimeMap, PredMap, VertexVector&, DomTreePredMap) [with Graph = adjacency_list >; IndexMap = adj_list_vertex_property_map >, int, const int&, vertex_index_t>; TimeMap = iterator_property_map<__gnu_cxx::__normal_iterator > >, adj_list_vertex_property_map >, int, const int&, vertex_index_t>, long unsigned int, long unsigned int&>; PredMap = iterator_property_map<__gnu_cxx::__normal_iterator >, adj_list_vertex_property_map >, int, const int&, vertex_index_t>, void*, void*&>; VertexVector = std::vector; DomTreePredMap = iterator_property_map<__gnu_cxx::__normal_iterator >, adj_list_vertex_property_map >, int, int&, vertex_index_t> >; typename graph_traits::vertex_descriptor = void*]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/dominator_tree.hpp:360:35: required from ‘void boost::lengauer_tarjan_dominator_tree(const Graph&, const typename graph_traits::vertex_descriptor&, DomTreePredMap) [with Graph = adjacency_list >; DomTreePredMap = iterator_property_map<__gnu_cxx::__normal_iterator >, adj_list_vertex_property_map >, int, int&, vertex_index_t> >; typename graph_traits::vertex_descriptor = void*]’ dominatorTree.cpp:46:36: required from here /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::EqualityComparable >, boost::no_property>*, std::vector >, boost::no_property>, std::allocator >, boost::no_property> > > >, void*, boost::detail::edge_desc_impl, long int> >]’ 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ^ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements >, boost::no_property>*, std::vector >, boost::no_property>, std::allocator >, boost::no_property> > > >, void*, boost::detail::edge_desc_impl, long int> > >]’: /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:512:7: required from ‘struct boost::InputIterator >, boost::no_property>*, std::vector >, boost::no_property>, std::allocator >, boost::no_property> > > >, void*, boost::detail::edge_desc_impl, long int> >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::InputIterator >, boost::no_property>*, std::vector >, boost::no_property>, std::allocator >, boost::no_property> > > >, void*, boost::detail::edge_desc_impl, long int> >]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied >, boost::no_property>*, std::vector >, boost::no_property>, std::allocator >, boost::no_property> > > >, void*, boost::detail::edge_desc_impl, long int> > >::value’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied >, boost::no_property>*, std::vector >, boost::no_property>, std::allocator >, boost::no_property> > > >, void*, boost::detail::edge_desc_impl, long int> > >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_ >, boost::no_property>*, std::vector >, boost::no_property>, std::allocator >, boost::no_property> > > >, void*, boost::detail::edge_desc_impl, long int> >)>’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/graph_concepts.hpp:53:35: [ skipping 9 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied > > >::value’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied > > >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_ > >)>’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/dominator_tree.hpp:245:5: required from ‘void boost::lengauer_tarjan_dominator_tree(const Graph&, const typename graph_traits::vertex_descriptor&, const IndexMap&, TimeMap, PredMap, VertexVector&, DomTreePredMap) [with Graph = adjacency_list >; IndexMap = adj_list_vertex_property_map >, int, const int&, vertex_index_t>; TimeMap = iterator_property_map<__gnu_cxx::__normal_iterator > >, adj_list_vertex_property_map >, int, const int&, vertex_index_t>, long unsigned int, long unsigned int&>; PredMap = iterator_property_map<__gnu_cxx::__normal_iterator >, adj_list_vertex_property_map >, int, const int&, vertex_index_t>, void*, void*&>; VertexVector = std::vector; DomTreePredMap = iterator_property_map<__gnu_cxx::__normal_iterator >, adj_list_vertex_property_map >, int, int&, vertex_index_t> >; typename graph_traits::vertex_descriptor = void*]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/dominator_tree.hpp:360:35: required from ‘void boost::lengauer_tarjan_dominator_tree(const Graph&, const typename graph_traits::vertex_descriptor&, DomTreePredMap) [with Graph = adjacency_list >; DomTreePredMap = iterator_property_map<__gnu_cxx::__normal_iterator >, adj_list_vertex_property_map >, int, int&, vertex_index_t> >; typename graph_traits::vertex_descriptor = void*]’ dominatorTree.cpp:46:36: required from here /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::InputIterator >, boost::no_property>*, std::vector >, boost::no_property>, std::allocator >, boost::no_property> > > >, void*, boost::detail::edge_desc_impl, long int> >]’ 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ^ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::InputIterator >, boost::no_property>*, std::vector >, boost::no_property>, std::allocator >, boost::no_property> > > >, void*, boost::detail::edge_desc_impl, long int> >]’: /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/graph_concepts.hpp:53:35: required from ‘boost::concepts::MultiPassInputIterator::~MultiPassInputIterator() [with T = boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator >, boost::no_property>*, std::vector >, boost::no_property>, std::allocator >, boost::no_property> > > >, void*, boost::detail::edge_desc_impl, long int>]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::MultiPassInputIterator >, boost::no_property>*, std::vector >, boost::no_property>, std::allocator >, boost::no_property> > > >, void*, boost::detail::edge_desc_impl, long int> >]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/graph_concepts.hpp:89:9: required from ‘boost::concepts::IncidenceGraph::~IncidenceGraph() [with G = boost::adjacency_list >]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/usage.hpp:20:48: required from ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::concepts::IncidenceGraph > >]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements > > >]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/graph_concepts.hpp:87:5: [ skipping 4 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied > > >::value’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied > > >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_ > >)>’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/dominator_tree.hpp:245:5: required from ‘void boost::lengauer_tarjan_dominator_tree(const Graph&, const typename graph_traits::vertex_descriptor&, const IndexMap&, TimeMap, PredMap, VertexVector&, DomTreePredMap) [with Graph = adjacency_list >; IndexMap = adj_list_vertex_property_map >, int, const int&, vertex_index_t>; TimeMap = iterator_property_map<__gnu_cxx::__normal_iterator > >, adj_list_vertex_property_map >, int, const int&, vertex_index_t>, long unsigned int, long unsigned int&>; PredMap = iterator_property_map<__gnu_cxx::__normal_iterator >, adj_list_vertex_property_map >, int, const int&, vertex_index_t>, void*, void*&>; VertexVector = std::vector; DomTreePredMap = iterator_property_map<__gnu_cxx::__normal_iterator >, adj_list_vertex_property_map >, int, int&, vertex_index_t> >; typename graph_traits::vertex_descriptor = void*]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/dominator_tree.hpp:360:35: required from ‘void boost::lengauer_tarjan_dominator_tree(const Graph&, const typename graph_traits::vertex_descriptor&, DomTreePredMap) [with Graph = adjacency_list >; DomTreePredMap = iterator_property_map<__gnu_cxx::__normal_iterator >, adj_list_vertex_property_map >, int, int&, vertex_index_t> >; typename graph_traits::vertex_descriptor = void*]’ dominatorTree.cpp:46:36: required from here /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::InputIterator::~InputIterator() [with TT = boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator >, boost::no_property>*, std::vector >, boost::no_property>, std::allocator >, boost::no_property> > > >, void*, boost::detail::edge_desc_impl, long int>]’ 37 | ~model() | ^ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:512:7: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 512 | BOOST_CONCEPT_USAGE(InputIterator) | ^~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::Assignable >, boost::no_property>*, std::vector >, boost::no_property>, std::allocator >, boost::no_property> > > >, void*, boost::detail::edge_desc_impl, long int> >]’: /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements >, boost::no_property>*, std::vector >, boost::no_property>, std::allocator >, boost::no_property> > > >, void*, boost::detail::edge_desc_impl, long int> > >]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:145:5: required from ‘struct boost::Assignable >, boost::no_property>*, std::vector >, boost::no_property>, std::allocator >, boost::no_property> > > >, void*, boost::detail::edge_desc_impl, long int> >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:502:3: required from ‘struct boost::InputIterator >, boost::no_property>*, std::vector >, boost::no_property>, std::allocator >, boost::no_property> > > >, void*, boost::detail::edge_desc_impl, long int> >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::InputIterator >, boost::no_property>*, std::vector >, boost::no_property>, std::allocator >, boost::no_property> > > >, void*, boost::detail::edge_desc_impl, long int> >]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied >, boost::no_property>*, std::vector >, boost::no_property>, std::allocator >, boost::no_property> > > >, void*, boost::detail::edge_desc_impl, long int> > >::value’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:45:51: [ skipping 3 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::MultiPassInputIterator >, boost::no_property>*, std::vector >, boost::no_property>, std::allocator >, boost::no_property> > > >, void*, boost::detail::edge_desc_impl, long int> >]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/graph_concepts.hpp:125:9: required from ‘boost::concepts::BidirectionalGraph::~BidirectionalGraph() [with G = boost::adjacency_list >]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/graph_concepts.hpp:118:1: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::BidirectionalGraphConcept > >]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/dominator_tree.hpp:245:5: required from ‘void boost::lengauer_tarjan_dominator_tree(const Graph&, const typename graph_traits::vertex_descriptor&, const IndexMap&, TimeMap, PredMap, VertexVector&, DomTreePredMap) [with Graph = adjacency_list >; IndexMap = adj_list_vertex_property_map >, int, const int&, vertex_index_t>; TimeMap = iterator_property_map<__gnu_cxx::__normal_iterator > >, adj_list_vertex_property_map >, int, const int&, vertex_index_t>, long unsigned int, long unsigned int&>; PredMap = iterator_property_map<__gnu_cxx::__normal_iterator >, adj_list_vertex_property_map >, int, const int&, vertex_index_t>, void*, void*&>; VertexVector = std::vector; DomTreePredMap = iterator_property_map<__gnu_cxx::__normal_iterator >, adj_list_vertex_property_map >, int, int&, vertex_index_t> >; typename graph_traits::vertex_descriptor = void*]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/dominator_tree.hpp:360:35: required from ‘void boost::lengauer_tarjan_dominator_tree(const Graph&, const typename graph_traits::vertex_descriptor&, DomTreePredMap) [with Graph = adjacency_list >; DomTreePredMap = iterator_property_map<__gnu_cxx::__normal_iterator >, adj_list_vertex_property_map >, int, int&, vertex_index_t> >; typename graph_traits::vertex_descriptor = void*]’ dominatorTree.cpp:46:36: required from here /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::Assignable::~Assignable() [with TT = boost::detail::in_edge_iter<__gnu_cxx::__normal_iterator >, boost::no_property>*, std::vector >, boost::no_property>, std::allocator >, boost::no_property> > > >, void*, boost::detail::edge_desc_impl, long int>]’ 37 | ~model() | ^ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:145:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 145 | BOOST_CONCEPT_USAGE(Assignable) { | ^~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::EqualityComparable >, boost::no_property>*, std::vector >, boost::no_property>, std::allocator >, boost::no_property> > > >, void*, boost::detail::edge_desc_impl, long int> >]’: /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements >, boost::no_property>*, std::vector >, boost::no_property>, std::allocator >, boost::no_property> > > >, void*, boost::detail::edge_desc_impl, long int> > >]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:233:5: required from ‘struct boost::EqualityComparable >, boost::no_property>*, std::vector >, boost::no_property>, std::allocator >, boost::no_property> > > >, void*, boost::detail::edge_desc_impl, long int> >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:502:3: required from ‘struct boost::InputIterator >, boost::no_property>*, std::vector >, boost::no_property>, std::allocator >, boost::no_property> > > >, void*, boost::detail::edge_desc_impl, long int> >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::InputIterator >, boost::no_property>*, std::vector >, boost::no_property>, std::allocator >, boost::no_property> > > >, void*, boost::detail::edge_desc_impl, long int> >]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied >, boost::no_property>*, std::vector >, boost::no_property>, std::allocator >, boost::no_property> > > >, void*, boost::detail::edge_desc_impl, long int> > >::value’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:45:51: [ skipping 3 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::MultiPassInputIterator >, boost::no_property>*, std::vector >, boost::no_property>, std::allocator >, boost::no_property> > > >, void*, boost::detail::edge_desc_impl, long int> >]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/graph_concepts.hpp:125:9: required from ‘boost::concepts::BidirectionalGraph::~BidirectionalGraph() [with G = boost::adjacency_list >]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/graph_concepts.hpp:118:1: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::BidirectionalGraphConcept > >]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/dominator_tree.hpp:245:5: required from ‘void boost::lengauer_tarjan_dominator_tree(const Graph&, const typename graph_traits::vertex_descriptor&, const IndexMap&, TimeMap, PredMap, VertexVector&, DomTreePredMap) [with Graph = adjacency_list >; IndexMap = adj_list_vertex_property_map >, int, const int&, vertex_index_t>; TimeMap = iterator_property_map<__gnu_cxx::__normal_iterator > >, adj_list_vertex_property_map >, int, const int&, vertex_index_t>, long unsigned int, long unsigned int&>; PredMap = iterator_property_map<__gnu_cxx::__normal_iterator >, adj_list_vertex_property_map >, int, const int&, vertex_index_t>, void*, void*&>; VertexVector = std::vector; DomTreePredMap = iterator_property_map<__gnu_cxx::__normal_iterator >, adj_list_vertex_property_map >, int, int&, vertex_index_t> >; typename graph_traits::vertex_descriptor = void*]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/dominator_tree.hpp:360:35: required from ‘void boost::lengauer_tarjan_dominator_tree(const Graph&, const typename graph_traits::vertex_descriptor&, DomTreePredMap) [with Graph = adjacency_list >; DomTreePredMap = iterator_property_map<__gnu_cxx::__normal_iterator >, adj_list_vertex_property_map >, int, int&, vertex_index_t> >; typename graph_traits::vertex_descriptor = void*]’ dominatorTree.cpp:46:36: required from here /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::EqualityComparable::~EqualityComparable() [with TT = boost::detail::in_edge_iter<__gnu_cxx::__normal_iterator >, boost::no_property>*, std::vector >, boost::no_property>, std::allocator >, boost::no_property> > > >, void*, boost::detail::edge_desc_impl, long int>]’ 37 | ~model() | ^ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:233:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 233 | BOOST_CONCEPT_USAGE(EqualityComparable) { | ^~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::InputIterator >, boost::no_property>*, std::vector >, boost::no_property>, std::allocator >, boost::no_property> > > >, void*, boost::detail::edge_desc_impl, long int> >]’: /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements >, boost::no_property>*, std::vector >, boost::no_property>, std::allocator >, boost::no_property> > > >, void*, boost::detail::edge_desc_impl, long int> > >]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:512:7: required from ‘struct boost::InputIterator >, boost::no_property>*, std::vector >, boost::no_property>, std::allocator >, boost::no_property> > > >, void*, boost::detail::edge_desc_impl, long int> >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::InputIterator >, boost::no_property>*, std::vector >, boost::no_property>, std::allocator >, boost::no_property> > > >, void*, boost::detail::edge_desc_impl, long int> >]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied >, boost::no_property>*, std::vector >, boost::no_property>, std::allocator >, boost::no_property> > > >, void*, boost::detail::edge_desc_impl, long int> > >::value’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied >, boost::no_property>*, std::vector >, boost::no_property>, std::allocator >, boost::no_property> > > >, void*, boost::detail::edge_desc_impl, long int> > >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:72:8: [ skipping 2 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::MultiPassInputIterator >, boost::no_property>*, std::vector >, boost::no_property>, std::allocator >, boost::no_property> > > >, void*, boost::detail::edge_desc_impl, long int> >]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/graph_concepts.hpp:125:9: required from ‘boost::concepts::BidirectionalGraph::~BidirectionalGraph() [with G = boost::adjacency_list >]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/graph_concepts.hpp:118:1: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::BidirectionalGraphConcept > >]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/dominator_tree.hpp:245:5: required from ‘void boost::lengauer_tarjan_dominator_tree(const Graph&, const typename graph_traits::vertex_descriptor&, const IndexMap&, TimeMap, PredMap, VertexVector&, DomTreePredMap) [with Graph = adjacency_list >; IndexMap = adj_list_vertex_property_map >, int, const int&, vertex_index_t>; TimeMap = iterator_property_map<__gnu_cxx::__normal_iterator > >, adj_list_vertex_property_map >, int, const int&, vertex_index_t>, long unsigned int, long unsigned int&>; PredMap = iterator_property_map<__gnu_cxx::__normal_iterator >, adj_list_vertex_property_map >, int, const int&, vertex_index_t>, void*, void*&>; VertexVector = std::vector; DomTreePredMap = iterator_property_map<__gnu_cxx::__normal_iterator >, adj_list_vertex_property_map >, int, int&, vertex_index_t> >; typename graph_traits::vertex_descriptor = void*]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/dominator_tree.hpp:360:35: required from ‘void boost::lengauer_tarjan_dominator_tree(const Graph&, const typename graph_traits::vertex_descriptor&, DomTreePredMap) [with Graph = adjacency_list >; DomTreePredMap = iterator_property_map<__gnu_cxx::__normal_iterator >, adj_list_vertex_property_map >, int, int&, vertex_index_t> >; typename graph_traits::vertex_descriptor = void*]’ dominatorTree.cpp:46:36: required from here /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::InputIterator::~InputIterator() [with TT = boost::detail::in_edge_iter<__gnu_cxx::__normal_iterator >, boost::no_property>*, std::vector >, boost::no_property>, std::allocator >, boost::no_property> > > >, void*, boost::detail::edge_desc_impl, long int>]’ 37 | ~model() | ^ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:512:7: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 512 | BOOST_CONCEPT_USAGE(InputIterator) | ^~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::Convertible]’: /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements >]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:208:5: required from ‘struct boost::Convertible’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:206:3: required from ‘struct boost::ConvertibleConcept’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::ConvertibleConcept]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied >::value’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:45:51: [ skipping 11 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_ >, boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>, boost::default_color_type, boost::default_color_type&>, void*>)>’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/depth_first_search.hpp:134:9: required from ‘void boost::detail::depth_first_visit_impl(const IncidenceGraph&, typename boost::graph_traits::vertex_descriptor, DFSVisitor&, ColorMap, TerminatorFunc) [with IncidenceGraph = boost::adjacency_list >; DFSVisitor = boost::dfs_visitor >, boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>, void*, void*&>, boost::on_tree_edge>, time_stamper_with_vertex_vector > >, boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>, long unsigned int, long unsigned int&>, std::vector, long unsigned int, boost::on_discover_vertex> > >; ColorMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>, boost::default_color_type, boost::default_color_type&>; TerminatorFunc = nontruth2; typename boost::graph_traits::vertex_descriptor = void*]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/depth_first_search.hpp:417:35: required from ‘void boost::depth_first_visit(const IncidenceGraph&, typename graph_traits::vertex_descriptor, DFSVisitor, ColorMap) [with IncidenceGraph = adjacency_list >; DFSVisitor = dfs_visitor >, adj_list_vertex_property_map >, int, const int&, vertex_index_t>, void*, void*&>, on_tree_edge>, detail::time_stamper_with_vertex_vector > >, adj_list_vertex_property_map >, int, const int&, vertex_index_t>, long unsigned int, long unsigned int&>, std::vector, long unsigned int, on_discover_vertex> > >; ColorMap = iterator_property_map<__gnu_cxx::__normal_iterator >, adj_list_vertex_property_map >, int, const int&, vertex_index_t>, default_color_type, default_color_type&>; typename graph_traits::vertex_descriptor = void*]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/dominator_tree.hpp:309:22: required from ‘void boost::lengauer_tarjan_dominator_tree(const Graph&, const typename graph_traits::vertex_descriptor&, const IndexMap&, TimeMap, PredMap, VertexVector&, DomTreePredMap) [with Graph = adjacency_list >; IndexMap = adj_list_vertex_property_map >, int, const int&, vertex_index_t>; TimeMap = iterator_property_map<__gnu_cxx::__normal_iterator > >, adj_list_vertex_property_map >, int, const int&, vertex_index_t>, long unsigned int, long unsigned int&>; PredMap = iterator_property_map<__gnu_cxx::__normal_iterator >, adj_list_vertex_property_map >, int, const int&, vertex_index_t>, void*, void*&>; VertexVector = std::vector; DomTreePredMap = iterator_property_map<__gnu_cxx::__normal_iterator >, adj_list_vertex_property_map >, int, int&, vertex_index_t> >; typename graph_traits::vertex_descriptor = void*]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/dominator_tree.hpp:360:35: required from ‘void boost::lengauer_tarjan_dominator_tree(const Graph&, const typename graph_traits::vertex_descriptor&, DomTreePredMap) [with Graph = adjacency_list >; DomTreePredMap = iterator_property_map<__gnu_cxx::__normal_iterator >, adj_list_vertex_property_map >, int, int&, vertex_index_t> >; typename graph_traits::vertex_descriptor = void*]’ dominatorTree.cpp:46:36: required from here /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::Convertible::~Convertible() [with X = boost::lvalue_property_map_tag; Y = boost::readable_property_map_tag]’ 37 | ~model() | ^ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:208:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 208 | BOOST_CONCEPT_USAGE(Convertible) { | ^~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::Convertible]’: /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements >]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:208:5: required from ‘struct boost::Convertible’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:206:3: required from ‘struct boost::ConvertibleConcept’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::ConvertibleConcept]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied >::value’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:45:51: [ skipping 11 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_ >, boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>, boost::default_color_type, boost::default_color_type&>, void*>)>’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/depth_first_search.hpp:134:9: required from ‘void boost::detail::depth_first_visit_impl(const IncidenceGraph&, typename boost::graph_traits::vertex_descriptor, DFSVisitor&, ColorMap, TerminatorFunc) [with IncidenceGraph = boost::adjacency_list >; DFSVisitor = boost::dfs_visitor >, boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>, void*, void*&>, boost::on_tree_edge>, time_stamper_with_vertex_vector > >, boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>, long unsigned int, long unsigned int&>, std::vector, long unsigned int, boost::on_discover_vertex> > >; ColorMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>, boost::default_color_type, boost::default_color_type&>; TerminatorFunc = nontruth2; typename boost::graph_traits::vertex_descriptor = void*]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/depth_first_search.hpp:417:35: required from ‘void boost::depth_first_visit(const IncidenceGraph&, typename graph_traits::vertex_descriptor, DFSVisitor, ColorMap) [with IncidenceGraph = adjacency_list >; DFSVisitor = dfs_visitor >, adj_list_vertex_property_map >, int, const int&, vertex_index_t>, void*, void*&>, on_tree_edge>, detail::time_stamper_with_vertex_vector > >, adj_list_vertex_property_map >, int, const int&, vertex_index_t>, long unsigned int, long unsigned int&>, std::vector, long unsigned int, on_discover_vertex> > >; ColorMap = iterator_property_map<__gnu_cxx::__normal_iterator >, adj_list_vertex_property_map >, int, const int&, vertex_index_t>, default_color_type, default_color_type&>; typename graph_traits::vertex_descriptor = void*]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/dominator_tree.hpp:309:22: required from ‘void boost::lengauer_tarjan_dominator_tree(const Graph&, const typename graph_traits::vertex_descriptor&, const IndexMap&, TimeMap, PredMap, VertexVector&, DomTreePredMap) [with Graph = adjacency_list >; IndexMap = adj_list_vertex_property_map >, int, const int&, vertex_index_t>; TimeMap = iterator_property_map<__gnu_cxx::__normal_iterator > >, adj_list_vertex_property_map >, int, const int&, vertex_index_t>, long unsigned int, long unsigned int&>; PredMap = iterator_property_map<__gnu_cxx::__normal_iterator >, adj_list_vertex_property_map >, int, const int&, vertex_index_t>, void*, void*&>; VertexVector = std::vector; DomTreePredMap = iterator_property_map<__gnu_cxx::__normal_iterator >, adj_list_vertex_property_map >, int, int&, vertex_index_t> >; typename graph_traits::vertex_descriptor = void*]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/dominator_tree.hpp:360:35: required from ‘void boost::lengauer_tarjan_dominator_tree(const Graph&, const typename graph_traits::vertex_descriptor&, DomTreePredMap) [with Graph = adjacency_list >; DomTreePredMap = iterator_property_map<__gnu_cxx::__normal_iterator >, adj_list_vertex_property_map >, int, int&, vertex_index_t> >; typename graph_traits::vertex_descriptor = void*]’ dominatorTree.cpp:46:36: required from here /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::Convertible::~Convertible() [with X = boost::lvalue_property_map_tag; Y = boost::writable_property_map_tag]’ 37 | ~model() | ^ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:208:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 208 | BOOST_CONCEPT_USAGE(Convertible) { | ^~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::Assignable >, boost::no_property>*, std::vector >, boost::no_property>, std::allocator >, boost::no_property> > > >, void*, boost::detail::edge_desc_impl, long int> >]’: /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements >, boost::no_property>*, std::vector >, boost::no_property>, std::allocator >, boost::no_property> > > >, void*, boost::detail::edge_desc_impl, long int> > >]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:145:5: required from ‘struct boost::Assignable >, boost::no_property>*, std::vector >, boost::no_property>, std::allocator >, boost::no_property> > > >, void*, boost::detail::edge_desc_impl, long int> >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:502:3: required from ‘struct boost::InputIterator >, boost::no_property>*, std::vector >, boost::no_property>, std::allocator >, boost::no_property> > > >, void*, boost::detail::edge_desc_impl, long int> >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::InputIterator >, boost::no_property>*, std::vector >, boost::no_property>, std::allocator >, boost::no_property> > > >, void*, boost::detail::edge_desc_impl, long int> >]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied >, boost::no_property>*, std::vector >, boost::no_property>, std::allocator >, boost::no_property> > > >, void*, boost::detail::edge_desc_impl, long int> > >::value’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:45:51: [ skipping 11 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied > > >::value’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied > > >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_ > >)>’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/dominator_tree.hpp:245:5: required from ‘void boost::lengauer_tarjan_dominator_tree(const Graph&, const typename graph_traits::vertex_descriptor&, const IndexMap&, TimeMap, PredMap, VertexVector&, DomTreePredMap) [with Graph = adjacency_list >; IndexMap = adj_list_vertex_property_map >, int, const int&, vertex_index_t>; TimeMap = iterator_property_map<__gnu_cxx::__normal_iterator > >, adj_list_vertex_property_map >, int, const int&, vertex_index_t>, long unsigned int, long unsigned int&>; PredMap = iterator_property_map<__gnu_cxx::__normal_iterator >, adj_list_vertex_property_map >, int, const int&, vertex_index_t>, void*, void*&>; VertexVector = std::vector; DomTreePredMap = iterator_property_map<__gnu_cxx::__normal_iterator >, adj_list_vertex_property_map >, int, int&, vertex_index_t> >; typename graph_traits::vertex_descriptor = void*]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/dominator_tree.hpp:360:35: required from ‘void boost::lengauer_tarjan_dominator_tree(const Graph&, const typename graph_traits::vertex_descriptor&, DomTreePredMap) [with Graph = adjacency_list >; DomTreePredMap = iterator_property_map<__gnu_cxx::__normal_iterator >, adj_list_vertex_property_map >, int, int&, vertex_index_t> >; typename graph_traits::vertex_descriptor = void*]’ dominatorTree.cpp:46:36: required from here /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::Assignable::~Assignable() [with TT = boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator >, boost::no_property>*, std::vector >, boost::no_property>, std::allocator >, boost::no_property> > > >, void*, boost::detail::edge_desc_impl, long int>]’ 37 | ~model() | ^ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:145:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 145 | BOOST_CONCEPT_USAGE(Assignable) { | ^~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::EqualityComparable >, boost::no_property>*, std::vector >, boost::no_property>, std::allocator >, boost::no_property> > > >, void*, boost::detail::edge_desc_impl, long int> >]’: /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements >, boost::no_property>*, std::vector >, boost::no_property>, std::allocator >, boost::no_property> > > >, void*, boost::detail::edge_desc_impl, long int> > >]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:233:5: required from ‘struct boost::EqualityComparable >, boost::no_property>*, std::vector >, boost::no_property>, std::allocator >, boost::no_property> > > >, void*, boost::detail::edge_desc_impl, long int> >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:502:3: required from ‘struct boost::InputIterator >, boost::no_property>*, std::vector >, boost::no_property>, std::allocator >, boost::no_property> > > >, void*, boost::detail::edge_desc_impl, long int> >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::InputIterator >, boost::no_property>*, std::vector >, boost::no_property>, std::allocator >, boost::no_property> > > >, void*, boost::detail::edge_desc_impl, long int> >]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied >, boost::no_property>*, std::vector >, boost::no_property>, std::allocator >, boost::no_property> > > >, void*, boost::detail::edge_desc_impl, long int> > >::value’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:45:51: [ skipping 11 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied > > >::value’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied > > >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_ > >)>’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/dominator_tree.hpp:245:5: required from ‘void boost::lengauer_tarjan_dominator_tree(const Graph&, const typename graph_traits::vertex_descriptor&, const IndexMap&, TimeMap, PredMap, VertexVector&, DomTreePredMap) [with Graph = adjacency_list >; IndexMap = adj_list_vertex_property_map >, int, const int&, vertex_index_t>; TimeMap = iterator_property_map<__gnu_cxx::__normal_iterator > >, adj_list_vertex_property_map >, int, const int&, vertex_index_t>, long unsigned int, long unsigned int&>; PredMap = iterator_property_map<__gnu_cxx::__normal_iterator >, adj_list_vertex_property_map >, int, const int&, vertex_index_t>, void*, void*&>; VertexVector = std::vector; DomTreePredMap = iterator_property_map<__gnu_cxx::__normal_iterator >, adj_list_vertex_property_map >, int, int&, vertex_index_t> >; typename graph_traits::vertex_descriptor = void*]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/dominator_tree.hpp:360:35: required from ‘void boost::lengauer_tarjan_dominator_tree(const Graph&, const typename graph_traits::vertex_descriptor&, DomTreePredMap) [with Graph = adjacency_list >; DomTreePredMap = iterator_property_map<__gnu_cxx::__normal_iterator >, adj_list_vertex_property_map >, int, int&, vertex_index_t> >; typename graph_traits::vertex_descriptor = void*]’ dominatorTree.cpp:46:36: required from here /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::EqualityComparable::~EqualityComparable() [with TT = boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator >, boost::no_property>*, std::vector >, boost::no_property>, std::allocator >, boost::no_property> > > >, void*, boost::detail::edge_desc_impl, long int>]’ 37 | ~model() | ^ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:233:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 233 | BOOST_CONCEPT_USAGE(EqualityComparable) { | ^~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::InputIterator >, boost::no_property>*, std::vector >, boost::no_property>, std::allocator >, boost::no_property> > > >, void*, boost::detail::edge_desc_impl, long int> >]’: /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements >, boost::no_property>*, std::vector >, boost::no_property>, std::allocator >, boost::no_property> > > >, void*, boost::detail::edge_desc_impl, long int> > >]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:512:7: required from ‘struct boost::InputIterator >, boost::no_property>*, std::vector >, boost::no_property>, std::allocator >, boost::no_property> > > >, void*, boost::detail::edge_desc_impl, long int> >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::InputIterator >, boost::no_property>*, std::vector >, boost::no_property>, std::allocator >, boost::no_property> > > >, void*, boost::detail::edge_desc_impl, long int> >]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied >, boost::no_property>*, std::vector >, boost::no_property>, std::allocator >, boost::no_property> > > >, void*, boost::detail::edge_desc_impl, long int> > >::value’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied >, boost::no_property>*, std::vector >, boost::no_property>, std::allocator >, boost::no_property> > > >, void*, boost::detail::edge_desc_impl, long int> > >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:72:8: [ skipping 10 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied > > >::value’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied > > >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_ > >)>’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/dominator_tree.hpp:245:5: required from ‘void boost::lengauer_tarjan_dominator_tree(const Graph&, const typename graph_traits::vertex_descriptor&, const IndexMap&, TimeMap, PredMap, VertexVector&, DomTreePredMap) [with Graph = adjacency_list >; IndexMap = adj_list_vertex_property_map >, int, const int&, vertex_index_t>; TimeMap = iterator_property_map<__gnu_cxx::__normal_iterator > >, adj_list_vertex_property_map >, int, const int&, vertex_index_t>, long unsigned int, long unsigned int&>; PredMap = iterator_property_map<__gnu_cxx::__normal_iterator >, adj_list_vertex_property_map >, int, const int&, vertex_index_t>, void*, void*&>; VertexVector = std::vector; DomTreePredMap = iterator_property_map<__gnu_cxx::__normal_iterator >, adj_list_vertex_property_map >, int, int&, vertex_index_t> >; typename graph_traits::vertex_descriptor = void*]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/dominator_tree.hpp:360:35: required from ‘void boost::lengauer_tarjan_dominator_tree(const Graph&, const typename graph_traits::vertex_descriptor&, DomTreePredMap) [with Graph = adjacency_list >; DomTreePredMap = iterator_property_map<__gnu_cxx::__normal_iterator >, adj_list_vertex_property_map >, int, int&, vertex_index_t> >; typename graph_traits::vertex_descriptor = void*]’ dominatorTree.cpp:46:36: required from here /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::InputIterator::~InputIterator() [with TT = boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator >, boost::no_property>*, std::vector >, boost::no_property>, std::allocator >, boost::no_property> > > >, void*, boost::detail::edge_desc_impl, long int>]’ 37 | ~model() | ^ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:512:7: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 512 | BOOST_CONCEPT_USAGE(InputIterator) | ^~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements, std::input_iterator_tag> >]’: /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:208:5: required from ‘struct boost::Convertible, std::input_iterator_tag>’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::Convertible, std::input_iterator_tag>]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied, std::input_iterator_tag> >::value’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied, std::input_iterator_tag> >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_, std::input_iterator_tag>)>’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:515:9: [ skipping 3 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::MultiPassInputIterator >, boost::no_property>*, std::vector >, boost::no_property>, std::allocator >, boost::no_property> > > >, void*, boost::detail::edge_desc_impl, long int> >]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/graph_concepts.hpp:125:9: required from ‘boost::concepts::BidirectionalGraph::~BidirectionalGraph() [with G = boost::adjacency_list >]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/graph_concepts.hpp:118:1: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::BidirectionalGraphConcept > >]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/dominator_tree.hpp:245:5: required from ‘void boost::lengauer_tarjan_dominator_tree(const Graph&, const typename graph_traits::vertex_descriptor&, const IndexMap&, TimeMap, PredMap, VertexVector&, DomTreePredMap) [with Graph = adjacency_list >; IndexMap = adj_list_vertex_property_map >, int, const int&, vertex_index_t>; TimeMap = iterator_property_map<__gnu_cxx::__normal_iterator > >, adj_list_vertex_property_map >, int, const int&, vertex_index_t>, long unsigned int, long unsigned int&>; PredMap = iterator_property_map<__gnu_cxx::__normal_iterator >, adj_list_vertex_property_map >, int, const int&, vertex_index_t>, void*, void*&>; VertexVector = std::vector; DomTreePredMap = iterator_property_map<__gnu_cxx::__normal_iterator >, adj_list_vertex_property_map >, int, int&, vertex_index_t> >; typename graph_traits::vertex_descriptor = void*]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/dominator_tree.hpp:360:35: required from ‘void boost::lengauer_tarjan_dominator_tree(const Graph&, const typename graph_traits::vertex_descriptor&, DomTreePredMap) [with Graph = adjacency_list >; DomTreePredMap = iterator_property_map<__gnu_cxx::__normal_iterator >, adj_list_vertex_property_map >, int, int&, vertex_index_t> >; typename graph_traits::vertex_descriptor = void*]’ dominatorTree.cpp:46:36: required from here /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::Convertible, std::input_iterator_tag>]’ 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ^ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::Convertible, std::input_iterator_tag>]’: /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:515:9: required from ‘boost::InputIterator::~InputIterator() [with TT = boost::detail::in_edge_iter<__gnu_cxx::__normal_iterator >, boost::no_property>*, std::vector >, boost::no_property>, std::allocator >, boost::no_property> > > >, void*, boost::detail::edge_desc_impl, long int>]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::InputIterator >, boost::no_property>*, std::vector >, boost::no_property>, std::allocator >, boost::no_property> > > >, void*, boost::detail::edge_desc_impl, long int> >]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/graph_concepts.hpp:53:35: required from ‘boost::concepts::MultiPassInputIterator::~MultiPassInputIterator() [with T = boost::detail::in_edge_iter<__gnu_cxx::__normal_iterator >, boost::no_property>*, std::vector >, boost::no_property>, std::allocator >, boost::no_property> > > >, void*, boost::detail::edge_desc_impl, long int>]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::MultiPassInputIterator >, boost::no_property>*, std::vector >, boost::no_property>, std::allocator >, boost::no_property> > > >, void*, boost::detail::edge_desc_impl, long int> >]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/graph_concepts.hpp:125:9: required from ‘boost::concepts::BidirectionalGraph::~BidirectionalGraph() [with G = boost::adjacency_list >]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/graph_concepts.hpp:118:1: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::BidirectionalGraphConcept > >]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/dominator_tree.hpp:245:5: required from ‘void boost::lengauer_tarjan_dominator_tree(const Graph&, const typename graph_traits::vertex_descriptor&, const IndexMap&, TimeMap, PredMap, VertexVector&, DomTreePredMap) [with Graph = adjacency_list >; IndexMap = adj_list_vertex_property_map >, int, const int&, vertex_index_t>; TimeMap = iterator_property_map<__gnu_cxx::__normal_iterator > >, adj_list_vertex_property_map >, int, const int&, vertex_index_t>, long unsigned int, long unsigned int&>; PredMap = iterator_property_map<__gnu_cxx::__normal_iterator >, adj_list_vertex_property_map >, int, const int&, vertex_index_t>, void*, void*&>; VertexVector = std::vector; DomTreePredMap = iterator_property_map<__gnu_cxx::__normal_iterator >, adj_list_vertex_property_map >, int, int&, vertex_index_t> >; typename graph_traits::vertex_descriptor = void*]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/dominator_tree.hpp:360:35: required from ‘void boost::lengauer_tarjan_dominator_tree(const Graph&, const typename graph_traits::vertex_descriptor&, DomTreePredMap) [with Graph = adjacency_list >; DomTreePredMap = iterator_property_map<__gnu_cxx::__normal_iterator >, adj_list_vertex_property_map >, int, int&, vertex_index_t> >; typename graph_traits::vertex_descriptor = void*]’ dominatorTree.cpp:46:36: required from here /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::Convertible::~Convertible() [with X = boost::iterators::detail::iterator_category_with_traversal; Y = std::input_iterator_tag]’ 37 | ~model() | ^ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:208:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 208 | BOOST_CONCEPT_USAGE(Convertible) { | ^~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::Convertible, std::input_iterator_tag>]’: /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements, std::input_iterator_tag> >]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:208:5: required from ‘struct boost::Convertible, std::input_iterator_tag>’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::Convertible, std::input_iterator_tag>]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied, std::input_iterator_tag> >::value’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied, std::input_iterator_tag> >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:72:8: [ skipping 4 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::MultiPassInputIterator >, boost::no_property>*, std::vector >, boost::no_property>, std::allocator >, boost::no_property> > > >, void*, boost::detail::edge_desc_impl, long int> >]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/graph_concepts.hpp:125:9: required from ‘boost::concepts::BidirectionalGraph::~BidirectionalGraph() [with G = boost::adjacency_list >]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/graph_concepts.hpp:118:1: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::BidirectionalGraphConcept > >]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/dominator_tree.hpp:245:5: required from ‘void boost::lengauer_tarjan_dominator_tree(const Graph&, const typename graph_traits::vertex_descriptor&, const IndexMap&, TimeMap, PredMap, VertexVector&, DomTreePredMap) [with Graph = adjacency_list >; IndexMap = adj_list_vertex_property_map >, int, const int&, vertex_index_t>; TimeMap = iterator_property_map<__gnu_cxx::__normal_iterator > >, adj_list_vertex_property_map >, int, const int&, vertex_index_t>, long unsigned int, long unsigned int&>; PredMap = iterator_property_map<__gnu_cxx::__normal_iterator >, adj_list_vertex_property_map >, int, const int&, vertex_index_t>, void*, void*&>; VertexVector = std::vector; DomTreePredMap = iterator_property_map<__gnu_cxx::__normal_iterator >, adj_list_vertex_property_map >, int, int&, vertex_index_t> >; typename graph_traits::vertex_descriptor = void*]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/dominator_tree.hpp:360:35: required from ‘void boost::lengauer_tarjan_dominator_tree(const Graph&, const typename graph_traits::vertex_descriptor&, DomTreePredMap) [with Graph = adjacency_list >; DomTreePredMap = iterator_property_map<__gnu_cxx::__normal_iterator >, adj_list_vertex_property_map >, int, int&, vertex_index_t> >; typename graph_traits::vertex_descriptor = void*]’ dominatorTree.cpp:46:36: required from here /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::Convertible::~Convertible() [with X = boost::iterators::detail::iterator_category_with_traversal; Y = std::input_iterator_tag]’ 37 | ~model() | ^ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:208:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 208 | BOOST_CONCEPT_USAGE(Convertible) { | ^~~~~~~~~~~~~~~~~~~ g++ -std=gnu++17 -I"/usr/share/R/include" -DNDEBUG -I'/home/omnipath/local/R/4.4-3.20/BH/include' -fpic -g -O2 -fno-omit-frame-pointer -mno-omit-leaf-frame-pointer -ffile-prefix-map=/build/r-base-EawLoD/r-base-4.4.1=. -fstack-protector-strong -fstack-clash-protection -Wformat -Werror=format-security -fcf-protection -fdebug-prefix-map=/build/r-base-EawLoD/r-base-4.4.1=/usr/src/r-base-4.4.1-1.2404.0 -Wdate-time -D_FORTIFY_SOURCE=3 -c edmonds_optimum_branching.cpp -o edmonds_optimum_branching.o In file included from /home/omnipath/local/R/4.4-3.20/BH/include/boost/smart_ptr/shared_ptr.hpp:18, from /home/omnipath/local/R/4.4-3.20/BH/include/boost/property_map/vector_property_map.hpp:14, from /home/omnipath/local/R/4.4-3.20/BH/include/boost/property_map/property_map.hpp:598, from RBGL.hpp:17, from edmonds_optimum_branching.cpp:1: /home/omnipath/local/R/4.4-3.20/BH/include/boost/smart_ptr/detail/shared_count.hpp:361:33: warning: ‘template class std::auto_ptr’ is deprecated: use 'std::unique_ptr' instead [-Wdeprecated-declarations] 361 | explicit shared_count( std::auto_ptr & r ): pi_( new sp_counted_impl_p( r.get() ) ) | ^~~~~~~~ In file included from /usr/include/c++/13/memory:78, from /home/omnipath/local/R/4.4-3.20/BH/include/boost/smart_ptr/detail/sp_counted_impl.hpp:35, from /home/omnipath/local/R/4.4-3.20/BH/include/boost/smart_ptr/detail/shared_count.hpp:27: /usr/include/c++/13/bits/unique_ptr.h:65:28: note: declared here 65 | template class auto_ptr; | ^~~~~~~~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/smart_ptr/shared_ptr.hpp:251:65: warning: ‘template class std::auto_ptr’ is deprecated: use 'std::unique_ptr' instead [-Wdeprecated-declarations] 251 | template< class T, class R > struct sp_enable_if_auto_ptr< std::auto_ptr< T >, R > | ^~~~~~~~ /usr/include/c++/13/bits/unique_ptr.h:65:28: note: declared here 65 | template class auto_ptr; | ^~~~~~~~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/smart_ptr/shared_ptr.hpp:508:31: warning: ‘template class std::auto_ptr’ is deprecated: use 'std::unique_ptr' instead [-Wdeprecated-declarations] 508 | explicit shared_ptr( std::auto_ptr & r ): px(r.get()), pn() | ^~~~~~~~ /usr/include/c++/13/bits/unique_ptr.h:65:28: note: declared here 65 | template class auto_ptr; | ^~~~~~~~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/smart_ptr/shared_ptr.hpp:521:22: warning: ‘template class std::auto_ptr’ is deprecated: use 'std::unique_ptr' instead [-Wdeprecated-declarations] 521 | shared_ptr( std::auto_ptr && r ): px(r.get()), pn() | ^~~~~~~~ /usr/include/c++/13/bits/unique_ptr.h:65:28: note: declared here 65 | template class auto_ptr; | ^~~~~~~~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/smart_ptr/shared_ptr.hpp:604:34: warning: ‘template class std::auto_ptr’ is deprecated: use 'std::unique_ptr' instead [-Wdeprecated-declarations] 604 | shared_ptr & operator=( std::auto_ptr & r ) | ^~~~~~~~ /usr/include/c++/13/bits/unique_ptr.h:65:28: note: declared here 65 | template class auto_ptr; | ^~~~~~~~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/smart_ptr/shared_ptr.hpp:613:34: warning: ‘template class std::auto_ptr’ is deprecated: use 'std::unique_ptr' instead [-Wdeprecated-declarations] 613 | shared_ptr & operator=( std::auto_ptr && r ) | ^~~~~~~~ /usr/include/c++/13/bits/unique_ptr.h:65:28: note: declared here 65 | template class auto_ptr; | ^~~~~~~~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/smart_ptr/shared_ptr.hpp: In member function ‘boost::shared_ptr& boost::shared_ptr::operator=(std::auto_ptr<_Up>&&)’: /home/omnipath/local/R/4.4-3.20/BH/include/boost/smart_ptr/shared_ptr.hpp:615:38: warning: ‘template class std::auto_ptr’ is deprecated: use 'std::unique_ptr' instead [-Wdeprecated-declarations] 615 | this_type( static_cast< std::auto_ptr && >( r ) ).swap( *this ); | ^~~~~~~~ /usr/include/c++/13/bits/unique_ptr.h:65:28: note: declared here 65 | template class auto_ptr; | ^~~~~~~~ In file included from /home/omnipath/local/R/4.4-3.20/BH/include/boost/scoped_ptr.hpp:13, from /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/adjacency_list.hpp:22, from RBGL.hpp:38: /home/omnipath/local/R/4.4-3.20/BH/include/boost/smart_ptr/scoped_ptr.hpp: At global scope: /home/omnipath/local/R/4.4-3.20/BH/include/boost/smart_ptr/scoped_ptr.hpp:75:31: warning: ‘template class std::auto_ptr’ is deprecated: use 'std::unique_ptr' instead [-Wdeprecated-declarations] 75 | explicit scoped_ptr( std::auto_ptr p ) BOOST_SP_NOEXCEPT : px( p.release() ) | ^~~~~~~~ /usr/include/c++/13/bits/unique_ptr.h:65:28: note: declared here 65 | template class auto_ptr; | ^~~~~~~~ In file included from /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/assert.hpp:35, from /home/omnipath/local/R/4.4-3.20/BH/include/boost/property_map/property_map.hpp:19: /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements > >]’: /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/graph_concepts.hpp:66:5: required from ‘struct boost::concepts::Graph >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/graph_concepts.hpp:226:1: required from ‘struct boost::concepts::EdgeListGraph >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/graph_concepts.hpp:226:1: required from ‘struct boost::concepts::EdgeListGraphConcept >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::concepts::EdgeListGraphConcept >]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied > >::value’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied > >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_ >)>’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:50:7: required from ‘void boost::function_requires(Model*) [with Model = concepts::EdgeListGraphConcept >]’ edmonds_optimum_branching_impl.hpp:523:62: required from ‘void edmonds_optimum_branching(TEdgeListGraph&, TVertexIndexMap, TWeightMap, TInputIterator, TInputIterator, TOutputIterator) [with bool TOptimumIsMaximum = true; bool TAttemptToSpan = false; bool TGraphIsDense = false; TEdgeListGraph = R_adjacency_list; TVertexIndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>; TWeightMap = boost::adj_list_edge_property_map, boost::edge_weight_t>; TInputIterator = long unsigned int*; TOutputIterator = std::back_insert_iterator > >]’ edmonds_optimum_branching.cpp:36:47: required from here /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ In file included from /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:31, from /home/omnipath/local/R/4.4-3.20/BH/include/boost/property_map/property_map.hpp:20: /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::concepts::Graph >]’ 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ^ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements > >]’: /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/graph_concepts.hpp:233:5: required from ‘struct boost::concepts::EdgeListGraph >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/graph_concepts.hpp:226:1: required from ‘struct boost::concepts::EdgeListGraphConcept >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::concepts::EdgeListGraphConcept >]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied > >::value’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied > >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_ >)>’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:50:7: required from ‘void boost::function_requires(Model*) [with Model = concepts::EdgeListGraphConcept >]’ edmonds_optimum_branching_impl.hpp:523:62: required from ‘void edmonds_optimum_branching(TEdgeListGraph&, TVertexIndexMap, TWeightMap, TInputIterator, TInputIterator, TOutputIterator) [with bool TOptimumIsMaximum = true; bool TAttemptToSpan = false; bool TGraphIsDense = false; TEdgeListGraph = R_adjacency_list; TVertexIndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>; TWeightMap = boost::adj_list_edge_property_map, boost::edge_weight_t>; TInputIterator = long unsigned int*; TOutputIterator = std::back_insert_iterator > >]’ edmonds_optimum_branching.cpp:36:47: required from here /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::concepts::EdgeListGraph >]’ 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ^ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::EdgeListGraphConcept >]’: /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:50:7: required from ‘void boost::function_requires(Model*) [with Model = concepts::EdgeListGraphConcept >]’ edmonds_optimum_branching_impl.hpp:523:62: required from ‘void edmonds_optimum_branching(TEdgeListGraph&, TVertexIndexMap, TWeightMap, TInputIterator, TInputIterator, TOutputIterator) [with bool TOptimumIsMaximum = true; bool TAttemptToSpan = false; bool TGraphIsDense = false; TEdgeListGraph = R_adjacency_list; TVertexIndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>; TWeightMap = boost::adj_list_edge_property_map, boost::edge_weight_t>; TInputIterator = long unsigned int*; TOutputIterator = std::back_insert_iterator > >]’ edmonds_optimum_branching.cpp:36:47: required from here /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ In file included from /home/omnipath/local/R/4.4-3.20/BH/include/boost/preprocessor/repetition/enum_binary_params.hpp:15, from /home/omnipath/local/R/4.4-3.20/BH/include/boost/utility/base_from_member.hpp:15, from /home/omnipath/local/R/4.4-3.20/BH/include/boost/utility.hpp:15, from RBGL.hpp:16: /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/graph_concepts.hpp:226:15: note: in a call to non-static member function ‘boost::concepts::EdgeListGraphConcept >::~EdgeListGraphConcept()’ 226 | BOOST_concept(EdgeListGraph, (G)) : Graph< G > | ^~~~~~~~~~~~~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/preprocessor/cat.hpp:29:34: note: in definition of macro ‘BOOST_PP_CAT_I’ 29 | # define BOOST_PP_CAT_I(a, b) a ## b | ^ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/concept_def.hpp:23:12: note: in expansion of macro ‘BOOST_PP_CAT’ 23 | struct BOOST_PP_CAT(name,Concept) \ | ^~~~~~~~~~~~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/graph_concepts.hpp:226:1: note: in expansion of macro ‘BOOST_concept’ 226 | BOOST_concept(EdgeListGraph, (G)) : Graph< G > | ^~~~~~~~~~~~~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::constraint::failed() [with Model = boost::ReadablePropertyMapConcept, boost::edge_weight_t>, boost::detail::edge_desc_impl >]’: /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:50:7: required from ‘void boost::function_requires(Model*) [with Model = ReadablePropertyMapConcept, edge_weight_t>, detail::edge_desc_impl >]’ edmonds_optimum_branching_impl.hpp:524:70: required from ‘void edmonds_optimum_branching(TEdgeListGraph&, TVertexIndexMap, TWeightMap, TInputIterator, TInputIterator, TOutputIterator) [with bool TOptimumIsMaximum = true; bool TAttemptToSpan = false; bool TGraphIsDense = false; TEdgeListGraph = R_adjacency_list; TVertexIndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>; TWeightMap = boost::adj_list_edge_property_map, boost::edge_weight_t>; TInputIterator = long unsigned int*; TOutputIterator = std::back_insert_iterator > >]’ edmonds_optimum_branching.cpp:36:47: required from here /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:65:52: warning: ‘this’ pointer is null [-Wnonnull] 65 | static void failed() { ((Model*)0)->constraints(); } | ~~~~~~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/property_map/property_map.hpp:147:10: note: in a call to non-static member function ‘void boost::ReadablePropertyMapConcept::constraints() [with PMap = boost::adj_list_edge_property_map, boost::edge_weight_t>; Key = boost::detail::edge_desc_impl]’ 147 | void constraints() { | ^~~~~~~~~~~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::constraint::failed() [with Model = boost::ReadablePropertyMapConcept, long unsigned int>, long unsigned int>]’: /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:50:7: required from ‘void boost::function_requires(Model*) [with Model = ReadablePropertyMapConcept, long unsigned int>, long unsigned int>]’ edmonds_optimum_branching_impl.hpp:525:77: required from ‘void edmonds_optimum_branching(TEdgeListGraph&, TVertexIndexMap, TWeightMap, TInputIterator, TInputIterator, TOutputIterator) [with bool TOptimumIsMaximum = true; bool TAttemptToSpan = false; bool TGraphIsDense = false; TEdgeListGraph = R_adjacency_list; TVertexIndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>; TWeightMap = boost::adj_list_edge_property_map, boost::edge_weight_t>; TInputIterator = long unsigned int*; TOutputIterator = std::back_insert_iterator > >]’ edmonds_optimum_branching.cpp:36:47: required from here /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:65:52: warning: ‘this’ pointer is null [-Wnonnull] 65 | static void failed() { ((Model*)0)->constraints(); } | ~~~~~~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/property_map/property_map.hpp:147:10: note: in a call to non-static member function ‘void boost::ReadablePropertyMapConcept::constraints() [with PMap = boost::vec_adj_list_vertex_id_map, long unsigned int>; Key = long unsigned int]’ 147 | void constraints() { | ^~~~~~~~~~~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements >]’: /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:145:5: required from ‘struct boost::Assignable’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:502:3: required from ‘struct boost::InputIterator’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:502:3: required from ‘struct boost::InputIteratorConcept’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::InputIteratorConcept]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied >::value’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_)>’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:50:7: required from ‘void boost::function_requires(Model*) [with Model = InputIteratorConcept]’ edmonds_optimum_branching_impl.hpp:526:62: required from ‘void edmonds_optimum_branching(TEdgeListGraph&, TVertexIndexMap, TWeightMap, TInputIterator, TInputIterator, TOutputIterator) [with bool TOptimumIsMaximum = true; bool TAttemptToSpan = false; bool TGraphIsDense = false; TEdgeListGraph = R_adjacency_list; TVertexIndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>; TWeightMap = boost::adj_list_edge_property_map, boost::edge_weight_t>; TInputIterator = long unsigned int*; TOutputIterator = std::back_insert_iterator > >]’ edmonds_optimum_branching.cpp:36:47: required from here /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::Assignable]’ 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ^ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements >]’: /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:233:5: required from ‘struct boost::EqualityComparable’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:502:3: required from ‘struct boost::InputIterator’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:502:3: required from ‘struct boost::InputIteratorConcept’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::InputIteratorConcept]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied >::value’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_)>’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:50:7: required from ‘void boost::function_requires(Model*) [with Model = InputIteratorConcept]’ edmonds_optimum_branching_impl.hpp:526:62: required from ‘void edmonds_optimum_branching(TEdgeListGraph&, TVertexIndexMap, TWeightMap, TInputIterator, TInputIterator, TOutputIterator) [with bool TOptimumIsMaximum = true; bool TAttemptToSpan = false; bool TGraphIsDense = false; TEdgeListGraph = R_adjacency_list; TVertexIndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>; TWeightMap = boost::adj_list_edge_property_map, boost::edge_weight_t>; TInputIterator = long unsigned int*; TOutputIterator = std::back_insert_iterator > >]’ edmonds_optimum_branching.cpp:36:47: required from here /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::EqualityComparable]’ 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ^ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements >]’: /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:512:7: required from ‘struct boost::InputIterator’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:502:3: required from ‘struct boost::InputIteratorConcept’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::InputIteratorConcept]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied >::value’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_)>’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:50:7: required from ‘void boost::function_requires(Model*) [with Model = InputIteratorConcept]’ edmonds_optimum_branching_impl.hpp:526:62: required from ‘void edmonds_optimum_branching(TEdgeListGraph&, TVertexIndexMap, TWeightMap, TInputIterator, TInputIterator, TOutputIterator) [with bool TOptimumIsMaximum = true; bool TAttemptToSpan = false; bool TGraphIsDense = false; TEdgeListGraph = R_adjacency_list; TVertexIndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>; TWeightMap = boost::adj_list_edge_property_map, boost::edge_weight_t>; TInputIterator = long unsigned int*; TOutputIterator = std::back_insert_iterator > >]’ edmonds_optimum_branching.cpp:36:47: required from here /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::InputIterator]’ 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ^ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::InputIteratorConcept]’: /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:50:7: required from ‘void boost::function_requires(Model*) [with Model = InputIteratorConcept]’ edmonds_optimum_branching_impl.hpp:526:62: required from ‘void edmonds_optimum_branching(TEdgeListGraph&, TVertexIndexMap, TWeightMap, TInputIterator, TInputIterator, TOutputIterator) [with bool TOptimumIsMaximum = true; bool TAttemptToSpan = false; bool TGraphIsDense = false; TEdgeListGraph = R_adjacency_list; TVertexIndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>; TWeightMap = boost::adj_list_edge_property_map, boost::edge_weight_t>; TInputIterator = long unsigned int*; TOutputIterator = std::back_insert_iterator > >]’ edmonds_optimum_branching.cpp:36:47: required from here /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:502:17: note: in a call to non-static member function ‘boost::InputIteratorConcept::~InputIteratorConcept()’ 502 | BOOST_concept(InputIterator,(TT)) | ^~~~~~~~~~~~~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/preprocessor/cat.hpp:29:34: note: in definition of macro ‘BOOST_PP_CAT_I’ 29 | # define BOOST_PP_CAT_I(a, b) a ## b | ^ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/concept_def.hpp:23:12: note: in expansion of macro ‘BOOST_PP_CAT’ 23 | struct BOOST_PP_CAT(name,Concept) \ | ^~~~~~~~~~~~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:502:3: note: in expansion of macro ‘BOOST_concept’ 502 | BOOST_concept(InputIterator,(TT)) | ^~~~~~~~~~~~~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements > > > >]’: /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:145:5: required from ‘struct boost::Assignable > > >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:526:3: required from ‘struct boost::OutputIterator > >, boost::detail::edge_desc_impl >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:526:3: required from ‘struct boost::OutputIteratorConcept > >, boost::detail::edge_desc_impl >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::OutputIteratorConcept > >, boost::detail::edge_desc_impl >]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied > >, boost::detail::edge_desc_impl > >::value’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied > >, boost::detail::edge_desc_impl > >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_ > >, boost::detail::edge_desc_impl >)>’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:50:7: required from ‘void boost::function_requires(Model*) [with Model = OutputIteratorConcept > >, detail::edge_desc_impl >]’ edmonds_optimum_branching_impl.hpp:527:70: required from ‘void edmonds_optimum_branching(TEdgeListGraph&, TVertexIndexMap, TWeightMap, TInputIterator, TInputIterator, TOutputIterator) [with bool TOptimumIsMaximum = true; bool TAttemptToSpan = false; bool TGraphIsDense = false; TEdgeListGraph = R_adjacency_list; TVertexIndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>; TWeightMap = boost::adj_list_edge_property_map, boost::edge_weight_t>; TInputIterator = long unsigned int*; TOutputIterator = std::back_insert_iterator > >]’ edmonds_optimum_branching.cpp:36:47: required from here /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::Assignable > > >]’ 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ^ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements > >, boost::detail::edge_desc_impl > >]’: /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:529:5: required from ‘struct boost::OutputIterator > >, boost::detail::edge_desc_impl >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:526:3: required from ‘struct boost::OutputIteratorConcept > >, boost::detail::edge_desc_impl >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::OutputIteratorConcept > >, boost::detail::edge_desc_impl >]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied > >, boost::detail::edge_desc_impl > >::value’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied > >, boost::detail::edge_desc_impl > >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_ > >, boost::detail::edge_desc_impl >)>’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:50:7: required from ‘void boost::function_requires(Model*) [with Model = OutputIteratorConcept > >, detail::edge_desc_impl >]’ edmonds_optimum_branching_impl.hpp:527:70: required from ‘void edmonds_optimum_branching(TEdgeListGraph&, TVertexIndexMap, TWeightMap, TInputIterator, TInputIterator, TOutputIterator) [with bool TOptimumIsMaximum = true; bool TAttemptToSpan = false; bool TGraphIsDense = false; TEdgeListGraph = R_adjacency_list; TVertexIndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>; TWeightMap = boost::adj_list_edge_property_map, boost::edge_weight_t>; TInputIterator = long unsigned int*; TOutputIterator = std::back_insert_iterator > >]’ edmonds_optimum_branching.cpp:36:47: required from here /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::OutputIterator > >, boost::detail::edge_desc_impl >]’ 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ^ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::OutputIteratorConcept > >, boost::detail::edge_desc_impl >]’: /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:50:7: required from ‘void boost::function_requires(Model*) [with Model = OutputIteratorConcept > >, detail::edge_desc_impl >]’ edmonds_optimum_branching_impl.hpp:527:70: required from ‘void edmonds_optimum_branching(TEdgeListGraph&, TVertexIndexMap, TWeightMap, TInputIterator, TInputIterator, TOutputIterator) [with bool TOptimumIsMaximum = true; bool TAttemptToSpan = false; bool TGraphIsDense = false; TEdgeListGraph = R_adjacency_list; TVertexIndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>; TWeightMap = boost::adj_list_edge_property_map, boost::edge_weight_t>; TInputIterator = long unsigned int*; TOutputIterator = std::back_insert_iterator > >]’ edmonds_optimum_branching.cpp:36:47: required from here /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:526:17: note: in a call to non-static member function ‘boost::OutputIteratorConcept > >, boost::detail::edge_desc_impl >::~OutputIteratorConcept()’ 526 | BOOST_concept(OutputIterator,(TT)(ValueT)) | ^~~~~~~~~~~~~~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/preprocessor/cat.hpp:29:34: note: in definition of macro ‘BOOST_PP_CAT_I’ 29 | # define BOOST_PP_CAT_I(a, b) a ## b | ^ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/concept_def.hpp:23:12: note: in expansion of macro ‘BOOST_PP_CAT’ 23 | struct BOOST_PP_CAT(name,Concept) \ | ^~~~~~~~~~~~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:526:3: note: in expansion of macro ‘BOOST_concept’ 526 | BOOST_concept(OutputIterator,(TT)(ValueT)) | ^~~~~~~~~~~~~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::concepts::Graph >]’: /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements > >]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/graph_concepts.hpp:66:5: required from ‘struct boost::concepts::Graph >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/graph_concepts.hpp:226:1: required from ‘struct boost::concepts::EdgeListGraph >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/graph_concepts.hpp:226:1: required from ‘struct boost::concepts::EdgeListGraphConcept >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::concepts::EdgeListGraphConcept >]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied > >::value’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied > >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_ >)>’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:50:7: required from ‘void boost::function_requires(Model*) [with Model = concepts::EdgeListGraphConcept >]’ edmonds_optimum_branching_impl.hpp:523:62: required from ‘void edmonds_optimum_branching(TEdgeListGraph&, TVertexIndexMap, TWeightMap, TInputIterator, TInputIterator, TOutputIterator) [with bool TOptimumIsMaximum = true; bool TAttemptToSpan = false; bool TGraphIsDense = false; TEdgeListGraph = R_adjacency_list; TVertexIndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>; TWeightMap = boost::adj_list_edge_property_map, boost::edge_weight_t>; TInputIterator = long unsigned int*; TOutputIterator = std::back_insert_iterator > >]’ edmonds_optimum_branching.cpp:36:47: required from here /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::concepts::Graph::~Graph() [with G = R_adjacency_list]’ 37 | ~model() | ^ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/graph_concepts.hpp:66:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 66 | BOOST_CONCEPT_USAGE(Graph) | ^~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::concepts::EdgeListGraph >]’: /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements > >]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/graph_concepts.hpp:233:5: required from ‘struct boost::concepts::EdgeListGraph >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/graph_concepts.hpp:226:1: required from ‘struct boost::concepts::EdgeListGraphConcept >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::concepts::EdgeListGraphConcept >]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied > >::value’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied > >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_ >)>’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:50:7: required from ‘void boost::function_requires(Model*) [with Model = concepts::EdgeListGraphConcept >]’ edmonds_optimum_branching_impl.hpp:523:62: required from ‘void edmonds_optimum_branching(TEdgeListGraph&, TVertexIndexMap, TWeightMap, TInputIterator, TInputIterator, TOutputIterator) [with bool TOptimumIsMaximum = true; bool TAttemptToSpan = false; bool TGraphIsDense = false; TEdgeListGraph = R_adjacency_list; TVertexIndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>; TWeightMap = boost::adj_list_edge_property_map, boost::edge_weight_t>; TInputIterator = long unsigned int*; TOutputIterator = std::back_insert_iterator > >]’ edmonds_optimum_branching.cpp:36:47: required from here /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::concepts::EdgeListGraph::~EdgeListGraph() [with G = R_adjacency_list]’ 37 | ~model() | ^ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/graph_concepts.hpp:233:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 233 | BOOST_CONCEPT_USAGE(EdgeListGraph) | ^~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements >]’: /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:208:5: required from ‘struct boost::Convertible’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:206:3: required from ‘struct boost::ConvertibleConcept’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::ConvertibleConcept]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied >::value’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:72:8: [ skipping 3 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied, boost::edge_weight_t>, boost::detail::edge_desc_impl > >::value’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied, boost::edge_weight_t>, boost::detail::edge_desc_impl > >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_, boost::edge_weight_t>, boost::detail::edge_desc_impl >)>’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:50:7: required from ‘void boost::function_requires(Model*) [with Model = ReadablePropertyMapConcept, edge_weight_t>, detail::edge_desc_impl >]’ edmonds_optimum_branching_impl.hpp:524:70: required from ‘void edmonds_optimum_branching(TEdgeListGraph&, TVertexIndexMap, TWeightMap, TInputIterator, TInputIterator, TOutputIterator) [with bool TOptimumIsMaximum = true; bool TAttemptToSpan = false; bool TGraphIsDense = false; TEdgeListGraph = R_adjacency_list; TVertexIndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>; TWeightMap = boost::adj_list_edge_property_map, boost::edge_weight_t>; TInputIterator = long unsigned int*; TOutputIterator = std::back_insert_iterator > >]’ edmonds_optimum_branching.cpp:36:47: required from here /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::Convertible]’ 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ^ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::ConvertibleConcept]’: /home/omnipath/local/R/4.4-3.20/BH/include/boost/property_map/property_map.hpp:148:7: required from ‘void boost::ReadablePropertyMapConcept::constraints() [with PMap = boost::adj_list_edge_property_map, boost::edge_weight_t>; Key = boost::detail::edge_desc_impl]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::ReadablePropertyMapConcept, boost::edge_weight_t>, boost::detail::edge_desc_impl >]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied, boost::edge_weight_t>, boost::detail::edge_desc_impl > >::value’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied, boost::edge_weight_t>, boost::detail::edge_desc_impl > >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_, boost::edge_weight_t>, boost::detail::edge_desc_impl >)>’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:50:7: required from ‘void boost::function_requires(Model*) [with Model = ReadablePropertyMapConcept, edge_weight_t>, detail::edge_desc_impl >]’ edmonds_optimum_branching_impl.hpp:524:70: required from ‘void edmonds_optimum_branching(TEdgeListGraph&, TVertexIndexMap, TWeightMap, TInputIterator, TInputIterator, TOutputIterator) [with bool TOptimumIsMaximum = true; bool TAttemptToSpan = false; bool TGraphIsDense = false; TEdgeListGraph = R_adjacency_list; TVertexIndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>; TWeightMap = boost::adj_list_edge_property_map, boost::edge_weight_t>; TInputIterator = long unsigned int*; TOutputIterator = std::back_insert_iterator > >]’ edmonds_optimum_branching.cpp:36:47: required from here /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:206:17: note: in a call to non-static member function ‘boost::ConvertibleConcept::~ConvertibleConcept()’ 206 | BOOST_concept(Convertible,(X)(Y)) | ^~~~~~~~~~~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/preprocessor/cat.hpp:29:34: note: in definition of macro ‘BOOST_PP_CAT_I’ 29 | # define BOOST_PP_CAT_I(a, b) a ## b | ^ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/concept_def.hpp:23:12: note: in expansion of macro ‘BOOST_PP_CAT’ 23 | struct BOOST_PP_CAT(name,Concept) \ | ^~~~~~~~~~~~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:206:3: note: in expansion of macro ‘BOOST_concept’ 206 | BOOST_concept(Convertible,(X)(Y)) | ^~~~~~~~~~~~~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements >]’: /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:208:5: required from ‘struct boost::Convertible’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:206:3: required from ‘struct boost::ConvertibleConcept’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::ConvertibleConcept]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied >::value’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:72:8: [ skipping 3 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied, long unsigned int>, long unsigned int> >::value’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied, long unsigned int>, long unsigned int> >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_, long unsigned int>, long unsigned int>)>’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:50:7: required from ‘void boost::function_requires(Model*) [with Model = ReadablePropertyMapConcept, long unsigned int>, long unsigned int>]’ edmonds_optimum_branching_impl.hpp:525:77: required from ‘void edmonds_optimum_branching(TEdgeListGraph&, TVertexIndexMap, TWeightMap, TInputIterator, TInputIterator, TOutputIterator) [with bool TOptimumIsMaximum = true; bool TAttemptToSpan = false; bool TGraphIsDense = false; TEdgeListGraph = R_adjacency_list; TVertexIndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>; TWeightMap = boost::adj_list_edge_property_map, boost::edge_weight_t>; TInputIterator = long unsigned int*; TOutputIterator = std::back_insert_iterator > >]’ edmonds_optimum_branching.cpp:36:47: required from here /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::Convertible]’ 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ^ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::ConvertibleConcept]’: /home/omnipath/local/R/4.4-3.20/BH/include/boost/property_map/property_map.hpp:148:7: required from ‘void boost::ReadablePropertyMapConcept::constraints() [with PMap = boost::vec_adj_list_vertex_id_map, long unsigned int>; Key = long unsigned int]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::ReadablePropertyMapConcept, long unsigned int>, long unsigned int>]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied, long unsigned int>, long unsigned int> >::value’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied, long unsigned int>, long unsigned int> >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_, long unsigned int>, long unsigned int>)>’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:50:7: required from ‘void boost::function_requires(Model*) [with Model = ReadablePropertyMapConcept, long unsigned int>, long unsigned int>]’ edmonds_optimum_branching_impl.hpp:525:77: required from ‘void edmonds_optimum_branching(TEdgeListGraph&, TVertexIndexMap, TWeightMap, TInputIterator, TInputIterator, TOutputIterator) [with bool TOptimumIsMaximum = true; bool TAttemptToSpan = false; bool TGraphIsDense = false; TEdgeListGraph = R_adjacency_list; TVertexIndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>; TWeightMap = boost::adj_list_edge_property_map, boost::edge_weight_t>; TInputIterator = long unsigned int*; TOutputIterator = std::back_insert_iterator > >]’ edmonds_optimum_branching.cpp:36:47: required from here /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:206:17: note: in a call to non-static member function ‘boost::ConvertibleConcept::~ConvertibleConcept()’ 206 | BOOST_concept(Convertible,(X)(Y)) | ^~~~~~~~~~~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/preprocessor/cat.hpp:29:34: note: in definition of macro ‘BOOST_PP_CAT_I’ 29 | # define BOOST_PP_CAT_I(a, b) a ## b | ^ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/concept_def.hpp:23:12: note: in expansion of macro ‘BOOST_PP_CAT’ 23 | struct BOOST_PP_CAT(name,Concept) \ | ^~~~~~~~~~~~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:206:3: note: in expansion of macro ‘BOOST_concept’ 206 | BOOST_concept(Convertible,(X)(Y)) | ^~~~~~~~~~~~~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::Assignable]’: /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements >]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:145:5: required from ‘struct boost::Assignable’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:502:3: required from ‘struct boost::InputIterator’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:502:3: required from ‘struct boost::InputIteratorConcept’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::InputIteratorConcept]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied >::value’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_)>’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:50:7: required from ‘void boost::function_requires(Model*) [with Model = InputIteratorConcept]’ edmonds_optimum_branching_impl.hpp:526:62: required from ‘void edmonds_optimum_branching(TEdgeListGraph&, TVertexIndexMap, TWeightMap, TInputIterator, TInputIterator, TOutputIterator) [with bool TOptimumIsMaximum = true; bool TAttemptToSpan = false; bool TGraphIsDense = false; TEdgeListGraph = R_adjacency_list; TVertexIndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>; TWeightMap = boost::adj_list_edge_property_map, boost::edge_weight_t>; TInputIterator = long unsigned int*; TOutputIterator = std::back_insert_iterator > >]’ edmonds_optimum_branching.cpp:36:47: required from here /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::Assignable::~Assignable() [with TT = long unsigned int*]’ 37 | ~model() | ^ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:145:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 145 | BOOST_CONCEPT_USAGE(Assignable) { | ^~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::EqualityComparable]’: /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements >]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:233:5: required from ‘struct boost::EqualityComparable’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:502:3: required from ‘struct boost::InputIterator’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:502:3: required from ‘struct boost::InputIteratorConcept’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::InputIteratorConcept]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied >::value’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_)>’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:50:7: required from ‘void boost::function_requires(Model*) [with Model = InputIteratorConcept]’ edmonds_optimum_branching_impl.hpp:526:62: required from ‘void edmonds_optimum_branching(TEdgeListGraph&, TVertexIndexMap, TWeightMap, TInputIterator, TInputIterator, TOutputIterator) [with bool TOptimumIsMaximum = true; bool TAttemptToSpan = false; bool TGraphIsDense = false; TEdgeListGraph = R_adjacency_list; TVertexIndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>; TWeightMap = boost::adj_list_edge_property_map, boost::edge_weight_t>; TInputIterator = long unsigned int*; TOutputIterator = std::back_insert_iterator > >]’ edmonds_optimum_branching.cpp:36:47: required from here /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::EqualityComparable::~EqualityComparable() [with TT = long unsigned int*]’ 37 | ~model() | ^ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:233:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 233 | BOOST_CONCEPT_USAGE(EqualityComparable) { | ^~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::InputIterator]’: /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements >]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:512:7: required from ‘struct boost::InputIterator’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:502:3: required from ‘struct boost::InputIteratorConcept’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::InputIteratorConcept]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied >::value’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_)>’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:50:7: required from ‘void boost::function_requires(Model*) [with Model = InputIteratorConcept]’ edmonds_optimum_branching_impl.hpp:526:62: required from ‘void edmonds_optimum_branching(TEdgeListGraph&, TVertexIndexMap, TWeightMap, TInputIterator, TInputIterator, TOutputIterator) [with bool TOptimumIsMaximum = true; bool TAttemptToSpan = false; bool TGraphIsDense = false; TEdgeListGraph = R_adjacency_list; TVertexIndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>; TWeightMap = boost::adj_list_edge_property_map, boost::edge_weight_t>; TInputIterator = long unsigned int*; TOutputIterator = std::back_insert_iterator > >]’ edmonds_optimum_branching.cpp:36:47: required from here /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::InputIterator::~InputIterator() [with TT = long unsigned int*]’ 37 | ~model() | ^ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:512:7: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 512 | BOOST_CONCEPT_USAGE(InputIterator) | ^~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::Assignable > > >]’: /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements > > > >]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:145:5: required from ‘struct boost::Assignable > > >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:526:3: required from ‘struct boost::OutputIterator > >, boost::detail::edge_desc_impl >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:526:3: required from ‘struct boost::OutputIteratorConcept > >, boost::detail::edge_desc_impl >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::OutputIteratorConcept > >, boost::detail::edge_desc_impl >]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied > >, boost::detail::edge_desc_impl > >::value’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied > >, boost::detail::edge_desc_impl > >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_ > >, boost::detail::edge_desc_impl >)>’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:50:7: required from ‘void boost::function_requires(Model*) [with Model = OutputIteratorConcept > >, detail::edge_desc_impl >]’ edmonds_optimum_branching_impl.hpp:527:70: required from ‘void edmonds_optimum_branching(TEdgeListGraph&, TVertexIndexMap, TWeightMap, TInputIterator, TInputIterator, TOutputIterator) [with bool TOptimumIsMaximum = true; bool TAttemptToSpan = false; bool TGraphIsDense = false; TEdgeListGraph = R_adjacency_list; TVertexIndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>; TWeightMap = boost::adj_list_edge_property_map, boost::edge_weight_t>; TInputIterator = long unsigned int*; TOutputIterator = std::back_insert_iterator > >]’ edmonds_optimum_branching.cpp:36:47: required from here /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::Assignable::~Assignable() [with TT = std::back_insert_iterator > >]’ 37 | ~model() | ^ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:145:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 145 | BOOST_CONCEPT_USAGE(Assignable) { | ^~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::OutputIterator > >, boost::detail::edge_desc_impl >]’: /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements > >, boost::detail::edge_desc_impl > >]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:529:5: required from ‘struct boost::OutputIterator > >, boost::detail::edge_desc_impl >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:526:3: required from ‘struct boost::OutputIteratorConcept > >, boost::detail::edge_desc_impl >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::OutputIteratorConcept > >, boost::detail::edge_desc_impl >]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied > >, boost::detail::edge_desc_impl > >::value’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied > >, boost::detail::edge_desc_impl > >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_ > >, boost::detail::edge_desc_impl >)>’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:50:7: required from ‘void boost::function_requires(Model*) [with Model = OutputIteratorConcept > >, detail::edge_desc_impl >]’ edmonds_optimum_branching_impl.hpp:527:70: required from ‘void edmonds_optimum_branching(TEdgeListGraph&, TVertexIndexMap, TWeightMap, TInputIterator, TInputIterator, TOutputIterator) [with bool TOptimumIsMaximum = true; bool TAttemptToSpan = false; bool TGraphIsDense = false; TEdgeListGraph = R_adjacency_list; TVertexIndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>; TWeightMap = boost::adj_list_edge_property_map, boost::edge_weight_t>; TInputIterator = long unsigned int*; TOutputIterator = std::back_insert_iterator > >]’ edmonds_optimum_branching.cpp:36:47: required from here /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::OutputIterator::~OutputIterator() [with TT = std::back_insert_iterator > >; ValueT = boost::detail::edge_desc_impl]’ 37 | ~model() | ^ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:529:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 529 | BOOST_CONCEPT_USAGE(OutputIterator) { | ^~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator >*, std::vector >, std::allocator > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::adjacency_list, boost::property, boost::no_property, boost::listS> > > >]’: /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/graph_concepts.hpp:52:50: required from ‘struct boost::concepts::MultiPassInputIterator, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator >*, std::vector >, std::allocator > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::adjacency_list, boost::property, boost::no_property, boost::listS> > >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::concepts::MultiPassInputIterator, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator >*, std::vector >, std::allocator > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::adjacency_list, boost::property, boost::no_property, boost::listS> > >]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator >*, std::vector >, std::allocator > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::adjacency_list, boost::property, boost::no_property, boost::listS> > > >::value’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator >*, std::vector >, std::allocator > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::adjacency_list, boost::property, boost::no_property, boost::listS> > > >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator >*, std::vector >, std::allocator > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::adjacency_list, boost::property, boost::no_property, boost::listS> > >)>’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/graph_concepts.hpp:235:9: required from ‘boost::concepts::EdgeListGraph::~EdgeListGraph() [with G = R_adjacency_list]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/graph_concepts.hpp:226:1: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::EdgeListGraphConcept >]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:50:7: required from ‘void boost::function_requires(Model*) [with Model = concepts::EdgeListGraphConcept >]’ edmonds_optimum_branching_impl.hpp:523:62: required from ‘void edmonds_optimum_branching(TEdgeListGraph&, TVertexIndexMap, TWeightMap, TInputIterator, TInputIterator, TOutputIterator) [with bool TOptimumIsMaximum = true; bool TAttemptToSpan = false; bool TGraphIsDense = false; TEdgeListGraph = R_adjacency_list; TVertexIndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>; TWeightMap = boost::adj_list_edge_property_map, boost::edge_weight_t>; TInputIterator = long unsigned int*; TOutputIterator = std::back_insert_iterator > >]’ edmonds_optimum_branching.cpp:36:47: required from here /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::concepts::MultiPassInputIterator, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator >*, std::vector >, std::allocator > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::adjacency_list, boost::property, boost::no_property, boost::listS> > >]’ 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ^ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::MultiPassInputIterator, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator >*, std::vector >, std::allocator > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::adjacency_list, boost::property, boost::no_property, boost::listS> > >]’: /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/graph_concepts.hpp:235:9: required from ‘boost::concepts::EdgeListGraph::~EdgeListGraph() [with G = R_adjacency_list]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/graph_concepts.hpp:226:1: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::EdgeListGraphConcept >]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:50:7: required from ‘void boost::function_requires(Model*) [with Model = concepts::EdgeListGraphConcept >]’ edmonds_optimum_branching_impl.hpp:523:62: required from ‘void edmonds_optimum_branching(TEdgeListGraph&, TVertexIndexMap, TWeightMap, TInputIterator, TInputIterator, TOutputIterator) [with bool TOptimumIsMaximum = true; bool TAttemptToSpan = false; bool TGraphIsDense = false; TEdgeListGraph = R_adjacency_list; TVertexIndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>; TWeightMap = boost::adj_list_edge_property_map, boost::edge_weight_t>; TInputIterator = long unsigned int*; TOutputIterator = std::back_insert_iterator > >]’ edmonds_optimum_branching.cpp:36:47: required from here /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::concepts::MultiPassInputIterator::~MultiPassInputIterator() [with T = boost::detail::adj_list_edge_iterator, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator >*, std::vector >, std::allocator > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::adjacency_list, boost::property, boost::no_property, boost::listS> >]’ 37 | ~model() | ^ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/graph_concepts.hpp:52:50: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 52 | BOOST_concept(MultiPassInputIterator, (T)) { BOOST_CONCEPT_USAGE( | ^~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements > >]’: /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:137:5: required from ‘struct boost::DefaultConstructible >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::DefaultConstructible >]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied > >::value’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied > >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_ >)>’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/graph_concepts.hpp:90:9: required from ‘boost::concepts::EdgeListGraph::~EdgeListGraph() [with G = R_adjacency_list]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/graph_concepts.hpp:226:1: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::EdgeListGraphConcept >]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:50:7: required from ‘void boost::function_requires(Model*) [with Model = concepts::EdgeListGraphConcept >]’ edmonds_optimum_branching_impl.hpp:523:62: required from ‘void edmonds_optimum_branching(TEdgeListGraph&, TVertexIndexMap, TWeightMap, TInputIterator, TInputIterator, TOutputIterator) [with bool TOptimumIsMaximum = true; bool TAttemptToSpan = false; bool TGraphIsDense = false; TEdgeListGraph = R_adjacency_list; TVertexIndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>; TWeightMap = boost::adj_list_edge_property_map, boost::edge_weight_t>; TInputIterator = long unsigned int*; TOutputIterator = std::back_insert_iterator > >]’ edmonds_optimum_branching.cpp:36:47: required from here /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::DefaultConstructible >]’ 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ^ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::DefaultConstructible >]’: /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/graph_concepts.hpp:90:9: required from ‘boost::concepts::EdgeListGraph::~EdgeListGraph() [with G = R_adjacency_list]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/graph_concepts.hpp:226:1: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::EdgeListGraphConcept >]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:50:7: required from ‘void boost::function_requires(Model*) [with Model = concepts::EdgeListGraphConcept >]’ edmonds_optimum_branching_impl.hpp:523:62: required from ‘void edmonds_optimum_branching(TEdgeListGraph&, TVertexIndexMap, TWeightMap, TInputIterator, TInputIterator, TOutputIterator) [with bool TOptimumIsMaximum = true; bool TAttemptToSpan = false; bool TGraphIsDense = false; TEdgeListGraph = R_adjacency_list; TVertexIndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>; TWeightMap = boost::adj_list_edge_property_map, boost::edge_weight_t>; TInputIterator = long unsigned int*; TOutputIterator = std::back_insert_iterator > >]’ edmonds_optimum_branching.cpp:36:47: required from here /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::DefaultConstructible::~DefaultConstructible() [with TT = boost::detail::edge_desc_impl]’ 37 | ~model() | ^ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:137:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 137 | BOOST_CONCEPT_USAGE(DefaultConstructible) { | ^~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements > >]’: /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:233:5: required from ‘struct boost::EqualityComparable >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::EqualityComparable >]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied > >::value’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied > >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_ >)>’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/graph_concepts.hpp:91:9: required from ‘boost::concepts::EdgeListGraph::~EdgeListGraph() [with G = R_adjacency_list]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/graph_concepts.hpp:226:1: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::EdgeListGraphConcept >]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:50:7: required from ‘void boost::function_requires(Model*) [with Model = concepts::EdgeListGraphConcept >]’ edmonds_optimum_branching_impl.hpp:523:62: required from ‘void edmonds_optimum_branching(TEdgeListGraph&, TVertexIndexMap, TWeightMap, TInputIterator, TInputIterator, TOutputIterator) [with bool TOptimumIsMaximum = true; bool TAttemptToSpan = false; bool TGraphIsDense = false; TEdgeListGraph = R_adjacency_list; TVertexIndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>; TWeightMap = boost::adj_list_edge_property_map, boost::edge_weight_t>; TInputIterator = long unsigned int*; TOutputIterator = std::back_insert_iterator > >]’ edmonds_optimum_branching.cpp:36:47: required from here /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::EqualityComparable >]’ 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ^ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::EqualityComparable >]’: /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/graph_concepts.hpp:91:9: required from ‘boost::concepts::EdgeListGraph::~EdgeListGraph() [with G = R_adjacency_list]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/graph_concepts.hpp:226:1: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::EdgeListGraphConcept >]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:50:7: required from ‘void boost::function_requires(Model*) [with Model = concepts::EdgeListGraphConcept >]’ edmonds_optimum_branching_impl.hpp:523:62: required from ‘void edmonds_optimum_branching(TEdgeListGraph&, TVertexIndexMap, TWeightMap, TInputIterator, TInputIterator, TOutputIterator) [with bool TOptimumIsMaximum = true; bool TAttemptToSpan = false; bool TGraphIsDense = false; TEdgeListGraph = R_adjacency_list; TVertexIndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>; TWeightMap = boost::adj_list_edge_property_map, boost::edge_weight_t>; TInputIterator = long unsigned int*; TOutputIterator = std::back_insert_iterator > >]’ edmonds_optimum_branching.cpp:36:47: required from here /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::EqualityComparable::~EqualityComparable() [with TT = boost::detail::edge_desc_impl]’ 37 | ~model() | ^ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:233:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 233 | BOOST_CONCEPT_USAGE(EqualityComparable) { | ^~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements > >]’: /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:145:5: required from ‘struct boost::Assignable >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::Assignable >]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied > >::value’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied > >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_ >)>’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/graph_concepts.hpp:92:9: required from ‘boost::concepts::EdgeListGraph::~EdgeListGraph() [with G = R_adjacency_list]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/graph_concepts.hpp:226:1: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::EdgeListGraphConcept >]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:50:7: required from ‘void boost::function_requires(Model*) [with Model = concepts::EdgeListGraphConcept >]’ edmonds_optimum_branching_impl.hpp:523:62: required from ‘void edmonds_optimum_branching(TEdgeListGraph&, TVertexIndexMap, TWeightMap, TInputIterator, TInputIterator, TOutputIterator) [with bool TOptimumIsMaximum = true; bool TAttemptToSpan = false; bool TGraphIsDense = false; TEdgeListGraph = R_adjacency_list; TVertexIndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>; TWeightMap = boost::adj_list_edge_property_map, boost::edge_weight_t>; TInputIterator = long unsigned int*; TOutputIterator = std::back_insert_iterator > >]’ edmonds_optimum_branching.cpp:36:47: required from here /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::Assignable >]’ 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ^ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::Assignable >]’: /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/graph_concepts.hpp:92:9: required from ‘boost::concepts::EdgeListGraph::~EdgeListGraph() [with G = R_adjacency_list]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/graph_concepts.hpp:226:1: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::EdgeListGraphConcept >]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:50:7: required from ‘void boost::function_requires(Model*) [with Model = concepts::EdgeListGraphConcept >]’ edmonds_optimum_branching_impl.hpp:523:62: required from ‘void edmonds_optimum_branching(TEdgeListGraph&, TVertexIndexMap, TWeightMap, TInputIterator, TInputIterator, TOutputIterator) [with bool TOptimumIsMaximum = true; bool TAttemptToSpan = false; bool TGraphIsDense = false; TEdgeListGraph = R_adjacency_list; TVertexIndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>; TWeightMap = boost::adj_list_edge_property_map, boost::edge_weight_t>; TInputIterator = long unsigned int*; TOutputIterator = std::back_insert_iterator > >]’ edmonds_optimum_branching.cpp:36:47: required from here /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::Assignable::~Assignable() [with TT = boost::detail::edge_desc_impl]’ 37 | ~model() | ^ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:145:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 145 | BOOST_CONCEPT_USAGE(Assignable) { | ^~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements >]’: /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:208:5: required from ‘struct boost::Convertible’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::Convertible]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied >::value’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_)>’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/graph_concepts.hpp:239:9: required from ‘boost::concepts::EdgeListGraph::~EdgeListGraph() [with G = R_adjacency_list]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/graph_concepts.hpp:226:1: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::EdgeListGraphConcept >]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:50:7: required from ‘void boost::function_requires(Model*) [with Model = concepts::EdgeListGraphConcept >]’ edmonds_optimum_branching_impl.hpp:523:62: required from ‘void edmonds_optimum_branching(TEdgeListGraph&, TVertexIndexMap, TWeightMap, TInputIterator, TInputIterator, TOutputIterator) [with bool TOptimumIsMaximum = true; bool TAttemptToSpan = false; bool TGraphIsDense = false; TEdgeListGraph = R_adjacency_list; TVertexIndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>; TWeightMap = boost::adj_list_edge_property_map, boost::edge_weight_t>; TInputIterator = long unsigned int*; TOutputIterator = std::back_insert_iterator > >]’ edmonds_optimum_branching.cpp:36:47: required from here /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::Convertible]’ 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ^ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::Convertible]’: /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/graph_concepts.hpp:239:9: required from ‘boost::concepts::EdgeListGraph::~EdgeListGraph() [with G = R_adjacency_list]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/graph_concepts.hpp:226:1: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::EdgeListGraphConcept >]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:50:7: required from ‘void boost::function_requires(Model*) [with Model = concepts::EdgeListGraphConcept >]’ edmonds_optimum_branching_impl.hpp:523:62: required from ‘void edmonds_optimum_branching(TEdgeListGraph&, TVertexIndexMap, TWeightMap, TInputIterator, TInputIterator, TOutputIterator) [with bool TOptimumIsMaximum = true; bool TAttemptToSpan = false; bool TGraphIsDense = false; TEdgeListGraph = R_adjacency_list; TVertexIndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>; TWeightMap = boost::adj_list_edge_property_map, boost::edge_weight_t>; TInputIterator = long unsigned int*; TOutputIterator = std::back_insert_iterator > >]’ edmonds_optimum_branching.cpp:36:47: required from here /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::Convertible::~Convertible() [with X = boost::adj_list_dir_traversal_tag; Y = boost::edge_list_graph_tag]’ 37 | ~model() | ^ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:208:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 208 | BOOST_CONCEPT_USAGE(Convertible) { | ^~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::Convertible]’: /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements >]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:208:5: required from ‘struct boost::Convertible’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:206:3: required from ‘struct boost::ConvertibleConcept’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::ConvertibleConcept]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied >::value’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:45:51: [ skipping 4 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied, boost::edge_weight_t>, boost::detail::edge_desc_impl > >::value’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied, boost::edge_weight_t>, boost::detail::edge_desc_impl > >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_, boost::edge_weight_t>, boost::detail::edge_desc_impl >)>’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:50:7: required from ‘void boost::function_requires(Model*) [with Model = ReadablePropertyMapConcept, edge_weight_t>, detail::edge_desc_impl >]’ edmonds_optimum_branching_impl.hpp:524:70: required from ‘void edmonds_optimum_branching(TEdgeListGraph&, TVertexIndexMap, TWeightMap, TInputIterator, TInputIterator, TOutputIterator) [with bool TOptimumIsMaximum = true; bool TAttemptToSpan = false; bool TGraphIsDense = false; TEdgeListGraph = R_adjacency_list; TVertexIndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>; TWeightMap = boost::adj_list_edge_property_map, boost::edge_weight_t>; TInputIterator = long unsigned int*; TOutputIterator = std::back_insert_iterator > >]’ edmonds_optimum_branching.cpp:36:47: required from here /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::Convertible::~Convertible() [with X = boost::lvalue_property_map_tag; Y = boost::readable_property_map_tag]’ 37 | ~model() | ^ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:208:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 208 | BOOST_CONCEPT_USAGE(Convertible) { | ^~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::Convertible]’: /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements >]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:208:5: required from ‘struct boost::Convertible’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:206:3: required from ‘struct boost::ConvertibleConcept’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::ConvertibleConcept]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied >::value’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:45:51: [ skipping 4 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied, long unsigned int>, long unsigned int> >::value’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied, long unsigned int>, long unsigned int> >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_, long unsigned int>, long unsigned int>)>’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:50:7: required from ‘void boost::function_requires(Model*) [with Model = ReadablePropertyMapConcept, long unsigned int>, long unsigned int>]’ edmonds_optimum_branching_impl.hpp:525:77: required from ‘void edmonds_optimum_branching(TEdgeListGraph&, TVertexIndexMap, TWeightMap, TInputIterator, TInputIterator, TOutputIterator) [with bool TOptimumIsMaximum = true; bool TAttemptToSpan = false; bool TGraphIsDense = false; TEdgeListGraph = R_adjacency_list; TVertexIndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>; TWeightMap = boost::adj_list_edge_property_map, boost::edge_weight_t>; TInputIterator = long unsigned int*; TOutputIterator = std::back_insert_iterator > >]’ edmonds_optimum_branching.cpp:36:47: required from here /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::Convertible::~Convertible() [with X = boost::readable_property_map_tag; Y = boost::readable_property_map_tag]’ 37 | ~model() | ^ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:208:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 208 | BOOST_CONCEPT_USAGE(Convertible) { | ^~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::SignedInteger]’: /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:514:9: required from ‘boost::InputIterator::~InputIterator() [with TT = long unsigned int*]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:502:3: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::InputIteratorConcept]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:50:7: required from ‘void boost::function_requires(Model*) [with Model = InputIteratorConcept]’ edmonds_optimum_branching_impl.hpp:526:62: required from ‘void edmonds_optimum_branching(TEdgeListGraph&, TVertexIndexMap, TWeightMap, TInputIterator, TInputIterator, TOutputIterator) [with bool TOptimumIsMaximum = true; bool TAttemptToSpan = false; bool TGraphIsDense = false; TEdgeListGraph = R_adjacency_list; TVertexIndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>; TWeightMap = boost::adj_list_edge_property_map, boost::edge_weight_t>; TInputIterator = long unsigned int*; TOutputIterator = std::back_insert_iterator > >]’ edmonds_optimum_branching.cpp:36:47: required from here /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:107:22: note: in a call to non-static member function ‘boost::SignedInteger::~SignedInteger()’ 107 | template <> struct SignedInteger {}; | ^~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements >]’: /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:208:5: required from ‘struct boost::Convertible’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::Convertible]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied >::value’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_)>’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:515:9: required from ‘boost::InputIterator::~InputIterator() [with TT = long unsigned int*]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:502:3: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::InputIteratorConcept]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:50:7: required from ‘void boost::function_requires(Model*) [with Model = InputIteratorConcept]’ edmonds_optimum_branching_impl.hpp:526:62: required from ‘void edmonds_optimum_branching(TEdgeListGraph&, TVertexIndexMap, TWeightMap, TInputIterator, TInputIterator, TOutputIterator) [with bool TOptimumIsMaximum = true; bool TAttemptToSpan = false; bool TGraphIsDense = false; TEdgeListGraph = R_adjacency_list; TVertexIndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>; TWeightMap = boost::adj_list_edge_property_map, boost::edge_weight_t>; TInputIterator = long unsigned int*; TOutputIterator = std::back_insert_iterator > >]’ edmonds_optimum_branching.cpp:36:47: required from here /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::Convertible]’ 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ^ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::Convertible]’: /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:515:9: required from ‘boost::InputIterator::~InputIterator() [with TT = long unsigned int*]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:502:3: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::InputIteratorConcept]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:50:7: required from ‘void boost::function_requires(Model*) [with Model = InputIteratorConcept]’ edmonds_optimum_branching_impl.hpp:526:62: required from ‘void edmonds_optimum_branching(TEdgeListGraph&, TVertexIndexMap, TWeightMap, TInputIterator, TInputIterator, TOutputIterator) [with bool TOptimumIsMaximum = true; bool TAttemptToSpan = false; bool TGraphIsDense = false; TEdgeListGraph = R_adjacency_list; TVertexIndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>; TWeightMap = boost::adj_list_edge_property_map, boost::edge_weight_t>; TInputIterator = long unsigned int*; TOutputIterator = std::back_insert_iterator > >]’ edmonds_optimum_branching.cpp:36:47: required from here /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::Convertible::~Convertible() [with X = std::random_access_iterator_tag; Y = std::input_iterator_tag]’ 37 | ~model() | ^ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:208:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 208 | BOOST_CONCEPT_USAGE(Convertible) { | ^~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements >]’: /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:137:5: required from ‘struct boost::DefaultConstructible’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::DefaultConstructible]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied >::value’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_)>’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/graph_concepts.hpp:68:9: [ skipping 7 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied > >::value’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied > >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_ >)>’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:50:7: required from ‘void boost::function_requires(Model*) [with Model = concepts::EdgeListGraphConcept >]’ edmonds_optimum_branching_impl.hpp:523:62: required from ‘void edmonds_optimum_branching(TEdgeListGraph&, TVertexIndexMap, TWeightMap, TInputIterator, TInputIterator, TOutputIterator) [with bool TOptimumIsMaximum = true; bool TAttemptToSpan = false; bool TGraphIsDense = false; TEdgeListGraph = R_adjacency_list; TVertexIndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>; TWeightMap = boost::adj_list_edge_property_map, boost::edge_weight_t>; TInputIterator = long unsigned int*; TOutputIterator = std::back_insert_iterator > >]’ edmonds_optimum_branching.cpp:36:47: required from here /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::DefaultConstructible]’ 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ^ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::DefaultConstructible]’: /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/graph_concepts.hpp:68:9: required from ‘boost::concepts::Graph::~Graph() [with G = R_adjacency_list]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/usage.hpp:20:48: required from ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::concepts::Graph >]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements > >]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/graph_concepts.hpp:66:5: required from ‘struct boost::concepts::Graph >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/graph_concepts.hpp:226:1: required from ‘struct boost::concepts::EdgeListGraph >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/graph_concepts.hpp:226:1: [ skipping 2 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied > >::value’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied > >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_ >)>’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:50:7: required from ‘void boost::function_requires(Model*) [with Model = concepts::EdgeListGraphConcept >]’ edmonds_optimum_branching_impl.hpp:523:62: required from ‘void edmonds_optimum_branching(TEdgeListGraph&, TVertexIndexMap, TWeightMap, TInputIterator, TInputIterator, TOutputIterator) [with bool TOptimumIsMaximum = true; bool TAttemptToSpan = false; bool TGraphIsDense = false; TEdgeListGraph = R_adjacency_list; TVertexIndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>; TWeightMap = boost::adj_list_edge_property_map, boost::edge_weight_t>; TInputIterator = long unsigned int*; TOutputIterator = std::back_insert_iterator > >]’ edmonds_optimum_branching.cpp:36:47: required from here /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::DefaultConstructible::~DefaultConstructible() [with TT = long unsigned int]’ 37 | ~model() | ^ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:137:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 137 | BOOST_CONCEPT_USAGE(DefaultConstructible) { | ^~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements >]’: /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:233:5: required from ‘struct boost::EqualityComparable’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::EqualityComparable]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied >::value’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_)>’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/graph_concepts.hpp:69:9: [ skipping 7 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied > >::value’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied > >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_ >)>’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:50:7: required from ‘void boost::function_requires(Model*) [with Model = concepts::EdgeListGraphConcept >]’ edmonds_optimum_branching_impl.hpp:523:62: required from ‘void edmonds_optimum_branching(TEdgeListGraph&, TVertexIndexMap, TWeightMap, TInputIterator, TInputIterator, TOutputIterator) [with bool TOptimumIsMaximum = true; bool TAttemptToSpan = false; bool TGraphIsDense = false; TEdgeListGraph = R_adjacency_list; TVertexIndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>; TWeightMap = boost::adj_list_edge_property_map, boost::edge_weight_t>; TInputIterator = long unsigned int*; TOutputIterator = std::back_insert_iterator > >]’ edmonds_optimum_branching.cpp:36:47: required from here /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::EqualityComparable]’ 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ^ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::EqualityComparable]’: /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/graph_concepts.hpp:69:9: required from ‘boost::concepts::Graph::~Graph() [with G = R_adjacency_list]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/usage.hpp:20:48: required from ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::concepts::Graph >]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements > >]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/graph_concepts.hpp:66:5: required from ‘struct boost::concepts::Graph >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/graph_concepts.hpp:226:1: required from ‘struct boost::concepts::EdgeListGraph >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/graph_concepts.hpp:226:1: [ skipping 2 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied > >::value’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied > >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_ >)>’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:50:7: required from ‘void boost::function_requires(Model*) [with Model = concepts::EdgeListGraphConcept >]’ edmonds_optimum_branching_impl.hpp:523:62: required from ‘void edmonds_optimum_branching(TEdgeListGraph&, TVertexIndexMap, TWeightMap, TInputIterator, TInputIterator, TOutputIterator) [with bool TOptimumIsMaximum = true; bool TAttemptToSpan = false; bool TGraphIsDense = false; TEdgeListGraph = R_adjacency_list; TVertexIndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>; TWeightMap = boost::adj_list_edge_property_map, boost::edge_weight_t>; TInputIterator = long unsigned int*; TOutputIterator = std::back_insert_iterator > >]’ edmonds_optimum_branching.cpp:36:47: required from here /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::EqualityComparable::~EqualityComparable() [with TT = long unsigned int]’ 37 | ~model() | ^ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:233:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 233 | BOOST_CONCEPT_USAGE(EqualityComparable) { | ^~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements >]’: /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:145:5: required from ‘struct boost::Assignable’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::Assignable]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied >::value’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_)>’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/graph_concepts.hpp:70:9: [ skipping 7 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied > >::value’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied > >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_ >)>’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:50:7: required from ‘void boost::function_requires(Model*) [with Model = concepts::EdgeListGraphConcept >]’ edmonds_optimum_branching_impl.hpp:523:62: required from ‘void edmonds_optimum_branching(TEdgeListGraph&, TVertexIndexMap, TWeightMap, TInputIterator, TInputIterator, TOutputIterator) [with bool TOptimumIsMaximum = true; bool TAttemptToSpan = false; bool TGraphIsDense = false; TEdgeListGraph = R_adjacency_list; TVertexIndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>; TWeightMap = boost::adj_list_edge_property_map, boost::edge_weight_t>; TInputIterator = long unsigned int*; TOutputIterator = std::back_insert_iterator > >]’ edmonds_optimum_branching.cpp:36:47: required from here /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::Assignable]’ 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ^ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::Assignable]’: /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/graph_concepts.hpp:70:9: required from ‘boost::concepts::Graph::~Graph() [with G = R_adjacency_list]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/usage.hpp:20:48: required from ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::concepts::Graph >]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements > >]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/graph_concepts.hpp:66:5: required from ‘struct boost::concepts::Graph >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/graph_concepts.hpp:226:1: required from ‘struct boost::concepts::EdgeListGraph >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/graph_concepts.hpp:226:1: [ skipping 2 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied > >::value’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied > >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_ >)>’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:50:7: required from ‘void boost::function_requires(Model*) [with Model = concepts::EdgeListGraphConcept >]’ edmonds_optimum_branching_impl.hpp:523:62: required from ‘void edmonds_optimum_branching(TEdgeListGraph&, TVertexIndexMap, TWeightMap, TInputIterator, TInputIterator, TOutputIterator) [with bool TOptimumIsMaximum = true; bool TAttemptToSpan = false; bool TGraphIsDense = false; TEdgeListGraph = R_adjacency_list; TVertexIndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>; TWeightMap = boost::adj_list_edge_property_map, boost::edge_weight_t>; TInputIterator = long unsigned int*; TOutputIterator = std::back_insert_iterator > >]’ edmonds_optimum_branching.cpp:36:47: required from here /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::Assignable::~Assignable() [with TT = long unsigned int]’ 37 | ~model() | ^ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:145:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 145 | BOOST_CONCEPT_USAGE(Assignable) { | ^~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::concepts::MultiPassInputIterator, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator >*, std::vector >, std::allocator > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::adjacency_list, boost::property, boost::no_property, boost::listS> > >]’: /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator >*, std::vector >, std::allocator > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::adjacency_list, boost::property, boost::no_property, boost::listS> > > >]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/graph_concepts.hpp:52:50: required from ‘struct boost::concepts::MultiPassInputIterator, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator >*, std::vector >, std::allocator > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::adjacency_list, boost::property, boost::no_property, boost::listS> > >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::concepts::MultiPassInputIterator, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator >*, std::vector >, std::allocator > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::adjacency_list, boost::property, boost::no_property, boost::listS> > >]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator >*, std::vector >, std::allocator > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::adjacency_list, boost::property, boost::no_property, boost::listS> > > >::value’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator >*, std::vector >, std::allocator > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::adjacency_list, boost::property, boost::no_property, boost::listS> > > >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator >*, std::vector >, std::allocator > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::adjacency_list, boost::property, boost::no_property, boost::listS> > >)>’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/graph_concepts.hpp:235:9: required from ‘boost::concepts::EdgeListGraph::~EdgeListGraph() [with G = R_adjacency_list]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/graph_concepts.hpp:226:1: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::EdgeListGraphConcept >]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:50:7: required from ‘void boost::function_requires(Model*) [with Model = concepts::EdgeListGraphConcept >]’ edmonds_optimum_branching_impl.hpp:523:62: required from ‘void edmonds_optimum_branching(TEdgeListGraph&, TVertexIndexMap, TWeightMap, TInputIterator, TInputIterator, TOutputIterator) [with bool TOptimumIsMaximum = true; bool TAttemptToSpan = false; bool TGraphIsDense = false; TEdgeListGraph = R_adjacency_list; TVertexIndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>; TWeightMap = boost::adj_list_edge_property_map, boost::edge_weight_t>; TInputIterator = long unsigned int*; TOutputIterator = std::back_insert_iterator > >]’ edmonds_optimum_branching.cpp:36:47: required from here /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::concepts::MultiPassInputIterator::~MultiPassInputIterator() [with T = boost::detail::adj_list_edge_iterator, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator >*, std::vector >, std::allocator > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::adjacency_list, boost::property, boost::no_property, boost::listS> >]’ 37 | ~model() | ^ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/graph_concepts.hpp:52:50: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 52 | BOOST_concept(MultiPassInputIterator, (T)) { BOOST_CONCEPT_USAGE( | ^~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::DefaultConstructible >]’: /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements > >]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:137:5: required from ‘struct boost::DefaultConstructible >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::DefaultConstructible >]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied > >::value’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied > >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_ >)>’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/graph_concepts.hpp:90:9: required from ‘boost::concepts::EdgeListGraph::~EdgeListGraph() [with G = R_adjacency_list]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/graph_concepts.hpp:226:1: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::EdgeListGraphConcept >]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:50:7: required from ‘void boost::function_requires(Model*) [with Model = concepts::EdgeListGraphConcept >]’ edmonds_optimum_branching_impl.hpp:523:62: required from ‘void edmonds_optimum_branching(TEdgeListGraph&, TVertexIndexMap, TWeightMap, TInputIterator, TInputIterator, TOutputIterator) [with bool TOptimumIsMaximum = true; bool TAttemptToSpan = false; bool TGraphIsDense = false; TEdgeListGraph = R_adjacency_list; TVertexIndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>; TWeightMap = boost::adj_list_edge_property_map, boost::edge_weight_t>; TInputIterator = long unsigned int*; TOutputIterator = std::back_insert_iterator > >]’ edmonds_optimum_branching.cpp:36:47: required from here /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::DefaultConstructible::~DefaultConstructible() [with TT = boost::detail::edge_desc_impl]’ 37 | ~model() | ^ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:137:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 137 | BOOST_CONCEPT_USAGE(DefaultConstructible) { | ^~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::EqualityComparable >]’: /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements > >]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:233:5: required from ‘struct boost::EqualityComparable >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::EqualityComparable >]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied > >::value’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied > >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_ >)>’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/graph_concepts.hpp:91:9: required from ‘boost::concepts::EdgeListGraph::~EdgeListGraph() [with G = R_adjacency_list]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/graph_concepts.hpp:226:1: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::EdgeListGraphConcept >]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:50:7: required from ‘void boost::function_requires(Model*) [with Model = concepts::EdgeListGraphConcept >]’ edmonds_optimum_branching_impl.hpp:523:62: required from ‘void edmonds_optimum_branching(TEdgeListGraph&, TVertexIndexMap, TWeightMap, TInputIterator, TInputIterator, TOutputIterator) [with bool TOptimumIsMaximum = true; bool TAttemptToSpan = false; bool TGraphIsDense = false; TEdgeListGraph = R_adjacency_list; TVertexIndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>; TWeightMap = boost::adj_list_edge_property_map, boost::edge_weight_t>; TInputIterator = long unsigned int*; TOutputIterator = std::back_insert_iterator > >]’ edmonds_optimum_branching.cpp:36:47: required from here /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::EqualityComparable::~EqualityComparable() [with TT = boost::detail::edge_desc_impl]’ 37 | ~model() | ^ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:233:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 233 | BOOST_CONCEPT_USAGE(EqualityComparable) { | ^~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::Assignable >]’: /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements > >]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:145:5: required from ‘struct boost::Assignable >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::Assignable >]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied > >::value’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied > >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_ >)>’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/graph_concepts.hpp:92:9: required from ‘boost::concepts::EdgeListGraph::~EdgeListGraph() [with G = R_adjacency_list]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/graph_concepts.hpp:226:1: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::EdgeListGraphConcept >]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:50:7: required from ‘void boost::function_requires(Model*) [with Model = concepts::EdgeListGraphConcept >]’ edmonds_optimum_branching_impl.hpp:523:62: required from ‘void edmonds_optimum_branching(TEdgeListGraph&, TVertexIndexMap, TWeightMap, TInputIterator, TInputIterator, TOutputIterator) [with bool TOptimumIsMaximum = true; bool TAttemptToSpan = false; bool TGraphIsDense = false; TEdgeListGraph = R_adjacency_list; TVertexIndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>; TWeightMap = boost::adj_list_edge_property_map, boost::edge_weight_t>; TInputIterator = long unsigned int*; TOutputIterator = std::back_insert_iterator > >]’ edmonds_optimum_branching.cpp:36:47: required from here /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::Assignable::~Assignable() [with TT = boost::detail::edge_desc_impl]’ 37 | ~model() | ^ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:145:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 145 | BOOST_CONCEPT_USAGE(Assignable) { | ^~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::Convertible]’: /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements >]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:208:5: required from ‘struct boost::Convertible’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::Convertible]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied >::value’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_)>’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/graph_concepts.hpp:239:9: required from ‘boost::concepts::EdgeListGraph::~EdgeListGraph() [with G = R_adjacency_list]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/graph_concepts.hpp:226:1: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::EdgeListGraphConcept >]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:50:7: required from ‘void boost::function_requires(Model*) [with Model = concepts::EdgeListGraphConcept >]’ edmonds_optimum_branching_impl.hpp:523:62: required from ‘void edmonds_optimum_branching(TEdgeListGraph&, TVertexIndexMap, TWeightMap, TInputIterator, TInputIterator, TOutputIterator) [with bool TOptimumIsMaximum = true; bool TAttemptToSpan = false; bool TGraphIsDense = false; TEdgeListGraph = R_adjacency_list; TVertexIndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>; TWeightMap = boost::adj_list_edge_property_map, boost::edge_weight_t>; TInputIterator = long unsigned int*; TOutputIterator = std::back_insert_iterator > >]’ edmonds_optimum_branching.cpp:36:47: required from here /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::Convertible::~Convertible() [with X = boost::adj_list_dir_traversal_tag; Y = boost::edge_list_graph_tag]’ 37 | ~model() | ^ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:208:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 208 | BOOST_CONCEPT_USAGE(Convertible) { | ^~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::Convertible]’: /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements >]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:208:5: required from ‘struct boost::Convertible’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::Convertible]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied >::value’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_)>’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:515:9: required from ‘boost::InputIterator::~InputIterator() [with TT = long unsigned int*]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:502:3: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::InputIteratorConcept]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:50:7: required from ‘void boost::function_requires(Model*) [with Model = InputIteratorConcept]’ edmonds_optimum_branching_impl.hpp:526:62: required from ‘void edmonds_optimum_branching(TEdgeListGraph&, TVertexIndexMap, TWeightMap, TInputIterator, TInputIterator, TOutputIterator) [with bool TOptimumIsMaximum = true; bool TAttemptToSpan = false; bool TGraphIsDense = false; TEdgeListGraph = R_adjacency_list; TVertexIndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>; TWeightMap = boost::adj_list_edge_property_map, boost::edge_weight_t>; TInputIterator = long unsigned int*; TOutputIterator = std::back_insert_iterator > >]’ edmonds_optimum_branching.cpp:36:47: required from here /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::Convertible::~Convertible() [with X = std::random_access_iterator_tag; Y = std::input_iterator_tag]’ 37 | ~model() | ^ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:208:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 208 | BOOST_CONCEPT_USAGE(Convertible) { | ^~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::DefaultConstructible]’: /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements >]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:137:5: required from ‘struct boost::DefaultConstructible’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::DefaultConstructible]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied >::value’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:72:8: [ skipping 8 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied > >::value’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied > >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_ >)>’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:50:7: required from ‘void boost::function_requires(Model*) [with Model = concepts::EdgeListGraphConcept >]’ edmonds_optimum_branching_impl.hpp:523:62: required from ‘void edmonds_optimum_branching(TEdgeListGraph&, TVertexIndexMap, TWeightMap, TInputIterator, TInputIterator, TOutputIterator) [with bool TOptimumIsMaximum = true; bool TAttemptToSpan = false; bool TGraphIsDense = false; TEdgeListGraph = R_adjacency_list; TVertexIndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>; TWeightMap = boost::adj_list_edge_property_map, boost::edge_weight_t>; TInputIterator = long unsigned int*; TOutputIterator = std::back_insert_iterator > >]’ edmonds_optimum_branching.cpp:36:47: required from here /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::DefaultConstructible::~DefaultConstructible() [with TT = long unsigned int]’ 37 | ~model() | ^ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:137:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 137 | BOOST_CONCEPT_USAGE(DefaultConstructible) { | ^~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::EqualityComparable]’: /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements >]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:233:5: required from ‘struct boost::EqualityComparable’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::EqualityComparable]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied >::value’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:72:8: [ skipping 8 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied > >::value’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied > >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_ >)>’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:50:7: required from ‘void boost::function_requires(Model*) [with Model = concepts::EdgeListGraphConcept >]’ edmonds_optimum_branching_impl.hpp:523:62: required from ‘void edmonds_optimum_branching(TEdgeListGraph&, TVertexIndexMap, TWeightMap, TInputIterator, TInputIterator, TOutputIterator) [with bool TOptimumIsMaximum = true; bool TAttemptToSpan = false; bool TGraphIsDense = false; TEdgeListGraph = R_adjacency_list; TVertexIndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>; TWeightMap = boost::adj_list_edge_property_map, boost::edge_weight_t>; TInputIterator = long unsigned int*; TOutputIterator = std::back_insert_iterator > >]’ edmonds_optimum_branching.cpp:36:47: required from here /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::EqualityComparable::~EqualityComparable() [with TT = long unsigned int]’ 37 | ~model() | ^ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:233:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 233 | BOOST_CONCEPT_USAGE(EqualityComparable) { | ^~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::Assignable]’: /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements >]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:145:5: required from ‘struct boost::Assignable’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::Assignable]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied >::value’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:72:8: [ skipping 8 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied > >::value’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied > >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_ >)>’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:50:7: required from ‘void boost::function_requires(Model*) [with Model = concepts::EdgeListGraphConcept >]’ edmonds_optimum_branching_impl.hpp:523:62: required from ‘void edmonds_optimum_branching(TEdgeListGraph&, TVertexIndexMap, TWeightMap, TInputIterator, TInputIterator, TOutputIterator) [with bool TOptimumIsMaximum = true; bool TAttemptToSpan = false; bool TGraphIsDense = false; TEdgeListGraph = R_adjacency_list; TVertexIndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>; TWeightMap = boost::adj_list_edge_property_map, boost::edge_weight_t>; TInputIterator = long unsigned int*; TOutputIterator = std::back_insert_iterator > >]’ edmonds_optimum_branching.cpp:36:47: required from here /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::Assignable::~Assignable() [with TT = long unsigned int]’ 37 | ~model() | ^ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:145:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 145 | BOOST_CONCEPT_USAGE(Assignable) { | ^~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator >*, std::vector >, std::allocator > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::adjacency_list, boost::property, boost::no_property, boost::listS> > > >]’: /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:145:5: required from ‘struct boost::Assignable, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator >*, std::vector >, std::allocator > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::adjacency_list, boost::property, boost::no_property, boost::listS> > >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:502:3: required from ‘struct boost::InputIterator, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator >*, std::vector >, std::allocator > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::adjacency_list, boost::property, boost::no_property, boost::listS> > >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::InputIterator, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator >*, std::vector >, std::allocator > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::adjacency_list, boost::property, boost::no_property, boost::listS> > >]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator >*, std::vector >, std::allocator > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::adjacency_list, boost::property, boost::no_property, boost::listS> > > >::value’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator >*, std::vector >, std::allocator > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::adjacency_list, boost::property, boost::no_property, boost::listS> > > >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:72:8: [ skipping 2 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::MultiPassInputIterator, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator >*, std::vector >, std::allocator > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::adjacency_list, boost::property, boost::no_property, boost::listS> > >]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/graph_concepts.hpp:235:9: required from ‘boost::concepts::EdgeListGraph::~EdgeListGraph() [with G = R_adjacency_list]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/graph_concepts.hpp:226:1: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::EdgeListGraphConcept >]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:50:7: required from ‘void boost::function_requires(Model*) [with Model = concepts::EdgeListGraphConcept >]’ edmonds_optimum_branching_impl.hpp:523:62: required from ‘void edmonds_optimum_branching(TEdgeListGraph&, TVertexIndexMap, TWeightMap, TInputIterator, TInputIterator, TOutputIterator) [with bool TOptimumIsMaximum = true; bool TAttemptToSpan = false; bool TGraphIsDense = false; TEdgeListGraph = R_adjacency_list; TVertexIndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>; TWeightMap = boost::adj_list_edge_property_map, boost::edge_weight_t>; TInputIterator = long unsigned int*; TOutputIterator = std::back_insert_iterator > >]’ edmonds_optimum_branching.cpp:36:47: required from here /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::Assignable, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator >*, std::vector >, std::allocator > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::adjacency_list, boost::property, boost::no_property, boost::listS> > >]’ 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ^ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator >*, std::vector >, std::allocator > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::adjacency_list, boost::property, boost::no_property, boost::listS> > > >]’: /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:233:5: required from ‘struct boost::EqualityComparable, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator >*, std::vector >, std::allocator > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::adjacency_list, boost::property, boost::no_property, boost::listS> > >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:502:3: required from ‘struct boost::InputIterator, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator >*, std::vector >, std::allocator > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::adjacency_list, boost::property, boost::no_property, boost::listS> > >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::InputIterator, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator >*, std::vector >, std::allocator > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::adjacency_list, boost::property, boost::no_property, boost::listS> > >]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator >*, std::vector >, std::allocator > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::adjacency_list, boost::property, boost::no_property, boost::listS> > > >::value’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator >*, std::vector >, std::allocator > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::adjacency_list, boost::property, boost::no_property, boost::listS> > > >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:72:8: [ skipping 2 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::MultiPassInputIterator, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator >*, std::vector >, std::allocator > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::adjacency_list, boost::property, boost::no_property, boost::listS> > >]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/graph_concepts.hpp:235:9: required from ‘boost::concepts::EdgeListGraph::~EdgeListGraph() [with G = R_adjacency_list]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/graph_concepts.hpp:226:1: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::EdgeListGraphConcept >]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:50:7: required from ‘void boost::function_requires(Model*) [with Model = concepts::EdgeListGraphConcept >]’ edmonds_optimum_branching_impl.hpp:523:62: required from ‘void edmonds_optimum_branching(TEdgeListGraph&, TVertexIndexMap, TWeightMap, TInputIterator, TInputIterator, TOutputIterator) [with bool TOptimumIsMaximum = true; bool TAttemptToSpan = false; bool TGraphIsDense = false; TEdgeListGraph = R_adjacency_list; TVertexIndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>; TWeightMap = boost::adj_list_edge_property_map, boost::edge_weight_t>; TInputIterator = long unsigned int*; TOutputIterator = std::back_insert_iterator > >]’ edmonds_optimum_branching.cpp:36:47: required from here /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::EqualityComparable, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator >*, std::vector >, std::allocator > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::adjacency_list, boost::property, boost::no_property, boost::listS> > >]’ 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ^ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator >*, std::vector >, std::allocator > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::adjacency_list, boost::property, boost::no_property, boost::listS> > > >]’: /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:512:7: required from ‘struct boost::InputIterator, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator >*, std::vector >, std::allocator > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::adjacency_list, boost::property, boost::no_property, boost::listS> > >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::InputIterator, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator >*, std::vector >, std::allocator > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::adjacency_list, boost::property, boost::no_property, boost::listS> > >]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator >*, std::vector >, std::allocator > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::adjacency_list, boost::property, boost::no_property, boost::listS> > > >::value’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator >*, std::vector >, std::allocator > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::adjacency_list, boost::property, boost::no_property, boost::listS> > > >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:72:8: [ skipping 2 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::MultiPassInputIterator, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator >*, std::vector >, std::allocator > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::adjacency_list, boost::property, boost::no_property, boost::listS> > >]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/graph_concepts.hpp:235:9: required from ‘boost::concepts::EdgeListGraph::~EdgeListGraph() [with G = R_adjacency_list]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/graph_concepts.hpp:226:1: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::EdgeListGraphConcept >]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:50:7: required from ‘void boost::function_requires(Model*) [with Model = concepts::EdgeListGraphConcept >]’ edmonds_optimum_branching_impl.hpp:523:62: required from ‘void edmonds_optimum_branching(TEdgeListGraph&, TVertexIndexMap, TWeightMap, TInputIterator, TInputIterator, TOutputIterator) [with bool TOptimumIsMaximum = true; bool TAttemptToSpan = false; bool TGraphIsDense = false; TEdgeListGraph = R_adjacency_list; TVertexIndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>; TWeightMap = boost::adj_list_edge_property_map, boost::edge_weight_t>; TInputIterator = long unsigned int*; TOutputIterator = std::back_insert_iterator > >]’ edmonds_optimum_branching.cpp:36:47: required from here /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::InputIterator, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator >*, std::vector >, std::allocator > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::adjacency_list, boost::property, boost::no_property, boost::listS> > >]’ 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ^ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::InputIterator, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator >*, std::vector >, std::allocator > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::adjacency_list, boost::property, boost::no_property, boost::listS> > >]’: /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/graph_concepts.hpp:53:35: required from ‘boost::concepts::MultiPassInputIterator::~MultiPassInputIterator() [with T = boost::detail::adj_list_edge_iterator, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator >*, std::vector >, std::allocator > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::adjacency_list, boost::property, boost::no_property, boost::listS> >]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::MultiPassInputIterator, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator >*, std::vector >, std::allocator > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::adjacency_list, boost::property, boost::no_property, boost::listS> > >]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/graph_concepts.hpp:235:9: required from ‘boost::concepts::EdgeListGraph::~EdgeListGraph() [with G = R_adjacency_list]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/graph_concepts.hpp:226:1: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::EdgeListGraphConcept >]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:50:7: required from ‘void boost::function_requires(Model*) [with Model = concepts::EdgeListGraphConcept >]’ edmonds_optimum_branching_impl.hpp:523:62: required from ‘void edmonds_optimum_branching(TEdgeListGraph&, TVertexIndexMap, TWeightMap, TInputIterator, TInputIterator, TOutputIterator) [with bool TOptimumIsMaximum = true; bool TAttemptToSpan = false; bool TGraphIsDense = false; TEdgeListGraph = R_adjacency_list; TVertexIndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>; TWeightMap = boost::adj_list_edge_property_map, boost::edge_weight_t>; TInputIterator = long unsigned int*; TOutputIterator = std::back_insert_iterator > >]’ edmonds_optimum_branching.cpp:36:47: required from here /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::InputIterator::~InputIterator() [with TT = boost::detail::adj_list_edge_iterator, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator >*, std::vector >, std::allocator > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::adjacency_list, boost::property, boost::no_property, boost::listS> >]’ 37 | ~model() | ^ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:512:7: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 512 | BOOST_CONCEPT_USAGE(InputIterator) | ^~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::Assignable, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator >*, std::vector >, std::allocator > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::adjacency_list, boost::property, boost::no_property, boost::listS> > >]’: /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator >*, std::vector >, std::allocator > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::adjacency_list, boost::property, boost::no_property, boost::listS> > > >]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:145:5: required from ‘struct boost::Assignable, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator >*, std::vector >, std::allocator > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::adjacency_list, boost::property, boost::no_property, boost::listS> > >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:502:3: required from ‘struct boost::InputIterator, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator >*, std::vector >, std::allocator > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::adjacency_list, boost::property, boost::no_property, boost::listS> > >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::InputIterator, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator >*, std::vector >, std::allocator > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::adjacency_list, boost::property, boost::no_property, boost::listS> > >]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator >*, std::vector >, std::allocator > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::adjacency_list, boost::property, boost::no_property, boost::listS> > > >::value’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:45:51: [ skipping 3 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::MultiPassInputIterator, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator >*, std::vector >, std::allocator > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::adjacency_list, boost::property, boost::no_property, boost::listS> > >]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/graph_concepts.hpp:235:9: required from ‘boost::concepts::EdgeListGraph::~EdgeListGraph() [with G = R_adjacency_list]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/graph_concepts.hpp:226:1: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::EdgeListGraphConcept >]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:50:7: required from ‘void boost::function_requires(Model*) [with Model = concepts::EdgeListGraphConcept >]’ edmonds_optimum_branching_impl.hpp:523:62: required from ‘void edmonds_optimum_branching(TEdgeListGraph&, TVertexIndexMap, TWeightMap, TInputIterator, TInputIterator, TOutputIterator) [with bool TOptimumIsMaximum = true; bool TAttemptToSpan = false; bool TGraphIsDense = false; TEdgeListGraph = R_adjacency_list; TVertexIndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>; TWeightMap = boost::adj_list_edge_property_map, boost::edge_weight_t>; TInputIterator = long unsigned int*; TOutputIterator = std::back_insert_iterator > >]’ edmonds_optimum_branching.cpp:36:47: required from here /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::Assignable::~Assignable() [with TT = boost::detail::adj_list_edge_iterator, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator >*, std::vector >, std::allocator > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::adjacency_list, boost::property, boost::no_property, boost::listS> >]’ 37 | ~model() | ^ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:145:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 145 | BOOST_CONCEPT_USAGE(Assignable) { | ^~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::EqualityComparable, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator >*, std::vector >, std::allocator > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::adjacency_list, boost::property, boost::no_property, boost::listS> > >]’: /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator >*, std::vector >, std::allocator > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::adjacency_list, boost::property, boost::no_property, boost::listS> > > >]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:233:5: required from ‘struct boost::EqualityComparable, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator >*, std::vector >, std::allocator > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::adjacency_list, boost::property, boost::no_property, boost::listS> > >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:502:3: required from ‘struct boost::InputIterator, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator >*, std::vector >, std::allocator > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::adjacency_list, boost::property, boost::no_property, boost::listS> > >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::InputIterator, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator >*, std::vector >, std::allocator > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::adjacency_list, boost::property, boost::no_property, boost::listS> > >]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator >*, std::vector >, std::allocator > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::adjacency_list, boost::property, boost::no_property, boost::listS> > > >::value’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:45:51: [ skipping 3 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::MultiPassInputIterator, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator >*, std::vector >, std::allocator > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::adjacency_list, boost::property, boost::no_property, boost::listS> > >]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/graph_concepts.hpp:235:9: required from ‘boost::concepts::EdgeListGraph::~EdgeListGraph() [with G = R_adjacency_list]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/graph_concepts.hpp:226:1: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::EdgeListGraphConcept >]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:50:7: required from ‘void boost::function_requires(Model*) [with Model = concepts::EdgeListGraphConcept >]’ edmonds_optimum_branching_impl.hpp:523:62: required from ‘void edmonds_optimum_branching(TEdgeListGraph&, TVertexIndexMap, TWeightMap, TInputIterator, TInputIterator, TOutputIterator) [with bool TOptimumIsMaximum = true; bool TAttemptToSpan = false; bool TGraphIsDense = false; TEdgeListGraph = R_adjacency_list; TVertexIndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>; TWeightMap = boost::adj_list_edge_property_map, boost::edge_weight_t>; TInputIterator = long unsigned int*; TOutputIterator = std::back_insert_iterator > >]’ edmonds_optimum_branching.cpp:36:47: required from here /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::EqualityComparable::~EqualityComparable() [with TT = boost::detail::adj_list_edge_iterator, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator >*, std::vector >, std::allocator > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::adjacency_list, boost::property, boost::no_property, boost::listS> >]’ 37 | ~model() | ^ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:233:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 233 | BOOST_CONCEPT_USAGE(EqualityComparable) { | ^~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::InputIterator, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator >*, std::vector >, std::allocator > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::adjacency_list, boost::property, boost::no_property, boost::listS> > >]’: /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator >*, std::vector >, std::allocator > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::adjacency_list, boost::property, boost::no_property, boost::listS> > > >]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:512:7: required from ‘struct boost::InputIterator, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator >*, std::vector >, std::allocator > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::adjacency_list, boost::property, boost::no_property, boost::listS> > >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::InputIterator, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator >*, std::vector >, std::allocator > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::adjacency_list, boost::property, boost::no_property, boost::listS> > >]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator >*, std::vector >, std::allocator > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::adjacency_list, boost::property, boost::no_property, boost::listS> > > >::value’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator >*, std::vector >, std::allocator > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::adjacency_list, boost::property, boost::no_property, boost::listS> > > >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:72:8: [ skipping 2 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::MultiPassInputIterator, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator >*, std::vector >, std::allocator > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::adjacency_list, boost::property, boost::no_property, boost::listS> > >]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/graph_concepts.hpp:235:9: required from ‘boost::concepts::EdgeListGraph::~EdgeListGraph() [with G = R_adjacency_list]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/graph_concepts.hpp:226:1: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::EdgeListGraphConcept >]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:50:7: required from ‘void boost::function_requires(Model*) [with Model = concepts::EdgeListGraphConcept >]’ edmonds_optimum_branching_impl.hpp:523:62: required from ‘void edmonds_optimum_branching(TEdgeListGraph&, TVertexIndexMap, TWeightMap, TInputIterator, TInputIterator, TOutputIterator) [with bool TOptimumIsMaximum = true; bool TAttemptToSpan = false; bool TGraphIsDense = false; TEdgeListGraph = R_adjacency_list; TVertexIndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>; TWeightMap = boost::adj_list_edge_property_map, boost::edge_weight_t>; TInputIterator = long unsigned int*; TOutputIterator = std::back_insert_iterator > >]’ edmonds_optimum_branching.cpp:36:47: required from here /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::InputIterator::~InputIterator() [with TT = boost::detail::adj_list_edge_iterator, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator >*, std::vector >, std::allocator > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::adjacency_list, boost::property, boost::no_property, boost::listS> >]’ 37 | ~model() | ^ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:512:7: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 512 | BOOST_CONCEPT_USAGE(InputIterator) | ^~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements >]’: /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:208:5: required from ‘struct boost::Convertible’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::Convertible]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied >::value’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_)>’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:515:9: [ skipping 3 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::MultiPassInputIterator, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator >*, std::vector >, std::allocator > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::adjacency_list, boost::property, boost::no_property, boost::listS> > >]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/graph_concepts.hpp:235:9: required from ‘boost::concepts::EdgeListGraph::~EdgeListGraph() [with G = R_adjacency_list]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/graph_concepts.hpp:226:1: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::EdgeListGraphConcept >]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:50:7: required from ‘void boost::function_requires(Model*) [with Model = concepts::EdgeListGraphConcept >]’ edmonds_optimum_branching_impl.hpp:523:62: required from ‘void edmonds_optimum_branching(TEdgeListGraph&, TVertexIndexMap, TWeightMap, TInputIterator, TInputIterator, TOutputIterator) [with bool TOptimumIsMaximum = true; bool TAttemptToSpan = false; bool TGraphIsDense = false; TEdgeListGraph = R_adjacency_list; TVertexIndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>; TWeightMap = boost::adj_list_edge_property_map, boost::edge_weight_t>; TInputIterator = long unsigned int*; TOutputIterator = std::back_insert_iterator > >]’ edmonds_optimum_branching.cpp:36:47: required from here /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::Convertible]’ 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ^ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::Convertible]’: /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:515:9: required from ‘boost::InputIterator::~InputIterator() [with TT = boost::detail::adj_list_edge_iterator, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator >*, std::vector >, std::allocator > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::adjacency_list, boost::property, boost::no_property, boost::listS> >]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::InputIterator, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator >*, std::vector >, std::allocator > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::adjacency_list, boost::property, boost::no_property, boost::listS> > >]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/graph_concepts.hpp:53:35: required from ‘boost::concepts::MultiPassInputIterator::~MultiPassInputIterator() [with T = boost::detail::adj_list_edge_iterator, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator >*, std::vector >, std::allocator > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::adjacency_list, boost::property, boost::no_property, boost::listS> >]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::MultiPassInputIterator, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator >*, std::vector >, std::allocator > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::adjacency_list, boost::property, boost::no_property, boost::listS> > >]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/graph_concepts.hpp:235:9: required from ‘boost::concepts::EdgeListGraph::~EdgeListGraph() [with G = R_adjacency_list]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/graph_concepts.hpp:226:1: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::EdgeListGraphConcept >]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:50:7: required from ‘void boost::function_requires(Model*) [with Model = concepts::EdgeListGraphConcept >]’ edmonds_optimum_branching_impl.hpp:523:62: required from ‘void edmonds_optimum_branching(TEdgeListGraph&, TVertexIndexMap, TWeightMap, TInputIterator, TInputIterator, TOutputIterator) [with bool TOptimumIsMaximum = true; bool TAttemptToSpan = false; bool TGraphIsDense = false; TEdgeListGraph = R_adjacency_list; TVertexIndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>; TWeightMap = boost::adj_list_edge_property_map, boost::edge_weight_t>; TInputIterator = long unsigned int*; TOutputIterator = std::back_insert_iterator > >]’ edmonds_optimum_branching.cpp:36:47: required from here /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::Convertible::~Convertible() [with X = std::forward_iterator_tag; Y = std::input_iterator_tag]’ 37 | ~model() | ^ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:208:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 208 | BOOST_CONCEPT_USAGE(Convertible) { | ^~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::Convertible]’: /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements >]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:208:5: required from ‘struct boost::Convertible’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::Convertible]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied >::value’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:72:8: [ skipping 4 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::MultiPassInputIterator, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator >*, std::vector >, std::allocator > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::adjacency_list, boost::property, boost::no_property, boost::listS> > >]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/graph_concepts.hpp:235:9: required from ‘boost::concepts::EdgeListGraph::~EdgeListGraph() [with G = R_adjacency_list]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/graph_concepts.hpp:226:1: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::EdgeListGraphConcept >]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:50:7: required from ‘void boost::function_requires(Model*) [with Model = concepts::EdgeListGraphConcept >]’ edmonds_optimum_branching_impl.hpp:523:62: required from ‘void edmonds_optimum_branching(TEdgeListGraph&, TVertexIndexMap, TWeightMap, TInputIterator, TInputIterator, TOutputIterator) [with bool TOptimumIsMaximum = true; bool TAttemptToSpan = false; bool TGraphIsDense = false; TEdgeListGraph = R_adjacency_list; TVertexIndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>; TWeightMap = boost::adj_list_edge_property_map, boost::edge_weight_t>; TInputIterator = long unsigned int*; TOutputIterator = std::back_insert_iterator > >]’ edmonds_optimum_branching.cpp:36:47: required from here /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::Convertible::~Convertible() [with X = std::forward_iterator_tag; Y = std::input_iterator_tag]’ 37 | ~model() | ^ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:208:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 208 | BOOST_CONCEPT_USAGE(Convertible) { | ^~~~~~~~~~~~~~~~~~~ g++ -std=gnu++17 -I"/usr/share/R/include" -DNDEBUG -I'/home/omnipath/local/R/4.4-3.20/BH/include' -fpic -g -O2 -fno-omit-frame-pointer -mno-omit-leaf-frame-pointer -ffile-prefix-map=/build/r-base-EawLoD/r-base-4.4.1=. -fstack-protector-strong -fstack-clash-protection -Wformat -Werror=format-security -fcf-protection -fdebug-prefix-map=/build/r-base-EawLoD/r-base-4.4.1=/usr/src/r-base-4.4.1-1.2404.0 -Wdate-time -D_FORTIFY_SOURCE=3 -c hcs.cpp -o hcs.o In file included from /home/omnipath/local/R/4.4-3.20/BH/include/boost/smart_ptr/shared_ptr.hpp:18, from /home/omnipath/local/R/4.4-3.20/BH/include/boost/property_map/vector_property_map.hpp:14, from /home/omnipath/local/R/4.4-3.20/BH/include/boost/property_map/property_map.hpp:598, from RBGL.hpp:17, from hcs.cpp:1: /home/omnipath/local/R/4.4-3.20/BH/include/boost/smart_ptr/detail/shared_count.hpp:361:33: warning: ‘template class std::auto_ptr’ is deprecated: use 'std::unique_ptr' instead [-Wdeprecated-declarations] 361 | explicit shared_count( std::auto_ptr & r ): pi_( new sp_counted_impl_p( r.get() ) ) | ^~~~~~~~ In file included from /usr/include/c++/13/memory:78, from /home/omnipath/local/R/4.4-3.20/BH/include/boost/smart_ptr/detail/sp_counted_impl.hpp:35, from /home/omnipath/local/R/4.4-3.20/BH/include/boost/smart_ptr/detail/shared_count.hpp:27: /usr/include/c++/13/bits/unique_ptr.h:65:28: note: declared here 65 | template class auto_ptr; | ^~~~~~~~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/smart_ptr/shared_ptr.hpp:251:65: warning: ‘template class std::auto_ptr’ is deprecated: use 'std::unique_ptr' instead [-Wdeprecated-declarations] 251 | template< class T, class R > struct sp_enable_if_auto_ptr< std::auto_ptr< T >, R > | ^~~~~~~~ /usr/include/c++/13/bits/unique_ptr.h:65:28: note: declared here 65 | template class auto_ptr; | ^~~~~~~~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/smart_ptr/shared_ptr.hpp:508:31: warning: ‘template class std::auto_ptr’ is deprecated: use 'std::unique_ptr' instead [-Wdeprecated-declarations] 508 | explicit shared_ptr( std::auto_ptr & r ): px(r.get()), pn() | ^~~~~~~~ /usr/include/c++/13/bits/unique_ptr.h:65:28: note: declared here 65 | template class auto_ptr; | ^~~~~~~~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/smart_ptr/shared_ptr.hpp:521:22: warning: ‘template class std::auto_ptr’ is deprecated: use 'std::unique_ptr' instead [-Wdeprecated-declarations] 521 | shared_ptr( std::auto_ptr && r ): px(r.get()), pn() | ^~~~~~~~ /usr/include/c++/13/bits/unique_ptr.h:65:28: note: declared here 65 | template class auto_ptr; | ^~~~~~~~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/smart_ptr/shared_ptr.hpp:604:34: warning: ‘template class std::auto_ptr’ is deprecated: use 'std::unique_ptr' instead [-Wdeprecated-declarations] 604 | shared_ptr & operator=( std::auto_ptr & r ) | ^~~~~~~~ /usr/include/c++/13/bits/unique_ptr.h:65:28: note: declared here 65 | template class auto_ptr; | ^~~~~~~~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/smart_ptr/shared_ptr.hpp:613:34: warning: ‘template class std::auto_ptr’ is deprecated: use 'std::unique_ptr' instead [-Wdeprecated-declarations] 613 | shared_ptr & operator=( std::auto_ptr && r ) | ^~~~~~~~ /usr/include/c++/13/bits/unique_ptr.h:65:28: note: declared here 65 | template class auto_ptr; | ^~~~~~~~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/smart_ptr/shared_ptr.hpp: In member function ‘boost::shared_ptr& boost::shared_ptr::operator=(std::auto_ptr<_Up>&&)’: /home/omnipath/local/R/4.4-3.20/BH/include/boost/smart_ptr/shared_ptr.hpp:615:38: warning: ‘template class std::auto_ptr’ is deprecated: use 'std::unique_ptr' instead [-Wdeprecated-declarations] 615 | this_type( static_cast< std::auto_ptr && >( r ) ).swap( *this ); | ^~~~~~~~ /usr/include/c++/13/bits/unique_ptr.h:65:28: note: declared here 65 | template class auto_ptr; | ^~~~~~~~ In file included from /home/omnipath/local/R/4.4-3.20/BH/include/boost/scoped_ptr.hpp:13, from /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/adjacency_list.hpp:22, from RBGL.hpp:38: /home/omnipath/local/R/4.4-3.20/BH/include/boost/smart_ptr/scoped_ptr.hpp: At global scope: /home/omnipath/local/R/4.4-3.20/BH/include/boost/smart_ptr/scoped_ptr.hpp:75:31: warning: ‘template class std::auto_ptr’ is deprecated: use 'std::unique_ptr' instead [-Wdeprecated-declarations] 75 | explicit scoped_ptr( std::auto_ptr p ) BOOST_SP_NOEXCEPT : px( p.release() ) | ^~~~~~~~ /usr/include/c++/13/bits/unique_ptr.h:65:28: note: declared here 65 | template class auto_ptr; | ^~~~~~~~ In file included from /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/assert.hpp:35, from /home/omnipath/local/R/4.4-3.20/BH/include/boost/property_map/property_map.hpp:19: /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements > > >, boost::no_property, boost::listS>, boost::is_residual_edge > > >, boost::edge_residual_capacity_t> >, boost::keep_all> > >]’: /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/graph_concepts.hpp:66:5: required from ‘struct boost::concepts::Graph > > >, boost::no_property, boost::listS>, boost::is_residual_edge > > >, boost::edge_residual_capacity_t> >, boost::keep_all> >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/graph_concepts.hpp:75:1: required from ‘struct boost::concepts::IncidenceGraph > > >, boost::no_property, boost::listS>, boost::is_residual_edge > > >, boost::edge_residual_capacity_t> >, boost::keep_all> >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/graph_concepts.hpp:75:1: required from ‘struct boost::concepts::IncidenceGraphConcept > > >, boost::no_property, boost::listS>, boost::is_residual_edge > > >, boost::edge_residual_capacity_t> >, boost::keep_all> >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::concepts::IncidenceGraphConcept > > >, boost::no_property, boost::listS>, boost::is_residual_edge > > >, boost::edge_residual_capacity_t> >, boost::keep_all> >]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied > > >, boost::no_property, boost::listS>, boost::is_residual_edge > > >, boost::edge_residual_capacity_t> >, boost::keep_all> > >::value’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:45:51: [ skipping 2 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/breadth_first_search.hpp:62:5: required from ‘void boost::breadth_first_visit(const IncidenceGraph&, SourceIterator, SourceIterator, Buffer&, BFSVisitor, ColorMap) [with IncidenceGraph = filtered_graph > > >, no_property, listS>, is_residual_edge > > >, edge_residual_capacity_t> >, keep_all>; Buffer = queue > >; BFSVisitor = bfs_visitor*, on_tree_edge> >; ColorMap = default_color_type*; SourceIterator = long unsigned int*]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/breadth_first_search.hpp:136:24: required from ‘void boost::breadth_first_search(const VertexListGraph&, SourceIterator, SourceIterator, Buffer&, BFSVisitor, ColorMap) [with VertexListGraph = filtered_graph > > >, no_property, listS>, is_residual_edge > > >, edge_residual_capacity_t> >, keep_all>; SourceIterator = long unsigned int*; Buffer = queue > >; BFSVisitor = bfs_visitor*, on_tree_edge> >; ColorMap = default_color_type*]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/breadth_first_search.hpp:147:25: required from ‘void boost::breadth_first_search(const VertexListGraph&, typename graph_traits::vertex_descriptor, Buffer&, BFSVisitor, ColorMap) [with VertexListGraph = filtered_graph > > >, no_property, listS>, is_residual_edge > > >, edge_residual_capacity_t> >, keep_all>; Buffer = queue > >; BFSVisitor = bfs_visitor*, on_tree_edge> >; ColorMap = default_color_type*; typename graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/edmonds_karp_max_flow.hpp:101:29: required from ‘typename boost::property_traits::value_type boost::edmonds_karp_max_flow(Graph&, typename graph_traits::vertex_descriptor, typename graph_traits::vertex_descriptor, CapacityEdgeMap, ResidualCapacityEdgeMap, ReverseEdgeMap, ColorMap, PredEdgeMap) [with Graph = adjacency_list > > >, no_property, listS>; CapacityEdgeMap = adj_list_edge_property_map > > >, edge_capacity_t>; ResidualCapacityEdgeMap = adj_list_edge_property_map > > >, edge_residual_capacity_t>; ReverseEdgeMap = adj_list_edge_property_map, detail::edge_desc_impl&, long unsigned int, property > > >, edge_reverse_t>; ColorMap = default_color_type*; PredEdgeMap = detail::edge_desc_impl*; typename property_traits::value_type = long unsigned int; typename graph_traits::vertex_descriptor = long unsigned int]’ mincut.hpp:78:21: required from ‘typename boost::graph_traits::edges_size_type boost::min_cut(VertexListGraph&, OutputIterator, OutputIterator) [with VertexListGraph = const R_adjacency_list; OutputIterator = std::back_insert_iterator >; typename graph_traits::edges_size_type = long unsigned int]’ hcs.cpp:299:31: required from here /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ In file included from /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:31, from /home/omnipath/local/R/4.4-3.20/BH/include/boost/property_map/property_map.hpp:20: /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::concepts::Graph > > >, boost::no_property, boost::listS>, boost::is_residual_edge > > >, boost::edge_residual_capacity_t> >, boost::keep_all> >]’ 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ^ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements > > >, boost::no_property, boost::listS>, boost::is_residual_edge > > >, boost::edge_residual_capacity_t> >, boost::keep_all> > >]’: /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/graph_concepts.hpp:87:5: required from ‘struct boost::concepts::IncidenceGraph > > >, boost::no_property, boost::listS>, boost::is_residual_edge > > >, boost::edge_residual_capacity_t> >, boost::keep_all> >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/graph_concepts.hpp:75:1: required from ‘struct boost::concepts::IncidenceGraphConcept > > >, boost::no_property, boost::listS>, boost::is_residual_edge > > >, boost::edge_residual_capacity_t> >, boost::keep_all> >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::concepts::IncidenceGraphConcept > > >, boost::no_property, boost::listS>, boost::is_residual_edge > > >, boost::edge_residual_capacity_t> >, boost::keep_all> >]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied > > >, boost::no_property, boost::listS>, boost::is_residual_edge > > >, boost::edge_residual_capacity_t> >, boost::keep_all> > >::value’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:45:51: [ skipping 2 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/breadth_first_search.hpp:62:5: required from ‘void boost::breadth_first_visit(const IncidenceGraph&, SourceIterator, SourceIterator, Buffer&, BFSVisitor, ColorMap) [with IncidenceGraph = filtered_graph > > >, no_property, listS>, is_residual_edge > > >, edge_residual_capacity_t> >, keep_all>; Buffer = queue > >; BFSVisitor = bfs_visitor*, on_tree_edge> >; ColorMap = default_color_type*; SourceIterator = long unsigned int*]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/breadth_first_search.hpp:136:24: required from ‘void boost::breadth_first_search(const VertexListGraph&, SourceIterator, SourceIterator, Buffer&, BFSVisitor, ColorMap) [with VertexListGraph = filtered_graph > > >, no_property, listS>, is_residual_edge > > >, edge_residual_capacity_t> >, keep_all>; SourceIterator = long unsigned int*; Buffer = queue > >; BFSVisitor = bfs_visitor*, on_tree_edge> >; ColorMap = default_color_type*]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/breadth_first_search.hpp:147:25: required from ‘void boost::breadth_first_search(const VertexListGraph&, typename graph_traits::vertex_descriptor, Buffer&, BFSVisitor, ColorMap) [with VertexListGraph = filtered_graph > > >, no_property, listS>, is_residual_edge > > >, edge_residual_capacity_t> >, keep_all>; Buffer = queue > >; BFSVisitor = bfs_visitor*, on_tree_edge> >; ColorMap = default_color_type*; typename graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/edmonds_karp_max_flow.hpp:101:29: required from ‘typename boost::property_traits::value_type boost::edmonds_karp_max_flow(Graph&, typename graph_traits::vertex_descriptor, typename graph_traits::vertex_descriptor, CapacityEdgeMap, ResidualCapacityEdgeMap, ReverseEdgeMap, ColorMap, PredEdgeMap) [with Graph = adjacency_list > > >, no_property, listS>; CapacityEdgeMap = adj_list_edge_property_map > > >, edge_capacity_t>; ResidualCapacityEdgeMap = adj_list_edge_property_map > > >, edge_residual_capacity_t>; ReverseEdgeMap = adj_list_edge_property_map, detail::edge_desc_impl&, long unsigned int, property > > >, edge_reverse_t>; ColorMap = default_color_type*; PredEdgeMap = detail::edge_desc_impl*; typename property_traits::value_type = long unsigned int; typename graph_traits::vertex_descriptor = long unsigned int]’ mincut.hpp:78:21: required from ‘typename boost::graph_traits::edges_size_type boost::min_cut(VertexListGraph&, OutputIterator, OutputIterator) [with VertexListGraph = const R_adjacency_list; OutputIterator = std::back_insert_iterator >; typename graph_traits::edges_size_type = long unsigned int]’ hcs.cpp:299:31: required from here /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::concepts::IncidenceGraph > > >, boost::no_property, boost::listS>, boost::is_residual_edge > > >, boost::edge_residual_capacity_t> >, boost::keep_all> >]’ 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ^ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::IncidenceGraphConcept > > >, boost::no_property, boost::listS>, boost::is_residual_edge > > >, boost::edge_residual_capacity_t> >, boost::keep_all> >]’: /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/breadth_first_search.hpp:62:5: required from ‘void boost::breadth_first_visit(const IncidenceGraph&, SourceIterator, SourceIterator, Buffer&, BFSVisitor, ColorMap) [with IncidenceGraph = filtered_graph > > >, no_property, listS>, is_residual_edge > > >, edge_residual_capacity_t> >, keep_all>; Buffer = queue > >; BFSVisitor = bfs_visitor*, on_tree_edge> >; ColorMap = default_color_type*; SourceIterator = long unsigned int*]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/breadth_first_search.hpp:136:24: required from ‘void boost::breadth_first_search(const VertexListGraph&, SourceIterator, SourceIterator, Buffer&, BFSVisitor, ColorMap) [with VertexListGraph = filtered_graph > > >, no_property, listS>, is_residual_edge > > >, edge_residual_capacity_t> >, keep_all>; SourceIterator = long unsigned int*; Buffer = queue > >; BFSVisitor = bfs_visitor*, on_tree_edge> >; ColorMap = default_color_type*]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/breadth_first_search.hpp:147:25: required from ‘void boost::breadth_first_search(const VertexListGraph&, typename graph_traits::vertex_descriptor, Buffer&, BFSVisitor, ColorMap) [with VertexListGraph = filtered_graph > > >, no_property, listS>, is_residual_edge > > >, edge_residual_capacity_t> >, keep_all>; Buffer = queue > >; BFSVisitor = bfs_visitor*, on_tree_edge> >; ColorMap = default_color_type*; typename graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/edmonds_karp_max_flow.hpp:101:29: required from ‘typename boost::property_traits::value_type boost::edmonds_karp_max_flow(Graph&, typename graph_traits::vertex_descriptor, typename graph_traits::vertex_descriptor, CapacityEdgeMap, ResidualCapacityEdgeMap, ReverseEdgeMap, ColorMap, PredEdgeMap) [with Graph = adjacency_list > > >, no_property, listS>; CapacityEdgeMap = adj_list_edge_property_map > > >, edge_capacity_t>; ResidualCapacityEdgeMap = adj_list_edge_property_map > > >, edge_residual_capacity_t>; ReverseEdgeMap = adj_list_edge_property_map, detail::edge_desc_impl&, long unsigned int, property > > >, edge_reverse_t>; ColorMap = default_color_type*; PredEdgeMap = detail::edge_desc_impl*; typename property_traits::value_type = long unsigned int; typename graph_traits::vertex_descriptor = long unsigned int]’ mincut.hpp:78:21: required from ‘typename boost::graph_traits::edges_size_type boost::min_cut(VertexListGraph&, OutputIterator, OutputIterator) [with VertexListGraph = const R_adjacency_list; OutputIterator = std::back_insert_iterator >; typename graph_traits::edges_size_type = long unsigned int]’ hcs.cpp:299:31: required from here /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ In file included from /home/omnipath/local/R/4.4-3.20/BH/include/boost/preprocessor/repetition/enum_binary_params.hpp:15, from /home/omnipath/local/R/4.4-3.20/BH/include/boost/utility/base_from_member.hpp:15, from /home/omnipath/local/R/4.4-3.20/BH/include/boost/utility.hpp:15, from RBGL.hpp:16: /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/graph_concepts.hpp:75:15: note: in a call to non-static member function ‘boost::concepts::IncidenceGraphConcept > > >, boost::no_property, boost::listS>, boost::is_residual_edge > > >, boost::edge_residual_capacity_t> >, boost::keep_all> >::~IncidenceGraphConcept()’ 75 | BOOST_concept(IncidenceGraph, (G)) : Graph< G > | ^~~~~~~~~~~~~~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/preprocessor/cat.hpp:29:34: note: in definition of macro ‘BOOST_PP_CAT_I’ 29 | # define BOOST_PP_CAT_I(a, b) a ## b | ^ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/concept_def.hpp:23:12: note: in expansion of macro ‘BOOST_PP_CAT’ 23 | struct BOOST_PP_CAT(name,Concept) \ | ^~~~~~~~~~~~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/graph_concepts.hpp:75:1: note: in expansion of macro ‘BOOST_concept’ 75 | BOOST_concept(IncidenceGraph, (G)) : Graph< G > | ^~~~~~~~~~~~~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::constraint::failed() [with Model = boost::BFSVisitorConcept*, boost::on_tree_edge> >, boost::filtered_graph > > >, boost::no_property, boost::listS>, boost::is_residual_edge > > >, boost::edge_residual_capacity_t> >, boost::keep_all> >]’: /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/breadth_first_search.hpp:65:5: required from ‘void boost::breadth_first_visit(const IncidenceGraph&, SourceIterator, SourceIterator, Buffer&, BFSVisitor, ColorMap) [with IncidenceGraph = filtered_graph > > >, no_property, listS>, is_residual_edge > > >, edge_residual_capacity_t> >, keep_all>; Buffer = queue > >; BFSVisitor = bfs_visitor*, on_tree_edge> >; ColorMap = default_color_type*; SourceIterator = long unsigned int*]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/breadth_first_search.hpp:136:24: required from ‘void boost::breadth_first_search(const VertexListGraph&, SourceIterator, SourceIterator, Buffer&, BFSVisitor, ColorMap) [with VertexListGraph = filtered_graph > > >, no_property, listS>, is_residual_edge > > >, edge_residual_capacity_t> >, keep_all>; SourceIterator = long unsigned int*; Buffer = queue > >; BFSVisitor = bfs_visitor*, on_tree_edge> >; ColorMap = default_color_type*]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/breadth_first_search.hpp:147:25: required from ‘void boost::breadth_first_search(const VertexListGraph&, typename graph_traits::vertex_descriptor, Buffer&, BFSVisitor, ColorMap) [with VertexListGraph = filtered_graph > > >, no_property, listS>, is_residual_edge > > >, edge_residual_capacity_t> >, keep_all>; Buffer = queue > >; BFSVisitor = bfs_visitor*, on_tree_edge> >; ColorMap = default_color_type*; typename graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/edmonds_karp_max_flow.hpp:101:29: required from ‘typename boost::property_traits::value_type boost::edmonds_karp_max_flow(Graph&, typename graph_traits::vertex_descriptor, typename graph_traits::vertex_descriptor, CapacityEdgeMap, ResidualCapacityEdgeMap, ReverseEdgeMap, ColorMap, PredEdgeMap) [with Graph = adjacency_list > > >, no_property, listS>; CapacityEdgeMap = adj_list_edge_property_map > > >, edge_capacity_t>; ResidualCapacityEdgeMap = adj_list_edge_property_map > > >, edge_residual_capacity_t>; ReverseEdgeMap = adj_list_edge_property_map, detail::edge_desc_impl&, long unsigned int, property > > >, edge_reverse_t>; ColorMap = default_color_type*; PredEdgeMap = detail::edge_desc_impl*; typename property_traits::value_type = long unsigned int; typename graph_traits::vertex_descriptor = long unsigned int]’ mincut.hpp:78:21: required from ‘typename boost::graph_traits::edges_size_type boost::min_cut(VertexListGraph&, OutputIterator, OutputIterator) [with VertexListGraph = const R_adjacency_list; OutputIterator = std::back_insert_iterator >; typename graph_traits::edges_size_type = long unsigned int]’ hcs.cpp:299:31: required from here /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:65:52: warning: ‘this’ pointer is null [-Wnonnull] 65 | static void failed() { ((Model*)0)->constraints(); } | ~~~~~~~~~~~~~~~~~~~~~~~~^~ In file included from /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/edmonds_karp_max_flow.hpp:22, from /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/edge_connectivity.hpp:19, from mincut.hpp:4, from hcs.cpp:2: /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/breadth_first_search.hpp:37:10: note: in a call to non-static member function ‘void boost::BFSVisitorConcept::constraints() [with Visitor = boost::bfs_visitor*, boost::on_tree_edge> >; Graph = boost::filtered_graph > > >, boost::no_property, boost::listS>, boost::is_residual_edge > > >, boost::edge_residual_capacity_t> >, boost::keep_all>]’ 37 | void constraints() | ^~~~~~~~~~~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::constraint::failed() [with Model = boost::ReadWritePropertyMapConcept]’: /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/breadth_first_search.hpp:66:5: required from ‘void boost::breadth_first_visit(const IncidenceGraph&, SourceIterator, SourceIterator, Buffer&, BFSVisitor, ColorMap) [with IncidenceGraph = filtered_graph > > >, no_property, listS>, is_residual_edge > > >, edge_residual_capacity_t> >, keep_all>; Buffer = queue > >; BFSVisitor = bfs_visitor*, on_tree_edge> >; ColorMap = default_color_type*; SourceIterator = long unsigned int*]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/breadth_first_search.hpp:136:24: required from ‘void boost::breadth_first_search(const VertexListGraph&, SourceIterator, SourceIterator, Buffer&, BFSVisitor, ColorMap) [with VertexListGraph = filtered_graph > > >, no_property, listS>, is_residual_edge > > >, edge_residual_capacity_t> >, keep_all>; SourceIterator = long unsigned int*; Buffer = queue > >; BFSVisitor = bfs_visitor*, on_tree_edge> >; ColorMap = default_color_type*]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/breadth_first_search.hpp:147:25: required from ‘void boost::breadth_first_search(const VertexListGraph&, typename graph_traits::vertex_descriptor, Buffer&, BFSVisitor, ColorMap) [with VertexListGraph = filtered_graph > > >, no_property, listS>, is_residual_edge > > >, edge_residual_capacity_t> >, keep_all>; Buffer = queue > >; BFSVisitor = bfs_visitor*, on_tree_edge> >; ColorMap = default_color_type*; typename graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/edmonds_karp_max_flow.hpp:101:29: required from ‘typename boost::property_traits::value_type boost::edmonds_karp_max_flow(Graph&, typename graph_traits::vertex_descriptor, typename graph_traits::vertex_descriptor, CapacityEdgeMap, ResidualCapacityEdgeMap, ReverseEdgeMap, ColorMap, PredEdgeMap) [with Graph = adjacency_list > > >, no_property, listS>; CapacityEdgeMap = adj_list_edge_property_map > > >, edge_capacity_t>; ResidualCapacityEdgeMap = adj_list_edge_property_map > > >, edge_residual_capacity_t>; ReverseEdgeMap = adj_list_edge_property_map, detail::edge_desc_impl&, long unsigned int, property > > >, edge_reverse_t>; ColorMap = default_color_type*; PredEdgeMap = detail::edge_desc_impl*; typename property_traits::value_type = long unsigned int; typename graph_traits::vertex_descriptor = long unsigned int]’ mincut.hpp:78:21: required from ‘typename boost::graph_traits::edges_size_type boost::min_cut(VertexListGraph&, OutputIterator, OutputIterator) [with VertexListGraph = const R_adjacency_list; OutputIterator = std::back_insert_iterator >; typename graph_traits::edges_size_type = long unsigned int]’ hcs.cpp:299:31: required from here /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:65:52: warning: ‘this’ pointer is null [-Wnonnull] 65 | static void failed() { ((Model*)0)->constraints(); } | ~~~~~~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/property_map/property_map.hpp:205:10: note: in a call to non-static member function ‘void boost::ReadWritePropertyMapConcept::constraints() [with PMap = boost::default_color_type*; Key = long unsigned int]’ 205 | void constraints() { | ^~~~~~~~~~~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::concepts::Graph > > >, boost::no_property, boost::listS>, boost::is_residual_edge > > >, boost::edge_residual_capacity_t> >, boost::keep_all> >]’: /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements > > >, boost::no_property, boost::listS>, boost::is_residual_edge > > >, boost::edge_residual_capacity_t> >, boost::keep_all> > >]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/graph_concepts.hpp:66:5: required from ‘struct boost::concepts::Graph > > >, boost::no_property, boost::listS>, boost::is_residual_edge > > >, boost::edge_residual_capacity_t> >, boost::keep_all> >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/graph_concepts.hpp:75:1: required from ‘struct boost::concepts::IncidenceGraph > > >, boost::no_property, boost::listS>, boost::is_residual_edge > > >, boost::edge_residual_capacity_t> >, boost::keep_all> >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/graph_concepts.hpp:75:1: required from ‘struct boost::concepts::IncidenceGraphConcept > > >, boost::no_property, boost::listS>, boost::is_residual_edge > > >, boost::edge_residual_capacity_t> >, boost::keep_all> >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::concepts::IncidenceGraphConcept > > >, boost::no_property, boost::listS>, boost::is_residual_edge > > >, boost::edge_residual_capacity_t> >, boost::keep_all> >]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:42:5: [ skipping 3 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/breadth_first_search.hpp:62:5: required from ‘void boost::breadth_first_visit(const IncidenceGraph&, SourceIterator, SourceIterator, Buffer&, BFSVisitor, ColorMap) [with IncidenceGraph = filtered_graph > > >, no_property, listS>, is_residual_edge > > >, edge_residual_capacity_t> >, keep_all>; Buffer = queue > >; BFSVisitor = bfs_visitor*, on_tree_edge> >; ColorMap = default_color_type*; SourceIterator = long unsigned int*]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/breadth_first_search.hpp:136:24: required from ‘void boost::breadth_first_search(const VertexListGraph&, SourceIterator, SourceIterator, Buffer&, BFSVisitor, ColorMap) [with VertexListGraph = filtered_graph > > >, no_property, listS>, is_residual_edge > > >, edge_residual_capacity_t> >, keep_all>; SourceIterator = long unsigned int*; Buffer = queue > >; BFSVisitor = bfs_visitor*, on_tree_edge> >; ColorMap = default_color_type*]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/breadth_first_search.hpp:147:25: required from ‘void boost::breadth_first_search(const VertexListGraph&, typename graph_traits::vertex_descriptor, Buffer&, BFSVisitor, ColorMap) [with VertexListGraph = filtered_graph > > >, no_property, listS>, is_residual_edge > > >, edge_residual_capacity_t> >, keep_all>; Buffer = queue > >; BFSVisitor = bfs_visitor*, on_tree_edge> >; ColorMap = default_color_type*; typename graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/edmonds_karp_max_flow.hpp:101:29: required from ‘typename boost::property_traits::value_type boost::edmonds_karp_max_flow(Graph&, typename graph_traits::vertex_descriptor, typename graph_traits::vertex_descriptor, CapacityEdgeMap, ResidualCapacityEdgeMap, ReverseEdgeMap, ColorMap, PredEdgeMap) [with Graph = adjacency_list > > >, no_property, listS>; CapacityEdgeMap = adj_list_edge_property_map > > >, edge_capacity_t>; ResidualCapacityEdgeMap = adj_list_edge_property_map > > >, edge_residual_capacity_t>; ReverseEdgeMap = adj_list_edge_property_map, detail::edge_desc_impl&, long unsigned int, property > > >, edge_reverse_t>; ColorMap = default_color_type*; PredEdgeMap = detail::edge_desc_impl*; typename property_traits::value_type = long unsigned int; typename graph_traits::vertex_descriptor = long unsigned int]’ mincut.hpp:78:21: required from ‘typename boost::graph_traits::edges_size_type boost::min_cut(VertexListGraph&, OutputIterator, OutputIterator) [with VertexListGraph = const R_adjacency_list; OutputIterator = std::back_insert_iterator >; typename graph_traits::edges_size_type = long unsigned int]’ hcs.cpp:299:31: required from here /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::concepts::Graph::~Graph() [with G = boost::filtered_graph > > >, boost::no_property, boost::listS>, boost::is_residual_edge > > >, boost::edge_residual_capacity_t> >, boost::keep_all>]’ 37 | ~model() | ^ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/graph_concepts.hpp:66:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 66 | BOOST_CONCEPT_USAGE(Graph) | ^~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::concepts::IncidenceGraph > > >, boost::no_property, boost::listS>, boost::is_residual_edge > > >, boost::edge_residual_capacity_t> >, boost::keep_all> >]’: /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements > > >, boost::no_property, boost::listS>, boost::is_residual_edge > > >, boost::edge_residual_capacity_t> >, boost::keep_all> > >]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/graph_concepts.hpp:87:5: required from ‘struct boost::concepts::IncidenceGraph > > >, boost::no_property, boost::listS>, boost::is_residual_edge > > >, boost::edge_residual_capacity_t> >, boost::keep_all> >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/graph_concepts.hpp:75:1: required from ‘struct boost::concepts::IncidenceGraphConcept > > >, boost::no_property, boost::listS>, boost::is_residual_edge > > >, boost::edge_residual_capacity_t> >, boost::keep_all> >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::concepts::IncidenceGraphConcept > > >, boost::no_property, boost::listS>, boost::is_residual_edge > > >, boost::edge_residual_capacity_t> >, boost::keep_all> >]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied > > >, boost::no_property, boost::listS>, boost::is_residual_edge > > >, boost::edge_residual_capacity_t> >, boost::keep_all> > >::value’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:45:51: [ skipping 2 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/breadth_first_search.hpp:62:5: required from ‘void boost::breadth_first_visit(const IncidenceGraph&, SourceIterator, SourceIterator, Buffer&, BFSVisitor, ColorMap) [with IncidenceGraph = filtered_graph > > >, no_property, listS>, is_residual_edge > > >, edge_residual_capacity_t> >, keep_all>; Buffer = queue > >; BFSVisitor = bfs_visitor*, on_tree_edge> >; ColorMap = default_color_type*; SourceIterator = long unsigned int*]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/breadth_first_search.hpp:136:24: required from ‘void boost::breadth_first_search(const VertexListGraph&, SourceIterator, SourceIterator, Buffer&, BFSVisitor, ColorMap) [with VertexListGraph = filtered_graph > > >, no_property, listS>, is_residual_edge > > >, edge_residual_capacity_t> >, keep_all>; SourceIterator = long unsigned int*; Buffer = queue > >; BFSVisitor = bfs_visitor*, on_tree_edge> >; ColorMap = default_color_type*]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/breadth_first_search.hpp:147:25: required from ‘void boost::breadth_first_search(const VertexListGraph&, typename graph_traits::vertex_descriptor, Buffer&, BFSVisitor, ColorMap) [with VertexListGraph = filtered_graph > > >, no_property, listS>, is_residual_edge > > >, edge_residual_capacity_t> >, keep_all>; Buffer = queue > >; BFSVisitor = bfs_visitor*, on_tree_edge> >; ColorMap = default_color_type*; typename graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/edmonds_karp_max_flow.hpp:101:29: required from ‘typename boost::property_traits::value_type boost::edmonds_karp_max_flow(Graph&, typename graph_traits::vertex_descriptor, typename graph_traits::vertex_descriptor, CapacityEdgeMap, ResidualCapacityEdgeMap, ReverseEdgeMap, ColorMap, PredEdgeMap) [with Graph = adjacency_list > > >, no_property, listS>; CapacityEdgeMap = adj_list_edge_property_map > > >, edge_capacity_t>; ResidualCapacityEdgeMap = adj_list_edge_property_map > > >, edge_residual_capacity_t>; ReverseEdgeMap = adj_list_edge_property_map, detail::edge_desc_impl&, long unsigned int, property > > >, edge_reverse_t>; ColorMap = default_color_type*; PredEdgeMap = detail::edge_desc_impl*; typename property_traits::value_type = long unsigned int; typename graph_traits::vertex_descriptor = long unsigned int]’ mincut.hpp:78:21: required from ‘typename boost::graph_traits::edges_size_type boost::min_cut(VertexListGraph&, OutputIterator, OutputIterator) [with VertexListGraph = const R_adjacency_list; OutputIterator = std::back_insert_iterator >; typename graph_traits::edges_size_type = long unsigned int]’ hcs.cpp:299:31: required from here /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::concepts::IncidenceGraph::~IncidenceGraph() [with G = boost::filtered_graph > > >, boost::no_property, boost::listS>, boost::is_residual_edge > > >, boost::edge_residual_capacity_t> >, boost::keep_all>]’ 37 | ~model() | ^ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/graph_concepts.hpp:87:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 87 | BOOST_CONCEPT_USAGE(IncidenceGraph) | ^~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements*, boost::on_tree_edge> > > >]’: /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:167:5: required from ‘struct boost::CopyConstructible*, boost::on_tree_edge> > >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:165:3: required from ‘struct boost::CopyConstructibleConcept*, boost::on_tree_edge> > >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::CopyConstructibleConcept*, boost::on_tree_edge> > >]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied*, boost::on_tree_edge> > > >::value’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied*, boost::on_tree_edge> > > >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:72:8: [ skipping 6 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/breadth_first_search.hpp:65:5: required from ‘void boost::breadth_first_visit(const IncidenceGraph&, SourceIterator, SourceIterator, Buffer&, BFSVisitor, ColorMap) [with IncidenceGraph = filtered_graph > > >, no_property, listS>, is_residual_edge > > >, edge_residual_capacity_t> >, keep_all>; Buffer = queue > >; BFSVisitor = bfs_visitor*, on_tree_edge> >; ColorMap = default_color_type*; SourceIterator = long unsigned int*]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/breadth_first_search.hpp:136:24: required from ‘void boost::breadth_first_search(const VertexListGraph&, SourceIterator, SourceIterator, Buffer&, BFSVisitor, ColorMap) [with VertexListGraph = filtered_graph > > >, no_property, listS>, is_residual_edge > > >, edge_residual_capacity_t> >, keep_all>; SourceIterator = long unsigned int*; Buffer = queue > >; BFSVisitor = bfs_visitor*, on_tree_edge> >; ColorMap = default_color_type*]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/breadth_first_search.hpp:147:25: required from ‘void boost::breadth_first_search(const VertexListGraph&, typename graph_traits::vertex_descriptor, Buffer&, BFSVisitor, ColorMap) [with VertexListGraph = filtered_graph > > >, no_property, listS>, is_residual_edge > > >, edge_residual_capacity_t> >, keep_all>; Buffer = queue > >; BFSVisitor = bfs_visitor*, on_tree_edge> >; ColorMap = default_color_type*; typename graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/edmonds_karp_max_flow.hpp:101:29: required from ‘typename boost::property_traits::value_type boost::edmonds_karp_max_flow(Graph&, typename graph_traits::vertex_descriptor, typename graph_traits::vertex_descriptor, CapacityEdgeMap, ResidualCapacityEdgeMap, ReverseEdgeMap, ColorMap, PredEdgeMap) [with Graph = adjacency_list > > >, no_property, listS>; CapacityEdgeMap = adj_list_edge_property_map > > >, edge_capacity_t>; ResidualCapacityEdgeMap = adj_list_edge_property_map > > >, edge_residual_capacity_t>; ReverseEdgeMap = adj_list_edge_property_map, detail::edge_desc_impl&, long unsigned int, property > > >, edge_reverse_t>; ColorMap = default_color_type*; PredEdgeMap = detail::edge_desc_impl*; typename property_traits::value_type = long unsigned int; typename graph_traits::vertex_descriptor = long unsigned int]’ mincut.hpp:78:21: required from ‘typename boost::graph_traits::edges_size_type boost::min_cut(VertexListGraph&, OutputIterator, OutputIterator) [with VertexListGraph = const R_adjacency_list; OutputIterator = std::back_insert_iterator >; typename graph_traits::edges_size_type = long unsigned int]’ hcs.cpp:299:31: required from here /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::CopyConstructible*, boost::on_tree_edge> > >]’ 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ^ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::CopyConstructibleConcept*, boost::on_tree_edge> > >]’: /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/breadth_first_search.hpp:39:9: required from ‘void boost::BFSVisitorConcept::constraints() [with Visitor = boost::bfs_visitor*, boost::on_tree_edge> >; Graph = boost::filtered_graph > > >, boost::no_property, boost::listS>, boost::is_residual_edge > > >, boost::edge_residual_capacity_t> >, boost::keep_all>]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::BFSVisitorConcept*, boost::on_tree_edge> >, boost::filtered_graph > > >, boost::no_property, boost::listS>, boost::is_residual_edge > > >, boost::edge_residual_capacity_t> >, boost::keep_all> >]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied*, boost::on_tree_edge> >, boost::filtered_graph > > >, boost::no_property, boost::listS>, boost::is_residual_edge > > >, boost::edge_residual_capacity_t> >, boost::keep_all> > >::value’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied*, boost::on_tree_edge> >, boost::filtered_graph > > >, boost::no_property, boost::listS>, boost::is_residual_edge > > >, boost::edge_residual_capacity_t> >, boost::keep_all> > >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_*, boost::on_tree_edge> >, boost::filtered_graph > > >, boost::no_property, boost::listS>, boost::is_residual_edge > > >, boost::edge_residual_capacity_t> >, boost::keep_all> >)>’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/breadth_first_search.hpp:65:5: required from ‘void boost::breadth_first_visit(const IncidenceGraph&, SourceIterator, SourceIterator, Buffer&, BFSVisitor, ColorMap) [with IncidenceGraph = filtered_graph > > >, no_property, listS>, is_residual_edge > > >, edge_residual_capacity_t> >, keep_all>; Buffer = queue > >; BFSVisitor = bfs_visitor*, on_tree_edge> >; ColorMap = default_color_type*; SourceIterator = long unsigned int*]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/breadth_first_search.hpp:136:24: required from ‘void boost::breadth_first_search(const VertexListGraph&, SourceIterator, SourceIterator, Buffer&, BFSVisitor, ColorMap) [with VertexListGraph = filtered_graph > > >, no_property, listS>, is_residual_edge > > >, edge_residual_capacity_t> >, keep_all>; SourceIterator = long unsigned int*; Buffer = queue > >; BFSVisitor = bfs_visitor*, on_tree_edge> >; ColorMap = default_color_type*]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/breadth_first_search.hpp:147:25: required from ‘void boost::breadth_first_search(const VertexListGraph&, typename graph_traits::vertex_descriptor, Buffer&, BFSVisitor, ColorMap) [with VertexListGraph = filtered_graph > > >, no_property, listS>, is_residual_edge > > >, edge_residual_capacity_t> >, keep_all>; Buffer = queue > >; BFSVisitor = bfs_visitor*, on_tree_edge> >; ColorMap = default_color_type*; typename graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/edmonds_karp_max_flow.hpp:101:29: required from ‘typename boost::property_traits::value_type boost::edmonds_karp_max_flow(Graph&, typename graph_traits::vertex_descriptor, typename graph_traits::vertex_descriptor, CapacityEdgeMap, ResidualCapacityEdgeMap, ReverseEdgeMap, ColorMap, PredEdgeMap) [with Graph = adjacency_list > > >, no_property, listS>; CapacityEdgeMap = adj_list_edge_property_map > > >, edge_capacity_t>; ResidualCapacityEdgeMap = adj_list_edge_property_map > > >, edge_residual_capacity_t>; ReverseEdgeMap = adj_list_edge_property_map, detail::edge_desc_impl&, long unsigned int, property > > >, edge_reverse_t>; ColorMap = default_color_type*; PredEdgeMap = detail::edge_desc_impl*; typename property_traits::value_type = long unsigned int; typename graph_traits::vertex_descriptor = long unsigned int]’ mincut.hpp:78:21: required from ‘typename boost::graph_traits::edges_size_type boost::min_cut(VertexListGraph&, OutputIterator, OutputIterator) [with VertexListGraph = const R_adjacency_list; OutputIterator = std::back_insert_iterator >; typename graph_traits::edges_size_type = long unsigned int]’ hcs.cpp:299:31: required from here /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:165:17: note: in a call to non-static member function ‘boost::CopyConstructibleConcept*, boost::on_tree_edge> > >::~CopyConstructibleConcept()’ 165 | BOOST_concept(CopyConstructible,(TT)) | ^~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/preprocessor/cat.hpp:29:34: note: in definition of macro ‘BOOST_PP_CAT_I’ 29 | # define BOOST_PP_CAT_I(a, b) a ## b | ^ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/concept_def.hpp:23:12: note: in expansion of macro ‘BOOST_PP_CAT’ 23 | struct BOOST_PP_CAT(name,Concept) \ | ^~~~~~~~~~~~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:165:3: note: in expansion of macro ‘BOOST_concept’ 165 | BOOST_concept(CopyConstructible,(TT)) | ^~~~~~~~~~~~~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::constraint::failed() [with Model = boost::ReadablePropertyMapConcept]’: /home/omnipath/local/R/4.4-3.20/BH/include/boost/property_map/property_map.hpp:206:7: required from ‘void boost::ReadWritePropertyMapConcept::constraints() [with PMap = boost::default_color_type*; Key = long unsigned int]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::ReadWritePropertyMapConcept]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied >::value’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_)>’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/breadth_first_search.hpp:66:5: required from ‘void boost::breadth_first_visit(const IncidenceGraph&, SourceIterator, SourceIterator, Buffer&, BFSVisitor, ColorMap) [with IncidenceGraph = filtered_graph > > >, no_property, listS>, is_residual_edge > > >, edge_residual_capacity_t> >, keep_all>; Buffer = queue > >; BFSVisitor = bfs_visitor*, on_tree_edge> >; ColorMap = default_color_type*; SourceIterator = long unsigned int*]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/breadth_first_search.hpp:136:24: required from ‘void boost::breadth_first_search(const VertexListGraph&, SourceIterator, SourceIterator, Buffer&, BFSVisitor, ColorMap) [with VertexListGraph = filtered_graph > > >, no_property, listS>, is_residual_edge > > >, edge_residual_capacity_t> >, keep_all>; SourceIterator = long unsigned int*; Buffer = queue > >; BFSVisitor = bfs_visitor*, on_tree_edge> >; ColorMap = default_color_type*]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/breadth_first_search.hpp:147:25: required from ‘void boost::breadth_first_search(const VertexListGraph&, typename graph_traits::vertex_descriptor, Buffer&, BFSVisitor, ColorMap) [with VertexListGraph = filtered_graph > > >, no_property, listS>, is_residual_edge > > >, edge_residual_capacity_t> >, keep_all>; Buffer = queue > >; BFSVisitor = bfs_visitor*, on_tree_edge> >; ColorMap = default_color_type*; typename graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/edmonds_karp_max_flow.hpp:101:29: required from ‘typename boost::property_traits::value_type boost::edmonds_karp_max_flow(Graph&, typename graph_traits::vertex_descriptor, typename graph_traits::vertex_descriptor, CapacityEdgeMap, ResidualCapacityEdgeMap, ReverseEdgeMap, ColorMap, PredEdgeMap) [with Graph = adjacency_list > > >, no_property, listS>; CapacityEdgeMap = adj_list_edge_property_map > > >, edge_capacity_t>; ResidualCapacityEdgeMap = adj_list_edge_property_map > > >, edge_residual_capacity_t>; ReverseEdgeMap = adj_list_edge_property_map, detail::edge_desc_impl&, long unsigned int, property > > >, edge_reverse_t>; ColorMap = default_color_type*; PredEdgeMap = detail::edge_desc_impl*; typename property_traits::value_type = long unsigned int; typename graph_traits::vertex_descriptor = long unsigned int]’ mincut.hpp:78:21: required from ‘typename boost::graph_traits::edges_size_type boost::min_cut(VertexListGraph&, OutputIterator, OutputIterator) [with VertexListGraph = const R_adjacency_list; OutputIterator = std::back_insert_iterator >; typename graph_traits::edges_size_type = long unsigned int]’ hcs.cpp:299:31: required from here /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:65:52: warning: ‘this’ pointer is null [-Wnonnull] 65 | static void failed() { ((Model*)0)->constraints(); } | ~~~~~~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/property_map/property_map.hpp:147:10: note: in a call to non-static member function ‘void boost::ReadablePropertyMapConcept::constraints() [with PMap = boost::default_color_type*; Key = long unsigned int]’ 147 | void constraints() { | ^~~~~~~~~~~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::constraint::failed() [with Model = boost::WritablePropertyMapConcept]’: /home/omnipath/local/R/4.4-3.20/BH/include/boost/property_map/property_map.hpp:207:7: required from ‘void boost::ReadWritePropertyMapConcept::constraints() [with PMap = boost::default_color_type*; Key = long unsigned int]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::ReadWritePropertyMapConcept]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied >::value’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_)>’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/breadth_first_search.hpp:66:5: required from ‘void boost::breadth_first_visit(const IncidenceGraph&, SourceIterator, SourceIterator, Buffer&, BFSVisitor, ColorMap) [with IncidenceGraph = filtered_graph > > >, no_property, listS>, is_residual_edge > > >, edge_residual_capacity_t> >, keep_all>; Buffer = queue > >; BFSVisitor = bfs_visitor*, on_tree_edge> >; ColorMap = default_color_type*; SourceIterator = long unsigned int*]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/breadth_first_search.hpp:136:24: required from ‘void boost::breadth_first_search(const VertexListGraph&, SourceIterator, SourceIterator, Buffer&, BFSVisitor, ColorMap) [with VertexListGraph = filtered_graph > > >, no_property, listS>, is_residual_edge > > >, edge_residual_capacity_t> >, keep_all>; SourceIterator = long unsigned int*; Buffer = queue > >; BFSVisitor = bfs_visitor*, on_tree_edge> >; ColorMap = default_color_type*]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/breadth_first_search.hpp:147:25: required from ‘void boost::breadth_first_search(const VertexListGraph&, typename graph_traits::vertex_descriptor, Buffer&, BFSVisitor, ColorMap) [with VertexListGraph = filtered_graph > > >, no_property, listS>, is_residual_edge > > >, edge_residual_capacity_t> >, keep_all>; Buffer = queue > >; BFSVisitor = bfs_visitor*, on_tree_edge> >; ColorMap = default_color_type*; typename graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/edmonds_karp_max_flow.hpp:101:29: required from ‘typename boost::property_traits::value_type boost::edmonds_karp_max_flow(Graph&, typename graph_traits::vertex_descriptor, typename graph_traits::vertex_descriptor, CapacityEdgeMap, ResidualCapacityEdgeMap, ReverseEdgeMap, ColorMap, PredEdgeMap) [with Graph = adjacency_list > > >, no_property, listS>; CapacityEdgeMap = adj_list_edge_property_map > > >, edge_capacity_t>; ResidualCapacityEdgeMap = adj_list_edge_property_map > > >, edge_residual_capacity_t>; ReverseEdgeMap = adj_list_edge_property_map, detail::edge_desc_impl&, long unsigned int, property > > >, edge_reverse_t>; ColorMap = default_color_type*; PredEdgeMap = detail::edge_desc_impl*; typename property_traits::value_type = long unsigned int; typename graph_traits::vertex_descriptor = long unsigned int]’ mincut.hpp:78:21: required from ‘typename boost::graph_traits::edges_size_type boost::min_cut(VertexListGraph&, OutputIterator, OutputIterator) [with VertexListGraph = const R_adjacency_list; OutputIterator = std::back_insert_iterator >; typename graph_traits::edges_size_type = long unsigned int]’ hcs.cpp:299:31: required from here /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:65:52: warning: ‘this’ pointer is null [-Wnonnull] 65 | static void failed() { ((Model*)0)->constraints(); } | ~~~~~~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/property_map/property_map.hpp:179:10: note: in a call to non-static member function ‘void boost::WritablePropertyMapConcept::constraints() [with PMap = boost::default_color_type*; Key = long unsigned int]’ 179 | void constraints() { | ^~~~~~~~~~~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements >]’: /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:208:5: required from ‘struct boost::Convertible’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:206:3: required from ‘struct boost::ConvertibleConcept’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::ConvertibleConcept]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied >::value’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:72:8: [ skipping 6 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/breadth_first_search.hpp:66:5: required from ‘void boost::breadth_first_visit(const IncidenceGraph&, SourceIterator, SourceIterator, Buffer&, BFSVisitor, ColorMap) [with IncidenceGraph = filtered_graph > > >, no_property, listS>, is_residual_edge > > >, edge_residual_capacity_t> >, keep_all>; Buffer = queue > >; BFSVisitor = bfs_visitor*, on_tree_edge> >; ColorMap = default_color_type*; SourceIterator = long unsigned int*]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/breadth_first_search.hpp:136:24: required from ‘void boost::breadth_first_search(const VertexListGraph&, SourceIterator, SourceIterator, Buffer&, BFSVisitor, ColorMap) [with VertexListGraph = filtered_graph > > >, no_property, listS>, is_residual_edge > > >, edge_residual_capacity_t> >, keep_all>; SourceIterator = long unsigned int*; Buffer = queue > >; BFSVisitor = bfs_visitor*, on_tree_edge> >; ColorMap = default_color_type*]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/breadth_first_search.hpp:147:25: required from ‘void boost::breadth_first_search(const VertexListGraph&, typename graph_traits::vertex_descriptor, Buffer&, BFSVisitor, ColorMap) [with VertexListGraph = filtered_graph > > >, no_property, listS>, is_residual_edge > > >, edge_residual_capacity_t> >, keep_all>; Buffer = queue > >; BFSVisitor = bfs_visitor*, on_tree_edge> >; ColorMap = default_color_type*; typename graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/edmonds_karp_max_flow.hpp:101:29: required from ‘typename boost::property_traits::value_type boost::edmonds_karp_max_flow(Graph&, typename graph_traits::vertex_descriptor, typename graph_traits::vertex_descriptor, CapacityEdgeMap, ResidualCapacityEdgeMap, ReverseEdgeMap, ColorMap, PredEdgeMap) [with Graph = adjacency_list > > >, no_property, listS>; CapacityEdgeMap = adj_list_edge_property_map > > >, edge_capacity_t>; ResidualCapacityEdgeMap = adj_list_edge_property_map > > >, edge_residual_capacity_t>; ReverseEdgeMap = adj_list_edge_property_map, detail::edge_desc_impl&, long unsigned int, property > > >, edge_reverse_t>; ColorMap = default_color_type*; PredEdgeMap = detail::edge_desc_impl*; typename property_traits::value_type = long unsigned int; typename graph_traits::vertex_descriptor = long unsigned int]’ mincut.hpp:78:21: required from ‘typename boost::graph_traits::edges_size_type boost::min_cut(VertexListGraph&, OutputIterator, OutputIterator) [with VertexListGraph = const R_adjacency_list; OutputIterator = std::back_insert_iterator >; typename graph_traits::edges_size_type = long unsigned int]’ hcs.cpp:299:31: required from here /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::Convertible]’ 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ^ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::ConvertibleConcept]’: /home/omnipath/local/R/4.4-3.20/BH/include/boost/property_map/property_map.hpp:208:7: required from ‘void boost::ReadWritePropertyMapConcept::constraints() [with PMap = boost::default_color_type*; Key = long unsigned int]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::ReadWritePropertyMapConcept]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied >::value’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_)>’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/breadth_first_search.hpp:66:5: required from ‘void boost::breadth_first_visit(const IncidenceGraph&, SourceIterator, SourceIterator, Buffer&, BFSVisitor, ColorMap) [with IncidenceGraph = filtered_graph > > >, no_property, listS>, is_residual_edge > > >, edge_residual_capacity_t> >, keep_all>; Buffer = queue > >; BFSVisitor = bfs_visitor*, on_tree_edge> >; ColorMap = default_color_type*; SourceIterator = long unsigned int*]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/breadth_first_search.hpp:136:24: required from ‘void boost::breadth_first_search(const VertexListGraph&, SourceIterator, SourceIterator, Buffer&, BFSVisitor, ColorMap) [with VertexListGraph = filtered_graph > > >, no_property, listS>, is_residual_edge > > >, edge_residual_capacity_t> >, keep_all>; SourceIterator = long unsigned int*; Buffer = queue > >; BFSVisitor = bfs_visitor*, on_tree_edge> >; ColorMap = default_color_type*]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/breadth_first_search.hpp:147:25: required from ‘void boost::breadth_first_search(const VertexListGraph&, typename graph_traits::vertex_descriptor, Buffer&, BFSVisitor, ColorMap) [with VertexListGraph = filtered_graph > > >, no_property, listS>, is_residual_edge > > >, edge_residual_capacity_t> >, keep_all>; Buffer = queue > >; BFSVisitor = bfs_visitor*, on_tree_edge> >; ColorMap = default_color_type*; typename graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/edmonds_karp_max_flow.hpp:101:29: required from ‘typename boost::property_traits::value_type boost::edmonds_karp_max_flow(Graph&, typename graph_traits::vertex_descriptor, typename graph_traits::vertex_descriptor, CapacityEdgeMap, ResidualCapacityEdgeMap, ReverseEdgeMap, ColorMap, PredEdgeMap) [with Graph = adjacency_list > > >, no_property, listS>; CapacityEdgeMap = adj_list_edge_property_map > > >, edge_capacity_t>; ResidualCapacityEdgeMap = adj_list_edge_property_map > > >, edge_residual_capacity_t>; ReverseEdgeMap = adj_list_edge_property_map, detail::edge_desc_impl&, long unsigned int, property > > >, edge_reverse_t>; ColorMap = default_color_type*; PredEdgeMap = detail::edge_desc_impl*; typename property_traits::value_type = long unsigned int; typename graph_traits::vertex_descriptor = long unsigned int]’ mincut.hpp:78:21: required from ‘typename boost::graph_traits::edges_size_type boost::min_cut(VertexListGraph&, OutputIterator, OutputIterator) [with VertexListGraph = const R_adjacency_list; OutputIterator = std::back_insert_iterator >; typename graph_traits::edges_size_type = long unsigned int]’ hcs.cpp:299:31: required from here /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:206:17: note: in a call to non-static member function ‘boost::ConvertibleConcept::~ConvertibleConcept()’ 206 | BOOST_concept(Convertible,(X)(Y)) | ^~~~~~~~~~~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/preprocessor/cat.hpp:29:34: note: in definition of macro ‘BOOST_PP_CAT_I’ 29 | # define BOOST_PP_CAT_I(a, b) a ## b | ^ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/concept_def.hpp:23:12: note: in expansion of macro ‘BOOST_PP_CAT’ 23 | struct BOOST_PP_CAT(name,Concept) \ | ^~~~~~~~~~~~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:206:3: note: in expansion of macro ‘BOOST_concept’ 206 | BOOST_concept(Convertible,(X)(Y)) | ^~~~~~~~~~~~~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements > > >, boost::edge_residual_capacity_t> >, boost::keep_all, boost::filtered_graph > > >, boost::no_property, boost::listS>, boost::is_residual_edge > > >, boost::edge_residual_capacity_t> >, boost::keep_all> >, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > > > >*, std::vector > > > >, std::allocator > > > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > > >]’: /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/graph_concepts.hpp:52:50: required from ‘struct boost::concepts::MultiPassInputIterator > > >, boost::edge_residual_capacity_t> >, boost::keep_all, boost::filtered_graph > > >, boost::no_property, boost::listS>, boost::is_residual_edge > > >, boost::edge_residual_capacity_t> >, boost::keep_all> >, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > > > >*, std::vector > > > >, std::allocator > > > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::concepts::MultiPassInputIterator > > >, boost::edge_residual_capacity_t> >, boost::keep_all, boost::filtered_graph > > >, boost::no_property, boost::listS>, boost::is_residual_edge > > >, boost::edge_residual_capacity_t> >, boost::keep_all> >, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > > > >*, std::vector > > > >, std::allocator > > > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied > > >, boost::edge_residual_capacity_t> >, boost::keep_all, boost::filtered_graph > > >, boost::no_property, boost::listS>, boost::is_residual_edge > > >, boost::edge_residual_capacity_t> >, boost::keep_all> >, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > > > >*, std::vector > > > >, std::allocator > > > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > > >::value’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied > > >, boost::edge_residual_capacity_t> >, boost::keep_all, boost::filtered_graph > > >, boost::no_property, boost::listS>, boost::is_residual_edge > > >, boost::edge_residual_capacity_t> >, boost::keep_all> >, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > > > >*, std::vector > > > >, std::allocator > > > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > > >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_ > > >, boost::edge_residual_capacity_t> >, boost::keep_all, boost::filtered_graph > > >, boost::no_property, boost::listS>, boost::is_residual_edge > > >, boost::edge_residual_capacity_t> >, boost::keep_all> >, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > > > >*, std::vector > > > >, std::allocator > > > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >)>’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/graph_concepts.hpp:89:9: [ skipping 2 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/breadth_first_search.hpp:62:5: required from ‘void boost::breadth_first_visit(const IncidenceGraph&, SourceIterator, SourceIterator, Buffer&, BFSVisitor, ColorMap) [with IncidenceGraph = filtered_graph > > >, no_property, listS>, is_residual_edge > > >, edge_residual_capacity_t> >, keep_all>; Buffer = queue > >; BFSVisitor = bfs_visitor*, on_tree_edge> >; ColorMap = default_color_type*; SourceIterator = long unsigned int*]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/breadth_first_search.hpp:136:24: required from ‘void boost::breadth_first_search(const VertexListGraph&, SourceIterator, SourceIterator, Buffer&, BFSVisitor, ColorMap) [with VertexListGraph = filtered_graph > > >, no_property, listS>, is_residual_edge > > >, edge_residual_capacity_t> >, keep_all>; SourceIterator = long unsigned int*; Buffer = queue > >; BFSVisitor = bfs_visitor*, on_tree_edge> >; ColorMap = default_color_type*]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/breadth_first_search.hpp:147:25: required from ‘void boost::breadth_first_search(const VertexListGraph&, typename graph_traits::vertex_descriptor, Buffer&, BFSVisitor, ColorMap) [with VertexListGraph = filtered_graph > > >, no_property, listS>, is_residual_edge > > >, edge_residual_capacity_t> >, keep_all>; Buffer = queue > >; BFSVisitor = bfs_visitor*, on_tree_edge> >; ColorMap = default_color_type*; typename graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/edmonds_karp_max_flow.hpp:101:29: required from ‘typename boost::property_traits::value_type boost::edmonds_karp_max_flow(Graph&, typename graph_traits::vertex_descriptor, typename graph_traits::vertex_descriptor, CapacityEdgeMap, ResidualCapacityEdgeMap, ReverseEdgeMap, ColorMap, PredEdgeMap) [with Graph = adjacency_list > > >, no_property, listS>; CapacityEdgeMap = adj_list_edge_property_map > > >, edge_capacity_t>; ResidualCapacityEdgeMap = adj_list_edge_property_map > > >, edge_residual_capacity_t>; ReverseEdgeMap = adj_list_edge_property_map, detail::edge_desc_impl&, long unsigned int, property > > >, edge_reverse_t>; ColorMap = default_color_type*; PredEdgeMap = detail::edge_desc_impl*; typename property_traits::value_type = long unsigned int; typename graph_traits::vertex_descriptor = long unsigned int]’ mincut.hpp:78:21: required from ‘typename boost::graph_traits::edges_size_type boost::min_cut(VertexListGraph&, OutputIterator, OutputIterator) [with VertexListGraph = const R_adjacency_list; OutputIterator = std::back_insert_iterator >; typename graph_traits::edges_size_type = long unsigned int]’ hcs.cpp:299:31: required from here /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::concepts::MultiPassInputIterator > > >, boost::edge_residual_capacity_t> >, boost::keep_all, boost::filtered_graph > > >, boost::no_property, boost::listS>, boost::is_residual_edge > > >, boost::edge_residual_capacity_t> >, boost::keep_all> >, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > > > >*, std::vector > > > >, std::allocator > > > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >]’ 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ^ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::MultiPassInputIterator > > >, boost::edge_residual_capacity_t> >, boost::keep_all, boost::filtered_graph > > >, boost::no_property, boost::listS>, boost::is_residual_edge > > >, boost::edge_residual_capacity_t> >, boost::keep_all> >, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > > > >*, std::vector > > > >, std::allocator > > > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >]’: /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/graph_concepts.hpp:89:9: required from ‘boost::concepts::IncidenceGraph::~IncidenceGraph() [with G = boost::filtered_graph > > >, boost::no_property, boost::listS>, boost::is_residual_edge > > >, boost::edge_residual_capacity_t> >, boost::keep_all>]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/graph_concepts.hpp:75:1: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::IncidenceGraphConcept > > >, boost::no_property, boost::listS>, boost::is_residual_edge > > >, boost::edge_residual_capacity_t> >, boost::keep_all> >]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/breadth_first_search.hpp:62:5: required from ‘void boost::breadth_first_visit(const IncidenceGraph&, SourceIterator, SourceIterator, Buffer&, BFSVisitor, ColorMap) [with IncidenceGraph = filtered_graph > > >, no_property, listS>, is_residual_edge > > >, edge_residual_capacity_t> >, keep_all>; Buffer = queue > >; BFSVisitor = bfs_visitor*, on_tree_edge> >; ColorMap = default_color_type*; SourceIterator = long unsigned int*]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/breadth_first_search.hpp:136:24: required from ‘void boost::breadth_first_search(const VertexListGraph&, SourceIterator, SourceIterator, Buffer&, BFSVisitor, ColorMap) [with VertexListGraph = filtered_graph > > >, no_property, listS>, is_residual_edge > > >, edge_residual_capacity_t> >, keep_all>; SourceIterator = long unsigned int*; Buffer = queue > >; BFSVisitor = bfs_visitor*, on_tree_edge> >; ColorMap = default_color_type*]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/breadth_first_search.hpp:147:25: required from ‘void boost::breadth_first_search(const VertexListGraph&, typename graph_traits::vertex_descriptor, Buffer&, BFSVisitor, ColorMap) [with VertexListGraph = filtered_graph > > >, no_property, listS>, is_residual_edge > > >, edge_residual_capacity_t> >, keep_all>; Buffer = queue > >; BFSVisitor = bfs_visitor*, on_tree_edge> >; ColorMap = default_color_type*; typename graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/edmonds_karp_max_flow.hpp:101:29: required from ‘typename boost::property_traits::value_type boost::edmonds_karp_max_flow(Graph&, typename graph_traits::vertex_descriptor, typename graph_traits::vertex_descriptor, CapacityEdgeMap, ResidualCapacityEdgeMap, ReverseEdgeMap, ColorMap, PredEdgeMap) [with Graph = adjacency_list > > >, no_property, listS>; CapacityEdgeMap = adj_list_edge_property_map > > >, edge_capacity_t>; ResidualCapacityEdgeMap = adj_list_edge_property_map > > >, edge_residual_capacity_t>; ReverseEdgeMap = adj_list_edge_property_map, detail::edge_desc_impl&, long unsigned int, property > > >, edge_reverse_t>; ColorMap = default_color_type*; PredEdgeMap = detail::edge_desc_impl*; typename property_traits::value_type = long unsigned int; typename graph_traits::vertex_descriptor = long unsigned int]’ mincut.hpp:78:21: required from ‘typename boost::graph_traits::edges_size_type boost::min_cut(VertexListGraph&, OutputIterator, OutputIterator) [with VertexListGraph = const R_adjacency_list; OutputIterator = std::back_insert_iterator >; typename graph_traits::edges_size_type = long unsigned int]’ hcs.cpp:299:31: required from here /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::concepts::MultiPassInputIterator::~MultiPassInputIterator() [with T = boost::iterators::filter_iterator > > >, boost::edge_residual_capacity_t> >, boost::keep_all, boost::filtered_graph > > >, boost::no_property, boost::listS>, boost::is_residual_edge > > >, boost::edge_residual_capacity_t> >, boost::keep_all> >, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > > > >*, std::vector > > > >, std::allocator > > > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> >]’ 37 | ~model() | ^ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/graph_concepts.hpp:52:50: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 52 | BOOST_concept(MultiPassInputIterator, (T)) { BOOST_CONCEPT_USAGE( | ^~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements > >]’: /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:137:5: required from ‘struct boost::DefaultConstructible >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::DefaultConstructible >]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied > >::value’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied > >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_ >)>’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/graph_concepts.hpp:90:9: [ skipping 2 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/breadth_first_search.hpp:62:5: required from ‘void boost::breadth_first_visit(const IncidenceGraph&, SourceIterator, SourceIterator, Buffer&, BFSVisitor, ColorMap) [with IncidenceGraph = filtered_graph > > >, no_property, listS>, is_residual_edge > > >, edge_residual_capacity_t> >, keep_all>; Buffer = queue > >; BFSVisitor = bfs_visitor*, on_tree_edge> >; ColorMap = default_color_type*; SourceIterator = long unsigned int*]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/breadth_first_search.hpp:136:24: required from ‘void boost::breadth_first_search(const VertexListGraph&, SourceIterator, SourceIterator, Buffer&, BFSVisitor, ColorMap) [with VertexListGraph = filtered_graph > > >, no_property, listS>, is_residual_edge > > >, edge_residual_capacity_t> >, keep_all>; SourceIterator = long unsigned int*; Buffer = queue > >; BFSVisitor = bfs_visitor*, on_tree_edge> >; ColorMap = default_color_type*]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/breadth_first_search.hpp:147:25: required from ‘void boost::breadth_first_search(const VertexListGraph&, typename graph_traits::vertex_descriptor, Buffer&, BFSVisitor, ColorMap) [with VertexListGraph = filtered_graph > > >, no_property, listS>, is_residual_edge > > >, edge_residual_capacity_t> >, keep_all>; Buffer = queue > >; BFSVisitor = bfs_visitor*, on_tree_edge> >; ColorMap = default_color_type*; typename graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/edmonds_karp_max_flow.hpp:101:29: required from ‘typename boost::property_traits::value_type boost::edmonds_karp_max_flow(Graph&, typename graph_traits::vertex_descriptor, typename graph_traits::vertex_descriptor, CapacityEdgeMap, ResidualCapacityEdgeMap, ReverseEdgeMap, ColorMap, PredEdgeMap) [with Graph = adjacency_list > > >, no_property, listS>; CapacityEdgeMap = adj_list_edge_property_map > > >, edge_capacity_t>; ResidualCapacityEdgeMap = adj_list_edge_property_map > > >, edge_residual_capacity_t>; ReverseEdgeMap = adj_list_edge_property_map, detail::edge_desc_impl&, long unsigned int, property > > >, edge_reverse_t>; ColorMap = default_color_type*; PredEdgeMap = detail::edge_desc_impl*; typename property_traits::value_type = long unsigned int; typename graph_traits::vertex_descriptor = long unsigned int]’ mincut.hpp:78:21: required from ‘typename boost::graph_traits::edges_size_type boost::min_cut(VertexListGraph&, OutputIterator, OutputIterator) [with VertexListGraph = const R_adjacency_list; OutputIterator = std::back_insert_iterator >; typename graph_traits::edges_size_type = long unsigned int]’ hcs.cpp:299:31: required from here /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::DefaultConstructible >]’ 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ^ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::DefaultConstructible >]’: /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/graph_concepts.hpp:90:9: required from ‘boost::concepts::IncidenceGraph::~IncidenceGraph() [with G = boost::filtered_graph > > >, boost::no_property, boost::listS>, boost::is_residual_edge > > >, boost::edge_residual_capacity_t> >, boost::keep_all>]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/graph_concepts.hpp:75:1: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::IncidenceGraphConcept > > >, boost::no_property, boost::listS>, boost::is_residual_edge > > >, boost::edge_residual_capacity_t> >, boost::keep_all> >]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/breadth_first_search.hpp:62:5: required from ‘void boost::breadth_first_visit(const IncidenceGraph&, SourceIterator, SourceIterator, Buffer&, BFSVisitor, ColorMap) [with IncidenceGraph = filtered_graph > > >, no_property, listS>, is_residual_edge > > >, edge_residual_capacity_t> >, keep_all>; Buffer = queue > >; BFSVisitor = bfs_visitor*, on_tree_edge> >; ColorMap = default_color_type*; SourceIterator = long unsigned int*]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/breadth_first_search.hpp:136:24: required from ‘void boost::breadth_first_search(const VertexListGraph&, SourceIterator, SourceIterator, Buffer&, BFSVisitor, ColorMap) [with VertexListGraph = filtered_graph > > >, no_property, listS>, is_residual_edge > > >, edge_residual_capacity_t> >, keep_all>; SourceIterator = long unsigned int*; Buffer = queue > >; BFSVisitor = bfs_visitor*, on_tree_edge> >; ColorMap = default_color_type*]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/breadth_first_search.hpp:147:25: required from ‘void boost::breadth_first_search(const VertexListGraph&, typename graph_traits::vertex_descriptor, Buffer&, BFSVisitor, ColorMap) [with VertexListGraph = filtered_graph > > >, no_property, listS>, is_residual_edge > > >, edge_residual_capacity_t> >, keep_all>; Buffer = queue > >; BFSVisitor = bfs_visitor*, on_tree_edge> >; ColorMap = default_color_type*; typename graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/edmonds_karp_max_flow.hpp:101:29: required from ‘typename boost::property_traits::value_type boost::edmonds_karp_max_flow(Graph&, typename graph_traits::vertex_descriptor, typename graph_traits::vertex_descriptor, CapacityEdgeMap, ResidualCapacityEdgeMap, ReverseEdgeMap, ColorMap, PredEdgeMap) [with Graph = adjacency_list > > >, no_property, listS>; CapacityEdgeMap = adj_list_edge_property_map > > >, edge_capacity_t>; ResidualCapacityEdgeMap = adj_list_edge_property_map > > >, edge_residual_capacity_t>; ReverseEdgeMap = adj_list_edge_property_map, detail::edge_desc_impl&, long unsigned int, property > > >, edge_reverse_t>; ColorMap = default_color_type*; PredEdgeMap = detail::edge_desc_impl*; typename property_traits::value_type = long unsigned int; typename graph_traits::vertex_descriptor = long unsigned int]’ mincut.hpp:78:21: required from ‘typename boost::graph_traits::edges_size_type boost::min_cut(VertexListGraph&, OutputIterator, OutputIterator) [with VertexListGraph = const R_adjacency_list; OutputIterator = std::back_insert_iterator >; typename graph_traits::edges_size_type = long unsigned int]’ hcs.cpp:299:31: required from here /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::DefaultConstructible::~DefaultConstructible() [with TT = boost::detail::edge_desc_impl]’ 37 | ~model() | ^ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:137:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 137 | BOOST_CONCEPT_USAGE(DefaultConstructible) { | ^~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements > >]’: /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:233:5: required from ‘struct boost::EqualityComparable >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::EqualityComparable >]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied > >::value’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied > >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_ >)>’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/graph_concepts.hpp:91:9: [ skipping 2 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/breadth_first_search.hpp:62:5: required from ‘void boost::breadth_first_visit(const IncidenceGraph&, SourceIterator, SourceIterator, Buffer&, BFSVisitor, ColorMap) [with IncidenceGraph = filtered_graph > > >, no_property, listS>, is_residual_edge > > >, edge_residual_capacity_t> >, keep_all>; Buffer = queue > >; BFSVisitor = bfs_visitor*, on_tree_edge> >; ColorMap = default_color_type*; SourceIterator = long unsigned int*]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/breadth_first_search.hpp:136:24: required from ‘void boost::breadth_first_search(const VertexListGraph&, SourceIterator, SourceIterator, Buffer&, BFSVisitor, ColorMap) [with VertexListGraph = filtered_graph > > >, no_property, listS>, is_residual_edge > > >, edge_residual_capacity_t> >, keep_all>; SourceIterator = long unsigned int*; Buffer = queue > >; BFSVisitor = bfs_visitor*, on_tree_edge> >; ColorMap = default_color_type*]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/breadth_first_search.hpp:147:25: required from ‘void boost::breadth_first_search(const VertexListGraph&, typename graph_traits::vertex_descriptor, Buffer&, BFSVisitor, ColorMap) [with VertexListGraph = filtered_graph > > >, no_property, listS>, is_residual_edge > > >, edge_residual_capacity_t> >, keep_all>; Buffer = queue > >; BFSVisitor = bfs_visitor*, on_tree_edge> >; ColorMap = default_color_type*; typename graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/edmonds_karp_max_flow.hpp:101:29: required from ‘typename boost::property_traits::value_type boost::edmonds_karp_max_flow(Graph&, typename graph_traits::vertex_descriptor, typename graph_traits::vertex_descriptor, CapacityEdgeMap, ResidualCapacityEdgeMap, ReverseEdgeMap, ColorMap, PredEdgeMap) [with Graph = adjacency_list > > >, no_property, listS>; CapacityEdgeMap = adj_list_edge_property_map > > >, edge_capacity_t>; ResidualCapacityEdgeMap = adj_list_edge_property_map > > >, edge_residual_capacity_t>; ReverseEdgeMap = adj_list_edge_property_map, detail::edge_desc_impl&, long unsigned int, property > > >, edge_reverse_t>; ColorMap = default_color_type*; PredEdgeMap = detail::edge_desc_impl*; typename property_traits::value_type = long unsigned int; typename graph_traits::vertex_descriptor = long unsigned int]’ mincut.hpp:78:21: required from ‘typename boost::graph_traits::edges_size_type boost::min_cut(VertexListGraph&, OutputIterator, OutputIterator) [with VertexListGraph = const R_adjacency_list; OutputIterator = std::back_insert_iterator >; typename graph_traits::edges_size_type = long unsigned int]’ hcs.cpp:299:31: required from here /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::EqualityComparable >]’ 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ^ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::EqualityComparable >]’: /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/graph_concepts.hpp:91:9: required from ‘boost::concepts::IncidenceGraph::~IncidenceGraph() [with G = boost::filtered_graph > > >, boost::no_property, boost::listS>, boost::is_residual_edge > > >, boost::edge_residual_capacity_t> >, boost::keep_all>]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/graph_concepts.hpp:75:1: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::IncidenceGraphConcept > > >, boost::no_property, boost::listS>, boost::is_residual_edge > > >, boost::edge_residual_capacity_t> >, boost::keep_all> >]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/breadth_first_search.hpp:62:5: required from ‘void boost::breadth_first_visit(const IncidenceGraph&, SourceIterator, SourceIterator, Buffer&, BFSVisitor, ColorMap) [with IncidenceGraph = filtered_graph > > >, no_property, listS>, is_residual_edge > > >, edge_residual_capacity_t> >, keep_all>; Buffer = queue > >; BFSVisitor = bfs_visitor*, on_tree_edge> >; ColorMap = default_color_type*; SourceIterator = long unsigned int*]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/breadth_first_search.hpp:136:24: required from ‘void boost::breadth_first_search(const VertexListGraph&, SourceIterator, SourceIterator, Buffer&, BFSVisitor, ColorMap) [with VertexListGraph = filtered_graph > > >, no_property, listS>, is_residual_edge > > >, edge_residual_capacity_t> >, keep_all>; SourceIterator = long unsigned int*; Buffer = queue > >; BFSVisitor = bfs_visitor*, on_tree_edge> >; ColorMap = default_color_type*]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/breadth_first_search.hpp:147:25: required from ‘void boost::breadth_first_search(const VertexListGraph&, typename graph_traits::vertex_descriptor, Buffer&, BFSVisitor, ColorMap) [with VertexListGraph = filtered_graph > > >, no_property, listS>, is_residual_edge > > >, edge_residual_capacity_t> >, keep_all>; Buffer = queue > >; BFSVisitor = bfs_visitor*, on_tree_edge> >; ColorMap = default_color_type*; typename graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/edmonds_karp_max_flow.hpp:101:29: required from ‘typename boost::property_traits::value_type boost::edmonds_karp_max_flow(Graph&, typename graph_traits::vertex_descriptor, typename graph_traits::vertex_descriptor, CapacityEdgeMap, ResidualCapacityEdgeMap, ReverseEdgeMap, ColorMap, PredEdgeMap) [with Graph = adjacency_list > > >, no_property, listS>; CapacityEdgeMap = adj_list_edge_property_map > > >, edge_capacity_t>; ResidualCapacityEdgeMap = adj_list_edge_property_map > > >, edge_residual_capacity_t>; ReverseEdgeMap = adj_list_edge_property_map, detail::edge_desc_impl&, long unsigned int, property > > >, edge_reverse_t>; ColorMap = default_color_type*; PredEdgeMap = detail::edge_desc_impl*; typename property_traits::value_type = long unsigned int; typename graph_traits::vertex_descriptor = long unsigned int]’ mincut.hpp:78:21: required from ‘typename boost::graph_traits::edges_size_type boost::min_cut(VertexListGraph&, OutputIterator, OutputIterator) [with VertexListGraph = const R_adjacency_list; OutputIterator = std::back_insert_iterator >; typename graph_traits::edges_size_type = long unsigned int]’ hcs.cpp:299:31: required from here /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::EqualityComparable::~EqualityComparable() [with TT = boost::detail::edge_desc_impl]’ 37 | ~model() | ^ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:233:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 233 | BOOST_CONCEPT_USAGE(EqualityComparable) { | ^~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements > >]’: /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:145:5: required from ‘struct boost::Assignable >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::Assignable >]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied > >::value’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied > >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_ >)>’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/graph_concepts.hpp:92:9: [ skipping 2 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/breadth_first_search.hpp:62:5: required from ‘void boost::breadth_first_visit(const IncidenceGraph&, SourceIterator, SourceIterator, Buffer&, BFSVisitor, ColorMap) [with IncidenceGraph = filtered_graph > > >, no_property, listS>, is_residual_edge > > >, edge_residual_capacity_t> >, keep_all>; Buffer = queue > >; BFSVisitor = bfs_visitor*, on_tree_edge> >; ColorMap = default_color_type*; SourceIterator = long unsigned int*]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/breadth_first_search.hpp:136:24: required from ‘void boost::breadth_first_search(const VertexListGraph&, SourceIterator, SourceIterator, Buffer&, BFSVisitor, ColorMap) [with VertexListGraph = filtered_graph > > >, no_property, listS>, is_residual_edge > > >, edge_residual_capacity_t> >, keep_all>; SourceIterator = long unsigned int*; Buffer = queue > >; BFSVisitor = bfs_visitor*, on_tree_edge> >; ColorMap = default_color_type*]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/breadth_first_search.hpp:147:25: required from ‘void boost::breadth_first_search(const VertexListGraph&, typename graph_traits::vertex_descriptor, Buffer&, BFSVisitor, ColorMap) [with VertexListGraph = filtered_graph > > >, no_property, listS>, is_residual_edge > > >, edge_residual_capacity_t> >, keep_all>; Buffer = queue > >; BFSVisitor = bfs_visitor*, on_tree_edge> >; ColorMap = default_color_type*; typename graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/edmonds_karp_max_flow.hpp:101:29: required from ‘typename boost::property_traits::value_type boost::edmonds_karp_max_flow(Graph&, typename graph_traits::vertex_descriptor, typename graph_traits::vertex_descriptor, CapacityEdgeMap, ResidualCapacityEdgeMap, ReverseEdgeMap, ColorMap, PredEdgeMap) [with Graph = adjacency_list > > >, no_property, listS>; CapacityEdgeMap = adj_list_edge_property_map > > >, edge_capacity_t>; ResidualCapacityEdgeMap = adj_list_edge_property_map > > >, edge_residual_capacity_t>; ReverseEdgeMap = adj_list_edge_property_map, detail::edge_desc_impl&, long unsigned int, property > > >, edge_reverse_t>; ColorMap = default_color_type*; PredEdgeMap = detail::edge_desc_impl*; typename property_traits::value_type = long unsigned int; typename graph_traits::vertex_descriptor = long unsigned int]’ mincut.hpp:78:21: required from ‘typename boost::graph_traits::edges_size_type boost::min_cut(VertexListGraph&, OutputIterator, OutputIterator) [with VertexListGraph = const R_adjacency_list; OutputIterator = std::back_insert_iterator >; typename graph_traits::edges_size_type = long unsigned int]’ hcs.cpp:299:31: required from here /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::Assignable >]’ 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ^ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::Assignable >]’: /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/graph_concepts.hpp:92:9: required from ‘boost::concepts::IncidenceGraph::~IncidenceGraph() [with G = boost::filtered_graph > > >, boost::no_property, boost::listS>, boost::is_residual_edge > > >, boost::edge_residual_capacity_t> >, boost::keep_all>]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/graph_concepts.hpp:75:1: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::IncidenceGraphConcept > > >, boost::no_property, boost::listS>, boost::is_residual_edge > > >, boost::edge_residual_capacity_t> >, boost::keep_all> >]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/breadth_first_search.hpp:62:5: required from ‘void boost::breadth_first_visit(const IncidenceGraph&, SourceIterator, SourceIterator, Buffer&, BFSVisitor, ColorMap) [with IncidenceGraph = filtered_graph > > >, no_property, listS>, is_residual_edge > > >, edge_residual_capacity_t> >, keep_all>; Buffer = queue > >; BFSVisitor = bfs_visitor*, on_tree_edge> >; ColorMap = default_color_type*; SourceIterator = long unsigned int*]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/breadth_first_search.hpp:136:24: required from ‘void boost::breadth_first_search(const VertexListGraph&, SourceIterator, SourceIterator, Buffer&, BFSVisitor, ColorMap) [with VertexListGraph = filtered_graph > > >, no_property, listS>, is_residual_edge > > >, edge_residual_capacity_t> >, keep_all>; SourceIterator = long unsigned int*; Buffer = queue > >; BFSVisitor = bfs_visitor*, on_tree_edge> >; ColorMap = default_color_type*]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/breadth_first_search.hpp:147:25: required from ‘void boost::breadth_first_search(const VertexListGraph&, typename graph_traits::vertex_descriptor, Buffer&, BFSVisitor, ColorMap) [with VertexListGraph = filtered_graph > > >, no_property, listS>, is_residual_edge > > >, edge_residual_capacity_t> >, keep_all>; Buffer = queue > >; BFSVisitor = bfs_visitor*, on_tree_edge> >; ColorMap = default_color_type*; typename graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/edmonds_karp_max_flow.hpp:101:29: required from ‘typename boost::property_traits::value_type boost::edmonds_karp_max_flow(Graph&, typename graph_traits::vertex_descriptor, typename graph_traits::vertex_descriptor, CapacityEdgeMap, ResidualCapacityEdgeMap, ReverseEdgeMap, ColorMap, PredEdgeMap) [with Graph = adjacency_list > > >, no_property, listS>; CapacityEdgeMap = adj_list_edge_property_map > > >, edge_capacity_t>; ResidualCapacityEdgeMap = adj_list_edge_property_map > > >, edge_residual_capacity_t>; ReverseEdgeMap = adj_list_edge_property_map, detail::edge_desc_impl&, long unsigned int, property > > >, edge_reverse_t>; ColorMap = default_color_type*; PredEdgeMap = detail::edge_desc_impl*; typename property_traits::value_type = long unsigned int; typename graph_traits::vertex_descriptor = long unsigned int]’ mincut.hpp:78:21: required from ‘typename boost::graph_traits::edges_size_type boost::min_cut(VertexListGraph&, OutputIterator, OutputIterator) [with VertexListGraph = const R_adjacency_list; OutputIterator = std::back_insert_iterator >; typename graph_traits::edges_size_type = long unsigned int]’ hcs.cpp:299:31: required from here /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::Assignable::~Assignable() [with TT = boost::detail::edge_desc_impl]’ 37 | ~model() | ^ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:145:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 145 | BOOST_CONCEPT_USAGE(Assignable) { | ^~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements >]’: /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:208:5: required from ‘struct boost::Convertible’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::Convertible]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied >::value’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_)>’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/graph_concepts.hpp:93:9: [ skipping 2 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/breadth_first_search.hpp:62:5: required from ‘void boost::breadth_first_visit(const IncidenceGraph&, SourceIterator, SourceIterator, Buffer&, BFSVisitor, ColorMap) [with IncidenceGraph = filtered_graph > > >, no_property, listS>, is_residual_edge > > >, edge_residual_capacity_t> >, keep_all>; Buffer = queue > >; BFSVisitor = bfs_visitor*, on_tree_edge> >; ColorMap = default_color_type*; SourceIterator = long unsigned int*]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/breadth_first_search.hpp:136:24: required from ‘void boost::breadth_first_search(const VertexListGraph&, SourceIterator, SourceIterator, Buffer&, BFSVisitor, ColorMap) [with VertexListGraph = filtered_graph > > >, no_property, listS>, is_residual_edge > > >, edge_residual_capacity_t> >, keep_all>; SourceIterator = long unsigned int*; Buffer = queue > >; BFSVisitor = bfs_visitor*, on_tree_edge> >; ColorMap = default_color_type*]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/breadth_first_search.hpp:147:25: required from ‘void boost::breadth_first_search(const VertexListGraph&, typename graph_traits::vertex_descriptor, Buffer&, BFSVisitor, ColorMap) [with VertexListGraph = filtered_graph > > >, no_property, listS>, is_residual_edge > > >, edge_residual_capacity_t> >, keep_all>; Buffer = queue > >; BFSVisitor = bfs_visitor*, on_tree_edge> >; ColorMap = default_color_type*; typename graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/edmonds_karp_max_flow.hpp:101:29: required from ‘typename boost::property_traits::value_type boost::edmonds_karp_max_flow(Graph&, typename graph_traits::vertex_descriptor, typename graph_traits::vertex_descriptor, CapacityEdgeMap, ResidualCapacityEdgeMap, ReverseEdgeMap, ColorMap, PredEdgeMap) [with Graph = adjacency_list > > >, no_property, listS>; CapacityEdgeMap = adj_list_edge_property_map > > >, edge_capacity_t>; ResidualCapacityEdgeMap = adj_list_edge_property_map > > >, edge_residual_capacity_t>; ReverseEdgeMap = adj_list_edge_property_map, detail::edge_desc_impl&, long unsigned int, property > > >, edge_reverse_t>; ColorMap = default_color_type*; PredEdgeMap = detail::edge_desc_impl*; typename property_traits::value_type = long unsigned int; typename graph_traits::vertex_descriptor = long unsigned int]’ mincut.hpp:78:21: required from ‘typename boost::graph_traits::edges_size_type boost::min_cut(VertexListGraph&, OutputIterator, OutputIterator) [with VertexListGraph = const R_adjacency_list; OutputIterator = std::back_insert_iterator >; typename graph_traits::edges_size_type = long unsigned int]’ hcs.cpp:299:31: required from here /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::Convertible]’ 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ^ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::Convertible]’: /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/graph_concepts.hpp:93:9: required from ‘boost::concepts::IncidenceGraph::~IncidenceGraph() [with G = boost::filtered_graph > > >, boost::no_property, boost::listS>, boost::is_residual_edge > > >, boost::edge_residual_capacity_t> >, boost::keep_all>]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/graph_concepts.hpp:75:1: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::IncidenceGraphConcept > > >, boost::no_property, boost::listS>, boost::is_residual_edge > > >, boost::edge_residual_capacity_t> >, boost::keep_all> >]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/breadth_first_search.hpp:62:5: required from ‘void boost::breadth_first_visit(const IncidenceGraph&, SourceIterator, SourceIterator, Buffer&, BFSVisitor, ColorMap) [with IncidenceGraph = filtered_graph > > >, no_property, listS>, is_residual_edge > > >, edge_residual_capacity_t> >, keep_all>; Buffer = queue > >; BFSVisitor = bfs_visitor*, on_tree_edge> >; ColorMap = default_color_type*; SourceIterator = long unsigned int*]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/breadth_first_search.hpp:136:24: required from ‘void boost::breadth_first_search(const VertexListGraph&, SourceIterator, SourceIterator, Buffer&, BFSVisitor, ColorMap) [with VertexListGraph = filtered_graph > > >, no_property, listS>, is_residual_edge > > >, edge_residual_capacity_t> >, keep_all>; SourceIterator = long unsigned int*; Buffer = queue > >; BFSVisitor = bfs_visitor*, on_tree_edge> >; ColorMap = default_color_type*]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/breadth_first_search.hpp:147:25: required from ‘void boost::breadth_first_search(const VertexListGraph&, typename graph_traits::vertex_descriptor, Buffer&, BFSVisitor, ColorMap) [with VertexListGraph = filtered_graph > > >, no_property, listS>, is_residual_edge > > >, edge_residual_capacity_t> >, keep_all>; Buffer = queue > >; BFSVisitor = bfs_visitor*, on_tree_edge> >; ColorMap = default_color_type*; typename graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/edmonds_karp_max_flow.hpp:101:29: required from ‘typename boost::property_traits::value_type boost::edmonds_karp_max_flow(Graph&, typename graph_traits::vertex_descriptor, typename graph_traits::vertex_descriptor, CapacityEdgeMap, ResidualCapacityEdgeMap, ReverseEdgeMap, ColorMap, PredEdgeMap) [with Graph = adjacency_list > > >, no_property, listS>; CapacityEdgeMap = adj_list_edge_property_map > > >, edge_capacity_t>; ResidualCapacityEdgeMap = adj_list_edge_property_map > > >, edge_residual_capacity_t>; ReverseEdgeMap = adj_list_edge_property_map, detail::edge_desc_impl&, long unsigned int, property > > >, edge_reverse_t>; ColorMap = default_color_type*; PredEdgeMap = detail::edge_desc_impl*; typename property_traits::value_type = long unsigned int; typename graph_traits::vertex_descriptor = long unsigned int]’ mincut.hpp:78:21: required from ‘typename boost::graph_traits::edges_size_type boost::min_cut(VertexListGraph&, OutputIterator, OutputIterator) [with VertexListGraph = const R_adjacency_list; OutputIterator = std::back_insert_iterator >; typename graph_traits::edges_size_type = long unsigned int]’ hcs.cpp:299:31: required from here /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::Convertible::~Convertible() [with X = boost::adj_list_dir_traversal_tag; Y = boost::incidence_graph_tag]’ 37 | ~model() | ^ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:208:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 208 | BOOST_CONCEPT_USAGE(Convertible) { | ^~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::CopyConstructible*, boost::on_tree_edge> > >]’: /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements*, boost::on_tree_edge> > > >]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:167:5: required from ‘struct boost::CopyConstructible*, boost::on_tree_edge> > >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:165:3: required from ‘struct boost::CopyConstructibleConcept*, boost::on_tree_edge> > >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::CopyConstructibleConcept*, boost::on_tree_edge> > >]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied*, boost::on_tree_edge> > > >::value’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:45:51: [ skipping 7 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/breadth_first_search.hpp:65:5: required from ‘void boost::breadth_first_visit(const IncidenceGraph&, SourceIterator, SourceIterator, Buffer&, BFSVisitor, ColorMap) [with IncidenceGraph = filtered_graph > > >, no_property, listS>, is_residual_edge > > >, edge_residual_capacity_t> >, keep_all>; Buffer = queue > >; BFSVisitor = bfs_visitor*, on_tree_edge> >; ColorMap = default_color_type*; SourceIterator = long unsigned int*]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/breadth_first_search.hpp:136:24: required from ‘void boost::breadth_first_search(const VertexListGraph&, SourceIterator, SourceIterator, Buffer&, BFSVisitor, ColorMap) [with VertexListGraph = filtered_graph > > >, no_property, listS>, is_residual_edge > > >, edge_residual_capacity_t> >, keep_all>; SourceIterator = long unsigned int*; Buffer = queue > >; BFSVisitor = bfs_visitor*, on_tree_edge> >; ColorMap = default_color_type*]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/breadth_first_search.hpp:147:25: required from ‘void boost::breadth_first_search(const VertexListGraph&, typename graph_traits::vertex_descriptor, Buffer&, BFSVisitor, ColorMap) [with VertexListGraph = filtered_graph > > >, no_property, listS>, is_residual_edge > > >, edge_residual_capacity_t> >, keep_all>; Buffer = queue > >; BFSVisitor = bfs_visitor*, on_tree_edge> >; ColorMap = default_color_type*; typename graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/edmonds_karp_max_flow.hpp:101:29: required from ‘typename boost::property_traits::value_type boost::edmonds_karp_max_flow(Graph&, typename graph_traits::vertex_descriptor, typename graph_traits::vertex_descriptor, CapacityEdgeMap, ResidualCapacityEdgeMap, ReverseEdgeMap, ColorMap, PredEdgeMap) [with Graph = adjacency_list > > >, no_property, listS>; CapacityEdgeMap = adj_list_edge_property_map > > >, edge_capacity_t>; ResidualCapacityEdgeMap = adj_list_edge_property_map > > >, edge_residual_capacity_t>; ReverseEdgeMap = adj_list_edge_property_map, detail::edge_desc_impl&, long unsigned int, property > > >, edge_reverse_t>; ColorMap = default_color_type*; PredEdgeMap = detail::edge_desc_impl*; typename property_traits::value_type = long unsigned int; typename graph_traits::vertex_descriptor = long unsigned int]’ mincut.hpp:78:21: required from ‘typename boost::graph_traits::edges_size_type boost::min_cut(VertexListGraph&, OutputIterator, OutputIterator) [with VertexListGraph = const R_adjacency_list; OutputIterator = std::back_insert_iterator >; typename graph_traits::edges_size_type = long unsigned int]’ hcs.cpp:299:31: required from here /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::CopyConstructible::~CopyConstructible() [with TT = boost::bfs_visitor*, boost::on_tree_edge> >]’ 37 | ~model() | ^ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:167:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 167 | BOOST_CONCEPT_USAGE(CopyConstructible) { | ^~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements >]’: /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:208:5: required from ‘struct boost::Convertible’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:206:3: required from ‘struct boost::ConvertibleConcept’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::ConvertibleConcept]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied >::value’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:72:8: [ skipping 11 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/breadth_first_search.hpp:66:5: required from ‘void boost::breadth_first_visit(const IncidenceGraph&, SourceIterator, SourceIterator, Buffer&, BFSVisitor, ColorMap) [with IncidenceGraph = filtered_graph > > >, no_property, listS>, is_residual_edge > > >, edge_residual_capacity_t> >, keep_all>; Buffer = queue > >; BFSVisitor = bfs_visitor*, on_tree_edge> >; ColorMap = default_color_type*; SourceIterator = long unsigned int*]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/breadth_first_search.hpp:136:24: required from ‘void boost::breadth_first_search(const VertexListGraph&, SourceIterator, SourceIterator, Buffer&, BFSVisitor, ColorMap) [with VertexListGraph = filtered_graph > > >, no_property, listS>, is_residual_edge > > >, edge_residual_capacity_t> >, keep_all>; SourceIterator = long unsigned int*; Buffer = queue > >; BFSVisitor = bfs_visitor*, on_tree_edge> >; ColorMap = default_color_type*]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/breadth_first_search.hpp:147:25: required from ‘void boost::breadth_first_search(const VertexListGraph&, typename graph_traits::vertex_descriptor, Buffer&, BFSVisitor, ColorMap) [with VertexListGraph = filtered_graph > > >, no_property, listS>, is_residual_edge > > >, edge_residual_capacity_t> >, keep_all>; Buffer = queue > >; BFSVisitor = bfs_visitor*, on_tree_edge> >; ColorMap = default_color_type*; typename graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/edmonds_karp_max_flow.hpp:101:29: required from ‘typename boost::property_traits::value_type boost::edmonds_karp_max_flow(Graph&, typename graph_traits::vertex_descriptor, typename graph_traits::vertex_descriptor, CapacityEdgeMap, ResidualCapacityEdgeMap, ReverseEdgeMap, ColorMap, PredEdgeMap) [with Graph = adjacency_list > > >, no_property, listS>; CapacityEdgeMap = adj_list_edge_property_map > > >, edge_capacity_t>; ResidualCapacityEdgeMap = adj_list_edge_property_map > > >, edge_residual_capacity_t>; ReverseEdgeMap = adj_list_edge_property_map, detail::edge_desc_impl&, long unsigned int, property > > >, edge_reverse_t>; ColorMap = default_color_type*; PredEdgeMap = detail::edge_desc_impl*; typename property_traits::value_type = long unsigned int; typename graph_traits::vertex_descriptor = long unsigned int]’ mincut.hpp:78:21: required from ‘typename boost::graph_traits::edges_size_type boost::min_cut(VertexListGraph&, OutputIterator, OutputIterator) [with VertexListGraph = const R_adjacency_list; OutputIterator = std::back_insert_iterator >; typename graph_traits::edges_size_type = long unsigned int]’ hcs.cpp:299:31: required from here /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::Convertible]’ 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ^ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::ConvertibleConcept]’: /home/omnipath/local/R/4.4-3.20/BH/include/boost/property_map/property_map.hpp:148:7: required from ‘void boost::ReadablePropertyMapConcept::constraints() [with PMap = boost::default_color_type*; Key = long unsigned int]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::ReadablePropertyMapConcept]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied >::value’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_)>’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/property_map/property_map.hpp:206:7: [ skipping 5 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/breadth_first_search.hpp:66:5: required from ‘void boost::breadth_first_visit(const IncidenceGraph&, SourceIterator, SourceIterator, Buffer&, BFSVisitor, ColorMap) [with IncidenceGraph = filtered_graph > > >, no_property, listS>, is_residual_edge > > >, edge_residual_capacity_t> >, keep_all>; Buffer = queue > >; BFSVisitor = bfs_visitor*, on_tree_edge> >; ColorMap = default_color_type*; SourceIterator = long unsigned int*]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/breadth_first_search.hpp:136:24: required from ‘void boost::breadth_first_search(const VertexListGraph&, SourceIterator, SourceIterator, Buffer&, BFSVisitor, ColorMap) [with VertexListGraph = filtered_graph > > >, no_property, listS>, is_residual_edge > > >, edge_residual_capacity_t> >, keep_all>; SourceIterator = long unsigned int*; Buffer = queue > >; BFSVisitor = bfs_visitor*, on_tree_edge> >; ColorMap = default_color_type*]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/breadth_first_search.hpp:147:25: required from ‘void boost::breadth_first_search(const VertexListGraph&, typename graph_traits::vertex_descriptor, Buffer&, BFSVisitor, ColorMap) [with VertexListGraph = filtered_graph > > >, no_property, listS>, is_residual_edge > > >, edge_residual_capacity_t> >, keep_all>; Buffer = queue > >; BFSVisitor = bfs_visitor*, on_tree_edge> >; ColorMap = default_color_type*; typename graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/edmonds_karp_max_flow.hpp:101:29: required from ‘typename boost::property_traits::value_type boost::edmonds_karp_max_flow(Graph&, typename graph_traits::vertex_descriptor, typename graph_traits::vertex_descriptor, CapacityEdgeMap, ResidualCapacityEdgeMap, ReverseEdgeMap, ColorMap, PredEdgeMap) [with Graph = adjacency_list > > >, no_property, listS>; CapacityEdgeMap = adj_list_edge_property_map > > >, edge_capacity_t>; ResidualCapacityEdgeMap = adj_list_edge_property_map > > >, edge_residual_capacity_t>; ReverseEdgeMap = adj_list_edge_property_map, detail::edge_desc_impl&, long unsigned int, property > > >, edge_reverse_t>; ColorMap = default_color_type*; PredEdgeMap = detail::edge_desc_impl*; typename property_traits::value_type = long unsigned int; typename graph_traits::vertex_descriptor = long unsigned int]’ mincut.hpp:78:21: required from ‘typename boost::graph_traits::edges_size_type boost::min_cut(VertexListGraph&, OutputIterator, OutputIterator) [with VertexListGraph = const R_adjacency_list; OutputIterator = std::back_insert_iterator >; typename graph_traits::edges_size_type = long unsigned int]’ hcs.cpp:299:31: required from here /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:206:17: note: in a call to non-static member function ‘boost::ConvertibleConcept::~ConvertibleConcept()’ 206 | BOOST_concept(Convertible,(X)(Y)) | ^~~~~~~~~~~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/preprocessor/cat.hpp:29:34: note: in definition of macro ‘BOOST_PP_CAT_I’ 29 | # define BOOST_PP_CAT_I(a, b) a ## b | ^ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/concept_def.hpp:23:12: note: in expansion of macro ‘BOOST_PP_CAT’ 23 | struct BOOST_PP_CAT(name,Concept) \ | ^~~~~~~~~~~~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:206:3: note: in expansion of macro ‘BOOST_concept’ 206 | BOOST_concept(Convertible,(X)(Y)) | ^~~~~~~~~~~~~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements >]’: /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:208:5: required from ‘struct boost::Convertible’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:206:3: required from ‘struct boost::ConvertibleConcept’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::ConvertibleConcept]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied >::value’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:72:8: [ skipping 11 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/breadth_first_search.hpp:66:5: required from ‘void boost::breadth_first_visit(const IncidenceGraph&, SourceIterator, SourceIterator, Buffer&, BFSVisitor, ColorMap) [with IncidenceGraph = filtered_graph > > >, no_property, listS>, is_residual_edge > > >, edge_residual_capacity_t> >, keep_all>; Buffer = queue > >; BFSVisitor = bfs_visitor*, on_tree_edge> >; ColorMap = default_color_type*; SourceIterator = long unsigned int*]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/breadth_first_search.hpp:136:24: required from ‘void boost::breadth_first_search(const VertexListGraph&, SourceIterator, SourceIterator, Buffer&, BFSVisitor, ColorMap) [with VertexListGraph = filtered_graph > > >, no_property, listS>, is_residual_edge > > >, edge_residual_capacity_t> >, keep_all>; SourceIterator = long unsigned int*; Buffer = queue > >; BFSVisitor = bfs_visitor*, on_tree_edge> >; ColorMap = default_color_type*]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/breadth_first_search.hpp:147:25: required from ‘void boost::breadth_first_search(const VertexListGraph&, typename graph_traits::vertex_descriptor, Buffer&, BFSVisitor, ColorMap) [with VertexListGraph = filtered_graph > > >, no_property, listS>, is_residual_edge > > >, edge_residual_capacity_t> >, keep_all>; Buffer = queue > >; BFSVisitor = bfs_visitor*, on_tree_edge> >; ColorMap = default_color_type*; typename graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/edmonds_karp_max_flow.hpp:101:29: required from ‘typename boost::property_traits::value_type boost::edmonds_karp_max_flow(Graph&, typename graph_traits::vertex_descriptor, typename graph_traits::vertex_descriptor, CapacityEdgeMap, ResidualCapacityEdgeMap, ReverseEdgeMap, ColorMap, PredEdgeMap) [with Graph = adjacency_list > > >, no_property, listS>; CapacityEdgeMap = adj_list_edge_property_map > > >, edge_capacity_t>; ResidualCapacityEdgeMap = adj_list_edge_property_map > > >, edge_residual_capacity_t>; ReverseEdgeMap = adj_list_edge_property_map, detail::edge_desc_impl&, long unsigned int, property > > >, edge_reverse_t>; ColorMap = default_color_type*; PredEdgeMap = detail::edge_desc_impl*; typename property_traits::value_type = long unsigned int; typename graph_traits::vertex_descriptor = long unsigned int]’ mincut.hpp:78:21: required from ‘typename boost::graph_traits::edges_size_type boost::min_cut(VertexListGraph&, OutputIterator, OutputIterator) [with VertexListGraph = const R_adjacency_list; OutputIterator = std::back_insert_iterator >; typename graph_traits::edges_size_type = long unsigned int]’ hcs.cpp:299:31: required from here /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::Convertible]’ 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ^ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::ConvertibleConcept]’: /home/omnipath/local/R/4.4-3.20/BH/include/boost/property_map/property_map.hpp:180:7: required from ‘void boost::WritablePropertyMapConcept::constraints() [with PMap = boost::default_color_type*; Key = long unsigned int]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::WritablePropertyMapConcept]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied >::value’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_)>’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/property_map/property_map.hpp:207:7: [ skipping 5 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/breadth_first_search.hpp:66:5: required from ‘void boost::breadth_first_visit(const IncidenceGraph&, SourceIterator, SourceIterator, Buffer&, BFSVisitor, ColorMap) [with IncidenceGraph = filtered_graph > > >, no_property, listS>, is_residual_edge > > >, edge_residual_capacity_t> >, keep_all>; Buffer = queue > >; BFSVisitor = bfs_visitor*, on_tree_edge> >; ColorMap = default_color_type*; SourceIterator = long unsigned int*]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/breadth_first_search.hpp:136:24: required from ‘void boost::breadth_first_search(const VertexListGraph&, SourceIterator, SourceIterator, Buffer&, BFSVisitor, ColorMap) [with VertexListGraph = filtered_graph > > >, no_property, listS>, is_residual_edge > > >, edge_residual_capacity_t> >, keep_all>; SourceIterator = long unsigned int*; Buffer = queue > >; BFSVisitor = bfs_visitor*, on_tree_edge> >; ColorMap = default_color_type*]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/breadth_first_search.hpp:147:25: required from ‘void boost::breadth_first_search(const VertexListGraph&, typename graph_traits::vertex_descriptor, Buffer&, BFSVisitor, ColorMap) [with VertexListGraph = filtered_graph > > >, no_property, listS>, is_residual_edge > > >, edge_residual_capacity_t> >, keep_all>; Buffer = queue > >; BFSVisitor = bfs_visitor*, on_tree_edge> >; ColorMap = default_color_type*; typename graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/edmonds_karp_max_flow.hpp:101:29: required from ‘typename boost::property_traits::value_type boost::edmonds_karp_max_flow(Graph&, typename graph_traits::vertex_descriptor, typename graph_traits::vertex_descriptor, CapacityEdgeMap, ResidualCapacityEdgeMap, ReverseEdgeMap, ColorMap, PredEdgeMap) [with Graph = adjacency_list > > >, no_property, listS>; CapacityEdgeMap = adj_list_edge_property_map > > >, edge_capacity_t>; ResidualCapacityEdgeMap = adj_list_edge_property_map > > >, edge_residual_capacity_t>; ReverseEdgeMap = adj_list_edge_property_map, detail::edge_desc_impl&, long unsigned int, property > > >, edge_reverse_t>; ColorMap = default_color_type*; PredEdgeMap = detail::edge_desc_impl*; typename property_traits::value_type = long unsigned int; typename graph_traits::vertex_descriptor = long unsigned int]’ mincut.hpp:78:21: required from ‘typename boost::graph_traits::edges_size_type boost::min_cut(VertexListGraph&, OutputIterator, OutputIterator) [with VertexListGraph = const R_adjacency_list; OutputIterator = std::back_insert_iterator >; typename graph_traits::edges_size_type = long unsigned int]’ hcs.cpp:299:31: required from here /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:206:17: note: in a call to non-static member function ‘boost::ConvertibleConcept::~ConvertibleConcept()’ 206 | BOOST_concept(Convertible,(X)(Y)) | ^~~~~~~~~~~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/preprocessor/cat.hpp:29:34: note: in definition of macro ‘BOOST_PP_CAT_I’ 29 | # define BOOST_PP_CAT_I(a, b) a ## b | ^ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/concept_def.hpp:23:12: note: in expansion of macro ‘BOOST_PP_CAT’ 23 | struct BOOST_PP_CAT(name,Concept) \ | ^~~~~~~~~~~~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:206:3: note: in expansion of macro ‘BOOST_concept’ 206 | BOOST_concept(Convertible,(X)(Y)) | ^~~~~~~~~~~~~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::Convertible]’: /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements >]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:208:5: required from ‘struct boost::Convertible’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:206:3: required from ‘struct boost::ConvertibleConcept’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::ConvertibleConcept]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied >::value’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:45:51: [ skipping 7 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/breadth_first_search.hpp:66:5: required from ‘void boost::breadth_first_visit(const IncidenceGraph&, SourceIterator, SourceIterator, Buffer&, BFSVisitor, ColorMap) [with IncidenceGraph = filtered_graph > > >, no_property, listS>, is_residual_edge > > >, edge_residual_capacity_t> >, keep_all>; Buffer = queue > >; BFSVisitor = bfs_visitor*, on_tree_edge> >; ColorMap = default_color_type*; SourceIterator = long unsigned int*]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/breadth_first_search.hpp:136:24: required from ‘void boost::breadth_first_search(const VertexListGraph&, SourceIterator, SourceIterator, Buffer&, BFSVisitor, ColorMap) [with VertexListGraph = filtered_graph > > >, no_property, listS>, is_residual_edge > > >, edge_residual_capacity_t> >, keep_all>; SourceIterator = long unsigned int*; Buffer = queue > >; BFSVisitor = bfs_visitor*, on_tree_edge> >; ColorMap = default_color_type*]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/breadth_first_search.hpp:147:25: required from ‘void boost::breadth_first_search(const VertexListGraph&, typename graph_traits::vertex_descriptor, Buffer&, BFSVisitor, ColorMap) [with VertexListGraph = filtered_graph > > >, no_property, listS>, is_residual_edge > > >, edge_residual_capacity_t> >, keep_all>; Buffer = queue > >; BFSVisitor = bfs_visitor*, on_tree_edge> >; ColorMap = default_color_type*; typename graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/edmonds_karp_max_flow.hpp:101:29: required from ‘typename boost::property_traits::value_type boost::edmonds_karp_max_flow(Graph&, typename graph_traits::vertex_descriptor, typename graph_traits::vertex_descriptor, CapacityEdgeMap, ResidualCapacityEdgeMap, ReverseEdgeMap, ColorMap, PredEdgeMap) [with Graph = adjacency_list > > >, no_property, listS>; CapacityEdgeMap = adj_list_edge_property_map > > >, edge_capacity_t>; ResidualCapacityEdgeMap = adj_list_edge_property_map > > >, edge_residual_capacity_t>; ReverseEdgeMap = adj_list_edge_property_map, detail::edge_desc_impl&, long unsigned int, property > > >, edge_reverse_t>; ColorMap = default_color_type*; PredEdgeMap = detail::edge_desc_impl*; typename property_traits::value_type = long unsigned int; typename graph_traits::vertex_descriptor = long unsigned int]’ mincut.hpp:78:21: required from ‘typename boost::graph_traits::edges_size_type boost::min_cut(VertexListGraph&, OutputIterator, OutputIterator) [with VertexListGraph = const R_adjacency_list; OutputIterator = std::back_insert_iterator >; typename graph_traits::edges_size_type = long unsigned int]’ hcs.cpp:299:31: required from here /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::Convertible::~Convertible() [with X = boost::lvalue_property_map_tag; Y = boost::read_write_property_map_tag]’ 37 | ~model() | ^ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:208:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 208 | BOOST_CONCEPT_USAGE(Convertible) { | ^~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements >]’: /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:137:5: required from ‘struct boost::DefaultConstructible’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::DefaultConstructible]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied >::value’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_)>’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/graph_concepts.hpp:68:9: [ skipping 10 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/breadth_first_search.hpp:62:5: required from ‘void boost::breadth_first_visit(const IncidenceGraph&, SourceIterator, SourceIterator, Buffer&, BFSVisitor, ColorMap) [with IncidenceGraph = filtered_graph > > >, no_property, listS>, is_residual_edge > > >, edge_residual_capacity_t> >, keep_all>; Buffer = queue > >; BFSVisitor = bfs_visitor*, on_tree_edge> >; ColorMap = default_color_type*; SourceIterator = long unsigned int*]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/breadth_first_search.hpp:136:24: required from ‘void boost::breadth_first_search(const VertexListGraph&, SourceIterator, SourceIterator, Buffer&, BFSVisitor, ColorMap) [with VertexListGraph = filtered_graph > > >, no_property, listS>, is_residual_edge > > >, edge_residual_capacity_t> >, keep_all>; SourceIterator = long unsigned int*; Buffer = queue > >; BFSVisitor = bfs_visitor*, on_tree_edge> >; ColorMap = default_color_type*]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/breadth_first_search.hpp:147:25: required from ‘void boost::breadth_first_search(const VertexListGraph&, typename graph_traits::vertex_descriptor, Buffer&, BFSVisitor, ColorMap) [with VertexListGraph = filtered_graph > > >, no_property, listS>, is_residual_edge > > >, edge_residual_capacity_t> >, keep_all>; Buffer = queue > >; BFSVisitor = bfs_visitor*, on_tree_edge> >; ColorMap = default_color_type*; typename graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/edmonds_karp_max_flow.hpp:101:29: required from ‘typename boost::property_traits::value_type boost::edmonds_karp_max_flow(Graph&, typename graph_traits::vertex_descriptor, typename graph_traits::vertex_descriptor, CapacityEdgeMap, ResidualCapacityEdgeMap, ReverseEdgeMap, ColorMap, PredEdgeMap) [with Graph = adjacency_list > > >, no_property, listS>; CapacityEdgeMap = adj_list_edge_property_map > > >, edge_capacity_t>; ResidualCapacityEdgeMap = adj_list_edge_property_map > > >, edge_residual_capacity_t>; ReverseEdgeMap = adj_list_edge_property_map, detail::edge_desc_impl&, long unsigned int, property > > >, edge_reverse_t>; ColorMap = default_color_type*; PredEdgeMap = detail::edge_desc_impl*; typename property_traits::value_type = long unsigned int; typename graph_traits::vertex_descriptor = long unsigned int]’ mincut.hpp:78:21: required from ‘typename boost::graph_traits::edges_size_type boost::min_cut(VertexListGraph&, OutputIterator, OutputIterator) [with VertexListGraph = const R_adjacency_list; OutputIterator = std::back_insert_iterator >; typename graph_traits::edges_size_type = long unsigned int]’ hcs.cpp:299:31: required from here /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::DefaultConstructible]’ 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ^ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::DefaultConstructible]’: /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/graph_concepts.hpp:68:9: required from ‘boost::concepts::Graph::~Graph() [with G = boost::filtered_graph > > >, boost::no_property, boost::listS>, boost::is_residual_edge > > >, boost::edge_residual_capacity_t> >, boost::keep_all>]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/usage.hpp:20:48: required from ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::concepts::Graph > > >, boost::no_property, boost::listS>, boost::is_residual_edge > > >, boost::edge_residual_capacity_t> >, boost::keep_all> >]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements > > >, boost::no_property, boost::listS>, boost::is_residual_edge > > >, boost::edge_residual_capacity_t> >, boost::keep_all> > >]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/graph_concepts.hpp:66:5: required from ‘struct boost::concepts::Graph > > >, boost::no_property, boost::listS>, boost::is_residual_edge > > >, boost::edge_residual_capacity_t> >, boost::keep_all> >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/graph_concepts.hpp:75:1: required from ‘struct boost::concepts::IncidenceGraph > > >, boost::no_property, boost::listS>, boost::is_residual_edge > > >, boost::edge_residual_capacity_t> >, boost::keep_all> >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/graph_concepts.hpp:75:1: [ skipping 5 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/breadth_first_search.hpp:62:5: required from ‘void boost::breadth_first_visit(const IncidenceGraph&, SourceIterator, SourceIterator, Buffer&, BFSVisitor, ColorMap) [with IncidenceGraph = filtered_graph > > >, no_property, listS>, is_residual_edge > > >, edge_residual_capacity_t> >, keep_all>; Buffer = queue > >; BFSVisitor = bfs_visitor*, on_tree_edge> >; ColorMap = default_color_type*; SourceIterator = long unsigned int*]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/breadth_first_search.hpp:136:24: required from ‘void boost::breadth_first_search(const VertexListGraph&, SourceIterator, SourceIterator, Buffer&, BFSVisitor, ColorMap) [with VertexListGraph = filtered_graph > > >, no_property, listS>, is_residual_edge > > >, edge_residual_capacity_t> >, keep_all>; SourceIterator = long unsigned int*; Buffer = queue > >; BFSVisitor = bfs_visitor*, on_tree_edge> >; ColorMap = default_color_type*]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/breadth_first_search.hpp:147:25: required from ‘void boost::breadth_first_search(const VertexListGraph&, typename graph_traits::vertex_descriptor, Buffer&, BFSVisitor, ColorMap) [with VertexListGraph = filtered_graph > > >, no_property, listS>, is_residual_edge > > >, edge_residual_capacity_t> >, keep_all>; Buffer = queue > >; BFSVisitor = bfs_visitor*, on_tree_edge> >; ColorMap = default_color_type*; typename graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/edmonds_karp_max_flow.hpp:101:29: required from ‘typename boost::property_traits::value_type boost::edmonds_karp_max_flow(Graph&, typename graph_traits::vertex_descriptor, typename graph_traits::vertex_descriptor, CapacityEdgeMap, ResidualCapacityEdgeMap, ReverseEdgeMap, ColorMap, PredEdgeMap) [with Graph = adjacency_list > > >, no_property, listS>; CapacityEdgeMap = adj_list_edge_property_map > > >, edge_capacity_t>; ResidualCapacityEdgeMap = adj_list_edge_property_map > > >, edge_residual_capacity_t>; ReverseEdgeMap = adj_list_edge_property_map, detail::edge_desc_impl&, long unsigned int, property > > >, edge_reverse_t>; ColorMap = default_color_type*; PredEdgeMap = detail::edge_desc_impl*; typename property_traits::value_type = long unsigned int; typename graph_traits::vertex_descriptor = long unsigned int]’ mincut.hpp:78:21: required from ‘typename boost::graph_traits::edges_size_type boost::min_cut(VertexListGraph&, OutputIterator, OutputIterator) [with VertexListGraph = const R_adjacency_list; OutputIterator = std::back_insert_iterator >; typename graph_traits::edges_size_type = long unsigned int]’ hcs.cpp:299:31: required from here /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::DefaultConstructible::~DefaultConstructible() [with TT = long unsigned int]’ 37 | ~model() | ^ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:137:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 137 | BOOST_CONCEPT_USAGE(DefaultConstructible) { | ^~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements >]’: /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:233:5: required from ‘struct boost::EqualityComparable’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::EqualityComparable]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied >::value’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_)>’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/graph_concepts.hpp:69:9: [ skipping 10 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/breadth_first_search.hpp:62:5: required from ‘void boost::breadth_first_visit(const IncidenceGraph&, SourceIterator, SourceIterator, Buffer&, BFSVisitor, ColorMap) [with IncidenceGraph = filtered_graph > > >, no_property, listS>, is_residual_edge > > >, edge_residual_capacity_t> >, keep_all>; Buffer = queue > >; BFSVisitor = bfs_visitor*, on_tree_edge> >; ColorMap = default_color_type*; SourceIterator = long unsigned int*]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/breadth_first_search.hpp:136:24: required from ‘void boost::breadth_first_search(const VertexListGraph&, SourceIterator, SourceIterator, Buffer&, BFSVisitor, ColorMap) [with VertexListGraph = filtered_graph > > >, no_property, listS>, is_residual_edge > > >, edge_residual_capacity_t> >, keep_all>; SourceIterator = long unsigned int*; Buffer = queue > >; BFSVisitor = bfs_visitor*, on_tree_edge> >; ColorMap = default_color_type*]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/breadth_first_search.hpp:147:25: required from ‘void boost::breadth_first_search(const VertexListGraph&, typename graph_traits::vertex_descriptor, Buffer&, BFSVisitor, ColorMap) [with VertexListGraph = filtered_graph > > >, no_property, listS>, is_residual_edge > > >, edge_residual_capacity_t> >, keep_all>; Buffer = queue > >; BFSVisitor = bfs_visitor*, on_tree_edge> >; ColorMap = default_color_type*; typename graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/edmonds_karp_max_flow.hpp:101:29: required from ‘typename boost::property_traits::value_type boost::edmonds_karp_max_flow(Graph&, typename graph_traits::vertex_descriptor, typename graph_traits::vertex_descriptor, CapacityEdgeMap, ResidualCapacityEdgeMap, ReverseEdgeMap, ColorMap, PredEdgeMap) [with Graph = adjacency_list > > >, no_property, listS>; CapacityEdgeMap = adj_list_edge_property_map > > >, edge_capacity_t>; ResidualCapacityEdgeMap = adj_list_edge_property_map > > >, edge_residual_capacity_t>; ReverseEdgeMap = adj_list_edge_property_map, detail::edge_desc_impl&, long unsigned int, property > > >, edge_reverse_t>; ColorMap = default_color_type*; PredEdgeMap = detail::edge_desc_impl*; typename property_traits::value_type = long unsigned int; typename graph_traits::vertex_descriptor = long unsigned int]’ mincut.hpp:78:21: required from ‘typename boost::graph_traits::edges_size_type boost::min_cut(VertexListGraph&, OutputIterator, OutputIterator) [with VertexListGraph = const R_adjacency_list; OutputIterator = std::back_insert_iterator >; typename graph_traits::edges_size_type = long unsigned int]’ hcs.cpp:299:31: required from here /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::EqualityComparable]’ 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ^ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::EqualityComparable]’: /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/graph_concepts.hpp:69:9: required from ‘boost::concepts::Graph::~Graph() [with G = boost::filtered_graph > > >, boost::no_property, boost::listS>, boost::is_residual_edge > > >, boost::edge_residual_capacity_t> >, boost::keep_all>]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/usage.hpp:20:48: required from ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::concepts::Graph > > >, boost::no_property, boost::listS>, boost::is_residual_edge > > >, boost::edge_residual_capacity_t> >, boost::keep_all> >]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements > > >, boost::no_property, boost::listS>, boost::is_residual_edge > > >, boost::edge_residual_capacity_t> >, boost::keep_all> > >]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/graph_concepts.hpp:66:5: required from ‘struct boost::concepts::Graph > > >, boost::no_property, boost::listS>, boost::is_residual_edge > > >, boost::edge_residual_capacity_t> >, boost::keep_all> >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/graph_concepts.hpp:75:1: required from ‘struct boost::concepts::IncidenceGraph > > >, boost::no_property, boost::listS>, boost::is_residual_edge > > >, boost::edge_residual_capacity_t> >, boost::keep_all> >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/graph_concepts.hpp:75:1: [ skipping 5 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/breadth_first_search.hpp:62:5: required from ‘void boost::breadth_first_visit(const IncidenceGraph&, SourceIterator, SourceIterator, Buffer&, BFSVisitor, ColorMap) [with IncidenceGraph = filtered_graph > > >, no_property, listS>, is_residual_edge > > >, edge_residual_capacity_t> >, keep_all>; Buffer = queue > >; BFSVisitor = bfs_visitor*, on_tree_edge> >; ColorMap = default_color_type*; SourceIterator = long unsigned int*]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/breadth_first_search.hpp:136:24: required from ‘void boost::breadth_first_search(const VertexListGraph&, SourceIterator, SourceIterator, Buffer&, BFSVisitor, ColorMap) [with VertexListGraph = filtered_graph > > >, no_property, listS>, is_residual_edge > > >, edge_residual_capacity_t> >, keep_all>; SourceIterator = long unsigned int*; Buffer = queue > >; BFSVisitor = bfs_visitor*, on_tree_edge> >; ColorMap = default_color_type*]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/breadth_first_search.hpp:147:25: required from ‘void boost::breadth_first_search(const VertexListGraph&, typename graph_traits::vertex_descriptor, Buffer&, BFSVisitor, ColorMap) [with VertexListGraph = filtered_graph > > >, no_property, listS>, is_residual_edge > > >, edge_residual_capacity_t> >, keep_all>; Buffer = queue > >; BFSVisitor = bfs_visitor*, on_tree_edge> >; ColorMap = default_color_type*; typename graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/edmonds_karp_max_flow.hpp:101:29: required from ‘typename boost::property_traits::value_type boost::edmonds_karp_max_flow(Graph&, typename graph_traits::vertex_descriptor, typename graph_traits::vertex_descriptor, CapacityEdgeMap, ResidualCapacityEdgeMap, ReverseEdgeMap, ColorMap, PredEdgeMap) [with Graph = adjacency_list > > >, no_property, listS>; CapacityEdgeMap = adj_list_edge_property_map > > >, edge_capacity_t>; ResidualCapacityEdgeMap = adj_list_edge_property_map > > >, edge_residual_capacity_t>; ReverseEdgeMap = adj_list_edge_property_map, detail::edge_desc_impl&, long unsigned int, property > > >, edge_reverse_t>; ColorMap = default_color_type*; PredEdgeMap = detail::edge_desc_impl*; typename property_traits::value_type = long unsigned int; typename graph_traits::vertex_descriptor = long unsigned int]’ mincut.hpp:78:21: required from ‘typename boost::graph_traits::edges_size_type boost::min_cut(VertexListGraph&, OutputIterator, OutputIterator) [with VertexListGraph = const R_adjacency_list; OutputIterator = std::back_insert_iterator >; typename graph_traits::edges_size_type = long unsigned int]’ hcs.cpp:299:31: required from here /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::EqualityComparable::~EqualityComparable() [with TT = long unsigned int]’ 37 | ~model() | ^ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:233:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 233 | BOOST_CONCEPT_USAGE(EqualityComparable) { | ^~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements >]’: /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:145:5: required from ‘struct boost::Assignable’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::Assignable]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied >::value’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_)>’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/graph_concepts.hpp:70:9: [ skipping 10 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/breadth_first_search.hpp:62:5: required from ‘void boost::breadth_first_visit(const IncidenceGraph&, SourceIterator, SourceIterator, Buffer&, BFSVisitor, ColorMap) [with IncidenceGraph = filtered_graph > > >, no_property, listS>, is_residual_edge > > >, edge_residual_capacity_t> >, keep_all>; Buffer = queue > >; BFSVisitor = bfs_visitor*, on_tree_edge> >; ColorMap = default_color_type*; SourceIterator = long unsigned int*]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/breadth_first_search.hpp:136:24: required from ‘void boost::breadth_first_search(const VertexListGraph&, SourceIterator, SourceIterator, Buffer&, BFSVisitor, ColorMap) [with VertexListGraph = filtered_graph > > >, no_property, listS>, is_residual_edge > > >, edge_residual_capacity_t> >, keep_all>; SourceIterator = long unsigned int*; Buffer = queue > >; BFSVisitor = bfs_visitor*, on_tree_edge> >; ColorMap = default_color_type*]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/breadth_first_search.hpp:147:25: required from ‘void boost::breadth_first_search(const VertexListGraph&, typename graph_traits::vertex_descriptor, Buffer&, BFSVisitor, ColorMap) [with VertexListGraph = filtered_graph > > >, no_property, listS>, is_residual_edge > > >, edge_residual_capacity_t> >, keep_all>; Buffer = queue > >; BFSVisitor = bfs_visitor*, on_tree_edge> >; ColorMap = default_color_type*; typename graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/edmonds_karp_max_flow.hpp:101:29: required from ‘typename boost::property_traits::value_type boost::edmonds_karp_max_flow(Graph&, typename graph_traits::vertex_descriptor, typename graph_traits::vertex_descriptor, CapacityEdgeMap, ResidualCapacityEdgeMap, ReverseEdgeMap, ColorMap, PredEdgeMap) [with Graph = adjacency_list > > >, no_property, listS>; CapacityEdgeMap = adj_list_edge_property_map > > >, edge_capacity_t>; ResidualCapacityEdgeMap = adj_list_edge_property_map > > >, edge_residual_capacity_t>; ReverseEdgeMap = adj_list_edge_property_map, detail::edge_desc_impl&, long unsigned int, property > > >, edge_reverse_t>; ColorMap = default_color_type*; PredEdgeMap = detail::edge_desc_impl*; typename property_traits::value_type = long unsigned int; typename graph_traits::vertex_descriptor = long unsigned int]’ mincut.hpp:78:21: required from ‘typename boost::graph_traits::edges_size_type boost::min_cut(VertexListGraph&, OutputIterator, OutputIterator) [with VertexListGraph = const R_adjacency_list; OutputIterator = std::back_insert_iterator >; typename graph_traits::edges_size_type = long unsigned int]’ hcs.cpp:299:31: required from here /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::Assignable]’ 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ^ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::Assignable]’: /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/graph_concepts.hpp:70:9: required from ‘boost::concepts::Graph::~Graph() [with G = boost::filtered_graph > > >, boost::no_property, boost::listS>, boost::is_residual_edge > > >, boost::edge_residual_capacity_t> >, boost::keep_all>]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/usage.hpp:20:48: required from ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::concepts::Graph > > >, boost::no_property, boost::listS>, boost::is_residual_edge > > >, boost::edge_residual_capacity_t> >, boost::keep_all> >]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements > > >, boost::no_property, boost::listS>, boost::is_residual_edge > > >, boost::edge_residual_capacity_t> >, boost::keep_all> > >]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/graph_concepts.hpp:66:5: required from ‘struct boost::concepts::Graph > > >, boost::no_property, boost::listS>, boost::is_residual_edge > > >, boost::edge_residual_capacity_t> >, boost::keep_all> >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/graph_concepts.hpp:75:1: required from ‘struct boost::concepts::IncidenceGraph > > >, boost::no_property, boost::listS>, boost::is_residual_edge > > >, boost::edge_residual_capacity_t> >, boost::keep_all> >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/graph_concepts.hpp:75:1: [ skipping 5 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/breadth_first_search.hpp:62:5: required from ‘void boost::breadth_first_visit(const IncidenceGraph&, SourceIterator, SourceIterator, Buffer&, BFSVisitor, ColorMap) [with IncidenceGraph = filtered_graph > > >, no_property, listS>, is_residual_edge > > >, edge_residual_capacity_t> >, keep_all>; Buffer = queue > >; BFSVisitor = bfs_visitor*, on_tree_edge> >; ColorMap = default_color_type*; SourceIterator = long unsigned int*]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/breadth_first_search.hpp:136:24: required from ‘void boost::breadth_first_search(const VertexListGraph&, SourceIterator, SourceIterator, Buffer&, BFSVisitor, ColorMap) [with VertexListGraph = filtered_graph > > >, no_property, listS>, is_residual_edge > > >, edge_residual_capacity_t> >, keep_all>; SourceIterator = long unsigned int*; Buffer = queue > >; BFSVisitor = bfs_visitor*, on_tree_edge> >; ColorMap = default_color_type*]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/breadth_first_search.hpp:147:25: required from ‘void boost::breadth_first_search(const VertexListGraph&, typename graph_traits::vertex_descriptor, Buffer&, BFSVisitor, ColorMap) [with VertexListGraph = filtered_graph > > >, no_property, listS>, is_residual_edge > > >, edge_residual_capacity_t> >, keep_all>; Buffer = queue > >; BFSVisitor = bfs_visitor*, on_tree_edge> >; ColorMap = default_color_type*; typename graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/edmonds_karp_max_flow.hpp:101:29: required from ‘typename boost::property_traits::value_type boost::edmonds_karp_max_flow(Graph&, typename graph_traits::vertex_descriptor, typename graph_traits::vertex_descriptor, CapacityEdgeMap, ResidualCapacityEdgeMap, ReverseEdgeMap, ColorMap, PredEdgeMap) [with Graph = adjacency_list > > >, no_property, listS>; CapacityEdgeMap = adj_list_edge_property_map > > >, edge_capacity_t>; ResidualCapacityEdgeMap = adj_list_edge_property_map > > >, edge_residual_capacity_t>; ReverseEdgeMap = adj_list_edge_property_map, detail::edge_desc_impl&, long unsigned int, property > > >, edge_reverse_t>; ColorMap = default_color_type*; PredEdgeMap = detail::edge_desc_impl*; typename property_traits::value_type = long unsigned int; typename graph_traits::vertex_descriptor = long unsigned int]’ mincut.hpp:78:21: required from ‘typename boost::graph_traits::edges_size_type boost::min_cut(VertexListGraph&, OutputIterator, OutputIterator) [with VertexListGraph = const R_adjacency_list; OutputIterator = std::back_insert_iterator >; typename graph_traits::edges_size_type = long unsigned int]’ hcs.cpp:299:31: required from here /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::Assignable::~Assignable() [with TT = long unsigned int]’ 37 | ~model() | ^ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:145:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 145 | BOOST_CONCEPT_USAGE(Assignable) { | ^~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::concepts::MultiPassInputIterator > > >, boost::edge_residual_capacity_t> >, boost::keep_all, boost::filtered_graph > > >, boost::no_property, boost::listS>, boost::is_residual_edge > > >, boost::edge_residual_capacity_t> >, boost::keep_all> >, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > > > >*, std::vector > > > >, std::allocator > > > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >]’: /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements > > >, boost::edge_residual_capacity_t> >, boost::keep_all, boost::filtered_graph > > >, boost::no_property, boost::listS>, boost::is_residual_edge > > >, boost::edge_residual_capacity_t> >, boost::keep_all> >, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > > > >*, std::vector > > > >, std::allocator > > > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > > >]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/graph_concepts.hpp:52:50: required from ‘struct boost::concepts::MultiPassInputIterator > > >, boost::edge_residual_capacity_t> >, boost::keep_all, boost::filtered_graph > > >, boost::no_property, boost::listS>, boost::is_residual_edge > > >, boost::edge_residual_capacity_t> >, boost::keep_all> >, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > > > >*, std::vector > > > >, std::allocator > > > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::concepts::MultiPassInputIterator > > >, boost::edge_residual_capacity_t> >, boost::keep_all, boost::filtered_graph > > >, boost::no_property, boost::listS>, boost::is_residual_edge > > >, boost::edge_residual_capacity_t> >, boost::keep_all> >, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > > > >*, std::vector > > > >, std::allocator > > > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied > > >, boost::edge_residual_capacity_t> >, boost::keep_all, boost::filtered_graph > > >, boost::no_property, boost::listS>, boost::is_residual_edge > > >, boost::edge_residual_capacity_t> >, boost::keep_all> >, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > > > >*, std::vector > > > >, std::allocator > > > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > > >::value’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied > > >, boost::edge_residual_capacity_t> >, boost::keep_all, boost::filtered_graph > > >, boost::no_property, boost::listS>, boost::is_residual_edge > > >, boost::edge_residual_capacity_t> >, boost::keep_all> >, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > > > >*, std::vector > > > >, std::allocator > > > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > > >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:72:8: [ skipping 3 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/breadth_first_search.hpp:62:5: required from ‘void boost::breadth_first_visit(const IncidenceGraph&, SourceIterator, SourceIterator, Buffer&, BFSVisitor, ColorMap) [with IncidenceGraph = filtered_graph > > >, no_property, listS>, is_residual_edge > > >, edge_residual_capacity_t> >, keep_all>; Buffer = queue > >; BFSVisitor = bfs_visitor*, on_tree_edge> >; ColorMap = default_color_type*; SourceIterator = long unsigned int*]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/breadth_first_search.hpp:136:24: required from ‘void boost::breadth_first_search(const VertexListGraph&, SourceIterator, SourceIterator, Buffer&, BFSVisitor, ColorMap) [with VertexListGraph = filtered_graph > > >, no_property, listS>, is_residual_edge > > >, edge_residual_capacity_t> >, keep_all>; SourceIterator = long unsigned int*; Buffer = queue > >; BFSVisitor = bfs_visitor*, on_tree_edge> >; ColorMap = default_color_type*]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/breadth_first_search.hpp:147:25: required from ‘void boost::breadth_first_search(const VertexListGraph&, typename graph_traits::vertex_descriptor, Buffer&, BFSVisitor, ColorMap) [with VertexListGraph = filtered_graph > > >, no_property, listS>, is_residual_edge > > >, edge_residual_capacity_t> >, keep_all>; Buffer = queue > >; BFSVisitor = bfs_visitor*, on_tree_edge> >; ColorMap = default_color_type*; typename graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/edmonds_karp_max_flow.hpp:101:29: required from ‘typename boost::property_traits::value_type boost::edmonds_karp_max_flow(Graph&, typename graph_traits::vertex_descriptor, typename graph_traits::vertex_descriptor, CapacityEdgeMap, ResidualCapacityEdgeMap, ReverseEdgeMap, ColorMap, PredEdgeMap) [with Graph = adjacency_list > > >, no_property, listS>; CapacityEdgeMap = adj_list_edge_property_map > > >, edge_capacity_t>; ResidualCapacityEdgeMap = adj_list_edge_property_map > > >, edge_residual_capacity_t>; ReverseEdgeMap = adj_list_edge_property_map, detail::edge_desc_impl&, long unsigned int, property > > >, edge_reverse_t>; ColorMap = default_color_type*; PredEdgeMap = detail::edge_desc_impl*; typename property_traits::value_type = long unsigned int; typename graph_traits::vertex_descriptor = long unsigned int]’ mincut.hpp:78:21: required from ‘typename boost::graph_traits::edges_size_type boost::min_cut(VertexListGraph&, OutputIterator, OutputIterator) [with VertexListGraph = const R_adjacency_list; OutputIterator = std::back_insert_iterator >; typename graph_traits::edges_size_type = long unsigned int]’ hcs.cpp:299:31: required from here /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::concepts::MultiPassInputIterator::~MultiPassInputIterator() [with T = boost::iterators::filter_iterator > > >, boost::edge_residual_capacity_t> >, boost::keep_all, boost::filtered_graph > > >, boost::no_property, boost::listS>, boost::is_residual_edge > > >, boost::edge_residual_capacity_t> >, boost::keep_all> >, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > > > >*, std::vector > > > >, std::allocator > > > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> >]’ 37 | ~model() | ^ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/graph_concepts.hpp:52:50: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 52 | BOOST_concept(MultiPassInputIterator, (T)) { BOOST_CONCEPT_USAGE( | ^~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::DefaultConstructible >]’: /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements > >]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:137:5: required from ‘struct boost::DefaultConstructible >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::DefaultConstructible >]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied > >::value’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied > >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:72:8: [ skipping 3 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/breadth_first_search.hpp:62:5: required from ‘void boost::breadth_first_visit(const IncidenceGraph&, SourceIterator, SourceIterator, Buffer&, BFSVisitor, ColorMap) [with IncidenceGraph = filtered_graph > > >, no_property, listS>, is_residual_edge > > >, edge_residual_capacity_t> >, keep_all>; Buffer = queue > >; BFSVisitor = bfs_visitor*, on_tree_edge> >; ColorMap = default_color_type*; SourceIterator = long unsigned int*]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/breadth_first_search.hpp:136:24: required from ‘void boost::breadth_first_search(const VertexListGraph&, SourceIterator, SourceIterator, Buffer&, BFSVisitor, ColorMap) [with VertexListGraph = filtered_graph > > >, no_property, listS>, is_residual_edge > > >, edge_residual_capacity_t> >, keep_all>; SourceIterator = long unsigned int*; Buffer = queue > >; BFSVisitor = bfs_visitor*, on_tree_edge> >; ColorMap = default_color_type*]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/breadth_first_search.hpp:147:25: required from ‘void boost::breadth_first_search(const VertexListGraph&, typename graph_traits::vertex_descriptor, Buffer&, BFSVisitor, ColorMap) [with VertexListGraph = filtered_graph > > >, no_property, listS>, is_residual_edge > > >, edge_residual_capacity_t> >, keep_all>; Buffer = queue > >; BFSVisitor = bfs_visitor*, on_tree_edge> >; ColorMap = default_color_type*; typename graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/edmonds_karp_max_flow.hpp:101:29: required from ‘typename boost::property_traits::value_type boost::edmonds_karp_max_flow(Graph&, typename graph_traits::vertex_descriptor, typename graph_traits::vertex_descriptor, CapacityEdgeMap, ResidualCapacityEdgeMap, ReverseEdgeMap, ColorMap, PredEdgeMap) [with Graph = adjacency_list > > >, no_property, listS>; CapacityEdgeMap = adj_list_edge_property_map > > >, edge_capacity_t>; ResidualCapacityEdgeMap = adj_list_edge_property_map > > >, edge_residual_capacity_t>; ReverseEdgeMap = adj_list_edge_property_map, detail::edge_desc_impl&, long unsigned int, property > > >, edge_reverse_t>; ColorMap = default_color_type*; PredEdgeMap = detail::edge_desc_impl*; typename property_traits::value_type = long unsigned int; typename graph_traits::vertex_descriptor = long unsigned int]’ mincut.hpp:78:21: required from ‘typename boost::graph_traits::edges_size_type boost::min_cut(VertexListGraph&, OutputIterator, OutputIterator) [with VertexListGraph = const R_adjacency_list; OutputIterator = std::back_insert_iterator >; typename graph_traits::edges_size_type = long unsigned int]’ hcs.cpp:299:31: required from here /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::DefaultConstructible::~DefaultConstructible() [with TT = boost::detail::edge_desc_impl]’ 37 | ~model() | ^ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:137:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 137 | BOOST_CONCEPT_USAGE(DefaultConstructible) { | ^~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::EqualityComparable >]’: /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements > >]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:233:5: required from ‘struct boost::EqualityComparable >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::EqualityComparable >]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied > >::value’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied > >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:72:8: [ skipping 3 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/breadth_first_search.hpp:62:5: required from ‘void boost::breadth_first_visit(const IncidenceGraph&, SourceIterator, SourceIterator, Buffer&, BFSVisitor, ColorMap) [with IncidenceGraph = filtered_graph > > >, no_property, listS>, is_residual_edge > > >, edge_residual_capacity_t> >, keep_all>; Buffer = queue > >; BFSVisitor = bfs_visitor*, on_tree_edge> >; ColorMap = default_color_type*; SourceIterator = long unsigned int*]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/breadth_first_search.hpp:136:24: required from ‘void boost::breadth_first_search(const VertexListGraph&, SourceIterator, SourceIterator, Buffer&, BFSVisitor, ColorMap) [with VertexListGraph = filtered_graph > > >, no_property, listS>, is_residual_edge > > >, edge_residual_capacity_t> >, keep_all>; SourceIterator = long unsigned int*; Buffer = queue > >; BFSVisitor = bfs_visitor*, on_tree_edge> >; ColorMap = default_color_type*]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/breadth_first_search.hpp:147:25: required from ‘void boost::breadth_first_search(const VertexListGraph&, typename graph_traits::vertex_descriptor, Buffer&, BFSVisitor, ColorMap) [with VertexListGraph = filtered_graph > > >, no_property, listS>, is_residual_edge > > >, edge_residual_capacity_t> >, keep_all>; Buffer = queue > >; BFSVisitor = bfs_visitor*, on_tree_edge> >; ColorMap = default_color_type*; typename graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/edmonds_karp_max_flow.hpp:101:29: required from ‘typename boost::property_traits::value_type boost::edmonds_karp_max_flow(Graph&, typename graph_traits::vertex_descriptor, typename graph_traits::vertex_descriptor, CapacityEdgeMap, ResidualCapacityEdgeMap, ReverseEdgeMap, ColorMap, PredEdgeMap) [with Graph = adjacency_list > > >, no_property, listS>; CapacityEdgeMap = adj_list_edge_property_map > > >, edge_capacity_t>; ResidualCapacityEdgeMap = adj_list_edge_property_map > > >, edge_residual_capacity_t>; ReverseEdgeMap = adj_list_edge_property_map, detail::edge_desc_impl&, long unsigned int, property > > >, edge_reverse_t>; ColorMap = default_color_type*; PredEdgeMap = detail::edge_desc_impl*; typename property_traits::value_type = long unsigned int; typename graph_traits::vertex_descriptor = long unsigned int]’ mincut.hpp:78:21: required from ‘typename boost::graph_traits::edges_size_type boost::min_cut(VertexListGraph&, OutputIterator, OutputIterator) [with VertexListGraph = const R_adjacency_list; OutputIterator = std::back_insert_iterator >; typename graph_traits::edges_size_type = long unsigned int]’ hcs.cpp:299:31: required from here /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::EqualityComparable::~EqualityComparable() [with TT = boost::detail::edge_desc_impl]’ 37 | ~model() | ^ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:233:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 233 | BOOST_CONCEPT_USAGE(EqualityComparable) { | ^~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::Assignable >]’: /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements > >]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:145:5: required from ‘struct boost::Assignable >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::Assignable >]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied > >::value’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied > >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:72:8: [ skipping 3 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/breadth_first_search.hpp:62:5: required from ‘void boost::breadth_first_visit(const IncidenceGraph&, SourceIterator, SourceIterator, Buffer&, BFSVisitor, ColorMap) [with IncidenceGraph = filtered_graph > > >, no_property, listS>, is_residual_edge > > >, edge_residual_capacity_t> >, keep_all>; Buffer = queue > >; BFSVisitor = bfs_visitor*, on_tree_edge> >; ColorMap = default_color_type*; SourceIterator = long unsigned int*]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/breadth_first_search.hpp:136:24: required from ‘void boost::breadth_first_search(const VertexListGraph&, SourceIterator, SourceIterator, Buffer&, BFSVisitor, ColorMap) [with VertexListGraph = filtered_graph > > >, no_property, listS>, is_residual_edge > > >, edge_residual_capacity_t> >, keep_all>; SourceIterator = long unsigned int*; Buffer = queue > >; BFSVisitor = bfs_visitor*, on_tree_edge> >; ColorMap = default_color_type*]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/breadth_first_search.hpp:147:25: required from ‘void boost::breadth_first_search(const VertexListGraph&, typename graph_traits::vertex_descriptor, Buffer&, BFSVisitor, ColorMap) [with VertexListGraph = filtered_graph > > >, no_property, listS>, is_residual_edge > > >, edge_residual_capacity_t> >, keep_all>; Buffer = queue > >; BFSVisitor = bfs_visitor*, on_tree_edge> >; ColorMap = default_color_type*; typename graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/edmonds_karp_max_flow.hpp:101:29: required from ‘typename boost::property_traits::value_type boost::edmonds_karp_max_flow(Graph&, typename graph_traits::vertex_descriptor, typename graph_traits::vertex_descriptor, CapacityEdgeMap, ResidualCapacityEdgeMap, ReverseEdgeMap, ColorMap, PredEdgeMap) [with Graph = adjacency_list > > >, no_property, listS>; CapacityEdgeMap = adj_list_edge_property_map > > >, edge_capacity_t>; ResidualCapacityEdgeMap = adj_list_edge_property_map > > >, edge_residual_capacity_t>; ReverseEdgeMap = adj_list_edge_property_map, detail::edge_desc_impl&, long unsigned int, property > > >, edge_reverse_t>; ColorMap = default_color_type*; PredEdgeMap = detail::edge_desc_impl*; typename property_traits::value_type = long unsigned int; typename graph_traits::vertex_descriptor = long unsigned int]’ mincut.hpp:78:21: required from ‘typename boost::graph_traits::edges_size_type boost::min_cut(VertexListGraph&, OutputIterator, OutputIterator) [with VertexListGraph = const R_adjacency_list; OutputIterator = std::back_insert_iterator >; typename graph_traits::edges_size_type = long unsigned int]’ hcs.cpp:299:31: required from here /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::Assignable::~Assignable() [with TT = boost::detail::edge_desc_impl]’ 37 | ~model() | ^ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:145:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 145 | BOOST_CONCEPT_USAGE(Assignable) { | ^~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::Convertible]’: /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements >]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:208:5: required from ‘struct boost::Convertible’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::Convertible]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied >::value’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:72:8: [ skipping 3 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/breadth_first_search.hpp:62:5: required from ‘void boost::breadth_first_visit(const IncidenceGraph&, SourceIterator, SourceIterator, Buffer&, BFSVisitor, ColorMap) [with IncidenceGraph = filtered_graph > > >, no_property, listS>, is_residual_edge > > >, edge_residual_capacity_t> >, keep_all>; Buffer = queue > >; BFSVisitor = bfs_visitor*, on_tree_edge> >; ColorMap = default_color_type*; SourceIterator = long unsigned int*]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/breadth_first_search.hpp:136:24: required from ‘void boost::breadth_first_search(const VertexListGraph&, SourceIterator, SourceIterator, Buffer&, BFSVisitor, ColorMap) [with VertexListGraph = filtered_graph > > >, no_property, listS>, is_residual_edge > > >, edge_residual_capacity_t> >, keep_all>; SourceIterator = long unsigned int*; Buffer = queue > >; BFSVisitor = bfs_visitor*, on_tree_edge> >; ColorMap = default_color_type*]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/breadth_first_search.hpp:147:25: required from ‘void boost::breadth_first_search(const VertexListGraph&, typename graph_traits::vertex_descriptor, Buffer&, BFSVisitor, ColorMap) [with VertexListGraph = filtered_graph > > >, no_property, listS>, is_residual_edge > > >, edge_residual_capacity_t> >, keep_all>; Buffer = queue > >; BFSVisitor = bfs_visitor*, on_tree_edge> >; ColorMap = default_color_type*; typename graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/edmonds_karp_max_flow.hpp:101:29: required from ‘typename boost::property_traits::value_type boost::edmonds_karp_max_flow(Graph&, typename graph_traits::vertex_descriptor, typename graph_traits::vertex_descriptor, CapacityEdgeMap, ResidualCapacityEdgeMap, ReverseEdgeMap, ColorMap, PredEdgeMap) [with Graph = adjacency_list > > >, no_property, listS>; CapacityEdgeMap = adj_list_edge_property_map > > >, edge_capacity_t>; ResidualCapacityEdgeMap = adj_list_edge_property_map > > >, edge_residual_capacity_t>; ReverseEdgeMap = adj_list_edge_property_map, detail::edge_desc_impl&, long unsigned int, property > > >, edge_reverse_t>; ColorMap = default_color_type*; PredEdgeMap = detail::edge_desc_impl*; typename property_traits::value_type = long unsigned int; typename graph_traits::vertex_descriptor = long unsigned int]’ mincut.hpp:78:21: required from ‘typename boost::graph_traits::edges_size_type boost::min_cut(VertexListGraph&, OutputIterator, OutputIterator) [with VertexListGraph = const R_adjacency_list; OutputIterator = std::back_insert_iterator >; typename graph_traits::edges_size_type = long unsigned int]’ hcs.cpp:299:31: required from here /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::Convertible::~Convertible() [with X = boost::adj_list_dir_traversal_tag; Y = boost::incidence_graph_tag]’ 37 | ~model() | ^ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:208:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 208 | BOOST_CONCEPT_USAGE(Convertible) { | ^~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::Convertible]’: /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements >]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:208:5: required from ‘struct boost::Convertible’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:206:3: required from ‘struct boost::ConvertibleConcept’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::ConvertibleConcept]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied >::value’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:45:51: [ skipping 12 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/breadth_first_search.hpp:66:5: required from ‘void boost::breadth_first_visit(const IncidenceGraph&, SourceIterator, SourceIterator, Buffer&, BFSVisitor, ColorMap) [with IncidenceGraph = filtered_graph > > >, no_property, listS>, is_residual_edge > > >, edge_residual_capacity_t> >, keep_all>; Buffer = queue > >; BFSVisitor = bfs_visitor*, on_tree_edge> >; ColorMap = default_color_type*; SourceIterator = long unsigned int*]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/breadth_first_search.hpp:136:24: required from ‘void boost::breadth_first_search(const VertexListGraph&, SourceIterator, SourceIterator, Buffer&, BFSVisitor, ColorMap) [with VertexListGraph = filtered_graph > > >, no_property, listS>, is_residual_edge > > >, edge_residual_capacity_t> >, keep_all>; SourceIterator = long unsigned int*; Buffer = queue > >; BFSVisitor = bfs_visitor*, on_tree_edge> >; ColorMap = default_color_type*]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/breadth_first_search.hpp:147:25: required from ‘void boost::breadth_first_search(const VertexListGraph&, typename graph_traits::vertex_descriptor, Buffer&, BFSVisitor, ColorMap) [with VertexListGraph = filtered_graph > > >, no_property, listS>, is_residual_edge > > >, edge_residual_capacity_t> >, keep_all>; Buffer = queue > >; BFSVisitor = bfs_visitor*, on_tree_edge> >; ColorMap = default_color_type*; typename graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/edmonds_karp_max_flow.hpp:101:29: required from ‘typename boost::property_traits::value_type boost::edmonds_karp_max_flow(Graph&, typename graph_traits::vertex_descriptor, typename graph_traits::vertex_descriptor, CapacityEdgeMap, ResidualCapacityEdgeMap, ReverseEdgeMap, ColorMap, PredEdgeMap) [with Graph = adjacency_list > > >, no_property, listS>; CapacityEdgeMap = adj_list_edge_property_map > > >, edge_capacity_t>; ResidualCapacityEdgeMap = adj_list_edge_property_map > > >, edge_residual_capacity_t>; ReverseEdgeMap = adj_list_edge_property_map, detail::edge_desc_impl&, long unsigned int, property > > >, edge_reverse_t>; ColorMap = default_color_type*; PredEdgeMap = detail::edge_desc_impl*; typename property_traits::value_type = long unsigned int; typename graph_traits::vertex_descriptor = long unsigned int]’ mincut.hpp:78:21: required from ‘typename boost::graph_traits::edges_size_type boost::min_cut(VertexListGraph&, OutputIterator, OutputIterator) [with VertexListGraph = const R_adjacency_list; OutputIterator = std::back_insert_iterator >; typename graph_traits::edges_size_type = long unsigned int]’ hcs.cpp:299:31: required from here /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::Convertible::~Convertible() [with X = boost::lvalue_property_map_tag; Y = boost::readable_property_map_tag]’ 37 | ~model() | ^ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:208:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 208 | BOOST_CONCEPT_USAGE(Convertible) { | ^~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::Convertible]’: /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements >]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:208:5: required from ‘struct boost::Convertible’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:206:3: required from ‘struct boost::ConvertibleConcept’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::ConvertibleConcept]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied >::value’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:45:51: [ skipping 12 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/breadth_first_search.hpp:66:5: required from ‘void boost::breadth_first_visit(const IncidenceGraph&, SourceIterator, SourceIterator, Buffer&, BFSVisitor, ColorMap) [with IncidenceGraph = filtered_graph > > >, no_property, listS>, is_residual_edge > > >, edge_residual_capacity_t> >, keep_all>; Buffer = queue > >; BFSVisitor = bfs_visitor*, on_tree_edge> >; ColorMap = default_color_type*; SourceIterator = long unsigned int*]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/breadth_first_search.hpp:136:24: required from ‘void boost::breadth_first_search(const VertexListGraph&, SourceIterator, SourceIterator, Buffer&, BFSVisitor, ColorMap) [with VertexListGraph = filtered_graph > > >, no_property, listS>, is_residual_edge > > >, edge_residual_capacity_t> >, keep_all>; SourceIterator = long unsigned int*; Buffer = queue > >; BFSVisitor = bfs_visitor*, on_tree_edge> >; ColorMap = default_color_type*]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/breadth_first_search.hpp:147:25: required from ‘void boost::breadth_first_search(const VertexListGraph&, typename graph_traits::vertex_descriptor, Buffer&, BFSVisitor, ColorMap) [with VertexListGraph = filtered_graph > > >, no_property, listS>, is_residual_edge > > >, edge_residual_capacity_t> >, keep_all>; Buffer = queue > >; BFSVisitor = bfs_visitor*, on_tree_edge> >; ColorMap = default_color_type*; typename graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/edmonds_karp_max_flow.hpp:101:29: required from ‘typename boost::property_traits::value_type boost::edmonds_karp_max_flow(Graph&, typename graph_traits::vertex_descriptor, typename graph_traits::vertex_descriptor, CapacityEdgeMap, ResidualCapacityEdgeMap, ReverseEdgeMap, ColorMap, PredEdgeMap) [with Graph = adjacency_list > > >, no_property, listS>; CapacityEdgeMap = adj_list_edge_property_map > > >, edge_capacity_t>; ResidualCapacityEdgeMap = adj_list_edge_property_map > > >, edge_residual_capacity_t>; ReverseEdgeMap = adj_list_edge_property_map, detail::edge_desc_impl&, long unsigned int, property > > >, edge_reverse_t>; ColorMap = default_color_type*; PredEdgeMap = detail::edge_desc_impl*; typename property_traits::value_type = long unsigned int; typename graph_traits::vertex_descriptor = long unsigned int]’ mincut.hpp:78:21: required from ‘typename boost::graph_traits::edges_size_type boost::min_cut(VertexListGraph&, OutputIterator, OutputIterator) [with VertexListGraph = const R_adjacency_list; OutputIterator = std::back_insert_iterator >; typename graph_traits::edges_size_type = long unsigned int]’ hcs.cpp:299:31: required from here /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::Convertible::~Convertible() [with X = boost::lvalue_property_map_tag; Y = boost::writable_property_map_tag]’ 37 | ~model() | ^ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:208:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 208 | BOOST_CONCEPT_USAGE(Convertible) { | ^~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::DefaultConstructible]’: /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements >]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:137:5: required from ‘struct boost::DefaultConstructible’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::DefaultConstructible]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied >::value’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:72:8: [ skipping 11 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/breadth_first_search.hpp:62:5: required from ‘void boost::breadth_first_visit(const IncidenceGraph&, SourceIterator, SourceIterator, Buffer&, BFSVisitor, ColorMap) [with IncidenceGraph = filtered_graph > > >, no_property, listS>, is_residual_edge > > >, edge_residual_capacity_t> >, keep_all>; Buffer = queue > >; BFSVisitor = bfs_visitor*, on_tree_edge> >; ColorMap = default_color_type*; SourceIterator = long unsigned int*]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/breadth_first_search.hpp:136:24: required from ‘void boost::breadth_first_search(const VertexListGraph&, SourceIterator, SourceIterator, Buffer&, BFSVisitor, ColorMap) [with VertexListGraph = filtered_graph > > >, no_property, listS>, is_residual_edge > > >, edge_residual_capacity_t> >, keep_all>; SourceIterator = long unsigned int*; Buffer = queue > >; BFSVisitor = bfs_visitor*, on_tree_edge> >; ColorMap = default_color_type*]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/breadth_first_search.hpp:147:25: required from ‘void boost::breadth_first_search(const VertexListGraph&, typename graph_traits::vertex_descriptor, Buffer&, BFSVisitor, ColorMap) [with VertexListGraph = filtered_graph > > >, no_property, listS>, is_residual_edge > > >, edge_residual_capacity_t> >, keep_all>; Buffer = queue > >; BFSVisitor = bfs_visitor*, on_tree_edge> >; ColorMap = default_color_type*; typename graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/edmonds_karp_max_flow.hpp:101:29: required from ‘typename boost::property_traits::value_type boost::edmonds_karp_max_flow(Graph&, typename graph_traits::vertex_descriptor, typename graph_traits::vertex_descriptor, CapacityEdgeMap, ResidualCapacityEdgeMap, ReverseEdgeMap, ColorMap, PredEdgeMap) [with Graph = adjacency_list > > >, no_property, listS>; CapacityEdgeMap = adj_list_edge_property_map > > >, edge_capacity_t>; ResidualCapacityEdgeMap = adj_list_edge_property_map > > >, edge_residual_capacity_t>; ReverseEdgeMap = adj_list_edge_property_map, detail::edge_desc_impl&, long unsigned int, property > > >, edge_reverse_t>; ColorMap = default_color_type*; PredEdgeMap = detail::edge_desc_impl*; typename property_traits::value_type = long unsigned int; typename graph_traits::vertex_descriptor = long unsigned int]’ mincut.hpp:78:21: required from ‘typename boost::graph_traits::edges_size_type boost::min_cut(VertexListGraph&, OutputIterator, OutputIterator) [with VertexListGraph = const R_adjacency_list; OutputIterator = std::back_insert_iterator >; typename graph_traits::edges_size_type = long unsigned int]’ hcs.cpp:299:31: required from here /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::DefaultConstructible::~DefaultConstructible() [with TT = long unsigned int]’ 37 | ~model() | ^ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:137:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 137 | BOOST_CONCEPT_USAGE(DefaultConstructible) { | ^~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::EqualityComparable]’: /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements >]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:233:5: required from ‘struct boost::EqualityComparable’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::EqualityComparable]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied >::value’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:72:8: [ skipping 11 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/breadth_first_search.hpp:62:5: required from ‘void boost::breadth_first_visit(const IncidenceGraph&, SourceIterator, SourceIterator, Buffer&, BFSVisitor, ColorMap) [with IncidenceGraph = filtered_graph > > >, no_property, listS>, is_residual_edge > > >, edge_residual_capacity_t> >, keep_all>; Buffer = queue > >; BFSVisitor = bfs_visitor*, on_tree_edge> >; ColorMap = default_color_type*; SourceIterator = long unsigned int*]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/breadth_first_search.hpp:136:24: required from ‘void boost::breadth_first_search(const VertexListGraph&, SourceIterator, SourceIterator, Buffer&, BFSVisitor, ColorMap) [with VertexListGraph = filtered_graph > > >, no_property, listS>, is_residual_edge > > >, edge_residual_capacity_t> >, keep_all>; SourceIterator = long unsigned int*; Buffer = queue > >; BFSVisitor = bfs_visitor*, on_tree_edge> >; ColorMap = default_color_type*]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/breadth_first_search.hpp:147:25: required from ‘void boost::breadth_first_search(const VertexListGraph&, typename graph_traits::vertex_descriptor, Buffer&, BFSVisitor, ColorMap) [with VertexListGraph = filtered_graph > > >, no_property, listS>, is_residual_edge > > >, edge_residual_capacity_t> >, keep_all>; Buffer = queue > >; BFSVisitor = bfs_visitor*, on_tree_edge> >; ColorMap = default_color_type*; typename graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/edmonds_karp_max_flow.hpp:101:29: required from ‘typename boost::property_traits::value_type boost::edmonds_karp_max_flow(Graph&, typename graph_traits::vertex_descriptor, typename graph_traits::vertex_descriptor, CapacityEdgeMap, ResidualCapacityEdgeMap, ReverseEdgeMap, ColorMap, PredEdgeMap) [with Graph = adjacency_list > > >, no_property, listS>; CapacityEdgeMap = adj_list_edge_property_map > > >, edge_capacity_t>; ResidualCapacityEdgeMap = adj_list_edge_property_map > > >, edge_residual_capacity_t>; ReverseEdgeMap = adj_list_edge_property_map, detail::edge_desc_impl&, long unsigned int, property > > >, edge_reverse_t>; ColorMap = default_color_type*; PredEdgeMap = detail::edge_desc_impl*; typename property_traits::value_type = long unsigned int; typename graph_traits::vertex_descriptor = long unsigned int]’ mincut.hpp:78:21: required from ‘typename boost::graph_traits::edges_size_type boost::min_cut(VertexListGraph&, OutputIterator, OutputIterator) [with VertexListGraph = const R_adjacency_list; OutputIterator = std::back_insert_iterator >; typename graph_traits::edges_size_type = long unsigned int]’ hcs.cpp:299:31: required from here /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::EqualityComparable::~EqualityComparable() [with TT = long unsigned int]’ 37 | ~model() | ^ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:233:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 233 | BOOST_CONCEPT_USAGE(EqualityComparable) { | ^~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::Assignable]’: /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements >]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:145:5: required from ‘struct boost::Assignable’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::Assignable]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied >::value’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:72:8: [ skipping 11 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/breadth_first_search.hpp:62:5: required from ‘void boost::breadth_first_visit(const IncidenceGraph&, SourceIterator, SourceIterator, Buffer&, BFSVisitor, ColorMap) [with IncidenceGraph = filtered_graph > > >, no_property, listS>, is_residual_edge > > >, edge_residual_capacity_t> >, keep_all>; Buffer = queue > >; BFSVisitor = bfs_visitor*, on_tree_edge> >; ColorMap = default_color_type*; SourceIterator = long unsigned int*]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/breadth_first_search.hpp:136:24: required from ‘void boost::breadth_first_search(const VertexListGraph&, SourceIterator, SourceIterator, Buffer&, BFSVisitor, ColorMap) [with VertexListGraph = filtered_graph > > >, no_property, listS>, is_residual_edge > > >, edge_residual_capacity_t> >, keep_all>; SourceIterator = long unsigned int*; Buffer = queue > >; BFSVisitor = bfs_visitor*, on_tree_edge> >; ColorMap = default_color_type*]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/breadth_first_search.hpp:147:25: required from ‘void boost::breadth_first_search(const VertexListGraph&, typename graph_traits::vertex_descriptor, Buffer&, BFSVisitor, ColorMap) [with VertexListGraph = filtered_graph > > >, no_property, listS>, is_residual_edge > > >, edge_residual_capacity_t> >, keep_all>; Buffer = queue > >; BFSVisitor = bfs_visitor*, on_tree_edge> >; ColorMap = default_color_type*; typename graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/edmonds_karp_max_flow.hpp:101:29: required from ‘typename boost::property_traits::value_type boost::edmonds_karp_max_flow(Graph&, typename graph_traits::vertex_descriptor, typename graph_traits::vertex_descriptor, CapacityEdgeMap, ResidualCapacityEdgeMap, ReverseEdgeMap, ColorMap, PredEdgeMap) [with Graph = adjacency_list > > >, no_property, listS>; CapacityEdgeMap = adj_list_edge_property_map > > >, edge_capacity_t>; ResidualCapacityEdgeMap = adj_list_edge_property_map > > >, edge_residual_capacity_t>; ReverseEdgeMap = adj_list_edge_property_map, detail::edge_desc_impl&, long unsigned int, property > > >, edge_reverse_t>; ColorMap = default_color_type*; PredEdgeMap = detail::edge_desc_impl*; typename property_traits::value_type = long unsigned int; typename graph_traits::vertex_descriptor = long unsigned int]’ mincut.hpp:78:21: required from ‘typename boost::graph_traits::edges_size_type boost::min_cut(VertexListGraph&, OutputIterator, OutputIterator) [with VertexListGraph = const R_adjacency_list; OutputIterator = std::back_insert_iterator >; typename graph_traits::edges_size_type = long unsigned int]’ hcs.cpp:299:31: required from here /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::Assignable::~Assignable() [with TT = long unsigned int]’ 37 | ~model() | ^ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:145:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 145 | BOOST_CONCEPT_USAGE(Assignable) { | ^~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements > > >, boost::edge_residual_capacity_t> >, boost::keep_all, boost::filtered_graph > > >, boost::no_property, boost::listS>, boost::is_residual_edge > > >, boost::edge_residual_capacity_t> >, boost::keep_all> >, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > > > >*, std::vector > > > >, std::allocator > > > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > > >]’: /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:145:5: required from ‘struct boost::Assignable > > >, boost::edge_residual_capacity_t> >, boost::keep_all, boost::filtered_graph > > >, boost::no_property, boost::listS>, boost::is_residual_edge > > >, boost::edge_residual_capacity_t> >, boost::keep_all> >, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > > > >*, std::vector > > > >, std::allocator > > > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:502:3: required from ‘struct boost::InputIterator > > >, boost::edge_residual_capacity_t> >, boost::keep_all, boost::filtered_graph > > >, boost::no_property, boost::listS>, boost::is_residual_edge > > >, boost::edge_residual_capacity_t> >, boost::keep_all> >, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > > > >*, std::vector > > > >, std::allocator > > > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::InputIterator > > >, boost::edge_residual_capacity_t> >, boost::keep_all, boost::filtered_graph > > >, boost::no_property, boost::listS>, boost::is_residual_edge > > >, boost::edge_residual_capacity_t> >, boost::keep_all> >, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > > > >*, std::vector > > > >, std::allocator > > > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied > > >, boost::edge_residual_capacity_t> >, boost::keep_all, boost::filtered_graph > > >, boost::no_property, boost::listS>, boost::is_residual_edge > > >, boost::edge_residual_capacity_t> >, boost::keep_all> >, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > > > >*, std::vector > > > >, std::allocator > > > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > > >::value’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied > > >, boost::edge_residual_capacity_t> >, boost::keep_all, boost::filtered_graph > > >, boost::no_property, boost::listS>, boost::is_residual_edge > > >, boost::edge_residual_capacity_t> >, boost::keep_all> >, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > > > >*, std::vector > > > >, std::allocator > > > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > > >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:72:8: [ skipping 5 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/breadth_first_search.hpp:62:5: required from ‘void boost::breadth_first_visit(const IncidenceGraph&, SourceIterator, SourceIterator, Buffer&, BFSVisitor, ColorMap) [with IncidenceGraph = filtered_graph > > >, no_property, listS>, is_residual_edge > > >, edge_residual_capacity_t> >, keep_all>; Buffer = queue > >; BFSVisitor = bfs_visitor*, on_tree_edge> >; ColorMap = default_color_type*; SourceIterator = long unsigned int*]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/breadth_first_search.hpp:136:24: required from ‘void boost::breadth_first_search(const VertexListGraph&, SourceIterator, SourceIterator, Buffer&, BFSVisitor, ColorMap) [with VertexListGraph = filtered_graph > > >, no_property, listS>, is_residual_edge > > >, edge_residual_capacity_t> >, keep_all>; SourceIterator = long unsigned int*; Buffer = queue > >; BFSVisitor = bfs_visitor*, on_tree_edge> >; ColorMap = default_color_type*]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/breadth_first_search.hpp:147:25: required from ‘void boost::breadth_first_search(const VertexListGraph&, typename graph_traits::vertex_descriptor, Buffer&, BFSVisitor, ColorMap) [with VertexListGraph = filtered_graph > > >, no_property, listS>, is_residual_edge > > >, edge_residual_capacity_t> >, keep_all>; Buffer = queue > >; BFSVisitor = bfs_visitor*, on_tree_edge> >; ColorMap = default_color_type*; typename graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/edmonds_karp_max_flow.hpp:101:29: required from ‘typename boost::property_traits::value_type boost::edmonds_karp_max_flow(Graph&, typename graph_traits::vertex_descriptor, typename graph_traits::vertex_descriptor, CapacityEdgeMap, ResidualCapacityEdgeMap, ReverseEdgeMap, ColorMap, PredEdgeMap) [with Graph = adjacency_list > > >, no_property, listS>; CapacityEdgeMap = adj_list_edge_property_map > > >, edge_capacity_t>; ResidualCapacityEdgeMap = adj_list_edge_property_map > > >, edge_residual_capacity_t>; ReverseEdgeMap = adj_list_edge_property_map, detail::edge_desc_impl&, long unsigned int, property > > >, edge_reverse_t>; ColorMap = default_color_type*; PredEdgeMap = detail::edge_desc_impl*; typename property_traits::value_type = long unsigned int; typename graph_traits::vertex_descriptor = long unsigned int]’ mincut.hpp:78:21: required from ‘typename boost::graph_traits::edges_size_type boost::min_cut(VertexListGraph&, OutputIterator, OutputIterator) [with VertexListGraph = const R_adjacency_list; OutputIterator = std::back_insert_iterator >; typename graph_traits::edges_size_type = long unsigned int]’ hcs.cpp:299:31: required from here /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::Assignable > > >, boost::edge_residual_capacity_t> >, boost::keep_all, boost::filtered_graph > > >, boost::no_property, boost::listS>, boost::is_residual_edge > > >, boost::edge_residual_capacity_t> >, boost::keep_all> >, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > > > >*, std::vector > > > >, std::allocator > > > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >]’ 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ^ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements > > >, boost::edge_residual_capacity_t> >, boost::keep_all, boost::filtered_graph > > >, boost::no_property, boost::listS>, boost::is_residual_edge > > >, boost::edge_residual_capacity_t> >, boost::keep_all> >, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > > > >*, std::vector > > > >, std::allocator > > > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > > >]’: /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:233:5: required from ‘struct boost::EqualityComparable > > >, boost::edge_residual_capacity_t> >, boost::keep_all, boost::filtered_graph > > >, boost::no_property, boost::listS>, boost::is_residual_edge > > >, boost::edge_residual_capacity_t> >, boost::keep_all> >, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > > > >*, std::vector > > > >, std::allocator > > > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:502:3: required from ‘struct boost::InputIterator > > >, boost::edge_residual_capacity_t> >, boost::keep_all, boost::filtered_graph > > >, boost::no_property, boost::listS>, boost::is_residual_edge > > >, boost::edge_residual_capacity_t> >, boost::keep_all> >, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > > > >*, std::vector > > > >, std::allocator > > > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::InputIterator > > >, boost::edge_residual_capacity_t> >, boost::keep_all, boost::filtered_graph > > >, boost::no_property, boost::listS>, boost::is_residual_edge > > >, boost::edge_residual_capacity_t> >, boost::keep_all> >, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > > > >*, std::vector > > > >, std::allocator > > > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied > > >, boost::edge_residual_capacity_t> >, boost::keep_all, boost::filtered_graph > > >, boost::no_property, boost::listS>, boost::is_residual_edge > > >, boost::edge_residual_capacity_t> >, boost::keep_all> >, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > > > >*, std::vector > > > >, std::allocator > > > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > > >::value’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied > > >, boost::edge_residual_capacity_t> >, boost::keep_all, boost::filtered_graph > > >, boost::no_property, boost::listS>, boost::is_residual_edge > > >, boost::edge_residual_capacity_t> >, boost::keep_all> >, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > > > >*, std::vector > > > >, std::allocator > > > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > > >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:72:8: [ skipping 5 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/breadth_first_search.hpp:62:5: required from ‘void boost::breadth_first_visit(const IncidenceGraph&, SourceIterator, SourceIterator, Buffer&, BFSVisitor, ColorMap) [with IncidenceGraph = filtered_graph > > >, no_property, listS>, is_residual_edge > > >, edge_residual_capacity_t> >, keep_all>; Buffer = queue > >; BFSVisitor = bfs_visitor*, on_tree_edge> >; ColorMap = default_color_type*; SourceIterator = long unsigned int*]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/breadth_first_search.hpp:136:24: required from ‘void boost::breadth_first_search(const VertexListGraph&, SourceIterator, SourceIterator, Buffer&, BFSVisitor, ColorMap) [with VertexListGraph = filtered_graph > > >, no_property, listS>, is_residual_edge > > >, edge_residual_capacity_t> >, keep_all>; SourceIterator = long unsigned int*; Buffer = queue > >; BFSVisitor = bfs_visitor*, on_tree_edge> >; ColorMap = default_color_type*]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/breadth_first_search.hpp:147:25: required from ‘void boost::breadth_first_search(const VertexListGraph&, typename graph_traits::vertex_descriptor, Buffer&, BFSVisitor, ColorMap) [with VertexListGraph = filtered_graph > > >, no_property, listS>, is_residual_edge > > >, edge_residual_capacity_t> >, keep_all>; Buffer = queue > >; BFSVisitor = bfs_visitor*, on_tree_edge> >; ColorMap = default_color_type*; typename graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/edmonds_karp_max_flow.hpp:101:29: required from ‘typename boost::property_traits::value_type boost::edmonds_karp_max_flow(Graph&, typename graph_traits::vertex_descriptor, typename graph_traits::vertex_descriptor, CapacityEdgeMap, ResidualCapacityEdgeMap, ReverseEdgeMap, ColorMap, PredEdgeMap) [with Graph = adjacency_list > > >, no_property, listS>; CapacityEdgeMap = adj_list_edge_property_map > > >, edge_capacity_t>; ResidualCapacityEdgeMap = adj_list_edge_property_map > > >, edge_residual_capacity_t>; ReverseEdgeMap = adj_list_edge_property_map, detail::edge_desc_impl&, long unsigned int, property > > >, edge_reverse_t>; ColorMap = default_color_type*; PredEdgeMap = detail::edge_desc_impl*; typename property_traits::value_type = long unsigned int; typename graph_traits::vertex_descriptor = long unsigned int]’ mincut.hpp:78:21: required from ‘typename boost::graph_traits::edges_size_type boost::min_cut(VertexListGraph&, OutputIterator, OutputIterator) [with VertexListGraph = const R_adjacency_list; OutputIterator = std::back_insert_iterator >; typename graph_traits::edges_size_type = long unsigned int]’ hcs.cpp:299:31: required from here /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::EqualityComparable > > >, boost::edge_residual_capacity_t> >, boost::keep_all, boost::filtered_graph > > >, boost::no_property, boost::listS>, boost::is_residual_edge > > >, boost::edge_residual_capacity_t> >, boost::keep_all> >, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > > > >*, std::vector > > > >, std::allocator > > > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >]’ 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ^ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements > > >, boost::edge_residual_capacity_t> >, boost::keep_all, boost::filtered_graph > > >, boost::no_property, boost::listS>, boost::is_residual_edge > > >, boost::edge_residual_capacity_t> >, boost::keep_all> >, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > > > >*, std::vector > > > >, std::allocator > > > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > > >]’: /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:512:7: required from ‘struct boost::InputIterator > > >, boost::edge_residual_capacity_t> >, boost::keep_all, boost::filtered_graph > > >, boost::no_property, boost::listS>, boost::is_residual_edge > > >, boost::edge_residual_capacity_t> >, boost::keep_all> >, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > > > >*, std::vector > > > >, std::allocator > > > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::InputIterator > > >, boost::edge_residual_capacity_t> >, boost::keep_all, boost::filtered_graph > > >, boost::no_property, boost::listS>, boost::is_residual_edge > > >, boost::edge_residual_capacity_t> >, boost::keep_all> >, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > > > >*, std::vector > > > >, std::allocator > > > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied > > >, boost::edge_residual_capacity_t> >, boost::keep_all, boost::filtered_graph > > >, boost::no_property, boost::listS>, boost::is_residual_edge > > >, boost::edge_residual_capacity_t> >, boost::keep_all> >, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > > > >*, std::vector > > > >, std::allocator > > > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > > >::value’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied > > >, boost::edge_residual_capacity_t> >, boost::keep_all, boost::filtered_graph > > >, boost::no_property, boost::listS>, boost::is_residual_edge > > >, boost::edge_residual_capacity_t> >, boost::keep_all> >, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > > > >*, std::vector > > > >, std::allocator > > > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > > >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_ > > >, boost::edge_residual_capacity_t> >, boost::keep_all, boost::filtered_graph > > >, boost::no_property, boost::listS>, boost::is_residual_edge > > >, boost::edge_residual_capacity_t> >, boost::keep_all> >, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > > > >*, std::vector > > > >, std::allocator > > > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >)>’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/graph_concepts.hpp:53:35: [ skipping 4 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/breadth_first_search.hpp:62:5: required from ‘void boost::breadth_first_visit(const IncidenceGraph&, SourceIterator, SourceIterator, Buffer&, BFSVisitor, ColorMap) [with IncidenceGraph = filtered_graph > > >, no_property, listS>, is_residual_edge > > >, edge_residual_capacity_t> >, keep_all>; Buffer = queue > >; BFSVisitor = bfs_visitor*, on_tree_edge> >; ColorMap = default_color_type*; SourceIterator = long unsigned int*]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/breadth_first_search.hpp:136:24: required from ‘void boost::breadth_first_search(const VertexListGraph&, SourceIterator, SourceIterator, Buffer&, BFSVisitor, ColorMap) [with VertexListGraph = filtered_graph > > >, no_property, listS>, is_residual_edge > > >, edge_residual_capacity_t> >, keep_all>; SourceIterator = long unsigned int*; Buffer = queue > >; BFSVisitor = bfs_visitor*, on_tree_edge> >; ColorMap = default_color_type*]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/breadth_first_search.hpp:147:25: required from ‘void boost::breadth_first_search(const VertexListGraph&, typename graph_traits::vertex_descriptor, Buffer&, BFSVisitor, ColorMap) [with VertexListGraph = filtered_graph > > >, no_property, listS>, is_residual_edge > > >, edge_residual_capacity_t> >, keep_all>; Buffer = queue > >; BFSVisitor = bfs_visitor*, on_tree_edge> >; ColorMap = default_color_type*; typename graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/edmonds_karp_max_flow.hpp:101:29: required from ‘typename boost::property_traits::value_type boost::edmonds_karp_max_flow(Graph&, typename graph_traits::vertex_descriptor, typename graph_traits::vertex_descriptor, CapacityEdgeMap, ResidualCapacityEdgeMap, ReverseEdgeMap, ColorMap, PredEdgeMap) [with Graph = adjacency_list > > >, no_property, listS>; CapacityEdgeMap = adj_list_edge_property_map > > >, edge_capacity_t>; ResidualCapacityEdgeMap = adj_list_edge_property_map > > >, edge_residual_capacity_t>; ReverseEdgeMap = adj_list_edge_property_map, detail::edge_desc_impl&, long unsigned int, property > > >, edge_reverse_t>; ColorMap = default_color_type*; PredEdgeMap = detail::edge_desc_impl*; typename property_traits::value_type = long unsigned int; typename graph_traits::vertex_descriptor = long unsigned int]’ mincut.hpp:78:21: required from ‘typename boost::graph_traits::edges_size_type boost::min_cut(VertexListGraph&, OutputIterator, OutputIterator) [with VertexListGraph = const R_adjacency_list; OutputIterator = std::back_insert_iterator >; typename graph_traits::edges_size_type = long unsigned int]’ hcs.cpp:299:31: required from here /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::InputIterator > > >, boost::edge_residual_capacity_t> >, boost::keep_all, boost::filtered_graph > > >, boost::no_property, boost::listS>, boost::is_residual_edge > > >, boost::edge_residual_capacity_t> >, boost::keep_all> >, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > > > >*, std::vector > > > >, std::allocator > > > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >]’ 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ^ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::InputIterator > > >, boost::edge_residual_capacity_t> >, boost::keep_all, boost::filtered_graph > > >, boost::no_property, boost::listS>, boost::is_residual_edge > > >, boost::edge_residual_capacity_t> >, boost::keep_all> >, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > > > >*, std::vector > > > >, std::allocator > > > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >]’: /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/graph_concepts.hpp:53:35: required from ‘boost::concepts::MultiPassInputIterator::~MultiPassInputIterator() [with T = boost::iterators::filter_iterator > > >, boost::edge_residual_capacity_t> >, boost::keep_all, boost::filtered_graph > > >, boost::no_property, boost::listS>, boost::is_residual_edge > > >, boost::edge_residual_capacity_t> >, boost::keep_all> >, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > > > >*, std::vector > > > >, std::allocator > > > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> >]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::MultiPassInputIterator > > >, boost::edge_residual_capacity_t> >, boost::keep_all, boost::filtered_graph > > >, boost::no_property, boost::listS>, boost::is_residual_edge > > >, boost::edge_residual_capacity_t> >, boost::keep_all> >, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > > > >*, std::vector > > > >, std::allocator > > > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/graph_concepts.hpp:89:9: required from ‘boost::concepts::IncidenceGraph::~IncidenceGraph() [with G = boost::filtered_graph > > >, boost::no_property, boost::listS>, boost::is_residual_edge > > >, boost::edge_residual_capacity_t> >, boost::keep_all>]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/graph_concepts.hpp:75:1: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::IncidenceGraphConcept > > >, boost::no_property, boost::listS>, boost::is_residual_edge > > >, boost::edge_residual_capacity_t> >, boost::keep_all> >]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/breadth_first_search.hpp:62:5: required from ‘void boost::breadth_first_visit(const IncidenceGraph&, SourceIterator, SourceIterator, Buffer&, BFSVisitor, ColorMap) [with IncidenceGraph = filtered_graph > > >, no_property, listS>, is_residual_edge > > >, edge_residual_capacity_t> >, keep_all>; Buffer = queue > >; BFSVisitor = bfs_visitor*, on_tree_edge> >; ColorMap = default_color_type*; SourceIterator = long unsigned int*]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/breadth_first_search.hpp:136:24: required from ‘void boost::breadth_first_search(const VertexListGraph&, SourceIterator, SourceIterator, Buffer&, BFSVisitor, ColorMap) [with VertexListGraph = filtered_graph > > >, no_property, listS>, is_residual_edge > > >, edge_residual_capacity_t> >, keep_all>; SourceIterator = long unsigned int*; Buffer = queue > >; BFSVisitor = bfs_visitor*, on_tree_edge> >; ColorMap = default_color_type*]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/breadth_first_search.hpp:147:25: required from ‘void boost::breadth_first_search(const VertexListGraph&, typename graph_traits::vertex_descriptor, Buffer&, BFSVisitor, ColorMap) [with VertexListGraph = filtered_graph > > >, no_property, listS>, is_residual_edge > > >, edge_residual_capacity_t> >, keep_all>; Buffer = queue > >; BFSVisitor = bfs_visitor*, on_tree_edge> >; ColorMap = default_color_type*; typename graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/edmonds_karp_max_flow.hpp:101:29: required from ‘typename boost::property_traits::value_type boost::edmonds_karp_max_flow(Graph&, typename graph_traits::vertex_descriptor, typename graph_traits::vertex_descriptor, CapacityEdgeMap, ResidualCapacityEdgeMap, ReverseEdgeMap, ColorMap, PredEdgeMap) [with Graph = adjacency_list > > >, no_property, listS>; CapacityEdgeMap = adj_list_edge_property_map > > >, edge_capacity_t>; ResidualCapacityEdgeMap = adj_list_edge_property_map > > >, edge_residual_capacity_t>; ReverseEdgeMap = adj_list_edge_property_map, detail::edge_desc_impl&, long unsigned int, property > > >, edge_reverse_t>; ColorMap = default_color_type*; PredEdgeMap = detail::edge_desc_impl*; typename property_traits::value_type = long unsigned int; typename graph_traits::vertex_descriptor = long unsigned int]’ mincut.hpp:78:21: required from ‘typename boost::graph_traits::edges_size_type boost::min_cut(VertexListGraph&, OutputIterator, OutputIterator) [with VertexListGraph = const R_adjacency_list; OutputIterator = std::back_insert_iterator >; typename graph_traits::edges_size_type = long unsigned int]’ hcs.cpp:299:31: required from here /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::InputIterator::~InputIterator() [with TT = boost::iterators::filter_iterator > > >, boost::edge_residual_capacity_t> >, boost::keep_all, boost::filtered_graph > > >, boost::no_property, boost::listS>, boost::is_residual_edge > > >, boost::edge_residual_capacity_t> >, boost::keep_all> >, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > > > >*, std::vector > > > >, std::allocator > > > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> >]’ 37 | ~model() | ^ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:512:7: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 512 | BOOST_CONCEPT_USAGE(InputIterator) | ^~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::Assignable > > >, boost::edge_residual_capacity_t> >, boost::keep_all, boost::filtered_graph > > >, boost::no_property, boost::listS>, boost::is_residual_edge > > >, boost::edge_residual_capacity_t> >, boost::keep_all> >, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > > > >*, std::vector > > > >, std::allocator > > > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >]’: /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements > > >, boost::edge_residual_capacity_t> >, boost::keep_all, boost::filtered_graph > > >, boost::no_property, boost::listS>, boost::is_residual_edge > > >, boost::edge_residual_capacity_t> >, boost::keep_all> >, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > > > >*, std::vector > > > >, std::allocator > > > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > > >]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:145:5: required from ‘struct boost::Assignable > > >, boost::edge_residual_capacity_t> >, boost::keep_all, boost::filtered_graph > > >, boost::no_property, boost::listS>, boost::is_residual_edge > > >, boost::edge_residual_capacity_t> >, boost::keep_all> >, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > > > >*, std::vector > > > >, std::allocator > > > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:502:3: required from ‘struct boost::InputIterator > > >, boost::edge_residual_capacity_t> >, boost::keep_all, boost::filtered_graph > > >, boost::no_property, boost::listS>, boost::is_residual_edge > > >, boost::edge_residual_capacity_t> >, boost::keep_all> >, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > > > >*, std::vector > > > >, std::allocator > > > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::InputIterator > > >, boost::edge_residual_capacity_t> >, boost::keep_all, boost::filtered_graph > > >, boost::no_property, boost::listS>, boost::is_residual_edge > > >, boost::edge_residual_capacity_t> >, boost::keep_all> >, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > > > >*, std::vector > > > >, std::allocator > > > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied > > >, boost::edge_residual_capacity_t> >, boost::keep_all, boost::filtered_graph > > >, boost::no_property, boost::listS>, boost::is_residual_edge > > >, boost::edge_residual_capacity_t> >, boost::keep_all> >, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > > > >*, std::vector > > > >, std::allocator > > > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > > >::value’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:45:51: [ skipping 6 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/breadth_first_search.hpp:62:5: required from ‘void boost::breadth_first_visit(const IncidenceGraph&, SourceIterator, SourceIterator, Buffer&, BFSVisitor, ColorMap) [with IncidenceGraph = filtered_graph > > >, no_property, listS>, is_residual_edge > > >, edge_residual_capacity_t> >, keep_all>; Buffer = queue > >; BFSVisitor = bfs_visitor*, on_tree_edge> >; ColorMap = default_color_type*; SourceIterator = long unsigned int*]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/breadth_first_search.hpp:136:24: required from ‘void boost::breadth_first_search(const VertexListGraph&, SourceIterator, SourceIterator, Buffer&, BFSVisitor, ColorMap) [with VertexListGraph = filtered_graph > > >, no_property, listS>, is_residual_edge > > >, edge_residual_capacity_t> >, keep_all>; SourceIterator = long unsigned int*; Buffer = queue > >; BFSVisitor = bfs_visitor*, on_tree_edge> >; ColorMap = default_color_type*]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/breadth_first_search.hpp:147:25: required from ‘void boost::breadth_first_search(const VertexListGraph&, typename graph_traits::vertex_descriptor, Buffer&, BFSVisitor, ColorMap) [with VertexListGraph = filtered_graph > > >, no_property, listS>, is_residual_edge > > >, edge_residual_capacity_t> >, keep_all>; Buffer = queue > >; BFSVisitor = bfs_visitor*, on_tree_edge> >; ColorMap = default_color_type*; typename graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/edmonds_karp_max_flow.hpp:101:29: required from ‘typename boost::property_traits::value_type boost::edmonds_karp_max_flow(Graph&, typename graph_traits::vertex_descriptor, typename graph_traits::vertex_descriptor, CapacityEdgeMap, ResidualCapacityEdgeMap, ReverseEdgeMap, ColorMap, PredEdgeMap) [with Graph = adjacency_list > > >, no_property, listS>; CapacityEdgeMap = adj_list_edge_property_map > > >, edge_capacity_t>; ResidualCapacityEdgeMap = adj_list_edge_property_map > > >, edge_residual_capacity_t>; ReverseEdgeMap = adj_list_edge_property_map, detail::edge_desc_impl&, long unsigned int, property > > >, edge_reverse_t>; ColorMap = default_color_type*; PredEdgeMap = detail::edge_desc_impl*; typename property_traits::value_type = long unsigned int; typename graph_traits::vertex_descriptor = long unsigned int]’ mincut.hpp:78:21: required from ‘typename boost::graph_traits::edges_size_type boost::min_cut(VertexListGraph&, OutputIterator, OutputIterator) [with VertexListGraph = const R_adjacency_list; OutputIterator = std::back_insert_iterator >; typename graph_traits::edges_size_type = long unsigned int]’ hcs.cpp:299:31: required from here /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::Assignable::~Assignable() [with TT = boost::iterators::filter_iterator > > >, boost::edge_residual_capacity_t> >, boost::keep_all, boost::filtered_graph > > >, boost::no_property, boost::listS>, boost::is_residual_edge > > >, boost::edge_residual_capacity_t> >, boost::keep_all> >, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > > > >*, std::vector > > > >, std::allocator > > > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> >]’ 37 | ~model() | ^ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:145:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 145 | BOOST_CONCEPT_USAGE(Assignable) { | ^~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::EqualityComparable > > >, boost::edge_residual_capacity_t> >, boost::keep_all, boost::filtered_graph > > >, boost::no_property, boost::listS>, boost::is_residual_edge > > >, boost::edge_residual_capacity_t> >, boost::keep_all> >, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > > > >*, std::vector > > > >, std::allocator > > > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >]’: /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements > > >, boost::edge_residual_capacity_t> >, boost::keep_all, boost::filtered_graph > > >, boost::no_property, boost::listS>, boost::is_residual_edge > > >, boost::edge_residual_capacity_t> >, boost::keep_all> >, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > > > >*, std::vector > > > >, std::allocator > > > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > > >]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:233:5: required from ‘struct boost::EqualityComparable > > >, boost::edge_residual_capacity_t> >, boost::keep_all, boost::filtered_graph > > >, boost::no_property, boost::listS>, boost::is_residual_edge > > >, boost::edge_residual_capacity_t> >, boost::keep_all> >, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > > > >*, std::vector > > > >, std::allocator > > > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:502:3: required from ‘struct boost::InputIterator > > >, boost::edge_residual_capacity_t> >, boost::keep_all, boost::filtered_graph > > >, boost::no_property, boost::listS>, boost::is_residual_edge > > >, boost::edge_residual_capacity_t> >, boost::keep_all> >, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > > > >*, std::vector > > > >, std::allocator > > > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::InputIterator > > >, boost::edge_residual_capacity_t> >, boost::keep_all, boost::filtered_graph > > >, boost::no_property, boost::listS>, boost::is_residual_edge > > >, boost::edge_residual_capacity_t> >, boost::keep_all> >, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > > > >*, std::vector > > > >, std::allocator > > > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied > > >, boost::edge_residual_capacity_t> >, boost::keep_all, boost::filtered_graph > > >, boost::no_property, boost::listS>, boost::is_residual_edge > > >, boost::edge_residual_capacity_t> >, boost::keep_all> >, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > > > >*, std::vector > > > >, std::allocator > > > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > > >::value’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:45:51: [ skipping 6 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/breadth_first_search.hpp:62:5: required from ‘void boost::breadth_first_visit(const IncidenceGraph&, SourceIterator, SourceIterator, Buffer&, BFSVisitor, ColorMap) [with IncidenceGraph = filtered_graph > > >, no_property, listS>, is_residual_edge > > >, edge_residual_capacity_t> >, keep_all>; Buffer = queue > >; BFSVisitor = bfs_visitor*, on_tree_edge> >; ColorMap = default_color_type*; SourceIterator = long unsigned int*]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/breadth_first_search.hpp:136:24: required from ‘void boost::breadth_first_search(const VertexListGraph&, SourceIterator, SourceIterator, Buffer&, BFSVisitor, ColorMap) [with VertexListGraph = filtered_graph > > >, no_property, listS>, is_residual_edge > > >, edge_residual_capacity_t> >, keep_all>; SourceIterator = long unsigned int*; Buffer = queue > >; BFSVisitor = bfs_visitor*, on_tree_edge> >; ColorMap = default_color_type*]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/breadth_first_search.hpp:147:25: required from ‘void boost::breadth_first_search(const VertexListGraph&, typename graph_traits::vertex_descriptor, Buffer&, BFSVisitor, ColorMap) [with VertexListGraph = filtered_graph > > >, no_property, listS>, is_residual_edge > > >, edge_residual_capacity_t> >, keep_all>; Buffer = queue > >; BFSVisitor = bfs_visitor*, on_tree_edge> >; ColorMap = default_color_type*; typename graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/edmonds_karp_max_flow.hpp:101:29: required from ‘typename boost::property_traits::value_type boost::edmonds_karp_max_flow(Graph&, typename graph_traits::vertex_descriptor, typename graph_traits::vertex_descriptor, CapacityEdgeMap, ResidualCapacityEdgeMap, ReverseEdgeMap, ColorMap, PredEdgeMap) [with Graph = adjacency_list > > >, no_property, listS>; CapacityEdgeMap = adj_list_edge_property_map > > >, edge_capacity_t>; ResidualCapacityEdgeMap = adj_list_edge_property_map > > >, edge_residual_capacity_t>; ReverseEdgeMap = adj_list_edge_property_map, detail::edge_desc_impl&, long unsigned int, property > > >, edge_reverse_t>; ColorMap = default_color_type*; PredEdgeMap = detail::edge_desc_impl*; typename property_traits::value_type = long unsigned int; typename graph_traits::vertex_descriptor = long unsigned int]’ mincut.hpp:78:21: required from ‘typename boost::graph_traits::edges_size_type boost::min_cut(VertexListGraph&, OutputIterator, OutputIterator) [with VertexListGraph = const R_adjacency_list; OutputIterator = std::back_insert_iterator >; typename graph_traits::edges_size_type = long unsigned int]’ hcs.cpp:299:31: required from here /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::EqualityComparable::~EqualityComparable() [with TT = boost::iterators::filter_iterator > > >, boost::edge_residual_capacity_t> >, boost::keep_all, boost::filtered_graph > > >, boost::no_property, boost::listS>, boost::is_residual_edge > > >, boost::edge_residual_capacity_t> >, boost::keep_all> >, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > > > >*, std::vector > > > >, std::allocator > > > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> >]’ 37 | ~model() | ^ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:233:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 233 | BOOST_CONCEPT_USAGE(EqualityComparable) { | ^~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::InputIterator > > >, boost::edge_residual_capacity_t> >, boost::keep_all, boost::filtered_graph > > >, boost::no_property, boost::listS>, boost::is_residual_edge > > >, boost::edge_residual_capacity_t> >, boost::keep_all> >, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > > > >*, std::vector > > > >, std::allocator > > > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >]’: /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements > > >, boost::edge_residual_capacity_t> >, boost::keep_all, boost::filtered_graph > > >, boost::no_property, boost::listS>, boost::is_residual_edge > > >, boost::edge_residual_capacity_t> >, boost::keep_all> >, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > > > >*, std::vector > > > >, std::allocator > > > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > > >]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:512:7: required from ‘struct boost::InputIterator > > >, boost::edge_residual_capacity_t> >, boost::keep_all, boost::filtered_graph > > >, boost::no_property, boost::listS>, boost::is_residual_edge > > >, boost::edge_residual_capacity_t> >, boost::keep_all> >, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > > > >*, std::vector > > > >, std::allocator > > > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::InputIterator > > >, boost::edge_residual_capacity_t> >, boost::keep_all, boost::filtered_graph > > >, boost::no_property, boost::listS>, boost::is_residual_edge > > >, boost::edge_residual_capacity_t> >, boost::keep_all> >, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > > > >*, std::vector > > > >, std::allocator > > > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied > > >, boost::edge_residual_capacity_t> >, boost::keep_all, boost::filtered_graph > > >, boost::no_property, boost::listS>, boost::is_residual_edge > > >, boost::edge_residual_capacity_t> >, boost::keep_all> >, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > > > >*, std::vector > > > >, std::allocator > > > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > > >::value’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied > > >, boost::edge_residual_capacity_t> >, boost::keep_all, boost::filtered_graph > > >, boost::no_property, boost::listS>, boost::is_residual_edge > > >, boost::edge_residual_capacity_t> >, boost::keep_all> >, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > > > >*, std::vector > > > >, std::allocator > > > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > > >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:72:8: [ skipping 5 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/breadth_first_search.hpp:62:5: required from ‘void boost::breadth_first_visit(const IncidenceGraph&, SourceIterator, SourceIterator, Buffer&, BFSVisitor, ColorMap) [with IncidenceGraph = filtered_graph > > >, no_property, listS>, is_residual_edge > > >, edge_residual_capacity_t> >, keep_all>; Buffer = queue > >; BFSVisitor = bfs_visitor*, on_tree_edge> >; ColorMap = default_color_type*; SourceIterator = long unsigned int*]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/breadth_first_search.hpp:136:24: required from ‘void boost::breadth_first_search(const VertexListGraph&, SourceIterator, SourceIterator, Buffer&, BFSVisitor, ColorMap) [with VertexListGraph = filtered_graph > > >, no_property, listS>, is_residual_edge > > >, edge_residual_capacity_t> >, keep_all>; SourceIterator = long unsigned int*; Buffer = queue > >; BFSVisitor = bfs_visitor*, on_tree_edge> >; ColorMap = default_color_type*]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/breadth_first_search.hpp:147:25: required from ‘void boost::breadth_first_search(const VertexListGraph&, typename graph_traits::vertex_descriptor, Buffer&, BFSVisitor, ColorMap) [with VertexListGraph = filtered_graph > > >, no_property, listS>, is_residual_edge > > >, edge_residual_capacity_t> >, keep_all>; Buffer = queue > >; BFSVisitor = bfs_visitor*, on_tree_edge> >; ColorMap = default_color_type*; typename graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/edmonds_karp_max_flow.hpp:101:29: required from ‘typename boost::property_traits::value_type boost::edmonds_karp_max_flow(Graph&, typename graph_traits::vertex_descriptor, typename graph_traits::vertex_descriptor, CapacityEdgeMap, ResidualCapacityEdgeMap, ReverseEdgeMap, ColorMap, PredEdgeMap) [with Graph = adjacency_list > > >, no_property, listS>; CapacityEdgeMap = adj_list_edge_property_map > > >, edge_capacity_t>; ResidualCapacityEdgeMap = adj_list_edge_property_map > > >, edge_residual_capacity_t>; ReverseEdgeMap = adj_list_edge_property_map, detail::edge_desc_impl&, long unsigned int, property > > >, edge_reverse_t>; ColorMap = default_color_type*; PredEdgeMap = detail::edge_desc_impl*; typename property_traits::value_type = long unsigned int; typename graph_traits::vertex_descriptor = long unsigned int]’ mincut.hpp:78:21: required from ‘typename boost::graph_traits::edges_size_type boost::min_cut(VertexListGraph&, OutputIterator, OutputIterator) [with VertexListGraph = const R_adjacency_list; OutputIterator = std::back_insert_iterator >; typename graph_traits::edges_size_type = long unsigned int]’ hcs.cpp:299:31: required from here /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::InputIterator::~InputIterator() [with TT = boost::iterators::filter_iterator > > >, boost::edge_residual_capacity_t> >, boost::keep_all, boost::filtered_graph > > >, boost::no_property, boost::listS>, boost::is_residual_edge > > >, boost::edge_residual_capacity_t> >, boost::keep_all> >, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > > > >*, std::vector > > > >, std::allocator > > > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> >]’ 37 | ~model() | ^ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:512:7: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 512 | BOOST_CONCEPT_USAGE(InputIterator) | ^~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::SignedInteger]’: /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:514:9: required from ‘boost::InputIterator::~InputIterator() [with TT = boost::iterators::filter_iterator > > >, boost::edge_residual_capacity_t> >, boost::keep_all, boost::filtered_graph > > >, boost::no_property, boost::listS>, boost::is_residual_edge > > >, boost::edge_residual_capacity_t> >, boost::keep_all> >, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > > > >*, std::vector > > > >, std::allocator > > > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> >]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::InputIterator > > >, boost::edge_residual_capacity_t> >, boost::keep_all, boost::filtered_graph > > >, boost::no_property, boost::listS>, boost::is_residual_edge > > >, boost::edge_residual_capacity_t> >, boost::keep_all> >, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > > > >*, std::vector > > > >, std::allocator > > > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/graph_concepts.hpp:53:35: required from ‘boost::concepts::MultiPassInputIterator::~MultiPassInputIterator() [with T = boost::iterators::filter_iterator > > >, boost::edge_residual_capacity_t> >, boost::keep_all, boost::filtered_graph > > >, boost::no_property, boost::listS>, boost::is_residual_edge > > >, boost::edge_residual_capacity_t> >, boost::keep_all> >, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > > > >*, std::vector > > > >, std::allocator > > > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> >]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::MultiPassInputIterator > > >, boost::edge_residual_capacity_t> >, boost::keep_all, boost::filtered_graph > > >, boost::no_property, boost::listS>, boost::is_residual_edge > > >, boost::edge_residual_capacity_t> >, boost::keep_all> >, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > > > >*, std::vector > > > >, std::allocator > > > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/graph_concepts.hpp:89:9: [ skipping 2 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/breadth_first_search.hpp:62:5: required from ‘void boost::breadth_first_visit(const IncidenceGraph&, SourceIterator, SourceIterator, Buffer&, BFSVisitor, ColorMap) [with IncidenceGraph = filtered_graph > > >, no_property, listS>, is_residual_edge > > >, edge_residual_capacity_t> >, keep_all>; Buffer = queue > >; BFSVisitor = bfs_visitor*, on_tree_edge> >; ColorMap = default_color_type*; SourceIterator = long unsigned int*]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/breadth_first_search.hpp:136:24: required from ‘void boost::breadth_first_search(const VertexListGraph&, SourceIterator, SourceIterator, Buffer&, BFSVisitor, ColorMap) [with VertexListGraph = filtered_graph > > >, no_property, listS>, is_residual_edge > > >, edge_residual_capacity_t> >, keep_all>; SourceIterator = long unsigned int*; Buffer = queue > >; BFSVisitor = bfs_visitor*, on_tree_edge> >; ColorMap = default_color_type*]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/breadth_first_search.hpp:147:25: required from ‘void boost::breadth_first_search(const VertexListGraph&, typename graph_traits::vertex_descriptor, Buffer&, BFSVisitor, ColorMap) [with VertexListGraph = filtered_graph > > >, no_property, listS>, is_residual_edge > > >, edge_residual_capacity_t> >, keep_all>; Buffer = queue > >; BFSVisitor = bfs_visitor*, on_tree_edge> >; ColorMap = default_color_type*; typename graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/edmonds_karp_max_flow.hpp:101:29: required from ‘typename boost::property_traits::value_type boost::edmonds_karp_max_flow(Graph&, typename graph_traits::vertex_descriptor, typename graph_traits::vertex_descriptor, CapacityEdgeMap, ResidualCapacityEdgeMap, ReverseEdgeMap, ColorMap, PredEdgeMap) [with Graph = adjacency_list > > >, no_property, listS>; CapacityEdgeMap = adj_list_edge_property_map > > >, edge_capacity_t>; ResidualCapacityEdgeMap = adj_list_edge_property_map > > >, edge_residual_capacity_t>; ReverseEdgeMap = adj_list_edge_property_map, detail::edge_desc_impl&, long unsigned int, property > > >, edge_reverse_t>; ColorMap = default_color_type*; PredEdgeMap = detail::edge_desc_impl*; typename property_traits::value_type = long unsigned int; typename graph_traits::vertex_descriptor = long unsigned int]’ mincut.hpp:78:21: required from ‘typename boost::graph_traits::edges_size_type boost::min_cut(VertexListGraph&, OutputIterator, OutputIterator) [with VertexListGraph = const R_adjacency_list; OutputIterator = std::back_insert_iterator >; typename graph_traits::edges_size_type = long unsigned int]’ hcs.cpp:299:31: required from here /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:107:22: note: in a call to non-static member function ‘boost::SignedInteger::~SignedInteger()’ 107 | template <> struct SignedInteger {}; | ^~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements, std::input_iterator_tag> >]’: /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:208:5: required from ‘struct boost::Convertible, std::input_iterator_tag>’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::Convertible, std::input_iterator_tag>]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied, std::input_iterator_tag> >::value’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied, std::input_iterator_tag> >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_, std::input_iterator_tag>)>’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:515:9: [ skipping 6 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/breadth_first_search.hpp:62:5: required from ‘void boost::breadth_first_visit(const IncidenceGraph&, SourceIterator, SourceIterator, Buffer&, BFSVisitor, ColorMap) [with IncidenceGraph = filtered_graph > > >, no_property, listS>, is_residual_edge > > >, edge_residual_capacity_t> >, keep_all>; Buffer = queue > >; BFSVisitor = bfs_visitor*, on_tree_edge> >; ColorMap = default_color_type*; SourceIterator = long unsigned int*]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/breadth_first_search.hpp:136:24: required from ‘void boost::breadth_first_search(const VertexListGraph&, SourceIterator, SourceIterator, Buffer&, BFSVisitor, ColorMap) [with VertexListGraph = filtered_graph > > >, no_property, listS>, is_residual_edge > > >, edge_residual_capacity_t> >, keep_all>; SourceIterator = long unsigned int*; Buffer = queue > >; BFSVisitor = bfs_visitor*, on_tree_edge> >; ColorMap = default_color_type*]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/breadth_first_search.hpp:147:25: required from ‘void boost::breadth_first_search(const VertexListGraph&, typename graph_traits::vertex_descriptor, Buffer&, BFSVisitor, ColorMap) [with VertexListGraph = filtered_graph > > >, no_property, listS>, is_residual_edge > > >, edge_residual_capacity_t> >, keep_all>; Buffer = queue > >; BFSVisitor = bfs_visitor*, on_tree_edge> >; ColorMap = default_color_type*; typename graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/edmonds_karp_max_flow.hpp:101:29: required from ‘typename boost::property_traits::value_type boost::edmonds_karp_max_flow(Graph&, typename graph_traits::vertex_descriptor, typename graph_traits::vertex_descriptor, CapacityEdgeMap, ResidualCapacityEdgeMap, ReverseEdgeMap, ColorMap, PredEdgeMap) [with Graph = adjacency_list > > >, no_property, listS>; CapacityEdgeMap = adj_list_edge_property_map > > >, edge_capacity_t>; ResidualCapacityEdgeMap = adj_list_edge_property_map > > >, edge_residual_capacity_t>; ReverseEdgeMap = adj_list_edge_property_map, detail::edge_desc_impl&, long unsigned int, property > > >, edge_reverse_t>; ColorMap = default_color_type*; PredEdgeMap = detail::edge_desc_impl*; typename property_traits::value_type = long unsigned int; typename graph_traits::vertex_descriptor = long unsigned int]’ mincut.hpp:78:21: required from ‘typename boost::graph_traits::edges_size_type boost::min_cut(VertexListGraph&, OutputIterator, OutputIterator) [with VertexListGraph = const R_adjacency_list; OutputIterator = std::back_insert_iterator >; typename graph_traits::edges_size_type = long unsigned int]’ hcs.cpp:299:31: required from here /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::Convertible, std::input_iterator_tag>]’ 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ^ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::Convertible, std::input_iterator_tag>]’: /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:515:9: required from ‘boost::InputIterator::~InputIterator() [with TT = boost::iterators::filter_iterator > > >, boost::edge_residual_capacity_t> >, boost::keep_all, boost::filtered_graph > > >, boost::no_property, boost::listS>, boost::is_residual_edge > > >, boost::edge_residual_capacity_t> >, boost::keep_all> >, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > > > >*, std::vector > > > >, std::allocator > > > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> >]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::InputIterator > > >, boost::edge_residual_capacity_t> >, boost::keep_all, boost::filtered_graph > > >, boost::no_property, boost::listS>, boost::is_residual_edge > > >, boost::edge_residual_capacity_t> >, boost::keep_all> >, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > > > >*, std::vector > > > >, std::allocator > > > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/graph_concepts.hpp:53:35: required from ‘boost::concepts::MultiPassInputIterator::~MultiPassInputIterator() [with T = boost::iterators::filter_iterator > > >, boost::edge_residual_capacity_t> >, boost::keep_all, boost::filtered_graph > > >, boost::no_property, boost::listS>, boost::is_residual_edge > > >, boost::edge_residual_capacity_t> >, boost::keep_all> >, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > > > >*, std::vector > > > >, std::allocator > > > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> >]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::MultiPassInputIterator > > >, boost::edge_residual_capacity_t> >, boost::keep_all, boost::filtered_graph > > >, boost::no_property, boost::listS>, boost::is_residual_edge > > >, boost::edge_residual_capacity_t> >, boost::keep_all> >, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > > > >*, std::vector > > > >, std::allocator > > > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/graph_concepts.hpp:89:9: [ skipping 2 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/breadth_first_search.hpp:62:5: required from ‘void boost::breadth_first_visit(const IncidenceGraph&, SourceIterator, SourceIterator, Buffer&, BFSVisitor, ColorMap) [with IncidenceGraph = filtered_graph > > >, no_property, listS>, is_residual_edge > > >, edge_residual_capacity_t> >, keep_all>; Buffer = queue > >; BFSVisitor = bfs_visitor*, on_tree_edge> >; ColorMap = default_color_type*; SourceIterator = long unsigned int*]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/breadth_first_search.hpp:136:24: required from ‘void boost::breadth_first_search(const VertexListGraph&, SourceIterator, SourceIterator, Buffer&, BFSVisitor, ColorMap) [with VertexListGraph = filtered_graph > > >, no_property, listS>, is_residual_edge > > >, edge_residual_capacity_t> >, keep_all>; SourceIterator = long unsigned int*; Buffer = queue > >; BFSVisitor = bfs_visitor*, on_tree_edge> >; ColorMap = default_color_type*]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/breadth_first_search.hpp:147:25: required from ‘void boost::breadth_first_search(const VertexListGraph&, typename graph_traits::vertex_descriptor, Buffer&, BFSVisitor, ColorMap) [with VertexListGraph = filtered_graph > > >, no_property, listS>, is_residual_edge > > >, edge_residual_capacity_t> >, keep_all>; Buffer = queue > >; BFSVisitor = bfs_visitor*, on_tree_edge> >; ColorMap = default_color_type*; typename graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/edmonds_karp_max_flow.hpp:101:29: required from ‘typename boost::property_traits::value_type boost::edmonds_karp_max_flow(Graph&, typename graph_traits::vertex_descriptor, typename graph_traits::vertex_descriptor, CapacityEdgeMap, ResidualCapacityEdgeMap, ReverseEdgeMap, ColorMap, PredEdgeMap) [with Graph = adjacency_list > > >, no_property, listS>; CapacityEdgeMap = adj_list_edge_property_map > > >, edge_capacity_t>; ResidualCapacityEdgeMap = adj_list_edge_property_map > > >, edge_residual_capacity_t>; ReverseEdgeMap = adj_list_edge_property_map, detail::edge_desc_impl&, long unsigned int, property > > >, edge_reverse_t>; ColorMap = default_color_type*; PredEdgeMap = detail::edge_desc_impl*; typename property_traits::value_type = long unsigned int; typename graph_traits::vertex_descriptor = long unsigned int]’ mincut.hpp:78:21: required from ‘typename boost::graph_traits::edges_size_type boost::min_cut(VertexListGraph&, OutputIterator, OutputIterator) [with VertexListGraph = const R_adjacency_list; OutputIterator = std::back_insert_iterator >; typename graph_traits::edges_size_type = long unsigned int]’ hcs.cpp:299:31: required from here /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::Convertible::~Convertible() [with X = boost::iterators::detail::iterator_category_with_traversal; Y = std::input_iterator_tag]’ 37 | ~model() | ^ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:208:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 208 | BOOST_CONCEPT_USAGE(Convertible) { | ^~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::Convertible, std::input_iterator_tag>]’: /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements, std::input_iterator_tag> >]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:208:5: required from ‘struct boost::Convertible, std::input_iterator_tag>’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::Convertible, std::input_iterator_tag>]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied, std::input_iterator_tag> >::value’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied, std::input_iterator_tag> >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:72:8: [ skipping 7 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/breadth_first_search.hpp:62:5: required from ‘void boost::breadth_first_visit(const IncidenceGraph&, SourceIterator, SourceIterator, Buffer&, BFSVisitor, ColorMap) [with IncidenceGraph = filtered_graph > > >, no_property, listS>, is_residual_edge > > >, edge_residual_capacity_t> >, keep_all>; Buffer = queue > >; BFSVisitor = bfs_visitor*, on_tree_edge> >; ColorMap = default_color_type*; SourceIterator = long unsigned int*]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/breadth_first_search.hpp:136:24: required from ‘void boost::breadth_first_search(const VertexListGraph&, SourceIterator, SourceIterator, Buffer&, BFSVisitor, ColorMap) [with VertexListGraph = filtered_graph > > >, no_property, listS>, is_residual_edge > > >, edge_residual_capacity_t> >, keep_all>; SourceIterator = long unsigned int*; Buffer = queue > >; BFSVisitor = bfs_visitor*, on_tree_edge> >; ColorMap = default_color_type*]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/breadth_first_search.hpp:147:25: required from ‘void boost::breadth_first_search(const VertexListGraph&, typename graph_traits::vertex_descriptor, Buffer&, BFSVisitor, ColorMap) [with VertexListGraph = filtered_graph > > >, no_property, listS>, is_residual_edge > > >, edge_residual_capacity_t> >, keep_all>; Buffer = queue > >; BFSVisitor = bfs_visitor*, on_tree_edge> >; ColorMap = default_color_type*; typename graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/edmonds_karp_max_flow.hpp:101:29: required from ‘typename boost::property_traits::value_type boost::edmonds_karp_max_flow(Graph&, typename graph_traits::vertex_descriptor, typename graph_traits::vertex_descriptor, CapacityEdgeMap, ResidualCapacityEdgeMap, ReverseEdgeMap, ColorMap, PredEdgeMap) [with Graph = adjacency_list > > >, no_property, listS>; CapacityEdgeMap = adj_list_edge_property_map > > >, edge_capacity_t>; ResidualCapacityEdgeMap = adj_list_edge_property_map > > >, edge_residual_capacity_t>; ReverseEdgeMap = adj_list_edge_property_map, detail::edge_desc_impl&, long unsigned int, property > > >, edge_reverse_t>; ColorMap = default_color_type*; PredEdgeMap = detail::edge_desc_impl*; typename property_traits::value_type = long unsigned int; typename graph_traits::vertex_descriptor = long unsigned int]’ mincut.hpp:78:21: required from ‘typename boost::graph_traits::edges_size_type boost::min_cut(VertexListGraph&, OutputIterator, OutputIterator) [with VertexListGraph = const R_adjacency_list; OutputIterator = std::back_insert_iterator >; typename graph_traits::edges_size_type = long unsigned int]’ hcs.cpp:299:31: required from here /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::Convertible::~Convertible() [with X = boost::iterators::detail::iterator_category_with_traversal; Y = std::input_iterator_tag]’ 37 | ~model() | ^ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:208:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 208 | BOOST_CONCEPT_USAGE(Convertible) { | ^~~~~~~~~~~~~~~~~~~ In file included from /usr/include/c++/13/string:51, from /usr/include/c++/13/bits/locale_classes.h:40, from /usr/include/c++/13/bits/ios_base.h:41, from /usr/include/c++/13/ios:44, from /usr/include/c++/13/ostream:40, from /usr/include/c++/13/iostream:41, from RBGL.hpp:7: In static member function ‘static _Up* std::__copy_move<_IsMove, true, std::random_access_iterator_tag>::__copy_m(_Tp*, _Tp*, _Up*) [with _Tp = const int; _Up = int; bool _IsMove = false]’, inlined from ‘_OI std::__copy_move_a2(_II, _II, _OI) [with bool _IsMove = false; _II = const int*; _OI = int*]’ at /usr/include/c++/13/bits/stl_algobase.h:506:30, inlined from ‘_OI std::__copy_move_a1(_II, _II, _OI) [with bool _IsMove = false; _II = const int*; _OI = int*]’ at /usr/include/c++/13/bits/stl_algobase.h:533:42, inlined from ‘_OI std::__copy_move_a(_II, _II, _OI) [with bool _IsMove = false; _II = __gnu_cxx::__normal_iterator >; _OI = int*]’ at /usr/include/c++/13/bits/stl_algobase.h:540:31, inlined from ‘_OI std::copy(_II, _II, _OI) [with _II = __gnu_cxx::__normal_iterator >; _OI = int*]’ at /usr/include/c++/13/bits/stl_algobase.h:633:7, inlined from ‘static _ForwardIterator std::__uninitialized_copy::__uninit_copy(_InputIterator, _InputIterator, _ForwardIterator) [with _InputIterator = __gnu_cxx::__normal_iterator >; _ForwardIterator = int*]’ at /usr/include/c++/13/bits/stl_uninitialized.h:147:27, inlined from ‘_ForwardIterator std::uninitialized_copy(_InputIterator, _InputIterator, _ForwardIterator) [with _InputIterator = __gnu_cxx::__normal_iterator >; _ForwardIterator = int*]’ at /usr/include/c++/13/bits/stl_uninitialized.h:185:15, inlined from ‘_ForwardIterator std::__uninitialized_copy_a(_InputIterator, _InputIterator, _ForwardIterator, allocator<_Tp>&) [with _InputIterator = __gnu_cxx::__normal_iterator >; _ForwardIterator = int*; _Tp = int]’ at /usr/include/c++/13/bits/stl_uninitialized.h:373:37, inlined from ‘std::vector<_Tp, _Alloc>::vector(const std::vector<_Tp, _Alloc>&) [with _Tp = int; _Alloc = std::allocator]’ at /usr/include/c++/13/bits/stl_vector.h:606:31, inlined from ‘void std::__new_allocator<_Tp>::construct(_Up*, _Args&& ...) [with _Up = std::vector; _Args = {const std::vector >&}; _Tp = std::vector]’ at /usr/include/c++/13/bits/new_allocator.h:191:4, inlined from ‘static void std::allocator_traits >::construct(allocator_type&, _Up*, _Args&& ...) [with _Up = std::vector; _Args = {const std::vector >&}; _Tp = std::vector]’ at /usr/include/c++/13/bits/alloc_traits.h:538:17, inlined from ‘void std::vector<_Tp, _Alloc>::push_back(const value_type&) [with _Tp = std::vector; _Alloc = std::allocator >]’ at /usr/include/c++/13/bits/stl_vector.h:1286:30, inlined from ‘void HCS_internal(const Graph_ud&, V_Label&, ClusterResult&)’ at hcs.cpp:310:27: /usr/include/c++/13/bits/stl_algobase.h:437:30: warning: ‘void* __builtin_memmove(void*, const void*, long unsigned int)’ writing between 5 and 9223372036854775807 bytes into a region of size 4 overflows the destination [-Wstringop-overflow=] 437 | __builtin_memmove(__result, __first, sizeof(_Tp) * _Num); | ~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ In file included from /usr/include/x86_64-linux-gnu/c++/13/bits/c++allocator.h:33, from /usr/include/c++/13/bits/allocator.h:46, from /usr/include/c++/13/string:43: In member function ‘_Tp* std::__new_allocator<_Tp>::allocate(size_type, const void*) [with _Tp = int]’, inlined from ‘static _Tp* std::allocator_traits >::allocate(allocator_type&, size_type) [with _Tp = int]’ at /usr/include/c++/13/bits/alloc_traits.h:482:28, inlined from ‘std::_Vector_base<_Tp, _Alloc>::pointer std::_Vector_base<_Tp, _Alloc>::_M_allocate(std::size_t) [with _Tp = int; _Alloc = std::allocator]’ at /usr/include/c++/13/bits/stl_vector.h:381:33, inlined from ‘std::_Vector_base<_Tp, _Alloc>::pointer std::_Vector_base<_Tp, _Alloc>::_M_allocate(std::size_t) [with _Tp = int; _Alloc = std::allocator]’ at /usr/include/c++/13/bits/stl_vector.h:378:7, inlined from ‘void std::_Vector_base<_Tp, _Alloc>::_M_create_storage(std::size_t) [with _Tp = int; _Alloc = std::allocator]’ at /usr/include/c++/13/bits/stl_vector.h:398:44, inlined from ‘std::_Vector_base<_Tp, _Alloc>::_Vector_base(std::size_t, const allocator_type&) [with _Tp = int; _Alloc = std::allocator]’ at /usr/include/c++/13/bits/stl_vector.h:335:26, inlined from ‘std::vector<_Tp, _Alloc>::vector(const std::vector<_Tp, _Alloc>&) [with _Tp = int; _Alloc = std::allocator]’ at /usr/include/c++/13/bits/stl_vector.h:603:61, inlined from ‘void std::__new_allocator<_Tp>::construct(_Up*, _Args&& ...) [with _Up = std::vector; _Args = {const std::vector >&}; _Tp = std::vector]’ at /usr/include/c++/13/bits/new_allocator.h:191:4, inlined from ‘static void std::allocator_traits >::construct(allocator_type&, _Up*, _Args&& ...) [with _Up = std::vector; _Args = {const std::vector >&}; _Tp = std::vector]’ at /usr/include/c++/13/bits/alloc_traits.h:538:17, inlined from ‘void std::vector<_Tp, _Alloc>::push_back(const value_type&) [with _Tp = std::vector; _Alloc = std::allocator >]’ at /usr/include/c++/13/bits/stl_vector.h:1286:30, inlined from ‘void HCS_internal(const Graph_ud&, V_Label&, ClusterResult&)’ at hcs.cpp:310:27: /usr/include/c++/13/bits/new_allocator.h:151:55: note: destination object of size 4 allocated by ‘operator new’ 151 | return static_cast<_Tp*>(_GLIBCXX_OPERATOR_NEW(__n * sizeof(_Tp))); | ^ g++ -std=gnu++17 -I"/usr/share/R/include" -DNDEBUG -I'/home/omnipath/local/R/4.4-3.20/BH/include' -fpic -g -O2 -fno-omit-frame-pointer -mno-omit-leaf-frame-pointer -ffile-prefix-map=/build/r-base-EawLoD/r-base-4.4.1=. -fstack-protector-strong -fstack-clash-protection -Wformat -Werror=format-security -fcf-protection -fdebug-prefix-map=/build/r-base-EawLoD/r-base-4.4.1=/usr/src/r-base-4.4.1-1.2404.0 -Wdate-time -D_FORTIFY_SOURCE=3 -c incrConnComp.cpp -o incrConnComp.o In file included from /home/omnipath/local/R/4.4-3.20/BH/include/boost/smart_ptr/shared_ptr.hpp:18, from /home/omnipath/local/R/4.4-3.20/BH/include/boost/property_map/vector_property_map.hpp:14, from /home/omnipath/local/R/4.4-3.20/BH/include/boost/property_map/property_map.hpp:598, from RBGL.hpp:17, from incrConnComp.cpp:1: /home/omnipath/local/R/4.4-3.20/BH/include/boost/smart_ptr/detail/shared_count.hpp:361:33: warning: ‘template class std::auto_ptr’ is deprecated: use 'std::unique_ptr' instead [-Wdeprecated-declarations] 361 | explicit shared_count( std::auto_ptr & r ): pi_( new sp_counted_impl_p( r.get() ) ) | ^~~~~~~~ In file included from /usr/include/c++/13/memory:78, from /home/omnipath/local/R/4.4-3.20/BH/include/boost/smart_ptr/detail/sp_counted_impl.hpp:35, from /home/omnipath/local/R/4.4-3.20/BH/include/boost/smart_ptr/detail/shared_count.hpp:27: /usr/include/c++/13/bits/unique_ptr.h:65:28: note: declared here 65 | template class auto_ptr; | ^~~~~~~~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/smart_ptr/shared_ptr.hpp:251:65: warning: ‘template class std::auto_ptr’ is deprecated: use 'std::unique_ptr' instead [-Wdeprecated-declarations] 251 | template< class T, class R > struct sp_enable_if_auto_ptr< std::auto_ptr< T >, R > | ^~~~~~~~ /usr/include/c++/13/bits/unique_ptr.h:65:28: note: declared here 65 | template class auto_ptr; | ^~~~~~~~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/smart_ptr/shared_ptr.hpp:508:31: warning: ‘template class std::auto_ptr’ is deprecated: use 'std::unique_ptr' instead [-Wdeprecated-declarations] 508 | explicit shared_ptr( std::auto_ptr & r ): px(r.get()), pn() | ^~~~~~~~ /usr/include/c++/13/bits/unique_ptr.h:65:28: note: declared here 65 | template class auto_ptr; | ^~~~~~~~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/smart_ptr/shared_ptr.hpp:521:22: warning: ‘template class std::auto_ptr’ is deprecated: use 'std::unique_ptr' instead [-Wdeprecated-declarations] 521 | shared_ptr( std::auto_ptr && r ): px(r.get()), pn() | ^~~~~~~~ /usr/include/c++/13/bits/unique_ptr.h:65:28: note: declared here 65 | template class auto_ptr; | ^~~~~~~~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/smart_ptr/shared_ptr.hpp:604:34: warning: ‘template class std::auto_ptr’ is deprecated: use 'std::unique_ptr' instead [-Wdeprecated-declarations] 604 | shared_ptr & operator=( std::auto_ptr & r ) | ^~~~~~~~ /usr/include/c++/13/bits/unique_ptr.h:65:28: note: declared here 65 | template class auto_ptr; | ^~~~~~~~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/smart_ptr/shared_ptr.hpp:613:34: warning: ‘template class std::auto_ptr’ is deprecated: use 'std::unique_ptr' instead [-Wdeprecated-declarations] 613 | shared_ptr & operator=( std::auto_ptr && r ) | ^~~~~~~~ /usr/include/c++/13/bits/unique_ptr.h:65:28: note: declared here 65 | template class auto_ptr; | ^~~~~~~~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/smart_ptr/shared_ptr.hpp: In member function ‘boost::shared_ptr& boost::shared_ptr::operator=(std::auto_ptr<_Up>&&)’: /home/omnipath/local/R/4.4-3.20/BH/include/boost/smart_ptr/shared_ptr.hpp:615:38: warning: ‘template class std::auto_ptr’ is deprecated: use 'std::unique_ptr' instead [-Wdeprecated-declarations] 615 | this_type( static_cast< std::auto_ptr && >( r ) ).swap( *this ); | ^~~~~~~~ /usr/include/c++/13/bits/unique_ptr.h:65:28: note: declared here 65 | template class auto_ptr; | ^~~~~~~~ In file included from /home/omnipath/local/R/4.4-3.20/BH/include/boost/scoped_ptr.hpp:13, from /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/adjacency_list.hpp:22, from RBGL.hpp:38: /home/omnipath/local/R/4.4-3.20/BH/include/boost/smart_ptr/scoped_ptr.hpp: At global scope: /home/omnipath/local/R/4.4-3.20/BH/include/boost/smart_ptr/scoped_ptr.hpp:75:31: warning: ‘template class std::auto_ptr’ is deprecated: use 'std::unique_ptr' instead [-Wdeprecated-declarations] 75 | explicit scoped_ptr( std::auto_ptr p ) BOOST_SP_NOEXCEPT : px( p.release() ) | ^~~~~~~~ /usr/include/c++/13/bits/unique_ptr.h:65:28: note: declared here 65 | template class auto_ptr; | ^~~~~~~~ g++ -std=gnu++17 -I"/usr/share/R/include" -DNDEBUG -I'/home/omnipath/local/R/4.4-3.20/BH/include' -fpic -g -O2 -fno-omit-frame-pointer -mno-omit-leaf-frame-pointer -ffile-prefix-map=/build/r-base-EawLoD/r-base-4.4.1=. -fstack-protector-strong -fstack-clash-protection -Wformat -Werror=format-security -fcf-protection -fdebug-prefix-map=/build/r-base-EawLoD/r-base-4.4.1=/usr/src/r-base-4.4.1-1.2404.0 -Wdate-time -D_FORTIFY_SOURCE=3 -c interfaces.cpp -o interfaces.o In file included from /home/omnipath/local/R/4.4-3.20/BH/include/boost/smart_ptr/shared_ptr.hpp:18, from /home/omnipath/local/R/4.4-3.20/BH/include/boost/property_map/vector_property_map.hpp:14, from /home/omnipath/local/R/4.4-3.20/BH/include/boost/property_map/property_map.hpp:598, from RBGL.hpp:17, from interfaces.cpp:1: /home/omnipath/local/R/4.4-3.20/BH/include/boost/smart_ptr/detail/shared_count.hpp:361:33: warning: ‘template class std::auto_ptr’ is deprecated: use 'std::unique_ptr' instead [-Wdeprecated-declarations] 361 | explicit shared_count( std::auto_ptr & r ): pi_( new sp_counted_impl_p( r.get() ) ) | ^~~~~~~~ In file included from /usr/include/c++/13/memory:78, from /home/omnipath/local/R/4.4-3.20/BH/include/boost/smart_ptr/detail/sp_counted_impl.hpp:35, from /home/omnipath/local/R/4.4-3.20/BH/include/boost/smart_ptr/detail/shared_count.hpp:27: /usr/include/c++/13/bits/unique_ptr.h:65:28: note: declared here 65 | template class auto_ptr; | ^~~~~~~~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/smart_ptr/shared_ptr.hpp:251:65: warning: ‘template class std::auto_ptr’ is deprecated: use 'std::unique_ptr' instead [-Wdeprecated-declarations] 251 | template< class T, class R > struct sp_enable_if_auto_ptr< std::auto_ptr< T >, R > | ^~~~~~~~ /usr/include/c++/13/bits/unique_ptr.h:65:28: note: declared here 65 | template class auto_ptr; | ^~~~~~~~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/smart_ptr/shared_ptr.hpp:508:31: warning: ‘template class std::auto_ptr’ is deprecated: use 'std::unique_ptr' instead [-Wdeprecated-declarations] 508 | explicit shared_ptr( std::auto_ptr & r ): px(r.get()), pn() | ^~~~~~~~ /usr/include/c++/13/bits/unique_ptr.h:65:28: note: declared here 65 | template class auto_ptr; | ^~~~~~~~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/smart_ptr/shared_ptr.hpp:521:22: warning: ‘template class std::auto_ptr’ is deprecated: use 'std::unique_ptr' instead [-Wdeprecated-declarations] 521 | shared_ptr( std::auto_ptr && r ): px(r.get()), pn() | ^~~~~~~~ /usr/include/c++/13/bits/unique_ptr.h:65:28: note: declared here 65 | template class auto_ptr; | ^~~~~~~~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/smart_ptr/shared_ptr.hpp:604:34: warning: ‘template class std::auto_ptr’ is deprecated: use 'std::unique_ptr' instead [-Wdeprecated-declarations] 604 | shared_ptr & operator=( std::auto_ptr & r ) | ^~~~~~~~ /usr/include/c++/13/bits/unique_ptr.h:65:28: note: declared here 65 | template class auto_ptr; | ^~~~~~~~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/smart_ptr/shared_ptr.hpp:613:34: warning: ‘template class std::auto_ptr’ is deprecated: use 'std::unique_ptr' instead [-Wdeprecated-declarations] 613 | shared_ptr & operator=( std::auto_ptr && r ) | ^~~~~~~~ /usr/include/c++/13/bits/unique_ptr.h:65:28: note: declared here 65 | template class auto_ptr; | ^~~~~~~~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/smart_ptr/shared_ptr.hpp: In member function ‘boost::shared_ptr& boost::shared_ptr::operator=(std::auto_ptr<_Up>&&)’: /home/omnipath/local/R/4.4-3.20/BH/include/boost/smart_ptr/shared_ptr.hpp:615:38: warning: ‘template class std::auto_ptr’ is deprecated: use 'std::unique_ptr' instead [-Wdeprecated-declarations] 615 | this_type( static_cast< std::auto_ptr && >( r ) ).swap( *this ); | ^~~~~~~~ /usr/include/c++/13/bits/unique_ptr.h:65:28: note: declared here 65 | template class auto_ptr; | ^~~~~~~~ In file included from /home/omnipath/local/R/4.4-3.20/BH/include/boost/scoped_ptr.hpp:13, from /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/adjacency_list.hpp:22, from RBGL.hpp:38: /home/omnipath/local/R/4.4-3.20/BH/include/boost/smart_ptr/scoped_ptr.hpp: At global scope: /home/omnipath/local/R/4.4-3.20/BH/include/boost/smart_ptr/scoped_ptr.hpp:75:31: warning: ‘template class std::auto_ptr’ is deprecated: use 'std::unique_ptr' instead [-Wdeprecated-declarations] 75 | explicit scoped_ptr( std::auto_ptr p ) BOOST_SP_NOEXCEPT : px( p.release() ) | ^~~~~~~~ /usr/include/c++/13/bits/unique_ptr.h:65:28: note: declared here 65 | template class auto_ptr; | ^~~~~~~~ In file included from /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/assert.hpp:35, from /home/omnipath/local/R/4.4-3.20/BH/include/boost/property_map/property_map.hpp:19: /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::constraint::failed() [with Model = boost::WritablePropertyMapConcept]’: /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/connected_components.hpp:76:5: required from ‘typename boost::property_traits::value_type boost::connected_components(const Graph&, ComponentMap, typename enable_if_c::traversal_category>::value, graph::detail::no_parameter>::type) [with Graph = R_adjacency_list; ComponentMap = int*; typename property_traits::value_type = int; typename enable_if_c::traversal_category>::value, graph::detail::no_parameter>::type = graph::detail::no_parameter; typename graph_traits::traversal_category = undir_adj_list_traversal_tag]’ interfaces.cpp:205:29: required from here /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:65:52: warning: ‘this’ pointer is null [-Wnonnull] 65 | static void failed() { ((Model*)0)->constraints(); } | ~~~~~~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/property_map/property_map.hpp:179:10: note: in a call to non-static member function ‘void boost::WritablePropertyMapConcept::constraints() [with PMap = int*; Key = long unsigned int]’ 179 | void constraints() { | ^~~~~~~~~~~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements >]’: /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:208:5: required from ‘struct boost::Convertible’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:206:3: required from ‘struct boost::ConvertibleConcept’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::ConvertibleConcept]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied >::value’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:72:8: [ skipping 2 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::WritablePropertyMapConcept]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied >::value’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_)>’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/connected_components.hpp:76:5: required from ‘typename boost::property_traits::value_type boost::connected_components(const Graph&, ComponentMap, typename enable_if_c::traversal_category>::value, graph::detail::no_parameter>::type) [with Graph = R_adjacency_list; ComponentMap = int*; typename property_traits::value_type = int; typename enable_if_c::traversal_category>::value, graph::detail::no_parameter>::type = graph::detail::no_parameter; typename graph_traits::traversal_category = undir_adj_list_traversal_tag]’ interfaces.cpp:205:29: required from here /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ In file included from /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:31, from /home/omnipath/local/R/4.4-3.20/BH/include/boost/property_map/property_map.hpp:20: /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::Convertible]’ 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ^ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::ConvertibleConcept]’: /home/omnipath/local/R/4.4-3.20/BH/include/boost/property_map/property_map.hpp:180:7: required from ‘void boost::WritablePropertyMapConcept::constraints() [with PMap = int*; Key = long unsigned int]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::WritablePropertyMapConcept]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied >::value’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_)>’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/connected_components.hpp:76:5: required from ‘typename boost::property_traits::value_type boost::connected_components(const Graph&, ComponentMap, typename enable_if_c::traversal_category>::value, graph::detail::no_parameter>::type) [with Graph = R_adjacency_list; ComponentMap = int*; typename property_traits::value_type = int; typename enable_if_c::traversal_category>::value, graph::detail::no_parameter>::type = graph::detail::no_parameter; typename graph_traits::traversal_category = undir_adj_list_traversal_tag]’ interfaces.cpp:205:29: required from here /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ In file included from /home/omnipath/local/R/4.4-3.20/BH/include/boost/preprocessor/repetition/enum_binary_params.hpp:15, from /home/omnipath/local/R/4.4-3.20/BH/include/boost/utility/base_from_member.hpp:15, from /home/omnipath/local/R/4.4-3.20/BH/include/boost/utility.hpp:15, from RBGL.hpp:16: /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:206:17: note: in a call to non-static member function ‘boost::ConvertibleConcept::~ConvertibleConcept()’ 206 | BOOST_concept(Convertible,(X)(Y)) | ^~~~~~~~~~~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/preprocessor/cat.hpp:29:34: note: in definition of macro ‘BOOST_PP_CAT_I’ 29 | # define BOOST_PP_CAT_I(a, b) a ## b | ^ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/concept_def.hpp:23:12: note: in expansion of macro ‘BOOST_PP_CAT’ 23 | struct BOOST_PP_CAT(name,Concept) \ | ^~~~~~~~~~~~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:206:3: note: in expansion of macro ‘BOOST_concept’ 206 | BOOST_concept(Convertible,(X)(Y)) | ^~~~~~~~~~~~~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements > > >]’: /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:145:5: required from ‘struct boost::Assignable<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:502:3: required from ‘struct boost::InputIterator<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:540:3: required from ‘struct boost::ForwardIterator<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:568:3: required from ‘struct boost::BidirectionalIterator<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:597:3: required from ‘struct boost::RandomAccessIterator<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:597:3: [ skipping 2 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied > > >::value’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied > > >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_ > >)>’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/property_map/property_map.hpp:354:5: required from ‘boost::iterator_property_map boost::make_iterator_property_map(RAIter, ID, Value) [with RAIter = __gnu_cxx::__normal_iterator >; Value = long unsigned int; ID = typed_identity_property_map]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/sequential_vertex_coloring.hpp:120:35: required from ‘typename boost::property_traits::value_type boost::sequential_vertex_coloring(const VertexListGraph&, ColorMap) [with VertexListGraph = R_adjacency_list; ColorMap = iterator_property_map, long unsigned int> >; typename property_traits::value_type = long unsigned int]’ interfaces.cpp:370:56: required from here /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::Assignable<__gnu_cxx::__normal_iterator > >]’ 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ^ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements > > >]’: /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:233:5: required from ‘struct boost::EqualityComparable<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:502:3: required from ‘struct boost::InputIterator<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:540:3: required from ‘struct boost::ForwardIterator<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:568:3: required from ‘struct boost::BidirectionalIterator<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:597:3: required from ‘struct boost::RandomAccessIterator<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:597:3: [ skipping 2 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied > > >::value’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied > > >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_ > >)>’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/property_map/property_map.hpp:354:5: required from ‘boost::iterator_property_map boost::make_iterator_property_map(RAIter, ID, Value) [with RAIter = __gnu_cxx::__normal_iterator >; Value = long unsigned int; ID = typed_identity_property_map]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/sequential_vertex_coloring.hpp:120:35: required from ‘typename boost::property_traits::value_type boost::sequential_vertex_coloring(const VertexListGraph&, ColorMap) [with VertexListGraph = R_adjacency_list; ColorMap = iterator_property_map, long unsigned int> >; typename property_traits::value_type = long unsigned int]’ interfaces.cpp:370:56: required from here /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::EqualityComparable<__gnu_cxx::__normal_iterator > >]’ 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ^ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements > > >]’: /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:512:7: required from ‘struct boost::InputIterator<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:540:3: required from ‘struct boost::ForwardIterator<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:568:3: required from ‘struct boost::BidirectionalIterator<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:597:3: required from ‘struct boost::RandomAccessIterator<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:597:3: [ skipping 2 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied > > >::value’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied > > >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_ > >)>’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/property_map/property_map.hpp:354:5: required from ‘boost::iterator_property_map boost::make_iterator_property_map(RAIter, ID, Value) [with RAIter = __gnu_cxx::__normal_iterator >; Value = long unsigned int; ID = typed_identity_property_map]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/sequential_vertex_coloring.hpp:120:35: required from ‘typename boost::property_traits::value_type boost::sequential_vertex_coloring(const VertexListGraph&, ColorMap) [with VertexListGraph = R_adjacency_list; ColorMap = iterator_property_map, long unsigned int> >; typename property_traits::value_type = long unsigned int]’ interfaces.cpp:370:56: required from here /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::InputIterator<__gnu_cxx::__normal_iterator > >]’ 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ^ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements > > >]’: /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:543:7: required from ‘struct boost::ForwardIterator<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:568:3: required from ‘struct boost::BidirectionalIterator<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:597:3: required from ‘struct boost::RandomAccessIterator<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:597:3: required from ‘struct boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator > >]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied > > >::value’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied > > >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_ > >)>’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/property_map/property_map.hpp:354:5: required from ‘boost::iterator_property_map boost::make_iterator_property_map(RAIter, ID, Value) [with RAIter = __gnu_cxx::__normal_iterator >; Value = long unsigned int; ID = typed_identity_property_map]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/sequential_vertex_coloring.hpp:120:35: required from ‘typename boost::property_traits::value_type boost::sequential_vertex_coloring(const VertexListGraph&, ColorMap) [with VertexListGraph = R_adjacency_list; ColorMap = iterator_property_map, long unsigned int> >; typename property_traits::value_type = long unsigned int]’ interfaces.cpp:370:56: required from here /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::ForwardIterator<__gnu_cxx::__normal_iterator > >]’ 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ^ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements > > >]’: /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:571:7: required from ‘struct boost::BidirectionalIterator<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:597:3: required from ‘struct boost::RandomAccessIterator<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:597:3: required from ‘struct boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator > >]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied > > >::value’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied > > >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_ > >)>’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/property_map/property_map.hpp:354:5: required from ‘boost::iterator_property_map boost::make_iterator_property_map(RAIter, ID, Value) [with RAIter = __gnu_cxx::__normal_iterator >; Value = long unsigned int; ID = typed_identity_property_map]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/sequential_vertex_coloring.hpp:120:35: required from ‘typename boost::property_traits::value_type boost::sequential_vertex_coloring(const VertexListGraph&, ColorMap) [with VertexListGraph = R_adjacency_list; ColorMap = iterator_property_map, long unsigned int> >; typename property_traits::value_type = long unsigned int]’ interfaces.cpp:370:56: required from here /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::BidirectionalIterator<__gnu_cxx::__normal_iterator > >]’ 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ^ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements > > >]’: /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:253:5: required from ‘struct boost::Comparable<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:597:3: required from ‘struct boost::RandomAccessIterator<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:597:3: required from ‘struct boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator > >]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied > > >::value’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied > > >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_ > >)>’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/property_map/property_map.hpp:354:5: required from ‘boost::iterator_property_map boost::make_iterator_property_map(RAIter, ID, Value) [with RAIter = __gnu_cxx::__normal_iterator >; Value = long unsigned int; ID = typed_identity_property_map]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/sequential_vertex_coloring.hpp:120:35: required from ‘typename boost::property_traits::value_type boost::sequential_vertex_coloring(const VertexListGraph&, ColorMap) [with VertexListGraph = R_adjacency_list; ColorMap = iterator_property_map, long unsigned int> >; typename property_traits::value_type = long unsigned int]’ interfaces.cpp:370:56: required from here /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::Comparable<__gnu_cxx::__normal_iterator > >]’ 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ^ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements > > >]’: /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:601:7: required from ‘struct boost::RandomAccessIterator<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:597:3: required from ‘struct boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator > >]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied > > >::value’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied > > >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_ > >)>’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/property_map/property_map.hpp:354:5: required from ‘boost::iterator_property_map boost::make_iterator_property_map(RAIter, ID, Value) [with RAIter = __gnu_cxx::__normal_iterator >; Value = long unsigned int; ID = typed_identity_property_map]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/sequential_vertex_coloring.hpp:120:35: required from ‘typename boost::property_traits::value_type boost::sequential_vertex_coloring(const VertexListGraph&, ColorMap) [with VertexListGraph = R_adjacency_list; ColorMap = iterator_property_map, long unsigned int> >; typename property_traits::value_type = long unsigned int]’ interfaces.cpp:370:56: required from here /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::RandomAccessIterator<__gnu_cxx::__normal_iterator > >]’ 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ^ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator > >]’: /home/omnipath/local/R/4.4-3.20/BH/include/boost/property_map/property_map.hpp:354:5: required from ‘boost::iterator_property_map boost::make_iterator_property_map(RAIter, ID, Value) [with RAIter = __gnu_cxx::__normal_iterator >; Value = long unsigned int; ID = typed_identity_property_map]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/sequential_vertex_coloring.hpp:120:35: required from ‘typename boost::property_traits::value_type boost::sequential_vertex_coloring(const VertexListGraph&, ColorMap) [with VertexListGraph = R_adjacency_list; ColorMap = iterator_property_map, long unsigned int> >; typename property_traits::value_type = long unsigned int]’ interfaces.cpp:370:56: required from here /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:597:17: note: in a call to non-static member function ‘boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator > >::~RandomAccessIteratorConcept()’ 597 | BOOST_concept(RandomAccessIterator,(TT)) | ^~~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/preprocessor/cat.hpp:29:34: note: in definition of macro ‘BOOST_PP_CAT_I’ 29 | # define BOOST_PP_CAT_I(a, b) a ## b | ^ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/concept_def.hpp:23:12: note: in expansion of macro ‘BOOST_PP_CAT’ 23 | struct BOOST_PP_CAT(name,Concept) \ | ^~~~~~~~~~~~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:597:3: note: in expansion of macro ‘BOOST_concept’ 597 | BOOST_concept(RandomAccessIterator,(TT)) | ^~~~~~~~~~~~~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::Convertible]’: /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements >]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:208:5: required from ‘struct boost::Convertible’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:206:3: required from ‘struct boost::ConvertibleConcept’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::ConvertibleConcept]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied >::value’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:45:51: [ skipping 3 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::WritablePropertyMapConcept]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied >::value’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_)>’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/connected_components.hpp:76:5: required from ‘typename boost::property_traits::value_type boost::connected_components(const Graph&, ComponentMap, typename enable_if_c::traversal_category>::value, graph::detail::no_parameter>::type) [with Graph = R_adjacency_list; ComponentMap = int*; typename property_traits::value_type = int; typename enable_if_c::traversal_category>::value, graph::detail::no_parameter>::type = graph::detail::no_parameter; typename graph_traits::traversal_category = undir_adj_list_traversal_tag]’ interfaces.cpp:205:29: required from here /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::Convertible::~Convertible() [with X = boost::lvalue_property_map_tag; Y = boost::writable_property_map_tag]’ 37 | ~model() | ^ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:208:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 208 | BOOST_CONCEPT_USAGE(Convertible) { | ^~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::Assignable<__gnu_cxx::__normal_iterator > >]’: /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements > > >]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:145:5: required from ‘struct boost::Assignable<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:502:3: required from ‘struct boost::InputIterator<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:540:3: required from ‘struct boost::ForwardIterator<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:568:3: required from ‘struct boost::BidirectionalIterator<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:597:3: [ skipping 3 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied > > >::value’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied > > >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_ > >)>’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/property_map/property_map.hpp:354:5: required from ‘boost::iterator_property_map boost::make_iterator_property_map(RAIter, ID, Value) [with RAIter = __gnu_cxx::__normal_iterator >; Value = long unsigned int; ID = typed_identity_property_map]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/sequential_vertex_coloring.hpp:120:35: required from ‘typename boost::property_traits::value_type boost::sequential_vertex_coloring(const VertexListGraph&, ColorMap) [with VertexListGraph = R_adjacency_list; ColorMap = iterator_property_map, long unsigned int> >; typename property_traits::value_type = long unsigned int]’ interfaces.cpp:370:56: required from here /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::Assignable::~Assignable() [with TT = __gnu_cxx::__normal_iterator >]’ 37 | ~model() | ^ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:145:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 145 | BOOST_CONCEPT_USAGE(Assignable) { | ^~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::EqualityComparable<__gnu_cxx::__normal_iterator > >]’: /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements > > >]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:233:5: required from ‘struct boost::EqualityComparable<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:502:3: required from ‘struct boost::InputIterator<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:540:3: required from ‘struct boost::ForwardIterator<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:568:3: required from ‘struct boost::BidirectionalIterator<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:597:3: [ skipping 3 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied > > >::value’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied > > >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_ > >)>’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/property_map/property_map.hpp:354:5: required from ‘boost::iterator_property_map boost::make_iterator_property_map(RAIter, ID, Value) [with RAIter = __gnu_cxx::__normal_iterator >; Value = long unsigned int; ID = typed_identity_property_map]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/sequential_vertex_coloring.hpp:120:35: required from ‘typename boost::property_traits::value_type boost::sequential_vertex_coloring(const VertexListGraph&, ColorMap) [with VertexListGraph = R_adjacency_list; ColorMap = iterator_property_map, long unsigned int> >; typename property_traits::value_type = long unsigned int]’ interfaces.cpp:370:56: required from here /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::EqualityComparable::~EqualityComparable() [with TT = __gnu_cxx::__normal_iterator >]’ 37 | ~model() | ^ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:233:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 233 | BOOST_CONCEPT_USAGE(EqualityComparable) { | ^~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::InputIterator<__gnu_cxx::__normal_iterator > >]’: /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements > > >]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:512:7: required from ‘struct boost::InputIterator<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:540:3: required from ‘struct boost::ForwardIterator<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:568:3: required from ‘struct boost::BidirectionalIterator<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:597:3: required from ‘struct boost::RandomAccessIterator<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:597:3: [ skipping 2 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied > > >::value’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied > > >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_ > >)>’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/property_map/property_map.hpp:354:5: required from ‘boost::iterator_property_map boost::make_iterator_property_map(RAIter, ID, Value) [with RAIter = __gnu_cxx::__normal_iterator >; Value = long unsigned int; ID = typed_identity_property_map]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/sequential_vertex_coloring.hpp:120:35: required from ‘typename boost::property_traits::value_type boost::sequential_vertex_coloring(const VertexListGraph&, ColorMap) [with VertexListGraph = R_adjacency_list; ColorMap = iterator_property_map, long unsigned int> >; typename property_traits::value_type = long unsigned int]’ interfaces.cpp:370:56: required from here /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::InputIterator::~InputIterator() [with TT = __gnu_cxx::__normal_iterator >]’ 37 | ~model() | ^ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:512:7: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 512 | BOOST_CONCEPT_USAGE(InputIterator) | ^~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::ForwardIterator<__gnu_cxx::__normal_iterator > >]’: /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements > > >]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:543:7: required from ‘struct boost::ForwardIterator<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:568:3: required from ‘struct boost::BidirectionalIterator<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:597:3: required from ‘struct boost::RandomAccessIterator<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:597:3: [ skipping 2 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied > > >::value’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied > > >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_ > >)>’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/property_map/property_map.hpp:354:5: required from ‘boost::iterator_property_map boost::make_iterator_property_map(RAIter, ID, Value) [with RAIter = __gnu_cxx::__normal_iterator >; Value = long unsigned int; ID = typed_identity_property_map]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/sequential_vertex_coloring.hpp:120:35: required from ‘typename boost::property_traits::value_type boost::sequential_vertex_coloring(const VertexListGraph&, ColorMap) [with VertexListGraph = R_adjacency_list; ColorMap = iterator_property_map, long unsigned int> >; typename property_traits::value_type = long unsigned int]’ interfaces.cpp:370:56: required from here /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::ForwardIterator::~ForwardIterator() [with TT = __gnu_cxx::__normal_iterator >]’ 37 | ~model() | ^ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:543:7: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 543 | BOOST_CONCEPT_USAGE(ForwardIterator) | ^~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::BidirectionalIterator<__gnu_cxx::__normal_iterator > >]’: /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements > > >]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:571:7: required from ‘struct boost::BidirectionalIterator<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:597:3: required from ‘struct boost::RandomAccessIterator<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:597:3: required from ‘struct boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator > >]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied > > >::value’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied > > >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_ > >)>’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/property_map/property_map.hpp:354:5: required from ‘boost::iterator_property_map boost::make_iterator_property_map(RAIter, ID, Value) [with RAIter = __gnu_cxx::__normal_iterator >; Value = long unsigned int; ID = typed_identity_property_map]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/sequential_vertex_coloring.hpp:120:35: required from ‘typename boost::property_traits::value_type boost::sequential_vertex_coloring(const VertexListGraph&, ColorMap) [with VertexListGraph = R_adjacency_list; ColorMap = iterator_property_map, long unsigned int> >; typename property_traits::value_type = long unsigned int]’ interfaces.cpp:370:56: required from here /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::BidirectionalIterator::~BidirectionalIterator() [with TT = __gnu_cxx::__normal_iterator >]’ 37 | ~model() | ^ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:571:7: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 571 | BOOST_CONCEPT_USAGE(BidirectionalIterator) | ^~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::Comparable<__gnu_cxx::__normal_iterator > >]’: /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements > > >]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:253:5: required from ‘struct boost::Comparable<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:597:3: required from ‘struct boost::RandomAccessIterator<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:597:3: required from ‘struct boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator > >]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied > > >::value’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied > > >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_ > >)>’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/property_map/property_map.hpp:354:5: required from ‘boost::iterator_property_map boost::make_iterator_property_map(RAIter, ID, Value) [with RAIter = __gnu_cxx::__normal_iterator >; Value = long unsigned int; ID = typed_identity_property_map]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/sequential_vertex_coloring.hpp:120:35: required from ‘typename boost::property_traits::value_type boost::sequential_vertex_coloring(const VertexListGraph&, ColorMap) [with VertexListGraph = R_adjacency_list; ColorMap = iterator_property_map, long unsigned int> >; typename property_traits::value_type = long unsigned int]’ interfaces.cpp:370:56: required from here /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::Comparable::~Comparable() [with TT = __gnu_cxx::__normal_iterator >]’ 37 | ~model() | ^ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:253:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 253 | BOOST_CONCEPT_USAGE(Comparable) { | ^~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::RandomAccessIterator<__gnu_cxx::__normal_iterator > >]’: /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements > > >]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:601:7: required from ‘struct boost::RandomAccessIterator<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:597:3: required from ‘struct boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator > >]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied > > >::value’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied > > >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_ > >)>’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/property_map/property_map.hpp:354:5: required from ‘boost::iterator_property_map boost::make_iterator_property_map(RAIter, ID, Value) [with RAIter = __gnu_cxx::__normal_iterator >; Value = long unsigned int; ID = typed_identity_property_map]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/sequential_vertex_coloring.hpp:120:35: required from ‘typename boost::property_traits::value_type boost::sequential_vertex_coloring(const VertexListGraph&, ColorMap) [with VertexListGraph = R_adjacency_list; ColorMap = iterator_property_map, long unsigned int> >; typename property_traits::value_type = long unsigned int]’ interfaces.cpp:370:56: required from here /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::RandomAccessIterator::~RandomAccessIterator() [with TT = __gnu_cxx::__normal_iterator >]’ 37 | ~model() | ^ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:601:7: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 601 | BOOST_CONCEPT_USAGE(RandomAccessIterator) | ^~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::constraint::failed() [with Model = boost::DFSVisitorConcept, R_adjacency_list >]’: /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/depth_first_search.hpp:130:9: required from ‘void boost::depth_first_search(const VertexListGraph&, DFSVisitor, ColorMap, typename graph_traits::vertex_descriptor) [with VertexListGraph = R_adjacency_list; DFSVisitor = dfs_time_visitor; ColorMap = shared_array_property_map, long unsigned int> >; typename graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/depth_first_search.hpp:397:42: required from ‘void boost::graph::detail::depth_first_search_impl::operator()(const Graph&, const ArgPack&) const [with ArgPack = boost::parameter::aux::arg_list >, boost::parameter::aux::empty_arg_list, std::integral_constant >; Graph = R_adjacency_list]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/depth_first_search.hpp:406:5: required from ‘typename boost::result_of(Param0, const ArgPack&)>::type boost::graph::depth_first_search_with_named_params(const Param0&, const ArgPack&) [with Param0 = R_adjacency_list; ArgPack = boost::parameter::aux::arg_list >, boost::parameter::aux::empty_arg_list, std::integral_constant >; typename boost::result_of(Param0, const ArgPack&)>::type = void]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/depth_first_search.hpp:409:1: required from ‘typename boost::result_of(Param0, const typename boost::detail::convert_bgl_params_to_boost_parameter >::type&)>::type boost::depth_first_search(const Param0&, const bgl_named_params&) [with Param0 = R_adjacency_list; P = dfs_time_visitor; T = graph_visitor_t; R = no_property; typename result_of(Param0, const typename detail::convert_bgl_params_to_boost_parameter >::type&)>::type = void; typename detail::convert_bgl_params_to_boost_parameter >::type = parameter::aux::arg_list >, parameter::aux::empty_arg_list, std::integral_constant >]’ interfaces.cpp:158:27: required from here /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:65:52: warning: ‘this’ pointer is null [-Wnonnull] 65 | static void failed() { ((Model*)0)->constraints(); } | ~~~~~~~~~~~~~~~~~~~~~~~~^~ In file included from interfaces.cpp:3: /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/depth_first_search.hpp:39:10: note: in a call to non-static member function ‘void boost::DFSVisitorConcept::constraints() [with Visitor = dfs_time_visitor; Graph = R_adjacency_list]’ 39 | void constraints() | ^~~~~~~~~~~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements >]’: /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:208:5: required from ‘struct boost::Convertible’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::Convertible]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied >::value’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_)>’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:603:11: required from ‘boost::RandomAccessIterator::~RandomAccessIterator() [with TT = __gnu_cxx::__normal_iterator >]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:597:3: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator > >]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/property_map/property_map.hpp:354:5: required from ‘boost::iterator_property_map boost::make_iterator_property_map(RAIter, ID, Value) [with RAIter = __gnu_cxx::__normal_iterator >; Value = long unsigned int; ID = typed_identity_property_map]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/sequential_vertex_coloring.hpp:120:35: required from ‘typename boost::property_traits::value_type boost::sequential_vertex_coloring(const VertexListGraph&, ColorMap) [with VertexListGraph = R_adjacency_list; ColorMap = iterator_property_map, long unsigned int> >; typename property_traits::value_type = long unsigned int]’ interfaces.cpp:370:56: required from here /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::Convertible]’ 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ^ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::Convertible]’: /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:603:11: required from ‘boost::RandomAccessIterator::~RandomAccessIterator() [with TT = __gnu_cxx::__normal_iterator >]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:597:3: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator > >]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/property_map/property_map.hpp:354:5: required from ‘boost::iterator_property_map boost::make_iterator_property_map(RAIter, ID, Value) [with RAIter = __gnu_cxx::__normal_iterator >; Value = long unsigned int; ID = typed_identity_property_map]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/sequential_vertex_coloring.hpp:120:35: required from ‘typename boost::property_traits::value_type boost::sequential_vertex_coloring(const VertexListGraph&, ColorMap) [with VertexListGraph = R_adjacency_list; ColorMap = iterator_property_map, long unsigned int> >; typename property_traits::value_type = long unsigned int]’ interfaces.cpp:370:56: required from here /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::Convertible::~Convertible() [with X = std::random_access_iterator_tag; Y = std::random_access_iterator_tag]’ 37 | ~model() | ^ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:208:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 208 | BOOST_CONCEPT_USAGE(Convertible) { | ^~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements > >]’: /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:167:5: required from ‘struct boost::CopyConstructible >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:165:3: required from ‘struct boost::CopyConstructibleConcept >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::CopyConstructibleConcept >]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied > >::value’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied > >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:72:8: [ skipping 5 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_, R_adjacency_list >)>’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/depth_first_search.hpp:130:9: required from ‘void boost::depth_first_search(const VertexListGraph&, DFSVisitor, ColorMap, typename graph_traits::vertex_descriptor) [with VertexListGraph = R_adjacency_list; DFSVisitor = dfs_time_visitor; ColorMap = shared_array_property_map, long unsigned int> >; typename graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/depth_first_search.hpp:397:42: required from ‘void boost::graph::detail::depth_first_search_impl::operator()(const Graph&, const ArgPack&) const [with ArgPack = boost::parameter::aux::arg_list >, boost::parameter::aux::empty_arg_list, std::integral_constant >; Graph = R_adjacency_list]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/depth_first_search.hpp:406:5: required from ‘typename boost::result_of(Param0, const ArgPack&)>::type boost::graph::depth_first_search_with_named_params(const Param0&, const ArgPack&) [with Param0 = R_adjacency_list; ArgPack = boost::parameter::aux::arg_list >, boost::parameter::aux::empty_arg_list, std::integral_constant >; typename boost::result_of(Param0, const ArgPack&)>::type = void]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/depth_first_search.hpp:409:1: required from ‘typename boost::result_of(Param0, const typename boost::detail::convert_bgl_params_to_boost_parameter >::type&)>::type boost::depth_first_search(const Param0&, const bgl_named_params&) [with Param0 = R_adjacency_list; P = dfs_time_visitor; T = graph_visitor_t; R = no_property; typename result_of(Param0, const typename detail::convert_bgl_params_to_boost_parameter >::type&)>::type = void; typename detail::convert_bgl_params_to_boost_parameter >::type = parameter::aux::arg_list >, parameter::aux::empty_arg_list, std::integral_constant >]’ interfaces.cpp:158:27: required from here /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::CopyConstructible >]’ 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ^ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::CopyConstructibleConcept >]’: /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/depth_first_search.hpp:41:9: required from ‘void boost::DFSVisitorConcept::constraints() [with Visitor = dfs_time_visitor; Graph = R_adjacency_list]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::DFSVisitorConcept, R_adjacency_list >]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied, R_adjacency_list > >::value’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied, R_adjacency_list > >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_, R_adjacency_list >)>’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/depth_first_search.hpp:130:9: required from ‘void boost::depth_first_search(const VertexListGraph&, DFSVisitor, ColorMap, typename graph_traits::vertex_descriptor) [with VertexListGraph = R_adjacency_list; DFSVisitor = dfs_time_visitor; ColorMap = shared_array_property_map, long unsigned int> >; typename graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/depth_first_search.hpp:397:42: required from ‘void boost::graph::detail::depth_first_search_impl::operator()(const Graph&, const ArgPack&) const [with ArgPack = boost::parameter::aux::arg_list >, boost::parameter::aux::empty_arg_list, std::integral_constant >; Graph = R_adjacency_list]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/depth_first_search.hpp:406:5: required from ‘typename boost::result_of(Param0, const ArgPack&)>::type boost::graph::depth_first_search_with_named_params(const Param0&, const ArgPack&) [with Param0 = R_adjacency_list; ArgPack = boost::parameter::aux::arg_list >, boost::parameter::aux::empty_arg_list, std::integral_constant >; typename boost::result_of(Param0, const ArgPack&)>::type = void]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/depth_first_search.hpp:409:1: required from ‘typename boost::result_of(Param0, const typename boost::detail::convert_bgl_params_to_boost_parameter >::type&)>::type boost::depth_first_search(const Param0&, const bgl_named_params&) [with Param0 = R_adjacency_list; P = dfs_time_visitor; T = graph_visitor_t; R = no_property; typename result_of(Param0, const typename detail::convert_bgl_params_to_boost_parameter >::type&)>::type = void; typename detail::convert_bgl_params_to_boost_parameter >::type = parameter::aux::arg_list >, parameter::aux::empty_arg_list, std::integral_constant >]’ interfaces.cpp:158:27: required from here /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:165:17: note: in a call to non-static member function ‘boost::CopyConstructibleConcept >::~CopyConstructibleConcept()’ 165 | BOOST_concept(CopyConstructible,(TT)) | ^~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/preprocessor/cat.hpp:29:34: note: in definition of macro ‘BOOST_PP_CAT_I’ 29 | # define BOOST_PP_CAT_I(a, b) a ## b | ^ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/concept_def.hpp:23:12: note: in expansion of macro ‘BOOST_PP_CAT’ 23 | struct BOOST_PP_CAT(name,Concept) \ | ^~~~~~~~~~~~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:165:3: note: in expansion of macro ‘BOOST_concept’ 165 | BOOST_concept(CopyConstructible,(TT)) | ^~~~~~~~~~~~~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements > >]’: /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/graph_concepts.hpp:66:5: required from ‘struct boost::concepts::Graph >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/graph_concepts.hpp:75:1: required from ‘struct boost::concepts::IncidenceGraph >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/graph_concepts.hpp:75:1: required from ‘struct boost::concepts::IncidenceGraphConcept >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::concepts::IncidenceGraphConcept >]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied > >::value’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:45:51: [ skipping 2 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/depth_first_search.hpp:129:9: required from ‘void boost::detail::depth_first_visit_impl(const IncidenceGraph&, typename boost::graph_traits::vertex_descriptor, DFSVisitor&, ColorMap, TerminatorFunc) [with IncidenceGraph = R_adjacency_list; DFSVisitor = dfs_time_visitor; ColorMap = boost::shared_array_property_map, long unsigned int> >; TerminatorFunc = nontruth2; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/depth_first_search.hpp:286:39: required from ‘void boost::depth_first_search(const VertexListGraph&, DFSVisitor, ColorMap, typename graph_traits::vertex_descriptor) [with VertexListGraph = R_adjacency_list; DFSVisitor = dfs_time_visitor; ColorMap = shared_array_property_map, long unsigned int> >; typename graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/depth_first_search.hpp:397:42: required from ‘void boost::graph::detail::depth_first_search_impl::operator()(const Graph&, const ArgPack&) const [with ArgPack = boost::parameter::aux::arg_list >, boost::parameter::aux::empty_arg_list, std::integral_constant >; Graph = R_adjacency_list]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/depth_first_search.hpp:406:5: required from ‘typename boost::result_of(Param0, const ArgPack&)>::type boost::graph::depth_first_search_with_named_params(const Param0&, const ArgPack&) [with Param0 = R_adjacency_list; ArgPack = boost::parameter::aux::arg_list >, boost::parameter::aux::empty_arg_list, std::integral_constant >; typename boost::result_of(Param0, const ArgPack&)>::type = void]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/depth_first_search.hpp:409:1: required from ‘typename boost::result_of(Param0, const typename boost::detail::convert_bgl_params_to_boost_parameter >::type&)>::type boost::depth_first_search(const Param0&, const bgl_named_params&) [with Param0 = R_adjacency_list; P = dfs_time_visitor; T = graph_visitor_t; R = no_property; typename result_of(Param0, const typename detail::convert_bgl_params_to_boost_parameter >::type&)>::type = void; typename detail::convert_bgl_params_to_boost_parameter >::type = parameter::aux::arg_list >, parameter::aux::empty_arg_list, std::integral_constant >]’ interfaces.cpp:158:27: required from here /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::concepts::Graph >]’ 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ^ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements > >]’: /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/graph_concepts.hpp:87:5: required from ‘struct boost::concepts::IncidenceGraph >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/graph_concepts.hpp:75:1: required from ‘struct boost::concepts::IncidenceGraphConcept >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::concepts::IncidenceGraphConcept >]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied > >::value’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:45:51: [ skipping 2 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/depth_first_search.hpp:129:9: required from ‘void boost::detail::depth_first_visit_impl(const IncidenceGraph&, typename boost::graph_traits::vertex_descriptor, DFSVisitor&, ColorMap, TerminatorFunc) [with IncidenceGraph = R_adjacency_list; DFSVisitor = dfs_time_visitor; ColorMap = boost::shared_array_property_map, long unsigned int> >; TerminatorFunc = nontruth2; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/depth_first_search.hpp:286:39: required from ‘void boost::depth_first_search(const VertexListGraph&, DFSVisitor, ColorMap, typename graph_traits::vertex_descriptor) [with VertexListGraph = R_adjacency_list; DFSVisitor = dfs_time_visitor; ColorMap = shared_array_property_map, long unsigned int> >; typename graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/depth_first_search.hpp:397:42: required from ‘void boost::graph::detail::depth_first_search_impl::operator()(const Graph&, const ArgPack&) const [with ArgPack = boost::parameter::aux::arg_list >, boost::parameter::aux::empty_arg_list, std::integral_constant >; Graph = R_adjacency_list]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/depth_first_search.hpp:406:5: required from ‘typename boost::result_of(Param0, const ArgPack&)>::type boost::graph::depth_first_search_with_named_params(const Param0&, const ArgPack&) [with Param0 = R_adjacency_list; ArgPack = boost::parameter::aux::arg_list >, boost::parameter::aux::empty_arg_list, std::integral_constant >; typename boost::result_of(Param0, const ArgPack&)>::type = void]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/depth_first_search.hpp:409:1: required from ‘typename boost::result_of(Param0, const typename boost::detail::convert_bgl_params_to_boost_parameter >::type&)>::type boost::depth_first_search(const Param0&, const bgl_named_params&) [with Param0 = R_adjacency_list; P = dfs_time_visitor; T = graph_visitor_t; R = no_property; typename result_of(Param0, const typename detail::convert_bgl_params_to_boost_parameter >::type&)>::type = void; typename detail::convert_bgl_params_to_boost_parameter >::type = parameter::aux::arg_list >, parameter::aux::empty_arg_list, std::integral_constant >]’ interfaces.cpp:158:27: required from here /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::concepts::IncidenceGraph >]’ 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ^ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::IncidenceGraphConcept >]’: /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/depth_first_search.hpp:129:9: required from ‘void boost::detail::depth_first_visit_impl(const IncidenceGraph&, typename boost::graph_traits::vertex_descriptor, DFSVisitor&, ColorMap, TerminatorFunc) [with IncidenceGraph = R_adjacency_list; DFSVisitor = dfs_time_visitor; ColorMap = boost::shared_array_property_map, long unsigned int> >; TerminatorFunc = nontruth2; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/depth_first_search.hpp:286:39: required from ‘void boost::depth_first_search(const VertexListGraph&, DFSVisitor, ColorMap, typename graph_traits::vertex_descriptor) [with VertexListGraph = R_adjacency_list; DFSVisitor = dfs_time_visitor; ColorMap = shared_array_property_map, long unsigned int> >; typename graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/depth_first_search.hpp:397:42: required from ‘void boost::graph::detail::depth_first_search_impl::operator()(const Graph&, const ArgPack&) const [with ArgPack = boost::parameter::aux::arg_list >, boost::parameter::aux::empty_arg_list, std::integral_constant >; Graph = R_adjacency_list]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/depth_first_search.hpp:406:5: required from ‘typename boost::result_of(Param0, const ArgPack&)>::type boost::graph::depth_first_search_with_named_params(const Param0&, const ArgPack&) [with Param0 = R_adjacency_list; ArgPack = boost::parameter::aux::arg_list >, boost::parameter::aux::empty_arg_list, std::integral_constant >; typename boost::result_of(Param0, const ArgPack&)>::type = void]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/depth_first_search.hpp:409:1: required from ‘typename boost::result_of(Param0, const typename boost::detail::convert_bgl_params_to_boost_parameter >::type&)>::type boost::depth_first_search(const Param0&, const bgl_named_params&) [with Param0 = R_adjacency_list; P = dfs_time_visitor; T = graph_visitor_t; R = no_property; typename result_of(Param0, const typename detail::convert_bgl_params_to_boost_parameter >::type&)>::type = void; typename detail::convert_bgl_params_to_boost_parameter >::type = parameter::aux::arg_list >, parameter::aux::empty_arg_list, std::integral_constant >]’ interfaces.cpp:158:27: required from here /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/graph_concepts.hpp:75:15: note: in a call to non-static member function ‘boost::concepts::IncidenceGraphConcept >::~IncidenceGraphConcept()’ 75 | BOOST_concept(IncidenceGraph, (G)) : Graph< G > | ^~~~~~~~~~~~~~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/preprocessor/cat.hpp:29:34: note: in definition of macro ‘BOOST_PP_CAT_I’ 29 | # define BOOST_PP_CAT_I(a, b) a ## b | ^ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/concept_def.hpp:23:12: note: in expansion of macro ‘BOOST_PP_CAT’ 23 | struct BOOST_PP_CAT(name,Concept) \ | ^~~~~~~~~~~~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/graph_concepts.hpp:75:1: note: in expansion of macro ‘BOOST_concept’ 75 | BOOST_concept(IncidenceGraph, (G)) : Graph< G > | ^~~~~~~~~~~~~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::constraint::failed() [with Model = boost::ReadWritePropertyMapConcept, long unsigned int> >, long unsigned int>]’: /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/depth_first_search.hpp:134:9: required from ‘void boost::detail::depth_first_visit_impl(const IncidenceGraph&, typename boost::graph_traits::vertex_descriptor, DFSVisitor&, ColorMap, TerminatorFunc) [with IncidenceGraph = R_adjacency_list; DFSVisitor = dfs_time_visitor; ColorMap = boost::shared_array_property_map, long unsigned int> >; TerminatorFunc = nontruth2; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/depth_first_search.hpp:286:39: required from ‘void boost::depth_first_search(const VertexListGraph&, DFSVisitor, ColorMap, typename graph_traits::vertex_descriptor) [with VertexListGraph = R_adjacency_list; DFSVisitor = dfs_time_visitor; ColorMap = shared_array_property_map, long unsigned int> >; typename graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/depth_first_search.hpp:397:42: required from ‘void boost::graph::detail::depth_first_search_impl::operator()(const Graph&, const ArgPack&) const [with ArgPack = boost::parameter::aux::arg_list >, boost::parameter::aux::empty_arg_list, std::integral_constant >; Graph = R_adjacency_list]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/depth_first_search.hpp:406:5: required from ‘typename boost::result_of(Param0, const ArgPack&)>::type boost::graph::depth_first_search_with_named_params(const Param0&, const ArgPack&) [with Param0 = R_adjacency_list; ArgPack = boost::parameter::aux::arg_list >, boost::parameter::aux::empty_arg_list, std::integral_constant >; typename boost::result_of(Param0, const ArgPack&)>::type = void]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/depth_first_search.hpp:409:1: required from ‘typename boost::result_of(Param0, const typename boost::detail::convert_bgl_params_to_boost_parameter >::type&)>::type boost::depth_first_search(const Param0&, const bgl_named_params&) [with Param0 = R_adjacency_list; P = dfs_time_visitor; T = graph_visitor_t; R = no_property; typename result_of(Param0, const typename detail::convert_bgl_params_to_boost_parameter >::type&)>::type = void; typename detail::convert_bgl_params_to_boost_parameter >::type = parameter::aux::arg_list >, parameter::aux::empty_arg_list, std::integral_constant >]’ interfaces.cpp:158:27: required from here /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:65:52: warning: ‘this’ pointer is null [-Wnonnull] 65 | static void failed() { ((Model*)0)->constraints(); } | ~~~~~~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/property_map/property_map.hpp:205:10: note: in a call to non-static member function ‘void boost::ReadWritePropertyMapConcept::constraints() [with PMap = boost::shared_array_property_map, long unsigned int> >; Key = long unsigned int]’ 205 | void constraints() { | ^~~~~~~~~~~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements >]’: /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:233:5: required from ‘struct boost::EqualityComparable’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/graph_concepts.hpp:502:1: required from ‘struct boost::concepts::ColorValue’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/graph_concepts.hpp:502:1: required from ‘struct boost::concepts::ColorValueConcept’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::concepts::ColorValueConcept]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied >::value’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:45:51: [ skipping 2 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/depth_first_search.hpp:136:9: required from ‘void boost::detail::depth_first_visit_impl(const IncidenceGraph&, typename boost::graph_traits::vertex_descriptor, DFSVisitor&, ColorMap, TerminatorFunc) [with IncidenceGraph = R_adjacency_list; DFSVisitor = dfs_time_visitor; ColorMap = boost::shared_array_property_map, long unsigned int> >; TerminatorFunc = nontruth2; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/depth_first_search.hpp:286:39: required from ‘void boost::depth_first_search(const VertexListGraph&, DFSVisitor, ColorMap, typename graph_traits::vertex_descriptor) [with VertexListGraph = R_adjacency_list; DFSVisitor = dfs_time_visitor; ColorMap = shared_array_property_map, long unsigned int> >; typename graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/depth_first_search.hpp:397:42: required from ‘void boost::graph::detail::depth_first_search_impl::operator()(const Graph&, const ArgPack&) const [with ArgPack = boost::parameter::aux::arg_list >, boost::parameter::aux::empty_arg_list, std::integral_constant >; Graph = R_adjacency_list]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/depth_first_search.hpp:406:5: required from ‘typename boost::result_of(Param0, const ArgPack&)>::type boost::graph::depth_first_search_with_named_params(const Param0&, const ArgPack&) [with Param0 = R_adjacency_list; ArgPack = boost::parameter::aux::arg_list >, boost::parameter::aux::empty_arg_list, std::integral_constant >; typename boost::result_of(Param0, const ArgPack&)>::type = void]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/depth_first_search.hpp:409:1: required from ‘typename boost::result_of(Param0, const typename boost::detail::convert_bgl_params_to_boost_parameter >::type&)>::type boost::depth_first_search(const Param0&, const bgl_named_params&) [with Param0 = R_adjacency_list; P = dfs_time_visitor; T = graph_visitor_t; R = no_property; typename result_of(Param0, const typename detail::convert_bgl_params_to_boost_parameter >::type&)>::type = void; typename detail::convert_bgl_params_to_boost_parameter >::type = parameter::aux::arg_list >, parameter::aux::empty_arg_list, std::integral_constant >]’ interfaces.cpp:158:27: required from here /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::EqualityComparable]’ 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ^ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements >]’: /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:137:5: required from ‘struct boost::DefaultConstructible’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/graph_concepts.hpp:502:1: required from ‘struct boost::concepts::ColorValue’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/graph_concepts.hpp:502:1: required from ‘struct boost::concepts::ColorValueConcept’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::concepts::ColorValueConcept]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied >::value’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:45:51: [ skipping 2 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/depth_first_search.hpp:136:9: required from ‘void boost::detail::depth_first_visit_impl(const IncidenceGraph&, typename boost::graph_traits::vertex_descriptor, DFSVisitor&, ColorMap, TerminatorFunc) [with IncidenceGraph = R_adjacency_list; DFSVisitor = dfs_time_visitor; ColorMap = boost::shared_array_property_map, long unsigned int> >; TerminatorFunc = nontruth2; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/depth_first_search.hpp:286:39: required from ‘void boost::depth_first_search(const VertexListGraph&, DFSVisitor, ColorMap, typename graph_traits::vertex_descriptor) [with VertexListGraph = R_adjacency_list; DFSVisitor = dfs_time_visitor; ColorMap = shared_array_property_map, long unsigned int> >; typename graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/depth_first_search.hpp:397:42: required from ‘void boost::graph::detail::depth_first_search_impl::operator()(const Graph&, const ArgPack&) const [with ArgPack = boost::parameter::aux::arg_list >, boost::parameter::aux::empty_arg_list, std::integral_constant >; Graph = R_adjacency_list]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/depth_first_search.hpp:406:5: required from ‘typename boost::result_of(Param0, const ArgPack&)>::type boost::graph::depth_first_search_with_named_params(const Param0&, const ArgPack&) [with Param0 = R_adjacency_list; ArgPack = boost::parameter::aux::arg_list >, boost::parameter::aux::empty_arg_list, std::integral_constant >; typename boost::result_of(Param0, const ArgPack&)>::type = void]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/depth_first_search.hpp:409:1: required from ‘typename boost::result_of(Param0, const typename boost::detail::convert_bgl_params_to_boost_parameter >::type&)>::type boost::depth_first_search(const Param0&, const bgl_named_params&) [with Param0 = R_adjacency_list; P = dfs_time_visitor; T = graph_visitor_t; R = no_property; typename result_of(Param0, const typename detail::convert_bgl_params_to_boost_parameter >::type&)>::type = void; typename detail::convert_bgl_params_to_boost_parameter >::type = parameter::aux::arg_list >, parameter::aux::empty_arg_list, std::integral_constant >]’ interfaces.cpp:158:27: required from here /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::DefaultConstructible]’ 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ^ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements >]’: /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/graph_concepts.hpp:505:5: required from ‘struct boost::concepts::ColorValue’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/graph_concepts.hpp:502:1: required from ‘struct boost::concepts::ColorValueConcept’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::concepts::ColorValueConcept]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied >::value’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:45:51: [ skipping 2 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/depth_first_search.hpp:136:9: required from ‘void boost::detail::depth_first_visit_impl(const IncidenceGraph&, typename boost::graph_traits::vertex_descriptor, DFSVisitor&, ColorMap, TerminatorFunc) [with IncidenceGraph = R_adjacency_list; DFSVisitor = dfs_time_visitor; ColorMap = boost::shared_array_property_map, long unsigned int> >; TerminatorFunc = nontruth2; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/depth_first_search.hpp:286:39: required from ‘void boost::depth_first_search(const VertexListGraph&, DFSVisitor, ColorMap, typename graph_traits::vertex_descriptor) [with VertexListGraph = R_adjacency_list; DFSVisitor = dfs_time_visitor; ColorMap = shared_array_property_map, long unsigned int> >; typename graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/depth_first_search.hpp:397:42: required from ‘void boost::graph::detail::depth_first_search_impl::operator()(const Graph&, const ArgPack&) const [with ArgPack = boost::parameter::aux::arg_list >, boost::parameter::aux::empty_arg_list, std::integral_constant >; Graph = R_adjacency_list]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/depth_first_search.hpp:406:5: required from ‘typename boost::result_of(Param0, const ArgPack&)>::type boost::graph::depth_first_search_with_named_params(const Param0&, const ArgPack&) [with Param0 = R_adjacency_list; ArgPack = boost::parameter::aux::arg_list >, boost::parameter::aux::empty_arg_list, std::integral_constant >; typename boost::result_of(Param0, const ArgPack&)>::type = void]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/depth_first_search.hpp:409:1: required from ‘typename boost::result_of(Param0, const typename boost::detail::convert_bgl_params_to_boost_parameter >::type&)>::type boost::depth_first_search(const Param0&, const bgl_named_params&) [with Param0 = R_adjacency_list; P = dfs_time_visitor; T = graph_visitor_t; R = no_property; typename result_of(Param0, const typename detail::convert_bgl_params_to_boost_parameter >::type&)>::type = void; typename detail::convert_bgl_params_to_boost_parameter >::type = parameter::aux::arg_list >, parameter::aux::empty_arg_list, std::integral_constant >]’ interfaces.cpp:158:27: required from here /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::concepts::ColorValue]’ 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ^ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::ColorValueConcept]’: /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/depth_first_search.hpp:136:9: required from ‘void boost::detail::depth_first_visit_impl(const IncidenceGraph&, typename boost::graph_traits::vertex_descriptor, DFSVisitor&, ColorMap, TerminatorFunc) [with IncidenceGraph = R_adjacency_list; DFSVisitor = dfs_time_visitor; ColorMap = boost::shared_array_property_map, long unsigned int> >; TerminatorFunc = nontruth2; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/depth_first_search.hpp:286:39: required from ‘void boost::depth_first_search(const VertexListGraph&, DFSVisitor, ColorMap, typename graph_traits::vertex_descriptor) [with VertexListGraph = R_adjacency_list; DFSVisitor = dfs_time_visitor; ColorMap = shared_array_property_map, long unsigned int> >; typename graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/depth_first_search.hpp:397:42: required from ‘void boost::graph::detail::depth_first_search_impl::operator()(const Graph&, const ArgPack&) const [with ArgPack = boost::parameter::aux::arg_list >, boost::parameter::aux::empty_arg_list, std::integral_constant >; Graph = R_adjacency_list]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/depth_first_search.hpp:406:5: required from ‘typename boost::result_of(Param0, const ArgPack&)>::type boost::graph::depth_first_search_with_named_params(const Param0&, const ArgPack&) [with Param0 = R_adjacency_list; ArgPack = boost::parameter::aux::arg_list >, boost::parameter::aux::empty_arg_list, std::integral_constant >; typename boost::result_of(Param0, const ArgPack&)>::type = void]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/depth_first_search.hpp:409:1: required from ‘typename boost::result_of(Param0, const typename boost::detail::convert_bgl_params_to_boost_parameter >::type&)>::type boost::depth_first_search(const Param0&, const bgl_named_params&) [with Param0 = R_adjacency_list; P = dfs_time_visitor; T = graph_visitor_t; R = no_property; typename result_of(Param0, const typename detail::convert_bgl_params_to_boost_parameter >::type&)>::type = void; typename detail::convert_bgl_params_to_boost_parameter >::type = parameter::aux::arg_list >, parameter::aux::empty_arg_list, std::integral_constant >]’ interfaces.cpp:158:27: required from here /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/graph_concepts.hpp:502:15: note: in a call to non-static member function ‘boost::concepts::ColorValueConcept::~ColorValueConcept()’ 502 | BOOST_concept(ColorValue, (C)) | ^~~~~~~~~~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/preprocessor/cat.hpp:29:34: note: in definition of macro ‘BOOST_PP_CAT_I’ 29 | # define BOOST_PP_CAT_I(a, b) a ## b | ^ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/concept_def.hpp:23:12: note: in expansion of macro ‘BOOST_PP_CAT’ 23 | struct BOOST_PP_CAT(name,Concept) \ | ^~~~~~~~~~~~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/graph_concepts.hpp:502:1: note: in expansion of macro ‘BOOST_concept’ 502 | BOOST_concept(ColorValue, (C)) | ^~~~~~~~~~~~~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::constraint::failed() [with Model = boost::DFSVisitorConcept, R_adjacency_list >]’: /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/depth_first_search.hpp:130:9: required from ‘void boost::depth_first_search(const VertexListGraph&, DFSVisitor, ColorMap, typename graph_traits::vertex_descriptor) [with VertexListGraph = R_adjacency_list; DFSVisitor = detail::components_recorder; ColorMap = shared_array_property_map, long unsigned int> >; typename graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/depth_first_search.hpp:397:42: required from ‘void boost::graph::detail::depth_first_search_impl::operator()(const Graph&, const ArgPack&) const [with ArgPack = boost::parameter::aux::arg_list >, boost::parameter::aux::empty_arg_list, std::integral_constant >; Graph = R_adjacency_list]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/depth_first_search.hpp:406:5: required from ‘typename boost::result_of(Param0, const ArgPack&)>::type boost::graph::depth_first_search_with_named_params(const Param0&, const ArgPack&) [with Param0 = R_adjacency_list; ArgPack = boost::parameter::aux::arg_list >, boost::parameter::aux::empty_arg_list, std::integral_constant >; typename boost::result_of(Param0, const ArgPack&)>::type = void]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/depth_first_search.hpp:409:1: required from ‘typename boost::result_of(Param0, const typename boost::detail::convert_bgl_params_to_boost_parameter >::type&)>::type boost::depth_first_search(const Param0&, const bgl_named_params&) [with Param0 = R_adjacency_list; P = detail::components_recorder; T = graph_visitor_t; R = no_property; typename result_of(Param0, const typename detail::convert_bgl_params_to_boost_parameter >::type&)>::type = void; typename detail::convert_bgl_params_to_boost_parameter >::type = parameter::aux::arg_list >, parameter::aux::empty_arg_list, std::integral_constant >]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/connected_components.hpp:106:23: required from ‘typename boost::property_traits::value_type boost::connected_components(const Graph&, ComponentMap, typename enable_if_c::traversal_category>::value, graph::detail::no_parameter>::type) [with Graph = R_adjacency_list; ComponentMap = int*; typename property_traits::value_type = int; typename enable_if_c::traversal_category>::value, graph::detail::no_parameter>::type = graph::detail::no_parameter; typename graph_traits::traversal_category = undir_adj_list_traversal_tag]’ interfaces.cpp:205:29: required from here /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:65:52: warning: ‘this’ pointer is null [-Wnonnull] 65 | static void failed() { ((Model*)0)->constraints(); } | ~~~~~~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/depth_first_search.hpp:39:10: note: in a call to non-static member function ‘void boost::DFSVisitorConcept::constraints() [with Visitor = boost::detail::components_recorder; Graph = R_adjacency_list]’ 39 | void constraints() | ^~~~~~~~~~~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements > > >, boost::no_property, boost::listS>, boost::is_residual_edge > > >, boost::edge_residual_capacity_t> >, boost::keep_all> > >]’: /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/graph_concepts.hpp:66:5: required from ‘struct boost::concepts::Graph > > >, boost::no_property, boost::listS>, boost::is_residual_edge > > >, boost::edge_residual_capacity_t> >, boost::keep_all> >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/graph_concepts.hpp:75:1: required from ‘struct boost::concepts::IncidenceGraph > > >, boost::no_property, boost::listS>, boost::is_residual_edge > > >, boost::edge_residual_capacity_t> >, boost::keep_all> >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/graph_concepts.hpp:75:1: required from ‘struct boost::concepts::IncidenceGraphConcept > > >, boost::no_property, boost::listS>, boost::is_residual_edge > > >, boost::edge_residual_capacity_t> >, boost::keep_all> >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::concepts::IncidenceGraphConcept > > >, boost::no_property, boost::listS>, boost::is_residual_edge > > >, boost::edge_residual_capacity_t> >, boost::keep_all> >]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied > > >, boost::no_property, boost::listS>, boost::is_residual_edge > > >, boost::edge_residual_capacity_t> >, boost::keep_all> > >::value’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:45:51: [ skipping 2 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/depth_first_search.hpp:129:9: required from ‘void boost::breadth_first_visit(const IncidenceGraph&, SourceIterator, SourceIterator, Buffer&, BFSVisitor, ColorMap) [with IncidenceGraph = filtered_graph > > >, no_property, listS>, is_residual_edge > > >, edge_residual_capacity_t> >, keep_all>; Buffer = queue > >; BFSVisitor = bfs_visitor*, on_tree_edge> >; ColorMap = default_color_type*; SourceIterator = long unsigned int*]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/breadth_first_search.hpp:136:24: required from ‘void boost::breadth_first_search(const VertexListGraph&, SourceIterator, SourceIterator, Buffer&, BFSVisitor, ColorMap) [with VertexListGraph = filtered_graph > > >, no_property, listS>, is_residual_edge > > >, edge_residual_capacity_t> >, keep_all>; SourceIterator = long unsigned int*; Buffer = queue > >; BFSVisitor = bfs_visitor*, on_tree_edge> >; ColorMap = default_color_type*]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/breadth_first_search.hpp:147:25: required from ‘void boost::breadth_first_search(const VertexListGraph&, typename graph_traits::vertex_descriptor, Buffer&, BFSVisitor, ColorMap) [with VertexListGraph = filtered_graph > > >, no_property, listS>, is_residual_edge > > >, edge_residual_capacity_t> >, keep_all>; Buffer = queue > >; BFSVisitor = bfs_visitor*, on_tree_edge> >; ColorMap = default_color_type*; typename graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/edmonds_karp_max_flow.hpp:101:29: required from ‘typename boost::property_traits::value_type boost::edmonds_karp_max_flow(Graph&, typename graph_traits::vertex_descriptor, typename graph_traits::vertex_descriptor, CapacityEdgeMap, ResidualCapacityEdgeMap, ReverseEdgeMap, ColorMap, PredEdgeMap) [with Graph = adjacency_list > > >, no_property, listS>; CapacityEdgeMap = adj_list_edge_property_map > > >, edge_capacity_t>; ResidualCapacityEdgeMap = adj_list_edge_property_map > > >, edge_residual_capacity_t>; ReverseEdgeMap = adj_list_edge_property_map, detail::edge_desc_impl&, long unsigned int, property > > >, edge_reverse_t>; ColorMap = default_color_type*; PredEdgeMap = detail::edge_desc_impl*; typename property_traits::value_type = long unsigned int; typename graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/edge_connectivity.hpp:145:42: required from ‘typename boost::graph_traits::degree_size_type boost::edge_connectivity(VertexListGraph&, OutputIterator) [with VertexListGraph = R_adjacency_list; OutputIterator = std::back_insert_iterator > >; typename graph_traits::degree_size_type = long unsigned int]’ interfaces.cpp:326:34: required from here /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::concepts::Graph > > >, boost::no_property, boost::listS>, boost::is_residual_edge > > >, boost::edge_residual_capacity_t> >, boost::keep_all> >]’ 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ^ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements > > >, boost::no_property, boost::listS>, boost::is_residual_edge > > >, boost::edge_residual_capacity_t> >, boost::keep_all> > >]’: /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/graph_concepts.hpp:87:5: required from ‘struct boost::concepts::IncidenceGraph > > >, boost::no_property, boost::listS>, boost::is_residual_edge > > >, boost::edge_residual_capacity_t> >, boost::keep_all> >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/graph_concepts.hpp:75:1: required from ‘struct boost::concepts::IncidenceGraphConcept > > >, boost::no_property, boost::listS>, boost::is_residual_edge > > >, boost::edge_residual_capacity_t> >, boost::keep_all> >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::concepts::IncidenceGraphConcept > > >, boost::no_property, boost::listS>, boost::is_residual_edge > > >, boost::edge_residual_capacity_t> >, boost::keep_all> >]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied > > >, boost::no_property, boost::listS>, boost::is_residual_edge > > >, boost::edge_residual_capacity_t> >, boost::keep_all> > >::value’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:45:51: [ skipping 2 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/depth_first_search.hpp:129:9: required from ‘void boost::breadth_first_visit(const IncidenceGraph&, SourceIterator, SourceIterator, Buffer&, BFSVisitor, ColorMap) [with IncidenceGraph = filtered_graph > > >, no_property, listS>, is_residual_edge > > >, edge_residual_capacity_t> >, keep_all>; Buffer = queue > >; BFSVisitor = bfs_visitor*, on_tree_edge> >; ColorMap = default_color_type*; SourceIterator = long unsigned int*]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/breadth_first_search.hpp:136:24: required from ‘void boost::breadth_first_search(const VertexListGraph&, SourceIterator, SourceIterator, Buffer&, BFSVisitor, ColorMap) [with VertexListGraph = filtered_graph > > >, no_property, listS>, is_residual_edge > > >, edge_residual_capacity_t> >, keep_all>; SourceIterator = long unsigned int*; Buffer = queue > >; BFSVisitor = bfs_visitor*, on_tree_edge> >; ColorMap = default_color_type*]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/breadth_first_search.hpp:147:25: required from ‘void boost::breadth_first_search(const VertexListGraph&, typename graph_traits::vertex_descriptor, Buffer&, BFSVisitor, ColorMap) [with VertexListGraph = filtered_graph > > >, no_property, listS>, is_residual_edge > > >, edge_residual_capacity_t> >, keep_all>; Buffer = queue > >; BFSVisitor = bfs_visitor*, on_tree_edge> >; ColorMap = default_color_type*; typename graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/edmonds_karp_max_flow.hpp:101:29: required from ‘typename boost::property_traits::value_type boost::edmonds_karp_max_flow(Graph&, typename graph_traits::vertex_descriptor, typename graph_traits::vertex_descriptor, CapacityEdgeMap, ResidualCapacityEdgeMap, ReverseEdgeMap, ColorMap, PredEdgeMap) [with Graph = adjacency_list > > >, no_property, listS>; CapacityEdgeMap = adj_list_edge_property_map > > >, edge_capacity_t>; ResidualCapacityEdgeMap = adj_list_edge_property_map > > >, edge_residual_capacity_t>; ReverseEdgeMap = adj_list_edge_property_map, detail::edge_desc_impl&, long unsigned int, property > > >, edge_reverse_t>; ColorMap = default_color_type*; PredEdgeMap = detail::edge_desc_impl*; typename property_traits::value_type = long unsigned int; typename graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/edge_connectivity.hpp:145:42: required from ‘typename boost::graph_traits::degree_size_type boost::edge_connectivity(VertexListGraph&, OutputIterator) [with VertexListGraph = R_adjacency_list; OutputIterator = std::back_insert_iterator > >; typename graph_traits::degree_size_type = long unsigned int]’ interfaces.cpp:326:34: required from here /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::concepts::IncidenceGraph > > >, boost::no_property, boost::listS>, boost::is_residual_edge > > >, boost::edge_residual_capacity_t> >, boost::keep_all> >]’ 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ^ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::IncidenceGraphConcept > > >, boost::no_property, boost::listS>, boost::is_residual_edge > > >, boost::edge_residual_capacity_t> >, boost::keep_all> >]’: /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/depth_first_search.hpp:129:9: required from ‘void boost::breadth_first_visit(const IncidenceGraph&, SourceIterator, SourceIterator, Buffer&, BFSVisitor, ColorMap) [with IncidenceGraph = filtered_graph > > >, no_property, listS>, is_residual_edge > > >, edge_residual_capacity_t> >, keep_all>; Buffer = queue > >; BFSVisitor = bfs_visitor*, on_tree_edge> >; ColorMap = default_color_type*; SourceIterator = long unsigned int*]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/breadth_first_search.hpp:136:24: required from ‘void boost::breadth_first_search(const VertexListGraph&, SourceIterator, SourceIterator, Buffer&, BFSVisitor, ColorMap) [with VertexListGraph = filtered_graph > > >, no_property, listS>, is_residual_edge > > >, edge_residual_capacity_t> >, keep_all>; SourceIterator = long unsigned int*; Buffer = queue > >; BFSVisitor = bfs_visitor*, on_tree_edge> >; ColorMap = default_color_type*]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/breadth_first_search.hpp:147:25: required from ‘void boost::breadth_first_search(const VertexListGraph&, typename graph_traits::vertex_descriptor, Buffer&, BFSVisitor, ColorMap) [with VertexListGraph = filtered_graph > > >, no_property, listS>, is_residual_edge > > >, edge_residual_capacity_t> >, keep_all>; Buffer = queue > >; BFSVisitor = bfs_visitor*, on_tree_edge> >; ColorMap = default_color_type*; typename graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/edmonds_karp_max_flow.hpp:101:29: required from ‘typename boost::property_traits::value_type boost::edmonds_karp_max_flow(Graph&, typename graph_traits::vertex_descriptor, typename graph_traits::vertex_descriptor, CapacityEdgeMap, ResidualCapacityEdgeMap, ReverseEdgeMap, ColorMap, PredEdgeMap) [with Graph = adjacency_list > > >, no_property, listS>; CapacityEdgeMap = adj_list_edge_property_map > > >, edge_capacity_t>; ResidualCapacityEdgeMap = adj_list_edge_property_map > > >, edge_residual_capacity_t>; ReverseEdgeMap = adj_list_edge_property_map, detail::edge_desc_impl&, long unsigned int, property > > >, edge_reverse_t>; ColorMap = default_color_type*; PredEdgeMap = detail::edge_desc_impl*; typename property_traits::value_type = long unsigned int; typename graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/edge_connectivity.hpp:145:42: required from ‘typename boost::graph_traits::degree_size_type boost::edge_connectivity(VertexListGraph&, OutputIterator) [with VertexListGraph = R_adjacency_list; OutputIterator = std::back_insert_iterator > >; typename graph_traits::degree_size_type = long unsigned int]’ interfaces.cpp:326:34: required from here /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/graph_concepts.hpp:75:15: note: in a call to non-static member function ‘boost::concepts::IncidenceGraphConcept > > >, boost::no_property, boost::listS>, boost::is_residual_edge > > >, boost::edge_residual_capacity_t> >, boost::keep_all> >::~IncidenceGraphConcept()’ 75 | BOOST_concept(IncidenceGraph, (G)) : Graph< G > | ^~~~~~~~~~~~~~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/preprocessor/cat.hpp:29:34: note: in definition of macro ‘BOOST_PP_CAT_I’ 29 | # define BOOST_PP_CAT_I(a, b) a ## b | ^ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/concept_def.hpp:23:12: note: in expansion of macro ‘BOOST_PP_CAT’ 23 | struct BOOST_PP_CAT(name,Concept) \ | ^~~~~~~~~~~~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/graph_concepts.hpp:75:1: note: in expansion of macro ‘BOOST_concept’ 75 | BOOST_concept(IncidenceGraph, (G)) : Graph< G > | ^~~~~~~~~~~~~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::constraint::failed() [with Model = boost::BFSVisitorConcept*, boost::on_tree_edge> >, boost::filtered_graph > > >, boost::no_property, boost::listS>, boost::is_residual_edge > > >, boost::edge_residual_capacity_t> >, boost::keep_all> >]’: /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/breadth_first_search.hpp:65:5: required from ‘void boost::breadth_first_visit(const IncidenceGraph&, SourceIterator, SourceIterator, Buffer&, BFSVisitor, ColorMap) [with IncidenceGraph = filtered_graph > > >, no_property, listS>, is_residual_edge > > >, edge_residual_capacity_t> >, keep_all>; Buffer = queue > >; BFSVisitor = bfs_visitor*, on_tree_edge> >; ColorMap = default_color_type*; SourceIterator = long unsigned int*]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/breadth_first_search.hpp:136:24: required from ‘void boost::breadth_first_search(const VertexListGraph&, SourceIterator, SourceIterator, Buffer&, BFSVisitor, ColorMap) [with VertexListGraph = filtered_graph > > >, no_property, listS>, is_residual_edge > > >, edge_residual_capacity_t> >, keep_all>; SourceIterator = long unsigned int*; Buffer = queue > >; BFSVisitor = bfs_visitor*, on_tree_edge> >; ColorMap = default_color_type*]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/breadth_first_search.hpp:147:25: required from ‘void boost::breadth_first_search(const VertexListGraph&, typename graph_traits::vertex_descriptor, Buffer&, BFSVisitor, ColorMap) [with VertexListGraph = filtered_graph > > >, no_property, listS>, is_residual_edge > > >, edge_residual_capacity_t> >, keep_all>; Buffer = queue > >; BFSVisitor = bfs_visitor*, on_tree_edge> >; ColorMap = default_color_type*; typename graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/edmonds_karp_max_flow.hpp:101:29: required from ‘typename boost::property_traits::value_type boost::edmonds_karp_max_flow(Graph&, typename graph_traits::vertex_descriptor, typename graph_traits::vertex_descriptor, CapacityEdgeMap, ResidualCapacityEdgeMap, ReverseEdgeMap, ColorMap, PredEdgeMap) [with Graph = adjacency_list > > >, no_property, listS>; CapacityEdgeMap = adj_list_edge_property_map > > >, edge_capacity_t>; ResidualCapacityEdgeMap = adj_list_edge_property_map > > >, edge_residual_capacity_t>; ReverseEdgeMap = adj_list_edge_property_map, detail::edge_desc_impl&, long unsigned int, property > > >, edge_reverse_t>; ColorMap = default_color_type*; PredEdgeMap = detail::edge_desc_impl*; typename property_traits::value_type = long unsigned int; typename graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/edge_connectivity.hpp:145:42: required from ‘typename boost::graph_traits::degree_size_type boost::edge_connectivity(VertexListGraph&, OutputIterator) [with VertexListGraph = R_adjacency_list; OutputIterator = std::back_insert_iterator > >; typename graph_traits::degree_size_type = long unsigned int]’ interfaces.cpp:326:34: required from here /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:65:52: warning: ‘this’ pointer is null [-Wnonnull] 65 | static void failed() { ((Model*)0)->constraints(); } | ~~~~~~~~~~~~~~~~~~~~~~~~^~ In file included from interfaces.cpp:4: /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/breadth_first_search.hpp:37:10: note: in a call to non-static member function ‘void boost::BFSVisitorConcept::constraints() [with Visitor = boost::bfs_visitor*, boost::on_tree_edge> >; Graph = boost::filtered_graph > > >, boost::no_property, boost::listS>, boost::is_residual_edge > > >, boost::edge_residual_capacity_t> >, boost::keep_all>]’ 37 | void constraints() | ^~~~~~~~~~~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::constraint::failed() [with Model = boost::ReadWritePropertyMapConcept]’: /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/breadth_first_search.hpp:66:5: required from ‘void boost::breadth_first_visit(const IncidenceGraph&, SourceIterator, SourceIterator, Buffer&, BFSVisitor, ColorMap) [with IncidenceGraph = filtered_graph > > >, no_property, listS>, is_residual_edge > > >, edge_residual_capacity_t> >, keep_all>; Buffer = queue > >; BFSVisitor = bfs_visitor*, on_tree_edge> >; ColorMap = default_color_type*; SourceIterator = long unsigned int*]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/breadth_first_search.hpp:136:24: required from ‘void boost::breadth_first_search(const VertexListGraph&, SourceIterator, SourceIterator, Buffer&, BFSVisitor, ColorMap) [with VertexListGraph = filtered_graph > > >, no_property, listS>, is_residual_edge > > >, edge_residual_capacity_t> >, keep_all>; SourceIterator = long unsigned int*; Buffer = queue > >; BFSVisitor = bfs_visitor*, on_tree_edge> >; ColorMap = default_color_type*]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/breadth_first_search.hpp:147:25: required from ‘void boost::breadth_first_search(const VertexListGraph&, typename graph_traits::vertex_descriptor, Buffer&, BFSVisitor, ColorMap) [with VertexListGraph = filtered_graph > > >, no_property, listS>, is_residual_edge > > >, edge_residual_capacity_t> >, keep_all>; Buffer = queue > >; BFSVisitor = bfs_visitor*, on_tree_edge> >; ColorMap = default_color_type*; typename graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/edmonds_karp_max_flow.hpp:101:29: required from ‘typename boost::property_traits::value_type boost::edmonds_karp_max_flow(Graph&, typename graph_traits::vertex_descriptor, typename graph_traits::vertex_descriptor, CapacityEdgeMap, ResidualCapacityEdgeMap, ReverseEdgeMap, ColorMap, PredEdgeMap) [with Graph = adjacency_list > > >, no_property, listS>; CapacityEdgeMap = adj_list_edge_property_map > > >, edge_capacity_t>; ResidualCapacityEdgeMap = adj_list_edge_property_map > > >, edge_residual_capacity_t>; ReverseEdgeMap = adj_list_edge_property_map, detail::edge_desc_impl&, long unsigned int, property > > >, edge_reverse_t>; ColorMap = default_color_type*; PredEdgeMap = detail::edge_desc_impl*; typename property_traits::value_type = long unsigned int; typename graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/edge_connectivity.hpp:145:42: required from ‘typename boost::graph_traits::degree_size_type boost::edge_connectivity(VertexListGraph&, OutputIterator) [with VertexListGraph = R_adjacency_list; OutputIterator = std::back_insert_iterator > >; typename graph_traits::degree_size_type = long unsigned int]’ interfaces.cpp:326:34: required from here /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:65:52: warning: ‘this’ pointer is null [-Wnonnull] 65 | static void failed() { ((Model*)0)->constraints(); } | ~~~~~~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/property_map/property_map.hpp:205:10: note: in a call to non-static member function ‘void boost::ReadWritePropertyMapConcept::constraints() [with PMap = boost::default_color_type*; Key = long unsigned int]’ 205 | void constraints() { | ^~~~~~~~~~~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::SignedInteger]’: /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:514:9: required from ‘boost::InputIterator::~InputIterator() [with TT = __gnu_cxx::__normal_iterator >]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/usage.hpp:20:48: required from ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::InputIterator<__gnu_cxx::__normal_iterator > >]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements > > >]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:512:7: required from ‘struct boost::InputIterator<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:540:3: required from ‘struct boost::ForwardIterator<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:568:3: [ skipping 4 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied > > >::value’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied > > >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_ > >)>’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/property_map/property_map.hpp:354:5: required from ‘boost::iterator_property_map boost::make_iterator_property_map(RAIter, ID, Value) [with RAIter = __gnu_cxx::__normal_iterator >; Value = long unsigned int; ID = typed_identity_property_map]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/sequential_vertex_coloring.hpp:120:35: required from ‘typename boost::property_traits::value_type boost::sequential_vertex_coloring(const VertexListGraph&, ColorMap) [with VertexListGraph = R_adjacency_list; ColorMap = iterator_property_map, long unsigned int> >; typename property_traits::value_type = long unsigned int]’ interfaces.cpp:370:56: required from here /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:107:22: note: in a call to non-static member function ‘boost::SignedInteger::~SignedInteger()’ 107 | template <> struct SignedInteger {}; | ^~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements >]’: /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:208:5: required from ‘struct boost::Convertible’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::Convertible]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied >::value’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_)>’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:515:9: [ skipping 9 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied > > >::value’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied > > >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_ > >)>’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/property_map/property_map.hpp:354:5: required from ‘boost::iterator_property_map boost::make_iterator_property_map(RAIter, ID, Value) [with RAIter = __gnu_cxx::__normal_iterator >; Value = long unsigned int; ID = typed_identity_property_map]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/sequential_vertex_coloring.hpp:120:35: required from ‘typename boost::property_traits::value_type boost::sequential_vertex_coloring(const VertexListGraph&, ColorMap) [with VertexListGraph = R_adjacency_list; ColorMap = iterator_property_map, long unsigned int> >; typename property_traits::value_type = long unsigned int]’ interfaces.cpp:370:56: required from here /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::Convertible]’ 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ^ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::Convertible]’: /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:515:9: required from ‘boost::InputIterator::~InputIterator() [with TT = __gnu_cxx::__normal_iterator >]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/usage.hpp:20:48: required from ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::InputIterator<__gnu_cxx::__normal_iterator > >]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements > > >]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:512:7: required from ‘struct boost::InputIterator<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:540:3: required from ‘struct boost::ForwardIterator<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:568:3: [ skipping 4 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied > > >::value’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied > > >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_ > >)>’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/property_map/property_map.hpp:354:5: required from ‘boost::iterator_property_map boost::make_iterator_property_map(RAIter, ID, Value) [with RAIter = __gnu_cxx::__normal_iterator >; Value = long unsigned int; ID = typed_identity_property_map]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/sequential_vertex_coloring.hpp:120:35: required from ‘typename boost::property_traits::value_type boost::sequential_vertex_coloring(const VertexListGraph&, ColorMap) [with VertexListGraph = R_adjacency_list; ColorMap = iterator_property_map, long unsigned int> >; typename property_traits::value_type = long unsigned int]’ interfaces.cpp:370:56: required from here /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::Convertible::~Convertible() [with X = std::random_access_iterator_tag; Y = std::input_iterator_tag]’ 37 | ~model() | ^ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:208:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 208 | BOOST_CONCEPT_USAGE(Convertible) { | ^~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements >]’: /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:208:5: required from ‘struct boost::Convertible’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::Convertible]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied >::value’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_)>’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:545:11: [ skipping 8 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied > > >::value’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied > > >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_ > >)>’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/property_map/property_map.hpp:354:5: required from ‘boost::iterator_property_map boost::make_iterator_property_map(RAIter, ID, Value) [with RAIter = __gnu_cxx::__normal_iterator >; Value = long unsigned int; ID = typed_identity_property_map]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/sequential_vertex_coloring.hpp:120:35: required from ‘typename boost::property_traits::value_type boost::sequential_vertex_coloring(const VertexListGraph&, ColorMap) [with VertexListGraph = R_adjacency_list; ColorMap = iterator_property_map, long unsigned int> >; typename property_traits::value_type = long unsigned int]’ interfaces.cpp:370:56: required from here /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::Convertible]’ 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ^ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::Convertible]’: /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:545:11: required from ‘boost::ForwardIterator::~ForwardIterator() [with TT = __gnu_cxx::__normal_iterator >]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/usage.hpp:20:48: required from ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::ForwardIterator<__gnu_cxx::__normal_iterator > >]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements > > >]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:543:7: required from ‘struct boost::ForwardIterator<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:568:3: required from ‘struct boost::BidirectionalIterator<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:597:3: [ skipping 3 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied > > >::value’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied > > >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_ > >)>’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/property_map/property_map.hpp:354:5: required from ‘boost::iterator_property_map boost::make_iterator_property_map(RAIter, ID, Value) [with RAIter = __gnu_cxx::__normal_iterator >; Value = long unsigned int; ID = typed_identity_property_map]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/sequential_vertex_coloring.hpp:120:35: required from ‘typename boost::property_traits::value_type boost::sequential_vertex_coloring(const VertexListGraph&, ColorMap) [with VertexListGraph = R_adjacency_list; ColorMap = iterator_property_map, long unsigned int> >; typename property_traits::value_type = long unsigned int]’ interfaces.cpp:370:56: required from here /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::Convertible::~Convertible() [with X = std::random_access_iterator_tag; Y = std::forward_iterator_tag]’ 37 | ~model() | ^ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:208:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 208 | BOOST_CONCEPT_USAGE(Convertible) { | ^~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements >]’: /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:208:5: required from ‘struct boost::Convertible’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::Convertible]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied >::value’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_)>’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:573:11: [ skipping 7 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied > > >::value’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied > > >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_ > >)>’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/property_map/property_map.hpp:354:5: required from ‘boost::iterator_property_map boost::make_iterator_property_map(RAIter, ID, Value) [with RAIter = __gnu_cxx::__normal_iterator >; Value = long unsigned int; ID = typed_identity_property_map]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/sequential_vertex_coloring.hpp:120:35: required from ‘typename boost::property_traits::value_type boost::sequential_vertex_coloring(const VertexListGraph&, ColorMap) [with VertexListGraph = R_adjacency_list; ColorMap = iterator_property_map, long unsigned int> >; typename property_traits::value_type = long unsigned int]’ interfaces.cpp:370:56: required from here /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::Convertible]’ 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ^ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::Convertible]’: /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:573:11: required from ‘boost::BidirectionalIterator::~BidirectionalIterator() [with TT = __gnu_cxx::__normal_iterator >]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/usage.hpp:20:48: required from ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::BidirectionalIterator<__gnu_cxx::__normal_iterator > >]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements > > >]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:571:7: required from ‘struct boost::BidirectionalIterator<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:597:3: required from ‘struct boost::RandomAccessIterator<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:597:3: [ skipping 2 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied > > >::value’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied > > >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_ > >)>’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/property_map/property_map.hpp:354:5: required from ‘boost::iterator_property_map boost::make_iterator_property_map(RAIter, ID, Value) [with RAIter = __gnu_cxx::__normal_iterator >; Value = long unsigned int; ID = typed_identity_property_map]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/sequential_vertex_coloring.hpp:120:35: required from ‘typename boost::property_traits::value_type boost::sequential_vertex_coloring(const VertexListGraph&, ColorMap) [with VertexListGraph = R_adjacency_list; ColorMap = iterator_property_map, long unsigned int> >; typename property_traits::value_type = long unsigned int]’ interfaces.cpp:370:56: required from here /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::Convertible::~Convertible() [with X = std::random_access_iterator_tag; Y = std::bidirectional_iterator_tag]’ 37 | ~model() | ^ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:208:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 208 | BOOST_CONCEPT_USAGE(Convertible) { | ^~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::Convertible]’: /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements >]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:208:5: required from ‘struct boost::Convertible’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::Convertible]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied >::value’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_)>’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:603:11: required from ‘boost::RandomAccessIterator::~RandomAccessIterator() [with TT = __gnu_cxx::__normal_iterator >]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:597:3: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator > >]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/property_map/property_map.hpp:354:5: required from ‘boost::iterator_property_map boost::make_iterator_property_map(RAIter, ID, Value) [with RAIter = __gnu_cxx::__normal_iterator >; Value = long unsigned int; ID = typed_identity_property_map]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/sequential_vertex_coloring.hpp:120:35: required from ‘typename boost::property_traits::value_type boost::sequential_vertex_coloring(const VertexListGraph&, ColorMap) [with VertexListGraph = R_adjacency_list; ColorMap = iterator_property_map, long unsigned int> >; typename property_traits::value_type = long unsigned int]’ interfaces.cpp:370:56: required from here /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::Convertible::~Convertible() [with X = std::random_access_iterator_tag; Y = std::random_access_iterator_tag]’ 37 | ~model() | ^ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:208:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 208 | BOOST_CONCEPT_USAGE(Convertible) { | ^~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::constraint::failed() [with Model = boost::DFSVisitorConcept > >, R_adjacency_list >]’: /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/depth_first_search.hpp:130:9: required from ‘void boost::depth_first_search(const VertexListGraph&, DFSVisitor, ColorMap, typename graph_traits::vertex_descriptor) [with VertexListGraph = R_adjacency_list; DFSVisitor = topo_sort_visitor > >; ColorMap = shared_array_property_map, long unsigned int> >; typename graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/depth_first_search.hpp:397:42: required from ‘void boost::graph::detail::depth_first_search_impl::operator()(const Graph&, const ArgPack&) const [with ArgPack = boost::parameter::aux::arg_list > > >, boost::parameter::aux::arg_list, boost::parameter::aux::empty_arg_list, std::integral_constant >, std::integral_constant >; Graph = R_adjacency_list]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/depth_first_search.hpp:406:5: required from ‘typename boost::result_of(Param0, const ArgPack&)>::type boost::graph::depth_first_search_with_named_params(const Param0&, const ArgPack&) [with Param0 = R_adjacency_list; ArgPack = boost::parameter::aux::arg_list > > >, boost::parameter::aux::arg_list, boost::parameter::aux::empty_arg_list, std::integral_constant >, std::integral_constant >; typename boost::result_of(Param0, const ArgPack&)>::type = void]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/depth_first_search.hpp:409:1: required from ‘typename boost::result_of(Param0, const typename boost::detail::convert_bgl_params_to_boost_parameter >::type&)>::type boost::depth_first_search(const Param0&, const bgl_named_params&) [with Param0 = R_adjacency_list; P = topo_sort_visitor > >; T = graph_visitor_t; R = bgl_named_params; typename result_of(Param0, const typename detail::convert_bgl_params_to_boost_parameter >::type&)>::type = void; typename detail::convert_bgl_params_to_boost_parameter >::type = parameter::aux::arg_list > > >, parameter::aux::arg_list, parameter::aux::empty_arg_list, std::integral_constant >, std::integral_constant >]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/topological_sort.hpp:69:23: required from ‘void boost::topological_sort(VertexListGraph&, OutputIterator, const bgl_named_params&) [with VertexListGraph = R_adjacency_list; OutputIterator = std::front_insert_iterator >; P = int; T = buffer_param_t; R = no_property]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/topological_sort.hpp:75:21: required from ‘void boost::topological_sort(VertexListGraph&, OutputIterator) [with VertexListGraph = R_adjacency_list; OutputIterator = std::front_insert_iterator >]’ interfaces.cpp:71:29: required from here /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:65:52: warning: ‘this’ pointer is null [-Wnonnull] 65 | static void failed() { ((Model*)0)->constraints(); } | ~~~~~~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/depth_first_search.hpp:39:10: note: in a call to non-static member function ‘void boost::DFSVisitorConcept::constraints() [with Visitor = boost::topo_sort_visitor > >; Graph = R_adjacency_list]’ 39 | void constraints() | ^~~~~~~~~~~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::constraint::failed() [with Model = boost::BFSVisitorConcept, R_adjacency_list >]’: /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/breadth_first_search.hpp:65:5: required from ‘void boost::breadth_first_visit(const IncidenceGraph&, SourceIterator, SourceIterator, Buffer&, BFSVisitor, ColorMap) [with IncidenceGraph = R_adjacency_list; Buffer = queue > >; BFSVisitor = bfs_time_visitor; ColorMap = two_bit_color_map, long unsigned int> >; SourceIterator = long unsigned int*]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/breadth_first_search.hpp:136:24: required from ‘void boost::breadth_first_search(const VertexListGraph&, SourceIterator, SourceIterator, Buffer&, BFSVisitor, ColorMap) [with VertexListGraph = R_adjacency_list; SourceIterator = long unsigned int*; Buffer = queue > >; BFSVisitor = bfs_time_visitor; ColorMap = two_bit_color_map, long unsigned int> >]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/breadth_first_search.hpp:147:25: required from ‘void boost::breadth_first_search(const VertexListGraph&, typename graph_traits::vertex_descriptor, Buffer&, BFSVisitor, ColorMap) [with VertexListGraph = R_adjacency_list; Buffer = queue > >; BFSVisitor = bfs_time_visitor; ColorMap = two_bit_color_map, long unsigned int> >; typename graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/breadth_first_search.hpp:262:29: required from ‘void boost::detail::bfs_helper(VertexListGraph&, typename boost::graph_traits::vertex_descriptor, ColorMap, BFSVisitor, const boost::bgl_named_params&, mpl_::false_) [with VertexListGraph = R_adjacency_list; ColorMap = boost::two_bit_color_map, long unsigned int> >; BFSVisitor = bfs_time_visitor; P = bfs_time_visitor; T = boost::graph_visitor_t; R = boost::no_property; typename boost::graph_traits::vertex_descriptor = long unsigned int; mpl_::false_ = mpl_::bool_]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/breadth_first_search.hpp:309:23: required from ‘static void boost::detail::bfs_dispatch::apply(VertexListGraph&, typename boost::graph_traits::vertex_descriptor, const boost::bgl_named_params&, boost::param_not_found) [with VertexListGraph = R_adjacency_list; P = bfs_time_visitor; T = boost::graph_visitor_t; R = boost::no_property; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/breadth_first_search.hpp:339:37: required from ‘void boost::breadth_first_search(const VertexListGraph&, typename graph_traits::vertex_descriptor, const bgl_named_params&) [with VertexListGraph = R_adjacency_list; P = bfs_time_visitor; T = graph_visitor_t; R = no_property; typename graph_traits::vertex_descriptor = long unsigned int]’ interfaces.cpp:113:29: required from here /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:65:52: warning: ‘this’ pointer is null [-Wnonnull] 65 | static void failed() { ((Model*)0)->constraints(); } | ~~~~~~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/breadth_first_search.hpp:37:10: note: in a call to non-static member function ‘void boost::BFSVisitorConcept::constraints() [with Visitor = bfs_time_visitor; Graph = R_adjacency_list]’ 37 | void constraints() | ^~~~~~~~~~~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::constraint::failed() [with Model = boost::ReadWritePropertyMapConcept, long unsigned int> >, long unsigned int>]’: /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/breadth_first_search.hpp:66:5: required from ‘void boost::breadth_first_visit(const IncidenceGraph&, SourceIterator, SourceIterator, Buffer&, BFSVisitor, ColorMap) [with IncidenceGraph = R_adjacency_list; Buffer = queue > >; BFSVisitor = bfs_time_visitor; ColorMap = two_bit_color_map, long unsigned int> >; SourceIterator = long unsigned int*]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/breadth_first_search.hpp:136:24: required from ‘void boost::breadth_first_search(const VertexListGraph&, SourceIterator, SourceIterator, Buffer&, BFSVisitor, ColorMap) [with VertexListGraph = R_adjacency_list; SourceIterator = long unsigned int*; Buffer = queue > >; BFSVisitor = bfs_time_visitor; ColorMap = two_bit_color_map, long unsigned int> >]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/breadth_first_search.hpp:147:25: required from ‘void boost::breadth_first_search(const VertexListGraph&, typename graph_traits::vertex_descriptor, Buffer&, BFSVisitor, ColorMap) [with VertexListGraph = R_adjacency_list; Buffer = queue > >; BFSVisitor = bfs_time_visitor; ColorMap = two_bit_color_map, long unsigned int> >; typename graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/breadth_first_search.hpp:262:29: required from ‘void boost::detail::bfs_helper(VertexListGraph&, typename boost::graph_traits::vertex_descriptor, ColorMap, BFSVisitor, const boost::bgl_named_params&, mpl_::false_) [with VertexListGraph = R_adjacency_list; ColorMap = boost::two_bit_color_map, long unsigned int> >; BFSVisitor = bfs_time_visitor; P = bfs_time_visitor; T = boost::graph_visitor_t; R = boost::no_property; typename boost::graph_traits::vertex_descriptor = long unsigned int; mpl_::false_ = mpl_::bool_]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/breadth_first_search.hpp:309:23: required from ‘static void boost::detail::bfs_dispatch::apply(VertexListGraph&, typename boost::graph_traits::vertex_descriptor, const boost::bgl_named_params&, boost::param_not_found) [with VertexListGraph = R_adjacency_list; P = bfs_time_visitor; T = boost::graph_visitor_t; R = boost::no_property; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/breadth_first_search.hpp:339:37: required from ‘void boost::breadth_first_search(const VertexListGraph&, typename graph_traits::vertex_descriptor, const bgl_named_params&) [with VertexListGraph = R_adjacency_list; P = bfs_time_visitor; T = graph_visitor_t; R = no_property; typename graph_traits::vertex_descriptor = long unsigned int]’ interfaces.cpp:113:29: required from here /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:65:52: warning: ‘this’ pointer is null [-Wnonnull] 65 | static void failed() { ((Model*)0)->constraints(); } | ~~~~~~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/property_map/property_map.hpp:205:10: note: in a call to non-static member function ‘void boost::ReadWritePropertyMapConcept::constraints() [with PMap = boost::two_bit_color_map, long unsigned int> >; Key = long unsigned int]’ 205 | void constraints() { | ^~~~~~~~~~~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::CopyConstructible >]’: /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements > >]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:167:5: required from ‘struct boost::CopyConstructible >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:165:3: required from ‘struct boost::CopyConstructibleConcept >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::CopyConstructibleConcept >]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied > >::value’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:45:51: [ skipping 6 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_, R_adjacency_list >)>’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/depth_first_search.hpp:130:9: required from ‘void boost::depth_first_search(const VertexListGraph&, DFSVisitor, ColorMap, typename graph_traits::vertex_descriptor) [with VertexListGraph = R_adjacency_list; DFSVisitor = dfs_time_visitor; ColorMap = shared_array_property_map, long unsigned int> >; typename graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/depth_first_search.hpp:397:42: required from ‘void boost::graph::detail::depth_first_search_impl::operator()(const Graph&, const ArgPack&) const [with ArgPack = boost::parameter::aux::arg_list >, boost::parameter::aux::empty_arg_list, std::integral_constant >; Graph = R_adjacency_list]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/depth_first_search.hpp:406:5: required from ‘typename boost::result_of(Param0, const ArgPack&)>::type boost::graph::depth_first_search_with_named_params(const Param0&, const ArgPack&) [with Param0 = R_adjacency_list; ArgPack = boost::parameter::aux::arg_list >, boost::parameter::aux::empty_arg_list, std::integral_constant >; typename boost::result_of(Param0, const ArgPack&)>::type = void]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/depth_first_search.hpp:409:1: required from ‘typename boost::result_of(Param0, const typename boost::detail::convert_bgl_params_to_boost_parameter >::type&)>::type boost::depth_first_search(const Param0&, const bgl_named_params&) [with Param0 = R_adjacency_list; P = dfs_time_visitor; T = graph_visitor_t; R = no_property; typename result_of(Param0, const typename detail::convert_bgl_params_to_boost_parameter >::type&)>::type = void; typename detail::convert_bgl_params_to_boost_parameter >::type = parameter::aux::arg_list >, parameter::aux::empty_arg_list, std::integral_constant >]’ interfaces.cpp:158:27: required from here /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::CopyConstructible::~CopyConstructible() [with TT = dfs_time_visitor]’ 37 | ~model() | ^ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:167:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 167 | BOOST_CONCEPT_USAGE(CopyConstructible) { | ^~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::concepts::Graph >]’: /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements > >]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/graph_concepts.hpp:66:5: required from ‘struct boost::concepts::Graph >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/graph_concepts.hpp:75:1: required from ‘struct boost::concepts::IncidenceGraph >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/graph_concepts.hpp:75:1: required from ‘struct boost::concepts::IncidenceGraphConcept >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::concepts::IncidenceGraphConcept >]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:42:5: [ skipping 3 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/depth_first_search.hpp:129:9: required from ‘void boost::detail::depth_first_visit_impl(const IncidenceGraph&, typename boost::graph_traits::vertex_descriptor, DFSVisitor&, ColorMap, TerminatorFunc) [with IncidenceGraph = R_adjacency_list; DFSVisitor = dfs_time_visitor; ColorMap = boost::shared_array_property_map, long unsigned int> >; TerminatorFunc = nontruth2; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/depth_first_search.hpp:286:39: required from ‘void boost::depth_first_search(const VertexListGraph&, DFSVisitor, ColorMap, typename graph_traits::vertex_descriptor) [with VertexListGraph = R_adjacency_list; DFSVisitor = dfs_time_visitor; ColorMap = shared_array_property_map, long unsigned int> >; typename graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/depth_first_search.hpp:397:42: required from ‘void boost::graph::detail::depth_first_search_impl::operator()(const Graph&, const ArgPack&) const [with ArgPack = boost::parameter::aux::arg_list >, boost::parameter::aux::empty_arg_list, std::integral_constant >; Graph = R_adjacency_list]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/depth_first_search.hpp:406:5: required from ‘typename boost::result_of(Param0, const ArgPack&)>::type boost::graph::depth_first_search_with_named_params(const Param0&, const ArgPack&) [with Param0 = R_adjacency_list; ArgPack = boost::parameter::aux::arg_list >, boost::parameter::aux::empty_arg_list, std::integral_constant >; typename boost::result_of(Param0, const ArgPack&)>::type = void]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/depth_first_search.hpp:409:1: required from ‘typename boost::result_of(Param0, const typename boost::detail::convert_bgl_params_to_boost_parameter >::type&)>::type boost::depth_first_search(const Param0&, const bgl_named_params&) [with Param0 = R_adjacency_list; P = dfs_time_visitor; T = graph_visitor_t; R = no_property; typename result_of(Param0, const typename detail::convert_bgl_params_to_boost_parameter >::type&)>::type = void; typename detail::convert_bgl_params_to_boost_parameter >::type = parameter::aux::arg_list >, parameter::aux::empty_arg_list, std::integral_constant >]’ interfaces.cpp:158:27: required from here /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::concepts::Graph::~Graph() [with G = R_adjacency_list]’ 37 | ~model() | ^ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/graph_concepts.hpp:66:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 66 | BOOST_CONCEPT_USAGE(Graph) | ^~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::concepts::IncidenceGraph >]’: /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements > >]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/graph_concepts.hpp:87:5: required from ‘struct boost::concepts::IncidenceGraph >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/graph_concepts.hpp:75:1: required from ‘struct boost::concepts::IncidenceGraphConcept >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::concepts::IncidenceGraphConcept >]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied > >::value’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:45:51: [ skipping 2 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/depth_first_search.hpp:129:9: required from ‘void boost::detail::depth_first_visit_impl(const IncidenceGraph&, typename boost::graph_traits::vertex_descriptor, DFSVisitor&, ColorMap, TerminatorFunc) [with IncidenceGraph = R_adjacency_list; DFSVisitor = dfs_time_visitor; ColorMap = boost::shared_array_property_map, long unsigned int> >; TerminatorFunc = nontruth2; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/depth_first_search.hpp:286:39: required from ‘void boost::depth_first_search(const VertexListGraph&, DFSVisitor, ColorMap, typename graph_traits::vertex_descriptor) [with VertexListGraph = R_adjacency_list; DFSVisitor = dfs_time_visitor; ColorMap = shared_array_property_map, long unsigned int> >; typename graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/depth_first_search.hpp:397:42: required from ‘void boost::graph::detail::depth_first_search_impl::operator()(const Graph&, const ArgPack&) const [with ArgPack = boost::parameter::aux::arg_list >, boost::parameter::aux::empty_arg_list, std::integral_constant >; Graph = R_adjacency_list]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/depth_first_search.hpp:406:5: required from ‘typename boost::result_of(Param0, const ArgPack&)>::type boost::graph::depth_first_search_with_named_params(const Param0&, const ArgPack&) [with Param0 = R_adjacency_list; ArgPack = boost::parameter::aux::arg_list >, boost::parameter::aux::empty_arg_list, std::integral_constant >; typename boost::result_of(Param0, const ArgPack&)>::type = void]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/depth_first_search.hpp:409:1: required from ‘typename boost::result_of(Param0, const typename boost::detail::convert_bgl_params_to_boost_parameter >::type&)>::type boost::depth_first_search(const Param0&, const bgl_named_params&) [with Param0 = R_adjacency_list; P = dfs_time_visitor; T = graph_visitor_t; R = no_property; typename result_of(Param0, const typename detail::convert_bgl_params_to_boost_parameter >::type&)>::type = void; typename detail::convert_bgl_params_to_boost_parameter >::type = parameter::aux::arg_list >, parameter::aux::empty_arg_list, std::integral_constant >]’ interfaces.cpp:158:27: required from here /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::concepts::IncidenceGraph::~IncidenceGraph() [with G = R_adjacency_list]’ 37 | ~model() | ^ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/graph_concepts.hpp:87:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 87 | BOOST_CONCEPT_USAGE(IncidenceGraph) | ^~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::constraint::failed() [with Model = boost::ReadablePropertyMapConcept, long unsigned int> >, long unsigned int>]’: /home/omnipath/local/R/4.4-3.20/BH/include/boost/property_map/property_map.hpp:206:7: required from ‘void boost::ReadWritePropertyMapConcept::constraints() [with PMap = boost::shared_array_property_map, long unsigned int> >; Key = long unsigned int]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::ReadWritePropertyMapConcept, long unsigned int> >, long unsigned int>]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied, long unsigned int> >, long unsigned int> >::value’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied, long unsigned int> >, long unsigned int> >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_, long unsigned int> >, long unsigned int>)>’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/depth_first_search.hpp:134:9: required from ‘void boost::detail::depth_first_visit_impl(const IncidenceGraph&, typename boost::graph_traits::vertex_descriptor, DFSVisitor&, ColorMap, TerminatorFunc) [with IncidenceGraph = R_adjacency_list; DFSVisitor = dfs_time_visitor; ColorMap = boost::shared_array_property_map, long unsigned int> >; TerminatorFunc = nontruth2; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/depth_first_search.hpp:286:39: required from ‘void boost::depth_first_search(const VertexListGraph&, DFSVisitor, ColorMap, typename graph_traits::vertex_descriptor) [with VertexListGraph = R_adjacency_list; DFSVisitor = dfs_time_visitor; ColorMap = shared_array_property_map, long unsigned int> >; typename graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/depth_first_search.hpp:397:42: required from ‘void boost::graph::detail::depth_first_search_impl::operator()(const Graph&, const ArgPack&) const [with ArgPack = boost::parameter::aux::arg_list >, boost::parameter::aux::empty_arg_list, std::integral_constant >; Graph = R_adjacency_list]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/depth_first_search.hpp:406:5: required from ‘typename boost::result_of(Param0, const ArgPack&)>::type boost::graph::depth_first_search_with_named_params(const Param0&, const ArgPack&) [with Param0 = R_adjacency_list; ArgPack = boost::parameter::aux::arg_list >, boost::parameter::aux::empty_arg_list, std::integral_constant >; typename boost::result_of(Param0, const ArgPack&)>::type = void]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/depth_first_search.hpp:409:1: required from ‘typename boost::result_of(Param0, const typename boost::detail::convert_bgl_params_to_boost_parameter >::type&)>::type boost::depth_first_search(const Param0&, const bgl_named_params&) [with Param0 = R_adjacency_list; P = dfs_time_visitor; T = graph_visitor_t; R = no_property; typename result_of(Param0, const typename detail::convert_bgl_params_to_boost_parameter >::type&)>::type = void; typename detail::convert_bgl_params_to_boost_parameter >::type = parameter::aux::arg_list >, parameter::aux::empty_arg_list, std::integral_constant >]’ interfaces.cpp:158:27: required from here /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:65:52: warning: ‘this’ pointer is null [-Wnonnull] 65 | static void failed() { ((Model*)0)->constraints(); } | ~~~~~~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/property_map/property_map.hpp:147:10: note: in a call to non-static member function ‘void boost::ReadablePropertyMapConcept::constraints() [with PMap = boost::shared_array_property_map, long unsigned int> >; Key = long unsigned int]’ 147 | void constraints() { | ^~~~~~~~~~~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::constraint::failed() [with Model = boost::WritablePropertyMapConcept, long unsigned int> >, long unsigned int>]’: /home/omnipath/local/R/4.4-3.20/BH/include/boost/property_map/property_map.hpp:207:7: required from ‘void boost::ReadWritePropertyMapConcept::constraints() [with PMap = boost::shared_array_property_map, long unsigned int> >; Key = long unsigned int]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::ReadWritePropertyMapConcept, long unsigned int> >, long unsigned int>]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied, long unsigned int> >, long unsigned int> >::value’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied, long unsigned int> >, long unsigned int> >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_, long unsigned int> >, long unsigned int>)>’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/depth_first_search.hpp:134:9: required from ‘void boost::detail::depth_first_visit_impl(const IncidenceGraph&, typename boost::graph_traits::vertex_descriptor, DFSVisitor&, ColorMap, TerminatorFunc) [with IncidenceGraph = R_adjacency_list; DFSVisitor = dfs_time_visitor; ColorMap = boost::shared_array_property_map, long unsigned int> >; TerminatorFunc = nontruth2; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/depth_first_search.hpp:286:39: required from ‘void boost::depth_first_search(const VertexListGraph&, DFSVisitor, ColorMap, typename graph_traits::vertex_descriptor) [with VertexListGraph = R_adjacency_list; DFSVisitor = dfs_time_visitor; ColorMap = shared_array_property_map, long unsigned int> >; typename graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/depth_first_search.hpp:397:42: required from ‘void boost::graph::detail::depth_first_search_impl::operator()(const Graph&, const ArgPack&) const [with ArgPack = boost::parameter::aux::arg_list >, boost::parameter::aux::empty_arg_list, std::integral_constant >; Graph = R_adjacency_list]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/depth_first_search.hpp:406:5: required from ‘typename boost::result_of(Param0, const ArgPack&)>::type boost::graph::depth_first_search_with_named_params(const Param0&, const ArgPack&) [with Param0 = R_adjacency_list; ArgPack = boost::parameter::aux::arg_list >, boost::parameter::aux::empty_arg_list, std::integral_constant >; typename boost::result_of(Param0, const ArgPack&)>::type = void]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/depth_first_search.hpp:409:1: required from ‘typename boost::result_of(Param0, const typename boost::detail::convert_bgl_params_to_boost_parameter >::type&)>::type boost::depth_first_search(const Param0&, const bgl_named_params&) [with Param0 = R_adjacency_list; P = dfs_time_visitor; T = graph_visitor_t; R = no_property; typename result_of(Param0, const typename detail::convert_bgl_params_to_boost_parameter >::type&)>::type = void; typename detail::convert_bgl_params_to_boost_parameter >::type = parameter::aux::arg_list >, parameter::aux::empty_arg_list, std::integral_constant >]’ interfaces.cpp:158:27: required from here /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:65:52: warning: ‘this’ pointer is null [-Wnonnull] 65 | static void failed() { ((Model*)0)->constraints(); } | ~~~~~~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/property_map/property_map.hpp:179:10: note: in a call to non-static member function ‘void boost::WritablePropertyMapConcept::constraints() [with PMap = boost::shared_array_property_map, long unsigned int> >; Key = long unsigned int]’ 179 | void constraints() { | ^~~~~~~~~~~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements >]’: /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:208:5: required from ‘struct boost::Convertible’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:206:3: required from ‘struct boost::ConvertibleConcept’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::ConvertibleConcept]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied >::value’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:72:8: [ skipping 6 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/depth_first_search.hpp:134:9: required from ‘void boost::detail::depth_first_visit_impl(const IncidenceGraph&, typename boost::graph_traits::vertex_descriptor, DFSVisitor&, ColorMap, TerminatorFunc) [with IncidenceGraph = R_adjacency_list; DFSVisitor = dfs_time_visitor; ColorMap = boost::shared_array_property_map, long unsigned int> >; TerminatorFunc = nontruth2; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/depth_first_search.hpp:286:39: required from ‘void boost::depth_first_search(const VertexListGraph&, DFSVisitor, ColorMap, typename graph_traits::vertex_descriptor) [with VertexListGraph = R_adjacency_list; DFSVisitor = dfs_time_visitor; ColorMap = shared_array_property_map, long unsigned int> >; typename graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/depth_first_search.hpp:397:42: required from ‘void boost::graph::detail::depth_first_search_impl::operator()(const Graph&, const ArgPack&) const [with ArgPack = boost::parameter::aux::arg_list >, boost::parameter::aux::empty_arg_list, std::integral_constant >; Graph = R_adjacency_list]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/depth_first_search.hpp:406:5: required from ‘typename boost::result_of(Param0, const ArgPack&)>::type boost::graph::depth_first_search_with_named_params(const Param0&, const ArgPack&) [with Param0 = R_adjacency_list; ArgPack = boost::parameter::aux::arg_list >, boost::parameter::aux::empty_arg_list, std::integral_constant >; typename boost::result_of(Param0, const ArgPack&)>::type = void]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/depth_first_search.hpp:409:1: required from ‘typename boost::result_of(Param0, const typename boost::detail::convert_bgl_params_to_boost_parameter >::type&)>::type boost::depth_first_search(const Param0&, const bgl_named_params&) [with Param0 = R_adjacency_list; P = dfs_time_visitor; T = graph_visitor_t; R = no_property; typename result_of(Param0, const typename detail::convert_bgl_params_to_boost_parameter >::type&)>::type = void; typename detail::convert_bgl_params_to_boost_parameter >::type = parameter::aux::arg_list >, parameter::aux::empty_arg_list, std::integral_constant >]’ interfaces.cpp:158:27: required from here /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::Convertible]’ 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ^ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::ConvertibleConcept]’: /home/omnipath/local/R/4.4-3.20/BH/include/boost/property_map/property_map.hpp:208:7: required from ‘void boost::ReadWritePropertyMapConcept::constraints() [with PMap = boost::shared_array_property_map, long unsigned int> >; Key = long unsigned int]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::ReadWritePropertyMapConcept, long unsigned int> >, long unsigned int>]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied, long unsigned int> >, long unsigned int> >::value’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied, long unsigned int> >, long unsigned int> >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_, long unsigned int> >, long unsigned int>)>’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/depth_first_search.hpp:134:9: required from ‘void boost::detail::depth_first_visit_impl(const IncidenceGraph&, typename boost::graph_traits::vertex_descriptor, DFSVisitor&, ColorMap, TerminatorFunc) [with IncidenceGraph = R_adjacency_list; DFSVisitor = dfs_time_visitor; ColorMap = boost::shared_array_property_map, long unsigned int> >; TerminatorFunc = nontruth2; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/depth_first_search.hpp:286:39: required from ‘void boost::depth_first_search(const VertexListGraph&, DFSVisitor, ColorMap, typename graph_traits::vertex_descriptor) [with VertexListGraph = R_adjacency_list; DFSVisitor = dfs_time_visitor; ColorMap = shared_array_property_map, long unsigned int> >; typename graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/depth_first_search.hpp:397:42: required from ‘void boost::graph::detail::depth_first_search_impl::operator()(const Graph&, const ArgPack&) const [with ArgPack = boost::parameter::aux::arg_list >, boost::parameter::aux::empty_arg_list, std::integral_constant >; Graph = R_adjacency_list]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/depth_first_search.hpp:406:5: required from ‘typename boost::result_of(Param0, const ArgPack&)>::type boost::graph::depth_first_search_with_named_params(const Param0&, const ArgPack&) [with Param0 = R_adjacency_list; ArgPack = boost::parameter::aux::arg_list >, boost::parameter::aux::empty_arg_list, std::integral_constant >; typename boost::result_of(Param0, const ArgPack&)>::type = void]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/depth_first_search.hpp:409:1: required from ‘typename boost::result_of(Param0, const typename boost::detail::convert_bgl_params_to_boost_parameter >::type&)>::type boost::depth_first_search(const Param0&, const bgl_named_params&) [with Param0 = R_adjacency_list; P = dfs_time_visitor; T = graph_visitor_t; R = no_property; typename result_of(Param0, const typename detail::convert_bgl_params_to_boost_parameter >::type&)>::type = void; typename detail::convert_bgl_params_to_boost_parameter >::type = parameter::aux::arg_list >, parameter::aux::empty_arg_list, std::integral_constant >]’ interfaces.cpp:158:27: required from here /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:206:17: note: in a call to non-static member function ‘boost::ConvertibleConcept::~ConvertibleConcept()’ 206 | BOOST_concept(Convertible,(X)(Y)) | ^~~~~~~~~~~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/preprocessor/cat.hpp:29:34: note: in definition of macro ‘BOOST_PP_CAT_I’ 29 | # define BOOST_PP_CAT_I(a, b) a ## b | ^ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/concept_def.hpp:23:12: note: in expansion of macro ‘BOOST_PP_CAT’ 23 | struct BOOST_PP_CAT(name,Concept) \ | ^~~~~~~~~~~~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:206:3: note: in expansion of macro ‘BOOST_concept’ 206 | BOOST_concept(Convertible,(X)(Y)) | ^~~~~~~~~~~~~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::EqualityComparable]’: /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements >]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:233:5: required from ‘struct boost::EqualityComparable’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/graph_concepts.hpp:502:1: required from ‘struct boost::concepts::ColorValue’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/graph_concepts.hpp:502:1: required from ‘struct boost::concepts::ColorValueConcept’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::concepts::ColorValueConcept]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:42:5: [ skipping 3 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/depth_first_search.hpp:136:9: required from ‘void boost::detail::depth_first_visit_impl(const IncidenceGraph&, typename boost::graph_traits::vertex_descriptor, DFSVisitor&, ColorMap, TerminatorFunc) [with IncidenceGraph = R_adjacency_list; DFSVisitor = dfs_time_visitor; ColorMap = boost::shared_array_property_map, long unsigned int> >; TerminatorFunc = nontruth2; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/depth_first_search.hpp:286:39: required from ‘void boost::depth_first_search(const VertexListGraph&, DFSVisitor, ColorMap, typename graph_traits::vertex_descriptor) [with VertexListGraph = R_adjacency_list; DFSVisitor = dfs_time_visitor; ColorMap = shared_array_property_map, long unsigned int> >; typename graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/depth_first_search.hpp:397:42: required from ‘void boost::graph::detail::depth_first_search_impl::operator()(const Graph&, const ArgPack&) const [with ArgPack = boost::parameter::aux::arg_list >, boost::parameter::aux::empty_arg_list, std::integral_constant >; Graph = R_adjacency_list]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/depth_first_search.hpp:406:5: required from ‘typename boost::result_of(Param0, const ArgPack&)>::type boost::graph::depth_first_search_with_named_params(const Param0&, const ArgPack&) [with Param0 = R_adjacency_list; ArgPack = boost::parameter::aux::arg_list >, boost::parameter::aux::empty_arg_list, std::integral_constant >; typename boost::result_of(Param0, const ArgPack&)>::type = void]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/depth_first_search.hpp:409:1: required from ‘typename boost::result_of(Param0, const typename boost::detail::convert_bgl_params_to_boost_parameter >::type&)>::type boost::depth_first_search(const Param0&, const bgl_named_params&) [with Param0 = R_adjacency_list; P = dfs_time_visitor; T = graph_visitor_t; R = no_property; typename result_of(Param0, const typename detail::convert_bgl_params_to_boost_parameter >::type&)>::type = void; typename detail::convert_bgl_params_to_boost_parameter >::type = parameter::aux::arg_list >, parameter::aux::empty_arg_list, std::integral_constant >]’ interfaces.cpp:158:27: required from here /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::EqualityComparable::~EqualityComparable() [with TT = boost::default_color_type]’ 37 | ~model() | ^ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:233:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 233 | BOOST_CONCEPT_USAGE(EqualityComparable) { | ^~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::DefaultConstructible]’: /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements >]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:137:5: required from ‘struct boost::DefaultConstructible’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/graph_concepts.hpp:502:1: required from ‘struct boost::concepts::ColorValue’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/graph_concepts.hpp:502:1: required from ‘struct boost::concepts::ColorValueConcept’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::concepts::ColorValueConcept]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:42:5: [ skipping 3 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/depth_first_search.hpp:136:9: required from ‘void boost::detail::depth_first_visit_impl(const IncidenceGraph&, typename boost::graph_traits::vertex_descriptor, DFSVisitor&, ColorMap, TerminatorFunc) [with IncidenceGraph = R_adjacency_list; DFSVisitor = dfs_time_visitor; ColorMap = boost::shared_array_property_map, long unsigned int> >; TerminatorFunc = nontruth2; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/depth_first_search.hpp:286:39: required from ‘void boost::depth_first_search(const VertexListGraph&, DFSVisitor, ColorMap, typename graph_traits::vertex_descriptor) [with VertexListGraph = R_adjacency_list; DFSVisitor = dfs_time_visitor; ColorMap = shared_array_property_map, long unsigned int> >; typename graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/depth_first_search.hpp:397:42: required from ‘void boost::graph::detail::depth_first_search_impl::operator()(const Graph&, const ArgPack&) const [with ArgPack = boost::parameter::aux::arg_list >, boost::parameter::aux::empty_arg_list, std::integral_constant >; Graph = R_adjacency_list]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/depth_first_search.hpp:406:5: required from ‘typename boost::result_of(Param0, const ArgPack&)>::type boost::graph::depth_first_search_with_named_params(const Param0&, const ArgPack&) [with Param0 = R_adjacency_list; ArgPack = boost::parameter::aux::arg_list >, boost::parameter::aux::empty_arg_list, std::integral_constant >; typename boost::result_of(Param0, const ArgPack&)>::type = void]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/depth_first_search.hpp:409:1: required from ‘typename boost::result_of(Param0, const typename boost::detail::convert_bgl_params_to_boost_parameter >::type&)>::type boost::depth_first_search(const Param0&, const bgl_named_params&) [with Param0 = R_adjacency_list; P = dfs_time_visitor; T = graph_visitor_t; R = no_property; typename result_of(Param0, const typename detail::convert_bgl_params_to_boost_parameter >::type&)>::type = void; typename detail::convert_bgl_params_to_boost_parameter >::type = parameter::aux::arg_list >, parameter::aux::empty_arg_list, std::integral_constant >]’ interfaces.cpp:158:27: required from here /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::DefaultConstructible::~DefaultConstructible() [with TT = boost::default_color_type]’ 37 | ~model() | ^ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:137:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 137 | BOOST_CONCEPT_USAGE(DefaultConstructible) { | ^~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::concepts::ColorValue]’: /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements >]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/graph_concepts.hpp:505:5: required from ‘struct boost::concepts::ColorValue’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/graph_concepts.hpp:502:1: required from ‘struct boost::concepts::ColorValueConcept’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::concepts::ColorValueConcept]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied >::value’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:45:51: [ skipping 2 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/depth_first_search.hpp:136:9: required from ‘void boost::detail::depth_first_visit_impl(const IncidenceGraph&, typename boost::graph_traits::vertex_descriptor, DFSVisitor&, ColorMap, TerminatorFunc) [with IncidenceGraph = R_adjacency_list; DFSVisitor = dfs_time_visitor; ColorMap = boost::shared_array_property_map, long unsigned int> >; TerminatorFunc = nontruth2; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/depth_first_search.hpp:286:39: required from ‘void boost::depth_first_search(const VertexListGraph&, DFSVisitor, ColorMap, typename graph_traits::vertex_descriptor) [with VertexListGraph = R_adjacency_list; DFSVisitor = dfs_time_visitor; ColorMap = shared_array_property_map, long unsigned int> >; typename graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/depth_first_search.hpp:397:42: required from ‘void boost::graph::detail::depth_first_search_impl::operator()(const Graph&, const ArgPack&) const [with ArgPack = boost::parameter::aux::arg_list >, boost::parameter::aux::empty_arg_list, std::integral_constant >; Graph = R_adjacency_list]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/depth_first_search.hpp:406:5: required from ‘typename boost::result_of(Param0, const ArgPack&)>::type boost::graph::depth_first_search_with_named_params(const Param0&, const ArgPack&) [with Param0 = R_adjacency_list; ArgPack = boost::parameter::aux::arg_list >, boost::parameter::aux::empty_arg_list, std::integral_constant >; typename boost::result_of(Param0, const ArgPack&)>::type = void]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/depth_first_search.hpp:409:1: required from ‘typename boost::result_of(Param0, const typename boost::detail::convert_bgl_params_to_boost_parameter >::type&)>::type boost::depth_first_search(const Param0&, const bgl_named_params&) [with Param0 = R_adjacency_list; P = dfs_time_visitor; T = graph_visitor_t; R = no_property; typename result_of(Param0, const typename detail::convert_bgl_params_to_boost_parameter >::type&)>::type = void; typename detail::convert_bgl_params_to_boost_parameter >::type = parameter::aux::arg_list >, parameter::aux::empty_arg_list, std::integral_constant >]’ interfaces.cpp:158:27: required from here /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::concepts::ColorValue::~ColorValue() [with C = boost::default_color_type]’ 37 | ~model() | ^ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/graph_concepts.hpp:505:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 505 | BOOST_CONCEPT_USAGE(ColorValue) | ^~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements > >]’: /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:167:5: required from ‘struct boost::CopyConstructible >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:165:3: required from ‘struct boost::CopyConstructibleConcept >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::CopyConstructibleConcept >]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied > >::value’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied > >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:72:8: [ skipping 6 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/depth_first_search.hpp:130:9: required from ‘void boost::depth_first_search(const VertexListGraph&, DFSVisitor, ColorMap, typename graph_traits::vertex_descriptor) [with VertexListGraph = R_adjacency_list; DFSVisitor = detail::components_recorder; ColorMap = shared_array_property_map, long unsigned int> >; typename graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/depth_first_search.hpp:397:42: required from ‘void boost::graph::detail::depth_first_search_impl::operator()(const Graph&, const ArgPack&) const [with ArgPack = boost::parameter::aux::arg_list >, boost::parameter::aux::empty_arg_list, std::integral_constant >; Graph = R_adjacency_list]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/depth_first_search.hpp:406:5: required from ‘typename boost::result_of(Param0, const ArgPack&)>::type boost::graph::depth_first_search_with_named_params(const Param0&, const ArgPack&) [with Param0 = R_adjacency_list; ArgPack = boost::parameter::aux::arg_list >, boost::parameter::aux::empty_arg_list, std::integral_constant >; typename boost::result_of(Param0, const ArgPack&)>::type = void]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/depth_first_search.hpp:409:1: required from ‘typename boost::result_of(Param0, const typename boost::detail::convert_bgl_params_to_boost_parameter >::type&)>::type boost::depth_first_search(const Param0&, const bgl_named_params&) [with Param0 = R_adjacency_list; P = detail::components_recorder; T = graph_visitor_t; R = no_property; typename result_of(Param0, const typename detail::convert_bgl_params_to_boost_parameter >::type&)>::type = void; typename detail::convert_bgl_params_to_boost_parameter >::type = parameter::aux::arg_list >, parameter::aux::empty_arg_list, std::integral_constant >]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/connected_components.hpp:106:23: required from ‘typename boost::property_traits::value_type boost::connected_components(const Graph&, ComponentMap, typename enable_if_c::traversal_category>::value, graph::detail::no_parameter>::type) [with Graph = R_adjacency_list; ComponentMap = int*; typename property_traits::value_type = int; typename enable_if_c::traversal_category>::value, graph::detail::no_parameter>::type = graph::detail::no_parameter; typename graph_traits::traversal_category = undir_adj_list_traversal_tag]’ interfaces.cpp:205:29: required from here /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::CopyConstructible >]’ 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ^ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::CopyConstructibleConcept >]’: /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/depth_first_search.hpp:41:9: required from ‘void boost::DFSVisitorConcept::constraints() [with Visitor = boost::detail::components_recorder; Graph = R_adjacency_list]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::DFSVisitorConcept, R_adjacency_list >]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied, R_adjacency_list > >::value’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied, R_adjacency_list > >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_, R_adjacency_list >)>’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/depth_first_search.hpp:130:9: required from ‘void boost::depth_first_search(const VertexListGraph&, DFSVisitor, ColorMap, typename graph_traits::vertex_descriptor) [with VertexListGraph = R_adjacency_list; DFSVisitor = detail::components_recorder; ColorMap = shared_array_property_map, long unsigned int> >; typename graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/depth_first_search.hpp:397:42: required from ‘void boost::graph::detail::depth_first_search_impl::operator()(const Graph&, const ArgPack&) const [with ArgPack = boost::parameter::aux::arg_list >, boost::parameter::aux::empty_arg_list, std::integral_constant >; Graph = R_adjacency_list]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/depth_first_search.hpp:406:5: required from ‘typename boost::result_of(Param0, const ArgPack&)>::type boost::graph::depth_first_search_with_named_params(const Param0&, const ArgPack&) [with Param0 = R_adjacency_list; ArgPack = boost::parameter::aux::arg_list >, boost::parameter::aux::empty_arg_list, std::integral_constant >; typename boost::result_of(Param0, const ArgPack&)>::type = void]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/depth_first_search.hpp:409:1: required from ‘typename boost::result_of(Param0, const typename boost::detail::convert_bgl_params_to_boost_parameter >::type&)>::type boost::depth_first_search(const Param0&, const bgl_named_params&) [with Param0 = R_adjacency_list; P = detail::components_recorder; T = graph_visitor_t; R = no_property; typename result_of(Param0, const typename detail::convert_bgl_params_to_boost_parameter >::type&)>::type = void; typename detail::convert_bgl_params_to_boost_parameter >::type = parameter::aux::arg_list >, parameter::aux::empty_arg_list, std::integral_constant >]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/connected_components.hpp:106:23: required from ‘typename boost::property_traits::value_type boost::connected_components(const Graph&, ComponentMap, typename enable_if_c::traversal_category>::value, graph::detail::no_parameter>::type) [with Graph = R_adjacency_list; ComponentMap = int*; typename property_traits::value_type = int; typename enable_if_c::traversal_category>::value, graph::detail::no_parameter>::type = graph::detail::no_parameter; typename graph_traits::traversal_category = undir_adj_list_traversal_tag]’ interfaces.cpp:205:29: required from here /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:165:17: note: in a call to non-static member function ‘boost::CopyConstructibleConcept >::~CopyConstructibleConcept()’ 165 | BOOST_concept(CopyConstructible,(TT)) | ^~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/preprocessor/cat.hpp:29:34: note: in definition of macro ‘BOOST_PP_CAT_I’ 29 | # define BOOST_PP_CAT_I(a, b) a ## b | ^ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/concept_def.hpp:23:12: note: in expansion of macro ‘BOOST_PP_CAT’ 23 | struct BOOST_PP_CAT(name,Concept) \ | ^~~~~~~~~~~~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:165:3: note: in expansion of macro ‘BOOST_concept’ 165 | BOOST_concept(CopyConstructible,(TT)) | ^~~~~~~~~~~~~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements > >]’: /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/graph_concepts.hpp:66:5: required from ‘struct boost::concepts::Graph >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/graph_concepts.hpp:75:1: required from ‘struct boost::concepts::IncidenceGraph >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/graph_concepts.hpp:75:1: required from ‘struct boost::concepts::IncidenceGraphConcept >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::concepts::IncidenceGraphConcept >]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied > >::value’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:45:51: [ skipping 3 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/depth_first_search.hpp:286:39: required from ‘void boost::depth_first_search(const VertexListGraph&, DFSVisitor, ColorMap, typename graph_traits::vertex_descriptor) [with VertexListGraph = R_adjacency_list; DFSVisitor = detail::components_recorder; ColorMap = shared_array_property_map, long unsigned int> >; typename graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/depth_first_search.hpp:397:42: required from ‘void boost::graph::detail::depth_first_search_impl::operator()(const Graph&, const ArgPack&) const [with ArgPack = boost::parameter::aux::arg_list >, boost::parameter::aux::empty_arg_list, std::integral_constant >; Graph = R_adjacency_list]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/depth_first_search.hpp:406:5: required from ‘typename boost::result_of(Param0, const ArgPack&)>::type boost::graph::depth_first_search_with_named_params(const Param0&, const ArgPack&) [with Param0 = R_adjacency_list; ArgPack = boost::parameter::aux::arg_list >, boost::parameter::aux::empty_arg_list, std::integral_constant >; typename boost::result_of(Param0, const ArgPack&)>::type = void]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/depth_first_search.hpp:409:1: required from ‘typename boost::result_of(Param0, const typename boost::detail::convert_bgl_params_to_boost_parameter >::type&)>::type boost::depth_first_search(const Param0&, const bgl_named_params&) [with Param0 = R_adjacency_list; P = detail::components_recorder; T = graph_visitor_t; R = no_property; typename result_of(Param0, const typename detail::convert_bgl_params_to_boost_parameter >::type&)>::type = void; typename detail::convert_bgl_params_to_boost_parameter >::type = parameter::aux::arg_list >, parameter::aux::empty_arg_list, std::integral_constant >]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/connected_components.hpp:106:23: required from ‘typename boost::property_traits::value_type boost::connected_components(const Graph&, ComponentMap, typename enable_if_c::traversal_category>::value, graph::detail::no_parameter>::type) [with Graph = R_adjacency_list; ComponentMap = int*; typename property_traits::value_type = int; typename enable_if_c::traversal_category>::value, graph::detail::no_parameter>::type = graph::detail::no_parameter; typename graph_traits::traversal_category = undir_adj_list_traversal_tag]’ interfaces.cpp:205:29: required from here /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::concepts::Graph >]’ 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ^ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements > >]’: /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/graph_concepts.hpp:87:5: required from ‘struct boost::concepts::IncidenceGraph >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/graph_concepts.hpp:75:1: required from ‘struct boost::concepts::IncidenceGraphConcept >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::concepts::IncidenceGraphConcept >]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied > >::value’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied > >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:72:8: [ skipping 2 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/depth_first_search.hpp:286:39: required from ‘void boost::depth_first_search(const VertexListGraph&, DFSVisitor, ColorMap, typename graph_traits::vertex_descriptor) [with VertexListGraph = R_adjacency_list; DFSVisitor = detail::components_recorder; ColorMap = shared_array_property_map, long unsigned int> >; typename graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/depth_first_search.hpp:397:42: required from ‘void boost::graph::detail::depth_first_search_impl::operator()(const Graph&, const ArgPack&) const [with ArgPack = boost::parameter::aux::arg_list >, boost::parameter::aux::empty_arg_list, std::integral_constant >; Graph = R_adjacency_list]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/depth_first_search.hpp:406:5: required from ‘typename boost::result_of(Param0, const ArgPack&)>::type boost::graph::depth_first_search_with_named_params(const Param0&, const ArgPack&) [with Param0 = R_adjacency_list; ArgPack = boost::parameter::aux::arg_list >, boost::parameter::aux::empty_arg_list, std::integral_constant >; typename boost::result_of(Param0, const ArgPack&)>::type = void]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/depth_first_search.hpp:409:1: required from ‘typename boost::result_of(Param0, const typename boost::detail::convert_bgl_params_to_boost_parameter >::type&)>::type boost::depth_first_search(const Param0&, const bgl_named_params&) [with Param0 = R_adjacency_list; P = detail::components_recorder; T = graph_visitor_t; R = no_property; typename result_of(Param0, const typename detail::convert_bgl_params_to_boost_parameter >::type&)>::type = void; typename detail::convert_bgl_params_to_boost_parameter >::type = parameter::aux::arg_list >, parameter::aux::empty_arg_list, std::integral_constant >]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/connected_components.hpp:106:23: required from ‘typename boost::property_traits::value_type boost::connected_components(const Graph&, ComponentMap, typename enable_if_c::traversal_category>::value, graph::detail::no_parameter>::type) [with Graph = R_adjacency_list; ComponentMap = int*; typename property_traits::value_type = int; typename enable_if_c::traversal_category>::value, graph::detail::no_parameter>::type = graph::detail::no_parameter; typename graph_traits::traversal_category = undir_adj_list_traversal_tag]’ interfaces.cpp:205:29: required from here /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::concepts::IncidenceGraph >]’ 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ^ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::IncidenceGraphConcept >]’: /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/depth_first_search.hpp:129:9: required from ‘void boost::detail::depth_first_visit_impl(const IncidenceGraph&, typename boost::graph_traits::vertex_descriptor, DFSVisitor&, ColorMap, TerminatorFunc) [with IncidenceGraph = R_adjacency_list; DFSVisitor = components_recorder; ColorMap = boost::shared_array_property_map, long unsigned int> >; TerminatorFunc = nontruth2; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/depth_first_search.hpp:286:39: required from ‘void boost::depth_first_search(const VertexListGraph&, DFSVisitor, ColorMap, typename graph_traits::vertex_descriptor) [with VertexListGraph = R_adjacency_list; DFSVisitor = detail::components_recorder; ColorMap = shared_array_property_map, long unsigned int> >; typename graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/depth_first_search.hpp:397:42: required from ‘void boost::graph::detail::depth_first_search_impl::operator()(const Graph&, const ArgPack&) const [with ArgPack = boost::parameter::aux::arg_list >, boost::parameter::aux::empty_arg_list, std::integral_constant >; Graph = R_adjacency_list]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/depth_first_search.hpp:406:5: required from ‘typename boost::result_of(Param0, const ArgPack&)>::type boost::graph::depth_first_search_with_named_params(const Param0&, const ArgPack&) [with Param0 = R_adjacency_list; ArgPack = boost::parameter::aux::arg_list >, boost::parameter::aux::empty_arg_list, std::integral_constant >; typename boost::result_of(Param0, const ArgPack&)>::type = void]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/depth_first_search.hpp:409:1: required from ‘typename boost::result_of(Param0, const typename boost::detail::convert_bgl_params_to_boost_parameter >::type&)>::type boost::depth_first_search(const Param0&, const bgl_named_params&) [with Param0 = R_adjacency_list; P = detail::components_recorder; T = graph_visitor_t; R = no_property; typename result_of(Param0, const typename detail::convert_bgl_params_to_boost_parameter >::type&)>::type = void; typename detail::convert_bgl_params_to_boost_parameter >::type = parameter::aux::arg_list >, parameter::aux::empty_arg_list, std::integral_constant >]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/connected_components.hpp:106:23: required from ‘typename boost::property_traits::value_type boost::connected_components(const Graph&, ComponentMap, typename enable_if_c::traversal_category>::value, graph::detail::no_parameter>::type) [with Graph = R_adjacency_list; ComponentMap = int*; typename property_traits::value_type = int; typename enable_if_c::traversal_category>::value, graph::detail::no_parameter>::type = graph::detail::no_parameter; typename graph_traits::traversal_category = undir_adj_list_traversal_tag]’ interfaces.cpp:205:29: required from here /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/graph_concepts.hpp:75:15: note: in a call to non-static member function ‘boost::concepts::IncidenceGraphConcept >::~IncidenceGraphConcept()’ 75 | BOOST_concept(IncidenceGraph, (G)) : Graph< G > | ^~~~~~~~~~~~~~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/preprocessor/cat.hpp:29:34: note: in definition of macro ‘BOOST_PP_CAT_I’ 29 | # define BOOST_PP_CAT_I(a, b) a ## b | ^ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/concept_def.hpp:23:12: note: in expansion of macro ‘BOOST_PP_CAT’ 23 | struct BOOST_PP_CAT(name,Concept) \ | ^~~~~~~~~~~~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/graph_concepts.hpp:75:1: note: in expansion of macro ‘BOOST_concept’ 75 | BOOST_concept(IncidenceGraph, (G)) : Graph< G > | ^~~~~~~~~~~~~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements > >]’: /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/graph_concepts.hpp:182:5: required from ‘struct boost::concepts::VertexListGraph >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/graph_concepts.hpp:176:1: required from ‘struct boost::concepts::VertexListGraphConcept >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::concepts::VertexListGraphConcept >]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied > >::value’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied > >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:72:8: [ skipping 2 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/biconnected_components.hpp:250:47: required from ‘static std::pair boost::detail::bicomp_dispatch3::apply(const Graph&, ComponentMap, OutputIterator, VertexIndexMap, DiscoverTimeMap, LowPointMap, const boost::bgl_named_params&, boost::param_not_found) [with Graph = R_adjacency_list; ComponentMap = boost::dummy_property_map; OutputIterator = std::back_insert_iterator >; VertexIndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>; DiscoverTimeMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>; LowPointMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>; P = int; T = boost::buffer_param_t; R = boost::no_property]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/biconnected_components.hpp:295:60: required from ‘static std::pair boost::detail::bicomp_dispatch2::apply(const Graph&, ComponentMap, OutputIterator, VertexIndexMap, DiscoverTimeMap, const boost::bgl_named_params&, boost::param_not_found) [with Graph = R_adjacency_list; ComponentMap = boost::dummy_property_map; OutputIterator = std::back_insert_iterator >; VertexIndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>; DiscoverTimeMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>; P = int; T = boost::buffer_param_t; R = boost::no_property]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/biconnected_components.hpp:336:60: required from ‘static std::pair boost::detail::bicomp_dispatch1::apply(const Graph&, ComponentMap, OutputIterator, VertexIndexMap, const boost::bgl_named_params&, boost::param_not_found) [with Graph = R_adjacency_list; ComponentMap = boost::dummy_property_map; OutputIterator = std::back_insert_iterator >; VertexIndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>; P = int; T = boost::buffer_param_t; R = boost::no_property]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/biconnected_components.hpp:368:60: required from ‘std::pair boost::biconnected_components(const Graph&, ComponentMap, OutputIterator, const bgl_named_params&) [with Graph = R_adjacency_list; ComponentMap = dummy_property_map; OutputIterator = std::back_insert_iterator >; P = int; T = buffer_param_t; R = no_property]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/biconnected_components.hpp:433:34: required from ‘OutputIterator boost::articulation_points(const Graph&, OutputIterator) [with Graph = R_adjacency_list; OutputIterator = std::back_insert_iterator >]’ interfaces.cpp:300:28: required from here /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::concepts::VertexListGraph >]’ 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ^ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::VertexListGraphConcept >]’: /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/biconnected_components.hpp:188:9: required from ‘std::pair boost::detail::biconnected_components_impl(const Graph&, ComponentMap, OutputIterator, VertexIndexMap, DiscoverTimeMap, LowPointMap, PredecessorMap, DFSVisitor) [with Graph = R_adjacency_list; ComponentMap = boost::dummy_property_map; OutputIterator = std::back_insert_iterator >; VertexIndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>; DiscoverTimeMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>; LowPointMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>; PredecessorMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>; DFSVisitor = boost::dfs_visitor<>]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/biconnected_components.hpp:250:47: required from ‘static std::pair boost::detail::bicomp_dispatch3::apply(const Graph&, ComponentMap, OutputIterator, VertexIndexMap, DiscoverTimeMap, LowPointMap, const boost::bgl_named_params&, boost::param_not_found) [with Graph = R_adjacency_list; ComponentMap = boost::dummy_property_map; OutputIterator = std::back_insert_iterator >; VertexIndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>; DiscoverTimeMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>; LowPointMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>; P = int; T = boost::buffer_param_t; R = boost::no_property]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/biconnected_components.hpp:295:60: required from ‘static std::pair boost::detail::bicomp_dispatch2::apply(const Graph&, ComponentMap, OutputIterator, VertexIndexMap, DiscoverTimeMap, const boost::bgl_named_params&, boost::param_not_found) [with Graph = R_adjacency_list; ComponentMap = boost::dummy_property_map; OutputIterator = std::back_insert_iterator >; VertexIndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>; DiscoverTimeMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>; P = int; T = boost::buffer_param_t; R = boost::no_property]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/biconnected_components.hpp:336:60: required from ‘static std::pair boost::detail::bicomp_dispatch1::apply(const Graph&, ComponentMap, OutputIterator, VertexIndexMap, const boost::bgl_named_params&, boost::param_not_found) [with Graph = R_adjacency_list; ComponentMap = boost::dummy_property_map; OutputIterator = std::back_insert_iterator >; VertexIndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>; P = int; T = boost::buffer_param_t; R = boost::no_property]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/biconnected_components.hpp:368:60: required from ‘std::pair boost::biconnected_components(const Graph&, ComponentMap, OutputIterator, const bgl_named_params&) [with Graph = R_adjacency_list; ComponentMap = dummy_property_map; OutputIterator = std::back_insert_iterator >; P = int; T = buffer_param_t; R = no_property]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/biconnected_components.hpp:433:34: required from ‘OutputIterator boost::articulation_points(const Graph&, OutputIterator) [with Graph = R_adjacency_list; OutputIterator = std::back_insert_iterator >]’ interfaces.cpp:300:28: required from here /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/graph_concepts.hpp:176:15: note: in a call to non-static member function ‘boost::concepts::VertexListGraphConcept >::~VertexListGraphConcept()’ 176 | BOOST_concept(VertexListGraph, (G)) : Graph< G > | ^~~~~~~~~~~~~~~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/preprocessor/cat.hpp:29:34: note: in definition of macro ‘BOOST_PP_CAT_I’ 29 | # define BOOST_PP_CAT_I(a, b) a ## b | ^ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/concept_def.hpp:23:12: note: in expansion of macro ‘BOOST_PP_CAT’ 23 | struct BOOST_PP_CAT(name,Concept) \ | ^~~~~~~~~~~~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/graph_concepts.hpp:176:1: note: in expansion of macro ‘BOOST_concept’ 176 | BOOST_concept(VertexListGraph, (G)) : Graph< G > | ^~~~~~~~~~~~~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::constraint::failed() [with Model = boost::WritablePropertyMapConcept >]’: /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/biconnected_components.hpp:190:9: required from ‘std::pair boost::detail::biconnected_components_impl(const Graph&, ComponentMap, OutputIterator, VertexIndexMap, DiscoverTimeMap, LowPointMap, PredecessorMap, DFSVisitor) [with Graph = R_adjacency_list; ComponentMap = boost::dummy_property_map; OutputIterator = std::back_insert_iterator >; VertexIndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>; DiscoverTimeMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>; LowPointMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>; PredecessorMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>; DFSVisitor = boost::dfs_visitor<>]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/biconnected_components.hpp:250:47: required from ‘static std::pair boost::detail::bicomp_dispatch3::apply(const Graph&, ComponentMap, OutputIterator, VertexIndexMap, DiscoverTimeMap, LowPointMap, const boost::bgl_named_params&, boost::param_not_found) [with Graph = R_adjacency_list; ComponentMap = boost::dummy_property_map; OutputIterator = std::back_insert_iterator >; VertexIndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>; DiscoverTimeMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>; LowPointMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>; P = int; T = boost::buffer_param_t; R = boost::no_property]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/biconnected_components.hpp:295:60: required from ‘static std::pair boost::detail::bicomp_dispatch2::apply(const Graph&, ComponentMap, OutputIterator, VertexIndexMap, DiscoverTimeMap, const boost::bgl_named_params&, boost::param_not_found) [with Graph = R_adjacency_list; ComponentMap = boost::dummy_property_map; OutputIterator = std::back_insert_iterator >; VertexIndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>; DiscoverTimeMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>; P = int; T = boost::buffer_param_t; R = boost::no_property]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/biconnected_components.hpp:336:60: required from ‘static std::pair boost::detail::bicomp_dispatch1::apply(const Graph&, ComponentMap, OutputIterator, VertexIndexMap, const boost::bgl_named_params&, boost::param_not_found) [with Graph = R_adjacency_list; ComponentMap = boost::dummy_property_map; OutputIterator = std::back_insert_iterator >; VertexIndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>; P = int; T = boost::buffer_param_t; R = boost::no_property]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/biconnected_components.hpp:368:60: required from ‘std::pair boost::biconnected_components(const Graph&, ComponentMap, OutputIterator, const bgl_named_params&) [with Graph = R_adjacency_list; ComponentMap = dummy_property_map; OutputIterator = std::back_insert_iterator >; P = int; T = buffer_param_t; R = no_property]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/biconnected_components.hpp:433:34: required from ‘OutputIterator boost::articulation_points(const Graph&, OutputIterator) [with Graph = R_adjacency_list; OutputIterator = std::back_insert_iterator >]’ interfaces.cpp:300:28: required from here /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:65:52: warning: ‘this’ pointer is null [-Wnonnull] 65 | static void failed() { ((Model*)0)->constraints(); } | ~~~~~~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/property_map/property_map.hpp:179:10: note: in a call to non-static member function ‘void boost::WritablePropertyMapConcept::constraints() [with PMap = boost::dummy_property_map; Key = boost::detail::edge_desc_impl]’ 179 | void constraints() { | ^~~~~~~~~~~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::constraint::failed() [with Model = boost::ReadWritePropertyMapConcept >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>, long unsigned int>]’: /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/biconnected_components.hpp:192:9: required from ‘std::pair boost::detail::biconnected_components_impl(const Graph&, ComponentMap, OutputIterator, VertexIndexMap, DiscoverTimeMap, LowPointMap, PredecessorMap, DFSVisitor) [with Graph = R_adjacency_list; ComponentMap = boost::dummy_property_map; OutputIterator = std::back_insert_iterator >; VertexIndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>; DiscoverTimeMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>; LowPointMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>; PredecessorMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>; DFSVisitor = boost::dfs_visitor<>]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/biconnected_components.hpp:250:47: required from ‘static std::pair boost::detail::bicomp_dispatch3::apply(const Graph&, ComponentMap, OutputIterator, VertexIndexMap, DiscoverTimeMap, LowPointMap, const boost::bgl_named_params&, boost::param_not_found) [with Graph = R_adjacency_list; ComponentMap = boost::dummy_property_map; OutputIterator = std::back_insert_iterator >; VertexIndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>; DiscoverTimeMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>; LowPointMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>; P = int; T = boost::buffer_param_t; R = boost::no_property]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/biconnected_components.hpp:295:60: required from ‘static std::pair boost::detail::bicomp_dispatch2::apply(const Graph&, ComponentMap, OutputIterator, VertexIndexMap, DiscoverTimeMap, const boost::bgl_named_params&, boost::param_not_found) [with Graph = R_adjacency_list; ComponentMap = boost::dummy_property_map; OutputIterator = std::back_insert_iterator >; VertexIndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>; DiscoverTimeMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>; P = int; T = boost::buffer_param_t; R = boost::no_property]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/biconnected_components.hpp:336:60: required from ‘static std::pair boost::detail::bicomp_dispatch1::apply(const Graph&, ComponentMap, OutputIterator, VertexIndexMap, const boost::bgl_named_params&, boost::param_not_found) [with Graph = R_adjacency_list; ComponentMap = boost::dummy_property_map; OutputIterator = std::back_insert_iterator >; VertexIndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>; P = int; T = boost::buffer_param_t; R = boost::no_property]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/biconnected_components.hpp:368:60: required from ‘std::pair boost::biconnected_components(const Graph&, ComponentMap, OutputIterator, const bgl_named_params&) [with Graph = R_adjacency_list; ComponentMap = dummy_property_map; OutputIterator = std::back_insert_iterator >; P = int; T = buffer_param_t; R = no_property]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/biconnected_components.hpp:433:34: required from ‘OutputIterator boost::articulation_points(const Graph&, OutputIterator) [with Graph = R_adjacency_list; OutputIterator = std::back_insert_iterator >]’ interfaces.cpp:300:28: required from here /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:65:52: warning: ‘this’ pointer is null [-Wnonnull] 65 | static void failed() { ((Model*)0)->constraints(); } | ~~~~~~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/property_map/property_map.hpp:205:10: note: in a call to non-static member function ‘void boost::ReadWritePropertyMapConcept::constraints() [with PMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>; Key = long unsigned int]’ 205 | void constraints() { | ^~~~~~~~~~~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::concepts::Graph > > >, boost::no_property, boost::listS>, boost::is_residual_edge > > >, boost::edge_residual_capacity_t> >, boost::keep_all> >]’: /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements > > >, boost::no_property, boost::listS>, boost::is_residual_edge > > >, boost::edge_residual_capacity_t> >, boost::keep_all> > >]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/graph_concepts.hpp:66:5: required from ‘struct boost::concepts::Graph > > >, boost::no_property, boost::listS>, boost::is_residual_edge > > >, boost::edge_residual_capacity_t> >, boost::keep_all> >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/graph_concepts.hpp:75:1: required from ‘struct boost::concepts::IncidenceGraph > > >, boost::no_property, boost::listS>, boost::is_residual_edge > > >, boost::edge_residual_capacity_t> >, boost::keep_all> >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/graph_concepts.hpp:75:1: required from ‘struct boost::concepts::IncidenceGraphConcept > > >, boost::no_property, boost::listS>, boost::is_residual_edge > > >, boost::edge_residual_capacity_t> >, boost::keep_all> >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::concepts::IncidenceGraphConcept > > >, boost::no_property, boost::listS>, boost::is_residual_edge > > >, boost::edge_residual_capacity_t> >, boost::keep_all> >]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:42:5: [ skipping 3 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/depth_first_search.hpp:129:9: required from ‘void boost::breadth_first_visit(const IncidenceGraph&, SourceIterator, SourceIterator, Buffer&, BFSVisitor, ColorMap) [with IncidenceGraph = filtered_graph > > >, no_property, listS>, is_residual_edge > > >, edge_residual_capacity_t> >, keep_all>; Buffer = queue > >; BFSVisitor = bfs_visitor*, on_tree_edge> >; ColorMap = default_color_type*; SourceIterator = long unsigned int*]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/breadth_first_search.hpp:136:24: required from ‘void boost::breadth_first_search(const VertexListGraph&, SourceIterator, SourceIterator, Buffer&, BFSVisitor, ColorMap) [with VertexListGraph = filtered_graph > > >, no_property, listS>, is_residual_edge > > >, edge_residual_capacity_t> >, keep_all>; SourceIterator = long unsigned int*; Buffer = queue > >; BFSVisitor = bfs_visitor*, on_tree_edge> >; ColorMap = default_color_type*]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/breadth_first_search.hpp:147:25: required from ‘void boost::breadth_first_search(const VertexListGraph&, typename graph_traits::vertex_descriptor, Buffer&, BFSVisitor, ColorMap) [with VertexListGraph = filtered_graph > > >, no_property, listS>, is_residual_edge > > >, edge_residual_capacity_t> >, keep_all>; Buffer = queue > >; BFSVisitor = bfs_visitor*, on_tree_edge> >; ColorMap = default_color_type*; typename graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/edmonds_karp_max_flow.hpp:101:29: required from ‘typename boost::property_traits::value_type boost::edmonds_karp_max_flow(Graph&, typename graph_traits::vertex_descriptor, typename graph_traits::vertex_descriptor, CapacityEdgeMap, ResidualCapacityEdgeMap, ReverseEdgeMap, ColorMap, PredEdgeMap) [with Graph = adjacency_list > > >, no_property, listS>; CapacityEdgeMap = adj_list_edge_property_map > > >, edge_capacity_t>; ResidualCapacityEdgeMap = adj_list_edge_property_map > > >, edge_residual_capacity_t>; ReverseEdgeMap = adj_list_edge_property_map, detail::edge_desc_impl&, long unsigned int, property > > >, edge_reverse_t>; ColorMap = default_color_type*; PredEdgeMap = detail::edge_desc_impl*; typename property_traits::value_type = long unsigned int; typename graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/edge_connectivity.hpp:145:42: required from ‘typename boost::graph_traits::degree_size_type boost::edge_connectivity(VertexListGraph&, OutputIterator) [with VertexListGraph = R_adjacency_list; OutputIterator = std::back_insert_iterator > >; typename graph_traits::degree_size_type = long unsigned int]’ interfaces.cpp:326:34: required from here /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::concepts::Graph::~Graph() [with G = boost::filtered_graph > > >, boost::no_property, boost::listS>, boost::is_residual_edge > > >, boost::edge_residual_capacity_t> >, boost::keep_all>]’ 37 | ~model() | ^ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/graph_concepts.hpp:66:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 66 | BOOST_CONCEPT_USAGE(Graph) | ^~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::concepts::IncidenceGraph > > >, boost::no_property, boost::listS>, boost::is_residual_edge > > >, boost::edge_residual_capacity_t> >, boost::keep_all> >]’: /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements > > >, boost::no_property, boost::listS>, boost::is_residual_edge > > >, boost::edge_residual_capacity_t> >, boost::keep_all> > >]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/graph_concepts.hpp:87:5: required from ‘struct boost::concepts::IncidenceGraph > > >, boost::no_property, boost::listS>, boost::is_residual_edge > > >, boost::edge_residual_capacity_t> >, boost::keep_all> >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/graph_concepts.hpp:75:1: required from ‘struct boost::concepts::IncidenceGraphConcept > > >, boost::no_property, boost::listS>, boost::is_residual_edge > > >, boost::edge_residual_capacity_t> >, boost::keep_all> >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::concepts::IncidenceGraphConcept > > >, boost::no_property, boost::listS>, boost::is_residual_edge > > >, boost::edge_residual_capacity_t> >, boost::keep_all> >]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied > > >, boost::no_property, boost::listS>, boost::is_residual_edge > > >, boost::edge_residual_capacity_t> >, boost::keep_all> > >::value’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:45:51: [ skipping 2 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/depth_first_search.hpp:129:9: required from ‘void boost::breadth_first_visit(const IncidenceGraph&, SourceIterator, SourceIterator, Buffer&, BFSVisitor, ColorMap) [with IncidenceGraph = filtered_graph > > >, no_property, listS>, is_residual_edge > > >, edge_residual_capacity_t> >, keep_all>; Buffer = queue > >; BFSVisitor = bfs_visitor*, on_tree_edge> >; ColorMap = default_color_type*; SourceIterator = long unsigned int*]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/breadth_first_search.hpp:136:24: required from ‘void boost::breadth_first_search(const VertexListGraph&, SourceIterator, SourceIterator, Buffer&, BFSVisitor, ColorMap) [with VertexListGraph = filtered_graph > > >, no_property, listS>, is_residual_edge > > >, edge_residual_capacity_t> >, keep_all>; SourceIterator = long unsigned int*; Buffer = queue > >; BFSVisitor = bfs_visitor*, on_tree_edge> >; ColorMap = default_color_type*]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/breadth_first_search.hpp:147:25: required from ‘void boost::breadth_first_search(const VertexListGraph&, typename graph_traits::vertex_descriptor, Buffer&, BFSVisitor, ColorMap) [with VertexListGraph = filtered_graph > > >, no_property, listS>, is_residual_edge > > >, edge_residual_capacity_t> >, keep_all>; Buffer = queue > >; BFSVisitor = bfs_visitor*, on_tree_edge> >; ColorMap = default_color_type*; typename graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/edmonds_karp_max_flow.hpp:101:29: required from ‘typename boost::property_traits::value_type boost::edmonds_karp_max_flow(Graph&, typename graph_traits::vertex_descriptor, typename graph_traits::vertex_descriptor, CapacityEdgeMap, ResidualCapacityEdgeMap, ReverseEdgeMap, ColorMap, PredEdgeMap) [with Graph = adjacency_list > > >, no_property, listS>; CapacityEdgeMap = adj_list_edge_property_map > > >, edge_capacity_t>; ResidualCapacityEdgeMap = adj_list_edge_property_map > > >, edge_residual_capacity_t>; ReverseEdgeMap = adj_list_edge_property_map, detail::edge_desc_impl&, long unsigned int, property > > >, edge_reverse_t>; ColorMap = default_color_type*; PredEdgeMap = detail::edge_desc_impl*; typename property_traits::value_type = long unsigned int; typename graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/edge_connectivity.hpp:145:42: required from ‘typename boost::graph_traits::degree_size_type boost::edge_connectivity(VertexListGraph&, OutputIterator) [with VertexListGraph = R_adjacency_list; OutputIterator = std::back_insert_iterator > >; typename graph_traits::degree_size_type = long unsigned int]’ interfaces.cpp:326:34: required from here /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::concepts::IncidenceGraph::~IncidenceGraph() [with G = boost::filtered_graph > > >, boost::no_property, boost::listS>, boost::is_residual_edge > > >, boost::edge_residual_capacity_t> >, boost::keep_all>]’ 37 | ~model() | ^ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/graph_concepts.hpp:87:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 87 | BOOST_CONCEPT_USAGE(IncidenceGraph) | ^~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements*, boost::on_tree_edge> > > >]’: /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:167:5: required from ‘struct boost::CopyConstructible*, boost::on_tree_edge> > >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:165:3: required from ‘struct boost::CopyConstructibleConcept*, boost::on_tree_edge> > >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::CopyConstructibleConcept*, boost::on_tree_edge> > >]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied*, boost::on_tree_edge> > > >::value’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied*, boost::on_tree_edge> > > >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:72:8: [ skipping 6 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/breadth_first_search.hpp:65:5: required from ‘void boost::breadth_first_visit(const IncidenceGraph&, SourceIterator, SourceIterator, Buffer&, BFSVisitor, ColorMap) [with IncidenceGraph = filtered_graph > > >, no_property, listS>, is_residual_edge > > >, edge_residual_capacity_t> >, keep_all>; Buffer = queue > >; BFSVisitor = bfs_visitor*, on_tree_edge> >; ColorMap = default_color_type*; SourceIterator = long unsigned int*]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/breadth_first_search.hpp:136:24: required from ‘void boost::breadth_first_search(const VertexListGraph&, SourceIterator, SourceIterator, Buffer&, BFSVisitor, ColorMap) [with VertexListGraph = filtered_graph > > >, no_property, listS>, is_residual_edge > > >, edge_residual_capacity_t> >, keep_all>; SourceIterator = long unsigned int*; Buffer = queue > >; BFSVisitor = bfs_visitor*, on_tree_edge> >; ColorMap = default_color_type*]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/breadth_first_search.hpp:147:25: required from ‘void boost::breadth_first_search(const VertexListGraph&, typename graph_traits::vertex_descriptor, Buffer&, BFSVisitor, ColorMap) [with VertexListGraph = filtered_graph > > >, no_property, listS>, is_residual_edge > > >, edge_residual_capacity_t> >, keep_all>; Buffer = queue > >; BFSVisitor = bfs_visitor*, on_tree_edge> >; ColorMap = default_color_type*; typename graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/edmonds_karp_max_flow.hpp:101:29: required from ‘typename boost::property_traits::value_type boost::edmonds_karp_max_flow(Graph&, typename graph_traits::vertex_descriptor, typename graph_traits::vertex_descriptor, CapacityEdgeMap, ResidualCapacityEdgeMap, ReverseEdgeMap, ColorMap, PredEdgeMap) [with Graph = adjacency_list > > >, no_property, listS>; CapacityEdgeMap = adj_list_edge_property_map > > >, edge_capacity_t>; ResidualCapacityEdgeMap = adj_list_edge_property_map > > >, edge_residual_capacity_t>; ReverseEdgeMap = adj_list_edge_property_map, detail::edge_desc_impl&, long unsigned int, property > > >, edge_reverse_t>; ColorMap = default_color_type*; PredEdgeMap = detail::edge_desc_impl*; typename property_traits::value_type = long unsigned int; typename graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/edge_connectivity.hpp:145:42: required from ‘typename boost::graph_traits::degree_size_type boost::edge_connectivity(VertexListGraph&, OutputIterator) [with VertexListGraph = R_adjacency_list; OutputIterator = std::back_insert_iterator > >; typename graph_traits::degree_size_type = long unsigned int]’ interfaces.cpp:326:34: required from here /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::CopyConstructible*, boost::on_tree_edge> > >]’ 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ^ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::CopyConstructibleConcept*, boost::on_tree_edge> > >]’: /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/depth_first_search.hpp:41:9: required from ‘void boost::BFSVisitorConcept::constraints() [with Visitor = boost::bfs_visitor*, boost::on_tree_edge> >; Graph = boost::filtered_graph > > >, boost::no_property, boost::listS>, boost::is_residual_edge > > >, boost::edge_residual_capacity_t> >, boost::keep_all>]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::BFSVisitorConcept*, boost::on_tree_edge> >, boost::filtered_graph > > >, boost::no_property, boost::listS>, boost::is_residual_edge > > >, boost::edge_residual_capacity_t> >, boost::keep_all> >]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied*, boost::on_tree_edge> >, boost::filtered_graph > > >, boost::no_property, boost::listS>, boost::is_residual_edge > > >, boost::edge_residual_capacity_t> >, boost::keep_all> > >::value’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied*, boost::on_tree_edge> >, boost::filtered_graph > > >, boost::no_property, boost::listS>, boost::is_residual_edge > > >, boost::edge_residual_capacity_t> >, boost::keep_all> > >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_*, boost::on_tree_edge> >, boost::filtered_graph > > >, boost::no_property, boost::listS>, boost::is_residual_edge > > >, boost::edge_residual_capacity_t> >, boost::keep_all> >)>’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/breadth_first_search.hpp:65:5: required from ‘void boost::breadth_first_visit(const IncidenceGraph&, SourceIterator, SourceIterator, Buffer&, BFSVisitor, ColorMap) [with IncidenceGraph = filtered_graph > > >, no_property, listS>, is_residual_edge > > >, edge_residual_capacity_t> >, keep_all>; Buffer = queue > >; BFSVisitor = bfs_visitor*, on_tree_edge> >; ColorMap = default_color_type*; SourceIterator = long unsigned int*]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/breadth_first_search.hpp:136:24: required from ‘void boost::breadth_first_search(const VertexListGraph&, SourceIterator, SourceIterator, Buffer&, BFSVisitor, ColorMap) [with VertexListGraph = filtered_graph > > >, no_property, listS>, is_residual_edge > > >, edge_residual_capacity_t> >, keep_all>; SourceIterator = long unsigned int*; Buffer = queue > >; BFSVisitor = bfs_visitor*, on_tree_edge> >; ColorMap = default_color_type*]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/breadth_first_search.hpp:147:25: required from ‘void boost::breadth_first_search(const VertexListGraph&, typename graph_traits::vertex_descriptor, Buffer&, BFSVisitor, ColorMap) [with VertexListGraph = filtered_graph > > >, no_property, listS>, is_residual_edge > > >, edge_residual_capacity_t> >, keep_all>; Buffer = queue > >; BFSVisitor = bfs_visitor*, on_tree_edge> >; ColorMap = default_color_type*; typename graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/edmonds_karp_max_flow.hpp:101:29: required from ‘typename boost::property_traits::value_type boost::edmonds_karp_max_flow(Graph&, typename graph_traits::vertex_descriptor, typename graph_traits::vertex_descriptor, CapacityEdgeMap, ResidualCapacityEdgeMap, ReverseEdgeMap, ColorMap, PredEdgeMap) [with Graph = adjacency_list > > >, no_property, listS>; CapacityEdgeMap = adj_list_edge_property_map > > >, edge_capacity_t>; ResidualCapacityEdgeMap = adj_list_edge_property_map > > >, edge_residual_capacity_t>; ReverseEdgeMap = adj_list_edge_property_map, detail::edge_desc_impl&, long unsigned int, property > > >, edge_reverse_t>; ColorMap = default_color_type*; PredEdgeMap = detail::edge_desc_impl*; typename property_traits::value_type = long unsigned int; typename graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/edge_connectivity.hpp:145:42: required from ‘typename boost::graph_traits::degree_size_type boost::edge_connectivity(VertexListGraph&, OutputIterator) [with VertexListGraph = R_adjacency_list; OutputIterator = std::back_insert_iterator > >; typename graph_traits::degree_size_type = long unsigned int]’ interfaces.cpp:326:34: required from here /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:165:17: note: in a call to non-static member function ‘boost::CopyConstructibleConcept*, boost::on_tree_edge> > >::~CopyConstructibleConcept()’ 165 | BOOST_concept(CopyConstructible,(TT)) | ^~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/preprocessor/cat.hpp:29:34: note: in definition of macro ‘BOOST_PP_CAT_I’ 29 | # define BOOST_PP_CAT_I(a, b) a ## b | ^ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/concept_def.hpp:23:12: note: in expansion of macro ‘BOOST_PP_CAT’ 23 | struct BOOST_PP_CAT(name,Concept) \ | ^~~~~~~~~~~~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:165:3: note: in expansion of macro ‘BOOST_concept’ 165 | BOOST_concept(CopyConstructible,(TT)) | ^~~~~~~~~~~~~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::constraint::failed() [with Model = boost::ReadablePropertyMapConcept]’: /home/omnipath/local/R/4.4-3.20/BH/include/boost/property_map/property_map.hpp:206:7: required from ‘void boost::ReadWritePropertyMapConcept::constraints() [with PMap = boost::default_color_type*; Key = long unsigned int]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::ReadWritePropertyMapConcept]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied >::value’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_)>’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/breadth_first_search.hpp:66:5: required from ‘void boost::breadth_first_visit(const IncidenceGraph&, SourceIterator, SourceIterator, Buffer&, BFSVisitor, ColorMap) [with IncidenceGraph = filtered_graph > > >, no_property, listS>, is_residual_edge > > >, edge_residual_capacity_t> >, keep_all>; Buffer = queue > >; BFSVisitor = bfs_visitor*, on_tree_edge> >; ColorMap = default_color_type*; SourceIterator = long unsigned int*]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/breadth_first_search.hpp:136:24: required from ‘void boost::breadth_first_search(const VertexListGraph&, SourceIterator, SourceIterator, Buffer&, BFSVisitor, ColorMap) [with VertexListGraph = filtered_graph > > >, no_property, listS>, is_residual_edge > > >, edge_residual_capacity_t> >, keep_all>; SourceIterator = long unsigned int*; Buffer = queue > >; BFSVisitor = bfs_visitor*, on_tree_edge> >; ColorMap = default_color_type*]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/breadth_first_search.hpp:147:25: required from ‘void boost::breadth_first_search(const VertexListGraph&, typename graph_traits::vertex_descriptor, Buffer&, BFSVisitor, ColorMap) [with VertexListGraph = filtered_graph > > >, no_property, listS>, is_residual_edge > > >, edge_residual_capacity_t> >, keep_all>; Buffer = queue > >; BFSVisitor = bfs_visitor*, on_tree_edge> >; ColorMap = default_color_type*; typename graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/edmonds_karp_max_flow.hpp:101:29: required from ‘typename boost::property_traits::value_type boost::edmonds_karp_max_flow(Graph&, typename graph_traits::vertex_descriptor, typename graph_traits::vertex_descriptor, CapacityEdgeMap, ResidualCapacityEdgeMap, ReverseEdgeMap, ColorMap, PredEdgeMap) [with Graph = adjacency_list > > >, no_property, listS>; CapacityEdgeMap = adj_list_edge_property_map > > >, edge_capacity_t>; ResidualCapacityEdgeMap = adj_list_edge_property_map > > >, edge_residual_capacity_t>; ReverseEdgeMap = adj_list_edge_property_map, detail::edge_desc_impl&, long unsigned int, property > > >, edge_reverse_t>; ColorMap = default_color_type*; PredEdgeMap = detail::edge_desc_impl*; typename property_traits::value_type = long unsigned int; typename graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/edge_connectivity.hpp:145:42: required from ‘typename boost::graph_traits::degree_size_type boost::edge_connectivity(VertexListGraph&, OutputIterator) [with VertexListGraph = R_adjacency_list; OutputIterator = std::back_insert_iterator > >; typename graph_traits::degree_size_type = long unsigned int]’ interfaces.cpp:326:34: required from here /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:65:52: warning: ‘this’ pointer is null [-Wnonnull] 65 | static void failed() { ((Model*)0)->constraints(); } | ~~~~~~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/property_map/property_map.hpp:147:10: note: in a call to non-static member function ‘void boost::ReadablePropertyMapConcept::constraints() [with PMap = boost::default_color_type*; Key = long unsigned int]’ 147 | void constraints() { | ^~~~~~~~~~~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::constraint::failed() [with Model = boost::WritablePropertyMapConcept]’: /home/omnipath/local/R/4.4-3.20/BH/include/boost/property_map/property_map.hpp:207:7: required from ‘void boost::ReadWritePropertyMapConcept::constraints() [with PMap = boost::default_color_type*; Key = long unsigned int]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::ReadWritePropertyMapConcept]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied >::value’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_)>’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/breadth_first_search.hpp:66:5: required from ‘void boost::breadth_first_visit(const IncidenceGraph&, SourceIterator, SourceIterator, Buffer&, BFSVisitor, ColorMap) [with IncidenceGraph = filtered_graph > > >, no_property, listS>, is_residual_edge > > >, edge_residual_capacity_t> >, keep_all>; Buffer = queue > >; BFSVisitor = bfs_visitor*, on_tree_edge> >; ColorMap = default_color_type*; SourceIterator = long unsigned int*]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/breadth_first_search.hpp:136:24: required from ‘void boost::breadth_first_search(const VertexListGraph&, SourceIterator, SourceIterator, Buffer&, BFSVisitor, ColorMap) [with VertexListGraph = filtered_graph > > >, no_property, listS>, is_residual_edge > > >, edge_residual_capacity_t> >, keep_all>; SourceIterator = long unsigned int*; Buffer = queue > >; BFSVisitor = bfs_visitor*, on_tree_edge> >; ColorMap = default_color_type*]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/breadth_first_search.hpp:147:25: required from ‘void boost::breadth_first_search(const VertexListGraph&, typename graph_traits::vertex_descriptor, Buffer&, BFSVisitor, ColorMap) [with VertexListGraph = filtered_graph > > >, no_property, listS>, is_residual_edge > > >, edge_residual_capacity_t> >, keep_all>; Buffer = queue > >; BFSVisitor = bfs_visitor*, on_tree_edge> >; ColorMap = default_color_type*; typename graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/edmonds_karp_max_flow.hpp:101:29: required from ‘typename boost::property_traits::value_type boost::edmonds_karp_max_flow(Graph&, typename graph_traits::vertex_descriptor, typename graph_traits::vertex_descriptor, CapacityEdgeMap, ResidualCapacityEdgeMap, ReverseEdgeMap, ColorMap, PredEdgeMap) [with Graph = adjacency_list > > >, no_property, listS>; CapacityEdgeMap = adj_list_edge_property_map > > >, edge_capacity_t>; ResidualCapacityEdgeMap = adj_list_edge_property_map > > >, edge_residual_capacity_t>; ReverseEdgeMap = adj_list_edge_property_map, detail::edge_desc_impl&, long unsigned int, property > > >, edge_reverse_t>; ColorMap = default_color_type*; PredEdgeMap = detail::edge_desc_impl*; typename property_traits::value_type = long unsigned int; typename graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/edge_connectivity.hpp:145:42: required from ‘typename boost::graph_traits::degree_size_type boost::edge_connectivity(VertexListGraph&, OutputIterator) [with VertexListGraph = R_adjacency_list; OutputIterator = std::back_insert_iterator > >; typename graph_traits::degree_size_type = long unsigned int]’ interfaces.cpp:326:34: required from here /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:65:52: warning: ‘this’ pointer is null [-Wnonnull] 65 | static void failed() { ((Model*)0)->constraints(); } | ~~~~~~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/property_map/property_map.hpp:179:10: note: in a call to non-static member function ‘void boost::WritablePropertyMapConcept::constraints() [with PMap = boost::default_color_type*; Key = long unsigned int]’ 179 | void constraints() { | ^~~~~~~~~~~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::Convertible]’: /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements >]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:208:5: required from ‘struct boost::Convertible’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::Convertible]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied >::value’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:72:8: [ skipping 10 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied > > >::value’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied > > >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_ > >)>’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/property_map/property_map.hpp:354:5: required from ‘boost::iterator_property_map boost::make_iterator_property_map(RAIter, ID, Value) [with RAIter = __gnu_cxx::__normal_iterator >; Value = long unsigned int; ID = typed_identity_property_map]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/sequential_vertex_coloring.hpp:120:35: required from ‘typename boost::property_traits::value_type boost::sequential_vertex_coloring(const VertexListGraph&, ColorMap) [with VertexListGraph = R_adjacency_list; ColorMap = iterator_property_map, long unsigned int> >; typename property_traits::value_type = long unsigned int]’ interfaces.cpp:370:56: required from here /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::Convertible::~Convertible() [with X = std::random_access_iterator_tag; Y = std::input_iterator_tag]’ 37 | ~model() | ^ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:208:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 208 | BOOST_CONCEPT_USAGE(Convertible) { | ^~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::Convertible]’: /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements >]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:208:5: required from ‘struct boost::Convertible’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::Convertible]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied >::value’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:72:8: [ skipping 9 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied > > >::value’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied > > >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_ > >)>’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/property_map/property_map.hpp:354:5: required from ‘boost::iterator_property_map boost::make_iterator_property_map(RAIter, ID, Value) [with RAIter = __gnu_cxx::__normal_iterator >; Value = long unsigned int; ID = typed_identity_property_map]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/sequential_vertex_coloring.hpp:120:35: required from ‘typename boost::property_traits::value_type boost::sequential_vertex_coloring(const VertexListGraph&, ColorMap) [with VertexListGraph = R_adjacency_list; ColorMap = iterator_property_map, long unsigned int> >; typename property_traits::value_type = long unsigned int]’ interfaces.cpp:370:56: required from here /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::Convertible::~Convertible() [with X = std::random_access_iterator_tag; Y = std::forward_iterator_tag]’ 37 | ~model() | ^ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:208:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 208 | BOOST_CONCEPT_USAGE(Convertible) { | ^~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::Convertible]’: /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements >]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:208:5: required from ‘struct boost::Convertible’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::Convertible]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied >::value’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:72:8: [ skipping 8 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied > > >::value’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied > > >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_ > >)>’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/property_map/property_map.hpp:354:5: required from ‘boost::iterator_property_map boost::make_iterator_property_map(RAIter, ID, Value) [with RAIter = __gnu_cxx::__normal_iterator >; Value = long unsigned int; ID = typed_identity_property_map]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/sequential_vertex_coloring.hpp:120:35: required from ‘typename boost::property_traits::value_type boost::sequential_vertex_coloring(const VertexListGraph&, ColorMap) [with VertexListGraph = R_adjacency_list; ColorMap = iterator_property_map, long unsigned int> >; typename property_traits::value_type = long unsigned int]’ interfaces.cpp:370:56: required from here /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::Convertible::~Convertible() [with X = std::random_access_iterator_tag; Y = std::bidirectional_iterator_tag]’ 37 | ~model() | ^ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:208:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 208 | BOOST_CONCEPT_USAGE(Convertible) { | ^~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements > > > >]’: /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:167:5: required from ‘struct boost::CopyConstructible > > >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:165:3: required from ‘struct boost::CopyConstructibleConcept > > >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::CopyConstructibleConcept > > >]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied > > > >::value’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied > > > >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:72:8: [ skipping 7 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/depth_first_search.hpp:397:42: required from ‘void boost::graph::detail::depth_first_search_impl::operator()(const Graph&, const ArgPack&) const [with ArgPack = boost::parameter::aux::arg_list > > >, boost::parameter::aux::arg_list, boost::parameter::aux::empty_arg_list, std::integral_constant >, std::integral_constant >; Graph = R_adjacency_list]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/depth_first_search.hpp:406:5: required from ‘typename boost::result_of(Param0, const ArgPack&)>::type boost::graph::depth_first_search_with_named_params(const Param0&, const ArgPack&) [with Param0 = R_adjacency_list; ArgPack = boost::parameter::aux::arg_list > > >, boost::parameter::aux::arg_list, boost::parameter::aux::empty_arg_list, std::integral_constant >, std::integral_constant >; typename boost::result_of(Param0, const ArgPack&)>::type = void]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/depth_first_search.hpp:409:1: required from ‘typename boost::result_of(Param0, const typename boost::detail::convert_bgl_params_to_boost_parameter >::type&)>::type boost::depth_first_search(const Param0&, const bgl_named_params&) [with Param0 = R_adjacency_list; P = topo_sort_visitor > >; T = graph_visitor_t; R = bgl_named_params; typename result_of(Param0, const typename detail::convert_bgl_params_to_boost_parameter >::type&)>::type = void; typename detail::convert_bgl_params_to_boost_parameter >::type = parameter::aux::arg_list > > >, parameter::aux::arg_list, parameter::aux::empty_arg_list, std::integral_constant >, std::integral_constant >]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/topological_sort.hpp:69:23: required from ‘void boost::topological_sort(VertexListGraph&, OutputIterator, const bgl_named_params&) [with VertexListGraph = R_adjacency_list; OutputIterator = std::front_insert_iterator >; P = int; T = buffer_param_t; R = no_property]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/topological_sort.hpp:75:21: required from ‘void boost::topological_sort(VertexListGraph&, OutputIterator) [with VertexListGraph = R_adjacency_list; OutputIterator = std::front_insert_iterator >]’ interfaces.cpp:71:29: required from here /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::CopyConstructible > > >]’ 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ^ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::CopyConstructibleConcept > > >]’: /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/depth_first_search.hpp:41:9: required from ‘void boost::DFSVisitorConcept::constraints() [with Visitor = boost::topo_sort_visitor > >; Graph = R_adjacency_list]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::DFSVisitorConcept > >, R_adjacency_list >]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied > >, R_adjacency_list > >::value’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied > >, R_adjacency_list > >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:72:8: [ skipping 2 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/depth_first_search.hpp:397:42: required from ‘void boost::graph::detail::depth_first_search_impl::operator()(const Graph&, const ArgPack&) const [with ArgPack = boost::parameter::aux::arg_list > > >, boost::parameter::aux::arg_list, boost::parameter::aux::empty_arg_list, std::integral_constant >, std::integral_constant >; Graph = R_adjacency_list]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/depth_first_search.hpp:406:5: required from ‘typename boost::result_of(Param0, const ArgPack&)>::type boost::graph::depth_first_search_with_named_params(const Param0&, const ArgPack&) [with Param0 = R_adjacency_list; ArgPack = boost::parameter::aux::arg_list > > >, boost::parameter::aux::arg_list, boost::parameter::aux::empty_arg_list, std::integral_constant >, std::integral_constant >; typename boost::result_of(Param0, const ArgPack&)>::type = void]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/depth_first_search.hpp:409:1: required from ‘typename boost::result_of(Param0, const typename boost::detail::convert_bgl_params_to_boost_parameter >::type&)>::type boost::depth_first_search(const Param0&, const bgl_named_params&) [with Param0 = R_adjacency_list; P = topo_sort_visitor > >; T = graph_visitor_t; R = bgl_named_params; typename result_of(Param0, const typename detail::convert_bgl_params_to_boost_parameter >::type&)>::type = void; typename detail::convert_bgl_params_to_boost_parameter >::type = parameter::aux::arg_list > > >, parameter::aux::arg_list, parameter::aux::empty_arg_list, std::integral_constant >, std::integral_constant >]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/topological_sort.hpp:69:23: required from ‘void boost::topological_sort(VertexListGraph&, OutputIterator, const bgl_named_params&) [with VertexListGraph = R_adjacency_list; OutputIterator = std::front_insert_iterator >; P = int; T = buffer_param_t; R = no_property]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/topological_sort.hpp:75:21: required from ‘void boost::topological_sort(VertexListGraph&, OutputIterator) [with VertexListGraph = R_adjacency_list; OutputIterator = std::front_insert_iterator >]’ interfaces.cpp:71:29: required from here /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:165:17: note: in a call to non-static member function ‘boost::CopyConstructibleConcept > > >::~CopyConstructibleConcept()’ 165 | BOOST_concept(CopyConstructible,(TT)) | ^~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/preprocessor/cat.hpp:29:34: note: in definition of macro ‘BOOST_PP_CAT_I’ 29 | # define BOOST_PP_CAT_I(a, b) a ## b | ^ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/concept_def.hpp:23:12: note: in expansion of macro ‘BOOST_PP_CAT’ 23 | struct BOOST_PP_CAT(name,Concept) \ | ^~~~~~~~~~~~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:165:3: note: in expansion of macro ‘BOOST_concept’ 165 | BOOST_concept(CopyConstructible,(TT)) | ^~~~~~~~~~~~~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements > >]’: /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:167:5: required from ‘struct boost::CopyConstructible >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:165:3: required from ‘struct boost::CopyConstructibleConcept >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::CopyConstructibleConcept >]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied > >::value’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied > >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:72:8: [ skipping 7 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/breadth_first_search.hpp:136:24: required from ‘void boost::breadth_first_search(const VertexListGraph&, SourceIterator, SourceIterator, Buffer&, BFSVisitor, ColorMap) [with VertexListGraph = R_adjacency_list; SourceIterator = long unsigned int*; Buffer = queue > >; BFSVisitor = bfs_time_visitor; ColorMap = two_bit_color_map, long unsigned int> >]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/breadth_first_search.hpp:147:25: required from ‘void boost::breadth_first_search(const VertexListGraph&, typename graph_traits::vertex_descriptor, Buffer&, BFSVisitor, ColorMap) [with VertexListGraph = R_adjacency_list; Buffer = queue > >; BFSVisitor = bfs_time_visitor; ColorMap = two_bit_color_map, long unsigned int> >; typename graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/breadth_first_search.hpp:262:29: required from ‘void boost::detail::bfs_helper(VertexListGraph&, typename boost::graph_traits::vertex_descriptor, ColorMap, BFSVisitor, const boost::bgl_named_params&, mpl_::false_) [with VertexListGraph = R_adjacency_list; ColorMap = boost::two_bit_color_map, long unsigned int> >; BFSVisitor = bfs_time_visitor; P = bfs_time_visitor; T = boost::graph_visitor_t; R = boost::no_property; typename boost::graph_traits::vertex_descriptor = long unsigned int; mpl_::false_ = mpl_::bool_]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/breadth_first_search.hpp:309:23: required from ‘static void boost::detail::bfs_dispatch::apply(VertexListGraph&, typename boost::graph_traits::vertex_descriptor, const boost::bgl_named_params&, boost::param_not_found) [with VertexListGraph = R_adjacency_list; P = bfs_time_visitor; T = boost::graph_visitor_t; R = boost::no_property; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/breadth_first_search.hpp:339:37: required from ‘void boost::breadth_first_search(const VertexListGraph&, typename graph_traits::vertex_descriptor, const bgl_named_params&) [with VertexListGraph = R_adjacency_list; P = bfs_time_visitor; T = graph_visitor_t; R = no_property; typename graph_traits::vertex_descriptor = long unsigned int]’ interfaces.cpp:113:29: required from here /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::CopyConstructible >]’ 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ^ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::CopyConstructibleConcept >]’: /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/depth_first_search.hpp:41:9: required from ‘void boost::BFSVisitorConcept::constraints() [with Visitor = bfs_time_visitor; Graph = R_adjacency_list]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::BFSVisitorConcept, R_adjacency_list >]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied, R_adjacency_list > >::value’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied, R_adjacency_list > >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:72:8: [ skipping 2 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/breadth_first_search.hpp:136:24: required from ‘void boost::breadth_first_search(const VertexListGraph&, SourceIterator, SourceIterator, Buffer&, BFSVisitor, ColorMap) [with VertexListGraph = R_adjacency_list; SourceIterator = long unsigned int*; Buffer = queue > >; BFSVisitor = bfs_time_visitor; ColorMap = two_bit_color_map, long unsigned int> >]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/breadth_first_search.hpp:147:25: required from ‘void boost::breadth_first_search(const VertexListGraph&, typename graph_traits::vertex_descriptor, Buffer&, BFSVisitor, ColorMap) [with VertexListGraph = R_adjacency_list; Buffer = queue > >; BFSVisitor = bfs_time_visitor; ColorMap = two_bit_color_map, long unsigned int> >; typename graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/breadth_first_search.hpp:262:29: required from ‘void boost::detail::bfs_helper(VertexListGraph&, typename boost::graph_traits::vertex_descriptor, ColorMap, BFSVisitor, const boost::bgl_named_params&, mpl_::false_) [with VertexListGraph = R_adjacency_list; ColorMap = boost::two_bit_color_map, long unsigned int> >; BFSVisitor = bfs_time_visitor; P = bfs_time_visitor; T = boost::graph_visitor_t; R = boost::no_property; typename boost::graph_traits::vertex_descriptor = long unsigned int; mpl_::false_ = mpl_::bool_]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/breadth_first_search.hpp:309:23: required from ‘static void boost::detail::bfs_dispatch::apply(VertexListGraph&, typename boost::graph_traits::vertex_descriptor, const boost::bgl_named_params&, boost::param_not_found) [with VertexListGraph = R_adjacency_list; P = bfs_time_visitor; T = boost::graph_visitor_t; R = boost::no_property; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/breadth_first_search.hpp:339:37: required from ‘void boost::breadth_first_search(const VertexListGraph&, typename graph_traits::vertex_descriptor, const bgl_named_params&) [with VertexListGraph = R_adjacency_list; P = bfs_time_visitor; T = graph_visitor_t; R = no_property; typename graph_traits::vertex_descriptor = long unsigned int]’ interfaces.cpp:113:29: required from here /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:165:17: note: in a call to non-static member function ‘boost::CopyConstructibleConcept >::~CopyConstructibleConcept()’ 165 | BOOST_concept(CopyConstructible,(TT)) | ^~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/preprocessor/cat.hpp:29:34: note: in definition of macro ‘BOOST_PP_CAT_I’ 29 | # define BOOST_PP_CAT_I(a, b) a ## b | ^ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/concept_def.hpp:23:12: note: in expansion of macro ‘BOOST_PP_CAT’ 23 | struct BOOST_PP_CAT(name,Concept) \ | ^~~~~~~~~~~~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:165:3: note: in expansion of macro ‘BOOST_concept’ 165 | BOOST_concept(CopyConstructible,(TT)) | ^~~~~~~~~~~~~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::constraint::failed() [with Model = boost::ReadablePropertyMapConcept, long unsigned int> >, long unsigned int>]’: /home/omnipath/local/R/4.4-3.20/BH/include/boost/property_map/property_map.hpp:206:7: required from ‘void boost::ReadWritePropertyMapConcept::constraints() [with PMap = boost::two_bit_color_map, long unsigned int> >; Key = long unsigned int]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::ReadWritePropertyMapConcept, long unsigned int> >, long unsigned int>]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied, long unsigned int> >, long unsigned int> >::value’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied, long unsigned int> >, long unsigned int> >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:72:8: [ skipping 2 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/breadth_first_search.hpp:136:24: required from ‘void boost::breadth_first_search(const VertexListGraph&, SourceIterator, SourceIterator, Buffer&, BFSVisitor, ColorMap) [with VertexListGraph = R_adjacency_list; SourceIterator = long unsigned int*; Buffer = queue > >; BFSVisitor = bfs_time_visitor; ColorMap = two_bit_color_map, long unsigned int> >]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/breadth_first_search.hpp:147:25: required from ‘void boost::breadth_first_search(const VertexListGraph&, typename graph_traits::vertex_descriptor, Buffer&, BFSVisitor, ColorMap) [with VertexListGraph = R_adjacency_list; Buffer = queue > >; BFSVisitor = bfs_time_visitor; ColorMap = two_bit_color_map, long unsigned int> >; typename graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/breadth_first_search.hpp:262:29: required from ‘void boost::detail::bfs_helper(VertexListGraph&, typename boost::graph_traits::vertex_descriptor, ColorMap, BFSVisitor, const boost::bgl_named_params&, mpl_::false_) [with VertexListGraph = R_adjacency_list; ColorMap = boost::two_bit_color_map, long unsigned int> >; BFSVisitor = bfs_time_visitor; P = bfs_time_visitor; T = boost::graph_visitor_t; R = boost::no_property; typename boost::graph_traits::vertex_descriptor = long unsigned int; mpl_::false_ = mpl_::bool_]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/breadth_first_search.hpp:309:23: required from ‘static void boost::detail::bfs_dispatch::apply(VertexListGraph&, typename boost::graph_traits::vertex_descriptor, const boost::bgl_named_params&, boost::param_not_found) [with VertexListGraph = R_adjacency_list; P = bfs_time_visitor; T = boost::graph_visitor_t; R = boost::no_property; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/breadth_first_search.hpp:339:37: required from ‘void boost::breadth_first_search(const VertexListGraph&, typename graph_traits::vertex_descriptor, const bgl_named_params&) [with VertexListGraph = R_adjacency_list; P = bfs_time_visitor; T = graph_visitor_t; R = no_property; typename graph_traits::vertex_descriptor = long unsigned int]’ interfaces.cpp:113:29: required from here /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:65:52: warning: ‘this’ pointer is null [-Wnonnull] 65 | static void failed() { ((Model*)0)->constraints(); } | ~~~~~~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/property_map/property_map.hpp:147:10: note: in a call to non-static member function ‘void boost::ReadablePropertyMapConcept::constraints() [with PMap = boost::two_bit_color_map, long unsigned int> >; Key = long unsigned int]’ 147 | void constraints() { | ^~~~~~~~~~~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::constraint::failed() [with Model = boost::WritablePropertyMapConcept, long unsigned int> >, long unsigned int>]’: /home/omnipath/local/R/4.4-3.20/BH/include/boost/property_map/property_map.hpp:207:7: required from ‘void boost::ReadWritePropertyMapConcept::constraints() [with PMap = boost::two_bit_color_map, long unsigned int> >; Key = long unsigned int]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::ReadWritePropertyMapConcept, long unsigned int> >, long unsigned int>]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied, long unsigned int> >, long unsigned int> >::value’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied, long unsigned int> >, long unsigned int> >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:72:8: [ skipping 2 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/breadth_first_search.hpp:136:24: required from ‘void boost::breadth_first_search(const VertexListGraph&, SourceIterator, SourceIterator, Buffer&, BFSVisitor, ColorMap) [with VertexListGraph = R_adjacency_list; SourceIterator = long unsigned int*; Buffer = queue > >; BFSVisitor = bfs_time_visitor; ColorMap = two_bit_color_map, long unsigned int> >]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/breadth_first_search.hpp:147:25: required from ‘void boost::breadth_first_search(const VertexListGraph&, typename graph_traits::vertex_descriptor, Buffer&, BFSVisitor, ColorMap) [with VertexListGraph = R_adjacency_list; Buffer = queue > >; BFSVisitor = bfs_time_visitor; ColorMap = two_bit_color_map, long unsigned int> >; typename graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/breadth_first_search.hpp:262:29: required from ‘void boost::detail::bfs_helper(VertexListGraph&, typename boost::graph_traits::vertex_descriptor, ColorMap, BFSVisitor, const boost::bgl_named_params&, mpl_::false_) [with VertexListGraph = R_adjacency_list; ColorMap = boost::two_bit_color_map, long unsigned int> >; BFSVisitor = bfs_time_visitor; P = bfs_time_visitor; T = boost::graph_visitor_t; R = boost::no_property; typename boost::graph_traits::vertex_descriptor = long unsigned int; mpl_::false_ = mpl_::bool_]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/breadth_first_search.hpp:309:23: required from ‘static void boost::detail::bfs_dispatch::apply(VertexListGraph&, typename boost::graph_traits::vertex_descriptor, const boost::bgl_named_params&, boost::param_not_found) [with VertexListGraph = R_adjacency_list; P = bfs_time_visitor; T = boost::graph_visitor_t; R = boost::no_property; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/breadth_first_search.hpp:339:37: required from ‘void boost::breadth_first_search(const VertexListGraph&, typename graph_traits::vertex_descriptor, const bgl_named_params&) [with VertexListGraph = R_adjacency_list; P = bfs_time_visitor; T = graph_visitor_t; R = no_property; typename graph_traits::vertex_descriptor = long unsigned int]’ interfaces.cpp:113:29: required from here /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:65:52: warning: ‘this’ pointer is null [-Wnonnull] 65 | static void failed() { ((Model*)0)->constraints(); } | ~~~~~~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/property_map/property_map.hpp:179:10: note: in a call to non-static member function ‘void boost::WritablePropertyMapConcept::constraints() [with PMap = boost::two_bit_color_map, long unsigned int> >; Key = long unsigned int]’ 179 | void constraints() { | ^~~~~~~~~~~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements >]’: /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:208:5: required from ‘struct boost::Convertible’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:206:3: required from ‘struct boost::ConvertibleConcept’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::ConvertibleConcept]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied >::value’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:72:8: [ skipping 7 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/breadth_first_search.hpp:136:24: required from ‘void boost::breadth_first_search(const VertexListGraph&, SourceIterator, SourceIterator, Buffer&, BFSVisitor, ColorMap) [with VertexListGraph = R_adjacency_list; SourceIterator = long unsigned int*; Buffer = queue > >; BFSVisitor = bfs_time_visitor; ColorMap = two_bit_color_map, long unsigned int> >]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/breadth_first_search.hpp:147:25: required from ‘void boost::breadth_first_search(const VertexListGraph&, typename graph_traits::vertex_descriptor, Buffer&, BFSVisitor, ColorMap) [with VertexListGraph = R_adjacency_list; Buffer = queue > >; BFSVisitor = bfs_time_visitor; ColorMap = two_bit_color_map, long unsigned int> >; typename graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/breadth_first_search.hpp:262:29: required from ‘void boost::detail::bfs_helper(VertexListGraph&, typename boost::graph_traits::vertex_descriptor, ColorMap, BFSVisitor, const boost::bgl_named_params&, mpl_::false_) [with VertexListGraph = R_adjacency_list; ColorMap = boost::two_bit_color_map, long unsigned int> >; BFSVisitor = bfs_time_visitor; P = bfs_time_visitor; T = boost::graph_visitor_t; R = boost::no_property; typename boost::graph_traits::vertex_descriptor = long unsigned int; mpl_::false_ = mpl_::bool_]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/breadth_first_search.hpp:309:23: required from ‘static void boost::detail::bfs_dispatch::apply(VertexListGraph&, typename boost::graph_traits::vertex_descriptor, const boost::bgl_named_params&, boost::param_not_found) [with VertexListGraph = R_adjacency_list; P = bfs_time_visitor; T = boost::graph_visitor_t; R = boost::no_property; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/breadth_first_search.hpp:339:37: required from ‘void boost::breadth_first_search(const VertexListGraph&, typename graph_traits::vertex_descriptor, const bgl_named_params&) [with VertexListGraph = R_adjacency_list; P = bfs_time_visitor; T = graph_visitor_t; R = no_property; typename graph_traits::vertex_descriptor = long unsigned int]’ interfaces.cpp:113:29: required from here /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::Convertible]’ 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ^ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::ConvertibleConcept]’: /home/omnipath/local/R/4.4-3.20/BH/include/boost/property_map/property_map.hpp:208:7: required from ‘void boost::ReadWritePropertyMapConcept::constraints() [with PMap = boost::two_bit_color_map, long unsigned int> >; Key = long unsigned int]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::ReadWritePropertyMapConcept, long unsigned int> >, long unsigned int>]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied, long unsigned int> >, long unsigned int> >::value’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied, long unsigned int> >, long unsigned int> >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:72:8: [ skipping 2 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/breadth_first_search.hpp:136:24: required from ‘void boost::breadth_first_search(const VertexListGraph&, SourceIterator, SourceIterator, Buffer&, BFSVisitor, ColorMap) [with VertexListGraph = R_adjacency_list; SourceIterator = long unsigned int*; Buffer = queue > >; BFSVisitor = bfs_time_visitor; ColorMap = two_bit_color_map, long unsigned int> >]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/breadth_first_search.hpp:147:25: required from ‘void boost::breadth_first_search(const VertexListGraph&, typename graph_traits::vertex_descriptor, Buffer&, BFSVisitor, ColorMap) [with VertexListGraph = R_adjacency_list; Buffer = queue > >; BFSVisitor = bfs_time_visitor; ColorMap = two_bit_color_map, long unsigned int> >; typename graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/breadth_first_search.hpp:262:29: required from ‘void boost::detail::bfs_helper(VertexListGraph&, typename boost::graph_traits::vertex_descriptor, ColorMap, BFSVisitor, const boost::bgl_named_params&, mpl_::false_) [with VertexListGraph = R_adjacency_list; ColorMap = boost::two_bit_color_map, long unsigned int> >; BFSVisitor = bfs_time_visitor; P = bfs_time_visitor; T = boost::graph_visitor_t; R = boost::no_property; typename boost::graph_traits::vertex_descriptor = long unsigned int; mpl_::false_ = mpl_::bool_]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/breadth_first_search.hpp:309:23: required from ‘static void boost::detail::bfs_dispatch::apply(VertexListGraph&, typename boost::graph_traits::vertex_descriptor, const boost::bgl_named_params&, boost::param_not_found) [with VertexListGraph = R_adjacency_list; P = bfs_time_visitor; T = boost::graph_visitor_t; R = boost::no_property; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/breadth_first_search.hpp:339:37: required from ‘void boost::breadth_first_search(const VertexListGraph&, typename graph_traits::vertex_descriptor, const bgl_named_params&) [with VertexListGraph = R_adjacency_list; P = bfs_time_visitor; T = graph_visitor_t; R = no_property; typename graph_traits::vertex_descriptor = long unsigned int]’ interfaces.cpp:113:29: required from here /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:206:17: note: in a call to non-static member function ‘boost::ConvertibleConcept::~ConvertibleConcept()’ 206 | BOOST_concept(Convertible,(X)(Y)) | ^~~~~~~~~~~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/preprocessor/cat.hpp:29:34: note: in definition of macro ‘BOOST_PP_CAT_I’ 29 | # define BOOST_PP_CAT_I(a, b) a ## b | ^ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/concept_def.hpp:23:12: note: in expansion of macro ‘BOOST_PP_CAT’ 23 | struct BOOST_PP_CAT(name,Concept) \ | ^~~~~~~~~~~~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:206:3: note: in expansion of macro ‘BOOST_concept’ 206 | BOOST_concept(Convertible,(X)(Y)) | ^~~~~~~~~~~~~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements >*, std::vector >, std::allocator > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >]’: /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/graph_concepts.hpp:52:50: required from ‘struct boost::concepts::MultiPassInputIterator >*, std::vector >, std::allocator > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::concepts::MultiPassInputIterator >*, std::vector >, std::allocator > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> >]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied >*, std::vector >, std::allocator > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::value’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied >*, std::vector >, std::allocator > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_ >*, std::vector >, std::allocator > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> >)>’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/graph_concepts.hpp:89:9: [ skipping 2 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/depth_first_search.hpp:129:9: required from ‘void boost::detail::depth_first_visit_impl(const IncidenceGraph&, typename boost::graph_traits::vertex_descriptor, DFSVisitor&, ColorMap, TerminatorFunc) [with IncidenceGraph = R_adjacency_list; DFSVisitor = dfs_time_visitor; ColorMap = boost::shared_array_property_map, long unsigned int> >; TerminatorFunc = nontruth2; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/depth_first_search.hpp:286:39: required from ‘void boost::depth_first_search(const VertexListGraph&, DFSVisitor, ColorMap, typename graph_traits::vertex_descriptor) [with VertexListGraph = R_adjacency_list; DFSVisitor = dfs_time_visitor; ColorMap = shared_array_property_map, long unsigned int> >; typename graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/depth_first_search.hpp:397:42: required from ‘void boost::graph::detail::depth_first_search_impl::operator()(const Graph&, const ArgPack&) const [with ArgPack = boost::parameter::aux::arg_list >, boost::parameter::aux::empty_arg_list, std::integral_constant >; Graph = R_adjacency_list]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/depth_first_search.hpp:406:5: required from ‘typename boost::result_of(Param0, const ArgPack&)>::type boost::graph::depth_first_search_with_named_params(const Param0&, const ArgPack&) [with Param0 = R_adjacency_list; ArgPack = boost::parameter::aux::arg_list >, boost::parameter::aux::empty_arg_list, std::integral_constant >; typename boost::result_of(Param0, const ArgPack&)>::type = void]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/depth_first_search.hpp:409:1: required from ‘typename boost::result_of(Param0, const typename boost::detail::convert_bgl_params_to_boost_parameter >::type&)>::type boost::depth_first_search(const Param0&, const bgl_named_params&) [with Param0 = R_adjacency_list; P = dfs_time_visitor; T = graph_visitor_t; R = no_property; typename result_of(Param0, const typename detail::convert_bgl_params_to_boost_parameter >::type&)>::type = void; typename detail::convert_bgl_params_to_boost_parameter >::type = parameter::aux::arg_list >, parameter::aux::empty_arg_list, std::integral_constant >]’ interfaces.cpp:158:27: required from here /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::concepts::MultiPassInputIterator >*, std::vector >, std::allocator > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> >]’ 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ^ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::MultiPassInputIterator >*, std::vector >, std::allocator > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> >]’: /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/graph_concepts.hpp:89:9: required from ‘boost::concepts::IncidenceGraph::~IncidenceGraph() [with G = R_adjacency_list]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/graph_concepts.hpp:75:1: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::IncidenceGraphConcept >]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/depth_first_search.hpp:129:9: required from ‘void boost::detail::depth_first_visit_impl(const IncidenceGraph&, typename boost::graph_traits::vertex_descriptor, DFSVisitor&, ColorMap, TerminatorFunc) [with IncidenceGraph = R_adjacency_list; DFSVisitor = dfs_time_visitor; ColorMap = boost::shared_array_property_map, long unsigned int> >; TerminatorFunc = nontruth2; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/depth_first_search.hpp:286:39: required from ‘void boost::depth_first_search(const VertexListGraph&, DFSVisitor, ColorMap, typename graph_traits::vertex_descriptor) [with VertexListGraph = R_adjacency_list; DFSVisitor = dfs_time_visitor; ColorMap = shared_array_property_map, long unsigned int> >; typename graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/depth_first_search.hpp:397:42: required from ‘void boost::graph::detail::depth_first_search_impl::operator()(const Graph&, const ArgPack&) const [with ArgPack = boost::parameter::aux::arg_list >, boost::parameter::aux::empty_arg_list, std::integral_constant >; Graph = R_adjacency_list]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/depth_first_search.hpp:406:5: required from ‘typename boost::result_of(Param0, const ArgPack&)>::type boost::graph::depth_first_search_with_named_params(const Param0&, const ArgPack&) [with Param0 = R_adjacency_list; ArgPack = boost::parameter::aux::arg_list >, boost::parameter::aux::empty_arg_list, std::integral_constant >; typename boost::result_of(Param0, const ArgPack&)>::type = void]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/depth_first_search.hpp:409:1: required from ‘typename boost::result_of(Param0, const typename boost::detail::convert_bgl_params_to_boost_parameter >::type&)>::type boost::depth_first_search(const Param0&, const bgl_named_params&) [with Param0 = R_adjacency_list; P = dfs_time_visitor; T = graph_visitor_t; R = no_property; typename result_of(Param0, const typename detail::convert_bgl_params_to_boost_parameter >::type&)>::type = void; typename detail::convert_bgl_params_to_boost_parameter >::type = parameter::aux::arg_list >, parameter::aux::empty_arg_list, std::integral_constant >]’ interfaces.cpp:158:27: required from here /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::concepts::MultiPassInputIterator::~MultiPassInputIterator() [with T = boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator >*, std::vector >, std::allocator > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>]’ 37 | ~model() | ^ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/graph_concepts.hpp:52:50: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 52 | BOOST_concept(MultiPassInputIterator, (T)) { BOOST_CONCEPT_USAGE( | ^~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements > >]’: /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:137:5: required from ‘struct boost::DefaultConstructible >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::DefaultConstructible >]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied > >::value’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied > >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_ >)>’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/graph_concepts.hpp:90:9: [ skipping 2 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/depth_first_search.hpp:129:9: required from ‘void boost::detail::depth_first_visit_impl(const IncidenceGraph&, typename boost::graph_traits::vertex_descriptor, DFSVisitor&, ColorMap, TerminatorFunc) [with IncidenceGraph = R_adjacency_list; DFSVisitor = dfs_time_visitor; ColorMap = boost::shared_array_property_map, long unsigned int> >; TerminatorFunc = nontruth2; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/depth_first_search.hpp:286:39: required from ‘void boost::depth_first_search(const VertexListGraph&, DFSVisitor, ColorMap, typename graph_traits::vertex_descriptor) [with VertexListGraph = R_adjacency_list; DFSVisitor = dfs_time_visitor; ColorMap = shared_array_property_map, long unsigned int> >; typename graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/depth_first_search.hpp:397:42: required from ‘void boost::graph::detail::depth_first_search_impl::operator()(const Graph&, const ArgPack&) const [with ArgPack = boost::parameter::aux::arg_list >, boost::parameter::aux::empty_arg_list, std::integral_constant >; Graph = R_adjacency_list]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/depth_first_search.hpp:406:5: required from ‘typename boost::result_of(Param0, const ArgPack&)>::type boost::graph::depth_first_search_with_named_params(const Param0&, const ArgPack&) [with Param0 = R_adjacency_list; ArgPack = boost::parameter::aux::arg_list >, boost::parameter::aux::empty_arg_list, std::integral_constant >; typename boost::result_of(Param0, const ArgPack&)>::type = void]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/depth_first_search.hpp:409:1: required from ‘typename boost::result_of(Param0, const typename boost::detail::convert_bgl_params_to_boost_parameter >::type&)>::type boost::depth_first_search(const Param0&, const bgl_named_params&) [with Param0 = R_adjacency_list; P = dfs_time_visitor; T = graph_visitor_t; R = no_property; typename result_of(Param0, const typename detail::convert_bgl_params_to_boost_parameter >::type&)>::type = void; typename detail::convert_bgl_params_to_boost_parameter >::type = parameter::aux::arg_list >, parameter::aux::empty_arg_list, std::integral_constant >]’ interfaces.cpp:158:27: required from here /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::DefaultConstructible >]’ 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ^ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::DefaultConstructible >]’: /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/graph_concepts.hpp:90:9: required from ‘boost::concepts::IncidenceGraph::~IncidenceGraph() [with G = R_adjacency_list]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/graph_concepts.hpp:75:1: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::IncidenceGraphConcept >]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/depth_first_search.hpp:129:9: required from ‘void boost::detail::depth_first_visit_impl(const IncidenceGraph&, typename boost::graph_traits::vertex_descriptor, DFSVisitor&, ColorMap, TerminatorFunc) [with IncidenceGraph = R_adjacency_list; DFSVisitor = dfs_time_visitor; ColorMap = boost::shared_array_property_map, long unsigned int> >; TerminatorFunc = nontruth2; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/depth_first_search.hpp:286:39: required from ‘void boost::depth_first_search(const VertexListGraph&, DFSVisitor, ColorMap, typename graph_traits::vertex_descriptor) [with VertexListGraph = R_adjacency_list; DFSVisitor = dfs_time_visitor; ColorMap = shared_array_property_map, long unsigned int> >; typename graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/depth_first_search.hpp:397:42: required from ‘void boost::graph::detail::depth_first_search_impl::operator()(const Graph&, const ArgPack&) const [with ArgPack = boost::parameter::aux::arg_list >, boost::parameter::aux::empty_arg_list, std::integral_constant >; Graph = R_adjacency_list]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/depth_first_search.hpp:406:5: required from ‘typename boost::result_of(Param0, const ArgPack&)>::type boost::graph::depth_first_search_with_named_params(const Param0&, const ArgPack&) [with Param0 = R_adjacency_list; ArgPack = boost::parameter::aux::arg_list >, boost::parameter::aux::empty_arg_list, std::integral_constant >; typename boost::result_of(Param0, const ArgPack&)>::type = void]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/depth_first_search.hpp:409:1: required from ‘typename boost::result_of(Param0, const typename boost::detail::convert_bgl_params_to_boost_parameter >::type&)>::type boost::depth_first_search(const Param0&, const bgl_named_params&) [with Param0 = R_adjacency_list; P = dfs_time_visitor; T = graph_visitor_t; R = no_property; typename result_of(Param0, const typename detail::convert_bgl_params_to_boost_parameter >::type&)>::type = void; typename detail::convert_bgl_params_to_boost_parameter >::type = parameter::aux::arg_list >, parameter::aux::empty_arg_list, std::integral_constant >]’ interfaces.cpp:158:27: required from here /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::DefaultConstructible::~DefaultConstructible() [with TT = boost::detail::edge_desc_impl]’ 37 | ~model() | ^ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:137:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 137 | BOOST_CONCEPT_USAGE(DefaultConstructible) { | ^~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements > >]’: /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:233:5: required from ‘struct boost::EqualityComparable >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::EqualityComparable >]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied > >::value’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied > >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_ >)>’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/graph_concepts.hpp:91:9: [ skipping 2 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/depth_first_search.hpp:129:9: required from ‘void boost::detail::depth_first_visit_impl(const IncidenceGraph&, typename boost::graph_traits::vertex_descriptor, DFSVisitor&, ColorMap, TerminatorFunc) [with IncidenceGraph = R_adjacency_list; DFSVisitor = dfs_time_visitor; ColorMap = boost::shared_array_property_map, long unsigned int> >; TerminatorFunc = nontruth2; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/depth_first_search.hpp:286:39: required from ‘void boost::depth_first_search(const VertexListGraph&, DFSVisitor, ColorMap, typename graph_traits::vertex_descriptor) [with VertexListGraph = R_adjacency_list; DFSVisitor = dfs_time_visitor; ColorMap = shared_array_property_map, long unsigned int> >; typename graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/depth_first_search.hpp:397:42: required from ‘void boost::graph::detail::depth_first_search_impl::operator()(const Graph&, const ArgPack&) const [with ArgPack = boost::parameter::aux::arg_list >, boost::parameter::aux::empty_arg_list, std::integral_constant >; Graph = R_adjacency_list]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/depth_first_search.hpp:406:5: required from ‘typename boost::result_of(Param0, const ArgPack&)>::type boost::graph::depth_first_search_with_named_params(const Param0&, const ArgPack&) [with Param0 = R_adjacency_list; ArgPack = boost::parameter::aux::arg_list >, boost::parameter::aux::empty_arg_list, std::integral_constant >; typename boost::result_of(Param0, const ArgPack&)>::type = void]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/depth_first_search.hpp:409:1: required from ‘typename boost::result_of(Param0, const typename boost::detail::convert_bgl_params_to_boost_parameter >::type&)>::type boost::depth_first_search(const Param0&, const bgl_named_params&) [with Param0 = R_adjacency_list; P = dfs_time_visitor; T = graph_visitor_t; R = no_property; typename result_of(Param0, const typename detail::convert_bgl_params_to_boost_parameter >::type&)>::type = void; typename detail::convert_bgl_params_to_boost_parameter >::type = parameter::aux::arg_list >, parameter::aux::empty_arg_list, std::integral_constant >]’ interfaces.cpp:158:27: required from here /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::EqualityComparable >]’ 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ^ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::EqualityComparable >]’: /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/graph_concepts.hpp:91:9: required from ‘boost::concepts::IncidenceGraph::~IncidenceGraph() [with G = R_adjacency_list]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/graph_concepts.hpp:75:1: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::IncidenceGraphConcept >]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/depth_first_search.hpp:129:9: required from ‘void boost::detail::depth_first_visit_impl(const IncidenceGraph&, typename boost::graph_traits::vertex_descriptor, DFSVisitor&, ColorMap, TerminatorFunc) [with IncidenceGraph = R_adjacency_list; DFSVisitor = dfs_time_visitor; ColorMap = boost::shared_array_property_map, long unsigned int> >; TerminatorFunc = nontruth2; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/depth_first_search.hpp:286:39: required from ‘void boost::depth_first_search(const VertexListGraph&, DFSVisitor, ColorMap, typename graph_traits::vertex_descriptor) [with VertexListGraph = R_adjacency_list; DFSVisitor = dfs_time_visitor; ColorMap = shared_array_property_map, long unsigned int> >; typename graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/depth_first_search.hpp:397:42: required from ‘void boost::graph::detail::depth_first_search_impl::operator()(const Graph&, const ArgPack&) const [with ArgPack = boost::parameter::aux::arg_list >, boost::parameter::aux::empty_arg_list, std::integral_constant >; Graph = R_adjacency_list]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/depth_first_search.hpp:406:5: required from ‘typename boost::result_of(Param0, const ArgPack&)>::type boost::graph::depth_first_search_with_named_params(const Param0&, const ArgPack&) [with Param0 = R_adjacency_list; ArgPack = boost::parameter::aux::arg_list >, boost::parameter::aux::empty_arg_list, std::integral_constant >; typename boost::result_of(Param0, const ArgPack&)>::type = void]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/depth_first_search.hpp:409:1: required from ‘typename boost::result_of(Param0, const typename boost::detail::convert_bgl_params_to_boost_parameter >::type&)>::type boost::depth_first_search(const Param0&, const bgl_named_params&) [with Param0 = R_adjacency_list; P = dfs_time_visitor; T = graph_visitor_t; R = no_property; typename result_of(Param0, const typename detail::convert_bgl_params_to_boost_parameter >::type&)>::type = void; typename detail::convert_bgl_params_to_boost_parameter >::type = parameter::aux::arg_list >, parameter::aux::empty_arg_list, std::integral_constant >]’ interfaces.cpp:158:27: required from here /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::EqualityComparable::~EqualityComparable() [with TT = boost::detail::edge_desc_impl]’ 37 | ~model() | ^ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:233:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 233 | BOOST_CONCEPT_USAGE(EqualityComparable) { | ^~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements > >]’: /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:145:5: required from ‘struct boost::Assignable >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::Assignable >]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied > >::value’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied > >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_ >)>’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/graph_concepts.hpp:92:9: [ skipping 2 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/depth_first_search.hpp:129:9: required from ‘void boost::detail::depth_first_visit_impl(const IncidenceGraph&, typename boost::graph_traits::vertex_descriptor, DFSVisitor&, ColorMap, TerminatorFunc) [with IncidenceGraph = R_adjacency_list; DFSVisitor = dfs_time_visitor; ColorMap = boost::shared_array_property_map, long unsigned int> >; TerminatorFunc = nontruth2; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/depth_first_search.hpp:286:39: required from ‘void boost::depth_first_search(const VertexListGraph&, DFSVisitor, ColorMap, typename graph_traits::vertex_descriptor) [with VertexListGraph = R_adjacency_list; DFSVisitor = dfs_time_visitor; ColorMap = shared_array_property_map, long unsigned int> >; typename graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/depth_first_search.hpp:397:42: required from ‘void boost::graph::detail::depth_first_search_impl::operator()(const Graph&, const ArgPack&) const [with ArgPack = boost::parameter::aux::arg_list >, boost::parameter::aux::empty_arg_list, std::integral_constant >; Graph = R_adjacency_list]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/depth_first_search.hpp:406:5: required from ‘typename boost::result_of(Param0, const ArgPack&)>::type boost::graph::depth_first_search_with_named_params(const Param0&, const ArgPack&) [with Param0 = R_adjacency_list; ArgPack = boost::parameter::aux::arg_list >, boost::parameter::aux::empty_arg_list, std::integral_constant >; typename boost::result_of(Param0, const ArgPack&)>::type = void]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/depth_first_search.hpp:409:1: required from ‘typename boost::result_of(Param0, const typename boost::detail::convert_bgl_params_to_boost_parameter >::type&)>::type boost::depth_first_search(const Param0&, const bgl_named_params&) [with Param0 = R_adjacency_list; P = dfs_time_visitor; T = graph_visitor_t; R = no_property; typename result_of(Param0, const typename detail::convert_bgl_params_to_boost_parameter >::type&)>::type = void; typename detail::convert_bgl_params_to_boost_parameter >::type = parameter::aux::arg_list >, parameter::aux::empty_arg_list, std::integral_constant >]’ interfaces.cpp:158:27: required from here /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::Assignable >]’ 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ^ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::Assignable >]’: /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/graph_concepts.hpp:92:9: required from ‘boost::concepts::IncidenceGraph::~IncidenceGraph() [with G = R_adjacency_list]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/graph_concepts.hpp:75:1: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::IncidenceGraphConcept >]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/depth_first_search.hpp:129:9: required from ‘void boost::detail::depth_first_visit_impl(const IncidenceGraph&, typename boost::graph_traits::vertex_descriptor, DFSVisitor&, ColorMap, TerminatorFunc) [with IncidenceGraph = R_adjacency_list; DFSVisitor = dfs_time_visitor; ColorMap = boost::shared_array_property_map, long unsigned int> >; TerminatorFunc = nontruth2; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/depth_first_search.hpp:286:39: required from ‘void boost::depth_first_search(const VertexListGraph&, DFSVisitor, ColorMap, typename graph_traits::vertex_descriptor) [with VertexListGraph = R_adjacency_list; DFSVisitor = dfs_time_visitor; ColorMap = shared_array_property_map, long unsigned int> >; typename graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/depth_first_search.hpp:397:42: required from ‘void boost::graph::detail::depth_first_search_impl::operator()(const Graph&, const ArgPack&) const [with ArgPack = boost::parameter::aux::arg_list >, boost::parameter::aux::empty_arg_list, std::integral_constant >; Graph = R_adjacency_list]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/depth_first_search.hpp:406:5: required from ‘typename boost::result_of(Param0, const ArgPack&)>::type boost::graph::depth_first_search_with_named_params(const Param0&, const ArgPack&) [with Param0 = R_adjacency_list; ArgPack = boost::parameter::aux::arg_list >, boost::parameter::aux::empty_arg_list, std::integral_constant >; typename boost::result_of(Param0, const ArgPack&)>::type = void]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/depth_first_search.hpp:409:1: required from ‘typename boost::result_of(Param0, const typename boost::detail::convert_bgl_params_to_boost_parameter >::type&)>::type boost::depth_first_search(const Param0&, const bgl_named_params&) [with Param0 = R_adjacency_list; P = dfs_time_visitor; T = graph_visitor_t; R = no_property; typename result_of(Param0, const typename detail::convert_bgl_params_to_boost_parameter >::type&)>::type = void; typename detail::convert_bgl_params_to_boost_parameter >::type = parameter::aux::arg_list >, parameter::aux::empty_arg_list, std::integral_constant >]’ interfaces.cpp:158:27: required from here /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::Assignable::~Assignable() [with TT = boost::detail::edge_desc_impl]’ 37 | ~model() | ^ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:145:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 145 | BOOST_CONCEPT_USAGE(Assignable) { | ^~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements >]’: /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:208:5: required from ‘struct boost::Convertible’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::Convertible]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied >::value’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_)>’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/graph_concepts.hpp:93:9: [ skipping 2 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/depth_first_search.hpp:129:9: required from ‘void boost::detail::depth_first_visit_impl(const IncidenceGraph&, typename boost::graph_traits::vertex_descriptor, DFSVisitor&, ColorMap, TerminatorFunc) [with IncidenceGraph = R_adjacency_list; DFSVisitor = dfs_time_visitor; ColorMap = boost::shared_array_property_map, long unsigned int> >; TerminatorFunc = nontruth2; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/depth_first_search.hpp:286:39: required from ‘void boost::depth_first_search(const VertexListGraph&, DFSVisitor, ColorMap, typename graph_traits::vertex_descriptor) [with VertexListGraph = R_adjacency_list; DFSVisitor = dfs_time_visitor; ColorMap = shared_array_property_map, long unsigned int> >; typename graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/depth_first_search.hpp:397:42: required from ‘void boost::graph::detail::depth_first_search_impl::operator()(const Graph&, const ArgPack&) const [with ArgPack = boost::parameter::aux::arg_list >, boost::parameter::aux::empty_arg_list, std::integral_constant >; Graph = R_adjacency_list]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/depth_first_search.hpp:406:5: required from ‘typename boost::result_of(Param0, const ArgPack&)>::type boost::graph::depth_first_search_with_named_params(const Param0&, const ArgPack&) [with Param0 = R_adjacency_list; ArgPack = boost::parameter::aux::arg_list >, boost::parameter::aux::empty_arg_list, std::integral_constant >; typename boost::result_of(Param0, const ArgPack&)>::type = void]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/depth_first_search.hpp:409:1: required from ‘typename boost::result_of(Param0, const typename boost::detail::convert_bgl_params_to_boost_parameter >::type&)>::type boost::depth_first_search(const Param0&, const bgl_named_params&) [with Param0 = R_adjacency_list; P = dfs_time_visitor; T = graph_visitor_t; R = no_property; typename result_of(Param0, const typename detail::convert_bgl_params_to_boost_parameter >::type&)>::type = void; typename detail::convert_bgl_params_to_boost_parameter >::type = parameter::aux::arg_list >, parameter::aux::empty_arg_list, std::integral_constant >]’ interfaces.cpp:158:27: required from here /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::Convertible]’ 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ^ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::Convertible]’: /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/graph_concepts.hpp:93:9: required from ‘boost::concepts::IncidenceGraph::~IncidenceGraph() [with G = R_adjacency_list]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/graph_concepts.hpp:75:1: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::IncidenceGraphConcept >]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/depth_first_search.hpp:129:9: required from ‘void boost::detail::depth_first_visit_impl(const IncidenceGraph&, typename boost::graph_traits::vertex_descriptor, DFSVisitor&, ColorMap, TerminatorFunc) [with IncidenceGraph = R_adjacency_list; DFSVisitor = dfs_time_visitor; ColorMap = boost::shared_array_property_map, long unsigned int> >; TerminatorFunc = nontruth2; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/depth_first_search.hpp:286:39: required from ‘void boost::depth_first_search(const VertexListGraph&, DFSVisitor, ColorMap, typename graph_traits::vertex_descriptor) [with VertexListGraph = R_adjacency_list; DFSVisitor = dfs_time_visitor; ColorMap = shared_array_property_map, long unsigned int> >; typename graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/depth_first_search.hpp:397:42: required from ‘void boost::graph::detail::depth_first_search_impl::operator()(const Graph&, const ArgPack&) const [with ArgPack = boost::parameter::aux::arg_list >, boost::parameter::aux::empty_arg_list, std::integral_constant >; Graph = R_adjacency_list]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/depth_first_search.hpp:406:5: required from ‘typename boost::result_of(Param0, const ArgPack&)>::type boost::graph::depth_first_search_with_named_params(const Param0&, const ArgPack&) [with Param0 = R_adjacency_list; ArgPack = boost::parameter::aux::arg_list >, boost::parameter::aux::empty_arg_list, std::integral_constant >; typename boost::result_of(Param0, const ArgPack&)>::type = void]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/depth_first_search.hpp:409:1: required from ‘typename boost::result_of(Param0, const typename boost::detail::convert_bgl_params_to_boost_parameter >::type&)>::type boost::depth_first_search(const Param0&, const bgl_named_params&) [with Param0 = R_adjacency_list; P = dfs_time_visitor; T = graph_visitor_t; R = no_property; typename result_of(Param0, const typename detail::convert_bgl_params_to_boost_parameter >::type&)>::type = void; typename detail::convert_bgl_params_to_boost_parameter >::type = parameter::aux::arg_list >, parameter::aux::empty_arg_list, std::integral_constant >]’ interfaces.cpp:158:27: required from here /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::Convertible::~Convertible() [with X = boost::adj_list_dir_traversal_tag; Y = boost::incidence_graph_tag]’ 37 | ~model() | ^ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:208:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 208 | BOOST_CONCEPT_USAGE(Convertible) { | ^~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements >]’: /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:208:5: required from ‘struct boost::Convertible’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:206:3: required from ‘struct boost::ConvertibleConcept’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::ConvertibleConcept]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied >::value’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:72:8: [ skipping 11 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/depth_first_search.hpp:134:9: required from ‘void boost::detail::depth_first_visit_impl(const IncidenceGraph&, typename boost::graph_traits::vertex_descriptor, DFSVisitor&, ColorMap, TerminatorFunc) [with IncidenceGraph = R_adjacency_list; DFSVisitor = dfs_time_visitor; ColorMap = boost::shared_array_property_map, long unsigned int> >; TerminatorFunc = nontruth2; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/depth_first_search.hpp:286:39: required from ‘void boost::depth_first_search(const VertexListGraph&, DFSVisitor, ColorMap, typename graph_traits::vertex_descriptor) [with VertexListGraph = R_adjacency_list; DFSVisitor = dfs_time_visitor; ColorMap = shared_array_property_map, long unsigned int> >; typename graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/depth_first_search.hpp:397:42: required from ‘void boost::graph::detail::depth_first_search_impl::operator()(const Graph&, const ArgPack&) const [with ArgPack = boost::parameter::aux::arg_list >, boost::parameter::aux::empty_arg_list, std::integral_constant >; Graph = R_adjacency_list]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/depth_first_search.hpp:406:5: required from ‘typename boost::result_of(Param0, const ArgPack&)>::type boost::graph::depth_first_search_with_named_params(const Param0&, const ArgPack&) [with Param0 = R_adjacency_list; ArgPack = boost::parameter::aux::arg_list >, boost::parameter::aux::empty_arg_list, std::integral_constant >; typename boost::result_of(Param0, const ArgPack&)>::type = void]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/depth_first_search.hpp:409:1: required from ‘typename boost::result_of(Param0, const typename boost::detail::convert_bgl_params_to_boost_parameter >::type&)>::type boost::depth_first_search(const Param0&, const bgl_named_params&) [with Param0 = R_adjacency_list; P = dfs_time_visitor; T = graph_visitor_t; R = no_property; typename result_of(Param0, const typename detail::convert_bgl_params_to_boost_parameter >::type&)>::type = void; typename detail::convert_bgl_params_to_boost_parameter >::type = parameter::aux::arg_list >, parameter::aux::empty_arg_list, std::integral_constant >]’ interfaces.cpp:158:27: required from here /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::Convertible]’ 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ^ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::ConvertibleConcept]’: /home/omnipath/local/R/4.4-3.20/BH/include/boost/property_map/property_map.hpp:148:7: required from ‘void boost::ReadablePropertyMapConcept::constraints() [with PMap = boost::shared_array_property_map, long unsigned int> >; Key = long unsigned int]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::ReadablePropertyMapConcept, long unsigned int> >, long unsigned int>]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied, long unsigned int> >, long unsigned int> >::value’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied, long unsigned int> >, long unsigned int> >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_, long unsigned int> >, long unsigned int>)>’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/property_map/property_map.hpp:206:7: [ skipping 5 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/depth_first_search.hpp:134:9: required from ‘void boost::detail::depth_first_visit_impl(const IncidenceGraph&, typename boost::graph_traits::vertex_descriptor, DFSVisitor&, ColorMap, TerminatorFunc) [with IncidenceGraph = R_adjacency_list; DFSVisitor = dfs_time_visitor; ColorMap = boost::shared_array_property_map, long unsigned int> >; TerminatorFunc = nontruth2; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/depth_first_search.hpp:286:39: required from ‘void boost::depth_first_search(const VertexListGraph&, DFSVisitor, ColorMap, typename graph_traits::vertex_descriptor) [with VertexListGraph = R_adjacency_list; DFSVisitor = dfs_time_visitor; ColorMap = shared_array_property_map, long unsigned int> >; typename graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/depth_first_search.hpp:397:42: required from ‘void boost::graph::detail::depth_first_search_impl::operator()(const Graph&, const ArgPack&) const [with ArgPack = boost::parameter::aux::arg_list >, boost::parameter::aux::empty_arg_list, std::integral_constant >; Graph = R_adjacency_list]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/depth_first_search.hpp:406:5: required from ‘typename boost::result_of(Param0, const ArgPack&)>::type boost::graph::depth_first_search_with_named_params(const Param0&, const ArgPack&) [with Param0 = R_adjacency_list; ArgPack = boost::parameter::aux::arg_list >, boost::parameter::aux::empty_arg_list, std::integral_constant >; typename boost::result_of(Param0, const ArgPack&)>::type = void]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/depth_first_search.hpp:409:1: required from ‘typename boost::result_of(Param0, const typename boost::detail::convert_bgl_params_to_boost_parameter >::type&)>::type boost::depth_first_search(const Param0&, const bgl_named_params&) [with Param0 = R_adjacency_list; P = dfs_time_visitor; T = graph_visitor_t; R = no_property; typename result_of(Param0, const typename detail::convert_bgl_params_to_boost_parameter >::type&)>::type = void; typename detail::convert_bgl_params_to_boost_parameter >::type = parameter::aux::arg_list >, parameter::aux::empty_arg_list, std::integral_constant >]’ interfaces.cpp:158:27: required from here /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:206:17: note: in a call to non-static member function ‘boost::ConvertibleConcept::~ConvertibleConcept()’ 206 | BOOST_concept(Convertible,(X)(Y)) | ^~~~~~~~~~~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/preprocessor/cat.hpp:29:34: note: in definition of macro ‘BOOST_PP_CAT_I’ 29 | # define BOOST_PP_CAT_I(a, b) a ## b | ^ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/concept_def.hpp:23:12: note: in expansion of macro ‘BOOST_PP_CAT’ 23 | struct BOOST_PP_CAT(name,Concept) \ | ^~~~~~~~~~~~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:206:3: note: in expansion of macro ‘BOOST_concept’ 206 | BOOST_concept(Convertible,(X)(Y)) | ^~~~~~~~~~~~~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::Convertible]’: /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements >]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:208:5: required from ‘struct boost::Convertible’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:206:3: required from ‘struct boost::ConvertibleConcept’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::ConvertibleConcept]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied >::value’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:45:51: [ skipping 7 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/depth_first_search.hpp:134:9: required from ‘void boost::detail::depth_first_visit_impl(const IncidenceGraph&, typename boost::graph_traits::vertex_descriptor, DFSVisitor&, ColorMap, TerminatorFunc) [with IncidenceGraph = R_adjacency_list; DFSVisitor = dfs_time_visitor; ColorMap = boost::shared_array_property_map, long unsigned int> >; TerminatorFunc = nontruth2; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/depth_first_search.hpp:286:39: required from ‘void boost::depth_first_search(const VertexListGraph&, DFSVisitor, ColorMap, typename graph_traits::vertex_descriptor) [with VertexListGraph = R_adjacency_list; DFSVisitor = dfs_time_visitor; ColorMap = shared_array_property_map, long unsigned int> >; typename graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/depth_first_search.hpp:397:42: required from ‘void boost::graph::detail::depth_first_search_impl::operator()(const Graph&, const ArgPack&) const [with ArgPack = boost::parameter::aux::arg_list >, boost::parameter::aux::empty_arg_list, std::integral_constant >; Graph = R_adjacency_list]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/depth_first_search.hpp:406:5: required from ‘typename boost::result_of(Param0, const ArgPack&)>::type boost::graph::depth_first_search_with_named_params(const Param0&, const ArgPack&) [with Param0 = R_adjacency_list; ArgPack = boost::parameter::aux::arg_list >, boost::parameter::aux::empty_arg_list, std::integral_constant >; typename boost::result_of(Param0, const ArgPack&)>::type = void]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/depth_first_search.hpp:409:1: required from ‘typename boost::result_of(Param0, const typename boost::detail::convert_bgl_params_to_boost_parameter >::type&)>::type boost::depth_first_search(const Param0&, const bgl_named_params&) [with Param0 = R_adjacency_list; P = dfs_time_visitor; T = graph_visitor_t; R = no_property; typename result_of(Param0, const typename detail::convert_bgl_params_to_boost_parameter >::type&)>::type = void; typename detail::convert_bgl_params_to_boost_parameter >::type = parameter::aux::arg_list >, parameter::aux::empty_arg_list, std::integral_constant >]’ interfaces.cpp:158:27: required from here /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::Convertible::~Convertible() [with X = boost::lvalue_property_map_tag; Y = boost::read_write_property_map_tag]’ 37 | ~model() | ^ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:208:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 208 | BOOST_CONCEPT_USAGE(Convertible) { | ^~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::CopyConstructible >]’: /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements > >]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:167:5: required from ‘struct boost::CopyConstructible >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:165:3: required from ‘struct boost::CopyConstructibleConcept >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::CopyConstructibleConcept >]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied > >::value’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:45:51: [ skipping 7 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/depth_first_search.hpp:130:9: required from ‘void boost::depth_first_search(const VertexListGraph&, DFSVisitor, ColorMap, typename graph_traits::vertex_descriptor) [with VertexListGraph = R_adjacency_list; DFSVisitor = detail::components_recorder; ColorMap = shared_array_property_map, long unsigned int> >; typename graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/depth_first_search.hpp:397:42: required from ‘void boost::graph::detail::depth_first_search_impl::operator()(const Graph&, const ArgPack&) const [with ArgPack = boost::parameter::aux::arg_list >, boost::parameter::aux::empty_arg_list, std::integral_constant >; Graph = R_adjacency_list]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/depth_first_search.hpp:406:5: required from ‘typename boost::result_of(Param0, const ArgPack&)>::type boost::graph::depth_first_search_with_named_params(const Param0&, const ArgPack&) [with Param0 = R_adjacency_list; ArgPack = boost::parameter::aux::arg_list >, boost::parameter::aux::empty_arg_list, std::integral_constant >; typename boost::result_of(Param0, const ArgPack&)>::type = void]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/depth_first_search.hpp:409:1: required from ‘typename boost::result_of(Param0, const typename boost::detail::convert_bgl_params_to_boost_parameter >::type&)>::type boost::depth_first_search(const Param0&, const bgl_named_params&) [with Param0 = R_adjacency_list; P = detail::components_recorder; T = graph_visitor_t; R = no_property; typename result_of(Param0, const typename detail::convert_bgl_params_to_boost_parameter >::type&)>::type = void; typename detail::convert_bgl_params_to_boost_parameter >::type = parameter::aux::arg_list >, parameter::aux::empty_arg_list, std::integral_constant >]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/connected_components.hpp:106:23: required from ‘typename boost::property_traits::value_type boost::connected_components(const Graph&, ComponentMap, typename enable_if_c::traversal_category>::value, graph::detail::no_parameter>::type) [with Graph = R_adjacency_list; ComponentMap = int*; typename property_traits::value_type = int; typename enable_if_c::traversal_category>::value, graph::detail::no_parameter>::type = graph::detail::no_parameter; typename graph_traits::traversal_category = undir_adj_list_traversal_tag]’ interfaces.cpp:205:29: required from here /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::CopyConstructible::~CopyConstructible() [with TT = boost::detail::components_recorder]’ 37 | ~model() | ^ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:167:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 167 | BOOST_CONCEPT_USAGE(CopyConstructible) { | ^~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::concepts::Graph >]’: /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements > >]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/graph_concepts.hpp:66:5: required from ‘struct boost::concepts::Graph >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/graph_concepts.hpp:75:1: required from ‘struct boost::concepts::IncidenceGraph >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/graph_concepts.hpp:75:1: required from ‘struct boost::concepts::IncidenceGraphConcept >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::concepts::IncidenceGraphConcept >]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:42:5: [ skipping 4 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/depth_first_search.hpp:286:39: required from ‘void boost::depth_first_search(const VertexListGraph&, DFSVisitor, ColorMap, typename graph_traits::vertex_descriptor) [with VertexListGraph = R_adjacency_list; DFSVisitor = detail::components_recorder; ColorMap = shared_array_property_map, long unsigned int> >; typename graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/depth_first_search.hpp:397:42: required from ‘void boost::graph::detail::depth_first_search_impl::operator()(const Graph&, const ArgPack&) const [with ArgPack = boost::parameter::aux::arg_list >, boost::parameter::aux::empty_arg_list, std::integral_constant >; Graph = R_adjacency_list]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/depth_first_search.hpp:406:5: required from ‘typename boost::result_of(Param0, const ArgPack&)>::type boost::graph::depth_first_search_with_named_params(const Param0&, const ArgPack&) [with Param0 = R_adjacency_list; ArgPack = boost::parameter::aux::arg_list >, boost::parameter::aux::empty_arg_list, std::integral_constant >; typename boost::result_of(Param0, const ArgPack&)>::type = void]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/depth_first_search.hpp:409:1: required from ‘typename boost::result_of(Param0, const typename boost::detail::convert_bgl_params_to_boost_parameter >::type&)>::type boost::depth_first_search(const Param0&, const bgl_named_params&) [with Param0 = R_adjacency_list; P = detail::components_recorder; T = graph_visitor_t; R = no_property; typename result_of(Param0, const typename detail::convert_bgl_params_to_boost_parameter >::type&)>::type = void; typename detail::convert_bgl_params_to_boost_parameter >::type = parameter::aux::arg_list >, parameter::aux::empty_arg_list, std::integral_constant >]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/connected_components.hpp:106:23: required from ‘typename boost::property_traits::value_type boost::connected_components(const Graph&, ComponentMap, typename enable_if_c::traversal_category>::value, graph::detail::no_parameter>::type) [with Graph = R_adjacency_list; ComponentMap = int*; typename property_traits::value_type = int; typename enable_if_c::traversal_category>::value, graph::detail::no_parameter>::type = graph::detail::no_parameter; typename graph_traits::traversal_category = undir_adj_list_traversal_tag]’ interfaces.cpp:205:29: required from here /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::concepts::Graph::~Graph() [with G = R_adjacency_list]’ 37 | ~model() | ^ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/graph_concepts.hpp:66:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 66 | BOOST_CONCEPT_USAGE(Graph) | ^~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::concepts::IncidenceGraph >]’: /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements > >]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/graph_concepts.hpp:87:5: required from ‘struct boost::concepts::IncidenceGraph >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/graph_concepts.hpp:75:1: required from ‘struct boost::concepts::IncidenceGraphConcept >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::concepts::IncidenceGraphConcept >]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied > >::value’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:45:51: [ skipping 3 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/depth_first_search.hpp:286:39: required from ‘void boost::depth_first_search(const VertexListGraph&, DFSVisitor, ColorMap, typename graph_traits::vertex_descriptor) [with VertexListGraph = R_adjacency_list; DFSVisitor = detail::components_recorder; ColorMap = shared_array_property_map, long unsigned int> >; typename graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/depth_first_search.hpp:397:42: required from ‘void boost::graph::detail::depth_first_search_impl::operator()(const Graph&, const ArgPack&) const [with ArgPack = boost::parameter::aux::arg_list >, boost::parameter::aux::empty_arg_list, std::integral_constant >; Graph = R_adjacency_list]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/depth_first_search.hpp:406:5: required from ‘typename boost::result_of(Param0, const ArgPack&)>::type boost::graph::depth_first_search_with_named_params(const Param0&, const ArgPack&) [with Param0 = R_adjacency_list; ArgPack = boost::parameter::aux::arg_list >, boost::parameter::aux::empty_arg_list, std::integral_constant >; typename boost::result_of(Param0, const ArgPack&)>::type = void]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/depth_first_search.hpp:409:1: required from ‘typename boost::result_of(Param0, const typename boost::detail::convert_bgl_params_to_boost_parameter >::type&)>::type boost::depth_first_search(const Param0&, const bgl_named_params&) [with Param0 = R_adjacency_list; P = detail::components_recorder; T = graph_visitor_t; R = no_property; typename result_of(Param0, const typename detail::convert_bgl_params_to_boost_parameter >::type&)>::type = void; typename detail::convert_bgl_params_to_boost_parameter >::type = parameter::aux::arg_list >, parameter::aux::empty_arg_list, std::integral_constant >]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/connected_components.hpp:106:23: required from ‘typename boost::property_traits::value_type boost::connected_components(const Graph&, ComponentMap, typename enable_if_c::traversal_category>::value, graph::detail::no_parameter>::type) [with Graph = R_adjacency_list; ComponentMap = int*; typename property_traits::value_type = int; typename enable_if_c::traversal_category>::value, graph::detail::no_parameter>::type = graph::detail::no_parameter; typename graph_traits::traversal_category = undir_adj_list_traversal_tag]’ interfaces.cpp:205:29: required from here /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::concepts::IncidenceGraph::~IncidenceGraph() [with G = R_adjacency_list]’ 37 | ~model() | ^ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/graph_concepts.hpp:87:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 87 | BOOST_CONCEPT_USAGE(IncidenceGraph) | ^~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::constraint::failed() [with Model = boost::ReadWritePropertyMapConcept]’: /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/strong_components.hpp:115:9: required from ‘typename boost::property_traits::value_type boost::detail::strong_components_impl(const Graph&, ComponentMap, RootMap, DiscoverTime, const boost::bgl_named_params&) [with Graph = R_adjacency_list; ComponentMap = int*; RootMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>; DiscoverTime = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>; P = int; T = int; R = boost::no_property; typename boost::property_traits::value_type = int]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/strong_components.hpp:162:42: required from ‘static typename boost::property_traits::value_type boost::detail::strong_comp_dispatch2::apply(const Graph&, ComponentMap, RootMap, const boost::bgl_named_params&, boost::param_not_found) [with Graph = R_adjacency_list; ComponentMap = int*; RootMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>; P = int; T = int; R = boost::no_property; typename boost::property_traits::value_type = int]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/strong_components.hpp:177:63: required from ‘typename boost::property_traits::value_type boost::detail::scc_helper2(const Graph&, ComponentMap, RootMap, const boost::bgl_named_params&, DiscoverTimeMap) [with Graph = R_adjacency_list; ComponentMap = int*; RootMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>; P = int; T = int; R = boost::no_property; DiscoverTimeMap = boost::param_not_found; typename boost::property_traits::value_type = int]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/strong_components.hpp:205:31: required from ‘static typename boost::property_traits::value_type boost::detail::strong_comp_dispatch1::apply(const Graph&, ComponentMap, const boost::bgl_named_params&, boost::param_not_found) [with Graph = R_adjacency_list; ComponentMap = int*; P = int; T = int; R = boost::no_property; typename boost::property_traits::value_type = int]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/strong_components.hpp:220:63: required from ‘typename boost::property_traits::value_type boost::detail::scc_helper1(const Graph&, ComponentMap, const boost::bgl_named_params&, RootMap) [with Graph = R_adjacency_list; ComponentMap = int*; RootMap = boost::param_not_found; P = int; T = int; R = boost::no_property; typename boost::property_traits::value_type = int]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/strong_components.hpp:235:31: required from ‘typename boost::property_traits::value_type boost::strong_components(const Graph&, ComponentMap, const bgl_named_params&, typename enable_if_c::traversal_category>::value, graph::detail::no_parameter>::type) [with Graph = R_adjacency_list; ComponentMap = int*; P = int; T = int; R = no_property; typename property_traits::value_type = int; typename enable_if_c::traversal_category>::value, graph::detail::no_parameter>::type = graph::detail::no_parameter; typename graph_traits::traversal_category = adj_list_dir_traversal_tag]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/strong_components.hpp:249:29: required from ‘typename boost::property_traits::value_type boost::strong_components(const Graph&, ComponentMap, typename enable_if_c::traversal_category>::value, graph::detail::no_parameter>::type) [with Graph = R_adjacency_list; ComponentMap = int*; typename property_traits::value_type = int; typename enable_if_c::traversal_category>::value, graph::detail::no_parameter>::type = graph::detail::no_parameter; typename graph_traits::traversal_category = adj_list_dir_traversal_tag]’ interfaces.cpp:232:26: required from here /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:65:52: warning: ‘this’ pointer is null [-Wnonnull] 65 | static void failed() { ((Model*)0)->constraints(); } | ~~~~~~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/property_map/property_map.hpp:205:10: note: in a call to non-static member function ‘void boost::ReadWritePropertyMapConcept::constraints() [with PMap = int*; Key = long unsigned int]’ 205 | void constraints() { | ^~~~~~~~~~~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements >]’: /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:208:5: required from ‘struct boost::Convertible’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:206:3: required from ‘struct boost::ConvertibleConcept’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::ConvertibleConcept]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied >::value’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:72:8: [ skipping 3 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/strong_components.hpp:177:63: required from ‘typename boost::property_traits::value_type boost::detail::scc_helper2(const Graph&, ComponentMap, RootMap, const boost::bgl_named_params&, DiscoverTimeMap) [with Graph = R_adjacency_list; ComponentMap = int*; RootMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>; P = int; T = int; R = boost::no_property; DiscoverTimeMap = boost::param_not_found; typename boost::property_traits::value_type = int]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/strong_components.hpp:205:31: required from ‘static typename boost::property_traits::value_type boost::detail::strong_comp_dispatch1::apply(const Graph&, ComponentMap, const boost::bgl_named_params&, boost::param_not_found) [with Graph = R_adjacency_list; ComponentMap = int*; P = int; T = int; R = boost::no_property; typename boost::property_traits::value_type = int]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/strong_components.hpp:220:63: required from ‘typename boost::property_traits::value_type boost::detail::scc_helper1(const Graph&, ComponentMap, const boost::bgl_named_params&, RootMap) [with Graph = R_adjacency_list; ComponentMap = int*; RootMap = boost::param_not_found; P = int; T = int; R = boost::no_property; typename boost::property_traits::value_type = int]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/strong_components.hpp:235:31: required from ‘typename boost::property_traits::value_type boost::strong_components(const Graph&, ComponentMap, const bgl_named_params&, typename enable_if_c::traversal_category>::value, graph::detail::no_parameter>::type) [with Graph = R_adjacency_list; ComponentMap = int*; P = int; T = int; R = no_property; typename property_traits::value_type = int; typename enable_if_c::traversal_category>::value, graph::detail::no_parameter>::type = graph::detail::no_parameter; typename graph_traits::traversal_category = adj_list_dir_traversal_tag]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/strong_components.hpp:249:29: required from ‘typename boost::property_traits::value_type boost::strong_components(const Graph&, ComponentMap, typename enable_if_c::traversal_category>::value, graph::detail::no_parameter>::type) [with Graph = R_adjacency_list; ComponentMap = int*; typename property_traits::value_type = int; typename enable_if_c::traversal_category>::value, graph::detail::no_parameter>::type = graph::detail::no_parameter; typename graph_traits::traversal_category = adj_list_dir_traversal_tag]’ interfaces.cpp:232:26: required from here /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::Convertible]’ 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ^ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::ConvertibleConcept]’: /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/strong_components.hpp:119:9: required from ‘typename boost::property_traits::value_type boost::detail::strong_components_impl(const Graph&, ComponentMap, RootMap, DiscoverTime, const boost::bgl_named_params&) [with Graph = R_adjacency_list; ComponentMap = int*; RootMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>; DiscoverTime = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>; P = int; T = int; R = boost::no_property; typename boost::property_traits::value_type = int]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/strong_components.hpp:162:42: required from ‘static typename boost::property_traits::value_type boost::detail::strong_comp_dispatch2::apply(const Graph&, ComponentMap, RootMap, const boost::bgl_named_params&, boost::param_not_found) [with Graph = R_adjacency_list; ComponentMap = int*; RootMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>; P = int; T = int; R = boost::no_property; typename boost::property_traits::value_type = int]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/strong_components.hpp:177:63: required from ‘typename boost::property_traits::value_type boost::detail::scc_helper2(const Graph&, ComponentMap, RootMap, const boost::bgl_named_params&, DiscoverTimeMap) [with Graph = R_adjacency_list; ComponentMap = int*; RootMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>; P = int; T = int; R = boost::no_property; DiscoverTimeMap = boost::param_not_found; typename boost::property_traits::value_type = int]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/strong_components.hpp:205:31: required from ‘static typename boost::property_traits::value_type boost::detail::strong_comp_dispatch1::apply(const Graph&, ComponentMap, const boost::bgl_named_params&, boost::param_not_found) [with Graph = R_adjacency_list; ComponentMap = int*; P = int; T = int; R = boost::no_property; typename boost::property_traits::value_type = int]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/strong_components.hpp:220:63: required from ‘typename boost::property_traits::value_type boost::detail::scc_helper1(const Graph&, ComponentMap, const boost::bgl_named_params&, RootMap) [with Graph = R_adjacency_list; ComponentMap = int*; RootMap = boost::param_not_found; P = int; T = int; R = boost::no_property; typename boost::property_traits::value_type = int]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/strong_components.hpp:235:31: required from ‘typename boost::property_traits::value_type boost::strong_components(const Graph&, ComponentMap, const bgl_named_params&, typename enable_if_c::traversal_category>::value, graph::detail::no_parameter>::type) [with Graph = R_adjacency_list; ComponentMap = int*; P = int; T = int; R = no_property; typename property_traits::value_type = int; typename enable_if_c::traversal_category>::value, graph::detail::no_parameter>::type = graph::detail::no_parameter; typename graph_traits::traversal_category = adj_list_dir_traversal_tag]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/strong_components.hpp:249:29: required from ‘typename boost::property_traits::value_type boost::strong_components(const Graph&, ComponentMap, typename enable_if_c::traversal_category>::value, graph::detail::no_parameter>::type) [with Graph = R_adjacency_list; ComponentMap = int*; typename property_traits::value_type = int; typename enable_if_c::traversal_category>::value, graph::detail::no_parameter>::type = graph::detail::no_parameter; typename graph_traits::traversal_category = adj_list_dir_traversal_tag]’ interfaces.cpp:232:26: required from here /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:206:17: note: in a call to non-static member function ‘boost::ConvertibleConcept::~ConvertibleConcept()’ 206 | BOOST_concept(Convertible,(X)(Y)) | ^~~~~~~~~~~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/preprocessor/cat.hpp:29:34: note: in definition of macro ‘BOOST_PP_CAT_I’ 29 | # define BOOST_PP_CAT_I(a, b) a ## b | ^ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/concept_def.hpp:23:12: note: in expansion of macro ‘BOOST_PP_CAT’ 23 | struct BOOST_PP_CAT(name,Concept) \ | ^~~~~~~~~~~~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:206:3: note: in expansion of macro ‘BOOST_concept’ 206 | BOOST_concept(Convertible,(X)(Y)) | ^~~~~~~~~~~~~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::constraint::failed() [with Model = boost::WritablePropertyMapConcept, boost::edge_weight_t>, boost::detail::edge_desc_impl >]’: /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/biconnected_components.hpp:190:9: required from ‘std::pair boost::detail::biconnected_components_impl(const Graph&, ComponentMap, OutputIterator, VertexIndexMap, DiscoverTimeMap, LowPointMap, PredecessorMap, DFSVisitor) [with Graph = R_adjacency_list; ComponentMap = boost::adj_list_edge_property_map, boost::edge_weight_t>; OutputIterator = boost::graph_detail::dummy_output_iterator; VertexIndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>; DiscoverTimeMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>; LowPointMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>; PredecessorMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>; DFSVisitor = boost::dfs_visitor<>]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/biconnected_components.hpp:250:47: required from ‘static std::pair boost::detail::bicomp_dispatch3::apply(const Graph&, ComponentMap, OutputIterator, VertexIndexMap, DiscoverTimeMap, LowPointMap, const boost::bgl_named_params&, boost::param_not_found) [with Graph = R_adjacency_list; ComponentMap = boost::adj_list_edge_property_map, boost::edge_weight_t>; OutputIterator = boost::graph_detail::dummy_output_iterator; VertexIndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>; DiscoverTimeMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>; LowPointMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>; P = int; T = boost::buffer_param_t; R = boost::no_property]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/biconnected_components.hpp:295:60: required from ‘static std::pair boost::detail::bicomp_dispatch2::apply(const Graph&, ComponentMap, OutputIterator, VertexIndexMap, DiscoverTimeMap, const boost::bgl_named_params&, boost::param_not_found) [with Graph = R_adjacency_list; ComponentMap = boost::adj_list_edge_property_map, boost::edge_weight_t>; OutputIterator = boost::graph_detail::dummy_output_iterator; VertexIndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>; DiscoverTimeMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>; P = int; T = boost::buffer_param_t; R = boost::no_property]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/biconnected_components.hpp:336:60: required from ‘static std::pair boost::detail::bicomp_dispatch1::apply(const Graph&, ComponentMap, OutputIterator, VertexIndexMap, const boost::bgl_named_params&, boost::param_not_found) [with Graph = R_adjacency_list; ComponentMap = boost::adj_list_edge_property_map, boost::edge_weight_t>; OutputIterator = boost::graph_detail::dummy_output_iterator; VertexIndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>; P = int; T = boost::buffer_param_t; R = boost::no_property]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/biconnected_components.hpp:368:60: required from ‘std::pair boost::biconnected_components(const Graph&, ComponentMap, OutputIterator, const bgl_named_params&) [with Graph = R_adjacency_list; ComponentMap = adj_list_edge_property_map, edge_weight_t>; OutputIterator = graph_detail::dummy_output_iterator; P = int; T = buffer_param_t; R = no_property]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/biconnected_components.hpp:377:34: required from ‘std::pair boost::biconnected_components(const Graph&, ComponentMap, OutputIterator) [with Graph = R_adjacency_list; ComponentMap = adj_list_edge_property_map, edge_weight_t>; OutputIterator = graph_detail::dummy_output_iterator]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/biconnected_components.hpp:417:34: required from ‘std::size_t boost::biconnected_components(const Graph&, ComponentMap) [with Graph = R_adjacency_list; ComponentMap = adj_list_edge_property_map, edge_weight_t>; std::size_t = long unsigned int]’ interfaces.cpp:264:47: required from here /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:65:52: warning: ‘this’ pointer is null [-Wnonnull] 65 | static void failed() { ((Model*)0)->constraints(); } | ~~~~~~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/property_map/property_map.hpp:179:10: note: in a call to non-static member function ‘void boost::WritablePropertyMapConcept::constraints() [with PMap = boost::adj_list_edge_property_map, boost::edge_weight_t>; Key = boost::detail::edge_desc_impl]’ 179 | void constraints() { | ^~~~~~~~~~~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::concepts::VertexListGraph >]’: /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements > >]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/graph_concepts.hpp:182:5: required from ‘struct boost::concepts::VertexListGraph >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/graph_concepts.hpp:176:1: required from ‘struct boost::concepts::VertexListGraphConcept >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::concepts::VertexListGraphConcept >]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied > >::value’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:45:51: [ skipping 3 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/biconnected_components.hpp:250:47: required from ‘static std::pair boost::detail::bicomp_dispatch3::apply(const Graph&, ComponentMap, OutputIterator, VertexIndexMap, DiscoverTimeMap, LowPointMap, const boost::bgl_named_params&, boost::param_not_found) [with Graph = R_adjacency_list; ComponentMap = boost::dummy_property_map; OutputIterator = std::back_insert_iterator >; VertexIndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>; DiscoverTimeMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>; LowPointMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>; P = int; T = boost::buffer_param_t; R = boost::no_property]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/biconnected_components.hpp:295:60: required from ‘static std::pair boost::detail::bicomp_dispatch2::apply(const Graph&, ComponentMap, OutputIterator, VertexIndexMap, DiscoverTimeMap, const boost::bgl_named_params&, boost::param_not_found) [with Graph = R_adjacency_list; ComponentMap = boost::dummy_property_map; OutputIterator = std::back_insert_iterator >; VertexIndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>; DiscoverTimeMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>; P = int; T = boost::buffer_param_t; R = boost::no_property]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/biconnected_components.hpp:336:60: required from ‘static std::pair boost::detail::bicomp_dispatch1::apply(const Graph&, ComponentMap, OutputIterator, VertexIndexMap, const boost::bgl_named_params&, boost::param_not_found) [with Graph = R_adjacency_list; ComponentMap = boost::dummy_property_map; OutputIterator = std::back_insert_iterator >; VertexIndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>; P = int; T = boost::buffer_param_t; R = boost::no_property]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/biconnected_components.hpp:368:60: required from ‘std::pair boost::biconnected_components(const Graph&, ComponentMap, OutputIterator, const bgl_named_params&) [with Graph = R_adjacency_list; ComponentMap = dummy_property_map; OutputIterator = std::back_insert_iterator >; P = int; T = buffer_param_t; R = no_property]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/biconnected_components.hpp:433:34: required from ‘OutputIterator boost::articulation_points(const Graph&, OutputIterator) [with Graph = R_adjacency_list; OutputIterator = std::back_insert_iterator >]’ interfaces.cpp:300:28: required from here /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::concepts::VertexListGraph::~VertexListGraph() [with G = R_adjacency_list]’ 37 | ~model() | ^ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/graph_concepts.hpp:182:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 182 | BOOST_CONCEPT_USAGE(VertexListGraph) | ^~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements >]’: /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:208:5: required from ‘struct boost::Convertible’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:206:3: required from ‘struct boost::ConvertibleConcept’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::ConvertibleConcept]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied >::value’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:72:8: [ skipping 7 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/biconnected_components.hpp:250:47: required from ‘static std::pair boost::detail::bicomp_dispatch3::apply(const Graph&, ComponentMap, OutputIterator, VertexIndexMap, DiscoverTimeMap, LowPointMap, const boost::bgl_named_params&, boost::param_not_found) [with Graph = R_adjacency_list; ComponentMap = boost::dummy_property_map; OutputIterator = std::back_insert_iterator >; VertexIndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>; DiscoverTimeMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>; LowPointMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>; P = int; T = boost::buffer_param_t; R = boost::no_property]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/biconnected_components.hpp:295:60: required from ‘static std::pair boost::detail::bicomp_dispatch2::apply(const Graph&, ComponentMap, OutputIterator, VertexIndexMap, DiscoverTimeMap, const boost::bgl_named_params&, boost::param_not_found) [with Graph = R_adjacency_list; ComponentMap = boost::dummy_property_map; OutputIterator = std::back_insert_iterator >; VertexIndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>; DiscoverTimeMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>; P = int; T = boost::buffer_param_t; R = boost::no_property]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/biconnected_components.hpp:336:60: required from ‘static std::pair boost::detail::bicomp_dispatch1::apply(const Graph&, ComponentMap, OutputIterator, VertexIndexMap, const boost::bgl_named_params&, boost::param_not_found) [with Graph = R_adjacency_list; ComponentMap = boost::dummy_property_map; OutputIterator = std::back_insert_iterator >; VertexIndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>; P = int; T = boost::buffer_param_t; R = boost::no_property]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/biconnected_components.hpp:368:60: required from ‘std::pair boost::biconnected_components(const Graph&, ComponentMap, OutputIterator, const bgl_named_params&) [with Graph = R_adjacency_list; ComponentMap = dummy_property_map; OutputIterator = std::back_insert_iterator >; P = int; T = buffer_param_t; R = no_property]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/biconnected_components.hpp:433:34: required from ‘OutputIterator boost::articulation_points(const Graph&, OutputIterator) [with Graph = R_adjacency_list; OutputIterator = std::back_insert_iterator >]’ interfaces.cpp:300:28: required from here /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::Convertible]’ 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ^ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::ConvertibleConcept]’: /home/omnipath/local/R/4.4-3.20/BH/include/boost/property_map/property_map.hpp:180:7: required from ‘void boost::WritablePropertyMapConcept::constraints() [with PMap = boost::dummy_property_map; Key = boost::detail::edge_desc_impl]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::WritablePropertyMapConcept >]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied > >::value’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied > >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:72:8: [ skipping 2 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/biconnected_components.hpp:250:47: required from ‘static std::pair boost::detail::bicomp_dispatch3::apply(const Graph&, ComponentMap, OutputIterator, VertexIndexMap, DiscoverTimeMap, LowPointMap, const boost::bgl_named_params&, boost::param_not_found) [with Graph = R_adjacency_list; ComponentMap = boost::dummy_property_map; OutputIterator = std::back_insert_iterator >; VertexIndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>; DiscoverTimeMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>; LowPointMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>; P = int; T = boost::buffer_param_t; R = boost::no_property]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/biconnected_components.hpp:295:60: required from ‘static std::pair boost::detail::bicomp_dispatch2::apply(const Graph&, ComponentMap, OutputIterator, VertexIndexMap, DiscoverTimeMap, const boost::bgl_named_params&, boost::param_not_found) [with Graph = R_adjacency_list; ComponentMap = boost::dummy_property_map; OutputIterator = std::back_insert_iterator >; VertexIndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>; DiscoverTimeMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>; P = int; T = boost::buffer_param_t; R = boost::no_property]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/biconnected_components.hpp:336:60: required from ‘static std::pair boost::detail::bicomp_dispatch1::apply(const Graph&, ComponentMap, OutputIterator, VertexIndexMap, const boost::bgl_named_params&, boost::param_not_found) [with Graph = R_adjacency_list; ComponentMap = boost::dummy_property_map; OutputIterator = std::back_insert_iterator >; VertexIndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>; P = int; T = boost::buffer_param_t; R = boost::no_property]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/biconnected_components.hpp:368:60: required from ‘std::pair boost::biconnected_components(const Graph&, ComponentMap, OutputIterator, const bgl_named_params&) [with Graph = R_adjacency_list; ComponentMap = dummy_property_map; OutputIterator = std::back_insert_iterator >; P = int; T = buffer_param_t; R = no_property]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/biconnected_components.hpp:433:34: required from ‘OutputIterator boost::articulation_points(const Graph&, OutputIterator) [with Graph = R_adjacency_list; OutputIterator = std::back_insert_iterator >]’ interfaces.cpp:300:28: required from here /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:206:17: note: in a call to non-static member function ‘boost::ConvertibleConcept::~ConvertibleConcept()’ 206 | BOOST_concept(Convertible,(X)(Y)) | ^~~~~~~~~~~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/preprocessor/cat.hpp:29:34: note: in definition of macro ‘BOOST_PP_CAT_I’ 29 | # define BOOST_PP_CAT_I(a, b) a ## b | ^ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/concept_def.hpp:23:12: note: in expansion of macro ‘BOOST_PP_CAT’ 23 | struct BOOST_PP_CAT(name,Concept) \ | ^~~~~~~~~~~~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:206:3: note: in expansion of macro ‘BOOST_concept’ 206 | BOOST_concept(Convertible,(X)(Y)) | ^~~~~~~~~~~~~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::constraint::failed() [with Model = boost::ReadablePropertyMapConcept >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>, long unsigned int>]’: /home/omnipath/local/R/4.4-3.20/BH/include/boost/property_map/property_map.hpp:206:7: required from ‘void boost::ReadWritePropertyMapConcept::constraints() [with PMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>; Key = long unsigned int]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::ReadWritePropertyMapConcept >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>, long unsigned int>]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>, long unsigned int> >::value’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>, long unsigned int> >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:72:8: [ skipping 2 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/biconnected_components.hpp:250:47: required from ‘static std::pair boost::detail::bicomp_dispatch3::apply(const Graph&, ComponentMap, OutputIterator, VertexIndexMap, DiscoverTimeMap, LowPointMap, const boost::bgl_named_params&, boost::param_not_found) [with Graph = R_adjacency_list; ComponentMap = boost::dummy_property_map; OutputIterator = std::back_insert_iterator >; VertexIndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>; DiscoverTimeMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>; LowPointMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>; P = int; T = boost::buffer_param_t; R = boost::no_property]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/biconnected_components.hpp:295:60: required from ‘static std::pair boost::detail::bicomp_dispatch2::apply(const Graph&, ComponentMap, OutputIterator, VertexIndexMap, DiscoverTimeMap, const boost::bgl_named_params&, boost::param_not_found) [with Graph = R_adjacency_list; ComponentMap = boost::dummy_property_map; OutputIterator = std::back_insert_iterator >; VertexIndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>; DiscoverTimeMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>; P = int; T = boost::buffer_param_t; R = boost::no_property]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/biconnected_components.hpp:336:60: required from ‘static std::pair boost::detail::bicomp_dispatch1::apply(const Graph&, ComponentMap, OutputIterator, VertexIndexMap, const boost::bgl_named_params&, boost::param_not_found) [with Graph = R_adjacency_list; ComponentMap = boost::dummy_property_map; OutputIterator = std::back_insert_iterator >; VertexIndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>; P = int; T = boost::buffer_param_t; R = boost::no_property]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/biconnected_components.hpp:368:60: required from ‘std::pair boost::biconnected_components(const Graph&, ComponentMap, OutputIterator, const bgl_named_params&) [with Graph = R_adjacency_list; ComponentMap = dummy_property_map; OutputIterator = std::back_insert_iterator >; P = int; T = buffer_param_t; R = no_property]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/biconnected_components.hpp:433:34: required from ‘OutputIterator boost::articulation_points(const Graph&, OutputIterator) [with Graph = R_adjacency_list; OutputIterator = std::back_insert_iterator >]’ interfaces.cpp:300:28: required from here /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:65:52: warning: ‘this’ pointer is null [-Wnonnull] 65 | static void failed() { ((Model*)0)->constraints(); } | ~~~~~~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/property_map/property_map.hpp:147:10: note: in a call to non-static member function ‘void boost::ReadablePropertyMapConcept::constraints() [with PMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>; Key = long unsigned int]’ 147 | void constraints() { | ^~~~~~~~~~~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::constraint::failed() [with Model = boost::WritablePropertyMapConcept >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>, long unsigned int>]’: /home/omnipath/local/R/4.4-3.20/BH/include/boost/property_map/property_map.hpp:207:7: required from ‘void boost::ReadWritePropertyMapConcept::constraints() [with PMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>; Key = long unsigned int]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::ReadWritePropertyMapConcept >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>, long unsigned int>]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>, long unsigned int> >::value’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>, long unsigned int> >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:72:8: [ skipping 2 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/biconnected_components.hpp:250:47: required from ‘static std::pair boost::detail::bicomp_dispatch3::apply(const Graph&, ComponentMap, OutputIterator, VertexIndexMap, DiscoverTimeMap, LowPointMap, const boost::bgl_named_params&, boost::param_not_found) [with Graph = R_adjacency_list; ComponentMap = boost::dummy_property_map; OutputIterator = std::back_insert_iterator >; VertexIndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>; DiscoverTimeMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>; LowPointMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>; P = int; T = boost::buffer_param_t; R = boost::no_property]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/biconnected_components.hpp:295:60: required from ‘static std::pair boost::detail::bicomp_dispatch2::apply(const Graph&, ComponentMap, OutputIterator, VertexIndexMap, DiscoverTimeMap, const boost::bgl_named_params&, boost::param_not_found) [with Graph = R_adjacency_list; ComponentMap = boost::dummy_property_map; OutputIterator = std::back_insert_iterator >; VertexIndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>; DiscoverTimeMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>; P = int; T = boost::buffer_param_t; R = boost::no_property]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/biconnected_components.hpp:336:60: required from ‘static std::pair boost::detail::bicomp_dispatch1::apply(const Graph&, ComponentMap, OutputIterator, VertexIndexMap, const boost::bgl_named_params&, boost::param_not_found) [with Graph = R_adjacency_list; ComponentMap = boost::dummy_property_map; OutputIterator = std::back_insert_iterator >; VertexIndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>; P = int; T = boost::buffer_param_t; R = boost::no_property]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/biconnected_components.hpp:368:60: required from ‘std::pair boost::biconnected_components(const Graph&, ComponentMap, OutputIterator, const bgl_named_params&) [with Graph = R_adjacency_list; ComponentMap = dummy_property_map; OutputIterator = std::back_insert_iterator >; P = int; T = buffer_param_t; R = no_property]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/biconnected_components.hpp:433:34: required from ‘OutputIterator boost::articulation_points(const Graph&, OutputIterator) [with Graph = R_adjacency_list; OutputIterator = std::back_insert_iterator >]’ interfaces.cpp:300:28: required from here /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:65:52: warning: ‘this’ pointer is null [-Wnonnull] 65 | static void failed() { ((Model*)0)->constraints(); } | ~~~~~~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/property_map/property_map.hpp:179:10: note: in a call to non-static member function ‘void boost::WritablePropertyMapConcept::constraints() [with PMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>; Key = long unsigned int]’ 179 | void constraints() { | ^~~~~~~~~~~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements > > >, boost::edge_residual_capacity_t> >, boost::keep_all, boost::filtered_graph > > >, boost::no_property, boost::listS>, boost::is_residual_edge > > >, boost::edge_residual_capacity_t> >, boost::keep_all> >, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > > > >*, std::vector > > > >, std::allocator > > > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > > >]’: /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/graph_concepts.hpp:52:50: required from ‘struct boost::concepts::MultiPassInputIterator > > >, boost::edge_residual_capacity_t> >, boost::keep_all, boost::filtered_graph > > >, boost::no_property, boost::listS>, boost::is_residual_edge > > >, boost::edge_residual_capacity_t> >, boost::keep_all> >, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > > > >*, std::vector > > > >, std::allocator > > > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::concepts::MultiPassInputIterator > > >, boost::edge_residual_capacity_t> >, boost::keep_all, boost::filtered_graph > > >, boost::no_property, boost::listS>, boost::is_residual_edge > > >, boost::edge_residual_capacity_t> >, boost::keep_all> >, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > > > >*, std::vector > > > >, std::allocator > > > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied > > >, boost::edge_residual_capacity_t> >, boost::keep_all, boost::filtered_graph > > >, boost::no_property, boost::listS>, boost::is_residual_edge > > >, boost::edge_residual_capacity_t> >, boost::keep_all> >, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > > > >*, std::vector > > > >, std::allocator > > > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > > >::value’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied > > >, boost::edge_residual_capacity_t> >, boost::keep_all, boost::filtered_graph > > >, boost::no_property, boost::listS>, boost::is_residual_edge > > >, boost::edge_residual_capacity_t> >, boost::keep_all> >, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > > > >*, std::vector > > > >, std::allocator > > > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > > >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_ > > >, boost::edge_residual_capacity_t> >, boost::keep_all, boost::filtered_graph > > >, boost::no_property, boost::listS>, boost::is_residual_edge > > >, boost::edge_residual_capacity_t> >, boost::keep_all> >, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > > > >*, std::vector > > > >, std::allocator > > > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >)>’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/graph_concepts.hpp:89:9: [ skipping 2 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/depth_first_search.hpp:129:9: required from ‘void boost::breadth_first_visit(const IncidenceGraph&, SourceIterator, SourceIterator, Buffer&, BFSVisitor, ColorMap) [with IncidenceGraph = filtered_graph > > >, no_property, listS>, is_residual_edge > > >, edge_residual_capacity_t> >, keep_all>; Buffer = queue > >; BFSVisitor = bfs_visitor*, on_tree_edge> >; ColorMap = default_color_type*; SourceIterator = long unsigned int*]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/breadth_first_search.hpp:136:24: required from ‘void boost::breadth_first_search(const VertexListGraph&, SourceIterator, SourceIterator, Buffer&, BFSVisitor, ColorMap) [with VertexListGraph = filtered_graph > > >, no_property, listS>, is_residual_edge > > >, edge_residual_capacity_t> >, keep_all>; SourceIterator = long unsigned int*; Buffer = queue > >; BFSVisitor = bfs_visitor*, on_tree_edge> >; ColorMap = default_color_type*]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/breadth_first_search.hpp:147:25: required from ‘void boost::breadth_first_search(const VertexListGraph&, typename graph_traits::vertex_descriptor, Buffer&, BFSVisitor, ColorMap) [with VertexListGraph = filtered_graph > > >, no_property, listS>, is_residual_edge > > >, edge_residual_capacity_t> >, keep_all>; Buffer = queue > >; BFSVisitor = bfs_visitor*, on_tree_edge> >; ColorMap = default_color_type*; typename graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/edmonds_karp_max_flow.hpp:101:29: required from ‘typename boost::property_traits::value_type boost::edmonds_karp_max_flow(Graph&, typename graph_traits::vertex_descriptor, typename graph_traits::vertex_descriptor, CapacityEdgeMap, ResidualCapacityEdgeMap, ReverseEdgeMap, ColorMap, PredEdgeMap) [with Graph = adjacency_list > > >, no_property, listS>; CapacityEdgeMap = adj_list_edge_property_map > > >, edge_capacity_t>; ResidualCapacityEdgeMap = adj_list_edge_property_map > > >, edge_residual_capacity_t>; ReverseEdgeMap = adj_list_edge_property_map, detail::edge_desc_impl&, long unsigned int, property > > >, edge_reverse_t>; ColorMap = default_color_type*; PredEdgeMap = detail::edge_desc_impl*; typename property_traits::value_type = long unsigned int; typename graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/edge_connectivity.hpp:145:42: required from ‘typename boost::graph_traits::degree_size_type boost::edge_connectivity(VertexListGraph&, OutputIterator) [with VertexListGraph = R_adjacency_list; OutputIterator = std::back_insert_iterator > >; typename graph_traits::degree_size_type = long unsigned int]’ interfaces.cpp:326:34: required from here /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::concepts::MultiPassInputIterator > > >, boost::edge_residual_capacity_t> >, boost::keep_all, boost::filtered_graph > > >, boost::no_property, boost::listS>, boost::is_residual_edge > > >, boost::edge_residual_capacity_t> >, boost::keep_all> >, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > > > >*, std::vector > > > >, std::allocator > > > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >]’ 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ^ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::MultiPassInputIterator > > >, boost::edge_residual_capacity_t> >, boost::keep_all, boost::filtered_graph > > >, boost::no_property, boost::listS>, boost::is_residual_edge > > >, boost::edge_residual_capacity_t> >, boost::keep_all> >, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > > > >*, std::vector > > > >, std::allocator > > > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >]’: /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/graph_concepts.hpp:89:9: required from ‘boost::concepts::IncidenceGraph::~IncidenceGraph() [with G = boost::filtered_graph > > >, boost::no_property, boost::listS>, boost::is_residual_edge > > >, boost::edge_residual_capacity_t> >, boost::keep_all>]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/graph_concepts.hpp:75:1: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::IncidenceGraphConcept > > >, boost::no_property, boost::listS>, boost::is_residual_edge > > >, boost::edge_residual_capacity_t> >, boost::keep_all> >]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/depth_first_search.hpp:129:9: required from ‘void boost::breadth_first_visit(const IncidenceGraph&, SourceIterator, SourceIterator, Buffer&, BFSVisitor, ColorMap) [with IncidenceGraph = filtered_graph > > >, no_property, listS>, is_residual_edge > > >, edge_residual_capacity_t> >, keep_all>; Buffer = queue > >; BFSVisitor = bfs_visitor*, on_tree_edge> >; ColorMap = default_color_type*; SourceIterator = long unsigned int*]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/breadth_first_search.hpp:136:24: required from ‘void boost::breadth_first_search(const VertexListGraph&, SourceIterator, SourceIterator, Buffer&, BFSVisitor, ColorMap) [with VertexListGraph = filtered_graph > > >, no_property, listS>, is_residual_edge > > >, edge_residual_capacity_t> >, keep_all>; SourceIterator = long unsigned int*; Buffer = queue > >; BFSVisitor = bfs_visitor*, on_tree_edge> >; ColorMap = default_color_type*]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/breadth_first_search.hpp:147:25: required from ‘void boost::breadth_first_search(const VertexListGraph&, typename graph_traits::vertex_descriptor, Buffer&, BFSVisitor, ColorMap) [with VertexListGraph = filtered_graph > > >, no_property, listS>, is_residual_edge > > >, edge_residual_capacity_t> >, keep_all>; Buffer = queue > >; BFSVisitor = bfs_visitor*, on_tree_edge> >; ColorMap = default_color_type*; typename graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/edmonds_karp_max_flow.hpp:101:29: required from ‘typename boost::property_traits::value_type boost::edmonds_karp_max_flow(Graph&, typename graph_traits::vertex_descriptor, typename graph_traits::vertex_descriptor, CapacityEdgeMap, ResidualCapacityEdgeMap, ReverseEdgeMap, ColorMap, PredEdgeMap) [with Graph = adjacency_list > > >, no_property, listS>; CapacityEdgeMap = adj_list_edge_property_map > > >, edge_capacity_t>; ResidualCapacityEdgeMap = adj_list_edge_property_map > > >, edge_residual_capacity_t>; ReverseEdgeMap = adj_list_edge_property_map, detail::edge_desc_impl&, long unsigned int, property > > >, edge_reverse_t>; ColorMap = default_color_type*; PredEdgeMap = detail::edge_desc_impl*; typename property_traits::value_type = long unsigned int; typename graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/edge_connectivity.hpp:145:42: required from ‘typename boost::graph_traits::degree_size_type boost::edge_connectivity(VertexListGraph&, OutputIterator) [with VertexListGraph = R_adjacency_list; OutputIterator = std::back_insert_iterator > >; typename graph_traits::degree_size_type = long unsigned int]’ interfaces.cpp:326:34: required from here /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::concepts::MultiPassInputIterator::~MultiPassInputIterator() [with T = boost::iterators::filter_iterator > > >, boost::edge_residual_capacity_t> >, boost::keep_all, boost::filtered_graph > > >, boost::no_property, boost::listS>, boost::is_residual_edge > > >, boost::edge_residual_capacity_t> >, boost::keep_all> >, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > > > >*, std::vector > > > >, std::allocator > > > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> >]’ 37 | ~model() | ^ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/graph_concepts.hpp:52:50: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 52 | BOOST_concept(MultiPassInputIterator, (T)) { BOOST_CONCEPT_USAGE( | ^~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::CopyConstructible*, boost::on_tree_edge> > >]’: /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements*, boost::on_tree_edge> > > >]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:167:5: required from ‘struct boost::CopyConstructible*, boost::on_tree_edge> > >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:165:3: required from ‘struct boost::CopyConstructibleConcept*, boost::on_tree_edge> > >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::CopyConstructibleConcept*, boost::on_tree_edge> > >]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied*, boost::on_tree_edge> > > >::value’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:45:51: [ skipping 7 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/breadth_first_search.hpp:65:5: required from ‘void boost::breadth_first_visit(const IncidenceGraph&, SourceIterator, SourceIterator, Buffer&, BFSVisitor, ColorMap) [with IncidenceGraph = filtered_graph > > >, no_property, listS>, is_residual_edge > > >, edge_residual_capacity_t> >, keep_all>; Buffer = queue > >; BFSVisitor = bfs_visitor*, on_tree_edge> >; ColorMap = default_color_type*; SourceIterator = long unsigned int*]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/breadth_first_search.hpp:136:24: required from ‘void boost::breadth_first_search(const VertexListGraph&, SourceIterator, SourceIterator, Buffer&, BFSVisitor, ColorMap) [with VertexListGraph = filtered_graph > > >, no_property, listS>, is_residual_edge > > >, edge_residual_capacity_t> >, keep_all>; SourceIterator = long unsigned int*; Buffer = queue > >; BFSVisitor = bfs_visitor*, on_tree_edge> >; ColorMap = default_color_type*]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/breadth_first_search.hpp:147:25: required from ‘void boost::breadth_first_search(const VertexListGraph&, typename graph_traits::vertex_descriptor, Buffer&, BFSVisitor, ColorMap) [with VertexListGraph = filtered_graph > > >, no_property, listS>, is_residual_edge > > >, edge_residual_capacity_t> >, keep_all>; Buffer = queue > >; BFSVisitor = bfs_visitor*, on_tree_edge> >; ColorMap = default_color_type*; typename graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/edmonds_karp_max_flow.hpp:101:29: required from ‘typename boost::property_traits::value_type boost::edmonds_karp_max_flow(Graph&, typename graph_traits::vertex_descriptor, typename graph_traits::vertex_descriptor, CapacityEdgeMap, ResidualCapacityEdgeMap, ReverseEdgeMap, ColorMap, PredEdgeMap) [with Graph = adjacency_list > > >, no_property, listS>; CapacityEdgeMap = adj_list_edge_property_map > > >, edge_capacity_t>; ResidualCapacityEdgeMap = adj_list_edge_property_map > > >, edge_residual_capacity_t>; ReverseEdgeMap = adj_list_edge_property_map, detail::edge_desc_impl&, long unsigned int, property > > >, edge_reverse_t>; ColorMap = default_color_type*; PredEdgeMap = detail::edge_desc_impl*; typename property_traits::value_type = long unsigned int; typename graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/edge_connectivity.hpp:145:42: required from ‘typename boost::graph_traits::degree_size_type boost::edge_connectivity(VertexListGraph&, OutputIterator) [with VertexListGraph = R_adjacency_list; OutputIterator = std::back_insert_iterator > >; typename graph_traits::degree_size_type = long unsigned int]’ interfaces.cpp:326:34: required from here /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::CopyConstructible::~CopyConstructible() [with TT = boost::bfs_visitor*, boost::on_tree_edge> >]’ 37 | ~model() | ^ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:167:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 167 | BOOST_CONCEPT_USAGE(CopyConstructible) { | ^~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::CopyConstructible > > >]’: /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements > > > >]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:167:5: required from ‘struct boost::CopyConstructible > > >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:165:3: required from ‘struct boost::CopyConstructibleConcept > > >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::CopyConstructibleConcept > > >]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied > > > >::value’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:45:51: [ skipping 8 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/depth_first_search.hpp:397:42: required from ‘void boost::graph::detail::depth_first_search_impl::operator()(const Graph&, const ArgPack&) const [with ArgPack = boost::parameter::aux::arg_list > > >, boost::parameter::aux::arg_list, boost::parameter::aux::empty_arg_list, std::integral_constant >, std::integral_constant >; Graph = R_adjacency_list]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/depth_first_search.hpp:406:5: required from ‘typename boost::result_of(Param0, const ArgPack&)>::type boost::graph::depth_first_search_with_named_params(const Param0&, const ArgPack&) [with Param0 = R_adjacency_list; ArgPack = boost::parameter::aux::arg_list > > >, boost::parameter::aux::arg_list, boost::parameter::aux::empty_arg_list, std::integral_constant >, std::integral_constant >; typename boost::result_of(Param0, const ArgPack&)>::type = void]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/depth_first_search.hpp:409:1: required from ‘typename boost::result_of(Param0, const typename boost::detail::convert_bgl_params_to_boost_parameter >::type&)>::type boost::depth_first_search(const Param0&, const bgl_named_params&) [with Param0 = R_adjacency_list; P = topo_sort_visitor > >; T = graph_visitor_t; R = bgl_named_params; typename result_of(Param0, const typename detail::convert_bgl_params_to_boost_parameter >::type&)>::type = void; typename detail::convert_bgl_params_to_boost_parameter >::type = parameter::aux::arg_list > > >, parameter::aux::arg_list, parameter::aux::empty_arg_list, std::integral_constant >, std::integral_constant >]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/topological_sort.hpp:69:23: required from ‘void boost::topological_sort(VertexListGraph&, OutputIterator, const bgl_named_params&) [with VertexListGraph = R_adjacency_list; OutputIterator = std::front_insert_iterator >; P = int; T = buffer_param_t; R = no_property]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/topological_sort.hpp:75:21: required from ‘void boost::topological_sort(VertexListGraph&, OutputIterator) [with VertexListGraph = R_adjacency_list; OutputIterator = std::front_insert_iterator >]’ interfaces.cpp:71:29: required from here /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::CopyConstructible::~CopyConstructible() [with TT = boost::topo_sort_visitor > >]’ 37 | ~model() | ^ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:167:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 167 | BOOST_CONCEPT_USAGE(CopyConstructible) { | ^~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::CopyConstructible >]’: /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements > >]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:167:5: required from ‘struct boost::CopyConstructible >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:165:3: required from ‘struct boost::CopyConstructibleConcept >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::CopyConstructibleConcept >]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied > >::value’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:45:51: [ skipping 8 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/breadth_first_search.hpp:136:24: required from ‘void boost::breadth_first_search(const VertexListGraph&, SourceIterator, SourceIterator, Buffer&, BFSVisitor, ColorMap) [with VertexListGraph = R_adjacency_list; SourceIterator = long unsigned int*; Buffer = queue > >; BFSVisitor = bfs_time_visitor; ColorMap = two_bit_color_map, long unsigned int> >]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/breadth_first_search.hpp:147:25: required from ‘void boost::breadth_first_search(const VertexListGraph&, typename graph_traits::vertex_descriptor, Buffer&, BFSVisitor, ColorMap) [with VertexListGraph = R_adjacency_list; Buffer = queue > >; BFSVisitor = bfs_time_visitor; ColorMap = two_bit_color_map, long unsigned int> >; typename graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/breadth_first_search.hpp:262:29: required from ‘void boost::detail::bfs_helper(VertexListGraph&, typename boost::graph_traits::vertex_descriptor, ColorMap, BFSVisitor, const boost::bgl_named_params&, mpl_::false_) [with VertexListGraph = R_adjacency_list; ColorMap = boost::two_bit_color_map, long unsigned int> >; BFSVisitor = bfs_time_visitor; P = bfs_time_visitor; T = boost::graph_visitor_t; R = boost::no_property; typename boost::graph_traits::vertex_descriptor = long unsigned int; mpl_::false_ = mpl_::bool_]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/breadth_first_search.hpp:309:23: required from ‘static void boost::detail::bfs_dispatch::apply(VertexListGraph&, typename boost::graph_traits::vertex_descriptor, const boost::bgl_named_params&, boost::param_not_found) [with VertexListGraph = R_adjacency_list; P = bfs_time_visitor; T = boost::graph_visitor_t; R = boost::no_property; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/breadth_first_search.hpp:339:37: required from ‘void boost::breadth_first_search(const VertexListGraph&, typename graph_traits::vertex_descriptor, const bgl_named_params&) [with VertexListGraph = R_adjacency_list; P = bfs_time_visitor; T = graph_visitor_t; R = no_property; typename graph_traits::vertex_descriptor = long unsigned int]’ interfaces.cpp:113:29: required from here /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::CopyConstructible::~CopyConstructible() [with TT = bfs_time_visitor]’ 37 | ~model() | ^ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:167:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 167 | BOOST_CONCEPT_USAGE(CopyConstructible) { | ^~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements >]’: /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:208:5: required from ‘struct boost::Convertible’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:206:3: required from ‘struct boost::ConvertibleConcept’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::ConvertibleConcept]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied >::value’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:72:8: [ skipping 12 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/breadth_first_search.hpp:136:24: required from ‘void boost::breadth_first_search(const VertexListGraph&, SourceIterator, SourceIterator, Buffer&, BFSVisitor, ColorMap) [with VertexListGraph = R_adjacency_list; SourceIterator = long unsigned int*; Buffer = queue > >; BFSVisitor = bfs_time_visitor; ColorMap = two_bit_color_map, long unsigned int> >]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/breadth_first_search.hpp:147:25: required from ‘void boost::breadth_first_search(const VertexListGraph&, typename graph_traits::vertex_descriptor, Buffer&, BFSVisitor, ColorMap) [with VertexListGraph = R_adjacency_list; Buffer = queue > >; BFSVisitor = bfs_time_visitor; ColorMap = two_bit_color_map, long unsigned int> >; typename graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/breadth_first_search.hpp:262:29: required from ‘void boost::detail::bfs_helper(VertexListGraph&, typename boost::graph_traits::vertex_descriptor, ColorMap, BFSVisitor, const boost::bgl_named_params&, mpl_::false_) [with VertexListGraph = R_adjacency_list; ColorMap = boost::two_bit_color_map, long unsigned int> >; BFSVisitor = bfs_time_visitor; P = bfs_time_visitor; T = boost::graph_visitor_t; R = boost::no_property; typename boost::graph_traits::vertex_descriptor = long unsigned int; mpl_::false_ = mpl_::bool_]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/breadth_first_search.hpp:309:23: required from ‘static void boost::detail::bfs_dispatch::apply(VertexListGraph&, typename boost::graph_traits::vertex_descriptor, const boost::bgl_named_params&, boost::param_not_found) [with VertexListGraph = R_adjacency_list; P = bfs_time_visitor; T = boost::graph_visitor_t; R = boost::no_property; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/breadth_first_search.hpp:339:37: required from ‘void boost::breadth_first_search(const VertexListGraph&, typename graph_traits::vertex_descriptor, const bgl_named_params&) [with VertexListGraph = R_adjacency_list; P = bfs_time_visitor; T = graph_visitor_t; R = no_property; typename graph_traits::vertex_descriptor = long unsigned int]’ interfaces.cpp:113:29: required from here /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::Convertible]’ 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ^ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::ConvertibleConcept]’: /home/omnipath/local/R/4.4-3.20/BH/include/boost/property_map/property_map.hpp:148:7: required from ‘void boost::ReadablePropertyMapConcept::constraints() [with PMap = boost::two_bit_color_map, long unsigned int> >; Key = long unsigned int]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::ReadablePropertyMapConcept, long unsigned int> >, long unsigned int>]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied, long unsigned int> >, long unsigned int> >::value’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied, long unsigned int> >, long unsigned int> >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_, long unsigned int> >, long unsigned int>)>’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/property_map/property_map.hpp:206:7: [ skipping 6 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/breadth_first_search.hpp:136:24: required from ‘void boost::breadth_first_search(const VertexListGraph&, SourceIterator, SourceIterator, Buffer&, BFSVisitor, ColorMap) [with VertexListGraph = R_adjacency_list; SourceIterator = long unsigned int*; Buffer = queue > >; BFSVisitor = bfs_time_visitor; ColorMap = two_bit_color_map, long unsigned int> >]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/breadth_first_search.hpp:147:25: required from ‘void boost::breadth_first_search(const VertexListGraph&, typename graph_traits::vertex_descriptor, Buffer&, BFSVisitor, ColorMap) [with VertexListGraph = R_adjacency_list; Buffer = queue > >; BFSVisitor = bfs_time_visitor; ColorMap = two_bit_color_map, long unsigned int> >; typename graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/breadth_first_search.hpp:262:29: required from ‘void boost::detail::bfs_helper(VertexListGraph&, typename boost::graph_traits::vertex_descriptor, ColorMap, BFSVisitor, const boost::bgl_named_params&, mpl_::false_) [with VertexListGraph = R_adjacency_list; ColorMap = boost::two_bit_color_map, long unsigned int> >; BFSVisitor = bfs_time_visitor; P = bfs_time_visitor; T = boost::graph_visitor_t; R = boost::no_property; typename boost::graph_traits::vertex_descriptor = long unsigned int; mpl_::false_ = mpl_::bool_]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/breadth_first_search.hpp:309:23: required from ‘static void boost::detail::bfs_dispatch::apply(VertexListGraph&, typename boost::graph_traits::vertex_descriptor, const boost::bgl_named_params&, boost::param_not_found) [with VertexListGraph = R_adjacency_list; P = bfs_time_visitor; T = boost::graph_visitor_t; R = boost::no_property; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/breadth_first_search.hpp:339:37: required from ‘void boost::breadth_first_search(const VertexListGraph&, typename graph_traits::vertex_descriptor, const bgl_named_params&) [with VertexListGraph = R_adjacency_list; P = bfs_time_visitor; T = graph_visitor_t; R = no_property; typename graph_traits::vertex_descriptor = long unsigned int]’ interfaces.cpp:113:29: required from here /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:206:17: note: in a call to non-static member function ‘boost::ConvertibleConcept::~ConvertibleConcept()’ 206 | BOOST_concept(Convertible,(X)(Y)) | ^~~~~~~~~~~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/preprocessor/cat.hpp:29:34: note: in definition of macro ‘BOOST_PP_CAT_I’ 29 | # define BOOST_PP_CAT_I(a, b) a ## b | ^ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/concept_def.hpp:23:12: note: in expansion of macro ‘BOOST_PP_CAT’ 23 | struct BOOST_PP_CAT(name,Concept) \ | ^~~~~~~~~~~~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:206:3: note: in expansion of macro ‘BOOST_concept’ 206 | BOOST_concept(Convertible,(X)(Y)) | ^~~~~~~~~~~~~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::Convertible]’: /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements >]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:208:5: required from ‘struct boost::Convertible’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:206:3: required from ‘struct boost::ConvertibleConcept’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::ConvertibleConcept]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied >::value’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:45:51: [ skipping 8 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/breadth_first_search.hpp:136:24: required from ‘void boost::breadth_first_search(const VertexListGraph&, SourceIterator, SourceIterator, Buffer&, BFSVisitor, ColorMap) [with VertexListGraph = R_adjacency_list; SourceIterator = long unsigned int*; Buffer = queue > >; BFSVisitor = bfs_time_visitor; ColorMap = two_bit_color_map, long unsigned int> >]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/breadth_first_search.hpp:147:25: required from ‘void boost::breadth_first_search(const VertexListGraph&, typename graph_traits::vertex_descriptor, Buffer&, BFSVisitor, ColorMap) [with VertexListGraph = R_adjacency_list; Buffer = queue > >; BFSVisitor = bfs_time_visitor; ColorMap = two_bit_color_map, long unsigned int> >; typename graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/breadth_first_search.hpp:262:29: required from ‘void boost::detail::bfs_helper(VertexListGraph&, typename boost::graph_traits::vertex_descriptor, ColorMap, BFSVisitor, const boost::bgl_named_params&, mpl_::false_) [with VertexListGraph = R_adjacency_list; ColorMap = boost::two_bit_color_map, long unsigned int> >; BFSVisitor = bfs_time_visitor; P = bfs_time_visitor; T = boost::graph_visitor_t; R = boost::no_property; typename boost::graph_traits::vertex_descriptor = long unsigned int; mpl_::false_ = mpl_::bool_]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/breadth_first_search.hpp:309:23: required from ‘static void boost::detail::bfs_dispatch::apply(VertexListGraph&, typename boost::graph_traits::vertex_descriptor, const boost::bgl_named_params&, boost::param_not_found) [with VertexListGraph = R_adjacency_list; P = bfs_time_visitor; T = boost::graph_visitor_t; R = boost::no_property; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/breadth_first_search.hpp:339:37: required from ‘void boost::breadth_first_search(const VertexListGraph&, typename graph_traits::vertex_descriptor, const bgl_named_params&) [with VertexListGraph = R_adjacency_list; P = bfs_time_visitor; T = graph_visitor_t; R = no_property; typename graph_traits::vertex_descriptor = long unsigned int]’ interfaces.cpp:113:29: required from here /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::Convertible::~Convertible() [with X = boost::read_write_property_map_tag; Y = boost::read_write_property_map_tag]’ 37 | ~model() | ^ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:208:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 208 | BOOST_CONCEPT_USAGE(Convertible) { | ^~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements >]’: /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:137:5: required from ‘struct boost::DefaultConstructible’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::DefaultConstructible]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied >::value’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_)>’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/graph_concepts.hpp:68:9: [ skipping 10 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/depth_first_search.hpp:129:9: required from ‘void boost::detail::depth_first_visit_impl(const IncidenceGraph&, typename boost::graph_traits::vertex_descriptor, DFSVisitor&, ColorMap, TerminatorFunc) [with IncidenceGraph = R_adjacency_list; DFSVisitor = dfs_time_visitor; ColorMap = boost::shared_array_property_map, long unsigned int> >; TerminatorFunc = nontruth2; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/depth_first_search.hpp:286:39: required from ‘void boost::depth_first_search(const VertexListGraph&, DFSVisitor, ColorMap, typename graph_traits::vertex_descriptor) [with VertexListGraph = R_adjacency_list; DFSVisitor = dfs_time_visitor; ColorMap = shared_array_property_map, long unsigned int> >; typename graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/depth_first_search.hpp:397:42: required from ‘void boost::graph::detail::depth_first_search_impl::operator()(const Graph&, const ArgPack&) const [with ArgPack = boost::parameter::aux::arg_list >, boost::parameter::aux::empty_arg_list, std::integral_constant >; Graph = R_adjacency_list]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/depth_first_search.hpp:406:5: required from ‘typename boost::result_of(Param0, const ArgPack&)>::type boost::graph::depth_first_search_with_named_params(const Param0&, const ArgPack&) [with Param0 = R_adjacency_list; ArgPack = boost::parameter::aux::arg_list >, boost::parameter::aux::empty_arg_list, std::integral_constant >; typename boost::result_of(Param0, const ArgPack&)>::type = void]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/depth_first_search.hpp:409:1: required from ‘typename boost::result_of(Param0, const typename boost::detail::convert_bgl_params_to_boost_parameter >::type&)>::type boost::depth_first_search(const Param0&, const bgl_named_params&) [with Param0 = R_adjacency_list; P = dfs_time_visitor; T = graph_visitor_t; R = no_property; typename result_of(Param0, const typename detail::convert_bgl_params_to_boost_parameter >::type&)>::type = void; typename detail::convert_bgl_params_to_boost_parameter >::type = parameter::aux::arg_list >, parameter::aux::empty_arg_list, std::integral_constant >]’ interfaces.cpp:158:27: required from here /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::DefaultConstructible]’ 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ^ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::DefaultConstructible]’: /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/graph_concepts.hpp:68:9: required from ‘boost::concepts::Graph::~Graph() [with G = R_adjacency_list]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/usage.hpp:20:48: required from ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::concepts::Graph >]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements > >]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/graph_concepts.hpp:66:5: required from ‘struct boost::concepts::Graph >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/graph_concepts.hpp:75:1: required from ‘struct boost::concepts::IncidenceGraph >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/graph_concepts.hpp:75:1: [ skipping 5 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/depth_first_search.hpp:129:9: required from ‘void boost::detail::depth_first_visit_impl(const IncidenceGraph&, typename boost::graph_traits::vertex_descriptor, DFSVisitor&, ColorMap, TerminatorFunc) [with IncidenceGraph = R_adjacency_list; DFSVisitor = dfs_time_visitor; ColorMap = boost::shared_array_property_map, long unsigned int> >; TerminatorFunc = nontruth2; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/depth_first_search.hpp:286:39: required from ‘void boost::depth_first_search(const VertexListGraph&, DFSVisitor, ColorMap, typename graph_traits::vertex_descriptor) [with VertexListGraph = R_adjacency_list; DFSVisitor = dfs_time_visitor; ColorMap = shared_array_property_map, long unsigned int> >; typename graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/depth_first_search.hpp:397:42: required from ‘void boost::graph::detail::depth_first_search_impl::operator()(const Graph&, const ArgPack&) const [with ArgPack = boost::parameter::aux::arg_list >, boost::parameter::aux::empty_arg_list, std::integral_constant >; Graph = R_adjacency_list]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/depth_first_search.hpp:406:5: required from ‘typename boost::result_of(Param0, const ArgPack&)>::type boost::graph::depth_first_search_with_named_params(const Param0&, const ArgPack&) [with Param0 = R_adjacency_list; ArgPack = boost::parameter::aux::arg_list >, boost::parameter::aux::empty_arg_list, std::integral_constant >; typename boost::result_of(Param0, const ArgPack&)>::type = void]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/depth_first_search.hpp:409:1: required from ‘typename boost::result_of(Param0, const typename boost::detail::convert_bgl_params_to_boost_parameter >::type&)>::type boost::depth_first_search(const Param0&, const bgl_named_params&) [with Param0 = R_adjacency_list; P = dfs_time_visitor; T = graph_visitor_t; R = no_property; typename result_of(Param0, const typename detail::convert_bgl_params_to_boost_parameter >::type&)>::type = void; typename detail::convert_bgl_params_to_boost_parameter >::type = parameter::aux::arg_list >, parameter::aux::empty_arg_list, std::integral_constant >]’ interfaces.cpp:158:27: required from here /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::DefaultConstructible::~DefaultConstructible() [with TT = long unsigned int]’ 37 | ~model() | ^ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:137:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 137 | BOOST_CONCEPT_USAGE(DefaultConstructible) { | ^~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements >]’: /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:233:5: required from ‘struct boost::EqualityComparable’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::EqualityComparable]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied >::value’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_)>’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/graph_concepts.hpp:69:9: [ skipping 10 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/depth_first_search.hpp:129:9: required from ‘void boost::detail::depth_first_visit_impl(const IncidenceGraph&, typename boost::graph_traits::vertex_descriptor, DFSVisitor&, ColorMap, TerminatorFunc) [with IncidenceGraph = R_adjacency_list; DFSVisitor = dfs_time_visitor; ColorMap = boost::shared_array_property_map, long unsigned int> >; TerminatorFunc = nontruth2; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/depth_first_search.hpp:286:39: required from ‘void boost::depth_first_search(const VertexListGraph&, DFSVisitor, ColorMap, typename graph_traits::vertex_descriptor) [with VertexListGraph = R_adjacency_list; DFSVisitor = dfs_time_visitor; ColorMap = shared_array_property_map, long unsigned int> >; typename graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/depth_first_search.hpp:397:42: required from ‘void boost::graph::detail::depth_first_search_impl::operator()(const Graph&, const ArgPack&) const [with ArgPack = boost::parameter::aux::arg_list >, boost::parameter::aux::empty_arg_list, std::integral_constant >; Graph = R_adjacency_list]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/depth_first_search.hpp:406:5: required from ‘typename boost::result_of(Param0, const ArgPack&)>::type boost::graph::depth_first_search_with_named_params(const Param0&, const ArgPack&) [with Param0 = R_adjacency_list; ArgPack = boost::parameter::aux::arg_list >, boost::parameter::aux::empty_arg_list, std::integral_constant >; typename boost::result_of(Param0, const ArgPack&)>::type = void]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/depth_first_search.hpp:409:1: required from ‘typename boost::result_of(Param0, const typename boost::detail::convert_bgl_params_to_boost_parameter >::type&)>::type boost::depth_first_search(const Param0&, const bgl_named_params&) [with Param0 = R_adjacency_list; P = dfs_time_visitor; T = graph_visitor_t; R = no_property; typename result_of(Param0, const typename detail::convert_bgl_params_to_boost_parameter >::type&)>::type = void; typename detail::convert_bgl_params_to_boost_parameter >::type = parameter::aux::arg_list >, parameter::aux::empty_arg_list, std::integral_constant >]’ interfaces.cpp:158:27: required from here /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::EqualityComparable]’ 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ^ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::EqualityComparable]’: /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/graph_concepts.hpp:69:9: required from ‘boost::concepts::Graph::~Graph() [with G = R_adjacency_list]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/usage.hpp:20:48: required from ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::concepts::Graph >]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements > >]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/graph_concepts.hpp:66:5: required from ‘struct boost::concepts::Graph >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/graph_concepts.hpp:75:1: required from ‘struct boost::concepts::IncidenceGraph >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/graph_concepts.hpp:75:1: [ skipping 5 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/depth_first_search.hpp:129:9: required from ‘void boost::detail::depth_first_visit_impl(const IncidenceGraph&, typename boost::graph_traits::vertex_descriptor, DFSVisitor&, ColorMap, TerminatorFunc) [with IncidenceGraph = R_adjacency_list; DFSVisitor = dfs_time_visitor; ColorMap = boost::shared_array_property_map, long unsigned int> >; TerminatorFunc = nontruth2; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/depth_first_search.hpp:286:39: required from ‘void boost::depth_first_search(const VertexListGraph&, DFSVisitor, ColorMap, typename graph_traits::vertex_descriptor) [with VertexListGraph = R_adjacency_list; DFSVisitor = dfs_time_visitor; ColorMap = shared_array_property_map, long unsigned int> >; typename graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/depth_first_search.hpp:397:42: required from ‘void boost::graph::detail::depth_first_search_impl::operator()(const Graph&, const ArgPack&) const [with ArgPack = boost::parameter::aux::arg_list >, boost::parameter::aux::empty_arg_list, std::integral_constant >; Graph = R_adjacency_list]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/depth_first_search.hpp:406:5: required from ‘typename boost::result_of(Param0, const ArgPack&)>::type boost::graph::depth_first_search_with_named_params(const Param0&, const ArgPack&) [with Param0 = R_adjacency_list; ArgPack = boost::parameter::aux::arg_list >, boost::parameter::aux::empty_arg_list, std::integral_constant >; typename boost::result_of(Param0, const ArgPack&)>::type = void]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/depth_first_search.hpp:409:1: required from ‘typename boost::result_of(Param0, const typename boost::detail::convert_bgl_params_to_boost_parameter >::type&)>::type boost::depth_first_search(const Param0&, const bgl_named_params&) [with Param0 = R_adjacency_list; P = dfs_time_visitor; T = graph_visitor_t; R = no_property; typename result_of(Param0, const typename detail::convert_bgl_params_to_boost_parameter >::type&)>::type = void; typename detail::convert_bgl_params_to_boost_parameter >::type = parameter::aux::arg_list >, parameter::aux::empty_arg_list, std::integral_constant >]’ interfaces.cpp:158:27: required from here /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::EqualityComparable::~EqualityComparable() [with TT = long unsigned int]’ 37 | ~model() | ^ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:233:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 233 | BOOST_CONCEPT_USAGE(EqualityComparable) { | ^~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements >]’: /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:145:5: required from ‘struct boost::Assignable’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::Assignable]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied >::value’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_)>’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/graph_concepts.hpp:70:9: [ skipping 10 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/depth_first_search.hpp:129:9: required from ‘void boost::detail::depth_first_visit_impl(const IncidenceGraph&, typename boost::graph_traits::vertex_descriptor, DFSVisitor&, ColorMap, TerminatorFunc) [with IncidenceGraph = R_adjacency_list; DFSVisitor = dfs_time_visitor; ColorMap = boost::shared_array_property_map, long unsigned int> >; TerminatorFunc = nontruth2; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/depth_first_search.hpp:286:39: required from ‘void boost::depth_first_search(const VertexListGraph&, DFSVisitor, ColorMap, typename graph_traits::vertex_descriptor) [with VertexListGraph = R_adjacency_list; DFSVisitor = dfs_time_visitor; ColorMap = shared_array_property_map, long unsigned int> >; typename graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/depth_first_search.hpp:397:42: required from ‘void boost::graph::detail::depth_first_search_impl::operator()(const Graph&, const ArgPack&) const [with ArgPack = boost::parameter::aux::arg_list >, boost::parameter::aux::empty_arg_list, std::integral_constant >; Graph = R_adjacency_list]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/depth_first_search.hpp:406:5: required from ‘typename boost::result_of(Param0, const ArgPack&)>::type boost::graph::depth_first_search_with_named_params(const Param0&, const ArgPack&) [with Param0 = R_adjacency_list; ArgPack = boost::parameter::aux::arg_list >, boost::parameter::aux::empty_arg_list, std::integral_constant >; typename boost::result_of(Param0, const ArgPack&)>::type = void]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/depth_first_search.hpp:409:1: required from ‘typename boost::result_of(Param0, const typename boost::detail::convert_bgl_params_to_boost_parameter >::type&)>::type boost::depth_first_search(const Param0&, const bgl_named_params&) [with Param0 = R_adjacency_list; P = dfs_time_visitor; T = graph_visitor_t; R = no_property; typename result_of(Param0, const typename detail::convert_bgl_params_to_boost_parameter >::type&)>::type = void; typename detail::convert_bgl_params_to_boost_parameter >::type = parameter::aux::arg_list >, parameter::aux::empty_arg_list, std::integral_constant >]’ interfaces.cpp:158:27: required from here /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::Assignable]’ 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ^ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::Assignable]’: /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/graph_concepts.hpp:70:9: required from ‘boost::concepts::Graph::~Graph() [with G = R_adjacency_list]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/usage.hpp:20:48: required from ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::concepts::Graph >]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements > >]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/graph_concepts.hpp:66:5: required from ‘struct boost::concepts::Graph >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/graph_concepts.hpp:75:1: required from ‘struct boost::concepts::IncidenceGraph >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/graph_concepts.hpp:75:1: [ skipping 5 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/depth_first_search.hpp:129:9: required from ‘void boost::detail::depth_first_visit_impl(const IncidenceGraph&, typename boost::graph_traits::vertex_descriptor, DFSVisitor&, ColorMap, TerminatorFunc) [with IncidenceGraph = R_adjacency_list; DFSVisitor = dfs_time_visitor; ColorMap = boost::shared_array_property_map, long unsigned int> >; TerminatorFunc = nontruth2; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/depth_first_search.hpp:286:39: required from ‘void boost::depth_first_search(const VertexListGraph&, DFSVisitor, ColorMap, typename graph_traits::vertex_descriptor) [with VertexListGraph = R_adjacency_list; DFSVisitor = dfs_time_visitor; ColorMap = shared_array_property_map, long unsigned int> >; typename graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/depth_first_search.hpp:397:42: required from ‘void boost::graph::detail::depth_first_search_impl::operator()(const Graph&, const ArgPack&) const [with ArgPack = boost::parameter::aux::arg_list >, boost::parameter::aux::empty_arg_list, std::integral_constant >; Graph = R_adjacency_list]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/depth_first_search.hpp:406:5: required from ‘typename boost::result_of(Param0, const ArgPack&)>::type boost::graph::depth_first_search_with_named_params(const Param0&, const ArgPack&) [with Param0 = R_adjacency_list; ArgPack = boost::parameter::aux::arg_list >, boost::parameter::aux::empty_arg_list, std::integral_constant >; typename boost::result_of(Param0, const ArgPack&)>::type = void]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/depth_first_search.hpp:409:1: required from ‘typename boost::result_of(Param0, const typename boost::detail::convert_bgl_params_to_boost_parameter >::type&)>::type boost::depth_first_search(const Param0&, const bgl_named_params&) [with Param0 = R_adjacency_list; P = dfs_time_visitor; T = graph_visitor_t; R = no_property; typename result_of(Param0, const typename detail::convert_bgl_params_to_boost_parameter >::type&)>::type = void; typename detail::convert_bgl_params_to_boost_parameter >::type = parameter::aux::arg_list >, parameter::aux::empty_arg_list, std::integral_constant >]’ interfaces.cpp:158:27: required from here /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::Assignable::~Assignable() [with TT = long unsigned int]’ 37 | ~model() | ^ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:145:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 145 | BOOST_CONCEPT_USAGE(Assignable) { | ^~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::concepts::MultiPassInputIterator >*, std::vector >, std::allocator > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> >]’: /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements >*, std::vector >, std::allocator > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/graph_concepts.hpp:52:50: required from ‘struct boost::concepts::MultiPassInputIterator >*, std::vector >, std::allocator > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::concepts::MultiPassInputIterator >*, std::vector >, std::allocator > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> >]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied >*, std::vector >, std::allocator > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::value’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied >*, std::vector >, std::allocator > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:72:8: [ skipping 3 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/depth_first_search.hpp:129:9: required from ‘void boost::detail::depth_first_visit_impl(const IncidenceGraph&, typename boost::graph_traits::vertex_descriptor, DFSVisitor&, ColorMap, TerminatorFunc) [with IncidenceGraph = R_adjacency_list; DFSVisitor = dfs_time_visitor; ColorMap = boost::shared_array_property_map, long unsigned int> >; TerminatorFunc = nontruth2; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/depth_first_search.hpp:286:39: required from ‘void boost::depth_first_search(const VertexListGraph&, DFSVisitor, ColorMap, typename graph_traits::vertex_descriptor) [with VertexListGraph = R_adjacency_list; DFSVisitor = dfs_time_visitor; ColorMap = shared_array_property_map, long unsigned int> >; typename graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/depth_first_search.hpp:397:42: required from ‘void boost::graph::detail::depth_first_search_impl::operator()(const Graph&, const ArgPack&) const [with ArgPack = boost::parameter::aux::arg_list >, boost::parameter::aux::empty_arg_list, std::integral_constant >; Graph = R_adjacency_list]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/depth_first_search.hpp:406:5: required from ‘typename boost::result_of(Param0, const ArgPack&)>::type boost::graph::depth_first_search_with_named_params(const Param0&, const ArgPack&) [with Param0 = R_adjacency_list; ArgPack = boost::parameter::aux::arg_list >, boost::parameter::aux::empty_arg_list, std::integral_constant >; typename boost::result_of(Param0, const ArgPack&)>::type = void]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/depth_first_search.hpp:409:1: required from ‘typename boost::result_of(Param0, const typename boost::detail::convert_bgl_params_to_boost_parameter >::type&)>::type boost::depth_first_search(const Param0&, const bgl_named_params&) [with Param0 = R_adjacency_list; P = dfs_time_visitor; T = graph_visitor_t; R = no_property; typename result_of(Param0, const typename detail::convert_bgl_params_to_boost_parameter >::type&)>::type = void; typename detail::convert_bgl_params_to_boost_parameter >::type = parameter::aux::arg_list >, parameter::aux::empty_arg_list, std::integral_constant >]’ interfaces.cpp:158:27: required from here /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::concepts::MultiPassInputIterator::~MultiPassInputIterator() [with T = boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator >*, std::vector >, std::allocator > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>]’ 37 | ~model() | ^ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/graph_concepts.hpp:52:50: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 52 | BOOST_concept(MultiPassInputIterator, (T)) { BOOST_CONCEPT_USAGE( | ^~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::DefaultConstructible >]’: /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements > >]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:137:5: required from ‘struct boost::DefaultConstructible >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::DefaultConstructible >]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied > >::value’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied > >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:72:8: [ skipping 3 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/depth_first_search.hpp:129:9: required from ‘void boost::detail::depth_first_visit_impl(const IncidenceGraph&, typename boost::graph_traits::vertex_descriptor, DFSVisitor&, ColorMap, TerminatorFunc) [with IncidenceGraph = R_adjacency_list; DFSVisitor = dfs_time_visitor; ColorMap = boost::shared_array_property_map, long unsigned int> >; TerminatorFunc = nontruth2; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/depth_first_search.hpp:286:39: required from ‘void boost::depth_first_search(const VertexListGraph&, DFSVisitor, ColorMap, typename graph_traits::vertex_descriptor) [with VertexListGraph = R_adjacency_list; DFSVisitor = dfs_time_visitor; ColorMap = shared_array_property_map, long unsigned int> >; typename graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/depth_first_search.hpp:397:42: required from ‘void boost::graph::detail::depth_first_search_impl::operator()(const Graph&, const ArgPack&) const [with ArgPack = boost::parameter::aux::arg_list >, boost::parameter::aux::empty_arg_list, std::integral_constant >; Graph = R_adjacency_list]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/depth_first_search.hpp:406:5: required from ‘typename boost::result_of(Param0, const ArgPack&)>::type boost::graph::depth_first_search_with_named_params(const Param0&, const ArgPack&) [with Param0 = R_adjacency_list; ArgPack = boost::parameter::aux::arg_list >, boost::parameter::aux::empty_arg_list, std::integral_constant >; typename boost::result_of(Param0, const ArgPack&)>::type = void]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/depth_first_search.hpp:409:1: required from ‘typename boost::result_of(Param0, const typename boost::detail::convert_bgl_params_to_boost_parameter >::type&)>::type boost::depth_first_search(const Param0&, const bgl_named_params&) [with Param0 = R_adjacency_list; P = dfs_time_visitor; T = graph_visitor_t; R = no_property; typename result_of(Param0, const typename detail::convert_bgl_params_to_boost_parameter >::type&)>::type = void; typename detail::convert_bgl_params_to_boost_parameter >::type = parameter::aux::arg_list >, parameter::aux::empty_arg_list, std::integral_constant >]’ interfaces.cpp:158:27: required from here /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::DefaultConstructible::~DefaultConstructible() [with TT = boost::detail::edge_desc_impl]’ 37 | ~model() | ^ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:137:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 137 | BOOST_CONCEPT_USAGE(DefaultConstructible) { | ^~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::EqualityComparable >]’: /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements > >]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:233:5: required from ‘struct boost::EqualityComparable >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::EqualityComparable >]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied > >::value’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied > >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:72:8: [ skipping 3 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/depth_first_search.hpp:129:9: required from ‘void boost::detail::depth_first_visit_impl(const IncidenceGraph&, typename boost::graph_traits::vertex_descriptor, DFSVisitor&, ColorMap, TerminatorFunc) [with IncidenceGraph = R_adjacency_list; DFSVisitor = dfs_time_visitor; ColorMap = boost::shared_array_property_map, long unsigned int> >; TerminatorFunc = nontruth2; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/depth_first_search.hpp:286:39: required from ‘void boost::depth_first_search(const VertexListGraph&, DFSVisitor, ColorMap, typename graph_traits::vertex_descriptor) [with VertexListGraph = R_adjacency_list; DFSVisitor = dfs_time_visitor; ColorMap = shared_array_property_map, long unsigned int> >; typename graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/depth_first_search.hpp:397:42: required from ‘void boost::graph::detail::depth_first_search_impl::operator()(const Graph&, const ArgPack&) const [with ArgPack = boost::parameter::aux::arg_list >, boost::parameter::aux::empty_arg_list, std::integral_constant >; Graph = R_adjacency_list]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/depth_first_search.hpp:406:5: required from ‘typename boost::result_of(Param0, const ArgPack&)>::type boost::graph::depth_first_search_with_named_params(const Param0&, const ArgPack&) [with Param0 = R_adjacency_list; ArgPack = boost::parameter::aux::arg_list >, boost::parameter::aux::empty_arg_list, std::integral_constant >; typename boost::result_of(Param0, const ArgPack&)>::type = void]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/depth_first_search.hpp:409:1: required from ‘typename boost::result_of(Param0, const typename boost::detail::convert_bgl_params_to_boost_parameter >::type&)>::type boost::depth_first_search(const Param0&, const bgl_named_params&) [with Param0 = R_adjacency_list; P = dfs_time_visitor; T = graph_visitor_t; R = no_property; typename result_of(Param0, const typename detail::convert_bgl_params_to_boost_parameter >::type&)>::type = void; typename detail::convert_bgl_params_to_boost_parameter >::type = parameter::aux::arg_list >, parameter::aux::empty_arg_list, std::integral_constant >]’ interfaces.cpp:158:27: required from here /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::EqualityComparable::~EqualityComparable() [with TT = boost::detail::edge_desc_impl]’ 37 | ~model() | ^ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:233:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 233 | BOOST_CONCEPT_USAGE(EqualityComparable) { | ^~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::Assignable >]’: /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements > >]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:145:5: required from ‘struct boost::Assignable >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::Assignable >]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied > >::value’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied > >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:72:8: [ skipping 3 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/depth_first_search.hpp:129:9: required from ‘void boost::detail::depth_first_visit_impl(const IncidenceGraph&, typename boost::graph_traits::vertex_descriptor, DFSVisitor&, ColorMap, TerminatorFunc) [with IncidenceGraph = R_adjacency_list; DFSVisitor = dfs_time_visitor; ColorMap = boost::shared_array_property_map, long unsigned int> >; TerminatorFunc = nontruth2; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/depth_first_search.hpp:286:39: required from ‘void boost::depth_first_search(const VertexListGraph&, DFSVisitor, ColorMap, typename graph_traits::vertex_descriptor) [with VertexListGraph = R_adjacency_list; DFSVisitor = dfs_time_visitor; ColorMap = shared_array_property_map, long unsigned int> >; typename graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/depth_first_search.hpp:397:42: required from ‘void boost::graph::detail::depth_first_search_impl::operator()(const Graph&, const ArgPack&) const [with ArgPack = boost::parameter::aux::arg_list >, boost::parameter::aux::empty_arg_list, std::integral_constant >; Graph = R_adjacency_list]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/depth_first_search.hpp:406:5: required from ‘typename boost::result_of(Param0, const ArgPack&)>::type boost::graph::depth_first_search_with_named_params(const Param0&, const ArgPack&) [with Param0 = R_adjacency_list; ArgPack = boost::parameter::aux::arg_list >, boost::parameter::aux::empty_arg_list, std::integral_constant >; typename boost::result_of(Param0, const ArgPack&)>::type = void]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/depth_first_search.hpp:409:1: required from ‘typename boost::result_of(Param0, const typename boost::detail::convert_bgl_params_to_boost_parameter >::type&)>::type boost::depth_first_search(const Param0&, const bgl_named_params&) [with Param0 = R_adjacency_list; P = dfs_time_visitor; T = graph_visitor_t; R = no_property; typename result_of(Param0, const typename detail::convert_bgl_params_to_boost_parameter >::type&)>::type = void; typename detail::convert_bgl_params_to_boost_parameter >::type = parameter::aux::arg_list >, parameter::aux::empty_arg_list, std::integral_constant >]’ interfaces.cpp:158:27: required from here /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::Assignable::~Assignable() [with TT = boost::detail::edge_desc_impl]’ 37 | ~model() | ^ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:145:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 145 | BOOST_CONCEPT_USAGE(Assignable) { | ^~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::Convertible]’: /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements >]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:208:5: required from ‘struct boost::Convertible’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::Convertible]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied >::value’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:72:8: [ skipping 3 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/depth_first_search.hpp:129:9: required from ‘void boost::detail::depth_first_visit_impl(const IncidenceGraph&, typename boost::graph_traits::vertex_descriptor, DFSVisitor&, ColorMap, TerminatorFunc) [with IncidenceGraph = R_adjacency_list; DFSVisitor = dfs_time_visitor; ColorMap = boost::shared_array_property_map, long unsigned int> >; TerminatorFunc = nontruth2; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/depth_first_search.hpp:286:39: required from ‘void boost::depth_first_search(const VertexListGraph&, DFSVisitor, ColorMap, typename graph_traits::vertex_descriptor) [with VertexListGraph = R_adjacency_list; DFSVisitor = dfs_time_visitor; ColorMap = shared_array_property_map, long unsigned int> >; typename graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/depth_first_search.hpp:397:42: required from ‘void boost::graph::detail::depth_first_search_impl::operator()(const Graph&, const ArgPack&) const [with ArgPack = boost::parameter::aux::arg_list >, boost::parameter::aux::empty_arg_list, std::integral_constant >; Graph = R_adjacency_list]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/depth_first_search.hpp:406:5: required from ‘typename boost::result_of(Param0, const ArgPack&)>::type boost::graph::depth_first_search_with_named_params(const Param0&, const ArgPack&) [with Param0 = R_adjacency_list; ArgPack = boost::parameter::aux::arg_list >, boost::parameter::aux::empty_arg_list, std::integral_constant >; typename boost::result_of(Param0, const ArgPack&)>::type = void]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/depth_first_search.hpp:409:1: required from ‘typename boost::result_of(Param0, const typename boost::detail::convert_bgl_params_to_boost_parameter >::type&)>::type boost::depth_first_search(const Param0&, const bgl_named_params&) [with Param0 = R_adjacency_list; P = dfs_time_visitor; T = graph_visitor_t; R = no_property; typename result_of(Param0, const typename detail::convert_bgl_params_to_boost_parameter >::type&)>::type = void; typename detail::convert_bgl_params_to_boost_parameter >::type = parameter::aux::arg_list >, parameter::aux::empty_arg_list, std::integral_constant >]’ interfaces.cpp:158:27: required from here /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::Convertible::~Convertible() [with X = boost::adj_list_dir_traversal_tag; Y = boost::incidence_graph_tag]’ 37 | ~model() | ^ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:208:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 208 | BOOST_CONCEPT_USAGE(Convertible) { | ^~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::Convertible]’: /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements >]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:208:5: required from ‘struct boost::Convertible’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:206:3: required from ‘struct boost::ConvertibleConcept’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::ConvertibleConcept]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied >::value’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:45:51: [ skipping 12 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/depth_first_search.hpp:134:9: required from ‘void boost::detail::depth_first_visit_impl(const IncidenceGraph&, typename boost::graph_traits::vertex_descriptor, DFSVisitor&, ColorMap, TerminatorFunc) [with IncidenceGraph = R_adjacency_list; DFSVisitor = dfs_time_visitor; ColorMap = boost::shared_array_property_map, long unsigned int> >; TerminatorFunc = nontruth2; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/depth_first_search.hpp:286:39: required from ‘void boost::depth_first_search(const VertexListGraph&, DFSVisitor, ColorMap, typename graph_traits::vertex_descriptor) [with VertexListGraph = R_adjacency_list; DFSVisitor = dfs_time_visitor; ColorMap = shared_array_property_map, long unsigned int> >; typename graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/depth_first_search.hpp:397:42: required from ‘void boost::graph::detail::depth_first_search_impl::operator()(const Graph&, const ArgPack&) const [with ArgPack = boost::parameter::aux::arg_list >, boost::parameter::aux::empty_arg_list, std::integral_constant >; Graph = R_adjacency_list]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/depth_first_search.hpp:406:5: required from ‘typename boost::result_of(Param0, const ArgPack&)>::type boost::graph::depth_first_search_with_named_params(const Param0&, const ArgPack&) [with Param0 = R_adjacency_list; ArgPack = boost::parameter::aux::arg_list >, boost::parameter::aux::empty_arg_list, std::integral_constant >; typename boost::result_of(Param0, const ArgPack&)>::type = void]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/depth_first_search.hpp:409:1: required from ‘typename boost::result_of(Param0, const typename boost::detail::convert_bgl_params_to_boost_parameter >::type&)>::type boost::depth_first_search(const Param0&, const bgl_named_params&) [with Param0 = R_adjacency_list; P = dfs_time_visitor; T = graph_visitor_t; R = no_property; typename result_of(Param0, const typename detail::convert_bgl_params_to_boost_parameter >::type&)>::type = void; typename detail::convert_bgl_params_to_boost_parameter >::type = parameter::aux::arg_list >, parameter::aux::empty_arg_list, std::integral_constant >]’ interfaces.cpp:158:27: required from here /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::Convertible::~Convertible() [with X = boost::lvalue_property_map_tag; Y = boost::readable_property_map_tag]’ 37 | ~model() | ^ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:208:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 208 | BOOST_CONCEPT_USAGE(Convertible) { | ^~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements > >, boost::property >*, std::vector > >, boost::property >, std::allocator > >, boost::property > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >]’: /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/graph_concepts.hpp:52:50: required from ‘struct boost::concepts::MultiPassInputIterator > >, boost::property >*, std::vector > >, boost::property >, std::allocator > >, boost::property > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::concepts::MultiPassInputIterator > >, boost::property >*, std::vector > >, boost::property >, std::allocator > >, boost::property > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> >]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied > >, boost::property >*, std::vector > >, boost::property >, std::allocator > >, boost::property > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::value’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied > >, boost::property >*, std::vector > >, boost::property >, std::allocator > >, boost::property > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_ > >, boost::property >*, std::vector > >, boost::property >, std::allocator > >, boost::property > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> >)>’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/graph_concepts.hpp:89:9: [ skipping 3 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/depth_first_search.hpp:286:39: required from ‘void boost::depth_first_search(const VertexListGraph&, DFSVisitor, ColorMap, typename graph_traits::vertex_descriptor) [with VertexListGraph = R_adjacency_list; DFSVisitor = detail::components_recorder; ColorMap = shared_array_property_map, long unsigned int> >; typename graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/depth_first_search.hpp:397:42: required from ‘void boost::graph::detail::depth_first_search_impl::operator()(const Graph&, const ArgPack&) const [with ArgPack = boost::parameter::aux::arg_list >, boost::parameter::aux::empty_arg_list, std::integral_constant >; Graph = R_adjacency_list]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/depth_first_search.hpp:406:5: required from ‘typename boost::result_of(Param0, const ArgPack&)>::type boost::graph::depth_first_search_with_named_params(const Param0&, const ArgPack&) [with Param0 = R_adjacency_list; ArgPack = boost::parameter::aux::arg_list >, boost::parameter::aux::empty_arg_list, std::integral_constant >; typename boost::result_of(Param0, const ArgPack&)>::type = void]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/depth_first_search.hpp:409:1: required from ‘typename boost::result_of(Param0, const typename boost::detail::convert_bgl_params_to_boost_parameter >::type&)>::type boost::depth_first_search(const Param0&, const bgl_named_params&) [with Param0 = R_adjacency_list; P = detail::components_recorder; T = graph_visitor_t; R = no_property; typename result_of(Param0, const typename detail::convert_bgl_params_to_boost_parameter >::type&)>::type = void; typename detail::convert_bgl_params_to_boost_parameter >::type = parameter::aux::arg_list >, parameter::aux::empty_arg_list, std::integral_constant >]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/connected_components.hpp:106:23: required from ‘typename boost::property_traits::value_type boost::connected_components(const Graph&, ComponentMap, typename enable_if_c::traversal_category>::value, graph::detail::no_parameter>::type) [with Graph = R_adjacency_list; ComponentMap = int*; typename property_traits::value_type = int; typename enable_if_c::traversal_category>::value, graph::detail::no_parameter>::type = graph::detail::no_parameter; typename graph_traits::traversal_category = undir_adj_list_traversal_tag]’ interfaces.cpp:205:29: required from here /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::concepts::MultiPassInputIterator > >, boost::property >*, std::vector > >, boost::property >, std::allocator > >, boost::property > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> >]’ 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ^ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::MultiPassInputIterator > >, boost::property >*, std::vector > >, boost::property >, std::allocator > >, boost::property > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> >]’: /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/graph_concepts.hpp:89:9: required from ‘boost::concepts::IncidenceGraph::~IncidenceGraph() [with G = R_adjacency_list]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/graph_concepts.hpp:75:1: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::IncidenceGraphConcept >]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/depth_first_search.hpp:129:9: required from ‘void boost::detail::depth_first_visit_impl(const IncidenceGraph&, typename boost::graph_traits::vertex_descriptor, DFSVisitor&, ColorMap, TerminatorFunc) [with IncidenceGraph = R_adjacency_list; DFSVisitor = components_recorder; ColorMap = boost::shared_array_property_map, long unsigned int> >; TerminatorFunc = nontruth2; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/depth_first_search.hpp:286:39: required from ‘void boost::depth_first_search(const VertexListGraph&, DFSVisitor, ColorMap, typename graph_traits::vertex_descriptor) [with VertexListGraph = R_adjacency_list; DFSVisitor = detail::components_recorder; ColorMap = shared_array_property_map, long unsigned int> >; typename graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/depth_first_search.hpp:397:42: required from ‘void boost::graph::detail::depth_first_search_impl::operator()(const Graph&, const ArgPack&) const [with ArgPack = boost::parameter::aux::arg_list >, boost::parameter::aux::empty_arg_list, std::integral_constant >; Graph = R_adjacency_list]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/depth_first_search.hpp:406:5: required from ‘typename boost::result_of(Param0, const ArgPack&)>::type boost::graph::depth_first_search_with_named_params(const Param0&, const ArgPack&) [with Param0 = R_adjacency_list; ArgPack = boost::parameter::aux::arg_list >, boost::parameter::aux::empty_arg_list, std::integral_constant >; typename boost::result_of(Param0, const ArgPack&)>::type = void]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/depth_first_search.hpp:409:1: required from ‘typename boost::result_of(Param0, const typename boost::detail::convert_bgl_params_to_boost_parameter >::type&)>::type boost::depth_first_search(const Param0&, const bgl_named_params&) [with Param0 = R_adjacency_list; P = detail::components_recorder; T = graph_visitor_t; R = no_property; typename result_of(Param0, const typename detail::convert_bgl_params_to_boost_parameter >::type&)>::type = void; typename detail::convert_bgl_params_to_boost_parameter >::type = parameter::aux::arg_list >, parameter::aux::empty_arg_list, std::integral_constant >]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/connected_components.hpp:106:23: required from ‘typename boost::property_traits::value_type boost::connected_components(const Graph&, ComponentMap, typename enable_if_c::traversal_category>::value, graph::detail::no_parameter>::type) [with Graph = R_adjacency_list; ComponentMap = int*; typename property_traits::value_type = int; typename enable_if_c::traversal_category>::value, graph::detail::no_parameter>::type = graph::detail::no_parameter; typename graph_traits::traversal_category = undir_adj_list_traversal_tag]’ interfaces.cpp:205:29: required from here /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::concepts::MultiPassInputIterator::~MultiPassInputIterator() [with T = boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >, boost::property >*, std::vector > >, boost::property >, std::allocator > >, boost::property > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>]’ 37 | ~model() | ^ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/graph_concepts.hpp:52:50: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 52 | BOOST_concept(MultiPassInputIterator, (T)) { BOOST_CONCEPT_USAGE( | ^~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements > >]’: /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:137:5: required from ‘struct boost::DefaultConstructible >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::DefaultConstructible >]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied > >::value’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied > >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_ >)>’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/graph_concepts.hpp:90:9: [ skipping 3 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/depth_first_search.hpp:286:39: required from ‘void boost::depth_first_search(const VertexListGraph&, DFSVisitor, ColorMap, typename graph_traits::vertex_descriptor) [with VertexListGraph = R_adjacency_list; DFSVisitor = detail::components_recorder; ColorMap = shared_array_property_map, long unsigned int> >; typename graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/depth_first_search.hpp:397:42: required from ‘void boost::graph::detail::depth_first_search_impl::operator()(const Graph&, const ArgPack&) const [with ArgPack = boost::parameter::aux::arg_list >, boost::parameter::aux::empty_arg_list, std::integral_constant >; Graph = R_adjacency_list]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/depth_first_search.hpp:406:5: required from ‘typename boost::result_of(Param0, const ArgPack&)>::type boost::graph::depth_first_search_with_named_params(const Param0&, const ArgPack&) [with Param0 = R_adjacency_list; ArgPack = boost::parameter::aux::arg_list >, boost::parameter::aux::empty_arg_list, std::integral_constant >; typename boost::result_of(Param0, const ArgPack&)>::type = void]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/depth_first_search.hpp:409:1: required from ‘typename boost::result_of(Param0, const typename boost::detail::convert_bgl_params_to_boost_parameter >::type&)>::type boost::depth_first_search(const Param0&, const bgl_named_params&) [with Param0 = R_adjacency_list; P = detail::components_recorder; T = graph_visitor_t; R = no_property; typename result_of(Param0, const typename detail::convert_bgl_params_to_boost_parameter >::type&)>::type = void; typename detail::convert_bgl_params_to_boost_parameter >::type = parameter::aux::arg_list >, parameter::aux::empty_arg_list, std::integral_constant >]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/connected_components.hpp:106:23: required from ‘typename boost::property_traits::value_type boost::connected_components(const Graph&, ComponentMap, typename enable_if_c::traversal_category>::value, graph::detail::no_parameter>::type) [with Graph = R_adjacency_list; ComponentMap = int*; typename property_traits::value_type = int; typename enable_if_c::traversal_category>::value, graph::detail::no_parameter>::type = graph::detail::no_parameter; typename graph_traits::traversal_category = undir_adj_list_traversal_tag]’ interfaces.cpp:205:29: required from here /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::DefaultConstructible >]’ 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ^ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::DefaultConstructible >]’: /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/graph_concepts.hpp:90:9: required from ‘boost::concepts::IncidenceGraph::~IncidenceGraph() [with G = R_adjacency_list]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/graph_concepts.hpp:75:1: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::IncidenceGraphConcept >]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/depth_first_search.hpp:129:9: required from ‘void boost::detail::depth_first_visit_impl(const IncidenceGraph&, typename boost::graph_traits::vertex_descriptor, DFSVisitor&, ColorMap, TerminatorFunc) [with IncidenceGraph = R_adjacency_list; DFSVisitor = components_recorder; ColorMap = boost::shared_array_property_map, long unsigned int> >; TerminatorFunc = nontruth2; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/depth_first_search.hpp:286:39: required from ‘void boost::depth_first_search(const VertexListGraph&, DFSVisitor, ColorMap, typename graph_traits::vertex_descriptor) [with VertexListGraph = R_adjacency_list; DFSVisitor = detail::components_recorder; ColorMap = shared_array_property_map, long unsigned int> >; typename graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/depth_first_search.hpp:397:42: required from ‘void boost::graph::detail::depth_first_search_impl::operator()(const Graph&, const ArgPack&) const [with ArgPack = boost::parameter::aux::arg_list >, boost::parameter::aux::empty_arg_list, std::integral_constant >; Graph = R_adjacency_list]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/depth_first_search.hpp:406:5: required from ‘typename boost::result_of(Param0, const ArgPack&)>::type boost::graph::depth_first_search_with_named_params(const Param0&, const ArgPack&) [with Param0 = R_adjacency_list; ArgPack = boost::parameter::aux::arg_list >, boost::parameter::aux::empty_arg_list, std::integral_constant >; typename boost::result_of(Param0, const ArgPack&)>::type = void]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/depth_first_search.hpp:409:1: required from ‘typename boost::result_of(Param0, const typename boost::detail::convert_bgl_params_to_boost_parameter >::type&)>::type boost::depth_first_search(const Param0&, const bgl_named_params&) [with Param0 = R_adjacency_list; P = detail::components_recorder; T = graph_visitor_t; R = no_property; typename result_of(Param0, const typename detail::convert_bgl_params_to_boost_parameter >::type&)>::type = void; typename detail::convert_bgl_params_to_boost_parameter >::type = parameter::aux::arg_list >, parameter::aux::empty_arg_list, std::integral_constant >]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/connected_components.hpp:106:23: required from ‘typename boost::property_traits::value_type boost::connected_components(const Graph&, ComponentMap, typename enable_if_c::traversal_category>::value, graph::detail::no_parameter>::type) [with Graph = R_adjacency_list; ComponentMap = int*; typename property_traits::value_type = int; typename enable_if_c::traversal_category>::value, graph::detail::no_parameter>::type = graph::detail::no_parameter; typename graph_traits::traversal_category = undir_adj_list_traversal_tag]’ interfaces.cpp:205:29: required from here /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::DefaultConstructible::~DefaultConstructible() [with TT = boost::detail::edge_desc_impl]’ 37 | ~model() | ^ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:137:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 137 | BOOST_CONCEPT_USAGE(DefaultConstructible) { | ^~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements > >]’: /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:233:5: required from ‘struct boost::EqualityComparable >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::EqualityComparable >]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied > >::value’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied > >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_ >)>’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/graph_concepts.hpp:91:9: [ skipping 3 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/depth_first_search.hpp:286:39: required from ‘void boost::depth_first_search(const VertexListGraph&, DFSVisitor, ColorMap, typename graph_traits::vertex_descriptor) [with VertexListGraph = R_adjacency_list; DFSVisitor = detail::components_recorder; ColorMap = shared_array_property_map, long unsigned int> >; typename graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/depth_first_search.hpp:397:42: required from ‘void boost::graph::detail::depth_first_search_impl::operator()(const Graph&, const ArgPack&) const [with ArgPack = boost::parameter::aux::arg_list >, boost::parameter::aux::empty_arg_list, std::integral_constant >; Graph = R_adjacency_list]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/depth_first_search.hpp:406:5: required from ‘typename boost::result_of(Param0, const ArgPack&)>::type boost::graph::depth_first_search_with_named_params(const Param0&, const ArgPack&) [with Param0 = R_adjacency_list; ArgPack = boost::parameter::aux::arg_list >, boost::parameter::aux::empty_arg_list, std::integral_constant >; typename boost::result_of(Param0, const ArgPack&)>::type = void]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/depth_first_search.hpp:409:1: required from ‘typename boost::result_of(Param0, const typename boost::detail::convert_bgl_params_to_boost_parameter >::type&)>::type boost::depth_first_search(const Param0&, const bgl_named_params&) [with Param0 = R_adjacency_list; P = detail::components_recorder; T = graph_visitor_t; R = no_property; typename result_of(Param0, const typename detail::convert_bgl_params_to_boost_parameter >::type&)>::type = void; typename detail::convert_bgl_params_to_boost_parameter >::type = parameter::aux::arg_list >, parameter::aux::empty_arg_list, std::integral_constant >]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/connected_components.hpp:106:23: required from ‘typename boost::property_traits::value_type boost::connected_components(const Graph&, ComponentMap, typename enable_if_c::traversal_category>::value, graph::detail::no_parameter>::type) [with Graph = R_adjacency_list; ComponentMap = int*; typename property_traits::value_type = int; typename enable_if_c::traversal_category>::value, graph::detail::no_parameter>::type = graph::detail::no_parameter; typename graph_traits::traversal_category = undir_adj_list_traversal_tag]’ interfaces.cpp:205:29: required from here /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::EqualityComparable >]’ 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ^ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::EqualityComparable >]’: /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/graph_concepts.hpp:91:9: required from ‘boost::concepts::IncidenceGraph::~IncidenceGraph() [with G = R_adjacency_list]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/graph_concepts.hpp:75:1: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::IncidenceGraphConcept >]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/depth_first_search.hpp:129:9: required from ‘void boost::detail::depth_first_visit_impl(const IncidenceGraph&, typename boost::graph_traits::vertex_descriptor, DFSVisitor&, ColorMap, TerminatorFunc) [with IncidenceGraph = R_adjacency_list; DFSVisitor = components_recorder; ColorMap = boost::shared_array_property_map, long unsigned int> >; TerminatorFunc = nontruth2; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/depth_first_search.hpp:286:39: required from ‘void boost::depth_first_search(const VertexListGraph&, DFSVisitor, ColorMap, typename graph_traits::vertex_descriptor) [with VertexListGraph = R_adjacency_list; DFSVisitor = detail::components_recorder; ColorMap = shared_array_property_map, long unsigned int> >; typename graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/depth_first_search.hpp:397:42: required from ‘void boost::graph::detail::depth_first_search_impl::operator()(const Graph&, const ArgPack&) const [with ArgPack = boost::parameter::aux::arg_list >, boost::parameter::aux::empty_arg_list, std::integral_constant >; Graph = R_adjacency_list]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/depth_first_search.hpp:406:5: required from ‘typename boost::result_of(Param0, const ArgPack&)>::type boost::graph::depth_first_search_with_named_params(const Param0&, const ArgPack&) [with Param0 = R_adjacency_list; ArgPack = boost::parameter::aux::arg_list >, boost::parameter::aux::empty_arg_list, std::integral_constant >; typename boost::result_of(Param0, const ArgPack&)>::type = void]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/depth_first_search.hpp:409:1: required from ‘typename boost::result_of(Param0, const typename boost::detail::convert_bgl_params_to_boost_parameter >::type&)>::type boost::depth_first_search(const Param0&, const bgl_named_params&) [with Param0 = R_adjacency_list; P = detail::components_recorder; T = graph_visitor_t; R = no_property; typename result_of(Param0, const typename detail::convert_bgl_params_to_boost_parameter >::type&)>::type = void; typename detail::convert_bgl_params_to_boost_parameter >::type = parameter::aux::arg_list >, parameter::aux::empty_arg_list, std::integral_constant >]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/connected_components.hpp:106:23: required from ‘typename boost::property_traits::value_type boost::connected_components(const Graph&, ComponentMap, typename enable_if_c::traversal_category>::value, graph::detail::no_parameter>::type) [with Graph = R_adjacency_list; ComponentMap = int*; typename property_traits::value_type = int; typename enable_if_c::traversal_category>::value, graph::detail::no_parameter>::type = graph::detail::no_parameter; typename graph_traits::traversal_category = undir_adj_list_traversal_tag]’ interfaces.cpp:205:29: required from here /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::EqualityComparable::~EqualityComparable() [with TT = boost::detail::edge_desc_impl]’ 37 | ~model() | ^ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:233:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 233 | BOOST_CONCEPT_USAGE(EqualityComparable) { | ^~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements > >]’: /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:145:5: required from ‘struct boost::Assignable >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::Assignable >]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied > >::value’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied > >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_ >)>’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/graph_concepts.hpp:92:9: [ skipping 3 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/depth_first_search.hpp:286:39: required from ‘void boost::depth_first_search(const VertexListGraph&, DFSVisitor, ColorMap, typename graph_traits::vertex_descriptor) [with VertexListGraph = R_adjacency_list; DFSVisitor = detail::components_recorder; ColorMap = shared_array_property_map, long unsigned int> >; typename graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/depth_first_search.hpp:397:42: required from ‘void boost::graph::detail::depth_first_search_impl::operator()(const Graph&, const ArgPack&) const [with ArgPack = boost::parameter::aux::arg_list >, boost::parameter::aux::empty_arg_list, std::integral_constant >; Graph = R_adjacency_list]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/depth_first_search.hpp:406:5: required from ‘typename boost::result_of(Param0, const ArgPack&)>::type boost::graph::depth_first_search_with_named_params(const Param0&, const ArgPack&) [with Param0 = R_adjacency_list; ArgPack = boost::parameter::aux::arg_list >, boost::parameter::aux::empty_arg_list, std::integral_constant >; typename boost::result_of(Param0, const ArgPack&)>::type = void]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/depth_first_search.hpp:409:1: required from ‘typename boost::result_of(Param0, const typename boost::detail::convert_bgl_params_to_boost_parameter >::type&)>::type boost::depth_first_search(const Param0&, const bgl_named_params&) [with Param0 = R_adjacency_list; P = detail::components_recorder; T = graph_visitor_t; R = no_property; typename result_of(Param0, const typename detail::convert_bgl_params_to_boost_parameter >::type&)>::type = void; typename detail::convert_bgl_params_to_boost_parameter >::type = parameter::aux::arg_list >, parameter::aux::empty_arg_list, std::integral_constant >]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/connected_components.hpp:106:23: required from ‘typename boost::property_traits::value_type boost::connected_components(const Graph&, ComponentMap, typename enable_if_c::traversal_category>::value, graph::detail::no_parameter>::type) [with Graph = R_adjacency_list; ComponentMap = int*; typename property_traits::value_type = int; typename enable_if_c::traversal_category>::value, graph::detail::no_parameter>::type = graph::detail::no_parameter; typename graph_traits::traversal_category = undir_adj_list_traversal_tag]’ interfaces.cpp:205:29: required from here /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::Assignable >]’ 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ^ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::Assignable >]’: /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/graph_concepts.hpp:92:9: required from ‘boost::concepts::IncidenceGraph::~IncidenceGraph() [with G = R_adjacency_list]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/graph_concepts.hpp:75:1: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::IncidenceGraphConcept >]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/depth_first_search.hpp:129:9: required from ‘void boost::detail::depth_first_visit_impl(const IncidenceGraph&, typename boost::graph_traits::vertex_descriptor, DFSVisitor&, ColorMap, TerminatorFunc) [with IncidenceGraph = R_adjacency_list; DFSVisitor = components_recorder; ColorMap = boost::shared_array_property_map, long unsigned int> >; TerminatorFunc = nontruth2; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/depth_first_search.hpp:286:39: required from ‘void boost::depth_first_search(const VertexListGraph&, DFSVisitor, ColorMap, typename graph_traits::vertex_descriptor) [with VertexListGraph = R_adjacency_list; DFSVisitor = detail::components_recorder; ColorMap = shared_array_property_map, long unsigned int> >; typename graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/depth_first_search.hpp:397:42: required from ‘void boost::graph::detail::depth_first_search_impl::operator()(const Graph&, const ArgPack&) const [with ArgPack = boost::parameter::aux::arg_list >, boost::parameter::aux::empty_arg_list, std::integral_constant >; Graph = R_adjacency_list]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/depth_first_search.hpp:406:5: required from ‘typename boost::result_of(Param0, const ArgPack&)>::type boost::graph::depth_first_search_with_named_params(const Param0&, const ArgPack&) [with Param0 = R_adjacency_list; ArgPack = boost::parameter::aux::arg_list >, boost::parameter::aux::empty_arg_list, std::integral_constant >; typename boost::result_of(Param0, const ArgPack&)>::type = void]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/depth_first_search.hpp:409:1: required from ‘typename boost::result_of(Param0, const typename boost::detail::convert_bgl_params_to_boost_parameter >::type&)>::type boost::depth_first_search(const Param0&, const bgl_named_params&) [with Param0 = R_adjacency_list; P = detail::components_recorder; T = graph_visitor_t; R = no_property; typename result_of(Param0, const typename detail::convert_bgl_params_to_boost_parameter >::type&)>::type = void; typename detail::convert_bgl_params_to_boost_parameter >::type = parameter::aux::arg_list >, parameter::aux::empty_arg_list, std::integral_constant >]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/connected_components.hpp:106:23: required from ‘typename boost::property_traits::value_type boost::connected_components(const Graph&, ComponentMap, typename enable_if_c::traversal_category>::value, graph::detail::no_parameter>::type) [with Graph = R_adjacency_list; ComponentMap = int*; typename property_traits::value_type = int; typename enable_if_c::traversal_category>::value, graph::detail::no_parameter>::type = graph::detail::no_parameter; typename graph_traits::traversal_category = undir_adj_list_traversal_tag]’ interfaces.cpp:205:29: required from here /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::Assignable::~Assignable() [with TT = boost::detail::edge_desc_impl]’ 37 | ~model() | ^ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:145:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 145 | BOOST_CONCEPT_USAGE(Assignable) { | ^~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements >]’: /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:208:5: required from ‘struct boost::Convertible’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::Convertible]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied >::value’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_)>’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/graph_concepts.hpp:93:9: [ skipping 3 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/depth_first_search.hpp:286:39: required from ‘void boost::depth_first_search(const VertexListGraph&, DFSVisitor, ColorMap, typename graph_traits::vertex_descriptor) [with VertexListGraph = R_adjacency_list; DFSVisitor = detail::components_recorder; ColorMap = shared_array_property_map, long unsigned int> >; typename graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/depth_first_search.hpp:397:42: required from ‘void boost::graph::detail::depth_first_search_impl::operator()(const Graph&, const ArgPack&) const [with ArgPack = boost::parameter::aux::arg_list >, boost::parameter::aux::empty_arg_list, std::integral_constant >; Graph = R_adjacency_list]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/depth_first_search.hpp:406:5: required from ‘typename boost::result_of(Param0, const ArgPack&)>::type boost::graph::depth_first_search_with_named_params(const Param0&, const ArgPack&) [with Param0 = R_adjacency_list; ArgPack = boost::parameter::aux::arg_list >, boost::parameter::aux::empty_arg_list, std::integral_constant >; typename boost::result_of(Param0, const ArgPack&)>::type = void]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/depth_first_search.hpp:409:1: required from ‘typename boost::result_of(Param0, const typename boost::detail::convert_bgl_params_to_boost_parameter >::type&)>::type boost::depth_first_search(const Param0&, const bgl_named_params&) [with Param0 = R_adjacency_list; P = detail::components_recorder; T = graph_visitor_t; R = no_property; typename result_of(Param0, const typename detail::convert_bgl_params_to_boost_parameter >::type&)>::type = void; typename detail::convert_bgl_params_to_boost_parameter >::type = parameter::aux::arg_list >, parameter::aux::empty_arg_list, std::integral_constant >]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/connected_components.hpp:106:23: required from ‘typename boost::property_traits::value_type boost::connected_components(const Graph&, ComponentMap, typename enable_if_c::traversal_category>::value, graph::detail::no_parameter>::type) [with Graph = R_adjacency_list; ComponentMap = int*; typename property_traits::value_type = int; typename enable_if_c::traversal_category>::value, graph::detail::no_parameter>::type = graph::detail::no_parameter; typename graph_traits::traversal_category = undir_adj_list_traversal_tag]’ interfaces.cpp:205:29: required from here /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::Convertible]’ 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ^ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::Convertible]’: /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/graph_concepts.hpp:93:9: required from ‘boost::concepts::IncidenceGraph::~IncidenceGraph() [with G = R_adjacency_list]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/graph_concepts.hpp:75:1: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::IncidenceGraphConcept >]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/depth_first_search.hpp:129:9: required from ‘void boost::detail::depth_first_visit_impl(const IncidenceGraph&, typename boost::graph_traits::vertex_descriptor, DFSVisitor&, ColorMap, TerminatorFunc) [with IncidenceGraph = R_adjacency_list; DFSVisitor = components_recorder; ColorMap = boost::shared_array_property_map, long unsigned int> >; TerminatorFunc = nontruth2; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/depth_first_search.hpp:286:39: required from ‘void boost::depth_first_search(const VertexListGraph&, DFSVisitor, ColorMap, typename graph_traits::vertex_descriptor) [with VertexListGraph = R_adjacency_list; DFSVisitor = detail::components_recorder; ColorMap = shared_array_property_map, long unsigned int> >; typename graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/depth_first_search.hpp:397:42: required from ‘void boost::graph::detail::depth_first_search_impl::operator()(const Graph&, const ArgPack&) const [with ArgPack = boost::parameter::aux::arg_list >, boost::parameter::aux::empty_arg_list, std::integral_constant >; Graph = R_adjacency_list]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/depth_first_search.hpp:406:5: required from ‘typename boost::result_of(Param0, const ArgPack&)>::type boost::graph::depth_first_search_with_named_params(const Param0&, const ArgPack&) [with Param0 = R_adjacency_list; ArgPack = boost::parameter::aux::arg_list >, boost::parameter::aux::empty_arg_list, std::integral_constant >; typename boost::result_of(Param0, const ArgPack&)>::type = void]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/depth_first_search.hpp:409:1: required from ‘typename boost::result_of(Param0, const typename boost::detail::convert_bgl_params_to_boost_parameter >::type&)>::type boost::depth_first_search(const Param0&, const bgl_named_params&) [with Param0 = R_adjacency_list; P = detail::components_recorder; T = graph_visitor_t; R = no_property; typename result_of(Param0, const typename detail::convert_bgl_params_to_boost_parameter >::type&)>::type = void; typename detail::convert_bgl_params_to_boost_parameter >::type = parameter::aux::arg_list >, parameter::aux::empty_arg_list, std::integral_constant >]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/connected_components.hpp:106:23: required from ‘typename boost::property_traits::value_type boost::connected_components(const Graph&, ComponentMap, typename enable_if_c::traversal_category>::value, graph::detail::no_parameter>::type) [with Graph = R_adjacency_list; ComponentMap = int*; typename property_traits::value_type = int; typename enable_if_c::traversal_category>::value, graph::detail::no_parameter>::type = graph::detail::no_parameter; typename graph_traits::traversal_category = undir_adj_list_traversal_tag]’ interfaces.cpp:205:29: required from here /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::Convertible::~Convertible() [with X = boost::undir_adj_list_traversal_tag; Y = boost::incidence_graph_tag]’ 37 | ~model() | ^ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:208:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 208 | BOOST_CONCEPT_USAGE(Convertible) { | ^~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::constraint::failed() [with Model = boost::ReadablePropertyMapConcept]’: /home/omnipath/local/R/4.4-3.20/BH/include/boost/property_map/property_map.hpp:206:7: required from ‘void boost::ReadWritePropertyMapConcept::constraints() [with PMap = int*; Key = long unsigned int]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::ReadWritePropertyMapConcept]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied >::value’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_)>’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/strong_components.hpp:115:9: [ skipping 2 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/strong_components.hpp:177:63: required from ‘typename boost::property_traits::value_type boost::detail::scc_helper2(const Graph&, ComponentMap, RootMap, const boost::bgl_named_params&, DiscoverTimeMap) [with Graph = R_adjacency_list; ComponentMap = int*; RootMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>; P = int; T = int; R = boost::no_property; DiscoverTimeMap = boost::param_not_found; typename boost::property_traits::value_type = int]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/strong_components.hpp:205:31: required from ‘static typename boost::property_traits::value_type boost::detail::strong_comp_dispatch1::apply(const Graph&, ComponentMap, const boost::bgl_named_params&, boost::param_not_found) [with Graph = R_adjacency_list; ComponentMap = int*; P = int; T = int; R = boost::no_property; typename boost::property_traits::value_type = int]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/strong_components.hpp:220:63: required from ‘typename boost::property_traits::value_type boost::detail::scc_helper1(const Graph&, ComponentMap, const boost::bgl_named_params&, RootMap) [with Graph = R_adjacency_list; ComponentMap = int*; RootMap = boost::param_not_found; P = int; T = int; R = boost::no_property; typename boost::property_traits::value_type = int]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/strong_components.hpp:235:31: required from ‘typename boost::property_traits::value_type boost::strong_components(const Graph&, ComponentMap, const bgl_named_params&, typename enable_if_c::traversal_category>::value, graph::detail::no_parameter>::type) [with Graph = R_adjacency_list; ComponentMap = int*; P = int; T = int; R = no_property; typename property_traits::value_type = int; typename enable_if_c::traversal_category>::value, graph::detail::no_parameter>::type = graph::detail::no_parameter; typename graph_traits::traversal_category = adj_list_dir_traversal_tag]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/strong_components.hpp:249:29: required from ‘typename boost::property_traits::value_type boost::strong_components(const Graph&, ComponentMap, typename enable_if_c::traversal_category>::value, graph::detail::no_parameter>::type) [with Graph = R_adjacency_list; ComponentMap = int*; typename property_traits::value_type = int; typename enable_if_c::traversal_category>::value, graph::detail::no_parameter>::type = graph::detail::no_parameter; typename graph_traits::traversal_category = adj_list_dir_traversal_tag]’ interfaces.cpp:232:26: required from here /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:65:52: warning: ‘this’ pointer is null [-Wnonnull] 65 | static void failed() { ((Model*)0)->constraints(); } | ~~~~~~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/property_map/property_map.hpp:147:10: note: in a call to non-static member function ‘void boost::ReadablePropertyMapConcept::constraints() [with PMap = int*; Key = long unsigned int]’ 147 | void constraints() { | ^~~~~~~~~~~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::Convertible]’: /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements >]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:208:5: required from ‘struct boost::Convertible’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:206:3: required from ‘struct boost::ConvertibleConcept’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::ConvertibleConcept]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied >::value’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:45:51: [ skipping 4 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/strong_components.hpp:177:63: required from ‘typename boost::property_traits::value_type boost::detail::scc_helper2(const Graph&, ComponentMap, RootMap, const boost::bgl_named_params&, DiscoverTimeMap) [with Graph = R_adjacency_list; ComponentMap = int*; RootMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>; P = int; T = int; R = boost::no_property; DiscoverTimeMap = boost::param_not_found; typename boost::property_traits::value_type = int]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/strong_components.hpp:205:31: required from ‘static typename boost::property_traits::value_type boost::detail::strong_comp_dispatch1::apply(const Graph&, ComponentMap, const boost::bgl_named_params&, boost::param_not_found) [with Graph = R_adjacency_list; ComponentMap = int*; P = int; T = int; R = boost::no_property; typename boost::property_traits::value_type = int]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/strong_components.hpp:220:63: required from ‘typename boost::property_traits::value_type boost::detail::scc_helper1(const Graph&, ComponentMap, const boost::bgl_named_params&, RootMap) [with Graph = R_adjacency_list; ComponentMap = int*; RootMap = boost::param_not_found; P = int; T = int; R = boost::no_property; typename boost::property_traits::value_type = int]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/strong_components.hpp:235:31: required from ‘typename boost::property_traits::value_type boost::strong_components(const Graph&, ComponentMap, const bgl_named_params&, typename enable_if_c::traversal_category>::value, graph::detail::no_parameter>::type) [with Graph = R_adjacency_list; ComponentMap = int*; P = int; T = int; R = no_property; typename property_traits::value_type = int; typename enable_if_c::traversal_category>::value, graph::detail::no_parameter>::type = graph::detail::no_parameter; typename graph_traits::traversal_category = adj_list_dir_traversal_tag]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/strong_components.hpp:249:29: required from ‘typename boost::property_traits::value_type boost::strong_components(const Graph&, ComponentMap, typename enable_if_c::traversal_category>::value, graph::detail::no_parameter>::type) [with Graph = R_adjacency_list; ComponentMap = int*; typename property_traits::value_type = int; typename enable_if_c::traversal_category>::value, graph::detail::no_parameter>::type = graph::detail::no_parameter; typename graph_traits::traversal_category = adj_list_dir_traversal_tag]’ interfaces.cpp:232:26: required from here /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::Convertible::~Convertible() [with X = long unsigned int; Y = long unsigned int]’ 37 | ~model() | ^ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:208:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 208 | BOOST_CONCEPT_USAGE(Convertible) { | ^~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements > >]’: /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/graph_concepts.hpp:52:50: required from ‘struct boost::concepts::MultiPassInputIterator >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::concepts::MultiPassInputIterator >]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied > >::value’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied > >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_ >)>’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/graph_concepts.hpp:184:9: [ skipping 3 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/biconnected_components.hpp:250:47: required from ‘static std::pair boost::detail::bicomp_dispatch3::apply(const Graph&, ComponentMap, OutputIterator, VertexIndexMap, DiscoverTimeMap, LowPointMap, const boost::bgl_named_params&, boost::param_not_found) [with Graph = R_adjacency_list; ComponentMap = boost::dummy_property_map; OutputIterator = std::back_insert_iterator >; VertexIndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>; DiscoverTimeMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>; LowPointMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>; P = int; T = boost::buffer_param_t; R = boost::no_property]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/biconnected_components.hpp:295:60: required from ‘static std::pair boost::detail::bicomp_dispatch2::apply(const Graph&, ComponentMap, OutputIterator, VertexIndexMap, DiscoverTimeMap, const boost::bgl_named_params&, boost::param_not_found) [with Graph = R_adjacency_list; ComponentMap = boost::dummy_property_map; OutputIterator = std::back_insert_iterator >; VertexIndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>; DiscoverTimeMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>; P = int; T = boost::buffer_param_t; R = boost::no_property]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/biconnected_components.hpp:336:60: required from ‘static std::pair boost::detail::bicomp_dispatch1::apply(const Graph&, ComponentMap, OutputIterator, VertexIndexMap, const boost::bgl_named_params&, boost::param_not_found) [with Graph = R_adjacency_list; ComponentMap = boost::dummy_property_map; OutputIterator = std::back_insert_iterator >; VertexIndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>; P = int; T = boost::buffer_param_t; R = boost::no_property]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/biconnected_components.hpp:368:60: required from ‘std::pair boost::biconnected_components(const Graph&, ComponentMap, OutputIterator, const bgl_named_params&) [with Graph = R_adjacency_list; ComponentMap = dummy_property_map; OutputIterator = std::back_insert_iterator >; P = int; T = buffer_param_t; R = no_property]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/biconnected_components.hpp:433:34: required from ‘OutputIterator boost::articulation_points(const Graph&, OutputIterator) [with Graph = R_adjacency_list; OutputIterator = std::back_insert_iterator >]’ interfaces.cpp:300:28: required from here /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::concepts::MultiPassInputIterator >]’ 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ^ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::MultiPassInputIterator >]’: /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/graph_concepts.hpp:184:9: required from ‘boost::concepts::VertexListGraph::~VertexListGraph() [with G = R_adjacency_list]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/graph_concepts.hpp:176:1: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::VertexListGraphConcept >]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/biconnected_components.hpp:188:9: required from ‘std::pair boost::detail::biconnected_components_impl(const Graph&, ComponentMap, OutputIterator, VertexIndexMap, DiscoverTimeMap, LowPointMap, PredecessorMap, DFSVisitor) [with Graph = R_adjacency_list; ComponentMap = boost::dummy_property_map; OutputIterator = std::back_insert_iterator >; VertexIndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>; DiscoverTimeMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>; LowPointMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>; PredecessorMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>; DFSVisitor = boost::dfs_visitor<>]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/biconnected_components.hpp:250:47: required from ‘static std::pair boost::detail::bicomp_dispatch3::apply(const Graph&, ComponentMap, OutputIterator, VertexIndexMap, DiscoverTimeMap, LowPointMap, const boost::bgl_named_params&, boost::param_not_found) [with Graph = R_adjacency_list; ComponentMap = boost::dummy_property_map; OutputIterator = std::back_insert_iterator >; VertexIndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>; DiscoverTimeMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>; LowPointMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>; P = int; T = boost::buffer_param_t; R = boost::no_property]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/biconnected_components.hpp:295:60: required from ‘static std::pair boost::detail::bicomp_dispatch2::apply(const Graph&, ComponentMap, OutputIterator, VertexIndexMap, DiscoverTimeMap, const boost::bgl_named_params&, boost::param_not_found) [with Graph = R_adjacency_list; ComponentMap = boost::dummy_property_map; OutputIterator = std::back_insert_iterator >; VertexIndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>; DiscoverTimeMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>; P = int; T = boost::buffer_param_t; R = boost::no_property]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/biconnected_components.hpp:336:60: required from ‘static std::pair boost::detail::bicomp_dispatch1::apply(const Graph&, ComponentMap, OutputIterator, VertexIndexMap, const boost::bgl_named_params&, boost::param_not_found) [with Graph = R_adjacency_list; ComponentMap = boost::dummy_property_map; OutputIterator = std::back_insert_iterator >; VertexIndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>; P = int; T = boost::buffer_param_t; R = boost::no_property]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/biconnected_components.hpp:368:60: required from ‘std::pair boost::biconnected_components(const Graph&, ComponentMap, OutputIterator, const bgl_named_params&) [with Graph = R_adjacency_list; ComponentMap = dummy_property_map; OutputIterator = std::back_insert_iterator >; P = int; T = buffer_param_t; R = no_property]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/biconnected_components.hpp:433:34: required from ‘OutputIterator boost::articulation_points(const Graph&, OutputIterator) [with Graph = R_adjacency_list; OutputIterator = std::back_insert_iterator >]’ interfaces.cpp:300:28: required from here /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::concepts::MultiPassInputIterator::~MultiPassInputIterator() [with T = boost::range_detail::integer_iterator]’ 37 | ~model() | ^ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/graph_concepts.hpp:52:50: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 52 | BOOST_concept(MultiPassInputIterator, (T)) { BOOST_CONCEPT_USAGE( | ^~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements >]’: /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:208:5: required from ‘struct boost::Convertible’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::Convertible]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied >::value’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_)>’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/graph_concepts.hpp:185:9: [ skipping 3 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/biconnected_components.hpp:250:47: required from ‘static std::pair boost::detail::bicomp_dispatch3::apply(const Graph&, ComponentMap, OutputIterator, VertexIndexMap, DiscoverTimeMap, LowPointMap, const boost::bgl_named_params&, boost::param_not_found) [with Graph = R_adjacency_list; ComponentMap = boost::dummy_property_map; OutputIterator = std::back_insert_iterator >; VertexIndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>; DiscoverTimeMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>; LowPointMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>; P = int; T = boost::buffer_param_t; R = boost::no_property]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/biconnected_components.hpp:295:60: required from ‘static std::pair boost::detail::bicomp_dispatch2::apply(const Graph&, ComponentMap, OutputIterator, VertexIndexMap, DiscoverTimeMap, const boost::bgl_named_params&, boost::param_not_found) [with Graph = R_adjacency_list; ComponentMap = boost::dummy_property_map; OutputIterator = std::back_insert_iterator >; VertexIndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>; DiscoverTimeMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>; P = int; T = boost::buffer_param_t; R = boost::no_property]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/biconnected_components.hpp:336:60: required from ‘static std::pair boost::detail::bicomp_dispatch1::apply(const Graph&, ComponentMap, OutputIterator, VertexIndexMap, const boost::bgl_named_params&, boost::param_not_found) [with Graph = R_adjacency_list; ComponentMap = boost::dummy_property_map; OutputIterator = std::back_insert_iterator >; VertexIndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>; P = int; T = boost::buffer_param_t; R = boost::no_property]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/biconnected_components.hpp:368:60: required from ‘std::pair boost::biconnected_components(const Graph&, ComponentMap, OutputIterator, const bgl_named_params&) [with Graph = R_adjacency_list; ComponentMap = dummy_property_map; OutputIterator = std::back_insert_iterator >; P = int; T = buffer_param_t; R = no_property]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/biconnected_components.hpp:433:34: required from ‘OutputIterator boost::articulation_points(const Graph&, OutputIterator) [with Graph = R_adjacency_list; OutputIterator = std::back_insert_iterator >]’ interfaces.cpp:300:28: required from here /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::Convertible]’ 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ^ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::Convertible]’: /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/graph_concepts.hpp:185:9: required from ‘boost::concepts::VertexListGraph::~VertexListGraph() [with G = R_adjacency_list]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/graph_concepts.hpp:176:1: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::VertexListGraphConcept >]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/biconnected_components.hpp:188:9: required from ‘std::pair boost::detail::biconnected_components_impl(const Graph&, ComponentMap, OutputIterator, VertexIndexMap, DiscoverTimeMap, LowPointMap, PredecessorMap, DFSVisitor) [with Graph = R_adjacency_list; ComponentMap = boost::dummy_property_map; OutputIterator = std::back_insert_iterator >; VertexIndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>; DiscoverTimeMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>; LowPointMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>; PredecessorMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>; DFSVisitor = boost::dfs_visitor<>]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/biconnected_components.hpp:250:47: required from ‘static std::pair boost::detail::bicomp_dispatch3::apply(const Graph&, ComponentMap, OutputIterator, VertexIndexMap, DiscoverTimeMap, LowPointMap, const boost::bgl_named_params&, boost::param_not_found) [with Graph = R_adjacency_list; ComponentMap = boost::dummy_property_map; OutputIterator = std::back_insert_iterator >; VertexIndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>; DiscoverTimeMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>; LowPointMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>; P = int; T = boost::buffer_param_t; R = boost::no_property]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/biconnected_components.hpp:295:60: required from ‘static std::pair boost::detail::bicomp_dispatch2::apply(const Graph&, ComponentMap, OutputIterator, VertexIndexMap, DiscoverTimeMap, const boost::bgl_named_params&, boost::param_not_found) [with Graph = R_adjacency_list; ComponentMap = boost::dummy_property_map; OutputIterator = std::back_insert_iterator >; VertexIndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>; DiscoverTimeMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>; P = int; T = boost::buffer_param_t; R = boost::no_property]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/biconnected_components.hpp:336:60: required from ‘static std::pair boost::detail::bicomp_dispatch1::apply(const Graph&, ComponentMap, OutputIterator, VertexIndexMap, const boost::bgl_named_params&, boost::param_not_found) [with Graph = R_adjacency_list; ComponentMap = boost::dummy_property_map; OutputIterator = std::back_insert_iterator >; VertexIndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>; P = int; T = boost::buffer_param_t; R = boost::no_property]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/biconnected_components.hpp:368:60: required from ‘std::pair boost::biconnected_components(const Graph&, ComponentMap, OutputIterator, const bgl_named_params&) [with Graph = R_adjacency_list; ComponentMap = dummy_property_map; OutputIterator = std::back_insert_iterator >; P = int; T = buffer_param_t; R = no_property]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/biconnected_components.hpp:433:34: required from ‘OutputIterator boost::articulation_points(const Graph&, OutputIterator) [with Graph = R_adjacency_list; OutputIterator = std::back_insert_iterator >]’ interfaces.cpp:300:28: required from here /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::Convertible::~Convertible() [with X = boost::undir_adj_list_traversal_tag; Y = boost::vertex_list_graph_tag]’ 37 | ~model() | ^ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:208:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 208 | BOOST_CONCEPT_USAGE(Convertible) { | ^~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::Convertible]’: /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements >]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:208:5: required from ‘struct boost::Convertible’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:206:3: required from ‘struct boost::ConvertibleConcept’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::ConvertibleConcept]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied >::value’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:45:51: [ skipping 8 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/biconnected_components.hpp:250:47: required from ‘static std::pair boost::detail::bicomp_dispatch3::apply(const Graph&, ComponentMap, OutputIterator, VertexIndexMap, DiscoverTimeMap, LowPointMap, const boost::bgl_named_params&, boost::param_not_found) [with Graph = R_adjacency_list; ComponentMap = boost::dummy_property_map; OutputIterator = std::back_insert_iterator >; VertexIndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>; DiscoverTimeMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>; LowPointMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>; P = int; T = boost::buffer_param_t; R = boost::no_property]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/biconnected_components.hpp:295:60: required from ‘static std::pair boost::detail::bicomp_dispatch2::apply(const Graph&, ComponentMap, OutputIterator, VertexIndexMap, DiscoverTimeMap, const boost::bgl_named_params&, boost::param_not_found) [with Graph = R_adjacency_list; ComponentMap = boost::dummy_property_map; OutputIterator = std::back_insert_iterator >; VertexIndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>; DiscoverTimeMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>; P = int; T = boost::buffer_param_t; R = boost::no_property]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/biconnected_components.hpp:336:60: required from ‘static std::pair boost::detail::bicomp_dispatch1::apply(const Graph&, ComponentMap, OutputIterator, VertexIndexMap, const boost::bgl_named_params&, boost::param_not_found) [with Graph = R_adjacency_list; ComponentMap = boost::dummy_property_map; OutputIterator = std::back_insert_iterator >; VertexIndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>; P = int; T = boost::buffer_param_t; R = boost::no_property]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/biconnected_components.hpp:368:60: required from ‘std::pair boost::biconnected_components(const Graph&, ComponentMap, OutputIterator, const bgl_named_params&) [with Graph = R_adjacency_list; ComponentMap = dummy_property_map; OutputIterator = std::back_insert_iterator >; P = int; T = buffer_param_t; R = no_property]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/biconnected_components.hpp:433:34: required from ‘OutputIterator boost::articulation_points(const Graph&, OutputIterator) [with Graph = R_adjacency_list; OutputIterator = std::back_insert_iterator >]’ interfaces.cpp:300:28: required from here /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::Convertible::~Convertible() [with X = boost::read_write_property_map_tag; Y = boost::writable_property_map_tag]’ 37 | ~model() | ^ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:208:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 208 | BOOST_CONCEPT_USAGE(Convertible) { | ^~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::concepts::MultiPassInputIterator > > >, boost::edge_residual_capacity_t> >, boost::keep_all, boost::filtered_graph > > >, boost::no_property, boost::listS>, boost::is_residual_edge > > >, boost::edge_residual_capacity_t> >, boost::keep_all> >, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > > > >*, std::vector > > > >, std::allocator > > > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >]’: /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements > > >, boost::edge_residual_capacity_t> >, boost::keep_all, boost::filtered_graph > > >, boost::no_property, boost::listS>, boost::is_residual_edge > > >, boost::edge_residual_capacity_t> >, boost::keep_all> >, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > > > >*, std::vector > > > >, std::allocator > > > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > > >]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/graph_concepts.hpp:52:50: required from ‘struct boost::concepts::MultiPassInputIterator > > >, boost::edge_residual_capacity_t> >, boost::keep_all, boost::filtered_graph > > >, boost::no_property, boost::listS>, boost::is_residual_edge > > >, boost::edge_residual_capacity_t> >, boost::keep_all> >, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > > > >*, std::vector > > > >, std::allocator > > > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::concepts::MultiPassInputIterator > > >, boost::edge_residual_capacity_t> >, boost::keep_all, boost::filtered_graph > > >, boost::no_property, boost::listS>, boost::is_residual_edge > > >, boost::edge_residual_capacity_t> >, boost::keep_all> >, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > > > >*, std::vector > > > >, std::allocator > > > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied > > >, boost::edge_residual_capacity_t> >, boost::keep_all, boost::filtered_graph > > >, boost::no_property, boost::listS>, boost::is_residual_edge > > >, boost::edge_residual_capacity_t> >, boost::keep_all> >, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > > > >*, std::vector > > > >, std::allocator > > > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > > >::value’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied > > >, boost::edge_residual_capacity_t> >, boost::keep_all, boost::filtered_graph > > >, boost::no_property, boost::listS>, boost::is_residual_edge > > >, boost::edge_residual_capacity_t> >, boost::keep_all> >, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > > > >*, std::vector > > > >, std::allocator > > > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > > >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:72:8: [ skipping 3 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/depth_first_search.hpp:129:9: required from ‘void boost::breadth_first_visit(const IncidenceGraph&, SourceIterator, SourceIterator, Buffer&, BFSVisitor, ColorMap) [with IncidenceGraph = filtered_graph > > >, no_property, listS>, is_residual_edge > > >, edge_residual_capacity_t> >, keep_all>; Buffer = queue > >; BFSVisitor = bfs_visitor*, on_tree_edge> >; ColorMap = default_color_type*; SourceIterator = long unsigned int*]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/breadth_first_search.hpp:136:24: required from ‘void boost::breadth_first_search(const VertexListGraph&, SourceIterator, SourceIterator, Buffer&, BFSVisitor, ColorMap) [with VertexListGraph = filtered_graph > > >, no_property, listS>, is_residual_edge > > >, edge_residual_capacity_t> >, keep_all>; SourceIterator = long unsigned int*; Buffer = queue > >; BFSVisitor = bfs_visitor*, on_tree_edge> >; ColorMap = default_color_type*]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/breadth_first_search.hpp:147:25: required from ‘void boost::breadth_first_search(const VertexListGraph&, typename graph_traits::vertex_descriptor, Buffer&, BFSVisitor, ColorMap) [with VertexListGraph = filtered_graph > > >, no_property, listS>, is_residual_edge > > >, edge_residual_capacity_t> >, keep_all>; Buffer = queue > >; BFSVisitor = bfs_visitor*, on_tree_edge> >; ColorMap = default_color_type*; typename graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/edmonds_karp_max_flow.hpp:101:29: required from ‘typename boost::property_traits::value_type boost::edmonds_karp_max_flow(Graph&, typename graph_traits::vertex_descriptor, typename graph_traits::vertex_descriptor, CapacityEdgeMap, ResidualCapacityEdgeMap, ReverseEdgeMap, ColorMap, PredEdgeMap) [with Graph = adjacency_list > > >, no_property, listS>; CapacityEdgeMap = adj_list_edge_property_map > > >, edge_capacity_t>; ResidualCapacityEdgeMap = adj_list_edge_property_map > > >, edge_residual_capacity_t>; ReverseEdgeMap = adj_list_edge_property_map, detail::edge_desc_impl&, long unsigned int, property > > >, edge_reverse_t>; ColorMap = default_color_type*; PredEdgeMap = detail::edge_desc_impl*; typename property_traits::value_type = long unsigned int; typename graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/edge_connectivity.hpp:145:42: required from ‘typename boost::graph_traits::degree_size_type boost::edge_connectivity(VertexListGraph&, OutputIterator) [with VertexListGraph = R_adjacency_list; OutputIterator = std::back_insert_iterator > >; typename graph_traits::degree_size_type = long unsigned int]’ interfaces.cpp:326:34: required from here /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::concepts::MultiPassInputIterator::~MultiPassInputIterator() [with T = boost::iterators::filter_iterator > > >, boost::edge_residual_capacity_t> >, boost::keep_all, boost::filtered_graph > > >, boost::no_property, boost::listS>, boost::is_residual_edge > > >, boost::edge_residual_capacity_t> >, boost::keep_all> >, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > > > >*, std::vector > > > >, std::allocator > > > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> >]’ 37 | ~model() | ^ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/graph_concepts.hpp:52:50: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 52 | BOOST_concept(MultiPassInputIterator, (T)) { BOOST_CONCEPT_USAGE( | ^~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::Convertible]’: /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements >]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:208:5: required from ‘struct boost::Convertible’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:206:3: required from ‘struct boost::ConvertibleConcept’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::ConvertibleConcept]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied >::value’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:45:51: [ skipping 13 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/breadth_first_search.hpp:136:24: required from ‘void boost::breadth_first_search(const VertexListGraph&, SourceIterator, SourceIterator, Buffer&, BFSVisitor, ColorMap) [with VertexListGraph = R_adjacency_list; SourceIterator = long unsigned int*; Buffer = queue > >; BFSVisitor = bfs_time_visitor; ColorMap = two_bit_color_map, long unsigned int> >]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/breadth_first_search.hpp:147:25: required from ‘void boost::breadth_first_search(const VertexListGraph&, typename graph_traits::vertex_descriptor, Buffer&, BFSVisitor, ColorMap) [with VertexListGraph = R_adjacency_list; Buffer = queue > >; BFSVisitor = bfs_time_visitor; ColorMap = two_bit_color_map, long unsigned int> >; typename graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/breadth_first_search.hpp:262:29: required from ‘void boost::detail::bfs_helper(VertexListGraph&, typename boost::graph_traits::vertex_descriptor, ColorMap, BFSVisitor, const boost::bgl_named_params&, mpl_::false_) [with VertexListGraph = R_adjacency_list; ColorMap = boost::two_bit_color_map, long unsigned int> >; BFSVisitor = bfs_time_visitor; P = bfs_time_visitor; T = boost::graph_visitor_t; R = boost::no_property; typename boost::graph_traits::vertex_descriptor = long unsigned int; mpl_::false_ = mpl_::bool_]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/breadth_first_search.hpp:309:23: required from ‘static void boost::detail::bfs_dispatch::apply(VertexListGraph&, typename boost::graph_traits::vertex_descriptor, const boost::bgl_named_params&, boost::param_not_found) [with VertexListGraph = R_adjacency_list; P = bfs_time_visitor; T = boost::graph_visitor_t; R = boost::no_property; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/breadth_first_search.hpp:339:37: required from ‘void boost::breadth_first_search(const VertexListGraph&, typename graph_traits::vertex_descriptor, const bgl_named_params&) [with VertexListGraph = R_adjacency_list; P = bfs_time_visitor; T = graph_visitor_t; R = no_property; typename graph_traits::vertex_descriptor = long unsigned int]’ interfaces.cpp:113:29: required from here /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::Convertible::~Convertible() [with X = boost::read_write_property_map_tag; Y = boost::readable_property_map_tag]’ 37 | ~model() | ^ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:208:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 208 | BOOST_CONCEPT_USAGE(Convertible) { | ^~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::DefaultConstructible]’: /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements >]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:137:5: required from ‘struct boost::DefaultConstructible’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::DefaultConstructible]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied >::value’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:72:8: [ skipping 11 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/depth_first_search.hpp:129:9: required from ‘void boost::detail::depth_first_visit_impl(const IncidenceGraph&, typename boost::graph_traits::vertex_descriptor, DFSVisitor&, ColorMap, TerminatorFunc) [with IncidenceGraph = R_adjacency_list; DFSVisitor = dfs_time_visitor; ColorMap = boost::shared_array_property_map, long unsigned int> >; TerminatorFunc = nontruth2; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/depth_first_search.hpp:286:39: required from ‘void boost::depth_first_search(const VertexListGraph&, DFSVisitor, ColorMap, typename graph_traits::vertex_descriptor) [with VertexListGraph = R_adjacency_list; DFSVisitor = dfs_time_visitor; ColorMap = shared_array_property_map, long unsigned int> >; typename graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/depth_first_search.hpp:397:42: required from ‘void boost::graph::detail::depth_first_search_impl::operator()(const Graph&, const ArgPack&) const [with ArgPack = boost::parameter::aux::arg_list >, boost::parameter::aux::empty_arg_list, std::integral_constant >; Graph = R_adjacency_list]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/depth_first_search.hpp:406:5: required from ‘typename boost::result_of(Param0, const ArgPack&)>::type boost::graph::depth_first_search_with_named_params(const Param0&, const ArgPack&) [with Param0 = R_adjacency_list; ArgPack = boost::parameter::aux::arg_list >, boost::parameter::aux::empty_arg_list, std::integral_constant >; typename boost::result_of(Param0, const ArgPack&)>::type = void]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/depth_first_search.hpp:409:1: required from ‘typename boost::result_of(Param0, const typename boost::detail::convert_bgl_params_to_boost_parameter >::type&)>::type boost::depth_first_search(const Param0&, const bgl_named_params&) [with Param0 = R_adjacency_list; P = dfs_time_visitor; T = graph_visitor_t; R = no_property; typename result_of(Param0, const typename detail::convert_bgl_params_to_boost_parameter >::type&)>::type = void; typename detail::convert_bgl_params_to_boost_parameter >::type = parameter::aux::arg_list >, parameter::aux::empty_arg_list, std::integral_constant >]’ interfaces.cpp:158:27: required from here /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::DefaultConstructible::~DefaultConstructible() [with TT = long unsigned int]’ 37 | ~model() | ^ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:137:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 137 | BOOST_CONCEPT_USAGE(DefaultConstructible) { | ^~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::EqualityComparable]’: /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements >]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:233:5: required from ‘struct boost::EqualityComparable’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::EqualityComparable]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied >::value’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:72:8: [ skipping 11 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/depth_first_search.hpp:129:9: required from ‘void boost::detail::depth_first_visit_impl(const IncidenceGraph&, typename boost::graph_traits::vertex_descriptor, DFSVisitor&, ColorMap, TerminatorFunc) [with IncidenceGraph = R_adjacency_list; DFSVisitor = dfs_time_visitor; ColorMap = boost::shared_array_property_map, long unsigned int> >; TerminatorFunc = nontruth2; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/depth_first_search.hpp:286:39: required from ‘void boost::depth_first_search(const VertexListGraph&, DFSVisitor, ColorMap, typename graph_traits::vertex_descriptor) [with VertexListGraph = R_adjacency_list; DFSVisitor = dfs_time_visitor; ColorMap = shared_array_property_map, long unsigned int> >; typename graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/depth_first_search.hpp:397:42: required from ‘void boost::graph::detail::depth_first_search_impl::operator()(const Graph&, const ArgPack&) const [with ArgPack = boost::parameter::aux::arg_list >, boost::parameter::aux::empty_arg_list, std::integral_constant >; Graph = R_adjacency_list]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/depth_first_search.hpp:406:5: required from ‘typename boost::result_of(Param0, const ArgPack&)>::type boost::graph::depth_first_search_with_named_params(const Param0&, const ArgPack&) [with Param0 = R_adjacency_list; ArgPack = boost::parameter::aux::arg_list >, boost::parameter::aux::empty_arg_list, std::integral_constant >; typename boost::result_of(Param0, const ArgPack&)>::type = void]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/depth_first_search.hpp:409:1: required from ‘typename boost::result_of(Param0, const typename boost::detail::convert_bgl_params_to_boost_parameter >::type&)>::type boost::depth_first_search(const Param0&, const bgl_named_params&) [with Param0 = R_adjacency_list; P = dfs_time_visitor; T = graph_visitor_t; R = no_property; typename result_of(Param0, const typename detail::convert_bgl_params_to_boost_parameter >::type&)>::type = void; typename detail::convert_bgl_params_to_boost_parameter >::type = parameter::aux::arg_list >, parameter::aux::empty_arg_list, std::integral_constant >]’ interfaces.cpp:158:27: required from here /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::EqualityComparable::~EqualityComparable() [with TT = long unsigned int]’ 37 | ~model() | ^ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:233:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 233 | BOOST_CONCEPT_USAGE(EqualityComparable) { | ^~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::Assignable]’: /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements >]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:145:5: required from ‘struct boost::Assignable’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::Assignable]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied >::value’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:72:8: [ skipping 11 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/depth_first_search.hpp:129:9: required from ‘void boost::detail::depth_first_visit_impl(const IncidenceGraph&, typename boost::graph_traits::vertex_descriptor, DFSVisitor&, ColorMap, TerminatorFunc) [with IncidenceGraph = R_adjacency_list; DFSVisitor = dfs_time_visitor; ColorMap = boost::shared_array_property_map, long unsigned int> >; TerminatorFunc = nontruth2; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/depth_first_search.hpp:286:39: required from ‘void boost::depth_first_search(const VertexListGraph&, DFSVisitor, ColorMap, typename graph_traits::vertex_descriptor) [with VertexListGraph = R_adjacency_list; DFSVisitor = dfs_time_visitor; ColorMap = shared_array_property_map, long unsigned int> >; typename graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/depth_first_search.hpp:397:42: required from ‘void boost::graph::detail::depth_first_search_impl::operator()(const Graph&, const ArgPack&) const [with ArgPack = boost::parameter::aux::arg_list >, boost::parameter::aux::empty_arg_list, std::integral_constant >; Graph = R_adjacency_list]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/depth_first_search.hpp:406:5: required from ‘typename boost::result_of(Param0, const ArgPack&)>::type boost::graph::depth_first_search_with_named_params(const Param0&, const ArgPack&) [with Param0 = R_adjacency_list; ArgPack = boost::parameter::aux::arg_list >, boost::parameter::aux::empty_arg_list, std::integral_constant >; typename boost::result_of(Param0, const ArgPack&)>::type = void]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/depth_first_search.hpp:409:1: required from ‘typename boost::result_of(Param0, const typename boost::detail::convert_bgl_params_to_boost_parameter >::type&)>::type boost::depth_first_search(const Param0&, const bgl_named_params&) [with Param0 = R_adjacency_list; P = dfs_time_visitor; T = graph_visitor_t; R = no_property; typename result_of(Param0, const typename detail::convert_bgl_params_to_boost_parameter >::type&)>::type = void; typename detail::convert_bgl_params_to_boost_parameter >::type = parameter::aux::arg_list >, parameter::aux::empty_arg_list, std::integral_constant >]’ interfaces.cpp:158:27: required from here /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::Assignable::~Assignable() [with TT = long unsigned int]’ 37 | ~model() | ^ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:145:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 145 | BOOST_CONCEPT_USAGE(Assignable) { | ^~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements >*, std::vector >, std::allocator > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >]’: /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:145:5: required from ‘struct boost::Assignable >*, std::vector >, std::allocator > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:502:3: required from ‘struct boost::InputIterator >*, std::vector >, std::allocator > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::InputIterator >*, std::vector >, std::allocator > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> >]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied >*, std::vector >, std::allocator > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::value’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied >*, std::vector >, std::allocator > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:72:8: [ skipping 5 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/depth_first_search.hpp:129:9: required from ‘void boost::detail::depth_first_visit_impl(const IncidenceGraph&, typename boost::graph_traits::vertex_descriptor, DFSVisitor&, ColorMap, TerminatorFunc) [with IncidenceGraph = R_adjacency_list; DFSVisitor = dfs_time_visitor; ColorMap = boost::shared_array_property_map, long unsigned int> >; TerminatorFunc = nontruth2; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/depth_first_search.hpp:286:39: required from ‘void boost::depth_first_search(const VertexListGraph&, DFSVisitor, ColorMap, typename graph_traits::vertex_descriptor) [with VertexListGraph = R_adjacency_list; DFSVisitor = dfs_time_visitor; ColorMap = shared_array_property_map, long unsigned int> >; typename graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/depth_first_search.hpp:397:42: required from ‘void boost::graph::detail::depth_first_search_impl::operator()(const Graph&, const ArgPack&) const [with ArgPack = boost::parameter::aux::arg_list >, boost::parameter::aux::empty_arg_list, std::integral_constant >; Graph = R_adjacency_list]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/depth_first_search.hpp:406:5: required from ‘typename boost::result_of(Param0, const ArgPack&)>::type boost::graph::depth_first_search_with_named_params(const Param0&, const ArgPack&) [with Param0 = R_adjacency_list; ArgPack = boost::parameter::aux::arg_list >, boost::parameter::aux::empty_arg_list, std::integral_constant >; typename boost::result_of(Param0, const ArgPack&)>::type = void]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/depth_first_search.hpp:409:1: required from ‘typename boost::result_of(Param0, const typename boost::detail::convert_bgl_params_to_boost_parameter >::type&)>::type boost::depth_first_search(const Param0&, const bgl_named_params&) [with Param0 = R_adjacency_list; P = dfs_time_visitor; T = graph_visitor_t; R = no_property; typename result_of(Param0, const typename detail::convert_bgl_params_to_boost_parameter >::type&)>::type = void; typename detail::convert_bgl_params_to_boost_parameter >::type = parameter::aux::arg_list >, parameter::aux::empty_arg_list, std::integral_constant >]’ interfaces.cpp:158:27: required from here /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::Assignable >*, std::vector >, std::allocator > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> >]’ 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ^ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements >*, std::vector >, std::allocator > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >]’: /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:233:5: required from ‘struct boost::EqualityComparable >*, std::vector >, std::allocator > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:502:3: required from ‘struct boost::InputIterator >*, std::vector >, std::allocator > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::InputIterator >*, std::vector >, std::allocator > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> >]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied >*, std::vector >, std::allocator > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::value’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied >*, std::vector >, std::allocator > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:72:8: [ skipping 5 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/depth_first_search.hpp:129:9: required from ‘void boost::detail::depth_first_visit_impl(const IncidenceGraph&, typename boost::graph_traits::vertex_descriptor, DFSVisitor&, ColorMap, TerminatorFunc) [with IncidenceGraph = R_adjacency_list; DFSVisitor = dfs_time_visitor; ColorMap = boost::shared_array_property_map, long unsigned int> >; TerminatorFunc = nontruth2; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/depth_first_search.hpp:286:39: required from ‘void boost::depth_first_search(const VertexListGraph&, DFSVisitor, ColorMap, typename graph_traits::vertex_descriptor) [with VertexListGraph = R_adjacency_list; DFSVisitor = dfs_time_visitor; ColorMap = shared_array_property_map, long unsigned int> >; typename graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/depth_first_search.hpp:397:42: required from ‘void boost::graph::detail::depth_first_search_impl::operator()(const Graph&, const ArgPack&) const [with ArgPack = boost::parameter::aux::arg_list >, boost::parameter::aux::empty_arg_list, std::integral_constant >; Graph = R_adjacency_list]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/depth_first_search.hpp:406:5: required from ‘typename boost::result_of(Param0, const ArgPack&)>::type boost::graph::depth_first_search_with_named_params(const Param0&, const ArgPack&) [with Param0 = R_adjacency_list; ArgPack = boost::parameter::aux::arg_list >, boost::parameter::aux::empty_arg_list, std::integral_constant >; typename boost::result_of(Param0, const ArgPack&)>::type = void]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/depth_first_search.hpp:409:1: required from ‘typename boost::result_of(Param0, const typename boost::detail::convert_bgl_params_to_boost_parameter >::type&)>::type boost::depth_first_search(const Param0&, const bgl_named_params&) [with Param0 = R_adjacency_list; P = dfs_time_visitor; T = graph_visitor_t; R = no_property; typename result_of(Param0, const typename detail::convert_bgl_params_to_boost_parameter >::type&)>::type = void; typename detail::convert_bgl_params_to_boost_parameter >::type = parameter::aux::arg_list >, parameter::aux::empty_arg_list, std::integral_constant >]’ interfaces.cpp:158:27: required from here /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::EqualityComparable >*, std::vector >, std::allocator > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> >]’ 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ^ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements >*, std::vector >, std::allocator > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >]’: /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:512:7: required from ‘struct boost::InputIterator >*, std::vector >, std::allocator > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::InputIterator >*, std::vector >, std::allocator > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> >]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied >*, std::vector >, std::allocator > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::value’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied >*, std::vector >, std::allocator > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_ >*, std::vector >, std::allocator > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> >)>’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/graph_concepts.hpp:53:35: [ skipping 4 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/depth_first_search.hpp:129:9: required from ‘void boost::detail::depth_first_visit_impl(const IncidenceGraph&, typename boost::graph_traits::vertex_descriptor, DFSVisitor&, ColorMap, TerminatorFunc) [with IncidenceGraph = R_adjacency_list; DFSVisitor = dfs_time_visitor; ColorMap = boost::shared_array_property_map, long unsigned int> >; TerminatorFunc = nontruth2; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/depth_first_search.hpp:286:39: required from ‘void boost::depth_first_search(const VertexListGraph&, DFSVisitor, ColorMap, typename graph_traits::vertex_descriptor) [with VertexListGraph = R_adjacency_list; DFSVisitor = dfs_time_visitor; ColorMap = shared_array_property_map, long unsigned int> >; typename graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/depth_first_search.hpp:397:42: required from ‘void boost::graph::detail::depth_first_search_impl::operator()(const Graph&, const ArgPack&) const [with ArgPack = boost::parameter::aux::arg_list >, boost::parameter::aux::empty_arg_list, std::integral_constant >; Graph = R_adjacency_list]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/depth_first_search.hpp:406:5: required from ‘typename boost::result_of(Param0, const ArgPack&)>::type boost::graph::depth_first_search_with_named_params(const Param0&, const ArgPack&) [with Param0 = R_adjacency_list; ArgPack = boost::parameter::aux::arg_list >, boost::parameter::aux::empty_arg_list, std::integral_constant >; typename boost::result_of(Param0, const ArgPack&)>::type = void]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/depth_first_search.hpp:409:1: required from ‘typename boost::result_of(Param0, const typename boost::detail::convert_bgl_params_to_boost_parameter >::type&)>::type boost::depth_first_search(const Param0&, const bgl_named_params&) [with Param0 = R_adjacency_list; P = dfs_time_visitor; T = graph_visitor_t; R = no_property; typename result_of(Param0, const typename detail::convert_bgl_params_to_boost_parameter >::type&)>::type = void; typename detail::convert_bgl_params_to_boost_parameter >::type = parameter::aux::arg_list >, parameter::aux::empty_arg_list, std::integral_constant >]’ interfaces.cpp:158:27: required from here /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::InputIterator >*, std::vector >, std::allocator > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> >]’ 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ^ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::InputIterator >*, std::vector >, std::allocator > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> >]’: /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/graph_concepts.hpp:53:35: required from ‘boost::concepts::MultiPassInputIterator::~MultiPassInputIterator() [with T = boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator >*, std::vector >, std::allocator > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::MultiPassInputIterator >*, std::vector >, std::allocator > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> >]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/graph_concepts.hpp:89:9: required from ‘boost::concepts::IncidenceGraph::~IncidenceGraph() [with G = R_adjacency_list]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/graph_concepts.hpp:75:1: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::IncidenceGraphConcept >]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/depth_first_search.hpp:129:9: required from ‘void boost::detail::depth_first_visit_impl(const IncidenceGraph&, typename boost::graph_traits::vertex_descriptor, DFSVisitor&, ColorMap, TerminatorFunc) [with IncidenceGraph = R_adjacency_list; DFSVisitor = dfs_time_visitor; ColorMap = boost::shared_array_property_map, long unsigned int> >; TerminatorFunc = nontruth2; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/depth_first_search.hpp:286:39: required from ‘void boost::depth_first_search(const VertexListGraph&, DFSVisitor, ColorMap, typename graph_traits::vertex_descriptor) [with VertexListGraph = R_adjacency_list; DFSVisitor = dfs_time_visitor; ColorMap = shared_array_property_map, long unsigned int> >; typename graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/depth_first_search.hpp:397:42: required from ‘void boost::graph::detail::depth_first_search_impl::operator()(const Graph&, const ArgPack&) const [with ArgPack = boost::parameter::aux::arg_list >, boost::parameter::aux::empty_arg_list, std::integral_constant >; Graph = R_adjacency_list]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/depth_first_search.hpp:406:5: required from ‘typename boost::result_of(Param0, const ArgPack&)>::type boost::graph::depth_first_search_with_named_params(const Param0&, const ArgPack&) [with Param0 = R_adjacency_list; ArgPack = boost::parameter::aux::arg_list >, boost::parameter::aux::empty_arg_list, std::integral_constant >; typename boost::result_of(Param0, const ArgPack&)>::type = void]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/depth_first_search.hpp:409:1: required from ‘typename boost::result_of(Param0, const typename boost::detail::convert_bgl_params_to_boost_parameter >::type&)>::type boost::depth_first_search(const Param0&, const bgl_named_params&) [with Param0 = R_adjacency_list; P = dfs_time_visitor; T = graph_visitor_t; R = no_property; typename result_of(Param0, const typename detail::convert_bgl_params_to_boost_parameter >::type&)>::type = void; typename detail::convert_bgl_params_to_boost_parameter >::type = parameter::aux::arg_list >, parameter::aux::empty_arg_list, std::integral_constant >]’ interfaces.cpp:158:27: required from here /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::InputIterator::~InputIterator() [with TT = boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator >*, std::vector >, std::allocator > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>]’ 37 | ~model() | ^ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:512:7: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 512 | BOOST_CONCEPT_USAGE(InputIterator) | ^~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::concepts::MultiPassInputIterator > >, boost::property >*, std::vector > >, boost::property >, std::allocator > >, boost::property > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> >]’: /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements > >, boost::property >*, std::vector > >, boost::property >, std::allocator > >, boost::property > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/graph_concepts.hpp:52:50: required from ‘struct boost::concepts::MultiPassInputIterator > >, boost::property >*, std::vector > >, boost::property >, std::allocator > >, boost::property > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::concepts::MultiPassInputIterator > >, boost::property >*, std::vector > >, boost::property >, std::allocator > >, boost::property > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> >]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied > >, boost::property >*, std::vector > >, boost::property >, std::allocator > >, boost::property > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::value’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied > >, boost::property >*, std::vector > >, boost::property >, std::allocator > >, boost::property > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:72:8: [ skipping 4 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/depth_first_search.hpp:286:39: required from ‘void boost::depth_first_search(const VertexListGraph&, DFSVisitor, ColorMap, typename graph_traits::vertex_descriptor) [with VertexListGraph = R_adjacency_list; DFSVisitor = detail::components_recorder; ColorMap = shared_array_property_map, long unsigned int> >; typename graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/depth_first_search.hpp:397:42: required from ‘void boost::graph::detail::depth_first_search_impl::operator()(const Graph&, const ArgPack&) const [with ArgPack = boost::parameter::aux::arg_list >, boost::parameter::aux::empty_arg_list, std::integral_constant >; Graph = R_adjacency_list]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/depth_first_search.hpp:406:5: required from ‘typename boost::result_of(Param0, const ArgPack&)>::type boost::graph::depth_first_search_with_named_params(const Param0&, const ArgPack&) [with Param0 = R_adjacency_list; ArgPack = boost::parameter::aux::arg_list >, boost::parameter::aux::empty_arg_list, std::integral_constant >; typename boost::result_of(Param0, const ArgPack&)>::type = void]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/depth_first_search.hpp:409:1: required from ‘typename boost::result_of(Param0, const typename boost::detail::convert_bgl_params_to_boost_parameter >::type&)>::type boost::depth_first_search(const Param0&, const bgl_named_params&) [with Param0 = R_adjacency_list; P = detail::components_recorder; T = graph_visitor_t; R = no_property; typename result_of(Param0, const typename detail::convert_bgl_params_to_boost_parameter >::type&)>::type = void; typename detail::convert_bgl_params_to_boost_parameter >::type = parameter::aux::arg_list >, parameter::aux::empty_arg_list, std::integral_constant >]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/connected_components.hpp:106:23: required from ‘typename boost::property_traits::value_type boost::connected_components(const Graph&, ComponentMap, typename enable_if_c::traversal_category>::value, graph::detail::no_parameter>::type) [with Graph = R_adjacency_list; ComponentMap = int*; typename property_traits::value_type = int; typename enable_if_c::traversal_category>::value, graph::detail::no_parameter>::type = graph::detail::no_parameter; typename graph_traits::traversal_category = undir_adj_list_traversal_tag]’ interfaces.cpp:205:29: required from here /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::concepts::MultiPassInputIterator::~MultiPassInputIterator() [with T = boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >, boost::property >*, std::vector > >, boost::property >, std::allocator > >, boost::property > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>]’ 37 | ~model() | ^ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/graph_concepts.hpp:52:50: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 52 | BOOST_concept(MultiPassInputIterator, (T)) { BOOST_CONCEPT_USAGE( | ^~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::DefaultConstructible >]’: /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements > >]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:137:5: required from ‘struct boost::DefaultConstructible >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::DefaultConstructible >]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied > >::value’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied > >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:72:8: [ skipping 4 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/depth_first_search.hpp:286:39: required from ‘void boost::depth_first_search(const VertexListGraph&, DFSVisitor, ColorMap, typename graph_traits::vertex_descriptor) [with VertexListGraph = R_adjacency_list; DFSVisitor = detail::components_recorder; ColorMap = shared_array_property_map, long unsigned int> >; typename graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/depth_first_search.hpp:397:42: required from ‘void boost::graph::detail::depth_first_search_impl::operator()(const Graph&, const ArgPack&) const [with ArgPack = boost::parameter::aux::arg_list >, boost::parameter::aux::empty_arg_list, std::integral_constant >; Graph = R_adjacency_list]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/depth_first_search.hpp:406:5: required from ‘typename boost::result_of(Param0, const ArgPack&)>::type boost::graph::depth_first_search_with_named_params(const Param0&, const ArgPack&) [with Param0 = R_adjacency_list; ArgPack = boost::parameter::aux::arg_list >, boost::parameter::aux::empty_arg_list, std::integral_constant >; typename boost::result_of(Param0, const ArgPack&)>::type = void]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/depth_first_search.hpp:409:1: required from ‘typename boost::result_of(Param0, const typename boost::detail::convert_bgl_params_to_boost_parameter >::type&)>::type boost::depth_first_search(const Param0&, const bgl_named_params&) [with Param0 = R_adjacency_list; P = detail::components_recorder; T = graph_visitor_t; R = no_property; typename result_of(Param0, const typename detail::convert_bgl_params_to_boost_parameter >::type&)>::type = void; typename detail::convert_bgl_params_to_boost_parameter >::type = parameter::aux::arg_list >, parameter::aux::empty_arg_list, std::integral_constant >]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/connected_components.hpp:106:23: required from ‘typename boost::property_traits::value_type boost::connected_components(const Graph&, ComponentMap, typename enable_if_c::traversal_category>::value, graph::detail::no_parameter>::type) [with Graph = R_adjacency_list; ComponentMap = int*; typename property_traits::value_type = int; typename enable_if_c::traversal_category>::value, graph::detail::no_parameter>::type = graph::detail::no_parameter; typename graph_traits::traversal_category = undir_adj_list_traversal_tag]’ interfaces.cpp:205:29: required from here /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::DefaultConstructible::~DefaultConstructible() [with TT = boost::detail::edge_desc_impl]’ 37 | ~model() | ^ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:137:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 137 | BOOST_CONCEPT_USAGE(DefaultConstructible) { | ^~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::EqualityComparable >]’: /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements > >]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:233:5: required from ‘struct boost::EqualityComparable >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::EqualityComparable >]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied > >::value’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied > >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:72:8: [ skipping 4 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/depth_first_search.hpp:286:39: required from ‘void boost::depth_first_search(const VertexListGraph&, DFSVisitor, ColorMap, typename graph_traits::vertex_descriptor) [with VertexListGraph = R_adjacency_list; DFSVisitor = detail::components_recorder; ColorMap = shared_array_property_map, long unsigned int> >; typename graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/depth_first_search.hpp:397:42: required from ‘void boost::graph::detail::depth_first_search_impl::operator()(const Graph&, const ArgPack&) const [with ArgPack = boost::parameter::aux::arg_list >, boost::parameter::aux::empty_arg_list, std::integral_constant >; Graph = R_adjacency_list]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/depth_first_search.hpp:406:5: required from ‘typename boost::result_of(Param0, const ArgPack&)>::type boost::graph::depth_first_search_with_named_params(const Param0&, const ArgPack&) [with Param0 = R_adjacency_list; ArgPack = boost::parameter::aux::arg_list >, boost::parameter::aux::empty_arg_list, std::integral_constant >; typename boost::result_of(Param0, const ArgPack&)>::type = void]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/depth_first_search.hpp:409:1: required from ‘typename boost::result_of(Param0, const typename boost::detail::convert_bgl_params_to_boost_parameter >::type&)>::type boost::depth_first_search(const Param0&, const bgl_named_params&) [with Param0 = R_adjacency_list; P = detail::components_recorder; T = graph_visitor_t; R = no_property; typename result_of(Param0, const typename detail::convert_bgl_params_to_boost_parameter >::type&)>::type = void; typename detail::convert_bgl_params_to_boost_parameter >::type = parameter::aux::arg_list >, parameter::aux::empty_arg_list, std::integral_constant >]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/connected_components.hpp:106:23: required from ‘typename boost::property_traits::value_type boost::connected_components(const Graph&, ComponentMap, typename enable_if_c::traversal_category>::value, graph::detail::no_parameter>::type) [with Graph = R_adjacency_list; ComponentMap = int*; typename property_traits::value_type = int; typename enable_if_c::traversal_category>::value, graph::detail::no_parameter>::type = graph::detail::no_parameter; typename graph_traits::traversal_category = undir_adj_list_traversal_tag]’ interfaces.cpp:205:29: required from here /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::EqualityComparable::~EqualityComparable() [with TT = boost::detail::edge_desc_impl]’ 37 | ~model() | ^ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:233:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 233 | BOOST_CONCEPT_USAGE(EqualityComparable) { | ^~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::Assignable >]’: /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements > >]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:145:5: required from ‘struct boost::Assignable >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::Assignable >]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied > >::value’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied > >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:72:8: [ skipping 4 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/depth_first_search.hpp:286:39: required from ‘void boost::depth_first_search(const VertexListGraph&, DFSVisitor, ColorMap, typename graph_traits::vertex_descriptor) [with VertexListGraph = R_adjacency_list; DFSVisitor = detail::components_recorder; ColorMap = shared_array_property_map, long unsigned int> >; typename graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/depth_first_search.hpp:397:42: required from ‘void boost::graph::detail::depth_first_search_impl::operator()(const Graph&, const ArgPack&) const [with ArgPack = boost::parameter::aux::arg_list >, boost::parameter::aux::empty_arg_list, std::integral_constant >; Graph = R_adjacency_list]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/depth_first_search.hpp:406:5: required from ‘typename boost::result_of(Param0, const ArgPack&)>::type boost::graph::depth_first_search_with_named_params(const Param0&, const ArgPack&) [with Param0 = R_adjacency_list; ArgPack = boost::parameter::aux::arg_list >, boost::parameter::aux::empty_arg_list, std::integral_constant >; typename boost::result_of(Param0, const ArgPack&)>::type = void]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/depth_first_search.hpp:409:1: required from ‘typename boost::result_of(Param0, const typename boost::detail::convert_bgl_params_to_boost_parameter >::type&)>::type boost::depth_first_search(const Param0&, const bgl_named_params&) [with Param0 = R_adjacency_list; P = detail::components_recorder; T = graph_visitor_t; R = no_property; typename result_of(Param0, const typename detail::convert_bgl_params_to_boost_parameter >::type&)>::type = void; typename detail::convert_bgl_params_to_boost_parameter >::type = parameter::aux::arg_list >, parameter::aux::empty_arg_list, std::integral_constant >]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/connected_components.hpp:106:23: required from ‘typename boost::property_traits::value_type boost::connected_components(const Graph&, ComponentMap, typename enable_if_c::traversal_category>::value, graph::detail::no_parameter>::type) [with Graph = R_adjacency_list; ComponentMap = int*; typename property_traits::value_type = int; typename enable_if_c::traversal_category>::value, graph::detail::no_parameter>::type = graph::detail::no_parameter; typename graph_traits::traversal_category = undir_adj_list_traversal_tag]’ interfaces.cpp:205:29: required from here /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::Assignable::~Assignable() [with TT = boost::detail::edge_desc_impl]’ 37 | ~model() | ^ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:145:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 145 | BOOST_CONCEPT_USAGE(Assignable) { | ^~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::Convertible]’: /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements >]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:208:5: required from ‘struct boost::Convertible’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::Convertible]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied >::value’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:72:8: [ skipping 4 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/depth_first_search.hpp:286:39: required from ‘void boost::depth_first_search(const VertexListGraph&, DFSVisitor, ColorMap, typename graph_traits::vertex_descriptor) [with VertexListGraph = R_adjacency_list; DFSVisitor = detail::components_recorder; ColorMap = shared_array_property_map, long unsigned int> >; typename graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/depth_first_search.hpp:397:42: required from ‘void boost::graph::detail::depth_first_search_impl::operator()(const Graph&, const ArgPack&) const [with ArgPack = boost::parameter::aux::arg_list >, boost::parameter::aux::empty_arg_list, std::integral_constant >; Graph = R_adjacency_list]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/depth_first_search.hpp:406:5: required from ‘typename boost::result_of(Param0, const ArgPack&)>::type boost::graph::depth_first_search_with_named_params(const Param0&, const ArgPack&) [with Param0 = R_adjacency_list; ArgPack = boost::parameter::aux::arg_list >, boost::parameter::aux::empty_arg_list, std::integral_constant >; typename boost::result_of(Param0, const ArgPack&)>::type = void]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/depth_first_search.hpp:409:1: required from ‘typename boost::result_of(Param0, const typename boost::detail::convert_bgl_params_to_boost_parameter >::type&)>::type boost::depth_first_search(const Param0&, const bgl_named_params&) [with Param0 = R_adjacency_list; P = detail::components_recorder; T = graph_visitor_t; R = no_property; typename result_of(Param0, const typename detail::convert_bgl_params_to_boost_parameter >::type&)>::type = void; typename detail::convert_bgl_params_to_boost_parameter >::type = parameter::aux::arg_list >, parameter::aux::empty_arg_list, std::integral_constant >]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/connected_components.hpp:106:23: required from ‘typename boost::property_traits::value_type boost::connected_components(const Graph&, ComponentMap, typename enable_if_c::traversal_category>::value, graph::detail::no_parameter>::type) [with Graph = R_adjacency_list; ComponentMap = int*; typename property_traits::value_type = int; typename enable_if_c::traversal_category>::value, graph::detail::no_parameter>::type = graph::detail::no_parameter; typename graph_traits::traversal_category = undir_adj_list_traversal_tag]’ interfaces.cpp:205:29: required from here /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::Convertible::~Convertible() [with X = boost::undir_adj_list_traversal_tag; Y = boost::incidence_graph_tag]’ 37 | ~model() | ^ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:208:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 208 | BOOST_CONCEPT_USAGE(Convertible) { | ^~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::concepts::MultiPassInputIterator >]’: /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements > >]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/graph_concepts.hpp:52:50: required from ‘struct boost::concepts::MultiPassInputIterator >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::concepts::MultiPassInputIterator >]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied > >::value’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied > >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:72:8: [ skipping 4 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/biconnected_components.hpp:250:47: required from ‘static std::pair boost::detail::bicomp_dispatch3::apply(const Graph&, ComponentMap, OutputIterator, VertexIndexMap, DiscoverTimeMap, LowPointMap, const boost::bgl_named_params&, boost::param_not_found) [with Graph = R_adjacency_list; ComponentMap = boost::dummy_property_map; OutputIterator = std::back_insert_iterator >; VertexIndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>; DiscoverTimeMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>; LowPointMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>; P = int; T = boost::buffer_param_t; R = boost::no_property]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/biconnected_components.hpp:295:60: required from ‘static std::pair boost::detail::bicomp_dispatch2::apply(const Graph&, ComponentMap, OutputIterator, VertexIndexMap, DiscoverTimeMap, const boost::bgl_named_params&, boost::param_not_found) [with Graph = R_adjacency_list; ComponentMap = boost::dummy_property_map; OutputIterator = std::back_insert_iterator >; VertexIndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>; DiscoverTimeMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>; P = int; T = boost::buffer_param_t; R = boost::no_property]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/biconnected_components.hpp:336:60: required from ‘static std::pair boost::detail::bicomp_dispatch1::apply(const Graph&, ComponentMap, OutputIterator, VertexIndexMap, const boost::bgl_named_params&, boost::param_not_found) [with Graph = R_adjacency_list; ComponentMap = boost::dummy_property_map; OutputIterator = std::back_insert_iterator >; VertexIndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>; P = int; T = boost::buffer_param_t; R = boost::no_property]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/biconnected_components.hpp:368:60: required from ‘std::pair boost::biconnected_components(const Graph&, ComponentMap, OutputIterator, const bgl_named_params&) [with Graph = R_adjacency_list; ComponentMap = dummy_property_map; OutputIterator = std::back_insert_iterator >; P = int; T = buffer_param_t; R = no_property]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/biconnected_components.hpp:433:34: required from ‘OutputIterator boost::articulation_points(const Graph&, OutputIterator) [with Graph = R_adjacency_list; OutputIterator = std::back_insert_iterator >]’ interfaces.cpp:300:28: required from here /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::concepts::MultiPassInputIterator::~MultiPassInputIterator() [with T = boost::range_detail::integer_iterator]’ 37 | ~model() | ^ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/graph_concepts.hpp:52:50: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 52 | BOOST_concept(MultiPassInputIterator, (T)) { BOOST_CONCEPT_USAGE( | ^~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::Convertible]’: /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements >]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:208:5: required from ‘struct boost::Convertible’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::Convertible]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied >::value’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:72:8: [ skipping 4 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/biconnected_components.hpp:250:47: required from ‘static std::pair boost::detail::bicomp_dispatch3::apply(const Graph&, ComponentMap, OutputIterator, VertexIndexMap, DiscoverTimeMap, LowPointMap, const boost::bgl_named_params&, boost::param_not_found) [with Graph = R_adjacency_list; ComponentMap = boost::dummy_property_map; OutputIterator = std::back_insert_iterator >; VertexIndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>; DiscoverTimeMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>; LowPointMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>; P = int; T = boost::buffer_param_t; R = boost::no_property]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/biconnected_components.hpp:295:60: required from ‘static std::pair boost::detail::bicomp_dispatch2::apply(const Graph&, ComponentMap, OutputIterator, VertexIndexMap, DiscoverTimeMap, const boost::bgl_named_params&, boost::param_not_found) [with Graph = R_adjacency_list; ComponentMap = boost::dummy_property_map; OutputIterator = std::back_insert_iterator >; VertexIndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>; DiscoverTimeMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>; P = int; T = boost::buffer_param_t; R = boost::no_property]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/biconnected_components.hpp:336:60: required from ‘static std::pair boost::detail::bicomp_dispatch1::apply(const Graph&, ComponentMap, OutputIterator, VertexIndexMap, const boost::bgl_named_params&, boost::param_not_found) [with Graph = R_adjacency_list; ComponentMap = boost::dummy_property_map; OutputIterator = std::back_insert_iterator >; VertexIndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>; P = int; T = boost::buffer_param_t; R = boost::no_property]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/biconnected_components.hpp:368:60: required from ‘std::pair boost::biconnected_components(const Graph&, ComponentMap, OutputIterator, const bgl_named_params&) [with Graph = R_adjacency_list; ComponentMap = dummy_property_map; OutputIterator = std::back_insert_iterator >; P = int; T = buffer_param_t; R = no_property]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/biconnected_components.hpp:433:34: required from ‘OutputIterator boost::articulation_points(const Graph&, OutputIterator) [with Graph = R_adjacency_list; OutputIterator = std::back_insert_iterator >]’ interfaces.cpp:300:28: required from here /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::Convertible::~Convertible() [with X = boost::undir_adj_list_traversal_tag; Y = boost::vertex_list_graph_tag]’ 37 | ~model() | ^ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:208:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 208 | BOOST_CONCEPT_USAGE(Convertible) { | ^~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements > > >, boost::edge_residual_capacity_t> >, boost::keep_all, boost::filtered_graph > > >, boost::no_property, boost::listS>, boost::is_residual_edge > > >, boost::edge_residual_capacity_t> >, boost::keep_all> >, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > > > >*, std::vector > > > >, std::allocator > > > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > > >]’: /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:145:5: required from ‘struct boost::Assignable > > >, boost::edge_residual_capacity_t> >, boost::keep_all, boost::filtered_graph > > >, boost::no_property, boost::listS>, boost::is_residual_edge > > >, boost::edge_residual_capacity_t> >, boost::keep_all> >, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > > > >*, std::vector > > > >, std::allocator > > > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:502:3: required from ‘struct boost::InputIterator > > >, boost::edge_residual_capacity_t> >, boost::keep_all, boost::filtered_graph > > >, boost::no_property, boost::listS>, boost::is_residual_edge > > >, boost::edge_residual_capacity_t> >, boost::keep_all> >, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > > > >*, std::vector > > > >, std::allocator > > > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::InputIterator > > >, boost::edge_residual_capacity_t> >, boost::keep_all, boost::filtered_graph > > >, boost::no_property, boost::listS>, boost::is_residual_edge > > >, boost::edge_residual_capacity_t> >, boost::keep_all> >, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > > > >*, std::vector > > > >, std::allocator > > > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied > > >, boost::edge_residual_capacity_t> >, boost::keep_all, boost::filtered_graph > > >, boost::no_property, boost::listS>, boost::is_residual_edge > > >, boost::edge_residual_capacity_t> >, boost::keep_all> >, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > > > >*, std::vector > > > >, std::allocator > > > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > > >::value’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied > > >, boost::edge_residual_capacity_t> >, boost::keep_all, boost::filtered_graph > > >, boost::no_property, boost::listS>, boost::is_residual_edge > > >, boost::edge_residual_capacity_t> >, boost::keep_all> >, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > > > >*, std::vector > > > >, std::allocator > > > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > > >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:72:8: [ skipping 5 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/depth_first_search.hpp:129:9: required from ‘void boost::breadth_first_visit(const IncidenceGraph&, SourceIterator, SourceIterator, Buffer&, BFSVisitor, ColorMap) [with IncidenceGraph = filtered_graph > > >, no_property, listS>, is_residual_edge > > >, edge_residual_capacity_t> >, keep_all>; Buffer = queue > >; BFSVisitor = bfs_visitor*, on_tree_edge> >; ColorMap = default_color_type*; SourceIterator = long unsigned int*]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/breadth_first_search.hpp:136:24: required from ‘void boost::breadth_first_search(const VertexListGraph&, SourceIterator, SourceIterator, Buffer&, BFSVisitor, ColorMap) [with VertexListGraph = filtered_graph > > >, no_property, listS>, is_residual_edge > > >, edge_residual_capacity_t> >, keep_all>; SourceIterator = long unsigned int*; Buffer = queue > >; BFSVisitor = bfs_visitor*, on_tree_edge> >; ColorMap = default_color_type*]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/breadth_first_search.hpp:147:25: required from ‘void boost::breadth_first_search(const VertexListGraph&, typename graph_traits::vertex_descriptor, Buffer&, BFSVisitor, ColorMap) [with VertexListGraph = filtered_graph > > >, no_property, listS>, is_residual_edge > > >, edge_residual_capacity_t> >, keep_all>; Buffer = queue > >; BFSVisitor = bfs_visitor*, on_tree_edge> >; ColorMap = default_color_type*; typename graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/edmonds_karp_max_flow.hpp:101:29: required from ‘typename boost::property_traits::value_type boost::edmonds_karp_max_flow(Graph&, typename graph_traits::vertex_descriptor, typename graph_traits::vertex_descriptor, CapacityEdgeMap, ResidualCapacityEdgeMap, ReverseEdgeMap, ColorMap, PredEdgeMap) [with Graph = adjacency_list > > >, no_property, listS>; CapacityEdgeMap = adj_list_edge_property_map > > >, edge_capacity_t>; ResidualCapacityEdgeMap = adj_list_edge_property_map > > >, edge_residual_capacity_t>; ReverseEdgeMap = adj_list_edge_property_map, detail::edge_desc_impl&, long unsigned int, property > > >, edge_reverse_t>; ColorMap = default_color_type*; PredEdgeMap = detail::edge_desc_impl*; typename property_traits::value_type = long unsigned int; typename graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/edge_connectivity.hpp:145:42: required from ‘typename boost::graph_traits::degree_size_type boost::edge_connectivity(VertexListGraph&, OutputIterator) [with VertexListGraph = R_adjacency_list; OutputIterator = std::back_insert_iterator > >; typename graph_traits::degree_size_type = long unsigned int]’ interfaces.cpp:326:34: required from here /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::Assignable > > >, boost::edge_residual_capacity_t> >, boost::keep_all, boost::filtered_graph > > >, boost::no_property, boost::listS>, boost::is_residual_edge > > >, boost::edge_residual_capacity_t> >, boost::keep_all> >, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > > > >*, std::vector > > > >, std::allocator > > > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >]’ 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ^ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements > > >, boost::edge_residual_capacity_t> >, boost::keep_all, boost::filtered_graph > > >, boost::no_property, boost::listS>, boost::is_residual_edge > > >, boost::edge_residual_capacity_t> >, boost::keep_all> >, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > > > >*, std::vector > > > >, std::allocator > > > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > > >]’: /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:233:5: required from ‘struct boost::EqualityComparable > > >, boost::edge_residual_capacity_t> >, boost::keep_all, boost::filtered_graph > > >, boost::no_property, boost::listS>, boost::is_residual_edge > > >, boost::edge_residual_capacity_t> >, boost::keep_all> >, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > > > >*, std::vector > > > >, std::allocator > > > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:502:3: required from ‘struct boost::InputIterator > > >, boost::edge_residual_capacity_t> >, boost::keep_all, boost::filtered_graph > > >, boost::no_property, boost::listS>, boost::is_residual_edge > > >, boost::edge_residual_capacity_t> >, boost::keep_all> >, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > > > >*, std::vector > > > >, std::allocator > > > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::InputIterator > > >, boost::edge_residual_capacity_t> >, boost::keep_all, boost::filtered_graph > > >, boost::no_property, boost::listS>, boost::is_residual_edge > > >, boost::edge_residual_capacity_t> >, boost::keep_all> >, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > > > >*, std::vector > > > >, std::allocator > > > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied > > >, boost::edge_residual_capacity_t> >, boost::keep_all, boost::filtered_graph > > >, boost::no_property, boost::listS>, boost::is_residual_edge > > >, boost::edge_residual_capacity_t> >, boost::keep_all> >, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > > > >*, std::vector > > > >, std::allocator > > > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > > >::value’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied > > >, boost::edge_residual_capacity_t> >, boost::keep_all, boost::filtered_graph > > >, boost::no_property, boost::listS>, boost::is_residual_edge > > >, boost::edge_residual_capacity_t> >, boost::keep_all> >, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > > > >*, std::vector > > > >, std::allocator > > > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > > >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:72:8: [ skipping 5 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/depth_first_search.hpp:129:9: required from ‘void boost::breadth_first_visit(const IncidenceGraph&, SourceIterator, SourceIterator, Buffer&, BFSVisitor, ColorMap) [with IncidenceGraph = filtered_graph > > >, no_property, listS>, is_residual_edge > > >, edge_residual_capacity_t> >, keep_all>; Buffer = queue > >; BFSVisitor = bfs_visitor*, on_tree_edge> >; ColorMap = default_color_type*; SourceIterator = long unsigned int*]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/breadth_first_search.hpp:136:24: required from ‘void boost::breadth_first_search(const VertexListGraph&, SourceIterator, SourceIterator, Buffer&, BFSVisitor, ColorMap) [with VertexListGraph = filtered_graph > > >, no_property, listS>, is_residual_edge > > >, edge_residual_capacity_t> >, keep_all>; SourceIterator = long unsigned int*; Buffer = queue > >; BFSVisitor = bfs_visitor*, on_tree_edge> >; ColorMap = default_color_type*]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/breadth_first_search.hpp:147:25: required from ‘void boost::breadth_first_search(const VertexListGraph&, typename graph_traits::vertex_descriptor, Buffer&, BFSVisitor, ColorMap) [with VertexListGraph = filtered_graph > > >, no_property, listS>, is_residual_edge > > >, edge_residual_capacity_t> >, keep_all>; Buffer = queue > >; BFSVisitor = bfs_visitor*, on_tree_edge> >; ColorMap = default_color_type*; typename graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/edmonds_karp_max_flow.hpp:101:29: required from ‘typename boost::property_traits::value_type boost::edmonds_karp_max_flow(Graph&, typename graph_traits::vertex_descriptor, typename graph_traits::vertex_descriptor, CapacityEdgeMap, ResidualCapacityEdgeMap, ReverseEdgeMap, ColorMap, PredEdgeMap) [with Graph = adjacency_list > > >, no_property, listS>; CapacityEdgeMap = adj_list_edge_property_map > > >, edge_capacity_t>; ResidualCapacityEdgeMap = adj_list_edge_property_map > > >, edge_residual_capacity_t>; ReverseEdgeMap = adj_list_edge_property_map, detail::edge_desc_impl&, long unsigned int, property > > >, edge_reverse_t>; ColorMap = default_color_type*; PredEdgeMap = detail::edge_desc_impl*; typename property_traits::value_type = long unsigned int; typename graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/edge_connectivity.hpp:145:42: required from ‘typename boost::graph_traits::degree_size_type boost::edge_connectivity(VertexListGraph&, OutputIterator) [with VertexListGraph = R_adjacency_list; OutputIterator = std::back_insert_iterator > >; typename graph_traits::degree_size_type = long unsigned int]’ interfaces.cpp:326:34: required from here /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::EqualityComparable > > >, boost::edge_residual_capacity_t> >, boost::keep_all, boost::filtered_graph > > >, boost::no_property, boost::listS>, boost::is_residual_edge > > >, boost::edge_residual_capacity_t> >, boost::keep_all> >, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > > > >*, std::vector > > > >, std::allocator > > > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >]’ 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ^ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements > > >, boost::edge_residual_capacity_t> >, boost::keep_all, boost::filtered_graph > > >, boost::no_property, boost::listS>, boost::is_residual_edge > > >, boost::edge_residual_capacity_t> >, boost::keep_all> >, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > > > >*, std::vector > > > >, std::allocator > > > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > > >]’: /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:512:7: required from ‘struct boost::InputIterator > > >, boost::edge_residual_capacity_t> >, boost::keep_all, boost::filtered_graph > > >, boost::no_property, boost::listS>, boost::is_residual_edge > > >, boost::edge_residual_capacity_t> >, boost::keep_all> >, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > > > >*, std::vector > > > >, std::allocator > > > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::InputIterator > > >, boost::edge_residual_capacity_t> >, boost::keep_all, boost::filtered_graph > > >, boost::no_property, boost::listS>, boost::is_residual_edge > > >, boost::edge_residual_capacity_t> >, boost::keep_all> >, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > > > >*, std::vector > > > >, std::allocator > > > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied > > >, boost::edge_residual_capacity_t> >, boost::keep_all, boost::filtered_graph > > >, boost::no_property, boost::listS>, boost::is_residual_edge > > >, boost::edge_residual_capacity_t> >, boost::keep_all> >, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > > > >*, std::vector > > > >, std::allocator > > > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > > >::value’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied > > >, boost::edge_residual_capacity_t> >, boost::keep_all, boost::filtered_graph > > >, boost::no_property, boost::listS>, boost::is_residual_edge > > >, boost::edge_residual_capacity_t> >, boost::keep_all> >, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > > > >*, std::vector > > > >, std::allocator > > > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > > >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_ > > >, boost::edge_residual_capacity_t> >, boost::keep_all, boost::filtered_graph > > >, boost::no_property, boost::listS>, boost::is_residual_edge > > >, boost::edge_residual_capacity_t> >, boost::keep_all> >, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > > > >*, std::vector > > > >, std::allocator > > > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >)>’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/graph_concepts.hpp:53:35: [ skipping 4 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/depth_first_search.hpp:129:9: required from ‘void boost::breadth_first_visit(const IncidenceGraph&, SourceIterator, SourceIterator, Buffer&, BFSVisitor, ColorMap) [with IncidenceGraph = filtered_graph > > >, no_property, listS>, is_residual_edge > > >, edge_residual_capacity_t> >, keep_all>; Buffer = queue > >; BFSVisitor = bfs_visitor*, on_tree_edge> >; ColorMap = default_color_type*; SourceIterator = long unsigned int*]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/breadth_first_search.hpp:136:24: required from ‘void boost::breadth_first_search(const VertexListGraph&, SourceIterator, SourceIterator, Buffer&, BFSVisitor, ColorMap) [with VertexListGraph = filtered_graph > > >, no_property, listS>, is_residual_edge > > >, edge_residual_capacity_t> >, keep_all>; SourceIterator = long unsigned int*; Buffer = queue > >; BFSVisitor = bfs_visitor*, on_tree_edge> >; ColorMap = default_color_type*]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/breadth_first_search.hpp:147:25: required from ‘void boost::breadth_first_search(const VertexListGraph&, typename graph_traits::vertex_descriptor, Buffer&, BFSVisitor, ColorMap) [with VertexListGraph = filtered_graph > > >, no_property, listS>, is_residual_edge > > >, edge_residual_capacity_t> >, keep_all>; Buffer = queue > >; BFSVisitor = bfs_visitor*, on_tree_edge> >; ColorMap = default_color_type*; typename graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/edmonds_karp_max_flow.hpp:101:29: required from ‘typename boost::property_traits::value_type boost::edmonds_karp_max_flow(Graph&, typename graph_traits::vertex_descriptor, typename graph_traits::vertex_descriptor, CapacityEdgeMap, ResidualCapacityEdgeMap, ReverseEdgeMap, ColorMap, PredEdgeMap) [with Graph = adjacency_list > > >, no_property, listS>; CapacityEdgeMap = adj_list_edge_property_map > > >, edge_capacity_t>; ResidualCapacityEdgeMap = adj_list_edge_property_map > > >, edge_residual_capacity_t>; ReverseEdgeMap = adj_list_edge_property_map, detail::edge_desc_impl&, long unsigned int, property > > >, edge_reverse_t>; ColorMap = default_color_type*; PredEdgeMap = detail::edge_desc_impl*; typename property_traits::value_type = long unsigned int; typename graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/edge_connectivity.hpp:145:42: required from ‘typename boost::graph_traits::degree_size_type boost::edge_connectivity(VertexListGraph&, OutputIterator) [with VertexListGraph = R_adjacency_list; OutputIterator = std::back_insert_iterator > >; typename graph_traits::degree_size_type = long unsigned int]’ interfaces.cpp:326:34: required from here /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::InputIterator > > >, boost::edge_residual_capacity_t> >, boost::keep_all, boost::filtered_graph > > >, boost::no_property, boost::listS>, boost::is_residual_edge > > >, boost::edge_residual_capacity_t> >, boost::keep_all> >, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > > > >*, std::vector > > > >, std::allocator > > > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >]’ 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ^ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::InputIterator > > >, boost::edge_residual_capacity_t> >, boost::keep_all, boost::filtered_graph > > >, boost::no_property, boost::listS>, boost::is_residual_edge > > >, boost::edge_residual_capacity_t> >, boost::keep_all> >, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > > > >*, std::vector > > > >, std::allocator > > > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >]’: /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/graph_concepts.hpp:53:35: required from ‘boost::concepts::MultiPassInputIterator::~MultiPassInputIterator() [with T = boost::iterators::filter_iterator > > >, boost::edge_residual_capacity_t> >, boost::keep_all, boost::filtered_graph > > >, boost::no_property, boost::listS>, boost::is_residual_edge > > >, boost::edge_residual_capacity_t> >, boost::keep_all> >, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > > > >*, std::vector > > > >, std::allocator > > > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> >]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::MultiPassInputIterator > > >, boost::edge_residual_capacity_t> >, boost::keep_all, boost::filtered_graph > > >, boost::no_property, boost::listS>, boost::is_residual_edge > > >, boost::edge_residual_capacity_t> >, boost::keep_all> >, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > > > >*, std::vector > > > >, std::allocator > > > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/graph_concepts.hpp:89:9: required from ‘boost::concepts::IncidenceGraph::~IncidenceGraph() [with G = boost::filtered_graph > > >, boost::no_property, boost::listS>, boost::is_residual_edge > > >, boost::edge_residual_capacity_t> >, boost::keep_all>]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/graph_concepts.hpp:75:1: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::IncidenceGraphConcept > > >, boost::no_property, boost::listS>, boost::is_residual_edge > > >, boost::edge_residual_capacity_t> >, boost::keep_all> >]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/depth_first_search.hpp:129:9: required from ‘void boost::breadth_first_visit(const IncidenceGraph&, SourceIterator, SourceIterator, Buffer&, BFSVisitor, ColorMap) [with IncidenceGraph = filtered_graph > > >, no_property, listS>, is_residual_edge > > >, edge_residual_capacity_t> >, keep_all>; Buffer = queue > >; BFSVisitor = bfs_visitor*, on_tree_edge> >; ColorMap = default_color_type*; SourceIterator = long unsigned int*]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/breadth_first_search.hpp:136:24: required from ‘void boost::breadth_first_search(const VertexListGraph&, SourceIterator, SourceIterator, Buffer&, BFSVisitor, ColorMap) [with VertexListGraph = filtered_graph > > >, no_property, listS>, is_residual_edge > > >, edge_residual_capacity_t> >, keep_all>; SourceIterator = long unsigned int*; Buffer = queue > >; BFSVisitor = bfs_visitor*, on_tree_edge> >; ColorMap = default_color_type*]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/breadth_first_search.hpp:147:25: required from ‘void boost::breadth_first_search(const VertexListGraph&, typename graph_traits::vertex_descriptor, Buffer&, BFSVisitor, ColorMap) [with VertexListGraph = filtered_graph > > >, no_property, listS>, is_residual_edge > > >, edge_residual_capacity_t> >, keep_all>; Buffer = queue > >; BFSVisitor = bfs_visitor*, on_tree_edge> >; ColorMap = default_color_type*; typename graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/edmonds_karp_max_flow.hpp:101:29: required from ‘typename boost::property_traits::value_type boost::edmonds_karp_max_flow(Graph&, typename graph_traits::vertex_descriptor, typename graph_traits::vertex_descriptor, CapacityEdgeMap, ResidualCapacityEdgeMap, ReverseEdgeMap, ColorMap, PredEdgeMap) [with Graph = adjacency_list > > >, no_property, listS>; CapacityEdgeMap = adj_list_edge_property_map > > >, edge_capacity_t>; ResidualCapacityEdgeMap = adj_list_edge_property_map > > >, edge_residual_capacity_t>; ReverseEdgeMap = adj_list_edge_property_map, detail::edge_desc_impl&, long unsigned int, property > > >, edge_reverse_t>; ColorMap = default_color_type*; PredEdgeMap = detail::edge_desc_impl*; typename property_traits::value_type = long unsigned int; typename graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/edge_connectivity.hpp:145:42: required from ‘typename boost::graph_traits::degree_size_type boost::edge_connectivity(VertexListGraph&, OutputIterator) [with VertexListGraph = R_adjacency_list; OutputIterator = std::back_insert_iterator > >; typename graph_traits::degree_size_type = long unsigned int]’ interfaces.cpp:326:34: required from here /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::InputIterator::~InputIterator() [with TT = boost::iterators::filter_iterator > > >, boost::edge_residual_capacity_t> >, boost::keep_all, boost::filtered_graph > > >, boost::no_property, boost::listS>, boost::is_residual_edge > > >, boost::edge_residual_capacity_t> >, boost::keep_all> >, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > > > >*, std::vector > > > >, std::allocator > > > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> >]’ 37 | ~model() | ^ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:512:7: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 512 | BOOST_CONCEPT_USAGE(InputIterator) | ^~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::Assignable >*, std::vector >, std::allocator > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> >]’: /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements >*, std::vector >, std::allocator > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:145:5: required from ‘struct boost::Assignable >*, std::vector >, std::allocator > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:502:3: required from ‘struct boost::InputIterator >*, std::vector >, std::allocator > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::InputIterator >*, std::vector >, std::allocator > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> >]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied >*, std::vector >, std::allocator > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::value’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:45:51: [ skipping 6 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/depth_first_search.hpp:129:9: required from ‘void boost::detail::depth_first_visit_impl(const IncidenceGraph&, typename boost::graph_traits::vertex_descriptor, DFSVisitor&, ColorMap, TerminatorFunc) [with IncidenceGraph = R_adjacency_list; DFSVisitor = dfs_time_visitor; ColorMap = boost::shared_array_property_map, long unsigned int> >; TerminatorFunc = nontruth2; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/depth_first_search.hpp:286:39: required from ‘void boost::depth_first_search(const VertexListGraph&, DFSVisitor, ColorMap, typename graph_traits::vertex_descriptor) [with VertexListGraph = R_adjacency_list; DFSVisitor = dfs_time_visitor; ColorMap = shared_array_property_map, long unsigned int> >; typename graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/depth_first_search.hpp:397:42: required from ‘void boost::graph::detail::depth_first_search_impl::operator()(const Graph&, const ArgPack&) const [with ArgPack = boost::parameter::aux::arg_list >, boost::parameter::aux::empty_arg_list, std::integral_constant >; Graph = R_adjacency_list]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/depth_first_search.hpp:406:5: required from ‘typename boost::result_of(Param0, const ArgPack&)>::type boost::graph::depth_first_search_with_named_params(const Param0&, const ArgPack&) [with Param0 = R_adjacency_list; ArgPack = boost::parameter::aux::arg_list >, boost::parameter::aux::empty_arg_list, std::integral_constant >; typename boost::result_of(Param0, const ArgPack&)>::type = void]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/depth_first_search.hpp:409:1: required from ‘typename boost::result_of(Param0, const typename boost::detail::convert_bgl_params_to_boost_parameter >::type&)>::type boost::depth_first_search(const Param0&, const bgl_named_params&) [with Param0 = R_adjacency_list; P = dfs_time_visitor; T = graph_visitor_t; R = no_property; typename result_of(Param0, const typename detail::convert_bgl_params_to_boost_parameter >::type&)>::type = void; typename detail::convert_bgl_params_to_boost_parameter >::type = parameter::aux::arg_list >, parameter::aux::empty_arg_list, std::integral_constant >]’ interfaces.cpp:158:27: required from here /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::Assignable::~Assignable() [with TT = boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator >*, std::vector >, std::allocator > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>]’ 37 | ~model() | ^ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:145:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 145 | BOOST_CONCEPT_USAGE(Assignable) { | ^~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::EqualityComparable >*, std::vector >, std::allocator > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> >]’: /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements >*, std::vector >, std::allocator > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:233:5: required from ‘struct boost::EqualityComparable >*, std::vector >, std::allocator > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:502:3: required from ‘struct boost::InputIterator >*, std::vector >, std::allocator > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::InputIterator >*, std::vector >, std::allocator > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> >]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied >*, std::vector >, std::allocator > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::value’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:45:51: [ skipping 6 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/depth_first_search.hpp:129:9: required from ‘void boost::detail::depth_first_visit_impl(const IncidenceGraph&, typename boost::graph_traits::vertex_descriptor, DFSVisitor&, ColorMap, TerminatorFunc) [with IncidenceGraph = R_adjacency_list; DFSVisitor = dfs_time_visitor; ColorMap = boost::shared_array_property_map, long unsigned int> >; TerminatorFunc = nontruth2; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/depth_first_search.hpp:286:39: required from ‘void boost::depth_first_search(const VertexListGraph&, DFSVisitor, ColorMap, typename graph_traits::vertex_descriptor) [with VertexListGraph = R_adjacency_list; DFSVisitor = dfs_time_visitor; ColorMap = shared_array_property_map, long unsigned int> >; typename graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/depth_first_search.hpp:397:42: required from ‘void boost::graph::detail::depth_first_search_impl::operator()(const Graph&, const ArgPack&) const [with ArgPack = boost::parameter::aux::arg_list >, boost::parameter::aux::empty_arg_list, std::integral_constant >; Graph = R_adjacency_list]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/depth_first_search.hpp:406:5: required from ‘typename boost::result_of(Param0, const ArgPack&)>::type boost::graph::depth_first_search_with_named_params(const Param0&, const ArgPack&) [with Param0 = R_adjacency_list; ArgPack = boost::parameter::aux::arg_list >, boost::parameter::aux::empty_arg_list, std::integral_constant >; typename boost::result_of(Param0, const ArgPack&)>::type = void]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/depth_first_search.hpp:409:1: required from ‘typename boost::result_of(Param0, const typename boost::detail::convert_bgl_params_to_boost_parameter >::type&)>::type boost::depth_first_search(const Param0&, const bgl_named_params&) [with Param0 = R_adjacency_list; P = dfs_time_visitor; T = graph_visitor_t; R = no_property; typename result_of(Param0, const typename detail::convert_bgl_params_to_boost_parameter >::type&)>::type = void; typename detail::convert_bgl_params_to_boost_parameter >::type = parameter::aux::arg_list >, parameter::aux::empty_arg_list, std::integral_constant >]’ interfaces.cpp:158:27: required from here /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::EqualityComparable::~EqualityComparable() [with TT = boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator >*, std::vector >, std::allocator > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>]’ 37 | ~model() | ^ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:233:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 233 | BOOST_CONCEPT_USAGE(EqualityComparable) { | ^~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::InputIterator >*, std::vector >, std::allocator > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> >]’: /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements >*, std::vector >, std::allocator > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:512:7: required from ‘struct boost::InputIterator >*, std::vector >, std::allocator > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::InputIterator >*, std::vector >, std::allocator > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> >]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied >*, std::vector >, std::allocator > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::value’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied >*, std::vector >, std::allocator > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:72:8: [ skipping 5 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/depth_first_search.hpp:129:9: required from ‘void boost::detail::depth_first_visit_impl(const IncidenceGraph&, typename boost::graph_traits::vertex_descriptor, DFSVisitor&, ColorMap, TerminatorFunc) [with IncidenceGraph = R_adjacency_list; DFSVisitor = dfs_time_visitor; ColorMap = boost::shared_array_property_map, long unsigned int> >; TerminatorFunc = nontruth2; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/depth_first_search.hpp:286:39: required from ‘void boost::depth_first_search(const VertexListGraph&, DFSVisitor, ColorMap, typename graph_traits::vertex_descriptor) [with VertexListGraph = R_adjacency_list; DFSVisitor = dfs_time_visitor; ColorMap = shared_array_property_map, long unsigned int> >; typename graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/depth_first_search.hpp:397:42: required from ‘void boost::graph::detail::depth_first_search_impl::operator()(const Graph&, const ArgPack&) const [with ArgPack = boost::parameter::aux::arg_list >, boost::parameter::aux::empty_arg_list, std::integral_constant >; Graph = R_adjacency_list]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/depth_first_search.hpp:406:5: required from ‘typename boost::result_of(Param0, const ArgPack&)>::type boost::graph::depth_first_search_with_named_params(const Param0&, const ArgPack&) [with Param0 = R_adjacency_list; ArgPack = boost::parameter::aux::arg_list >, boost::parameter::aux::empty_arg_list, std::integral_constant >; typename boost::result_of(Param0, const ArgPack&)>::type = void]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/depth_first_search.hpp:409:1: required from ‘typename boost::result_of(Param0, const typename boost::detail::convert_bgl_params_to_boost_parameter >::type&)>::type boost::depth_first_search(const Param0&, const bgl_named_params&) [with Param0 = R_adjacency_list; P = dfs_time_visitor; T = graph_visitor_t; R = no_property; typename result_of(Param0, const typename detail::convert_bgl_params_to_boost_parameter >::type&)>::type = void; typename detail::convert_bgl_params_to_boost_parameter >::type = parameter::aux::arg_list >, parameter::aux::empty_arg_list, std::integral_constant >]’ interfaces.cpp:158:27: required from here /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::InputIterator::~InputIterator() [with TT = boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator >*, std::vector >, std::allocator > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>]’ 37 | ~model() | ^ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:512:7: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 512 | BOOST_CONCEPT_USAGE(InputIterator) | ^~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements > >, boost::property >*, std::vector > >, boost::property >, std::allocator > >, boost::property > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >]’: /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:145:5: required from ‘struct boost::Assignable > >, boost::property >*, std::vector > >, boost::property >, std::allocator > >, boost::property > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:502:3: required from ‘struct boost::InputIterator > >, boost::property >*, std::vector > >, boost::property >, std::allocator > >, boost::property > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::InputIterator > >, boost::property >*, std::vector > >, boost::property >, std::allocator > >, boost::property > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> >]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied > >, boost::property >*, std::vector > >, boost::property >, std::allocator > >, boost::property > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::value’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied > >, boost::property >*, std::vector > >, boost::property >, std::allocator > >, boost::property > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:72:8: [ skipping 6 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/depth_first_search.hpp:286:39: required from ‘void boost::depth_first_search(const VertexListGraph&, DFSVisitor, ColorMap, typename graph_traits::vertex_descriptor) [with VertexListGraph = R_adjacency_list; DFSVisitor = detail::components_recorder; ColorMap = shared_array_property_map, long unsigned int> >; typename graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/depth_first_search.hpp:397:42: required from ‘void boost::graph::detail::depth_first_search_impl::operator()(const Graph&, const ArgPack&) const [with ArgPack = boost::parameter::aux::arg_list >, boost::parameter::aux::empty_arg_list, std::integral_constant >; Graph = R_adjacency_list]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/depth_first_search.hpp:406:5: required from ‘typename boost::result_of(Param0, const ArgPack&)>::type boost::graph::depth_first_search_with_named_params(const Param0&, const ArgPack&) [with Param0 = R_adjacency_list; ArgPack = boost::parameter::aux::arg_list >, boost::parameter::aux::empty_arg_list, std::integral_constant >; typename boost::result_of(Param0, const ArgPack&)>::type = void]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/depth_first_search.hpp:409:1: required from ‘typename boost::result_of(Param0, const typename boost::detail::convert_bgl_params_to_boost_parameter >::type&)>::type boost::depth_first_search(const Param0&, const bgl_named_params&) [with Param0 = R_adjacency_list; P = detail::components_recorder; T = graph_visitor_t; R = no_property; typename result_of(Param0, const typename detail::convert_bgl_params_to_boost_parameter >::type&)>::type = void; typename detail::convert_bgl_params_to_boost_parameter >::type = parameter::aux::arg_list >, parameter::aux::empty_arg_list, std::integral_constant >]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/connected_components.hpp:106:23: required from ‘typename boost::property_traits::value_type boost::connected_components(const Graph&, ComponentMap, typename enable_if_c::traversal_category>::value, graph::detail::no_parameter>::type) [with Graph = R_adjacency_list; ComponentMap = int*; typename property_traits::value_type = int; typename enable_if_c::traversal_category>::value, graph::detail::no_parameter>::type = graph::detail::no_parameter; typename graph_traits::traversal_category = undir_adj_list_traversal_tag]’ interfaces.cpp:205:29: required from here /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::Assignable > >, boost::property >*, std::vector > >, boost::property >, std::allocator > >, boost::property > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> >]’ 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ^ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements > >, boost::property >*, std::vector > >, boost::property >, std::allocator > >, boost::property > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >]’: /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:233:5: required from ‘struct boost::EqualityComparable > >, boost::property >*, std::vector > >, boost::property >, std::allocator > >, boost::property > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:502:3: required from ‘struct boost::InputIterator > >, boost::property >*, std::vector > >, boost::property >, std::allocator > >, boost::property > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::InputIterator > >, boost::property >*, std::vector > >, boost::property >, std::allocator > >, boost::property > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> >]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied > >, boost::property >*, std::vector > >, boost::property >, std::allocator > >, boost::property > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::value’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied > >, boost::property >*, std::vector > >, boost::property >, std::allocator > >, boost::property > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:72:8: [ skipping 6 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/depth_first_search.hpp:286:39: required from ‘void boost::depth_first_search(const VertexListGraph&, DFSVisitor, ColorMap, typename graph_traits::vertex_descriptor) [with VertexListGraph = R_adjacency_list; DFSVisitor = detail::components_recorder; ColorMap = shared_array_property_map, long unsigned int> >; typename graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/depth_first_search.hpp:397:42: required from ‘void boost::graph::detail::depth_first_search_impl::operator()(const Graph&, const ArgPack&) const [with ArgPack = boost::parameter::aux::arg_list >, boost::parameter::aux::empty_arg_list, std::integral_constant >; Graph = R_adjacency_list]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/depth_first_search.hpp:406:5: required from ‘typename boost::result_of(Param0, const ArgPack&)>::type boost::graph::depth_first_search_with_named_params(const Param0&, const ArgPack&) [with Param0 = R_adjacency_list; ArgPack = boost::parameter::aux::arg_list >, boost::parameter::aux::empty_arg_list, std::integral_constant >; typename boost::result_of(Param0, const ArgPack&)>::type = void]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/depth_first_search.hpp:409:1: required from ‘typename boost::result_of(Param0, const typename boost::detail::convert_bgl_params_to_boost_parameter >::type&)>::type boost::depth_first_search(const Param0&, const bgl_named_params&) [with Param0 = R_adjacency_list; P = detail::components_recorder; T = graph_visitor_t; R = no_property; typename result_of(Param0, const typename detail::convert_bgl_params_to_boost_parameter >::type&)>::type = void; typename detail::convert_bgl_params_to_boost_parameter >::type = parameter::aux::arg_list >, parameter::aux::empty_arg_list, std::integral_constant >]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/connected_components.hpp:106:23: required from ‘typename boost::property_traits::value_type boost::connected_components(const Graph&, ComponentMap, typename enable_if_c::traversal_category>::value, graph::detail::no_parameter>::type) [with Graph = R_adjacency_list; ComponentMap = int*; typename property_traits::value_type = int; typename enable_if_c::traversal_category>::value, graph::detail::no_parameter>::type = graph::detail::no_parameter; typename graph_traits::traversal_category = undir_adj_list_traversal_tag]’ interfaces.cpp:205:29: required from here /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::EqualityComparable > >, boost::property >*, std::vector > >, boost::property >, std::allocator > >, boost::property > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> >]’ 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ^ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements > >, boost::property >*, std::vector > >, boost::property >, std::allocator > >, boost::property > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >]’: /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:512:7: required from ‘struct boost::InputIterator > >, boost::property >*, std::vector > >, boost::property >, std::allocator > >, boost::property > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::InputIterator > >, boost::property >*, std::vector > >, boost::property >, std::allocator > >, boost::property > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> >]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied > >, boost::property >*, std::vector > >, boost::property >, std::allocator > >, boost::property > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::value’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied > >, boost::property >*, std::vector > >, boost::property >, std::allocator > >, boost::property > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_ > >, boost::property >*, std::vector > >, boost::property >, std::allocator > >, boost::property > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> >)>’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/graph_concepts.hpp:53:35: [ skipping 5 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/depth_first_search.hpp:286:39: required from ‘void boost::depth_first_search(const VertexListGraph&, DFSVisitor, ColorMap, typename graph_traits::vertex_descriptor) [with VertexListGraph = R_adjacency_list; DFSVisitor = detail::components_recorder; ColorMap = shared_array_property_map, long unsigned int> >; typename graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/depth_first_search.hpp:397:42: required from ‘void boost::graph::detail::depth_first_search_impl::operator()(const Graph&, const ArgPack&) const [with ArgPack = boost::parameter::aux::arg_list >, boost::parameter::aux::empty_arg_list, std::integral_constant >; Graph = R_adjacency_list]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/depth_first_search.hpp:406:5: required from ‘typename boost::result_of(Param0, const ArgPack&)>::type boost::graph::depth_first_search_with_named_params(const Param0&, const ArgPack&) [with Param0 = R_adjacency_list; ArgPack = boost::parameter::aux::arg_list >, boost::parameter::aux::empty_arg_list, std::integral_constant >; typename boost::result_of(Param0, const ArgPack&)>::type = void]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/depth_first_search.hpp:409:1: required from ‘typename boost::result_of(Param0, const typename boost::detail::convert_bgl_params_to_boost_parameter >::type&)>::type boost::depth_first_search(const Param0&, const bgl_named_params&) [with Param0 = R_adjacency_list; P = detail::components_recorder; T = graph_visitor_t; R = no_property; typename result_of(Param0, const typename detail::convert_bgl_params_to_boost_parameter >::type&)>::type = void; typename detail::convert_bgl_params_to_boost_parameter >::type = parameter::aux::arg_list >, parameter::aux::empty_arg_list, std::integral_constant >]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/connected_components.hpp:106:23: required from ‘typename boost::property_traits::value_type boost::connected_components(const Graph&, ComponentMap, typename enable_if_c::traversal_category>::value, graph::detail::no_parameter>::type) [with Graph = R_adjacency_list; ComponentMap = int*; typename property_traits::value_type = int; typename enable_if_c::traversal_category>::value, graph::detail::no_parameter>::type = graph::detail::no_parameter; typename graph_traits::traversal_category = undir_adj_list_traversal_tag]’ interfaces.cpp:205:29: required from here /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::InputIterator > >, boost::property >*, std::vector > >, boost::property >, std::allocator > >, boost::property > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> >]’ 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ^ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::InputIterator > >, boost::property >*, std::vector > >, boost::property >, std::allocator > >, boost::property > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> >]’: /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/graph_concepts.hpp:53:35: required from ‘boost::concepts::MultiPassInputIterator::~MultiPassInputIterator() [with T = boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >, boost::property >*, std::vector > >, boost::property >, std::allocator > >, boost::property > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::MultiPassInputIterator > >, boost::property >*, std::vector > >, boost::property >, std::allocator > >, boost::property > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> >]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/graph_concepts.hpp:89:9: required from ‘boost::concepts::IncidenceGraph::~IncidenceGraph() [with G = R_adjacency_list]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/graph_concepts.hpp:75:1: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::IncidenceGraphConcept >]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/depth_first_search.hpp:129:9: required from ‘void boost::detail::depth_first_visit_impl(const IncidenceGraph&, typename boost::graph_traits::vertex_descriptor, DFSVisitor&, ColorMap, TerminatorFunc) [with IncidenceGraph = R_adjacency_list; DFSVisitor = components_recorder; ColorMap = boost::shared_array_property_map, long unsigned int> >; TerminatorFunc = nontruth2; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/depth_first_search.hpp:286:39: required from ‘void boost::depth_first_search(const VertexListGraph&, DFSVisitor, ColorMap, typename graph_traits::vertex_descriptor) [with VertexListGraph = R_adjacency_list; DFSVisitor = detail::components_recorder; ColorMap = shared_array_property_map, long unsigned int> >; typename graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/depth_first_search.hpp:397:42: required from ‘void boost::graph::detail::depth_first_search_impl::operator()(const Graph&, const ArgPack&) const [with ArgPack = boost::parameter::aux::arg_list >, boost::parameter::aux::empty_arg_list, std::integral_constant >; Graph = R_adjacency_list]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/depth_first_search.hpp:406:5: required from ‘typename boost::result_of(Param0, const ArgPack&)>::type boost::graph::depth_first_search_with_named_params(const Param0&, const ArgPack&) [with Param0 = R_adjacency_list; ArgPack = boost::parameter::aux::arg_list >, boost::parameter::aux::empty_arg_list, std::integral_constant >; typename boost::result_of(Param0, const ArgPack&)>::type = void]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/depth_first_search.hpp:409:1: required from ‘typename boost::result_of(Param0, const typename boost::detail::convert_bgl_params_to_boost_parameter >::type&)>::type boost::depth_first_search(const Param0&, const bgl_named_params&) [with Param0 = R_adjacency_list; P = detail::components_recorder; T = graph_visitor_t; R = no_property; typename result_of(Param0, const typename detail::convert_bgl_params_to_boost_parameter >::type&)>::type = void; typename detail::convert_bgl_params_to_boost_parameter >::type = parameter::aux::arg_list >, parameter::aux::empty_arg_list, std::integral_constant >]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/connected_components.hpp:106:23: required from ‘typename boost::property_traits::value_type boost::connected_components(const Graph&, ComponentMap, typename enable_if_c::traversal_category>::value, graph::detail::no_parameter>::type) [with Graph = R_adjacency_list; ComponentMap = int*; typename property_traits::value_type = int; typename enable_if_c::traversal_category>::value, graph::detail::no_parameter>::type = graph::detail::no_parameter; typename graph_traits::traversal_category = undir_adj_list_traversal_tag]’ interfaces.cpp:205:29: required from here /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::InputIterator::~InputIterator() [with TT = boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >, boost::property >*, std::vector > >, boost::property >, std::allocator > >, boost::property > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>]’ 37 | ~model() | ^ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:512:7: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 512 | BOOST_CONCEPT_USAGE(InputIterator) | ^~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements > >]’: /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:145:5: required from ‘struct boost::Assignable >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:502:3: required from ‘struct boost::InputIterator >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::InputIterator >]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied > >::value’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied > >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:72:8: [ skipping 6 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/biconnected_components.hpp:250:47: required from ‘static std::pair boost::detail::bicomp_dispatch3::apply(const Graph&, ComponentMap, OutputIterator, VertexIndexMap, DiscoverTimeMap, LowPointMap, const boost::bgl_named_params&, boost::param_not_found) [with Graph = R_adjacency_list; ComponentMap = boost::dummy_property_map; OutputIterator = std::back_insert_iterator >; VertexIndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>; DiscoverTimeMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>; LowPointMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>; P = int; T = boost::buffer_param_t; R = boost::no_property]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/biconnected_components.hpp:295:60: required from ‘static std::pair boost::detail::bicomp_dispatch2::apply(const Graph&, ComponentMap, OutputIterator, VertexIndexMap, DiscoverTimeMap, const boost::bgl_named_params&, boost::param_not_found) [with Graph = R_adjacency_list; ComponentMap = boost::dummy_property_map; OutputIterator = std::back_insert_iterator >; VertexIndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>; DiscoverTimeMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>; P = int; T = boost::buffer_param_t; R = boost::no_property]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/biconnected_components.hpp:336:60: required from ‘static std::pair boost::detail::bicomp_dispatch1::apply(const Graph&, ComponentMap, OutputIterator, VertexIndexMap, const boost::bgl_named_params&, boost::param_not_found) [with Graph = R_adjacency_list; ComponentMap = boost::dummy_property_map; OutputIterator = std::back_insert_iterator >; VertexIndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>; P = int; T = boost::buffer_param_t; R = boost::no_property]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/biconnected_components.hpp:368:60: required from ‘std::pair boost::biconnected_components(const Graph&, ComponentMap, OutputIterator, const bgl_named_params&) [with Graph = R_adjacency_list; ComponentMap = dummy_property_map; OutputIterator = std::back_insert_iterator >; P = int; T = buffer_param_t; R = no_property]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/biconnected_components.hpp:433:34: required from ‘OutputIterator boost::articulation_points(const Graph&, OutputIterator) [with Graph = R_adjacency_list; OutputIterator = std::back_insert_iterator >]’ interfaces.cpp:300:28: required from here /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::Assignable >]’ 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ^ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements > >]’: /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:233:5: required from ‘struct boost::EqualityComparable >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:502:3: required from ‘struct boost::InputIterator >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::InputIterator >]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied > >::value’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied > >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:72:8: [ skipping 6 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/biconnected_components.hpp:250:47: required from ‘static std::pair boost::detail::bicomp_dispatch3::apply(const Graph&, ComponentMap, OutputIterator, VertexIndexMap, DiscoverTimeMap, LowPointMap, const boost::bgl_named_params&, boost::param_not_found) [with Graph = R_adjacency_list; ComponentMap = boost::dummy_property_map; OutputIterator = std::back_insert_iterator >; VertexIndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>; DiscoverTimeMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>; LowPointMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>; P = int; T = boost::buffer_param_t; R = boost::no_property]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/biconnected_components.hpp:295:60: required from ‘static std::pair boost::detail::bicomp_dispatch2::apply(const Graph&, ComponentMap, OutputIterator, VertexIndexMap, DiscoverTimeMap, const boost::bgl_named_params&, boost::param_not_found) [with Graph = R_adjacency_list; ComponentMap = boost::dummy_property_map; OutputIterator = std::back_insert_iterator >; VertexIndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>; DiscoverTimeMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>; P = int; T = boost::buffer_param_t; R = boost::no_property]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/biconnected_components.hpp:336:60: required from ‘static std::pair boost::detail::bicomp_dispatch1::apply(const Graph&, ComponentMap, OutputIterator, VertexIndexMap, const boost::bgl_named_params&, boost::param_not_found) [with Graph = R_adjacency_list; ComponentMap = boost::dummy_property_map; OutputIterator = std::back_insert_iterator >; VertexIndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>; P = int; T = boost::buffer_param_t; R = boost::no_property]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/biconnected_components.hpp:368:60: required from ‘std::pair boost::biconnected_components(const Graph&, ComponentMap, OutputIterator, const bgl_named_params&) [with Graph = R_adjacency_list; ComponentMap = dummy_property_map; OutputIterator = std::back_insert_iterator >; P = int; T = buffer_param_t; R = no_property]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/biconnected_components.hpp:433:34: required from ‘OutputIterator boost::articulation_points(const Graph&, OutputIterator) [with Graph = R_adjacency_list; OutputIterator = std::back_insert_iterator >]’ interfaces.cpp:300:28: required from here /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::EqualityComparable >]’ 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ^ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements > >]’: /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:512:7: required from ‘struct boost::InputIterator >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::InputIterator >]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied > >::value’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied > >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_ >)>’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/graph_concepts.hpp:53:35: [ skipping 5 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/biconnected_components.hpp:250:47: required from ‘static std::pair boost::detail::bicomp_dispatch3::apply(const Graph&, ComponentMap, OutputIterator, VertexIndexMap, DiscoverTimeMap, LowPointMap, const boost::bgl_named_params&, boost::param_not_found) [with Graph = R_adjacency_list; ComponentMap = boost::dummy_property_map; OutputIterator = std::back_insert_iterator >; VertexIndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>; DiscoverTimeMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>; LowPointMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>; P = int; T = boost::buffer_param_t; R = boost::no_property]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/biconnected_components.hpp:295:60: required from ‘static std::pair boost::detail::bicomp_dispatch2::apply(const Graph&, ComponentMap, OutputIterator, VertexIndexMap, DiscoverTimeMap, const boost::bgl_named_params&, boost::param_not_found) [with Graph = R_adjacency_list; ComponentMap = boost::dummy_property_map; OutputIterator = std::back_insert_iterator >; VertexIndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>; DiscoverTimeMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>; P = int; T = boost::buffer_param_t; R = boost::no_property]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/biconnected_components.hpp:336:60: required from ‘static std::pair boost::detail::bicomp_dispatch1::apply(const Graph&, ComponentMap, OutputIterator, VertexIndexMap, const boost::bgl_named_params&, boost::param_not_found) [with Graph = R_adjacency_list; ComponentMap = boost::dummy_property_map; OutputIterator = std::back_insert_iterator >; VertexIndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>; P = int; T = boost::buffer_param_t; R = boost::no_property]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/biconnected_components.hpp:368:60: required from ‘std::pair boost::biconnected_components(const Graph&, ComponentMap, OutputIterator, const bgl_named_params&) [with Graph = R_adjacency_list; ComponentMap = dummy_property_map; OutputIterator = std::back_insert_iterator >; P = int; T = buffer_param_t; R = no_property]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/biconnected_components.hpp:433:34: required from ‘OutputIterator boost::articulation_points(const Graph&, OutputIterator) [with Graph = R_adjacency_list; OutputIterator = std::back_insert_iterator >]’ interfaces.cpp:300:28: required from here /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::InputIterator >]’ 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ^ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::InputIterator >]’: /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/graph_concepts.hpp:53:35: required from ‘boost::concepts::MultiPassInputIterator::~MultiPassInputIterator() [with T = boost::range_detail::integer_iterator]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::MultiPassInputIterator >]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/graph_concepts.hpp:184:9: required from ‘boost::concepts::VertexListGraph::~VertexListGraph() [with G = R_adjacency_list]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/graph_concepts.hpp:176:1: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::VertexListGraphConcept >]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/biconnected_components.hpp:188:9: required from ‘std::pair boost::detail::biconnected_components_impl(const Graph&, ComponentMap, OutputIterator, VertexIndexMap, DiscoverTimeMap, LowPointMap, PredecessorMap, DFSVisitor) [with Graph = R_adjacency_list; ComponentMap = boost::dummy_property_map; OutputIterator = std::back_insert_iterator >; VertexIndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>; DiscoverTimeMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>; LowPointMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>; PredecessorMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>; DFSVisitor = boost::dfs_visitor<>]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/biconnected_components.hpp:250:47: required from ‘static std::pair boost::detail::bicomp_dispatch3::apply(const Graph&, ComponentMap, OutputIterator, VertexIndexMap, DiscoverTimeMap, LowPointMap, const boost::bgl_named_params&, boost::param_not_found) [with Graph = R_adjacency_list; ComponentMap = boost::dummy_property_map; OutputIterator = std::back_insert_iterator >; VertexIndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>; DiscoverTimeMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>; LowPointMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>; P = int; T = boost::buffer_param_t; R = boost::no_property]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/biconnected_components.hpp:295:60: required from ‘static std::pair boost::detail::bicomp_dispatch2::apply(const Graph&, ComponentMap, OutputIterator, VertexIndexMap, DiscoverTimeMap, const boost::bgl_named_params&, boost::param_not_found) [with Graph = R_adjacency_list; ComponentMap = boost::dummy_property_map; OutputIterator = std::back_insert_iterator >; VertexIndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>; DiscoverTimeMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>; P = int; T = boost::buffer_param_t; R = boost::no_property]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/biconnected_components.hpp:336:60: required from ‘static std::pair boost::detail::bicomp_dispatch1::apply(const Graph&, ComponentMap, OutputIterator, VertexIndexMap, const boost::bgl_named_params&, boost::param_not_found) [with Graph = R_adjacency_list; ComponentMap = boost::dummy_property_map; OutputIterator = std::back_insert_iterator >; VertexIndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>; P = int; T = boost::buffer_param_t; R = boost::no_property]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/biconnected_components.hpp:368:60: required from ‘std::pair boost::biconnected_components(const Graph&, ComponentMap, OutputIterator, const bgl_named_params&) [with Graph = R_adjacency_list; ComponentMap = dummy_property_map; OutputIterator = std::back_insert_iterator >; P = int; T = buffer_param_t; R = no_property]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/biconnected_components.hpp:433:34: required from ‘OutputIterator boost::articulation_points(const Graph&, OutputIterator) [with Graph = R_adjacency_list; OutputIterator = std::back_insert_iterator >]’ interfaces.cpp:300:28: required from here /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::InputIterator::~InputIterator() [with TT = boost::range_detail::integer_iterator]’ 37 | ~model() | ^ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:512:7: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 512 | BOOST_CONCEPT_USAGE(InputIterator) | ^~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::constraint::failed() [with Model = boost::DFSVisitorConcept >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>, boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>, boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>, std::back_insert_iterator >, std::stack, std::deque, std::allocator > > >, std::vector, boost::vec_adj_list_vertex_id_map, long unsigned int>, boost::dfs_visitor<> >, R_adjacency_list >]’: /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/depth_first_search.hpp:130:9: required from ‘void boost::depth_first_search(const VertexListGraph&, DFSVisitor, ColorMap, typename graph_traits::vertex_descriptor) [with VertexListGraph = R_adjacency_list; DFSVisitor = detail::biconnected_components_visitor >, vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>, iterator_property_map<__gnu_cxx::__normal_iterator >, vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>, iterator_property_map<__gnu_cxx::__normal_iterator >, vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>, std::back_insert_iterator >, std::stack, std::deque, std::allocator > > >, std::vector, vec_adj_list_vertex_id_map, long unsigned int>, dfs_visitor<> >; ColorMap = shared_array_property_map, long unsigned int> >; typename graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/depth_first_search.hpp:397:42: required from ‘void boost::graph::detail::depth_first_search_impl::operator()(const Graph&, const ArgPack&) const [with ArgPack = boost::parameter::aux::arg_list, long unsigned int> >, boost::parameter::aux::arg_list >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>, boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>, boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>, std::back_insert_iterator >, std::stack, std::deque, std::allocator > > >, std::vector, boost::vec_adj_list_vertex_id_map, long unsigned int>, boost::dfs_visitor<> > >, boost::parameter::aux::empty_arg_list, std::integral_constant >, std::integral_constant >; Graph = R_adjacency_list]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/depth_first_search.hpp:406:5: required from ‘typename boost::result_of(Param0, const ArgPack&)>::type boost::graph::depth_first_search_with_named_params(const Param0&, const ArgPack&) [with Param0 = R_adjacency_list; ArgPack = boost::parameter::aux::arg_list, long unsigned int> >, boost::parameter::aux::arg_list >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>, boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>, boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>, std::back_insert_iterator >, std::stack, std::deque, std::allocator > > >, std::vector, boost::vec_adj_list_vertex_id_map, long unsigned int>, boost::dfs_visitor<> > >, boost::parameter::aux::empty_arg_list, std::integral_constant >, std::integral_constant >; typename boost::result_of(Param0, const ArgPack&)>::type = void]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/depth_first_search.hpp:409:1: required from ‘typename boost::result_of(Param0, const typename boost::detail::convert_bgl_params_to_boost_parameter >::type&)>::type boost::depth_first_search(const Param0&, const bgl_named_params&) [with Param0 = R_adjacency_list; P = vec_adj_list_vertex_id_map, long unsigned int>; T = vertex_index_t; R = bgl_named_params >, vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>, iterator_property_map<__gnu_cxx::__normal_iterator >, vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>, iterator_property_map<__gnu_cxx::__normal_iterator >, vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>, std::back_insert_iterator >, std::stack, std::deque, std::allocator > > >, std::vector, vec_adj_list_vertex_id_map, long unsigned int>, dfs_visitor<> >, graph_visitor_t, no_property>; typename result_of(Param0, const typename detail::convert_bgl_params_to_boost_parameter >::type&)>::type = void; typename detail::convert_bgl_params_to_boost_parameter >::type = parameter::aux::arg_list, long unsigned int> >, parameter::aux::arg_list >, vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>, iterator_property_map<__gnu_cxx::__normal_iterator >, vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>, iterator_property_map<__gnu_cxx::__normal_iterator >, vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>, std::back_insert_iterator >, std::stack, std::deque, std::allocator > > >, std::vector, vec_adj_list_vertex_id_map, long unsigned int>, dfs_visitor<> > >, parameter::aux::empty_arg_list, std::integral_constant >, std::integral_constant >]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/biconnected_components.hpp:211:27: required from ‘std::pair boost::detail::biconnected_components_impl(const Graph&, ComponentMap, OutputIterator, VertexIndexMap, DiscoverTimeMap, LowPointMap, PredecessorMap, DFSVisitor) [with Graph = R_adjacency_list; ComponentMap = boost::dummy_property_map; OutputIterator = std::back_insert_iterator >; VertexIndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>; DiscoverTimeMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>; LowPointMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>; PredecessorMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>; DFSVisitor = boost::dfs_visitor<>]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/biconnected_components.hpp:250:47: required from ‘static std::pair boost::detail::bicomp_dispatch3::apply(const Graph&, ComponentMap, OutputIterator, VertexIndexMap, DiscoverTimeMap, LowPointMap, const boost::bgl_named_params&, boost::param_not_found) [with Graph = R_adjacency_list; ComponentMap = boost::dummy_property_map; OutputIterator = std::back_insert_iterator >; VertexIndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>; DiscoverTimeMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>; LowPointMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>; P = int; T = boost::buffer_param_t; R = boost::no_property]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/biconnected_components.hpp:295:60: required from ‘static std::pair boost::detail::bicomp_dispatch2::apply(const Graph&, ComponentMap, OutputIterator, VertexIndexMap, DiscoverTimeMap, const boost::bgl_named_params&, boost::param_not_found) [with Graph = R_adjacency_list; ComponentMap = boost::dummy_property_map; OutputIterator = std::back_insert_iterator >; VertexIndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>; DiscoverTimeMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>; P = int; T = boost::buffer_param_t; R = boost::no_property]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/biconnected_components.hpp:336:60: required from ‘static std::pair boost::detail::bicomp_dispatch1::apply(const Graph&, ComponentMap, OutputIterator, VertexIndexMap, const boost::bgl_named_params&, boost::param_not_found) [with Graph = R_adjacency_list; ComponentMap = boost::dummy_property_map; OutputIterator = std::back_insert_iterator >; VertexIndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>; P = int; T = boost::buffer_param_t; R = boost::no_property]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/biconnected_components.hpp:368:60: required from ‘std::pair boost::biconnected_components(const Graph&, ComponentMap, OutputIterator, const bgl_named_params&) [with Graph = R_adjacency_list; ComponentMap = dummy_property_map; OutputIterator = std::back_insert_iterator >; P = int; T = buffer_param_t; R = no_property]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/biconnected_components.hpp:433:34: required from ‘OutputIterator boost::articulation_points(const Graph&, OutputIterator) [with Graph = R_adjacency_list; OutputIterator = std::back_insert_iterator >]’ interfaces.cpp:300:28: required from here /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:65:52: warning: ‘this’ pointer is null [-Wnonnull] 65 | static void failed() { ((Model*)0)->constraints(); } | ~~~~~~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/depth_first_search.hpp:39:10: note: in a call to non-static member function ‘void boost::DFSVisitorConcept::constraints() [with Visitor = boost::detail::biconnected_components_visitor >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>, boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>, boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>, std::back_insert_iterator >, std::stack, std::deque, std::allocator > > >, std::vector, boost::vec_adj_list_vertex_id_map, long unsigned int>, boost::dfs_visitor<> >; Graph = R_adjacency_list]’ 39 | void constraints() | ^~~~~~~~~~~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::Assignable > > >, boost::edge_residual_capacity_t> >, boost::keep_all, boost::filtered_graph > > >, boost::no_property, boost::listS>, boost::is_residual_edge > > >, boost::edge_residual_capacity_t> >, boost::keep_all> >, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > > > >*, std::vector > > > >, std::allocator > > > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >]’: /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements > > >, boost::edge_residual_capacity_t> >, boost::keep_all, boost::filtered_graph > > >, boost::no_property, boost::listS>, boost::is_residual_edge > > >, boost::edge_residual_capacity_t> >, boost::keep_all> >, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > > > >*, std::vector > > > >, std::allocator > > > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > > >]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:145:5: required from ‘struct boost::Assignable > > >, boost::edge_residual_capacity_t> >, boost::keep_all, boost::filtered_graph > > >, boost::no_property, boost::listS>, boost::is_residual_edge > > >, boost::edge_residual_capacity_t> >, boost::keep_all> >, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > > > >*, std::vector > > > >, std::allocator > > > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:502:3: required from ‘struct boost::InputIterator > > >, boost::edge_residual_capacity_t> >, boost::keep_all, boost::filtered_graph > > >, boost::no_property, boost::listS>, boost::is_residual_edge > > >, boost::edge_residual_capacity_t> >, boost::keep_all> >, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > > > >*, std::vector > > > >, std::allocator > > > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::InputIterator > > >, boost::edge_residual_capacity_t> >, boost::keep_all, boost::filtered_graph > > >, boost::no_property, boost::listS>, boost::is_residual_edge > > >, boost::edge_residual_capacity_t> >, boost::keep_all> >, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > > > >*, std::vector > > > >, std::allocator > > > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied > > >, boost::edge_residual_capacity_t> >, boost::keep_all, boost::filtered_graph > > >, boost::no_property, boost::listS>, boost::is_residual_edge > > >, boost::edge_residual_capacity_t> >, boost::keep_all> >, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > > > >*, std::vector > > > >, std::allocator > > > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > > >::value’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:45:51: [ skipping 6 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/depth_first_search.hpp:129:9: required from ‘void boost::breadth_first_visit(const IncidenceGraph&, SourceIterator, SourceIterator, Buffer&, BFSVisitor, ColorMap) [with IncidenceGraph = filtered_graph > > >, no_property, listS>, is_residual_edge > > >, edge_residual_capacity_t> >, keep_all>; Buffer = queue > >; BFSVisitor = bfs_visitor*, on_tree_edge> >; ColorMap = default_color_type*; SourceIterator = long unsigned int*]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/breadth_first_search.hpp:136:24: required from ‘void boost::breadth_first_search(const VertexListGraph&, SourceIterator, SourceIterator, Buffer&, BFSVisitor, ColorMap) [with VertexListGraph = filtered_graph > > >, no_property, listS>, is_residual_edge > > >, edge_residual_capacity_t> >, keep_all>; SourceIterator = long unsigned int*; Buffer = queue > >; BFSVisitor = bfs_visitor*, on_tree_edge> >; ColorMap = default_color_type*]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/breadth_first_search.hpp:147:25: required from ‘void boost::breadth_first_search(const VertexListGraph&, typename graph_traits::vertex_descriptor, Buffer&, BFSVisitor, ColorMap) [with VertexListGraph = filtered_graph > > >, no_property, listS>, is_residual_edge > > >, edge_residual_capacity_t> >, keep_all>; Buffer = queue > >; BFSVisitor = bfs_visitor*, on_tree_edge> >; ColorMap = default_color_type*; typename graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/edmonds_karp_max_flow.hpp:101:29: required from ‘typename boost::property_traits::value_type boost::edmonds_karp_max_flow(Graph&, typename graph_traits::vertex_descriptor, typename graph_traits::vertex_descriptor, CapacityEdgeMap, ResidualCapacityEdgeMap, ReverseEdgeMap, ColorMap, PredEdgeMap) [with Graph = adjacency_list > > >, no_property, listS>; CapacityEdgeMap = adj_list_edge_property_map > > >, edge_capacity_t>; ResidualCapacityEdgeMap = adj_list_edge_property_map > > >, edge_residual_capacity_t>; ReverseEdgeMap = adj_list_edge_property_map, detail::edge_desc_impl&, long unsigned int, property > > >, edge_reverse_t>; ColorMap = default_color_type*; PredEdgeMap = detail::edge_desc_impl*; typename property_traits::value_type = long unsigned int; typename graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/edge_connectivity.hpp:145:42: required from ‘typename boost::graph_traits::degree_size_type boost::edge_connectivity(VertexListGraph&, OutputIterator) [with VertexListGraph = R_adjacency_list; OutputIterator = std::back_insert_iterator > >; typename graph_traits::degree_size_type = long unsigned int]’ interfaces.cpp:326:34: required from here /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::Assignable::~Assignable() [with TT = boost::iterators::filter_iterator > > >, boost::edge_residual_capacity_t> >, boost::keep_all, boost::filtered_graph > > >, boost::no_property, boost::listS>, boost::is_residual_edge > > >, boost::edge_residual_capacity_t> >, boost::keep_all> >, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > > > >*, std::vector > > > >, std::allocator > > > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> >]’ 37 | ~model() | ^ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:145:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 145 | BOOST_CONCEPT_USAGE(Assignable) { | ^~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::EqualityComparable > > >, boost::edge_residual_capacity_t> >, boost::keep_all, boost::filtered_graph > > >, boost::no_property, boost::listS>, boost::is_residual_edge > > >, boost::edge_residual_capacity_t> >, boost::keep_all> >, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > > > >*, std::vector > > > >, std::allocator > > > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >]’: /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements > > >, boost::edge_residual_capacity_t> >, boost::keep_all, boost::filtered_graph > > >, boost::no_property, boost::listS>, boost::is_residual_edge > > >, boost::edge_residual_capacity_t> >, boost::keep_all> >, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > > > >*, std::vector > > > >, std::allocator > > > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > > >]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:233:5: required from ‘struct boost::EqualityComparable > > >, boost::edge_residual_capacity_t> >, boost::keep_all, boost::filtered_graph > > >, boost::no_property, boost::listS>, boost::is_residual_edge > > >, boost::edge_residual_capacity_t> >, boost::keep_all> >, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > > > >*, std::vector > > > >, std::allocator > > > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:502:3: required from ‘struct boost::InputIterator > > >, boost::edge_residual_capacity_t> >, boost::keep_all, boost::filtered_graph > > >, boost::no_property, boost::listS>, boost::is_residual_edge > > >, boost::edge_residual_capacity_t> >, boost::keep_all> >, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > > > >*, std::vector > > > >, std::allocator > > > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::InputIterator > > >, boost::edge_residual_capacity_t> >, boost::keep_all, boost::filtered_graph > > >, boost::no_property, boost::listS>, boost::is_residual_edge > > >, boost::edge_residual_capacity_t> >, boost::keep_all> >, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > > > >*, std::vector > > > >, std::allocator > > > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied > > >, boost::edge_residual_capacity_t> >, boost::keep_all, boost::filtered_graph > > >, boost::no_property, boost::listS>, boost::is_residual_edge > > >, boost::edge_residual_capacity_t> >, boost::keep_all> >, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > > > >*, std::vector > > > >, std::allocator > > > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > > >::value’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:45:51: [ skipping 6 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/depth_first_search.hpp:129:9: required from ‘void boost::breadth_first_visit(const IncidenceGraph&, SourceIterator, SourceIterator, Buffer&, BFSVisitor, ColorMap) [with IncidenceGraph = filtered_graph > > >, no_property, listS>, is_residual_edge > > >, edge_residual_capacity_t> >, keep_all>; Buffer = queue > >; BFSVisitor = bfs_visitor*, on_tree_edge> >; ColorMap = default_color_type*; SourceIterator = long unsigned int*]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/breadth_first_search.hpp:136:24: required from ‘void boost::breadth_first_search(const VertexListGraph&, SourceIterator, SourceIterator, Buffer&, BFSVisitor, ColorMap) [with VertexListGraph = filtered_graph > > >, no_property, listS>, is_residual_edge > > >, edge_residual_capacity_t> >, keep_all>; SourceIterator = long unsigned int*; Buffer = queue > >; BFSVisitor = bfs_visitor*, on_tree_edge> >; ColorMap = default_color_type*]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/breadth_first_search.hpp:147:25: required from ‘void boost::breadth_first_search(const VertexListGraph&, typename graph_traits::vertex_descriptor, Buffer&, BFSVisitor, ColorMap) [with VertexListGraph = filtered_graph > > >, no_property, listS>, is_residual_edge > > >, edge_residual_capacity_t> >, keep_all>; Buffer = queue > >; BFSVisitor = bfs_visitor*, on_tree_edge> >; ColorMap = default_color_type*; typename graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/edmonds_karp_max_flow.hpp:101:29: required from ‘typename boost::property_traits::value_type boost::edmonds_karp_max_flow(Graph&, typename graph_traits::vertex_descriptor, typename graph_traits::vertex_descriptor, CapacityEdgeMap, ResidualCapacityEdgeMap, ReverseEdgeMap, ColorMap, PredEdgeMap) [with Graph = adjacency_list > > >, no_property, listS>; CapacityEdgeMap = adj_list_edge_property_map > > >, edge_capacity_t>; ResidualCapacityEdgeMap = adj_list_edge_property_map > > >, edge_residual_capacity_t>; ReverseEdgeMap = adj_list_edge_property_map, detail::edge_desc_impl&, long unsigned int, property > > >, edge_reverse_t>; ColorMap = default_color_type*; PredEdgeMap = detail::edge_desc_impl*; typename property_traits::value_type = long unsigned int; typename graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/edge_connectivity.hpp:145:42: required from ‘typename boost::graph_traits::degree_size_type boost::edge_connectivity(VertexListGraph&, OutputIterator) [with VertexListGraph = R_adjacency_list; OutputIterator = std::back_insert_iterator > >; typename graph_traits::degree_size_type = long unsigned int]’ interfaces.cpp:326:34: required from here /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::EqualityComparable::~EqualityComparable() [with TT = boost::iterators::filter_iterator > > >, boost::edge_residual_capacity_t> >, boost::keep_all, boost::filtered_graph > > >, boost::no_property, boost::listS>, boost::is_residual_edge > > >, boost::edge_residual_capacity_t> >, boost::keep_all> >, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > > > >*, std::vector > > > >, std::allocator > > > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> >]’ 37 | ~model() | ^ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:233:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 233 | BOOST_CONCEPT_USAGE(EqualityComparable) { | ^~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::InputIterator > > >, boost::edge_residual_capacity_t> >, boost::keep_all, boost::filtered_graph > > >, boost::no_property, boost::listS>, boost::is_residual_edge > > >, boost::edge_residual_capacity_t> >, boost::keep_all> >, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > > > >*, std::vector > > > >, std::allocator > > > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >]’: /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements > > >, boost::edge_residual_capacity_t> >, boost::keep_all, boost::filtered_graph > > >, boost::no_property, boost::listS>, boost::is_residual_edge > > >, boost::edge_residual_capacity_t> >, boost::keep_all> >, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > > > >*, std::vector > > > >, std::allocator > > > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > > >]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:512:7: required from ‘struct boost::InputIterator > > >, boost::edge_residual_capacity_t> >, boost::keep_all, boost::filtered_graph > > >, boost::no_property, boost::listS>, boost::is_residual_edge > > >, boost::edge_residual_capacity_t> >, boost::keep_all> >, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > > > >*, std::vector > > > >, std::allocator > > > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::InputIterator > > >, boost::edge_residual_capacity_t> >, boost::keep_all, boost::filtered_graph > > >, boost::no_property, boost::listS>, boost::is_residual_edge > > >, boost::edge_residual_capacity_t> >, boost::keep_all> >, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > > > >*, std::vector > > > >, std::allocator > > > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied > > >, boost::edge_residual_capacity_t> >, boost::keep_all, boost::filtered_graph > > >, boost::no_property, boost::listS>, boost::is_residual_edge > > >, boost::edge_residual_capacity_t> >, boost::keep_all> >, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > > > >*, std::vector > > > >, std::allocator > > > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > > >::value’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied > > >, boost::edge_residual_capacity_t> >, boost::keep_all, boost::filtered_graph > > >, boost::no_property, boost::listS>, boost::is_residual_edge > > >, boost::edge_residual_capacity_t> >, boost::keep_all> >, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > > > >*, std::vector > > > >, std::allocator > > > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > > >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:72:8: [ skipping 5 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/depth_first_search.hpp:129:9: required from ‘void boost::breadth_first_visit(const IncidenceGraph&, SourceIterator, SourceIterator, Buffer&, BFSVisitor, ColorMap) [with IncidenceGraph = filtered_graph > > >, no_property, listS>, is_residual_edge > > >, edge_residual_capacity_t> >, keep_all>; Buffer = queue > >; BFSVisitor = bfs_visitor*, on_tree_edge> >; ColorMap = default_color_type*; SourceIterator = long unsigned int*]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/breadth_first_search.hpp:136:24: required from ‘void boost::breadth_first_search(const VertexListGraph&, SourceIterator, SourceIterator, Buffer&, BFSVisitor, ColorMap) [with VertexListGraph = filtered_graph > > >, no_property, listS>, is_residual_edge > > >, edge_residual_capacity_t> >, keep_all>; SourceIterator = long unsigned int*; Buffer = queue > >; BFSVisitor = bfs_visitor*, on_tree_edge> >; ColorMap = default_color_type*]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/breadth_first_search.hpp:147:25: required from ‘void boost::breadth_first_search(const VertexListGraph&, typename graph_traits::vertex_descriptor, Buffer&, BFSVisitor, ColorMap) [with VertexListGraph = filtered_graph > > >, no_property, listS>, is_residual_edge > > >, edge_residual_capacity_t> >, keep_all>; Buffer = queue > >; BFSVisitor = bfs_visitor*, on_tree_edge> >; ColorMap = default_color_type*; typename graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/edmonds_karp_max_flow.hpp:101:29: required from ‘typename boost::property_traits::value_type boost::edmonds_karp_max_flow(Graph&, typename graph_traits::vertex_descriptor, typename graph_traits::vertex_descriptor, CapacityEdgeMap, ResidualCapacityEdgeMap, ReverseEdgeMap, ColorMap, PredEdgeMap) [with Graph = adjacency_list > > >, no_property, listS>; CapacityEdgeMap = adj_list_edge_property_map > > >, edge_capacity_t>; ResidualCapacityEdgeMap = adj_list_edge_property_map > > >, edge_residual_capacity_t>; ReverseEdgeMap = adj_list_edge_property_map, detail::edge_desc_impl&, long unsigned int, property > > >, edge_reverse_t>; ColorMap = default_color_type*; PredEdgeMap = detail::edge_desc_impl*; typename property_traits::value_type = long unsigned int; typename graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/edge_connectivity.hpp:145:42: required from ‘typename boost::graph_traits::degree_size_type boost::edge_connectivity(VertexListGraph&, OutputIterator) [with VertexListGraph = R_adjacency_list; OutputIterator = std::back_insert_iterator > >; typename graph_traits::degree_size_type = long unsigned int]’ interfaces.cpp:326:34: required from here /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::InputIterator::~InputIterator() [with TT = boost::iterators::filter_iterator > > >, boost::edge_residual_capacity_t> >, boost::keep_all, boost::filtered_graph > > >, boost::no_property, boost::listS>, boost::is_residual_edge > > >, boost::edge_residual_capacity_t> >, boost::keep_all> >, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > > > >*, std::vector > > > >, std::allocator > > > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> >]’ 37 | ~model() | ^ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:512:7: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 512 | BOOST_CONCEPT_USAGE(InputIterator) | ^~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements, std::input_iterator_tag> >]’: /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:208:5: required from ‘struct boost::Convertible, std::input_iterator_tag>’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::Convertible, std::input_iterator_tag>]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied, std::input_iterator_tag> >::value’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied, std::input_iterator_tag> >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_, std::input_iterator_tag>)>’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:515:9: [ skipping 6 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/depth_first_search.hpp:129:9: required from ‘void boost::detail::depth_first_visit_impl(const IncidenceGraph&, typename boost::graph_traits::vertex_descriptor, DFSVisitor&, ColorMap, TerminatorFunc) [with IncidenceGraph = R_adjacency_list; DFSVisitor = dfs_time_visitor; ColorMap = boost::shared_array_property_map, long unsigned int> >; TerminatorFunc = nontruth2; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/depth_first_search.hpp:286:39: required from ‘void boost::depth_first_search(const VertexListGraph&, DFSVisitor, ColorMap, typename graph_traits::vertex_descriptor) [with VertexListGraph = R_adjacency_list; DFSVisitor = dfs_time_visitor; ColorMap = shared_array_property_map, long unsigned int> >; typename graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/depth_first_search.hpp:397:42: required from ‘void boost::graph::detail::depth_first_search_impl::operator()(const Graph&, const ArgPack&) const [with ArgPack = boost::parameter::aux::arg_list >, boost::parameter::aux::empty_arg_list, std::integral_constant >; Graph = R_adjacency_list]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/depth_first_search.hpp:406:5: required from ‘typename boost::result_of(Param0, const ArgPack&)>::type boost::graph::depth_first_search_with_named_params(const Param0&, const ArgPack&) [with Param0 = R_adjacency_list; ArgPack = boost::parameter::aux::arg_list >, boost::parameter::aux::empty_arg_list, std::integral_constant >; typename boost::result_of(Param0, const ArgPack&)>::type = void]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/depth_first_search.hpp:409:1: required from ‘typename boost::result_of(Param0, const typename boost::detail::convert_bgl_params_to_boost_parameter >::type&)>::type boost::depth_first_search(const Param0&, const bgl_named_params&) [with Param0 = R_adjacency_list; P = dfs_time_visitor; T = graph_visitor_t; R = no_property; typename result_of(Param0, const typename detail::convert_bgl_params_to_boost_parameter >::type&)>::type = void; typename detail::convert_bgl_params_to_boost_parameter >::type = parameter::aux::arg_list >, parameter::aux::empty_arg_list, std::integral_constant >]’ interfaces.cpp:158:27: required from here /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::Convertible, std::input_iterator_tag>]’ 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ^ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::Convertible, std::input_iterator_tag>]’: /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:515:9: required from ‘boost::InputIterator::~InputIterator() [with TT = boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator >*, std::vector >, std::allocator > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::InputIterator >*, std::vector >, std::allocator > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> >]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/graph_concepts.hpp:53:35: required from ‘boost::concepts::MultiPassInputIterator::~MultiPassInputIterator() [with T = boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator >*, std::vector >, std::allocator > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::MultiPassInputIterator >*, std::vector >, std::allocator > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> >]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/graph_concepts.hpp:89:9: [ skipping 2 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/depth_first_search.hpp:129:9: required from ‘void boost::detail::depth_first_visit_impl(const IncidenceGraph&, typename boost::graph_traits::vertex_descriptor, DFSVisitor&, ColorMap, TerminatorFunc) [with IncidenceGraph = R_adjacency_list; DFSVisitor = dfs_time_visitor; ColorMap = boost::shared_array_property_map, long unsigned int> >; TerminatorFunc = nontruth2; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/depth_first_search.hpp:286:39: required from ‘void boost::depth_first_search(const VertexListGraph&, DFSVisitor, ColorMap, typename graph_traits::vertex_descriptor) [with VertexListGraph = R_adjacency_list; DFSVisitor = dfs_time_visitor; ColorMap = shared_array_property_map, long unsigned int> >; typename graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/depth_first_search.hpp:397:42: required from ‘void boost::graph::detail::depth_first_search_impl::operator()(const Graph&, const ArgPack&) const [with ArgPack = boost::parameter::aux::arg_list >, boost::parameter::aux::empty_arg_list, std::integral_constant >; Graph = R_adjacency_list]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/depth_first_search.hpp:406:5: required from ‘typename boost::result_of(Param0, const ArgPack&)>::type boost::graph::depth_first_search_with_named_params(const Param0&, const ArgPack&) [with Param0 = R_adjacency_list; ArgPack = boost::parameter::aux::arg_list >, boost::parameter::aux::empty_arg_list, std::integral_constant >; typename boost::result_of(Param0, const ArgPack&)>::type = void]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/depth_first_search.hpp:409:1: required from ‘typename boost::result_of(Param0, const typename boost::detail::convert_bgl_params_to_boost_parameter >::type&)>::type boost::depth_first_search(const Param0&, const bgl_named_params&) [with Param0 = R_adjacency_list; P = dfs_time_visitor; T = graph_visitor_t; R = no_property; typename result_of(Param0, const typename detail::convert_bgl_params_to_boost_parameter >::type&)>::type = void; typename detail::convert_bgl_params_to_boost_parameter >::type = parameter::aux::arg_list >, parameter::aux::empty_arg_list, std::integral_constant >]’ interfaces.cpp:158:27: required from here /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::Convertible::~Convertible() [with X = boost::iterators::detail::iterator_category_with_traversal; Y = std::input_iterator_tag]’ 37 | ~model() | ^ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:208:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 208 | BOOST_CONCEPT_USAGE(Convertible) { | ^~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::Assignable > >, boost::property >*, std::vector > >, boost::property >, std::allocator > >, boost::property > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> >]’: /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements > >, boost::property >*, std::vector > >, boost::property >, std::allocator > >, boost::property > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:145:5: required from ‘struct boost::Assignable > >, boost::property >*, std::vector > >, boost::property >, std::allocator > >, boost::property > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:502:3: required from ‘struct boost::InputIterator > >, boost::property >*, std::vector > >, boost::property >, std::allocator > >, boost::property > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::InputIterator > >, boost::property >*, std::vector > >, boost::property >, std::allocator > >, boost::property > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> >]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied > >, boost::property >*, std::vector > >, boost::property >, std::allocator > >, boost::property > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::value’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:45:51: [ skipping 7 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/depth_first_search.hpp:286:39: required from ‘void boost::depth_first_search(const VertexListGraph&, DFSVisitor, ColorMap, typename graph_traits::vertex_descriptor) [with VertexListGraph = R_adjacency_list; DFSVisitor = detail::components_recorder; ColorMap = shared_array_property_map, long unsigned int> >; typename graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/depth_first_search.hpp:397:42: required from ‘void boost::graph::detail::depth_first_search_impl::operator()(const Graph&, const ArgPack&) const [with ArgPack = boost::parameter::aux::arg_list >, boost::parameter::aux::empty_arg_list, std::integral_constant >; Graph = R_adjacency_list]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/depth_first_search.hpp:406:5: required from ‘typename boost::result_of(Param0, const ArgPack&)>::type boost::graph::depth_first_search_with_named_params(const Param0&, const ArgPack&) [with Param0 = R_adjacency_list; ArgPack = boost::parameter::aux::arg_list >, boost::parameter::aux::empty_arg_list, std::integral_constant >; typename boost::result_of(Param0, const ArgPack&)>::type = void]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/depth_first_search.hpp:409:1: required from ‘typename boost::result_of(Param0, const typename boost::detail::convert_bgl_params_to_boost_parameter >::type&)>::type boost::depth_first_search(const Param0&, const bgl_named_params&) [with Param0 = R_adjacency_list; P = detail::components_recorder; T = graph_visitor_t; R = no_property; typename result_of(Param0, const typename detail::convert_bgl_params_to_boost_parameter >::type&)>::type = void; typename detail::convert_bgl_params_to_boost_parameter >::type = parameter::aux::arg_list >, parameter::aux::empty_arg_list, std::integral_constant >]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/connected_components.hpp:106:23: required from ‘typename boost::property_traits::value_type boost::connected_components(const Graph&, ComponentMap, typename enable_if_c::traversal_category>::value, graph::detail::no_parameter>::type) [with Graph = R_adjacency_list; ComponentMap = int*; typename property_traits::value_type = int; typename enable_if_c::traversal_category>::value, graph::detail::no_parameter>::type = graph::detail::no_parameter; typename graph_traits::traversal_category = undir_adj_list_traversal_tag]’ interfaces.cpp:205:29: required from here /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::Assignable::~Assignable() [with TT = boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >, boost::property >*, std::vector > >, boost::property >, std::allocator > >, boost::property > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>]’ 37 | ~model() | ^ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:145:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 145 | BOOST_CONCEPT_USAGE(Assignable) { | ^~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::EqualityComparable > >, boost::property >*, std::vector > >, boost::property >, std::allocator > >, boost::property > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> >]’: /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements > >, boost::property >*, std::vector > >, boost::property >, std::allocator > >, boost::property > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:233:5: required from ‘struct boost::EqualityComparable > >, boost::property >*, std::vector > >, boost::property >, std::allocator > >, boost::property > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:502:3: required from ‘struct boost::InputIterator > >, boost::property >*, std::vector > >, boost::property >, std::allocator > >, boost::property > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::InputIterator > >, boost::property >*, std::vector > >, boost::property >, std::allocator > >, boost::property > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> >]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied > >, boost::property >*, std::vector > >, boost::property >, std::allocator > >, boost::property > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::value’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:45:51: [ skipping 7 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/depth_first_search.hpp:286:39: required from ‘void boost::depth_first_search(const VertexListGraph&, DFSVisitor, ColorMap, typename graph_traits::vertex_descriptor) [with VertexListGraph = R_adjacency_list; DFSVisitor = detail::components_recorder; ColorMap = shared_array_property_map, long unsigned int> >; typename graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/depth_first_search.hpp:397:42: required from ‘void boost::graph::detail::depth_first_search_impl::operator()(const Graph&, const ArgPack&) const [with ArgPack = boost::parameter::aux::arg_list >, boost::parameter::aux::empty_arg_list, std::integral_constant >; Graph = R_adjacency_list]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/depth_first_search.hpp:406:5: required from ‘typename boost::result_of(Param0, const ArgPack&)>::type boost::graph::depth_first_search_with_named_params(const Param0&, const ArgPack&) [with Param0 = R_adjacency_list; ArgPack = boost::parameter::aux::arg_list >, boost::parameter::aux::empty_arg_list, std::integral_constant >; typename boost::result_of(Param0, const ArgPack&)>::type = void]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/depth_first_search.hpp:409:1: required from ‘typename boost::result_of(Param0, const typename boost::detail::convert_bgl_params_to_boost_parameter >::type&)>::type boost::depth_first_search(const Param0&, const bgl_named_params&) [with Param0 = R_adjacency_list; P = detail::components_recorder; T = graph_visitor_t; R = no_property; typename result_of(Param0, const typename detail::convert_bgl_params_to_boost_parameter >::type&)>::type = void; typename detail::convert_bgl_params_to_boost_parameter >::type = parameter::aux::arg_list >, parameter::aux::empty_arg_list, std::integral_constant >]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/connected_components.hpp:106:23: required from ‘typename boost::property_traits::value_type boost::connected_components(const Graph&, ComponentMap, typename enable_if_c::traversal_category>::value, graph::detail::no_parameter>::type) [with Graph = R_adjacency_list; ComponentMap = int*; typename property_traits::value_type = int; typename enable_if_c::traversal_category>::value, graph::detail::no_parameter>::type = graph::detail::no_parameter; typename graph_traits::traversal_category = undir_adj_list_traversal_tag]’ interfaces.cpp:205:29: required from here /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::EqualityComparable::~EqualityComparable() [with TT = boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >, boost::property >*, std::vector > >, boost::property >, std::allocator > >, boost::property > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>]’ 37 | ~model() | ^ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:233:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 233 | BOOST_CONCEPT_USAGE(EqualityComparable) { | ^~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::InputIterator > >, boost::property >*, std::vector > >, boost::property >, std::allocator > >, boost::property > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> >]’: /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements > >, boost::property >*, std::vector > >, boost::property >, std::allocator > >, boost::property > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:512:7: required from ‘struct boost::InputIterator > >, boost::property >*, std::vector > >, boost::property >, std::allocator > >, boost::property > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::InputIterator > >, boost::property >*, std::vector > >, boost::property >, std::allocator > >, boost::property > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> >]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied > >, boost::property >*, std::vector > >, boost::property >, std::allocator > >, boost::property > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::value’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied > >, boost::property >*, std::vector > >, boost::property >, std::allocator > >, boost::property > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:72:8: [ skipping 6 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/depth_first_search.hpp:286:39: required from ‘void boost::depth_first_search(const VertexListGraph&, DFSVisitor, ColorMap, typename graph_traits::vertex_descriptor) [with VertexListGraph = R_adjacency_list; DFSVisitor = detail::components_recorder; ColorMap = shared_array_property_map, long unsigned int> >; typename graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/depth_first_search.hpp:397:42: required from ‘void boost::graph::detail::depth_first_search_impl::operator()(const Graph&, const ArgPack&) const [with ArgPack = boost::parameter::aux::arg_list >, boost::parameter::aux::empty_arg_list, std::integral_constant >; Graph = R_adjacency_list]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/depth_first_search.hpp:406:5: required from ‘typename boost::result_of(Param0, const ArgPack&)>::type boost::graph::depth_first_search_with_named_params(const Param0&, const ArgPack&) [with Param0 = R_adjacency_list; ArgPack = boost::parameter::aux::arg_list >, boost::parameter::aux::empty_arg_list, std::integral_constant >; typename boost::result_of(Param0, const ArgPack&)>::type = void]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/depth_first_search.hpp:409:1: required from ‘typename boost::result_of(Param0, const typename boost::detail::convert_bgl_params_to_boost_parameter >::type&)>::type boost::depth_first_search(const Param0&, const bgl_named_params&) [with Param0 = R_adjacency_list; P = detail::components_recorder; T = graph_visitor_t; R = no_property; typename result_of(Param0, const typename detail::convert_bgl_params_to_boost_parameter >::type&)>::type = void; typename detail::convert_bgl_params_to_boost_parameter >::type = parameter::aux::arg_list >, parameter::aux::empty_arg_list, std::integral_constant >]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/connected_components.hpp:106:23: required from ‘typename boost::property_traits::value_type boost::connected_components(const Graph&, ComponentMap, typename enable_if_c::traversal_category>::value, graph::detail::no_parameter>::type) [with Graph = R_adjacency_list; ComponentMap = int*; typename property_traits::value_type = int; typename enable_if_c::traversal_category>::value, graph::detail::no_parameter>::type = graph::detail::no_parameter; typename graph_traits::traversal_category = undir_adj_list_traversal_tag]’ interfaces.cpp:205:29: required from here /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::InputIterator::~InputIterator() [with TT = boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >, boost::property >*, std::vector > >, boost::property >, std::allocator > >, boost::property > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>]’ 37 | ~model() | ^ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:512:7: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 512 | BOOST_CONCEPT_USAGE(InputIterator) | ^~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::constraint::failed() [with Model = boost::DFSVisitorConcept >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>, boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>, std::stack > > >, R_adjacency_list >]’: /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/depth_first_search.hpp:130:9: required from ‘void boost::depth_first_search(const VertexListGraph&, DFSVisitor, ColorMap, typename graph_traits::vertex_descriptor) [with VertexListGraph = R_adjacency_list; DFSVisitor = detail::tarjan_scc_visitor >, vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>, iterator_property_map<__gnu_cxx::__normal_iterator >, vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>, std::stack > > >; ColorMap = shared_array_property_map, long unsigned int> >; typename graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/depth_first_search.hpp:397:42: required from ‘void boost::graph::detail::depth_first_search_impl::operator()(const Graph&, const ArgPack&) const [with ArgPack = boost::parameter::aux::arg_list >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>, boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>, std::stack > > > >, boost::parameter::aux::empty_arg_list, std::integral_constant >; Graph = R_adjacency_list]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/depth_first_search.hpp:406:5: required from ‘typename boost::result_of(Param0, const ArgPack&)>::type boost::graph::depth_first_search_with_named_params(const Param0&, const ArgPack&) [with Param0 = R_adjacency_list; ArgPack = boost::parameter::aux::arg_list >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>, boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>, std::stack > > > >, boost::parameter::aux::empty_arg_list, std::integral_constant >; typename boost::result_of(Param0, const ArgPack&)>::type = void]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/depth_first_search.hpp:409:1: required from ‘typename boost::result_of(Param0, const typename boost::detail::convert_bgl_params_to_boost_parameter >::type&)>::type boost::depth_first_search(const Param0&, const bgl_named_params&) [with Param0 = R_adjacency_list; P = detail::tarjan_scc_visitor >, vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>, iterator_property_map<__gnu_cxx::__normal_iterator >, vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>, std::stack > > >; T = graph_visitor_t; R = bgl_named_params; typename result_of(Param0, const typename detail::convert_bgl_params_to_boost_parameter >::type&)>::type = void; typename detail::convert_bgl_params_to_boost_parameter >::type = parameter::aux::arg_list >, vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>, iterator_property_map<__gnu_cxx::__normal_iterator >, vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>, std::stack > > > >, parameter::aux::empty_arg_list, std::integral_constant >]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/strong_components.hpp:129:27: [ skipping 2 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/strong_components.hpp:177:63: required from ‘typename boost::property_traits::value_type boost::detail::scc_helper2(const Graph&, ComponentMap, RootMap, const boost::bgl_named_params&, DiscoverTimeMap) [with Graph = R_adjacency_list; ComponentMap = int*; RootMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>; P = int; T = int; R = boost::no_property; DiscoverTimeMap = boost::param_not_found; typename boost::property_traits::value_type = int]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/strong_components.hpp:205:31: required from ‘static typename boost::property_traits::value_type boost::detail::strong_comp_dispatch1::apply(const Graph&, ComponentMap, const boost::bgl_named_params&, boost::param_not_found) [with Graph = R_adjacency_list; ComponentMap = int*; P = int; T = int; R = boost::no_property; typename boost::property_traits::value_type = int]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/strong_components.hpp:220:63: required from ‘typename boost::property_traits::value_type boost::detail::scc_helper1(const Graph&, ComponentMap, const boost::bgl_named_params&, RootMap) [with Graph = R_adjacency_list; ComponentMap = int*; RootMap = boost::param_not_found; P = int; T = int; R = boost::no_property; typename boost::property_traits::value_type = int]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/strong_components.hpp:235:31: required from ‘typename boost::property_traits::value_type boost::strong_components(const Graph&, ComponentMap, const bgl_named_params&, typename enable_if_c::traversal_category>::value, graph::detail::no_parameter>::type) [with Graph = R_adjacency_list; ComponentMap = int*; P = int; T = int; R = no_property; typename property_traits::value_type = int; typename enable_if_c::traversal_category>::value, graph::detail::no_parameter>::type = graph::detail::no_parameter; typename graph_traits::traversal_category = adj_list_dir_traversal_tag]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/strong_components.hpp:249:29: required from ‘typename boost::property_traits::value_type boost::strong_components(const Graph&, ComponentMap, typename enable_if_c::traversal_category>::value, graph::detail::no_parameter>::type) [with Graph = R_adjacency_list; ComponentMap = int*; typename property_traits::value_type = int; typename enable_if_c::traversal_category>::value, graph::detail::no_parameter>::type = graph::detail::no_parameter; typename graph_traits::traversal_category = adj_list_dir_traversal_tag]’ interfaces.cpp:232:26: required from here /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:65:52: warning: ‘this’ pointer is null [-Wnonnull] 65 | static void failed() { ((Model*)0)->constraints(); } | ~~~~~~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/depth_first_search.hpp:39:10: note: in a call to non-static member function ‘void boost::DFSVisitorConcept::constraints() [with Visitor = boost::detail::tarjan_scc_visitor >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>, boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>, std::stack > > >; Graph = R_adjacency_list]’ 39 | void constraints() | ^~~~~~~~~~~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::constraint::failed() [with Model = boost::DFSVisitorConcept, boost::edge_weight_t>, boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>, boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>, boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>, boost::graph_detail::dummy_output_iterator, std::stack, std::deque, std::allocator > > >, std::vector, boost::vec_adj_list_vertex_id_map, long unsigned int>, boost::dfs_visitor<> >, R_adjacency_list >]’: /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/depth_first_search.hpp:130:9: required from ‘void boost::depth_first_search(const VertexListGraph&, DFSVisitor, ColorMap, typename graph_traits::vertex_descriptor) [with VertexListGraph = R_adjacency_list; DFSVisitor = detail::biconnected_components_visitor, edge_weight_t>, iterator_property_map<__gnu_cxx::__normal_iterator >, vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>, iterator_property_map<__gnu_cxx::__normal_iterator >, vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>, iterator_property_map<__gnu_cxx::__normal_iterator >, vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>, graph_detail::dummy_output_iterator, std::stack, std::deque, std::allocator > > >, std::vector, vec_adj_list_vertex_id_map, long unsigned int>, dfs_visitor<> >; ColorMap = shared_array_property_map, long unsigned int> >; typename graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/depth_first_search.hpp:397:42: required from ‘void boost::graph::detail::depth_first_search_impl::operator()(const Graph&, const ArgPack&) const [with ArgPack = boost::parameter::aux::arg_list, long unsigned int> >, boost::parameter::aux::arg_list, boost::edge_weight_t>, boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>, boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>, boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>, boost::graph_detail::dummy_output_iterator, std::stack, std::deque, std::allocator > > >, std::vector, boost::vec_adj_list_vertex_id_map, long unsigned int>, boost::dfs_visitor<> > >, boost::parameter::aux::empty_arg_list, std::integral_constant >, std::integral_constant >; Graph = R_adjacency_list]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/depth_first_search.hpp:406:5: required from ‘typename boost::result_of(Param0, const ArgPack&)>::type boost::graph::depth_first_search_with_named_params(const Param0&, const ArgPack&) [with Param0 = R_adjacency_list; ArgPack = boost::parameter::aux::arg_list, long unsigned int> >, boost::parameter::aux::arg_list, boost::edge_weight_t>, boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>, boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>, boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>, boost::graph_detail::dummy_output_iterator, std::stack, std::deque, std::allocator > > >, std::vector, boost::vec_adj_list_vertex_id_map, long unsigned int>, boost::dfs_visitor<> > >, boost::parameter::aux::empty_arg_list, std::integral_constant >, std::integral_constant >; typename boost::result_of(Param0, const ArgPack&)>::type = void]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/depth_first_search.hpp:409:1: required from ‘typename boost::result_of(Param0, const typename boost::detail::convert_bgl_params_to_boost_parameter >::type&)>::type boost::depth_first_search(const Param0&, const bgl_named_params&) [with Param0 = R_adjacency_list; P = vec_adj_list_vertex_id_map, long unsigned int>; T = vertex_index_t; R = bgl_named_params, edge_weight_t>, iterator_property_map<__gnu_cxx::__normal_iterator >, vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>, iterator_property_map<__gnu_cxx::__normal_iterator >, vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>, iterator_property_map<__gnu_cxx::__normal_iterator >, vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>, graph_detail::dummy_output_iterator, std::stack, std::deque, std::allocator > > >, std::vector, vec_adj_list_vertex_id_map, long unsigned int>, dfs_visitor<> >, graph_visitor_t, no_property>; typename result_of(Param0, const typename detail::convert_bgl_params_to_boost_parameter >::type&)>::type = void; typename detail::convert_bgl_params_to_boost_parameter >::type = parameter::aux::arg_list, long unsigned int> >, parameter::aux::arg_list, edge_weight_t>, iterator_property_map<__gnu_cxx::__normal_iterator >, vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>, iterator_property_map<__gnu_cxx::__normal_iterator >, vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>, iterator_property_map<__gnu_cxx::__normal_iterator >, vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>, graph_detail::dummy_output_iterator, std::stack, std::deque, std::allocator > > >, std::vector, vec_adj_list_vertex_id_map, long unsigned int>, dfs_visitor<> > >, parameter::aux::empty_arg_list, std::integral_constant >, std::integral_constant >]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/biconnected_components.hpp:211:27: [ skipping 2 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/biconnected_components.hpp:295:60: required from ‘static std::pair boost::detail::bicomp_dispatch2::apply(const Graph&, ComponentMap, OutputIterator, VertexIndexMap, DiscoverTimeMap, const boost::bgl_named_params&, boost::param_not_found) [with Graph = R_adjacency_list; ComponentMap = boost::adj_list_edge_property_map, boost::edge_weight_t>; OutputIterator = boost::graph_detail::dummy_output_iterator; VertexIndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>; DiscoverTimeMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>; P = int; T = boost::buffer_param_t; R = boost::no_property]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/biconnected_components.hpp:336:60: required from ‘static std::pair boost::detail::bicomp_dispatch1::apply(const Graph&, ComponentMap, OutputIterator, VertexIndexMap, const boost::bgl_named_params&, boost::param_not_found) [with Graph = R_adjacency_list; ComponentMap = boost::adj_list_edge_property_map, boost::edge_weight_t>; OutputIterator = boost::graph_detail::dummy_output_iterator; VertexIndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>; P = int; T = boost::buffer_param_t; R = boost::no_property]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/biconnected_components.hpp:368:60: required from ‘std::pair boost::biconnected_components(const Graph&, ComponentMap, OutputIterator, const bgl_named_params&) [with Graph = R_adjacency_list; ComponentMap = adj_list_edge_property_map, edge_weight_t>; OutputIterator = graph_detail::dummy_output_iterator; P = int; T = buffer_param_t; R = no_property]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/biconnected_components.hpp:377:34: required from ‘std::pair boost::biconnected_components(const Graph&, ComponentMap, OutputIterator) [with Graph = R_adjacency_list; ComponentMap = adj_list_edge_property_map, edge_weight_t>; OutputIterator = graph_detail::dummy_output_iterator]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/biconnected_components.hpp:417:34: required from ‘std::size_t boost::biconnected_components(const Graph&, ComponentMap) [with Graph = R_adjacency_list; ComponentMap = adj_list_edge_property_map, edge_weight_t>; std::size_t = long unsigned int]’ interfaces.cpp:264:47: required from here /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:65:52: warning: ‘this’ pointer is null [-Wnonnull] 65 | static void failed() { ((Model*)0)->constraints(); } | ~~~~~~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/depth_first_search.hpp:39:10: note: in a call to non-static member function ‘void boost::DFSVisitorConcept::constraints() [with Visitor = boost::detail::biconnected_components_visitor, boost::edge_weight_t>, boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>, boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>, boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>, boost::graph_detail::dummy_output_iterator, std::stack, std::deque, std::allocator > > >, std::vector, boost::vec_adj_list_vertex_id_map, long unsigned int>, boost::dfs_visitor<> >; Graph = R_adjacency_list]’ 39 | void constraints() | ^~~~~~~~~~~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::Assignable >]’: /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements > >]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:145:5: required from ‘struct boost::Assignable >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:502:3: required from ‘struct boost::InputIterator >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::InputIterator >]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied > >::value’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:45:51: [ skipping 7 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/biconnected_components.hpp:250:47: required from ‘static std::pair boost::detail::bicomp_dispatch3::apply(const Graph&, ComponentMap, OutputIterator, VertexIndexMap, DiscoverTimeMap, LowPointMap, const boost::bgl_named_params&, boost::param_not_found) [with Graph = R_adjacency_list; ComponentMap = boost::dummy_property_map; OutputIterator = std::back_insert_iterator >; VertexIndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>; DiscoverTimeMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>; LowPointMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>; P = int; T = boost::buffer_param_t; R = boost::no_property]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/biconnected_components.hpp:295:60: required from ‘static std::pair boost::detail::bicomp_dispatch2::apply(const Graph&, ComponentMap, OutputIterator, VertexIndexMap, DiscoverTimeMap, const boost::bgl_named_params&, boost::param_not_found) [with Graph = R_adjacency_list; ComponentMap = boost::dummy_property_map; OutputIterator = std::back_insert_iterator >; VertexIndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>; DiscoverTimeMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>; P = int; T = boost::buffer_param_t; R = boost::no_property]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/biconnected_components.hpp:336:60: required from ‘static std::pair boost::detail::bicomp_dispatch1::apply(const Graph&, ComponentMap, OutputIterator, VertexIndexMap, const boost::bgl_named_params&, boost::param_not_found) [with Graph = R_adjacency_list; ComponentMap = boost::dummy_property_map; OutputIterator = std::back_insert_iterator >; VertexIndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>; P = int; T = boost::buffer_param_t; R = boost::no_property]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/biconnected_components.hpp:368:60: required from ‘std::pair boost::biconnected_components(const Graph&, ComponentMap, OutputIterator, const bgl_named_params&) [with Graph = R_adjacency_list; ComponentMap = dummy_property_map; OutputIterator = std::back_insert_iterator >; P = int; T = buffer_param_t; R = no_property]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/biconnected_components.hpp:433:34: required from ‘OutputIterator boost::articulation_points(const Graph&, OutputIterator) [with Graph = R_adjacency_list; OutputIterator = std::back_insert_iterator >]’ interfaces.cpp:300:28: required from here /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::Assignable::~Assignable() [with TT = boost::range_detail::integer_iterator]’ 37 | ~model() | ^ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:145:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 145 | BOOST_CONCEPT_USAGE(Assignable) { | ^~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::EqualityComparable >]’: /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements > >]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:233:5: required from ‘struct boost::EqualityComparable >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:502:3: required from ‘struct boost::InputIterator >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::InputIterator >]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied > >::value’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:45:51: [ skipping 7 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/biconnected_components.hpp:250:47: required from ‘static std::pair boost::detail::bicomp_dispatch3::apply(const Graph&, ComponentMap, OutputIterator, VertexIndexMap, DiscoverTimeMap, LowPointMap, const boost::bgl_named_params&, boost::param_not_found) [with Graph = R_adjacency_list; ComponentMap = boost::dummy_property_map; OutputIterator = std::back_insert_iterator >; VertexIndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>; DiscoverTimeMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>; LowPointMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>; P = int; T = boost::buffer_param_t; R = boost::no_property]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/biconnected_components.hpp:295:60: required from ‘static std::pair boost::detail::bicomp_dispatch2::apply(const Graph&, ComponentMap, OutputIterator, VertexIndexMap, DiscoverTimeMap, const boost::bgl_named_params&, boost::param_not_found) [with Graph = R_adjacency_list; ComponentMap = boost::dummy_property_map; OutputIterator = std::back_insert_iterator >; VertexIndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>; DiscoverTimeMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>; P = int; T = boost::buffer_param_t; R = boost::no_property]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/biconnected_components.hpp:336:60: required from ‘static std::pair boost::detail::bicomp_dispatch1::apply(const Graph&, ComponentMap, OutputIterator, VertexIndexMap, const boost::bgl_named_params&, boost::param_not_found) [with Graph = R_adjacency_list; ComponentMap = boost::dummy_property_map; OutputIterator = std::back_insert_iterator >; VertexIndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>; P = int; T = boost::buffer_param_t; R = boost::no_property]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/biconnected_components.hpp:368:60: required from ‘std::pair boost::biconnected_components(const Graph&, ComponentMap, OutputIterator, const bgl_named_params&) [with Graph = R_adjacency_list; ComponentMap = dummy_property_map; OutputIterator = std::back_insert_iterator >; P = int; T = buffer_param_t; R = no_property]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/biconnected_components.hpp:433:34: required from ‘OutputIterator boost::articulation_points(const Graph&, OutputIterator) [with Graph = R_adjacency_list; OutputIterator = std::back_insert_iterator >]’ interfaces.cpp:300:28: required from here /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::EqualityComparable::~EqualityComparable() [with TT = boost::range_detail::integer_iterator]’ 37 | ~model() | ^ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:233:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 233 | BOOST_CONCEPT_USAGE(EqualityComparable) { | ^~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::InputIterator >]’: /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements > >]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:512:7: required from ‘struct boost::InputIterator >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::InputIterator >]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied > >::value’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied > >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:72:8: [ skipping 6 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/biconnected_components.hpp:250:47: required from ‘static std::pair boost::detail::bicomp_dispatch3::apply(const Graph&, ComponentMap, OutputIterator, VertexIndexMap, DiscoverTimeMap, LowPointMap, const boost::bgl_named_params&, boost::param_not_found) [with Graph = R_adjacency_list; ComponentMap = boost::dummy_property_map; OutputIterator = std::back_insert_iterator >; VertexIndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>; DiscoverTimeMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>; LowPointMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>; P = int; T = boost::buffer_param_t; R = boost::no_property]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/biconnected_components.hpp:295:60: required from ‘static std::pair boost::detail::bicomp_dispatch2::apply(const Graph&, ComponentMap, OutputIterator, VertexIndexMap, DiscoverTimeMap, const boost::bgl_named_params&, boost::param_not_found) [with Graph = R_adjacency_list; ComponentMap = boost::dummy_property_map; OutputIterator = std::back_insert_iterator >; VertexIndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>; DiscoverTimeMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>; P = int; T = boost::buffer_param_t; R = boost::no_property]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/biconnected_components.hpp:336:60: required from ‘static std::pair boost::detail::bicomp_dispatch1::apply(const Graph&, ComponentMap, OutputIterator, VertexIndexMap, const boost::bgl_named_params&, boost::param_not_found) [with Graph = R_adjacency_list; ComponentMap = boost::dummy_property_map; OutputIterator = std::back_insert_iterator >; VertexIndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>; P = int; T = boost::buffer_param_t; R = boost::no_property]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/biconnected_components.hpp:368:60: required from ‘std::pair boost::biconnected_components(const Graph&, ComponentMap, OutputIterator, const bgl_named_params&) [with Graph = R_adjacency_list; ComponentMap = dummy_property_map; OutputIterator = std::back_insert_iterator >; P = int; T = buffer_param_t; R = no_property]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/biconnected_components.hpp:433:34: required from ‘OutputIterator boost::articulation_points(const Graph&, OutputIterator) [with Graph = R_adjacency_list; OutputIterator = std::back_insert_iterator >]’ interfaces.cpp:300:28: required from here /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::InputIterator::~InputIterator() [with TT = boost::range_detail::integer_iterator]’ 37 | ~model() | ^ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:512:7: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 512 | BOOST_CONCEPT_USAGE(InputIterator) | ^~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>, boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>, boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>, std::back_insert_iterator >, std::stack, std::deque, std::allocator > > >, std::vector, boost::vec_adj_list_vertex_id_map, long unsigned int>, boost::dfs_visitor<> > > >]’: /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:167:5: required from ‘struct boost::CopyConstructible >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>, boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>, boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>, std::back_insert_iterator >, std::stack, std::deque, std::allocator > > >, std::vector, boost::vec_adj_list_vertex_id_map, long unsigned int>, boost::dfs_visitor<> > >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:165:3: required from ‘struct boost::CopyConstructibleConcept >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>, boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>, boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>, std::back_insert_iterator >, std::stack, std::deque, std::allocator > > >, std::vector, boost::vec_adj_list_vertex_id_map, long unsigned int>, boost::dfs_visitor<> > >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::CopyConstructibleConcept >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>, boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>, boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>, std::back_insert_iterator >, std::stack, std::deque, std::allocator > > >, std::vector, boost::vec_adj_list_vertex_id_map, long unsigned int>, boost::dfs_visitor<> > >]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>, boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>, boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>, std::back_insert_iterator >, std::stack, std::deque, std::allocator > > >, std::vector, boost::vec_adj_list_vertex_id_map, long unsigned int>, boost::dfs_visitor<> > > >::value’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>, boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>, boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>, std::back_insert_iterator >, std::stack, std::deque, std::allocator > > >, std::vector, boost::vec_adj_list_vertex_id_map, long unsigned int>, boost::dfs_visitor<> > > >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:72:8: [ skipping 11 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/biconnected_components.hpp:250:47: required from ‘static std::pair boost::detail::bicomp_dispatch3::apply(const Graph&, ComponentMap, OutputIterator, VertexIndexMap, DiscoverTimeMap, LowPointMap, const boost::bgl_named_params&, boost::param_not_found) [with Graph = R_adjacency_list; ComponentMap = boost::dummy_property_map; OutputIterator = std::back_insert_iterator >; VertexIndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>; DiscoverTimeMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>; LowPointMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>; P = int; T = boost::buffer_param_t; R = boost::no_property]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/biconnected_components.hpp:295:60: required from ‘static std::pair boost::detail::bicomp_dispatch2::apply(const Graph&, ComponentMap, OutputIterator, VertexIndexMap, DiscoverTimeMap, const boost::bgl_named_params&, boost::param_not_found) [with Graph = R_adjacency_list; ComponentMap = boost::dummy_property_map; OutputIterator = std::back_insert_iterator >; VertexIndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>; DiscoverTimeMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>; P = int; T = boost::buffer_param_t; R = boost::no_property]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/biconnected_components.hpp:336:60: required from ‘static std::pair boost::detail::bicomp_dispatch1::apply(const Graph&, ComponentMap, OutputIterator, VertexIndexMap, const boost::bgl_named_params&, boost::param_not_found) [with Graph = R_adjacency_list; ComponentMap = boost::dummy_property_map; OutputIterator = std::back_insert_iterator >; VertexIndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>; P = int; T = boost::buffer_param_t; R = boost::no_property]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/biconnected_components.hpp:368:60: required from ‘std::pair boost::biconnected_components(const Graph&, ComponentMap, OutputIterator, const bgl_named_params&) [with Graph = R_adjacency_list; ComponentMap = dummy_property_map; OutputIterator = std::back_insert_iterator >; P = int; T = buffer_param_t; R = no_property]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/biconnected_components.hpp:433:34: required from ‘OutputIterator boost::articulation_points(const Graph&, OutputIterator) [with Graph = R_adjacency_list; OutputIterator = std::back_insert_iterator >]’ interfaces.cpp:300:28: required from here /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::CopyConstructible >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>, boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>, boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>, std::back_insert_iterator >, std::stack, std::deque, std::allocator > > >, std::vector, boost::vec_adj_list_vertex_id_map, long unsigned int>, boost::dfs_visitor<> > >]’ 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ^ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::CopyConstructibleConcept >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>, boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>, boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>, std::back_insert_iterator >, std::stack, std::deque, std::allocator > > >, std::vector, boost::vec_adj_list_vertex_id_map, long unsigned int>, boost::dfs_visitor<> > >]’: /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/depth_first_search.hpp:41:9: required from ‘void boost::DFSVisitorConcept::constraints() [with Visitor = boost::detail::biconnected_components_visitor >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>, boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>, boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>, std::back_insert_iterator >, std::stack, std::deque, std::allocator > > >, std::vector, boost::vec_adj_list_vertex_id_map, long unsigned int>, boost::dfs_visitor<> >; Graph = R_adjacency_list]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::DFSVisitorConcept >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>, boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>, boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>, std::back_insert_iterator >, std::stack, std::deque, std::allocator > > >, std::vector, boost::vec_adj_list_vertex_id_map, long unsigned int>, boost::dfs_visitor<> >, R_adjacency_list >]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>, boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>, boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>, std::back_insert_iterator >, std::stack, std::deque, std::allocator > > >, std::vector, boost::vec_adj_list_vertex_id_map, long unsigned int>, boost::dfs_visitor<> >, R_adjacency_list > >::value’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>, boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>, boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>, std::back_insert_iterator >, std::stack, std::deque, std::allocator > > >, std::vector, boost::vec_adj_list_vertex_id_map, long unsigned int>, boost::dfs_visitor<> >, R_adjacency_list > >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_ >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>, boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>, boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>, std::back_insert_iterator >, std::stack, std::deque, std::allocator > > >, std::vector, boost::vec_adj_list_vertex_id_map, long unsigned int>, boost::dfs_visitor<> >, R_adjacency_list >)>’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/depth_first_search.hpp:130:9: [ skipping 5 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/biconnected_components.hpp:250:47: required from ‘static std::pair boost::detail::bicomp_dispatch3::apply(const Graph&, ComponentMap, OutputIterator, VertexIndexMap, DiscoverTimeMap, LowPointMap, const boost::bgl_named_params&, boost::param_not_found) [with Graph = R_adjacency_list; ComponentMap = boost::dummy_property_map; OutputIterator = std::back_insert_iterator >; VertexIndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>; DiscoverTimeMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>; LowPointMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>; P = int; T = boost::buffer_param_t; R = boost::no_property]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/biconnected_components.hpp:295:60: required from ‘static std::pair boost::detail::bicomp_dispatch2::apply(const Graph&, ComponentMap, OutputIterator, VertexIndexMap, DiscoverTimeMap, const boost::bgl_named_params&, boost::param_not_found) [with Graph = R_adjacency_list; ComponentMap = boost::dummy_property_map; OutputIterator = std::back_insert_iterator >; VertexIndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>; DiscoverTimeMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>; P = int; T = boost::buffer_param_t; R = boost::no_property]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/biconnected_components.hpp:336:60: required from ‘static std::pair boost::detail::bicomp_dispatch1::apply(const Graph&, ComponentMap, OutputIterator, VertexIndexMap, const boost::bgl_named_params&, boost::param_not_found) [with Graph = R_adjacency_list; ComponentMap = boost::dummy_property_map; OutputIterator = std::back_insert_iterator >; VertexIndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>; P = int; T = boost::buffer_param_t; R = boost::no_property]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/biconnected_components.hpp:368:60: required from ‘std::pair boost::biconnected_components(const Graph&, ComponentMap, OutputIterator, const bgl_named_params&) [with Graph = R_adjacency_list; ComponentMap = dummy_property_map; OutputIterator = std::back_insert_iterator >; P = int; T = buffer_param_t; R = no_property]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/biconnected_components.hpp:433:34: required from ‘OutputIterator boost::articulation_points(const Graph&, OutputIterator) [with Graph = R_adjacency_list; OutputIterator = std::back_insert_iterator >]’ interfaces.cpp:300:28: required from here /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:165:17: note: in a call to non-static member function ‘boost::CopyConstructibleConcept >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>, boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>, boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>, std::back_insert_iterator >, std::stack, std::deque, std::allocator > > >, std::vector, boost::vec_adj_list_vertex_id_map, long unsigned int>, boost::dfs_visitor<> > >::~CopyConstructibleConcept()’ 165 | BOOST_concept(CopyConstructible,(TT)) | ^~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/preprocessor/cat.hpp:29:34: note: in definition of macro ‘BOOST_PP_CAT_I’ 29 | # define BOOST_PP_CAT_I(a, b) a ## b | ^ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/concept_def.hpp:23:12: note: in expansion of macro ‘BOOST_PP_CAT’ 23 | struct BOOST_PP_CAT(name,Concept) \ | ^~~~~~~~~~~~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:165:3: note: in expansion of macro ‘BOOST_concept’ 165 | BOOST_concept(CopyConstructible,(TT)) | ^~~~~~~~~~~~~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements, std::input_iterator_tag> >]’: /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:208:5: required from ‘struct boost::Convertible, std::input_iterator_tag>’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::Convertible, std::input_iterator_tag>]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied, std::input_iterator_tag> >::value’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied, std::input_iterator_tag> >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_, std::input_iterator_tag>)>’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:515:9: [ skipping 6 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/depth_first_search.hpp:129:9: required from ‘void boost::breadth_first_visit(const IncidenceGraph&, SourceIterator, SourceIterator, Buffer&, BFSVisitor, ColorMap) [with IncidenceGraph = filtered_graph > > >, no_property, listS>, is_residual_edge > > >, edge_residual_capacity_t> >, keep_all>; Buffer = queue > >; BFSVisitor = bfs_visitor*, on_tree_edge> >; ColorMap = default_color_type*; SourceIterator = long unsigned int*]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/breadth_first_search.hpp:136:24: required from ‘void boost::breadth_first_search(const VertexListGraph&, SourceIterator, SourceIterator, Buffer&, BFSVisitor, ColorMap) [with VertexListGraph = filtered_graph > > >, no_property, listS>, is_residual_edge > > >, edge_residual_capacity_t> >, keep_all>; SourceIterator = long unsigned int*; Buffer = queue > >; BFSVisitor = bfs_visitor*, on_tree_edge> >; ColorMap = default_color_type*]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/breadth_first_search.hpp:147:25: required from ‘void boost::breadth_first_search(const VertexListGraph&, typename graph_traits::vertex_descriptor, Buffer&, BFSVisitor, ColorMap) [with VertexListGraph = filtered_graph > > >, no_property, listS>, is_residual_edge > > >, edge_residual_capacity_t> >, keep_all>; Buffer = queue > >; BFSVisitor = bfs_visitor*, on_tree_edge> >; ColorMap = default_color_type*; typename graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/edmonds_karp_max_flow.hpp:101:29: required from ‘typename boost::property_traits::value_type boost::edmonds_karp_max_flow(Graph&, typename graph_traits::vertex_descriptor, typename graph_traits::vertex_descriptor, CapacityEdgeMap, ResidualCapacityEdgeMap, ReverseEdgeMap, ColorMap, PredEdgeMap) [with Graph = adjacency_list > > >, no_property, listS>; CapacityEdgeMap = adj_list_edge_property_map > > >, edge_capacity_t>; ResidualCapacityEdgeMap = adj_list_edge_property_map > > >, edge_residual_capacity_t>; ReverseEdgeMap = adj_list_edge_property_map, detail::edge_desc_impl&, long unsigned int, property > > >, edge_reverse_t>; ColorMap = default_color_type*; PredEdgeMap = detail::edge_desc_impl*; typename property_traits::value_type = long unsigned int; typename graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/edge_connectivity.hpp:145:42: required from ‘typename boost::graph_traits::degree_size_type boost::edge_connectivity(VertexListGraph&, OutputIterator) [with VertexListGraph = R_adjacency_list; OutputIterator = std::back_insert_iterator > >; typename graph_traits::degree_size_type = long unsigned int]’ interfaces.cpp:326:34: required from here /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::Convertible, std::input_iterator_tag>]’ 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ^ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::Convertible, std::input_iterator_tag>]’: /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:515:9: required from ‘boost::InputIterator::~InputIterator() [with TT = boost::iterators::filter_iterator > > >, boost::edge_residual_capacity_t> >, boost::keep_all, boost::filtered_graph > > >, boost::no_property, boost::listS>, boost::is_residual_edge > > >, boost::edge_residual_capacity_t> >, boost::keep_all> >, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > > > >*, std::vector > > > >, std::allocator > > > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> >]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::InputIterator > > >, boost::edge_residual_capacity_t> >, boost::keep_all, boost::filtered_graph > > >, boost::no_property, boost::listS>, boost::is_residual_edge > > >, boost::edge_residual_capacity_t> >, boost::keep_all> >, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > > > >*, std::vector > > > >, std::allocator > > > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/graph_concepts.hpp:53:35: required from ‘boost::concepts::MultiPassInputIterator::~MultiPassInputIterator() [with T = boost::iterators::filter_iterator > > >, boost::edge_residual_capacity_t> >, boost::keep_all, boost::filtered_graph > > >, boost::no_property, boost::listS>, boost::is_residual_edge > > >, boost::edge_residual_capacity_t> >, boost::keep_all> >, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > > > >*, std::vector > > > >, std::allocator > > > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> >]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::MultiPassInputIterator > > >, boost::edge_residual_capacity_t> >, boost::keep_all, boost::filtered_graph > > >, boost::no_property, boost::listS>, boost::is_residual_edge > > >, boost::edge_residual_capacity_t> >, boost::keep_all> >, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > > > >*, std::vector > > > >, std::allocator > > > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/graph_concepts.hpp:89:9: [ skipping 2 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/depth_first_search.hpp:129:9: required from ‘void boost::breadth_first_visit(const IncidenceGraph&, SourceIterator, SourceIterator, Buffer&, BFSVisitor, ColorMap) [with IncidenceGraph = filtered_graph > > >, no_property, listS>, is_residual_edge > > >, edge_residual_capacity_t> >, keep_all>; Buffer = queue > >; BFSVisitor = bfs_visitor*, on_tree_edge> >; ColorMap = default_color_type*; SourceIterator = long unsigned int*]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/breadth_first_search.hpp:136:24: required from ‘void boost::breadth_first_search(const VertexListGraph&, SourceIterator, SourceIterator, Buffer&, BFSVisitor, ColorMap) [with VertexListGraph = filtered_graph > > >, no_property, listS>, is_residual_edge > > >, edge_residual_capacity_t> >, keep_all>; SourceIterator = long unsigned int*; Buffer = queue > >; BFSVisitor = bfs_visitor*, on_tree_edge> >; ColorMap = default_color_type*]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/breadth_first_search.hpp:147:25: required from ‘void boost::breadth_first_search(const VertexListGraph&, typename graph_traits::vertex_descriptor, Buffer&, BFSVisitor, ColorMap) [with VertexListGraph = filtered_graph > > >, no_property, listS>, is_residual_edge > > >, edge_residual_capacity_t> >, keep_all>; Buffer = queue > >; BFSVisitor = bfs_visitor*, on_tree_edge> >; ColorMap = default_color_type*; typename graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/edmonds_karp_max_flow.hpp:101:29: required from ‘typename boost::property_traits::value_type boost::edmonds_karp_max_flow(Graph&, typename graph_traits::vertex_descriptor, typename graph_traits::vertex_descriptor, CapacityEdgeMap, ResidualCapacityEdgeMap, ReverseEdgeMap, ColorMap, PredEdgeMap) [with Graph = adjacency_list > > >, no_property, listS>; CapacityEdgeMap = adj_list_edge_property_map > > >, edge_capacity_t>; ResidualCapacityEdgeMap = adj_list_edge_property_map > > >, edge_residual_capacity_t>; ReverseEdgeMap = adj_list_edge_property_map, detail::edge_desc_impl&, long unsigned int, property > > >, edge_reverse_t>; ColorMap = default_color_type*; PredEdgeMap = detail::edge_desc_impl*; typename property_traits::value_type = long unsigned int; typename graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/edge_connectivity.hpp:145:42: required from ‘typename boost::graph_traits::degree_size_type boost::edge_connectivity(VertexListGraph&, OutputIterator) [with VertexListGraph = R_adjacency_list; OutputIterator = std::back_insert_iterator > >; typename graph_traits::degree_size_type = long unsigned int]’ interfaces.cpp:326:34: required from here /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::Convertible::~Convertible() [with X = boost::iterators::detail::iterator_category_with_traversal; Y = std::input_iterator_tag]’ 37 | ~model() | ^ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:208:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 208 | BOOST_CONCEPT_USAGE(Convertible) { | ^~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::Convertible, std::input_iterator_tag>]’: /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements, std::input_iterator_tag> >]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:208:5: required from ‘struct boost::Convertible, std::input_iterator_tag>’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::Convertible, std::input_iterator_tag>]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied, std::input_iterator_tag> >::value’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied, std::input_iterator_tag> >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:72:8: [ skipping 7 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/depth_first_search.hpp:129:9: required from ‘void boost::detail::depth_first_visit_impl(const IncidenceGraph&, typename boost::graph_traits::vertex_descriptor, DFSVisitor&, ColorMap, TerminatorFunc) [with IncidenceGraph = R_adjacency_list; DFSVisitor = dfs_time_visitor; ColorMap = boost::shared_array_property_map, long unsigned int> >; TerminatorFunc = nontruth2; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/depth_first_search.hpp:286:39: required from ‘void boost::depth_first_search(const VertexListGraph&, DFSVisitor, ColorMap, typename graph_traits::vertex_descriptor) [with VertexListGraph = R_adjacency_list; DFSVisitor = dfs_time_visitor; ColorMap = shared_array_property_map, long unsigned int> >; typename graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/depth_first_search.hpp:397:42: required from ‘void boost::graph::detail::depth_first_search_impl::operator()(const Graph&, const ArgPack&) const [with ArgPack = boost::parameter::aux::arg_list >, boost::parameter::aux::empty_arg_list, std::integral_constant >; Graph = R_adjacency_list]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/depth_first_search.hpp:406:5: required from ‘typename boost::result_of(Param0, const ArgPack&)>::type boost::graph::depth_first_search_with_named_params(const Param0&, const ArgPack&) [with Param0 = R_adjacency_list; ArgPack = boost::parameter::aux::arg_list >, boost::parameter::aux::empty_arg_list, std::integral_constant >; typename boost::result_of(Param0, const ArgPack&)>::type = void]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/depth_first_search.hpp:409:1: required from ‘typename boost::result_of(Param0, const typename boost::detail::convert_bgl_params_to_boost_parameter >::type&)>::type boost::depth_first_search(const Param0&, const bgl_named_params&) [with Param0 = R_adjacency_list; P = dfs_time_visitor; T = graph_visitor_t; R = no_property; typename result_of(Param0, const typename detail::convert_bgl_params_to_boost_parameter >::type&)>::type = void; typename detail::convert_bgl_params_to_boost_parameter >::type = parameter::aux::arg_list >, parameter::aux::empty_arg_list, std::integral_constant >]’ interfaces.cpp:158:27: required from here /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::Convertible::~Convertible() [with X = boost::iterators::detail::iterator_category_with_traversal; Y = std::input_iterator_tag]’ 37 | ~model() | ^ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:208:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 208 | BOOST_CONCEPT_USAGE(Convertible) { | ^~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>, boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>, std::stack > > > > >]’: /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:167:5: required from ‘struct boost::CopyConstructible >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>, boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>, std::stack > > > >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:165:3: required from ‘struct boost::CopyConstructibleConcept >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>, boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>, std::stack > > > >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::CopyConstructibleConcept >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>, boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>, std::stack > > > >]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>, boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>, std::stack > > > > >::value’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>, boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>, std::stack > > > > >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:72:8: [ skipping 12 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/strong_components.hpp:177:63: required from ‘typename boost::property_traits::value_type boost::detail::scc_helper2(const Graph&, ComponentMap, RootMap, const boost::bgl_named_params&, DiscoverTimeMap) [with Graph = R_adjacency_list; ComponentMap = int*; RootMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>; P = int; T = int; R = boost::no_property; DiscoverTimeMap = boost::param_not_found; typename boost::property_traits::value_type = int]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/strong_components.hpp:205:31: required from ‘static typename boost::property_traits::value_type boost::detail::strong_comp_dispatch1::apply(const Graph&, ComponentMap, const boost::bgl_named_params&, boost::param_not_found) [with Graph = R_adjacency_list; ComponentMap = int*; P = int; T = int; R = boost::no_property; typename boost::property_traits::value_type = int]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/strong_components.hpp:220:63: required from ‘typename boost::property_traits::value_type boost::detail::scc_helper1(const Graph&, ComponentMap, const boost::bgl_named_params&, RootMap) [with Graph = R_adjacency_list; ComponentMap = int*; RootMap = boost::param_not_found; P = int; T = int; R = boost::no_property; typename boost::property_traits::value_type = int]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/strong_components.hpp:235:31: required from ‘typename boost::property_traits::value_type boost::strong_components(const Graph&, ComponentMap, const bgl_named_params&, typename enable_if_c::traversal_category>::value, graph::detail::no_parameter>::type) [with Graph = R_adjacency_list; ComponentMap = int*; P = int; T = int; R = no_property; typename property_traits::value_type = int; typename enable_if_c::traversal_category>::value, graph::detail::no_parameter>::type = graph::detail::no_parameter; typename graph_traits::traversal_category = adj_list_dir_traversal_tag]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/strong_components.hpp:249:29: required from ‘typename boost::property_traits::value_type boost::strong_components(const Graph&, ComponentMap, typename enable_if_c::traversal_category>::value, graph::detail::no_parameter>::type) [with Graph = R_adjacency_list; ComponentMap = int*; typename property_traits::value_type = int; typename enable_if_c::traversal_category>::value, graph::detail::no_parameter>::type = graph::detail::no_parameter; typename graph_traits::traversal_category = adj_list_dir_traversal_tag]’ interfaces.cpp:232:26: required from here /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::CopyConstructible >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>, boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>, std::stack > > > >]’ 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ^ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::CopyConstructibleConcept >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>, boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>, std::stack > > > >]’: /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/depth_first_search.hpp:41:9: required from ‘void boost::DFSVisitorConcept::constraints() [with Visitor = boost::detail::tarjan_scc_visitor >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>, boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>, std::stack > > >; Graph = R_adjacency_list]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::DFSVisitorConcept >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>, boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>, std::stack > > >, R_adjacency_list >]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>, boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>, std::stack > > >, R_adjacency_list > >::value’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>, boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>, std::stack > > >, R_adjacency_list > >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_ >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>, boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>, std::stack > > >, R_adjacency_list >)>’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/depth_first_search.hpp:130:9: [ skipping 6 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/strong_components.hpp:177:63: required from ‘typename boost::property_traits::value_type boost::detail::scc_helper2(const Graph&, ComponentMap, RootMap, const boost::bgl_named_params&, DiscoverTimeMap) [with Graph = R_adjacency_list; ComponentMap = int*; RootMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>; P = int; T = int; R = boost::no_property; DiscoverTimeMap = boost::param_not_found; typename boost::property_traits::value_type = int]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/strong_components.hpp:205:31: required from ‘static typename boost::property_traits::value_type boost::detail::strong_comp_dispatch1::apply(const Graph&, ComponentMap, const boost::bgl_named_params&, boost::param_not_found) [with Graph = R_adjacency_list; ComponentMap = int*; P = int; T = int; R = boost::no_property; typename boost::property_traits::value_type = int]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/strong_components.hpp:220:63: required from ‘typename boost::property_traits::value_type boost::detail::scc_helper1(const Graph&, ComponentMap, const boost::bgl_named_params&, RootMap) [with Graph = R_adjacency_list; ComponentMap = int*; RootMap = boost::param_not_found; P = int; T = int; R = boost::no_property; typename boost::property_traits::value_type = int]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/strong_components.hpp:235:31: required from ‘typename boost::property_traits::value_type boost::strong_components(const Graph&, ComponentMap, const bgl_named_params&, typename enable_if_c::traversal_category>::value, graph::detail::no_parameter>::type) [with Graph = R_adjacency_list; ComponentMap = int*; P = int; T = int; R = no_property; typename property_traits::value_type = int; typename enable_if_c::traversal_category>::value, graph::detail::no_parameter>::type = graph::detail::no_parameter; typename graph_traits::traversal_category = adj_list_dir_traversal_tag]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/strong_components.hpp:249:29: required from ‘typename boost::property_traits::value_type boost::strong_components(const Graph&, ComponentMap, typename enable_if_c::traversal_category>::value, graph::detail::no_parameter>::type) [with Graph = R_adjacency_list; ComponentMap = int*; typename property_traits::value_type = int; typename enable_if_c::traversal_category>::value, graph::detail::no_parameter>::type = graph::detail::no_parameter; typename graph_traits::traversal_category = adj_list_dir_traversal_tag]’ interfaces.cpp:232:26: required from here /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:165:17: note: in a call to non-static member function ‘boost::CopyConstructibleConcept >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>, boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>, std::stack > > > >::~CopyConstructibleConcept()’ 165 | BOOST_concept(CopyConstructible,(TT)) | ^~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/preprocessor/cat.hpp:29:34: note: in definition of macro ‘BOOST_PP_CAT_I’ 29 | # define BOOST_PP_CAT_I(a, b) a ## b | ^ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/concept_def.hpp:23:12: note: in expansion of macro ‘BOOST_PP_CAT’ 23 | struct BOOST_PP_CAT(name,Concept) \ | ^~~~~~~~~~~~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:165:3: note: in expansion of macro ‘BOOST_concept’ 165 | BOOST_concept(CopyConstructible,(TT)) | ^~~~~~~~~~~~~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements, boost::edge_weight_t>, boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>, boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>, boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>, boost::graph_detail::dummy_output_iterator, std::stack, std::deque, std::allocator > > >, std::vector, boost::vec_adj_list_vertex_id_map, long unsigned int>, boost::dfs_visitor<> > > >]’: /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:167:5: required from ‘struct boost::CopyConstructible, boost::edge_weight_t>, boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>, boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>, boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>, boost::graph_detail::dummy_output_iterator, std::stack, std::deque, std::allocator > > >, std::vector, boost::vec_adj_list_vertex_id_map, long unsigned int>, boost::dfs_visitor<> > >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:165:3: required from ‘struct boost::CopyConstructibleConcept, boost::edge_weight_t>, boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>, boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>, boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>, boost::graph_detail::dummy_output_iterator, std::stack, std::deque, std::allocator > > >, std::vector, boost::vec_adj_list_vertex_id_map, long unsigned int>, boost::dfs_visitor<> > >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::CopyConstructibleConcept, boost::edge_weight_t>, boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>, boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>, boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>, boost::graph_detail::dummy_output_iterator, std::stack, std::deque, std::allocator > > >, std::vector, boost::vec_adj_list_vertex_id_map, long unsigned int>, boost::dfs_visitor<> > >]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied, boost::edge_weight_t>, boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>, boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>, boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>, boost::graph_detail::dummy_output_iterator, std::stack, std::deque, std::allocator > > >, std::vector, boost::vec_adj_list_vertex_id_map, long unsigned int>, boost::dfs_visitor<> > > >::value’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied, boost::edge_weight_t>, boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>, boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>, boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>, boost::graph_detail::dummy_output_iterator, std::stack, std::deque, std::allocator > > >, std::vector, boost::vec_adj_list_vertex_id_map, long unsigned int>, boost::dfs_visitor<> > > >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:72:8: [ skipping 12 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/biconnected_components.hpp:295:60: required from ‘static std::pair boost::detail::bicomp_dispatch2::apply(const Graph&, ComponentMap, OutputIterator, VertexIndexMap, DiscoverTimeMap, const boost::bgl_named_params&, boost::param_not_found) [with Graph = R_adjacency_list; ComponentMap = boost::adj_list_edge_property_map, boost::edge_weight_t>; OutputIterator = boost::graph_detail::dummy_output_iterator; VertexIndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>; DiscoverTimeMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>; P = int; T = boost::buffer_param_t; R = boost::no_property]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/biconnected_components.hpp:336:60: required from ‘static std::pair boost::detail::bicomp_dispatch1::apply(const Graph&, ComponentMap, OutputIterator, VertexIndexMap, const boost::bgl_named_params&, boost::param_not_found) [with Graph = R_adjacency_list; ComponentMap = boost::adj_list_edge_property_map, boost::edge_weight_t>; OutputIterator = boost::graph_detail::dummy_output_iterator; VertexIndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>; P = int; T = boost::buffer_param_t; R = boost::no_property]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/biconnected_components.hpp:368:60: required from ‘std::pair boost::biconnected_components(const Graph&, ComponentMap, OutputIterator, const bgl_named_params&) [with Graph = R_adjacency_list; ComponentMap = adj_list_edge_property_map, edge_weight_t>; OutputIterator = graph_detail::dummy_output_iterator; P = int; T = buffer_param_t; R = no_property]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/biconnected_components.hpp:377:34: required from ‘std::pair boost::biconnected_components(const Graph&, ComponentMap, OutputIterator) [with Graph = R_adjacency_list; ComponentMap = adj_list_edge_property_map, edge_weight_t>; OutputIterator = graph_detail::dummy_output_iterator]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/biconnected_components.hpp:417:34: required from ‘std::size_t boost::biconnected_components(const Graph&, ComponentMap) [with Graph = R_adjacency_list; ComponentMap = adj_list_edge_property_map, edge_weight_t>; std::size_t = long unsigned int]’ interfaces.cpp:264:47: required from here /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::CopyConstructible, boost::edge_weight_t>, boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>, boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>, boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>, boost::graph_detail::dummy_output_iterator, std::stack, std::deque, std::allocator > > >, std::vector, boost::vec_adj_list_vertex_id_map, long unsigned int>, boost::dfs_visitor<> > >]’ 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ^ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::CopyConstructibleConcept, boost::edge_weight_t>, boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>, boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>, boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>, boost::graph_detail::dummy_output_iterator, std::stack, std::deque, std::allocator > > >, std::vector, boost::vec_adj_list_vertex_id_map, long unsigned int>, boost::dfs_visitor<> > >]’: /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/depth_first_search.hpp:41:9: required from ‘void boost::DFSVisitorConcept::constraints() [with Visitor = boost::detail::biconnected_components_visitor, boost::edge_weight_t>, boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>, boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>, boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>, boost::graph_detail::dummy_output_iterator, std::stack, std::deque, std::allocator > > >, std::vector, boost::vec_adj_list_vertex_id_map, long unsigned int>, boost::dfs_visitor<> >; Graph = R_adjacency_list]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::DFSVisitorConcept, boost::edge_weight_t>, boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>, boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>, boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>, boost::graph_detail::dummy_output_iterator, std::stack, std::deque, std::allocator > > >, std::vector, boost::vec_adj_list_vertex_id_map, long unsigned int>, boost::dfs_visitor<> >, R_adjacency_list >]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied, boost::edge_weight_t>, boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>, boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>, boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>, boost::graph_detail::dummy_output_iterator, std::stack, std::deque, std::allocator > > >, std::vector, boost::vec_adj_list_vertex_id_map, long unsigned int>, boost::dfs_visitor<> >, R_adjacency_list > >::value’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied, boost::edge_weight_t>, boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>, boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>, boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>, boost::graph_detail::dummy_output_iterator, std::stack, std::deque, std::allocator > > >, std::vector, boost::vec_adj_list_vertex_id_map, long unsigned int>, boost::dfs_visitor<> >, R_adjacency_list > >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_, boost::edge_weight_t>, boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>, boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>, boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>, boost::graph_detail::dummy_output_iterator, std::stack, std::deque, std::allocator > > >, std::vector, boost::vec_adj_list_vertex_id_map, long unsigned int>, boost::dfs_visitor<> >, R_adjacency_list >)>’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/depth_first_search.hpp:130:9: [ skipping 6 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/biconnected_components.hpp:295:60: required from ‘static std::pair boost::detail::bicomp_dispatch2::apply(const Graph&, ComponentMap, OutputIterator, VertexIndexMap, DiscoverTimeMap, const boost::bgl_named_params&, boost::param_not_found) [with Graph = R_adjacency_list; ComponentMap = boost::adj_list_edge_property_map, boost::edge_weight_t>; OutputIterator = boost::graph_detail::dummy_output_iterator; VertexIndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>; DiscoverTimeMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>; P = int; T = boost::buffer_param_t; R = boost::no_property]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/biconnected_components.hpp:336:60: required from ‘static std::pair boost::detail::bicomp_dispatch1::apply(const Graph&, ComponentMap, OutputIterator, VertexIndexMap, const boost::bgl_named_params&, boost::param_not_found) [with Graph = R_adjacency_list; ComponentMap = boost::adj_list_edge_property_map, boost::edge_weight_t>; OutputIterator = boost::graph_detail::dummy_output_iterator; VertexIndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>; P = int; T = boost::buffer_param_t; R = boost::no_property]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/biconnected_components.hpp:368:60: required from ‘std::pair boost::biconnected_components(const Graph&, ComponentMap, OutputIterator, const bgl_named_params&) [with Graph = R_adjacency_list; ComponentMap = adj_list_edge_property_map, edge_weight_t>; OutputIterator = graph_detail::dummy_output_iterator; P = int; T = buffer_param_t; R = no_property]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/biconnected_components.hpp:377:34: required from ‘std::pair boost::biconnected_components(const Graph&, ComponentMap, OutputIterator) [with Graph = R_adjacency_list; ComponentMap = adj_list_edge_property_map, edge_weight_t>; OutputIterator = graph_detail::dummy_output_iterator]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/biconnected_components.hpp:417:34: required from ‘std::size_t boost::biconnected_components(const Graph&, ComponentMap) [with Graph = R_adjacency_list; ComponentMap = adj_list_edge_property_map, edge_weight_t>; std::size_t = long unsigned int]’ interfaces.cpp:264:47: required from here /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:165:17: note: in a call to non-static member function ‘boost::CopyConstructibleConcept, boost::edge_weight_t>, boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>, boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>, boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>, boost::graph_detail::dummy_output_iterator, std::stack, std::deque, std::allocator > > >, std::vector, boost::vec_adj_list_vertex_id_map, long unsigned int>, boost::dfs_visitor<> > >::~CopyConstructibleConcept()’ 165 | BOOST_concept(CopyConstructible,(TT)) | ^~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/preprocessor/cat.hpp:29:34: note: in definition of macro ‘BOOST_PP_CAT_I’ 29 | # define BOOST_PP_CAT_I(a, b) a ## b | ^ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/concept_def.hpp:23:12: note: in expansion of macro ‘BOOST_PP_CAT’ 23 | struct BOOST_PP_CAT(name,Concept) \ | ^~~~~~~~~~~~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:165:3: note: in expansion of macro ‘BOOST_concept’ 165 | BOOST_concept(CopyConstructible,(TT)) | ^~~~~~~~~~~~~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::CopyConstructible >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>, boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>, boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>, std::back_insert_iterator >, std::stack, std::deque, std::allocator > > >, std::vector, boost::vec_adj_list_vertex_id_map, long unsigned int>, boost::dfs_visitor<> > >]’: /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>, boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>, boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>, std::back_insert_iterator >, std::stack, std::deque, std::allocator > > >, std::vector, boost::vec_adj_list_vertex_id_map, long unsigned int>, boost::dfs_visitor<> > > >]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:167:5: required from ‘struct boost::CopyConstructible >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>, boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>, boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>, std::back_insert_iterator >, std::stack, std::deque, std::allocator > > >, std::vector, boost::vec_adj_list_vertex_id_map, long unsigned int>, boost::dfs_visitor<> > >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:165:3: required from ‘struct boost::CopyConstructibleConcept >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>, boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>, boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>, std::back_insert_iterator >, std::stack, std::deque, std::allocator > > >, std::vector, boost::vec_adj_list_vertex_id_map, long unsigned int>, boost::dfs_visitor<> > >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::CopyConstructibleConcept >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>, boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>, boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>, std::back_insert_iterator >, std::stack, std::deque, std::allocator > > >, std::vector, boost::vec_adj_list_vertex_id_map, long unsigned int>, boost::dfs_visitor<> > >]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>, boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>, boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>, std::back_insert_iterator >, std::stack, std::deque, std::allocator > > >, std::vector, boost::vec_adj_list_vertex_id_map, long unsigned int>, boost::dfs_visitor<> > > >::value’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:45:51: [ skipping 12 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/biconnected_components.hpp:250:47: required from ‘static std::pair boost::detail::bicomp_dispatch3::apply(const Graph&, ComponentMap, OutputIterator, VertexIndexMap, DiscoverTimeMap, LowPointMap, const boost::bgl_named_params&, boost::param_not_found) [with Graph = R_adjacency_list; ComponentMap = boost::dummy_property_map; OutputIterator = std::back_insert_iterator >; VertexIndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>; DiscoverTimeMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>; LowPointMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>; P = int; T = boost::buffer_param_t; R = boost::no_property]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/biconnected_components.hpp:295:60: required from ‘static std::pair boost::detail::bicomp_dispatch2::apply(const Graph&, ComponentMap, OutputIterator, VertexIndexMap, DiscoverTimeMap, const boost::bgl_named_params&, boost::param_not_found) [with Graph = R_adjacency_list; ComponentMap = boost::dummy_property_map; OutputIterator = std::back_insert_iterator >; VertexIndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>; DiscoverTimeMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>; P = int; T = boost::buffer_param_t; R = boost::no_property]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/biconnected_components.hpp:336:60: required from ‘static std::pair boost::detail::bicomp_dispatch1::apply(const Graph&, ComponentMap, OutputIterator, VertexIndexMap, const boost::bgl_named_params&, boost::param_not_found) [with Graph = R_adjacency_list; ComponentMap = boost::dummy_property_map; OutputIterator = std::back_insert_iterator >; VertexIndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>; P = int; T = boost::buffer_param_t; R = boost::no_property]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/biconnected_components.hpp:368:60: required from ‘std::pair boost::biconnected_components(const Graph&, ComponentMap, OutputIterator, const bgl_named_params&) [with Graph = R_adjacency_list; ComponentMap = dummy_property_map; OutputIterator = std::back_insert_iterator >; P = int; T = buffer_param_t; R = no_property]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/biconnected_components.hpp:433:34: required from ‘OutputIterator boost::articulation_points(const Graph&, OutputIterator) [with Graph = R_adjacency_list; OutputIterator = std::back_insert_iterator >]’ interfaces.cpp:300:28: required from here /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::CopyConstructible::~CopyConstructible() [with TT = boost::detail::biconnected_components_visitor >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>, boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>, boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>, std::back_insert_iterator >, std::stack, std::deque, std::allocator > > >, std::vector, boost::vec_adj_list_vertex_id_map, long unsigned int>, boost::dfs_visitor<> >]’ 37 | ~model() | ^ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:167:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 167 | BOOST_CONCEPT_USAGE(CopyConstructible) { | ^~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::Convertible, std::input_iterator_tag>]’: /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements, std::input_iterator_tag> >]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:208:5: required from ‘struct boost::Convertible, std::input_iterator_tag>’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::Convertible, std::input_iterator_tag>]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied, std::input_iterator_tag> >::value’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied, std::input_iterator_tag> >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:72:8: [ skipping 7 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/depth_first_search.hpp:129:9: required from ‘void boost::breadth_first_visit(const IncidenceGraph&, SourceIterator, SourceIterator, Buffer&, BFSVisitor, ColorMap) [with IncidenceGraph = filtered_graph > > >, no_property, listS>, is_residual_edge > > >, edge_residual_capacity_t> >, keep_all>; Buffer = queue > >; BFSVisitor = bfs_visitor*, on_tree_edge> >; ColorMap = default_color_type*; SourceIterator = long unsigned int*]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/breadth_first_search.hpp:136:24: required from ‘void boost::breadth_first_search(const VertexListGraph&, SourceIterator, SourceIterator, Buffer&, BFSVisitor, ColorMap) [with VertexListGraph = filtered_graph > > >, no_property, listS>, is_residual_edge > > >, edge_residual_capacity_t> >, keep_all>; SourceIterator = long unsigned int*; Buffer = queue > >; BFSVisitor = bfs_visitor*, on_tree_edge> >; ColorMap = default_color_type*]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/breadth_first_search.hpp:147:25: required from ‘void boost::breadth_first_search(const VertexListGraph&, typename graph_traits::vertex_descriptor, Buffer&, BFSVisitor, ColorMap) [with VertexListGraph = filtered_graph > > >, no_property, listS>, is_residual_edge > > >, edge_residual_capacity_t> >, keep_all>; Buffer = queue > >; BFSVisitor = bfs_visitor*, on_tree_edge> >; ColorMap = default_color_type*; typename graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/edmonds_karp_max_flow.hpp:101:29: required from ‘typename boost::property_traits::value_type boost::edmonds_karp_max_flow(Graph&, typename graph_traits::vertex_descriptor, typename graph_traits::vertex_descriptor, CapacityEdgeMap, ResidualCapacityEdgeMap, ReverseEdgeMap, ColorMap, PredEdgeMap) [with Graph = adjacency_list > > >, no_property, listS>; CapacityEdgeMap = adj_list_edge_property_map > > >, edge_capacity_t>; ResidualCapacityEdgeMap = adj_list_edge_property_map > > >, edge_residual_capacity_t>; ReverseEdgeMap = adj_list_edge_property_map, detail::edge_desc_impl&, long unsigned int, property > > >, edge_reverse_t>; ColorMap = default_color_type*; PredEdgeMap = detail::edge_desc_impl*; typename property_traits::value_type = long unsigned int; typename graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/edge_connectivity.hpp:145:42: required from ‘typename boost::graph_traits::degree_size_type boost::edge_connectivity(VertexListGraph&, OutputIterator) [with VertexListGraph = R_adjacency_list; OutputIterator = std::back_insert_iterator > >; typename graph_traits::degree_size_type = long unsigned int]’ interfaces.cpp:326:34: required from here /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::Convertible::~Convertible() [with X = boost::iterators::detail::iterator_category_with_traversal; Y = std::input_iterator_tag]’ 37 | ~model() | ^ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:208:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 208 | BOOST_CONCEPT_USAGE(Convertible) { | ^~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::CopyConstructible >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>, boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>, std::stack > > > >]’: /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>, boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>, std::stack > > > > >]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:167:5: required from ‘struct boost::CopyConstructible >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>, boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>, std::stack > > > >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:165:3: required from ‘struct boost::CopyConstructibleConcept >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>, boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>, std::stack > > > >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::CopyConstructibleConcept >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>, boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>, std::stack > > > >]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>, boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>, std::stack > > > > >::value’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:45:51: [ skipping 13 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/strong_components.hpp:177:63: required from ‘typename boost::property_traits::value_type boost::detail::scc_helper2(const Graph&, ComponentMap, RootMap, const boost::bgl_named_params&, DiscoverTimeMap) [with Graph = R_adjacency_list; ComponentMap = int*; RootMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>; P = int; T = int; R = boost::no_property; DiscoverTimeMap = boost::param_not_found; typename boost::property_traits::value_type = int]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/strong_components.hpp:205:31: required from ‘static typename boost::property_traits::value_type boost::detail::strong_comp_dispatch1::apply(const Graph&, ComponentMap, const boost::bgl_named_params&, boost::param_not_found) [with Graph = R_adjacency_list; ComponentMap = int*; P = int; T = int; R = boost::no_property; typename boost::property_traits::value_type = int]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/strong_components.hpp:220:63: required from ‘typename boost::property_traits::value_type boost::detail::scc_helper1(const Graph&, ComponentMap, const boost::bgl_named_params&, RootMap) [with Graph = R_adjacency_list; ComponentMap = int*; RootMap = boost::param_not_found; P = int; T = int; R = boost::no_property; typename boost::property_traits::value_type = int]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/strong_components.hpp:235:31: required from ‘typename boost::property_traits::value_type boost::strong_components(const Graph&, ComponentMap, const bgl_named_params&, typename enable_if_c::traversal_category>::value, graph::detail::no_parameter>::type) [with Graph = R_adjacency_list; ComponentMap = int*; P = int; T = int; R = no_property; typename property_traits::value_type = int; typename enable_if_c::traversal_category>::value, graph::detail::no_parameter>::type = graph::detail::no_parameter; typename graph_traits::traversal_category = adj_list_dir_traversal_tag]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/strong_components.hpp:249:29: required from ‘typename boost::property_traits::value_type boost::strong_components(const Graph&, ComponentMap, typename enable_if_c::traversal_category>::value, graph::detail::no_parameter>::type) [with Graph = R_adjacency_list; ComponentMap = int*; typename property_traits::value_type = int; typename enable_if_c::traversal_category>::value, graph::detail::no_parameter>::type = graph::detail::no_parameter; typename graph_traits::traversal_category = adj_list_dir_traversal_tag]’ interfaces.cpp:232:26: required from here /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::CopyConstructible::~CopyConstructible() [with TT = boost::detail::tarjan_scc_visitor >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>, boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>, std::stack > > >]’ 37 | ~model() | ^ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:167:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 167 | BOOST_CONCEPT_USAGE(CopyConstructible) { | ^~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::CopyConstructible, boost::edge_weight_t>, boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>, boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>, boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>, boost::graph_detail::dummy_output_iterator, std::stack, std::deque, std::allocator > > >, std::vector, boost::vec_adj_list_vertex_id_map, long unsigned int>, boost::dfs_visitor<> > >]’: /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements, boost::edge_weight_t>, boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>, boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>, boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>, boost::graph_detail::dummy_output_iterator, std::stack, std::deque, std::allocator > > >, std::vector, boost::vec_adj_list_vertex_id_map, long unsigned int>, boost::dfs_visitor<> > > >]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:167:5: required from ‘struct boost::CopyConstructible, boost::edge_weight_t>, boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>, boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>, boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>, boost::graph_detail::dummy_output_iterator, std::stack, std::deque, std::allocator > > >, std::vector, boost::vec_adj_list_vertex_id_map, long unsigned int>, boost::dfs_visitor<> > >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:165:3: required from ‘struct boost::CopyConstructibleConcept, boost::edge_weight_t>, boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>, boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>, boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>, boost::graph_detail::dummy_output_iterator, std::stack, std::deque, std::allocator > > >, std::vector, boost::vec_adj_list_vertex_id_map, long unsigned int>, boost::dfs_visitor<> > >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::CopyConstructibleConcept, boost::edge_weight_t>, boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>, boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>, boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>, boost::graph_detail::dummy_output_iterator, std::stack, std::deque, std::allocator > > >, std::vector, boost::vec_adj_list_vertex_id_map, long unsigned int>, boost::dfs_visitor<> > >]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied, boost::edge_weight_t>, boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>, boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>, boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>, boost::graph_detail::dummy_output_iterator, std::stack, std::deque, std::allocator > > >, std::vector, boost::vec_adj_list_vertex_id_map, long unsigned int>, boost::dfs_visitor<> > > >::value’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:45:51: [ skipping 13 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/biconnected_components.hpp:295:60: required from ‘static std::pair boost::detail::bicomp_dispatch2::apply(const Graph&, ComponentMap, OutputIterator, VertexIndexMap, DiscoverTimeMap, const boost::bgl_named_params&, boost::param_not_found) [with Graph = R_adjacency_list; ComponentMap = boost::adj_list_edge_property_map, boost::edge_weight_t>; OutputIterator = boost::graph_detail::dummy_output_iterator; VertexIndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>; DiscoverTimeMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>; P = int; T = boost::buffer_param_t; R = boost::no_property]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/biconnected_components.hpp:336:60: required from ‘static std::pair boost::detail::bicomp_dispatch1::apply(const Graph&, ComponentMap, OutputIterator, VertexIndexMap, const boost::bgl_named_params&, boost::param_not_found) [with Graph = R_adjacency_list; ComponentMap = boost::adj_list_edge_property_map, boost::edge_weight_t>; OutputIterator = boost::graph_detail::dummy_output_iterator; VertexIndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>; P = int; T = boost::buffer_param_t; R = boost::no_property]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/biconnected_components.hpp:368:60: required from ‘std::pair boost::biconnected_components(const Graph&, ComponentMap, OutputIterator, const bgl_named_params&) [with Graph = R_adjacency_list; ComponentMap = adj_list_edge_property_map, edge_weight_t>; OutputIterator = graph_detail::dummy_output_iterator; P = int; T = buffer_param_t; R = no_property]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/biconnected_components.hpp:377:34: required from ‘std::pair boost::biconnected_components(const Graph&, ComponentMap, OutputIterator) [with Graph = R_adjacency_list; ComponentMap = adj_list_edge_property_map, edge_weight_t>; OutputIterator = graph_detail::dummy_output_iterator]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/biconnected_components.hpp:417:34: required from ‘std::size_t boost::biconnected_components(const Graph&, ComponentMap) [with Graph = R_adjacency_list; ComponentMap = adj_list_edge_property_map, edge_weight_t>; std::size_t = long unsigned int]’ interfaces.cpp:264:47: required from here /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::CopyConstructible::~CopyConstructible() [with TT = boost::detail::biconnected_components_visitor, boost::edge_weight_t>, boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>, boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>, boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>, boost::graph_detail::dummy_output_iterator, std::stack, std::deque, std::allocator > > >, std::vector, boost::vec_adj_list_vertex_id_map, long unsigned int>, boost::dfs_visitor<> >]’ 37 | ~model() | ^ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:167:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 167 | BOOST_CONCEPT_USAGE(CopyConstructible) { | ^~~~~~~~~~~~~~~~~~~ g++ -std=gnu++17 -I"/usr/share/R/include" -DNDEBUG -I'/home/omnipath/local/R/4.4-3.20/BH/include' -fpic -g -O2 -fno-omit-frame-pointer -mno-omit-leaf-frame-pointer -ffile-prefix-map=/build/r-base-EawLoD/r-base-4.4.1=. -fstack-protector-strong -fstack-clash-protection -Wformat -Werror=format-security -fcf-protection -fdebug-prefix-map=/build/r-base-EawLoD/r-base-4.4.1=/usr/src/r-base-4.4.1-1.2404.0 -Wdate-time -D_FORTIFY_SOURCE=3 -c minST.cpp -o minST.o In file included from /home/omnipath/local/R/4.4-3.20/BH/include/boost/smart_ptr/shared_ptr.hpp:18, from /home/omnipath/local/R/4.4-3.20/BH/include/boost/property_map/vector_property_map.hpp:14, from /home/omnipath/local/R/4.4-3.20/BH/include/boost/property_map/property_map.hpp:598, from RBGL.hpp:17, from minST.cpp:1: /home/omnipath/local/R/4.4-3.20/BH/include/boost/smart_ptr/detail/shared_count.hpp:361:33: warning: ‘template class std::auto_ptr’ is deprecated: use 'std::unique_ptr' instead [-Wdeprecated-declarations] 361 | explicit shared_count( std::auto_ptr & r ): pi_( new sp_counted_impl_p( r.get() ) ) | ^~~~~~~~ In file included from /usr/include/c++/13/memory:78, from /home/omnipath/local/R/4.4-3.20/BH/include/boost/smart_ptr/detail/sp_counted_impl.hpp:35, from /home/omnipath/local/R/4.4-3.20/BH/include/boost/smart_ptr/detail/shared_count.hpp:27: /usr/include/c++/13/bits/unique_ptr.h:65:28: note: declared here 65 | template class auto_ptr; | ^~~~~~~~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/smart_ptr/shared_ptr.hpp:251:65: warning: ‘template class std::auto_ptr’ is deprecated: use 'std::unique_ptr' instead [-Wdeprecated-declarations] 251 | template< class T, class R > struct sp_enable_if_auto_ptr< std::auto_ptr< T >, R > | ^~~~~~~~ /usr/include/c++/13/bits/unique_ptr.h:65:28: note: declared here 65 | template class auto_ptr; | ^~~~~~~~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/smart_ptr/shared_ptr.hpp:508:31: warning: ‘template class std::auto_ptr’ is deprecated: use 'std::unique_ptr' instead [-Wdeprecated-declarations] 508 | explicit shared_ptr( std::auto_ptr & r ): px(r.get()), pn() | ^~~~~~~~ /usr/include/c++/13/bits/unique_ptr.h:65:28: note: declared here 65 | template class auto_ptr; | ^~~~~~~~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/smart_ptr/shared_ptr.hpp:521:22: warning: ‘template class std::auto_ptr’ is deprecated: use 'std::unique_ptr' instead [-Wdeprecated-declarations] 521 | shared_ptr( std::auto_ptr && r ): px(r.get()), pn() | ^~~~~~~~ /usr/include/c++/13/bits/unique_ptr.h:65:28: note: declared here 65 | template class auto_ptr; | ^~~~~~~~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/smart_ptr/shared_ptr.hpp:604:34: warning: ‘template class std::auto_ptr’ is deprecated: use 'std::unique_ptr' instead [-Wdeprecated-declarations] 604 | shared_ptr & operator=( std::auto_ptr & r ) | ^~~~~~~~ /usr/include/c++/13/bits/unique_ptr.h:65:28: note: declared here 65 | template class auto_ptr; | ^~~~~~~~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/smart_ptr/shared_ptr.hpp:613:34: warning: ‘template class std::auto_ptr’ is deprecated: use 'std::unique_ptr' instead [-Wdeprecated-declarations] 613 | shared_ptr & operator=( std::auto_ptr && r ) | ^~~~~~~~ /usr/include/c++/13/bits/unique_ptr.h:65:28: note: declared here 65 | template class auto_ptr; | ^~~~~~~~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/smart_ptr/shared_ptr.hpp: In member function ‘boost::shared_ptr& boost::shared_ptr::operator=(std::auto_ptr<_Up>&&)’: /home/omnipath/local/R/4.4-3.20/BH/include/boost/smart_ptr/shared_ptr.hpp:615:38: warning: ‘template class std::auto_ptr’ is deprecated: use 'std::unique_ptr' instead [-Wdeprecated-declarations] 615 | this_type( static_cast< std::auto_ptr && >( r ) ).swap( *this ); | ^~~~~~~~ /usr/include/c++/13/bits/unique_ptr.h:65:28: note: declared here 65 | template class auto_ptr; | ^~~~~~~~ In file included from /home/omnipath/local/R/4.4-3.20/BH/include/boost/scoped_ptr.hpp:13, from /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/adjacency_list.hpp:22, from RBGL.hpp:38: /home/omnipath/local/R/4.4-3.20/BH/include/boost/smart_ptr/scoped_ptr.hpp: At global scope: /home/omnipath/local/R/4.4-3.20/BH/include/boost/smart_ptr/scoped_ptr.hpp:75:31: warning: ‘template class std::auto_ptr’ is deprecated: use 'std::unique_ptr' instead [-Wdeprecated-declarations] 75 | explicit scoped_ptr( std::auto_ptr p ) BOOST_SP_NOEXCEPT : px( p.release() ) | ^~~~~~~~ /usr/include/c++/13/bits/unique_ptr.h:65:28: note: declared here 65 | template class auto_ptr; | ^~~~~~~~ In file included from /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/assert.hpp:35, from /home/omnipath/local/R/4.4-3.20/BH/include/boost/property_map/property_map.hpp:19: /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements > > >]’: /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:145:5: required from ‘struct boost::Assignable<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:502:3: required from ‘struct boost::InputIterator<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:540:3: required from ‘struct boost::ForwardIterator<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:568:3: required from ‘struct boost::BidirectionalIterator<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:597:3: required from ‘struct boost::RandomAccessIterator<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:597:3: [ skipping 2 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied > > >::value’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied > > >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_ > >)>’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/property_map/property_map.hpp:354:5: required from ‘boost::iterator_property_map boost::make_iterator_property_map(RAIter, ID, Value) [with RAIter = __gnu_cxx::__normal_iterator >; Value = long unsigned int; ID = vec_adj_list_vertex_id_map, long unsigned int>]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/kruskal_min_spanning_tree.hpp:113:35: required from ‘void boost::kruskal_minimum_spanning_tree(const Graph&, OutputIterator) [with Graph = R_adjacency_list; OutputIterator = std::back_insert_iterator > >]’ minST.cpp:20:38: required from here /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ In file included from /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:31, from /home/omnipath/local/R/4.4-3.20/BH/include/boost/property_map/property_map.hpp:20: /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::Assignable<__gnu_cxx::__normal_iterator > >]’ 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ^ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements > > >]’: /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:233:5: required from ‘struct boost::EqualityComparable<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:502:3: required from ‘struct boost::InputIterator<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:540:3: required from ‘struct boost::ForwardIterator<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:568:3: required from ‘struct boost::BidirectionalIterator<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:597:3: required from ‘struct boost::RandomAccessIterator<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:597:3: [ skipping 2 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied > > >::value’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied > > >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_ > >)>’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/property_map/property_map.hpp:354:5: required from ‘boost::iterator_property_map boost::make_iterator_property_map(RAIter, ID, Value) [with RAIter = __gnu_cxx::__normal_iterator >; Value = long unsigned int; ID = vec_adj_list_vertex_id_map, long unsigned int>]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/kruskal_min_spanning_tree.hpp:113:35: required from ‘void boost::kruskal_minimum_spanning_tree(const Graph&, OutputIterator) [with Graph = R_adjacency_list; OutputIterator = std::back_insert_iterator > >]’ minST.cpp:20:38: required from here /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::EqualityComparable<__gnu_cxx::__normal_iterator > >]’ 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ^ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements > > >]’: /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:512:7: required from ‘struct boost::InputIterator<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:540:3: required from ‘struct boost::ForwardIterator<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:568:3: required from ‘struct boost::BidirectionalIterator<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:597:3: required from ‘struct boost::RandomAccessIterator<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:597:3: [ skipping 2 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied > > >::value’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied > > >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_ > >)>’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/property_map/property_map.hpp:354:5: required from ‘boost::iterator_property_map boost::make_iterator_property_map(RAIter, ID, Value) [with RAIter = __gnu_cxx::__normal_iterator >; Value = long unsigned int; ID = vec_adj_list_vertex_id_map, long unsigned int>]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/kruskal_min_spanning_tree.hpp:113:35: required from ‘void boost::kruskal_minimum_spanning_tree(const Graph&, OutputIterator) [with Graph = R_adjacency_list; OutputIterator = std::back_insert_iterator > >]’ minST.cpp:20:38: required from here /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::InputIterator<__gnu_cxx::__normal_iterator > >]’ 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ^ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements > > >]’: /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:543:7: required from ‘struct boost::ForwardIterator<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:568:3: required from ‘struct boost::BidirectionalIterator<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:597:3: required from ‘struct boost::RandomAccessIterator<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:597:3: required from ‘struct boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator > >]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied > > >::value’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied > > >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_ > >)>’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/property_map/property_map.hpp:354:5: required from ‘boost::iterator_property_map boost::make_iterator_property_map(RAIter, ID, Value) [with RAIter = __gnu_cxx::__normal_iterator >; Value = long unsigned int; ID = vec_adj_list_vertex_id_map, long unsigned int>]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/kruskal_min_spanning_tree.hpp:113:35: required from ‘void boost::kruskal_minimum_spanning_tree(const Graph&, OutputIterator) [with Graph = R_adjacency_list; OutputIterator = std::back_insert_iterator > >]’ minST.cpp:20:38: required from here /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::ForwardIterator<__gnu_cxx::__normal_iterator > >]’ 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ^ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements > > >]’: /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:571:7: required from ‘struct boost::BidirectionalIterator<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:597:3: required from ‘struct boost::RandomAccessIterator<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:597:3: required from ‘struct boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator > >]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied > > >::value’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied > > >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_ > >)>’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/property_map/property_map.hpp:354:5: required from ‘boost::iterator_property_map boost::make_iterator_property_map(RAIter, ID, Value) [with RAIter = __gnu_cxx::__normal_iterator >; Value = long unsigned int; ID = vec_adj_list_vertex_id_map, long unsigned int>]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/kruskal_min_spanning_tree.hpp:113:35: required from ‘void boost::kruskal_minimum_spanning_tree(const Graph&, OutputIterator) [with Graph = R_adjacency_list; OutputIterator = std::back_insert_iterator > >]’ minST.cpp:20:38: required from here /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::BidirectionalIterator<__gnu_cxx::__normal_iterator > >]’ 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ^ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements > > >]’: /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:253:5: required from ‘struct boost::Comparable<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:597:3: required from ‘struct boost::RandomAccessIterator<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:597:3: required from ‘struct boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator > >]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied > > >::value’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied > > >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_ > >)>’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/property_map/property_map.hpp:354:5: required from ‘boost::iterator_property_map boost::make_iterator_property_map(RAIter, ID, Value) [with RAIter = __gnu_cxx::__normal_iterator >; Value = long unsigned int; ID = vec_adj_list_vertex_id_map, long unsigned int>]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/kruskal_min_spanning_tree.hpp:113:35: required from ‘void boost::kruskal_minimum_spanning_tree(const Graph&, OutputIterator) [with Graph = R_adjacency_list; OutputIterator = std::back_insert_iterator > >]’ minST.cpp:20:38: required from here /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::Comparable<__gnu_cxx::__normal_iterator > >]’ 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ^ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements > > >]’: /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:601:7: required from ‘struct boost::RandomAccessIterator<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:597:3: required from ‘struct boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator > >]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied > > >::value’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied > > >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_ > >)>’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/property_map/property_map.hpp:354:5: required from ‘boost::iterator_property_map boost::make_iterator_property_map(RAIter, ID, Value) [with RAIter = __gnu_cxx::__normal_iterator >; Value = long unsigned int; ID = vec_adj_list_vertex_id_map, long unsigned int>]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/kruskal_min_spanning_tree.hpp:113:35: required from ‘void boost::kruskal_minimum_spanning_tree(const Graph&, OutputIterator) [with Graph = R_adjacency_list; OutputIterator = std::back_insert_iterator > >]’ minST.cpp:20:38: required from here /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::RandomAccessIterator<__gnu_cxx::__normal_iterator > >]’ 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ^ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator > >]’: /home/omnipath/local/R/4.4-3.20/BH/include/boost/property_map/property_map.hpp:354:5: required from ‘boost::iterator_property_map boost::make_iterator_property_map(RAIter, ID, Value) [with RAIter = __gnu_cxx::__normal_iterator >; Value = long unsigned int; ID = vec_adj_list_vertex_id_map, long unsigned int>]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/kruskal_min_spanning_tree.hpp:113:35: required from ‘void boost::kruskal_minimum_spanning_tree(const Graph&, OutputIterator) [with Graph = R_adjacency_list; OutputIterator = std::back_insert_iterator > >]’ minST.cpp:20:38: required from here /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ In file included from /home/omnipath/local/R/4.4-3.20/BH/include/boost/preprocessor/repetition/enum_binary_params.hpp:15, from /home/omnipath/local/R/4.4-3.20/BH/include/boost/utility/base_from_member.hpp:15, from /home/omnipath/local/R/4.4-3.20/BH/include/boost/utility.hpp:15, from RBGL.hpp:16: /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:597:17: note: in a call to non-static member function ‘boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator > >::~RandomAccessIteratorConcept()’ 597 | BOOST_concept(RandomAccessIterator,(TT)) | ^~~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/preprocessor/cat.hpp:29:34: note: in definition of macro ‘BOOST_PP_CAT_I’ 29 | # define BOOST_PP_CAT_I(a, b) a ## b | ^ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/concept_def.hpp:23:12: note: in expansion of macro ‘BOOST_PP_CAT’ 23 | struct BOOST_PP_CAT(name,Concept) \ | ^~~~~~~~~~~~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:597:3: note: in expansion of macro ‘BOOST_concept’ 597 | BOOST_concept(RandomAccessIterator,(TT)) | ^~~~~~~~~~~~~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements > >]’: /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/graph_concepts.hpp:66:5: required from ‘struct boost::concepts::Graph >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/graph_concepts.hpp:176:1: required from ‘struct boost::concepts::VertexListGraph >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/graph_concepts.hpp:176:1: required from ‘struct boost::concepts::VertexListGraphConcept >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::concepts::VertexListGraphConcept >]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied > >::value’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied > >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_ >)>’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/kruskal_min_spanning_tree.hpp:55:9: required from ‘void boost::detail::kruskal_mst_impl(const Graph&, OutputIterator, Rank, Parent, Weight) [with Graph = R_adjacency_list; OutputIterator = std::back_insert_iterator > >; Rank = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>; Parent = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>; Weight = boost::adj_list_edge_property_map, boost::edge_weight_t>]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/kruskal_min_spanning_tree.hpp:112:29: required from ‘void boost::kruskal_minimum_spanning_tree(const Graph&, OutputIterator) [with Graph = R_adjacency_list; OutputIterator = std::back_insert_iterator > >]’ minST.cpp:20:38: required from here /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::concepts::Graph >]’ 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ^ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements > >]’: /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/graph_concepts.hpp:182:5: required from ‘struct boost::concepts::VertexListGraph >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/graph_concepts.hpp:176:1: required from ‘struct boost::concepts::VertexListGraphConcept >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::concepts::VertexListGraphConcept >]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied > >::value’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied > >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_ >)>’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/kruskal_min_spanning_tree.hpp:55:9: required from ‘void boost::detail::kruskal_mst_impl(const Graph&, OutputIterator, Rank, Parent, Weight) [with Graph = R_adjacency_list; OutputIterator = std::back_insert_iterator > >; Rank = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>; Parent = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>; Weight = boost::adj_list_edge_property_map, boost::edge_weight_t>]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/kruskal_min_spanning_tree.hpp:112:29: required from ‘void boost::kruskal_minimum_spanning_tree(const Graph&, OutputIterator) [with Graph = R_adjacency_list; OutputIterator = std::back_insert_iterator > >]’ minST.cpp:20:38: required from here /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::concepts::VertexListGraph >]’ 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ^ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::VertexListGraphConcept >]’: /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/kruskal_min_spanning_tree.hpp:55:9: required from ‘void boost::detail::kruskal_mst_impl(const Graph&, OutputIterator, Rank, Parent, Weight) [with Graph = R_adjacency_list; OutputIterator = std::back_insert_iterator > >; Rank = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>; Parent = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>; Weight = boost::adj_list_edge_property_map, boost::edge_weight_t>]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/kruskal_min_spanning_tree.hpp:112:29: required from ‘void boost::kruskal_minimum_spanning_tree(const Graph&, OutputIterator) [with Graph = R_adjacency_list; OutputIterator = std::back_insert_iterator > >]’ minST.cpp:20:38: required from here /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/graph_concepts.hpp:176:15: note: in a call to non-static member function ‘boost::concepts::VertexListGraphConcept >::~VertexListGraphConcept()’ 176 | BOOST_concept(VertexListGraph, (G)) : Graph< G > | ^~~~~~~~~~~~~~~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/preprocessor/cat.hpp:29:34: note: in definition of macro ‘BOOST_PP_CAT_I’ 29 | # define BOOST_PP_CAT_I(a, b) a ## b | ^ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/concept_def.hpp:23:12: note: in expansion of macro ‘BOOST_PP_CAT’ 23 | struct BOOST_PP_CAT(name,Concept) \ | ^~~~~~~~~~~~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/graph_concepts.hpp:176:1: note: in expansion of macro ‘BOOST_concept’ 176 | BOOST_concept(VertexListGraph, (G)) : Graph< G > | ^~~~~~~~~~~~~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements > >]’: /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/graph_concepts.hpp:233:5: required from ‘struct boost::concepts::EdgeListGraph >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/graph_concepts.hpp:226:1: required from ‘struct boost::concepts::EdgeListGraphConcept >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::concepts::EdgeListGraphConcept >]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied > >::value’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied > >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_ >)>’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/kruskal_min_spanning_tree.hpp:56:9: required from ‘void boost::detail::kruskal_mst_impl(const Graph&, OutputIterator, Rank, Parent, Weight) [with Graph = R_adjacency_list; OutputIterator = std::back_insert_iterator > >; Rank = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>; Parent = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>; Weight = boost::adj_list_edge_property_map, boost::edge_weight_t>]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/kruskal_min_spanning_tree.hpp:112:29: required from ‘void boost::kruskal_minimum_spanning_tree(const Graph&, OutputIterator) [with Graph = R_adjacency_list; OutputIterator = std::back_insert_iterator > >]’ minST.cpp:20:38: required from here /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::concepts::EdgeListGraph >]’ 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ^ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::EdgeListGraphConcept >]’: /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/kruskal_min_spanning_tree.hpp:56:9: required from ‘void boost::detail::kruskal_mst_impl(const Graph&, OutputIterator, Rank, Parent, Weight) [with Graph = R_adjacency_list; OutputIterator = std::back_insert_iterator > >; Rank = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>; Parent = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>; Weight = boost::adj_list_edge_property_map, boost::edge_weight_t>]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/kruskal_min_spanning_tree.hpp:112:29: required from ‘void boost::kruskal_minimum_spanning_tree(const Graph&, OutputIterator) [with Graph = R_adjacency_list; OutputIterator = std::back_insert_iterator > >]’ minST.cpp:20:38: required from here /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/graph_concepts.hpp:226:15: note: in a call to non-static member function ‘boost::concepts::EdgeListGraphConcept >::~EdgeListGraphConcept()’ 226 | BOOST_concept(EdgeListGraph, (G)) : Graph< G > | ^~~~~~~~~~~~~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/preprocessor/cat.hpp:29:34: note: in definition of macro ‘BOOST_PP_CAT_I’ 29 | # define BOOST_PP_CAT_I(a, b) a ## b | ^ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/concept_def.hpp:23:12: note: in expansion of macro ‘BOOST_PP_CAT’ 23 | struct BOOST_PP_CAT(name,Concept) \ | ^~~~~~~~~~~~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/graph_concepts.hpp:226:1: note: in expansion of macro ‘BOOST_concept’ 226 | BOOST_concept(EdgeListGraph, (G)) : Graph< G > | ^~~~~~~~~~~~~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements > > > >]’: /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:145:5: required from ‘struct boost::Assignable > > >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:526:3: required from ‘struct boost::OutputIterator > >, boost::detail::edge_desc_impl >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:526:3: required from ‘struct boost::OutputIteratorConcept > >, boost::detail::edge_desc_impl >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::OutputIteratorConcept > >, boost::detail::edge_desc_impl >]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied > >, boost::detail::edge_desc_impl > >::value’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied > >, boost::detail::edge_desc_impl > >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_ > >, boost::detail::edge_desc_impl >)>’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/kruskal_min_spanning_tree.hpp:57:9: required from ‘void boost::detail::kruskal_mst_impl(const Graph&, OutputIterator, Rank, Parent, Weight) [with Graph = R_adjacency_list; OutputIterator = std::back_insert_iterator > >; Rank = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>; Parent = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>; Weight = boost::adj_list_edge_property_map, boost::edge_weight_t>]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/kruskal_min_spanning_tree.hpp:112:29: required from ‘void boost::kruskal_minimum_spanning_tree(const Graph&, OutputIterator) [with Graph = R_adjacency_list; OutputIterator = std::back_insert_iterator > >]’ minST.cpp:20:38: required from here /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::Assignable > > >]’ 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ^ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements > >, boost::detail::edge_desc_impl > >]’: /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:529:5: required from ‘struct boost::OutputIterator > >, boost::detail::edge_desc_impl >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:526:3: required from ‘struct boost::OutputIteratorConcept > >, boost::detail::edge_desc_impl >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::OutputIteratorConcept > >, boost::detail::edge_desc_impl >]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied > >, boost::detail::edge_desc_impl > >::value’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied > >, boost::detail::edge_desc_impl > >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_ > >, boost::detail::edge_desc_impl >)>’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/kruskal_min_spanning_tree.hpp:57:9: required from ‘void boost::detail::kruskal_mst_impl(const Graph&, OutputIterator, Rank, Parent, Weight) [with Graph = R_adjacency_list; OutputIterator = std::back_insert_iterator > >; Rank = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>; Parent = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>; Weight = boost::adj_list_edge_property_map, boost::edge_weight_t>]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/kruskal_min_spanning_tree.hpp:112:29: required from ‘void boost::kruskal_minimum_spanning_tree(const Graph&, OutputIterator) [with Graph = R_adjacency_list; OutputIterator = std::back_insert_iterator > >]’ minST.cpp:20:38: required from here /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::OutputIterator > >, boost::detail::edge_desc_impl >]’ 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ^ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::OutputIteratorConcept > >, boost::detail::edge_desc_impl >]’: /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/kruskal_min_spanning_tree.hpp:57:9: required from ‘void boost::detail::kruskal_mst_impl(const Graph&, OutputIterator, Rank, Parent, Weight) [with Graph = R_adjacency_list; OutputIterator = std::back_insert_iterator > >; Rank = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>; Parent = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>; Weight = boost::adj_list_edge_property_map, boost::edge_weight_t>]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/kruskal_min_spanning_tree.hpp:112:29: required from ‘void boost::kruskal_minimum_spanning_tree(const Graph&, OutputIterator) [with Graph = R_adjacency_list; OutputIterator = std::back_insert_iterator > >]’ minST.cpp:20:38: required from here /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:526:17: note: in a call to non-static member function ‘boost::OutputIteratorConcept > >, boost::detail::edge_desc_impl >::~OutputIteratorConcept()’ 526 | BOOST_concept(OutputIterator,(TT)(ValueT)) | ^~~~~~~~~~~~~~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/preprocessor/cat.hpp:29:34: note: in definition of macro ‘BOOST_PP_CAT_I’ 29 | # define BOOST_PP_CAT_I(a, b) a ## b | ^ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/concept_def.hpp:23:12: note: in expansion of macro ‘BOOST_PP_CAT’ 23 | struct BOOST_PP_CAT(name,Concept) \ | ^~~~~~~~~~~~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:526:3: note: in expansion of macro ‘BOOST_concept’ 526 | BOOST_concept(OutputIterator,(TT)(ValueT)) | ^~~~~~~~~~~~~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::constraint::failed() [with Model = boost::ReadWritePropertyMapConcept >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>, long unsigned int>]’: /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/kruskal_min_spanning_tree.hpp:58:9: required from ‘void boost::detail::kruskal_mst_impl(const Graph&, OutputIterator, Rank, Parent, Weight) [with Graph = R_adjacency_list; OutputIterator = std::back_insert_iterator > >; Rank = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>; Parent = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>; Weight = boost::adj_list_edge_property_map, boost::edge_weight_t>]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/kruskal_min_spanning_tree.hpp:112:29: required from ‘void boost::kruskal_minimum_spanning_tree(const Graph&, OutputIterator) [with Graph = R_adjacency_list; OutputIterator = std::back_insert_iterator > >]’ minST.cpp:20:38: required from here /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:65:52: warning: ‘this’ pointer is null [-Wnonnull] 65 | static void failed() { ((Model*)0)->constraints(); } | ~~~~~~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/property_map/property_map.hpp:205:10: note: in a call to non-static member function ‘void boost::ReadWritePropertyMapConcept::constraints() [with PMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>; Key = long unsigned int]’ 205 | void constraints() { | ^~~~~~~~~~~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::constraint::failed() [with Model = boost::ReadablePropertyMapConcept, boost::edge_weight_t>, boost::detail::edge_desc_impl >]’: /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/kruskal_min_spanning_tree.hpp:60:9: required from ‘void boost::detail::kruskal_mst_impl(const Graph&, OutputIterator, Rank, Parent, Weight) [with Graph = R_adjacency_list; OutputIterator = std::back_insert_iterator > >; Rank = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>; Parent = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>; Weight = boost::adj_list_edge_property_map, boost::edge_weight_t>]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/kruskal_min_spanning_tree.hpp:112:29: required from ‘void boost::kruskal_minimum_spanning_tree(const Graph&, OutputIterator) [with Graph = R_adjacency_list; OutputIterator = std::back_insert_iterator > >]’ minST.cpp:20:38: required from here /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:65:52: warning: ‘this’ pointer is null [-Wnonnull] 65 | static void failed() { ((Model*)0)->constraints(); } | ~~~~~~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/property_map/property_map.hpp:147:10: note: in a call to non-static member function ‘void boost::ReadablePropertyMapConcept::constraints() [with PMap = boost::adj_list_edge_property_map, boost::edge_weight_t>; Key = boost::detail::edge_desc_impl]’ 147 | void constraints() { | ^~~~~~~~~~~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements >]’: /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:253:5: required from ‘struct boost::Comparable’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:251:3: required from ‘struct boost::ComparableConcept’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::ComparableConcept]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied >::value’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_)>’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/kruskal_min_spanning_tree.hpp:64:9: required from ‘void boost::detail::kruskal_mst_impl(const Graph&, OutputIterator, Rank, Parent, Weight) [with Graph = R_adjacency_list; OutputIterator = std::back_insert_iterator > >; Rank = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>; Parent = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>; Weight = boost::adj_list_edge_property_map, boost::edge_weight_t>]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/kruskal_min_spanning_tree.hpp:112:29: required from ‘void boost::kruskal_minimum_spanning_tree(const Graph&, OutputIterator) [with Graph = R_adjacency_list; OutputIterator = std::back_insert_iterator > >]’ minST.cpp:20:38: required from here /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::Comparable]’ 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ^ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::ComparableConcept]’: /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/kruskal_min_spanning_tree.hpp:64:9: required from ‘void boost::detail::kruskal_mst_impl(const Graph&, OutputIterator, Rank, Parent, Weight) [with Graph = R_adjacency_list; OutputIterator = std::back_insert_iterator > >; Rank = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>; Parent = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>; Weight = boost::adj_list_edge_property_map, boost::edge_weight_t>]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/kruskal_min_spanning_tree.hpp:112:29: required from ‘void boost::kruskal_minimum_spanning_tree(const Graph&, OutputIterator) [with Graph = R_adjacency_list; OutputIterator = std::back_insert_iterator > >]’ minST.cpp:20:38: required from here /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:251:17: note: in a call to non-static member function ‘boost::ComparableConcept::~ComparableConcept()’ 251 | BOOST_concept(Comparable,(TT)) | ^~~~~~~~~~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/preprocessor/cat.hpp:29:34: note: in definition of macro ‘BOOST_PP_CAT_I’ 29 | # define BOOST_PP_CAT_I(a, b) a ## b | ^ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/concept_def.hpp:23:12: note: in expansion of macro ‘BOOST_PP_CAT’ 23 | struct BOOST_PP_CAT(name,Concept) \ | ^~~~~~~~~~~~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:251:3: note: in expansion of macro ‘BOOST_concept’ 251 | BOOST_concept(Comparable,(TT)) | ^~~~~~~~~~~~~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements >]’: /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:208:5: required from ‘struct boost::Convertible’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:206:3: required from ‘struct boost::ConvertibleConcept’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::ConvertibleConcept]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied >::value’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_)>’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/kruskal_min_spanning_tree.hpp:65:9: required from ‘void boost::detail::kruskal_mst_impl(const Graph&, OutputIterator, Rank, Parent, Weight) [with Graph = R_adjacency_list; OutputIterator = std::back_insert_iterator > >; Rank = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>; Parent = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>; Weight = boost::adj_list_edge_property_map, boost::edge_weight_t>]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/kruskal_min_spanning_tree.hpp:112:29: required from ‘void boost::kruskal_minimum_spanning_tree(const Graph&, OutputIterator) [with Graph = R_adjacency_list; OutputIterator = std::back_insert_iterator > >]’ minST.cpp:20:38: required from here /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::Convertible]’ 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ^ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::ConvertibleConcept]’: /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/kruskal_min_spanning_tree.hpp:65:9: required from ‘void boost::detail::kruskal_mst_impl(const Graph&, OutputIterator, Rank, Parent, Weight) [with Graph = R_adjacency_list; OutputIterator = std::back_insert_iterator > >; Rank = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>; Parent = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>; Weight = boost::adj_list_edge_property_map, boost::edge_weight_t>]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/kruskal_min_spanning_tree.hpp:112:29: required from ‘void boost::kruskal_minimum_spanning_tree(const Graph&, OutputIterator) [with Graph = R_adjacency_list; OutputIterator = std::back_insert_iterator > >]’ minST.cpp:20:38: required from here /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:206:17: note: in a call to non-static member function ‘boost::ConvertibleConcept::~ConvertibleConcept()’ 206 | BOOST_concept(Convertible,(X)(Y)) | ^~~~~~~~~~~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/preprocessor/cat.hpp:29:34: note: in definition of macro ‘BOOST_PP_CAT_I’ 29 | # define BOOST_PP_CAT_I(a, b) a ## b | ^ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/concept_def.hpp:23:12: note: in expansion of macro ‘BOOST_PP_CAT’ 23 | struct BOOST_PP_CAT(name,Concept) \ | ^~~~~~~~~~~~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:206:3: note: in expansion of macro ‘BOOST_concept’ 206 | BOOST_concept(Convertible,(X)(Y)) | ^~~~~~~~~~~~~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::IntegerConcept]’: /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/kruskal_min_spanning_tree.hpp:66:9: required from ‘void boost::detail::kruskal_mst_impl(const Graph&, OutputIterator, Rank, Parent, Weight) [with Graph = R_adjacency_list; OutputIterator = std::back_insert_iterator > >; Rank = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>; Parent = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>; Weight = boost::adj_list_edge_property_map, boost::edge_weight_t>]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/kruskal_min_spanning_tree.hpp:112:29: required from ‘void boost::kruskal_minimum_spanning_tree(const Graph&, OutputIterator) [with Graph = R_adjacency_list; OutputIterator = std::back_insert_iterator > >]’ minST.cpp:20:38: required from here /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:70:17: note: in a call to non-static member function ‘boost::IntegerConcept::~IntegerConcept()’ 70 | BOOST_concept(Integer, (T)) | ^~~~~~~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/preprocessor/cat.hpp:29:34: note: in definition of macro ‘BOOST_PP_CAT_I’ 29 | # define BOOST_PP_CAT_I(a, b) a ## b | ^ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/concept_def.hpp:23:12: note: in expansion of macro ‘BOOST_PP_CAT’ 23 | struct BOOST_PP_CAT(name,Concept) \ | ^~~~~~~~~~~~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:70:3: note: in expansion of macro ‘BOOST_concept’ 70 | BOOST_concept(Integer, (T)) | ^~~~~~~~~~~~~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements > >]’: /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/graph_concepts.hpp:66:5: required from ‘struct boost::concepts::Graph >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/graph_concepts.hpp:176:1: required from ‘struct boost::concepts::VertexListGraph >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/graph_concepts.hpp:176:1: required from ‘struct boost::concepts::VertexListGraphConcept >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::concepts::VertexListGraphConcept >]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied > >::value’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied > >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_ >)>’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/kruskal_min_spanning_tree.hpp:55:9: required from ‘void boost::detail::kruskal_mst_impl(const Graph&, OutputIterator, Rank, Parent, Weight) [with Graph = R_adjacency_list; OutputIterator = std::back_insert_iterator > >; Rank = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>; Parent = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>; Weight = boost::adj_list_edge_property_map, boost::edge_weight_t>]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/kruskal_min_spanning_tree.hpp:112:29: required from ‘void boost::kruskal_minimum_spanning_tree(const Graph&, OutputIterator) [with Graph = R_adjacency_list; OutputIterator = std::back_insert_iterator > >]’ minST.cpp:54:38: required from here /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::concepts::Graph >]’ 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ^ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements > >]’: /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/graph_concepts.hpp:182:5: required from ‘struct boost::concepts::VertexListGraph >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/graph_concepts.hpp:176:1: required from ‘struct boost::concepts::VertexListGraphConcept >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::concepts::VertexListGraphConcept >]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied > >::value’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied > >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_ >)>’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/kruskal_min_spanning_tree.hpp:55:9: required from ‘void boost::detail::kruskal_mst_impl(const Graph&, OutputIterator, Rank, Parent, Weight) [with Graph = R_adjacency_list; OutputIterator = std::back_insert_iterator > >; Rank = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>; Parent = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>; Weight = boost::adj_list_edge_property_map, boost::edge_weight_t>]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/kruskal_min_spanning_tree.hpp:112:29: required from ‘void boost::kruskal_minimum_spanning_tree(const Graph&, OutputIterator) [with Graph = R_adjacency_list; OutputIterator = std::back_insert_iterator > >]’ minST.cpp:54:38: required from here /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::concepts::VertexListGraph >]’ 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ^ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::VertexListGraphConcept >]’: /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/kruskal_min_spanning_tree.hpp:55:9: required from ‘void boost::detail::kruskal_mst_impl(const Graph&, OutputIterator, Rank, Parent, Weight) [with Graph = R_adjacency_list; OutputIterator = std::back_insert_iterator > >; Rank = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>; Parent = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>; Weight = boost::adj_list_edge_property_map, boost::edge_weight_t>]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/kruskal_min_spanning_tree.hpp:112:29: required from ‘void boost::kruskal_minimum_spanning_tree(const Graph&, OutputIterator) [with Graph = R_adjacency_list; OutputIterator = std::back_insert_iterator > >]’ minST.cpp:54:38: required from here /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/graph_concepts.hpp:176:15: note: in a call to non-static member function ‘boost::concepts::VertexListGraphConcept >::~VertexListGraphConcept()’ 176 | BOOST_concept(VertexListGraph, (G)) : Graph< G > | ^~~~~~~~~~~~~~~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/preprocessor/cat.hpp:29:34: note: in definition of macro ‘BOOST_PP_CAT_I’ 29 | # define BOOST_PP_CAT_I(a, b) a ## b | ^ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/concept_def.hpp:23:12: note: in expansion of macro ‘BOOST_PP_CAT’ 23 | struct BOOST_PP_CAT(name,Concept) \ | ^~~~~~~~~~~~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/graph_concepts.hpp:176:1: note: in expansion of macro ‘BOOST_concept’ 176 | BOOST_concept(VertexListGraph, (G)) : Graph< G > | ^~~~~~~~~~~~~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements > >]’: /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/graph_concepts.hpp:233:5: required from ‘struct boost::concepts::EdgeListGraph >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/graph_concepts.hpp:226:1: required from ‘struct boost::concepts::EdgeListGraphConcept >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::concepts::EdgeListGraphConcept >]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied > >::value’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied > >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_ >)>’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/kruskal_min_spanning_tree.hpp:56:9: required from ‘void boost::detail::kruskal_mst_impl(const Graph&, OutputIterator, Rank, Parent, Weight) [with Graph = R_adjacency_list; OutputIterator = std::back_insert_iterator > >; Rank = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>; Parent = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>; Weight = boost::adj_list_edge_property_map, boost::edge_weight_t>]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/kruskal_min_spanning_tree.hpp:112:29: required from ‘void boost::kruskal_minimum_spanning_tree(const Graph&, OutputIterator) [with Graph = R_adjacency_list; OutputIterator = std::back_insert_iterator > >]’ minST.cpp:54:38: required from here /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::concepts::EdgeListGraph >]’ 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ^ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::EdgeListGraphConcept >]’: /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/kruskal_min_spanning_tree.hpp:56:9: required from ‘void boost::detail::kruskal_mst_impl(const Graph&, OutputIterator, Rank, Parent, Weight) [with Graph = R_adjacency_list; OutputIterator = std::back_insert_iterator > >; Rank = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>; Parent = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>; Weight = boost::adj_list_edge_property_map, boost::edge_weight_t>]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/kruskal_min_spanning_tree.hpp:112:29: required from ‘void boost::kruskal_minimum_spanning_tree(const Graph&, OutputIterator) [with Graph = R_adjacency_list; OutputIterator = std::back_insert_iterator > >]’ minST.cpp:54:38: required from here /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/graph_concepts.hpp:226:15: note: in a call to non-static member function ‘boost::concepts::EdgeListGraphConcept >::~EdgeListGraphConcept()’ 226 | BOOST_concept(EdgeListGraph, (G)) : Graph< G > | ^~~~~~~~~~~~~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/preprocessor/cat.hpp:29:34: note: in definition of macro ‘BOOST_PP_CAT_I’ 29 | # define BOOST_PP_CAT_I(a, b) a ## b | ^ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/concept_def.hpp:23:12: note: in expansion of macro ‘BOOST_PP_CAT’ 23 | struct BOOST_PP_CAT(name,Concept) \ | ^~~~~~~~~~~~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/graph_concepts.hpp:226:1: note: in expansion of macro ‘BOOST_concept’ 226 | BOOST_concept(EdgeListGraph, (G)) : Graph< G > | ^~~~~~~~~~~~~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements > > > >]’: /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:145:5: required from ‘struct boost::Assignable > > >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:526:3: required from ‘struct boost::OutputIterator > >, boost::detail::edge_desc_impl >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:526:3: required from ‘struct boost::OutputIteratorConcept > >, boost::detail::edge_desc_impl >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::OutputIteratorConcept > >, boost::detail::edge_desc_impl >]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied > >, boost::detail::edge_desc_impl > >::value’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied > >, boost::detail::edge_desc_impl > >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_ > >, boost::detail::edge_desc_impl >)>’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/kruskal_min_spanning_tree.hpp:57:9: required from ‘void boost::detail::kruskal_mst_impl(const Graph&, OutputIterator, Rank, Parent, Weight) [with Graph = R_adjacency_list; OutputIterator = std::back_insert_iterator > >; Rank = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>; Parent = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>; Weight = boost::adj_list_edge_property_map, boost::edge_weight_t>]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/kruskal_min_spanning_tree.hpp:112:29: required from ‘void boost::kruskal_minimum_spanning_tree(const Graph&, OutputIterator) [with Graph = R_adjacency_list; OutputIterator = std::back_insert_iterator > >]’ minST.cpp:54:38: required from here /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::Assignable > > >]’ 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ^ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements > >, boost::detail::edge_desc_impl > >]’: /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:529:5: required from ‘struct boost::OutputIterator > >, boost::detail::edge_desc_impl >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:526:3: required from ‘struct boost::OutputIteratorConcept > >, boost::detail::edge_desc_impl >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::OutputIteratorConcept > >, boost::detail::edge_desc_impl >]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied > >, boost::detail::edge_desc_impl > >::value’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied > >, boost::detail::edge_desc_impl > >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_ > >, boost::detail::edge_desc_impl >)>’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/kruskal_min_spanning_tree.hpp:57:9: required from ‘void boost::detail::kruskal_mst_impl(const Graph&, OutputIterator, Rank, Parent, Weight) [with Graph = R_adjacency_list; OutputIterator = std::back_insert_iterator > >; Rank = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>; Parent = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>; Weight = boost::adj_list_edge_property_map, boost::edge_weight_t>]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/kruskal_min_spanning_tree.hpp:112:29: required from ‘void boost::kruskal_minimum_spanning_tree(const Graph&, OutputIterator) [with Graph = R_adjacency_list; OutputIterator = std::back_insert_iterator > >]’ minST.cpp:54:38: required from here /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::OutputIterator > >, boost::detail::edge_desc_impl >]’ 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ^ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::OutputIteratorConcept > >, boost::detail::edge_desc_impl >]’: /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/kruskal_min_spanning_tree.hpp:57:9: required from ‘void boost::detail::kruskal_mst_impl(const Graph&, OutputIterator, Rank, Parent, Weight) [with Graph = R_adjacency_list; OutputIterator = std::back_insert_iterator > >; Rank = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>; Parent = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>; Weight = boost::adj_list_edge_property_map, boost::edge_weight_t>]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/kruskal_min_spanning_tree.hpp:112:29: required from ‘void boost::kruskal_minimum_spanning_tree(const Graph&, OutputIterator) [with Graph = R_adjacency_list; OutputIterator = std::back_insert_iterator > >]’ minST.cpp:54:38: required from here /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:526:17: note: in a call to non-static member function ‘boost::OutputIteratorConcept > >, boost::detail::edge_desc_impl >::~OutputIteratorConcept()’ 526 | BOOST_concept(OutputIterator,(TT)(ValueT)) | ^~~~~~~~~~~~~~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/preprocessor/cat.hpp:29:34: note: in definition of macro ‘BOOST_PP_CAT_I’ 29 | # define BOOST_PP_CAT_I(a, b) a ## b | ^ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/concept_def.hpp:23:12: note: in expansion of macro ‘BOOST_PP_CAT’ 23 | struct BOOST_PP_CAT(name,Concept) \ | ^~~~~~~~~~~~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:526:3: note: in expansion of macro ‘BOOST_concept’ 526 | BOOST_concept(OutputIterator,(TT)(ValueT)) | ^~~~~~~~~~~~~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::constraint::failed() [with Model = boost::ReadablePropertyMapConcept, boost::edge_weight_t>, boost::detail::edge_desc_impl >]’: /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/kruskal_min_spanning_tree.hpp:60:9: required from ‘void boost::detail::kruskal_mst_impl(const Graph&, OutputIterator, Rank, Parent, Weight) [with Graph = R_adjacency_list; OutputIterator = std::back_insert_iterator > >; Rank = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>; Parent = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>; Weight = boost::adj_list_edge_property_map, boost::edge_weight_t>]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/kruskal_min_spanning_tree.hpp:112:29: required from ‘void boost::kruskal_minimum_spanning_tree(const Graph&, OutputIterator) [with Graph = R_adjacency_list; OutputIterator = std::back_insert_iterator > >]’ minST.cpp:54:38: required from here /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:65:52: warning: ‘this’ pointer is null [-Wnonnull] 65 | static void failed() { ((Model*)0)->constraints(); } | ~~~~~~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/property_map/property_map.hpp:147:10: note: in a call to non-static member function ‘void boost::ReadablePropertyMapConcept::constraints() [with PMap = boost::adj_list_edge_property_map, boost::edge_weight_t>; Key = boost::detail::edge_desc_impl]’ 147 | void constraints() { | ^~~~~~~~~~~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::Assignable<__gnu_cxx::__normal_iterator > >]’: /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements > > >]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:145:5: required from ‘struct boost::Assignable<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:502:3: required from ‘struct boost::InputIterator<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:540:3: required from ‘struct boost::ForwardIterator<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:568:3: required from ‘struct boost::BidirectionalIterator<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:597:3: [ skipping 3 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied > > >::value’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied > > >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_ > >)>’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/property_map/property_map.hpp:354:5: required from ‘boost::iterator_property_map boost::make_iterator_property_map(RAIter, ID, Value) [with RAIter = __gnu_cxx::__normal_iterator >; Value = long unsigned int; ID = vec_adj_list_vertex_id_map, long unsigned int>]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/kruskal_min_spanning_tree.hpp:113:35: required from ‘void boost::kruskal_minimum_spanning_tree(const Graph&, OutputIterator) [with Graph = R_adjacency_list; OutputIterator = std::back_insert_iterator > >]’ minST.cpp:20:38: required from here /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::Assignable::~Assignable() [with TT = __gnu_cxx::__normal_iterator >]’ 37 | ~model() | ^ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:145:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 145 | BOOST_CONCEPT_USAGE(Assignable) { | ^~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::EqualityComparable<__gnu_cxx::__normal_iterator > >]’: /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements > > >]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:233:5: required from ‘struct boost::EqualityComparable<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:502:3: required from ‘struct boost::InputIterator<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:540:3: required from ‘struct boost::ForwardIterator<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:568:3: required from ‘struct boost::BidirectionalIterator<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:597:3: [ skipping 3 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied > > >::value’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied > > >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_ > >)>’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/property_map/property_map.hpp:354:5: required from ‘boost::iterator_property_map boost::make_iterator_property_map(RAIter, ID, Value) [with RAIter = __gnu_cxx::__normal_iterator >; Value = long unsigned int; ID = vec_adj_list_vertex_id_map, long unsigned int>]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/kruskal_min_spanning_tree.hpp:113:35: required from ‘void boost::kruskal_minimum_spanning_tree(const Graph&, OutputIterator) [with Graph = R_adjacency_list; OutputIterator = std::back_insert_iterator > >]’ minST.cpp:20:38: required from here /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::EqualityComparable::~EqualityComparable() [with TT = __gnu_cxx::__normal_iterator >]’ 37 | ~model() | ^ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:233:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 233 | BOOST_CONCEPT_USAGE(EqualityComparable) { | ^~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::InputIterator<__gnu_cxx::__normal_iterator > >]’: /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements > > >]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:512:7: required from ‘struct boost::InputIterator<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:540:3: required from ‘struct boost::ForwardIterator<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:568:3: required from ‘struct boost::BidirectionalIterator<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:597:3: required from ‘struct boost::RandomAccessIterator<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:597:3: [ skipping 2 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied > > >::value’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied > > >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_ > >)>’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/property_map/property_map.hpp:354:5: required from ‘boost::iterator_property_map boost::make_iterator_property_map(RAIter, ID, Value) [with RAIter = __gnu_cxx::__normal_iterator >; Value = long unsigned int; ID = vec_adj_list_vertex_id_map, long unsigned int>]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/kruskal_min_spanning_tree.hpp:113:35: required from ‘void boost::kruskal_minimum_spanning_tree(const Graph&, OutputIterator) [with Graph = R_adjacency_list; OutputIterator = std::back_insert_iterator > >]’ minST.cpp:20:38: required from here /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::InputIterator::~InputIterator() [with TT = __gnu_cxx::__normal_iterator >]’ 37 | ~model() | ^ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:512:7: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 512 | BOOST_CONCEPT_USAGE(InputIterator) | ^~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::ForwardIterator<__gnu_cxx::__normal_iterator > >]’: /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements > > >]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:543:7: required from ‘struct boost::ForwardIterator<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:568:3: required from ‘struct boost::BidirectionalIterator<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:597:3: required from ‘struct boost::RandomAccessIterator<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:597:3: [ skipping 2 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied > > >::value’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied > > >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_ > >)>’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/property_map/property_map.hpp:354:5: required from ‘boost::iterator_property_map boost::make_iterator_property_map(RAIter, ID, Value) [with RAIter = __gnu_cxx::__normal_iterator >; Value = long unsigned int; ID = vec_adj_list_vertex_id_map, long unsigned int>]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/kruskal_min_spanning_tree.hpp:113:35: required from ‘void boost::kruskal_minimum_spanning_tree(const Graph&, OutputIterator) [with Graph = R_adjacency_list; OutputIterator = std::back_insert_iterator > >]’ minST.cpp:20:38: required from here /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::ForwardIterator::~ForwardIterator() [with TT = __gnu_cxx::__normal_iterator >]’ 37 | ~model() | ^ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:543:7: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 543 | BOOST_CONCEPT_USAGE(ForwardIterator) | ^~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::BidirectionalIterator<__gnu_cxx::__normal_iterator > >]’: /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements > > >]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:571:7: required from ‘struct boost::BidirectionalIterator<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:597:3: required from ‘struct boost::RandomAccessIterator<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:597:3: required from ‘struct boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator > >]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied > > >::value’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied > > >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_ > >)>’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/property_map/property_map.hpp:354:5: required from ‘boost::iterator_property_map boost::make_iterator_property_map(RAIter, ID, Value) [with RAIter = __gnu_cxx::__normal_iterator >; Value = long unsigned int; ID = vec_adj_list_vertex_id_map, long unsigned int>]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/kruskal_min_spanning_tree.hpp:113:35: required from ‘void boost::kruskal_minimum_spanning_tree(const Graph&, OutputIterator) [with Graph = R_adjacency_list; OutputIterator = std::back_insert_iterator > >]’ minST.cpp:20:38: required from here /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::BidirectionalIterator::~BidirectionalIterator() [with TT = __gnu_cxx::__normal_iterator >]’ 37 | ~model() | ^ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:571:7: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 571 | BOOST_CONCEPT_USAGE(BidirectionalIterator) | ^~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::Comparable<__gnu_cxx::__normal_iterator > >]’: /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements > > >]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:253:5: required from ‘struct boost::Comparable<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:597:3: required from ‘struct boost::RandomAccessIterator<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:597:3: required from ‘struct boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator > >]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied > > >::value’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied > > >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_ > >)>’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/property_map/property_map.hpp:354:5: required from ‘boost::iterator_property_map boost::make_iterator_property_map(RAIter, ID, Value) [with RAIter = __gnu_cxx::__normal_iterator >; Value = long unsigned int; ID = vec_adj_list_vertex_id_map, long unsigned int>]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/kruskal_min_spanning_tree.hpp:113:35: required from ‘void boost::kruskal_minimum_spanning_tree(const Graph&, OutputIterator) [with Graph = R_adjacency_list; OutputIterator = std::back_insert_iterator > >]’ minST.cpp:20:38: required from here /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::Comparable::~Comparable() [with TT = __gnu_cxx::__normal_iterator >]’ 37 | ~model() | ^ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:253:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 253 | BOOST_CONCEPT_USAGE(Comparable) { | ^~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::RandomAccessIterator<__gnu_cxx::__normal_iterator > >]’: /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements > > >]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:601:7: required from ‘struct boost::RandomAccessIterator<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:597:3: required from ‘struct boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator > >]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied > > >::value’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied > > >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_ > >)>’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/property_map/property_map.hpp:354:5: required from ‘boost::iterator_property_map boost::make_iterator_property_map(RAIter, ID, Value) [with RAIter = __gnu_cxx::__normal_iterator >; Value = long unsigned int; ID = vec_adj_list_vertex_id_map, long unsigned int>]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/kruskal_min_spanning_tree.hpp:113:35: required from ‘void boost::kruskal_minimum_spanning_tree(const Graph&, OutputIterator) [with Graph = R_adjacency_list; OutputIterator = std::back_insert_iterator > >]’ minST.cpp:20:38: required from here /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::RandomAccessIterator::~RandomAccessIterator() [with TT = __gnu_cxx::__normal_iterator >]’ 37 | ~model() | ^ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:601:7: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 601 | BOOST_CONCEPT_USAGE(RandomAccessIterator) | ^~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::concepts::Graph >]’: /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements > >]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/graph_concepts.hpp:66:5: required from ‘struct boost::concepts::Graph >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/graph_concepts.hpp:176:1: required from ‘struct boost::concepts::VertexListGraph >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/graph_concepts.hpp:176:1: required from ‘struct boost::concepts::VertexListGraphConcept >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::concepts::VertexListGraphConcept >]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied > >::value’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied > >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_ >)>’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/kruskal_min_spanning_tree.hpp:55:9: required from ‘void boost::detail::kruskal_mst_impl(const Graph&, OutputIterator, Rank, Parent, Weight) [with Graph = R_adjacency_list; OutputIterator = std::back_insert_iterator > >; Rank = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>; Parent = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>; Weight = boost::adj_list_edge_property_map, boost::edge_weight_t>]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/kruskal_min_spanning_tree.hpp:112:29: required from ‘void boost::kruskal_minimum_spanning_tree(const Graph&, OutputIterator) [with Graph = R_adjacency_list; OutputIterator = std::back_insert_iterator > >]’ minST.cpp:20:38: required from here /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::concepts::Graph::~Graph() [with G = R_adjacency_list]’ 37 | ~model() | ^ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/graph_concepts.hpp:66:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 66 | BOOST_CONCEPT_USAGE(Graph) | ^~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::concepts::VertexListGraph >]’: /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements > >]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/graph_concepts.hpp:182:5: required from ‘struct boost::concepts::VertexListGraph >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/graph_concepts.hpp:176:1: required from ‘struct boost::concepts::VertexListGraphConcept >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::concepts::VertexListGraphConcept >]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied > >::value’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied > >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_ >)>’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/kruskal_min_spanning_tree.hpp:55:9: required from ‘void boost::detail::kruskal_mst_impl(const Graph&, OutputIterator, Rank, Parent, Weight) [with Graph = R_adjacency_list; OutputIterator = std::back_insert_iterator > >; Rank = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>; Parent = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>; Weight = boost::adj_list_edge_property_map, boost::edge_weight_t>]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/kruskal_min_spanning_tree.hpp:112:29: required from ‘void boost::kruskal_minimum_spanning_tree(const Graph&, OutputIterator) [with Graph = R_adjacency_list; OutputIterator = std::back_insert_iterator > >]’ minST.cpp:20:38: required from here /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::concepts::VertexListGraph::~VertexListGraph() [with G = R_adjacency_list]’ 37 | ~model() | ^ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/graph_concepts.hpp:182:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 182 | BOOST_CONCEPT_USAGE(VertexListGraph) | ^~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::concepts::EdgeListGraph >]’: /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements > >]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/graph_concepts.hpp:233:5: required from ‘struct boost::concepts::EdgeListGraph >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/graph_concepts.hpp:226:1: required from ‘struct boost::concepts::EdgeListGraphConcept >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::concepts::EdgeListGraphConcept >]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied > >::value’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied > >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_ >)>’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/kruskal_min_spanning_tree.hpp:56:9: required from ‘void boost::detail::kruskal_mst_impl(const Graph&, OutputIterator, Rank, Parent, Weight) [with Graph = R_adjacency_list; OutputIterator = std::back_insert_iterator > >; Rank = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>; Parent = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>; Weight = boost::adj_list_edge_property_map, boost::edge_weight_t>]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/kruskal_min_spanning_tree.hpp:112:29: required from ‘void boost::kruskal_minimum_spanning_tree(const Graph&, OutputIterator) [with Graph = R_adjacency_list; OutputIterator = std::back_insert_iterator > >]’ minST.cpp:20:38: required from here /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::concepts::EdgeListGraph::~EdgeListGraph() [with G = R_adjacency_list]’ 37 | ~model() | ^ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/graph_concepts.hpp:233:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 233 | BOOST_CONCEPT_USAGE(EdgeListGraph) | ^~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::Assignable > > >]’: /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements > > > >]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:145:5: required from ‘struct boost::Assignable > > >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:526:3: required from ‘struct boost::OutputIterator > >, boost::detail::edge_desc_impl >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:526:3: required from ‘struct boost::OutputIteratorConcept > >, boost::detail::edge_desc_impl >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::OutputIteratorConcept > >, boost::detail::edge_desc_impl >]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied > >, boost::detail::edge_desc_impl > >::value’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied > >, boost::detail::edge_desc_impl > >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_ > >, boost::detail::edge_desc_impl >)>’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/kruskal_min_spanning_tree.hpp:57:9: required from ‘void boost::detail::kruskal_mst_impl(const Graph&, OutputIterator, Rank, Parent, Weight) [with Graph = R_adjacency_list; OutputIterator = std::back_insert_iterator > >; Rank = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>; Parent = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>; Weight = boost::adj_list_edge_property_map, boost::edge_weight_t>]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/kruskal_min_spanning_tree.hpp:112:29: required from ‘void boost::kruskal_minimum_spanning_tree(const Graph&, OutputIterator) [with Graph = R_adjacency_list; OutputIterator = std::back_insert_iterator > >]’ minST.cpp:20:38: required from here /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::Assignable::~Assignable() [with TT = std::back_insert_iterator > >]’ 37 | ~model() | ^ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:145:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 145 | BOOST_CONCEPT_USAGE(Assignable) { | ^~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::OutputIterator > >, boost::detail::edge_desc_impl >]’: /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements > >, boost::detail::edge_desc_impl > >]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:529:5: required from ‘struct boost::OutputIterator > >, boost::detail::edge_desc_impl >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:526:3: required from ‘struct boost::OutputIteratorConcept > >, boost::detail::edge_desc_impl >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::OutputIteratorConcept > >, boost::detail::edge_desc_impl >]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied > >, boost::detail::edge_desc_impl > >::value’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied > >, boost::detail::edge_desc_impl > >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_ > >, boost::detail::edge_desc_impl >)>’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/kruskal_min_spanning_tree.hpp:57:9: required from ‘void boost::detail::kruskal_mst_impl(const Graph&, OutputIterator, Rank, Parent, Weight) [with Graph = R_adjacency_list; OutputIterator = std::back_insert_iterator > >; Rank = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>; Parent = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>; Weight = boost::adj_list_edge_property_map, boost::edge_weight_t>]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/kruskal_min_spanning_tree.hpp:112:29: required from ‘void boost::kruskal_minimum_spanning_tree(const Graph&, OutputIterator) [with Graph = R_adjacency_list; OutputIterator = std::back_insert_iterator > >]’ minST.cpp:20:38: required from here /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::OutputIterator::~OutputIterator() [with TT = std::back_insert_iterator > >; ValueT = boost::detail::edge_desc_impl]’ 37 | ~model() | ^ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:529:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 529 | BOOST_CONCEPT_USAGE(OutputIterator) { | ^~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::constraint::failed() [with Model = boost::ReadablePropertyMapConcept >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>, long unsigned int>]’: /home/omnipath/local/R/4.4-3.20/BH/include/boost/property_map/property_map.hpp:206:7: required from ‘void boost::ReadWritePropertyMapConcept::constraints() [with PMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>; Key = long unsigned int]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::ReadWritePropertyMapConcept >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>, long unsigned int>]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>, long unsigned int> >::value’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>, long unsigned int> >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_ >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>, long unsigned int>)>’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/kruskal_min_spanning_tree.hpp:58:9: required from ‘void boost::detail::kruskal_mst_impl(const Graph&, OutputIterator, Rank, Parent, Weight) [with Graph = R_adjacency_list; OutputIterator = std::back_insert_iterator > >; Rank = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>; Parent = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>; Weight = boost::adj_list_edge_property_map, boost::edge_weight_t>]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/kruskal_min_spanning_tree.hpp:112:29: required from ‘void boost::kruskal_minimum_spanning_tree(const Graph&, OutputIterator) [with Graph = R_adjacency_list; OutputIterator = std::back_insert_iterator > >]’ minST.cpp:20:38: required from here /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:65:52: warning: ‘this’ pointer is null [-Wnonnull] 65 | static void failed() { ((Model*)0)->constraints(); } | ~~~~~~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/property_map/property_map.hpp:147:10: note: in a call to non-static member function ‘void boost::ReadablePropertyMapConcept::constraints() [with PMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>; Key = long unsigned int]’ 147 | void constraints() { | ^~~~~~~~~~~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::constraint::failed() [with Model = boost::WritablePropertyMapConcept >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>, long unsigned int>]’: /home/omnipath/local/R/4.4-3.20/BH/include/boost/property_map/property_map.hpp:207:7: required from ‘void boost::ReadWritePropertyMapConcept::constraints() [with PMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>; Key = long unsigned int]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::ReadWritePropertyMapConcept >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>, long unsigned int>]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>, long unsigned int> >::value’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>, long unsigned int> >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_ >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>, long unsigned int>)>’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/kruskal_min_spanning_tree.hpp:58:9: required from ‘void boost::detail::kruskal_mst_impl(const Graph&, OutputIterator, Rank, Parent, Weight) [with Graph = R_adjacency_list; OutputIterator = std::back_insert_iterator > >; Rank = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>; Parent = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>; Weight = boost::adj_list_edge_property_map, boost::edge_weight_t>]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/kruskal_min_spanning_tree.hpp:112:29: required from ‘void boost::kruskal_minimum_spanning_tree(const Graph&, OutputIterator) [with Graph = R_adjacency_list; OutputIterator = std::back_insert_iterator > >]’ minST.cpp:20:38: required from here /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:65:52: warning: ‘this’ pointer is null [-Wnonnull] 65 | static void failed() { ((Model*)0)->constraints(); } | ~~~~~~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/property_map/property_map.hpp:179:10: note: in a call to non-static member function ‘void boost::WritablePropertyMapConcept::constraints() [with PMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>; Key = long unsigned int]’ 179 | void constraints() { | ^~~~~~~~~~~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements >]’: /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:208:5: required from ‘struct boost::Convertible’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:206:3: required from ‘struct boost::ConvertibleConcept’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::ConvertibleConcept]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied >::value’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:72:8: [ skipping 3 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>, long unsigned int> >::value’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>, long unsigned int> >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_ >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>, long unsigned int>)>’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/kruskal_min_spanning_tree.hpp:58:9: required from ‘void boost::detail::kruskal_mst_impl(const Graph&, OutputIterator, Rank, Parent, Weight) [with Graph = R_adjacency_list; OutputIterator = std::back_insert_iterator > >; Rank = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>; Parent = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>; Weight = boost::adj_list_edge_property_map, boost::edge_weight_t>]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/kruskal_min_spanning_tree.hpp:112:29: required from ‘void boost::kruskal_minimum_spanning_tree(const Graph&, OutputIterator) [with Graph = R_adjacency_list; OutputIterator = std::back_insert_iterator > >]’ minST.cpp:20:38: required from here /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::Convertible]’ 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ^ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::ConvertibleConcept]’: /home/omnipath/local/R/4.4-3.20/BH/include/boost/property_map/property_map.hpp:208:7: required from ‘void boost::ReadWritePropertyMapConcept::constraints() [with PMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>; Key = long unsigned int]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::ReadWritePropertyMapConcept >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>, long unsigned int>]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>, long unsigned int> >::value’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>, long unsigned int> >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_ >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>, long unsigned int>)>’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/kruskal_min_spanning_tree.hpp:58:9: required from ‘void boost::detail::kruskal_mst_impl(const Graph&, OutputIterator, Rank, Parent, Weight) [with Graph = R_adjacency_list; OutputIterator = std::back_insert_iterator > >; Rank = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>; Parent = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>; Weight = boost::adj_list_edge_property_map, boost::edge_weight_t>]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/kruskal_min_spanning_tree.hpp:112:29: required from ‘void boost::kruskal_minimum_spanning_tree(const Graph&, OutputIterator) [with Graph = R_adjacency_list; OutputIterator = std::back_insert_iterator > >]’ minST.cpp:20:38: required from here /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:206:17: note: in a call to non-static member function ‘boost::ConvertibleConcept::~ConvertibleConcept()’ 206 | BOOST_concept(Convertible,(X)(Y)) | ^~~~~~~~~~~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/preprocessor/cat.hpp:29:34: note: in definition of macro ‘BOOST_PP_CAT_I’ 29 | # define BOOST_PP_CAT_I(a, b) a ## b | ^ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/concept_def.hpp:23:12: note: in expansion of macro ‘BOOST_PP_CAT’ 23 | struct BOOST_PP_CAT(name,Concept) \ | ^~~~~~~~~~~~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:206:3: note: in expansion of macro ‘BOOST_concept’ 206 | BOOST_concept(Convertible,(X)(Y)) | ^~~~~~~~~~~~~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements >]’: /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:208:5: required from ‘struct boost::Convertible’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:206:3: required from ‘struct boost::ConvertibleConcept’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::ConvertibleConcept]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied >::value’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:72:8: [ skipping 3 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied, boost::edge_weight_t>, boost::detail::edge_desc_impl > >::value’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied, boost::edge_weight_t>, boost::detail::edge_desc_impl > >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_, boost::edge_weight_t>, boost::detail::edge_desc_impl >)>’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/kruskal_min_spanning_tree.hpp:60:9: required from ‘void boost::detail::kruskal_mst_impl(const Graph&, OutputIterator, Rank, Parent, Weight) [with Graph = R_adjacency_list; OutputIterator = std::back_insert_iterator > >; Rank = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>; Parent = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>; Weight = boost::adj_list_edge_property_map, boost::edge_weight_t>]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/kruskal_min_spanning_tree.hpp:112:29: required from ‘void boost::kruskal_minimum_spanning_tree(const Graph&, OutputIterator) [with Graph = R_adjacency_list; OutputIterator = std::back_insert_iterator > >]’ minST.cpp:20:38: required from here /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::Convertible]’ 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ^ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::ConvertibleConcept]’: /home/omnipath/local/R/4.4-3.20/BH/include/boost/property_map/property_map.hpp:148:7: required from ‘void boost::ReadablePropertyMapConcept::constraints() [with PMap = boost::adj_list_edge_property_map, boost::edge_weight_t>; Key = boost::detail::edge_desc_impl]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::ReadablePropertyMapConcept, boost::edge_weight_t>, boost::detail::edge_desc_impl >]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied, boost::edge_weight_t>, boost::detail::edge_desc_impl > >::value’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied, boost::edge_weight_t>, boost::detail::edge_desc_impl > >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_, boost::edge_weight_t>, boost::detail::edge_desc_impl >)>’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/kruskal_min_spanning_tree.hpp:60:9: required from ‘void boost::detail::kruskal_mst_impl(const Graph&, OutputIterator, Rank, Parent, Weight) [with Graph = R_adjacency_list; OutputIterator = std::back_insert_iterator > >; Rank = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>; Parent = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>; Weight = boost::adj_list_edge_property_map, boost::edge_weight_t>]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/kruskal_min_spanning_tree.hpp:112:29: required from ‘void boost::kruskal_minimum_spanning_tree(const Graph&, OutputIterator) [with Graph = R_adjacency_list; OutputIterator = std::back_insert_iterator > >]’ minST.cpp:20:38: required from here /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:206:17: note: in a call to non-static member function ‘boost::ConvertibleConcept::~ConvertibleConcept()’ 206 | BOOST_concept(Convertible,(X)(Y)) | ^~~~~~~~~~~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/preprocessor/cat.hpp:29:34: note: in definition of macro ‘BOOST_PP_CAT_I’ 29 | # define BOOST_PP_CAT_I(a, b) a ## b | ^ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/concept_def.hpp:23:12: note: in expansion of macro ‘BOOST_PP_CAT’ 23 | struct BOOST_PP_CAT(name,Concept) \ | ^~~~~~~~~~~~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:206:3: note: in expansion of macro ‘BOOST_concept’ 206 | BOOST_concept(Convertible,(X)(Y)) | ^~~~~~~~~~~~~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::Comparable]’: /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements >]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:253:5: required from ‘struct boost::Comparable’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:251:3: required from ‘struct boost::ComparableConcept’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::ComparableConcept]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied >::value’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_)>’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/kruskal_min_spanning_tree.hpp:64:9: required from ‘void boost::detail::kruskal_mst_impl(const Graph&, OutputIterator, Rank, Parent, Weight) [with Graph = R_adjacency_list; OutputIterator = std::back_insert_iterator > >; Rank = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>; Parent = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>; Weight = boost::adj_list_edge_property_map, boost::edge_weight_t>]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/kruskal_min_spanning_tree.hpp:112:29: required from ‘void boost::kruskal_minimum_spanning_tree(const Graph&, OutputIterator) [with Graph = R_adjacency_list; OutputIterator = std::back_insert_iterator > >]’ minST.cpp:20:38: required from here /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::Comparable::~Comparable() [with TT = double]’ 37 | ~model() | ^ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:253:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 253 | BOOST_CONCEPT_USAGE(Comparable) { | ^~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::Convertible]’: /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements >]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:208:5: required from ‘struct boost::Convertible’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:206:3: required from ‘struct boost::ConvertibleConcept’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::ConvertibleConcept]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied >::value’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_)>’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/kruskal_min_spanning_tree.hpp:65:9: required from ‘void boost::detail::kruskal_mst_impl(const Graph&, OutputIterator, Rank, Parent, Weight) [with Graph = R_adjacency_list; OutputIterator = std::back_insert_iterator > >; Rank = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>; Parent = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>; Weight = boost::adj_list_edge_property_map, boost::edge_weight_t>]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/kruskal_min_spanning_tree.hpp:112:29: required from ‘void boost::kruskal_minimum_spanning_tree(const Graph&, OutputIterator) [with Graph = R_adjacency_list; OutputIterator = std::back_insert_iterator > >]’ minST.cpp:20:38: required from here /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::Convertible::~Convertible() [with X = long unsigned int; Y = long unsigned int]’ 37 | ~model() | ^ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:208:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 208 | BOOST_CONCEPT_USAGE(Convertible) { | ^~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::concepts::Graph >]’: /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements > >]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/graph_concepts.hpp:66:5: required from ‘struct boost::concepts::Graph >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/graph_concepts.hpp:176:1: required from ‘struct boost::concepts::VertexListGraph >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/graph_concepts.hpp:176:1: required from ‘struct boost::concepts::VertexListGraphConcept >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::concepts::VertexListGraphConcept >]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied > >::value’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied > >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_ >)>’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/kruskal_min_spanning_tree.hpp:55:9: required from ‘void boost::detail::kruskal_mst_impl(const Graph&, OutputIterator, Rank, Parent, Weight) [with Graph = R_adjacency_list; OutputIterator = std::back_insert_iterator > >; Rank = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>; Parent = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>; Weight = boost::adj_list_edge_property_map, boost::edge_weight_t>]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/kruskal_min_spanning_tree.hpp:112:29: required from ‘void boost::kruskal_minimum_spanning_tree(const Graph&, OutputIterator) [with Graph = R_adjacency_list; OutputIterator = std::back_insert_iterator > >]’ minST.cpp:54:38: required from here /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::concepts::Graph::~Graph() [with G = R_adjacency_list]’ 37 | ~model() | ^ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/graph_concepts.hpp:66:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 66 | BOOST_CONCEPT_USAGE(Graph) | ^~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::concepts::VertexListGraph >]’: /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements > >]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/graph_concepts.hpp:182:5: required from ‘struct boost::concepts::VertexListGraph >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/graph_concepts.hpp:176:1: required from ‘struct boost::concepts::VertexListGraphConcept >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::concepts::VertexListGraphConcept >]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied > >::value’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied > >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_ >)>’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/kruskal_min_spanning_tree.hpp:55:9: required from ‘void boost::detail::kruskal_mst_impl(const Graph&, OutputIterator, Rank, Parent, Weight) [with Graph = R_adjacency_list; OutputIterator = std::back_insert_iterator > >; Rank = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>; Parent = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>; Weight = boost::adj_list_edge_property_map, boost::edge_weight_t>]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/kruskal_min_spanning_tree.hpp:112:29: required from ‘void boost::kruskal_minimum_spanning_tree(const Graph&, OutputIterator) [with Graph = R_adjacency_list; OutputIterator = std::back_insert_iterator > >]’ minST.cpp:54:38: required from here /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::concepts::VertexListGraph::~VertexListGraph() [with G = R_adjacency_list]’ 37 | ~model() | ^ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/graph_concepts.hpp:182:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 182 | BOOST_CONCEPT_USAGE(VertexListGraph) | ^~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::concepts::EdgeListGraph >]’: /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements > >]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/graph_concepts.hpp:233:5: required from ‘struct boost::concepts::EdgeListGraph >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/graph_concepts.hpp:226:1: required from ‘struct boost::concepts::EdgeListGraphConcept >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::concepts::EdgeListGraphConcept >]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied > >::value’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied > >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_ >)>’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/kruskal_min_spanning_tree.hpp:56:9: required from ‘void boost::detail::kruskal_mst_impl(const Graph&, OutputIterator, Rank, Parent, Weight) [with Graph = R_adjacency_list; OutputIterator = std::back_insert_iterator > >; Rank = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>; Parent = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>; Weight = boost::adj_list_edge_property_map, boost::edge_weight_t>]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/kruskal_min_spanning_tree.hpp:112:29: required from ‘void boost::kruskal_minimum_spanning_tree(const Graph&, OutputIterator) [with Graph = R_adjacency_list; OutputIterator = std::back_insert_iterator > >]’ minST.cpp:54:38: required from here /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::concepts::EdgeListGraph::~EdgeListGraph() [with G = R_adjacency_list]’ 37 | ~model() | ^ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/graph_concepts.hpp:233:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 233 | BOOST_CONCEPT_USAGE(EdgeListGraph) | ^~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::Assignable > > >]’: /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements > > > >]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:145:5: required from ‘struct boost::Assignable > > >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:526:3: required from ‘struct boost::OutputIterator > >, boost::detail::edge_desc_impl >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:526:3: required from ‘struct boost::OutputIteratorConcept > >, boost::detail::edge_desc_impl >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::OutputIteratorConcept > >, boost::detail::edge_desc_impl >]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied > >, boost::detail::edge_desc_impl > >::value’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied > >, boost::detail::edge_desc_impl > >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_ > >, boost::detail::edge_desc_impl >)>’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/kruskal_min_spanning_tree.hpp:57:9: required from ‘void boost::detail::kruskal_mst_impl(const Graph&, OutputIterator, Rank, Parent, Weight) [with Graph = R_adjacency_list; OutputIterator = std::back_insert_iterator > >; Rank = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>; Parent = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>; Weight = boost::adj_list_edge_property_map, boost::edge_weight_t>]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/kruskal_min_spanning_tree.hpp:112:29: required from ‘void boost::kruskal_minimum_spanning_tree(const Graph&, OutputIterator) [with Graph = R_adjacency_list; OutputIterator = std::back_insert_iterator > >]’ minST.cpp:54:38: required from here /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::Assignable::~Assignable() [with TT = std::back_insert_iterator > >]’ 37 | ~model() | ^ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:145:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 145 | BOOST_CONCEPT_USAGE(Assignable) { | ^~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::OutputIterator > >, boost::detail::edge_desc_impl >]’: /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements > >, boost::detail::edge_desc_impl > >]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:529:5: required from ‘struct boost::OutputIterator > >, boost::detail::edge_desc_impl >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:526:3: required from ‘struct boost::OutputIteratorConcept > >, boost::detail::edge_desc_impl >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::OutputIteratorConcept > >, boost::detail::edge_desc_impl >]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied > >, boost::detail::edge_desc_impl > >::value’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied > >, boost::detail::edge_desc_impl > >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_ > >, boost::detail::edge_desc_impl >)>’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/kruskal_min_spanning_tree.hpp:57:9: required from ‘void boost::detail::kruskal_mst_impl(const Graph&, OutputIterator, Rank, Parent, Weight) [with Graph = R_adjacency_list; OutputIterator = std::back_insert_iterator > >; Rank = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>; Parent = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>; Weight = boost::adj_list_edge_property_map, boost::edge_weight_t>]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/kruskal_min_spanning_tree.hpp:112:29: required from ‘void boost::kruskal_minimum_spanning_tree(const Graph&, OutputIterator) [with Graph = R_adjacency_list; OutputIterator = std::back_insert_iterator > >]’ minST.cpp:54:38: required from here /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::OutputIterator::~OutputIterator() [with TT = std::back_insert_iterator > >; ValueT = boost::detail::edge_desc_impl]’ 37 | ~model() | ^ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:529:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 529 | BOOST_CONCEPT_USAGE(OutputIterator) { | ^~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements >]’: /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:208:5: required from ‘struct boost::Convertible’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::Convertible]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied >::value’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_)>’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:603:11: required from ‘boost::RandomAccessIterator::~RandomAccessIterator() [with TT = __gnu_cxx::__normal_iterator >]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:597:3: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator > >]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/property_map/property_map.hpp:354:5: required from ‘boost::iterator_property_map boost::make_iterator_property_map(RAIter, ID, Value) [with RAIter = __gnu_cxx::__normal_iterator >; Value = long unsigned int; ID = vec_adj_list_vertex_id_map, long unsigned int>]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/kruskal_min_spanning_tree.hpp:113:35: required from ‘void boost::kruskal_minimum_spanning_tree(const Graph&, OutputIterator) [with Graph = R_adjacency_list; OutputIterator = std::back_insert_iterator > >]’ minST.cpp:20:38: required from here /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::Convertible]’ 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ^ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::Convertible]’: /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:603:11: required from ‘boost::RandomAccessIterator::~RandomAccessIterator() [with TT = __gnu_cxx::__normal_iterator >]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:597:3: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator > >]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/property_map/property_map.hpp:354:5: required from ‘boost::iterator_property_map boost::make_iterator_property_map(RAIter, ID, Value) [with RAIter = __gnu_cxx::__normal_iterator >; Value = long unsigned int; ID = vec_adj_list_vertex_id_map, long unsigned int>]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/kruskal_min_spanning_tree.hpp:113:35: required from ‘void boost::kruskal_minimum_spanning_tree(const Graph&, OutputIterator) [with Graph = R_adjacency_list; OutputIterator = std::back_insert_iterator > >]’ minST.cpp:20:38: required from here /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::Convertible::~Convertible() [with X = std::random_access_iterator_tag; Y = std::random_access_iterator_tag]’ 37 | ~model() | ^ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:208:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 208 | BOOST_CONCEPT_USAGE(Convertible) { | ^~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements > >]’: /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/graph_concepts.hpp:52:50: required from ‘struct boost::concepts::MultiPassInputIterator >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::concepts::MultiPassInputIterator >]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied > >::value’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied > >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_ >)>’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/graph_concepts.hpp:184:9: required from ‘boost::concepts::VertexListGraph::~VertexListGraph() [with G = R_adjacency_list]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/graph_concepts.hpp:176:1: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::VertexListGraphConcept >]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/kruskal_min_spanning_tree.hpp:55:9: required from ‘void boost::detail::kruskal_mst_impl(const Graph&, OutputIterator, Rank, Parent, Weight) [with Graph = R_adjacency_list; OutputIterator = std::back_insert_iterator > >; Rank = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>; Parent = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>; Weight = boost::adj_list_edge_property_map, boost::edge_weight_t>]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/kruskal_min_spanning_tree.hpp:112:29: required from ‘void boost::kruskal_minimum_spanning_tree(const Graph&, OutputIterator) [with Graph = R_adjacency_list; OutputIterator = std::back_insert_iterator > >]’ minST.cpp:20:38: required from here /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::concepts::MultiPassInputIterator >]’ 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ^ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::MultiPassInputIterator >]’: /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/graph_concepts.hpp:184:9: required from ‘boost::concepts::VertexListGraph::~VertexListGraph() [with G = R_adjacency_list]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/graph_concepts.hpp:176:1: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::VertexListGraphConcept >]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/kruskal_min_spanning_tree.hpp:55:9: required from ‘void boost::detail::kruskal_mst_impl(const Graph&, OutputIterator, Rank, Parent, Weight) [with Graph = R_adjacency_list; OutputIterator = std::back_insert_iterator > >; Rank = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>; Parent = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>; Weight = boost::adj_list_edge_property_map, boost::edge_weight_t>]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/kruskal_min_spanning_tree.hpp:112:29: required from ‘void boost::kruskal_minimum_spanning_tree(const Graph&, OutputIterator) [with Graph = R_adjacency_list; OutputIterator = std::back_insert_iterator > >]’ minST.cpp:20:38: required from here /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::concepts::MultiPassInputIterator::~MultiPassInputIterator() [with T = boost::range_detail::integer_iterator]’ 37 | ~model() | ^ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/graph_concepts.hpp:52:50: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 52 | BOOST_concept(MultiPassInputIterator, (T)) { BOOST_CONCEPT_USAGE( | ^~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements >]’: /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:208:5: required from ‘struct boost::Convertible’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::Convertible]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied >::value’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_)>’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/graph_concepts.hpp:185:9: required from ‘boost::concepts::VertexListGraph::~VertexListGraph() [with G = R_adjacency_list]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/graph_concepts.hpp:176:1: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::VertexListGraphConcept >]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/kruskal_min_spanning_tree.hpp:55:9: required from ‘void boost::detail::kruskal_mst_impl(const Graph&, OutputIterator, Rank, Parent, Weight) [with Graph = R_adjacency_list; OutputIterator = std::back_insert_iterator > >; Rank = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>; Parent = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>; Weight = boost::adj_list_edge_property_map, boost::edge_weight_t>]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/kruskal_min_spanning_tree.hpp:112:29: required from ‘void boost::kruskal_minimum_spanning_tree(const Graph&, OutputIterator) [with Graph = R_adjacency_list; OutputIterator = std::back_insert_iterator > >]’ minST.cpp:20:38: required from here /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::Convertible]’ 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ^ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::Convertible]’: /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/graph_concepts.hpp:185:9: required from ‘boost::concepts::VertexListGraph::~VertexListGraph() [with G = R_adjacency_list]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/graph_concepts.hpp:176:1: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::VertexListGraphConcept >]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/kruskal_min_spanning_tree.hpp:55:9: required from ‘void boost::detail::kruskal_mst_impl(const Graph&, OutputIterator, Rank, Parent, Weight) [with Graph = R_adjacency_list; OutputIterator = std::back_insert_iterator > >; Rank = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>; Parent = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>; Weight = boost::adj_list_edge_property_map, boost::edge_weight_t>]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/kruskal_min_spanning_tree.hpp:112:29: required from ‘void boost::kruskal_minimum_spanning_tree(const Graph&, OutputIterator) [with Graph = R_adjacency_list; OutputIterator = std::back_insert_iterator > >]’ minST.cpp:20:38: required from here /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::Convertible::~Convertible() [with X = boost::adj_list_dir_traversal_tag; Y = boost::vertex_list_graph_tag]’ 37 | ~model() | ^ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:208:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 208 | BOOST_CONCEPT_USAGE(Convertible) { | ^~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator >*, std::vector >, std::allocator > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::adjacency_list, boost::property, boost::no_property, boost::listS> > > >]’: /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/graph_concepts.hpp:52:50: required from ‘struct boost::concepts::MultiPassInputIterator, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator >*, std::vector >, std::allocator > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::adjacency_list, boost::property, boost::no_property, boost::listS> > >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::concepts::MultiPassInputIterator, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator >*, std::vector >, std::allocator > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::adjacency_list, boost::property, boost::no_property, boost::listS> > >]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator >*, std::vector >, std::allocator > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::adjacency_list, boost::property, boost::no_property, boost::listS> > > >::value’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator >*, std::vector >, std::allocator > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::adjacency_list, boost::property, boost::no_property, boost::listS> > > >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator >*, std::vector >, std::allocator > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::adjacency_list, boost::property, boost::no_property, boost::listS> > >)>’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/graph_concepts.hpp:235:9: required from ‘boost::concepts::EdgeListGraph::~EdgeListGraph() [with G = R_adjacency_list]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/graph_concepts.hpp:226:1: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::EdgeListGraphConcept >]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/kruskal_min_spanning_tree.hpp:56:9: required from ‘void boost::detail::kruskal_mst_impl(const Graph&, OutputIterator, Rank, Parent, Weight) [with Graph = R_adjacency_list; OutputIterator = std::back_insert_iterator > >; Rank = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>; Parent = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>; Weight = boost::adj_list_edge_property_map, boost::edge_weight_t>]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/kruskal_min_spanning_tree.hpp:112:29: required from ‘void boost::kruskal_minimum_spanning_tree(const Graph&, OutputIterator) [with Graph = R_adjacency_list; OutputIterator = std::back_insert_iterator > >]’ minST.cpp:20:38: required from here /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::concepts::MultiPassInputIterator, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator >*, std::vector >, std::allocator > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::adjacency_list, boost::property, boost::no_property, boost::listS> > >]’ 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ^ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::MultiPassInputIterator, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator >*, std::vector >, std::allocator > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::adjacency_list, boost::property, boost::no_property, boost::listS> > >]’: /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/graph_concepts.hpp:235:9: required from ‘boost::concepts::EdgeListGraph::~EdgeListGraph() [with G = R_adjacency_list]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/graph_concepts.hpp:226:1: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::EdgeListGraphConcept >]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/kruskal_min_spanning_tree.hpp:56:9: required from ‘void boost::detail::kruskal_mst_impl(const Graph&, OutputIterator, Rank, Parent, Weight) [with Graph = R_adjacency_list; OutputIterator = std::back_insert_iterator > >; Rank = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>; Parent = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>; Weight = boost::adj_list_edge_property_map, boost::edge_weight_t>]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/kruskal_min_spanning_tree.hpp:112:29: required from ‘void boost::kruskal_minimum_spanning_tree(const Graph&, OutputIterator) [with Graph = R_adjacency_list; OutputIterator = std::back_insert_iterator > >]’ minST.cpp:20:38: required from here /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::concepts::MultiPassInputIterator::~MultiPassInputIterator() [with T = boost::detail::adj_list_edge_iterator, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator >*, std::vector >, std::allocator > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::adjacency_list, boost::property, boost::no_property, boost::listS> >]’ 37 | ~model() | ^ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/graph_concepts.hpp:52:50: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 52 | BOOST_concept(MultiPassInputIterator, (T)) { BOOST_CONCEPT_USAGE( | ^~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements > >]’: /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:137:5: required from ‘struct boost::DefaultConstructible >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::DefaultConstructible >]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied > >::value’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied > >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_ >)>’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/graph_concepts.hpp:90:9: required from ‘boost::concepts::EdgeListGraph::~EdgeListGraph() [with G = R_adjacency_list]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/graph_concepts.hpp:226:1: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::EdgeListGraphConcept >]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/kruskal_min_spanning_tree.hpp:56:9: required from ‘void boost::detail::kruskal_mst_impl(const Graph&, OutputIterator, Rank, Parent, Weight) [with Graph = R_adjacency_list; OutputIterator = std::back_insert_iterator > >; Rank = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>; Parent = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>; Weight = boost::adj_list_edge_property_map, boost::edge_weight_t>]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/kruskal_min_spanning_tree.hpp:112:29: required from ‘void boost::kruskal_minimum_spanning_tree(const Graph&, OutputIterator) [with Graph = R_adjacency_list; OutputIterator = std::back_insert_iterator > >]’ minST.cpp:20:38: required from here /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::DefaultConstructible >]’ 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ^ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::DefaultConstructible >]’: /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/graph_concepts.hpp:90:9: required from ‘boost::concepts::EdgeListGraph::~EdgeListGraph() [with G = R_adjacency_list]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/graph_concepts.hpp:226:1: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::EdgeListGraphConcept >]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/kruskal_min_spanning_tree.hpp:56:9: required from ‘void boost::detail::kruskal_mst_impl(const Graph&, OutputIterator, Rank, Parent, Weight) [with Graph = R_adjacency_list; OutputIterator = std::back_insert_iterator > >; Rank = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>; Parent = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>; Weight = boost::adj_list_edge_property_map, boost::edge_weight_t>]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/kruskal_min_spanning_tree.hpp:112:29: required from ‘void boost::kruskal_minimum_spanning_tree(const Graph&, OutputIterator) [with Graph = R_adjacency_list; OutputIterator = std::back_insert_iterator > >]’ minST.cpp:20:38: required from here /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::DefaultConstructible::~DefaultConstructible() [with TT = boost::detail::edge_desc_impl]’ 37 | ~model() | ^ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:137:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 137 | BOOST_CONCEPT_USAGE(DefaultConstructible) { | ^~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements > >]’: /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:233:5: required from ‘struct boost::EqualityComparable >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::EqualityComparable >]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied > >::value’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied > >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_ >)>’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/graph_concepts.hpp:91:9: required from ‘boost::concepts::EdgeListGraph::~EdgeListGraph() [with G = R_adjacency_list]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/graph_concepts.hpp:226:1: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::EdgeListGraphConcept >]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/kruskal_min_spanning_tree.hpp:56:9: required from ‘void boost::detail::kruskal_mst_impl(const Graph&, OutputIterator, Rank, Parent, Weight) [with Graph = R_adjacency_list; OutputIterator = std::back_insert_iterator > >; Rank = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>; Parent = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>; Weight = boost::adj_list_edge_property_map, boost::edge_weight_t>]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/kruskal_min_spanning_tree.hpp:112:29: required from ‘void boost::kruskal_minimum_spanning_tree(const Graph&, OutputIterator) [with Graph = R_adjacency_list; OutputIterator = std::back_insert_iterator > >]’ minST.cpp:20:38: required from here /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::EqualityComparable >]’ 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ^ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::EqualityComparable >]’: /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/graph_concepts.hpp:91:9: required from ‘boost::concepts::EdgeListGraph::~EdgeListGraph() [with G = R_adjacency_list]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/graph_concepts.hpp:226:1: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::EdgeListGraphConcept >]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/kruskal_min_spanning_tree.hpp:56:9: required from ‘void boost::detail::kruskal_mst_impl(const Graph&, OutputIterator, Rank, Parent, Weight) [with Graph = R_adjacency_list; OutputIterator = std::back_insert_iterator > >; Rank = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>; Parent = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>; Weight = boost::adj_list_edge_property_map, boost::edge_weight_t>]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/kruskal_min_spanning_tree.hpp:112:29: required from ‘void boost::kruskal_minimum_spanning_tree(const Graph&, OutputIterator) [with Graph = R_adjacency_list; OutputIterator = std::back_insert_iterator > >]’ minST.cpp:20:38: required from here /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::EqualityComparable::~EqualityComparable() [with TT = boost::detail::edge_desc_impl]’ 37 | ~model() | ^ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:233:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 233 | BOOST_CONCEPT_USAGE(EqualityComparable) { | ^~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements > >]’: /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:145:5: required from ‘struct boost::Assignable >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::Assignable >]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied > >::value’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied > >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_ >)>’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/graph_concepts.hpp:92:9: required from ‘boost::concepts::EdgeListGraph::~EdgeListGraph() [with G = R_adjacency_list]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/graph_concepts.hpp:226:1: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::EdgeListGraphConcept >]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/kruskal_min_spanning_tree.hpp:56:9: required from ‘void boost::detail::kruskal_mst_impl(const Graph&, OutputIterator, Rank, Parent, Weight) [with Graph = R_adjacency_list; OutputIterator = std::back_insert_iterator > >; Rank = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>; Parent = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>; Weight = boost::adj_list_edge_property_map, boost::edge_weight_t>]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/kruskal_min_spanning_tree.hpp:112:29: required from ‘void boost::kruskal_minimum_spanning_tree(const Graph&, OutputIterator) [with Graph = R_adjacency_list; OutputIterator = std::back_insert_iterator > >]’ minST.cpp:20:38: required from here /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::Assignable >]’ 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ^ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::Assignable >]’: /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/graph_concepts.hpp:92:9: required from ‘boost::concepts::EdgeListGraph::~EdgeListGraph() [with G = R_adjacency_list]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/graph_concepts.hpp:226:1: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::EdgeListGraphConcept >]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/kruskal_min_spanning_tree.hpp:56:9: required from ‘void boost::detail::kruskal_mst_impl(const Graph&, OutputIterator, Rank, Parent, Weight) [with Graph = R_adjacency_list; OutputIterator = std::back_insert_iterator > >; Rank = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>; Parent = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>; Weight = boost::adj_list_edge_property_map, boost::edge_weight_t>]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/kruskal_min_spanning_tree.hpp:112:29: required from ‘void boost::kruskal_minimum_spanning_tree(const Graph&, OutputIterator) [with Graph = R_adjacency_list; OutputIterator = std::back_insert_iterator > >]’ minST.cpp:20:38: required from here /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::Assignable::~Assignable() [with TT = boost::detail::edge_desc_impl]’ 37 | ~model() | ^ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:145:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 145 | BOOST_CONCEPT_USAGE(Assignable) { | ^~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements >]’: /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:208:5: required from ‘struct boost::Convertible’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::Convertible]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied >::value’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_)>’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/graph_concepts.hpp:239:9: required from ‘boost::concepts::EdgeListGraph::~EdgeListGraph() [with G = R_adjacency_list]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/graph_concepts.hpp:226:1: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::EdgeListGraphConcept >]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/kruskal_min_spanning_tree.hpp:56:9: required from ‘void boost::detail::kruskal_mst_impl(const Graph&, OutputIterator, Rank, Parent, Weight) [with Graph = R_adjacency_list; OutputIterator = std::back_insert_iterator > >; Rank = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>; Parent = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>; Weight = boost::adj_list_edge_property_map, boost::edge_weight_t>]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/kruskal_min_spanning_tree.hpp:112:29: required from ‘void boost::kruskal_minimum_spanning_tree(const Graph&, OutputIterator) [with Graph = R_adjacency_list; OutputIterator = std::back_insert_iterator > >]’ minST.cpp:20:38: required from here /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::Convertible]’ 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ^ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::Convertible]’: /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/graph_concepts.hpp:239:9: required from ‘boost::concepts::EdgeListGraph::~EdgeListGraph() [with G = R_adjacency_list]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/graph_concepts.hpp:226:1: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::EdgeListGraphConcept >]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/kruskal_min_spanning_tree.hpp:56:9: required from ‘void boost::detail::kruskal_mst_impl(const Graph&, OutputIterator, Rank, Parent, Weight) [with Graph = R_adjacency_list; OutputIterator = std::back_insert_iterator > >; Rank = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>; Parent = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>; Weight = boost::adj_list_edge_property_map, boost::edge_weight_t>]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/kruskal_min_spanning_tree.hpp:112:29: required from ‘void boost::kruskal_minimum_spanning_tree(const Graph&, OutputIterator) [with Graph = R_adjacency_list; OutputIterator = std::back_insert_iterator > >]’ minST.cpp:20:38: required from here /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::Convertible::~Convertible() [with X = boost::adj_list_dir_traversal_tag; Y = boost::edge_list_graph_tag]’ 37 | ~model() | ^ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:208:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 208 | BOOST_CONCEPT_USAGE(Convertible) { | ^~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements >]’: /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:208:5: required from ‘struct boost::Convertible’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:206:3: required from ‘struct boost::ConvertibleConcept’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::ConvertibleConcept]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied >::value’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:72:8: [ skipping 8 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>, long unsigned int> >::value’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>, long unsigned int> >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_ >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>, long unsigned int>)>’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/kruskal_min_spanning_tree.hpp:58:9: required from ‘void boost::detail::kruskal_mst_impl(const Graph&, OutputIterator, Rank, Parent, Weight) [with Graph = R_adjacency_list; OutputIterator = std::back_insert_iterator > >; Rank = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>; Parent = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>; Weight = boost::adj_list_edge_property_map, boost::edge_weight_t>]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/kruskal_min_spanning_tree.hpp:112:29: required from ‘void boost::kruskal_minimum_spanning_tree(const Graph&, OutputIterator) [with Graph = R_adjacency_list; OutputIterator = std::back_insert_iterator > >]’ minST.cpp:20:38: required from here /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::Convertible]’ 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ^ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::ConvertibleConcept]’: /home/omnipath/local/R/4.4-3.20/BH/include/boost/property_map/property_map.hpp:180:7: required from ‘void boost::WritablePropertyMapConcept::constraints() [with PMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>; Key = long unsigned int]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::WritablePropertyMapConcept >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>, long unsigned int>]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>, long unsigned int> >::value’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>, long unsigned int> >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_ >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>, long unsigned int>)>’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/property_map/property_map.hpp:207:7: [ skipping 2 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>, long unsigned int> >::value’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>, long unsigned int> >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_ >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>, long unsigned int>)>’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/kruskal_min_spanning_tree.hpp:58:9: required from ‘void boost::detail::kruskal_mst_impl(const Graph&, OutputIterator, Rank, Parent, Weight) [with Graph = R_adjacency_list; OutputIterator = std::back_insert_iterator > >; Rank = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>; Parent = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>; Weight = boost::adj_list_edge_property_map, boost::edge_weight_t>]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/kruskal_min_spanning_tree.hpp:112:29: required from ‘void boost::kruskal_minimum_spanning_tree(const Graph&, OutputIterator) [with Graph = R_adjacency_list; OutputIterator = std::back_insert_iterator > >]’ minST.cpp:20:38: required from here /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:206:17: note: in a call to non-static member function ‘boost::ConvertibleConcept::~ConvertibleConcept()’ 206 | BOOST_concept(Convertible,(X)(Y)) | ^~~~~~~~~~~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/preprocessor/cat.hpp:29:34: note: in definition of macro ‘BOOST_PP_CAT_I’ 29 | # define BOOST_PP_CAT_I(a, b) a ## b | ^ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/concept_def.hpp:23:12: note: in expansion of macro ‘BOOST_PP_CAT’ 23 | struct BOOST_PP_CAT(name,Concept) \ | ^~~~~~~~~~~~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:206:3: note: in expansion of macro ‘BOOST_concept’ 206 | BOOST_concept(Convertible,(X)(Y)) | ^~~~~~~~~~~~~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::Convertible]’: /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements >]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:208:5: required from ‘struct boost::Convertible’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:206:3: required from ‘struct boost::ConvertibleConcept’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::ConvertibleConcept]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied >::value’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:45:51: [ skipping 4 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>, long unsigned int> >::value’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>, long unsigned int> >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_ >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>, long unsigned int>)>’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/kruskal_min_spanning_tree.hpp:58:9: required from ‘void boost::detail::kruskal_mst_impl(const Graph&, OutputIterator, Rank, Parent, Weight) [with Graph = R_adjacency_list; OutputIterator = std::back_insert_iterator > >; Rank = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>; Parent = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>; Weight = boost::adj_list_edge_property_map, boost::edge_weight_t>]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/kruskal_min_spanning_tree.hpp:112:29: required from ‘void boost::kruskal_minimum_spanning_tree(const Graph&, OutputIterator) [with Graph = R_adjacency_list; OutputIterator = std::back_insert_iterator > >]’ minST.cpp:20:38: required from here /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::Convertible::~Convertible() [with X = boost::lvalue_property_map_tag; Y = boost::read_write_property_map_tag]’ 37 | ~model() | ^ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:208:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 208 | BOOST_CONCEPT_USAGE(Convertible) { | ^~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::Convertible]’: /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements >]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:208:5: required from ‘struct boost::Convertible’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:206:3: required from ‘struct boost::ConvertibleConcept’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::ConvertibleConcept]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied >::value’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:45:51: [ skipping 4 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied, boost::edge_weight_t>, boost::detail::edge_desc_impl > >::value’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied, boost::edge_weight_t>, boost::detail::edge_desc_impl > >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_, boost::edge_weight_t>, boost::detail::edge_desc_impl >)>’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/kruskal_min_spanning_tree.hpp:60:9: required from ‘void boost::detail::kruskal_mst_impl(const Graph&, OutputIterator, Rank, Parent, Weight) [with Graph = R_adjacency_list; OutputIterator = std::back_insert_iterator > >; Rank = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>; Parent = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>; Weight = boost::adj_list_edge_property_map, boost::edge_weight_t>]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/kruskal_min_spanning_tree.hpp:112:29: required from ‘void boost::kruskal_minimum_spanning_tree(const Graph&, OutputIterator) [with Graph = R_adjacency_list; OutputIterator = std::back_insert_iterator > >]’ minST.cpp:20:38: required from here /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::Convertible::~Convertible() [with X = boost::lvalue_property_map_tag; Y = boost::readable_property_map_tag]’ 37 | ~model() | ^ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:208:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 208 | BOOST_CONCEPT_USAGE(Convertible) { | ^~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements >]’: /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:208:5: required from ‘struct boost::Convertible’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::Convertible]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied >::value’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_)>’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/graph_concepts.hpp:185:9: required from ‘boost::concepts::VertexListGraph::~VertexListGraph() [with G = R_adjacency_list]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/graph_concepts.hpp:176:1: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::VertexListGraphConcept >]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/kruskal_min_spanning_tree.hpp:55:9: required from ‘void boost::detail::kruskal_mst_impl(const Graph&, OutputIterator, Rank, Parent, Weight) [with Graph = R_adjacency_list; OutputIterator = std::back_insert_iterator > >; Rank = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>; Parent = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>; Weight = boost::adj_list_edge_property_map, boost::edge_weight_t>]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/kruskal_min_spanning_tree.hpp:112:29: required from ‘void boost::kruskal_minimum_spanning_tree(const Graph&, OutputIterator) [with Graph = R_adjacency_list; OutputIterator = std::back_insert_iterator > >]’ minST.cpp:54:38: required from here /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::Convertible]’ 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ^ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::Convertible]’: /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/graph_concepts.hpp:185:9: required from ‘boost::concepts::VertexListGraph::~VertexListGraph() [with G = R_adjacency_list]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/graph_concepts.hpp:176:1: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::VertexListGraphConcept >]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/kruskal_min_spanning_tree.hpp:55:9: required from ‘void boost::detail::kruskal_mst_impl(const Graph&, OutputIterator, Rank, Parent, Weight) [with Graph = R_adjacency_list; OutputIterator = std::back_insert_iterator > >; Rank = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>; Parent = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>; Weight = boost::adj_list_edge_property_map, boost::edge_weight_t>]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/kruskal_min_spanning_tree.hpp:112:29: required from ‘void boost::kruskal_minimum_spanning_tree(const Graph&, OutputIterator) [with Graph = R_adjacency_list; OutputIterator = std::back_insert_iterator > >]’ minST.cpp:54:38: required from here /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::Convertible::~Convertible() [with X = boost::undir_adj_list_traversal_tag; Y = boost::vertex_list_graph_tag]’ 37 | ~model() | ^ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:208:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 208 | BOOST_CONCEPT_USAGE(Convertible) { | ^~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements > >, boost::detail::edge_desc_impl, long int> > >]’: /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/graph_concepts.hpp:52:50: required from ‘struct boost::concepts::MultiPassInputIterator > >, boost::detail::edge_desc_impl, long int> >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::concepts::MultiPassInputIterator > >, boost::detail::edge_desc_impl, long int> >]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied > >, boost::detail::edge_desc_impl, long int> > >::value’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied > >, boost::detail::edge_desc_impl, long int> > >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_ > >, boost::detail::edge_desc_impl, long int> >)>’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/graph_concepts.hpp:235:9: required from ‘boost::concepts::EdgeListGraph::~EdgeListGraph() [with G = R_adjacency_list]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/graph_concepts.hpp:226:1: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::EdgeListGraphConcept >]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/kruskal_min_spanning_tree.hpp:56:9: required from ‘void boost::detail::kruskal_mst_impl(const Graph&, OutputIterator, Rank, Parent, Weight) [with Graph = R_adjacency_list; OutputIterator = std::back_insert_iterator > >; Rank = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>; Parent = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>; Weight = boost::adj_list_edge_property_map, boost::edge_weight_t>]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/kruskal_min_spanning_tree.hpp:112:29: required from ‘void boost::kruskal_minimum_spanning_tree(const Graph&, OutputIterator) [with Graph = R_adjacency_list; OutputIterator = std::back_insert_iterator > >]’ minST.cpp:54:38: required from here /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::concepts::MultiPassInputIterator > >, boost::detail::edge_desc_impl, long int> >]’ 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ^ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::MultiPassInputIterator > >, boost::detail::edge_desc_impl, long int> >]’: /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/graph_concepts.hpp:235:9: required from ‘boost::concepts::EdgeListGraph::~EdgeListGraph() [with G = R_adjacency_list]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/graph_concepts.hpp:226:1: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::EdgeListGraphConcept >]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/kruskal_min_spanning_tree.hpp:56:9: required from ‘void boost::detail::kruskal_mst_impl(const Graph&, OutputIterator, Rank, Parent, Weight) [with Graph = R_adjacency_list; OutputIterator = std::back_insert_iterator > >; Rank = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>; Parent = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>; Weight = boost::adj_list_edge_property_map, boost::edge_weight_t>]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/kruskal_min_spanning_tree.hpp:112:29: required from ‘void boost::kruskal_minimum_spanning_tree(const Graph&, OutputIterator) [with Graph = R_adjacency_list; OutputIterator = std::back_insert_iterator > >]’ minST.cpp:54:38: required from here /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::concepts::MultiPassInputIterator::~MultiPassInputIterator() [with T = boost::detail::undirected_edge_iter > >, boost::detail::edge_desc_impl, long int>]’ 37 | ~model() | ^ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/graph_concepts.hpp:52:50: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 52 | BOOST_concept(MultiPassInputIterator, (T)) { BOOST_CONCEPT_USAGE( | ^~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements > >]’: /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:137:5: required from ‘struct boost::DefaultConstructible >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::DefaultConstructible >]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied > >::value’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied > >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_ >)>’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/graph_concepts.hpp:90:9: required from ‘boost::concepts::EdgeListGraph::~EdgeListGraph() [with G = R_adjacency_list]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/graph_concepts.hpp:226:1: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::EdgeListGraphConcept >]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/kruskal_min_spanning_tree.hpp:56:9: required from ‘void boost::detail::kruskal_mst_impl(const Graph&, OutputIterator, Rank, Parent, Weight) [with Graph = R_adjacency_list; OutputIterator = std::back_insert_iterator > >; Rank = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>; Parent = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>; Weight = boost::adj_list_edge_property_map, boost::edge_weight_t>]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/kruskal_min_spanning_tree.hpp:112:29: required from ‘void boost::kruskal_minimum_spanning_tree(const Graph&, OutputIterator) [with Graph = R_adjacency_list; OutputIterator = std::back_insert_iterator > >]’ minST.cpp:54:38: required from here /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::DefaultConstructible >]’ 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ^ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::DefaultConstructible >]’: /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/graph_concepts.hpp:90:9: required from ‘boost::concepts::EdgeListGraph::~EdgeListGraph() [with G = R_adjacency_list]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/graph_concepts.hpp:226:1: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::EdgeListGraphConcept >]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/kruskal_min_spanning_tree.hpp:56:9: required from ‘void boost::detail::kruskal_mst_impl(const Graph&, OutputIterator, Rank, Parent, Weight) [with Graph = R_adjacency_list; OutputIterator = std::back_insert_iterator > >; Rank = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>; Parent = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>; Weight = boost::adj_list_edge_property_map, boost::edge_weight_t>]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/kruskal_min_spanning_tree.hpp:112:29: required from ‘void boost::kruskal_minimum_spanning_tree(const Graph&, OutputIterator) [with Graph = R_adjacency_list; OutputIterator = std::back_insert_iterator > >]’ minST.cpp:54:38: required from here /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::DefaultConstructible::~DefaultConstructible() [with TT = boost::detail::edge_desc_impl]’ 37 | ~model() | ^ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:137:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 137 | BOOST_CONCEPT_USAGE(DefaultConstructible) { | ^~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements > >]’: /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:233:5: required from ‘struct boost::EqualityComparable >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::EqualityComparable >]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied > >::value’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied > >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_ >)>’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/graph_concepts.hpp:91:9: required from ‘boost::concepts::EdgeListGraph::~EdgeListGraph() [with G = R_adjacency_list]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/graph_concepts.hpp:226:1: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::EdgeListGraphConcept >]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/kruskal_min_spanning_tree.hpp:56:9: required from ‘void boost::detail::kruskal_mst_impl(const Graph&, OutputIterator, Rank, Parent, Weight) [with Graph = R_adjacency_list; OutputIterator = std::back_insert_iterator > >; Rank = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>; Parent = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>; Weight = boost::adj_list_edge_property_map, boost::edge_weight_t>]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/kruskal_min_spanning_tree.hpp:112:29: required from ‘void boost::kruskal_minimum_spanning_tree(const Graph&, OutputIterator) [with Graph = R_adjacency_list; OutputIterator = std::back_insert_iterator > >]’ minST.cpp:54:38: required from here /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::EqualityComparable >]’ 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ^ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::EqualityComparable >]’: /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/graph_concepts.hpp:91:9: required from ‘boost::concepts::EdgeListGraph::~EdgeListGraph() [with G = R_adjacency_list]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/graph_concepts.hpp:226:1: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::EdgeListGraphConcept >]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/kruskal_min_spanning_tree.hpp:56:9: required from ‘void boost::detail::kruskal_mst_impl(const Graph&, OutputIterator, Rank, Parent, Weight) [with Graph = R_adjacency_list; OutputIterator = std::back_insert_iterator > >; Rank = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>; Parent = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>; Weight = boost::adj_list_edge_property_map, boost::edge_weight_t>]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/kruskal_min_spanning_tree.hpp:112:29: required from ‘void boost::kruskal_minimum_spanning_tree(const Graph&, OutputIterator) [with Graph = R_adjacency_list; OutputIterator = std::back_insert_iterator > >]’ minST.cpp:54:38: required from here /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::EqualityComparable::~EqualityComparable() [with TT = boost::detail::edge_desc_impl]’ 37 | ~model() | ^ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:233:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 233 | BOOST_CONCEPT_USAGE(EqualityComparable) { | ^~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements > >]’: /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:145:5: required from ‘struct boost::Assignable >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::Assignable >]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied > >::value’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied > >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_ >)>’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/graph_concepts.hpp:92:9: required from ‘boost::concepts::EdgeListGraph::~EdgeListGraph() [with G = R_adjacency_list]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/graph_concepts.hpp:226:1: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::EdgeListGraphConcept >]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/kruskal_min_spanning_tree.hpp:56:9: required from ‘void boost::detail::kruskal_mst_impl(const Graph&, OutputIterator, Rank, Parent, Weight) [with Graph = R_adjacency_list; OutputIterator = std::back_insert_iterator > >; Rank = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>; Parent = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>; Weight = boost::adj_list_edge_property_map, boost::edge_weight_t>]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/kruskal_min_spanning_tree.hpp:112:29: required from ‘void boost::kruskal_minimum_spanning_tree(const Graph&, OutputIterator) [with Graph = R_adjacency_list; OutputIterator = std::back_insert_iterator > >]’ minST.cpp:54:38: required from here /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::Assignable >]’ 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ^ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::Assignable >]’: /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/graph_concepts.hpp:92:9: required from ‘boost::concepts::EdgeListGraph::~EdgeListGraph() [with G = R_adjacency_list]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/graph_concepts.hpp:226:1: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::EdgeListGraphConcept >]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/kruskal_min_spanning_tree.hpp:56:9: required from ‘void boost::detail::kruskal_mst_impl(const Graph&, OutputIterator, Rank, Parent, Weight) [with Graph = R_adjacency_list; OutputIterator = std::back_insert_iterator > >; Rank = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>; Parent = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>; Weight = boost::adj_list_edge_property_map, boost::edge_weight_t>]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/kruskal_min_spanning_tree.hpp:112:29: required from ‘void boost::kruskal_minimum_spanning_tree(const Graph&, OutputIterator) [with Graph = R_adjacency_list; OutputIterator = std::back_insert_iterator > >]’ minST.cpp:54:38: required from here /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::Assignable::~Assignable() [with TT = boost::detail::edge_desc_impl]’ 37 | ~model() | ^ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:145:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 145 | BOOST_CONCEPT_USAGE(Assignable) { | ^~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements >]’: /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:208:5: required from ‘struct boost::Convertible’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::Convertible]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied >::value’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_)>’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/graph_concepts.hpp:239:9: required from ‘boost::concepts::EdgeListGraph::~EdgeListGraph() [with G = R_adjacency_list]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/graph_concepts.hpp:226:1: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::EdgeListGraphConcept >]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/kruskal_min_spanning_tree.hpp:56:9: required from ‘void boost::detail::kruskal_mst_impl(const Graph&, OutputIterator, Rank, Parent, Weight) [with Graph = R_adjacency_list; OutputIterator = std::back_insert_iterator > >; Rank = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>; Parent = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>; Weight = boost::adj_list_edge_property_map, boost::edge_weight_t>]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/kruskal_min_spanning_tree.hpp:112:29: required from ‘void boost::kruskal_minimum_spanning_tree(const Graph&, OutputIterator) [with Graph = R_adjacency_list; OutputIterator = std::back_insert_iterator > >]’ minST.cpp:54:38: required from here /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::Convertible]’ 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ^ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::Convertible]’: /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/graph_concepts.hpp:239:9: required from ‘boost::concepts::EdgeListGraph::~EdgeListGraph() [with G = R_adjacency_list]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/graph_concepts.hpp:226:1: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::EdgeListGraphConcept >]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/kruskal_min_spanning_tree.hpp:56:9: required from ‘void boost::detail::kruskal_mst_impl(const Graph&, OutputIterator, Rank, Parent, Weight) [with Graph = R_adjacency_list; OutputIterator = std::back_insert_iterator > >; Rank = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>; Parent = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>; Weight = boost::adj_list_edge_property_map, boost::edge_weight_t>]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/kruskal_min_spanning_tree.hpp:112:29: required from ‘void boost::kruskal_minimum_spanning_tree(const Graph&, OutputIterator) [with Graph = R_adjacency_list; OutputIterator = std::back_insert_iterator > >]’ minST.cpp:54:38: required from here /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::Convertible::~Convertible() [with X = boost::undir_adj_list_traversal_tag; Y = boost::edge_list_graph_tag]’ 37 | ~model() | ^ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:208:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 208 | BOOST_CONCEPT_USAGE(Convertible) { | ^~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::SignedInteger]’: /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:514:9: required from ‘boost::InputIterator::~InputIterator() [with TT = __gnu_cxx::__normal_iterator >]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/usage.hpp:20:48: required from ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::InputIterator<__gnu_cxx::__normal_iterator > >]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements > > >]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:512:7: required from ‘struct boost::InputIterator<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:540:3: required from ‘struct boost::ForwardIterator<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:568:3: [ skipping 4 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied > > >::value’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied > > >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_ > >)>’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/property_map/property_map.hpp:354:5: required from ‘boost::iterator_property_map boost::make_iterator_property_map(RAIter, ID, Value) [with RAIter = __gnu_cxx::__normal_iterator >; Value = long unsigned int; ID = vec_adj_list_vertex_id_map, long unsigned int>]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/kruskal_min_spanning_tree.hpp:113:35: required from ‘void boost::kruskal_minimum_spanning_tree(const Graph&, OutputIterator) [with Graph = R_adjacency_list; OutputIterator = std::back_insert_iterator > >]’ minST.cpp:20:38: required from here /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:107:22: note: in a call to non-static member function ‘boost::SignedInteger::~SignedInteger()’ 107 | template <> struct SignedInteger {}; | ^~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements >]’: /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:208:5: required from ‘struct boost::Convertible’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::Convertible]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied >::value’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_)>’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:515:9: [ skipping 9 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied > > >::value’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied > > >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_ > >)>’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/property_map/property_map.hpp:354:5: required from ‘boost::iterator_property_map boost::make_iterator_property_map(RAIter, ID, Value) [with RAIter = __gnu_cxx::__normal_iterator >; Value = long unsigned int; ID = vec_adj_list_vertex_id_map, long unsigned int>]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/kruskal_min_spanning_tree.hpp:113:35: required from ‘void boost::kruskal_minimum_spanning_tree(const Graph&, OutputIterator) [with Graph = R_adjacency_list; OutputIterator = std::back_insert_iterator > >]’ minST.cpp:20:38: required from here /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::Convertible]’ 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ^ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::Convertible]’: /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:515:9: required from ‘boost::InputIterator::~InputIterator() [with TT = __gnu_cxx::__normal_iterator >]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/usage.hpp:20:48: required from ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::InputIterator<__gnu_cxx::__normal_iterator > >]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements > > >]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:512:7: required from ‘struct boost::InputIterator<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:540:3: required from ‘struct boost::ForwardIterator<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:568:3: [ skipping 4 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied > > >::value’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied > > >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_ > >)>’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/property_map/property_map.hpp:354:5: required from ‘boost::iterator_property_map boost::make_iterator_property_map(RAIter, ID, Value) [with RAIter = __gnu_cxx::__normal_iterator >; Value = long unsigned int; ID = vec_adj_list_vertex_id_map, long unsigned int>]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/kruskal_min_spanning_tree.hpp:113:35: required from ‘void boost::kruskal_minimum_spanning_tree(const Graph&, OutputIterator) [with Graph = R_adjacency_list; OutputIterator = std::back_insert_iterator > >]’ minST.cpp:20:38: required from here /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::Convertible::~Convertible() [with X = std::random_access_iterator_tag; Y = std::input_iterator_tag]’ 37 | ~model() | ^ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:208:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 208 | BOOST_CONCEPT_USAGE(Convertible) { | ^~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements >]’: /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:208:5: required from ‘struct boost::Convertible’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::Convertible]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied >::value’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_)>’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:545:11: [ skipping 8 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied > > >::value’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied > > >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_ > >)>’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/property_map/property_map.hpp:354:5: required from ‘boost::iterator_property_map boost::make_iterator_property_map(RAIter, ID, Value) [with RAIter = __gnu_cxx::__normal_iterator >; Value = long unsigned int; ID = vec_adj_list_vertex_id_map, long unsigned int>]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/kruskal_min_spanning_tree.hpp:113:35: required from ‘void boost::kruskal_minimum_spanning_tree(const Graph&, OutputIterator) [with Graph = R_adjacency_list; OutputIterator = std::back_insert_iterator > >]’ minST.cpp:20:38: required from here /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::Convertible]’ 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ^ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::Convertible]’: /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:545:11: required from ‘boost::ForwardIterator::~ForwardIterator() [with TT = __gnu_cxx::__normal_iterator >]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/usage.hpp:20:48: required from ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::ForwardIterator<__gnu_cxx::__normal_iterator > >]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements > > >]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:543:7: required from ‘struct boost::ForwardIterator<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:568:3: required from ‘struct boost::BidirectionalIterator<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:597:3: [ skipping 3 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied > > >::value’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied > > >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_ > >)>’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/property_map/property_map.hpp:354:5: required from ‘boost::iterator_property_map boost::make_iterator_property_map(RAIter, ID, Value) [with RAIter = __gnu_cxx::__normal_iterator >; Value = long unsigned int; ID = vec_adj_list_vertex_id_map, long unsigned int>]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/kruskal_min_spanning_tree.hpp:113:35: required from ‘void boost::kruskal_minimum_spanning_tree(const Graph&, OutputIterator) [with Graph = R_adjacency_list; OutputIterator = std::back_insert_iterator > >]’ minST.cpp:20:38: required from here /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::Convertible::~Convertible() [with X = std::random_access_iterator_tag; Y = std::forward_iterator_tag]’ 37 | ~model() | ^ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:208:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 208 | BOOST_CONCEPT_USAGE(Convertible) { | ^~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements >]’: /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:208:5: required from ‘struct boost::Convertible’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::Convertible]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied >::value’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_)>’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:573:11: [ skipping 7 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied > > >::value’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied > > >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_ > >)>’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/property_map/property_map.hpp:354:5: required from ‘boost::iterator_property_map boost::make_iterator_property_map(RAIter, ID, Value) [with RAIter = __gnu_cxx::__normal_iterator >; Value = long unsigned int; ID = vec_adj_list_vertex_id_map, long unsigned int>]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/kruskal_min_spanning_tree.hpp:113:35: required from ‘void boost::kruskal_minimum_spanning_tree(const Graph&, OutputIterator) [with Graph = R_adjacency_list; OutputIterator = std::back_insert_iterator > >]’ minST.cpp:20:38: required from here /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::Convertible]’ 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ^ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::Convertible]’: /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:573:11: required from ‘boost::BidirectionalIterator::~BidirectionalIterator() [with TT = __gnu_cxx::__normal_iterator >]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/usage.hpp:20:48: required from ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::BidirectionalIterator<__gnu_cxx::__normal_iterator > >]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements > > >]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:571:7: required from ‘struct boost::BidirectionalIterator<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:597:3: required from ‘struct boost::RandomAccessIterator<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:597:3: [ skipping 2 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied > > >::value’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied > > >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_ > >)>’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/property_map/property_map.hpp:354:5: required from ‘boost::iterator_property_map boost::make_iterator_property_map(RAIter, ID, Value) [with RAIter = __gnu_cxx::__normal_iterator >; Value = long unsigned int; ID = vec_adj_list_vertex_id_map, long unsigned int>]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/kruskal_min_spanning_tree.hpp:113:35: required from ‘void boost::kruskal_minimum_spanning_tree(const Graph&, OutputIterator) [with Graph = R_adjacency_list; OutputIterator = std::back_insert_iterator > >]’ minST.cpp:20:38: required from here /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::Convertible::~Convertible() [with X = std::random_access_iterator_tag; Y = std::bidirectional_iterator_tag]’ 37 | ~model() | ^ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:208:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 208 | BOOST_CONCEPT_USAGE(Convertible) { | ^~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::Convertible]’: /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements >]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:208:5: required from ‘struct boost::Convertible’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::Convertible]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied >::value’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_)>’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:603:11: required from ‘boost::RandomAccessIterator::~RandomAccessIterator() [with TT = __gnu_cxx::__normal_iterator >]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:597:3: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator > >]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/property_map/property_map.hpp:354:5: required from ‘boost::iterator_property_map boost::make_iterator_property_map(RAIter, ID, Value) [with RAIter = __gnu_cxx::__normal_iterator >; Value = long unsigned int; ID = vec_adj_list_vertex_id_map, long unsigned int>]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/kruskal_min_spanning_tree.hpp:113:35: required from ‘void boost::kruskal_minimum_spanning_tree(const Graph&, OutputIterator) [with Graph = R_adjacency_list; OutputIterator = std::back_insert_iterator > >]’ minST.cpp:20:38: required from here /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::Convertible::~Convertible() [with X = std::random_access_iterator_tag; Y = std::random_access_iterator_tag]’ 37 | ~model() | ^ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:208:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 208 | BOOST_CONCEPT_USAGE(Convertible) { | ^~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements >]’: /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:137:5: required from ‘struct boost::DefaultConstructible’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::DefaultConstructible]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied >::value’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_)>’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/graph_concepts.hpp:68:9: [ skipping 7 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied > >::value’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied > >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_ >)>’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/kruskal_min_spanning_tree.hpp:55:9: required from ‘void boost::detail::kruskal_mst_impl(const Graph&, OutputIterator, Rank, Parent, Weight) [with Graph = R_adjacency_list; OutputIterator = std::back_insert_iterator > >; Rank = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>; Parent = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>; Weight = boost::adj_list_edge_property_map, boost::edge_weight_t>]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/kruskal_min_spanning_tree.hpp:112:29: required from ‘void boost::kruskal_minimum_spanning_tree(const Graph&, OutputIterator) [with Graph = R_adjacency_list; OutputIterator = std::back_insert_iterator > >]’ minST.cpp:20:38: required from here /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::DefaultConstructible]’ 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ^ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::DefaultConstructible]’: /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/graph_concepts.hpp:68:9: required from ‘boost::concepts::Graph::~Graph() [with G = R_adjacency_list]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/usage.hpp:20:48: required from ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::concepts::Graph >]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements > >]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/graph_concepts.hpp:66:5: required from ‘struct boost::concepts::Graph >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/graph_concepts.hpp:176:1: required from ‘struct boost::concepts::VertexListGraph >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/graph_concepts.hpp:176:1: [ skipping 2 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied > >::value’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied > >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_ >)>’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/kruskal_min_spanning_tree.hpp:55:9: required from ‘void boost::detail::kruskal_mst_impl(const Graph&, OutputIterator, Rank, Parent, Weight) [with Graph = R_adjacency_list; OutputIterator = std::back_insert_iterator > >; Rank = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>; Parent = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>; Weight = boost::adj_list_edge_property_map, boost::edge_weight_t>]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/kruskal_min_spanning_tree.hpp:112:29: required from ‘void boost::kruskal_minimum_spanning_tree(const Graph&, OutputIterator) [with Graph = R_adjacency_list; OutputIterator = std::back_insert_iterator > >]’ minST.cpp:20:38: required from here /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::DefaultConstructible::~DefaultConstructible() [with TT = long unsigned int]’ 37 | ~model() | ^ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:137:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 137 | BOOST_CONCEPT_USAGE(DefaultConstructible) { | ^~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements >]’: /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:233:5: required from ‘struct boost::EqualityComparable’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::EqualityComparable]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied >::value’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_)>’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/graph_concepts.hpp:69:9: [ skipping 7 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied > >::value’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied > >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_ >)>’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/kruskal_min_spanning_tree.hpp:55:9: required from ‘void boost::detail::kruskal_mst_impl(const Graph&, OutputIterator, Rank, Parent, Weight) [with Graph = R_adjacency_list; OutputIterator = std::back_insert_iterator > >; Rank = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>; Parent = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>; Weight = boost::adj_list_edge_property_map, boost::edge_weight_t>]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/kruskal_min_spanning_tree.hpp:112:29: required from ‘void boost::kruskal_minimum_spanning_tree(const Graph&, OutputIterator) [with Graph = R_adjacency_list; OutputIterator = std::back_insert_iterator > >]’ minST.cpp:20:38: required from here /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::EqualityComparable]’ 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ^ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::EqualityComparable]’: /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/graph_concepts.hpp:69:9: required from ‘boost::concepts::Graph::~Graph() [with G = R_adjacency_list]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/usage.hpp:20:48: required from ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::concepts::Graph >]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements > >]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/graph_concepts.hpp:66:5: required from ‘struct boost::concepts::Graph >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/graph_concepts.hpp:176:1: required from ‘struct boost::concepts::VertexListGraph >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/graph_concepts.hpp:176:1: [ skipping 2 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied > >::value’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied > >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_ >)>’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/kruskal_min_spanning_tree.hpp:55:9: required from ‘void boost::detail::kruskal_mst_impl(const Graph&, OutputIterator, Rank, Parent, Weight) [with Graph = R_adjacency_list; OutputIterator = std::back_insert_iterator > >; Rank = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>; Parent = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>; Weight = boost::adj_list_edge_property_map, boost::edge_weight_t>]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/kruskal_min_spanning_tree.hpp:112:29: required from ‘void boost::kruskal_minimum_spanning_tree(const Graph&, OutputIterator) [with Graph = R_adjacency_list; OutputIterator = std::back_insert_iterator > >]’ minST.cpp:20:38: required from here /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::EqualityComparable::~EqualityComparable() [with TT = long unsigned int]’ 37 | ~model() | ^ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:233:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 233 | BOOST_CONCEPT_USAGE(EqualityComparable) { | ^~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements >]’: /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:145:5: required from ‘struct boost::Assignable’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::Assignable]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied >::value’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_)>’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/graph_concepts.hpp:70:9: [ skipping 7 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied > >::value’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied > >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_ >)>’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/kruskal_min_spanning_tree.hpp:55:9: required from ‘void boost::detail::kruskal_mst_impl(const Graph&, OutputIterator, Rank, Parent, Weight) [with Graph = R_adjacency_list; OutputIterator = std::back_insert_iterator > >; Rank = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>; Parent = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>; Weight = boost::adj_list_edge_property_map, boost::edge_weight_t>]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/kruskal_min_spanning_tree.hpp:112:29: required from ‘void boost::kruskal_minimum_spanning_tree(const Graph&, OutputIterator) [with Graph = R_adjacency_list; OutputIterator = std::back_insert_iterator > >]’ minST.cpp:20:38: required from here /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::Assignable]’ 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ^ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::Assignable]’: /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/graph_concepts.hpp:70:9: required from ‘boost::concepts::Graph::~Graph() [with G = R_adjacency_list]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/usage.hpp:20:48: required from ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::concepts::Graph >]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements > >]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/graph_concepts.hpp:66:5: required from ‘struct boost::concepts::Graph >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/graph_concepts.hpp:176:1: required from ‘struct boost::concepts::VertexListGraph >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/graph_concepts.hpp:176:1: [ skipping 2 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied > >::value’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied > >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_ >)>’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/kruskal_min_spanning_tree.hpp:55:9: required from ‘void boost::detail::kruskal_mst_impl(const Graph&, OutputIterator, Rank, Parent, Weight) [with Graph = R_adjacency_list; OutputIterator = std::back_insert_iterator > >; Rank = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>; Parent = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>; Weight = boost::adj_list_edge_property_map, boost::edge_weight_t>]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/kruskal_min_spanning_tree.hpp:112:29: required from ‘void boost::kruskal_minimum_spanning_tree(const Graph&, OutputIterator) [with Graph = R_adjacency_list; OutputIterator = std::back_insert_iterator > >]’ minST.cpp:20:38: required from here /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::Assignable::~Assignable() [with TT = long unsigned int]’ 37 | ~model() | ^ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:145:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 145 | BOOST_CONCEPT_USAGE(Assignable) { | ^~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::concepts::MultiPassInputIterator >]’: /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements > >]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/graph_concepts.hpp:52:50: required from ‘struct boost::concepts::MultiPassInputIterator >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::concepts::MultiPassInputIterator >]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied > >::value’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied > >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_ >)>’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/graph_concepts.hpp:184:9: required from ‘boost::concepts::VertexListGraph::~VertexListGraph() [with G = R_adjacency_list]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/graph_concepts.hpp:176:1: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::VertexListGraphConcept >]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/kruskal_min_spanning_tree.hpp:55:9: required from ‘void boost::detail::kruskal_mst_impl(const Graph&, OutputIterator, Rank, Parent, Weight) [with Graph = R_adjacency_list; OutputIterator = std::back_insert_iterator > >; Rank = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>; Parent = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>; Weight = boost::adj_list_edge_property_map, boost::edge_weight_t>]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/kruskal_min_spanning_tree.hpp:112:29: required from ‘void boost::kruskal_minimum_spanning_tree(const Graph&, OutputIterator) [with Graph = R_adjacency_list; OutputIterator = std::back_insert_iterator > >]’ minST.cpp:20:38: required from here /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::concepts::MultiPassInputIterator::~MultiPassInputIterator() [with T = boost::range_detail::integer_iterator]’ 37 | ~model() | ^ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/graph_concepts.hpp:52:50: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 52 | BOOST_concept(MultiPassInputIterator, (T)) { BOOST_CONCEPT_USAGE( | ^~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::Convertible]’: /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements >]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:208:5: required from ‘struct boost::Convertible’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::Convertible]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied >::value’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_)>’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/graph_concepts.hpp:185:9: required from ‘boost::concepts::VertexListGraph::~VertexListGraph() [with G = R_adjacency_list]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/graph_concepts.hpp:176:1: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::VertexListGraphConcept >]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/kruskal_min_spanning_tree.hpp:55:9: required from ‘void boost::detail::kruskal_mst_impl(const Graph&, OutputIterator, Rank, Parent, Weight) [with Graph = R_adjacency_list; OutputIterator = std::back_insert_iterator > >; Rank = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>; Parent = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>; Weight = boost::adj_list_edge_property_map, boost::edge_weight_t>]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/kruskal_min_spanning_tree.hpp:112:29: required from ‘void boost::kruskal_minimum_spanning_tree(const Graph&, OutputIterator) [with Graph = R_adjacency_list; OutputIterator = std::back_insert_iterator > >]’ minST.cpp:20:38: required from here /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::Convertible::~Convertible() [with X = boost::adj_list_dir_traversal_tag; Y = boost::vertex_list_graph_tag]’ 37 | ~model() | ^ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:208:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 208 | BOOST_CONCEPT_USAGE(Convertible) { | ^~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::concepts::MultiPassInputIterator, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator >*, std::vector >, std::allocator > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::adjacency_list, boost::property, boost::no_property, boost::listS> > >]’: /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator >*, std::vector >, std::allocator > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::adjacency_list, boost::property, boost::no_property, boost::listS> > > >]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/graph_concepts.hpp:52:50: required from ‘struct boost::concepts::MultiPassInputIterator, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator >*, std::vector >, std::allocator > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::adjacency_list, boost::property, boost::no_property, boost::listS> > >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::concepts::MultiPassInputIterator, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator >*, std::vector >, std::allocator > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::adjacency_list, boost::property, boost::no_property, boost::listS> > >]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator >*, std::vector >, std::allocator > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::adjacency_list, boost::property, boost::no_property, boost::listS> > > >::value’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator >*, std::vector >, std::allocator > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::adjacency_list, boost::property, boost::no_property, boost::listS> > > >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator >*, std::vector >, std::allocator > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::adjacency_list, boost::property, boost::no_property, boost::listS> > >)>’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/graph_concepts.hpp:235:9: required from ‘boost::concepts::EdgeListGraph::~EdgeListGraph() [with G = R_adjacency_list]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/graph_concepts.hpp:226:1: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::EdgeListGraphConcept >]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/kruskal_min_spanning_tree.hpp:56:9: required from ‘void boost::detail::kruskal_mst_impl(const Graph&, OutputIterator, Rank, Parent, Weight) [with Graph = R_adjacency_list; OutputIterator = std::back_insert_iterator > >; Rank = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>; Parent = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>; Weight = boost::adj_list_edge_property_map, boost::edge_weight_t>]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/kruskal_min_spanning_tree.hpp:112:29: required from ‘void boost::kruskal_minimum_spanning_tree(const Graph&, OutputIterator) [with Graph = R_adjacency_list; OutputIterator = std::back_insert_iterator > >]’ minST.cpp:20:38: required from here /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::concepts::MultiPassInputIterator::~MultiPassInputIterator() [with T = boost::detail::adj_list_edge_iterator, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator >*, std::vector >, std::allocator > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::adjacency_list, boost::property, boost::no_property, boost::listS> >]’ 37 | ~model() | ^ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/graph_concepts.hpp:52:50: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 52 | BOOST_concept(MultiPassInputIterator, (T)) { BOOST_CONCEPT_USAGE( | ^~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::DefaultConstructible >]’: /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements > >]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:137:5: required from ‘struct boost::DefaultConstructible >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::DefaultConstructible >]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied > >::value’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied > >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_ >)>’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/graph_concepts.hpp:90:9: required from ‘boost::concepts::EdgeListGraph::~EdgeListGraph() [with G = R_adjacency_list]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/graph_concepts.hpp:226:1: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::EdgeListGraphConcept >]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/kruskal_min_spanning_tree.hpp:56:9: required from ‘void boost::detail::kruskal_mst_impl(const Graph&, OutputIterator, Rank, Parent, Weight) [with Graph = R_adjacency_list; OutputIterator = std::back_insert_iterator > >; Rank = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>; Parent = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>; Weight = boost::adj_list_edge_property_map, boost::edge_weight_t>]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/kruskal_min_spanning_tree.hpp:112:29: required from ‘void boost::kruskal_minimum_spanning_tree(const Graph&, OutputIterator) [with Graph = R_adjacency_list; OutputIterator = std::back_insert_iterator > >]’ minST.cpp:20:38: required from here /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::DefaultConstructible::~DefaultConstructible() [with TT = boost::detail::edge_desc_impl]’ 37 | ~model() | ^ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:137:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 137 | BOOST_CONCEPT_USAGE(DefaultConstructible) { | ^~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::EqualityComparable >]’: /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements > >]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:233:5: required from ‘struct boost::EqualityComparable >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::EqualityComparable >]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied > >::value’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied > >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_ >)>’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/graph_concepts.hpp:91:9: required from ‘boost::concepts::EdgeListGraph::~EdgeListGraph() [with G = R_adjacency_list]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/graph_concepts.hpp:226:1: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::EdgeListGraphConcept >]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/kruskal_min_spanning_tree.hpp:56:9: required from ‘void boost::detail::kruskal_mst_impl(const Graph&, OutputIterator, Rank, Parent, Weight) [with Graph = R_adjacency_list; OutputIterator = std::back_insert_iterator > >; Rank = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>; Parent = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>; Weight = boost::adj_list_edge_property_map, boost::edge_weight_t>]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/kruskal_min_spanning_tree.hpp:112:29: required from ‘void boost::kruskal_minimum_spanning_tree(const Graph&, OutputIterator) [with Graph = R_adjacency_list; OutputIterator = std::back_insert_iterator > >]’ minST.cpp:20:38: required from here /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::EqualityComparable::~EqualityComparable() [with TT = boost::detail::edge_desc_impl]’ 37 | ~model() | ^ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:233:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 233 | BOOST_CONCEPT_USAGE(EqualityComparable) { | ^~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::Assignable >]’: /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements > >]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:145:5: required from ‘struct boost::Assignable >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::Assignable >]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied > >::value’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied > >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_ >)>’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/graph_concepts.hpp:92:9: required from ‘boost::concepts::EdgeListGraph::~EdgeListGraph() [with G = R_adjacency_list]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/graph_concepts.hpp:226:1: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::EdgeListGraphConcept >]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/kruskal_min_spanning_tree.hpp:56:9: required from ‘void boost::detail::kruskal_mst_impl(const Graph&, OutputIterator, Rank, Parent, Weight) [with Graph = R_adjacency_list; OutputIterator = std::back_insert_iterator > >; Rank = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>; Parent = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>; Weight = boost::adj_list_edge_property_map, boost::edge_weight_t>]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/kruskal_min_spanning_tree.hpp:112:29: required from ‘void boost::kruskal_minimum_spanning_tree(const Graph&, OutputIterator) [with Graph = R_adjacency_list; OutputIterator = std::back_insert_iterator > >]’ minST.cpp:20:38: required from here /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::Assignable::~Assignable() [with TT = boost::detail::edge_desc_impl]’ 37 | ~model() | ^ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:145:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 145 | BOOST_CONCEPT_USAGE(Assignable) { | ^~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::Convertible]’: /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements >]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:208:5: required from ‘struct boost::Convertible’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::Convertible]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied >::value’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_)>’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/graph_concepts.hpp:239:9: required from ‘boost::concepts::EdgeListGraph::~EdgeListGraph() [with G = R_adjacency_list]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/graph_concepts.hpp:226:1: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::EdgeListGraphConcept >]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/kruskal_min_spanning_tree.hpp:56:9: required from ‘void boost::detail::kruskal_mst_impl(const Graph&, OutputIterator, Rank, Parent, Weight) [with Graph = R_adjacency_list; OutputIterator = std::back_insert_iterator > >; Rank = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>; Parent = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>; Weight = boost::adj_list_edge_property_map, boost::edge_weight_t>]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/kruskal_min_spanning_tree.hpp:112:29: required from ‘void boost::kruskal_minimum_spanning_tree(const Graph&, OutputIterator) [with Graph = R_adjacency_list; OutputIterator = std::back_insert_iterator > >]’ minST.cpp:20:38: required from here /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::Convertible::~Convertible() [with X = boost::adj_list_dir_traversal_tag; Y = boost::edge_list_graph_tag]’ 37 | ~model() | ^ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:208:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 208 | BOOST_CONCEPT_USAGE(Convertible) { | ^~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::Convertible]’: /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements >]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:208:5: required from ‘struct boost::Convertible’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:206:3: required from ‘struct boost::ConvertibleConcept’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::ConvertibleConcept]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied >::value’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:45:51: [ skipping 9 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>, long unsigned int> >::value’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>, long unsigned int> >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_ >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>, long unsigned int>)>’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/kruskal_min_spanning_tree.hpp:58:9: required from ‘void boost::detail::kruskal_mst_impl(const Graph&, OutputIterator, Rank, Parent, Weight) [with Graph = R_adjacency_list; OutputIterator = std::back_insert_iterator > >; Rank = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>; Parent = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>; Weight = boost::adj_list_edge_property_map, boost::edge_weight_t>]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/kruskal_min_spanning_tree.hpp:112:29: required from ‘void boost::kruskal_minimum_spanning_tree(const Graph&, OutputIterator) [with Graph = R_adjacency_list; OutputIterator = std::back_insert_iterator > >]’ minST.cpp:20:38: required from here /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::Convertible::~Convertible() [with X = boost::lvalue_property_map_tag; Y = boost::writable_property_map_tag]’ 37 | ~model() | ^ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:208:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 208 | BOOST_CONCEPT_USAGE(Convertible) { | ^~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::Convertible]’: /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements >]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:208:5: required from ‘struct boost::Convertible’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::Convertible]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied >::value’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_)>’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/graph_concepts.hpp:185:9: required from ‘boost::concepts::VertexListGraph::~VertexListGraph() [with G = R_adjacency_list]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/graph_concepts.hpp:176:1: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::VertexListGraphConcept >]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/kruskal_min_spanning_tree.hpp:55:9: required from ‘void boost::detail::kruskal_mst_impl(const Graph&, OutputIterator, Rank, Parent, Weight) [with Graph = R_adjacency_list; OutputIterator = std::back_insert_iterator > >; Rank = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>; Parent = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>; Weight = boost::adj_list_edge_property_map, boost::edge_weight_t>]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/kruskal_min_spanning_tree.hpp:112:29: required from ‘void boost::kruskal_minimum_spanning_tree(const Graph&, OutputIterator) [with Graph = R_adjacency_list; OutputIterator = std::back_insert_iterator > >]’ minST.cpp:54:38: required from here /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::Convertible::~Convertible() [with X = boost::undir_adj_list_traversal_tag; Y = boost::vertex_list_graph_tag]’ 37 | ~model() | ^ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:208:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 208 | BOOST_CONCEPT_USAGE(Convertible) { | ^~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::concepts::MultiPassInputIterator > >, boost::detail::edge_desc_impl, long int> >]’: /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements > >, boost::detail::edge_desc_impl, long int> > >]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/graph_concepts.hpp:52:50: required from ‘struct boost::concepts::MultiPassInputIterator > >, boost::detail::edge_desc_impl, long int> >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::concepts::MultiPassInputIterator > >, boost::detail::edge_desc_impl, long int> >]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied > >, boost::detail::edge_desc_impl, long int> > >::value’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied > >, boost::detail::edge_desc_impl, long int> > >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_ > >, boost::detail::edge_desc_impl, long int> >)>’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/graph_concepts.hpp:235:9: required from ‘boost::concepts::EdgeListGraph::~EdgeListGraph() [with G = R_adjacency_list]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/graph_concepts.hpp:226:1: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::EdgeListGraphConcept >]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/kruskal_min_spanning_tree.hpp:56:9: required from ‘void boost::detail::kruskal_mst_impl(const Graph&, OutputIterator, Rank, Parent, Weight) [with Graph = R_adjacency_list; OutputIterator = std::back_insert_iterator > >; Rank = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>; Parent = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>; Weight = boost::adj_list_edge_property_map, boost::edge_weight_t>]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/kruskal_min_spanning_tree.hpp:112:29: required from ‘void boost::kruskal_minimum_spanning_tree(const Graph&, OutputIterator) [with Graph = R_adjacency_list; OutputIterator = std::back_insert_iterator > >]’ minST.cpp:54:38: required from here /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::concepts::MultiPassInputIterator::~MultiPassInputIterator() [with T = boost::detail::undirected_edge_iter > >, boost::detail::edge_desc_impl, long int>]’ 37 | ~model() | ^ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/graph_concepts.hpp:52:50: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 52 | BOOST_concept(MultiPassInputIterator, (T)) { BOOST_CONCEPT_USAGE( | ^~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::DefaultConstructible >]’: /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements > >]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:137:5: required from ‘struct boost::DefaultConstructible >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::DefaultConstructible >]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied > >::value’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied > >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_ >)>’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/graph_concepts.hpp:90:9: required from ‘boost::concepts::EdgeListGraph::~EdgeListGraph() [with G = R_adjacency_list]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/graph_concepts.hpp:226:1: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::EdgeListGraphConcept >]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/kruskal_min_spanning_tree.hpp:56:9: required from ‘void boost::detail::kruskal_mst_impl(const Graph&, OutputIterator, Rank, Parent, Weight) [with Graph = R_adjacency_list; OutputIterator = std::back_insert_iterator > >; Rank = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>; Parent = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>; Weight = boost::adj_list_edge_property_map, boost::edge_weight_t>]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/kruskal_min_spanning_tree.hpp:112:29: required from ‘void boost::kruskal_minimum_spanning_tree(const Graph&, OutputIterator) [with Graph = R_adjacency_list; OutputIterator = std::back_insert_iterator > >]’ minST.cpp:54:38: required from here /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::DefaultConstructible::~DefaultConstructible() [with TT = boost::detail::edge_desc_impl]’ 37 | ~model() | ^ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:137:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 137 | BOOST_CONCEPT_USAGE(DefaultConstructible) { | ^~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::EqualityComparable >]’: /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements > >]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:233:5: required from ‘struct boost::EqualityComparable >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::EqualityComparable >]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied > >::value’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied > >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_ >)>’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/graph_concepts.hpp:91:9: required from ‘boost::concepts::EdgeListGraph::~EdgeListGraph() [with G = R_adjacency_list]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/graph_concepts.hpp:226:1: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::EdgeListGraphConcept >]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/kruskal_min_spanning_tree.hpp:56:9: required from ‘void boost::detail::kruskal_mst_impl(const Graph&, OutputIterator, Rank, Parent, Weight) [with Graph = R_adjacency_list; OutputIterator = std::back_insert_iterator > >; Rank = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>; Parent = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>; Weight = boost::adj_list_edge_property_map, boost::edge_weight_t>]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/kruskal_min_spanning_tree.hpp:112:29: required from ‘void boost::kruskal_minimum_spanning_tree(const Graph&, OutputIterator) [with Graph = R_adjacency_list; OutputIterator = std::back_insert_iterator > >]’ minST.cpp:54:38: required from here /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::EqualityComparable::~EqualityComparable() [with TT = boost::detail::edge_desc_impl]’ 37 | ~model() | ^ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:233:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 233 | BOOST_CONCEPT_USAGE(EqualityComparable) { | ^~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::Assignable >]’: /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements > >]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:145:5: required from ‘struct boost::Assignable >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::Assignable >]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied > >::value’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied > >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_ >)>’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/graph_concepts.hpp:92:9: required from ‘boost::concepts::EdgeListGraph::~EdgeListGraph() [with G = R_adjacency_list]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/graph_concepts.hpp:226:1: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::EdgeListGraphConcept >]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/kruskal_min_spanning_tree.hpp:56:9: required from ‘void boost::detail::kruskal_mst_impl(const Graph&, OutputIterator, Rank, Parent, Weight) [with Graph = R_adjacency_list; OutputIterator = std::back_insert_iterator > >; Rank = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>; Parent = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>; Weight = boost::adj_list_edge_property_map, boost::edge_weight_t>]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/kruskal_min_spanning_tree.hpp:112:29: required from ‘void boost::kruskal_minimum_spanning_tree(const Graph&, OutputIterator) [with Graph = R_adjacency_list; OutputIterator = std::back_insert_iterator > >]’ minST.cpp:54:38: required from here /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::Assignable::~Assignable() [with TT = boost::detail::edge_desc_impl]’ 37 | ~model() | ^ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:145:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 145 | BOOST_CONCEPT_USAGE(Assignable) { | ^~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::Convertible]’: /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements >]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:208:5: required from ‘struct boost::Convertible’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::Convertible]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied >::value’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_)>’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/graph_concepts.hpp:239:9: required from ‘boost::concepts::EdgeListGraph::~EdgeListGraph() [with G = R_adjacency_list]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/graph_concepts.hpp:226:1: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::EdgeListGraphConcept >]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/kruskal_min_spanning_tree.hpp:56:9: required from ‘void boost::detail::kruskal_mst_impl(const Graph&, OutputIterator, Rank, Parent, Weight) [with Graph = R_adjacency_list; OutputIterator = std::back_insert_iterator > >; Rank = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>; Parent = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>; Weight = boost::adj_list_edge_property_map, boost::edge_weight_t>]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/kruskal_min_spanning_tree.hpp:112:29: required from ‘void boost::kruskal_minimum_spanning_tree(const Graph&, OutputIterator) [with Graph = R_adjacency_list; OutputIterator = std::back_insert_iterator > >]’ minST.cpp:54:38: required from here /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::Convertible::~Convertible() [with X = boost::undir_adj_list_traversal_tag; Y = boost::edge_list_graph_tag]’ 37 | ~model() | ^ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:208:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 208 | BOOST_CONCEPT_USAGE(Convertible) { | ^~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements > > > >]’: /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:145:5: required from ‘struct boost::Assignable<__gnu_cxx::__normal_iterator > > >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:502:3: required from ‘struct boost::InputIterator<__gnu_cxx::__normal_iterator > > >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:540:3: required from ‘struct boost::ForwardIterator<__gnu_cxx::__normal_iterator > > >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:568:3: required from ‘struct boost::BidirectionalIterator<__gnu_cxx::__normal_iterator > > >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:597:3: required from ‘struct boost::RandomAccessIterator<__gnu_cxx::__normal_iterator > > >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:597:3: [ skipping 5 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.4-3.20/BH/include/boost/property_map/property_map.hpp:354:5: required from ‘boost::iterator_property_map boost::make_iterator_property_map(RAIter, ID, Value) [with RAIter = __gnu_cxx::__normal_iterator > >; Value = double; ID = vec_adj_list_vertex_id_map, long unsigned int>]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/dijkstra_shortest_paths.hpp:556:43: required from ‘void boost::detail::dijkstra_dispatch1(const VertexListGraph&, typename boost::graph_traits::vertex_descriptor, DistanceMap, WeightMap, IndexMap, const Params&) [with VertexListGraph = R_adjacency_list; DistanceMap = boost::param_not_found; WeightMap = boost::adj_list_edge_property_map, boost::edge_weight_t>; IndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>; Params = boost::bgl_named_params<_project2nd, boost::distance_combine_t, boost::bgl_named_params, boost::distance_compare_t, boost::bgl_named_params, boost::edge_weight_t>, boost::edge_weight_t, boost::bgl_named_params > > >; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/dijkstra_shortest_paths.hpp:570:31: required from ‘void boost::dijkstra_shortest_paths(const VertexListGraph&, typename graph_traits::vertex_descriptor, const bgl_named_params&) [with VertexListGraph = R_adjacency_list; Param = detail::_project2nd; Tag = distance_combine_t; Rest = bgl_named_params, distance_compare_t, bgl_named_params, edge_weight_t>, edge_weight_t, bgl_named_params > >; typename graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/prim_minimum_spanning_tree.hpp:43:32: required from ‘void boost::detail::prim_mst_impl(const Graph&, typename boost::graph_traits::vertex_descriptor, const boost::bgl_named_params&, Weight) [with Graph = R_adjacency_list; P = boost::adj_list_edge_property_map, boost::edge_weight_t>; T = boost::edge_weight_t; R = boost::bgl_named_params; Weight = boost::adj_list_edge_property_map, boost::edge_weight_t>; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/prim_minimum_spanning_tree.hpp:77:26: required from ‘void boost::prim_minimum_spanning_tree(const VertexListGraph&, PredecessorMap) [with VertexListGraph = R_adjacency_list; PredecessorMap = long unsigned int*]’ minST.cpp:89:35: required from here /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::Assignable<__gnu_cxx::__normal_iterator > > >]’ 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ^ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements > > > >]’: /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:233:5: required from ‘struct boost::EqualityComparable<__gnu_cxx::__normal_iterator > > >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:502:3: required from ‘struct boost::InputIterator<__gnu_cxx::__normal_iterator > > >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:540:3: required from ‘struct boost::ForwardIterator<__gnu_cxx::__normal_iterator > > >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:568:3: required from ‘struct boost::BidirectionalIterator<__gnu_cxx::__normal_iterator > > >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:597:3: required from ‘struct boost::RandomAccessIterator<__gnu_cxx::__normal_iterator > > >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:597:3: [ skipping 5 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.4-3.20/BH/include/boost/property_map/property_map.hpp:354:5: required from ‘boost::iterator_property_map boost::make_iterator_property_map(RAIter, ID, Value) [with RAIter = __gnu_cxx::__normal_iterator > >; Value = double; ID = vec_adj_list_vertex_id_map, long unsigned int>]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/dijkstra_shortest_paths.hpp:556:43: required from ‘void boost::detail::dijkstra_dispatch1(const VertexListGraph&, typename boost::graph_traits::vertex_descriptor, DistanceMap, WeightMap, IndexMap, const Params&) [with VertexListGraph = R_adjacency_list; DistanceMap = boost::param_not_found; WeightMap = boost::adj_list_edge_property_map, boost::edge_weight_t>; IndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>; Params = boost::bgl_named_params<_project2nd, boost::distance_combine_t, boost::bgl_named_params, boost::distance_compare_t, boost::bgl_named_params, boost::edge_weight_t>, boost::edge_weight_t, boost::bgl_named_params > > >; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/dijkstra_shortest_paths.hpp:570:31: required from ‘void boost::dijkstra_shortest_paths(const VertexListGraph&, typename graph_traits::vertex_descriptor, const bgl_named_params&) [with VertexListGraph = R_adjacency_list; Param = detail::_project2nd; Tag = distance_combine_t; Rest = bgl_named_params, distance_compare_t, bgl_named_params, edge_weight_t>, edge_weight_t, bgl_named_params > >; typename graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/prim_minimum_spanning_tree.hpp:43:32: required from ‘void boost::detail::prim_mst_impl(const Graph&, typename boost::graph_traits::vertex_descriptor, const boost::bgl_named_params&, Weight) [with Graph = R_adjacency_list; P = boost::adj_list_edge_property_map, boost::edge_weight_t>; T = boost::edge_weight_t; R = boost::bgl_named_params; Weight = boost::adj_list_edge_property_map, boost::edge_weight_t>; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/prim_minimum_spanning_tree.hpp:77:26: required from ‘void boost::prim_minimum_spanning_tree(const VertexListGraph&, PredecessorMap) [with VertexListGraph = R_adjacency_list; PredecessorMap = long unsigned int*]’ minST.cpp:89:35: required from here /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::EqualityComparable<__gnu_cxx::__normal_iterator > > >]’ 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ^ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements > > > >]’: /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:512:7: required from ‘struct boost::InputIterator<__gnu_cxx::__normal_iterator > > >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:540:3: required from ‘struct boost::ForwardIterator<__gnu_cxx::__normal_iterator > > >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:568:3: required from ‘struct boost::BidirectionalIterator<__gnu_cxx::__normal_iterator > > >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:597:3: required from ‘struct boost::RandomAccessIterator<__gnu_cxx::__normal_iterator > > >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:597:3: required from ‘struct boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator > > >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:32:62: [ skipping 4 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.4-3.20/BH/include/boost/property_map/property_map.hpp:354:5: required from ‘boost::iterator_property_map boost::make_iterator_property_map(RAIter, ID, Value) [with RAIter = __gnu_cxx::__normal_iterator > >; Value = double; ID = vec_adj_list_vertex_id_map, long unsigned int>]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/dijkstra_shortest_paths.hpp:556:43: required from ‘void boost::detail::dijkstra_dispatch1(const VertexListGraph&, typename boost::graph_traits::vertex_descriptor, DistanceMap, WeightMap, IndexMap, const Params&) [with VertexListGraph = R_adjacency_list; DistanceMap = boost::param_not_found; WeightMap = boost::adj_list_edge_property_map, boost::edge_weight_t>; IndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>; Params = boost::bgl_named_params<_project2nd, boost::distance_combine_t, boost::bgl_named_params, boost::distance_compare_t, boost::bgl_named_params, boost::edge_weight_t>, boost::edge_weight_t, boost::bgl_named_params > > >; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/dijkstra_shortest_paths.hpp:570:31: required from ‘void boost::dijkstra_shortest_paths(const VertexListGraph&, typename graph_traits::vertex_descriptor, const bgl_named_params&) [with VertexListGraph = R_adjacency_list; Param = detail::_project2nd; Tag = distance_combine_t; Rest = bgl_named_params, distance_compare_t, bgl_named_params, edge_weight_t>, edge_weight_t, bgl_named_params > >; typename graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/prim_minimum_spanning_tree.hpp:43:32: required from ‘void boost::detail::prim_mst_impl(const Graph&, typename boost::graph_traits::vertex_descriptor, const boost::bgl_named_params&, Weight) [with Graph = R_adjacency_list; P = boost::adj_list_edge_property_map, boost::edge_weight_t>; T = boost::edge_weight_t; R = boost::bgl_named_params; Weight = boost::adj_list_edge_property_map, boost::edge_weight_t>; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/prim_minimum_spanning_tree.hpp:77:26: required from ‘void boost::prim_minimum_spanning_tree(const VertexListGraph&, PredecessorMap) [with VertexListGraph = R_adjacency_list; PredecessorMap = long unsigned int*]’ minST.cpp:89:35: required from here /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::InputIterator<__gnu_cxx::__normal_iterator > > >]’ 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ^ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements > > > >]’: /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:543:7: required from ‘struct boost::ForwardIterator<__gnu_cxx::__normal_iterator > > >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:568:3: required from ‘struct boost::BidirectionalIterator<__gnu_cxx::__normal_iterator > > >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:597:3: required from ‘struct boost::RandomAccessIterator<__gnu_cxx::__normal_iterator > > >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:597:3: required from ‘struct boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator > > >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator > > >]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:42:5: [ skipping 3 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.4-3.20/BH/include/boost/property_map/property_map.hpp:354:5: required from ‘boost::iterator_property_map boost::make_iterator_property_map(RAIter, ID, Value) [with RAIter = __gnu_cxx::__normal_iterator > >; Value = double; ID = vec_adj_list_vertex_id_map, long unsigned int>]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/dijkstra_shortest_paths.hpp:556:43: required from ‘void boost::detail::dijkstra_dispatch1(const VertexListGraph&, typename boost::graph_traits::vertex_descriptor, DistanceMap, WeightMap, IndexMap, const Params&) [with VertexListGraph = R_adjacency_list; DistanceMap = boost::param_not_found; WeightMap = boost::adj_list_edge_property_map, boost::edge_weight_t>; IndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>; Params = boost::bgl_named_params<_project2nd, boost::distance_combine_t, boost::bgl_named_params, boost::distance_compare_t, boost::bgl_named_params, boost::edge_weight_t>, boost::edge_weight_t, boost::bgl_named_params > > >; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/dijkstra_shortest_paths.hpp:570:31: required from ‘void boost::dijkstra_shortest_paths(const VertexListGraph&, typename graph_traits::vertex_descriptor, const bgl_named_params&) [with VertexListGraph = R_adjacency_list; Param = detail::_project2nd; Tag = distance_combine_t; Rest = bgl_named_params, distance_compare_t, bgl_named_params, edge_weight_t>, edge_weight_t, bgl_named_params > >; typename graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/prim_minimum_spanning_tree.hpp:43:32: required from ‘void boost::detail::prim_mst_impl(const Graph&, typename boost::graph_traits::vertex_descriptor, const boost::bgl_named_params&, Weight) [with Graph = R_adjacency_list; P = boost::adj_list_edge_property_map, boost::edge_weight_t>; T = boost::edge_weight_t; R = boost::bgl_named_params; Weight = boost::adj_list_edge_property_map, boost::edge_weight_t>; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/prim_minimum_spanning_tree.hpp:77:26: required from ‘void boost::prim_minimum_spanning_tree(const VertexListGraph&, PredecessorMap) [with VertexListGraph = R_adjacency_list; PredecessorMap = long unsigned int*]’ minST.cpp:89:35: required from here /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::ForwardIterator<__gnu_cxx::__normal_iterator > > >]’ 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ^ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements > > > >]’: /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:571:7: required from ‘struct boost::BidirectionalIterator<__gnu_cxx::__normal_iterator > > >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:597:3: required from ‘struct boost::RandomAccessIterator<__gnu_cxx::__normal_iterator > > >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:597:3: required from ‘struct boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator > > >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator > > >]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied > > > >::value’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:45:51: [ skipping 2 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.4-3.20/BH/include/boost/property_map/property_map.hpp:354:5: required from ‘boost::iterator_property_map boost::make_iterator_property_map(RAIter, ID, Value) [with RAIter = __gnu_cxx::__normal_iterator > >; Value = double; ID = vec_adj_list_vertex_id_map, long unsigned int>]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/dijkstra_shortest_paths.hpp:556:43: required from ‘void boost::detail::dijkstra_dispatch1(const VertexListGraph&, typename boost::graph_traits::vertex_descriptor, DistanceMap, WeightMap, IndexMap, const Params&) [with VertexListGraph = R_adjacency_list; DistanceMap = boost::param_not_found; WeightMap = boost::adj_list_edge_property_map, boost::edge_weight_t>; IndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>; Params = boost::bgl_named_params<_project2nd, boost::distance_combine_t, boost::bgl_named_params, boost::distance_compare_t, boost::bgl_named_params, boost::edge_weight_t>, boost::edge_weight_t, boost::bgl_named_params > > >; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/dijkstra_shortest_paths.hpp:570:31: required from ‘void boost::dijkstra_shortest_paths(const VertexListGraph&, typename graph_traits::vertex_descriptor, const bgl_named_params&) [with VertexListGraph = R_adjacency_list; Param = detail::_project2nd; Tag = distance_combine_t; Rest = bgl_named_params, distance_compare_t, bgl_named_params, edge_weight_t>, edge_weight_t, bgl_named_params > >; typename graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/prim_minimum_spanning_tree.hpp:43:32: required from ‘void boost::detail::prim_mst_impl(const Graph&, typename boost::graph_traits::vertex_descriptor, const boost::bgl_named_params&, Weight) [with Graph = R_adjacency_list; P = boost::adj_list_edge_property_map, boost::edge_weight_t>; T = boost::edge_weight_t; R = boost::bgl_named_params; Weight = boost::adj_list_edge_property_map, boost::edge_weight_t>; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/prim_minimum_spanning_tree.hpp:77:26: required from ‘void boost::prim_minimum_spanning_tree(const VertexListGraph&, PredecessorMap) [with VertexListGraph = R_adjacency_list; PredecessorMap = long unsigned int*]’ minST.cpp:89:35: required from here /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::BidirectionalIterator<__gnu_cxx::__normal_iterator > > >]’ 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ^ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements > > > >]’: /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:253:5: required from ‘struct boost::Comparable<__gnu_cxx::__normal_iterator > > >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:597:3: required from ‘struct boost::RandomAccessIterator<__gnu_cxx::__normal_iterator > > >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:597:3: required from ‘struct boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator > > >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator > > >]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied > > > >::value’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:45:51: [ skipping 2 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.4-3.20/BH/include/boost/property_map/property_map.hpp:354:5: required from ‘boost::iterator_property_map boost::make_iterator_property_map(RAIter, ID, Value) [with RAIter = __gnu_cxx::__normal_iterator > >; Value = double; ID = vec_adj_list_vertex_id_map, long unsigned int>]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/dijkstra_shortest_paths.hpp:556:43: required from ‘void boost::detail::dijkstra_dispatch1(const VertexListGraph&, typename boost::graph_traits::vertex_descriptor, DistanceMap, WeightMap, IndexMap, const Params&) [with VertexListGraph = R_adjacency_list; DistanceMap = boost::param_not_found; WeightMap = boost::adj_list_edge_property_map, boost::edge_weight_t>; IndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>; Params = boost::bgl_named_params<_project2nd, boost::distance_combine_t, boost::bgl_named_params, boost::distance_compare_t, boost::bgl_named_params, boost::edge_weight_t>, boost::edge_weight_t, boost::bgl_named_params > > >; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/dijkstra_shortest_paths.hpp:570:31: required from ‘void boost::dijkstra_shortest_paths(const VertexListGraph&, typename graph_traits::vertex_descriptor, const bgl_named_params&) [with VertexListGraph = R_adjacency_list; Param = detail::_project2nd; Tag = distance_combine_t; Rest = bgl_named_params, distance_compare_t, bgl_named_params, edge_weight_t>, edge_weight_t, bgl_named_params > >; typename graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/prim_minimum_spanning_tree.hpp:43:32: required from ‘void boost::detail::prim_mst_impl(const Graph&, typename boost::graph_traits::vertex_descriptor, const boost::bgl_named_params&, Weight) [with Graph = R_adjacency_list; P = boost::adj_list_edge_property_map, boost::edge_weight_t>; T = boost::edge_weight_t; R = boost::bgl_named_params; Weight = boost::adj_list_edge_property_map, boost::edge_weight_t>; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/prim_minimum_spanning_tree.hpp:77:26: required from ‘void boost::prim_minimum_spanning_tree(const VertexListGraph&, PredecessorMap) [with VertexListGraph = R_adjacency_list; PredecessorMap = long unsigned int*]’ minST.cpp:89:35: required from here /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::Comparable<__gnu_cxx::__normal_iterator > > >]’ 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ^ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements > > > >]’: /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:601:7: required from ‘struct boost::RandomAccessIterator<__gnu_cxx::__normal_iterator > > >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:597:3: required from ‘struct boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator > > >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator > > >]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied > > > >::value’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:45:51: [ skipping 2 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.4-3.20/BH/include/boost/property_map/property_map.hpp:354:5: required from ‘boost::iterator_property_map boost::make_iterator_property_map(RAIter, ID, Value) [with RAIter = __gnu_cxx::__normal_iterator > >; Value = double; ID = vec_adj_list_vertex_id_map, long unsigned int>]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/dijkstra_shortest_paths.hpp:556:43: required from ‘void boost::detail::dijkstra_dispatch1(const VertexListGraph&, typename boost::graph_traits::vertex_descriptor, DistanceMap, WeightMap, IndexMap, const Params&) [with VertexListGraph = R_adjacency_list; DistanceMap = boost::param_not_found; WeightMap = boost::adj_list_edge_property_map, boost::edge_weight_t>; IndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>; Params = boost::bgl_named_params<_project2nd, boost::distance_combine_t, boost::bgl_named_params, boost::distance_compare_t, boost::bgl_named_params, boost::edge_weight_t>, boost::edge_weight_t, boost::bgl_named_params > > >; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/dijkstra_shortest_paths.hpp:570:31: required from ‘void boost::dijkstra_shortest_paths(const VertexListGraph&, typename graph_traits::vertex_descriptor, const bgl_named_params&) [with VertexListGraph = R_adjacency_list; Param = detail::_project2nd; Tag = distance_combine_t; Rest = bgl_named_params, distance_compare_t, bgl_named_params, edge_weight_t>, edge_weight_t, bgl_named_params > >; typename graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/prim_minimum_spanning_tree.hpp:43:32: required from ‘void boost::detail::prim_mst_impl(const Graph&, typename boost::graph_traits::vertex_descriptor, const boost::bgl_named_params&, Weight) [with Graph = R_adjacency_list; P = boost::adj_list_edge_property_map, boost::edge_weight_t>; T = boost::edge_weight_t; R = boost::bgl_named_params; Weight = boost::adj_list_edge_property_map, boost::edge_weight_t>; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/prim_minimum_spanning_tree.hpp:77:26: required from ‘void boost::prim_minimum_spanning_tree(const VertexListGraph&, PredecessorMap) [with VertexListGraph = R_adjacency_list; PredecessorMap = long unsigned int*]’ minST.cpp:89:35: required from here /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::RandomAccessIterator<__gnu_cxx::__normal_iterator > > >]’ 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ^ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator > > >]’: /home/omnipath/local/R/4.4-3.20/BH/include/boost/property_map/property_map.hpp:354:5: required from ‘boost::iterator_property_map boost::make_iterator_property_map(RAIter, ID, Value) [with RAIter = __gnu_cxx::__normal_iterator > >; Value = double; ID = vec_adj_list_vertex_id_map, long unsigned int>]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/dijkstra_shortest_paths.hpp:556:43: required from ‘void boost::detail::dijkstra_dispatch1(const VertexListGraph&, typename boost::graph_traits::vertex_descriptor, DistanceMap, WeightMap, IndexMap, const Params&) [with VertexListGraph = R_adjacency_list; DistanceMap = boost::param_not_found; WeightMap = boost::adj_list_edge_property_map, boost::edge_weight_t>; IndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>; Params = boost::bgl_named_params<_project2nd, boost::distance_combine_t, boost::bgl_named_params, boost::distance_compare_t, boost::bgl_named_params, boost::edge_weight_t>, boost::edge_weight_t, boost::bgl_named_params > > >; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/dijkstra_shortest_paths.hpp:570:31: required from ‘void boost::dijkstra_shortest_paths(const VertexListGraph&, typename graph_traits::vertex_descriptor, const bgl_named_params&) [with VertexListGraph = R_adjacency_list; Param = detail::_project2nd; Tag = distance_combine_t; Rest = bgl_named_params, distance_compare_t, bgl_named_params, edge_weight_t>, edge_weight_t, bgl_named_params > >; typename graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/prim_minimum_spanning_tree.hpp:43:32: required from ‘void boost::detail::prim_mst_impl(const Graph&, typename boost::graph_traits::vertex_descriptor, const boost::bgl_named_params&, Weight) [with Graph = R_adjacency_list; P = boost::adj_list_edge_property_map, boost::edge_weight_t>; T = boost::edge_weight_t; R = boost::bgl_named_params; Weight = boost::adj_list_edge_property_map, boost::edge_weight_t>; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/prim_minimum_spanning_tree.hpp:77:26: required from ‘void boost::prim_minimum_spanning_tree(const VertexListGraph&, PredecessorMap) [with VertexListGraph = R_adjacency_list; PredecessorMap = long unsigned int*]’ minST.cpp:89:35: required from here /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:597:17: note: in a call to non-static member function ‘boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator > > >::~RandomAccessIteratorConcept()’ 597 | BOOST_concept(RandomAccessIterator,(TT)) | ^~~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/preprocessor/cat.hpp:29:34: note: in definition of macro ‘BOOST_PP_CAT_I’ 29 | # define BOOST_PP_CAT_I(a, b) a ## b | ^ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/concept_def.hpp:23:12: note: in expansion of macro ‘BOOST_PP_CAT’ 23 | struct BOOST_PP_CAT(name,Concept) \ | ^~~~~~~~~~~~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:597:3: note: in expansion of macro ‘BOOST_concept’ 597 | BOOST_concept(RandomAccessIterator,(TT)) | ^~~~~~~~~~~~~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::Convertible]’: /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements >]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:208:5: required from ‘struct boost::Convertible’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::Convertible]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied >::value’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:72:8: [ skipping 10 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied > > >::value’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied > > >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_ > >)>’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/property_map/property_map.hpp:354:5: required from ‘boost::iterator_property_map boost::make_iterator_property_map(RAIter, ID, Value) [with RAIter = __gnu_cxx::__normal_iterator >; Value = long unsigned int; ID = vec_adj_list_vertex_id_map, long unsigned int>]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/kruskal_min_spanning_tree.hpp:113:35: required from ‘void boost::kruskal_minimum_spanning_tree(const Graph&, OutputIterator) [with Graph = R_adjacency_list; OutputIterator = std::back_insert_iterator > >]’ minST.cpp:20:38: required from here /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::Convertible::~Convertible() [with X = std::random_access_iterator_tag; Y = std::input_iterator_tag]’ 37 | ~model() | ^ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:208:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 208 | BOOST_CONCEPT_USAGE(Convertible) { | ^~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::Convertible]’: /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements >]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:208:5: required from ‘struct boost::Convertible’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::Convertible]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied >::value’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:72:8: [ skipping 9 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied > > >::value’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied > > >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_ > >)>’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/property_map/property_map.hpp:354:5: required from ‘boost::iterator_property_map boost::make_iterator_property_map(RAIter, ID, Value) [with RAIter = __gnu_cxx::__normal_iterator >; Value = long unsigned int; ID = vec_adj_list_vertex_id_map, long unsigned int>]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/kruskal_min_spanning_tree.hpp:113:35: required from ‘void boost::kruskal_minimum_spanning_tree(const Graph&, OutputIterator) [with Graph = R_adjacency_list; OutputIterator = std::back_insert_iterator > >]’ minST.cpp:20:38: required from here /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::Convertible::~Convertible() [with X = std::random_access_iterator_tag; Y = std::forward_iterator_tag]’ 37 | ~model() | ^ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:208:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 208 | BOOST_CONCEPT_USAGE(Convertible) { | ^~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::Convertible]’: /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements >]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:208:5: required from ‘struct boost::Convertible’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::Convertible]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied >::value’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:72:8: [ skipping 8 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied > > >::value’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied > > >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_ > >)>’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/property_map/property_map.hpp:354:5: required from ‘boost::iterator_property_map boost::make_iterator_property_map(RAIter, ID, Value) [with RAIter = __gnu_cxx::__normal_iterator >; Value = long unsigned int; ID = vec_adj_list_vertex_id_map, long unsigned int>]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/kruskal_min_spanning_tree.hpp:113:35: required from ‘void boost::kruskal_minimum_spanning_tree(const Graph&, OutputIterator) [with Graph = R_adjacency_list; OutputIterator = std::back_insert_iterator > >]’ minST.cpp:20:38: required from here /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::Convertible::~Convertible() [with X = std::random_access_iterator_tag; Y = std::bidirectional_iterator_tag]’ 37 | ~model() | ^ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:208:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 208 | BOOST_CONCEPT_USAGE(Convertible) { | ^~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::DefaultConstructible]’: /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements >]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:137:5: required from ‘struct boost::DefaultConstructible’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::DefaultConstructible]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied >::value’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:72:8: [ skipping 8 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied > >::value’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied > >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_ >)>’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/kruskal_min_spanning_tree.hpp:55:9: required from ‘void boost::detail::kruskal_mst_impl(const Graph&, OutputIterator, Rank, Parent, Weight) [with Graph = R_adjacency_list; OutputIterator = std::back_insert_iterator > >; Rank = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>; Parent = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>; Weight = boost::adj_list_edge_property_map, boost::edge_weight_t>]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/kruskal_min_spanning_tree.hpp:112:29: required from ‘void boost::kruskal_minimum_spanning_tree(const Graph&, OutputIterator) [with Graph = R_adjacency_list; OutputIterator = std::back_insert_iterator > >]’ minST.cpp:20:38: required from here /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::DefaultConstructible::~DefaultConstructible() [with TT = long unsigned int]’ 37 | ~model() | ^ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:137:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 137 | BOOST_CONCEPT_USAGE(DefaultConstructible) { | ^~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::EqualityComparable]’: /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements >]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:233:5: required from ‘struct boost::EqualityComparable’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::EqualityComparable]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied >::value’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:72:8: [ skipping 8 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied > >::value’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied > >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_ >)>’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/kruskal_min_spanning_tree.hpp:55:9: required from ‘void boost::detail::kruskal_mst_impl(const Graph&, OutputIterator, Rank, Parent, Weight) [with Graph = R_adjacency_list; OutputIterator = std::back_insert_iterator > >; Rank = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>; Parent = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>; Weight = boost::adj_list_edge_property_map, boost::edge_weight_t>]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/kruskal_min_spanning_tree.hpp:112:29: required from ‘void boost::kruskal_minimum_spanning_tree(const Graph&, OutputIterator) [with Graph = R_adjacency_list; OutputIterator = std::back_insert_iterator > >]’ minST.cpp:20:38: required from here /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::EqualityComparable::~EqualityComparable() [with TT = long unsigned int]’ 37 | ~model() | ^ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:233:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 233 | BOOST_CONCEPT_USAGE(EqualityComparable) { | ^~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::Assignable]’: /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements >]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:145:5: required from ‘struct boost::Assignable’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::Assignable]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied >::value’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:72:8: [ skipping 8 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied > >::value’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied > >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_ >)>’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/kruskal_min_spanning_tree.hpp:55:9: required from ‘void boost::detail::kruskal_mst_impl(const Graph&, OutputIterator, Rank, Parent, Weight) [with Graph = R_adjacency_list; OutputIterator = std::back_insert_iterator > >; Rank = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>; Parent = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>; Weight = boost::adj_list_edge_property_map, boost::edge_weight_t>]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/kruskal_min_spanning_tree.hpp:112:29: required from ‘void boost::kruskal_minimum_spanning_tree(const Graph&, OutputIterator) [with Graph = R_adjacency_list; OutputIterator = std::back_insert_iterator > >]’ minST.cpp:20:38: required from here /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::Assignable::~Assignable() [with TT = long unsigned int]’ 37 | ~model() | ^ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:145:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 145 | BOOST_CONCEPT_USAGE(Assignable) { | ^~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements > >]’: /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:145:5: required from ‘struct boost::Assignable >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:502:3: required from ‘struct boost::InputIterator >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::InputIterator >]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied > >::value’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied > >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:72:8: [ skipping 2 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::MultiPassInputIterator >]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/graph_concepts.hpp:184:9: required from ‘boost::concepts::VertexListGraph::~VertexListGraph() [with G = R_adjacency_list]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/graph_concepts.hpp:176:1: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::VertexListGraphConcept >]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/kruskal_min_spanning_tree.hpp:55:9: required from ‘void boost::detail::kruskal_mst_impl(const Graph&, OutputIterator, Rank, Parent, Weight) [with Graph = R_adjacency_list; OutputIterator = std::back_insert_iterator > >; Rank = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>; Parent = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>; Weight = boost::adj_list_edge_property_map, boost::edge_weight_t>]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/kruskal_min_spanning_tree.hpp:112:29: required from ‘void boost::kruskal_minimum_spanning_tree(const Graph&, OutputIterator) [with Graph = R_adjacency_list; OutputIterator = std::back_insert_iterator > >]’ minST.cpp:20:38: required from here /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::Assignable >]’ 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ^ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements > >]’: /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:233:5: required from ‘struct boost::EqualityComparable >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:502:3: required from ‘struct boost::InputIterator >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::InputIterator >]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied > >::value’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied > >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:72:8: [ skipping 2 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::MultiPassInputIterator >]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/graph_concepts.hpp:184:9: required from ‘boost::concepts::VertexListGraph::~VertexListGraph() [with G = R_adjacency_list]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/graph_concepts.hpp:176:1: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::VertexListGraphConcept >]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/kruskal_min_spanning_tree.hpp:55:9: required from ‘void boost::detail::kruskal_mst_impl(const Graph&, OutputIterator, Rank, Parent, Weight) [with Graph = R_adjacency_list; OutputIterator = std::back_insert_iterator > >; Rank = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>; Parent = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>; Weight = boost::adj_list_edge_property_map, boost::edge_weight_t>]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/kruskal_min_spanning_tree.hpp:112:29: required from ‘void boost::kruskal_minimum_spanning_tree(const Graph&, OutputIterator) [with Graph = R_adjacency_list; OutputIterator = std::back_insert_iterator > >]’ minST.cpp:20:38: required from here /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::EqualityComparable >]’ 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ^ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements > >]’: /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:512:7: required from ‘struct boost::InputIterator >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::InputIterator >]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied > >::value’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied > >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:72:8: [ skipping 2 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::MultiPassInputIterator >]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/graph_concepts.hpp:184:9: required from ‘boost::concepts::VertexListGraph::~VertexListGraph() [with G = R_adjacency_list]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/graph_concepts.hpp:176:1: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::VertexListGraphConcept >]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/kruskal_min_spanning_tree.hpp:55:9: required from ‘void boost::detail::kruskal_mst_impl(const Graph&, OutputIterator, Rank, Parent, Weight) [with Graph = R_adjacency_list; OutputIterator = std::back_insert_iterator > >; Rank = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>; Parent = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>; Weight = boost::adj_list_edge_property_map, boost::edge_weight_t>]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/kruskal_min_spanning_tree.hpp:112:29: required from ‘void boost::kruskal_minimum_spanning_tree(const Graph&, OutputIterator) [with Graph = R_adjacency_list; OutputIterator = std::back_insert_iterator > >]’ minST.cpp:20:38: required from here /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::InputIterator >]’ 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ^ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::InputIterator >]’: /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/graph_concepts.hpp:53:35: required from ‘boost::concepts::MultiPassInputIterator::~MultiPassInputIterator() [with T = boost::range_detail::integer_iterator]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::MultiPassInputIterator >]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/graph_concepts.hpp:184:9: required from ‘boost::concepts::VertexListGraph::~VertexListGraph() [with G = R_adjacency_list]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/graph_concepts.hpp:176:1: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::VertexListGraphConcept >]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/kruskal_min_spanning_tree.hpp:55:9: required from ‘void boost::detail::kruskal_mst_impl(const Graph&, OutputIterator, Rank, Parent, Weight) [with Graph = R_adjacency_list; OutputIterator = std::back_insert_iterator > >; Rank = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>; Parent = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>; Weight = boost::adj_list_edge_property_map, boost::edge_weight_t>]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/kruskal_min_spanning_tree.hpp:112:29: required from ‘void boost::kruskal_minimum_spanning_tree(const Graph&, OutputIterator) [with Graph = R_adjacency_list; OutputIterator = std::back_insert_iterator > >]’ minST.cpp:20:38: required from here /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::InputIterator::~InputIterator() [with TT = boost::range_detail::integer_iterator]’ 37 | ~model() | ^ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:512:7: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 512 | BOOST_CONCEPT_USAGE(InputIterator) | ^~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator >*, std::vector >, std::allocator > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::adjacency_list, boost::property, boost::no_property, boost::listS> > > >]’: /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:145:5: required from ‘struct boost::Assignable, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator >*, std::vector >, std::allocator > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::adjacency_list, boost::property, boost::no_property, boost::listS> > >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:502:3: required from ‘struct boost::InputIterator, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator >*, std::vector >, std::allocator > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::adjacency_list, boost::property, boost::no_property, boost::listS> > >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::InputIterator, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator >*, std::vector >, std::allocator > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::adjacency_list, boost::property, boost::no_property, boost::listS> > >]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator >*, std::vector >, std::allocator > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::adjacency_list, boost::property, boost::no_property, boost::listS> > > >::value’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator >*, std::vector >, std::allocator > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::adjacency_list, boost::property, boost::no_property, boost::listS> > > >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:72:8: [ skipping 2 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::MultiPassInputIterator, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator >*, std::vector >, std::allocator > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::adjacency_list, boost::property, boost::no_property, boost::listS> > >]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/graph_concepts.hpp:235:9: required from ‘boost::concepts::EdgeListGraph::~EdgeListGraph() [with G = R_adjacency_list]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/graph_concepts.hpp:226:1: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::EdgeListGraphConcept >]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/kruskal_min_spanning_tree.hpp:56:9: required from ‘void boost::detail::kruskal_mst_impl(const Graph&, OutputIterator, Rank, Parent, Weight) [with Graph = R_adjacency_list; OutputIterator = std::back_insert_iterator > >; Rank = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>; Parent = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>; Weight = boost::adj_list_edge_property_map, boost::edge_weight_t>]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/kruskal_min_spanning_tree.hpp:112:29: required from ‘void boost::kruskal_minimum_spanning_tree(const Graph&, OutputIterator) [with Graph = R_adjacency_list; OutputIterator = std::back_insert_iterator > >]’ minST.cpp:20:38: required from here /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::Assignable, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator >*, std::vector >, std::allocator > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::adjacency_list, boost::property, boost::no_property, boost::listS> > >]’ 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ^ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator >*, std::vector >, std::allocator > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::adjacency_list, boost::property, boost::no_property, boost::listS> > > >]’: /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:233:5: required from ‘struct boost::EqualityComparable, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator >*, std::vector >, std::allocator > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::adjacency_list, boost::property, boost::no_property, boost::listS> > >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:502:3: required from ‘struct boost::InputIterator, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator >*, std::vector >, std::allocator > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::adjacency_list, boost::property, boost::no_property, boost::listS> > >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::InputIterator, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator >*, std::vector >, std::allocator > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::adjacency_list, boost::property, boost::no_property, boost::listS> > >]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator >*, std::vector >, std::allocator > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::adjacency_list, boost::property, boost::no_property, boost::listS> > > >::value’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator >*, std::vector >, std::allocator > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::adjacency_list, boost::property, boost::no_property, boost::listS> > > >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:72:8: [ skipping 2 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::MultiPassInputIterator, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator >*, std::vector >, std::allocator > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::adjacency_list, boost::property, boost::no_property, boost::listS> > >]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/graph_concepts.hpp:235:9: required from ‘boost::concepts::EdgeListGraph::~EdgeListGraph() [with G = R_adjacency_list]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/graph_concepts.hpp:226:1: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::EdgeListGraphConcept >]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/kruskal_min_spanning_tree.hpp:56:9: required from ‘void boost::detail::kruskal_mst_impl(const Graph&, OutputIterator, Rank, Parent, Weight) [with Graph = R_adjacency_list; OutputIterator = std::back_insert_iterator > >; Rank = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>; Parent = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>; Weight = boost::adj_list_edge_property_map, boost::edge_weight_t>]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/kruskal_min_spanning_tree.hpp:112:29: required from ‘void boost::kruskal_minimum_spanning_tree(const Graph&, OutputIterator) [with Graph = R_adjacency_list; OutputIterator = std::back_insert_iterator > >]’ minST.cpp:20:38: required from here /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::EqualityComparable, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator >*, std::vector >, std::allocator > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::adjacency_list, boost::property, boost::no_property, boost::listS> > >]’ 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ^ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator >*, std::vector >, std::allocator > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::adjacency_list, boost::property, boost::no_property, boost::listS> > > >]’: /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:512:7: required from ‘struct boost::InputIterator, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator >*, std::vector >, std::allocator > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::adjacency_list, boost::property, boost::no_property, boost::listS> > >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::InputIterator, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator >*, std::vector >, std::allocator > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::adjacency_list, boost::property, boost::no_property, boost::listS> > >]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator >*, std::vector >, std::allocator > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::adjacency_list, boost::property, boost::no_property, boost::listS> > > >::value’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator >*, std::vector >, std::allocator > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::adjacency_list, boost::property, boost::no_property, boost::listS> > > >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:72:8: [ skipping 2 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::MultiPassInputIterator, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator >*, std::vector >, std::allocator > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::adjacency_list, boost::property, boost::no_property, boost::listS> > >]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/graph_concepts.hpp:235:9: required from ‘boost::concepts::EdgeListGraph::~EdgeListGraph() [with G = R_adjacency_list]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/graph_concepts.hpp:226:1: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::EdgeListGraphConcept >]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/kruskal_min_spanning_tree.hpp:56:9: required from ‘void boost::detail::kruskal_mst_impl(const Graph&, OutputIterator, Rank, Parent, Weight) [with Graph = R_adjacency_list; OutputIterator = std::back_insert_iterator > >; Rank = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>; Parent = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>; Weight = boost::adj_list_edge_property_map, boost::edge_weight_t>]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/kruskal_min_spanning_tree.hpp:112:29: required from ‘void boost::kruskal_minimum_spanning_tree(const Graph&, OutputIterator) [with Graph = R_adjacency_list; OutputIterator = std::back_insert_iterator > >]’ minST.cpp:20:38: required from here /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::InputIterator, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator >*, std::vector >, std::allocator > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::adjacency_list, boost::property, boost::no_property, boost::listS> > >]’ 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ^ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::InputIterator, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator >*, std::vector >, std::allocator > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::adjacency_list, boost::property, boost::no_property, boost::listS> > >]’: /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/graph_concepts.hpp:53:35: required from ‘boost::concepts::MultiPassInputIterator::~MultiPassInputIterator() [with T = boost::detail::adj_list_edge_iterator, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator >*, std::vector >, std::allocator > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::adjacency_list, boost::property, boost::no_property, boost::listS> >]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::MultiPassInputIterator, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator >*, std::vector >, std::allocator > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::adjacency_list, boost::property, boost::no_property, boost::listS> > >]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/graph_concepts.hpp:235:9: required from ‘boost::concepts::EdgeListGraph::~EdgeListGraph() [with G = R_adjacency_list]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/graph_concepts.hpp:226:1: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::EdgeListGraphConcept >]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/kruskal_min_spanning_tree.hpp:56:9: required from ‘void boost::detail::kruskal_mst_impl(const Graph&, OutputIterator, Rank, Parent, Weight) [with Graph = R_adjacency_list; OutputIterator = std::back_insert_iterator > >; Rank = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>; Parent = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>; Weight = boost::adj_list_edge_property_map, boost::edge_weight_t>]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/kruskal_min_spanning_tree.hpp:112:29: required from ‘void boost::kruskal_minimum_spanning_tree(const Graph&, OutputIterator) [with Graph = R_adjacency_list; OutputIterator = std::back_insert_iterator > >]’ minST.cpp:20:38: required from here /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::InputIterator::~InputIterator() [with TT = boost::detail::adj_list_edge_iterator, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator >*, std::vector >, std::allocator > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::adjacency_list, boost::property, boost::no_property, boost::listS> >]’ 37 | ~model() | ^ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:512:7: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 512 | BOOST_CONCEPT_USAGE(InputIterator) | ^~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements > >, boost::detail::edge_desc_impl, long int> > >]’: /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:145:5: required from ‘struct boost::Assignable > >, boost::detail::edge_desc_impl, long int> >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:502:3: required from ‘struct boost::InputIterator > >, boost::detail::edge_desc_impl, long int> >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::InputIterator > >, boost::detail::edge_desc_impl, long int> >]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied > >, boost::detail::edge_desc_impl, long int> > >::value’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied > >, boost::detail::edge_desc_impl, long int> > >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:72:8: [ skipping 2 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::MultiPassInputIterator > >, boost::detail::edge_desc_impl, long int> >]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/graph_concepts.hpp:235:9: required from ‘boost::concepts::EdgeListGraph::~EdgeListGraph() [with G = R_adjacency_list]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/graph_concepts.hpp:226:1: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::EdgeListGraphConcept >]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/kruskal_min_spanning_tree.hpp:56:9: required from ‘void boost::detail::kruskal_mst_impl(const Graph&, OutputIterator, Rank, Parent, Weight) [with Graph = R_adjacency_list; OutputIterator = std::back_insert_iterator > >; Rank = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>; Parent = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>; Weight = boost::adj_list_edge_property_map, boost::edge_weight_t>]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/kruskal_min_spanning_tree.hpp:112:29: required from ‘void boost::kruskal_minimum_spanning_tree(const Graph&, OutputIterator) [with Graph = R_adjacency_list; OutputIterator = std::back_insert_iterator > >]’ minST.cpp:54:38: required from here /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::Assignable > >, boost::detail::edge_desc_impl, long int> >]’ 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ^ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements > >, boost::detail::edge_desc_impl, long int> > >]’: /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:233:5: required from ‘struct boost::EqualityComparable > >, boost::detail::edge_desc_impl, long int> >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:502:3: required from ‘struct boost::InputIterator > >, boost::detail::edge_desc_impl, long int> >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::InputIterator > >, boost::detail::edge_desc_impl, long int> >]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied > >, boost::detail::edge_desc_impl, long int> > >::value’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied > >, boost::detail::edge_desc_impl, long int> > >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:72:8: [ skipping 2 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::MultiPassInputIterator > >, boost::detail::edge_desc_impl, long int> >]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/graph_concepts.hpp:235:9: required from ‘boost::concepts::EdgeListGraph::~EdgeListGraph() [with G = R_adjacency_list]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/graph_concepts.hpp:226:1: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::EdgeListGraphConcept >]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/kruskal_min_spanning_tree.hpp:56:9: required from ‘void boost::detail::kruskal_mst_impl(const Graph&, OutputIterator, Rank, Parent, Weight) [with Graph = R_adjacency_list; OutputIterator = std::back_insert_iterator > >; Rank = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>; Parent = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>; Weight = boost::adj_list_edge_property_map, boost::edge_weight_t>]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/kruskal_min_spanning_tree.hpp:112:29: required from ‘void boost::kruskal_minimum_spanning_tree(const Graph&, OutputIterator) [with Graph = R_adjacency_list; OutputIterator = std::back_insert_iterator > >]’ minST.cpp:54:38: required from here /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::EqualityComparable > >, boost::detail::edge_desc_impl, long int> >]’ 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ^ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements > >, boost::detail::edge_desc_impl, long int> > >]’: /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:512:7: required from ‘struct boost::InputIterator > >, boost::detail::edge_desc_impl, long int> >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::InputIterator > >, boost::detail::edge_desc_impl, long int> >]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied > >, boost::detail::edge_desc_impl, long int> > >::value’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied > >, boost::detail::edge_desc_impl, long int> > >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:72:8: [ skipping 2 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::MultiPassInputIterator > >, boost::detail::edge_desc_impl, long int> >]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/graph_concepts.hpp:235:9: required from ‘boost::concepts::EdgeListGraph::~EdgeListGraph() [with G = R_adjacency_list]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/graph_concepts.hpp:226:1: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::EdgeListGraphConcept >]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/kruskal_min_spanning_tree.hpp:56:9: required from ‘void boost::detail::kruskal_mst_impl(const Graph&, OutputIterator, Rank, Parent, Weight) [with Graph = R_adjacency_list; OutputIterator = std::back_insert_iterator > >; Rank = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>; Parent = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>; Weight = boost::adj_list_edge_property_map, boost::edge_weight_t>]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/kruskal_min_spanning_tree.hpp:112:29: required from ‘void boost::kruskal_minimum_spanning_tree(const Graph&, OutputIterator) [with Graph = R_adjacency_list; OutputIterator = std::back_insert_iterator > >]’ minST.cpp:54:38: required from here /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::InputIterator > >, boost::detail::edge_desc_impl, long int> >]’ 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ^ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::InputIterator > >, boost::detail::edge_desc_impl, long int> >]’: /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/graph_concepts.hpp:53:35: required from ‘boost::concepts::MultiPassInputIterator::~MultiPassInputIterator() [with T = boost::detail::undirected_edge_iter > >, boost::detail::edge_desc_impl, long int>]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::MultiPassInputIterator > >, boost::detail::edge_desc_impl, long int> >]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/graph_concepts.hpp:235:9: required from ‘boost::concepts::EdgeListGraph::~EdgeListGraph() [with G = R_adjacency_list]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/graph_concepts.hpp:226:1: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::EdgeListGraphConcept >]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/kruskal_min_spanning_tree.hpp:56:9: required from ‘void boost::detail::kruskal_mst_impl(const Graph&, OutputIterator, Rank, Parent, Weight) [with Graph = R_adjacency_list; OutputIterator = std::back_insert_iterator > >; Rank = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>; Parent = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>; Weight = boost::adj_list_edge_property_map, boost::edge_weight_t>]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/kruskal_min_spanning_tree.hpp:112:29: required from ‘void boost::kruskal_minimum_spanning_tree(const Graph&, OutputIterator) [with Graph = R_adjacency_list; OutputIterator = std::back_insert_iterator > >]’ minST.cpp:54:38: required from here /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::InputIterator::~InputIterator() [with TT = boost::detail::undirected_edge_iter > >, boost::detail::edge_desc_impl, long int>]’ 37 | ~model() | ^ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:512:7: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 512 | BOOST_CONCEPT_USAGE(InputIterator) | ^~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::Assignable<__gnu_cxx::__normal_iterator > > >]’: /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements > > > >]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:145:5: required from ‘struct boost::Assignable<__gnu_cxx::__normal_iterator > > >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:502:3: required from ‘struct boost::InputIterator<__gnu_cxx::__normal_iterator > > >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:540:3: required from ‘struct boost::ForwardIterator<__gnu_cxx::__normal_iterator > > >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:568:3: required from ‘struct boost::BidirectionalIterator<__gnu_cxx::__normal_iterator > > >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:597:3: [ skipping 6 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.4-3.20/BH/include/boost/property_map/property_map.hpp:354:5: required from ‘boost::iterator_property_map boost::make_iterator_property_map(RAIter, ID, Value) [with RAIter = __gnu_cxx::__normal_iterator > >; Value = double; ID = vec_adj_list_vertex_id_map, long unsigned int>]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/dijkstra_shortest_paths.hpp:556:43: required from ‘void boost::detail::dijkstra_dispatch1(const VertexListGraph&, typename boost::graph_traits::vertex_descriptor, DistanceMap, WeightMap, IndexMap, const Params&) [with VertexListGraph = R_adjacency_list; DistanceMap = boost::param_not_found; WeightMap = boost::adj_list_edge_property_map, boost::edge_weight_t>; IndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>; Params = boost::bgl_named_params<_project2nd, boost::distance_combine_t, boost::bgl_named_params, boost::distance_compare_t, boost::bgl_named_params, boost::edge_weight_t>, boost::edge_weight_t, boost::bgl_named_params > > >; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/dijkstra_shortest_paths.hpp:570:31: required from ‘void boost::dijkstra_shortest_paths(const VertexListGraph&, typename graph_traits::vertex_descriptor, const bgl_named_params&) [with VertexListGraph = R_adjacency_list; Param = detail::_project2nd; Tag = distance_combine_t; Rest = bgl_named_params, distance_compare_t, bgl_named_params, edge_weight_t>, edge_weight_t, bgl_named_params > >; typename graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/prim_minimum_spanning_tree.hpp:43:32: required from ‘void boost::detail::prim_mst_impl(const Graph&, typename boost::graph_traits::vertex_descriptor, const boost::bgl_named_params&, Weight) [with Graph = R_adjacency_list; P = boost::adj_list_edge_property_map, boost::edge_weight_t>; T = boost::edge_weight_t; R = boost::bgl_named_params; Weight = boost::adj_list_edge_property_map, boost::edge_weight_t>; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/prim_minimum_spanning_tree.hpp:77:26: required from ‘void boost::prim_minimum_spanning_tree(const VertexListGraph&, PredecessorMap) [with VertexListGraph = R_adjacency_list; PredecessorMap = long unsigned int*]’ minST.cpp:89:35: required from here /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::Assignable::~Assignable() [with TT = __gnu_cxx::__normal_iterator > >]’ 37 | ~model() | ^ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:145:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 145 | BOOST_CONCEPT_USAGE(Assignable) { | ^~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::EqualityComparable<__gnu_cxx::__normal_iterator > > >]’: /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements > > > >]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:233:5: required from ‘struct boost::EqualityComparable<__gnu_cxx::__normal_iterator > > >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:502:3: required from ‘struct boost::InputIterator<__gnu_cxx::__normal_iterator > > >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:540:3: required from ‘struct boost::ForwardIterator<__gnu_cxx::__normal_iterator > > >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:568:3: required from ‘struct boost::BidirectionalIterator<__gnu_cxx::__normal_iterator > > >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:597:3: [ skipping 6 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.4-3.20/BH/include/boost/property_map/property_map.hpp:354:5: required from ‘boost::iterator_property_map boost::make_iterator_property_map(RAIter, ID, Value) [with RAIter = __gnu_cxx::__normal_iterator > >; Value = double; ID = vec_adj_list_vertex_id_map, long unsigned int>]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/dijkstra_shortest_paths.hpp:556:43: required from ‘void boost::detail::dijkstra_dispatch1(const VertexListGraph&, typename boost::graph_traits::vertex_descriptor, DistanceMap, WeightMap, IndexMap, const Params&) [with VertexListGraph = R_adjacency_list; DistanceMap = boost::param_not_found; WeightMap = boost::adj_list_edge_property_map, boost::edge_weight_t>; IndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>; Params = boost::bgl_named_params<_project2nd, boost::distance_combine_t, boost::bgl_named_params, boost::distance_compare_t, boost::bgl_named_params, boost::edge_weight_t>, boost::edge_weight_t, boost::bgl_named_params > > >; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/dijkstra_shortest_paths.hpp:570:31: required from ‘void boost::dijkstra_shortest_paths(const VertexListGraph&, typename graph_traits::vertex_descriptor, const bgl_named_params&) [with VertexListGraph = R_adjacency_list; Param = detail::_project2nd; Tag = distance_combine_t; Rest = bgl_named_params, distance_compare_t, bgl_named_params, edge_weight_t>, edge_weight_t, bgl_named_params > >; typename graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/prim_minimum_spanning_tree.hpp:43:32: required from ‘void boost::detail::prim_mst_impl(const Graph&, typename boost::graph_traits::vertex_descriptor, const boost::bgl_named_params&, Weight) [with Graph = R_adjacency_list; P = boost::adj_list_edge_property_map, boost::edge_weight_t>; T = boost::edge_weight_t; R = boost::bgl_named_params; Weight = boost::adj_list_edge_property_map, boost::edge_weight_t>; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/prim_minimum_spanning_tree.hpp:77:26: required from ‘void boost::prim_minimum_spanning_tree(const VertexListGraph&, PredecessorMap) [with VertexListGraph = R_adjacency_list; PredecessorMap = long unsigned int*]’ minST.cpp:89:35: required from here /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::EqualityComparable::~EqualityComparable() [with TT = __gnu_cxx::__normal_iterator > >]’ 37 | ~model() | ^ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:233:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 233 | BOOST_CONCEPT_USAGE(EqualityComparable) { | ^~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::InputIterator<__gnu_cxx::__normal_iterator > > >]’: /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements > > > >]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:512:7: required from ‘struct boost::InputIterator<__gnu_cxx::__normal_iterator > > >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:540:3: required from ‘struct boost::ForwardIterator<__gnu_cxx::__normal_iterator > > >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:568:3: required from ‘struct boost::BidirectionalIterator<__gnu_cxx::__normal_iterator > > >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:597:3: required from ‘struct boost::RandomAccessIterator<__gnu_cxx::__normal_iterator > > >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:597:3: [ skipping 5 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.4-3.20/BH/include/boost/property_map/property_map.hpp:354:5: required from ‘boost::iterator_property_map boost::make_iterator_property_map(RAIter, ID, Value) [with RAIter = __gnu_cxx::__normal_iterator > >; Value = double; ID = vec_adj_list_vertex_id_map, long unsigned int>]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/dijkstra_shortest_paths.hpp:556:43: required from ‘void boost::detail::dijkstra_dispatch1(const VertexListGraph&, typename boost::graph_traits::vertex_descriptor, DistanceMap, WeightMap, IndexMap, const Params&) [with VertexListGraph = R_adjacency_list; DistanceMap = boost::param_not_found; WeightMap = boost::adj_list_edge_property_map, boost::edge_weight_t>; IndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>; Params = boost::bgl_named_params<_project2nd, boost::distance_combine_t, boost::bgl_named_params, boost::distance_compare_t, boost::bgl_named_params, boost::edge_weight_t>, boost::edge_weight_t, boost::bgl_named_params > > >; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/dijkstra_shortest_paths.hpp:570:31: required from ‘void boost::dijkstra_shortest_paths(const VertexListGraph&, typename graph_traits::vertex_descriptor, const bgl_named_params&) [with VertexListGraph = R_adjacency_list; Param = detail::_project2nd; Tag = distance_combine_t; Rest = bgl_named_params, distance_compare_t, bgl_named_params, edge_weight_t>, edge_weight_t, bgl_named_params > >; typename graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/prim_minimum_spanning_tree.hpp:43:32: required from ‘void boost::detail::prim_mst_impl(const Graph&, typename boost::graph_traits::vertex_descriptor, const boost::bgl_named_params&, Weight) [with Graph = R_adjacency_list; P = boost::adj_list_edge_property_map, boost::edge_weight_t>; T = boost::edge_weight_t; R = boost::bgl_named_params; Weight = boost::adj_list_edge_property_map, boost::edge_weight_t>; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/prim_minimum_spanning_tree.hpp:77:26: required from ‘void boost::prim_minimum_spanning_tree(const VertexListGraph&, PredecessorMap) [with VertexListGraph = R_adjacency_list; PredecessorMap = long unsigned int*]’ minST.cpp:89:35: required from here /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::InputIterator::~InputIterator() [with TT = __gnu_cxx::__normal_iterator > >]’ 37 | ~model() | ^ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:512:7: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 512 | BOOST_CONCEPT_USAGE(InputIterator) | ^~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::ForwardIterator<__gnu_cxx::__normal_iterator > > >]’: /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements > > > >]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:543:7: required from ‘struct boost::ForwardIterator<__gnu_cxx::__normal_iterator > > >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:568:3: required from ‘struct boost::BidirectionalIterator<__gnu_cxx::__normal_iterator > > >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:597:3: required from ‘struct boost::RandomAccessIterator<__gnu_cxx::__normal_iterator > > >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:597:3: required from ‘struct boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator > > >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:32:62: [ skipping 4 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.4-3.20/BH/include/boost/property_map/property_map.hpp:354:5: required from ‘boost::iterator_property_map boost::make_iterator_property_map(RAIter, ID, Value) [with RAIter = __gnu_cxx::__normal_iterator > >; Value = double; ID = vec_adj_list_vertex_id_map, long unsigned int>]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/dijkstra_shortest_paths.hpp:556:43: required from ‘void boost::detail::dijkstra_dispatch1(const VertexListGraph&, typename boost::graph_traits::vertex_descriptor, DistanceMap, WeightMap, IndexMap, const Params&) [with VertexListGraph = R_adjacency_list; DistanceMap = boost::param_not_found; WeightMap = boost::adj_list_edge_property_map, boost::edge_weight_t>; IndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>; Params = boost::bgl_named_params<_project2nd, boost::distance_combine_t, boost::bgl_named_params, boost::distance_compare_t, boost::bgl_named_params, boost::edge_weight_t>, boost::edge_weight_t, boost::bgl_named_params > > >; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/dijkstra_shortest_paths.hpp:570:31: required from ‘void boost::dijkstra_shortest_paths(const VertexListGraph&, typename graph_traits::vertex_descriptor, const bgl_named_params&) [with VertexListGraph = R_adjacency_list; Param = detail::_project2nd; Tag = distance_combine_t; Rest = bgl_named_params, distance_compare_t, bgl_named_params, edge_weight_t>, edge_weight_t, bgl_named_params > >; typename graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/prim_minimum_spanning_tree.hpp:43:32: required from ‘void boost::detail::prim_mst_impl(const Graph&, typename boost::graph_traits::vertex_descriptor, const boost::bgl_named_params&, Weight) [with Graph = R_adjacency_list; P = boost::adj_list_edge_property_map, boost::edge_weight_t>; T = boost::edge_weight_t; R = boost::bgl_named_params; Weight = boost::adj_list_edge_property_map, boost::edge_weight_t>; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/prim_minimum_spanning_tree.hpp:77:26: required from ‘void boost::prim_minimum_spanning_tree(const VertexListGraph&, PredecessorMap) [with VertexListGraph = R_adjacency_list; PredecessorMap = long unsigned int*]’ minST.cpp:89:35: required from here /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::ForwardIterator::~ForwardIterator() [with TT = __gnu_cxx::__normal_iterator > >]’ 37 | ~model() | ^ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:543:7: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 543 | BOOST_CONCEPT_USAGE(ForwardIterator) | ^~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::BidirectionalIterator<__gnu_cxx::__normal_iterator > > >]’: /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements > > > >]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:571:7: required from ‘struct boost::BidirectionalIterator<__gnu_cxx::__normal_iterator > > >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:597:3: required from ‘struct boost::RandomAccessIterator<__gnu_cxx::__normal_iterator > > >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:597:3: required from ‘struct boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator > > >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator > > >]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:42:5: [ skipping 3 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.4-3.20/BH/include/boost/property_map/property_map.hpp:354:5: required from ‘boost::iterator_property_map boost::make_iterator_property_map(RAIter, ID, Value) [with RAIter = __gnu_cxx::__normal_iterator > >; Value = double; ID = vec_adj_list_vertex_id_map, long unsigned int>]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/dijkstra_shortest_paths.hpp:556:43: required from ‘void boost::detail::dijkstra_dispatch1(const VertexListGraph&, typename boost::graph_traits::vertex_descriptor, DistanceMap, WeightMap, IndexMap, const Params&) [with VertexListGraph = R_adjacency_list; DistanceMap = boost::param_not_found; WeightMap = boost::adj_list_edge_property_map, boost::edge_weight_t>; IndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>; Params = boost::bgl_named_params<_project2nd, boost::distance_combine_t, boost::bgl_named_params, boost::distance_compare_t, boost::bgl_named_params, boost::edge_weight_t>, boost::edge_weight_t, boost::bgl_named_params > > >; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/dijkstra_shortest_paths.hpp:570:31: required from ‘void boost::dijkstra_shortest_paths(const VertexListGraph&, typename graph_traits::vertex_descriptor, const bgl_named_params&) [with VertexListGraph = R_adjacency_list; Param = detail::_project2nd; Tag = distance_combine_t; Rest = bgl_named_params, distance_compare_t, bgl_named_params, edge_weight_t>, edge_weight_t, bgl_named_params > >; typename graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/prim_minimum_spanning_tree.hpp:43:32: required from ‘void boost::detail::prim_mst_impl(const Graph&, typename boost::graph_traits::vertex_descriptor, const boost::bgl_named_params&, Weight) [with Graph = R_adjacency_list; P = boost::adj_list_edge_property_map, boost::edge_weight_t>; T = boost::edge_weight_t; R = boost::bgl_named_params; Weight = boost::adj_list_edge_property_map, boost::edge_weight_t>; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/prim_minimum_spanning_tree.hpp:77:26: required from ‘void boost::prim_minimum_spanning_tree(const VertexListGraph&, PredecessorMap) [with VertexListGraph = R_adjacency_list; PredecessorMap = long unsigned int*]’ minST.cpp:89:35: required from here /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::BidirectionalIterator::~BidirectionalIterator() [with TT = __gnu_cxx::__normal_iterator > >]’ 37 | ~model() | ^ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:571:7: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 571 | BOOST_CONCEPT_USAGE(BidirectionalIterator) | ^~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::Comparable<__gnu_cxx::__normal_iterator > > >]’: /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements > > > >]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:253:5: required from ‘struct boost::Comparable<__gnu_cxx::__normal_iterator > > >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:597:3: required from ‘struct boost::RandomAccessIterator<__gnu_cxx::__normal_iterator > > >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:597:3: required from ‘struct boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator > > >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator > > >]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:42:5: [ skipping 3 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.4-3.20/BH/include/boost/property_map/property_map.hpp:354:5: required from ‘boost::iterator_property_map boost::make_iterator_property_map(RAIter, ID, Value) [with RAIter = __gnu_cxx::__normal_iterator > >; Value = double; ID = vec_adj_list_vertex_id_map, long unsigned int>]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/dijkstra_shortest_paths.hpp:556:43: required from ‘void boost::detail::dijkstra_dispatch1(const VertexListGraph&, typename boost::graph_traits::vertex_descriptor, DistanceMap, WeightMap, IndexMap, const Params&) [with VertexListGraph = R_adjacency_list; DistanceMap = boost::param_not_found; WeightMap = boost::adj_list_edge_property_map, boost::edge_weight_t>; IndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>; Params = boost::bgl_named_params<_project2nd, boost::distance_combine_t, boost::bgl_named_params, boost::distance_compare_t, boost::bgl_named_params, boost::edge_weight_t>, boost::edge_weight_t, boost::bgl_named_params > > >; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/dijkstra_shortest_paths.hpp:570:31: required from ‘void boost::dijkstra_shortest_paths(const VertexListGraph&, typename graph_traits::vertex_descriptor, const bgl_named_params&) [with VertexListGraph = R_adjacency_list; Param = detail::_project2nd; Tag = distance_combine_t; Rest = bgl_named_params, distance_compare_t, bgl_named_params, edge_weight_t>, edge_weight_t, bgl_named_params > >; typename graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/prim_minimum_spanning_tree.hpp:43:32: required from ‘void boost::detail::prim_mst_impl(const Graph&, typename boost::graph_traits::vertex_descriptor, const boost::bgl_named_params&, Weight) [with Graph = R_adjacency_list; P = boost::adj_list_edge_property_map, boost::edge_weight_t>; T = boost::edge_weight_t; R = boost::bgl_named_params; Weight = boost::adj_list_edge_property_map, boost::edge_weight_t>; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/prim_minimum_spanning_tree.hpp:77:26: required from ‘void boost::prim_minimum_spanning_tree(const VertexListGraph&, PredecessorMap) [with VertexListGraph = R_adjacency_list; PredecessorMap = long unsigned int*]’ minST.cpp:89:35: required from here /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::Comparable::~Comparable() [with TT = __gnu_cxx::__normal_iterator > >]’ 37 | ~model() | ^ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:253:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 253 | BOOST_CONCEPT_USAGE(Comparable) { | ^~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::RandomAccessIterator<__gnu_cxx::__normal_iterator > > >]’: /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements > > > >]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:601:7: required from ‘struct boost::RandomAccessIterator<__gnu_cxx::__normal_iterator > > >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:597:3: required from ‘struct boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator > > >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator > > >]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied > > > >::value’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:45:51: [ skipping 2 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.4-3.20/BH/include/boost/property_map/property_map.hpp:354:5: required from ‘boost::iterator_property_map boost::make_iterator_property_map(RAIter, ID, Value) [with RAIter = __gnu_cxx::__normal_iterator > >; Value = double; ID = vec_adj_list_vertex_id_map, long unsigned int>]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/dijkstra_shortest_paths.hpp:556:43: required from ‘void boost::detail::dijkstra_dispatch1(const VertexListGraph&, typename boost::graph_traits::vertex_descriptor, DistanceMap, WeightMap, IndexMap, const Params&) [with VertexListGraph = R_adjacency_list; DistanceMap = boost::param_not_found; WeightMap = boost::adj_list_edge_property_map, boost::edge_weight_t>; IndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>; Params = boost::bgl_named_params<_project2nd, boost::distance_combine_t, boost::bgl_named_params, boost::distance_compare_t, boost::bgl_named_params, boost::edge_weight_t>, boost::edge_weight_t, boost::bgl_named_params > > >; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/dijkstra_shortest_paths.hpp:570:31: required from ‘void boost::dijkstra_shortest_paths(const VertexListGraph&, typename graph_traits::vertex_descriptor, const bgl_named_params&) [with VertexListGraph = R_adjacency_list; Param = detail::_project2nd; Tag = distance_combine_t; Rest = bgl_named_params, distance_compare_t, bgl_named_params, edge_weight_t>, edge_weight_t, bgl_named_params > >; typename graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/prim_minimum_spanning_tree.hpp:43:32: required from ‘void boost::detail::prim_mst_impl(const Graph&, typename boost::graph_traits::vertex_descriptor, const boost::bgl_named_params&, Weight) [with Graph = R_adjacency_list; P = boost::adj_list_edge_property_map, boost::edge_weight_t>; T = boost::edge_weight_t; R = boost::bgl_named_params; Weight = boost::adj_list_edge_property_map, boost::edge_weight_t>; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/prim_minimum_spanning_tree.hpp:77:26: required from ‘void boost::prim_minimum_spanning_tree(const VertexListGraph&, PredecessorMap) [with VertexListGraph = R_adjacency_list; PredecessorMap = long unsigned int*]’ minST.cpp:89:35: required from here /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::RandomAccessIterator::~RandomAccessIterator() [with TT = __gnu_cxx::__normal_iterator > >]’ 37 | ~model() | ^ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:601:7: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 601 | BOOST_CONCEPT_USAGE(RandomAccessIterator) | ^~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::Assignable >]’: /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements > >]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:145:5: required from ‘struct boost::Assignable >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:502:3: required from ‘struct boost::InputIterator >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::InputIterator >]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied > >::value’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:45:51: [ skipping 3 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::MultiPassInputIterator >]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/graph_concepts.hpp:184:9: required from ‘boost::concepts::VertexListGraph::~VertexListGraph() [with G = R_adjacency_list]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/graph_concepts.hpp:176:1: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::VertexListGraphConcept >]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/kruskal_min_spanning_tree.hpp:55:9: required from ‘void boost::detail::kruskal_mst_impl(const Graph&, OutputIterator, Rank, Parent, Weight) [with Graph = R_adjacency_list; OutputIterator = std::back_insert_iterator > >; Rank = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>; Parent = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>; Weight = boost::adj_list_edge_property_map, boost::edge_weight_t>]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/kruskal_min_spanning_tree.hpp:112:29: required from ‘void boost::kruskal_minimum_spanning_tree(const Graph&, OutputIterator) [with Graph = R_adjacency_list; OutputIterator = std::back_insert_iterator > >]’ minST.cpp:20:38: required from here /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::Assignable::~Assignable() [with TT = boost::range_detail::integer_iterator]’ 37 | ~model() | ^ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:145:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 145 | BOOST_CONCEPT_USAGE(Assignable) { | ^~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::EqualityComparable >]’: /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements > >]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:233:5: required from ‘struct boost::EqualityComparable >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:502:3: required from ‘struct boost::InputIterator >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::InputIterator >]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied > >::value’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:45:51: [ skipping 3 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::MultiPassInputIterator >]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/graph_concepts.hpp:184:9: required from ‘boost::concepts::VertexListGraph::~VertexListGraph() [with G = R_adjacency_list]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/graph_concepts.hpp:176:1: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::VertexListGraphConcept >]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/kruskal_min_spanning_tree.hpp:55:9: required from ‘void boost::detail::kruskal_mst_impl(const Graph&, OutputIterator, Rank, Parent, Weight) [with Graph = R_adjacency_list; OutputIterator = std::back_insert_iterator > >; Rank = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>; Parent = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>; Weight = boost::adj_list_edge_property_map, boost::edge_weight_t>]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/kruskal_min_spanning_tree.hpp:112:29: required from ‘void boost::kruskal_minimum_spanning_tree(const Graph&, OutputIterator) [with Graph = R_adjacency_list; OutputIterator = std::back_insert_iterator > >]’ minST.cpp:20:38: required from here /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::EqualityComparable::~EqualityComparable() [with TT = boost::range_detail::integer_iterator]’ 37 | ~model() | ^ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:233:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 233 | BOOST_CONCEPT_USAGE(EqualityComparable) { | ^~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::InputIterator >]’: /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements > >]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:512:7: required from ‘struct boost::InputIterator >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::InputIterator >]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied > >::value’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied > >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:72:8: [ skipping 2 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::MultiPassInputIterator >]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/graph_concepts.hpp:184:9: required from ‘boost::concepts::VertexListGraph::~VertexListGraph() [with G = R_adjacency_list]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/graph_concepts.hpp:176:1: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::VertexListGraphConcept >]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/kruskal_min_spanning_tree.hpp:55:9: required from ‘void boost::detail::kruskal_mst_impl(const Graph&, OutputIterator, Rank, Parent, Weight) [with Graph = R_adjacency_list; OutputIterator = std::back_insert_iterator > >; Rank = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>; Parent = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>; Weight = boost::adj_list_edge_property_map, boost::edge_weight_t>]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/kruskal_min_spanning_tree.hpp:112:29: required from ‘void boost::kruskal_minimum_spanning_tree(const Graph&, OutputIterator) [with Graph = R_adjacency_list; OutputIterator = std::back_insert_iterator > >]’ minST.cpp:20:38: required from here /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::InputIterator::~InputIterator() [with TT = boost::range_detail::integer_iterator]’ 37 | ~model() | ^ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:512:7: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 512 | BOOST_CONCEPT_USAGE(InputIterator) | ^~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::Assignable, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator >*, std::vector >, std::allocator > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::adjacency_list, boost::property, boost::no_property, boost::listS> > >]’: /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator >*, std::vector >, std::allocator > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::adjacency_list, boost::property, boost::no_property, boost::listS> > > >]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:145:5: required from ‘struct boost::Assignable, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator >*, std::vector >, std::allocator > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::adjacency_list, boost::property, boost::no_property, boost::listS> > >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:502:3: required from ‘struct boost::InputIterator, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator >*, std::vector >, std::allocator > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::adjacency_list, boost::property, boost::no_property, boost::listS> > >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::InputIterator, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator >*, std::vector >, std::allocator > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::adjacency_list, boost::property, boost::no_property, boost::listS> > >]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator >*, std::vector >, std::allocator > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::adjacency_list, boost::property, boost::no_property, boost::listS> > > >::value’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:45:51: [ skipping 3 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::MultiPassInputIterator, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator >*, std::vector >, std::allocator > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::adjacency_list, boost::property, boost::no_property, boost::listS> > >]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/graph_concepts.hpp:235:9: required from ‘boost::concepts::EdgeListGraph::~EdgeListGraph() [with G = R_adjacency_list]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/graph_concepts.hpp:226:1: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::EdgeListGraphConcept >]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/kruskal_min_spanning_tree.hpp:56:9: required from ‘void boost::detail::kruskal_mst_impl(const Graph&, OutputIterator, Rank, Parent, Weight) [with Graph = R_adjacency_list; OutputIterator = std::back_insert_iterator > >; Rank = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>; Parent = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>; Weight = boost::adj_list_edge_property_map, boost::edge_weight_t>]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/kruskal_min_spanning_tree.hpp:112:29: required from ‘void boost::kruskal_minimum_spanning_tree(const Graph&, OutputIterator) [with Graph = R_adjacency_list; OutputIterator = std::back_insert_iterator > >]’ minST.cpp:20:38: required from here /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::Assignable::~Assignable() [with TT = boost::detail::adj_list_edge_iterator, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator >*, std::vector >, std::allocator > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::adjacency_list, boost::property, boost::no_property, boost::listS> >]’ 37 | ~model() | ^ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:145:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 145 | BOOST_CONCEPT_USAGE(Assignable) { | ^~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::EqualityComparable, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator >*, std::vector >, std::allocator > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::adjacency_list, boost::property, boost::no_property, boost::listS> > >]’: /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator >*, std::vector >, std::allocator > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::adjacency_list, boost::property, boost::no_property, boost::listS> > > >]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:233:5: required from ‘struct boost::EqualityComparable, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator >*, std::vector >, std::allocator > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::adjacency_list, boost::property, boost::no_property, boost::listS> > >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:502:3: required from ‘struct boost::InputIterator, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator >*, std::vector >, std::allocator > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::adjacency_list, boost::property, boost::no_property, boost::listS> > >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::InputIterator, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator >*, std::vector >, std::allocator > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::adjacency_list, boost::property, boost::no_property, boost::listS> > >]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator >*, std::vector >, std::allocator > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::adjacency_list, boost::property, boost::no_property, boost::listS> > > >::value’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:45:51: [ skipping 3 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::MultiPassInputIterator, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator >*, std::vector >, std::allocator > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::adjacency_list, boost::property, boost::no_property, boost::listS> > >]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/graph_concepts.hpp:235:9: required from ‘boost::concepts::EdgeListGraph::~EdgeListGraph() [with G = R_adjacency_list]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/graph_concepts.hpp:226:1: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::EdgeListGraphConcept >]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/kruskal_min_spanning_tree.hpp:56:9: required from ‘void boost::detail::kruskal_mst_impl(const Graph&, OutputIterator, Rank, Parent, Weight) [with Graph = R_adjacency_list; OutputIterator = std::back_insert_iterator > >; Rank = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>; Parent = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>; Weight = boost::adj_list_edge_property_map, boost::edge_weight_t>]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/kruskal_min_spanning_tree.hpp:112:29: required from ‘void boost::kruskal_minimum_spanning_tree(const Graph&, OutputIterator) [with Graph = R_adjacency_list; OutputIterator = std::back_insert_iterator > >]’ minST.cpp:20:38: required from here /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::EqualityComparable::~EqualityComparable() [with TT = boost::detail::adj_list_edge_iterator, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator >*, std::vector >, std::allocator > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::adjacency_list, boost::property, boost::no_property, boost::listS> >]’ 37 | ~model() | ^ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:233:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 233 | BOOST_CONCEPT_USAGE(EqualityComparable) { | ^~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::InputIterator, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator >*, std::vector >, std::allocator > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::adjacency_list, boost::property, boost::no_property, boost::listS> > >]’: /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator >*, std::vector >, std::allocator > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::adjacency_list, boost::property, boost::no_property, boost::listS> > > >]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:512:7: required from ‘struct boost::InputIterator, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator >*, std::vector >, std::allocator > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::adjacency_list, boost::property, boost::no_property, boost::listS> > >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::InputIterator, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator >*, std::vector >, std::allocator > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::adjacency_list, boost::property, boost::no_property, boost::listS> > >]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator >*, std::vector >, std::allocator > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::adjacency_list, boost::property, boost::no_property, boost::listS> > > >::value’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator >*, std::vector >, std::allocator > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::adjacency_list, boost::property, boost::no_property, boost::listS> > > >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:72:8: [ skipping 2 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::MultiPassInputIterator, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator >*, std::vector >, std::allocator > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::adjacency_list, boost::property, boost::no_property, boost::listS> > >]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/graph_concepts.hpp:235:9: required from ‘boost::concepts::EdgeListGraph::~EdgeListGraph() [with G = R_adjacency_list]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/graph_concepts.hpp:226:1: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::EdgeListGraphConcept >]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/kruskal_min_spanning_tree.hpp:56:9: required from ‘void boost::detail::kruskal_mst_impl(const Graph&, OutputIterator, Rank, Parent, Weight) [with Graph = R_adjacency_list; OutputIterator = std::back_insert_iterator > >; Rank = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>; Parent = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>; Weight = boost::adj_list_edge_property_map, boost::edge_weight_t>]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/kruskal_min_spanning_tree.hpp:112:29: required from ‘void boost::kruskal_minimum_spanning_tree(const Graph&, OutputIterator) [with Graph = R_adjacency_list; OutputIterator = std::back_insert_iterator > >]’ minST.cpp:20:38: required from here /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::InputIterator::~InputIterator() [with TT = boost::detail::adj_list_edge_iterator, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator >*, std::vector >, std::allocator > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::adjacency_list, boost::property, boost::no_property, boost::listS> >]’ 37 | ~model() | ^ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:512:7: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 512 | BOOST_CONCEPT_USAGE(InputIterator) | ^~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::Assignable > >, boost::detail::edge_desc_impl, long int> >]’: /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements > >, boost::detail::edge_desc_impl, long int> > >]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:145:5: required from ‘struct boost::Assignable > >, boost::detail::edge_desc_impl, long int> >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:502:3: required from ‘struct boost::InputIterator > >, boost::detail::edge_desc_impl, long int> >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::InputIterator > >, boost::detail::edge_desc_impl, long int> >]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied > >, boost::detail::edge_desc_impl, long int> > >::value’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:45:51: [ skipping 3 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::MultiPassInputIterator > >, boost::detail::edge_desc_impl, long int> >]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/graph_concepts.hpp:235:9: required from ‘boost::concepts::EdgeListGraph::~EdgeListGraph() [with G = R_adjacency_list]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/graph_concepts.hpp:226:1: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::EdgeListGraphConcept >]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/kruskal_min_spanning_tree.hpp:56:9: required from ‘void boost::detail::kruskal_mst_impl(const Graph&, OutputIterator, Rank, Parent, Weight) [with Graph = R_adjacency_list; OutputIterator = std::back_insert_iterator > >; Rank = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>; Parent = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>; Weight = boost::adj_list_edge_property_map, boost::edge_weight_t>]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/kruskal_min_spanning_tree.hpp:112:29: required from ‘void boost::kruskal_minimum_spanning_tree(const Graph&, OutputIterator) [with Graph = R_adjacency_list; OutputIterator = std::back_insert_iterator > >]’ minST.cpp:54:38: required from here /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::Assignable::~Assignable() [with TT = boost::detail::undirected_edge_iter > >, boost::detail::edge_desc_impl, long int>]’ 37 | ~model() | ^ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:145:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 145 | BOOST_CONCEPT_USAGE(Assignable) { | ^~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::EqualityComparable > >, boost::detail::edge_desc_impl, long int> >]’: /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements > >, boost::detail::edge_desc_impl, long int> > >]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:233:5: required from ‘struct boost::EqualityComparable > >, boost::detail::edge_desc_impl, long int> >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:502:3: required from ‘struct boost::InputIterator > >, boost::detail::edge_desc_impl, long int> >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::InputIterator > >, boost::detail::edge_desc_impl, long int> >]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied > >, boost::detail::edge_desc_impl, long int> > >::value’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:45:51: [ skipping 3 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::MultiPassInputIterator > >, boost::detail::edge_desc_impl, long int> >]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/graph_concepts.hpp:235:9: required from ‘boost::concepts::EdgeListGraph::~EdgeListGraph() [with G = R_adjacency_list]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/graph_concepts.hpp:226:1: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::EdgeListGraphConcept >]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/kruskal_min_spanning_tree.hpp:56:9: required from ‘void boost::detail::kruskal_mst_impl(const Graph&, OutputIterator, Rank, Parent, Weight) [with Graph = R_adjacency_list; OutputIterator = std::back_insert_iterator > >; Rank = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>; Parent = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>; Weight = boost::adj_list_edge_property_map, boost::edge_weight_t>]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/kruskal_min_spanning_tree.hpp:112:29: required from ‘void boost::kruskal_minimum_spanning_tree(const Graph&, OutputIterator) [with Graph = R_adjacency_list; OutputIterator = std::back_insert_iterator > >]’ minST.cpp:54:38: required from here /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::EqualityComparable::~EqualityComparable() [with TT = boost::detail::undirected_edge_iter > >, boost::detail::edge_desc_impl, long int>]’ 37 | ~model() | ^ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:233:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 233 | BOOST_CONCEPT_USAGE(EqualityComparable) { | ^~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::InputIterator > >, boost::detail::edge_desc_impl, long int> >]’: /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements > >, boost::detail::edge_desc_impl, long int> > >]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:512:7: required from ‘struct boost::InputIterator > >, boost::detail::edge_desc_impl, long int> >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::InputIterator > >, boost::detail::edge_desc_impl, long int> >]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied > >, boost::detail::edge_desc_impl, long int> > >::value’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied > >, boost::detail::edge_desc_impl, long int> > >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:72:8: [ skipping 2 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::MultiPassInputIterator > >, boost::detail::edge_desc_impl, long int> >]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/graph_concepts.hpp:235:9: required from ‘boost::concepts::EdgeListGraph::~EdgeListGraph() [with G = R_adjacency_list]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/graph_concepts.hpp:226:1: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::EdgeListGraphConcept >]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/kruskal_min_spanning_tree.hpp:56:9: required from ‘void boost::detail::kruskal_mst_impl(const Graph&, OutputIterator, Rank, Parent, Weight) [with Graph = R_adjacency_list; OutputIterator = std::back_insert_iterator > >; Rank = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>; Parent = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>; Weight = boost::adj_list_edge_property_map, boost::edge_weight_t>]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/kruskal_min_spanning_tree.hpp:112:29: required from ‘void boost::kruskal_minimum_spanning_tree(const Graph&, OutputIterator) [with Graph = R_adjacency_list; OutputIterator = std::back_insert_iterator > >]’ minST.cpp:54:38: required from here /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::InputIterator::~InputIterator() [with TT = boost::detail::undirected_edge_iter > >, boost::detail::edge_desc_impl, long int>]’ 37 | ~model() | ^ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:512:7: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 512 | BOOST_CONCEPT_USAGE(InputIterator) | ^~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements >]’: /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:208:5: required from ‘struct boost::Convertible’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::Convertible]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied >::value’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_)>’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:515:9: [ skipping 3 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::MultiPassInputIterator, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator >*, std::vector >, std::allocator > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::adjacency_list, boost::property, boost::no_property, boost::listS> > >]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/graph_concepts.hpp:235:9: required from ‘boost::concepts::EdgeListGraph::~EdgeListGraph() [with G = R_adjacency_list]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/graph_concepts.hpp:226:1: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::EdgeListGraphConcept >]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/kruskal_min_spanning_tree.hpp:56:9: required from ‘void boost::detail::kruskal_mst_impl(const Graph&, OutputIterator, Rank, Parent, Weight) [with Graph = R_adjacency_list; OutputIterator = std::back_insert_iterator > >; Rank = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>; Parent = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>; Weight = boost::adj_list_edge_property_map, boost::edge_weight_t>]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/kruskal_min_spanning_tree.hpp:112:29: required from ‘void boost::kruskal_minimum_spanning_tree(const Graph&, OutputIterator) [with Graph = R_adjacency_list; OutputIterator = std::back_insert_iterator > >]’ minST.cpp:20:38: required from here /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::Convertible]’ 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ^ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::Convertible]’: /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:515:9: required from ‘boost::InputIterator::~InputIterator() [with TT = boost::detail::adj_list_edge_iterator, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator >*, std::vector >, std::allocator > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::adjacency_list, boost::property, boost::no_property, boost::listS> >]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::InputIterator, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator >*, std::vector >, std::allocator > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::adjacency_list, boost::property, boost::no_property, boost::listS> > >]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/graph_concepts.hpp:53:35: required from ‘boost::concepts::MultiPassInputIterator::~MultiPassInputIterator() [with T = boost::detail::adj_list_edge_iterator, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator >*, std::vector >, std::allocator > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::adjacency_list, boost::property, boost::no_property, boost::listS> >]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::MultiPassInputIterator, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator >*, std::vector >, std::allocator > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::adjacency_list, boost::property, boost::no_property, boost::listS> > >]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/graph_concepts.hpp:235:9: required from ‘boost::concepts::EdgeListGraph::~EdgeListGraph() [with G = R_adjacency_list]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/graph_concepts.hpp:226:1: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::EdgeListGraphConcept >]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/kruskal_min_spanning_tree.hpp:56:9: required from ‘void boost::detail::kruskal_mst_impl(const Graph&, OutputIterator, Rank, Parent, Weight) [with Graph = R_adjacency_list; OutputIterator = std::back_insert_iterator > >; Rank = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>; Parent = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>; Weight = boost::adj_list_edge_property_map, boost::edge_weight_t>]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/kruskal_min_spanning_tree.hpp:112:29: required from ‘void boost::kruskal_minimum_spanning_tree(const Graph&, OutputIterator) [with Graph = R_adjacency_list; OutputIterator = std::back_insert_iterator > >]’ minST.cpp:20:38: required from here /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::Convertible::~Convertible() [with X = std::forward_iterator_tag; Y = std::input_iterator_tag]’ 37 | ~model() | ^ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:208:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 208 | BOOST_CONCEPT_USAGE(Convertible) { | ^~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements, std::input_iterator_tag> >]’: /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:208:5: required from ‘struct boost::Convertible, std::input_iterator_tag>’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::Convertible, std::input_iterator_tag>]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied, std::input_iterator_tag> >::value’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied, std::input_iterator_tag> >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_, std::input_iterator_tag>)>’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:515:9: [ skipping 3 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::MultiPassInputIterator > >, boost::detail::edge_desc_impl, long int> >]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/graph_concepts.hpp:235:9: required from ‘boost::concepts::EdgeListGraph::~EdgeListGraph() [with G = R_adjacency_list]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/graph_concepts.hpp:226:1: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::EdgeListGraphConcept >]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/kruskal_min_spanning_tree.hpp:56:9: required from ‘void boost::detail::kruskal_mst_impl(const Graph&, OutputIterator, Rank, Parent, Weight) [with Graph = R_adjacency_list; OutputIterator = std::back_insert_iterator > >; Rank = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>; Parent = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>; Weight = boost::adj_list_edge_property_map, boost::edge_weight_t>]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/kruskal_min_spanning_tree.hpp:112:29: required from ‘void boost::kruskal_minimum_spanning_tree(const Graph&, OutputIterator) [with Graph = R_adjacency_list; OutputIterator = std::back_insert_iterator > >]’ minST.cpp:54:38: required from here /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::Convertible, std::input_iterator_tag>]’ 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ^ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::Convertible, std::input_iterator_tag>]’: /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:515:9: required from ‘boost::InputIterator::~InputIterator() [with TT = boost::detail::undirected_edge_iter > >, boost::detail::edge_desc_impl, long int>]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::InputIterator > >, boost::detail::edge_desc_impl, long int> >]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/graph_concepts.hpp:53:35: required from ‘boost::concepts::MultiPassInputIterator::~MultiPassInputIterator() [with T = boost::detail::undirected_edge_iter > >, boost::detail::edge_desc_impl, long int>]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::MultiPassInputIterator > >, boost::detail::edge_desc_impl, long int> >]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/graph_concepts.hpp:235:9: required from ‘boost::concepts::EdgeListGraph::~EdgeListGraph() [with G = R_adjacency_list]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/graph_concepts.hpp:226:1: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::EdgeListGraphConcept >]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/kruskal_min_spanning_tree.hpp:56:9: required from ‘void boost::detail::kruskal_mst_impl(const Graph&, OutputIterator, Rank, Parent, Weight) [with Graph = R_adjacency_list; OutputIterator = std::back_insert_iterator > >; Rank = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>; Parent = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>; Weight = boost::adj_list_edge_property_map, boost::edge_weight_t>]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/kruskal_min_spanning_tree.hpp:112:29: required from ‘void boost::kruskal_minimum_spanning_tree(const Graph&, OutputIterator) [with Graph = R_adjacency_list; OutputIterator = std::back_insert_iterator > >]’ minST.cpp:54:38: required from here /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::Convertible::~Convertible() [with X = boost::iterators::detail::iterator_category_with_traversal; Y = std::input_iterator_tag]’ 37 | ~model() | ^ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:208:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 208 | BOOST_CONCEPT_USAGE(Convertible) { | ^~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::Convertible]’: /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements >]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:208:5: required from ‘struct boost::Convertible’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::Convertible]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied >::value’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:72:8: [ skipping 4 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::MultiPassInputIterator, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator >*, std::vector >, std::allocator > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::adjacency_list, boost::property, boost::no_property, boost::listS> > >]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/graph_concepts.hpp:235:9: required from ‘boost::concepts::EdgeListGraph::~EdgeListGraph() [with G = R_adjacency_list]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/graph_concepts.hpp:226:1: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::EdgeListGraphConcept >]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/kruskal_min_spanning_tree.hpp:56:9: required from ‘void boost::detail::kruskal_mst_impl(const Graph&, OutputIterator, Rank, Parent, Weight) [with Graph = R_adjacency_list; OutputIterator = std::back_insert_iterator > >; Rank = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>; Parent = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>; Weight = boost::adj_list_edge_property_map, boost::edge_weight_t>]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/kruskal_min_spanning_tree.hpp:112:29: required from ‘void boost::kruskal_minimum_spanning_tree(const Graph&, OutputIterator) [with Graph = R_adjacency_list; OutputIterator = std::back_insert_iterator > >]’ minST.cpp:20:38: required from here /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::Convertible::~Convertible() [with X = std::forward_iterator_tag; Y = std::input_iterator_tag]’ 37 | ~model() | ^ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:208:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 208 | BOOST_CONCEPT_USAGE(Convertible) { | ^~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::Convertible, std::input_iterator_tag>]’: /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements, std::input_iterator_tag> >]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:208:5: required from ‘struct boost::Convertible, std::input_iterator_tag>’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::Convertible, std::input_iterator_tag>]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied, std::input_iterator_tag> >::value’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied, std::input_iterator_tag> >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:72:8: [ skipping 4 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::MultiPassInputIterator > >, boost::detail::edge_desc_impl, long int> >]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/graph_concepts.hpp:235:9: required from ‘boost::concepts::EdgeListGraph::~EdgeListGraph() [with G = R_adjacency_list]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/graph_concepts.hpp:226:1: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::EdgeListGraphConcept >]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/kruskal_min_spanning_tree.hpp:56:9: required from ‘void boost::detail::kruskal_mst_impl(const Graph&, OutputIterator, Rank, Parent, Weight) [with Graph = R_adjacency_list; OutputIterator = std::back_insert_iterator > >; Rank = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>; Parent = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>; Weight = boost::adj_list_edge_property_map, boost::edge_weight_t>]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/kruskal_min_spanning_tree.hpp:112:29: required from ‘void boost::kruskal_minimum_spanning_tree(const Graph&, OutputIterator) [with Graph = R_adjacency_list; OutputIterator = std::back_insert_iterator > >]’ minST.cpp:54:38: required from here /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::Convertible::~Convertible() [with X = boost::iterators::detail::iterator_category_with_traversal; Y = std::input_iterator_tag]’ 37 | ~model() | ^ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:208:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 208 | BOOST_CONCEPT_USAGE(Convertible) { | ^~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements > >]’: /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/graph_concepts.hpp:87:5: required from ‘struct boost::concepts::IncidenceGraph >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/graph_concepts.hpp:75:1: required from ‘struct boost::concepts::IncidenceGraphConcept >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::concepts::IncidenceGraphConcept >]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied > >::value’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied > >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:72:8: [ skipping 7 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/dijkstra_shortest_paths.hpp:528:32: required from ‘void boost::detail::dijkstra_dispatch2(const VertexListGraph&, typename boost::graph_traits::vertex_descriptor, DistanceMap, WeightMap, IndexMap, const Params&) [with VertexListGraph = R_adjacency_list; DistanceMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator > >, boost::vec_adj_list_vertex_id_map, long unsigned int>, double, double&>; WeightMap = boost::adj_list_edge_property_map, boost::edge_weight_t>; IndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>; Params = boost::bgl_named_params<_project2nd, boost::distance_combine_t, boost::bgl_named_params, boost::distance_compare_t, boost::bgl_named_params, boost::edge_weight_t>, boost::edge_weight_t, boost::bgl_named_params > > >; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/dijkstra_shortest_paths.hpp:554:35: required from ‘void boost::detail::dijkstra_dispatch1(const VertexListGraph&, typename boost::graph_traits::vertex_descriptor, DistanceMap, WeightMap, IndexMap, const Params&) [with VertexListGraph = R_adjacency_list; DistanceMap = boost::param_not_found; WeightMap = boost::adj_list_edge_property_map, boost::edge_weight_t>; IndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>; Params = boost::bgl_named_params<_project2nd, boost::distance_combine_t, boost::bgl_named_params, boost::distance_compare_t, boost::bgl_named_params, boost::edge_weight_t>, boost::edge_weight_t, boost::bgl_named_params > > >; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/dijkstra_shortest_paths.hpp:570:31: required from ‘void boost::dijkstra_shortest_paths(const VertexListGraph&, typename graph_traits::vertex_descriptor, const bgl_named_params&) [with VertexListGraph = R_adjacency_list; Param = detail::_project2nd; Tag = distance_combine_t; Rest = bgl_named_params, distance_compare_t, bgl_named_params, edge_weight_t>, edge_weight_t, bgl_named_params > >; typename graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/prim_minimum_spanning_tree.hpp:43:32: required from ‘void boost::detail::prim_mst_impl(const Graph&, typename boost::graph_traits::vertex_descriptor, const boost::bgl_named_params&, Weight) [with Graph = R_adjacency_list; P = boost::adj_list_edge_property_map, boost::edge_weight_t>; T = boost::edge_weight_t; R = boost::bgl_named_params; Weight = boost::adj_list_edge_property_map, boost::edge_weight_t>; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/prim_minimum_spanning_tree.hpp:77:26: required from ‘void boost::prim_minimum_spanning_tree(const VertexListGraph&, PredecessorMap) [with VertexListGraph = R_adjacency_list; PredecessorMap = long unsigned int*]’ minST.cpp:89:35: required from here /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::concepts::IncidenceGraph >]’ 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ^ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::IncidenceGraphConcept >]’: /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/breadth_first_search.hpp:62:5: required from ‘void boost::breadth_first_visit(const IncidenceGraph&, SourceIterator, SourceIterator, Buffer&, BFSVisitor, ColorMap) [with IncidenceGraph = R_adjacency_list; Buffer = d_ary_heap_indirect, long unsigned int>, long unsigned int, long unsigned int&>, iterator_property_map<__gnu_cxx::__normal_iterator > >, vec_adj_list_vertex_id_map, long unsigned int>, double, double&>, std::less, std::vector >; BFSVisitor = detail::dijkstra_bfs_visitor, d_ary_heap_indirect, long unsigned int>, long unsigned int, long unsigned int&>, iterator_property_map<__gnu_cxx::__normal_iterator > >, vec_adj_list_vertex_id_map, long unsigned int>, double, double&>, std::less, std::vector >, adj_list_edge_property_map, edge_weight_t>, long unsigned int*, iterator_property_map<__gnu_cxx::__normal_iterator > >, vec_adj_list_vertex_id_map, long unsigned int>, double, double&>, detail::_project2nd, std::less >; ColorMap = two_bit_color_map, long unsigned int> >; SourceIterator = long unsigned int*]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/dijkstra_shortest_paths.hpp:387:24: required from ‘void boost::dijkstra_shortest_paths_no_init(const Graph&, SourceInputIter, SourceInputIter, PredecessorMap, DistanceMap, WeightMap, IndexMap, Compare, Combine, DistZero, DijkstraVisitor, ColorMap) [with Graph = R_adjacency_list; SourceInputIter = long unsigned int*; DijkstraVisitor = dijkstra_visitor<>; PredecessorMap = long unsigned int*; DistanceMap = iterator_property_map<__gnu_cxx::__normal_iterator > >, vec_adj_list_vertex_id_map, long unsigned int>, double, double&>; WeightMap = adj_list_edge_property_map, edge_weight_t>; IndexMap = vec_adj_list_vertex_id_map, long unsigned int>; Compare = std::less; Combine = detail::_project2nd; DistZero = double; ColorMap = two_bit_color_map, long unsigned int> >]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/dijkstra_shortest_paths.hpp:464:36: required from ‘void boost::dijkstra_shortest_paths(const VertexListGraph&, SourceInputIter, SourceInputIter, PredecessorMap, DistanceMap, WeightMap, IndexMap, Compare, Combine, DistInf, DistZero, DijkstraVisitor, ColorMap) [with VertexListGraph = R_adjacency_list; SourceInputIter = long unsigned int*; DijkstraVisitor = dijkstra_visitor<>; PredecessorMap = long unsigned int*; DistanceMap = iterator_property_map<__gnu_cxx::__normal_iterator > >, vec_adj_list_vertex_id_map, long unsigned int>, double, double&>; WeightMap = adj_list_edge_property_map, edge_weight_t>; IndexMap = vec_adj_list_vertex_id_map, long unsigned int>; Compare = std::less; Combine = detail::_project2nd; DistInf = double; DistZero = double; ColorMap = two_bit_color_map, long unsigned int> >]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/dijkstra_shortest_paths.hpp:417:28: required from ‘void boost::dijkstra_shortest_paths(const VertexListGraph&, SourceInputIter, SourceInputIter, PredecessorMap, DistanceMap, WeightMap, IndexMap, Compare, Combine, DistInf, DistZero, DijkstraVisitor, const bgl_named_params&, typename enable_if_c::traversal_category>::value, graph::detail::no_parameter>::type) [with VertexListGraph = R_adjacency_list; SourceInputIter = long unsigned int*; DijkstraVisitor = dijkstra_visitor<>; PredecessorMap = long unsigned int*; DistanceMap = iterator_property_map<__gnu_cxx::__normal_iterator > >, vec_adj_list_vertex_id_map, long unsigned int>, double, double&>; WeightMap = adj_list_edge_property_map, edge_weight_t>; IndexMap = vec_adj_list_vertex_id_map, long unsigned int>; Compare = std::less; Combine = detail::_project2nd; DistInf = double; DistZero = double; T = char; Tag = detail::unused_tag_type; Base = no_property; typename enable_if_c::traversal_category>::value, graph::detail::no_parameter>::type = graph::detail::no_parameter; typename graph_traits::traversal_category = undir_adj_list_traversal_tag]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/dijkstra_shortest_paths.hpp:491:28: [ skipping 2 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/dijkstra_shortest_paths.hpp:528:32: required from ‘void boost::detail::dijkstra_dispatch2(const VertexListGraph&, typename boost::graph_traits::vertex_descriptor, DistanceMap, WeightMap, IndexMap, const Params&) [with VertexListGraph = R_adjacency_list; DistanceMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator > >, boost::vec_adj_list_vertex_id_map, long unsigned int>, double, double&>; WeightMap = boost::adj_list_edge_property_map, boost::edge_weight_t>; IndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>; Params = boost::bgl_named_params<_project2nd, boost::distance_combine_t, boost::bgl_named_params, boost::distance_compare_t, boost::bgl_named_params, boost::edge_weight_t>, boost::edge_weight_t, boost::bgl_named_params > > >; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/dijkstra_shortest_paths.hpp:554:35: required from ‘void boost::detail::dijkstra_dispatch1(const VertexListGraph&, typename boost::graph_traits::vertex_descriptor, DistanceMap, WeightMap, IndexMap, const Params&) [with VertexListGraph = R_adjacency_list; DistanceMap = boost::param_not_found; WeightMap = boost::adj_list_edge_property_map, boost::edge_weight_t>; IndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>; Params = boost::bgl_named_params<_project2nd, boost::distance_combine_t, boost::bgl_named_params, boost::distance_compare_t, boost::bgl_named_params, boost::edge_weight_t>, boost::edge_weight_t, boost::bgl_named_params > > >; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/dijkstra_shortest_paths.hpp:570:31: required from ‘void boost::dijkstra_shortest_paths(const VertexListGraph&, typename graph_traits::vertex_descriptor, const bgl_named_params&) [with VertexListGraph = R_adjacency_list; Param = detail::_project2nd; Tag = distance_combine_t; Rest = bgl_named_params, distance_compare_t, bgl_named_params, edge_weight_t>, edge_weight_t, bgl_named_params > >; typename graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/prim_minimum_spanning_tree.hpp:43:32: required from ‘void boost::detail::prim_mst_impl(const Graph&, typename boost::graph_traits::vertex_descriptor, const boost::bgl_named_params&, Weight) [with Graph = R_adjacency_list; P = boost::adj_list_edge_property_map, boost::edge_weight_t>; T = boost::edge_weight_t; R = boost::bgl_named_params; Weight = boost::adj_list_edge_property_map, boost::edge_weight_t>; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/prim_minimum_spanning_tree.hpp:77:26: required from ‘void boost::prim_minimum_spanning_tree(const VertexListGraph&, PredecessorMap) [with VertexListGraph = R_adjacency_list; PredecessorMap = long unsigned int*]’ minST.cpp:89:35: required from here /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/graph_concepts.hpp:75:15: note: in a call to non-static member function ‘boost::concepts::IncidenceGraphConcept >::~IncidenceGraphConcept()’ 75 | BOOST_concept(IncidenceGraph, (G)) : Graph< G > | ^~~~~~~~~~~~~~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/preprocessor/cat.hpp:29:34: note: in definition of macro ‘BOOST_PP_CAT_I’ 29 | # define BOOST_PP_CAT_I(a, b) a ## b | ^ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/concept_def.hpp:23:12: note: in expansion of macro ‘BOOST_PP_CAT’ 23 | struct BOOST_PP_CAT(name,Concept) \ | ^~~~~~~~~~~~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/graph_concepts.hpp:75:1: note: in expansion of macro ‘BOOST_concept’ 75 | BOOST_concept(IncidenceGraph, (G)) : Graph< G > | ^~~~~~~~~~~~~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::constraint::failed() [with Model = boost::BFSVisitorConcept, boost::d_ary_heap_indirect, long unsigned int>, long unsigned int, long unsigned int&>, boost::iterator_property_map<__gnu_cxx::__normal_iterator > >, boost::vec_adj_list_vertex_id_map, long unsigned int>, double, double&>, std::less, std::vector >, boost::adj_list_edge_property_map, boost::edge_weight_t>, long unsigned int*, boost::iterator_property_map<__gnu_cxx::__normal_iterator > >, boost::vec_adj_list_vertex_id_map, long unsigned int>, double, double&>, boost::detail::_project2nd, std::less >, R_adjacency_list >]’: /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/breadth_first_search.hpp:65:5: required from ‘void boost::breadth_first_visit(const IncidenceGraph&, SourceIterator, SourceIterator, Buffer&, BFSVisitor, ColorMap) [with IncidenceGraph = R_adjacency_list; Buffer = d_ary_heap_indirect, long unsigned int>, long unsigned int, long unsigned int&>, iterator_property_map<__gnu_cxx::__normal_iterator > >, vec_adj_list_vertex_id_map, long unsigned int>, double, double&>, std::less, std::vector >; BFSVisitor = detail::dijkstra_bfs_visitor, d_ary_heap_indirect, long unsigned int>, long unsigned int, long unsigned int&>, iterator_property_map<__gnu_cxx::__normal_iterator > >, vec_adj_list_vertex_id_map, long unsigned int>, double, double&>, std::less, std::vector >, adj_list_edge_property_map, edge_weight_t>, long unsigned int*, iterator_property_map<__gnu_cxx::__normal_iterator > >, vec_adj_list_vertex_id_map, long unsigned int>, double, double&>, detail::_project2nd, std::less >; ColorMap = two_bit_color_map, long unsigned int> >; SourceIterator = long unsigned int*]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/dijkstra_shortest_paths.hpp:387:24: required from ‘void boost::dijkstra_shortest_paths_no_init(const Graph&, SourceInputIter, SourceInputIter, PredecessorMap, DistanceMap, WeightMap, IndexMap, Compare, Combine, DistZero, DijkstraVisitor, ColorMap) [with Graph = R_adjacency_list; SourceInputIter = long unsigned int*; DijkstraVisitor = dijkstra_visitor<>; PredecessorMap = long unsigned int*; DistanceMap = iterator_property_map<__gnu_cxx::__normal_iterator > >, vec_adj_list_vertex_id_map, long unsigned int>, double, double&>; WeightMap = adj_list_edge_property_map, edge_weight_t>; IndexMap = vec_adj_list_vertex_id_map, long unsigned int>; Compare = std::less; Combine = detail::_project2nd; DistZero = double; ColorMap = two_bit_color_map, long unsigned int> >]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/dijkstra_shortest_paths.hpp:464:36: required from ‘void boost::dijkstra_shortest_paths(const VertexListGraph&, SourceInputIter, SourceInputIter, PredecessorMap, DistanceMap, WeightMap, IndexMap, Compare, Combine, DistInf, DistZero, DijkstraVisitor, ColorMap) [with VertexListGraph = R_adjacency_list; SourceInputIter = long unsigned int*; DijkstraVisitor = dijkstra_visitor<>; PredecessorMap = long unsigned int*; DistanceMap = iterator_property_map<__gnu_cxx::__normal_iterator > >, vec_adj_list_vertex_id_map, long unsigned int>, double, double&>; WeightMap = adj_list_edge_property_map, edge_weight_t>; IndexMap = vec_adj_list_vertex_id_map, long unsigned int>; Compare = std::less; Combine = detail::_project2nd; DistInf = double; DistZero = double; ColorMap = two_bit_color_map, long unsigned int> >]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/dijkstra_shortest_paths.hpp:417:28: required from ‘void boost::dijkstra_shortest_paths(const VertexListGraph&, SourceInputIter, SourceInputIter, PredecessorMap, DistanceMap, WeightMap, IndexMap, Compare, Combine, DistInf, DistZero, DijkstraVisitor, const bgl_named_params&, typename enable_if_c::traversal_category>::value, graph::detail::no_parameter>::type) [with VertexListGraph = R_adjacency_list; SourceInputIter = long unsigned int*; DijkstraVisitor = dijkstra_visitor<>; PredecessorMap = long unsigned int*; DistanceMap = iterator_property_map<__gnu_cxx::__normal_iterator > >, vec_adj_list_vertex_id_map, long unsigned int>, double, double&>; WeightMap = adj_list_edge_property_map, edge_weight_t>; IndexMap = vec_adj_list_vertex_id_map, long unsigned int>; Compare = std::less; Combine = detail::_project2nd; DistInf = double; DistZero = double; T = char; Tag = detail::unused_tag_type; Base = no_property; typename enable_if_c::traversal_category>::value, graph::detail::no_parameter>::type = graph::detail::no_parameter; typename graph_traits::traversal_category = undir_adj_list_traversal_tag]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/dijkstra_shortest_paths.hpp:491:28: [ skipping 2 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/dijkstra_shortest_paths.hpp:528:32: required from ‘void boost::detail::dijkstra_dispatch2(const VertexListGraph&, typename boost::graph_traits::vertex_descriptor, DistanceMap, WeightMap, IndexMap, const Params&) [with VertexListGraph = R_adjacency_list; DistanceMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator > >, boost::vec_adj_list_vertex_id_map, long unsigned int>, double, double&>; WeightMap = boost::adj_list_edge_property_map, boost::edge_weight_t>; IndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>; Params = boost::bgl_named_params<_project2nd, boost::distance_combine_t, boost::bgl_named_params, boost::distance_compare_t, boost::bgl_named_params, boost::edge_weight_t>, boost::edge_weight_t, boost::bgl_named_params > > >; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/dijkstra_shortest_paths.hpp:554:35: required from ‘void boost::detail::dijkstra_dispatch1(const VertexListGraph&, typename boost::graph_traits::vertex_descriptor, DistanceMap, WeightMap, IndexMap, const Params&) [with VertexListGraph = R_adjacency_list; DistanceMap = boost::param_not_found; WeightMap = boost::adj_list_edge_property_map, boost::edge_weight_t>; IndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>; Params = boost::bgl_named_params<_project2nd, boost::distance_combine_t, boost::bgl_named_params, boost::distance_compare_t, boost::bgl_named_params, boost::edge_weight_t>, boost::edge_weight_t, boost::bgl_named_params > > >; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/dijkstra_shortest_paths.hpp:570:31: required from ‘void boost::dijkstra_shortest_paths(const VertexListGraph&, typename graph_traits::vertex_descriptor, const bgl_named_params&) [with VertexListGraph = R_adjacency_list; Param = detail::_project2nd; Tag = distance_combine_t; Rest = bgl_named_params, distance_compare_t, bgl_named_params, edge_weight_t>, edge_weight_t, bgl_named_params > >; typename graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/prim_minimum_spanning_tree.hpp:43:32: required from ‘void boost::detail::prim_mst_impl(const Graph&, typename boost::graph_traits::vertex_descriptor, const boost::bgl_named_params&, Weight) [with Graph = R_adjacency_list; P = boost::adj_list_edge_property_map, boost::edge_weight_t>; T = boost::edge_weight_t; R = boost::bgl_named_params; Weight = boost::adj_list_edge_property_map, boost::edge_weight_t>; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/prim_minimum_spanning_tree.hpp:77:26: required from ‘void boost::prim_minimum_spanning_tree(const VertexListGraph&, PredecessorMap) [with VertexListGraph = R_adjacency_list; PredecessorMap = long unsigned int*]’ minST.cpp:89:35: required from here /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:65:52: warning: ‘this’ pointer is null [-Wnonnull] 65 | static void failed() { ((Model*)0)->constraints(); } | ~~~~~~~~~~~~~~~~~~~~~~~~^~ In file included from /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/dijkstra_shortest_paths.hpp:21, from /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/prim_minimum_spanning_tree.hpp:15, from minST.cpp:3: /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/breadth_first_search.hpp:37:10: note: in a call to non-static member function ‘void boost::BFSVisitorConcept::constraints() [with Visitor = boost::detail::dijkstra_bfs_visitor, boost::d_ary_heap_indirect, long unsigned int>, long unsigned int, long unsigned int&>, boost::iterator_property_map<__gnu_cxx::__normal_iterator > >, boost::vec_adj_list_vertex_id_map, long unsigned int>, double, double&>, std::less, std::vector >, boost::adj_list_edge_property_map, boost::edge_weight_t>, long unsigned int*, boost::iterator_property_map<__gnu_cxx::__normal_iterator > >, boost::vec_adj_list_vertex_id_map, long unsigned int>, double, double&>, boost::detail::_project2nd, std::less >; Graph = R_adjacency_list]’ 37 | void constraints() | ^~~~~~~~~~~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::constraint::failed() [with Model = boost::ReadWritePropertyMapConcept, long unsigned int> >, long unsigned int>]’: /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/kruskal_min_spanning_tree.hpp:59:9: required from ‘void boost::breadth_first_visit(const IncidenceGraph&, SourceIterator, SourceIterator, Buffer&, BFSVisitor, ColorMap) [with IncidenceGraph = R_adjacency_list; Buffer = d_ary_heap_indirect, long unsigned int>, long unsigned int, long unsigned int&>, iterator_property_map<__gnu_cxx::__normal_iterator > >, vec_adj_list_vertex_id_map, long unsigned int>, double, double&>, std::less, std::vector >; BFSVisitor = detail::dijkstra_bfs_visitor, d_ary_heap_indirect, long unsigned int>, long unsigned int, long unsigned int&>, iterator_property_map<__gnu_cxx::__normal_iterator > >, vec_adj_list_vertex_id_map, long unsigned int>, double, double&>, std::less, std::vector >, adj_list_edge_property_map, edge_weight_t>, long unsigned int*, iterator_property_map<__gnu_cxx::__normal_iterator > >, vec_adj_list_vertex_id_map, long unsigned int>, double, double&>, detail::_project2nd, std::less >; ColorMap = two_bit_color_map, long unsigned int> >; SourceIterator = long unsigned int*]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/dijkstra_shortest_paths.hpp:387:24: required from ‘void boost::dijkstra_shortest_paths_no_init(const Graph&, SourceInputIter, SourceInputIter, PredecessorMap, DistanceMap, WeightMap, IndexMap, Compare, Combine, DistZero, DijkstraVisitor, ColorMap) [with Graph = R_adjacency_list; SourceInputIter = long unsigned int*; DijkstraVisitor = dijkstra_visitor<>; PredecessorMap = long unsigned int*; DistanceMap = iterator_property_map<__gnu_cxx::__normal_iterator > >, vec_adj_list_vertex_id_map, long unsigned int>, double, double&>; WeightMap = adj_list_edge_property_map, edge_weight_t>; IndexMap = vec_adj_list_vertex_id_map, long unsigned int>; Compare = std::less; Combine = detail::_project2nd; DistZero = double; ColorMap = two_bit_color_map, long unsigned int> >]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/dijkstra_shortest_paths.hpp:464:36: required from ‘void boost::dijkstra_shortest_paths(const VertexListGraph&, SourceInputIter, SourceInputIter, PredecessorMap, DistanceMap, WeightMap, IndexMap, Compare, Combine, DistInf, DistZero, DijkstraVisitor, ColorMap) [with VertexListGraph = R_adjacency_list; SourceInputIter = long unsigned int*; DijkstraVisitor = dijkstra_visitor<>; PredecessorMap = long unsigned int*; DistanceMap = iterator_property_map<__gnu_cxx::__normal_iterator > >, vec_adj_list_vertex_id_map, long unsigned int>, double, double&>; WeightMap = adj_list_edge_property_map, edge_weight_t>; IndexMap = vec_adj_list_vertex_id_map, long unsigned int>; Compare = std::less; Combine = detail::_project2nd; DistInf = double; DistZero = double; ColorMap = two_bit_color_map, long unsigned int> >]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/dijkstra_shortest_paths.hpp:417:28: required from ‘void boost::dijkstra_shortest_paths(const VertexListGraph&, SourceInputIter, SourceInputIter, PredecessorMap, DistanceMap, WeightMap, IndexMap, Compare, Combine, DistInf, DistZero, DijkstraVisitor, const bgl_named_params&, typename enable_if_c::traversal_category>::value, graph::detail::no_parameter>::type) [with VertexListGraph = R_adjacency_list; SourceInputIter = long unsigned int*; DijkstraVisitor = dijkstra_visitor<>; PredecessorMap = long unsigned int*; DistanceMap = iterator_property_map<__gnu_cxx::__normal_iterator > >, vec_adj_list_vertex_id_map, long unsigned int>, double, double&>; WeightMap = adj_list_edge_property_map, edge_weight_t>; IndexMap = vec_adj_list_vertex_id_map, long unsigned int>; Compare = std::less; Combine = detail::_project2nd; DistInf = double; DistZero = double; T = char; Tag = detail::unused_tag_type; Base = no_property; typename enable_if_c::traversal_category>::value, graph::detail::no_parameter>::type = graph::detail::no_parameter; typename graph_traits::traversal_category = undir_adj_list_traversal_tag]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/dijkstra_shortest_paths.hpp:491:28: [ skipping 2 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/dijkstra_shortest_paths.hpp:528:32: required from ‘void boost::detail::dijkstra_dispatch2(const VertexListGraph&, typename boost::graph_traits::vertex_descriptor, DistanceMap, WeightMap, IndexMap, const Params&) [with VertexListGraph = R_adjacency_list; DistanceMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator > >, boost::vec_adj_list_vertex_id_map, long unsigned int>, double, double&>; WeightMap = boost::adj_list_edge_property_map, boost::edge_weight_t>; IndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>; Params = boost::bgl_named_params<_project2nd, boost::distance_combine_t, boost::bgl_named_params, boost::distance_compare_t, boost::bgl_named_params, boost::edge_weight_t>, boost::edge_weight_t, boost::bgl_named_params > > >; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/dijkstra_shortest_paths.hpp:554:35: required from ‘void boost::detail::dijkstra_dispatch1(const VertexListGraph&, typename boost::graph_traits::vertex_descriptor, DistanceMap, WeightMap, IndexMap, const Params&) [with VertexListGraph = R_adjacency_list; DistanceMap = boost::param_not_found; WeightMap = boost::adj_list_edge_property_map, boost::edge_weight_t>; IndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>; Params = boost::bgl_named_params<_project2nd, boost::distance_combine_t, boost::bgl_named_params, boost::distance_compare_t, boost::bgl_named_params, boost::edge_weight_t>, boost::edge_weight_t, boost::bgl_named_params > > >; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/dijkstra_shortest_paths.hpp:570:31: required from ‘void boost::dijkstra_shortest_paths(const VertexListGraph&, typename graph_traits::vertex_descriptor, const bgl_named_params&) [with VertexListGraph = R_adjacency_list; Param = detail::_project2nd; Tag = distance_combine_t; Rest = bgl_named_params, distance_compare_t, bgl_named_params, edge_weight_t>, edge_weight_t, bgl_named_params > >; typename graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/prim_minimum_spanning_tree.hpp:43:32: required from ‘void boost::detail::prim_mst_impl(const Graph&, typename boost::graph_traits::vertex_descriptor, const boost::bgl_named_params&, Weight) [with Graph = R_adjacency_list; P = boost::adj_list_edge_property_map, boost::edge_weight_t>; T = boost::edge_weight_t; R = boost::bgl_named_params; Weight = boost::adj_list_edge_property_map, boost::edge_weight_t>; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/prim_minimum_spanning_tree.hpp:77:26: required from ‘void boost::prim_minimum_spanning_tree(const VertexListGraph&, PredecessorMap) [with VertexListGraph = R_adjacency_list; PredecessorMap = long unsigned int*]’ minST.cpp:89:35: required from here /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:65:52: warning: ‘this’ pointer is null [-Wnonnull] 65 | static void failed() { ((Model*)0)->constraints(); } | ~~~~~~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/property_map/property_map.hpp:205:10: note: in a call to non-static member function ‘void boost::ReadWritePropertyMapConcept::constraints() [with PMap = boost::two_bit_color_map, long unsigned int> >; Key = long unsigned int]’ 205 | void constraints() { | ^~~~~~~~~~~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::concepts::IncidenceGraph >]’: /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements > >]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/graph_concepts.hpp:87:5: required from ‘struct boost::concepts::IncidenceGraph >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/graph_concepts.hpp:75:1: required from ‘struct boost::concepts::IncidenceGraphConcept >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::concepts::IncidenceGraphConcept >]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied > >::value’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:45:51: [ skipping 8 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/dijkstra_shortest_paths.hpp:528:32: required from ‘void boost::detail::dijkstra_dispatch2(const VertexListGraph&, typename boost::graph_traits::vertex_descriptor, DistanceMap, WeightMap, IndexMap, const Params&) [with VertexListGraph = R_adjacency_list; DistanceMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator > >, boost::vec_adj_list_vertex_id_map, long unsigned int>, double, double&>; WeightMap = boost::adj_list_edge_property_map, boost::edge_weight_t>; IndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>; Params = boost::bgl_named_params<_project2nd, boost::distance_combine_t, boost::bgl_named_params, boost::distance_compare_t, boost::bgl_named_params, boost::edge_weight_t>, boost::edge_weight_t, boost::bgl_named_params > > >; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/dijkstra_shortest_paths.hpp:554:35: required from ‘void boost::detail::dijkstra_dispatch1(const VertexListGraph&, typename boost::graph_traits::vertex_descriptor, DistanceMap, WeightMap, IndexMap, const Params&) [with VertexListGraph = R_adjacency_list; DistanceMap = boost::param_not_found; WeightMap = boost::adj_list_edge_property_map, boost::edge_weight_t>; IndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>; Params = boost::bgl_named_params<_project2nd, boost::distance_combine_t, boost::bgl_named_params, boost::distance_compare_t, boost::bgl_named_params, boost::edge_weight_t>, boost::edge_weight_t, boost::bgl_named_params > > >; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/dijkstra_shortest_paths.hpp:570:31: required from ‘void boost::dijkstra_shortest_paths(const VertexListGraph&, typename graph_traits::vertex_descriptor, const bgl_named_params&) [with VertexListGraph = R_adjacency_list; Param = detail::_project2nd; Tag = distance_combine_t; Rest = bgl_named_params, distance_compare_t, bgl_named_params, edge_weight_t>, edge_weight_t, bgl_named_params > >; typename graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/prim_minimum_spanning_tree.hpp:43:32: required from ‘void boost::detail::prim_mst_impl(const Graph&, typename boost::graph_traits::vertex_descriptor, const boost::bgl_named_params&, Weight) [with Graph = R_adjacency_list; P = boost::adj_list_edge_property_map, boost::edge_weight_t>; T = boost::edge_weight_t; R = boost::bgl_named_params; Weight = boost::adj_list_edge_property_map, boost::edge_weight_t>; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/prim_minimum_spanning_tree.hpp:77:26: required from ‘void boost::prim_minimum_spanning_tree(const VertexListGraph&, PredecessorMap) [with VertexListGraph = R_adjacency_list; PredecessorMap = long unsigned int*]’ minST.cpp:89:35: required from here /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::concepts::IncidenceGraph::~IncidenceGraph() [with G = R_adjacency_list]’ 37 | ~model() | ^ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/graph_concepts.hpp:87:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 87 | BOOST_CONCEPT_USAGE(IncidenceGraph) | ^~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements, boost::d_ary_heap_indirect, long unsigned int>, long unsigned int, long unsigned int&>, boost::iterator_property_map<__gnu_cxx::__normal_iterator > >, boost::vec_adj_list_vertex_id_map, long unsigned int>, double, double&>, std::less, std::vector >, boost::adj_list_edge_property_map, boost::edge_weight_t>, long unsigned int*, boost::iterator_property_map<__gnu_cxx::__normal_iterator > >, boost::vec_adj_list_vertex_id_map, long unsigned int>, double, double&>, boost::detail::_project2nd, std::less > > >]’: /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:167:5: required from ‘struct boost::CopyConstructible, boost::d_ary_heap_indirect, long unsigned int>, long unsigned int, long unsigned int&>, boost::iterator_property_map<__gnu_cxx::__normal_iterator > >, boost::vec_adj_list_vertex_id_map, long unsigned int>, double, double&>, std::less, std::vector >, boost::adj_list_edge_property_map, boost::edge_weight_t>, long unsigned int*, boost::iterator_property_map<__gnu_cxx::__normal_iterator > >, boost::vec_adj_list_vertex_id_map, long unsigned int>, double, double&>, boost::detail::_project2nd, std::less > >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:165:3: required from ‘struct boost::CopyConstructibleConcept, boost::d_ary_heap_indirect, long unsigned int>, long unsigned int, long unsigned int&>, boost::iterator_property_map<__gnu_cxx::__normal_iterator > >, boost::vec_adj_list_vertex_id_map, long unsigned int>, double, double&>, std::less, std::vector >, boost::adj_list_edge_property_map, boost::edge_weight_t>, long unsigned int*, boost::iterator_property_map<__gnu_cxx::__normal_iterator > >, boost::vec_adj_list_vertex_id_map, long unsigned int>, double, double&>, boost::detail::_project2nd, std::less > >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::CopyConstructibleConcept, boost::d_ary_heap_indirect, long unsigned int>, long unsigned int, long unsigned int&>, boost::iterator_property_map<__gnu_cxx::__normal_iterator > >, boost::vec_adj_list_vertex_id_map, long unsigned int>, double, double&>, std::less, std::vector >, boost::adj_list_edge_property_map, boost::edge_weight_t>, long unsigned int*, boost::iterator_property_map<__gnu_cxx::__normal_iterator > >, boost::vec_adj_list_vertex_id_map, long unsigned int>, double, double&>, boost::detail::_project2nd, std::less > >]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied, boost::d_ary_heap_indirect, long unsigned int>, long unsigned int, long unsigned int&>, boost::iterator_property_map<__gnu_cxx::__normal_iterator > >, boost::vec_adj_list_vertex_id_map, long unsigned int>, double, double&>, std::less, std::vector >, boost::adj_list_edge_property_map, boost::edge_weight_t>, long unsigned int*, boost::iterator_property_map<__gnu_cxx::__normal_iterator > >, boost::vec_adj_list_vertex_id_map, long unsigned int>, double, double&>, boost::detail::_project2nd, std::less > > >::value’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied, boost::d_ary_heap_indirect, long unsigned int>, long unsigned int, long unsigned int&>, boost::iterator_property_map<__gnu_cxx::__normal_iterator > >, boost::vec_adj_list_vertex_id_map, long unsigned int>, double, double&>, std::less, std::vector >, boost::adj_list_edge_property_map, boost::edge_weight_t>, long unsigned int*, boost::iterator_property_map<__gnu_cxx::__normal_iterator > >, boost::vec_adj_list_vertex_id_map, long unsigned int>, double, double&>, boost::detail::_project2nd, std::less > > >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:72:8: [ skipping 12 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/dijkstra_shortest_paths.hpp:528:32: required from ‘void boost::detail::dijkstra_dispatch2(const VertexListGraph&, typename boost::graph_traits::vertex_descriptor, DistanceMap, WeightMap, IndexMap, const Params&) [with VertexListGraph = R_adjacency_list; DistanceMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator > >, boost::vec_adj_list_vertex_id_map, long unsigned int>, double, double&>; WeightMap = boost::adj_list_edge_property_map, boost::edge_weight_t>; IndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>; Params = boost::bgl_named_params<_project2nd, boost::distance_combine_t, boost::bgl_named_params, boost::distance_compare_t, boost::bgl_named_params, boost::edge_weight_t>, boost::edge_weight_t, boost::bgl_named_params > > >; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/dijkstra_shortest_paths.hpp:554:35: required from ‘void boost::detail::dijkstra_dispatch1(const VertexListGraph&, typename boost::graph_traits::vertex_descriptor, DistanceMap, WeightMap, IndexMap, const Params&) [with VertexListGraph = R_adjacency_list; DistanceMap = boost::param_not_found; WeightMap = boost::adj_list_edge_property_map, boost::edge_weight_t>; IndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>; Params = boost::bgl_named_params<_project2nd, boost::distance_combine_t, boost::bgl_named_params, boost::distance_compare_t, boost::bgl_named_params, boost::edge_weight_t>, boost::edge_weight_t, boost::bgl_named_params > > >; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/dijkstra_shortest_paths.hpp:570:31: required from ‘void boost::dijkstra_shortest_paths(const VertexListGraph&, typename graph_traits::vertex_descriptor, const bgl_named_params&) [with VertexListGraph = R_adjacency_list; Param = detail::_project2nd; Tag = distance_combine_t; Rest = bgl_named_params, distance_compare_t, bgl_named_params, edge_weight_t>, edge_weight_t, bgl_named_params > >; typename graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/prim_minimum_spanning_tree.hpp:43:32: required from ‘void boost::detail::prim_mst_impl(const Graph&, typename boost::graph_traits::vertex_descriptor, const boost::bgl_named_params&, Weight) [with Graph = R_adjacency_list; P = boost::adj_list_edge_property_map, boost::edge_weight_t>; T = boost::edge_weight_t; R = boost::bgl_named_params; Weight = boost::adj_list_edge_property_map, boost::edge_weight_t>; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/prim_minimum_spanning_tree.hpp:77:26: required from ‘void boost::prim_minimum_spanning_tree(const VertexListGraph&, PredecessorMap) [with VertexListGraph = R_adjacency_list; PredecessorMap = long unsigned int*]’ minST.cpp:89:35: required from here /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::CopyConstructible, boost::d_ary_heap_indirect, long unsigned int>, long unsigned int, long unsigned int&>, boost::iterator_property_map<__gnu_cxx::__normal_iterator > >, boost::vec_adj_list_vertex_id_map, long unsigned int>, double, double&>, std::less, std::vector >, boost::adj_list_edge_property_map, boost::edge_weight_t>, long unsigned int*, boost::iterator_property_map<__gnu_cxx::__normal_iterator > >, boost::vec_adj_list_vertex_id_map, long unsigned int>, double, double&>, boost::detail::_project2nd, std::less > >]’ 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ^ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::CopyConstructibleConcept, boost::d_ary_heap_indirect, long unsigned int>, long unsigned int, long unsigned int&>, boost::iterator_property_map<__gnu_cxx::__normal_iterator > >, boost::vec_adj_list_vertex_id_map, long unsigned int>, double, double&>, std::less, std::vector >, boost::adj_list_edge_property_map, boost::edge_weight_t>, long unsigned int*, boost::iterator_property_map<__gnu_cxx::__normal_iterator > >, boost::vec_adj_list_vertex_id_map, long unsigned int>, double, double&>, boost::detail::_project2nd, std::less > >]’: /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/breadth_first_search.hpp:39:9: required from ‘void boost::BFSVisitorConcept::constraints() [with Visitor = boost::detail::dijkstra_bfs_visitor, boost::d_ary_heap_indirect, long unsigned int>, long unsigned int, long unsigned int&>, boost::iterator_property_map<__gnu_cxx::__normal_iterator > >, boost::vec_adj_list_vertex_id_map, long unsigned int>, double, double&>, std::less, std::vector >, boost::adj_list_edge_property_map, boost::edge_weight_t>, long unsigned int*, boost::iterator_property_map<__gnu_cxx::__normal_iterator > >, boost::vec_adj_list_vertex_id_map, long unsigned int>, double, double&>, boost::detail::_project2nd, std::less >; Graph = R_adjacency_list]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::BFSVisitorConcept, boost::d_ary_heap_indirect, long unsigned int>, long unsigned int, long unsigned int&>, boost::iterator_property_map<__gnu_cxx::__normal_iterator > >, boost::vec_adj_list_vertex_id_map, long unsigned int>, double, double&>, std::less, std::vector >, boost::adj_list_edge_property_map, boost::edge_weight_t>, long unsigned int*, boost::iterator_property_map<__gnu_cxx::__normal_iterator > >, boost::vec_adj_list_vertex_id_map, long unsigned int>, double, double&>, boost::detail::_project2nd, std::less >, R_adjacency_list >]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied, boost::d_ary_heap_indirect, long unsigned int>, long unsigned int, long unsigned int&>, boost::iterator_property_map<__gnu_cxx::__normal_iterator > >, boost::vec_adj_list_vertex_id_map, long unsigned int>, double, double&>, std::less, std::vector >, boost::adj_list_edge_property_map, boost::edge_weight_t>, long unsigned int*, boost::iterator_property_map<__gnu_cxx::__normal_iterator > >, boost::vec_adj_list_vertex_id_map, long unsigned int>, double, double&>, boost::detail::_project2nd, std::less >, R_adjacency_list > >::value’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied, boost::d_ary_heap_indirect, long unsigned int>, long unsigned int, long unsigned int&>, boost::iterator_property_map<__gnu_cxx::__normal_iterator > >, boost::vec_adj_list_vertex_id_map, long unsigned int>, double, double&>, std::less, std::vector >, boost::adj_list_edge_property_map, boost::edge_weight_t>, long unsigned int*, boost::iterator_property_map<__gnu_cxx::__normal_iterator > >, boost::vec_adj_list_vertex_id_map, long unsigned int>, double, double&>, boost::detail::_project2nd, std::less >, R_adjacency_list > >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_, boost::d_ary_heap_indirect, long unsigned int>, long unsigned int, long unsigned int&>, boost::iterator_property_map<__gnu_cxx::__normal_iterator > >, boost::vec_adj_list_vertex_id_map, long unsigned int>, double, double&>, std::less, std::vector >, boost::adj_list_edge_property_map, boost::edge_weight_t>, long unsigned int*, boost::iterator_property_map<__gnu_cxx::__normal_iterator > >, boost::vec_adj_list_vertex_id_map, long unsigned int>, double, double&>, boost::detail::_project2nd, std::less >, R_adjacency_list >)>’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/breadth_first_search.hpp:65:5: [ skipping 6 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/dijkstra_shortest_paths.hpp:528:32: required from ‘void boost::detail::dijkstra_dispatch2(const VertexListGraph&, typename boost::graph_traits::vertex_descriptor, DistanceMap, WeightMap, IndexMap, const Params&) [with VertexListGraph = R_adjacency_list; DistanceMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator > >, boost::vec_adj_list_vertex_id_map, long unsigned int>, double, double&>; WeightMap = boost::adj_list_edge_property_map, boost::edge_weight_t>; IndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>; Params = boost::bgl_named_params<_project2nd, boost::distance_combine_t, boost::bgl_named_params, boost::distance_compare_t, boost::bgl_named_params, boost::edge_weight_t>, boost::edge_weight_t, boost::bgl_named_params > > >; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/dijkstra_shortest_paths.hpp:554:35: required from ‘void boost::detail::dijkstra_dispatch1(const VertexListGraph&, typename boost::graph_traits::vertex_descriptor, DistanceMap, WeightMap, IndexMap, const Params&) [with VertexListGraph = R_adjacency_list; DistanceMap = boost::param_not_found; WeightMap = boost::adj_list_edge_property_map, boost::edge_weight_t>; IndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>; Params = boost::bgl_named_params<_project2nd, boost::distance_combine_t, boost::bgl_named_params, boost::distance_compare_t, boost::bgl_named_params, boost::edge_weight_t>, boost::edge_weight_t, boost::bgl_named_params > > >; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/dijkstra_shortest_paths.hpp:570:31: required from ‘void boost::dijkstra_shortest_paths(const VertexListGraph&, typename graph_traits::vertex_descriptor, const bgl_named_params&) [with VertexListGraph = R_adjacency_list; Param = detail::_project2nd; Tag = distance_combine_t; Rest = bgl_named_params, distance_compare_t, bgl_named_params, edge_weight_t>, edge_weight_t, bgl_named_params > >; typename graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/prim_minimum_spanning_tree.hpp:43:32: required from ‘void boost::detail::prim_mst_impl(const Graph&, typename boost::graph_traits::vertex_descriptor, const boost::bgl_named_params&, Weight) [with Graph = R_adjacency_list; P = boost::adj_list_edge_property_map, boost::edge_weight_t>; T = boost::edge_weight_t; R = boost::bgl_named_params; Weight = boost::adj_list_edge_property_map, boost::edge_weight_t>; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/prim_minimum_spanning_tree.hpp:77:26: required from ‘void boost::prim_minimum_spanning_tree(const VertexListGraph&, PredecessorMap) [with VertexListGraph = R_adjacency_list; PredecessorMap = long unsigned int*]’ minST.cpp:89:35: required from here /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:165:17: note: in a call to non-static member function ‘boost::CopyConstructibleConcept, boost::d_ary_heap_indirect, long unsigned int>, long unsigned int, long unsigned int&>, boost::iterator_property_map<__gnu_cxx::__normal_iterator > >, boost::vec_adj_list_vertex_id_map, long unsigned int>, double, double&>, std::less, std::vector >, boost::adj_list_edge_property_map, boost::edge_weight_t>, long unsigned int*, boost::iterator_property_map<__gnu_cxx::__normal_iterator > >, boost::vec_adj_list_vertex_id_map, long unsigned int>, double, double&>, boost::detail::_project2nd, std::less > >::~CopyConstructibleConcept()’ 165 | BOOST_concept(CopyConstructible,(TT)) | ^~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/preprocessor/cat.hpp:29:34: note: in definition of macro ‘BOOST_PP_CAT_I’ 29 | # define BOOST_PP_CAT_I(a, b) a ## b | ^ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/concept_def.hpp:23:12: note: in expansion of macro ‘BOOST_PP_CAT’ 23 | struct BOOST_PP_CAT(name,Concept) \ | ^~~~~~~~~~~~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:165:3: note: in expansion of macro ‘BOOST_concept’ 165 | BOOST_concept(CopyConstructible,(TT)) | ^~~~~~~~~~~~~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::constraint::failed() [with Model = boost::ReadablePropertyMapConcept, long unsigned int> >, long unsigned int>]’: /home/omnipath/local/R/4.4-3.20/BH/include/boost/property_map/property_map.hpp:206:7: required from ‘void boost::ReadWritePropertyMapConcept::constraints() [with PMap = boost::two_bit_color_map, long unsigned int> >; Key = long unsigned int]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::ReadWritePropertyMapConcept, long unsigned int> >, long unsigned int>]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied, long unsigned int> >, long unsigned int> >::value’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied, long unsigned int> >, long unsigned int> >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_, long unsigned int> >, long unsigned int>)>’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/kruskal_min_spanning_tree.hpp:59:9: [ skipping 6 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/dijkstra_shortest_paths.hpp:528:32: required from ‘void boost::detail::dijkstra_dispatch2(const VertexListGraph&, typename boost::graph_traits::vertex_descriptor, DistanceMap, WeightMap, IndexMap, const Params&) [with VertexListGraph = R_adjacency_list; DistanceMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator > >, boost::vec_adj_list_vertex_id_map, long unsigned int>, double, double&>; WeightMap = boost::adj_list_edge_property_map, boost::edge_weight_t>; IndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>; Params = boost::bgl_named_params<_project2nd, boost::distance_combine_t, boost::bgl_named_params, boost::distance_compare_t, boost::bgl_named_params, boost::edge_weight_t>, boost::edge_weight_t, boost::bgl_named_params > > >; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/dijkstra_shortest_paths.hpp:554:35: required from ‘void boost::detail::dijkstra_dispatch1(const VertexListGraph&, typename boost::graph_traits::vertex_descriptor, DistanceMap, WeightMap, IndexMap, const Params&) [with VertexListGraph = R_adjacency_list; DistanceMap = boost::param_not_found; WeightMap = boost::adj_list_edge_property_map, boost::edge_weight_t>; IndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>; Params = boost::bgl_named_params<_project2nd, boost::distance_combine_t, boost::bgl_named_params, boost::distance_compare_t, boost::bgl_named_params, boost::edge_weight_t>, boost::edge_weight_t, boost::bgl_named_params > > >; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/dijkstra_shortest_paths.hpp:570:31: required from ‘void boost::dijkstra_shortest_paths(const VertexListGraph&, typename graph_traits::vertex_descriptor, const bgl_named_params&) [with VertexListGraph = R_adjacency_list; Param = detail::_project2nd; Tag = distance_combine_t; Rest = bgl_named_params, distance_compare_t, bgl_named_params, edge_weight_t>, edge_weight_t, bgl_named_params > >; typename graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/prim_minimum_spanning_tree.hpp:43:32: required from ‘void boost::detail::prim_mst_impl(const Graph&, typename boost::graph_traits::vertex_descriptor, const boost::bgl_named_params&, Weight) [with Graph = R_adjacency_list; P = boost::adj_list_edge_property_map, boost::edge_weight_t>; T = boost::edge_weight_t; R = boost::bgl_named_params; Weight = boost::adj_list_edge_property_map, boost::edge_weight_t>; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/prim_minimum_spanning_tree.hpp:77:26: required from ‘void boost::prim_minimum_spanning_tree(const VertexListGraph&, PredecessorMap) [with VertexListGraph = R_adjacency_list; PredecessorMap = long unsigned int*]’ minST.cpp:89:35: required from here /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:65:52: warning: ‘this’ pointer is null [-Wnonnull] 65 | static void failed() { ((Model*)0)->constraints(); } | ~~~~~~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/property_map/property_map.hpp:147:10: note: in a call to non-static member function ‘void boost::ReadablePropertyMapConcept::constraints() [with PMap = boost::two_bit_color_map, long unsigned int> >; Key = long unsigned int]’ 147 | void constraints() { | ^~~~~~~~~~~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::constraint::failed() [with Model = boost::WritablePropertyMapConcept, long unsigned int> >, long unsigned int>]’: /home/omnipath/local/R/4.4-3.20/BH/include/boost/property_map/property_map.hpp:207:7: required from ‘void boost::ReadWritePropertyMapConcept::constraints() [with PMap = boost::two_bit_color_map, long unsigned int> >; Key = long unsigned int]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::ReadWritePropertyMapConcept, long unsigned int> >, long unsigned int>]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied, long unsigned int> >, long unsigned int> >::value’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied, long unsigned int> >, long unsigned int> >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_, long unsigned int> >, long unsigned int>)>’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/kruskal_min_spanning_tree.hpp:59:9: [ skipping 6 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/dijkstra_shortest_paths.hpp:528:32: required from ‘void boost::detail::dijkstra_dispatch2(const VertexListGraph&, typename boost::graph_traits::vertex_descriptor, DistanceMap, WeightMap, IndexMap, const Params&) [with VertexListGraph = R_adjacency_list; DistanceMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator > >, boost::vec_adj_list_vertex_id_map, long unsigned int>, double, double&>; WeightMap = boost::adj_list_edge_property_map, boost::edge_weight_t>; IndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>; Params = boost::bgl_named_params<_project2nd, boost::distance_combine_t, boost::bgl_named_params, boost::distance_compare_t, boost::bgl_named_params, boost::edge_weight_t>, boost::edge_weight_t, boost::bgl_named_params > > >; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/dijkstra_shortest_paths.hpp:554:35: required from ‘void boost::detail::dijkstra_dispatch1(const VertexListGraph&, typename boost::graph_traits::vertex_descriptor, DistanceMap, WeightMap, IndexMap, const Params&) [with VertexListGraph = R_adjacency_list; DistanceMap = boost::param_not_found; WeightMap = boost::adj_list_edge_property_map, boost::edge_weight_t>; IndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>; Params = boost::bgl_named_params<_project2nd, boost::distance_combine_t, boost::bgl_named_params, boost::distance_compare_t, boost::bgl_named_params, boost::edge_weight_t>, boost::edge_weight_t, boost::bgl_named_params > > >; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/dijkstra_shortest_paths.hpp:570:31: required from ‘void boost::dijkstra_shortest_paths(const VertexListGraph&, typename graph_traits::vertex_descriptor, const bgl_named_params&) [with VertexListGraph = R_adjacency_list; Param = detail::_project2nd; Tag = distance_combine_t; Rest = bgl_named_params, distance_compare_t, bgl_named_params, edge_weight_t>, edge_weight_t, bgl_named_params > >; typename graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/prim_minimum_spanning_tree.hpp:43:32: required from ‘void boost::detail::prim_mst_impl(const Graph&, typename boost::graph_traits::vertex_descriptor, const boost::bgl_named_params&, Weight) [with Graph = R_adjacency_list; P = boost::adj_list_edge_property_map, boost::edge_weight_t>; T = boost::edge_weight_t; R = boost::bgl_named_params; Weight = boost::adj_list_edge_property_map, boost::edge_weight_t>; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/prim_minimum_spanning_tree.hpp:77:26: required from ‘void boost::prim_minimum_spanning_tree(const VertexListGraph&, PredecessorMap) [with VertexListGraph = R_adjacency_list; PredecessorMap = long unsigned int*]’ minST.cpp:89:35: required from here /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:65:52: warning: ‘this’ pointer is null [-Wnonnull] 65 | static void failed() { ((Model*)0)->constraints(); } | ~~~~~~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/property_map/property_map.hpp:179:10: note: in a call to non-static member function ‘void boost::WritablePropertyMapConcept::constraints() [with PMap = boost::two_bit_color_map, long unsigned int> >; Key = long unsigned int]’ 179 | void constraints() { | ^~~~~~~~~~~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements >]’: /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:208:5: required from ‘struct boost::Convertible’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:206:3: required from ‘struct boost::ConvertibleConcept’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::ConvertibleConcept]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied >::value’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:72:8: [ skipping 12 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/dijkstra_shortest_paths.hpp:528:32: required from ‘void boost::detail::dijkstra_dispatch2(const VertexListGraph&, typename boost::graph_traits::vertex_descriptor, DistanceMap, WeightMap, IndexMap, const Params&) [with VertexListGraph = R_adjacency_list; DistanceMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator > >, boost::vec_adj_list_vertex_id_map, long unsigned int>, double, double&>; WeightMap = boost::adj_list_edge_property_map, boost::edge_weight_t>; IndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>; Params = boost::bgl_named_params<_project2nd, boost::distance_combine_t, boost::bgl_named_params, boost::distance_compare_t, boost::bgl_named_params, boost::edge_weight_t>, boost::edge_weight_t, boost::bgl_named_params > > >; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/dijkstra_shortest_paths.hpp:554:35: required from ‘void boost::detail::dijkstra_dispatch1(const VertexListGraph&, typename boost::graph_traits::vertex_descriptor, DistanceMap, WeightMap, IndexMap, const Params&) [with VertexListGraph = R_adjacency_list; DistanceMap = boost::param_not_found; WeightMap = boost::adj_list_edge_property_map, boost::edge_weight_t>; IndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>; Params = boost::bgl_named_params<_project2nd, boost::distance_combine_t, boost::bgl_named_params, boost::distance_compare_t, boost::bgl_named_params, boost::edge_weight_t>, boost::edge_weight_t, boost::bgl_named_params > > >; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/dijkstra_shortest_paths.hpp:570:31: required from ‘void boost::dijkstra_shortest_paths(const VertexListGraph&, typename graph_traits::vertex_descriptor, const bgl_named_params&) [with VertexListGraph = R_adjacency_list; Param = detail::_project2nd; Tag = distance_combine_t; Rest = bgl_named_params, distance_compare_t, bgl_named_params, edge_weight_t>, edge_weight_t, bgl_named_params > >; typename graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/prim_minimum_spanning_tree.hpp:43:32: required from ‘void boost::detail::prim_mst_impl(const Graph&, typename boost::graph_traits::vertex_descriptor, const boost::bgl_named_params&, Weight) [with Graph = R_adjacency_list; P = boost::adj_list_edge_property_map, boost::edge_weight_t>; T = boost::edge_weight_t; R = boost::bgl_named_params; Weight = boost::adj_list_edge_property_map, boost::edge_weight_t>; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/prim_minimum_spanning_tree.hpp:77:26: required from ‘void boost::prim_minimum_spanning_tree(const VertexListGraph&, PredecessorMap) [with VertexListGraph = R_adjacency_list; PredecessorMap = long unsigned int*]’ minST.cpp:89:35: required from here /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::Convertible]’ 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ^ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::ConvertibleConcept]’: /home/omnipath/local/R/4.4-3.20/BH/include/boost/property_map/property_map.hpp:208:7: required from ‘void boost::ReadWritePropertyMapConcept::constraints() [with PMap = boost::two_bit_color_map, long unsigned int> >; Key = long unsigned int]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::ReadWritePropertyMapConcept, long unsigned int> >, long unsigned int>]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied, long unsigned int> >, long unsigned int> >::value’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied, long unsigned int> >, long unsigned int> >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_, long unsigned int> >, long unsigned int>)>’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/kruskal_min_spanning_tree.hpp:59:9: [ skipping 6 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/dijkstra_shortest_paths.hpp:528:32: required from ‘void boost::detail::dijkstra_dispatch2(const VertexListGraph&, typename boost::graph_traits::vertex_descriptor, DistanceMap, WeightMap, IndexMap, const Params&) [with VertexListGraph = R_adjacency_list; DistanceMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator > >, boost::vec_adj_list_vertex_id_map, long unsigned int>, double, double&>; WeightMap = boost::adj_list_edge_property_map, boost::edge_weight_t>; IndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>; Params = boost::bgl_named_params<_project2nd, boost::distance_combine_t, boost::bgl_named_params, boost::distance_compare_t, boost::bgl_named_params, boost::edge_weight_t>, boost::edge_weight_t, boost::bgl_named_params > > >; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/dijkstra_shortest_paths.hpp:554:35: required from ‘void boost::detail::dijkstra_dispatch1(const VertexListGraph&, typename boost::graph_traits::vertex_descriptor, DistanceMap, WeightMap, IndexMap, const Params&) [with VertexListGraph = R_adjacency_list; DistanceMap = boost::param_not_found; WeightMap = boost::adj_list_edge_property_map, boost::edge_weight_t>; IndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>; Params = boost::bgl_named_params<_project2nd, boost::distance_combine_t, boost::bgl_named_params, boost::distance_compare_t, boost::bgl_named_params, boost::edge_weight_t>, boost::edge_weight_t, boost::bgl_named_params > > >; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/dijkstra_shortest_paths.hpp:570:31: required from ‘void boost::dijkstra_shortest_paths(const VertexListGraph&, typename graph_traits::vertex_descriptor, const bgl_named_params&) [with VertexListGraph = R_adjacency_list; Param = detail::_project2nd; Tag = distance_combine_t; Rest = bgl_named_params, distance_compare_t, bgl_named_params, edge_weight_t>, edge_weight_t, bgl_named_params > >; typename graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/prim_minimum_spanning_tree.hpp:43:32: required from ‘void boost::detail::prim_mst_impl(const Graph&, typename boost::graph_traits::vertex_descriptor, const boost::bgl_named_params&, Weight) [with Graph = R_adjacency_list; P = boost::adj_list_edge_property_map, boost::edge_weight_t>; T = boost::edge_weight_t; R = boost::bgl_named_params; Weight = boost::adj_list_edge_property_map, boost::edge_weight_t>; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/prim_minimum_spanning_tree.hpp:77:26: required from ‘void boost::prim_minimum_spanning_tree(const VertexListGraph&, PredecessorMap) [with VertexListGraph = R_adjacency_list; PredecessorMap = long unsigned int*]’ minST.cpp:89:35: required from here /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:206:17: note: in a call to non-static member function ‘boost::ConvertibleConcept::~ConvertibleConcept()’ 206 | BOOST_concept(Convertible,(X)(Y)) | ^~~~~~~~~~~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/preprocessor/cat.hpp:29:34: note: in definition of macro ‘BOOST_PP_CAT_I’ 29 | # define BOOST_PP_CAT_I(a, b) a ## b | ^ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/concept_def.hpp:23:12: note: in expansion of macro ‘BOOST_PP_CAT’ 23 | struct BOOST_PP_CAT(name,Concept) \ | ^~~~~~~~~~~~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:206:3: note: in expansion of macro ‘BOOST_concept’ 206 | BOOST_concept(Convertible,(X)(Y)) | ^~~~~~~~~~~~~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements >]’: /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:145:5: required from ‘struct boost::Assignable’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:502:3: required from ‘struct boost::InputIterator’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:540:3: required from ‘struct boost::ForwardIterator’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:568:3: required from ‘struct boost::BidirectionalIterator’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:597:3: required from ‘struct boost::RandomAccessIterator’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:597:3: [ skipping 13 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/dijkstra_shortest_paths.hpp:528:32: required from ‘void boost::detail::dijkstra_dispatch2(const VertexListGraph&, typename boost::graph_traits::vertex_descriptor, DistanceMap, WeightMap, IndexMap, const Params&) [with VertexListGraph = R_adjacency_list; DistanceMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator > >, boost::vec_adj_list_vertex_id_map, long unsigned int>, double, double&>; WeightMap = boost::adj_list_edge_property_map, boost::edge_weight_t>; IndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>; Params = boost::bgl_named_params<_project2nd, boost::distance_combine_t, boost::bgl_named_params, boost::distance_compare_t, boost::bgl_named_params, boost::edge_weight_t>, boost::edge_weight_t, boost::bgl_named_params > > >; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/dijkstra_shortest_paths.hpp:554:35: required from ‘void boost::detail::dijkstra_dispatch1(const VertexListGraph&, typename boost::graph_traits::vertex_descriptor, DistanceMap, WeightMap, IndexMap, const Params&) [with VertexListGraph = R_adjacency_list; DistanceMap = boost::param_not_found; WeightMap = boost::adj_list_edge_property_map, boost::edge_weight_t>; IndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>; Params = boost::bgl_named_params<_project2nd, boost::distance_combine_t, boost::bgl_named_params, boost::distance_compare_t, boost::bgl_named_params, boost::edge_weight_t>, boost::edge_weight_t, boost::bgl_named_params > > >; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/dijkstra_shortest_paths.hpp:570:31: required from ‘void boost::dijkstra_shortest_paths(const VertexListGraph&, typename graph_traits::vertex_descriptor, const bgl_named_params&) [with VertexListGraph = R_adjacency_list; Param = detail::_project2nd; Tag = distance_combine_t; Rest = bgl_named_params, distance_compare_t, bgl_named_params, edge_weight_t>, edge_weight_t, bgl_named_params > >; typename graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/prim_minimum_spanning_tree.hpp:43:32: required from ‘void boost::detail::prim_mst_impl(const Graph&, typename boost::graph_traits::vertex_descriptor, const boost::bgl_named_params&, Weight) [with Graph = R_adjacency_list; P = boost::adj_list_edge_property_map, boost::edge_weight_t>; T = boost::edge_weight_t; R = boost::bgl_named_params; Weight = boost::adj_list_edge_property_map, boost::edge_weight_t>; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/prim_minimum_spanning_tree.hpp:77:26: required from ‘void boost::prim_minimum_spanning_tree(const VertexListGraph&, PredecessorMap) [with VertexListGraph = R_adjacency_list; PredecessorMap = long unsigned int*]’ minST.cpp:89:35: required from here /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::Assignable]’ 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ^ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements >]’: /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:233:5: required from ‘struct boost::EqualityComparable’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:502:3: required from ‘struct boost::InputIterator’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:540:3: required from ‘struct boost::ForwardIterator’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:568:3: required from ‘struct boost::BidirectionalIterator’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:597:3: required from ‘struct boost::RandomAccessIterator’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:597:3: [ skipping 13 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/dijkstra_shortest_paths.hpp:528:32: required from ‘void boost::detail::dijkstra_dispatch2(const VertexListGraph&, typename boost::graph_traits::vertex_descriptor, DistanceMap, WeightMap, IndexMap, const Params&) [with VertexListGraph = R_adjacency_list; DistanceMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator > >, boost::vec_adj_list_vertex_id_map, long unsigned int>, double, double&>; WeightMap = boost::adj_list_edge_property_map, boost::edge_weight_t>; IndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>; Params = boost::bgl_named_params<_project2nd, boost::distance_combine_t, boost::bgl_named_params, boost::distance_compare_t, boost::bgl_named_params, boost::edge_weight_t>, boost::edge_weight_t, boost::bgl_named_params > > >; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/dijkstra_shortest_paths.hpp:554:35: required from ‘void boost::detail::dijkstra_dispatch1(const VertexListGraph&, typename boost::graph_traits::vertex_descriptor, DistanceMap, WeightMap, IndexMap, const Params&) [with VertexListGraph = R_adjacency_list; DistanceMap = boost::param_not_found; WeightMap = boost::adj_list_edge_property_map, boost::edge_weight_t>; IndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>; Params = boost::bgl_named_params<_project2nd, boost::distance_combine_t, boost::bgl_named_params, boost::distance_compare_t, boost::bgl_named_params, boost::edge_weight_t>, boost::edge_weight_t, boost::bgl_named_params > > >; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/dijkstra_shortest_paths.hpp:570:31: required from ‘void boost::dijkstra_shortest_paths(const VertexListGraph&, typename graph_traits::vertex_descriptor, const bgl_named_params&) [with VertexListGraph = R_adjacency_list; Param = detail::_project2nd; Tag = distance_combine_t; Rest = bgl_named_params, distance_compare_t, bgl_named_params, edge_weight_t>, edge_weight_t, bgl_named_params > >; typename graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/prim_minimum_spanning_tree.hpp:43:32: required from ‘void boost::detail::prim_mst_impl(const Graph&, typename boost::graph_traits::vertex_descriptor, const boost::bgl_named_params&, Weight) [with Graph = R_adjacency_list; P = boost::adj_list_edge_property_map, boost::edge_weight_t>; T = boost::edge_weight_t; R = boost::bgl_named_params; Weight = boost::adj_list_edge_property_map, boost::edge_weight_t>; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/prim_minimum_spanning_tree.hpp:77:26: required from ‘void boost::prim_minimum_spanning_tree(const VertexListGraph&, PredecessorMap) [with VertexListGraph = R_adjacency_list; PredecessorMap = long unsigned int*]’ minST.cpp:89:35: required from here /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::EqualityComparable]’ 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ^ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements >]’: /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:512:7: required from ‘struct boost::InputIterator’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:540:3: required from ‘struct boost::ForwardIterator’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:568:3: required from ‘struct boost::BidirectionalIterator’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:597:3: required from ‘struct boost::RandomAccessIterator’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:597:3: required from ‘struct boost::RandomAccessIteratorConcept’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:32:62: [ skipping 12 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/dijkstra_shortest_paths.hpp:528:32: required from ‘void boost::detail::dijkstra_dispatch2(const VertexListGraph&, typename boost::graph_traits::vertex_descriptor, DistanceMap, WeightMap, IndexMap, const Params&) [with VertexListGraph = R_adjacency_list; DistanceMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator > >, boost::vec_adj_list_vertex_id_map, long unsigned int>, double, double&>; WeightMap = boost::adj_list_edge_property_map, boost::edge_weight_t>; IndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>; Params = boost::bgl_named_params<_project2nd, boost::distance_combine_t, boost::bgl_named_params, boost::distance_compare_t, boost::bgl_named_params, boost::edge_weight_t>, boost::edge_weight_t, boost::bgl_named_params > > >; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/dijkstra_shortest_paths.hpp:554:35: required from ‘void boost::detail::dijkstra_dispatch1(const VertexListGraph&, typename boost::graph_traits::vertex_descriptor, DistanceMap, WeightMap, IndexMap, const Params&) [with VertexListGraph = R_adjacency_list; DistanceMap = boost::param_not_found; WeightMap = boost::adj_list_edge_property_map, boost::edge_weight_t>; IndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>; Params = boost::bgl_named_params<_project2nd, boost::distance_combine_t, boost::bgl_named_params, boost::distance_compare_t, boost::bgl_named_params, boost::edge_weight_t>, boost::edge_weight_t, boost::bgl_named_params > > >; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/dijkstra_shortest_paths.hpp:570:31: required from ‘void boost::dijkstra_shortest_paths(const VertexListGraph&, typename graph_traits::vertex_descriptor, const bgl_named_params&) [with VertexListGraph = R_adjacency_list; Param = detail::_project2nd; Tag = distance_combine_t; Rest = bgl_named_params, distance_compare_t, bgl_named_params, edge_weight_t>, edge_weight_t, bgl_named_params > >; typename graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/prim_minimum_spanning_tree.hpp:43:32: required from ‘void boost::detail::prim_mst_impl(const Graph&, typename boost::graph_traits::vertex_descriptor, const boost::bgl_named_params&, Weight) [with Graph = R_adjacency_list; P = boost::adj_list_edge_property_map, boost::edge_weight_t>; T = boost::edge_weight_t; R = boost::bgl_named_params; Weight = boost::adj_list_edge_property_map, boost::edge_weight_t>; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/prim_minimum_spanning_tree.hpp:77:26: required from ‘void boost::prim_minimum_spanning_tree(const VertexListGraph&, PredecessorMap) [with VertexListGraph = R_adjacency_list; PredecessorMap = long unsigned int*]’ minST.cpp:89:35: required from here /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::InputIterator]’ 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ^ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements >]’: /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:543:7: required from ‘struct boost::ForwardIterator’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:568:3: required from ‘struct boost::BidirectionalIterator’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:597:3: required from ‘struct boost::RandomAccessIterator’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:597:3: required from ‘struct boost::RandomAccessIteratorConcept’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::RandomAccessIteratorConcept]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:42:5: [ skipping 11 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/dijkstra_shortest_paths.hpp:528:32: required from ‘void boost::detail::dijkstra_dispatch2(const VertexListGraph&, typename boost::graph_traits::vertex_descriptor, DistanceMap, WeightMap, IndexMap, const Params&) [with VertexListGraph = R_adjacency_list; DistanceMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator > >, boost::vec_adj_list_vertex_id_map, long unsigned int>, double, double&>; WeightMap = boost::adj_list_edge_property_map, boost::edge_weight_t>; IndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>; Params = boost::bgl_named_params<_project2nd, boost::distance_combine_t, boost::bgl_named_params, boost::distance_compare_t, boost::bgl_named_params, boost::edge_weight_t>, boost::edge_weight_t, boost::bgl_named_params > > >; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/dijkstra_shortest_paths.hpp:554:35: required from ‘void boost::detail::dijkstra_dispatch1(const VertexListGraph&, typename boost::graph_traits::vertex_descriptor, DistanceMap, WeightMap, IndexMap, const Params&) [with VertexListGraph = R_adjacency_list; DistanceMap = boost::param_not_found; WeightMap = boost::adj_list_edge_property_map, boost::edge_weight_t>; IndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>; Params = boost::bgl_named_params<_project2nd, boost::distance_combine_t, boost::bgl_named_params, boost::distance_compare_t, boost::bgl_named_params, boost::edge_weight_t>, boost::edge_weight_t, boost::bgl_named_params > > >; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/dijkstra_shortest_paths.hpp:570:31: required from ‘void boost::dijkstra_shortest_paths(const VertexListGraph&, typename graph_traits::vertex_descriptor, const bgl_named_params&) [with VertexListGraph = R_adjacency_list; Param = detail::_project2nd; Tag = distance_combine_t; Rest = bgl_named_params, distance_compare_t, bgl_named_params, edge_weight_t>, edge_weight_t, bgl_named_params > >; typename graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/prim_minimum_spanning_tree.hpp:43:32: required from ‘void boost::detail::prim_mst_impl(const Graph&, typename boost::graph_traits::vertex_descriptor, const boost::bgl_named_params&, Weight) [with Graph = R_adjacency_list; P = boost::adj_list_edge_property_map, boost::edge_weight_t>; T = boost::edge_weight_t; R = boost::bgl_named_params; Weight = boost::adj_list_edge_property_map, boost::edge_weight_t>; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/prim_minimum_spanning_tree.hpp:77:26: required from ‘void boost::prim_minimum_spanning_tree(const VertexListGraph&, PredecessorMap) [with VertexListGraph = R_adjacency_list; PredecessorMap = long unsigned int*]’ minST.cpp:89:35: required from here /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::ForwardIterator]’ 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ^ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements >]’: /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:571:7: required from ‘struct boost::BidirectionalIterator’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:597:3: required from ‘struct boost::RandomAccessIterator’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:597:3: required from ‘struct boost::RandomAccessIteratorConcept’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::RandomAccessIteratorConcept]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied >::value’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:45:51: [ skipping 10 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/dijkstra_shortest_paths.hpp:528:32: required from ‘void boost::detail::dijkstra_dispatch2(const VertexListGraph&, typename boost::graph_traits::vertex_descriptor, DistanceMap, WeightMap, IndexMap, const Params&) [with VertexListGraph = R_adjacency_list; DistanceMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator > >, boost::vec_adj_list_vertex_id_map, long unsigned int>, double, double&>; WeightMap = boost::adj_list_edge_property_map, boost::edge_weight_t>; IndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>; Params = boost::bgl_named_params<_project2nd, boost::distance_combine_t, boost::bgl_named_params, boost::distance_compare_t, boost::bgl_named_params, boost::edge_weight_t>, boost::edge_weight_t, boost::bgl_named_params > > >; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/dijkstra_shortest_paths.hpp:554:35: required from ‘void boost::detail::dijkstra_dispatch1(const VertexListGraph&, typename boost::graph_traits::vertex_descriptor, DistanceMap, WeightMap, IndexMap, const Params&) [with VertexListGraph = R_adjacency_list; DistanceMap = boost::param_not_found; WeightMap = boost::adj_list_edge_property_map, boost::edge_weight_t>; IndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>; Params = boost::bgl_named_params<_project2nd, boost::distance_combine_t, boost::bgl_named_params, boost::distance_compare_t, boost::bgl_named_params, boost::edge_weight_t>, boost::edge_weight_t, boost::bgl_named_params > > >; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/dijkstra_shortest_paths.hpp:570:31: required from ‘void boost::dijkstra_shortest_paths(const VertexListGraph&, typename graph_traits::vertex_descriptor, const bgl_named_params&) [with VertexListGraph = R_adjacency_list; Param = detail::_project2nd; Tag = distance_combine_t; Rest = bgl_named_params, distance_compare_t, bgl_named_params, edge_weight_t>, edge_weight_t, bgl_named_params > >; typename graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/prim_minimum_spanning_tree.hpp:43:32: required from ‘void boost::detail::prim_mst_impl(const Graph&, typename boost::graph_traits::vertex_descriptor, const boost::bgl_named_params&, Weight) [with Graph = R_adjacency_list; P = boost::adj_list_edge_property_map, boost::edge_weight_t>; T = boost::edge_weight_t; R = boost::bgl_named_params; Weight = boost::adj_list_edge_property_map, boost::edge_weight_t>; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/prim_minimum_spanning_tree.hpp:77:26: required from ‘void boost::prim_minimum_spanning_tree(const VertexListGraph&, PredecessorMap) [with VertexListGraph = R_adjacency_list; PredecessorMap = long unsigned int*]’ minST.cpp:89:35: required from here /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::BidirectionalIterator]’ 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ^ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements >]’: /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:253:5: required from ‘struct boost::Comparable’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:597:3: required from ‘struct boost::RandomAccessIterator’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:597:3: required from ‘struct boost::RandomAccessIteratorConcept’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::RandomAccessIteratorConcept]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied >::value’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:45:51: [ skipping 10 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/dijkstra_shortest_paths.hpp:528:32: required from ‘void boost::detail::dijkstra_dispatch2(const VertexListGraph&, typename boost::graph_traits::vertex_descriptor, DistanceMap, WeightMap, IndexMap, const Params&) [with VertexListGraph = R_adjacency_list; DistanceMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator > >, boost::vec_adj_list_vertex_id_map, long unsigned int>, double, double&>; WeightMap = boost::adj_list_edge_property_map, boost::edge_weight_t>; IndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>; Params = boost::bgl_named_params<_project2nd, boost::distance_combine_t, boost::bgl_named_params, boost::distance_compare_t, boost::bgl_named_params, boost::edge_weight_t>, boost::edge_weight_t, boost::bgl_named_params > > >; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/dijkstra_shortest_paths.hpp:554:35: required from ‘void boost::detail::dijkstra_dispatch1(const VertexListGraph&, typename boost::graph_traits::vertex_descriptor, DistanceMap, WeightMap, IndexMap, const Params&) [with VertexListGraph = R_adjacency_list; DistanceMap = boost::param_not_found; WeightMap = boost::adj_list_edge_property_map, boost::edge_weight_t>; IndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>; Params = boost::bgl_named_params<_project2nd, boost::distance_combine_t, boost::bgl_named_params, boost::distance_compare_t, boost::bgl_named_params, boost::edge_weight_t>, boost::edge_weight_t, boost::bgl_named_params > > >; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/dijkstra_shortest_paths.hpp:570:31: required from ‘void boost::dijkstra_shortest_paths(const VertexListGraph&, typename graph_traits::vertex_descriptor, const bgl_named_params&) [with VertexListGraph = R_adjacency_list; Param = detail::_project2nd; Tag = distance_combine_t; Rest = bgl_named_params, distance_compare_t, bgl_named_params, edge_weight_t>, edge_weight_t, bgl_named_params > >; typename graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/prim_minimum_spanning_tree.hpp:43:32: required from ‘void boost::detail::prim_mst_impl(const Graph&, typename boost::graph_traits::vertex_descriptor, const boost::bgl_named_params&, Weight) [with Graph = R_adjacency_list; P = boost::adj_list_edge_property_map, boost::edge_weight_t>; T = boost::edge_weight_t; R = boost::bgl_named_params; Weight = boost::adj_list_edge_property_map, boost::edge_weight_t>; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/prim_minimum_spanning_tree.hpp:77:26: required from ‘void boost::prim_minimum_spanning_tree(const VertexListGraph&, PredecessorMap) [with VertexListGraph = R_adjacency_list; PredecessorMap = long unsigned int*]’ minST.cpp:89:35: required from here /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::Comparable]’ 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ^ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements >]’: /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:601:7: required from ‘struct boost::RandomAccessIterator’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:597:3: required from ‘struct boost::RandomAccessIteratorConcept’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::RandomAccessIteratorConcept]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied >::value’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:72:8: [ skipping 9 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/dijkstra_shortest_paths.hpp:528:32: required from ‘void boost::detail::dijkstra_dispatch2(const VertexListGraph&, typename boost::graph_traits::vertex_descriptor, DistanceMap, WeightMap, IndexMap, const Params&) [with VertexListGraph = R_adjacency_list; DistanceMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator > >, boost::vec_adj_list_vertex_id_map, long unsigned int>, double, double&>; WeightMap = boost::adj_list_edge_property_map, boost::edge_weight_t>; IndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>; Params = boost::bgl_named_params<_project2nd, boost::distance_combine_t, boost::bgl_named_params, boost::distance_compare_t, boost::bgl_named_params, boost::edge_weight_t>, boost::edge_weight_t, boost::bgl_named_params > > >; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/dijkstra_shortest_paths.hpp:554:35: required from ‘void boost::detail::dijkstra_dispatch1(const VertexListGraph&, typename boost::graph_traits::vertex_descriptor, DistanceMap, WeightMap, IndexMap, const Params&) [with VertexListGraph = R_adjacency_list; DistanceMap = boost::param_not_found; WeightMap = boost::adj_list_edge_property_map, boost::edge_weight_t>; IndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>; Params = boost::bgl_named_params<_project2nd, boost::distance_combine_t, boost::bgl_named_params, boost::distance_compare_t, boost::bgl_named_params, boost::edge_weight_t>, boost::edge_weight_t, boost::bgl_named_params > > >; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/dijkstra_shortest_paths.hpp:570:31: required from ‘void boost::dijkstra_shortest_paths(const VertexListGraph&, typename graph_traits::vertex_descriptor, const bgl_named_params&) [with VertexListGraph = R_adjacency_list; Param = detail::_project2nd; Tag = distance_combine_t; Rest = bgl_named_params, distance_compare_t, bgl_named_params, edge_weight_t>, edge_weight_t, bgl_named_params > >; typename graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/prim_minimum_spanning_tree.hpp:43:32: required from ‘void boost::detail::prim_mst_impl(const Graph&, typename boost::graph_traits::vertex_descriptor, const boost::bgl_named_params&, Weight) [with Graph = R_adjacency_list; P = boost::adj_list_edge_property_map, boost::edge_weight_t>; T = boost::edge_weight_t; R = boost::bgl_named_params; Weight = boost::adj_list_edge_property_map, boost::edge_weight_t>; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/prim_minimum_spanning_tree.hpp:77:26: required from ‘void boost::prim_minimum_spanning_tree(const VertexListGraph&, PredecessorMap) [with VertexListGraph = R_adjacency_list; PredecessorMap = long unsigned int*]’ minST.cpp:89:35: required from here /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::RandomAccessIterator]’ 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ^ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::RandomAccessIteratorConcept]’: /home/omnipath/local/R/4.4-3.20/BH/include/boost/property_map/property_map.hpp:354:5: required from ‘boost::iterator_property_map >::value_type, typename std::iterator_traits< >::reference> boost::make_iterator_property_map(RAIter, ID) [with RAIter = long unsigned int*; ID = vec_adj_list_vertex_id_map, long unsigned int>; typename std::iterator_traits< >::value_type = long unsigned int; typename std::iterator_traits< >::reference = long unsigned int&]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/dijkstra_shortest_paths.hpp:245:46: required from ‘static boost::detail::vertex_property_map_generator_helper::type boost::detail::vertex_property_map_generator_helper::build(const Graph&, const IndexMap&, boost::scoped_array&) [with Graph = R_adjacency_list; IndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>; Value = long unsigned int; type = boost::iterator_property_map, long unsigned int>, long unsigned int, long unsigned int&>]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/dijkstra_shortest_paths.hpp:273:33: required from ‘static boost::detail::vertex_property_map_generator::type boost::detail::vertex_property_map_generator::build(const Graph&, const IndexMap&, boost::scoped_array&) [with Graph = R_adjacency_list; IndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>; Value = long unsigned int; type = boost::iterator_property_map, long unsigned int>, long unsigned int, long unsigned int&>]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/dijkstra_shortest_paths.hpp:377:38: required from ‘void boost::dijkstra_shortest_paths_no_init(const Graph&, SourceInputIter, SourceInputIter, PredecessorMap, DistanceMap, WeightMap, IndexMap, Compare, Combine, DistZero, DijkstraVisitor, ColorMap) [with Graph = R_adjacency_list; SourceInputIter = long unsigned int*; DijkstraVisitor = dijkstra_visitor<>; PredecessorMap = long unsigned int*; DistanceMap = iterator_property_map<__gnu_cxx::__normal_iterator > >, vec_adj_list_vertex_id_map, long unsigned int>, double, double&>; WeightMap = adj_list_edge_property_map, edge_weight_t>; IndexMap = vec_adj_list_vertex_id_map, long unsigned int>; Compare = std::less; Combine = detail::_project2nd; DistZero = double; ColorMap = two_bit_color_map, long unsigned int> >]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/dijkstra_shortest_paths.hpp:464:36: required from ‘void boost::dijkstra_shortest_paths(const VertexListGraph&, SourceInputIter, SourceInputIter, PredecessorMap, DistanceMap, WeightMap, IndexMap, Compare, Combine, DistInf, DistZero, DijkstraVisitor, ColorMap) [with VertexListGraph = R_adjacency_list; SourceInputIter = long unsigned int*; DijkstraVisitor = dijkstra_visitor<>; PredecessorMap = long unsigned int*; DistanceMap = iterator_property_map<__gnu_cxx::__normal_iterator > >, vec_adj_list_vertex_id_map, long unsigned int>, double, double&>; WeightMap = adj_list_edge_property_map, edge_weight_t>; IndexMap = vec_adj_list_vertex_id_map, long unsigned int>; Compare = std::less; Combine = detail::_project2nd; DistInf = double; DistZero = double; ColorMap = two_bit_color_map, long unsigned int> >]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/dijkstra_shortest_paths.hpp:417:28: [ skipping 3 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/dijkstra_shortest_paths.hpp:528:32: required from ‘void boost::detail::dijkstra_dispatch2(const VertexListGraph&, typename boost::graph_traits::vertex_descriptor, DistanceMap, WeightMap, IndexMap, const Params&) [with VertexListGraph = R_adjacency_list; DistanceMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator > >, boost::vec_adj_list_vertex_id_map, long unsigned int>, double, double&>; WeightMap = boost::adj_list_edge_property_map, boost::edge_weight_t>; IndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>; Params = boost::bgl_named_params<_project2nd, boost::distance_combine_t, boost::bgl_named_params, boost::distance_compare_t, boost::bgl_named_params, boost::edge_weight_t>, boost::edge_weight_t, boost::bgl_named_params > > >; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/dijkstra_shortest_paths.hpp:554:35: required from ‘void boost::detail::dijkstra_dispatch1(const VertexListGraph&, typename boost::graph_traits::vertex_descriptor, DistanceMap, WeightMap, IndexMap, const Params&) [with VertexListGraph = R_adjacency_list; DistanceMap = boost::param_not_found; WeightMap = boost::adj_list_edge_property_map, boost::edge_weight_t>; IndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>; Params = boost::bgl_named_params<_project2nd, boost::distance_combine_t, boost::bgl_named_params, boost::distance_compare_t, boost::bgl_named_params, boost::edge_weight_t>, boost::edge_weight_t, boost::bgl_named_params > > >; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/dijkstra_shortest_paths.hpp:570:31: required from ‘void boost::dijkstra_shortest_paths(const VertexListGraph&, typename graph_traits::vertex_descriptor, const bgl_named_params&) [with VertexListGraph = R_adjacency_list; Param = detail::_project2nd; Tag = distance_combine_t; Rest = bgl_named_params, distance_compare_t, bgl_named_params, edge_weight_t>, edge_weight_t, bgl_named_params > >; typename graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/prim_minimum_spanning_tree.hpp:43:32: required from ‘void boost::detail::prim_mst_impl(const Graph&, typename boost::graph_traits::vertex_descriptor, const boost::bgl_named_params&, Weight) [with Graph = R_adjacency_list; P = boost::adj_list_edge_property_map, boost::edge_weight_t>; T = boost::edge_weight_t; R = boost::bgl_named_params; Weight = boost::adj_list_edge_property_map, boost::edge_weight_t>; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/prim_minimum_spanning_tree.hpp:77:26: required from ‘void boost::prim_minimum_spanning_tree(const VertexListGraph&, PredecessorMap) [with VertexListGraph = R_adjacency_list; PredecessorMap = long unsigned int*]’ minST.cpp:89:35: required from here /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:597:17: note: in a call to non-static member function ‘boost::RandomAccessIteratorConcept::~RandomAccessIteratorConcept()’ 597 | BOOST_concept(RandomAccessIterator,(TT)) | ^~~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/preprocessor/cat.hpp:29:34: note: in definition of macro ‘BOOST_PP_CAT_I’ 29 | # define BOOST_PP_CAT_I(a, b) a ## b | ^ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/concept_def.hpp:23:12: note: in expansion of macro ‘BOOST_PP_CAT’ 23 | struct BOOST_PP_CAT(name,Concept) \ | ^~~~~~~~~~~~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:597:3: note: in expansion of macro ‘BOOST_concept’ 597 | BOOST_concept(RandomAccessIterator,(TT)) | ^~~~~~~~~~~~~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements > >, boost::property >*, std::vector > >, boost::property >, std::allocator > >, boost::property > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >]’: /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/graph_concepts.hpp:52:50: required from ‘struct boost::concepts::MultiPassInputIterator > >, boost::property >*, std::vector > >, boost::property >, std::allocator > >, boost::property > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::concepts::MultiPassInputIterator > >, boost::property >*, std::vector > >, boost::property >, std::allocator > >, boost::property > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> >]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied > >, boost::property >*, std::vector > >, boost::property >, std::allocator > >, boost::property > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::value’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied > >, boost::property >*, std::vector > >, boost::property >, std::allocator > >, boost::property > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_ > >, boost::property >*, std::vector > >, boost::property >, std::allocator > >, boost::property > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> >)>’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/graph_concepts.hpp:89:9: [ skipping 8 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/dijkstra_shortest_paths.hpp:528:32: required from ‘void boost::detail::dijkstra_dispatch2(const VertexListGraph&, typename boost::graph_traits::vertex_descriptor, DistanceMap, WeightMap, IndexMap, const Params&) [with VertexListGraph = R_adjacency_list; DistanceMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator > >, boost::vec_adj_list_vertex_id_map, long unsigned int>, double, double&>; WeightMap = boost::adj_list_edge_property_map, boost::edge_weight_t>; IndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>; Params = boost::bgl_named_params<_project2nd, boost::distance_combine_t, boost::bgl_named_params, boost::distance_compare_t, boost::bgl_named_params, boost::edge_weight_t>, boost::edge_weight_t, boost::bgl_named_params > > >; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/dijkstra_shortest_paths.hpp:554:35: required from ‘void boost::detail::dijkstra_dispatch1(const VertexListGraph&, typename boost::graph_traits::vertex_descriptor, DistanceMap, WeightMap, IndexMap, const Params&) [with VertexListGraph = R_adjacency_list; DistanceMap = boost::param_not_found; WeightMap = boost::adj_list_edge_property_map, boost::edge_weight_t>; IndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>; Params = boost::bgl_named_params<_project2nd, boost::distance_combine_t, boost::bgl_named_params, boost::distance_compare_t, boost::bgl_named_params, boost::edge_weight_t>, boost::edge_weight_t, boost::bgl_named_params > > >; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/dijkstra_shortest_paths.hpp:570:31: required from ‘void boost::dijkstra_shortest_paths(const VertexListGraph&, typename graph_traits::vertex_descriptor, const bgl_named_params&) [with VertexListGraph = R_adjacency_list; Param = detail::_project2nd; Tag = distance_combine_t; Rest = bgl_named_params, distance_compare_t, bgl_named_params, edge_weight_t>, edge_weight_t, bgl_named_params > >; typename graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/prim_minimum_spanning_tree.hpp:43:32: required from ‘void boost::detail::prim_mst_impl(const Graph&, typename boost::graph_traits::vertex_descriptor, const boost::bgl_named_params&, Weight) [with Graph = R_adjacency_list; P = boost::adj_list_edge_property_map, boost::edge_weight_t>; T = boost::edge_weight_t; R = boost::bgl_named_params; Weight = boost::adj_list_edge_property_map, boost::edge_weight_t>; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/prim_minimum_spanning_tree.hpp:77:26: required from ‘void boost::prim_minimum_spanning_tree(const VertexListGraph&, PredecessorMap) [with VertexListGraph = R_adjacency_list; PredecessorMap = long unsigned int*]’ minST.cpp:89:35: required from here /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::concepts::MultiPassInputIterator > >, boost::property >*, std::vector > >, boost::property >, std::allocator > >, boost::property > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> >]’ 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ^ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::MultiPassInputIterator > >, boost::property >*, std::vector > >, boost::property >, std::allocator > >, boost::property > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> >]’: /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/graph_concepts.hpp:89:9: required from ‘boost::concepts::IncidenceGraph::~IncidenceGraph() [with G = R_adjacency_list]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/graph_concepts.hpp:75:1: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::IncidenceGraphConcept >]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/breadth_first_search.hpp:62:5: required from ‘void boost::breadth_first_visit(const IncidenceGraph&, SourceIterator, SourceIterator, Buffer&, BFSVisitor, ColorMap) [with IncidenceGraph = R_adjacency_list; Buffer = d_ary_heap_indirect, long unsigned int>, long unsigned int, long unsigned int&>, iterator_property_map<__gnu_cxx::__normal_iterator > >, vec_adj_list_vertex_id_map, long unsigned int>, double, double&>, std::less, std::vector >; BFSVisitor = detail::dijkstra_bfs_visitor, d_ary_heap_indirect, long unsigned int>, long unsigned int, long unsigned int&>, iterator_property_map<__gnu_cxx::__normal_iterator > >, vec_adj_list_vertex_id_map, long unsigned int>, double, double&>, std::less, std::vector >, adj_list_edge_property_map, edge_weight_t>, long unsigned int*, iterator_property_map<__gnu_cxx::__normal_iterator > >, vec_adj_list_vertex_id_map, long unsigned int>, double, double&>, detail::_project2nd, std::less >; ColorMap = two_bit_color_map, long unsigned int> >; SourceIterator = long unsigned int*]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/dijkstra_shortest_paths.hpp:387:24: required from ‘void boost::dijkstra_shortest_paths_no_init(const Graph&, SourceInputIter, SourceInputIter, PredecessorMap, DistanceMap, WeightMap, IndexMap, Compare, Combine, DistZero, DijkstraVisitor, ColorMap) [with Graph = R_adjacency_list; SourceInputIter = long unsigned int*; DijkstraVisitor = dijkstra_visitor<>; PredecessorMap = long unsigned int*; DistanceMap = iterator_property_map<__gnu_cxx::__normal_iterator > >, vec_adj_list_vertex_id_map, long unsigned int>, double, double&>; WeightMap = adj_list_edge_property_map, edge_weight_t>; IndexMap = vec_adj_list_vertex_id_map, long unsigned int>; Compare = std::less; Combine = detail::_project2nd; DistZero = double; ColorMap = two_bit_color_map, long unsigned int> >]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/dijkstra_shortest_paths.hpp:464:36: required from ‘void boost::dijkstra_shortest_paths(const VertexListGraph&, SourceInputIter, SourceInputIter, PredecessorMap, DistanceMap, WeightMap, IndexMap, Compare, Combine, DistInf, DistZero, DijkstraVisitor, ColorMap) [with VertexListGraph = R_adjacency_list; SourceInputIter = long unsigned int*; DijkstraVisitor = dijkstra_visitor<>; PredecessorMap = long unsigned int*; DistanceMap = iterator_property_map<__gnu_cxx::__normal_iterator > >, vec_adj_list_vertex_id_map, long unsigned int>, double, double&>; WeightMap = adj_list_edge_property_map, edge_weight_t>; IndexMap = vec_adj_list_vertex_id_map, long unsigned int>; Compare = std::less; Combine = detail::_project2nd; DistInf = double; DistZero = double; ColorMap = two_bit_color_map, long unsigned int> >]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/dijkstra_shortest_paths.hpp:417:28: [ skipping 3 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/dijkstra_shortest_paths.hpp:528:32: required from ‘void boost::detail::dijkstra_dispatch2(const VertexListGraph&, typename boost::graph_traits::vertex_descriptor, DistanceMap, WeightMap, IndexMap, const Params&) [with VertexListGraph = R_adjacency_list; DistanceMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator > >, boost::vec_adj_list_vertex_id_map, long unsigned int>, double, double&>; WeightMap = boost::adj_list_edge_property_map, boost::edge_weight_t>; IndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>; Params = boost::bgl_named_params<_project2nd, boost::distance_combine_t, boost::bgl_named_params, boost::distance_compare_t, boost::bgl_named_params, boost::edge_weight_t>, boost::edge_weight_t, boost::bgl_named_params > > >; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/dijkstra_shortest_paths.hpp:554:35: required from ‘void boost::detail::dijkstra_dispatch1(const VertexListGraph&, typename boost::graph_traits::vertex_descriptor, DistanceMap, WeightMap, IndexMap, const Params&) [with VertexListGraph = R_adjacency_list; DistanceMap = boost::param_not_found; WeightMap = boost::adj_list_edge_property_map, boost::edge_weight_t>; IndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>; Params = boost::bgl_named_params<_project2nd, boost::distance_combine_t, boost::bgl_named_params, boost::distance_compare_t, boost::bgl_named_params, boost::edge_weight_t>, boost::edge_weight_t, boost::bgl_named_params > > >; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/dijkstra_shortest_paths.hpp:570:31: required from ‘void boost::dijkstra_shortest_paths(const VertexListGraph&, typename graph_traits::vertex_descriptor, const bgl_named_params&) [with VertexListGraph = R_adjacency_list; Param = detail::_project2nd; Tag = distance_combine_t; Rest = bgl_named_params, distance_compare_t, bgl_named_params, edge_weight_t>, edge_weight_t, bgl_named_params > >; typename graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/prim_minimum_spanning_tree.hpp:43:32: required from ‘void boost::detail::prim_mst_impl(const Graph&, typename boost::graph_traits::vertex_descriptor, const boost::bgl_named_params&, Weight) [with Graph = R_adjacency_list; P = boost::adj_list_edge_property_map, boost::edge_weight_t>; T = boost::edge_weight_t; R = boost::bgl_named_params; Weight = boost::adj_list_edge_property_map, boost::edge_weight_t>; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/prim_minimum_spanning_tree.hpp:77:26: required from ‘void boost::prim_minimum_spanning_tree(const VertexListGraph&, PredecessorMap) [with VertexListGraph = R_adjacency_list; PredecessorMap = long unsigned int*]’ minST.cpp:89:35: required from here /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::concepts::MultiPassInputIterator::~MultiPassInputIterator() [with T = boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >, boost::property >*, std::vector > >, boost::property >, std::allocator > >, boost::property > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>]’ 37 | ~model() | ^ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/graph_concepts.hpp:52:50: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 52 | BOOST_concept(MultiPassInputIterator, (T)) { BOOST_CONCEPT_USAGE( | ^~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements >]’: /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:208:5: required from ‘struct boost::Convertible’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::Convertible]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied >::value’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_)>’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/graph_concepts.hpp:93:9: [ skipping 8 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/dijkstra_shortest_paths.hpp:528:32: required from ‘void boost::detail::dijkstra_dispatch2(const VertexListGraph&, typename boost::graph_traits::vertex_descriptor, DistanceMap, WeightMap, IndexMap, const Params&) [with VertexListGraph = R_adjacency_list; DistanceMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator > >, boost::vec_adj_list_vertex_id_map, long unsigned int>, double, double&>; WeightMap = boost::adj_list_edge_property_map, boost::edge_weight_t>; IndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>; Params = boost::bgl_named_params<_project2nd, boost::distance_combine_t, boost::bgl_named_params, boost::distance_compare_t, boost::bgl_named_params, boost::edge_weight_t>, boost::edge_weight_t, boost::bgl_named_params > > >; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/dijkstra_shortest_paths.hpp:554:35: required from ‘void boost::detail::dijkstra_dispatch1(const VertexListGraph&, typename boost::graph_traits::vertex_descriptor, DistanceMap, WeightMap, IndexMap, const Params&) [with VertexListGraph = R_adjacency_list; DistanceMap = boost::param_not_found; WeightMap = boost::adj_list_edge_property_map, boost::edge_weight_t>; IndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>; Params = boost::bgl_named_params<_project2nd, boost::distance_combine_t, boost::bgl_named_params, boost::distance_compare_t, boost::bgl_named_params, boost::edge_weight_t>, boost::edge_weight_t, boost::bgl_named_params > > >; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/dijkstra_shortest_paths.hpp:570:31: required from ‘void boost::dijkstra_shortest_paths(const VertexListGraph&, typename graph_traits::vertex_descriptor, const bgl_named_params&) [with VertexListGraph = R_adjacency_list; Param = detail::_project2nd; Tag = distance_combine_t; Rest = bgl_named_params, distance_compare_t, bgl_named_params, edge_weight_t>, edge_weight_t, bgl_named_params > >; typename graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/prim_minimum_spanning_tree.hpp:43:32: required from ‘void boost::detail::prim_mst_impl(const Graph&, typename boost::graph_traits::vertex_descriptor, const boost::bgl_named_params&, Weight) [with Graph = R_adjacency_list; P = boost::adj_list_edge_property_map, boost::edge_weight_t>; T = boost::edge_weight_t; R = boost::bgl_named_params; Weight = boost::adj_list_edge_property_map, boost::edge_weight_t>; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/prim_minimum_spanning_tree.hpp:77:26: required from ‘void boost::prim_minimum_spanning_tree(const VertexListGraph&, PredecessorMap) [with VertexListGraph = R_adjacency_list; PredecessorMap = long unsigned int*]’ minST.cpp:89:35: required from here /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::Convertible]’ 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ^ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::Convertible]’: /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/graph_concepts.hpp:93:9: required from ‘boost::concepts::IncidenceGraph::~IncidenceGraph() [with G = R_adjacency_list]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/graph_concepts.hpp:75:1: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::IncidenceGraphConcept >]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/breadth_first_search.hpp:62:5: required from ‘void boost::breadth_first_visit(const IncidenceGraph&, SourceIterator, SourceIterator, Buffer&, BFSVisitor, ColorMap) [with IncidenceGraph = R_adjacency_list; Buffer = d_ary_heap_indirect, long unsigned int>, long unsigned int, long unsigned int&>, iterator_property_map<__gnu_cxx::__normal_iterator > >, vec_adj_list_vertex_id_map, long unsigned int>, double, double&>, std::less, std::vector >; BFSVisitor = detail::dijkstra_bfs_visitor, d_ary_heap_indirect, long unsigned int>, long unsigned int, long unsigned int&>, iterator_property_map<__gnu_cxx::__normal_iterator > >, vec_adj_list_vertex_id_map, long unsigned int>, double, double&>, std::less, std::vector >, adj_list_edge_property_map, edge_weight_t>, long unsigned int*, iterator_property_map<__gnu_cxx::__normal_iterator > >, vec_adj_list_vertex_id_map, long unsigned int>, double, double&>, detail::_project2nd, std::less >; ColorMap = two_bit_color_map, long unsigned int> >; SourceIterator = long unsigned int*]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/dijkstra_shortest_paths.hpp:387:24: required from ‘void boost::dijkstra_shortest_paths_no_init(const Graph&, SourceInputIter, SourceInputIter, PredecessorMap, DistanceMap, WeightMap, IndexMap, Compare, Combine, DistZero, DijkstraVisitor, ColorMap) [with Graph = R_adjacency_list; SourceInputIter = long unsigned int*; DijkstraVisitor = dijkstra_visitor<>; PredecessorMap = long unsigned int*; DistanceMap = iterator_property_map<__gnu_cxx::__normal_iterator > >, vec_adj_list_vertex_id_map, long unsigned int>, double, double&>; WeightMap = adj_list_edge_property_map, edge_weight_t>; IndexMap = vec_adj_list_vertex_id_map, long unsigned int>; Compare = std::less; Combine = detail::_project2nd; DistZero = double; ColorMap = two_bit_color_map, long unsigned int> >]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/dijkstra_shortest_paths.hpp:464:36: required from ‘void boost::dijkstra_shortest_paths(const VertexListGraph&, SourceInputIter, SourceInputIter, PredecessorMap, DistanceMap, WeightMap, IndexMap, Compare, Combine, DistInf, DistZero, DijkstraVisitor, ColorMap) [with VertexListGraph = R_adjacency_list; SourceInputIter = long unsigned int*; DijkstraVisitor = dijkstra_visitor<>; PredecessorMap = long unsigned int*; DistanceMap = iterator_property_map<__gnu_cxx::__normal_iterator > >, vec_adj_list_vertex_id_map, long unsigned int>, double, double&>; WeightMap = adj_list_edge_property_map, edge_weight_t>; IndexMap = vec_adj_list_vertex_id_map, long unsigned int>; Compare = std::less; Combine = detail::_project2nd; DistInf = double; DistZero = double; ColorMap = two_bit_color_map, long unsigned int> >]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/dijkstra_shortest_paths.hpp:417:28: [ skipping 3 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/dijkstra_shortest_paths.hpp:528:32: required from ‘void boost::detail::dijkstra_dispatch2(const VertexListGraph&, typename boost::graph_traits::vertex_descriptor, DistanceMap, WeightMap, IndexMap, const Params&) [with VertexListGraph = R_adjacency_list; DistanceMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator > >, boost::vec_adj_list_vertex_id_map, long unsigned int>, double, double&>; WeightMap = boost::adj_list_edge_property_map, boost::edge_weight_t>; IndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>; Params = boost::bgl_named_params<_project2nd, boost::distance_combine_t, boost::bgl_named_params, boost::distance_compare_t, boost::bgl_named_params, boost::edge_weight_t>, boost::edge_weight_t, boost::bgl_named_params > > >; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/dijkstra_shortest_paths.hpp:554:35: required from ‘void boost::detail::dijkstra_dispatch1(const VertexListGraph&, typename boost::graph_traits::vertex_descriptor, DistanceMap, WeightMap, IndexMap, const Params&) [with VertexListGraph = R_adjacency_list; DistanceMap = boost::param_not_found; WeightMap = boost::adj_list_edge_property_map, boost::edge_weight_t>; IndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>; Params = boost::bgl_named_params<_project2nd, boost::distance_combine_t, boost::bgl_named_params, boost::distance_compare_t, boost::bgl_named_params, boost::edge_weight_t>, boost::edge_weight_t, boost::bgl_named_params > > >; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/dijkstra_shortest_paths.hpp:570:31: required from ‘void boost::dijkstra_shortest_paths(const VertexListGraph&, typename graph_traits::vertex_descriptor, const bgl_named_params&) [with VertexListGraph = R_adjacency_list; Param = detail::_project2nd; Tag = distance_combine_t; Rest = bgl_named_params, distance_compare_t, bgl_named_params, edge_weight_t>, edge_weight_t, bgl_named_params > >; typename graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/prim_minimum_spanning_tree.hpp:43:32: required from ‘void boost::detail::prim_mst_impl(const Graph&, typename boost::graph_traits::vertex_descriptor, const boost::bgl_named_params&, Weight) [with Graph = R_adjacency_list; P = boost::adj_list_edge_property_map, boost::edge_weight_t>; T = boost::edge_weight_t; R = boost::bgl_named_params; Weight = boost::adj_list_edge_property_map, boost::edge_weight_t>; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/prim_minimum_spanning_tree.hpp:77:26: required from ‘void boost::prim_minimum_spanning_tree(const VertexListGraph&, PredecessorMap) [with VertexListGraph = R_adjacency_list; PredecessorMap = long unsigned int*]’ minST.cpp:89:35: required from here /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::Convertible::~Convertible() [with X = boost::undir_adj_list_traversal_tag; Y = boost::incidence_graph_tag]’ 37 | ~model() | ^ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:208:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 208 | BOOST_CONCEPT_USAGE(Convertible) { | ^~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::CopyConstructible, boost::d_ary_heap_indirect, long unsigned int>, long unsigned int, long unsigned int&>, boost::iterator_property_map<__gnu_cxx::__normal_iterator > >, boost::vec_adj_list_vertex_id_map, long unsigned int>, double, double&>, std::less, std::vector >, boost::adj_list_edge_property_map, boost::edge_weight_t>, long unsigned int*, boost::iterator_property_map<__gnu_cxx::__normal_iterator > >, boost::vec_adj_list_vertex_id_map, long unsigned int>, double, double&>, boost::detail::_project2nd, std::less > >]’: /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements, boost::d_ary_heap_indirect, long unsigned int>, long unsigned int, long unsigned int&>, boost::iterator_property_map<__gnu_cxx::__normal_iterator > >, boost::vec_adj_list_vertex_id_map, long unsigned int>, double, double&>, std::less, std::vector >, boost::adj_list_edge_property_map, boost::edge_weight_t>, long unsigned int*, boost::iterator_property_map<__gnu_cxx::__normal_iterator > >, boost::vec_adj_list_vertex_id_map, long unsigned int>, double, double&>, boost::detail::_project2nd, std::less > > >]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:167:5: required from ‘struct boost::CopyConstructible, boost::d_ary_heap_indirect, long unsigned int>, long unsigned int, long unsigned int&>, boost::iterator_property_map<__gnu_cxx::__normal_iterator > >, boost::vec_adj_list_vertex_id_map, long unsigned int>, double, double&>, std::less, std::vector >, boost::adj_list_edge_property_map, boost::edge_weight_t>, long unsigned int*, boost::iterator_property_map<__gnu_cxx::__normal_iterator > >, boost::vec_adj_list_vertex_id_map, long unsigned int>, double, double&>, boost::detail::_project2nd, std::less > >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:165:3: required from ‘struct boost::CopyConstructibleConcept, boost::d_ary_heap_indirect, long unsigned int>, long unsigned int, long unsigned int&>, boost::iterator_property_map<__gnu_cxx::__normal_iterator > >, boost::vec_adj_list_vertex_id_map, long unsigned int>, double, double&>, std::less, std::vector >, boost::adj_list_edge_property_map, boost::edge_weight_t>, long unsigned int*, boost::iterator_property_map<__gnu_cxx::__normal_iterator > >, boost::vec_adj_list_vertex_id_map, long unsigned int>, double, double&>, boost::detail::_project2nd, std::less > >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::CopyConstructibleConcept, boost::d_ary_heap_indirect, long unsigned int>, long unsigned int, long unsigned int&>, boost::iterator_property_map<__gnu_cxx::__normal_iterator > >, boost::vec_adj_list_vertex_id_map, long unsigned int>, double, double&>, std::less, std::vector >, boost::adj_list_edge_property_map, boost::edge_weight_t>, long unsigned int*, boost::iterator_property_map<__gnu_cxx::__normal_iterator > >, boost::vec_adj_list_vertex_id_map, long unsigned int>, double, double&>, boost::detail::_project2nd, std::less > >]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied, boost::d_ary_heap_indirect, long unsigned int>, long unsigned int, long unsigned int&>, boost::iterator_property_map<__gnu_cxx::__normal_iterator > >, boost::vec_adj_list_vertex_id_map, long unsigned int>, double, double&>, std::less, std::vector >, boost::adj_list_edge_property_map, boost::edge_weight_t>, long unsigned int*, boost::iterator_property_map<__gnu_cxx::__normal_iterator > >, boost::vec_adj_list_vertex_id_map, long unsigned int>, double, double&>, boost::detail::_project2nd, std::less > > >::value’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:45:51: [ skipping 13 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/dijkstra_shortest_paths.hpp:528:32: required from ‘void boost::detail::dijkstra_dispatch2(const VertexListGraph&, typename boost::graph_traits::vertex_descriptor, DistanceMap, WeightMap, IndexMap, const Params&) [with VertexListGraph = R_adjacency_list; DistanceMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator > >, boost::vec_adj_list_vertex_id_map, long unsigned int>, double, double&>; WeightMap = boost::adj_list_edge_property_map, boost::edge_weight_t>; IndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>; Params = boost::bgl_named_params<_project2nd, boost::distance_combine_t, boost::bgl_named_params, boost::distance_compare_t, boost::bgl_named_params, boost::edge_weight_t>, boost::edge_weight_t, boost::bgl_named_params > > >; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/dijkstra_shortest_paths.hpp:554:35: required from ‘void boost::detail::dijkstra_dispatch1(const VertexListGraph&, typename boost::graph_traits::vertex_descriptor, DistanceMap, WeightMap, IndexMap, const Params&) [with VertexListGraph = R_adjacency_list; DistanceMap = boost::param_not_found; WeightMap = boost::adj_list_edge_property_map, boost::edge_weight_t>; IndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>; Params = boost::bgl_named_params<_project2nd, boost::distance_combine_t, boost::bgl_named_params, boost::distance_compare_t, boost::bgl_named_params, boost::edge_weight_t>, boost::edge_weight_t, boost::bgl_named_params > > >; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/dijkstra_shortest_paths.hpp:570:31: required from ‘void boost::dijkstra_shortest_paths(const VertexListGraph&, typename graph_traits::vertex_descriptor, const bgl_named_params&) [with VertexListGraph = R_adjacency_list; Param = detail::_project2nd; Tag = distance_combine_t; Rest = bgl_named_params, distance_compare_t, bgl_named_params, edge_weight_t>, edge_weight_t, bgl_named_params > >; typename graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/prim_minimum_spanning_tree.hpp:43:32: required from ‘void boost::detail::prim_mst_impl(const Graph&, typename boost::graph_traits::vertex_descriptor, const boost::bgl_named_params&, Weight) [with Graph = R_adjacency_list; P = boost::adj_list_edge_property_map, boost::edge_weight_t>; T = boost::edge_weight_t; R = boost::bgl_named_params; Weight = boost::adj_list_edge_property_map, boost::edge_weight_t>; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/prim_minimum_spanning_tree.hpp:77:26: required from ‘void boost::prim_minimum_spanning_tree(const VertexListGraph&, PredecessorMap) [with VertexListGraph = R_adjacency_list; PredecessorMap = long unsigned int*]’ minST.cpp:89:35: required from here /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::CopyConstructible::~CopyConstructible() [with TT = boost::detail::dijkstra_bfs_visitor, boost::d_ary_heap_indirect, long unsigned int>, long unsigned int, long unsigned int&>, boost::iterator_property_map<__gnu_cxx::__normal_iterator > >, boost::vec_adj_list_vertex_id_map, long unsigned int>, double, double&>, std::less, std::vector >, boost::adj_list_edge_property_map, boost::edge_weight_t>, long unsigned int*, boost::iterator_property_map<__gnu_cxx::__normal_iterator > >, boost::vec_adj_list_vertex_id_map, long unsigned int>, double, double&>, boost::detail::_project2nd, std::less >]’ 37 | ~model() | ^ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:167:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 167 | BOOST_CONCEPT_USAGE(CopyConstructible) { | ^~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements >]’: /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:208:5: required from ‘struct boost::Convertible’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:206:3: required from ‘struct boost::ConvertibleConcept’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::ConvertibleConcept]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied >::value’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:72:8: [ skipping 17 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/dijkstra_shortest_paths.hpp:528:32: required from ‘void boost::detail::dijkstra_dispatch2(const VertexListGraph&, typename boost::graph_traits::vertex_descriptor, DistanceMap, WeightMap, IndexMap, const Params&) [with VertexListGraph = R_adjacency_list; DistanceMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator > >, boost::vec_adj_list_vertex_id_map, long unsigned int>, double, double&>; WeightMap = boost::adj_list_edge_property_map, boost::edge_weight_t>; IndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>; Params = boost::bgl_named_params<_project2nd, boost::distance_combine_t, boost::bgl_named_params, boost::distance_compare_t, boost::bgl_named_params, boost::edge_weight_t>, boost::edge_weight_t, boost::bgl_named_params > > >; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/dijkstra_shortest_paths.hpp:554:35: required from ‘void boost::detail::dijkstra_dispatch1(const VertexListGraph&, typename boost::graph_traits::vertex_descriptor, DistanceMap, WeightMap, IndexMap, const Params&) [with VertexListGraph = R_adjacency_list; DistanceMap = boost::param_not_found; WeightMap = boost::adj_list_edge_property_map, boost::edge_weight_t>; IndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>; Params = boost::bgl_named_params<_project2nd, boost::distance_combine_t, boost::bgl_named_params, boost::distance_compare_t, boost::bgl_named_params, boost::edge_weight_t>, boost::edge_weight_t, boost::bgl_named_params > > >; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/dijkstra_shortest_paths.hpp:570:31: required from ‘void boost::dijkstra_shortest_paths(const VertexListGraph&, typename graph_traits::vertex_descriptor, const bgl_named_params&) [with VertexListGraph = R_adjacency_list; Param = detail::_project2nd; Tag = distance_combine_t; Rest = bgl_named_params, distance_compare_t, bgl_named_params, edge_weight_t>, edge_weight_t, bgl_named_params > >; typename graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/prim_minimum_spanning_tree.hpp:43:32: required from ‘void boost::detail::prim_mst_impl(const Graph&, typename boost::graph_traits::vertex_descriptor, const boost::bgl_named_params&, Weight) [with Graph = R_adjacency_list; P = boost::adj_list_edge_property_map, boost::edge_weight_t>; T = boost::edge_weight_t; R = boost::bgl_named_params; Weight = boost::adj_list_edge_property_map, boost::edge_weight_t>; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/prim_minimum_spanning_tree.hpp:77:26: required from ‘void boost::prim_minimum_spanning_tree(const VertexListGraph&, PredecessorMap) [with VertexListGraph = R_adjacency_list; PredecessorMap = long unsigned int*]’ minST.cpp:89:35: required from here /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::Convertible]’ 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ^ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::ConvertibleConcept]’: /home/omnipath/local/R/4.4-3.20/BH/include/boost/property_map/property_map.hpp:148:7: required from ‘void boost::ReadablePropertyMapConcept::constraints() [with PMap = boost::two_bit_color_map, long unsigned int> >; Key = long unsigned int]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::ReadablePropertyMapConcept, long unsigned int> >, long unsigned int>]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied, long unsigned int> >, long unsigned int> >::value’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied, long unsigned int> >, long unsigned int> >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_, long unsigned int> >, long unsigned int>)>’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/property_map/property_map.hpp:206:7: [ skipping 11 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/dijkstra_shortest_paths.hpp:528:32: required from ‘void boost::detail::dijkstra_dispatch2(const VertexListGraph&, typename boost::graph_traits::vertex_descriptor, DistanceMap, WeightMap, IndexMap, const Params&) [with VertexListGraph = R_adjacency_list; DistanceMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator > >, boost::vec_adj_list_vertex_id_map, long unsigned int>, double, double&>; WeightMap = boost::adj_list_edge_property_map, boost::edge_weight_t>; IndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>; Params = boost::bgl_named_params<_project2nd, boost::distance_combine_t, boost::bgl_named_params, boost::distance_compare_t, boost::bgl_named_params, boost::edge_weight_t>, boost::edge_weight_t, boost::bgl_named_params > > >; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/dijkstra_shortest_paths.hpp:554:35: required from ‘void boost::detail::dijkstra_dispatch1(const VertexListGraph&, typename boost::graph_traits::vertex_descriptor, DistanceMap, WeightMap, IndexMap, const Params&) [with VertexListGraph = R_adjacency_list; DistanceMap = boost::param_not_found; WeightMap = boost::adj_list_edge_property_map, boost::edge_weight_t>; IndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>; Params = boost::bgl_named_params<_project2nd, boost::distance_combine_t, boost::bgl_named_params, boost::distance_compare_t, boost::bgl_named_params, boost::edge_weight_t>, boost::edge_weight_t, boost::bgl_named_params > > >; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/dijkstra_shortest_paths.hpp:570:31: required from ‘void boost::dijkstra_shortest_paths(const VertexListGraph&, typename graph_traits::vertex_descriptor, const bgl_named_params&) [with VertexListGraph = R_adjacency_list; Param = detail::_project2nd; Tag = distance_combine_t; Rest = bgl_named_params, distance_compare_t, bgl_named_params, edge_weight_t>, edge_weight_t, bgl_named_params > >; typename graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/prim_minimum_spanning_tree.hpp:43:32: required from ‘void boost::detail::prim_mst_impl(const Graph&, typename boost::graph_traits::vertex_descriptor, const boost::bgl_named_params&, Weight) [with Graph = R_adjacency_list; P = boost::adj_list_edge_property_map, boost::edge_weight_t>; T = boost::edge_weight_t; R = boost::bgl_named_params; Weight = boost::adj_list_edge_property_map, boost::edge_weight_t>; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/prim_minimum_spanning_tree.hpp:77:26: required from ‘void boost::prim_minimum_spanning_tree(const VertexListGraph&, PredecessorMap) [with VertexListGraph = R_adjacency_list; PredecessorMap = long unsigned int*]’ minST.cpp:89:35: required from here /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:206:17: note: in a call to non-static member function ‘boost::ConvertibleConcept::~ConvertibleConcept()’ 206 | BOOST_concept(Convertible,(X)(Y)) | ^~~~~~~~~~~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/preprocessor/cat.hpp:29:34: note: in definition of macro ‘BOOST_PP_CAT_I’ 29 | # define BOOST_PP_CAT_I(a, b) a ## b | ^ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/concept_def.hpp:23:12: note: in expansion of macro ‘BOOST_PP_CAT’ 23 | struct BOOST_PP_CAT(name,Concept) \ | ^~~~~~~~~~~~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:206:3: note: in expansion of macro ‘BOOST_concept’ 206 | BOOST_concept(Convertible,(X)(Y)) | ^~~~~~~~~~~~~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements >]’: /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:208:5: required from ‘struct boost::Convertible’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:206:3: required from ‘struct boost::ConvertibleConcept’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::ConvertibleConcept]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied >::value’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:72:8: [ skipping 17 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/dijkstra_shortest_paths.hpp:528:32: required from ‘void boost::detail::dijkstra_dispatch2(const VertexListGraph&, typename boost::graph_traits::vertex_descriptor, DistanceMap, WeightMap, IndexMap, const Params&) [with VertexListGraph = R_adjacency_list; DistanceMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator > >, boost::vec_adj_list_vertex_id_map, long unsigned int>, double, double&>; WeightMap = boost::adj_list_edge_property_map, boost::edge_weight_t>; IndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>; Params = boost::bgl_named_params<_project2nd, boost::distance_combine_t, boost::bgl_named_params, boost::distance_compare_t, boost::bgl_named_params, boost::edge_weight_t>, boost::edge_weight_t, boost::bgl_named_params > > >; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/dijkstra_shortest_paths.hpp:554:35: required from ‘void boost::detail::dijkstra_dispatch1(const VertexListGraph&, typename boost::graph_traits::vertex_descriptor, DistanceMap, WeightMap, IndexMap, const Params&) [with VertexListGraph = R_adjacency_list; DistanceMap = boost::param_not_found; WeightMap = boost::adj_list_edge_property_map, boost::edge_weight_t>; IndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>; Params = boost::bgl_named_params<_project2nd, boost::distance_combine_t, boost::bgl_named_params, boost::distance_compare_t, boost::bgl_named_params, boost::edge_weight_t>, boost::edge_weight_t, boost::bgl_named_params > > >; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/dijkstra_shortest_paths.hpp:570:31: required from ‘void boost::dijkstra_shortest_paths(const VertexListGraph&, typename graph_traits::vertex_descriptor, const bgl_named_params&) [with VertexListGraph = R_adjacency_list; Param = detail::_project2nd; Tag = distance_combine_t; Rest = bgl_named_params, distance_compare_t, bgl_named_params, edge_weight_t>, edge_weight_t, bgl_named_params > >; typename graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/prim_minimum_spanning_tree.hpp:43:32: required from ‘void boost::detail::prim_mst_impl(const Graph&, typename boost::graph_traits::vertex_descriptor, const boost::bgl_named_params&, Weight) [with Graph = R_adjacency_list; P = boost::adj_list_edge_property_map, boost::edge_weight_t>; T = boost::edge_weight_t; R = boost::bgl_named_params; Weight = boost::adj_list_edge_property_map, boost::edge_weight_t>; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/prim_minimum_spanning_tree.hpp:77:26: required from ‘void boost::prim_minimum_spanning_tree(const VertexListGraph&, PredecessorMap) [with VertexListGraph = R_adjacency_list; PredecessorMap = long unsigned int*]’ minST.cpp:89:35: required from here /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::Convertible]’ 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ^ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::ConvertibleConcept]’: /home/omnipath/local/R/4.4-3.20/BH/include/boost/property_map/property_map.hpp:180:7: required from ‘void boost::WritablePropertyMapConcept::constraints() [with PMap = boost::two_bit_color_map, long unsigned int> >; Key = long unsigned int]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::WritablePropertyMapConcept, long unsigned int> >, long unsigned int>]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied, long unsigned int> >, long unsigned int> >::value’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied, long unsigned int> >, long unsigned int> >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_, long unsigned int> >, long unsigned int>)>’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/property_map/property_map.hpp:207:7: [ skipping 11 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/dijkstra_shortest_paths.hpp:528:32: required from ‘void boost::detail::dijkstra_dispatch2(const VertexListGraph&, typename boost::graph_traits::vertex_descriptor, DistanceMap, WeightMap, IndexMap, const Params&) [with VertexListGraph = R_adjacency_list; DistanceMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator > >, boost::vec_adj_list_vertex_id_map, long unsigned int>, double, double&>; WeightMap = boost::adj_list_edge_property_map, boost::edge_weight_t>; IndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>; Params = boost::bgl_named_params<_project2nd, boost::distance_combine_t, boost::bgl_named_params, boost::distance_compare_t, boost::bgl_named_params, boost::edge_weight_t>, boost::edge_weight_t, boost::bgl_named_params > > >; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/dijkstra_shortest_paths.hpp:554:35: required from ‘void boost::detail::dijkstra_dispatch1(const VertexListGraph&, typename boost::graph_traits::vertex_descriptor, DistanceMap, WeightMap, IndexMap, const Params&) [with VertexListGraph = R_adjacency_list; DistanceMap = boost::param_not_found; WeightMap = boost::adj_list_edge_property_map, boost::edge_weight_t>; IndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>; Params = boost::bgl_named_params<_project2nd, boost::distance_combine_t, boost::bgl_named_params, boost::distance_compare_t, boost::bgl_named_params, boost::edge_weight_t>, boost::edge_weight_t, boost::bgl_named_params > > >; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/dijkstra_shortest_paths.hpp:570:31: required from ‘void boost::dijkstra_shortest_paths(const VertexListGraph&, typename graph_traits::vertex_descriptor, const bgl_named_params&) [with VertexListGraph = R_adjacency_list; Param = detail::_project2nd; Tag = distance_combine_t; Rest = bgl_named_params, distance_compare_t, bgl_named_params, edge_weight_t>, edge_weight_t, bgl_named_params > >; typename graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/prim_minimum_spanning_tree.hpp:43:32: required from ‘void boost::detail::prim_mst_impl(const Graph&, typename boost::graph_traits::vertex_descriptor, const boost::bgl_named_params&, Weight) [with Graph = R_adjacency_list; P = boost::adj_list_edge_property_map, boost::edge_weight_t>; T = boost::edge_weight_t; R = boost::bgl_named_params; Weight = boost::adj_list_edge_property_map, boost::edge_weight_t>; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/prim_minimum_spanning_tree.hpp:77:26: required from ‘void boost::prim_minimum_spanning_tree(const VertexListGraph&, PredecessorMap) [with VertexListGraph = R_adjacency_list; PredecessorMap = long unsigned int*]’ minST.cpp:89:35: required from here /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:206:17: note: in a call to non-static member function ‘boost::ConvertibleConcept::~ConvertibleConcept()’ 206 | BOOST_concept(Convertible,(X)(Y)) | ^~~~~~~~~~~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/preprocessor/cat.hpp:29:34: note: in definition of macro ‘BOOST_PP_CAT_I’ 29 | # define BOOST_PP_CAT_I(a, b) a ## b | ^ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/concept_def.hpp:23:12: note: in expansion of macro ‘BOOST_PP_CAT’ 23 | struct BOOST_PP_CAT(name,Concept) \ | ^~~~~~~~~~~~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:206:3: note: in expansion of macro ‘BOOST_concept’ 206 | BOOST_concept(Convertible,(X)(Y)) | ^~~~~~~~~~~~~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::Convertible]’: /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements >]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:208:5: required from ‘struct boost::Convertible’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:206:3: required from ‘struct boost::ConvertibleConcept’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::ConvertibleConcept]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied >::value’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:45:51: [ skipping 13 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/dijkstra_shortest_paths.hpp:528:32: required from ‘void boost::detail::dijkstra_dispatch2(const VertexListGraph&, typename boost::graph_traits::vertex_descriptor, DistanceMap, WeightMap, IndexMap, const Params&) [with VertexListGraph = R_adjacency_list; DistanceMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator > >, boost::vec_adj_list_vertex_id_map, long unsigned int>, double, double&>; WeightMap = boost::adj_list_edge_property_map, boost::edge_weight_t>; IndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>; Params = boost::bgl_named_params<_project2nd, boost::distance_combine_t, boost::bgl_named_params, boost::distance_compare_t, boost::bgl_named_params, boost::edge_weight_t>, boost::edge_weight_t, boost::bgl_named_params > > >; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/dijkstra_shortest_paths.hpp:554:35: required from ‘void boost::detail::dijkstra_dispatch1(const VertexListGraph&, typename boost::graph_traits::vertex_descriptor, DistanceMap, WeightMap, IndexMap, const Params&) [with VertexListGraph = R_adjacency_list; DistanceMap = boost::param_not_found; WeightMap = boost::adj_list_edge_property_map, boost::edge_weight_t>; IndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>; Params = boost::bgl_named_params<_project2nd, boost::distance_combine_t, boost::bgl_named_params, boost::distance_compare_t, boost::bgl_named_params, boost::edge_weight_t>, boost::edge_weight_t, boost::bgl_named_params > > >; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/dijkstra_shortest_paths.hpp:570:31: required from ‘void boost::dijkstra_shortest_paths(const VertexListGraph&, typename graph_traits::vertex_descriptor, const bgl_named_params&) [with VertexListGraph = R_adjacency_list; Param = detail::_project2nd; Tag = distance_combine_t; Rest = bgl_named_params, distance_compare_t, bgl_named_params, edge_weight_t>, edge_weight_t, bgl_named_params > >; typename graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/prim_minimum_spanning_tree.hpp:43:32: required from ‘void boost::detail::prim_mst_impl(const Graph&, typename boost::graph_traits::vertex_descriptor, const boost::bgl_named_params&, Weight) [with Graph = R_adjacency_list; P = boost::adj_list_edge_property_map, boost::edge_weight_t>; T = boost::edge_weight_t; R = boost::bgl_named_params; Weight = boost::adj_list_edge_property_map, boost::edge_weight_t>; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/prim_minimum_spanning_tree.hpp:77:26: required from ‘void boost::prim_minimum_spanning_tree(const VertexListGraph&, PredecessorMap) [with VertexListGraph = R_adjacency_list; PredecessorMap = long unsigned int*]’ minST.cpp:89:35: required from here /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::Convertible::~Convertible() [with X = boost::read_write_property_map_tag; Y = boost::read_write_property_map_tag]’ 37 | ~model() | ^ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:208:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 208 | BOOST_CONCEPT_USAGE(Convertible) { | ^~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::Assignable]’: /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements >]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:145:5: required from ‘struct boost::Assignable’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:502:3: required from ‘struct boost::InputIterator’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:540:3: required from ‘struct boost::ForwardIterator’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:568:3: required from ‘struct boost::BidirectionalIterator’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:597:3: [ skipping 14 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/dijkstra_shortest_paths.hpp:528:32: required from ‘void boost::detail::dijkstra_dispatch2(const VertexListGraph&, typename boost::graph_traits::vertex_descriptor, DistanceMap, WeightMap, IndexMap, const Params&) [with VertexListGraph = R_adjacency_list; DistanceMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator > >, boost::vec_adj_list_vertex_id_map, long unsigned int>, double, double&>; WeightMap = boost::adj_list_edge_property_map, boost::edge_weight_t>; IndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>; Params = boost::bgl_named_params<_project2nd, boost::distance_combine_t, boost::bgl_named_params, boost::distance_compare_t, boost::bgl_named_params, boost::edge_weight_t>, boost::edge_weight_t, boost::bgl_named_params > > >; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/dijkstra_shortest_paths.hpp:554:35: required from ‘void boost::detail::dijkstra_dispatch1(const VertexListGraph&, typename boost::graph_traits::vertex_descriptor, DistanceMap, WeightMap, IndexMap, const Params&) [with VertexListGraph = R_adjacency_list; DistanceMap = boost::param_not_found; WeightMap = boost::adj_list_edge_property_map, boost::edge_weight_t>; IndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>; Params = boost::bgl_named_params<_project2nd, boost::distance_combine_t, boost::bgl_named_params, boost::distance_compare_t, boost::bgl_named_params, boost::edge_weight_t>, boost::edge_weight_t, boost::bgl_named_params > > >; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/dijkstra_shortest_paths.hpp:570:31: required from ‘void boost::dijkstra_shortest_paths(const VertexListGraph&, typename graph_traits::vertex_descriptor, const bgl_named_params&) [with VertexListGraph = R_adjacency_list; Param = detail::_project2nd; Tag = distance_combine_t; Rest = bgl_named_params, distance_compare_t, bgl_named_params, edge_weight_t>, edge_weight_t, bgl_named_params > >; typename graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/prim_minimum_spanning_tree.hpp:43:32: required from ‘void boost::detail::prim_mst_impl(const Graph&, typename boost::graph_traits::vertex_descriptor, const boost::bgl_named_params&, Weight) [with Graph = R_adjacency_list; P = boost::adj_list_edge_property_map, boost::edge_weight_t>; T = boost::edge_weight_t; R = boost::bgl_named_params; Weight = boost::adj_list_edge_property_map, boost::edge_weight_t>; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/prim_minimum_spanning_tree.hpp:77:26: required from ‘void boost::prim_minimum_spanning_tree(const VertexListGraph&, PredecessorMap) [with VertexListGraph = R_adjacency_list; PredecessorMap = long unsigned int*]’ minST.cpp:89:35: required from here /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::Assignable::~Assignable() [with TT = long unsigned int*]’ 37 | ~model() | ^ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:145:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 145 | BOOST_CONCEPT_USAGE(Assignable) { | ^~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::EqualityComparable]’: /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements >]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:233:5: required from ‘struct boost::EqualityComparable’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:502:3: required from ‘struct boost::InputIterator’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:540:3: required from ‘struct boost::ForwardIterator’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:568:3: required from ‘struct boost::BidirectionalIterator’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:597:3: [ skipping 14 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/dijkstra_shortest_paths.hpp:528:32: required from ‘void boost::detail::dijkstra_dispatch2(const VertexListGraph&, typename boost::graph_traits::vertex_descriptor, DistanceMap, WeightMap, IndexMap, const Params&) [with VertexListGraph = R_adjacency_list; DistanceMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator > >, boost::vec_adj_list_vertex_id_map, long unsigned int>, double, double&>; WeightMap = boost::adj_list_edge_property_map, boost::edge_weight_t>; IndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>; Params = boost::bgl_named_params<_project2nd, boost::distance_combine_t, boost::bgl_named_params, boost::distance_compare_t, boost::bgl_named_params, boost::edge_weight_t>, boost::edge_weight_t, boost::bgl_named_params > > >; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/dijkstra_shortest_paths.hpp:554:35: required from ‘void boost::detail::dijkstra_dispatch1(const VertexListGraph&, typename boost::graph_traits::vertex_descriptor, DistanceMap, WeightMap, IndexMap, const Params&) [with VertexListGraph = R_adjacency_list; DistanceMap = boost::param_not_found; WeightMap = boost::adj_list_edge_property_map, boost::edge_weight_t>; IndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>; Params = boost::bgl_named_params<_project2nd, boost::distance_combine_t, boost::bgl_named_params, boost::distance_compare_t, boost::bgl_named_params, boost::edge_weight_t>, boost::edge_weight_t, boost::bgl_named_params > > >; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/dijkstra_shortest_paths.hpp:570:31: required from ‘void boost::dijkstra_shortest_paths(const VertexListGraph&, typename graph_traits::vertex_descriptor, const bgl_named_params&) [with VertexListGraph = R_adjacency_list; Param = detail::_project2nd; Tag = distance_combine_t; Rest = bgl_named_params, distance_compare_t, bgl_named_params, edge_weight_t>, edge_weight_t, bgl_named_params > >; typename graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/prim_minimum_spanning_tree.hpp:43:32: required from ‘void boost::detail::prim_mst_impl(const Graph&, typename boost::graph_traits::vertex_descriptor, const boost::bgl_named_params&, Weight) [with Graph = R_adjacency_list; P = boost::adj_list_edge_property_map, boost::edge_weight_t>; T = boost::edge_weight_t; R = boost::bgl_named_params; Weight = boost::adj_list_edge_property_map, boost::edge_weight_t>; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/prim_minimum_spanning_tree.hpp:77:26: required from ‘void boost::prim_minimum_spanning_tree(const VertexListGraph&, PredecessorMap) [with VertexListGraph = R_adjacency_list; PredecessorMap = long unsigned int*]’ minST.cpp:89:35: required from here /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::EqualityComparable::~EqualityComparable() [with TT = long unsigned int*]’ 37 | ~model() | ^ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:233:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 233 | BOOST_CONCEPT_USAGE(EqualityComparable) { | ^~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::InputIterator]’: /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements >]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:512:7: required from ‘struct boost::InputIterator’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:540:3: required from ‘struct boost::ForwardIterator’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:568:3: required from ‘struct boost::BidirectionalIterator’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:597:3: required from ‘struct boost::RandomAccessIterator’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:597:3: [ skipping 13 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/dijkstra_shortest_paths.hpp:528:32: required from ‘void boost::detail::dijkstra_dispatch2(const VertexListGraph&, typename boost::graph_traits::vertex_descriptor, DistanceMap, WeightMap, IndexMap, const Params&) [with VertexListGraph = R_adjacency_list; DistanceMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator > >, boost::vec_adj_list_vertex_id_map, long unsigned int>, double, double&>; WeightMap = boost::adj_list_edge_property_map, boost::edge_weight_t>; IndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>; Params = boost::bgl_named_params<_project2nd, boost::distance_combine_t, boost::bgl_named_params, boost::distance_compare_t, boost::bgl_named_params, boost::edge_weight_t>, boost::edge_weight_t, boost::bgl_named_params > > >; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/dijkstra_shortest_paths.hpp:554:35: required from ‘void boost::detail::dijkstra_dispatch1(const VertexListGraph&, typename boost::graph_traits::vertex_descriptor, DistanceMap, WeightMap, IndexMap, const Params&) [with VertexListGraph = R_adjacency_list; DistanceMap = boost::param_not_found; WeightMap = boost::adj_list_edge_property_map, boost::edge_weight_t>; IndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>; Params = boost::bgl_named_params<_project2nd, boost::distance_combine_t, boost::bgl_named_params, boost::distance_compare_t, boost::bgl_named_params, boost::edge_weight_t>, boost::edge_weight_t, boost::bgl_named_params > > >; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/dijkstra_shortest_paths.hpp:570:31: required from ‘void boost::dijkstra_shortest_paths(const VertexListGraph&, typename graph_traits::vertex_descriptor, const bgl_named_params&) [with VertexListGraph = R_adjacency_list; Param = detail::_project2nd; Tag = distance_combine_t; Rest = bgl_named_params, distance_compare_t, bgl_named_params, edge_weight_t>, edge_weight_t, bgl_named_params > >; typename graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/prim_minimum_spanning_tree.hpp:43:32: required from ‘void boost::detail::prim_mst_impl(const Graph&, typename boost::graph_traits::vertex_descriptor, const boost::bgl_named_params&, Weight) [with Graph = R_adjacency_list; P = boost::adj_list_edge_property_map, boost::edge_weight_t>; T = boost::edge_weight_t; R = boost::bgl_named_params; Weight = boost::adj_list_edge_property_map, boost::edge_weight_t>; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/prim_minimum_spanning_tree.hpp:77:26: required from ‘void boost::prim_minimum_spanning_tree(const VertexListGraph&, PredecessorMap) [with VertexListGraph = R_adjacency_list; PredecessorMap = long unsigned int*]’ minST.cpp:89:35: required from here /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::InputIterator::~InputIterator() [with TT = long unsigned int*]’ 37 | ~model() | ^ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:512:7: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 512 | BOOST_CONCEPT_USAGE(InputIterator) | ^~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::ForwardIterator]’: /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements >]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:543:7: required from ‘struct boost::ForwardIterator’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:568:3: required from ‘struct boost::BidirectionalIterator’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:597:3: required from ‘struct boost::RandomAccessIterator’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:597:3: required from ‘struct boost::RandomAccessIteratorConcept’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:32:62: [ skipping 12 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/dijkstra_shortest_paths.hpp:528:32: required from ‘void boost::detail::dijkstra_dispatch2(const VertexListGraph&, typename boost::graph_traits::vertex_descriptor, DistanceMap, WeightMap, IndexMap, const Params&) [with VertexListGraph = R_adjacency_list; DistanceMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator > >, boost::vec_adj_list_vertex_id_map, long unsigned int>, double, double&>; WeightMap = boost::adj_list_edge_property_map, boost::edge_weight_t>; IndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>; Params = boost::bgl_named_params<_project2nd, boost::distance_combine_t, boost::bgl_named_params, boost::distance_compare_t, boost::bgl_named_params, boost::edge_weight_t>, boost::edge_weight_t, boost::bgl_named_params > > >; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/dijkstra_shortest_paths.hpp:554:35: required from ‘void boost::detail::dijkstra_dispatch1(const VertexListGraph&, typename boost::graph_traits::vertex_descriptor, DistanceMap, WeightMap, IndexMap, const Params&) [with VertexListGraph = R_adjacency_list; DistanceMap = boost::param_not_found; WeightMap = boost::adj_list_edge_property_map, boost::edge_weight_t>; IndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>; Params = boost::bgl_named_params<_project2nd, boost::distance_combine_t, boost::bgl_named_params, boost::distance_compare_t, boost::bgl_named_params, boost::edge_weight_t>, boost::edge_weight_t, boost::bgl_named_params > > >; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/dijkstra_shortest_paths.hpp:570:31: required from ‘void boost::dijkstra_shortest_paths(const VertexListGraph&, typename graph_traits::vertex_descriptor, const bgl_named_params&) [with VertexListGraph = R_adjacency_list; Param = detail::_project2nd; Tag = distance_combine_t; Rest = bgl_named_params, distance_compare_t, bgl_named_params, edge_weight_t>, edge_weight_t, bgl_named_params > >; typename graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/prim_minimum_spanning_tree.hpp:43:32: required from ‘void boost::detail::prim_mst_impl(const Graph&, typename boost::graph_traits::vertex_descriptor, const boost::bgl_named_params&, Weight) [with Graph = R_adjacency_list; P = boost::adj_list_edge_property_map, boost::edge_weight_t>; T = boost::edge_weight_t; R = boost::bgl_named_params; Weight = boost::adj_list_edge_property_map, boost::edge_weight_t>; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/prim_minimum_spanning_tree.hpp:77:26: required from ‘void boost::prim_minimum_spanning_tree(const VertexListGraph&, PredecessorMap) [with VertexListGraph = R_adjacency_list; PredecessorMap = long unsigned int*]’ minST.cpp:89:35: required from here /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::ForwardIterator::~ForwardIterator() [with TT = long unsigned int*]’ 37 | ~model() | ^ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:543:7: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 543 | BOOST_CONCEPT_USAGE(ForwardIterator) | ^~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::BidirectionalIterator]’: /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements >]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:571:7: required from ‘struct boost::BidirectionalIterator’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:597:3: required from ‘struct boost::RandomAccessIterator’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:597:3: required from ‘struct boost::RandomAccessIteratorConcept’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::RandomAccessIteratorConcept]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:42:5: [ skipping 11 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/dijkstra_shortest_paths.hpp:528:32: required from ‘void boost::detail::dijkstra_dispatch2(const VertexListGraph&, typename boost::graph_traits::vertex_descriptor, DistanceMap, WeightMap, IndexMap, const Params&) [with VertexListGraph = R_adjacency_list; DistanceMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator > >, boost::vec_adj_list_vertex_id_map, long unsigned int>, double, double&>; WeightMap = boost::adj_list_edge_property_map, boost::edge_weight_t>; IndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>; Params = boost::bgl_named_params<_project2nd, boost::distance_combine_t, boost::bgl_named_params, boost::distance_compare_t, boost::bgl_named_params, boost::edge_weight_t>, boost::edge_weight_t, boost::bgl_named_params > > >; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/dijkstra_shortest_paths.hpp:554:35: required from ‘void boost::detail::dijkstra_dispatch1(const VertexListGraph&, typename boost::graph_traits::vertex_descriptor, DistanceMap, WeightMap, IndexMap, const Params&) [with VertexListGraph = R_adjacency_list; DistanceMap = boost::param_not_found; WeightMap = boost::adj_list_edge_property_map, boost::edge_weight_t>; IndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>; Params = boost::bgl_named_params<_project2nd, boost::distance_combine_t, boost::bgl_named_params, boost::distance_compare_t, boost::bgl_named_params, boost::edge_weight_t>, boost::edge_weight_t, boost::bgl_named_params > > >; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/dijkstra_shortest_paths.hpp:570:31: required from ‘void boost::dijkstra_shortest_paths(const VertexListGraph&, typename graph_traits::vertex_descriptor, const bgl_named_params&) [with VertexListGraph = R_adjacency_list; Param = detail::_project2nd; Tag = distance_combine_t; Rest = bgl_named_params, distance_compare_t, bgl_named_params, edge_weight_t>, edge_weight_t, bgl_named_params > >; typename graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/prim_minimum_spanning_tree.hpp:43:32: required from ‘void boost::detail::prim_mst_impl(const Graph&, typename boost::graph_traits::vertex_descriptor, const boost::bgl_named_params&, Weight) [with Graph = R_adjacency_list; P = boost::adj_list_edge_property_map, boost::edge_weight_t>; T = boost::edge_weight_t; R = boost::bgl_named_params; Weight = boost::adj_list_edge_property_map, boost::edge_weight_t>; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/prim_minimum_spanning_tree.hpp:77:26: required from ‘void boost::prim_minimum_spanning_tree(const VertexListGraph&, PredecessorMap) [with VertexListGraph = R_adjacency_list; PredecessorMap = long unsigned int*]’ minST.cpp:89:35: required from here /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::BidirectionalIterator::~BidirectionalIterator() [with TT = long unsigned int*]’ 37 | ~model() | ^ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:571:7: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 571 | BOOST_CONCEPT_USAGE(BidirectionalIterator) | ^~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::Comparable]’: /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements >]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:253:5: required from ‘struct boost::Comparable’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:597:3: required from ‘struct boost::RandomAccessIterator’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:597:3: required from ‘struct boost::RandomAccessIteratorConcept’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::RandomAccessIteratorConcept]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:42:5: [ skipping 11 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/dijkstra_shortest_paths.hpp:528:32: required from ‘void boost::detail::dijkstra_dispatch2(const VertexListGraph&, typename boost::graph_traits::vertex_descriptor, DistanceMap, WeightMap, IndexMap, const Params&) [with VertexListGraph = R_adjacency_list; DistanceMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator > >, boost::vec_adj_list_vertex_id_map, long unsigned int>, double, double&>; WeightMap = boost::adj_list_edge_property_map, boost::edge_weight_t>; IndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>; Params = boost::bgl_named_params<_project2nd, boost::distance_combine_t, boost::bgl_named_params, boost::distance_compare_t, boost::bgl_named_params, boost::edge_weight_t>, boost::edge_weight_t, boost::bgl_named_params > > >; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/dijkstra_shortest_paths.hpp:554:35: required from ‘void boost::detail::dijkstra_dispatch1(const VertexListGraph&, typename boost::graph_traits::vertex_descriptor, DistanceMap, WeightMap, IndexMap, const Params&) [with VertexListGraph = R_adjacency_list; DistanceMap = boost::param_not_found; WeightMap = boost::adj_list_edge_property_map, boost::edge_weight_t>; IndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>; Params = boost::bgl_named_params<_project2nd, boost::distance_combine_t, boost::bgl_named_params, boost::distance_compare_t, boost::bgl_named_params, boost::edge_weight_t>, boost::edge_weight_t, boost::bgl_named_params > > >; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/dijkstra_shortest_paths.hpp:570:31: required from ‘void boost::dijkstra_shortest_paths(const VertexListGraph&, typename graph_traits::vertex_descriptor, const bgl_named_params&) [with VertexListGraph = R_adjacency_list; Param = detail::_project2nd; Tag = distance_combine_t; Rest = bgl_named_params, distance_compare_t, bgl_named_params, edge_weight_t>, edge_weight_t, bgl_named_params > >; typename graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/prim_minimum_spanning_tree.hpp:43:32: required from ‘void boost::detail::prim_mst_impl(const Graph&, typename boost::graph_traits::vertex_descriptor, const boost::bgl_named_params&, Weight) [with Graph = R_adjacency_list; P = boost::adj_list_edge_property_map, boost::edge_weight_t>; T = boost::edge_weight_t; R = boost::bgl_named_params; Weight = boost::adj_list_edge_property_map, boost::edge_weight_t>; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/prim_minimum_spanning_tree.hpp:77:26: required from ‘void boost::prim_minimum_spanning_tree(const VertexListGraph&, PredecessorMap) [with VertexListGraph = R_adjacency_list; PredecessorMap = long unsigned int*]’ minST.cpp:89:35: required from here /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::Comparable::~Comparable() [with TT = long unsigned int*]’ 37 | ~model() | ^ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:253:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 253 | BOOST_CONCEPT_USAGE(Comparable) { | ^~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::RandomAccessIterator]’: /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements >]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:601:7: required from ‘struct boost::RandomAccessIterator’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:597:3: required from ‘struct boost::RandomAccessIteratorConcept’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::RandomAccessIteratorConcept]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied >::value’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:45:51: [ skipping 10 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/dijkstra_shortest_paths.hpp:528:32: required from ‘void boost::detail::dijkstra_dispatch2(const VertexListGraph&, typename boost::graph_traits::vertex_descriptor, DistanceMap, WeightMap, IndexMap, const Params&) [with VertexListGraph = R_adjacency_list; DistanceMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator > >, boost::vec_adj_list_vertex_id_map, long unsigned int>, double, double&>; WeightMap = boost::adj_list_edge_property_map, boost::edge_weight_t>; IndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>; Params = boost::bgl_named_params<_project2nd, boost::distance_combine_t, boost::bgl_named_params, boost::distance_compare_t, boost::bgl_named_params, boost::edge_weight_t>, boost::edge_weight_t, boost::bgl_named_params > > >; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/dijkstra_shortest_paths.hpp:554:35: required from ‘void boost::detail::dijkstra_dispatch1(const VertexListGraph&, typename boost::graph_traits::vertex_descriptor, DistanceMap, WeightMap, IndexMap, const Params&) [with VertexListGraph = R_adjacency_list; DistanceMap = boost::param_not_found; WeightMap = boost::adj_list_edge_property_map, boost::edge_weight_t>; IndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>; Params = boost::bgl_named_params<_project2nd, boost::distance_combine_t, boost::bgl_named_params, boost::distance_compare_t, boost::bgl_named_params, boost::edge_weight_t>, boost::edge_weight_t, boost::bgl_named_params > > >; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/dijkstra_shortest_paths.hpp:570:31: required from ‘void boost::dijkstra_shortest_paths(const VertexListGraph&, typename graph_traits::vertex_descriptor, const bgl_named_params&) [with VertexListGraph = R_adjacency_list; Param = detail::_project2nd; Tag = distance_combine_t; Rest = bgl_named_params, distance_compare_t, bgl_named_params, edge_weight_t>, edge_weight_t, bgl_named_params > >; typename graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/prim_minimum_spanning_tree.hpp:43:32: required from ‘void boost::detail::prim_mst_impl(const Graph&, typename boost::graph_traits::vertex_descriptor, const boost::bgl_named_params&, Weight) [with Graph = R_adjacency_list; P = boost::adj_list_edge_property_map, boost::edge_weight_t>; T = boost::edge_weight_t; R = boost::bgl_named_params; Weight = boost::adj_list_edge_property_map, boost::edge_weight_t>; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/prim_minimum_spanning_tree.hpp:77:26: required from ‘void boost::prim_minimum_spanning_tree(const VertexListGraph&, PredecessorMap) [with VertexListGraph = R_adjacency_list; PredecessorMap = long unsigned int*]’ minST.cpp:89:35: required from here /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::RandomAccessIterator::~RandomAccessIterator() [with TT = long unsigned int*]’ 37 | ~model() | ^ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:601:7: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 601 | BOOST_CONCEPT_USAGE(RandomAccessIterator) | ^~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::concepts::MultiPassInputIterator > >, boost::property >*, std::vector > >, boost::property >, std::allocator > >, boost::property > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> >]’: /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements > >, boost::property >*, std::vector > >, boost::property >, std::allocator > >, boost::property > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/graph_concepts.hpp:52:50: required from ‘struct boost::concepts::MultiPassInputIterator > >, boost::property >*, std::vector > >, boost::property >, std::allocator > >, boost::property > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::concepts::MultiPassInputIterator > >, boost::property >*, std::vector > >, boost::property >, std::allocator > >, boost::property > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> >]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied > >, boost::property >*, std::vector > >, boost::property >, std::allocator > >, boost::property > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::value’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied > >, boost::property >*, std::vector > >, boost::property >, std::allocator > >, boost::property > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:72:8: [ skipping 9 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/dijkstra_shortest_paths.hpp:528:32: required from ‘void boost::detail::dijkstra_dispatch2(const VertexListGraph&, typename boost::graph_traits::vertex_descriptor, DistanceMap, WeightMap, IndexMap, const Params&) [with VertexListGraph = R_adjacency_list; DistanceMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator > >, boost::vec_adj_list_vertex_id_map, long unsigned int>, double, double&>; WeightMap = boost::adj_list_edge_property_map, boost::edge_weight_t>; IndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>; Params = boost::bgl_named_params<_project2nd, boost::distance_combine_t, boost::bgl_named_params, boost::distance_compare_t, boost::bgl_named_params, boost::edge_weight_t>, boost::edge_weight_t, boost::bgl_named_params > > >; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/dijkstra_shortest_paths.hpp:554:35: required from ‘void boost::detail::dijkstra_dispatch1(const VertexListGraph&, typename boost::graph_traits::vertex_descriptor, DistanceMap, WeightMap, IndexMap, const Params&) [with VertexListGraph = R_adjacency_list; DistanceMap = boost::param_not_found; WeightMap = boost::adj_list_edge_property_map, boost::edge_weight_t>; IndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>; Params = boost::bgl_named_params<_project2nd, boost::distance_combine_t, boost::bgl_named_params, boost::distance_compare_t, boost::bgl_named_params, boost::edge_weight_t>, boost::edge_weight_t, boost::bgl_named_params > > >; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/dijkstra_shortest_paths.hpp:570:31: required from ‘void boost::dijkstra_shortest_paths(const VertexListGraph&, typename graph_traits::vertex_descriptor, const bgl_named_params&) [with VertexListGraph = R_adjacency_list; Param = detail::_project2nd; Tag = distance_combine_t; Rest = bgl_named_params, distance_compare_t, bgl_named_params, edge_weight_t>, edge_weight_t, bgl_named_params > >; typename graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/prim_minimum_spanning_tree.hpp:43:32: required from ‘void boost::detail::prim_mst_impl(const Graph&, typename boost::graph_traits::vertex_descriptor, const boost::bgl_named_params&, Weight) [with Graph = R_adjacency_list; P = boost::adj_list_edge_property_map, boost::edge_weight_t>; T = boost::edge_weight_t; R = boost::bgl_named_params; Weight = boost::adj_list_edge_property_map, boost::edge_weight_t>; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/prim_minimum_spanning_tree.hpp:77:26: required from ‘void boost::prim_minimum_spanning_tree(const VertexListGraph&, PredecessorMap) [with VertexListGraph = R_adjacency_list; PredecessorMap = long unsigned int*]’ minST.cpp:89:35: required from here /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::concepts::MultiPassInputIterator::~MultiPassInputIterator() [with T = boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >, boost::property >*, std::vector > >, boost::property >, std::allocator > >, boost::property > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>]’ 37 | ~model() | ^ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/graph_concepts.hpp:52:50: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 52 | BOOST_concept(MultiPassInputIterator, (T)) { BOOST_CONCEPT_USAGE( | ^~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::Convertible]’: /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements >]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:208:5: required from ‘struct boost::Convertible’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::Convertible]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied >::value’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:72:8: [ skipping 9 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/dijkstra_shortest_paths.hpp:528:32: required from ‘void boost::detail::dijkstra_dispatch2(const VertexListGraph&, typename boost::graph_traits::vertex_descriptor, DistanceMap, WeightMap, IndexMap, const Params&) [with VertexListGraph = R_adjacency_list; DistanceMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator > >, boost::vec_adj_list_vertex_id_map, long unsigned int>, double, double&>; WeightMap = boost::adj_list_edge_property_map, boost::edge_weight_t>; IndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>; Params = boost::bgl_named_params<_project2nd, boost::distance_combine_t, boost::bgl_named_params, boost::distance_compare_t, boost::bgl_named_params, boost::edge_weight_t>, boost::edge_weight_t, boost::bgl_named_params > > >; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/dijkstra_shortest_paths.hpp:554:35: required from ‘void boost::detail::dijkstra_dispatch1(const VertexListGraph&, typename boost::graph_traits::vertex_descriptor, DistanceMap, WeightMap, IndexMap, const Params&) [with VertexListGraph = R_adjacency_list; DistanceMap = boost::param_not_found; WeightMap = boost::adj_list_edge_property_map, boost::edge_weight_t>; IndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>; Params = boost::bgl_named_params<_project2nd, boost::distance_combine_t, boost::bgl_named_params, boost::distance_compare_t, boost::bgl_named_params, boost::edge_weight_t>, boost::edge_weight_t, boost::bgl_named_params > > >; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/dijkstra_shortest_paths.hpp:570:31: required from ‘void boost::dijkstra_shortest_paths(const VertexListGraph&, typename graph_traits::vertex_descriptor, const bgl_named_params&) [with VertexListGraph = R_adjacency_list; Param = detail::_project2nd; Tag = distance_combine_t; Rest = bgl_named_params, distance_compare_t, bgl_named_params, edge_weight_t>, edge_weight_t, bgl_named_params > >; typename graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/prim_minimum_spanning_tree.hpp:43:32: required from ‘void boost::detail::prim_mst_impl(const Graph&, typename boost::graph_traits::vertex_descriptor, const boost::bgl_named_params&, Weight) [with Graph = R_adjacency_list; P = boost::adj_list_edge_property_map, boost::edge_weight_t>; T = boost::edge_weight_t; R = boost::bgl_named_params; Weight = boost::adj_list_edge_property_map, boost::edge_weight_t>; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/prim_minimum_spanning_tree.hpp:77:26: required from ‘void boost::prim_minimum_spanning_tree(const VertexListGraph&, PredecessorMap) [with VertexListGraph = R_adjacency_list; PredecessorMap = long unsigned int*]’ minST.cpp:89:35: required from here /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::Convertible::~Convertible() [with X = boost::undir_adj_list_traversal_tag; Y = boost::incidence_graph_tag]’ 37 | ~model() | ^ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:208:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 208 | BOOST_CONCEPT_USAGE(Convertible) { | ^~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::Convertible]’: /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements >]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:208:5: required from ‘struct boost::Convertible’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:206:3: required from ‘struct boost::ConvertibleConcept’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::ConvertibleConcept]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied >::value’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:45:51: [ skipping 18 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/dijkstra_shortest_paths.hpp:528:32: required from ‘void boost::detail::dijkstra_dispatch2(const VertexListGraph&, typename boost::graph_traits::vertex_descriptor, DistanceMap, WeightMap, IndexMap, const Params&) [with VertexListGraph = R_adjacency_list; DistanceMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator > >, boost::vec_adj_list_vertex_id_map, long unsigned int>, double, double&>; WeightMap = boost::adj_list_edge_property_map, boost::edge_weight_t>; IndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>; Params = boost::bgl_named_params<_project2nd, boost::distance_combine_t, boost::bgl_named_params, boost::distance_compare_t, boost::bgl_named_params, boost::edge_weight_t>, boost::edge_weight_t, boost::bgl_named_params > > >; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/dijkstra_shortest_paths.hpp:554:35: required from ‘void boost::detail::dijkstra_dispatch1(const VertexListGraph&, typename boost::graph_traits::vertex_descriptor, DistanceMap, WeightMap, IndexMap, const Params&) [with VertexListGraph = R_adjacency_list; DistanceMap = boost::param_not_found; WeightMap = boost::adj_list_edge_property_map, boost::edge_weight_t>; IndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>; Params = boost::bgl_named_params<_project2nd, boost::distance_combine_t, boost::bgl_named_params, boost::distance_compare_t, boost::bgl_named_params, boost::edge_weight_t>, boost::edge_weight_t, boost::bgl_named_params > > >; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/dijkstra_shortest_paths.hpp:570:31: required from ‘void boost::dijkstra_shortest_paths(const VertexListGraph&, typename graph_traits::vertex_descriptor, const bgl_named_params&) [with VertexListGraph = R_adjacency_list; Param = detail::_project2nd; Tag = distance_combine_t; Rest = bgl_named_params, distance_compare_t, bgl_named_params, edge_weight_t>, edge_weight_t, bgl_named_params > >; typename graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/prim_minimum_spanning_tree.hpp:43:32: required from ‘void boost::detail::prim_mst_impl(const Graph&, typename boost::graph_traits::vertex_descriptor, const boost::bgl_named_params&, Weight) [with Graph = R_adjacency_list; P = boost::adj_list_edge_property_map, boost::edge_weight_t>; T = boost::edge_weight_t; R = boost::bgl_named_params; Weight = boost::adj_list_edge_property_map, boost::edge_weight_t>; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/prim_minimum_spanning_tree.hpp:77:26: required from ‘void boost::prim_minimum_spanning_tree(const VertexListGraph&, PredecessorMap) [with VertexListGraph = R_adjacency_list; PredecessorMap = long unsigned int*]’ minST.cpp:89:35: required from here /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::Convertible::~Convertible() [with X = boost::read_write_property_map_tag; Y = boost::readable_property_map_tag]’ 37 | ~model() | ^ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:208:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 208 | BOOST_CONCEPT_USAGE(Convertible) { | ^~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::Convertible]’: /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements >]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:208:5: required from ‘struct boost::Convertible’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:206:3: required from ‘struct boost::ConvertibleConcept’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::ConvertibleConcept]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied >::value’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:45:51: [ skipping 18 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/dijkstra_shortest_paths.hpp:528:32: required from ‘void boost::detail::dijkstra_dispatch2(const VertexListGraph&, typename boost::graph_traits::vertex_descriptor, DistanceMap, WeightMap, IndexMap, const Params&) [with VertexListGraph = R_adjacency_list; DistanceMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator > >, boost::vec_adj_list_vertex_id_map, long unsigned int>, double, double&>; WeightMap = boost::adj_list_edge_property_map, boost::edge_weight_t>; IndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>; Params = boost::bgl_named_params<_project2nd, boost::distance_combine_t, boost::bgl_named_params, boost::distance_compare_t, boost::bgl_named_params, boost::edge_weight_t>, boost::edge_weight_t, boost::bgl_named_params > > >; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/dijkstra_shortest_paths.hpp:554:35: required from ‘void boost::detail::dijkstra_dispatch1(const VertexListGraph&, typename boost::graph_traits::vertex_descriptor, DistanceMap, WeightMap, IndexMap, const Params&) [with VertexListGraph = R_adjacency_list; DistanceMap = boost::param_not_found; WeightMap = boost::adj_list_edge_property_map, boost::edge_weight_t>; IndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>; Params = boost::bgl_named_params<_project2nd, boost::distance_combine_t, boost::bgl_named_params, boost::distance_compare_t, boost::bgl_named_params, boost::edge_weight_t>, boost::edge_weight_t, boost::bgl_named_params > > >; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/dijkstra_shortest_paths.hpp:570:31: required from ‘void boost::dijkstra_shortest_paths(const VertexListGraph&, typename graph_traits::vertex_descriptor, const bgl_named_params&) [with VertexListGraph = R_adjacency_list; Param = detail::_project2nd; Tag = distance_combine_t; Rest = bgl_named_params, distance_compare_t, bgl_named_params, edge_weight_t>, edge_weight_t, bgl_named_params > >; typename graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/prim_minimum_spanning_tree.hpp:43:32: required from ‘void boost::detail::prim_mst_impl(const Graph&, typename boost::graph_traits::vertex_descriptor, const boost::bgl_named_params&, Weight) [with Graph = R_adjacency_list; P = boost::adj_list_edge_property_map, boost::edge_weight_t>; T = boost::edge_weight_t; R = boost::bgl_named_params; Weight = boost::adj_list_edge_property_map, boost::edge_weight_t>; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/prim_minimum_spanning_tree.hpp:77:26: required from ‘void boost::prim_minimum_spanning_tree(const VertexListGraph&, PredecessorMap) [with VertexListGraph = R_adjacency_list; PredecessorMap = long unsigned int*]’ minST.cpp:89:35: required from here /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::Convertible::~Convertible() [with X = boost::read_write_property_map_tag; Y = boost::writable_property_map_tag]’ 37 | ~model() | ^ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:208:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 208 | BOOST_CONCEPT_USAGE(Convertible) { | ^~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements > >, boost::property >*, std::vector > >, boost::property >, std::allocator > >, boost::property > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >]’: /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:145:5: required from ‘struct boost::Assignable > >, boost::property >*, std::vector > >, boost::property >, std::allocator > >, boost::property > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:502:3: required from ‘struct boost::InputIterator > >, boost::property >*, std::vector > >, boost::property >, std::allocator > >, boost::property > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::InputIterator > >, boost::property >*, std::vector > >, boost::property >, std::allocator > >, boost::property > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> >]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied > >, boost::property >*, std::vector > >, boost::property >, std::allocator > >, boost::property > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::value’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied > >, boost::property >*, std::vector > >, boost::property >, std::allocator > >, boost::property > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:72:8: [ skipping 11 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/dijkstra_shortest_paths.hpp:528:32: required from ‘void boost::detail::dijkstra_dispatch2(const VertexListGraph&, typename boost::graph_traits::vertex_descriptor, DistanceMap, WeightMap, IndexMap, const Params&) [with VertexListGraph = R_adjacency_list; DistanceMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator > >, boost::vec_adj_list_vertex_id_map, long unsigned int>, double, double&>; WeightMap = boost::adj_list_edge_property_map, boost::edge_weight_t>; IndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>; Params = boost::bgl_named_params<_project2nd, boost::distance_combine_t, boost::bgl_named_params, boost::distance_compare_t, boost::bgl_named_params, boost::edge_weight_t>, boost::edge_weight_t, boost::bgl_named_params > > >; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/dijkstra_shortest_paths.hpp:554:35: required from ‘void boost::detail::dijkstra_dispatch1(const VertexListGraph&, typename boost::graph_traits::vertex_descriptor, DistanceMap, WeightMap, IndexMap, const Params&) [with VertexListGraph = R_adjacency_list; DistanceMap = boost::param_not_found; WeightMap = boost::adj_list_edge_property_map, boost::edge_weight_t>; IndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>; Params = boost::bgl_named_params<_project2nd, boost::distance_combine_t, boost::bgl_named_params, boost::distance_compare_t, boost::bgl_named_params, boost::edge_weight_t>, boost::edge_weight_t, boost::bgl_named_params > > >; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/dijkstra_shortest_paths.hpp:570:31: required from ‘void boost::dijkstra_shortest_paths(const VertexListGraph&, typename graph_traits::vertex_descriptor, const bgl_named_params&) [with VertexListGraph = R_adjacency_list; Param = detail::_project2nd; Tag = distance_combine_t; Rest = bgl_named_params, distance_compare_t, bgl_named_params, edge_weight_t>, edge_weight_t, bgl_named_params > >; typename graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/prim_minimum_spanning_tree.hpp:43:32: required from ‘void boost::detail::prim_mst_impl(const Graph&, typename boost::graph_traits::vertex_descriptor, const boost::bgl_named_params&, Weight) [with Graph = R_adjacency_list; P = boost::adj_list_edge_property_map, boost::edge_weight_t>; T = boost::edge_weight_t; R = boost::bgl_named_params; Weight = boost::adj_list_edge_property_map, boost::edge_weight_t>; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/prim_minimum_spanning_tree.hpp:77:26: required from ‘void boost::prim_minimum_spanning_tree(const VertexListGraph&, PredecessorMap) [with VertexListGraph = R_adjacency_list; PredecessorMap = long unsigned int*]’ minST.cpp:89:35: required from here /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::Assignable > >, boost::property >*, std::vector > >, boost::property >, std::allocator > >, boost::property > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> >]’ 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ^ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements > >, boost::property >*, std::vector > >, boost::property >, std::allocator > >, boost::property > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >]’: /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:233:5: required from ‘struct boost::EqualityComparable > >, boost::property >*, std::vector > >, boost::property >, std::allocator > >, boost::property > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:502:3: required from ‘struct boost::InputIterator > >, boost::property >*, std::vector > >, boost::property >, std::allocator > >, boost::property > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::InputIterator > >, boost::property >*, std::vector > >, boost::property >, std::allocator > >, boost::property > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> >]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied > >, boost::property >*, std::vector > >, boost::property >, std::allocator > >, boost::property > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::value’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied > >, boost::property >*, std::vector > >, boost::property >, std::allocator > >, boost::property > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:72:8: [ skipping 11 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/dijkstra_shortest_paths.hpp:528:32: required from ‘void boost::detail::dijkstra_dispatch2(const VertexListGraph&, typename boost::graph_traits::vertex_descriptor, DistanceMap, WeightMap, IndexMap, const Params&) [with VertexListGraph = R_adjacency_list; DistanceMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator > >, boost::vec_adj_list_vertex_id_map, long unsigned int>, double, double&>; WeightMap = boost::adj_list_edge_property_map, boost::edge_weight_t>; IndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>; Params = boost::bgl_named_params<_project2nd, boost::distance_combine_t, boost::bgl_named_params, boost::distance_compare_t, boost::bgl_named_params, boost::edge_weight_t>, boost::edge_weight_t, boost::bgl_named_params > > >; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/dijkstra_shortest_paths.hpp:554:35: required from ‘void boost::detail::dijkstra_dispatch1(const VertexListGraph&, typename boost::graph_traits::vertex_descriptor, DistanceMap, WeightMap, IndexMap, const Params&) [with VertexListGraph = R_adjacency_list; DistanceMap = boost::param_not_found; WeightMap = boost::adj_list_edge_property_map, boost::edge_weight_t>; IndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>; Params = boost::bgl_named_params<_project2nd, boost::distance_combine_t, boost::bgl_named_params, boost::distance_compare_t, boost::bgl_named_params, boost::edge_weight_t>, boost::edge_weight_t, boost::bgl_named_params > > >; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/dijkstra_shortest_paths.hpp:570:31: required from ‘void boost::dijkstra_shortest_paths(const VertexListGraph&, typename graph_traits::vertex_descriptor, const bgl_named_params&) [with VertexListGraph = R_adjacency_list; Param = detail::_project2nd; Tag = distance_combine_t; Rest = bgl_named_params, distance_compare_t, bgl_named_params, edge_weight_t>, edge_weight_t, bgl_named_params > >; typename graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/prim_minimum_spanning_tree.hpp:43:32: required from ‘void boost::detail::prim_mst_impl(const Graph&, typename boost::graph_traits::vertex_descriptor, const boost::bgl_named_params&, Weight) [with Graph = R_adjacency_list; P = boost::adj_list_edge_property_map, boost::edge_weight_t>; T = boost::edge_weight_t; R = boost::bgl_named_params; Weight = boost::adj_list_edge_property_map, boost::edge_weight_t>; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/prim_minimum_spanning_tree.hpp:77:26: required from ‘void boost::prim_minimum_spanning_tree(const VertexListGraph&, PredecessorMap) [with VertexListGraph = R_adjacency_list; PredecessorMap = long unsigned int*]’ minST.cpp:89:35: required from here /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::EqualityComparable > >, boost::property >*, std::vector > >, boost::property >, std::allocator > >, boost::property > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> >]’ 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ^ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements > >, boost::property >*, std::vector > >, boost::property >, std::allocator > >, boost::property > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >]’: /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:512:7: required from ‘struct boost::InputIterator > >, boost::property >*, std::vector > >, boost::property >, std::allocator > >, boost::property > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::InputIterator > >, boost::property >*, std::vector > >, boost::property >, std::allocator > >, boost::property > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> >]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied > >, boost::property >*, std::vector > >, boost::property >, std::allocator > >, boost::property > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::value’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied > >, boost::property >*, std::vector > >, boost::property >, std::allocator > >, boost::property > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_ > >, boost::property >*, std::vector > >, boost::property >, std::allocator > >, boost::property > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> >)>’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/graph_concepts.hpp:53:35: [ skipping 10 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/dijkstra_shortest_paths.hpp:528:32: required from ‘void boost::detail::dijkstra_dispatch2(const VertexListGraph&, typename boost::graph_traits::vertex_descriptor, DistanceMap, WeightMap, IndexMap, const Params&) [with VertexListGraph = R_adjacency_list; DistanceMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator > >, boost::vec_adj_list_vertex_id_map, long unsigned int>, double, double&>; WeightMap = boost::adj_list_edge_property_map, boost::edge_weight_t>; IndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>; Params = boost::bgl_named_params<_project2nd, boost::distance_combine_t, boost::bgl_named_params, boost::distance_compare_t, boost::bgl_named_params, boost::edge_weight_t>, boost::edge_weight_t, boost::bgl_named_params > > >; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/dijkstra_shortest_paths.hpp:554:35: required from ‘void boost::detail::dijkstra_dispatch1(const VertexListGraph&, typename boost::graph_traits::vertex_descriptor, DistanceMap, WeightMap, IndexMap, const Params&) [with VertexListGraph = R_adjacency_list; DistanceMap = boost::param_not_found; WeightMap = boost::adj_list_edge_property_map, boost::edge_weight_t>; IndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>; Params = boost::bgl_named_params<_project2nd, boost::distance_combine_t, boost::bgl_named_params, boost::distance_compare_t, boost::bgl_named_params, boost::edge_weight_t>, boost::edge_weight_t, boost::bgl_named_params > > >; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/dijkstra_shortest_paths.hpp:570:31: required from ‘void boost::dijkstra_shortest_paths(const VertexListGraph&, typename graph_traits::vertex_descriptor, const bgl_named_params&) [with VertexListGraph = R_adjacency_list; Param = detail::_project2nd; Tag = distance_combine_t; Rest = bgl_named_params, distance_compare_t, bgl_named_params, edge_weight_t>, edge_weight_t, bgl_named_params > >; typename graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/prim_minimum_spanning_tree.hpp:43:32: required from ‘void boost::detail::prim_mst_impl(const Graph&, typename boost::graph_traits::vertex_descriptor, const boost::bgl_named_params&, Weight) [with Graph = R_adjacency_list; P = boost::adj_list_edge_property_map, boost::edge_weight_t>; T = boost::edge_weight_t; R = boost::bgl_named_params; Weight = boost::adj_list_edge_property_map, boost::edge_weight_t>; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/prim_minimum_spanning_tree.hpp:77:26: required from ‘void boost::prim_minimum_spanning_tree(const VertexListGraph&, PredecessorMap) [with VertexListGraph = R_adjacency_list; PredecessorMap = long unsigned int*]’ minST.cpp:89:35: required from here /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::InputIterator > >, boost::property >*, std::vector > >, boost::property >, std::allocator > >, boost::property > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> >]’ 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ^ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::InputIterator > >, boost::property >*, std::vector > >, boost::property >, std::allocator > >, boost::property > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> >]’: /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/graph_concepts.hpp:53:35: required from ‘boost::concepts::MultiPassInputIterator::~MultiPassInputIterator() [with T = boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >, boost::property >*, std::vector > >, boost::property >, std::allocator > >, boost::property > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::MultiPassInputIterator > >, boost::property >*, std::vector > >, boost::property >, std::allocator > >, boost::property > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> >]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/graph_concepts.hpp:89:9: required from ‘boost::concepts::IncidenceGraph::~IncidenceGraph() [with G = R_adjacency_list]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/graph_concepts.hpp:75:1: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::IncidenceGraphConcept >]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/breadth_first_search.hpp:62:5: required from ‘void boost::breadth_first_visit(const IncidenceGraph&, SourceIterator, SourceIterator, Buffer&, BFSVisitor, ColorMap) [with IncidenceGraph = R_adjacency_list; Buffer = d_ary_heap_indirect, long unsigned int>, long unsigned int, long unsigned int&>, iterator_property_map<__gnu_cxx::__normal_iterator > >, vec_adj_list_vertex_id_map, long unsigned int>, double, double&>, std::less, std::vector >; BFSVisitor = detail::dijkstra_bfs_visitor, d_ary_heap_indirect, long unsigned int>, long unsigned int, long unsigned int&>, iterator_property_map<__gnu_cxx::__normal_iterator > >, vec_adj_list_vertex_id_map, long unsigned int>, double, double&>, std::less, std::vector >, adj_list_edge_property_map, edge_weight_t>, long unsigned int*, iterator_property_map<__gnu_cxx::__normal_iterator > >, vec_adj_list_vertex_id_map, long unsigned int>, double, double&>, detail::_project2nd, std::less >; ColorMap = two_bit_color_map, long unsigned int> >; SourceIterator = long unsigned int*]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/dijkstra_shortest_paths.hpp:387:24: [ skipping 5 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/dijkstra_shortest_paths.hpp:528:32: required from ‘void boost::detail::dijkstra_dispatch2(const VertexListGraph&, typename boost::graph_traits::vertex_descriptor, DistanceMap, WeightMap, IndexMap, const Params&) [with VertexListGraph = R_adjacency_list; DistanceMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator > >, boost::vec_adj_list_vertex_id_map, long unsigned int>, double, double&>; WeightMap = boost::adj_list_edge_property_map, boost::edge_weight_t>; IndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>; Params = boost::bgl_named_params<_project2nd, boost::distance_combine_t, boost::bgl_named_params, boost::distance_compare_t, boost::bgl_named_params, boost::edge_weight_t>, boost::edge_weight_t, boost::bgl_named_params > > >; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/dijkstra_shortest_paths.hpp:554:35: required from ‘void boost::detail::dijkstra_dispatch1(const VertexListGraph&, typename boost::graph_traits::vertex_descriptor, DistanceMap, WeightMap, IndexMap, const Params&) [with VertexListGraph = R_adjacency_list; DistanceMap = boost::param_not_found; WeightMap = boost::adj_list_edge_property_map, boost::edge_weight_t>; IndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>; Params = boost::bgl_named_params<_project2nd, boost::distance_combine_t, boost::bgl_named_params, boost::distance_compare_t, boost::bgl_named_params, boost::edge_weight_t>, boost::edge_weight_t, boost::bgl_named_params > > >; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/dijkstra_shortest_paths.hpp:570:31: required from ‘void boost::dijkstra_shortest_paths(const VertexListGraph&, typename graph_traits::vertex_descriptor, const bgl_named_params&) [with VertexListGraph = R_adjacency_list; Param = detail::_project2nd; Tag = distance_combine_t; Rest = bgl_named_params, distance_compare_t, bgl_named_params, edge_weight_t>, edge_weight_t, bgl_named_params > >; typename graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/prim_minimum_spanning_tree.hpp:43:32: required from ‘void boost::detail::prim_mst_impl(const Graph&, typename boost::graph_traits::vertex_descriptor, const boost::bgl_named_params&, Weight) [with Graph = R_adjacency_list; P = boost::adj_list_edge_property_map, boost::edge_weight_t>; T = boost::edge_weight_t; R = boost::bgl_named_params; Weight = boost::adj_list_edge_property_map, boost::edge_weight_t>; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/prim_minimum_spanning_tree.hpp:77:26: required from ‘void boost::prim_minimum_spanning_tree(const VertexListGraph&, PredecessorMap) [with VertexListGraph = R_adjacency_list; PredecessorMap = long unsigned int*]’ minST.cpp:89:35: required from here /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::InputIterator::~InputIterator() [with TT = boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >, boost::property >*, std::vector > >, boost::property >, std::allocator > >, boost::property > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>]’ 37 | ~model() | ^ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:512:7: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 512 | BOOST_CONCEPT_USAGE(InputIterator) | ^~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::Assignable > >, boost::property >*, std::vector > >, boost::property >, std::allocator > >, boost::property > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> >]’: /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements > >, boost::property >*, std::vector > >, boost::property >, std::allocator > >, boost::property > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:145:5: required from ‘struct boost::Assignable > >, boost::property >*, std::vector > >, boost::property >, std::allocator > >, boost::property > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:502:3: required from ‘struct boost::InputIterator > >, boost::property >*, std::vector > >, boost::property >, std::allocator > >, boost::property > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::InputIterator > >, boost::property >*, std::vector > >, boost::property >, std::allocator > >, boost::property > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> >]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied > >, boost::property >*, std::vector > >, boost::property >, std::allocator > >, boost::property > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::value’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:45:51: [ skipping 12 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/dijkstra_shortest_paths.hpp:528:32: required from ‘void boost::detail::dijkstra_dispatch2(const VertexListGraph&, typename boost::graph_traits::vertex_descriptor, DistanceMap, WeightMap, IndexMap, const Params&) [with VertexListGraph = R_adjacency_list; DistanceMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator > >, boost::vec_adj_list_vertex_id_map, long unsigned int>, double, double&>; WeightMap = boost::adj_list_edge_property_map, boost::edge_weight_t>; IndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>; Params = boost::bgl_named_params<_project2nd, boost::distance_combine_t, boost::bgl_named_params, boost::distance_compare_t, boost::bgl_named_params, boost::edge_weight_t>, boost::edge_weight_t, boost::bgl_named_params > > >; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/dijkstra_shortest_paths.hpp:554:35: required from ‘void boost::detail::dijkstra_dispatch1(const VertexListGraph&, typename boost::graph_traits::vertex_descriptor, DistanceMap, WeightMap, IndexMap, const Params&) [with VertexListGraph = R_adjacency_list; DistanceMap = boost::param_not_found; WeightMap = boost::adj_list_edge_property_map, boost::edge_weight_t>; IndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>; Params = boost::bgl_named_params<_project2nd, boost::distance_combine_t, boost::bgl_named_params, boost::distance_compare_t, boost::bgl_named_params, boost::edge_weight_t>, boost::edge_weight_t, boost::bgl_named_params > > >; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/dijkstra_shortest_paths.hpp:570:31: required from ‘void boost::dijkstra_shortest_paths(const VertexListGraph&, typename graph_traits::vertex_descriptor, const bgl_named_params&) [with VertexListGraph = R_adjacency_list; Param = detail::_project2nd; Tag = distance_combine_t; Rest = bgl_named_params, distance_compare_t, bgl_named_params, edge_weight_t>, edge_weight_t, bgl_named_params > >; typename graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/prim_minimum_spanning_tree.hpp:43:32: required from ‘void boost::detail::prim_mst_impl(const Graph&, typename boost::graph_traits::vertex_descriptor, const boost::bgl_named_params&, Weight) [with Graph = R_adjacency_list; P = boost::adj_list_edge_property_map, boost::edge_weight_t>; T = boost::edge_weight_t; R = boost::bgl_named_params; Weight = boost::adj_list_edge_property_map, boost::edge_weight_t>; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/prim_minimum_spanning_tree.hpp:77:26: required from ‘void boost::prim_minimum_spanning_tree(const VertexListGraph&, PredecessorMap) [with VertexListGraph = R_adjacency_list; PredecessorMap = long unsigned int*]’ minST.cpp:89:35: required from here /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::Assignable::~Assignable() [with TT = boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >, boost::property >*, std::vector > >, boost::property >, std::allocator > >, boost::property > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>]’ 37 | ~model() | ^ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:145:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 145 | BOOST_CONCEPT_USAGE(Assignable) { | ^~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::EqualityComparable > >, boost::property >*, std::vector > >, boost::property >, std::allocator > >, boost::property > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> >]’: /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements > >, boost::property >*, std::vector > >, boost::property >, std::allocator > >, boost::property > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:233:5: required from ‘struct boost::EqualityComparable > >, boost::property >*, std::vector > >, boost::property >, std::allocator > >, boost::property > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:502:3: required from ‘struct boost::InputIterator > >, boost::property >*, std::vector > >, boost::property >, std::allocator > >, boost::property > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::InputIterator > >, boost::property >*, std::vector > >, boost::property >, std::allocator > >, boost::property > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> >]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied > >, boost::property >*, std::vector > >, boost::property >, std::allocator > >, boost::property > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::value’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:45:51: [ skipping 12 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/dijkstra_shortest_paths.hpp:528:32: required from ‘void boost::detail::dijkstra_dispatch2(const VertexListGraph&, typename boost::graph_traits::vertex_descriptor, DistanceMap, WeightMap, IndexMap, const Params&) [with VertexListGraph = R_adjacency_list; DistanceMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator > >, boost::vec_adj_list_vertex_id_map, long unsigned int>, double, double&>; WeightMap = boost::adj_list_edge_property_map, boost::edge_weight_t>; IndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>; Params = boost::bgl_named_params<_project2nd, boost::distance_combine_t, boost::bgl_named_params, boost::distance_compare_t, boost::bgl_named_params, boost::edge_weight_t>, boost::edge_weight_t, boost::bgl_named_params > > >; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/dijkstra_shortest_paths.hpp:554:35: required from ‘void boost::detail::dijkstra_dispatch1(const VertexListGraph&, typename boost::graph_traits::vertex_descriptor, DistanceMap, WeightMap, IndexMap, const Params&) [with VertexListGraph = R_adjacency_list; DistanceMap = boost::param_not_found; WeightMap = boost::adj_list_edge_property_map, boost::edge_weight_t>; IndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>; Params = boost::bgl_named_params<_project2nd, boost::distance_combine_t, boost::bgl_named_params, boost::distance_compare_t, boost::bgl_named_params, boost::edge_weight_t>, boost::edge_weight_t, boost::bgl_named_params > > >; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/dijkstra_shortest_paths.hpp:570:31: required from ‘void boost::dijkstra_shortest_paths(const VertexListGraph&, typename graph_traits::vertex_descriptor, const bgl_named_params&) [with VertexListGraph = R_adjacency_list; Param = detail::_project2nd; Tag = distance_combine_t; Rest = bgl_named_params, distance_compare_t, bgl_named_params, edge_weight_t>, edge_weight_t, bgl_named_params > >; typename graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/prim_minimum_spanning_tree.hpp:43:32: required from ‘void boost::detail::prim_mst_impl(const Graph&, typename boost::graph_traits::vertex_descriptor, const boost::bgl_named_params&, Weight) [with Graph = R_adjacency_list; P = boost::adj_list_edge_property_map, boost::edge_weight_t>; T = boost::edge_weight_t; R = boost::bgl_named_params; Weight = boost::adj_list_edge_property_map, boost::edge_weight_t>; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/prim_minimum_spanning_tree.hpp:77:26: required from ‘void boost::prim_minimum_spanning_tree(const VertexListGraph&, PredecessorMap) [with VertexListGraph = R_adjacency_list; PredecessorMap = long unsigned int*]’ minST.cpp:89:35: required from here /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::EqualityComparable::~EqualityComparable() [with TT = boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >, boost::property >*, std::vector > >, boost::property >, std::allocator > >, boost::property > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>]’ 37 | ~model() | ^ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:233:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 233 | BOOST_CONCEPT_USAGE(EqualityComparable) { | ^~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::InputIterator > >, boost::property >*, std::vector > >, boost::property >, std::allocator > >, boost::property > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> >]’: /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements > >, boost::property >*, std::vector > >, boost::property >, std::allocator > >, boost::property > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:512:7: required from ‘struct boost::InputIterator > >, boost::property >*, std::vector > >, boost::property >, std::allocator > >, boost::property > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::InputIterator > >, boost::property >*, std::vector > >, boost::property >, std::allocator > >, boost::property > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> >]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied > >, boost::property >*, std::vector > >, boost::property >, std::allocator > >, boost::property > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::value’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied > >, boost::property >*, std::vector > >, boost::property >, std::allocator > >, boost::property > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:72:8: [ skipping 11 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/dijkstra_shortest_paths.hpp:528:32: required from ‘void boost::detail::dijkstra_dispatch2(const VertexListGraph&, typename boost::graph_traits::vertex_descriptor, DistanceMap, WeightMap, IndexMap, const Params&) [with VertexListGraph = R_adjacency_list; DistanceMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator > >, boost::vec_adj_list_vertex_id_map, long unsigned int>, double, double&>; WeightMap = boost::adj_list_edge_property_map, boost::edge_weight_t>; IndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>; Params = boost::bgl_named_params<_project2nd, boost::distance_combine_t, boost::bgl_named_params, boost::distance_compare_t, boost::bgl_named_params, boost::edge_weight_t>, boost::edge_weight_t, boost::bgl_named_params > > >; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/dijkstra_shortest_paths.hpp:554:35: required from ‘void boost::detail::dijkstra_dispatch1(const VertexListGraph&, typename boost::graph_traits::vertex_descriptor, DistanceMap, WeightMap, IndexMap, const Params&) [with VertexListGraph = R_adjacency_list; DistanceMap = boost::param_not_found; WeightMap = boost::adj_list_edge_property_map, boost::edge_weight_t>; IndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>; Params = boost::bgl_named_params<_project2nd, boost::distance_combine_t, boost::bgl_named_params, boost::distance_compare_t, boost::bgl_named_params, boost::edge_weight_t>, boost::edge_weight_t, boost::bgl_named_params > > >; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/dijkstra_shortest_paths.hpp:570:31: required from ‘void boost::dijkstra_shortest_paths(const VertexListGraph&, typename graph_traits::vertex_descriptor, const bgl_named_params&) [with VertexListGraph = R_adjacency_list; Param = detail::_project2nd; Tag = distance_combine_t; Rest = bgl_named_params, distance_compare_t, bgl_named_params, edge_weight_t>, edge_weight_t, bgl_named_params > >; typename graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/prim_minimum_spanning_tree.hpp:43:32: required from ‘void boost::detail::prim_mst_impl(const Graph&, typename boost::graph_traits::vertex_descriptor, const boost::bgl_named_params&, Weight) [with Graph = R_adjacency_list; P = boost::adj_list_edge_property_map, boost::edge_weight_t>; T = boost::edge_weight_t; R = boost::bgl_named_params; Weight = boost::adj_list_edge_property_map, boost::edge_weight_t>; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/prim_minimum_spanning_tree.hpp:77:26: required from ‘void boost::prim_minimum_spanning_tree(const VertexListGraph&, PredecessorMap) [with VertexListGraph = R_adjacency_list; PredecessorMap = long unsigned int*]’ minST.cpp:89:35: required from here /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::InputIterator::~InputIterator() [with TT = boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >, boost::property >*, std::vector > >, boost::property >, std::allocator > >, boost::property > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>]’ 37 | ~model() | ^ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:512:7: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 512 | BOOST_CONCEPT_USAGE(InputIterator) | ^~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements, std::input_iterator_tag> >]’: /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:208:5: required from ‘struct boost::Convertible, std::input_iterator_tag>’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::Convertible, std::input_iterator_tag>]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied, std::input_iterator_tag> >::value’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied, std::input_iterator_tag> >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_, std::input_iterator_tag>)>’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:515:9: [ skipping 12 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/dijkstra_shortest_paths.hpp:528:32: required from ‘void boost::detail::dijkstra_dispatch2(const VertexListGraph&, typename boost::graph_traits::vertex_descriptor, DistanceMap, WeightMap, IndexMap, const Params&) [with VertexListGraph = R_adjacency_list; DistanceMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator > >, boost::vec_adj_list_vertex_id_map, long unsigned int>, double, double&>; WeightMap = boost::adj_list_edge_property_map, boost::edge_weight_t>; IndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>; Params = boost::bgl_named_params<_project2nd, boost::distance_combine_t, boost::bgl_named_params, boost::distance_compare_t, boost::bgl_named_params, boost::edge_weight_t>, boost::edge_weight_t, boost::bgl_named_params > > >; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/dijkstra_shortest_paths.hpp:554:35: required from ‘void boost::detail::dijkstra_dispatch1(const VertexListGraph&, typename boost::graph_traits::vertex_descriptor, DistanceMap, WeightMap, IndexMap, const Params&) [with VertexListGraph = R_adjacency_list; DistanceMap = boost::param_not_found; WeightMap = boost::adj_list_edge_property_map, boost::edge_weight_t>; IndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>; Params = boost::bgl_named_params<_project2nd, boost::distance_combine_t, boost::bgl_named_params, boost::distance_compare_t, boost::bgl_named_params, boost::edge_weight_t>, boost::edge_weight_t, boost::bgl_named_params > > >; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/dijkstra_shortest_paths.hpp:570:31: required from ‘void boost::dijkstra_shortest_paths(const VertexListGraph&, typename graph_traits::vertex_descriptor, const bgl_named_params&) [with VertexListGraph = R_adjacency_list; Param = detail::_project2nd; Tag = distance_combine_t; Rest = bgl_named_params, distance_compare_t, bgl_named_params, edge_weight_t>, edge_weight_t, bgl_named_params > >; typename graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/prim_minimum_spanning_tree.hpp:43:32: required from ‘void boost::detail::prim_mst_impl(const Graph&, typename boost::graph_traits::vertex_descriptor, const boost::bgl_named_params&, Weight) [with Graph = R_adjacency_list; P = boost::adj_list_edge_property_map, boost::edge_weight_t>; T = boost::edge_weight_t; R = boost::bgl_named_params; Weight = boost::adj_list_edge_property_map, boost::edge_weight_t>; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/prim_minimum_spanning_tree.hpp:77:26: required from ‘void boost::prim_minimum_spanning_tree(const VertexListGraph&, PredecessorMap) [with VertexListGraph = R_adjacency_list; PredecessorMap = long unsigned int*]’ minST.cpp:89:35: required from here /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::Convertible, std::input_iterator_tag>]’ 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ^ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::Convertible, std::input_iterator_tag>]’: /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:515:9: required from ‘boost::InputIterator::~InputIterator() [with TT = boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >, boost::property >*, std::vector > >, boost::property >, std::allocator > >, boost::property > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::InputIterator > >, boost::property >*, std::vector > >, boost::property >, std::allocator > >, boost::property > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> >]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/graph_concepts.hpp:53:35: required from ‘boost::concepts::MultiPassInputIterator::~MultiPassInputIterator() [with T = boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >, boost::property >*, std::vector > >, boost::property >, std::allocator > >, boost::property > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::MultiPassInputIterator > >, boost::property >*, std::vector > >, boost::property >, std::allocator > >, boost::property > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> >]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/graph_concepts.hpp:89:9: required from ‘boost::concepts::IncidenceGraph::~IncidenceGraph() [with G = R_adjacency_list]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/graph_concepts.hpp:75:1: [ skipping 7 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/dijkstra_shortest_paths.hpp:528:32: required from ‘void boost::detail::dijkstra_dispatch2(const VertexListGraph&, typename boost::graph_traits::vertex_descriptor, DistanceMap, WeightMap, IndexMap, const Params&) [with VertexListGraph = R_adjacency_list; DistanceMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator > >, boost::vec_adj_list_vertex_id_map, long unsigned int>, double, double&>; WeightMap = boost::adj_list_edge_property_map, boost::edge_weight_t>; IndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>; Params = boost::bgl_named_params<_project2nd, boost::distance_combine_t, boost::bgl_named_params, boost::distance_compare_t, boost::bgl_named_params, boost::edge_weight_t>, boost::edge_weight_t, boost::bgl_named_params > > >; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/dijkstra_shortest_paths.hpp:554:35: required from ‘void boost::detail::dijkstra_dispatch1(const VertexListGraph&, typename boost::graph_traits::vertex_descriptor, DistanceMap, WeightMap, IndexMap, const Params&) [with VertexListGraph = R_adjacency_list; DistanceMap = boost::param_not_found; WeightMap = boost::adj_list_edge_property_map, boost::edge_weight_t>; IndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>; Params = boost::bgl_named_params<_project2nd, boost::distance_combine_t, boost::bgl_named_params, boost::distance_compare_t, boost::bgl_named_params, boost::edge_weight_t>, boost::edge_weight_t, boost::bgl_named_params > > >; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/dijkstra_shortest_paths.hpp:570:31: required from ‘void boost::dijkstra_shortest_paths(const VertexListGraph&, typename graph_traits::vertex_descriptor, const bgl_named_params&) [with VertexListGraph = R_adjacency_list; Param = detail::_project2nd; Tag = distance_combine_t; Rest = bgl_named_params, distance_compare_t, bgl_named_params, edge_weight_t>, edge_weight_t, bgl_named_params > >; typename graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/prim_minimum_spanning_tree.hpp:43:32: required from ‘void boost::detail::prim_mst_impl(const Graph&, typename boost::graph_traits::vertex_descriptor, const boost::bgl_named_params&, Weight) [with Graph = R_adjacency_list; P = boost::adj_list_edge_property_map, boost::edge_weight_t>; T = boost::edge_weight_t; R = boost::bgl_named_params; Weight = boost::adj_list_edge_property_map, boost::edge_weight_t>; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/prim_minimum_spanning_tree.hpp:77:26: required from ‘void boost::prim_minimum_spanning_tree(const VertexListGraph&, PredecessorMap) [with VertexListGraph = R_adjacency_list; PredecessorMap = long unsigned int*]’ minST.cpp:89:35: required from here /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::Convertible::~Convertible() [with X = boost::iterators::detail::iterator_category_with_traversal; Y = std::input_iterator_tag]’ 37 | ~model() | ^ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:208:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 208 | BOOST_CONCEPT_USAGE(Convertible) { | ^~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::Convertible, std::input_iterator_tag>]’: /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements, std::input_iterator_tag> >]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:208:5: required from ‘struct boost::Convertible, std::input_iterator_tag>’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::Convertible, std::input_iterator_tag>]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied, std::input_iterator_tag> >::value’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied, std::input_iterator_tag> >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:72:8: [ skipping 13 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/dijkstra_shortest_paths.hpp:528:32: required from ‘void boost::detail::dijkstra_dispatch2(const VertexListGraph&, typename boost::graph_traits::vertex_descriptor, DistanceMap, WeightMap, IndexMap, const Params&) [with VertexListGraph = R_adjacency_list; DistanceMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator > >, boost::vec_adj_list_vertex_id_map, long unsigned int>, double, double&>; WeightMap = boost::adj_list_edge_property_map, boost::edge_weight_t>; IndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>; Params = boost::bgl_named_params<_project2nd, boost::distance_combine_t, boost::bgl_named_params, boost::distance_compare_t, boost::bgl_named_params, boost::edge_weight_t>, boost::edge_weight_t, boost::bgl_named_params > > >; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/dijkstra_shortest_paths.hpp:554:35: required from ‘void boost::detail::dijkstra_dispatch1(const VertexListGraph&, typename boost::graph_traits::vertex_descriptor, DistanceMap, WeightMap, IndexMap, const Params&) [with VertexListGraph = R_adjacency_list; DistanceMap = boost::param_not_found; WeightMap = boost::adj_list_edge_property_map, boost::edge_weight_t>; IndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>; Params = boost::bgl_named_params<_project2nd, boost::distance_combine_t, boost::bgl_named_params, boost::distance_compare_t, boost::bgl_named_params, boost::edge_weight_t>, boost::edge_weight_t, boost::bgl_named_params > > >; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/dijkstra_shortest_paths.hpp:570:31: required from ‘void boost::dijkstra_shortest_paths(const VertexListGraph&, typename graph_traits::vertex_descriptor, const bgl_named_params&) [with VertexListGraph = R_adjacency_list; Param = detail::_project2nd; Tag = distance_combine_t; Rest = bgl_named_params, distance_compare_t, bgl_named_params, edge_weight_t>, edge_weight_t, bgl_named_params > >; typename graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/prim_minimum_spanning_tree.hpp:43:32: required from ‘void boost::detail::prim_mst_impl(const Graph&, typename boost::graph_traits::vertex_descriptor, const boost::bgl_named_params&, Weight) [with Graph = R_adjacency_list; P = boost::adj_list_edge_property_map, boost::edge_weight_t>; T = boost::edge_weight_t; R = boost::bgl_named_params; Weight = boost::adj_list_edge_property_map, boost::edge_weight_t>; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/prim_minimum_spanning_tree.hpp:77:26: required from ‘void boost::prim_minimum_spanning_tree(const VertexListGraph&, PredecessorMap) [with VertexListGraph = R_adjacency_list; PredecessorMap = long unsigned int*]’ minST.cpp:89:35: required from here /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::Convertible::~Convertible() [with X = boost::iterators::detail::iterator_category_with_traversal; Y = std::input_iterator_tag]’ 37 | ~model() | ^ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:208:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 208 | BOOST_CONCEPT_USAGE(Convertible) { | ^~~~~~~~~~~~~~~~~~~ g++ -std=gnu++17 -I"/usr/share/R/include" -DNDEBUG -I'/home/omnipath/local/R/4.4-3.20/BH/include' -fpic -g -O2 -fno-omit-frame-pointer -mno-omit-leaf-frame-pointer -ffile-prefix-map=/build/r-base-EawLoD/r-base-4.4.1=. -fstack-protector-strong -fstack-clash-protection -Wformat -Werror=format-security -fcf-protection -fdebug-prefix-map=/build/r-base-EawLoD/r-base-4.4.1=/usr/src/r-base-4.4.1-1.2404.0 -Wdate-time -D_FORTIFY_SOURCE=3 -c mincut.cpp -o mincut.o In file included from /home/omnipath/local/R/4.4-3.20/BH/include/boost/smart_ptr/shared_ptr.hpp:18, from /home/omnipath/local/R/4.4-3.20/BH/include/boost/property_map/vector_property_map.hpp:14, from /home/omnipath/local/R/4.4-3.20/BH/include/boost/property_map/property_map.hpp:598, from RBGL.hpp:17, from mincut.cpp:1: /home/omnipath/local/R/4.4-3.20/BH/include/boost/smart_ptr/detail/shared_count.hpp:361:33: warning: ‘template class std::auto_ptr’ is deprecated: use 'std::unique_ptr' instead [-Wdeprecated-declarations] 361 | explicit shared_count( std::auto_ptr & r ): pi_( new sp_counted_impl_p( r.get() ) ) | ^~~~~~~~ In file included from /usr/include/c++/13/memory:78, from /home/omnipath/local/R/4.4-3.20/BH/include/boost/smart_ptr/detail/sp_counted_impl.hpp:35, from /home/omnipath/local/R/4.4-3.20/BH/include/boost/smart_ptr/detail/shared_count.hpp:27: /usr/include/c++/13/bits/unique_ptr.h:65:28: note: declared here 65 | template class auto_ptr; | ^~~~~~~~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/smart_ptr/shared_ptr.hpp:251:65: warning: ‘template class std::auto_ptr’ is deprecated: use 'std::unique_ptr' instead [-Wdeprecated-declarations] 251 | template< class T, class R > struct sp_enable_if_auto_ptr< std::auto_ptr< T >, R > | ^~~~~~~~ /usr/include/c++/13/bits/unique_ptr.h:65:28: note: declared here 65 | template class auto_ptr; | ^~~~~~~~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/smart_ptr/shared_ptr.hpp:508:31: warning: ‘template class std::auto_ptr’ is deprecated: use 'std::unique_ptr' instead [-Wdeprecated-declarations] 508 | explicit shared_ptr( std::auto_ptr & r ): px(r.get()), pn() | ^~~~~~~~ /usr/include/c++/13/bits/unique_ptr.h:65:28: note: declared here 65 | template class auto_ptr; | ^~~~~~~~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/smart_ptr/shared_ptr.hpp:521:22: warning: ‘template class std::auto_ptr’ is deprecated: use 'std::unique_ptr' instead [-Wdeprecated-declarations] 521 | shared_ptr( std::auto_ptr && r ): px(r.get()), pn() | ^~~~~~~~ /usr/include/c++/13/bits/unique_ptr.h:65:28: note: declared here 65 | template class auto_ptr; | ^~~~~~~~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/smart_ptr/shared_ptr.hpp:604:34: warning: ‘template class std::auto_ptr’ is deprecated: use 'std::unique_ptr' instead [-Wdeprecated-declarations] 604 | shared_ptr & operator=( std::auto_ptr & r ) | ^~~~~~~~ /usr/include/c++/13/bits/unique_ptr.h:65:28: note: declared here 65 | template class auto_ptr; | ^~~~~~~~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/smart_ptr/shared_ptr.hpp:613:34: warning: ‘template class std::auto_ptr’ is deprecated: use 'std::unique_ptr' instead [-Wdeprecated-declarations] 613 | shared_ptr & operator=( std::auto_ptr && r ) | ^~~~~~~~ /usr/include/c++/13/bits/unique_ptr.h:65:28: note: declared here 65 | template class auto_ptr; | ^~~~~~~~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/smart_ptr/shared_ptr.hpp: In member function ‘boost::shared_ptr& boost::shared_ptr::operator=(std::auto_ptr<_Up>&&)’: /home/omnipath/local/R/4.4-3.20/BH/include/boost/smart_ptr/shared_ptr.hpp:615:38: warning: ‘template class std::auto_ptr’ is deprecated: use 'std::unique_ptr' instead [-Wdeprecated-declarations] 615 | this_type( static_cast< std::auto_ptr && >( r ) ).swap( *this ); | ^~~~~~~~ /usr/include/c++/13/bits/unique_ptr.h:65:28: note: declared here 65 | template class auto_ptr; | ^~~~~~~~ In file included from /home/omnipath/local/R/4.4-3.20/BH/include/boost/scoped_ptr.hpp:13, from /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/adjacency_list.hpp:22, from RBGL.hpp:38: /home/omnipath/local/R/4.4-3.20/BH/include/boost/smart_ptr/scoped_ptr.hpp: At global scope: /home/omnipath/local/R/4.4-3.20/BH/include/boost/smart_ptr/scoped_ptr.hpp:75:31: warning: ‘template class std::auto_ptr’ is deprecated: use 'std::unique_ptr' instead [-Wdeprecated-declarations] 75 | explicit scoped_ptr( std::auto_ptr p ) BOOST_SP_NOEXCEPT : px( p.release() ) | ^~~~~~~~ /usr/include/c++/13/bits/unique_ptr.h:65:28: note: declared here 65 | template class auto_ptr; | ^~~~~~~~ In file included from /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/assert.hpp:35, from /home/omnipath/local/R/4.4-3.20/BH/include/boost/property_map/property_map.hpp:19: /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements*, std::vector, std::allocator > > > > >]’: /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:145:5: required from ‘struct boost::Assignable<__gnu_cxx::__normal_iterator*, std::vector, std::allocator > > > >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:502:3: required from ‘struct boost::InputIterator<__gnu_cxx::__normal_iterator*, std::vector, std::allocator > > > >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:540:3: required from ‘struct boost::ForwardIterator<__gnu_cxx::__normal_iterator*, std::vector, std::allocator > > > >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:568:3: required from ‘struct boost::BidirectionalIterator<__gnu_cxx::__normal_iterator*, std::vector, std::allocator > > > >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:597:3: required from ‘struct boost::RandomAccessIterator<__gnu_cxx::__normal_iterator*, std::vector, std::allocator > > > >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:597:3: [ skipping 4 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_*, std::vector, std::allocator > > > >)>’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/property_map/property_map.hpp:354:5: required from ‘boost::iterator_property_map boost::make_iterator_property_map(RAIter, ID, Value) [with RAIter = __gnu_cxx::__normal_iterator*, std::vector, std::allocator > > >; Value = detail::edge_desc_impl; ID = vec_adj_list_vertex_id_map]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/edmonds_karp_max_flow.hpp:209:43: required from ‘static typename boost::detail::edge_capacity_value::type boost::detail::edmonds_karp_dispatch1::apply(Graph&, typename boost::graph_traits::vertex_descriptor, typename boost::graph_traits::vertex_descriptor, const boost::bgl_named_params&, boost::param_not_found) [with Graph = boost::adjacency_list > > > >; P = int; T = boost::buffer_param_t; R = boost::no_property; typename boost::detail::edge_capacity_value::type = double; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/edmonds_karp_max_flow.hpp:228:57: required from ‘typename boost::detail::edge_capacity_value::type boost::edmonds_karp_max_flow(Graph&, typename graph_traits::vertex_descriptor, typename graph_traits::vertex_descriptor, const bgl_named_params&) [with Graph = adjacency_list > > > >; P = int; T = buffer_param_t; R = no_property; typename detail::edge_capacity_value::type = double; typename graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/edmonds_karp_max_flow.hpp:240:33: required from ‘typename boost::property_traits::const_type>::value_type boost::edmonds_karp_max_flow(Graph&, typename graph_traits::vertex_descriptor, typename graph_traits::vertex_descriptor) [with Graph = adjacency_list > > > >; typename property_traits::const_type>::value_type = double; typename property_map::const_type = adj_list_edge_property_map > > >, edge_capacity_t>; typename graph_traits::vertex_descriptor = long unsigned int]’ mincut.cpp:76:45: required from here /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ In file included from /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:31, from /home/omnipath/local/R/4.4-3.20/BH/include/boost/property_map/property_map.hpp:20: /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::Assignable<__gnu_cxx::__normal_iterator*, std::vector, std::allocator > > > >]’ 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ^ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements*, std::vector, std::allocator > > > > >]’: /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:233:5: required from ‘struct boost::EqualityComparable<__gnu_cxx::__normal_iterator*, std::vector, std::allocator > > > >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:502:3: required from ‘struct boost::InputIterator<__gnu_cxx::__normal_iterator*, std::vector, std::allocator > > > >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:540:3: required from ‘struct boost::ForwardIterator<__gnu_cxx::__normal_iterator*, std::vector, std::allocator > > > >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:568:3: required from ‘struct boost::BidirectionalIterator<__gnu_cxx::__normal_iterator*, std::vector, std::allocator > > > >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:597:3: required from ‘struct boost::RandomAccessIterator<__gnu_cxx::__normal_iterator*, std::vector, std::allocator > > > >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:597:3: [ skipping 4 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_*, std::vector, std::allocator > > > >)>’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/property_map/property_map.hpp:354:5: required from ‘boost::iterator_property_map boost::make_iterator_property_map(RAIter, ID, Value) [with RAIter = __gnu_cxx::__normal_iterator*, std::vector, std::allocator > > >; Value = detail::edge_desc_impl; ID = vec_adj_list_vertex_id_map]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/edmonds_karp_max_flow.hpp:209:43: required from ‘static typename boost::detail::edge_capacity_value::type boost::detail::edmonds_karp_dispatch1::apply(Graph&, typename boost::graph_traits::vertex_descriptor, typename boost::graph_traits::vertex_descriptor, const boost::bgl_named_params&, boost::param_not_found) [with Graph = boost::adjacency_list > > > >; P = int; T = boost::buffer_param_t; R = boost::no_property; typename boost::detail::edge_capacity_value::type = double; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/edmonds_karp_max_flow.hpp:228:57: required from ‘typename boost::detail::edge_capacity_value::type boost::edmonds_karp_max_flow(Graph&, typename graph_traits::vertex_descriptor, typename graph_traits::vertex_descriptor, const bgl_named_params&) [with Graph = adjacency_list > > > >; P = int; T = buffer_param_t; R = no_property; typename detail::edge_capacity_value::type = double; typename graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/edmonds_karp_max_flow.hpp:240:33: required from ‘typename boost::property_traits::const_type>::value_type boost::edmonds_karp_max_flow(Graph&, typename graph_traits::vertex_descriptor, typename graph_traits::vertex_descriptor) [with Graph = adjacency_list > > > >; typename property_traits::const_type>::value_type = double; typename property_map::const_type = adj_list_edge_property_map > > >, edge_capacity_t>; typename graph_traits::vertex_descriptor = long unsigned int]’ mincut.cpp:76:45: required from here /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::EqualityComparable<__gnu_cxx::__normal_iterator*, std::vector, std::allocator > > > >]’ 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ^ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements*, std::vector, std::allocator > > > > >]’: /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:512:7: required from ‘struct boost::InputIterator<__gnu_cxx::__normal_iterator*, std::vector, std::allocator > > > >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:540:3: required from ‘struct boost::ForwardIterator<__gnu_cxx::__normal_iterator*, std::vector, std::allocator > > > >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:568:3: required from ‘struct boost::BidirectionalIterator<__gnu_cxx::__normal_iterator*, std::vector, std::allocator > > > >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:597:3: required from ‘struct boost::RandomAccessIterator<__gnu_cxx::__normal_iterator*, std::vector, std::allocator > > > >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:597:3: required from ‘struct boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator*, std::vector, std::allocator > > > >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:32:62: [ skipping 3 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_*, std::vector, std::allocator > > > >)>’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/property_map/property_map.hpp:354:5: required from ‘boost::iterator_property_map boost::make_iterator_property_map(RAIter, ID, Value) [with RAIter = __gnu_cxx::__normal_iterator*, std::vector, std::allocator > > >; Value = detail::edge_desc_impl; ID = vec_adj_list_vertex_id_map]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/edmonds_karp_max_flow.hpp:209:43: required from ‘static typename boost::detail::edge_capacity_value::type boost::detail::edmonds_karp_dispatch1::apply(Graph&, typename boost::graph_traits::vertex_descriptor, typename boost::graph_traits::vertex_descriptor, const boost::bgl_named_params&, boost::param_not_found) [with Graph = boost::adjacency_list > > > >; P = int; T = boost::buffer_param_t; R = boost::no_property; typename boost::detail::edge_capacity_value::type = double; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/edmonds_karp_max_flow.hpp:228:57: required from ‘typename boost::detail::edge_capacity_value::type boost::edmonds_karp_max_flow(Graph&, typename graph_traits::vertex_descriptor, typename graph_traits::vertex_descriptor, const bgl_named_params&) [with Graph = adjacency_list > > > >; P = int; T = buffer_param_t; R = no_property; typename detail::edge_capacity_value::type = double; typename graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/edmonds_karp_max_flow.hpp:240:33: required from ‘typename boost::property_traits::const_type>::value_type boost::edmonds_karp_max_flow(Graph&, typename graph_traits::vertex_descriptor, typename graph_traits::vertex_descriptor) [with Graph = adjacency_list > > > >; typename property_traits::const_type>::value_type = double; typename property_map::const_type = adj_list_edge_property_map > > >, edge_capacity_t>; typename graph_traits::vertex_descriptor = long unsigned int]’ mincut.cpp:76:45: required from here /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::InputIterator<__gnu_cxx::__normal_iterator*, std::vector, std::allocator > > > >]’ 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ^ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements*, std::vector, std::allocator > > > > >]’: /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:543:7: required from ‘struct boost::ForwardIterator<__gnu_cxx::__normal_iterator*, std::vector, std::allocator > > > >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:568:3: required from ‘struct boost::BidirectionalIterator<__gnu_cxx::__normal_iterator*, std::vector, std::allocator > > > >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:597:3: required from ‘struct boost::RandomAccessIterator<__gnu_cxx::__normal_iterator*, std::vector, std::allocator > > > >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:597:3: required from ‘struct boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator*, std::vector, std::allocator > > > >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator*, std::vector, std::allocator > > > >]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:42:5: [ skipping 2 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_*, std::vector, std::allocator > > > >)>’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/property_map/property_map.hpp:354:5: required from ‘boost::iterator_property_map boost::make_iterator_property_map(RAIter, ID, Value) [with RAIter = __gnu_cxx::__normal_iterator*, std::vector, std::allocator > > >; Value = detail::edge_desc_impl; ID = vec_adj_list_vertex_id_map]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/edmonds_karp_max_flow.hpp:209:43: required from ‘static typename boost::detail::edge_capacity_value::type boost::detail::edmonds_karp_dispatch1::apply(Graph&, typename boost::graph_traits::vertex_descriptor, typename boost::graph_traits::vertex_descriptor, const boost::bgl_named_params&, boost::param_not_found) [with Graph = boost::adjacency_list > > > >; P = int; T = boost::buffer_param_t; R = boost::no_property; typename boost::detail::edge_capacity_value::type = double; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/edmonds_karp_max_flow.hpp:228:57: required from ‘typename boost::detail::edge_capacity_value::type boost::edmonds_karp_max_flow(Graph&, typename graph_traits::vertex_descriptor, typename graph_traits::vertex_descriptor, const bgl_named_params&) [with Graph = adjacency_list > > > >; P = int; T = buffer_param_t; R = no_property; typename detail::edge_capacity_value::type = double; typename graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/edmonds_karp_max_flow.hpp:240:33: required from ‘typename boost::property_traits::const_type>::value_type boost::edmonds_karp_max_flow(Graph&, typename graph_traits::vertex_descriptor, typename graph_traits::vertex_descriptor) [with Graph = adjacency_list > > > >; typename property_traits::const_type>::value_type = double; typename property_map::const_type = adj_list_edge_property_map > > >, edge_capacity_t>; typename graph_traits::vertex_descriptor = long unsigned int]’ mincut.cpp:76:45: required from here /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::ForwardIterator<__gnu_cxx::__normal_iterator*, std::vector, std::allocator > > > >]’ 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ^ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements*, std::vector, std::allocator > > > > >]’: /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:571:7: required from ‘struct boost::BidirectionalIterator<__gnu_cxx::__normal_iterator*, std::vector, std::allocator > > > >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:597:3: required from ‘struct boost::RandomAccessIterator<__gnu_cxx::__normal_iterator*, std::vector, std::allocator > > > >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:597:3: required from ‘struct boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator*, std::vector, std::allocator > > > >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator*, std::vector, std::allocator > > > >]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:42:5: [ skipping 2 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_*, std::vector, std::allocator > > > >)>’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/property_map/property_map.hpp:354:5: required from ‘boost::iterator_property_map boost::make_iterator_property_map(RAIter, ID, Value) [with RAIter = __gnu_cxx::__normal_iterator*, std::vector, std::allocator > > >; Value = detail::edge_desc_impl; ID = vec_adj_list_vertex_id_map]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/edmonds_karp_max_flow.hpp:209:43: required from ‘static typename boost::detail::edge_capacity_value::type boost::detail::edmonds_karp_dispatch1::apply(Graph&, typename boost::graph_traits::vertex_descriptor, typename boost::graph_traits::vertex_descriptor, const boost::bgl_named_params&, boost::param_not_found) [with Graph = boost::adjacency_list > > > >; P = int; T = boost::buffer_param_t; R = boost::no_property; typename boost::detail::edge_capacity_value::type = double; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/edmonds_karp_max_flow.hpp:228:57: required from ‘typename boost::detail::edge_capacity_value::type boost::edmonds_karp_max_flow(Graph&, typename graph_traits::vertex_descriptor, typename graph_traits::vertex_descriptor, const bgl_named_params&) [with Graph = adjacency_list > > > >; P = int; T = buffer_param_t; R = no_property; typename detail::edge_capacity_value::type = double; typename graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/edmonds_karp_max_flow.hpp:240:33: required from ‘typename boost::property_traits::const_type>::value_type boost::edmonds_karp_max_flow(Graph&, typename graph_traits::vertex_descriptor, typename graph_traits::vertex_descriptor) [with Graph = adjacency_list > > > >; typename property_traits::const_type>::value_type = double; typename property_map::const_type = adj_list_edge_property_map > > >, edge_capacity_t>; typename graph_traits::vertex_descriptor = long unsigned int]’ mincut.cpp:76:45: required from here /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::BidirectionalIterator<__gnu_cxx::__normal_iterator*, std::vector, std::allocator > > > >]’ 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ^ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements*, std::vector, std::allocator > > > > >]’: /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:253:5: required from ‘struct boost::Comparable<__gnu_cxx::__normal_iterator*, std::vector, std::allocator > > > >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:597:3: required from ‘struct boost::RandomAccessIterator<__gnu_cxx::__normal_iterator*, std::vector, std::allocator > > > >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:597:3: required from ‘struct boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator*, std::vector, std::allocator > > > >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator*, std::vector, std::allocator > > > >]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:42:5: [ skipping 2 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_*, std::vector, std::allocator > > > >)>’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/property_map/property_map.hpp:354:5: required from ‘boost::iterator_property_map boost::make_iterator_property_map(RAIter, ID, Value) [with RAIter = __gnu_cxx::__normal_iterator*, std::vector, std::allocator > > >; Value = detail::edge_desc_impl; ID = vec_adj_list_vertex_id_map]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/edmonds_karp_max_flow.hpp:209:43: required from ‘static typename boost::detail::edge_capacity_value::type boost::detail::edmonds_karp_dispatch1::apply(Graph&, typename boost::graph_traits::vertex_descriptor, typename boost::graph_traits::vertex_descriptor, const boost::bgl_named_params&, boost::param_not_found) [with Graph = boost::adjacency_list > > > >; P = int; T = boost::buffer_param_t; R = boost::no_property; typename boost::detail::edge_capacity_value::type = double; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/edmonds_karp_max_flow.hpp:228:57: required from ‘typename boost::detail::edge_capacity_value::type boost::edmonds_karp_max_flow(Graph&, typename graph_traits::vertex_descriptor, typename graph_traits::vertex_descriptor, const bgl_named_params&) [with Graph = adjacency_list > > > >; P = int; T = buffer_param_t; R = no_property; typename detail::edge_capacity_value::type = double; typename graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/edmonds_karp_max_flow.hpp:240:33: required from ‘typename boost::property_traits::const_type>::value_type boost::edmonds_karp_max_flow(Graph&, typename graph_traits::vertex_descriptor, typename graph_traits::vertex_descriptor) [with Graph = adjacency_list > > > >; typename property_traits::const_type>::value_type = double; typename property_map::const_type = adj_list_edge_property_map > > >, edge_capacity_t>; typename graph_traits::vertex_descriptor = long unsigned int]’ mincut.cpp:76:45: required from here /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::Comparable<__gnu_cxx::__normal_iterator*, std::vector, std::allocator > > > >]’ 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ^ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements*, std::vector, std::allocator > > > > >]’: /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:601:7: required from ‘struct boost::RandomAccessIterator<__gnu_cxx::__normal_iterator*, std::vector, std::allocator > > > >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:597:3: required from ‘struct boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator*, std::vector, std::allocator > > > >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator*, std::vector, std::allocator > > > >]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied*, std::vector, std::allocator > > > > >::value’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied*, std::vector, std::allocator > > > > >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_*, std::vector, std::allocator > > > >)>’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/property_map/property_map.hpp:354:5: required from ‘boost::iterator_property_map boost::make_iterator_property_map(RAIter, ID, Value) [with RAIter = __gnu_cxx::__normal_iterator*, std::vector, std::allocator > > >; Value = detail::edge_desc_impl; ID = vec_adj_list_vertex_id_map]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/edmonds_karp_max_flow.hpp:209:43: required from ‘static typename boost::detail::edge_capacity_value::type boost::detail::edmonds_karp_dispatch1::apply(Graph&, typename boost::graph_traits::vertex_descriptor, typename boost::graph_traits::vertex_descriptor, const boost::bgl_named_params&, boost::param_not_found) [with Graph = boost::adjacency_list > > > >; P = int; T = boost::buffer_param_t; R = boost::no_property; typename boost::detail::edge_capacity_value::type = double; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/edmonds_karp_max_flow.hpp:228:57: required from ‘typename boost::detail::edge_capacity_value::type boost::edmonds_karp_max_flow(Graph&, typename graph_traits::vertex_descriptor, typename graph_traits::vertex_descriptor, const bgl_named_params&) [with Graph = adjacency_list > > > >; P = int; T = buffer_param_t; R = no_property; typename detail::edge_capacity_value::type = double; typename graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/edmonds_karp_max_flow.hpp:240:33: required from ‘typename boost::property_traits::const_type>::value_type boost::edmonds_karp_max_flow(Graph&, typename graph_traits::vertex_descriptor, typename graph_traits::vertex_descriptor) [with Graph = adjacency_list > > > >; typename property_traits::const_type>::value_type = double; typename property_map::const_type = adj_list_edge_property_map > > >, edge_capacity_t>; typename graph_traits::vertex_descriptor = long unsigned int]’ mincut.cpp:76:45: required from here /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::RandomAccessIterator<__gnu_cxx::__normal_iterator*, std::vector, std::allocator > > > >]’ 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ^ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator*, std::vector, std::allocator > > > >]’: /home/omnipath/local/R/4.4-3.20/BH/include/boost/property_map/property_map.hpp:354:5: required from ‘boost::iterator_property_map boost::make_iterator_property_map(RAIter, ID, Value) [with RAIter = __gnu_cxx::__normal_iterator*, std::vector, std::allocator > > >; Value = detail::edge_desc_impl; ID = vec_adj_list_vertex_id_map]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/edmonds_karp_max_flow.hpp:209:43: required from ‘static typename boost::detail::edge_capacity_value::type boost::detail::edmonds_karp_dispatch1::apply(Graph&, typename boost::graph_traits::vertex_descriptor, typename boost::graph_traits::vertex_descriptor, const boost::bgl_named_params&, boost::param_not_found) [with Graph = boost::adjacency_list > > > >; P = int; T = boost::buffer_param_t; R = boost::no_property; typename boost::detail::edge_capacity_value::type = double; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/edmonds_karp_max_flow.hpp:228:57: required from ‘typename boost::detail::edge_capacity_value::type boost::edmonds_karp_max_flow(Graph&, typename graph_traits::vertex_descriptor, typename graph_traits::vertex_descriptor, const bgl_named_params&) [with Graph = adjacency_list > > > >; P = int; T = buffer_param_t; R = no_property; typename detail::edge_capacity_value::type = double; typename graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/edmonds_karp_max_flow.hpp:240:33: required from ‘typename boost::property_traits::const_type>::value_type boost::edmonds_karp_max_flow(Graph&, typename graph_traits::vertex_descriptor, typename graph_traits::vertex_descriptor) [with Graph = adjacency_list > > > >; typename property_traits::const_type>::value_type = double; typename property_map::const_type = adj_list_edge_property_map > > >, edge_capacity_t>; typename graph_traits::vertex_descriptor = long unsigned int]’ mincut.cpp:76:45: required from here /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ In file included from /home/omnipath/local/R/4.4-3.20/BH/include/boost/preprocessor/repetition/enum_binary_params.hpp:15, from /home/omnipath/local/R/4.4-3.20/BH/include/boost/utility/base_from_member.hpp:15, from /home/omnipath/local/R/4.4-3.20/BH/include/boost/utility.hpp:15, from RBGL.hpp:16: /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:597:17: note: in a call to non-static member function ‘boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator*, std::vector, std::allocator > > > >::~RandomAccessIteratorConcept()’ 597 | BOOST_concept(RandomAccessIterator,(TT)) | ^~~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/preprocessor/cat.hpp:29:34: note: in definition of macro ‘BOOST_PP_CAT_I’ 29 | # define BOOST_PP_CAT_I(a, b) a ## b | ^ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/concept_def.hpp:23:12: note: in expansion of macro ‘BOOST_PP_CAT’ 23 | struct BOOST_PP_CAT(name,Concept) \ | ^~~~~~~~~~~~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:597:3: note: in expansion of macro ‘BOOST_concept’ 597 | BOOST_concept(RandomAccessIterator,(TT)) | ^~~~~~~~~~~~~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::Assignable<__gnu_cxx::__normal_iterator*, std::vector, std::allocator > > > >]’: /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements*, std::vector, std::allocator > > > > >]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:145:5: required from ‘struct boost::Assignable<__gnu_cxx::__normal_iterator*, std::vector, std::allocator > > > >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:502:3: required from ‘struct boost::InputIterator<__gnu_cxx::__normal_iterator*, std::vector, std::allocator > > > >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:540:3: required from ‘struct boost::ForwardIterator<__gnu_cxx::__normal_iterator*, std::vector, std::allocator > > > >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:568:3: required from ‘struct boost::BidirectionalIterator<__gnu_cxx::__normal_iterator*, std::vector, std::allocator > > > >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:597:3: [ skipping 5 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_*, std::vector, std::allocator > > > >)>’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/property_map/property_map.hpp:354:5: required from ‘boost::iterator_property_map boost::make_iterator_property_map(RAIter, ID, Value) [with RAIter = __gnu_cxx::__normal_iterator*, std::vector, std::allocator > > >; Value = detail::edge_desc_impl; ID = vec_adj_list_vertex_id_map]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/edmonds_karp_max_flow.hpp:209:43: required from ‘static typename boost::detail::edge_capacity_value::type boost::detail::edmonds_karp_dispatch1::apply(Graph&, typename boost::graph_traits::vertex_descriptor, typename boost::graph_traits::vertex_descriptor, const boost::bgl_named_params&, boost::param_not_found) [with Graph = boost::adjacency_list > > > >; P = int; T = boost::buffer_param_t; R = boost::no_property; typename boost::detail::edge_capacity_value::type = double; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/edmonds_karp_max_flow.hpp:228:57: required from ‘typename boost::detail::edge_capacity_value::type boost::edmonds_karp_max_flow(Graph&, typename graph_traits::vertex_descriptor, typename graph_traits::vertex_descriptor, const bgl_named_params&) [with Graph = adjacency_list > > > >; P = int; T = buffer_param_t; R = no_property; typename detail::edge_capacity_value::type = double; typename graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/edmonds_karp_max_flow.hpp:240:33: required from ‘typename boost::property_traits::const_type>::value_type boost::edmonds_karp_max_flow(Graph&, typename graph_traits::vertex_descriptor, typename graph_traits::vertex_descriptor) [with Graph = adjacency_list > > > >; typename property_traits::const_type>::value_type = double; typename property_map::const_type = adj_list_edge_property_map > > >, edge_capacity_t>; typename graph_traits::vertex_descriptor = long unsigned int]’ mincut.cpp:76:45: required from here /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::Assignable::~Assignable() [with TT = __gnu_cxx::__normal_iterator*, std::vector, std::allocator > > >]’ 37 | ~model() | ^ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:145:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 145 | BOOST_CONCEPT_USAGE(Assignable) { | ^~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::EqualityComparable<__gnu_cxx::__normal_iterator*, std::vector, std::allocator > > > >]’: /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements*, std::vector, std::allocator > > > > >]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:233:5: required from ‘struct boost::EqualityComparable<__gnu_cxx::__normal_iterator*, std::vector, std::allocator > > > >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:502:3: required from ‘struct boost::InputIterator<__gnu_cxx::__normal_iterator*, std::vector, std::allocator > > > >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:540:3: required from ‘struct boost::ForwardIterator<__gnu_cxx::__normal_iterator*, std::vector, std::allocator > > > >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:568:3: required from ‘struct boost::BidirectionalIterator<__gnu_cxx::__normal_iterator*, std::vector, std::allocator > > > >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:597:3: [ skipping 5 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_*, std::vector, std::allocator > > > >)>’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/property_map/property_map.hpp:354:5: required from ‘boost::iterator_property_map boost::make_iterator_property_map(RAIter, ID, Value) [with RAIter = __gnu_cxx::__normal_iterator*, std::vector, std::allocator > > >; Value = detail::edge_desc_impl; ID = vec_adj_list_vertex_id_map]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/edmonds_karp_max_flow.hpp:209:43: required from ‘static typename boost::detail::edge_capacity_value::type boost::detail::edmonds_karp_dispatch1::apply(Graph&, typename boost::graph_traits::vertex_descriptor, typename boost::graph_traits::vertex_descriptor, const boost::bgl_named_params&, boost::param_not_found) [with Graph = boost::adjacency_list > > > >; P = int; T = boost::buffer_param_t; R = boost::no_property; typename boost::detail::edge_capacity_value::type = double; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/edmonds_karp_max_flow.hpp:228:57: required from ‘typename boost::detail::edge_capacity_value::type boost::edmonds_karp_max_flow(Graph&, typename graph_traits::vertex_descriptor, typename graph_traits::vertex_descriptor, const bgl_named_params&) [with Graph = adjacency_list > > > >; P = int; T = buffer_param_t; R = no_property; typename detail::edge_capacity_value::type = double; typename graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/edmonds_karp_max_flow.hpp:240:33: required from ‘typename boost::property_traits::const_type>::value_type boost::edmonds_karp_max_flow(Graph&, typename graph_traits::vertex_descriptor, typename graph_traits::vertex_descriptor) [with Graph = adjacency_list > > > >; typename property_traits::const_type>::value_type = double; typename property_map::const_type = adj_list_edge_property_map > > >, edge_capacity_t>; typename graph_traits::vertex_descriptor = long unsigned int]’ mincut.cpp:76:45: required from here /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::EqualityComparable::~EqualityComparable() [with TT = __gnu_cxx::__normal_iterator*, std::vector, std::allocator > > >]’ 37 | ~model() | ^ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:233:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 233 | BOOST_CONCEPT_USAGE(EqualityComparable) { | ^~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::InputIterator<__gnu_cxx::__normal_iterator*, std::vector, std::allocator > > > >]’: /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements*, std::vector, std::allocator > > > > >]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:512:7: required from ‘struct boost::InputIterator<__gnu_cxx::__normal_iterator*, std::vector, std::allocator > > > >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:540:3: required from ‘struct boost::ForwardIterator<__gnu_cxx::__normal_iterator*, std::vector, std::allocator > > > >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:568:3: required from ‘struct boost::BidirectionalIterator<__gnu_cxx::__normal_iterator*, std::vector, std::allocator > > > >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:597:3: required from ‘struct boost::RandomAccessIterator<__gnu_cxx::__normal_iterator*, std::vector, std::allocator > > > >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:597:3: [ skipping 4 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_*, std::vector, std::allocator > > > >)>’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/property_map/property_map.hpp:354:5: required from ‘boost::iterator_property_map boost::make_iterator_property_map(RAIter, ID, Value) [with RAIter = __gnu_cxx::__normal_iterator*, std::vector, std::allocator > > >; Value = detail::edge_desc_impl; ID = vec_adj_list_vertex_id_map]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/edmonds_karp_max_flow.hpp:209:43: required from ‘static typename boost::detail::edge_capacity_value::type boost::detail::edmonds_karp_dispatch1::apply(Graph&, typename boost::graph_traits::vertex_descriptor, typename boost::graph_traits::vertex_descriptor, const boost::bgl_named_params&, boost::param_not_found) [with Graph = boost::adjacency_list > > > >; P = int; T = boost::buffer_param_t; R = boost::no_property; typename boost::detail::edge_capacity_value::type = double; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/edmonds_karp_max_flow.hpp:228:57: required from ‘typename boost::detail::edge_capacity_value::type boost::edmonds_karp_max_flow(Graph&, typename graph_traits::vertex_descriptor, typename graph_traits::vertex_descriptor, const bgl_named_params&) [with Graph = adjacency_list > > > >; P = int; T = buffer_param_t; R = no_property; typename detail::edge_capacity_value::type = double; typename graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/edmonds_karp_max_flow.hpp:240:33: required from ‘typename boost::property_traits::const_type>::value_type boost::edmonds_karp_max_flow(Graph&, typename graph_traits::vertex_descriptor, typename graph_traits::vertex_descriptor) [with Graph = adjacency_list > > > >; typename property_traits::const_type>::value_type = double; typename property_map::const_type = adj_list_edge_property_map > > >, edge_capacity_t>; typename graph_traits::vertex_descriptor = long unsigned int]’ mincut.cpp:76:45: required from here /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::InputIterator::~InputIterator() [with TT = __gnu_cxx::__normal_iterator*, std::vector, std::allocator > > >]’ 37 | ~model() | ^ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:512:7: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 512 | BOOST_CONCEPT_USAGE(InputIterator) | ^~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::ForwardIterator<__gnu_cxx::__normal_iterator*, std::vector, std::allocator > > > >]’: /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements*, std::vector, std::allocator > > > > >]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:543:7: required from ‘struct boost::ForwardIterator<__gnu_cxx::__normal_iterator*, std::vector, std::allocator > > > >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:568:3: required from ‘struct boost::BidirectionalIterator<__gnu_cxx::__normal_iterator*, std::vector, std::allocator > > > >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:597:3: required from ‘struct boost::RandomAccessIterator<__gnu_cxx::__normal_iterator*, std::vector, std::allocator > > > >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:597:3: required from ‘struct boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator*, std::vector, std::allocator > > > >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:32:62: [ skipping 3 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_*, std::vector, std::allocator > > > >)>’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/property_map/property_map.hpp:354:5: required from ‘boost::iterator_property_map boost::make_iterator_property_map(RAIter, ID, Value) [with RAIter = __gnu_cxx::__normal_iterator*, std::vector, std::allocator > > >; Value = detail::edge_desc_impl; ID = vec_adj_list_vertex_id_map]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/edmonds_karp_max_flow.hpp:209:43: required from ‘static typename boost::detail::edge_capacity_value::type boost::detail::edmonds_karp_dispatch1::apply(Graph&, typename boost::graph_traits::vertex_descriptor, typename boost::graph_traits::vertex_descriptor, const boost::bgl_named_params&, boost::param_not_found) [with Graph = boost::adjacency_list > > > >; P = int; T = boost::buffer_param_t; R = boost::no_property; typename boost::detail::edge_capacity_value::type = double; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/edmonds_karp_max_flow.hpp:228:57: required from ‘typename boost::detail::edge_capacity_value::type boost::edmonds_karp_max_flow(Graph&, typename graph_traits::vertex_descriptor, typename graph_traits::vertex_descriptor, const bgl_named_params&) [with Graph = adjacency_list > > > >; P = int; T = buffer_param_t; R = no_property; typename detail::edge_capacity_value::type = double; typename graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/edmonds_karp_max_flow.hpp:240:33: required from ‘typename boost::property_traits::const_type>::value_type boost::edmonds_karp_max_flow(Graph&, typename graph_traits::vertex_descriptor, typename graph_traits::vertex_descriptor) [with Graph = adjacency_list > > > >; typename property_traits::const_type>::value_type = double; typename property_map::const_type = adj_list_edge_property_map > > >, edge_capacity_t>; typename graph_traits::vertex_descriptor = long unsigned int]’ mincut.cpp:76:45: required from here /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::ForwardIterator::~ForwardIterator() [with TT = __gnu_cxx::__normal_iterator*, std::vector, std::allocator > > >]’ 37 | ~model() | ^ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:543:7: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 543 | BOOST_CONCEPT_USAGE(ForwardIterator) | ^~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::BidirectionalIterator<__gnu_cxx::__normal_iterator*, std::vector, std::allocator > > > >]’: /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements*, std::vector, std::allocator > > > > >]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:571:7: required from ‘struct boost::BidirectionalIterator<__gnu_cxx::__normal_iterator*, std::vector, std::allocator > > > >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:597:3: required from ‘struct boost::RandomAccessIterator<__gnu_cxx::__normal_iterator*, std::vector, std::allocator > > > >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:597:3: required from ‘struct boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator*, std::vector, std::allocator > > > >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator*, std::vector, std::allocator > > > >]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:42:5: [ skipping 2 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_*, std::vector, std::allocator > > > >)>’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/property_map/property_map.hpp:354:5: required from ‘boost::iterator_property_map boost::make_iterator_property_map(RAIter, ID, Value) [with RAIter = __gnu_cxx::__normal_iterator*, std::vector, std::allocator > > >; Value = detail::edge_desc_impl; ID = vec_adj_list_vertex_id_map]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/edmonds_karp_max_flow.hpp:209:43: required from ‘static typename boost::detail::edge_capacity_value::type boost::detail::edmonds_karp_dispatch1::apply(Graph&, typename boost::graph_traits::vertex_descriptor, typename boost::graph_traits::vertex_descriptor, const boost::bgl_named_params&, boost::param_not_found) [with Graph = boost::adjacency_list > > > >; P = int; T = boost::buffer_param_t; R = boost::no_property; typename boost::detail::edge_capacity_value::type = double; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/edmonds_karp_max_flow.hpp:228:57: required from ‘typename boost::detail::edge_capacity_value::type boost::edmonds_karp_max_flow(Graph&, typename graph_traits::vertex_descriptor, typename graph_traits::vertex_descriptor, const bgl_named_params&) [with Graph = adjacency_list > > > >; P = int; T = buffer_param_t; R = no_property; typename detail::edge_capacity_value::type = double; typename graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/edmonds_karp_max_flow.hpp:240:33: required from ‘typename boost::property_traits::const_type>::value_type boost::edmonds_karp_max_flow(Graph&, typename graph_traits::vertex_descriptor, typename graph_traits::vertex_descriptor) [with Graph = adjacency_list > > > >; typename property_traits::const_type>::value_type = double; typename property_map::const_type = adj_list_edge_property_map > > >, edge_capacity_t>; typename graph_traits::vertex_descriptor = long unsigned int]’ mincut.cpp:76:45: required from here /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::BidirectionalIterator::~BidirectionalIterator() [with TT = __gnu_cxx::__normal_iterator*, std::vector, std::allocator > > >]’ 37 | ~model() | ^ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:571:7: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 571 | BOOST_CONCEPT_USAGE(BidirectionalIterator) | ^~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::Comparable<__gnu_cxx::__normal_iterator*, std::vector, std::allocator > > > >]’: /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements*, std::vector, std::allocator > > > > >]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:253:5: required from ‘struct boost::Comparable<__gnu_cxx::__normal_iterator*, std::vector, std::allocator > > > >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:597:3: required from ‘struct boost::RandomAccessIterator<__gnu_cxx::__normal_iterator*, std::vector, std::allocator > > > >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:597:3: required from ‘struct boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator*, std::vector, std::allocator > > > >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator*, std::vector, std::allocator > > > >]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:42:5: [ skipping 2 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_*, std::vector, std::allocator > > > >)>’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/property_map/property_map.hpp:354:5: required from ‘boost::iterator_property_map boost::make_iterator_property_map(RAIter, ID, Value) [with RAIter = __gnu_cxx::__normal_iterator*, std::vector, std::allocator > > >; Value = detail::edge_desc_impl; ID = vec_adj_list_vertex_id_map]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/edmonds_karp_max_flow.hpp:209:43: required from ‘static typename boost::detail::edge_capacity_value::type boost::detail::edmonds_karp_dispatch1::apply(Graph&, typename boost::graph_traits::vertex_descriptor, typename boost::graph_traits::vertex_descriptor, const boost::bgl_named_params&, boost::param_not_found) [with Graph = boost::adjacency_list > > > >; P = int; T = boost::buffer_param_t; R = boost::no_property; typename boost::detail::edge_capacity_value::type = double; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/edmonds_karp_max_flow.hpp:228:57: required from ‘typename boost::detail::edge_capacity_value::type boost::edmonds_karp_max_flow(Graph&, typename graph_traits::vertex_descriptor, typename graph_traits::vertex_descriptor, const bgl_named_params&) [with Graph = adjacency_list > > > >; P = int; T = buffer_param_t; R = no_property; typename detail::edge_capacity_value::type = double; typename graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/edmonds_karp_max_flow.hpp:240:33: required from ‘typename boost::property_traits::const_type>::value_type boost::edmonds_karp_max_flow(Graph&, typename graph_traits::vertex_descriptor, typename graph_traits::vertex_descriptor) [with Graph = adjacency_list > > > >; typename property_traits::const_type>::value_type = double; typename property_map::const_type = adj_list_edge_property_map > > >, edge_capacity_t>; typename graph_traits::vertex_descriptor = long unsigned int]’ mincut.cpp:76:45: required from here /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::Comparable::~Comparable() [with TT = __gnu_cxx::__normal_iterator*, std::vector, std::allocator > > >]’ 37 | ~model() | ^ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:253:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 253 | BOOST_CONCEPT_USAGE(Comparable) { | ^~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::RandomAccessIterator<__gnu_cxx::__normal_iterator*, std::vector, std::allocator > > > >]’: /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements*, std::vector, std::allocator > > > > >]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:601:7: required from ‘struct boost::RandomAccessIterator<__gnu_cxx::__normal_iterator*, std::vector, std::allocator > > > >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:597:3: required from ‘struct boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator*, std::vector, std::allocator > > > >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator*, std::vector, std::allocator > > > >]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:42:5: [ skipping 2 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_*, std::vector, std::allocator > > > >)>’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/property_map/property_map.hpp:354:5: required from ‘boost::iterator_property_map boost::make_iterator_property_map(RAIter, ID, Value) [with RAIter = __gnu_cxx::__normal_iterator*, std::vector, std::allocator > > >; Value = detail::edge_desc_impl; ID = vec_adj_list_vertex_id_map]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/edmonds_karp_max_flow.hpp:209:43: required from ‘static typename boost::detail::edge_capacity_value::type boost::detail::edmonds_karp_dispatch1::apply(Graph&, typename boost::graph_traits::vertex_descriptor, typename boost::graph_traits::vertex_descriptor, const boost::bgl_named_params&, boost::param_not_found) [with Graph = boost::adjacency_list > > > >; P = int; T = boost::buffer_param_t; R = boost::no_property; typename boost::detail::edge_capacity_value::type = double; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/edmonds_karp_max_flow.hpp:228:57: required from ‘typename boost::detail::edge_capacity_value::type boost::edmonds_karp_max_flow(Graph&, typename graph_traits::vertex_descriptor, typename graph_traits::vertex_descriptor, const bgl_named_params&) [with Graph = adjacency_list > > > >; P = int; T = buffer_param_t; R = no_property; typename detail::edge_capacity_value::type = double; typename graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/edmonds_karp_max_flow.hpp:240:33: required from ‘typename boost::property_traits::const_type>::value_type boost::edmonds_karp_max_flow(Graph&, typename graph_traits::vertex_descriptor, typename graph_traits::vertex_descriptor) [with Graph = adjacency_list > > > >; typename property_traits::const_type>::value_type = double; typename property_map::const_type = adj_list_edge_property_map > > >, edge_capacity_t>; typename graph_traits::vertex_descriptor = long unsigned int]’ mincut.cpp:76:45: required from here /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::RandomAccessIterator::~RandomAccessIterator() [with TT = __gnu_cxx::__normal_iterator*, std::vector, std::allocator > > >]’ 37 | ~model() | ^ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:601:7: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 601 | BOOST_CONCEPT_USAGE(RandomAccessIterator) | ^~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements > > >]’: /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:145:5: required from ‘struct boost::Assignable<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:502:3: required from ‘struct boost::InputIterator<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:540:3: required from ‘struct boost::ForwardIterator<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:568:3: required from ‘struct boost::BidirectionalIterator<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:597:3: required from ‘struct boost::RandomAccessIterator<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:597:3: [ skipping 5 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.4-3.20/BH/include/boost/property_map/property_map.hpp:354:5: required from ‘boost::iterator_property_map boost::make_iterator_property_map(RAIter, ID, Value) [with RAIter = __gnu_cxx::__normal_iterator >; Value = default_color_type; ID = vec_adj_list_vertex_id_map]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/edmonds_karp_max_flow.hpp:161:43: required from ‘static typename boost::detail::edge_capacity_value::type boost::detail::edmonds_karp_dispatch2::apply(Graph&, typename boost::graph_traits::vertex_descriptor, typename boost::graph_traits::vertex_descriptor, PredMap, const boost::bgl_named_params&, boost::param_not_found) [with Graph = boost::adjacency_list > > > >; PredMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator*, std::vector, std::allocator > > >, boost::vec_adj_list_vertex_id_map, boost::detail::edge_desc_impl, boost::detail::edge_desc_impl&>; P = int; T = boost::buffer_param_t; R = boost::no_property; typename boost::detail::edge_capacity_value::type = double; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/edmonds_karp_max_flow.hpp:208:54: required from ‘static typename boost::detail::edge_capacity_value::type boost::detail::edmonds_karp_dispatch1::apply(Graph&, typename boost::graph_traits::vertex_descriptor, typename boost::graph_traits::vertex_descriptor, const boost::bgl_named_params&, boost::param_not_found) [with Graph = boost::adjacency_list > > > >; P = int; T = boost::buffer_param_t; R = boost::no_property; typename boost::detail::edge_capacity_value::type = double; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/edmonds_karp_max_flow.hpp:228:57: required from ‘typename boost::detail::edge_capacity_value::type boost::edmonds_karp_max_flow(Graph&, typename graph_traits::vertex_descriptor, typename graph_traits::vertex_descriptor, const bgl_named_params&) [with Graph = adjacency_list > > > >; P = int; T = buffer_param_t; R = no_property; typename detail::edge_capacity_value::type = double; typename graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/edmonds_karp_max_flow.hpp:240:33: required from ‘typename boost::property_traits::const_type>::value_type boost::edmonds_karp_max_flow(Graph&, typename graph_traits::vertex_descriptor, typename graph_traits::vertex_descriptor) [with Graph = adjacency_list > > > >; typename property_traits::const_type>::value_type = double; typename property_map::const_type = adj_list_edge_property_map > > >, edge_capacity_t>; typename graph_traits::vertex_descriptor = long unsigned int]’ mincut.cpp:76:45: required from here /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::Assignable<__gnu_cxx::__normal_iterator > >]’ 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ^ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements > > >]’: /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:233:5: required from ‘struct boost::EqualityComparable<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:502:3: required from ‘struct boost::InputIterator<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:540:3: required from ‘struct boost::ForwardIterator<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:568:3: required from ‘struct boost::BidirectionalIterator<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:597:3: required from ‘struct boost::RandomAccessIterator<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:597:3: [ skipping 5 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.4-3.20/BH/include/boost/property_map/property_map.hpp:354:5: required from ‘boost::iterator_property_map boost::make_iterator_property_map(RAIter, ID, Value) [with RAIter = __gnu_cxx::__normal_iterator >; Value = default_color_type; ID = vec_adj_list_vertex_id_map]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/edmonds_karp_max_flow.hpp:161:43: required from ‘static typename boost::detail::edge_capacity_value::type boost::detail::edmonds_karp_dispatch2::apply(Graph&, typename boost::graph_traits::vertex_descriptor, typename boost::graph_traits::vertex_descriptor, PredMap, const boost::bgl_named_params&, boost::param_not_found) [with Graph = boost::adjacency_list > > > >; PredMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator*, std::vector, std::allocator > > >, boost::vec_adj_list_vertex_id_map, boost::detail::edge_desc_impl, boost::detail::edge_desc_impl&>; P = int; T = boost::buffer_param_t; R = boost::no_property; typename boost::detail::edge_capacity_value::type = double; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/edmonds_karp_max_flow.hpp:208:54: required from ‘static typename boost::detail::edge_capacity_value::type boost::detail::edmonds_karp_dispatch1::apply(Graph&, typename boost::graph_traits::vertex_descriptor, typename boost::graph_traits::vertex_descriptor, const boost::bgl_named_params&, boost::param_not_found) [with Graph = boost::adjacency_list > > > >; P = int; T = boost::buffer_param_t; R = boost::no_property; typename boost::detail::edge_capacity_value::type = double; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/edmonds_karp_max_flow.hpp:228:57: required from ‘typename boost::detail::edge_capacity_value::type boost::edmonds_karp_max_flow(Graph&, typename graph_traits::vertex_descriptor, typename graph_traits::vertex_descriptor, const bgl_named_params&) [with Graph = adjacency_list > > > >; P = int; T = buffer_param_t; R = no_property; typename detail::edge_capacity_value::type = double; typename graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/edmonds_karp_max_flow.hpp:240:33: required from ‘typename boost::property_traits::const_type>::value_type boost::edmonds_karp_max_flow(Graph&, typename graph_traits::vertex_descriptor, typename graph_traits::vertex_descriptor) [with Graph = adjacency_list > > > >; typename property_traits::const_type>::value_type = double; typename property_map::const_type = adj_list_edge_property_map > > >, edge_capacity_t>; typename graph_traits::vertex_descriptor = long unsigned int]’ mincut.cpp:76:45: required from here /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::EqualityComparable<__gnu_cxx::__normal_iterator > >]’ 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ^ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements > > >]’: /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:512:7: required from ‘struct boost::InputIterator<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:540:3: required from ‘struct boost::ForwardIterator<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:568:3: required from ‘struct boost::BidirectionalIterator<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:597:3: required from ‘struct boost::RandomAccessIterator<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:597:3: required from ‘struct boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:32:62: [ skipping 4 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.4-3.20/BH/include/boost/property_map/property_map.hpp:354:5: required from ‘boost::iterator_property_map boost::make_iterator_property_map(RAIter, ID, Value) [with RAIter = __gnu_cxx::__normal_iterator >; Value = default_color_type; ID = vec_adj_list_vertex_id_map]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/edmonds_karp_max_flow.hpp:161:43: required from ‘static typename boost::detail::edge_capacity_value::type boost::detail::edmonds_karp_dispatch2::apply(Graph&, typename boost::graph_traits::vertex_descriptor, typename boost::graph_traits::vertex_descriptor, PredMap, const boost::bgl_named_params&, boost::param_not_found) [with Graph = boost::adjacency_list > > > >; PredMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator*, std::vector, std::allocator > > >, boost::vec_adj_list_vertex_id_map, boost::detail::edge_desc_impl, boost::detail::edge_desc_impl&>; P = int; T = boost::buffer_param_t; R = boost::no_property; typename boost::detail::edge_capacity_value::type = double; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/edmonds_karp_max_flow.hpp:208:54: required from ‘static typename boost::detail::edge_capacity_value::type boost::detail::edmonds_karp_dispatch1::apply(Graph&, typename boost::graph_traits::vertex_descriptor, typename boost::graph_traits::vertex_descriptor, const boost::bgl_named_params&, boost::param_not_found) [with Graph = boost::adjacency_list > > > >; P = int; T = boost::buffer_param_t; R = boost::no_property; typename boost::detail::edge_capacity_value::type = double; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/edmonds_karp_max_flow.hpp:228:57: required from ‘typename boost::detail::edge_capacity_value::type boost::edmonds_karp_max_flow(Graph&, typename graph_traits::vertex_descriptor, typename graph_traits::vertex_descriptor, const bgl_named_params&) [with Graph = adjacency_list > > > >; P = int; T = buffer_param_t; R = no_property; typename detail::edge_capacity_value::type = double; typename graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/edmonds_karp_max_flow.hpp:240:33: required from ‘typename boost::property_traits::const_type>::value_type boost::edmonds_karp_max_flow(Graph&, typename graph_traits::vertex_descriptor, typename graph_traits::vertex_descriptor) [with Graph = adjacency_list > > > >; typename property_traits::const_type>::value_type = double; typename property_map::const_type = adj_list_edge_property_map > > >, edge_capacity_t>; typename graph_traits::vertex_descriptor = long unsigned int]’ mincut.cpp:76:45: required from here /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::InputIterator<__gnu_cxx::__normal_iterator > >]’ 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ^ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements > > >]’: /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:543:7: required from ‘struct boost::ForwardIterator<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:568:3: required from ‘struct boost::BidirectionalIterator<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:597:3: required from ‘struct boost::RandomAccessIterator<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:597:3: required from ‘struct boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator > >]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:42:5: [ skipping 3 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.4-3.20/BH/include/boost/property_map/property_map.hpp:354:5: required from ‘boost::iterator_property_map boost::make_iterator_property_map(RAIter, ID, Value) [with RAIter = __gnu_cxx::__normal_iterator >; Value = default_color_type; ID = vec_adj_list_vertex_id_map]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/edmonds_karp_max_flow.hpp:161:43: required from ‘static typename boost::detail::edge_capacity_value::type boost::detail::edmonds_karp_dispatch2::apply(Graph&, typename boost::graph_traits::vertex_descriptor, typename boost::graph_traits::vertex_descriptor, PredMap, const boost::bgl_named_params&, boost::param_not_found) [with Graph = boost::adjacency_list > > > >; PredMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator*, std::vector, std::allocator > > >, boost::vec_adj_list_vertex_id_map, boost::detail::edge_desc_impl, boost::detail::edge_desc_impl&>; P = int; T = boost::buffer_param_t; R = boost::no_property; typename boost::detail::edge_capacity_value::type = double; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/edmonds_karp_max_flow.hpp:208:54: required from ‘static typename boost::detail::edge_capacity_value::type boost::detail::edmonds_karp_dispatch1::apply(Graph&, typename boost::graph_traits::vertex_descriptor, typename boost::graph_traits::vertex_descriptor, const boost::bgl_named_params&, boost::param_not_found) [with Graph = boost::adjacency_list > > > >; P = int; T = boost::buffer_param_t; R = boost::no_property; typename boost::detail::edge_capacity_value::type = double; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/edmonds_karp_max_flow.hpp:228:57: required from ‘typename boost::detail::edge_capacity_value::type boost::edmonds_karp_max_flow(Graph&, typename graph_traits::vertex_descriptor, typename graph_traits::vertex_descriptor, const bgl_named_params&) [with Graph = adjacency_list > > > >; P = int; T = buffer_param_t; R = no_property; typename detail::edge_capacity_value::type = double; typename graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/edmonds_karp_max_flow.hpp:240:33: required from ‘typename boost::property_traits::const_type>::value_type boost::edmonds_karp_max_flow(Graph&, typename graph_traits::vertex_descriptor, typename graph_traits::vertex_descriptor) [with Graph = adjacency_list > > > >; typename property_traits::const_type>::value_type = double; typename property_map::const_type = adj_list_edge_property_map > > >, edge_capacity_t>; typename graph_traits::vertex_descriptor = long unsigned int]’ mincut.cpp:76:45: required from here /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::ForwardIterator<__gnu_cxx::__normal_iterator > >]’ 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ^ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements > > >]’: /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:571:7: required from ‘struct boost::BidirectionalIterator<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:597:3: required from ‘struct boost::RandomAccessIterator<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:597:3: required from ‘struct boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator > >]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied > > >::value’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:45:51: [ skipping 2 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.4-3.20/BH/include/boost/property_map/property_map.hpp:354:5: required from ‘boost::iterator_property_map boost::make_iterator_property_map(RAIter, ID, Value) [with RAIter = __gnu_cxx::__normal_iterator >; Value = default_color_type; ID = vec_adj_list_vertex_id_map]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/edmonds_karp_max_flow.hpp:161:43: required from ‘static typename boost::detail::edge_capacity_value::type boost::detail::edmonds_karp_dispatch2::apply(Graph&, typename boost::graph_traits::vertex_descriptor, typename boost::graph_traits::vertex_descriptor, PredMap, const boost::bgl_named_params&, boost::param_not_found) [with Graph = boost::adjacency_list > > > >; PredMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator*, std::vector, std::allocator > > >, boost::vec_adj_list_vertex_id_map, boost::detail::edge_desc_impl, boost::detail::edge_desc_impl&>; P = int; T = boost::buffer_param_t; R = boost::no_property; typename boost::detail::edge_capacity_value::type = double; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/edmonds_karp_max_flow.hpp:208:54: required from ‘static typename boost::detail::edge_capacity_value::type boost::detail::edmonds_karp_dispatch1::apply(Graph&, typename boost::graph_traits::vertex_descriptor, typename boost::graph_traits::vertex_descriptor, const boost::bgl_named_params&, boost::param_not_found) [with Graph = boost::adjacency_list > > > >; P = int; T = boost::buffer_param_t; R = boost::no_property; typename boost::detail::edge_capacity_value::type = double; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/edmonds_karp_max_flow.hpp:228:57: required from ‘typename boost::detail::edge_capacity_value::type boost::edmonds_karp_max_flow(Graph&, typename graph_traits::vertex_descriptor, typename graph_traits::vertex_descriptor, const bgl_named_params&) [with Graph = adjacency_list > > > >; P = int; T = buffer_param_t; R = no_property; typename detail::edge_capacity_value::type = double; typename graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/edmonds_karp_max_flow.hpp:240:33: required from ‘typename boost::property_traits::const_type>::value_type boost::edmonds_karp_max_flow(Graph&, typename graph_traits::vertex_descriptor, typename graph_traits::vertex_descriptor) [with Graph = adjacency_list > > > >; typename property_traits::const_type>::value_type = double; typename property_map::const_type = adj_list_edge_property_map > > >, edge_capacity_t>; typename graph_traits::vertex_descriptor = long unsigned int]’ mincut.cpp:76:45: required from here /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::BidirectionalIterator<__gnu_cxx::__normal_iterator > >]’ 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ^ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements > > >]’: /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:253:5: required from ‘struct boost::Comparable<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:597:3: required from ‘struct boost::RandomAccessIterator<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:597:3: required from ‘struct boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator > >]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied > > >::value’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:45:51: [ skipping 2 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.4-3.20/BH/include/boost/property_map/property_map.hpp:354:5: required from ‘boost::iterator_property_map boost::make_iterator_property_map(RAIter, ID, Value) [with RAIter = __gnu_cxx::__normal_iterator >; Value = default_color_type; ID = vec_adj_list_vertex_id_map]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/edmonds_karp_max_flow.hpp:161:43: required from ‘static typename boost::detail::edge_capacity_value::type boost::detail::edmonds_karp_dispatch2::apply(Graph&, typename boost::graph_traits::vertex_descriptor, typename boost::graph_traits::vertex_descriptor, PredMap, const boost::bgl_named_params&, boost::param_not_found) [with Graph = boost::adjacency_list > > > >; PredMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator*, std::vector, std::allocator > > >, boost::vec_adj_list_vertex_id_map, boost::detail::edge_desc_impl, boost::detail::edge_desc_impl&>; P = int; T = boost::buffer_param_t; R = boost::no_property; typename boost::detail::edge_capacity_value::type = double; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/edmonds_karp_max_flow.hpp:208:54: required from ‘static typename boost::detail::edge_capacity_value::type boost::detail::edmonds_karp_dispatch1::apply(Graph&, typename boost::graph_traits::vertex_descriptor, typename boost::graph_traits::vertex_descriptor, const boost::bgl_named_params&, boost::param_not_found) [with Graph = boost::adjacency_list > > > >; P = int; T = boost::buffer_param_t; R = boost::no_property; typename boost::detail::edge_capacity_value::type = double; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/edmonds_karp_max_flow.hpp:228:57: required from ‘typename boost::detail::edge_capacity_value::type boost::edmonds_karp_max_flow(Graph&, typename graph_traits::vertex_descriptor, typename graph_traits::vertex_descriptor, const bgl_named_params&) [with Graph = adjacency_list > > > >; P = int; T = buffer_param_t; R = no_property; typename detail::edge_capacity_value::type = double; typename graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/edmonds_karp_max_flow.hpp:240:33: required from ‘typename boost::property_traits::const_type>::value_type boost::edmonds_karp_max_flow(Graph&, typename graph_traits::vertex_descriptor, typename graph_traits::vertex_descriptor) [with Graph = adjacency_list > > > >; typename property_traits::const_type>::value_type = double; typename property_map::const_type = adj_list_edge_property_map > > >, edge_capacity_t>; typename graph_traits::vertex_descriptor = long unsigned int]’ mincut.cpp:76:45: required from here /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::Comparable<__gnu_cxx::__normal_iterator > >]’ 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ^ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements > > >]’: /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:601:7: required from ‘struct boost::RandomAccessIterator<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:597:3: required from ‘struct boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator > >]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied > > >::value’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:45:51: [ skipping 2 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.4-3.20/BH/include/boost/property_map/property_map.hpp:354:5: required from ‘boost::iterator_property_map boost::make_iterator_property_map(RAIter, ID, Value) [with RAIter = __gnu_cxx::__normal_iterator >; Value = default_color_type; ID = vec_adj_list_vertex_id_map]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/edmonds_karp_max_flow.hpp:161:43: required from ‘static typename boost::detail::edge_capacity_value::type boost::detail::edmonds_karp_dispatch2::apply(Graph&, typename boost::graph_traits::vertex_descriptor, typename boost::graph_traits::vertex_descriptor, PredMap, const boost::bgl_named_params&, boost::param_not_found) [with Graph = boost::adjacency_list > > > >; PredMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator*, std::vector, std::allocator > > >, boost::vec_adj_list_vertex_id_map, boost::detail::edge_desc_impl, boost::detail::edge_desc_impl&>; P = int; T = boost::buffer_param_t; R = boost::no_property; typename boost::detail::edge_capacity_value::type = double; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/edmonds_karp_max_flow.hpp:208:54: required from ‘static typename boost::detail::edge_capacity_value::type boost::detail::edmonds_karp_dispatch1::apply(Graph&, typename boost::graph_traits::vertex_descriptor, typename boost::graph_traits::vertex_descriptor, const boost::bgl_named_params&, boost::param_not_found) [with Graph = boost::adjacency_list > > > >; P = int; T = boost::buffer_param_t; R = boost::no_property; typename boost::detail::edge_capacity_value::type = double; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/edmonds_karp_max_flow.hpp:228:57: required from ‘typename boost::detail::edge_capacity_value::type boost::edmonds_karp_max_flow(Graph&, typename graph_traits::vertex_descriptor, typename graph_traits::vertex_descriptor, const bgl_named_params&) [with Graph = adjacency_list > > > >; P = int; T = buffer_param_t; R = no_property; typename detail::edge_capacity_value::type = double; typename graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/edmonds_karp_max_flow.hpp:240:33: required from ‘typename boost::property_traits::const_type>::value_type boost::edmonds_karp_max_flow(Graph&, typename graph_traits::vertex_descriptor, typename graph_traits::vertex_descriptor) [with Graph = adjacency_list > > > >; typename property_traits::const_type>::value_type = double; typename property_map::const_type = adj_list_edge_property_map > > >, edge_capacity_t>; typename graph_traits::vertex_descriptor = long unsigned int]’ mincut.cpp:76:45: required from here /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::RandomAccessIterator<__gnu_cxx::__normal_iterator > >]’ 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ^ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator > >]’: /home/omnipath/local/R/4.4-3.20/BH/include/boost/property_map/property_map.hpp:354:5: required from ‘boost::iterator_property_map boost::make_iterator_property_map(RAIter, ID, Value) [with RAIter = __gnu_cxx::__normal_iterator >; Value = default_color_type; ID = vec_adj_list_vertex_id_map]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/edmonds_karp_max_flow.hpp:161:43: required from ‘static typename boost::detail::edge_capacity_value::type boost::detail::edmonds_karp_dispatch2::apply(Graph&, typename boost::graph_traits::vertex_descriptor, typename boost::graph_traits::vertex_descriptor, PredMap, const boost::bgl_named_params&, boost::param_not_found) [with Graph = boost::adjacency_list > > > >; PredMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator*, std::vector, std::allocator > > >, boost::vec_adj_list_vertex_id_map, boost::detail::edge_desc_impl, boost::detail::edge_desc_impl&>; P = int; T = boost::buffer_param_t; R = boost::no_property; typename boost::detail::edge_capacity_value::type = double; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/edmonds_karp_max_flow.hpp:208:54: required from ‘static typename boost::detail::edge_capacity_value::type boost::detail::edmonds_karp_dispatch1::apply(Graph&, typename boost::graph_traits::vertex_descriptor, typename boost::graph_traits::vertex_descriptor, const boost::bgl_named_params&, boost::param_not_found) [with Graph = boost::adjacency_list > > > >; P = int; T = boost::buffer_param_t; R = boost::no_property; typename boost::detail::edge_capacity_value::type = double; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/edmonds_karp_max_flow.hpp:228:57: required from ‘typename boost::detail::edge_capacity_value::type boost::edmonds_karp_max_flow(Graph&, typename graph_traits::vertex_descriptor, typename graph_traits::vertex_descriptor, const bgl_named_params&) [with Graph = adjacency_list > > > >; P = int; T = buffer_param_t; R = no_property; typename detail::edge_capacity_value::type = double; typename graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/edmonds_karp_max_flow.hpp:240:33: required from ‘typename boost::property_traits::const_type>::value_type boost::edmonds_karp_max_flow(Graph&, typename graph_traits::vertex_descriptor, typename graph_traits::vertex_descriptor) [with Graph = adjacency_list > > > >; typename property_traits::const_type>::value_type = double; typename property_map::const_type = adj_list_edge_property_map > > >, edge_capacity_t>; typename graph_traits::vertex_descriptor = long unsigned int]’ mincut.cpp:76:45: required from here /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:597:17: note: in a call to non-static member function ‘boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator > >::~RandomAccessIteratorConcept()’ 597 | BOOST_concept(RandomAccessIterator,(TT)) | ^~~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/preprocessor/cat.hpp:29:34: note: in definition of macro ‘BOOST_PP_CAT_I’ 29 | # define BOOST_PP_CAT_I(a, b) a ## b | ^ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/concept_def.hpp:23:12: note: in expansion of macro ‘BOOST_PP_CAT’ 23 | struct BOOST_PP_CAT(name,Concept) \ | ^~~~~~~~~~~~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:597:3: note: in expansion of macro ‘BOOST_concept’ 597 | BOOST_concept(RandomAccessIterator,(TT)) | ^~~~~~~~~~~~~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements > > >, boost::no_property, boost::listS>, boost::is_residual_edge > > >, boost::edge_residual_capacity_t> >, boost::keep_all> > >]’: /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/graph_concepts.hpp:66:5: required from ‘struct boost::concepts::Graph > > >, boost::no_property, boost::listS>, boost::is_residual_edge > > >, boost::edge_residual_capacity_t> >, boost::keep_all> >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/graph_concepts.hpp:75:1: required from ‘struct boost::concepts::IncidenceGraph > > >, boost::no_property, boost::listS>, boost::is_residual_edge > > >, boost::edge_residual_capacity_t> >, boost::keep_all> >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/graph_concepts.hpp:75:1: required from ‘struct boost::concepts::IncidenceGraphConcept > > >, boost::no_property, boost::listS>, boost::is_residual_edge > > >, boost::edge_residual_capacity_t> >, boost::keep_all> >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::concepts::IncidenceGraphConcept > > >, boost::no_property, boost::listS>, boost::is_residual_edge > > >, boost::edge_residual_capacity_t> >, boost::keep_all> >]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied > > >, boost::no_property, boost::listS>, boost::is_residual_edge > > >, boost::edge_residual_capacity_t> >, boost::keep_all> > >::value’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:45:51: [ skipping 2 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/breadth_first_search.hpp:62:5: required from ‘void boost::breadth_first_visit(const IncidenceGraph&, SourceIterator, SourceIterator, Buffer&, BFSVisitor, ColorMap) [with IncidenceGraph = filtered_graph > > >, no_property, listS>, is_residual_edge > > >, edge_residual_capacity_t> >, keep_all>; Buffer = queue > >; BFSVisitor = bfs_visitor*, on_tree_edge> >; ColorMap = default_color_type*; SourceIterator = long unsigned int*]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/breadth_first_search.hpp:136:24: required from ‘void boost::breadth_first_search(const VertexListGraph&, SourceIterator, SourceIterator, Buffer&, BFSVisitor, ColorMap) [with VertexListGraph = filtered_graph > > >, no_property, listS>, is_residual_edge > > >, edge_residual_capacity_t> >, keep_all>; SourceIterator = long unsigned int*; Buffer = queue > >; BFSVisitor = bfs_visitor*, on_tree_edge> >; ColorMap = default_color_type*]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/breadth_first_search.hpp:147:25: required from ‘void boost::breadth_first_search(const VertexListGraph&, typename graph_traits::vertex_descriptor, Buffer&, BFSVisitor, ColorMap) [with VertexListGraph = filtered_graph > > >, no_property, listS>, is_residual_edge > > >, edge_residual_capacity_t> >, keep_all>; Buffer = queue > >; BFSVisitor = bfs_visitor*, on_tree_edge> >; ColorMap = default_color_type*; typename graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/edmonds_karp_max_flow.hpp:101:29: required from ‘typename boost::property_traits::value_type boost::edmonds_karp_max_flow(Graph&, typename graph_traits::vertex_descriptor, typename graph_traits::vertex_descriptor, CapacityEdgeMap, ResidualCapacityEdgeMap, ReverseEdgeMap, ColorMap, PredEdgeMap) [with Graph = adjacency_list > > >, no_property, listS>; CapacityEdgeMap = adj_list_edge_property_map > > >, edge_capacity_t>; ResidualCapacityEdgeMap = adj_list_edge_property_map > > >, edge_residual_capacity_t>; ReverseEdgeMap = adj_list_edge_property_map, detail::edge_desc_impl&, long unsigned int, property > > >, edge_reverse_t>; ColorMap = default_color_type*; PredEdgeMap = detail::edge_desc_impl*; typename property_traits::value_type = long unsigned int; typename graph_traits::vertex_descriptor = long unsigned int]’ mincut.hpp:78:21: required from ‘typename boost::graph_traits::edges_size_type boost::min_cut(VertexListGraph&, OutputIterator, OutputIterator) [with VertexListGraph = R_adjacency_list; OutputIterator = std::back_insert_iterator >; typename graph_traits::edges_size_type = long unsigned int]’ mincut.cpp:128:35: required from here /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::concepts::Graph > > >, boost::no_property, boost::listS>, boost::is_residual_edge > > >, boost::edge_residual_capacity_t> >, boost::keep_all> >]’ 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ^ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements > > >, boost::no_property, boost::listS>, boost::is_residual_edge > > >, boost::edge_residual_capacity_t> >, boost::keep_all> > >]’: /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/graph_concepts.hpp:87:5: required from ‘struct boost::concepts::IncidenceGraph > > >, boost::no_property, boost::listS>, boost::is_residual_edge > > >, boost::edge_residual_capacity_t> >, boost::keep_all> >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/graph_concepts.hpp:75:1: required from ‘struct boost::concepts::IncidenceGraphConcept > > >, boost::no_property, boost::listS>, boost::is_residual_edge > > >, boost::edge_residual_capacity_t> >, boost::keep_all> >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::concepts::IncidenceGraphConcept > > >, boost::no_property, boost::listS>, boost::is_residual_edge > > >, boost::edge_residual_capacity_t> >, boost::keep_all> >]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied > > >, boost::no_property, boost::listS>, boost::is_residual_edge > > >, boost::edge_residual_capacity_t> >, boost::keep_all> > >::value’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:45:51: [ skipping 2 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/breadth_first_search.hpp:62:5: required from ‘void boost::breadth_first_visit(const IncidenceGraph&, SourceIterator, SourceIterator, Buffer&, BFSVisitor, ColorMap) [with IncidenceGraph = filtered_graph > > >, no_property, listS>, is_residual_edge > > >, edge_residual_capacity_t> >, keep_all>; Buffer = queue > >; BFSVisitor = bfs_visitor*, on_tree_edge> >; ColorMap = default_color_type*; SourceIterator = long unsigned int*]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/breadth_first_search.hpp:136:24: required from ‘void boost::breadth_first_search(const VertexListGraph&, SourceIterator, SourceIterator, Buffer&, BFSVisitor, ColorMap) [with VertexListGraph = filtered_graph > > >, no_property, listS>, is_residual_edge > > >, edge_residual_capacity_t> >, keep_all>; SourceIterator = long unsigned int*; Buffer = queue > >; BFSVisitor = bfs_visitor*, on_tree_edge> >; ColorMap = default_color_type*]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/breadth_first_search.hpp:147:25: required from ‘void boost::breadth_first_search(const VertexListGraph&, typename graph_traits::vertex_descriptor, Buffer&, BFSVisitor, ColorMap) [with VertexListGraph = filtered_graph > > >, no_property, listS>, is_residual_edge > > >, edge_residual_capacity_t> >, keep_all>; Buffer = queue > >; BFSVisitor = bfs_visitor*, on_tree_edge> >; ColorMap = default_color_type*; typename graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/edmonds_karp_max_flow.hpp:101:29: required from ‘typename boost::property_traits::value_type boost::edmonds_karp_max_flow(Graph&, typename graph_traits::vertex_descriptor, typename graph_traits::vertex_descriptor, CapacityEdgeMap, ResidualCapacityEdgeMap, ReverseEdgeMap, ColorMap, PredEdgeMap) [with Graph = adjacency_list > > >, no_property, listS>; CapacityEdgeMap = adj_list_edge_property_map > > >, edge_capacity_t>; ResidualCapacityEdgeMap = adj_list_edge_property_map > > >, edge_residual_capacity_t>; ReverseEdgeMap = adj_list_edge_property_map, detail::edge_desc_impl&, long unsigned int, property > > >, edge_reverse_t>; ColorMap = default_color_type*; PredEdgeMap = detail::edge_desc_impl*; typename property_traits::value_type = long unsigned int; typename graph_traits::vertex_descriptor = long unsigned int]’ mincut.hpp:78:21: required from ‘typename boost::graph_traits::edges_size_type boost::min_cut(VertexListGraph&, OutputIterator, OutputIterator) [with VertexListGraph = R_adjacency_list; OutputIterator = std::back_insert_iterator >; typename graph_traits::edges_size_type = long unsigned int]’ mincut.cpp:128:35: required from here /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::concepts::IncidenceGraph > > >, boost::no_property, boost::listS>, boost::is_residual_edge > > >, boost::edge_residual_capacity_t> >, boost::keep_all> >]’ 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ^ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::IncidenceGraphConcept > > >, boost::no_property, boost::listS>, boost::is_residual_edge > > >, boost::edge_residual_capacity_t> >, boost::keep_all> >]’: /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/breadth_first_search.hpp:62:5: required from ‘void boost::breadth_first_visit(const IncidenceGraph&, SourceIterator, SourceIterator, Buffer&, BFSVisitor, ColorMap) [with IncidenceGraph = filtered_graph > > >, no_property, listS>, is_residual_edge > > >, edge_residual_capacity_t> >, keep_all>; Buffer = queue > >; BFSVisitor = bfs_visitor*, on_tree_edge> >; ColorMap = default_color_type*; SourceIterator = long unsigned int*]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/breadth_first_search.hpp:136:24: required from ‘void boost::breadth_first_search(const VertexListGraph&, SourceIterator, SourceIterator, Buffer&, BFSVisitor, ColorMap) [with VertexListGraph = filtered_graph > > >, no_property, listS>, is_residual_edge > > >, edge_residual_capacity_t> >, keep_all>; SourceIterator = long unsigned int*; Buffer = queue > >; BFSVisitor = bfs_visitor*, on_tree_edge> >; ColorMap = default_color_type*]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/breadth_first_search.hpp:147:25: required from ‘void boost::breadth_first_search(const VertexListGraph&, typename graph_traits::vertex_descriptor, Buffer&, BFSVisitor, ColorMap) [with VertexListGraph = filtered_graph > > >, no_property, listS>, is_residual_edge > > >, edge_residual_capacity_t> >, keep_all>; Buffer = queue > >; BFSVisitor = bfs_visitor*, on_tree_edge> >; ColorMap = default_color_type*; typename graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/edmonds_karp_max_flow.hpp:101:29: required from ‘typename boost::property_traits::value_type boost::edmonds_karp_max_flow(Graph&, typename graph_traits::vertex_descriptor, typename graph_traits::vertex_descriptor, CapacityEdgeMap, ResidualCapacityEdgeMap, ReverseEdgeMap, ColorMap, PredEdgeMap) [with Graph = adjacency_list > > >, no_property, listS>; CapacityEdgeMap = adj_list_edge_property_map > > >, edge_capacity_t>; ResidualCapacityEdgeMap = adj_list_edge_property_map > > >, edge_residual_capacity_t>; ReverseEdgeMap = adj_list_edge_property_map, detail::edge_desc_impl&, long unsigned int, property > > >, edge_reverse_t>; ColorMap = default_color_type*; PredEdgeMap = detail::edge_desc_impl*; typename property_traits::value_type = long unsigned int; typename graph_traits::vertex_descriptor = long unsigned int]’ mincut.hpp:78:21: required from ‘typename boost::graph_traits::edges_size_type boost::min_cut(VertexListGraph&, OutputIterator, OutputIterator) [with VertexListGraph = R_adjacency_list; OutputIterator = std::back_insert_iterator >; typename graph_traits::edges_size_type = long unsigned int]’ mincut.cpp:128:35: required from here /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/graph_concepts.hpp:75:15: note: in a call to non-static member function ‘boost::concepts::IncidenceGraphConcept > > >, boost::no_property, boost::listS>, boost::is_residual_edge > > >, boost::edge_residual_capacity_t> >, boost::keep_all> >::~IncidenceGraphConcept()’ 75 | BOOST_concept(IncidenceGraph, (G)) : Graph< G > | ^~~~~~~~~~~~~~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/preprocessor/cat.hpp:29:34: note: in definition of macro ‘BOOST_PP_CAT_I’ 29 | # define BOOST_PP_CAT_I(a, b) a ## b | ^ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/concept_def.hpp:23:12: note: in expansion of macro ‘BOOST_PP_CAT’ 23 | struct BOOST_PP_CAT(name,Concept) \ | ^~~~~~~~~~~~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/graph_concepts.hpp:75:1: note: in expansion of macro ‘BOOST_concept’ 75 | BOOST_concept(IncidenceGraph, (G)) : Graph< G > | ^~~~~~~~~~~~~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::constraint::failed() [with Model = boost::BFSVisitorConcept*, boost::on_tree_edge> >, boost::filtered_graph > > >, boost::no_property, boost::listS>, boost::is_residual_edge > > >, boost::edge_residual_capacity_t> >, boost::keep_all> >]’: /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/breadth_first_search.hpp:65:5: required from ‘void boost::breadth_first_visit(const IncidenceGraph&, SourceIterator, SourceIterator, Buffer&, BFSVisitor, ColorMap) [with IncidenceGraph = filtered_graph > > >, no_property, listS>, is_residual_edge > > >, edge_residual_capacity_t> >, keep_all>; Buffer = queue > >; BFSVisitor = bfs_visitor*, on_tree_edge> >; ColorMap = default_color_type*; SourceIterator = long unsigned int*]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/breadth_first_search.hpp:136:24: required from ‘void boost::breadth_first_search(const VertexListGraph&, SourceIterator, SourceIterator, Buffer&, BFSVisitor, ColorMap) [with VertexListGraph = filtered_graph > > >, no_property, listS>, is_residual_edge > > >, edge_residual_capacity_t> >, keep_all>; SourceIterator = long unsigned int*; Buffer = queue > >; BFSVisitor = bfs_visitor*, on_tree_edge> >; ColorMap = default_color_type*]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/breadth_first_search.hpp:147:25: required from ‘void boost::breadth_first_search(const VertexListGraph&, typename graph_traits::vertex_descriptor, Buffer&, BFSVisitor, ColorMap) [with VertexListGraph = filtered_graph > > >, no_property, listS>, is_residual_edge > > >, edge_residual_capacity_t> >, keep_all>; Buffer = queue > >; BFSVisitor = bfs_visitor*, on_tree_edge> >; ColorMap = default_color_type*; typename graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/edmonds_karp_max_flow.hpp:101:29: required from ‘typename boost::property_traits::value_type boost::edmonds_karp_max_flow(Graph&, typename graph_traits::vertex_descriptor, typename graph_traits::vertex_descriptor, CapacityEdgeMap, ResidualCapacityEdgeMap, ReverseEdgeMap, ColorMap, PredEdgeMap) [with Graph = adjacency_list > > >, no_property, listS>; CapacityEdgeMap = adj_list_edge_property_map > > >, edge_capacity_t>; ResidualCapacityEdgeMap = adj_list_edge_property_map > > >, edge_residual_capacity_t>; ReverseEdgeMap = adj_list_edge_property_map, detail::edge_desc_impl&, long unsigned int, property > > >, edge_reverse_t>; ColorMap = default_color_type*; PredEdgeMap = detail::edge_desc_impl*; typename property_traits::value_type = long unsigned int; typename graph_traits::vertex_descriptor = long unsigned int]’ mincut.hpp:78:21: required from ‘typename boost::graph_traits::edges_size_type boost::min_cut(VertexListGraph&, OutputIterator, OutputIterator) [with VertexListGraph = R_adjacency_list; OutputIterator = std::back_insert_iterator >; typename graph_traits::edges_size_type = long unsigned int]’ mincut.cpp:128:35: required from here /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:65:52: warning: ‘this’ pointer is null [-Wnonnull] 65 | static void failed() { ((Model*)0)->constraints(); } | ~~~~~~~~~~~~~~~~~~~~~~~~^~ In file included from /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/edmonds_karp_max_flow.hpp:22, from /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/edge_connectivity.hpp:19, from mincut.hpp:4, from mincut.cpp:2: /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/breadth_first_search.hpp:37:10: note: in a call to non-static member function ‘void boost::BFSVisitorConcept::constraints() [with Visitor = boost::bfs_visitor*, boost::on_tree_edge> >; Graph = boost::filtered_graph > > >, boost::no_property, boost::listS>, boost::is_residual_edge > > >, boost::edge_residual_capacity_t> >, boost::keep_all>]’ 37 | void constraints() | ^~~~~~~~~~~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::constraint::failed() [with Model = boost::ReadWritePropertyMapConcept]’: /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/breadth_first_search.hpp:66:5: required from ‘void boost::breadth_first_visit(const IncidenceGraph&, SourceIterator, SourceIterator, Buffer&, BFSVisitor, ColorMap) [with IncidenceGraph = filtered_graph > > >, no_property, listS>, is_residual_edge > > >, edge_residual_capacity_t> >, keep_all>; Buffer = queue > >; BFSVisitor = bfs_visitor*, on_tree_edge> >; ColorMap = default_color_type*; SourceIterator = long unsigned int*]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/breadth_first_search.hpp:136:24: required from ‘void boost::breadth_first_search(const VertexListGraph&, SourceIterator, SourceIterator, Buffer&, BFSVisitor, ColorMap) [with VertexListGraph = filtered_graph > > >, no_property, listS>, is_residual_edge > > >, edge_residual_capacity_t> >, keep_all>; SourceIterator = long unsigned int*; Buffer = queue > >; BFSVisitor = bfs_visitor*, on_tree_edge> >; ColorMap = default_color_type*]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/breadth_first_search.hpp:147:25: required from ‘void boost::breadth_first_search(const VertexListGraph&, typename graph_traits::vertex_descriptor, Buffer&, BFSVisitor, ColorMap) [with VertexListGraph = filtered_graph > > >, no_property, listS>, is_residual_edge > > >, edge_residual_capacity_t> >, keep_all>; Buffer = queue > >; BFSVisitor = bfs_visitor*, on_tree_edge> >; ColorMap = default_color_type*; typename graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/edmonds_karp_max_flow.hpp:101:29: required from ‘typename boost::property_traits::value_type boost::edmonds_karp_max_flow(Graph&, typename graph_traits::vertex_descriptor, typename graph_traits::vertex_descriptor, CapacityEdgeMap, ResidualCapacityEdgeMap, ReverseEdgeMap, ColorMap, PredEdgeMap) [with Graph = adjacency_list > > >, no_property, listS>; CapacityEdgeMap = adj_list_edge_property_map > > >, edge_capacity_t>; ResidualCapacityEdgeMap = adj_list_edge_property_map > > >, edge_residual_capacity_t>; ReverseEdgeMap = adj_list_edge_property_map, detail::edge_desc_impl&, long unsigned int, property > > >, edge_reverse_t>; ColorMap = default_color_type*; PredEdgeMap = detail::edge_desc_impl*; typename property_traits::value_type = long unsigned int; typename graph_traits::vertex_descriptor = long unsigned int]’ mincut.hpp:78:21: required from ‘typename boost::graph_traits::edges_size_type boost::min_cut(VertexListGraph&, OutputIterator, OutputIterator) [with VertexListGraph = R_adjacency_list; OutputIterator = std::back_insert_iterator >; typename graph_traits::edges_size_type = long unsigned int]’ mincut.cpp:128:35: required from here /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:65:52: warning: ‘this’ pointer is null [-Wnonnull] 65 | static void failed() { ((Model*)0)->constraints(); } | ~~~~~~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/property_map/property_map.hpp:205:10: note: in a call to non-static member function ‘void boost::ReadWritePropertyMapConcept::constraints() [with PMap = boost::default_color_type*; Key = long unsigned int]’ 205 | void constraints() { | ^~~~~~~~~~~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements >]’: /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:208:5: required from ‘struct boost::Convertible’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::Convertible]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied >::value’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:72:8: [ skipping 2 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:597:3: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator*, std::vector, std::allocator > > > >]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/property_map/property_map.hpp:354:5: required from ‘boost::iterator_property_map boost::make_iterator_property_map(RAIter, ID, Value) [with RAIter = __gnu_cxx::__normal_iterator*, std::vector, std::allocator > > >; Value = detail::edge_desc_impl; ID = vec_adj_list_vertex_id_map]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/edmonds_karp_max_flow.hpp:209:43: required from ‘static typename boost::detail::edge_capacity_value::type boost::detail::edmonds_karp_dispatch1::apply(Graph&, typename boost::graph_traits::vertex_descriptor, typename boost::graph_traits::vertex_descriptor, const boost::bgl_named_params&, boost::param_not_found) [with Graph = boost::adjacency_list > > > >; P = int; T = boost::buffer_param_t; R = boost::no_property; typename boost::detail::edge_capacity_value::type = double; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/edmonds_karp_max_flow.hpp:228:57: required from ‘typename boost::detail::edge_capacity_value::type boost::edmonds_karp_max_flow(Graph&, typename graph_traits::vertex_descriptor, typename graph_traits::vertex_descriptor, const bgl_named_params&) [with Graph = adjacency_list > > > >; P = int; T = buffer_param_t; R = no_property; typename detail::edge_capacity_value::type = double; typename graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/edmonds_karp_max_flow.hpp:240:33: required from ‘typename boost::property_traits::const_type>::value_type boost::edmonds_karp_max_flow(Graph&, typename graph_traits::vertex_descriptor, typename graph_traits::vertex_descriptor) [with Graph = adjacency_list > > > >; typename property_traits::const_type>::value_type = double; typename property_map::const_type = adj_list_edge_property_map > > >, edge_capacity_t>; typename graph_traits::vertex_descriptor = long unsigned int]’ mincut.cpp:76:45: required from here /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::Convertible]’ 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ^ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::Convertible]’: /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:603:11: required from ‘boost::RandomAccessIterator::~RandomAccessIterator() [with TT = __gnu_cxx::__normal_iterator*, std::vector, std::allocator > > >]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:597:3: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator*, std::vector, std::allocator > > > >]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/property_map/property_map.hpp:354:5: required from ‘boost::iterator_property_map boost::make_iterator_property_map(RAIter, ID, Value) [with RAIter = __gnu_cxx::__normal_iterator*, std::vector, std::allocator > > >; Value = detail::edge_desc_impl; ID = vec_adj_list_vertex_id_map]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/edmonds_karp_max_flow.hpp:209:43: required from ‘static typename boost::detail::edge_capacity_value::type boost::detail::edmonds_karp_dispatch1::apply(Graph&, typename boost::graph_traits::vertex_descriptor, typename boost::graph_traits::vertex_descriptor, const boost::bgl_named_params&, boost::param_not_found) [with Graph = boost::adjacency_list > > > >; P = int; T = boost::buffer_param_t; R = boost::no_property; typename boost::detail::edge_capacity_value::type = double; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/edmonds_karp_max_flow.hpp:228:57: required from ‘typename boost::detail::edge_capacity_value::type boost::edmonds_karp_max_flow(Graph&, typename graph_traits::vertex_descriptor, typename graph_traits::vertex_descriptor, const bgl_named_params&) [with Graph = adjacency_list > > > >; P = int; T = buffer_param_t; R = no_property; typename detail::edge_capacity_value::type = double; typename graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/edmonds_karp_max_flow.hpp:240:33: required from ‘typename boost::property_traits::const_type>::value_type boost::edmonds_karp_max_flow(Graph&, typename graph_traits::vertex_descriptor, typename graph_traits::vertex_descriptor) [with Graph = adjacency_list > > > >; typename property_traits::const_type>::value_type = double; typename property_map::const_type = adj_list_edge_property_map > > >, edge_capacity_t>; typename graph_traits::vertex_descriptor = long unsigned int]’ mincut.cpp:76:45: required from here /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::Convertible::~Convertible() [with X = std::random_access_iterator_tag; Y = std::random_access_iterator_tag]’ 37 | ~model() | ^ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:208:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 208 | BOOST_CONCEPT_USAGE(Convertible) { | ^~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::Assignable<__gnu_cxx::__normal_iterator > >]’: /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements > > >]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:145:5: required from ‘struct boost::Assignable<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:502:3: required from ‘struct boost::InputIterator<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:540:3: required from ‘struct boost::ForwardIterator<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:568:3: required from ‘struct boost::BidirectionalIterator<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:597:3: [ skipping 6 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.4-3.20/BH/include/boost/property_map/property_map.hpp:354:5: required from ‘boost::iterator_property_map boost::make_iterator_property_map(RAIter, ID, Value) [with RAIter = __gnu_cxx::__normal_iterator >; Value = default_color_type; ID = vec_adj_list_vertex_id_map]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/edmonds_karp_max_flow.hpp:161:43: required from ‘static typename boost::detail::edge_capacity_value::type boost::detail::edmonds_karp_dispatch2::apply(Graph&, typename boost::graph_traits::vertex_descriptor, typename boost::graph_traits::vertex_descriptor, PredMap, const boost::bgl_named_params&, boost::param_not_found) [with Graph = boost::adjacency_list > > > >; PredMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator*, std::vector, std::allocator > > >, boost::vec_adj_list_vertex_id_map, boost::detail::edge_desc_impl, boost::detail::edge_desc_impl&>; P = int; T = boost::buffer_param_t; R = boost::no_property; typename boost::detail::edge_capacity_value::type = double; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/edmonds_karp_max_flow.hpp:208:54: required from ‘static typename boost::detail::edge_capacity_value::type boost::detail::edmonds_karp_dispatch1::apply(Graph&, typename boost::graph_traits::vertex_descriptor, typename boost::graph_traits::vertex_descriptor, const boost::bgl_named_params&, boost::param_not_found) [with Graph = boost::adjacency_list > > > >; P = int; T = boost::buffer_param_t; R = boost::no_property; typename boost::detail::edge_capacity_value::type = double; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/edmonds_karp_max_flow.hpp:228:57: required from ‘typename boost::detail::edge_capacity_value::type boost::edmonds_karp_max_flow(Graph&, typename graph_traits::vertex_descriptor, typename graph_traits::vertex_descriptor, const bgl_named_params&) [with Graph = adjacency_list > > > >; P = int; T = buffer_param_t; R = no_property; typename detail::edge_capacity_value::type = double; typename graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/edmonds_karp_max_flow.hpp:240:33: required from ‘typename boost::property_traits::const_type>::value_type boost::edmonds_karp_max_flow(Graph&, typename graph_traits::vertex_descriptor, typename graph_traits::vertex_descriptor) [with Graph = adjacency_list > > > >; typename property_traits::const_type>::value_type = double; typename property_map::const_type = adj_list_edge_property_map > > >, edge_capacity_t>; typename graph_traits::vertex_descriptor = long unsigned int]’ mincut.cpp:76:45: required from here /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::Assignable::~Assignable() [with TT = __gnu_cxx::__normal_iterator >]’ 37 | ~model() | ^ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:145:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 145 | BOOST_CONCEPT_USAGE(Assignable) { | ^~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::EqualityComparable<__gnu_cxx::__normal_iterator > >]’: /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements > > >]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:233:5: required from ‘struct boost::EqualityComparable<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:502:3: required from ‘struct boost::InputIterator<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:540:3: required from ‘struct boost::ForwardIterator<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:568:3: required from ‘struct boost::BidirectionalIterator<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:597:3: [ skipping 6 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.4-3.20/BH/include/boost/property_map/property_map.hpp:354:5: required from ‘boost::iterator_property_map boost::make_iterator_property_map(RAIter, ID, Value) [with RAIter = __gnu_cxx::__normal_iterator >; Value = default_color_type; ID = vec_adj_list_vertex_id_map]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/edmonds_karp_max_flow.hpp:161:43: required from ‘static typename boost::detail::edge_capacity_value::type boost::detail::edmonds_karp_dispatch2::apply(Graph&, typename boost::graph_traits::vertex_descriptor, typename boost::graph_traits::vertex_descriptor, PredMap, const boost::bgl_named_params&, boost::param_not_found) [with Graph = boost::adjacency_list > > > >; PredMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator*, std::vector, std::allocator > > >, boost::vec_adj_list_vertex_id_map, boost::detail::edge_desc_impl, boost::detail::edge_desc_impl&>; P = int; T = boost::buffer_param_t; R = boost::no_property; typename boost::detail::edge_capacity_value::type = double; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/edmonds_karp_max_flow.hpp:208:54: required from ‘static typename boost::detail::edge_capacity_value::type boost::detail::edmonds_karp_dispatch1::apply(Graph&, typename boost::graph_traits::vertex_descriptor, typename boost::graph_traits::vertex_descriptor, const boost::bgl_named_params&, boost::param_not_found) [with Graph = boost::adjacency_list > > > >; P = int; T = boost::buffer_param_t; R = boost::no_property; typename boost::detail::edge_capacity_value::type = double; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/edmonds_karp_max_flow.hpp:228:57: required from ‘typename boost::detail::edge_capacity_value::type boost::edmonds_karp_max_flow(Graph&, typename graph_traits::vertex_descriptor, typename graph_traits::vertex_descriptor, const bgl_named_params&) [with Graph = adjacency_list > > > >; P = int; T = buffer_param_t; R = no_property; typename detail::edge_capacity_value::type = double; typename graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/edmonds_karp_max_flow.hpp:240:33: required from ‘typename boost::property_traits::const_type>::value_type boost::edmonds_karp_max_flow(Graph&, typename graph_traits::vertex_descriptor, typename graph_traits::vertex_descriptor) [with Graph = adjacency_list > > > >; typename property_traits::const_type>::value_type = double; typename property_map::const_type = adj_list_edge_property_map > > >, edge_capacity_t>; typename graph_traits::vertex_descriptor = long unsigned int]’ mincut.cpp:76:45: required from here /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::EqualityComparable::~EqualityComparable() [with TT = __gnu_cxx::__normal_iterator >]’ 37 | ~model() | ^ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:233:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 233 | BOOST_CONCEPT_USAGE(EqualityComparable) { | ^~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::InputIterator<__gnu_cxx::__normal_iterator > >]’: /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements > > >]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:512:7: required from ‘struct boost::InputIterator<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:540:3: required from ‘struct boost::ForwardIterator<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:568:3: required from ‘struct boost::BidirectionalIterator<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:597:3: required from ‘struct boost::RandomAccessIterator<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:597:3: [ skipping 5 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.4-3.20/BH/include/boost/property_map/property_map.hpp:354:5: required from ‘boost::iterator_property_map boost::make_iterator_property_map(RAIter, ID, Value) [with RAIter = __gnu_cxx::__normal_iterator >; Value = default_color_type; ID = vec_adj_list_vertex_id_map]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/edmonds_karp_max_flow.hpp:161:43: required from ‘static typename boost::detail::edge_capacity_value::type boost::detail::edmonds_karp_dispatch2::apply(Graph&, typename boost::graph_traits::vertex_descriptor, typename boost::graph_traits::vertex_descriptor, PredMap, const boost::bgl_named_params&, boost::param_not_found) [with Graph = boost::adjacency_list > > > >; PredMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator*, std::vector, std::allocator > > >, boost::vec_adj_list_vertex_id_map, boost::detail::edge_desc_impl, boost::detail::edge_desc_impl&>; P = int; T = boost::buffer_param_t; R = boost::no_property; typename boost::detail::edge_capacity_value::type = double; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/edmonds_karp_max_flow.hpp:208:54: required from ‘static typename boost::detail::edge_capacity_value::type boost::detail::edmonds_karp_dispatch1::apply(Graph&, typename boost::graph_traits::vertex_descriptor, typename boost::graph_traits::vertex_descriptor, const boost::bgl_named_params&, boost::param_not_found) [with Graph = boost::adjacency_list > > > >; P = int; T = boost::buffer_param_t; R = boost::no_property; typename boost::detail::edge_capacity_value::type = double; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/edmonds_karp_max_flow.hpp:228:57: required from ‘typename boost::detail::edge_capacity_value::type boost::edmonds_karp_max_flow(Graph&, typename graph_traits::vertex_descriptor, typename graph_traits::vertex_descriptor, const bgl_named_params&) [with Graph = adjacency_list > > > >; P = int; T = buffer_param_t; R = no_property; typename detail::edge_capacity_value::type = double; typename graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/edmonds_karp_max_flow.hpp:240:33: required from ‘typename boost::property_traits::const_type>::value_type boost::edmonds_karp_max_flow(Graph&, typename graph_traits::vertex_descriptor, typename graph_traits::vertex_descriptor) [with Graph = adjacency_list > > > >; typename property_traits::const_type>::value_type = double; typename property_map::const_type = adj_list_edge_property_map > > >, edge_capacity_t>; typename graph_traits::vertex_descriptor = long unsigned int]’ mincut.cpp:76:45: required from here /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::InputIterator::~InputIterator() [with TT = __gnu_cxx::__normal_iterator >]’ 37 | ~model() | ^ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:512:7: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 512 | BOOST_CONCEPT_USAGE(InputIterator) | ^~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::ForwardIterator<__gnu_cxx::__normal_iterator > >]’: /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements > > >]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:543:7: required from ‘struct boost::ForwardIterator<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:568:3: required from ‘struct boost::BidirectionalIterator<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:597:3: required from ‘struct boost::RandomAccessIterator<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:597:3: required from ‘struct boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:32:62: [ skipping 4 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.4-3.20/BH/include/boost/property_map/property_map.hpp:354:5: required from ‘boost::iterator_property_map boost::make_iterator_property_map(RAIter, ID, Value) [with RAIter = __gnu_cxx::__normal_iterator >; Value = default_color_type; ID = vec_adj_list_vertex_id_map]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/edmonds_karp_max_flow.hpp:161:43: required from ‘static typename boost::detail::edge_capacity_value::type boost::detail::edmonds_karp_dispatch2::apply(Graph&, typename boost::graph_traits::vertex_descriptor, typename boost::graph_traits::vertex_descriptor, PredMap, const boost::bgl_named_params&, boost::param_not_found) [with Graph = boost::adjacency_list > > > >; PredMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator*, std::vector, std::allocator > > >, boost::vec_adj_list_vertex_id_map, boost::detail::edge_desc_impl, boost::detail::edge_desc_impl&>; P = int; T = boost::buffer_param_t; R = boost::no_property; typename boost::detail::edge_capacity_value::type = double; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/edmonds_karp_max_flow.hpp:208:54: required from ‘static typename boost::detail::edge_capacity_value::type boost::detail::edmonds_karp_dispatch1::apply(Graph&, typename boost::graph_traits::vertex_descriptor, typename boost::graph_traits::vertex_descriptor, const boost::bgl_named_params&, boost::param_not_found) [with Graph = boost::adjacency_list > > > >; P = int; T = boost::buffer_param_t; R = boost::no_property; typename boost::detail::edge_capacity_value::type = double; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/edmonds_karp_max_flow.hpp:228:57: required from ‘typename boost::detail::edge_capacity_value::type boost::edmonds_karp_max_flow(Graph&, typename graph_traits::vertex_descriptor, typename graph_traits::vertex_descriptor, const bgl_named_params&) [with Graph = adjacency_list > > > >; P = int; T = buffer_param_t; R = no_property; typename detail::edge_capacity_value::type = double; typename graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/edmonds_karp_max_flow.hpp:240:33: required from ‘typename boost::property_traits::const_type>::value_type boost::edmonds_karp_max_flow(Graph&, typename graph_traits::vertex_descriptor, typename graph_traits::vertex_descriptor) [with Graph = adjacency_list > > > >; typename property_traits::const_type>::value_type = double; typename property_map::const_type = adj_list_edge_property_map > > >, edge_capacity_t>; typename graph_traits::vertex_descriptor = long unsigned int]’ mincut.cpp:76:45: required from here /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::ForwardIterator::~ForwardIterator() [with TT = __gnu_cxx::__normal_iterator >]’ 37 | ~model() | ^ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:543:7: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 543 | BOOST_CONCEPT_USAGE(ForwardIterator) | ^~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::BidirectionalIterator<__gnu_cxx::__normal_iterator > >]’: /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements > > >]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:571:7: required from ‘struct boost::BidirectionalIterator<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:597:3: required from ‘struct boost::RandomAccessIterator<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:597:3: required from ‘struct boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator > >]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:42:5: [ skipping 3 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.4-3.20/BH/include/boost/property_map/property_map.hpp:354:5: required from ‘boost::iterator_property_map boost::make_iterator_property_map(RAIter, ID, Value) [with RAIter = __gnu_cxx::__normal_iterator >; Value = default_color_type; ID = vec_adj_list_vertex_id_map]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/edmonds_karp_max_flow.hpp:161:43: required from ‘static typename boost::detail::edge_capacity_value::type boost::detail::edmonds_karp_dispatch2::apply(Graph&, typename boost::graph_traits::vertex_descriptor, typename boost::graph_traits::vertex_descriptor, PredMap, const boost::bgl_named_params&, boost::param_not_found) [with Graph = boost::adjacency_list > > > >; PredMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator*, std::vector, std::allocator > > >, boost::vec_adj_list_vertex_id_map, boost::detail::edge_desc_impl, boost::detail::edge_desc_impl&>; P = int; T = boost::buffer_param_t; R = boost::no_property; typename boost::detail::edge_capacity_value::type = double; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/edmonds_karp_max_flow.hpp:208:54: required from ‘static typename boost::detail::edge_capacity_value::type boost::detail::edmonds_karp_dispatch1::apply(Graph&, typename boost::graph_traits::vertex_descriptor, typename boost::graph_traits::vertex_descriptor, const boost::bgl_named_params&, boost::param_not_found) [with Graph = boost::adjacency_list > > > >; P = int; T = boost::buffer_param_t; R = boost::no_property; typename boost::detail::edge_capacity_value::type = double; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/edmonds_karp_max_flow.hpp:228:57: required from ‘typename boost::detail::edge_capacity_value::type boost::edmonds_karp_max_flow(Graph&, typename graph_traits::vertex_descriptor, typename graph_traits::vertex_descriptor, const bgl_named_params&) [with Graph = adjacency_list > > > >; P = int; T = buffer_param_t; R = no_property; typename detail::edge_capacity_value::type = double; typename graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/edmonds_karp_max_flow.hpp:240:33: required from ‘typename boost::property_traits::const_type>::value_type boost::edmonds_karp_max_flow(Graph&, typename graph_traits::vertex_descriptor, typename graph_traits::vertex_descriptor) [with Graph = adjacency_list > > > >; typename property_traits::const_type>::value_type = double; typename property_map::const_type = adj_list_edge_property_map > > >, edge_capacity_t>; typename graph_traits::vertex_descriptor = long unsigned int]’ mincut.cpp:76:45: required from here /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::BidirectionalIterator::~BidirectionalIterator() [with TT = __gnu_cxx::__normal_iterator >]’ 37 | ~model() | ^ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:571:7: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 571 | BOOST_CONCEPT_USAGE(BidirectionalIterator) | ^~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::Comparable<__gnu_cxx::__normal_iterator > >]’: /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements > > >]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:253:5: required from ‘struct boost::Comparable<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:597:3: required from ‘struct boost::RandomAccessIterator<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:597:3: required from ‘struct boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator > >]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:42:5: [ skipping 3 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.4-3.20/BH/include/boost/property_map/property_map.hpp:354:5: required from ‘boost::iterator_property_map boost::make_iterator_property_map(RAIter, ID, Value) [with RAIter = __gnu_cxx::__normal_iterator >; Value = default_color_type; ID = vec_adj_list_vertex_id_map]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/edmonds_karp_max_flow.hpp:161:43: required from ‘static typename boost::detail::edge_capacity_value::type boost::detail::edmonds_karp_dispatch2::apply(Graph&, typename boost::graph_traits::vertex_descriptor, typename boost::graph_traits::vertex_descriptor, PredMap, const boost::bgl_named_params&, boost::param_not_found) [with Graph = boost::adjacency_list > > > >; PredMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator*, std::vector, std::allocator > > >, boost::vec_adj_list_vertex_id_map, boost::detail::edge_desc_impl, boost::detail::edge_desc_impl&>; P = int; T = boost::buffer_param_t; R = boost::no_property; typename boost::detail::edge_capacity_value::type = double; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/edmonds_karp_max_flow.hpp:208:54: required from ‘static typename boost::detail::edge_capacity_value::type boost::detail::edmonds_karp_dispatch1::apply(Graph&, typename boost::graph_traits::vertex_descriptor, typename boost::graph_traits::vertex_descriptor, const boost::bgl_named_params&, boost::param_not_found) [with Graph = boost::adjacency_list > > > >; P = int; T = boost::buffer_param_t; R = boost::no_property; typename boost::detail::edge_capacity_value::type = double; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/edmonds_karp_max_flow.hpp:228:57: required from ‘typename boost::detail::edge_capacity_value::type boost::edmonds_karp_max_flow(Graph&, typename graph_traits::vertex_descriptor, typename graph_traits::vertex_descriptor, const bgl_named_params&) [with Graph = adjacency_list > > > >; P = int; T = buffer_param_t; R = no_property; typename detail::edge_capacity_value::type = double; typename graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/edmonds_karp_max_flow.hpp:240:33: required from ‘typename boost::property_traits::const_type>::value_type boost::edmonds_karp_max_flow(Graph&, typename graph_traits::vertex_descriptor, typename graph_traits::vertex_descriptor) [with Graph = adjacency_list > > > >; typename property_traits::const_type>::value_type = double; typename property_map::const_type = adj_list_edge_property_map > > >, edge_capacity_t>; typename graph_traits::vertex_descriptor = long unsigned int]’ mincut.cpp:76:45: required from here /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::Comparable::~Comparable() [with TT = __gnu_cxx::__normal_iterator >]’ 37 | ~model() | ^ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:253:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 253 | BOOST_CONCEPT_USAGE(Comparable) { | ^~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::RandomAccessIterator<__gnu_cxx::__normal_iterator > >]’: /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements > > >]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:601:7: required from ‘struct boost::RandomAccessIterator<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:597:3: required from ‘struct boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator > >]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied > > >::value’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:45:51: [ skipping 2 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.4-3.20/BH/include/boost/property_map/property_map.hpp:354:5: required from ‘boost::iterator_property_map boost::make_iterator_property_map(RAIter, ID, Value) [with RAIter = __gnu_cxx::__normal_iterator >; Value = default_color_type; ID = vec_adj_list_vertex_id_map]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/edmonds_karp_max_flow.hpp:161:43: required from ‘static typename boost::detail::edge_capacity_value::type boost::detail::edmonds_karp_dispatch2::apply(Graph&, typename boost::graph_traits::vertex_descriptor, typename boost::graph_traits::vertex_descriptor, PredMap, const boost::bgl_named_params&, boost::param_not_found) [with Graph = boost::adjacency_list > > > >; PredMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator*, std::vector, std::allocator > > >, boost::vec_adj_list_vertex_id_map, boost::detail::edge_desc_impl, boost::detail::edge_desc_impl&>; P = int; T = boost::buffer_param_t; R = boost::no_property; typename boost::detail::edge_capacity_value::type = double; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/edmonds_karp_max_flow.hpp:208:54: required from ‘static typename boost::detail::edge_capacity_value::type boost::detail::edmonds_karp_dispatch1::apply(Graph&, typename boost::graph_traits::vertex_descriptor, typename boost::graph_traits::vertex_descriptor, const boost::bgl_named_params&, boost::param_not_found) [with Graph = boost::adjacency_list > > > >; P = int; T = boost::buffer_param_t; R = boost::no_property; typename boost::detail::edge_capacity_value::type = double; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/edmonds_karp_max_flow.hpp:228:57: required from ‘typename boost::detail::edge_capacity_value::type boost::edmonds_karp_max_flow(Graph&, typename graph_traits::vertex_descriptor, typename graph_traits::vertex_descriptor, const bgl_named_params&) [with Graph = adjacency_list > > > >; P = int; T = buffer_param_t; R = no_property; typename detail::edge_capacity_value::type = double; typename graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/edmonds_karp_max_flow.hpp:240:33: required from ‘typename boost::property_traits::const_type>::value_type boost::edmonds_karp_max_flow(Graph&, typename graph_traits::vertex_descriptor, typename graph_traits::vertex_descriptor) [with Graph = adjacency_list > > > >; typename property_traits::const_type>::value_type = double; typename property_map::const_type = adj_list_edge_property_map > > >, edge_capacity_t>; typename graph_traits::vertex_descriptor = long unsigned int]’ mincut.cpp:76:45: required from here /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::RandomAccessIterator::~RandomAccessIterator() [with TT = __gnu_cxx::__normal_iterator >]’ 37 | ~model() | ^ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:601:7: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 601 | BOOST_CONCEPT_USAGE(RandomAccessIterator) | ^~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::concepts::Graph > > >, boost::no_property, boost::listS>, boost::is_residual_edge > > >, boost::edge_residual_capacity_t> >, boost::keep_all> >]’: /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements > > >, boost::no_property, boost::listS>, boost::is_residual_edge > > >, boost::edge_residual_capacity_t> >, boost::keep_all> > >]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/graph_concepts.hpp:66:5: required from ‘struct boost::concepts::Graph > > >, boost::no_property, boost::listS>, boost::is_residual_edge > > >, boost::edge_residual_capacity_t> >, boost::keep_all> >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/graph_concepts.hpp:75:1: required from ‘struct boost::concepts::IncidenceGraph > > >, boost::no_property, boost::listS>, boost::is_residual_edge > > >, boost::edge_residual_capacity_t> >, boost::keep_all> >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/graph_concepts.hpp:75:1: required from ‘struct boost::concepts::IncidenceGraphConcept > > >, boost::no_property, boost::listS>, boost::is_residual_edge > > >, boost::edge_residual_capacity_t> >, boost::keep_all> >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::concepts::IncidenceGraphConcept > > >, boost::no_property, boost::listS>, boost::is_residual_edge > > >, boost::edge_residual_capacity_t> >, boost::keep_all> >]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:42:5: [ skipping 3 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/breadth_first_search.hpp:62:5: required from ‘void boost::breadth_first_visit(const IncidenceGraph&, SourceIterator, SourceIterator, Buffer&, BFSVisitor, ColorMap) [with IncidenceGraph = filtered_graph > > >, no_property, listS>, is_residual_edge > > >, edge_residual_capacity_t> >, keep_all>; Buffer = queue > >; BFSVisitor = bfs_visitor*, on_tree_edge> >; ColorMap = default_color_type*; SourceIterator = long unsigned int*]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/breadth_first_search.hpp:136:24: required from ‘void boost::breadth_first_search(const VertexListGraph&, SourceIterator, SourceIterator, Buffer&, BFSVisitor, ColorMap) [with VertexListGraph = filtered_graph > > >, no_property, listS>, is_residual_edge > > >, edge_residual_capacity_t> >, keep_all>; SourceIterator = long unsigned int*; Buffer = queue > >; BFSVisitor = bfs_visitor*, on_tree_edge> >; ColorMap = default_color_type*]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/breadth_first_search.hpp:147:25: required from ‘void boost::breadth_first_search(const VertexListGraph&, typename graph_traits::vertex_descriptor, Buffer&, BFSVisitor, ColorMap) [with VertexListGraph = filtered_graph > > >, no_property, listS>, is_residual_edge > > >, edge_residual_capacity_t> >, keep_all>; Buffer = queue > >; BFSVisitor = bfs_visitor*, on_tree_edge> >; ColorMap = default_color_type*; typename graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/edmonds_karp_max_flow.hpp:101:29: required from ‘typename boost::property_traits::value_type boost::edmonds_karp_max_flow(Graph&, typename graph_traits::vertex_descriptor, typename graph_traits::vertex_descriptor, CapacityEdgeMap, ResidualCapacityEdgeMap, ReverseEdgeMap, ColorMap, PredEdgeMap) [with Graph = adjacency_list > > >, no_property, listS>; CapacityEdgeMap = adj_list_edge_property_map > > >, edge_capacity_t>; ResidualCapacityEdgeMap = adj_list_edge_property_map > > >, edge_residual_capacity_t>; ReverseEdgeMap = adj_list_edge_property_map, detail::edge_desc_impl&, long unsigned int, property > > >, edge_reverse_t>; ColorMap = default_color_type*; PredEdgeMap = detail::edge_desc_impl*; typename property_traits::value_type = long unsigned int; typename graph_traits::vertex_descriptor = long unsigned int]’ mincut.hpp:78:21: required from ‘typename boost::graph_traits::edges_size_type boost::min_cut(VertexListGraph&, OutputIterator, OutputIterator) [with VertexListGraph = R_adjacency_list; OutputIterator = std::back_insert_iterator >; typename graph_traits::edges_size_type = long unsigned int]’ mincut.cpp:128:35: required from here /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::concepts::Graph::~Graph() [with G = boost::filtered_graph > > >, boost::no_property, boost::listS>, boost::is_residual_edge > > >, boost::edge_residual_capacity_t> >, boost::keep_all>]’ 37 | ~model() | ^ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/graph_concepts.hpp:66:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 66 | BOOST_CONCEPT_USAGE(Graph) | ^~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::concepts::IncidenceGraph > > >, boost::no_property, boost::listS>, boost::is_residual_edge > > >, boost::edge_residual_capacity_t> >, boost::keep_all> >]’: /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements > > >, boost::no_property, boost::listS>, boost::is_residual_edge > > >, boost::edge_residual_capacity_t> >, boost::keep_all> > >]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/graph_concepts.hpp:87:5: required from ‘struct boost::concepts::IncidenceGraph > > >, boost::no_property, boost::listS>, boost::is_residual_edge > > >, boost::edge_residual_capacity_t> >, boost::keep_all> >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/graph_concepts.hpp:75:1: required from ‘struct boost::concepts::IncidenceGraphConcept > > >, boost::no_property, boost::listS>, boost::is_residual_edge > > >, boost::edge_residual_capacity_t> >, boost::keep_all> >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::concepts::IncidenceGraphConcept > > >, boost::no_property, boost::listS>, boost::is_residual_edge > > >, boost::edge_residual_capacity_t> >, boost::keep_all> >]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied > > >, boost::no_property, boost::listS>, boost::is_residual_edge > > >, boost::edge_residual_capacity_t> >, boost::keep_all> > >::value’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:45:51: [ skipping 2 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/breadth_first_search.hpp:62:5: required from ‘void boost::breadth_first_visit(const IncidenceGraph&, SourceIterator, SourceIterator, Buffer&, BFSVisitor, ColorMap) [with IncidenceGraph = filtered_graph > > >, no_property, listS>, is_residual_edge > > >, edge_residual_capacity_t> >, keep_all>; Buffer = queue > >; BFSVisitor = bfs_visitor*, on_tree_edge> >; ColorMap = default_color_type*; SourceIterator = long unsigned int*]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/breadth_first_search.hpp:136:24: required from ‘void boost::breadth_first_search(const VertexListGraph&, SourceIterator, SourceIterator, Buffer&, BFSVisitor, ColorMap) [with VertexListGraph = filtered_graph > > >, no_property, listS>, is_residual_edge > > >, edge_residual_capacity_t> >, keep_all>; SourceIterator = long unsigned int*; Buffer = queue > >; BFSVisitor = bfs_visitor*, on_tree_edge> >; ColorMap = default_color_type*]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/breadth_first_search.hpp:147:25: required from ‘void boost::breadth_first_search(const VertexListGraph&, typename graph_traits::vertex_descriptor, Buffer&, BFSVisitor, ColorMap) [with VertexListGraph = filtered_graph > > >, no_property, listS>, is_residual_edge > > >, edge_residual_capacity_t> >, keep_all>; Buffer = queue > >; BFSVisitor = bfs_visitor*, on_tree_edge> >; ColorMap = default_color_type*; typename graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/edmonds_karp_max_flow.hpp:101:29: required from ‘typename boost::property_traits::value_type boost::edmonds_karp_max_flow(Graph&, typename graph_traits::vertex_descriptor, typename graph_traits::vertex_descriptor, CapacityEdgeMap, ResidualCapacityEdgeMap, ReverseEdgeMap, ColorMap, PredEdgeMap) [with Graph = adjacency_list > > >, no_property, listS>; CapacityEdgeMap = adj_list_edge_property_map > > >, edge_capacity_t>; ResidualCapacityEdgeMap = adj_list_edge_property_map > > >, edge_residual_capacity_t>; ReverseEdgeMap = adj_list_edge_property_map, detail::edge_desc_impl&, long unsigned int, property > > >, edge_reverse_t>; ColorMap = default_color_type*; PredEdgeMap = detail::edge_desc_impl*; typename property_traits::value_type = long unsigned int; typename graph_traits::vertex_descriptor = long unsigned int]’ mincut.hpp:78:21: required from ‘typename boost::graph_traits::edges_size_type boost::min_cut(VertexListGraph&, OutputIterator, OutputIterator) [with VertexListGraph = R_adjacency_list; OutputIterator = std::back_insert_iterator >; typename graph_traits::edges_size_type = long unsigned int]’ mincut.cpp:128:35: required from here /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::concepts::IncidenceGraph::~IncidenceGraph() [with G = boost::filtered_graph > > >, boost::no_property, boost::listS>, boost::is_residual_edge > > >, boost::edge_residual_capacity_t> >, boost::keep_all>]’ 37 | ~model() | ^ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/graph_concepts.hpp:87:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 87 | BOOST_CONCEPT_USAGE(IncidenceGraph) | ^~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements*, boost::on_tree_edge> > > >]’: /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:167:5: required from ‘struct boost::CopyConstructible*, boost::on_tree_edge> > >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:165:3: required from ‘struct boost::CopyConstructibleConcept*, boost::on_tree_edge> > >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::CopyConstructibleConcept*, boost::on_tree_edge> > >]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied*, boost::on_tree_edge> > > >::value’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied*, boost::on_tree_edge> > > >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:72:8: [ skipping 6 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/breadth_first_search.hpp:65:5: required from ‘void boost::breadth_first_visit(const IncidenceGraph&, SourceIterator, SourceIterator, Buffer&, BFSVisitor, ColorMap) [with IncidenceGraph = filtered_graph > > >, no_property, listS>, is_residual_edge > > >, edge_residual_capacity_t> >, keep_all>; Buffer = queue > >; BFSVisitor = bfs_visitor*, on_tree_edge> >; ColorMap = default_color_type*; SourceIterator = long unsigned int*]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/breadth_first_search.hpp:136:24: required from ‘void boost::breadth_first_search(const VertexListGraph&, SourceIterator, SourceIterator, Buffer&, BFSVisitor, ColorMap) [with VertexListGraph = filtered_graph > > >, no_property, listS>, is_residual_edge > > >, edge_residual_capacity_t> >, keep_all>; SourceIterator = long unsigned int*; Buffer = queue > >; BFSVisitor = bfs_visitor*, on_tree_edge> >; ColorMap = default_color_type*]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/breadth_first_search.hpp:147:25: required from ‘void boost::breadth_first_search(const VertexListGraph&, typename graph_traits::vertex_descriptor, Buffer&, BFSVisitor, ColorMap) [with VertexListGraph = filtered_graph > > >, no_property, listS>, is_residual_edge > > >, edge_residual_capacity_t> >, keep_all>; Buffer = queue > >; BFSVisitor = bfs_visitor*, on_tree_edge> >; ColorMap = default_color_type*; typename graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/edmonds_karp_max_flow.hpp:101:29: required from ‘typename boost::property_traits::value_type boost::edmonds_karp_max_flow(Graph&, typename graph_traits::vertex_descriptor, typename graph_traits::vertex_descriptor, CapacityEdgeMap, ResidualCapacityEdgeMap, ReverseEdgeMap, ColorMap, PredEdgeMap) [with Graph = adjacency_list > > >, no_property, listS>; CapacityEdgeMap = adj_list_edge_property_map > > >, edge_capacity_t>; ResidualCapacityEdgeMap = adj_list_edge_property_map > > >, edge_residual_capacity_t>; ReverseEdgeMap = adj_list_edge_property_map, detail::edge_desc_impl&, long unsigned int, property > > >, edge_reverse_t>; ColorMap = default_color_type*; PredEdgeMap = detail::edge_desc_impl*; typename property_traits::value_type = long unsigned int; typename graph_traits::vertex_descriptor = long unsigned int]’ mincut.hpp:78:21: required from ‘typename boost::graph_traits::edges_size_type boost::min_cut(VertexListGraph&, OutputIterator, OutputIterator) [with VertexListGraph = R_adjacency_list; OutputIterator = std::back_insert_iterator >; typename graph_traits::edges_size_type = long unsigned int]’ mincut.cpp:128:35: required from here /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::CopyConstructible*, boost::on_tree_edge> > >]’ 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ^ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::CopyConstructibleConcept*, boost::on_tree_edge> > >]’: /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/breadth_first_search.hpp:39:9: required from ‘void boost::BFSVisitorConcept::constraints() [with Visitor = boost::bfs_visitor*, boost::on_tree_edge> >; Graph = boost::filtered_graph > > >, boost::no_property, boost::listS>, boost::is_residual_edge > > >, boost::edge_residual_capacity_t> >, boost::keep_all>]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::BFSVisitorConcept*, boost::on_tree_edge> >, boost::filtered_graph > > >, boost::no_property, boost::listS>, boost::is_residual_edge > > >, boost::edge_residual_capacity_t> >, boost::keep_all> >]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied*, boost::on_tree_edge> >, boost::filtered_graph > > >, boost::no_property, boost::listS>, boost::is_residual_edge > > >, boost::edge_residual_capacity_t> >, boost::keep_all> > >::value’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied*, boost::on_tree_edge> >, boost::filtered_graph > > >, boost::no_property, boost::listS>, boost::is_residual_edge > > >, boost::edge_residual_capacity_t> >, boost::keep_all> > >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_*, boost::on_tree_edge> >, boost::filtered_graph > > >, boost::no_property, boost::listS>, boost::is_residual_edge > > >, boost::edge_residual_capacity_t> >, boost::keep_all> >)>’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/breadth_first_search.hpp:65:5: required from ‘void boost::breadth_first_visit(const IncidenceGraph&, SourceIterator, SourceIterator, Buffer&, BFSVisitor, ColorMap) [with IncidenceGraph = filtered_graph > > >, no_property, listS>, is_residual_edge > > >, edge_residual_capacity_t> >, keep_all>; Buffer = queue > >; BFSVisitor = bfs_visitor*, on_tree_edge> >; ColorMap = default_color_type*; SourceIterator = long unsigned int*]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/breadth_first_search.hpp:136:24: required from ‘void boost::breadth_first_search(const VertexListGraph&, SourceIterator, SourceIterator, Buffer&, BFSVisitor, ColorMap) [with VertexListGraph = filtered_graph > > >, no_property, listS>, is_residual_edge > > >, edge_residual_capacity_t> >, keep_all>; SourceIterator = long unsigned int*; Buffer = queue > >; BFSVisitor = bfs_visitor*, on_tree_edge> >; ColorMap = default_color_type*]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/breadth_first_search.hpp:147:25: required from ‘void boost::breadth_first_search(const VertexListGraph&, typename graph_traits::vertex_descriptor, Buffer&, BFSVisitor, ColorMap) [with VertexListGraph = filtered_graph > > >, no_property, listS>, is_residual_edge > > >, edge_residual_capacity_t> >, keep_all>; Buffer = queue > >; BFSVisitor = bfs_visitor*, on_tree_edge> >; ColorMap = default_color_type*; typename graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/edmonds_karp_max_flow.hpp:101:29: required from ‘typename boost::property_traits::value_type boost::edmonds_karp_max_flow(Graph&, typename graph_traits::vertex_descriptor, typename graph_traits::vertex_descriptor, CapacityEdgeMap, ResidualCapacityEdgeMap, ReverseEdgeMap, ColorMap, PredEdgeMap) [with Graph = adjacency_list > > >, no_property, listS>; CapacityEdgeMap = adj_list_edge_property_map > > >, edge_capacity_t>; ResidualCapacityEdgeMap = adj_list_edge_property_map > > >, edge_residual_capacity_t>; ReverseEdgeMap = adj_list_edge_property_map, detail::edge_desc_impl&, long unsigned int, property > > >, edge_reverse_t>; ColorMap = default_color_type*; PredEdgeMap = detail::edge_desc_impl*; typename property_traits::value_type = long unsigned int; typename graph_traits::vertex_descriptor = long unsigned int]’ mincut.hpp:78:21: required from ‘typename boost::graph_traits::edges_size_type boost::min_cut(VertexListGraph&, OutputIterator, OutputIterator) [with VertexListGraph = R_adjacency_list; OutputIterator = std::back_insert_iterator >; typename graph_traits::edges_size_type = long unsigned int]’ mincut.cpp:128:35: required from here /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:165:17: note: in a call to non-static member function ‘boost::CopyConstructibleConcept*, boost::on_tree_edge> > >::~CopyConstructibleConcept()’ 165 | BOOST_concept(CopyConstructible,(TT)) | ^~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/preprocessor/cat.hpp:29:34: note: in definition of macro ‘BOOST_PP_CAT_I’ 29 | # define BOOST_PP_CAT_I(a, b) a ## b | ^ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/concept_def.hpp:23:12: note: in expansion of macro ‘BOOST_PP_CAT’ 23 | struct BOOST_PP_CAT(name,Concept) \ | ^~~~~~~~~~~~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:165:3: note: in expansion of macro ‘BOOST_concept’ 165 | BOOST_concept(CopyConstructible,(TT)) | ^~~~~~~~~~~~~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::constraint::failed() [with Model = boost::ReadablePropertyMapConcept]’: /home/omnipath/local/R/4.4-3.20/BH/include/boost/property_map/property_map.hpp:206:7: required from ‘void boost::ReadWritePropertyMapConcept::constraints() [with PMap = boost::default_color_type*; Key = long unsigned int]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::ReadWritePropertyMapConcept]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied >::value’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_)>’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/breadth_first_search.hpp:66:5: required from ‘void boost::breadth_first_visit(const IncidenceGraph&, SourceIterator, SourceIterator, Buffer&, BFSVisitor, ColorMap) [with IncidenceGraph = filtered_graph > > >, no_property, listS>, is_residual_edge > > >, edge_residual_capacity_t> >, keep_all>; Buffer = queue > >; BFSVisitor = bfs_visitor*, on_tree_edge> >; ColorMap = default_color_type*; SourceIterator = long unsigned int*]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/breadth_first_search.hpp:136:24: required from ‘void boost::breadth_first_search(const VertexListGraph&, SourceIterator, SourceIterator, Buffer&, BFSVisitor, ColorMap) [with VertexListGraph = filtered_graph > > >, no_property, listS>, is_residual_edge > > >, edge_residual_capacity_t> >, keep_all>; SourceIterator = long unsigned int*; Buffer = queue > >; BFSVisitor = bfs_visitor*, on_tree_edge> >; ColorMap = default_color_type*]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/breadth_first_search.hpp:147:25: required from ‘void boost::breadth_first_search(const VertexListGraph&, typename graph_traits::vertex_descriptor, Buffer&, BFSVisitor, ColorMap) [with VertexListGraph = filtered_graph > > >, no_property, listS>, is_residual_edge > > >, edge_residual_capacity_t> >, keep_all>; Buffer = queue > >; BFSVisitor = bfs_visitor*, on_tree_edge> >; ColorMap = default_color_type*; typename graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/edmonds_karp_max_flow.hpp:101:29: required from ‘typename boost::property_traits::value_type boost::edmonds_karp_max_flow(Graph&, typename graph_traits::vertex_descriptor, typename graph_traits::vertex_descriptor, CapacityEdgeMap, ResidualCapacityEdgeMap, ReverseEdgeMap, ColorMap, PredEdgeMap) [with Graph = adjacency_list > > >, no_property, listS>; CapacityEdgeMap = adj_list_edge_property_map > > >, edge_capacity_t>; ResidualCapacityEdgeMap = adj_list_edge_property_map > > >, edge_residual_capacity_t>; ReverseEdgeMap = adj_list_edge_property_map, detail::edge_desc_impl&, long unsigned int, property > > >, edge_reverse_t>; ColorMap = default_color_type*; PredEdgeMap = detail::edge_desc_impl*; typename property_traits::value_type = long unsigned int; typename graph_traits::vertex_descriptor = long unsigned int]’ mincut.hpp:78:21: required from ‘typename boost::graph_traits::edges_size_type boost::min_cut(VertexListGraph&, OutputIterator, OutputIterator) [with VertexListGraph = R_adjacency_list; OutputIterator = std::back_insert_iterator >; typename graph_traits::edges_size_type = long unsigned int]’ mincut.cpp:128:35: required from here /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:65:52: warning: ‘this’ pointer is null [-Wnonnull] 65 | static void failed() { ((Model*)0)->constraints(); } | ~~~~~~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/property_map/property_map.hpp:147:10: note: in a call to non-static member function ‘void boost::ReadablePropertyMapConcept::constraints() [with PMap = boost::default_color_type*; Key = long unsigned int]’ 147 | void constraints() { | ^~~~~~~~~~~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::constraint::failed() [with Model = boost::WritablePropertyMapConcept]’: /home/omnipath/local/R/4.4-3.20/BH/include/boost/property_map/property_map.hpp:207:7: required from ‘void boost::ReadWritePropertyMapConcept::constraints() [with PMap = boost::default_color_type*; Key = long unsigned int]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::ReadWritePropertyMapConcept]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied >::value’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_)>’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/breadth_first_search.hpp:66:5: required from ‘void boost::breadth_first_visit(const IncidenceGraph&, SourceIterator, SourceIterator, Buffer&, BFSVisitor, ColorMap) [with IncidenceGraph = filtered_graph > > >, no_property, listS>, is_residual_edge > > >, edge_residual_capacity_t> >, keep_all>; Buffer = queue > >; BFSVisitor = bfs_visitor*, on_tree_edge> >; ColorMap = default_color_type*; SourceIterator = long unsigned int*]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/breadth_first_search.hpp:136:24: required from ‘void boost::breadth_first_search(const VertexListGraph&, SourceIterator, SourceIterator, Buffer&, BFSVisitor, ColorMap) [with VertexListGraph = filtered_graph > > >, no_property, listS>, is_residual_edge > > >, edge_residual_capacity_t> >, keep_all>; SourceIterator = long unsigned int*; Buffer = queue > >; BFSVisitor = bfs_visitor*, on_tree_edge> >; ColorMap = default_color_type*]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/breadth_first_search.hpp:147:25: required from ‘void boost::breadth_first_search(const VertexListGraph&, typename graph_traits::vertex_descriptor, Buffer&, BFSVisitor, ColorMap) [with VertexListGraph = filtered_graph > > >, no_property, listS>, is_residual_edge > > >, edge_residual_capacity_t> >, keep_all>; Buffer = queue > >; BFSVisitor = bfs_visitor*, on_tree_edge> >; ColorMap = default_color_type*; typename graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/edmonds_karp_max_flow.hpp:101:29: required from ‘typename boost::property_traits::value_type boost::edmonds_karp_max_flow(Graph&, typename graph_traits::vertex_descriptor, typename graph_traits::vertex_descriptor, CapacityEdgeMap, ResidualCapacityEdgeMap, ReverseEdgeMap, ColorMap, PredEdgeMap) [with Graph = adjacency_list > > >, no_property, listS>; CapacityEdgeMap = adj_list_edge_property_map > > >, edge_capacity_t>; ResidualCapacityEdgeMap = adj_list_edge_property_map > > >, edge_residual_capacity_t>; ReverseEdgeMap = adj_list_edge_property_map, detail::edge_desc_impl&, long unsigned int, property > > >, edge_reverse_t>; ColorMap = default_color_type*; PredEdgeMap = detail::edge_desc_impl*; typename property_traits::value_type = long unsigned int; typename graph_traits::vertex_descriptor = long unsigned int]’ mincut.hpp:78:21: required from ‘typename boost::graph_traits::edges_size_type boost::min_cut(VertexListGraph&, OutputIterator, OutputIterator) [with VertexListGraph = R_adjacency_list; OutputIterator = std::back_insert_iterator >; typename graph_traits::edges_size_type = long unsigned int]’ mincut.cpp:128:35: required from here /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:65:52: warning: ‘this’ pointer is null [-Wnonnull] 65 | static void failed() { ((Model*)0)->constraints(); } | ~~~~~~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/property_map/property_map.hpp:179:10: note: in a call to non-static member function ‘void boost::WritablePropertyMapConcept::constraints() [with PMap = boost::default_color_type*; Key = long unsigned int]’ 179 | void constraints() { | ^~~~~~~~~~~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements >]’: /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:208:5: required from ‘struct boost::Convertible’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:206:3: required from ‘struct boost::ConvertibleConcept’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::ConvertibleConcept]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied >::value’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:72:8: [ skipping 6 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/breadth_first_search.hpp:66:5: required from ‘void boost::breadth_first_visit(const IncidenceGraph&, SourceIterator, SourceIterator, Buffer&, BFSVisitor, ColorMap) [with IncidenceGraph = filtered_graph > > >, no_property, listS>, is_residual_edge > > >, edge_residual_capacity_t> >, keep_all>; Buffer = queue > >; BFSVisitor = bfs_visitor*, on_tree_edge> >; ColorMap = default_color_type*; SourceIterator = long unsigned int*]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/breadth_first_search.hpp:136:24: required from ‘void boost::breadth_first_search(const VertexListGraph&, SourceIterator, SourceIterator, Buffer&, BFSVisitor, ColorMap) [with VertexListGraph = filtered_graph > > >, no_property, listS>, is_residual_edge > > >, edge_residual_capacity_t> >, keep_all>; SourceIterator = long unsigned int*; Buffer = queue > >; BFSVisitor = bfs_visitor*, on_tree_edge> >; ColorMap = default_color_type*]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/breadth_first_search.hpp:147:25: required from ‘void boost::breadth_first_search(const VertexListGraph&, typename graph_traits::vertex_descriptor, Buffer&, BFSVisitor, ColorMap) [with VertexListGraph = filtered_graph > > >, no_property, listS>, is_residual_edge > > >, edge_residual_capacity_t> >, keep_all>; Buffer = queue > >; BFSVisitor = bfs_visitor*, on_tree_edge> >; ColorMap = default_color_type*; typename graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/edmonds_karp_max_flow.hpp:101:29: required from ‘typename boost::property_traits::value_type boost::edmonds_karp_max_flow(Graph&, typename graph_traits::vertex_descriptor, typename graph_traits::vertex_descriptor, CapacityEdgeMap, ResidualCapacityEdgeMap, ReverseEdgeMap, ColorMap, PredEdgeMap) [with Graph = adjacency_list > > >, no_property, listS>; CapacityEdgeMap = adj_list_edge_property_map > > >, edge_capacity_t>; ResidualCapacityEdgeMap = adj_list_edge_property_map > > >, edge_residual_capacity_t>; ReverseEdgeMap = adj_list_edge_property_map, detail::edge_desc_impl&, long unsigned int, property > > >, edge_reverse_t>; ColorMap = default_color_type*; PredEdgeMap = detail::edge_desc_impl*; typename property_traits::value_type = long unsigned int; typename graph_traits::vertex_descriptor = long unsigned int]’ mincut.hpp:78:21: required from ‘typename boost::graph_traits::edges_size_type boost::min_cut(VertexListGraph&, OutputIterator, OutputIterator) [with VertexListGraph = R_adjacency_list; OutputIterator = std::back_insert_iterator >; typename graph_traits::edges_size_type = long unsigned int]’ mincut.cpp:128:35: required from here /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::Convertible]’ 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ^ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::ConvertibleConcept]’: /home/omnipath/local/R/4.4-3.20/BH/include/boost/property_map/property_map.hpp:208:7: required from ‘void boost::ReadWritePropertyMapConcept::constraints() [with PMap = boost::default_color_type*; Key = long unsigned int]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::ReadWritePropertyMapConcept]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied >::value’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_)>’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/breadth_first_search.hpp:66:5: required from ‘void boost::breadth_first_visit(const IncidenceGraph&, SourceIterator, SourceIterator, Buffer&, BFSVisitor, ColorMap) [with IncidenceGraph = filtered_graph > > >, no_property, listS>, is_residual_edge > > >, edge_residual_capacity_t> >, keep_all>; Buffer = queue > >; BFSVisitor = bfs_visitor*, on_tree_edge> >; ColorMap = default_color_type*; SourceIterator = long unsigned int*]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/breadth_first_search.hpp:136:24: required from ‘void boost::breadth_first_search(const VertexListGraph&, SourceIterator, SourceIterator, Buffer&, BFSVisitor, ColorMap) [with VertexListGraph = filtered_graph > > >, no_property, listS>, is_residual_edge > > >, edge_residual_capacity_t> >, keep_all>; SourceIterator = long unsigned int*; Buffer = queue > >; BFSVisitor = bfs_visitor*, on_tree_edge> >; ColorMap = default_color_type*]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/breadth_first_search.hpp:147:25: required from ‘void boost::breadth_first_search(const VertexListGraph&, typename graph_traits::vertex_descriptor, Buffer&, BFSVisitor, ColorMap) [with VertexListGraph = filtered_graph > > >, no_property, listS>, is_residual_edge > > >, edge_residual_capacity_t> >, keep_all>; Buffer = queue > >; BFSVisitor = bfs_visitor*, on_tree_edge> >; ColorMap = default_color_type*; typename graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/edmonds_karp_max_flow.hpp:101:29: required from ‘typename boost::property_traits::value_type boost::edmonds_karp_max_flow(Graph&, typename graph_traits::vertex_descriptor, typename graph_traits::vertex_descriptor, CapacityEdgeMap, ResidualCapacityEdgeMap, ReverseEdgeMap, ColorMap, PredEdgeMap) [with Graph = adjacency_list > > >, no_property, listS>; CapacityEdgeMap = adj_list_edge_property_map > > >, edge_capacity_t>; ResidualCapacityEdgeMap = adj_list_edge_property_map > > >, edge_residual_capacity_t>; ReverseEdgeMap = adj_list_edge_property_map, detail::edge_desc_impl&, long unsigned int, property > > >, edge_reverse_t>; ColorMap = default_color_type*; PredEdgeMap = detail::edge_desc_impl*; typename property_traits::value_type = long unsigned int; typename graph_traits::vertex_descriptor = long unsigned int]’ mincut.hpp:78:21: required from ‘typename boost::graph_traits::edges_size_type boost::min_cut(VertexListGraph&, OutputIterator, OutputIterator) [with VertexListGraph = R_adjacency_list; OutputIterator = std::back_insert_iterator >; typename graph_traits::edges_size_type = long unsigned int]’ mincut.cpp:128:35: required from here /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:206:17: note: in a call to non-static member function ‘boost::ConvertibleConcept::~ConvertibleConcept()’ 206 | BOOST_concept(Convertible,(X)(Y)) | ^~~~~~~~~~~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/preprocessor/cat.hpp:29:34: note: in definition of macro ‘BOOST_PP_CAT_I’ 29 | # define BOOST_PP_CAT_I(a, b) a ## b | ^ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/concept_def.hpp:23:12: note: in expansion of macro ‘BOOST_PP_CAT’ 23 | struct BOOST_PP_CAT(name,Concept) \ | ^~~~~~~~~~~~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:206:3: note: in expansion of macro ‘BOOST_concept’ 206 | BOOST_concept(Convertible,(X)(Y)) | ^~~~~~~~~~~~~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::SignedInteger]’: /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:514:9: required from ‘boost::InputIterator::~InputIterator() [with TT = __gnu_cxx::__normal_iterator*, std::vector, std::allocator > > >]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/usage.hpp:20:48: required from ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::InputIterator<__gnu_cxx::__normal_iterator*, std::vector, std::allocator > > > >]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements*, std::vector, std::allocator > > > > >]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:512:7: required from ‘struct boost::InputIterator<__gnu_cxx::__normal_iterator*, std::vector, std::allocator > > > >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:540:3: required from ‘struct boost::ForwardIterator<__gnu_cxx::__normal_iterator*, std::vector, std::allocator > > > >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:568:3: [ skipping 6 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_*, std::vector, std::allocator > > > >)>’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/property_map/property_map.hpp:354:5: required from ‘boost::iterator_property_map boost::make_iterator_property_map(RAIter, ID, Value) [with RAIter = __gnu_cxx::__normal_iterator*, std::vector, std::allocator > > >; Value = detail::edge_desc_impl; ID = vec_adj_list_vertex_id_map]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/edmonds_karp_max_flow.hpp:209:43: required from ‘static typename boost::detail::edge_capacity_value::type boost::detail::edmonds_karp_dispatch1::apply(Graph&, typename boost::graph_traits::vertex_descriptor, typename boost::graph_traits::vertex_descriptor, const boost::bgl_named_params&, boost::param_not_found) [with Graph = boost::adjacency_list > > > >; P = int; T = boost::buffer_param_t; R = boost::no_property; typename boost::detail::edge_capacity_value::type = double; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/edmonds_karp_max_flow.hpp:228:57: required from ‘typename boost::detail::edge_capacity_value::type boost::edmonds_karp_max_flow(Graph&, typename graph_traits::vertex_descriptor, typename graph_traits::vertex_descriptor, const bgl_named_params&) [with Graph = adjacency_list > > > >; P = int; T = buffer_param_t; R = no_property; typename detail::edge_capacity_value::type = double; typename graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/edmonds_karp_max_flow.hpp:240:33: required from ‘typename boost::property_traits::const_type>::value_type boost::edmonds_karp_max_flow(Graph&, typename graph_traits::vertex_descriptor, typename graph_traits::vertex_descriptor) [with Graph = adjacency_list > > > >; typename property_traits::const_type>::value_type = double; typename property_map::const_type = adj_list_edge_property_map > > >, edge_capacity_t>; typename graph_traits::vertex_descriptor = long unsigned int]’ mincut.cpp:76:45: required from here /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:107:22: note: in a call to non-static member function ‘boost::SignedInteger::~SignedInteger()’ 107 | template <> struct SignedInteger {}; | ^~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements >]’: /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:208:5: required from ‘struct boost::Convertible’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::Convertible]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied >::value’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_)>’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:515:9: [ skipping 11 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_*, std::vector, std::allocator > > > >)>’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/property_map/property_map.hpp:354:5: required from ‘boost::iterator_property_map boost::make_iterator_property_map(RAIter, ID, Value) [with RAIter = __gnu_cxx::__normal_iterator*, std::vector, std::allocator > > >; Value = detail::edge_desc_impl; ID = vec_adj_list_vertex_id_map]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/edmonds_karp_max_flow.hpp:209:43: required from ‘static typename boost::detail::edge_capacity_value::type boost::detail::edmonds_karp_dispatch1::apply(Graph&, typename boost::graph_traits::vertex_descriptor, typename boost::graph_traits::vertex_descriptor, const boost::bgl_named_params&, boost::param_not_found) [with Graph = boost::adjacency_list > > > >; P = int; T = boost::buffer_param_t; R = boost::no_property; typename boost::detail::edge_capacity_value::type = double; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/edmonds_karp_max_flow.hpp:228:57: required from ‘typename boost::detail::edge_capacity_value::type boost::edmonds_karp_max_flow(Graph&, typename graph_traits::vertex_descriptor, typename graph_traits::vertex_descriptor, const bgl_named_params&) [with Graph = adjacency_list > > > >; P = int; T = buffer_param_t; R = no_property; typename detail::edge_capacity_value::type = double; typename graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/edmonds_karp_max_flow.hpp:240:33: required from ‘typename boost::property_traits::const_type>::value_type boost::edmonds_karp_max_flow(Graph&, typename graph_traits::vertex_descriptor, typename graph_traits::vertex_descriptor) [with Graph = adjacency_list > > > >; typename property_traits::const_type>::value_type = double; typename property_map::const_type = adj_list_edge_property_map > > >, edge_capacity_t>; typename graph_traits::vertex_descriptor = long unsigned int]’ mincut.cpp:76:45: required from here /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::Convertible]’ 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ^ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::Convertible]’: /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:515:9: required from ‘boost::InputIterator::~InputIterator() [with TT = __gnu_cxx::__normal_iterator*, std::vector, std::allocator > > >]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/usage.hpp:20:48: required from ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::InputIterator<__gnu_cxx::__normal_iterator*, std::vector, std::allocator > > > >]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements*, std::vector, std::allocator > > > > >]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:512:7: required from ‘struct boost::InputIterator<__gnu_cxx::__normal_iterator*, std::vector, std::allocator > > > >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:540:3: required from ‘struct boost::ForwardIterator<__gnu_cxx::__normal_iterator*, std::vector, std::allocator > > > >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:568:3: [ skipping 6 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_*, std::vector, std::allocator > > > >)>’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/property_map/property_map.hpp:354:5: required from ‘boost::iterator_property_map boost::make_iterator_property_map(RAIter, ID, Value) [with RAIter = __gnu_cxx::__normal_iterator*, std::vector, std::allocator > > >; Value = detail::edge_desc_impl; ID = vec_adj_list_vertex_id_map]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/edmonds_karp_max_flow.hpp:209:43: required from ‘static typename boost::detail::edge_capacity_value::type boost::detail::edmonds_karp_dispatch1::apply(Graph&, typename boost::graph_traits::vertex_descriptor, typename boost::graph_traits::vertex_descriptor, const boost::bgl_named_params&, boost::param_not_found) [with Graph = boost::adjacency_list > > > >; P = int; T = boost::buffer_param_t; R = boost::no_property; typename boost::detail::edge_capacity_value::type = double; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/edmonds_karp_max_flow.hpp:228:57: required from ‘typename boost::detail::edge_capacity_value::type boost::edmonds_karp_max_flow(Graph&, typename graph_traits::vertex_descriptor, typename graph_traits::vertex_descriptor, const bgl_named_params&) [with Graph = adjacency_list > > > >; P = int; T = buffer_param_t; R = no_property; typename detail::edge_capacity_value::type = double; typename graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/edmonds_karp_max_flow.hpp:240:33: required from ‘typename boost::property_traits::const_type>::value_type boost::edmonds_karp_max_flow(Graph&, typename graph_traits::vertex_descriptor, typename graph_traits::vertex_descriptor) [with Graph = adjacency_list > > > >; typename property_traits::const_type>::value_type = double; typename property_map::const_type = adj_list_edge_property_map > > >, edge_capacity_t>; typename graph_traits::vertex_descriptor = long unsigned int]’ mincut.cpp:76:45: required from here /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::Convertible::~Convertible() [with X = std::random_access_iterator_tag; Y = std::input_iterator_tag]’ 37 | ~model() | ^ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:208:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 208 | BOOST_CONCEPT_USAGE(Convertible) { | ^~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements >]’: /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:208:5: required from ‘struct boost::Convertible’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::Convertible]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied >::value’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_)>’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:545:11: [ skipping 10 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_*, std::vector, std::allocator > > > >)>’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/property_map/property_map.hpp:354:5: required from ‘boost::iterator_property_map boost::make_iterator_property_map(RAIter, ID, Value) [with RAIter = __gnu_cxx::__normal_iterator*, std::vector, std::allocator > > >; Value = detail::edge_desc_impl; ID = vec_adj_list_vertex_id_map]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/edmonds_karp_max_flow.hpp:209:43: required from ‘static typename boost::detail::edge_capacity_value::type boost::detail::edmonds_karp_dispatch1::apply(Graph&, typename boost::graph_traits::vertex_descriptor, typename boost::graph_traits::vertex_descriptor, const boost::bgl_named_params&, boost::param_not_found) [with Graph = boost::adjacency_list > > > >; P = int; T = boost::buffer_param_t; R = boost::no_property; typename boost::detail::edge_capacity_value::type = double; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/edmonds_karp_max_flow.hpp:228:57: required from ‘typename boost::detail::edge_capacity_value::type boost::edmonds_karp_max_flow(Graph&, typename graph_traits::vertex_descriptor, typename graph_traits::vertex_descriptor, const bgl_named_params&) [with Graph = adjacency_list > > > >; P = int; T = buffer_param_t; R = no_property; typename detail::edge_capacity_value::type = double; typename graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/edmonds_karp_max_flow.hpp:240:33: required from ‘typename boost::property_traits::const_type>::value_type boost::edmonds_karp_max_flow(Graph&, typename graph_traits::vertex_descriptor, typename graph_traits::vertex_descriptor) [with Graph = adjacency_list > > > >; typename property_traits::const_type>::value_type = double; typename property_map::const_type = adj_list_edge_property_map > > >, edge_capacity_t>; typename graph_traits::vertex_descriptor = long unsigned int]’ mincut.cpp:76:45: required from here /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::Convertible]’ 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ^ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::Convertible]’: /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:545:11: required from ‘boost::ForwardIterator::~ForwardIterator() [with TT = __gnu_cxx::__normal_iterator*, std::vector, std::allocator > > >]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/usage.hpp:20:48: required from ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::ForwardIterator<__gnu_cxx::__normal_iterator*, std::vector, std::allocator > > > >]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements*, std::vector, std::allocator > > > > >]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:543:7: required from ‘struct boost::ForwardIterator<__gnu_cxx::__normal_iterator*, std::vector, std::allocator > > > >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:568:3: required from ‘struct boost::BidirectionalIterator<__gnu_cxx::__normal_iterator*, std::vector, std::allocator > > > >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:597:3: [ skipping 5 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_*, std::vector, std::allocator > > > >)>’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/property_map/property_map.hpp:354:5: required from ‘boost::iterator_property_map boost::make_iterator_property_map(RAIter, ID, Value) [with RAIter = __gnu_cxx::__normal_iterator*, std::vector, std::allocator > > >; Value = detail::edge_desc_impl; ID = vec_adj_list_vertex_id_map]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/edmonds_karp_max_flow.hpp:209:43: required from ‘static typename boost::detail::edge_capacity_value::type boost::detail::edmonds_karp_dispatch1::apply(Graph&, typename boost::graph_traits::vertex_descriptor, typename boost::graph_traits::vertex_descriptor, const boost::bgl_named_params&, boost::param_not_found) [with Graph = boost::adjacency_list > > > >; P = int; T = boost::buffer_param_t; R = boost::no_property; typename boost::detail::edge_capacity_value::type = double; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/edmonds_karp_max_flow.hpp:228:57: required from ‘typename boost::detail::edge_capacity_value::type boost::edmonds_karp_max_flow(Graph&, typename graph_traits::vertex_descriptor, typename graph_traits::vertex_descriptor, const bgl_named_params&) [with Graph = adjacency_list > > > >; P = int; T = buffer_param_t; R = no_property; typename detail::edge_capacity_value::type = double; typename graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/edmonds_karp_max_flow.hpp:240:33: required from ‘typename boost::property_traits::const_type>::value_type boost::edmonds_karp_max_flow(Graph&, typename graph_traits::vertex_descriptor, typename graph_traits::vertex_descriptor) [with Graph = adjacency_list > > > >; typename property_traits::const_type>::value_type = double; typename property_map::const_type = adj_list_edge_property_map > > >, edge_capacity_t>; typename graph_traits::vertex_descriptor = long unsigned int]’ mincut.cpp:76:45: required from here /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::Convertible::~Convertible() [with X = std::random_access_iterator_tag; Y = std::forward_iterator_tag]’ 37 | ~model() | ^ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:208:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 208 | BOOST_CONCEPT_USAGE(Convertible) { | ^~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements >]’: /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:208:5: required from ‘struct boost::Convertible’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::Convertible]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied >::value’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_)>’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:573:11: [ skipping 9 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_*, std::vector, std::allocator > > > >)>’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/property_map/property_map.hpp:354:5: required from ‘boost::iterator_property_map boost::make_iterator_property_map(RAIter, ID, Value) [with RAIter = __gnu_cxx::__normal_iterator*, std::vector, std::allocator > > >; Value = detail::edge_desc_impl; ID = vec_adj_list_vertex_id_map]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/edmonds_karp_max_flow.hpp:209:43: required from ‘static typename boost::detail::edge_capacity_value::type boost::detail::edmonds_karp_dispatch1::apply(Graph&, typename boost::graph_traits::vertex_descriptor, typename boost::graph_traits::vertex_descriptor, const boost::bgl_named_params&, boost::param_not_found) [with Graph = boost::adjacency_list > > > >; P = int; T = boost::buffer_param_t; R = boost::no_property; typename boost::detail::edge_capacity_value::type = double; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/edmonds_karp_max_flow.hpp:228:57: required from ‘typename boost::detail::edge_capacity_value::type boost::edmonds_karp_max_flow(Graph&, typename graph_traits::vertex_descriptor, typename graph_traits::vertex_descriptor, const bgl_named_params&) [with Graph = adjacency_list > > > >; P = int; T = buffer_param_t; R = no_property; typename detail::edge_capacity_value::type = double; typename graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/edmonds_karp_max_flow.hpp:240:33: required from ‘typename boost::property_traits::const_type>::value_type boost::edmonds_karp_max_flow(Graph&, typename graph_traits::vertex_descriptor, typename graph_traits::vertex_descriptor) [with Graph = adjacency_list > > > >; typename property_traits::const_type>::value_type = double; typename property_map::const_type = adj_list_edge_property_map > > >, edge_capacity_t>; typename graph_traits::vertex_descriptor = long unsigned int]’ mincut.cpp:76:45: required from here /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::Convertible]’ 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ^ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::Convertible]’: /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:573:11: required from ‘boost::BidirectionalIterator::~BidirectionalIterator() [with TT = __gnu_cxx::__normal_iterator*, std::vector, std::allocator > > >]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/usage.hpp:20:48: required from ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::BidirectionalIterator<__gnu_cxx::__normal_iterator*, std::vector, std::allocator > > > >]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements*, std::vector, std::allocator > > > > >]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:571:7: required from ‘struct boost::BidirectionalIterator<__gnu_cxx::__normal_iterator*, std::vector, std::allocator > > > >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:597:3: required from ‘struct boost::RandomAccessIterator<__gnu_cxx::__normal_iterator*, std::vector, std::allocator > > > >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:597:3: [ skipping 4 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_*, std::vector, std::allocator > > > >)>’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/property_map/property_map.hpp:354:5: required from ‘boost::iterator_property_map boost::make_iterator_property_map(RAIter, ID, Value) [with RAIter = __gnu_cxx::__normal_iterator*, std::vector, std::allocator > > >; Value = detail::edge_desc_impl; ID = vec_adj_list_vertex_id_map]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/edmonds_karp_max_flow.hpp:209:43: required from ‘static typename boost::detail::edge_capacity_value::type boost::detail::edmonds_karp_dispatch1::apply(Graph&, typename boost::graph_traits::vertex_descriptor, typename boost::graph_traits::vertex_descriptor, const boost::bgl_named_params&, boost::param_not_found) [with Graph = boost::adjacency_list > > > >; P = int; T = boost::buffer_param_t; R = boost::no_property; typename boost::detail::edge_capacity_value::type = double; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/edmonds_karp_max_flow.hpp:228:57: required from ‘typename boost::detail::edge_capacity_value::type boost::edmonds_karp_max_flow(Graph&, typename graph_traits::vertex_descriptor, typename graph_traits::vertex_descriptor, const bgl_named_params&) [with Graph = adjacency_list > > > >; P = int; T = buffer_param_t; R = no_property; typename detail::edge_capacity_value::type = double; typename graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/edmonds_karp_max_flow.hpp:240:33: required from ‘typename boost::property_traits::const_type>::value_type boost::edmonds_karp_max_flow(Graph&, typename graph_traits::vertex_descriptor, typename graph_traits::vertex_descriptor) [with Graph = adjacency_list > > > >; typename property_traits::const_type>::value_type = double; typename property_map::const_type = adj_list_edge_property_map > > >, edge_capacity_t>; typename graph_traits::vertex_descriptor = long unsigned int]’ mincut.cpp:76:45: required from here /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::Convertible::~Convertible() [with X = std::random_access_iterator_tag; Y = std::bidirectional_iterator_tag]’ 37 | ~model() | ^ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:208:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 208 | BOOST_CONCEPT_USAGE(Convertible) { | ^~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::Convertible]’: /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements >]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:208:5: required from ‘struct boost::Convertible’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::Convertible]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied >::value’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:72:8: [ skipping 2 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:597:3: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator*, std::vector, std::allocator > > > >]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/property_map/property_map.hpp:354:5: required from ‘boost::iterator_property_map boost::make_iterator_property_map(RAIter, ID, Value) [with RAIter = __gnu_cxx::__normal_iterator*, std::vector, std::allocator > > >; Value = detail::edge_desc_impl; ID = vec_adj_list_vertex_id_map]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/edmonds_karp_max_flow.hpp:209:43: required from ‘static typename boost::detail::edge_capacity_value::type boost::detail::edmonds_karp_dispatch1::apply(Graph&, typename boost::graph_traits::vertex_descriptor, typename boost::graph_traits::vertex_descriptor, const boost::bgl_named_params&, boost::param_not_found) [with Graph = boost::adjacency_list > > > >; P = int; T = boost::buffer_param_t; R = boost::no_property; typename boost::detail::edge_capacity_value::type = double; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/edmonds_karp_max_flow.hpp:228:57: required from ‘typename boost::detail::edge_capacity_value::type boost::edmonds_karp_max_flow(Graph&, typename graph_traits::vertex_descriptor, typename graph_traits::vertex_descriptor, const bgl_named_params&) [with Graph = adjacency_list > > > >; P = int; T = buffer_param_t; R = no_property; typename detail::edge_capacity_value::type = double; typename graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/edmonds_karp_max_flow.hpp:240:33: required from ‘typename boost::property_traits::const_type>::value_type boost::edmonds_karp_max_flow(Graph&, typename graph_traits::vertex_descriptor, typename graph_traits::vertex_descriptor) [with Graph = adjacency_list > > > >; typename property_traits::const_type>::value_type = double; typename property_map::const_type = adj_list_edge_property_map > > >, edge_capacity_t>; typename graph_traits::vertex_descriptor = long unsigned int]’ mincut.cpp:76:45: required from here /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::Convertible::~Convertible() [with X = std::random_access_iterator_tag; Y = std::random_access_iterator_tag]’ 37 | ~model() | ^ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:208:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 208 | BOOST_CONCEPT_USAGE(Convertible) { | ^~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements > > >, boost::edge_residual_capacity_t> >, boost::keep_all, boost::filtered_graph > > >, boost::no_property, boost::listS>, boost::is_residual_edge > > >, boost::edge_residual_capacity_t> >, boost::keep_all> >, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > > > >*, std::vector > > > >, std::allocator > > > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > > >]’: /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/graph_concepts.hpp:52:50: required from ‘struct boost::concepts::MultiPassInputIterator > > >, boost::edge_residual_capacity_t> >, boost::keep_all, boost::filtered_graph > > >, boost::no_property, boost::listS>, boost::is_residual_edge > > >, boost::edge_residual_capacity_t> >, boost::keep_all> >, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > > > >*, std::vector > > > >, std::allocator > > > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::concepts::MultiPassInputIterator > > >, boost::edge_residual_capacity_t> >, boost::keep_all, boost::filtered_graph > > >, boost::no_property, boost::listS>, boost::is_residual_edge > > >, boost::edge_residual_capacity_t> >, boost::keep_all> >, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > > > >*, std::vector > > > >, std::allocator > > > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied > > >, boost::edge_residual_capacity_t> >, boost::keep_all, boost::filtered_graph > > >, boost::no_property, boost::listS>, boost::is_residual_edge > > >, boost::edge_residual_capacity_t> >, boost::keep_all> >, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > > > >*, std::vector > > > >, std::allocator > > > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > > >::value’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied > > >, boost::edge_residual_capacity_t> >, boost::keep_all, boost::filtered_graph > > >, boost::no_property, boost::listS>, boost::is_residual_edge > > >, boost::edge_residual_capacity_t> >, boost::keep_all> >, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > > > >*, std::vector > > > >, std::allocator > > > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > > >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_ > > >, boost::edge_residual_capacity_t> >, boost::keep_all, boost::filtered_graph > > >, boost::no_property, boost::listS>, boost::is_residual_edge > > >, boost::edge_residual_capacity_t> >, boost::keep_all> >, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > > > >*, std::vector > > > >, std::allocator > > > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >)>’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/graph_concepts.hpp:89:9: [ skipping 2 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/breadth_first_search.hpp:62:5: required from ‘void boost::breadth_first_visit(const IncidenceGraph&, SourceIterator, SourceIterator, Buffer&, BFSVisitor, ColorMap) [with IncidenceGraph = filtered_graph > > >, no_property, listS>, is_residual_edge > > >, edge_residual_capacity_t> >, keep_all>; Buffer = queue > >; BFSVisitor = bfs_visitor*, on_tree_edge> >; ColorMap = default_color_type*; SourceIterator = long unsigned int*]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/breadth_first_search.hpp:136:24: required from ‘void boost::breadth_first_search(const VertexListGraph&, SourceIterator, SourceIterator, Buffer&, BFSVisitor, ColorMap) [with VertexListGraph = filtered_graph > > >, no_property, listS>, is_residual_edge > > >, edge_residual_capacity_t> >, keep_all>; SourceIterator = long unsigned int*; Buffer = queue > >; BFSVisitor = bfs_visitor*, on_tree_edge> >; ColorMap = default_color_type*]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/breadth_first_search.hpp:147:25: required from ‘void boost::breadth_first_search(const VertexListGraph&, typename graph_traits::vertex_descriptor, Buffer&, BFSVisitor, ColorMap) [with VertexListGraph = filtered_graph > > >, no_property, listS>, is_residual_edge > > >, edge_residual_capacity_t> >, keep_all>; Buffer = queue > >; BFSVisitor = bfs_visitor*, on_tree_edge> >; ColorMap = default_color_type*; typename graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/edmonds_karp_max_flow.hpp:101:29: required from ‘typename boost::property_traits::value_type boost::edmonds_karp_max_flow(Graph&, typename graph_traits::vertex_descriptor, typename graph_traits::vertex_descriptor, CapacityEdgeMap, ResidualCapacityEdgeMap, ReverseEdgeMap, ColorMap, PredEdgeMap) [with Graph = adjacency_list > > >, no_property, listS>; CapacityEdgeMap = adj_list_edge_property_map > > >, edge_capacity_t>; ResidualCapacityEdgeMap = adj_list_edge_property_map > > >, edge_residual_capacity_t>; ReverseEdgeMap = adj_list_edge_property_map, detail::edge_desc_impl&, long unsigned int, property > > >, edge_reverse_t>; ColorMap = default_color_type*; PredEdgeMap = detail::edge_desc_impl*; typename property_traits::value_type = long unsigned int; typename graph_traits::vertex_descriptor = long unsigned int]’ mincut.hpp:78:21: required from ‘typename boost::graph_traits::edges_size_type boost::min_cut(VertexListGraph&, OutputIterator, OutputIterator) [with VertexListGraph = R_adjacency_list; OutputIterator = std::back_insert_iterator >; typename graph_traits::edges_size_type = long unsigned int]’ mincut.cpp:128:35: required from here /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::concepts::MultiPassInputIterator > > >, boost::edge_residual_capacity_t> >, boost::keep_all, boost::filtered_graph > > >, boost::no_property, boost::listS>, boost::is_residual_edge > > >, boost::edge_residual_capacity_t> >, boost::keep_all> >, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > > > >*, std::vector > > > >, std::allocator > > > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >]’ 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ^ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::MultiPassInputIterator > > >, boost::edge_residual_capacity_t> >, boost::keep_all, boost::filtered_graph > > >, boost::no_property, boost::listS>, boost::is_residual_edge > > >, boost::edge_residual_capacity_t> >, boost::keep_all> >, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > > > >*, std::vector > > > >, std::allocator > > > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >]’: /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/graph_concepts.hpp:89:9: required from ‘boost::concepts::IncidenceGraph::~IncidenceGraph() [with G = boost::filtered_graph > > >, boost::no_property, boost::listS>, boost::is_residual_edge > > >, boost::edge_residual_capacity_t> >, boost::keep_all>]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/graph_concepts.hpp:75:1: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::IncidenceGraphConcept > > >, boost::no_property, boost::listS>, boost::is_residual_edge > > >, boost::edge_residual_capacity_t> >, boost::keep_all> >]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/breadth_first_search.hpp:62:5: required from ‘void boost::breadth_first_visit(const IncidenceGraph&, SourceIterator, SourceIterator, Buffer&, BFSVisitor, ColorMap) [with IncidenceGraph = filtered_graph > > >, no_property, listS>, is_residual_edge > > >, edge_residual_capacity_t> >, keep_all>; Buffer = queue > >; BFSVisitor = bfs_visitor*, on_tree_edge> >; ColorMap = default_color_type*; SourceIterator = long unsigned int*]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/breadth_first_search.hpp:136:24: required from ‘void boost::breadth_first_search(const VertexListGraph&, SourceIterator, SourceIterator, Buffer&, BFSVisitor, ColorMap) [with VertexListGraph = filtered_graph > > >, no_property, listS>, is_residual_edge > > >, edge_residual_capacity_t> >, keep_all>; SourceIterator = long unsigned int*; Buffer = queue > >; BFSVisitor = bfs_visitor*, on_tree_edge> >; ColorMap = default_color_type*]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/breadth_first_search.hpp:147:25: required from ‘void boost::breadth_first_search(const VertexListGraph&, typename graph_traits::vertex_descriptor, Buffer&, BFSVisitor, ColorMap) [with VertexListGraph = filtered_graph > > >, no_property, listS>, is_residual_edge > > >, edge_residual_capacity_t> >, keep_all>; Buffer = queue > >; BFSVisitor = bfs_visitor*, on_tree_edge> >; ColorMap = default_color_type*; typename graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/edmonds_karp_max_flow.hpp:101:29: required from ‘typename boost::property_traits::value_type boost::edmonds_karp_max_flow(Graph&, typename graph_traits::vertex_descriptor, typename graph_traits::vertex_descriptor, CapacityEdgeMap, ResidualCapacityEdgeMap, ReverseEdgeMap, ColorMap, PredEdgeMap) [with Graph = adjacency_list > > >, no_property, listS>; CapacityEdgeMap = adj_list_edge_property_map > > >, edge_capacity_t>; ResidualCapacityEdgeMap = adj_list_edge_property_map > > >, edge_residual_capacity_t>; ReverseEdgeMap = adj_list_edge_property_map, detail::edge_desc_impl&, long unsigned int, property > > >, edge_reverse_t>; ColorMap = default_color_type*; PredEdgeMap = detail::edge_desc_impl*; typename property_traits::value_type = long unsigned int; typename graph_traits::vertex_descriptor = long unsigned int]’ mincut.hpp:78:21: required from ‘typename boost::graph_traits::edges_size_type boost::min_cut(VertexListGraph&, OutputIterator, OutputIterator) [with VertexListGraph = R_adjacency_list; OutputIterator = std::back_insert_iterator >; typename graph_traits::edges_size_type = long unsigned int]’ mincut.cpp:128:35: required from here /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::concepts::MultiPassInputIterator::~MultiPassInputIterator() [with T = boost::iterators::filter_iterator > > >, boost::edge_residual_capacity_t> >, boost::keep_all, boost::filtered_graph > > >, boost::no_property, boost::listS>, boost::is_residual_edge > > >, boost::edge_residual_capacity_t> >, boost::keep_all> >, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > > > >*, std::vector > > > >, std::allocator > > > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> >]’ 37 | ~model() | ^ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/graph_concepts.hpp:52:50: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 52 | BOOST_concept(MultiPassInputIterator, (T)) { BOOST_CONCEPT_USAGE( | ^~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements > >]’: /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:137:5: required from ‘struct boost::DefaultConstructible >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::DefaultConstructible >]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied > >::value’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied > >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_ >)>’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/graph_concepts.hpp:90:9: [ skipping 2 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/breadth_first_search.hpp:62:5: required from ‘void boost::breadth_first_visit(const IncidenceGraph&, SourceIterator, SourceIterator, Buffer&, BFSVisitor, ColorMap) [with IncidenceGraph = filtered_graph > > >, no_property, listS>, is_residual_edge > > >, edge_residual_capacity_t> >, keep_all>; Buffer = queue > >; BFSVisitor = bfs_visitor*, on_tree_edge> >; ColorMap = default_color_type*; SourceIterator = long unsigned int*]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/breadth_first_search.hpp:136:24: required from ‘void boost::breadth_first_search(const VertexListGraph&, SourceIterator, SourceIterator, Buffer&, BFSVisitor, ColorMap) [with VertexListGraph = filtered_graph > > >, no_property, listS>, is_residual_edge > > >, edge_residual_capacity_t> >, keep_all>; SourceIterator = long unsigned int*; Buffer = queue > >; BFSVisitor = bfs_visitor*, on_tree_edge> >; ColorMap = default_color_type*]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/breadth_first_search.hpp:147:25: required from ‘void boost::breadth_first_search(const VertexListGraph&, typename graph_traits::vertex_descriptor, Buffer&, BFSVisitor, ColorMap) [with VertexListGraph = filtered_graph > > >, no_property, listS>, is_residual_edge > > >, edge_residual_capacity_t> >, keep_all>; Buffer = queue > >; BFSVisitor = bfs_visitor*, on_tree_edge> >; ColorMap = default_color_type*; typename graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/edmonds_karp_max_flow.hpp:101:29: required from ‘typename boost::property_traits::value_type boost::edmonds_karp_max_flow(Graph&, typename graph_traits::vertex_descriptor, typename graph_traits::vertex_descriptor, CapacityEdgeMap, ResidualCapacityEdgeMap, ReverseEdgeMap, ColorMap, PredEdgeMap) [with Graph = adjacency_list > > >, no_property, listS>; CapacityEdgeMap = adj_list_edge_property_map > > >, edge_capacity_t>; ResidualCapacityEdgeMap = adj_list_edge_property_map > > >, edge_residual_capacity_t>; ReverseEdgeMap = adj_list_edge_property_map, detail::edge_desc_impl&, long unsigned int, property > > >, edge_reverse_t>; ColorMap = default_color_type*; PredEdgeMap = detail::edge_desc_impl*; typename property_traits::value_type = long unsigned int; typename graph_traits::vertex_descriptor = long unsigned int]’ mincut.hpp:78:21: required from ‘typename boost::graph_traits::edges_size_type boost::min_cut(VertexListGraph&, OutputIterator, OutputIterator) [with VertexListGraph = R_adjacency_list; OutputIterator = std::back_insert_iterator >; typename graph_traits::edges_size_type = long unsigned int]’ mincut.cpp:128:35: required from here /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::DefaultConstructible >]’ 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ^ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::DefaultConstructible >]’: /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/graph_concepts.hpp:90:9: required from ‘boost::concepts::IncidenceGraph::~IncidenceGraph() [with G = boost::filtered_graph > > >, boost::no_property, boost::listS>, boost::is_residual_edge > > >, boost::edge_residual_capacity_t> >, boost::keep_all>]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/graph_concepts.hpp:75:1: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::IncidenceGraphConcept > > >, boost::no_property, boost::listS>, boost::is_residual_edge > > >, boost::edge_residual_capacity_t> >, boost::keep_all> >]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/breadth_first_search.hpp:62:5: required from ‘void boost::breadth_first_visit(const IncidenceGraph&, SourceIterator, SourceIterator, Buffer&, BFSVisitor, ColorMap) [with IncidenceGraph = filtered_graph > > >, no_property, listS>, is_residual_edge > > >, edge_residual_capacity_t> >, keep_all>; Buffer = queue > >; BFSVisitor = bfs_visitor*, on_tree_edge> >; ColorMap = default_color_type*; SourceIterator = long unsigned int*]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/breadth_first_search.hpp:136:24: required from ‘void boost::breadth_first_search(const VertexListGraph&, SourceIterator, SourceIterator, Buffer&, BFSVisitor, ColorMap) [with VertexListGraph = filtered_graph > > >, no_property, listS>, is_residual_edge > > >, edge_residual_capacity_t> >, keep_all>; SourceIterator = long unsigned int*; Buffer = queue > >; BFSVisitor = bfs_visitor*, on_tree_edge> >; ColorMap = default_color_type*]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/breadth_first_search.hpp:147:25: required from ‘void boost::breadth_first_search(const VertexListGraph&, typename graph_traits::vertex_descriptor, Buffer&, BFSVisitor, ColorMap) [with VertexListGraph = filtered_graph > > >, no_property, listS>, is_residual_edge > > >, edge_residual_capacity_t> >, keep_all>; Buffer = queue > >; BFSVisitor = bfs_visitor*, on_tree_edge> >; ColorMap = default_color_type*; typename graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/edmonds_karp_max_flow.hpp:101:29: required from ‘typename boost::property_traits::value_type boost::edmonds_karp_max_flow(Graph&, typename graph_traits::vertex_descriptor, typename graph_traits::vertex_descriptor, CapacityEdgeMap, ResidualCapacityEdgeMap, ReverseEdgeMap, ColorMap, PredEdgeMap) [with Graph = adjacency_list > > >, no_property, listS>; CapacityEdgeMap = adj_list_edge_property_map > > >, edge_capacity_t>; ResidualCapacityEdgeMap = adj_list_edge_property_map > > >, edge_residual_capacity_t>; ReverseEdgeMap = adj_list_edge_property_map, detail::edge_desc_impl&, long unsigned int, property > > >, edge_reverse_t>; ColorMap = default_color_type*; PredEdgeMap = detail::edge_desc_impl*; typename property_traits::value_type = long unsigned int; typename graph_traits::vertex_descriptor = long unsigned int]’ mincut.hpp:78:21: required from ‘typename boost::graph_traits::edges_size_type boost::min_cut(VertexListGraph&, OutputIterator, OutputIterator) [with VertexListGraph = R_adjacency_list; OutputIterator = std::back_insert_iterator >; typename graph_traits::edges_size_type = long unsigned int]’ mincut.cpp:128:35: required from here /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::DefaultConstructible::~DefaultConstructible() [with TT = boost::detail::edge_desc_impl]’ 37 | ~model() | ^ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:137:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 137 | BOOST_CONCEPT_USAGE(DefaultConstructible) { | ^~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements > >]’: /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:233:5: required from ‘struct boost::EqualityComparable >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::EqualityComparable >]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied > >::value’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied > >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_ >)>’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/graph_concepts.hpp:91:9: [ skipping 2 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/breadth_first_search.hpp:62:5: required from ‘void boost::breadth_first_visit(const IncidenceGraph&, SourceIterator, SourceIterator, Buffer&, BFSVisitor, ColorMap) [with IncidenceGraph = filtered_graph > > >, no_property, listS>, is_residual_edge > > >, edge_residual_capacity_t> >, keep_all>; Buffer = queue > >; BFSVisitor = bfs_visitor*, on_tree_edge> >; ColorMap = default_color_type*; SourceIterator = long unsigned int*]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/breadth_first_search.hpp:136:24: required from ‘void boost::breadth_first_search(const VertexListGraph&, SourceIterator, SourceIterator, Buffer&, BFSVisitor, ColorMap) [with VertexListGraph = filtered_graph > > >, no_property, listS>, is_residual_edge > > >, edge_residual_capacity_t> >, keep_all>; SourceIterator = long unsigned int*; Buffer = queue > >; BFSVisitor = bfs_visitor*, on_tree_edge> >; ColorMap = default_color_type*]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/breadth_first_search.hpp:147:25: required from ‘void boost::breadth_first_search(const VertexListGraph&, typename graph_traits::vertex_descriptor, Buffer&, BFSVisitor, ColorMap) [with VertexListGraph = filtered_graph > > >, no_property, listS>, is_residual_edge > > >, edge_residual_capacity_t> >, keep_all>; Buffer = queue > >; BFSVisitor = bfs_visitor*, on_tree_edge> >; ColorMap = default_color_type*; typename graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/edmonds_karp_max_flow.hpp:101:29: required from ‘typename boost::property_traits::value_type boost::edmonds_karp_max_flow(Graph&, typename graph_traits::vertex_descriptor, typename graph_traits::vertex_descriptor, CapacityEdgeMap, ResidualCapacityEdgeMap, ReverseEdgeMap, ColorMap, PredEdgeMap) [with Graph = adjacency_list > > >, no_property, listS>; CapacityEdgeMap = adj_list_edge_property_map > > >, edge_capacity_t>; ResidualCapacityEdgeMap = adj_list_edge_property_map > > >, edge_residual_capacity_t>; ReverseEdgeMap = adj_list_edge_property_map, detail::edge_desc_impl&, long unsigned int, property > > >, edge_reverse_t>; ColorMap = default_color_type*; PredEdgeMap = detail::edge_desc_impl*; typename property_traits::value_type = long unsigned int; typename graph_traits::vertex_descriptor = long unsigned int]’ mincut.hpp:78:21: required from ‘typename boost::graph_traits::edges_size_type boost::min_cut(VertexListGraph&, OutputIterator, OutputIterator) [with VertexListGraph = R_adjacency_list; OutputIterator = std::back_insert_iterator >; typename graph_traits::edges_size_type = long unsigned int]’ mincut.cpp:128:35: required from here /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::EqualityComparable >]’ 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ^ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::EqualityComparable >]’: /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/graph_concepts.hpp:91:9: required from ‘boost::concepts::IncidenceGraph::~IncidenceGraph() [with G = boost::filtered_graph > > >, boost::no_property, boost::listS>, boost::is_residual_edge > > >, boost::edge_residual_capacity_t> >, boost::keep_all>]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/graph_concepts.hpp:75:1: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::IncidenceGraphConcept > > >, boost::no_property, boost::listS>, boost::is_residual_edge > > >, boost::edge_residual_capacity_t> >, boost::keep_all> >]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/breadth_first_search.hpp:62:5: required from ‘void boost::breadth_first_visit(const IncidenceGraph&, SourceIterator, SourceIterator, Buffer&, BFSVisitor, ColorMap) [with IncidenceGraph = filtered_graph > > >, no_property, listS>, is_residual_edge > > >, edge_residual_capacity_t> >, keep_all>; Buffer = queue > >; BFSVisitor = bfs_visitor*, on_tree_edge> >; ColorMap = default_color_type*; SourceIterator = long unsigned int*]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/breadth_first_search.hpp:136:24: required from ‘void boost::breadth_first_search(const VertexListGraph&, SourceIterator, SourceIterator, Buffer&, BFSVisitor, ColorMap) [with VertexListGraph = filtered_graph > > >, no_property, listS>, is_residual_edge > > >, edge_residual_capacity_t> >, keep_all>; SourceIterator = long unsigned int*; Buffer = queue > >; BFSVisitor = bfs_visitor*, on_tree_edge> >; ColorMap = default_color_type*]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/breadth_first_search.hpp:147:25: required from ‘void boost::breadth_first_search(const VertexListGraph&, typename graph_traits::vertex_descriptor, Buffer&, BFSVisitor, ColorMap) [with VertexListGraph = filtered_graph > > >, no_property, listS>, is_residual_edge > > >, edge_residual_capacity_t> >, keep_all>; Buffer = queue > >; BFSVisitor = bfs_visitor*, on_tree_edge> >; ColorMap = default_color_type*; typename graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/edmonds_karp_max_flow.hpp:101:29: required from ‘typename boost::property_traits::value_type boost::edmonds_karp_max_flow(Graph&, typename graph_traits::vertex_descriptor, typename graph_traits::vertex_descriptor, CapacityEdgeMap, ResidualCapacityEdgeMap, ReverseEdgeMap, ColorMap, PredEdgeMap) [with Graph = adjacency_list > > >, no_property, listS>; CapacityEdgeMap = adj_list_edge_property_map > > >, edge_capacity_t>; ResidualCapacityEdgeMap = adj_list_edge_property_map > > >, edge_residual_capacity_t>; ReverseEdgeMap = adj_list_edge_property_map, detail::edge_desc_impl&, long unsigned int, property > > >, edge_reverse_t>; ColorMap = default_color_type*; PredEdgeMap = detail::edge_desc_impl*; typename property_traits::value_type = long unsigned int; typename graph_traits::vertex_descriptor = long unsigned int]’ mincut.hpp:78:21: required from ‘typename boost::graph_traits::edges_size_type boost::min_cut(VertexListGraph&, OutputIterator, OutputIterator) [with VertexListGraph = R_adjacency_list; OutputIterator = std::back_insert_iterator >; typename graph_traits::edges_size_type = long unsigned int]’ mincut.cpp:128:35: required from here /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::EqualityComparable::~EqualityComparable() [with TT = boost::detail::edge_desc_impl]’ 37 | ~model() | ^ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:233:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 233 | BOOST_CONCEPT_USAGE(EqualityComparable) { | ^~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements > >]’: /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:145:5: required from ‘struct boost::Assignable >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::Assignable >]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied > >::value’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied > >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_ >)>’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/graph_concepts.hpp:92:9: [ skipping 2 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/breadth_first_search.hpp:62:5: required from ‘void boost::breadth_first_visit(const IncidenceGraph&, SourceIterator, SourceIterator, Buffer&, BFSVisitor, ColorMap) [with IncidenceGraph = filtered_graph > > >, no_property, listS>, is_residual_edge > > >, edge_residual_capacity_t> >, keep_all>; Buffer = queue > >; BFSVisitor = bfs_visitor*, on_tree_edge> >; ColorMap = default_color_type*; SourceIterator = long unsigned int*]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/breadth_first_search.hpp:136:24: required from ‘void boost::breadth_first_search(const VertexListGraph&, SourceIterator, SourceIterator, Buffer&, BFSVisitor, ColorMap) [with VertexListGraph = filtered_graph > > >, no_property, listS>, is_residual_edge > > >, edge_residual_capacity_t> >, keep_all>; SourceIterator = long unsigned int*; Buffer = queue > >; BFSVisitor = bfs_visitor*, on_tree_edge> >; ColorMap = default_color_type*]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/breadth_first_search.hpp:147:25: required from ‘void boost::breadth_first_search(const VertexListGraph&, typename graph_traits::vertex_descriptor, Buffer&, BFSVisitor, ColorMap) [with VertexListGraph = filtered_graph > > >, no_property, listS>, is_residual_edge > > >, edge_residual_capacity_t> >, keep_all>; Buffer = queue > >; BFSVisitor = bfs_visitor*, on_tree_edge> >; ColorMap = default_color_type*; typename graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/edmonds_karp_max_flow.hpp:101:29: required from ‘typename boost::property_traits::value_type boost::edmonds_karp_max_flow(Graph&, typename graph_traits::vertex_descriptor, typename graph_traits::vertex_descriptor, CapacityEdgeMap, ResidualCapacityEdgeMap, ReverseEdgeMap, ColorMap, PredEdgeMap) [with Graph = adjacency_list > > >, no_property, listS>; CapacityEdgeMap = adj_list_edge_property_map > > >, edge_capacity_t>; ResidualCapacityEdgeMap = adj_list_edge_property_map > > >, edge_residual_capacity_t>; ReverseEdgeMap = adj_list_edge_property_map, detail::edge_desc_impl&, long unsigned int, property > > >, edge_reverse_t>; ColorMap = default_color_type*; PredEdgeMap = detail::edge_desc_impl*; typename property_traits::value_type = long unsigned int; typename graph_traits::vertex_descriptor = long unsigned int]’ mincut.hpp:78:21: required from ‘typename boost::graph_traits::edges_size_type boost::min_cut(VertexListGraph&, OutputIterator, OutputIterator) [with VertexListGraph = R_adjacency_list; OutputIterator = std::back_insert_iterator >; typename graph_traits::edges_size_type = long unsigned int]’ mincut.cpp:128:35: required from here /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::Assignable >]’ 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ^ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::Assignable >]’: /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/graph_concepts.hpp:92:9: required from ‘boost::concepts::IncidenceGraph::~IncidenceGraph() [with G = boost::filtered_graph > > >, boost::no_property, boost::listS>, boost::is_residual_edge > > >, boost::edge_residual_capacity_t> >, boost::keep_all>]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/graph_concepts.hpp:75:1: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::IncidenceGraphConcept > > >, boost::no_property, boost::listS>, boost::is_residual_edge > > >, boost::edge_residual_capacity_t> >, boost::keep_all> >]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/breadth_first_search.hpp:62:5: required from ‘void boost::breadth_first_visit(const IncidenceGraph&, SourceIterator, SourceIterator, Buffer&, BFSVisitor, ColorMap) [with IncidenceGraph = filtered_graph > > >, no_property, listS>, is_residual_edge > > >, edge_residual_capacity_t> >, keep_all>; Buffer = queue > >; BFSVisitor = bfs_visitor*, on_tree_edge> >; ColorMap = default_color_type*; SourceIterator = long unsigned int*]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/breadth_first_search.hpp:136:24: required from ‘void boost::breadth_first_search(const VertexListGraph&, SourceIterator, SourceIterator, Buffer&, BFSVisitor, ColorMap) [with VertexListGraph = filtered_graph > > >, no_property, listS>, is_residual_edge > > >, edge_residual_capacity_t> >, keep_all>; SourceIterator = long unsigned int*; Buffer = queue > >; BFSVisitor = bfs_visitor*, on_tree_edge> >; ColorMap = default_color_type*]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/breadth_first_search.hpp:147:25: required from ‘void boost::breadth_first_search(const VertexListGraph&, typename graph_traits::vertex_descriptor, Buffer&, BFSVisitor, ColorMap) [with VertexListGraph = filtered_graph > > >, no_property, listS>, is_residual_edge > > >, edge_residual_capacity_t> >, keep_all>; Buffer = queue > >; BFSVisitor = bfs_visitor*, on_tree_edge> >; ColorMap = default_color_type*; typename graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/edmonds_karp_max_flow.hpp:101:29: required from ‘typename boost::property_traits::value_type boost::edmonds_karp_max_flow(Graph&, typename graph_traits::vertex_descriptor, typename graph_traits::vertex_descriptor, CapacityEdgeMap, ResidualCapacityEdgeMap, ReverseEdgeMap, ColorMap, PredEdgeMap) [with Graph = adjacency_list > > >, no_property, listS>; CapacityEdgeMap = adj_list_edge_property_map > > >, edge_capacity_t>; ResidualCapacityEdgeMap = adj_list_edge_property_map > > >, edge_residual_capacity_t>; ReverseEdgeMap = adj_list_edge_property_map, detail::edge_desc_impl&, long unsigned int, property > > >, edge_reverse_t>; ColorMap = default_color_type*; PredEdgeMap = detail::edge_desc_impl*; typename property_traits::value_type = long unsigned int; typename graph_traits::vertex_descriptor = long unsigned int]’ mincut.hpp:78:21: required from ‘typename boost::graph_traits::edges_size_type boost::min_cut(VertexListGraph&, OutputIterator, OutputIterator) [with VertexListGraph = R_adjacency_list; OutputIterator = std::back_insert_iterator >; typename graph_traits::edges_size_type = long unsigned int]’ mincut.cpp:128:35: required from here /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::Assignable::~Assignable() [with TT = boost::detail::edge_desc_impl]’ 37 | ~model() | ^ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:145:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 145 | BOOST_CONCEPT_USAGE(Assignable) { | ^~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements >]’: /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:208:5: required from ‘struct boost::Convertible’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::Convertible]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied >::value’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_)>’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/graph_concepts.hpp:93:9: [ skipping 2 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/breadth_first_search.hpp:62:5: required from ‘void boost::breadth_first_visit(const IncidenceGraph&, SourceIterator, SourceIterator, Buffer&, BFSVisitor, ColorMap) [with IncidenceGraph = filtered_graph > > >, no_property, listS>, is_residual_edge > > >, edge_residual_capacity_t> >, keep_all>; Buffer = queue > >; BFSVisitor = bfs_visitor*, on_tree_edge> >; ColorMap = default_color_type*; SourceIterator = long unsigned int*]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/breadth_first_search.hpp:136:24: required from ‘void boost::breadth_first_search(const VertexListGraph&, SourceIterator, SourceIterator, Buffer&, BFSVisitor, ColorMap) [with VertexListGraph = filtered_graph > > >, no_property, listS>, is_residual_edge > > >, edge_residual_capacity_t> >, keep_all>; SourceIterator = long unsigned int*; Buffer = queue > >; BFSVisitor = bfs_visitor*, on_tree_edge> >; ColorMap = default_color_type*]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/breadth_first_search.hpp:147:25: required from ‘void boost::breadth_first_search(const VertexListGraph&, typename graph_traits::vertex_descriptor, Buffer&, BFSVisitor, ColorMap) [with VertexListGraph = filtered_graph > > >, no_property, listS>, is_residual_edge > > >, edge_residual_capacity_t> >, keep_all>; Buffer = queue > >; BFSVisitor = bfs_visitor*, on_tree_edge> >; ColorMap = default_color_type*; typename graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/edmonds_karp_max_flow.hpp:101:29: required from ‘typename boost::property_traits::value_type boost::edmonds_karp_max_flow(Graph&, typename graph_traits::vertex_descriptor, typename graph_traits::vertex_descriptor, CapacityEdgeMap, ResidualCapacityEdgeMap, ReverseEdgeMap, ColorMap, PredEdgeMap) [with Graph = adjacency_list > > >, no_property, listS>; CapacityEdgeMap = adj_list_edge_property_map > > >, edge_capacity_t>; ResidualCapacityEdgeMap = adj_list_edge_property_map > > >, edge_residual_capacity_t>; ReverseEdgeMap = adj_list_edge_property_map, detail::edge_desc_impl&, long unsigned int, property > > >, edge_reverse_t>; ColorMap = default_color_type*; PredEdgeMap = detail::edge_desc_impl*; typename property_traits::value_type = long unsigned int; typename graph_traits::vertex_descriptor = long unsigned int]’ mincut.hpp:78:21: required from ‘typename boost::graph_traits::edges_size_type boost::min_cut(VertexListGraph&, OutputIterator, OutputIterator) [with VertexListGraph = R_adjacency_list; OutputIterator = std::back_insert_iterator >; typename graph_traits::edges_size_type = long unsigned int]’ mincut.cpp:128:35: required from here /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::Convertible]’ 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ^ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::Convertible]’: /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/graph_concepts.hpp:93:9: required from ‘boost::concepts::IncidenceGraph::~IncidenceGraph() [with G = boost::filtered_graph > > >, boost::no_property, boost::listS>, boost::is_residual_edge > > >, boost::edge_residual_capacity_t> >, boost::keep_all>]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/graph_concepts.hpp:75:1: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::IncidenceGraphConcept > > >, boost::no_property, boost::listS>, boost::is_residual_edge > > >, boost::edge_residual_capacity_t> >, boost::keep_all> >]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/breadth_first_search.hpp:62:5: required from ‘void boost::breadth_first_visit(const IncidenceGraph&, SourceIterator, SourceIterator, Buffer&, BFSVisitor, ColorMap) [with IncidenceGraph = filtered_graph > > >, no_property, listS>, is_residual_edge > > >, edge_residual_capacity_t> >, keep_all>; Buffer = queue > >; BFSVisitor = bfs_visitor*, on_tree_edge> >; ColorMap = default_color_type*; SourceIterator = long unsigned int*]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/breadth_first_search.hpp:136:24: required from ‘void boost::breadth_first_search(const VertexListGraph&, SourceIterator, SourceIterator, Buffer&, BFSVisitor, ColorMap) [with VertexListGraph = filtered_graph > > >, no_property, listS>, is_residual_edge > > >, edge_residual_capacity_t> >, keep_all>; SourceIterator = long unsigned int*; Buffer = queue > >; BFSVisitor = bfs_visitor*, on_tree_edge> >; ColorMap = default_color_type*]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/breadth_first_search.hpp:147:25: required from ‘void boost::breadth_first_search(const VertexListGraph&, typename graph_traits::vertex_descriptor, Buffer&, BFSVisitor, ColorMap) [with VertexListGraph = filtered_graph > > >, no_property, listS>, is_residual_edge > > >, edge_residual_capacity_t> >, keep_all>; Buffer = queue > >; BFSVisitor = bfs_visitor*, on_tree_edge> >; ColorMap = default_color_type*; typename graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/edmonds_karp_max_flow.hpp:101:29: required from ‘typename boost::property_traits::value_type boost::edmonds_karp_max_flow(Graph&, typename graph_traits::vertex_descriptor, typename graph_traits::vertex_descriptor, CapacityEdgeMap, ResidualCapacityEdgeMap, ReverseEdgeMap, ColorMap, PredEdgeMap) [with Graph = adjacency_list > > >, no_property, listS>; CapacityEdgeMap = adj_list_edge_property_map > > >, edge_capacity_t>; ResidualCapacityEdgeMap = adj_list_edge_property_map > > >, edge_residual_capacity_t>; ReverseEdgeMap = adj_list_edge_property_map, detail::edge_desc_impl&, long unsigned int, property > > >, edge_reverse_t>; ColorMap = default_color_type*; PredEdgeMap = detail::edge_desc_impl*; typename property_traits::value_type = long unsigned int; typename graph_traits::vertex_descriptor = long unsigned int]’ mincut.hpp:78:21: required from ‘typename boost::graph_traits::edges_size_type boost::min_cut(VertexListGraph&, OutputIterator, OutputIterator) [with VertexListGraph = R_adjacency_list; OutputIterator = std::back_insert_iterator >; typename graph_traits::edges_size_type = long unsigned int]’ mincut.cpp:128:35: required from here /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::Convertible::~Convertible() [with X = boost::adj_list_dir_traversal_tag; Y = boost::incidence_graph_tag]’ 37 | ~model() | ^ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:208:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 208 | BOOST_CONCEPT_USAGE(Convertible) { | ^~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::CopyConstructible*, boost::on_tree_edge> > >]’: /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements*, boost::on_tree_edge> > > >]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:167:5: required from ‘struct boost::CopyConstructible*, boost::on_tree_edge> > >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:165:3: required from ‘struct boost::CopyConstructibleConcept*, boost::on_tree_edge> > >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::CopyConstructibleConcept*, boost::on_tree_edge> > >]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied*, boost::on_tree_edge> > > >::value’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:45:51: [ skipping 7 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/breadth_first_search.hpp:65:5: required from ‘void boost::breadth_first_visit(const IncidenceGraph&, SourceIterator, SourceIterator, Buffer&, BFSVisitor, ColorMap) [with IncidenceGraph = filtered_graph > > >, no_property, listS>, is_residual_edge > > >, edge_residual_capacity_t> >, keep_all>; Buffer = queue > >; BFSVisitor = bfs_visitor*, on_tree_edge> >; ColorMap = default_color_type*; SourceIterator = long unsigned int*]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/breadth_first_search.hpp:136:24: required from ‘void boost::breadth_first_search(const VertexListGraph&, SourceIterator, SourceIterator, Buffer&, BFSVisitor, ColorMap) [with VertexListGraph = filtered_graph > > >, no_property, listS>, is_residual_edge > > >, edge_residual_capacity_t> >, keep_all>; SourceIterator = long unsigned int*; Buffer = queue > >; BFSVisitor = bfs_visitor*, on_tree_edge> >; ColorMap = default_color_type*]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/breadth_first_search.hpp:147:25: required from ‘void boost::breadth_first_search(const VertexListGraph&, typename graph_traits::vertex_descriptor, Buffer&, BFSVisitor, ColorMap) [with VertexListGraph = filtered_graph > > >, no_property, listS>, is_residual_edge > > >, edge_residual_capacity_t> >, keep_all>; Buffer = queue > >; BFSVisitor = bfs_visitor*, on_tree_edge> >; ColorMap = default_color_type*; typename graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/edmonds_karp_max_flow.hpp:101:29: required from ‘typename boost::property_traits::value_type boost::edmonds_karp_max_flow(Graph&, typename graph_traits::vertex_descriptor, typename graph_traits::vertex_descriptor, CapacityEdgeMap, ResidualCapacityEdgeMap, ReverseEdgeMap, ColorMap, PredEdgeMap) [with Graph = adjacency_list > > >, no_property, listS>; CapacityEdgeMap = adj_list_edge_property_map > > >, edge_capacity_t>; ResidualCapacityEdgeMap = adj_list_edge_property_map > > >, edge_residual_capacity_t>; ReverseEdgeMap = adj_list_edge_property_map, detail::edge_desc_impl&, long unsigned int, property > > >, edge_reverse_t>; ColorMap = default_color_type*; PredEdgeMap = detail::edge_desc_impl*; typename property_traits::value_type = long unsigned int; typename graph_traits::vertex_descriptor = long unsigned int]’ mincut.hpp:78:21: required from ‘typename boost::graph_traits::edges_size_type boost::min_cut(VertexListGraph&, OutputIterator, OutputIterator) [with VertexListGraph = R_adjacency_list; OutputIterator = std::back_insert_iterator >; typename graph_traits::edges_size_type = long unsigned int]’ mincut.cpp:128:35: required from here /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::CopyConstructible::~CopyConstructible() [with TT = boost::bfs_visitor*, boost::on_tree_edge> >]’ 37 | ~model() | ^ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:167:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 167 | BOOST_CONCEPT_USAGE(CopyConstructible) { | ^~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements >]’: /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:208:5: required from ‘struct boost::Convertible’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:206:3: required from ‘struct boost::ConvertibleConcept’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::ConvertibleConcept]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied >::value’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:72:8: [ skipping 11 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/breadth_first_search.hpp:66:5: required from ‘void boost::breadth_first_visit(const IncidenceGraph&, SourceIterator, SourceIterator, Buffer&, BFSVisitor, ColorMap) [with IncidenceGraph = filtered_graph > > >, no_property, listS>, is_residual_edge > > >, edge_residual_capacity_t> >, keep_all>; Buffer = queue > >; BFSVisitor = bfs_visitor*, on_tree_edge> >; ColorMap = default_color_type*; SourceIterator = long unsigned int*]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/breadth_first_search.hpp:136:24: required from ‘void boost::breadth_first_search(const VertexListGraph&, SourceIterator, SourceIterator, Buffer&, BFSVisitor, ColorMap) [with VertexListGraph = filtered_graph > > >, no_property, listS>, is_residual_edge > > >, edge_residual_capacity_t> >, keep_all>; SourceIterator = long unsigned int*; Buffer = queue > >; BFSVisitor = bfs_visitor*, on_tree_edge> >; ColorMap = default_color_type*]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/breadth_first_search.hpp:147:25: required from ‘void boost::breadth_first_search(const VertexListGraph&, typename graph_traits::vertex_descriptor, Buffer&, BFSVisitor, ColorMap) [with VertexListGraph = filtered_graph > > >, no_property, listS>, is_residual_edge > > >, edge_residual_capacity_t> >, keep_all>; Buffer = queue > >; BFSVisitor = bfs_visitor*, on_tree_edge> >; ColorMap = default_color_type*; typename graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/edmonds_karp_max_flow.hpp:101:29: required from ‘typename boost::property_traits::value_type boost::edmonds_karp_max_flow(Graph&, typename graph_traits::vertex_descriptor, typename graph_traits::vertex_descriptor, CapacityEdgeMap, ResidualCapacityEdgeMap, ReverseEdgeMap, ColorMap, PredEdgeMap) [with Graph = adjacency_list > > >, no_property, listS>; CapacityEdgeMap = adj_list_edge_property_map > > >, edge_capacity_t>; ResidualCapacityEdgeMap = adj_list_edge_property_map > > >, edge_residual_capacity_t>; ReverseEdgeMap = adj_list_edge_property_map, detail::edge_desc_impl&, long unsigned int, property > > >, edge_reverse_t>; ColorMap = default_color_type*; PredEdgeMap = detail::edge_desc_impl*; typename property_traits::value_type = long unsigned int; typename graph_traits::vertex_descriptor = long unsigned int]’ mincut.hpp:78:21: required from ‘typename boost::graph_traits::edges_size_type boost::min_cut(VertexListGraph&, OutputIterator, OutputIterator) [with VertexListGraph = R_adjacency_list; OutputIterator = std::back_insert_iterator >; typename graph_traits::edges_size_type = long unsigned int]’ mincut.cpp:128:35: required from here /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::Convertible]’ 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ^ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::ConvertibleConcept]’: /home/omnipath/local/R/4.4-3.20/BH/include/boost/property_map/property_map.hpp:148:7: required from ‘void boost::ReadablePropertyMapConcept::constraints() [with PMap = boost::default_color_type*; Key = long unsigned int]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::ReadablePropertyMapConcept]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied >::value’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_)>’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/property_map/property_map.hpp:206:7: [ skipping 5 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/breadth_first_search.hpp:66:5: required from ‘void boost::breadth_first_visit(const IncidenceGraph&, SourceIterator, SourceIterator, Buffer&, BFSVisitor, ColorMap) [with IncidenceGraph = filtered_graph > > >, no_property, listS>, is_residual_edge > > >, edge_residual_capacity_t> >, keep_all>; Buffer = queue > >; BFSVisitor = bfs_visitor*, on_tree_edge> >; ColorMap = default_color_type*; SourceIterator = long unsigned int*]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/breadth_first_search.hpp:136:24: required from ‘void boost::breadth_first_search(const VertexListGraph&, SourceIterator, SourceIterator, Buffer&, BFSVisitor, ColorMap) [with VertexListGraph = filtered_graph > > >, no_property, listS>, is_residual_edge > > >, edge_residual_capacity_t> >, keep_all>; SourceIterator = long unsigned int*; Buffer = queue > >; BFSVisitor = bfs_visitor*, on_tree_edge> >; ColorMap = default_color_type*]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/breadth_first_search.hpp:147:25: required from ‘void boost::breadth_first_search(const VertexListGraph&, typename graph_traits::vertex_descriptor, Buffer&, BFSVisitor, ColorMap) [with VertexListGraph = filtered_graph > > >, no_property, listS>, is_residual_edge > > >, edge_residual_capacity_t> >, keep_all>; Buffer = queue > >; BFSVisitor = bfs_visitor*, on_tree_edge> >; ColorMap = default_color_type*; typename graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/edmonds_karp_max_flow.hpp:101:29: required from ‘typename boost::property_traits::value_type boost::edmonds_karp_max_flow(Graph&, typename graph_traits::vertex_descriptor, typename graph_traits::vertex_descriptor, CapacityEdgeMap, ResidualCapacityEdgeMap, ReverseEdgeMap, ColorMap, PredEdgeMap) [with Graph = adjacency_list > > >, no_property, listS>; CapacityEdgeMap = adj_list_edge_property_map > > >, edge_capacity_t>; ResidualCapacityEdgeMap = adj_list_edge_property_map > > >, edge_residual_capacity_t>; ReverseEdgeMap = adj_list_edge_property_map, detail::edge_desc_impl&, long unsigned int, property > > >, edge_reverse_t>; ColorMap = default_color_type*; PredEdgeMap = detail::edge_desc_impl*; typename property_traits::value_type = long unsigned int; typename graph_traits::vertex_descriptor = long unsigned int]’ mincut.hpp:78:21: required from ‘typename boost::graph_traits::edges_size_type boost::min_cut(VertexListGraph&, OutputIterator, OutputIterator) [with VertexListGraph = R_adjacency_list; OutputIterator = std::back_insert_iterator >; typename graph_traits::edges_size_type = long unsigned int]’ mincut.cpp:128:35: required from here /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:206:17: note: in a call to non-static member function ‘boost::ConvertibleConcept::~ConvertibleConcept()’ 206 | BOOST_concept(Convertible,(X)(Y)) | ^~~~~~~~~~~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/preprocessor/cat.hpp:29:34: note: in definition of macro ‘BOOST_PP_CAT_I’ 29 | # define BOOST_PP_CAT_I(a, b) a ## b | ^ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/concept_def.hpp:23:12: note: in expansion of macro ‘BOOST_PP_CAT’ 23 | struct BOOST_PP_CAT(name,Concept) \ | ^~~~~~~~~~~~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:206:3: note: in expansion of macro ‘BOOST_concept’ 206 | BOOST_concept(Convertible,(X)(Y)) | ^~~~~~~~~~~~~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements >]’: /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:208:5: required from ‘struct boost::Convertible’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:206:3: required from ‘struct boost::ConvertibleConcept’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::ConvertibleConcept]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied >::value’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:72:8: [ skipping 11 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/breadth_first_search.hpp:66:5: required from ‘void boost::breadth_first_visit(const IncidenceGraph&, SourceIterator, SourceIterator, Buffer&, BFSVisitor, ColorMap) [with IncidenceGraph = filtered_graph > > >, no_property, listS>, is_residual_edge > > >, edge_residual_capacity_t> >, keep_all>; Buffer = queue > >; BFSVisitor = bfs_visitor*, on_tree_edge> >; ColorMap = default_color_type*; SourceIterator = long unsigned int*]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/breadth_first_search.hpp:136:24: required from ‘void boost::breadth_first_search(const VertexListGraph&, SourceIterator, SourceIterator, Buffer&, BFSVisitor, ColorMap) [with VertexListGraph = filtered_graph > > >, no_property, listS>, is_residual_edge > > >, edge_residual_capacity_t> >, keep_all>; SourceIterator = long unsigned int*; Buffer = queue > >; BFSVisitor = bfs_visitor*, on_tree_edge> >; ColorMap = default_color_type*]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/breadth_first_search.hpp:147:25: required from ‘void boost::breadth_first_search(const VertexListGraph&, typename graph_traits::vertex_descriptor, Buffer&, BFSVisitor, ColorMap) [with VertexListGraph = filtered_graph > > >, no_property, listS>, is_residual_edge > > >, edge_residual_capacity_t> >, keep_all>; Buffer = queue > >; BFSVisitor = bfs_visitor*, on_tree_edge> >; ColorMap = default_color_type*; typename graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/edmonds_karp_max_flow.hpp:101:29: required from ‘typename boost::property_traits::value_type boost::edmonds_karp_max_flow(Graph&, typename graph_traits::vertex_descriptor, typename graph_traits::vertex_descriptor, CapacityEdgeMap, ResidualCapacityEdgeMap, ReverseEdgeMap, ColorMap, PredEdgeMap) [with Graph = adjacency_list > > >, no_property, listS>; CapacityEdgeMap = adj_list_edge_property_map > > >, edge_capacity_t>; ResidualCapacityEdgeMap = adj_list_edge_property_map > > >, edge_residual_capacity_t>; ReverseEdgeMap = adj_list_edge_property_map, detail::edge_desc_impl&, long unsigned int, property > > >, edge_reverse_t>; ColorMap = default_color_type*; PredEdgeMap = detail::edge_desc_impl*; typename property_traits::value_type = long unsigned int; typename graph_traits::vertex_descriptor = long unsigned int]’ mincut.hpp:78:21: required from ‘typename boost::graph_traits::edges_size_type boost::min_cut(VertexListGraph&, OutputIterator, OutputIterator) [with VertexListGraph = R_adjacency_list; OutputIterator = std::back_insert_iterator >; typename graph_traits::edges_size_type = long unsigned int]’ mincut.cpp:128:35: required from here /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::Convertible]’ 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ^ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::ConvertibleConcept]’: /home/omnipath/local/R/4.4-3.20/BH/include/boost/property_map/property_map.hpp:180:7: required from ‘void boost::WritablePropertyMapConcept::constraints() [with PMap = boost::default_color_type*; Key = long unsigned int]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::WritablePropertyMapConcept]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied >::value’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_)>’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/property_map/property_map.hpp:207:7: [ skipping 5 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/breadth_first_search.hpp:66:5: required from ‘void boost::breadth_first_visit(const IncidenceGraph&, SourceIterator, SourceIterator, Buffer&, BFSVisitor, ColorMap) [with IncidenceGraph = filtered_graph > > >, no_property, listS>, is_residual_edge > > >, edge_residual_capacity_t> >, keep_all>; Buffer = queue > >; BFSVisitor = bfs_visitor*, on_tree_edge> >; ColorMap = default_color_type*; SourceIterator = long unsigned int*]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/breadth_first_search.hpp:136:24: required from ‘void boost::breadth_first_search(const VertexListGraph&, SourceIterator, SourceIterator, Buffer&, BFSVisitor, ColorMap) [with VertexListGraph = filtered_graph > > >, no_property, listS>, is_residual_edge > > >, edge_residual_capacity_t> >, keep_all>; SourceIterator = long unsigned int*; Buffer = queue > >; BFSVisitor = bfs_visitor*, on_tree_edge> >; ColorMap = default_color_type*]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/breadth_first_search.hpp:147:25: required from ‘void boost::breadth_first_search(const VertexListGraph&, typename graph_traits::vertex_descriptor, Buffer&, BFSVisitor, ColorMap) [with VertexListGraph = filtered_graph > > >, no_property, listS>, is_residual_edge > > >, edge_residual_capacity_t> >, keep_all>; Buffer = queue > >; BFSVisitor = bfs_visitor*, on_tree_edge> >; ColorMap = default_color_type*; typename graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/edmonds_karp_max_flow.hpp:101:29: required from ‘typename boost::property_traits::value_type boost::edmonds_karp_max_flow(Graph&, typename graph_traits::vertex_descriptor, typename graph_traits::vertex_descriptor, CapacityEdgeMap, ResidualCapacityEdgeMap, ReverseEdgeMap, ColorMap, PredEdgeMap) [with Graph = adjacency_list > > >, no_property, listS>; CapacityEdgeMap = adj_list_edge_property_map > > >, edge_capacity_t>; ResidualCapacityEdgeMap = adj_list_edge_property_map > > >, edge_residual_capacity_t>; ReverseEdgeMap = adj_list_edge_property_map, detail::edge_desc_impl&, long unsigned int, property > > >, edge_reverse_t>; ColorMap = default_color_type*; PredEdgeMap = detail::edge_desc_impl*; typename property_traits::value_type = long unsigned int; typename graph_traits::vertex_descriptor = long unsigned int]’ mincut.hpp:78:21: required from ‘typename boost::graph_traits::edges_size_type boost::min_cut(VertexListGraph&, OutputIterator, OutputIterator) [with VertexListGraph = R_adjacency_list; OutputIterator = std::back_insert_iterator >; typename graph_traits::edges_size_type = long unsigned int]’ mincut.cpp:128:35: required from here /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:206:17: note: in a call to non-static member function ‘boost::ConvertibleConcept::~ConvertibleConcept()’ 206 | BOOST_concept(Convertible,(X)(Y)) | ^~~~~~~~~~~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/preprocessor/cat.hpp:29:34: note: in definition of macro ‘BOOST_PP_CAT_I’ 29 | # define BOOST_PP_CAT_I(a, b) a ## b | ^ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/concept_def.hpp:23:12: note: in expansion of macro ‘BOOST_PP_CAT’ 23 | struct BOOST_PP_CAT(name,Concept) \ | ^~~~~~~~~~~~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:206:3: note: in expansion of macro ‘BOOST_concept’ 206 | BOOST_concept(Convertible,(X)(Y)) | ^~~~~~~~~~~~~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::Convertible]’: /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements >]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:208:5: required from ‘struct boost::Convertible’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:206:3: required from ‘struct boost::ConvertibleConcept’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::ConvertibleConcept]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied >::value’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:45:51: [ skipping 7 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/breadth_first_search.hpp:66:5: required from ‘void boost::breadth_first_visit(const IncidenceGraph&, SourceIterator, SourceIterator, Buffer&, BFSVisitor, ColorMap) [with IncidenceGraph = filtered_graph > > >, no_property, listS>, is_residual_edge > > >, edge_residual_capacity_t> >, keep_all>; Buffer = queue > >; BFSVisitor = bfs_visitor*, on_tree_edge> >; ColorMap = default_color_type*; SourceIterator = long unsigned int*]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/breadth_first_search.hpp:136:24: required from ‘void boost::breadth_first_search(const VertexListGraph&, SourceIterator, SourceIterator, Buffer&, BFSVisitor, ColorMap) [with VertexListGraph = filtered_graph > > >, no_property, listS>, is_residual_edge > > >, edge_residual_capacity_t> >, keep_all>; SourceIterator = long unsigned int*; Buffer = queue > >; BFSVisitor = bfs_visitor*, on_tree_edge> >; ColorMap = default_color_type*]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/breadth_first_search.hpp:147:25: required from ‘void boost::breadth_first_search(const VertexListGraph&, typename graph_traits::vertex_descriptor, Buffer&, BFSVisitor, ColorMap) [with VertexListGraph = filtered_graph > > >, no_property, listS>, is_residual_edge > > >, edge_residual_capacity_t> >, keep_all>; Buffer = queue > >; BFSVisitor = bfs_visitor*, on_tree_edge> >; ColorMap = default_color_type*; typename graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/edmonds_karp_max_flow.hpp:101:29: required from ‘typename boost::property_traits::value_type boost::edmonds_karp_max_flow(Graph&, typename graph_traits::vertex_descriptor, typename graph_traits::vertex_descriptor, CapacityEdgeMap, ResidualCapacityEdgeMap, ReverseEdgeMap, ColorMap, PredEdgeMap) [with Graph = adjacency_list > > >, no_property, listS>; CapacityEdgeMap = adj_list_edge_property_map > > >, edge_capacity_t>; ResidualCapacityEdgeMap = adj_list_edge_property_map > > >, edge_residual_capacity_t>; ReverseEdgeMap = adj_list_edge_property_map, detail::edge_desc_impl&, long unsigned int, property > > >, edge_reverse_t>; ColorMap = default_color_type*; PredEdgeMap = detail::edge_desc_impl*; typename property_traits::value_type = long unsigned int; typename graph_traits::vertex_descriptor = long unsigned int]’ mincut.hpp:78:21: required from ‘typename boost::graph_traits::edges_size_type boost::min_cut(VertexListGraph&, OutputIterator, OutputIterator) [with VertexListGraph = R_adjacency_list; OutputIterator = std::back_insert_iterator >; typename graph_traits::edges_size_type = long unsigned int]’ mincut.cpp:128:35: required from here /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::Convertible::~Convertible() [with X = boost::lvalue_property_map_tag; Y = boost::read_write_property_map_tag]’ 37 | ~model() | ^ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:208:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 208 | BOOST_CONCEPT_USAGE(Convertible) { | ^~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::Convertible]’: /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements >]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:208:5: required from ‘struct boost::Convertible’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::Convertible]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied >::value’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:72:8: [ skipping 12 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_*, std::vector, std::allocator > > > >)>’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/property_map/property_map.hpp:354:5: required from ‘boost::iterator_property_map boost::make_iterator_property_map(RAIter, ID, Value) [with RAIter = __gnu_cxx::__normal_iterator*, std::vector, std::allocator > > >; Value = detail::edge_desc_impl; ID = vec_adj_list_vertex_id_map]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/edmonds_karp_max_flow.hpp:209:43: required from ‘static typename boost::detail::edge_capacity_value::type boost::detail::edmonds_karp_dispatch1::apply(Graph&, typename boost::graph_traits::vertex_descriptor, typename boost::graph_traits::vertex_descriptor, const boost::bgl_named_params&, boost::param_not_found) [with Graph = boost::adjacency_list > > > >; P = int; T = boost::buffer_param_t; R = boost::no_property; typename boost::detail::edge_capacity_value::type = double; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/edmonds_karp_max_flow.hpp:228:57: required from ‘typename boost::detail::edge_capacity_value::type boost::edmonds_karp_max_flow(Graph&, typename graph_traits::vertex_descriptor, typename graph_traits::vertex_descriptor, const bgl_named_params&) [with Graph = adjacency_list > > > >; P = int; T = buffer_param_t; R = no_property; typename detail::edge_capacity_value::type = double; typename graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/edmonds_karp_max_flow.hpp:240:33: required from ‘typename boost::property_traits::const_type>::value_type boost::edmonds_karp_max_flow(Graph&, typename graph_traits::vertex_descriptor, typename graph_traits::vertex_descriptor) [with Graph = adjacency_list > > > >; typename property_traits::const_type>::value_type = double; typename property_map::const_type = adj_list_edge_property_map > > >, edge_capacity_t>; typename graph_traits::vertex_descriptor = long unsigned int]’ mincut.cpp:76:45: required from here /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::Convertible::~Convertible() [with X = std::random_access_iterator_tag; Y = std::input_iterator_tag]’ 37 | ~model() | ^ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:208:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 208 | BOOST_CONCEPT_USAGE(Convertible) { | ^~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::Convertible]’: /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements >]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:208:5: required from ‘struct boost::Convertible’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::Convertible]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied >::value’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:72:8: [ skipping 11 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_*, std::vector, std::allocator > > > >)>’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/property_map/property_map.hpp:354:5: required from ‘boost::iterator_property_map boost::make_iterator_property_map(RAIter, ID, Value) [with RAIter = __gnu_cxx::__normal_iterator*, std::vector, std::allocator > > >; Value = detail::edge_desc_impl; ID = vec_adj_list_vertex_id_map]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/edmonds_karp_max_flow.hpp:209:43: required from ‘static typename boost::detail::edge_capacity_value::type boost::detail::edmonds_karp_dispatch1::apply(Graph&, typename boost::graph_traits::vertex_descriptor, typename boost::graph_traits::vertex_descriptor, const boost::bgl_named_params&, boost::param_not_found) [with Graph = boost::adjacency_list > > > >; P = int; T = boost::buffer_param_t; R = boost::no_property; typename boost::detail::edge_capacity_value::type = double; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/edmonds_karp_max_flow.hpp:228:57: required from ‘typename boost::detail::edge_capacity_value::type boost::edmonds_karp_max_flow(Graph&, typename graph_traits::vertex_descriptor, typename graph_traits::vertex_descriptor, const bgl_named_params&) [with Graph = adjacency_list > > > >; P = int; T = buffer_param_t; R = no_property; typename detail::edge_capacity_value::type = double; typename graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/edmonds_karp_max_flow.hpp:240:33: required from ‘typename boost::property_traits::const_type>::value_type boost::edmonds_karp_max_flow(Graph&, typename graph_traits::vertex_descriptor, typename graph_traits::vertex_descriptor) [with Graph = adjacency_list > > > >; typename property_traits::const_type>::value_type = double; typename property_map::const_type = adj_list_edge_property_map > > >, edge_capacity_t>; typename graph_traits::vertex_descriptor = long unsigned int]’ mincut.cpp:76:45: required from here /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::Convertible::~Convertible() [with X = std::random_access_iterator_tag; Y = std::forward_iterator_tag]’ 37 | ~model() | ^ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:208:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 208 | BOOST_CONCEPT_USAGE(Convertible) { | ^~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::Convertible]’: /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements >]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:208:5: required from ‘struct boost::Convertible’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::Convertible]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied >::value’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:72:8: [ skipping 10 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_*, std::vector, std::allocator > > > >)>’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/property_map/property_map.hpp:354:5: required from ‘boost::iterator_property_map boost::make_iterator_property_map(RAIter, ID, Value) [with RAIter = __gnu_cxx::__normal_iterator*, std::vector, std::allocator > > >; Value = detail::edge_desc_impl; ID = vec_adj_list_vertex_id_map]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/edmonds_karp_max_flow.hpp:209:43: required from ‘static typename boost::detail::edge_capacity_value::type boost::detail::edmonds_karp_dispatch1::apply(Graph&, typename boost::graph_traits::vertex_descriptor, typename boost::graph_traits::vertex_descriptor, const boost::bgl_named_params&, boost::param_not_found) [with Graph = boost::adjacency_list > > > >; P = int; T = boost::buffer_param_t; R = boost::no_property; typename boost::detail::edge_capacity_value::type = double; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/edmonds_karp_max_flow.hpp:228:57: required from ‘typename boost::detail::edge_capacity_value::type boost::edmonds_karp_max_flow(Graph&, typename graph_traits::vertex_descriptor, typename graph_traits::vertex_descriptor, const bgl_named_params&) [with Graph = adjacency_list > > > >; P = int; T = buffer_param_t; R = no_property; typename detail::edge_capacity_value::type = double; typename graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/edmonds_karp_max_flow.hpp:240:33: required from ‘typename boost::property_traits::const_type>::value_type boost::edmonds_karp_max_flow(Graph&, typename graph_traits::vertex_descriptor, typename graph_traits::vertex_descriptor) [with Graph = adjacency_list > > > >; typename property_traits::const_type>::value_type = double; typename property_map::const_type = adj_list_edge_property_map > > >, edge_capacity_t>; typename graph_traits::vertex_descriptor = long unsigned int]’ mincut.cpp:76:45: required from here /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::Convertible::~Convertible() [with X = std::random_access_iterator_tag; Y = std::bidirectional_iterator_tag]’ 37 | ~model() | ^ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:208:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 208 | BOOST_CONCEPT_USAGE(Convertible) { | ^~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements > > > >, boost::is_residual_edge > > >, boost::edge_residual_capacity_t> >, boost::keep_all> > >]’: /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/graph_concepts.hpp:66:5: required from ‘struct boost::concepts::Graph > > > >, boost::is_residual_edge > > >, boost::edge_residual_capacity_t> >, boost::keep_all> >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/graph_concepts.hpp:75:1: required from ‘struct boost::concepts::IncidenceGraph > > > >, boost::is_residual_edge > > >, boost::edge_residual_capacity_t> >, boost::keep_all> >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/graph_concepts.hpp:75:1: required from ‘struct boost::concepts::IncidenceGraphConcept > > > >, boost::is_residual_edge > > >, boost::edge_residual_capacity_t> >, boost::keep_all> >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::concepts::IncidenceGraphConcept > > > >, boost::is_residual_edge > > >, boost::edge_residual_capacity_t> >, boost::keep_all> >]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied > > > >, boost::is_residual_edge > > >, boost::edge_residual_capacity_t> >, boost::keep_all> > >::value’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:45:51: [ skipping 5 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/edmonds_karp_max_flow.hpp:101:29: required from ‘typename boost::property_traits::value_type boost::edmonds_karp_max_flow(Graph&, typename graph_traits::vertex_descriptor, typename graph_traits::vertex_descriptor, CapacityEdgeMap, ResidualCapacityEdgeMap, ReverseEdgeMap, ColorMap, PredEdgeMap) [with Graph = adjacency_list > > > >; CapacityEdgeMap = adj_list_edge_property_map > > >, edge_capacity_t>; ResidualCapacityEdgeMap = adj_list_edge_property_map > > >, edge_residual_capacity_t>; ReverseEdgeMap = adj_list_edge_property_map, const detail::edge_desc_impl&, long unsigned int, const property > > >, edge_reverse_t>; ColorMap = iterator_property_map<__gnu_cxx::__normal_iterator >, vec_adj_list_vertex_id_map, default_color_type, default_color_type&>; PredEdgeMap = iterator_property_map<__gnu_cxx::__normal_iterator*, std::vector, std::allocator > > >, vec_adj_list_vertex_id_map, detail::edge_desc_impl, detail::edge_desc_impl&>; typename property_traits::value_type = double; typename graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/edmonds_karp_max_flow.hpp:154:41: required from ‘static typename boost::detail::edge_capacity_value::type boost::detail::edmonds_karp_dispatch2::apply(Graph&, typename boost::graph_traits::vertex_descriptor, typename boost::graph_traits::vertex_descriptor, PredMap, const boost::bgl_named_params&, boost::param_not_found) [with Graph = boost::adjacency_list > > > >; PredMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator*, std::vector, std::allocator > > >, boost::vec_adj_list_vertex_id_map, boost::detail::edge_desc_impl, boost::detail::edge_desc_impl&>; P = int; T = boost::buffer_param_t; R = boost::no_property; typename boost::detail::edge_capacity_value::type = double; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/edmonds_karp_max_flow.hpp:208:54: required from ‘static typename boost::detail::edge_capacity_value::type boost::detail::edmonds_karp_dispatch1::apply(Graph&, typename boost::graph_traits::vertex_descriptor, typename boost::graph_traits::vertex_descriptor, const boost::bgl_named_params&, boost::param_not_found) [with Graph = boost::adjacency_list > > > >; P = int; T = boost::buffer_param_t; R = boost::no_property; typename boost::detail::edge_capacity_value::type = double; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/edmonds_karp_max_flow.hpp:228:57: required from ‘typename boost::detail::edge_capacity_value::type boost::edmonds_karp_max_flow(Graph&, typename graph_traits::vertex_descriptor, typename graph_traits::vertex_descriptor, const bgl_named_params&) [with Graph = adjacency_list > > > >; P = int; T = buffer_param_t; R = no_property; typename detail::edge_capacity_value::type = double; typename graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/edmonds_karp_max_flow.hpp:240:33: required from ‘typename boost::property_traits::const_type>::value_type boost::edmonds_karp_max_flow(Graph&, typename graph_traits::vertex_descriptor, typename graph_traits::vertex_descriptor) [with Graph = adjacency_list > > > >; typename property_traits::const_type>::value_type = double; typename property_map::const_type = adj_list_edge_property_map > > >, edge_capacity_t>; typename graph_traits::vertex_descriptor = long unsigned int]’ mincut.cpp:76:45: required from here /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::concepts::Graph > > > >, boost::is_residual_edge > > >, boost::edge_residual_capacity_t> >, boost::keep_all> >]’ 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ^ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements > > > >, boost::is_residual_edge > > >, boost::edge_residual_capacity_t> >, boost::keep_all> > >]’: /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/graph_concepts.hpp:87:5: required from ‘struct boost::concepts::IncidenceGraph > > > >, boost::is_residual_edge > > >, boost::edge_residual_capacity_t> >, boost::keep_all> >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/graph_concepts.hpp:75:1: required from ‘struct boost::concepts::IncidenceGraphConcept > > > >, boost::is_residual_edge > > >, boost::edge_residual_capacity_t> >, boost::keep_all> >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::concepts::IncidenceGraphConcept > > > >, boost::is_residual_edge > > >, boost::edge_residual_capacity_t> >, boost::keep_all> >]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied > > > >, boost::is_residual_edge > > >, boost::edge_residual_capacity_t> >, boost::keep_all> > >::value’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied > > > >, boost::is_residual_edge > > >, boost::edge_residual_capacity_t> >, boost::keep_all> > >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:72:8: [ skipping 4 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/edmonds_karp_max_flow.hpp:101:29: required from ‘typename boost::property_traits::value_type boost::edmonds_karp_max_flow(Graph&, typename graph_traits::vertex_descriptor, typename graph_traits::vertex_descriptor, CapacityEdgeMap, ResidualCapacityEdgeMap, ReverseEdgeMap, ColorMap, PredEdgeMap) [with Graph = adjacency_list > > > >; CapacityEdgeMap = adj_list_edge_property_map > > >, edge_capacity_t>; ResidualCapacityEdgeMap = adj_list_edge_property_map > > >, edge_residual_capacity_t>; ReverseEdgeMap = adj_list_edge_property_map, const detail::edge_desc_impl&, long unsigned int, const property > > >, edge_reverse_t>; ColorMap = iterator_property_map<__gnu_cxx::__normal_iterator >, vec_adj_list_vertex_id_map, default_color_type, default_color_type&>; PredEdgeMap = iterator_property_map<__gnu_cxx::__normal_iterator*, std::vector, std::allocator > > >, vec_adj_list_vertex_id_map, detail::edge_desc_impl, detail::edge_desc_impl&>; typename property_traits::value_type = double; typename graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/edmonds_karp_max_flow.hpp:154:41: required from ‘static typename boost::detail::edge_capacity_value::type boost::detail::edmonds_karp_dispatch2::apply(Graph&, typename boost::graph_traits::vertex_descriptor, typename boost::graph_traits::vertex_descriptor, PredMap, const boost::bgl_named_params&, boost::param_not_found) [with Graph = boost::adjacency_list > > > >; PredMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator*, std::vector, std::allocator > > >, boost::vec_adj_list_vertex_id_map, boost::detail::edge_desc_impl, boost::detail::edge_desc_impl&>; P = int; T = boost::buffer_param_t; R = boost::no_property; typename boost::detail::edge_capacity_value::type = double; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/edmonds_karp_max_flow.hpp:208:54: required from ‘static typename boost::detail::edge_capacity_value::type boost::detail::edmonds_karp_dispatch1::apply(Graph&, typename boost::graph_traits::vertex_descriptor, typename boost::graph_traits::vertex_descriptor, const boost::bgl_named_params&, boost::param_not_found) [with Graph = boost::adjacency_list > > > >; P = int; T = boost::buffer_param_t; R = boost::no_property; typename boost::detail::edge_capacity_value::type = double; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/edmonds_karp_max_flow.hpp:228:57: required from ‘typename boost::detail::edge_capacity_value::type boost::edmonds_karp_max_flow(Graph&, typename graph_traits::vertex_descriptor, typename graph_traits::vertex_descriptor, const bgl_named_params&) [with Graph = adjacency_list > > > >; P = int; T = buffer_param_t; R = no_property; typename detail::edge_capacity_value::type = double; typename graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/edmonds_karp_max_flow.hpp:240:33: required from ‘typename boost::property_traits::const_type>::value_type boost::edmonds_karp_max_flow(Graph&, typename graph_traits::vertex_descriptor, typename graph_traits::vertex_descriptor) [with Graph = adjacency_list > > > >; typename property_traits::const_type>::value_type = double; typename property_map::const_type = adj_list_edge_property_map > > >, edge_capacity_t>; typename graph_traits::vertex_descriptor = long unsigned int]’ mincut.cpp:76:45: required from here /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::concepts::IncidenceGraph > > > >, boost::is_residual_edge > > >, boost::edge_residual_capacity_t> >, boost::keep_all> >]’ 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ^ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::IncidenceGraphConcept > > > >, boost::is_residual_edge > > >, boost::edge_residual_capacity_t> >, boost::keep_all> >]’: /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/breadth_first_search.hpp:62:5: required from ‘void boost::breadth_first_visit(const IncidenceGraph&, SourceIterator, SourceIterator, Buffer&, BFSVisitor, ColorMap) [with IncidenceGraph = filtered_graph > > > >, is_residual_edge > > >, edge_residual_capacity_t> >, keep_all>; Buffer = queue > >; BFSVisitor = bfs_visitor*, std::vector, std::allocator > > >, vec_adj_list_vertex_id_map, detail::edge_desc_impl, detail::edge_desc_impl&>, on_tree_edge> >; ColorMap = iterator_property_map<__gnu_cxx::__normal_iterator >, vec_adj_list_vertex_id_map, default_color_type, default_color_type&>; SourceIterator = long unsigned int*]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/breadth_first_search.hpp:136:24: required from ‘void boost::breadth_first_search(const VertexListGraph&, SourceIterator, SourceIterator, Buffer&, BFSVisitor, ColorMap) [with VertexListGraph = filtered_graph > > > >, is_residual_edge > > >, edge_residual_capacity_t> >, keep_all>; SourceIterator = long unsigned int*; Buffer = queue > >; BFSVisitor = bfs_visitor*, std::vector, std::allocator > > >, vec_adj_list_vertex_id_map, detail::edge_desc_impl, detail::edge_desc_impl&>, on_tree_edge> >; ColorMap = iterator_property_map<__gnu_cxx::__normal_iterator >, vec_adj_list_vertex_id_map, default_color_type, default_color_type&>]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/breadth_first_search.hpp:147:25: required from ‘void boost::breadth_first_search(const VertexListGraph&, typename graph_traits::vertex_descriptor, Buffer&, BFSVisitor, ColorMap) [with VertexListGraph = filtered_graph > > > >, is_residual_edge > > >, edge_residual_capacity_t> >, keep_all>; Buffer = queue > >; BFSVisitor = bfs_visitor*, std::vector, std::allocator > > >, vec_adj_list_vertex_id_map, detail::edge_desc_impl, detail::edge_desc_impl&>, on_tree_edge> >; ColorMap = iterator_property_map<__gnu_cxx::__normal_iterator >, vec_adj_list_vertex_id_map, default_color_type, default_color_type&>; typename graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/edmonds_karp_max_flow.hpp:101:29: required from ‘typename boost::property_traits::value_type boost::edmonds_karp_max_flow(Graph&, typename graph_traits::vertex_descriptor, typename graph_traits::vertex_descriptor, CapacityEdgeMap, ResidualCapacityEdgeMap, ReverseEdgeMap, ColorMap, PredEdgeMap) [with Graph = adjacency_list > > > >; CapacityEdgeMap = adj_list_edge_property_map > > >, edge_capacity_t>; ResidualCapacityEdgeMap = adj_list_edge_property_map > > >, edge_residual_capacity_t>; ReverseEdgeMap = adj_list_edge_property_map, const detail::edge_desc_impl&, long unsigned int, const property > > >, edge_reverse_t>; ColorMap = iterator_property_map<__gnu_cxx::__normal_iterator >, vec_adj_list_vertex_id_map, default_color_type, default_color_type&>; PredEdgeMap = iterator_property_map<__gnu_cxx::__normal_iterator*, std::vector, std::allocator > > >, vec_adj_list_vertex_id_map, detail::edge_desc_impl, detail::edge_desc_impl&>; typename property_traits::value_type = double; typename graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/edmonds_karp_max_flow.hpp:154:41: required from ‘static typename boost::detail::edge_capacity_value::type boost::detail::edmonds_karp_dispatch2::apply(Graph&, typename boost::graph_traits::vertex_descriptor, typename boost::graph_traits::vertex_descriptor, PredMap, const boost::bgl_named_params&, boost::param_not_found) [with Graph = boost::adjacency_list > > > >; PredMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator*, std::vector, std::allocator > > >, boost::vec_adj_list_vertex_id_map, boost::detail::edge_desc_impl, boost::detail::edge_desc_impl&>; P = int; T = boost::buffer_param_t; R = boost::no_property; typename boost::detail::edge_capacity_value::type = double; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/edmonds_karp_max_flow.hpp:208:54: required from ‘static typename boost::detail::edge_capacity_value::type boost::detail::edmonds_karp_dispatch1::apply(Graph&, typename boost::graph_traits::vertex_descriptor, typename boost::graph_traits::vertex_descriptor, const boost::bgl_named_params&, boost::param_not_found) [with Graph = boost::adjacency_list > > > >; P = int; T = boost::buffer_param_t; R = boost::no_property; typename boost::detail::edge_capacity_value::type = double; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/edmonds_karp_max_flow.hpp:228:57: required from ‘typename boost::detail::edge_capacity_value::type boost::edmonds_karp_max_flow(Graph&, typename graph_traits::vertex_descriptor, typename graph_traits::vertex_descriptor, const bgl_named_params&) [with Graph = adjacency_list > > > >; P = int; T = buffer_param_t; R = no_property; typename detail::edge_capacity_value::type = double; typename graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/edmonds_karp_max_flow.hpp:240:33: required from ‘typename boost::property_traits::const_type>::value_type boost::edmonds_karp_max_flow(Graph&, typename graph_traits::vertex_descriptor, typename graph_traits::vertex_descriptor) [with Graph = adjacency_list > > > >; typename property_traits::const_type>::value_type = double; typename property_map::const_type = adj_list_edge_property_map > > >, edge_capacity_t>; typename graph_traits::vertex_descriptor = long unsigned int]’ mincut.cpp:76:45: required from here /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/graph_concepts.hpp:75:15: note: in a call to non-static member function ‘boost::concepts::IncidenceGraphConcept > > > >, boost::is_residual_edge > > >, boost::edge_residual_capacity_t> >, boost::keep_all> >::~IncidenceGraphConcept()’ 75 | BOOST_concept(IncidenceGraph, (G)) : Graph< G > | ^~~~~~~~~~~~~~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/preprocessor/cat.hpp:29:34: note: in definition of macro ‘BOOST_PP_CAT_I’ 29 | # define BOOST_PP_CAT_I(a, b) a ## b | ^ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/concept_def.hpp:23:12: note: in expansion of macro ‘BOOST_PP_CAT’ 23 | struct BOOST_PP_CAT(name,Concept) \ | ^~~~~~~~~~~~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/graph_concepts.hpp:75:1: note: in expansion of macro ‘BOOST_concept’ 75 | BOOST_concept(IncidenceGraph, (G)) : Graph< G > | ^~~~~~~~~~~~~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::constraint::failed() [with Model = boost::BFSVisitorConcept*, std::vector, std::allocator > > >, boost::vec_adj_list_vertex_id_map, boost::detail::edge_desc_impl, boost::detail::edge_desc_impl&>, boost::on_tree_edge> >, boost::filtered_graph > > > >, boost::is_residual_edge > > >, boost::edge_residual_capacity_t> >, boost::keep_all> >]’: /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/breadth_first_search.hpp:65:5: required from ‘void boost::breadth_first_visit(const IncidenceGraph&, SourceIterator, SourceIterator, Buffer&, BFSVisitor, ColorMap) [with IncidenceGraph = filtered_graph > > > >, is_residual_edge > > >, edge_residual_capacity_t> >, keep_all>; Buffer = queue > >; BFSVisitor = bfs_visitor*, std::vector, std::allocator > > >, vec_adj_list_vertex_id_map, detail::edge_desc_impl, detail::edge_desc_impl&>, on_tree_edge> >; ColorMap = iterator_property_map<__gnu_cxx::__normal_iterator >, vec_adj_list_vertex_id_map, default_color_type, default_color_type&>; SourceIterator = long unsigned int*]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/breadth_first_search.hpp:136:24: required from ‘void boost::breadth_first_search(const VertexListGraph&, SourceIterator, SourceIterator, Buffer&, BFSVisitor, ColorMap) [with VertexListGraph = filtered_graph > > > >, is_residual_edge > > >, edge_residual_capacity_t> >, keep_all>; SourceIterator = long unsigned int*; Buffer = queue > >; BFSVisitor = bfs_visitor*, std::vector, std::allocator > > >, vec_adj_list_vertex_id_map, detail::edge_desc_impl, detail::edge_desc_impl&>, on_tree_edge> >; ColorMap = iterator_property_map<__gnu_cxx::__normal_iterator >, vec_adj_list_vertex_id_map, default_color_type, default_color_type&>]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/breadth_first_search.hpp:147:25: required from ‘void boost::breadth_first_search(const VertexListGraph&, typename graph_traits::vertex_descriptor, Buffer&, BFSVisitor, ColorMap) [with VertexListGraph = filtered_graph > > > >, is_residual_edge > > >, edge_residual_capacity_t> >, keep_all>; Buffer = queue > >; BFSVisitor = bfs_visitor*, std::vector, std::allocator > > >, vec_adj_list_vertex_id_map, detail::edge_desc_impl, detail::edge_desc_impl&>, on_tree_edge> >; ColorMap = iterator_property_map<__gnu_cxx::__normal_iterator >, vec_adj_list_vertex_id_map, default_color_type, default_color_type&>; typename graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/edmonds_karp_max_flow.hpp:101:29: required from ‘typename boost::property_traits::value_type boost::edmonds_karp_max_flow(Graph&, typename graph_traits::vertex_descriptor, typename graph_traits::vertex_descriptor, CapacityEdgeMap, ResidualCapacityEdgeMap, ReverseEdgeMap, ColorMap, PredEdgeMap) [with Graph = adjacency_list > > > >; CapacityEdgeMap = adj_list_edge_property_map > > >, edge_capacity_t>; ResidualCapacityEdgeMap = adj_list_edge_property_map > > >, edge_residual_capacity_t>; ReverseEdgeMap = adj_list_edge_property_map, const detail::edge_desc_impl&, long unsigned int, const property > > >, edge_reverse_t>; ColorMap = iterator_property_map<__gnu_cxx::__normal_iterator >, vec_adj_list_vertex_id_map, default_color_type, default_color_type&>; PredEdgeMap = iterator_property_map<__gnu_cxx::__normal_iterator*, std::vector, std::allocator > > >, vec_adj_list_vertex_id_map, detail::edge_desc_impl, detail::edge_desc_impl&>; typename property_traits::value_type = double; typename graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/edmonds_karp_max_flow.hpp:154:41: required from ‘static typename boost::detail::edge_capacity_value::type boost::detail::edmonds_karp_dispatch2::apply(Graph&, typename boost::graph_traits::vertex_descriptor, typename boost::graph_traits::vertex_descriptor, PredMap, const boost::bgl_named_params&, boost::param_not_found) [with Graph = boost::adjacency_list > > > >; PredMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator*, std::vector, std::allocator > > >, boost::vec_adj_list_vertex_id_map, boost::detail::edge_desc_impl, boost::detail::edge_desc_impl&>; P = int; T = boost::buffer_param_t; R = boost::no_property; typename boost::detail::edge_capacity_value::type = double; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/edmonds_karp_max_flow.hpp:208:54: required from ‘static typename boost::detail::edge_capacity_value::type boost::detail::edmonds_karp_dispatch1::apply(Graph&, typename boost::graph_traits::vertex_descriptor, typename boost::graph_traits::vertex_descriptor, const boost::bgl_named_params&, boost::param_not_found) [with Graph = boost::adjacency_list > > > >; P = int; T = boost::buffer_param_t; R = boost::no_property; typename boost::detail::edge_capacity_value::type = double; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/edmonds_karp_max_flow.hpp:228:57: required from ‘typename boost::detail::edge_capacity_value::type boost::edmonds_karp_max_flow(Graph&, typename graph_traits::vertex_descriptor, typename graph_traits::vertex_descriptor, const bgl_named_params&) [with Graph = adjacency_list > > > >; P = int; T = buffer_param_t; R = no_property; typename detail::edge_capacity_value::type = double; typename graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/edmonds_karp_max_flow.hpp:240:33: required from ‘typename boost::property_traits::const_type>::value_type boost::edmonds_karp_max_flow(Graph&, typename graph_traits::vertex_descriptor, typename graph_traits::vertex_descriptor) [with Graph = adjacency_list > > > >; typename property_traits::const_type>::value_type = double; typename property_map::const_type = adj_list_edge_property_map > > >, edge_capacity_t>; typename graph_traits::vertex_descriptor = long unsigned int]’ mincut.cpp:76:45: required from here /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:65:52: warning: ‘this’ pointer is null [-Wnonnull] 65 | static void failed() { ((Model*)0)->constraints(); } | ~~~~~~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/breadth_first_search.hpp:37:10: note: in a call to non-static member function ‘void boost::BFSVisitorConcept::constraints() [with Visitor = boost::bfs_visitor*, std::vector, std::allocator > > >, boost::vec_adj_list_vertex_id_map, boost::detail::edge_desc_impl, boost::detail::edge_desc_impl&>, boost::on_tree_edge> >; Graph = boost::filtered_graph > > > >, boost::is_residual_edge > > >, boost::edge_residual_capacity_t> >, boost::keep_all>]’ 37 | void constraints() | ^~~~~~~~~~~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::constraint::failed() [with Model = boost::ReadWritePropertyMapConcept >, boost::vec_adj_list_vertex_id_map, boost::default_color_type, boost::default_color_type&>, long unsigned int>]’: /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/breadth_first_search.hpp:66:5: required from ‘void boost::breadth_first_visit(const IncidenceGraph&, SourceIterator, SourceIterator, Buffer&, BFSVisitor, ColorMap) [with IncidenceGraph = filtered_graph > > > >, is_residual_edge > > >, edge_residual_capacity_t> >, keep_all>; Buffer = queue > >; BFSVisitor = bfs_visitor*, std::vector, std::allocator > > >, vec_adj_list_vertex_id_map, detail::edge_desc_impl, detail::edge_desc_impl&>, on_tree_edge> >; ColorMap = iterator_property_map<__gnu_cxx::__normal_iterator >, vec_adj_list_vertex_id_map, default_color_type, default_color_type&>; SourceIterator = long unsigned int*]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/breadth_first_search.hpp:136:24: required from ‘void boost::breadth_first_search(const VertexListGraph&, SourceIterator, SourceIterator, Buffer&, BFSVisitor, ColorMap) [with VertexListGraph = filtered_graph > > > >, is_residual_edge > > >, edge_residual_capacity_t> >, keep_all>; SourceIterator = long unsigned int*; Buffer = queue > >; BFSVisitor = bfs_visitor*, std::vector, std::allocator > > >, vec_adj_list_vertex_id_map, detail::edge_desc_impl, detail::edge_desc_impl&>, on_tree_edge> >; ColorMap = iterator_property_map<__gnu_cxx::__normal_iterator >, vec_adj_list_vertex_id_map, default_color_type, default_color_type&>]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/breadth_first_search.hpp:147:25: required from ‘void boost::breadth_first_search(const VertexListGraph&, typename graph_traits::vertex_descriptor, Buffer&, BFSVisitor, ColorMap) [with VertexListGraph = filtered_graph > > > >, is_residual_edge > > >, edge_residual_capacity_t> >, keep_all>; Buffer = queue > >; BFSVisitor = bfs_visitor*, std::vector, std::allocator > > >, vec_adj_list_vertex_id_map, detail::edge_desc_impl, detail::edge_desc_impl&>, on_tree_edge> >; ColorMap = iterator_property_map<__gnu_cxx::__normal_iterator >, vec_adj_list_vertex_id_map, default_color_type, default_color_type&>; typename graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/edmonds_karp_max_flow.hpp:101:29: required from ‘typename boost::property_traits::value_type boost::edmonds_karp_max_flow(Graph&, typename graph_traits::vertex_descriptor, typename graph_traits::vertex_descriptor, CapacityEdgeMap, ResidualCapacityEdgeMap, ReverseEdgeMap, ColorMap, PredEdgeMap) [with Graph = adjacency_list > > > >; CapacityEdgeMap = adj_list_edge_property_map > > >, edge_capacity_t>; ResidualCapacityEdgeMap = adj_list_edge_property_map > > >, edge_residual_capacity_t>; ReverseEdgeMap = adj_list_edge_property_map, const detail::edge_desc_impl&, long unsigned int, const property > > >, edge_reverse_t>; ColorMap = iterator_property_map<__gnu_cxx::__normal_iterator >, vec_adj_list_vertex_id_map, default_color_type, default_color_type&>; PredEdgeMap = iterator_property_map<__gnu_cxx::__normal_iterator*, std::vector, std::allocator > > >, vec_adj_list_vertex_id_map, detail::edge_desc_impl, detail::edge_desc_impl&>; typename property_traits::value_type = double; typename graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/edmonds_karp_max_flow.hpp:154:41: required from ‘static typename boost::detail::edge_capacity_value::type boost::detail::edmonds_karp_dispatch2::apply(Graph&, typename boost::graph_traits::vertex_descriptor, typename boost::graph_traits::vertex_descriptor, PredMap, const boost::bgl_named_params&, boost::param_not_found) [with Graph = boost::adjacency_list > > > >; PredMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator*, std::vector, std::allocator > > >, boost::vec_adj_list_vertex_id_map, boost::detail::edge_desc_impl, boost::detail::edge_desc_impl&>; P = int; T = boost::buffer_param_t; R = boost::no_property; typename boost::detail::edge_capacity_value::type = double; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/edmonds_karp_max_flow.hpp:208:54: required from ‘static typename boost::detail::edge_capacity_value::type boost::detail::edmonds_karp_dispatch1::apply(Graph&, typename boost::graph_traits::vertex_descriptor, typename boost::graph_traits::vertex_descriptor, const boost::bgl_named_params&, boost::param_not_found) [with Graph = boost::adjacency_list > > > >; P = int; T = boost::buffer_param_t; R = boost::no_property; typename boost::detail::edge_capacity_value::type = double; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/edmonds_karp_max_flow.hpp:228:57: required from ‘typename boost::detail::edge_capacity_value::type boost::edmonds_karp_max_flow(Graph&, typename graph_traits::vertex_descriptor, typename graph_traits::vertex_descriptor, const bgl_named_params&) [with Graph = adjacency_list > > > >; P = int; T = buffer_param_t; R = no_property; typename detail::edge_capacity_value::type = double; typename graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/edmonds_karp_max_flow.hpp:240:33: required from ‘typename boost::property_traits::const_type>::value_type boost::edmonds_karp_max_flow(Graph&, typename graph_traits::vertex_descriptor, typename graph_traits::vertex_descriptor) [with Graph = adjacency_list > > > >; typename property_traits::const_type>::value_type = double; typename property_map::const_type = adj_list_edge_property_map > > >, edge_capacity_t>; typename graph_traits::vertex_descriptor = long unsigned int]’ mincut.cpp:76:45: required from here /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:65:52: warning: ‘this’ pointer is null [-Wnonnull] 65 | static void failed() { ((Model*)0)->constraints(); } | ~~~~~~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/property_map/property_map.hpp:205:10: note: in a call to non-static member function ‘void boost::ReadWritePropertyMapConcept::constraints() [with PMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map, boost::default_color_type, boost::default_color_type&>; Key = long unsigned int]’ 205 | void constraints() { | ^~~~~~~~~~~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements >]’: /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:137:5: required from ‘struct boost::DefaultConstructible’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::DefaultConstructible]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied >::value’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_)>’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/graph_concepts.hpp:68:9: [ skipping 10 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/breadth_first_search.hpp:62:5: required from ‘void boost::breadth_first_visit(const IncidenceGraph&, SourceIterator, SourceIterator, Buffer&, BFSVisitor, ColorMap) [with IncidenceGraph = filtered_graph > > >, no_property, listS>, is_residual_edge > > >, edge_residual_capacity_t> >, keep_all>; Buffer = queue > >; BFSVisitor = bfs_visitor*, on_tree_edge> >; ColorMap = default_color_type*; SourceIterator = long unsigned int*]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/breadth_first_search.hpp:136:24: required from ‘void boost::breadth_first_search(const VertexListGraph&, SourceIterator, SourceIterator, Buffer&, BFSVisitor, ColorMap) [with VertexListGraph = filtered_graph > > >, no_property, listS>, is_residual_edge > > >, edge_residual_capacity_t> >, keep_all>; SourceIterator = long unsigned int*; Buffer = queue > >; BFSVisitor = bfs_visitor*, on_tree_edge> >; ColorMap = default_color_type*]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/breadth_first_search.hpp:147:25: required from ‘void boost::breadth_first_search(const VertexListGraph&, typename graph_traits::vertex_descriptor, Buffer&, BFSVisitor, ColorMap) [with VertexListGraph = filtered_graph > > >, no_property, listS>, is_residual_edge > > >, edge_residual_capacity_t> >, keep_all>; Buffer = queue > >; BFSVisitor = bfs_visitor*, on_tree_edge> >; ColorMap = default_color_type*; typename graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/edmonds_karp_max_flow.hpp:101:29: required from ‘typename boost::property_traits::value_type boost::edmonds_karp_max_flow(Graph&, typename graph_traits::vertex_descriptor, typename graph_traits::vertex_descriptor, CapacityEdgeMap, ResidualCapacityEdgeMap, ReverseEdgeMap, ColorMap, PredEdgeMap) [with Graph = adjacency_list > > >, no_property, listS>; CapacityEdgeMap = adj_list_edge_property_map > > >, edge_capacity_t>; ResidualCapacityEdgeMap = adj_list_edge_property_map > > >, edge_residual_capacity_t>; ReverseEdgeMap = adj_list_edge_property_map, detail::edge_desc_impl&, long unsigned int, property > > >, edge_reverse_t>; ColorMap = default_color_type*; PredEdgeMap = detail::edge_desc_impl*; typename property_traits::value_type = long unsigned int; typename graph_traits::vertex_descriptor = long unsigned int]’ mincut.hpp:78:21: required from ‘typename boost::graph_traits::edges_size_type boost::min_cut(VertexListGraph&, OutputIterator, OutputIterator) [with VertexListGraph = R_adjacency_list; OutputIterator = std::back_insert_iterator >; typename graph_traits::edges_size_type = long unsigned int]’ mincut.cpp:128:35: required from here /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::DefaultConstructible]’ 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ^ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::DefaultConstructible]’: /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/graph_concepts.hpp:68:9: required from ‘boost::concepts::Graph::~Graph() [with G = boost::filtered_graph > > >, boost::no_property, boost::listS>, boost::is_residual_edge > > >, boost::edge_residual_capacity_t> >, boost::keep_all>]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/usage.hpp:20:48: required from ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::concepts::Graph > > >, boost::no_property, boost::listS>, boost::is_residual_edge > > >, boost::edge_residual_capacity_t> >, boost::keep_all> >]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements > > >, boost::no_property, boost::listS>, boost::is_residual_edge > > >, boost::edge_residual_capacity_t> >, boost::keep_all> > >]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/graph_concepts.hpp:66:5: required from ‘struct boost::concepts::Graph > > >, boost::no_property, boost::listS>, boost::is_residual_edge > > >, boost::edge_residual_capacity_t> >, boost::keep_all> >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/graph_concepts.hpp:75:1: required from ‘struct boost::concepts::IncidenceGraph > > >, boost::no_property, boost::listS>, boost::is_residual_edge > > >, boost::edge_residual_capacity_t> >, boost::keep_all> >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/graph_concepts.hpp:75:1: [ skipping 5 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/breadth_first_search.hpp:62:5: required from ‘void boost::breadth_first_visit(const IncidenceGraph&, SourceIterator, SourceIterator, Buffer&, BFSVisitor, ColorMap) [with IncidenceGraph = filtered_graph > > >, no_property, listS>, is_residual_edge > > >, edge_residual_capacity_t> >, keep_all>; Buffer = queue > >; BFSVisitor = bfs_visitor*, on_tree_edge> >; ColorMap = default_color_type*; SourceIterator = long unsigned int*]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/breadth_first_search.hpp:136:24: required from ‘void boost::breadth_first_search(const VertexListGraph&, SourceIterator, SourceIterator, Buffer&, BFSVisitor, ColorMap) [with VertexListGraph = filtered_graph > > >, no_property, listS>, is_residual_edge > > >, edge_residual_capacity_t> >, keep_all>; SourceIterator = long unsigned int*; Buffer = queue > >; BFSVisitor = bfs_visitor*, on_tree_edge> >; ColorMap = default_color_type*]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/breadth_first_search.hpp:147:25: required from ‘void boost::breadth_first_search(const VertexListGraph&, typename graph_traits::vertex_descriptor, Buffer&, BFSVisitor, ColorMap) [with VertexListGraph = filtered_graph > > >, no_property, listS>, is_residual_edge > > >, edge_residual_capacity_t> >, keep_all>; Buffer = queue > >; BFSVisitor = bfs_visitor*, on_tree_edge> >; ColorMap = default_color_type*; typename graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/edmonds_karp_max_flow.hpp:101:29: required from ‘typename boost::property_traits::value_type boost::edmonds_karp_max_flow(Graph&, typename graph_traits::vertex_descriptor, typename graph_traits::vertex_descriptor, CapacityEdgeMap, ResidualCapacityEdgeMap, ReverseEdgeMap, ColorMap, PredEdgeMap) [with Graph = adjacency_list > > >, no_property, listS>; CapacityEdgeMap = adj_list_edge_property_map > > >, edge_capacity_t>; ResidualCapacityEdgeMap = adj_list_edge_property_map > > >, edge_residual_capacity_t>; ReverseEdgeMap = adj_list_edge_property_map, detail::edge_desc_impl&, long unsigned int, property > > >, edge_reverse_t>; ColorMap = default_color_type*; PredEdgeMap = detail::edge_desc_impl*; typename property_traits::value_type = long unsigned int; typename graph_traits::vertex_descriptor = long unsigned int]’ mincut.hpp:78:21: required from ‘typename boost::graph_traits::edges_size_type boost::min_cut(VertexListGraph&, OutputIterator, OutputIterator) [with VertexListGraph = R_adjacency_list; OutputIterator = std::back_insert_iterator >; typename graph_traits::edges_size_type = long unsigned int]’ mincut.cpp:128:35: required from here /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::DefaultConstructible::~DefaultConstructible() [with TT = long unsigned int]’ 37 | ~model() | ^ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:137:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 137 | BOOST_CONCEPT_USAGE(DefaultConstructible) { | ^~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements >]’: /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:233:5: required from ‘struct boost::EqualityComparable’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::EqualityComparable]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied >::value’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_)>’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/graph_concepts.hpp:69:9: [ skipping 10 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/breadth_first_search.hpp:62:5: required from ‘void boost::breadth_first_visit(const IncidenceGraph&, SourceIterator, SourceIterator, Buffer&, BFSVisitor, ColorMap) [with IncidenceGraph = filtered_graph > > >, no_property, listS>, is_residual_edge > > >, edge_residual_capacity_t> >, keep_all>; Buffer = queue > >; BFSVisitor = bfs_visitor*, on_tree_edge> >; ColorMap = default_color_type*; SourceIterator = long unsigned int*]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/breadth_first_search.hpp:136:24: required from ‘void boost::breadth_first_search(const VertexListGraph&, SourceIterator, SourceIterator, Buffer&, BFSVisitor, ColorMap) [with VertexListGraph = filtered_graph > > >, no_property, listS>, is_residual_edge > > >, edge_residual_capacity_t> >, keep_all>; SourceIterator = long unsigned int*; Buffer = queue > >; BFSVisitor = bfs_visitor*, on_tree_edge> >; ColorMap = default_color_type*]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/breadth_first_search.hpp:147:25: required from ‘void boost::breadth_first_search(const VertexListGraph&, typename graph_traits::vertex_descriptor, Buffer&, BFSVisitor, ColorMap) [with VertexListGraph = filtered_graph > > >, no_property, listS>, is_residual_edge > > >, edge_residual_capacity_t> >, keep_all>; Buffer = queue > >; BFSVisitor = bfs_visitor*, on_tree_edge> >; ColorMap = default_color_type*; typename graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/edmonds_karp_max_flow.hpp:101:29: required from ‘typename boost::property_traits::value_type boost::edmonds_karp_max_flow(Graph&, typename graph_traits::vertex_descriptor, typename graph_traits::vertex_descriptor, CapacityEdgeMap, ResidualCapacityEdgeMap, ReverseEdgeMap, ColorMap, PredEdgeMap) [with Graph = adjacency_list > > >, no_property, listS>; CapacityEdgeMap = adj_list_edge_property_map > > >, edge_capacity_t>; ResidualCapacityEdgeMap = adj_list_edge_property_map > > >, edge_residual_capacity_t>; ReverseEdgeMap = adj_list_edge_property_map, detail::edge_desc_impl&, long unsigned int, property > > >, edge_reverse_t>; ColorMap = default_color_type*; PredEdgeMap = detail::edge_desc_impl*; typename property_traits::value_type = long unsigned int; typename graph_traits::vertex_descriptor = long unsigned int]’ mincut.hpp:78:21: required from ‘typename boost::graph_traits::edges_size_type boost::min_cut(VertexListGraph&, OutputIterator, OutputIterator) [with VertexListGraph = R_adjacency_list; OutputIterator = std::back_insert_iterator >; typename graph_traits::edges_size_type = long unsigned int]’ mincut.cpp:128:35: required from here /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::EqualityComparable]’ 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ^ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::EqualityComparable]’: /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/graph_concepts.hpp:69:9: required from ‘boost::concepts::Graph::~Graph() [with G = boost::filtered_graph > > >, boost::no_property, boost::listS>, boost::is_residual_edge > > >, boost::edge_residual_capacity_t> >, boost::keep_all>]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/usage.hpp:20:48: required from ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::concepts::Graph > > >, boost::no_property, boost::listS>, boost::is_residual_edge > > >, boost::edge_residual_capacity_t> >, boost::keep_all> >]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements > > >, boost::no_property, boost::listS>, boost::is_residual_edge > > >, boost::edge_residual_capacity_t> >, boost::keep_all> > >]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/graph_concepts.hpp:66:5: required from ‘struct boost::concepts::Graph > > >, boost::no_property, boost::listS>, boost::is_residual_edge > > >, boost::edge_residual_capacity_t> >, boost::keep_all> >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/graph_concepts.hpp:75:1: required from ‘struct boost::concepts::IncidenceGraph > > >, boost::no_property, boost::listS>, boost::is_residual_edge > > >, boost::edge_residual_capacity_t> >, boost::keep_all> >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/graph_concepts.hpp:75:1: [ skipping 5 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/breadth_first_search.hpp:62:5: required from ‘void boost::breadth_first_visit(const IncidenceGraph&, SourceIterator, SourceIterator, Buffer&, BFSVisitor, ColorMap) [with IncidenceGraph = filtered_graph > > >, no_property, listS>, is_residual_edge > > >, edge_residual_capacity_t> >, keep_all>; Buffer = queue > >; BFSVisitor = bfs_visitor*, on_tree_edge> >; ColorMap = default_color_type*; SourceIterator = long unsigned int*]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/breadth_first_search.hpp:136:24: required from ‘void boost::breadth_first_search(const VertexListGraph&, SourceIterator, SourceIterator, Buffer&, BFSVisitor, ColorMap) [with VertexListGraph = filtered_graph > > >, no_property, listS>, is_residual_edge > > >, edge_residual_capacity_t> >, keep_all>; SourceIterator = long unsigned int*; Buffer = queue > >; BFSVisitor = bfs_visitor*, on_tree_edge> >; ColorMap = default_color_type*]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/breadth_first_search.hpp:147:25: required from ‘void boost::breadth_first_search(const VertexListGraph&, typename graph_traits::vertex_descriptor, Buffer&, BFSVisitor, ColorMap) [with VertexListGraph = filtered_graph > > >, no_property, listS>, is_residual_edge > > >, edge_residual_capacity_t> >, keep_all>; Buffer = queue > >; BFSVisitor = bfs_visitor*, on_tree_edge> >; ColorMap = default_color_type*; typename graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/edmonds_karp_max_flow.hpp:101:29: required from ‘typename boost::property_traits::value_type boost::edmonds_karp_max_flow(Graph&, typename graph_traits::vertex_descriptor, typename graph_traits::vertex_descriptor, CapacityEdgeMap, ResidualCapacityEdgeMap, ReverseEdgeMap, ColorMap, PredEdgeMap) [with Graph = adjacency_list > > >, no_property, listS>; CapacityEdgeMap = adj_list_edge_property_map > > >, edge_capacity_t>; ResidualCapacityEdgeMap = adj_list_edge_property_map > > >, edge_residual_capacity_t>; ReverseEdgeMap = adj_list_edge_property_map, detail::edge_desc_impl&, long unsigned int, property > > >, edge_reverse_t>; ColorMap = default_color_type*; PredEdgeMap = detail::edge_desc_impl*; typename property_traits::value_type = long unsigned int; typename graph_traits::vertex_descriptor = long unsigned int]’ mincut.hpp:78:21: required from ‘typename boost::graph_traits::edges_size_type boost::min_cut(VertexListGraph&, OutputIterator, OutputIterator) [with VertexListGraph = R_adjacency_list; OutputIterator = std::back_insert_iterator >; typename graph_traits::edges_size_type = long unsigned int]’ mincut.cpp:128:35: required from here /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::EqualityComparable::~EqualityComparable() [with TT = long unsigned int]’ 37 | ~model() | ^ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:233:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 233 | BOOST_CONCEPT_USAGE(EqualityComparable) { | ^~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements >]’: /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:145:5: required from ‘struct boost::Assignable’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::Assignable]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied >::value’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_)>’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/graph_concepts.hpp:70:9: [ skipping 10 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/breadth_first_search.hpp:62:5: required from ‘void boost::breadth_first_visit(const IncidenceGraph&, SourceIterator, SourceIterator, Buffer&, BFSVisitor, ColorMap) [with IncidenceGraph = filtered_graph > > >, no_property, listS>, is_residual_edge > > >, edge_residual_capacity_t> >, keep_all>; Buffer = queue > >; BFSVisitor = bfs_visitor*, on_tree_edge> >; ColorMap = default_color_type*; SourceIterator = long unsigned int*]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/breadth_first_search.hpp:136:24: required from ‘void boost::breadth_first_search(const VertexListGraph&, SourceIterator, SourceIterator, Buffer&, BFSVisitor, ColorMap) [with VertexListGraph = filtered_graph > > >, no_property, listS>, is_residual_edge > > >, edge_residual_capacity_t> >, keep_all>; SourceIterator = long unsigned int*; Buffer = queue > >; BFSVisitor = bfs_visitor*, on_tree_edge> >; ColorMap = default_color_type*]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/breadth_first_search.hpp:147:25: required from ‘void boost::breadth_first_search(const VertexListGraph&, typename graph_traits::vertex_descriptor, Buffer&, BFSVisitor, ColorMap) [with VertexListGraph = filtered_graph > > >, no_property, listS>, is_residual_edge > > >, edge_residual_capacity_t> >, keep_all>; Buffer = queue > >; BFSVisitor = bfs_visitor*, on_tree_edge> >; ColorMap = default_color_type*; typename graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/edmonds_karp_max_flow.hpp:101:29: required from ‘typename boost::property_traits::value_type boost::edmonds_karp_max_flow(Graph&, typename graph_traits::vertex_descriptor, typename graph_traits::vertex_descriptor, CapacityEdgeMap, ResidualCapacityEdgeMap, ReverseEdgeMap, ColorMap, PredEdgeMap) [with Graph = adjacency_list > > >, no_property, listS>; CapacityEdgeMap = adj_list_edge_property_map > > >, edge_capacity_t>; ResidualCapacityEdgeMap = adj_list_edge_property_map > > >, edge_residual_capacity_t>; ReverseEdgeMap = adj_list_edge_property_map, detail::edge_desc_impl&, long unsigned int, property > > >, edge_reverse_t>; ColorMap = default_color_type*; PredEdgeMap = detail::edge_desc_impl*; typename property_traits::value_type = long unsigned int; typename graph_traits::vertex_descriptor = long unsigned int]’ mincut.hpp:78:21: required from ‘typename boost::graph_traits::edges_size_type boost::min_cut(VertexListGraph&, OutputIterator, OutputIterator) [with VertexListGraph = R_adjacency_list; OutputIterator = std::back_insert_iterator >; typename graph_traits::edges_size_type = long unsigned int]’ mincut.cpp:128:35: required from here /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::Assignable]’ 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ^ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::Assignable]’: /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/graph_concepts.hpp:70:9: required from ‘boost::concepts::Graph::~Graph() [with G = boost::filtered_graph > > >, boost::no_property, boost::listS>, boost::is_residual_edge > > >, boost::edge_residual_capacity_t> >, boost::keep_all>]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/usage.hpp:20:48: required from ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::concepts::Graph > > >, boost::no_property, boost::listS>, boost::is_residual_edge > > >, boost::edge_residual_capacity_t> >, boost::keep_all> >]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements > > >, boost::no_property, boost::listS>, boost::is_residual_edge > > >, boost::edge_residual_capacity_t> >, boost::keep_all> > >]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/graph_concepts.hpp:66:5: required from ‘struct boost::concepts::Graph > > >, boost::no_property, boost::listS>, boost::is_residual_edge > > >, boost::edge_residual_capacity_t> >, boost::keep_all> >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/graph_concepts.hpp:75:1: required from ‘struct boost::concepts::IncidenceGraph > > >, boost::no_property, boost::listS>, boost::is_residual_edge > > >, boost::edge_residual_capacity_t> >, boost::keep_all> >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/graph_concepts.hpp:75:1: [ skipping 5 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/breadth_first_search.hpp:62:5: required from ‘void boost::breadth_first_visit(const IncidenceGraph&, SourceIterator, SourceIterator, Buffer&, BFSVisitor, ColorMap) [with IncidenceGraph = filtered_graph > > >, no_property, listS>, is_residual_edge > > >, edge_residual_capacity_t> >, keep_all>; Buffer = queue > >; BFSVisitor = bfs_visitor*, on_tree_edge> >; ColorMap = default_color_type*; SourceIterator = long unsigned int*]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/breadth_first_search.hpp:136:24: required from ‘void boost::breadth_first_search(const VertexListGraph&, SourceIterator, SourceIterator, Buffer&, BFSVisitor, ColorMap) [with VertexListGraph = filtered_graph > > >, no_property, listS>, is_residual_edge > > >, edge_residual_capacity_t> >, keep_all>; SourceIterator = long unsigned int*; Buffer = queue > >; BFSVisitor = bfs_visitor*, on_tree_edge> >; ColorMap = default_color_type*]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/breadth_first_search.hpp:147:25: required from ‘void boost::breadth_first_search(const VertexListGraph&, typename graph_traits::vertex_descriptor, Buffer&, BFSVisitor, ColorMap) [with VertexListGraph = filtered_graph > > >, no_property, listS>, is_residual_edge > > >, edge_residual_capacity_t> >, keep_all>; Buffer = queue > >; BFSVisitor = bfs_visitor*, on_tree_edge> >; ColorMap = default_color_type*; typename graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/edmonds_karp_max_flow.hpp:101:29: required from ‘typename boost::property_traits::value_type boost::edmonds_karp_max_flow(Graph&, typename graph_traits::vertex_descriptor, typename graph_traits::vertex_descriptor, CapacityEdgeMap, ResidualCapacityEdgeMap, ReverseEdgeMap, ColorMap, PredEdgeMap) [with Graph = adjacency_list > > >, no_property, listS>; CapacityEdgeMap = adj_list_edge_property_map > > >, edge_capacity_t>; ResidualCapacityEdgeMap = adj_list_edge_property_map > > >, edge_residual_capacity_t>; ReverseEdgeMap = adj_list_edge_property_map, detail::edge_desc_impl&, long unsigned int, property > > >, edge_reverse_t>; ColorMap = default_color_type*; PredEdgeMap = detail::edge_desc_impl*; typename property_traits::value_type = long unsigned int; typename graph_traits::vertex_descriptor = long unsigned int]’ mincut.hpp:78:21: required from ‘typename boost::graph_traits::edges_size_type boost::min_cut(VertexListGraph&, OutputIterator, OutputIterator) [with VertexListGraph = R_adjacency_list; OutputIterator = std::back_insert_iterator >; typename graph_traits::edges_size_type = long unsigned int]’ mincut.cpp:128:35: required from here /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::Assignable::~Assignable() [with TT = long unsigned int]’ 37 | ~model() | ^ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:145:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 145 | BOOST_CONCEPT_USAGE(Assignable) { | ^~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::concepts::MultiPassInputIterator > > >, boost::edge_residual_capacity_t> >, boost::keep_all, boost::filtered_graph > > >, boost::no_property, boost::listS>, boost::is_residual_edge > > >, boost::edge_residual_capacity_t> >, boost::keep_all> >, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > > > >*, std::vector > > > >, std::allocator > > > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >]’: /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements > > >, boost::edge_residual_capacity_t> >, boost::keep_all, boost::filtered_graph > > >, boost::no_property, boost::listS>, boost::is_residual_edge > > >, boost::edge_residual_capacity_t> >, boost::keep_all> >, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > > > >*, std::vector > > > >, std::allocator > > > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > > >]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/graph_concepts.hpp:52:50: required from ‘struct boost::concepts::MultiPassInputIterator > > >, boost::edge_residual_capacity_t> >, boost::keep_all, boost::filtered_graph > > >, boost::no_property, boost::listS>, boost::is_residual_edge > > >, boost::edge_residual_capacity_t> >, boost::keep_all> >, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > > > >*, std::vector > > > >, std::allocator > > > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::concepts::MultiPassInputIterator > > >, boost::edge_residual_capacity_t> >, boost::keep_all, boost::filtered_graph > > >, boost::no_property, boost::listS>, boost::is_residual_edge > > >, boost::edge_residual_capacity_t> >, boost::keep_all> >, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > > > >*, std::vector > > > >, std::allocator > > > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied > > >, boost::edge_residual_capacity_t> >, boost::keep_all, boost::filtered_graph > > >, boost::no_property, boost::listS>, boost::is_residual_edge > > >, boost::edge_residual_capacity_t> >, boost::keep_all> >, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > > > >*, std::vector > > > >, std::allocator > > > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > > >::value’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied > > >, boost::edge_residual_capacity_t> >, boost::keep_all, boost::filtered_graph > > >, boost::no_property, boost::listS>, boost::is_residual_edge > > >, boost::edge_residual_capacity_t> >, boost::keep_all> >, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > > > >*, std::vector > > > >, std::allocator > > > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > > >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:72:8: [ skipping 3 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/breadth_first_search.hpp:62:5: required from ‘void boost::breadth_first_visit(const IncidenceGraph&, SourceIterator, SourceIterator, Buffer&, BFSVisitor, ColorMap) [with IncidenceGraph = filtered_graph > > >, no_property, listS>, is_residual_edge > > >, edge_residual_capacity_t> >, keep_all>; Buffer = queue > >; BFSVisitor = bfs_visitor*, on_tree_edge> >; ColorMap = default_color_type*; SourceIterator = long unsigned int*]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/breadth_first_search.hpp:136:24: required from ‘void boost::breadth_first_search(const VertexListGraph&, SourceIterator, SourceIterator, Buffer&, BFSVisitor, ColorMap) [with VertexListGraph = filtered_graph > > >, no_property, listS>, is_residual_edge > > >, edge_residual_capacity_t> >, keep_all>; SourceIterator = long unsigned int*; Buffer = queue > >; BFSVisitor = bfs_visitor*, on_tree_edge> >; ColorMap = default_color_type*]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/breadth_first_search.hpp:147:25: required from ‘void boost::breadth_first_search(const VertexListGraph&, typename graph_traits::vertex_descriptor, Buffer&, BFSVisitor, ColorMap) [with VertexListGraph = filtered_graph > > >, no_property, listS>, is_residual_edge > > >, edge_residual_capacity_t> >, keep_all>; Buffer = queue > >; BFSVisitor = bfs_visitor*, on_tree_edge> >; ColorMap = default_color_type*; typename graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/edmonds_karp_max_flow.hpp:101:29: required from ‘typename boost::property_traits::value_type boost::edmonds_karp_max_flow(Graph&, typename graph_traits::vertex_descriptor, typename graph_traits::vertex_descriptor, CapacityEdgeMap, ResidualCapacityEdgeMap, ReverseEdgeMap, ColorMap, PredEdgeMap) [with Graph = adjacency_list > > >, no_property, listS>; CapacityEdgeMap = adj_list_edge_property_map > > >, edge_capacity_t>; ResidualCapacityEdgeMap = adj_list_edge_property_map > > >, edge_residual_capacity_t>; ReverseEdgeMap = adj_list_edge_property_map, detail::edge_desc_impl&, long unsigned int, property > > >, edge_reverse_t>; ColorMap = default_color_type*; PredEdgeMap = detail::edge_desc_impl*; typename property_traits::value_type = long unsigned int; typename graph_traits::vertex_descriptor = long unsigned int]’ mincut.hpp:78:21: required from ‘typename boost::graph_traits::edges_size_type boost::min_cut(VertexListGraph&, OutputIterator, OutputIterator) [with VertexListGraph = R_adjacency_list; OutputIterator = std::back_insert_iterator >; typename graph_traits::edges_size_type = long unsigned int]’ mincut.cpp:128:35: required from here /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::concepts::MultiPassInputIterator::~MultiPassInputIterator() [with T = boost::iterators::filter_iterator > > >, boost::edge_residual_capacity_t> >, boost::keep_all, boost::filtered_graph > > >, boost::no_property, boost::listS>, boost::is_residual_edge > > >, boost::edge_residual_capacity_t> >, boost::keep_all> >, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > > > >*, std::vector > > > >, std::allocator > > > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> >]’ 37 | ~model() | ^ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/graph_concepts.hpp:52:50: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 52 | BOOST_concept(MultiPassInputIterator, (T)) { BOOST_CONCEPT_USAGE( | ^~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::DefaultConstructible >]’: /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements > >]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:137:5: required from ‘struct boost::DefaultConstructible >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::DefaultConstructible >]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied > >::value’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied > >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:72:8: [ skipping 3 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/breadth_first_search.hpp:62:5: required from ‘void boost::breadth_first_visit(const IncidenceGraph&, SourceIterator, SourceIterator, Buffer&, BFSVisitor, ColorMap) [with IncidenceGraph = filtered_graph > > >, no_property, listS>, is_residual_edge > > >, edge_residual_capacity_t> >, keep_all>; Buffer = queue > >; BFSVisitor = bfs_visitor*, on_tree_edge> >; ColorMap = default_color_type*; SourceIterator = long unsigned int*]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/breadth_first_search.hpp:136:24: required from ‘void boost::breadth_first_search(const VertexListGraph&, SourceIterator, SourceIterator, Buffer&, BFSVisitor, ColorMap) [with VertexListGraph = filtered_graph > > >, no_property, listS>, is_residual_edge > > >, edge_residual_capacity_t> >, keep_all>; SourceIterator = long unsigned int*; Buffer = queue > >; BFSVisitor = bfs_visitor*, on_tree_edge> >; ColorMap = default_color_type*]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/breadth_first_search.hpp:147:25: required from ‘void boost::breadth_first_search(const VertexListGraph&, typename graph_traits::vertex_descriptor, Buffer&, BFSVisitor, ColorMap) [with VertexListGraph = filtered_graph > > >, no_property, listS>, is_residual_edge > > >, edge_residual_capacity_t> >, keep_all>; Buffer = queue > >; BFSVisitor = bfs_visitor*, on_tree_edge> >; ColorMap = default_color_type*; typename graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/edmonds_karp_max_flow.hpp:101:29: required from ‘typename boost::property_traits::value_type boost::edmonds_karp_max_flow(Graph&, typename graph_traits::vertex_descriptor, typename graph_traits::vertex_descriptor, CapacityEdgeMap, ResidualCapacityEdgeMap, ReverseEdgeMap, ColorMap, PredEdgeMap) [with Graph = adjacency_list > > >, no_property, listS>; CapacityEdgeMap = adj_list_edge_property_map > > >, edge_capacity_t>; ResidualCapacityEdgeMap = adj_list_edge_property_map > > >, edge_residual_capacity_t>; ReverseEdgeMap = adj_list_edge_property_map, detail::edge_desc_impl&, long unsigned int, property > > >, edge_reverse_t>; ColorMap = default_color_type*; PredEdgeMap = detail::edge_desc_impl*; typename property_traits::value_type = long unsigned int; typename graph_traits::vertex_descriptor = long unsigned int]’ mincut.hpp:78:21: required from ‘typename boost::graph_traits::edges_size_type boost::min_cut(VertexListGraph&, OutputIterator, OutputIterator) [with VertexListGraph = R_adjacency_list; OutputIterator = std::back_insert_iterator >; typename graph_traits::edges_size_type = long unsigned int]’ mincut.cpp:128:35: required from here /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::DefaultConstructible::~DefaultConstructible() [with TT = boost::detail::edge_desc_impl]’ 37 | ~model() | ^ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:137:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 137 | BOOST_CONCEPT_USAGE(DefaultConstructible) { | ^~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::EqualityComparable >]’: /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements > >]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:233:5: required from ‘struct boost::EqualityComparable >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::EqualityComparable >]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied > >::value’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied > >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:72:8: [ skipping 3 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/breadth_first_search.hpp:62:5: required from ‘void boost::breadth_first_visit(const IncidenceGraph&, SourceIterator, SourceIterator, Buffer&, BFSVisitor, ColorMap) [with IncidenceGraph = filtered_graph > > >, no_property, listS>, is_residual_edge > > >, edge_residual_capacity_t> >, keep_all>; Buffer = queue > >; BFSVisitor = bfs_visitor*, on_tree_edge> >; ColorMap = default_color_type*; SourceIterator = long unsigned int*]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/breadth_first_search.hpp:136:24: required from ‘void boost::breadth_first_search(const VertexListGraph&, SourceIterator, SourceIterator, Buffer&, BFSVisitor, ColorMap) [with VertexListGraph = filtered_graph > > >, no_property, listS>, is_residual_edge > > >, edge_residual_capacity_t> >, keep_all>; SourceIterator = long unsigned int*; Buffer = queue > >; BFSVisitor = bfs_visitor*, on_tree_edge> >; ColorMap = default_color_type*]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/breadth_first_search.hpp:147:25: required from ‘void boost::breadth_first_search(const VertexListGraph&, typename graph_traits::vertex_descriptor, Buffer&, BFSVisitor, ColorMap) [with VertexListGraph = filtered_graph > > >, no_property, listS>, is_residual_edge > > >, edge_residual_capacity_t> >, keep_all>; Buffer = queue > >; BFSVisitor = bfs_visitor*, on_tree_edge> >; ColorMap = default_color_type*; typename graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/edmonds_karp_max_flow.hpp:101:29: required from ‘typename boost::property_traits::value_type boost::edmonds_karp_max_flow(Graph&, typename graph_traits::vertex_descriptor, typename graph_traits::vertex_descriptor, CapacityEdgeMap, ResidualCapacityEdgeMap, ReverseEdgeMap, ColorMap, PredEdgeMap) [with Graph = adjacency_list > > >, no_property, listS>; CapacityEdgeMap = adj_list_edge_property_map > > >, edge_capacity_t>; ResidualCapacityEdgeMap = adj_list_edge_property_map > > >, edge_residual_capacity_t>; ReverseEdgeMap = adj_list_edge_property_map, detail::edge_desc_impl&, long unsigned int, property > > >, edge_reverse_t>; ColorMap = default_color_type*; PredEdgeMap = detail::edge_desc_impl*; typename property_traits::value_type = long unsigned int; typename graph_traits::vertex_descriptor = long unsigned int]’ mincut.hpp:78:21: required from ‘typename boost::graph_traits::edges_size_type boost::min_cut(VertexListGraph&, OutputIterator, OutputIterator) [with VertexListGraph = R_adjacency_list; OutputIterator = std::back_insert_iterator >; typename graph_traits::edges_size_type = long unsigned int]’ mincut.cpp:128:35: required from here /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::EqualityComparable::~EqualityComparable() [with TT = boost::detail::edge_desc_impl]’ 37 | ~model() | ^ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:233:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 233 | BOOST_CONCEPT_USAGE(EqualityComparable) { | ^~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::Assignable >]’: /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements > >]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:145:5: required from ‘struct boost::Assignable >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::Assignable >]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied > >::value’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied > >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:72:8: [ skipping 3 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/breadth_first_search.hpp:62:5: required from ‘void boost::breadth_first_visit(const IncidenceGraph&, SourceIterator, SourceIterator, Buffer&, BFSVisitor, ColorMap) [with IncidenceGraph = filtered_graph > > >, no_property, listS>, is_residual_edge > > >, edge_residual_capacity_t> >, keep_all>; Buffer = queue > >; BFSVisitor = bfs_visitor*, on_tree_edge> >; ColorMap = default_color_type*; SourceIterator = long unsigned int*]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/breadth_first_search.hpp:136:24: required from ‘void boost::breadth_first_search(const VertexListGraph&, SourceIterator, SourceIterator, Buffer&, BFSVisitor, ColorMap) [with VertexListGraph = filtered_graph > > >, no_property, listS>, is_residual_edge > > >, edge_residual_capacity_t> >, keep_all>; SourceIterator = long unsigned int*; Buffer = queue > >; BFSVisitor = bfs_visitor*, on_tree_edge> >; ColorMap = default_color_type*]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/breadth_first_search.hpp:147:25: required from ‘void boost::breadth_first_search(const VertexListGraph&, typename graph_traits::vertex_descriptor, Buffer&, BFSVisitor, ColorMap) [with VertexListGraph = filtered_graph > > >, no_property, listS>, is_residual_edge > > >, edge_residual_capacity_t> >, keep_all>; Buffer = queue > >; BFSVisitor = bfs_visitor*, on_tree_edge> >; ColorMap = default_color_type*; typename graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/edmonds_karp_max_flow.hpp:101:29: required from ‘typename boost::property_traits::value_type boost::edmonds_karp_max_flow(Graph&, typename graph_traits::vertex_descriptor, typename graph_traits::vertex_descriptor, CapacityEdgeMap, ResidualCapacityEdgeMap, ReverseEdgeMap, ColorMap, PredEdgeMap) [with Graph = adjacency_list > > >, no_property, listS>; CapacityEdgeMap = adj_list_edge_property_map > > >, edge_capacity_t>; ResidualCapacityEdgeMap = adj_list_edge_property_map > > >, edge_residual_capacity_t>; ReverseEdgeMap = adj_list_edge_property_map, detail::edge_desc_impl&, long unsigned int, property > > >, edge_reverse_t>; ColorMap = default_color_type*; PredEdgeMap = detail::edge_desc_impl*; typename property_traits::value_type = long unsigned int; typename graph_traits::vertex_descriptor = long unsigned int]’ mincut.hpp:78:21: required from ‘typename boost::graph_traits::edges_size_type boost::min_cut(VertexListGraph&, OutputIterator, OutputIterator) [with VertexListGraph = R_adjacency_list; OutputIterator = std::back_insert_iterator >; typename graph_traits::edges_size_type = long unsigned int]’ mincut.cpp:128:35: required from here /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::Assignable::~Assignable() [with TT = boost::detail::edge_desc_impl]’ 37 | ~model() | ^ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:145:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 145 | BOOST_CONCEPT_USAGE(Assignable) { | ^~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::Convertible]’: /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements >]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:208:5: required from ‘struct boost::Convertible’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::Convertible]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied >::value’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:72:8: [ skipping 3 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/breadth_first_search.hpp:62:5: required from ‘void boost::breadth_first_visit(const IncidenceGraph&, SourceIterator, SourceIterator, Buffer&, BFSVisitor, ColorMap) [with IncidenceGraph = filtered_graph > > >, no_property, listS>, is_residual_edge > > >, edge_residual_capacity_t> >, keep_all>; Buffer = queue > >; BFSVisitor = bfs_visitor*, on_tree_edge> >; ColorMap = default_color_type*; SourceIterator = long unsigned int*]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/breadth_first_search.hpp:136:24: required from ‘void boost::breadth_first_search(const VertexListGraph&, SourceIterator, SourceIterator, Buffer&, BFSVisitor, ColorMap) [with VertexListGraph = filtered_graph > > >, no_property, listS>, is_residual_edge > > >, edge_residual_capacity_t> >, keep_all>; SourceIterator = long unsigned int*; Buffer = queue > >; BFSVisitor = bfs_visitor*, on_tree_edge> >; ColorMap = default_color_type*]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/breadth_first_search.hpp:147:25: required from ‘void boost::breadth_first_search(const VertexListGraph&, typename graph_traits::vertex_descriptor, Buffer&, BFSVisitor, ColorMap) [with VertexListGraph = filtered_graph > > >, no_property, listS>, is_residual_edge > > >, edge_residual_capacity_t> >, keep_all>; Buffer = queue > >; BFSVisitor = bfs_visitor*, on_tree_edge> >; ColorMap = default_color_type*; typename graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/edmonds_karp_max_flow.hpp:101:29: required from ‘typename boost::property_traits::value_type boost::edmonds_karp_max_flow(Graph&, typename graph_traits::vertex_descriptor, typename graph_traits::vertex_descriptor, CapacityEdgeMap, ResidualCapacityEdgeMap, ReverseEdgeMap, ColorMap, PredEdgeMap) [with Graph = adjacency_list > > >, no_property, listS>; CapacityEdgeMap = adj_list_edge_property_map > > >, edge_capacity_t>; ResidualCapacityEdgeMap = adj_list_edge_property_map > > >, edge_residual_capacity_t>; ReverseEdgeMap = adj_list_edge_property_map, detail::edge_desc_impl&, long unsigned int, property > > >, edge_reverse_t>; ColorMap = default_color_type*; PredEdgeMap = detail::edge_desc_impl*; typename property_traits::value_type = long unsigned int; typename graph_traits::vertex_descriptor = long unsigned int]’ mincut.hpp:78:21: required from ‘typename boost::graph_traits::edges_size_type boost::min_cut(VertexListGraph&, OutputIterator, OutputIterator) [with VertexListGraph = R_adjacency_list; OutputIterator = std::back_insert_iterator >; typename graph_traits::edges_size_type = long unsigned int]’ mincut.cpp:128:35: required from here /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::Convertible::~Convertible() [with X = boost::adj_list_dir_traversal_tag; Y = boost::incidence_graph_tag]’ 37 | ~model() | ^ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:208:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 208 | BOOST_CONCEPT_USAGE(Convertible) { | ^~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::Convertible]’: /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements >]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:208:5: required from ‘struct boost::Convertible’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:206:3: required from ‘struct boost::ConvertibleConcept’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::ConvertibleConcept]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied >::value’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:45:51: [ skipping 12 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/breadth_first_search.hpp:66:5: required from ‘void boost::breadth_first_visit(const IncidenceGraph&, SourceIterator, SourceIterator, Buffer&, BFSVisitor, ColorMap) [with IncidenceGraph = filtered_graph > > >, no_property, listS>, is_residual_edge > > >, edge_residual_capacity_t> >, keep_all>; Buffer = queue > >; BFSVisitor = bfs_visitor*, on_tree_edge> >; ColorMap = default_color_type*; SourceIterator = long unsigned int*]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/breadth_first_search.hpp:136:24: required from ‘void boost::breadth_first_search(const VertexListGraph&, SourceIterator, SourceIterator, Buffer&, BFSVisitor, ColorMap) [with VertexListGraph = filtered_graph > > >, no_property, listS>, is_residual_edge > > >, edge_residual_capacity_t> >, keep_all>; SourceIterator = long unsigned int*; Buffer = queue > >; BFSVisitor = bfs_visitor*, on_tree_edge> >; ColorMap = default_color_type*]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/breadth_first_search.hpp:147:25: required from ‘void boost::breadth_first_search(const VertexListGraph&, typename graph_traits::vertex_descriptor, Buffer&, BFSVisitor, ColorMap) [with VertexListGraph = filtered_graph > > >, no_property, listS>, is_residual_edge > > >, edge_residual_capacity_t> >, keep_all>; Buffer = queue > >; BFSVisitor = bfs_visitor*, on_tree_edge> >; ColorMap = default_color_type*; typename graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/edmonds_karp_max_flow.hpp:101:29: required from ‘typename boost::property_traits::value_type boost::edmonds_karp_max_flow(Graph&, typename graph_traits::vertex_descriptor, typename graph_traits::vertex_descriptor, CapacityEdgeMap, ResidualCapacityEdgeMap, ReverseEdgeMap, ColorMap, PredEdgeMap) [with Graph = adjacency_list > > >, no_property, listS>; CapacityEdgeMap = adj_list_edge_property_map > > >, edge_capacity_t>; ResidualCapacityEdgeMap = adj_list_edge_property_map > > >, edge_residual_capacity_t>; ReverseEdgeMap = adj_list_edge_property_map, detail::edge_desc_impl&, long unsigned int, property > > >, edge_reverse_t>; ColorMap = default_color_type*; PredEdgeMap = detail::edge_desc_impl*; typename property_traits::value_type = long unsigned int; typename graph_traits::vertex_descriptor = long unsigned int]’ mincut.hpp:78:21: required from ‘typename boost::graph_traits::edges_size_type boost::min_cut(VertexListGraph&, OutputIterator, OutputIterator) [with VertexListGraph = R_adjacency_list; OutputIterator = std::back_insert_iterator >; typename graph_traits::edges_size_type = long unsigned int]’ mincut.cpp:128:35: required from here /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::Convertible::~Convertible() [with X = boost::lvalue_property_map_tag; Y = boost::readable_property_map_tag]’ 37 | ~model() | ^ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:208:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 208 | BOOST_CONCEPT_USAGE(Convertible) { | ^~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::Convertible]’: /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements >]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:208:5: required from ‘struct boost::Convertible’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:206:3: required from ‘struct boost::ConvertibleConcept’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::ConvertibleConcept]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied >::value’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:45:51: [ skipping 12 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/breadth_first_search.hpp:66:5: required from ‘void boost::breadth_first_visit(const IncidenceGraph&, SourceIterator, SourceIterator, Buffer&, BFSVisitor, ColorMap) [with IncidenceGraph = filtered_graph > > >, no_property, listS>, is_residual_edge > > >, edge_residual_capacity_t> >, keep_all>; Buffer = queue > >; BFSVisitor = bfs_visitor*, on_tree_edge> >; ColorMap = default_color_type*; SourceIterator = long unsigned int*]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/breadth_first_search.hpp:136:24: required from ‘void boost::breadth_first_search(const VertexListGraph&, SourceIterator, SourceIterator, Buffer&, BFSVisitor, ColorMap) [with VertexListGraph = filtered_graph > > >, no_property, listS>, is_residual_edge > > >, edge_residual_capacity_t> >, keep_all>; SourceIterator = long unsigned int*; Buffer = queue > >; BFSVisitor = bfs_visitor*, on_tree_edge> >; ColorMap = default_color_type*]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/breadth_first_search.hpp:147:25: required from ‘void boost::breadth_first_search(const VertexListGraph&, typename graph_traits::vertex_descriptor, Buffer&, BFSVisitor, ColorMap) [with VertexListGraph = filtered_graph > > >, no_property, listS>, is_residual_edge > > >, edge_residual_capacity_t> >, keep_all>; Buffer = queue > >; BFSVisitor = bfs_visitor*, on_tree_edge> >; ColorMap = default_color_type*; typename graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/edmonds_karp_max_flow.hpp:101:29: required from ‘typename boost::property_traits::value_type boost::edmonds_karp_max_flow(Graph&, typename graph_traits::vertex_descriptor, typename graph_traits::vertex_descriptor, CapacityEdgeMap, ResidualCapacityEdgeMap, ReverseEdgeMap, ColorMap, PredEdgeMap) [with Graph = adjacency_list > > >, no_property, listS>; CapacityEdgeMap = adj_list_edge_property_map > > >, edge_capacity_t>; ResidualCapacityEdgeMap = adj_list_edge_property_map > > >, edge_residual_capacity_t>; ReverseEdgeMap = adj_list_edge_property_map, detail::edge_desc_impl&, long unsigned int, property > > >, edge_reverse_t>; ColorMap = default_color_type*; PredEdgeMap = detail::edge_desc_impl*; typename property_traits::value_type = long unsigned int; typename graph_traits::vertex_descriptor = long unsigned int]’ mincut.hpp:78:21: required from ‘typename boost::graph_traits::edges_size_type boost::min_cut(VertexListGraph&, OutputIterator, OutputIterator) [with VertexListGraph = R_adjacency_list; OutputIterator = std::back_insert_iterator >; typename graph_traits::edges_size_type = long unsigned int]’ mincut.cpp:128:35: required from here /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::Convertible::~Convertible() [with X = boost::lvalue_property_map_tag; Y = boost::writable_property_map_tag]’ 37 | ~model() | ^ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:208:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 208 | BOOST_CONCEPT_USAGE(Convertible) { | ^~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::concepts::Graph > > > >, boost::is_residual_edge > > >, boost::edge_residual_capacity_t> >, boost::keep_all> >]’: /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements > > > >, boost::is_residual_edge > > >, boost::edge_residual_capacity_t> >, boost::keep_all> > >]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/graph_concepts.hpp:66:5: required from ‘struct boost::concepts::Graph > > > >, boost::is_residual_edge > > >, boost::edge_residual_capacity_t> >, boost::keep_all> >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/graph_concepts.hpp:75:1: required from ‘struct boost::concepts::IncidenceGraph > > > >, boost::is_residual_edge > > >, boost::edge_residual_capacity_t> >, boost::keep_all> >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/graph_concepts.hpp:75:1: required from ‘struct boost::concepts::IncidenceGraphConcept > > > >, boost::is_residual_edge > > >, boost::edge_residual_capacity_t> >, boost::keep_all> >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::concepts::IncidenceGraphConcept > > > >, boost::is_residual_edge > > >, boost::edge_residual_capacity_t> >, boost::keep_all> >]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:42:5: [ skipping 6 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/edmonds_karp_max_flow.hpp:101:29: required from ‘typename boost::property_traits::value_type boost::edmonds_karp_max_flow(Graph&, typename graph_traits::vertex_descriptor, typename graph_traits::vertex_descriptor, CapacityEdgeMap, ResidualCapacityEdgeMap, ReverseEdgeMap, ColorMap, PredEdgeMap) [with Graph = adjacency_list > > > >; CapacityEdgeMap = adj_list_edge_property_map > > >, edge_capacity_t>; ResidualCapacityEdgeMap = adj_list_edge_property_map > > >, edge_residual_capacity_t>; ReverseEdgeMap = adj_list_edge_property_map, const detail::edge_desc_impl&, long unsigned int, const property > > >, edge_reverse_t>; ColorMap = iterator_property_map<__gnu_cxx::__normal_iterator >, vec_adj_list_vertex_id_map, default_color_type, default_color_type&>; PredEdgeMap = iterator_property_map<__gnu_cxx::__normal_iterator*, std::vector, std::allocator > > >, vec_adj_list_vertex_id_map, detail::edge_desc_impl, detail::edge_desc_impl&>; typename property_traits::value_type = double; typename graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/edmonds_karp_max_flow.hpp:154:41: required from ‘static typename boost::detail::edge_capacity_value::type boost::detail::edmonds_karp_dispatch2::apply(Graph&, typename boost::graph_traits::vertex_descriptor, typename boost::graph_traits::vertex_descriptor, PredMap, const boost::bgl_named_params&, boost::param_not_found) [with Graph = boost::adjacency_list > > > >; PredMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator*, std::vector, std::allocator > > >, boost::vec_adj_list_vertex_id_map, boost::detail::edge_desc_impl, boost::detail::edge_desc_impl&>; P = int; T = boost::buffer_param_t; R = boost::no_property; typename boost::detail::edge_capacity_value::type = double; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/edmonds_karp_max_flow.hpp:208:54: required from ‘static typename boost::detail::edge_capacity_value::type boost::detail::edmonds_karp_dispatch1::apply(Graph&, typename boost::graph_traits::vertex_descriptor, typename boost::graph_traits::vertex_descriptor, const boost::bgl_named_params&, boost::param_not_found) [with Graph = boost::adjacency_list > > > >; P = int; T = boost::buffer_param_t; R = boost::no_property; typename boost::detail::edge_capacity_value::type = double; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/edmonds_karp_max_flow.hpp:228:57: required from ‘typename boost::detail::edge_capacity_value::type boost::edmonds_karp_max_flow(Graph&, typename graph_traits::vertex_descriptor, typename graph_traits::vertex_descriptor, const bgl_named_params&) [with Graph = adjacency_list > > > >; P = int; T = buffer_param_t; R = no_property; typename detail::edge_capacity_value::type = double; typename graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/edmonds_karp_max_flow.hpp:240:33: required from ‘typename boost::property_traits::const_type>::value_type boost::edmonds_karp_max_flow(Graph&, typename graph_traits::vertex_descriptor, typename graph_traits::vertex_descriptor) [with Graph = adjacency_list > > > >; typename property_traits::const_type>::value_type = double; typename property_map::const_type = adj_list_edge_property_map > > >, edge_capacity_t>; typename graph_traits::vertex_descriptor = long unsigned int]’ mincut.cpp:76:45: required from here /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::concepts::Graph::~Graph() [with G = boost::filtered_graph > > > >, boost::is_residual_edge > > >, boost::edge_residual_capacity_t> >, boost::keep_all>]’ 37 | ~model() | ^ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/graph_concepts.hpp:66:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 66 | BOOST_CONCEPT_USAGE(Graph) | ^~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::concepts::IncidenceGraph > > > >, boost::is_residual_edge > > >, boost::edge_residual_capacity_t> >, boost::keep_all> >]’: /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements > > > >, boost::is_residual_edge > > >, boost::edge_residual_capacity_t> >, boost::keep_all> > >]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/graph_concepts.hpp:87:5: required from ‘struct boost::concepts::IncidenceGraph > > > >, boost::is_residual_edge > > >, boost::edge_residual_capacity_t> >, boost::keep_all> >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/graph_concepts.hpp:75:1: required from ‘struct boost::concepts::IncidenceGraphConcept > > > >, boost::is_residual_edge > > >, boost::edge_residual_capacity_t> >, boost::keep_all> >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::concepts::IncidenceGraphConcept > > > >, boost::is_residual_edge > > >, boost::edge_residual_capacity_t> >, boost::keep_all> >]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied > > > >, boost::is_residual_edge > > >, boost::edge_residual_capacity_t> >, boost::keep_all> > >::value’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:45:51: [ skipping 5 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/edmonds_karp_max_flow.hpp:101:29: required from ‘typename boost::property_traits::value_type boost::edmonds_karp_max_flow(Graph&, typename graph_traits::vertex_descriptor, typename graph_traits::vertex_descriptor, CapacityEdgeMap, ResidualCapacityEdgeMap, ReverseEdgeMap, ColorMap, PredEdgeMap) [with Graph = adjacency_list > > > >; CapacityEdgeMap = adj_list_edge_property_map > > >, edge_capacity_t>; ResidualCapacityEdgeMap = adj_list_edge_property_map > > >, edge_residual_capacity_t>; ReverseEdgeMap = adj_list_edge_property_map, const detail::edge_desc_impl&, long unsigned int, const property > > >, edge_reverse_t>; ColorMap = iterator_property_map<__gnu_cxx::__normal_iterator >, vec_adj_list_vertex_id_map, default_color_type, default_color_type&>; PredEdgeMap = iterator_property_map<__gnu_cxx::__normal_iterator*, std::vector, std::allocator > > >, vec_adj_list_vertex_id_map, detail::edge_desc_impl, detail::edge_desc_impl&>; typename property_traits::value_type = double; typename graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/edmonds_karp_max_flow.hpp:154:41: required from ‘static typename boost::detail::edge_capacity_value::type boost::detail::edmonds_karp_dispatch2::apply(Graph&, typename boost::graph_traits::vertex_descriptor, typename boost::graph_traits::vertex_descriptor, PredMap, const boost::bgl_named_params&, boost::param_not_found) [with Graph = boost::adjacency_list > > > >; PredMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator*, std::vector, std::allocator > > >, boost::vec_adj_list_vertex_id_map, boost::detail::edge_desc_impl, boost::detail::edge_desc_impl&>; P = int; T = boost::buffer_param_t; R = boost::no_property; typename boost::detail::edge_capacity_value::type = double; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/edmonds_karp_max_flow.hpp:208:54: required from ‘static typename boost::detail::edge_capacity_value::type boost::detail::edmonds_karp_dispatch1::apply(Graph&, typename boost::graph_traits::vertex_descriptor, typename boost::graph_traits::vertex_descriptor, const boost::bgl_named_params&, boost::param_not_found) [with Graph = boost::adjacency_list > > > >; P = int; T = boost::buffer_param_t; R = boost::no_property; typename boost::detail::edge_capacity_value::type = double; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/edmonds_karp_max_flow.hpp:228:57: required from ‘typename boost::detail::edge_capacity_value::type boost::edmonds_karp_max_flow(Graph&, typename graph_traits::vertex_descriptor, typename graph_traits::vertex_descriptor, const bgl_named_params&) [with Graph = adjacency_list > > > >; P = int; T = buffer_param_t; R = no_property; typename detail::edge_capacity_value::type = double; typename graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/edmonds_karp_max_flow.hpp:240:33: required from ‘typename boost::property_traits::const_type>::value_type boost::edmonds_karp_max_flow(Graph&, typename graph_traits::vertex_descriptor, typename graph_traits::vertex_descriptor) [with Graph = adjacency_list > > > >; typename property_traits::const_type>::value_type = double; typename property_map::const_type = adj_list_edge_property_map > > >, edge_capacity_t>; typename graph_traits::vertex_descriptor = long unsigned int]’ mincut.cpp:76:45: required from here /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::concepts::IncidenceGraph::~IncidenceGraph() [with G = boost::filtered_graph > > > >, boost::is_residual_edge > > >, boost::edge_residual_capacity_t> >, boost::keep_all>]’ 37 | ~model() | ^ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/graph_concepts.hpp:87:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 87 | BOOST_CONCEPT_USAGE(IncidenceGraph) | ^~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements*, std::vector, std::allocator > > >, boost::vec_adj_list_vertex_id_map, boost::detail::edge_desc_impl, boost::detail::edge_desc_impl&>, boost::on_tree_edge> > > >]’: /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:167:5: required from ‘struct boost::CopyConstructible*, std::vector, std::allocator > > >, boost::vec_adj_list_vertex_id_map, boost::detail::edge_desc_impl, boost::detail::edge_desc_impl&>, boost::on_tree_edge> > >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:165:3: required from ‘struct boost::CopyConstructibleConcept*, std::vector, std::allocator > > >, boost::vec_adj_list_vertex_id_map, boost::detail::edge_desc_impl, boost::detail::edge_desc_impl&>, boost::on_tree_edge> > >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::CopyConstructibleConcept*, std::vector, std::allocator > > >, boost::vec_adj_list_vertex_id_map, boost::detail::edge_desc_impl, boost::detail::edge_desc_impl&>, boost::on_tree_edge> > >]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied*, std::vector, std::allocator > > >, boost::vec_adj_list_vertex_id_map, boost::detail::edge_desc_impl, boost::detail::edge_desc_impl&>, boost::on_tree_edge> > > >::value’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied*, std::vector, std::allocator > > >, boost::vec_adj_list_vertex_id_map, boost::detail::edge_desc_impl, boost::detail::edge_desc_impl&>, boost::on_tree_edge> > > >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:72:8: [ skipping 9 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/edmonds_karp_max_flow.hpp:101:29: required from ‘typename boost::property_traits::value_type boost::edmonds_karp_max_flow(Graph&, typename graph_traits::vertex_descriptor, typename graph_traits::vertex_descriptor, CapacityEdgeMap, ResidualCapacityEdgeMap, ReverseEdgeMap, ColorMap, PredEdgeMap) [with Graph = adjacency_list > > > >; CapacityEdgeMap = adj_list_edge_property_map > > >, edge_capacity_t>; ResidualCapacityEdgeMap = adj_list_edge_property_map > > >, edge_residual_capacity_t>; ReverseEdgeMap = adj_list_edge_property_map, const detail::edge_desc_impl&, long unsigned int, const property > > >, edge_reverse_t>; ColorMap = iterator_property_map<__gnu_cxx::__normal_iterator >, vec_adj_list_vertex_id_map, default_color_type, default_color_type&>; PredEdgeMap = iterator_property_map<__gnu_cxx::__normal_iterator*, std::vector, std::allocator > > >, vec_adj_list_vertex_id_map, detail::edge_desc_impl, detail::edge_desc_impl&>; typename property_traits::value_type = double; typename graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/edmonds_karp_max_flow.hpp:154:41: required from ‘static typename boost::detail::edge_capacity_value::type boost::detail::edmonds_karp_dispatch2::apply(Graph&, typename boost::graph_traits::vertex_descriptor, typename boost::graph_traits::vertex_descriptor, PredMap, const boost::bgl_named_params&, boost::param_not_found) [with Graph = boost::adjacency_list > > > >; PredMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator*, std::vector, std::allocator > > >, boost::vec_adj_list_vertex_id_map, boost::detail::edge_desc_impl, boost::detail::edge_desc_impl&>; P = int; T = boost::buffer_param_t; R = boost::no_property; typename boost::detail::edge_capacity_value::type = double; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/edmonds_karp_max_flow.hpp:208:54: required from ‘static typename boost::detail::edge_capacity_value::type boost::detail::edmonds_karp_dispatch1::apply(Graph&, typename boost::graph_traits::vertex_descriptor, typename boost::graph_traits::vertex_descriptor, const boost::bgl_named_params&, boost::param_not_found) [with Graph = boost::adjacency_list > > > >; P = int; T = boost::buffer_param_t; R = boost::no_property; typename boost::detail::edge_capacity_value::type = double; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/edmonds_karp_max_flow.hpp:228:57: required from ‘typename boost::detail::edge_capacity_value::type boost::edmonds_karp_max_flow(Graph&, typename graph_traits::vertex_descriptor, typename graph_traits::vertex_descriptor, const bgl_named_params&) [with Graph = adjacency_list > > > >; P = int; T = buffer_param_t; R = no_property; typename detail::edge_capacity_value::type = double; typename graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/edmonds_karp_max_flow.hpp:240:33: required from ‘typename boost::property_traits::const_type>::value_type boost::edmonds_karp_max_flow(Graph&, typename graph_traits::vertex_descriptor, typename graph_traits::vertex_descriptor) [with Graph = adjacency_list > > > >; typename property_traits::const_type>::value_type = double; typename property_map::const_type = adj_list_edge_property_map > > >, edge_capacity_t>; typename graph_traits::vertex_descriptor = long unsigned int]’ mincut.cpp:76:45: required from here /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::CopyConstructible*, std::vector, std::allocator > > >, boost::vec_adj_list_vertex_id_map, boost::detail::edge_desc_impl, boost::detail::edge_desc_impl&>, boost::on_tree_edge> > >]’ 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ^ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::CopyConstructibleConcept*, std::vector, std::allocator > > >, boost::vec_adj_list_vertex_id_map, boost::detail::edge_desc_impl, boost::detail::edge_desc_impl&>, boost::on_tree_edge> > >]’: /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/breadth_first_search.hpp:39:9: required from ‘void boost::BFSVisitorConcept::constraints() [with Visitor = boost::bfs_visitor*, std::vector, std::allocator > > >, boost::vec_adj_list_vertex_id_map, boost::detail::edge_desc_impl, boost::detail::edge_desc_impl&>, boost::on_tree_edge> >; Graph = boost::filtered_graph > > > >, boost::is_residual_edge > > >, boost::edge_residual_capacity_t> >, boost::keep_all>]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::BFSVisitorConcept*, std::vector, std::allocator > > >, boost::vec_adj_list_vertex_id_map, boost::detail::edge_desc_impl, boost::detail::edge_desc_impl&>, boost::on_tree_edge> >, boost::filtered_graph > > > >, boost::is_residual_edge > > >, boost::edge_residual_capacity_t> >, boost::keep_all> >]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied*, std::vector, std::allocator > > >, boost::vec_adj_list_vertex_id_map, boost::detail::edge_desc_impl, boost::detail::edge_desc_impl&>, boost::on_tree_edge> >, boost::filtered_graph > > > >, boost::is_residual_edge > > >, boost::edge_residual_capacity_t> >, boost::keep_all> > >::value’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied*, std::vector, std::allocator > > >, boost::vec_adj_list_vertex_id_map, boost::detail::edge_desc_impl, boost::detail::edge_desc_impl&>, boost::on_tree_edge> >, boost::filtered_graph > > > >, boost::is_residual_edge > > >, boost::edge_residual_capacity_t> >, boost::keep_all> > >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_*, std::vector, std::allocator > > >, boost::vec_adj_list_vertex_id_map, boost::detail::edge_desc_impl, boost::detail::edge_desc_impl&>, boost::on_tree_edge> >, boost::filtered_graph > > > >, boost::is_residual_edge > > >, boost::edge_residual_capacity_t> >, boost::keep_all> >)>’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/breadth_first_search.hpp:65:5: [ skipping 3 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/edmonds_karp_max_flow.hpp:101:29: required from ‘typename boost::property_traits::value_type boost::edmonds_karp_max_flow(Graph&, typename graph_traits::vertex_descriptor, typename graph_traits::vertex_descriptor, CapacityEdgeMap, ResidualCapacityEdgeMap, ReverseEdgeMap, ColorMap, PredEdgeMap) [with Graph = adjacency_list > > > >; CapacityEdgeMap = adj_list_edge_property_map > > >, edge_capacity_t>; ResidualCapacityEdgeMap = adj_list_edge_property_map > > >, edge_residual_capacity_t>; ReverseEdgeMap = adj_list_edge_property_map, const detail::edge_desc_impl&, long unsigned int, const property > > >, edge_reverse_t>; ColorMap = iterator_property_map<__gnu_cxx::__normal_iterator >, vec_adj_list_vertex_id_map, default_color_type, default_color_type&>; PredEdgeMap = iterator_property_map<__gnu_cxx::__normal_iterator*, std::vector, std::allocator > > >, vec_adj_list_vertex_id_map, detail::edge_desc_impl, detail::edge_desc_impl&>; typename property_traits::value_type = double; typename graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/edmonds_karp_max_flow.hpp:154:41: required from ‘static typename boost::detail::edge_capacity_value::type boost::detail::edmonds_karp_dispatch2::apply(Graph&, typename boost::graph_traits::vertex_descriptor, typename boost::graph_traits::vertex_descriptor, PredMap, const boost::bgl_named_params&, boost::param_not_found) [with Graph = boost::adjacency_list > > > >; PredMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator*, std::vector, std::allocator > > >, boost::vec_adj_list_vertex_id_map, boost::detail::edge_desc_impl, boost::detail::edge_desc_impl&>; P = int; T = boost::buffer_param_t; R = boost::no_property; typename boost::detail::edge_capacity_value::type = double; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/edmonds_karp_max_flow.hpp:208:54: required from ‘static typename boost::detail::edge_capacity_value::type boost::detail::edmonds_karp_dispatch1::apply(Graph&, typename boost::graph_traits::vertex_descriptor, typename boost::graph_traits::vertex_descriptor, const boost::bgl_named_params&, boost::param_not_found) [with Graph = boost::adjacency_list > > > >; P = int; T = boost::buffer_param_t; R = boost::no_property; typename boost::detail::edge_capacity_value::type = double; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/edmonds_karp_max_flow.hpp:228:57: required from ‘typename boost::detail::edge_capacity_value::type boost::edmonds_karp_max_flow(Graph&, typename graph_traits::vertex_descriptor, typename graph_traits::vertex_descriptor, const bgl_named_params&) [with Graph = adjacency_list > > > >; P = int; T = buffer_param_t; R = no_property; typename detail::edge_capacity_value::type = double; typename graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/edmonds_karp_max_flow.hpp:240:33: required from ‘typename boost::property_traits::const_type>::value_type boost::edmonds_karp_max_flow(Graph&, typename graph_traits::vertex_descriptor, typename graph_traits::vertex_descriptor) [with Graph = adjacency_list > > > >; typename property_traits::const_type>::value_type = double; typename property_map::const_type = adj_list_edge_property_map > > >, edge_capacity_t>; typename graph_traits::vertex_descriptor = long unsigned int]’ mincut.cpp:76:45: required from here /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:165:17: note: in a call to non-static member function ‘boost::CopyConstructibleConcept*, std::vector, std::allocator > > >, boost::vec_adj_list_vertex_id_map, boost::detail::edge_desc_impl, boost::detail::edge_desc_impl&>, boost::on_tree_edge> > >::~CopyConstructibleConcept()’ 165 | BOOST_concept(CopyConstructible,(TT)) | ^~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/preprocessor/cat.hpp:29:34: note: in definition of macro ‘BOOST_PP_CAT_I’ 29 | # define BOOST_PP_CAT_I(a, b) a ## b | ^ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/concept_def.hpp:23:12: note: in expansion of macro ‘BOOST_PP_CAT’ 23 | struct BOOST_PP_CAT(name,Concept) \ | ^~~~~~~~~~~~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:165:3: note: in expansion of macro ‘BOOST_concept’ 165 | BOOST_concept(CopyConstructible,(TT)) | ^~~~~~~~~~~~~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::constraint::failed() [with Model = boost::ReadablePropertyMapConcept >, boost::vec_adj_list_vertex_id_map, boost::default_color_type, boost::default_color_type&>, long unsigned int>]’: /home/omnipath/local/R/4.4-3.20/BH/include/boost/property_map/property_map.hpp:206:7: required from ‘void boost::ReadWritePropertyMapConcept::constraints() [with PMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map, boost::default_color_type, boost::default_color_type&>; Key = long unsigned int]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::ReadWritePropertyMapConcept >, boost::vec_adj_list_vertex_id_map, boost::default_color_type, boost::default_color_type&>, long unsigned int>]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied >, boost::vec_adj_list_vertex_id_map, boost::default_color_type, boost::default_color_type&>, long unsigned int> >::value’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied >, boost::vec_adj_list_vertex_id_map, boost::default_color_type, boost::default_color_type&>, long unsigned int> >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_ >, boost::vec_adj_list_vertex_id_map, boost::default_color_type, boost::default_color_type&>, long unsigned int>)>’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/breadth_first_search.hpp:66:5: [ skipping 3 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/edmonds_karp_max_flow.hpp:101:29: required from ‘typename boost::property_traits::value_type boost::edmonds_karp_max_flow(Graph&, typename graph_traits::vertex_descriptor, typename graph_traits::vertex_descriptor, CapacityEdgeMap, ResidualCapacityEdgeMap, ReverseEdgeMap, ColorMap, PredEdgeMap) [with Graph = adjacency_list > > > >; CapacityEdgeMap = adj_list_edge_property_map > > >, edge_capacity_t>; ResidualCapacityEdgeMap = adj_list_edge_property_map > > >, edge_residual_capacity_t>; ReverseEdgeMap = adj_list_edge_property_map, const detail::edge_desc_impl&, long unsigned int, const property > > >, edge_reverse_t>; ColorMap = iterator_property_map<__gnu_cxx::__normal_iterator >, vec_adj_list_vertex_id_map, default_color_type, default_color_type&>; PredEdgeMap = iterator_property_map<__gnu_cxx::__normal_iterator*, std::vector, std::allocator > > >, vec_adj_list_vertex_id_map, detail::edge_desc_impl, detail::edge_desc_impl&>; typename property_traits::value_type = double; typename graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/edmonds_karp_max_flow.hpp:154:41: required from ‘static typename boost::detail::edge_capacity_value::type boost::detail::edmonds_karp_dispatch2::apply(Graph&, typename boost::graph_traits::vertex_descriptor, typename boost::graph_traits::vertex_descriptor, PredMap, const boost::bgl_named_params&, boost::param_not_found) [with Graph = boost::adjacency_list > > > >; PredMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator*, std::vector, std::allocator > > >, boost::vec_adj_list_vertex_id_map, boost::detail::edge_desc_impl, boost::detail::edge_desc_impl&>; P = int; T = boost::buffer_param_t; R = boost::no_property; typename boost::detail::edge_capacity_value::type = double; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/edmonds_karp_max_flow.hpp:208:54: required from ‘static typename boost::detail::edge_capacity_value::type boost::detail::edmonds_karp_dispatch1::apply(Graph&, typename boost::graph_traits::vertex_descriptor, typename boost::graph_traits::vertex_descriptor, const boost::bgl_named_params&, boost::param_not_found) [with Graph = boost::adjacency_list > > > >; P = int; T = boost::buffer_param_t; R = boost::no_property; typename boost::detail::edge_capacity_value::type = double; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/edmonds_karp_max_flow.hpp:228:57: required from ‘typename boost::detail::edge_capacity_value::type boost::edmonds_karp_max_flow(Graph&, typename graph_traits::vertex_descriptor, typename graph_traits::vertex_descriptor, const bgl_named_params&) [with Graph = adjacency_list > > > >; P = int; T = buffer_param_t; R = no_property; typename detail::edge_capacity_value::type = double; typename graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/edmonds_karp_max_flow.hpp:240:33: required from ‘typename boost::property_traits::const_type>::value_type boost::edmonds_karp_max_flow(Graph&, typename graph_traits::vertex_descriptor, typename graph_traits::vertex_descriptor) [with Graph = adjacency_list > > > >; typename property_traits::const_type>::value_type = double; typename property_map::const_type = adj_list_edge_property_map > > >, edge_capacity_t>; typename graph_traits::vertex_descriptor = long unsigned int]’ mincut.cpp:76:45: required from here /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:65:52: warning: ‘this’ pointer is null [-Wnonnull] 65 | static void failed() { ((Model*)0)->constraints(); } | ~~~~~~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/property_map/property_map.hpp:147:10: note: in a call to non-static member function ‘void boost::ReadablePropertyMapConcept::constraints() [with PMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map, boost::default_color_type, boost::default_color_type&>; Key = long unsigned int]’ 147 | void constraints() { | ^~~~~~~~~~~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::constraint::failed() [with Model = boost::WritablePropertyMapConcept >, boost::vec_adj_list_vertex_id_map, boost::default_color_type, boost::default_color_type&>, long unsigned int>]’: /home/omnipath/local/R/4.4-3.20/BH/include/boost/property_map/property_map.hpp:207:7: required from ‘void boost::ReadWritePropertyMapConcept::constraints() [with PMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map, boost::default_color_type, boost::default_color_type&>; Key = long unsigned int]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::ReadWritePropertyMapConcept >, boost::vec_adj_list_vertex_id_map, boost::default_color_type, boost::default_color_type&>, long unsigned int>]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied >, boost::vec_adj_list_vertex_id_map, boost::default_color_type, boost::default_color_type&>, long unsigned int> >::value’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied >, boost::vec_adj_list_vertex_id_map, boost::default_color_type, boost::default_color_type&>, long unsigned int> >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_ >, boost::vec_adj_list_vertex_id_map, boost::default_color_type, boost::default_color_type&>, long unsigned int>)>’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/breadth_first_search.hpp:66:5: [ skipping 3 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/edmonds_karp_max_flow.hpp:101:29: required from ‘typename boost::property_traits::value_type boost::edmonds_karp_max_flow(Graph&, typename graph_traits::vertex_descriptor, typename graph_traits::vertex_descriptor, CapacityEdgeMap, ResidualCapacityEdgeMap, ReverseEdgeMap, ColorMap, PredEdgeMap) [with Graph = adjacency_list > > > >; CapacityEdgeMap = adj_list_edge_property_map > > >, edge_capacity_t>; ResidualCapacityEdgeMap = adj_list_edge_property_map > > >, edge_residual_capacity_t>; ReverseEdgeMap = adj_list_edge_property_map, const detail::edge_desc_impl&, long unsigned int, const property > > >, edge_reverse_t>; ColorMap = iterator_property_map<__gnu_cxx::__normal_iterator >, vec_adj_list_vertex_id_map, default_color_type, default_color_type&>; PredEdgeMap = iterator_property_map<__gnu_cxx::__normal_iterator*, std::vector, std::allocator > > >, vec_adj_list_vertex_id_map, detail::edge_desc_impl, detail::edge_desc_impl&>; typename property_traits::value_type = double; typename graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/edmonds_karp_max_flow.hpp:154:41: required from ‘static typename boost::detail::edge_capacity_value::type boost::detail::edmonds_karp_dispatch2::apply(Graph&, typename boost::graph_traits::vertex_descriptor, typename boost::graph_traits::vertex_descriptor, PredMap, const boost::bgl_named_params&, boost::param_not_found) [with Graph = boost::adjacency_list > > > >; PredMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator*, std::vector, std::allocator > > >, boost::vec_adj_list_vertex_id_map, boost::detail::edge_desc_impl, boost::detail::edge_desc_impl&>; P = int; T = boost::buffer_param_t; R = boost::no_property; typename boost::detail::edge_capacity_value::type = double; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/edmonds_karp_max_flow.hpp:208:54: required from ‘static typename boost::detail::edge_capacity_value::type boost::detail::edmonds_karp_dispatch1::apply(Graph&, typename boost::graph_traits::vertex_descriptor, typename boost::graph_traits::vertex_descriptor, const boost::bgl_named_params&, boost::param_not_found) [with Graph = boost::adjacency_list > > > >; P = int; T = boost::buffer_param_t; R = boost::no_property; typename boost::detail::edge_capacity_value::type = double; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/edmonds_karp_max_flow.hpp:228:57: required from ‘typename boost::detail::edge_capacity_value::type boost::edmonds_karp_max_flow(Graph&, typename graph_traits::vertex_descriptor, typename graph_traits::vertex_descriptor, const bgl_named_params&) [with Graph = adjacency_list > > > >; P = int; T = buffer_param_t; R = no_property; typename detail::edge_capacity_value::type = double; typename graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/edmonds_karp_max_flow.hpp:240:33: required from ‘typename boost::property_traits::const_type>::value_type boost::edmonds_karp_max_flow(Graph&, typename graph_traits::vertex_descriptor, typename graph_traits::vertex_descriptor) [with Graph = adjacency_list > > > >; typename property_traits::const_type>::value_type = double; typename property_map::const_type = adj_list_edge_property_map > > >, edge_capacity_t>; typename graph_traits::vertex_descriptor = long unsigned int]’ mincut.cpp:76:45: required from here /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:65:52: warning: ‘this’ pointer is null [-Wnonnull] 65 | static void failed() { ((Model*)0)->constraints(); } | ~~~~~~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/property_map/property_map.hpp:179:10: note: in a call to non-static member function ‘void boost::WritablePropertyMapConcept::constraints() [with PMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map, boost::default_color_type, boost::default_color_type&>; Key = long unsigned int]’ 179 | void constraints() { | ^~~~~~~~~~~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::DefaultConstructible]’: /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements >]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:137:5: required from ‘struct boost::DefaultConstructible’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::DefaultConstructible]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied >::value’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:72:8: [ skipping 11 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/breadth_first_search.hpp:62:5: required from ‘void boost::breadth_first_visit(const IncidenceGraph&, SourceIterator, SourceIterator, Buffer&, BFSVisitor, ColorMap) [with IncidenceGraph = filtered_graph > > >, no_property, listS>, is_residual_edge > > >, edge_residual_capacity_t> >, keep_all>; Buffer = queue > >; BFSVisitor = bfs_visitor*, on_tree_edge> >; ColorMap = default_color_type*; SourceIterator = long unsigned int*]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/breadth_first_search.hpp:136:24: required from ‘void boost::breadth_first_search(const VertexListGraph&, SourceIterator, SourceIterator, Buffer&, BFSVisitor, ColorMap) [with VertexListGraph = filtered_graph > > >, no_property, listS>, is_residual_edge > > >, edge_residual_capacity_t> >, keep_all>; SourceIterator = long unsigned int*; Buffer = queue > >; BFSVisitor = bfs_visitor*, on_tree_edge> >; ColorMap = default_color_type*]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/breadth_first_search.hpp:147:25: required from ‘void boost::breadth_first_search(const VertexListGraph&, typename graph_traits::vertex_descriptor, Buffer&, BFSVisitor, ColorMap) [with VertexListGraph = filtered_graph > > >, no_property, listS>, is_residual_edge > > >, edge_residual_capacity_t> >, keep_all>; Buffer = queue > >; BFSVisitor = bfs_visitor*, on_tree_edge> >; ColorMap = default_color_type*; typename graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/edmonds_karp_max_flow.hpp:101:29: required from ‘typename boost::property_traits::value_type boost::edmonds_karp_max_flow(Graph&, typename graph_traits::vertex_descriptor, typename graph_traits::vertex_descriptor, CapacityEdgeMap, ResidualCapacityEdgeMap, ReverseEdgeMap, ColorMap, PredEdgeMap) [with Graph = adjacency_list > > >, no_property, listS>; CapacityEdgeMap = adj_list_edge_property_map > > >, edge_capacity_t>; ResidualCapacityEdgeMap = adj_list_edge_property_map > > >, edge_residual_capacity_t>; ReverseEdgeMap = adj_list_edge_property_map, detail::edge_desc_impl&, long unsigned int, property > > >, edge_reverse_t>; ColorMap = default_color_type*; PredEdgeMap = detail::edge_desc_impl*; typename property_traits::value_type = long unsigned int; typename graph_traits::vertex_descriptor = long unsigned int]’ mincut.hpp:78:21: required from ‘typename boost::graph_traits::edges_size_type boost::min_cut(VertexListGraph&, OutputIterator, OutputIterator) [with VertexListGraph = R_adjacency_list; OutputIterator = std::back_insert_iterator >; typename graph_traits::edges_size_type = long unsigned int]’ mincut.cpp:128:35: required from here /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::DefaultConstructible::~DefaultConstructible() [with TT = long unsigned int]’ 37 | ~model() | ^ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:137:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 137 | BOOST_CONCEPT_USAGE(DefaultConstructible) { | ^~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::EqualityComparable]’: /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements >]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:233:5: required from ‘struct boost::EqualityComparable’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::EqualityComparable]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied >::value’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:72:8: [ skipping 11 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/breadth_first_search.hpp:62:5: required from ‘void boost::breadth_first_visit(const IncidenceGraph&, SourceIterator, SourceIterator, Buffer&, BFSVisitor, ColorMap) [with IncidenceGraph = filtered_graph > > >, no_property, listS>, is_residual_edge > > >, edge_residual_capacity_t> >, keep_all>; Buffer = queue > >; BFSVisitor = bfs_visitor*, on_tree_edge> >; ColorMap = default_color_type*; SourceIterator = long unsigned int*]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/breadth_first_search.hpp:136:24: required from ‘void boost::breadth_first_search(const VertexListGraph&, SourceIterator, SourceIterator, Buffer&, BFSVisitor, ColorMap) [with VertexListGraph = filtered_graph > > >, no_property, listS>, is_residual_edge > > >, edge_residual_capacity_t> >, keep_all>; SourceIterator = long unsigned int*; Buffer = queue > >; BFSVisitor = bfs_visitor*, on_tree_edge> >; ColorMap = default_color_type*]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/breadth_first_search.hpp:147:25: required from ‘void boost::breadth_first_search(const VertexListGraph&, typename graph_traits::vertex_descriptor, Buffer&, BFSVisitor, ColorMap) [with VertexListGraph = filtered_graph > > >, no_property, listS>, is_residual_edge > > >, edge_residual_capacity_t> >, keep_all>; Buffer = queue > >; BFSVisitor = bfs_visitor*, on_tree_edge> >; ColorMap = default_color_type*; typename graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/edmonds_karp_max_flow.hpp:101:29: required from ‘typename boost::property_traits::value_type boost::edmonds_karp_max_flow(Graph&, typename graph_traits::vertex_descriptor, typename graph_traits::vertex_descriptor, CapacityEdgeMap, ResidualCapacityEdgeMap, ReverseEdgeMap, ColorMap, PredEdgeMap) [with Graph = adjacency_list > > >, no_property, listS>; CapacityEdgeMap = adj_list_edge_property_map > > >, edge_capacity_t>; ResidualCapacityEdgeMap = adj_list_edge_property_map > > >, edge_residual_capacity_t>; ReverseEdgeMap = adj_list_edge_property_map, detail::edge_desc_impl&, long unsigned int, property > > >, edge_reverse_t>; ColorMap = default_color_type*; PredEdgeMap = detail::edge_desc_impl*; typename property_traits::value_type = long unsigned int; typename graph_traits::vertex_descriptor = long unsigned int]’ mincut.hpp:78:21: required from ‘typename boost::graph_traits::edges_size_type boost::min_cut(VertexListGraph&, OutputIterator, OutputIterator) [with VertexListGraph = R_adjacency_list; OutputIterator = std::back_insert_iterator >; typename graph_traits::edges_size_type = long unsigned int]’ mincut.cpp:128:35: required from here /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::EqualityComparable::~EqualityComparable() [with TT = long unsigned int]’ 37 | ~model() | ^ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:233:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 233 | BOOST_CONCEPT_USAGE(EqualityComparable) { | ^~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::Assignable]’: /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements >]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:145:5: required from ‘struct boost::Assignable’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::Assignable]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied >::value’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:72:8: [ skipping 11 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/breadth_first_search.hpp:62:5: required from ‘void boost::breadth_first_visit(const IncidenceGraph&, SourceIterator, SourceIterator, Buffer&, BFSVisitor, ColorMap) [with IncidenceGraph = filtered_graph > > >, no_property, listS>, is_residual_edge > > >, edge_residual_capacity_t> >, keep_all>; Buffer = queue > >; BFSVisitor = bfs_visitor*, on_tree_edge> >; ColorMap = default_color_type*; SourceIterator = long unsigned int*]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/breadth_first_search.hpp:136:24: required from ‘void boost::breadth_first_search(const VertexListGraph&, SourceIterator, SourceIterator, Buffer&, BFSVisitor, ColorMap) [with VertexListGraph = filtered_graph > > >, no_property, listS>, is_residual_edge > > >, edge_residual_capacity_t> >, keep_all>; SourceIterator = long unsigned int*; Buffer = queue > >; BFSVisitor = bfs_visitor*, on_tree_edge> >; ColorMap = default_color_type*]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/breadth_first_search.hpp:147:25: required from ‘void boost::breadth_first_search(const VertexListGraph&, typename graph_traits::vertex_descriptor, Buffer&, BFSVisitor, ColorMap) [with VertexListGraph = filtered_graph > > >, no_property, listS>, is_residual_edge > > >, edge_residual_capacity_t> >, keep_all>; Buffer = queue > >; BFSVisitor = bfs_visitor*, on_tree_edge> >; ColorMap = default_color_type*; typename graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/edmonds_karp_max_flow.hpp:101:29: required from ‘typename boost::property_traits::value_type boost::edmonds_karp_max_flow(Graph&, typename graph_traits::vertex_descriptor, typename graph_traits::vertex_descriptor, CapacityEdgeMap, ResidualCapacityEdgeMap, ReverseEdgeMap, ColorMap, PredEdgeMap) [with Graph = adjacency_list > > >, no_property, listS>; CapacityEdgeMap = adj_list_edge_property_map > > >, edge_capacity_t>; ResidualCapacityEdgeMap = adj_list_edge_property_map > > >, edge_residual_capacity_t>; ReverseEdgeMap = adj_list_edge_property_map, detail::edge_desc_impl&, long unsigned int, property > > >, edge_reverse_t>; ColorMap = default_color_type*; PredEdgeMap = detail::edge_desc_impl*; typename property_traits::value_type = long unsigned int; typename graph_traits::vertex_descriptor = long unsigned int]’ mincut.hpp:78:21: required from ‘typename boost::graph_traits::edges_size_type boost::min_cut(VertexListGraph&, OutputIterator, OutputIterator) [with VertexListGraph = R_adjacency_list; OutputIterator = std::back_insert_iterator >; typename graph_traits::edges_size_type = long unsigned int]’ mincut.cpp:128:35: required from here /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::Assignable::~Assignable() [with TT = long unsigned int]’ 37 | ~model() | ^ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:145:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 145 | BOOST_CONCEPT_USAGE(Assignable) { | ^~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements > > >, boost::edge_residual_capacity_t> >, boost::keep_all, boost::filtered_graph > > >, boost::no_property, boost::listS>, boost::is_residual_edge > > >, boost::edge_residual_capacity_t> >, boost::keep_all> >, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > > > >*, std::vector > > > >, std::allocator > > > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > > >]’: /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:145:5: required from ‘struct boost::Assignable > > >, boost::edge_residual_capacity_t> >, boost::keep_all, boost::filtered_graph > > >, boost::no_property, boost::listS>, boost::is_residual_edge > > >, boost::edge_residual_capacity_t> >, boost::keep_all> >, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > > > >*, std::vector > > > >, std::allocator > > > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:502:3: required from ‘struct boost::InputIterator > > >, boost::edge_residual_capacity_t> >, boost::keep_all, boost::filtered_graph > > >, boost::no_property, boost::listS>, boost::is_residual_edge > > >, boost::edge_residual_capacity_t> >, boost::keep_all> >, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > > > >*, std::vector > > > >, std::allocator > > > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::InputIterator > > >, boost::edge_residual_capacity_t> >, boost::keep_all, boost::filtered_graph > > >, boost::no_property, boost::listS>, boost::is_residual_edge > > >, boost::edge_residual_capacity_t> >, boost::keep_all> >, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > > > >*, std::vector > > > >, std::allocator > > > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied > > >, boost::edge_residual_capacity_t> >, boost::keep_all, boost::filtered_graph > > >, boost::no_property, boost::listS>, boost::is_residual_edge > > >, boost::edge_residual_capacity_t> >, boost::keep_all> >, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > > > >*, std::vector > > > >, std::allocator > > > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > > >::value’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied > > >, boost::edge_residual_capacity_t> >, boost::keep_all, boost::filtered_graph > > >, boost::no_property, boost::listS>, boost::is_residual_edge > > >, boost::edge_residual_capacity_t> >, boost::keep_all> >, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > > > >*, std::vector > > > >, std::allocator > > > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > > >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:72:8: [ skipping 5 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/breadth_first_search.hpp:62:5: required from ‘void boost::breadth_first_visit(const IncidenceGraph&, SourceIterator, SourceIterator, Buffer&, BFSVisitor, ColorMap) [with IncidenceGraph = filtered_graph > > >, no_property, listS>, is_residual_edge > > >, edge_residual_capacity_t> >, keep_all>; Buffer = queue > >; BFSVisitor = bfs_visitor*, on_tree_edge> >; ColorMap = default_color_type*; SourceIterator = long unsigned int*]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/breadth_first_search.hpp:136:24: required from ‘void boost::breadth_first_search(const VertexListGraph&, SourceIterator, SourceIterator, Buffer&, BFSVisitor, ColorMap) [with VertexListGraph = filtered_graph > > >, no_property, listS>, is_residual_edge > > >, edge_residual_capacity_t> >, keep_all>; SourceIterator = long unsigned int*; Buffer = queue > >; BFSVisitor = bfs_visitor*, on_tree_edge> >; ColorMap = default_color_type*]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/breadth_first_search.hpp:147:25: required from ‘void boost::breadth_first_search(const VertexListGraph&, typename graph_traits::vertex_descriptor, Buffer&, BFSVisitor, ColorMap) [with VertexListGraph = filtered_graph > > >, no_property, listS>, is_residual_edge > > >, edge_residual_capacity_t> >, keep_all>; Buffer = queue > >; BFSVisitor = bfs_visitor*, on_tree_edge> >; ColorMap = default_color_type*; typename graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/edmonds_karp_max_flow.hpp:101:29: required from ‘typename boost::property_traits::value_type boost::edmonds_karp_max_flow(Graph&, typename graph_traits::vertex_descriptor, typename graph_traits::vertex_descriptor, CapacityEdgeMap, ResidualCapacityEdgeMap, ReverseEdgeMap, ColorMap, PredEdgeMap) [with Graph = adjacency_list > > >, no_property, listS>; CapacityEdgeMap = adj_list_edge_property_map > > >, edge_capacity_t>; ResidualCapacityEdgeMap = adj_list_edge_property_map > > >, edge_residual_capacity_t>; ReverseEdgeMap = adj_list_edge_property_map, detail::edge_desc_impl&, long unsigned int, property > > >, edge_reverse_t>; ColorMap = default_color_type*; PredEdgeMap = detail::edge_desc_impl*; typename property_traits::value_type = long unsigned int; typename graph_traits::vertex_descriptor = long unsigned int]’ mincut.hpp:78:21: required from ‘typename boost::graph_traits::edges_size_type boost::min_cut(VertexListGraph&, OutputIterator, OutputIterator) [with VertexListGraph = R_adjacency_list; OutputIterator = std::back_insert_iterator >; typename graph_traits::edges_size_type = long unsigned int]’ mincut.cpp:128:35: required from here /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::Assignable > > >, boost::edge_residual_capacity_t> >, boost::keep_all, boost::filtered_graph > > >, boost::no_property, boost::listS>, boost::is_residual_edge > > >, boost::edge_residual_capacity_t> >, boost::keep_all> >, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > > > >*, std::vector > > > >, std::allocator > > > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >]’ 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ^ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements > > >, boost::edge_residual_capacity_t> >, boost::keep_all, boost::filtered_graph > > >, boost::no_property, boost::listS>, boost::is_residual_edge > > >, boost::edge_residual_capacity_t> >, boost::keep_all> >, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > > > >*, std::vector > > > >, std::allocator > > > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > > >]’: /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:233:5: required from ‘struct boost::EqualityComparable > > >, boost::edge_residual_capacity_t> >, boost::keep_all, boost::filtered_graph > > >, boost::no_property, boost::listS>, boost::is_residual_edge > > >, boost::edge_residual_capacity_t> >, boost::keep_all> >, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > > > >*, std::vector > > > >, std::allocator > > > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:502:3: required from ‘struct boost::InputIterator > > >, boost::edge_residual_capacity_t> >, boost::keep_all, boost::filtered_graph > > >, boost::no_property, boost::listS>, boost::is_residual_edge > > >, boost::edge_residual_capacity_t> >, boost::keep_all> >, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > > > >*, std::vector > > > >, std::allocator > > > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::InputIterator > > >, boost::edge_residual_capacity_t> >, boost::keep_all, boost::filtered_graph > > >, boost::no_property, boost::listS>, boost::is_residual_edge > > >, boost::edge_residual_capacity_t> >, boost::keep_all> >, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > > > >*, std::vector > > > >, std::allocator > > > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied > > >, boost::edge_residual_capacity_t> >, boost::keep_all, boost::filtered_graph > > >, boost::no_property, boost::listS>, boost::is_residual_edge > > >, boost::edge_residual_capacity_t> >, boost::keep_all> >, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > > > >*, std::vector > > > >, std::allocator > > > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > > >::value’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied > > >, boost::edge_residual_capacity_t> >, boost::keep_all, boost::filtered_graph > > >, boost::no_property, boost::listS>, boost::is_residual_edge > > >, boost::edge_residual_capacity_t> >, boost::keep_all> >, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > > > >*, std::vector > > > >, std::allocator > > > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > > >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:72:8: [ skipping 5 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/breadth_first_search.hpp:62:5: required from ‘void boost::breadth_first_visit(const IncidenceGraph&, SourceIterator, SourceIterator, Buffer&, BFSVisitor, ColorMap) [with IncidenceGraph = filtered_graph > > >, no_property, listS>, is_residual_edge > > >, edge_residual_capacity_t> >, keep_all>; Buffer = queue > >; BFSVisitor = bfs_visitor*, on_tree_edge> >; ColorMap = default_color_type*; SourceIterator = long unsigned int*]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/breadth_first_search.hpp:136:24: required from ‘void boost::breadth_first_search(const VertexListGraph&, SourceIterator, SourceIterator, Buffer&, BFSVisitor, ColorMap) [with VertexListGraph = filtered_graph > > >, no_property, listS>, is_residual_edge > > >, edge_residual_capacity_t> >, keep_all>; SourceIterator = long unsigned int*; Buffer = queue > >; BFSVisitor = bfs_visitor*, on_tree_edge> >; ColorMap = default_color_type*]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/breadth_first_search.hpp:147:25: required from ‘void boost::breadth_first_search(const VertexListGraph&, typename graph_traits::vertex_descriptor, Buffer&, BFSVisitor, ColorMap) [with VertexListGraph = filtered_graph > > >, no_property, listS>, is_residual_edge > > >, edge_residual_capacity_t> >, keep_all>; Buffer = queue > >; BFSVisitor = bfs_visitor*, on_tree_edge> >; ColorMap = default_color_type*; typename graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/edmonds_karp_max_flow.hpp:101:29: required from ‘typename boost::property_traits::value_type boost::edmonds_karp_max_flow(Graph&, typename graph_traits::vertex_descriptor, typename graph_traits::vertex_descriptor, CapacityEdgeMap, ResidualCapacityEdgeMap, ReverseEdgeMap, ColorMap, PredEdgeMap) [with Graph = adjacency_list > > >, no_property, listS>; CapacityEdgeMap = adj_list_edge_property_map > > >, edge_capacity_t>; ResidualCapacityEdgeMap = adj_list_edge_property_map > > >, edge_residual_capacity_t>; ReverseEdgeMap = adj_list_edge_property_map, detail::edge_desc_impl&, long unsigned int, property > > >, edge_reverse_t>; ColorMap = default_color_type*; PredEdgeMap = detail::edge_desc_impl*; typename property_traits::value_type = long unsigned int; typename graph_traits::vertex_descriptor = long unsigned int]’ mincut.hpp:78:21: required from ‘typename boost::graph_traits::edges_size_type boost::min_cut(VertexListGraph&, OutputIterator, OutputIterator) [with VertexListGraph = R_adjacency_list; OutputIterator = std::back_insert_iterator >; typename graph_traits::edges_size_type = long unsigned int]’ mincut.cpp:128:35: required from here /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::EqualityComparable > > >, boost::edge_residual_capacity_t> >, boost::keep_all, boost::filtered_graph > > >, boost::no_property, boost::listS>, boost::is_residual_edge > > >, boost::edge_residual_capacity_t> >, boost::keep_all> >, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > > > >*, std::vector > > > >, std::allocator > > > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >]’ 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ^ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements > > >, boost::edge_residual_capacity_t> >, boost::keep_all, boost::filtered_graph > > >, boost::no_property, boost::listS>, boost::is_residual_edge > > >, boost::edge_residual_capacity_t> >, boost::keep_all> >, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > > > >*, std::vector > > > >, std::allocator > > > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > > >]’: /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:512:7: required from ‘struct boost::InputIterator > > >, boost::edge_residual_capacity_t> >, boost::keep_all, boost::filtered_graph > > >, boost::no_property, boost::listS>, boost::is_residual_edge > > >, boost::edge_residual_capacity_t> >, boost::keep_all> >, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > > > >*, std::vector > > > >, std::allocator > > > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::InputIterator > > >, boost::edge_residual_capacity_t> >, boost::keep_all, boost::filtered_graph > > >, boost::no_property, boost::listS>, boost::is_residual_edge > > >, boost::edge_residual_capacity_t> >, boost::keep_all> >, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > > > >*, std::vector > > > >, std::allocator > > > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied > > >, boost::edge_residual_capacity_t> >, boost::keep_all, boost::filtered_graph > > >, boost::no_property, boost::listS>, boost::is_residual_edge > > >, boost::edge_residual_capacity_t> >, boost::keep_all> >, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > > > >*, std::vector > > > >, std::allocator > > > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > > >::value’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied > > >, boost::edge_residual_capacity_t> >, boost::keep_all, boost::filtered_graph > > >, boost::no_property, boost::listS>, boost::is_residual_edge > > >, boost::edge_residual_capacity_t> >, boost::keep_all> >, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > > > >*, std::vector > > > >, std::allocator > > > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > > >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_ > > >, boost::edge_residual_capacity_t> >, boost::keep_all, boost::filtered_graph > > >, boost::no_property, boost::listS>, boost::is_residual_edge > > >, boost::edge_residual_capacity_t> >, boost::keep_all> >, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > > > >*, std::vector > > > >, std::allocator > > > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >)>’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/graph_concepts.hpp:53:35: [ skipping 4 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/breadth_first_search.hpp:62:5: required from ‘void boost::breadth_first_visit(const IncidenceGraph&, SourceIterator, SourceIterator, Buffer&, BFSVisitor, ColorMap) [with IncidenceGraph = filtered_graph > > >, no_property, listS>, is_residual_edge > > >, edge_residual_capacity_t> >, keep_all>; Buffer = queue > >; BFSVisitor = bfs_visitor*, on_tree_edge> >; ColorMap = default_color_type*; SourceIterator = long unsigned int*]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/breadth_first_search.hpp:136:24: required from ‘void boost::breadth_first_search(const VertexListGraph&, SourceIterator, SourceIterator, Buffer&, BFSVisitor, ColorMap) [with VertexListGraph = filtered_graph > > >, no_property, listS>, is_residual_edge > > >, edge_residual_capacity_t> >, keep_all>; SourceIterator = long unsigned int*; Buffer = queue > >; BFSVisitor = bfs_visitor*, on_tree_edge> >; ColorMap = default_color_type*]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/breadth_first_search.hpp:147:25: required from ‘void boost::breadth_first_search(const VertexListGraph&, typename graph_traits::vertex_descriptor, Buffer&, BFSVisitor, ColorMap) [with VertexListGraph = filtered_graph > > >, no_property, listS>, is_residual_edge > > >, edge_residual_capacity_t> >, keep_all>; Buffer = queue > >; BFSVisitor = bfs_visitor*, on_tree_edge> >; ColorMap = default_color_type*; typename graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/edmonds_karp_max_flow.hpp:101:29: required from ‘typename boost::property_traits::value_type boost::edmonds_karp_max_flow(Graph&, typename graph_traits::vertex_descriptor, typename graph_traits::vertex_descriptor, CapacityEdgeMap, ResidualCapacityEdgeMap, ReverseEdgeMap, ColorMap, PredEdgeMap) [with Graph = adjacency_list > > >, no_property, listS>; CapacityEdgeMap = adj_list_edge_property_map > > >, edge_capacity_t>; ResidualCapacityEdgeMap = adj_list_edge_property_map > > >, edge_residual_capacity_t>; ReverseEdgeMap = adj_list_edge_property_map, detail::edge_desc_impl&, long unsigned int, property > > >, edge_reverse_t>; ColorMap = default_color_type*; PredEdgeMap = detail::edge_desc_impl*; typename property_traits::value_type = long unsigned int; typename graph_traits::vertex_descriptor = long unsigned int]’ mincut.hpp:78:21: required from ‘typename boost::graph_traits::edges_size_type boost::min_cut(VertexListGraph&, OutputIterator, OutputIterator) [with VertexListGraph = R_adjacency_list; OutputIterator = std::back_insert_iterator >; typename graph_traits::edges_size_type = long unsigned int]’ mincut.cpp:128:35: required from here /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::InputIterator > > >, boost::edge_residual_capacity_t> >, boost::keep_all, boost::filtered_graph > > >, boost::no_property, boost::listS>, boost::is_residual_edge > > >, boost::edge_residual_capacity_t> >, boost::keep_all> >, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > > > >*, std::vector > > > >, std::allocator > > > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >]’ 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ^ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::InputIterator > > >, boost::edge_residual_capacity_t> >, boost::keep_all, boost::filtered_graph > > >, boost::no_property, boost::listS>, boost::is_residual_edge > > >, boost::edge_residual_capacity_t> >, boost::keep_all> >, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > > > >*, std::vector > > > >, std::allocator > > > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >]’: /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/graph_concepts.hpp:53:35: required from ‘boost::concepts::MultiPassInputIterator::~MultiPassInputIterator() [with T = boost::iterators::filter_iterator > > >, boost::edge_residual_capacity_t> >, boost::keep_all, boost::filtered_graph > > >, boost::no_property, boost::listS>, boost::is_residual_edge > > >, boost::edge_residual_capacity_t> >, boost::keep_all> >, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > > > >*, std::vector > > > >, std::allocator > > > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> >]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::MultiPassInputIterator > > >, boost::edge_residual_capacity_t> >, boost::keep_all, boost::filtered_graph > > >, boost::no_property, boost::listS>, boost::is_residual_edge > > >, boost::edge_residual_capacity_t> >, boost::keep_all> >, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > > > >*, std::vector > > > >, std::allocator > > > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/graph_concepts.hpp:89:9: required from ‘boost::concepts::IncidenceGraph::~IncidenceGraph() [with G = boost::filtered_graph > > >, boost::no_property, boost::listS>, boost::is_residual_edge > > >, boost::edge_residual_capacity_t> >, boost::keep_all>]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/graph_concepts.hpp:75:1: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::IncidenceGraphConcept > > >, boost::no_property, boost::listS>, boost::is_residual_edge > > >, boost::edge_residual_capacity_t> >, boost::keep_all> >]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/breadth_first_search.hpp:62:5: required from ‘void boost::breadth_first_visit(const IncidenceGraph&, SourceIterator, SourceIterator, Buffer&, BFSVisitor, ColorMap) [with IncidenceGraph = filtered_graph > > >, no_property, listS>, is_residual_edge > > >, edge_residual_capacity_t> >, keep_all>; Buffer = queue > >; BFSVisitor = bfs_visitor*, on_tree_edge> >; ColorMap = default_color_type*; SourceIterator = long unsigned int*]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/breadth_first_search.hpp:136:24: required from ‘void boost::breadth_first_search(const VertexListGraph&, SourceIterator, SourceIterator, Buffer&, BFSVisitor, ColorMap) [with VertexListGraph = filtered_graph > > >, no_property, listS>, is_residual_edge > > >, edge_residual_capacity_t> >, keep_all>; SourceIterator = long unsigned int*; Buffer = queue > >; BFSVisitor = bfs_visitor*, on_tree_edge> >; ColorMap = default_color_type*]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/breadth_first_search.hpp:147:25: required from ‘void boost::breadth_first_search(const VertexListGraph&, typename graph_traits::vertex_descriptor, Buffer&, BFSVisitor, ColorMap) [with VertexListGraph = filtered_graph > > >, no_property, listS>, is_residual_edge > > >, edge_residual_capacity_t> >, keep_all>; Buffer = queue > >; BFSVisitor = bfs_visitor*, on_tree_edge> >; ColorMap = default_color_type*; typename graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/edmonds_karp_max_flow.hpp:101:29: required from ‘typename boost::property_traits::value_type boost::edmonds_karp_max_flow(Graph&, typename graph_traits::vertex_descriptor, typename graph_traits::vertex_descriptor, CapacityEdgeMap, ResidualCapacityEdgeMap, ReverseEdgeMap, ColorMap, PredEdgeMap) [with Graph = adjacency_list > > >, no_property, listS>; CapacityEdgeMap = adj_list_edge_property_map > > >, edge_capacity_t>; ResidualCapacityEdgeMap = adj_list_edge_property_map > > >, edge_residual_capacity_t>; ReverseEdgeMap = adj_list_edge_property_map, detail::edge_desc_impl&, long unsigned int, property > > >, edge_reverse_t>; ColorMap = default_color_type*; PredEdgeMap = detail::edge_desc_impl*; typename property_traits::value_type = long unsigned int; typename graph_traits::vertex_descriptor = long unsigned int]’ mincut.hpp:78:21: required from ‘typename boost::graph_traits::edges_size_type boost::min_cut(VertexListGraph&, OutputIterator, OutputIterator) [with VertexListGraph = R_adjacency_list; OutputIterator = std::back_insert_iterator >; typename graph_traits::edges_size_type = long unsigned int]’ mincut.cpp:128:35: required from here /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::InputIterator::~InputIterator() [with TT = boost::iterators::filter_iterator > > >, boost::edge_residual_capacity_t> >, boost::keep_all, boost::filtered_graph > > >, boost::no_property, boost::listS>, boost::is_residual_edge > > >, boost::edge_residual_capacity_t> >, boost::keep_all> >, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > > > >*, std::vector > > > >, std::allocator > > > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> >]’ 37 | ~model() | ^ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:512:7: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 512 | BOOST_CONCEPT_USAGE(InputIterator) | ^~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements > > >, boost::edge_residual_capacity_t> >, boost::keep_all, boost::filtered_graph > > > >, boost::is_residual_edge > > >, boost::edge_residual_capacity_t> >, boost::keep_all> >, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > > > >*, std::vector > > > >, std::allocator > > > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > > >]’: /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/graph_concepts.hpp:52:50: required from ‘struct boost::concepts::MultiPassInputIterator > > >, boost::edge_residual_capacity_t> >, boost::keep_all, boost::filtered_graph > > > >, boost::is_residual_edge > > >, boost::edge_residual_capacity_t> >, boost::keep_all> >, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > > > >*, std::vector > > > >, std::allocator > > > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::concepts::MultiPassInputIterator > > >, boost::edge_residual_capacity_t> >, boost::keep_all, boost::filtered_graph > > > >, boost::is_residual_edge > > >, boost::edge_residual_capacity_t> >, boost::keep_all> >, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > > > >*, std::vector > > > >, std::allocator > > > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied > > >, boost::edge_residual_capacity_t> >, boost::keep_all, boost::filtered_graph > > > >, boost::is_residual_edge > > >, boost::edge_residual_capacity_t> >, boost::keep_all> >, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > > > >*, std::vector > > > >, std::allocator > > > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > > >::value’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied > > >, boost::edge_residual_capacity_t> >, boost::keep_all, boost::filtered_graph > > > >, boost::is_residual_edge > > >, boost::edge_residual_capacity_t> >, boost::keep_all> >, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > > > >*, std::vector > > > >, std::allocator > > > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > > >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_ > > >, boost::edge_residual_capacity_t> >, boost::keep_all, boost::filtered_graph > > > >, boost::is_residual_edge > > >, boost::edge_residual_capacity_t> >, boost::keep_all> >, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > > > >*, std::vector > > > >, std::allocator > > > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >)>’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/graph_concepts.hpp:89:9: [ skipping 5 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/edmonds_karp_max_flow.hpp:101:29: required from ‘typename boost::property_traits::value_type boost::edmonds_karp_max_flow(Graph&, typename graph_traits::vertex_descriptor, typename graph_traits::vertex_descriptor, CapacityEdgeMap, ResidualCapacityEdgeMap, ReverseEdgeMap, ColorMap, PredEdgeMap) [with Graph = adjacency_list > > > >; CapacityEdgeMap = adj_list_edge_property_map > > >, edge_capacity_t>; ResidualCapacityEdgeMap = adj_list_edge_property_map > > >, edge_residual_capacity_t>; ReverseEdgeMap = adj_list_edge_property_map, const detail::edge_desc_impl&, long unsigned int, const property > > >, edge_reverse_t>; ColorMap = iterator_property_map<__gnu_cxx::__normal_iterator >, vec_adj_list_vertex_id_map, default_color_type, default_color_type&>; PredEdgeMap = iterator_property_map<__gnu_cxx::__normal_iterator*, std::vector, std::allocator > > >, vec_adj_list_vertex_id_map, detail::edge_desc_impl, detail::edge_desc_impl&>; typename property_traits::value_type = double; typename graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/edmonds_karp_max_flow.hpp:154:41: required from ‘static typename boost::detail::edge_capacity_value::type boost::detail::edmonds_karp_dispatch2::apply(Graph&, typename boost::graph_traits::vertex_descriptor, typename boost::graph_traits::vertex_descriptor, PredMap, const boost::bgl_named_params&, boost::param_not_found) [with Graph = boost::adjacency_list > > > >; PredMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator*, std::vector, std::allocator > > >, boost::vec_adj_list_vertex_id_map, boost::detail::edge_desc_impl, boost::detail::edge_desc_impl&>; P = int; T = boost::buffer_param_t; R = boost::no_property; typename boost::detail::edge_capacity_value::type = double; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/edmonds_karp_max_flow.hpp:208:54: required from ‘static typename boost::detail::edge_capacity_value::type boost::detail::edmonds_karp_dispatch1::apply(Graph&, typename boost::graph_traits::vertex_descriptor, typename boost::graph_traits::vertex_descriptor, const boost::bgl_named_params&, boost::param_not_found) [with Graph = boost::adjacency_list > > > >; P = int; T = boost::buffer_param_t; R = boost::no_property; typename boost::detail::edge_capacity_value::type = double; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/edmonds_karp_max_flow.hpp:228:57: required from ‘typename boost::detail::edge_capacity_value::type boost::edmonds_karp_max_flow(Graph&, typename graph_traits::vertex_descriptor, typename graph_traits::vertex_descriptor, const bgl_named_params&) [with Graph = adjacency_list > > > >; P = int; T = buffer_param_t; R = no_property; typename detail::edge_capacity_value::type = double; typename graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/edmonds_karp_max_flow.hpp:240:33: required from ‘typename boost::property_traits::const_type>::value_type boost::edmonds_karp_max_flow(Graph&, typename graph_traits::vertex_descriptor, typename graph_traits::vertex_descriptor) [with Graph = adjacency_list > > > >; typename property_traits::const_type>::value_type = double; typename property_map::const_type = adj_list_edge_property_map > > >, edge_capacity_t>; typename graph_traits::vertex_descriptor = long unsigned int]’ mincut.cpp:76:45: required from here /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::concepts::MultiPassInputIterator > > >, boost::edge_residual_capacity_t> >, boost::keep_all, boost::filtered_graph > > > >, boost::is_residual_edge > > >, boost::edge_residual_capacity_t> >, boost::keep_all> >, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > > > >*, std::vector > > > >, std::allocator > > > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >]’ 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ^ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::MultiPassInputIterator > > >, boost::edge_residual_capacity_t> >, boost::keep_all, boost::filtered_graph > > > >, boost::is_residual_edge > > >, boost::edge_residual_capacity_t> >, boost::keep_all> >, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > > > >*, std::vector > > > >, std::allocator > > > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >]’: /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/graph_concepts.hpp:89:9: required from ‘boost::concepts::IncidenceGraph::~IncidenceGraph() [with G = boost::filtered_graph > > > >, boost::is_residual_edge > > >, boost::edge_residual_capacity_t> >, boost::keep_all>]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/graph_concepts.hpp:75:1: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::IncidenceGraphConcept > > > >, boost::is_residual_edge > > >, boost::edge_residual_capacity_t> >, boost::keep_all> >]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/breadth_first_search.hpp:62:5: required from ‘void boost::breadth_first_visit(const IncidenceGraph&, SourceIterator, SourceIterator, Buffer&, BFSVisitor, ColorMap) [with IncidenceGraph = filtered_graph > > > >, is_residual_edge > > >, edge_residual_capacity_t> >, keep_all>; Buffer = queue > >; BFSVisitor = bfs_visitor*, std::vector, std::allocator > > >, vec_adj_list_vertex_id_map, detail::edge_desc_impl, detail::edge_desc_impl&>, on_tree_edge> >; ColorMap = iterator_property_map<__gnu_cxx::__normal_iterator >, vec_adj_list_vertex_id_map, default_color_type, default_color_type&>; SourceIterator = long unsigned int*]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/breadth_first_search.hpp:136:24: required from ‘void boost::breadth_first_search(const VertexListGraph&, SourceIterator, SourceIterator, Buffer&, BFSVisitor, ColorMap) [with VertexListGraph = filtered_graph > > > >, is_residual_edge > > >, edge_residual_capacity_t> >, keep_all>; SourceIterator = long unsigned int*; Buffer = queue > >; BFSVisitor = bfs_visitor*, std::vector, std::allocator > > >, vec_adj_list_vertex_id_map, detail::edge_desc_impl, detail::edge_desc_impl&>, on_tree_edge> >; ColorMap = iterator_property_map<__gnu_cxx::__normal_iterator >, vec_adj_list_vertex_id_map, default_color_type, default_color_type&>]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/breadth_first_search.hpp:147:25: required from ‘void boost::breadth_first_search(const VertexListGraph&, typename graph_traits::vertex_descriptor, Buffer&, BFSVisitor, ColorMap) [with VertexListGraph = filtered_graph > > > >, is_residual_edge > > >, edge_residual_capacity_t> >, keep_all>; Buffer = queue > >; BFSVisitor = bfs_visitor*, std::vector, std::allocator > > >, vec_adj_list_vertex_id_map, detail::edge_desc_impl, detail::edge_desc_impl&>, on_tree_edge> >; ColorMap = iterator_property_map<__gnu_cxx::__normal_iterator >, vec_adj_list_vertex_id_map, default_color_type, default_color_type&>; typename graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/edmonds_karp_max_flow.hpp:101:29: required from ‘typename boost::property_traits::value_type boost::edmonds_karp_max_flow(Graph&, typename graph_traits::vertex_descriptor, typename graph_traits::vertex_descriptor, CapacityEdgeMap, ResidualCapacityEdgeMap, ReverseEdgeMap, ColorMap, PredEdgeMap) [with Graph = adjacency_list > > > >; CapacityEdgeMap = adj_list_edge_property_map > > >, edge_capacity_t>; ResidualCapacityEdgeMap = adj_list_edge_property_map > > >, edge_residual_capacity_t>; ReverseEdgeMap = adj_list_edge_property_map, const detail::edge_desc_impl&, long unsigned int, const property > > >, edge_reverse_t>; ColorMap = iterator_property_map<__gnu_cxx::__normal_iterator >, vec_adj_list_vertex_id_map, default_color_type, default_color_type&>; PredEdgeMap = iterator_property_map<__gnu_cxx::__normal_iterator*, std::vector, std::allocator > > >, vec_adj_list_vertex_id_map, detail::edge_desc_impl, detail::edge_desc_impl&>; typename property_traits::value_type = double; typename graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/edmonds_karp_max_flow.hpp:154:41: required from ‘static typename boost::detail::edge_capacity_value::type boost::detail::edmonds_karp_dispatch2::apply(Graph&, typename boost::graph_traits::vertex_descriptor, typename boost::graph_traits::vertex_descriptor, PredMap, const boost::bgl_named_params&, boost::param_not_found) [with Graph = boost::adjacency_list > > > >; PredMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator*, std::vector, std::allocator > > >, boost::vec_adj_list_vertex_id_map, boost::detail::edge_desc_impl, boost::detail::edge_desc_impl&>; P = int; T = boost::buffer_param_t; R = boost::no_property; typename boost::detail::edge_capacity_value::type = double; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/edmonds_karp_max_flow.hpp:208:54: required from ‘static typename boost::detail::edge_capacity_value::type boost::detail::edmonds_karp_dispatch1::apply(Graph&, typename boost::graph_traits::vertex_descriptor, typename boost::graph_traits::vertex_descriptor, const boost::bgl_named_params&, boost::param_not_found) [with Graph = boost::adjacency_list > > > >; P = int; T = boost::buffer_param_t; R = boost::no_property; typename boost::detail::edge_capacity_value::type = double; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/edmonds_karp_max_flow.hpp:228:57: required from ‘typename boost::detail::edge_capacity_value::type boost::edmonds_karp_max_flow(Graph&, typename graph_traits::vertex_descriptor, typename graph_traits::vertex_descriptor, const bgl_named_params&) [with Graph = adjacency_list > > > >; P = int; T = buffer_param_t; R = no_property; typename detail::edge_capacity_value::type = double; typename graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/edmonds_karp_max_flow.hpp:240:33: required from ‘typename boost::property_traits::const_type>::value_type boost::edmonds_karp_max_flow(Graph&, typename graph_traits::vertex_descriptor, typename graph_traits::vertex_descriptor) [with Graph = adjacency_list > > > >; typename property_traits::const_type>::value_type = double; typename property_map::const_type = adj_list_edge_property_map > > >, edge_capacity_t>; typename graph_traits::vertex_descriptor = long unsigned int]’ mincut.cpp:76:45: required from here /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::concepts::MultiPassInputIterator::~MultiPassInputIterator() [with T = boost::iterators::filter_iterator > > >, boost::edge_residual_capacity_t> >, boost::keep_all, boost::filtered_graph > > > >, boost::is_residual_edge > > >, boost::edge_residual_capacity_t> >, boost::keep_all> >, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > > > >*, std::vector > > > >, std::allocator > > > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> >]’ 37 | ~model() | ^ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/graph_concepts.hpp:52:50: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 52 | BOOST_concept(MultiPassInputIterator, (T)) { BOOST_CONCEPT_USAGE( | ^~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::CopyConstructible*, std::vector, std::allocator > > >, boost::vec_adj_list_vertex_id_map, boost::detail::edge_desc_impl, boost::detail::edge_desc_impl&>, boost::on_tree_edge> > >]’: /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements*, std::vector, std::allocator > > >, boost::vec_adj_list_vertex_id_map, boost::detail::edge_desc_impl, boost::detail::edge_desc_impl&>, boost::on_tree_edge> > > >]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:167:5: required from ‘struct boost::CopyConstructible*, std::vector, std::allocator > > >, boost::vec_adj_list_vertex_id_map, boost::detail::edge_desc_impl, boost::detail::edge_desc_impl&>, boost::on_tree_edge> > >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:165:3: required from ‘struct boost::CopyConstructibleConcept*, std::vector, std::allocator > > >, boost::vec_adj_list_vertex_id_map, boost::detail::edge_desc_impl, boost::detail::edge_desc_impl&>, boost::on_tree_edge> > >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::CopyConstructibleConcept*, std::vector, std::allocator > > >, boost::vec_adj_list_vertex_id_map, boost::detail::edge_desc_impl, boost::detail::edge_desc_impl&>, boost::on_tree_edge> > >]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied*, std::vector, std::allocator > > >, boost::vec_adj_list_vertex_id_map, boost::detail::edge_desc_impl, boost::detail::edge_desc_impl&>, boost::on_tree_edge> > > >::value’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:45:51: [ skipping 10 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/edmonds_karp_max_flow.hpp:101:29: required from ‘typename boost::property_traits::value_type boost::edmonds_karp_max_flow(Graph&, typename graph_traits::vertex_descriptor, typename graph_traits::vertex_descriptor, CapacityEdgeMap, ResidualCapacityEdgeMap, ReverseEdgeMap, ColorMap, PredEdgeMap) [with Graph = adjacency_list > > > >; CapacityEdgeMap = adj_list_edge_property_map > > >, edge_capacity_t>; ResidualCapacityEdgeMap = adj_list_edge_property_map > > >, edge_residual_capacity_t>; ReverseEdgeMap = adj_list_edge_property_map, const detail::edge_desc_impl&, long unsigned int, const property > > >, edge_reverse_t>; ColorMap = iterator_property_map<__gnu_cxx::__normal_iterator >, vec_adj_list_vertex_id_map, default_color_type, default_color_type&>; PredEdgeMap = iterator_property_map<__gnu_cxx::__normal_iterator*, std::vector, std::allocator > > >, vec_adj_list_vertex_id_map, detail::edge_desc_impl, detail::edge_desc_impl&>; typename property_traits::value_type = double; typename graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/edmonds_karp_max_flow.hpp:154:41: required from ‘static typename boost::detail::edge_capacity_value::type boost::detail::edmonds_karp_dispatch2::apply(Graph&, typename boost::graph_traits::vertex_descriptor, typename boost::graph_traits::vertex_descriptor, PredMap, const boost::bgl_named_params&, boost::param_not_found) [with Graph = boost::adjacency_list > > > >; PredMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator*, std::vector, std::allocator > > >, boost::vec_adj_list_vertex_id_map, boost::detail::edge_desc_impl, boost::detail::edge_desc_impl&>; P = int; T = boost::buffer_param_t; R = boost::no_property; typename boost::detail::edge_capacity_value::type = double; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/edmonds_karp_max_flow.hpp:208:54: required from ‘static typename boost::detail::edge_capacity_value::type boost::detail::edmonds_karp_dispatch1::apply(Graph&, typename boost::graph_traits::vertex_descriptor, typename boost::graph_traits::vertex_descriptor, const boost::bgl_named_params&, boost::param_not_found) [with Graph = boost::adjacency_list > > > >; P = int; T = boost::buffer_param_t; R = boost::no_property; typename boost::detail::edge_capacity_value::type = double; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/edmonds_karp_max_flow.hpp:228:57: required from ‘typename boost::detail::edge_capacity_value::type boost::edmonds_karp_max_flow(Graph&, typename graph_traits::vertex_descriptor, typename graph_traits::vertex_descriptor, const bgl_named_params&) [with Graph = adjacency_list > > > >; P = int; T = buffer_param_t; R = no_property; typename detail::edge_capacity_value::type = double; typename graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/edmonds_karp_max_flow.hpp:240:33: required from ‘typename boost::property_traits::const_type>::value_type boost::edmonds_karp_max_flow(Graph&, typename graph_traits::vertex_descriptor, typename graph_traits::vertex_descriptor) [with Graph = adjacency_list > > > >; typename property_traits::const_type>::value_type = double; typename property_map::const_type = adj_list_edge_property_map > > >, edge_capacity_t>; typename graph_traits::vertex_descriptor = long unsigned int]’ mincut.cpp:76:45: required from here /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::CopyConstructible::~CopyConstructible() [with TT = boost::bfs_visitor*, std::vector, std::allocator > > >, boost::vec_adj_list_vertex_id_map, boost::detail::edge_desc_impl, boost::detail::edge_desc_impl&>, boost::on_tree_edge> >]’ 37 | ~model() | ^ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:167:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 167 | BOOST_CONCEPT_USAGE(CopyConstructible) { | ^~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::Assignable > > >, boost::edge_residual_capacity_t> >, boost::keep_all, boost::filtered_graph > > >, boost::no_property, boost::listS>, boost::is_residual_edge > > >, boost::edge_residual_capacity_t> >, boost::keep_all> >, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > > > >*, std::vector > > > >, std::allocator > > > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >]’: /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements > > >, boost::edge_residual_capacity_t> >, boost::keep_all, boost::filtered_graph > > >, boost::no_property, boost::listS>, boost::is_residual_edge > > >, boost::edge_residual_capacity_t> >, boost::keep_all> >, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > > > >*, std::vector > > > >, std::allocator > > > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > > >]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:145:5: required from ‘struct boost::Assignable > > >, boost::edge_residual_capacity_t> >, boost::keep_all, boost::filtered_graph > > >, boost::no_property, boost::listS>, boost::is_residual_edge > > >, boost::edge_residual_capacity_t> >, boost::keep_all> >, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > > > >*, std::vector > > > >, std::allocator > > > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:502:3: required from ‘struct boost::InputIterator > > >, boost::edge_residual_capacity_t> >, boost::keep_all, boost::filtered_graph > > >, boost::no_property, boost::listS>, boost::is_residual_edge > > >, boost::edge_residual_capacity_t> >, boost::keep_all> >, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > > > >*, std::vector > > > >, std::allocator > > > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::InputIterator > > >, boost::edge_residual_capacity_t> >, boost::keep_all, boost::filtered_graph > > >, boost::no_property, boost::listS>, boost::is_residual_edge > > >, boost::edge_residual_capacity_t> >, boost::keep_all> >, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > > > >*, std::vector > > > >, std::allocator > > > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied > > >, boost::edge_residual_capacity_t> >, boost::keep_all, boost::filtered_graph > > >, boost::no_property, boost::listS>, boost::is_residual_edge > > >, boost::edge_residual_capacity_t> >, boost::keep_all> >, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > > > >*, std::vector > > > >, std::allocator > > > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > > >::value’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:45:51: [ skipping 6 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/breadth_first_search.hpp:62:5: required from ‘void boost::breadth_first_visit(const IncidenceGraph&, SourceIterator, SourceIterator, Buffer&, BFSVisitor, ColorMap) [with IncidenceGraph = filtered_graph > > >, no_property, listS>, is_residual_edge > > >, edge_residual_capacity_t> >, keep_all>; Buffer = queue > >; BFSVisitor = bfs_visitor*, on_tree_edge> >; ColorMap = default_color_type*; SourceIterator = long unsigned int*]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/breadth_first_search.hpp:136:24: required from ‘void boost::breadth_first_search(const VertexListGraph&, SourceIterator, SourceIterator, Buffer&, BFSVisitor, ColorMap) [with VertexListGraph = filtered_graph > > >, no_property, listS>, is_residual_edge > > >, edge_residual_capacity_t> >, keep_all>; SourceIterator = long unsigned int*; Buffer = queue > >; BFSVisitor = bfs_visitor*, on_tree_edge> >; ColorMap = default_color_type*]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/breadth_first_search.hpp:147:25: required from ‘void boost::breadth_first_search(const VertexListGraph&, typename graph_traits::vertex_descriptor, Buffer&, BFSVisitor, ColorMap) [with VertexListGraph = filtered_graph > > >, no_property, listS>, is_residual_edge > > >, edge_residual_capacity_t> >, keep_all>; Buffer = queue > >; BFSVisitor = bfs_visitor*, on_tree_edge> >; ColorMap = default_color_type*; typename graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/edmonds_karp_max_flow.hpp:101:29: required from ‘typename boost::property_traits::value_type boost::edmonds_karp_max_flow(Graph&, typename graph_traits::vertex_descriptor, typename graph_traits::vertex_descriptor, CapacityEdgeMap, ResidualCapacityEdgeMap, ReverseEdgeMap, ColorMap, PredEdgeMap) [with Graph = adjacency_list > > >, no_property, listS>; CapacityEdgeMap = adj_list_edge_property_map > > >, edge_capacity_t>; ResidualCapacityEdgeMap = adj_list_edge_property_map > > >, edge_residual_capacity_t>; ReverseEdgeMap = adj_list_edge_property_map, detail::edge_desc_impl&, long unsigned int, property > > >, edge_reverse_t>; ColorMap = default_color_type*; PredEdgeMap = detail::edge_desc_impl*; typename property_traits::value_type = long unsigned int; typename graph_traits::vertex_descriptor = long unsigned int]’ mincut.hpp:78:21: required from ‘typename boost::graph_traits::edges_size_type boost::min_cut(VertexListGraph&, OutputIterator, OutputIterator) [with VertexListGraph = R_adjacency_list; OutputIterator = std::back_insert_iterator >; typename graph_traits::edges_size_type = long unsigned int]’ mincut.cpp:128:35: required from here /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::Assignable::~Assignable() [with TT = boost::iterators::filter_iterator > > >, boost::edge_residual_capacity_t> >, boost::keep_all, boost::filtered_graph > > >, boost::no_property, boost::listS>, boost::is_residual_edge > > >, boost::edge_residual_capacity_t> >, boost::keep_all> >, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > > > >*, std::vector > > > >, std::allocator > > > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> >]’ 37 | ~model() | ^ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:145:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 145 | BOOST_CONCEPT_USAGE(Assignable) { | ^~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::EqualityComparable > > >, boost::edge_residual_capacity_t> >, boost::keep_all, boost::filtered_graph > > >, boost::no_property, boost::listS>, boost::is_residual_edge > > >, boost::edge_residual_capacity_t> >, boost::keep_all> >, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > > > >*, std::vector > > > >, std::allocator > > > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >]’: /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements > > >, boost::edge_residual_capacity_t> >, boost::keep_all, boost::filtered_graph > > >, boost::no_property, boost::listS>, boost::is_residual_edge > > >, boost::edge_residual_capacity_t> >, boost::keep_all> >, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > > > >*, std::vector > > > >, std::allocator > > > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > > >]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:233:5: required from ‘struct boost::EqualityComparable > > >, boost::edge_residual_capacity_t> >, boost::keep_all, boost::filtered_graph > > >, boost::no_property, boost::listS>, boost::is_residual_edge > > >, boost::edge_residual_capacity_t> >, boost::keep_all> >, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > > > >*, std::vector > > > >, std::allocator > > > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:502:3: required from ‘struct boost::InputIterator > > >, boost::edge_residual_capacity_t> >, boost::keep_all, boost::filtered_graph > > >, boost::no_property, boost::listS>, boost::is_residual_edge > > >, boost::edge_residual_capacity_t> >, boost::keep_all> >, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > > > >*, std::vector > > > >, std::allocator > > > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::InputIterator > > >, boost::edge_residual_capacity_t> >, boost::keep_all, boost::filtered_graph > > >, boost::no_property, boost::listS>, boost::is_residual_edge > > >, boost::edge_residual_capacity_t> >, boost::keep_all> >, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > > > >*, std::vector > > > >, std::allocator > > > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied > > >, boost::edge_residual_capacity_t> >, boost::keep_all, boost::filtered_graph > > >, boost::no_property, boost::listS>, boost::is_residual_edge > > >, boost::edge_residual_capacity_t> >, boost::keep_all> >, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > > > >*, std::vector > > > >, std::allocator > > > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > > >::value’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:45:51: [ skipping 6 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/breadth_first_search.hpp:62:5: required from ‘void boost::breadth_first_visit(const IncidenceGraph&, SourceIterator, SourceIterator, Buffer&, BFSVisitor, ColorMap) [with IncidenceGraph = filtered_graph > > >, no_property, listS>, is_residual_edge > > >, edge_residual_capacity_t> >, keep_all>; Buffer = queue > >; BFSVisitor = bfs_visitor*, on_tree_edge> >; ColorMap = default_color_type*; SourceIterator = long unsigned int*]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/breadth_first_search.hpp:136:24: required from ‘void boost::breadth_first_search(const VertexListGraph&, SourceIterator, SourceIterator, Buffer&, BFSVisitor, ColorMap) [with VertexListGraph = filtered_graph > > >, no_property, listS>, is_residual_edge > > >, edge_residual_capacity_t> >, keep_all>; SourceIterator = long unsigned int*; Buffer = queue > >; BFSVisitor = bfs_visitor*, on_tree_edge> >; ColorMap = default_color_type*]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/breadth_first_search.hpp:147:25: required from ‘void boost::breadth_first_search(const VertexListGraph&, typename graph_traits::vertex_descriptor, Buffer&, BFSVisitor, ColorMap) [with VertexListGraph = filtered_graph > > >, no_property, listS>, is_residual_edge > > >, edge_residual_capacity_t> >, keep_all>; Buffer = queue > >; BFSVisitor = bfs_visitor*, on_tree_edge> >; ColorMap = default_color_type*; typename graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/edmonds_karp_max_flow.hpp:101:29: required from ‘typename boost::property_traits::value_type boost::edmonds_karp_max_flow(Graph&, typename graph_traits::vertex_descriptor, typename graph_traits::vertex_descriptor, CapacityEdgeMap, ResidualCapacityEdgeMap, ReverseEdgeMap, ColorMap, PredEdgeMap) [with Graph = adjacency_list > > >, no_property, listS>; CapacityEdgeMap = adj_list_edge_property_map > > >, edge_capacity_t>; ResidualCapacityEdgeMap = adj_list_edge_property_map > > >, edge_residual_capacity_t>; ReverseEdgeMap = adj_list_edge_property_map, detail::edge_desc_impl&, long unsigned int, property > > >, edge_reverse_t>; ColorMap = default_color_type*; PredEdgeMap = detail::edge_desc_impl*; typename property_traits::value_type = long unsigned int; typename graph_traits::vertex_descriptor = long unsigned int]’ mincut.hpp:78:21: required from ‘typename boost::graph_traits::edges_size_type boost::min_cut(VertexListGraph&, OutputIterator, OutputIterator) [with VertexListGraph = R_adjacency_list; OutputIterator = std::back_insert_iterator >; typename graph_traits::edges_size_type = long unsigned int]’ mincut.cpp:128:35: required from here /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::EqualityComparable::~EqualityComparable() [with TT = boost::iterators::filter_iterator > > >, boost::edge_residual_capacity_t> >, boost::keep_all, boost::filtered_graph > > >, boost::no_property, boost::listS>, boost::is_residual_edge > > >, boost::edge_residual_capacity_t> >, boost::keep_all> >, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > > > >*, std::vector > > > >, std::allocator > > > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> >]’ 37 | ~model() | ^ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:233:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 233 | BOOST_CONCEPT_USAGE(EqualityComparable) { | ^~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::InputIterator > > >, boost::edge_residual_capacity_t> >, boost::keep_all, boost::filtered_graph > > >, boost::no_property, boost::listS>, boost::is_residual_edge > > >, boost::edge_residual_capacity_t> >, boost::keep_all> >, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > > > >*, std::vector > > > >, std::allocator > > > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >]’: /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements > > >, boost::edge_residual_capacity_t> >, boost::keep_all, boost::filtered_graph > > >, boost::no_property, boost::listS>, boost::is_residual_edge > > >, boost::edge_residual_capacity_t> >, boost::keep_all> >, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > > > >*, std::vector > > > >, std::allocator > > > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > > >]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:512:7: required from ‘struct boost::InputIterator > > >, boost::edge_residual_capacity_t> >, boost::keep_all, boost::filtered_graph > > >, boost::no_property, boost::listS>, boost::is_residual_edge > > >, boost::edge_residual_capacity_t> >, boost::keep_all> >, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > > > >*, std::vector > > > >, std::allocator > > > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::InputIterator > > >, boost::edge_residual_capacity_t> >, boost::keep_all, boost::filtered_graph > > >, boost::no_property, boost::listS>, boost::is_residual_edge > > >, boost::edge_residual_capacity_t> >, boost::keep_all> >, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > > > >*, std::vector > > > >, std::allocator > > > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied > > >, boost::edge_residual_capacity_t> >, boost::keep_all, boost::filtered_graph > > >, boost::no_property, boost::listS>, boost::is_residual_edge > > >, boost::edge_residual_capacity_t> >, boost::keep_all> >, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > > > >*, std::vector > > > >, std::allocator > > > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > > >::value’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied > > >, boost::edge_residual_capacity_t> >, boost::keep_all, boost::filtered_graph > > >, boost::no_property, boost::listS>, boost::is_residual_edge > > >, boost::edge_residual_capacity_t> >, boost::keep_all> >, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > > > >*, std::vector > > > >, std::allocator > > > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > > >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:72:8: [ skipping 5 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/breadth_first_search.hpp:62:5: required from ‘void boost::breadth_first_visit(const IncidenceGraph&, SourceIterator, SourceIterator, Buffer&, BFSVisitor, ColorMap) [with IncidenceGraph = filtered_graph > > >, no_property, listS>, is_residual_edge > > >, edge_residual_capacity_t> >, keep_all>; Buffer = queue > >; BFSVisitor = bfs_visitor*, on_tree_edge> >; ColorMap = default_color_type*; SourceIterator = long unsigned int*]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/breadth_first_search.hpp:136:24: required from ‘void boost::breadth_first_search(const VertexListGraph&, SourceIterator, SourceIterator, Buffer&, BFSVisitor, ColorMap) [with VertexListGraph = filtered_graph > > >, no_property, listS>, is_residual_edge > > >, edge_residual_capacity_t> >, keep_all>; SourceIterator = long unsigned int*; Buffer = queue > >; BFSVisitor = bfs_visitor*, on_tree_edge> >; ColorMap = default_color_type*]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/breadth_first_search.hpp:147:25: required from ‘void boost::breadth_first_search(const VertexListGraph&, typename graph_traits::vertex_descriptor, Buffer&, BFSVisitor, ColorMap) [with VertexListGraph = filtered_graph > > >, no_property, listS>, is_residual_edge > > >, edge_residual_capacity_t> >, keep_all>; Buffer = queue > >; BFSVisitor = bfs_visitor*, on_tree_edge> >; ColorMap = default_color_type*; typename graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/edmonds_karp_max_flow.hpp:101:29: required from ‘typename boost::property_traits::value_type boost::edmonds_karp_max_flow(Graph&, typename graph_traits::vertex_descriptor, typename graph_traits::vertex_descriptor, CapacityEdgeMap, ResidualCapacityEdgeMap, ReverseEdgeMap, ColorMap, PredEdgeMap) [with Graph = adjacency_list > > >, no_property, listS>; CapacityEdgeMap = adj_list_edge_property_map > > >, edge_capacity_t>; ResidualCapacityEdgeMap = adj_list_edge_property_map > > >, edge_residual_capacity_t>; ReverseEdgeMap = adj_list_edge_property_map, detail::edge_desc_impl&, long unsigned int, property > > >, edge_reverse_t>; ColorMap = default_color_type*; PredEdgeMap = detail::edge_desc_impl*; typename property_traits::value_type = long unsigned int; typename graph_traits::vertex_descriptor = long unsigned int]’ mincut.hpp:78:21: required from ‘typename boost::graph_traits::edges_size_type boost::min_cut(VertexListGraph&, OutputIterator, OutputIterator) [with VertexListGraph = R_adjacency_list; OutputIterator = std::back_insert_iterator >; typename graph_traits::edges_size_type = long unsigned int]’ mincut.cpp:128:35: required from here /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::InputIterator::~InputIterator() [with TT = boost::iterators::filter_iterator > > >, boost::edge_residual_capacity_t> >, boost::keep_all, boost::filtered_graph > > >, boost::no_property, boost::listS>, boost::is_residual_edge > > >, boost::edge_residual_capacity_t> >, boost::keep_all> >, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > > > >*, std::vector > > > >, std::allocator > > > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> >]’ 37 | ~model() | ^ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:512:7: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 512 | BOOST_CONCEPT_USAGE(InputIterator) | ^~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::concepts::MultiPassInputIterator > > >, boost::edge_residual_capacity_t> >, boost::keep_all, boost::filtered_graph > > > >, boost::is_residual_edge > > >, boost::edge_residual_capacity_t> >, boost::keep_all> >, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > > > >*, std::vector > > > >, std::allocator > > > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >]’: /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements > > >, boost::edge_residual_capacity_t> >, boost::keep_all, boost::filtered_graph > > > >, boost::is_residual_edge > > >, boost::edge_residual_capacity_t> >, boost::keep_all> >, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > > > >*, std::vector > > > >, std::allocator > > > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > > >]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/graph_concepts.hpp:52:50: required from ‘struct boost::concepts::MultiPassInputIterator > > >, boost::edge_residual_capacity_t> >, boost::keep_all, boost::filtered_graph > > > >, boost::is_residual_edge > > >, boost::edge_residual_capacity_t> >, boost::keep_all> >, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > > > >*, std::vector > > > >, std::allocator > > > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::concepts::MultiPassInputIterator > > >, boost::edge_residual_capacity_t> >, boost::keep_all, boost::filtered_graph > > > >, boost::is_residual_edge > > >, boost::edge_residual_capacity_t> >, boost::keep_all> >, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > > > >*, std::vector > > > >, std::allocator > > > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied > > >, boost::edge_residual_capacity_t> >, boost::keep_all, boost::filtered_graph > > > >, boost::is_residual_edge > > >, boost::edge_residual_capacity_t> >, boost::keep_all> >, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > > > >*, std::vector > > > >, std::allocator > > > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > > >::value’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied > > >, boost::edge_residual_capacity_t> >, boost::keep_all, boost::filtered_graph > > > >, boost::is_residual_edge > > >, boost::edge_residual_capacity_t> >, boost::keep_all> >, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > > > >*, std::vector > > > >, std::allocator > > > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > > >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:72:8: [ skipping 6 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/edmonds_karp_max_flow.hpp:101:29: required from ‘typename boost::property_traits::value_type boost::edmonds_karp_max_flow(Graph&, typename graph_traits::vertex_descriptor, typename graph_traits::vertex_descriptor, CapacityEdgeMap, ResidualCapacityEdgeMap, ReverseEdgeMap, ColorMap, PredEdgeMap) [with Graph = adjacency_list > > > >; CapacityEdgeMap = adj_list_edge_property_map > > >, edge_capacity_t>; ResidualCapacityEdgeMap = adj_list_edge_property_map > > >, edge_residual_capacity_t>; ReverseEdgeMap = adj_list_edge_property_map, const detail::edge_desc_impl&, long unsigned int, const property > > >, edge_reverse_t>; ColorMap = iterator_property_map<__gnu_cxx::__normal_iterator >, vec_adj_list_vertex_id_map, default_color_type, default_color_type&>; PredEdgeMap = iterator_property_map<__gnu_cxx::__normal_iterator*, std::vector, std::allocator > > >, vec_adj_list_vertex_id_map, detail::edge_desc_impl, detail::edge_desc_impl&>; typename property_traits::value_type = double; typename graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/edmonds_karp_max_flow.hpp:154:41: required from ‘static typename boost::detail::edge_capacity_value::type boost::detail::edmonds_karp_dispatch2::apply(Graph&, typename boost::graph_traits::vertex_descriptor, typename boost::graph_traits::vertex_descriptor, PredMap, const boost::bgl_named_params&, boost::param_not_found) [with Graph = boost::adjacency_list > > > >; PredMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator*, std::vector, std::allocator > > >, boost::vec_adj_list_vertex_id_map, boost::detail::edge_desc_impl, boost::detail::edge_desc_impl&>; P = int; T = boost::buffer_param_t; R = boost::no_property; typename boost::detail::edge_capacity_value::type = double; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/edmonds_karp_max_flow.hpp:208:54: required from ‘static typename boost::detail::edge_capacity_value::type boost::detail::edmonds_karp_dispatch1::apply(Graph&, typename boost::graph_traits::vertex_descriptor, typename boost::graph_traits::vertex_descriptor, const boost::bgl_named_params&, boost::param_not_found) [with Graph = boost::adjacency_list > > > >; P = int; T = boost::buffer_param_t; R = boost::no_property; typename boost::detail::edge_capacity_value::type = double; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/edmonds_karp_max_flow.hpp:228:57: required from ‘typename boost::detail::edge_capacity_value::type boost::edmonds_karp_max_flow(Graph&, typename graph_traits::vertex_descriptor, typename graph_traits::vertex_descriptor, const bgl_named_params&) [with Graph = adjacency_list > > > >; P = int; T = buffer_param_t; R = no_property; typename detail::edge_capacity_value::type = double; typename graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/edmonds_karp_max_flow.hpp:240:33: required from ‘typename boost::property_traits::const_type>::value_type boost::edmonds_karp_max_flow(Graph&, typename graph_traits::vertex_descriptor, typename graph_traits::vertex_descriptor) [with Graph = adjacency_list > > > >; typename property_traits::const_type>::value_type = double; typename property_map::const_type = adj_list_edge_property_map > > >, edge_capacity_t>; typename graph_traits::vertex_descriptor = long unsigned int]’ mincut.cpp:76:45: required from here /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::concepts::MultiPassInputIterator::~MultiPassInputIterator() [with T = boost::iterators::filter_iterator > > >, boost::edge_residual_capacity_t> >, boost::keep_all, boost::filtered_graph > > > >, boost::is_residual_edge > > >, boost::edge_residual_capacity_t> >, boost::keep_all> >, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > > > >*, std::vector > > > >, std::allocator > > > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> >]’ 37 | ~model() | ^ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/graph_concepts.hpp:52:50: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 52 | BOOST_concept(MultiPassInputIterator, (T)) { BOOST_CONCEPT_USAGE( | ^~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements, std::input_iterator_tag> >]’: /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:208:5: required from ‘struct boost::Convertible, std::input_iterator_tag>’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::Convertible, std::input_iterator_tag>]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied, std::input_iterator_tag> >::value’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied, std::input_iterator_tag> >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_, std::input_iterator_tag>)>’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:515:9: [ skipping 6 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/breadth_first_search.hpp:62:5: required from ‘void boost::breadth_first_visit(const IncidenceGraph&, SourceIterator, SourceIterator, Buffer&, BFSVisitor, ColorMap) [with IncidenceGraph = filtered_graph > > >, no_property, listS>, is_residual_edge > > >, edge_residual_capacity_t> >, keep_all>; Buffer = queue > >; BFSVisitor = bfs_visitor*, on_tree_edge> >; ColorMap = default_color_type*; SourceIterator = long unsigned int*]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/breadth_first_search.hpp:136:24: required from ‘void boost::breadth_first_search(const VertexListGraph&, SourceIterator, SourceIterator, Buffer&, BFSVisitor, ColorMap) [with VertexListGraph = filtered_graph > > >, no_property, listS>, is_residual_edge > > >, edge_residual_capacity_t> >, keep_all>; SourceIterator = long unsigned int*; Buffer = queue > >; BFSVisitor = bfs_visitor*, on_tree_edge> >; ColorMap = default_color_type*]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/breadth_first_search.hpp:147:25: required from ‘void boost::breadth_first_search(const VertexListGraph&, typename graph_traits::vertex_descriptor, Buffer&, BFSVisitor, ColorMap) [with VertexListGraph = filtered_graph > > >, no_property, listS>, is_residual_edge > > >, edge_residual_capacity_t> >, keep_all>; Buffer = queue > >; BFSVisitor = bfs_visitor*, on_tree_edge> >; ColorMap = default_color_type*; typename graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/edmonds_karp_max_flow.hpp:101:29: required from ‘typename boost::property_traits::value_type boost::edmonds_karp_max_flow(Graph&, typename graph_traits::vertex_descriptor, typename graph_traits::vertex_descriptor, CapacityEdgeMap, ResidualCapacityEdgeMap, ReverseEdgeMap, ColorMap, PredEdgeMap) [with Graph = adjacency_list > > >, no_property, listS>; CapacityEdgeMap = adj_list_edge_property_map > > >, edge_capacity_t>; ResidualCapacityEdgeMap = adj_list_edge_property_map > > >, edge_residual_capacity_t>; ReverseEdgeMap = adj_list_edge_property_map, detail::edge_desc_impl&, long unsigned int, property > > >, edge_reverse_t>; ColorMap = default_color_type*; PredEdgeMap = detail::edge_desc_impl*; typename property_traits::value_type = long unsigned int; typename graph_traits::vertex_descriptor = long unsigned int]’ mincut.hpp:78:21: required from ‘typename boost::graph_traits::edges_size_type boost::min_cut(VertexListGraph&, OutputIterator, OutputIterator) [with VertexListGraph = R_adjacency_list; OutputIterator = std::back_insert_iterator >; typename graph_traits::edges_size_type = long unsigned int]’ mincut.cpp:128:35: required from here /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::Convertible, std::input_iterator_tag>]’ 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ^ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::Convertible, std::input_iterator_tag>]’: /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:515:9: required from ‘boost::InputIterator::~InputIterator() [with TT = boost::iterators::filter_iterator > > >, boost::edge_residual_capacity_t> >, boost::keep_all, boost::filtered_graph > > >, boost::no_property, boost::listS>, boost::is_residual_edge > > >, boost::edge_residual_capacity_t> >, boost::keep_all> >, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > > > >*, std::vector > > > >, std::allocator > > > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> >]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::InputIterator > > >, boost::edge_residual_capacity_t> >, boost::keep_all, boost::filtered_graph > > >, boost::no_property, boost::listS>, boost::is_residual_edge > > >, boost::edge_residual_capacity_t> >, boost::keep_all> >, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > > > >*, std::vector > > > >, std::allocator > > > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/graph_concepts.hpp:53:35: required from ‘boost::concepts::MultiPassInputIterator::~MultiPassInputIterator() [with T = boost::iterators::filter_iterator > > >, boost::edge_residual_capacity_t> >, boost::keep_all, boost::filtered_graph > > >, boost::no_property, boost::listS>, boost::is_residual_edge > > >, boost::edge_residual_capacity_t> >, boost::keep_all> >, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > > > >*, std::vector > > > >, std::allocator > > > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> >]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::MultiPassInputIterator > > >, boost::edge_residual_capacity_t> >, boost::keep_all, boost::filtered_graph > > >, boost::no_property, boost::listS>, boost::is_residual_edge > > >, boost::edge_residual_capacity_t> >, boost::keep_all> >, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > > > >*, std::vector > > > >, std::allocator > > > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/graph_concepts.hpp:89:9: [ skipping 2 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/breadth_first_search.hpp:62:5: required from ‘void boost::breadth_first_visit(const IncidenceGraph&, SourceIterator, SourceIterator, Buffer&, BFSVisitor, ColorMap) [with IncidenceGraph = filtered_graph > > >, no_property, listS>, is_residual_edge > > >, edge_residual_capacity_t> >, keep_all>; Buffer = queue > >; BFSVisitor = bfs_visitor*, on_tree_edge> >; ColorMap = default_color_type*; SourceIterator = long unsigned int*]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/breadth_first_search.hpp:136:24: required from ‘void boost::breadth_first_search(const VertexListGraph&, SourceIterator, SourceIterator, Buffer&, BFSVisitor, ColorMap) [with VertexListGraph = filtered_graph > > >, no_property, listS>, is_residual_edge > > >, edge_residual_capacity_t> >, keep_all>; SourceIterator = long unsigned int*; Buffer = queue > >; BFSVisitor = bfs_visitor*, on_tree_edge> >; ColorMap = default_color_type*]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/breadth_first_search.hpp:147:25: required from ‘void boost::breadth_first_search(const VertexListGraph&, typename graph_traits::vertex_descriptor, Buffer&, BFSVisitor, ColorMap) [with VertexListGraph = filtered_graph > > >, no_property, listS>, is_residual_edge > > >, edge_residual_capacity_t> >, keep_all>; Buffer = queue > >; BFSVisitor = bfs_visitor*, on_tree_edge> >; ColorMap = default_color_type*; typename graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/edmonds_karp_max_flow.hpp:101:29: required from ‘typename boost::property_traits::value_type boost::edmonds_karp_max_flow(Graph&, typename graph_traits::vertex_descriptor, typename graph_traits::vertex_descriptor, CapacityEdgeMap, ResidualCapacityEdgeMap, ReverseEdgeMap, ColorMap, PredEdgeMap) [with Graph = adjacency_list > > >, no_property, listS>; CapacityEdgeMap = adj_list_edge_property_map > > >, edge_capacity_t>; ResidualCapacityEdgeMap = adj_list_edge_property_map > > >, edge_residual_capacity_t>; ReverseEdgeMap = adj_list_edge_property_map, detail::edge_desc_impl&, long unsigned int, property > > >, edge_reverse_t>; ColorMap = default_color_type*; PredEdgeMap = detail::edge_desc_impl*; typename property_traits::value_type = long unsigned int; typename graph_traits::vertex_descriptor = long unsigned int]’ mincut.hpp:78:21: required from ‘typename boost::graph_traits::edges_size_type boost::min_cut(VertexListGraph&, OutputIterator, OutputIterator) [with VertexListGraph = R_adjacency_list; OutputIterator = std::back_insert_iterator >; typename graph_traits::edges_size_type = long unsigned int]’ mincut.cpp:128:35: required from here /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::Convertible::~Convertible() [with X = boost::iterators::detail::iterator_category_with_traversal; Y = std::input_iterator_tag]’ 37 | ~model() | ^ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:208:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 208 | BOOST_CONCEPT_USAGE(Convertible) { | ^~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements > > >, boost::edge_residual_capacity_t> >, boost::keep_all, boost::filtered_graph > > > >, boost::is_residual_edge > > >, boost::edge_residual_capacity_t> >, boost::keep_all> >, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > > > >*, std::vector > > > >, std::allocator > > > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > > >]’: /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:145:5: required from ‘struct boost::Assignable > > >, boost::edge_residual_capacity_t> >, boost::keep_all, boost::filtered_graph > > > >, boost::is_residual_edge > > >, boost::edge_residual_capacity_t> >, boost::keep_all> >, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > > > >*, std::vector > > > >, std::allocator > > > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:502:3: required from ‘struct boost::InputIterator > > >, boost::edge_residual_capacity_t> >, boost::keep_all, boost::filtered_graph > > > >, boost::is_residual_edge > > >, boost::edge_residual_capacity_t> >, boost::keep_all> >, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > > > >*, std::vector > > > >, std::allocator > > > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::InputIterator > > >, boost::edge_residual_capacity_t> >, boost::keep_all, boost::filtered_graph > > > >, boost::is_residual_edge > > >, boost::edge_residual_capacity_t> >, boost::keep_all> >, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > > > >*, std::vector > > > >, std::allocator > > > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied > > >, boost::edge_residual_capacity_t> >, boost::keep_all, boost::filtered_graph > > > >, boost::is_residual_edge > > >, boost::edge_residual_capacity_t> >, boost::keep_all> >, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > > > >*, std::vector > > > >, std::allocator > > > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > > >::value’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied > > >, boost::edge_residual_capacity_t> >, boost::keep_all, boost::filtered_graph > > > >, boost::is_residual_edge > > >, boost::edge_residual_capacity_t> >, boost::keep_all> >, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > > > >*, std::vector > > > >, std::allocator > > > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > > >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:72:8: [ skipping 8 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/edmonds_karp_max_flow.hpp:101:29: required from ‘typename boost::property_traits::value_type boost::edmonds_karp_max_flow(Graph&, typename graph_traits::vertex_descriptor, typename graph_traits::vertex_descriptor, CapacityEdgeMap, ResidualCapacityEdgeMap, ReverseEdgeMap, ColorMap, PredEdgeMap) [with Graph = adjacency_list > > > >; CapacityEdgeMap = adj_list_edge_property_map > > >, edge_capacity_t>; ResidualCapacityEdgeMap = adj_list_edge_property_map > > >, edge_residual_capacity_t>; ReverseEdgeMap = adj_list_edge_property_map, const detail::edge_desc_impl&, long unsigned int, const property > > >, edge_reverse_t>; ColorMap = iterator_property_map<__gnu_cxx::__normal_iterator >, vec_adj_list_vertex_id_map, default_color_type, default_color_type&>; PredEdgeMap = iterator_property_map<__gnu_cxx::__normal_iterator*, std::vector, std::allocator > > >, vec_adj_list_vertex_id_map, detail::edge_desc_impl, detail::edge_desc_impl&>; typename property_traits::value_type = double; typename graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/edmonds_karp_max_flow.hpp:154:41: required from ‘static typename boost::detail::edge_capacity_value::type boost::detail::edmonds_karp_dispatch2::apply(Graph&, typename boost::graph_traits::vertex_descriptor, typename boost::graph_traits::vertex_descriptor, PredMap, const boost::bgl_named_params&, boost::param_not_found) [with Graph = boost::adjacency_list > > > >; PredMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator*, std::vector, std::allocator > > >, boost::vec_adj_list_vertex_id_map, boost::detail::edge_desc_impl, boost::detail::edge_desc_impl&>; P = int; T = boost::buffer_param_t; R = boost::no_property; typename boost::detail::edge_capacity_value::type = double; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/edmonds_karp_max_flow.hpp:208:54: required from ‘static typename boost::detail::edge_capacity_value::type boost::detail::edmonds_karp_dispatch1::apply(Graph&, typename boost::graph_traits::vertex_descriptor, typename boost::graph_traits::vertex_descriptor, const boost::bgl_named_params&, boost::param_not_found) [with Graph = boost::adjacency_list > > > >; P = int; T = boost::buffer_param_t; R = boost::no_property; typename boost::detail::edge_capacity_value::type = double; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/edmonds_karp_max_flow.hpp:228:57: required from ‘typename boost::detail::edge_capacity_value::type boost::edmonds_karp_max_flow(Graph&, typename graph_traits::vertex_descriptor, typename graph_traits::vertex_descriptor, const bgl_named_params&) [with Graph = adjacency_list > > > >; P = int; T = buffer_param_t; R = no_property; typename detail::edge_capacity_value::type = double; typename graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/edmonds_karp_max_flow.hpp:240:33: required from ‘typename boost::property_traits::const_type>::value_type boost::edmonds_karp_max_flow(Graph&, typename graph_traits::vertex_descriptor, typename graph_traits::vertex_descriptor) [with Graph = adjacency_list > > > >; typename property_traits::const_type>::value_type = double; typename property_map::const_type = adj_list_edge_property_map > > >, edge_capacity_t>; typename graph_traits::vertex_descriptor = long unsigned int]’ mincut.cpp:76:45: required from here /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::Assignable > > >, boost::edge_residual_capacity_t> >, boost::keep_all, boost::filtered_graph > > > >, boost::is_residual_edge > > >, boost::edge_residual_capacity_t> >, boost::keep_all> >, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > > > >*, std::vector > > > >, std::allocator > > > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >]’ 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ^ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements > > >, boost::edge_residual_capacity_t> >, boost::keep_all, boost::filtered_graph > > > >, boost::is_residual_edge > > >, boost::edge_residual_capacity_t> >, boost::keep_all> >, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > > > >*, std::vector > > > >, std::allocator > > > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > > >]’: /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:233:5: required from ‘struct boost::EqualityComparable > > >, boost::edge_residual_capacity_t> >, boost::keep_all, boost::filtered_graph > > > >, boost::is_residual_edge > > >, boost::edge_residual_capacity_t> >, boost::keep_all> >, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > > > >*, std::vector > > > >, std::allocator > > > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:502:3: required from ‘struct boost::InputIterator > > >, boost::edge_residual_capacity_t> >, boost::keep_all, boost::filtered_graph > > > >, boost::is_residual_edge > > >, boost::edge_residual_capacity_t> >, boost::keep_all> >, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > > > >*, std::vector > > > >, std::allocator > > > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::InputIterator > > >, boost::edge_residual_capacity_t> >, boost::keep_all, boost::filtered_graph > > > >, boost::is_residual_edge > > >, boost::edge_residual_capacity_t> >, boost::keep_all> >, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > > > >*, std::vector > > > >, std::allocator > > > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied > > >, boost::edge_residual_capacity_t> >, boost::keep_all, boost::filtered_graph > > > >, boost::is_residual_edge > > >, boost::edge_residual_capacity_t> >, boost::keep_all> >, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > > > >*, std::vector > > > >, std::allocator > > > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > > >::value’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied > > >, boost::edge_residual_capacity_t> >, boost::keep_all, boost::filtered_graph > > > >, boost::is_residual_edge > > >, boost::edge_residual_capacity_t> >, boost::keep_all> >, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > > > >*, std::vector > > > >, std::allocator > > > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > > >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:72:8: [ skipping 8 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/edmonds_karp_max_flow.hpp:101:29: required from ‘typename boost::property_traits::value_type boost::edmonds_karp_max_flow(Graph&, typename graph_traits::vertex_descriptor, typename graph_traits::vertex_descriptor, CapacityEdgeMap, ResidualCapacityEdgeMap, ReverseEdgeMap, ColorMap, PredEdgeMap) [with Graph = adjacency_list > > > >; CapacityEdgeMap = adj_list_edge_property_map > > >, edge_capacity_t>; ResidualCapacityEdgeMap = adj_list_edge_property_map > > >, edge_residual_capacity_t>; ReverseEdgeMap = adj_list_edge_property_map, const detail::edge_desc_impl&, long unsigned int, const property > > >, edge_reverse_t>; ColorMap = iterator_property_map<__gnu_cxx::__normal_iterator >, vec_adj_list_vertex_id_map, default_color_type, default_color_type&>; PredEdgeMap = iterator_property_map<__gnu_cxx::__normal_iterator*, std::vector, std::allocator > > >, vec_adj_list_vertex_id_map, detail::edge_desc_impl, detail::edge_desc_impl&>; typename property_traits::value_type = double; typename graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/edmonds_karp_max_flow.hpp:154:41: required from ‘static typename boost::detail::edge_capacity_value::type boost::detail::edmonds_karp_dispatch2::apply(Graph&, typename boost::graph_traits::vertex_descriptor, typename boost::graph_traits::vertex_descriptor, PredMap, const boost::bgl_named_params&, boost::param_not_found) [with Graph = boost::adjacency_list > > > >; PredMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator*, std::vector, std::allocator > > >, boost::vec_adj_list_vertex_id_map, boost::detail::edge_desc_impl, boost::detail::edge_desc_impl&>; P = int; T = boost::buffer_param_t; R = boost::no_property; typename boost::detail::edge_capacity_value::type = double; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/edmonds_karp_max_flow.hpp:208:54: required from ‘static typename boost::detail::edge_capacity_value::type boost::detail::edmonds_karp_dispatch1::apply(Graph&, typename boost::graph_traits::vertex_descriptor, typename boost::graph_traits::vertex_descriptor, const boost::bgl_named_params&, boost::param_not_found) [with Graph = boost::adjacency_list > > > >; P = int; T = boost::buffer_param_t; R = boost::no_property; typename boost::detail::edge_capacity_value::type = double; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/edmonds_karp_max_flow.hpp:228:57: required from ‘typename boost::detail::edge_capacity_value::type boost::edmonds_karp_max_flow(Graph&, typename graph_traits::vertex_descriptor, typename graph_traits::vertex_descriptor, const bgl_named_params&) [with Graph = adjacency_list > > > >; P = int; T = buffer_param_t; R = no_property; typename detail::edge_capacity_value::type = double; typename graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/edmonds_karp_max_flow.hpp:240:33: required from ‘typename boost::property_traits::const_type>::value_type boost::edmonds_karp_max_flow(Graph&, typename graph_traits::vertex_descriptor, typename graph_traits::vertex_descriptor) [with Graph = adjacency_list > > > >; typename property_traits::const_type>::value_type = double; typename property_map::const_type = adj_list_edge_property_map > > >, edge_capacity_t>; typename graph_traits::vertex_descriptor = long unsigned int]’ mincut.cpp:76:45: required from here /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::EqualityComparable > > >, boost::edge_residual_capacity_t> >, boost::keep_all, boost::filtered_graph > > > >, boost::is_residual_edge > > >, boost::edge_residual_capacity_t> >, boost::keep_all> >, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > > > >*, std::vector > > > >, std::allocator > > > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >]’ 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ^ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements > > >, boost::edge_residual_capacity_t> >, boost::keep_all, boost::filtered_graph > > > >, boost::is_residual_edge > > >, boost::edge_residual_capacity_t> >, boost::keep_all> >, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > > > >*, std::vector > > > >, std::allocator > > > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > > >]’: /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:512:7: required from ‘struct boost::InputIterator > > >, boost::edge_residual_capacity_t> >, boost::keep_all, boost::filtered_graph > > > >, boost::is_residual_edge > > >, boost::edge_residual_capacity_t> >, boost::keep_all> >, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > > > >*, std::vector > > > >, std::allocator > > > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::InputIterator > > >, boost::edge_residual_capacity_t> >, boost::keep_all, boost::filtered_graph > > > >, boost::is_residual_edge > > >, boost::edge_residual_capacity_t> >, boost::keep_all> >, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > > > >*, std::vector > > > >, std::allocator > > > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied > > >, boost::edge_residual_capacity_t> >, boost::keep_all, boost::filtered_graph > > > >, boost::is_residual_edge > > >, boost::edge_residual_capacity_t> >, boost::keep_all> >, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > > > >*, std::vector > > > >, std::allocator > > > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > > >::value’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied > > >, boost::edge_residual_capacity_t> >, boost::keep_all, boost::filtered_graph > > > >, boost::is_residual_edge > > >, boost::edge_residual_capacity_t> >, boost::keep_all> >, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > > > >*, std::vector > > > >, std::allocator > > > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > > >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_ > > >, boost::edge_residual_capacity_t> >, boost::keep_all, boost::filtered_graph > > > >, boost::is_residual_edge > > >, boost::edge_residual_capacity_t> >, boost::keep_all> >, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > > > >*, std::vector > > > >, std::allocator > > > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >)>’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/graph_concepts.hpp:53:35: [ skipping 7 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/edmonds_karp_max_flow.hpp:101:29: required from ‘typename boost::property_traits::value_type boost::edmonds_karp_max_flow(Graph&, typename graph_traits::vertex_descriptor, typename graph_traits::vertex_descriptor, CapacityEdgeMap, ResidualCapacityEdgeMap, ReverseEdgeMap, ColorMap, PredEdgeMap) [with Graph = adjacency_list > > > >; CapacityEdgeMap = adj_list_edge_property_map > > >, edge_capacity_t>; ResidualCapacityEdgeMap = adj_list_edge_property_map > > >, edge_residual_capacity_t>; ReverseEdgeMap = adj_list_edge_property_map, const detail::edge_desc_impl&, long unsigned int, const property > > >, edge_reverse_t>; ColorMap = iterator_property_map<__gnu_cxx::__normal_iterator >, vec_adj_list_vertex_id_map, default_color_type, default_color_type&>; PredEdgeMap = iterator_property_map<__gnu_cxx::__normal_iterator*, std::vector, std::allocator > > >, vec_adj_list_vertex_id_map, detail::edge_desc_impl, detail::edge_desc_impl&>; typename property_traits::value_type = double; typename graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/edmonds_karp_max_flow.hpp:154:41: required from ‘static typename boost::detail::edge_capacity_value::type boost::detail::edmonds_karp_dispatch2::apply(Graph&, typename boost::graph_traits::vertex_descriptor, typename boost::graph_traits::vertex_descriptor, PredMap, const boost::bgl_named_params&, boost::param_not_found) [with Graph = boost::adjacency_list > > > >; PredMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator*, std::vector, std::allocator > > >, boost::vec_adj_list_vertex_id_map, boost::detail::edge_desc_impl, boost::detail::edge_desc_impl&>; P = int; T = boost::buffer_param_t; R = boost::no_property; typename boost::detail::edge_capacity_value::type = double; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/edmonds_karp_max_flow.hpp:208:54: required from ‘static typename boost::detail::edge_capacity_value::type boost::detail::edmonds_karp_dispatch1::apply(Graph&, typename boost::graph_traits::vertex_descriptor, typename boost::graph_traits::vertex_descriptor, const boost::bgl_named_params&, boost::param_not_found) [with Graph = boost::adjacency_list > > > >; P = int; T = boost::buffer_param_t; R = boost::no_property; typename boost::detail::edge_capacity_value::type = double; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/edmonds_karp_max_flow.hpp:228:57: required from ‘typename boost::detail::edge_capacity_value::type boost::edmonds_karp_max_flow(Graph&, typename graph_traits::vertex_descriptor, typename graph_traits::vertex_descriptor, const bgl_named_params&) [with Graph = adjacency_list > > > >; P = int; T = buffer_param_t; R = no_property; typename detail::edge_capacity_value::type = double; typename graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/edmonds_karp_max_flow.hpp:240:33: required from ‘typename boost::property_traits::const_type>::value_type boost::edmonds_karp_max_flow(Graph&, typename graph_traits::vertex_descriptor, typename graph_traits::vertex_descriptor) [with Graph = adjacency_list > > > >; typename property_traits::const_type>::value_type = double; typename property_map::const_type = adj_list_edge_property_map > > >, edge_capacity_t>; typename graph_traits::vertex_descriptor = long unsigned int]’ mincut.cpp:76:45: required from here /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::InputIterator > > >, boost::edge_residual_capacity_t> >, boost::keep_all, boost::filtered_graph > > > >, boost::is_residual_edge > > >, boost::edge_residual_capacity_t> >, boost::keep_all> >, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > > > >*, std::vector > > > >, std::allocator > > > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >]’ 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ^ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::InputIterator > > >, boost::edge_residual_capacity_t> >, boost::keep_all, boost::filtered_graph > > > >, boost::is_residual_edge > > >, boost::edge_residual_capacity_t> >, boost::keep_all> >, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > > > >*, std::vector > > > >, std::allocator > > > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >]’: /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/graph_concepts.hpp:53:35: required from ‘boost::concepts::MultiPassInputIterator::~MultiPassInputIterator() [with T = boost::iterators::filter_iterator > > >, boost::edge_residual_capacity_t> >, boost::keep_all, boost::filtered_graph > > > >, boost::is_residual_edge > > >, boost::edge_residual_capacity_t> >, boost::keep_all> >, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > > > >*, std::vector > > > >, std::allocator > > > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> >]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::MultiPassInputIterator > > >, boost::edge_residual_capacity_t> >, boost::keep_all, boost::filtered_graph > > > >, boost::is_residual_edge > > >, boost::edge_residual_capacity_t> >, boost::keep_all> >, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > > > >*, std::vector > > > >, std::allocator > > > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/graph_concepts.hpp:89:9: required from ‘boost::concepts::IncidenceGraph::~IncidenceGraph() [with G = boost::filtered_graph > > > >, boost::is_residual_edge > > >, boost::edge_residual_capacity_t> >, boost::keep_all>]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/graph_concepts.hpp:75:1: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::IncidenceGraphConcept > > > >, boost::is_residual_edge > > >, boost::edge_residual_capacity_t> >, boost::keep_all> >]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/breadth_first_search.hpp:62:5: required from ‘void boost::breadth_first_visit(const IncidenceGraph&, SourceIterator, SourceIterator, Buffer&, BFSVisitor, ColorMap) [with IncidenceGraph = filtered_graph > > > >, is_residual_edge > > >, edge_residual_capacity_t> >, keep_all>; Buffer = queue > >; BFSVisitor = bfs_visitor*, std::vector, std::allocator > > >, vec_adj_list_vertex_id_map, detail::edge_desc_impl, detail::edge_desc_impl&>, on_tree_edge> >; ColorMap = iterator_property_map<__gnu_cxx::__normal_iterator >, vec_adj_list_vertex_id_map, default_color_type, default_color_type&>; SourceIterator = long unsigned int*]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/breadth_first_search.hpp:136:24: [ skipping 2 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/edmonds_karp_max_flow.hpp:101:29: required from ‘typename boost::property_traits::value_type boost::edmonds_karp_max_flow(Graph&, typename graph_traits::vertex_descriptor, typename graph_traits::vertex_descriptor, CapacityEdgeMap, ResidualCapacityEdgeMap, ReverseEdgeMap, ColorMap, PredEdgeMap) [with Graph = adjacency_list > > > >; CapacityEdgeMap = adj_list_edge_property_map > > >, edge_capacity_t>; ResidualCapacityEdgeMap = adj_list_edge_property_map > > >, edge_residual_capacity_t>; ReverseEdgeMap = adj_list_edge_property_map, const detail::edge_desc_impl&, long unsigned int, const property > > >, edge_reverse_t>; ColorMap = iterator_property_map<__gnu_cxx::__normal_iterator >, vec_adj_list_vertex_id_map, default_color_type, default_color_type&>; PredEdgeMap = iterator_property_map<__gnu_cxx::__normal_iterator*, std::vector, std::allocator > > >, vec_adj_list_vertex_id_map, detail::edge_desc_impl, detail::edge_desc_impl&>; typename property_traits::value_type = double; typename graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/edmonds_karp_max_flow.hpp:154:41: required from ‘static typename boost::detail::edge_capacity_value::type boost::detail::edmonds_karp_dispatch2::apply(Graph&, typename boost::graph_traits::vertex_descriptor, typename boost::graph_traits::vertex_descriptor, PredMap, const boost::bgl_named_params&, boost::param_not_found) [with Graph = boost::adjacency_list > > > >; PredMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator*, std::vector, std::allocator > > >, boost::vec_adj_list_vertex_id_map, boost::detail::edge_desc_impl, boost::detail::edge_desc_impl&>; P = int; T = boost::buffer_param_t; R = boost::no_property; typename boost::detail::edge_capacity_value::type = double; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/edmonds_karp_max_flow.hpp:208:54: required from ‘static typename boost::detail::edge_capacity_value::type boost::detail::edmonds_karp_dispatch1::apply(Graph&, typename boost::graph_traits::vertex_descriptor, typename boost::graph_traits::vertex_descriptor, const boost::bgl_named_params&, boost::param_not_found) [with Graph = boost::adjacency_list > > > >; P = int; T = boost::buffer_param_t; R = boost::no_property; typename boost::detail::edge_capacity_value::type = double; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/edmonds_karp_max_flow.hpp:228:57: required from ‘typename boost::detail::edge_capacity_value::type boost::edmonds_karp_max_flow(Graph&, typename graph_traits::vertex_descriptor, typename graph_traits::vertex_descriptor, const bgl_named_params&) [with Graph = adjacency_list > > > >; P = int; T = buffer_param_t; R = no_property; typename detail::edge_capacity_value::type = double; typename graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/edmonds_karp_max_flow.hpp:240:33: required from ‘typename boost::property_traits::const_type>::value_type boost::edmonds_karp_max_flow(Graph&, typename graph_traits::vertex_descriptor, typename graph_traits::vertex_descriptor) [with Graph = adjacency_list > > > >; typename property_traits::const_type>::value_type = double; typename property_map::const_type = adj_list_edge_property_map > > >, edge_capacity_t>; typename graph_traits::vertex_descriptor = long unsigned int]’ mincut.cpp:76:45: required from here /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::InputIterator::~InputIterator() [with TT = boost::iterators::filter_iterator > > >, boost::edge_residual_capacity_t> >, boost::keep_all, boost::filtered_graph > > > >, boost::is_residual_edge > > >, boost::edge_residual_capacity_t> >, boost::keep_all> >, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > > > >*, std::vector > > > >, std::allocator > > > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> >]’ 37 | ~model() | ^ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:512:7: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 512 | BOOST_CONCEPT_USAGE(InputIterator) | ^~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::Convertible, std::input_iterator_tag>]’: /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements, std::input_iterator_tag> >]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:208:5: required from ‘struct boost::Convertible, std::input_iterator_tag>’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::Convertible, std::input_iterator_tag>]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied, std::input_iterator_tag> >::value’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied, std::input_iterator_tag> >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:72:8: [ skipping 7 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/breadth_first_search.hpp:62:5: required from ‘void boost::breadth_first_visit(const IncidenceGraph&, SourceIterator, SourceIterator, Buffer&, BFSVisitor, ColorMap) [with IncidenceGraph = filtered_graph > > >, no_property, listS>, is_residual_edge > > >, edge_residual_capacity_t> >, keep_all>; Buffer = queue > >; BFSVisitor = bfs_visitor*, on_tree_edge> >; ColorMap = default_color_type*; SourceIterator = long unsigned int*]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/breadth_first_search.hpp:136:24: required from ‘void boost::breadth_first_search(const VertexListGraph&, SourceIterator, SourceIterator, Buffer&, BFSVisitor, ColorMap) [with VertexListGraph = filtered_graph > > >, no_property, listS>, is_residual_edge > > >, edge_residual_capacity_t> >, keep_all>; SourceIterator = long unsigned int*; Buffer = queue > >; BFSVisitor = bfs_visitor*, on_tree_edge> >; ColorMap = default_color_type*]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/breadth_first_search.hpp:147:25: required from ‘void boost::breadth_first_search(const VertexListGraph&, typename graph_traits::vertex_descriptor, Buffer&, BFSVisitor, ColorMap) [with VertexListGraph = filtered_graph > > >, no_property, listS>, is_residual_edge > > >, edge_residual_capacity_t> >, keep_all>; Buffer = queue > >; BFSVisitor = bfs_visitor*, on_tree_edge> >; ColorMap = default_color_type*; typename graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/edmonds_karp_max_flow.hpp:101:29: required from ‘typename boost::property_traits::value_type boost::edmonds_karp_max_flow(Graph&, typename graph_traits::vertex_descriptor, typename graph_traits::vertex_descriptor, CapacityEdgeMap, ResidualCapacityEdgeMap, ReverseEdgeMap, ColorMap, PredEdgeMap) [with Graph = adjacency_list > > >, no_property, listS>; CapacityEdgeMap = adj_list_edge_property_map > > >, edge_capacity_t>; ResidualCapacityEdgeMap = adj_list_edge_property_map > > >, edge_residual_capacity_t>; ReverseEdgeMap = adj_list_edge_property_map, detail::edge_desc_impl&, long unsigned int, property > > >, edge_reverse_t>; ColorMap = default_color_type*; PredEdgeMap = detail::edge_desc_impl*; typename property_traits::value_type = long unsigned int; typename graph_traits::vertex_descriptor = long unsigned int]’ mincut.hpp:78:21: required from ‘typename boost::graph_traits::edges_size_type boost::min_cut(VertexListGraph&, OutputIterator, OutputIterator) [with VertexListGraph = R_adjacency_list; OutputIterator = std::back_insert_iterator >; typename graph_traits::edges_size_type = long unsigned int]’ mincut.cpp:128:35: required from here /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::Convertible::~Convertible() [with X = boost::iterators::detail::iterator_category_with_traversal; Y = std::input_iterator_tag]’ 37 | ~model() | ^ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:208:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 208 | BOOST_CONCEPT_USAGE(Convertible) { | ^~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::Assignable > > >, boost::edge_residual_capacity_t> >, boost::keep_all, boost::filtered_graph > > > >, boost::is_residual_edge > > >, boost::edge_residual_capacity_t> >, boost::keep_all> >, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > > > >*, std::vector > > > >, std::allocator > > > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >]’: /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements > > >, boost::edge_residual_capacity_t> >, boost::keep_all, boost::filtered_graph > > > >, boost::is_residual_edge > > >, boost::edge_residual_capacity_t> >, boost::keep_all> >, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > > > >*, std::vector > > > >, std::allocator > > > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > > >]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:145:5: required from ‘struct boost::Assignable > > >, boost::edge_residual_capacity_t> >, boost::keep_all, boost::filtered_graph > > > >, boost::is_residual_edge > > >, boost::edge_residual_capacity_t> >, boost::keep_all> >, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > > > >*, std::vector > > > >, std::allocator > > > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:502:3: required from ‘struct boost::InputIterator > > >, boost::edge_residual_capacity_t> >, boost::keep_all, boost::filtered_graph > > > >, boost::is_residual_edge > > >, boost::edge_residual_capacity_t> >, boost::keep_all> >, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > > > >*, std::vector > > > >, std::allocator > > > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::InputIterator > > >, boost::edge_residual_capacity_t> >, boost::keep_all, boost::filtered_graph > > > >, boost::is_residual_edge > > >, boost::edge_residual_capacity_t> >, boost::keep_all> >, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > > > >*, std::vector > > > >, std::allocator > > > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied > > >, boost::edge_residual_capacity_t> >, boost::keep_all, boost::filtered_graph > > > >, boost::is_residual_edge > > >, boost::edge_residual_capacity_t> >, boost::keep_all> >, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > > > >*, std::vector > > > >, std::allocator > > > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > > >::value’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:45:51: [ skipping 9 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/edmonds_karp_max_flow.hpp:101:29: required from ‘typename boost::property_traits::value_type boost::edmonds_karp_max_flow(Graph&, typename graph_traits::vertex_descriptor, typename graph_traits::vertex_descriptor, CapacityEdgeMap, ResidualCapacityEdgeMap, ReverseEdgeMap, ColorMap, PredEdgeMap) [with Graph = adjacency_list > > > >; CapacityEdgeMap = adj_list_edge_property_map > > >, edge_capacity_t>; ResidualCapacityEdgeMap = adj_list_edge_property_map > > >, edge_residual_capacity_t>; ReverseEdgeMap = adj_list_edge_property_map, const detail::edge_desc_impl&, long unsigned int, const property > > >, edge_reverse_t>; ColorMap = iterator_property_map<__gnu_cxx::__normal_iterator >, vec_adj_list_vertex_id_map, default_color_type, default_color_type&>; PredEdgeMap = iterator_property_map<__gnu_cxx::__normal_iterator*, std::vector, std::allocator > > >, vec_adj_list_vertex_id_map, detail::edge_desc_impl, detail::edge_desc_impl&>; typename property_traits::value_type = double; typename graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/edmonds_karp_max_flow.hpp:154:41: required from ‘static typename boost::detail::edge_capacity_value::type boost::detail::edmonds_karp_dispatch2::apply(Graph&, typename boost::graph_traits::vertex_descriptor, typename boost::graph_traits::vertex_descriptor, PredMap, const boost::bgl_named_params&, boost::param_not_found) [with Graph = boost::adjacency_list > > > >; PredMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator*, std::vector, std::allocator > > >, boost::vec_adj_list_vertex_id_map, boost::detail::edge_desc_impl, boost::detail::edge_desc_impl&>; P = int; T = boost::buffer_param_t; R = boost::no_property; typename boost::detail::edge_capacity_value::type = double; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/edmonds_karp_max_flow.hpp:208:54: required from ‘static typename boost::detail::edge_capacity_value::type boost::detail::edmonds_karp_dispatch1::apply(Graph&, typename boost::graph_traits::vertex_descriptor, typename boost::graph_traits::vertex_descriptor, const boost::bgl_named_params&, boost::param_not_found) [with Graph = boost::adjacency_list > > > >; P = int; T = boost::buffer_param_t; R = boost::no_property; typename boost::detail::edge_capacity_value::type = double; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/edmonds_karp_max_flow.hpp:228:57: required from ‘typename boost::detail::edge_capacity_value::type boost::edmonds_karp_max_flow(Graph&, typename graph_traits::vertex_descriptor, typename graph_traits::vertex_descriptor, const bgl_named_params&) [with Graph = adjacency_list > > > >; P = int; T = buffer_param_t; R = no_property; typename detail::edge_capacity_value::type = double; typename graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/edmonds_karp_max_flow.hpp:240:33: required from ‘typename boost::property_traits::const_type>::value_type boost::edmonds_karp_max_flow(Graph&, typename graph_traits::vertex_descriptor, typename graph_traits::vertex_descriptor) [with Graph = adjacency_list > > > >; typename property_traits::const_type>::value_type = double; typename property_map::const_type = adj_list_edge_property_map > > >, edge_capacity_t>; typename graph_traits::vertex_descriptor = long unsigned int]’ mincut.cpp:76:45: required from here /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::Assignable::~Assignable() [with TT = boost::iterators::filter_iterator > > >, boost::edge_residual_capacity_t> >, boost::keep_all, boost::filtered_graph > > > >, boost::is_residual_edge > > >, boost::edge_residual_capacity_t> >, boost::keep_all> >, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > > > >*, std::vector > > > >, std::allocator > > > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> >]’ 37 | ~model() | ^ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:145:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 145 | BOOST_CONCEPT_USAGE(Assignable) { | ^~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::EqualityComparable > > >, boost::edge_residual_capacity_t> >, boost::keep_all, boost::filtered_graph > > > >, boost::is_residual_edge > > >, boost::edge_residual_capacity_t> >, boost::keep_all> >, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > > > >*, std::vector > > > >, std::allocator > > > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >]’: /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements > > >, boost::edge_residual_capacity_t> >, boost::keep_all, boost::filtered_graph > > > >, boost::is_residual_edge > > >, boost::edge_residual_capacity_t> >, boost::keep_all> >, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > > > >*, std::vector > > > >, std::allocator > > > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > > >]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:233:5: required from ‘struct boost::EqualityComparable > > >, boost::edge_residual_capacity_t> >, boost::keep_all, boost::filtered_graph > > > >, boost::is_residual_edge > > >, boost::edge_residual_capacity_t> >, boost::keep_all> >, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > > > >*, std::vector > > > >, std::allocator > > > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:502:3: required from ‘struct boost::InputIterator > > >, boost::edge_residual_capacity_t> >, boost::keep_all, boost::filtered_graph > > > >, boost::is_residual_edge > > >, boost::edge_residual_capacity_t> >, boost::keep_all> >, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > > > >*, std::vector > > > >, std::allocator > > > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::InputIterator > > >, boost::edge_residual_capacity_t> >, boost::keep_all, boost::filtered_graph > > > >, boost::is_residual_edge > > >, boost::edge_residual_capacity_t> >, boost::keep_all> >, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > > > >*, std::vector > > > >, std::allocator > > > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied > > >, boost::edge_residual_capacity_t> >, boost::keep_all, boost::filtered_graph > > > >, boost::is_residual_edge > > >, boost::edge_residual_capacity_t> >, boost::keep_all> >, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > > > >*, std::vector > > > >, std::allocator > > > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > > >::value’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:45:51: [ skipping 9 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/edmonds_karp_max_flow.hpp:101:29: required from ‘typename boost::property_traits::value_type boost::edmonds_karp_max_flow(Graph&, typename graph_traits::vertex_descriptor, typename graph_traits::vertex_descriptor, CapacityEdgeMap, ResidualCapacityEdgeMap, ReverseEdgeMap, ColorMap, PredEdgeMap) [with Graph = adjacency_list > > > >; CapacityEdgeMap = adj_list_edge_property_map > > >, edge_capacity_t>; ResidualCapacityEdgeMap = adj_list_edge_property_map > > >, edge_residual_capacity_t>; ReverseEdgeMap = adj_list_edge_property_map, const detail::edge_desc_impl&, long unsigned int, const property > > >, edge_reverse_t>; ColorMap = iterator_property_map<__gnu_cxx::__normal_iterator >, vec_adj_list_vertex_id_map, default_color_type, default_color_type&>; PredEdgeMap = iterator_property_map<__gnu_cxx::__normal_iterator*, std::vector, std::allocator > > >, vec_adj_list_vertex_id_map, detail::edge_desc_impl, detail::edge_desc_impl&>; typename property_traits::value_type = double; typename graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/edmonds_karp_max_flow.hpp:154:41: required from ‘static typename boost::detail::edge_capacity_value::type boost::detail::edmonds_karp_dispatch2::apply(Graph&, typename boost::graph_traits::vertex_descriptor, typename boost::graph_traits::vertex_descriptor, PredMap, const boost::bgl_named_params&, boost::param_not_found) [with Graph = boost::adjacency_list > > > >; PredMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator*, std::vector, std::allocator > > >, boost::vec_adj_list_vertex_id_map, boost::detail::edge_desc_impl, boost::detail::edge_desc_impl&>; P = int; T = boost::buffer_param_t; R = boost::no_property; typename boost::detail::edge_capacity_value::type = double; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/edmonds_karp_max_flow.hpp:208:54: required from ‘static typename boost::detail::edge_capacity_value::type boost::detail::edmonds_karp_dispatch1::apply(Graph&, typename boost::graph_traits::vertex_descriptor, typename boost::graph_traits::vertex_descriptor, const boost::bgl_named_params&, boost::param_not_found) [with Graph = boost::adjacency_list > > > >; P = int; T = boost::buffer_param_t; R = boost::no_property; typename boost::detail::edge_capacity_value::type = double; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/edmonds_karp_max_flow.hpp:228:57: required from ‘typename boost::detail::edge_capacity_value::type boost::edmonds_karp_max_flow(Graph&, typename graph_traits::vertex_descriptor, typename graph_traits::vertex_descriptor, const bgl_named_params&) [with Graph = adjacency_list > > > >; P = int; T = buffer_param_t; R = no_property; typename detail::edge_capacity_value::type = double; typename graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/edmonds_karp_max_flow.hpp:240:33: required from ‘typename boost::property_traits::const_type>::value_type boost::edmonds_karp_max_flow(Graph&, typename graph_traits::vertex_descriptor, typename graph_traits::vertex_descriptor) [with Graph = adjacency_list > > > >; typename property_traits::const_type>::value_type = double; typename property_map::const_type = adj_list_edge_property_map > > >, edge_capacity_t>; typename graph_traits::vertex_descriptor = long unsigned int]’ mincut.cpp:76:45: required from here /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::EqualityComparable::~EqualityComparable() [with TT = boost::iterators::filter_iterator > > >, boost::edge_residual_capacity_t> >, boost::keep_all, boost::filtered_graph > > > >, boost::is_residual_edge > > >, boost::edge_residual_capacity_t> >, boost::keep_all> >, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > > > >*, std::vector > > > >, std::allocator > > > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> >]’ 37 | ~model() | ^ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:233:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 233 | BOOST_CONCEPT_USAGE(EqualityComparable) { | ^~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::InputIterator > > >, boost::edge_residual_capacity_t> >, boost::keep_all, boost::filtered_graph > > > >, boost::is_residual_edge > > >, boost::edge_residual_capacity_t> >, boost::keep_all> >, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > > > >*, std::vector > > > >, std::allocator > > > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >]’: /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements > > >, boost::edge_residual_capacity_t> >, boost::keep_all, boost::filtered_graph > > > >, boost::is_residual_edge > > >, boost::edge_residual_capacity_t> >, boost::keep_all> >, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > > > >*, std::vector > > > >, std::allocator > > > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > > >]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:512:7: required from ‘struct boost::InputIterator > > >, boost::edge_residual_capacity_t> >, boost::keep_all, boost::filtered_graph > > > >, boost::is_residual_edge > > >, boost::edge_residual_capacity_t> >, boost::keep_all> >, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > > > >*, std::vector > > > >, std::allocator > > > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::InputIterator > > >, boost::edge_residual_capacity_t> >, boost::keep_all, boost::filtered_graph > > > >, boost::is_residual_edge > > >, boost::edge_residual_capacity_t> >, boost::keep_all> >, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > > > >*, std::vector > > > >, std::allocator > > > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied > > >, boost::edge_residual_capacity_t> >, boost::keep_all, boost::filtered_graph > > > >, boost::is_residual_edge > > >, boost::edge_residual_capacity_t> >, boost::keep_all> >, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > > > >*, std::vector > > > >, std::allocator > > > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > > >::value’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied > > >, boost::edge_residual_capacity_t> >, boost::keep_all, boost::filtered_graph > > > >, boost::is_residual_edge > > >, boost::edge_residual_capacity_t> >, boost::keep_all> >, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > > > >*, std::vector > > > >, std::allocator > > > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > > >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:72:8: [ skipping 8 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/edmonds_karp_max_flow.hpp:101:29: required from ‘typename boost::property_traits::value_type boost::edmonds_karp_max_flow(Graph&, typename graph_traits::vertex_descriptor, typename graph_traits::vertex_descriptor, CapacityEdgeMap, ResidualCapacityEdgeMap, ReverseEdgeMap, ColorMap, PredEdgeMap) [with Graph = adjacency_list > > > >; CapacityEdgeMap = adj_list_edge_property_map > > >, edge_capacity_t>; ResidualCapacityEdgeMap = adj_list_edge_property_map > > >, edge_residual_capacity_t>; ReverseEdgeMap = adj_list_edge_property_map, const detail::edge_desc_impl&, long unsigned int, const property > > >, edge_reverse_t>; ColorMap = iterator_property_map<__gnu_cxx::__normal_iterator >, vec_adj_list_vertex_id_map, default_color_type, default_color_type&>; PredEdgeMap = iterator_property_map<__gnu_cxx::__normal_iterator*, std::vector, std::allocator > > >, vec_adj_list_vertex_id_map, detail::edge_desc_impl, detail::edge_desc_impl&>; typename property_traits::value_type = double; typename graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/edmonds_karp_max_flow.hpp:154:41: required from ‘static typename boost::detail::edge_capacity_value::type boost::detail::edmonds_karp_dispatch2::apply(Graph&, typename boost::graph_traits::vertex_descriptor, typename boost::graph_traits::vertex_descriptor, PredMap, const boost::bgl_named_params&, boost::param_not_found) [with Graph = boost::adjacency_list > > > >; PredMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator*, std::vector, std::allocator > > >, boost::vec_adj_list_vertex_id_map, boost::detail::edge_desc_impl, boost::detail::edge_desc_impl&>; P = int; T = boost::buffer_param_t; R = boost::no_property; typename boost::detail::edge_capacity_value::type = double; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/edmonds_karp_max_flow.hpp:208:54: required from ‘static typename boost::detail::edge_capacity_value::type boost::detail::edmonds_karp_dispatch1::apply(Graph&, typename boost::graph_traits::vertex_descriptor, typename boost::graph_traits::vertex_descriptor, const boost::bgl_named_params&, boost::param_not_found) [with Graph = boost::adjacency_list > > > >; P = int; T = boost::buffer_param_t; R = boost::no_property; typename boost::detail::edge_capacity_value::type = double; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/edmonds_karp_max_flow.hpp:228:57: required from ‘typename boost::detail::edge_capacity_value::type boost::edmonds_karp_max_flow(Graph&, typename graph_traits::vertex_descriptor, typename graph_traits::vertex_descriptor, const bgl_named_params&) [with Graph = adjacency_list > > > >; P = int; T = buffer_param_t; R = no_property; typename detail::edge_capacity_value::type = double; typename graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/edmonds_karp_max_flow.hpp:240:33: required from ‘typename boost::property_traits::const_type>::value_type boost::edmonds_karp_max_flow(Graph&, typename graph_traits::vertex_descriptor, typename graph_traits::vertex_descriptor) [with Graph = adjacency_list > > > >; typename property_traits::const_type>::value_type = double; typename property_map::const_type = adj_list_edge_property_map > > >, edge_capacity_t>; typename graph_traits::vertex_descriptor = long unsigned int]’ mincut.cpp:76:45: required from here /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::InputIterator::~InputIterator() [with TT = boost::iterators::filter_iterator > > >, boost::edge_residual_capacity_t> >, boost::keep_all, boost::filtered_graph > > > >, boost::is_residual_edge > > >, boost::edge_residual_capacity_t> >, boost::keep_all> >, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > > > >*, std::vector > > > >, std::allocator > > > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> >]’ 37 | ~model() | ^ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:512:7: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 512 | BOOST_CONCEPT_USAGE(InputIterator) | ^~~~~~~~~~~~~~~~~~~ g++ -std=gnu++17 -I"/usr/share/R/include" -DNDEBUG -I'/home/omnipath/local/R/4.4-3.20/BH/include' -fpic -g -O2 -fno-omit-frame-pointer -mno-omit-leaf-frame-pointer -ffile-prefix-map=/build/r-base-EawLoD/r-base-4.4.1=. -fstack-protector-strong -fstack-clash-protection -Wformat -Werror=format-security -fcf-protection -fdebug-prefix-map=/build/r-base-EawLoD/r-base-4.4.1=/usr/src/r-base-4.4.1-1.2404.0 -Wdate-time -D_FORTIFY_SOURCE=3 -c ordering.cpp -o ordering.o In file included from /home/omnipath/local/R/4.4-3.20/BH/include/boost/smart_ptr/shared_ptr.hpp:18, from /home/omnipath/local/R/4.4-3.20/BH/include/boost/property_map/vector_property_map.hpp:14, from /home/omnipath/local/R/4.4-3.20/BH/include/boost/property_map/property_map.hpp:598, from RBGL.hpp:17, from ordering.cpp:1: /home/omnipath/local/R/4.4-3.20/BH/include/boost/smart_ptr/detail/shared_count.hpp:361:33: warning: ‘template class std::auto_ptr’ is deprecated: use 'std::unique_ptr' instead [-Wdeprecated-declarations] 361 | explicit shared_count( std::auto_ptr & r ): pi_( new sp_counted_impl_p( r.get() ) ) | ^~~~~~~~ In file included from /usr/include/c++/13/memory:78, from /home/omnipath/local/R/4.4-3.20/BH/include/boost/smart_ptr/detail/sp_counted_impl.hpp:35, from /home/omnipath/local/R/4.4-3.20/BH/include/boost/smart_ptr/detail/shared_count.hpp:27: /usr/include/c++/13/bits/unique_ptr.h:65:28: note: declared here 65 | template class auto_ptr; | ^~~~~~~~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/smart_ptr/shared_ptr.hpp:251:65: warning: ‘template class std::auto_ptr’ is deprecated: use 'std::unique_ptr' instead [-Wdeprecated-declarations] 251 | template< class T, class R > struct sp_enable_if_auto_ptr< std::auto_ptr< T >, R > | ^~~~~~~~ /usr/include/c++/13/bits/unique_ptr.h:65:28: note: declared here 65 | template class auto_ptr; | ^~~~~~~~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/smart_ptr/shared_ptr.hpp:508:31: warning: ‘template class std::auto_ptr’ is deprecated: use 'std::unique_ptr' instead [-Wdeprecated-declarations] 508 | explicit shared_ptr( std::auto_ptr & r ): px(r.get()), pn() | ^~~~~~~~ /usr/include/c++/13/bits/unique_ptr.h:65:28: note: declared here 65 | template class auto_ptr; | ^~~~~~~~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/smart_ptr/shared_ptr.hpp:521:22: warning: ‘template class std::auto_ptr’ is deprecated: use 'std::unique_ptr' instead [-Wdeprecated-declarations] 521 | shared_ptr( std::auto_ptr && r ): px(r.get()), pn() | ^~~~~~~~ /usr/include/c++/13/bits/unique_ptr.h:65:28: note: declared here 65 | template class auto_ptr; | ^~~~~~~~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/smart_ptr/shared_ptr.hpp:604:34: warning: ‘template class std::auto_ptr’ is deprecated: use 'std::unique_ptr' instead [-Wdeprecated-declarations] 604 | shared_ptr & operator=( std::auto_ptr & r ) | ^~~~~~~~ /usr/include/c++/13/bits/unique_ptr.h:65:28: note: declared here 65 | template class auto_ptr; | ^~~~~~~~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/smart_ptr/shared_ptr.hpp:613:34: warning: ‘template class std::auto_ptr’ is deprecated: use 'std::unique_ptr' instead [-Wdeprecated-declarations] 613 | shared_ptr & operator=( std::auto_ptr && r ) | ^~~~~~~~ /usr/include/c++/13/bits/unique_ptr.h:65:28: note: declared here 65 | template class auto_ptr; | ^~~~~~~~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/smart_ptr/shared_ptr.hpp: In member function ‘boost::shared_ptr& boost::shared_ptr::operator=(std::auto_ptr<_Up>&&)’: /home/omnipath/local/R/4.4-3.20/BH/include/boost/smart_ptr/shared_ptr.hpp:615:38: warning: ‘template class std::auto_ptr’ is deprecated: use 'std::unique_ptr' instead [-Wdeprecated-declarations] 615 | this_type( static_cast< std::auto_ptr && >( r ) ).swap( *this ); | ^~~~~~~~ /usr/include/c++/13/bits/unique_ptr.h:65:28: note: declared here 65 | template class auto_ptr; | ^~~~~~~~ In file included from /home/omnipath/local/R/4.4-3.20/BH/include/boost/scoped_ptr.hpp:13, from /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/adjacency_list.hpp:22, from RBGL.hpp:38: /home/omnipath/local/R/4.4-3.20/BH/include/boost/smart_ptr/scoped_ptr.hpp: At global scope: /home/omnipath/local/R/4.4-3.20/BH/include/boost/smart_ptr/scoped_ptr.hpp:75:31: warning: ‘template class std::auto_ptr’ is deprecated: use 'std::unique_ptr' instead [-Wdeprecated-declarations] 75 | explicit scoped_ptr( std::auto_ptr p ) BOOST_SP_NOEXCEPT : px( p.release() ) | ^~~~~~~~ /usr/include/c++/13/bits/unique_ptr.h:65:28: note: declared here 65 | template class auto_ptr; | ^~~~~~~~ In file included from /home/omnipath/local/R/4.4-3.20/BH/include/boost/bind/mem_fn.hpp:25, from /home/omnipath/local/R/4.4-3.20/BH/include/boost/bind/bind.hpp:26, from /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/king_ordering.hpp:18, from ordering.cpp:9: /home/omnipath/local/R/4.4-3.20/BH/include/boost/get_pointer.hpp:48:40: warning: ‘template class std::auto_ptr’ is deprecated: use 'std::unique_ptr' instead [-Wdeprecated-declarations] 48 | template T * get_pointer(std::auto_ptr const& p) | ^~~~~~~~ /usr/include/c++/13/bits/unique_ptr.h:65:28: note: declared here 65 | template class auto_ptr; | ^~~~~~~~ In file included from /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/assert.hpp:35, from /home/omnipath/local/R/4.4-3.20/BH/include/boost/property_map/property_map.hpp:19: /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements > > >]’: /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:145:5: required from ‘struct boost::Assignable<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:502:3: required from ‘struct boost::InputIterator<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:540:3: required from ‘struct boost::ForwardIterator<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:568:3: required from ‘struct boost::BidirectionalIterator<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:597:3: [ skipping 2 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator > >]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied > > >::value’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied > > >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_ > >)>’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/property_map/property_map.hpp:354:5: required from ‘boost::iterator_property_map boost::make_iterator_property_map(RAIter, ID, Value) [with RAIter = __gnu_cxx::__normal_iterator >; Value = void*; ID = adj_list_vertex_property_map >, int, int&, vertex_index_t>]’ ordering.cpp:69:31: required from here /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ In file included from /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:31, from /home/omnipath/local/R/4.4-3.20/BH/include/boost/property_map/property_map.hpp:20: /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::Assignable<__gnu_cxx::__normal_iterator > >]’ 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ^ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements > > >]’: /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:233:5: required from ‘struct boost::EqualityComparable<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:502:3: required from ‘struct boost::InputIterator<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:540:3: required from ‘struct boost::ForwardIterator<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:568:3: required from ‘struct boost::BidirectionalIterator<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:597:3: [ skipping 2 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator > >]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied > > >::value’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied > > >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_ > >)>’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/property_map/property_map.hpp:354:5: required from ‘boost::iterator_property_map boost::make_iterator_property_map(RAIter, ID, Value) [with RAIter = __gnu_cxx::__normal_iterator >; Value = void*; ID = adj_list_vertex_property_map >, int, int&, vertex_index_t>]’ ordering.cpp:69:31: required from here /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::EqualityComparable<__gnu_cxx::__normal_iterator > >]’ 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ^ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements > > >]’: /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:512:7: required from ‘struct boost::InputIterator<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:540:3: required from ‘struct boost::ForwardIterator<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:568:3: required from ‘struct boost::BidirectionalIterator<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:597:3: required from ‘struct boost::RandomAccessIterator<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:597:3: required from ‘struct boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator > >]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied > > >::value’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied > > >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_ > >)>’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/property_map/property_map.hpp:354:5: required from ‘boost::iterator_property_map boost::make_iterator_property_map(RAIter, ID, Value) [with RAIter = __gnu_cxx::__normal_iterator >; Value = void*; ID = adj_list_vertex_property_map >, int, int&, vertex_index_t>]’ ordering.cpp:69:31: required from here /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::InputIterator<__gnu_cxx::__normal_iterator > >]’ 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ^ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements > > >]’: /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:543:7: required from ‘struct boost::ForwardIterator<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:568:3: required from ‘struct boost::BidirectionalIterator<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:597:3: required from ‘struct boost::RandomAccessIterator<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:597:3: required from ‘struct boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator > >]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied > > >::value’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied > > >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_ > >)>’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/property_map/property_map.hpp:354:5: required from ‘boost::iterator_property_map boost::make_iterator_property_map(RAIter, ID, Value) [with RAIter = __gnu_cxx::__normal_iterator >; Value = void*; ID = adj_list_vertex_property_map >, int, int&, vertex_index_t>]’ ordering.cpp:69:31: required from here /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::ForwardIterator<__gnu_cxx::__normal_iterator > >]’ 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ^ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements > > >]’: /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:571:7: required from ‘struct boost::BidirectionalIterator<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:597:3: required from ‘struct boost::RandomAccessIterator<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:597:3: required from ‘struct boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator > >]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied > > >::value’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied > > >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_ > >)>’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/property_map/property_map.hpp:354:5: required from ‘boost::iterator_property_map boost::make_iterator_property_map(RAIter, ID, Value) [with RAIter = __gnu_cxx::__normal_iterator >; Value = void*; ID = adj_list_vertex_property_map >, int, int&, vertex_index_t>]’ ordering.cpp:69:31: required from here /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::BidirectionalIterator<__gnu_cxx::__normal_iterator > >]’ 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ^ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements > > >]’: /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:253:5: required from ‘struct boost::Comparable<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:597:3: required from ‘struct boost::RandomAccessIterator<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:597:3: required from ‘struct boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator > >]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied > > >::value’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied > > >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_ > >)>’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/property_map/property_map.hpp:354:5: required from ‘boost::iterator_property_map boost::make_iterator_property_map(RAIter, ID, Value) [with RAIter = __gnu_cxx::__normal_iterator >; Value = void*; ID = adj_list_vertex_property_map >, int, int&, vertex_index_t>]’ ordering.cpp:69:31: required from here /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::Comparable<__gnu_cxx::__normal_iterator > >]’ 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ^ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements > > >]’: /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:601:7: required from ‘struct boost::RandomAccessIterator<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:597:3: required from ‘struct boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator > >]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied > > >::value’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied > > >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_ > >)>’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/property_map/property_map.hpp:354:5: required from ‘boost::iterator_property_map boost::make_iterator_property_map(RAIter, ID, Value) [with RAIter = __gnu_cxx::__normal_iterator >; Value = void*; ID = adj_list_vertex_property_map >, int, int&, vertex_index_t>]’ ordering.cpp:69:31: required from here /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::RandomAccessIterator<__gnu_cxx::__normal_iterator > >]’ 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ^ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator > >]’: /home/omnipath/local/R/4.4-3.20/BH/include/boost/property_map/property_map.hpp:354:5: required from ‘boost::iterator_property_map boost::make_iterator_property_map(RAIter, ID, Value) [with RAIter = __gnu_cxx::__normal_iterator >; Value = void*; ID = adj_list_vertex_property_map >, int, int&, vertex_index_t>]’ ordering.cpp:69:31: required from here /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ In file included from /home/omnipath/local/R/4.4-3.20/BH/include/boost/preprocessor/repetition/enum_binary_params.hpp:15, from /home/omnipath/local/R/4.4-3.20/BH/include/boost/utility/base_from_member.hpp:15, from /home/omnipath/local/R/4.4-3.20/BH/include/boost/utility.hpp:15, from RBGL.hpp:16: /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:597:17: note: in a call to non-static member function ‘boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator > >::~RandomAccessIteratorConcept()’ 597 | BOOST_concept(RandomAccessIterator,(TT)) | ^~~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/preprocessor/cat.hpp:29:34: note: in definition of macro ‘BOOST_PP_CAT_I’ 29 | # define BOOST_PP_CAT_I(a, b) a ## b | ^ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/concept_def.hpp:23:12: note: in expansion of macro ‘BOOST_PP_CAT’ 23 | struct BOOST_PP_CAT(name,Concept) \ | ^~~~~~~~~~~~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:597:3: note: in expansion of macro ‘BOOST_concept’ 597 | BOOST_concept(RandomAccessIterator,(TT)) | ^~~~~~~~~~~~~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements >]’: /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:145:5: required from ‘struct boost::Assignable’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:502:3: required from ‘struct boost::InputIterator’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:540:3: required from ‘struct boost::ForwardIterator’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:568:3: required from ‘struct boost::BidirectionalIterator’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:597:3: [ skipping 2 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::RandomAccessIteratorConcept]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied >::value’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_)>’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/property_map/property_map.hpp:354:5: required from ‘boost::iterator_property_map boost::make_iterator_property_map(RAIter, ID, Value) [with RAIter = long unsigned int*; Value = long unsigned int; ID = vec_adj_list_vertex_id_map, long unsigned int>]’ ordering.cpp:116:60: required from here /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::Assignable]’ 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ^ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements >]’: /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:233:5: required from ‘struct boost::EqualityComparable’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:502:3: required from ‘struct boost::InputIterator’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:540:3: required from ‘struct boost::ForwardIterator’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:568:3: required from ‘struct boost::BidirectionalIterator’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:597:3: [ skipping 2 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::RandomAccessIteratorConcept]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied >::value’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_)>’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/property_map/property_map.hpp:354:5: required from ‘boost::iterator_property_map boost::make_iterator_property_map(RAIter, ID, Value) [with RAIter = long unsigned int*; Value = long unsigned int; ID = vec_adj_list_vertex_id_map, long unsigned int>]’ ordering.cpp:116:60: required from here /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::EqualityComparable]’ 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ^ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements >]’: /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:512:7: required from ‘struct boost::InputIterator’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:540:3: required from ‘struct boost::ForwardIterator’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:568:3: required from ‘struct boost::BidirectionalIterator’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:597:3: required from ‘struct boost::RandomAccessIterator’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:597:3: required from ‘struct boost::RandomAccessIteratorConcept’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::RandomAccessIteratorConcept]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied >::value’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_)>’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/property_map/property_map.hpp:354:5: required from ‘boost::iterator_property_map boost::make_iterator_property_map(RAIter, ID, Value) [with RAIter = long unsigned int*; Value = long unsigned int; ID = vec_adj_list_vertex_id_map, long unsigned int>]’ ordering.cpp:116:60: required from here /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::InputIterator]’ 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ^ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements >]’: /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:543:7: required from ‘struct boost::ForwardIterator’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:568:3: required from ‘struct boost::BidirectionalIterator’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:597:3: required from ‘struct boost::RandomAccessIterator’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:597:3: required from ‘struct boost::RandomAccessIteratorConcept’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::RandomAccessIteratorConcept]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied >::value’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_)>’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/property_map/property_map.hpp:354:5: required from ‘boost::iterator_property_map boost::make_iterator_property_map(RAIter, ID, Value) [with RAIter = long unsigned int*; Value = long unsigned int; ID = vec_adj_list_vertex_id_map, long unsigned int>]’ ordering.cpp:116:60: required from here /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::ForwardIterator]’ 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ^ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements >]’: /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:571:7: required from ‘struct boost::BidirectionalIterator’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:597:3: required from ‘struct boost::RandomAccessIterator’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:597:3: required from ‘struct boost::RandomAccessIteratorConcept’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::RandomAccessIteratorConcept]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied >::value’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_)>’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/property_map/property_map.hpp:354:5: required from ‘boost::iterator_property_map boost::make_iterator_property_map(RAIter, ID, Value) [with RAIter = long unsigned int*; Value = long unsigned int; ID = vec_adj_list_vertex_id_map, long unsigned int>]’ ordering.cpp:116:60: required from here /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::BidirectionalIterator]’ 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ^ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements >]’: /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:253:5: required from ‘struct boost::Comparable’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:597:3: required from ‘struct boost::RandomAccessIterator’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:597:3: required from ‘struct boost::RandomAccessIteratorConcept’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::RandomAccessIteratorConcept]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied >::value’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_)>’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/property_map/property_map.hpp:354:5: required from ‘boost::iterator_property_map boost::make_iterator_property_map(RAIter, ID, Value) [with RAIter = long unsigned int*; Value = long unsigned int; ID = vec_adj_list_vertex_id_map, long unsigned int>]’ ordering.cpp:116:60: required from here /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::Comparable]’ 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ^ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements >]’: /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:601:7: required from ‘struct boost::RandomAccessIterator’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:597:3: required from ‘struct boost::RandomAccessIteratorConcept’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::RandomAccessIteratorConcept]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied >::value’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_)>’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/property_map/property_map.hpp:354:5: required from ‘boost::iterator_property_map boost::make_iterator_property_map(RAIter, ID, Value) [with RAIter = long unsigned int*; Value = long unsigned int; ID = vec_adj_list_vertex_id_map, long unsigned int>]’ ordering.cpp:116:60: required from here /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::RandomAccessIterator]’ 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ^ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::RandomAccessIteratorConcept]’: /home/omnipath/local/R/4.4-3.20/BH/include/boost/property_map/property_map.hpp:354:5: required from ‘boost::iterator_property_map boost::make_iterator_property_map(RAIter, ID, Value) [with RAIter = long unsigned int*; Value = long unsigned int; ID = vec_adj_list_vertex_id_map, long unsigned int>]’ ordering.cpp:116:60: required from here /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:597:17: note: in a call to non-static member function ‘boost::RandomAccessIteratorConcept::~RandomAccessIteratorConcept()’ 597 | BOOST_concept(RandomAccessIterator,(TT)) | ^~~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/preprocessor/cat.hpp:29:34: note: in definition of macro ‘BOOST_PP_CAT_I’ 29 | # define BOOST_PP_CAT_I(a, b) a ## b | ^ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/concept_def.hpp:23:12: note: in expansion of macro ‘BOOST_PP_CAT’ 23 | struct BOOST_PP_CAT(name,Concept) \ | ^~~~~~~~~~~~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:597:3: note: in expansion of macro ‘BOOST_concept’ 597 | BOOST_concept(RandomAccessIterator,(TT)) | ^~~~~~~~~~~~~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements >]’: /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:145:5: required from ‘struct boost::Assignable’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:502:3: required from ‘struct boost::InputIterator’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:540:3: required from ‘struct boost::ForwardIterator’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:568:3: required from ‘struct boost::BidirectionalIterator’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:597:3: [ skipping 2 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::RandomAccessIteratorConcept]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied >::value’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_)>’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/property_map/property_map.hpp:354:5: required from ‘boost::iterator_property_map boost::make_iterator_property_map(RAIter, ID, Value) [with RAIter = int*; Value = int; ID = vec_adj_list_vertex_id_map, long unsigned int>]’ ordering.cpp:142:30: required from here /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::Assignable]’ 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ^ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements >]’: /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:233:5: required from ‘struct boost::EqualityComparable’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:502:3: required from ‘struct boost::InputIterator’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:540:3: required from ‘struct boost::ForwardIterator’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:568:3: required from ‘struct boost::BidirectionalIterator’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:597:3: [ skipping 2 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::RandomAccessIteratorConcept]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied >::value’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_)>’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/property_map/property_map.hpp:354:5: required from ‘boost::iterator_property_map boost::make_iterator_property_map(RAIter, ID, Value) [with RAIter = int*; Value = int; ID = vec_adj_list_vertex_id_map, long unsigned int>]’ ordering.cpp:142:30: required from here /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::EqualityComparable]’ 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ^ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements >]’: /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:512:7: required from ‘struct boost::InputIterator’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:540:3: required from ‘struct boost::ForwardIterator’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:568:3: required from ‘struct boost::BidirectionalIterator’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:597:3: required from ‘struct boost::RandomAccessIterator’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:597:3: required from ‘struct boost::RandomAccessIteratorConcept’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::RandomAccessIteratorConcept]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied >::value’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_)>’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/property_map/property_map.hpp:354:5: required from ‘boost::iterator_property_map boost::make_iterator_property_map(RAIter, ID, Value) [with RAIter = int*; Value = int; ID = vec_adj_list_vertex_id_map, long unsigned int>]’ ordering.cpp:142:30: required from here /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::InputIterator]’ 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ^ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements >]’: /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:543:7: required from ‘struct boost::ForwardIterator’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:568:3: required from ‘struct boost::BidirectionalIterator’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:597:3: required from ‘struct boost::RandomAccessIterator’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:597:3: required from ‘struct boost::RandomAccessIteratorConcept’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::RandomAccessIteratorConcept]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied >::value’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_)>’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/property_map/property_map.hpp:354:5: required from ‘boost::iterator_property_map boost::make_iterator_property_map(RAIter, ID, Value) [with RAIter = int*; Value = int; ID = vec_adj_list_vertex_id_map, long unsigned int>]’ ordering.cpp:142:30: required from here /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::ForwardIterator]’ 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ^ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements >]’: /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:571:7: required from ‘struct boost::BidirectionalIterator’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:597:3: required from ‘struct boost::RandomAccessIterator’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:597:3: required from ‘struct boost::RandomAccessIteratorConcept’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::RandomAccessIteratorConcept]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied >::value’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_)>’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/property_map/property_map.hpp:354:5: required from ‘boost::iterator_property_map boost::make_iterator_property_map(RAIter, ID, Value) [with RAIter = int*; Value = int; ID = vec_adj_list_vertex_id_map, long unsigned int>]’ ordering.cpp:142:30: required from here /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::BidirectionalIterator]’ 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ^ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements >]’: /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:253:5: required from ‘struct boost::Comparable’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:597:3: required from ‘struct boost::RandomAccessIterator’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:597:3: required from ‘struct boost::RandomAccessIteratorConcept’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::RandomAccessIteratorConcept]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied >::value’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_)>’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/property_map/property_map.hpp:354:5: required from ‘boost::iterator_property_map boost::make_iterator_property_map(RAIter, ID, Value) [with RAIter = int*; Value = int; ID = vec_adj_list_vertex_id_map, long unsigned int>]’ ordering.cpp:142:30: required from here /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::Comparable]’ 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ^ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements >]’: /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:601:7: required from ‘struct boost::RandomAccessIterator’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:597:3: required from ‘struct boost::RandomAccessIteratorConcept’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::RandomAccessIteratorConcept]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied >::value’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_)>’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/property_map/property_map.hpp:354:5: required from ‘boost::iterator_property_map boost::make_iterator_property_map(RAIter, ID, Value) [with RAIter = int*; Value = int; ID = vec_adj_list_vertex_id_map, long unsigned int>]’ ordering.cpp:142:30: required from here /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::RandomAccessIterator]’ 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ^ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::RandomAccessIteratorConcept]’: /home/omnipath/local/R/4.4-3.20/BH/include/boost/property_map/property_map.hpp:354:5: required from ‘boost::iterator_property_map boost::make_iterator_property_map(RAIter, ID, Value) [with RAIter = int*; Value = int; ID = vec_adj_list_vertex_id_map, long unsigned int>]’ ordering.cpp:142:30: required from here /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:597:17: note: in a call to non-static member function ‘boost::RandomAccessIteratorConcept::~RandomAccessIteratorConcept()’ 597 | BOOST_concept(RandomAccessIterator,(TT)) | ^~~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/preprocessor/cat.hpp:29:34: note: in definition of macro ‘BOOST_PP_CAT_I’ 29 | # define BOOST_PP_CAT_I(a, b) a ## b | ^ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/concept_def.hpp:23:12: note: in expansion of macro ‘BOOST_PP_CAT’ 23 | struct BOOST_PP_CAT(name,Concept) \ | ^~~~~~~~~~~~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:597:3: note: in expansion of macro ‘BOOST_concept’ 597 | BOOST_concept(RandomAccessIterator,(TT)) | ^~~~~~~~~~~~~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::constraint::failed() [with Model = boost::ReadablePropertyMapConcept, long unsigned int>, long unsigned int>]’: /home/omnipath/local/R/4.4-3.20/BH/include/boost/pending/bucket_sorter.hpp:32:5: required from ‘class boost::bucket_sorter, long unsigned int>, int, int&>, boost::vec_adj_list_vertex_id_map, long unsigned int> >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/minimum_degree_ordering.hpp:336:21: required from ‘class boost::detail::mmd_impl, boost::iterator_property_map, long unsigned int>, int, int&>, int*, int*, boost::iterator_property_map, long unsigned int>, int, int&>, boost::vec_adj_list_vertex_id_map, long unsigned int> >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/minimum_degree_ordering.hpp:752:9: required from ‘void boost::minimum_degree_ordering(Graph&, DegreeMap, InversePermutationMap, PermutationMap, SuperNodeMap, int, VertexIndexMap) [with Graph = R_adjacency_list; DegreeMap = iterator_property_map, long unsigned int>, int, int&>; InversePermutationMap = int*; PermutationMap = int*; SuperNodeMap = iterator_property_map, long unsigned int>, int, int&>; VertexIndexMap = vec_adj_list_vertex_id_map, long unsigned int>]’ ordering.cpp:141:26: required from here /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:65:52: warning: ‘this’ pointer is null [-Wnonnull] 65 | static void failed() { ((Model*)0)->constraints(); } | ~~~~~~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/property_map/property_map.hpp:147:10: note: in a call to non-static member function ‘void boost::ReadablePropertyMapConcept::constraints() [with PMap = boost::vec_adj_list_vertex_id_map, long unsigned int>; Key = long unsigned int]’ 147 | void constraints() { | ^~~~~~~~~~~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::Assignable<__gnu_cxx::__normal_iterator > >]’: /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements > > >]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:145:5: required from ‘struct boost::Assignable<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:502:3: required from ‘struct boost::InputIterator<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:540:3: required from ‘struct boost::ForwardIterator<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:568:3: required from ‘struct boost::BidirectionalIterator<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:597:3: [ skipping 2 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator > >]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied > > >::value’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied > > >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_ > >)>’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/property_map/property_map.hpp:354:5: required from ‘boost::iterator_property_map boost::make_iterator_property_map(RAIter, ID, Value) [with RAIter = __gnu_cxx::__normal_iterator >; Value = void*; ID = adj_list_vertex_property_map >, int, int&, vertex_index_t>]’ ordering.cpp:69:31: required from here /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::Assignable::~Assignable() [with TT = __gnu_cxx::__normal_iterator >]’ 37 | ~model() | ^ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:145:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 145 | BOOST_CONCEPT_USAGE(Assignable) { | ^~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::EqualityComparable<__gnu_cxx::__normal_iterator > >]’: /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements > > >]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:233:5: required from ‘struct boost::EqualityComparable<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:502:3: required from ‘struct boost::InputIterator<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:540:3: required from ‘struct boost::ForwardIterator<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:568:3: required from ‘struct boost::BidirectionalIterator<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:597:3: [ skipping 2 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator > >]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied > > >::value’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied > > >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_ > >)>’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/property_map/property_map.hpp:354:5: required from ‘boost::iterator_property_map boost::make_iterator_property_map(RAIter, ID, Value) [with RAIter = __gnu_cxx::__normal_iterator >; Value = void*; ID = adj_list_vertex_property_map >, int, int&, vertex_index_t>]’ ordering.cpp:69:31: required from here /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::EqualityComparable::~EqualityComparable() [with TT = __gnu_cxx::__normal_iterator >]’ 37 | ~model() | ^ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:233:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 233 | BOOST_CONCEPT_USAGE(EqualityComparable) { | ^~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::InputIterator<__gnu_cxx::__normal_iterator > >]’: /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements > > >]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:512:7: required from ‘struct boost::InputIterator<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:540:3: required from ‘struct boost::ForwardIterator<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:568:3: required from ‘struct boost::BidirectionalIterator<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:597:3: [ skipping 2 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator > >]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied > > >::value’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied > > >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_ > >)>’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/property_map/property_map.hpp:354:5: required from ‘boost::iterator_property_map boost::make_iterator_property_map(RAIter, ID, Value) [with RAIter = __gnu_cxx::__normal_iterator >; Value = void*; ID = adj_list_vertex_property_map >, int, int&, vertex_index_t>]’ ordering.cpp:69:31: required from here /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::InputIterator::~InputIterator() [with TT = __gnu_cxx::__normal_iterator >]’ 37 | ~model() | ^ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:512:7: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 512 | BOOST_CONCEPT_USAGE(InputIterator) | ^~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::ForwardIterator<__gnu_cxx::__normal_iterator > >]’: /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements > > >]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:543:7: required from ‘struct boost::ForwardIterator<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:568:3: required from ‘struct boost::BidirectionalIterator<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:597:3: required from ‘struct boost::RandomAccessIterator<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:597:3: required from ‘struct boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator > >]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied > > >::value’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied > > >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_ > >)>’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/property_map/property_map.hpp:354:5: required from ‘boost::iterator_property_map boost::make_iterator_property_map(RAIter, ID, Value) [with RAIter = __gnu_cxx::__normal_iterator >; Value = void*; ID = adj_list_vertex_property_map >, int, int&, vertex_index_t>]’ ordering.cpp:69:31: required from here /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::ForwardIterator::~ForwardIterator() [with TT = __gnu_cxx::__normal_iterator >]’ 37 | ~model() | ^ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:543:7: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 543 | BOOST_CONCEPT_USAGE(ForwardIterator) | ^~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::BidirectionalIterator<__gnu_cxx::__normal_iterator > >]’: /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements > > >]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:571:7: required from ‘struct boost::BidirectionalIterator<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:597:3: required from ‘struct boost::RandomAccessIterator<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:597:3: required from ‘struct boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator > >]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied > > >::value’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied > > >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_ > >)>’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/property_map/property_map.hpp:354:5: required from ‘boost::iterator_property_map boost::make_iterator_property_map(RAIter, ID, Value) [with RAIter = __gnu_cxx::__normal_iterator >; Value = void*; ID = adj_list_vertex_property_map >, int, int&, vertex_index_t>]’ ordering.cpp:69:31: required from here /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::BidirectionalIterator::~BidirectionalIterator() [with TT = __gnu_cxx::__normal_iterator >]’ 37 | ~model() | ^ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:571:7: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 571 | BOOST_CONCEPT_USAGE(BidirectionalIterator) | ^~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::Comparable<__gnu_cxx::__normal_iterator > >]’: /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements > > >]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:253:5: required from ‘struct boost::Comparable<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:597:3: required from ‘struct boost::RandomAccessIterator<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:597:3: required from ‘struct boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator > >]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied > > >::value’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied > > >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_ > >)>’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/property_map/property_map.hpp:354:5: required from ‘boost::iterator_property_map boost::make_iterator_property_map(RAIter, ID, Value) [with RAIter = __gnu_cxx::__normal_iterator >; Value = void*; ID = adj_list_vertex_property_map >, int, int&, vertex_index_t>]’ ordering.cpp:69:31: required from here /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::Comparable::~Comparable() [with TT = __gnu_cxx::__normal_iterator >]’ 37 | ~model() | ^ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:253:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 253 | BOOST_CONCEPT_USAGE(Comparable) { | ^~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::RandomAccessIterator<__gnu_cxx::__normal_iterator > >]’: /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements > > >]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:601:7: required from ‘struct boost::RandomAccessIterator<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:597:3: required from ‘struct boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator > >]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied > > >::value’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied > > >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_ > >)>’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/property_map/property_map.hpp:354:5: required from ‘boost::iterator_property_map boost::make_iterator_property_map(RAIter, ID, Value) [with RAIter = __gnu_cxx::__normal_iterator >; Value = void*; ID = adj_list_vertex_property_map >, int, int&, vertex_index_t>]’ ordering.cpp:69:31: required from here /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::RandomAccessIterator::~RandomAccessIterator() [with TT = __gnu_cxx::__normal_iterator >]’ 37 | ~model() | ^ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:601:7: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 601 | BOOST_CONCEPT_USAGE(RandomAccessIterator) | ^~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::Assignable]’: /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements >]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:145:5: required from ‘struct boost::Assignable’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:502:3: required from ‘struct boost::InputIterator’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:540:3: required from ‘struct boost::ForwardIterator’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:568:3: required from ‘struct boost::BidirectionalIterator’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:597:3: [ skipping 2 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::RandomAccessIteratorConcept]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied >::value’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_)>’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/property_map/property_map.hpp:354:5: required from ‘boost::iterator_property_map boost::make_iterator_property_map(RAIter, ID, Value) [with RAIter = long unsigned int*; Value = long unsigned int; ID = vec_adj_list_vertex_id_map, long unsigned int>]’ ordering.cpp:116:60: required from here /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::Assignable::~Assignable() [with TT = long unsigned int*]’ 37 | ~model() | ^ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:145:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 145 | BOOST_CONCEPT_USAGE(Assignable) { | ^~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::EqualityComparable]’: /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements >]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:233:5: required from ‘struct boost::EqualityComparable’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:502:3: required from ‘struct boost::InputIterator’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:540:3: required from ‘struct boost::ForwardIterator’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:568:3: required from ‘struct boost::BidirectionalIterator’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:597:3: [ skipping 2 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::RandomAccessIteratorConcept]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied >::value’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_)>’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/property_map/property_map.hpp:354:5: required from ‘boost::iterator_property_map boost::make_iterator_property_map(RAIter, ID, Value) [with RAIter = long unsigned int*; Value = long unsigned int; ID = vec_adj_list_vertex_id_map, long unsigned int>]’ ordering.cpp:116:60: required from here /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::EqualityComparable::~EqualityComparable() [with TT = long unsigned int*]’ 37 | ~model() | ^ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:233:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 233 | BOOST_CONCEPT_USAGE(EqualityComparable) { | ^~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::InputIterator]’: /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements >]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:512:7: required from ‘struct boost::InputIterator’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:540:3: required from ‘struct boost::ForwardIterator’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:568:3: required from ‘struct boost::BidirectionalIterator’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:597:3: [ skipping 2 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::RandomAccessIteratorConcept]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied >::value’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_)>’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/property_map/property_map.hpp:354:5: required from ‘boost::iterator_property_map boost::make_iterator_property_map(RAIter, ID, Value) [with RAIter = long unsigned int*; Value = long unsigned int; ID = vec_adj_list_vertex_id_map, long unsigned int>]’ ordering.cpp:116:60: required from here /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::InputIterator::~InputIterator() [with TT = long unsigned int*]’ 37 | ~model() | ^ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:512:7: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 512 | BOOST_CONCEPT_USAGE(InputIterator) | ^~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::ForwardIterator]’: /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements >]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:543:7: required from ‘struct boost::ForwardIterator’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:568:3: required from ‘struct boost::BidirectionalIterator’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:597:3: required from ‘struct boost::RandomAccessIterator’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:597:3: required from ‘struct boost::RandomAccessIteratorConcept’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::RandomAccessIteratorConcept]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied >::value’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_)>’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/property_map/property_map.hpp:354:5: required from ‘boost::iterator_property_map boost::make_iterator_property_map(RAIter, ID, Value) [with RAIter = long unsigned int*; Value = long unsigned int; ID = vec_adj_list_vertex_id_map, long unsigned int>]’ ordering.cpp:116:60: required from here /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::ForwardIterator::~ForwardIterator() [with TT = long unsigned int*]’ 37 | ~model() | ^ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:543:7: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 543 | BOOST_CONCEPT_USAGE(ForwardIterator) | ^~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::BidirectionalIterator]’: /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements >]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:571:7: required from ‘struct boost::BidirectionalIterator’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:597:3: required from ‘struct boost::RandomAccessIterator’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:597:3: required from ‘struct boost::RandomAccessIteratorConcept’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::RandomAccessIteratorConcept]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied >::value’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_)>’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/property_map/property_map.hpp:354:5: required from ‘boost::iterator_property_map boost::make_iterator_property_map(RAIter, ID, Value) [with RAIter = long unsigned int*; Value = long unsigned int; ID = vec_adj_list_vertex_id_map, long unsigned int>]’ ordering.cpp:116:60: required from here /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::BidirectionalIterator::~BidirectionalIterator() [with TT = long unsigned int*]’ 37 | ~model() | ^ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:571:7: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 571 | BOOST_CONCEPT_USAGE(BidirectionalIterator) | ^~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::Comparable]’: /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements >]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:253:5: required from ‘struct boost::Comparable’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:597:3: required from ‘struct boost::RandomAccessIterator’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:597:3: required from ‘struct boost::RandomAccessIteratorConcept’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::RandomAccessIteratorConcept]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied >::value’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_)>’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/property_map/property_map.hpp:354:5: required from ‘boost::iterator_property_map boost::make_iterator_property_map(RAIter, ID, Value) [with RAIter = long unsigned int*; Value = long unsigned int; ID = vec_adj_list_vertex_id_map, long unsigned int>]’ ordering.cpp:116:60: required from here /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::Comparable::~Comparable() [with TT = long unsigned int*]’ 37 | ~model() | ^ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:253:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 253 | BOOST_CONCEPT_USAGE(Comparable) { | ^~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::RandomAccessIterator]’: /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements >]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:601:7: required from ‘struct boost::RandomAccessIterator’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:597:3: required from ‘struct boost::RandomAccessIteratorConcept’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::RandomAccessIteratorConcept]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied >::value’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_)>’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/property_map/property_map.hpp:354:5: required from ‘boost::iterator_property_map boost::make_iterator_property_map(RAIter, ID, Value) [with RAIter = long unsigned int*; Value = long unsigned int; ID = vec_adj_list_vertex_id_map, long unsigned int>]’ ordering.cpp:116:60: required from here /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::RandomAccessIterator::~RandomAccessIterator() [with TT = long unsigned int*]’ 37 | ~model() | ^ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:601:7: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 601 | BOOST_CONCEPT_USAGE(RandomAccessIterator) | ^~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::Assignable]’: /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements >]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:145:5: required from ‘struct boost::Assignable’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:502:3: required from ‘struct boost::InputIterator’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:540:3: required from ‘struct boost::ForwardIterator’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:568:3: required from ‘struct boost::BidirectionalIterator’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:597:3: [ skipping 2 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::RandomAccessIteratorConcept]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied >::value’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_)>’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/property_map/property_map.hpp:354:5: required from ‘boost::iterator_property_map boost::make_iterator_property_map(RAIter, ID, Value) [with RAIter = int*; Value = int; ID = vec_adj_list_vertex_id_map, long unsigned int>]’ ordering.cpp:142:30: required from here /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::Assignable::~Assignable() [with TT = int*]’ 37 | ~model() | ^ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:145:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 145 | BOOST_CONCEPT_USAGE(Assignable) { | ^~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::EqualityComparable]’: /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements >]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:233:5: required from ‘struct boost::EqualityComparable’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:502:3: required from ‘struct boost::InputIterator’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:540:3: required from ‘struct boost::ForwardIterator’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:568:3: required from ‘struct boost::BidirectionalIterator’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:597:3: [ skipping 2 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::RandomAccessIteratorConcept]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied >::value’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_)>’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/property_map/property_map.hpp:354:5: required from ‘boost::iterator_property_map boost::make_iterator_property_map(RAIter, ID, Value) [with RAIter = int*; Value = int; ID = vec_adj_list_vertex_id_map, long unsigned int>]’ ordering.cpp:142:30: required from here /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::EqualityComparable::~EqualityComparable() [with TT = int*]’ 37 | ~model() | ^ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:233:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 233 | BOOST_CONCEPT_USAGE(EqualityComparable) { | ^~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::InputIterator]’: /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements >]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:512:7: required from ‘struct boost::InputIterator’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:540:3: required from ‘struct boost::ForwardIterator’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:568:3: required from ‘struct boost::BidirectionalIterator’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:597:3: [ skipping 2 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::RandomAccessIteratorConcept]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied >::value’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_)>’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/property_map/property_map.hpp:354:5: required from ‘boost::iterator_property_map boost::make_iterator_property_map(RAIter, ID, Value) [with RAIter = int*; Value = int; ID = vec_adj_list_vertex_id_map, long unsigned int>]’ ordering.cpp:142:30: required from here /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::InputIterator::~InputIterator() [with TT = int*]’ 37 | ~model() | ^ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:512:7: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 512 | BOOST_CONCEPT_USAGE(InputIterator) | ^~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::ForwardIterator]’: /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements >]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:543:7: required from ‘struct boost::ForwardIterator’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:568:3: required from ‘struct boost::BidirectionalIterator’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:597:3: required from ‘struct boost::RandomAccessIterator’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:597:3: required from ‘struct boost::RandomAccessIteratorConcept’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::RandomAccessIteratorConcept]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied >::value’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_)>’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/property_map/property_map.hpp:354:5: required from ‘boost::iterator_property_map boost::make_iterator_property_map(RAIter, ID, Value) [with RAIter = int*; Value = int; ID = vec_adj_list_vertex_id_map, long unsigned int>]’ ordering.cpp:142:30: required from here /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::ForwardIterator::~ForwardIterator() [with TT = int*]’ 37 | ~model() | ^ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:543:7: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 543 | BOOST_CONCEPT_USAGE(ForwardIterator) | ^~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::BidirectionalIterator]’: /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements >]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:571:7: required from ‘struct boost::BidirectionalIterator’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:597:3: required from ‘struct boost::RandomAccessIterator’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:597:3: required from ‘struct boost::RandomAccessIteratorConcept’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::RandomAccessIteratorConcept]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied >::value’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_)>’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/property_map/property_map.hpp:354:5: required from ‘boost::iterator_property_map boost::make_iterator_property_map(RAIter, ID, Value) [with RAIter = int*; Value = int; ID = vec_adj_list_vertex_id_map, long unsigned int>]’ ordering.cpp:142:30: required from here /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::BidirectionalIterator::~BidirectionalIterator() [with TT = int*]’ 37 | ~model() | ^ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:571:7: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 571 | BOOST_CONCEPT_USAGE(BidirectionalIterator) | ^~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::Comparable]’: /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements >]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:253:5: required from ‘struct boost::Comparable’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:597:3: required from ‘struct boost::RandomAccessIterator’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:597:3: required from ‘struct boost::RandomAccessIteratorConcept’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::RandomAccessIteratorConcept]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied >::value’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_)>’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/property_map/property_map.hpp:354:5: required from ‘boost::iterator_property_map boost::make_iterator_property_map(RAIter, ID, Value) [with RAIter = int*; Value = int; ID = vec_adj_list_vertex_id_map, long unsigned int>]’ ordering.cpp:142:30: required from here /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::Comparable::~Comparable() [with TT = int*]’ 37 | ~model() | ^ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:253:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 253 | BOOST_CONCEPT_USAGE(Comparable) { | ^~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::RandomAccessIterator]’: /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements >]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:601:7: required from ‘struct boost::RandomAccessIterator’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:597:3: required from ‘struct boost::RandomAccessIteratorConcept’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::RandomAccessIteratorConcept]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied >::value’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_)>’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/property_map/property_map.hpp:354:5: required from ‘boost::iterator_property_map boost::make_iterator_property_map(RAIter, ID, Value) [with RAIter = int*; Value = int; ID = vec_adj_list_vertex_id_map, long unsigned int>]’ ordering.cpp:142:30: required from here /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::RandomAccessIterator::~RandomAccessIterator() [with TT = int*]’ 37 | ~model() | ^ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:601:7: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 601 | BOOST_CONCEPT_USAGE(RandomAccessIterator) | ^~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements >]’: /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:208:5: required from ‘struct boost::Convertible’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:206:3: required from ‘struct boost::ConvertibleConcept’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::ConvertibleConcept]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied >::value’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:72:8: [ skipping 4 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied, long unsigned int>, long unsigned int> >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_, long unsigned int>, long unsigned int>)>’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/pending/bucket_sorter.hpp:32:5: required from ‘class boost::bucket_sorter, long unsigned int>, int, int&>, boost::vec_adj_list_vertex_id_map, long unsigned int> >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/minimum_degree_ordering.hpp:336:21: required from ‘class boost::detail::mmd_impl, boost::iterator_property_map, long unsigned int>, int, int&>, int*, int*, boost::iterator_property_map, long unsigned int>, int, int&>, boost::vec_adj_list_vertex_id_map, long unsigned int> >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/minimum_degree_ordering.hpp:752:9: required from ‘void boost::minimum_degree_ordering(Graph&, DegreeMap, InversePermutationMap, PermutationMap, SuperNodeMap, int, VertexIndexMap) [with Graph = R_adjacency_list; DegreeMap = iterator_property_map, long unsigned int>, int, int&>; InversePermutationMap = int*; PermutationMap = int*; SuperNodeMap = iterator_property_map, long unsigned int>, int, int&>; VertexIndexMap = vec_adj_list_vertex_id_map, long unsigned int>]’ ordering.cpp:141:26: required from here /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::Convertible]’ 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ^ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::ConvertibleConcept]’: /home/omnipath/local/R/4.4-3.20/BH/include/boost/property_map/property_map.hpp:148:7: required from ‘void boost::ReadablePropertyMapConcept::constraints() [with PMap = boost::vec_adj_list_vertex_id_map, long unsigned int>; Key = long unsigned int]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::ReadablePropertyMapConcept, long unsigned int>, long unsigned int>]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied, long unsigned int>, long unsigned int> >::value’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied, long unsigned int>, long unsigned int> >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_, long unsigned int>, long unsigned int>)>’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/pending/bucket_sorter.hpp:32:5: required from ‘class boost::bucket_sorter, long unsigned int>, int, int&>, boost::vec_adj_list_vertex_id_map, long unsigned int> >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/minimum_degree_ordering.hpp:336:21: required from ‘class boost::detail::mmd_impl, boost::iterator_property_map, long unsigned int>, int, int&>, int*, int*, boost::iterator_property_map, long unsigned int>, int, int&>, boost::vec_adj_list_vertex_id_map, long unsigned int> >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/minimum_degree_ordering.hpp:752:9: required from ‘void boost::minimum_degree_ordering(Graph&, DegreeMap, InversePermutationMap, PermutationMap, SuperNodeMap, int, VertexIndexMap) [with Graph = R_adjacency_list; DegreeMap = iterator_property_map, long unsigned int>, int, int&>; InversePermutationMap = int*; PermutationMap = int*; SuperNodeMap = iterator_property_map, long unsigned int>, int, int&>; VertexIndexMap = vec_adj_list_vertex_id_map, long unsigned int>]’ ordering.cpp:141:26: required from here /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:206:17: note: in a call to non-static member function ‘boost::ConvertibleConcept::~ConvertibleConcept()’ 206 | BOOST_concept(Convertible,(X)(Y)) | ^~~~~~~~~~~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/preprocessor/cat.hpp:29:34: note: in definition of macro ‘BOOST_PP_CAT_I’ 29 | # define BOOST_PP_CAT_I(a, b) a ## b | ^ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/concept_def.hpp:23:12: note: in expansion of macro ‘BOOST_PP_CAT’ 23 | struct BOOST_PP_CAT(name,Concept) \ | ^~~~~~~~~~~~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:206:3: note: in expansion of macro ‘BOOST_concept’ 206 | BOOST_concept(Convertible,(X)(Y)) | ^~~~~~~~~~~~~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements >]’: /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:208:5: required from ‘struct boost::Convertible’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::Convertible]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied >::value’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_)>’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:603:11: required from ‘boost::RandomAccessIterator::~RandomAccessIterator() [with TT = __gnu_cxx::__normal_iterator >]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:597:3: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator > >]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/property_map/property_map.hpp:354:5: required from ‘boost::iterator_property_map boost::make_iterator_property_map(RAIter, ID, Value) [with RAIter = __gnu_cxx::__normal_iterator >; Value = void*; ID = adj_list_vertex_property_map >, int, int&, vertex_index_t>]’ ordering.cpp:69:31: required from here /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::Convertible]’ 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ^ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::Convertible]’: /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:603:11: required from ‘boost::RandomAccessIterator::~RandomAccessIterator() [with TT = __gnu_cxx::__normal_iterator >]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:597:3: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator > >]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/property_map/property_map.hpp:354:5: required from ‘boost::iterator_property_map boost::make_iterator_property_map(RAIter, ID, Value) [with RAIter = __gnu_cxx::__normal_iterator >; Value = void*; ID = adj_list_vertex_property_map >, int, int&, vertex_index_t>]’ ordering.cpp:69:31: required from here /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::Convertible::~Convertible() [with X = std::random_access_iterator_tag; Y = std::random_access_iterator_tag]’ 37 | ~model() | ^ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:208:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 208 | BOOST_CONCEPT_USAGE(Convertible) { | ^~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements > >]’: /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/graph_concepts.hpp:66:5: required from ‘struct boost::concepts::Graph >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/graph_concepts.hpp:75:1: required from ‘struct boost::concepts::IncidenceGraph >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/graph_concepts.hpp:75:1: required from ‘struct boost::concepts::IncidenceGraphConcept >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::concepts::IncidenceGraphConcept >]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied > >::value’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied > >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_ >)>’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/depth_first_search.hpp:129:9: required from ‘void boost::detail::depth_first_visit_impl(const IncidenceGraph&, typename boost::graph_traits::vertex_descriptor, DFSVisitor&, ColorMap, TerminatorFunc) [with IncidenceGraph = R_adjacency_list; DFSVisitor = boost::dfs_visitor<>; ColorMap = boost::vec_adj_list_vertex_property_map, boost::property, boost::no_property, boost::listS>, boost::adjacency_list, boost::property, boost::no_property, boost::listS>*, boost::default_color_type, boost::default_color_type&, boost::vertex_color_t>; TerminatorFunc = nontruth2; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/depth_first_search.hpp:417:35: required from ‘void boost::depth_first_visit(const IncidenceGraph&, typename graph_traits::vertex_descriptor, DFSVisitor, ColorMap) [with IncidenceGraph = R_adjacency_list; DFSVisitor = dfs_visitor<>; ColorMap = vec_adj_list_vertex_property_map, property, no_property, listS>, adjacency_list, property, no_property, listS>*, default_color_type, default_color_type&, vertex_color_t>; typename graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/cuthill_mckee_ordering.hpp:146:30: required from ‘OutputIterator boost::cuthill_mckee_ordering(const Graph&, OutputIterator, ColorMap, DegreeMap) [with Graph = R_adjacency_list; OutputIterator = std::reverse_iterator<__gnu_cxx::__normal_iterator > >; ColorMap = vec_adj_list_vertex_property_map, property, no_property, listS>, adjacency_list, property, no_property, listS>*, default_color_type, default_color_type&, vertex_color_t>; DegreeMap = degree_property_map >]’ ordering.cpp:98:25: required from here /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::concepts::Graph >]’ 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ^ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements > >]’: /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/graph_concepts.hpp:87:5: required from ‘struct boost::concepts::IncidenceGraph >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/graph_concepts.hpp:75:1: required from ‘struct boost::concepts::IncidenceGraphConcept >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::concepts::IncidenceGraphConcept >]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied > >::value’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied > >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_ >)>’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/depth_first_search.hpp:129:9: required from ‘void boost::detail::depth_first_visit_impl(const IncidenceGraph&, typename boost::graph_traits::vertex_descriptor, DFSVisitor&, ColorMap, TerminatorFunc) [with IncidenceGraph = R_adjacency_list; DFSVisitor = boost::dfs_visitor<>; ColorMap = boost::vec_adj_list_vertex_property_map, boost::property, boost::no_property, boost::listS>, boost::adjacency_list, boost::property, boost::no_property, boost::listS>*, boost::default_color_type, boost::default_color_type&, boost::vertex_color_t>; TerminatorFunc = nontruth2; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/depth_first_search.hpp:417:35: required from ‘void boost::depth_first_visit(const IncidenceGraph&, typename graph_traits::vertex_descriptor, DFSVisitor, ColorMap) [with IncidenceGraph = R_adjacency_list; DFSVisitor = dfs_visitor<>; ColorMap = vec_adj_list_vertex_property_map, property, no_property, listS>, adjacency_list, property, no_property, listS>*, default_color_type, default_color_type&, vertex_color_t>; typename graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/cuthill_mckee_ordering.hpp:146:30: required from ‘OutputIterator boost::cuthill_mckee_ordering(const Graph&, OutputIterator, ColorMap, DegreeMap) [with Graph = R_adjacency_list; OutputIterator = std::reverse_iterator<__gnu_cxx::__normal_iterator > >; ColorMap = vec_adj_list_vertex_property_map, property, no_property, listS>, adjacency_list, property, no_property, listS>*, default_color_type, default_color_type&, vertex_color_t>; DegreeMap = degree_property_map >]’ ordering.cpp:98:25: required from here /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::concepts::IncidenceGraph >]’ 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ^ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::IncidenceGraphConcept >]’: /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/depth_first_search.hpp:129:9: required from ‘void boost::detail::depth_first_visit_impl(const IncidenceGraph&, typename boost::graph_traits::vertex_descriptor, DFSVisitor&, ColorMap, TerminatorFunc) [with IncidenceGraph = R_adjacency_list; DFSVisitor = boost::dfs_visitor<>; ColorMap = boost::vec_adj_list_vertex_property_map, boost::property, boost::no_property, boost::listS>, boost::adjacency_list, boost::property, boost::no_property, boost::listS>*, boost::default_color_type, boost::default_color_type&, boost::vertex_color_t>; TerminatorFunc = nontruth2; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/depth_first_search.hpp:417:35: required from ‘void boost::depth_first_visit(const IncidenceGraph&, typename graph_traits::vertex_descriptor, DFSVisitor, ColorMap) [with IncidenceGraph = R_adjacency_list; DFSVisitor = dfs_visitor<>; ColorMap = vec_adj_list_vertex_property_map, property, no_property, listS>, adjacency_list, property, no_property, listS>*, default_color_type, default_color_type&, vertex_color_t>; typename graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/cuthill_mckee_ordering.hpp:146:30: required from ‘OutputIterator boost::cuthill_mckee_ordering(const Graph&, OutputIterator, ColorMap, DegreeMap) [with Graph = R_adjacency_list; OutputIterator = std::reverse_iterator<__gnu_cxx::__normal_iterator > >; ColorMap = vec_adj_list_vertex_property_map, property, no_property, listS>, adjacency_list, property, no_property, listS>*, default_color_type, default_color_type&, vertex_color_t>; DegreeMap = degree_property_map >]’ ordering.cpp:98:25: required from here /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/graph_concepts.hpp:75:15: note: in a call to non-static member function ‘boost::concepts::IncidenceGraphConcept >::~IncidenceGraphConcept()’ 75 | BOOST_concept(IncidenceGraph, (G)) : Graph< G > | ^~~~~~~~~~~~~~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/preprocessor/cat.hpp:29:34: note: in definition of macro ‘BOOST_PP_CAT_I’ 29 | # define BOOST_PP_CAT_I(a, b) a ## b | ^ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/concept_def.hpp:23:12: note: in expansion of macro ‘BOOST_PP_CAT’ 23 | struct BOOST_PP_CAT(name,Concept) \ | ^~~~~~~~~~~~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/graph_concepts.hpp:75:1: note: in expansion of macro ‘BOOST_concept’ 75 | BOOST_concept(IncidenceGraph, (G)) : Graph< G > | ^~~~~~~~~~~~~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::constraint::failed() [with Model = boost::DFSVisitorConcept, R_adjacency_list >]’: /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/depth_first_search.hpp:130:9: required from ‘void boost::detail::depth_first_visit_impl(const IncidenceGraph&, typename boost::graph_traits::vertex_descriptor, DFSVisitor&, ColorMap, TerminatorFunc) [with IncidenceGraph = R_adjacency_list; DFSVisitor = boost::dfs_visitor<>; ColorMap = boost::vec_adj_list_vertex_property_map, boost::property, boost::no_property, boost::listS>, boost::adjacency_list, boost::property, boost::no_property, boost::listS>*, boost::default_color_type, boost::default_color_type&, boost::vertex_color_t>; TerminatorFunc = nontruth2; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/depth_first_search.hpp:417:35: required from ‘void boost::depth_first_visit(const IncidenceGraph&, typename graph_traits::vertex_descriptor, DFSVisitor, ColorMap) [with IncidenceGraph = R_adjacency_list; DFSVisitor = dfs_visitor<>; ColorMap = vec_adj_list_vertex_property_map, property, no_property, listS>, adjacency_list, property, no_property, listS>*, default_color_type, default_color_type&, vertex_color_t>; typename graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/cuthill_mckee_ordering.hpp:146:30: required from ‘OutputIterator boost::cuthill_mckee_ordering(const Graph&, OutputIterator, ColorMap, DegreeMap) [with Graph = R_adjacency_list; OutputIterator = std::reverse_iterator<__gnu_cxx::__normal_iterator > >; ColorMap = vec_adj_list_vertex_property_map, property, no_property, listS>, adjacency_list, property, no_property, listS>*, default_color_type, default_color_type&, vertex_color_t>; DegreeMap = degree_property_map >]’ ordering.cpp:98:25: required from here /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:65:52: warning: ‘this’ pointer is null [-Wnonnull] 65 | static void failed() { ((Model*)0)->constraints(); } | ~~~~~~~~~~~~~~~~~~~~~~~~^~ In file included from /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/isomorphism.hpp:16, from ordering.cpp:2: /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/depth_first_search.hpp:39:10: note: in a call to non-static member function ‘void boost::DFSVisitorConcept::constraints() [with Visitor = boost::dfs_visitor<>; Graph = R_adjacency_list]’ 39 | void constraints() | ^~~~~~~~~~~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::constraint::failed() [with Model = boost::ReadWritePropertyMapConcept, boost::property, boost::no_property, boost::listS>, boost::adjacency_list, boost::property, boost::no_property, boost::listS>*, boost::default_color_type, boost::default_color_type&, boost::vertex_color_t>, long unsigned int>]’: /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/depth_first_search.hpp:134:9: required from ‘void boost::detail::depth_first_visit_impl(const IncidenceGraph&, typename boost::graph_traits::vertex_descriptor, DFSVisitor&, ColorMap, TerminatorFunc) [with IncidenceGraph = R_adjacency_list; DFSVisitor = boost::dfs_visitor<>; ColorMap = boost::vec_adj_list_vertex_property_map, boost::property, boost::no_property, boost::listS>, boost::adjacency_list, boost::property, boost::no_property, boost::listS>*, boost::default_color_type, boost::default_color_type&, boost::vertex_color_t>; TerminatorFunc = nontruth2; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/depth_first_search.hpp:417:35: required from ‘void boost::depth_first_visit(const IncidenceGraph&, typename graph_traits::vertex_descriptor, DFSVisitor, ColorMap) [with IncidenceGraph = R_adjacency_list; DFSVisitor = dfs_visitor<>; ColorMap = vec_adj_list_vertex_property_map, property, no_property, listS>, adjacency_list, property, no_property, listS>*, default_color_type, default_color_type&, vertex_color_t>; typename graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/cuthill_mckee_ordering.hpp:146:30: required from ‘OutputIterator boost::cuthill_mckee_ordering(const Graph&, OutputIterator, ColorMap, DegreeMap) [with Graph = R_adjacency_list; OutputIterator = std::reverse_iterator<__gnu_cxx::__normal_iterator > >; ColorMap = vec_adj_list_vertex_property_map, property, no_property, listS>, adjacency_list, property, no_property, listS>*, default_color_type, default_color_type&, vertex_color_t>; DegreeMap = degree_property_map >]’ ordering.cpp:98:25: required from here /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:65:52: warning: ‘this’ pointer is null [-Wnonnull] 65 | static void failed() { ((Model*)0)->constraints(); } | ~~~~~~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/property_map/property_map.hpp:205:10: note: in a call to non-static member function ‘void boost::ReadWritePropertyMapConcept::constraints() [with PMap = boost::vec_adj_list_vertex_property_map, boost::property, boost::no_property, boost::listS>, boost::adjacency_list, boost::property, boost::no_property, boost::listS>*, boost::default_color_type, boost::default_color_type&, boost::vertex_color_t>; Key = long unsigned int]’ 205 | void constraints() { | ^~~~~~~~~~~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements >]’: /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:233:5: required from ‘struct boost::EqualityComparable’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/graph_concepts.hpp:502:1: required from ‘struct boost::concepts::ColorValue’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/graph_concepts.hpp:502:1: required from ‘struct boost::concepts::ColorValueConcept’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::concepts::ColorValueConcept]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied >::value’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_)>’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/depth_first_search.hpp:136:9: required from ‘void boost::detail::depth_first_visit_impl(const IncidenceGraph&, typename boost::graph_traits::vertex_descriptor, DFSVisitor&, ColorMap, TerminatorFunc) [with IncidenceGraph = R_adjacency_list; DFSVisitor = boost::dfs_visitor<>; ColorMap = boost::vec_adj_list_vertex_property_map, boost::property, boost::no_property, boost::listS>, boost::adjacency_list, boost::property, boost::no_property, boost::listS>*, boost::default_color_type, boost::default_color_type&, boost::vertex_color_t>; TerminatorFunc = nontruth2; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/depth_first_search.hpp:417:35: required from ‘void boost::depth_first_visit(const IncidenceGraph&, typename graph_traits::vertex_descriptor, DFSVisitor, ColorMap) [with IncidenceGraph = R_adjacency_list; DFSVisitor = dfs_visitor<>; ColorMap = vec_adj_list_vertex_property_map, property, no_property, listS>, adjacency_list, property, no_property, listS>*, default_color_type, default_color_type&, vertex_color_t>; typename graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/cuthill_mckee_ordering.hpp:146:30: required from ‘OutputIterator boost::cuthill_mckee_ordering(const Graph&, OutputIterator, ColorMap, DegreeMap) [with Graph = R_adjacency_list; OutputIterator = std::reverse_iterator<__gnu_cxx::__normal_iterator > >; ColorMap = vec_adj_list_vertex_property_map, property, no_property, listS>, adjacency_list, property, no_property, listS>*, default_color_type, default_color_type&, vertex_color_t>; DegreeMap = degree_property_map >]’ ordering.cpp:98:25: required from here /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::EqualityComparable]’ 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ^ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements >]’: /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:137:5: required from ‘struct boost::DefaultConstructible’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/graph_concepts.hpp:502:1: required from ‘struct boost::concepts::ColorValue’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/graph_concepts.hpp:502:1: required from ‘struct boost::concepts::ColorValueConcept’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::concepts::ColorValueConcept]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied >::value’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_)>’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/depth_first_search.hpp:136:9: required from ‘void boost::detail::depth_first_visit_impl(const IncidenceGraph&, typename boost::graph_traits::vertex_descriptor, DFSVisitor&, ColorMap, TerminatorFunc) [with IncidenceGraph = R_adjacency_list; DFSVisitor = boost::dfs_visitor<>; ColorMap = boost::vec_adj_list_vertex_property_map, boost::property, boost::no_property, boost::listS>, boost::adjacency_list, boost::property, boost::no_property, boost::listS>*, boost::default_color_type, boost::default_color_type&, boost::vertex_color_t>; TerminatorFunc = nontruth2; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/depth_first_search.hpp:417:35: required from ‘void boost::depth_first_visit(const IncidenceGraph&, typename graph_traits::vertex_descriptor, DFSVisitor, ColorMap) [with IncidenceGraph = R_adjacency_list; DFSVisitor = dfs_visitor<>; ColorMap = vec_adj_list_vertex_property_map, property, no_property, listS>, adjacency_list, property, no_property, listS>*, default_color_type, default_color_type&, vertex_color_t>; typename graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/cuthill_mckee_ordering.hpp:146:30: required from ‘OutputIterator boost::cuthill_mckee_ordering(const Graph&, OutputIterator, ColorMap, DegreeMap) [with Graph = R_adjacency_list; OutputIterator = std::reverse_iterator<__gnu_cxx::__normal_iterator > >; ColorMap = vec_adj_list_vertex_property_map, property, no_property, listS>, adjacency_list, property, no_property, listS>*, default_color_type, default_color_type&, vertex_color_t>; DegreeMap = degree_property_map >]’ ordering.cpp:98:25: required from here /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::DefaultConstructible]’ 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ^ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements >]’: /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/graph_concepts.hpp:505:5: required from ‘struct boost::concepts::ColorValue’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/graph_concepts.hpp:502:1: required from ‘struct boost::concepts::ColorValueConcept’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::concepts::ColorValueConcept]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied >::value’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_)>’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/depth_first_search.hpp:136:9: required from ‘void boost::detail::depth_first_visit_impl(const IncidenceGraph&, typename boost::graph_traits::vertex_descriptor, DFSVisitor&, ColorMap, TerminatorFunc) [with IncidenceGraph = R_adjacency_list; DFSVisitor = boost::dfs_visitor<>; ColorMap = boost::vec_adj_list_vertex_property_map, boost::property, boost::no_property, boost::listS>, boost::adjacency_list, boost::property, boost::no_property, boost::listS>*, boost::default_color_type, boost::default_color_type&, boost::vertex_color_t>; TerminatorFunc = nontruth2; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/depth_first_search.hpp:417:35: required from ‘void boost::depth_first_visit(const IncidenceGraph&, typename graph_traits::vertex_descriptor, DFSVisitor, ColorMap) [with IncidenceGraph = R_adjacency_list; DFSVisitor = dfs_visitor<>; ColorMap = vec_adj_list_vertex_property_map, property, no_property, listS>, adjacency_list, property, no_property, listS>*, default_color_type, default_color_type&, vertex_color_t>; typename graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/cuthill_mckee_ordering.hpp:146:30: required from ‘OutputIterator boost::cuthill_mckee_ordering(const Graph&, OutputIterator, ColorMap, DegreeMap) [with Graph = R_adjacency_list; OutputIterator = std::reverse_iterator<__gnu_cxx::__normal_iterator > >; ColorMap = vec_adj_list_vertex_property_map, property, no_property, listS>, adjacency_list, property, no_property, listS>*, default_color_type, default_color_type&, vertex_color_t>; DegreeMap = degree_property_map >]’ ordering.cpp:98:25: required from here /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::concepts::ColorValue]’ 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ^ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::ColorValueConcept]’: /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/depth_first_search.hpp:136:9: required from ‘void boost::detail::depth_first_visit_impl(const IncidenceGraph&, typename boost::graph_traits::vertex_descriptor, DFSVisitor&, ColorMap, TerminatorFunc) [with IncidenceGraph = R_adjacency_list; DFSVisitor = boost::dfs_visitor<>; ColorMap = boost::vec_adj_list_vertex_property_map, boost::property, boost::no_property, boost::listS>, boost::adjacency_list, boost::property, boost::no_property, boost::listS>*, boost::default_color_type, boost::default_color_type&, boost::vertex_color_t>; TerminatorFunc = nontruth2; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/depth_first_search.hpp:417:35: required from ‘void boost::depth_first_visit(const IncidenceGraph&, typename graph_traits::vertex_descriptor, DFSVisitor, ColorMap) [with IncidenceGraph = R_adjacency_list; DFSVisitor = dfs_visitor<>; ColorMap = vec_adj_list_vertex_property_map, property, no_property, listS>, adjacency_list, property, no_property, listS>*, default_color_type, default_color_type&, vertex_color_t>; typename graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/cuthill_mckee_ordering.hpp:146:30: required from ‘OutputIterator boost::cuthill_mckee_ordering(const Graph&, OutputIterator, ColorMap, DegreeMap) [with Graph = R_adjacency_list; OutputIterator = std::reverse_iterator<__gnu_cxx::__normal_iterator > >; ColorMap = vec_adj_list_vertex_property_map, property, no_property, listS>, adjacency_list, property, no_property, listS>*, default_color_type, default_color_type&, vertex_color_t>; DegreeMap = degree_property_map >]’ ordering.cpp:98:25: required from here /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/graph_concepts.hpp:502:15: note: in a call to non-static member function ‘boost::concepts::ColorValueConcept::~ColorValueConcept()’ 502 | BOOST_concept(ColorValue, (C)) | ^~~~~~~~~~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/preprocessor/cat.hpp:29:34: note: in definition of macro ‘BOOST_PP_CAT_I’ 29 | # define BOOST_PP_CAT_I(a, b) a ## b | ^ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/concept_def.hpp:23:12: note: in expansion of macro ‘BOOST_PP_CAT’ 23 | struct BOOST_PP_CAT(name,Concept) \ | ^~~~~~~~~~~~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/graph_concepts.hpp:502:1: note: in expansion of macro ‘BOOST_concept’ 502 | BOOST_concept(ColorValue, (C)) | ^~~~~~~~~~~~~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::Convertible]’: /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements >]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:208:5: required from ‘struct boost::Convertible’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:206:3: required from ‘struct boost::ConvertibleConcept’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::ConvertibleConcept]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied >::value’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:45:51: [ skipping 5 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied, long unsigned int>, long unsigned int> >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_, long unsigned int>, long unsigned int>)>’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/pending/bucket_sorter.hpp:32:5: required from ‘class boost::bucket_sorter, long unsigned int>, int, int&>, boost::vec_adj_list_vertex_id_map, long unsigned int> >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/minimum_degree_ordering.hpp:336:21: required from ‘class boost::detail::mmd_impl, boost::iterator_property_map, long unsigned int>, int, int&>, int*, int*, boost::iterator_property_map, long unsigned int>, int, int&>, boost::vec_adj_list_vertex_id_map, long unsigned int> >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/minimum_degree_ordering.hpp:752:9: required from ‘void boost::minimum_degree_ordering(Graph&, DegreeMap, InversePermutationMap, PermutationMap, SuperNodeMap, int, VertexIndexMap) [with Graph = R_adjacency_list; DegreeMap = iterator_property_map, long unsigned int>, int, int&>; InversePermutationMap = int*; PermutationMap = int*; SuperNodeMap = iterator_property_map, long unsigned int>, int, int&>; VertexIndexMap = vec_adj_list_vertex_id_map, long unsigned int>]’ ordering.cpp:141:26: required from here /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::Convertible::~Convertible() [with X = boost::readable_property_map_tag; Y = boost::readable_property_map_tag]’ 37 | ~model() | ^ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:208:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 208 | BOOST_CONCEPT_USAGE(Convertible) { | ^~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::SignedInteger]’: /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:514:9: required from ‘boost::InputIterator::~InputIterator() [with TT = __gnu_cxx::__normal_iterator >]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/usage.hpp:20:48: required from ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::InputIterator<__gnu_cxx::__normal_iterator > >]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements > > >]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:512:7: required from ‘struct boost::InputIterator<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:540:3: required from ‘struct boost::ForwardIterator<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:568:3: [ skipping 3 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator > >]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied > > >::value’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied > > >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_ > >)>’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/property_map/property_map.hpp:354:5: required from ‘boost::iterator_property_map boost::make_iterator_property_map(RAIter, ID, Value) [with RAIter = __gnu_cxx::__normal_iterator >; Value = void*; ID = adj_list_vertex_property_map >, int, int&, vertex_index_t>]’ ordering.cpp:69:31: required from here /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:107:22: note: in a call to non-static member function ‘boost::SignedInteger::~SignedInteger()’ 107 | template <> struct SignedInteger {}; | ^~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements >]’: /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:208:5: required from ‘struct boost::Convertible’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::Convertible]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied >::value’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_)>’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:515:9: [ skipping 8 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator > >]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied > > >::value’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied > > >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_ > >)>’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/property_map/property_map.hpp:354:5: required from ‘boost::iterator_property_map boost::make_iterator_property_map(RAIter, ID, Value) [with RAIter = __gnu_cxx::__normal_iterator >; Value = void*; ID = adj_list_vertex_property_map >, int, int&, vertex_index_t>]’ ordering.cpp:69:31: required from here /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::Convertible]’ 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ^ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::Convertible]’: /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:515:9: required from ‘boost::InputIterator::~InputIterator() [with TT = __gnu_cxx::__normal_iterator >]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/usage.hpp:20:48: required from ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::InputIterator<__gnu_cxx::__normal_iterator > >]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements > > >]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:512:7: required from ‘struct boost::InputIterator<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:540:3: required from ‘struct boost::ForwardIterator<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:568:3: [ skipping 3 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator > >]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied > > >::value’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied > > >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_ > >)>’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/property_map/property_map.hpp:354:5: required from ‘boost::iterator_property_map boost::make_iterator_property_map(RAIter, ID, Value) [with RAIter = __gnu_cxx::__normal_iterator >; Value = void*; ID = adj_list_vertex_property_map >, int, int&, vertex_index_t>]’ ordering.cpp:69:31: required from here /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::Convertible::~Convertible() [with X = std::random_access_iterator_tag; Y = std::input_iterator_tag]’ 37 | ~model() | ^ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:208:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 208 | BOOST_CONCEPT_USAGE(Convertible) { | ^~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements >]’: /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:208:5: required from ‘struct boost::Convertible’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::Convertible]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied >::value’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_)>’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:545:11: [ skipping 7 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator > >]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied > > >::value’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied > > >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_ > >)>’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/property_map/property_map.hpp:354:5: required from ‘boost::iterator_property_map boost::make_iterator_property_map(RAIter, ID, Value) [with RAIter = __gnu_cxx::__normal_iterator >; Value = void*; ID = adj_list_vertex_property_map >, int, int&, vertex_index_t>]’ ordering.cpp:69:31: required from here /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::Convertible]’ 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ^ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::Convertible]’: /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:545:11: required from ‘boost::ForwardIterator::~ForwardIterator() [with TT = __gnu_cxx::__normal_iterator >]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/usage.hpp:20:48: required from ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::ForwardIterator<__gnu_cxx::__normal_iterator > >]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements > > >]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:543:7: required from ‘struct boost::ForwardIterator<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:568:3: required from ‘struct boost::BidirectionalIterator<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:597:3: [ skipping 2 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator > >]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied > > >::value’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied > > >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_ > >)>’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/property_map/property_map.hpp:354:5: required from ‘boost::iterator_property_map boost::make_iterator_property_map(RAIter, ID, Value) [with RAIter = __gnu_cxx::__normal_iterator >; Value = void*; ID = adj_list_vertex_property_map >, int, int&, vertex_index_t>]’ ordering.cpp:69:31: required from here /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::Convertible::~Convertible() [with X = std::random_access_iterator_tag; Y = std::forward_iterator_tag]’ 37 | ~model() | ^ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:208:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 208 | BOOST_CONCEPT_USAGE(Convertible) { | ^~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements >]’: /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:208:5: required from ‘struct boost::Convertible’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::Convertible]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied >::value’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_)>’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:573:11: [ skipping 6 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator > >]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied > > >::value’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied > > >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_ > >)>’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/property_map/property_map.hpp:354:5: required from ‘boost::iterator_property_map boost::make_iterator_property_map(RAIter, ID, Value) [with RAIter = __gnu_cxx::__normal_iterator >; Value = void*; ID = adj_list_vertex_property_map >, int, int&, vertex_index_t>]’ ordering.cpp:69:31: required from here /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::Convertible]’ 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ^ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::Convertible]’: /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:573:11: required from ‘boost::BidirectionalIterator::~BidirectionalIterator() [with TT = __gnu_cxx::__normal_iterator >]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/usage.hpp:20:48: required from ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::BidirectionalIterator<__gnu_cxx::__normal_iterator > >]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements > > >]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:571:7: required from ‘struct boost::BidirectionalIterator<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:597:3: [ skipping 2 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator > >]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied > > >::value’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied > > >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_ > >)>’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/property_map/property_map.hpp:354:5: required from ‘boost::iterator_property_map boost::make_iterator_property_map(RAIter, ID, Value) [with RAIter = __gnu_cxx::__normal_iterator >; Value = void*; ID = adj_list_vertex_property_map >, int, int&, vertex_index_t>]’ ordering.cpp:69:31: required from here /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::Convertible::~Convertible() [with X = std::random_access_iterator_tag; Y = std::bidirectional_iterator_tag]’ 37 | ~model() | ^ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:208:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 208 | BOOST_CONCEPT_USAGE(Convertible) { | ^~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::Convertible]’: /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements >]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:208:5: required from ‘struct boost::Convertible’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::Convertible]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied >::value’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_)>’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:603:11: required from ‘boost::RandomAccessIterator::~RandomAccessIterator() [with TT = __gnu_cxx::__normal_iterator >]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:597:3: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator > >]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/property_map/property_map.hpp:354:5: required from ‘boost::iterator_property_map boost::make_iterator_property_map(RAIter, ID, Value) [with RAIter = __gnu_cxx::__normal_iterator >; Value = void*; ID = adj_list_vertex_property_map >, int, int&, vertex_index_t>]’ ordering.cpp:69:31: required from here /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::Convertible::~Convertible() [with X = std::random_access_iterator_tag; Y = std::random_access_iterator_tag]’ 37 | ~model() | ^ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:208:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 208 | BOOST_CONCEPT_USAGE(Convertible) { | ^~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements > > >]’: /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/graph_concepts.hpp:66:5: required from ‘struct boost::concepts::Graph > >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/graph_concepts.hpp:176:1: required from ‘struct boost::concepts::VertexListGraph > >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/graph_concepts.hpp:176:1: required from ‘struct boost::concepts::VertexListGraphConcept > >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::concepts::VertexListGraphConcept > >]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:42:5: [ skipping 2 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_ > >)>’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/isomorphism.hpp:494:5: required from ‘bool boost::isomorphism(const Graph1&, const Graph2&, IsoMapping, Invariant1, Invariant2, std::size_t, IndexMap1, IndexMap2) [with Graph1 = adjacency_list >; Graph2 = adjacency_list >; IsoMapping = iterator_property_map<__gnu_cxx::__normal_iterator >, adj_list_vertex_property_map >, int, int&, vertex_index_t>, void*, void*&>; Invariant1 = degree_vertex_invariant >, int, const int&, vertex_index_t> >, adjacency_list > >; Invariant2 = degree_vertex_invariant >, int, const int&, vertex_index_t> >, adjacency_list > >; IndexMap1 = adj_list_vertex_property_map >, int, const int&, vertex_index_t>; IndexMap2 = adj_list_vertex_property_map >, int, const int&, vertex_index_t>; std::size_t = long unsigned int]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/isomorphism.hpp:651:42: required from ‘bool boost::graph::detail::isomorphism_impl::operator()(const Graph1&, const Graph2&, const ArgPack&) const [with ArgPack = boost::parameter::aux::arg_list >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&> >, boost::parameter::aux::empty_arg_list, std::integral_constant >; Graph1 = boost::adjacency_list >; Graph2 = boost::adjacency_list >]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/isomorphism.hpp:662:5: required from ‘typename boost::result_of(Param0, Param1, const ArgPack&)>::type boost::graph::isomorphism_with_named_params(const Param0&, const Param1&, const ArgPack&) [with Param0 = boost::adjacency_list >; Param1 = boost::adjacency_list >; ArgPack = boost::parameter::aux::arg_list >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&> >, boost::parameter::aux::empty_arg_list, std::integral_constant >; typename boost::result_of(Param0, Param1, const ArgPack&)>::type = bool]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/isomorphism.hpp:666:1: required from ‘typename boost::result_of(Param0, Param1, const typename boost::detail::convert_bgl_params_to_boost_parameter >::type&)>::type boost::isomorphism(const Param0&, const Param1&, const bgl_named_params&) [with Param0 = adjacency_list >; Param1 = adjacency_list >; P = iterator_property_map<__gnu_cxx::__normal_iterator >, adj_list_vertex_property_map >, int, int&, vertex_index_t>, void*, void*&>; T = vertex_isomorphism_t; R = no_property; typename result_of(Param0, Param1, const typename detail::convert_bgl_params_to_boost_parameter >::type&)>::type = bool; typename detail::convert_bgl_params_to_boost_parameter >::type = parameter::aux::arg_list >, adj_list_vertex_property_map >, int, int&, vertex_index_t>, void*, void*&> >, parameter::aux::empty_arg_list, std::integral_constant >]’ ordering.cpp:68:18: required from here /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::concepts::Graph > >]’ 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ^ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements > > >]’: /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/graph_concepts.hpp:182:5: required from ‘struct boost::concepts::VertexListGraph > >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/graph_concepts.hpp:176:1: required from ‘struct boost::concepts::VertexListGraphConcept > >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::concepts::VertexListGraphConcept > >]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied > > >::value’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied > > >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_ > >)>’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/isomorphism.hpp:494:5: required from ‘bool boost::isomorphism(const Graph1&, const Graph2&, IsoMapping, Invariant1, Invariant2, std::size_t, IndexMap1, IndexMap2) [with Graph1 = adjacency_list >; Graph2 = adjacency_list >; IsoMapping = iterator_property_map<__gnu_cxx::__normal_iterator >, adj_list_vertex_property_map >, int, int&, vertex_index_t>, void*, void*&>; Invariant1 = degree_vertex_invariant >, int, const int&, vertex_index_t> >, adjacency_list > >; Invariant2 = degree_vertex_invariant >, int, const int&, vertex_index_t> >, adjacency_list > >; IndexMap1 = adj_list_vertex_property_map >, int, const int&, vertex_index_t>; IndexMap2 = adj_list_vertex_property_map >, int, const int&, vertex_index_t>; std::size_t = long unsigned int]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/isomorphism.hpp:651:42: required from ‘bool boost::graph::detail::isomorphism_impl::operator()(const Graph1&, const Graph2&, const ArgPack&) const [with ArgPack = boost::parameter::aux::arg_list >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&> >, boost::parameter::aux::empty_arg_list, std::integral_constant >; Graph1 = boost::adjacency_list >; Graph2 = boost::adjacency_list >]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/isomorphism.hpp:662:5: required from ‘typename boost::result_of(Param0, Param1, const ArgPack&)>::type boost::graph::isomorphism_with_named_params(const Param0&, const Param1&, const ArgPack&) [with Param0 = boost::adjacency_list >; Param1 = boost::adjacency_list >; ArgPack = boost::parameter::aux::arg_list >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&> >, boost::parameter::aux::empty_arg_list, std::integral_constant >; typename boost::result_of(Param0, Param1, const ArgPack&)>::type = bool]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/isomorphism.hpp:666:1: required from ‘typename boost::result_of(Param0, Param1, const typename boost::detail::convert_bgl_params_to_boost_parameter >::type&)>::type boost::isomorphism(const Param0&, const Param1&, const bgl_named_params&) [with Param0 = adjacency_list >; Param1 = adjacency_list >; P = iterator_property_map<__gnu_cxx::__normal_iterator >, adj_list_vertex_property_map >, int, int&, vertex_index_t>, void*, void*&>; T = vertex_isomorphism_t; R = no_property; typename result_of(Param0, Param1, const typename detail::convert_bgl_params_to_boost_parameter >::type&)>::type = bool; typename detail::convert_bgl_params_to_boost_parameter >::type = parameter::aux::arg_list >, adj_list_vertex_property_map >, int, int&, vertex_index_t>, void*, void*&> >, parameter::aux::empty_arg_list, std::integral_constant >]’ ordering.cpp:68:18: required from here /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::concepts::VertexListGraph > >]’ 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ^ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::VertexListGraphConcept > >]’: /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/isomorphism.hpp:494:5: required from ‘bool boost::isomorphism(const Graph1&, const Graph2&, IsoMapping, Invariant1, Invariant2, std::size_t, IndexMap1, IndexMap2) [with Graph1 = adjacency_list >; Graph2 = adjacency_list >; IsoMapping = iterator_property_map<__gnu_cxx::__normal_iterator >, adj_list_vertex_property_map >, int, int&, vertex_index_t>, void*, void*&>; Invariant1 = degree_vertex_invariant >, int, const int&, vertex_index_t> >, adjacency_list > >; Invariant2 = degree_vertex_invariant >, int, const int&, vertex_index_t> >, adjacency_list > >; IndexMap1 = adj_list_vertex_property_map >, int, const int&, vertex_index_t>; IndexMap2 = adj_list_vertex_property_map >, int, const int&, vertex_index_t>; std::size_t = long unsigned int]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/isomorphism.hpp:651:42: required from ‘bool boost::graph::detail::isomorphism_impl::operator()(const Graph1&, const Graph2&, const ArgPack&) const [with ArgPack = boost::parameter::aux::arg_list >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&> >, boost::parameter::aux::empty_arg_list, std::integral_constant >; Graph1 = boost::adjacency_list >; Graph2 = boost::adjacency_list >]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/isomorphism.hpp:662:5: required from ‘typename boost::result_of(Param0, Param1, const ArgPack&)>::type boost::graph::isomorphism_with_named_params(const Param0&, const Param1&, const ArgPack&) [with Param0 = boost::adjacency_list >; Param1 = boost::adjacency_list >; ArgPack = boost::parameter::aux::arg_list >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&> >, boost::parameter::aux::empty_arg_list, std::integral_constant >; typename boost::result_of(Param0, Param1, const ArgPack&)>::type = bool]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/isomorphism.hpp:666:1: required from ‘typename boost::result_of(Param0, Param1, const typename boost::detail::convert_bgl_params_to_boost_parameter >::type&)>::type boost::isomorphism(const Param0&, const Param1&, const bgl_named_params&) [with Param0 = adjacency_list >; Param1 = adjacency_list >; P = iterator_property_map<__gnu_cxx::__normal_iterator >, adj_list_vertex_property_map >, int, int&, vertex_index_t>, void*, void*&>; T = vertex_isomorphism_t; R = no_property; typename result_of(Param0, Param1, const typename detail::convert_bgl_params_to_boost_parameter >::type&)>::type = bool; typename detail::convert_bgl_params_to_boost_parameter >::type = parameter::aux::arg_list >, adj_list_vertex_property_map >, int, int&, vertex_index_t>, void*, void*&> >, parameter::aux::empty_arg_list, std::integral_constant >]’ ordering.cpp:68:18: required from here /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/graph_concepts.hpp:176:15: note: in a call to non-static member function ‘boost::concepts::VertexListGraphConcept > >::~VertexListGraphConcept()’ 176 | BOOST_concept(VertexListGraph, (G)) : Graph< G > | ^~~~~~~~~~~~~~~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/preprocessor/cat.hpp:29:34: note: in definition of macro ‘BOOST_PP_CAT_I’ 29 | # define BOOST_PP_CAT_I(a, b) a ## b | ^ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/concept_def.hpp:23:12: note: in expansion of macro ‘BOOST_PP_CAT’ 23 | struct BOOST_PP_CAT(name,Concept) \ | ^~~~~~~~~~~~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/graph_concepts.hpp:176:1: note: in expansion of macro ‘BOOST_concept’ 176 | BOOST_concept(VertexListGraph, (G)) : Graph< G > | ^~~~~~~~~~~~~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements > > >]’: /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/graph_concepts.hpp:233:5: required from ‘struct boost::concepts::EdgeListGraph > >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/graph_concepts.hpp:226:1: required from ‘struct boost::concepts::EdgeListGraphConcept > >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::concepts::EdgeListGraphConcept > >]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied > > >::value’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied > > >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_ > >)>’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/isomorphism.hpp:495:5: required from ‘bool boost::isomorphism(const Graph1&, const Graph2&, IsoMapping, Invariant1, Invariant2, std::size_t, IndexMap1, IndexMap2) [with Graph1 = adjacency_list >; Graph2 = adjacency_list >; IsoMapping = iterator_property_map<__gnu_cxx::__normal_iterator >, adj_list_vertex_property_map >, int, int&, vertex_index_t>, void*, void*&>; Invariant1 = degree_vertex_invariant >, int, const int&, vertex_index_t> >, adjacency_list > >; Invariant2 = degree_vertex_invariant >, int, const int&, vertex_index_t> >, adjacency_list > >; IndexMap1 = adj_list_vertex_property_map >, int, const int&, vertex_index_t>; IndexMap2 = adj_list_vertex_property_map >, int, const int&, vertex_index_t>; std::size_t = long unsigned int]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/isomorphism.hpp:651:42: required from ‘bool boost::graph::detail::isomorphism_impl::operator()(const Graph1&, const Graph2&, const ArgPack&) const [with ArgPack = boost::parameter::aux::arg_list >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&> >, boost::parameter::aux::empty_arg_list, std::integral_constant >; Graph1 = boost::adjacency_list >; Graph2 = boost::adjacency_list >]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/isomorphism.hpp:662:5: required from ‘typename boost::result_of(Param0, Param1, const ArgPack&)>::type boost::graph::isomorphism_with_named_params(const Param0&, const Param1&, const ArgPack&) [with Param0 = boost::adjacency_list >; Param1 = boost::adjacency_list >; ArgPack = boost::parameter::aux::arg_list >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&> >, boost::parameter::aux::empty_arg_list, std::integral_constant >; typename boost::result_of(Param0, Param1, const ArgPack&)>::type = bool]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/isomorphism.hpp:666:1: required from ‘typename boost::result_of(Param0, Param1, const typename boost::detail::convert_bgl_params_to_boost_parameter >::type&)>::type boost::isomorphism(const Param0&, const Param1&, const bgl_named_params&) [with Param0 = adjacency_list >; Param1 = adjacency_list >; P = iterator_property_map<__gnu_cxx::__normal_iterator >, adj_list_vertex_property_map >, int, int&, vertex_index_t>, void*, void*&>; T = vertex_isomorphism_t; R = no_property; typename result_of(Param0, Param1, const typename detail::convert_bgl_params_to_boost_parameter >::type&)>::type = bool; typename detail::convert_bgl_params_to_boost_parameter >::type = parameter::aux::arg_list >, adj_list_vertex_property_map >, int, int&, vertex_index_t>, void*, void*&> >, parameter::aux::empty_arg_list, std::integral_constant >]’ ordering.cpp:68:18: required from here /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::concepts::EdgeListGraph > >]’ 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ^ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::EdgeListGraphConcept > >]’: /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/isomorphism.hpp:495:5: required from ‘bool boost::isomorphism(const Graph1&, const Graph2&, IsoMapping, Invariant1, Invariant2, std::size_t, IndexMap1, IndexMap2) [with Graph1 = adjacency_list >; Graph2 = adjacency_list >; IsoMapping = iterator_property_map<__gnu_cxx::__normal_iterator >, adj_list_vertex_property_map >, int, int&, vertex_index_t>, void*, void*&>; Invariant1 = degree_vertex_invariant >, int, const int&, vertex_index_t> >, adjacency_list > >; Invariant2 = degree_vertex_invariant >, int, const int&, vertex_index_t> >, adjacency_list > >; IndexMap1 = adj_list_vertex_property_map >, int, const int&, vertex_index_t>; IndexMap2 = adj_list_vertex_property_map >, int, const int&, vertex_index_t>; std::size_t = long unsigned int]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/isomorphism.hpp:651:42: required from ‘bool boost::graph::detail::isomorphism_impl::operator()(const Graph1&, const Graph2&, const ArgPack&) const [with ArgPack = boost::parameter::aux::arg_list >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&> >, boost::parameter::aux::empty_arg_list, std::integral_constant >; Graph1 = boost::adjacency_list >; Graph2 = boost::adjacency_list >]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/isomorphism.hpp:662:5: required from ‘typename boost::result_of(Param0, Param1, const ArgPack&)>::type boost::graph::isomorphism_with_named_params(const Param0&, const Param1&, const ArgPack&) [with Param0 = boost::adjacency_list >; Param1 = boost::adjacency_list >; ArgPack = boost::parameter::aux::arg_list >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&> >, boost::parameter::aux::empty_arg_list, std::integral_constant >; typename boost::result_of(Param0, Param1, const ArgPack&)>::type = bool]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/isomorphism.hpp:666:1: required from ‘typename boost::result_of(Param0, Param1, const typename boost::detail::convert_bgl_params_to_boost_parameter >::type&)>::type boost::isomorphism(const Param0&, const Param1&, const bgl_named_params&) [with Param0 = adjacency_list >; Param1 = adjacency_list >; P = iterator_property_map<__gnu_cxx::__normal_iterator >, adj_list_vertex_property_map >, int, int&, vertex_index_t>, void*, void*&>; T = vertex_isomorphism_t; R = no_property; typename result_of(Param0, Param1, const typename detail::convert_bgl_params_to_boost_parameter >::type&)>::type = bool; typename detail::convert_bgl_params_to_boost_parameter >::type = parameter::aux::arg_list >, adj_list_vertex_property_map >, int, int&, vertex_index_t>, void*, void*&> >, parameter::aux::empty_arg_list, std::integral_constant >]’ ordering.cpp:68:18: required from here /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/graph_concepts.hpp:226:15: note: in a call to non-static member function ‘boost::concepts::EdgeListGraphConcept > >::~EdgeListGraphConcept()’ 226 | BOOST_concept(EdgeListGraph, (G)) : Graph< G > | ^~~~~~~~~~~~~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/preprocessor/cat.hpp:29:34: note: in definition of macro ‘BOOST_PP_CAT_I’ 29 | # define BOOST_PP_CAT_I(a, b) a ## b | ^ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/concept_def.hpp:23:12: note: in expansion of macro ‘BOOST_PP_CAT’ 23 | struct BOOST_PP_CAT(name,Concept) \ | ^~~~~~~~~~~~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/graph_concepts.hpp:226:1: note: in expansion of macro ‘BOOST_concept’ 226 | BOOST_concept(EdgeListGraph, (G)) : Graph< G > | ^~~~~~~~~~~~~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements >, int, const int&, boost::vertex_index_t> >, boost::adjacency_list > >, long unsigned int, void*> >]’: /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:321:7: required from ‘struct boost::UnaryFunction >, int, const int&, boost::vertex_index_t> >, boost::adjacency_list > >, long unsigned int, void*>’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:454:3: required from ‘struct boost::AdaptableUnaryFunction >, int, const int&, boost::vertex_index_t> >, boost::adjacency_list > >, long unsigned int, void*>’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:454:3: required from ‘struct boost::AdaptableUnaryFunctionConcept >, int, const int&, boost::vertex_index_t> >, boost::adjacency_list > >, long unsigned int, void*>’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::AdaptableUnaryFunctionConcept >, int, const int&, boost::vertex_index_t> >, boost::adjacency_list > >, long unsigned int, void*>]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:42:5: [ skipping 2 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_ >, int, const int&, boost::vertex_index_t> >, boost::adjacency_list > >, long unsigned int, void*>)>’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/isomorphism.hpp:504:5: required from ‘bool boost::isomorphism(const Graph1&, const Graph2&, IsoMapping, Invariant1, Invariant2, std::size_t, IndexMap1, IndexMap2) [with Graph1 = adjacency_list >; Graph2 = adjacency_list >; IsoMapping = iterator_property_map<__gnu_cxx::__normal_iterator >, adj_list_vertex_property_map >, int, int&, vertex_index_t>, void*, void*&>; Invariant1 = degree_vertex_invariant >, int, const int&, vertex_index_t> >, adjacency_list > >; Invariant2 = degree_vertex_invariant >, int, const int&, vertex_index_t> >, adjacency_list > >; IndexMap1 = adj_list_vertex_property_map >, int, const int&, vertex_index_t>; IndexMap2 = adj_list_vertex_property_map >, int, const int&, vertex_index_t>; std::size_t = long unsigned int]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/isomorphism.hpp:651:42: required from ‘bool boost::graph::detail::isomorphism_impl::operator()(const Graph1&, const Graph2&, const ArgPack&) const [with ArgPack = boost::parameter::aux::arg_list >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&> >, boost::parameter::aux::empty_arg_list, std::integral_constant >; Graph1 = boost::adjacency_list >; Graph2 = boost::adjacency_list >]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/isomorphism.hpp:662:5: required from ‘typename boost::result_of(Param0, Param1, const ArgPack&)>::type boost::graph::isomorphism_with_named_params(const Param0&, const Param1&, const ArgPack&) [with Param0 = boost::adjacency_list >; Param1 = boost::adjacency_list >; ArgPack = boost::parameter::aux::arg_list >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&> >, boost::parameter::aux::empty_arg_list, std::integral_constant >; typename boost::result_of(Param0, Param1, const ArgPack&)>::type = bool]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/isomorphism.hpp:666:1: required from ‘typename boost::result_of(Param0, Param1, const typename boost::detail::convert_bgl_params_to_boost_parameter >::type&)>::type boost::isomorphism(const Param0&, const Param1&, const bgl_named_params&) [with Param0 = adjacency_list >; Param1 = adjacency_list >; P = iterator_property_map<__gnu_cxx::__normal_iterator >, adj_list_vertex_property_map >, int, int&, vertex_index_t>, void*, void*&>; T = vertex_isomorphism_t; R = no_property; typename result_of(Param0, Param1, const typename detail::convert_bgl_params_to_boost_parameter >::type&)>::type = bool; typename detail::convert_bgl_params_to_boost_parameter >::type = parameter::aux::arg_list >, adj_list_vertex_property_map >, int, int&, vertex_index_t>, void*, void*&> >, parameter::aux::empty_arg_list, std::integral_constant >]’ ordering.cpp:68:18: required from here /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::UnaryFunction >, int, const int&, boost::vertex_index_t> >, boost::adjacency_list > >, long unsigned int, void*>]’ 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ^ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::AdaptableUnaryFunctionConcept >, int, const int&, boost::vertex_index_t> >, boost::adjacency_list > >, long unsigned int, void*>]’: /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/isomorphism.hpp:504:5: required from ‘bool boost::isomorphism(const Graph1&, const Graph2&, IsoMapping, Invariant1, Invariant2, std::size_t, IndexMap1, IndexMap2) [with Graph1 = adjacency_list >; Graph2 = adjacency_list >; IsoMapping = iterator_property_map<__gnu_cxx::__normal_iterator >, adj_list_vertex_property_map >, int, int&, vertex_index_t>, void*, void*&>; Invariant1 = degree_vertex_invariant >, int, const int&, vertex_index_t> >, adjacency_list > >; Invariant2 = degree_vertex_invariant >, int, const int&, vertex_index_t> >, adjacency_list > >; IndexMap1 = adj_list_vertex_property_map >, int, const int&, vertex_index_t>; IndexMap2 = adj_list_vertex_property_map >, int, const int&, vertex_index_t>; std::size_t = long unsigned int]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/isomorphism.hpp:651:42: required from ‘bool boost::graph::detail::isomorphism_impl::operator()(const Graph1&, const Graph2&, const ArgPack&) const [with ArgPack = boost::parameter::aux::arg_list >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&> >, boost::parameter::aux::empty_arg_list, std::integral_constant >; Graph1 = boost::adjacency_list >; Graph2 = boost::adjacency_list >]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/isomorphism.hpp:662:5: required from ‘typename boost::result_of(Param0, Param1, const ArgPack&)>::type boost::graph::isomorphism_with_named_params(const Param0&, const Param1&, const ArgPack&) [with Param0 = boost::adjacency_list >; Param1 = boost::adjacency_list >; ArgPack = boost::parameter::aux::arg_list >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&> >, boost::parameter::aux::empty_arg_list, std::integral_constant >; typename boost::result_of(Param0, Param1, const ArgPack&)>::type = bool]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/isomorphism.hpp:666:1: required from ‘typename boost::result_of(Param0, Param1, const typename boost::detail::convert_bgl_params_to_boost_parameter >::type&)>::type boost::isomorphism(const Param0&, const Param1&, const bgl_named_params&) [with Param0 = adjacency_list >; Param1 = adjacency_list >; P = iterator_property_map<__gnu_cxx::__normal_iterator >, adj_list_vertex_property_map >, int, int&, vertex_index_t>, void*, void*&>; T = vertex_isomorphism_t; R = no_property; typename result_of(Param0, Param1, const typename detail::convert_bgl_params_to_boost_parameter >::type&)>::type = bool; typename detail::convert_bgl_params_to_boost_parameter >::type = parameter::aux::arg_list >, adj_list_vertex_property_map >, int, int&, vertex_index_t>, void*, void*&> >, parameter::aux::empty_arg_list, std::integral_constant >]’ ordering.cpp:68:18: required from here /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:454:17: note: in a call to non-static member function ‘boost::AdaptableUnaryFunctionConcept >, int, const int&, boost::vertex_index_t> >, boost::adjacency_list > >, long unsigned int, void*>::~AdaptableUnaryFunctionConcept()’ 454 | BOOST_concept(AdaptableUnaryFunction,(Func)(Return)(Arg)) | ^~~~~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/preprocessor/cat.hpp:29:34: note: in definition of macro ‘BOOST_PP_CAT_I’ 29 | # define BOOST_PP_CAT_I(a, b) a ## b | ^ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/concept_def.hpp:23:12: note: in expansion of macro ‘BOOST_PP_CAT’ 23 | struct BOOST_PP_CAT(name,Concept) \ | ^~~~~~~~~~~~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:454:3: note: in expansion of macro ‘BOOST_concept’ 454 | BOOST_concept(AdaptableUnaryFunction,(Func)(Return)(Arg)) | ^~~~~~~~~~~~~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::constraint::failed() [with Model = boost::ReadWritePropertyMapConcept >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&>, void*>]’: /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/depth_first_search.hpp:134:9: required from ‘bool boost::isomorphism(const Graph1&, const Graph2&, IsoMapping, Invariant1, Invariant2, std::size_t, IndexMap1, IndexMap2) [with Graph1 = adjacency_list >; Graph2 = adjacency_list >; IsoMapping = iterator_property_map<__gnu_cxx::__normal_iterator >, adj_list_vertex_property_map >, int, int&, vertex_index_t>, void*, void*&>; Invariant1 = degree_vertex_invariant >, int, const int&, vertex_index_t> >, adjacency_list > >; Invariant2 = degree_vertex_invariant >, int, const int&, vertex_index_t> >, adjacency_list > >; IndexMap1 = adj_list_vertex_property_map >, int, const int&, vertex_index_t>; IndexMap2 = adj_list_vertex_property_map >, int, const int&, vertex_index_t>; std::size_t = long unsigned int]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/isomorphism.hpp:651:42: required from ‘bool boost::graph::detail::isomorphism_impl::operator()(const Graph1&, const Graph2&, const ArgPack&) const [with ArgPack = boost::parameter::aux::arg_list >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&> >, boost::parameter::aux::empty_arg_list, std::integral_constant >; Graph1 = boost::adjacency_list >; Graph2 = boost::adjacency_list >]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/isomorphism.hpp:662:5: required from ‘typename boost::result_of(Param0, Param1, const ArgPack&)>::type boost::graph::isomorphism_with_named_params(const Param0&, const Param1&, const ArgPack&) [with Param0 = boost::adjacency_list >; Param1 = boost::adjacency_list >; ArgPack = boost::parameter::aux::arg_list >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&> >, boost::parameter::aux::empty_arg_list, std::integral_constant >; typename boost::result_of(Param0, Param1, const ArgPack&)>::type = bool]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/isomorphism.hpp:666:1: required from ‘typename boost::result_of(Param0, Param1, const typename boost::detail::convert_bgl_params_to_boost_parameter >::type&)>::type boost::isomorphism(const Param0&, const Param1&, const bgl_named_params&) [with Param0 = adjacency_list >; Param1 = adjacency_list >; P = iterator_property_map<__gnu_cxx::__normal_iterator >, adj_list_vertex_property_map >, int, int&, vertex_index_t>, void*, void*&>; T = vertex_isomorphism_t; R = no_property; typename result_of(Param0, Param1, const typename detail::convert_bgl_params_to_boost_parameter >::type&)>::type = bool; typename detail::convert_bgl_params_to_boost_parameter >::type = parameter::aux::arg_list >, adj_list_vertex_property_map >, int, int&, vertex_index_t>, void*, void*&> >, parameter::aux::empty_arg_list, std::integral_constant >]’ ordering.cpp:68:18: required from here /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:65:52: warning: ‘this’ pointer is null [-Wnonnull] 65 | static void failed() { ((Model*)0)->constraints(); } | ~~~~~~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/property_map/property_map.hpp:205:10: note: in a call to non-static member function ‘void boost::ReadWritePropertyMapConcept::constraints() [with PMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&>; Key = void*]’ 205 | void constraints() { | ^~~~~~~~~~~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::constraint::failed() [with Model = boost::ReadablePropertyMapConcept >, int, const int&, boost::vertex_index_t>, void*>]’: /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/isomorphism.hpp:515:5: required from ‘bool boost::isomorphism(const Graph1&, const Graph2&, IsoMapping, Invariant1, Invariant2, std::size_t, IndexMap1, IndexMap2) [with Graph1 = adjacency_list >; Graph2 = adjacency_list >; IsoMapping = iterator_property_map<__gnu_cxx::__normal_iterator >, adj_list_vertex_property_map >, int, int&, vertex_index_t>, void*, void*&>; Invariant1 = degree_vertex_invariant >, int, const int&, vertex_index_t> >, adjacency_list > >; Invariant2 = degree_vertex_invariant >, int, const int&, vertex_index_t> >, adjacency_list > >; IndexMap1 = adj_list_vertex_property_map >, int, const int&, vertex_index_t>; IndexMap2 = adj_list_vertex_property_map >, int, const int&, vertex_index_t>; std::size_t = long unsigned int]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/isomorphism.hpp:651:42: required from ‘bool boost::graph::detail::isomorphism_impl::operator()(const Graph1&, const Graph2&, const ArgPack&) const [with ArgPack = boost::parameter::aux::arg_list >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&> >, boost::parameter::aux::empty_arg_list, std::integral_constant >; Graph1 = boost::adjacency_list >; Graph2 = boost::adjacency_list >]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/isomorphism.hpp:662:5: required from ‘typename boost::result_of(Param0, Param1, const ArgPack&)>::type boost::graph::isomorphism_with_named_params(const Param0&, const Param1&, const ArgPack&) [with Param0 = boost::adjacency_list >; Param1 = boost::adjacency_list >; ArgPack = boost::parameter::aux::arg_list >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&> >, boost::parameter::aux::empty_arg_list, std::integral_constant >; typename boost::result_of(Param0, Param1, const ArgPack&)>::type = bool]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/isomorphism.hpp:666:1: required from ‘typename boost::result_of(Param0, Param1, const typename boost::detail::convert_bgl_params_to_boost_parameter >::type&)>::type boost::isomorphism(const Param0&, const Param1&, const bgl_named_params&) [with Param0 = adjacency_list >; Param1 = adjacency_list >; P = iterator_property_map<__gnu_cxx::__normal_iterator >, adj_list_vertex_property_map >, int, int&, vertex_index_t>, void*, void*&>; T = vertex_isomorphism_t; R = no_property; typename result_of(Param0, Param1, const typename detail::convert_bgl_params_to_boost_parameter >::type&)>::type = bool; typename detail::convert_bgl_params_to_boost_parameter >::type = parameter::aux::arg_list >, adj_list_vertex_property_map >, int, int&, vertex_index_t>, void*, void*&> >, parameter::aux::empty_arg_list, std::integral_constant >]’ ordering.cpp:68:18: required from here /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:65:52: warning: ‘this’ pointer is null [-Wnonnull] 65 | static void failed() { ((Model*)0)->constraints(); } | ~~~~~~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/property_map/property_map.hpp:147:10: note: in a call to non-static member function ‘void boost::ReadablePropertyMapConcept::constraints() [with PMap = boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>; Key = void*]’ 147 | void constraints() { | ^~~~~~~~~~~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::concepts::Graph >]’: /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements > >]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/graph_concepts.hpp:66:5: required from ‘struct boost::concepts::Graph >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/graph_concepts.hpp:75:1: required from ‘struct boost::concepts::IncidenceGraph >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/graph_concepts.hpp:75:1: required from ‘struct boost::concepts::IncidenceGraphConcept >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:32:62: [ skipping 2 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied > >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_ >)>’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/depth_first_search.hpp:129:9: required from ‘void boost::detail::depth_first_visit_impl(const IncidenceGraph&, typename boost::graph_traits::vertex_descriptor, DFSVisitor&, ColorMap, TerminatorFunc) [with IncidenceGraph = R_adjacency_list; DFSVisitor = boost::dfs_visitor<>; ColorMap = boost::vec_adj_list_vertex_property_map, boost::property, boost::no_property, boost::listS>, boost::adjacency_list, boost::property, boost::no_property, boost::listS>*, boost::default_color_type, boost::default_color_type&, boost::vertex_color_t>; TerminatorFunc = nontruth2; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/depth_first_search.hpp:417:35: required from ‘void boost::depth_first_visit(const IncidenceGraph&, typename graph_traits::vertex_descriptor, DFSVisitor, ColorMap) [with IncidenceGraph = R_adjacency_list; DFSVisitor = dfs_visitor<>; ColorMap = vec_adj_list_vertex_property_map, property, no_property, listS>, adjacency_list, property, no_property, listS>*, default_color_type, default_color_type&, vertex_color_t>; typename graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/cuthill_mckee_ordering.hpp:146:30: required from ‘OutputIterator boost::cuthill_mckee_ordering(const Graph&, OutputIterator, ColorMap, DegreeMap) [with Graph = R_adjacency_list; OutputIterator = std::reverse_iterator<__gnu_cxx::__normal_iterator > >; ColorMap = vec_adj_list_vertex_property_map, property, no_property, listS>, adjacency_list, property, no_property, listS>*, default_color_type, default_color_type&, vertex_color_t>; DegreeMap = degree_property_map >]’ ordering.cpp:98:25: required from here /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::concepts::Graph::~Graph() [with G = R_adjacency_list]’ 37 | ~model() | ^ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/graph_concepts.hpp:66:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 66 | BOOST_CONCEPT_USAGE(Graph) | ^~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::concepts::IncidenceGraph >]’: /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements > >]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/graph_concepts.hpp:87:5: required from ‘struct boost::concepts::IncidenceGraph >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/graph_concepts.hpp:75:1: required from ‘struct boost::concepts::IncidenceGraphConcept >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::concepts::IncidenceGraphConcept >]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied > >::value’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied > >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_ >)>’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/depth_first_search.hpp:129:9: required from ‘void boost::detail::depth_first_visit_impl(const IncidenceGraph&, typename boost::graph_traits::vertex_descriptor, DFSVisitor&, ColorMap, TerminatorFunc) [with IncidenceGraph = R_adjacency_list; DFSVisitor = boost::dfs_visitor<>; ColorMap = boost::vec_adj_list_vertex_property_map, boost::property, boost::no_property, boost::listS>, boost::adjacency_list, boost::property, boost::no_property, boost::listS>*, boost::default_color_type, boost::default_color_type&, boost::vertex_color_t>; TerminatorFunc = nontruth2; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/depth_first_search.hpp:417:35: required from ‘void boost::depth_first_visit(const IncidenceGraph&, typename graph_traits::vertex_descriptor, DFSVisitor, ColorMap) [with IncidenceGraph = R_adjacency_list; DFSVisitor = dfs_visitor<>; ColorMap = vec_adj_list_vertex_property_map, property, no_property, listS>, adjacency_list, property, no_property, listS>*, default_color_type, default_color_type&, vertex_color_t>; typename graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/cuthill_mckee_ordering.hpp:146:30: required from ‘OutputIterator boost::cuthill_mckee_ordering(const Graph&, OutputIterator, ColorMap, DegreeMap) [with Graph = R_adjacency_list; OutputIterator = std::reverse_iterator<__gnu_cxx::__normal_iterator > >; ColorMap = vec_adj_list_vertex_property_map, property, no_property, listS>, adjacency_list, property, no_property, listS>*, default_color_type, default_color_type&, vertex_color_t>; DegreeMap = degree_property_map >]’ ordering.cpp:98:25: required from here /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::concepts::IncidenceGraph::~IncidenceGraph() [with G = R_adjacency_list]’ 37 | ~model() | ^ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/graph_concepts.hpp:87:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 87 | BOOST_CONCEPT_USAGE(IncidenceGraph) | ^~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements > >]’: /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:167:5: required from ‘struct boost::CopyConstructible >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:165:3: required from ‘struct boost::CopyConstructibleConcept >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::CopyConstructibleConcept >]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied > >::value’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied > >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:72:8: [ skipping 4 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied, R_adjacency_list > >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_, R_adjacency_list >)>’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/depth_first_search.hpp:130:9: required from ‘void boost::detail::depth_first_visit_impl(const IncidenceGraph&, typename boost::graph_traits::vertex_descriptor, DFSVisitor&, ColorMap, TerminatorFunc) [with IncidenceGraph = R_adjacency_list; DFSVisitor = boost::dfs_visitor<>; ColorMap = boost::vec_adj_list_vertex_property_map, boost::property, boost::no_property, boost::listS>, boost::adjacency_list, boost::property, boost::no_property, boost::listS>*, boost::default_color_type, boost::default_color_type&, boost::vertex_color_t>; TerminatorFunc = nontruth2; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/depth_first_search.hpp:417:35: required from ‘void boost::depth_first_visit(const IncidenceGraph&, typename graph_traits::vertex_descriptor, DFSVisitor, ColorMap) [with IncidenceGraph = R_adjacency_list; DFSVisitor = dfs_visitor<>; ColorMap = vec_adj_list_vertex_property_map, property, no_property, listS>, adjacency_list, property, no_property, listS>*, default_color_type, default_color_type&, vertex_color_t>; typename graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/cuthill_mckee_ordering.hpp:146:30: required from ‘OutputIterator boost::cuthill_mckee_ordering(const Graph&, OutputIterator, ColorMap, DegreeMap) [with Graph = R_adjacency_list; OutputIterator = std::reverse_iterator<__gnu_cxx::__normal_iterator > >; ColorMap = vec_adj_list_vertex_property_map, property, no_property, listS>, adjacency_list, property, no_property, listS>*, default_color_type, default_color_type&, vertex_color_t>; DegreeMap = degree_property_map >]’ ordering.cpp:98:25: required from here /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::CopyConstructible >]’ 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ^ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::CopyConstructibleConcept >]’: /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/depth_first_search.hpp:41:9: required from ‘void boost::DFSVisitorConcept::constraints() [with Visitor = boost::dfs_visitor<>; Graph = R_adjacency_list]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::DFSVisitorConcept, R_adjacency_list >]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied, R_adjacency_list > >::value’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied, R_adjacency_list > >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_, R_adjacency_list >)>’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/depth_first_search.hpp:130:9: required from ‘void boost::detail::depth_first_visit_impl(const IncidenceGraph&, typename boost::graph_traits::vertex_descriptor, DFSVisitor&, ColorMap, TerminatorFunc) [with IncidenceGraph = R_adjacency_list; DFSVisitor = boost::dfs_visitor<>; ColorMap = boost::vec_adj_list_vertex_property_map, boost::property, boost::no_property, boost::listS>, boost::adjacency_list, boost::property, boost::no_property, boost::listS>*, boost::default_color_type, boost::default_color_type&, boost::vertex_color_t>; TerminatorFunc = nontruth2; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/depth_first_search.hpp:417:35: required from ‘void boost::depth_first_visit(const IncidenceGraph&, typename graph_traits::vertex_descriptor, DFSVisitor, ColorMap) [with IncidenceGraph = R_adjacency_list; DFSVisitor = dfs_visitor<>; ColorMap = vec_adj_list_vertex_property_map, property, no_property, listS>, adjacency_list, property, no_property, listS>*, default_color_type, default_color_type&, vertex_color_t>; typename graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/cuthill_mckee_ordering.hpp:146:30: required from ‘OutputIterator boost::cuthill_mckee_ordering(const Graph&, OutputIterator, ColorMap, DegreeMap) [with Graph = R_adjacency_list; OutputIterator = std::reverse_iterator<__gnu_cxx::__normal_iterator > >; ColorMap = vec_adj_list_vertex_property_map, property, no_property, listS>, adjacency_list, property, no_property, listS>*, default_color_type, default_color_type&, vertex_color_t>; DegreeMap = degree_property_map >]’ ordering.cpp:98:25: required from here /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:165:17: note: in a call to non-static member function ‘boost::CopyConstructibleConcept >::~CopyConstructibleConcept()’ 165 | BOOST_concept(CopyConstructible,(TT)) | ^~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/preprocessor/cat.hpp:29:34: note: in definition of macro ‘BOOST_PP_CAT_I’ 29 | # define BOOST_PP_CAT_I(a, b) a ## b | ^ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/concept_def.hpp:23:12: note: in expansion of macro ‘BOOST_PP_CAT’ 23 | struct BOOST_PP_CAT(name,Concept) \ | ^~~~~~~~~~~~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:165:3: note: in expansion of macro ‘BOOST_concept’ 165 | BOOST_concept(CopyConstructible,(TT)) | ^~~~~~~~~~~~~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::constraint::failed() [with Model = boost::ReadablePropertyMapConcept, boost::property, boost::no_property, boost::listS>, boost::adjacency_list, boost::property, boost::no_property, boost::listS>*, boost::default_color_type, boost::default_color_type&, boost::vertex_color_t>, long unsigned int>]’: /home/omnipath/local/R/4.4-3.20/BH/include/boost/property_map/property_map.hpp:206:7: required from ‘void boost::ReadWritePropertyMapConcept::constraints() [with PMap = boost::vec_adj_list_vertex_property_map, boost::property, boost::no_property, boost::listS>, boost::adjacency_list, boost::property, boost::no_property, boost::listS>*, boost::default_color_type, boost::default_color_type&, boost::vertex_color_t>; Key = long unsigned int]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::ReadWritePropertyMapConcept, boost::property, boost::no_property, boost::listS>, boost::adjacency_list, boost::property, boost::no_property, boost::listS>*, boost::default_color_type, boost::default_color_type&, boost::vertex_color_t>, long unsigned int>]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied, boost::property, boost::no_property, boost::listS>, boost::adjacency_list, boost::property, boost::no_property, boost::listS>*, boost::default_color_type, boost::default_color_type&, boost::vertex_color_t>, long unsigned int> >::value’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied, boost::property, boost::no_property, boost::listS>, boost::adjacency_list, boost::property, boost::no_property, boost::listS>*, boost::default_color_type, boost::default_color_type&, boost::vertex_color_t>, long unsigned int> >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_, boost::property, boost::no_property, boost::listS>, boost::adjacency_list, boost::property, boost::no_property, boost::listS>*, boost::default_color_type, boost::default_color_type&, boost::vertex_color_t>, long unsigned int>)>’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/depth_first_search.hpp:134:9: required from ‘void boost::detail::depth_first_visit_impl(const IncidenceGraph&, typename boost::graph_traits::vertex_descriptor, DFSVisitor&, ColorMap, TerminatorFunc) [with IncidenceGraph = R_adjacency_list; DFSVisitor = boost::dfs_visitor<>; ColorMap = boost::vec_adj_list_vertex_property_map, boost::property, boost::no_property, boost::listS>, boost::adjacency_list, boost::property, boost::no_property, boost::listS>*, boost::default_color_type, boost::default_color_type&, boost::vertex_color_t>; TerminatorFunc = nontruth2; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/depth_first_search.hpp:417:35: required from ‘void boost::depth_first_visit(const IncidenceGraph&, typename graph_traits::vertex_descriptor, DFSVisitor, ColorMap) [with IncidenceGraph = R_adjacency_list; DFSVisitor = dfs_visitor<>; ColorMap = vec_adj_list_vertex_property_map, property, no_property, listS>, adjacency_list, property, no_property, listS>*, default_color_type, default_color_type&, vertex_color_t>; typename graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/cuthill_mckee_ordering.hpp:146:30: required from ‘OutputIterator boost::cuthill_mckee_ordering(const Graph&, OutputIterator, ColorMap, DegreeMap) [with Graph = R_adjacency_list; OutputIterator = std::reverse_iterator<__gnu_cxx::__normal_iterator > >; ColorMap = vec_adj_list_vertex_property_map, property, no_property, listS>, adjacency_list, property, no_property, listS>*, default_color_type, default_color_type&, vertex_color_t>; DegreeMap = degree_property_map >]’ ordering.cpp:98:25: required from here /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:65:52: warning: ‘this’ pointer is null [-Wnonnull] 65 | static void failed() { ((Model*)0)->constraints(); } | ~~~~~~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/property_map/property_map.hpp:147:10: note: in a call to non-static member function ‘void boost::ReadablePropertyMapConcept::constraints() [with PMap = boost::vec_adj_list_vertex_property_map, boost::property, boost::no_property, boost::listS>, boost::adjacency_list, boost::property, boost::no_property, boost::listS>*, boost::default_color_type, boost::default_color_type&, boost::vertex_color_t>; Key = long unsigned int]’ 147 | void constraints() { | ^~~~~~~~~~~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::constraint::failed() [with Model = boost::WritablePropertyMapConcept, boost::property, boost::no_property, boost::listS>, boost::adjacency_list, boost::property, boost::no_property, boost::listS>*, boost::default_color_type, boost::default_color_type&, boost::vertex_color_t>, long unsigned int>]’: /home/omnipath/local/R/4.4-3.20/BH/include/boost/property_map/property_map.hpp:207:7: required from ‘void boost::ReadWritePropertyMapConcept::constraints() [with PMap = boost::vec_adj_list_vertex_property_map, boost::property, boost::no_property, boost::listS>, boost::adjacency_list, boost::property, boost::no_property, boost::listS>*, boost::default_color_type, boost::default_color_type&, boost::vertex_color_t>; Key = long unsigned int]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::ReadWritePropertyMapConcept, boost::property, boost::no_property, boost::listS>, boost::adjacency_list, boost::property, boost::no_property, boost::listS>*, boost::default_color_type, boost::default_color_type&, boost::vertex_color_t>, long unsigned int>]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied, boost::property, boost::no_property, boost::listS>, boost::adjacency_list, boost::property, boost::no_property, boost::listS>*, boost::default_color_type, boost::default_color_type&, boost::vertex_color_t>, long unsigned int> >::value’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied, boost::property, boost::no_property, boost::listS>, boost::adjacency_list, boost::property, boost::no_property, boost::listS>*, boost::default_color_type, boost::default_color_type&, boost::vertex_color_t>, long unsigned int> >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_, boost::property, boost::no_property, boost::listS>, boost::adjacency_list, boost::property, boost::no_property, boost::listS>*, boost::default_color_type, boost::default_color_type&, boost::vertex_color_t>, long unsigned int>)>’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/depth_first_search.hpp:134:9: required from ‘void boost::detail::depth_first_visit_impl(const IncidenceGraph&, typename boost::graph_traits::vertex_descriptor, DFSVisitor&, ColorMap, TerminatorFunc) [with IncidenceGraph = R_adjacency_list; DFSVisitor = boost::dfs_visitor<>; ColorMap = boost::vec_adj_list_vertex_property_map, boost::property, boost::no_property, boost::listS>, boost::adjacency_list, boost::property, boost::no_property, boost::listS>*, boost::default_color_type, boost::default_color_type&, boost::vertex_color_t>; TerminatorFunc = nontruth2; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/depth_first_search.hpp:417:35: required from ‘void boost::depth_first_visit(const IncidenceGraph&, typename graph_traits::vertex_descriptor, DFSVisitor, ColorMap) [with IncidenceGraph = R_adjacency_list; DFSVisitor = dfs_visitor<>; ColorMap = vec_adj_list_vertex_property_map, property, no_property, listS>, adjacency_list, property, no_property, listS>*, default_color_type, default_color_type&, vertex_color_t>; typename graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/cuthill_mckee_ordering.hpp:146:30: required from ‘OutputIterator boost::cuthill_mckee_ordering(const Graph&, OutputIterator, ColorMap, DegreeMap) [with Graph = R_adjacency_list; OutputIterator = std::reverse_iterator<__gnu_cxx::__normal_iterator > >; ColorMap = vec_adj_list_vertex_property_map, property, no_property, listS>, adjacency_list, property, no_property, listS>*, default_color_type, default_color_type&, vertex_color_t>; DegreeMap = degree_property_map >]’ ordering.cpp:98:25: required from here /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:65:52: warning: ‘this’ pointer is null [-Wnonnull] 65 | static void failed() { ((Model*)0)->constraints(); } | ~~~~~~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/property_map/property_map.hpp:179:10: note: in a call to non-static member function ‘void boost::WritablePropertyMapConcept::constraints() [with PMap = boost::vec_adj_list_vertex_property_map, boost::property, boost::no_property, boost::listS>, boost::adjacency_list, boost::property, boost::no_property, boost::listS>*, boost::default_color_type, boost::default_color_type&, boost::vertex_color_t>; Key = long unsigned int]’ 179 | void constraints() { | ^~~~~~~~~~~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements >]’: /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:208:5: required from ‘struct boost::Convertible’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:206:3: required from ‘struct boost::ConvertibleConcept’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::ConvertibleConcept]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied >::value’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:72:8: [ skipping 4 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied, boost::property, boost::no_property, boost::listS>, boost::adjacency_list, boost::property, boost::no_property, boost::listS>*, boost::default_color_type, boost::default_color_type&, boost::vertex_color_t>, long unsigned int> >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_, boost::property, boost::no_property, boost::listS>, boost::adjacency_list, boost::property, boost::no_property, boost::listS>*, boost::default_color_type, boost::default_color_type&, boost::vertex_color_t>, long unsigned int>)>’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/depth_first_search.hpp:134:9: required from ‘void boost::detail::depth_first_visit_impl(const IncidenceGraph&, typename boost::graph_traits::vertex_descriptor, DFSVisitor&, ColorMap, TerminatorFunc) [with IncidenceGraph = R_adjacency_list; DFSVisitor = boost::dfs_visitor<>; ColorMap = boost::vec_adj_list_vertex_property_map, boost::property, boost::no_property, boost::listS>, boost::adjacency_list, boost::property, boost::no_property, boost::listS>*, boost::default_color_type, boost::default_color_type&, boost::vertex_color_t>; TerminatorFunc = nontruth2; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/depth_first_search.hpp:417:35: required from ‘void boost::depth_first_visit(const IncidenceGraph&, typename graph_traits::vertex_descriptor, DFSVisitor, ColorMap) [with IncidenceGraph = R_adjacency_list; DFSVisitor = dfs_visitor<>; ColorMap = vec_adj_list_vertex_property_map, property, no_property, listS>, adjacency_list, property, no_property, listS>*, default_color_type, default_color_type&, vertex_color_t>; typename graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/cuthill_mckee_ordering.hpp:146:30: required from ‘OutputIterator boost::cuthill_mckee_ordering(const Graph&, OutputIterator, ColorMap, DegreeMap) [with Graph = R_adjacency_list; OutputIterator = std::reverse_iterator<__gnu_cxx::__normal_iterator > >; ColorMap = vec_adj_list_vertex_property_map, property, no_property, listS>, adjacency_list, property, no_property, listS>*, default_color_type, default_color_type&, vertex_color_t>; DegreeMap = degree_property_map >]’ ordering.cpp:98:25: required from here /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::Convertible]’ 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ^ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::ConvertibleConcept]’: /home/omnipath/local/R/4.4-3.20/BH/include/boost/property_map/property_map.hpp:208:7: required from ‘void boost::ReadWritePropertyMapConcept::constraints() [with PMap = boost::vec_adj_list_vertex_property_map, boost::property, boost::no_property, boost::listS>, boost::adjacency_list, boost::property, boost::no_property, boost::listS>*, boost::default_color_type, boost::default_color_type&, boost::vertex_color_t>; Key = long unsigned int]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::ReadWritePropertyMapConcept, boost::property, boost::no_property, boost::listS>, boost::adjacency_list, boost::property, boost::no_property, boost::listS>*, boost::default_color_type, boost::default_color_type&, boost::vertex_color_t>, long unsigned int>]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied, boost::property, boost::no_property, boost::listS>, boost::adjacency_list, boost::property, boost::no_property, boost::listS>*, boost::default_color_type, boost::default_color_type&, boost::vertex_color_t>, long unsigned int> >::value’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied, boost::property, boost::no_property, boost::listS>, boost::adjacency_list, boost::property, boost::no_property, boost::listS>*, boost::default_color_type, boost::default_color_type&, boost::vertex_color_t>, long unsigned int> >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_, boost::property, boost::no_property, boost::listS>, boost::adjacency_list, boost::property, boost::no_property, boost::listS>*, boost::default_color_type, boost::default_color_type&, boost::vertex_color_t>, long unsigned int>)>’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/depth_first_search.hpp:134:9: required from ‘void boost::detail::depth_first_visit_impl(const IncidenceGraph&, typename boost::graph_traits::vertex_descriptor, DFSVisitor&, ColorMap, TerminatorFunc) [with IncidenceGraph = R_adjacency_list; DFSVisitor = boost::dfs_visitor<>; ColorMap = boost::vec_adj_list_vertex_property_map, boost::property, boost::no_property, boost::listS>, boost::adjacency_list, boost::property, boost::no_property, boost::listS>*, boost::default_color_type, boost::default_color_type&, boost::vertex_color_t>; TerminatorFunc = nontruth2; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/depth_first_search.hpp:417:35: required from ‘void boost::depth_first_visit(const IncidenceGraph&, typename graph_traits::vertex_descriptor, DFSVisitor, ColorMap) [with IncidenceGraph = R_adjacency_list; DFSVisitor = dfs_visitor<>; ColorMap = vec_adj_list_vertex_property_map, property, no_property, listS>, adjacency_list, property, no_property, listS>*, default_color_type, default_color_type&, vertex_color_t>; typename graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/cuthill_mckee_ordering.hpp:146:30: required from ‘OutputIterator boost::cuthill_mckee_ordering(const Graph&, OutputIterator, ColorMap, DegreeMap) [with Graph = R_adjacency_list; OutputIterator = std::reverse_iterator<__gnu_cxx::__normal_iterator > >; ColorMap = vec_adj_list_vertex_property_map, property, no_property, listS>, adjacency_list, property, no_property, listS>*, default_color_type, default_color_type&, vertex_color_t>; DegreeMap = degree_property_map >]’ ordering.cpp:98:25: required from here /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:206:17: note: in a call to non-static member function ‘boost::ConvertibleConcept::~ConvertibleConcept()’ 206 | BOOST_concept(Convertible,(X)(Y)) | ^~~~~~~~~~~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/preprocessor/cat.hpp:29:34: note: in definition of macro ‘BOOST_PP_CAT_I’ 29 | # define BOOST_PP_CAT_I(a, b) a ## b | ^ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/concept_def.hpp:23:12: note: in expansion of macro ‘BOOST_PP_CAT’ 23 | struct BOOST_PP_CAT(name,Concept) \ | ^~~~~~~~~~~~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:206:3: note: in expansion of macro ‘BOOST_concept’ 206 | BOOST_concept(Convertible,(X)(Y)) | ^~~~~~~~~~~~~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::EqualityComparable]’: /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements >]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:233:5: required from ‘struct boost::EqualityComparable’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/graph_concepts.hpp:502:1: required from ‘struct boost::concepts::ColorValue’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/graph_concepts.hpp:502:1: required from ‘struct boost::concepts::ColorValueConcept’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:32:62: [ skipping 2 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_)>’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/depth_first_search.hpp:136:9: required from ‘void boost::detail::depth_first_visit_impl(const IncidenceGraph&, typename boost::graph_traits::vertex_descriptor, DFSVisitor&, ColorMap, TerminatorFunc) [with IncidenceGraph = R_adjacency_list; DFSVisitor = boost::dfs_visitor<>; ColorMap = boost::vec_adj_list_vertex_property_map, boost::property, boost::no_property, boost::listS>, boost::adjacency_list, boost::property, boost::no_property, boost::listS>*, boost::default_color_type, boost::default_color_type&, boost::vertex_color_t>; TerminatorFunc = nontruth2; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/depth_first_search.hpp:417:35: required from ‘void boost::depth_first_visit(const IncidenceGraph&, typename graph_traits::vertex_descriptor, DFSVisitor, ColorMap) [with IncidenceGraph = R_adjacency_list; DFSVisitor = dfs_visitor<>; ColorMap = vec_adj_list_vertex_property_map, property, no_property, listS>, adjacency_list, property, no_property, listS>*, default_color_type, default_color_type&, vertex_color_t>; typename graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/cuthill_mckee_ordering.hpp:146:30: required from ‘OutputIterator boost::cuthill_mckee_ordering(const Graph&, OutputIterator, ColorMap, DegreeMap) [with Graph = R_adjacency_list; OutputIterator = std::reverse_iterator<__gnu_cxx::__normal_iterator > >; ColorMap = vec_adj_list_vertex_property_map, property, no_property, listS>, adjacency_list, property, no_property, listS>*, default_color_type, default_color_type&, vertex_color_t>; DegreeMap = degree_property_map >]’ ordering.cpp:98:25: required from here /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::EqualityComparable::~EqualityComparable() [with TT = boost::default_color_type]’ 37 | ~model() | ^ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:233:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 233 | BOOST_CONCEPT_USAGE(EqualityComparable) { | ^~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::DefaultConstructible]’: /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements >]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:137:5: required from ‘struct boost::DefaultConstructible’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/graph_concepts.hpp:502:1: required from ‘struct boost::concepts::ColorValue’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/graph_concepts.hpp:502:1: required from ‘struct boost::concepts::ColorValueConcept’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:32:62: [ skipping 2 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_)>’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/depth_first_search.hpp:136:9: required from ‘void boost::detail::depth_first_visit_impl(const IncidenceGraph&, typename boost::graph_traits::vertex_descriptor, DFSVisitor&, ColorMap, TerminatorFunc) [with IncidenceGraph = R_adjacency_list; DFSVisitor = boost::dfs_visitor<>; ColorMap = boost::vec_adj_list_vertex_property_map, boost::property, boost::no_property, boost::listS>, boost::adjacency_list, boost::property, boost::no_property, boost::listS>*, boost::default_color_type, boost::default_color_type&, boost::vertex_color_t>; TerminatorFunc = nontruth2; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/depth_first_search.hpp:417:35: required from ‘void boost::depth_first_visit(const IncidenceGraph&, typename graph_traits::vertex_descriptor, DFSVisitor, ColorMap) [with IncidenceGraph = R_adjacency_list; DFSVisitor = dfs_visitor<>; ColorMap = vec_adj_list_vertex_property_map, property, no_property, listS>, adjacency_list, property, no_property, listS>*, default_color_type, default_color_type&, vertex_color_t>; typename graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/cuthill_mckee_ordering.hpp:146:30: required from ‘OutputIterator boost::cuthill_mckee_ordering(const Graph&, OutputIterator, ColorMap, DegreeMap) [with Graph = R_adjacency_list; OutputIterator = std::reverse_iterator<__gnu_cxx::__normal_iterator > >; ColorMap = vec_adj_list_vertex_property_map, property, no_property, listS>, adjacency_list, property, no_property, listS>*, default_color_type, default_color_type&, vertex_color_t>; DegreeMap = degree_property_map >]’ ordering.cpp:98:25: required from here /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::DefaultConstructible::~DefaultConstructible() [with TT = boost::default_color_type]’ 37 | ~model() | ^ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:137:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 137 | BOOST_CONCEPT_USAGE(DefaultConstructible) { | ^~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::concepts::ColorValue]’: /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements >]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/graph_concepts.hpp:505:5: required from ‘struct boost::concepts::ColorValue’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/graph_concepts.hpp:502:1: required from ‘struct boost::concepts::ColorValueConcept’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::concepts::ColorValueConcept]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied >::value’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_)>’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/depth_first_search.hpp:136:9: required from ‘void boost::detail::depth_first_visit_impl(const IncidenceGraph&, typename boost::graph_traits::vertex_descriptor, DFSVisitor&, ColorMap, TerminatorFunc) [with IncidenceGraph = R_adjacency_list; DFSVisitor = boost::dfs_visitor<>; ColorMap = boost::vec_adj_list_vertex_property_map, boost::property, boost::no_property, boost::listS>, boost::adjacency_list, boost::property, boost::no_property, boost::listS>*, boost::default_color_type, boost::default_color_type&, boost::vertex_color_t>; TerminatorFunc = nontruth2; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/depth_first_search.hpp:417:35: required from ‘void boost::depth_first_visit(const IncidenceGraph&, typename graph_traits::vertex_descriptor, DFSVisitor, ColorMap) [with IncidenceGraph = R_adjacency_list; DFSVisitor = dfs_visitor<>; ColorMap = vec_adj_list_vertex_property_map, property, no_property, listS>, adjacency_list, property, no_property, listS>*, default_color_type, default_color_type&, vertex_color_t>; typename graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/cuthill_mckee_ordering.hpp:146:30: required from ‘OutputIterator boost::cuthill_mckee_ordering(const Graph&, OutputIterator, ColorMap, DegreeMap) [with Graph = R_adjacency_list; OutputIterator = std::reverse_iterator<__gnu_cxx::__normal_iterator > >; ColorMap = vec_adj_list_vertex_property_map, property, no_property, listS>, adjacency_list, property, no_property, listS>*, default_color_type, default_color_type&, vertex_color_t>; DegreeMap = degree_property_map >]’ ordering.cpp:98:25: required from here /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::concepts::ColorValue::~ColorValue() [with C = boost::default_color_type]’ 37 | ~model() | ^ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/graph_concepts.hpp:505:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 505 | BOOST_CONCEPT_USAGE(ColorValue) | ^~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::constraint::failed() [with Model = boost::BFSVisitorConcept > >, boost::sparse::sparse_ordering_queue > >, boost::degree_property_map > >, R_adjacency_list >]’: /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/breadth_first_search.hpp:65:5: required from ‘void boost::breadth_first_visit(const IncidenceGraph&, SourceIterator, SourceIterator, Buffer&, BFSVisitor, ColorMap) [with IncidenceGraph = R_adjacency_list; Buffer = sparse::sparse_ordering_queue > >; BFSVisitor = detail::bfs_rcm_visitor > >, sparse::sparse_ordering_queue > >, degree_property_map > >; ColorMap = vec_adj_list_vertex_property_map, property, no_property, listS>, adjacency_list, property, no_property, listS>*, default_color_type, default_color_type&, vertex_color_t>; SourceIterator = long unsigned int*]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/breadth_first_search.hpp:118:24: required from ‘void boost::breadth_first_visit(const IncidenceGraph&, typename graph_traits::vertex_descriptor, Buffer&, BFSVisitor, ColorMap) [with IncidenceGraph = R_adjacency_list; Buffer = sparse::sparse_ordering_queue > >; BFSVisitor = detail::bfs_rcm_visitor > >, sparse::sparse_ordering_queue > >, degree_property_map > >; ColorMap = vec_adj_list_vertex_property_map, property, no_property, listS>, adjacency_list, property, no_property, listS>*, default_color_type, default_color_type&, vertex_color_t>; typename graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/cuthill_mckee_ordering.hpp:105:28: required from ‘OutputIterator boost::cuthill_mckee_ordering(const Graph&, std::deque::vertex_descriptor, std::allocator::vertex_descriptor> >, OutputIterator, ColorMap, DegreeMap) [with Graph = R_adjacency_list; OutputIterator = std::reverse_iterator<__gnu_cxx::__normal_iterator > >; ColorMap = vec_adj_list_vertex_property_map, property, no_property, listS>, adjacency_list, property, no_property, listS>*, default_color_type, default_color_type&, vertex_color_t>; DegreeMap = degree_property_map >; typename graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/cuthill_mckee_ordering.hpp:157:34: required from ‘OutputIterator boost::cuthill_mckee_ordering(const Graph&, OutputIterator, ColorMap, DegreeMap) [with Graph = R_adjacency_list; OutputIterator = std::reverse_iterator<__gnu_cxx::__normal_iterator > >; ColorMap = vec_adj_list_vertex_property_map, property, no_property, listS>, adjacency_list, property, no_property, listS>*, default_color_type, default_color_type&, vertex_color_t>; DegreeMap = degree_property_map >]’ ordering.cpp:98:25: required from here /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:65:52: warning: ‘this’ pointer is null [-Wnonnull] 65 | static void failed() { ((Model*)0)->constraints(); } | ~~~~~~~~~~~~~~~~~~~~~~~~^~ In file included from /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/detail/sparse_ordering.hpp:20, from /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/cuthill_mckee_ordering.hpp:15, from ordering.cpp:3: /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/breadth_first_search.hpp:37:10: note: in a call to non-static member function ‘void boost::BFSVisitorConcept::constraints() [with Visitor = boost::detail::bfs_rcm_visitor > >, boost::sparse::sparse_ordering_queue > >, boost::degree_property_map > >; Graph = R_adjacency_list]’ 37 | void constraints() | ^~~~~~~~~~~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::Convertible]’: /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements >]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:208:5: required from ‘struct boost::Convertible’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::Convertible]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied >::value’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:72:8: [ skipping 9 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator > >]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied > > >::value’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied > > >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_ > >)>’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/property_map/property_map.hpp:354:5: required from ‘boost::iterator_property_map boost::make_iterator_property_map(RAIter, ID, Value) [with RAIter = __gnu_cxx::__normal_iterator >; Value = void*; ID = adj_list_vertex_property_map >, int, int&, vertex_index_t>]’ ordering.cpp:69:31: required from here /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::Convertible::~Convertible() [with X = std::random_access_iterator_tag; Y = std::input_iterator_tag]’ 37 | ~model() | ^ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:208:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 208 | BOOST_CONCEPT_USAGE(Convertible) { | ^~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::Convertible]’: /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements >]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:208:5: required from ‘struct boost::Convertible’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::Convertible]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied >::value’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:72:8: [ skipping 8 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator > >]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied > > >::value’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied > > >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_ > >)>’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/property_map/property_map.hpp:354:5: required from ‘boost::iterator_property_map boost::make_iterator_property_map(RAIter, ID, Value) [with RAIter = __gnu_cxx::__normal_iterator >; Value = void*; ID = adj_list_vertex_property_map >, int, int&, vertex_index_t>]’ ordering.cpp:69:31: required from here /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::Convertible::~Convertible() [with X = std::random_access_iterator_tag; Y = std::forward_iterator_tag]’ 37 | ~model() | ^ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:208:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 208 | BOOST_CONCEPT_USAGE(Convertible) { | ^~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::Convertible]’: /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements >]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:208:5: required from ‘struct boost::Convertible’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::Convertible]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied >::value’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:72:8: [ skipping 7 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator > >]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied > > >::value’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied > > >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_ > >)>’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/property_map/property_map.hpp:354:5: required from ‘boost::iterator_property_map boost::make_iterator_property_map(RAIter, ID, Value) [with RAIter = __gnu_cxx::__normal_iterator >; Value = void*; ID = adj_list_vertex_property_map >, int, int&, vertex_index_t>]’ ordering.cpp:69:31: required from here /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::Convertible::~Convertible() [with X = std::random_access_iterator_tag; Y = std::bidirectional_iterator_tag]’ 37 | ~model() | ^ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:208:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 208 | BOOST_CONCEPT_USAGE(Convertible) { | ^~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::concepts::Graph > >]’: /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements > > >]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/graph_concepts.hpp:66:5: required from ‘struct boost::concepts::Graph > >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/graph_concepts.hpp:176:1: required from ‘struct boost::concepts::VertexListGraph > >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/graph_concepts.hpp:176:1: required from ‘struct boost::concepts::VertexListGraphConcept > >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::concepts::VertexListGraphConcept > >]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:42:5: [ skipping 2 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_ > >)>’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/isomorphism.hpp:494:5: required from ‘bool boost::isomorphism(const Graph1&, const Graph2&, IsoMapping, Invariant1, Invariant2, std::size_t, IndexMap1, IndexMap2) [with Graph1 = adjacency_list >; Graph2 = adjacency_list >; IsoMapping = iterator_property_map<__gnu_cxx::__normal_iterator >, adj_list_vertex_property_map >, int, int&, vertex_index_t>, void*, void*&>; Invariant1 = degree_vertex_invariant >, int, const int&, vertex_index_t> >, adjacency_list > >; Invariant2 = degree_vertex_invariant >, int, const int&, vertex_index_t> >, adjacency_list > >; IndexMap1 = adj_list_vertex_property_map >, int, const int&, vertex_index_t>; IndexMap2 = adj_list_vertex_property_map >, int, const int&, vertex_index_t>; std::size_t = long unsigned int]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/isomorphism.hpp:651:42: required from ‘bool boost::graph::detail::isomorphism_impl::operator()(const Graph1&, const Graph2&, const ArgPack&) const [with ArgPack = boost::parameter::aux::arg_list >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&> >, boost::parameter::aux::empty_arg_list, std::integral_constant >; Graph1 = boost::adjacency_list >; Graph2 = boost::adjacency_list >]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/isomorphism.hpp:662:5: required from ‘typename boost::result_of(Param0, Param1, const ArgPack&)>::type boost::graph::isomorphism_with_named_params(const Param0&, const Param1&, const ArgPack&) [with Param0 = boost::adjacency_list >; Param1 = boost::adjacency_list >; ArgPack = boost::parameter::aux::arg_list >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&> >, boost::parameter::aux::empty_arg_list, std::integral_constant >; typename boost::result_of(Param0, Param1, const ArgPack&)>::type = bool]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/isomorphism.hpp:666:1: required from ‘typename boost::result_of(Param0, Param1, const typename boost::detail::convert_bgl_params_to_boost_parameter >::type&)>::type boost::isomorphism(const Param0&, const Param1&, const bgl_named_params&) [with Param0 = adjacency_list >; Param1 = adjacency_list >; P = iterator_property_map<__gnu_cxx::__normal_iterator >, adj_list_vertex_property_map >, int, int&, vertex_index_t>, void*, void*&>; T = vertex_isomorphism_t; R = no_property; typename result_of(Param0, Param1, const typename detail::convert_bgl_params_to_boost_parameter >::type&)>::type = bool; typename detail::convert_bgl_params_to_boost_parameter >::type = parameter::aux::arg_list >, adj_list_vertex_property_map >, int, int&, vertex_index_t>, void*, void*&> >, parameter::aux::empty_arg_list, std::integral_constant >]’ ordering.cpp:68:18: required from here /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::concepts::Graph::~Graph() [with G = boost::adjacency_list >]’ 37 | ~model() | ^ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/graph_concepts.hpp:66:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 66 | BOOST_CONCEPT_USAGE(Graph) | ^~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::concepts::VertexListGraph > >]’: /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements > > >]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/graph_concepts.hpp:182:5: required from ‘struct boost::concepts::VertexListGraph > >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/graph_concepts.hpp:176:1: required from ‘struct boost::concepts::VertexListGraphConcept > >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::concepts::VertexListGraphConcept > >]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:42:5: [ skipping 2 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_ > >)>’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/isomorphism.hpp:494:5: required from ‘bool boost::isomorphism(const Graph1&, const Graph2&, IsoMapping, Invariant1, Invariant2, std::size_t, IndexMap1, IndexMap2) [with Graph1 = adjacency_list >; Graph2 = adjacency_list >; IsoMapping = iterator_property_map<__gnu_cxx::__normal_iterator >, adj_list_vertex_property_map >, int, int&, vertex_index_t>, void*, void*&>; Invariant1 = degree_vertex_invariant >, int, const int&, vertex_index_t> >, adjacency_list > >; Invariant2 = degree_vertex_invariant >, int, const int&, vertex_index_t> >, adjacency_list > >; IndexMap1 = adj_list_vertex_property_map >, int, const int&, vertex_index_t>; IndexMap2 = adj_list_vertex_property_map >, int, const int&, vertex_index_t>; std::size_t = long unsigned int]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/isomorphism.hpp:651:42: required from ‘bool boost::graph::detail::isomorphism_impl::operator()(const Graph1&, const Graph2&, const ArgPack&) const [with ArgPack = boost::parameter::aux::arg_list >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&> >, boost::parameter::aux::empty_arg_list, std::integral_constant >; Graph1 = boost::adjacency_list >; Graph2 = boost::adjacency_list >]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/isomorphism.hpp:662:5: required from ‘typename boost::result_of(Param0, Param1, const ArgPack&)>::type boost::graph::isomorphism_with_named_params(const Param0&, const Param1&, const ArgPack&) [with Param0 = boost::adjacency_list >; Param1 = boost::adjacency_list >; ArgPack = boost::parameter::aux::arg_list >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&> >, boost::parameter::aux::empty_arg_list, std::integral_constant >; typename boost::result_of(Param0, Param1, const ArgPack&)>::type = bool]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/isomorphism.hpp:666:1: required from ‘typename boost::result_of(Param0, Param1, const typename boost::detail::convert_bgl_params_to_boost_parameter >::type&)>::type boost::isomorphism(const Param0&, const Param1&, const bgl_named_params&) [with Param0 = adjacency_list >; Param1 = adjacency_list >; P = iterator_property_map<__gnu_cxx::__normal_iterator >, adj_list_vertex_property_map >, int, int&, vertex_index_t>, void*, void*&>; T = vertex_isomorphism_t; R = no_property; typename result_of(Param0, Param1, const typename detail::convert_bgl_params_to_boost_parameter >::type&)>::type = bool; typename detail::convert_bgl_params_to_boost_parameter >::type = parameter::aux::arg_list >, adj_list_vertex_property_map >, int, int&, vertex_index_t>, void*, void*&> >, parameter::aux::empty_arg_list, std::integral_constant >]’ ordering.cpp:68:18: required from here /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::concepts::VertexListGraph::~VertexListGraph() [with G = boost::adjacency_list >]’ 37 | ~model() | ^ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/graph_concepts.hpp:182:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 182 | BOOST_CONCEPT_USAGE(VertexListGraph) | ^~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::concepts::EdgeListGraph > >]’: /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements > > >]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/graph_concepts.hpp:233:5: required from ‘struct boost::concepts::EdgeListGraph > >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/graph_concepts.hpp:226:1: required from ‘struct boost::concepts::EdgeListGraphConcept > >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::concepts::EdgeListGraphConcept > >]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:42:5: [ skipping 2 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_ > >)>’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/isomorphism.hpp:495:5: required from ‘bool boost::isomorphism(const Graph1&, const Graph2&, IsoMapping, Invariant1, Invariant2, std::size_t, IndexMap1, IndexMap2) [with Graph1 = adjacency_list >; Graph2 = adjacency_list >; IsoMapping = iterator_property_map<__gnu_cxx::__normal_iterator >, adj_list_vertex_property_map >, int, int&, vertex_index_t>, void*, void*&>; Invariant1 = degree_vertex_invariant >, int, const int&, vertex_index_t> >, adjacency_list > >; Invariant2 = degree_vertex_invariant >, int, const int&, vertex_index_t> >, adjacency_list > >; IndexMap1 = adj_list_vertex_property_map >, int, const int&, vertex_index_t>; IndexMap2 = adj_list_vertex_property_map >, int, const int&, vertex_index_t>; std::size_t = long unsigned int]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/isomorphism.hpp:651:42: required from ‘bool boost::graph::detail::isomorphism_impl::operator()(const Graph1&, const Graph2&, const ArgPack&) const [with ArgPack = boost::parameter::aux::arg_list >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&> >, boost::parameter::aux::empty_arg_list, std::integral_constant >; Graph1 = boost::adjacency_list >; Graph2 = boost::adjacency_list >]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/isomorphism.hpp:662:5: required from ‘typename boost::result_of(Param0, Param1, const ArgPack&)>::type boost::graph::isomorphism_with_named_params(const Param0&, const Param1&, const ArgPack&) [with Param0 = boost::adjacency_list >; Param1 = boost::adjacency_list >; ArgPack = boost::parameter::aux::arg_list >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&> >, boost::parameter::aux::empty_arg_list, std::integral_constant >; typename boost::result_of(Param0, Param1, const ArgPack&)>::type = bool]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/isomorphism.hpp:666:1: required from ‘typename boost::result_of(Param0, Param1, const typename boost::detail::convert_bgl_params_to_boost_parameter >::type&)>::type boost::isomorphism(const Param0&, const Param1&, const bgl_named_params&) [with Param0 = adjacency_list >; Param1 = adjacency_list >; P = iterator_property_map<__gnu_cxx::__normal_iterator >, adj_list_vertex_property_map >, int, int&, vertex_index_t>, void*, void*&>; T = vertex_isomorphism_t; R = no_property; typename result_of(Param0, Param1, const typename detail::convert_bgl_params_to_boost_parameter >::type&)>::type = bool; typename detail::convert_bgl_params_to_boost_parameter >::type = parameter::aux::arg_list >, adj_list_vertex_property_map >, int, int&, vertex_index_t>, void*, void*&> >, parameter::aux::empty_arg_list, std::integral_constant >]’ ordering.cpp:68:18: required from here /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::concepts::EdgeListGraph::~EdgeListGraph() [with G = boost::adjacency_list >]’ 37 | ~model() | ^ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/graph_concepts.hpp:233:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 233 | BOOST_CONCEPT_USAGE(EdgeListGraph) | ^~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::UnaryFunction >, int, const int&, boost::vertex_index_t> >, boost::adjacency_list > >, long unsigned int, void*>]’: /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements >, int, const int&, boost::vertex_index_t> >, boost::adjacency_list > >, long unsigned int, void*> >]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:321:7: required from ‘struct boost::UnaryFunction >, int, const int&, boost::vertex_index_t> >, boost::adjacency_list > >, long unsigned int, void*>’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:454:3: required from ‘struct boost::AdaptableUnaryFunction >, int, const int&, boost::vertex_index_t> >, boost::adjacency_list > >, long unsigned int, void*>’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:454:3: required from ‘struct boost::AdaptableUnaryFunctionConcept >, int, const int&, boost::vertex_index_t> >, boost::adjacency_list > >, long unsigned int, void*>’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::AdaptableUnaryFunctionConcept >, int, const int&, boost::vertex_index_t> >, boost::adjacency_list > >, long unsigned int, void*>]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:42:5: [ skipping 2 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_ >, int, const int&, boost::vertex_index_t> >, boost::adjacency_list > >, long unsigned int, void*>)>’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/isomorphism.hpp:504:5: required from ‘bool boost::isomorphism(const Graph1&, const Graph2&, IsoMapping, Invariant1, Invariant2, std::size_t, IndexMap1, IndexMap2) [with Graph1 = adjacency_list >; Graph2 = adjacency_list >; IsoMapping = iterator_property_map<__gnu_cxx::__normal_iterator >, adj_list_vertex_property_map >, int, int&, vertex_index_t>, void*, void*&>; Invariant1 = degree_vertex_invariant >, int, const int&, vertex_index_t> >, adjacency_list > >; Invariant2 = degree_vertex_invariant >, int, const int&, vertex_index_t> >, adjacency_list > >; IndexMap1 = adj_list_vertex_property_map >, int, const int&, vertex_index_t>; IndexMap2 = adj_list_vertex_property_map >, int, const int&, vertex_index_t>; std::size_t = long unsigned int]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/isomorphism.hpp:651:42: required from ‘bool boost::graph::detail::isomorphism_impl::operator()(const Graph1&, const Graph2&, const ArgPack&) const [with ArgPack = boost::parameter::aux::arg_list >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&> >, boost::parameter::aux::empty_arg_list, std::integral_constant >; Graph1 = boost::adjacency_list >; Graph2 = boost::adjacency_list >]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/isomorphism.hpp:662:5: required from ‘typename boost::result_of(Param0, Param1, const ArgPack&)>::type boost::graph::isomorphism_with_named_params(const Param0&, const Param1&, const ArgPack&) [with Param0 = boost::adjacency_list >; Param1 = boost::adjacency_list >; ArgPack = boost::parameter::aux::arg_list >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&> >, boost::parameter::aux::empty_arg_list, std::integral_constant >; typename boost::result_of(Param0, Param1, const ArgPack&)>::type = bool]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/isomorphism.hpp:666:1: required from ‘typename boost::result_of(Param0, Param1, const typename boost::detail::convert_bgl_params_to_boost_parameter >::type&)>::type boost::isomorphism(const Param0&, const Param1&, const bgl_named_params&) [with Param0 = adjacency_list >; Param1 = adjacency_list >; P = iterator_property_map<__gnu_cxx::__normal_iterator >, adj_list_vertex_property_map >, int, int&, vertex_index_t>, void*, void*&>; T = vertex_isomorphism_t; R = no_property; typename result_of(Param0, Param1, const typename detail::convert_bgl_params_to_boost_parameter >::type&)>::type = bool; typename detail::convert_bgl_params_to_boost_parameter >::type = parameter::aux::arg_list >, adj_list_vertex_property_map >, int, int&, vertex_index_t>, void*, void*&> >, parameter::aux::empty_arg_list, std::integral_constant >]’ ordering.cpp:68:18: required from here /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::UnaryFunction::~UnaryFunction() [with Func = boost::degree_vertex_invariant >, int, const int&, boost::vertex_index_t> >, boost::adjacency_list > >; Return = long unsigned int; Arg = void*]’ 37 | ~model() | ^ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:321:7: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 321 | BOOST_CONCEPT_USAGE(UnaryFunction) { test(is_void()); } | ^~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::constraint::failed() [with Model = boost::ReadablePropertyMapConcept >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&>, void*>]’: /home/omnipath/local/R/4.4-3.20/BH/include/boost/property_map/property_map.hpp:206:7: required from ‘void boost::ReadWritePropertyMapConcept::constraints() [with PMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&>; Key = void*]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::ReadWritePropertyMapConcept >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&>, void*>]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&>, void*> >::value’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&>, void*> >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_ >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&>, void*>)>’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/depth_first_search.hpp:134:9: required from ‘bool boost::isomorphism(const Graph1&, const Graph2&, IsoMapping, Invariant1, Invariant2, std::size_t, IndexMap1, IndexMap2) [with Graph1 = adjacency_list >; Graph2 = adjacency_list >; IsoMapping = iterator_property_map<__gnu_cxx::__normal_iterator >, adj_list_vertex_property_map >, int, int&, vertex_index_t>, void*, void*&>; Invariant1 = degree_vertex_invariant >, int, const int&, vertex_index_t> >, adjacency_list > >; Invariant2 = degree_vertex_invariant >, int, const int&, vertex_index_t> >, adjacency_list > >; IndexMap1 = adj_list_vertex_property_map >, int, const int&, vertex_index_t>; IndexMap2 = adj_list_vertex_property_map >, int, const int&, vertex_index_t>; std::size_t = long unsigned int]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/isomorphism.hpp:651:42: required from ‘bool boost::graph::detail::isomorphism_impl::operator()(const Graph1&, const Graph2&, const ArgPack&) const [with ArgPack = boost::parameter::aux::arg_list >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&> >, boost::parameter::aux::empty_arg_list, std::integral_constant >; Graph1 = boost::adjacency_list >; Graph2 = boost::adjacency_list >]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/isomorphism.hpp:662:5: required from ‘typename boost::result_of(Param0, Param1, const ArgPack&)>::type boost::graph::isomorphism_with_named_params(const Param0&, const Param1&, const ArgPack&) [with Param0 = boost::adjacency_list >; Param1 = boost::adjacency_list >; ArgPack = boost::parameter::aux::arg_list >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&> >, boost::parameter::aux::empty_arg_list, std::integral_constant >; typename boost::result_of(Param0, Param1, const ArgPack&)>::type = bool]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/isomorphism.hpp:666:1: required from ‘typename boost::result_of(Param0, Param1, const typename boost::detail::convert_bgl_params_to_boost_parameter >::type&)>::type boost::isomorphism(const Param0&, const Param1&, const bgl_named_params&) [with Param0 = adjacency_list >; Param1 = adjacency_list >; P = iterator_property_map<__gnu_cxx::__normal_iterator >, adj_list_vertex_property_map >, int, int&, vertex_index_t>, void*, void*&>; T = vertex_isomorphism_t; R = no_property; typename result_of(Param0, Param1, const typename detail::convert_bgl_params_to_boost_parameter >::type&)>::type = bool; typename detail::convert_bgl_params_to_boost_parameter >::type = parameter::aux::arg_list >, adj_list_vertex_property_map >, int, int&, vertex_index_t>, void*, void*&> >, parameter::aux::empty_arg_list, std::integral_constant >]’ ordering.cpp:68:18: required from here /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:65:52: warning: ‘this’ pointer is null [-Wnonnull] 65 | static void failed() { ((Model*)0)->constraints(); } | ~~~~~~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/property_map/property_map.hpp:147:10: note: in a call to non-static member function ‘void boost::ReadablePropertyMapConcept::constraints() [with PMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&>; Key = void*]’ 147 | void constraints() { | ^~~~~~~~~~~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::constraint::failed() [with Model = boost::WritablePropertyMapConcept >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&>, void*>]’: /home/omnipath/local/R/4.4-3.20/BH/include/boost/property_map/property_map.hpp:207:7: required from ‘void boost::ReadWritePropertyMapConcept::constraints() [with PMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&>; Key = void*]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::ReadWritePropertyMapConcept >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&>, void*>]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&>, void*> >::value’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&>, void*> >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_ >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&>, void*>)>’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/depth_first_search.hpp:134:9: required from ‘bool boost::isomorphism(const Graph1&, const Graph2&, IsoMapping, Invariant1, Invariant2, std::size_t, IndexMap1, IndexMap2) [with Graph1 = adjacency_list >; Graph2 = adjacency_list >; IsoMapping = iterator_property_map<__gnu_cxx::__normal_iterator >, adj_list_vertex_property_map >, int, int&, vertex_index_t>, void*, void*&>; Invariant1 = degree_vertex_invariant >, int, const int&, vertex_index_t> >, adjacency_list > >; Invariant2 = degree_vertex_invariant >, int, const int&, vertex_index_t> >, adjacency_list > >; IndexMap1 = adj_list_vertex_property_map >, int, const int&, vertex_index_t>; IndexMap2 = adj_list_vertex_property_map >, int, const int&, vertex_index_t>; std::size_t = long unsigned int]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/isomorphism.hpp:651:42: required from ‘bool boost::graph::detail::isomorphism_impl::operator()(const Graph1&, const Graph2&, const ArgPack&) const [with ArgPack = boost::parameter::aux::arg_list >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&> >, boost::parameter::aux::empty_arg_list, std::integral_constant >; Graph1 = boost::adjacency_list >; Graph2 = boost::adjacency_list >]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/isomorphism.hpp:662:5: required from ‘typename boost::result_of(Param0, Param1, const ArgPack&)>::type boost::graph::isomorphism_with_named_params(const Param0&, const Param1&, const ArgPack&) [with Param0 = boost::adjacency_list >; Param1 = boost::adjacency_list >; ArgPack = boost::parameter::aux::arg_list >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&> >, boost::parameter::aux::empty_arg_list, std::integral_constant >; typename boost::result_of(Param0, Param1, const ArgPack&)>::type = bool]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/isomorphism.hpp:666:1: required from ‘typename boost::result_of(Param0, Param1, const typename boost::detail::convert_bgl_params_to_boost_parameter >::type&)>::type boost::isomorphism(const Param0&, const Param1&, const bgl_named_params&) [with Param0 = adjacency_list >; Param1 = adjacency_list >; P = iterator_property_map<__gnu_cxx::__normal_iterator >, adj_list_vertex_property_map >, int, int&, vertex_index_t>, void*, void*&>; T = vertex_isomorphism_t; R = no_property; typename result_of(Param0, Param1, const typename detail::convert_bgl_params_to_boost_parameter >::type&)>::type = bool; typename detail::convert_bgl_params_to_boost_parameter >::type = parameter::aux::arg_list >, adj_list_vertex_property_map >, int, int&, vertex_index_t>, void*, void*&> >, parameter::aux::empty_arg_list, std::integral_constant >]’ ordering.cpp:68:18: required from here /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:65:52: warning: ‘this’ pointer is null [-Wnonnull] 65 | static void failed() { ((Model*)0)->constraints(); } | ~~~~~~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/property_map/property_map.hpp:179:10: note: in a call to non-static member function ‘void boost::WritablePropertyMapConcept::constraints() [with PMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&>; Key = void*]’ 179 | void constraints() { | ^~~~~~~~~~~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements >]’: /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:208:5: required from ‘struct boost::Convertible’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:206:3: required from ‘struct boost::ConvertibleConcept’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::ConvertibleConcept]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied >::value’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:72:8: [ skipping 5 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_ >, int, const int&, boost::vertex_index_t>, void*>)>’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/isomorphism.hpp:515:5: required from ‘bool boost::isomorphism(const Graph1&, const Graph2&, IsoMapping, Invariant1, Invariant2, std::size_t, IndexMap1, IndexMap2) [with Graph1 = adjacency_list >; Graph2 = adjacency_list >; IsoMapping = iterator_property_map<__gnu_cxx::__normal_iterator >, adj_list_vertex_property_map >, int, int&, vertex_index_t>, void*, void*&>; Invariant1 = degree_vertex_invariant >, int, const int&, vertex_index_t> >, adjacency_list > >; Invariant2 = degree_vertex_invariant >, int, const int&, vertex_index_t> >, adjacency_list > >; IndexMap1 = adj_list_vertex_property_map >, int, const int&, vertex_index_t>; IndexMap2 = adj_list_vertex_property_map >, int, const int&, vertex_index_t>; std::size_t = long unsigned int]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/isomorphism.hpp:651:42: required from ‘bool boost::graph::detail::isomorphism_impl::operator()(const Graph1&, const Graph2&, const ArgPack&) const [with ArgPack = boost::parameter::aux::arg_list >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&> >, boost::parameter::aux::empty_arg_list, std::integral_constant >; Graph1 = boost::adjacency_list >; Graph2 = boost::adjacency_list >]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/isomorphism.hpp:662:5: required from ‘typename boost::result_of(Param0, Param1, const ArgPack&)>::type boost::graph::isomorphism_with_named_params(const Param0&, const Param1&, const ArgPack&) [with Param0 = boost::adjacency_list >; Param1 = boost::adjacency_list >; ArgPack = boost::parameter::aux::arg_list >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&> >, boost::parameter::aux::empty_arg_list, std::integral_constant >; typename boost::result_of(Param0, Param1, const ArgPack&)>::type = bool]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/isomorphism.hpp:666:1: required from ‘typename boost::result_of(Param0, Param1, const typename boost::detail::convert_bgl_params_to_boost_parameter >::type&)>::type boost::isomorphism(const Param0&, const Param1&, const bgl_named_params&) [with Param0 = adjacency_list >; Param1 = adjacency_list >; P = iterator_property_map<__gnu_cxx::__normal_iterator >, adj_list_vertex_property_map >, int, int&, vertex_index_t>, void*, void*&>; T = vertex_isomorphism_t; R = no_property; typename result_of(Param0, Param1, const typename detail::convert_bgl_params_to_boost_parameter >::type&)>::type = bool; typename detail::convert_bgl_params_to_boost_parameter >::type = parameter::aux::arg_list >, adj_list_vertex_property_map >, int, int&, vertex_index_t>, void*, void*&> >, parameter::aux::empty_arg_list, std::integral_constant >]’ ordering.cpp:68:18: required from here /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::Convertible]’ 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ^ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::ConvertibleConcept]’: /home/omnipath/local/R/4.4-3.20/BH/include/boost/property_map/property_map.hpp:148:7: required from ‘void boost::ReadablePropertyMapConcept::constraints() [with PMap = boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>; Key = void*]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::ReadablePropertyMapConcept >, int, const int&, boost::vertex_index_t>, void*>]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied >, int, const int&, boost::vertex_index_t>, void*> >::value’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied >, int, const int&, boost::vertex_index_t>, void*> >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_ >, int, const int&, boost::vertex_index_t>, void*>)>’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/isomorphism.hpp:515:5: required from ‘bool boost::isomorphism(const Graph1&, const Graph2&, IsoMapping, Invariant1, Invariant2, std::size_t, IndexMap1, IndexMap2) [with Graph1 = adjacency_list >; Graph2 = adjacency_list >; IsoMapping = iterator_property_map<__gnu_cxx::__normal_iterator >, adj_list_vertex_property_map >, int, int&, vertex_index_t>, void*, void*&>; Invariant1 = degree_vertex_invariant >, int, const int&, vertex_index_t> >, adjacency_list > >; Invariant2 = degree_vertex_invariant >, int, const int&, vertex_index_t> >, adjacency_list > >; IndexMap1 = adj_list_vertex_property_map >, int, const int&, vertex_index_t>; IndexMap2 = adj_list_vertex_property_map >, int, const int&, vertex_index_t>; std::size_t = long unsigned int]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/isomorphism.hpp:651:42: required from ‘bool boost::graph::detail::isomorphism_impl::operator()(const Graph1&, const Graph2&, const ArgPack&) const [with ArgPack = boost::parameter::aux::arg_list >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&> >, boost::parameter::aux::empty_arg_list, std::integral_constant >; Graph1 = boost::adjacency_list >; Graph2 = boost::adjacency_list >]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/isomorphism.hpp:662:5: required from ‘typename boost::result_of(Param0, Param1, const ArgPack&)>::type boost::graph::isomorphism_with_named_params(const Param0&, const Param1&, const ArgPack&) [with Param0 = boost::adjacency_list >; Param1 = boost::adjacency_list >; ArgPack = boost::parameter::aux::arg_list >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&> >, boost::parameter::aux::empty_arg_list, std::integral_constant >; typename boost::result_of(Param0, Param1, const ArgPack&)>::type = bool]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/isomorphism.hpp:666:1: required from ‘typename boost::result_of(Param0, Param1, const typename boost::detail::convert_bgl_params_to_boost_parameter >::type&)>::type boost::isomorphism(const Param0&, const Param1&, const bgl_named_params&) [with Param0 = adjacency_list >; Param1 = adjacency_list >; P = iterator_property_map<__gnu_cxx::__normal_iterator >, adj_list_vertex_property_map >, int, int&, vertex_index_t>, void*, void*&>; T = vertex_isomorphism_t; R = no_property; typename result_of(Param0, Param1, const typename detail::convert_bgl_params_to_boost_parameter >::type&)>::type = bool; typename detail::convert_bgl_params_to_boost_parameter >::type = parameter::aux::arg_list >, adj_list_vertex_property_map >, int, int&, vertex_index_t>, void*, void*&> >, parameter::aux::empty_arg_list, std::integral_constant >]’ ordering.cpp:68:18: required from here /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:206:17: note: in a call to non-static member function ‘boost::ConvertibleConcept::~ConvertibleConcept()’ 206 | BOOST_concept(Convertible,(X)(Y)) | ^~~~~~~~~~~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/preprocessor/cat.hpp:29:34: note: in definition of macro ‘BOOST_PP_CAT_I’ 29 | # define BOOST_PP_CAT_I(a, b) a ## b | ^ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/concept_def.hpp:23:12: note: in expansion of macro ‘BOOST_PP_CAT’ 23 | struct BOOST_PP_CAT(name,Concept) \ | ^~~~~~~~~~~~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:206:3: note: in expansion of macro ‘BOOST_concept’ 206 | BOOST_concept(Convertible,(X)(Y)) | ^~~~~~~~~~~~~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements > >, boost::property >*, std::vector > >, boost::property >, std::allocator > >, boost::property > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >]’: /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/graph_concepts.hpp:52:50: required from ‘struct boost::concepts::MultiPassInputIterator > >, boost::property >*, std::vector > >, boost::property >, std::allocator > >, boost::property > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::concepts::MultiPassInputIterator > >, boost::property >*, std::vector > >, boost::property >, std::allocator > >, boost::property > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> >]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied > >, boost::property >*, std::vector > >, boost::property >, std::allocator > >, boost::property > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::value’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied > >, boost::property >*, std::vector > >, boost::property >, std::allocator > >, boost::property > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_ > >, boost::property >*, std::vector > >, boost::property >, std::allocator > >, boost::property > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> >)>’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/graph_concepts.hpp:89:9: required from ‘boost::concepts::IncidenceGraph::~IncidenceGraph() [with G = R_adjacency_list]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/graph_concepts.hpp:75:1: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::IncidenceGraphConcept >]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/depth_first_search.hpp:129:9: required from ‘void boost::detail::depth_first_visit_impl(const IncidenceGraph&, typename boost::graph_traits::vertex_descriptor, DFSVisitor&, ColorMap, TerminatorFunc) [with IncidenceGraph = R_adjacency_list; DFSVisitor = boost::dfs_visitor<>; ColorMap = boost::vec_adj_list_vertex_property_map, boost::property, boost::no_property, boost::listS>, boost::adjacency_list, boost::property, boost::no_property, boost::listS>*, boost::default_color_type, boost::default_color_type&, boost::vertex_color_t>; TerminatorFunc = nontruth2; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/depth_first_search.hpp:417:35: required from ‘void boost::depth_first_visit(const IncidenceGraph&, typename graph_traits::vertex_descriptor, DFSVisitor, ColorMap) [with IncidenceGraph = R_adjacency_list; DFSVisitor = dfs_visitor<>; ColorMap = vec_adj_list_vertex_property_map, property, no_property, listS>, adjacency_list, property, no_property, listS>*, default_color_type, default_color_type&, vertex_color_t>; typename graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/cuthill_mckee_ordering.hpp:146:30: required from ‘OutputIterator boost::cuthill_mckee_ordering(const Graph&, OutputIterator, ColorMap, DegreeMap) [with Graph = R_adjacency_list; OutputIterator = std::reverse_iterator<__gnu_cxx::__normal_iterator > >; ColorMap = vec_adj_list_vertex_property_map, property, no_property, listS>, adjacency_list, property, no_property, listS>*, default_color_type, default_color_type&, vertex_color_t>; DegreeMap = degree_property_map >]’ ordering.cpp:98:25: required from here /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::concepts::MultiPassInputIterator > >, boost::property >*, std::vector > >, boost::property >, std::allocator > >, boost::property > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> >]’ 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ^ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::MultiPassInputIterator > >, boost::property >*, std::vector > >, boost::property >, std::allocator > >, boost::property > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> >]’: /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/graph_concepts.hpp:89:9: required from ‘boost::concepts::IncidenceGraph::~IncidenceGraph() [with G = R_adjacency_list]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/graph_concepts.hpp:75:1: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::IncidenceGraphConcept >]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/depth_first_search.hpp:129:9: required from ‘void boost::detail::depth_first_visit_impl(const IncidenceGraph&, typename boost::graph_traits::vertex_descriptor, DFSVisitor&, ColorMap, TerminatorFunc) [with IncidenceGraph = R_adjacency_list; DFSVisitor = boost::dfs_visitor<>; ColorMap = boost::vec_adj_list_vertex_property_map, boost::property, boost::no_property, boost::listS>, boost::adjacency_list, boost::property, boost::no_property, boost::listS>*, boost::default_color_type, boost::default_color_type&, boost::vertex_color_t>; TerminatorFunc = nontruth2; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/depth_first_search.hpp:417:35: required from ‘void boost::depth_first_visit(const IncidenceGraph&, typename graph_traits::vertex_descriptor, DFSVisitor, ColorMap) [with IncidenceGraph = R_adjacency_list; DFSVisitor = dfs_visitor<>; ColorMap = vec_adj_list_vertex_property_map, property, no_property, listS>, adjacency_list, property, no_property, listS>*, default_color_type, default_color_type&, vertex_color_t>; typename graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/cuthill_mckee_ordering.hpp:146:30: required from ‘OutputIterator boost::cuthill_mckee_ordering(const Graph&, OutputIterator, ColorMap, DegreeMap) [with Graph = R_adjacency_list; OutputIterator = std::reverse_iterator<__gnu_cxx::__normal_iterator > >; ColorMap = vec_adj_list_vertex_property_map, property, no_property, listS>, adjacency_list, property, no_property, listS>*, default_color_type, default_color_type&, vertex_color_t>; DegreeMap = degree_property_map >]’ ordering.cpp:98:25: required from here /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::concepts::MultiPassInputIterator::~MultiPassInputIterator() [with T = boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >, boost::property >*, std::vector > >, boost::property >, std::allocator > >, boost::property > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>]’ 37 | ~model() | ^ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/graph_concepts.hpp:52:50: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 52 | BOOST_concept(MultiPassInputIterator, (T)) { BOOST_CONCEPT_USAGE( | ^~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements > >]’: /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:137:5: required from ‘struct boost::DefaultConstructible >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::DefaultConstructible >]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied > >::value’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied > >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_ >)>’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/graph_concepts.hpp:90:9: required from ‘boost::concepts::IncidenceGraph::~IncidenceGraph() [with G = R_adjacency_list]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/graph_concepts.hpp:75:1: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::IncidenceGraphConcept >]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/depth_first_search.hpp:129:9: required from ‘void boost::detail::depth_first_visit_impl(const IncidenceGraph&, typename boost::graph_traits::vertex_descriptor, DFSVisitor&, ColorMap, TerminatorFunc) [with IncidenceGraph = R_adjacency_list; DFSVisitor = boost::dfs_visitor<>; ColorMap = boost::vec_adj_list_vertex_property_map, boost::property, boost::no_property, boost::listS>, boost::adjacency_list, boost::property, boost::no_property, boost::listS>*, boost::default_color_type, boost::default_color_type&, boost::vertex_color_t>; TerminatorFunc = nontruth2; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/depth_first_search.hpp:417:35: required from ‘void boost::depth_first_visit(const IncidenceGraph&, typename graph_traits::vertex_descriptor, DFSVisitor, ColorMap) [with IncidenceGraph = R_adjacency_list; DFSVisitor = dfs_visitor<>; ColorMap = vec_adj_list_vertex_property_map, property, no_property, listS>, adjacency_list, property, no_property, listS>*, default_color_type, default_color_type&, vertex_color_t>; typename graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/cuthill_mckee_ordering.hpp:146:30: required from ‘OutputIterator boost::cuthill_mckee_ordering(const Graph&, OutputIterator, ColorMap, DegreeMap) [with Graph = R_adjacency_list; OutputIterator = std::reverse_iterator<__gnu_cxx::__normal_iterator > >; ColorMap = vec_adj_list_vertex_property_map, property, no_property, listS>, adjacency_list, property, no_property, listS>*, default_color_type, default_color_type&, vertex_color_t>; DegreeMap = degree_property_map >]’ ordering.cpp:98:25: required from here /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::DefaultConstructible >]’ 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ^ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::DefaultConstructible >]’: /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/graph_concepts.hpp:90:9: required from ‘boost::concepts::IncidenceGraph::~IncidenceGraph() [with G = R_adjacency_list]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/graph_concepts.hpp:75:1: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::IncidenceGraphConcept >]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/depth_first_search.hpp:129:9: required from ‘void boost::detail::depth_first_visit_impl(const IncidenceGraph&, typename boost::graph_traits::vertex_descriptor, DFSVisitor&, ColorMap, TerminatorFunc) [with IncidenceGraph = R_adjacency_list; DFSVisitor = boost::dfs_visitor<>; ColorMap = boost::vec_adj_list_vertex_property_map, boost::property, boost::no_property, boost::listS>, boost::adjacency_list, boost::property, boost::no_property, boost::listS>*, boost::default_color_type, boost::default_color_type&, boost::vertex_color_t>; TerminatorFunc = nontruth2; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/depth_first_search.hpp:417:35: required from ‘void boost::depth_first_visit(const IncidenceGraph&, typename graph_traits::vertex_descriptor, DFSVisitor, ColorMap) [with IncidenceGraph = R_adjacency_list; DFSVisitor = dfs_visitor<>; ColorMap = vec_adj_list_vertex_property_map, property, no_property, listS>, adjacency_list, property, no_property, listS>*, default_color_type, default_color_type&, vertex_color_t>; typename graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/cuthill_mckee_ordering.hpp:146:30: required from ‘OutputIterator boost::cuthill_mckee_ordering(const Graph&, OutputIterator, ColorMap, DegreeMap) [with Graph = R_adjacency_list; OutputIterator = std::reverse_iterator<__gnu_cxx::__normal_iterator > >; ColorMap = vec_adj_list_vertex_property_map, property, no_property, listS>, adjacency_list, property, no_property, listS>*, default_color_type, default_color_type&, vertex_color_t>; DegreeMap = degree_property_map >]’ ordering.cpp:98:25: required from here /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::DefaultConstructible::~DefaultConstructible() [with TT = boost::detail::edge_desc_impl]’ 37 | ~model() | ^ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:137:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 137 | BOOST_CONCEPT_USAGE(DefaultConstructible) { | ^~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements > >]’: /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:233:5: required from ‘struct boost::EqualityComparable >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::EqualityComparable >]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied > >::value’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied > >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_ >)>’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/graph_concepts.hpp:91:9: required from ‘boost::concepts::IncidenceGraph::~IncidenceGraph() [with G = R_adjacency_list]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/graph_concepts.hpp:75:1: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::IncidenceGraphConcept >]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/depth_first_search.hpp:129:9: required from ‘void boost::detail::depth_first_visit_impl(const IncidenceGraph&, typename boost::graph_traits::vertex_descriptor, DFSVisitor&, ColorMap, TerminatorFunc) [with IncidenceGraph = R_adjacency_list; DFSVisitor = boost::dfs_visitor<>; ColorMap = boost::vec_adj_list_vertex_property_map, boost::property, boost::no_property, boost::listS>, boost::adjacency_list, boost::property, boost::no_property, boost::listS>*, boost::default_color_type, boost::default_color_type&, boost::vertex_color_t>; TerminatorFunc = nontruth2; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/depth_first_search.hpp:417:35: required from ‘void boost::depth_first_visit(const IncidenceGraph&, typename graph_traits::vertex_descriptor, DFSVisitor, ColorMap) [with IncidenceGraph = R_adjacency_list; DFSVisitor = dfs_visitor<>; ColorMap = vec_adj_list_vertex_property_map, property, no_property, listS>, adjacency_list, property, no_property, listS>*, default_color_type, default_color_type&, vertex_color_t>; typename graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/cuthill_mckee_ordering.hpp:146:30: required from ‘OutputIterator boost::cuthill_mckee_ordering(const Graph&, OutputIterator, ColorMap, DegreeMap) [with Graph = R_adjacency_list; OutputIterator = std::reverse_iterator<__gnu_cxx::__normal_iterator > >; ColorMap = vec_adj_list_vertex_property_map, property, no_property, listS>, adjacency_list, property, no_property, listS>*, default_color_type, default_color_type&, vertex_color_t>; DegreeMap = degree_property_map >]’ ordering.cpp:98:25: required from here /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::EqualityComparable >]’ 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ^ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::EqualityComparable >]’: /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/graph_concepts.hpp:91:9: required from ‘boost::concepts::IncidenceGraph::~IncidenceGraph() [with G = R_adjacency_list]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/graph_concepts.hpp:75:1: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::IncidenceGraphConcept >]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/depth_first_search.hpp:129:9: required from ‘void boost::detail::depth_first_visit_impl(const IncidenceGraph&, typename boost::graph_traits::vertex_descriptor, DFSVisitor&, ColorMap, TerminatorFunc) [with IncidenceGraph = R_adjacency_list; DFSVisitor = boost::dfs_visitor<>; ColorMap = boost::vec_adj_list_vertex_property_map, boost::property, boost::no_property, boost::listS>, boost::adjacency_list, boost::property, boost::no_property, boost::listS>*, boost::default_color_type, boost::default_color_type&, boost::vertex_color_t>; TerminatorFunc = nontruth2; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/depth_first_search.hpp:417:35: required from ‘void boost::depth_first_visit(const IncidenceGraph&, typename graph_traits::vertex_descriptor, DFSVisitor, ColorMap) [with IncidenceGraph = R_adjacency_list; DFSVisitor = dfs_visitor<>; ColorMap = vec_adj_list_vertex_property_map, property, no_property, listS>, adjacency_list, property, no_property, listS>*, default_color_type, default_color_type&, vertex_color_t>; typename graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/cuthill_mckee_ordering.hpp:146:30: required from ‘OutputIterator boost::cuthill_mckee_ordering(const Graph&, OutputIterator, ColorMap, DegreeMap) [with Graph = R_adjacency_list; OutputIterator = std::reverse_iterator<__gnu_cxx::__normal_iterator > >; ColorMap = vec_adj_list_vertex_property_map, property, no_property, listS>, adjacency_list, property, no_property, listS>*, default_color_type, default_color_type&, vertex_color_t>; DegreeMap = degree_property_map >]’ ordering.cpp:98:25: required from here /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::EqualityComparable::~EqualityComparable() [with TT = boost::detail::edge_desc_impl]’ 37 | ~model() | ^ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:233:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 233 | BOOST_CONCEPT_USAGE(EqualityComparable) { | ^~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements > >]’: /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:145:5: required from ‘struct boost::Assignable >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::Assignable >]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied > >::value’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied > >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_ >)>’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/graph_concepts.hpp:92:9: required from ‘boost::concepts::IncidenceGraph::~IncidenceGraph() [with G = R_adjacency_list]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/graph_concepts.hpp:75:1: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::IncidenceGraphConcept >]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/depth_first_search.hpp:129:9: required from ‘void boost::detail::depth_first_visit_impl(const IncidenceGraph&, typename boost::graph_traits::vertex_descriptor, DFSVisitor&, ColorMap, TerminatorFunc) [with IncidenceGraph = R_adjacency_list; DFSVisitor = boost::dfs_visitor<>; ColorMap = boost::vec_adj_list_vertex_property_map, boost::property, boost::no_property, boost::listS>, boost::adjacency_list, boost::property, boost::no_property, boost::listS>*, boost::default_color_type, boost::default_color_type&, boost::vertex_color_t>; TerminatorFunc = nontruth2; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/depth_first_search.hpp:417:35: required from ‘void boost::depth_first_visit(const IncidenceGraph&, typename graph_traits::vertex_descriptor, DFSVisitor, ColorMap) [with IncidenceGraph = R_adjacency_list; DFSVisitor = dfs_visitor<>; ColorMap = vec_adj_list_vertex_property_map, property, no_property, listS>, adjacency_list, property, no_property, listS>*, default_color_type, default_color_type&, vertex_color_t>; typename graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/cuthill_mckee_ordering.hpp:146:30: required from ‘OutputIterator boost::cuthill_mckee_ordering(const Graph&, OutputIterator, ColorMap, DegreeMap) [with Graph = R_adjacency_list; OutputIterator = std::reverse_iterator<__gnu_cxx::__normal_iterator > >; ColorMap = vec_adj_list_vertex_property_map, property, no_property, listS>, adjacency_list, property, no_property, listS>*, default_color_type, default_color_type&, vertex_color_t>; DegreeMap = degree_property_map >]’ ordering.cpp:98:25: required from here /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::Assignable >]’ 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ^ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::Assignable >]’: /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/graph_concepts.hpp:92:9: required from ‘boost::concepts::IncidenceGraph::~IncidenceGraph() [with G = R_adjacency_list]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/graph_concepts.hpp:75:1: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::IncidenceGraphConcept >]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/depth_first_search.hpp:129:9: required from ‘void boost::detail::depth_first_visit_impl(const IncidenceGraph&, typename boost::graph_traits::vertex_descriptor, DFSVisitor&, ColorMap, TerminatorFunc) [with IncidenceGraph = R_adjacency_list; DFSVisitor = boost::dfs_visitor<>; ColorMap = boost::vec_adj_list_vertex_property_map, boost::property, boost::no_property, boost::listS>, boost::adjacency_list, boost::property, boost::no_property, boost::listS>*, boost::default_color_type, boost::default_color_type&, boost::vertex_color_t>; TerminatorFunc = nontruth2; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/depth_first_search.hpp:417:35: required from ‘void boost::depth_first_visit(const IncidenceGraph&, typename graph_traits::vertex_descriptor, DFSVisitor, ColorMap) [with IncidenceGraph = R_adjacency_list; DFSVisitor = dfs_visitor<>; ColorMap = vec_adj_list_vertex_property_map, property, no_property, listS>, adjacency_list, property, no_property, listS>*, default_color_type, default_color_type&, vertex_color_t>; typename graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/cuthill_mckee_ordering.hpp:146:30: required from ‘OutputIterator boost::cuthill_mckee_ordering(const Graph&, OutputIterator, ColorMap, DegreeMap) [with Graph = R_adjacency_list; OutputIterator = std::reverse_iterator<__gnu_cxx::__normal_iterator > >; ColorMap = vec_adj_list_vertex_property_map, property, no_property, listS>, adjacency_list, property, no_property, listS>*, default_color_type, default_color_type&, vertex_color_t>; DegreeMap = degree_property_map >]’ ordering.cpp:98:25: required from here /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::Assignable::~Assignable() [with TT = boost::detail::edge_desc_impl]’ 37 | ~model() | ^ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:145:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 145 | BOOST_CONCEPT_USAGE(Assignable) { | ^~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements >]’: /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:208:5: required from ‘struct boost::Convertible’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::Convertible]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied >::value’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_)>’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/graph_concepts.hpp:93:9: required from ‘boost::concepts::IncidenceGraph::~IncidenceGraph() [with G = R_adjacency_list]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/graph_concepts.hpp:75:1: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::IncidenceGraphConcept >]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/depth_first_search.hpp:129:9: required from ‘void boost::detail::depth_first_visit_impl(const IncidenceGraph&, typename boost::graph_traits::vertex_descriptor, DFSVisitor&, ColorMap, TerminatorFunc) [with IncidenceGraph = R_adjacency_list; DFSVisitor = boost::dfs_visitor<>; ColorMap = boost::vec_adj_list_vertex_property_map, boost::property, boost::no_property, boost::listS>, boost::adjacency_list, boost::property, boost::no_property, boost::listS>*, boost::default_color_type, boost::default_color_type&, boost::vertex_color_t>; TerminatorFunc = nontruth2; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/depth_first_search.hpp:417:35: required from ‘void boost::depth_first_visit(const IncidenceGraph&, typename graph_traits::vertex_descriptor, DFSVisitor, ColorMap) [with IncidenceGraph = R_adjacency_list; DFSVisitor = dfs_visitor<>; ColorMap = vec_adj_list_vertex_property_map, property, no_property, listS>, adjacency_list, property, no_property, listS>*, default_color_type, default_color_type&, vertex_color_t>; typename graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/cuthill_mckee_ordering.hpp:146:30: required from ‘OutputIterator boost::cuthill_mckee_ordering(const Graph&, OutputIterator, ColorMap, DegreeMap) [with Graph = R_adjacency_list; OutputIterator = std::reverse_iterator<__gnu_cxx::__normal_iterator > >; ColorMap = vec_adj_list_vertex_property_map, property, no_property, listS>, adjacency_list, property, no_property, listS>*, default_color_type, default_color_type&, vertex_color_t>; DegreeMap = degree_property_map >]’ ordering.cpp:98:25: required from here /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::Convertible]’ 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ^ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::Convertible]’: /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/graph_concepts.hpp:93:9: required from ‘boost::concepts::IncidenceGraph::~IncidenceGraph() [with G = R_adjacency_list]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/graph_concepts.hpp:75:1: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::IncidenceGraphConcept >]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/depth_first_search.hpp:129:9: required from ‘void boost::detail::depth_first_visit_impl(const IncidenceGraph&, typename boost::graph_traits::vertex_descriptor, DFSVisitor&, ColorMap, TerminatorFunc) [with IncidenceGraph = R_adjacency_list; DFSVisitor = boost::dfs_visitor<>; ColorMap = boost::vec_adj_list_vertex_property_map, boost::property, boost::no_property, boost::listS>, boost::adjacency_list, boost::property, boost::no_property, boost::listS>*, boost::default_color_type, boost::default_color_type&, boost::vertex_color_t>; TerminatorFunc = nontruth2; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/depth_first_search.hpp:417:35: required from ‘void boost::depth_first_visit(const IncidenceGraph&, typename graph_traits::vertex_descriptor, DFSVisitor, ColorMap) [with IncidenceGraph = R_adjacency_list; DFSVisitor = dfs_visitor<>; ColorMap = vec_adj_list_vertex_property_map, property, no_property, listS>, adjacency_list, property, no_property, listS>*, default_color_type, default_color_type&, vertex_color_t>; typename graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/cuthill_mckee_ordering.hpp:146:30: required from ‘OutputIterator boost::cuthill_mckee_ordering(const Graph&, OutputIterator, ColorMap, DegreeMap) [with Graph = R_adjacency_list; OutputIterator = std::reverse_iterator<__gnu_cxx::__normal_iterator > >; ColorMap = vec_adj_list_vertex_property_map, property, no_property, listS>, adjacency_list, property, no_property, listS>*, default_color_type, default_color_type&, vertex_color_t>; DegreeMap = degree_property_map >]’ ordering.cpp:98:25: required from here /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::Convertible::~Convertible() [with X = boost::undir_adj_list_traversal_tag; Y = boost::incidence_graph_tag]’ 37 | ~model() | ^ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:208:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 208 | BOOST_CONCEPT_USAGE(Convertible) { | ^~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::CopyConstructible >]’: /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements > >]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:167:5: required from ‘struct boost::CopyConstructible >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:165:3: required from ‘struct boost::CopyConstructibleConcept >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::CopyConstructibleConcept >]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied > >::value’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:45:51: [ skipping 5 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied, R_adjacency_list > >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_, R_adjacency_list >)>’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/depth_first_search.hpp:130:9: required from ‘void boost::detail::depth_first_visit_impl(const IncidenceGraph&, typename boost::graph_traits::vertex_descriptor, DFSVisitor&, ColorMap, TerminatorFunc) [with IncidenceGraph = R_adjacency_list; DFSVisitor = boost::dfs_visitor<>; ColorMap = boost::vec_adj_list_vertex_property_map, boost::property, boost::no_property, boost::listS>, boost::adjacency_list, boost::property, boost::no_property, boost::listS>*, boost::default_color_type, boost::default_color_type&, boost::vertex_color_t>; TerminatorFunc = nontruth2; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/depth_first_search.hpp:417:35: required from ‘void boost::depth_first_visit(const IncidenceGraph&, typename graph_traits::vertex_descriptor, DFSVisitor, ColorMap) [with IncidenceGraph = R_adjacency_list; DFSVisitor = dfs_visitor<>; ColorMap = vec_adj_list_vertex_property_map, property, no_property, listS>, adjacency_list, property, no_property, listS>*, default_color_type, default_color_type&, vertex_color_t>; typename graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/cuthill_mckee_ordering.hpp:146:30: required from ‘OutputIterator boost::cuthill_mckee_ordering(const Graph&, OutputIterator, ColorMap, DegreeMap) [with Graph = R_adjacency_list; OutputIterator = std::reverse_iterator<__gnu_cxx::__normal_iterator > >; ColorMap = vec_adj_list_vertex_property_map, property, no_property, listS>, adjacency_list, property, no_property, listS>*, default_color_type, default_color_type&, vertex_color_t>; DegreeMap = degree_property_map >]’ ordering.cpp:98:25: required from here /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::CopyConstructible::~CopyConstructible() [with TT = boost::dfs_visitor<>]’ 37 | ~model() | ^ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:167:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 167 | BOOST_CONCEPT_USAGE(CopyConstructible) { | ^~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements >]’: /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:208:5: required from ‘struct boost::Convertible’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:206:3: required from ‘struct boost::ConvertibleConcept’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::ConvertibleConcept]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied >::value’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:72:8: [ skipping 9 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied, boost::property, boost::no_property, boost::listS>, boost::adjacency_list, boost::property, boost::no_property, boost::listS>*, boost::default_color_type, boost::default_color_type&, boost::vertex_color_t>, long unsigned int> >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_, boost::property, boost::no_property, boost::listS>, boost::adjacency_list, boost::property, boost::no_property, boost::listS>*, boost::default_color_type, boost::default_color_type&, boost::vertex_color_t>, long unsigned int>)>’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/depth_first_search.hpp:134:9: required from ‘void boost::detail::depth_first_visit_impl(const IncidenceGraph&, typename boost::graph_traits::vertex_descriptor, DFSVisitor&, ColorMap, TerminatorFunc) [with IncidenceGraph = R_adjacency_list; DFSVisitor = boost::dfs_visitor<>; ColorMap = boost::vec_adj_list_vertex_property_map, boost::property, boost::no_property, boost::listS>, boost::adjacency_list, boost::property, boost::no_property, boost::listS>*, boost::default_color_type, boost::default_color_type&, boost::vertex_color_t>; TerminatorFunc = nontruth2; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/depth_first_search.hpp:417:35: required from ‘void boost::depth_first_visit(const IncidenceGraph&, typename graph_traits::vertex_descriptor, DFSVisitor, ColorMap) [with IncidenceGraph = R_adjacency_list; DFSVisitor = dfs_visitor<>; ColorMap = vec_adj_list_vertex_property_map, property, no_property, listS>, adjacency_list, property, no_property, listS>*, default_color_type, default_color_type&, vertex_color_t>; typename graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/cuthill_mckee_ordering.hpp:146:30: required from ‘OutputIterator boost::cuthill_mckee_ordering(const Graph&, OutputIterator, ColorMap, DegreeMap) [with Graph = R_adjacency_list; OutputIterator = std::reverse_iterator<__gnu_cxx::__normal_iterator > >; ColorMap = vec_adj_list_vertex_property_map, property, no_property, listS>, adjacency_list, property, no_property, listS>*, default_color_type, default_color_type&, vertex_color_t>; DegreeMap = degree_property_map >]’ ordering.cpp:98:25: required from here /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::Convertible]’ 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ^ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::ConvertibleConcept]’: /home/omnipath/local/R/4.4-3.20/BH/include/boost/property_map/property_map.hpp:180:7: required from ‘void boost::WritablePropertyMapConcept::constraints() [with PMap = boost::vec_adj_list_vertex_property_map, boost::property, boost::no_property, boost::listS>, boost::adjacency_list, boost::property, boost::no_property, boost::listS>*, boost::default_color_type, boost::default_color_type&, boost::vertex_color_t>; Key = long unsigned int]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::WritablePropertyMapConcept, boost::property, boost::no_property, boost::listS>, boost::adjacency_list, boost::property, boost::no_property, boost::listS>*, boost::default_color_type, boost::default_color_type&, boost::vertex_color_t>, long unsigned int>]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied, boost::property, boost::no_property, boost::listS>, boost::adjacency_list, boost::property, boost::no_property, boost::listS>*, boost::default_color_type, boost::default_color_type&, boost::vertex_color_t>, long unsigned int> >::value’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied, boost::property, boost::no_property, boost::listS>, boost::adjacency_list, boost::property, boost::no_property, boost::listS>*, boost::default_color_type, boost::default_color_type&, boost::vertex_color_t>, long unsigned int> >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_, boost::property, boost::no_property, boost::listS>, boost::adjacency_list, boost::property, boost::no_property, boost::listS>*, boost::default_color_type, boost::default_color_type&, boost::vertex_color_t>, long unsigned int>)>’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/property_map/property_map.hpp:207:7: [ skipping 3 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied, boost::property, boost::no_property, boost::listS>, boost::adjacency_list, boost::property, boost::no_property, boost::listS>*, boost::default_color_type, boost::default_color_type&, boost::vertex_color_t>, long unsigned int> >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_, boost::property, boost::no_property, boost::listS>, boost::adjacency_list, boost::property, boost::no_property, boost::listS>*, boost::default_color_type, boost::default_color_type&, boost::vertex_color_t>, long unsigned int>)>’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/depth_first_search.hpp:134:9: required from ‘void boost::detail::depth_first_visit_impl(const IncidenceGraph&, typename boost::graph_traits::vertex_descriptor, DFSVisitor&, ColorMap, TerminatorFunc) [with IncidenceGraph = R_adjacency_list; DFSVisitor = boost::dfs_visitor<>; ColorMap = boost::vec_adj_list_vertex_property_map, boost::property, boost::no_property, boost::listS>, boost::adjacency_list, boost::property, boost::no_property, boost::listS>*, boost::default_color_type, boost::default_color_type&, boost::vertex_color_t>; TerminatorFunc = nontruth2; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/depth_first_search.hpp:417:35: required from ‘void boost::depth_first_visit(const IncidenceGraph&, typename graph_traits::vertex_descriptor, DFSVisitor, ColorMap) [with IncidenceGraph = R_adjacency_list; DFSVisitor = dfs_visitor<>; ColorMap = vec_adj_list_vertex_property_map, property, no_property, listS>, adjacency_list, property, no_property, listS>*, default_color_type, default_color_type&, vertex_color_t>; typename graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/cuthill_mckee_ordering.hpp:146:30: required from ‘OutputIterator boost::cuthill_mckee_ordering(const Graph&, OutputIterator, ColorMap, DegreeMap) [with Graph = R_adjacency_list; OutputIterator = std::reverse_iterator<__gnu_cxx::__normal_iterator > >; ColorMap = vec_adj_list_vertex_property_map, property, no_property, listS>, adjacency_list, property, no_property, listS>*, default_color_type, default_color_type&, vertex_color_t>; DegreeMap = degree_property_map >]’ ordering.cpp:98:25: required from here /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:206:17: note: in a call to non-static member function ‘boost::ConvertibleConcept::~ConvertibleConcept()’ 206 | BOOST_concept(Convertible,(X)(Y)) | ^~~~~~~~~~~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/preprocessor/cat.hpp:29:34: note: in definition of macro ‘BOOST_PP_CAT_I’ 29 | # define BOOST_PP_CAT_I(a, b) a ## b | ^ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/concept_def.hpp:23:12: note: in expansion of macro ‘BOOST_PP_CAT’ 23 | struct BOOST_PP_CAT(name,Concept) \ | ^~~~~~~~~~~~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:206:3: note: in expansion of macro ‘BOOST_concept’ 206 | BOOST_concept(Convertible,(X)(Y)) | ^~~~~~~~~~~~~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::Convertible]’: /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements >]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:208:5: required from ‘struct boost::Convertible’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:206:3: required from ‘struct boost::ConvertibleConcept’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::ConvertibleConcept]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied >::value’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:45:51: [ skipping 5 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied, boost::property, boost::no_property, boost::listS>, boost::adjacency_list, boost::property, boost::no_property, boost::listS>*, boost::default_color_type, boost::default_color_type&, boost::vertex_color_t>, long unsigned int> >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_, boost::property, boost::no_property, boost::listS>, boost::adjacency_list, boost::property, boost::no_property, boost::listS>*, boost::default_color_type, boost::default_color_type&, boost::vertex_color_t>, long unsigned int>)>’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/depth_first_search.hpp:134:9: required from ‘void boost::detail::depth_first_visit_impl(const IncidenceGraph&, typename boost::graph_traits::vertex_descriptor, DFSVisitor&, ColorMap, TerminatorFunc) [with IncidenceGraph = R_adjacency_list; DFSVisitor = boost::dfs_visitor<>; ColorMap = boost::vec_adj_list_vertex_property_map, boost::property, boost::no_property, boost::listS>, boost::adjacency_list, boost::property, boost::no_property, boost::listS>*, boost::default_color_type, boost::default_color_type&, boost::vertex_color_t>; TerminatorFunc = nontruth2; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/depth_first_search.hpp:417:35: required from ‘void boost::depth_first_visit(const IncidenceGraph&, typename graph_traits::vertex_descriptor, DFSVisitor, ColorMap) [with IncidenceGraph = R_adjacency_list; DFSVisitor = dfs_visitor<>; ColorMap = vec_adj_list_vertex_property_map, property, no_property, listS>, adjacency_list, property, no_property, listS>*, default_color_type, default_color_type&, vertex_color_t>; typename graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/cuthill_mckee_ordering.hpp:146:30: required from ‘OutputIterator boost::cuthill_mckee_ordering(const Graph&, OutputIterator, ColorMap, DegreeMap) [with Graph = R_adjacency_list; OutputIterator = std::reverse_iterator<__gnu_cxx::__normal_iterator > >; ColorMap = vec_adj_list_vertex_property_map, property, no_property, listS>, adjacency_list, property, no_property, listS>*, default_color_type, default_color_type&, vertex_color_t>; DegreeMap = degree_property_map >]’ ordering.cpp:98:25: required from here /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::Convertible::~Convertible() [with X = boost::lvalue_property_map_tag; Y = boost::read_write_property_map_tag]’ 37 | ~model() | ^ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:208:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 208 | BOOST_CONCEPT_USAGE(Convertible) { | ^~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements > >, boost::sparse::sparse_ordering_queue > >, boost::degree_property_map > > > >]’: /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:167:5: required from ‘struct boost::CopyConstructible > >, boost::sparse::sparse_ordering_queue > >, boost::degree_property_map > > >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:165:3: required from ‘struct boost::CopyConstructibleConcept > >, boost::sparse::sparse_ordering_queue > >, boost::degree_property_map > > >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::CopyConstructibleConcept > >, boost::sparse::sparse_ordering_queue > >, boost::degree_property_map > > >]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied > >, boost::sparse::sparse_ordering_queue > >, boost::degree_property_map > > > >::value’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied > >, boost::sparse::sparse_ordering_queue > >, boost::degree_property_map > > > >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:72:8: [ skipping 5 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_ > >, boost::sparse::sparse_ordering_queue > >, boost::degree_property_map > >, R_adjacency_list >)>’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/breadth_first_search.hpp:65:5: required from ‘void boost::breadth_first_visit(const IncidenceGraph&, SourceIterator, SourceIterator, Buffer&, BFSVisitor, ColorMap) [with IncidenceGraph = R_adjacency_list; Buffer = sparse::sparse_ordering_queue > >; BFSVisitor = detail::bfs_rcm_visitor > >, sparse::sparse_ordering_queue > >, degree_property_map > >; ColorMap = vec_adj_list_vertex_property_map, property, no_property, listS>, adjacency_list, property, no_property, listS>*, default_color_type, default_color_type&, vertex_color_t>; SourceIterator = long unsigned int*]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/breadth_first_search.hpp:118:24: required from ‘void boost::breadth_first_visit(const IncidenceGraph&, typename graph_traits::vertex_descriptor, Buffer&, BFSVisitor, ColorMap) [with IncidenceGraph = R_adjacency_list; Buffer = sparse::sparse_ordering_queue > >; BFSVisitor = detail::bfs_rcm_visitor > >, sparse::sparse_ordering_queue > >, degree_property_map > >; ColorMap = vec_adj_list_vertex_property_map, property, no_property, listS>, adjacency_list, property, no_property, listS>*, default_color_type, default_color_type&, vertex_color_t>; typename graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/cuthill_mckee_ordering.hpp:105:28: required from ‘OutputIterator boost::cuthill_mckee_ordering(const Graph&, std::deque::vertex_descriptor, std::allocator::vertex_descriptor> >, OutputIterator, ColorMap, DegreeMap) [with Graph = R_adjacency_list; OutputIterator = std::reverse_iterator<__gnu_cxx::__normal_iterator > >; ColorMap = vec_adj_list_vertex_property_map, property, no_property, listS>, adjacency_list, property, no_property, listS>*, default_color_type, default_color_type&, vertex_color_t>; DegreeMap = degree_property_map >; typename graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/cuthill_mckee_ordering.hpp:157:34: required from ‘OutputIterator boost::cuthill_mckee_ordering(const Graph&, OutputIterator, ColorMap, DegreeMap) [with Graph = R_adjacency_list; OutputIterator = std::reverse_iterator<__gnu_cxx::__normal_iterator > >; ColorMap = vec_adj_list_vertex_property_map, property, no_property, listS>, adjacency_list, property, no_property, listS>*, default_color_type, default_color_type&, vertex_color_t>; DegreeMap = degree_property_map >]’ ordering.cpp:98:25: required from here /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::CopyConstructible > >, boost::sparse::sparse_ordering_queue > >, boost::degree_property_map > > >]’ 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ^ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::CopyConstructibleConcept > >, boost::sparse::sparse_ordering_queue > >, boost::degree_property_map > > >]’: /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/depth_first_search.hpp:41:9: required from ‘void boost::BFSVisitorConcept::constraints() [with Visitor = boost::detail::bfs_rcm_visitor > >, boost::sparse::sparse_ordering_queue > >, boost::degree_property_map > >; Graph = R_adjacency_list]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::BFSVisitorConcept > >, boost::sparse::sparse_ordering_queue > >, boost::degree_property_map > >, R_adjacency_list >]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied > >, boost::sparse::sparse_ordering_queue > >, boost::degree_property_map > >, R_adjacency_list > >::value’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied > >, boost::sparse::sparse_ordering_queue > >, boost::degree_property_map > >, R_adjacency_list > >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_ > >, boost::sparse::sparse_ordering_queue > >, boost::degree_property_map > >, R_adjacency_list >)>’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/breadth_first_search.hpp:65:5: required from ‘void boost::breadth_first_visit(const IncidenceGraph&, SourceIterator, SourceIterator, Buffer&, BFSVisitor, ColorMap) [with IncidenceGraph = R_adjacency_list; Buffer = sparse::sparse_ordering_queue > >; BFSVisitor = detail::bfs_rcm_visitor > >, sparse::sparse_ordering_queue > >, degree_property_map > >; ColorMap = vec_adj_list_vertex_property_map, property, no_property, listS>, adjacency_list, property, no_property, listS>*, default_color_type, default_color_type&, vertex_color_t>; SourceIterator = long unsigned int*]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/breadth_first_search.hpp:118:24: required from ‘void boost::breadth_first_visit(const IncidenceGraph&, typename graph_traits::vertex_descriptor, Buffer&, BFSVisitor, ColorMap) [with IncidenceGraph = R_adjacency_list; Buffer = sparse::sparse_ordering_queue > >; BFSVisitor = detail::bfs_rcm_visitor > >, sparse::sparse_ordering_queue > >, degree_property_map > >; ColorMap = vec_adj_list_vertex_property_map, property, no_property, listS>, adjacency_list, property, no_property, listS>*, default_color_type, default_color_type&, vertex_color_t>; typename graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/cuthill_mckee_ordering.hpp:105:28: required from ‘OutputIterator boost::cuthill_mckee_ordering(const Graph&, std::deque::vertex_descriptor, std::allocator::vertex_descriptor> >, OutputIterator, ColorMap, DegreeMap) [with Graph = R_adjacency_list; OutputIterator = std::reverse_iterator<__gnu_cxx::__normal_iterator > >; ColorMap = vec_adj_list_vertex_property_map, property, no_property, listS>, adjacency_list, property, no_property, listS>*, default_color_type, default_color_type&, vertex_color_t>; DegreeMap = degree_property_map >; typename graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/cuthill_mckee_ordering.hpp:157:34: required from ‘OutputIterator boost::cuthill_mckee_ordering(const Graph&, OutputIterator, ColorMap, DegreeMap) [with Graph = R_adjacency_list; OutputIterator = std::reverse_iterator<__gnu_cxx::__normal_iterator > >; ColorMap = vec_adj_list_vertex_property_map, property, no_property, listS>, adjacency_list, property, no_property, listS>*, default_color_type, default_color_type&, vertex_color_t>; DegreeMap = degree_property_map >]’ ordering.cpp:98:25: required from here /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:165:17: note: in a call to non-static member function ‘boost::CopyConstructibleConcept > >, boost::sparse::sparse_ordering_queue > >, boost::degree_property_map > > >::~CopyConstructibleConcept()’ 165 | BOOST_concept(CopyConstructible,(TT)) | ^~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/preprocessor/cat.hpp:29:34: note: in definition of macro ‘BOOST_PP_CAT_I’ 29 | # define BOOST_PP_CAT_I(a, b) a ## b | ^ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/concept_def.hpp:23:12: note: in expansion of macro ‘BOOST_PP_CAT’ 23 | struct BOOST_PP_CAT(name,Concept) \ | ^~~~~~~~~~~~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:165:3: note: in expansion of macro ‘BOOST_concept’ 165 | BOOST_concept(CopyConstructible,(TT)) | ^~~~~~~~~~~~~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements > >]’: /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/graph_concepts.hpp:52:50: required from ‘struct boost::concepts::MultiPassInputIterator >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::concepts::MultiPassInputIterator >]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied > >::value’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied > >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:72:8: [ skipping 2 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/graph_concepts.hpp:176:1: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::VertexListGraphConcept > >]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/isomorphism.hpp:494:5: required from ‘bool boost::isomorphism(const Graph1&, const Graph2&, IsoMapping, Invariant1, Invariant2, std::size_t, IndexMap1, IndexMap2) [with Graph1 = adjacency_list >; Graph2 = adjacency_list >; IsoMapping = iterator_property_map<__gnu_cxx::__normal_iterator >, adj_list_vertex_property_map >, int, int&, vertex_index_t>, void*, void*&>; Invariant1 = degree_vertex_invariant >, int, const int&, vertex_index_t> >, adjacency_list > >; Invariant2 = degree_vertex_invariant >, int, const int&, vertex_index_t> >, adjacency_list > >; IndexMap1 = adj_list_vertex_property_map >, int, const int&, vertex_index_t>; IndexMap2 = adj_list_vertex_property_map >, int, const int&, vertex_index_t>; std::size_t = long unsigned int]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/isomorphism.hpp:651:42: required from ‘bool boost::graph::detail::isomorphism_impl::operator()(const Graph1&, const Graph2&, const ArgPack&) const [with ArgPack = boost::parameter::aux::arg_list >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&> >, boost::parameter::aux::empty_arg_list, std::integral_constant >; Graph1 = boost::adjacency_list >; Graph2 = boost::adjacency_list >]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/isomorphism.hpp:662:5: required from ‘typename boost::result_of(Param0, Param1, const ArgPack&)>::type boost::graph::isomorphism_with_named_params(const Param0&, const Param1&, const ArgPack&) [with Param0 = boost::adjacency_list >; Param1 = boost::adjacency_list >; ArgPack = boost::parameter::aux::arg_list >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&> >, boost::parameter::aux::empty_arg_list, std::integral_constant >; typename boost::result_of(Param0, Param1, const ArgPack&)>::type = bool]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/isomorphism.hpp:666:1: required from ‘typename boost::result_of(Param0, Param1, const typename boost::detail::convert_bgl_params_to_boost_parameter >::type&)>::type boost::isomorphism(const Param0&, const Param1&, const bgl_named_params&) [with Param0 = adjacency_list >; Param1 = adjacency_list >; P = iterator_property_map<__gnu_cxx::__normal_iterator >, adj_list_vertex_property_map >, int, int&, vertex_index_t>, void*, void*&>; T = vertex_isomorphism_t; R = no_property; typename result_of(Param0, Param1, const typename detail::convert_bgl_params_to_boost_parameter >::type&)>::type = bool; typename detail::convert_bgl_params_to_boost_parameter >::type = parameter::aux::arg_list >, adj_list_vertex_property_map >, int, int&, vertex_index_t>, void*, void*&> >, parameter::aux::empty_arg_list, std::integral_constant >]’ ordering.cpp:68:18: required from here /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::concepts::MultiPassInputIterator >]’ 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ^ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::MultiPassInputIterator >]’: /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/graph_concepts.hpp:184:9: required from ‘boost::concepts::VertexListGraph::~VertexListGraph() [with G = boost::adjacency_list >]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/graph_concepts.hpp:176:1: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::VertexListGraphConcept > >]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/isomorphism.hpp:494:5: required from ‘bool boost::isomorphism(const Graph1&, const Graph2&, IsoMapping, Invariant1, Invariant2, std::size_t, IndexMap1, IndexMap2) [with Graph1 = adjacency_list >; Graph2 = adjacency_list >; IsoMapping = iterator_property_map<__gnu_cxx::__normal_iterator >, adj_list_vertex_property_map >, int, int&, vertex_index_t>, void*, void*&>; Invariant1 = degree_vertex_invariant >, int, const int&, vertex_index_t> >, adjacency_list > >; Invariant2 = degree_vertex_invariant >, int, const int&, vertex_index_t> >, adjacency_list > >; IndexMap1 = adj_list_vertex_property_map >, int, const int&, vertex_index_t>; IndexMap2 = adj_list_vertex_property_map >, int, const int&, vertex_index_t>; std::size_t = long unsigned int]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/isomorphism.hpp:651:42: required from ‘bool boost::graph::detail::isomorphism_impl::operator()(const Graph1&, const Graph2&, const ArgPack&) const [with ArgPack = boost::parameter::aux::arg_list >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&> >, boost::parameter::aux::empty_arg_list, std::integral_constant >; Graph1 = boost::adjacency_list >; Graph2 = boost::adjacency_list >]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/isomorphism.hpp:662:5: required from ‘typename boost::result_of(Param0, Param1, const ArgPack&)>::type boost::graph::isomorphism_with_named_params(const Param0&, const Param1&, const ArgPack&) [with Param0 = boost::adjacency_list >; Param1 = boost::adjacency_list >; ArgPack = boost::parameter::aux::arg_list >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&> >, boost::parameter::aux::empty_arg_list, std::integral_constant >; typename boost::result_of(Param0, Param1, const ArgPack&)>::type = bool]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/isomorphism.hpp:666:1: required from ‘typename boost::result_of(Param0, Param1, const typename boost::detail::convert_bgl_params_to_boost_parameter >::type&)>::type boost::isomorphism(const Param0&, const Param1&, const bgl_named_params&) [with Param0 = adjacency_list >; Param1 = adjacency_list >; P = iterator_property_map<__gnu_cxx::__normal_iterator >, adj_list_vertex_property_map >, int, int&, vertex_index_t>, void*, void*&>; T = vertex_isomorphism_t; R = no_property; typename result_of(Param0, Param1, const typename detail::convert_bgl_params_to_boost_parameter >::type&)>::type = bool; typename detail::convert_bgl_params_to_boost_parameter >::type = parameter::aux::arg_list >, adj_list_vertex_property_map >, int, int&, vertex_index_t>, void*, void*&> >, parameter::aux::empty_arg_list, std::integral_constant >]’ ordering.cpp:68:18: required from here /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::concepts::MultiPassInputIterator::~MultiPassInputIterator() [with T = std::_List_iterator]’ 37 | ~model() | ^ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/graph_concepts.hpp:52:50: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 52 | BOOST_concept(MultiPassInputIterator, (T)) { BOOST_CONCEPT_USAGE( | ^~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements >]’: /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:208:5: required from ‘struct boost::Convertible’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::Convertible]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied >::value’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:72:8: [ skipping 2 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/graph_concepts.hpp:176:1: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::VertexListGraphConcept > >]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/isomorphism.hpp:494:5: required from ‘bool boost::isomorphism(const Graph1&, const Graph2&, IsoMapping, Invariant1, Invariant2, std::size_t, IndexMap1, IndexMap2) [with Graph1 = adjacency_list >; Graph2 = adjacency_list >; IsoMapping = iterator_property_map<__gnu_cxx::__normal_iterator >, adj_list_vertex_property_map >, int, int&, vertex_index_t>, void*, void*&>; Invariant1 = degree_vertex_invariant >, int, const int&, vertex_index_t> >, adjacency_list > >; Invariant2 = degree_vertex_invariant >, int, const int&, vertex_index_t> >, adjacency_list > >; IndexMap1 = adj_list_vertex_property_map >, int, const int&, vertex_index_t>; IndexMap2 = adj_list_vertex_property_map >, int, const int&, vertex_index_t>; std::size_t = long unsigned int]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/isomorphism.hpp:651:42: required from ‘bool boost::graph::detail::isomorphism_impl::operator()(const Graph1&, const Graph2&, const ArgPack&) const [with ArgPack = boost::parameter::aux::arg_list >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&> >, boost::parameter::aux::empty_arg_list, std::integral_constant >; Graph1 = boost::adjacency_list >; Graph2 = boost::adjacency_list >]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/isomorphism.hpp:662:5: required from ‘typename boost::result_of(Param0, Param1, const ArgPack&)>::type boost::graph::isomorphism_with_named_params(const Param0&, const Param1&, const ArgPack&) [with Param0 = boost::adjacency_list >; Param1 = boost::adjacency_list >; ArgPack = boost::parameter::aux::arg_list >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&> >, boost::parameter::aux::empty_arg_list, std::integral_constant >; typename boost::result_of(Param0, Param1, const ArgPack&)>::type = bool]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/isomorphism.hpp:666:1: required from ‘typename boost::result_of(Param0, Param1, const typename boost::detail::convert_bgl_params_to_boost_parameter >::type&)>::type boost::isomorphism(const Param0&, const Param1&, const bgl_named_params&) [with Param0 = adjacency_list >; Param1 = adjacency_list >; P = iterator_property_map<__gnu_cxx::__normal_iterator >, adj_list_vertex_property_map >, int, int&, vertex_index_t>, void*, void*&>; T = vertex_isomorphism_t; R = no_property; typename result_of(Param0, Param1, const typename detail::convert_bgl_params_to_boost_parameter >::type&)>::type = bool; typename detail::convert_bgl_params_to_boost_parameter >::type = parameter::aux::arg_list >, adj_list_vertex_property_map >, int, int&, vertex_index_t>, void*, void*&> >, parameter::aux::empty_arg_list, std::integral_constant >]’ ordering.cpp:68:18: required from here /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::Convertible]’ 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ^ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::Convertible]’: /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/graph_concepts.hpp:185:9: required from ‘boost::concepts::VertexListGraph::~VertexListGraph() [with G = boost::adjacency_list >]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/graph_concepts.hpp:176:1: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::VertexListGraphConcept > >]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/isomorphism.hpp:494:5: required from ‘bool boost::isomorphism(const Graph1&, const Graph2&, IsoMapping, Invariant1, Invariant2, std::size_t, IndexMap1, IndexMap2) [with Graph1 = adjacency_list >; Graph2 = adjacency_list >; IsoMapping = iterator_property_map<__gnu_cxx::__normal_iterator >, adj_list_vertex_property_map >, int, int&, vertex_index_t>, void*, void*&>; Invariant1 = degree_vertex_invariant >, int, const int&, vertex_index_t> >, adjacency_list > >; Invariant2 = degree_vertex_invariant >, int, const int&, vertex_index_t> >, adjacency_list > >; IndexMap1 = adj_list_vertex_property_map >, int, const int&, vertex_index_t>; IndexMap2 = adj_list_vertex_property_map >, int, const int&, vertex_index_t>; std::size_t = long unsigned int]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/isomorphism.hpp:651:42: required from ‘bool boost::graph::detail::isomorphism_impl::operator()(const Graph1&, const Graph2&, const ArgPack&) const [with ArgPack = boost::parameter::aux::arg_list >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&> >, boost::parameter::aux::empty_arg_list, std::integral_constant >; Graph1 = boost::adjacency_list >; Graph2 = boost::adjacency_list >]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/isomorphism.hpp:662:5: required from ‘typename boost::result_of(Param0, Param1, const ArgPack&)>::type boost::graph::isomorphism_with_named_params(const Param0&, const Param1&, const ArgPack&) [with Param0 = boost::adjacency_list >; Param1 = boost::adjacency_list >; ArgPack = boost::parameter::aux::arg_list >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&> >, boost::parameter::aux::empty_arg_list, std::integral_constant >; typename boost::result_of(Param0, Param1, const ArgPack&)>::type = bool]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/isomorphism.hpp:666:1: required from ‘typename boost::result_of(Param0, Param1, const typename boost::detail::convert_bgl_params_to_boost_parameter >::type&)>::type boost::isomorphism(const Param0&, const Param1&, const bgl_named_params&) [with Param0 = adjacency_list >; Param1 = adjacency_list >; P = iterator_property_map<__gnu_cxx::__normal_iterator >, adj_list_vertex_property_map >, int, int&, vertex_index_t>, void*, void*&>; T = vertex_isomorphism_t; R = no_property; typename result_of(Param0, Param1, const typename detail::convert_bgl_params_to_boost_parameter >::type&)>::type = bool; typename detail::convert_bgl_params_to_boost_parameter >::type = parameter::aux::arg_list >, adj_list_vertex_property_map >, int, int&, vertex_index_t>, void*, void*&> >, parameter::aux::empty_arg_list, std::integral_constant >]’ ordering.cpp:68:18: required from here /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::Convertible::~Convertible() [with X = boost::undir_adj_list_traversal_tag; Y = boost::vertex_list_graph_tag]’ 37 | ~model() | ^ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:208:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 208 | BOOST_CONCEPT_USAGE(Convertible) { | ^~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements >, boost::detail::edge_desc_impl, long int> > >]’: /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/graph_concepts.hpp:52:50: required from ‘struct boost::concepts::MultiPassInputIterator >, boost::detail::edge_desc_impl, long int> >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::concepts::MultiPassInputIterator >, boost::detail::edge_desc_impl, long int> >]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied >, boost::detail::edge_desc_impl, long int> > >::value’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied >, boost::detail::edge_desc_impl, long int> > >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:72:8: [ skipping 2 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/graph_concepts.hpp:226:1: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::EdgeListGraphConcept > >]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/isomorphism.hpp:495:5: required from ‘bool boost::isomorphism(const Graph1&, const Graph2&, IsoMapping, Invariant1, Invariant2, std::size_t, IndexMap1, IndexMap2) [with Graph1 = adjacency_list >; Graph2 = adjacency_list >; IsoMapping = iterator_property_map<__gnu_cxx::__normal_iterator >, adj_list_vertex_property_map >, int, int&, vertex_index_t>, void*, void*&>; Invariant1 = degree_vertex_invariant >, int, const int&, vertex_index_t> >, adjacency_list > >; Invariant2 = degree_vertex_invariant >, int, const int&, vertex_index_t> >, adjacency_list > >; IndexMap1 = adj_list_vertex_property_map >, int, const int&, vertex_index_t>; IndexMap2 = adj_list_vertex_property_map >, int, const int&, vertex_index_t>; std::size_t = long unsigned int]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/isomorphism.hpp:651:42: required from ‘bool boost::graph::detail::isomorphism_impl::operator()(const Graph1&, const Graph2&, const ArgPack&) const [with ArgPack = boost::parameter::aux::arg_list >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&> >, boost::parameter::aux::empty_arg_list, std::integral_constant >; Graph1 = boost::adjacency_list >; Graph2 = boost::adjacency_list >]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/isomorphism.hpp:662:5: required from ‘typename boost::result_of(Param0, Param1, const ArgPack&)>::type boost::graph::isomorphism_with_named_params(const Param0&, const Param1&, const ArgPack&) [with Param0 = boost::adjacency_list >; Param1 = boost::adjacency_list >; ArgPack = boost::parameter::aux::arg_list >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&> >, boost::parameter::aux::empty_arg_list, std::integral_constant >; typename boost::result_of(Param0, Param1, const ArgPack&)>::type = bool]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/isomorphism.hpp:666:1: required from ‘typename boost::result_of(Param0, Param1, const typename boost::detail::convert_bgl_params_to_boost_parameter >::type&)>::type boost::isomorphism(const Param0&, const Param1&, const bgl_named_params&) [with Param0 = adjacency_list >; Param1 = adjacency_list >; P = iterator_property_map<__gnu_cxx::__normal_iterator >, adj_list_vertex_property_map >, int, int&, vertex_index_t>, void*, void*&>; T = vertex_isomorphism_t; R = no_property; typename result_of(Param0, Param1, const typename detail::convert_bgl_params_to_boost_parameter >::type&)>::type = bool; typename detail::convert_bgl_params_to_boost_parameter >::type = parameter::aux::arg_list >, adj_list_vertex_property_map >, int, int&, vertex_index_t>, void*, void*&> >, parameter::aux::empty_arg_list, std::integral_constant >]’ ordering.cpp:68:18: required from here /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::concepts::MultiPassInputIterator >, boost::detail::edge_desc_impl, long int> >]’ 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ^ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::MultiPassInputIterator >, boost::detail::edge_desc_impl, long int> >]’: /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/graph_concepts.hpp:235:9: required from ‘boost::concepts::EdgeListGraph::~EdgeListGraph() [with G = boost::adjacency_list >]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/graph_concepts.hpp:226:1: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::EdgeListGraphConcept > >]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/isomorphism.hpp:495:5: required from ‘bool boost::isomorphism(const Graph1&, const Graph2&, IsoMapping, Invariant1, Invariant2, std::size_t, IndexMap1, IndexMap2) [with Graph1 = adjacency_list >; Graph2 = adjacency_list >; IsoMapping = iterator_property_map<__gnu_cxx::__normal_iterator >, adj_list_vertex_property_map >, int, int&, vertex_index_t>, void*, void*&>; Invariant1 = degree_vertex_invariant >, int, const int&, vertex_index_t> >, adjacency_list > >; Invariant2 = degree_vertex_invariant >, int, const int&, vertex_index_t> >, adjacency_list > >; IndexMap1 = adj_list_vertex_property_map >, int, const int&, vertex_index_t>; IndexMap2 = adj_list_vertex_property_map >, int, const int&, vertex_index_t>; std::size_t = long unsigned int]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/isomorphism.hpp:651:42: required from ‘bool boost::graph::detail::isomorphism_impl::operator()(const Graph1&, const Graph2&, const ArgPack&) const [with ArgPack = boost::parameter::aux::arg_list >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&> >, boost::parameter::aux::empty_arg_list, std::integral_constant >; Graph1 = boost::adjacency_list >; Graph2 = boost::adjacency_list >]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/isomorphism.hpp:662:5: required from ‘typename boost::result_of(Param0, Param1, const ArgPack&)>::type boost::graph::isomorphism_with_named_params(const Param0&, const Param1&, const ArgPack&) [with Param0 = boost::adjacency_list >; Param1 = boost::adjacency_list >; ArgPack = boost::parameter::aux::arg_list >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&> >, boost::parameter::aux::empty_arg_list, std::integral_constant >; typename boost::result_of(Param0, Param1, const ArgPack&)>::type = bool]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/isomorphism.hpp:666:1: required from ‘typename boost::result_of(Param0, Param1, const typename boost::detail::convert_bgl_params_to_boost_parameter >::type&)>::type boost::isomorphism(const Param0&, const Param1&, const bgl_named_params&) [with Param0 = adjacency_list >; Param1 = adjacency_list >; P = iterator_property_map<__gnu_cxx::__normal_iterator >, adj_list_vertex_property_map >, int, int&, vertex_index_t>, void*, void*&>; T = vertex_isomorphism_t; R = no_property; typename result_of(Param0, Param1, const typename detail::convert_bgl_params_to_boost_parameter >::type&)>::type = bool; typename detail::convert_bgl_params_to_boost_parameter >::type = parameter::aux::arg_list >, adj_list_vertex_property_map >, int, int&, vertex_index_t>, void*, void*&> >, parameter::aux::empty_arg_list, std::integral_constant >]’ ordering.cpp:68:18: required from here /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::concepts::MultiPassInputIterator::~MultiPassInputIterator() [with T = boost::detail::undirected_edge_iter >, boost::detail::edge_desc_impl, long int>]’ 37 | ~model() | ^ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/graph_concepts.hpp:52:50: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 52 | BOOST_concept(MultiPassInputIterator, (T)) { BOOST_CONCEPT_USAGE( | ^~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements > >]’: /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:137:5: required from ‘struct boost::DefaultConstructible >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::DefaultConstructible >]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied > >::value’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied > >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:72:8: [ skipping 2 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/graph_concepts.hpp:226:1: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::EdgeListGraphConcept > >]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/isomorphism.hpp:495:5: required from ‘bool boost::isomorphism(const Graph1&, const Graph2&, IsoMapping, Invariant1, Invariant2, std::size_t, IndexMap1, IndexMap2) [with Graph1 = adjacency_list >; Graph2 = adjacency_list >; IsoMapping = iterator_property_map<__gnu_cxx::__normal_iterator >, adj_list_vertex_property_map >, int, int&, vertex_index_t>, void*, void*&>; Invariant1 = degree_vertex_invariant >, int, const int&, vertex_index_t> >, adjacency_list > >; Invariant2 = degree_vertex_invariant >, int, const int&, vertex_index_t> >, adjacency_list > >; IndexMap1 = adj_list_vertex_property_map >, int, const int&, vertex_index_t>; IndexMap2 = adj_list_vertex_property_map >, int, const int&, vertex_index_t>; std::size_t = long unsigned int]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/isomorphism.hpp:651:42: required from ‘bool boost::graph::detail::isomorphism_impl::operator()(const Graph1&, const Graph2&, const ArgPack&) const [with ArgPack = boost::parameter::aux::arg_list >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&> >, boost::parameter::aux::empty_arg_list, std::integral_constant >; Graph1 = boost::adjacency_list >; Graph2 = boost::adjacency_list >]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/isomorphism.hpp:662:5: required from ‘typename boost::result_of(Param0, Param1, const ArgPack&)>::type boost::graph::isomorphism_with_named_params(const Param0&, const Param1&, const ArgPack&) [with Param0 = boost::adjacency_list >; Param1 = boost::adjacency_list >; ArgPack = boost::parameter::aux::arg_list >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&> >, boost::parameter::aux::empty_arg_list, std::integral_constant >; typename boost::result_of(Param0, Param1, const ArgPack&)>::type = bool]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/isomorphism.hpp:666:1: required from ‘typename boost::result_of(Param0, Param1, const typename boost::detail::convert_bgl_params_to_boost_parameter >::type&)>::type boost::isomorphism(const Param0&, const Param1&, const bgl_named_params&) [with Param0 = adjacency_list >; Param1 = adjacency_list >; P = iterator_property_map<__gnu_cxx::__normal_iterator >, adj_list_vertex_property_map >, int, int&, vertex_index_t>, void*, void*&>; T = vertex_isomorphism_t; R = no_property; typename result_of(Param0, Param1, const typename detail::convert_bgl_params_to_boost_parameter >::type&)>::type = bool; typename detail::convert_bgl_params_to_boost_parameter >::type = parameter::aux::arg_list >, adj_list_vertex_property_map >, int, int&, vertex_index_t>, void*, void*&> >, parameter::aux::empty_arg_list, std::integral_constant >]’ ordering.cpp:68:18: required from here /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::DefaultConstructible >]’ 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ^ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::DefaultConstructible >]’: /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/graph_concepts.hpp:90:9: required from ‘boost::concepts::EdgeListGraph::~EdgeListGraph() [with G = boost::adjacency_list >]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/graph_concepts.hpp:226:1: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::EdgeListGraphConcept > >]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/isomorphism.hpp:495:5: required from ‘bool boost::isomorphism(const Graph1&, const Graph2&, IsoMapping, Invariant1, Invariant2, std::size_t, IndexMap1, IndexMap2) [with Graph1 = adjacency_list >; Graph2 = adjacency_list >; IsoMapping = iterator_property_map<__gnu_cxx::__normal_iterator >, adj_list_vertex_property_map >, int, int&, vertex_index_t>, void*, void*&>; Invariant1 = degree_vertex_invariant >, int, const int&, vertex_index_t> >, adjacency_list > >; Invariant2 = degree_vertex_invariant >, int, const int&, vertex_index_t> >, adjacency_list > >; IndexMap1 = adj_list_vertex_property_map >, int, const int&, vertex_index_t>; IndexMap2 = adj_list_vertex_property_map >, int, const int&, vertex_index_t>; std::size_t = long unsigned int]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/isomorphism.hpp:651:42: required from ‘bool boost::graph::detail::isomorphism_impl::operator()(const Graph1&, const Graph2&, const ArgPack&) const [with ArgPack = boost::parameter::aux::arg_list >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&> >, boost::parameter::aux::empty_arg_list, std::integral_constant >; Graph1 = boost::adjacency_list >; Graph2 = boost::adjacency_list >]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/isomorphism.hpp:662:5: required from ‘typename boost::result_of(Param0, Param1, const ArgPack&)>::type boost::graph::isomorphism_with_named_params(const Param0&, const Param1&, const ArgPack&) [with Param0 = boost::adjacency_list >; Param1 = boost::adjacency_list >; ArgPack = boost::parameter::aux::arg_list >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&> >, boost::parameter::aux::empty_arg_list, std::integral_constant >; typename boost::result_of(Param0, Param1, const ArgPack&)>::type = bool]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/isomorphism.hpp:666:1: required from ‘typename boost::result_of(Param0, Param1, const typename boost::detail::convert_bgl_params_to_boost_parameter >::type&)>::type boost::isomorphism(const Param0&, const Param1&, const bgl_named_params&) [with Param0 = adjacency_list >; Param1 = adjacency_list >; P = iterator_property_map<__gnu_cxx::__normal_iterator >, adj_list_vertex_property_map >, int, int&, vertex_index_t>, void*, void*&>; T = vertex_isomorphism_t; R = no_property; typename result_of(Param0, Param1, const typename detail::convert_bgl_params_to_boost_parameter >::type&)>::type = bool; typename detail::convert_bgl_params_to_boost_parameter >::type = parameter::aux::arg_list >, adj_list_vertex_property_map >, int, int&, vertex_index_t>, void*, void*&> >, parameter::aux::empty_arg_list, std::integral_constant >]’ ordering.cpp:68:18: required from here /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::DefaultConstructible::~DefaultConstructible() [with TT = boost::detail::edge_desc_impl]’ 37 | ~model() | ^ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:137:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 137 | BOOST_CONCEPT_USAGE(DefaultConstructible) { | ^~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements > >]’: /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:233:5: required from ‘struct boost::EqualityComparable >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::EqualityComparable >]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied > >::value’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied > >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:72:8: [ skipping 2 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/graph_concepts.hpp:226:1: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::EdgeListGraphConcept > >]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/isomorphism.hpp:495:5: required from ‘bool boost::isomorphism(const Graph1&, const Graph2&, IsoMapping, Invariant1, Invariant2, std::size_t, IndexMap1, IndexMap2) [with Graph1 = adjacency_list >; Graph2 = adjacency_list >; IsoMapping = iterator_property_map<__gnu_cxx::__normal_iterator >, adj_list_vertex_property_map >, int, int&, vertex_index_t>, void*, void*&>; Invariant1 = degree_vertex_invariant >, int, const int&, vertex_index_t> >, adjacency_list > >; Invariant2 = degree_vertex_invariant >, int, const int&, vertex_index_t> >, adjacency_list > >; IndexMap1 = adj_list_vertex_property_map >, int, const int&, vertex_index_t>; IndexMap2 = adj_list_vertex_property_map >, int, const int&, vertex_index_t>; std::size_t = long unsigned int]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/isomorphism.hpp:651:42: required from ‘bool boost::graph::detail::isomorphism_impl::operator()(const Graph1&, const Graph2&, const ArgPack&) const [with ArgPack = boost::parameter::aux::arg_list >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&> >, boost::parameter::aux::empty_arg_list, std::integral_constant >; Graph1 = boost::adjacency_list >; Graph2 = boost::adjacency_list >]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/isomorphism.hpp:662:5: required from ‘typename boost::result_of(Param0, Param1, const ArgPack&)>::type boost::graph::isomorphism_with_named_params(const Param0&, const Param1&, const ArgPack&) [with Param0 = boost::adjacency_list >; Param1 = boost::adjacency_list >; ArgPack = boost::parameter::aux::arg_list >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&> >, boost::parameter::aux::empty_arg_list, std::integral_constant >; typename boost::result_of(Param0, Param1, const ArgPack&)>::type = bool]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/isomorphism.hpp:666:1: required from ‘typename boost::result_of(Param0, Param1, const typename boost::detail::convert_bgl_params_to_boost_parameter >::type&)>::type boost::isomorphism(const Param0&, const Param1&, const bgl_named_params&) [with Param0 = adjacency_list >; Param1 = adjacency_list >; P = iterator_property_map<__gnu_cxx::__normal_iterator >, adj_list_vertex_property_map >, int, int&, vertex_index_t>, void*, void*&>; T = vertex_isomorphism_t; R = no_property; typename result_of(Param0, Param1, const typename detail::convert_bgl_params_to_boost_parameter >::type&)>::type = bool; typename detail::convert_bgl_params_to_boost_parameter >::type = parameter::aux::arg_list >, adj_list_vertex_property_map >, int, int&, vertex_index_t>, void*, void*&> >, parameter::aux::empty_arg_list, std::integral_constant >]’ ordering.cpp:68:18: required from here /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::EqualityComparable >]’ 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ^ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::EqualityComparable >]’: /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/graph_concepts.hpp:91:9: required from ‘boost::concepts::EdgeListGraph::~EdgeListGraph() [with G = boost::adjacency_list >]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/graph_concepts.hpp:226:1: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::EdgeListGraphConcept > >]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/isomorphism.hpp:495:5: required from ‘bool boost::isomorphism(const Graph1&, const Graph2&, IsoMapping, Invariant1, Invariant2, std::size_t, IndexMap1, IndexMap2) [with Graph1 = adjacency_list >; Graph2 = adjacency_list >; IsoMapping = iterator_property_map<__gnu_cxx::__normal_iterator >, adj_list_vertex_property_map >, int, int&, vertex_index_t>, void*, void*&>; Invariant1 = degree_vertex_invariant >, int, const int&, vertex_index_t> >, adjacency_list > >; Invariant2 = degree_vertex_invariant >, int, const int&, vertex_index_t> >, adjacency_list > >; IndexMap1 = adj_list_vertex_property_map >, int, const int&, vertex_index_t>; IndexMap2 = adj_list_vertex_property_map >, int, const int&, vertex_index_t>; std::size_t = long unsigned int]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/isomorphism.hpp:651:42: required from ‘bool boost::graph::detail::isomorphism_impl::operator()(const Graph1&, const Graph2&, const ArgPack&) const [with ArgPack = boost::parameter::aux::arg_list >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&> >, boost::parameter::aux::empty_arg_list, std::integral_constant >; Graph1 = boost::adjacency_list >; Graph2 = boost::adjacency_list >]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/isomorphism.hpp:662:5: required from ‘typename boost::result_of(Param0, Param1, const ArgPack&)>::type boost::graph::isomorphism_with_named_params(const Param0&, const Param1&, const ArgPack&) [with Param0 = boost::adjacency_list >; Param1 = boost::adjacency_list >; ArgPack = boost::parameter::aux::arg_list >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&> >, boost::parameter::aux::empty_arg_list, std::integral_constant >; typename boost::result_of(Param0, Param1, const ArgPack&)>::type = bool]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/isomorphism.hpp:666:1: required from ‘typename boost::result_of(Param0, Param1, const typename boost::detail::convert_bgl_params_to_boost_parameter >::type&)>::type boost::isomorphism(const Param0&, const Param1&, const bgl_named_params&) [with Param0 = adjacency_list >; Param1 = adjacency_list >; P = iterator_property_map<__gnu_cxx::__normal_iterator >, adj_list_vertex_property_map >, int, int&, vertex_index_t>, void*, void*&>; T = vertex_isomorphism_t; R = no_property; typename result_of(Param0, Param1, const typename detail::convert_bgl_params_to_boost_parameter >::type&)>::type = bool; typename detail::convert_bgl_params_to_boost_parameter >::type = parameter::aux::arg_list >, adj_list_vertex_property_map >, int, int&, vertex_index_t>, void*, void*&> >, parameter::aux::empty_arg_list, std::integral_constant >]’ ordering.cpp:68:18: required from here /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::EqualityComparable::~EqualityComparable() [with TT = boost::detail::edge_desc_impl]’ 37 | ~model() | ^ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:233:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 233 | BOOST_CONCEPT_USAGE(EqualityComparable) { | ^~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements > >]’: /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:145:5: required from ‘struct boost::Assignable >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::Assignable >]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied > >::value’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied > >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:72:8: [ skipping 2 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/graph_concepts.hpp:226:1: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::EdgeListGraphConcept > >]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/isomorphism.hpp:495:5: required from ‘bool boost::isomorphism(const Graph1&, const Graph2&, IsoMapping, Invariant1, Invariant2, std::size_t, IndexMap1, IndexMap2) [with Graph1 = adjacency_list >; Graph2 = adjacency_list >; IsoMapping = iterator_property_map<__gnu_cxx::__normal_iterator >, adj_list_vertex_property_map >, int, int&, vertex_index_t>, void*, void*&>; Invariant1 = degree_vertex_invariant >, int, const int&, vertex_index_t> >, adjacency_list > >; Invariant2 = degree_vertex_invariant >, int, const int&, vertex_index_t> >, adjacency_list > >; IndexMap1 = adj_list_vertex_property_map >, int, const int&, vertex_index_t>; IndexMap2 = adj_list_vertex_property_map >, int, const int&, vertex_index_t>; std::size_t = long unsigned int]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/isomorphism.hpp:651:42: required from ‘bool boost::graph::detail::isomorphism_impl::operator()(const Graph1&, const Graph2&, const ArgPack&) const [with ArgPack = boost::parameter::aux::arg_list >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&> >, boost::parameter::aux::empty_arg_list, std::integral_constant >; Graph1 = boost::adjacency_list >; Graph2 = boost::adjacency_list >]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/isomorphism.hpp:662:5: required from ‘typename boost::result_of(Param0, Param1, const ArgPack&)>::type boost::graph::isomorphism_with_named_params(const Param0&, const Param1&, const ArgPack&) [with Param0 = boost::adjacency_list >; Param1 = boost::adjacency_list >; ArgPack = boost::parameter::aux::arg_list >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&> >, boost::parameter::aux::empty_arg_list, std::integral_constant >; typename boost::result_of(Param0, Param1, const ArgPack&)>::type = bool]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/isomorphism.hpp:666:1: required from ‘typename boost::result_of(Param0, Param1, const typename boost::detail::convert_bgl_params_to_boost_parameter >::type&)>::type boost::isomorphism(const Param0&, const Param1&, const bgl_named_params&) [with Param0 = adjacency_list >; Param1 = adjacency_list >; P = iterator_property_map<__gnu_cxx::__normal_iterator >, adj_list_vertex_property_map >, int, int&, vertex_index_t>, void*, void*&>; T = vertex_isomorphism_t; R = no_property; typename result_of(Param0, Param1, const typename detail::convert_bgl_params_to_boost_parameter >::type&)>::type = bool; typename detail::convert_bgl_params_to_boost_parameter >::type = parameter::aux::arg_list >, adj_list_vertex_property_map >, int, int&, vertex_index_t>, void*, void*&> >, parameter::aux::empty_arg_list, std::integral_constant >]’ ordering.cpp:68:18: required from here /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::Assignable >]’ 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ^ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::Assignable >]’: /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/graph_concepts.hpp:92:9: required from ‘boost::concepts::EdgeListGraph::~EdgeListGraph() [with G = boost::adjacency_list >]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/graph_concepts.hpp:226:1: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::EdgeListGraphConcept > >]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/isomorphism.hpp:495:5: required from ‘bool boost::isomorphism(const Graph1&, const Graph2&, IsoMapping, Invariant1, Invariant2, std::size_t, IndexMap1, IndexMap2) [with Graph1 = adjacency_list >; Graph2 = adjacency_list >; IsoMapping = iterator_property_map<__gnu_cxx::__normal_iterator >, adj_list_vertex_property_map >, int, int&, vertex_index_t>, void*, void*&>; Invariant1 = degree_vertex_invariant >, int, const int&, vertex_index_t> >, adjacency_list > >; Invariant2 = degree_vertex_invariant >, int, const int&, vertex_index_t> >, adjacency_list > >; IndexMap1 = adj_list_vertex_property_map >, int, const int&, vertex_index_t>; IndexMap2 = adj_list_vertex_property_map >, int, const int&, vertex_index_t>; std::size_t = long unsigned int]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/isomorphism.hpp:651:42: required from ‘bool boost::graph::detail::isomorphism_impl::operator()(const Graph1&, const Graph2&, const ArgPack&) const [with ArgPack = boost::parameter::aux::arg_list >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&> >, boost::parameter::aux::empty_arg_list, std::integral_constant >; Graph1 = boost::adjacency_list >; Graph2 = boost::adjacency_list >]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/isomorphism.hpp:662:5: required from ‘typename boost::result_of(Param0, Param1, const ArgPack&)>::type boost::graph::isomorphism_with_named_params(const Param0&, const Param1&, const ArgPack&) [with Param0 = boost::adjacency_list >; Param1 = boost::adjacency_list >; ArgPack = boost::parameter::aux::arg_list >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&> >, boost::parameter::aux::empty_arg_list, std::integral_constant >; typename boost::result_of(Param0, Param1, const ArgPack&)>::type = bool]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/isomorphism.hpp:666:1: required from ‘typename boost::result_of(Param0, Param1, const typename boost::detail::convert_bgl_params_to_boost_parameter >::type&)>::type boost::isomorphism(const Param0&, const Param1&, const bgl_named_params&) [with Param0 = adjacency_list >; Param1 = adjacency_list >; P = iterator_property_map<__gnu_cxx::__normal_iterator >, adj_list_vertex_property_map >, int, int&, vertex_index_t>, void*, void*&>; T = vertex_isomorphism_t; R = no_property; typename result_of(Param0, Param1, const typename detail::convert_bgl_params_to_boost_parameter >::type&)>::type = bool; typename detail::convert_bgl_params_to_boost_parameter >::type = parameter::aux::arg_list >, adj_list_vertex_property_map >, int, int&, vertex_index_t>, void*, void*&> >, parameter::aux::empty_arg_list, std::integral_constant >]’ ordering.cpp:68:18: required from here /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::Assignable::~Assignable() [with TT = boost::detail::edge_desc_impl]’ 37 | ~model() | ^ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:145:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 145 | BOOST_CONCEPT_USAGE(Assignable) { | ^~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements >]’: /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:208:5: required from ‘struct boost::Convertible’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::Convertible]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied >::value’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:72:8: [ skipping 2 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/graph_concepts.hpp:226:1: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::EdgeListGraphConcept > >]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/isomorphism.hpp:495:5: required from ‘bool boost::isomorphism(const Graph1&, const Graph2&, IsoMapping, Invariant1, Invariant2, std::size_t, IndexMap1, IndexMap2) [with Graph1 = adjacency_list >; Graph2 = adjacency_list >; IsoMapping = iterator_property_map<__gnu_cxx::__normal_iterator >, adj_list_vertex_property_map >, int, int&, vertex_index_t>, void*, void*&>; Invariant1 = degree_vertex_invariant >, int, const int&, vertex_index_t> >, adjacency_list > >; Invariant2 = degree_vertex_invariant >, int, const int&, vertex_index_t> >, adjacency_list > >; IndexMap1 = adj_list_vertex_property_map >, int, const int&, vertex_index_t>; IndexMap2 = adj_list_vertex_property_map >, int, const int&, vertex_index_t>; std::size_t = long unsigned int]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/isomorphism.hpp:651:42: required from ‘bool boost::graph::detail::isomorphism_impl::operator()(const Graph1&, const Graph2&, const ArgPack&) const [with ArgPack = boost::parameter::aux::arg_list >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&> >, boost::parameter::aux::empty_arg_list, std::integral_constant >; Graph1 = boost::adjacency_list >; Graph2 = boost::adjacency_list >]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/isomorphism.hpp:662:5: required from ‘typename boost::result_of(Param0, Param1, const ArgPack&)>::type boost::graph::isomorphism_with_named_params(const Param0&, const Param1&, const ArgPack&) [with Param0 = boost::adjacency_list >; Param1 = boost::adjacency_list >; ArgPack = boost::parameter::aux::arg_list >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&> >, boost::parameter::aux::empty_arg_list, std::integral_constant >; typename boost::result_of(Param0, Param1, const ArgPack&)>::type = bool]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/isomorphism.hpp:666:1: required from ‘typename boost::result_of(Param0, Param1, const typename boost::detail::convert_bgl_params_to_boost_parameter >::type&)>::type boost::isomorphism(const Param0&, const Param1&, const bgl_named_params&) [with Param0 = adjacency_list >; Param1 = adjacency_list >; P = iterator_property_map<__gnu_cxx::__normal_iterator >, adj_list_vertex_property_map >, int, int&, vertex_index_t>, void*, void*&>; T = vertex_isomorphism_t; R = no_property; typename result_of(Param0, Param1, const typename detail::convert_bgl_params_to_boost_parameter >::type&)>::type = bool; typename detail::convert_bgl_params_to_boost_parameter >::type = parameter::aux::arg_list >, adj_list_vertex_property_map >, int, int&, vertex_index_t>, void*, void*&> >, parameter::aux::empty_arg_list, std::integral_constant >]’ ordering.cpp:68:18: required from here /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::Convertible]’ 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ^ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::Convertible]’: /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/graph_concepts.hpp:239:9: required from ‘boost::concepts::EdgeListGraph::~EdgeListGraph() [with G = boost::adjacency_list >]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/graph_concepts.hpp:226:1: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::EdgeListGraphConcept > >]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/isomorphism.hpp:495:5: required from ‘bool boost::isomorphism(const Graph1&, const Graph2&, IsoMapping, Invariant1, Invariant2, std::size_t, IndexMap1, IndexMap2) [with Graph1 = adjacency_list >; Graph2 = adjacency_list >; IsoMapping = iterator_property_map<__gnu_cxx::__normal_iterator >, adj_list_vertex_property_map >, int, int&, vertex_index_t>, void*, void*&>; Invariant1 = degree_vertex_invariant >, int, const int&, vertex_index_t> >, adjacency_list > >; Invariant2 = degree_vertex_invariant >, int, const int&, vertex_index_t> >, adjacency_list > >; IndexMap1 = adj_list_vertex_property_map >, int, const int&, vertex_index_t>; IndexMap2 = adj_list_vertex_property_map >, int, const int&, vertex_index_t>; std::size_t = long unsigned int]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/isomorphism.hpp:651:42: required from ‘bool boost::graph::detail::isomorphism_impl::operator()(const Graph1&, const Graph2&, const ArgPack&) const [with ArgPack = boost::parameter::aux::arg_list >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&> >, boost::parameter::aux::empty_arg_list, std::integral_constant >; Graph1 = boost::adjacency_list >; Graph2 = boost::adjacency_list >]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/isomorphism.hpp:662:5: required from ‘typename boost::result_of(Param0, Param1, const ArgPack&)>::type boost::graph::isomorphism_with_named_params(const Param0&, const Param1&, const ArgPack&) [with Param0 = boost::adjacency_list >; Param1 = boost::adjacency_list >; ArgPack = boost::parameter::aux::arg_list >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&> >, boost::parameter::aux::empty_arg_list, std::integral_constant >; typename boost::result_of(Param0, Param1, const ArgPack&)>::type = bool]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/isomorphism.hpp:666:1: required from ‘typename boost::result_of(Param0, Param1, const typename boost::detail::convert_bgl_params_to_boost_parameter >::type&)>::type boost::isomorphism(const Param0&, const Param1&, const bgl_named_params&) [with Param0 = adjacency_list >; Param1 = adjacency_list >; P = iterator_property_map<__gnu_cxx::__normal_iterator >, adj_list_vertex_property_map >, int, int&, vertex_index_t>, void*, void*&>; T = vertex_isomorphism_t; R = no_property; typename result_of(Param0, Param1, const typename detail::convert_bgl_params_to_boost_parameter >::type&)>::type = bool; typename detail::convert_bgl_params_to_boost_parameter >::type = parameter::aux::arg_list >, adj_list_vertex_property_map >, int, int&, vertex_index_t>, void*, void*&> >, parameter::aux::empty_arg_list, std::integral_constant >]’ ordering.cpp:68:18: required from here /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::Convertible::~Convertible() [with X = boost::undir_adj_list_traversal_tag; Y = boost::edge_list_graph_tag]’ 37 | ~model() | ^ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:208:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 208 | BOOST_CONCEPT_USAGE(Convertible) { | ^~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements >]’: /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:208:5: required from ‘struct boost::Convertible’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::Convertible]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied >::value’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:72:8: [ skipping 2 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:454:3: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::AdaptableUnaryFunctionConcept >, int, const int&, boost::vertex_index_t> >, boost::adjacency_list > >, long unsigned int, void*>]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/isomorphism.hpp:504:5: required from ‘bool boost::isomorphism(const Graph1&, const Graph2&, IsoMapping, Invariant1, Invariant2, std::size_t, IndexMap1, IndexMap2) [with Graph1 = adjacency_list >; Graph2 = adjacency_list >; IsoMapping = iterator_property_map<__gnu_cxx::__normal_iterator >, adj_list_vertex_property_map >, int, int&, vertex_index_t>, void*, void*&>; Invariant1 = degree_vertex_invariant >, int, const int&, vertex_index_t> >, adjacency_list > >; Invariant2 = degree_vertex_invariant >, int, const int&, vertex_index_t> >, adjacency_list > >; IndexMap1 = adj_list_vertex_property_map >, int, const int&, vertex_index_t>; IndexMap2 = adj_list_vertex_property_map >, int, const int&, vertex_index_t>; std::size_t = long unsigned int]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/isomorphism.hpp:651:42: required from ‘bool boost::graph::detail::isomorphism_impl::operator()(const Graph1&, const Graph2&, const ArgPack&) const [with ArgPack = boost::parameter::aux::arg_list >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&> >, boost::parameter::aux::empty_arg_list, std::integral_constant >; Graph1 = boost::adjacency_list >; Graph2 = boost::adjacency_list >]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/isomorphism.hpp:662:5: required from ‘typename boost::result_of(Param0, Param1, const ArgPack&)>::type boost::graph::isomorphism_with_named_params(const Param0&, const Param1&, const ArgPack&) [with Param0 = boost::adjacency_list >; Param1 = boost::adjacency_list >; ArgPack = boost::parameter::aux::arg_list >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&> >, boost::parameter::aux::empty_arg_list, std::integral_constant >; typename boost::result_of(Param0, Param1, const ArgPack&)>::type = bool]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/isomorphism.hpp:666:1: required from ‘typename boost::result_of(Param0, Param1, const typename boost::detail::convert_bgl_params_to_boost_parameter >::type&)>::type boost::isomorphism(const Param0&, const Param1&, const bgl_named_params&) [with Param0 = adjacency_list >; Param1 = adjacency_list >; P = iterator_property_map<__gnu_cxx::__normal_iterator >, adj_list_vertex_property_map >, int, int&, vertex_index_t>, void*, void*&>; T = vertex_isomorphism_t; R = no_property; typename result_of(Param0, Param1, const typename detail::convert_bgl_params_to_boost_parameter >::type&)>::type = bool; typename detail::convert_bgl_params_to_boost_parameter >::type = parameter::aux::arg_list >, adj_list_vertex_property_map >, int, int&, vertex_index_t>, void*, void*&> >, parameter::aux::empty_arg_list, std::integral_constant >]’ ordering.cpp:68:18: required from here /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::Convertible]’ 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ^ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::Convertible]’: /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:450:11: required from ‘boost::AdaptableUnaryFunction::~AdaptableUnaryFunction() [with Func = boost::degree_vertex_invariant >, int, const int&, boost::vertex_index_t> >, boost::adjacency_list > >; Return = long unsigned int; Arg = void*]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:454:3: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::AdaptableUnaryFunctionConcept >, int, const int&, boost::vertex_index_t> >, boost::adjacency_list > >, long unsigned int, void*>]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/isomorphism.hpp:504:5: required from ‘bool boost::isomorphism(const Graph1&, const Graph2&, IsoMapping, Invariant1, Invariant2, std::size_t, IndexMap1, IndexMap2) [with Graph1 = adjacency_list >; Graph2 = adjacency_list >; IsoMapping = iterator_property_map<__gnu_cxx::__normal_iterator >, adj_list_vertex_property_map >, int, int&, vertex_index_t>, void*, void*&>; Invariant1 = degree_vertex_invariant >, int, const int&, vertex_index_t> >, adjacency_list > >; Invariant2 = degree_vertex_invariant >, int, const int&, vertex_index_t> >, adjacency_list > >; IndexMap1 = adj_list_vertex_property_map >, int, const int&, vertex_index_t>; IndexMap2 = adj_list_vertex_property_map >, int, const int&, vertex_index_t>; std::size_t = long unsigned int]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/isomorphism.hpp:651:42: required from ‘bool boost::graph::detail::isomorphism_impl::operator()(const Graph1&, const Graph2&, const ArgPack&) const [with ArgPack = boost::parameter::aux::arg_list >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&> >, boost::parameter::aux::empty_arg_list, std::integral_constant >; Graph1 = boost::adjacency_list >; Graph2 = boost::adjacency_list >]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/isomorphism.hpp:662:5: required from ‘typename boost::result_of(Param0, Param1, const ArgPack&)>::type boost::graph::isomorphism_with_named_params(const Param0&, const Param1&, const ArgPack&) [with Param0 = boost::adjacency_list >; Param1 = boost::adjacency_list >; ArgPack = boost::parameter::aux::arg_list >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&> >, boost::parameter::aux::empty_arg_list, std::integral_constant >; typename boost::result_of(Param0, Param1, const ArgPack&)>::type = bool]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/isomorphism.hpp:666:1: required from ‘typename boost::result_of(Param0, Param1, const typename boost::detail::convert_bgl_params_to_boost_parameter >::type&)>::type boost::isomorphism(const Param0&, const Param1&, const bgl_named_params&) [with Param0 = adjacency_list >; Param1 = adjacency_list >; P = iterator_property_map<__gnu_cxx::__normal_iterator >, adj_list_vertex_property_map >, int, int&, vertex_index_t>, void*, void*&>; T = vertex_isomorphism_t; R = no_property; typename result_of(Param0, Param1, const typename detail::convert_bgl_params_to_boost_parameter >::type&)>::type = bool; typename detail::convert_bgl_params_to_boost_parameter >::type = parameter::aux::arg_list >, adj_list_vertex_property_map >, int, int&, vertex_index_t>, void*, void*&> >, parameter::aux::empty_arg_list, std::integral_constant >]’ ordering.cpp:68:18: required from here /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::Convertible::~Convertible() [with X = long unsigned int; Y = long unsigned int]’ 37 | ~model() | ^ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:208:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 208 | BOOST_CONCEPT_USAGE(Convertible) { | ^~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements >]’: /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:208:5: required from ‘struct boost::Convertible’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::Convertible]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied >::value’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:72:8: [ skipping 2 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:454:3: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::AdaptableUnaryFunctionConcept >, int, const int&, boost::vertex_index_t> >, boost::adjacency_list > >, long unsigned int, void*>]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/isomorphism.hpp:504:5: required from ‘bool boost::isomorphism(const Graph1&, const Graph2&, IsoMapping, Invariant1, Invariant2, std::size_t, IndexMap1, IndexMap2) [with Graph1 = adjacency_list >; Graph2 = adjacency_list >; IsoMapping = iterator_property_map<__gnu_cxx::__normal_iterator >, adj_list_vertex_property_map >, int, int&, vertex_index_t>, void*, void*&>; Invariant1 = degree_vertex_invariant >, int, const int&, vertex_index_t> >, adjacency_list > >; Invariant2 = degree_vertex_invariant >, int, const int&, vertex_index_t> >, adjacency_list > >; IndexMap1 = adj_list_vertex_property_map >, int, const int&, vertex_index_t>; IndexMap2 = adj_list_vertex_property_map >, int, const int&, vertex_index_t>; std::size_t = long unsigned int]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/isomorphism.hpp:651:42: required from ‘bool boost::graph::detail::isomorphism_impl::operator()(const Graph1&, const Graph2&, const ArgPack&) const [with ArgPack = boost::parameter::aux::arg_list >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&> >, boost::parameter::aux::empty_arg_list, std::integral_constant >; Graph1 = boost::adjacency_list >; Graph2 = boost::adjacency_list >]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/isomorphism.hpp:662:5: required from ‘typename boost::result_of(Param0, Param1, const ArgPack&)>::type boost::graph::isomorphism_with_named_params(const Param0&, const Param1&, const ArgPack&) [with Param0 = boost::adjacency_list >; Param1 = boost::adjacency_list >; ArgPack = boost::parameter::aux::arg_list >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&> >, boost::parameter::aux::empty_arg_list, std::integral_constant >; typename boost::result_of(Param0, Param1, const ArgPack&)>::type = bool]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/isomorphism.hpp:666:1: required from ‘typename boost::result_of(Param0, Param1, const typename boost::detail::convert_bgl_params_to_boost_parameter >::type&)>::type boost::isomorphism(const Param0&, const Param1&, const bgl_named_params&) [with Param0 = adjacency_list >; Param1 = adjacency_list >; P = iterator_property_map<__gnu_cxx::__normal_iterator >, adj_list_vertex_property_map >, int, int&, vertex_index_t>, void*, void*&>; T = vertex_isomorphism_t; R = no_property; typename result_of(Param0, Param1, const typename detail::convert_bgl_params_to_boost_parameter >::type&)>::type = bool; typename detail::convert_bgl_params_to_boost_parameter >::type = parameter::aux::arg_list >, adj_list_vertex_property_map >, int, int&, vertex_index_t>, void*, void*&> >, parameter::aux::empty_arg_list, std::integral_constant >]’ ordering.cpp:68:18: required from here /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::Convertible]’ 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ^ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::Convertible]’: /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:463:11: required from ‘boost::AdaptableUnaryFunction::~AdaptableUnaryFunction() [with Func = boost::degree_vertex_invariant >, int, const int&, boost::vertex_index_t> >, boost::adjacency_list > >; Return = long unsigned int; Arg = void*]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:454:3: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::AdaptableUnaryFunctionConcept >, int, const int&, boost::vertex_index_t> >, boost::adjacency_list > >, long unsigned int, void*>]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/isomorphism.hpp:504:5: required from ‘bool boost::isomorphism(const Graph1&, const Graph2&, IsoMapping, Invariant1, Invariant2, std::size_t, IndexMap1, IndexMap2) [with Graph1 = adjacency_list >; Graph2 = adjacency_list >; IsoMapping = iterator_property_map<__gnu_cxx::__normal_iterator >, adj_list_vertex_property_map >, int, int&, vertex_index_t>, void*, void*&>; Invariant1 = degree_vertex_invariant >, int, const int&, vertex_index_t> >, adjacency_list > >; Invariant2 = degree_vertex_invariant >, int, const int&, vertex_index_t> >, adjacency_list > >; IndexMap1 = adj_list_vertex_property_map >, int, const int&, vertex_index_t>; IndexMap2 = adj_list_vertex_property_map >, int, const int&, vertex_index_t>; std::size_t = long unsigned int]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/isomorphism.hpp:651:42: required from ‘bool boost::graph::detail::isomorphism_impl::operator()(const Graph1&, const Graph2&, const ArgPack&) const [with ArgPack = boost::parameter::aux::arg_list >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&> >, boost::parameter::aux::empty_arg_list, std::integral_constant >; Graph1 = boost::adjacency_list >; Graph2 = boost::adjacency_list >]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/isomorphism.hpp:662:5: required from ‘typename boost::result_of(Param0, Param1, const ArgPack&)>::type boost::graph::isomorphism_with_named_params(const Param0&, const Param1&, const ArgPack&) [with Param0 = boost::adjacency_list >; Param1 = boost::adjacency_list >; ArgPack = boost::parameter::aux::arg_list >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&> >, boost::parameter::aux::empty_arg_list, std::integral_constant >; typename boost::result_of(Param0, Param1, const ArgPack&)>::type = bool]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/isomorphism.hpp:666:1: required from ‘typename boost::result_of(Param0, Param1, const typename boost::detail::convert_bgl_params_to_boost_parameter >::type&)>::type boost::isomorphism(const Param0&, const Param1&, const bgl_named_params&) [with Param0 = adjacency_list >; Param1 = adjacency_list >; P = iterator_property_map<__gnu_cxx::__normal_iterator >, adj_list_vertex_property_map >, int, int&, vertex_index_t>, void*, void*&>; T = vertex_isomorphism_t; R = no_property; typename result_of(Param0, Param1, const typename detail::convert_bgl_params_to_boost_parameter >::type&)>::type = bool; typename detail::convert_bgl_params_to_boost_parameter >::type = parameter::aux::arg_list >, adj_list_vertex_property_map >, int, int&, vertex_index_t>, void*, void*&> >, parameter::aux::empty_arg_list, std::integral_constant >]’ ordering.cpp:68:18: required from here /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::Convertible::~Convertible() [with X = void*; Y = void*]’ 37 | ~model() | ^ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:208:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 208 | BOOST_CONCEPT_USAGE(Convertible) { | ^~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::Convertible]’: /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements >]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:208:5: required from ‘struct boost::Convertible’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:206:3: required from ‘struct boost::ConvertibleConcept’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::ConvertibleConcept]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied >::value’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:45:51: [ skipping 6 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_ >, int, const int&, boost::vertex_index_t>, void*>)>’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/isomorphism.hpp:515:5: required from ‘bool boost::isomorphism(const Graph1&, const Graph2&, IsoMapping, Invariant1, Invariant2, std::size_t, IndexMap1, IndexMap2) [with Graph1 = adjacency_list >; Graph2 = adjacency_list >; IsoMapping = iterator_property_map<__gnu_cxx::__normal_iterator >, adj_list_vertex_property_map >, int, int&, vertex_index_t>, void*, void*&>; Invariant1 = degree_vertex_invariant >, int, const int&, vertex_index_t> >, adjacency_list > >; Invariant2 = degree_vertex_invariant >, int, const int&, vertex_index_t> >, adjacency_list > >; IndexMap1 = adj_list_vertex_property_map >, int, const int&, vertex_index_t>; IndexMap2 = adj_list_vertex_property_map >, int, const int&, vertex_index_t>; std::size_t = long unsigned int]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/isomorphism.hpp:651:42: required from ‘bool boost::graph::detail::isomorphism_impl::operator()(const Graph1&, const Graph2&, const ArgPack&) const [with ArgPack = boost::parameter::aux::arg_list >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&> >, boost::parameter::aux::empty_arg_list, std::integral_constant >; Graph1 = boost::adjacency_list >; Graph2 = boost::adjacency_list >]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/isomorphism.hpp:662:5: required from ‘typename boost::result_of(Param0, Param1, const ArgPack&)>::type boost::graph::isomorphism_with_named_params(const Param0&, const Param1&, const ArgPack&) [with Param0 = boost::adjacency_list >; Param1 = boost::adjacency_list >; ArgPack = boost::parameter::aux::arg_list >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&> >, boost::parameter::aux::empty_arg_list, std::integral_constant >; typename boost::result_of(Param0, Param1, const ArgPack&)>::type = bool]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/isomorphism.hpp:666:1: required from ‘typename boost::result_of(Param0, Param1, const typename boost::detail::convert_bgl_params_to_boost_parameter >::type&)>::type boost::isomorphism(const Param0&, const Param1&, const bgl_named_params&) [with Param0 = adjacency_list >; Param1 = adjacency_list >; P = iterator_property_map<__gnu_cxx::__normal_iterator >, adj_list_vertex_property_map >, int, int&, vertex_index_t>, void*, void*&>; T = vertex_isomorphism_t; R = no_property; typename result_of(Param0, Param1, const typename detail::convert_bgl_params_to_boost_parameter >::type&)>::type = bool; typename detail::convert_bgl_params_to_boost_parameter >::type = parameter::aux::arg_list >, adj_list_vertex_property_map >, int, int&, vertex_index_t>, void*, void*&> >, parameter::aux::empty_arg_list, std::integral_constant >]’ ordering.cpp:68:18: required from here /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::Convertible::~Convertible() [with X = boost::lvalue_property_map_tag; Y = boost::readable_property_map_tag]’ 37 | ~model() | ^ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:208:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 208 | BOOST_CONCEPT_USAGE(Convertible) { | ^~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements > > >]’: /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:145:5: required from ‘struct boost::Assignable<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:502:3: required from ‘struct boost::InputIterator<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:540:3: required from ‘struct boost::ForwardIterator<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:568:3: required from ‘struct boost::BidirectionalIterator<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:597:3: required from ‘struct boost::RandomAccessIterator<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:597:3: [ skipping 6 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/isomorphism.hpp:153:51: required from ‘boost::detail::isomorphism_algo::isomorphism_algo(const Graph1&, const Graph2&, IsoMapping, Invariant1, Invariant2, std::size_t, IndexMap1, IndexMap2) [with Graph1 = boost::adjacency_list >; Graph2 = boost::adjacency_list >; IsoMapping = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&>; Invariant1 = boost::degree_vertex_invariant >, int, const int&, boost::vertex_index_t> >, boost::adjacency_list > >; Invariant2 = boost::degree_vertex_invariant >, int, const int&, boost::vertex_index_t> >, boost::adjacency_list > >; IndexMap1 = boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>; IndexMap2 = boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>; std::size_t = long unsigned int]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/isomorphism.hpp:530:9: required from ‘bool boost::isomorphism(const Graph1&, const Graph2&, IsoMapping, Invariant1, Invariant2, std::size_t, IndexMap1, IndexMap2) [with Graph1 = adjacency_list >; Graph2 = adjacency_list >; IsoMapping = iterator_property_map<__gnu_cxx::__normal_iterator >, adj_list_vertex_property_map >, int, int&, vertex_index_t>, void*, void*&>; Invariant1 = degree_vertex_invariant >, int, const int&, vertex_index_t> >, adjacency_list > >; Invariant2 = degree_vertex_invariant >, int, const int&, vertex_index_t> >, adjacency_list > >; IndexMap1 = adj_list_vertex_property_map >, int, const int&, vertex_index_t>; IndexMap2 = adj_list_vertex_property_map >, int, const int&, vertex_index_t>; std::size_t = long unsigned int]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/isomorphism.hpp:651:42: required from ‘bool boost::graph::detail::isomorphism_impl::operator()(const Graph1&, const Graph2&, const ArgPack&) const [with ArgPack = boost::parameter::aux::arg_list >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&> >, boost::parameter::aux::empty_arg_list, std::integral_constant >; Graph1 = boost::adjacency_list >; Graph2 = boost::adjacency_list >]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/isomorphism.hpp:662:5: required from ‘typename boost::result_of(Param0, Param1, const ArgPack&)>::type boost::graph::isomorphism_with_named_params(const Param0&, const Param1&, const ArgPack&) [with Param0 = boost::adjacency_list >; Param1 = boost::adjacency_list >; ArgPack = boost::parameter::aux::arg_list >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&> >, boost::parameter::aux::empty_arg_list, std::integral_constant >; typename boost::result_of(Param0, Param1, const ArgPack&)>::type = bool]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/isomorphism.hpp:666:1: required from ‘typename boost::result_of(Param0, Param1, const typename boost::detail::convert_bgl_params_to_boost_parameter >::type&)>::type boost::isomorphism(const Param0&, const Param1&, const bgl_named_params&) [with Param0 = adjacency_list >; Param1 = adjacency_list >; P = iterator_property_map<__gnu_cxx::__normal_iterator >, adj_list_vertex_property_map >, int, int&, vertex_index_t>, void*, void*&>; T = vertex_isomorphism_t; R = no_property; typename result_of(Param0, Param1, const typename detail::convert_bgl_params_to_boost_parameter >::type&)>::type = bool; typename detail::convert_bgl_params_to_boost_parameter >::type = parameter::aux::arg_list >, adj_list_vertex_property_map >, int, int&, vertex_index_t>, void*, void*&> >, parameter::aux::empty_arg_list, std::integral_constant >]’ ordering.cpp:68:18: required from here /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::Assignable<__gnu_cxx::__normal_iterator > >]’ 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ^ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements > > >]’: /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:233:5: required from ‘struct boost::EqualityComparable<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:502:3: required from ‘struct boost::InputIterator<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:540:3: required from ‘struct boost::ForwardIterator<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:568:3: required from ‘struct boost::BidirectionalIterator<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:597:3: required from ‘struct boost::RandomAccessIterator<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:597:3: [ skipping 6 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/isomorphism.hpp:153:51: required from ‘boost::detail::isomorphism_algo::isomorphism_algo(const Graph1&, const Graph2&, IsoMapping, Invariant1, Invariant2, std::size_t, IndexMap1, IndexMap2) [with Graph1 = boost::adjacency_list >; Graph2 = boost::adjacency_list >; IsoMapping = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&>; Invariant1 = boost::degree_vertex_invariant >, int, const int&, boost::vertex_index_t> >, boost::adjacency_list > >; Invariant2 = boost::degree_vertex_invariant >, int, const int&, boost::vertex_index_t> >, boost::adjacency_list > >; IndexMap1 = boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>; IndexMap2 = boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>; std::size_t = long unsigned int]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/isomorphism.hpp:530:9: required from ‘bool boost::isomorphism(const Graph1&, const Graph2&, IsoMapping, Invariant1, Invariant2, std::size_t, IndexMap1, IndexMap2) [with Graph1 = adjacency_list >; Graph2 = adjacency_list >; IsoMapping = iterator_property_map<__gnu_cxx::__normal_iterator >, adj_list_vertex_property_map >, int, int&, vertex_index_t>, void*, void*&>; Invariant1 = degree_vertex_invariant >, int, const int&, vertex_index_t> >, adjacency_list > >; Invariant2 = degree_vertex_invariant >, int, const int&, vertex_index_t> >, adjacency_list > >; IndexMap1 = adj_list_vertex_property_map >, int, const int&, vertex_index_t>; IndexMap2 = adj_list_vertex_property_map >, int, const int&, vertex_index_t>; std::size_t = long unsigned int]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/isomorphism.hpp:651:42: required from ‘bool boost::graph::detail::isomorphism_impl::operator()(const Graph1&, const Graph2&, const ArgPack&) const [with ArgPack = boost::parameter::aux::arg_list >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&> >, boost::parameter::aux::empty_arg_list, std::integral_constant >; Graph1 = boost::adjacency_list >; Graph2 = boost::adjacency_list >]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/isomorphism.hpp:662:5: required from ‘typename boost::result_of(Param0, Param1, const ArgPack&)>::type boost::graph::isomorphism_with_named_params(const Param0&, const Param1&, const ArgPack&) [with Param0 = boost::adjacency_list >; Param1 = boost::adjacency_list >; ArgPack = boost::parameter::aux::arg_list >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&> >, boost::parameter::aux::empty_arg_list, std::integral_constant >; typename boost::result_of(Param0, Param1, const ArgPack&)>::type = bool]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/isomorphism.hpp:666:1: required from ‘typename boost::result_of(Param0, Param1, const typename boost::detail::convert_bgl_params_to_boost_parameter >::type&)>::type boost::isomorphism(const Param0&, const Param1&, const bgl_named_params&) [with Param0 = adjacency_list >; Param1 = adjacency_list >; P = iterator_property_map<__gnu_cxx::__normal_iterator >, adj_list_vertex_property_map >, int, int&, vertex_index_t>, void*, void*&>; T = vertex_isomorphism_t; R = no_property; typename result_of(Param0, Param1, const typename detail::convert_bgl_params_to_boost_parameter >::type&)>::type = bool; typename detail::convert_bgl_params_to_boost_parameter >::type = parameter::aux::arg_list >, adj_list_vertex_property_map >, int, int&, vertex_index_t>, void*, void*&> >, parameter::aux::empty_arg_list, std::integral_constant >]’ ordering.cpp:68:18: required from here /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::EqualityComparable<__gnu_cxx::__normal_iterator > >]’ 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ^ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements > > >]’: /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:512:7: required from ‘struct boost::InputIterator<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:540:3: required from ‘struct boost::ForwardIterator<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:568:3: required from ‘struct boost::BidirectionalIterator<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:597:3: required from ‘struct boost::RandomAccessIterator<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:597:3: required from ‘struct boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:32:62: [ skipping 5 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/isomorphism.hpp:153:51: required from ‘boost::detail::isomorphism_algo::isomorphism_algo(const Graph1&, const Graph2&, IsoMapping, Invariant1, Invariant2, std::size_t, IndexMap1, IndexMap2) [with Graph1 = boost::adjacency_list >; Graph2 = boost::adjacency_list >; IsoMapping = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&>; Invariant1 = boost::degree_vertex_invariant >, int, const int&, boost::vertex_index_t> >, boost::adjacency_list > >; Invariant2 = boost::degree_vertex_invariant >, int, const int&, boost::vertex_index_t> >, boost::adjacency_list > >; IndexMap1 = boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>; IndexMap2 = boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>; std::size_t = long unsigned int]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/isomorphism.hpp:530:9: required from ‘bool boost::isomorphism(const Graph1&, const Graph2&, IsoMapping, Invariant1, Invariant2, std::size_t, IndexMap1, IndexMap2) [with Graph1 = adjacency_list >; Graph2 = adjacency_list >; IsoMapping = iterator_property_map<__gnu_cxx::__normal_iterator >, adj_list_vertex_property_map >, int, int&, vertex_index_t>, void*, void*&>; Invariant1 = degree_vertex_invariant >, int, const int&, vertex_index_t> >, adjacency_list > >; Invariant2 = degree_vertex_invariant >, int, const int&, vertex_index_t> >, adjacency_list > >; IndexMap1 = adj_list_vertex_property_map >, int, const int&, vertex_index_t>; IndexMap2 = adj_list_vertex_property_map >, int, const int&, vertex_index_t>; std::size_t = long unsigned int]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/isomorphism.hpp:651:42: required from ‘bool boost::graph::detail::isomorphism_impl::operator()(const Graph1&, const Graph2&, const ArgPack&) const [with ArgPack = boost::parameter::aux::arg_list >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&> >, boost::parameter::aux::empty_arg_list, std::integral_constant >; Graph1 = boost::adjacency_list >; Graph2 = boost::adjacency_list >]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/isomorphism.hpp:662:5: required from ‘typename boost::result_of(Param0, Param1, const ArgPack&)>::type boost::graph::isomorphism_with_named_params(const Param0&, const Param1&, const ArgPack&) [with Param0 = boost::adjacency_list >; Param1 = boost::adjacency_list >; ArgPack = boost::parameter::aux::arg_list >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&> >, boost::parameter::aux::empty_arg_list, std::integral_constant >; typename boost::result_of(Param0, Param1, const ArgPack&)>::type = bool]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/isomorphism.hpp:666:1: required from ‘typename boost::result_of(Param0, Param1, const typename boost::detail::convert_bgl_params_to_boost_parameter >::type&)>::type boost::isomorphism(const Param0&, const Param1&, const bgl_named_params&) [with Param0 = adjacency_list >; Param1 = adjacency_list >; P = iterator_property_map<__gnu_cxx::__normal_iterator >, adj_list_vertex_property_map >, int, int&, vertex_index_t>, void*, void*&>; T = vertex_isomorphism_t; R = no_property; typename result_of(Param0, Param1, const typename detail::convert_bgl_params_to_boost_parameter >::type&)>::type = bool; typename detail::convert_bgl_params_to_boost_parameter >::type = parameter::aux::arg_list >, adj_list_vertex_property_map >, int, int&, vertex_index_t>, void*, void*&> >, parameter::aux::empty_arg_list, std::integral_constant >]’ ordering.cpp:68:18: required from here /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::InputIterator<__gnu_cxx::__normal_iterator > >]’ 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ^ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements > > >]’: /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:543:7: required from ‘struct boost::ForwardIterator<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:568:3: required from ‘struct boost::BidirectionalIterator<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:597:3: required from ‘struct boost::RandomAccessIterator<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:597:3: required from ‘struct boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator > >]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:42:5: [ skipping 4 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/isomorphism.hpp:153:51: required from ‘boost::detail::isomorphism_algo::isomorphism_algo(const Graph1&, const Graph2&, IsoMapping, Invariant1, Invariant2, std::size_t, IndexMap1, IndexMap2) [with Graph1 = boost::adjacency_list >; Graph2 = boost::adjacency_list >; IsoMapping = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&>; Invariant1 = boost::degree_vertex_invariant >, int, const int&, boost::vertex_index_t> >, boost::adjacency_list > >; Invariant2 = boost::degree_vertex_invariant >, int, const int&, boost::vertex_index_t> >, boost::adjacency_list > >; IndexMap1 = boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>; IndexMap2 = boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>; std::size_t = long unsigned int]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/isomorphism.hpp:530:9: required from ‘bool boost::isomorphism(const Graph1&, const Graph2&, IsoMapping, Invariant1, Invariant2, std::size_t, IndexMap1, IndexMap2) [with Graph1 = adjacency_list >; Graph2 = adjacency_list >; IsoMapping = iterator_property_map<__gnu_cxx::__normal_iterator >, adj_list_vertex_property_map >, int, int&, vertex_index_t>, void*, void*&>; Invariant1 = degree_vertex_invariant >, int, const int&, vertex_index_t> >, adjacency_list > >; Invariant2 = degree_vertex_invariant >, int, const int&, vertex_index_t> >, adjacency_list > >; IndexMap1 = adj_list_vertex_property_map >, int, const int&, vertex_index_t>; IndexMap2 = adj_list_vertex_property_map >, int, const int&, vertex_index_t>; std::size_t = long unsigned int]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/isomorphism.hpp:651:42: required from ‘bool boost::graph::detail::isomorphism_impl::operator()(const Graph1&, const Graph2&, const ArgPack&) const [with ArgPack = boost::parameter::aux::arg_list >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&> >, boost::parameter::aux::empty_arg_list, std::integral_constant >; Graph1 = boost::adjacency_list >; Graph2 = boost::adjacency_list >]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/isomorphism.hpp:662:5: required from ‘typename boost::result_of(Param0, Param1, const ArgPack&)>::type boost::graph::isomorphism_with_named_params(const Param0&, const Param1&, const ArgPack&) [with Param0 = boost::adjacency_list >; Param1 = boost::adjacency_list >; ArgPack = boost::parameter::aux::arg_list >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&> >, boost::parameter::aux::empty_arg_list, std::integral_constant >; typename boost::result_of(Param0, Param1, const ArgPack&)>::type = bool]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/isomorphism.hpp:666:1: required from ‘typename boost::result_of(Param0, Param1, const typename boost::detail::convert_bgl_params_to_boost_parameter >::type&)>::type boost::isomorphism(const Param0&, const Param1&, const bgl_named_params&) [with Param0 = adjacency_list >; Param1 = adjacency_list >; P = iterator_property_map<__gnu_cxx::__normal_iterator >, adj_list_vertex_property_map >, int, int&, vertex_index_t>, void*, void*&>; T = vertex_isomorphism_t; R = no_property; typename result_of(Param0, Param1, const typename detail::convert_bgl_params_to_boost_parameter >::type&)>::type = bool; typename detail::convert_bgl_params_to_boost_parameter >::type = parameter::aux::arg_list >, adj_list_vertex_property_map >, int, int&, vertex_index_t>, void*, void*&> >, parameter::aux::empty_arg_list, std::integral_constant >]’ ordering.cpp:68:18: required from here /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::ForwardIterator<__gnu_cxx::__normal_iterator > >]’ 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ^ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements > > >]’: /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:571:7: required from ‘struct boost::BidirectionalIterator<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:597:3: required from ‘struct boost::RandomAccessIterator<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:597:3: required from ‘struct boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator > >]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied > > >::value’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:45:51: [ skipping 3 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/isomorphism.hpp:153:51: required from ‘boost::detail::isomorphism_algo::isomorphism_algo(const Graph1&, const Graph2&, IsoMapping, Invariant1, Invariant2, std::size_t, IndexMap1, IndexMap2) [with Graph1 = boost::adjacency_list >; Graph2 = boost::adjacency_list >; IsoMapping = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&>; Invariant1 = boost::degree_vertex_invariant >, int, const int&, boost::vertex_index_t> >, boost::adjacency_list > >; Invariant2 = boost::degree_vertex_invariant >, int, const int&, boost::vertex_index_t> >, boost::adjacency_list > >; IndexMap1 = boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>; IndexMap2 = boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>; std::size_t = long unsigned int]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/isomorphism.hpp:530:9: required from ‘bool boost::isomorphism(const Graph1&, const Graph2&, IsoMapping, Invariant1, Invariant2, std::size_t, IndexMap1, IndexMap2) [with Graph1 = adjacency_list >; Graph2 = adjacency_list >; IsoMapping = iterator_property_map<__gnu_cxx::__normal_iterator >, adj_list_vertex_property_map >, int, int&, vertex_index_t>, void*, void*&>; Invariant1 = degree_vertex_invariant >, int, const int&, vertex_index_t> >, adjacency_list > >; Invariant2 = degree_vertex_invariant >, int, const int&, vertex_index_t> >, adjacency_list > >; IndexMap1 = adj_list_vertex_property_map >, int, const int&, vertex_index_t>; IndexMap2 = adj_list_vertex_property_map >, int, const int&, vertex_index_t>; std::size_t = long unsigned int]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/isomorphism.hpp:651:42: required from ‘bool boost::graph::detail::isomorphism_impl::operator()(const Graph1&, const Graph2&, const ArgPack&) const [with ArgPack = boost::parameter::aux::arg_list >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&> >, boost::parameter::aux::empty_arg_list, std::integral_constant >; Graph1 = boost::adjacency_list >; Graph2 = boost::adjacency_list >]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/isomorphism.hpp:662:5: required from ‘typename boost::result_of(Param0, Param1, const ArgPack&)>::type boost::graph::isomorphism_with_named_params(const Param0&, const Param1&, const ArgPack&) [with Param0 = boost::adjacency_list >; Param1 = boost::adjacency_list >; ArgPack = boost::parameter::aux::arg_list >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&> >, boost::parameter::aux::empty_arg_list, std::integral_constant >; typename boost::result_of(Param0, Param1, const ArgPack&)>::type = bool]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/isomorphism.hpp:666:1: required from ‘typename boost::result_of(Param0, Param1, const typename boost::detail::convert_bgl_params_to_boost_parameter >::type&)>::type boost::isomorphism(const Param0&, const Param1&, const bgl_named_params&) [with Param0 = adjacency_list >; Param1 = adjacency_list >; P = iterator_property_map<__gnu_cxx::__normal_iterator >, adj_list_vertex_property_map >, int, int&, vertex_index_t>, void*, void*&>; T = vertex_isomorphism_t; R = no_property; typename result_of(Param0, Param1, const typename detail::convert_bgl_params_to_boost_parameter >::type&)>::type = bool; typename detail::convert_bgl_params_to_boost_parameter >::type = parameter::aux::arg_list >, adj_list_vertex_property_map >, int, int&, vertex_index_t>, void*, void*&> >, parameter::aux::empty_arg_list, std::integral_constant >]’ ordering.cpp:68:18: required from here /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::BidirectionalIterator<__gnu_cxx::__normal_iterator > >]’ 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ^ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements > > >]’: /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:253:5: required from ‘struct boost::Comparable<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:597:3: required from ‘struct boost::RandomAccessIterator<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:597:3: required from ‘struct boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator > >]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied > > >::value’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:45:51: [ skipping 3 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/isomorphism.hpp:153:51: required from ‘boost::detail::isomorphism_algo::isomorphism_algo(const Graph1&, const Graph2&, IsoMapping, Invariant1, Invariant2, std::size_t, IndexMap1, IndexMap2) [with Graph1 = boost::adjacency_list >; Graph2 = boost::adjacency_list >; IsoMapping = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&>; Invariant1 = boost::degree_vertex_invariant >, int, const int&, boost::vertex_index_t> >, boost::adjacency_list > >; Invariant2 = boost::degree_vertex_invariant >, int, const int&, boost::vertex_index_t> >, boost::adjacency_list > >; IndexMap1 = boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>; IndexMap2 = boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>; std::size_t = long unsigned int]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/isomorphism.hpp:530:9: required from ‘bool boost::isomorphism(const Graph1&, const Graph2&, IsoMapping, Invariant1, Invariant2, std::size_t, IndexMap1, IndexMap2) [with Graph1 = adjacency_list >; Graph2 = adjacency_list >; IsoMapping = iterator_property_map<__gnu_cxx::__normal_iterator >, adj_list_vertex_property_map >, int, int&, vertex_index_t>, void*, void*&>; Invariant1 = degree_vertex_invariant >, int, const int&, vertex_index_t> >, adjacency_list > >; Invariant2 = degree_vertex_invariant >, int, const int&, vertex_index_t> >, adjacency_list > >; IndexMap1 = adj_list_vertex_property_map >, int, const int&, vertex_index_t>; IndexMap2 = adj_list_vertex_property_map >, int, const int&, vertex_index_t>; std::size_t = long unsigned int]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/isomorphism.hpp:651:42: required from ‘bool boost::graph::detail::isomorphism_impl::operator()(const Graph1&, const Graph2&, const ArgPack&) const [with ArgPack = boost::parameter::aux::arg_list >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&> >, boost::parameter::aux::empty_arg_list, std::integral_constant >; Graph1 = boost::adjacency_list >; Graph2 = boost::adjacency_list >]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/isomorphism.hpp:662:5: required from ‘typename boost::result_of(Param0, Param1, const ArgPack&)>::type boost::graph::isomorphism_with_named_params(const Param0&, const Param1&, const ArgPack&) [with Param0 = boost::adjacency_list >; Param1 = boost::adjacency_list >; ArgPack = boost::parameter::aux::arg_list >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&> >, boost::parameter::aux::empty_arg_list, std::integral_constant >; typename boost::result_of(Param0, Param1, const ArgPack&)>::type = bool]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/isomorphism.hpp:666:1: required from ‘typename boost::result_of(Param0, Param1, const typename boost::detail::convert_bgl_params_to_boost_parameter >::type&)>::type boost::isomorphism(const Param0&, const Param1&, const bgl_named_params&) [with Param0 = adjacency_list >; Param1 = adjacency_list >; P = iterator_property_map<__gnu_cxx::__normal_iterator >, adj_list_vertex_property_map >, int, int&, vertex_index_t>, void*, void*&>; T = vertex_isomorphism_t; R = no_property; typename result_of(Param0, Param1, const typename detail::convert_bgl_params_to_boost_parameter >::type&)>::type = bool; typename detail::convert_bgl_params_to_boost_parameter >::type = parameter::aux::arg_list >, adj_list_vertex_property_map >, int, int&, vertex_index_t>, void*, void*&> >, parameter::aux::empty_arg_list, std::integral_constant >]’ ordering.cpp:68:18: required from here /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::Comparable<__gnu_cxx::__normal_iterator > >]’ 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ^ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements > > >]’: /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:601:7: required from ‘struct boost::RandomAccessIterator<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:597:3: required from ‘struct boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator > >]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied > > >::value’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied > > >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:72:8: [ skipping 2 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/isomorphism.hpp:153:51: required from ‘boost::detail::isomorphism_algo::isomorphism_algo(const Graph1&, const Graph2&, IsoMapping, Invariant1, Invariant2, std::size_t, IndexMap1, IndexMap2) [with Graph1 = boost::adjacency_list >; Graph2 = boost::adjacency_list >; IsoMapping = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&>; Invariant1 = boost::degree_vertex_invariant >, int, const int&, boost::vertex_index_t> >, boost::adjacency_list > >; Invariant2 = boost::degree_vertex_invariant >, int, const int&, boost::vertex_index_t> >, boost::adjacency_list > >; IndexMap1 = boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>; IndexMap2 = boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>; std::size_t = long unsigned int]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/isomorphism.hpp:530:9: required from ‘bool boost::isomorphism(const Graph1&, const Graph2&, IsoMapping, Invariant1, Invariant2, std::size_t, IndexMap1, IndexMap2) [with Graph1 = adjacency_list >; Graph2 = adjacency_list >; IsoMapping = iterator_property_map<__gnu_cxx::__normal_iterator >, adj_list_vertex_property_map >, int, int&, vertex_index_t>, void*, void*&>; Invariant1 = degree_vertex_invariant >, int, const int&, vertex_index_t> >, adjacency_list > >; Invariant2 = degree_vertex_invariant >, int, const int&, vertex_index_t> >, adjacency_list > >; IndexMap1 = adj_list_vertex_property_map >, int, const int&, vertex_index_t>; IndexMap2 = adj_list_vertex_property_map >, int, const int&, vertex_index_t>; std::size_t = long unsigned int]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/isomorphism.hpp:651:42: required from ‘bool boost::graph::detail::isomorphism_impl::operator()(const Graph1&, const Graph2&, const ArgPack&) const [with ArgPack = boost::parameter::aux::arg_list >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&> >, boost::parameter::aux::empty_arg_list, std::integral_constant >; Graph1 = boost::adjacency_list >; Graph2 = boost::adjacency_list >]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/isomorphism.hpp:662:5: required from ‘typename boost::result_of(Param0, Param1, const ArgPack&)>::type boost::graph::isomorphism_with_named_params(const Param0&, const Param1&, const ArgPack&) [with Param0 = boost::adjacency_list >; Param1 = boost::adjacency_list >; ArgPack = boost::parameter::aux::arg_list >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&> >, boost::parameter::aux::empty_arg_list, std::integral_constant >; typename boost::result_of(Param0, Param1, const ArgPack&)>::type = bool]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/isomorphism.hpp:666:1: required from ‘typename boost::result_of(Param0, Param1, const typename boost::detail::convert_bgl_params_to_boost_parameter >::type&)>::type boost::isomorphism(const Param0&, const Param1&, const bgl_named_params&) [with Param0 = adjacency_list >; Param1 = adjacency_list >; P = iterator_property_map<__gnu_cxx::__normal_iterator >, adj_list_vertex_property_map >, int, int&, vertex_index_t>, void*, void*&>; T = vertex_isomorphism_t; R = no_property; typename result_of(Param0, Param1, const typename detail::convert_bgl_params_to_boost_parameter >::type&)>::type = bool; typename detail::convert_bgl_params_to_boost_parameter >::type = parameter::aux::arg_list >, adj_list_vertex_property_map >, int, int&, vertex_index_t>, void*, void*&> >, parameter::aux::empty_arg_list, std::integral_constant >]’ ordering.cpp:68:18: required from here /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::RandomAccessIterator<__gnu_cxx::__normal_iterator > >]’ 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ^ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator > >]’: /home/omnipath/local/R/4.4-3.20/BH/include/boost/property_map/property_map.hpp:354:5: required from ‘boost::safe_iterator_property_map >::value_type, typename std::iterator_traits< >::reference> boost::make_safe_iterator_property_map(RAIter, std::size_t, ID) [with RAIter = __gnu_cxx::__normal_iterator >; ID = adj_list_vertex_property_map >, int, const int&, vertex_index_t>; typename std::iterator_traits< >::value_type = char; typename std::iterator_traits< >::reference = char&; std::size_t = long unsigned int]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/isomorphism.hpp:153:51: required from ‘boost::detail::isomorphism_algo::isomorphism_algo(const Graph1&, const Graph2&, IsoMapping, Invariant1, Invariant2, std::size_t, IndexMap1, IndexMap2) [with Graph1 = boost::adjacency_list >; Graph2 = boost::adjacency_list >; IsoMapping = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&>; Invariant1 = boost::degree_vertex_invariant >, int, const int&, boost::vertex_index_t> >, boost::adjacency_list > >; Invariant2 = boost::degree_vertex_invariant >, int, const int&, boost::vertex_index_t> >, boost::adjacency_list > >; IndexMap1 = boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>; IndexMap2 = boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>; std::size_t = long unsigned int]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/isomorphism.hpp:530:9: required from ‘bool boost::isomorphism(const Graph1&, const Graph2&, IsoMapping, Invariant1, Invariant2, std::size_t, IndexMap1, IndexMap2) [with Graph1 = adjacency_list >; Graph2 = adjacency_list >; IsoMapping = iterator_property_map<__gnu_cxx::__normal_iterator >, adj_list_vertex_property_map >, int, int&, vertex_index_t>, void*, void*&>; Invariant1 = degree_vertex_invariant >, int, const int&, vertex_index_t> >, adjacency_list > >; Invariant2 = degree_vertex_invariant >, int, const int&, vertex_index_t> >, adjacency_list > >; IndexMap1 = adj_list_vertex_property_map >, int, const int&, vertex_index_t>; IndexMap2 = adj_list_vertex_property_map >, int, const int&, vertex_index_t>; std::size_t = long unsigned int]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/isomorphism.hpp:651:42: required from ‘bool boost::graph::detail::isomorphism_impl::operator()(const Graph1&, const Graph2&, const ArgPack&) const [with ArgPack = boost::parameter::aux::arg_list >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&> >, boost::parameter::aux::empty_arg_list, std::integral_constant >; Graph1 = boost::adjacency_list >; Graph2 = boost::adjacency_list >]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/isomorphism.hpp:662:5: required from ‘typename boost::result_of(Param0, Param1, const ArgPack&)>::type boost::graph::isomorphism_with_named_params(const Param0&, const Param1&, const ArgPack&) [with Param0 = boost::adjacency_list >; Param1 = boost::adjacency_list >; ArgPack = boost::parameter::aux::arg_list >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&> >, boost::parameter::aux::empty_arg_list, std::integral_constant >; typename boost::result_of(Param0, Param1, const ArgPack&)>::type = bool]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/isomorphism.hpp:666:1: required from ‘typename boost::result_of(Param0, Param1, const typename boost::detail::convert_bgl_params_to_boost_parameter >::type&)>::type boost::isomorphism(const Param0&, const Param1&, const bgl_named_params&) [with Param0 = adjacency_list >; Param1 = adjacency_list >; P = iterator_property_map<__gnu_cxx::__normal_iterator >, adj_list_vertex_property_map >, int, int&, vertex_index_t>, void*, void*&>; T = vertex_isomorphism_t; R = no_property; typename result_of(Param0, Param1, const typename detail::convert_bgl_params_to_boost_parameter >::type&)>::type = bool; typename detail::convert_bgl_params_to_boost_parameter >::type = parameter::aux::arg_list >, adj_list_vertex_property_map >, int, int&, vertex_index_t>, void*, void*&> >, parameter::aux::empty_arg_list, std::integral_constant >]’ ordering.cpp:68:18: required from here /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:597:17: note: in a call to non-static member function ‘boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator > >::~RandomAccessIteratorConcept()’ 597 | BOOST_concept(RandomAccessIterator,(TT)) | ^~~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/preprocessor/cat.hpp:29:34: note: in definition of macro ‘BOOST_PP_CAT_I’ 29 | # define BOOST_PP_CAT_I(a, b) a ## b | ^ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/concept_def.hpp:23:12: note: in expansion of macro ‘BOOST_PP_CAT’ 23 | struct BOOST_PP_CAT(name,Concept) \ | ^~~~~~~~~~~~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:597:3: note: in expansion of macro ‘BOOST_concept’ 597 | BOOST_concept(RandomAccessIterator,(TT)) | ^~~~~~~~~~~~~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements > > >]’: /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:167:5: required from ‘struct boost::CopyConstructible<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/range/concepts.hpp:125:16: required from ‘struct boost::range_detail::IncrementableIteratorConcept<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/range/concepts.hpp:147:16: required from ‘struct boost::range_detail::SinglePassIteratorConcept<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::range_detail::SinglePassIteratorConcept<__gnu_cxx::__normal_iterator > >]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied > > >::value’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:45:51: [ skipping 11 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/isomorphism.hpp:172:21: required from ‘bool boost::detail::isomorphism_algo::test_isomorphism() [with Graph1 = boost::adjacency_list >; Graph2 = boost::adjacency_list >; IsoMapping = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&>; Invariant1 = boost::degree_vertex_invariant >, int, const int&, boost::vertex_index_t> >, boost::adjacency_list > >; Invariant2 = boost::degree_vertex_invariant >, int, const int&, boost::vertex_index_t> >, boost::adjacency_list > >; IndexMap1 = boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>; IndexMap2 = boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/isomorphism.hpp:532:33: required from ‘bool boost::isomorphism(const Graph1&, const Graph2&, IsoMapping, Invariant1, Invariant2, std::size_t, IndexMap1, IndexMap2) [with Graph1 = adjacency_list >; Graph2 = adjacency_list >; IsoMapping = iterator_property_map<__gnu_cxx::__normal_iterator >, adj_list_vertex_property_map >, int, int&, vertex_index_t>, void*, void*&>; Invariant1 = degree_vertex_invariant >, int, const int&, vertex_index_t> >, adjacency_list > >; Invariant2 = degree_vertex_invariant >, int, const int&, vertex_index_t> >, adjacency_list > >; IndexMap1 = adj_list_vertex_property_map >, int, const int&, vertex_index_t>; IndexMap2 = adj_list_vertex_property_map >, int, const int&, vertex_index_t>; std::size_t = long unsigned int]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/isomorphism.hpp:651:42: required from ‘bool boost::graph::detail::isomorphism_impl::operator()(const Graph1&, const Graph2&, const ArgPack&) const [with ArgPack = boost::parameter::aux::arg_list >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&> >, boost::parameter::aux::empty_arg_list, std::integral_constant >; Graph1 = boost::adjacency_list >; Graph2 = boost::adjacency_list >]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/isomorphism.hpp:662:5: required from ‘typename boost::result_of(Param0, Param1, const ArgPack&)>::type boost::graph::isomorphism_with_named_params(const Param0&, const Param1&, const ArgPack&) [with Param0 = boost::adjacency_list >; Param1 = boost::adjacency_list >; ArgPack = boost::parameter::aux::arg_list >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&> >, boost::parameter::aux::empty_arg_list, std::integral_constant >; typename boost::result_of(Param0, Param1, const ArgPack&)>::type = bool]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/isomorphism.hpp:666:1: required from ‘typename boost::result_of(Param0, Param1, const typename boost::detail::convert_bgl_params_to_boost_parameter >::type&)>::type boost::isomorphism(const Param0&, const Param1&, const bgl_named_params&) [with Param0 = adjacency_list >; Param1 = adjacency_list >; P = iterator_property_map<__gnu_cxx::__normal_iterator >, adj_list_vertex_property_map >, int, int&, vertex_index_t>, void*, void*&>; T = vertex_isomorphism_t; R = no_property; typename result_of(Param0, Param1, const typename detail::convert_bgl_params_to_boost_parameter >::type&)>::type = bool; typename detail::convert_bgl_params_to_boost_parameter >::type = parameter::aux::arg_list >, adj_list_vertex_property_map >, int, int&, vertex_index_t>, void*, void*&> >, parameter::aux::empty_arg_list, std::integral_constant >]’ ordering.cpp:68:18: required from here /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::CopyConstructible<__gnu_cxx::__normal_iterator > >]’ 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ^ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements >]’: /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:208:5: required from ‘struct boost::Convertible’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::Convertible]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied >::value’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_)>’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/iterator/iterator_concepts.hpp:114:7: [ skipping 15 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/isomorphism.hpp:172:21: required from ‘bool boost::detail::isomorphism_algo::test_isomorphism() [with Graph1 = boost::adjacency_list >; Graph2 = boost::adjacency_list >; IsoMapping = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&>; Invariant1 = boost::degree_vertex_invariant >, int, const int&, boost::vertex_index_t> >, boost::adjacency_list > >; Invariant2 = boost::degree_vertex_invariant >, int, const int&, boost::vertex_index_t> >, boost::adjacency_list > >; IndexMap1 = boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>; IndexMap2 = boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/isomorphism.hpp:532:33: required from ‘bool boost::isomorphism(const Graph1&, const Graph2&, IsoMapping, Invariant1, Invariant2, std::size_t, IndexMap1, IndexMap2) [with Graph1 = adjacency_list >; Graph2 = adjacency_list >; IsoMapping = iterator_property_map<__gnu_cxx::__normal_iterator >, adj_list_vertex_property_map >, int, int&, vertex_index_t>, void*, void*&>; Invariant1 = degree_vertex_invariant >, int, const int&, vertex_index_t> >, adjacency_list > >; Invariant2 = degree_vertex_invariant >, int, const int&, vertex_index_t> >, adjacency_list > >; IndexMap1 = adj_list_vertex_property_map >, int, const int&, vertex_index_t>; IndexMap2 = adj_list_vertex_property_map >, int, const int&, vertex_index_t>; std::size_t = long unsigned int]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/isomorphism.hpp:651:42: required from ‘bool boost::graph::detail::isomorphism_impl::operator()(const Graph1&, const Graph2&, const ArgPack&) const [with ArgPack = boost::parameter::aux::arg_list >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&> >, boost::parameter::aux::empty_arg_list, std::integral_constant >; Graph1 = boost::adjacency_list >; Graph2 = boost::adjacency_list >]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/isomorphism.hpp:662:5: required from ‘typename boost::result_of(Param0, Param1, const ArgPack&)>::type boost::graph::isomorphism_with_named_params(const Param0&, const Param1&, const ArgPack&) [with Param0 = boost::adjacency_list >; Param1 = boost::adjacency_list >; ArgPack = boost::parameter::aux::arg_list >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&> >, boost::parameter::aux::empty_arg_list, std::integral_constant >; typename boost::result_of(Param0, Param1, const ArgPack&)>::type = bool]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/isomorphism.hpp:666:1: required from ‘typename boost::result_of(Param0, Param1, const typename boost::detail::convert_bgl_params_to_boost_parameter >::type&)>::type boost::isomorphism(const Param0&, const Param1&, const bgl_named_params&) [with Param0 = adjacency_list >; Param1 = adjacency_list >; P = iterator_property_map<__gnu_cxx::__normal_iterator >, adj_list_vertex_property_map >, int, int&, vertex_index_t>, void*, void*&>; T = vertex_isomorphism_t; R = no_property; typename result_of(Param0, Param1, const typename detail::convert_bgl_params_to_boost_parameter >::type&)>::type = bool; typename detail::convert_bgl_params_to_boost_parameter >::type = parameter::aux::arg_list >, adj_list_vertex_property_map >, int, int&, vertex_index_t>, void*, void*&> >, parameter::aux::empty_arg_list, std::integral_constant >]’ ordering.cpp:68:18: required from here /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::Convertible]’ 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ^ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::Convertible]’: /home/omnipath/local/R/4.4-3.20/BH/include/boost/iterator/iterator_concepts.hpp:114:7: required from ‘struct boost::range_detail::IncrementableIteratorConcept<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/range/concepts.hpp:147:16: required from ‘struct boost::range_detail::SinglePassIteratorConcept<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::range_detail::SinglePassIteratorConcept<__gnu_cxx::__normal_iterator > >]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied > > >::value’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied > > >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:72:8: [ skipping 10 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/isomorphism.hpp:172:21: required from ‘bool boost::detail::isomorphism_algo::test_isomorphism() [with Graph1 = boost::adjacency_list >; Graph2 = boost::adjacency_list >; IsoMapping = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&>; Invariant1 = boost::degree_vertex_invariant >, int, const int&, boost::vertex_index_t> >, boost::adjacency_list > >; Invariant2 = boost::degree_vertex_invariant >, int, const int&, boost::vertex_index_t> >, boost::adjacency_list > >; IndexMap1 = boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>; IndexMap2 = boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/isomorphism.hpp:532:33: required from ‘bool boost::isomorphism(const Graph1&, const Graph2&, IsoMapping, Invariant1, Invariant2, std::size_t, IndexMap1, IndexMap2) [with Graph1 = adjacency_list >; Graph2 = adjacency_list >; IsoMapping = iterator_property_map<__gnu_cxx::__normal_iterator >, adj_list_vertex_property_map >, int, int&, vertex_index_t>, void*, void*&>; Invariant1 = degree_vertex_invariant >, int, const int&, vertex_index_t> >, adjacency_list > >; Invariant2 = degree_vertex_invariant >, int, const int&, vertex_index_t> >, adjacency_list > >; IndexMap1 = adj_list_vertex_property_map >, int, const int&, vertex_index_t>; IndexMap2 = adj_list_vertex_property_map >, int, const int&, vertex_index_t>; std::size_t = long unsigned int]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/isomorphism.hpp:651:42: required from ‘bool boost::graph::detail::isomorphism_impl::operator()(const Graph1&, const Graph2&, const ArgPack&) const [with ArgPack = boost::parameter::aux::arg_list >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&> >, boost::parameter::aux::empty_arg_list, std::integral_constant >; Graph1 = boost::adjacency_list >; Graph2 = boost::adjacency_list >]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/isomorphism.hpp:662:5: required from ‘typename boost::result_of(Param0, Param1, const ArgPack&)>::type boost::graph::isomorphism_with_named_params(const Param0&, const Param1&, const ArgPack&) [with Param0 = boost::adjacency_list >; Param1 = boost::adjacency_list >; ArgPack = boost::parameter::aux::arg_list >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&> >, boost::parameter::aux::empty_arg_list, std::integral_constant >; typename boost::result_of(Param0, Param1, const ArgPack&)>::type = bool]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/isomorphism.hpp:666:1: required from ‘typename boost::result_of(Param0, Param1, const typename boost::detail::convert_bgl_params_to_boost_parameter >::type&)>::type boost::isomorphism(const Param0&, const Param1&, const bgl_named_params&) [with Param0 = adjacency_list >; Param1 = adjacency_list >; P = iterator_property_map<__gnu_cxx::__normal_iterator >, adj_list_vertex_property_map >, int, int&, vertex_index_t>, void*, void*&>; T = vertex_isomorphism_t; R = no_property; typename result_of(Param0, Param1, const typename detail::convert_bgl_params_to_boost_parameter >::type&)>::type = bool; typename detail::convert_bgl_params_to_boost_parameter >::type = parameter::aux::arg_list >, adj_list_vertex_property_map >, int, int&, vertex_index_t>, void*, void*&> >, parameter::aux::empty_arg_list, std::integral_constant >]’ ordering.cpp:68:18: required from here /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::Convertible::~Convertible() [with X = boost::iterators::random_access_traversal_tag; Y = boost::iterators::incrementable_traversal_tag]’ 37 | ~model() | ^ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:208:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 208 | BOOST_CONCEPT_USAGE(Convertible) { | ^~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements > > >]’: /home/omnipath/local/R/4.4-3.20/BH/include/boost/range/concepts.hpp:136:13: required from ‘struct boost::range_detail::IncrementableIteratorConcept<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/range/concepts.hpp:147:16: required from ‘struct boost::range_detail::SinglePassIteratorConcept<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::range_detail::SinglePassIteratorConcept<__gnu_cxx::__normal_iterator > >]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied > > >::value’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied > > >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:72:8: [ skipping 10 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/isomorphism.hpp:172:21: required from ‘bool boost::detail::isomorphism_algo::test_isomorphism() [with Graph1 = boost::adjacency_list >; Graph2 = boost::adjacency_list >; IsoMapping = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&>; Invariant1 = boost::degree_vertex_invariant >, int, const int&, boost::vertex_index_t> >, boost::adjacency_list > >; Invariant2 = boost::degree_vertex_invariant >, int, const int&, boost::vertex_index_t> >, boost::adjacency_list > >; IndexMap1 = boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>; IndexMap2 = boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/isomorphism.hpp:532:33: required from ‘bool boost::isomorphism(const Graph1&, const Graph2&, IsoMapping, Invariant1, Invariant2, std::size_t, IndexMap1, IndexMap2) [with Graph1 = adjacency_list >; Graph2 = adjacency_list >; IsoMapping = iterator_property_map<__gnu_cxx::__normal_iterator >, adj_list_vertex_property_map >, int, int&, vertex_index_t>, void*, void*&>; Invariant1 = degree_vertex_invariant >, int, const int&, vertex_index_t> >, adjacency_list > >; Invariant2 = degree_vertex_invariant >, int, const int&, vertex_index_t> >, adjacency_list > >; IndexMap1 = adj_list_vertex_property_map >, int, const int&, vertex_index_t>; IndexMap2 = adj_list_vertex_property_map >, int, const int&, vertex_index_t>; std::size_t = long unsigned int]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/isomorphism.hpp:651:42: required from ‘bool boost::graph::detail::isomorphism_impl::operator()(const Graph1&, const Graph2&, const ArgPack&) const [with ArgPack = boost::parameter::aux::arg_list >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&> >, boost::parameter::aux::empty_arg_list, std::integral_constant >; Graph1 = boost::adjacency_list >; Graph2 = boost::adjacency_list >]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/isomorphism.hpp:662:5: required from ‘typename boost::result_of(Param0, Param1, const ArgPack&)>::type boost::graph::isomorphism_with_named_params(const Param0&, const Param1&, const ArgPack&) [with Param0 = boost::adjacency_list >; Param1 = boost::adjacency_list >; ArgPack = boost::parameter::aux::arg_list >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&> >, boost::parameter::aux::empty_arg_list, std::integral_constant >; typename boost::result_of(Param0, Param1, const ArgPack&)>::type = bool]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/isomorphism.hpp:666:1: required from ‘typename boost::result_of(Param0, Param1, const typename boost::detail::convert_bgl_params_to_boost_parameter >::type&)>::type boost::isomorphism(const Param0&, const Param1&, const bgl_named_params&) [with Param0 = adjacency_list >; Param1 = adjacency_list >; P = iterator_property_map<__gnu_cxx::__normal_iterator >, adj_list_vertex_property_map >, int, int&, vertex_index_t>, void*, void*&>; T = vertex_isomorphism_t; R = no_property; typename result_of(Param0, Param1, const typename detail::convert_bgl_params_to_boost_parameter >::type&)>::type = bool; typename detail::convert_bgl_params_to_boost_parameter >::type = parameter::aux::arg_list >, adj_list_vertex_property_map >, int, int&, vertex_index_t>, void*, void*&> >, parameter::aux::empty_arg_list, std::integral_constant >]’ ordering.cpp:68:18: required from here /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::range_detail::IncrementableIteratorConcept<__gnu_cxx::__normal_iterator > >]’ 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ^ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements > > >]’: /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:233:5: required from ‘struct boost::EqualityComparable<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/range/concepts.hpp:147:16: required from ‘struct boost::range_detail::SinglePassIteratorConcept<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::range_detail::SinglePassIteratorConcept<__gnu_cxx::__normal_iterator > >]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied > > >::value’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied > > >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:72:8: [ skipping 10 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/isomorphism.hpp:172:21: required from ‘bool boost::detail::isomorphism_algo::test_isomorphism() [with Graph1 = boost::adjacency_list >; Graph2 = boost::adjacency_list >; IsoMapping = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&>; Invariant1 = boost::degree_vertex_invariant >, int, const int&, boost::vertex_index_t> >, boost::adjacency_list > >; Invariant2 = boost::degree_vertex_invariant >, int, const int&, boost::vertex_index_t> >, boost::adjacency_list > >; IndexMap1 = boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>; IndexMap2 = boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/isomorphism.hpp:532:33: required from ‘bool boost::isomorphism(const Graph1&, const Graph2&, IsoMapping, Invariant1, Invariant2, std::size_t, IndexMap1, IndexMap2) [with Graph1 = adjacency_list >; Graph2 = adjacency_list >; IsoMapping = iterator_property_map<__gnu_cxx::__normal_iterator >, adj_list_vertex_property_map >, int, int&, vertex_index_t>, void*, void*&>; Invariant1 = degree_vertex_invariant >, int, const int&, vertex_index_t> >, adjacency_list > >; Invariant2 = degree_vertex_invariant >, int, const int&, vertex_index_t> >, adjacency_list > >; IndexMap1 = adj_list_vertex_property_map >, int, const int&, vertex_index_t>; IndexMap2 = adj_list_vertex_property_map >, int, const int&, vertex_index_t>; std::size_t = long unsigned int]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/isomorphism.hpp:651:42: required from ‘bool boost::graph::detail::isomorphism_impl::operator()(const Graph1&, const Graph2&, const ArgPack&) const [with ArgPack = boost::parameter::aux::arg_list >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&> >, boost::parameter::aux::empty_arg_list, std::integral_constant >; Graph1 = boost::adjacency_list >; Graph2 = boost::adjacency_list >]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/isomorphism.hpp:662:5: required from ‘typename boost::result_of(Param0, Param1, const ArgPack&)>::type boost::graph::isomorphism_with_named_params(const Param0&, const Param1&, const ArgPack&) [with Param0 = boost::adjacency_list >; Param1 = boost::adjacency_list >; ArgPack = boost::parameter::aux::arg_list >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&> >, boost::parameter::aux::empty_arg_list, std::integral_constant >; typename boost::result_of(Param0, Param1, const ArgPack&)>::type = bool]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/isomorphism.hpp:666:1: required from ‘typename boost::result_of(Param0, Param1, const typename boost::detail::convert_bgl_params_to_boost_parameter >::type&)>::type boost::isomorphism(const Param0&, const Param1&, const bgl_named_params&) [with Param0 = adjacency_list >; Param1 = adjacency_list >; P = iterator_property_map<__gnu_cxx::__normal_iterator >, adj_list_vertex_property_map >, int, int&, vertex_index_t>, void*, void*&>; T = vertex_isomorphism_t; R = no_property; typename result_of(Param0, Param1, const typename detail::convert_bgl_params_to_boost_parameter >::type&)>::type = bool; typename detail::convert_bgl_params_to_boost_parameter >::type = parameter::aux::arg_list >, adj_list_vertex_property_map >, int, int&, vertex_index_t>, void*, void*&> >, parameter::aux::empty_arg_list, std::integral_constant >]’ ordering.cpp:68:18: required from here /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::EqualityComparable<__gnu_cxx::__normal_iterator > >]’ 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ^ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements >]’: /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:208:5: required from ‘struct boost::Convertible’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::Convertible]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied >::value’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_)>’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/range/concepts.hpp:152:13: [ skipping 14 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/isomorphism.hpp:172:21: required from ‘bool boost::detail::isomorphism_algo::test_isomorphism() [with Graph1 = boost::adjacency_list >; Graph2 = boost::adjacency_list >; IsoMapping = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&>; Invariant1 = boost::degree_vertex_invariant >, int, const int&, boost::vertex_index_t> >, boost::adjacency_list > >; Invariant2 = boost::degree_vertex_invariant >, int, const int&, boost::vertex_index_t> >, boost::adjacency_list > >; IndexMap1 = boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>; IndexMap2 = boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/isomorphism.hpp:532:33: required from ‘bool boost::isomorphism(const Graph1&, const Graph2&, IsoMapping, Invariant1, Invariant2, std::size_t, IndexMap1, IndexMap2) [with Graph1 = adjacency_list >; Graph2 = adjacency_list >; IsoMapping = iterator_property_map<__gnu_cxx::__normal_iterator >, adj_list_vertex_property_map >, int, int&, vertex_index_t>, void*, void*&>; Invariant1 = degree_vertex_invariant >, int, const int&, vertex_index_t> >, adjacency_list > >; Invariant2 = degree_vertex_invariant >, int, const int&, vertex_index_t> >, adjacency_list > >; IndexMap1 = adj_list_vertex_property_map >, int, const int&, vertex_index_t>; IndexMap2 = adj_list_vertex_property_map >, int, const int&, vertex_index_t>; std::size_t = long unsigned int]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/isomorphism.hpp:651:42: required from ‘bool boost::graph::detail::isomorphism_impl::operator()(const Graph1&, const Graph2&, const ArgPack&) const [with ArgPack = boost::parameter::aux::arg_list >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&> >, boost::parameter::aux::empty_arg_list, std::integral_constant >; Graph1 = boost::adjacency_list >; Graph2 = boost::adjacency_list >]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/isomorphism.hpp:662:5: required from ‘typename boost::result_of(Param0, Param1, const ArgPack&)>::type boost::graph::isomorphism_with_named_params(const Param0&, const Param1&, const ArgPack&) [with Param0 = boost::adjacency_list >; Param1 = boost::adjacency_list >; ArgPack = boost::parameter::aux::arg_list >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&> >, boost::parameter::aux::empty_arg_list, std::integral_constant >; typename boost::result_of(Param0, Param1, const ArgPack&)>::type = bool]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/isomorphism.hpp:666:1: required from ‘typename boost::result_of(Param0, Param1, const typename boost::detail::convert_bgl_params_to_boost_parameter >::type&)>::type boost::isomorphism(const Param0&, const Param1&, const bgl_named_params&) [with Param0 = adjacency_list >; Param1 = adjacency_list >; P = iterator_property_map<__gnu_cxx::__normal_iterator >, adj_list_vertex_property_map >, int, int&, vertex_index_t>, void*, void*&>; T = vertex_isomorphism_t; R = no_property; typename result_of(Param0, Param1, const typename detail::convert_bgl_params_to_boost_parameter >::type&)>::type = bool; typename detail::convert_bgl_params_to_boost_parameter >::type = parameter::aux::arg_list >, adj_list_vertex_property_map >, int, int&, vertex_index_t>, void*, void*&> >, parameter::aux::empty_arg_list, std::integral_constant >]’ ordering.cpp:68:18: required from here /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::Convertible]’ 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ^ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::Convertible]’: /home/omnipath/local/R/4.4-3.20/BH/include/boost/range/concepts.hpp:152:13: required from ‘struct boost::range_detail::SinglePassIteratorConcept<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::range_detail::SinglePassIteratorConcept<__gnu_cxx::__normal_iterator > >]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied > > >::value’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied > > >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_ > >)>’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/range/concepts.hpp:278:9: [ skipping 9 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/isomorphism.hpp:172:21: required from ‘bool boost::detail::isomorphism_algo::test_isomorphism() [with Graph1 = boost::adjacency_list >; Graph2 = boost::adjacency_list >; IsoMapping = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&>; Invariant1 = boost::degree_vertex_invariant >, int, const int&, boost::vertex_index_t> >, boost::adjacency_list > >; Invariant2 = boost::degree_vertex_invariant >, int, const int&, boost::vertex_index_t> >, boost::adjacency_list > >; IndexMap1 = boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>; IndexMap2 = boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/isomorphism.hpp:532:33: required from ‘bool boost::isomorphism(const Graph1&, const Graph2&, IsoMapping, Invariant1, Invariant2, std::size_t, IndexMap1, IndexMap2) [with Graph1 = adjacency_list >; Graph2 = adjacency_list >; IsoMapping = iterator_property_map<__gnu_cxx::__normal_iterator >, adj_list_vertex_property_map >, int, int&, vertex_index_t>, void*, void*&>; Invariant1 = degree_vertex_invariant >, int, const int&, vertex_index_t> >, adjacency_list > >; Invariant2 = degree_vertex_invariant >, int, const int&, vertex_index_t> >, adjacency_list > >; IndexMap1 = adj_list_vertex_property_map >, int, const int&, vertex_index_t>; IndexMap2 = adj_list_vertex_property_map >, int, const int&, vertex_index_t>; std::size_t = long unsigned int]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/isomorphism.hpp:651:42: required from ‘bool boost::graph::detail::isomorphism_impl::operator()(const Graph1&, const Graph2&, const ArgPack&) const [with ArgPack = boost::parameter::aux::arg_list >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&> >, boost::parameter::aux::empty_arg_list, std::integral_constant >; Graph1 = boost::adjacency_list >; Graph2 = boost::adjacency_list >]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/isomorphism.hpp:662:5: required from ‘typename boost::result_of(Param0, Param1, const ArgPack&)>::type boost::graph::isomorphism_with_named_params(const Param0&, const Param1&, const ArgPack&) [with Param0 = boost::adjacency_list >; Param1 = boost::adjacency_list >; ArgPack = boost::parameter::aux::arg_list >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&> >, boost::parameter::aux::empty_arg_list, std::integral_constant >; typename boost::result_of(Param0, Param1, const ArgPack&)>::type = bool]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/isomorphism.hpp:666:1: required from ‘typename boost::result_of(Param0, Param1, const typename boost::detail::convert_bgl_params_to_boost_parameter >::type&)>::type boost::isomorphism(const Param0&, const Param1&, const bgl_named_params&) [with Param0 = adjacency_list >; Param1 = adjacency_list >; P = iterator_property_map<__gnu_cxx::__normal_iterator >, adj_list_vertex_property_map >, int, int&, vertex_index_t>, void*, void*&>; T = vertex_isomorphism_t; R = no_property; typename result_of(Param0, Param1, const typename detail::convert_bgl_params_to_boost_parameter >::type&)>::type = bool; typename detail::convert_bgl_params_to_boost_parameter >::type = parameter::aux::arg_list >, adj_list_vertex_property_map >, int, int&, vertex_index_t>, void*, void*&> >, parameter::aux::empty_arg_list, std::integral_constant >]’ ordering.cpp:68:18: required from here /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::Convertible::~Convertible() [with X = boost::iterators::random_access_traversal_tag; Y = boost::iterators::single_pass_traversal_tag]’ 37 | ~model() | ^ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:208:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 208 | BOOST_CONCEPT_USAGE(Convertible) { | ^~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements > > >]’: /home/omnipath/local/R/4.4-3.20/BH/include/boost/range/concepts.hpp:158:13: required from ‘struct boost::range_detail::SinglePassIteratorConcept<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::range_detail::SinglePassIteratorConcept<__gnu_cxx::__normal_iterator > >]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied > > >::value’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied > > >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_ > >)>’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/range/concepts.hpp:278:9: [ skipping 9 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/isomorphism.hpp:172:21: required from ‘bool boost::detail::isomorphism_algo::test_isomorphism() [with Graph1 = boost::adjacency_list >; Graph2 = boost::adjacency_list >; IsoMapping = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&>; Invariant1 = boost::degree_vertex_invariant >, int, const int&, boost::vertex_index_t> >, boost::adjacency_list > >; Invariant2 = boost::degree_vertex_invariant >, int, const int&, boost::vertex_index_t> >, boost::adjacency_list > >; IndexMap1 = boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>; IndexMap2 = boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/isomorphism.hpp:532:33: required from ‘bool boost::isomorphism(const Graph1&, const Graph2&, IsoMapping, Invariant1, Invariant2, std::size_t, IndexMap1, IndexMap2) [with Graph1 = adjacency_list >; Graph2 = adjacency_list >; IsoMapping = iterator_property_map<__gnu_cxx::__normal_iterator >, adj_list_vertex_property_map >, int, int&, vertex_index_t>, void*, void*&>; Invariant1 = degree_vertex_invariant >, int, const int&, vertex_index_t> >, adjacency_list > >; Invariant2 = degree_vertex_invariant >, int, const int&, vertex_index_t> >, adjacency_list > >; IndexMap1 = adj_list_vertex_property_map >, int, const int&, vertex_index_t>; IndexMap2 = adj_list_vertex_property_map >, int, const int&, vertex_index_t>; std::size_t = long unsigned int]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/isomorphism.hpp:651:42: required from ‘bool boost::graph::detail::isomorphism_impl::operator()(const Graph1&, const Graph2&, const ArgPack&) const [with ArgPack = boost::parameter::aux::arg_list >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&> >, boost::parameter::aux::empty_arg_list, std::integral_constant >; Graph1 = boost::adjacency_list >; Graph2 = boost::adjacency_list >]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/isomorphism.hpp:662:5: required from ‘typename boost::result_of(Param0, Param1, const ArgPack&)>::type boost::graph::isomorphism_with_named_params(const Param0&, const Param1&, const ArgPack&) [with Param0 = boost::adjacency_list >; Param1 = boost::adjacency_list >; ArgPack = boost::parameter::aux::arg_list >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&> >, boost::parameter::aux::empty_arg_list, std::integral_constant >; typename boost::result_of(Param0, Param1, const ArgPack&)>::type = bool]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/isomorphism.hpp:666:1: required from ‘typename boost::result_of(Param0, Param1, const typename boost::detail::convert_bgl_params_to_boost_parameter >::type&)>::type boost::isomorphism(const Param0&, const Param1&, const bgl_named_params&) [with Param0 = adjacency_list >; Param1 = adjacency_list >; P = iterator_property_map<__gnu_cxx::__normal_iterator >, adj_list_vertex_property_map >, int, int&, vertex_index_t>, void*, void*&>; T = vertex_isomorphism_t; R = no_property; typename result_of(Param0, Param1, const typename detail::convert_bgl_params_to_boost_parameter >::type&)>::type = bool; typename detail::convert_bgl_params_to_boost_parameter >::type = parameter::aux::arg_list >, adj_list_vertex_property_map >, int, int&, vertex_index_t>, void*, void*&> >, parameter::aux::empty_arg_list, std::integral_constant >]’ ordering.cpp:68:18: required from here /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::range_detail::SinglePassIteratorConcept<__gnu_cxx::__normal_iterator > >]’ 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ^ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::range_detail::SinglePassIteratorConcept<__gnu_cxx::__normal_iterator > >]’: /home/omnipath/local/R/4.4-3.20/BH/include/boost/range/concepts.hpp:278:9: required from ‘struct boost::SinglePassRangeConcept >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/range/concepts.hpp:318:12: required from ‘struct boost::ForwardRangeConcept >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/range/concepts.hpp:352:12: required from ‘struct boost::BidirectionalRangeConcept >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/range/concepts.hpp:370:12: required from ‘struct boost::RandomAccessRangeConcept >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::RandomAccessRangeConcept >]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:42:5: [ skipping 4 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/isomorphism.hpp:172:21: required from ‘bool boost::detail::isomorphism_algo::test_isomorphism() [with Graph1 = boost::adjacency_list >; Graph2 = boost::adjacency_list >; IsoMapping = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&>; Invariant1 = boost::degree_vertex_invariant >, int, const int&, boost::vertex_index_t> >, boost::adjacency_list > >; Invariant2 = boost::degree_vertex_invariant >, int, const int&, boost::vertex_index_t> >, boost::adjacency_list > >; IndexMap1 = boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>; IndexMap2 = boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/isomorphism.hpp:532:33: required from ‘bool boost::isomorphism(const Graph1&, const Graph2&, IsoMapping, Invariant1, Invariant2, std::size_t, IndexMap1, IndexMap2) [with Graph1 = adjacency_list >; Graph2 = adjacency_list >; IsoMapping = iterator_property_map<__gnu_cxx::__normal_iterator >, adj_list_vertex_property_map >, int, int&, vertex_index_t>, void*, void*&>; Invariant1 = degree_vertex_invariant >, int, const int&, vertex_index_t> >, adjacency_list > >; Invariant2 = degree_vertex_invariant >, int, const int&, vertex_index_t> >, adjacency_list > >; IndexMap1 = adj_list_vertex_property_map >, int, const int&, vertex_index_t>; IndexMap2 = adj_list_vertex_property_map >, int, const int&, vertex_index_t>; std::size_t = long unsigned int]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/isomorphism.hpp:651:42: required from ‘bool boost::graph::detail::isomorphism_impl::operator()(const Graph1&, const Graph2&, const ArgPack&) const [with ArgPack = boost::parameter::aux::arg_list >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&> >, boost::parameter::aux::empty_arg_list, std::integral_constant >; Graph1 = boost::adjacency_list >; Graph2 = boost::adjacency_list >]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/isomorphism.hpp:662:5: required from ‘typename boost::result_of(Param0, Param1, const ArgPack&)>::type boost::graph::isomorphism_with_named_params(const Param0&, const Param1&, const ArgPack&) [with Param0 = boost::adjacency_list >; Param1 = boost::adjacency_list >; ArgPack = boost::parameter::aux::arg_list >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&> >, boost::parameter::aux::empty_arg_list, std::integral_constant >; typename boost::result_of(Param0, Param1, const ArgPack&)>::type = bool]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/isomorphism.hpp:666:1: required from ‘typename boost::result_of(Param0, Param1, const typename boost::detail::convert_bgl_params_to_boost_parameter >::type&)>::type boost::isomorphism(const Param0&, const Param1&, const bgl_named_params&) [with Param0 = adjacency_list >; Param1 = adjacency_list >; P = iterator_property_map<__gnu_cxx::__normal_iterator >, adj_list_vertex_property_map >, int, int&, vertex_index_t>, void*, void*&>; T = vertex_isomorphism_t; R = no_property; typename result_of(Param0, Param1, const typename detail::convert_bgl_params_to_boost_parameter >::type&)>::type = bool; typename detail::convert_bgl_params_to_boost_parameter >::type = parameter::aux::arg_list >, adj_list_vertex_property_map >, int, int&, vertex_index_t>, void*, void*&> >, parameter::aux::empty_arg_list, std::integral_constant >]’ ordering.cpp:68:18: required from here /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::range_detail::SinglePassIteratorConcept::~SinglePassIteratorConcept() [with Iterator = __gnu_cxx::__normal_iterator >]’ 37 | ~model() | ^ /home/omnipath/local/R/4.4-3.20/BH/include/boost/range/concepts.hpp:158:13: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 158 | BOOST_CONCEPT_USAGE(SinglePassIteratorConcept) | ^~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements > > >]’: /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:167:5: required from ‘struct boost::CopyConstructible<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/range/concepts.hpp:125:16: required from ‘struct boost::range_detail::IncrementableIteratorConcept<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/range/concepts.hpp:147:16: required from ‘struct boost::range_detail::SinglePassIteratorConcept<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::range_detail::SinglePassIteratorConcept<__gnu_cxx::__normal_iterator > >]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied > > >::value’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:45:51: [ skipping 11 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/isomorphism.hpp:172:21: required from ‘bool boost::detail::isomorphism_algo::test_isomorphism() [with Graph1 = boost::adjacency_list >; Graph2 = boost::adjacency_list >; IsoMapping = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&>; Invariant1 = boost::degree_vertex_invariant >, int, const int&, boost::vertex_index_t> >, boost::adjacency_list > >; Invariant2 = boost::degree_vertex_invariant >, int, const int&, boost::vertex_index_t> >, boost::adjacency_list > >; IndexMap1 = boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>; IndexMap2 = boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/isomorphism.hpp:532:33: required from ‘bool boost::isomorphism(const Graph1&, const Graph2&, IsoMapping, Invariant1, Invariant2, std::size_t, IndexMap1, IndexMap2) [with Graph1 = adjacency_list >; Graph2 = adjacency_list >; IsoMapping = iterator_property_map<__gnu_cxx::__normal_iterator >, adj_list_vertex_property_map >, int, int&, vertex_index_t>, void*, void*&>; Invariant1 = degree_vertex_invariant >, int, const int&, vertex_index_t> >, adjacency_list > >; Invariant2 = degree_vertex_invariant >, int, const int&, vertex_index_t> >, adjacency_list > >; IndexMap1 = adj_list_vertex_property_map >, int, const int&, vertex_index_t>; IndexMap2 = adj_list_vertex_property_map >, int, const int&, vertex_index_t>; std::size_t = long unsigned int]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/isomorphism.hpp:651:42: required from ‘bool boost::graph::detail::isomorphism_impl::operator()(const Graph1&, const Graph2&, const ArgPack&) const [with ArgPack = boost::parameter::aux::arg_list >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&> >, boost::parameter::aux::empty_arg_list, std::integral_constant >; Graph1 = boost::adjacency_list >; Graph2 = boost::adjacency_list >]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/isomorphism.hpp:662:5: required from ‘typename boost::result_of(Param0, Param1, const ArgPack&)>::type boost::graph::isomorphism_with_named_params(const Param0&, const Param1&, const ArgPack&) [with Param0 = boost::adjacency_list >; Param1 = boost::adjacency_list >; ArgPack = boost::parameter::aux::arg_list >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&> >, boost::parameter::aux::empty_arg_list, std::integral_constant >; typename boost::result_of(Param0, Param1, const ArgPack&)>::type = bool]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/isomorphism.hpp:666:1: required from ‘typename boost::result_of(Param0, Param1, const typename boost::detail::convert_bgl_params_to_boost_parameter >::type&)>::type boost::isomorphism(const Param0&, const Param1&, const bgl_named_params&) [with Param0 = adjacency_list >; Param1 = adjacency_list >; P = iterator_property_map<__gnu_cxx::__normal_iterator >, adj_list_vertex_property_map >, int, int&, vertex_index_t>, void*, void*&>; T = vertex_isomorphism_t; R = no_property; typename result_of(Param0, Param1, const typename detail::convert_bgl_params_to_boost_parameter >::type&)>::type = bool; typename detail::convert_bgl_params_to_boost_parameter >::type = parameter::aux::arg_list >, adj_list_vertex_property_map >, int, int&, vertex_index_t>, void*, void*&> >, parameter::aux::empty_arg_list, std::integral_constant >]’ ordering.cpp:68:18: required from here /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::CopyConstructible<__gnu_cxx::__normal_iterator > >]’ 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ^ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements > > >]’: /home/omnipath/local/R/4.4-3.20/BH/include/boost/range/concepts.hpp:136:13: required from ‘struct boost::range_detail::IncrementableIteratorConcept<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/range/concepts.hpp:147:16: required from ‘struct boost::range_detail::SinglePassIteratorConcept<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::range_detail::SinglePassIteratorConcept<__gnu_cxx::__normal_iterator > >]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied > > >::value’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied > > >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:72:8: [ skipping 10 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/isomorphism.hpp:172:21: required from ‘bool boost::detail::isomorphism_algo::test_isomorphism() [with Graph1 = boost::adjacency_list >; Graph2 = boost::adjacency_list >; IsoMapping = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&>; Invariant1 = boost::degree_vertex_invariant >, int, const int&, boost::vertex_index_t> >, boost::adjacency_list > >; Invariant2 = boost::degree_vertex_invariant >, int, const int&, boost::vertex_index_t> >, boost::adjacency_list > >; IndexMap1 = boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>; IndexMap2 = boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/isomorphism.hpp:532:33: required from ‘bool boost::isomorphism(const Graph1&, const Graph2&, IsoMapping, Invariant1, Invariant2, std::size_t, IndexMap1, IndexMap2) [with Graph1 = adjacency_list >; Graph2 = adjacency_list >; IsoMapping = iterator_property_map<__gnu_cxx::__normal_iterator >, adj_list_vertex_property_map >, int, int&, vertex_index_t>, void*, void*&>; Invariant1 = degree_vertex_invariant >, int, const int&, vertex_index_t> >, adjacency_list > >; Invariant2 = degree_vertex_invariant >, int, const int&, vertex_index_t> >, adjacency_list > >; IndexMap1 = adj_list_vertex_property_map >, int, const int&, vertex_index_t>; IndexMap2 = adj_list_vertex_property_map >, int, const int&, vertex_index_t>; std::size_t = long unsigned int]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/isomorphism.hpp:651:42: required from ‘bool boost::graph::detail::isomorphism_impl::operator()(const Graph1&, const Graph2&, const ArgPack&) const [with ArgPack = boost::parameter::aux::arg_list >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&> >, boost::parameter::aux::empty_arg_list, std::integral_constant >; Graph1 = boost::adjacency_list >; Graph2 = boost::adjacency_list >]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/isomorphism.hpp:662:5: required from ‘typename boost::result_of(Param0, Param1, const ArgPack&)>::type boost::graph::isomorphism_with_named_params(const Param0&, const Param1&, const ArgPack&) [with Param0 = boost::adjacency_list >; Param1 = boost::adjacency_list >; ArgPack = boost::parameter::aux::arg_list >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&> >, boost::parameter::aux::empty_arg_list, std::integral_constant >; typename boost::result_of(Param0, Param1, const ArgPack&)>::type = bool]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/isomorphism.hpp:666:1: required from ‘typename boost::result_of(Param0, Param1, const typename boost::detail::convert_bgl_params_to_boost_parameter >::type&)>::type boost::isomorphism(const Param0&, const Param1&, const bgl_named_params&) [with Param0 = adjacency_list >; Param1 = adjacency_list >; P = iterator_property_map<__gnu_cxx::__normal_iterator >, adj_list_vertex_property_map >, int, int&, vertex_index_t>, void*, void*&>; T = vertex_isomorphism_t; R = no_property; typename result_of(Param0, Param1, const typename detail::convert_bgl_params_to_boost_parameter >::type&)>::type = bool; typename detail::convert_bgl_params_to_boost_parameter >::type = parameter::aux::arg_list >, adj_list_vertex_property_map >, int, int&, vertex_index_t>, void*, void*&> >, parameter::aux::empty_arg_list, std::integral_constant >]’ ordering.cpp:68:18: required from here /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::range_detail::IncrementableIteratorConcept<__gnu_cxx::__normal_iterator > >]’ 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ^ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements > > >]’: /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:233:5: required from ‘struct boost::EqualityComparable<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/range/concepts.hpp:147:16: required from ‘struct boost::range_detail::SinglePassIteratorConcept<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::range_detail::SinglePassIteratorConcept<__gnu_cxx::__normal_iterator > >]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied > > >::value’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied > > >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:72:8: [ skipping 10 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/isomorphism.hpp:172:21: required from ‘bool boost::detail::isomorphism_algo::test_isomorphism() [with Graph1 = boost::adjacency_list >; Graph2 = boost::adjacency_list >; IsoMapping = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&>; Invariant1 = boost::degree_vertex_invariant >, int, const int&, boost::vertex_index_t> >, boost::adjacency_list > >; Invariant2 = boost::degree_vertex_invariant >, int, const int&, boost::vertex_index_t> >, boost::adjacency_list > >; IndexMap1 = boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>; IndexMap2 = boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/isomorphism.hpp:532:33: required from ‘bool boost::isomorphism(const Graph1&, const Graph2&, IsoMapping, Invariant1, Invariant2, std::size_t, IndexMap1, IndexMap2) [with Graph1 = adjacency_list >; Graph2 = adjacency_list >; IsoMapping = iterator_property_map<__gnu_cxx::__normal_iterator >, adj_list_vertex_property_map >, int, int&, vertex_index_t>, void*, void*&>; Invariant1 = degree_vertex_invariant >, int, const int&, vertex_index_t> >, adjacency_list > >; Invariant2 = degree_vertex_invariant >, int, const int&, vertex_index_t> >, adjacency_list > >; IndexMap1 = adj_list_vertex_property_map >, int, const int&, vertex_index_t>; IndexMap2 = adj_list_vertex_property_map >, int, const int&, vertex_index_t>; std::size_t = long unsigned int]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/isomorphism.hpp:651:42: required from ‘bool boost::graph::detail::isomorphism_impl::operator()(const Graph1&, const Graph2&, const ArgPack&) const [with ArgPack = boost::parameter::aux::arg_list >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&> >, boost::parameter::aux::empty_arg_list, std::integral_constant >; Graph1 = boost::adjacency_list >; Graph2 = boost::adjacency_list >]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/isomorphism.hpp:662:5: required from ‘typename boost::result_of(Param0, Param1, const ArgPack&)>::type boost::graph::isomorphism_with_named_params(const Param0&, const Param1&, const ArgPack&) [with Param0 = boost::adjacency_list >; Param1 = boost::adjacency_list >; ArgPack = boost::parameter::aux::arg_list >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&> >, boost::parameter::aux::empty_arg_list, std::integral_constant >; typename boost::result_of(Param0, Param1, const ArgPack&)>::type = bool]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/isomorphism.hpp:666:1: required from ‘typename boost::result_of(Param0, Param1, const typename boost::detail::convert_bgl_params_to_boost_parameter >::type&)>::type boost::isomorphism(const Param0&, const Param1&, const bgl_named_params&) [with Param0 = adjacency_list >; Param1 = adjacency_list >; P = iterator_property_map<__gnu_cxx::__normal_iterator >, adj_list_vertex_property_map >, int, int&, vertex_index_t>, void*, void*&>; T = vertex_isomorphism_t; R = no_property; typename result_of(Param0, Param1, const typename detail::convert_bgl_params_to_boost_parameter >::type&)>::type = bool; typename detail::convert_bgl_params_to_boost_parameter >::type = parameter::aux::arg_list >, adj_list_vertex_property_map >, int, int&, vertex_index_t>, void*, void*&> >, parameter::aux::empty_arg_list, std::integral_constant >]’ ordering.cpp:68:18: required from here /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::EqualityComparable<__gnu_cxx::__normal_iterator > >]’ 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ^ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements > > >]’: /home/omnipath/local/R/4.4-3.20/BH/include/boost/range/concepts.hpp:158:13: required from ‘struct boost::range_detail::SinglePassIteratorConcept<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::range_detail::SinglePassIteratorConcept<__gnu_cxx::__normal_iterator > >]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied > > >::value’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied > > >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_ > >)>’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/range/concepts.hpp:281:9: [ skipping 9 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/isomorphism.hpp:172:21: required from ‘bool boost::detail::isomorphism_algo::test_isomorphism() [with Graph1 = boost::adjacency_list >; Graph2 = boost::adjacency_list >; IsoMapping = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&>; Invariant1 = boost::degree_vertex_invariant >, int, const int&, boost::vertex_index_t> >, boost::adjacency_list > >; Invariant2 = boost::degree_vertex_invariant >, int, const int&, boost::vertex_index_t> >, boost::adjacency_list > >; IndexMap1 = boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>; IndexMap2 = boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/isomorphism.hpp:532:33: required from ‘bool boost::isomorphism(const Graph1&, const Graph2&, IsoMapping, Invariant1, Invariant2, std::size_t, IndexMap1, IndexMap2) [with Graph1 = adjacency_list >; Graph2 = adjacency_list >; IsoMapping = iterator_property_map<__gnu_cxx::__normal_iterator >, adj_list_vertex_property_map >, int, int&, vertex_index_t>, void*, void*&>; Invariant1 = degree_vertex_invariant >, int, const int&, vertex_index_t> >, adjacency_list > >; Invariant2 = degree_vertex_invariant >, int, const int&, vertex_index_t> >, adjacency_list > >; IndexMap1 = adj_list_vertex_property_map >, int, const int&, vertex_index_t>; IndexMap2 = adj_list_vertex_property_map >, int, const int&, vertex_index_t>; std::size_t = long unsigned int]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/isomorphism.hpp:651:42: required from ‘bool boost::graph::detail::isomorphism_impl::operator()(const Graph1&, const Graph2&, const ArgPack&) const [with ArgPack = boost::parameter::aux::arg_list >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&> >, boost::parameter::aux::empty_arg_list, std::integral_constant >; Graph1 = boost::adjacency_list >; Graph2 = boost::adjacency_list >]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/isomorphism.hpp:662:5: required from ‘typename boost::result_of(Param0, Param1, const ArgPack&)>::type boost::graph::isomorphism_with_named_params(const Param0&, const Param1&, const ArgPack&) [with Param0 = boost::adjacency_list >; Param1 = boost::adjacency_list >; ArgPack = boost::parameter::aux::arg_list >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&> >, boost::parameter::aux::empty_arg_list, std::integral_constant >; typename boost::result_of(Param0, Param1, const ArgPack&)>::type = bool]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/isomorphism.hpp:666:1: required from ‘typename boost::result_of(Param0, Param1, const typename boost::detail::convert_bgl_params_to_boost_parameter >::type&)>::type boost::isomorphism(const Param0&, const Param1&, const bgl_named_params&) [with Param0 = adjacency_list >; Param1 = adjacency_list >; P = iterator_property_map<__gnu_cxx::__normal_iterator >, adj_list_vertex_property_map >, int, int&, vertex_index_t>, void*, void*&>; T = vertex_isomorphism_t; R = no_property; typename result_of(Param0, Param1, const typename detail::convert_bgl_params_to_boost_parameter >::type&)>::type = bool; typename detail::convert_bgl_params_to_boost_parameter >::type = parameter::aux::arg_list >, adj_list_vertex_property_map >, int, int&, vertex_index_t>, void*, void*&> >, parameter::aux::empty_arg_list, std::integral_constant >]’ ordering.cpp:68:18: required from here /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::range_detail::SinglePassIteratorConcept<__gnu_cxx::__normal_iterator > >]’ 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ^ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::range_detail::SinglePassIteratorConcept<__gnu_cxx::__normal_iterator > >]’: /home/omnipath/local/R/4.4-3.20/BH/include/boost/range/concepts.hpp:281:9: required from ‘struct boost::SinglePassRangeConcept >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/range/concepts.hpp:318:12: required from ‘struct boost::ForwardRangeConcept >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/range/concepts.hpp:352:12: required from ‘struct boost::BidirectionalRangeConcept >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/range/concepts.hpp:370:12: required from ‘struct boost::RandomAccessRangeConcept >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::RandomAccessRangeConcept >]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:42:5: [ skipping 4 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/isomorphism.hpp:172:21: required from ‘bool boost::detail::isomorphism_algo::test_isomorphism() [with Graph1 = boost::adjacency_list >; Graph2 = boost::adjacency_list >; IsoMapping = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&>; Invariant1 = boost::degree_vertex_invariant >, int, const int&, boost::vertex_index_t> >, boost::adjacency_list > >; Invariant2 = boost::degree_vertex_invariant >, int, const int&, boost::vertex_index_t> >, boost::adjacency_list > >; IndexMap1 = boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>; IndexMap2 = boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/isomorphism.hpp:532:33: required from ‘bool boost::isomorphism(const Graph1&, const Graph2&, IsoMapping, Invariant1, Invariant2, std::size_t, IndexMap1, IndexMap2) [with Graph1 = adjacency_list >; Graph2 = adjacency_list >; IsoMapping = iterator_property_map<__gnu_cxx::__normal_iterator >, adj_list_vertex_property_map >, int, int&, vertex_index_t>, void*, void*&>; Invariant1 = degree_vertex_invariant >, int, const int&, vertex_index_t> >, adjacency_list > >; Invariant2 = degree_vertex_invariant >, int, const int&, vertex_index_t> >, adjacency_list > >; IndexMap1 = adj_list_vertex_property_map >, int, const int&, vertex_index_t>; IndexMap2 = adj_list_vertex_property_map >, int, const int&, vertex_index_t>; std::size_t = long unsigned int]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/isomorphism.hpp:651:42: required from ‘bool boost::graph::detail::isomorphism_impl::operator()(const Graph1&, const Graph2&, const ArgPack&) const [with ArgPack = boost::parameter::aux::arg_list >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&> >, boost::parameter::aux::empty_arg_list, std::integral_constant >; Graph1 = boost::adjacency_list >; Graph2 = boost::adjacency_list >]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/isomorphism.hpp:662:5: required from ‘typename boost::result_of(Param0, Param1, const ArgPack&)>::type boost::graph::isomorphism_with_named_params(const Param0&, const Param1&, const ArgPack&) [with Param0 = boost::adjacency_list >; Param1 = boost::adjacency_list >; ArgPack = boost::parameter::aux::arg_list >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&> >, boost::parameter::aux::empty_arg_list, std::integral_constant >; typename boost::result_of(Param0, Param1, const ArgPack&)>::type = bool]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/isomorphism.hpp:666:1: required from ‘typename boost::result_of(Param0, Param1, const typename boost::detail::convert_bgl_params_to_boost_parameter >::type&)>::type boost::isomorphism(const Param0&, const Param1&, const bgl_named_params&) [with Param0 = adjacency_list >; Param1 = adjacency_list >; P = iterator_property_map<__gnu_cxx::__normal_iterator >, adj_list_vertex_property_map >, int, int&, vertex_index_t>, void*, void*&>; T = vertex_isomorphism_t; R = no_property; typename result_of(Param0, Param1, const typename detail::convert_bgl_params_to_boost_parameter >::type&)>::type = bool; typename detail::convert_bgl_params_to_boost_parameter >::type = parameter::aux::arg_list >, adj_list_vertex_property_map >, int, int&, vertex_index_t>, void*, void*&> >, parameter::aux::empty_arg_list, std::integral_constant >]’ ordering.cpp:68:18: required from here /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::range_detail::SinglePassIteratorConcept::~SinglePassIteratorConcept() [with Iterator = __gnu_cxx::__normal_iterator >]’ 37 | ~model() | ^ /home/omnipath/local/R/4.4-3.20/BH/include/boost/range/concepts.hpp:158:13: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 158 | BOOST_CONCEPT_USAGE(SinglePassIteratorConcept) | ^~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements > >]’: /home/omnipath/local/R/4.4-3.20/BH/include/boost/range/concepts.hpp:284:9: required from ‘struct boost::SinglePassRangeConcept >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/range/concepts.hpp:318:12: required from ‘struct boost::ForwardRangeConcept >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/range/concepts.hpp:352:12: required from ‘struct boost::BidirectionalRangeConcept >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/range/concepts.hpp:370:12: required from ‘struct boost::RandomAccessRangeConcept >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::RandomAccessRangeConcept >]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:42:5: [ skipping 4 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/isomorphism.hpp:172:21: required from ‘bool boost::detail::isomorphism_algo::test_isomorphism() [with Graph1 = boost::adjacency_list >; Graph2 = boost::adjacency_list >; IsoMapping = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&>; Invariant1 = boost::degree_vertex_invariant >, int, const int&, boost::vertex_index_t> >, boost::adjacency_list > >; Invariant2 = boost::degree_vertex_invariant >, int, const int&, boost::vertex_index_t> >, boost::adjacency_list > >; IndexMap1 = boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>; IndexMap2 = boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/isomorphism.hpp:532:33: required from ‘bool boost::isomorphism(const Graph1&, const Graph2&, IsoMapping, Invariant1, Invariant2, std::size_t, IndexMap1, IndexMap2) [with Graph1 = adjacency_list >; Graph2 = adjacency_list >; IsoMapping = iterator_property_map<__gnu_cxx::__normal_iterator >, adj_list_vertex_property_map >, int, int&, vertex_index_t>, void*, void*&>; Invariant1 = degree_vertex_invariant >, int, const int&, vertex_index_t> >, adjacency_list > >; Invariant2 = degree_vertex_invariant >, int, const int&, vertex_index_t> >, adjacency_list > >; IndexMap1 = adj_list_vertex_property_map >, int, const int&, vertex_index_t>; IndexMap2 = adj_list_vertex_property_map >, int, const int&, vertex_index_t>; std::size_t = long unsigned int]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/isomorphism.hpp:651:42: required from ‘bool boost::graph::detail::isomorphism_impl::operator()(const Graph1&, const Graph2&, const ArgPack&) const [with ArgPack = boost::parameter::aux::arg_list >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&> >, boost::parameter::aux::empty_arg_list, std::integral_constant >; Graph1 = boost::adjacency_list >; Graph2 = boost::adjacency_list >]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/isomorphism.hpp:662:5: required from ‘typename boost::result_of(Param0, Param1, const ArgPack&)>::type boost::graph::isomorphism_with_named_params(const Param0&, const Param1&, const ArgPack&) [with Param0 = boost::adjacency_list >; Param1 = boost::adjacency_list >; ArgPack = boost::parameter::aux::arg_list >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&> >, boost::parameter::aux::empty_arg_list, std::integral_constant >; typename boost::result_of(Param0, Param1, const ArgPack&)>::type = bool]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/isomorphism.hpp:666:1: required from ‘typename boost::result_of(Param0, Param1, const typename boost::detail::convert_bgl_params_to_boost_parameter >::type&)>::type boost::isomorphism(const Param0&, const Param1&, const bgl_named_params&) [with Param0 = adjacency_list >; Param1 = adjacency_list >; P = iterator_property_map<__gnu_cxx::__normal_iterator >, adj_list_vertex_property_map >, int, int&, vertex_index_t>, void*, void*&>; T = vertex_isomorphism_t; R = no_property; typename result_of(Param0, Param1, const typename detail::convert_bgl_params_to_boost_parameter >::type&)>::type = bool; typename detail::convert_bgl_params_to_boost_parameter >::type = parameter::aux::arg_list >, adj_list_vertex_property_map >, int, int&, vertex_index_t>, void*, void*&> >, parameter::aux::empty_arg_list, std::integral_constant >]’ ordering.cpp:68:18: required from here /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::SinglePassRangeConcept >]’ 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ^ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements > > >]’: /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:137:5: required from ‘struct boost::DefaultConstructible<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/range/concepts.hpp:181:16: required from ‘struct boost::range_detail::ForwardIteratorConcept<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::range_detail::ForwardIteratorConcept<__gnu_cxx::__normal_iterator > >]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied > > >::value’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied > > >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:72:8: [ skipping 9 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/isomorphism.hpp:172:21: required from ‘bool boost::detail::isomorphism_algo::test_isomorphism() [with Graph1 = boost::adjacency_list >; Graph2 = boost::adjacency_list >; IsoMapping = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&>; Invariant1 = boost::degree_vertex_invariant >, int, const int&, boost::vertex_index_t> >, boost::adjacency_list > >; Invariant2 = boost::degree_vertex_invariant >, int, const int&, boost::vertex_index_t> >, boost::adjacency_list > >; IndexMap1 = boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>; IndexMap2 = boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/isomorphism.hpp:532:33: required from ‘bool boost::isomorphism(const Graph1&, const Graph2&, IsoMapping, Invariant1, Invariant2, std::size_t, IndexMap1, IndexMap2) [with Graph1 = adjacency_list >; Graph2 = adjacency_list >; IsoMapping = iterator_property_map<__gnu_cxx::__normal_iterator >, adj_list_vertex_property_map >, int, int&, vertex_index_t>, void*, void*&>; Invariant1 = degree_vertex_invariant >, int, const int&, vertex_index_t> >, adjacency_list > >; Invariant2 = degree_vertex_invariant >, int, const int&, vertex_index_t> >, adjacency_list > >; IndexMap1 = adj_list_vertex_property_map >, int, const int&, vertex_index_t>; IndexMap2 = adj_list_vertex_property_map >, int, const int&, vertex_index_t>; std::size_t = long unsigned int]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/isomorphism.hpp:651:42: required from ‘bool boost::graph::detail::isomorphism_impl::operator()(const Graph1&, const Graph2&, const ArgPack&) const [with ArgPack = boost::parameter::aux::arg_list >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&> >, boost::parameter::aux::empty_arg_list, std::integral_constant >; Graph1 = boost::adjacency_list >; Graph2 = boost::adjacency_list >]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/isomorphism.hpp:662:5: required from ‘typename boost::result_of(Param0, Param1, const ArgPack&)>::type boost::graph::isomorphism_with_named_params(const Param0&, const Param1&, const ArgPack&) [with Param0 = boost::adjacency_list >; Param1 = boost::adjacency_list >; ArgPack = boost::parameter::aux::arg_list >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&> >, boost::parameter::aux::empty_arg_list, std::integral_constant >; typename boost::result_of(Param0, Param1, const ArgPack&)>::type = bool]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/isomorphism.hpp:666:1: required from ‘typename boost::result_of(Param0, Param1, const typename boost::detail::convert_bgl_params_to_boost_parameter >::type&)>::type boost::isomorphism(const Param0&, const Param1&, const bgl_named_params&) [with Param0 = adjacency_list >; Param1 = adjacency_list >; P = iterator_property_map<__gnu_cxx::__normal_iterator >, adj_list_vertex_property_map >, int, int&, vertex_index_t>, void*, void*&>; T = vertex_isomorphism_t; R = no_property; typename result_of(Param0, Param1, const typename detail::convert_bgl_params_to_boost_parameter >::type&)>::type = bool; typename detail::convert_bgl_params_to_boost_parameter >::type = parameter::aux::arg_list >, adj_list_vertex_property_map >, int, int&, vertex_index_t>, void*, void*&> >, parameter::aux::empty_arg_list, std::integral_constant >]’ ordering.cpp:68:18: required from here /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::DefaultConstructible<__gnu_cxx::__normal_iterator > >]’ 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ^ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements >]’: /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:208:5: required from ‘struct boost::Convertible’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::Convertible]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied >::value’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_)>’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/range/concepts.hpp:191:13: [ skipping 13 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/isomorphism.hpp:172:21: required from ‘bool boost::detail::isomorphism_algo::test_isomorphism() [with Graph1 = boost::adjacency_list >; Graph2 = boost::adjacency_list >; IsoMapping = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&>; Invariant1 = boost::degree_vertex_invariant >, int, const int&, boost::vertex_index_t> >, boost::adjacency_list > >; Invariant2 = boost::degree_vertex_invariant >, int, const int&, boost::vertex_index_t> >, boost::adjacency_list > >; IndexMap1 = boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>; IndexMap2 = boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/isomorphism.hpp:532:33: required from ‘bool boost::isomorphism(const Graph1&, const Graph2&, IsoMapping, Invariant1, Invariant2, std::size_t, IndexMap1, IndexMap2) [with Graph1 = adjacency_list >; Graph2 = adjacency_list >; IsoMapping = iterator_property_map<__gnu_cxx::__normal_iterator >, adj_list_vertex_property_map >, int, int&, vertex_index_t>, void*, void*&>; Invariant1 = degree_vertex_invariant >, int, const int&, vertex_index_t> >, adjacency_list > >; Invariant2 = degree_vertex_invariant >, int, const int&, vertex_index_t> >, adjacency_list > >; IndexMap1 = adj_list_vertex_property_map >, int, const int&, vertex_index_t>; IndexMap2 = adj_list_vertex_property_map >, int, const int&, vertex_index_t>; std::size_t = long unsigned int]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/isomorphism.hpp:651:42: required from ‘bool boost::graph::detail::isomorphism_impl::operator()(const Graph1&, const Graph2&, const ArgPack&) const [with ArgPack = boost::parameter::aux::arg_list >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&> >, boost::parameter::aux::empty_arg_list, std::integral_constant >; Graph1 = boost::adjacency_list >; Graph2 = boost::adjacency_list >]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/isomorphism.hpp:662:5: required from ‘typename boost::result_of(Param0, Param1, const ArgPack&)>::type boost::graph::isomorphism_with_named_params(const Param0&, const Param1&, const ArgPack&) [with Param0 = boost::adjacency_list >; Param1 = boost::adjacency_list >; ArgPack = boost::parameter::aux::arg_list >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&> >, boost::parameter::aux::empty_arg_list, std::integral_constant >; typename boost::result_of(Param0, Param1, const ArgPack&)>::type = bool]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/isomorphism.hpp:666:1: required from ‘typename boost::result_of(Param0, Param1, const typename boost::detail::convert_bgl_params_to_boost_parameter >::type&)>::type boost::isomorphism(const Param0&, const Param1&, const bgl_named_params&) [with Param0 = adjacency_list >; Param1 = adjacency_list >; P = iterator_property_map<__gnu_cxx::__normal_iterator >, adj_list_vertex_property_map >, int, int&, vertex_index_t>, void*, void*&>; T = vertex_isomorphism_t; R = no_property; typename result_of(Param0, Param1, const typename detail::convert_bgl_params_to_boost_parameter >::type&)>::type = bool; typename detail::convert_bgl_params_to_boost_parameter >::type = parameter::aux::arg_list >, adj_list_vertex_property_map >, int, int&, vertex_index_t>, void*, void*&> >, parameter::aux::empty_arg_list, std::integral_constant >]’ ordering.cpp:68:18: required from here /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::Convertible]’ 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ^ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::Convertible]’: /home/omnipath/local/R/4.4-3.20/BH/include/boost/range/concepts.hpp:191:13: required from ‘struct boost::range_detail::ForwardIteratorConcept<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::range_detail::ForwardIteratorConcept<__gnu_cxx::__normal_iterator > >]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied > > >::value’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied > > >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_ > >)>’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/range/concepts.hpp:321:9: [ skipping 8 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/isomorphism.hpp:172:21: required from ‘bool boost::detail::isomorphism_algo::test_isomorphism() [with Graph1 = boost::adjacency_list >; Graph2 = boost::adjacency_list >; IsoMapping = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&>; Invariant1 = boost::degree_vertex_invariant >, int, const int&, boost::vertex_index_t> >, boost::adjacency_list > >; Invariant2 = boost::degree_vertex_invariant >, int, const int&, boost::vertex_index_t> >, boost::adjacency_list > >; IndexMap1 = boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>; IndexMap2 = boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/isomorphism.hpp:532:33: required from ‘bool boost::isomorphism(const Graph1&, const Graph2&, IsoMapping, Invariant1, Invariant2, std::size_t, IndexMap1, IndexMap2) [with Graph1 = adjacency_list >; Graph2 = adjacency_list >; IsoMapping = iterator_property_map<__gnu_cxx::__normal_iterator >, adj_list_vertex_property_map >, int, int&, vertex_index_t>, void*, void*&>; Invariant1 = degree_vertex_invariant >, int, const int&, vertex_index_t> >, adjacency_list > >; Invariant2 = degree_vertex_invariant >, int, const int&, vertex_index_t> >, adjacency_list > >; IndexMap1 = adj_list_vertex_property_map >, int, const int&, vertex_index_t>; IndexMap2 = adj_list_vertex_property_map >, int, const int&, vertex_index_t>; std::size_t = long unsigned int]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/isomorphism.hpp:651:42: required from ‘bool boost::graph::detail::isomorphism_impl::operator()(const Graph1&, const Graph2&, const ArgPack&) const [with ArgPack = boost::parameter::aux::arg_list >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&> >, boost::parameter::aux::empty_arg_list, std::integral_constant >; Graph1 = boost::adjacency_list >; Graph2 = boost::adjacency_list >]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/isomorphism.hpp:662:5: required from ‘typename boost::result_of(Param0, Param1, const ArgPack&)>::type boost::graph::isomorphism_with_named_params(const Param0&, const Param1&, const ArgPack&) [with Param0 = boost::adjacency_list >; Param1 = boost::adjacency_list >; ArgPack = boost::parameter::aux::arg_list >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&> >, boost::parameter::aux::empty_arg_list, std::integral_constant >; typename boost::result_of(Param0, Param1, const ArgPack&)>::type = bool]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/isomorphism.hpp:666:1: required from ‘typename boost::result_of(Param0, Param1, const typename boost::detail::convert_bgl_params_to_boost_parameter >::type&)>::type boost::isomorphism(const Param0&, const Param1&, const bgl_named_params&) [with Param0 = adjacency_list >; Param1 = adjacency_list >; P = iterator_property_map<__gnu_cxx::__normal_iterator >, adj_list_vertex_property_map >, int, int&, vertex_index_t>, void*, void*&>; T = vertex_isomorphism_t; R = no_property; typename result_of(Param0, Param1, const typename detail::convert_bgl_params_to_boost_parameter >::type&)>::type = bool; typename detail::convert_bgl_params_to_boost_parameter >::type = parameter::aux::arg_list >, adj_list_vertex_property_map >, int, int&, vertex_index_t>, void*, void*&> >, parameter::aux::empty_arg_list, std::integral_constant >]’ ordering.cpp:68:18: required from here /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::Convertible::~Convertible() [with X = boost::iterators::random_access_traversal_tag; Y = boost::iterators::forward_traversal_tag]’ 37 | ~model() | ^ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:208:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 208 | BOOST_CONCEPT_USAGE(Convertible) { | ^~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements > > >]’: /home/omnipath/local/R/4.4-3.20/BH/include/boost/range/concepts.hpp:197:13: required from ‘struct boost::range_detail::ForwardIteratorConcept<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::range_detail::ForwardIteratorConcept<__gnu_cxx::__normal_iterator > >]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied > > >::value’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied > > >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_ > >)>’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/range/concepts.hpp:321:9: [ skipping 8 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/isomorphism.hpp:172:21: required from ‘bool boost::detail::isomorphism_algo::test_isomorphism() [with Graph1 = boost::adjacency_list >; Graph2 = boost::adjacency_list >; IsoMapping = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&>; Invariant1 = boost::degree_vertex_invariant >, int, const int&, boost::vertex_index_t> >, boost::adjacency_list > >; Invariant2 = boost::degree_vertex_invariant >, int, const int&, boost::vertex_index_t> >, boost::adjacency_list > >; IndexMap1 = boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>; IndexMap2 = boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/isomorphism.hpp:532:33: required from ‘bool boost::isomorphism(const Graph1&, const Graph2&, IsoMapping, Invariant1, Invariant2, std::size_t, IndexMap1, IndexMap2) [with Graph1 = adjacency_list >; Graph2 = adjacency_list >; IsoMapping = iterator_property_map<__gnu_cxx::__normal_iterator >, adj_list_vertex_property_map >, int, int&, vertex_index_t>, void*, void*&>; Invariant1 = degree_vertex_invariant >, int, const int&, vertex_index_t> >, adjacency_list > >; Invariant2 = degree_vertex_invariant >, int, const int&, vertex_index_t> >, adjacency_list > >; IndexMap1 = adj_list_vertex_property_map >, int, const int&, vertex_index_t>; IndexMap2 = adj_list_vertex_property_map >, int, const int&, vertex_index_t>; std::size_t = long unsigned int]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/isomorphism.hpp:651:42: required from ‘bool boost::graph::detail::isomorphism_impl::operator()(const Graph1&, const Graph2&, const ArgPack&) const [with ArgPack = boost::parameter::aux::arg_list >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&> >, boost::parameter::aux::empty_arg_list, std::integral_constant >; Graph1 = boost::adjacency_list >; Graph2 = boost::adjacency_list >]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/isomorphism.hpp:662:5: required from ‘typename boost::result_of(Param0, Param1, const ArgPack&)>::type boost::graph::isomorphism_with_named_params(const Param0&, const Param1&, const ArgPack&) [with Param0 = boost::adjacency_list >; Param1 = boost::adjacency_list >; ArgPack = boost::parameter::aux::arg_list >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&> >, boost::parameter::aux::empty_arg_list, std::integral_constant >; typename boost::result_of(Param0, Param1, const ArgPack&)>::type = bool]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/isomorphism.hpp:666:1: required from ‘typename boost::result_of(Param0, Param1, const typename boost::detail::convert_bgl_params_to_boost_parameter >::type&)>::type boost::isomorphism(const Param0&, const Param1&, const bgl_named_params&) [with Param0 = adjacency_list >; Param1 = adjacency_list >; P = iterator_property_map<__gnu_cxx::__normal_iterator >, adj_list_vertex_property_map >, int, int&, vertex_index_t>, void*, void*&>; T = vertex_isomorphism_t; R = no_property; typename result_of(Param0, Param1, const typename detail::convert_bgl_params_to_boost_parameter >::type&)>::type = bool; typename detail::convert_bgl_params_to_boost_parameter >::type = parameter::aux::arg_list >, adj_list_vertex_property_map >, int, int&, vertex_index_t>, void*, void*&> >, parameter::aux::empty_arg_list, std::integral_constant >]’ ordering.cpp:68:18: required from here /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::range_detail::ForwardIteratorConcept<__gnu_cxx::__normal_iterator > >]’ 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ^ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::range_detail::ForwardIteratorConcept<__gnu_cxx::__normal_iterator > >]’: /home/omnipath/local/R/4.4-3.20/BH/include/boost/range/concepts.hpp:321:9: required from ‘struct boost::ForwardRangeConcept >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/range/concepts.hpp:352:12: required from ‘struct boost::BidirectionalRangeConcept >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/range/concepts.hpp:370:12: required from ‘struct boost::RandomAccessRangeConcept >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::RandomAccessRangeConcept >]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied > >::value’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:45:51: [ skipping 3 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/isomorphism.hpp:172:21: required from ‘bool boost::detail::isomorphism_algo::test_isomorphism() [with Graph1 = boost::adjacency_list >; Graph2 = boost::adjacency_list >; IsoMapping = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&>; Invariant1 = boost::degree_vertex_invariant >, int, const int&, boost::vertex_index_t> >, boost::adjacency_list > >; Invariant2 = boost::degree_vertex_invariant >, int, const int&, boost::vertex_index_t> >, boost::adjacency_list > >; IndexMap1 = boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>; IndexMap2 = boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/isomorphism.hpp:532:33: required from ‘bool boost::isomorphism(const Graph1&, const Graph2&, IsoMapping, Invariant1, Invariant2, std::size_t, IndexMap1, IndexMap2) [with Graph1 = adjacency_list >; Graph2 = adjacency_list >; IsoMapping = iterator_property_map<__gnu_cxx::__normal_iterator >, adj_list_vertex_property_map >, int, int&, vertex_index_t>, void*, void*&>; Invariant1 = degree_vertex_invariant >, int, const int&, vertex_index_t> >, adjacency_list > >; Invariant2 = degree_vertex_invariant >, int, const int&, vertex_index_t> >, adjacency_list > >; IndexMap1 = adj_list_vertex_property_map >, int, const int&, vertex_index_t>; IndexMap2 = adj_list_vertex_property_map >, int, const int&, vertex_index_t>; std::size_t = long unsigned int]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/isomorphism.hpp:651:42: required from ‘bool boost::graph::detail::isomorphism_impl::operator()(const Graph1&, const Graph2&, const ArgPack&) const [with ArgPack = boost::parameter::aux::arg_list >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&> >, boost::parameter::aux::empty_arg_list, std::integral_constant >; Graph1 = boost::adjacency_list >; Graph2 = boost::adjacency_list >]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/isomorphism.hpp:662:5: required from ‘typename boost::result_of(Param0, Param1, const ArgPack&)>::type boost::graph::isomorphism_with_named_params(const Param0&, const Param1&, const ArgPack&) [with Param0 = boost::adjacency_list >; Param1 = boost::adjacency_list >; ArgPack = boost::parameter::aux::arg_list >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&> >, boost::parameter::aux::empty_arg_list, std::integral_constant >; typename boost::result_of(Param0, Param1, const ArgPack&)>::type = bool]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/isomorphism.hpp:666:1: required from ‘typename boost::result_of(Param0, Param1, const typename boost::detail::convert_bgl_params_to_boost_parameter >::type&)>::type boost::isomorphism(const Param0&, const Param1&, const bgl_named_params&) [with Param0 = adjacency_list >; Param1 = adjacency_list >; P = iterator_property_map<__gnu_cxx::__normal_iterator >, adj_list_vertex_property_map >, int, int&, vertex_index_t>, void*, void*&>; T = vertex_isomorphism_t; R = no_property; typename result_of(Param0, Param1, const typename detail::convert_bgl_params_to_boost_parameter >::type&)>::type = bool; typename detail::convert_bgl_params_to_boost_parameter >::type = parameter::aux::arg_list >, adj_list_vertex_property_map >, int, int&, vertex_index_t>, void*, void*&> >, parameter::aux::empty_arg_list, std::integral_constant >]’ ordering.cpp:68:18: required from here /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::range_detail::ForwardIteratorConcept::~ForwardIteratorConcept() [with Iterator = __gnu_cxx::__normal_iterator >]’ 37 | ~model() | ^ /home/omnipath/local/R/4.4-3.20/BH/include/boost/range/concepts.hpp:197:13: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 197 | BOOST_CONCEPT_USAGE(ForwardIteratorConcept) | ^~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements > > >]’: /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:137:5: required from ‘struct boost::DefaultConstructible<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/range/concepts.hpp:181:16: required from ‘struct boost::range_detail::ForwardIteratorConcept<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::range_detail::ForwardIteratorConcept<__gnu_cxx::__normal_iterator > >]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied > > >::value’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied > > >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:72:8: [ skipping 9 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/isomorphism.hpp:172:21: required from ‘bool boost::detail::isomorphism_algo::test_isomorphism() [with Graph1 = boost::adjacency_list >; Graph2 = boost::adjacency_list >; IsoMapping = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&>; Invariant1 = boost::degree_vertex_invariant >, int, const int&, boost::vertex_index_t> >, boost::adjacency_list > >; Invariant2 = boost::degree_vertex_invariant >, int, const int&, boost::vertex_index_t> >, boost::adjacency_list > >; IndexMap1 = boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>; IndexMap2 = boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/isomorphism.hpp:532:33: required from ‘bool boost::isomorphism(const Graph1&, const Graph2&, IsoMapping, Invariant1, Invariant2, std::size_t, IndexMap1, IndexMap2) [with Graph1 = adjacency_list >; Graph2 = adjacency_list >; IsoMapping = iterator_property_map<__gnu_cxx::__normal_iterator >, adj_list_vertex_property_map >, int, int&, vertex_index_t>, void*, void*&>; Invariant1 = degree_vertex_invariant >, int, const int&, vertex_index_t> >, adjacency_list > >; Invariant2 = degree_vertex_invariant >, int, const int&, vertex_index_t> >, adjacency_list > >; IndexMap1 = adj_list_vertex_property_map >, int, const int&, vertex_index_t>; IndexMap2 = adj_list_vertex_property_map >, int, const int&, vertex_index_t>; std::size_t = long unsigned int]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/isomorphism.hpp:651:42: required from ‘bool boost::graph::detail::isomorphism_impl::operator()(const Graph1&, const Graph2&, const ArgPack&) const [with ArgPack = boost::parameter::aux::arg_list >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&> >, boost::parameter::aux::empty_arg_list, std::integral_constant >; Graph1 = boost::adjacency_list >; Graph2 = boost::adjacency_list >]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/isomorphism.hpp:662:5: required from ‘typename boost::result_of(Param0, Param1, const ArgPack&)>::type boost::graph::isomorphism_with_named_params(const Param0&, const Param1&, const ArgPack&) [with Param0 = boost::adjacency_list >; Param1 = boost::adjacency_list >; ArgPack = boost::parameter::aux::arg_list >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&> >, boost::parameter::aux::empty_arg_list, std::integral_constant >; typename boost::result_of(Param0, Param1, const ArgPack&)>::type = bool]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/isomorphism.hpp:666:1: required from ‘typename boost::result_of(Param0, Param1, const typename boost::detail::convert_bgl_params_to_boost_parameter >::type&)>::type boost::isomorphism(const Param0&, const Param1&, const bgl_named_params&) [with Param0 = adjacency_list >; Param1 = adjacency_list >; P = iterator_property_map<__gnu_cxx::__normal_iterator >, adj_list_vertex_property_map >, int, int&, vertex_index_t>, void*, void*&>; T = vertex_isomorphism_t; R = no_property; typename result_of(Param0, Param1, const typename detail::convert_bgl_params_to_boost_parameter >::type&)>::type = bool; typename detail::convert_bgl_params_to_boost_parameter >::type = parameter::aux::arg_list >, adj_list_vertex_property_map >, int, int&, vertex_index_t>, void*, void*&> >, parameter::aux::empty_arg_list, std::integral_constant >]’ ordering.cpp:68:18: required from here /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::DefaultConstructible<__gnu_cxx::__normal_iterator > >]’ 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ^ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements > > >]’: /home/omnipath/local/R/4.4-3.20/BH/include/boost/range/concepts.hpp:197:13: required from ‘struct boost::range_detail::ForwardIteratorConcept<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::range_detail::ForwardIteratorConcept<__gnu_cxx::__normal_iterator > >]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied > > >::value’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied > > >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_ > >)>’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/range/concepts.hpp:322:9: [ skipping 8 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/isomorphism.hpp:172:21: required from ‘bool boost::detail::isomorphism_algo::test_isomorphism() [with Graph1 = boost::adjacency_list >; Graph2 = boost::adjacency_list >; IsoMapping = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&>; Invariant1 = boost::degree_vertex_invariant >, int, const int&, boost::vertex_index_t> >, boost::adjacency_list > >; Invariant2 = boost::degree_vertex_invariant >, int, const int&, boost::vertex_index_t> >, boost::adjacency_list > >; IndexMap1 = boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>; IndexMap2 = boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/isomorphism.hpp:532:33: required from ‘bool boost::isomorphism(const Graph1&, const Graph2&, IsoMapping, Invariant1, Invariant2, std::size_t, IndexMap1, IndexMap2) [with Graph1 = adjacency_list >; Graph2 = adjacency_list >; IsoMapping = iterator_property_map<__gnu_cxx::__normal_iterator >, adj_list_vertex_property_map >, int, int&, vertex_index_t>, void*, void*&>; Invariant1 = degree_vertex_invariant >, int, const int&, vertex_index_t> >, adjacency_list > >; Invariant2 = degree_vertex_invariant >, int, const int&, vertex_index_t> >, adjacency_list > >; IndexMap1 = adj_list_vertex_property_map >, int, const int&, vertex_index_t>; IndexMap2 = adj_list_vertex_property_map >, int, const int&, vertex_index_t>; std::size_t = long unsigned int]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/isomorphism.hpp:651:42: required from ‘bool boost::graph::detail::isomorphism_impl::operator()(const Graph1&, const Graph2&, const ArgPack&) const [with ArgPack = boost::parameter::aux::arg_list >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&> >, boost::parameter::aux::empty_arg_list, std::integral_constant >; Graph1 = boost::adjacency_list >; Graph2 = boost::adjacency_list >]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/isomorphism.hpp:662:5: required from ‘typename boost::result_of(Param0, Param1, const ArgPack&)>::type boost::graph::isomorphism_with_named_params(const Param0&, const Param1&, const ArgPack&) [with Param0 = boost::adjacency_list >; Param1 = boost::adjacency_list >; ArgPack = boost::parameter::aux::arg_list >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&> >, boost::parameter::aux::empty_arg_list, std::integral_constant >; typename boost::result_of(Param0, Param1, const ArgPack&)>::type = bool]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/isomorphism.hpp:666:1: required from ‘typename boost::result_of(Param0, Param1, const typename boost::detail::convert_bgl_params_to_boost_parameter >::type&)>::type boost::isomorphism(const Param0&, const Param1&, const bgl_named_params&) [with Param0 = adjacency_list >; Param1 = adjacency_list >; P = iterator_property_map<__gnu_cxx::__normal_iterator >, adj_list_vertex_property_map >, int, int&, vertex_index_t>, void*, void*&>; T = vertex_isomorphism_t; R = no_property; typename result_of(Param0, Param1, const typename detail::convert_bgl_params_to_boost_parameter >::type&)>::type = bool; typename detail::convert_bgl_params_to_boost_parameter >::type = parameter::aux::arg_list >, adj_list_vertex_property_map >, int, int&, vertex_index_t>, void*, void*&> >, parameter::aux::empty_arg_list, std::integral_constant >]’ ordering.cpp:68:18: required from here /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::range_detail::ForwardIteratorConcept<__gnu_cxx::__normal_iterator > >]’ 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ^ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::range_detail::ForwardIteratorConcept<__gnu_cxx::__normal_iterator > >]’: /home/omnipath/local/R/4.4-3.20/BH/include/boost/range/concepts.hpp:322:9: required from ‘struct boost::ForwardRangeConcept >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/range/concepts.hpp:352:12: required from ‘struct boost::BidirectionalRangeConcept >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/range/concepts.hpp:370:12: required from ‘struct boost::RandomAccessRangeConcept >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::RandomAccessRangeConcept >]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied > >::value’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:45:51: [ skipping 3 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/isomorphism.hpp:172:21: required from ‘bool boost::detail::isomorphism_algo::test_isomorphism() [with Graph1 = boost::adjacency_list >; Graph2 = boost::adjacency_list >; IsoMapping = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&>; Invariant1 = boost::degree_vertex_invariant >, int, const int&, boost::vertex_index_t> >, boost::adjacency_list > >; Invariant2 = boost::degree_vertex_invariant >, int, const int&, boost::vertex_index_t> >, boost::adjacency_list > >; IndexMap1 = boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>; IndexMap2 = boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/isomorphism.hpp:532:33: required from ‘bool boost::isomorphism(const Graph1&, const Graph2&, IsoMapping, Invariant1, Invariant2, std::size_t, IndexMap1, IndexMap2) [with Graph1 = adjacency_list >; Graph2 = adjacency_list >; IsoMapping = iterator_property_map<__gnu_cxx::__normal_iterator >, adj_list_vertex_property_map >, int, int&, vertex_index_t>, void*, void*&>; Invariant1 = degree_vertex_invariant >, int, const int&, vertex_index_t> >, adjacency_list > >; Invariant2 = degree_vertex_invariant >, int, const int&, vertex_index_t> >, adjacency_list > >; IndexMap1 = adj_list_vertex_property_map >, int, const int&, vertex_index_t>; IndexMap2 = adj_list_vertex_property_map >, int, const int&, vertex_index_t>; std::size_t = long unsigned int]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/isomorphism.hpp:651:42: required from ‘bool boost::graph::detail::isomorphism_impl::operator()(const Graph1&, const Graph2&, const ArgPack&) const [with ArgPack = boost::parameter::aux::arg_list >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&> >, boost::parameter::aux::empty_arg_list, std::integral_constant >; Graph1 = boost::adjacency_list >; Graph2 = boost::adjacency_list >]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/isomorphism.hpp:662:5: required from ‘typename boost::result_of(Param0, Param1, const ArgPack&)>::type boost::graph::isomorphism_with_named_params(const Param0&, const Param1&, const ArgPack&) [with Param0 = boost::adjacency_list >; Param1 = boost::adjacency_list >; ArgPack = boost::parameter::aux::arg_list >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&> >, boost::parameter::aux::empty_arg_list, std::integral_constant >; typename boost::result_of(Param0, Param1, const ArgPack&)>::type = bool]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/isomorphism.hpp:666:1: required from ‘typename boost::result_of(Param0, Param1, const typename boost::detail::convert_bgl_params_to_boost_parameter >::type&)>::type boost::isomorphism(const Param0&, const Param1&, const bgl_named_params&) [with Param0 = adjacency_list >; Param1 = adjacency_list >; P = iterator_property_map<__gnu_cxx::__normal_iterator >, adj_list_vertex_property_map >, int, int&, vertex_index_t>, void*, void*&>; T = vertex_isomorphism_t; R = no_property; typename result_of(Param0, Param1, const typename detail::convert_bgl_params_to_boost_parameter >::type&)>::type = bool; typename detail::convert_bgl_params_to_boost_parameter >::type = parameter::aux::arg_list >, adj_list_vertex_property_map >, int, int&, vertex_index_t>, void*, void*&> >, parameter::aux::empty_arg_list, std::integral_constant >]’ ordering.cpp:68:18: required from here /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::range_detail::ForwardIteratorConcept::~ForwardIteratorConcept() [with Iterator = __gnu_cxx::__normal_iterator >]’ 37 | ~model() | ^ /home/omnipath/local/R/4.4-3.20/BH/include/boost/range/concepts.hpp:197:13: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 197 | BOOST_CONCEPT_USAGE(ForwardIteratorConcept) | ^~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements >]’: /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:208:5: required from ‘struct boost::Convertible’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::Convertible]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied >::value’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_)>’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/range/concepts.hpp:218:14: [ skipping 12 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/isomorphism.hpp:172:21: required from ‘bool boost::detail::isomorphism_algo::test_isomorphism() [with Graph1 = boost::adjacency_list >; Graph2 = boost::adjacency_list >; IsoMapping = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&>; Invariant1 = boost::degree_vertex_invariant >, int, const int&, boost::vertex_index_t> >, boost::adjacency_list > >; Invariant2 = boost::degree_vertex_invariant >, int, const int&, boost::vertex_index_t> >, boost::adjacency_list > >; IndexMap1 = boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>; IndexMap2 = boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/isomorphism.hpp:532:33: required from ‘bool boost::isomorphism(const Graph1&, const Graph2&, IsoMapping, Invariant1, Invariant2, std::size_t, IndexMap1, IndexMap2) [with Graph1 = adjacency_list >; Graph2 = adjacency_list >; IsoMapping = iterator_property_map<__gnu_cxx::__normal_iterator >, adj_list_vertex_property_map >, int, int&, vertex_index_t>, void*, void*&>; Invariant1 = degree_vertex_invariant >, int, const int&, vertex_index_t> >, adjacency_list > >; Invariant2 = degree_vertex_invariant >, int, const int&, vertex_index_t> >, adjacency_list > >; IndexMap1 = adj_list_vertex_property_map >, int, const int&, vertex_index_t>; IndexMap2 = adj_list_vertex_property_map >, int, const int&, vertex_index_t>; std::size_t = long unsigned int]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/isomorphism.hpp:651:42: required from ‘bool boost::graph::detail::isomorphism_impl::operator()(const Graph1&, const Graph2&, const ArgPack&) const [with ArgPack = boost::parameter::aux::arg_list >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&> >, boost::parameter::aux::empty_arg_list, std::integral_constant >; Graph1 = boost::adjacency_list >; Graph2 = boost::adjacency_list >]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/isomorphism.hpp:662:5: required from ‘typename boost::result_of(Param0, Param1, const ArgPack&)>::type boost::graph::isomorphism_with_named_params(const Param0&, const Param1&, const ArgPack&) [with Param0 = boost::adjacency_list >; Param1 = boost::adjacency_list >; ArgPack = boost::parameter::aux::arg_list >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&> >, boost::parameter::aux::empty_arg_list, std::integral_constant >; typename boost::result_of(Param0, Param1, const ArgPack&)>::type = bool]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/isomorphism.hpp:666:1: required from ‘typename boost::result_of(Param0, Param1, const typename boost::detail::convert_bgl_params_to_boost_parameter >::type&)>::type boost::isomorphism(const Param0&, const Param1&, const bgl_named_params&) [with Param0 = adjacency_list >; Param1 = adjacency_list >; P = iterator_property_map<__gnu_cxx::__normal_iterator >, adj_list_vertex_property_map >, int, int&, vertex_index_t>, void*, void*&>; T = vertex_isomorphism_t; R = no_property; typename result_of(Param0, Param1, const typename detail::convert_bgl_params_to_boost_parameter >::type&)>::type = bool; typename detail::convert_bgl_params_to_boost_parameter >::type = parameter::aux::arg_list >, adj_list_vertex_property_map >, int, int&, vertex_index_t>, void*, void*&> >, parameter::aux::empty_arg_list, std::integral_constant >]’ ordering.cpp:68:18: required from here /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::Convertible]’ 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ^ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::Convertible]’: /home/omnipath/local/R/4.4-3.20/BH/include/boost/range/concepts.hpp:218:14: required from ‘struct boost::range_detail::BidirectionalIteratorConcept<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::range_detail::BidirectionalIteratorConcept<__gnu_cxx::__normal_iterator > >]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied > > >::value’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied > > >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_ > >)>’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/range/concepts.hpp:355:9: [ skipping 7 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/isomorphism.hpp:172:21: required from ‘bool boost::detail::isomorphism_algo::test_isomorphism() [with Graph1 = boost::adjacency_list >; Graph2 = boost::adjacency_list >; IsoMapping = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&>; Invariant1 = boost::degree_vertex_invariant >, int, const int&, boost::vertex_index_t> >, boost::adjacency_list > >; Invariant2 = boost::degree_vertex_invariant >, int, const int&, boost::vertex_index_t> >, boost::adjacency_list > >; IndexMap1 = boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>; IndexMap2 = boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/isomorphism.hpp:532:33: required from ‘bool boost::isomorphism(const Graph1&, const Graph2&, IsoMapping, Invariant1, Invariant2, std::size_t, IndexMap1, IndexMap2) [with Graph1 = adjacency_list >; Graph2 = adjacency_list >; IsoMapping = iterator_property_map<__gnu_cxx::__normal_iterator >, adj_list_vertex_property_map >, int, int&, vertex_index_t>, void*, void*&>; Invariant1 = degree_vertex_invariant >, int, const int&, vertex_index_t> >, adjacency_list > >; Invariant2 = degree_vertex_invariant >, int, const int&, vertex_index_t> >, adjacency_list > >; IndexMap1 = adj_list_vertex_property_map >, int, const int&, vertex_index_t>; IndexMap2 = adj_list_vertex_property_map >, int, const int&, vertex_index_t>; std::size_t = long unsigned int]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/isomorphism.hpp:651:42: required from ‘bool boost::graph::detail::isomorphism_impl::operator()(const Graph1&, const Graph2&, const ArgPack&) const [with ArgPack = boost::parameter::aux::arg_list >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&> >, boost::parameter::aux::empty_arg_list, std::integral_constant >; Graph1 = boost::adjacency_list >; Graph2 = boost::adjacency_list >]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/isomorphism.hpp:662:5: required from ‘typename boost::result_of(Param0, Param1, const ArgPack&)>::type boost::graph::isomorphism_with_named_params(const Param0&, const Param1&, const ArgPack&) [with Param0 = boost::adjacency_list >; Param1 = boost::adjacency_list >; ArgPack = boost::parameter::aux::arg_list >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&> >, boost::parameter::aux::empty_arg_list, std::integral_constant >; typename boost::result_of(Param0, Param1, const ArgPack&)>::type = bool]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/isomorphism.hpp:666:1: required from ‘typename boost::result_of(Param0, Param1, const typename boost::detail::convert_bgl_params_to_boost_parameter >::type&)>::type boost::isomorphism(const Param0&, const Param1&, const bgl_named_params&) [with Param0 = adjacency_list >; Param1 = adjacency_list >; P = iterator_property_map<__gnu_cxx::__normal_iterator >, adj_list_vertex_property_map >, int, int&, vertex_index_t>, void*, void*&>; T = vertex_isomorphism_t; R = no_property; typename result_of(Param0, Param1, const typename detail::convert_bgl_params_to_boost_parameter >::type&)>::type = bool; typename detail::convert_bgl_params_to_boost_parameter >::type = parameter::aux::arg_list >, adj_list_vertex_property_map >, int, int&, vertex_index_t>, void*, void*&> >, parameter::aux::empty_arg_list, std::integral_constant >]’ ordering.cpp:68:18: required from here /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::Convertible::~Convertible() [with X = boost::iterators::random_access_traversal_tag; Y = boost::iterators::bidirectional_traversal_tag]’ 37 | ~model() | ^ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:208:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 208 | BOOST_CONCEPT_USAGE(Convertible) { | ^~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements > > >]’: /home/omnipath/local/R/4.4-3.20/BH/include/boost/range/concepts.hpp:224:14: required from ‘struct boost::range_detail::BidirectionalIteratorConcept<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::range_detail::BidirectionalIteratorConcept<__gnu_cxx::__normal_iterator > >]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied > > >::value’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied > > >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_ > >)>’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/range/concepts.hpp:355:9: [ skipping 7 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/isomorphism.hpp:172:21: required from ‘bool boost::detail::isomorphism_algo::test_isomorphism() [with Graph1 = boost::adjacency_list >; Graph2 = boost::adjacency_list >; IsoMapping = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&>; Invariant1 = boost::degree_vertex_invariant >, int, const int&, boost::vertex_index_t> >, boost::adjacency_list > >; Invariant2 = boost::degree_vertex_invariant >, int, const int&, boost::vertex_index_t> >, boost::adjacency_list > >; IndexMap1 = boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>; IndexMap2 = boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/isomorphism.hpp:532:33: required from ‘bool boost::isomorphism(const Graph1&, const Graph2&, IsoMapping, Invariant1, Invariant2, std::size_t, IndexMap1, IndexMap2) [with Graph1 = adjacency_list >; Graph2 = adjacency_list >; IsoMapping = iterator_property_map<__gnu_cxx::__normal_iterator >, adj_list_vertex_property_map >, int, int&, vertex_index_t>, void*, void*&>; Invariant1 = degree_vertex_invariant >, int, const int&, vertex_index_t> >, adjacency_list > >; Invariant2 = degree_vertex_invariant >, int, const int&, vertex_index_t> >, adjacency_list > >; IndexMap1 = adj_list_vertex_property_map >, int, const int&, vertex_index_t>; IndexMap2 = adj_list_vertex_property_map >, int, const int&, vertex_index_t>; std::size_t = long unsigned int]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/isomorphism.hpp:651:42: required from ‘bool boost::graph::detail::isomorphism_impl::operator()(const Graph1&, const Graph2&, const ArgPack&) const [with ArgPack = boost::parameter::aux::arg_list >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&> >, boost::parameter::aux::empty_arg_list, std::integral_constant >; Graph1 = boost::adjacency_list >; Graph2 = boost::adjacency_list >]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/isomorphism.hpp:662:5: required from ‘typename boost::result_of(Param0, Param1, const ArgPack&)>::type boost::graph::isomorphism_with_named_params(const Param0&, const Param1&, const ArgPack&) [with Param0 = boost::adjacency_list >; Param1 = boost::adjacency_list >; ArgPack = boost::parameter::aux::arg_list >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&> >, boost::parameter::aux::empty_arg_list, std::integral_constant >; typename boost::result_of(Param0, Param1, const ArgPack&)>::type = bool]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/isomorphism.hpp:666:1: required from ‘typename boost::result_of(Param0, Param1, const typename boost::detail::convert_bgl_params_to_boost_parameter >::type&)>::type boost::isomorphism(const Param0&, const Param1&, const bgl_named_params&) [with Param0 = adjacency_list >; Param1 = adjacency_list >; P = iterator_property_map<__gnu_cxx::__normal_iterator >, adj_list_vertex_property_map >, int, int&, vertex_index_t>, void*, void*&>; T = vertex_isomorphism_t; R = no_property; typename result_of(Param0, Param1, const typename detail::convert_bgl_params_to_boost_parameter >::type&)>::type = bool; typename detail::convert_bgl_params_to_boost_parameter >::type = parameter::aux::arg_list >, adj_list_vertex_property_map >, int, int&, vertex_index_t>, void*, void*&> >, parameter::aux::empty_arg_list, std::integral_constant >]’ ordering.cpp:68:18: required from here /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::range_detail::BidirectionalIteratorConcept<__gnu_cxx::__normal_iterator > >]’ 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ^ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::range_detail::BidirectionalIteratorConcept<__gnu_cxx::__normal_iterator > >]’: /home/omnipath/local/R/4.4-3.20/BH/include/boost/range/concepts.hpp:355:9: required from ‘struct boost::BidirectionalRangeConcept >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/range/concepts.hpp:370:12: required from ‘struct boost::RandomAccessRangeConcept >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::RandomAccessRangeConcept >]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied > >::value’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied > >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:72:8: [ skipping 2 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/isomorphism.hpp:172:21: required from ‘bool boost::detail::isomorphism_algo::test_isomorphism() [with Graph1 = boost::adjacency_list >; Graph2 = boost::adjacency_list >; IsoMapping = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&>; Invariant1 = boost::degree_vertex_invariant >, int, const int&, boost::vertex_index_t> >, boost::adjacency_list > >; Invariant2 = boost::degree_vertex_invariant >, int, const int&, boost::vertex_index_t> >, boost::adjacency_list > >; IndexMap1 = boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>; IndexMap2 = boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/isomorphism.hpp:532:33: required from ‘bool boost::isomorphism(const Graph1&, const Graph2&, IsoMapping, Invariant1, Invariant2, std::size_t, IndexMap1, IndexMap2) [with Graph1 = adjacency_list >; Graph2 = adjacency_list >; IsoMapping = iterator_property_map<__gnu_cxx::__normal_iterator >, adj_list_vertex_property_map >, int, int&, vertex_index_t>, void*, void*&>; Invariant1 = degree_vertex_invariant >, int, const int&, vertex_index_t> >, adjacency_list > >; Invariant2 = degree_vertex_invariant >, int, const int&, vertex_index_t> >, adjacency_list > >; IndexMap1 = adj_list_vertex_property_map >, int, const int&, vertex_index_t>; IndexMap2 = adj_list_vertex_property_map >, int, const int&, vertex_index_t>; std::size_t = long unsigned int]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/isomorphism.hpp:651:42: required from ‘bool boost::graph::detail::isomorphism_impl::operator()(const Graph1&, const Graph2&, const ArgPack&) const [with ArgPack = boost::parameter::aux::arg_list >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&> >, boost::parameter::aux::empty_arg_list, std::integral_constant >; Graph1 = boost::adjacency_list >; Graph2 = boost::adjacency_list >]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/isomorphism.hpp:662:5: required from ‘typename boost::result_of(Param0, Param1, const ArgPack&)>::type boost::graph::isomorphism_with_named_params(const Param0&, const Param1&, const ArgPack&) [with Param0 = boost::adjacency_list >; Param1 = boost::adjacency_list >; ArgPack = boost::parameter::aux::arg_list >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&> >, boost::parameter::aux::empty_arg_list, std::integral_constant >; typename boost::result_of(Param0, Param1, const ArgPack&)>::type = bool]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/isomorphism.hpp:666:1: required from ‘typename boost::result_of(Param0, Param1, const typename boost::detail::convert_bgl_params_to_boost_parameter >::type&)>::type boost::isomorphism(const Param0&, const Param1&, const bgl_named_params&) [with Param0 = adjacency_list >; Param1 = adjacency_list >; P = iterator_property_map<__gnu_cxx::__normal_iterator >, adj_list_vertex_property_map >, int, int&, vertex_index_t>, void*, void*&>; T = vertex_isomorphism_t; R = no_property; typename result_of(Param0, Param1, const typename detail::convert_bgl_params_to_boost_parameter >::type&)>::type = bool; typename detail::convert_bgl_params_to_boost_parameter >::type = parameter::aux::arg_list >, adj_list_vertex_property_map >, int, int&, vertex_index_t>, void*, void*&> >, parameter::aux::empty_arg_list, std::integral_constant >]’ ordering.cpp:68:18: required from here /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::range_detail::BidirectionalIteratorConcept::~BidirectionalIteratorConcept() [with Iterator = __gnu_cxx::__normal_iterator >]’ 37 | ~model() | ^ /home/omnipath/local/R/4.4-3.20/BH/include/boost/range/concepts.hpp:224:14: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 224 | BOOST_CONCEPT_USAGE(BidirectionalIteratorConcept) | ^~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements > > >]’: /home/omnipath/local/R/4.4-3.20/BH/include/boost/range/concepts.hpp:224:14: required from ‘struct boost::range_detail::BidirectionalIteratorConcept<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::range_detail::BidirectionalIteratorConcept<__gnu_cxx::__normal_iterator > >]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied > > >::value’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied > > >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_ > >)>’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/range/concepts.hpp:356:9: [ skipping 7 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/isomorphism.hpp:172:21: required from ‘bool boost::detail::isomorphism_algo::test_isomorphism() [with Graph1 = boost::adjacency_list >; Graph2 = boost::adjacency_list >; IsoMapping = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&>; Invariant1 = boost::degree_vertex_invariant >, int, const int&, boost::vertex_index_t> >, boost::adjacency_list > >; Invariant2 = boost::degree_vertex_invariant >, int, const int&, boost::vertex_index_t> >, boost::adjacency_list > >; IndexMap1 = boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>; IndexMap2 = boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/isomorphism.hpp:532:33: required from ‘bool boost::isomorphism(const Graph1&, const Graph2&, IsoMapping, Invariant1, Invariant2, std::size_t, IndexMap1, IndexMap2) [with Graph1 = adjacency_list >; Graph2 = adjacency_list >; IsoMapping = iterator_property_map<__gnu_cxx::__normal_iterator >, adj_list_vertex_property_map >, int, int&, vertex_index_t>, void*, void*&>; Invariant1 = degree_vertex_invariant >, int, const int&, vertex_index_t> >, adjacency_list > >; Invariant2 = degree_vertex_invariant >, int, const int&, vertex_index_t> >, adjacency_list > >; IndexMap1 = adj_list_vertex_property_map >, int, const int&, vertex_index_t>; IndexMap2 = adj_list_vertex_property_map >, int, const int&, vertex_index_t>; std::size_t = long unsigned int]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/isomorphism.hpp:651:42: required from ‘bool boost::graph::detail::isomorphism_impl::operator()(const Graph1&, const Graph2&, const ArgPack&) const [with ArgPack = boost::parameter::aux::arg_list >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&> >, boost::parameter::aux::empty_arg_list, std::integral_constant >; Graph1 = boost::adjacency_list >; Graph2 = boost::adjacency_list >]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/isomorphism.hpp:662:5: required from ‘typename boost::result_of(Param0, Param1, const ArgPack&)>::type boost::graph::isomorphism_with_named_params(const Param0&, const Param1&, const ArgPack&) [with Param0 = boost::adjacency_list >; Param1 = boost::adjacency_list >; ArgPack = boost::parameter::aux::arg_list >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&> >, boost::parameter::aux::empty_arg_list, std::integral_constant >; typename boost::result_of(Param0, Param1, const ArgPack&)>::type = bool]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/isomorphism.hpp:666:1: required from ‘typename boost::result_of(Param0, Param1, const typename boost::detail::convert_bgl_params_to_boost_parameter >::type&)>::type boost::isomorphism(const Param0&, const Param1&, const bgl_named_params&) [with Param0 = adjacency_list >; Param1 = adjacency_list >; P = iterator_property_map<__gnu_cxx::__normal_iterator >, adj_list_vertex_property_map >, int, int&, vertex_index_t>, void*, void*&>; T = vertex_isomorphism_t; R = no_property; typename result_of(Param0, Param1, const typename detail::convert_bgl_params_to_boost_parameter >::type&)>::type = bool; typename detail::convert_bgl_params_to_boost_parameter >::type = parameter::aux::arg_list >, adj_list_vertex_property_map >, int, int&, vertex_index_t>, void*, void*&> >, parameter::aux::empty_arg_list, std::integral_constant >]’ ordering.cpp:68:18: required from here /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::range_detail::BidirectionalIteratorConcept<__gnu_cxx::__normal_iterator > >]’ 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ^ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::range_detail::BidirectionalIteratorConcept<__gnu_cxx::__normal_iterator > >]’: /home/omnipath/local/R/4.4-3.20/BH/include/boost/range/concepts.hpp:356:9: required from ‘struct boost::BidirectionalRangeConcept >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/range/concepts.hpp:370:12: required from ‘struct boost::RandomAccessRangeConcept >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::RandomAccessRangeConcept >]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied > >::value’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied > >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:72:8: [ skipping 2 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/isomorphism.hpp:172:21: required from ‘bool boost::detail::isomorphism_algo::test_isomorphism() [with Graph1 = boost::adjacency_list >; Graph2 = boost::adjacency_list >; IsoMapping = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&>; Invariant1 = boost::degree_vertex_invariant >, int, const int&, boost::vertex_index_t> >, boost::adjacency_list > >; Invariant2 = boost::degree_vertex_invariant >, int, const int&, boost::vertex_index_t> >, boost::adjacency_list > >; IndexMap1 = boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>; IndexMap2 = boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/isomorphism.hpp:532:33: required from ‘bool boost::isomorphism(const Graph1&, const Graph2&, IsoMapping, Invariant1, Invariant2, std::size_t, IndexMap1, IndexMap2) [with Graph1 = adjacency_list >; Graph2 = adjacency_list >; IsoMapping = iterator_property_map<__gnu_cxx::__normal_iterator >, adj_list_vertex_property_map >, int, int&, vertex_index_t>, void*, void*&>; Invariant1 = degree_vertex_invariant >, int, const int&, vertex_index_t> >, adjacency_list > >; Invariant2 = degree_vertex_invariant >, int, const int&, vertex_index_t> >, adjacency_list > >; IndexMap1 = adj_list_vertex_property_map >, int, const int&, vertex_index_t>; IndexMap2 = adj_list_vertex_property_map >, int, const int&, vertex_index_t>; std::size_t = long unsigned int]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/isomorphism.hpp:651:42: required from ‘bool boost::graph::detail::isomorphism_impl::operator()(const Graph1&, const Graph2&, const ArgPack&) const [with ArgPack = boost::parameter::aux::arg_list >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&> >, boost::parameter::aux::empty_arg_list, std::integral_constant >; Graph1 = boost::adjacency_list >; Graph2 = boost::adjacency_list >]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/isomorphism.hpp:662:5: required from ‘typename boost::result_of(Param0, Param1, const ArgPack&)>::type boost::graph::isomorphism_with_named_params(const Param0&, const Param1&, const ArgPack&) [with Param0 = boost::adjacency_list >; Param1 = boost::adjacency_list >; ArgPack = boost::parameter::aux::arg_list >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&> >, boost::parameter::aux::empty_arg_list, std::integral_constant >; typename boost::result_of(Param0, Param1, const ArgPack&)>::type = bool]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/isomorphism.hpp:666:1: required from ‘typename boost::result_of(Param0, Param1, const typename boost::detail::convert_bgl_params_to_boost_parameter >::type&)>::type boost::isomorphism(const Param0&, const Param1&, const bgl_named_params&) [with Param0 = adjacency_list >; Param1 = adjacency_list >; P = iterator_property_map<__gnu_cxx::__normal_iterator >, adj_list_vertex_property_map >, int, int&, vertex_index_t>, void*, void*&>; T = vertex_isomorphism_t; R = no_property; typename result_of(Param0, Param1, const typename detail::convert_bgl_params_to_boost_parameter >::type&)>::type = bool; typename detail::convert_bgl_params_to_boost_parameter >::type = parameter::aux::arg_list >, adj_list_vertex_property_map >, int, int&, vertex_index_t>, void*, void*&> >, parameter::aux::empty_arg_list, std::integral_constant >]’ ordering.cpp:68:18: required from here /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::range_detail::BidirectionalIteratorConcept::~BidirectionalIteratorConcept() [with Iterator = __gnu_cxx::__normal_iterator >]’ 37 | ~model() | ^ /home/omnipath/local/R/4.4-3.20/BH/include/boost/range/concepts.hpp:224:14: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 224 | BOOST_CONCEPT_USAGE(BidirectionalIteratorConcept) | ^~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements >]’: /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:208:5: required from ‘struct boost::Convertible’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::Convertible]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied >::value’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_)>’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/range/concepts.hpp:239:14: [ skipping 11 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/isomorphism.hpp:172:21: required from ‘bool boost::detail::isomorphism_algo::test_isomorphism() [with Graph1 = boost::adjacency_list >; Graph2 = boost::adjacency_list >; IsoMapping = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&>; Invariant1 = boost::degree_vertex_invariant >, int, const int&, boost::vertex_index_t> >, boost::adjacency_list > >; Invariant2 = boost::degree_vertex_invariant >, int, const int&, boost::vertex_index_t> >, boost::adjacency_list > >; IndexMap1 = boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>; IndexMap2 = boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/isomorphism.hpp:532:33: required from ‘bool boost::isomorphism(const Graph1&, const Graph2&, IsoMapping, Invariant1, Invariant2, std::size_t, IndexMap1, IndexMap2) [with Graph1 = adjacency_list >; Graph2 = adjacency_list >; IsoMapping = iterator_property_map<__gnu_cxx::__normal_iterator >, adj_list_vertex_property_map >, int, int&, vertex_index_t>, void*, void*&>; Invariant1 = degree_vertex_invariant >, int, const int&, vertex_index_t> >, adjacency_list > >; Invariant2 = degree_vertex_invariant >, int, const int&, vertex_index_t> >, adjacency_list > >; IndexMap1 = adj_list_vertex_property_map >, int, const int&, vertex_index_t>; IndexMap2 = adj_list_vertex_property_map >, int, const int&, vertex_index_t>; std::size_t = long unsigned int]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/isomorphism.hpp:651:42: required from ‘bool boost::graph::detail::isomorphism_impl::operator()(const Graph1&, const Graph2&, const ArgPack&) const [with ArgPack = boost::parameter::aux::arg_list >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&> >, boost::parameter::aux::empty_arg_list, std::integral_constant >; Graph1 = boost::adjacency_list >; Graph2 = boost::adjacency_list >]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/isomorphism.hpp:662:5: required from ‘typename boost::result_of(Param0, Param1, const ArgPack&)>::type boost::graph::isomorphism_with_named_params(const Param0&, const Param1&, const ArgPack&) [with Param0 = boost::adjacency_list >; Param1 = boost::adjacency_list >; ArgPack = boost::parameter::aux::arg_list >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&> >, boost::parameter::aux::empty_arg_list, std::integral_constant >; typename boost::result_of(Param0, Param1, const ArgPack&)>::type = bool]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/isomorphism.hpp:666:1: required from ‘typename boost::result_of(Param0, Param1, const typename boost::detail::convert_bgl_params_to_boost_parameter >::type&)>::type boost::isomorphism(const Param0&, const Param1&, const bgl_named_params&) [with Param0 = adjacency_list >; Param1 = adjacency_list >; P = iterator_property_map<__gnu_cxx::__normal_iterator >, adj_list_vertex_property_map >, int, int&, vertex_index_t>, void*, void*&>; T = vertex_isomorphism_t; R = no_property; typename result_of(Param0, Param1, const typename detail::convert_bgl_params_to_boost_parameter >::type&)>::type = bool; typename detail::convert_bgl_params_to_boost_parameter >::type = parameter::aux::arg_list >, adj_list_vertex_property_map >, int, int&, vertex_index_t>, void*, void*&> >, parameter::aux::empty_arg_list, std::integral_constant >]’ ordering.cpp:68:18: required from here /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::Convertible]’ 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ^ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::Convertible]’: /home/omnipath/local/R/4.4-3.20/BH/include/boost/range/concepts.hpp:239:14: required from ‘struct boost::range_detail::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::range_detail::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator > >]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied > > >::value’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied > > >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_ > >)>’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/range/concepts.hpp:373:9: [ skipping 6 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/isomorphism.hpp:172:21: required from ‘bool boost::detail::isomorphism_algo::test_isomorphism() [with Graph1 = boost::adjacency_list >; Graph2 = boost::adjacency_list >; IsoMapping = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&>; Invariant1 = boost::degree_vertex_invariant >, int, const int&, boost::vertex_index_t> >, boost::adjacency_list > >; Invariant2 = boost::degree_vertex_invariant >, int, const int&, boost::vertex_index_t> >, boost::adjacency_list > >; IndexMap1 = boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>; IndexMap2 = boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/isomorphism.hpp:532:33: required from ‘bool boost::isomorphism(const Graph1&, const Graph2&, IsoMapping, Invariant1, Invariant2, std::size_t, IndexMap1, IndexMap2) [with Graph1 = adjacency_list >; Graph2 = adjacency_list >; IsoMapping = iterator_property_map<__gnu_cxx::__normal_iterator >, adj_list_vertex_property_map >, int, int&, vertex_index_t>, void*, void*&>; Invariant1 = degree_vertex_invariant >, int, const int&, vertex_index_t> >, adjacency_list > >; Invariant2 = degree_vertex_invariant >, int, const int&, vertex_index_t> >, adjacency_list > >; IndexMap1 = adj_list_vertex_property_map >, int, const int&, vertex_index_t>; IndexMap2 = adj_list_vertex_property_map >, int, const int&, vertex_index_t>; std::size_t = long unsigned int]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/isomorphism.hpp:651:42: required from ‘bool boost::graph::detail::isomorphism_impl::operator()(const Graph1&, const Graph2&, const ArgPack&) const [with ArgPack = boost::parameter::aux::arg_list >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&> >, boost::parameter::aux::empty_arg_list, std::integral_constant >; Graph1 = boost::adjacency_list >; Graph2 = boost::adjacency_list >]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/isomorphism.hpp:662:5: required from ‘typename boost::result_of(Param0, Param1, const ArgPack&)>::type boost::graph::isomorphism_with_named_params(const Param0&, const Param1&, const ArgPack&) [with Param0 = boost::adjacency_list >; Param1 = boost::adjacency_list >; ArgPack = boost::parameter::aux::arg_list >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&> >, boost::parameter::aux::empty_arg_list, std::integral_constant >; typename boost::result_of(Param0, Param1, const ArgPack&)>::type = bool]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/isomorphism.hpp:666:1: required from ‘typename boost::result_of(Param0, Param1, const typename boost::detail::convert_bgl_params_to_boost_parameter >::type&)>::type boost::isomorphism(const Param0&, const Param1&, const bgl_named_params&) [with Param0 = adjacency_list >; Param1 = adjacency_list >; P = iterator_property_map<__gnu_cxx::__normal_iterator >, adj_list_vertex_property_map >, int, int&, vertex_index_t>, void*, void*&>; T = vertex_isomorphism_t; R = no_property; typename result_of(Param0, Param1, const typename detail::convert_bgl_params_to_boost_parameter >::type&)>::type = bool; typename detail::convert_bgl_params_to_boost_parameter >::type = parameter::aux::arg_list >, adj_list_vertex_property_map >, int, int&, vertex_index_t>, void*, void*&> >, parameter::aux::empty_arg_list, std::integral_constant >]’ ordering.cpp:68:18: required from here /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::Convertible::~Convertible() [with X = boost::iterators::random_access_traversal_tag; Y = boost::iterators::random_access_traversal_tag]’ 37 | ~model() | ^ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:208:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 208 | BOOST_CONCEPT_USAGE(Convertible) { | ^~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements > > >]’: /home/omnipath/local/R/4.4-3.20/BH/include/boost/range/concepts.hpp:245:14: required from ‘struct boost::range_detail::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::range_detail::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator > >]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied > > >::value’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied > > >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_ > >)>’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/range/concepts.hpp:373:9: [ skipping 6 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/isomorphism.hpp:172:21: required from ‘bool boost::detail::isomorphism_algo::test_isomorphism() [with Graph1 = boost::adjacency_list >; Graph2 = boost::adjacency_list >; IsoMapping = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&>; Invariant1 = boost::degree_vertex_invariant >, int, const int&, boost::vertex_index_t> >, boost::adjacency_list > >; Invariant2 = boost::degree_vertex_invariant >, int, const int&, boost::vertex_index_t> >, boost::adjacency_list > >; IndexMap1 = boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>; IndexMap2 = boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/isomorphism.hpp:532:33: required from ‘bool boost::isomorphism(const Graph1&, const Graph2&, IsoMapping, Invariant1, Invariant2, std::size_t, IndexMap1, IndexMap2) [with Graph1 = adjacency_list >; Graph2 = adjacency_list >; IsoMapping = iterator_property_map<__gnu_cxx::__normal_iterator >, adj_list_vertex_property_map >, int, int&, vertex_index_t>, void*, void*&>; Invariant1 = degree_vertex_invariant >, int, const int&, vertex_index_t> >, adjacency_list > >; Invariant2 = degree_vertex_invariant >, int, const int&, vertex_index_t> >, adjacency_list > >; IndexMap1 = adj_list_vertex_property_map >, int, const int&, vertex_index_t>; IndexMap2 = adj_list_vertex_property_map >, int, const int&, vertex_index_t>; std::size_t = long unsigned int]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/isomorphism.hpp:651:42: required from ‘bool boost::graph::detail::isomorphism_impl::operator()(const Graph1&, const Graph2&, const ArgPack&) const [with ArgPack = boost::parameter::aux::arg_list >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&> >, boost::parameter::aux::empty_arg_list, std::integral_constant >; Graph1 = boost::adjacency_list >; Graph2 = boost::adjacency_list >]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/isomorphism.hpp:662:5: required from ‘typename boost::result_of(Param0, Param1, const ArgPack&)>::type boost::graph::isomorphism_with_named_params(const Param0&, const Param1&, const ArgPack&) [with Param0 = boost::adjacency_list >; Param1 = boost::adjacency_list >; ArgPack = boost::parameter::aux::arg_list >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&> >, boost::parameter::aux::empty_arg_list, std::integral_constant >; typename boost::result_of(Param0, Param1, const ArgPack&)>::type = bool]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/isomorphism.hpp:666:1: required from ‘typename boost::result_of(Param0, Param1, const typename boost::detail::convert_bgl_params_to_boost_parameter >::type&)>::type boost::isomorphism(const Param0&, const Param1&, const bgl_named_params&) [with Param0 = adjacency_list >; Param1 = adjacency_list >; P = iterator_property_map<__gnu_cxx::__normal_iterator >, adj_list_vertex_property_map >, int, int&, vertex_index_t>, void*, void*&>; T = vertex_isomorphism_t; R = no_property; typename result_of(Param0, Param1, const typename detail::convert_bgl_params_to_boost_parameter >::type&)>::type = bool; typename detail::convert_bgl_params_to_boost_parameter >::type = parameter::aux::arg_list >, adj_list_vertex_property_map >, int, int&, vertex_index_t>, void*, void*&> >, parameter::aux::empty_arg_list, std::integral_constant >]’ ordering.cpp:68:18: required from here /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::range_detail::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator > >]’ 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ^ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::range_detail::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator > >]’: /home/omnipath/local/R/4.4-3.20/BH/include/boost/range/concepts.hpp:373:9: required from ‘struct boost::RandomAccessRangeConcept >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::RandomAccessRangeConcept >]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied > >::value’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied > >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:72:8: [ skipping 2 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/isomorphism.hpp:172:21: required from ‘bool boost::detail::isomorphism_algo::test_isomorphism() [with Graph1 = boost::adjacency_list >; Graph2 = boost::adjacency_list >; IsoMapping = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&>; Invariant1 = boost::degree_vertex_invariant >, int, const int&, boost::vertex_index_t> >, boost::adjacency_list > >; Invariant2 = boost::degree_vertex_invariant >, int, const int&, boost::vertex_index_t> >, boost::adjacency_list > >; IndexMap1 = boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>; IndexMap2 = boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/isomorphism.hpp:532:33: required from ‘bool boost::isomorphism(const Graph1&, const Graph2&, IsoMapping, Invariant1, Invariant2, std::size_t, IndexMap1, IndexMap2) [with Graph1 = adjacency_list >; Graph2 = adjacency_list >; IsoMapping = iterator_property_map<__gnu_cxx::__normal_iterator >, adj_list_vertex_property_map >, int, int&, vertex_index_t>, void*, void*&>; Invariant1 = degree_vertex_invariant >, int, const int&, vertex_index_t> >, adjacency_list > >; Invariant2 = degree_vertex_invariant >, int, const int&, vertex_index_t> >, adjacency_list > >; IndexMap1 = adj_list_vertex_property_map >, int, const int&, vertex_index_t>; IndexMap2 = adj_list_vertex_property_map >, int, const int&, vertex_index_t>; std::size_t = long unsigned int]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/isomorphism.hpp:651:42: required from ‘bool boost::graph::detail::isomorphism_impl::operator()(const Graph1&, const Graph2&, const ArgPack&) const [with ArgPack = boost::parameter::aux::arg_list >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&> >, boost::parameter::aux::empty_arg_list, std::integral_constant >; Graph1 = boost::adjacency_list >; Graph2 = boost::adjacency_list >]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/isomorphism.hpp:662:5: required from ‘typename boost::result_of(Param0, Param1, const ArgPack&)>::type boost::graph::isomorphism_with_named_params(const Param0&, const Param1&, const ArgPack&) [with Param0 = boost::adjacency_list >; Param1 = boost::adjacency_list >; ArgPack = boost::parameter::aux::arg_list >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&> >, boost::parameter::aux::empty_arg_list, std::integral_constant >; typename boost::result_of(Param0, Param1, const ArgPack&)>::type = bool]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/isomorphism.hpp:666:1: required from ‘typename boost::result_of(Param0, Param1, const typename boost::detail::convert_bgl_params_to_boost_parameter >::type&)>::type boost::isomorphism(const Param0&, const Param1&, const bgl_named_params&) [with Param0 = adjacency_list >; Param1 = adjacency_list >; P = iterator_property_map<__gnu_cxx::__normal_iterator >, adj_list_vertex_property_map >, int, int&, vertex_index_t>, void*, void*&>; T = vertex_isomorphism_t; R = no_property; typename result_of(Param0, Param1, const typename detail::convert_bgl_params_to_boost_parameter >::type&)>::type = bool; typename detail::convert_bgl_params_to_boost_parameter >::type = parameter::aux::arg_list >, adj_list_vertex_property_map >, int, int&, vertex_index_t>, void*, void*&> >, parameter::aux::empty_arg_list, std::integral_constant >]’ ordering.cpp:68:18: required from here /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::range_detail::RandomAccessIteratorConcept::~RandomAccessIteratorConcept() [with Iterator = __gnu_cxx::__normal_iterator >]’ 37 | ~model() | ^ /home/omnipath/local/R/4.4-3.20/BH/include/boost/range/concepts.hpp:245:14: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 245 | BOOST_CONCEPT_USAGE(RandomAccessIteratorConcept) | ^~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements > > >]’: /home/omnipath/local/R/4.4-3.20/BH/include/boost/range/concepts.hpp:245:14: required from ‘struct boost::range_detail::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::range_detail::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator > >]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied > > >::value’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied > > >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_ > >)>’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/range/concepts.hpp:374:9: [ skipping 6 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/isomorphism.hpp:172:21: required from ‘bool boost::detail::isomorphism_algo::test_isomorphism() [with Graph1 = boost::adjacency_list >; Graph2 = boost::adjacency_list >; IsoMapping = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&>; Invariant1 = boost::degree_vertex_invariant >, int, const int&, boost::vertex_index_t> >, boost::adjacency_list > >; Invariant2 = boost::degree_vertex_invariant >, int, const int&, boost::vertex_index_t> >, boost::adjacency_list > >; IndexMap1 = boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>; IndexMap2 = boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/isomorphism.hpp:532:33: required from ‘bool boost::isomorphism(const Graph1&, const Graph2&, IsoMapping, Invariant1, Invariant2, std::size_t, IndexMap1, IndexMap2) [with Graph1 = adjacency_list >; Graph2 = adjacency_list >; IsoMapping = iterator_property_map<__gnu_cxx::__normal_iterator >, adj_list_vertex_property_map >, int, int&, vertex_index_t>, void*, void*&>; Invariant1 = degree_vertex_invariant >, int, const int&, vertex_index_t> >, adjacency_list > >; Invariant2 = degree_vertex_invariant >, int, const int&, vertex_index_t> >, adjacency_list > >; IndexMap1 = adj_list_vertex_property_map >, int, const int&, vertex_index_t>; IndexMap2 = adj_list_vertex_property_map >, int, const int&, vertex_index_t>; std::size_t = long unsigned int]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/isomorphism.hpp:651:42: required from ‘bool boost::graph::detail::isomorphism_impl::operator()(const Graph1&, const Graph2&, const ArgPack&) const [with ArgPack = boost::parameter::aux::arg_list >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&> >, boost::parameter::aux::empty_arg_list, std::integral_constant >; Graph1 = boost::adjacency_list >; Graph2 = boost::adjacency_list >]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/isomorphism.hpp:662:5: required from ‘typename boost::result_of(Param0, Param1, const ArgPack&)>::type boost::graph::isomorphism_with_named_params(const Param0&, const Param1&, const ArgPack&) [with Param0 = boost::adjacency_list >; Param1 = boost::adjacency_list >; ArgPack = boost::parameter::aux::arg_list >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&> >, boost::parameter::aux::empty_arg_list, std::integral_constant >; typename boost::result_of(Param0, Param1, const ArgPack&)>::type = bool]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/isomorphism.hpp:666:1: required from ‘typename boost::result_of(Param0, Param1, const typename boost::detail::convert_bgl_params_to_boost_parameter >::type&)>::type boost::isomorphism(const Param0&, const Param1&, const bgl_named_params&) [with Param0 = adjacency_list >; Param1 = adjacency_list >; P = iterator_property_map<__gnu_cxx::__normal_iterator >, adj_list_vertex_property_map >, int, int&, vertex_index_t>, void*, void*&>; T = vertex_isomorphism_t; R = no_property; typename result_of(Param0, Param1, const typename detail::convert_bgl_params_to_boost_parameter >::type&)>::type = bool; typename detail::convert_bgl_params_to_boost_parameter >::type = parameter::aux::arg_list >, adj_list_vertex_property_map >, int, int&, vertex_index_t>, void*, void*&> >, parameter::aux::empty_arg_list, std::integral_constant >]’ ordering.cpp:68:18: required from here /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::range_detail::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator > >]’ 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ^ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::range_detail::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator > >]’: /home/omnipath/local/R/4.4-3.20/BH/include/boost/range/concepts.hpp:374:9: required from ‘struct boost::RandomAccessRangeConcept >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::RandomAccessRangeConcept >]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied > >::value’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied > >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:72:8: [ skipping 2 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/isomorphism.hpp:172:21: required from ‘bool boost::detail::isomorphism_algo::test_isomorphism() [with Graph1 = boost::adjacency_list >; Graph2 = boost::adjacency_list >; IsoMapping = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&>; Invariant1 = boost::degree_vertex_invariant >, int, const int&, boost::vertex_index_t> >, boost::adjacency_list > >; Invariant2 = boost::degree_vertex_invariant >, int, const int&, boost::vertex_index_t> >, boost::adjacency_list > >; IndexMap1 = boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>; IndexMap2 = boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/isomorphism.hpp:532:33: required from ‘bool boost::isomorphism(const Graph1&, const Graph2&, IsoMapping, Invariant1, Invariant2, std::size_t, IndexMap1, IndexMap2) [with Graph1 = adjacency_list >; Graph2 = adjacency_list >; IsoMapping = iterator_property_map<__gnu_cxx::__normal_iterator >, adj_list_vertex_property_map >, int, int&, vertex_index_t>, void*, void*&>; Invariant1 = degree_vertex_invariant >, int, const int&, vertex_index_t> >, adjacency_list > >; Invariant2 = degree_vertex_invariant >, int, const int&, vertex_index_t> >, adjacency_list > >; IndexMap1 = adj_list_vertex_property_map >, int, const int&, vertex_index_t>; IndexMap2 = adj_list_vertex_property_map >, int, const int&, vertex_index_t>; std::size_t = long unsigned int]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/isomorphism.hpp:651:42: required from ‘bool boost::graph::detail::isomorphism_impl::operator()(const Graph1&, const Graph2&, const ArgPack&) const [with ArgPack = boost::parameter::aux::arg_list >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&> >, boost::parameter::aux::empty_arg_list, std::integral_constant >; Graph1 = boost::adjacency_list >; Graph2 = boost::adjacency_list >]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/isomorphism.hpp:662:5: required from ‘typename boost::result_of(Param0, Param1, const ArgPack&)>::type boost::graph::isomorphism_with_named_params(const Param0&, const Param1&, const ArgPack&) [with Param0 = boost::adjacency_list >; Param1 = boost::adjacency_list >; ArgPack = boost::parameter::aux::arg_list >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&> >, boost::parameter::aux::empty_arg_list, std::integral_constant >; typename boost::result_of(Param0, Param1, const ArgPack&)>::type = bool]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/isomorphism.hpp:666:1: required from ‘typename boost::result_of(Param0, Param1, const typename boost::detail::convert_bgl_params_to_boost_parameter >::type&)>::type boost::isomorphism(const Param0&, const Param1&, const bgl_named_params&) [with Param0 = adjacency_list >; Param1 = adjacency_list >; P = iterator_property_map<__gnu_cxx::__normal_iterator >, adj_list_vertex_property_map >, int, int&, vertex_index_t>, void*, void*&>; T = vertex_isomorphism_t; R = no_property; typename result_of(Param0, Param1, const typename detail::convert_bgl_params_to_boost_parameter >::type&)>::type = bool; typename detail::convert_bgl_params_to_boost_parameter >::type = parameter::aux::arg_list >, adj_list_vertex_property_map >, int, int&, vertex_index_t>, void*, void*&> >, parameter::aux::empty_arg_list, std::integral_constant >]’ ordering.cpp:68:18: required from here /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::range_detail::RandomAccessIteratorConcept::~RandomAccessIteratorConcept() [with Iterator = __gnu_cxx::__normal_iterator >]’ 37 | ~model() | ^ /home/omnipath/local/R/4.4-3.20/BH/include/boost/range/concepts.hpp:245:14: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 245 | BOOST_CONCEPT_USAGE(RandomAccessIteratorConcept) | ^~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::RandomAccessRangeConcept >]’: /home/omnipath/local/R/4.4-3.20/BH/include/boost/range/algorithm/sort.hpp:32:5: required from ‘RandomAccessRange& boost::range::sort(RandomAccessRange&) [with RandomAccessRange = std::vector]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/isomorphism.hpp:172:21: required from ‘bool boost::detail::isomorphism_algo::test_isomorphism() [with Graph1 = boost::adjacency_list >; Graph2 = boost::adjacency_list >; IsoMapping = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&>; Invariant1 = boost::degree_vertex_invariant >, int, const int&, boost::vertex_index_t> >, boost::adjacency_list > >; Invariant2 = boost::degree_vertex_invariant >, int, const int&, boost::vertex_index_t> >, boost::adjacency_list > >; IndexMap1 = boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>; IndexMap2 = boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/isomorphism.hpp:532:33: required from ‘bool boost::isomorphism(const Graph1&, const Graph2&, IsoMapping, Invariant1, Invariant2, std::size_t, IndexMap1, IndexMap2) [with Graph1 = adjacency_list >; Graph2 = adjacency_list >; IsoMapping = iterator_property_map<__gnu_cxx::__normal_iterator >, adj_list_vertex_property_map >, int, int&, vertex_index_t>, void*, void*&>; Invariant1 = degree_vertex_invariant >, int, const int&, vertex_index_t> >, adjacency_list > >; Invariant2 = degree_vertex_invariant >, int, const int&, vertex_index_t> >, adjacency_list > >; IndexMap1 = adj_list_vertex_property_map >, int, const int&, vertex_index_t>; IndexMap2 = adj_list_vertex_property_map >, int, const int&, vertex_index_t>; std::size_t = long unsigned int]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/isomorphism.hpp:651:42: required from ‘bool boost::graph::detail::isomorphism_impl::operator()(const Graph1&, const Graph2&, const ArgPack&) const [with ArgPack = boost::parameter::aux::arg_list >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&> >, boost::parameter::aux::empty_arg_list, std::integral_constant >; Graph1 = boost::adjacency_list >; Graph2 = boost::adjacency_list >]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/isomorphism.hpp:662:5: required from ‘typename boost::result_of(Param0, Param1, const ArgPack&)>::type boost::graph::isomorphism_with_named_params(const Param0&, const Param1&, const ArgPack&) [with Param0 = boost::adjacency_list >; Param1 = boost::adjacency_list >; ArgPack = boost::parameter::aux::arg_list >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&> >, boost::parameter::aux::empty_arg_list, std::integral_constant >; typename boost::result_of(Param0, Param1, const ArgPack&)>::type = bool]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/isomorphism.hpp:666:1: required from ‘typename boost::result_of(Param0, Param1, const typename boost::detail::convert_bgl_params_to_boost_parameter >::type&)>::type boost::isomorphism(const Param0&, const Param1&, const bgl_named_params&) [with Param0 = adjacency_list >; Param1 = adjacency_list >; P = iterator_property_map<__gnu_cxx::__normal_iterator >, adj_list_vertex_property_map >, int, int&, vertex_index_t>, void*, void*&>; T = vertex_isomorphism_t; R = no_property; typename result_of(Param0, Param1, const typename detail::convert_bgl_params_to_boost_parameter >::type&)>::type = bool; typename detail::convert_bgl_params_to_boost_parameter >::type = parameter::aux::arg_list >, adj_list_vertex_property_map >, int, int&, vertex_index_t>, void*, void*&> >, parameter::aux::empty_arg_list, std::integral_constant >]’ ordering.cpp:68:18: required from here /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ In file included from /home/omnipath/local/R/4.4-3.20/BH/include/boost/range/size_type.hpp:20, from /home/omnipath/local/R/4.4-3.20/BH/include/boost/range/size.hpp:21, from /home/omnipath/local/R/4.4-3.20/BH/include/boost/range/functions.hpp:20, from /home/omnipath/local/R/4.4-3.20/BH/include/boost/range/iterator_range_core.hpp:38, from /home/omnipath/local/R/4.4-3.20/BH/include/boost/range/iterator_range.hpp:13, from /home/omnipath/local/R/4.4-3.20/BH/include/boost/range/irange.hpp:16, from /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/detail/adjacency_list.hpp:21, from /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/adjacency_list.hpp:255: /home/omnipath/local/R/4.4-3.20/BH/include/boost/range/concepts.hpp:370:12: note: in a call to non-static member function ‘boost::RandomAccessRangeConcept >::~RandomAccessRangeConcept()’ 370 | struct RandomAccessRangeConcept : BidirectionalRangeConcept | ^~~~~~~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements > >]’: /home/omnipath/local/R/4.4-3.20/BH/include/boost/range/concepts.hpp:284:9: required from ‘struct boost::SinglePassRangeConcept >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::SinglePassRangeConcept >]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied > >::value’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied > >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:72:8: [ skipping 2 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/isomorphism.hpp:178:27: required from ‘bool boost::detail::isomorphism_algo::test_isomorphism() [with Graph1 = boost::adjacency_list >; Graph2 = boost::adjacency_list >; IsoMapping = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&>; Invariant1 = boost::degree_vertex_invariant >, int, const int&, boost::vertex_index_t> >, boost::adjacency_list > >; Invariant2 = boost::degree_vertex_invariant >, int, const int&, boost::vertex_index_t> >, boost::adjacency_list > >; IndexMap1 = boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>; IndexMap2 = boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/isomorphism.hpp:532:33: required from ‘bool boost::isomorphism(const Graph1&, const Graph2&, IsoMapping, Invariant1, Invariant2, std::size_t, IndexMap1, IndexMap2) [with Graph1 = adjacency_list >; Graph2 = adjacency_list >; IsoMapping = iterator_property_map<__gnu_cxx::__normal_iterator >, adj_list_vertex_property_map >, int, int&, vertex_index_t>, void*, void*&>; Invariant1 = degree_vertex_invariant >, int, const int&, vertex_index_t> >, adjacency_list > >; Invariant2 = degree_vertex_invariant >, int, const int&, vertex_index_t> >, adjacency_list > >; IndexMap1 = adj_list_vertex_property_map >, int, const int&, vertex_index_t>; IndexMap2 = adj_list_vertex_property_map >, int, const int&, vertex_index_t>; std::size_t = long unsigned int]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/isomorphism.hpp:651:42: required from ‘bool boost::graph::detail::isomorphism_impl::operator()(const Graph1&, const Graph2&, const ArgPack&) const [with ArgPack = boost::parameter::aux::arg_list >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&> >, boost::parameter::aux::empty_arg_list, std::integral_constant >; Graph1 = boost::adjacency_list >; Graph2 = boost::adjacency_list >]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/isomorphism.hpp:662:5: required from ‘typename boost::result_of(Param0, Param1, const ArgPack&)>::type boost::graph::isomorphism_with_named_params(const Param0&, const Param1&, const ArgPack&) [with Param0 = boost::adjacency_list >; Param1 = boost::adjacency_list >; ArgPack = boost::parameter::aux::arg_list >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&> >, boost::parameter::aux::empty_arg_list, std::integral_constant >; typename boost::result_of(Param0, Param1, const ArgPack&)>::type = bool]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/isomorphism.hpp:666:1: required from ‘typename boost::result_of(Param0, Param1, const typename boost::detail::convert_bgl_params_to_boost_parameter >::type&)>::type boost::isomorphism(const Param0&, const Param1&, const bgl_named_params&) [with Param0 = adjacency_list >; Param1 = adjacency_list >; P = iterator_property_map<__gnu_cxx::__normal_iterator >, adj_list_vertex_property_map >, int, int&, vertex_index_t>, void*, void*&>; T = vertex_isomorphism_t; R = no_property; typename result_of(Param0, Param1, const typename detail::convert_bgl_params_to_boost_parameter >::type&)>::type = bool; typename detail::convert_bgl_params_to_boost_parameter >::type = parameter::aux::arg_list >, adj_list_vertex_property_map >, int, int&, vertex_index_t>, void*, void*&> >, parameter::aux::empty_arg_list, std::integral_constant >]’ ordering.cpp:68:18: required from here /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::SinglePassRangeConcept >]’ 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ^ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::SinglePassRangeConcept >]’: /home/omnipath/local/R/4.4-3.20/BH/include/boost/range/algorithm/equal.hpp:174:13: required from ‘bool boost::range::equal(const SinglePassRange1&, const SinglePassRange2&) [with SinglePassRange1 = std::vector; SinglePassRange2 = std::vector]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/isomorphism.hpp:178:27: required from ‘bool boost::detail::isomorphism_algo::test_isomorphism() [with Graph1 = boost::adjacency_list >; Graph2 = boost::adjacency_list >; IsoMapping = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&>; Invariant1 = boost::degree_vertex_invariant >, int, const int&, boost::vertex_index_t> >, boost::adjacency_list > >; Invariant2 = boost::degree_vertex_invariant >, int, const int&, boost::vertex_index_t> >, boost::adjacency_list > >; IndexMap1 = boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>; IndexMap2 = boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/isomorphism.hpp:532:33: required from ‘bool boost::isomorphism(const Graph1&, const Graph2&, IsoMapping, Invariant1, Invariant2, std::size_t, IndexMap1, IndexMap2) [with Graph1 = adjacency_list >; Graph2 = adjacency_list >; IsoMapping = iterator_property_map<__gnu_cxx::__normal_iterator >, adj_list_vertex_property_map >, int, int&, vertex_index_t>, void*, void*&>; Invariant1 = degree_vertex_invariant >, int, const int&, vertex_index_t> >, adjacency_list > >; Invariant2 = degree_vertex_invariant >, int, const int&, vertex_index_t> >, adjacency_list > >; IndexMap1 = adj_list_vertex_property_map >, int, const int&, vertex_index_t>; IndexMap2 = adj_list_vertex_property_map >, int, const int&, vertex_index_t>; std::size_t = long unsigned int]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/isomorphism.hpp:651:42: required from ‘bool boost::graph::detail::isomorphism_impl::operator()(const Graph1&, const Graph2&, const ArgPack&) const [with ArgPack = boost::parameter::aux::arg_list >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&> >, boost::parameter::aux::empty_arg_list, std::integral_constant >; Graph1 = boost::adjacency_list >; Graph2 = boost::adjacency_list >]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/isomorphism.hpp:662:5: required from ‘typename boost::result_of(Param0, Param1, const ArgPack&)>::type boost::graph::isomorphism_with_named_params(const Param0&, const Param1&, const ArgPack&) [with Param0 = boost::adjacency_list >; Param1 = boost::adjacency_list >; ArgPack = boost::parameter::aux::arg_list >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&> >, boost::parameter::aux::empty_arg_list, std::integral_constant >; typename boost::result_of(Param0, Param1, const ArgPack&)>::type = bool]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/isomorphism.hpp:666:1: required from ‘typename boost::result_of(Param0, Param1, const typename boost::detail::convert_bgl_params_to_boost_parameter >::type&)>::type boost::isomorphism(const Param0&, const Param1&, const bgl_named_params&) [with Param0 = adjacency_list >; Param1 = adjacency_list >; P = iterator_property_map<__gnu_cxx::__normal_iterator >, adj_list_vertex_property_map >, int, int&, vertex_index_t>, void*, void*&>; T = vertex_isomorphism_t; R = no_property; typename result_of(Param0, Param1, const typename detail::convert_bgl_params_to_boost_parameter >::type&)>::type = bool; typename detail::convert_bgl_params_to_boost_parameter >::type = parameter::aux::arg_list >, adj_list_vertex_property_map >, int, int&, vertex_index_t>, void*, void*&> >, parameter::aux::empty_arg_list, std::integral_constant >]’ ordering.cpp:68:18: required from here /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::SinglePassRangeConcept::~SinglePassRangeConcept() [with T = const std::vector]’ 37 | ~model() | ^ /home/omnipath/local/R/4.4-3.20/BH/include/boost/range/concepts.hpp:284:9: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 284 | BOOST_CONCEPT_USAGE(SinglePassRangeConcept) | ^~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements > > >]’: /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:167:5: required from ‘struct boost::CopyConstructible<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/range/concepts.hpp:125:16: required from ‘struct boost::range_detail::IncrementableIteratorConcept<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/range/concepts.hpp:147:16: required from ‘struct boost::range_detail::SinglePassIteratorConcept<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::range_detail::SinglePassIteratorConcept<__gnu_cxx::__normal_iterator > >]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied > > >::value’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:45:51: [ skipping 11 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/isomorphism.hpp:189:21: required from ‘bool boost::detail::isomorphism_algo::test_isomorphism() [with Graph1 = boost::adjacency_list >; Graph2 = boost::adjacency_list >; IsoMapping = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&>; Invariant1 = boost::degree_vertex_invariant >, int, const int&, boost::vertex_index_t> >, boost::adjacency_list > >; Invariant2 = boost::degree_vertex_invariant >, int, const int&, boost::vertex_index_t> >, boost::adjacency_list > >; IndexMap1 = boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>; IndexMap2 = boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/isomorphism.hpp:532:33: required from ‘bool boost::isomorphism(const Graph1&, const Graph2&, IsoMapping, Invariant1, Invariant2, std::size_t, IndexMap1, IndexMap2) [with Graph1 = adjacency_list >; Graph2 = adjacency_list >; IsoMapping = iterator_property_map<__gnu_cxx::__normal_iterator >, adj_list_vertex_property_map >, int, int&, vertex_index_t>, void*, void*&>; Invariant1 = degree_vertex_invariant >, int, const int&, vertex_index_t> >, adjacency_list > >; Invariant2 = degree_vertex_invariant >, int, const int&, vertex_index_t> >, adjacency_list > >; IndexMap1 = adj_list_vertex_property_map >, int, const int&, vertex_index_t>; IndexMap2 = adj_list_vertex_property_map >, int, const int&, vertex_index_t>; std::size_t = long unsigned int]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/isomorphism.hpp:651:42: required from ‘bool boost::graph::detail::isomorphism_impl::operator()(const Graph1&, const Graph2&, const ArgPack&) const [with ArgPack = boost::parameter::aux::arg_list >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&> >, boost::parameter::aux::empty_arg_list, std::integral_constant >; Graph1 = boost::adjacency_list >; Graph2 = boost::adjacency_list >]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/isomorphism.hpp:662:5: required from ‘typename boost::result_of(Param0, Param1, const ArgPack&)>::type boost::graph::isomorphism_with_named_params(const Param0&, const Param1&, const ArgPack&) [with Param0 = boost::adjacency_list >; Param1 = boost::adjacency_list >; ArgPack = boost::parameter::aux::arg_list >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&> >, boost::parameter::aux::empty_arg_list, std::integral_constant >; typename boost::result_of(Param0, Param1, const ArgPack&)>::type = bool]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/isomorphism.hpp:666:1: required from ‘typename boost::result_of(Param0, Param1, const typename boost::detail::convert_bgl_params_to_boost_parameter >::type&)>::type boost::isomorphism(const Param0&, const Param1&, const bgl_named_params&) [with Param0 = adjacency_list >; Param1 = adjacency_list >; P = iterator_property_map<__gnu_cxx::__normal_iterator >, adj_list_vertex_property_map >, int, int&, vertex_index_t>, void*, void*&>; T = vertex_isomorphism_t; R = no_property; typename result_of(Param0, Param1, const typename detail::convert_bgl_params_to_boost_parameter >::type&)>::type = bool; typename detail::convert_bgl_params_to_boost_parameter >::type = parameter::aux::arg_list >, adj_list_vertex_property_map >, int, int&, vertex_index_t>, void*, void*&> >, parameter::aux::empty_arg_list, std::integral_constant >]’ ordering.cpp:68:18: required from here /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::CopyConstructible<__gnu_cxx::__normal_iterator > >]’ 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ^ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements > > >]’: /home/omnipath/local/R/4.4-3.20/BH/include/boost/range/concepts.hpp:136:13: required from ‘struct boost::range_detail::IncrementableIteratorConcept<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/range/concepts.hpp:147:16: required from ‘struct boost::range_detail::SinglePassIteratorConcept<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::range_detail::SinglePassIteratorConcept<__gnu_cxx::__normal_iterator > >]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied > > >::value’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied > > >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:72:8: [ skipping 10 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/isomorphism.hpp:189:21: required from ‘bool boost::detail::isomorphism_algo::test_isomorphism() [with Graph1 = boost::adjacency_list >; Graph2 = boost::adjacency_list >; IsoMapping = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&>; Invariant1 = boost::degree_vertex_invariant >, int, const int&, boost::vertex_index_t> >, boost::adjacency_list > >; Invariant2 = boost::degree_vertex_invariant >, int, const int&, boost::vertex_index_t> >, boost::adjacency_list > >; IndexMap1 = boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>; IndexMap2 = boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/isomorphism.hpp:532:33: required from ‘bool boost::isomorphism(const Graph1&, const Graph2&, IsoMapping, Invariant1, Invariant2, std::size_t, IndexMap1, IndexMap2) [with Graph1 = adjacency_list >; Graph2 = adjacency_list >; IsoMapping = iterator_property_map<__gnu_cxx::__normal_iterator >, adj_list_vertex_property_map >, int, int&, vertex_index_t>, void*, void*&>; Invariant1 = degree_vertex_invariant >, int, const int&, vertex_index_t> >, adjacency_list > >; Invariant2 = degree_vertex_invariant >, int, const int&, vertex_index_t> >, adjacency_list > >; IndexMap1 = adj_list_vertex_property_map >, int, const int&, vertex_index_t>; IndexMap2 = adj_list_vertex_property_map >, int, const int&, vertex_index_t>; std::size_t = long unsigned int]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/isomorphism.hpp:651:42: required from ‘bool boost::graph::detail::isomorphism_impl::operator()(const Graph1&, const Graph2&, const ArgPack&) const [with ArgPack = boost::parameter::aux::arg_list >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&> >, boost::parameter::aux::empty_arg_list, std::integral_constant >; Graph1 = boost::adjacency_list >; Graph2 = boost::adjacency_list >]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/isomorphism.hpp:662:5: required from ‘typename boost::result_of(Param0, Param1, const ArgPack&)>::type boost::graph::isomorphism_with_named_params(const Param0&, const Param1&, const ArgPack&) [with Param0 = boost::adjacency_list >; Param1 = boost::adjacency_list >; ArgPack = boost::parameter::aux::arg_list >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&> >, boost::parameter::aux::empty_arg_list, std::integral_constant >; typename boost::result_of(Param0, Param1, const ArgPack&)>::type = bool]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/isomorphism.hpp:666:1: required from ‘typename boost::result_of(Param0, Param1, const typename boost::detail::convert_bgl_params_to_boost_parameter >::type&)>::type boost::isomorphism(const Param0&, const Param1&, const bgl_named_params&) [with Param0 = adjacency_list >; Param1 = adjacency_list >; P = iterator_property_map<__gnu_cxx::__normal_iterator >, adj_list_vertex_property_map >, int, int&, vertex_index_t>, void*, void*&>; T = vertex_isomorphism_t; R = no_property; typename result_of(Param0, Param1, const typename detail::convert_bgl_params_to_boost_parameter >::type&)>::type = bool; typename detail::convert_bgl_params_to_boost_parameter >::type = parameter::aux::arg_list >, adj_list_vertex_property_map >, int, int&, vertex_index_t>, void*, void*&> >, parameter::aux::empty_arg_list, std::integral_constant >]’ ordering.cpp:68:18: required from here /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::range_detail::IncrementableIteratorConcept<__gnu_cxx::__normal_iterator > >]’ 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ^ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements > > >]’: /home/omnipath/local/R/4.4-3.20/BH/include/boost/range/concepts.hpp:158:13: required from ‘struct boost::range_detail::SinglePassIteratorConcept<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::range_detail::SinglePassIteratorConcept<__gnu_cxx::__normal_iterator > >]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied > > >::value’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied > > >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_ > >)>’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/range/concepts.hpp:278:9: [ skipping 9 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/isomorphism.hpp:189:21: required from ‘bool boost::detail::isomorphism_algo::test_isomorphism() [with Graph1 = boost::adjacency_list >; Graph2 = boost::adjacency_list >; IsoMapping = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&>; Invariant1 = boost::degree_vertex_invariant >, int, const int&, boost::vertex_index_t> >, boost::adjacency_list > >; Invariant2 = boost::degree_vertex_invariant >, int, const int&, boost::vertex_index_t> >, boost::adjacency_list > >; IndexMap1 = boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>; IndexMap2 = boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/isomorphism.hpp:532:33: required from ‘bool boost::isomorphism(const Graph1&, const Graph2&, IsoMapping, Invariant1, Invariant2, std::size_t, IndexMap1, IndexMap2) [with Graph1 = adjacency_list >; Graph2 = adjacency_list >; IsoMapping = iterator_property_map<__gnu_cxx::__normal_iterator >, adj_list_vertex_property_map >, int, int&, vertex_index_t>, void*, void*&>; Invariant1 = degree_vertex_invariant >, int, const int&, vertex_index_t> >, adjacency_list > >; Invariant2 = degree_vertex_invariant >, int, const int&, vertex_index_t> >, adjacency_list > >; IndexMap1 = adj_list_vertex_property_map >, int, const int&, vertex_index_t>; IndexMap2 = adj_list_vertex_property_map >, int, const int&, vertex_index_t>; std::size_t = long unsigned int]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/isomorphism.hpp:651:42: required from ‘bool boost::graph::detail::isomorphism_impl::operator()(const Graph1&, const Graph2&, const ArgPack&) const [with ArgPack = boost::parameter::aux::arg_list >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&> >, boost::parameter::aux::empty_arg_list, std::integral_constant >; Graph1 = boost::adjacency_list >; Graph2 = boost::adjacency_list >]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/isomorphism.hpp:662:5: required from ‘typename boost::result_of(Param0, Param1, const ArgPack&)>::type boost::graph::isomorphism_with_named_params(const Param0&, const Param1&, const ArgPack&) [with Param0 = boost::adjacency_list >; Param1 = boost::adjacency_list >; ArgPack = boost::parameter::aux::arg_list >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&> >, boost::parameter::aux::empty_arg_list, std::integral_constant >; typename boost::result_of(Param0, Param1, const ArgPack&)>::type = bool]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/isomorphism.hpp:666:1: required from ‘typename boost::result_of(Param0, Param1, const typename boost::detail::convert_bgl_params_to_boost_parameter >::type&)>::type boost::isomorphism(const Param0&, const Param1&, const bgl_named_params&) [with Param0 = adjacency_list >; Param1 = adjacency_list >; P = iterator_property_map<__gnu_cxx::__normal_iterator >, adj_list_vertex_property_map >, int, int&, vertex_index_t>, void*, void*&>; T = vertex_isomorphism_t; R = no_property; typename result_of(Param0, Param1, const typename detail::convert_bgl_params_to_boost_parameter >::type&)>::type = bool; typename detail::convert_bgl_params_to_boost_parameter >::type = parameter::aux::arg_list >, adj_list_vertex_property_map >, int, int&, vertex_index_t>, void*, void*&> >, parameter::aux::empty_arg_list, std::integral_constant >]’ ordering.cpp:68:18: required from here /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::range_detail::SinglePassIteratorConcept<__gnu_cxx::__normal_iterator > >]’ 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ^ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::range_detail::SinglePassIteratorConcept<__gnu_cxx::__normal_iterator > >]’: /home/omnipath/local/R/4.4-3.20/BH/include/boost/range/concepts.hpp:278:9: required from ‘struct boost::SinglePassRangeConcept >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/range/concepts.hpp:318:12: required from ‘struct boost::ForwardRangeConcept >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/range/concepts.hpp:352:12: required from ‘struct boost::BidirectionalRangeConcept >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/range/concepts.hpp:370:12: required from ‘struct boost::RandomAccessRangeConcept >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::RandomAccessRangeConcept >]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:42:5: [ skipping 4 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/isomorphism.hpp:189:21: required from ‘bool boost::detail::isomorphism_algo::test_isomorphism() [with Graph1 = boost::adjacency_list >; Graph2 = boost::adjacency_list >; IsoMapping = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&>; Invariant1 = boost::degree_vertex_invariant >, int, const int&, boost::vertex_index_t> >, boost::adjacency_list > >; Invariant2 = boost::degree_vertex_invariant >, int, const int&, boost::vertex_index_t> >, boost::adjacency_list > >; IndexMap1 = boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>; IndexMap2 = boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/isomorphism.hpp:532:33: required from ‘bool boost::isomorphism(const Graph1&, const Graph2&, IsoMapping, Invariant1, Invariant2, std::size_t, IndexMap1, IndexMap2) [with Graph1 = adjacency_list >; Graph2 = adjacency_list >; IsoMapping = iterator_property_map<__gnu_cxx::__normal_iterator >, adj_list_vertex_property_map >, int, int&, vertex_index_t>, void*, void*&>; Invariant1 = degree_vertex_invariant >, int, const int&, vertex_index_t> >, adjacency_list > >; Invariant2 = degree_vertex_invariant >, int, const int&, vertex_index_t> >, adjacency_list > >; IndexMap1 = adj_list_vertex_property_map >, int, const int&, vertex_index_t>; IndexMap2 = adj_list_vertex_property_map >, int, const int&, vertex_index_t>; std::size_t = long unsigned int]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/isomorphism.hpp:651:42: required from ‘bool boost::graph::detail::isomorphism_impl::operator()(const Graph1&, const Graph2&, const ArgPack&) const [with ArgPack = boost::parameter::aux::arg_list >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&> >, boost::parameter::aux::empty_arg_list, std::integral_constant >; Graph1 = boost::adjacency_list >; Graph2 = boost::adjacency_list >]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/isomorphism.hpp:662:5: required from ‘typename boost::result_of(Param0, Param1, const ArgPack&)>::type boost::graph::isomorphism_with_named_params(const Param0&, const Param1&, const ArgPack&) [with Param0 = boost::adjacency_list >; Param1 = boost::adjacency_list >; ArgPack = boost::parameter::aux::arg_list >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&> >, boost::parameter::aux::empty_arg_list, std::integral_constant >; typename boost::result_of(Param0, Param1, const ArgPack&)>::type = bool]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/isomorphism.hpp:666:1: required from ‘typename boost::result_of(Param0, Param1, const typename boost::detail::convert_bgl_params_to_boost_parameter >::type&)>::type boost::isomorphism(const Param0&, const Param1&, const bgl_named_params&) [with Param0 = adjacency_list >; Param1 = adjacency_list >; P = iterator_property_map<__gnu_cxx::__normal_iterator >, adj_list_vertex_property_map >, int, int&, vertex_index_t>, void*, void*&>; T = vertex_isomorphism_t; R = no_property; typename result_of(Param0, Param1, const typename detail::convert_bgl_params_to_boost_parameter >::type&)>::type = bool; typename detail::convert_bgl_params_to_boost_parameter >::type = parameter::aux::arg_list >, adj_list_vertex_property_map >, int, int&, vertex_index_t>, void*, void*&> >, parameter::aux::empty_arg_list, std::integral_constant >]’ ordering.cpp:68:18: required from here /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::range_detail::SinglePassIteratorConcept::~SinglePassIteratorConcept() [with Iterator = __gnu_cxx::__normal_iterator >]’ 37 | ~model() | ^ /home/omnipath/local/R/4.4-3.20/BH/include/boost/range/concepts.hpp:158:13: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 158 | BOOST_CONCEPT_USAGE(SinglePassIteratorConcept) | ^~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements > > >]’: /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:167:5: required from ‘struct boost::CopyConstructible<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/range/concepts.hpp:125:16: required from ‘struct boost::range_detail::IncrementableIteratorConcept<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/range/concepts.hpp:147:16: required from ‘struct boost::range_detail::SinglePassIteratorConcept<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::range_detail::SinglePassIteratorConcept<__gnu_cxx::__normal_iterator > >]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied > > >::value’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:45:51: [ skipping 11 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/isomorphism.hpp:189:21: required from ‘bool boost::detail::isomorphism_algo::test_isomorphism() [with Graph1 = boost::adjacency_list >; Graph2 = boost::adjacency_list >; IsoMapping = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&>; Invariant1 = boost::degree_vertex_invariant >, int, const int&, boost::vertex_index_t> >, boost::adjacency_list > >; Invariant2 = boost::degree_vertex_invariant >, int, const int&, boost::vertex_index_t> >, boost::adjacency_list > >; IndexMap1 = boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>; IndexMap2 = boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/isomorphism.hpp:532:33: required from ‘bool boost::isomorphism(const Graph1&, const Graph2&, IsoMapping, Invariant1, Invariant2, std::size_t, IndexMap1, IndexMap2) [with Graph1 = adjacency_list >; Graph2 = adjacency_list >; IsoMapping = iterator_property_map<__gnu_cxx::__normal_iterator >, adj_list_vertex_property_map >, int, int&, vertex_index_t>, void*, void*&>; Invariant1 = degree_vertex_invariant >, int, const int&, vertex_index_t> >, adjacency_list > >; Invariant2 = degree_vertex_invariant >, int, const int&, vertex_index_t> >, adjacency_list > >; IndexMap1 = adj_list_vertex_property_map >, int, const int&, vertex_index_t>; IndexMap2 = adj_list_vertex_property_map >, int, const int&, vertex_index_t>; std::size_t = long unsigned int]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/isomorphism.hpp:651:42: required from ‘bool boost::graph::detail::isomorphism_impl::operator()(const Graph1&, const Graph2&, const ArgPack&) const [with ArgPack = boost::parameter::aux::arg_list >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&> >, boost::parameter::aux::empty_arg_list, std::integral_constant >; Graph1 = boost::adjacency_list >; Graph2 = boost::adjacency_list >]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/isomorphism.hpp:662:5: required from ‘typename boost::result_of(Param0, Param1, const ArgPack&)>::type boost::graph::isomorphism_with_named_params(const Param0&, const Param1&, const ArgPack&) [with Param0 = boost::adjacency_list >; Param1 = boost::adjacency_list >; ArgPack = boost::parameter::aux::arg_list >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&> >, boost::parameter::aux::empty_arg_list, std::integral_constant >; typename boost::result_of(Param0, Param1, const ArgPack&)>::type = bool]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/isomorphism.hpp:666:1: required from ‘typename boost::result_of(Param0, Param1, const typename boost::detail::convert_bgl_params_to_boost_parameter >::type&)>::type boost::isomorphism(const Param0&, const Param1&, const bgl_named_params&) [with Param0 = adjacency_list >; Param1 = adjacency_list >; P = iterator_property_map<__gnu_cxx::__normal_iterator >, adj_list_vertex_property_map >, int, int&, vertex_index_t>, void*, void*&>; T = vertex_isomorphism_t; R = no_property; typename result_of(Param0, Param1, const typename detail::convert_bgl_params_to_boost_parameter >::type&)>::type = bool; typename detail::convert_bgl_params_to_boost_parameter >::type = parameter::aux::arg_list >, adj_list_vertex_property_map >, int, int&, vertex_index_t>, void*, void*&> >, parameter::aux::empty_arg_list, std::integral_constant >]’ ordering.cpp:68:18: required from here /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::CopyConstructible<__gnu_cxx::__normal_iterator > >]’ 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ^ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements > > >]’: /home/omnipath/local/R/4.4-3.20/BH/include/boost/range/concepts.hpp:136:13: required from ‘struct boost::range_detail::IncrementableIteratorConcept<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/range/concepts.hpp:147:16: required from ‘struct boost::range_detail::SinglePassIteratorConcept<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::range_detail::SinglePassIteratorConcept<__gnu_cxx::__normal_iterator > >]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied > > >::value’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied > > >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:72:8: [ skipping 10 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/isomorphism.hpp:189:21: required from ‘bool boost::detail::isomorphism_algo::test_isomorphism() [with Graph1 = boost::adjacency_list >; Graph2 = boost::adjacency_list >; IsoMapping = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&>; Invariant1 = boost::degree_vertex_invariant >, int, const int&, boost::vertex_index_t> >, boost::adjacency_list > >; Invariant2 = boost::degree_vertex_invariant >, int, const int&, boost::vertex_index_t> >, boost::adjacency_list > >; IndexMap1 = boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>; IndexMap2 = boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/isomorphism.hpp:532:33: required from ‘bool boost::isomorphism(const Graph1&, const Graph2&, IsoMapping, Invariant1, Invariant2, std::size_t, IndexMap1, IndexMap2) [with Graph1 = adjacency_list >; Graph2 = adjacency_list >; IsoMapping = iterator_property_map<__gnu_cxx::__normal_iterator >, adj_list_vertex_property_map >, int, int&, vertex_index_t>, void*, void*&>; Invariant1 = degree_vertex_invariant >, int, const int&, vertex_index_t> >, adjacency_list > >; Invariant2 = degree_vertex_invariant >, int, const int&, vertex_index_t> >, adjacency_list > >; IndexMap1 = adj_list_vertex_property_map >, int, const int&, vertex_index_t>; IndexMap2 = adj_list_vertex_property_map >, int, const int&, vertex_index_t>; std::size_t = long unsigned int]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/isomorphism.hpp:651:42: required from ‘bool boost::graph::detail::isomorphism_impl::operator()(const Graph1&, const Graph2&, const ArgPack&) const [with ArgPack = boost::parameter::aux::arg_list >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&> >, boost::parameter::aux::empty_arg_list, std::integral_constant >; Graph1 = boost::adjacency_list >; Graph2 = boost::adjacency_list >]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/isomorphism.hpp:662:5: required from ‘typename boost::result_of(Param0, Param1, const ArgPack&)>::type boost::graph::isomorphism_with_named_params(const Param0&, const Param1&, const ArgPack&) [with Param0 = boost::adjacency_list >; Param1 = boost::adjacency_list >; ArgPack = boost::parameter::aux::arg_list >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&> >, boost::parameter::aux::empty_arg_list, std::integral_constant >; typename boost::result_of(Param0, Param1, const ArgPack&)>::type = bool]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/isomorphism.hpp:666:1: required from ‘typename boost::result_of(Param0, Param1, const typename boost::detail::convert_bgl_params_to_boost_parameter >::type&)>::type boost::isomorphism(const Param0&, const Param1&, const bgl_named_params&) [with Param0 = adjacency_list >; Param1 = adjacency_list >; P = iterator_property_map<__gnu_cxx::__normal_iterator >, adj_list_vertex_property_map >, int, int&, vertex_index_t>, void*, void*&>; T = vertex_isomorphism_t; R = no_property; typename result_of(Param0, Param1, const typename detail::convert_bgl_params_to_boost_parameter >::type&)>::type = bool; typename detail::convert_bgl_params_to_boost_parameter >::type = parameter::aux::arg_list >, adj_list_vertex_property_map >, int, int&, vertex_index_t>, void*, void*&> >, parameter::aux::empty_arg_list, std::integral_constant >]’ ordering.cpp:68:18: required from here /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::range_detail::IncrementableIteratorConcept<__gnu_cxx::__normal_iterator > >]’ 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ^ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements > > >]’: /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:233:5: required from ‘struct boost::EqualityComparable<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/range/concepts.hpp:147:16: required from ‘struct boost::range_detail::SinglePassIteratorConcept<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::range_detail::SinglePassIteratorConcept<__gnu_cxx::__normal_iterator > >]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied > > >::value’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied > > >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:72:8: [ skipping 10 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/isomorphism.hpp:189:21: required from ‘bool boost::detail::isomorphism_algo::test_isomorphism() [with Graph1 = boost::adjacency_list >; Graph2 = boost::adjacency_list >; IsoMapping = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&>; Invariant1 = boost::degree_vertex_invariant >, int, const int&, boost::vertex_index_t> >, boost::adjacency_list > >; Invariant2 = boost::degree_vertex_invariant >, int, const int&, boost::vertex_index_t> >, boost::adjacency_list > >; IndexMap1 = boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>; IndexMap2 = boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/isomorphism.hpp:532:33: required from ‘bool boost::isomorphism(const Graph1&, const Graph2&, IsoMapping, Invariant1, Invariant2, std::size_t, IndexMap1, IndexMap2) [with Graph1 = adjacency_list >; Graph2 = adjacency_list >; IsoMapping = iterator_property_map<__gnu_cxx::__normal_iterator >, adj_list_vertex_property_map >, int, int&, vertex_index_t>, void*, void*&>; Invariant1 = degree_vertex_invariant >, int, const int&, vertex_index_t> >, adjacency_list > >; Invariant2 = degree_vertex_invariant >, int, const int&, vertex_index_t> >, adjacency_list > >; IndexMap1 = adj_list_vertex_property_map >, int, const int&, vertex_index_t>; IndexMap2 = adj_list_vertex_property_map >, int, const int&, vertex_index_t>; std::size_t = long unsigned int]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/isomorphism.hpp:651:42: required from ‘bool boost::graph::detail::isomorphism_impl::operator()(const Graph1&, const Graph2&, const ArgPack&) const [with ArgPack = boost::parameter::aux::arg_list >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&> >, boost::parameter::aux::empty_arg_list, std::integral_constant >; Graph1 = boost::adjacency_list >; Graph2 = boost::adjacency_list >]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/isomorphism.hpp:662:5: required from ‘typename boost::result_of(Param0, Param1, const ArgPack&)>::type boost::graph::isomorphism_with_named_params(const Param0&, const Param1&, const ArgPack&) [with Param0 = boost::adjacency_list >; Param1 = boost::adjacency_list >; ArgPack = boost::parameter::aux::arg_list >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&> >, boost::parameter::aux::empty_arg_list, std::integral_constant >; typename boost::result_of(Param0, Param1, const ArgPack&)>::type = bool]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/isomorphism.hpp:666:1: required from ‘typename boost::result_of(Param0, Param1, const typename boost::detail::convert_bgl_params_to_boost_parameter >::type&)>::type boost::isomorphism(const Param0&, const Param1&, const bgl_named_params&) [with Param0 = adjacency_list >; Param1 = adjacency_list >; P = iterator_property_map<__gnu_cxx::__normal_iterator >, adj_list_vertex_property_map >, int, int&, vertex_index_t>, void*, void*&>; T = vertex_isomorphism_t; R = no_property; typename result_of(Param0, Param1, const typename detail::convert_bgl_params_to_boost_parameter >::type&)>::type = bool; typename detail::convert_bgl_params_to_boost_parameter >::type = parameter::aux::arg_list >, adj_list_vertex_property_map >, int, int&, vertex_index_t>, void*, void*&> >, parameter::aux::empty_arg_list, std::integral_constant >]’ ordering.cpp:68:18: required from here /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::EqualityComparable<__gnu_cxx::__normal_iterator > >]’ 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ^ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements > > >]’: /home/omnipath/local/R/4.4-3.20/BH/include/boost/range/concepts.hpp:158:13: required from ‘struct boost::range_detail::SinglePassIteratorConcept<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::range_detail::SinglePassIteratorConcept<__gnu_cxx::__normal_iterator > >]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied > > >::value’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied > > >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_ > >)>’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/range/concepts.hpp:281:9: [ skipping 9 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/isomorphism.hpp:189:21: required from ‘bool boost::detail::isomorphism_algo::test_isomorphism() [with Graph1 = boost::adjacency_list >; Graph2 = boost::adjacency_list >; IsoMapping = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&>; Invariant1 = boost::degree_vertex_invariant >, int, const int&, boost::vertex_index_t> >, boost::adjacency_list > >; Invariant2 = boost::degree_vertex_invariant >, int, const int&, boost::vertex_index_t> >, boost::adjacency_list > >; IndexMap1 = boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>; IndexMap2 = boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/isomorphism.hpp:532:33: required from ‘bool boost::isomorphism(const Graph1&, const Graph2&, IsoMapping, Invariant1, Invariant2, std::size_t, IndexMap1, IndexMap2) [with Graph1 = adjacency_list >; Graph2 = adjacency_list >; IsoMapping = iterator_property_map<__gnu_cxx::__normal_iterator >, adj_list_vertex_property_map >, int, int&, vertex_index_t>, void*, void*&>; Invariant1 = degree_vertex_invariant >, int, const int&, vertex_index_t> >, adjacency_list > >; Invariant2 = degree_vertex_invariant >, int, const int&, vertex_index_t> >, adjacency_list > >; IndexMap1 = adj_list_vertex_property_map >, int, const int&, vertex_index_t>; IndexMap2 = adj_list_vertex_property_map >, int, const int&, vertex_index_t>; std::size_t = long unsigned int]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/isomorphism.hpp:651:42: required from ‘bool boost::graph::detail::isomorphism_impl::operator()(const Graph1&, const Graph2&, const ArgPack&) const [with ArgPack = boost::parameter::aux::arg_list >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&> >, boost::parameter::aux::empty_arg_list, std::integral_constant >; Graph1 = boost::adjacency_list >; Graph2 = boost::adjacency_list >]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/isomorphism.hpp:662:5: required from ‘typename boost::result_of(Param0, Param1, const ArgPack&)>::type boost::graph::isomorphism_with_named_params(const Param0&, const Param1&, const ArgPack&) [with Param0 = boost::adjacency_list >; Param1 = boost::adjacency_list >; ArgPack = boost::parameter::aux::arg_list >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&> >, boost::parameter::aux::empty_arg_list, std::integral_constant >; typename boost::result_of(Param0, Param1, const ArgPack&)>::type = bool]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/isomorphism.hpp:666:1: required from ‘typename boost::result_of(Param0, Param1, const typename boost::detail::convert_bgl_params_to_boost_parameter >::type&)>::type boost::isomorphism(const Param0&, const Param1&, const bgl_named_params&) [with Param0 = adjacency_list >; Param1 = adjacency_list >; P = iterator_property_map<__gnu_cxx::__normal_iterator >, adj_list_vertex_property_map >, int, int&, vertex_index_t>, void*, void*&>; T = vertex_isomorphism_t; R = no_property; typename result_of(Param0, Param1, const typename detail::convert_bgl_params_to_boost_parameter >::type&)>::type = bool; typename detail::convert_bgl_params_to_boost_parameter >::type = parameter::aux::arg_list >, adj_list_vertex_property_map >, int, int&, vertex_index_t>, void*, void*&> >, parameter::aux::empty_arg_list, std::integral_constant >]’ ordering.cpp:68:18: required from here /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::range_detail::SinglePassIteratorConcept<__gnu_cxx::__normal_iterator > >]’ 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ^ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::range_detail::SinglePassIteratorConcept<__gnu_cxx::__normal_iterator > >]’: /home/omnipath/local/R/4.4-3.20/BH/include/boost/range/concepts.hpp:281:9: required from ‘struct boost::SinglePassRangeConcept >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/range/concepts.hpp:318:12: required from ‘struct boost::ForwardRangeConcept >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/range/concepts.hpp:352:12: required from ‘struct boost::BidirectionalRangeConcept >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/range/concepts.hpp:370:12: required from ‘struct boost::RandomAccessRangeConcept >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::RandomAccessRangeConcept >]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:42:5: [ skipping 4 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/isomorphism.hpp:189:21: required from ‘bool boost::detail::isomorphism_algo::test_isomorphism() [with Graph1 = boost::adjacency_list >; Graph2 = boost::adjacency_list >; IsoMapping = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&>; Invariant1 = boost::degree_vertex_invariant >, int, const int&, boost::vertex_index_t> >, boost::adjacency_list > >; Invariant2 = boost::degree_vertex_invariant >, int, const int&, boost::vertex_index_t> >, boost::adjacency_list > >; IndexMap1 = boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>; IndexMap2 = boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/isomorphism.hpp:532:33: required from ‘bool boost::isomorphism(const Graph1&, const Graph2&, IsoMapping, Invariant1, Invariant2, std::size_t, IndexMap1, IndexMap2) [with Graph1 = adjacency_list >; Graph2 = adjacency_list >; IsoMapping = iterator_property_map<__gnu_cxx::__normal_iterator >, adj_list_vertex_property_map >, int, int&, vertex_index_t>, void*, void*&>; Invariant1 = degree_vertex_invariant >, int, const int&, vertex_index_t> >, adjacency_list > >; Invariant2 = degree_vertex_invariant >, int, const int&, vertex_index_t> >, adjacency_list > >; IndexMap1 = adj_list_vertex_property_map >, int, const int&, vertex_index_t>; IndexMap2 = adj_list_vertex_property_map >, int, const int&, vertex_index_t>; std::size_t = long unsigned int]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/isomorphism.hpp:651:42: required from ‘bool boost::graph::detail::isomorphism_impl::operator()(const Graph1&, const Graph2&, const ArgPack&) const [with ArgPack = boost::parameter::aux::arg_list >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&> >, boost::parameter::aux::empty_arg_list, std::integral_constant >; Graph1 = boost::adjacency_list >; Graph2 = boost::adjacency_list >]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/isomorphism.hpp:662:5: required from ‘typename boost::result_of(Param0, Param1, const ArgPack&)>::type boost::graph::isomorphism_with_named_params(const Param0&, const Param1&, const ArgPack&) [with Param0 = boost::adjacency_list >; Param1 = boost::adjacency_list >; ArgPack = boost::parameter::aux::arg_list >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&> >, boost::parameter::aux::empty_arg_list, std::integral_constant >; typename boost::result_of(Param0, Param1, const ArgPack&)>::type = bool]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/isomorphism.hpp:666:1: required from ‘typename boost::result_of(Param0, Param1, const typename boost::detail::convert_bgl_params_to_boost_parameter >::type&)>::type boost::isomorphism(const Param0&, const Param1&, const bgl_named_params&) [with Param0 = adjacency_list >; Param1 = adjacency_list >; P = iterator_property_map<__gnu_cxx::__normal_iterator >, adj_list_vertex_property_map >, int, int&, vertex_index_t>, void*, void*&>; T = vertex_isomorphism_t; R = no_property; typename result_of(Param0, Param1, const typename detail::convert_bgl_params_to_boost_parameter >::type&)>::type = bool; typename detail::convert_bgl_params_to_boost_parameter >::type = parameter::aux::arg_list >, adj_list_vertex_property_map >, int, int&, vertex_index_t>, void*, void*&> >, parameter::aux::empty_arg_list, std::integral_constant >]’ ordering.cpp:68:18: required from here /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::range_detail::SinglePassIteratorConcept::~SinglePassIteratorConcept() [with Iterator = __gnu_cxx::__normal_iterator >]’ 37 | ~model() | ^ /home/omnipath/local/R/4.4-3.20/BH/include/boost/range/concepts.hpp:158:13: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 158 | BOOST_CONCEPT_USAGE(SinglePassIteratorConcept) | ^~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements > >]’: /home/omnipath/local/R/4.4-3.20/BH/include/boost/range/concepts.hpp:284:9: required from ‘struct boost::SinglePassRangeConcept >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/range/concepts.hpp:318:12: required from ‘struct boost::ForwardRangeConcept >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/range/concepts.hpp:352:12: required from ‘struct boost::BidirectionalRangeConcept >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/range/concepts.hpp:370:12: required from ‘struct boost::RandomAccessRangeConcept >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::RandomAccessRangeConcept >]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:42:5: [ skipping 4 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/isomorphism.hpp:189:21: required from ‘bool boost::detail::isomorphism_algo::test_isomorphism() [with Graph1 = boost::adjacency_list >; Graph2 = boost::adjacency_list >; IsoMapping = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&>; Invariant1 = boost::degree_vertex_invariant >, int, const int&, boost::vertex_index_t> >, boost::adjacency_list > >; Invariant2 = boost::degree_vertex_invariant >, int, const int&, boost::vertex_index_t> >, boost::adjacency_list > >; IndexMap1 = boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>; IndexMap2 = boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/isomorphism.hpp:532:33: required from ‘bool boost::isomorphism(const Graph1&, const Graph2&, IsoMapping, Invariant1, Invariant2, std::size_t, IndexMap1, IndexMap2) [with Graph1 = adjacency_list >; Graph2 = adjacency_list >; IsoMapping = iterator_property_map<__gnu_cxx::__normal_iterator >, adj_list_vertex_property_map >, int, int&, vertex_index_t>, void*, void*&>; Invariant1 = degree_vertex_invariant >, int, const int&, vertex_index_t> >, adjacency_list > >; Invariant2 = degree_vertex_invariant >, int, const int&, vertex_index_t> >, adjacency_list > >; IndexMap1 = adj_list_vertex_property_map >, int, const int&, vertex_index_t>; IndexMap2 = adj_list_vertex_property_map >, int, const int&, vertex_index_t>; std::size_t = long unsigned int]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/isomorphism.hpp:651:42: required from ‘bool boost::graph::detail::isomorphism_impl::operator()(const Graph1&, const Graph2&, const ArgPack&) const [with ArgPack = boost::parameter::aux::arg_list >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&> >, boost::parameter::aux::empty_arg_list, std::integral_constant >; Graph1 = boost::adjacency_list >; Graph2 = boost::adjacency_list >]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/isomorphism.hpp:662:5: required from ‘typename boost::result_of(Param0, Param1, const ArgPack&)>::type boost::graph::isomorphism_with_named_params(const Param0&, const Param1&, const ArgPack&) [with Param0 = boost::adjacency_list >; Param1 = boost::adjacency_list >; ArgPack = boost::parameter::aux::arg_list >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&> >, boost::parameter::aux::empty_arg_list, std::integral_constant >; typename boost::result_of(Param0, Param1, const ArgPack&)>::type = bool]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/isomorphism.hpp:666:1: required from ‘typename boost::result_of(Param0, Param1, const typename boost::detail::convert_bgl_params_to_boost_parameter >::type&)>::type boost::isomorphism(const Param0&, const Param1&, const bgl_named_params&) [with Param0 = adjacency_list >; Param1 = adjacency_list >; P = iterator_property_map<__gnu_cxx::__normal_iterator >, adj_list_vertex_property_map >, int, int&, vertex_index_t>, void*, void*&>; T = vertex_isomorphism_t; R = no_property; typename result_of(Param0, Param1, const typename detail::convert_bgl_params_to_boost_parameter >::type&)>::type = bool; typename detail::convert_bgl_params_to_boost_parameter >::type = parameter::aux::arg_list >, adj_list_vertex_property_map >, int, int&, vertex_index_t>, void*, void*&> >, parameter::aux::empty_arg_list, std::integral_constant >]’ ordering.cpp:68:18: required from here /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::SinglePassRangeConcept >]’ 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ^ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements > > >]’: /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:137:5: required from ‘struct boost::DefaultConstructible<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/range/concepts.hpp:181:16: required from ‘struct boost::range_detail::ForwardIteratorConcept<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::range_detail::ForwardIteratorConcept<__gnu_cxx::__normal_iterator > >]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied > > >::value’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied > > >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:72:8: [ skipping 9 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/isomorphism.hpp:189:21: required from ‘bool boost::detail::isomorphism_algo::test_isomorphism() [with Graph1 = boost::adjacency_list >; Graph2 = boost::adjacency_list >; IsoMapping = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&>; Invariant1 = boost::degree_vertex_invariant >, int, const int&, boost::vertex_index_t> >, boost::adjacency_list > >; Invariant2 = boost::degree_vertex_invariant >, int, const int&, boost::vertex_index_t> >, boost::adjacency_list > >; IndexMap1 = boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>; IndexMap2 = boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/isomorphism.hpp:532:33: required from ‘bool boost::isomorphism(const Graph1&, const Graph2&, IsoMapping, Invariant1, Invariant2, std::size_t, IndexMap1, IndexMap2) [with Graph1 = adjacency_list >; Graph2 = adjacency_list >; IsoMapping = iterator_property_map<__gnu_cxx::__normal_iterator >, adj_list_vertex_property_map >, int, int&, vertex_index_t>, void*, void*&>; Invariant1 = degree_vertex_invariant >, int, const int&, vertex_index_t> >, adjacency_list > >; Invariant2 = degree_vertex_invariant >, int, const int&, vertex_index_t> >, adjacency_list > >; IndexMap1 = adj_list_vertex_property_map >, int, const int&, vertex_index_t>; IndexMap2 = adj_list_vertex_property_map >, int, const int&, vertex_index_t>; std::size_t = long unsigned int]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/isomorphism.hpp:651:42: required from ‘bool boost::graph::detail::isomorphism_impl::operator()(const Graph1&, const Graph2&, const ArgPack&) const [with ArgPack = boost::parameter::aux::arg_list >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&> >, boost::parameter::aux::empty_arg_list, std::integral_constant >; Graph1 = boost::adjacency_list >; Graph2 = boost::adjacency_list >]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/isomorphism.hpp:662:5: required from ‘typename boost::result_of(Param0, Param1, const ArgPack&)>::type boost::graph::isomorphism_with_named_params(const Param0&, const Param1&, const ArgPack&) [with Param0 = boost::adjacency_list >; Param1 = boost::adjacency_list >; ArgPack = boost::parameter::aux::arg_list >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&> >, boost::parameter::aux::empty_arg_list, std::integral_constant >; typename boost::result_of(Param0, Param1, const ArgPack&)>::type = bool]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/isomorphism.hpp:666:1: required from ‘typename boost::result_of(Param0, Param1, const typename boost::detail::convert_bgl_params_to_boost_parameter >::type&)>::type boost::isomorphism(const Param0&, const Param1&, const bgl_named_params&) [with Param0 = adjacency_list >; Param1 = adjacency_list >; P = iterator_property_map<__gnu_cxx::__normal_iterator >, adj_list_vertex_property_map >, int, int&, vertex_index_t>, void*, void*&>; T = vertex_isomorphism_t; R = no_property; typename result_of(Param0, Param1, const typename detail::convert_bgl_params_to_boost_parameter >::type&)>::type = bool; typename detail::convert_bgl_params_to_boost_parameter >::type = parameter::aux::arg_list >, adj_list_vertex_property_map >, int, int&, vertex_index_t>, void*, void*&> >, parameter::aux::empty_arg_list, std::integral_constant >]’ ordering.cpp:68:18: required from here /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::DefaultConstructible<__gnu_cxx::__normal_iterator > >]’ 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ^ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements > > >]’: /home/omnipath/local/R/4.4-3.20/BH/include/boost/range/concepts.hpp:197:13: required from ‘struct boost::range_detail::ForwardIteratorConcept<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::range_detail::ForwardIteratorConcept<__gnu_cxx::__normal_iterator > >]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied > > >::value’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied > > >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_ > >)>’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/range/concepts.hpp:321:9: [ skipping 8 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/isomorphism.hpp:189:21: required from ‘bool boost::detail::isomorphism_algo::test_isomorphism() [with Graph1 = boost::adjacency_list >; Graph2 = boost::adjacency_list >; IsoMapping = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&>; Invariant1 = boost::degree_vertex_invariant >, int, const int&, boost::vertex_index_t> >, boost::adjacency_list > >; Invariant2 = boost::degree_vertex_invariant >, int, const int&, boost::vertex_index_t> >, boost::adjacency_list > >; IndexMap1 = boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>; IndexMap2 = boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/isomorphism.hpp:532:33: required from ‘bool boost::isomorphism(const Graph1&, const Graph2&, IsoMapping, Invariant1, Invariant2, std::size_t, IndexMap1, IndexMap2) [with Graph1 = adjacency_list >; Graph2 = adjacency_list >; IsoMapping = iterator_property_map<__gnu_cxx::__normal_iterator >, adj_list_vertex_property_map >, int, int&, vertex_index_t>, void*, void*&>; Invariant1 = degree_vertex_invariant >, int, const int&, vertex_index_t> >, adjacency_list > >; Invariant2 = degree_vertex_invariant >, int, const int&, vertex_index_t> >, adjacency_list > >; IndexMap1 = adj_list_vertex_property_map >, int, const int&, vertex_index_t>; IndexMap2 = adj_list_vertex_property_map >, int, const int&, vertex_index_t>; std::size_t = long unsigned int]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/isomorphism.hpp:651:42: required from ‘bool boost::graph::detail::isomorphism_impl::operator()(const Graph1&, const Graph2&, const ArgPack&) const [with ArgPack = boost::parameter::aux::arg_list >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&> >, boost::parameter::aux::empty_arg_list, std::integral_constant >; Graph1 = boost::adjacency_list >; Graph2 = boost::adjacency_list >]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/isomorphism.hpp:662:5: required from ‘typename boost::result_of(Param0, Param1, const ArgPack&)>::type boost::graph::isomorphism_with_named_params(const Param0&, const Param1&, const ArgPack&) [with Param0 = boost::adjacency_list >; Param1 = boost::adjacency_list >; ArgPack = boost::parameter::aux::arg_list >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&> >, boost::parameter::aux::empty_arg_list, std::integral_constant >; typename boost::result_of(Param0, Param1, const ArgPack&)>::type = bool]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/isomorphism.hpp:666:1: required from ‘typename boost::result_of(Param0, Param1, const typename boost::detail::convert_bgl_params_to_boost_parameter >::type&)>::type boost::isomorphism(const Param0&, const Param1&, const bgl_named_params&) [with Param0 = adjacency_list >; Param1 = adjacency_list >; P = iterator_property_map<__gnu_cxx::__normal_iterator >, adj_list_vertex_property_map >, int, int&, vertex_index_t>, void*, void*&>; T = vertex_isomorphism_t; R = no_property; typename result_of(Param0, Param1, const typename detail::convert_bgl_params_to_boost_parameter >::type&)>::type = bool; typename detail::convert_bgl_params_to_boost_parameter >::type = parameter::aux::arg_list >, adj_list_vertex_property_map >, int, int&, vertex_index_t>, void*, void*&> >, parameter::aux::empty_arg_list, std::integral_constant >]’ ordering.cpp:68:18: required from here /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::range_detail::ForwardIteratorConcept<__gnu_cxx::__normal_iterator > >]’ 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ^ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::range_detail::ForwardIteratorConcept<__gnu_cxx::__normal_iterator > >]’: /home/omnipath/local/R/4.4-3.20/BH/include/boost/range/concepts.hpp:321:9: required from ‘struct boost::ForwardRangeConcept >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/range/concepts.hpp:352:12: required from ‘struct boost::BidirectionalRangeConcept >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/range/concepts.hpp:370:12: required from ‘struct boost::RandomAccessRangeConcept >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::RandomAccessRangeConcept >]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied > >::value’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:45:51: [ skipping 3 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/isomorphism.hpp:189:21: required from ‘bool boost::detail::isomorphism_algo::test_isomorphism() [with Graph1 = boost::adjacency_list >; Graph2 = boost::adjacency_list >; IsoMapping = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&>; Invariant1 = boost::degree_vertex_invariant >, int, const int&, boost::vertex_index_t> >, boost::adjacency_list > >; Invariant2 = boost::degree_vertex_invariant >, int, const int&, boost::vertex_index_t> >, boost::adjacency_list > >; IndexMap1 = boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>; IndexMap2 = boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/isomorphism.hpp:532:33: required from ‘bool boost::isomorphism(const Graph1&, const Graph2&, IsoMapping, Invariant1, Invariant2, std::size_t, IndexMap1, IndexMap2) [with Graph1 = adjacency_list >; Graph2 = adjacency_list >; IsoMapping = iterator_property_map<__gnu_cxx::__normal_iterator >, adj_list_vertex_property_map >, int, int&, vertex_index_t>, void*, void*&>; Invariant1 = degree_vertex_invariant >, int, const int&, vertex_index_t> >, adjacency_list > >; Invariant2 = degree_vertex_invariant >, int, const int&, vertex_index_t> >, adjacency_list > >; IndexMap1 = adj_list_vertex_property_map >, int, const int&, vertex_index_t>; IndexMap2 = adj_list_vertex_property_map >, int, const int&, vertex_index_t>; std::size_t = long unsigned int]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/isomorphism.hpp:651:42: required from ‘bool boost::graph::detail::isomorphism_impl::operator()(const Graph1&, const Graph2&, const ArgPack&) const [with ArgPack = boost::parameter::aux::arg_list >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&> >, boost::parameter::aux::empty_arg_list, std::integral_constant >; Graph1 = boost::adjacency_list >; Graph2 = boost::adjacency_list >]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/isomorphism.hpp:662:5: required from ‘typename boost::result_of(Param0, Param1, const ArgPack&)>::type boost::graph::isomorphism_with_named_params(const Param0&, const Param1&, const ArgPack&) [with Param0 = boost::adjacency_list >; Param1 = boost::adjacency_list >; ArgPack = boost::parameter::aux::arg_list >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&> >, boost::parameter::aux::empty_arg_list, std::integral_constant >; typename boost::result_of(Param0, Param1, const ArgPack&)>::type = bool]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/isomorphism.hpp:666:1: required from ‘typename boost::result_of(Param0, Param1, const typename boost::detail::convert_bgl_params_to_boost_parameter >::type&)>::type boost::isomorphism(const Param0&, const Param1&, const bgl_named_params&) [with Param0 = adjacency_list >; Param1 = adjacency_list >; P = iterator_property_map<__gnu_cxx::__normal_iterator >, adj_list_vertex_property_map >, int, int&, vertex_index_t>, void*, void*&>; T = vertex_isomorphism_t; R = no_property; typename result_of(Param0, Param1, const typename detail::convert_bgl_params_to_boost_parameter >::type&)>::type = bool; typename detail::convert_bgl_params_to_boost_parameter >::type = parameter::aux::arg_list >, adj_list_vertex_property_map >, int, int&, vertex_index_t>, void*, void*&> >, parameter::aux::empty_arg_list, std::integral_constant >]’ ordering.cpp:68:18: required from here /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::range_detail::ForwardIteratorConcept::~ForwardIteratorConcept() [with Iterator = __gnu_cxx::__normal_iterator >]’ 37 | ~model() | ^ /home/omnipath/local/R/4.4-3.20/BH/include/boost/range/concepts.hpp:197:13: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 197 | BOOST_CONCEPT_USAGE(ForwardIteratorConcept) | ^~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements > > >]’: /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:137:5: required from ‘struct boost::DefaultConstructible<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/range/concepts.hpp:181:16: required from ‘struct boost::range_detail::ForwardIteratorConcept<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::range_detail::ForwardIteratorConcept<__gnu_cxx::__normal_iterator > >]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied > > >::value’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied > > >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:72:8: [ skipping 9 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/isomorphism.hpp:189:21: required from ‘bool boost::detail::isomorphism_algo::test_isomorphism() [with Graph1 = boost::adjacency_list >; Graph2 = boost::adjacency_list >; IsoMapping = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&>; Invariant1 = boost::degree_vertex_invariant >, int, const int&, boost::vertex_index_t> >, boost::adjacency_list > >; Invariant2 = boost::degree_vertex_invariant >, int, const int&, boost::vertex_index_t> >, boost::adjacency_list > >; IndexMap1 = boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>; IndexMap2 = boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/isomorphism.hpp:532:33: required from ‘bool boost::isomorphism(const Graph1&, const Graph2&, IsoMapping, Invariant1, Invariant2, std::size_t, IndexMap1, IndexMap2) [with Graph1 = adjacency_list >; Graph2 = adjacency_list >; IsoMapping = iterator_property_map<__gnu_cxx::__normal_iterator >, adj_list_vertex_property_map >, int, int&, vertex_index_t>, void*, void*&>; Invariant1 = degree_vertex_invariant >, int, const int&, vertex_index_t> >, adjacency_list > >; Invariant2 = degree_vertex_invariant >, int, const int&, vertex_index_t> >, adjacency_list > >; IndexMap1 = adj_list_vertex_property_map >, int, const int&, vertex_index_t>; IndexMap2 = adj_list_vertex_property_map >, int, const int&, vertex_index_t>; std::size_t = long unsigned int]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/isomorphism.hpp:651:42: required from ‘bool boost::graph::detail::isomorphism_impl::operator()(const Graph1&, const Graph2&, const ArgPack&) const [with ArgPack = boost::parameter::aux::arg_list >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&> >, boost::parameter::aux::empty_arg_list, std::integral_constant >; Graph1 = boost::adjacency_list >; Graph2 = boost::adjacency_list >]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/isomorphism.hpp:662:5: required from ‘typename boost::result_of(Param0, Param1, const ArgPack&)>::type boost::graph::isomorphism_with_named_params(const Param0&, const Param1&, const ArgPack&) [with Param0 = boost::adjacency_list >; Param1 = boost::adjacency_list >; ArgPack = boost::parameter::aux::arg_list >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&> >, boost::parameter::aux::empty_arg_list, std::integral_constant >; typename boost::result_of(Param0, Param1, const ArgPack&)>::type = bool]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/isomorphism.hpp:666:1: required from ‘typename boost::result_of(Param0, Param1, const typename boost::detail::convert_bgl_params_to_boost_parameter >::type&)>::type boost::isomorphism(const Param0&, const Param1&, const bgl_named_params&) [with Param0 = adjacency_list >; Param1 = adjacency_list >; P = iterator_property_map<__gnu_cxx::__normal_iterator >, adj_list_vertex_property_map >, int, int&, vertex_index_t>, void*, void*&>; T = vertex_isomorphism_t; R = no_property; typename result_of(Param0, Param1, const typename detail::convert_bgl_params_to_boost_parameter >::type&)>::type = bool; typename detail::convert_bgl_params_to_boost_parameter >::type = parameter::aux::arg_list >, adj_list_vertex_property_map >, int, int&, vertex_index_t>, void*, void*&> >, parameter::aux::empty_arg_list, std::integral_constant >]’ ordering.cpp:68:18: required from here /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::DefaultConstructible<__gnu_cxx::__normal_iterator > >]’ 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ^ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements > > >]’: /home/omnipath/local/R/4.4-3.20/BH/include/boost/range/concepts.hpp:197:13: required from ‘struct boost::range_detail::ForwardIteratorConcept<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::range_detail::ForwardIteratorConcept<__gnu_cxx::__normal_iterator > >]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied > > >::value’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied > > >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_ > >)>’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/range/concepts.hpp:322:9: [ skipping 8 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/isomorphism.hpp:189:21: required from ‘bool boost::detail::isomorphism_algo::test_isomorphism() [with Graph1 = boost::adjacency_list >; Graph2 = boost::adjacency_list >; IsoMapping = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&>; Invariant1 = boost::degree_vertex_invariant >, int, const int&, boost::vertex_index_t> >, boost::adjacency_list > >; Invariant2 = boost::degree_vertex_invariant >, int, const int&, boost::vertex_index_t> >, boost::adjacency_list > >; IndexMap1 = boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>; IndexMap2 = boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/isomorphism.hpp:532:33: required from ‘bool boost::isomorphism(const Graph1&, const Graph2&, IsoMapping, Invariant1, Invariant2, std::size_t, IndexMap1, IndexMap2) [with Graph1 = adjacency_list >; Graph2 = adjacency_list >; IsoMapping = iterator_property_map<__gnu_cxx::__normal_iterator >, adj_list_vertex_property_map >, int, int&, vertex_index_t>, void*, void*&>; Invariant1 = degree_vertex_invariant >, int, const int&, vertex_index_t> >, adjacency_list > >; Invariant2 = degree_vertex_invariant >, int, const int&, vertex_index_t> >, adjacency_list > >; IndexMap1 = adj_list_vertex_property_map >, int, const int&, vertex_index_t>; IndexMap2 = adj_list_vertex_property_map >, int, const int&, vertex_index_t>; std::size_t = long unsigned int]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/isomorphism.hpp:651:42: required from ‘bool boost::graph::detail::isomorphism_impl::operator()(const Graph1&, const Graph2&, const ArgPack&) const [with ArgPack = boost::parameter::aux::arg_list >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&> >, boost::parameter::aux::empty_arg_list, std::integral_constant >; Graph1 = boost::adjacency_list >; Graph2 = boost::adjacency_list >]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/isomorphism.hpp:662:5: required from ‘typename boost::result_of(Param0, Param1, const ArgPack&)>::type boost::graph::isomorphism_with_named_params(const Param0&, const Param1&, const ArgPack&) [with Param0 = boost::adjacency_list >; Param1 = boost::adjacency_list >; ArgPack = boost::parameter::aux::arg_list >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&> >, boost::parameter::aux::empty_arg_list, std::integral_constant >; typename boost::result_of(Param0, Param1, const ArgPack&)>::type = bool]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/isomorphism.hpp:666:1: required from ‘typename boost::result_of(Param0, Param1, const typename boost::detail::convert_bgl_params_to_boost_parameter >::type&)>::type boost::isomorphism(const Param0&, const Param1&, const bgl_named_params&) [with Param0 = adjacency_list >; Param1 = adjacency_list >; P = iterator_property_map<__gnu_cxx::__normal_iterator >, adj_list_vertex_property_map >, int, int&, vertex_index_t>, void*, void*&>; T = vertex_isomorphism_t; R = no_property; typename result_of(Param0, Param1, const typename detail::convert_bgl_params_to_boost_parameter >::type&)>::type = bool; typename detail::convert_bgl_params_to_boost_parameter >::type = parameter::aux::arg_list >, adj_list_vertex_property_map >, int, int&, vertex_index_t>, void*, void*&> >, parameter::aux::empty_arg_list, std::integral_constant >]’ ordering.cpp:68:18: required from here /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::range_detail::ForwardIteratorConcept<__gnu_cxx::__normal_iterator > >]’ 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ^ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::range_detail::ForwardIteratorConcept<__gnu_cxx::__normal_iterator > >]’: /home/omnipath/local/R/4.4-3.20/BH/include/boost/range/concepts.hpp:322:9: required from ‘struct boost::ForwardRangeConcept >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/range/concepts.hpp:352:12: required from ‘struct boost::BidirectionalRangeConcept >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/range/concepts.hpp:370:12: required from ‘struct boost::RandomAccessRangeConcept >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::RandomAccessRangeConcept >]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied > >::value’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:45:51: [ skipping 3 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/isomorphism.hpp:189:21: required from ‘bool boost::detail::isomorphism_algo::test_isomorphism() [with Graph1 = boost::adjacency_list >; Graph2 = boost::adjacency_list >; IsoMapping = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&>; Invariant1 = boost::degree_vertex_invariant >, int, const int&, boost::vertex_index_t> >, boost::adjacency_list > >; Invariant2 = boost::degree_vertex_invariant >, int, const int&, boost::vertex_index_t> >, boost::adjacency_list > >; IndexMap1 = boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>; IndexMap2 = boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/isomorphism.hpp:532:33: required from ‘bool boost::isomorphism(const Graph1&, const Graph2&, IsoMapping, Invariant1, Invariant2, std::size_t, IndexMap1, IndexMap2) [with Graph1 = adjacency_list >; Graph2 = adjacency_list >; IsoMapping = iterator_property_map<__gnu_cxx::__normal_iterator >, adj_list_vertex_property_map >, int, int&, vertex_index_t>, void*, void*&>; Invariant1 = degree_vertex_invariant >, int, const int&, vertex_index_t> >, adjacency_list > >; Invariant2 = degree_vertex_invariant >, int, const int&, vertex_index_t> >, adjacency_list > >; IndexMap1 = adj_list_vertex_property_map >, int, const int&, vertex_index_t>; IndexMap2 = adj_list_vertex_property_map >, int, const int&, vertex_index_t>; std::size_t = long unsigned int]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/isomorphism.hpp:651:42: required from ‘bool boost::graph::detail::isomorphism_impl::operator()(const Graph1&, const Graph2&, const ArgPack&) const [with ArgPack = boost::parameter::aux::arg_list >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&> >, boost::parameter::aux::empty_arg_list, std::integral_constant >; Graph1 = boost::adjacency_list >; Graph2 = boost::adjacency_list >]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/isomorphism.hpp:662:5: required from ‘typename boost::result_of(Param0, Param1, const ArgPack&)>::type boost::graph::isomorphism_with_named_params(const Param0&, const Param1&, const ArgPack&) [with Param0 = boost::adjacency_list >; Param1 = boost::adjacency_list >; ArgPack = boost::parameter::aux::arg_list >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&> >, boost::parameter::aux::empty_arg_list, std::integral_constant >; typename boost::result_of(Param0, Param1, const ArgPack&)>::type = bool]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/isomorphism.hpp:666:1: required from ‘typename boost::result_of(Param0, Param1, const typename boost::detail::convert_bgl_params_to_boost_parameter >::type&)>::type boost::isomorphism(const Param0&, const Param1&, const bgl_named_params&) [with Param0 = adjacency_list >; Param1 = adjacency_list >; P = iterator_property_map<__gnu_cxx::__normal_iterator >, adj_list_vertex_property_map >, int, int&, vertex_index_t>, void*, void*&>; T = vertex_isomorphism_t; R = no_property; typename result_of(Param0, Param1, const typename detail::convert_bgl_params_to_boost_parameter >::type&)>::type = bool; typename detail::convert_bgl_params_to_boost_parameter >::type = parameter::aux::arg_list >, adj_list_vertex_property_map >, int, int&, vertex_index_t>, void*, void*&> >, parameter::aux::empty_arg_list, std::integral_constant >]’ ordering.cpp:68:18: required from here /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::range_detail::ForwardIteratorConcept::~ForwardIteratorConcept() [with Iterator = __gnu_cxx::__normal_iterator >]’ 37 | ~model() | ^ /home/omnipath/local/R/4.4-3.20/BH/include/boost/range/concepts.hpp:197:13: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 197 | BOOST_CONCEPT_USAGE(ForwardIteratorConcept) | ^~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements > > >]’: /home/omnipath/local/R/4.4-3.20/BH/include/boost/range/concepts.hpp:224:14: required from ‘struct boost::range_detail::BidirectionalIteratorConcept<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::range_detail::BidirectionalIteratorConcept<__gnu_cxx::__normal_iterator > >]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied > > >::value’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied > > >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_ > >)>’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/range/concepts.hpp:355:9: [ skipping 7 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/isomorphism.hpp:189:21: required from ‘bool boost::detail::isomorphism_algo::test_isomorphism() [with Graph1 = boost::adjacency_list >; Graph2 = boost::adjacency_list >; IsoMapping = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&>; Invariant1 = boost::degree_vertex_invariant >, int, const int&, boost::vertex_index_t> >, boost::adjacency_list > >; Invariant2 = boost::degree_vertex_invariant >, int, const int&, boost::vertex_index_t> >, boost::adjacency_list > >; IndexMap1 = boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>; IndexMap2 = boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/isomorphism.hpp:532:33: required from ‘bool boost::isomorphism(const Graph1&, const Graph2&, IsoMapping, Invariant1, Invariant2, std::size_t, IndexMap1, IndexMap2) [with Graph1 = adjacency_list >; Graph2 = adjacency_list >; IsoMapping = iterator_property_map<__gnu_cxx::__normal_iterator >, adj_list_vertex_property_map >, int, int&, vertex_index_t>, void*, void*&>; Invariant1 = degree_vertex_invariant >, int, const int&, vertex_index_t> >, adjacency_list > >; Invariant2 = degree_vertex_invariant >, int, const int&, vertex_index_t> >, adjacency_list > >; IndexMap1 = adj_list_vertex_property_map >, int, const int&, vertex_index_t>; IndexMap2 = adj_list_vertex_property_map >, int, const int&, vertex_index_t>; std::size_t = long unsigned int]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/isomorphism.hpp:651:42: required from ‘bool boost::graph::detail::isomorphism_impl::operator()(const Graph1&, const Graph2&, const ArgPack&) const [with ArgPack = boost::parameter::aux::arg_list >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&> >, boost::parameter::aux::empty_arg_list, std::integral_constant >; Graph1 = boost::adjacency_list >; Graph2 = boost::adjacency_list >]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/isomorphism.hpp:662:5: required from ‘typename boost::result_of(Param0, Param1, const ArgPack&)>::type boost::graph::isomorphism_with_named_params(const Param0&, const Param1&, const ArgPack&) [with Param0 = boost::adjacency_list >; Param1 = boost::adjacency_list >; ArgPack = boost::parameter::aux::arg_list >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&> >, boost::parameter::aux::empty_arg_list, std::integral_constant >; typename boost::result_of(Param0, Param1, const ArgPack&)>::type = bool]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/isomorphism.hpp:666:1: required from ‘typename boost::result_of(Param0, Param1, const typename boost::detail::convert_bgl_params_to_boost_parameter >::type&)>::type boost::isomorphism(const Param0&, const Param1&, const bgl_named_params&) [with Param0 = adjacency_list >; Param1 = adjacency_list >; P = iterator_property_map<__gnu_cxx::__normal_iterator >, adj_list_vertex_property_map >, int, int&, vertex_index_t>, void*, void*&>; T = vertex_isomorphism_t; R = no_property; typename result_of(Param0, Param1, const typename detail::convert_bgl_params_to_boost_parameter >::type&)>::type = bool; typename detail::convert_bgl_params_to_boost_parameter >::type = parameter::aux::arg_list >, adj_list_vertex_property_map >, int, int&, vertex_index_t>, void*, void*&> >, parameter::aux::empty_arg_list, std::integral_constant >]’ ordering.cpp:68:18: required from here /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::range_detail::BidirectionalIteratorConcept<__gnu_cxx::__normal_iterator > >]’ 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ^ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::range_detail::BidirectionalIteratorConcept<__gnu_cxx::__normal_iterator > >]’: /home/omnipath/local/R/4.4-3.20/BH/include/boost/range/concepts.hpp:355:9: required from ‘struct boost::BidirectionalRangeConcept >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/range/concepts.hpp:370:12: required from ‘struct boost::RandomAccessRangeConcept >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::RandomAccessRangeConcept >]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied > >::value’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied > >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:72:8: [ skipping 2 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/isomorphism.hpp:189:21: required from ‘bool boost::detail::isomorphism_algo::test_isomorphism() [with Graph1 = boost::adjacency_list >; Graph2 = boost::adjacency_list >; IsoMapping = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&>; Invariant1 = boost::degree_vertex_invariant >, int, const int&, boost::vertex_index_t> >, boost::adjacency_list > >; Invariant2 = boost::degree_vertex_invariant >, int, const int&, boost::vertex_index_t> >, boost::adjacency_list > >; IndexMap1 = boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>; IndexMap2 = boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/isomorphism.hpp:532:33: required from ‘bool boost::isomorphism(const Graph1&, const Graph2&, IsoMapping, Invariant1, Invariant2, std::size_t, IndexMap1, IndexMap2) [with Graph1 = adjacency_list >; Graph2 = adjacency_list >; IsoMapping = iterator_property_map<__gnu_cxx::__normal_iterator >, adj_list_vertex_property_map >, int, int&, vertex_index_t>, void*, void*&>; Invariant1 = degree_vertex_invariant >, int, const int&, vertex_index_t> >, adjacency_list > >; Invariant2 = degree_vertex_invariant >, int, const int&, vertex_index_t> >, adjacency_list > >; IndexMap1 = adj_list_vertex_property_map >, int, const int&, vertex_index_t>; IndexMap2 = adj_list_vertex_property_map >, int, const int&, vertex_index_t>; std::size_t = long unsigned int]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/isomorphism.hpp:651:42: required from ‘bool boost::graph::detail::isomorphism_impl::operator()(const Graph1&, const Graph2&, const ArgPack&) const [with ArgPack = boost::parameter::aux::arg_list >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&> >, boost::parameter::aux::empty_arg_list, std::integral_constant >; Graph1 = boost::adjacency_list >; Graph2 = boost::adjacency_list >]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/isomorphism.hpp:662:5: required from ‘typename boost::result_of(Param0, Param1, const ArgPack&)>::type boost::graph::isomorphism_with_named_params(const Param0&, const Param1&, const ArgPack&) [with Param0 = boost::adjacency_list >; Param1 = boost::adjacency_list >; ArgPack = boost::parameter::aux::arg_list >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&> >, boost::parameter::aux::empty_arg_list, std::integral_constant >; typename boost::result_of(Param0, Param1, const ArgPack&)>::type = bool]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/isomorphism.hpp:666:1: required from ‘typename boost::result_of(Param0, Param1, const typename boost::detail::convert_bgl_params_to_boost_parameter >::type&)>::type boost::isomorphism(const Param0&, const Param1&, const bgl_named_params&) [with Param0 = adjacency_list >; Param1 = adjacency_list >; P = iterator_property_map<__gnu_cxx::__normal_iterator >, adj_list_vertex_property_map >, int, int&, vertex_index_t>, void*, void*&>; T = vertex_isomorphism_t; R = no_property; typename result_of(Param0, Param1, const typename detail::convert_bgl_params_to_boost_parameter >::type&)>::type = bool; typename detail::convert_bgl_params_to_boost_parameter >::type = parameter::aux::arg_list >, adj_list_vertex_property_map >, int, int&, vertex_index_t>, void*, void*&> >, parameter::aux::empty_arg_list, std::integral_constant >]’ ordering.cpp:68:18: required from here /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::range_detail::BidirectionalIteratorConcept::~BidirectionalIteratorConcept() [with Iterator = __gnu_cxx::__normal_iterator >]’ 37 | ~model() | ^ /home/omnipath/local/R/4.4-3.20/BH/include/boost/range/concepts.hpp:224:14: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 224 | BOOST_CONCEPT_USAGE(BidirectionalIteratorConcept) | ^~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements > > >]’: /home/omnipath/local/R/4.4-3.20/BH/include/boost/range/concepts.hpp:224:14: required from ‘struct boost::range_detail::BidirectionalIteratorConcept<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::range_detail::BidirectionalIteratorConcept<__gnu_cxx::__normal_iterator > >]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied > > >::value’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied > > >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_ > >)>’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/range/concepts.hpp:356:9: [ skipping 7 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/isomorphism.hpp:189:21: required from ‘bool boost::detail::isomorphism_algo::test_isomorphism() [with Graph1 = boost::adjacency_list >; Graph2 = boost::adjacency_list >; IsoMapping = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&>; Invariant1 = boost::degree_vertex_invariant >, int, const int&, boost::vertex_index_t> >, boost::adjacency_list > >; Invariant2 = boost::degree_vertex_invariant >, int, const int&, boost::vertex_index_t> >, boost::adjacency_list > >; IndexMap1 = boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>; IndexMap2 = boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/isomorphism.hpp:532:33: required from ‘bool boost::isomorphism(const Graph1&, const Graph2&, IsoMapping, Invariant1, Invariant2, std::size_t, IndexMap1, IndexMap2) [with Graph1 = adjacency_list >; Graph2 = adjacency_list >; IsoMapping = iterator_property_map<__gnu_cxx::__normal_iterator >, adj_list_vertex_property_map >, int, int&, vertex_index_t>, void*, void*&>; Invariant1 = degree_vertex_invariant >, int, const int&, vertex_index_t> >, adjacency_list > >; Invariant2 = degree_vertex_invariant >, int, const int&, vertex_index_t> >, adjacency_list > >; IndexMap1 = adj_list_vertex_property_map >, int, const int&, vertex_index_t>; IndexMap2 = adj_list_vertex_property_map >, int, const int&, vertex_index_t>; std::size_t = long unsigned int]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/isomorphism.hpp:651:42: required from ‘bool boost::graph::detail::isomorphism_impl::operator()(const Graph1&, const Graph2&, const ArgPack&) const [with ArgPack = boost::parameter::aux::arg_list >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&> >, boost::parameter::aux::empty_arg_list, std::integral_constant >; Graph1 = boost::adjacency_list >; Graph2 = boost::adjacency_list >]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/isomorphism.hpp:662:5: required from ‘typename boost::result_of(Param0, Param1, const ArgPack&)>::type boost::graph::isomorphism_with_named_params(const Param0&, const Param1&, const ArgPack&) [with Param0 = boost::adjacency_list >; Param1 = boost::adjacency_list >; ArgPack = boost::parameter::aux::arg_list >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&> >, boost::parameter::aux::empty_arg_list, std::integral_constant >; typename boost::result_of(Param0, Param1, const ArgPack&)>::type = bool]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/isomorphism.hpp:666:1: required from ‘typename boost::result_of(Param0, Param1, const typename boost::detail::convert_bgl_params_to_boost_parameter >::type&)>::type boost::isomorphism(const Param0&, const Param1&, const bgl_named_params&) [with Param0 = adjacency_list >; Param1 = adjacency_list >; P = iterator_property_map<__gnu_cxx::__normal_iterator >, adj_list_vertex_property_map >, int, int&, vertex_index_t>, void*, void*&>; T = vertex_isomorphism_t; R = no_property; typename result_of(Param0, Param1, const typename detail::convert_bgl_params_to_boost_parameter >::type&)>::type = bool; typename detail::convert_bgl_params_to_boost_parameter >::type = parameter::aux::arg_list >, adj_list_vertex_property_map >, int, int&, vertex_index_t>, void*, void*&> >, parameter::aux::empty_arg_list, std::integral_constant >]’ ordering.cpp:68:18: required from here /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::range_detail::BidirectionalIteratorConcept<__gnu_cxx::__normal_iterator > >]’ 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ^ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::range_detail::BidirectionalIteratorConcept<__gnu_cxx::__normal_iterator > >]’: /home/omnipath/local/R/4.4-3.20/BH/include/boost/range/concepts.hpp:356:9: required from ‘struct boost::BidirectionalRangeConcept >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/range/concepts.hpp:370:12: required from ‘struct boost::RandomAccessRangeConcept >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::RandomAccessRangeConcept >]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied > >::value’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied > >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:72:8: [ skipping 2 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/isomorphism.hpp:189:21: required from ‘bool boost::detail::isomorphism_algo::test_isomorphism() [with Graph1 = boost::adjacency_list >; Graph2 = boost::adjacency_list >; IsoMapping = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&>; Invariant1 = boost::degree_vertex_invariant >, int, const int&, boost::vertex_index_t> >, boost::adjacency_list > >; Invariant2 = boost::degree_vertex_invariant >, int, const int&, boost::vertex_index_t> >, boost::adjacency_list > >; IndexMap1 = boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>; IndexMap2 = boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/isomorphism.hpp:532:33: required from ‘bool boost::isomorphism(const Graph1&, const Graph2&, IsoMapping, Invariant1, Invariant2, std::size_t, IndexMap1, IndexMap2) [with Graph1 = adjacency_list >; Graph2 = adjacency_list >; IsoMapping = iterator_property_map<__gnu_cxx::__normal_iterator >, adj_list_vertex_property_map >, int, int&, vertex_index_t>, void*, void*&>; Invariant1 = degree_vertex_invariant >, int, const int&, vertex_index_t> >, adjacency_list > >; Invariant2 = degree_vertex_invariant >, int, const int&, vertex_index_t> >, adjacency_list > >; IndexMap1 = adj_list_vertex_property_map >, int, const int&, vertex_index_t>; IndexMap2 = adj_list_vertex_property_map >, int, const int&, vertex_index_t>; std::size_t = long unsigned int]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/isomorphism.hpp:651:42: required from ‘bool boost::graph::detail::isomorphism_impl::operator()(const Graph1&, const Graph2&, const ArgPack&) const [with ArgPack = boost::parameter::aux::arg_list >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&> >, boost::parameter::aux::empty_arg_list, std::integral_constant >; Graph1 = boost::adjacency_list >; Graph2 = boost::adjacency_list >]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/isomorphism.hpp:662:5: required from ‘typename boost::result_of(Param0, Param1, const ArgPack&)>::type boost::graph::isomorphism_with_named_params(const Param0&, const Param1&, const ArgPack&) [with Param0 = boost::adjacency_list >; Param1 = boost::adjacency_list >; ArgPack = boost::parameter::aux::arg_list >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&> >, boost::parameter::aux::empty_arg_list, std::integral_constant >; typename boost::result_of(Param0, Param1, const ArgPack&)>::type = bool]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/isomorphism.hpp:666:1: required from ‘typename boost::result_of(Param0, Param1, const typename boost::detail::convert_bgl_params_to_boost_parameter >::type&)>::type boost::isomorphism(const Param0&, const Param1&, const bgl_named_params&) [with Param0 = adjacency_list >; Param1 = adjacency_list >; P = iterator_property_map<__gnu_cxx::__normal_iterator >, adj_list_vertex_property_map >, int, int&, vertex_index_t>, void*, void*&>; T = vertex_isomorphism_t; R = no_property; typename result_of(Param0, Param1, const typename detail::convert_bgl_params_to_boost_parameter >::type&)>::type = bool; typename detail::convert_bgl_params_to_boost_parameter >::type = parameter::aux::arg_list >, adj_list_vertex_property_map >, int, int&, vertex_index_t>, void*, void*&> >, parameter::aux::empty_arg_list, std::integral_constant >]’ ordering.cpp:68:18: required from here /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::range_detail::BidirectionalIteratorConcept::~BidirectionalIteratorConcept() [with Iterator = __gnu_cxx::__normal_iterator >]’ 37 | ~model() | ^ /home/omnipath/local/R/4.4-3.20/BH/include/boost/range/concepts.hpp:224:14: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 224 | BOOST_CONCEPT_USAGE(BidirectionalIteratorConcept) | ^~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements > > >]’: /home/omnipath/local/R/4.4-3.20/BH/include/boost/range/concepts.hpp:245:14: required from ‘struct boost::range_detail::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::range_detail::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator > >]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied > > >::value’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied > > >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_ > >)>’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/range/concepts.hpp:373:9: [ skipping 6 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/isomorphism.hpp:189:21: required from ‘bool boost::detail::isomorphism_algo::test_isomorphism() [with Graph1 = boost::adjacency_list >; Graph2 = boost::adjacency_list >; IsoMapping = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&>; Invariant1 = boost::degree_vertex_invariant >, int, const int&, boost::vertex_index_t> >, boost::adjacency_list > >; Invariant2 = boost::degree_vertex_invariant >, int, const int&, boost::vertex_index_t> >, boost::adjacency_list > >; IndexMap1 = boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>; IndexMap2 = boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/isomorphism.hpp:532:33: required from ‘bool boost::isomorphism(const Graph1&, const Graph2&, IsoMapping, Invariant1, Invariant2, std::size_t, IndexMap1, IndexMap2) [with Graph1 = adjacency_list >; Graph2 = adjacency_list >; IsoMapping = iterator_property_map<__gnu_cxx::__normal_iterator >, adj_list_vertex_property_map >, int, int&, vertex_index_t>, void*, void*&>; Invariant1 = degree_vertex_invariant >, int, const int&, vertex_index_t> >, adjacency_list > >; Invariant2 = degree_vertex_invariant >, int, const int&, vertex_index_t> >, adjacency_list > >; IndexMap1 = adj_list_vertex_property_map >, int, const int&, vertex_index_t>; IndexMap2 = adj_list_vertex_property_map >, int, const int&, vertex_index_t>; std::size_t = long unsigned int]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/isomorphism.hpp:651:42: required from ‘bool boost::graph::detail::isomorphism_impl::operator()(const Graph1&, const Graph2&, const ArgPack&) const [with ArgPack = boost::parameter::aux::arg_list >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&> >, boost::parameter::aux::empty_arg_list, std::integral_constant >; Graph1 = boost::adjacency_list >; Graph2 = boost::adjacency_list >]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/isomorphism.hpp:662:5: required from ‘typename boost::result_of(Param0, Param1, const ArgPack&)>::type boost::graph::isomorphism_with_named_params(const Param0&, const Param1&, const ArgPack&) [with Param0 = boost::adjacency_list >; Param1 = boost::adjacency_list >; ArgPack = boost::parameter::aux::arg_list >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&> >, boost::parameter::aux::empty_arg_list, std::integral_constant >; typename boost::result_of(Param0, Param1, const ArgPack&)>::type = bool]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/isomorphism.hpp:666:1: required from ‘typename boost::result_of(Param0, Param1, const typename boost::detail::convert_bgl_params_to_boost_parameter >::type&)>::type boost::isomorphism(const Param0&, const Param1&, const bgl_named_params&) [with Param0 = adjacency_list >; Param1 = adjacency_list >; P = iterator_property_map<__gnu_cxx::__normal_iterator >, adj_list_vertex_property_map >, int, int&, vertex_index_t>, void*, void*&>; T = vertex_isomorphism_t; R = no_property; typename result_of(Param0, Param1, const typename detail::convert_bgl_params_to_boost_parameter >::type&)>::type = bool; typename detail::convert_bgl_params_to_boost_parameter >::type = parameter::aux::arg_list >, adj_list_vertex_property_map >, int, int&, vertex_index_t>, void*, void*&> >, parameter::aux::empty_arg_list, std::integral_constant >]’ ordering.cpp:68:18: required from here /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::range_detail::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator > >]’ 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ^ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::range_detail::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator > >]’: /home/omnipath/local/R/4.4-3.20/BH/include/boost/range/concepts.hpp:373:9: required from ‘struct boost::RandomAccessRangeConcept >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::RandomAccessRangeConcept >]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied > >::value’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied > >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:72:8: [ skipping 2 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/isomorphism.hpp:189:21: required from ‘bool boost::detail::isomorphism_algo::test_isomorphism() [with Graph1 = boost::adjacency_list >; Graph2 = boost::adjacency_list >; IsoMapping = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&>; Invariant1 = boost::degree_vertex_invariant >, int, const int&, boost::vertex_index_t> >, boost::adjacency_list > >; Invariant2 = boost::degree_vertex_invariant >, int, const int&, boost::vertex_index_t> >, boost::adjacency_list > >; IndexMap1 = boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>; IndexMap2 = boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/isomorphism.hpp:532:33: required from ‘bool boost::isomorphism(const Graph1&, const Graph2&, IsoMapping, Invariant1, Invariant2, std::size_t, IndexMap1, IndexMap2) [with Graph1 = adjacency_list >; Graph2 = adjacency_list >; IsoMapping = iterator_property_map<__gnu_cxx::__normal_iterator >, adj_list_vertex_property_map >, int, int&, vertex_index_t>, void*, void*&>; Invariant1 = degree_vertex_invariant >, int, const int&, vertex_index_t> >, adjacency_list > >; Invariant2 = degree_vertex_invariant >, int, const int&, vertex_index_t> >, adjacency_list > >; IndexMap1 = adj_list_vertex_property_map >, int, const int&, vertex_index_t>; IndexMap2 = adj_list_vertex_property_map >, int, const int&, vertex_index_t>; std::size_t = long unsigned int]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/isomorphism.hpp:651:42: required from ‘bool boost::graph::detail::isomorphism_impl::operator()(const Graph1&, const Graph2&, const ArgPack&) const [with ArgPack = boost::parameter::aux::arg_list >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&> >, boost::parameter::aux::empty_arg_list, std::integral_constant >; Graph1 = boost::adjacency_list >; Graph2 = boost::adjacency_list >]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/isomorphism.hpp:662:5: required from ‘typename boost::result_of(Param0, Param1, const ArgPack&)>::type boost::graph::isomorphism_with_named_params(const Param0&, const Param1&, const ArgPack&) [with Param0 = boost::adjacency_list >; Param1 = boost::adjacency_list >; ArgPack = boost::parameter::aux::arg_list >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&> >, boost::parameter::aux::empty_arg_list, std::integral_constant >; typename boost::result_of(Param0, Param1, const ArgPack&)>::type = bool]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/isomorphism.hpp:666:1: required from ‘typename boost::result_of(Param0, Param1, const typename boost::detail::convert_bgl_params_to_boost_parameter >::type&)>::type boost::isomorphism(const Param0&, const Param1&, const bgl_named_params&) [with Param0 = adjacency_list >; Param1 = adjacency_list >; P = iterator_property_map<__gnu_cxx::__normal_iterator >, adj_list_vertex_property_map >, int, int&, vertex_index_t>, void*, void*&>; T = vertex_isomorphism_t; R = no_property; typename result_of(Param0, Param1, const typename detail::convert_bgl_params_to_boost_parameter >::type&)>::type = bool; typename detail::convert_bgl_params_to_boost_parameter >::type = parameter::aux::arg_list >, adj_list_vertex_property_map >, int, int&, vertex_index_t>, void*, void*&> >, parameter::aux::empty_arg_list, std::integral_constant >]’ ordering.cpp:68:18: required from here /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::range_detail::RandomAccessIteratorConcept::~RandomAccessIteratorConcept() [with Iterator = __gnu_cxx::__normal_iterator >]’ 37 | ~model() | ^ /home/omnipath/local/R/4.4-3.20/BH/include/boost/range/concepts.hpp:245:14: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 245 | BOOST_CONCEPT_USAGE(RandomAccessIteratorConcept) | ^~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements > > >]’: /home/omnipath/local/R/4.4-3.20/BH/include/boost/range/concepts.hpp:245:14: required from ‘struct boost::range_detail::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::range_detail::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator > >]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied > > >::value’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied > > >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_ > >)>’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/range/concepts.hpp:374:9: [ skipping 6 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/isomorphism.hpp:189:21: required from ‘bool boost::detail::isomorphism_algo::test_isomorphism() [with Graph1 = boost::adjacency_list >; Graph2 = boost::adjacency_list >; IsoMapping = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&>; Invariant1 = boost::degree_vertex_invariant >, int, const int&, boost::vertex_index_t> >, boost::adjacency_list > >; Invariant2 = boost::degree_vertex_invariant >, int, const int&, boost::vertex_index_t> >, boost::adjacency_list > >; IndexMap1 = boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>; IndexMap2 = boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/isomorphism.hpp:532:33: required from ‘bool boost::isomorphism(const Graph1&, const Graph2&, IsoMapping, Invariant1, Invariant2, std::size_t, IndexMap1, IndexMap2) [with Graph1 = adjacency_list >; Graph2 = adjacency_list >; IsoMapping = iterator_property_map<__gnu_cxx::__normal_iterator >, adj_list_vertex_property_map >, int, int&, vertex_index_t>, void*, void*&>; Invariant1 = degree_vertex_invariant >, int, const int&, vertex_index_t> >, adjacency_list > >; Invariant2 = degree_vertex_invariant >, int, const int&, vertex_index_t> >, adjacency_list > >; IndexMap1 = adj_list_vertex_property_map >, int, const int&, vertex_index_t>; IndexMap2 = adj_list_vertex_property_map >, int, const int&, vertex_index_t>; std::size_t = long unsigned int]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/isomorphism.hpp:651:42: required from ‘bool boost::graph::detail::isomorphism_impl::operator()(const Graph1&, const Graph2&, const ArgPack&) const [with ArgPack = boost::parameter::aux::arg_list >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&> >, boost::parameter::aux::empty_arg_list, std::integral_constant >; Graph1 = boost::adjacency_list >; Graph2 = boost::adjacency_list >]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/isomorphism.hpp:662:5: required from ‘typename boost::result_of(Param0, Param1, const ArgPack&)>::type boost::graph::isomorphism_with_named_params(const Param0&, const Param1&, const ArgPack&) [with Param0 = boost::adjacency_list >; Param1 = boost::adjacency_list >; ArgPack = boost::parameter::aux::arg_list >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&> >, boost::parameter::aux::empty_arg_list, std::integral_constant >; typename boost::result_of(Param0, Param1, const ArgPack&)>::type = bool]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/isomorphism.hpp:666:1: required from ‘typename boost::result_of(Param0, Param1, const typename boost::detail::convert_bgl_params_to_boost_parameter >::type&)>::type boost::isomorphism(const Param0&, const Param1&, const bgl_named_params&) [with Param0 = adjacency_list >; Param1 = adjacency_list >; P = iterator_property_map<__gnu_cxx::__normal_iterator >, adj_list_vertex_property_map >, int, int&, vertex_index_t>, void*, void*&>; T = vertex_isomorphism_t; R = no_property; typename result_of(Param0, Param1, const typename detail::convert_bgl_params_to_boost_parameter >::type&)>::type = bool; typename detail::convert_bgl_params_to_boost_parameter >::type = parameter::aux::arg_list >, adj_list_vertex_property_map >, int, int&, vertex_index_t>, void*, void*&> >, parameter::aux::empty_arg_list, std::integral_constant >]’ ordering.cpp:68:18: required from here /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::range_detail::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator > >]’ 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ^ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::range_detail::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator > >]’: /home/omnipath/local/R/4.4-3.20/BH/include/boost/range/concepts.hpp:374:9: required from ‘struct boost::RandomAccessRangeConcept >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::RandomAccessRangeConcept >]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied > >::value’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied > >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:72:8: [ skipping 2 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/isomorphism.hpp:189:21: required from ‘bool boost::detail::isomorphism_algo::test_isomorphism() [with Graph1 = boost::adjacency_list >; Graph2 = boost::adjacency_list >; IsoMapping = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&>; Invariant1 = boost::degree_vertex_invariant >, int, const int&, boost::vertex_index_t> >, boost::adjacency_list > >; Invariant2 = boost::degree_vertex_invariant >, int, const int&, boost::vertex_index_t> >, boost::adjacency_list > >; IndexMap1 = boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>; IndexMap2 = boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/isomorphism.hpp:532:33: required from ‘bool boost::isomorphism(const Graph1&, const Graph2&, IsoMapping, Invariant1, Invariant2, std::size_t, IndexMap1, IndexMap2) [with Graph1 = adjacency_list >; Graph2 = adjacency_list >; IsoMapping = iterator_property_map<__gnu_cxx::__normal_iterator >, adj_list_vertex_property_map >, int, int&, vertex_index_t>, void*, void*&>; Invariant1 = degree_vertex_invariant >, int, const int&, vertex_index_t> >, adjacency_list > >; Invariant2 = degree_vertex_invariant >, int, const int&, vertex_index_t> >, adjacency_list > >; IndexMap1 = adj_list_vertex_property_map >, int, const int&, vertex_index_t>; IndexMap2 = adj_list_vertex_property_map >, int, const int&, vertex_index_t>; std::size_t = long unsigned int]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/isomorphism.hpp:651:42: required from ‘bool boost::graph::detail::isomorphism_impl::operator()(const Graph1&, const Graph2&, const ArgPack&) const [with ArgPack = boost::parameter::aux::arg_list >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&> >, boost::parameter::aux::empty_arg_list, std::integral_constant >; Graph1 = boost::adjacency_list >; Graph2 = boost::adjacency_list >]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/isomorphism.hpp:662:5: required from ‘typename boost::result_of(Param0, Param1, const ArgPack&)>::type boost::graph::isomorphism_with_named_params(const Param0&, const Param1&, const ArgPack&) [with Param0 = boost::adjacency_list >; Param1 = boost::adjacency_list >; ArgPack = boost::parameter::aux::arg_list >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&> >, boost::parameter::aux::empty_arg_list, std::integral_constant >; typename boost::result_of(Param0, Param1, const ArgPack&)>::type = bool]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/isomorphism.hpp:666:1: required from ‘typename boost::result_of(Param0, Param1, const typename boost::detail::convert_bgl_params_to_boost_parameter >::type&)>::type boost::isomorphism(const Param0&, const Param1&, const bgl_named_params&) [with Param0 = adjacency_list >; Param1 = adjacency_list >; P = iterator_property_map<__gnu_cxx::__normal_iterator >, adj_list_vertex_property_map >, int, int&, vertex_index_t>, void*, void*&>; T = vertex_isomorphism_t; R = no_property; typename result_of(Param0, Param1, const typename detail::convert_bgl_params_to_boost_parameter >::type&)>::type = bool; typename detail::convert_bgl_params_to_boost_parameter >::type = parameter::aux::arg_list >, adj_list_vertex_property_map >, int, int&, vertex_index_t>, void*, void*&> >, parameter::aux::empty_arg_list, std::integral_constant >]’ ordering.cpp:68:18: required from here /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::range_detail::RandomAccessIteratorConcept::~RandomAccessIteratorConcept() [with Iterator = __gnu_cxx::__normal_iterator >]’ 37 | ~model() | ^ /home/omnipath/local/R/4.4-3.20/BH/include/boost/range/concepts.hpp:245:14: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 245 | BOOST_CONCEPT_USAGE(RandomAccessIteratorConcept) | ^~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::RandomAccessRangeConcept >]’: /home/omnipath/local/R/4.4-3.20/BH/include/boost/range/algorithm/sort.hpp:32:5: required from ‘RandomAccessRange& boost::range::sort(RandomAccessRange&, BinaryPredicate) [with RandomAccessRange = std::vector; BinaryPredicate = boost::detail::isomorphism_algo >, boost::adjacency_list >, boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&>, boost::degree_vertex_invariant >, int, const int&, boost::vertex_index_t> >, boost::adjacency_list > >, boost::degree_vertex_invariant >, int, const int&, boost::vertex_index_t> >, boost::adjacency_list > >, boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>, boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t> >::compare_multiplicity]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/isomorphism.hpp:189:21: required from ‘bool boost::detail::isomorphism_algo::test_isomorphism() [with Graph1 = boost::adjacency_list >; Graph2 = boost::adjacency_list >; IsoMapping = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&>; Invariant1 = boost::degree_vertex_invariant >, int, const int&, boost::vertex_index_t> >, boost::adjacency_list > >; Invariant2 = boost::degree_vertex_invariant >, int, const int&, boost::vertex_index_t> >, boost::adjacency_list > >; IndexMap1 = boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>; IndexMap2 = boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/isomorphism.hpp:532:33: required from ‘bool boost::isomorphism(const Graph1&, const Graph2&, IsoMapping, Invariant1, Invariant2, std::size_t, IndexMap1, IndexMap2) [with Graph1 = adjacency_list >; Graph2 = adjacency_list >; IsoMapping = iterator_property_map<__gnu_cxx::__normal_iterator >, adj_list_vertex_property_map >, int, int&, vertex_index_t>, void*, void*&>; Invariant1 = degree_vertex_invariant >, int, const int&, vertex_index_t> >, adjacency_list > >; Invariant2 = degree_vertex_invariant >, int, const int&, vertex_index_t> >, adjacency_list > >; IndexMap1 = adj_list_vertex_property_map >, int, const int&, vertex_index_t>; IndexMap2 = adj_list_vertex_property_map >, int, const int&, vertex_index_t>; std::size_t = long unsigned int]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/isomorphism.hpp:651:42: required from ‘bool boost::graph::detail::isomorphism_impl::operator()(const Graph1&, const Graph2&, const ArgPack&) const [with ArgPack = boost::parameter::aux::arg_list >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&> >, boost::parameter::aux::empty_arg_list, std::integral_constant >; Graph1 = boost::adjacency_list >; Graph2 = boost::adjacency_list >]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/isomorphism.hpp:662:5: required from ‘typename boost::result_of(Param0, Param1, const ArgPack&)>::type boost::graph::isomorphism_with_named_params(const Param0&, const Param1&, const ArgPack&) [with Param0 = boost::adjacency_list >; Param1 = boost::adjacency_list >; ArgPack = boost::parameter::aux::arg_list >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&> >, boost::parameter::aux::empty_arg_list, std::integral_constant >; typename boost::result_of(Param0, Param1, const ArgPack&)>::type = bool]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/isomorphism.hpp:666:1: required from ‘typename boost::result_of(Param0, Param1, const typename boost::detail::convert_bgl_params_to_boost_parameter >::type&)>::type boost::isomorphism(const Param0&, const Param1&, const bgl_named_params&) [with Param0 = adjacency_list >; Param1 = adjacency_list >; P = iterator_property_map<__gnu_cxx::__normal_iterator >, adj_list_vertex_property_map >, int, int&, vertex_index_t>, void*, void*&>; T = vertex_isomorphism_t; R = no_property; typename result_of(Param0, Param1, const typename detail::convert_bgl_params_to_boost_parameter >::type&)>::type = bool; typename detail::convert_bgl_params_to_boost_parameter >::type = parameter::aux::arg_list >, adj_list_vertex_property_map >, int, int&, vertex_index_t>, void*, void*&> >, parameter::aux::empty_arg_list, std::integral_constant >]’ ordering.cpp:68:18: required from here /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/range/concepts.hpp:370:12: note: in a call to non-static member function ‘boost::RandomAccessRangeConcept >::~RandomAccessRangeConcept()’ 370 | struct RandomAccessRangeConcept : BidirectionalRangeConcept | ^~~~~~~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements > > >]’: /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:145:5: required from ‘struct boost::Assignable<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:502:3: required from ‘struct boost::InputIterator<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:540:3: required from ‘struct boost::ForwardIterator<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:568:3: required from ‘struct boost::BidirectionalIterator<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:597:3: required from ‘struct boost::RandomAccessIterator<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:597:3: [ skipping 6 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/isomorphism.hpp:214:54: required from ‘bool boost::detail::isomorphism_algo::test_isomorphism() [with Graph1 = boost::adjacency_list >; Graph2 = boost::adjacency_list >; IsoMapping = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&>; Invariant1 = boost::degree_vertex_invariant >, int, const int&, boost::vertex_index_t> >, boost::adjacency_list > >; Invariant2 = boost::degree_vertex_invariant >, int, const int&, boost::vertex_index_t> >, boost::adjacency_list > >; IndexMap1 = boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>; IndexMap2 = boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/isomorphism.hpp:532:33: required from ‘bool boost::isomorphism(const Graph1&, const Graph2&, IsoMapping, Invariant1, Invariant2, std::size_t, IndexMap1, IndexMap2) [with Graph1 = adjacency_list >; Graph2 = adjacency_list >; IsoMapping = iterator_property_map<__gnu_cxx::__normal_iterator >, adj_list_vertex_property_map >, int, int&, vertex_index_t>, void*, void*&>; Invariant1 = degree_vertex_invariant >, int, const int&, vertex_index_t> >, adjacency_list > >; Invariant2 = degree_vertex_invariant >, int, const int&, vertex_index_t> >, adjacency_list > >; IndexMap1 = adj_list_vertex_property_map >, int, const int&, vertex_index_t>; IndexMap2 = adj_list_vertex_property_map >, int, const int&, vertex_index_t>; std::size_t = long unsigned int]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/isomorphism.hpp:651:42: required from ‘bool boost::graph::detail::isomorphism_impl::operator()(const Graph1&, const Graph2&, const ArgPack&) const [with ArgPack = boost::parameter::aux::arg_list >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&> >, boost::parameter::aux::empty_arg_list, std::integral_constant >; Graph1 = boost::adjacency_list >; Graph2 = boost::adjacency_list >]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/isomorphism.hpp:662:5: required from ‘typename boost::result_of(Param0, Param1, const ArgPack&)>::type boost::graph::isomorphism_with_named_params(const Param0&, const Param1&, const ArgPack&) [with Param0 = boost::adjacency_list >; Param1 = boost::adjacency_list >; ArgPack = boost::parameter::aux::arg_list >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&> >, boost::parameter::aux::empty_arg_list, std::integral_constant >; typename boost::result_of(Param0, Param1, const ArgPack&)>::type = bool]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/isomorphism.hpp:666:1: required from ‘typename boost::result_of(Param0, Param1, const typename boost::detail::convert_bgl_params_to_boost_parameter >::type&)>::type boost::isomorphism(const Param0&, const Param1&, const bgl_named_params&) [with Param0 = adjacency_list >; Param1 = adjacency_list >; P = iterator_property_map<__gnu_cxx::__normal_iterator >, adj_list_vertex_property_map >, int, int&, vertex_index_t>, void*, void*&>; T = vertex_isomorphism_t; R = no_property; typename result_of(Param0, Param1, const typename detail::convert_bgl_params_to_boost_parameter >::type&)>::type = bool; typename detail::convert_bgl_params_to_boost_parameter >::type = parameter::aux::arg_list >, adj_list_vertex_property_map >, int, int&, vertex_index_t>, void*, void*&> >, parameter::aux::empty_arg_list, std::integral_constant >]’ ordering.cpp:68:18: required from here /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::Assignable<__gnu_cxx::__normal_iterator > >]’ 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ^ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements > > >]’: /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:233:5: required from ‘struct boost::EqualityComparable<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:502:3: required from ‘struct boost::InputIterator<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:540:3: required from ‘struct boost::ForwardIterator<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:568:3: required from ‘struct boost::BidirectionalIterator<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:597:3: required from ‘struct boost::RandomAccessIterator<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:597:3: [ skipping 6 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/isomorphism.hpp:214:54: required from ‘bool boost::detail::isomorphism_algo::test_isomorphism() [with Graph1 = boost::adjacency_list >; Graph2 = boost::adjacency_list >; IsoMapping = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&>; Invariant1 = boost::degree_vertex_invariant >, int, const int&, boost::vertex_index_t> >, boost::adjacency_list > >; Invariant2 = boost::degree_vertex_invariant >, int, const int&, boost::vertex_index_t> >, boost::adjacency_list > >; IndexMap1 = boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>; IndexMap2 = boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/isomorphism.hpp:532:33: required from ‘bool boost::isomorphism(const Graph1&, const Graph2&, IsoMapping, Invariant1, Invariant2, std::size_t, IndexMap1, IndexMap2) [with Graph1 = adjacency_list >; Graph2 = adjacency_list >; IsoMapping = iterator_property_map<__gnu_cxx::__normal_iterator >, adj_list_vertex_property_map >, int, int&, vertex_index_t>, void*, void*&>; Invariant1 = degree_vertex_invariant >, int, const int&, vertex_index_t> >, adjacency_list > >; Invariant2 = degree_vertex_invariant >, int, const int&, vertex_index_t> >, adjacency_list > >; IndexMap1 = adj_list_vertex_property_map >, int, const int&, vertex_index_t>; IndexMap2 = adj_list_vertex_property_map >, int, const int&, vertex_index_t>; std::size_t = long unsigned int]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/isomorphism.hpp:651:42: required from ‘bool boost::graph::detail::isomorphism_impl::operator()(const Graph1&, const Graph2&, const ArgPack&) const [with ArgPack = boost::parameter::aux::arg_list >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&> >, boost::parameter::aux::empty_arg_list, std::integral_constant >; Graph1 = boost::adjacency_list >; Graph2 = boost::adjacency_list >]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/isomorphism.hpp:662:5: required from ‘typename boost::result_of(Param0, Param1, const ArgPack&)>::type boost::graph::isomorphism_with_named_params(const Param0&, const Param1&, const ArgPack&) [with Param0 = boost::adjacency_list >; Param1 = boost::adjacency_list >; ArgPack = boost::parameter::aux::arg_list >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&> >, boost::parameter::aux::empty_arg_list, std::integral_constant >; typename boost::result_of(Param0, Param1, const ArgPack&)>::type = bool]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/isomorphism.hpp:666:1: required from ‘typename boost::result_of(Param0, Param1, const typename boost::detail::convert_bgl_params_to_boost_parameter >::type&)>::type boost::isomorphism(const Param0&, const Param1&, const bgl_named_params&) [with Param0 = adjacency_list >; Param1 = adjacency_list >; P = iterator_property_map<__gnu_cxx::__normal_iterator >, adj_list_vertex_property_map >, int, int&, vertex_index_t>, void*, void*&>; T = vertex_isomorphism_t; R = no_property; typename result_of(Param0, Param1, const typename detail::convert_bgl_params_to_boost_parameter >::type&)>::type = bool; typename detail::convert_bgl_params_to_boost_parameter >::type = parameter::aux::arg_list >, adj_list_vertex_property_map >, int, int&, vertex_index_t>, void*, void*&> >, parameter::aux::empty_arg_list, std::integral_constant >]’ ordering.cpp:68:18: required from here /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::EqualityComparable<__gnu_cxx::__normal_iterator > >]’ 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ^ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements > > >]’: /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:512:7: required from ‘struct boost::InputIterator<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:540:3: required from ‘struct boost::ForwardIterator<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:568:3: required from ‘struct boost::BidirectionalIterator<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:597:3: required from ‘struct boost::RandomAccessIterator<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:597:3: required from ‘struct boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:32:62: [ skipping 5 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/isomorphism.hpp:214:54: required from ‘bool boost::detail::isomorphism_algo::test_isomorphism() [with Graph1 = boost::adjacency_list >; Graph2 = boost::adjacency_list >; IsoMapping = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&>; Invariant1 = boost::degree_vertex_invariant >, int, const int&, boost::vertex_index_t> >, boost::adjacency_list > >; Invariant2 = boost::degree_vertex_invariant >, int, const int&, boost::vertex_index_t> >, boost::adjacency_list > >; IndexMap1 = boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>; IndexMap2 = boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/isomorphism.hpp:532:33: required from ‘bool boost::isomorphism(const Graph1&, const Graph2&, IsoMapping, Invariant1, Invariant2, std::size_t, IndexMap1, IndexMap2) [with Graph1 = adjacency_list >; Graph2 = adjacency_list >; IsoMapping = iterator_property_map<__gnu_cxx::__normal_iterator >, adj_list_vertex_property_map >, int, int&, vertex_index_t>, void*, void*&>; Invariant1 = degree_vertex_invariant >, int, const int&, vertex_index_t> >, adjacency_list > >; Invariant2 = degree_vertex_invariant >, int, const int&, vertex_index_t> >, adjacency_list > >; IndexMap1 = adj_list_vertex_property_map >, int, const int&, vertex_index_t>; IndexMap2 = adj_list_vertex_property_map >, int, const int&, vertex_index_t>; std::size_t = long unsigned int]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/isomorphism.hpp:651:42: required from ‘bool boost::graph::detail::isomorphism_impl::operator()(const Graph1&, const Graph2&, const ArgPack&) const [with ArgPack = boost::parameter::aux::arg_list >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&> >, boost::parameter::aux::empty_arg_list, std::integral_constant >; Graph1 = boost::adjacency_list >; Graph2 = boost::adjacency_list >]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/isomorphism.hpp:662:5: required from ‘typename boost::result_of(Param0, Param1, const ArgPack&)>::type boost::graph::isomorphism_with_named_params(const Param0&, const Param1&, const ArgPack&) [with Param0 = boost::adjacency_list >; Param1 = boost::adjacency_list >; ArgPack = boost::parameter::aux::arg_list >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&> >, boost::parameter::aux::empty_arg_list, std::integral_constant >; typename boost::result_of(Param0, Param1, const ArgPack&)>::type = bool]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/isomorphism.hpp:666:1: required from ‘typename boost::result_of(Param0, Param1, const typename boost::detail::convert_bgl_params_to_boost_parameter >::type&)>::type boost::isomorphism(const Param0&, const Param1&, const bgl_named_params&) [with Param0 = adjacency_list >; Param1 = adjacency_list >; P = iterator_property_map<__gnu_cxx::__normal_iterator >, adj_list_vertex_property_map >, int, int&, vertex_index_t>, void*, void*&>; T = vertex_isomorphism_t; R = no_property; typename result_of(Param0, Param1, const typename detail::convert_bgl_params_to_boost_parameter >::type&)>::type = bool; typename detail::convert_bgl_params_to_boost_parameter >::type = parameter::aux::arg_list >, adj_list_vertex_property_map >, int, int&, vertex_index_t>, void*, void*&> >, parameter::aux::empty_arg_list, std::integral_constant >]’ ordering.cpp:68:18: required from here /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::InputIterator<__gnu_cxx::__normal_iterator > >]’ 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ^ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements > > >]’: /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:543:7: required from ‘struct boost::ForwardIterator<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:568:3: required from ‘struct boost::BidirectionalIterator<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:597:3: required from ‘struct boost::RandomAccessIterator<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:597:3: required from ‘struct boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator > >]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:42:5: [ skipping 4 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/isomorphism.hpp:214:54: required from ‘bool boost::detail::isomorphism_algo::test_isomorphism() [with Graph1 = boost::adjacency_list >; Graph2 = boost::adjacency_list >; IsoMapping = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&>; Invariant1 = boost::degree_vertex_invariant >, int, const int&, boost::vertex_index_t> >, boost::adjacency_list > >; Invariant2 = boost::degree_vertex_invariant >, int, const int&, boost::vertex_index_t> >, boost::adjacency_list > >; IndexMap1 = boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>; IndexMap2 = boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/isomorphism.hpp:532:33: required from ‘bool boost::isomorphism(const Graph1&, const Graph2&, IsoMapping, Invariant1, Invariant2, std::size_t, IndexMap1, IndexMap2) [with Graph1 = adjacency_list >; Graph2 = adjacency_list >; IsoMapping = iterator_property_map<__gnu_cxx::__normal_iterator >, adj_list_vertex_property_map >, int, int&, vertex_index_t>, void*, void*&>; Invariant1 = degree_vertex_invariant >, int, const int&, vertex_index_t> >, adjacency_list > >; Invariant2 = degree_vertex_invariant >, int, const int&, vertex_index_t> >, adjacency_list > >; IndexMap1 = adj_list_vertex_property_map >, int, const int&, vertex_index_t>; IndexMap2 = adj_list_vertex_property_map >, int, const int&, vertex_index_t>; std::size_t = long unsigned int]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/isomorphism.hpp:651:42: required from ‘bool boost::graph::detail::isomorphism_impl::operator()(const Graph1&, const Graph2&, const ArgPack&) const [with ArgPack = boost::parameter::aux::arg_list >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&> >, boost::parameter::aux::empty_arg_list, std::integral_constant >; Graph1 = boost::adjacency_list >; Graph2 = boost::adjacency_list >]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/isomorphism.hpp:662:5: required from ‘typename boost::result_of(Param0, Param1, const ArgPack&)>::type boost::graph::isomorphism_with_named_params(const Param0&, const Param1&, const ArgPack&) [with Param0 = boost::adjacency_list >; Param1 = boost::adjacency_list >; ArgPack = boost::parameter::aux::arg_list >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&> >, boost::parameter::aux::empty_arg_list, std::integral_constant >; typename boost::result_of(Param0, Param1, const ArgPack&)>::type = bool]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/isomorphism.hpp:666:1: required from ‘typename boost::result_of(Param0, Param1, const typename boost::detail::convert_bgl_params_to_boost_parameter >::type&)>::type boost::isomorphism(const Param0&, const Param1&, const bgl_named_params&) [with Param0 = adjacency_list >; Param1 = adjacency_list >; P = iterator_property_map<__gnu_cxx::__normal_iterator >, adj_list_vertex_property_map >, int, int&, vertex_index_t>, void*, void*&>; T = vertex_isomorphism_t; R = no_property; typename result_of(Param0, Param1, const typename detail::convert_bgl_params_to_boost_parameter >::type&)>::type = bool; typename detail::convert_bgl_params_to_boost_parameter >::type = parameter::aux::arg_list >, adj_list_vertex_property_map >, int, int&, vertex_index_t>, void*, void*&> >, parameter::aux::empty_arg_list, std::integral_constant >]’ ordering.cpp:68:18: required from here /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::ForwardIterator<__gnu_cxx::__normal_iterator > >]’ 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ^ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements > > >]’: /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:571:7: required from ‘struct boost::BidirectionalIterator<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:597:3: required from ‘struct boost::RandomAccessIterator<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:597:3: required from ‘struct boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator > >]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied > > >::value’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:45:51: [ skipping 3 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/isomorphism.hpp:214:54: required from ‘bool boost::detail::isomorphism_algo::test_isomorphism() [with Graph1 = boost::adjacency_list >; Graph2 = boost::adjacency_list >; IsoMapping = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&>; Invariant1 = boost::degree_vertex_invariant >, int, const int&, boost::vertex_index_t> >, boost::adjacency_list > >; Invariant2 = boost::degree_vertex_invariant >, int, const int&, boost::vertex_index_t> >, boost::adjacency_list > >; IndexMap1 = boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>; IndexMap2 = boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/isomorphism.hpp:532:33: required from ‘bool boost::isomorphism(const Graph1&, const Graph2&, IsoMapping, Invariant1, Invariant2, std::size_t, IndexMap1, IndexMap2) [with Graph1 = adjacency_list >; Graph2 = adjacency_list >; IsoMapping = iterator_property_map<__gnu_cxx::__normal_iterator >, adj_list_vertex_property_map >, int, int&, vertex_index_t>, void*, void*&>; Invariant1 = degree_vertex_invariant >, int, const int&, vertex_index_t> >, adjacency_list > >; Invariant2 = degree_vertex_invariant >, int, const int&, vertex_index_t> >, adjacency_list > >; IndexMap1 = adj_list_vertex_property_map >, int, const int&, vertex_index_t>; IndexMap2 = adj_list_vertex_property_map >, int, const int&, vertex_index_t>; std::size_t = long unsigned int]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/isomorphism.hpp:651:42: required from ‘bool boost::graph::detail::isomorphism_impl::operator()(const Graph1&, const Graph2&, const ArgPack&) const [with ArgPack = boost::parameter::aux::arg_list >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&> >, boost::parameter::aux::empty_arg_list, std::integral_constant >; Graph1 = boost::adjacency_list >; Graph2 = boost::adjacency_list >]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/isomorphism.hpp:662:5: required from ‘typename boost::result_of(Param0, Param1, const ArgPack&)>::type boost::graph::isomorphism_with_named_params(const Param0&, const Param1&, const ArgPack&) [with Param0 = boost::adjacency_list >; Param1 = boost::adjacency_list >; ArgPack = boost::parameter::aux::arg_list >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&> >, boost::parameter::aux::empty_arg_list, std::integral_constant >; typename boost::result_of(Param0, Param1, const ArgPack&)>::type = bool]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/isomorphism.hpp:666:1: required from ‘typename boost::result_of(Param0, Param1, const typename boost::detail::convert_bgl_params_to_boost_parameter >::type&)>::type boost::isomorphism(const Param0&, const Param1&, const bgl_named_params&) [with Param0 = adjacency_list >; Param1 = adjacency_list >; P = iterator_property_map<__gnu_cxx::__normal_iterator >, adj_list_vertex_property_map >, int, int&, vertex_index_t>, void*, void*&>; T = vertex_isomorphism_t; R = no_property; typename result_of(Param0, Param1, const typename detail::convert_bgl_params_to_boost_parameter >::type&)>::type = bool; typename detail::convert_bgl_params_to_boost_parameter >::type = parameter::aux::arg_list >, adj_list_vertex_property_map >, int, int&, vertex_index_t>, void*, void*&> >, parameter::aux::empty_arg_list, std::integral_constant >]’ ordering.cpp:68:18: required from here /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::BidirectionalIterator<__gnu_cxx::__normal_iterator > >]’ 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ^ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements > > >]’: /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:253:5: required from ‘struct boost::Comparable<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:597:3: required from ‘struct boost::RandomAccessIterator<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:597:3: required from ‘struct boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator > >]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied > > >::value’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:45:51: [ skipping 3 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/isomorphism.hpp:214:54: required from ‘bool boost::detail::isomorphism_algo::test_isomorphism() [with Graph1 = boost::adjacency_list >; Graph2 = boost::adjacency_list >; IsoMapping = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&>; Invariant1 = boost::degree_vertex_invariant >, int, const int&, boost::vertex_index_t> >, boost::adjacency_list > >; Invariant2 = boost::degree_vertex_invariant >, int, const int&, boost::vertex_index_t> >, boost::adjacency_list > >; IndexMap1 = boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>; IndexMap2 = boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/isomorphism.hpp:532:33: required from ‘bool boost::isomorphism(const Graph1&, const Graph2&, IsoMapping, Invariant1, Invariant2, std::size_t, IndexMap1, IndexMap2) [with Graph1 = adjacency_list >; Graph2 = adjacency_list >; IsoMapping = iterator_property_map<__gnu_cxx::__normal_iterator >, adj_list_vertex_property_map >, int, int&, vertex_index_t>, void*, void*&>; Invariant1 = degree_vertex_invariant >, int, const int&, vertex_index_t> >, adjacency_list > >; Invariant2 = degree_vertex_invariant >, int, const int&, vertex_index_t> >, adjacency_list > >; IndexMap1 = adj_list_vertex_property_map >, int, const int&, vertex_index_t>; IndexMap2 = adj_list_vertex_property_map >, int, const int&, vertex_index_t>; std::size_t = long unsigned int]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/isomorphism.hpp:651:42: required from ‘bool boost::graph::detail::isomorphism_impl::operator()(const Graph1&, const Graph2&, const ArgPack&) const [with ArgPack = boost::parameter::aux::arg_list >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&> >, boost::parameter::aux::empty_arg_list, std::integral_constant >; Graph1 = boost::adjacency_list >; Graph2 = boost::adjacency_list >]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/isomorphism.hpp:662:5: required from ‘typename boost::result_of(Param0, Param1, const ArgPack&)>::type boost::graph::isomorphism_with_named_params(const Param0&, const Param1&, const ArgPack&) [with Param0 = boost::adjacency_list >; Param1 = boost::adjacency_list >; ArgPack = boost::parameter::aux::arg_list >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&> >, boost::parameter::aux::empty_arg_list, std::integral_constant >; typename boost::result_of(Param0, Param1, const ArgPack&)>::type = bool]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/isomorphism.hpp:666:1: required from ‘typename boost::result_of(Param0, Param1, const typename boost::detail::convert_bgl_params_to_boost_parameter >::type&)>::type boost::isomorphism(const Param0&, const Param1&, const bgl_named_params&) [with Param0 = adjacency_list >; Param1 = adjacency_list >; P = iterator_property_map<__gnu_cxx::__normal_iterator >, adj_list_vertex_property_map >, int, int&, vertex_index_t>, void*, void*&>; T = vertex_isomorphism_t; R = no_property; typename result_of(Param0, Param1, const typename detail::convert_bgl_params_to_boost_parameter >::type&)>::type = bool; typename detail::convert_bgl_params_to_boost_parameter >::type = parameter::aux::arg_list >, adj_list_vertex_property_map >, int, int&, vertex_index_t>, void*, void*&> >, parameter::aux::empty_arg_list, std::integral_constant >]’ ordering.cpp:68:18: required from here /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::Comparable<__gnu_cxx::__normal_iterator > >]’ 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ^ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements > > >]’: /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:601:7: required from ‘struct boost::RandomAccessIterator<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:597:3: required from ‘struct boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator > >]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied > > >::value’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied > > >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:72:8: [ skipping 2 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/isomorphism.hpp:214:54: required from ‘bool boost::detail::isomorphism_algo::test_isomorphism() [with Graph1 = boost::adjacency_list >; Graph2 = boost::adjacency_list >; IsoMapping = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&>; Invariant1 = boost::degree_vertex_invariant >, int, const int&, boost::vertex_index_t> >, boost::adjacency_list > >; Invariant2 = boost::degree_vertex_invariant >, int, const int&, boost::vertex_index_t> >, boost::adjacency_list > >; IndexMap1 = boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>; IndexMap2 = boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/isomorphism.hpp:532:33: required from ‘bool boost::isomorphism(const Graph1&, const Graph2&, IsoMapping, Invariant1, Invariant2, std::size_t, IndexMap1, IndexMap2) [with Graph1 = adjacency_list >; Graph2 = adjacency_list >; IsoMapping = iterator_property_map<__gnu_cxx::__normal_iterator >, adj_list_vertex_property_map >, int, int&, vertex_index_t>, void*, void*&>; Invariant1 = degree_vertex_invariant >, int, const int&, vertex_index_t> >, adjacency_list > >; Invariant2 = degree_vertex_invariant >, int, const int&, vertex_index_t> >, adjacency_list > >; IndexMap1 = adj_list_vertex_property_map >, int, const int&, vertex_index_t>; IndexMap2 = adj_list_vertex_property_map >, int, const int&, vertex_index_t>; std::size_t = long unsigned int]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/isomorphism.hpp:651:42: required from ‘bool boost::graph::detail::isomorphism_impl::operator()(const Graph1&, const Graph2&, const ArgPack&) const [with ArgPack = boost::parameter::aux::arg_list >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&> >, boost::parameter::aux::empty_arg_list, std::integral_constant >; Graph1 = boost::adjacency_list >; Graph2 = boost::adjacency_list >]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/isomorphism.hpp:662:5: required from ‘typename boost::result_of(Param0, Param1, const ArgPack&)>::type boost::graph::isomorphism_with_named_params(const Param0&, const Param1&, const ArgPack&) [with Param0 = boost::adjacency_list >; Param1 = boost::adjacency_list >; ArgPack = boost::parameter::aux::arg_list >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&> >, boost::parameter::aux::empty_arg_list, std::integral_constant >; typename boost::result_of(Param0, Param1, const ArgPack&)>::type = bool]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/isomorphism.hpp:666:1: required from ‘typename boost::result_of(Param0, Param1, const typename boost::detail::convert_bgl_params_to_boost_parameter >::type&)>::type boost::isomorphism(const Param0&, const Param1&, const bgl_named_params&) [with Param0 = adjacency_list >; Param1 = adjacency_list >; P = iterator_property_map<__gnu_cxx::__normal_iterator >, adj_list_vertex_property_map >, int, int&, vertex_index_t>, void*, void*&>; T = vertex_isomorphism_t; R = no_property; typename result_of(Param0, Param1, const typename detail::convert_bgl_params_to_boost_parameter >::type&)>::type = bool; typename detail::convert_bgl_params_to_boost_parameter >::type = parameter::aux::arg_list >, adj_list_vertex_property_map >, int, int&, vertex_index_t>, void*, void*&> >, parameter::aux::empty_arg_list, std::integral_constant >]’ ordering.cpp:68:18: required from here /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::RandomAccessIterator<__gnu_cxx::__normal_iterator > >]’ 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ^ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator > >]’: /home/omnipath/local/R/4.4-3.20/BH/include/boost/property_map/property_map.hpp:354:5: required from ‘boost::safe_iterator_property_map >::value_type, typename std::iterator_traits< >::reference> boost::make_safe_iterator_property_map(RAIter, std::size_t, ID) [with RAIter = __gnu_cxx::__normal_iterator >; ID = adj_list_vertex_property_map >, int, const int&, vertex_index_t>; typename std::iterator_traits< >::value_type = int; typename std::iterator_traits< >::reference = int&; std::size_t = long unsigned int]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/isomorphism.hpp:214:54: required from ‘bool boost::detail::isomorphism_algo::test_isomorphism() [with Graph1 = boost::adjacency_list >; Graph2 = boost::adjacency_list >; IsoMapping = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&>; Invariant1 = boost::degree_vertex_invariant >, int, const int&, boost::vertex_index_t> >, boost::adjacency_list > >; Invariant2 = boost::degree_vertex_invariant >, int, const int&, boost::vertex_index_t> >, boost::adjacency_list > >; IndexMap1 = boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>; IndexMap2 = boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/isomorphism.hpp:532:33: required from ‘bool boost::isomorphism(const Graph1&, const Graph2&, IsoMapping, Invariant1, Invariant2, std::size_t, IndexMap1, IndexMap2) [with Graph1 = adjacency_list >; Graph2 = adjacency_list >; IsoMapping = iterator_property_map<__gnu_cxx::__normal_iterator >, adj_list_vertex_property_map >, int, int&, vertex_index_t>, void*, void*&>; Invariant1 = degree_vertex_invariant >, int, const int&, vertex_index_t> >, adjacency_list > >; Invariant2 = degree_vertex_invariant >, int, const int&, vertex_index_t> >, adjacency_list > >; IndexMap1 = adj_list_vertex_property_map >, int, const int&, vertex_index_t>; IndexMap2 = adj_list_vertex_property_map >, int, const int&, vertex_index_t>; std::size_t = long unsigned int]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/isomorphism.hpp:651:42: required from ‘bool boost::graph::detail::isomorphism_impl::operator()(const Graph1&, const Graph2&, const ArgPack&) const [with ArgPack = boost::parameter::aux::arg_list >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&> >, boost::parameter::aux::empty_arg_list, std::integral_constant >; Graph1 = boost::adjacency_list >; Graph2 = boost::adjacency_list >]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/isomorphism.hpp:662:5: required from ‘typename boost::result_of(Param0, Param1, const ArgPack&)>::type boost::graph::isomorphism_with_named_params(const Param0&, const Param1&, const ArgPack&) [with Param0 = boost::adjacency_list >; Param1 = boost::adjacency_list >; ArgPack = boost::parameter::aux::arg_list >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&> >, boost::parameter::aux::empty_arg_list, std::integral_constant >; typename boost::result_of(Param0, Param1, const ArgPack&)>::type = bool]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/isomorphism.hpp:666:1: required from ‘typename boost::result_of(Param0, Param1, const typename boost::detail::convert_bgl_params_to_boost_parameter >::type&)>::type boost::isomorphism(const Param0&, const Param1&, const bgl_named_params&) [with Param0 = adjacency_list >; Param1 = adjacency_list >; P = iterator_property_map<__gnu_cxx::__normal_iterator >, adj_list_vertex_property_map >, int, int&, vertex_index_t>, void*, void*&>; T = vertex_isomorphism_t; R = no_property; typename result_of(Param0, Param1, const typename detail::convert_bgl_params_to_boost_parameter >::type&)>::type = bool; typename detail::convert_bgl_params_to_boost_parameter >::type = parameter::aux::arg_list >, adj_list_vertex_property_map >, int, int&, vertex_index_t>, void*, void*&> >, parameter::aux::empty_arg_list, std::integral_constant >]’ ordering.cpp:68:18: required from here /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:597:17: note: in a call to non-static member function ‘boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator > >::~RandomAccessIteratorConcept()’ 597 | BOOST_concept(RandomAccessIterator,(TT)) | ^~~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/preprocessor/cat.hpp:29:34: note: in definition of macro ‘BOOST_PP_CAT_I’ 29 | # define BOOST_PP_CAT_I(a, b) a ## b | ^ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/concept_def.hpp:23:12: note: in expansion of macro ‘BOOST_PP_CAT’ 23 | struct BOOST_PP_CAT(name,Concept) \ | ^~~~~~~~~~~~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:597:3: note: in expansion of macro ‘BOOST_concept’ 597 | BOOST_concept(RandomAccessIterator,(TT)) | ^~~~~~~~~~~~~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements*, std::vector, std::allocator > > > > >]’: /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:167:5: required from ‘struct boost::CopyConstructible<__gnu_cxx::__normal_iterator*, std::vector, std::allocator > > > >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/range/concepts.hpp:125:16: required from ‘struct boost::range_detail::IncrementableIteratorConcept<__gnu_cxx::__normal_iterator*, std::vector, std::allocator > > > >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/range/concepts.hpp:147:16: required from ‘struct boost::range_detail::SinglePassIteratorConcept<__gnu_cxx::__normal_iterator*, std::vector, std::allocator > > > >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::range_detail::SinglePassIteratorConcept<__gnu_cxx::__normal_iterator*, std::vector, std::allocator > > > >]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied*, std::vector, std::allocator > > > > >::value’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:45:51: [ skipping 11 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/isomorphism.hpp:226:17: required from ‘bool boost::detail::isomorphism_algo::test_isomorphism() [with Graph1 = boost::adjacency_list >; Graph2 = boost::adjacency_list >; IsoMapping = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&>; Invariant1 = boost::degree_vertex_invariant >, int, const int&, boost::vertex_index_t> >, boost::adjacency_list > >; Invariant2 = boost::degree_vertex_invariant >, int, const int&, boost::vertex_index_t> >, boost::adjacency_list > >; IndexMap1 = boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>; IndexMap2 = boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/isomorphism.hpp:532:33: required from ‘bool boost::isomorphism(const Graph1&, const Graph2&, IsoMapping, Invariant1, Invariant2, std::size_t, IndexMap1, IndexMap2) [with Graph1 = adjacency_list >; Graph2 = adjacency_list >; IsoMapping = iterator_property_map<__gnu_cxx::__normal_iterator >, adj_list_vertex_property_map >, int, int&, vertex_index_t>, void*, void*&>; Invariant1 = degree_vertex_invariant >, int, const int&, vertex_index_t> >, adjacency_list > >; Invariant2 = degree_vertex_invariant >, int, const int&, vertex_index_t> >, adjacency_list > >; IndexMap1 = adj_list_vertex_property_map >, int, const int&, vertex_index_t>; IndexMap2 = adj_list_vertex_property_map >, int, const int&, vertex_index_t>; std::size_t = long unsigned int]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/isomorphism.hpp:651:42: required from ‘bool boost::graph::detail::isomorphism_impl::operator()(const Graph1&, const Graph2&, const ArgPack&) const [with ArgPack = boost::parameter::aux::arg_list >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&> >, boost::parameter::aux::empty_arg_list, std::integral_constant >; Graph1 = boost::adjacency_list >; Graph2 = boost::adjacency_list >]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/isomorphism.hpp:662:5: required from ‘typename boost::result_of(Param0, Param1, const ArgPack&)>::type boost::graph::isomorphism_with_named_params(const Param0&, const Param1&, const ArgPack&) [with Param0 = boost::adjacency_list >; Param1 = boost::adjacency_list >; ArgPack = boost::parameter::aux::arg_list >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&> >, boost::parameter::aux::empty_arg_list, std::integral_constant >; typename boost::result_of(Param0, Param1, const ArgPack&)>::type = bool]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/isomorphism.hpp:666:1: required from ‘typename boost::result_of(Param0, Param1, const typename boost::detail::convert_bgl_params_to_boost_parameter >::type&)>::type boost::isomorphism(const Param0&, const Param1&, const bgl_named_params&) [with Param0 = adjacency_list >; Param1 = adjacency_list >; P = iterator_property_map<__gnu_cxx::__normal_iterator >, adj_list_vertex_property_map >, int, int&, vertex_index_t>, void*, void*&>; T = vertex_isomorphism_t; R = no_property; typename result_of(Param0, Param1, const typename detail::convert_bgl_params_to_boost_parameter >::type&)>::type = bool; typename detail::convert_bgl_params_to_boost_parameter >::type = parameter::aux::arg_list >, adj_list_vertex_property_map >, int, int&, vertex_index_t>, void*, void*&> >, parameter::aux::empty_arg_list, std::integral_constant >]’ ordering.cpp:68:18: required from here /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::CopyConstructible<__gnu_cxx::__normal_iterator*, std::vector, std::allocator > > > >]’ 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ^ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements*, std::vector, std::allocator > > > > >]’: /home/omnipath/local/R/4.4-3.20/BH/include/boost/range/concepts.hpp:136:13: required from ‘struct boost::range_detail::IncrementableIteratorConcept<__gnu_cxx::__normal_iterator*, std::vector, std::allocator > > > >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/range/concepts.hpp:147:16: required from ‘struct boost::range_detail::SinglePassIteratorConcept<__gnu_cxx::__normal_iterator*, std::vector, std::allocator > > > >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::range_detail::SinglePassIteratorConcept<__gnu_cxx::__normal_iterator*, std::vector, std::allocator > > > >]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied*, std::vector, std::allocator > > > > >::value’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied*, std::vector, std::allocator > > > > >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:72:8: [ skipping 10 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/isomorphism.hpp:226:17: required from ‘bool boost::detail::isomorphism_algo::test_isomorphism() [with Graph1 = boost::adjacency_list >; Graph2 = boost::adjacency_list >; IsoMapping = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&>; Invariant1 = boost::degree_vertex_invariant >, int, const int&, boost::vertex_index_t> >, boost::adjacency_list > >; Invariant2 = boost::degree_vertex_invariant >, int, const int&, boost::vertex_index_t> >, boost::adjacency_list > >; IndexMap1 = boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>; IndexMap2 = boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/isomorphism.hpp:532:33: required from ‘bool boost::isomorphism(const Graph1&, const Graph2&, IsoMapping, Invariant1, Invariant2, std::size_t, IndexMap1, IndexMap2) [with Graph1 = adjacency_list >; Graph2 = adjacency_list >; IsoMapping = iterator_property_map<__gnu_cxx::__normal_iterator >, adj_list_vertex_property_map >, int, int&, vertex_index_t>, void*, void*&>; Invariant1 = degree_vertex_invariant >, int, const int&, vertex_index_t> >, adjacency_list > >; Invariant2 = degree_vertex_invariant >, int, const int&, vertex_index_t> >, adjacency_list > >; IndexMap1 = adj_list_vertex_property_map >, int, const int&, vertex_index_t>; IndexMap2 = adj_list_vertex_property_map >, int, const int&, vertex_index_t>; std::size_t = long unsigned int]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/isomorphism.hpp:651:42: required from ‘bool boost::graph::detail::isomorphism_impl::operator()(const Graph1&, const Graph2&, const ArgPack&) const [with ArgPack = boost::parameter::aux::arg_list >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&> >, boost::parameter::aux::empty_arg_list, std::integral_constant >; Graph1 = boost::adjacency_list >; Graph2 = boost::adjacency_list >]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/isomorphism.hpp:662:5: required from ‘typename boost::result_of(Param0, Param1, const ArgPack&)>::type boost::graph::isomorphism_with_named_params(const Param0&, const Param1&, const ArgPack&) [with Param0 = boost::adjacency_list >; Param1 = boost::adjacency_list >; ArgPack = boost::parameter::aux::arg_list >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&> >, boost::parameter::aux::empty_arg_list, std::integral_constant >; typename boost::result_of(Param0, Param1, const ArgPack&)>::type = bool]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/isomorphism.hpp:666:1: required from ‘typename boost::result_of(Param0, Param1, const typename boost::detail::convert_bgl_params_to_boost_parameter >::type&)>::type boost::isomorphism(const Param0&, const Param1&, const bgl_named_params&) [with Param0 = adjacency_list >; Param1 = adjacency_list >; P = iterator_property_map<__gnu_cxx::__normal_iterator >, adj_list_vertex_property_map >, int, int&, vertex_index_t>, void*, void*&>; T = vertex_isomorphism_t; R = no_property; typename result_of(Param0, Param1, const typename detail::convert_bgl_params_to_boost_parameter >::type&)>::type = bool; typename detail::convert_bgl_params_to_boost_parameter >::type = parameter::aux::arg_list >, adj_list_vertex_property_map >, int, int&, vertex_index_t>, void*, void*&> >, parameter::aux::empty_arg_list, std::integral_constant >]’ ordering.cpp:68:18: required from here /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::range_detail::IncrementableIteratorConcept<__gnu_cxx::__normal_iterator*, std::vector, std::allocator > > > >]’ 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ^ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements*, std::vector, std::allocator > > > > >]’: /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:233:5: required from ‘struct boost::EqualityComparable<__gnu_cxx::__normal_iterator*, std::vector, std::allocator > > > >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/range/concepts.hpp:147:16: required from ‘struct boost::range_detail::SinglePassIteratorConcept<__gnu_cxx::__normal_iterator*, std::vector, std::allocator > > > >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::range_detail::SinglePassIteratorConcept<__gnu_cxx::__normal_iterator*, std::vector, std::allocator > > > >]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied*, std::vector, std::allocator > > > > >::value’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied*, std::vector, std::allocator > > > > >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:72:8: [ skipping 10 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/isomorphism.hpp:226:17: required from ‘bool boost::detail::isomorphism_algo::test_isomorphism() [with Graph1 = boost::adjacency_list >; Graph2 = boost::adjacency_list >; IsoMapping = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&>; Invariant1 = boost::degree_vertex_invariant >, int, const int&, boost::vertex_index_t> >, boost::adjacency_list > >; Invariant2 = boost::degree_vertex_invariant >, int, const int&, boost::vertex_index_t> >, boost::adjacency_list > >; IndexMap1 = boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>; IndexMap2 = boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/isomorphism.hpp:532:33: required from ‘bool boost::isomorphism(const Graph1&, const Graph2&, IsoMapping, Invariant1, Invariant2, std::size_t, IndexMap1, IndexMap2) [with Graph1 = adjacency_list >; Graph2 = adjacency_list >; IsoMapping = iterator_property_map<__gnu_cxx::__normal_iterator >, adj_list_vertex_property_map >, int, int&, vertex_index_t>, void*, void*&>; Invariant1 = degree_vertex_invariant >, int, const int&, vertex_index_t> >, adjacency_list > >; Invariant2 = degree_vertex_invariant >, int, const int&, vertex_index_t> >, adjacency_list > >; IndexMap1 = adj_list_vertex_property_map >, int, const int&, vertex_index_t>; IndexMap2 = adj_list_vertex_property_map >, int, const int&, vertex_index_t>; std::size_t = long unsigned int]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/isomorphism.hpp:651:42: required from ‘bool boost::graph::detail::isomorphism_impl::operator()(const Graph1&, const Graph2&, const ArgPack&) const [with ArgPack = boost::parameter::aux::arg_list >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&> >, boost::parameter::aux::empty_arg_list, std::integral_constant >; Graph1 = boost::adjacency_list >; Graph2 = boost::adjacency_list >]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/isomorphism.hpp:662:5: required from ‘typename boost::result_of(Param0, Param1, const ArgPack&)>::type boost::graph::isomorphism_with_named_params(const Param0&, const Param1&, const ArgPack&) [with Param0 = boost::adjacency_list >; Param1 = boost::adjacency_list >; ArgPack = boost::parameter::aux::arg_list >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&> >, boost::parameter::aux::empty_arg_list, std::integral_constant >; typename boost::result_of(Param0, Param1, const ArgPack&)>::type = bool]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/isomorphism.hpp:666:1: required from ‘typename boost::result_of(Param0, Param1, const typename boost::detail::convert_bgl_params_to_boost_parameter >::type&)>::type boost::isomorphism(const Param0&, const Param1&, const bgl_named_params&) [with Param0 = adjacency_list >; Param1 = adjacency_list >; P = iterator_property_map<__gnu_cxx::__normal_iterator >, adj_list_vertex_property_map >, int, int&, vertex_index_t>, void*, void*&>; T = vertex_isomorphism_t; R = no_property; typename result_of(Param0, Param1, const typename detail::convert_bgl_params_to_boost_parameter >::type&)>::type = bool; typename detail::convert_bgl_params_to_boost_parameter >::type = parameter::aux::arg_list >, adj_list_vertex_property_map >, int, int&, vertex_index_t>, void*, void*&> >, parameter::aux::empty_arg_list, std::integral_constant >]’ ordering.cpp:68:18: required from here /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::EqualityComparable<__gnu_cxx::__normal_iterator*, std::vector, std::allocator > > > >]’ 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ^ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements*, std::vector, std::allocator > > > > >]’: /home/omnipath/local/R/4.4-3.20/BH/include/boost/range/concepts.hpp:158:13: required from ‘struct boost::range_detail::SinglePassIteratorConcept<__gnu_cxx::__normal_iterator*, std::vector, std::allocator > > > >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::range_detail::SinglePassIteratorConcept<__gnu_cxx::__normal_iterator*, std::vector, std::allocator > > > >]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied*, std::vector, std::allocator > > > > >::value’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied*, std::vector, std::allocator > > > > >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_*, std::vector, std::allocator > > > >)>’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/range/concepts.hpp:278:9: [ skipping 9 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/isomorphism.hpp:226:17: required from ‘bool boost::detail::isomorphism_algo::test_isomorphism() [with Graph1 = boost::adjacency_list >; Graph2 = boost::adjacency_list >; IsoMapping = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&>; Invariant1 = boost::degree_vertex_invariant >, int, const int&, boost::vertex_index_t> >, boost::adjacency_list > >; Invariant2 = boost::degree_vertex_invariant >, int, const int&, boost::vertex_index_t> >, boost::adjacency_list > >; IndexMap1 = boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>; IndexMap2 = boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/isomorphism.hpp:532:33: required from ‘bool boost::isomorphism(const Graph1&, const Graph2&, IsoMapping, Invariant1, Invariant2, std::size_t, IndexMap1, IndexMap2) [with Graph1 = adjacency_list >; Graph2 = adjacency_list >; IsoMapping = iterator_property_map<__gnu_cxx::__normal_iterator >, adj_list_vertex_property_map >, int, int&, vertex_index_t>, void*, void*&>; Invariant1 = degree_vertex_invariant >, int, const int&, vertex_index_t> >, adjacency_list > >; Invariant2 = degree_vertex_invariant >, int, const int&, vertex_index_t> >, adjacency_list > >; IndexMap1 = adj_list_vertex_property_map >, int, const int&, vertex_index_t>; IndexMap2 = adj_list_vertex_property_map >, int, const int&, vertex_index_t>; std::size_t = long unsigned int]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/isomorphism.hpp:651:42: required from ‘bool boost::graph::detail::isomorphism_impl::operator()(const Graph1&, const Graph2&, const ArgPack&) const [with ArgPack = boost::parameter::aux::arg_list >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&> >, boost::parameter::aux::empty_arg_list, std::integral_constant >; Graph1 = boost::adjacency_list >; Graph2 = boost::adjacency_list >]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/isomorphism.hpp:662:5: required from ‘typename boost::result_of(Param0, Param1, const ArgPack&)>::type boost::graph::isomorphism_with_named_params(const Param0&, const Param1&, const ArgPack&) [with Param0 = boost::adjacency_list >; Param1 = boost::adjacency_list >; ArgPack = boost::parameter::aux::arg_list >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&> >, boost::parameter::aux::empty_arg_list, std::integral_constant >; typename boost::result_of(Param0, Param1, const ArgPack&)>::type = bool]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/isomorphism.hpp:666:1: required from ‘typename boost::result_of(Param0, Param1, const typename boost::detail::convert_bgl_params_to_boost_parameter >::type&)>::type boost::isomorphism(const Param0&, const Param1&, const bgl_named_params&) [with Param0 = adjacency_list >; Param1 = adjacency_list >; P = iterator_property_map<__gnu_cxx::__normal_iterator >, adj_list_vertex_property_map >, int, int&, vertex_index_t>, void*, void*&>; T = vertex_isomorphism_t; R = no_property; typename result_of(Param0, Param1, const typename detail::convert_bgl_params_to_boost_parameter >::type&)>::type = bool; typename detail::convert_bgl_params_to_boost_parameter >::type = parameter::aux::arg_list >, adj_list_vertex_property_map >, int, int&, vertex_index_t>, void*, void*&> >, parameter::aux::empty_arg_list, std::integral_constant >]’ ordering.cpp:68:18: required from here /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::range_detail::SinglePassIteratorConcept<__gnu_cxx::__normal_iterator*, std::vector, std::allocator > > > >]’ 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ^ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::range_detail::SinglePassIteratorConcept<__gnu_cxx::__normal_iterator*, std::vector, std::allocator > > > >]’: /home/omnipath/local/R/4.4-3.20/BH/include/boost/range/concepts.hpp:278:9: required from ‘struct boost::SinglePassRangeConcept, std::allocator > > >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/range/concepts.hpp:318:12: required from ‘struct boost::ForwardRangeConcept, std::allocator > > >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/range/concepts.hpp:352:12: required from ‘struct boost::BidirectionalRangeConcept, std::allocator > > >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/range/concepts.hpp:370:12: required from ‘struct boost::RandomAccessRangeConcept, std::allocator > > >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::RandomAccessRangeConcept, std::allocator > > >]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:42:5: [ skipping 4 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/isomorphism.hpp:226:17: required from ‘bool boost::detail::isomorphism_algo::test_isomorphism() [with Graph1 = boost::adjacency_list >; Graph2 = boost::adjacency_list >; IsoMapping = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&>; Invariant1 = boost::degree_vertex_invariant >, int, const int&, boost::vertex_index_t> >, boost::adjacency_list > >; Invariant2 = boost::degree_vertex_invariant >, int, const int&, boost::vertex_index_t> >, boost::adjacency_list > >; IndexMap1 = boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>; IndexMap2 = boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/isomorphism.hpp:532:33: required from ‘bool boost::isomorphism(const Graph1&, const Graph2&, IsoMapping, Invariant1, Invariant2, std::size_t, IndexMap1, IndexMap2) [with Graph1 = adjacency_list >; Graph2 = adjacency_list >; IsoMapping = iterator_property_map<__gnu_cxx::__normal_iterator >, adj_list_vertex_property_map >, int, int&, vertex_index_t>, void*, void*&>; Invariant1 = degree_vertex_invariant >, int, const int&, vertex_index_t> >, adjacency_list > >; Invariant2 = degree_vertex_invariant >, int, const int&, vertex_index_t> >, adjacency_list > >; IndexMap1 = adj_list_vertex_property_map >, int, const int&, vertex_index_t>; IndexMap2 = adj_list_vertex_property_map >, int, const int&, vertex_index_t>; std::size_t = long unsigned int]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/isomorphism.hpp:651:42: required from ‘bool boost::graph::detail::isomorphism_impl::operator()(const Graph1&, const Graph2&, const ArgPack&) const [with ArgPack = boost::parameter::aux::arg_list >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&> >, boost::parameter::aux::empty_arg_list, std::integral_constant >; Graph1 = boost::adjacency_list >; Graph2 = boost::adjacency_list >]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/isomorphism.hpp:662:5: required from ‘typename boost::result_of(Param0, Param1, const ArgPack&)>::type boost::graph::isomorphism_with_named_params(const Param0&, const Param1&, const ArgPack&) [with Param0 = boost::adjacency_list >; Param1 = boost::adjacency_list >; ArgPack = boost::parameter::aux::arg_list >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&> >, boost::parameter::aux::empty_arg_list, std::integral_constant >; typename boost::result_of(Param0, Param1, const ArgPack&)>::type = bool]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/isomorphism.hpp:666:1: required from ‘typename boost::result_of(Param0, Param1, const typename boost::detail::convert_bgl_params_to_boost_parameter >::type&)>::type boost::isomorphism(const Param0&, const Param1&, const bgl_named_params&) [with Param0 = adjacency_list >; Param1 = adjacency_list >; P = iterator_property_map<__gnu_cxx::__normal_iterator >, adj_list_vertex_property_map >, int, int&, vertex_index_t>, void*, void*&>; T = vertex_isomorphism_t; R = no_property; typename result_of(Param0, Param1, const typename detail::convert_bgl_params_to_boost_parameter >::type&)>::type = bool; typename detail::convert_bgl_params_to_boost_parameter >::type = parameter::aux::arg_list >, adj_list_vertex_property_map >, int, int&, vertex_index_t>, void*, void*&> >, parameter::aux::empty_arg_list, std::integral_constant >]’ ordering.cpp:68:18: required from here /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::range_detail::SinglePassIteratorConcept::~SinglePassIteratorConcept() [with Iterator = __gnu_cxx::__normal_iterator*, std::vector, std::allocator > > >]’ 37 | ~model() | ^ /home/omnipath/local/R/4.4-3.20/BH/include/boost/range/concepts.hpp:158:13: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 158 | BOOST_CONCEPT_USAGE(SinglePassIteratorConcept) | ^~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements*, std::vector, std::allocator > > > > >]’: /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:167:5: required from ‘struct boost::CopyConstructible<__gnu_cxx::__normal_iterator*, std::vector, std::allocator > > > >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/range/concepts.hpp:125:16: required from ‘struct boost::range_detail::IncrementableIteratorConcept<__gnu_cxx::__normal_iterator*, std::vector, std::allocator > > > >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/range/concepts.hpp:147:16: required from ‘struct boost::range_detail::SinglePassIteratorConcept<__gnu_cxx::__normal_iterator*, std::vector, std::allocator > > > >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::range_detail::SinglePassIteratorConcept<__gnu_cxx::__normal_iterator*, std::vector, std::allocator > > > >]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied*, std::vector, std::allocator > > > > >::value’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:45:51: [ skipping 11 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/isomorphism.hpp:226:17: required from ‘bool boost::detail::isomorphism_algo::test_isomorphism() [with Graph1 = boost::adjacency_list >; Graph2 = boost::adjacency_list >; IsoMapping = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&>; Invariant1 = boost::degree_vertex_invariant >, int, const int&, boost::vertex_index_t> >, boost::adjacency_list > >; Invariant2 = boost::degree_vertex_invariant >, int, const int&, boost::vertex_index_t> >, boost::adjacency_list > >; IndexMap1 = boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>; IndexMap2 = boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/isomorphism.hpp:532:33: required from ‘bool boost::isomorphism(const Graph1&, const Graph2&, IsoMapping, Invariant1, Invariant2, std::size_t, IndexMap1, IndexMap2) [with Graph1 = adjacency_list >; Graph2 = adjacency_list >; IsoMapping = iterator_property_map<__gnu_cxx::__normal_iterator >, adj_list_vertex_property_map >, int, int&, vertex_index_t>, void*, void*&>; Invariant1 = degree_vertex_invariant >, int, const int&, vertex_index_t> >, adjacency_list > >; Invariant2 = degree_vertex_invariant >, int, const int&, vertex_index_t> >, adjacency_list > >; IndexMap1 = adj_list_vertex_property_map >, int, const int&, vertex_index_t>; IndexMap2 = adj_list_vertex_property_map >, int, const int&, vertex_index_t>; std::size_t = long unsigned int]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/isomorphism.hpp:651:42: required from ‘bool boost::graph::detail::isomorphism_impl::operator()(const Graph1&, const Graph2&, const ArgPack&) const [with ArgPack = boost::parameter::aux::arg_list >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&> >, boost::parameter::aux::empty_arg_list, std::integral_constant >; Graph1 = boost::adjacency_list >; Graph2 = boost::adjacency_list >]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/isomorphism.hpp:662:5: required from ‘typename boost::result_of(Param0, Param1, const ArgPack&)>::type boost::graph::isomorphism_with_named_params(const Param0&, const Param1&, const ArgPack&) [with Param0 = boost::adjacency_list >; Param1 = boost::adjacency_list >; ArgPack = boost::parameter::aux::arg_list >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&> >, boost::parameter::aux::empty_arg_list, std::integral_constant >; typename boost::result_of(Param0, Param1, const ArgPack&)>::type = bool]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/isomorphism.hpp:666:1: required from ‘typename boost::result_of(Param0, Param1, const typename boost::detail::convert_bgl_params_to_boost_parameter >::type&)>::type boost::isomorphism(const Param0&, const Param1&, const bgl_named_params&) [with Param0 = adjacency_list >; Param1 = adjacency_list >; P = iterator_property_map<__gnu_cxx::__normal_iterator >, adj_list_vertex_property_map >, int, int&, vertex_index_t>, void*, void*&>; T = vertex_isomorphism_t; R = no_property; typename result_of(Param0, Param1, const typename detail::convert_bgl_params_to_boost_parameter >::type&)>::type = bool; typename detail::convert_bgl_params_to_boost_parameter >::type = parameter::aux::arg_list >, adj_list_vertex_property_map >, int, int&, vertex_index_t>, void*, void*&> >, parameter::aux::empty_arg_list, std::integral_constant >]’ ordering.cpp:68:18: required from here /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::CopyConstructible<__gnu_cxx::__normal_iterator*, std::vector, std::allocator > > > >]’ 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ^ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements*, std::vector, std::allocator > > > > >]’: /home/omnipath/local/R/4.4-3.20/BH/include/boost/range/concepts.hpp:136:13: required from ‘struct boost::range_detail::IncrementableIteratorConcept<__gnu_cxx::__normal_iterator*, std::vector, std::allocator > > > >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/range/concepts.hpp:147:16: required from ‘struct boost::range_detail::SinglePassIteratorConcept<__gnu_cxx::__normal_iterator*, std::vector, std::allocator > > > >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::range_detail::SinglePassIteratorConcept<__gnu_cxx::__normal_iterator*, std::vector, std::allocator > > > >]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied*, std::vector, std::allocator > > > > >::value’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied*, std::vector, std::allocator > > > > >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:72:8: [ skipping 10 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/isomorphism.hpp:226:17: required from ‘bool boost::detail::isomorphism_algo::test_isomorphism() [with Graph1 = boost::adjacency_list >; Graph2 = boost::adjacency_list >; IsoMapping = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&>; Invariant1 = boost::degree_vertex_invariant >, int, const int&, boost::vertex_index_t> >, boost::adjacency_list > >; Invariant2 = boost::degree_vertex_invariant >, int, const int&, boost::vertex_index_t> >, boost::adjacency_list > >; IndexMap1 = boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>; IndexMap2 = boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/isomorphism.hpp:532:33: required from ‘bool boost::isomorphism(const Graph1&, const Graph2&, IsoMapping, Invariant1, Invariant2, std::size_t, IndexMap1, IndexMap2) [with Graph1 = adjacency_list >; Graph2 = adjacency_list >; IsoMapping = iterator_property_map<__gnu_cxx::__normal_iterator >, adj_list_vertex_property_map >, int, int&, vertex_index_t>, void*, void*&>; Invariant1 = degree_vertex_invariant >, int, const int&, vertex_index_t> >, adjacency_list > >; Invariant2 = degree_vertex_invariant >, int, const int&, vertex_index_t> >, adjacency_list > >; IndexMap1 = adj_list_vertex_property_map >, int, const int&, vertex_index_t>; IndexMap2 = adj_list_vertex_property_map >, int, const int&, vertex_index_t>; std::size_t = long unsigned int]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/isomorphism.hpp:651:42: required from ‘bool boost::graph::detail::isomorphism_impl::operator()(const Graph1&, const Graph2&, const ArgPack&) const [with ArgPack = boost::parameter::aux::arg_list >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&> >, boost::parameter::aux::empty_arg_list, std::integral_constant >; Graph1 = boost::adjacency_list >; Graph2 = boost::adjacency_list >]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/isomorphism.hpp:662:5: required from ‘typename boost::result_of(Param0, Param1, const ArgPack&)>::type boost::graph::isomorphism_with_named_params(const Param0&, const Param1&, const ArgPack&) [with Param0 = boost::adjacency_list >; Param1 = boost::adjacency_list >; ArgPack = boost::parameter::aux::arg_list >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&> >, boost::parameter::aux::empty_arg_list, std::integral_constant >; typename boost::result_of(Param0, Param1, const ArgPack&)>::type = bool]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/isomorphism.hpp:666:1: required from ‘typename boost::result_of(Param0, Param1, const typename boost::detail::convert_bgl_params_to_boost_parameter >::type&)>::type boost::isomorphism(const Param0&, const Param1&, const bgl_named_params&) [with Param0 = adjacency_list >; Param1 = adjacency_list >; P = iterator_property_map<__gnu_cxx::__normal_iterator >, adj_list_vertex_property_map >, int, int&, vertex_index_t>, void*, void*&>; T = vertex_isomorphism_t; R = no_property; typename result_of(Param0, Param1, const typename detail::convert_bgl_params_to_boost_parameter >::type&)>::type = bool; typename detail::convert_bgl_params_to_boost_parameter >::type = parameter::aux::arg_list >, adj_list_vertex_property_map >, int, int&, vertex_index_t>, void*, void*&> >, parameter::aux::empty_arg_list, std::integral_constant >]’ ordering.cpp:68:18: required from here /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::range_detail::IncrementableIteratorConcept<__gnu_cxx::__normal_iterator*, std::vector, std::allocator > > > >]’ 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ^ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements*, std::vector, std::allocator > > > > >]’: /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:233:5: required from ‘struct boost::EqualityComparable<__gnu_cxx::__normal_iterator*, std::vector, std::allocator > > > >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/range/concepts.hpp:147:16: required from ‘struct boost::range_detail::SinglePassIteratorConcept<__gnu_cxx::__normal_iterator*, std::vector, std::allocator > > > >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::range_detail::SinglePassIteratorConcept<__gnu_cxx::__normal_iterator*, std::vector, std::allocator > > > >]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied*, std::vector, std::allocator > > > > >::value’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied*, std::vector, std::allocator > > > > >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:72:8: [ skipping 10 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/isomorphism.hpp:226:17: required from ‘bool boost::detail::isomorphism_algo::test_isomorphism() [with Graph1 = boost::adjacency_list >; Graph2 = boost::adjacency_list >; IsoMapping = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&>; Invariant1 = boost::degree_vertex_invariant >, int, const int&, boost::vertex_index_t> >, boost::adjacency_list > >; Invariant2 = boost::degree_vertex_invariant >, int, const int&, boost::vertex_index_t> >, boost::adjacency_list > >; IndexMap1 = boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>; IndexMap2 = boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/isomorphism.hpp:532:33: required from ‘bool boost::isomorphism(const Graph1&, const Graph2&, IsoMapping, Invariant1, Invariant2, std::size_t, IndexMap1, IndexMap2) [with Graph1 = adjacency_list >; Graph2 = adjacency_list >; IsoMapping = iterator_property_map<__gnu_cxx::__normal_iterator >, adj_list_vertex_property_map >, int, int&, vertex_index_t>, void*, void*&>; Invariant1 = degree_vertex_invariant >, int, const int&, vertex_index_t> >, adjacency_list > >; Invariant2 = degree_vertex_invariant >, int, const int&, vertex_index_t> >, adjacency_list > >; IndexMap1 = adj_list_vertex_property_map >, int, const int&, vertex_index_t>; IndexMap2 = adj_list_vertex_property_map >, int, const int&, vertex_index_t>; std::size_t = long unsigned int]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/isomorphism.hpp:651:42: required from ‘bool boost::graph::detail::isomorphism_impl::operator()(const Graph1&, const Graph2&, const ArgPack&) const [with ArgPack = boost::parameter::aux::arg_list >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&> >, boost::parameter::aux::empty_arg_list, std::integral_constant >; Graph1 = boost::adjacency_list >; Graph2 = boost::adjacency_list >]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/isomorphism.hpp:662:5: required from ‘typename boost::result_of(Param0, Param1, const ArgPack&)>::type boost::graph::isomorphism_with_named_params(const Param0&, const Param1&, const ArgPack&) [with Param0 = boost::adjacency_list >; Param1 = boost::adjacency_list >; ArgPack = boost::parameter::aux::arg_list >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&> >, boost::parameter::aux::empty_arg_list, std::integral_constant >; typename boost::result_of(Param0, Param1, const ArgPack&)>::type = bool]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/isomorphism.hpp:666:1: required from ‘typename boost::result_of(Param0, Param1, const typename boost::detail::convert_bgl_params_to_boost_parameter >::type&)>::type boost::isomorphism(const Param0&, const Param1&, const bgl_named_params&) [with Param0 = adjacency_list >; Param1 = adjacency_list >; P = iterator_property_map<__gnu_cxx::__normal_iterator >, adj_list_vertex_property_map >, int, int&, vertex_index_t>, void*, void*&>; T = vertex_isomorphism_t; R = no_property; typename result_of(Param0, Param1, const typename detail::convert_bgl_params_to_boost_parameter >::type&)>::type = bool; typename detail::convert_bgl_params_to_boost_parameter >::type = parameter::aux::arg_list >, adj_list_vertex_property_map >, int, int&, vertex_index_t>, void*, void*&> >, parameter::aux::empty_arg_list, std::integral_constant >]’ ordering.cpp:68:18: required from here /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::EqualityComparable<__gnu_cxx::__normal_iterator*, std::vector, std::allocator > > > >]’ 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ^ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements*, std::vector, std::allocator > > > > >]’: /home/omnipath/local/R/4.4-3.20/BH/include/boost/range/concepts.hpp:158:13: required from ‘struct boost::range_detail::SinglePassIteratorConcept<__gnu_cxx::__normal_iterator*, std::vector, std::allocator > > > >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::range_detail::SinglePassIteratorConcept<__gnu_cxx::__normal_iterator*, std::vector, std::allocator > > > >]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied*, std::vector, std::allocator > > > > >::value’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied*, std::vector, std::allocator > > > > >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_*, std::vector, std::allocator > > > >)>’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/range/concepts.hpp:281:9: [ skipping 9 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/isomorphism.hpp:226:17: required from ‘bool boost::detail::isomorphism_algo::test_isomorphism() [with Graph1 = boost::adjacency_list >; Graph2 = boost::adjacency_list >; IsoMapping = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&>; Invariant1 = boost::degree_vertex_invariant >, int, const int&, boost::vertex_index_t> >, boost::adjacency_list > >; Invariant2 = boost::degree_vertex_invariant >, int, const int&, boost::vertex_index_t> >, boost::adjacency_list > >; IndexMap1 = boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>; IndexMap2 = boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/isomorphism.hpp:532:33: required from ‘bool boost::isomorphism(const Graph1&, const Graph2&, IsoMapping, Invariant1, Invariant2, std::size_t, IndexMap1, IndexMap2) [with Graph1 = adjacency_list >; Graph2 = adjacency_list >; IsoMapping = iterator_property_map<__gnu_cxx::__normal_iterator >, adj_list_vertex_property_map >, int, int&, vertex_index_t>, void*, void*&>; Invariant1 = degree_vertex_invariant >, int, const int&, vertex_index_t> >, adjacency_list > >; Invariant2 = degree_vertex_invariant >, int, const int&, vertex_index_t> >, adjacency_list > >; IndexMap1 = adj_list_vertex_property_map >, int, const int&, vertex_index_t>; IndexMap2 = adj_list_vertex_property_map >, int, const int&, vertex_index_t>; std::size_t = long unsigned int]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/isomorphism.hpp:651:42: required from ‘bool boost::graph::detail::isomorphism_impl::operator()(const Graph1&, const Graph2&, const ArgPack&) const [with ArgPack = boost::parameter::aux::arg_list >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&> >, boost::parameter::aux::empty_arg_list, std::integral_constant >; Graph1 = boost::adjacency_list >; Graph2 = boost::adjacency_list >]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/isomorphism.hpp:662:5: required from ‘typename boost::result_of(Param0, Param1, const ArgPack&)>::type boost::graph::isomorphism_with_named_params(const Param0&, const Param1&, const ArgPack&) [with Param0 = boost::adjacency_list >; Param1 = boost::adjacency_list >; ArgPack = boost::parameter::aux::arg_list >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&> >, boost::parameter::aux::empty_arg_list, std::integral_constant >; typename boost::result_of(Param0, Param1, const ArgPack&)>::type = bool]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/isomorphism.hpp:666:1: required from ‘typename boost::result_of(Param0, Param1, const typename boost::detail::convert_bgl_params_to_boost_parameter >::type&)>::type boost::isomorphism(const Param0&, const Param1&, const bgl_named_params&) [with Param0 = adjacency_list >; Param1 = adjacency_list >; P = iterator_property_map<__gnu_cxx::__normal_iterator >, adj_list_vertex_property_map >, int, int&, vertex_index_t>, void*, void*&>; T = vertex_isomorphism_t; R = no_property; typename result_of(Param0, Param1, const typename detail::convert_bgl_params_to_boost_parameter >::type&)>::type = bool; typename detail::convert_bgl_params_to_boost_parameter >::type = parameter::aux::arg_list >, adj_list_vertex_property_map >, int, int&, vertex_index_t>, void*, void*&> >, parameter::aux::empty_arg_list, std::integral_constant >]’ ordering.cpp:68:18: required from here /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::range_detail::SinglePassIteratorConcept<__gnu_cxx::__normal_iterator*, std::vector, std::allocator > > > >]’ 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ^ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::range_detail::SinglePassIteratorConcept<__gnu_cxx::__normal_iterator*, std::vector, std::allocator > > > >]’: /home/omnipath/local/R/4.4-3.20/BH/include/boost/range/concepts.hpp:281:9: required from ‘struct boost::SinglePassRangeConcept, std::allocator > > >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/range/concepts.hpp:318:12: required from ‘struct boost::ForwardRangeConcept, std::allocator > > >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/range/concepts.hpp:352:12: required from ‘struct boost::BidirectionalRangeConcept, std::allocator > > >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/range/concepts.hpp:370:12: required from ‘struct boost::RandomAccessRangeConcept, std::allocator > > >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::RandomAccessRangeConcept, std::allocator > > >]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:42:5: [ skipping 4 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/isomorphism.hpp:226:17: required from ‘bool boost::detail::isomorphism_algo::test_isomorphism() [with Graph1 = boost::adjacency_list >; Graph2 = boost::adjacency_list >; IsoMapping = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&>; Invariant1 = boost::degree_vertex_invariant >, int, const int&, boost::vertex_index_t> >, boost::adjacency_list > >; Invariant2 = boost::degree_vertex_invariant >, int, const int&, boost::vertex_index_t> >, boost::adjacency_list > >; IndexMap1 = boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>; IndexMap2 = boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/isomorphism.hpp:532:33: required from ‘bool boost::isomorphism(const Graph1&, const Graph2&, IsoMapping, Invariant1, Invariant2, std::size_t, IndexMap1, IndexMap2) [with Graph1 = adjacency_list >; Graph2 = adjacency_list >; IsoMapping = iterator_property_map<__gnu_cxx::__normal_iterator >, adj_list_vertex_property_map >, int, int&, vertex_index_t>, void*, void*&>; Invariant1 = degree_vertex_invariant >, int, const int&, vertex_index_t> >, adjacency_list > >; Invariant2 = degree_vertex_invariant >, int, const int&, vertex_index_t> >, adjacency_list > >; IndexMap1 = adj_list_vertex_property_map >, int, const int&, vertex_index_t>; IndexMap2 = adj_list_vertex_property_map >, int, const int&, vertex_index_t>; std::size_t = long unsigned int]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/isomorphism.hpp:651:42: required from ‘bool boost::graph::detail::isomorphism_impl::operator()(const Graph1&, const Graph2&, const ArgPack&) const [with ArgPack = boost::parameter::aux::arg_list >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&> >, boost::parameter::aux::empty_arg_list, std::integral_constant >; Graph1 = boost::adjacency_list >; Graph2 = boost::adjacency_list >]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/isomorphism.hpp:662:5: required from ‘typename boost::result_of(Param0, Param1, const ArgPack&)>::type boost::graph::isomorphism_with_named_params(const Param0&, const Param1&, const ArgPack&) [with Param0 = boost::adjacency_list >; Param1 = boost::adjacency_list >; ArgPack = boost::parameter::aux::arg_list >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&> >, boost::parameter::aux::empty_arg_list, std::integral_constant >; typename boost::result_of(Param0, Param1, const ArgPack&)>::type = bool]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/isomorphism.hpp:666:1: required from ‘typename boost::result_of(Param0, Param1, const typename boost::detail::convert_bgl_params_to_boost_parameter >::type&)>::type boost::isomorphism(const Param0&, const Param1&, const bgl_named_params&) [with Param0 = adjacency_list >; Param1 = adjacency_list >; P = iterator_property_map<__gnu_cxx::__normal_iterator >, adj_list_vertex_property_map >, int, int&, vertex_index_t>, void*, void*&>; T = vertex_isomorphism_t; R = no_property; typename result_of(Param0, Param1, const typename detail::convert_bgl_params_to_boost_parameter >::type&)>::type = bool; typename detail::convert_bgl_params_to_boost_parameter >::type = parameter::aux::arg_list >, adj_list_vertex_property_map >, int, int&, vertex_index_t>, void*, void*&> >, parameter::aux::empty_arg_list, std::integral_constant >]’ ordering.cpp:68:18: required from here /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::range_detail::SinglePassIteratorConcept::~SinglePassIteratorConcept() [with Iterator = __gnu_cxx::__normal_iterator*, std::vector, std::allocator > > >]’ 37 | ~model() | ^ /home/omnipath/local/R/4.4-3.20/BH/include/boost/range/concepts.hpp:158:13: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 158 | BOOST_CONCEPT_USAGE(SinglePassIteratorConcept) | ^~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements, std::allocator > > > >]’: /home/omnipath/local/R/4.4-3.20/BH/include/boost/range/concepts.hpp:284:9: required from ‘struct boost::SinglePassRangeConcept, std::allocator > > >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/range/concepts.hpp:318:12: required from ‘struct boost::ForwardRangeConcept, std::allocator > > >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/range/concepts.hpp:352:12: required from ‘struct boost::BidirectionalRangeConcept, std::allocator > > >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/range/concepts.hpp:370:12: required from ‘struct boost::RandomAccessRangeConcept, std::allocator > > >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::RandomAccessRangeConcept, std::allocator > > >]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:42:5: [ skipping 4 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/isomorphism.hpp:226:17: required from ‘bool boost::detail::isomorphism_algo::test_isomorphism() [with Graph1 = boost::adjacency_list >; Graph2 = boost::adjacency_list >; IsoMapping = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&>; Invariant1 = boost::degree_vertex_invariant >, int, const int&, boost::vertex_index_t> >, boost::adjacency_list > >; Invariant2 = boost::degree_vertex_invariant >, int, const int&, boost::vertex_index_t> >, boost::adjacency_list > >; IndexMap1 = boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>; IndexMap2 = boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/isomorphism.hpp:532:33: required from ‘bool boost::isomorphism(const Graph1&, const Graph2&, IsoMapping, Invariant1, Invariant2, std::size_t, IndexMap1, IndexMap2) [with Graph1 = adjacency_list >; Graph2 = adjacency_list >; IsoMapping = iterator_property_map<__gnu_cxx::__normal_iterator >, adj_list_vertex_property_map >, int, int&, vertex_index_t>, void*, void*&>; Invariant1 = degree_vertex_invariant >, int, const int&, vertex_index_t> >, adjacency_list > >; Invariant2 = degree_vertex_invariant >, int, const int&, vertex_index_t> >, adjacency_list > >; IndexMap1 = adj_list_vertex_property_map >, int, const int&, vertex_index_t>; IndexMap2 = adj_list_vertex_property_map >, int, const int&, vertex_index_t>; std::size_t = long unsigned int]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/isomorphism.hpp:651:42: required from ‘bool boost::graph::detail::isomorphism_impl::operator()(const Graph1&, const Graph2&, const ArgPack&) const [with ArgPack = boost::parameter::aux::arg_list >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&> >, boost::parameter::aux::empty_arg_list, std::integral_constant >; Graph1 = boost::adjacency_list >; Graph2 = boost::adjacency_list >]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/isomorphism.hpp:662:5: required from ‘typename boost::result_of(Param0, Param1, const ArgPack&)>::type boost::graph::isomorphism_with_named_params(const Param0&, const Param1&, const ArgPack&) [with Param0 = boost::adjacency_list >; Param1 = boost::adjacency_list >; ArgPack = boost::parameter::aux::arg_list >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&> >, boost::parameter::aux::empty_arg_list, std::integral_constant >; typename boost::result_of(Param0, Param1, const ArgPack&)>::type = bool]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/isomorphism.hpp:666:1: required from ‘typename boost::result_of(Param0, Param1, const typename boost::detail::convert_bgl_params_to_boost_parameter >::type&)>::type boost::isomorphism(const Param0&, const Param1&, const bgl_named_params&) [with Param0 = adjacency_list >; Param1 = adjacency_list >; P = iterator_property_map<__gnu_cxx::__normal_iterator >, adj_list_vertex_property_map >, int, int&, vertex_index_t>, void*, void*&>; T = vertex_isomorphism_t; R = no_property; typename result_of(Param0, Param1, const typename detail::convert_bgl_params_to_boost_parameter >::type&)>::type = bool; typename detail::convert_bgl_params_to_boost_parameter >::type = parameter::aux::arg_list >, adj_list_vertex_property_map >, int, int&, vertex_index_t>, void*, void*&> >, parameter::aux::empty_arg_list, std::integral_constant >]’ ordering.cpp:68:18: required from here /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::SinglePassRangeConcept, std::allocator > > >]’ 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ^ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements*, std::vector, std::allocator > > > > >]’: /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:137:5: required from ‘struct boost::DefaultConstructible<__gnu_cxx::__normal_iterator*, std::vector, std::allocator > > > >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/range/concepts.hpp:181:16: required from ‘struct boost::range_detail::ForwardIteratorConcept<__gnu_cxx::__normal_iterator*, std::vector, std::allocator > > > >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::range_detail::ForwardIteratorConcept<__gnu_cxx::__normal_iterator*, std::vector, std::allocator > > > >]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied*, std::vector, std::allocator > > > > >::value’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied*, std::vector, std::allocator > > > > >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:72:8: [ skipping 9 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/isomorphism.hpp:226:17: required from ‘bool boost::detail::isomorphism_algo::test_isomorphism() [with Graph1 = boost::adjacency_list >; Graph2 = boost::adjacency_list >; IsoMapping = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&>; Invariant1 = boost::degree_vertex_invariant >, int, const int&, boost::vertex_index_t> >, boost::adjacency_list > >; Invariant2 = boost::degree_vertex_invariant >, int, const int&, boost::vertex_index_t> >, boost::adjacency_list > >; IndexMap1 = boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>; IndexMap2 = boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/isomorphism.hpp:532:33: required from ‘bool boost::isomorphism(const Graph1&, const Graph2&, IsoMapping, Invariant1, Invariant2, std::size_t, IndexMap1, IndexMap2) [with Graph1 = adjacency_list >; Graph2 = adjacency_list >; IsoMapping = iterator_property_map<__gnu_cxx::__normal_iterator >, adj_list_vertex_property_map >, int, int&, vertex_index_t>, void*, void*&>; Invariant1 = degree_vertex_invariant >, int, const int&, vertex_index_t> >, adjacency_list > >; Invariant2 = degree_vertex_invariant >, int, const int&, vertex_index_t> >, adjacency_list > >; IndexMap1 = adj_list_vertex_property_map >, int, const int&, vertex_index_t>; IndexMap2 = adj_list_vertex_property_map >, int, const int&, vertex_index_t>; std::size_t = long unsigned int]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/isomorphism.hpp:651:42: required from ‘bool boost::graph::detail::isomorphism_impl::operator()(const Graph1&, const Graph2&, const ArgPack&) const [with ArgPack = boost::parameter::aux::arg_list >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&> >, boost::parameter::aux::empty_arg_list, std::integral_constant >; Graph1 = boost::adjacency_list >; Graph2 = boost::adjacency_list >]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/isomorphism.hpp:662:5: required from ‘typename boost::result_of(Param0, Param1, const ArgPack&)>::type boost::graph::isomorphism_with_named_params(const Param0&, const Param1&, const ArgPack&) [with Param0 = boost::adjacency_list >; Param1 = boost::adjacency_list >; ArgPack = boost::parameter::aux::arg_list >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&> >, boost::parameter::aux::empty_arg_list, std::integral_constant >; typename boost::result_of(Param0, Param1, const ArgPack&)>::type = bool]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/isomorphism.hpp:666:1: required from ‘typename boost::result_of(Param0, Param1, const typename boost::detail::convert_bgl_params_to_boost_parameter >::type&)>::type boost::isomorphism(const Param0&, const Param1&, const bgl_named_params&) [with Param0 = adjacency_list >; Param1 = adjacency_list >; P = iterator_property_map<__gnu_cxx::__normal_iterator >, adj_list_vertex_property_map >, int, int&, vertex_index_t>, void*, void*&>; T = vertex_isomorphism_t; R = no_property; typename result_of(Param0, Param1, const typename detail::convert_bgl_params_to_boost_parameter >::type&)>::type = bool; typename detail::convert_bgl_params_to_boost_parameter >::type = parameter::aux::arg_list >, adj_list_vertex_property_map >, int, int&, vertex_index_t>, void*, void*&> >, parameter::aux::empty_arg_list, std::integral_constant >]’ ordering.cpp:68:18: required from here /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::DefaultConstructible<__gnu_cxx::__normal_iterator*, std::vector, std::allocator > > > >]’ 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ^ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements*, std::vector, std::allocator > > > > >]’: /home/omnipath/local/R/4.4-3.20/BH/include/boost/range/concepts.hpp:197:13: required from ‘struct boost::range_detail::ForwardIteratorConcept<__gnu_cxx::__normal_iterator*, std::vector, std::allocator > > > >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::range_detail::ForwardIteratorConcept<__gnu_cxx::__normal_iterator*, std::vector, std::allocator > > > >]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied*, std::vector, std::allocator > > > > >::value’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied*, std::vector, std::allocator > > > > >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_*, std::vector, std::allocator > > > >)>’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/range/concepts.hpp:321:9: [ skipping 8 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/isomorphism.hpp:226:17: required from ‘bool boost::detail::isomorphism_algo::test_isomorphism() [with Graph1 = boost::adjacency_list >; Graph2 = boost::adjacency_list >; IsoMapping = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&>; Invariant1 = boost::degree_vertex_invariant >, int, const int&, boost::vertex_index_t> >, boost::adjacency_list > >; Invariant2 = boost::degree_vertex_invariant >, int, const int&, boost::vertex_index_t> >, boost::adjacency_list > >; IndexMap1 = boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>; IndexMap2 = boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/isomorphism.hpp:532:33: required from ‘bool boost::isomorphism(const Graph1&, const Graph2&, IsoMapping, Invariant1, Invariant2, std::size_t, IndexMap1, IndexMap2) [with Graph1 = adjacency_list >; Graph2 = adjacency_list >; IsoMapping = iterator_property_map<__gnu_cxx::__normal_iterator >, adj_list_vertex_property_map >, int, int&, vertex_index_t>, void*, void*&>; Invariant1 = degree_vertex_invariant >, int, const int&, vertex_index_t> >, adjacency_list > >; Invariant2 = degree_vertex_invariant >, int, const int&, vertex_index_t> >, adjacency_list > >; IndexMap1 = adj_list_vertex_property_map >, int, const int&, vertex_index_t>; IndexMap2 = adj_list_vertex_property_map >, int, const int&, vertex_index_t>; std::size_t = long unsigned int]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/isomorphism.hpp:651:42: required from ‘bool boost::graph::detail::isomorphism_impl::operator()(const Graph1&, const Graph2&, const ArgPack&) const [with ArgPack = boost::parameter::aux::arg_list >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&> >, boost::parameter::aux::empty_arg_list, std::integral_constant >; Graph1 = boost::adjacency_list >; Graph2 = boost::adjacency_list >]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/isomorphism.hpp:662:5: required from ‘typename boost::result_of(Param0, Param1, const ArgPack&)>::type boost::graph::isomorphism_with_named_params(const Param0&, const Param1&, const ArgPack&) [with Param0 = boost::adjacency_list >; Param1 = boost::adjacency_list >; ArgPack = boost::parameter::aux::arg_list >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&> >, boost::parameter::aux::empty_arg_list, std::integral_constant >; typename boost::result_of(Param0, Param1, const ArgPack&)>::type = bool]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/isomorphism.hpp:666:1: required from ‘typename boost::result_of(Param0, Param1, const typename boost::detail::convert_bgl_params_to_boost_parameter >::type&)>::type boost::isomorphism(const Param0&, const Param1&, const bgl_named_params&) [with Param0 = adjacency_list >; Param1 = adjacency_list >; P = iterator_property_map<__gnu_cxx::__normal_iterator >, adj_list_vertex_property_map >, int, int&, vertex_index_t>, void*, void*&>; T = vertex_isomorphism_t; R = no_property; typename result_of(Param0, Param1, const typename detail::convert_bgl_params_to_boost_parameter >::type&)>::type = bool; typename detail::convert_bgl_params_to_boost_parameter >::type = parameter::aux::arg_list >, adj_list_vertex_property_map >, int, int&, vertex_index_t>, void*, void*&> >, parameter::aux::empty_arg_list, std::integral_constant >]’ ordering.cpp:68:18: required from here /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::range_detail::ForwardIteratorConcept<__gnu_cxx::__normal_iterator*, std::vector, std::allocator > > > >]’ 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ^ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::range_detail::ForwardIteratorConcept<__gnu_cxx::__normal_iterator*, std::vector, std::allocator > > > >]’: /home/omnipath/local/R/4.4-3.20/BH/include/boost/range/concepts.hpp:321:9: required from ‘struct boost::ForwardRangeConcept, std::allocator > > >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/range/concepts.hpp:352:12: required from ‘struct boost::BidirectionalRangeConcept, std::allocator > > >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/range/concepts.hpp:370:12: required from ‘struct boost::RandomAccessRangeConcept, std::allocator > > >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::RandomAccessRangeConcept, std::allocator > > >]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied, std::allocator > > > >::value’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:45:51: [ skipping 3 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/isomorphism.hpp:226:17: required from ‘bool boost::detail::isomorphism_algo::test_isomorphism() [with Graph1 = boost::adjacency_list >; Graph2 = boost::adjacency_list >; IsoMapping = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&>; Invariant1 = boost::degree_vertex_invariant >, int, const int&, boost::vertex_index_t> >, boost::adjacency_list > >; Invariant2 = boost::degree_vertex_invariant >, int, const int&, boost::vertex_index_t> >, boost::adjacency_list > >; IndexMap1 = boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>; IndexMap2 = boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/isomorphism.hpp:532:33: required from ‘bool boost::isomorphism(const Graph1&, const Graph2&, IsoMapping, Invariant1, Invariant2, std::size_t, IndexMap1, IndexMap2) [with Graph1 = adjacency_list >; Graph2 = adjacency_list >; IsoMapping = iterator_property_map<__gnu_cxx::__normal_iterator >, adj_list_vertex_property_map >, int, int&, vertex_index_t>, void*, void*&>; Invariant1 = degree_vertex_invariant >, int, const int&, vertex_index_t> >, adjacency_list > >; Invariant2 = degree_vertex_invariant >, int, const int&, vertex_index_t> >, adjacency_list > >; IndexMap1 = adj_list_vertex_property_map >, int, const int&, vertex_index_t>; IndexMap2 = adj_list_vertex_property_map >, int, const int&, vertex_index_t>; std::size_t = long unsigned int]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/isomorphism.hpp:651:42: required from ‘bool boost::graph::detail::isomorphism_impl::operator()(const Graph1&, const Graph2&, const ArgPack&) const [with ArgPack = boost::parameter::aux::arg_list >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&> >, boost::parameter::aux::empty_arg_list, std::integral_constant >; Graph1 = boost::adjacency_list >; Graph2 = boost::adjacency_list >]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/isomorphism.hpp:662:5: required from ‘typename boost::result_of(Param0, Param1, const ArgPack&)>::type boost::graph::isomorphism_with_named_params(const Param0&, const Param1&, const ArgPack&) [with Param0 = boost::adjacency_list >; Param1 = boost::adjacency_list >; ArgPack = boost::parameter::aux::arg_list >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&> >, boost::parameter::aux::empty_arg_list, std::integral_constant >; typename boost::result_of(Param0, Param1, const ArgPack&)>::type = bool]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/isomorphism.hpp:666:1: required from ‘typename boost::result_of(Param0, Param1, const typename boost::detail::convert_bgl_params_to_boost_parameter >::type&)>::type boost::isomorphism(const Param0&, const Param1&, const bgl_named_params&) [with Param0 = adjacency_list >; Param1 = adjacency_list >; P = iterator_property_map<__gnu_cxx::__normal_iterator >, adj_list_vertex_property_map >, int, int&, vertex_index_t>, void*, void*&>; T = vertex_isomorphism_t; R = no_property; typename result_of(Param0, Param1, const typename detail::convert_bgl_params_to_boost_parameter >::type&)>::type = bool; typename detail::convert_bgl_params_to_boost_parameter >::type = parameter::aux::arg_list >, adj_list_vertex_property_map >, int, int&, vertex_index_t>, void*, void*&> >, parameter::aux::empty_arg_list, std::integral_constant >]’ ordering.cpp:68:18: required from here /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::range_detail::ForwardIteratorConcept::~ForwardIteratorConcept() [with Iterator = __gnu_cxx::__normal_iterator*, std::vector, std::allocator > > >]’ 37 | ~model() | ^ /home/omnipath/local/R/4.4-3.20/BH/include/boost/range/concepts.hpp:197:13: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 197 | BOOST_CONCEPT_USAGE(ForwardIteratorConcept) | ^~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements*, std::vector, std::allocator > > > > >]’: /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:137:5: required from ‘struct boost::DefaultConstructible<__gnu_cxx::__normal_iterator*, std::vector, std::allocator > > > >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/range/concepts.hpp:181:16: required from ‘struct boost::range_detail::ForwardIteratorConcept<__gnu_cxx::__normal_iterator*, std::vector, std::allocator > > > >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::range_detail::ForwardIteratorConcept<__gnu_cxx::__normal_iterator*, std::vector, std::allocator > > > >]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied*, std::vector, std::allocator > > > > >::value’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied*, std::vector, std::allocator > > > > >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:72:8: [ skipping 9 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/isomorphism.hpp:226:17: required from ‘bool boost::detail::isomorphism_algo::test_isomorphism() [with Graph1 = boost::adjacency_list >; Graph2 = boost::adjacency_list >; IsoMapping = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&>; Invariant1 = boost::degree_vertex_invariant >, int, const int&, boost::vertex_index_t> >, boost::adjacency_list > >; Invariant2 = boost::degree_vertex_invariant >, int, const int&, boost::vertex_index_t> >, boost::adjacency_list > >; IndexMap1 = boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>; IndexMap2 = boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/isomorphism.hpp:532:33: required from ‘bool boost::isomorphism(const Graph1&, const Graph2&, IsoMapping, Invariant1, Invariant2, std::size_t, IndexMap1, IndexMap2) [with Graph1 = adjacency_list >; Graph2 = adjacency_list >; IsoMapping = iterator_property_map<__gnu_cxx::__normal_iterator >, adj_list_vertex_property_map >, int, int&, vertex_index_t>, void*, void*&>; Invariant1 = degree_vertex_invariant >, int, const int&, vertex_index_t> >, adjacency_list > >; Invariant2 = degree_vertex_invariant >, int, const int&, vertex_index_t> >, adjacency_list > >; IndexMap1 = adj_list_vertex_property_map >, int, const int&, vertex_index_t>; IndexMap2 = adj_list_vertex_property_map >, int, const int&, vertex_index_t>; std::size_t = long unsigned int]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/isomorphism.hpp:651:42: required from ‘bool boost::graph::detail::isomorphism_impl::operator()(const Graph1&, const Graph2&, const ArgPack&) const [with ArgPack = boost::parameter::aux::arg_list >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&> >, boost::parameter::aux::empty_arg_list, std::integral_constant >; Graph1 = boost::adjacency_list >; Graph2 = boost::adjacency_list >]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/isomorphism.hpp:662:5: required from ‘typename boost::result_of(Param0, Param1, const ArgPack&)>::type boost::graph::isomorphism_with_named_params(const Param0&, const Param1&, const ArgPack&) [with Param0 = boost::adjacency_list >; Param1 = boost::adjacency_list >; ArgPack = boost::parameter::aux::arg_list >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&> >, boost::parameter::aux::empty_arg_list, std::integral_constant >; typename boost::result_of(Param0, Param1, const ArgPack&)>::type = bool]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/isomorphism.hpp:666:1: required from ‘typename boost::result_of(Param0, Param1, const typename boost::detail::convert_bgl_params_to_boost_parameter >::type&)>::type boost::isomorphism(const Param0&, const Param1&, const bgl_named_params&) [with Param0 = adjacency_list >; Param1 = adjacency_list >; P = iterator_property_map<__gnu_cxx::__normal_iterator >, adj_list_vertex_property_map >, int, int&, vertex_index_t>, void*, void*&>; T = vertex_isomorphism_t; R = no_property; typename result_of(Param0, Param1, const typename detail::convert_bgl_params_to_boost_parameter >::type&)>::type = bool; typename detail::convert_bgl_params_to_boost_parameter >::type = parameter::aux::arg_list >, adj_list_vertex_property_map >, int, int&, vertex_index_t>, void*, void*&> >, parameter::aux::empty_arg_list, std::integral_constant >]’ ordering.cpp:68:18: required from here /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::DefaultConstructible<__gnu_cxx::__normal_iterator*, std::vector, std::allocator > > > >]’ 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ^ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements*, std::vector, std::allocator > > > > >]’: /home/omnipath/local/R/4.4-3.20/BH/include/boost/range/concepts.hpp:197:13: required from ‘struct boost::range_detail::ForwardIteratorConcept<__gnu_cxx::__normal_iterator*, std::vector, std::allocator > > > >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::range_detail::ForwardIteratorConcept<__gnu_cxx::__normal_iterator*, std::vector, std::allocator > > > >]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied*, std::vector, std::allocator > > > > >::value’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied*, std::vector, std::allocator > > > > >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_*, std::vector, std::allocator > > > >)>’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/range/concepts.hpp:322:9: [ skipping 8 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/isomorphism.hpp:226:17: required from ‘bool boost::detail::isomorphism_algo::test_isomorphism() [with Graph1 = boost::adjacency_list >; Graph2 = boost::adjacency_list >; IsoMapping = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&>; Invariant1 = boost::degree_vertex_invariant >, int, const int&, boost::vertex_index_t> >, boost::adjacency_list > >; Invariant2 = boost::degree_vertex_invariant >, int, const int&, boost::vertex_index_t> >, boost::adjacency_list > >; IndexMap1 = boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>; IndexMap2 = boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/isomorphism.hpp:532:33: required from ‘bool boost::isomorphism(const Graph1&, const Graph2&, IsoMapping, Invariant1, Invariant2, std::size_t, IndexMap1, IndexMap2) [with Graph1 = adjacency_list >; Graph2 = adjacency_list >; IsoMapping = iterator_property_map<__gnu_cxx::__normal_iterator >, adj_list_vertex_property_map >, int, int&, vertex_index_t>, void*, void*&>; Invariant1 = degree_vertex_invariant >, int, const int&, vertex_index_t> >, adjacency_list > >; Invariant2 = degree_vertex_invariant >, int, const int&, vertex_index_t> >, adjacency_list > >; IndexMap1 = adj_list_vertex_property_map >, int, const int&, vertex_index_t>; IndexMap2 = adj_list_vertex_property_map >, int, const int&, vertex_index_t>; std::size_t = long unsigned int]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/isomorphism.hpp:651:42: required from ‘bool boost::graph::detail::isomorphism_impl::operator()(const Graph1&, const Graph2&, const ArgPack&) const [with ArgPack = boost::parameter::aux::arg_list >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&> >, boost::parameter::aux::empty_arg_list, std::integral_constant >; Graph1 = boost::adjacency_list >; Graph2 = boost::adjacency_list >]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/isomorphism.hpp:662:5: required from ‘typename boost::result_of(Param0, Param1, const ArgPack&)>::type boost::graph::isomorphism_with_named_params(const Param0&, const Param1&, const ArgPack&) [with Param0 = boost::adjacency_list >; Param1 = boost::adjacency_list >; ArgPack = boost::parameter::aux::arg_list >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&> >, boost::parameter::aux::empty_arg_list, std::integral_constant >; typename boost::result_of(Param0, Param1, const ArgPack&)>::type = bool]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/isomorphism.hpp:666:1: required from ‘typename boost::result_of(Param0, Param1, const typename boost::detail::convert_bgl_params_to_boost_parameter >::type&)>::type boost::isomorphism(const Param0&, const Param1&, const bgl_named_params&) [with Param0 = adjacency_list >; Param1 = adjacency_list >; P = iterator_property_map<__gnu_cxx::__normal_iterator >, adj_list_vertex_property_map >, int, int&, vertex_index_t>, void*, void*&>; T = vertex_isomorphism_t; R = no_property; typename result_of(Param0, Param1, const typename detail::convert_bgl_params_to_boost_parameter >::type&)>::type = bool; typename detail::convert_bgl_params_to_boost_parameter >::type = parameter::aux::arg_list >, adj_list_vertex_property_map >, int, int&, vertex_index_t>, void*, void*&> >, parameter::aux::empty_arg_list, std::integral_constant >]’ ordering.cpp:68:18: required from here /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::range_detail::ForwardIteratorConcept<__gnu_cxx::__normal_iterator*, std::vector, std::allocator > > > >]’ 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ^ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::range_detail::ForwardIteratorConcept<__gnu_cxx::__normal_iterator*, std::vector, std::allocator > > > >]’: /home/omnipath/local/R/4.4-3.20/BH/include/boost/range/concepts.hpp:322:9: required from ‘struct boost::ForwardRangeConcept, std::allocator > > >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/range/concepts.hpp:352:12: required from ‘struct boost::BidirectionalRangeConcept, std::allocator > > >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/range/concepts.hpp:370:12: required from ‘struct boost::RandomAccessRangeConcept, std::allocator > > >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::RandomAccessRangeConcept, std::allocator > > >]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied, std::allocator > > > >::value’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:45:51: [ skipping 3 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/isomorphism.hpp:226:17: required from ‘bool boost::detail::isomorphism_algo::test_isomorphism() [with Graph1 = boost::adjacency_list >; Graph2 = boost::adjacency_list >; IsoMapping = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&>; Invariant1 = boost::degree_vertex_invariant >, int, const int&, boost::vertex_index_t> >, boost::adjacency_list > >; Invariant2 = boost::degree_vertex_invariant >, int, const int&, boost::vertex_index_t> >, boost::adjacency_list > >; IndexMap1 = boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>; IndexMap2 = boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/isomorphism.hpp:532:33: required from ‘bool boost::isomorphism(const Graph1&, const Graph2&, IsoMapping, Invariant1, Invariant2, std::size_t, IndexMap1, IndexMap2) [with Graph1 = adjacency_list >; Graph2 = adjacency_list >; IsoMapping = iterator_property_map<__gnu_cxx::__normal_iterator >, adj_list_vertex_property_map >, int, int&, vertex_index_t>, void*, void*&>; Invariant1 = degree_vertex_invariant >, int, const int&, vertex_index_t> >, adjacency_list > >; Invariant2 = degree_vertex_invariant >, int, const int&, vertex_index_t> >, adjacency_list > >; IndexMap1 = adj_list_vertex_property_map >, int, const int&, vertex_index_t>; IndexMap2 = adj_list_vertex_property_map >, int, const int&, vertex_index_t>; std::size_t = long unsigned int]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/isomorphism.hpp:651:42: required from ‘bool boost::graph::detail::isomorphism_impl::operator()(const Graph1&, const Graph2&, const ArgPack&) const [with ArgPack = boost::parameter::aux::arg_list >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&> >, boost::parameter::aux::empty_arg_list, std::integral_constant >; Graph1 = boost::adjacency_list >; Graph2 = boost::adjacency_list >]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/isomorphism.hpp:662:5: required from ‘typename boost::result_of(Param0, Param1, const ArgPack&)>::type boost::graph::isomorphism_with_named_params(const Param0&, const Param1&, const ArgPack&) [with Param0 = boost::adjacency_list >; Param1 = boost::adjacency_list >; ArgPack = boost::parameter::aux::arg_list >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&> >, boost::parameter::aux::empty_arg_list, std::integral_constant >; typename boost::result_of(Param0, Param1, const ArgPack&)>::type = bool]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/isomorphism.hpp:666:1: required from ‘typename boost::result_of(Param0, Param1, const typename boost::detail::convert_bgl_params_to_boost_parameter >::type&)>::type boost::isomorphism(const Param0&, const Param1&, const bgl_named_params&) [with Param0 = adjacency_list >; Param1 = adjacency_list >; P = iterator_property_map<__gnu_cxx::__normal_iterator >, adj_list_vertex_property_map >, int, int&, vertex_index_t>, void*, void*&>; T = vertex_isomorphism_t; R = no_property; typename result_of(Param0, Param1, const typename detail::convert_bgl_params_to_boost_parameter >::type&)>::type = bool; typename detail::convert_bgl_params_to_boost_parameter >::type = parameter::aux::arg_list >, adj_list_vertex_property_map >, int, int&, vertex_index_t>, void*, void*&> >, parameter::aux::empty_arg_list, std::integral_constant >]’ ordering.cpp:68:18: required from here /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::range_detail::ForwardIteratorConcept::~ForwardIteratorConcept() [with Iterator = __gnu_cxx::__normal_iterator*, std::vector, std::allocator > > >]’ 37 | ~model() | ^ /home/omnipath/local/R/4.4-3.20/BH/include/boost/range/concepts.hpp:197:13: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 197 | BOOST_CONCEPT_USAGE(ForwardIteratorConcept) | ^~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements*, std::vector, std::allocator > > > > >]’: /home/omnipath/local/R/4.4-3.20/BH/include/boost/range/concepts.hpp:224:14: required from ‘struct boost::range_detail::BidirectionalIteratorConcept<__gnu_cxx::__normal_iterator*, std::vector, std::allocator > > > >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::range_detail::BidirectionalIteratorConcept<__gnu_cxx::__normal_iterator*, std::vector, std::allocator > > > >]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied*, std::vector, std::allocator > > > > >::value’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied*, std::vector, std::allocator > > > > >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_*, std::vector, std::allocator > > > >)>’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/range/concepts.hpp:355:9: [ skipping 7 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/isomorphism.hpp:226:17: required from ‘bool boost::detail::isomorphism_algo::test_isomorphism() [with Graph1 = boost::adjacency_list >; Graph2 = boost::adjacency_list >; IsoMapping = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&>; Invariant1 = boost::degree_vertex_invariant >, int, const int&, boost::vertex_index_t> >, boost::adjacency_list > >; Invariant2 = boost::degree_vertex_invariant >, int, const int&, boost::vertex_index_t> >, boost::adjacency_list > >; IndexMap1 = boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>; IndexMap2 = boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/isomorphism.hpp:532:33: required from ‘bool boost::isomorphism(const Graph1&, const Graph2&, IsoMapping, Invariant1, Invariant2, std::size_t, IndexMap1, IndexMap2) [with Graph1 = adjacency_list >; Graph2 = adjacency_list >; IsoMapping = iterator_property_map<__gnu_cxx::__normal_iterator >, adj_list_vertex_property_map >, int, int&, vertex_index_t>, void*, void*&>; Invariant1 = degree_vertex_invariant >, int, const int&, vertex_index_t> >, adjacency_list > >; Invariant2 = degree_vertex_invariant >, int, const int&, vertex_index_t> >, adjacency_list > >; IndexMap1 = adj_list_vertex_property_map >, int, const int&, vertex_index_t>; IndexMap2 = adj_list_vertex_property_map >, int, const int&, vertex_index_t>; std::size_t = long unsigned int]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/isomorphism.hpp:651:42: required from ‘bool boost::graph::detail::isomorphism_impl::operator()(const Graph1&, const Graph2&, const ArgPack&) const [with ArgPack = boost::parameter::aux::arg_list >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&> >, boost::parameter::aux::empty_arg_list, std::integral_constant >; Graph1 = boost::adjacency_list >; Graph2 = boost::adjacency_list >]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/isomorphism.hpp:662:5: required from ‘typename boost::result_of(Param0, Param1, const ArgPack&)>::type boost::graph::isomorphism_with_named_params(const Param0&, const Param1&, const ArgPack&) [with Param0 = boost::adjacency_list >; Param1 = boost::adjacency_list >; ArgPack = boost::parameter::aux::arg_list >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&> >, boost::parameter::aux::empty_arg_list, std::integral_constant >; typename boost::result_of(Param0, Param1, const ArgPack&)>::type = bool]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/isomorphism.hpp:666:1: required from ‘typename boost::result_of(Param0, Param1, const typename boost::detail::convert_bgl_params_to_boost_parameter >::type&)>::type boost::isomorphism(const Param0&, const Param1&, const bgl_named_params&) [with Param0 = adjacency_list >; Param1 = adjacency_list >; P = iterator_property_map<__gnu_cxx::__normal_iterator >, adj_list_vertex_property_map >, int, int&, vertex_index_t>, void*, void*&>; T = vertex_isomorphism_t; R = no_property; typename result_of(Param0, Param1, const typename detail::convert_bgl_params_to_boost_parameter >::type&)>::type = bool; typename detail::convert_bgl_params_to_boost_parameter >::type = parameter::aux::arg_list >, adj_list_vertex_property_map >, int, int&, vertex_index_t>, void*, void*&> >, parameter::aux::empty_arg_list, std::integral_constant >]’ ordering.cpp:68:18: required from here /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::range_detail::BidirectionalIteratorConcept<__gnu_cxx::__normal_iterator*, std::vector, std::allocator > > > >]’ 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ^ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::range_detail::BidirectionalIteratorConcept<__gnu_cxx::__normal_iterator*, std::vector, std::allocator > > > >]’: /home/omnipath/local/R/4.4-3.20/BH/include/boost/range/concepts.hpp:355:9: required from ‘struct boost::BidirectionalRangeConcept, std::allocator > > >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/range/concepts.hpp:370:12: required from ‘struct boost::RandomAccessRangeConcept, std::allocator > > >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::RandomAccessRangeConcept, std::allocator > > >]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied, std::allocator > > > >::value’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied, std::allocator > > > >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:72:8: [ skipping 2 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/isomorphism.hpp:226:17: required from ‘bool boost::detail::isomorphism_algo::test_isomorphism() [with Graph1 = boost::adjacency_list >; Graph2 = boost::adjacency_list >; IsoMapping = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&>; Invariant1 = boost::degree_vertex_invariant >, int, const int&, boost::vertex_index_t> >, boost::adjacency_list > >; Invariant2 = boost::degree_vertex_invariant >, int, const int&, boost::vertex_index_t> >, boost::adjacency_list > >; IndexMap1 = boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>; IndexMap2 = boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/isomorphism.hpp:532:33: required from ‘bool boost::isomorphism(const Graph1&, const Graph2&, IsoMapping, Invariant1, Invariant2, std::size_t, IndexMap1, IndexMap2) [with Graph1 = adjacency_list >; Graph2 = adjacency_list >; IsoMapping = iterator_property_map<__gnu_cxx::__normal_iterator >, adj_list_vertex_property_map >, int, int&, vertex_index_t>, void*, void*&>; Invariant1 = degree_vertex_invariant >, int, const int&, vertex_index_t> >, adjacency_list > >; Invariant2 = degree_vertex_invariant >, int, const int&, vertex_index_t> >, adjacency_list > >; IndexMap1 = adj_list_vertex_property_map >, int, const int&, vertex_index_t>; IndexMap2 = adj_list_vertex_property_map >, int, const int&, vertex_index_t>; std::size_t = long unsigned int]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/isomorphism.hpp:651:42: required from ‘bool boost::graph::detail::isomorphism_impl::operator()(const Graph1&, const Graph2&, const ArgPack&) const [with ArgPack = boost::parameter::aux::arg_list >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&> >, boost::parameter::aux::empty_arg_list, std::integral_constant >; Graph1 = boost::adjacency_list >; Graph2 = boost::adjacency_list >]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/isomorphism.hpp:662:5: required from ‘typename boost::result_of(Param0, Param1, const ArgPack&)>::type boost::graph::isomorphism_with_named_params(const Param0&, const Param1&, const ArgPack&) [with Param0 = boost::adjacency_list >; Param1 = boost::adjacency_list >; ArgPack = boost::parameter::aux::arg_list >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&> >, boost::parameter::aux::empty_arg_list, std::integral_constant >; typename boost::result_of(Param0, Param1, const ArgPack&)>::type = bool]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/isomorphism.hpp:666:1: required from ‘typename boost::result_of(Param0, Param1, const typename boost::detail::convert_bgl_params_to_boost_parameter >::type&)>::type boost::isomorphism(const Param0&, const Param1&, const bgl_named_params&) [with Param0 = adjacency_list >; Param1 = adjacency_list >; P = iterator_property_map<__gnu_cxx::__normal_iterator >, adj_list_vertex_property_map >, int, int&, vertex_index_t>, void*, void*&>; T = vertex_isomorphism_t; R = no_property; typename result_of(Param0, Param1, const typename detail::convert_bgl_params_to_boost_parameter >::type&)>::type = bool; typename detail::convert_bgl_params_to_boost_parameter >::type = parameter::aux::arg_list >, adj_list_vertex_property_map >, int, int&, vertex_index_t>, void*, void*&> >, parameter::aux::empty_arg_list, std::integral_constant >]’ ordering.cpp:68:18: required from here /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::range_detail::BidirectionalIteratorConcept::~BidirectionalIteratorConcept() [with Iterator = __gnu_cxx::__normal_iterator*, std::vector, std::allocator > > >]’ 37 | ~model() | ^ /home/omnipath/local/R/4.4-3.20/BH/include/boost/range/concepts.hpp:224:14: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 224 | BOOST_CONCEPT_USAGE(BidirectionalIteratorConcept) | ^~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements*, std::vector, std::allocator > > > > >]’: /home/omnipath/local/R/4.4-3.20/BH/include/boost/range/concepts.hpp:224:14: required from ‘struct boost::range_detail::BidirectionalIteratorConcept<__gnu_cxx::__normal_iterator*, std::vector, std::allocator > > > >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::range_detail::BidirectionalIteratorConcept<__gnu_cxx::__normal_iterator*, std::vector, std::allocator > > > >]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied*, std::vector, std::allocator > > > > >::value’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied*, std::vector, std::allocator > > > > >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_*, std::vector, std::allocator > > > >)>’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/range/concepts.hpp:356:9: [ skipping 7 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/isomorphism.hpp:226:17: required from ‘bool boost::detail::isomorphism_algo::test_isomorphism() [with Graph1 = boost::adjacency_list >; Graph2 = boost::adjacency_list >; IsoMapping = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&>; Invariant1 = boost::degree_vertex_invariant >, int, const int&, boost::vertex_index_t> >, boost::adjacency_list > >; Invariant2 = boost::degree_vertex_invariant >, int, const int&, boost::vertex_index_t> >, boost::adjacency_list > >; IndexMap1 = boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>; IndexMap2 = boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/isomorphism.hpp:532:33: required from ‘bool boost::isomorphism(const Graph1&, const Graph2&, IsoMapping, Invariant1, Invariant2, std::size_t, IndexMap1, IndexMap2) [with Graph1 = adjacency_list >; Graph2 = adjacency_list >; IsoMapping = iterator_property_map<__gnu_cxx::__normal_iterator >, adj_list_vertex_property_map >, int, int&, vertex_index_t>, void*, void*&>; Invariant1 = degree_vertex_invariant >, int, const int&, vertex_index_t> >, adjacency_list > >; Invariant2 = degree_vertex_invariant >, int, const int&, vertex_index_t> >, adjacency_list > >; IndexMap1 = adj_list_vertex_property_map >, int, const int&, vertex_index_t>; IndexMap2 = adj_list_vertex_property_map >, int, const int&, vertex_index_t>; std::size_t = long unsigned int]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/isomorphism.hpp:651:42: required from ‘bool boost::graph::detail::isomorphism_impl::operator()(const Graph1&, const Graph2&, const ArgPack&) const [with ArgPack = boost::parameter::aux::arg_list >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&> >, boost::parameter::aux::empty_arg_list, std::integral_constant >; Graph1 = boost::adjacency_list >; Graph2 = boost::adjacency_list >]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/isomorphism.hpp:662:5: required from ‘typename boost::result_of(Param0, Param1, const ArgPack&)>::type boost::graph::isomorphism_with_named_params(const Param0&, const Param1&, const ArgPack&) [with Param0 = boost::adjacency_list >; Param1 = boost::adjacency_list >; ArgPack = boost::parameter::aux::arg_list >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&> >, boost::parameter::aux::empty_arg_list, std::integral_constant >; typename boost::result_of(Param0, Param1, const ArgPack&)>::type = bool]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/isomorphism.hpp:666:1: required from ‘typename boost::result_of(Param0, Param1, const typename boost::detail::convert_bgl_params_to_boost_parameter >::type&)>::type boost::isomorphism(const Param0&, const Param1&, const bgl_named_params&) [with Param0 = adjacency_list >; Param1 = adjacency_list >; P = iterator_property_map<__gnu_cxx::__normal_iterator >, adj_list_vertex_property_map >, int, int&, vertex_index_t>, void*, void*&>; T = vertex_isomorphism_t; R = no_property; typename result_of(Param0, Param1, const typename detail::convert_bgl_params_to_boost_parameter >::type&)>::type = bool; typename detail::convert_bgl_params_to_boost_parameter >::type = parameter::aux::arg_list >, adj_list_vertex_property_map >, int, int&, vertex_index_t>, void*, void*&> >, parameter::aux::empty_arg_list, std::integral_constant >]’ ordering.cpp:68:18: required from here /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::range_detail::BidirectionalIteratorConcept<__gnu_cxx::__normal_iterator*, std::vector, std::allocator > > > >]’ 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ^ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::range_detail::BidirectionalIteratorConcept<__gnu_cxx::__normal_iterator*, std::vector, std::allocator > > > >]’: /home/omnipath/local/R/4.4-3.20/BH/include/boost/range/concepts.hpp:356:9: required from ‘struct boost::BidirectionalRangeConcept, std::allocator > > >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/range/concepts.hpp:370:12: required from ‘struct boost::RandomAccessRangeConcept, std::allocator > > >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::RandomAccessRangeConcept, std::allocator > > >]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied, std::allocator > > > >::value’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied, std::allocator > > > >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:72:8: [ skipping 2 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/isomorphism.hpp:226:17: required from ‘bool boost::detail::isomorphism_algo::test_isomorphism() [with Graph1 = boost::adjacency_list >; Graph2 = boost::adjacency_list >; IsoMapping = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&>; Invariant1 = boost::degree_vertex_invariant >, int, const int&, boost::vertex_index_t> >, boost::adjacency_list > >; Invariant2 = boost::degree_vertex_invariant >, int, const int&, boost::vertex_index_t> >, boost::adjacency_list > >; IndexMap1 = boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>; IndexMap2 = boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/isomorphism.hpp:532:33: required from ‘bool boost::isomorphism(const Graph1&, const Graph2&, IsoMapping, Invariant1, Invariant2, std::size_t, IndexMap1, IndexMap2) [with Graph1 = adjacency_list >; Graph2 = adjacency_list >; IsoMapping = iterator_property_map<__gnu_cxx::__normal_iterator >, adj_list_vertex_property_map >, int, int&, vertex_index_t>, void*, void*&>; Invariant1 = degree_vertex_invariant >, int, const int&, vertex_index_t> >, adjacency_list > >; Invariant2 = degree_vertex_invariant >, int, const int&, vertex_index_t> >, adjacency_list > >; IndexMap1 = adj_list_vertex_property_map >, int, const int&, vertex_index_t>; IndexMap2 = adj_list_vertex_property_map >, int, const int&, vertex_index_t>; std::size_t = long unsigned int]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/isomorphism.hpp:651:42: required from ‘bool boost::graph::detail::isomorphism_impl::operator()(const Graph1&, const Graph2&, const ArgPack&) const [with ArgPack = boost::parameter::aux::arg_list >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&> >, boost::parameter::aux::empty_arg_list, std::integral_constant >; Graph1 = boost::adjacency_list >; Graph2 = boost::adjacency_list >]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/isomorphism.hpp:662:5: required from ‘typename boost::result_of(Param0, Param1, const ArgPack&)>::type boost::graph::isomorphism_with_named_params(const Param0&, const Param1&, const ArgPack&) [with Param0 = boost::adjacency_list >; Param1 = boost::adjacency_list >; ArgPack = boost::parameter::aux::arg_list >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&> >, boost::parameter::aux::empty_arg_list, std::integral_constant >; typename boost::result_of(Param0, Param1, const ArgPack&)>::type = bool]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/isomorphism.hpp:666:1: required from ‘typename boost::result_of(Param0, Param1, const typename boost::detail::convert_bgl_params_to_boost_parameter >::type&)>::type boost::isomorphism(const Param0&, const Param1&, const bgl_named_params&) [with Param0 = adjacency_list >; Param1 = adjacency_list >; P = iterator_property_map<__gnu_cxx::__normal_iterator >, adj_list_vertex_property_map >, int, int&, vertex_index_t>, void*, void*&>; T = vertex_isomorphism_t; R = no_property; typename result_of(Param0, Param1, const typename detail::convert_bgl_params_to_boost_parameter >::type&)>::type = bool; typename detail::convert_bgl_params_to_boost_parameter >::type = parameter::aux::arg_list >, adj_list_vertex_property_map >, int, int&, vertex_index_t>, void*, void*&> >, parameter::aux::empty_arg_list, std::integral_constant >]’ ordering.cpp:68:18: required from here /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::range_detail::BidirectionalIteratorConcept::~BidirectionalIteratorConcept() [with Iterator = __gnu_cxx::__normal_iterator*, std::vector, std::allocator > > >]’ 37 | ~model() | ^ /home/omnipath/local/R/4.4-3.20/BH/include/boost/range/concepts.hpp:224:14: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 224 | BOOST_CONCEPT_USAGE(BidirectionalIteratorConcept) | ^~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements*, std::vector, std::allocator > > > > >]’: /home/omnipath/local/R/4.4-3.20/BH/include/boost/range/concepts.hpp:245:14: required from ‘struct boost::range_detail::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator*, std::vector, std::allocator > > > >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::range_detail::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator*, std::vector, std::allocator > > > >]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied*, std::vector, std::allocator > > > > >::value’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied*, std::vector, std::allocator > > > > >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_*, std::vector, std::allocator > > > >)>’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/range/concepts.hpp:373:9: [ skipping 6 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/isomorphism.hpp:226:17: required from ‘bool boost::detail::isomorphism_algo::test_isomorphism() [with Graph1 = boost::adjacency_list >; Graph2 = boost::adjacency_list >; IsoMapping = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&>; Invariant1 = boost::degree_vertex_invariant >, int, const int&, boost::vertex_index_t> >, boost::adjacency_list > >; Invariant2 = boost::degree_vertex_invariant >, int, const int&, boost::vertex_index_t> >, boost::adjacency_list > >; IndexMap1 = boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>; IndexMap2 = boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/isomorphism.hpp:532:33: required from ‘bool boost::isomorphism(const Graph1&, const Graph2&, IsoMapping, Invariant1, Invariant2, std::size_t, IndexMap1, IndexMap2) [with Graph1 = adjacency_list >; Graph2 = adjacency_list >; IsoMapping = iterator_property_map<__gnu_cxx::__normal_iterator >, adj_list_vertex_property_map >, int, int&, vertex_index_t>, void*, void*&>; Invariant1 = degree_vertex_invariant >, int, const int&, vertex_index_t> >, adjacency_list > >; Invariant2 = degree_vertex_invariant >, int, const int&, vertex_index_t> >, adjacency_list > >; IndexMap1 = adj_list_vertex_property_map >, int, const int&, vertex_index_t>; IndexMap2 = adj_list_vertex_property_map >, int, const int&, vertex_index_t>; std::size_t = long unsigned int]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/isomorphism.hpp:651:42: required from ‘bool boost::graph::detail::isomorphism_impl::operator()(const Graph1&, const Graph2&, const ArgPack&) const [with ArgPack = boost::parameter::aux::arg_list >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&> >, boost::parameter::aux::empty_arg_list, std::integral_constant >; Graph1 = boost::adjacency_list >; Graph2 = boost::adjacency_list >]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/isomorphism.hpp:662:5: required from ‘typename boost::result_of(Param0, Param1, const ArgPack&)>::type boost::graph::isomorphism_with_named_params(const Param0&, const Param1&, const ArgPack&) [with Param0 = boost::adjacency_list >; Param1 = boost::adjacency_list >; ArgPack = boost::parameter::aux::arg_list >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&> >, boost::parameter::aux::empty_arg_list, std::integral_constant >; typename boost::result_of(Param0, Param1, const ArgPack&)>::type = bool]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/isomorphism.hpp:666:1: required from ‘typename boost::result_of(Param0, Param1, const typename boost::detail::convert_bgl_params_to_boost_parameter >::type&)>::type boost::isomorphism(const Param0&, const Param1&, const bgl_named_params&) [with Param0 = adjacency_list >; Param1 = adjacency_list >; P = iterator_property_map<__gnu_cxx::__normal_iterator >, adj_list_vertex_property_map >, int, int&, vertex_index_t>, void*, void*&>; T = vertex_isomorphism_t; R = no_property; typename result_of(Param0, Param1, const typename detail::convert_bgl_params_to_boost_parameter >::type&)>::type = bool; typename detail::convert_bgl_params_to_boost_parameter >::type = parameter::aux::arg_list >, adj_list_vertex_property_map >, int, int&, vertex_index_t>, void*, void*&> >, parameter::aux::empty_arg_list, std::integral_constant >]’ ordering.cpp:68:18: required from here /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::range_detail::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator*, std::vector, std::allocator > > > >]’ 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ^ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::range_detail::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator*, std::vector, std::allocator > > > >]’: /home/omnipath/local/R/4.4-3.20/BH/include/boost/range/concepts.hpp:373:9: required from ‘struct boost::RandomAccessRangeConcept, std::allocator > > >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::RandomAccessRangeConcept, std::allocator > > >]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied, std::allocator > > > >::value’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied, std::allocator > > > >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:72:8: [ skipping 2 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/isomorphism.hpp:226:17: required from ‘bool boost::detail::isomorphism_algo::test_isomorphism() [with Graph1 = boost::adjacency_list >; Graph2 = boost::adjacency_list >; IsoMapping = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&>; Invariant1 = boost::degree_vertex_invariant >, int, const int&, boost::vertex_index_t> >, boost::adjacency_list > >; Invariant2 = boost::degree_vertex_invariant >, int, const int&, boost::vertex_index_t> >, boost::adjacency_list > >; IndexMap1 = boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>; IndexMap2 = boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/isomorphism.hpp:532:33: required from ‘bool boost::isomorphism(const Graph1&, const Graph2&, IsoMapping, Invariant1, Invariant2, std::size_t, IndexMap1, IndexMap2) [with Graph1 = adjacency_list >; Graph2 = adjacency_list >; IsoMapping = iterator_property_map<__gnu_cxx::__normal_iterator >, adj_list_vertex_property_map >, int, int&, vertex_index_t>, void*, void*&>; Invariant1 = degree_vertex_invariant >, int, const int&, vertex_index_t> >, adjacency_list > >; Invariant2 = degree_vertex_invariant >, int, const int&, vertex_index_t> >, adjacency_list > >; IndexMap1 = adj_list_vertex_property_map >, int, const int&, vertex_index_t>; IndexMap2 = adj_list_vertex_property_map >, int, const int&, vertex_index_t>; std::size_t = long unsigned int]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/isomorphism.hpp:651:42: required from ‘bool boost::graph::detail::isomorphism_impl::operator()(const Graph1&, const Graph2&, const ArgPack&) const [with ArgPack = boost::parameter::aux::arg_list >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&> >, boost::parameter::aux::empty_arg_list, std::integral_constant >; Graph1 = boost::adjacency_list >; Graph2 = boost::adjacency_list >]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/isomorphism.hpp:662:5: required from ‘typename boost::result_of(Param0, Param1, const ArgPack&)>::type boost::graph::isomorphism_with_named_params(const Param0&, const Param1&, const ArgPack&) [with Param0 = boost::adjacency_list >; Param1 = boost::adjacency_list >; ArgPack = boost::parameter::aux::arg_list >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&> >, boost::parameter::aux::empty_arg_list, std::integral_constant >; typename boost::result_of(Param0, Param1, const ArgPack&)>::type = bool]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/isomorphism.hpp:666:1: required from ‘typename boost::result_of(Param0, Param1, const typename boost::detail::convert_bgl_params_to_boost_parameter >::type&)>::type boost::isomorphism(const Param0&, const Param1&, const bgl_named_params&) [with Param0 = adjacency_list >; Param1 = adjacency_list >; P = iterator_property_map<__gnu_cxx::__normal_iterator >, adj_list_vertex_property_map >, int, int&, vertex_index_t>, void*, void*&>; T = vertex_isomorphism_t; R = no_property; typename result_of(Param0, Param1, const typename detail::convert_bgl_params_to_boost_parameter >::type&)>::type = bool; typename detail::convert_bgl_params_to_boost_parameter >::type = parameter::aux::arg_list >, adj_list_vertex_property_map >, int, int&, vertex_index_t>, void*, void*&> >, parameter::aux::empty_arg_list, std::integral_constant >]’ ordering.cpp:68:18: required from here /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::range_detail::RandomAccessIteratorConcept::~RandomAccessIteratorConcept() [with Iterator = __gnu_cxx::__normal_iterator*, std::vector, std::allocator > > >]’ 37 | ~model() | ^ /home/omnipath/local/R/4.4-3.20/BH/include/boost/range/concepts.hpp:245:14: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 245 | BOOST_CONCEPT_USAGE(RandomAccessIteratorConcept) | ^~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements*, std::vector, std::allocator > > > > >]’: /home/omnipath/local/R/4.4-3.20/BH/include/boost/range/concepts.hpp:245:14: required from ‘struct boost::range_detail::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator*, std::vector, std::allocator > > > >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::range_detail::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator*, std::vector, std::allocator > > > >]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied*, std::vector, std::allocator > > > > >::value’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied*, std::vector, std::allocator > > > > >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_*, std::vector, std::allocator > > > >)>’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/range/concepts.hpp:374:9: [ skipping 6 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/isomorphism.hpp:226:17: required from ‘bool boost::detail::isomorphism_algo::test_isomorphism() [with Graph1 = boost::adjacency_list >; Graph2 = boost::adjacency_list >; IsoMapping = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&>; Invariant1 = boost::degree_vertex_invariant >, int, const int&, boost::vertex_index_t> >, boost::adjacency_list > >; Invariant2 = boost::degree_vertex_invariant >, int, const int&, boost::vertex_index_t> >, boost::adjacency_list > >; IndexMap1 = boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>; IndexMap2 = boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/isomorphism.hpp:532:33: required from ‘bool boost::isomorphism(const Graph1&, const Graph2&, IsoMapping, Invariant1, Invariant2, std::size_t, IndexMap1, IndexMap2) [with Graph1 = adjacency_list >; Graph2 = adjacency_list >; IsoMapping = iterator_property_map<__gnu_cxx::__normal_iterator >, adj_list_vertex_property_map >, int, int&, vertex_index_t>, void*, void*&>; Invariant1 = degree_vertex_invariant >, int, const int&, vertex_index_t> >, adjacency_list > >; Invariant2 = degree_vertex_invariant >, int, const int&, vertex_index_t> >, adjacency_list > >; IndexMap1 = adj_list_vertex_property_map >, int, const int&, vertex_index_t>; IndexMap2 = adj_list_vertex_property_map >, int, const int&, vertex_index_t>; std::size_t = long unsigned int]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/isomorphism.hpp:651:42: required from ‘bool boost::graph::detail::isomorphism_impl::operator()(const Graph1&, const Graph2&, const ArgPack&) const [with ArgPack = boost::parameter::aux::arg_list >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&> >, boost::parameter::aux::empty_arg_list, std::integral_constant >; Graph1 = boost::adjacency_list >; Graph2 = boost::adjacency_list >]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/isomorphism.hpp:662:5: required from ‘typename boost::result_of(Param0, Param1, const ArgPack&)>::type boost::graph::isomorphism_with_named_params(const Param0&, const Param1&, const ArgPack&) [with Param0 = boost::adjacency_list >; Param1 = boost::adjacency_list >; ArgPack = boost::parameter::aux::arg_list >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&> >, boost::parameter::aux::empty_arg_list, std::integral_constant >; typename boost::result_of(Param0, Param1, const ArgPack&)>::type = bool]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/isomorphism.hpp:666:1: required from ‘typename boost::result_of(Param0, Param1, const typename boost::detail::convert_bgl_params_to_boost_parameter >::type&)>::type boost::isomorphism(const Param0&, const Param1&, const bgl_named_params&) [with Param0 = adjacency_list >; Param1 = adjacency_list >; P = iterator_property_map<__gnu_cxx::__normal_iterator >, adj_list_vertex_property_map >, int, int&, vertex_index_t>, void*, void*&>; T = vertex_isomorphism_t; R = no_property; typename result_of(Param0, Param1, const typename detail::convert_bgl_params_to_boost_parameter >::type&)>::type = bool; typename detail::convert_bgl_params_to_boost_parameter >::type = parameter::aux::arg_list >, adj_list_vertex_property_map >, int, int&, vertex_index_t>, void*, void*&> >, parameter::aux::empty_arg_list, std::integral_constant >]’ ordering.cpp:68:18: required from here /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::range_detail::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator*, std::vector, std::allocator > > > >]’ 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ^ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::range_detail::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator*, std::vector, std::allocator > > > >]’: /home/omnipath/local/R/4.4-3.20/BH/include/boost/range/concepts.hpp:374:9: required from ‘struct boost::RandomAccessRangeConcept, std::allocator > > >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::RandomAccessRangeConcept, std::allocator > > >]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied, std::allocator > > > >::value’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied, std::allocator > > > >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:72:8: [ skipping 2 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/isomorphism.hpp:226:17: required from ‘bool boost::detail::isomorphism_algo::test_isomorphism() [with Graph1 = boost::adjacency_list >; Graph2 = boost::adjacency_list >; IsoMapping = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&>; Invariant1 = boost::degree_vertex_invariant >, int, const int&, boost::vertex_index_t> >, boost::adjacency_list > >; Invariant2 = boost::degree_vertex_invariant >, int, const int&, boost::vertex_index_t> >, boost::adjacency_list > >; IndexMap1 = boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>; IndexMap2 = boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/isomorphism.hpp:532:33: required from ‘bool boost::isomorphism(const Graph1&, const Graph2&, IsoMapping, Invariant1, Invariant2, std::size_t, IndexMap1, IndexMap2) [with Graph1 = adjacency_list >; Graph2 = adjacency_list >; IsoMapping = iterator_property_map<__gnu_cxx::__normal_iterator >, adj_list_vertex_property_map >, int, int&, vertex_index_t>, void*, void*&>; Invariant1 = degree_vertex_invariant >, int, const int&, vertex_index_t> >, adjacency_list > >; Invariant2 = degree_vertex_invariant >, int, const int&, vertex_index_t> >, adjacency_list > >; IndexMap1 = adj_list_vertex_property_map >, int, const int&, vertex_index_t>; IndexMap2 = adj_list_vertex_property_map >, int, const int&, vertex_index_t>; std::size_t = long unsigned int]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/isomorphism.hpp:651:42: required from ‘bool boost::graph::detail::isomorphism_impl::operator()(const Graph1&, const Graph2&, const ArgPack&) const [with ArgPack = boost::parameter::aux::arg_list >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&> >, boost::parameter::aux::empty_arg_list, std::integral_constant >; Graph1 = boost::adjacency_list >; Graph2 = boost::adjacency_list >]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/isomorphism.hpp:662:5: required from ‘typename boost::result_of(Param0, Param1, const ArgPack&)>::type boost::graph::isomorphism_with_named_params(const Param0&, const Param1&, const ArgPack&) [with Param0 = boost::adjacency_list >; Param1 = boost::adjacency_list >; ArgPack = boost::parameter::aux::arg_list >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&> >, boost::parameter::aux::empty_arg_list, std::integral_constant >; typename boost::result_of(Param0, Param1, const ArgPack&)>::type = bool]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/isomorphism.hpp:666:1: required from ‘typename boost::result_of(Param0, Param1, const typename boost::detail::convert_bgl_params_to_boost_parameter >::type&)>::type boost::isomorphism(const Param0&, const Param1&, const bgl_named_params&) [with Param0 = adjacency_list >; Param1 = adjacency_list >; P = iterator_property_map<__gnu_cxx::__normal_iterator >, adj_list_vertex_property_map >, int, int&, vertex_index_t>, void*, void*&>; T = vertex_isomorphism_t; R = no_property; typename result_of(Param0, Param1, const typename detail::convert_bgl_params_to_boost_parameter >::type&)>::type = bool; typename detail::convert_bgl_params_to_boost_parameter >::type = parameter::aux::arg_list >, adj_list_vertex_property_map >, int, int&, vertex_index_t>, void*, void*&> >, parameter::aux::empty_arg_list, std::integral_constant >]’ ordering.cpp:68:18: required from here /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::range_detail::RandomAccessIteratorConcept::~RandomAccessIteratorConcept() [with Iterator = __gnu_cxx::__normal_iterator*, std::vector, std::allocator > > >]’ 37 | ~model() | ^ /home/omnipath/local/R/4.4-3.20/BH/include/boost/range/concepts.hpp:245:14: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 245 | BOOST_CONCEPT_USAGE(RandomAccessIteratorConcept) | ^~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::RandomAccessRangeConcept, std::allocator > > >]’: /home/omnipath/local/R/4.4-3.20/BH/include/boost/range/algorithm/sort.hpp:32:5: required from ‘RandomAccessRange& boost::range::sort(RandomAccessRange&, BinaryPredicate) [with RandomAccessRange = std::vector, std::allocator > >; BinaryPredicate = boost::detail::isomorphism_algo >, boost::adjacency_list >, boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&>, boost::degree_vertex_invariant >, int, const int&, boost::vertex_index_t> >, boost::adjacency_list > >, boost::degree_vertex_invariant >, int, const int&, boost::vertex_index_t> >, boost::adjacency_list > >, boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>, boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t> >::edge_cmp]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/isomorphism.hpp:226:17: required from ‘bool boost::detail::isomorphism_algo::test_isomorphism() [with Graph1 = boost::adjacency_list >; Graph2 = boost::adjacency_list >; IsoMapping = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&>; Invariant1 = boost::degree_vertex_invariant >, int, const int&, boost::vertex_index_t> >, boost::adjacency_list > >; Invariant2 = boost::degree_vertex_invariant >, int, const int&, boost::vertex_index_t> >, boost::adjacency_list > >; IndexMap1 = boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>; IndexMap2 = boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/isomorphism.hpp:532:33: required from ‘bool boost::isomorphism(const Graph1&, const Graph2&, IsoMapping, Invariant1, Invariant2, std::size_t, IndexMap1, IndexMap2) [with Graph1 = adjacency_list >; Graph2 = adjacency_list >; IsoMapping = iterator_property_map<__gnu_cxx::__normal_iterator >, adj_list_vertex_property_map >, int, int&, vertex_index_t>, void*, void*&>; Invariant1 = degree_vertex_invariant >, int, const int&, vertex_index_t> >, adjacency_list > >; Invariant2 = degree_vertex_invariant >, int, const int&, vertex_index_t> >, adjacency_list > >; IndexMap1 = adj_list_vertex_property_map >, int, const int&, vertex_index_t>; IndexMap2 = adj_list_vertex_property_map >, int, const int&, vertex_index_t>; std::size_t = long unsigned int]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/isomorphism.hpp:651:42: required from ‘bool boost::graph::detail::isomorphism_impl::operator()(const Graph1&, const Graph2&, const ArgPack&) const [with ArgPack = boost::parameter::aux::arg_list >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&> >, boost::parameter::aux::empty_arg_list, std::integral_constant >; Graph1 = boost::adjacency_list >; Graph2 = boost::adjacency_list >]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/isomorphism.hpp:662:5: required from ‘typename boost::result_of(Param0, Param1, const ArgPack&)>::type boost::graph::isomorphism_with_named_params(const Param0&, const Param1&, const ArgPack&) [with Param0 = boost::adjacency_list >; Param1 = boost::adjacency_list >; ArgPack = boost::parameter::aux::arg_list >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&> >, boost::parameter::aux::empty_arg_list, std::integral_constant >; typename boost::result_of(Param0, Param1, const ArgPack&)>::type = bool]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/isomorphism.hpp:666:1: required from ‘typename boost::result_of(Param0, Param1, const typename boost::detail::convert_bgl_params_to_boost_parameter >::type&)>::type boost::isomorphism(const Param0&, const Param1&, const bgl_named_params&) [with Param0 = adjacency_list >; Param1 = adjacency_list >; P = iterator_property_map<__gnu_cxx::__normal_iterator >, adj_list_vertex_property_map >, int, int&, vertex_index_t>, void*, void*&>; T = vertex_isomorphism_t; R = no_property; typename result_of(Param0, Param1, const typename detail::convert_bgl_params_to_boost_parameter >::type&)>::type = bool; typename detail::convert_bgl_params_to_boost_parameter >::type = parameter::aux::arg_list >, adj_list_vertex_property_map >, int, int&, vertex_index_t>, void*, void*&> >, parameter::aux::empty_arg_list, std::integral_constant >]’ ordering.cpp:68:18: required from here /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/range/concepts.hpp:370:12: note: in a call to non-static member function ‘boost::RandomAccessRangeConcept, std::allocator > > >::~RandomAccessRangeConcept()’ 370 | struct RandomAccessRangeConcept : BidirectionalRangeConcept | ^~~~~~~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements >]’: /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:137:5: required from ‘struct boost::DefaultConstructible’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::DefaultConstructible]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied >::value’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_)>’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/graph_concepts.hpp:68:9: [ skipping 8 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied > >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_ >)>’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/depth_first_search.hpp:129:9: required from ‘void boost::detail::depth_first_visit_impl(const IncidenceGraph&, typename boost::graph_traits::vertex_descriptor, DFSVisitor&, ColorMap, TerminatorFunc) [with IncidenceGraph = R_adjacency_list; DFSVisitor = boost::dfs_visitor<>; ColorMap = boost::vec_adj_list_vertex_property_map, boost::property, boost::no_property, boost::listS>, boost::adjacency_list, boost::property, boost::no_property, boost::listS>*, boost::default_color_type, boost::default_color_type&, boost::vertex_color_t>; TerminatorFunc = nontruth2; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/depth_first_search.hpp:417:35: required from ‘void boost::depth_first_visit(const IncidenceGraph&, typename graph_traits::vertex_descriptor, DFSVisitor, ColorMap) [with IncidenceGraph = R_adjacency_list; DFSVisitor = dfs_visitor<>; ColorMap = vec_adj_list_vertex_property_map, property, no_property, listS>, adjacency_list, property, no_property, listS>*, default_color_type, default_color_type&, vertex_color_t>; typename graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/cuthill_mckee_ordering.hpp:146:30: required from ‘OutputIterator boost::cuthill_mckee_ordering(const Graph&, OutputIterator, ColorMap, DegreeMap) [with Graph = R_adjacency_list; OutputIterator = std::reverse_iterator<__gnu_cxx::__normal_iterator > >; ColorMap = vec_adj_list_vertex_property_map, property, no_property, listS>, adjacency_list, property, no_property, listS>*, default_color_type, default_color_type&, vertex_color_t>; DegreeMap = degree_property_map >]’ ordering.cpp:98:25: required from here /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::DefaultConstructible]’ 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ^ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::DefaultConstructible]’: /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/graph_concepts.hpp:68:9: required from ‘boost::concepts::Graph::~Graph() [with G = R_adjacency_list]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/usage.hpp:20:48: required from ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::concepts::Graph >]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements > >]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/graph_concepts.hpp:66:5: required from ‘struct boost::concepts::Graph >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/graph_concepts.hpp:75:1: required from ‘struct boost::concepts::IncidenceGraph >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/graph_concepts.hpp:75:1: [ skipping 3 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied > >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_ >)>’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/depth_first_search.hpp:129:9: required from ‘void boost::detail::depth_first_visit_impl(const IncidenceGraph&, typename boost::graph_traits::vertex_descriptor, DFSVisitor&, ColorMap, TerminatorFunc) [with IncidenceGraph = R_adjacency_list; DFSVisitor = boost::dfs_visitor<>; ColorMap = boost::vec_adj_list_vertex_property_map, boost::property, boost::no_property, boost::listS>, boost::adjacency_list, boost::property, boost::no_property, boost::listS>*, boost::default_color_type, boost::default_color_type&, boost::vertex_color_t>; TerminatorFunc = nontruth2; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/depth_first_search.hpp:417:35: required from ‘void boost::depth_first_visit(const IncidenceGraph&, typename graph_traits::vertex_descriptor, DFSVisitor, ColorMap) [with IncidenceGraph = R_adjacency_list; DFSVisitor = dfs_visitor<>; ColorMap = vec_adj_list_vertex_property_map, property, no_property, listS>, adjacency_list, property, no_property, listS>*, default_color_type, default_color_type&, vertex_color_t>; typename graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/cuthill_mckee_ordering.hpp:146:30: required from ‘OutputIterator boost::cuthill_mckee_ordering(const Graph&, OutputIterator, ColorMap, DegreeMap) [with Graph = R_adjacency_list; OutputIterator = std::reverse_iterator<__gnu_cxx::__normal_iterator > >; ColorMap = vec_adj_list_vertex_property_map, property, no_property, listS>, adjacency_list, property, no_property, listS>*, default_color_type, default_color_type&, vertex_color_t>; DegreeMap = degree_property_map >]’ ordering.cpp:98:25: required from here /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::DefaultConstructible::~DefaultConstructible() [with TT = long unsigned int]’ 37 | ~model() | ^ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:137:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 137 | BOOST_CONCEPT_USAGE(DefaultConstructible) { | ^~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements >]’: /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:233:5: required from ‘struct boost::EqualityComparable’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::EqualityComparable]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied >::value’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_)>’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/graph_concepts.hpp:69:9: [ skipping 8 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied > >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_ >)>’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/depth_first_search.hpp:129:9: required from ‘void boost::detail::depth_first_visit_impl(const IncidenceGraph&, typename boost::graph_traits::vertex_descriptor, DFSVisitor&, ColorMap, TerminatorFunc) [with IncidenceGraph = R_adjacency_list; DFSVisitor = boost::dfs_visitor<>; ColorMap = boost::vec_adj_list_vertex_property_map, boost::property, boost::no_property, boost::listS>, boost::adjacency_list, boost::property, boost::no_property, boost::listS>*, boost::default_color_type, boost::default_color_type&, boost::vertex_color_t>; TerminatorFunc = nontruth2; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/depth_first_search.hpp:417:35: required from ‘void boost::depth_first_visit(const IncidenceGraph&, typename graph_traits::vertex_descriptor, DFSVisitor, ColorMap) [with IncidenceGraph = R_adjacency_list; DFSVisitor = dfs_visitor<>; ColorMap = vec_adj_list_vertex_property_map, property, no_property, listS>, adjacency_list, property, no_property, listS>*, default_color_type, default_color_type&, vertex_color_t>; typename graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/cuthill_mckee_ordering.hpp:146:30: required from ‘OutputIterator boost::cuthill_mckee_ordering(const Graph&, OutputIterator, ColorMap, DegreeMap) [with Graph = R_adjacency_list; OutputIterator = std::reverse_iterator<__gnu_cxx::__normal_iterator > >; ColorMap = vec_adj_list_vertex_property_map, property, no_property, listS>, adjacency_list, property, no_property, listS>*, default_color_type, default_color_type&, vertex_color_t>; DegreeMap = degree_property_map >]’ ordering.cpp:98:25: required from here /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::EqualityComparable]’ 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ^ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::EqualityComparable]’: /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/graph_concepts.hpp:69:9: required from ‘boost::concepts::Graph::~Graph() [with G = R_adjacency_list]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/usage.hpp:20:48: required from ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::concepts::Graph >]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements > >]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/graph_concepts.hpp:66:5: required from ‘struct boost::concepts::Graph >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/graph_concepts.hpp:75:1: required from ‘struct boost::concepts::IncidenceGraph >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/graph_concepts.hpp:75:1: [ skipping 3 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied > >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_ >)>’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/depth_first_search.hpp:129:9: required from ‘void boost::detail::depth_first_visit_impl(const IncidenceGraph&, typename boost::graph_traits::vertex_descriptor, DFSVisitor&, ColorMap, TerminatorFunc) [with IncidenceGraph = R_adjacency_list; DFSVisitor = boost::dfs_visitor<>; ColorMap = boost::vec_adj_list_vertex_property_map, boost::property, boost::no_property, boost::listS>, boost::adjacency_list, boost::property, boost::no_property, boost::listS>*, boost::default_color_type, boost::default_color_type&, boost::vertex_color_t>; TerminatorFunc = nontruth2; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/depth_first_search.hpp:417:35: required from ‘void boost::depth_first_visit(const IncidenceGraph&, typename graph_traits::vertex_descriptor, DFSVisitor, ColorMap) [with IncidenceGraph = R_adjacency_list; DFSVisitor = dfs_visitor<>; ColorMap = vec_adj_list_vertex_property_map, property, no_property, listS>, adjacency_list, property, no_property, listS>*, default_color_type, default_color_type&, vertex_color_t>; typename graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/cuthill_mckee_ordering.hpp:146:30: required from ‘OutputIterator boost::cuthill_mckee_ordering(const Graph&, OutputIterator, ColorMap, DegreeMap) [with Graph = R_adjacency_list; OutputIterator = std::reverse_iterator<__gnu_cxx::__normal_iterator > >; ColorMap = vec_adj_list_vertex_property_map, property, no_property, listS>, adjacency_list, property, no_property, listS>*, default_color_type, default_color_type&, vertex_color_t>; DegreeMap = degree_property_map >]’ ordering.cpp:98:25: required from here /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::EqualityComparable::~EqualityComparable() [with TT = long unsigned int]’ 37 | ~model() | ^ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:233:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 233 | BOOST_CONCEPT_USAGE(EqualityComparable) { | ^~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements >]’: /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:145:5: required from ‘struct boost::Assignable’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::Assignable]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied >::value’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_)>’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/graph_concepts.hpp:70:9: [ skipping 8 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied > >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_ >)>’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/depth_first_search.hpp:129:9: required from ‘void boost::detail::depth_first_visit_impl(const IncidenceGraph&, typename boost::graph_traits::vertex_descriptor, DFSVisitor&, ColorMap, TerminatorFunc) [with IncidenceGraph = R_adjacency_list; DFSVisitor = boost::dfs_visitor<>; ColorMap = boost::vec_adj_list_vertex_property_map, boost::property, boost::no_property, boost::listS>, boost::adjacency_list, boost::property, boost::no_property, boost::listS>*, boost::default_color_type, boost::default_color_type&, boost::vertex_color_t>; TerminatorFunc = nontruth2; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/depth_first_search.hpp:417:35: required from ‘void boost::depth_first_visit(const IncidenceGraph&, typename graph_traits::vertex_descriptor, DFSVisitor, ColorMap) [with IncidenceGraph = R_adjacency_list; DFSVisitor = dfs_visitor<>; ColorMap = vec_adj_list_vertex_property_map, property, no_property, listS>, adjacency_list, property, no_property, listS>*, default_color_type, default_color_type&, vertex_color_t>; typename graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/cuthill_mckee_ordering.hpp:146:30: required from ‘OutputIterator boost::cuthill_mckee_ordering(const Graph&, OutputIterator, ColorMap, DegreeMap) [with Graph = R_adjacency_list; OutputIterator = std::reverse_iterator<__gnu_cxx::__normal_iterator > >; ColorMap = vec_adj_list_vertex_property_map, property, no_property, listS>, adjacency_list, property, no_property, listS>*, default_color_type, default_color_type&, vertex_color_t>; DegreeMap = degree_property_map >]’ ordering.cpp:98:25: required from here /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::Assignable]’ 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ^ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::Assignable]’: /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/graph_concepts.hpp:70:9: required from ‘boost::concepts::Graph::~Graph() [with G = R_adjacency_list]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/usage.hpp:20:48: required from ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::concepts::Graph >]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements > >]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/graph_concepts.hpp:66:5: required from ‘struct boost::concepts::Graph >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/graph_concepts.hpp:75:1: required from ‘struct boost::concepts::IncidenceGraph >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/graph_concepts.hpp:75:1: [ skipping 3 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied > >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_ >)>’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/depth_first_search.hpp:129:9: required from ‘void boost::detail::depth_first_visit_impl(const IncidenceGraph&, typename boost::graph_traits::vertex_descriptor, DFSVisitor&, ColorMap, TerminatorFunc) [with IncidenceGraph = R_adjacency_list; DFSVisitor = boost::dfs_visitor<>; ColorMap = boost::vec_adj_list_vertex_property_map, boost::property, boost::no_property, boost::listS>, boost::adjacency_list, boost::property, boost::no_property, boost::listS>*, boost::default_color_type, boost::default_color_type&, boost::vertex_color_t>; TerminatorFunc = nontruth2; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/depth_first_search.hpp:417:35: required from ‘void boost::depth_first_visit(const IncidenceGraph&, typename graph_traits::vertex_descriptor, DFSVisitor, ColorMap) [with IncidenceGraph = R_adjacency_list; DFSVisitor = dfs_visitor<>; ColorMap = vec_adj_list_vertex_property_map, property, no_property, listS>, adjacency_list, property, no_property, listS>*, default_color_type, default_color_type&, vertex_color_t>; typename graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/cuthill_mckee_ordering.hpp:146:30: required from ‘OutputIterator boost::cuthill_mckee_ordering(const Graph&, OutputIterator, ColorMap, DegreeMap) [with Graph = R_adjacency_list; OutputIterator = std::reverse_iterator<__gnu_cxx::__normal_iterator > >; ColorMap = vec_adj_list_vertex_property_map, property, no_property, listS>, adjacency_list, property, no_property, listS>*, default_color_type, default_color_type&, vertex_color_t>; DegreeMap = degree_property_map >]’ ordering.cpp:98:25: required from here /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::Assignable::~Assignable() [with TT = long unsigned int]’ 37 | ~model() | ^ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:145:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 145 | BOOST_CONCEPT_USAGE(Assignable) { | ^~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::concepts::MultiPassInputIterator > >, boost::property >*, std::vector > >, boost::property >, std::allocator > >, boost::property > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> >]’: /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements > >, boost::property >*, std::vector > >, boost::property >, std::allocator > >, boost::property > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/graph_concepts.hpp:52:50: required from ‘struct boost::concepts::MultiPassInputIterator > >, boost::property >*, std::vector > >, boost::property >, std::allocator > >, boost::property > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::concepts::MultiPassInputIterator > >, boost::property >*, std::vector > >, boost::property >, std::allocator > >, boost::property > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> >]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied > >, boost::property >*, std::vector > >, boost::property >, std::allocator > >, boost::property > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::value’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:45:51: [ skipping 2 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/graph_concepts.hpp:89:9: required from ‘boost::concepts::IncidenceGraph::~IncidenceGraph() [with G = R_adjacency_list]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/graph_concepts.hpp:75:1: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::IncidenceGraphConcept >]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/depth_first_search.hpp:129:9: required from ‘void boost::detail::depth_first_visit_impl(const IncidenceGraph&, typename boost::graph_traits::vertex_descriptor, DFSVisitor&, ColorMap, TerminatorFunc) [with IncidenceGraph = R_adjacency_list; DFSVisitor = boost::dfs_visitor<>; ColorMap = boost::vec_adj_list_vertex_property_map, boost::property, boost::no_property, boost::listS>, boost::adjacency_list, boost::property, boost::no_property, boost::listS>*, boost::default_color_type, boost::default_color_type&, boost::vertex_color_t>; TerminatorFunc = nontruth2; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/depth_first_search.hpp:417:35: required from ‘void boost::depth_first_visit(const IncidenceGraph&, typename graph_traits::vertex_descriptor, DFSVisitor, ColorMap) [with IncidenceGraph = R_adjacency_list; DFSVisitor = dfs_visitor<>; ColorMap = vec_adj_list_vertex_property_map, property, no_property, listS>, adjacency_list, property, no_property, listS>*, default_color_type, default_color_type&, vertex_color_t>; typename graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/cuthill_mckee_ordering.hpp:146:30: required from ‘OutputIterator boost::cuthill_mckee_ordering(const Graph&, OutputIterator, ColorMap, DegreeMap) [with Graph = R_adjacency_list; OutputIterator = std::reverse_iterator<__gnu_cxx::__normal_iterator > >; ColorMap = vec_adj_list_vertex_property_map, property, no_property, listS>, adjacency_list, property, no_property, listS>*, default_color_type, default_color_type&, vertex_color_t>; DegreeMap = degree_property_map >]’ ordering.cpp:98:25: required from here /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::concepts::MultiPassInputIterator::~MultiPassInputIterator() [with T = boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >, boost::property >*, std::vector > >, boost::property >, std::allocator > >, boost::property > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>]’ 37 | ~model() | ^ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/graph_concepts.hpp:52:50: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 52 | BOOST_concept(MultiPassInputIterator, (T)) { BOOST_CONCEPT_USAGE( | ^~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::DefaultConstructible >]’: /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements > >]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:137:5: required from ‘struct boost::DefaultConstructible >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::DefaultConstructible >]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied > >::value’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:45:51: [ skipping 2 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/graph_concepts.hpp:90:9: required from ‘boost::concepts::IncidenceGraph::~IncidenceGraph() [with G = R_adjacency_list]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/graph_concepts.hpp:75:1: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::IncidenceGraphConcept >]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/depth_first_search.hpp:129:9: required from ‘void boost::detail::depth_first_visit_impl(const IncidenceGraph&, typename boost::graph_traits::vertex_descriptor, DFSVisitor&, ColorMap, TerminatorFunc) [with IncidenceGraph = R_adjacency_list; DFSVisitor = boost::dfs_visitor<>; ColorMap = boost::vec_adj_list_vertex_property_map, boost::property, boost::no_property, boost::listS>, boost::adjacency_list, boost::property, boost::no_property, boost::listS>*, boost::default_color_type, boost::default_color_type&, boost::vertex_color_t>; TerminatorFunc = nontruth2; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/depth_first_search.hpp:417:35: required from ‘void boost::depth_first_visit(const IncidenceGraph&, typename graph_traits::vertex_descriptor, DFSVisitor, ColorMap) [with IncidenceGraph = R_adjacency_list; DFSVisitor = dfs_visitor<>; ColorMap = vec_adj_list_vertex_property_map, property, no_property, listS>, adjacency_list, property, no_property, listS>*, default_color_type, default_color_type&, vertex_color_t>; typename graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/cuthill_mckee_ordering.hpp:146:30: required from ‘OutputIterator boost::cuthill_mckee_ordering(const Graph&, OutputIterator, ColorMap, DegreeMap) [with Graph = R_adjacency_list; OutputIterator = std::reverse_iterator<__gnu_cxx::__normal_iterator > >; ColorMap = vec_adj_list_vertex_property_map, property, no_property, listS>, adjacency_list, property, no_property, listS>*, default_color_type, default_color_type&, vertex_color_t>; DegreeMap = degree_property_map >]’ ordering.cpp:98:25: required from here /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::DefaultConstructible::~DefaultConstructible() [with TT = boost::detail::edge_desc_impl]’ 37 | ~model() | ^ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:137:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 137 | BOOST_CONCEPT_USAGE(DefaultConstructible) { | ^~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::EqualityComparable >]’: /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements > >]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:233:5: required from ‘struct boost::EqualityComparable >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::EqualityComparable >]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied > >::value’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:45:51: [ skipping 2 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/graph_concepts.hpp:91:9: required from ‘boost::concepts::IncidenceGraph::~IncidenceGraph() [with G = R_adjacency_list]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/graph_concepts.hpp:75:1: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::IncidenceGraphConcept >]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/depth_first_search.hpp:129:9: required from ‘void boost::detail::depth_first_visit_impl(const IncidenceGraph&, typename boost::graph_traits::vertex_descriptor, DFSVisitor&, ColorMap, TerminatorFunc) [with IncidenceGraph = R_adjacency_list; DFSVisitor = boost::dfs_visitor<>; ColorMap = boost::vec_adj_list_vertex_property_map, boost::property, boost::no_property, boost::listS>, boost::adjacency_list, boost::property, boost::no_property, boost::listS>*, boost::default_color_type, boost::default_color_type&, boost::vertex_color_t>; TerminatorFunc = nontruth2; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/depth_first_search.hpp:417:35: required from ‘void boost::depth_first_visit(const IncidenceGraph&, typename graph_traits::vertex_descriptor, DFSVisitor, ColorMap) [with IncidenceGraph = R_adjacency_list; DFSVisitor = dfs_visitor<>; ColorMap = vec_adj_list_vertex_property_map, property, no_property, listS>, adjacency_list, property, no_property, listS>*, default_color_type, default_color_type&, vertex_color_t>; typename graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/cuthill_mckee_ordering.hpp:146:30: required from ‘OutputIterator boost::cuthill_mckee_ordering(const Graph&, OutputIterator, ColorMap, DegreeMap) [with Graph = R_adjacency_list; OutputIterator = std::reverse_iterator<__gnu_cxx::__normal_iterator > >; ColorMap = vec_adj_list_vertex_property_map, property, no_property, listS>, adjacency_list, property, no_property, listS>*, default_color_type, default_color_type&, vertex_color_t>; DegreeMap = degree_property_map >]’ ordering.cpp:98:25: required from here /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::EqualityComparable::~EqualityComparable() [with TT = boost::detail::edge_desc_impl]’ 37 | ~model() | ^ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:233:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 233 | BOOST_CONCEPT_USAGE(EqualityComparable) { | ^~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::Assignable >]’: /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements > >]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:145:5: required from ‘struct boost::Assignable >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::Assignable >]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied > >::value’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:45:51: [ skipping 2 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/graph_concepts.hpp:92:9: required from ‘boost::concepts::IncidenceGraph::~IncidenceGraph() [with G = R_adjacency_list]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/graph_concepts.hpp:75:1: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::IncidenceGraphConcept >]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/depth_first_search.hpp:129:9: required from ‘void boost::detail::depth_first_visit_impl(const IncidenceGraph&, typename boost::graph_traits::vertex_descriptor, DFSVisitor&, ColorMap, TerminatorFunc) [with IncidenceGraph = R_adjacency_list; DFSVisitor = boost::dfs_visitor<>; ColorMap = boost::vec_adj_list_vertex_property_map, boost::property, boost::no_property, boost::listS>, boost::adjacency_list, boost::property, boost::no_property, boost::listS>*, boost::default_color_type, boost::default_color_type&, boost::vertex_color_t>; TerminatorFunc = nontruth2; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/depth_first_search.hpp:417:35: required from ‘void boost::depth_first_visit(const IncidenceGraph&, typename graph_traits::vertex_descriptor, DFSVisitor, ColorMap) [with IncidenceGraph = R_adjacency_list; DFSVisitor = dfs_visitor<>; ColorMap = vec_adj_list_vertex_property_map, property, no_property, listS>, adjacency_list, property, no_property, listS>*, default_color_type, default_color_type&, vertex_color_t>; typename graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/cuthill_mckee_ordering.hpp:146:30: required from ‘OutputIterator boost::cuthill_mckee_ordering(const Graph&, OutputIterator, ColorMap, DegreeMap) [with Graph = R_adjacency_list; OutputIterator = std::reverse_iterator<__gnu_cxx::__normal_iterator > >; ColorMap = vec_adj_list_vertex_property_map, property, no_property, listS>, adjacency_list, property, no_property, listS>*, default_color_type, default_color_type&, vertex_color_t>; DegreeMap = degree_property_map >]’ ordering.cpp:98:25: required from here /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::Assignable::~Assignable() [with TT = boost::detail::edge_desc_impl]’ 37 | ~model() | ^ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:145:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 145 | BOOST_CONCEPT_USAGE(Assignable) { | ^~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::Convertible]’: /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements >]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:208:5: required from ‘struct boost::Convertible’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::Convertible]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied >::value’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:45:51: [ skipping 2 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/graph_concepts.hpp:93:9: required from ‘boost::concepts::IncidenceGraph::~IncidenceGraph() [with G = R_adjacency_list]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/graph_concepts.hpp:75:1: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::IncidenceGraphConcept >]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/depth_first_search.hpp:129:9: required from ‘void boost::detail::depth_first_visit_impl(const IncidenceGraph&, typename boost::graph_traits::vertex_descriptor, DFSVisitor&, ColorMap, TerminatorFunc) [with IncidenceGraph = R_adjacency_list; DFSVisitor = boost::dfs_visitor<>; ColorMap = boost::vec_adj_list_vertex_property_map, boost::property, boost::no_property, boost::listS>, boost::adjacency_list, boost::property, boost::no_property, boost::listS>*, boost::default_color_type, boost::default_color_type&, boost::vertex_color_t>; TerminatorFunc = nontruth2; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/depth_first_search.hpp:417:35: required from ‘void boost::depth_first_visit(const IncidenceGraph&, typename graph_traits::vertex_descriptor, DFSVisitor, ColorMap) [with IncidenceGraph = R_adjacency_list; DFSVisitor = dfs_visitor<>; ColorMap = vec_adj_list_vertex_property_map, property, no_property, listS>, adjacency_list, property, no_property, listS>*, default_color_type, default_color_type&, vertex_color_t>; typename graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/cuthill_mckee_ordering.hpp:146:30: required from ‘OutputIterator boost::cuthill_mckee_ordering(const Graph&, OutputIterator, ColorMap, DegreeMap) [with Graph = R_adjacency_list; OutputIterator = std::reverse_iterator<__gnu_cxx::__normal_iterator > >; ColorMap = vec_adj_list_vertex_property_map, property, no_property, listS>, adjacency_list, property, no_property, listS>*, default_color_type, default_color_type&, vertex_color_t>; DegreeMap = degree_property_map >]’ ordering.cpp:98:25: required from here /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::Convertible::~Convertible() [with X = boost::undir_adj_list_traversal_tag; Y = boost::incidence_graph_tag]’ 37 | ~model() | ^ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:208:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 208 | BOOST_CONCEPT_USAGE(Convertible) { | ^~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::Convertible]’: /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements >]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:208:5: required from ‘struct boost::Convertible’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:206:3: required from ‘struct boost::ConvertibleConcept’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::ConvertibleConcept]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied >::value’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:45:51: [ skipping 10 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied, boost::property, boost::no_property, boost::listS>, boost::adjacency_list, boost::property, boost::no_property, boost::listS>*, boost::default_color_type, boost::default_color_type&, boost::vertex_color_t>, long unsigned int> >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_, boost::property, boost::no_property, boost::listS>, boost::adjacency_list, boost::property, boost::no_property, boost::listS>*, boost::default_color_type, boost::default_color_type&, boost::vertex_color_t>, long unsigned int>)>’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/depth_first_search.hpp:134:9: required from ‘void boost::detail::depth_first_visit_impl(const IncidenceGraph&, typename boost::graph_traits::vertex_descriptor, DFSVisitor&, ColorMap, TerminatorFunc) [with IncidenceGraph = R_adjacency_list; DFSVisitor = boost::dfs_visitor<>; ColorMap = boost::vec_adj_list_vertex_property_map, boost::property, boost::no_property, boost::listS>, boost::adjacency_list, boost::property, boost::no_property, boost::listS>*, boost::default_color_type, boost::default_color_type&, boost::vertex_color_t>; TerminatorFunc = nontruth2; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/depth_first_search.hpp:417:35: required from ‘void boost::depth_first_visit(const IncidenceGraph&, typename graph_traits::vertex_descriptor, DFSVisitor, ColorMap) [with IncidenceGraph = R_adjacency_list; DFSVisitor = dfs_visitor<>; ColorMap = vec_adj_list_vertex_property_map, property, no_property, listS>, adjacency_list, property, no_property, listS>*, default_color_type, default_color_type&, vertex_color_t>; typename graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/cuthill_mckee_ordering.hpp:146:30: required from ‘OutputIterator boost::cuthill_mckee_ordering(const Graph&, OutputIterator, ColorMap, DegreeMap) [with Graph = R_adjacency_list; OutputIterator = std::reverse_iterator<__gnu_cxx::__normal_iterator > >; ColorMap = vec_adj_list_vertex_property_map, property, no_property, listS>, adjacency_list, property, no_property, listS>*, default_color_type, default_color_type&, vertex_color_t>; DegreeMap = degree_property_map >]’ ordering.cpp:98:25: required from here /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::Convertible::~Convertible() [with X = boost::lvalue_property_map_tag; Y = boost::writable_property_map_tag]’ 37 | ~model() | ^ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:208:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 208 | BOOST_CONCEPT_USAGE(Convertible) { | ^~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::constraint::failed() [with Model = boost::BFSVisitorConcept, R_adjacency_list >]’: /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/breadth_first_search.hpp:65:5: required from ‘void boost::breadth_first_visit(const IncidenceGraph&, SourceIterator, SourceIterator, Buffer&, BFSVisitor, ColorMap) [with IncidenceGraph = R_adjacency_list; Buffer = sparse::rcm_queue >, std::deque > >; BFSVisitor = bfs_visitor<>; ColorMap = vec_adj_list_vertex_property_map, property, no_property, listS>, adjacency_list, property, no_property, listS>*, default_color_type, default_color_type&, vertex_color_t>; SourceIterator = long unsigned int*]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/breadth_first_search.hpp:118:24: required from ‘void boost::breadth_first_visit(const IncidenceGraph&, typename graph_traits::vertex_descriptor, Buffer&, BFSVisitor, ColorMap) [with IncidenceGraph = R_adjacency_list; Buffer = sparse::rcm_queue >, std::deque > >; BFSVisitor = bfs_visitor<>; ColorMap = vec_adj_list_vertex_property_map, property, no_property, listS>, adjacency_list, property, no_property, listS>*, default_color_type, default_color_type&, vertex_color_t>; typename graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/breadth_first_search.hpp:363:24: required from ‘void boost::breadth_first_visit(const IncidenceGraph&, typename graph_traits::vertex_descriptor, const bgl_named_params&) [with IncidenceGraph = R_adjacency_list; P = vec_adj_list_vertex_property_map, property, no_property, listS>, adjacency_list, property, no_property, listS>*, default_color_type, default_color_type&, vertex_color_t>; T = vertex_color_t; R = bgl_named_params >, std::deque > > >, buffer_param_t, no_property>; typename graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/detail/sparse_ordering.hpp:152:24: required from ‘Vertex boost::pseudo_peripheral_pair(const Graph&, const Vertex&, int&, ColorMap, DegreeMap) [with Graph = R_adjacency_list; Vertex = long unsigned int; ColorMap = vec_adj_list_vertex_property_map, property, no_property, listS>, adjacency_list, property, no_property, listS>*, default_color_type, default_color_type&, vertex_color_t>; DegreeMap = degree_property_map >]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/detail/sparse_ordering.hpp:170:31: required from ‘Vertex boost::find_starting_node(const Graph&, Vertex, Color, Degree) [with Graph = R_adjacency_list; Vertex = long unsigned int; Color = vec_adj_list_vertex_property_map, property, no_property, listS>, adjacency_list, property, no_property, listS>*, default_color_type, default_color_type&, vertex_color_t>; Degree = degree_property_map >]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/cuthill_mckee_ordering.hpp:155:32: required from ‘OutputIterator boost::cuthill_mckee_ordering(const Graph&, OutputIterator, ColorMap, DegreeMap) [with Graph = R_adjacency_list; OutputIterator = std::reverse_iterator<__gnu_cxx::__normal_iterator > >; ColorMap = vec_adj_list_vertex_property_map, property, no_property, listS>, adjacency_list, property, no_property, listS>*, default_color_type, default_color_type&, vertex_color_t>; DegreeMap = degree_property_map >]’ ordering.cpp:98:25: required from here /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:65:52: warning: ‘this’ pointer is null [-Wnonnull] 65 | static void failed() { ((Model*)0)->constraints(); } | ~~~~~~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/breadth_first_search.hpp:37:10: note: in a call to non-static member function ‘void boost::BFSVisitorConcept::constraints() [with Visitor = boost::bfs_visitor<>; Graph = R_adjacency_list]’ 37 | void constraints() | ^~~~~~~~~~~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::CopyConstructible > >, boost::sparse::sparse_ordering_queue > >, boost::degree_property_map > > >]’: /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements > >, boost::sparse::sparse_ordering_queue > >, boost::degree_property_map > > > >]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:167:5: required from ‘struct boost::CopyConstructible > >, boost::sparse::sparse_ordering_queue > >, boost::degree_property_map > > >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:165:3: required from ‘struct boost::CopyConstructibleConcept > >, boost::sparse::sparse_ordering_queue > >, boost::degree_property_map > > >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::CopyConstructibleConcept > >, boost::sparse::sparse_ordering_queue > >, boost::degree_property_map > > >]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied > >, boost::sparse::sparse_ordering_queue > >, boost::degree_property_map > > > >::value’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:45:51: [ skipping 6 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_ > >, boost::sparse::sparse_ordering_queue > >, boost::degree_property_map > >, R_adjacency_list >)>’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/breadth_first_search.hpp:65:5: required from ‘void boost::breadth_first_visit(const IncidenceGraph&, SourceIterator, SourceIterator, Buffer&, BFSVisitor, ColorMap) [with IncidenceGraph = R_adjacency_list; Buffer = sparse::sparse_ordering_queue > >; BFSVisitor = detail::bfs_rcm_visitor > >, sparse::sparse_ordering_queue > >, degree_property_map > >; ColorMap = vec_adj_list_vertex_property_map, property, no_property, listS>, adjacency_list, property, no_property, listS>*, default_color_type, default_color_type&, vertex_color_t>; SourceIterator = long unsigned int*]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/breadth_first_search.hpp:118:24: required from ‘void boost::breadth_first_visit(const IncidenceGraph&, typename graph_traits::vertex_descriptor, Buffer&, BFSVisitor, ColorMap) [with IncidenceGraph = R_adjacency_list; Buffer = sparse::sparse_ordering_queue > >; BFSVisitor = detail::bfs_rcm_visitor > >, sparse::sparse_ordering_queue > >, degree_property_map > >; ColorMap = vec_adj_list_vertex_property_map, property, no_property, listS>, adjacency_list, property, no_property, listS>*, default_color_type, default_color_type&, vertex_color_t>; typename graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/cuthill_mckee_ordering.hpp:105:28: required from ‘OutputIterator boost::cuthill_mckee_ordering(const Graph&, std::deque::vertex_descriptor, std::allocator::vertex_descriptor> >, OutputIterator, ColorMap, DegreeMap) [with Graph = R_adjacency_list; OutputIterator = std::reverse_iterator<__gnu_cxx::__normal_iterator > >; ColorMap = vec_adj_list_vertex_property_map, property, no_property, listS>, adjacency_list, property, no_property, listS>*, default_color_type, default_color_type&, vertex_color_t>; DegreeMap = degree_property_map >; typename graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/cuthill_mckee_ordering.hpp:157:34: required from ‘OutputIterator boost::cuthill_mckee_ordering(const Graph&, OutputIterator, ColorMap, DegreeMap) [with Graph = R_adjacency_list; OutputIterator = std::reverse_iterator<__gnu_cxx::__normal_iterator > >; ColorMap = vec_adj_list_vertex_property_map, property, no_property, listS>, adjacency_list, property, no_property, listS>*, default_color_type, default_color_type&, vertex_color_t>; DegreeMap = degree_property_map >]’ ordering.cpp:98:25: required from here /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::CopyConstructible::~CopyConstructible() [with TT = boost::detail::bfs_rcm_visitor > >, boost::sparse::sparse_ordering_queue > >, boost::degree_property_map > >]’ 37 | ~model() | ^ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:167:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 167 | BOOST_CONCEPT_USAGE(CopyConstructible) { | ^~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements >]’: /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:137:5: required from ‘struct boost::DefaultConstructible’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::DefaultConstructible]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied >::value’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_)>’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/graph_concepts.hpp:68:9: [ skipping 9 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_ > >)>’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/isomorphism.hpp:494:5: required from ‘bool boost::isomorphism(const Graph1&, const Graph2&, IsoMapping, Invariant1, Invariant2, std::size_t, IndexMap1, IndexMap2) [with Graph1 = adjacency_list >; Graph2 = adjacency_list >; IsoMapping = iterator_property_map<__gnu_cxx::__normal_iterator >, adj_list_vertex_property_map >, int, int&, vertex_index_t>, void*, void*&>; Invariant1 = degree_vertex_invariant >, int, const int&, vertex_index_t> >, adjacency_list > >; Invariant2 = degree_vertex_invariant >, int, const int&, vertex_index_t> >, adjacency_list > >; IndexMap1 = adj_list_vertex_property_map >, int, const int&, vertex_index_t>; IndexMap2 = adj_list_vertex_property_map >, int, const int&, vertex_index_t>; std::size_t = long unsigned int]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/isomorphism.hpp:651:42: required from ‘bool boost::graph::detail::isomorphism_impl::operator()(const Graph1&, const Graph2&, const ArgPack&) const [with ArgPack = boost::parameter::aux::arg_list >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&> >, boost::parameter::aux::empty_arg_list, std::integral_constant >; Graph1 = boost::adjacency_list >; Graph2 = boost::adjacency_list >]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/isomorphism.hpp:662:5: required from ‘typename boost::result_of(Param0, Param1, const ArgPack&)>::type boost::graph::isomorphism_with_named_params(const Param0&, const Param1&, const ArgPack&) [with Param0 = boost::adjacency_list >; Param1 = boost::adjacency_list >; ArgPack = boost::parameter::aux::arg_list >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&> >, boost::parameter::aux::empty_arg_list, std::integral_constant >; typename boost::result_of(Param0, Param1, const ArgPack&)>::type = bool]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/isomorphism.hpp:666:1: required from ‘typename boost::result_of(Param0, Param1, const typename boost::detail::convert_bgl_params_to_boost_parameter >::type&)>::type boost::isomorphism(const Param0&, const Param1&, const bgl_named_params&) [with Param0 = adjacency_list >; Param1 = adjacency_list >; P = iterator_property_map<__gnu_cxx::__normal_iterator >, adj_list_vertex_property_map >, int, int&, vertex_index_t>, void*, void*&>; T = vertex_isomorphism_t; R = no_property; typename result_of(Param0, Param1, const typename detail::convert_bgl_params_to_boost_parameter >::type&)>::type = bool; typename detail::convert_bgl_params_to_boost_parameter >::type = parameter::aux::arg_list >, adj_list_vertex_property_map >, int, int&, vertex_index_t>, void*, void*&> >, parameter::aux::empty_arg_list, std::integral_constant >]’ ordering.cpp:68:18: required from here /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::DefaultConstructible]’ 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ^ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::DefaultConstructible]’: /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/graph_concepts.hpp:68:9: required from ‘boost::concepts::Graph::~Graph() [with G = boost::adjacency_list >]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/usage.hpp:20:48: required from ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::concepts::Graph > >]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements > > >]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/graph_concepts.hpp:66:5: required from ‘struct boost::concepts::Graph > >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/graph_concepts.hpp:176:1: required from ‘struct boost::concepts::VertexListGraph > >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/graph_concepts.hpp:176:1: [ skipping 4 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_ > >)>’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/isomorphism.hpp:494:5: required from ‘bool boost::isomorphism(const Graph1&, const Graph2&, IsoMapping, Invariant1, Invariant2, std::size_t, IndexMap1, IndexMap2) [with Graph1 = adjacency_list >; Graph2 = adjacency_list >; IsoMapping = iterator_property_map<__gnu_cxx::__normal_iterator >, adj_list_vertex_property_map >, int, int&, vertex_index_t>, void*, void*&>; Invariant1 = degree_vertex_invariant >, int, const int&, vertex_index_t> >, adjacency_list > >; Invariant2 = degree_vertex_invariant >, int, const int&, vertex_index_t> >, adjacency_list > >; IndexMap1 = adj_list_vertex_property_map >, int, const int&, vertex_index_t>; IndexMap2 = adj_list_vertex_property_map >, int, const int&, vertex_index_t>; std::size_t = long unsigned int]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/isomorphism.hpp:651:42: required from ‘bool boost::graph::detail::isomorphism_impl::operator()(const Graph1&, const Graph2&, const ArgPack&) const [with ArgPack = boost::parameter::aux::arg_list >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&> >, boost::parameter::aux::empty_arg_list, std::integral_constant >; Graph1 = boost::adjacency_list >; Graph2 = boost::adjacency_list >]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/isomorphism.hpp:662:5: required from ‘typename boost::result_of(Param0, Param1, const ArgPack&)>::type boost::graph::isomorphism_with_named_params(const Param0&, const Param1&, const ArgPack&) [with Param0 = boost::adjacency_list >; Param1 = boost::adjacency_list >; ArgPack = boost::parameter::aux::arg_list >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&> >, boost::parameter::aux::empty_arg_list, std::integral_constant >; typename boost::result_of(Param0, Param1, const ArgPack&)>::type = bool]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/isomorphism.hpp:666:1: required from ‘typename boost::result_of(Param0, Param1, const typename boost::detail::convert_bgl_params_to_boost_parameter >::type&)>::type boost::isomorphism(const Param0&, const Param1&, const bgl_named_params&) [with Param0 = adjacency_list >; Param1 = adjacency_list >; P = iterator_property_map<__gnu_cxx::__normal_iterator >, adj_list_vertex_property_map >, int, int&, vertex_index_t>, void*, void*&>; T = vertex_isomorphism_t; R = no_property; typename result_of(Param0, Param1, const typename detail::convert_bgl_params_to_boost_parameter >::type&)>::type = bool; typename detail::convert_bgl_params_to_boost_parameter >::type = parameter::aux::arg_list >, adj_list_vertex_property_map >, int, int&, vertex_index_t>, void*, void*&> >, parameter::aux::empty_arg_list, std::integral_constant >]’ ordering.cpp:68:18: required from here /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::DefaultConstructible::~DefaultConstructible() [with TT = void*]’ 37 | ~model() | ^ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:137:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 137 | BOOST_CONCEPT_USAGE(DefaultConstructible) { | ^~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements >]’: /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:233:5: required from ‘struct boost::EqualityComparable’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::EqualityComparable]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied >::value’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_)>’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/graph_concepts.hpp:69:9: [ skipping 9 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_ > >)>’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/isomorphism.hpp:494:5: required from ‘bool boost::isomorphism(const Graph1&, const Graph2&, IsoMapping, Invariant1, Invariant2, std::size_t, IndexMap1, IndexMap2) [with Graph1 = adjacency_list >; Graph2 = adjacency_list >; IsoMapping = iterator_property_map<__gnu_cxx::__normal_iterator >, adj_list_vertex_property_map >, int, int&, vertex_index_t>, void*, void*&>; Invariant1 = degree_vertex_invariant >, int, const int&, vertex_index_t> >, adjacency_list > >; Invariant2 = degree_vertex_invariant >, int, const int&, vertex_index_t> >, adjacency_list > >; IndexMap1 = adj_list_vertex_property_map >, int, const int&, vertex_index_t>; IndexMap2 = adj_list_vertex_property_map >, int, const int&, vertex_index_t>; std::size_t = long unsigned int]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/isomorphism.hpp:651:42: required from ‘bool boost::graph::detail::isomorphism_impl::operator()(const Graph1&, const Graph2&, const ArgPack&) const [with ArgPack = boost::parameter::aux::arg_list >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&> >, boost::parameter::aux::empty_arg_list, std::integral_constant >; Graph1 = boost::adjacency_list >; Graph2 = boost::adjacency_list >]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/isomorphism.hpp:662:5: required from ‘typename boost::result_of(Param0, Param1, const ArgPack&)>::type boost::graph::isomorphism_with_named_params(const Param0&, const Param1&, const ArgPack&) [with Param0 = boost::adjacency_list >; Param1 = boost::adjacency_list >; ArgPack = boost::parameter::aux::arg_list >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&> >, boost::parameter::aux::empty_arg_list, std::integral_constant >; typename boost::result_of(Param0, Param1, const ArgPack&)>::type = bool]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/isomorphism.hpp:666:1: required from ‘typename boost::result_of(Param0, Param1, const typename boost::detail::convert_bgl_params_to_boost_parameter >::type&)>::type boost::isomorphism(const Param0&, const Param1&, const bgl_named_params&) [with Param0 = adjacency_list >; Param1 = adjacency_list >; P = iterator_property_map<__gnu_cxx::__normal_iterator >, adj_list_vertex_property_map >, int, int&, vertex_index_t>, void*, void*&>; T = vertex_isomorphism_t; R = no_property; typename result_of(Param0, Param1, const typename detail::convert_bgl_params_to_boost_parameter >::type&)>::type = bool; typename detail::convert_bgl_params_to_boost_parameter >::type = parameter::aux::arg_list >, adj_list_vertex_property_map >, int, int&, vertex_index_t>, void*, void*&> >, parameter::aux::empty_arg_list, std::integral_constant >]’ ordering.cpp:68:18: required from here /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::EqualityComparable]’ 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ^ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::EqualityComparable]’: /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/graph_concepts.hpp:69:9: required from ‘boost::concepts::Graph::~Graph() [with G = boost::adjacency_list >]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/usage.hpp:20:48: required from ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::concepts::Graph > >]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements > > >]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/graph_concepts.hpp:66:5: required from ‘struct boost::concepts::Graph > >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/graph_concepts.hpp:176:1: required from ‘struct boost::concepts::VertexListGraph > >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/graph_concepts.hpp:176:1: [ skipping 4 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_ > >)>’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/isomorphism.hpp:494:5: required from ‘bool boost::isomorphism(const Graph1&, const Graph2&, IsoMapping, Invariant1, Invariant2, std::size_t, IndexMap1, IndexMap2) [with Graph1 = adjacency_list >; Graph2 = adjacency_list >; IsoMapping = iterator_property_map<__gnu_cxx::__normal_iterator >, adj_list_vertex_property_map >, int, int&, vertex_index_t>, void*, void*&>; Invariant1 = degree_vertex_invariant >, int, const int&, vertex_index_t> >, adjacency_list > >; Invariant2 = degree_vertex_invariant >, int, const int&, vertex_index_t> >, adjacency_list > >; IndexMap1 = adj_list_vertex_property_map >, int, const int&, vertex_index_t>; IndexMap2 = adj_list_vertex_property_map >, int, const int&, vertex_index_t>; std::size_t = long unsigned int]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/isomorphism.hpp:651:42: required from ‘bool boost::graph::detail::isomorphism_impl::operator()(const Graph1&, const Graph2&, const ArgPack&) const [with ArgPack = boost::parameter::aux::arg_list >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&> >, boost::parameter::aux::empty_arg_list, std::integral_constant >; Graph1 = boost::adjacency_list >; Graph2 = boost::adjacency_list >]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/isomorphism.hpp:662:5: required from ‘typename boost::result_of(Param0, Param1, const ArgPack&)>::type boost::graph::isomorphism_with_named_params(const Param0&, const Param1&, const ArgPack&) [with Param0 = boost::adjacency_list >; Param1 = boost::adjacency_list >; ArgPack = boost::parameter::aux::arg_list >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&> >, boost::parameter::aux::empty_arg_list, std::integral_constant >; typename boost::result_of(Param0, Param1, const ArgPack&)>::type = bool]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/isomorphism.hpp:666:1: required from ‘typename boost::result_of(Param0, Param1, const typename boost::detail::convert_bgl_params_to_boost_parameter >::type&)>::type boost::isomorphism(const Param0&, const Param1&, const bgl_named_params&) [with Param0 = adjacency_list >; Param1 = adjacency_list >; P = iterator_property_map<__gnu_cxx::__normal_iterator >, adj_list_vertex_property_map >, int, int&, vertex_index_t>, void*, void*&>; T = vertex_isomorphism_t; R = no_property; typename result_of(Param0, Param1, const typename detail::convert_bgl_params_to_boost_parameter >::type&)>::type = bool; typename detail::convert_bgl_params_to_boost_parameter >::type = parameter::aux::arg_list >, adj_list_vertex_property_map >, int, int&, vertex_index_t>, void*, void*&> >, parameter::aux::empty_arg_list, std::integral_constant >]’ ordering.cpp:68:18: required from here /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::EqualityComparable::~EqualityComparable() [with TT = void*]’ 37 | ~model() | ^ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:233:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 233 | BOOST_CONCEPT_USAGE(EqualityComparable) { | ^~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements >]’: /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:145:5: required from ‘struct boost::Assignable’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::Assignable]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied >::value’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_)>’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/graph_concepts.hpp:70:9: [ skipping 9 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_ > >)>’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/isomorphism.hpp:494:5: required from ‘bool boost::isomorphism(const Graph1&, const Graph2&, IsoMapping, Invariant1, Invariant2, std::size_t, IndexMap1, IndexMap2) [with Graph1 = adjacency_list >; Graph2 = adjacency_list >; IsoMapping = iterator_property_map<__gnu_cxx::__normal_iterator >, adj_list_vertex_property_map >, int, int&, vertex_index_t>, void*, void*&>; Invariant1 = degree_vertex_invariant >, int, const int&, vertex_index_t> >, adjacency_list > >; Invariant2 = degree_vertex_invariant >, int, const int&, vertex_index_t> >, adjacency_list > >; IndexMap1 = adj_list_vertex_property_map >, int, const int&, vertex_index_t>; IndexMap2 = adj_list_vertex_property_map >, int, const int&, vertex_index_t>; std::size_t = long unsigned int]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/isomorphism.hpp:651:42: required from ‘bool boost::graph::detail::isomorphism_impl::operator()(const Graph1&, const Graph2&, const ArgPack&) const [with ArgPack = boost::parameter::aux::arg_list >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&> >, boost::parameter::aux::empty_arg_list, std::integral_constant >; Graph1 = boost::adjacency_list >; Graph2 = boost::adjacency_list >]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/isomorphism.hpp:662:5: required from ‘typename boost::result_of(Param0, Param1, const ArgPack&)>::type boost::graph::isomorphism_with_named_params(const Param0&, const Param1&, const ArgPack&) [with Param0 = boost::adjacency_list >; Param1 = boost::adjacency_list >; ArgPack = boost::parameter::aux::arg_list >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&> >, boost::parameter::aux::empty_arg_list, std::integral_constant >; typename boost::result_of(Param0, Param1, const ArgPack&)>::type = bool]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/isomorphism.hpp:666:1: required from ‘typename boost::result_of(Param0, Param1, const typename boost::detail::convert_bgl_params_to_boost_parameter >::type&)>::type boost::isomorphism(const Param0&, const Param1&, const bgl_named_params&) [with Param0 = adjacency_list >; Param1 = adjacency_list >; P = iterator_property_map<__gnu_cxx::__normal_iterator >, adj_list_vertex_property_map >, int, int&, vertex_index_t>, void*, void*&>; T = vertex_isomorphism_t; R = no_property; typename result_of(Param0, Param1, const typename detail::convert_bgl_params_to_boost_parameter >::type&)>::type = bool; typename detail::convert_bgl_params_to_boost_parameter >::type = parameter::aux::arg_list >, adj_list_vertex_property_map >, int, int&, vertex_index_t>, void*, void*&> >, parameter::aux::empty_arg_list, std::integral_constant >]’ ordering.cpp:68:18: required from here /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::Assignable]’ 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ^ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::Assignable]’: /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/graph_concepts.hpp:70:9: required from ‘boost::concepts::Graph::~Graph() [with G = boost::adjacency_list >]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/usage.hpp:20:48: required from ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::concepts::Graph > >]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements > > >]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/graph_concepts.hpp:66:5: required from ‘struct boost::concepts::Graph > >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/graph_concepts.hpp:176:1: required from ‘struct boost::concepts::VertexListGraph > >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/graph_concepts.hpp:176:1: [ skipping 4 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_ > >)>’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/isomorphism.hpp:494:5: required from ‘bool boost::isomorphism(const Graph1&, const Graph2&, IsoMapping, Invariant1, Invariant2, std::size_t, IndexMap1, IndexMap2) [with Graph1 = adjacency_list >; Graph2 = adjacency_list >; IsoMapping = iterator_property_map<__gnu_cxx::__normal_iterator >, adj_list_vertex_property_map >, int, int&, vertex_index_t>, void*, void*&>; Invariant1 = degree_vertex_invariant >, int, const int&, vertex_index_t> >, adjacency_list > >; Invariant2 = degree_vertex_invariant >, int, const int&, vertex_index_t> >, adjacency_list > >; IndexMap1 = adj_list_vertex_property_map >, int, const int&, vertex_index_t>; IndexMap2 = adj_list_vertex_property_map >, int, const int&, vertex_index_t>; std::size_t = long unsigned int]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/isomorphism.hpp:651:42: required from ‘bool boost::graph::detail::isomorphism_impl::operator()(const Graph1&, const Graph2&, const ArgPack&) const [with ArgPack = boost::parameter::aux::arg_list >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&> >, boost::parameter::aux::empty_arg_list, std::integral_constant >; Graph1 = boost::adjacency_list >; Graph2 = boost::adjacency_list >]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/isomorphism.hpp:662:5: required from ‘typename boost::result_of(Param0, Param1, const ArgPack&)>::type boost::graph::isomorphism_with_named_params(const Param0&, const Param1&, const ArgPack&) [with Param0 = boost::adjacency_list >; Param1 = boost::adjacency_list >; ArgPack = boost::parameter::aux::arg_list >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&> >, boost::parameter::aux::empty_arg_list, std::integral_constant >; typename boost::result_of(Param0, Param1, const ArgPack&)>::type = bool]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/isomorphism.hpp:666:1: required from ‘typename boost::result_of(Param0, Param1, const typename boost::detail::convert_bgl_params_to_boost_parameter >::type&)>::type boost::isomorphism(const Param0&, const Param1&, const bgl_named_params&) [with Param0 = adjacency_list >; Param1 = adjacency_list >; P = iterator_property_map<__gnu_cxx::__normal_iterator >, adj_list_vertex_property_map >, int, int&, vertex_index_t>, void*, void*&>; T = vertex_isomorphism_t; R = no_property; typename result_of(Param0, Param1, const typename detail::convert_bgl_params_to_boost_parameter >::type&)>::type = bool; typename detail::convert_bgl_params_to_boost_parameter >::type = parameter::aux::arg_list >, adj_list_vertex_property_map >, int, int&, vertex_index_t>, void*, void*&> >, parameter::aux::empty_arg_list, std::integral_constant >]’ ordering.cpp:68:18: required from here /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::Assignable::~Assignable() [with TT = void*]’ 37 | ~model() | ^ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:145:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 145 | BOOST_CONCEPT_USAGE(Assignable) { | ^~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::concepts::MultiPassInputIterator >]’: /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements > >]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/graph_concepts.hpp:52:50: required from ‘struct boost::concepts::MultiPassInputIterator >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::concepts::MultiPassInputIterator >]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied > >::value’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied > >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:72:8: [ skipping 2 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/graph_concepts.hpp:176:1: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::VertexListGraphConcept > >]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/isomorphism.hpp:494:5: required from ‘bool boost::isomorphism(const Graph1&, const Graph2&, IsoMapping, Invariant1, Invariant2, std::size_t, IndexMap1, IndexMap2) [with Graph1 = adjacency_list >; Graph2 = adjacency_list >; IsoMapping = iterator_property_map<__gnu_cxx::__normal_iterator >, adj_list_vertex_property_map >, int, int&, vertex_index_t>, void*, void*&>; Invariant1 = degree_vertex_invariant >, int, const int&, vertex_index_t> >, adjacency_list > >; Invariant2 = degree_vertex_invariant >, int, const int&, vertex_index_t> >, adjacency_list > >; IndexMap1 = adj_list_vertex_property_map >, int, const int&, vertex_index_t>; IndexMap2 = adj_list_vertex_property_map >, int, const int&, vertex_index_t>; std::size_t = long unsigned int]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/isomorphism.hpp:651:42: required from ‘bool boost::graph::detail::isomorphism_impl::operator()(const Graph1&, const Graph2&, const ArgPack&) const [with ArgPack = boost::parameter::aux::arg_list >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&> >, boost::parameter::aux::empty_arg_list, std::integral_constant >; Graph1 = boost::adjacency_list >; Graph2 = boost::adjacency_list >]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/isomorphism.hpp:662:5: required from ‘typename boost::result_of(Param0, Param1, const ArgPack&)>::type boost::graph::isomorphism_with_named_params(const Param0&, const Param1&, const ArgPack&) [with Param0 = boost::adjacency_list >; Param1 = boost::adjacency_list >; ArgPack = boost::parameter::aux::arg_list >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&> >, boost::parameter::aux::empty_arg_list, std::integral_constant >; typename boost::result_of(Param0, Param1, const ArgPack&)>::type = bool]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/isomorphism.hpp:666:1: required from ‘typename boost::result_of(Param0, Param1, const typename boost::detail::convert_bgl_params_to_boost_parameter >::type&)>::type boost::isomorphism(const Param0&, const Param1&, const bgl_named_params&) [with Param0 = adjacency_list >; Param1 = adjacency_list >; P = iterator_property_map<__gnu_cxx::__normal_iterator >, adj_list_vertex_property_map >, int, int&, vertex_index_t>, void*, void*&>; T = vertex_isomorphism_t; R = no_property; typename result_of(Param0, Param1, const typename detail::convert_bgl_params_to_boost_parameter >::type&)>::type = bool; typename detail::convert_bgl_params_to_boost_parameter >::type = parameter::aux::arg_list >, adj_list_vertex_property_map >, int, int&, vertex_index_t>, void*, void*&> >, parameter::aux::empty_arg_list, std::integral_constant >]’ ordering.cpp:68:18: required from here /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::concepts::MultiPassInputIterator::~MultiPassInputIterator() [with T = std::_List_iterator]’ 37 | ~model() | ^ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/graph_concepts.hpp:52:50: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 52 | BOOST_concept(MultiPassInputIterator, (T)) { BOOST_CONCEPT_USAGE( | ^~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::Convertible]’: /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements >]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:208:5: required from ‘struct boost::Convertible’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::Convertible]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied >::value’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:72:8: [ skipping 2 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/graph_concepts.hpp:176:1: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::VertexListGraphConcept > >]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/isomorphism.hpp:494:5: required from ‘bool boost::isomorphism(const Graph1&, const Graph2&, IsoMapping, Invariant1, Invariant2, std::size_t, IndexMap1, IndexMap2) [with Graph1 = adjacency_list >; Graph2 = adjacency_list >; IsoMapping = iterator_property_map<__gnu_cxx::__normal_iterator >, adj_list_vertex_property_map >, int, int&, vertex_index_t>, void*, void*&>; Invariant1 = degree_vertex_invariant >, int, const int&, vertex_index_t> >, adjacency_list > >; Invariant2 = degree_vertex_invariant >, int, const int&, vertex_index_t> >, adjacency_list > >; IndexMap1 = adj_list_vertex_property_map >, int, const int&, vertex_index_t>; IndexMap2 = adj_list_vertex_property_map >, int, const int&, vertex_index_t>; std::size_t = long unsigned int]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/isomorphism.hpp:651:42: required from ‘bool boost::graph::detail::isomorphism_impl::operator()(const Graph1&, const Graph2&, const ArgPack&) const [with ArgPack = boost::parameter::aux::arg_list >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&> >, boost::parameter::aux::empty_arg_list, std::integral_constant >; Graph1 = boost::adjacency_list >; Graph2 = boost::adjacency_list >]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/isomorphism.hpp:662:5: required from ‘typename boost::result_of(Param0, Param1, const ArgPack&)>::type boost::graph::isomorphism_with_named_params(const Param0&, const Param1&, const ArgPack&) [with Param0 = boost::adjacency_list >; Param1 = boost::adjacency_list >; ArgPack = boost::parameter::aux::arg_list >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&> >, boost::parameter::aux::empty_arg_list, std::integral_constant >; typename boost::result_of(Param0, Param1, const ArgPack&)>::type = bool]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/isomorphism.hpp:666:1: required from ‘typename boost::result_of(Param0, Param1, const typename boost::detail::convert_bgl_params_to_boost_parameter >::type&)>::type boost::isomorphism(const Param0&, const Param1&, const bgl_named_params&) [with Param0 = adjacency_list >; Param1 = adjacency_list >; P = iterator_property_map<__gnu_cxx::__normal_iterator >, adj_list_vertex_property_map >, int, int&, vertex_index_t>, void*, void*&>; T = vertex_isomorphism_t; R = no_property; typename result_of(Param0, Param1, const typename detail::convert_bgl_params_to_boost_parameter >::type&)>::type = bool; typename detail::convert_bgl_params_to_boost_parameter >::type = parameter::aux::arg_list >, adj_list_vertex_property_map >, int, int&, vertex_index_t>, void*, void*&> >, parameter::aux::empty_arg_list, std::integral_constant >]’ ordering.cpp:68:18: required from here /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::Convertible::~Convertible() [with X = boost::undir_adj_list_traversal_tag; Y = boost::vertex_list_graph_tag]’ 37 | ~model() | ^ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:208:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 208 | BOOST_CONCEPT_USAGE(Convertible) { | ^~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::concepts::MultiPassInputIterator >, boost::detail::edge_desc_impl, long int> >]’: /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements >, boost::detail::edge_desc_impl, long int> > >]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/graph_concepts.hpp:52:50: required from ‘struct boost::concepts::MultiPassInputIterator >, boost::detail::edge_desc_impl, long int> >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::concepts::MultiPassInputIterator >, boost::detail::edge_desc_impl, long int> >]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied >, boost::detail::edge_desc_impl, long int> > >::value’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied >, boost::detail::edge_desc_impl, long int> > >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:72:8: [ skipping 2 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/graph_concepts.hpp:226:1: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::EdgeListGraphConcept > >]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/isomorphism.hpp:495:5: required from ‘bool boost::isomorphism(const Graph1&, const Graph2&, IsoMapping, Invariant1, Invariant2, std::size_t, IndexMap1, IndexMap2) [with Graph1 = adjacency_list >; Graph2 = adjacency_list >; IsoMapping = iterator_property_map<__gnu_cxx::__normal_iterator >, adj_list_vertex_property_map >, int, int&, vertex_index_t>, void*, void*&>; Invariant1 = degree_vertex_invariant >, int, const int&, vertex_index_t> >, adjacency_list > >; Invariant2 = degree_vertex_invariant >, int, const int&, vertex_index_t> >, adjacency_list > >; IndexMap1 = adj_list_vertex_property_map >, int, const int&, vertex_index_t>; IndexMap2 = adj_list_vertex_property_map >, int, const int&, vertex_index_t>; std::size_t = long unsigned int]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/isomorphism.hpp:651:42: required from ‘bool boost::graph::detail::isomorphism_impl::operator()(const Graph1&, const Graph2&, const ArgPack&) const [with ArgPack = boost::parameter::aux::arg_list >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&> >, boost::parameter::aux::empty_arg_list, std::integral_constant >; Graph1 = boost::adjacency_list >; Graph2 = boost::adjacency_list >]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/isomorphism.hpp:662:5: required from ‘typename boost::result_of(Param0, Param1, const ArgPack&)>::type boost::graph::isomorphism_with_named_params(const Param0&, const Param1&, const ArgPack&) [with Param0 = boost::adjacency_list >; Param1 = boost::adjacency_list >; ArgPack = boost::parameter::aux::arg_list >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&> >, boost::parameter::aux::empty_arg_list, std::integral_constant >; typename boost::result_of(Param0, Param1, const ArgPack&)>::type = bool]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/isomorphism.hpp:666:1: required from ‘typename boost::result_of(Param0, Param1, const typename boost::detail::convert_bgl_params_to_boost_parameter >::type&)>::type boost::isomorphism(const Param0&, const Param1&, const bgl_named_params&) [with Param0 = adjacency_list >; Param1 = adjacency_list >; P = iterator_property_map<__gnu_cxx::__normal_iterator >, adj_list_vertex_property_map >, int, int&, vertex_index_t>, void*, void*&>; T = vertex_isomorphism_t; R = no_property; typename result_of(Param0, Param1, const typename detail::convert_bgl_params_to_boost_parameter >::type&)>::type = bool; typename detail::convert_bgl_params_to_boost_parameter >::type = parameter::aux::arg_list >, adj_list_vertex_property_map >, int, int&, vertex_index_t>, void*, void*&> >, parameter::aux::empty_arg_list, std::integral_constant >]’ ordering.cpp:68:18: required from here /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::concepts::MultiPassInputIterator::~MultiPassInputIterator() [with T = boost::detail::undirected_edge_iter >, boost::detail::edge_desc_impl, long int>]’ 37 | ~model() | ^ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/graph_concepts.hpp:52:50: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 52 | BOOST_concept(MultiPassInputIterator, (T)) { BOOST_CONCEPT_USAGE( | ^~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::DefaultConstructible >]’: /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements > >]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:137:5: required from ‘struct boost::DefaultConstructible >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::DefaultConstructible >]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied > >::value’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied > >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:72:8: [ skipping 2 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/graph_concepts.hpp:226:1: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::EdgeListGraphConcept > >]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/isomorphism.hpp:495:5: required from ‘bool boost::isomorphism(const Graph1&, const Graph2&, IsoMapping, Invariant1, Invariant2, std::size_t, IndexMap1, IndexMap2) [with Graph1 = adjacency_list >; Graph2 = adjacency_list >; IsoMapping = iterator_property_map<__gnu_cxx::__normal_iterator >, adj_list_vertex_property_map >, int, int&, vertex_index_t>, void*, void*&>; Invariant1 = degree_vertex_invariant >, int, const int&, vertex_index_t> >, adjacency_list > >; Invariant2 = degree_vertex_invariant >, int, const int&, vertex_index_t> >, adjacency_list > >; IndexMap1 = adj_list_vertex_property_map >, int, const int&, vertex_index_t>; IndexMap2 = adj_list_vertex_property_map >, int, const int&, vertex_index_t>; std::size_t = long unsigned int]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/isomorphism.hpp:651:42: required from ‘bool boost::graph::detail::isomorphism_impl::operator()(const Graph1&, const Graph2&, const ArgPack&) const [with ArgPack = boost::parameter::aux::arg_list >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&> >, boost::parameter::aux::empty_arg_list, std::integral_constant >; Graph1 = boost::adjacency_list >; Graph2 = boost::adjacency_list >]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/isomorphism.hpp:662:5: required from ‘typename boost::result_of(Param0, Param1, const ArgPack&)>::type boost::graph::isomorphism_with_named_params(const Param0&, const Param1&, const ArgPack&) [with Param0 = boost::adjacency_list >; Param1 = boost::adjacency_list >; ArgPack = boost::parameter::aux::arg_list >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&> >, boost::parameter::aux::empty_arg_list, std::integral_constant >; typename boost::result_of(Param0, Param1, const ArgPack&)>::type = bool]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/isomorphism.hpp:666:1: required from ‘typename boost::result_of(Param0, Param1, const typename boost::detail::convert_bgl_params_to_boost_parameter >::type&)>::type boost::isomorphism(const Param0&, const Param1&, const bgl_named_params&) [with Param0 = adjacency_list >; Param1 = adjacency_list >; P = iterator_property_map<__gnu_cxx::__normal_iterator >, adj_list_vertex_property_map >, int, int&, vertex_index_t>, void*, void*&>; T = vertex_isomorphism_t; R = no_property; typename result_of(Param0, Param1, const typename detail::convert_bgl_params_to_boost_parameter >::type&)>::type = bool; typename detail::convert_bgl_params_to_boost_parameter >::type = parameter::aux::arg_list >, adj_list_vertex_property_map >, int, int&, vertex_index_t>, void*, void*&> >, parameter::aux::empty_arg_list, std::integral_constant >]’ ordering.cpp:68:18: required from here /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::DefaultConstructible::~DefaultConstructible() [with TT = boost::detail::edge_desc_impl]’ 37 | ~model() | ^ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:137:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 137 | BOOST_CONCEPT_USAGE(DefaultConstructible) { | ^~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::EqualityComparable >]’: /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements > >]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:233:5: required from ‘struct boost::EqualityComparable >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::EqualityComparable >]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied > >::value’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied > >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:72:8: [ skipping 2 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/graph_concepts.hpp:226:1: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::EdgeListGraphConcept > >]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/isomorphism.hpp:495:5: required from ‘bool boost::isomorphism(const Graph1&, const Graph2&, IsoMapping, Invariant1, Invariant2, std::size_t, IndexMap1, IndexMap2) [with Graph1 = adjacency_list >; Graph2 = adjacency_list >; IsoMapping = iterator_property_map<__gnu_cxx::__normal_iterator >, adj_list_vertex_property_map >, int, int&, vertex_index_t>, void*, void*&>; Invariant1 = degree_vertex_invariant >, int, const int&, vertex_index_t> >, adjacency_list > >; Invariant2 = degree_vertex_invariant >, int, const int&, vertex_index_t> >, adjacency_list > >; IndexMap1 = adj_list_vertex_property_map >, int, const int&, vertex_index_t>; IndexMap2 = adj_list_vertex_property_map >, int, const int&, vertex_index_t>; std::size_t = long unsigned int]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/isomorphism.hpp:651:42: required from ‘bool boost::graph::detail::isomorphism_impl::operator()(const Graph1&, const Graph2&, const ArgPack&) const [with ArgPack = boost::parameter::aux::arg_list >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&> >, boost::parameter::aux::empty_arg_list, std::integral_constant >; Graph1 = boost::adjacency_list >; Graph2 = boost::adjacency_list >]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/isomorphism.hpp:662:5: required from ‘typename boost::result_of(Param0, Param1, const ArgPack&)>::type boost::graph::isomorphism_with_named_params(const Param0&, const Param1&, const ArgPack&) [with Param0 = boost::adjacency_list >; Param1 = boost::adjacency_list >; ArgPack = boost::parameter::aux::arg_list >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&> >, boost::parameter::aux::empty_arg_list, std::integral_constant >; typename boost::result_of(Param0, Param1, const ArgPack&)>::type = bool]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/isomorphism.hpp:666:1: required from ‘typename boost::result_of(Param0, Param1, const typename boost::detail::convert_bgl_params_to_boost_parameter >::type&)>::type boost::isomorphism(const Param0&, const Param1&, const bgl_named_params&) [with Param0 = adjacency_list >; Param1 = adjacency_list >; P = iterator_property_map<__gnu_cxx::__normal_iterator >, adj_list_vertex_property_map >, int, int&, vertex_index_t>, void*, void*&>; T = vertex_isomorphism_t; R = no_property; typename result_of(Param0, Param1, const typename detail::convert_bgl_params_to_boost_parameter >::type&)>::type = bool; typename detail::convert_bgl_params_to_boost_parameter >::type = parameter::aux::arg_list >, adj_list_vertex_property_map >, int, int&, vertex_index_t>, void*, void*&> >, parameter::aux::empty_arg_list, std::integral_constant >]’ ordering.cpp:68:18: required from here /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::EqualityComparable::~EqualityComparable() [with TT = boost::detail::edge_desc_impl]’ 37 | ~model() | ^ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:233:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 233 | BOOST_CONCEPT_USAGE(EqualityComparable) { | ^~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::Assignable >]’: /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements > >]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:145:5: required from ‘struct boost::Assignable >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::Assignable >]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied > >::value’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied > >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:72:8: [ skipping 2 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/graph_concepts.hpp:226:1: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::EdgeListGraphConcept > >]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/isomorphism.hpp:495:5: required from ‘bool boost::isomorphism(const Graph1&, const Graph2&, IsoMapping, Invariant1, Invariant2, std::size_t, IndexMap1, IndexMap2) [with Graph1 = adjacency_list >; Graph2 = adjacency_list >; IsoMapping = iterator_property_map<__gnu_cxx::__normal_iterator >, adj_list_vertex_property_map >, int, int&, vertex_index_t>, void*, void*&>; Invariant1 = degree_vertex_invariant >, int, const int&, vertex_index_t> >, adjacency_list > >; Invariant2 = degree_vertex_invariant >, int, const int&, vertex_index_t> >, adjacency_list > >; IndexMap1 = adj_list_vertex_property_map >, int, const int&, vertex_index_t>; IndexMap2 = adj_list_vertex_property_map >, int, const int&, vertex_index_t>; std::size_t = long unsigned int]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/isomorphism.hpp:651:42: required from ‘bool boost::graph::detail::isomorphism_impl::operator()(const Graph1&, const Graph2&, const ArgPack&) const [with ArgPack = boost::parameter::aux::arg_list >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&> >, boost::parameter::aux::empty_arg_list, std::integral_constant >; Graph1 = boost::adjacency_list >; Graph2 = boost::adjacency_list >]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/isomorphism.hpp:662:5: required from ‘typename boost::result_of(Param0, Param1, const ArgPack&)>::type boost::graph::isomorphism_with_named_params(const Param0&, const Param1&, const ArgPack&) [with Param0 = boost::adjacency_list >; Param1 = boost::adjacency_list >; ArgPack = boost::parameter::aux::arg_list >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&> >, boost::parameter::aux::empty_arg_list, std::integral_constant >; typename boost::result_of(Param0, Param1, const ArgPack&)>::type = bool]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/isomorphism.hpp:666:1: required from ‘typename boost::result_of(Param0, Param1, const typename boost::detail::convert_bgl_params_to_boost_parameter >::type&)>::type boost::isomorphism(const Param0&, const Param1&, const bgl_named_params&) [with Param0 = adjacency_list >; Param1 = adjacency_list >; P = iterator_property_map<__gnu_cxx::__normal_iterator >, adj_list_vertex_property_map >, int, int&, vertex_index_t>, void*, void*&>; T = vertex_isomorphism_t; R = no_property; typename result_of(Param0, Param1, const typename detail::convert_bgl_params_to_boost_parameter >::type&)>::type = bool; typename detail::convert_bgl_params_to_boost_parameter >::type = parameter::aux::arg_list >, adj_list_vertex_property_map >, int, int&, vertex_index_t>, void*, void*&> >, parameter::aux::empty_arg_list, std::integral_constant >]’ ordering.cpp:68:18: required from here /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::Assignable::~Assignable() [with TT = boost::detail::edge_desc_impl]’ 37 | ~model() | ^ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:145:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 145 | BOOST_CONCEPT_USAGE(Assignable) { | ^~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::Convertible]’: /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements >]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:208:5: required from ‘struct boost::Convertible’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::Convertible]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied >::value’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:72:8: [ skipping 2 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/graph_concepts.hpp:226:1: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::EdgeListGraphConcept > >]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/isomorphism.hpp:495:5: required from ‘bool boost::isomorphism(const Graph1&, const Graph2&, IsoMapping, Invariant1, Invariant2, std::size_t, IndexMap1, IndexMap2) [with Graph1 = adjacency_list >; Graph2 = adjacency_list >; IsoMapping = iterator_property_map<__gnu_cxx::__normal_iterator >, adj_list_vertex_property_map >, int, int&, vertex_index_t>, void*, void*&>; Invariant1 = degree_vertex_invariant >, int, const int&, vertex_index_t> >, adjacency_list > >; Invariant2 = degree_vertex_invariant >, int, const int&, vertex_index_t> >, adjacency_list > >; IndexMap1 = adj_list_vertex_property_map >, int, const int&, vertex_index_t>; IndexMap2 = adj_list_vertex_property_map >, int, const int&, vertex_index_t>; std::size_t = long unsigned int]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/isomorphism.hpp:651:42: required from ‘bool boost::graph::detail::isomorphism_impl::operator()(const Graph1&, const Graph2&, const ArgPack&) const [with ArgPack = boost::parameter::aux::arg_list >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&> >, boost::parameter::aux::empty_arg_list, std::integral_constant >; Graph1 = boost::adjacency_list >; Graph2 = boost::adjacency_list >]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/isomorphism.hpp:662:5: required from ‘typename boost::result_of(Param0, Param1, const ArgPack&)>::type boost::graph::isomorphism_with_named_params(const Param0&, const Param1&, const ArgPack&) [with Param0 = boost::adjacency_list >; Param1 = boost::adjacency_list >; ArgPack = boost::parameter::aux::arg_list >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&> >, boost::parameter::aux::empty_arg_list, std::integral_constant >; typename boost::result_of(Param0, Param1, const ArgPack&)>::type = bool]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/isomorphism.hpp:666:1: required from ‘typename boost::result_of(Param0, Param1, const typename boost::detail::convert_bgl_params_to_boost_parameter >::type&)>::type boost::isomorphism(const Param0&, const Param1&, const bgl_named_params&) [with Param0 = adjacency_list >; Param1 = adjacency_list >; P = iterator_property_map<__gnu_cxx::__normal_iterator >, adj_list_vertex_property_map >, int, int&, vertex_index_t>, void*, void*&>; T = vertex_isomorphism_t; R = no_property; typename result_of(Param0, Param1, const typename detail::convert_bgl_params_to_boost_parameter >::type&)>::type = bool; typename detail::convert_bgl_params_to_boost_parameter >::type = parameter::aux::arg_list >, adj_list_vertex_property_map >, int, int&, vertex_index_t>, void*, void*&> >, parameter::aux::empty_arg_list, std::integral_constant >]’ ordering.cpp:68:18: required from here /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::Convertible::~Convertible() [with X = boost::undir_adj_list_traversal_tag; Y = boost::edge_list_graph_tag]’ 37 | ~model() | ^ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:208:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 208 | BOOST_CONCEPT_USAGE(Convertible) { | ^~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::Convertible]’: /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements >]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:208:5: required from ‘struct boost::Convertible’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::Convertible]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied >::value’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:72:8: [ skipping 2 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:454:3: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::AdaptableUnaryFunctionConcept >, int, const int&, boost::vertex_index_t> >, boost::adjacency_list > >, long unsigned int, void*>]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/isomorphism.hpp:504:5: required from ‘bool boost::isomorphism(const Graph1&, const Graph2&, IsoMapping, Invariant1, Invariant2, std::size_t, IndexMap1, IndexMap2) [with Graph1 = adjacency_list >; Graph2 = adjacency_list >; IsoMapping = iterator_property_map<__gnu_cxx::__normal_iterator >, adj_list_vertex_property_map >, int, int&, vertex_index_t>, void*, void*&>; Invariant1 = degree_vertex_invariant >, int, const int&, vertex_index_t> >, adjacency_list > >; Invariant2 = degree_vertex_invariant >, int, const int&, vertex_index_t> >, adjacency_list > >; IndexMap1 = adj_list_vertex_property_map >, int, const int&, vertex_index_t>; IndexMap2 = adj_list_vertex_property_map >, int, const int&, vertex_index_t>; std::size_t = long unsigned int]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/isomorphism.hpp:651:42: required from ‘bool boost::graph::detail::isomorphism_impl::operator()(const Graph1&, const Graph2&, const ArgPack&) const [with ArgPack = boost::parameter::aux::arg_list >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&> >, boost::parameter::aux::empty_arg_list, std::integral_constant >; Graph1 = boost::adjacency_list >; Graph2 = boost::adjacency_list >]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/isomorphism.hpp:662:5: required from ‘typename boost::result_of(Param0, Param1, const ArgPack&)>::type boost::graph::isomorphism_with_named_params(const Param0&, const Param1&, const ArgPack&) [with Param0 = boost::adjacency_list >; Param1 = boost::adjacency_list >; ArgPack = boost::parameter::aux::arg_list >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&> >, boost::parameter::aux::empty_arg_list, std::integral_constant >; typename boost::result_of(Param0, Param1, const ArgPack&)>::type = bool]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/isomorphism.hpp:666:1: required from ‘typename boost::result_of(Param0, Param1, const typename boost::detail::convert_bgl_params_to_boost_parameter >::type&)>::type boost::isomorphism(const Param0&, const Param1&, const bgl_named_params&) [with Param0 = adjacency_list >; Param1 = adjacency_list >; P = iterator_property_map<__gnu_cxx::__normal_iterator >, adj_list_vertex_property_map >, int, int&, vertex_index_t>, void*, void*&>; T = vertex_isomorphism_t; R = no_property; typename result_of(Param0, Param1, const typename detail::convert_bgl_params_to_boost_parameter >::type&)>::type = bool; typename detail::convert_bgl_params_to_boost_parameter >::type = parameter::aux::arg_list >, adj_list_vertex_property_map >, int, int&, vertex_index_t>, void*, void*&> >, parameter::aux::empty_arg_list, std::integral_constant >]’ ordering.cpp:68:18: required from here /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::Convertible::~Convertible() [with X = long unsigned int; Y = long unsigned int]’ 37 | ~model() | ^ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:208:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 208 | BOOST_CONCEPT_USAGE(Convertible) { | ^~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::Convertible]’: /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements >]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:208:5: required from ‘struct boost::Convertible’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::Convertible]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied >::value’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:72:8: [ skipping 2 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:454:3: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::AdaptableUnaryFunctionConcept >, int, const int&, boost::vertex_index_t> >, boost::adjacency_list > >, long unsigned int, void*>]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/isomorphism.hpp:504:5: required from ‘bool boost::isomorphism(const Graph1&, const Graph2&, IsoMapping, Invariant1, Invariant2, std::size_t, IndexMap1, IndexMap2) [with Graph1 = adjacency_list >; Graph2 = adjacency_list >; IsoMapping = iterator_property_map<__gnu_cxx::__normal_iterator >, adj_list_vertex_property_map >, int, int&, vertex_index_t>, void*, void*&>; Invariant1 = degree_vertex_invariant >, int, const int&, vertex_index_t> >, adjacency_list > >; Invariant2 = degree_vertex_invariant >, int, const int&, vertex_index_t> >, adjacency_list > >; IndexMap1 = adj_list_vertex_property_map >, int, const int&, vertex_index_t>; IndexMap2 = adj_list_vertex_property_map >, int, const int&, vertex_index_t>; std::size_t = long unsigned int]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/isomorphism.hpp:651:42: required from ‘bool boost::graph::detail::isomorphism_impl::operator()(const Graph1&, const Graph2&, const ArgPack&) const [with ArgPack = boost::parameter::aux::arg_list >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&> >, boost::parameter::aux::empty_arg_list, std::integral_constant >; Graph1 = boost::adjacency_list >; Graph2 = boost::adjacency_list >]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/isomorphism.hpp:662:5: required from ‘typename boost::result_of(Param0, Param1, const ArgPack&)>::type boost::graph::isomorphism_with_named_params(const Param0&, const Param1&, const ArgPack&) [with Param0 = boost::adjacency_list >; Param1 = boost::adjacency_list >; ArgPack = boost::parameter::aux::arg_list >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&> >, boost::parameter::aux::empty_arg_list, std::integral_constant >; typename boost::result_of(Param0, Param1, const ArgPack&)>::type = bool]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/isomorphism.hpp:666:1: required from ‘typename boost::result_of(Param0, Param1, const typename boost::detail::convert_bgl_params_to_boost_parameter >::type&)>::type boost::isomorphism(const Param0&, const Param1&, const bgl_named_params&) [with Param0 = adjacency_list >; Param1 = adjacency_list >; P = iterator_property_map<__gnu_cxx::__normal_iterator >, adj_list_vertex_property_map >, int, int&, vertex_index_t>, void*, void*&>; T = vertex_isomorphism_t; R = no_property; typename result_of(Param0, Param1, const typename detail::convert_bgl_params_to_boost_parameter >::type&)>::type = bool; typename detail::convert_bgl_params_to_boost_parameter >::type = parameter::aux::arg_list >, adj_list_vertex_property_map >, int, int&, vertex_index_t>, void*, void*&> >, parameter::aux::empty_arg_list, std::integral_constant >]’ ordering.cpp:68:18: required from here /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::Convertible::~Convertible() [with X = void*; Y = void*]’ 37 | ~model() | ^ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:208:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 208 | BOOST_CONCEPT_USAGE(Convertible) { | ^~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::Assignable<__gnu_cxx::__normal_iterator > >]’: /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements > > >]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:145:5: required from ‘struct boost::Assignable<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:502:3: required from ‘struct boost::InputIterator<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:540:3: required from ‘struct boost::ForwardIterator<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:568:3: required from ‘struct boost::BidirectionalIterator<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:597:3: [ skipping 7 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/isomorphism.hpp:153:51: required from ‘boost::detail::isomorphism_algo::isomorphism_algo(const Graph1&, const Graph2&, IsoMapping, Invariant1, Invariant2, std::size_t, IndexMap1, IndexMap2) [with Graph1 = boost::adjacency_list >; Graph2 = boost::adjacency_list >; IsoMapping = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&>; Invariant1 = boost::degree_vertex_invariant >, int, const int&, boost::vertex_index_t> >, boost::adjacency_list > >; Invariant2 = boost::degree_vertex_invariant >, int, const int&, boost::vertex_index_t> >, boost::adjacency_list > >; IndexMap1 = boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>; IndexMap2 = boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>; std::size_t = long unsigned int]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/isomorphism.hpp:530:9: required from ‘bool boost::isomorphism(const Graph1&, const Graph2&, IsoMapping, Invariant1, Invariant2, std::size_t, IndexMap1, IndexMap2) [with Graph1 = adjacency_list >; Graph2 = adjacency_list >; IsoMapping = iterator_property_map<__gnu_cxx::__normal_iterator >, adj_list_vertex_property_map >, int, int&, vertex_index_t>, void*, void*&>; Invariant1 = degree_vertex_invariant >, int, const int&, vertex_index_t> >, adjacency_list > >; Invariant2 = degree_vertex_invariant >, int, const int&, vertex_index_t> >, adjacency_list > >; IndexMap1 = adj_list_vertex_property_map >, int, const int&, vertex_index_t>; IndexMap2 = adj_list_vertex_property_map >, int, const int&, vertex_index_t>; std::size_t = long unsigned int]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/isomorphism.hpp:651:42: required from ‘bool boost::graph::detail::isomorphism_impl::operator()(const Graph1&, const Graph2&, const ArgPack&) const [with ArgPack = boost::parameter::aux::arg_list >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&> >, boost::parameter::aux::empty_arg_list, std::integral_constant >; Graph1 = boost::adjacency_list >; Graph2 = boost::adjacency_list >]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/isomorphism.hpp:662:5: required from ‘typename boost::result_of(Param0, Param1, const ArgPack&)>::type boost::graph::isomorphism_with_named_params(const Param0&, const Param1&, const ArgPack&) [with Param0 = boost::adjacency_list >; Param1 = boost::adjacency_list >; ArgPack = boost::parameter::aux::arg_list >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&> >, boost::parameter::aux::empty_arg_list, std::integral_constant >; typename boost::result_of(Param0, Param1, const ArgPack&)>::type = bool]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/isomorphism.hpp:666:1: required from ‘typename boost::result_of(Param0, Param1, const typename boost::detail::convert_bgl_params_to_boost_parameter >::type&)>::type boost::isomorphism(const Param0&, const Param1&, const bgl_named_params&) [with Param0 = adjacency_list >; Param1 = adjacency_list >; P = iterator_property_map<__gnu_cxx::__normal_iterator >, adj_list_vertex_property_map >, int, int&, vertex_index_t>, void*, void*&>; T = vertex_isomorphism_t; R = no_property; typename result_of(Param0, Param1, const typename detail::convert_bgl_params_to_boost_parameter >::type&)>::type = bool; typename detail::convert_bgl_params_to_boost_parameter >::type = parameter::aux::arg_list >, adj_list_vertex_property_map >, int, int&, vertex_index_t>, void*, void*&> >, parameter::aux::empty_arg_list, std::integral_constant >]’ ordering.cpp:68:18: required from here /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::Assignable::~Assignable() [with TT = __gnu_cxx::__normal_iterator >]’ 37 | ~model() | ^ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:145:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 145 | BOOST_CONCEPT_USAGE(Assignable) { | ^~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::EqualityComparable<__gnu_cxx::__normal_iterator > >]’: /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements > > >]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:233:5: required from ‘struct boost::EqualityComparable<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:502:3: required from ‘struct boost::InputIterator<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:540:3: required from ‘struct boost::ForwardIterator<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:568:3: required from ‘struct boost::BidirectionalIterator<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:597:3: [ skipping 7 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/isomorphism.hpp:153:51: required from ‘boost::detail::isomorphism_algo::isomorphism_algo(const Graph1&, const Graph2&, IsoMapping, Invariant1, Invariant2, std::size_t, IndexMap1, IndexMap2) [with Graph1 = boost::adjacency_list >; Graph2 = boost::adjacency_list >; IsoMapping = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&>; Invariant1 = boost::degree_vertex_invariant >, int, const int&, boost::vertex_index_t> >, boost::adjacency_list > >; Invariant2 = boost::degree_vertex_invariant >, int, const int&, boost::vertex_index_t> >, boost::adjacency_list > >; IndexMap1 = boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>; IndexMap2 = boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>; std::size_t = long unsigned int]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/isomorphism.hpp:530:9: required from ‘bool boost::isomorphism(const Graph1&, const Graph2&, IsoMapping, Invariant1, Invariant2, std::size_t, IndexMap1, IndexMap2) [with Graph1 = adjacency_list >; Graph2 = adjacency_list >; IsoMapping = iterator_property_map<__gnu_cxx::__normal_iterator >, adj_list_vertex_property_map >, int, int&, vertex_index_t>, void*, void*&>; Invariant1 = degree_vertex_invariant >, int, const int&, vertex_index_t> >, adjacency_list > >; Invariant2 = degree_vertex_invariant >, int, const int&, vertex_index_t> >, adjacency_list > >; IndexMap1 = adj_list_vertex_property_map >, int, const int&, vertex_index_t>; IndexMap2 = adj_list_vertex_property_map >, int, const int&, vertex_index_t>; std::size_t = long unsigned int]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/isomorphism.hpp:651:42: required from ‘bool boost::graph::detail::isomorphism_impl::operator()(const Graph1&, const Graph2&, const ArgPack&) const [with ArgPack = boost::parameter::aux::arg_list >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&> >, boost::parameter::aux::empty_arg_list, std::integral_constant >; Graph1 = boost::adjacency_list >; Graph2 = boost::adjacency_list >]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/isomorphism.hpp:662:5: required from ‘typename boost::result_of(Param0, Param1, const ArgPack&)>::type boost::graph::isomorphism_with_named_params(const Param0&, const Param1&, const ArgPack&) [with Param0 = boost::adjacency_list >; Param1 = boost::adjacency_list >; ArgPack = boost::parameter::aux::arg_list >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&> >, boost::parameter::aux::empty_arg_list, std::integral_constant >; typename boost::result_of(Param0, Param1, const ArgPack&)>::type = bool]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/isomorphism.hpp:666:1: required from ‘typename boost::result_of(Param0, Param1, const typename boost::detail::convert_bgl_params_to_boost_parameter >::type&)>::type boost::isomorphism(const Param0&, const Param1&, const bgl_named_params&) [with Param0 = adjacency_list >; Param1 = adjacency_list >; P = iterator_property_map<__gnu_cxx::__normal_iterator >, adj_list_vertex_property_map >, int, int&, vertex_index_t>, void*, void*&>; T = vertex_isomorphism_t; R = no_property; typename result_of(Param0, Param1, const typename detail::convert_bgl_params_to_boost_parameter >::type&)>::type = bool; typename detail::convert_bgl_params_to_boost_parameter >::type = parameter::aux::arg_list >, adj_list_vertex_property_map >, int, int&, vertex_index_t>, void*, void*&> >, parameter::aux::empty_arg_list, std::integral_constant >]’ ordering.cpp:68:18: required from here /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::EqualityComparable::~EqualityComparable() [with TT = __gnu_cxx::__normal_iterator >]’ 37 | ~model() | ^ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:233:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 233 | BOOST_CONCEPT_USAGE(EqualityComparable) { | ^~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::InputIterator<__gnu_cxx::__normal_iterator > >]’: /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements > > >]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:512:7: required from ‘struct boost::InputIterator<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:540:3: required from ‘struct boost::ForwardIterator<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:568:3: required from ‘struct boost::BidirectionalIterator<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:597:3: required from ‘struct boost::RandomAccessIterator<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:597:3: [ skipping 6 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/isomorphism.hpp:153:51: required from ‘boost::detail::isomorphism_algo::isomorphism_algo(const Graph1&, const Graph2&, IsoMapping, Invariant1, Invariant2, std::size_t, IndexMap1, IndexMap2) [with Graph1 = boost::adjacency_list >; Graph2 = boost::adjacency_list >; IsoMapping = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&>; Invariant1 = boost::degree_vertex_invariant >, int, const int&, boost::vertex_index_t> >, boost::adjacency_list > >; Invariant2 = boost::degree_vertex_invariant >, int, const int&, boost::vertex_index_t> >, boost::adjacency_list > >; IndexMap1 = boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>; IndexMap2 = boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>; std::size_t = long unsigned int]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/isomorphism.hpp:530:9: required from ‘bool boost::isomorphism(const Graph1&, const Graph2&, IsoMapping, Invariant1, Invariant2, std::size_t, IndexMap1, IndexMap2) [with Graph1 = adjacency_list >; Graph2 = adjacency_list >; IsoMapping = iterator_property_map<__gnu_cxx::__normal_iterator >, adj_list_vertex_property_map >, int, int&, vertex_index_t>, void*, void*&>; Invariant1 = degree_vertex_invariant >, int, const int&, vertex_index_t> >, adjacency_list > >; Invariant2 = degree_vertex_invariant >, int, const int&, vertex_index_t> >, adjacency_list > >; IndexMap1 = adj_list_vertex_property_map >, int, const int&, vertex_index_t>; IndexMap2 = adj_list_vertex_property_map >, int, const int&, vertex_index_t>; std::size_t = long unsigned int]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/isomorphism.hpp:651:42: required from ‘bool boost::graph::detail::isomorphism_impl::operator()(const Graph1&, const Graph2&, const ArgPack&) const [with ArgPack = boost::parameter::aux::arg_list >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&> >, boost::parameter::aux::empty_arg_list, std::integral_constant >; Graph1 = boost::adjacency_list >; Graph2 = boost::adjacency_list >]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/isomorphism.hpp:662:5: required from ‘typename boost::result_of(Param0, Param1, const ArgPack&)>::type boost::graph::isomorphism_with_named_params(const Param0&, const Param1&, const ArgPack&) [with Param0 = boost::adjacency_list >; Param1 = boost::adjacency_list >; ArgPack = boost::parameter::aux::arg_list >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&> >, boost::parameter::aux::empty_arg_list, std::integral_constant >; typename boost::result_of(Param0, Param1, const ArgPack&)>::type = bool]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/isomorphism.hpp:666:1: required from ‘typename boost::result_of(Param0, Param1, const typename boost::detail::convert_bgl_params_to_boost_parameter >::type&)>::type boost::isomorphism(const Param0&, const Param1&, const bgl_named_params&) [with Param0 = adjacency_list >; Param1 = adjacency_list >; P = iterator_property_map<__gnu_cxx::__normal_iterator >, adj_list_vertex_property_map >, int, int&, vertex_index_t>, void*, void*&>; T = vertex_isomorphism_t; R = no_property; typename result_of(Param0, Param1, const typename detail::convert_bgl_params_to_boost_parameter >::type&)>::type = bool; typename detail::convert_bgl_params_to_boost_parameter >::type = parameter::aux::arg_list >, adj_list_vertex_property_map >, int, int&, vertex_index_t>, void*, void*&> >, parameter::aux::empty_arg_list, std::integral_constant >]’ ordering.cpp:68:18: required from here /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::InputIterator::~InputIterator() [with TT = __gnu_cxx::__normal_iterator >]’ 37 | ~model() | ^ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:512:7: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 512 | BOOST_CONCEPT_USAGE(InputIterator) | ^~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::ForwardIterator<__gnu_cxx::__normal_iterator > >]’: /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements > > >]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:543:7: required from ‘struct boost::ForwardIterator<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:568:3: required from ‘struct boost::BidirectionalIterator<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:597:3: required from ‘struct boost::RandomAccessIterator<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:597:3: required from ‘struct boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:32:62: [ skipping 5 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/isomorphism.hpp:153:51: required from ‘boost::detail::isomorphism_algo::isomorphism_algo(const Graph1&, const Graph2&, IsoMapping, Invariant1, Invariant2, std::size_t, IndexMap1, IndexMap2) [with Graph1 = boost::adjacency_list >; Graph2 = boost::adjacency_list >; IsoMapping = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&>; Invariant1 = boost::degree_vertex_invariant >, int, const int&, boost::vertex_index_t> >, boost::adjacency_list > >; Invariant2 = boost::degree_vertex_invariant >, int, const int&, boost::vertex_index_t> >, boost::adjacency_list > >; IndexMap1 = boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>; IndexMap2 = boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>; std::size_t = long unsigned int]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/isomorphism.hpp:530:9: required from ‘bool boost::isomorphism(const Graph1&, const Graph2&, IsoMapping, Invariant1, Invariant2, std::size_t, IndexMap1, IndexMap2) [with Graph1 = adjacency_list >; Graph2 = adjacency_list >; IsoMapping = iterator_property_map<__gnu_cxx::__normal_iterator >, adj_list_vertex_property_map >, int, int&, vertex_index_t>, void*, void*&>; Invariant1 = degree_vertex_invariant >, int, const int&, vertex_index_t> >, adjacency_list > >; Invariant2 = degree_vertex_invariant >, int, const int&, vertex_index_t> >, adjacency_list > >; IndexMap1 = adj_list_vertex_property_map >, int, const int&, vertex_index_t>; IndexMap2 = adj_list_vertex_property_map >, int, const int&, vertex_index_t>; std::size_t = long unsigned int]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/isomorphism.hpp:651:42: required from ‘bool boost::graph::detail::isomorphism_impl::operator()(const Graph1&, const Graph2&, const ArgPack&) const [with ArgPack = boost::parameter::aux::arg_list >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&> >, boost::parameter::aux::empty_arg_list, std::integral_constant >; Graph1 = boost::adjacency_list >; Graph2 = boost::adjacency_list >]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/isomorphism.hpp:662:5: required from ‘typename boost::result_of(Param0, Param1, const ArgPack&)>::type boost::graph::isomorphism_with_named_params(const Param0&, const Param1&, const ArgPack&) [with Param0 = boost::adjacency_list >; Param1 = boost::adjacency_list >; ArgPack = boost::parameter::aux::arg_list >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&> >, boost::parameter::aux::empty_arg_list, std::integral_constant >; typename boost::result_of(Param0, Param1, const ArgPack&)>::type = bool]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/isomorphism.hpp:666:1: required from ‘typename boost::result_of(Param0, Param1, const typename boost::detail::convert_bgl_params_to_boost_parameter >::type&)>::type boost::isomorphism(const Param0&, const Param1&, const bgl_named_params&) [with Param0 = adjacency_list >; Param1 = adjacency_list >; P = iterator_property_map<__gnu_cxx::__normal_iterator >, adj_list_vertex_property_map >, int, int&, vertex_index_t>, void*, void*&>; T = vertex_isomorphism_t; R = no_property; typename result_of(Param0, Param1, const typename detail::convert_bgl_params_to_boost_parameter >::type&)>::type = bool; typename detail::convert_bgl_params_to_boost_parameter >::type = parameter::aux::arg_list >, adj_list_vertex_property_map >, int, int&, vertex_index_t>, void*, void*&> >, parameter::aux::empty_arg_list, std::integral_constant >]’ ordering.cpp:68:18: required from here /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::ForwardIterator::~ForwardIterator() [with TT = __gnu_cxx::__normal_iterator >]’ 37 | ~model() | ^ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:543:7: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 543 | BOOST_CONCEPT_USAGE(ForwardIterator) | ^~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::BidirectionalIterator<__gnu_cxx::__normal_iterator > >]’: /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements > > >]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:571:7: required from ‘struct boost::BidirectionalIterator<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:597:3: required from ‘struct boost::RandomAccessIterator<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:597:3: required from ‘struct boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator > >]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:42:5: [ skipping 4 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/isomorphism.hpp:153:51: required from ‘boost::detail::isomorphism_algo::isomorphism_algo(const Graph1&, const Graph2&, IsoMapping, Invariant1, Invariant2, std::size_t, IndexMap1, IndexMap2) [with Graph1 = boost::adjacency_list >; Graph2 = boost::adjacency_list >; IsoMapping = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&>; Invariant1 = boost::degree_vertex_invariant >, int, const int&, boost::vertex_index_t> >, boost::adjacency_list > >; Invariant2 = boost::degree_vertex_invariant >, int, const int&, boost::vertex_index_t> >, boost::adjacency_list > >; IndexMap1 = boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>; IndexMap2 = boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>; std::size_t = long unsigned int]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/isomorphism.hpp:530:9: required from ‘bool boost::isomorphism(const Graph1&, const Graph2&, IsoMapping, Invariant1, Invariant2, std::size_t, IndexMap1, IndexMap2) [with Graph1 = adjacency_list >; Graph2 = adjacency_list >; IsoMapping = iterator_property_map<__gnu_cxx::__normal_iterator >, adj_list_vertex_property_map >, int, int&, vertex_index_t>, void*, void*&>; Invariant1 = degree_vertex_invariant >, int, const int&, vertex_index_t> >, adjacency_list > >; Invariant2 = degree_vertex_invariant >, int, const int&, vertex_index_t> >, adjacency_list > >; IndexMap1 = adj_list_vertex_property_map >, int, const int&, vertex_index_t>; IndexMap2 = adj_list_vertex_property_map >, int, const int&, vertex_index_t>; std::size_t = long unsigned int]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/isomorphism.hpp:651:42: required from ‘bool boost::graph::detail::isomorphism_impl::operator()(const Graph1&, const Graph2&, const ArgPack&) const [with ArgPack = boost::parameter::aux::arg_list >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&> >, boost::parameter::aux::empty_arg_list, std::integral_constant >; Graph1 = boost::adjacency_list >; Graph2 = boost::adjacency_list >]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/isomorphism.hpp:662:5: required from ‘typename boost::result_of(Param0, Param1, const ArgPack&)>::type boost::graph::isomorphism_with_named_params(const Param0&, const Param1&, const ArgPack&) [with Param0 = boost::adjacency_list >; Param1 = boost::adjacency_list >; ArgPack = boost::parameter::aux::arg_list >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&> >, boost::parameter::aux::empty_arg_list, std::integral_constant >; typename boost::result_of(Param0, Param1, const ArgPack&)>::type = bool]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/isomorphism.hpp:666:1: required from ‘typename boost::result_of(Param0, Param1, const typename boost::detail::convert_bgl_params_to_boost_parameter >::type&)>::type boost::isomorphism(const Param0&, const Param1&, const bgl_named_params&) [with Param0 = adjacency_list >; Param1 = adjacency_list >; P = iterator_property_map<__gnu_cxx::__normal_iterator >, adj_list_vertex_property_map >, int, int&, vertex_index_t>, void*, void*&>; T = vertex_isomorphism_t; R = no_property; typename result_of(Param0, Param1, const typename detail::convert_bgl_params_to_boost_parameter >::type&)>::type = bool; typename detail::convert_bgl_params_to_boost_parameter >::type = parameter::aux::arg_list >, adj_list_vertex_property_map >, int, int&, vertex_index_t>, void*, void*&> >, parameter::aux::empty_arg_list, std::integral_constant >]’ ordering.cpp:68:18: required from here /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::BidirectionalIterator::~BidirectionalIterator() [with TT = __gnu_cxx::__normal_iterator >]’ 37 | ~model() | ^ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:571:7: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 571 | BOOST_CONCEPT_USAGE(BidirectionalIterator) | ^~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::Comparable<__gnu_cxx::__normal_iterator > >]’: /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements > > >]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:253:5: required from ‘struct boost::Comparable<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:597:3: required from ‘struct boost::RandomAccessIterator<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:597:3: required from ‘struct boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator > >]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:42:5: [ skipping 4 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/isomorphism.hpp:153:51: required from ‘boost::detail::isomorphism_algo::isomorphism_algo(const Graph1&, const Graph2&, IsoMapping, Invariant1, Invariant2, std::size_t, IndexMap1, IndexMap2) [with Graph1 = boost::adjacency_list >; Graph2 = boost::adjacency_list >; IsoMapping = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&>; Invariant1 = boost::degree_vertex_invariant >, int, const int&, boost::vertex_index_t> >, boost::adjacency_list > >; Invariant2 = boost::degree_vertex_invariant >, int, const int&, boost::vertex_index_t> >, boost::adjacency_list > >; IndexMap1 = boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>; IndexMap2 = boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>; std::size_t = long unsigned int]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/isomorphism.hpp:530:9: required from ‘bool boost::isomorphism(const Graph1&, const Graph2&, IsoMapping, Invariant1, Invariant2, std::size_t, IndexMap1, IndexMap2) [with Graph1 = adjacency_list >; Graph2 = adjacency_list >; IsoMapping = iterator_property_map<__gnu_cxx::__normal_iterator >, adj_list_vertex_property_map >, int, int&, vertex_index_t>, void*, void*&>; Invariant1 = degree_vertex_invariant >, int, const int&, vertex_index_t> >, adjacency_list > >; Invariant2 = degree_vertex_invariant >, int, const int&, vertex_index_t> >, adjacency_list > >; IndexMap1 = adj_list_vertex_property_map >, int, const int&, vertex_index_t>; IndexMap2 = adj_list_vertex_property_map >, int, const int&, vertex_index_t>; std::size_t = long unsigned int]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/isomorphism.hpp:651:42: required from ‘bool boost::graph::detail::isomorphism_impl::operator()(const Graph1&, const Graph2&, const ArgPack&) const [with ArgPack = boost::parameter::aux::arg_list >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&> >, boost::parameter::aux::empty_arg_list, std::integral_constant >; Graph1 = boost::adjacency_list >; Graph2 = boost::adjacency_list >]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/isomorphism.hpp:662:5: required from ‘typename boost::result_of(Param0, Param1, const ArgPack&)>::type boost::graph::isomorphism_with_named_params(const Param0&, const Param1&, const ArgPack&) [with Param0 = boost::adjacency_list >; Param1 = boost::adjacency_list >; ArgPack = boost::parameter::aux::arg_list >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&> >, boost::parameter::aux::empty_arg_list, std::integral_constant >; typename boost::result_of(Param0, Param1, const ArgPack&)>::type = bool]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/isomorphism.hpp:666:1: required from ‘typename boost::result_of(Param0, Param1, const typename boost::detail::convert_bgl_params_to_boost_parameter >::type&)>::type boost::isomorphism(const Param0&, const Param1&, const bgl_named_params&) [with Param0 = adjacency_list >; Param1 = adjacency_list >; P = iterator_property_map<__gnu_cxx::__normal_iterator >, adj_list_vertex_property_map >, int, int&, vertex_index_t>, void*, void*&>; T = vertex_isomorphism_t; R = no_property; typename result_of(Param0, Param1, const typename detail::convert_bgl_params_to_boost_parameter >::type&)>::type = bool; typename detail::convert_bgl_params_to_boost_parameter >::type = parameter::aux::arg_list >, adj_list_vertex_property_map >, int, int&, vertex_index_t>, void*, void*&> >, parameter::aux::empty_arg_list, std::integral_constant >]’ ordering.cpp:68:18: required from here /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::Comparable::~Comparable() [with TT = __gnu_cxx::__normal_iterator >]’ 37 | ~model() | ^ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:253:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 253 | BOOST_CONCEPT_USAGE(Comparable) { | ^~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::RandomAccessIterator<__gnu_cxx::__normal_iterator > >]’: /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements > > >]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:601:7: required from ‘struct boost::RandomAccessIterator<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:597:3: required from ‘struct boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator > >]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied > > >::value’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:45:51: [ skipping 3 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/isomorphism.hpp:153:51: required from ‘boost::detail::isomorphism_algo::isomorphism_algo(const Graph1&, const Graph2&, IsoMapping, Invariant1, Invariant2, std::size_t, IndexMap1, IndexMap2) [with Graph1 = boost::adjacency_list >; Graph2 = boost::adjacency_list >; IsoMapping = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&>; Invariant1 = boost::degree_vertex_invariant >, int, const int&, boost::vertex_index_t> >, boost::adjacency_list > >; Invariant2 = boost::degree_vertex_invariant >, int, const int&, boost::vertex_index_t> >, boost::adjacency_list > >; IndexMap1 = boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>; IndexMap2 = boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>; std::size_t = long unsigned int]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/isomorphism.hpp:530:9: required from ‘bool boost::isomorphism(const Graph1&, const Graph2&, IsoMapping, Invariant1, Invariant2, std::size_t, IndexMap1, IndexMap2) [with Graph1 = adjacency_list >; Graph2 = adjacency_list >; IsoMapping = iterator_property_map<__gnu_cxx::__normal_iterator >, adj_list_vertex_property_map >, int, int&, vertex_index_t>, void*, void*&>; Invariant1 = degree_vertex_invariant >, int, const int&, vertex_index_t> >, adjacency_list > >; Invariant2 = degree_vertex_invariant >, int, const int&, vertex_index_t> >, adjacency_list > >; IndexMap1 = adj_list_vertex_property_map >, int, const int&, vertex_index_t>; IndexMap2 = adj_list_vertex_property_map >, int, const int&, vertex_index_t>; std::size_t = long unsigned int]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/isomorphism.hpp:651:42: required from ‘bool boost::graph::detail::isomorphism_impl::operator()(const Graph1&, const Graph2&, const ArgPack&) const [with ArgPack = boost::parameter::aux::arg_list >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&> >, boost::parameter::aux::empty_arg_list, std::integral_constant >; Graph1 = boost::adjacency_list >; Graph2 = boost::adjacency_list >]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/isomorphism.hpp:662:5: required from ‘typename boost::result_of(Param0, Param1, const ArgPack&)>::type boost::graph::isomorphism_with_named_params(const Param0&, const Param1&, const ArgPack&) [with Param0 = boost::adjacency_list >; Param1 = boost::adjacency_list >; ArgPack = boost::parameter::aux::arg_list >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&> >, boost::parameter::aux::empty_arg_list, std::integral_constant >; typename boost::result_of(Param0, Param1, const ArgPack&)>::type = bool]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/isomorphism.hpp:666:1: required from ‘typename boost::result_of(Param0, Param1, const typename boost::detail::convert_bgl_params_to_boost_parameter >::type&)>::type boost::isomorphism(const Param0&, const Param1&, const bgl_named_params&) [with Param0 = adjacency_list >; Param1 = adjacency_list >; P = iterator_property_map<__gnu_cxx::__normal_iterator >, adj_list_vertex_property_map >, int, int&, vertex_index_t>, void*, void*&>; T = vertex_isomorphism_t; R = no_property; typename result_of(Param0, Param1, const typename detail::convert_bgl_params_to_boost_parameter >::type&)>::type = bool; typename detail::convert_bgl_params_to_boost_parameter >::type = parameter::aux::arg_list >, adj_list_vertex_property_map >, int, int&, vertex_index_t>, void*, void*&> >, parameter::aux::empty_arg_list, std::integral_constant >]’ ordering.cpp:68:18: required from here /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::RandomAccessIterator::~RandomAccessIterator() [with TT = __gnu_cxx::__normal_iterator >]’ 37 | ~model() | ^ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:601:7: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 601 | BOOST_CONCEPT_USAGE(RandomAccessIterator) | ^~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::CopyConstructible<__gnu_cxx::__normal_iterator > >]’: /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements > > >]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:167:5: required from ‘struct boost::CopyConstructible<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/range/concepts.hpp:125:16: required from ‘struct boost::range_detail::IncrementableIteratorConcept<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/range/concepts.hpp:147:16: required from ‘struct boost::range_detail::SinglePassIteratorConcept<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::range_detail::SinglePassIteratorConcept<__gnu_cxx::__normal_iterator > >]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:42:5: [ skipping 12 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/isomorphism.hpp:172:21: required from ‘bool boost::detail::isomorphism_algo::test_isomorphism() [with Graph1 = boost::adjacency_list >; Graph2 = boost::adjacency_list >; IsoMapping = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&>; Invariant1 = boost::degree_vertex_invariant >, int, const int&, boost::vertex_index_t> >, boost::adjacency_list > >; Invariant2 = boost::degree_vertex_invariant >, int, const int&, boost::vertex_index_t> >, boost::adjacency_list > >; IndexMap1 = boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>; IndexMap2 = boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/isomorphism.hpp:532:33: required from ‘bool boost::isomorphism(const Graph1&, const Graph2&, IsoMapping, Invariant1, Invariant2, std::size_t, IndexMap1, IndexMap2) [with Graph1 = adjacency_list >; Graph2 = adjacency_list >; IsoMapping = iterator_property_map<__gnu_cxx::__normal_iterator >, adj_list_vertex_property_map >, int, int&, vertex_index_t>, void*, void*&>; Invariant1 = degree_vertex_invariant >, int, const int&, vertex_index_t> >, adjacency_list > >; Invariant2 = degree_vertex_invariant >, int, const int&, vertex_index_t> >, adjacency_list > >; IndexMap1 = adj_list_vertex_property_map >, int, const int&, vertex_index_t>; IndexMap2 = adj_list_vertex_property_map >, int, const int&, vertex_index_t>; std::size_t = long unsigned int]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/isomorphism.hpp:651:42: required from ‘bool boost::graph::detail::isomorphism_impl::operator()(const Graph1&, const Graph2&, const ArgPack&) const [with ArgPack = boost::parameter::aux::arg_list >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&> >, boost::parameter::aux::empty_arg_list, std::integral_constant >; Graph1 = boost::adjacency_list >; Graph2 = boost::adjacency_list >]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/isomorphism.hpp:662:5: required from ‘typename boost::result_of(Param0, Param1, const ArgPack&)>::type boost::graph::isomorphism_with_named_params(const Param0&, const Param1&, const ArgPack&) [with Param0 = boost::adjacency_list >; Param1 = boost::adjacency_list >; ArgPack = boost::parameter::aux::arg_list >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&> >, boost::parameter::aux::empty_arg_list, std::integral_constant >; typename boost::result_of(Param0, Param1, const ArgPack&)>::type = bool]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/isomorphism.hpp:666:1: required from ‘typename boost::result_of(Param0, Param1, const typename boost::detail::convert_bgl_params_to_boost_parameter >::type&)>::type boost::isomorphism(const Param0&, const Param1&, const bgl_named_params&) [with Param0 = adjacency_list >; Param1 = adjacency_list >; P = iterator_property_map<__gnu_cxx::__normal_iterator >, adj_list_vertex_property_map >, int, int&, vertex_index_t>, void*, void*&>; T = vertex_isomorphism_t; R = no_property; typename result_of(Param0, Param1, const typename detail::convert_bgl_params_to_boost_parameter >::type&)>::type = bool; typename detail::convert_bgl_params_to_boost_parameter >::type = parameter::aux::arg_list >, adj_list_vertex_property_map >, int, int&, vertex_index_t>, void*, void*&> >, parameter::aux::empty_arg_list, std::integral_constant >]’ ordering.cpp:68:18: required from here /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::CopyConstructible::~CopyConstructible() [with TT = __gnu_cxx::__normal_iterator >]’ 37 | ~model() | ^ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:167:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 167 | BOOST_CONCEPT_USAGE(CopyConstructible) { | ^~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::Convertible]’: /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements >]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:208:5: required from ‘struct boost::Convertible’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::Convertible]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied >::value’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:72:8: [ skipping 16 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/isomorphism.hpp:172:21: required from ‘bool boost::detail::isomorphism_algo::test_isomorphism() [with Graph1 = boost::adjacency_list >; Graph2 = boost::adjacency_list >; IsoMapping = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&>; Invariant1 = boost::degree_vertex_invariant >, int, const int&, boost::vertex_index_t> >, boost::adjacency_list > >; Invariant2 = boost::degree_vertex_invariant >, int, const int&, boost::vertex_index_t> >, boost::adjacency_list > >; IndexMap1 = boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>; IndexMap2 = boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/isomorphism.hpp:532:33: required from ‘bool boost::isomorphism(const Graph1&, const Graph2&, IsoMapping, Invariant1, Invariant2, std::size_t, IndexMap1, IndexMap2) [with Graph1 = adjacency_list >; Graph2 = adjacency_list >; IsoMapping = iterator_property_map<__gnu_cxx::__normal_iterator >, adj_list_vertex_property_map >, int, int&, vertex_index_t>, void*, void*&>; Invariant1 = degree_vertex_invariant >, int, const int&, vertex_index_t> >, adjacency_list > >; Invariant2 = degree_vertex_invariant >, int, const int&, vertex_index_t> >, adjacency_list > >; IndexMap1 = adj_list_vertex_property_map >, int, const int&, vertex_index_t>; IndexMap2 = adj_list_vertex_property_map >, int, const int&, vertex_index_t>; std::size_t = long unsigned int]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/isomorphism.hpp:651:42: required from ‘bool boost::graph::detail::isomorphism_impl::operator()(const Graph1&, const Graph2&, const ArgPack&) const [with ArgPack = boost::parameter::aux::arg_list >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&> >, boost::parameter::aux::empty_arg_list, std::integral_constant >; Graph1 = boost::adjacency_list >; Graph2 = boost::adjacency_list >]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/isomorphism.hpp:662:5: required from ‘typename boost::result_of(Param0, Param1, const ArgPack&)>::type boost::graph::isomorphism_with_named_params(const Param0&, const Param1&, const ArgPack&) [with Param0 = boost::adjacency_list >; Param1 = boost::adjacency_list >; ArgPack = boost::parameter::aux::arg_list >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&> >, boost::parameter::aux::empty_arg_list, std::integral_constant >; typename boost::result_of(Param0, Param1, const ArgPack&)>::type = bool]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/isomorphism.hpp:666:1: required from ‘typename boost::result_of(Param0, Param1, const typename boost::detail::convert_bgl_params_to_boost_parameter >::type&)>::type boost::isomorphism(const Param0&, const Param1&, const bgl_named_params&) [with Param0 = adjacency_list >; Param1 = adjacency_list >; P = iterator_property_map<__gnu_cxx::__normal_iterator >, adj_list_vertex_property_map >, int, int&, vertex_index_t>, void*, void*&>; T = vertex_isomorphism_t; R = no_property; typename result_of(Param0, Param1, const typename detail::convert_bgl_params_to_boost_parameter >::type&)>::type = bool; typename detail::convert_bgl_params_to_boost_parameter >::type = parameter::aux::arg_list >, adj_list_vertex_property_map >, int, int&, vertex_index_t>, void*, void*&> >, parameter::aux::empty_arg_list, std::integral_constant >]’ ordering.cpp:68:18: required from here /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::Convertible::~Convertible() [with X = boost::iterators::random_access_traversal_tag; Y = boost::iterators::incrementable_traversal_tag]’ 37 | ~model() | ^ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:208:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 208 | BOOST_CONCEPT_USAGE(Convertible) { | ^~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::range_detail::IncrementableIteratorConcept<__gnu_cxx::__normal_iterator > >]’: /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements > > >]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/range/concepts.hpp:136:13: required from ‘struct boost::range_detail::IncrementableIteratorConcept<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/range/concepts.hpp:147:16: required from ‘struct boost::range_detail::SinglePassIteratorConcept<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::range_detail::SinglePassIteratorConcept<__gnu_cxx::__normal_iterator > >]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied > > >::value’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:45:51: [ skipping 11 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/isomorphism.hpp:172:21: required from ‘bool boost::detail::isomorphism_algo::test_isomorphism() [with Graph1 = boost::adjacency_list >; Graph2 = boost::adjacency_list >; IsoMapping = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&>; Invariant1 = boost::degree_vertex_invariant >, int, const int&, boost::vertex_index_t> >, boost::adjacency_list > >; Invariant2 = boost::degree_vertex_invariant >, int, const int&, boost::vertex_index_t> >, boost::adjacency_list > >; IndexMap1 = boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>; IndexMap2 = boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/isomorphism.hpp:532:33: required from ‘bool boost::isomorphism(const Graph1&, const Graph2&, IsoMapping, Invariant1, Invariant2, std::size_t, IndexMap1, IndexMap2) [with Graph1 = adjacency_list >; Graph2 = adjacency_list >; IsoMapping = iterator_property_map<__gnu_cxx::__normal_iterator >, adj_list_vertex_property_map >, int, int&, vertex_index_t>, void*, void*&>; Invariant1 = degree_vertex_invariant >, int, const int&, vertex_index_t> >, adjacency_list > >; Invariant2 = degree_vertex_invariant >, int, const int&, vertex_index_t> >, adjacency_list > >; IndexMap1 = adj_list_vertex_property_map >, int, const int&, vertex_index_t>; IndexMap2 = adj_list_vertex_property_map >, int, const int&, vertex_index_t>; std::size_t = long unsigned int]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/isomorphism.hpp:651:42: required from ‘bool boost::graph::detail::isomorphism_impl::operator()(const Graph1&, const Graph2&, const ArgPack&) const [with ArgPack = boost::parameter::aux::arg_list >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&> >, boost::parameter::aux::empty_arg_list, std::integral_constant >; Graph1 = boost::adjacency_list >; Graph2 = boost::adjacency_list >]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/isomorphism.hpp:662:5: required from ‘typename boost::result_of(Param0, Param1, const ArgPack&)>::type boost::graph::isomorphism_with_named_params(const Param0&, const Param1&, const ArgPack&) [with Param0 = boost::adjacency_list >; Param1 = boost::adjacency_list >; ArgPack = boost::parameter::aux::arg_list >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&> >, boost::parameter::aux::empty_arg_list, std::integral_constant >; typename boost::result_of(Param0, Param1, const ArgPack&)>::type = bool]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/isomorphism.hpp:666:1: required from ‘typename boost::result_of(Param0, Param1, const typename boost::detail::convert_bgl_params_to_boost_parameter >::type&)>::type boost::isomorphism(const Param0&, const Param1&, const bgl_named_params&) [with Param0 = adjacency_list >; Param1 = adjacency_list >; P = iterator_property_map<__gnu_cxx::__normal_iterator >, adj_list_vertex_property_map >, int, int&, vertex_index_t>, void*, void*&>; T = vertex_isomorphism_t; R = no_property; typename result_of(Param0, Param1, const typename detail::convert_bgl_params_to_boost_parameter >::type&)>::type = bool; typename detail::convert_bgl_params_to_boost_parameter >::type = parameter::aux::arg_list >, adj_list_vertex_property_map >, int, int&, vertex_index_t>, void*, void*&> >, parameter::aux::empty_arg_list, std::integral_constant >]’ ordering.cpp:68:18: required from here /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::range_detail::IncrementableIteratorConcept::~IncrementableIteratorConcept() [with Iterator = __gnu_cxx::__normal_iterator >]’ 37 | ~model() | ^ /home/omnipath/local/R/4.4-3.20/BH/include/boost/range/concepts.hpp:136:13: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 136 | BOOST_CONCEPT_USAGE(IncrementableIteratorConcept) | ^~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::EqualityComparable<__gnu_cxx::__normal_iterator > >]’: /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements > > >]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:233:5: required from ‘struct boost::EqualityComparable<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/range/concepts.hpp:147:16: required from ‘struct boost::range_detail::SinglePassIteratorConcept<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::range_detail::SinglePassIteratorConcept<__gnu_cxx::__normal_iterator > >]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied > > >::value’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:45:51: [ skipping 11 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/isomorphism.hpp:172:21: required from ‘bool boost::detail::isomorphism_algo::test_isomorphism() [with Graph1 = boost::adjacency_list >; Graph2 = boost::adjacency_list >; IsoMapping = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&>; Invariant1 = boost::degree_vertex_invariant >, int, const int&, boost::vertex_index_t> >, boost::adjacency_list > >; Invariant2 = boost::degree_vertex_invariant >, int, const int&, boost::vertex_index_t> >, boost::adjacency_list > >; IndexMap1 = boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>; IndexMap2 = boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/isomorphism.hpp:532:33: required from ‘bool boost::isomorphism(const Graph1&, const Graph2&, IsoMapping, Invariant1, Invariant2, std::size_t, IndexMap1, IndexMap2) [with Graph1 = adjacency_list >; Graph2 = adjacency_list >; IsoMapping = iterator_property_map<__gnu_cxx::__normal_iterator >, adj_list_vertex_property_map >, int, int&, vertex_index_t>, void*, void*&>; Invariant1 = degree_vertex_invariant >, int, const int&, vertex_index_t> >, adjacency_list > >; Invariant2 = degree_vertex_invariant >, int, const int&, vertex_index_t> >, adjacency_list > >; IndexMap1 = adj_list_vertex_property_map >, int, const int&, vertex_index_t>; IndexMap2 = adj_list_vertex_property_map >, int, const int&, vertex_index_t>; std::size_t = long unsigned int]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/isomorphism.hpp:651:42: required from ‘bool boost::graph::detail::isomorphism_impl::operator()(const Graph1&, const Graph2&, const ArgPack&) const [with ArgPack = boost::parameter::aux::arg_list >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&> >, boost::parameter::aux::empty_arg_list, std::integral_constant >; Graph1 = boost::adjacency_list >; Graph2 = boost::adjacency_list >]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/isomorphism.hpp:662:5: required from ‘typename boost::result_of(Param0, Param1, const ArgPack&)>::type boost::graph::isomorphism_with_named_params(const Param0&, const Param1&, const ArgPack&) [with Param0 = boost::adjacency_list >; Param1 = boost::adjacency_list >; ArgPack = boost::parameter::aux::arg_list >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&> >, boost::parameter::aux::empty_arg_list, std::integral_constant >; typename boost::result_of(Param0, Param1, const ArgPack&)>::type = bool]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/isomorphism.hpp:666:1: required from ‘typename boost::result_of(Param0, Param1, const typename boost::detail::convert_bgl_params_to_boost_parameter >::type&)>::type boost::isomorphism(const Param0&, const Param1&, const bgl_named_params&) [with Param0 = adjacency_list >; Param1 = adjacency_list >; P = iterator_property_map<__gnu_cxx::__normal_iterator >, adj_list_vertex_property_map >, int, int&, vertex_index_t>, void*, void*&>; T = vertex_isomorphism_t; R = no_property; typename result_of(Param0, Param1, const typename detail::convert_bgl_params_to_boost_parameter >::type&)>::type = bool; typename detail::convert_bgl_params_to_boost_parameter >::type = parameter::aux::arg_list >, adj_list_vertex_property_map >, int, int&, vertex_index_t>, void*, void*&> >, parameter::aux::empty_arg_list, std::integral_constant >]’ ordering.cpp:68:18: required from here /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::EqualityComparable::~EqualityComparable() [with TT = __gnu_cxx::__normal_iterator >]’ 37 | ~model() | ^ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:233:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 233 | BOOST_CONCEPT_USAGE(EqualityComparable) { | ^~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::Convertible]’: /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements >]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:208:5: required from ‘struct boost::Convertible’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::Convertible]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied >::value’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:72:8: [ skipping 15 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/isomorphism.hpp:172:21: required from ‘bool boost::detail::isomorphism_algo::test_isomorphism() [with Graph1 = boost::adjacency_list >; Graph2 = boost::adjacency_list >; IsoMapping = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&>; Invariant1 = boost::degree_vertex_invariant >, int, const int&, boost::vertex_index_t> >, boost::adjacency_list > >; Invariant2 = boost::degree_vertex_invariant >, int, const int&, boost::vertex_index_t> >, boost::adjacency_list > >; IndexMap1 = boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>; IndexMap2 = boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/isomorphism.hpp:532:33: required from ‘bool boost::isomorphism(const Graph1&, const Graph2&, IsoMapping, Invariant1, Invariant2, std::size_t, IndexMap1, IndexMap2) [with Graph1 = adjacency_list >; Graph2 = adjacency_list >; IsoMapping = iterator_property_map<__gnu_cxx::__normal_iterator >, adj_list_vertex_property_map >, int, int&, vertex_index_t>, void*, void*&>; Invariant1 = degree_vertex_invariant >, int, const int&, vertex_index_t> >, adjacency_list > >; Invariant2 = degree_vertex_invariant >, int, const int&, vertex_index_t> >, adjacency_list > >; IndexMap1 = adj_list_vertex_property_map >, int, const int&, vertex_index_t>; IndexMap2 = adj_list_vertex_property_map >, int, const int&, vertex_index_t>; std::size_t = long unsigned int]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/isomorphism.hpp:651:42: required from ‘bool boost::graph::detail::isomorphism_impl::operator()(const Graph1&, const Graph2&, const ArgPack&) const [with ArgPack = boost::parameter::aux::arg_list >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&> >, boost::parameter::aux::empty_arg_list, std::integral_constant >; Graph1 = boost::adjacency_list >; Graph2 = boost::adjacency_list >]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/isomorphism.hpp:662:5: required from ‘typename boost::result_of(Param0, Param1, const ArgPack&)>::type boost::graph::isomorphism_with_named_params(const Param0&, const Param1&, const ArgPack&) [with Param0 = boost::adjacency_list >; Param1 = boost::adjacency_list >; ArgPack = boost::parameter::aux::arg_list >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&> >, boost::parameter::aux::empty_arg_list, std::integral_constant >; typename boost::result_of(Param0, Param1, const ArgPack&)>::type = bool]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/isomorphism.hpp:666:1: required from ‘typename boost::result_of(Param0, Param1, const typename boost::detail::convert_bgl_params_to_boost_parameter >::type&)>::type boost::isomorphism(const Param0&, const Param1&, const bgl_named_params&) [with Param0 = adjacency_list >; Param1 = adjacency_list >; P = iterator_property_map<__gnu_cxx::__normal_iterator >, adj_list_vertex_property_map >, int, int&, vertex_index_t>, void*, void*&>; T = vertex_isomorphism_t; R = no_property; typename result_of(Param0, Param1, const typename detail::convert_bgl_params_to_boost_parameter >::type&)>::type = bool; typename detail::convert_bgl_params_to_boost_parameter >::type = parameter::aux::arg_list >, adj_list_vertex_property_map >, int, int&, vertex_index_t>, void*, void*&> >, parameter::aux::empty_arg_list, std::integral_constant >]’ ordering.cpp:68:18: required from here /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::Convertible::~Convertible() [with X = boost::iterators::random_access_traversal_tag; Y = boost::iterators::single_pass_traversal_tag]’ 37 | ~model() | ^ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:208:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 208 | BOOST_CONCEPT_USAGE(Convertible) { | ^~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::range_detail::SinglePassIteratorConcept<__gnu_cxx::__normal_iterator > >]’: /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements > > >]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/range/concepts.hpp:158:13: required from ‘struct boost::range_detail::SinglePassIteratorConcept<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::range_detail::SinglePassIteratorConcept<__gnu_cxx::__normal_iterator > >]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied > > >::value’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied > > >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:72:8: [ skipping 10 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/isomorphism.hpp:172:21: required from ‘bool boost::detail::isomorphism_algo::test_isomorphism() [with Graph1 = boost::adjacency_list >; Graph2 = boost::adjacency_list >; IsoMapping = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&>; Invariant1 = boost::degree_vertex_invariant >, int, const int&, boost::vertex_index_t> >, boost::adjacency_list > >; Invariant2 = boost::degree_vertex_invariant >, int, const int&, boost::vertex_index_t> >, boost::adjacency_list > >; IndexMap1 = boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>; IndexMap2 = boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/isomorphism.hpp:532:33: required from ‘bool boost::isomorphism(const Graph1&, const Graph2&, IsoMapping, Invariant1, Invariant2, std::size_t, IndexMap1, IndexMap2) [with Graph1 = adjacency_list >; Graph2 = adjacency_list >; IsoMapping = iterator_property_map<__gnu_cxx::__normal_iterator >, adj_list_vertex_property_map >, int, int&, vertex_index_t>, void*, void*&>; Invariant1 = degree_vertex_invariant >, int, const int&, vertex_index_t> >, adjacency_list > >; Invariant2 = degree_vertex_invariant >, int, const int&, vertex_index_t> >, adjacency_list > >; IndexMap1 = adj_list_vertex_property_map >, int, const int&, vertex_index_t>; IndexMap2 = adj_list_vertex_property_map >, int, const int&, vertex_index_t>; std::size_t = long unsigned int]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/isomorphism.hpp:651:42: required from ‘bool boost::graph::detail::isomorphism_impl::operator()(const Graph1&, const Graph2&, const ArgPack&) const [with ArgPack = boost::parameter::aux::arg_list >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&> >, boost::parameter::aux::empty_arg_list, std::integral_constant >; Graph1 = boost::adjacency_list >; Graph2 = boost::adjacency_list >]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/isomorphism.hpp:662:5: required from ‘typename boost::result_of(Param0, Param1, const ArgPack&)>::type boost::graph::isomorphism_with_named_params(const Param0&, const Param1&, const ArgPack&) [with Param0 = boost::adjacency_list >; Param1 = boost::adjacency_list >; ArgPack = boost::parameter::aux::arg_list >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&> >, boost::parameter::aux::empty_arg_list, std::integral_constant >; typename boost::result_of(Param0, Param1, const ArgPack&)>::type = bool]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/isomorphism.hpp:666:1: required from ‘typename boost::result_of(Param0, Param1, const typename boost::detail::convert_bgl_params_to_boost_parameter >::type&)>::type boost::isomorphism(const Param0&, const Param1&, const bgl_named_params&) [with Param0 = adjacency_list >; Param1 = adjacency_list >; P = iterator_property_map<__gnu_cxx::__normal_iterator >, adj_list_vertex_property_map >, int, int&, vertex_index_t>, void*, void*&>; T = vertex_isomorphism_t; R = no_property; typename result_of(Param0, Param1, const typename detail::convert_bgl_params_to_boost_parameter >::type&)>::type = bool; typename detail::convert_bgl_params_to_boost_parameter >::type = parameter::aux::arg_list >, adj_list_vertex_property_map >, int, int&, vertex_index_t>, void*, void*&> >, parameter::aux::empty_arg_list, std::integral_constant >]’ ordering.cpp:68:18: required from here /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::range_detail::SinglePassIteratorConcept::~SinglePassIteratorConcept() [with Iterator = __gnu_cxx::__normal_iterator >]’ 37 | ~model() | ^ /home/omnipath/local/R/4.4-3.20/BH/include/boost/range/concepts.hpp:158:13: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 158 | BOOST_CONCEPT_USAGE(SinglePassIteratorConcept) | ^~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::CopyConstructible<__gnu_cxx::__normal_iterator > >]’: /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements > > >]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:167:5: required from ‘struct boost::CopyConstructible<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/range/concepts.hpp:125:16: required from ‘struct boost::range_detail::IncrementableIteratorConcept<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/range/concepts.hpp:147:16: required from ‘struct boost::range_detail::SinglePassIteratorConcept<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::range_detail::SinglePassIteratorConcept<__gnu_cxx::__normal_iterator > >]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:42:5: [ skipping 12 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/isomorphism.hpp:172:21: required from ‘bool boost::detail::isomorphism_algo::test_isomorphism() [with Graph1 = boost::adjacency_list >; Graph2 = boost::adjacency_list >; IsoMapping = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&>; Invariant1 = boost::degree_vertex_invariant >, int, const int&, boost::vertex_index_t> >, boost::adjacency_list > >; Invariant2 = boost::degree_vertex_invariant >, int, const int&, boost::vertex_index_t> >, boost::adjacency_list > >; IndexMap1 = boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>; IndexMap2 = boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/isomorphism.hpp:532:33: required from ‘bool boost::isomorphism(const Graph1&, const Graph2&, IsoMapping, Invariant1, Invariant2, std::size_t, IndexMap1, IndexMap2) [with Graph1 = adjacency_list >; Graph2 = adjacency_list >; IsoMapping = iterator_property_map<__gnu_cxx::__normal_iterator >, adj_list_vertex_property_map >, int, int&, vertex_index_t>, void*, void*&>; Invariant1 = degree_vertex_invariant >, int, const int&, vertex_index_t> >, adjacency_list > >; Invariant2 = degree_vertex_invariant >, int, const int&, vertex_index_t> >, adjacency_list > >; IndexMap1 = adj_list_vertex_property_map >, int, const int&, vertex_index_t>; IndexMap2 = adj_list_vertex_property_map >, int, const int&, vertex_index_t>; std::size_t = long unsigned int]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/isomorphism.hpp:651:42: required from ‘bool boost::graph::detail::isomorphism_impl::operator()(const Graph1&, const Graph2&, const ArgPack&) const [with ArgPack = boost::parameter::aux::arg_list >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&> >, boost::parameter::aux::empty_arg_list, std::integral_constant >; Graph1 = boost::adjacency_list >; Graph2 = boost::adjacency_list >]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/isomorphism.hpp:662:5: required from ‘typename boost::result_of(Param0, Param1, const ArgPack&)>::type boost::graph::isomorphism_with_named_params(const Param0&, const Param1&, const ArgPack&) [with Param0 = boost::adjacency_list >; Param1 = boost::adjacency_list >; ArgPack = boost::parameter::aux::arg_list >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&> >, boost::parameter::aux::empty_arg_list, std::integral_constant >; typename boost::result_of(Param0, Param1, const ArgPack&)>::type = bool]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/isomorphism.hpp:666:1: required from ‘typename boost::result_of(Param0, Param1, const typename boost::detail::convert_bgl_params_to_boost_parameter >::type&)>::type boost::isomorphism(const Param0&, const Param1&, const bgl_named_params&) [with Param0 = adjacency_list >; Param1 = adjacency_list >; P = iterator_property_map<__gnu_cxx::__normal_iterator >, adj_list_vertex_property_map >, int, int&, vertex_index_t>, void*, void*&>; T = vertex_isomorphism_t; R = no_property; typename result_of(Param0, Param1, const typename detail::convert_bgl_params_to_boost_parameter >::type&)>::type = bool; typename detail::convert_bgl_params_to_boost_parameter >::type = parameter::aux::arg_list >, adj_list_vertex_property_map >, int, int&, vertex_index_t>, void*, void*&> >, parameter::aux::empty_arg_list, std::integral_constant >]’ ordering.cpp:68:18: required from here /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::CopyConstructible::~CopyConstructible() [with TT = __gnu_cxx::__normal_iterator >]’ 37 | ~model() | ^ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:167:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 167 | BOOST_CONCEPT_USAGE(CopyConstructible) { | ^~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::range_detail::IncrementableIteratorConcept<__gnu_cxx::__normal_iterator > >]’: /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements > > >]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/range/concepts.hpp:136:13: required from ‘struct boost::range_detail::IncrementableIteratorConcept<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/range/concepts.hpp:147:16: required from ‘struct boost::range_detail::SinglePassIteratorConcept<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::range_detail::SinglePassIteratorConcept<__gnu_cxx::__normal_iterator > >]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied > > >::value’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:45:51: [ skipping 11 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/isomorphism.hpp:172:21: required from ‘bool boost::detail::isomorphism_algo::test_isomorphism() [with Graph1 = boost::adjacency_list >; Graph2 = boost::adjacency_list >; IsoMapping = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&>; Invariant1 = boost::degree_vertex_invariant >, int, const int&, boost::vertex_index_t> >, boost::adjacency_list > >; Invariant2 = boost::degree_vertex_invariant >, int, const int&, boost::vertex_index_t> >, boost::adjacency_list > >; IndexMap1 = boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>; IndexMap2 = boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/isomorphism.hpp:532:33: required from ‘bool boost::isomorphism(const Graph1&, const Graph2&, IsoMapping, Invariant1, Invariant2, std::size_t, IndexMap1, IndexMap2) [with Graph1 = adjacency_list >; Graph2 = adjacency_list >; IsoMapping = iterator_property_map<__gnu_cxx::__normal_iterator >, adj_list_vertex_property_map >, int, int&, vertex_index_t>, void*, void*&>; Invariant1 = degree_vertex_invariant >, int, const int&, vertex_index_t> >, adjacency_list > >; Invariant2 = degree_vertex_invariant >, int, const int&, vertex_index_t> >, adjacency_list > >; IndexMap1 = adj_list_vertex_property_map >, int, const int&, vertex_index_t>; IndexMap2 = adj_list_vertex_property_map >, int, const int&, vertex_index_t>; std::size_t = long unsigned int]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/isomorphism.hpp:651:42: required from ‘bool boost::graph::detail::isomorphism_impl::operator()(const Graph1&, const Graph2&, const ArgPack&) const [with ArgPack = boost::parameter::aux::arg_list >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&> >, boost::parameter::aux::empty_arg_list, std::integral_constant >; Graph1 = boost::adjacency_list >; Graph2 = boost::adjacency_list >]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/isomorphism.hpp:662:5: required from ‘typename boost::result_of(Param0, Param1, const ArgPack&)>::type boost::graph::isomorphism_with_named_params(const Param0&, const Param1&, const ArgPack&) [with Param0 = boost::adjacency_list >; Param1 = boost::adjacency_list >; ArgPack = boost::parameter::aux::arg_list >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&> >, boost::parameter::aux::empty_arg_list, std::integral_constant >; typename boost::result_of(Param0, Param1, const ArgPack&)>::type = bool]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/isomorphism.hpp:666:1: required from ‘typename boost::result_of(Param0, Param1, const typename boost::detail::convert_bgl_params_to_boost_parameter >::type&)>::type boost::isomorphism(const Param0&, const Param1&, const bgl_named_params&) [with Param0 = adjacency_list >; Param1 = adjacency_list >; P = iterator_property_map<__gnu_cxx::__normal_iterator >, adj_list_vertex_property_map >, int, int&, vertex_index_t>, void*, void*&>; T = vertex_isomorphism_t; R = no_property; typename result_of(Param0, Param1, const typename detail::convert_bgl_params_to_boost_parameter >::type&)>::type = bool; typename detail::convert_bgl_params_to_boost_parameter >::type = parameter::aux::arg_list >, adj_list_vertex_property_map >, int, int&, vertex_index_t>, void*, void*&> >, parameter::aux::empty_arg_list, std::integral_constant >]’ ordering.cpp:68:18: required from here /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::range_detail::IncrementableIteratorConcept::~IncrementableIteratorConcept() [with Iterator = __gnu_cxx::__normal_iterator >]’ 37 | ~model() | ^ /home/omnipath/local/R/4.4-3.20/BH/include/boost/range/concepts.hpp:136:13: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 136 | BOOST_CONCEPT_USAGE(IncrementableIteratorConcept) | ^~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::EqualityComparable<__gnu_cxx::__normal_iterator > >]’: /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements > > >]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:233:5: required from ‘struct boost::EqualityComparable<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/range/concepts.hpp:147:16: required from ‘struct boost::range_detail::SinglePassIteratorConcept<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::range_detail::SinglePassIteratorConcept<__gnu_cxx::__normal_iterator > >]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied > > >::value’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:45:51: [ skipping 11 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/isomorphism.hpp:172:21: required from ‘bool boost::detail::isomorphism_algo::test_isomorphism() [with Graph1 = boost::adjacency_list >; Graph2 = boost::adjacency_list >; IsoMapping = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&>; Invariant1 = boost::degree_vertex_invariant >, int, const int&, boost::vertex_index_t> >, boost::adjacency_list > >; Invariant2 = boost::degree_vertex_invariant >, int, const int&, boost::vertex_index_t> >, boost::adjacency_list > >; IndexMap1 = boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>; IndexMap2 = boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/isomorphism.hpp:532:33: required from ‘bool boost::isomorphism(const Graph1&, const Graph2&, IsoMapping, Invariant1, Invariant2, std::size_t, IndexMap1, IndexMap2) [with Graph1 = adjacency_list >; Graph2 = adjacency_list >; IsoMapping = iterator_property_map<__gnu_cxx::__normal_iterator >, adj_list_vertex_property_map >, int, int&, vertex_index_t>, void*, void*&>; Invariant1 = degree_vertex_invariant >, int, const int&, vertex_index_t> >, adjacency_list > >; Invariant2 = degree_vertex_invariant >, int, const int&, vertex_index_t> >, adjacency_list > >; IndexMap1 = adj_list_vertex_property_map >, int, const int&, vertex_index_t>; IndexMap2 = adj_list_vertex_property_map >, int, const int&, vertex_index_t>; std::size_t = long unsigned int]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/isomorphism.hpp:651:42: required from ‘bool boost::graph::detail::isomorphism_impl::operator()(const Graph1&, const Graph2&, const ArgPack&) const [with ArgPack = boost::parameter::aux::arg_list >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&> >, boost::parameter::aux::empty_arg_list, std::integral_constant >; Graph1 = boost::adjacency_list >; Graph2 = boost::adjacency_list >]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/isomorphism.hpp:662:5: required from ‘typename boost::result_of(Param0, Param1, const ArgPack&)>::type boost::graph::isomorphism_with_named_params(const Param0&, const Param1&, const ArgPack&) [with Param0 = boost::adjacency_list >; Param1 = boost::adjacency_list >; ArgPack = boost::parameter::aux::arg_list >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&> >, boost::parameter::aux::empty_arg_list, std::integral_constant >; typename boost::result_of(Param0, Param1, const ArgPack&)>::type = bool]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/isomorphism.hpp:666:1: required from ‘typename boost::result_of(Param0, Param1, const typename boost::detail::convert_bgl_params_to_boost_parameter >::type&)>::type boost::isomorphism(const Param0&, const Param1&, const bgl_named_params&) [with Param0 = adjacency_list >; Param1 = adjacency_list >; P = iterator_property_map<__gnu_cxx::__normal_iterator >, adj_list_vertex_property_map >, int, int&, vertex_index_t>, void*, void*&>; T = vertex_isomorphism_t; R = no_property; typename result_of(Param0, Param1, const typename detail::convert_bgl_params_to_boost_parameter >::type&)>::type = bool; typename detail::convert_bgl_params_to_boost_parameter >::type = parameter::aux::arg_list >, adj_list_vertex_property_map >, int, int&, vertex_index_t>, void*, void*&> >, parameter::aux::empty_arg_list, std::integral_constant >]’ ordering.cpp:68:18: required from here /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::EqualityComparable::~EqualityComparable() [with TT = __gnu_cxx::__normal_iterator >]’ 37 | ~model() | ^ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:233:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 233 | BOOST_CONCEPT_USAGE(EqualityComparable) { | ^~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::range_detail::SinglePassIteratorConcept<__gnu_cxx::__normal_iterator > >]’: /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements > > >]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/range/concepts.hpp:158:13: required from ‘struct boost::range_detail::SinglePassIteratorConcept<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::range_detail::SinglePassIteratorConcept<__gnu_cxx::__normal_iterator > >]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied > > >::value’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied > > >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:72:8: [ skipping 10 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/isomorphism.hpp:172:21: required from ‘bool boost::detail::isomorphism_algo::test_isomorphism() [with Graph1 = boost::adjacency_list >; Graph2 = boost::adjacency_list >; IsoMapping = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&>; Invariant1 = boost::degree_vertex_invariant >, int, const int&, boost::vertex_index_t> >, boost::adjacency_list > >; Invariant2 = boost::degree_vertex_invariant >, int, const int&, boost::vertex_index_t> >, boost::adjacency_list > >; IndexMap1 = boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>; IndexMap2 = boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/isomorphism.hpp:532:33: required from ‘bool boost::isomorphism(const Graph1&, const Graph2&, IsoMapping, Invariant1, Invariant2, std::size_t, IndexMap1, IndexMap2) [with Graph1 = adjacency_list >; Graph2 = adjacency_list >; IsoMapping = iterator_property_map<__gnu_cxx::__normal_iterator >, adj_list_vertex_property_map >, int, int&, vertex_index_t>, void*, void*&>; Invariant1 = degree_vertex_invariant >, int, const int&, vertex_index_t> >, adjacency_list > >; Invariant2 = degree_vertex_invariant >, int, const int&, vertex_index_t> >, adjacency_list > >; IndexMap1 = adj_list_vertex_property_map >, int, const int&, vertex_index_t>; IndexMap2 = adj_list_vertex_property_map >, int, const int&, vertex_index_t>; std::size_t = long unsigned int]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/isomorphism.hpp:651:42: required from ‘bool boost::graph::detail::isomorphism_impl::operator()(const Graph1&, const Graph2&, const ArgPack&) const [with ArgPack = boost::parameter::aux::arg_list >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&> >, boost::parameter::aux::empty_arg_list, std::integral_constant >; Graph1 = boost::adjacency_list >; Graph2 = boost::adjacency_list >]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/isomorphism.hpp:662:5: required from ‘typename boost::result_of(Param0, Param1, const ArgPack&)>::type boost::graph::isomorphism_with_named_params(const Param0&, const Param1&, const ArgPack&) [with Param0 = boost::adjacency_list >; Param1 = boost::adjacency_list >; ArgPack = boost::parameter::aux::arg_list >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&> >, boost::parameter::aux::empty_arg_list, std::integral_constant >; typename boost::result_of(Param0, Param1, const ArgPack&)>::type = bool]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/isomorphism.hpp:666:1: required from ‘typename boost::result_of(Param0, Param1, const typename boost::detail::convert_bgl_params_to_boost_parameter >::type&)>::type boost::isomorphism(const Param0&, const Param1&, const bgl_named_params&) [with Param0 = adjacency_list >; Param1 = adjacency_list >; P = iterator_property_map<__gnu_cxx::__normal_iterator >, adj_list_vertex_property_map >, int, int&, vertex_index_t>, void*, void*&>; T = vertex_isomorphism_t; R = no_property; typename result_of(Param0, Param1, const typename detail::convert_bgl_params_to_boost_parameter >::type&)>::type = bool; typename detail::convert_bgl_params_to_boost_parameter >::type = parameter::aux::arg_list >, adj_list_vertex_property_map >, int, int&, vertex_index_t>, void*, void*&> >, parameter::aux::empty_arg_list, std::integral_constant >]’ ordering.cpp:68:18: required from here /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::range_detail::SinglePassIteratorConcept::~SinglePassIteratorConcept() [with Iterator = __gnu_cxx::__normal_iterator >]’ 37 | ~model() | ^ /home/omnipath/local/R/4.4-3.20/BH/include/boost/range/concepts.hpp:158:13: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 158 | BOOST_CONCEPT_USAGE(SinglePassIteratorConcept) | ^~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::SinglePassRangeConcept >]’: /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements > >]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/range/concepts.hpp:284:9: required from ‘struct boost::SinglePassRangeConcept >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/range/concepts.hpp:318:12: required from ‘struct boost::ForwardRangeConcept >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/range/concepts.hpp:352:12: required from ‘struct boost::BidirectionalRangeConcept >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/range/concepts.hpp:370:12: required from ‘struct boost::RandomAccessRangeConcept >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:32:62: [ skipping 5 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/isomorphism.hpp:172:21: required from ‘bool boost::detail::isomorphism_algo::test_isomorphism() [with Graph1 = boost::adjacency_list >; Graph2 = boost::adjacency_list >; IsoMapping = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&>; Invariant1 = boost::degree_vertex_invariant >, int, const int&, boost::vertex_index_t> >, boost::adjacency_list > >; Invariant2 = boost::degree_vertex_invariant >, int, const int&, boost::vertex_index_t> >, boost::adjacency_list > >; IndexMap1 = boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>; IndexMap2 = boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/isomorphism.hpp:532:33: required from ‘bool boost::isomorphism(const Graph1&, const Graph2&, IsoMapping, Invariant1, Invariant2, std::size_t, IndexMap1, IndexMap2) [with Graph1 = adjacency_list >; Graph2 = adjacency_list >; IsoMapping = iterator_property_map<__gnu_cxx::__normal_iterator >, adj_list_vertex_property_map >, int, int&, vertex_index_t>, void*, void*&>; Invariant1 = degree_vertex_invariant >, int, const int&, vertex_index_t> >, adjacency_list > >; Invariant2 = degree_vertex_invariant >, int, const int&, vertex_index_t> >, adjacency_list > >; IndexMap1 = adj_list_vertex_property_map >, int, const int&, vertex_index_t>; IndexMap2 = adj_list_vertex_property_map >, int, const int&, vertex_index_t>; std::size_t = long unsigned int]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/isomorphism.hpp:651:42: required from ‘bool boost::graph::detail::isomorphism_impl::operator()(const Graph1&, const Graph2&, const ArgPack&) const [with ArgPack = boost::parameter::aux::arg_list >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&> >, boost::parameter::aux::empty_arg_list, std::integral_constant >; Graph1 = boost::adjacency_list >; Graph2 = boost::adjacency_list >]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/isomorphism.hpp:662:5: required from ‘typename boost::result_of(Param0, Param1, const ArgPack&)>::type boost::graph::isomorphism_with_named_params(const Param0&, const Param1&, const ArgPack&) [with Param0 = boost::adjacency_list >; Param1 = boost::adjacency_list >; ArgPack = boost::parameter::aux::arg_list >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&> >, boost::parameter::aux::empty_arg_list, std::integral_constant >; typename boost::result_of(Param0, Param1, const ArgPack&)>::type = bool]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/isomorphism.hpp:666:1: required from ‘typename boost::result_of(Param0, Param1, const typename boost::detail::convert_bgl_params_to_boost_parameter >::type&)>::type boost::isomorphism(const Param0&, const Param1&, const bgl_named_params&) [with Param0 = adjacency_list >; Param1 = adjacency_list >; P = iterator_property_map<__gnu_cxx::__normal_iterator >, adj_list_vertex_property_map >, int, int&, vertex_index_t>, void*, void*&>; T = vertex_isomorphism_t; R = no_property; typename result_of(Param0, Param1, const typename detail::convert_bgl_params_to_boost_parameter >::type&)>::type = bool; typename detail::convert_bgl_params_to_boost_parameter >::type = parameter::aux::arg_list >, adj_list_vertex_property_map >, int, int&, vertex_index_t>, void*, void*&> >, parameter::aux::empty_arg_list, std::integral_constant >]’ ordering.cpp:68:18: required from here /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::SinglePassRangeConcept::~SinglePassRangeConcept() [with T = std::vector]’ 37 | ~model() | ^ /home/omnipath/local/R/4.4-3.20/BH/include/boost/range/concepts.hpp:284:9: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 284 | BOOST_CONCEPT_USAGE(SinglePassRangeConcept) | ^~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::DefaultConstructible<__gnu_cxx::__normal_iterator > >]’: /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements > > >]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:137:5: required from ‘struct boost::DefaultConstructible<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/range/concepts.hpp:181:16: required from ‘struct boost::range_detail::ForwardIteratorConcept<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::range_detail::ForwardIteratorConcept<__gnu_cxx::__normal_iterator > >]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied > > >::value’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:45:51: [ skipping 10 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/isomorphism.hpp:172:21: required from ‘bool boost::detail::isomorphism_algo::test_isomorphism() [with Graph1 = boost::adjacency_list >; Graph2 = boost::adjacency_list >; IsoMapping = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&>; Invariant1 = boost::degree_vertex_invariant >, int, const int&, boost::vertex_index_t> >, boost::adjacency_list > >; Invariant2 = boost::degree_vertex_invariant >, int, const int&, boost::vertex_index_t> >, boost::adjacency_list > >; IndexMap1 = boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>; IndexMap2 = boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/isomorphism.hpp:532:33: required from ‘bool boost::isomorphism(const Graph1&, const Graph2&, IsoMapping, Invariant1, Invariant2, std::size_t, IndexMap1, IndexMap2) [with Graph1 = adjacency_list >; Graph2 = adjacency_list >; IsoMapping = iterator_property_map<__gnu_cxx::__normal_iterator >, adj_list_vertex_property_map >, int, int&, vertex_index_t>, void*, void*&>; Invariant1 = degree_vertex_invariant >, int, const int&, vertex_index_t> >, adjacency_list > >; Invariant2 = degree_vertex_invariant >, int, const int&, vertex_index_t> >, adjacency_list > >; IndexMap1 = adj_list_vertex_property_map >, int, const int&, vertex_index_t>; IndexMap2 = adj_list_vertex_property_map >, int, const int&, vertex_index_t>; std::size_t = long unsigned int]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/isomorphism.hpp:651:42: required from ‘bool boost::graph::detail::isomorphism_impl::operator()(const Graph1&, const Graph2&, const ArgPack&) const [with ArgPack = boost::parameter::aux::arg_list >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&> >, boost::parameter::aux::empty_arg_list, std::integral_constant >; Graph1 = boost::adjacency_list >; Graph2 = boost::adjacency_list >]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/isomorphism.hpp:662:5: required from ‘typename boost::result_of(Param0, Param1, const ArgPack&)>::type boost::graph::isomorphism_with_named_params(const Param0&, const Param1&, const ArgPack&) [with Param0 = boost::adjacency_list >; Param1 = boost::adjacency_list >; ArgPack = boost::parameter::aux::arg_list >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&> >, boost::parameter::aux::empty_arg_list, std::integral_constant >; typename boost::result_of(Param0, Param1, const ArgPack&)>::type = bool]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/isomorphism.hpp:666:1: required from ‘typename boost::result_of(Param0, Param1, const typename boost::detail::convert_bgl_params_to_boost_parameter >::type&)>::type boost::isomorphism(const Param0&, const Param1&, const bgl_named_params&) [with Param0 = adjacency_list >; Param1 = adjacency_list >; P = iterator_property_map<__gnu_cxx::__normal_iterator >, adj_list_vertex_property_map >, int, int&, vertex_index_t>, void*, void*&>; T = vertex_isomorphism_t; R = no_property; typename result_of(Param0, Param1, const typename detail::convert_bgl_params_to_boost_parameter >::type&)>::type = bool; typename detail::convert_bgl_params_to_boost_parameter >::type = parameter::aux::arg_list >, adj_list_vertex_property_map >, int, int&, vertex_index_t>, void*, void*&> >, parameter::aux::empty_arg_list, std::integral_constant >]’ ordering.cpp:68:18: required from here /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::DefaultConstructible::~DefaultConstructible() [with TT = __gnu_cxx::__normal_iterator >]’ 37 | ~model() | ^ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:137:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 137 | BOOST_CONCEPT_USAGE(DefaultConstructible) { | ^~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::Convertible]’: /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements >]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:208:5: required from ‘struct boost::Convertible’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::Convertible]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied >::value’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:72:8: [ skipping 14 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/isomorphism.hpp:172:21: required from ‘bool boost::detail::isomorphism_algo::test_isomorphism() [with Graph1 = boost::adjacency_list >; Graph2 = boost::adjacency_list >; IsoMapping = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&>; Invariant1 = boost::degree_vertex_invariant >, int, const int&, boost::vertex_index_t> >, boost::adjacency_list > >; Invariant2 = boost::degree_vertex_invariant >, int, const int&, boost::vertex_index_t> >, boost::adjacency_list > >; IndexMap1 = boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>; IndexMap2 = boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/isomorphism.hpp:532:33: required from ‘bool boost::isomorphism(const Graph1&, const Graph2&, IsoMapping, Invariant1, Invariant2, std::size_t, IndexMap1, IndexMap2) [with Graph1 = adjacency_list >; Graph2 = adjacency_list >; IsoMapping = iterator_property_map<__gnu_cxx::__normal_iterator >, adj_list_vertex_property_map >, int, int&, vertex_index_t>, void*, void*&>; Invariant1 = degree_vertex_invariant >, int, const int&, vertex_index_t> >, adjacency_list > >; Invariant2 = degree_vertex_invariant >, int, const int&, vertex_index_t> >, adjacency_list > >; IndexMap1 = adj_list_vertex_property_map >, int, const int&, vertex_index_t>; IndexMap2 = adj_list_vertex_property_map >, int, const int&, vertex_index_t>; std::size_t = long unsigned int]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/isomorphism.hpp:651:42: required from ‘bool boost::graph::detail::isomorphism_impl::operator()(const Graph1&, const Graph2&, const ArgPack&) const [with ArgPack = boost::parameter::aux::arg_list >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&> >, boost::parameter::aux::empty_arg_list, std::integral_constant >; Graph1 = boost::adjacency_list >; Graph2 = boost::adjacency_list >]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/isomorphism.hpp:662:5: required from ‘typename boost::result_of(Param0, Param1, const ArgPack&)>::type boost::graph::isomorphism_with_named_params(const Param0&, const Param1&, const ArgPack&) [with Param0 = boost::adjacency_list >; Param1 = boost::adjacency_list >; ArgPack = boost::parameter::aux::arg_list >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&> >, boost::parameter::aux::empty_arg_list, std::integral_constant >; typename boost::result_of(Param0, Param1, const ArgPack&)>::type = bool]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/isomorphism.hpp:666:1: required from ‘typename boost::result_of(Param0, Param1, const typename boost::detail::convert_bgl_params_to_boost_parameter >::type&)>::type boost::isomorphism(const Param0&, const Param1&, const bgl_named_params&) [with Param0 = adjacency_list >; Param1 = adjacency_list >; P = iterator_property_map<__gnu_cxx::__normal_iterator >, adj_list_vertex_property_map >, int, int&, vertex_index_t>, void*, void*&>; T = vertex_isomorphism_t; R = no_property; typename result_of(Param0, Param1, const typename detail::convert_bgl_params_to_boost_parameter >::type&)>::type = bool; typename detail::convert_bgl_params_to_boost_parameter >::type = parameter::aux::arg_list >, adj_list_vertex_property_map >, int, int&, vertex_index_t>, void*, void*&> >, parameter::aux::empty_arg_list, std::integral_constant >]’ ordering.cpp:68:18: required from here /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::Convertible::~Convertible() [with X = boost::iterators::random_access_traversal_tag; Y = boost::iterators::forward_traversal_tag]’ 37 | ~model() | ^ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:208:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 208 | BOOST_CONCEPT_USAGE(Convertible) { | ^~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::range_detail::ForwardIteratorConcept<__gnu_cxx::__normal_iterator > >]’: /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements > > >]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/range/concepts.hpp:197:13: required from ‘struct boost::range_detail::ForwardIteratorConcept<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::range_detail::ForwardIteratorConcept<__gnu_cxx::__normal_iterator > >]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied > > >::value’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied > > >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:72:8: [ skipping 9 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/isomorphism.hpp:172:21: required from ‘bool boost::detail::isomorphism_algo::test_isomorphism() [with Graph1 = boost::adjacency_list >; Graph2 = boost::adjacency_list >; IsoMapping = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&>; Invariant1 = boost::degree_vertex_invariant >, int, const int&, boost::vertex_index_t> >, boost::adjacency_list > >; Invariant2 = boost::degree_vertex_invariant >, int, const int&, boost::vertex_index_t> >, boost::adjacency_list > >; IndexMap1 = boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>; IndexMap2 = boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/isomorphism.hpp:532:33: required from ‘bool boost::isomorphism(const Graph1&, const Graph2&, IsoMapping, Invariant1, Invariant2, std::size_t, IndexMap1, IndexMap2) [with Graph1 = adjacency_list >; Graph2 = adjacency_list >; IsoMapping = iterator_property_map<__gnu_cxx::__normal_iterator >, adj_list_vertex_property_map >, int, int&, vertex_index_t>, void*, void*&>; Invariant1 = degree_vertex_invariant >, int, const int&, vertex_index_t> >, adjacency_list > >; Invariant2 = degree_vertex_invariant >, int, const int&, vertex_index_t> >, adjacency_list > >; IndexMap1 = adj_list_vertex_property_map >, int, const int&, vertex_index_t>; IndexMap2 = adj_list_vertex_property_map >, int, const int&, vertex_index_t>; std::size_t = long unsigned int]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/isomorphism.hpp:651:42: required from ‘bool boost::graph::detail::isomorphism_impl::operator()(const Graph1&, const Graph2&, const ArgPack&) const [with ArgPack = boost::parameter::aux::arg_list >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&> >, boost::parameter::aux::empty_arg_list, std::integral_constant >; Graph1 = boost::adjacency_list >; Graph2 = boost::adjacency_list >]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/isomorphism.hpp:662:5: required from ‘typename boost::result_of(Param0, Param1, const ArgPack&)>::type boost::graph::isomorphism_with_named_params(const Param0&, const Param1&, const ArgPack&) [with Param0 = boost::adjacency_list >; Param1 = boost::adjacency_list >; ArgPack = boost::parameter::aux::arg_list >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&> >, boost::parameter::aux::empty_arg_list, std::integral_constant >; typename boost::result_of(Param0, Param1, const ArgPack&)>::type = bool]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/isomorphism.hpp:666:1: required from ‘typename boost::result_of(Param0, Param1, const typename boost::detail::convert_bgl_params_to_boost_parameter >::type&)>::type boost::isomorphism(const Param0&, const Param1&, const bgl_named_params&) [with Param0 = adjacency_list >; Param1 = adjacency_list >; P = iterator_property_map<__gnu_cxx::__normal_iterator >, adj_list_vertex_property_map >, int, int&, vertex_index_t>, void*, void*&>; T = vertex_isomorphism_t; R = no_property; typename result_of(Param0, Param1, const typename detail::convert_bgl_params_to_boost_parameter >::type&)>::type = bool; typename detail::convert_bgl_params_to_boost_parameter >::type = parameter::aux::arg_list >, adj_list_vertex_property_map >, int, int&, vertex_index_t>, void*, void*&> >, parameter::aux::empty_arg_list, std::integral_constant >]’ ordering.cpp:68:18: required from here /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::range_detail::ForwardIteratorConcept::~ForwardIteratorConcept() [with Iterator = __gnu_cxx::__normal_iterator >]’ 37 | ~model() | ^ /home/omnipath/local/R/4.4-3.20/BH/include/boost/range/concepts.hpp:197:13: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 197 | BOOST_CONCEPT_USAGE(ForwardIteratorConcept) | ^~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::DefaultConstructible<__gnu_cxx::__normal_iterator > >]’: /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements > > >]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:137:5: required from ‘struct boost::DefaultConstructible<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/range/concepts.hpp:181:16: required from ‘struct boost::range_detail::ForwardIteratorConcept<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::range_detail::ForwardIteratorConcept<__gnu_cxx::__normal_iterator > >]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied > > >::value’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:45:51: [ skipping 10 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/isomorphism.hpp:172:21: required from ‘bool boost::detail::isomorphism_algo::test_isomorphism() [with Graph1 = boost::adjacency_list >; Graph2 = boost::adjacency_list >; IsoMapping = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&>; Invariant1 = boost::degree_vertex_invariant >, int, const int&, boost::vertex_index_t> >, boost::adjacency_list > >; Invariant2 = boost::degree_vertex_invariant >, int, const int&, boost::vertex_index_t> >, boost::adjacency_list > >; IndexMap1 = boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>; IndexMap2 = boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/isomorphism.hpp:532:33: required from ‘bool boost::isomorphism(const Graph1&, const Graph2&, IsoMapping, Invariant1, Invariant2, std::size_t, IndexMap1, IndexMap2) [with Graph1 = adjacency_list >; Graph2 = adjacency_list >; IsoMapping = iterator_property_map<__gnu_cxx::__normal_iterator >, adj_list_vertex_property_map >, int, int&, vertex_index_t>, void*, void*&>; Invariant1 = degree_vertex_invariant >, int, const int&, vertex_index_t> >, adjacency_list > >; Invariant2 = degree_vertex_invariant >, int, const int&, vertex_index_t> >, adjacency_list > >; IndexMap1 = adj_list_vertex_property_map >, int, const int&, vertex_index_t>; IndexMap2 = adj_list_vertex_property_map >, int, const int&, vertex_index_t>; std::size_t = long unsigned int]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/isomorphism.hpp:651:42: required from ‘bool boost::graph::detail::isomorphism_impl::operator()(const Graph1&, const Graph2&, const ArgPack&) const [with ArgPack = boost::parameter::aux::arg_list >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&> >, boost::parameter::aux::empty_arg_list, std::integral_constant >; Graph1 = boost::adjacency_list >; Graph2 = boost::adjacency_list >]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/isomorphism.hpp:662:5: required from ‘typename boost::result_of(Param0, Param1, const ArgPack&)>::type boost::graph::isomorphism_with_named_params(const Param0&, const Param1&, const ArgPack&) [with Param0 = boost::adjacency_list >; Param1 = boost::adjacency_list >; ArgPack = boost::parameter::aux::arg_list >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&> >, boost::parameter::aux::empty_arg_list, std::integral_constant >; typename boost::result_of(Param0, Param1, const ArgPack&)>::type = bool]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/isomorphism.hpp:666:1: required from ‘typename boost::result_of(Param0, Param1, const typename boost::detail::convert_bgl_params_to_boost_parameter >::type&)>::type boost::isomorphism(const Param0&, const Param1&, const bgl_named_params&) [with Param0 = adjacency_list >; Param1 = adjacency_list >; P = iterator_property_map<__gnu_cxx::__normal_iterator >, adj_list_vertex_property_map >, int, int&, vertex_index_t>, void*, void*&>; T = vertex_isomorphism_t; R = no_property; typename result_of(Param0, Param1, const typename detail::convert_bgl_params_to_boost_parameter >::type&)>::type = bool; typename detail::convert_bgl_params_to_boost_parameter >::type = parameter::aux::arg_list >, adj_list_vertex_property_map >, int, int&, vertex_index_t>, void*, void*&> >, parameter::aux::empty_arg_list, std::integral_constant >]’ ordering.cpp:68:18: required from here /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::DefaultConstructible::~DefaultConstructible() [with TT = __gnu_cxx::__normal_iterator >]’ 37 | ~model() | ^ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:137:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 137 | BOOST_CONCEPT_USAGE(DefaultConstructible) { | ^~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::range_detail::ForwardIteratorConcept<__gnu_cxx::__normal_iterator > >]’: /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements > > >]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/range/concepts.hpp:197:13: required from ‘struct boost::range_detail::ForwardIteratorConcept<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::range_detail::ForwardIteratorConcept<__gnu_cxx::__normal_iterator > >]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied > > >::value’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied > > >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:72:8: [ skipping 9 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/isomorphism.hpp:172:21: required from ‘bool boost::detail::isomorphism_algo::test_isomorphism() [with Graph1 = boost::adjacency_list >; Graph2 = boost::adjacency_list >; IsoMapping = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&>; Invariant1 = boost::degree_vertex_invariant >, int, const int&, boost::vertex_index_t> >, boost::adjacency_list > >; Invariant2 = boost::degree_vertex_invariant >, int, const int&, boost::vertex_index_t> >, boost::adjacency_list > >; IndexMap1 = boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>; IndexMap2 = boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/isomorphism.hpp:532:33: required from ‘bool boost::isomorphism(const Graph1&, const Graph2&, IsoMapping, Invariant1, Invariant2, std::size_t, IndexMap1, IndexMap2) [with Graph1 = adjacency_list >; Graph2 = adjacency_list >; IsoMapping = iterator_property_map<__gnu_cxx::__normal_iterator >, adj_list_vertex_property_map >, int, int&, vertex_index_t>, void*, void*&>; Invariant1 = degree_vertex_invariant >, int, const int&, vertex_index_t> >, adjacency_list > >; Invariant2 = degree_vertex_invariant >, int, const int&, vertex_index_t> >, adjacency_list > >; IndexMap1 = adj_list_vertex_property_map >, int, const int&, vertex_index_t>; IndexMap2 = adj_list_vertex_property_map >, int, const int&, vertex_index_t>; std::size_t = long unsigned int]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/isomorphism.hpp:651:42: required from ‘bool boost::graph::detail::isomorphism_impl::operator()(const Graph1&, const Graph2&, const ArgPack&) const [with ArgPack = boost::parameter::aux::arg_list >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&> >, boost::parameter::aux::empty_arg_list, std::integral_constant >; Graph1 = boost::adjacency_list >; Graph2 = boost::adjacency_list >]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/isomorphism.hpp:662:5: required from ‘typename boost::result_of(Param0, Param1, const ArgPack&)>::type boost::graph::isomorphism_with_named_params(const Param0&, const Param1&, const ArgPack&) [with Param0 = boost::adjacency_list >; Param1 = boost::adjacency_list >; ArgPack = boost::parameter::aux::arg_list >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&> >, boost::parameter::aux::empty_arg_list, std::integral_constant >; typename boost::result_of(Param0, Param1, const ArgPack&)>::type = bool]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/isomorphism.hpp:666:1: required from ‘typename boost::result_of(Param0, Param1, const typename boost::detail::convert_bgl_params_to_boost_parameter >::type&)>::type boost::isomorphism(const Param0&, const Param1&, const bgl_named_params&) [with Param0 = adjacency_list >; Param1 = adjacency_list >; P = iterator_property_map<__gnu_cxx::__normal_iterator >, adj_list_vertex_property_map >, int, int&, vertex_index_t>, void*, void*&>; T = vertex_isomorphism_t; R = no_property; typename result_of(Param0, Param1, const typename detail::convert_bgl_params_to_boost_parameter >::type&)>::type = bool; typename detail::convert_bgl_params_to_boost_parameter >::type = parameter::aux::arg_list >, adj_list_vertex_property_map >, int, int&, vertex_index_t>, void*, void*&> >, parameter::aux::empty_arg_list, std::integral_constant >]’ ordering.cpp:68:18: required from here /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::range_detail::ForwardIteratorConcept::~ForwardIteratorConcept() [with Iterator = __gnu_cxx::__normal_iterator >]’ 37 | ~model() | ^ /home/omnipath/local/R/4.4-3.20/BH/include/boost/range/concepts.hpp:197:13: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 197 | BOOST_CONCEPT_USAGE(ForwardIteratorConcept) | ^~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::Convertible]’: /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements >]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:208:5: required from ‘struct boost::Convertible’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::Convertible]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied >::value’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:72:8: [ skipping 13 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/isomorphism.hpp:172:21: required from ‘bool boost::detail::isomorphism_algo::test_isomorphism() [with Graph1 = boost::adjacency_list >; Graph2 = boost::adjacency_list >; IsoMapping = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&>; Invariant1 = boost::degree_vertex_invariant >, int, const int&, boost::vertex_index_t> >, boost::adjacency_list > >; Invariant2 = boost::degree_vertex_invariant >, int, const int&, boost::vertex_index_t> >, boost::adjacency_list > >; IndexMap1 = boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>; IndexMap2 = boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/isomorphism.hpp:532:33: required from ‘bool boost::isomorphism(const Graph1&, const Graph2&, IsoMapping, Invariant1, Invariant2, std::size_t, IndexMap1, IndexMap2) [with Graph1 = adjacency_list >; Graph2 = adjacency_list >; IsoMapping = iterator_property_map<__gnu_cxx::__normal_iterator >, adj_list_vertex_property_map >, int, int&, vertex_index_t>, void*, void*&>; Invariant1 = degree_vertex_invariant >, int, const int&, vertex_index_t> >, adjacency_list > >; Invariant2 = degree_vertex_invariant >, int, const int&, vertex_index_t> >, adjacency_list > >; IndexMap1 = adj_list_vertex_property_map >, int, const int&, vertex_index_t>; IndexMap2 = adj_list_vertex_property_map >, int, const int&, vertex_index_t>; std::size_t = long unsigned int]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/isomorphism.hpp:651:42: required from ‘bool boost::graph::detail::isomorphism_impl::operator()(const Graph1&, const Graph2&, const ArgPack&) const [with ArgPack = boost::parameter::aux::arg_list >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&> >, boost::parameter::aux::empty_arg_list, std::integral_constant >; Graph1 = boost::adjacency_list >; Graph2 = boost::adjacency_list >]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/isomorphism.hpp:662:5: required from ‘typename boost::result_of(Param0, Param1, const ArgPack&)>::type boost::graph::isomorphism_with_named_params(const Param0&, const Param1&, const ArgPack&) [with Param0 = boost::adjacency_list >; Param1 = boost::adjacency_list >; ArgPack = boost::parameter::aux::arg_list >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&> >, boost::parameter::aux::empty_arg_list, std::integral_constant >; typename boost::result_of(Param0, Param1, const ArgPack&)>::type = bool]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/isomorphism.hpp:666:1: required from ‘typename boost::result_of(Param0, Param1, const typename boost::detail::convert_bgl_params_to_boost_parameter >::type&)>::type boost::isomorphism(const Param0&, const Param1&, const bgl_named_params&) [with Param0 = adjacency_list >; Param1 = adjacency_list >; P = iterator_property_map<__gnu_cxx::__normal_iterator >, adj_list_vertex_property_map >, int, int&, vertex_index_t>, void*, void*&>; T = vertex_isomorphism_t; R = no_property; typename result_of(Param0, Param1, const typename detail::convert_bgl_params_to_boost_parameter >::type&)>::type = bool; typename detail::convert_bgl_params_to_boost_parameter >::type = parameter::aux::arg_list >, adj_list_vertex_property_map >, int, int&, vertex_index_t>, void*, void*&> >, parameter::aux::empty_arg_list, std::integral_constant >]’ ordering.cpp:68:18: required from here /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::Convertible::~Convertible() [with X = boost::iterators::random_access_traversal_tag; Y = boost::iterators::bidirectional_traversal_tag]’ 37 | ~model() | ^ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:208:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 208 | BOOST_CONCEPT_USAGE(Convertible) { | ^~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::range_detail::BidirectionalIteratorConcept<__gnu_cxx::__normal_iterator > >]’: /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements > > >]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/range/concepts.hpp:224:14: required from ‘struct boost::range_detail::BidirectionalIteratorConcept<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::range_detail::BidirectionalIteratorConcept<__gnu_cxx::__normal_iterator > >]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied > > >::value’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied > > >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:72:8: [ skipping 8 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/isomorphism.hpp:172:21: required from ‘bool boost::detail::isomorphism_algo::test_isomorphism() [with Graph1 = boost::adjacency_list >; Graph2 = boost::adjacency_list >; IsoMapping = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&>; Invariant1 = boost::degree_vertex_invariant >, int, const int&, boost::vertex_index_t> >, boost::adjacency_list > >; Invariant2 = boost::degree_vertex_invariant >, int, const int&, boost::vertex_index_t> >, boost::adjacency_list > >; IndexMap1 = boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>; IndexMap2 = boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/isomorphism.hpp:532:33: required from ‘bool boost::isomorphism(const Graph1&, const Graph2&, IsoMapping, Invariant1, Invariant2, std::size_t, IndexMap1, IndexMap2) [with Graph1 = adjacency_list >; Graph2 = adjacency_list >; IsoMapping = iterator_property_map<__gnu_cxx::__normal_iterator >, adj_list_vertex_property_map >, int, int&, vertex_index_t>, void*, void*&>; Invariant1 = degree_vertex_invariant >, int, const int&, vertex_index_t> >, adjacency_list > >; Invariant2 = degree_vertex_invariant >, int, const int&, vertex_index_t> >, adjacency_list > >; IndexMap1 = adj_list_vertex_property_map >, int, const int&, vertex_index_t>; IndexMap2 = adj_list_vertex_property_map >, int, const int&, vertex_index_t>; std::size_t = long unsigned int]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/isomorphism.hpp:651:42: required from ‘bool boost::graph::detail::isomorphism_impl::operator()(const Graph1&, const Graph2&, const ArgPack&) const [with ArgPack = boost::parameter::aux::arg_list >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&> >, boost::parameter::aux::empty_arg_list, std::integral_constant >; Graph1 = boost::adjacency_list >; Graph2 = boost::adjacency_list >]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/isomorphism.hpp:662:5: required from ‘typename boost::result_of(Param0, Param1, const ArgPack&)>::type boost::graph::isomorphism_with_named_params(const Param0&, const Param1&, const ArgPack&) [with Param0 = boost::adjacency_list >; Param1 = boost::adjacency_list >; ArgPack = boost::parameter::aux::arg_list >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&> >, boost::parameter::aux::empty_arg_list, std::integral_constant >; typename boost::result_of(Param0, Param1, const ArgPack&)>::type = bool]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/isomorphism.hpp:666:1: required from ‘typename boost::result_of(Param0, Param1, const typename boost::detail::convert_bgl_params_to_boost_parameter >::type&)>::type boost::isomorphism(const Param0&, const Param1&, const bgl_named_params&) [with Param0 = adjacency_list >; Param1 = adjacency_list >; P = iterator_property_map<__gnu_cxx::__normal_iterator >, adj_list_vertex_property_map >, int, int&, vertex_index_t>, void*, void*&>; T = vertex_isomorphism_t; R = no_property; typename result_of(Param0, Param1, const typename detail::convert_bgl_params_to_boost_parameter >::type&)>::type = bool; typename detail::convert_bgl_params_to_boost_parameter >::type = parameter::aux::arg_list >, adj_list_vertex_property_map >, int, int&, vertex_index_t>, void*, void*&> >, parameter::aux::empty_arg_list, std::integral_constant >]’ ordering.cpp:68:18: required from here /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::range_detail::BidirectionalIteratorConcept::~BidirectionalIteratorConcept() [with Iterator = __gnu_cxx::__normal_iterator >]’ 37 | ~model() | ^ /home/omnipath/local/R/4.4-3.20/BH/include/boost/range/concepts.hpp:224:14: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 224 | BOOST_CONCEPT_USAGE(BidirectionalIteratorConcept) | ^~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::range_detail::BidirectionalIteratorConcept<__gnu_cxx::__normal_iterator > >]’: /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements > > >]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/range/concepts.hpp:224:14: required from ‘struct boost::range_detail::BidirectionalIteratorConcept<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::range_detail::BidirectionalIteratorConcept<__gnu_cxx::__normal_iterator > >]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied > > >::value’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied > > >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:72:8: [ skipping 8 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/isomorphism.hpp:172:21: required from ‘bool boost::detail::isomorphism_algo::test_isomorphism() [with Graph1 = boost::adjacency_list >; Graph2 = boost::adjacency_list >; IsoMapping = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&>; Invariant1 = boost::degree_vertex_invariant >, int, const int&, boost::vertex_index_t> >, boost::adjacency_list > >; Invariant2 = boost::degree_vertex_invariant >, int, const int&, boost::vertex_index_t> >, boost::adjacency_list > >; IndexMap1 = boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>; IndexMap2 = boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/isomorphism.hpp:532:33: required from ‘bool boost::isomorphism(const Graph1&, const Graph2&, IsoMapping, Invariant1, Invariant2, std::size_t, IndexMap1, IndexMap2) [with Graph1 = adjacency_list >; Graph2 = adjacency_list >; IsoMapping = iterator_property_map<__gnu_cxx::__normal_iterator >, adj_list_vertex_property_map >, int, int&, vertex_index_t>, void*, void*&>; Invariant1 = degree_vertex_invariant >, int, const int&, vertex_index_t> >, adjacency_list > >; Invariant2 = degree_vertex_invariant >, int, const int&, vertex_index_t> >, adjacency_list > >; IndexMap1 = adj_list_vertex_property_map >, int, const int&, vertex_index_t>; IndexMap2 = adj_list_vertex_property_map >, int, const int&, vertex_index_t>; std::size_t = long unsigned int]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/isomorphism.hpp:651:42: required from ‘bool boost::graph::detail::isomorphism_impl::operator()(const Graph1&, const Graph2&, const ArgPack&) const [with ArgPack = boost::parameter::aux::arg_list >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&> >, boost::parameter::aux::empty_arg_list, std::integral_constant >; Graph1 = boost::adjacency_list >; Graph2 = boost::adjacency_list >]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/isomorphism.hpp:662:5: required from ‘typename boost::result_of(Param0, Param1, const ArgPack&)>::type boost::graph::isomorphism_with_named_params(const Param0&, const Param1&, const ArgPack&) [with Param0 = boost::adjacency_list >; Param1 = boost::adjacency_list >; ArgPack = boost::parameter::aux::arg_list >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&> >, boost::parameter::aux::empty_arg_list, std::integral_constant >; typename boost::result_of(Param0, Param1, const ArgPack&)>::type = bool]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/isomorphism.hpp:666:1: required from ‘typename boost::result_of(Param0, Param1, const typename boost::detail::convert_bgl_params_to_boost_parameter >::type&)>::type boost::isomorphism(const Param0&, const Param1&, const bgl_named_params&) [with Param0 = adjacency_list >; Param1 = adjacency_list >; P = iterator_property_map<__gnu_cxx::__normal_iterator >, adj_list_vertex_property_map >, int, int&, vertex_index_t>, void*, void*&>; T = vertex_isomorphism_t; R = no_property; typename result_of(Param0, Param1, const typename detail::convert_bgl_params_to_boost_parameter >::type&)>::type = bool; typename detail::convert_bgl_params_to_boost_parameter >::type = parameter::aux::arg_list >, adj_list_vertex_property_map >, int, int&, vertex_index_t>, void*, void*&> >, parameter::aux::empty_arg_list, std::integral_constant >]’ ordering.cpp:68:18: required from here /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::range_detail::BidirectionalIteratorConcept::~BidirectionalIteratorConcept() [with Iterator = __gnu_cxx::__normal_iterator >]’ 37 | ~model() | ^ /home/omnipath/local/R/4.4-3.20/BH/include/boost/range/concepts.hpp:224:14: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 224 | BOOST_CONCEPT_USAGE(BidirectionalIteratorConcept) | ^~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::Convertible]’: /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements >]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:208:5: required from ‘struct boost::Convertible’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::Convertible]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied >::value’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:72:8: [ skipping 12 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/isomorphism.hpp:172:21: required from ‘bool boost::detail::isomorphism_algo::test_isomorphism() [with Graph1 = boost::adjacency_list >; Graph2 = boost::adjacency_list >; IsoMapping = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&>; Invariant1 = boost::degree_vertex_invariant >, int, const int&, boost::vertex_index_t> >, boost::adjacency_list > >; Invariant2 = boost::degree_vertex_invariant >, int, const int&, boost::vertex_index_t> >, boost::adjacency_list > >; IndexMap1 = boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>; IndexMap2 = boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/isomorphism.hpp:532:33: required from ‘bool boost::isomorphism(const Graph1&, const Graph2&, IsoMapping, Invariant1, Invariant2, std::size_t, IndexMap1, IndexMap2) [with Graph1 = adjacency_list >; Graph2 = adjacency_list >; IsoMapping = iterator_property_map<__gnu_cxx::__normal_iterator >, adj_list_vertex_property_map >, int, int&, vertex_index_t>, void*, void*&>; Invariant1 = degree_vertex_invariant >, int, const int&, vertex_index_t> >, adjacency_list > >; Invariant2 = degree_vertex_invariant >, int, const int&, vertex_index_t> >, adjacency_list > >; IndexMap1 = adj_list_vertex_property_map >, int, const int&, vertex_index_t>; IndexMap2 = adj_list_vertex_property_map >, int, const int&, vertex_index_t>; std::size_t = long unsigned int]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/isomorphism.hpp:651:42: required from ‘bool boost::graph::detail::isomorphism_impl::operator()(const Graph1&, const Graph2&, const ArgPack&) const [with ArgPack = boost::parameter::aux::arg_list >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&> >, boost::parameter::aux::empty_arg_list, std::integral_constant >; Graph1 = boost::adjacency_list >; Graph2 = boost::adjacency_list >]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/isomorphism.hpp:662:5: required from ‘typename boost::result_of(Param0, Param1, const ArgPack&)>::type boost::graph::isomorphism_with_named_params(const Param0&, const Param1&, const ArgPack&) [with Param0 = boost::adjacency_list >; Param1 = boost::adjacency_list >; ArgPack = boost::parameter::aux::arg_list >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&> >, boost::parameter::aux::empty_arg_list, std::integral_constant >; typename boost::result_of(Param0, Param1, const ArgPack&)>::type = bool]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/isomorphism.hpp:666:1: required from ‘typename boost::result_of(Param0, Param1, const typename boost::detail::convert_bgl_params_to_boost_parameter >::type&)>::type boost::isomorphism(const Param0&, const Param1&, const bgl_named_params&) [with Param0 = adjacency_list >; Param1 = adjacency_list >; P = iterator_property_map<__gnu_cxx::__normal_iterator >, adj_list_vertex_property_map >, int, int&, vertex_index_t>, void*, void*&>; T = vertex_isomorphism_t; R = no_property; typename result_of(Param0, Param1, const typename detail::convert_bgl_params_to_boost_parameter >::type&)>::type = bool; typename detail::convert_bgl_params_to_boost_parameter >::type = parameter::aux::arg_list >, adj_list_vertex_property_map >, int, int&, vertex_index_t>, void*, void*&> >, parameter::aux::empty_arg_list, std::integral_constant >]’ ordering.cpp:68:18: required from here /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::Convertible::~Convertible() [with X = boost::iterators::random_access_traversal_tag; Y = boost::iterators::random_access_traversal_tag]’ 37 | ~model() | ^ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:208:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 208 | BOOST_CONCEPT_USAGE(Convertible) { | ^~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::range_detail::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator > >]’: /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements > > >]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/range/concepts.hpp:245:14: required from ‘struct boost::range_detail::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::range_detail::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator > >]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied > > >::value’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied > > >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:72:8: [ skipping 7 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/isomorphism.hpp:172:21: required from ‘bool boost::detail::isomorphism_algo::test_isomorphism() [with Graph1 = boost::adjacency_list >; Graph2 = boost::adjacency_list >; IsoMapping = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&>; Invariant1 = boost::degree_vertex_invariant >, int, const int&, boost::vertex_index_t> >, boost::adjacency_list > >; Invariant2 = boost::degree_vertex_invariant >, int, const int&, boost::vertex_index_t> >, boost::adjacency_list > >; IndexMap1 = boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>; IndexMap2 = boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/isomorphism.hpp:532:33: required from ‘bool boost::isomorphism(const Graph1&, const Graph2&, IsoMapping, Invariant1, Invariant2, std::size_t, IndexMap1, IndexMap2) [with Graph1 = adjacency_list >; Graph2 = adjacency_list >; IsoMapping = iterator_property_map<__gnu_cxx::__normal_iterator >, adj_list_vertex_property_map >, int, int&, vertex_index_t>, void*, void*&>; Invariant1 = degree_vertex_invariant >, int, const int&, vertex_index_t> >, adjacency_list > >; Invariant2 = degree_vertex_invariant >, int, const int&, vertex_index_t> >, adjacency_list > >; IndexMap1 = adj_list_vertex_property_map >, int, const int&, vertex_index_t>; IndexMap2 = adj_list_vertex_property_map >, int, const int&, vertex_index_t>; std::size_t = long unsigned int]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/isomorphism.hpp:651:42: required from ‘bool boost::graph::detail::isomorphism_impl::operator()(const Graph1&, const Graph2&, const ArgPack&) const [with ArgPack = boost::parameter::aux::arg_list >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&> >, boost::parameter::aux::empty_arg_list, std::integral_constant >; Graph1 = boost::adjacency_list >; Graph2 = boost::adjacency_list >]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/isomorphism.hpp:662:5: required from ‘typename boost::result_of(Param0, Param1, const ArgPack&)>::type boost::graph::isomorphism_with_named_params(const Param0&, const Param1&, const ArgPack&) [with Param0 = boost::adjacency_list >; Param1 = boost::adjacency_list >; ArgPack = boost::parameter::aux::arg_list >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&> >, boost::parameter::aux::empty_arg_list, std::integral_constant >; typename boost::result_of(Param0, Param1, const ArgPack&)>::type = bool]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/isomorphism.hpp:666:1: required from ‘typename boost::result_of(Param0, Param1, const typename boost::detail::convert_bgl_params_to_boost_parameter >::type&)>::type boost::isomorphism(const Param0&, const Param1&, const bgl_named_params&) [with Param0 = adjacency_list >; Param1 = adjacency_list >; P = iterator_property_map<__gnu_cxx::__normal_iterator >, adj_list_vertex_property_map >, int, int&, vertex_index_t>, void*, void*&>; T = vertex_isomorphism_t; R = no_property; typename result_of(Param0, Param1, const typename detail::convert_bgl_params_to_boost_parameter >::type&)>::type = bool; typename detail::convert_bgl_params_to_boost_parameter >::type = parameter::aux::arg_list >, adj_list_vertex_property_map >, int, int&, vertex_index_t>, void*, void*&> >, parameter::aux::empty_arg_list, std::integral_constant >]’ ordering.cpp:68:18: required from here /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::range_detail::RandomAccessIteratorConcept::~RandomAccessIteratorConcept() [with Iterator = __gnu_cxx::__normal_iterator >]’ 37 | ~model() | ^ /home/omnipath/local/R/4.4-3.20/BH/include/boost/range/concepts.hpp:245:14: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 245 | BOOST_CONCEPT_USAGE(RandomAccessIteratorConcept) | ^~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::range_detail::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator > >]’: /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements > > >]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/range/concepts.hpp:245:14: required from ‘struct boost::range_detail::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::range_detail::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator > >]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied > > >::value’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied > > >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:72:8: [ skipping 7 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/isomorphism.hpp:172:21: required from ‘bool boost::detail::isomorphism_algo::test_isomorphism() [with Graph1 = boost::adjacency_list >; Graph2 = boost::adjacency_list >; IsoMapping = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&>; Invariant1 = boost::degree_vertex_invariant >, int, const int&, boost::vertex_index_t> >, boost::adjacency_list > >; Invariant2 = boost::degree_vertex_invariant >, int, const int&, boost::vertex_index_t> >, boost::adjacency_list > >; IndexMap1 = boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>; IndexMap2 = boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/isomorphism.hpp:532:33: required from ‘bool boost::isomorphism(const Graph1&, const Graph2&, IsoMapping, Invariant1, Invariant2, std::size_t, IndexMap1, IndexMap2) [with Graph1 = adjacency_list >; Graph2 = adjacency_list >; IsoMapping = iterator_property_map<__gnu_cxx::__normal_iterator >, adj_list_vertex_property_map >, int, int&, vertex_index_t>, void*, void*&>; Invariant1 = degree_vertex_invariant >, int, const int&, vertex_index_t> >, adjacency_list > >; Invariant2 = degree_vertex_invariant >, int, const int&, vertex_index_t> >, adjacency_list > >; IndexMap1 = adj_list_vertex_property_map >, int, const int&, vertex_index_t>; IndexMap2 = adj_list_vertex_property_map >, int, const int&, vertex_index_t>; std::size_t = long unsigned int]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/isomorphism.hpp:651:42: required from ‘bool boost::graph::detail::isomorphism_impl::operator()(const Graph1&, const Graph2&, const ArgPack&) const [with ArgPack = boost::parameter::aux::arg_list >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&> >, boost::parameter::aux::empty_arg_list, std::integral_constant >; Graph1 = boost::adjacency_list >; Graph2 = boost::adjacency_list >]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/isomorphism.hpp:662:5: required from ‘typename boost::result_of(Param0, Param1, const ArgPack&)>::type boost::graph::isomorphism_with_named_params(const Param0&, const Param1&, const ArgPack&) [with Param0 = boost::adjacency_list >; Param1 = boost::adjacency_list >; ArgPack = boost::parameter::aux::arg_list >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&> >, boost::parameter::aux::empty_arg_list, std::integral_constant >; typename boost::result_of(Param0, Param1, const ArgPack&)>::type = bool]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/isomorphism.hpp:666:1: required from ‘typename boost::result_of(Param0, Param1, const typename boost::detail::convert_bgl_params_to_boost_parameter >::type&)>::type boost::isomorphism(const Param0&, const Param1&, const bgl_named_params&) [with Param0 = adjacency_list >; Param1 = adjacency_list >; P = iterator_property_map<__gnu_cxx::__normal_iterator >, adj_list_vertex_property_map >, int, int&, vertex_index_t>, void*, void*&>; T = vertex_isomorphism_t; R = no_property; typename result_of(Param0, Param1, const typename detail::convert_bgl_params_to_boost_parameter >::type&)>::type = bool; typename detail::convert_bgl_params_to_boost_parameter >::type = parameter::aux::arg_list >, adj_list_vertex_property_map >, int, int&, vertex_index_t>, void*, void*&> >, parameter::aux::empty_arg_list, std::integral_constant >]’ ordering.cpp:68:18: required from here /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::range_detail::RandomAccessIteratorConcept::~RandomAccessIteratorConcept() [with Iterator = __gnu_cxx::__normal_iterator >]’ 37 | ~model() | ^ /home/omnipath/local/R/4.4-3.20/BH/include/boost/range/concepts.hpp:245:14: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 245 | BOOST_CONCEPT_USAGE(RandomAccessIteratorConcept) | ^~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::SinglePassRangeConcept >]’: /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements > >]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/range/concepts.hpp:284:9: required from ‘struct boost::SinglePassRangeConcept >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::SinglePassRangeConcept >]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied > >::value’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied > >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:72:8: [ skipping 2 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/isomorphism.hpp:178:27: required from ‘bool boost::detail::isomorphism_algo::test_isomorphism() [with Graph1 = boost::adjacency_list >; Graph2 = boost::adjacency_list >; IsoMapping = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&>; Invariant1 = boost::degree_vertex_invariant >, int, const int&, boost::vertex_index_t> >, boost::adjacency_list > >; Invariant2 = boost::degree_vertex_invariant >, int, const int&, boost::vertex_index_t> >, boost::adjacency_list > >; IndexMap1 = boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>; IndexMap2 = boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/isomorphism.hpp:532:33: required from ‘bool boost::isomorphism(const Graph1&, const Graph2&, IsoMapping, Invariant1, Invariant2, std::size_t, IndexMap1, IndexMap2) [with Graph1 = adjacency_list >; Graph2 = adjacency_list >; IsoMapping = iterator_property_map<__gnu_cxx::__normal_iterator >, adj_list_vertex_property_map >, int, int&, vertex_index_t>, void*, void*&>; Invariant1 = degree_vertex_invariant >, int, const int&, vertex_index_t> >, adjacency_list > >; Invariant2 = degree_vertex_invariant >, int, const int&, vertex_index_t> >, adjacency_list > >; IndexMap1 = adj_list_vertex_property_map >, int, const int&, vertex_index_t>; IndexMap2 = adj_list_vertex_property_map >, int, const int&, vertex_index_t>; std::size_t = long unsigned int]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/isomorphism.hpp:651:42: required from ‘bool boost::graph::detail::isomorphism_impl::operator()(const Graph1&, const Graph2&, const ArgPack&) const [with ArgPack = boost::parameter::aux::arg_list >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&> >, boost::parameter::aux::empty_arg_list, std::integral_constant >; Graph1 = boost::adjacency_list >; Graph2 = boost::adjacency_list >]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/isomorphism.hpp:662:5: required from ‘typename boost::result_of(Param0, Param1, const ArgPack&)>::type boost::graph::isomorphism_with_named_params(const Param0&, const Param1&, const ArgPack&) [with Param0 = boost::adjacency_list >; Param1 = boost::adjacency_list >; ArgPack = boost::parameter::aux::arg_list >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&> >, boost::parameter::aux::empty_arg_list, std::integral_constant >; typename boost::result_of(Param0, Param1, const ArgPack&)>::type = bool]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/isomorphism.hpp:666:1: required from ‘typename boost::result_of(Param0, Param1, const typename boost::detail::convert_bgl_params_to_boost_parameter >::type&)>::type boost::isomorphism(const Param0&, const Param1&, const bgl_named_params&) [with Param0 = adjacency_list >; Param1 = adjacency_list >; P = iterator_property_map<__gnu_cxx::__normal_iterator >, adj_list_vertex_property_map >, int, int&, vertex_index_t>, void*, void*&>; T = vertex_isomorphism_t; R = no_property; typename result_of(Param0, Param1, const typename detail::convert_bgl_params_to_boost_parameter >::type&)>::type = bool; typename detail::convert_bgl_params_to_boost_parameter >::type = parameter::aux::arg_list >, adj_list_vertex_property_map >, int, int&, vertex_index_t>, void*, void*&> >, parameter::aux::empty_arg_list, std::integral_constant >]’ ordering.cpp:68:18: required from here /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::SinglePassRangeConcept::~SinglePassRangeConcept() [with T = const std::vector]’ 37 | ~model() | ^ /home/omnipath/local/R/4.4-3.20/BH/include/boost/range/concepts.hpp:284:9: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 284 | BOOST_CONCEPT_USAGE(SinglePassRangeConcept) | ^~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::CopyConstructible<__gnu_cxx::__normal_iterator > >]’: /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements > > >]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:167:5: required from ‘struct boost::CopyConstructible<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/range/concepts.hpp:125:16: required from ‘struct boost::range_detail::IncrementableIteratorConcept<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/range/concepts.hpp:147:16: required from ‘struct boost::range_detail::SinglePassIteratorConcept<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::range_detail::SinglePassIteratorConcept<__gnu_cxx::__normal_iterator > >]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:42:5: [ skipping 12 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/isomorphism.hpp:189:21: required from ‘bool boost::detail::isomorphism_algo::test_isomorphism() [with Graph1 = boost::adjacency_list >; Graph2 = boost::adjacency_list >; IsoMapping = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&>; Invariant1 = boost::degree_vertex_invariant >, int, const int&, boost::vertex_index_t> >, boost::adjacency_list > >; Invariant2 = boost::degree_vertex_invariant >, int, const int&, boost::vertex_index_t> >, boost::adjacency_list > >; IndexMap1 = boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>; IndexMap2 = boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/isomorphism.hpp:532:33: required from ‘bool boost::isomorphism(const Graph1&, const Graph2&, IsoMapping, Invariant1, Invariant2, std::size_t, IndexMap1, IndexMap2) [with Graph1 = adjacency_list >; Graph2 = adjacency_list >; IsoMapping = iterator_property_map<__gnu_cxx::__normal_iterator >, adj_list_vertex_property_map >, int, int&, vertex_index_t>, void*, void*&>; Invariant1 = degree_vertex_invariant >, int, const int&, vertex_index_t> >, adjacency_list > >; Invariant2 = degree_vertex_invariant >, int, const int&, vertex_index_t> >, adjacency_list > >; IndexMap1 = adj_list_vertex_property_map >, int, const int&, vertex_index_t>; IndexMap2 = adj_list_vertex_property_map >, int, const int&, vertex_index_t>; std::size_t = long unsigned int]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/isomorphism.hpp:651:42: required from ‘bool boost::graph::detail::isomorphism_impl::operator()(const Graph1&, const Graph2&, const ArgPack&) const [with ArgPack = boost::parameter::aux::arg_list >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&> >, boost::parameter::aux::empty_arg_list, std::integral_constant >; Graph1 = boost::adjacency_list >; Graph2 = boost::adjacency_list >]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/isomorphism.hpp:662:5: required from ‘typename boost::result_of(Param0, Param1, const ArgPack&)>::type boost::graph::isomorphism_with_named_params(const Param0&, const Param1&, const ArgPack&) [with Param0 = boost::adjacency_list >; Param1 = boost::adjacency_list >; ArgPack = boost::parameter::aux::arg_list >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&> >, boost::parameter::aux::empty_arg_list, std::integral_constant >; typename boost::result_of(Param0, Param1, const ArgPack&)>::type = bool]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/isomorphism.hpp:666:1: required from ‘typename boost::result_of(Param0, Param1, const typename boost::detail::convert_bgl_params_to_boost_parameter >::type&)>::type boost::isomorphism(const Param0&, const Param1&, const bgl_named_params&) [with Param0 = adjacency_list >; Param1 = adjacency_list >; P = iterator_property_map<__gnu_cxx::__normal_iterator >, adj_list_vertex_property_map >, int, int&, vertex_index_t>, void*, void*&>; T = vertex_isomorphism_t; R = no_property; typename result_of(Param0, Param1, const typename detail::convert_bgl_params_to_boost_parameter >::type&)>::type = bool; typename detail::convert_bgl_params_to_boost_parameter >::type = parameter::aux::arg_list >, adj_list_vertex_property_map >, int, int&, vertex_index_t>, void*, void*&> >, parameter::aux::empty_arg_list, std::integral_constant >]’ ordering.cpp:68:18: required from here /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::CopyConstructible::~CopyConstructible() [with TT = __gnu_cxx::__normal_iterator >]’ 37 | ~model() | ^ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:167:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 167 | BOOST_CONCEPT_USAGE(CopyConstructible) { | ^~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::range_detail::IncrementableIteratorConcept<__gnu_cxx::__normal_iterator > >]’: /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements > > >]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/range/concepts.hpp:136:13: required from ‘struct boost::range_detail::IncrementableIteratorConcept<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/range/concepts.hpp:147:16: required from ‘struct boost::range_detail::SinglePassIteratorConcept<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::range_detail::SinglePassIteratorConcept<__gnu_cxx::__normal_iterator > >]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied > > >::value’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:45:51: [ skipping 11 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/isomorphism.hpp:189:21: required from ‘bool boost::detail::isomorphism_algo::test_isomorphism() [with Graph1 = boost::adjacency_list >; Graph2 = boost::adjacency_list >; IsoMapping = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&>; Invariant1 = boost::degree_vertex_invariant >, int, const int&, boost::vertex_index_t> >, boost::adjacency_list > >; Invariant2 = boost::degree_vertex_invariant >, int, const int&, boost::vertex_index_t> >, boost::adjacency_list > >; IndexMap1 = boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>; IndexMap2 = boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/isomorphism.hpp:532:33: required from ‘bool boost::isomorphism(const Graph1&, const Graph2&, IsoMapping, Invariant1, Invariant2, std::size_t, IndexMap1, IndexMap2) [with Graph1 = adjacency_list >; Graph2 = adjacency_list >; IsoMapping = iterator_property_map<__gnu_cxx::__normal_iterator >, adj_list_vertex_property_map >, int, int&, vertex_index_t>, void*, void*&>; Invariant1 = degree_vertex_invariant >, int, const int&, vertex_index_t> >, adjacency_list > >; Invariant2 = degree_vertex_invariant >, int, const int&, vertex_index_t> >, adjacency_list > >; IndexMap1 = adj_list_vertex_property_map >, int, const int&, vertex_index_t>; IndexMap2 = adj_list_vertex_property_map >, int, const int&, vertex_index_t>; std::size_t = long unsigned int]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/isomorphism.hpp:651:42: required from ‘bool boost::graph::detail::isomorphism_impl::operator()(const Graph1&, const Graph2&, const ArgPack&) const [with ArgPack = boost::parameter::aux::arg_list >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&> >, boost::parameter::aux::empty_arg_list, std::integral_constant >; Graph1 = boost::adjacency_list >; Graph2 = boost::adjacency_list >]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/isomorphism.hpp:662:5: required from ‘typename boost::result_of(Param0, Param1, const ArgPack&)>::type boost::graph::isomorphism_with_named_params(const Param0&, const Param1&, const ArgPack&) [with Param0 = boost::adjacency_list >; Param1 = boost::adjacency_list >; ArgPack = boost::parameter::aux::arg_list >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&> >, boost::parameter::aux::empty_arg_list, std::integral_constant >; typename boost::result_of(Param0, Param1, const ArgPack&)>::type = bool]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/isomorphism.hpp:666:1: required from ‘typename boost::result_of(Param0, Param1, const typename boost::detail::convert_bgl_params_to_boost_parameter >::type&)>::type boost::isomorphism(const Param0&, const Param1&, const bgl_named_params&) [with Param0 = adjacency_list >; Param1 = adjacency_list >; P = iterator_property_map<__gnu_cxx::__normal_iterator >, adj_list_vertex_property_map >, int, int&, vertex_index_t>, void*, void*&>; T = vertex_isomorphism_t; R = no_property; typename result_of(Param0, Param1, const typename detail::convert_bgl_params_to_boost_parameter >::type&)>::type = bool; typename detail::convert_bgl_params_to_boost_parameter >::type = parameter::aux::arg_list >, adj_list_vertex_property_map >, int, int&, vertex_index_t>, void*, void*&> >, parameter::aux::empty_arg_list, std::integral_constant >]’ ordering.cpp:68:18: required from here /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::range_detail::IncrementableIteratorConcept::~IncrementableIteratorConcept() [with Iterator = __gnu_cxx::__normal_iterator >]’ 37 | ~model() | ^ /home/omnipath/local/R/4.4-3.20/BH/include/boost/range/concepts.hpp:136:13: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 136 | BOOST_CONCEPT_USAGE(IncrementableIteratorConcept) | ^~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::range_detail::SinglePassIteratorConcept<__gnu_cxx::__normal_iterator > >]’: /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements > > >]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/range/concepts.hpp:158:13: required from ‘struct boost::range_detail::SinglePassIteratorConcept<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::range_detail::SinglePassIteratorConcept<__gnu_cxx::__normal_iterator > >]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied > > >::value’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied > > >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:72:8: [ skipping 10 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/isomorphism.hpp:189:21: required from ‘bool boost::detail::isomorphism_algo::test_isomorphism() [with Graph1 = boost::adjacency_list >; Graph2 = boost::adjacency_list >; IsoMapping = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&>; Invariant1 = boost::degree_vertex_invariant >, int, const int&, boost::vertex_index_t> >, boost::adjacency_list > >; Invariant2 = boost::degree_vertex_invariant >, int, const int&, boost::vertex_index_t> >, boost::adjacency_list > >; IndexMap1 = boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>; IndexMap2 = boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/isomorphism.hpp:532:33: required from ‘bool boost::isomorphism(const Graph1&, const Graph2&, IsoMapping, Invariant1, Invariant2, std::size_t, IndexMap1, IndexMap2) [with Graph1 = adjacency_list >; Graph2 = adjacency_list >; IsoMapping = iterator_property_map<__gnu_cxx::__normal_iterator >, adj_list_vertex_property_map >, int, int&, vertex_index_t>, void*, void*&>; Invariant1 = degree_vertex_invariant >, int, const int&, vertex_index_t> >, adjacency_list > >; Invariant2 = degree_vertex_invariant >, int, const int&, vertex_index_t> >, adjacency_list > >; IndexMap1 = adj_list_vertex_property_map >, int, const int&, vertex_index_t>; IndexMap2 = adj_list_vertex_property_map >, int, const int&, vertex_index_t>; std::size_t = long unsigned int]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/isomorphism.hpp:651:42: required from ‘bool boost::graph::detail::isomorphism_impl::operator()(const Graph1&, const Graph2&, const ArgPack&) const [with ArgPack = boost::parameter::aux::arg_list >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&> >, boost::parameter::aux::empty_arg_list, std::integral_constant >; Graph1 = boost::adjacency_list >; Graph2 = boost::adjacency_list >]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/isomorphism.hpp:662:5: required from ‘typename boost::result_of(Param0, Param1, const ArgPack&)>::type boost::graph::isomorphism_with_named_params(const Param0&, const Param1&, const ArgPack&) [with Param0 = boost::adjacency_list >; Param1 = boost::adjacency_list >; ArgPack = boost::parameter::aux::arg_list >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&> >, boost::parameter::aux::empty_arg_list, std::integral_constant >; typename boost::result_of(Param0, Param1, const ArgPack&)>::type = bool]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/isomorphism.hpp:666:1: required from ‘typename boost::result_of(Param0, Param1, const typename boost::detail::convert_bgl_params_to_boost_parameter >::type&)>::type boost::isomorphism(const Param0&, const Param1&, const bgl_named_params&) [with Param0 = adjacency_list >; Param1 = adjacency_list >; P = iterator_property_map<__gnu_cxx::__normal_iterator >, adj_list_vertex_property_map >, int, int&, vertex_index_t>, void*, void*&>; T = vertex_isomorphism_t; R = no_property; typename result_of(Param0, Param1, const typename detail::convert_bgl_params_to_boost_parameter >::type&)>::type = bool; typename detail::convert_bgl_params_to_boost_parameter >::type = parameter::aux::arg_list >, adj_list_vertex_property_map >, int, int&, vertex_index_t>, void*, void*&> >, parameter::aux::empty_arg_list, std::integral_constant >]’ ordering.cpp:68:18: required from here /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::range_detail::SinglePassIteratorConcept::~SinglePassIteratorConcept() [with Iterator = __gnu_cxx::__normal_iterator >]’ 37 | ~model() | ^ /home/omnipath/local/R/4.4-3.20/BH/include/boost/range/concepts.hpp:158:13: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 158 | BOOST_CONCEPT_USAGE(SinglePassIteratorConcept) | ^~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::CopyConstructible<__gnu_cxx::__normal_iterator > >]’: /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements > > >]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:167:5: required from ‘struct boost::CopyConstructible<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/range/concepts.hpp:125:16: required from ‘struct boost::range_detail::IncrementableIteratorConcept<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/range/concepts.hpp:147:16: required from ‘struct boost::range_detail::SinglePassIteratorConcept<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::range_detail::SinglePassIteratorConcept<__gnu_cxx::__normal_iterator > >]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:42:5: [ skipping 12 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/isomorphism.hpp:189:21: required from ‘bool boost::detail::isomorphism_algo::test_isomorphism() [with Graph1 = boost::adjacency_list >; Graph2 = boost::adjacency_list >; IsoMapping = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&>; Invariant1 = boost::degree_vertex_invariant >, int, const int&, boost::vertex_index_t> >, boost::adjacency_list > >; Invariant2 = boost::degree_vertex_invariant >, int, const int&, boost::vertex_index_t> >, boost::adjacency_list > >; IndexMap1 = boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>; IndexMap2 = boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/isomorphism.hpp:532:33: required from ‘bool boost::isomorphism(const Graph1&, const Graph2&, IsoMapping, Invariant1, Invariant2, std::size_t, IndexMap1, IndexMap2) [with Graph1 = adjacency_list >; Graph2 = adjacency_list >; IsoMapping = iterator_property_map<__gnu_cxx::__normal_iterator >, adj_list_vertex_property_map >, int, int&, vertex_index_t>, void*, void*&>; Invariant1 = degree_vertex_invariant >, int, const int&, vertex_index_t> >, adjacency_list > >; Invariant2 = degree_vertex_invariant >, int, const int&, vertex_index_t> >, adjacency_list > >; IndexMap1 = adj_list_vertex_property_map >, int, const int&, vertex_index_t>; IndexMap2 = adj_list_vertex_property_map >, int, const int&, vertex_index_t>; std::size_t = long unsigned int]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/isomorphism.hpp:651:42: required from ‘bool boost::graph::detail::isomorphism_impl::operator()(const Graph1&, const Graph2&, const ArgPack&) const [with ArgPack = boost::parameter::aux::arg_list >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&> >, boost::parameter::aux::empty_arg_list, std::integral_constant >; Graph1 = boost::adjacency_list >; Graph2 = boost::adjacency_list >]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/isomorphism.hpp:662:5: required from ‘typename boost::result_of(Param0, Param1, const ArgPack&)>::type boost::graph::isomorphism_with_named_params(const Param0&, const Param1&, const ArgPack&) [with Param0 = boost::adjacency_list >; Param1 = boost::adjacency_list >; ArgPack = boost::parameter::aux::arg_list >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&> >, boost::parameter::aux::empty_arg_list, std::integral_constant >; typename boost::result_of(Param0, Param1, const ArgPack&)>::type = bool]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/isomorphism.hpp:666:1: required from ‘typename boost::result_of(Param0, Param1, const typename boost::detail::convert_bgl_params_to_boost_parameter >::type&)>::type boost::isomorphism(const Param0&, const Param1&, const bgl_named_params&) [with Param0 = adjacency_list >; Param1 = adjacency_list >; P = iterator_property_map<__gnu_cxx::__normal_iterator >, adj_list_vertex_property_map >, int, int&, vertex_index_t>, void*, void*&>; T = vertex_isomorphism_t; R = no_property; typename result_of(Param0, Param1, const typename detail::convert_bgl_params_to_boost_parameter >::type&)>::type = bool; typename detail::convert_bgl_params_to_boost_parameter >::type = parameter::aux::arg_list >, adj_list_vertex_property_map >, int, int&, vertex_index_t>, void*, void*&> >, parameter::aux::empty_arg_list, std::integral_constant >]’ ordering.cpp:68:18: required from here /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::CopyConstructible::~CopyConstructible() [with TT = __gnu_cxx::__normal_iterator >]’ 37 | ~model() | ^ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:167:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 167 | BOOST_CONCEPT_USAGE(CopyConstructible) { | ^~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::range_detail::IncrementableIteratorConcept<__gnu_cxx::__normal_iterator > >]’: /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements > > >]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/range/concepts.hpp:136:13: required from ‘struct boost::range_detail::IncrementableIteratorConcept<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/range/concepts.hpp:147:16: required from ‘struct boost::range_detail::SinglePassIteratorConcept<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::range_detail::SinglePassIteratorConcept<__gnu_cxx::__normal_iterator > >]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied > > >::value’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:45:51: [ skipping 11 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/isomorphism.hpp:189:21: required from ‘bool boost::detail::isomorphism_algo::test_isomorphism() [with Graph1 = boost::adjacency_list >; Graph2 = boost::adjacency_list >; IsoMapping = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&>; Invariant1 = boost::degree_vertex_invariant >, int, const int&, boost::vertex_index_t> >, boost::adjacency_list > >; Invariant2 = boost::degree_vertex_invariant >, int, const int&, boost::vertex_index_t> >, boost::adjacency_list > >; IndexMap1 = boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>; IndexMap2 = boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/isomorphism.hpp:532:33: required from ‘bool boost::isomorphism(const Graph1&, const Graph2&, IsoMapping, Invariant1, Invariant2, std::size_t, IndexMap1, IndexMap2) [with Graph1 = adjacency_list >; Graph2 = adjacency_list >; IsoMapping = iterator_property_map<__gnu_cxx::__normal_iterator >, adj_list_vertex_property_map >, int, int&, vertex_index_t>, void*, void*&>; Invariant1 = degree_vertex_invariant >, int, const int&, vertex_index_t> >, adjacency_list > >; Invariant2 = degree_vertex_invariant >, int, const int&, vertex_index_t> >, adjacency_list > >; IndexMap1 = adj_list_vertex_property_map >, int, const int&, vertex_index_t>; IndexMap2 = adj_list_vertex_property_map >, int, const int&, vertex_index_t>; std::size_t = long unsigned int]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/isomorphism.hpp:651:42: required from ‘bool boost::graph::detail::isomorphism_impl::operator()(const Graph1&, const Graph2&, const ArgPack&) const [with ArgPack = boost::parameter::aux::arg_list >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&> >, boost::parameter::aux::empty_arg_list, std::integral_constant >; Graph1 = boost::adjacency_list >; Graph2 = boost::adjacency_list >]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/isomorphism.hpp:662:5: required from ‘typename boost::result_of(Param0, Param1, const ArgPack&)>::type boost::graph::isomorphism_with_named_params(const Param0&, const Param1&, const ArgPack&) [with Param0 = boost::adjacency_list >; Param1 = boost::adjacency_list >; ArgPack = boost::parameter::aux::arg_list >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&> >, boost::parameter::aux::empty_arg_list, std::integral_constant >; typename boost::result_of(Param0, Param1, const ArgPack&)>::type = bool]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/isomorphism.hpp:666:1: required from ‘typename boost::result_of(Param0, Param1, const typename boost::detail::convert_bgl_params_to_boost_parameter >::type&)>::type boost::isomorphism(const Param0&, const Param1&, const bgl_named_params&) [with Param0 = adjacency_list >; Param1 = adjacency_list >; P = iterator_property_map<__gnu_cxx::__normal_iterator >, adj_list_vertex_property_map >, int, int&, vertex_index_t>, void*, void*&>; T = vertex_isomorphism_t; R = no_property; typename result_of(Param0, Param1, const typename detail::convert_bgl_params_to_boost_parameter >::type&)>::type = bool; typename detail::convert_bgl_params_to_boost_parameter >::type = parameter::aux::arg_list >, adj_list_vertex_property_map >, int, int&, vertex_index_t>, void*, void*&> >, parameter::aux::empty_arg_list, std::integral_constant >]’ ordering.cpp:68:18: required from here /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::range_detail::IncrementableIteratorConcept::~IncrementableIteratorConcept() [with Iterator = __gnu_cxx::__normal_iterator >]’ 37 | ~model() | ^ /home/omnipath/local/R/4.4-3.20/BH/include/boost/range/concepts.hpp:136:13: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 136 | BOOST_CONCEPT_USAGE(IncrementableIteratorConcept) | ^~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::EqualityComparable<__gnu_cxx::__normal_iterator > >]’: /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements > > >]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:233:5: required from ‘struct boost::EqualityComparable<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/range/concepts.hpp:147:16: required from ‘struct boost::range_detail::SinglePassIteratorConcept<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::range_detail::SinglePassIteratorConcept<__gnu_cxx::__normal_iterator > >]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied > > >::value’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:45:51: [ skipping 11 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/isomorphism.hpp:189:21: required from ‘bool boost::detail::isomorphism_algo::test_isomorphism() [with Graph1 = boost::adjacency_list >; Graph2 = boost::adjacency_list >; IsoMapping = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&>; Invariant1 = boost::degree_vertex_invariant >, int, const int&, boost::vertex_index_t> >, boost::adjacency_list > >; Invariant2 = boost::degree_vertex_invariant >, int, const int&, boost::vertex_index_t> >, boost::adjacency_list > >; IndexMap1 = boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>; IndexMap2 = boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/isomorphism.hpp:532:33: required from ‘bool boost::isomorphism(const Graph1&, const Graph2&, IsoMapping, Invariant1, Invariant2, std::size_t, IndexMap1, IndexMap2) [with Graph1 = adjacency_list >; Graph2 = adjacency_list >; IsoMapping = iterator_property_map<__gnu_cxx::__normal_iterator >, adj_list_vertex_property_map >, int, int&, vertex_index_t>, void*, void*&>; Invariant1 = degree_vertex_invariant >, int, const int&, vertex_index_t> >, adjacency_list > >; Invariant2 = degree_vertex_invariant >, int, const int&, vertex_index_t> >, adjacency_list > >; IndexMap1 = adj_list_vertex_property_map >, int, const int&, vertex_index_t>; IndexMap2 = adj_list_vertex_property_map >, int, const int&, vertex_index_t>; std::size_t = long unsigned int]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/isomorphism.hpp:651:42: required from ‘bool boost::graph::detail::isomorphism_impl::operator()(const Graph1&, const Graph2&, const ArgPack&) const [with ArgPack = boost::parameter::aux::arg_list >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&> >, boost::parameter::aux::empty_arg_list, std::integral_constant >; Graph1 = boost::adjacency_list >; Graph2 = boost::adjacency_list >]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/isomorphism.hpp:662:5: required from ‘typename boost::result_of(Param0, Param1, const ArgPack&)>::type boost::graph::isomorphism_with_named_params(const Param0&, const Param1&, const ArgPack&) [with Param0 = boost::adjacency_list >; Param1 = boost::adjacency_list >; ArgPack = boost::parameter::aux::arg_list >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&> >, boost::parameter::aux::empty_arg_list, std::integral_constant >; typename boost::result_of(Param0, Param1, const ArgPack&)>::type = bool]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/isomorphism.hpp:666:1: required from ‘typename boost::result_of(Param0, Param1, const typename boost::detail::convert_bgl_params_to_boost_parameter >::type&)>::type boost::isomorphism(const Param0&, const Param1&, const bgl_named_params&) [with Param0 = adjacency_list >; Param1 = adjacency_list >; P = iterator_property_map<__gnu_cxx::__normal_iterator >, adj_list_vertex_property_map >, int, int&, vertex_index_t>, void*, void*&>; T = vertex_isomorphism_t; R = no_property; typename result_of(Param0, Param1, const typename detail::convert_bgl_params_to_boost_parameter >::type&)>::type = bool; typename detail::convert_bgl_params_to_boost_parameter >::type = parameter::aux::arg_list >, adj_list_vertex_property_map >, int, int&, vertex_index_t>, void*, void*&> >, parameter::aux::empty_arg_list, std::integral_constant >]’ ordering.cpp:68:18: required from here /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::EqualityComparable::~EqualityComparable() [with TT = __gnu_cxx::__normal_iterator >]’ 37 | ~model() | ^ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:233:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 233 | BOOST_CONCEPT_USAGE(EqualityComparable) { | ^~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::range_detail::SinglePassIteratorConcept<__gnu_cxx::__normal_iterator > >]’: /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements > > >]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/range/concepts.hpp:158:13: required from ‘struct boost::range_detail::SinglePassIteratorConcept<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::range_detail::SinglePassIteratorConcept<__gnu_cxx::__normal_iterator > >]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied > > >::value’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied > > >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:72:8: [ skipping 10 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/isomorphism.hpp:189:21: required from ‘bool boost::detail::isomorphism_algo::test_isomorphism() [with Graph1 = boost::adjacency_list >; Graph2 = boost::adjacency_list >; IsoMapping = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&>; Invariant1 = boost::degree_vertex_invariant >, int, const int&, boost::vertex_index_t> >, boost::adjacency_list > >; Invariant2 = boost::degree_vertex_invariant >, int, const int&, boost::vertex_index_t> >, boost::adjacency_list > >; IndexMap1 = boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>; IndexMap2 = boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/isomorphism.hpp:532:33: required from ‘bool boost::isomorphism(const Graph1&, const Graph2&, IsoMapping, Invariant1, Invariant2, std::size_t, IndexMap1, IndexMap2) [with Graph1 = adjacency_list >; Graph2 = adjacency_list >; IsoMapping = iterator_property_map<__gnu_cxx::__normal_iterator >, adj_list_vertex_property_map >, int, int&, vertex_index_t>, void*, void*&>; Invariant1 = degree_vertex_invariant >, int, const int&, vertex_index_t> >, adjacency_list > >; Invariant2 = degree_vertex_invariant >, int, const int&, vertex_index_t> >, adjacency_list > >; IndexMap1 = adj_list_vertex_property_map >, int, const int&, vertex_index_t>; IndexMap2 = adj_list_vertex_property_map >, int, const int&, vertex_index_t>; std::size_t = long unsigned int]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/isomorphism.hpp:651:42: required from ‘bool boost::graph::detail::isomorphism_impl::operator()(const Graph1&, const Graph2&, const ArgPack&) const [with ArgPack = boost::parameter::aux::arg_list >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&> >, boost::parameter::aux::empty_arg_list, std::integral_constant >; Graph1 = boost::adjacency_list >; Graph2 = boost::adjacency_list >]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/isomorphism.hpp:662:5: required from ‘typename boost::result_of(Param0, Param1, const ArgPack&)>::type boost::graph::isomorphism_with_named_params(const Param0&, const Param1&, const ArgPack&) [with Param0 = boost::adjacency_list >; Param1 = boost::adjacency_list >; ArgPack = boost::parameter::aux::arg_list >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&> >, boost::parameter::aux::empty_arg_list, std::integral_constant >; typename boost::result_of(Param0, Param1, const ArgPack&)>::type = bool]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/isomorphism.hpp:666:1: required from ‘typename boost::result_of(Param0, Param1, const typename boost::detail::convert_bgl_params_to_boost_parameter >::type&)>::type boost::isomorphism(const Param0&, const Param1&, const bgl_named_params&) [with Param0 = adjacency_list >; Param1 = adjacency_list >; P = iterator_property_map<__gnu_cxx::__normal_iterator >, adj_list_vertex_property_map >, int, int&, vertex_index_t>, void*, void*&>; T = vertex_isomorphism_t; R = no_property; typename result_of(Param0, Param1, const typename detail::convert_bgl_params_to_boost_parameter >::type&)>::type = bool; typename detail::convert_bgl_params_to_boost_parameter >::type = parameter::aux::arg_list >, adj_list_vertex_property_map >, int, int&, vertex_index_t>, void*, void*&> >, parameter::aux::empty_arg_list, std::integral_constant >]’ ordering.cpp:68:18: required from here /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::range_detail::SinglePassIteratorConcept::~SinglePassIteratorConcept() [with Iterator = __gnu_cxx::__normal_iterator >]’ 37 | ~model() | ^ /home/omnipath/local/R/4.4-3.20/BH/include/boost/range/concepts.hpp:158:13: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 158 | BOOST_CONCEPT_USAGE(SinglePassIteratorConcept) | ^~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::SinglePassRangeConcept >]’: /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements > >]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/range/concepts.hpp:284:9: required from ‘struct boost::SinglePassRangeConcept >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/range/concepts.hpp:318:12: required from ‘struct boost::ForwardRangeConcept >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/range/concepts.hpp:352:12: required from ‘struct boost::BidirectionalRangeConcept >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/range/concepts.hpp:370:12: required from ‘struct boost::RandomAccessRangeConcept >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:32:62: [ skipping 5 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/isomorphism.hpp:189:21: required from ‘bool boost::detail::isomorphism_algo::test_isomorphism() [with Graph1 = boost::adjacency_list >; Graph2 = boost::adjacency_list >; IsoMapping = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&>; Invariant1 = boost::degree_vertex_invariant >, int, const int&, boost::vertex_index_t> >, boost::adjacency_list > >; Invariant2 = boost::degree_vertex_invariant >, int, const int&, boost::vertex_index_t> >, boost::adjacency_list > >; IndexMap1 = boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>; IndexMap2 = boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/isomorphism.hpp:532:33: required from ‘bool boost::isomorphism(const Graph1&, const Graph2&, IsoMapping, Invariant1, Invariant2, std::size_t, IndexMap1, IndexMap2) [with Graph1 = adjacency_list >; Graph2 = adjacency_list >; IsoMapping = iterator_property_map<__gnu_cxx::__normal_iterator >, adj_list_vertex_property_map >, int, int&, vertex_index_t>, void*, void*&>; Invariant1 = degree_vertex_invariant >, int, const int&, vertex_index_t> >, adjacency_list > >; Invariant2 = degree_vertex_invariant >, int, const int&, vertex_index_t> >, adjacency_list > >; IndexMap1 = adj_list_vertex_property_map >, int, const int&, vertex_index_t>; IndexMap2 = adj_list_vertex_property_map >, int, const int&, vertex_index_t>; std::size_t = long unsigned int]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/isomorphism.hpp:651:42: required from ‘bool boost::graph::detail::isomorphism_impl::operator()(const Graph1&, const Graph2&, const ArgPack&) const [with ArgPack = boost::parameter::aux::arg_list >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&> >, boost::parameter::aux::empty_arg_list, std::integral_constant >; Graph1 = boost::adjacency_list >; Graph2 = boost::adjacency_list >]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/isomorphism.hpp:662:5: required from ‘typename boost::result_of(Param0, Param1, const ArgPack&)>::type boost::graph::isomorphism_with_named_params(const Param0&, const Param1&, const ArgPack&) [with Param0 = boost::adjacency_list >; Param1 = boost::adjacency_list >; ArgPack = boost::parameter::aux::arg_list >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&> >, boost::parameter::aux::empty_arg_list, std::integral_constant >; typename boost::result_of(Param0, Param1, const ArgPack&)>::type = bool]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/isomorphism.hpp:666:1: required from ‘typename boost::result_of(Param0, Param1, const typename boost::detail::convert_bgl_params_to_boost_parameter >::type&)>::type boost::isomorphism(const Param0&, const Param1&, const bgl_named_params&) [with Param0 = adjacency_list >; Param1 = adjacency_list >; P = iterator_property_map<__gnu_cxx::__normal_iterator >, adj_list_vertex_property_map >, int, int&, vertex_index_t>, void*, void*&>; T = vertex_isomorphism_t; R = no_property; typename result_of(Param0, Param1, const typename detail::convert_bgl_params_to_boost_parameter >::type&)>::type = bool; typename detail::convert_bgl_params_to_boost_parameter >::type = parameter::aux::arg_list >, adj_list_vertex_property_map >, int, int&, vertex_index_t>, void*, void*&> >, parameter::aux::empty_arg_list, std::integral_constant >]’ ordering.cpp:68:18: required from here /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::SinglePassRangeConcept::~SinglePassRangeConcept() [with T = std::vector]’ 37 | ~model() | ^ /home/omnipath/local/R/4.4-3.20/BH/include/boost/range/concepts.hpp:284:9: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 284 | BOOST_CONCEPT_USAGE(SinglePassRangeConcept) | ^~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::DefaultConstructible<__gnu_cxx::__normal_iterator > >]’: /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements > > >]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:137:5: required from ‘struct boost::DefaultConstructible<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/range/concepts.hpp:181:16: required from ‘struct boost::range_detail::ForwardIteratorConcept<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::range_detail::ForwardIteratorConcept<__gnu_cxx::__normal_iterator > >]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied > > >::value’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:45:51: [ skipping 10 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/isomorphism.hpp:189:21: required from ‘bool boost::detail::isomorphism_algo::test_isomorphism() [with Graph1 = boost::adjacency_list >; Graph2 = boost::adjacency_list >; IsoMapping = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&>; Invariant1 = boost::degree_vertex_invariant >, int, const int&, boost::vertex_index_t> >, boost::adjacency_list > >; Invariant2 = boost::degree_vertex_invariant >, int, const int&, boost::vertex_index_t> >, boost::adjacency_list > >; IndexMap1 = boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>; IndexMap2 = boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/isomorphism.hpp:532:33: required from ‘bool boost::isomorphism(const Graph1&, const Graph2&, IsoMapping, Invariant1, Invariant2, std::size_t, IndexMap1, IndexMap2) [with Graph1 = adjacency_list >; Graph2 = adjacency_list >; IsoMapping = iterator_property_map<__gnu_cxx::__normal_iterator >, adj_list_vertex_property_map >, int, int&, vertex_index_t>, void*, void*&>; Invariant1 = degree_vertex_invariant >, int, const int&, vertex_index_t> >, adjacency_list > >; Invariant2 = degree_vertex_invariant >, int, const int&, vertex_index_t> >, adjacency_list > >; IndexMap1 = adj_list_vertex_property_map >, int, const int&, vertex_index_t>; IndexMap2 = adj_list_vertex_property_map >, int, const int&, vertex_index_t>; std::size_t = long unsigned int]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/isomorphism.hpp:651:42: required from ‘bool boost::graph::detail::isomorphism_impl::operator()(const Graph1&, const Graph2&, const ArgPack&) const [with ArgPack = boost::parameter::aux::arg_list >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&> >, boost::parameter::aux::empty_arg_list, std::integral_constant >; Graph1 = boost::adjacency_list >; Graph2 = boost::adjacency_list >]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/isomorphism.hpp:662:5: required from ‘typename boost::result_of(Param0, Param1, const ArgPack&)>::type boost::graph::isomorphism_with_named_params(const Param0&, const Param1&, const ArgPack&) [with Param0 = boost::adjacency_list >; Param1 = boost::adjacency_list >; ArgPack = boost::parameter::aux::arg_list >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&> >, boost::parameter::aux::empty_arg_list, std::integral_constant >; typename boost::result_of(Param0, Param1, const ArgPack&)>::type = bool]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/isomorphism.hpp:666:1: required from ‘typename boost::result_of(Param0, Param1, const typename boost::detail::convert_bgl_params_to_boost_parameter >::type&)>::type boost::isomorphism(const Param0&, const Param1&, const bgl_named_params&) [with Param0 = adjacency_list >; Param1 = adjacency_list >; P = iterator_property_map<__gnu_cxx::__normal_iterator >, adj_list_vertex_property_map >, int, int&, vertex_index_t>, void*, void*&>; T = vertex_isomorphism_t; R = no_property; typename result_of(Param0, Param1, const typename detail::convert_bgl_params_to_boost_parameter >::type&)>::type = bool; typename detail::convert_bgl_params_to_boost_parameter >::type = parameter::aux::arg_list >, adj_list_vertex_property_map >, int, int&, vertex_index_t>, void*, void*&> >, parameter::aux::empty_arg_list, std::integral_constant >]’ ordering.cpp:68:18: required from here /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::DefaultConstructible::~DefaultConstructible() [with TT = __gnu_cxx::__normal_iterator >]’ 37 | ~model() | ^ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:137:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 137 | BOOST_CONCEPT_USAGE(DefaultConstructible) { | ^~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::range_detail::ForwardIteratorConcept<__gnu_cxx::__normal_iterator > >]’: /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements > > >]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/range/concepts.hpp:197:13: required from ‘struct boost::range_detail::ForwardIteratorConcept<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::range_detail::ForwardIteratorConcept<__gnu_cxx::__normal_iterator > >]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied > > >::value’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied > > >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:72:8: [ skipping 9 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/isomorphism.hpp:189:21: required from ‘bool boost::detail::isomorphism_algo::test_isomorphism() [with Graph1 = boost::adjacency_list >; Graph2 = boost::adjacency_list >; IsoMapping = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&>; Invariant1 = boost::degree_vertex_invariant >, int, const int&, boost::vertex_index_t> >, boost::adjacency_list > >; Invariant2 = boost::degree_vertex_invariant >, int, const int&, boost::vertex_index_t> >, boost::adjacency_list > >; IndexMap1 = boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>; IndexMap2 = boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/isomorphism.hpp:532:33: required from ‘bool boost::isomorphism(const Graph1&, const Graph2&, IsoMapping, Invariant1, Invariant2, std::size_t, IndexMap1, IndexMap2) [with Graph1 = adjacency_list >; Graph2 = adjacency_list >; IsoMapping = iterator_property_map<__gnu_cxx::__normal_iterator >, adj_list_vertex_property_map >, int, int&, vertex_index_t>, void*, void*&>; Invariant1 = degree_vertex_invariant >, int, const int&, vertex_index_t> >, adjacency_list > >; Invariant2 = degree_vertex_invariant >, int, const int&, vertex_index_t> >, adjacency_list > >; IndexMap1 = adj_list_vertex_property_map >, int, const int&, vertex_index_t>; IndexMap2 = adj_list_vertex_property_map >, int, const int&, vertex_index_t>; std::size_t = long unsigned int]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/isomorphism.hpp:651:42: required from ‘bool boost::graph::detail::isomorphism_impl::operator()(const Graph1&, const Graph2&, const ArgPack&) const [with ArgPack = boost::parameter::aux::arg_list >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&> >, boost::parameter::aux::empty_arg_list, std::integral_constant >; Graph1 = boost::adjacency_list >; Graph2 = boost::adjacency_list >]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/isomorphism.hpp:662:5: required from ‘typename boost::result_of(Param0, Param1, const ArgPack&)>::type boost::graph::isomorphism_with_named_params(const Param0&, const Param1&, const ArgPack&) [with Param0 = boost::adjacency_list >; Param1 = boost::adjacency_list >; ArgPack = boost::parameter::aux::arg_list >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&> >, boost::parameter::aux::empty_arg_list, std::integral_constant >; typename boost::result_of(Param0, Param1, const ArgPack&)>::type = bool]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/isomorphism.hpp:666:1: required from ‘typename boost::result_of(Param0, Param1, const typename boost::detail::convert_bgl_params_to_boost_parameter >::type&)>::type boost::isomorphism(const Param0&, const Param1&, const bgl_named_params&) [with Param0 = adjacency_list >; Param1 = adjacency_list >; P = iterator_property_map<__gnu_cxx::__normal_iterator >, adj_list_vertex_property_map >, int, int&, vertex_index_t>, void*, void*&>; T = vertex_isomorphism_t; R = no_property; typename result_of(Param0, Param1, const typename detail::convert_bgl_params_to_boost_parameter >::type&)>::type = bool; typename detail::convert_bgl_params_to_boost_parameter >::type = parameter::aux::arg_list >, adj_list_vertex_property_map >, int, int&, vertex_index_t>, void*, void*&> >, parameter::aux::empty_arg_list, std::integral_constant >]’ ordering.cpp:68:18: required from here /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::range_detail::ForwardIteratorConcept::~ForwardIteratorConcept() [with Iterator = __gnu_cxx::__normal_iterator >]’ 37 | ~model() | ^ /home/omnipath/local/R/4.4-3.20/BH/include/boost/range/concepts.hpp:197:13: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 197 | BOOST_CONCEPT_USAGE(ForwardIteratorConcept) | ^~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::DefaultConstructible<__gnu_cxx::__normal_iterator > >]’: /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements > > >]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:137:5: required from ‘struct boost::DefaultConstructible<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/range/concepts.hpp:181:16: required from ‘struct boost::range_detail::ForwardIteratorConcept<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::range_detail::ForwardIteratorConcept<__gnu_cxx::__normal_iterator > >]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied > > >::value’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:45:51: [ skipping 10 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/isomorphism.hpp:189:21: required from ‘bool boost::detail::isomorphism_algo::test_isomorphism() [with Graph1 = boost::adjacency_list >; Graph2 = boost::adjacency_list >; IsoMapping = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&>; Invariant1 = boost::degree_vertex_invariant >, int, const int&, boost::vertex_index_t> >, boost::adjacency_list > >; Invariant2 = boost::degree_vertex_invariant >, int, const int&, boost::vertex_index_t> >, boost::adjacency_list > >; IndexMap1 = boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>; IndexMap2 = boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/isomorphism.hpp:532:33: required from ‘bool boost::isomorphism(const Graph1&, const Graph2&, IsoMapping, Invariant1, Invariant2, std::size_t, IndexMap1, IndexMap2) [with Graph1 = adjacency_list >; Graph2 = adjacency_list >; IsoMapping = iterator_property_map<__gnu_cxx::__normal_iterator >, adj_list_vertex_property_map >, int, int&, vertex_index_t>, void*, void*&>; Invariant1 = degree_vertex_invariant >, int, const int&, vertex_index_t> >, adjacency_list > >; Invariant2 = degree_vertex_invariant >, int, const int&, vertex_index_t> >, adjacency_list > >; IndexMap1 = adj_list_vertex_property_map >, int, const int&, vertex_index_t>; IndexMap2 = adj_list_vertex_property_map >, int, const int&, vertex_index_t>; std::size_t = long unsigned int]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/isomorphism.hpp:651:42: required from ‘bool boost::graph::detail::isomorphism_impl::operator()(const Graph1&, const Graph2&, const ArgPack&) const [with ArgPack = boost::parameter::aux::arg_list >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&> >, boost::parameter::aux::empty_arg_list, std::integral_constant >; Graph1 = boost::adjacency_list >; Graph2 = boost::adjacency_list >]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/isomorphism.hpp:662:5: required from ‘typename boost::result_of(Param0, Param1, const ArgPack&)>::type boost::graph::isomorphism_with_named_params(const Param0&, const Param1&, const ArgPack&) [with Param0 = boost::adjacency_list >; Param1 = boost::adjacency_list >; ArgPack = boost::parameter::aux::arg_list >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&> >, boost::parameter::aux::empty_arg_list, std::integral_constant >; typename boost::result_of(Param0, Param1, const ArgPack&)>::type = bool]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/isomorphism.hpp:666:1: required from ‘typename boost::result_of(Param0, Param1, const typename boost::detail::convert_bgl_params_to_boost_parameter >::type&)>::type boost::isomorphism(const Param0&, const Param1&, const bgl_named_params&) [with Param0 = adjacency_list >; Param1 = adjacency_list >; P = iterator_property_map<__gnu_cxx::__normal_iterator >, adj_list_vertex_property_map >, int, int&, vertex_index_t>, void*, void*&>; T = vertex_isomorphism_t; R = no_property; typename result_of(Param0, Param1, const typename detail::convert_bgl_params_to_boost_parameter >::type&)>::type = bool; typename detail::convert_bgl_params_to_boost_parameter >::type = parameter::aux::arg_list >, adj_list_vertex_property_map >, int, int&, vertex_index_t>, void*, void*&> >, parameter::aux::empty_arg_list, std::integral_constant >]’ ordering.cpp:68:18: required from here /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::DefaultConstructible::~DefaultConstructible() [with TT = __gnu_cxx::__normal_iterator >]’ 37 | ~model() | ^ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:137:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 137 | BOOST_CONCEPT_USAGE(DefaultConstructible) { | ^~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::range_detail::ForwardIteratorConcept<__gnu_cxx::__normal_iterator > >]’: /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements > > >]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/range/concepts.hpp:197:13: required from ‘struct boost::range_detail::ForwardIteratorConcept<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::range_detail::ForwardIteratorConcept<__gnu_cxx::__normal_iterator > >]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied > > >::value’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied > > >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:72:8: [ skipping 9 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/isomorphism.hpp:189:21: required from ‘bool boost::detail::isomorphism_algo::test_isomorphism() [with Graph1 = boost::adjacency_list >; Graph2 = boost::adjacency_list >; IsoMapping = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&>; Invariant1 = boost::degree_vertex_invariant >, int, const int&, boost::vertex_index_t> >, boost::adjacency_list > >; Invariant2 = boost::degree_vertex_invariant >, int, const int&, boost::vertex_index_t> >, boost::adjacency_list > >; IndexMap1 = boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>; IndexMap2 = boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/isomorphism.hpp:532:33: required from ‘bool boost::isomorphism(const Graph1&, const Graph2&, IsoMapping, Invariant1, Invariant2, std::size_t, IndexMap1, IndexMap2) [with Graph1 = adjacency_list >; Graph2 = adjacency_list >; IsoMapping = iterator_property_map<__gnu_cxx::__normal_iterator >, adj_list_vertex_property_map >, int, int&, vertex_index_t>, void*, void*&>; Invariant1 = degree_vertex_invariant >, int, const int&, vertex_index_t> >, adjacency_list > >; Invariant2 = degree_vertex_invariant >, int, const int&, vertex_index_t> >, adjacency_list > >; IndexMap1 = adj_list_vertex_property_map >, int, const int&, vertex_index_t>; IndexMap2 = adj_list_vertex_property_map >, int, const int&, vertex_index_t>; std::size_t = long unsigned int]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/isomorphism.hpp:651:42: required from ‘bool boost::graph::detail::isomorphism_impl::operator()(const Graph1&, const Graph2&, const ArgPack&) const [with ArgPack = boost::parameter::aux::arg_list >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&> >, boost::parameter::aux::empty_arg_list, std::integral_constant >; Graph1 = boost::adjacency_list >; Graph2 = boost::adjacency_list >]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/isomorphism.hpp:662:5: required from ‘typename boost::result_of(Param0, Param1, const ArgPack&)>::type boost::graph::isomorphism_with_named_params(const Param0&, const Param1&, const ArgPack&) [with Param0 = boost::adjacency_list >; Param1 = boost::adjacency_list >; ArgPack = boost::parameter::aux::arg_list >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&> >, boost::parameter::aux::empty_arg_list, std::integral_constant >; typename boost::result_of(Param0, Param1, const ArgPack&)>::type = bool]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/isomorphism.hpp:666:1: required from ‘typename boost::result_of(Param0, Param1, const typename boost::detail::convert_bgl_params_to_boost_parameter >::type&)>::type boost::isomorphism(const Param0&, const Param1&, const bgl_named_params&) [with Param0 = adjacency_list >; Param1 = adjacency_list >; P = iterator_property_map<__gnu_cxx::__normal_iterator >, adj_list_vertex_property_map >, int, int&, vertex_index_t>, void*, void*&>; T = vertex_isomorphism_t; R = no_property; typename result_of(Param0, Param1, const typename detail::convert_bgl_params_to_boost_parameter >::type&)>::type = bool; typename detail::convert_bgl_params_to_boost_parameter >::type = parameter::aux::arg_list >, adj_list_vertex_property_map >, int, int&, vertex_index_t>, void*, void*&> >, parameter::aux::empty_arg_list, std::integral_constant >]’ ordering.cpp:68:18: required from here /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::range_detail::ForwardIteratorConcept::~ForwardIteratorConcept() [with Iterator = __gnu_cxx::__normal_iterator >]’ 37 | ~model() | ^ /home/omnipath/local/R/4.4-3.20/BH/include/boost/range/concepts.hpp:197:13: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 197 | BOOST_CONCEPT_USAGE(ForwardIteratorConcept) | ^~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::range_detail::BidirectionalIteratorConcept<__gnu_cxx::__normal_iterator > >]’: /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements > > >]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/range/concepts.hpp:224:14: required from ‘struct boost::range_detail::BidirectionalIteratorConcept<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::range_detail::BidirectionalIteratorConcept<__gnu_cxx::__normal_iterator > >]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied > > >::value’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied > > >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:72:8: [ skipping 8 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/isomorphism.hpp:189:21: required from ‘bool boost::detail::isomorphism_algo::test_isomorphism() [with Graph1 = boost::adjacency_list >; Graph2 = boost::adjacency_list >; IsoMapping = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&>; Invariant1 = boost::degree_vertex_invariant >, int, const int&, boost::vertex_index_t> >, boost::adjacency_list > >; Invariant2 = boost::degree_vertex_invariant >, int, const int&, boost::vertex_index_t> >, boost::adjacency_list > >; IndexMap1 = boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>; IndexMap2 = boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/isomorphism.hpp:532:33: required from ‘bool boost::isomorphism(const Graph1&, const Graph2&, IsoMapping, Invariant1, Invariant2, std::size_t, IndexMap1, IndexMap2) [with Graph1 = adjacency_list >; Graph2 = adjacency_list >; IsoMapping = iterator_property_map<__gnu_cxx::__normal_iterator >, adj_list_vertex_property_map >, int, int&, vertex_index_t>, void*, void*&>; Invariant1 = degree_vertex_invariant >, int, const int&, vertex_index_t> >, adjacency_list > >; Invariant2 = degree_vertex_invariant >, int, const int&, vertex_index_t> >, adjacency_list > >; IndexMap1 = adj_list_vertex_property_map >, int, const int&, vertex_index_t>; IndexMap2 = adj_list_vertex_property_map >, int, const int&, vertex_index_t>; std::size_t = long unsigned int]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/isomorphism.hpp:651:42: required from ‘bool boost::graph::detail::isomorphism_impl::operator()(const Graph1&, const Graph2&, const ArgPack&) const [with ArgPack = boost::parameter::aux::arg_list >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&> >, boost::parameter::aux::empty_arg_list, std::integral_constant >; Graph1 = boost::adjacency_list >; Graph2 = boost::adjacency_list >]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/isomorphism.hpp:662:5: required from ‘typename boost::result_of(Param0, Param1, const ArgPack&)>::type boost::graph::isomorphism_with_named_params(const Param0&, const Param1&, const ArgPack&) [with Param0 = boost::adjacency_list >; Param1 = boost::adjacency_list >; ArgPack = boost::parameter::aux::arg_list >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&> >, boost::parameter::aux::empty_arg_list, std::integral_constant >; typename boost::result_of(Param0, Param1, const ArgPack&)>::type = bool]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/isomorphism.hpp:666:1: required from ‘typename boost::result_of(Param0, Param1, const typename boost::detail::convert_bgl_params_to_boost_parameter >::type&)>::type boost::isomorphism(const Param0&, const Param1&, const bgl_named_params&) [with Param0 = adjacency_list >; Param1 = adjacency_list >; P = iterator_property_map<__gnu_cxx::__normal_iterator >, adj_list_vertex_property_map >, int, int&, vertex_index_t>, void*, void*&>; T = vertex_isomorphism_t; R = no_property; typename result_of(Param0, Param1, const typename detail::convert_bgl_params_to_boost_parameter >::type&)>::type = bool; typename detail::convert_bgl_params_to_boost_parameter >::type = parameter::aux::arg_list >, adj_list_vertex_property_map >, int, int&, vertex_index_t>, void*, void*&> >, parameter::aux::empty_arg_list, std::integral_constant >]’ ordering.cpp:68:18: required from here /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::range_detail::BidirectionalIteratorConcept::~BidirectionalIteratorConcept() [with Iterator = __gnu_cxx::__normal_iterator >]’ 37 | ~model() | ^ /home/omnipath/local/R/4.4-3.20/BH/include/boost/range/concepts.hpp:224:14: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 224 | BOOST_CONCEPT_USAGE(BidirectionalIteratorConcept) | ^~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::range_detail::BidirectionalIteratorConcept<__gnu_cxx::__normal_iterator > >]’: /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements > > >]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/range/concepts.hpp:224:14: required from ‘struct boost::range_detail::BidirectionalIteratorConcept<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::range_detail::BidirectionalIteratorConcept<__gnu_cxx::__normal_iterator > >]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied > > >::value’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied > > >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:72:8: [ skipping 8 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/isomorphism.hpp:189:21: required from ‘bool boost::detail::isomorphism_algo::test_isomorphism() [with Graph1 = boost::adjacency_list >; Graph2 = boost::adjacency_list >; IsoMapping = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&>; Invariant1 = boost::degree_vertex_invariant >, int, const int&, boost::vertex_index_t> >, boost::adjacency_list > >; Invariant2 = boost::degree_vertex_invariant >, int, const int&, boost::vertex_index_t> >, boost::adjacency_list > >; IndexMap1 = boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>; IndexMap2 = boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/isomorphism.hpp:532:33: required from ‘bool boost::isomorphism(const Graph1&, const Graph2&, IsoMapping, Invariant1, Invariant2, std::size_t, IndexMap1, IndexMap2) [with Graph1 = adjacency_list >; Graph2 = adjacency_list >; IsoMapping = iterator_property_map<__gnu_cxx::__normal_iterator >, adj_list_vertex_property_map >, int, int&, vertex_index_t>, void*, void*&>; Invariant1 = degree_vertex_invariant >, int, const int&, vertex_index_t> >, adjacency_list > >; Invariant2 = degree_vertex_invariant >, int, const int&, vertex_index_t> >, adjacency_list > >; IndexMap1 = adj_list_vertex_property_map >, int, const int&, vertex_index_t>; IndexMap2 = adj_list_vertex_property_map >, int, const int&, vertex_index_t>; std::size_t = long unsigned int]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/isomorphism.hpp:651:42: required from ‘bool boost::graph::detail::isomorphism_impl::operator()(const Graph1&, const Graph2&, const ArgPack&) const [with ArgPack = boost::parameter::aux::arg_list >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&> >, boost::parameter::aux::empty_arg_list, std::integral_constant >; Graph1 = boost::adjacency_list >; Graph2 = boost::adjacency_list >]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/isomorphism.hpp:662:5: required from ‘typename boost::result_of(Param0, Param1, const ArgPack&)>::type boost::graph::isomorphism_with_named_params(const Param0&, const Param1&, const ArgPack&) [with Param0 = boost::adjacency_list >; Param1 = boost::adjacency_list >; ArgPack = boost::parameter::aux::arg_list >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&> >, boost::parameter::aux::empty_arg_list, std::integral_constant >; typename boost::result_of(Param0, Param1, const ArgPack&)>::type = bool]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/isomorphism.hpp:666:1: required from ‘typename boost::result_of(Param0, Param1, const typename boost::detail::convert_bgl_params_to_boost_parameter >::type&)>::type boost::isomorphism(const Param0&, const Param1&, const bgl_named_params&) [with Param0 = adjacency_list >; Param1 = adjacency_list >; P = iterator_property_map<__gnu_cxx::__normal_iterator >, adj_list_vertex_property_map >, int, int&, vertex_index_t>, void*, void*&>; T = vertex_isomorphism_t; R = no_property; typename result_of(Param0, Param1, const typename detail::convert_bgl_params_to_boost_parameter >::type&)>::type = bool; typename detail::convert_bgl_params_to_boost_parameter >::type = parameter::aux::arg_list >, adj_list_vertex_property_map >, int, int&, vertex_index_t>, void*, void*&> >, parameter::aux::empty_arg_list, std::integral_constant >]’ ordering.cpp:68:18: required from here /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::range_detail::BidirectionalIteratorConcept::~BidirectionalIteratorConcept() [with Iterator = __gnu_cxx::__normal_iterator >]’ 37 | ~model() | ^ /home/omnipath/local/R/4.4-3.20/BH/include/boost/range/concepts.hpp:224:14: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 224 | BOOST_CONCEPT_USAGE(BidirectionalIteratorConcept) | ^~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::range_detail::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator > >]’: /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements > > >]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/range/concepts.hpp:245:14: required from ‘struct boost::range_detail::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::range_detail::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator > >]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied > > >::value’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied > > >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:72:8: [ skipping 7 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/isomorphism.hpp:189:21: required from ‘bool boost::detail::isomorphism_algo::test_isomorphism() [with Graph1 = boost::adjacency_list >; Graph2 = boost::adjacency_list >; IsoMapping = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&>; Invariant1 = boost::degree_vertex_invariant >, int, const int&, boost::vertex_index_t> >, boost::adjacency_list > >; Invariant2 = boost::degree_vertex_invariant >, int, const int&, boost::vertex_index_t> >, boost::adjacency_list > >; IndexMap1 = boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>; IndexMap2 = boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/isomorphism.hpp:532:33: required from ‘bool boost::isomorphism(const Graph1&, const Graph2&, IsoMapping, Invariant1, Invariant2, std::size_t, IndexMap1, IndexMap2) [with Graph1 = adjacency_list >; Graph2 = adjacency_list >; IsoMapping = iterator_property_map<__gnu_cxx::__normal_iterator >, adj_list_vertex_property_map >, int, int&, vertex_index_t>, void*, void*&>; Invariant1 = degree_vertex_invariant >, int, const int&, vertex_index_t> >, adjacency_list > >; Invariant2 = degree_vertex_invariant >, int, const int&, vertex_index_t> >, adjacency_list > >; IndexMap1 = adj_list_vertex_property_map >, int, const int&, vertex_index_t>; IndexMap2 = adj_list_vertex_property_map >, int, const int&, vertex_index_t>; std::size_t = long unsigned int]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/isomorphism.hpp:651:42: required from ‘bool boost::graph::detail::isomorphism_impl::operator()(const Graph1&, const Graph2&, const ArgPack&) const [with ArgPack = boost::parameter::aux::arg_list >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&> >, boost::parameter::aux::empty_arg_list, std::integral_constant >; Graph1 = boost::adjacency_list >; Graph2 = boost::adjacency_list >]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/isomorphism.hpp:662:5: required from ‘typename boost::result_of(Param0, Param1, const ArgPack&)>::type boost::graph::isomorphism_with_named_params(const Param0&, const Param1&, const ArgPack&) [with Param0 = boost::adjacency_list >; Param1 = boost::adjacency_list >; ArgPack = boost::parameter::aux::arg_list >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&> >, boost::parameter::aux::empty_arg_list, std::integral_constant >; typename boost::result_of(Param0, Param1, const ArgPack&)>::type = bool]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/isomorphism.hpp:666:1: required from ‘typename boost::result_of(Param0, Param1, const typename boost::detail::convert_bgl_params_to_boost_parameter >::type&)>::type boost::isomorphism(const Param0&, const Param1&, const bgl_named_params&) [with Param0 = adjacency_list >; Param1 = adjacency_list >; P = iterator_property_map<__gnu_cxx::__normal_iterator >, adj_list_vertex_property_map >, int, int&, vertex_index_t>, void*, void*&>; T = vertex_isomorphism_t; R = no_property; typename result_of(Param0, Param1, const typename detail::convert_bgl_params_to_boost_parameter >::type&)>::type = bool; typename detail::convert_bgl_params_to_boost_parameter >::type = parameter::aux::arg_list >, adj_list_vertex_property_map >, int, int&, vertex_index_t>, void*, void*&> >, parameter::aux::empty_arg_list, std::integral_constant >]’ ordering.cpp:68:18: required from here /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::range_detail::RandomAccessIteratorConcept::~RandomAccessIteratorConcept() [with Iterator = __gnu_cxx::__normal_iterator >]’ 37 | ~model() | ^ /home/omnipath/local/R/4.4-3.20/BH/include/boost/range/concepts.hpp:245:14: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 245 | BOOST_CONCEPT_USAGE(RandomAccessIteratorConcept) | ^~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::range_detail::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator > >]’: /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements > > >]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/range/concepts.hpp:245:14: required from ‘struct boost::range_detail::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::range_detail::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator > >]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied > > >::value’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied > > >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:72:8: [ skipping 7 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/isomorphism.hpp:189:21: required from ‘bool boost::detail::isomorphism_algo::test_isomorphism() [with Graph1 = boost::adjacency_list >; Graph2 = boost::adjacency_list >; IsoMapping = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&>; Invariant1 = boost::degree_vertex_invariant >, int, const int&, boost::vertex_index_t> >, boost::adjacency_list > >; Invariant2 = boost::degree_vertex_invariant >, int, const int&, boost::vertex_index_t> >, boost::adjacency_list > >; IndexMap1 = boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>; IndexMap2 = boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/isomorphism.hpp:532:33: required from ‘bool boost::isomorphism(const Graph1&, const Graph2&, IsoMapping, Invariant1, Invariant2, std::size_t, IndexMap1, IndexMap2) [with Graph1 = adjacency_list >; Graph2 = adjacency_list >; IsoMapping = iterator_property_map<__gnu_cxx::__normal_iterator >, adj_list_vertex_property_map >, int, int&, vertex_index_t>, void*, void*&>; Invariant1 = degree_vertex_invariant >, int, const int&, vertex_index_t> >, adjacency_list > >; Invariant2 = degree_vertex_invariant >, int, const int&, vertex_index_t> >, adjacency_list > >; IndexMap1 = adj_list_vertex_property_map >, int, const int&, vertex_index_t>; IndexMap2 = adj_list_vertex_property_map >, int, const int&, vertex_index_t>; std::size_t = long unsigned int]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/isomorphism.hpp:651:42: required from ‘bool boost::graph::detail::isomorphism_impl::operator()(const Graph1&, const Graph2&, const ArgPack&) const [with ArgPack = boost::parameter::aux::arg_list >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&> >, boost::parameter::aux::empty_arg_list, std::integral_constant >; Graph1 = boost::adjacency_list >; Graph2 = boost::adjacency_list >]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/isomorphism.hpp:662:5: required from ‘typename boost::result_of(Param0, Param1, const ArgPack&)>::type boost::graph::isomorphism_with_named_params(const Param0&, const Param1&, const ArgPack&) [with Param0 = boost::adjacency_list >; Param1 = boost::adjacency_list >; ArgPack = boost::parameter::aux::arg_list >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&> >, boost::parameter::aux::empty_arg_list, std::integral_constant >; typename boost::result_of(Param0, Param1, const ArgPack&)>::type = bool]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/isomorphism.hpp:666:1: required from ‘typename boost::result_of(Param0, Param1, const typename boost::detail::convert_bgl_params_to_boost_parameter >::type&)>::type boost::isomorphism(const Param0&, const Param1&, const bgl_named_params&) [with Param0 = adjacency_list >; Param1 = adjacency_list >; P = iterator_property_map<__gnu_cxx::__normal_iterator >, adj_list_vertex_property_map >, int, int&, vertex_index_t>, void*, void*&>; T = vertex_isomorphism_t; R = no_property; typename result_of(Param0, Param1, const typename detail::convert_bgl_params_to_boost_parameter >::type&)>::type = bool; typename detail::convert_bgl_params_to_boost_parameter >::type = parameter::aux::arg_list >, adj_list_vertex_property_map >, int, int&, vertex_index_t>, void*, void*&> >, parameter::aux::empty_arg_list, std::integral_constant >]’ ordering.cpp:68:18: required from here /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::range_detail::RandomAccessIteratorConcept::~RandomAccessIteratorConcept() [with Iterator = __gnu_cxx::__normal_iterator >]’ 37 | ~model() | ^ /home/omnipath/local/R/4.4-3.20/BH/include/boost/range/concepts.hpp:245:14: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 245 | BOOST_CONCEPT_USAGE(RandomAccessIteratorConcept) | ^~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements > > >]’: /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/graph_concepts.hpp:87:5: required from ‘struct boost::concepts::IncidenceGraph > >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/graph_concepts.hpp:75:1: required from ‘struct boost::concepts::IncidenceGraphConcept > >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::concepts::IncidenceGraphConcept > >]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied > > >::value’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied > > >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:72:8: [ skipping 3 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/isomorphism.hpp:209:38: required from ‘bool boost::detail::isomorphism_algo::test_isomorphism() [with Graph1 = boost::adjacency_list >; Graph2 = boost::adjacency_list >; IsoMapping = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&>; Invariant1 = boost::degree_vertex_invariant >, int, const int&, boost::vertex_index_t> >, boost::adjacency_list > >; Invariant2 = boost::degree_vertex_invariant >, int, const int&, boost::vertex_index_t> >, boost::adjacency_list > >; IndexMap1 = boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>; IndexMap2 = boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/isomorphism.hpp:532:33: required from ‘bool boost::isomorphism(const Graph1&, const Graph2&, IsoMapping, Invariant1, Invariant2, std::size_t, IndexMap1, IndexMap2) [with Graph1 = adjacency_list >; Graph2 = adjacency_list >; IsoMapping = iterator_property_map<__gnu_cxx::__normal_iterator >, adj_list_vertex_property_map >, int, int&, vertex_index_t>, void*, void*&>; Invariant1 = degree_vertex_invariant >, int, const int&, vertex_index_t> >, adjacency_list > >; Invariant2 = degree_vertex_invariant >, int, const int&, vertex_index_t> >, adjacency_list > >; IndexMap1 = adj_list_vertex_property_map >, int, const int&, vertex_index_t>; IndexMap2 = adj_list_vertex_property_map >, int, const int&, vertex_index_t>; std::size_t = long unsigned int]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/isomorphism.hpp:651:42: required from ‘bool boost::graph::detail::isomorphism_impl::operator()(const Graph1&, const Graph2&, const ArgPack&) const [with ArgPack = boost::parameter::aux::arg_list >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&> >, boost::parameter::aux::empty_arg_list, std::integral_constant >; Graph1 = boost::adjacency_list >; Graph2 = boost::adjacency_list >]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/isomorphism.hpp:662:5: required from ‘typename boost::result_of(Param0, Param1, const ArgPack&)>::type boost::graph::isomorphism_with_named_params(const Param0&, const Param1&, const ArgPack&) [with Param0 = boost::adjacency_list >; Param1 = boost::adjacency_list >; ArgPack = boost::parameter::aux::arg_list >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&> >, boost::parameter::aux::empty_arg_list, std::integral_constant >; typename boost::result_of(Param0, Param1, const ArgPack&)>::type = bool]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/isomorphism.hpp:666:1: required from ‘typename boost::result_of(Param0, Param1, const typename boost::detail::convert_bgl_params_to_boost_parameter >::type&)>::type boost::isomorphism(const Param0&, const Param1&, const bgl_named_params&) [with Param0 = adjacency_list >; Param1 = adjacency_list >; P = iterator_property_map<__gnu_cxx::__normal_iterator >, adj_list_vertex_property_map >, int, int&, vertex_index_t>, void*, void*&>; T = vertex_isomorphism_t; R = no_property; typename result_of(Param0, Param1, const typename detail::convert_bgl_params_to_boost_parameter >::type&)>::type = bool; typename detail::convert_bgl_params_to_boost_parameter >::type = parameter::aux::arg_list >, adj_list_vertex_property_map >, int, int&, vertex_index_t>, void*, void*&> >, parameter::aux::empty_arg_list, std::integral_constant >]’ ordering.cpp:68:18: required from here /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::concepts::IncidenceGraph > >]’ 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ^ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::IncidenceGraphConcept > >]’: /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/depth_first_search.hpp:129:9: required from ‘void boost::detail::depth_first_visit_impl(const IncidenceGraph&, typename boost::graph_traits::vertex_descriptor, DFSVisitor&, ColorMap, TerminatorFunc) [with IncidenceGraph = boost::adjacency_list >; DFSVisitor = isomorphism_algo >, boost::adjacency_list >, boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&>, boost::degree_vertex_invariant >, int, const int&, boost::vertex_index_t> >, boost::adjacency_list > >, boost::degree_vertex_invariant >, int, const int&, boost::vertex_index_t> >, boost::adjacency_list > >, boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>, boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t> >::record_dfs_order; ColorMap = boost::safe_iterator_property_map<__gnu_cxx::__normal_iterator >, boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>, boost::default_color_type, boost::default_color_type&>; TerminatorFunc = nontruth2; typename boost::graph_traits::vertex_descriptor = void*]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/depth_first_search.hpp:417:35: required from ‘void boost::depth_first_visit(const IncidenceGraph&, typename graph_traits::vertex_descriptor, DFSVisitor, ColorMap) [with IncidenceGraph = adjacency_list >; DFSVisitor = detail::isomorphism_algo >, adjacency_list >, iterator_property_map<__gnu_cxx::__normal_iterator >, adj_list_vertex_property_map >, int, int&, vertex_index_t>, void*, void*&>, degree_vertex_invariant >, int, const int&, vertex_index_t> >, adjacency_list > >, degree_vertex_invariant >, int, const int&, vertex_index_t> >, adjacency_list > >, adj_list_vertex_property_map >, int, const int&, vertex_index_t>, adj_list_vertex_property_map >, int, const int&, vertex_index_t> >::record_dfs_order; ColorMap = safe_iterator_property_map<__gnu_cxx::__normal_iterator >, adj_list_vertex_property_map >, int, const int&, vertex_index_t>, default_color_type, default_color_type&>; typename graph_traits::vertex_descriptor = void*]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/isomorphism.hpp:209:38: required from ‘bool boost::detail::isomorphism_algo::test_isomorphism() [with Graph1 = boost::adjacency_list >; Graph2 = boost::adjacency_list >; IsoMapping = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&>; Invariant1 = boost::degree_vertex_invariant >, int, const int&, boost::vertex_index_t> >, boost::adjacency_list > >; Invariant2 = boost::degree_vertex_invariant >, int, const int&, boost::vertex_index_t> >, boost::adjacency_list > >; IndexMap1 = boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>; IndexMap2 = boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/isomorphism.hpp:532:33: required from ‘bool boost::isomorphism(const Graph1&, const Graph2&, IsoMapping, Invariant1, Invariant2, std::size_t, IndexMap1, IndexMap2) [with Graph1 = adjacency_list >; Graph2 = adjacency_list >; IsoMapping = iterator_property_map<__gnu_cxx::__normal_iterator >, adj_list_vertex_property_map >, int, int&, vertex_index_t>, void*, void*&>; Invariant1 = degree_vertex_invariant >, int, const int&, vertex_index_t> >, adjacency_list > >; Invariant2 = degree_vertex_invariant >, int, const int&, vertex_index_t> >, adjacency_list > >; IndexMap1 = adj_list_vertex_property_map >, int, const int&, vertex_index_t>; IndexMap2 = adj_list_vertex_property_map >, int, const int&, vertex_index_t>; std::size_t = long unsigned int]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/isomorphism.hpp:651:42: required from ‘bool boost::graph::detail::isomorphism_impl::operator()(const Graph1&, const Graph2&, const ArgPack&) const [with ArgPack = boost::parameter::aux::arg_list >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&> >, boost::parameter::aux::empty_arg_list, std::integral_constant >; Graph1 = boost::adjacency_list >; Graph2 = boost::adjacency_list >]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/isomorphism.hpp:662:5: required from ‘typename boost::result_of(Param0, Param1, const ArgPack&)>::type boost::graph::isomorphism_with_named_params(const Param0&, const Param1&, const ArgPack&) [with Param0 = boost::adjacency_list >; Param1 = boost::adjacency_list >; ArgPack = boost::parameter::aux::arg_list >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&> >, boost::parameter::aux::empty_arg_list, std::integral_constant >; typename boost::result_of(Param0, Param1, const ArgPack&)>::type = bool]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/isomorphism.hpp:666:1: required from ‘typename boost::result_of(Param0, Param1, const typename boost::detail::convert_bgl_params_to_boost_parameter >::type&)>::type boost::isomorphism(const Param0&, const Param1&, const bgl_named_params&) [with Param0 = adjacency_list >; Param1 = adjacency_list >; P = iterator_property_map<__gnu_cxx::__normal_iterator >, adj_list_vertex_property_map >, int, int&, vertex_index_t>, void*, void*&>; T = vertex_isomorphism_t; R = no_property; typename result_of(Param0, Param1, const typename detail::convert_bgl_params_to_boost_parameter >::type&)>::type = bool; typename detail::convert_bgl_params_to_boost_parameter >::type = parameter::aux::arg_list >, adj_list_vertex_property_map >, int, int&, vertex_index_t>, void*, void*&> >, parameter::aux::empty_arg_list, std::integral_constant >]’ ordering.cpp:68:18: required from here /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/graph_concepts.hpp:75:15: note: in a call to non-static member function ‘boost::concepts::IncidenceGraphConcept > >::~IncidenceGraphConcept()’ 75 | BOOST_concept(IncidenceGraph, (G)) : Graph< G > | ^~~~~~~~~~~~~~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/preprocessor/cat.hpp:29:34: note: in definition of macro ‘BOOST_PP_CAT_I’ 29 | # define BOOST_PP_CAT_I(a, b) a ## b | ^ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/concept_def.hpp:23:12: note: in expansion of macro ‘BOOST_PP_CAT’ 23 | struct BOOST_PP_CAT(name,Concept) \ | ^~~~~~~~~~~~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/graph_concepts.hpp:75:1: note: in expansion of macro ‘BOOST_concept’ 75 | BOOST_concept(IncidenceGraph, (G)) : Graph< G > | ^~~~~~~~~~~~~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::constraint::failed() [with Model = boost::DFSVisitorConcept >, boost::adjacency_list >, boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&>, boost::degree_vertex_invariant >, int, const int&, boost::vertex_index_t> >, boost::adjacency_list > >, boost::degree_vertex_invariant >, int, const int&, boost::vertex_index_t> >, boost::adjacency_list > >, boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>, boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t> >::record_dfs_order, boost::adjacency_list > >]’: /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/depth_first_search.hpp:130:9: required from ‘void boost::detail::depth_first_visit_impl(const IncidenceGraph&, typename boost::graph_traits::vertex_descriptor, DFSVisitor&, ColorMap, TerminatorFunc) [with IncidenceGraph = boost::adjacency_list >; DFSVisitor = isomorphism_algo >, boost::adjacency_list >, boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&>, boost::degree_vertex_invariant >, int, const int&, boost::vertex_index_t> >, boost::adjacency_list > >, boost::degree_vertex_invariant >, int, const int&, boost::vertex_index_t> >, boost::adjacency_list > >, boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>, boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t> >::record_dfs_order; ColorMap = boost::safe_iterator_property_map<__gnu_cxx::__normal_iterator >, boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>, boost::default_color_type, boost::default_color_type&>; TerminatorFunc = nontruth2; typename boost::graph_traits::vertex_descriptor = void*]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/depth_first_search.hpp:417:35: required from ‘void boost::depth_first_visit(const IncidenceGraph&, typename graph_traits::vertex_descriptor, DFSVisitor, ColorMap) [with IncidenceGraph = adjacency_list >; DFSVisitor = detail::isomorphism_algo >, adjacency_list >, iterator_property_map<__gnu_cxx::__normal_iterator >, adj_list_vertex_property_map >, int, int&, vertex_index_t>, void*, void*&>, degree_vertex_invariant >, int, const int&, vertex_index_t> >, adjacency_list > >, degree_vertex_invariant >, int, const int&, vertex_index_t> >, adjacency_list > >, adj_list_vertex_property_map >, int, const int&, vertex_index_t>, adj_list_vertex_property_map >, int, const int&, vertex_index_t> >::record_dfs_order; ColorMap = safe_iterator_property_map<__gnu_cxx::__normal_iterator >, adj_list_vertex_property_map >, int, const int&, vertex_index_t>, default_color_type, default_color_type&>; typename graph_traits::vertex_descriptor = void*]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/isomorphism.hpp:209:38: required from ‘bool boost::detail::isomorphism_algo::test_isomorphism() [with Graph1 = boost::adjacency_list >; Graph2 = boost::adjacency_list >; IsoMapping = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&>; Invariant1 = boost::degree_vertex_invariant >, int, const int&, boost::vertex_index_t> >, boost::adjacency_list > >; Invariant2 = boost::degree_vertex_invariant >, int, const int&, boost::vertex_index_t> >, boost::adjacency_list > >; IndexMap1 = boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>; IndexMap2 = boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/isomorphism.hpp:532:33: required from ‘bool boost::isomorphism(const Graph1&, const Graph2&, IsoMapping, Invariant1, Invariant2, std::size_t, IndexMap1, IndexMap2) [with Graph1 = adjacency_list >; Graph2 = adjacency_list >; IsoMapping = iterator_property_map<__gnu_cxx::__normal_iterator >, adj_list_vertex_property_map >, int, int&, vertex_index_t>, void*, void*&>; Invariant1 = degree_vertex_invariant >, int, const int&, vertex_index_t> >, adjacency_list > >; Invariant2 = degree_vertex_invariant >, int, const int&, vertex_index_t> >, adjacency_list > >; IndexMap1 = adj_list_vertex_property_map >, int, const int&, vertex_index_t>; IndexMap2 = adj_list_vertex_property_map >, int, const int&, vertex_index_t>; std::size_t = long unsigned int]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/isomorphism.hpp:651:42: required from ‘bool boost::graph::detail::isomorphism_impl::operator()(const Graph1&, const Graph2&, const ArgPack&) const [with ArgPack = boost::parameter::aux::arg_list >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&> >, boost::parameter::aux::empty_arg_list, std::integral_constant >; Graph1 = boost::adjacency_list >; Graph2 = boost::adjacency_list >]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/isomorphism.hpp:662:5: required from ‘typename boost::result_of(Param0, Param1, const ArgPack&)>::type boost::graph::isomorphism_with_named_params(const Param0&, const Param1&, const ArgPack&) [with Param0 = boost::adjacency_list >; Param1 = boost::adjacency_list >; ArgPack = boost::parameter::aux::arg_list >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&> >, boost::parameter::aux::empty_arg_list, std::integral_constant >; typename boost::result_of(Param0, Param1, const ArgPack&)>::type = bool]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/isomorphism.hpp:666:1: required from ‘typename boost::result_of(Param0, Param1, const typename boost::detail::convert_bgl_params_to_boost_parameter >::type&)>::type boost::isomorphism(const Param0&, const Param1&, const bgl_named_params&) [with Param0 = adjacency_list >; Param1 = adjacency_list >; P = iterator_property_map<__gnu_cxx::__normal_iterator >, adj_list_vertex_property_map >, int, int&, vertex_index_t>, void*, void*&>; T = vertex_isomorphism_t; R = no_property; typename result_of(Param0, Param1, const typename detail::convert_bgl_params_to_boost_parameter >::type&)>::type = bool; typename detail::convert_bgl_params_to_boost_parameter >::type = parameter::aux::arg_list >, adj_list_vertex_property_map >, int, int&, vertex_index_t>, void*, void*&> >, parameter::aux::empty_arg_list, std::integral_constant >]’ ordering.cpp:68:18: required from here /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:65:52: warning: ‘this’ pointer is null [-Wnonnull] 65 | static void failed() { ((Model*)0)->constraints(); } | ~~~~~~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/depth_first_search.hpp:39:10: note: in a call to non-static member function ‘void boost::DFSVisitorConcept::constraints() [with Visitor = boost::detail::isomorphism_algo >, boost::adjacency_list >, boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&>, boost::degree_vertex_invariant >, int, const int&, boost::vertex_index_t> >, boost::adjacency_list > >, boost::degree_vertex_invariant >, int, const int&, boost::vertex_index_t> >, boost::adjacency_list > >, boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>, boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t> >::record_dfs_order; Graph = boost::adjacency_list >]’ 39 | void constraints() | ^~~~~~~~~~~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::constraint::failed() [with Model = boost::ReadWritePropertyMapConcept >, boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>, boost::default_color_type, boost::default_color_type&>, void*>]’: /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/depth_first_search.hpp:134:9: required from ‘void boost::detail::depth_first_visit_impl(const IncidenceGraph&, typename boost::graph_traits::vertex_descriptor, DFSVisitor&, ColorMap, TerminatorFunc) [with IncidenceGraph = boost::adjacency_list >; DFSVisitor = isomorphism_algo >, boost::adjacency_list >, boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&>, boost::degree_vertex_invariant >, int, const int&, boost::vertex_index_t> >, boost::adjacency_list > >, boost::degree_vertex_invariant >, int, const int&, boost::vertex_index_t> >, boost::adjacency_list > >, boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>, boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t> >::record_dfs_order; ColorMap = boost::safe_iterator_property_map<__gnu_cxx::__normal_iterator >, boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>, boost::default_color_type, boost::default_color_type&>; TerminatorFunc = nontruth2; typename boost::graph_traits::vertex_descriptor = void*]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/depth_first_search.hpp:417:35: required from ‘void boost::depth_first_visit(const IncidenceGraph&, typename graph_traits::vertex_descriptor, DFSVisitor, ColorMap) [with IncidenceGraph = adjacency_list >; DFSVisitor = detail::isomorphism_algo >, adjacency_list >, iterator_property_map<__gnu_cxx::__normal_iterator >, adj_list_vertex_property_map >, int, int&, vertex_index_t>, void*, void*&>, degree_vertex_invariant >, int, const int&, vertex_index_t> >, adjacency_list > >, degree_vertex_invariant >, int, const int&, vertex_index_t> >, adjacency_list > >, adj_list_vertex_property_map >, int, const int&, vertex_index_t>, adj_list_vertex_property_map >, int, const int&, vertex_index_t> >::record_dfs_order; ColorMap = safe_iterator_property_map<__gnu_cxx::__normal_iterator >, adj_list_vertex_property_map >, int, const int&, vertex_index_t>, default_color_type, default_color_type&>; typename graph_traits::vertex_descriptor = void*]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/isomorphism.hpp:209:38: required from ‘bool boost::detail::isomorphism_algo::test_isomorphism() [with Graph1 = boost::adjacency_list >; Graph2 = boost::adjacency_list >; IsoMapping = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&>; Invariant1 = boost::degree_vertex_invariant >, int, const int&, boost::vertex_index_t> >, boost::adjacency_list > >; Invariant2 = boost::degree_vertex_invariant >, int, const int&, boost::vertex_index_t> >, boost::adjacency_list > >; IndexMap1 = boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>; IndexMap2 = boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/isomorphism.hpp:532:33: required from ‘bool boost::isomorphism(const Graph1&, const Graph2&, IsoMapping, Invariant1, Invariant2, std::size_t, IndexMap1, IndexMap2) [with Graph1 = adjacency_list >; Graph2 = adjacency_list >; IsoMapping = iterator_property_map<__gnu_cxx::__normal_iterator >, adj_list_vertex_property_map >, int, int&, vertex_index_t>, void*, void*&>; Invariant1 = degree_vertex_invariant >, int, const int&, vertex_index_t> >, adjacency_list > >; Invariant2 = degree_vertex_invariant >, int, const int&, vertex_index_t> >, adjacency_list > >; IndexMap1 = adj_list_vertex_property_map >, int, const int&, vertex_index_t>; IndexMap2 = adj_list_vertex_property_map >, int, const int&, vertex_index_t>; std::size_t = long unsigned int]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/isomorphism.hpp:651:42: required from ‘bool boost::graph::detail::isomorphism_impl::operator()(const Graph1&, const Graph2&, const ArgPack&) const [with ArgPack = boost::parameter::aux::arg_list >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&> >, boost::parameter::aux::empty_arg_list, std::integral_constant >; Graph1 = boost::adjacency_list >; Graph2 = boost::adjacency_list >]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/isomorphism.hpp:662:5: required from ‘typename boost::result_of(Param0, Param1, const ArgPack&)>::type boost::graph::isomorphism_with_named_params(const Param0&, const Param1&, const ArgPack&) [with Param0 = boost::adjacency_list >; Param1 = boost::adjacency_list >; ArgPack = boost::parameter::aux::arg_list >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&> >, boost::parameter::aux::empty_arg_list, std::integral_constant >; typename boost::result_of(Param0, Param1, const ArgPack&)>::type = bool]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/isomorphism.hpp:666:1: required from ‘typename boost::result_of(Param0, Param1, const typename boost::detail::convert_bgl_params_to_boost_parameter >::type&)>::type boost::isomorphism(const Param0&, const Param1&, const bgl_named_params&) [with Param0 = adjacency_list >; Param1 = adjacency_list >; P = iterator_property_map<__gnu_cxx::__normal_iterator >, adj_list_vertex_property_map >, int, int&, vertex_index_t>, void*, void*&>; T = vertex_isomorphism_t; R = no_property; typename result_of(Param0, Param1, const typename detail::convert_bgl_params_to_boost_parameter >::type&)>::type = bool; typename detail::convert_bgl_params_to_boost_parameter >::type = parameter::aux::arg_list >, adj_list_vertex_property_map >, int, int&, vertex_index_t>, void*, void*&> >, parameter::aux::empty_arg_list, std::integral_constant >]’ ordering.cpp:68:18: required from here /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:65:52: warning: ‘this’ pointer is null [-Wnonnull] 65 | static void failed() { ((Model*)0)->constraints(); } | ~~~~~~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/property_map/property_map.hpp:205:10: note: in a call to non-static member function ‘void boost::ReadWritePropertyMapConcept::constraints() [with PMap = boost::safe_iterator_property_map<__gnu_cxx::__normal_iterator >, boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>, boost::default_color_type, boost::default_color_type&>; Key = void*]’ 205 | void constraints() { | ^~~~~~~~~~~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::Assignable<__gnu_cxx::__normal_iterator > >]’: /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements > > >]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:145:5: required from ‘struct boost::Assignable<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:502:3: required from ‘struct boost::InputIterator<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:540:3: required from ‘struct boost::ForwardIterator<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:568:3: required from ‘struct boost::BidirectionalIterator<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:597:3: [ skipping 7 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/isomorphism.hpp:214:54: required from ‘bool boost::detail::isomorphism_algo::test_isomorphism() [with Graph1 = boost::adjacency_list >; Graph2 = boost::adjacency_list >; IsoMapping = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&>; Invariant1 = boost::degree_vertex_invariant >, int, const int&, boost::vertex_index_t> >, boost::adjacency_list > >; Invariant2 = boost::degree_vertex_invariant >, int, const int&, boost::vertex_index_t> >, boost::adjacency_list > >; IndexMap1 = boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>; IndexMap2 = boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/isomorphism.hpp:532:33: required from ‘bool boost::isomorphism(const Graph1&, const Graph2&, IsoMapping, Invariant1, Invariant2, std::size_t, IndexMap1, IndexMap2) [with Graph1 = adjacency_list >; Graph2 = adjacency_list >; IsoMapping = iterator_property_map<__gnu_cxx::__normal_iterator >, adj_list_vertex_property_map >, int, int&, vertex_index_t>, void*, void*&>; Invariant1 = degree_vertex_invariant >, int, const int&, vertex_index_t> >, adjacency_list > >; Invariant2 = degree_vertex_invariant >, int, const int&, vertex_index_t> >, adjacency_list > >; IndexMap1 = adj_list_vertex_property_map >, int, const int&, vertex_index_t>; IndexMap2 = adj_list_vertex_property_map >, int, const int&, vertex_index_t>; std::size_t = long unsigned int]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/isomorphism.hpp:651:42: required from ‘bool boost::graph::detail::isomorphism_impl::operator()(const Graph1&, const Graph2&, const ArgPack&) const [with ArgPack = boost::parameter::aux::arg_list >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&> >, boost::parameter::aux::empty_arg_list, std::integral_constant >; Graph1 = boost::adjacency_list >; Graph2 = boost::adjacency_list >]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/isomorphism.hpp:662:5: required from ‘typename boost::result_of(Param0, Param1, const ArgPack&)>::type boost::graph::isomorphism_with_named_params(const Param0&, const Param1&, const ArgPack&) [with Param0 = boost::adjacency_list >; Param1 = boost::adjacency_list >; ArgPack = boost::parameter::aux::arg_list >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&> >, boost::parameter::aux::empty_arg_list, std::integral_constant >; typename boost::result_of(Param0, Param1, const ArgPack&)>::type = bool]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/isomorphism.hpp:666:1: required from ‘typename boost::result_of(Param0, Param1, const typename boost::detail::convert_bgl_params_to_boost_parameter >::type&)>::type boost::isomorphism(const Param0&, const Param1&, const bgl_named_params&) [with Param0 = adjacency_list >; Param1 = adjacency_list >; P = iterator_property_map<__gnu_cxx::__normal_iterator >, adj_list_vertex_property_map >, int, int&, vertex_index_t>, void*, void*&>; T = vertex_isomorphism_t; R = no_property; typename result_of(Param0, Param1, const typename detail::convert_bgl_params_to_boost_parameter >::type&)>::type = bool; typename detail::convert_bgl_params_to_boost_parameter >::type = parameter::aux::arg_list >, adj_list_vertex_property_map >, int, int&, vertex_index_t>, void*, void*&> >, parameter::aux::empty_arg_list, std::integral_constant >]’ ordering.cpp:68:18: required from here /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::Assignable::~Assignable() [with TT = __gnu_cxx::__normal_iterator >]’ 37 | ~model() | ^ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:145:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 145 | BOOST_CONCEPT_USAGE(Assignable) { | ^~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::EqualityComparable<__gnu_cxx::__normal_iterator > >]’: /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements > > >]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:233:5: required from ‘struct boost::EqualityComparable<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:502:3: required from ‘struct boost::InputIterator<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:540:3: required from ‘struct boost::ForwardIterator<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:568:3: required from ‘struct boost::BidirectionalIterator<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:597:3: [ skipping 7 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/isomorphism.hpp:214:54: required from ‘bool boost::detail::isomorphism_algo::test_isomorphism() [with Graph1 = boost::adjacency_list >; Graph2 = boost::adjacency_list >; IsoMapping = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&>; Invariant1 = boost::degree_vertex_invariant >, int, const int&, boost::vertex_index_t> >, boost::adjacency_list > >; Invariant2 = boost::degree_vertex_invariant >, int, const int&, boost::vertex_index_t> >, boost::adjacency_list > >; IndexMap1 = boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>; IndexMap2 = boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/isomorphism.hpp:532:33: required from ‘bool boost::isomorphism(const Graph1&, const Graph2&, IsoMapping, Invariant1, Invariant2, std::size_t, IndexMap1, IndexMap2) [with Graph1 = adjacency_list >; Graph2 = adjacency_list >; IsoMapping = iterator_property_map<__gnu_cxx::__normal_iterator >, adj_list_vertex_property_map >, int, int&, vertex_index_t>, void*, void*&>; Invariant1 = degree_vertex_invariant >, int, const int&, vertex_index_t> >, adjacency_list > >; Invariant2 = degree_vertex_invariant >, int, const int&, vertex_index_t> >, adjacency_list > >; IndexMap1 = adj_list_vertex_property_map >, int, const int&, vertex_index_t>; IndexMap2 = adj_list_vertex_property_map >, int, const int&, vertex_index_t>; std::size_t = long unsigned int]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/isomorphism.hpp:651:42: required from ‘bool boost::graph::detail::isomorphism_impl::operator()(const Graph1&, const Graph2&, const ArgPack&) const [with ArgPack = boost::parameter::aux::arg_list >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&> >, boost::parameter::aux::empty_arg_list, std::integral_constant >; Graph1 = boost::adjacency_list >; Graph2 = boost::adjacency_list >]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/isomorphism.hpp:662:5: required from ‘typename boost::result_of(Param0, Param1, const ArgPack&)>::type boost::graph::isomorphism_with_named_params(const Param0&, const Param1&, const ArgPack&) [with Param0 = boost::adjacency_list >; Param1 = boost::adjacency_list >; ArgPack = boost::parameter::aux::arg_list >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&> >, boost::parameter::aux::empty_arg_list, std::integral_constant >; typename boost::result_of(Param0, Param1, const ArgPack&)>::type = bool]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/isomorphism.hpp:666:1: required from ‘typename boost::result_of(Param0, Param1, const typename boost::detail::convert_bgl_params_to_boost_parameter >::type&)>::type boost::isomorphism(const Param0&, const Param1&, const bgl_named_params&) [with Param0 = adjacency_list >; Param1 = adjacency_list >; P = iterator_property_map<__gnu_cxx::__normal_iterator >, adj_list_vertex_property_map >, int, int&, vertex_index_t>, void*, void*&>; T = vertex_isomorphism_t; R = no_property; typename result_of(Param0, Param1, const typename detail::convert_bgl_params_to_boost_parameter >::type&)>::type = bool; typename detail::convert_bgl_params_to_boost_parameter >::type = parameter::aux::arg_list >, adj_list_vertex_property_map >, int, int&, vertex_index_t>, void*, void*&> >, parameter::aux::empty_arg_list, std::integral_constant >]’ ordering.cpp:68:18: required from here /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::EqualityComparable::~EqualityComparable() [with TT = __gnu_cxx::__normal_iterator >]’ 37 | ~model() | ^ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:233:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 233 | BOOST_CONCEPT_USAGE(EqualityComparable) { | ^~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::InputIterator<__gnu_cxx::__normal_iterator > >]’: /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements > > >]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:512:7: required from ‘struct boost::InputIterator<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:540:3: required from ‘struct boost::ForwardIterator<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:568:3: required from ‘struct boost::BidirectionalIterator<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:597:3: required from ‘struct boost::RandomAccessIterator<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:597:3: [ skipping 6 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/isomorphism.hpp:214:54: required from ‘bool boost::detail::isomorphism_algo::test_isomorphism() [with Graph1 = boost::adjacency_list >; Graph2 = boost::adjacency_list >; IsoMapping = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&>; Invariant1 = boost::degree_vertex_invariant >, int, const int&, boost::vertex_index_t> >, boost::adjacency_list > >; Invariant2 = boost::degree_vertex_invariant >, int, const int&, boost::vertex_index_t> >, boost::adjacency_list > >; IndexMap1 = boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>; IndexMap2 = boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/isomorphism.hpp:532:33: required from ‘bool boost::isomorphism(const Graph1&, const Graph2&, IsoMapping, Invariant1, Invariant2, std::size_t, IndexMap1, IndexMap2) [with Graph1 = adjacency_list >; Graph2 = adjacency_list >; IsoMapping = iterator_property_map<__gnu_cxx::__normal_iterator >, adj_list_vertex_property_map >, int, int&, vertex_index_t>, void*, void*&>; Invariant1 = degree_vertex_invariant >, int, const int&, vertex_index_t> >, adjacency_list > >; Invariant2 = degree_vertex_invariant >, int, const int&, vertex_index_t> >, adjacency_list > >; IndexMap1 = adj_list_vertex_property_map >, int, const int&, vertex_index_t>; IndexMap2 = adj_list_vertex_property_map >, int, const int&, vertex_index_t>; std::size_t = long unsigned int]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/isomorphism.hpp:651:42: required from ‘bool boost::graph::detail::isomorphism_impl::operator()(const Graph1&, const Graph2&, const ArgPack&) const [with ArgPack = boost::parameter::aux::arg_list >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&> >, boost::parameter::aux::empty_arg_list, std::integral_constant >; Graph1 = boost::adjacency_list >; Graph2 = boost::adjacency_list >]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/isomorphism.hpp:662:5: required from ‘typename boost::result_of(Param0, Param1, const ArgPack&)>::type boost::graph::isomorphism_with_named_params(const Param0&, const Param1&, const ArgPack&) [with Param0 = boost::adjacency_list >; Param1 = boost::adjacency_list >; ArgPack = boost::parameter::aux::arg_list >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&> >, boost::parameter::aux::empty_arg_list, std::integral_constant >; typename boost::result_of(Param0, Param1, const ArgPack&)>::type = bool]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/isomorphism.hpp:666:1: required from ‘typename boost::result_of(Param0, Param1, const typename boost::detail::convert_bgl_params_to_boost_parameter >::type&)>::type boost::isomorphism(const Param0&, const Param1&, const bgl_named_params&) [with Param0 = adjacency_list >; Param1 = adjacency_list >; P = iterator_property_map<__gnu_cxx::__normal_iterator >, adj_list_vertex_property_map >, int, int&, vertex_index_t>, void*, void*&>; T = vertex_isomorphism_t; R = no_property; typename result_of(Param0, Param1, const typename detail::convert_bgl_params_to_boost_parameter >::type&)>::type = bool; typename detail::convert_bgl_params_to_boost_parameter >::type = parameter::aux::arg_list >, adj_list_vertex_property_map >, int, int&, vertex_index_t>, void*, void*&> >, parameter::aux::empty_arg_list, std::integral_constant >]’ ordering.cpp:68:18: required from here /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::InputIterator::~InputIterator() [with TT = __gnu_cxx::__normal_iterator >]’ 37 | ~model() | ^ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:512:7: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 512 | BOOST_CONCEPT_USAGE(InputIterator) | ^~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::ForwardIterator<__gnu_cxx::__normal_iterator > >]’: /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements > > >]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:543:7: required from ‘struct boost::ForwardIterator<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:568:3: required from ‘struct boost::BidirectionalIterator<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:597:3: required from ‘struct boost::RandomAccessIterator<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:597:3: required from ‘struct boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:32:62: [ skipping 5 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/isomorphism.hpp:214:54: required from ‘bool boost::detail::isomorphism_algo::test_isomorphism() [with Graph1 = boost::adjacency_list >; Graph2 = boost::adjacency_list >; IsoMapping = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&>; Invariant1 = boost::degree_vertex_invariant >, int, const int&, boost::vertex_index_t> >, boost::adjacency_list > >; Invariant2 = boost::degree_vertex_invariant >, int, const int&, boost::vertex_index_t> >, boost::adjacency_list > >; IndexMap1 = boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>; IndexMap2 = boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/isomorphism.hpp:532:33: required from ‘bool boost::isomorphism(const Graph1&, const Graph2&, IsoMapping, Invariant1, Invariant2, std::size_t, IndexMap1, IndexMap2) [with Graph1 = adjacency_list >; Graph2 = adjacency_list >; IsoMapping = iterator_property_map<__gnu_cxx::__normal_iterator >, adj_list_vertex_property_map >, int, int&, vertex_index_t>, void*, void*&>; Invariant1 = degree_vertex_invariant >, int, const int&, vertex_index_t> >, adjacency_list > >; Invariant2 = degree_vertex_invariant >, int, const int&, vertex_index_t> >, adjacency_list > >; IndexMap1 = adj_list_vertex_property_map >, int, const int&, vertex_index_t>; IndexMap2 = adj_list_vertex_property_map >, int, const int&, vertex_index_t>; std::size_t = long unsigned int]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/isomorphism.hpp:651:42: required from ‘bool boost::graph::detail::isomorphism_impl::operator()(const Graph1&, const Graph2&, const ArgPack&) const [with ArgPack = boost::parameter::aux::arg_list >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&> >, boost::parameter::aux::empty_arg_list, std::integral_constant >; Graph1 = boost::adjacency_list >; Graph2 = boost::adjacency_list >]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/isomorphism.hpp:662:5: required from ‘typename boost::result_of(Param0, Param1, const ArgPack&)>::type boost::graph::isomorphism_with_named_params(const Param0&, const Param1&, const ArgPack&) [with Param0 = boost::adjacency_list >; Param1 = boost::adjacency_list >; ArgPack = boost::parameter::aux::arg_list >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&> >, boost::parameter::aux::empty_arg_list, std::integral_constant >; typename boost::result_of(Param0, Param1, const ArgPack&)>::type = bool]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/isomorphism.hpp:666:1: required from ‘typename boost::result_of(Param0, Param1, const typename boost::detail::convert_bgl_params_to_boost_parameter >::type&)>::type boost::isomorphism(const Param0&, const Param1&, const bgl_named_params&) [with Param0 = adjacency_list >; Param1 = adjacency_list >; P = iterator_property_map<__gnu_cxx::__normal_iterator >, adj_list_vertex_property_map >, int, int&, vertex_index_t>, void*, void*&>; T = vertex_isomorphism_t; R = no_property; typename result_of(Param0, Param1, const typename detail::convert_bgl_params_to_boost_parameter >::type&)>::type = bool; typename detail::convert_bgl_params_to_boost_parameter >::type = parameter::aux::arg_list >, adj_list_vertex_property_map >, int, int&, vertex_index_t>, void*, void*&> >, parameter::aux::empty_arg_list, std::integral_constant >]’ ordering.cpp:68:18: required from here /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::ForwardIterator::~ForwardIterator() [with TT = __gnu_cxx::__normal_iterator >]’ 37 | ~model() | ^ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:543:7: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 543 | BOOST_CONCEPT_USAGE(ForwardIterator) | ^~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::BidirectionalIterator<__gnu_cxx::__normal_iterator > >]’: /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements > > >]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:571:7: required from ‘struct boost::BidirectionalIterator<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:597:3: required from ‘struct boost::RandomAccessIterator<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:597:3: required from ‘struct boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator > >]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:42:5: [ skipping 4 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/isomorphism.hpp:214:54: required from ‘bool boost::detail::isomorphism_algo::test_isomorphism() [with Graph1 = boost::adjacency_list >; Graph2 = boost::adjacency_list >; IsoMapping = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&>; Invariant1 = boost::degree_vertex_invariant >, int, const int&, boost::vertex_index_t> >, boost::adjacency_list > >; Invariant2 = boost::degree_vertex_invariant >, int, const int&, boost::vertex_index_t> >, boost::adjacency_list > >; IndexMap1 = boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>; IndexMap2 = boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/isomorphism.hpp:532:33: required from ‘bool boost::isomorphism(const Graph1&, const Graph2&, IsoMapping, Invariant1, Invariant2, std::size_t, IndexMap1, IndexMap2) [with Graph1 = adjacency_list >; Graph2 = adjacency_list >; IsoMapping = iterator_property_map<__gnu_cxx::__normal_iterator >, adj_list_vertex_property_map >, int, int&, vertex_index_t>, void*, void*&>; Invariant1 = degree_vertex_invariant >, int, const int&, vertex_index_t> >, adjacency_list > >; Invariant2 = degree_vertex_invariant >, int, const int&, vertex_index_t> >, adjacency_list > >; IndexMap1 = adj_list_vertex_property_map >, int, const int&, vertex_index_t>; IndexMap2 = adj_list_vertex_property_map >, int, const int&, vertex_index_t>; std::size_t = long unsigned int]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/isomorphism.hpp:651:42: required from ‘bool boost::graph::detail::isomorphism_impl::operator()(const Graph1&, const Graph2&, const ArgPack&) const [with ArgPack = boost::parameter::aux::arg_list >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&> >, boost::parameter::aux::empty_arg_list, std::integral_constant >; Graph1 = boost::adjacency_list >; Graph2 = boost::adjacency_list >]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/isomorphism.hpp:662:5: required from ‘typename boost::result_of(Param0, Param1, const ArgPack&)>::type boost::graph::isomorphism_with_named_params(const Param0&, const Param1&, const ArgPack&) [with Param0 = boost::adjacency_list >; Param1 = boost::adjacency_list >; ArgPack = boost::parameter::aux::arg_list >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&> >, boost::parameter::aux::empty_arg_list, std::integral_constant >; typename boost::result_of(Param0, Param1, const ArgPack&)>::type = bool]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/isomorphism.hpp:666:1: required from ‘typename boost::result_of(Param0, Param1, const typename boost::detail::convert_bgl_params_to_boost_parameter >::type&)>::type boost::isomorphism(const Param0&, const Param1&, const bgl_named_params&) [with Param0 = adjacency_list >; Param1 = adjacency_list >; P = iterator_property_map<__gnu_cxx::__normal_iterator >, adj_list_vertex_property_map >, int, int&, vertex_index_t>, void*, void*&>; T = vertex_isomorphism_t; R = no_property; typename result_of(Param0, Param1, const typename detail::convert_bgl_params_to_boost_parameter >::type&)>::type = bool; typename detail::convert_bgl_params_to_boost_parameter >::type = parameter::aux::arg_list >, adj_list_vertex_property_map >, int, int&, vertex_index_t>, void*, void*&> >, parameter::aux::empty_arg_list, std::integral_constant >]’ ordering.cpp:68:18: required from here /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::BidirectionalIterator::~BidirectionalIterator() [with TT = __gnu_cxx::__normal_iterator >]’ 37 | ~model() | ^ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:571:7: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 571 | BOOST_CONCEPT_USAGE(BidirectionalIterator) | ^~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::Comparable<__gnu_cxx::__normal_iterator > >]’: /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements > > >]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:253:5: required from ‘struct boost::Comparable<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:597:3: required from ‘struct boost::RandomAccessIterator<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:597:3: required from ‘struct boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator > >]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:42:5: [ skipping 4 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/isomorphism.hpp:214:54: required from ‘bool boost::detail::isomorphism_algo::test_isomorphism() [with Graph1 = boost::adjacency_list >; Graph2 = boost::adjacency_list >; IsoMapping = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&>; Invariant1 = boost::degree_vertex_invariant >, int, const int&, boost::vertex_index_t> >, boost::adjacency_list > >; Invariant2 = boost::degree_vertex_invariant >, int, const int&, boost::vertex_index_t> >, boost::adjacency_list > >; IndexMap1 = boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>; IndexMap2 = boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/isomorphism.hpp:532:33: required from ‘bool boost::isomorphism(const Graph1&, const Graph2&, IsoMapping, Invariant1, Invariant2, std::size_t, IndexMap1, IndexMap2) [with Graph1 = adjacency_list >; Graph2 = adjacency_list >; IsoMapping = iterator_property_map<__gnu_cxx::__normal_iterator >, adj_list_vertex_property_map >, int, int&, vertex_index_t>, void*, void*&>; Invariant1 = degree_vertex_invariant >, int, const int&, vertex_index_t> >, adjacency_list > >; Invariant2 = degree_vertex_invariant >, int, const int&, vertex_index_t> >, adjacency_list > >; IndexMap1 = adj_list_vertex_property_map >, int, const int&, vertex_index_t>; IndexMap2 = adj_list_vertex_property_map >, int, const int&, vertex_index_t>; std::size_t = long unsigned int]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/isomorphism.hpp:651:42: required from ‘bool boost::graph::detail::isomorphism_impl::operator()(const Graph1&, const Graph2&, const ArgPack&) const [with ArgPack = boost::parameter::aux::arg_list >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&> >, boost::parameter::aux::empty_arg_list, std::integral_constant >; Graph1 = boost::adjacency_list >; Graph2 = boost::adjacency_list >]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/isomorphism.hpp:662:5: required from ‘typename boost::result_of(Param0, Param1, const ArgPack&)>::type boost::graph::isomorphism_with_named_params(const Param0&, const Param1&, const ArgPack&) [with Param0 = boost::adjacency_list >; Param1 = boost::adjacency_list >; ArgPack = boost::parameter::aux::arg_list >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&> >, boost::parameter::aux::empty_arg_list, std::integral_constant >; typename boost::result_of(Param0, Param1, const ArgPack&)>::type = bool]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/isomorphism.hpp:666:1: required from ‘typename boost::result_of(Param0, Param1, const typename boost::detail::convert_bgl_params_to_boost_parameter >::type&)>::type boost::isomorphism(const Param0&, const Param1&, const bgl_named_params&) [with Param0 = adjacency_list >; Param1 = adjacency_list >; P = iterator_property_map<__gnu_cxx::__normal_iterator >, adj_list_vertex_property_map >, int, int&, vertex_index_t>, void*, void*&>; T = vertex_isomorphism_t; R = no_property; typename result_of(Param0, Param1, const typename detail::convert_bgl_params_to_boost_parameter >::type&)>::type = bool; typename detail::convert_bgl_params_to_boost_parameter >::type = parameter::aux::arg_list >, adj_list_vertex_property_map >, int, int&, vertex_index_t>, void*, void*&> >, parameter::aux::empty_arg_list, std::integral_constant >]’ ordering.cpp:68:18: required from here /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::Comparable::~Comparable() [with TT = __gnu_cxx::__normal_iterator >]’ 37 | ~model() | ^ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:253:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 253 | BOOST_CONCEPT_USAGE(Comparable) { | ^~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::RandomAccessIterator<__gnu_cxx::__normal_iterator > >]’: /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements > > >]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:601:7: required from ‘struct boost::RandomAccessIterator<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:597:3: required from ‘struct boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator > >]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied > > >::value’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:45:51: [ skipping 3 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/isomorphism.hpp:214:54: required from ‘bool boost::detail::isomorphism_algo::test_isomorphism() [with Graph1 = boost::adjacency_list >; Graph2 = boost::adjacency_list >; IsoMapping = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&>; Invariant1 = boost::degree_vertex_invariant >, int, const int&, boost::vertex_index_t> >, boost::adjacency_list > >; Invariant2 = boost::degree_vertex_invariant >, int, const int&, boost::vertex_index_t> >, boost::adjacency_list > >; IndexMap1 = boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>; IndexMap2 = boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/isomorphism.hpp:532:33: required from ‘bool boost::isomorphism(const Graph1&, const Graph2&, IsoMapping, Invariant1, Invariant2, std::size_t, IndexMap1, IndexMap2) [with Graph1 = adjacency_list >; Graph2 = adjacency_list >; IsoMapping = iterator_property_map<__gnu_cxx::__normal_iterator >, adj_list_vertex_property_map >, int, int&, vertex_index_t>, void*, void*&>; Invariant1 = degree_vertex_invariant >, int, const int&, vertex_index_t> >, adjacency_list > >; Invariant2 = degree_vertex_invariant >, int, const int&, vertex_index_t> >, adjacency_list > >; IndexMap1 = adj_list_vertex_property_map >, int, const int&, vertex_index_t>; IndexMap2 = adj_list_vertex_property_map >, int, const int&, vertex_index_t>; std::size_t = long unsigned int]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/isomorphism.hpp:651:42: required from ‘bool boost::graph::detail::isomorphism_impl::operator()(const Graph1&, const Graph2&, const ArgPack&) const [with ArgPack = boost::parameter::aux::arg_list >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&> >, boost::parameter::aux::empty_arg_list, std::integral_constant >; Graph1 = boost::adjacency_list >; Graph2 = boost::adjacency_list >]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/isomorphism.hpp:662:5: required from ‘typename boost::result_of(Param0, Param1, const ArgPack&)>::type boost::graph::isomorphism_with_named_params(const Param0&, const Param1&, const ArgPack&) [with Param0 = boost::adjacency_list >; Param1 = boost::adjacency_list >; ArgPack = boost::parameter::aux::arg_list >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&> >, boost::parameter::aux::empty_arg_list, std::integral_constant >; typename boost::result_of(Param0, Param1, const ArgPack&)>::type = bool]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/isomorphism.hpp:666:1: required from ‘typename boost::result_of(Param0, Param1, const typename boost::detail::convert_bgl_params_to_boost_parameter >::type&)>::type boost::isomorphism(const Param0&, const Param1&, const bgl_named_params&) [with Param0 = adjacency_list >; Param1 = adjacency_list >; P = iterator_property_map<__gnu_cxx::__normal_iterator >, adj_list_vertex_property_map >, int, int&, vertex_index_t>, void*, void*&>; T = vertex_isomorphism_t; R = no_property; typename result_of(Param0, Param1, const typename detail::convert_bgl_params_to_boost_parameter >::type&)>::type = bool; typename detail::convert_bgl_params_to_boost_parameter >::type = parameter::aux::arg_list >, adj_list_vertex_property_map >, int, int&, vertex_index_t>, void*, void*&> >, parameter::aux::empty_arg_list, std::integral_constant >]’ ordering.cpp:68:18: required from here /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::RandomAccessIterator::~RandomAccessIterator() [with TT = __gnu_cxx::__normal_iterator >]’ 37 | ~model() | ^ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:601:7: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 601 | BOOST_CONCEPT_USAGE(RandomAccessIterator) | ^~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::CopyConstructible<__gnu_cxx::__normal_iterator*, std::vector, std::allocator > > > >]’: /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements*, std::vector, std::allocator > > > > >]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:167:5: required from ‘struct boost::CopyConstructible<__gnu_cxx::__normal_iterator*, std::vector, std::allocator > > > >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/range/concepts.hpp:125:16: required from ‘struct boost::range_detail::IncrementableIteratorConcept<__gnu_cxx::__normal_iterator*, std::vector, std::allocator > > > >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/range/concepts.hpp:147:16: required from ‘struct boost::range_detail::SinglePassIteratorConcept<__gnu_cxx::__normal_iterator*, std::vector, std::allocator > > > >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::range_detail::SinglePassIteratorConcept<__gnu_cxx::__normal_iterator*, std::vector, std::allocator > > > >]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:42:5: [ skipping 12 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/isomorphism.hpp:226:17: required from ‘bool boost::detail::isomorphism_algo::test_isomorphism() [with Graph1 = boost::adjacency_list >; Graph2 = boost::adjacency_list >; IsoMapping = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&>; Invariant1 = boost::degree_vertex_invariant >, int, const int&, boost::vertex_index_t> >, boost::adjacency_list > >; Invariant2 = boost::degree_vertex_invariant >, int, const int&, boost::vertex_index_t> >, boost::adjacency_list > >; IndexMap1 = boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>; IndexMap2 = boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/isomorphism.hpp:532:33: required from ‘bool boost::isomorphism(const Graph1&, const Graph2&, IsoMapping, Invariant1, Invariant2, std::size_t, IndexMap1, IndexMap2) [with Graph1 = adjacency_list >; Graph2 = adjacency_list >; IsoMapping = iterator_property_map<__gnu_cxx::__normal_iterator >, adj_list_vertex_property_map >, int, int&, vertex_index_t>, void*, void*&>; Invariant1 = degree_vertex_invariant >, int, const int&, vertex_index_t> >, adjacency_list > >; Invariant2 = degree_vertex_invariant >, int, const int&, vertex_index_t> >, adjacency_list > >; IndexMap1 = adj_list_vertex_property_map >, int, const int&, vertex_index_t>; IndexMap2 = adj_list_vertex_property_map >, int, const int&, vertex_index_t>; std::size_t = long unsigned int]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/isomorphism.hpp:651:42: required from ‘bool boost::graph::detail::isomorphism_impl::operator()(const Graph1&, const Graph2&, const ArgPack&) const [with ArgPack = boost::parameter::aux::arg_list >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&> >, boost::parameter::aux::empty_arg_list, std::integral_constant >; Graph1 = boost::adjacency_list >; Graph2 = boost::adjacency_list >]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/isomorphism.hpp:662:5: required from ‘typename boost::result_of(Param0, Param1, const ArgPack&)>::type boost::graph::isomorphism_with_named_params(const Param0&, const Param1&, const ArgPack&) [with Param0 = boost::adjacency_list >; Param1 = boost::adjacency_list >; ArgPack = boost::parameter::aux::arg_list >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&> >, boost::parameter::aux::empty_arg_list, std::integral_constant >; typename boost::result_of(Param0, Param1, const ArgPack&)>::type = bool]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/isomorphism.hpp:666:1: required from ‘typename boost::result_of(Param0, Param1, const typename boost::detail::convert_bgl_params_to_boost_parameter >::type&)>::type boost::isomorphism(const Param0&, const Param1&, const bgl_named_params&) [with Param0 = adjacency_list >; Param1 = adjacency_list >; P = iterator_property_map<__gnu_cxx::__normal_iterator >, adj_list_vertex_property_map >, int, int&, vertex_index_t>, void*, void*&>; T = vertex_isomorphism_t; R = no_property; typename result_of(Param0, Param1, const typename detail::convert_bgl_params_to_boost_parameter >::type&)>::type = bool; typename detail::convert_bgl_params_to_boost_parameter >::type = parameter::aux::arg_list >, adj_list_vertex_property_map >, int, int&, vertex_index_t>, void*, void*&> >, parameter::aux::empty_arg_list, std::integral_constant >]’ ordering.cpp:68:18: required from here /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::CopyConstructible::~CopyConstructible() [with TT = __gnu_cxx::__normal_iterator*, std::vector, std::allocator > > >]’ 37 | ~model() | ^ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:167:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 167 | BOOST_CONCEPT_USAGE(CopyConstructible) { | ^~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::range_detail::IncrementableIteratorConcept<__gnu_cxx::__normal_iterator*, std::vector, std::allocator > > > >]’: /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements*, std::vector, std::allocator > > > > >]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/range/concepts.hpp:136:13: required from ‘struct boost::range_detail::IncrementableIteratorConcept<__gnu_cxx::__normal_iterator*, std::vector, std::allocator > > > >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/range/concepts.hpp:147:16: required from ‘struct boost::range_detail::SinglePassIteratorConcept<__gnu_cxx::__normal_iterator*, std::vector, std::allocator > > > >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::range_detail::SinglePassIteratorConcept<__gnu_cxx::__normal_iterator*, std::vector, std::allocator > > > >]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied*, std::vector, std::allocator > > > > >::value’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:45:51: [ skipping 11 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/isomorphism.hpp:226:17: required from ‘bool boost::detail::isomorphism_algo::test_isomorphism() [with Graph1 = boost::adjacency_list >; Graph2 = boost::adjacency_list >; IsoMapping = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&>; Invariant1 = boost::degree_vertex_invariant >, int, const int&, boost::vertex_index_t> >, boost::adjacency_list > >; Invariant2 = boost::degree_vertex_invariant >, int, const int&, boost::vertex_index_t> >, boost::adjacency_list > >; IndexMap1 = boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>; IndexMap2 = boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/isomorphism.hpp:532:33: required from ‘bool boost::isomorphism(const Graph1&, const Graph2&, IsoMapping, Invariant1, Invariant2, std::size_t, IndexMap1, IndexMap2) [with Graph1 = adjacency_list >; Graph2 = adjacency_list >; IsoMapping = iterator_property_map<__gnu_cxx::__normal_iterator >, adj_list_vertex_property_map >, int, int&, vertex_index_t>, void*, void*&>; Invariant1 = degree_vertex_invariant >, int, const int&, vertex_index_t> >, adjacency_list > >; Invariant2 = degree_vertex_invariant >, int, const int&, vertex_index_t> >, adjacency_list > >; IndexMap1 = adj_list_vertex_property_map >, int, const int&, vertex_index_t>; IndexMap2 = adj_list_vertex_property_map >, int, const int&, vertex_index_t>; std::size_t = long unsigned int]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/isomorphism.hpp:651:42: required from ‘bool boost::graph::detail::isomorphism_impl::operator()(const Graph1&, const Graph2&, const ArgPack&) const [with ArgPack = boost::parameter::aux::arg_list >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&> >, boost::parameter::aux::empty_arg_list, std::integral_constant >; Graph1 = boost::adjacency_list >; Graph2 = boost::adjacency_list >]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/isomorphism.hpp:662:5: required from ‘typename boost::result_of(Param0, Param1, const ArgPack&)>::type boost::graph::isomorphism_with_named_params(const Param0&, const Param1&, const ArgPack&) [with Param0 = boost::adjacency_list >; Param1 = boost::adjacency_list >; ArgPack = boost::parameter::aux::arg_list >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&> >, boost::parameter::aux::empty_arg_list, std::integral_constant >; typename boost::result_of(Param0, Param1, const ArgPack&)>::type = bool]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/isomorphism.hpp:666:1: required from ‘typename boost::result_of(Param0, Param1, const typename boost::detail::convert_bgl_params_to_boost_parameter >::type&)>::type boost::isomorphism(const Param0&, const Param1&, const bgl_named_params&) [with Param0 = adjacency_list >; Param1 = adjacency_list >; P = iterator_property_map<__gnu_cxx::__normal_iterator >, adj_list_vertex_property_map >, int, int&, vertex_index_t>, void*, void*&>; T = vertex_isomorphism_t; R = no_property; typename result_of(Param0, Param1, const typename detail::convert_bgl_params_to_boost_parameter >::type&)>::type = bool; typename detail::convert_bgl_params_to_boost_parameter >::type = parameter::aux::arg_list >, adj_list_vertex_property_map >, int, int&, vertex_index_t>, void*, void*&> >, parameter::aux::empty_arg_list, std::integral_constant >]’ ordering.cpp:68:18: required from here /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::range_detail::IncrementableIteratorConcept::~IncrementableIteratorConcept() [with Iterator = __gnu_cxx::__normal_iterator*, std::vector, std::allocator > > >]’ 37 | ~model() | ^ /home/omnipath/local/R/4.4-3.20/BH/include/boost/range/concepts.hpp:136:13: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 136 | BOOST_CONCEPT_USAGE(IncrementableIteratorConcept) | ^~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::EqualityComparable<__gnu_cxx::__normal_iterator*, std::vector, std::allocator > > > >]’: /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements*, std::vector, std::allocator > > > > >]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:233:5: required from ‘struct boost::EqualityComparable<__gnu_cxx::__normal_iterator*, std::vector, std::allocator > > > >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/range/concepts.hpp:147:16: required from ‘struct boost::range_detail::SinglePassIteratorConcept<__gnu_cxx::__normal_iterator*, std::vector, std::allocator > > > >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::range_detail::SinglePassIteratorConcept<__gnu_cxx::__normal_iterator*, std::vector, std::allocator > > > >]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied*, std::vector, std::allocator > > > > >::value’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:45:51: [ skipping 11 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/isomorphism.hpp:226:17: required from ‘bool boost::detail::isomorphism_algo::test_isomorphism() [with Graph1 = boost::adjacency_list >; Graph2 = boost::adjacency_list >; IsoMapping = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&>; Invariant1 = boost::degree_vertex_invariant >, int, const int&, boost::vertex_index_t> >, boost::adjacency_list > >; Invariant2 = boost::degree_vertex_invariant >, int, const int&, boost::vertex_index_t> >, boost::adjacency_list > >; IndexMap1 = boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>; IndexMap2 = boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/isomorphism.hpp:532:33: required from ‘bool boost::isomorphism(const Graph1&, const Graph2&, IsoMapping, Invariant1, Invariant2, std::size_t, IndexMap1, IndexMap2) [with Graph1 = adjacency_list >; Graph2 = adjacency_list >; IsoMapping = iterator_property_map<__gnu_cxx::__normal_iterator >, adj_list_vertex_property_map >, int, int&, vertex_index_t>, void*, void*&>; Invariant1 = degree_vertex_invariant >, int, const int&, vertex_index_t> >, adjacency_list > >; Invariant2 = degree_vertex_invariant >, int, const int&, vertex_index_t> >, adjacency_list > >; IndexMap1 = adj_list_vertex_property_map >, int, const int&, vertex_index_t>; IndexMap2 = adj_list_vertex_property_map >, int, const int&, vertex_index_t>; std::size_t = long unsigned int]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/isomorphism.hpp:651:42: required from ‘bool boost::graph::detail::isomorphism_impl::operator()(const Graph1&, const Graph2&, const ArgPack&) const [with ArgPack = boost::parameter::aux::arg_list >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&> >, boost::parameter::aux::empty_arg_list, std::integral_constant >; Graph1 = boost::adjacency_list >; Graph2 = boost::adjacency_list >]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/isomorphism.hpp:662:5: required from ‘typename boost::result_of(Param0, Param1, const ArgPack&)>::type boost::graph::isomorphism_with_named_params(const Param0&, const Param1&, const ArgPack&) [with Param0 = boost::adjacency_list >; Param1 = boost::adjacency_list >; ArgPack = boost::parameter::aux::arg_list >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&> >, boost::parameter::aux::empty_arg_list, std::integral_constant >; typename boost::result_of(Param0, Param1, const ArgPack&)>::type = bool]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/isomorphism.hpp:666:1: required from ‘typename boost::result_of(Param0, Param1, const typename boost::detail::convert_bgl_params_to_boost_parameter >::type&)>::type boost::isomorphism(const Param0&, const Param1&, const bgl_named_params&) [with Param0 = adjacency_list >; Param1 = adjacency_list >; P = iterator_property_map<__gnu_cxx::__normal_iterator >, adj_list_vertex_property_map >, int, int&, vertex_index_t>, void*, void*&>; T = vertex_isomorphism_t; R = no_property; typename result_of(Param0, Param1, const typename detail::convert_bgl_params_to_boost_parameter >::type&)>::type = bool; typename detail::convert_bgl_params_to_boost_parameter >::type = parameter::aux::arg_list >, adj_list_vertex_property_map >, int, int&, vertex_index_t>, void*, void*&> >, parameter::aux::empty_arg_list, std::integral_constant >]’ ordering.cpp:68:18: required from here /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::EqualityComparable::~EqualityComparable() [with TT = __gnu_cxx::__normal_iterator*, std::vector, std::allocator > > >]’ 37 | ~model() | ^ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:233:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 233 | BOOST_CONCEPT_USAGE(EqualityComparable) { | ^~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::range_detail::SinglePassIteratorConcept<__gnu_cxx::__normal_iterator*, std::vector, std::allocator > > > >]’: /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements*, std::vector, std::allocator > > > > >]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/range/concepts.hpp:158:13: required from ‘struct boost::range_detail::SinglePassIteratorConcept<__gnu_cxx::__normal_iterator*, std::vector, std::allocator > > > >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::range_detail::SinglePassIteratorConcept<__gnu_cxx::__normal_iterator*, std::vector, std::allocator > > > >]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied*, std::vector, std::allocator > > > > >::value’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied*, std::vector, std::allocator > > > > >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:72:8: [ skipping 10 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/isomorphism.hpp:226:17: required from ‘bool boost::detail::isomorphism_algo::test_isomorphism() [with Graph1 = boost::adjacency_list >; Graph2 = boost::adjacency_list >; IsoMapping = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&>; Invariant1 = boost::degree_vertex_invariant >, int, const int&, boost::vertex_index_t> >, boost::adjacency_list > >; Invariant2 = boost::degree_vertex_invariant >, int, const int&, boost::vertex_index_t> >, boost::adjacency_list > >; IndexMap1 = boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>; IndexMap2 = boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/isomorphism.hpp:532:33: required from ‘bool boost::isomorphism(const Graph1&, const Graph2&, IsoMapping, Invariant1, Invariant2, std::size_t, IndexMap1, IndexMap2) [with Graph1 = adjacency_list >; Graph2 = adjacency_list >; IsoMapping = iterator_property_map<__gnu_cxx::__normal_iterator >, adj_list_vertex_property_map >, int, int&, vertex_index_t>, void*, void*&>; Invariant1 = degree_vertex_invariant >, int, const int&, vertex_index_t> >, adjacency_list > >; Invariant2 = degree_vertex_invariant >, int, const int&, vertex_index_t> >, adjacency_list > >; IndexMap1 = adj_list_vertex_property_map >, int, const int&, vertex_index_t>; IndexMap2 = adj_list_vertex_property_map >, int, const int&, vertex_index_t>; std::size_t = long unsigned int]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/isomorphism.hpp:651:42: required from ‘bool boost::graph::detail::isomorphism_impl::operator()(const Graph1&, const Graph2&, const ArgPack&) const [with ArgPack = boost::parameter::aux::arg_list >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&> >, boost::parameter::aux::empty_arg_list, std::integral_constant >; Graph1 = boost::adjacency_list >; Graph2 = boost::adjacency_list >]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/isomorphism.hpp:662:5: required from ‘typename boost::result_of(Param0, Param1, const ArgPack&)>::type boost::graph::isomorphism_with_named_params(const Param0&, const Param1&, const ArgPack&) [with Param0 = boost::adjacency_list >; Param1 = boost::adjacency_list >; ArgPack = boost::parameter::aux::arg_list >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&> >, boost::parameter::aux::empty_arg_list, std::integral_constant >; typename boost::result_of(Param0, Param1, const ArgPack&)>::type = bool]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/isomorphism.hpp:666:1: required from ‘typename boost::result_of(Param0, Param1, const typename boost::detail::convert_bgl_params_to_boost_parameter >::type&)>::type boost::isomorphism(const Param0&, const Param1&, const bgl_named_params&) [with Param0 = adjacency_list >; Param1 = adjacency_list >; P = iterator_property_map<__gnu_cxx::__normal_iterator >, adj_list_vertex_property_map >, int, int&, vertex_index_t>, void*, void*&>; T = vertex_isomorphism_t; R = no_property; typename result_of(Param0, Param1, const typename detail::convert_bgl_params_to_boost_parameter >::type&)>::type = bool; typename detail::convert_bgl_params_to_boost_parameter >::type = parameter::aux::arg_list >, adj_list_vertex_property_map >, int, int&, vertex_index_t>, void*, void*&> >, parameter::aux::empty_arg_list, std::integral_constant >]’ ordering.cpp:68:18: required from here /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::range_detail::SinglePassIteratorConcept::~SinglePassIteratorConcept() [with Iterator = __gnu_cxx::__normal_iterator*, std::vector, std::allocator > > >]’ 37 | ~model() | ^ /home/omnipath/local/R/4.4-3.20/BH/include/boost/range/concepts.hpp:158:13: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 158 | BOOST_CONCEPT_USAGE(SinglePassIteratorConcept) | ^~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::CopyConstructible<__gnu_cxx::__normal_iterator*, std::vector, std::allocator > > > >]’: /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements*, std::vector, std::allocator > > > > >]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:167:5: required from ‘struct boost::CopyConstructible<__gnu_cxx::__normal_iterator*, std::vector, std::allocator > > > >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/range/concepts.hpp:125:16: required from ‘struct boost::range_detail::IncrementableIteratorConcept<__gnu_cxx::__normal_iterator*, std::vector, std::allocator > > > >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/range/concepts.hpp:147:16: required from ‘struct boost::range_detail::SinglePassIteratorConcept<__gnu_cxx::__normal_iterator*, std::vector, std::allocator > > > >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::range_detail::SinglePassIteratorConcept<__gnu_cxx::__normal_iterator*, std::vector, std::allocator > > > >]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:42:5: [ skipping 12 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/isomorphism.hpp:226:17: required from ‘bool boost::detail::isomorphism_algo::test_isomorphism() [with Graph1 = boost::adjacency_list >; Graph2 = boost::adjacency_list >; IsoMapping = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&>; Invariant1 = boost::degree_vertex_invariant >, int, const int&, boost::vertex_index_t> >, boost::adjacency_list > >; Invariant2 = boost::degree_vertex_invariant >, int, const int&, boost::vertex_index_t> >, boost::adjacency_list > >; IndexMap1 = boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>; IndexMap2 = boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/isomorphism.hpp:532:33: required from ‘bool boost::isomorphism(const Graph1&, const Graph2&, IsoMapping, Invariant1, Invariant2, std::size_t, IndexMap1, IndexMap2) [with Graph1 = adjacency_list >; Graph2 = adjacency_list >; IsoMapping = iterator_property_map<__gnu_cxx::__normal_iterator >, adj_list_vertex_property_map >, int, int&, vertex_index_t>, void*, void*&>; Invariant1 = degree_vertex_invariant >, int, const int&, vertex_index_t> >, adjacency_list > >; Invariant2 = degree_vertex_invariant >, int, const int&, vertex_index_t> >, adjacency_list > >; IndexMap1 = adj_list_vertex_property_map >, int, const int&, vertex_index_t>; IndexMap2 = adj_list_vertex_property_map >, int, const int&, vertex_index_t>; std::size_t = long unsigned int]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/isomorphism.hpp:651:42: required from ‘bool boost::graph::detail::isomorphism_impl::operator()(const Graph1&, const Graph2&, const ArgPack&) const [with ArgPack = boost::parameter::aux::arg_list >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&> >, boost::parameter::aux::empty_arg_list, std::integral_constant >; Graph1 = boost::adjacency_list >; Graph2 = boost::adjacency_list >]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/isomorphism.hpp:662:5: required from ‘typename boost::result_of(Param0, Param1, const ArgPack&)>::type boost::graph::isomorphism_with_named_params(const Param0&, const Param1&, const ArgPack&) [with Param0 = boost::adjacency_list >; Param1 = boost::adjacency_list >; ArgPack = boost::parameter::aux::arg_list >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&> >, boost::parameter::aux::empty_arg_list, std::integral_constant >; typename boost::result_of(Param0, Param1, const ArgPack&)>::type = bool]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/isomorphism.hpp:666:1: required from ‘typename boost::result_of(Param0, Param1, const typename boost::detail::convert_bgl_params_to_boost_parameter >::type&)>::type boost::isomorphism(const Param0&, const Param1&, const bgl_named_params&) [with Param0 = adjacency_list >; Param1 = adjacency_list >; P = iterator_property_map<__gnu_cxx::__normal_iterator >, adj_list_vertex_property_map >, int, int&, vertex_index_t>, void*, void*&>; T = vertex_isomorphism_t; R = no_property; typename result_of(Param0, Param1, const typename detail::convert_bgl_params_to_boost_parameter >::type&)>::type = bool; typename detail::convert_bgl_params_to_boost_parameter >::type = parameter::aux::arg_list >, adj_list_vertex_property_map >, int, int&, vertex_index_t>, void*, void*&> >, parameter::aux::empty_arg_list, std::integral_constant >]’ ordering.cpp:68:18: required from here /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::CopyConstructible::~CopyConstructible() [with TT = __gnu_cxx::__normal_iterator*, std::vector, std::allocator > > >]’ 37 | ~model() | ^ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:167:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 167 | BOOST_CONCEPT_USAGE(CopyConstructible) { | ^~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::range_detail::IncrementableIteratorConcept<__gnu_cxx::__normal_iterator*, std::vector, std::allocator > > > >]’: /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements*, std::vector, std::allocator > > > > >]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/range/concepts.hpp:136:13: required from ‘struct boost::range_detail::IncrementableIteratorConcept<__gnu_cxx::__normal_iterator*, std::vector, std::allocator > > > >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/range/concepts.hpp:147:16: required from ‘struct boost::range_detail::SinglePassIteratorConcept<__gnu_cxx::__normal_iterator*, std::vector, std::allocator > > > >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::range_detail::SinglePassIteratorConcept<__gnu_cxx::__normal_iterator*, std::vector, std::allocator > > > >]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied*, std::vector, std::allocator > > > > >::value’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:45:51: [ skipping 11 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/isomorphism.hpp:226:17: required from ‘bool boost::detail::isomorphism_algo::test_isomorphism() [with Graph1 = boost::adjacency_list >; Graph2 = boost::adjacency_list >; IsoMapping = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&>; Invariant1 = boost::degree_vertex_invariant >, int, const int&, boost::vertex_index_t> >, boost::adjacency_list > >; Invariant2 = boost::degree_vertex_invariant >, int, const int&, boost::vertex_index_t> >, boost::adjacency_list > >; IndexMap1 = boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>; IndexMap2 = boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/isomorphism.hpp:532:33: required from ‘bool boost::isomorphism(const Graph1&, const Graph2&, IsoMapping, Invariant1, Invariant2, std::size_t, IndexMap1, IndexMap2) [with Graph1 = adjacency_list >; Graph2 = adjacency_list >; IsoMapping = iterator_property_map<__gnu_cxx::__normal_iterator >, adj_list_vertex_property_map >, int, int&, vertex_index_t>, void*, void*&>; Invariant1 = degree_vertex_invariant >, int, const int&, vertex_index_t> >, adjacency_list > >; Invariant2 = degree_vertex_invariant >, int, const int&, vertex_index_t> >, adjacency_list > >; IndexMap1 = adj_list_vertex_property_map >, int, const int&, vertex_index_t>; IndexMap2 = adj_list_vertex_property_map >, int, const int&, vertex_index_t>; std::size_t = long unsigned int]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/isomorphism.hpp:651:42: required from ‘bool boost::graph::detail::isomorphism_impl::operator()(const Graph1&, const Graph2&, const ArgPack&) const [with ArgPack = boost::parameter::aux::arg_list >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&> >, boost::parameter::aux::empty_arg_list, std::integral_constant >; Graph1 = boost::adjacency_list >; Graph2 = boost::adjacency_list >]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/isomorphism.hpp:662:5: required from ‘typename boost::result_of(Param0, Param1, const ArgPack&)>::type boost::graph::isomorphism_with_named_params(const Param0&, const Param1&, const ArgPack&) [with Param0 = boost::adjacency_list >; Param1 = boost::adjacency_list >; ArgPack = boost::parameter::aux::arg_list >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&> >, boost::parameter::aux::empty_arg_list, std::integral_constant >; typename boost::result_of(Param0, Param1, const ArgPack&)>::type = bool]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/isomorphism.hpp:666:1: required from ‘typename boost::result_of(Param0, Param1, const typename boost::detail::convert_bgl_params_to_boost_parameter >::type&)>::type boost::isomorphism(const Param0&, const Param1&, const bgl_named_params&) [with Param0 = adjacency_list >; Param1 = adjacency_list >; P = iterator_property_map<__gnu_cxx::__normal_iterator >, adj_list_vertex_property_map >, int, int&, vertex_index_t>, void*, void*&>; T = vertex_isomorphism_t; R = no_property; typename result_of(Param0, Param1, const typename detail::convert_bgl_params_to_boost_parameter >::type&)>::type = bool; typename detail::convert_bgl_params_to_boost_parameter >::type = parameter::aux::arg_list >, adj_list_vertex_property_map >, int, int&, vertex_index_t>, void*, void*&> >, parameter::aux::empty_arg_list, std::integral_constant >]’ ordering.cpp:68:18: required from here /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::range_detail::IncrementableIteratorConcept::~IncrementableIteratorConcept() [with Iterator = __gnu_cxx::__normal_iterator*, std::vector, std::allocator > > >]’ 37 | ~model() | ^ /home/omnipath/local/R/4.4-3.20/BH/include/boost/range/concepts.hpp:136:13: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 136 | BOOST_CONCEPT_USAGE(IncrementableIteratorConcept) | ^~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::EqualityComparable<__gnu_cxx::__normal_iterator*, std::vector, std::allocator > > > >]’: /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements*, std::vector, std::allocator > > > > >]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:233:5: required from ‘struct boost::EqualityComparable<__gnu_cxx::__normal_iterator*, std::vector, std::allocator > > > >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/range/concepts.hpp:147:16: required from ‘struct boost::range_detail::SinglePassIteratorConcept<__gnu_cxx::__normal_iterator*, std::vector, std::allocator > > > >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::range_detail::SinglePassIteratorConcept<__gnu_cxx::__normal_iterator*, std::vector, std::allocator > > > >]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied*, std::vector, std::allocator > > > > >::value’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:45:51: [ skipping 11 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/isomorphism.hpp:226:17: required from ‘bool boost::detail::isomorphism_algo::test_isomorphism() [with Graph1 = boost::adjacency_list >; Graph2 = boost::adjacency_list >; IsoMapping = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&>; Invariant1 = boost::degree_vertex_invariant >, int, const int&, boost::vertex_index_t> >, boost::adjacency_list > >; Invariant2 = boost::degree_vertex_invariant >, int, const int&, boost::vertex_index_t> >, boost::adjacency_list > >; IndexMap1 = boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>; IndexMap2 = boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/isomorphism.hpp:532:33: required from ‘bool boost::isomorphism(const Graph1&, const Graph2&, IsoMapping, Invariant1, Invariant2, std::size_t, IndexMap1, IndexMap2) [with Graph1 = adjacency_list >; Graph2 = adjacency_list >; IsoMapping = iterator_property_map<__gnu_cxx::__normal_iterator >, adj_list_vertex_property_map >, int, int&, vertex_index_t>, void*, void*&>; Invariant1 = degree_vertex_invariant >, int, const int&, vertex_index_t> >, adjacency_list > >; Invariant2 = degree_vertex_invariant >, int, const int&, vertex_index_t> >, adjacency_list > >; IndexMap1 = adj_list_vertex_property_map >, int, const int&, vertex_index_t>; IndexMap2 = adj_list_vertex_property_map >, int, const int&, vertex_index_t>; std::size_t = long unsigned int]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/isomorphism.hpp:651:42: required from ‘bool boost::graph::detail::isomorphism_impl::operator()(const Graph1&, const Graph2&, const ArgPack&) const [with ArgPack = boost::parameter::aux::arg_list >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&> >, boost::parameter::aux::empty_arg_list, std::integral_constant >; Graph1 = boost::adjacency_list >; Graph2 = boost::adjacency_list >]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/isomorphism.hpp:662:5: required from ‘typename boost::result_of(Param0, Param1, const ArgPack&)>::type boost::graph::isomorphism_with_named_params(const Param0&, const Param1&, const ArgPack&) [with Param0 = boost::adjacency_list >; Param1 = boost::adjacency_list >; ArgPack = boost::parameter::aux::arg_list >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&> >, boost::parameter::aux::empty_arg_list, std::integral_constant >; typename boost::result_of(Param0, Param1, const ArgPack&)>::type = bool]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/isomorphism.hpp:666:1: required from ‘typename boost::result_of(Param0, Param1, const typename boost::detail::convert_bgl_params_to_boost_parameter >::type&)>::type boost::isomorphism(const Param0&, const Param1&, const bgl_named_params&) [with Param0 = adjacency_list >; Param1 = adjacency_list >; P = iterator_property_map<__gnu_cxx::__normal_iterator >, adj_list_vertex_property_map >, int, int&, vertex_index_t>, void*, void*&>; T = vertex_isomorphism_t; R = no_property; typename result_of(Param0, Param1, const typename detail::convert_bgl_params_to_boost_parameter >::type&)>::type = bool; typename detail::convert_bgl_params_to_boost_parameter >::type = parameter::aux::arg_list >, adj_list_vertex_property_map >, int, int&, vertex_index_t>, void*, void*&> >, parameter::aux::empty_arg_list, std::integral_constant >]’ ordering.cpp:68:18: required from here /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::EqualityComparable::~EqualityComparable() [with TT = __gnu_cxx::__normal_iterator*, std::vector, std::allocator > > >]’ 37 | ~model() | ^ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:233:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 233 | BOOST_CONCEPT_USAGE(EqualityComparable) { | ^~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::range_detail::SinglePassIteratorConcept<__gnu_cxx::__normal_iterator*, std::vector, std::allocator > > > >]’: /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements*, std::vector, std::allocator > > > > >]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/range/concepts.hpp:158:13: required from ‘struct boost::range_detail::SinglePassIteratorConcept<__gnu_cxx::__normal_iterator*, std::vector, std::allocator > > > >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::range_detail::SinglePassIteratorConcept<__gnu_cxx::__normal_iterator*, std::vector, std::allocator > > > >]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied*, std::vector, std::allocator > > > > >::value’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied*, std::vector, std::allocator > > > > >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:72:8: [ skipping 10 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/isomorphism.hpp:226:17: required from ‘bool boost::detail::isomorphism_algo::test_isomorphism() [with Graph1 = boost::adjacency_list >; Graph2 = boost::adjacency_list >; IsoMapping = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&>; Invariant1 = boost::degree_vertex_invariant >, int, const int&, boost::vertex_index_t> >, boost::adjacency_list > >; Invariant2 = boost::degree_vertex_invariant >, int, const int&, boost::vertex_index_t> >, boost::adjacency_list > >; IndexMap1 = boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>; IndexMap2 = boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/isomorphism.hpp:532:33: required from ‘bool boost::isomorphism(const Graph1&, const Graph2&, IsoMapping, Invariant1, Invariant2, std::size_t, IndexMap1, IndexMap2) [with Graph1 = adjacency_list >; Graph2 = adjacency_list >; IsoMapping = iterator_property_map<__gnu_cxx::__normal_iterator >, adj_list_vertex_property_map >, int, int&, vertex_index_t>, void*, void*&>; Invariant1 = degree_vertex_invariant >, int, const int&, vertex_index_t> >, adjacency_list > >; Invariant2 = degree_vertex_invariant >, int, const int&, vertex_index_t> >, adjacency_list > >; IndexMap1 = adj_list_vertex_property_map >, int, const int&, vertex_index_t>; IndexMap2 = adj_list_vertex_property_map >, int, const int&, vertex_index_t>; std::size_t = long unsigned int]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/isomorphism.hpp:651:42: required from ‘bool boost::graph::detail::isomorphism_impl::operator()(const Graph1&, const Graph2&, const ArgPack&) const [with ArgPack = boost::parameter::aux::arg_list >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&> >, boost::parameter::aux::empty_arg_list, std::integral_constant >; Graph1 = boost::adjacency_list >; Graph2 = boost::adjacency_list >]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/isomorphism.hpp:662:5: required from ‘typename boost::result_of(Param0, Param1, const ArgPack&)>::type boost::graph::isomorphism_with_named_params(const Param0&, const Param1&, const ArgPack&) [with Param0 = boost::adjacency_list >; Param1 = boost::adjacency_list >; ArgPack = boost::parameter::aux::arg_list >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&> >, boost::parameter::aux::empty_arg_list, std::integral_constant >; typename boost::result_of(Param0, Param1, const ArgPack&)>::type = bool]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/isomorphism.hpp:666:1: required from ‘typename boost::result_of(Param0, Param1, const typename boost::detail::convert_bgl_params_to_boost_parameter >::type&)>::type boost::isomorphism(const Param0&, const Param1&, const bgl_named_params&) [with Param0 = adjacency_list >; Param1 = adjacency_list >; P = iterator_property_map<__gnu_cxx::__normal_iterator >, adj_list_vertex_property_map >, int, int&, vertex_index_t>, void*, void*&>; T = vertex_isomorphism_t; R = no_property; typename result_of(Param0, Param1, const typename detail::convert_bgl_params_to_boost_parameter >::type&)>::type = bool; typename detail::convert_bgl_params_to_boost_parameter >::type = parameter::aux::arg_list >, adj_list_vertex_property_map >, int, int&, vertex_index_t>, void*, void*&> >, parameter::aux::empty_arg_list, std::integral_constant >]’ ordering.cpp:68:18: required from here /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::range_detail::SinglePassIteratorConcept::~SinglePassIteratorConcept() [with Iterator = __gnu_cxx::__normal_iterator*, std::vector, std::allocator > > >]’ 37 | ~model() | ^ /home/omnipath/local/R/4.4-3.20/BH/include/boost/range/concepts.hpp:158:13: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 158 | BOOST_CONCEPT_USAGE(SinglePassIteratorConcept) | ^~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::SinglePassRangeConcept, std::allocator > > >]’: /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements, std::allocator > > > >]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/range/concepts.hpp:284:9: required from ‘struct boost::SinglePassRangeConcept, std::allocator > > >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/range/concepts.hpp:318:12: required from ‘struct boost::ForwardRangeConcept, std::allocator > > >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/range/concepts.hpp:352:12: required from ‘struct boost::BidirectionalRangeConcept, std::allocator > > >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/range/concepts.hpp:370:12: required from ‘struct boost::RandomAccessRangeConcept, std::allocator > > >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:32:62: [ skipping 5 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/isomorphism.hpp:226:17: required from ‘bool boost::detail::isomorphism_algo::test_isomorphism() [with Graph1 = boost::adjacency_list >; Graph2 = boost::adjacency_list >; IsoMapping = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&>; Invariant1 = boost::degree_vertex_invariant >, int, const int&, boost::vertex_index_t> >, boost::adjacency_list > >; Invariant2 = boost::degree_vertex_invariant >, int, const int&, boost::vertex_index_t> >, boost::adjacency_list > >; IndexMap1 = boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>; IndexMap2 = boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/isomorphism.hpp:532:33: required from ‘bool boost::isomorphism(const Graph1&, const Graph2&, IsoMapping, Invariant1, Invariant2, std::size_t, IndexMap1, IndexMap2) [with Graph1 = adjacency_list >; Graph2 = adjacency_list >; IsoMapping = iterator_property_map<__gnu_cxx::__normal_iterator >, adj_list_vertex_property_map >, int, int&, vertex_index_t>, void*, void*&>; Invariant1 = degree_vertex_invariant >, int, const int&, vertex_index_t> >, adjacency_list > >; Invariant2 = degree_vertex_invariant >, int, const int&, vertex_index_t> >, adjacency_list > >; IndexMap1 = adj_list_vertex_property_map >, int, const int&, vertex_index_t>; IndexMap2 = adj_list_vertex_property_map >, int, const int&, vertex_index_t>; std::size_t = long unsigned int]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/isomorphism.hpp:651:42: required from ‘bool boost::graph::detail::isomorphism_impl::operator()(const Graph1&, const Graph2&, const ArgPack&) const [with ArgPack = boost::parameter::aux::arg_list >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&> >, boost::parameter::aux::empty_arg_list, std::integral_constant >; Graph1 = boost::adjacency_list >; Graph2 = boost::adjacency_list >]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/isomorphism.hpp:662:5: required from ‘typename boost::result_of(Param0, Param1, const ArgPack&)>::type boost::graph::isomorphism_with_named_params(const Param0&, const Param1&, const ArgPack&) [with Param0 = boost::adjacency_list >; Param1 = boost::adjacency_list >; ArgPack = boost::parameter::aux::arg_list >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&> >, boost::parameter::aux::empty_arg_list, std::integral_constant >; typename boost::result_of(Param0, Param1, const ArgPack&)>::type = bool]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/isomorphism.hpp:666:1: required from ‘typename boost::result_of(Param0, Param1, const typename boost::detail::convert_bgl_params_to_boost_parameter >::type&)>::type boost::isomorphism(const Param0&, const Param1&, const bgl_named_params&) [with Param0 = adjacency_list >; Param1 = adjacency_list >; P = iterator_property_map<__gnu_cxx::__normal_iterator >, adj_list_vertex_property_map >, int, int&, vertex_index_t>, void*, void*&>; T = vertex_isomorphism_t; R = no_property; typename result_of(Param0, Param1, const typename detail::convert_bgl_params_to_boost_parameter >::type&)>::type = bool; typename detail::convert_bgl_params_to_boost_parameter >::type = parameter::aux::arg_list >, adj_list_vertex_property_map >, int, int&, vertex_index_t>, void*, void*&> >, parameter::aux::empty_arg_list, std::integral_constant >]’ ordering.cpp:68:18: required from here /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::SinglePassRangeConcept::~SinglePassRangeConcept() [with T = std::vector, std::allocator > >]’ 37 | ~model() | ^ /home/omnipath/local/R/4.4-3.20/BH/include/boost/range/concepts.hpp:284:9: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 284 | BOOST_CONCEPT_USAGE(SinglePassRangeConcept) | ^~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::DefaultConstructible<__gnu_cxx::__normal_iterator*, std::vector, std::allocator > > > >]’: /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements*, std::vector, std::allocator > > > > >]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:137:5: required from ‘struct boost::DefaultConstructible<__gnu_cxx::__normal_iterator*, std::vector, std::allocator > > > >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/range/concepts.hpp:181:16: required from ‘struct boost::range_detail::ForwardIteratorConcept<__gnu_cxx::__normal_iterator*, std::vector, std::allocator > > > >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::range_detail::ForwardIteratorConcept<__gnu_cxx::__normal_iterator*, std::vector, std::allocator > > > >]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied*, std::vector, std::allocator > > > > >::value’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:45:51: [ skipping 10 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/isomorphism.hpp:226:17: required from ‘bool boost::detail::isomorphism_algo::test_isomorphism() [with Graph1 = boost::adjacency_list >; Graph2 = boost::adjacency_list >; IsoMapping = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&>; Invariant1 = boost::degree_vertex_invariant >, int, const int&, boost::vertex_index_t> >, boost::adjacency_list > >; Invariant2 = boost::degree_vertex_invariant >, int, const int&, boost::vertex_index_t> >, boost::adjacency_list > >; IndexMap1 = boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>; IndexMap2 = boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/isomorphism.hpp:532:33: required from ‘bool boost::isomorphism(const Graph1&, const Graph2&, IsoMapping, Invariant1, Invariant2, std::size_t, IndexMap1, IndexMap2) [with Graph1 = adjacency_list >; Graph2 = adjacency_list >; IsoMapping = iterator_property_map<__gnu_cxx::__normal_iterator >, adj_list_vertex_property_map >, int, int&, vertex_index_t>, void*, void*&>; Invariant1 = degree_vertex_invariant >, int, const int&, vertex_index_t> >, adjacency_list > >; Invariant2 = degree_vertex_invariant >, int, const int&, vertex_index_t> >, adjacency_list > >; IndexMap1 = adj_list_vertex_property_map >, int, const int&, vertex_index_t>; IndexMap2 = adj_list_vertex_property_map >, int, const int&, vertex_index_t>; std::size_t = long unsigned int]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/isomorphism.hpp:651:42: required from ‘bool boost::graph::detail::isomorphism_impl::operator()(const Graph1&, const Graph2&, const ArgPack&) const [with ArgPack = boost::parameter::aux::arg_list >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&> >, boost::parameter::aux::empty_arg_list, std::integral_constant >; Graph1 = boost::adjacency_list >; Graph2 = boost::adjacency_list >]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/isomorphism.hpp:662:5: required from ‘typename boost::result_of(Param0, Param1, const ArgPack&)>::type boost::graph::isomorphism_with_named_params(const Param0&, const Param1&, const ArgPack&) [with Param0 = boost::adjacency_list >; Param1 = boost::adjacency_list >; ArgPack = boost::parameter::aux::arg_list >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&> >, boost::parameter::aux::empty_arg_list, std::integral_constant >; typename boost::result_of(Param0, Param1, const ArgPack&)>::type = bool]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/isomorphism.hpp:666:1: required from ‘typename boost::result_of(Param0, Param1, const typename boost::detail::convert_bgl_params_to_boost_parameter >::type&)>::type boost::isomorphism(const Param0&, const Param1&, const bgl_named_params&) [with Param0 = adjacency_list >; Param1 = adjacency_list >; P = iterator_property_map<__gnu_cxx::__normal_iterator >, adj_list_vertex_property_map >, int, int&, vertex_index_t>, void*, void*&>; T = vertex_isomorphism_t; R = no_property; typename result_of(Param0, Param1, const typename detail::convert_bgl_params_to_boost_parameter >::type&)>::type = bool; typename detail::convert_bgl_params_to_boost_parameter >::type = parameter::aux::arg_list >, adj_list_vertex_property_map >, int, int&, vertex_index_t>, void*, void*&> >, parameter::aux::empty_arg_list, std::integral_constant >]’ ordering.cpp:68:18: required from here /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::DefaultConstructible::~DefaultConstructible() [with TT = __gnu_cxx::__normal_iterator*, std::vector, std::allocator > > >]’ 37 | ~model() | ^ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:137:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 137 | BOOST_CONCEPT_USAGE(DefaultConstructible) { | ^~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::range_detail::ForwardIteratorConcept<__gnu_cxx::__normal_iterator*, std::vector, std::allocator > > > >]’: /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements*, std::vector, std::allocator > > > > >]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/range/concepts.hpp:197:13: required from ‘struct boost::range_detail::ForwardIteratorConcept<__gnu_cxx::__normal_iterator*, std::vector, std::allocator > > > >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::range_detail::ForwardIteratorConcept<__gnu_cxx::__normal_iterator*, std::vector, std::allocator > > > >]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied*, std::vector, std::allocator > > > > >::value’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied*, std::vector, std::allocator > > > > >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:72:8: [ skipping 9 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/isomorphism.hpp:226:17: required from ‘bool boost::detail::isomorphism_algo::test_isomorphism() [with Graph1 = boost::adjacency_list >; Graph2 = boost::adjacency_list >; IsoMapping = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&>; Invariant1 = boost::degree_vertex_invariant >, int, const int&, boost::vertex_index_t> >, boost::adjacency_list > >; Invariant2 = boost::degree_vertex_invariant >, int, const int&, boost::vertex_index_t> >, boost::adjacency_list > >; IndexMap1 = boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>; IndexMap2 = boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/isomorphism.hpp:532:33: required from ‘bool boost::isomorphism(const Graph1&, const Graph2&, IsoMapping, Invariant1, Invariant2, std::size_t, IndexMap1, IndexMap2) [with Graph1 = adjacency_list >; Graph2 = adjacency_list >; IsoMapping = iterator_property_map<__gnu_cxx::__normal_iterator >, adj_list_vertex_property_map >, int, int&, vertex_index_t>, void*, void*&>; Invariant1 = degree_vertex_invariant >, int, const int&, vertex_index_t> >, adjacency_list > >; Invariant2 = degree_vertex_invariant >, int, const int&, vertex_index_t> >, adjacency_list > >; IndexMap1 = adj_list_vertex_property_map >, int, const int&, vertex_index_t>; IndexMap2 = adj_list_vertex_property_map >, int, const int&, vertex_index_t>; std::size_t = long unsigned int]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/isomorphism.hpp:651:42: required from ‘bool boost::graph::detail::isomorphism_impl::operator()(const Graph1&, const Graph2&, const ArgPack&) const [with ArgPack = boost::parameter::aux::arg_list >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&> >, boost::parameter::aux::empty_arg_list, std::integral_constant >; Graph1 = boost::adjacency_list >; Graph2 = boost::adjacency_list >]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/isomorphism.hpp:662:5: required from ‘typename boost::result_of(Param0, Param1, const ArgPack&)>::type boost::graph::isomorphism_with_named_params(const Param0&, const Param1&, const ArgPack&) [with Param0 = boost::adjacency_list >; Param1 = boost::adjacency_list >; ArgPack = boost::parameter::aux::arg_list >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&> >, boost::parameter::aux::empty_arg_list, std::integral_constant >; typename boost::result_of(Param0, Param1, const ArgPack&)>::type = bool]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/isomorphism.hpp:666:1: required from ‘typename boost::result_of(Param0, Param1, const typename boost::detail::convert_bgl_params_to_boost_parameter >::type&)>::type boost::isomorphism(const Param0&, const Param1&, const bgl_named_params&) [with Param0 = adjacency_list >; Param1 = adjacency_list >; P = iterator_property_map<__gnu_cxx::__normal_iterator >, adj_list_vertex_property_map >, int, int&, vertex_index_t>, void*, void*&>; T = vertex_isomorphism_t; R = no_property; typename result_of(Param0, Param1, const typename detail::convert_bgl_params_to_boost_parameter >::type&)>::type = bool; typename detail::convert_bgl_params_to_boost_parameter >::type = parameter::aux::arg_list >, adj_list_vertex_property_map >, int, int&, vertex_index_t>, void*, void*&> >, parameter::aux::empty_arg_list, std::integral_constant >]’ ordering.cpp:68:18: required from here /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::range_detail::ForwardIteratorConcept::~ForwardIteratorConcept() [with Iterator = __gnu_cxx::__normal_iterator*, std::vector, std::allocator > > >]’ 37 | ~model() | ^ /home/omnipath/local/R/4.4-3.20/BH/include/boost/range/concepts.hpp:197:13: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 197 | BOOST_CONCEPT_USAGE(ForwardIteratorConcept) | ^~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::DefaultConstructible<__gnu_cxx::__normal_iterator*, std::vector, std::allocator > > > >]’: /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements*, std::vector, std::allocator > > > > >]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:137:5: required from ‘struct boost::DefaultConstructible<__gnu_cxx::__normal_iterator*, std::vector, std::allocator > > > >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/range/concepts.hpp:181:16: required from ‘struct boost::range_detail::ForwardIteratorConcept<__gnu_cxx::__normal_iterator*, std::vector, std::allocator > > > >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::range_detail::ForwardIteratorConcept<__gnu_cxx::__normal_iterator*, std::vector, std::allocator > > > >]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied*, std::vector, std::allocator > > > > >::value’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:45:51: [ skipping 10 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/isomorphism.hpp:226:17: required from ‘bool boost::detail::isomorphism_algo::test_isomorphism() [with Graph1 = boost::adjacency_list >; Graph2 = boost::adjacency_list >; IsoMapping = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&>; Invariant1 = boost::degree_vertex_invariant >, int, const int&, boost::vertex_index_t> >, boost::adjacency_list > >; Invariant2 = boost::degree_vertex_invariant >, int, const int&, boost::vertex_index_t> >, boost::adjacency_list > >; IndexMap1 = boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>; IndexMap2 = boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/isomorphism.hpp:532:33: required from ‘bool boost::isomorphism(const Graph1&, const Graph2&, IsoMapping, Invariant1, Invariant2, std::size_t, IndexMap1, IndexMap2) [with Graph1 = adjacency_list >; Graph2 = adjacency_list >; IsoMapping = iterator_property_map<__gnu_cxx::__normal_iterator >, adj_list_vertex_property_map >, int, int&, vertex_index_t>, void*, void*&>; Invariant1 = degree_vertex_invariant >, int, const int&, vertex_index_t> >, adjacency_list > >; Invariant2 = degree_vertex_invariant >, int, const int&, vertex_index_t> >, adjacency_list > >; IndexMap1 = adj_list_vertex_property_map >, int, const int&, vertex_index_t>; IndexMap2 = adj_list_vertex_property_map >, int, const int&, vertex_index_t>; std::size_t = long unsigned int]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/isomorphism.hpp:651:42: required from ‘bool boost::graph::detail::isomorphism_impl::operator()(const Graph1&, const Graph2&, const ArgPack&) const [with ArgPack = boost::parameter::aux::arg_list >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&> >, boost::parameter::aux::empty_arg_list, std::integral_constant >; Graph1 = boost::adjacency_list >; Graph2 = boost::adjacency_list >]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/isomorphism.hpp:662:5: required from ‘typename boost::result_of(Param0, Param1, const ArgPack&)>::type boost::graph::isomorphism_with_named_params(const Param0&, const Param1&, const ArgPack&) [with Param0 = boost::adjacency_list >; Param1 = boost::adjacency_list >; ArgPack = boost::parameter::aux::arg_list >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&> >, boost::parameter::aux::empty_arg_list, std::integral_constant >; typename boost::result_of(Param0, Param1, const ArgPack&)>::type = bool]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/isomorphism.hpp:666:1: required from ‘typename boost::result_of(Param0, Param1, const typename boost::detail::convert_bgl_params_to_boost_parameter >::type&)>::type boost::isomorphism(const Param0&, const Param1&, const bgl_named_params&) [with Param0 = adjacency_list >; Param1 = adjacency_list >; P = iterator_property_map<__gnu_cxx::__normal_iterator >, adj_list_vertex_property_map >, int, int&, vertex_index_t>, void*, void*&>; T = vertex_isomorphism_t; R = no_property; typename result_of(Param0, Param1, const typename detail::convert_bgl_params_to_boost_parameter >::type&)>::type = bool; typename detail::convert_bgl_params_to_boost_parameter >::type = parameter::aux::arg_list >, adj_list_vertex_property_map >, int, int&, vertex_index_t>, void*, void*&> >, parameter::aux::empty_arg_list, std::integral_constant >]’ ordering.cpp:68:18: required from here /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::DefaultConstructible::~DefaultConstructible() [with TT = __gnu_cxx::__normal_iterator*, std::vector, std::allocator > > >]’ 37 | ~model() | ^ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:137:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 137 | BOOST_CONCEPT_USAGE(DefaultConstructible) { | ^~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::range_detail::ForwardIteratorConcept<__gnu_cxx::__normal_iterator*, std::vector, std::allocator > > > >]’: /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements*, std::vector, std::allocator > > > > >]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/range/concepts.hpp:197:13: required from ‘struct boost::range_detail::ForwardIteratorConcept<__gnu_cxx::__normal_iterator*, std::vector, std::allocator > > > >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::range_detail::ForwardIteratorConcept<__gnu_cxx::__normal_iterator*, std::vector, std::allocator > > > >]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied*, std::vector, std::allocator > > > > >::value’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied*, std::vector, std::allocator > > > > >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:72:8: [ skipping 9 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/isomorphism.hpp:226:17: required from ‘bool boost::detail::isomorphism_algo::test_isomorphism() [with Graph1 = boost::adjacency_list >; Graph2 = boost::adjacency_list >; IsoMapping = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&>; Invariant1 = boost::degree_vertex_invariant >, int, const int&, boost::vertex_index_t> >, boost::adjacency_list > >; Invariant2 = boost::degree_vertex_invariant >, int, const int&, boost::vertex_index_t> >, boost::adjacency_list > >; IndexMap1 = boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>; IndexMap2 = boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/isomorphism.hpp:532:33: required from ‘bool boost::isomorphism(const Graph1&, const Graph2&, IsoMapping, Invariant1, Invariant2, std::size_t, IndexMap1, IndexMap2) [with Graph1 = adjacency_list >; Graph2 = adjacency_list >; IsoMapping = iterator_property_map<__gnu_cxx::__normal_iterator >, adj_list_vertex_property_map >, int, int&, vertex_index_t>, void*, void*&>; Invariant1 = degree_vertex_invariant >, int, const int&, vertex_index_t> >, adjacency_list > >; Invariant2 = degree_vertex_invariant >, int, const int&, vertex_index_t> >, adjacency_list > >; IndexMap1 = adj_list_vertex_property_map >, int, const int&, vertex_index_t>; IndexMap2 = adj_list_vertex_property_map >, int, const int&, vertex_index_t>; std::size_t = long unsigned int]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/isomorphism.hpp:651:42: required from ‘bool boost::graph::detail::isomorphism_impl::operator()(const Graph1&, const Graph2&, const ArgPack&) const [with ArgPack = boost::parameter::aux::arg_list >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&> >, boost::parameter::aux::empty_arg_list, std::integral_constant >; Graph1 = boost::adjacency_list >; Graph2 = boost::adjacency_list >]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/isomorphism.hpp:662:5: required from ‘typename boost::result_of(Param0, Param1, const ArgPack&)>::type boost::graph::isomorphism_with_named_params(const Param0&, const Param1&, const ArgPack&) [with Param0 = boost::adjacency_list >; Param1 = boost::adjacency_list >; ArgPack = boost::parameter::aux::arg_list >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&> >, boost::parameter::aux::empty_arg_list, std::integral_constant >; typename boost::result_of(Param0, Param1, const ArgPack&)>::type = bool]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/isomorphism.hpp:666:1: required from ‘typename boost::result_of(Param0, Param1, const typename boost::detail::convert_bgl_params_to_boost_parameter >::type&)>::type boost::isomorphism(const Param0&, const Param1&, const bgl_named_params&) [with Param0 = adjacency_list >; Param1 = adjacency_list >; P = iterator_property_map<__gnu_cxx::__normal_iterator >, adj_list_vertex_property_map >, int, int&, vertex_index_t>, void*, void*&>; T = vertex_isomorphism_t; R = no_property; typename result_of(Param0, Param1, const typename detail::convert_bgl_params_to_boost_parameter >::type&)>::type = bool; typename detail::convert_bgl_params_to_boost_parameter >::type = parameter::aux::arg_list >, adj_list_vertex_property_map >, int, int&, vertex_index_t>, void*, void*&> >, parameter::aux::empty_arg_list, std::integral_constant >]’ ordering.cpp:68:18: required from here /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::range_detail::ForwardIteratorConcept::~ForwardIteratorConcept() [with Iterator = __gnu_cxx::__normal_iterator*, std::vector, std::allocator > > >]’ 37 | ~model() | ^ /home/omnipath/local/R/4.4-3.20/BH/include/boost/range/concepts.hpp:197:13: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 197 | BOOST_CONCEPT_USAGE(ForwardIteratorConcept) | ^~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::range_detail::BidirectionalIteratorConcept<__gnu_cxx::__normal_iterator*, std::vector, std::allocator > > > >]’: /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements*, std::vector, std::allocator > > > > >]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/range/concepts.hpp:224:14: required from ‘struct boost::range_detail::BidirectionalIteratorConcept<__gnu_cxx::__normal_iterator*, std::vector, std::allocator > > > >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::range_detail::BidirectionalIteratorConcept<__gnu_cxx::__normal_iterator*, std::vector, std::allocator > > > >]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied*, std::vector, std::allocator > > > > >::value’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied*, std::vector, std::allocator > > > > >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:72:8: [ skipping 8 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/isomorphism.hpp:226:17: required from ‘bool boost::detail::isomorphism_algo::test_isomorphism() [with Graph1 = boost::adjacency_list >; Graph2 = boost::adjacency_list >; IsoMapping = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&>; Invariant1 = boost::degree_vertex_invariant >, int, const int&, boost::vertex_index_t> >, boost::adjacency_list > >; Invariant2 = boost::degree_vertex_invariant >, int, const int&, boost::vertex_index_t> >, boost::adjacency_list > >; IndexMap1 = boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>; IndexMap2 = boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/isomorphism.hpp:532:33: required from ‘bool boost::isomorphism(const Graph1&, const Graph2&, IsoMapping, Invariant1, Invariant2, std::size_t, IndexMap1, IndexMap2) [with Graph1 = adjacency_list >; Graph2 = adjacency_list >; IsoMapping = iterator_property_map<__gnu_cxx::__normal_iterator >, adj_list_vertex_property_map >, int, int&, vertex_index_t>, void*, void*&>; Invariant1 = degree_vertex_invariant >, int, const int&, vertex_index_t> >, adjacency_list > >; Invariant2 = degree_vertex_invariant >, int, const int&, vertex_index_t> >, adjacency_list > >; IndexMap1 = adj_list_vertex_property_map >, int, const int&, vertex_index_t>; IndexMap2 = adj_list_vertex_property_map >, int, const int&, vertex_index_t>; std::size_t = long unsigned int]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/isomorphism.hpp:651:42: required from ‘bool boost::graph::detail::isomorphism_impl::operator()(const Graph1&, const Graph2&, const ArgPack&) const [with ArgPack = boost::parameter::aux::arg_list >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&> >, boost::parameter::aux::empty_arg_list, std::integral_constant >; Graph1 = boost::adjacency_list >; Graph2 = boost::adjacency_list >]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/isomorphism.hpp:662:5: required from ‘typename boost::result_of(Param0, Param1, const ArgPack&)>::type boost::graph::isomorphism_with_named_params(const Param0&, const Param1&, const ArgPack&) [with Param0 = boost::adjacency_list >; Param1 = boost::adjacency_list >; ArgPack = boost::parameter::aux::arg_list >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&> >, boost::parameter::aux::empty_arg_list, std::integral_constant >; typename boost::result_of(Param0, Param1, const ArgPack&)>::type = bool]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/isomorphism.hpp:666:1: required from ‘typename boost::result_of(Param0, Param1, const typename boost::detail::convert_bgl_params_to_boost_parameter >::type&)>::type boost::isomorphism(const Param0&, const Param1&, const bgl_named_params&) [with Param0 = adjacency_list >; Param1 = adjacency_list >; P = iterator_property_map<__gnu_cxx::__normal_iterator >, adj_list_vertex_property_map >, int, int&, vertex_index_t>, void*, void*&>; T = vertex_isomorphism_t; R = no_property; typename result_of(Param0, Param1, const typename detail::convert_bgl_params_to_boost_parameter >::type&)>::type = bool; typename detail::convert_bgl_params_to_boost_parameter >::type = parameter::aux::arg_list >, adj_list_vertex_property_map >, int, int&, vertex_index_t>, void*, void*&> >, parameter::aux::empty_arg_list, std::integral_constant >]’ ordering.cpp:68:18: required from here /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::range_detail::BidirectionalIteratorConcept::~BidirectionalIteratorConcept() [with Iterator = __gnu_cxx::__normal_iterator*, std::vector, std::allocator > > >]’ 37 | ~model() | ^ /home/omnipath/local/R/4.4-3.20/BH/include/boost/range/concepts.hpp:224:14: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 224 | BOOST_CONCEPT_USAGE(BidirectionalIteratorConcept) | ^~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::range_detail::BidirectionalIteratorConcept<__gnu_cxx::__normal_iterator*, std::vector, std::allocator > > > >]’: /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements*, std::vector, std::allocator > > > > >]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/range/concepts.hpp:224:14: required from ‘struct boost::range_detail::BidirectionalIteratorConcept<__gnu_cxx::__normal_iterator*, std::vector, std::allocator > > > >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::range_detail::BidirectionalIteratorConcept<__gnu_cxx::__normal_iterator*, std::vector, std::allocator > > > >]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied*, std::vector, std::allocator > > > > >::value’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied*, std::vector, std::allocator > > > > >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:72:8: [ skipping 8 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/isomorphism.hpp:226:17: required from ‘bool boost::detail::isomorphism_algo::test_isomorphism() [with Graph1 = boost::adjacency_list >; Graph2 = boost::adjacency_list >; IsoMapping = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&>; Invariant1 = boost::degree_vertex_invariant >, int, const int&, boost::vertex_index_t> >, boost::adjacency_list > >; Invariant2 = boost::degree_vertex_invariant >, int, const int&, boost::vertex_index_t> >, boost::adjacency_list > >; IndexMap1 = boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>; IndexMap2 = boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/isomorphism.hpp:532:33: required from ‘bool boost::isomorphism(const Graph1&, const Graph2&, IsoMapping, Invariant1, Invariant2, std::size_t, IndexMap1, IndexMap2) [with Graph1 = adjacency_list >; Graph2 = adjacency_list >; IsoMapping = iterator_property_map<__gnu_cxx::__normal_iterator >, adj_list_vertex_property_map >, int, int&, vertex_index_t>, void*, void*&>; Invariant1 = degree_vertex_invariant >, int, const int&, vertex_index_t> >, adjacency_list > >; Invariant2 = degree_vertex_invariant >, int, const int&, vertex_index_t> >, adjacency_list > >; IndexMap1 = adj_list_vertex_property_map >, int, const int&, vertex_index_t>; IndexMap2 = adj_list_vertex_property_map >, int, const int&, vertex_index_t>; std::size_t = long unsigned int]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/isomorphism.hpp:651:42: required from ‘bool boost::graph::detail::isomorphism_impl::operator()(const Graph1&, const Graph2&, const ArgPack&) const [with ArgPack = boost::parameter::aux::arg_list >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&> >, boost::parameter::aux::empty_arg_list, std::integral_constant >; Graph1 = boost::adjacency_list >; Graph2 = boost::adjacency_list >]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/isomorphism.hpp:662:5: required from ‘typename boost::result_of(Param0, Param1, const ArgPack&)>::type boost::graph::isomorphism_with_named_params(const Param0&, const Param1&, const ArgPack&) [with Param0 = boost::adjacency_list >; Param1 = boost::adjacency_list >; ArgPack = boost::parameter::aux::arg_list >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&> >, boost::parameter::aux::empty_arg_list, std::integral_constant >; typename boost::result_of(Param0, Param1, const ArgPack&)>::type = bool]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/isomorphism.hpp:666:1: required from ‘typename boost::result_of(Param0, Param1, const typename boost::detail::convert_bgl_params_to_boost_parameter >::type&)>::type boost::isomorphism(const Param0&, const Param1&, const bgl_named_params&) [with Param0 = adjacency_list >; Param1 = adjacency_list >; P = iterator_property_map<__gnu_cxx::__normal_iterator >, adj_list_vertex_property_map >, int, int&, vertex_index_t>, void*, void*&>; T = vertex_isomorphism_t; R = no_property; typename result_of(Param0, Param1, const typename detail::convert_bgl_params_to_boost_parameter >::type&)>::type = bool; typename detail::convert_bgl_params_to_boost_parameter >::type = parameter::aux::arg_list >, adj_list_vertex_property_map >, int, int&, vertex_index_t>, void*, void*&> >, parameter::aux::empty_arg_list, std::integral_constant >]’ ordering.cpp:68:18: required from here /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::range_detail::BidirectionalIteratorConcept::~BidirectionalIteratorConcept() [with Iterator = __gnu_cxx::__normal_iterator*, std::vector, std::allocator > > >]’ 37 | ~model() | ^ /home/omnipath/local/R/4.4-3.20/BH/include/boost/range/concepts.hpp:224:14: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 224 | BOOST_CONCEPT_USAGE(BidirectionalIteratorConcept) | ^~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::range_detail::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator*, std::vector, std::allocator > > > >]’: /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements*, std::vector, std::allocator > > > > >]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/range/concepts.hpp:245:14: required from ‘struct boost::range_detail::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator*, std::vector, std::allocator > > > >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::range_detail::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator*, std::vector, std::allocator > > > >]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied*, std::vector, std::allocator > > > > >::value’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied*, std::vector, std::allocator > > > > >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:72:8: [ skipping 7 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/isomorphism.hpp:226:17: required from ‘bool boost::detail::isomorphism_algo::test_isomorphism() [with Graph1 = boost::adjacency_list >; Graph2 = boost::adjacency_list >; IsoMapping = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&>; Invariant1 = boost::degree_vertex_invariant >, int, const int&, boost::vertex_index_t> >, boost::adjacency_list > >; Invariant2 = boost::degree_vertex_invariant >, int, const int&, boost::vertex_index_t> >, boost::adjacency_list > >; IndexMap1 = boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>; IndexMap2 = boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/isomorphism.hpp:532:33: required from ‘bool boost::isomorphism(const Graph1&, const Graph2&, IsoMapping, Invariant1, Invariant2, std::size_t, IndexMap1, IndexMap2) [with Graph1 = adjacency_list >; Graph2 = adjacency_list >; IsoMapping = iterator_property_map<__gnu_cxx::__normal_iterator >, adj_list_vertex_property_map >, int, int&, vertex_index_t>, void*, void*&>; Invariant1 = degree_vertex_invariant >, int, const int&, vertex_index_t> >, adjacency_list > >; Invariant2 = degree_vertex_invariant >, int, const int&, vertex_index_t> >, adjacency_list > >; IndexMap1 = adj_list_vertex_property_map >, int, const int&, vertex_index_t>; IndexMap2 = adj_list_vertex_property_map >, int, const int&, vertex_index_t>; std::size_t = long unsigned int]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/isomorphism.hpp:651:42: required from ‘bool boost::graph::detail::isomorphism_impl::operator()(const Graph1&, const Graph2&, const ArgPack&) const [with ArgPack = boost::parameter::aux::arg_list >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&> >, boost::parameter::aux::empty_arg_list, std::integral_constant >; Graph1 = boost::adjacency_list >; Graph2 = boost::adjacency_list >]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/isomorphism.hpp:662:5: required from ‘typename boost::result_of(Param0, Param1, const ArgPack&)>::type boost::graph::isomorphism_with_named_params(const Param0&, const Param1&, const ArgPack&) [with Param0 = boost::adjacency_list >; Param1 = boost::adjacency_list >; ArgPack = boost::parameter::aux::arg_list >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&> >, boost::parameter::aux::empty_arg_list, std::integral_constant >; typename boost::result_of(Param0, Param1, const ArgPack&)>::type = bool]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/isomorphism.hpp:666:1: required from ‘typename boost::result_of(Param0, Param1, const typename boost::detail::convert_bgl_params_to_boost_parameter >::type&)>::type boost::isomorphism(const Param0&, const Param1&, const bgl_named_params&) [with Param0 = adjacency_list >; Param1 = adjacency_list >; P = iterator_property_map<__gnu_cxx::__normal_iterator >, adj_list_vertex_property_map >, int, int&, vertex_index_t>, void*, void*&>; T = vertex_isomorphism_t; R = no_property; typename result_of(Param0, Param1, const typename detail::convert_bgl_params_to_boost_parameter >::type&)>::type = bool; typename detail::convert_bgl_params_to_boost_parameter >::type = parameter::aux::arg_list >, adj_list_vertex_property_map >, int, int&, vertex_index_t>, void*, void*&> >, parameter::aux::empty_arg_list, std::integral_constant >]’ ordering.cpp:68:18: required from here /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::range_detail::RandomAccessIteratorConcept::~RandomAccessIteratorConcept() [with Iterator = __gnu_cxx::__normal_iterator*, std::vector, std::allocator > > >]’ 37 | ~model() | ^ /home/omnipath/local/R/4.4-3.20/BH/include/boost/range/concepts.hpp:245:14: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 245 | BOOST_CONCEPT_USAGE(RandomAccessIteratorConcept) | ^~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::range_detail::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator*, std::vector, std::allocator > > > >]’: /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements*, std::vector, std::allocator > > > > >]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/range/concepts.hpp:245:14: required from ‘struct boost::range_detail::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator*, std::vector, std::allocator > > > >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::range_detail::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator*, std::vector, std::allocator > > > >]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied*, std::vector, std::allocator > > > > >::value’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied*, std::vector, std::allocator > > > > >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:72:8: [ skipping 7 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/isomorphism.hpp:226:17: required from ‘bool boost::detail::isomorphism_algo::test_isomorphism() [with Graph1 = boost::adjacency_list >; Graph2 = boost::adjacency_list >; IsoMapping = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&>; Invariant1 = boost::degree_vertex_invariant >, int, const int&, boost::vertex_index_t> >, boost::adjacency_list > >; Invariant2 = boost::degree_vertex_invariant >, int, const int&, boost::vertex_index_t> >, boost::adjacency_list > >; IndexMap1 = boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>; IndexMap2 = boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/isomorphism.hpp:532:33: required from ‘bool boost::isomorphism(const Graph1&, const Graph2&, IsoMapping, Invariant1, Invariant2, std::size_t, IndexMap1, IndexMap2) [with Graph1 = adjacency_list >; Graph2 = adjacency_list >; IsoMapping = iterator_property_map<__gnu_cxx::__normal_iterator >, adj_list_vertex_property_map >, int, int&, vertex_index_t>, void*, void*&>; Invariant1 = degree_vertex_invariant >, int, const int&, vertex_index_t> >, adjacency_list > >; Invariant2 = degree_vertex_invariant >, int, const int&, vertex_index_t> >, adjacency_list > >; IndexMap1 = adj_list_vertex_property_map >, int, const int&, vertex_index_t>; IndexMap2 = adj_list_vertex_property_map >, int, const int&, vertex_index_t>; std::size_t = long unsigned int]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/isomorphism.hpp:651:42: required from ‘bool boost::graph::detail::isomorphism_impl::operator()(const Graph1&, const Graph2&, const ArgPack&) const [with ArgPack = boost::parameter::aux::arg_list >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&> >, boost::parameter::aux::empty_arg_list, std::integral_constant >; Graph1 = boost::adjacency_list >; Graph2 = boost::adjacency_list >]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/isomorphism.hpp:662:5: required from ‘typename boost::result_of(Param0, Param1, const ArgPack&)>::type boost::graph::isomorphism_with_named_params(const Param0&, const Param1&, const ArgPack&) [with Param0 = boost::adjacency_list >; Param1 = boost::adjacency_list >; ArgPack = boost::parameter::aux::arg_list >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&> >, boost::parameter::aux::empty_arg_list, std::integral_constant >; typename boost::result_of(Param0, Param1, const ArgPack&)>::type = bool]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/isomorphism.hpp:666:1: required from ‘typename boost::result_of(Param0, Param1, const typename boost::detail::convert_bgl_params_to_boost_parameter >::type&)>::type boost::isomorphism(const Param0&, const Param1&, const bgl_named_params&) [with Param0 = adjacency_list >; Param1 = adjacency_list >; P = iterator_property_map<__gnu_cxx::__normal_iterator >, adj_list_vertex_property_map >, int, int&, vertex_index_t>, void*, void*&>; T = vertex_isomorphism_t; R = no_property; typename result_of(Param0, Param1, const typename detail::convert_bgl_params_to_boost_parameter >::type&)>::type = bool; typename detail::convert_bgl_params_to_boost_parameter >::type = parameter::aux::arg_list >, adj_list_vertex_property_map >, int, int&, vertex_index_t>, void*, void*&> >, parameter::aux::empty_arg_list, std::integral_constant >]’ ordering.cpp:68:18: required from here /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::range_detail::RandomAccessIteratorConcept::~RandomAccessIteratorConcept() [with Iterator = __gnu_cxx::__normal_iterator*, std::vector, std::allocator > > >]’ 37 | ~model() | ^ /home/omnipath/local/R/4.4-3.20/BH/include/boost/range/concepts.hpp:245:14: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 245 | BOOST_CONCEPT_USAGE(RandomAccessIteratorConcept) | ^~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements >, void*, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator >, boost::no_property>*, std::vector >, boost::no_property>, std::allocator >, boost::no_property> > > >, void*, boost::detail::edge_desc_impl, long int>, long int> > >]’: /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:167:5: required from ‘struct boost::CopyConstructible >, void*, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator >, boost::no_property>*, std::vector >, boost::no_property>, std::allocator >, boost::no_property> > > >, void*, boost::detail::edge_desc_impl, long int>, long int> >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/range/concepts.hpp:125:16: required from ‘struct boost::range_detail::IncrementableIteratorConcept >, void*, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator >, boost::no_property>*, std::vector >, boost::no_property>, std::allocator >, boost::no_property> > > >, void*, boost::detail::edge_desc_impl, long int>, long int> >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/range/concepts.hpp:147:16: required from ‘struct boost::range_detail::SinglePassIteratorConcept >, void*, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator >, boost::no_property>*, std::vector >, boost::no_property>, std::allocator >, boost::no_property> > > >, void*, boost::detail::edge_desc_impl, long int>, long int> >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::range_detail::SinglePassIteratorConcept >, void*, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator >, boost::no_property>*, std::vector >, boost::no_property>, std::allocator >, boost::no_property> > > >, void*, boost::detail::edge_desc_impl, long int>, long int> >]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied >, void*, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator >, boost::no_property>*, std::vector >, boost::no_property>, std::allocator >, boost::no_property> > > >, void*, boost::detail::edge_desc_impl, long int>, long int> > >::value’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:45:51: [ skipping 9 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/isomorphism.hpp:229:26: required from ‘bool boost::detail::isomorphism_algo::test_isomorphism() [with Graph1 = boost::adjacency_list >; Graph2 = boost::adjacency_list >; IsoMapping = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&>; Invariant1 = boost::degree_vertex_invariant >, int, const int&, boost::vertex_index_t> >, boost::adjacency_list > >; Invariant2 = boost::degree_vertex_invariant >, int, const int&, boost::vertex_index_t> >, boost::adjacency_list > >; IndexMap1 = boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>; IndexMap2 = boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/isomorphism.hpp:532:33: required from ‘bool boost::isomorphism(const Graph1&, const Graph2&, IsoMapping, Invariant1, Invariant2, std::size_t, IndexMap1, IndexMap2) [with Graph1 = adjacency_list >; Graph2 = adjacency_list >; IsoMapping = iterator_property_map<__gnu_cxx::__normal_iterator >, adj_list_vertex_property_map >, int, int&, vertex_index_t>, void*, void*&>; Invariant1 = degree_vertex_invariant >, int, const int&, vertex_index_t> >, adjacency_list > >; Invariant2 = degree_vertex_invariant >, int, const int&, vertex_index_t> >, adjacency_list > >; IndexMap1 = adj_list_vertex_property_map >, int, const int&, vertex_index_t>; IndexMap2 = adj_list_vertex_property_map >, int, const int&, vertex_index_t>; std::size_t = long unsigned int]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/isomorphism.hpp:651:42: required from ‘bool boost::graph::detail::isomorphism_impl::operator()(const Graph1&, const Graph2&, const ArgPack&) const [with ArgPack = boost::parameter::aux::arg_list >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&> >, boost::parameter::aux::empty_arg_list, std::integral_constant >; Graph1 = boost::adjacency_list >; Graph2 = boost::adjacency_list >]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/isomorphism.hpp:662:5: required from ‘typename boost::result_of(Param0, Param1, const ArgPack&)>::type boost::graph::isomorphism_with_named_params(const Param0&, const Param1&, const ArgPack&) [with Param0 = boost::adjacency_list >; Param1 = boost::adjacency_list >; ArgPack = boost::parameter::aux::arg_list >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&> >, boost::parameter::aux::empty_arg_list, std::integral_constant >; typename boost::result_of(Param0, Param1, const ArgPack&)>::type = bool]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/isomorphism.hpp:666:1: required from ‘typename boost::result_of(Param0, Param1, const typename boost::detail::convert_bgl_params_to_boost_parameter >::type&)>::type boost::isomorphism(const Param0&, const Param1&, const bgl_named_params&) [with Param0 = adjacency_list >; Param1 = adjacency_list >; P = iterator_property_map<__gnu_cxx::__normal_iterator >, adj_list_vertex_property_map >, int, int&, vertex_index_t>, void*, void*&>; T = vertex_isomorphism_t; R = no_property; typename result_of(Param0, Param1, const typename detail::convert_bgl_params_to_boost_parameter >::type&)>::type = bool; typename detail::convert_bgl_params_to_boost_parameter >::type = parameter::aux::arg_list >, adj_list_vertex_property_map >, int, int&, vertex_index_t>, void*, void*&> >, parameter::aux::empty_arg_list, std::integral_constant >]’ ordering.cpp:68:18: required from here /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::CopyConstructible >, void*, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator >, boost::no_property>*, std::vector >, boost::no_property>, std::allocator >, boost::no_property> > > >, void*, boost::detail::edge_desc_impl, long int>, long int> >]’ 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ^ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements, boost::iterators::incrementable_traversal_tag> >]’: /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:208:5: required from ‘struct boost::Convertible, boost::iterators::incrementable_traversal_tag>’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::Convertible, boost::iterators::incrementable_traversal_tag>]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied, boost::iterators::incrementable_traversal_tag> >::value’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied, boost::iterators::incrementable_traversal_tag> >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_, boost::iterators::incrementable_traversal_tag>)>’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/iterator/iterator_concepts.hpp:114:7: [ skipping 13 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/isomorphism.hpp:229:26: required from ‘bool boost::detail::isomorphism_algo::test_isomorphism() [with Graph1 = boost::adjacency_list >; Graph2 = boost::adjacency_list >; IsoMapping = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&>; Invariant1 = boost::degree_vertex_invariant >, int, const int&, boost::vertex_index_t> >, boost::adjacency_list > >; Invariant2 = boost::degree_vertex_invariant >, int, const int&, boost::vertex_index_t> >, boost::adjacency_list > >; IndexMap1 = boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>; IndexMap2 = boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/isomorphism.hpp:532:33: required from ‘bool boost::isomorphism(const Graph1&, const Graph2&, IsoMapping, Invariant1, Invariant2, std::size_t, IndexMap1, IndexMap2) [with Graph1 = adjacency_list >; Graph2 = adjacency_list >; IsoMapping = iterator_property_map<__gnu_cxx::__normal_iterator >, adj_list_vertex_property_map >, int, int&, vertex_index_t>, void*, void*&>; Invariant1 = degree_vertex_invariant >, int, const int&, vertex_index_t> >, adjacency_list > >; Invariant2 = degree_vertex_invariant >, int, const int&, vertex_index_t> >, adjacency_list > >; IndexMap1 = adj_list_vertex_property_map >, int, const int&, vertex_index_t>; IndexMap2 = adj_list_vertex_property_map >, int, const int&, vertex_index_t>; std::size_t = long unsigned int]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/isomorphism.hpp:651:42: required from ‘bool boost::graph::detail::isomorphism_impl::operator()(const Graph1&, const Graph2&, const ArgPack&) const [with ArgPack = boost::parameter::aux::arg_list >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&> >, boost::parameter::aux::empty_arg_list, std::integral_constant >; Graph1 = boost::adjacency_list >; Graph2 = boost::adjacency_list >]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/isomorphism.hpp:662:5: required from ‘typename boost::result_of(Param0, Param1, const ArgPack&)>::type boost::graph::isomorphism_with_named_params(const Param0&, const Param1&, const ArgPack&) [with Param0 = boost::adjacency_list >; Param1 = boost::adjacency_list >; ArgPack = boost::parameter::aux::arg_list >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&> >, boost::parameter::aux::empty_arg_list, std::integral_constant >; typename boost::result_of(Param0, Param1, const ArgPack&)>::type = bool]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/isomorphism.hpp:666:1: required from ‘typename boost::result_of(Param0, Param1, const typename boost::detail::convert_bgl_params_to_boost_parameter >::type&)>::type boost::isomorphism(const Param0&, const Param1&, const bgl_named_params&) [with Param0 = adjacency_list >; Param1 = adjacency_list >; P = iterator_property_map<__gnu_cxx::__normal_iterator >, adj_list_vertex_property_map >, int, int&, vertex_index_t>, void*, void*&>; T = vertex_isomorphism_t; R = no_property; typename result_of(Param0, Param1, const typename detail::convert_bgl_params_to_boost_parameter >::type&)>::type = bool; typename detail::convert_bgl_params_to_boost_parameter >::type = parameter::aux::arg_list >, adj_list_vertex_property_map >, int, int&, vertex_index_t>, void*, void*&> >, parameter::aux::empty_arg_list, std::integral_constant >]’ ordering.cpp:68:18: required from here /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::Convertible, boost::iterators::incrementable_traversal_tag>]’ 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ^ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::Convertible, boost::iterators::incrementable_traversal_tag>]’: /home/omnipath/local/R/4.4-3.20/BH/include/boost/iterator/iterator_concepts.hpp:114:7: required from ‘struct boost::range_detail::IncrementableIteratorConcept >, void*, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator >, boost::no_property>*, std::vector >, boost::no_property>, std::allocator >, boost::no_property> > > >, void*, boost::detail::edge_desc_impl, long int>, long int> >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/range/concepts.hpp:147:16: required from ‘struct boost::range_detail::SinglePassIteratorConcept >, void*, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator >, boost::no_property>*, std::vector >, boost::no_property>, std::allocator >, boost::no_property> > > >, void*, boost::detail::edge_desc_impl, long int>, long int> >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::range_detail::SinglePassIteratorConcept >, void*, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator >, boost::no_property>*, std::vector >, boost::no_property>, std::allocator >, boost::no_property> > > >, void*, boost::detail::edge_desc_impl, long int>, long int> >]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied >, void*, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator >, boost::no_property>*, std::vector >, boost::no_property>, std::allocator >, boost::no_property> > > >, void*, boost::detail::edge_desc_impl, long int>, long int> > >::value’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied >, void*, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator >, boost::no_property>*, std::vector >, boost::no_property>, std::allocator >, boost::no_property> > > >, void*, boost::detail::edge_desc_impl, long int>, long int> > >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:72:8: [ skipping 8 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/isomorphism.hpp:229:26: required from ‘bool boost::detail::isomorphism_algo::test_isomorphism() [with Graph1 = boost::adjacency_list >; Graph2 = boost::adjacency_list >; IsoMapping = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&>; Invariant1 = boost::degree_vertex_invariant >, int, const int&, boost::vertex_index_t> >, boost::adjacency_list > >; Invariant2 = boost::degree_vertex_invariant >, int, const int&, boost::vertex_index_t> >, boost::adjacency_list > >; IndexMap1 = boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>; IndexMap2 = boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/isomorphism.hpp:532:33: required from ‘bool boost::isomorphism(const Graph1&, const Graph2&, IsoMapping, Invariant1, Invariant2, std::size_t, IndexMap1, IndexMap2) [with Graph1 = adjacency_list >; Graph2 = adjacency_list >; IsoMapping = iterator_property_map<__gnu_cxx::__normal_iterator >, adj_list_vertex_property_map >, int, int&, vertex_index_t>, void*, void*&>; Invariant1 = degree_vertex_invariant >, int, const int&, vertex_index_t> >, adjacency_list > >; Invariant2 = degree_vertex_invariant >, int, const int&, vertex_index_t> >, adjacency_list > >; IndexMap1 = adj_list_vertex_property_map >, int, const int&, vertex_index_t>; IndexMap2 = adj_list_vertex_property_map >, int, const int&, vertex_index_t>; std::size_t = long unsigned int]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/isomorphism.hpp:651:42: required from ‘bool boost::graph::detail::isomorphism_impl::operator()(const Graph1&, const Graph2&, const ArgPack&) const [with ArgPack = boost::parameter::aux::arg_list >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&> >, boost::parameter::aux::empty_arg_list, std::integral_constant >; Graph1 = boost::adjacency_list >; Graph2 = boost::adjacency_list >]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/isomorphism.hpp:662:5: required from ‘typename boost::result_of(Param0, Param1, const ArgPack&)>::type boost::graph::isomorphism_with_named_params(const Param0&, const Param1&, const ArgPack&) [with Param0 = boost::adjacency_list >; Param1 = boost::adjacency_list >; ArgPack = boost::parameter::aux::arg_list >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&> >, boost::parameter::aux::empty_arg_list, std::integral_constant >; typename boost::result_of(Param0, Param1, const ArgPack&)>::type = bool]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/isomorphism.hpp:666:1: required from ‘typename boost::result_of(Param0, Param1, const typename boost::detail::convert_bgl_params_to_boost_parameter >::type&)>::type boost::isomorphism(const Param0&, const Param1&, const bgl_named_params&) [with Param0 = adjacency_list >; Param1 = adjacency_list >; P = iterator_property_map<__gnu_cxx::__normal_iterator >, adj_list_vertex_property_map >, int, int&, vertex_index_t>, void*, void*&>; T = vertex_isomorphism_t; R = no_property; typename result_of(Param0, Param1, const typename detail::convert_bgl_params_to_boost_parameter >::type&)>::type = bool; typename detail::convert_bgl_params_to_boost_parameter >::type = parameter::aux::arg_list >, adj_list_vertex_property_map >, int, int&, vertex_index_t>, void*, void*&> >, parameter::aux::empty_arg_list, std::integral_constant >]’ ordering.cpp:68:18: required from here /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::Convertible::~Convertible() [with X = boost::iterators::detail::iterator_category_with_traversal; Y = boost::iterators::incrementable_traversal_tag]’ 37 | ~model() | ^ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:208:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 208 | BOOST_CONCEPT_USAGE(Convertible) { | ^~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements >, void*, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator >, boost::no_property>*, std::vector >, boost::no_property>, std::allocator >, boost::no_property> > > >, void*, boost::detail::edge_desc_impl, long int>, long int> > >]’: /home/omnipath/local/R/4.4-3.20/BH/include/boost/range/concepts.hpp:136:13: required from ‘struct boost::range_detail::IncrementableIteratorConcept >, void*, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator >, boost::no_property>*, std::vector >, boost::no_property>, std::allocator >, boost::no_property> > > >, void*, boost::detail::edge_desc_impl, long int>, long int> >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/range/concepts.hpp:147:16: required from ‘struct boost::range_detail::SinglePassIteratorConcept >, void*, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator >, boost::no_property>*, std::vector >, boost::no_property>, std::allocator >, boost::no_property> > > >, void*, boost::detail::edge_desc_impl, long int>, long int> >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::range_detail::SinglePassIteratorConcept >, void*, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator >, boost::no_property>*, std::vector >, boost::no_property>, std::allocator >, boost::no_property> > > >, void*, boost::detail::edge_desc_impl, long int>, long int> >]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied >, void*, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator >, boost::no_property>*, std::vector >, boost::no_property>, std::allocator >, boost::no_property> > > >, void*, boost::detail::edge_desc_impl, long int>, long int> > >::value’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied >, void*, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator >, boost::no_property>*, std::vector >, boost::no_property>, std::allocator >, boost::no_property> > > >, void*, boost::detail::edge_desc_impl, long int>, long int> > >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:72:8: [ skipping 8 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/isomorphism.hpp:229:26: required from ‘bool boost::detail::isomorphism_algo::test_isomorphism() [with Graph1 = boost::adjacency_list >; Graph2 = boost::adjacency_list >; IsoMapping = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&>; Invariant1 = boost::degree_vertex_invariant >, int, const int&, boost::vertex_index_t> >, boost::adjacency_list > >; Invariant2 = boost::degree_vertex_invariant >, int, const int&, boost::vertex_index_t> >, boost::adjacency_list > >; IndexMap1 = boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>; IndexMap2 = boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/isomorphism.hpp:532:33: required from ‘bool boost::isomorphism(const Graph1&, const Graph2&, IsoMapping, Invariant1, Invariant2, std::size_t, IndexMap1, IndexMap2) [with Graph1 = adjacency_list >; Graph2 = adjacency_list >; IsoMapping = iterator_property_map<__gnu_cxx::__normal_iterator >, adj_list_vertex_property_map >, int, int&, vertex_index_t>, void*, void*&>; Invariant1 = degree_vertex_invariant >, int, const int&, vertex_index_t> >, adjacency_list > >; Invariant2 = degree_vertex_invariant >, int, const int&, vertex_index_t> >, adjacency_list > >; IndexMap1 = adj_list_vertex_property_map >, int, const int&, vertex_index_t>; IndexMap2 = adj_list_vertex_property_map >, int, const int&, vertex_index_t>; std::size_t = long unsigned int]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/isomorphism.hpp:651:42: required from ‘bool boost::graph::detail::isomorphism_impl::operator()(const Graph1&, const Graph2&, const ArgPack&) const [with ArgPack = boost::parameter::aux::arg_list >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&> >, boost::parameter::aux::empty_arg_list, std::integral_constant >; Graph1 = boost::adjacency_list >; Graph2 = boost::adjacency_list >]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/isomorphism.hpp:662:5: required from ‘typename boost::result_of(Param0, Param1, const ArgPack&)>::type boost::graph::isomorphism_with_named_params(const Param0&, const Param1&, const ArgPack&) [with Param0 = boost::adjacency_list >; Param1 = boost::adjacency_list >; ArgPack = boost::parameter::aux::arg_list >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&> >, boost::parameter::aux::empty_arg_list, std::integral_constant >; typename boost::result_of(Param0, Param1, const ArgPack&)>::type = bool]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/isomorphism.hpp:666:1: required from ‘typename boost::result_of(Param0, Param1, const typename boost::detail::convert_bgl_params_to_boost_parameter >::type&)>::type boost::isomorphism(const Param0&, const Param1&, const bgl_named_params&) [with Param0 = adjacency_list >; Param1 = adjacency_list >; P = iterator_property_map<__gnu_cxx::__normal_iterator >, adj_list_vertex_property_map >, int, int&, vertex_index_t>, void*, void*&>; T = vertex_isomorphism_t; R = no_property; typename result_of(Param0, Param1, const typename detail::convert_bgl_params_to_boost_parameter >::type&)>::type = bool; typename detail::convert_bgl_params_to_boost_parameter >::type = parameter::aux::arg_list >, adj_list_vertex_property_map >, int, int&, vertex_index_t>, void*, void*&> >, parameter::aux::empty_arg_list, std::integral_constant >]’ ordering.cpp:68:18: required from here /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::range_detail::IncrementableIteratorConcept >, void*, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator >, boost::no_property>*, std::vector >, boost::no_property>, std::allocator >, boost::no_property> > > >, void*, boost::detail::edge_desc_impl, long int>, long int> >]’ 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ^ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements >, void*, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator >, boost::no_property>*, std::vector >, boost::no_property>, std::allocator >, boost::no_property> > > >, void*, boost::detail::edge_desc_impl, long int>, long int> > >]’: /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:233:5: required from ‘struct boost::EqualityComparable >, void*, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator >, boost::no_property>*, std::vector >, boost::no_property>, std::allocator >, boost::no_property> > > >, void*, boost::detail::edge_desc_impl, long int>, long int> >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/range/concepts.hpp:147:16: required from ‘struct boost::range_detail::SinglePassIteratorConcept >, void*, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator >, boost::no_property>*, std::vector >, boost::no_property>, std::allocator >, boost::no_property> > > >, void*, boost::detail::edge_desc_impl, long int>, long int> >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::range_detail::SinglePassIteratorConcept >, void*, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator >, boost::no_property>*, std::vector >, boost::no_property>, std::allocator >, boost::no_property> > > >, void*, boost::detail::edge_desc_impl, long int>, long int> >]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied >, void*, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator >, boost::no_property>*, std::vector >, boost::no_property>, std::allocator >, boost::no_property> > > >, void*, boost::detail::edge_desc_impl, long int>, long int> > >::value’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied >, void*, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator >, boost::no_property>*, std::vector >, boost::no_property>, std::allocator >, boost::no_property> > > >, void*, boost::detail::edge_desc_impl, long int>, long int> > >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:72:8: [ skipping 8 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/isomorphism.hpp:229:26: required from ‘bool boost::detail::isomorphism_algo::test_isomorphism() [with Graph1 = boost::adjacency_list >; Graph2 = boost::adjacency_list >; IsoMapping = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&>; Invariant1 = boost::degree_vertex_invariant >, int, const int&, boost::vertex_index_t> >, boost::adjacency_list > >; Invariant2 = boost::degree_vertex_invariant >, int, const int&, boost::vertex_index_t> >, boost::adjacency_list > >; IndexMap1 = boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>; IndexMap2 = boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/isomorphism.hpp:532:33: required from ‘bool boost::isomorphism(const Graph1&, const Graph2&, IsoMapping, Invariant1, Invariant2, std::size_t, IndexMap1, IndexMap2) [with Graph1 = adjacency_list >; Graph2 = adjacency_list >; IsoMapping = iterator_property_map<__gnu_cxx::__normal_iterator >, adj_list_vertex_property_map >, int, int&, vertex_index_t>, void*, void*&>; Invariant1 = degree_vertex_invariant >, int, const int&, vertex_index_t> >, adjacency_list > >; Invariant2 = degree_vertex_invariant >, int, const int&, vertex_index_t> >, adjacency_list > >; IndexMap1 = adj_list_vertex_property_map >, int, const int&, vertex_index_t>; IndexMap2 = adj_list_vertex_property_map >, int, const int&, vertex_index_t>; std::size_t = long unsigned int]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/isomorphism.hpp:651:42: required from ‘bool boost::graph::detail::isomorphism_impl::operator()(const Graph1&, const Graph2&, const ArgPack&) const [with ArgPack = boost::parameter::aux::arg_list >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&> >, boost::parameter::aux::empty_arg_list, std::integral_constant >; Graph1 = boost::adjacency_list >; Graph2 = boost::adjacency_list >]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/isomorphism.hpp:662:5: required from ‘typename boost::result_of(Param0, Param1, const ArgPack&)>::type boost::graph::isomorphism_with_named_params(const Param0&, const Param1&, const ArgPack&) [with Param0 = boost::adjacency_list >; Param1 = boost::adjacency_list >; ArgPack = boost::parameter::aux::arg_list >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&> >, boost::parameter::aux::empty_arg_list, std::integral_constant >; typename boost::result_of(Param0, Param1, const ArgPack&)>::type = bool]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/isomorphism.hpp:666:1: required from ‘typename boost::result_of(Param0, Param1, const typename boost::detail::convert_bgl_params_to_boost_parameter >::type&)>::type boost::isomorphism(const Param0&, const Param1&, const bgl_named_params&) [with Param0 = adjacency_list >; Param1 = adjacency_list >; P = iterator_property_map<__gnu_cxx::__normal_iterator >, adj_list_vertex_property_map >, int, int&, vertex_index_t>, void*, void*&>; T = vertex_isomorphism_t; R = no_property; typename result_of(Param0, Param1, const typename detail::convert_bgl_params_to_boost_parameter >::type&)>::type = bool; typename detail::convert_bgl_params_to_boost_parameter >::type = parameter::aux::arg_list >, adj_list_vertex_property_map >, int, int&, vertex_index_t>, void*, void*&> >, parameter::aux::empty_arg_list, std::integral_constant >]’ ordering.cpp:68:18: required from here /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::EqualityComparable >, void*, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator >, boost::no_property>*, std::vector >, boost::no_property>, std::allocator >, boost::no_property> > > >, void*, boost::detail::edge_desc_impl, long int>, long int> >]’ 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ^ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements, boost::iterators::single_pass_traversal_tag> >]’: /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:208:5: required from ‘struct boost::Convertible, boost::iterators::single_pass_traversal_tag>’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::Convertible, boost::iterators::single_pass_traversal_tag>]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied, boost::iterators::single_pass_traversal_tag> >::value’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied, boost::iterators::single_pass_traversal_tag> >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_, boost::iterators::single_pass_traversal_tag>)>’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/range/concepts.hpp:152:13: [ skipping 12 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/isomorphism.hpp:229:26: required from ‘bool boost::detail::isomorphism_algo::test_isomorphism() [with Graph1 = boost::adjacency_list >; Graph2 = boost::adjacency_list >; IsoMapping = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&>; Invariant1 = boost::degree_vertex_invariant >, int, const int&, boost::vertex_index_t> >, boost::adjacency_list > >; Invariant2 = boost::degree_vertex_invariant >, int, const int&, boost::vertex_index_t> >, boost::adjacency_list > >; IndexMap1 = boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>; IndexMap2 = boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/isomorphism.hpp:532:33: required from ‘bool boost::isomorphism(const Graph1&, const Graph2&, IsoMapping, Invariant1, Invariant2, std::size_t, IndexMap1, IndexMap2) [with Graph1 = adjacency_list >; Graph2 = adjacency_list >; IsoMapping = iterator_property_map<__gnu_cxx::__normal_iterator >, adj_list_vertex_property_map >, int, int&, vertex_index_t>, void*, void*&>; Invariant1 = degree_vertex_invariant >, int, const int&, vertex_index_t> >, adjacency_list > >; Invariant2 = degree_vertex_invariant >, int, const int&, vertex_index_t> >, adjacency_list > >; IndexMap1 = adj_list_vertex_property_map >, int, const int&, vertex_index_t>; IndexMap2 = adj_list_vertex_property_map >, int, const int&, vertex_index_t>; std::size_t = long unsigned int]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/isomorphism.hpp:651:42: required from ‘bool boost::graph::detail::isomorphism_impl::operator()(const Graph1&, const Graph2&, const ArgPack&) const [with ArgPack = boost::parameter::aux::arg_list >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&> >, boost::parameter::aux::empty_arg_list, std::integral_constant >; Graph1 = boost::adjacency_list >; Graph2 = boost::adjacency_list >]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/isomorphism.hpp:662:5: required from ‘typename boost::result_of(Param0, Param1, const ArgPack&)>::type boost::graph::isomorphism_with_named_params(const Param0&, const Param1&, const ArgPack&) [with Param0 = boost::adjacency_list >; Param1 = boost::adjacency_list >; ArgPack = boost::parameter::aux::arg_list >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&> >, boost::parameter::aux::empty_arg_list, std::integral_constant >; typename boost::result_of(Param0, Param1, const ArgPack&)>::type = bool]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/isomorphism.hpp:666:1: required from ‘typename boost::result_of(Param0, Param1, const typename boost::detail::convert_bgl_params_to_boost_parameter >::type&)>::type boost::isomorphism(const Param0&, const Param1&, const bgl_named_params&) [with Param0 = adjacency_list >; Param1 = adjacency_list >; P = iterator_property_map<__gnu_cxx::__normal_iterator >, adj_list_vertex_property_map >, int, int&, vertex_index_t>, void*, void*&>; T = vertex_isomorphism_t; R = no_property; typename result_of(Param0, Param1, const typename detail::convert_bgl_params_to_boost_parameter >::type&)>::type = bool; typename detail::convert_bgl_params_to_boost_parameter >::type = parameter::aux::arg_list >, adj_list_vertex_property_map >, int, int&, vertex_index_t>, void*, void*&> >, parameter::aux::empty_arg_list, std::integral_constant >]’ ordering.cpp:68:18: required from here /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::Convertible, boost::iterators::single_pass_traversal_tag>]’ 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ^ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::Convertible, boost::iterators::single_pass_traversal_tag>]’: /home/omnipath/local/R/4.4-3.20/BH/include/boost/range/concepts.hpp:152:13: required from ‘struct boost::range_detail::SinglePassIteratorConcept >, void*, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator >, boost::no_property>*, std::vector >, boost::no_property>, std::allocator >, boost::no_property> > > >, void*, boost::detail::edge_desc_impl, long int>, long int> >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::range_detail::SinglePassIteratorConcept >, void*, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator >, boost::no_property>*, std::vector >, boost::no_property>, std::allocator >, boost::no_property> > > >, void*, boost::detail::edge_desc_impl, long int>, long int> >]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied >, void*, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator >, boost::no_property>*, std::vector >, boost::no_property>, std::allocator >, boost::no_property> > > >, void*, boost::detail::edge_desc_impl, long int>, long int> > >::value’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied >, void*, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator >, boost::no_property>*, std::vector >, boost::no_property>, std::allocator >, boost::no_property> > > >, void*, boost::detail::edge_desc_impl, long int>, long int> > >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_ >, void*, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator >, boost::no_property>*, std::vector >, boost::no_property>, std::allocator >, boost::no_property> > > >, void*, boost::detail::edge_desc_impl, long int>, long int> >)>’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/range/concepts.hpp:278:9: [ skipping 7 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/isomorphism.hpp:229:26: required from ‘bool boost::detail::isomorphism_algo::test_isomorphism() [with Graph1 = boost::adjacency_list >; Graph2 = boost::adjacency_list >; IsoMapping = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&>; Invariant1 = boost::degree_vertex_invariant >, int, const int&, boost::vertex_index_t> >, boost::adjacency_list > >; Invariant2 = boost::degree_vertex_invariant >, int, const int&, boost::vertex_index_t> >, boost::adjacency_list > >; IndexMap1 = boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>; IndexMap2 = boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/isomorphism.hpp:532:33: required from ‘bool boost::isomorphism(const Graph1&, const Graph2&, IsoMapping, Invariant1, Invariant2, std::size_t, IndexMap1, IndexMap2) [with Graph1 = adjacency_list >; Graph2 = adjacency_list >; IsoMapping = iterator_property_map<__gnu_cxx::__normal_iterator >, adj_list_vertex_property_map >, int, int&, vertex_index_t>, void*, void*&>; Invariant1 = degree_vertex_invariant >, int, const int&, vertex_index_t> >, adjacency_list > >; Invariant2 = degree_vertex_invariant >, int, const int&, vertex_index_t> >, adjacency_list > >; IndexMap1 = adj_list_vertex_property_map >, int, const int&, vertex_index_t>; IndexMap2 = adj_list_vertex_property_map >, int, const int&, vertex_index_t>; std::size_t = long unsigned int]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/isomorphism.hpp:651:42: required from ‘bool boost::graph::detail::isomorphism_impl::operator()(const Graph1&, const Graph2&, const ArgPack&) const [with ArgPack = boost::parameter::aux::arg_list >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&> >, boost::parameter::aux::empty_arg_list, std::integral_constant >; Graph1 = boost::adjacency_list >; Graph2 = boost::adjacency_list >]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/isomorphism.hpp:662:5: required from ‘typename boost::result_of(Param0, Param1, const ArgPack&)>::type boost::graph::isomorphism_with_named_params(const Param0&, const Param1&, const ArgPack&) [with Param0 = boost::adjacency_list >; Param1 = boost::adjacency_list >; ArgPack = boost::parameter::aux::arg_list >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&> >, boost::parameter::aux::empty_arg_list, std::integral_constant >; typename boost::result_of(Param0, Param1, const ArgPack&)>::type = bool]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/isomorphism.hpp:666:1: required from ‘typename boost::result_of(Param0, Param1, const typename boost::detail::convert_bgl_params_to_boost_parameter >::type&)>::type boost::isomorphism(const Param0&, const Param1&, const bgl_named_params&) [with Param0 = adjacency_list >; Param1 = adjacency_list >; P = iterator_property_map<__gnu_cxx::__normal_iterator >, adj_list_vertex_property_map >, int, int&, vertex_index_t>, void*, void*&>; T = vertex_isomorphism_t; R = no_property; typename result_of(Param0, Param1, const typename detail::convert_bgl_params_to_boost_parameter >::type&)>::type = bool; typename detail::convert_bgl_params_to_boost_parameter >::type = parameter::aux::arg_list >, adj_list_vertex_property_map >, int, int&, vertex_index_t>, void*, void*&> >, parameter::aux::empty_arg_list, std::integral_constant >]’ ordering.cpp:68:18: required from here /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::Convertible::~Convertible() [with X = boost::iterators::detail::iterator_category_with_traversal; Y = boost::iterators::single_pass_traversal_tag]’ 37 | ~model() | ^ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:208:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 208 | BOOST_CONCEPT_USAGE(Convertible) { | ^~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements >, void*, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator >, boost::no_property>*, std::vector >, boost::no_property>, std::allocator >, boost::no_property> > > >, void*, boost::detail::edge_desc_impl, long int>, long int> > >]’: /home/omnipath/local/R/4.4-3.20/BH/include/boost/range/concepts.hpp:158:13: required from ‘struct boost::range_detail::SinglePassIteratorConcept >, void*, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator >, boost::no_property>*, std::vector >, boost::no_property>, std::allocator >, boost::no_property> > > >, void*, boost::detail::edge_desc_impl, long int>, long int> >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::range_detail::SinglePassIteratorConcept >, void*, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator >, boost::no_property>*, std::vector >, boost::no_property>, std::allocator >, boost::no_property> > > >, void*, boost::detail::edge_desc_impl, long int>, long int> >]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied >, void*, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator >, boost::no_property>*, std::vector >, boost::no_property>, std::allocator >, boost::no_property> > > >, void*, boost::detail::edge_desc_impl, long int>, long int> > >::value’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied >, void*, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator >, boost::no_property>*, std::vector >, boost::no_property>, std::allocator >, boost::no_property> > > >, void*, boost::detail::edge_desc_impl, long int>, long int> > >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_ >, void*, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator >, boost::no_property>*, std::vector >, boost::no_property>, std::allocator >, boost::no_property> > > >, void*, boost::detail::edge_desc_impl, long int>, long int> >)>’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/range/concepts.hpp:278:9: [ skipping 7 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/isomorphism.hpp:229:26: required from ‘bool boost::detail::isomorphism_algo::test_isomorphism() [with Graph1 = boost::adjacency_list >; Graph2 = boost::adjacency_list >; IsoMapping = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&>; Invariant1 = boost::degree_vertex_invariant >, int, const int&, boost::vertex_index_t> >, boost::adjacency_list > >; Invariant2 = boost::degree_vertex_invariant >, int, const int&, boost::vertex_index_t> >, boost::adjacency_list > >; IndexMap1 = boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>; IndexMap2 = boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/isomorphism.hpp:532:33: required from ‘bool boost::isomorphism(const Graph1&, const Graph2&, IsoMapping, Invariant1, Invariant2, std::size_t, IndexMap1, IndexMap2) [with Graph1 = adjacency_list >; Graph2 = adjacency_list >; IsoMapping = iterator_property_map<__gnu_cxx::__normal_iterator >, adj_list_vertex_property_map >, int, int&, vertex_index_t>, void*, void*&>; Invariant1 = degree_vertex_invariant >, int, const int&, vertex_index_t> >, adjacency_list > >; Invariant2 = degree_vertex_invariant >, int, const int&, vertex_index_t> >, adjacency_list > >; IndexMap1 = adj_list_vertex_property_map >, int, const int&, vertex_index_t>; IndexMap2 = adj_list_vertex_property_map >, int, const int&, vertex_index_t>; std::size_t = long unsigned int]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/isomorphism.hpp:651:42: required from ‘bool boost::graph::detail::isomorphism_impl::operator()(const Graph1&, const Graph2&, const ArgPack&) const [with ArgPack = boost::parameter::aux::arg_list >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&> >, boost::parameter::aux::empty_arg_list, std::integral_constant >; Graph1 = boost::adjacency_list >; Graph2 = boost::adjacency_list >]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/isomorphism.hpp:662:5: required from ‘typename boost::result_of(Param0, Param1, const ArgPack&)>::type boost::graph::isomorphism_with_named_params(const Param0&, const Param1&, const ArgPack&) [with Param0 = boost::adjacency_list >; Param1 = boost::adjacency_list >; ArgPack = boost::parameter::aux::arg_list >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&> >, boost::parameter::aux::empty_arg_list, std::integral_constant >; typename boost::result_of(Param0, Param1, const ArgPack&)>::type = bool]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/isomorphism.hpp:666:1: required from ‘typename boost::result_of(Param0, Param1, const typename boost::detail::convert_bgl_params_to_boost_parameter >::type&)>::type boost::isomorphism(const Param0&, const Param1&, const bgl_named_params&) [with Param0 = adjacency_list >; Param1 = adjacency_list >; P = iterator_property_map<__gnu_cxx::__normal_iterator >, adj_list_vertex_property_map >, int, int&, vertex_index_t>, void*, void*&>; T = vertex_isomorphism_t; R = no_property; typename result_of(Param0, Param1, const typename detail::convert_bgl_params_to_boost_parameter >::type&)>::type = bool; typename detail::convert_bgl_params_to_boost_parameter >::type = parameter::aux::arg_list >, adj_list_vertex_property_map >, int, int&, vertex_index_t>, void*, void*&> >, parameter::aux::empty_arg_list, std::integral_constant >]’ ordering.cpp:68:18: required from here /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::range_detail::SinglePassIteratorConcept >, void*, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator >, boost::no_property>*, std::vector >, boost::no_property>, std::allocator >, boost::no_property> > > >, void*, boost::detail::edge_desc_impl, long int>, long int> >]’ 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ^ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::range_detail::SinglePassIteratorConcept >, void*, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator >, boost::no_property>*, std::vector >, boost::no_property>, std::allocator >, boost::no_property> > > >, void*, boost::detail::edge_desc_impl, long int>, long int> >]’: /home/omnipath/local/R/4.4-3.20/BH/include/boost/range/concepts.hpp:278:9: required from ‘struct boost::SinglePassRangeConcept >, void*, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator >, boost::no_property>*, std::vector >, boost::no_property>, std::allocator >, boost::no_property> > > >, void*, boost::detail::edge_desc_impl, long int>, long int>, boost::adjacency_iterator >, void*, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator >, boost::no_property>*, std::vector >, boost::no_property>, std::allocator >, boost::no_property> > > >, void*, boost::detail::edge_desc_impl, long int>, long int> > >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::SinglePassRangeConcept >, void*, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator >, boost::no_property>*, std::vector >, boost::no_property>, std::allocator >, boost::no_property> > > >, void*, boost::detail::edge_desc_impl, long int>, long int>, boost::adjacency_iterator >, void*, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator >, boost::no_property>*, std::vector >, boost::no_property>, std::allocator >, boost::no_property> > > >, void*, boost::detail::edge_desc_impl, long int>, long int> > >]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied >, void*, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator >, boost::no_property>*, std::vector >, boost::no_property>, std::allocator >, boost::no_property> > > >, void*, boost::detail::edge_desc_impl, long int>, long int>, boost::adjacency_iterator >, void*, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator >, boost::no_property>*, std::vector >, boost::no_property>, std::allocator >, boost::no_property> > > >, void*, boost::detail::edge_desc_impl, long int>, long int> > > >::value’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied >, void*, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator >, boost::no_property>*, std::vector >, boost::no_property>, std::allocator >, boost::no_property> > > >, void*, boost::detail::edge_desc_impl, long int>, long int>, boost::adjacency_iterator >, void*, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator >, boost::no_property>*, std::vector >, boost::no_property>, std::allocator >, boost::no_property> > > >, void*, boost::detail::edge_desc_impl, long int>, long int> > > >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_ >, void*, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator >, boost::no_property>*, std::vector >, boost::no_property>, std::allocator >, boost::no_property> > > >, void*, boost::detail::edge_desc_impl, long int>, long int>, boost::adjacency_iterator >, void*, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator >, boost::no_property>*, std::vector >, boost::no_property>, std::allocator >, boost::no_property> > > >, void*, boost::detail::edge_desc_impl, long int>, long int> > >)>’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/range/algorithm/equal.hpp:174:13: [ skipping 2 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/isomorphism.hpp:229:26: required from ‘bool boost::detail::isomorphism_algo::test_isomorphism() [with Graph1 = boost::adjacency_list >; Graph2 = boost::adjacency_list >; IsoMapping = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&>; Invariant1 = boost::degree_vertex_invariant >, int, const int&, boost::vertex_index_t> >, boost::adjacency_list > >; Invariant2 = boost::degree_vertex_invariant >, int, const int&, boost::vertex_index_t> >, boost::adjacency_list > >; IndexMap1 = boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>; IndexMap2 = boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/isomorphism.hpp:532:33: required from ‘bool boost::isomorphism(const Graph1&, const Graph2&, IsoMapping, Invariant1, Invariant2, std::size_t, IndexMap1, IndexMap2) [with Graph1 = adjacency_list >; Graph2 = adjacency_list >; IsoMapping = iterator_property_map<__gnu_cxx::__normal_iterator >, adj_list_vertex_property_map >, int, int&, vertex_index_t>, void*, void*&>; Invariant1 = degree_vertex_invariant >, int, const int&, vertex_index_t> >, adjacency_list > >; Invariant2 = degree_vertex_invariant >, int, const int&, vertex_index_t> >, adjacency_list > >; IndexMap1 = adj_list_vertex_property_map >, int, const int&, vertex_index_t>; IndexMap2 = adj_list_vertex_property_map >, int, const int&, vertex_index_t>; std::size_t = long unsigned int]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/isomorphism.hpp:651:42: required from ‘bool boost::graph::detail::isomorphism_impl::operator()(const Graph1&, const Graph2&, const ArgPack&) const [with ArgPack = boost::parameter::aux::arg_list >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&> >, boost::parameter::aux::empty_arg_list, std::integral_constant >; Graph1 = boost::adjacency_list >; Graph2 = boost::adjacency_list >]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/isomorphism.hpp:662:5: required from ‘typename boost::result_of(Param0, Param1, const ArgPack&)>::type boost::graph::isomorphism_with_named_params(const Param0&, const Param1&, const ArgPack&) [with Param0 = boost::adjacency_list >; Param1 = boost::adjacency_list >; ArgPack = boost::parameter::aux::arg_list >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&> >, boost::parameter::aux::empty_arg_list, std::integral_constant >; typename boost::result_of(Param0, Param1, const ArgPack&)>::type = bool]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/isomorphism.hpp:666:1: required from ‘typename boost::result_of(Param0, Param1, const typename boost::detail::convert_bgl_params_to_boost_parameter >::type&)>::type boost::isomorphism(const Param0&, const Param1&, const bgl_named_params&) [with Param0 = adjacency_list >; Param1 = adjacency_list >; P = iterator_property_map<__gnu_cxx::__normal_iterator >, adj_list_vertex_property_map >, int, int&, vertex_index_t>, void*, void*&>; T = vertex_isomorphism_t; R = no_property; typename result_of(Param0, Param1, const typename detail::convert_bgl_params_to_boost_parameter >::type&)>::type = bool; typename detail::convert_bgl_params_to_boost_parameter >::type = parameter::aux::arg_list >, adj_list_vertex_property_map >, int, int&, vertex_index_t>, void*, void*&> >, parameter::aux::empty_arg_list, std::integral_constant >]’ ordering.cpp:68:18: required from here /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::range_detail::SinglePassIteratorConcept::~SinglePassIteratorConcept() [with Iterator = boost::adjacency_iterator >, void*, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator >, boost::no_property>*, std::vector >, boost::no_property>, std::allocator >, boost::no_property> > > >, void*, boost::detail::edge_desc_impl, long int>, long int>]’ 37 | ~model() | ^ /home/omnipath/local/R/4.4-3.20/BH/include/boost/range/concepts.hpp:158:13: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 158 | BOOST_CONCEPT_USAGE(SinglePassIteratorConcept) | ^~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements >, void*, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator >, boost::no_property>*, std::vector >, boost::no_property>, std::allocator >, boost::no_property> > > >, void*, boost::detail::edge_desc_impl, long int>, long int>, boost::adjacency_iterator >, void*, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator >, boost::no_property>*, std::vector >, boost::no_property>, std::allocator >, boost::no_property> > > >, void*, boost::detail::edge_desc_impl, long int>, long int> > > >]’: /home/omnipath/local/R/4.4-3.20/BH/include/boost/range/concepts.hpp:284:9: required from ‘struct boost::SinglePassRangeConcept >, void*, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator >, boost::no_property>*, std::vector >, boost::no_property>, std::allocator >, boost::no_property> > > >, void*, boost::detail::edge_desc_impl, long int>, long int>, boost::adjacency_iterator >, void*, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator >, boost::no_property>*, std::vector >, boost::no_property>, std::allocator >, boost::no_property> > > >, void*, boost::detail::edge_desc_impl, long int>, long int> > >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::SinglePassRangeConcept >, void*, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator >, boost::no_property>*, std::vector >, boost::no_property>, std::allocator >, boost::no_property> > > >, void*, boost::detail::edge_desc_impl, long int>, long int>, boost::adjacency_iterator >, void*, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator >, boost::no_property>*, std::vector >, boost::no_property>, std::allocator >, boost::no_property> > > >, void*, boost::detail::edge_desc_impl, long int>, long int> > >]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied >, void*, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator >, boost::no_property>*, std::vector >, boost::no_property>, std::allocator >, boost::no_property> > > >, void*, boost::detail::edge_desc_impl, long int>, long int>, boost::adjacency_iterator >, void*, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator >, boost::no_property>*, std::vector >, boost::no_property>, std::allocator >, boost::no_property> > > >, void*, boost::detail::edge_desc_impl, long int>, long int> > > >::value’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied >, void*, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator >, boost::no_property>*, std::vector >, boost::no_property>, std::allocator >, boost::no_property> > > >, void*, boost::detail::edge_desc_impl, long int>, long int>, boost::adjacency_iterator >, void*, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator >, boost::no_property>*, std::vector >, boost::no_property>, std::allocator >, boost::no_property> > > >, void*, boost::detail::edge_desc_impl, long int>, long int> > > >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_ >, void*, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator >, boost::no_property>*, std::vector >, boost::no_property>, std::allocator >, boost::no_property> > > >, void*, boost::detail::edge_desc_impl, long int>, long int>, boost::adjacency_iterator >, void*, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator >, boost::no_property>*, std::vector >, boost::no_property>, std::allocator >, boost::no_property> > > >, void*, boost::detail::edge_desc_impl, long int>, long int> > >)>’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/range/algorithm/equal.hpp:174:13: [ skipping 2 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/isomorphism.hpp:229:26: required from ‘bool boost::detail::isomorphism_algo::test_isomorphism() [with Graph1 = boost::adjacency_list >; Graph2 = boost::adjacency_list >; IsoMapping = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&>; Invariant1 = boost::degree_vertex_invariant >, int, const int&, boost::vertex_index_t> >, boost::adjacency_list > >; Invariant2 = boost::degree_vertex_invariant >, int, const int&, boost::vertex_index_t> >, boost::adjacency_list > >; IndexMap1 = boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>; IndexMap2 = boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/isomorphism.hpp:532:33: required from ‘bool boost::isomorphism(const Graph1&, const Graph2&, IsoMapping, Invariant1, Invariant2, std::size_t, IndexMap1, IndexMap2) [with Graph1 = adjacency_list >; Graph2 = adjacency_list >; IsoMapping = iterator_property_map<__gnu_cxx::__normal_iterator >, adj_list_vertex_property_map >, int, int&, vertex_index_t>, void*, void*&>; Invariant1 = degree_vertex_invariant >, int, const int&, vertex_index_t> >, adjacency_list > >; Invariant2 = degree_vertex_invariant >, int, const int&, vertex_index_t> >, adjacency_list > >; IndexMap1 = adj_list_vertex_property_map >, int, const int&, vertex_index_t>; IndexMap2 = adj_list_vertex_property_map >, int, const int&, vertex_index_t>; std::size_t = long unsigned int]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/isomorphism.hpp:651:42: required from ‘bool boost::graph::detail::isomorphism_impl::operator()(const Graph1&, const Graph2&, const ArgPack&) const [with ArgPack = boost::parameter::aux::arg_list >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&> >, boost::parameter::aux::empty_arg_list, std::integral_constant >; Graph1 = boost::adjacency_list >; Graph2 = boost::adjacency_list >]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/isomorphism.hpp:662:5: required from ‘typename boost::result_of(Param0, Param1, const ArgPack&)>::type boost::graph::isomorphism_with_named_params(const Param0&, const Param1&, const ArgPack&) [with Param0 = boost::adjacency_list >; Param1 = boost::adjacency_list >; ArgPack = boost::parameter::aux::arg_list >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&> >, boost::parameter::aux::empty_arg_list, std::integral_constant >; typename boost::result_of(Param0, Param1, const ArgPack&)>::type = bool]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/isomorphism.hpp:666:1: required from ‘typename boost::result_of(Param0, Param1, const typename boost::detail::convert_bgl_params_to_boost_parameter >::type&)>::type boost::isomorphism(const Param0&, const Param1&, const bgl_named_params&) [with Param0 = adjacency_list >; Param1 = adjacency_list >; P = iterator_property_map<__gnu_cxx::__normal_iterator >, adj_list_vertex_property_map >, int, int&, vertex_index_t>, void*, void*&>; T = vertex_isomorphism_t; R = no_property; typename result_of(Param0, Param1, const typename detail::convert_bgl_params_to_boost_parameter >::type&)>::type = bool; typename detail::convert_bgl_params_to_boost_parameter >::type = parameter::aux::arg_list >, adj_list_vertex_property_map >, int, int&, vertex_index_t>, void*, void*&> >, parameter::aux::empty_arg_list, std::integral_constant >]’ ordering.cpp:68:18: required from here /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::SinglePassRangeConcept >, void*, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator >, boost::no_property>*, std::vector >, boost::no_property>, std::allocator >, boost::no_property> > > >, void*, boost::detail::edge_desc_impl, long int>, long int>, boost::adjacency_iterator >, void*, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator >, boost::no_property>*, std::vector >, boost::no_property>, std::allocator >, boost::no_property> > > >, void*, boost::detail::edge_desc_impl, long int>, long int> > >]’ 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ^ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::SinglePassRangeConcept >, void*, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator >, boost::no_property>*, std::vector >, boost::no_property>, std::allocator >, boost::no_property> > > >, void*, boost::detail::edge_desc_impl, long int>, long int>, boost::adjacency_iterator >, void*, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator >, boost::no_property>*, std::vector >, boost::no_property>, std::allocator >, boost::no_property> > > >, void*, boost::detail::edge_desc_impl, long int>, long int> > >]’: /home/omnipath/local/R/4.4-3.20/BH/include/boost/range/algorithm/equal.hpp:174:13: required from ‘typename boost::range_difference::type boost::range::count_if(const SinglePassRange&, UnaryPredicate) [with SinglePassRange = std::pair >, void*, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator >, boost::no_property>*, std::vector >, boost::no_property>, std::allocator >, boost::no_property> > > >, void*, boost::detail::edge_desc_impl, long int>, long int>, boost::adjacency_iterator >, void*, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator >, boost::no_property>*, std::vector >, boost::no_property>, std::allocator >, boost::no_property> > > >, void*, boost::detail::edge_desc_impl, long int>, long int> >; UnaryPredicate = boost::indirect_pmap >, boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>, char, char&> >; typename boost::range_difference::type = long int]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/isomorphism.hpp:304:51: required from ‘bool boost::detail::isomorphism_algo::match(edge_iter, int) [with Graph1 = boost::adjacency_list >; Graph2 = boost::adjacency_list >; IsoMapping = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&>; Invariant1 = boost::degree_vertex_invariant >, int, const int&, boost::vertex_index_t> >, boost::adjacency_list > >; Invariant2 = boost::degree_vertex_invariant >, int, const int&, boost::vertex_index_t> >, boost::adjacency_list > >; IndexMap1 = boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>; IndexMap2 = boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>; edge_iter = std::vector, std::allocator > >::iterator]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/isomorphism.hpp:229:26: required from ‘bool boost::detail::isomorphism_algo::test_isomorphism() [with Graph1 = boost::adjacency_list >; Graph2 = boost::adjacency_list >; IsoMapping = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&>; Invariant1 = boost::degree_vertex_invariant >, int, const int&, boost::vertex_index_t> >, boost::adjacency_list > >; Invariant2 = boost::degree_vertex_invariant >, int, const int&, boost::vertex_index_t> >, boost::adjacency_list > >; IndexMap1 = boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>; IndexMap2 = boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/isomorphism.hpp:532:33: required from ‘bool boost::isomorphism(const Graph1&, const Graph2&, IsoMapping, Invariant1, Invariant2, std::size_t, IndexMap1, IndexMap2) [with Graph1 = adjacency_list >; Graph2 = adjacency_list >; IsoMapping = iterator_property_map<__gnu_cxx::__normal_iterator >, adj_list_vertex_property_map >, int, int&, vertex_index_t>, void*, void*&>; Invariant1 = degree_vertex_invariant >, int, const int&, vertex_index_t> >, adjacency_list > >; Invariant2 = degree_vertex_invariant >, int, const int&, vertex_index_t> >, adjacency_list > >; IndexMap1 = adj_list_vertex_property_map >, int, const int&, vertex_index_t>; IndexMap2 = adj_list_vertex_property_map >, int, const int&, vertex_index_t>; std::size_t = long unsigned int]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/isomorphism.hpp:651:42: required from ‘bool boost::graph::detail::isomorphism_impl::operator()(const Graph1&, const Graph2&, const ArgPack&) const [with ArgPack = boost::parameter::aux::arg_list >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&> >, boost::parameter::aux::empty_arg_list, std::integral_constant >; Graph1 = boost::adjacency_list >; Graph2 = boost::adjacency_list >]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/isomorphism.hpp:662:5: required from ‘typename boost::result_of(Param0, Param1, const ArgPack&)>::type boost::graph::isomorphism_with_named_params(const Param0&, const Param1&, const ArgPack&) [with Param0 = boost::adjacency_list >; Param1 = boost::adjacency_list >; ArgPack = boost::parameter::aux::arg_list >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&> >, boost::parameter::aux::empty_arg_list, std::integral_constant >; typename boost::result_of(Param0, Param1, const ArgPack&)>::type = bool]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/isomorphism.hpp:666:1: required from ‘typename boost::result_of(Param0, Param1, const typename boost::detail::convert_bgl_params_to_boost_parameter >::type&)>::type boost::isomorphism(const Param0&, const Param1&, const bgl_named_params&) [with Param0 = adjacency_list >; Param1 = adjacency_list >; P = iterator_property_map<__gnu_cxx::__normal_iterator >, adj_list_vertex_property_map >, int, int&, vertex_index_t>, void*, void*&>; T = vertex_isomorphism_t; R = no_property; typename result_of(Param0, Param1, const typename detail::convert_bgl_params_to_boost_parameter >::type&)>::type = bool; typename detail::convert_bgl_params_to_boost_parameter >::type = parameter::aux::arg_list >, adj_list_vertex_property_map >, int, int&, vertex_index_t>, void*, void*&> >, parameter::aux::empty_arg_list, std::integral_constant >]’ ordering.cpp:68:18: required from here /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::SinglePassRangeConcept::~SinglePassRangeConcept() [with T = const std::pair >, void*, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator >, boost::no_property>*, std::vector >, boost::no_property>, std::allocator >, boost::no_property> > > >, void*, boost::detail::edge_desc_impl, long int>, long int>, boost::adjacency_iterator >, void*, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator >, boost::no_property>*, std::vector >, boost::no_property>, std::allocator >, boost::no_property> > > >, void*, boost::detail::edge_desc_impl, long int>, long int> >]’ 37 | ~model() | ^ /home/omnipath/local/R/4.4-3.20/BH/include/boost/range/concepts.hpp:284:9: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 284 | BOOST_CONCEPT_USAGE(SinglePassRangeConcept) | ^~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::DefaultConstructible]’: /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements >]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:137:5: required from ‘struct boost::DefaultConstructible’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::DefaultConstructible]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied >::value’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:72:8: [ skipping 9 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied > >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_ >)>’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/depth_first_search.hpp:129:9: required from ‘void boost::detail::depth_first_visit_impl(const IncidenceGraph&, typename boost::graph_traits::vertex_descriptor, DFSVisitor&, ColorMap, TerminatorFunc) [with IncidenceGraph = R_adjacency_list; DFSVisitor = boost::dfs_visitor<>; ColorMap = boost::vec_adj_list_vertex_property_map, boost::property, boost::no_property, boost::listS>, boost::adjacency_list, boost::property, boost::no_property, boost::listS>*, boost::default_color_type, boost::default_color_type&, boost::vertex_color_t>; TerminatorFunc = nontruth2; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/depth_first_search.hpp:417:35: required from ‘void boost::depth_first_visit(const IncidenceGraph&, typename graph_traits::vertex_descriptor, DFSVisitor, ColorMap) [with IncidenceGraph = R_adjacency_list; DFSVisitor = dfs_visitor<>; ColorMap = vec_adj_list_vertex_property_map, property, no_property, listS>, adjacency_list, property, no_property, listS>*, default_color_type, default_color_type&, vertex_color_t>; typename graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/cuthill_mckee_ordering.hpp:146:30: required from ‘OutputIterator boost::cuthill_mckee_ordering(const Graph&, OutputIterator, ColorMap, DegreeMap) [with Graph = R_adjacency_list; OutputIterator = std::reverse_iterator<__gnu_cxx::__normal_iterator > >; ColorMap = vec_adj_list_vertex_property_map, property, no_property, listS>, adjacency_list, property, no_property, listS>*, default_color_type, default_color_type&, vertex_color_t>; DegreeMap = degree_property_map >]’ ordering.cpp:98:25: required from here /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::DefaultConstructible::~DefaultConstructible() [with TT = long unsigned int]’ 37 | ~model() | ^ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:137:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 137 | BOOST_CONCEPT_USAGE(DefaultConstructible) { | ^~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::EqualityComparable]’: /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements >]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:233:5: required from ‘struct boost::EqualityComparable’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::EqualityComparable]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied >::value’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:72:8: [ skipping 9 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied > >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_ >)>’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/depth_first_search.hpp:129:9: required from ‘void boost::detail::depth_first_visit_impl(const IncidenceGraph&, typename boost::graph_traits::vertex_descriptor, DFSVisitor&, ColorMap, TerminatorFunc) [with IncidenceGraph = R_adjacency_list; DFSVisitor = boost::dfs_visitor<>; ColorMap = boost::vec_adj_list_vertex_property_map, boost::property, boost::no_property, boost::listS>, boost::adjacency_list, boost::property, boost::no_property, boost::listS>*, boost::default_color_type, boost::default_color_type&, boost::vertex_color_t>; TerminatorFunc = nontruth2; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/depth_first_search.hpp:417:35: required from ‘void boost::depth_first_visit(const IncidenceGraph&, typename graph_traits::vertex_descriptor, DFSVisitor, ColorMap) [with IncidenceGraph = R_adjacency_list; DFSVisitor = dfs_visitor<>; ColorMap = vec_adj_list_vertex_property_map, property, no_property, listS>, adjacency_list, property, no_property, listS>*, default_color_type, default_color_type&, vertex_color_t>; typename graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/cuthill_mckee_ordering.hpp:146:30: required from ‘OutputIterator boost::cuthill_mckee_ordering(const Graph&, OutputIterator, ColorMap, DegreeMap) [with Graph = R_adjacency_list; OutputIterator = std::reverse_iterator<__gnu_cxx::__normal_iterator > >; ColorMap = vec_adj_list_vertex_property_map, property, no_property, listS>, adjacency_list, property, no_property, listS>*, default_color_type, default_color_type&, vertex_color_t>; DegreeMap = degree_property_map >]’ ordering.cpp:98:25: required from here /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::EqualityComparable::~EqualityComparable() [with TT = long unsigned int]’ 37 | ~model() | ^ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:233:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 233 | BOOST_CONCEPT_USAGE(EqualityComparable) { | ^~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::Assignable]’: /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements >]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:145:5: required from ‘struct boost::Assignable’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::Assignable]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied >::value’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:72:8: [ skipping 9 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied > >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_ >)>’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/depth_first_search.hpp:129:9: required from ‘void boost::detail::depth_first_visit_impl(const IncidenceGraph&, typename boost::graph_traits::vertex_descriptor, DFSVisitor&, ColorMap, TerminatorFunc) [with IncidenceGraph = R_adjacency_list; DFSVisitor = boost::dfs_visitor<>; ColorMap = boost::vec_adj_list_vertex_property_map, boost::property, boost::no_property, boost::listS>, boost::adjacency_list, boost::property, boost::no_property, boost::listS>*, boost::default_color_type, boost::default_color_type&, boost::vertex_color_t>; TerminatorFunc = nontruth2; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/depth_first_search.hpp:417:35: required from ‘void boost::depth_first_visit(const IncidenceGraph&, typename graph_traits::vertex_descriptor, DFSVisitor, ColorMap) [with IncidenceGraph = R_adjacency_list; DFSVisitor = dfs_visitor<>; ColorMap = vec_adj_list_vertex_property_map, property, no_property, listS>, adjacency_list, property, no_property, listS>*, default_color_type, default_color_type&, vertex_color_t>; typename graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/cuthill_mckee_ordering.hpp:146:30: required from ‘OutputIterator boost::cuthill_mckee_ordering(const Graph&, OutputIterator, ColorMap, DegreeMap) [with Graph = R_adjacency_list; OutputIterator = std::reverse_iterator<__gnu_cxx::__normal_iterator > >; ColorMap = vec_adj_list_vertex_property_map, property, no_property, listS>, adjacency_list, property, no_property, listS>*, default_color_type, default_color_type&, vertex_color_t>; DegreeMap = degree_property_map >]’ ordering.cpp:98:25: required from here /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::Assignable::~Assignable() [with TT = long unsigned int]’ 37 | ~model() | ^ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:145:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 145 | BOOST_CONCEPT_USAGE(Assignable) { | ^~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements > >, boost::property >*, std::vector > >, boost::property >, std::allocator > >, boost::property > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >]’: /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:145:5: required from ‘struct boost::Assignable > >, boost::property >*, std::vector > >, boost::property >, std::allocator > >, boost::property > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:502:3: required from ‘struct boost::InputIterator > >, boost::property >*, std::vector > >, boost::property >, std::allocator > >, boost::property > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::InputIterator > >, boost::property >*, std::vector > >, boost::property >, std::allocator > >, boost::property > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> >]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied > >, boost::property >*, std::vector > >, boost::property >, std::allocator > >, boost::property > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::value’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied > >, boost::property >*, std::vector > >, boost::property >, std::allocator > >, boost::property > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:72:8: [ skipping 3 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/graph_concepts.hpp:89:9: required from ‘boost::concepts::IncidenceGraph::~IncidenceGraph() [with G = R_adjacency_list]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/graph_concepts.hpp:75:1: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::IncidenceGraphConcept >]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/depth_first_search.hpp:129:9: required from ‘void boost::detail::depth_first_visit_impl(const IncidenceGraph&, typename boost::graph_traits::vertex_descriptor, DFSVisitor&, ColorMap, TerminatorFunc) [with IncidenceGraph = R_adjacency_list; DFSVisitor = boost::dfs_visitor<>; ColorMap = boost::vec_adj_list_vertex_property_map, boost::property, boost::no_property, boost::listS>, boost::adjacency_list, boost::property, boost::no_property, boost::listS>*, boost::default_color_type, boost::default_color_type&, boost::vertex_color_t>; TerminatorFunc = nontruth2; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/depth_first_search.hpp:417:35: required from ‘void boost::depth_first_visit(const IncidenceGraph&, typename graph_traits::vertex_descriptor, DFSVisitor, ColorMap) [with IncidenceGraph = R_adjacency_list; DFSVisitor = dfs_visitor<>; ColorMap = vec_adj_list_vertex_property_map, property, no_property, listS>, adjacency_list, property, no_property, listS>*, default_color_type, default_color_type&, vertex_color_t>; typename graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/cuthill_mckee_ordering.hpp:146:30: required from ‘OutputIterator boost::cuthill_mckee_ordering(const Graph&, OutputIterator, ColorMap, DegreeMap) [with Graph = R_adjacency_list; OutputIterator = std::reverse_iterator<__gnu_cxx::__normal_iterator > >; ColorMap = vec_adj_list_vertex_property_map, property, no_property, listS>, adjacency_list, property, no_property, listS>*, default_color_type, default_color_type&, vertex_color_t>; DegreeMap = degree_property_map >]’ ordering.cpp:98:25: required from here /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::Assignable > >, boost::property >*, std::vector > >, boost::property >, std::allocator > >, boost::property > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> >]’ 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ^ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements > >, boost::property >*, std::vector > >, boost::property >, std::allocator > >, boost::property > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >]’: /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:233:5: required from ‘struct boost::EqualityComparable > >, boost::property >*, std::vector > >, boost::property >, std::allocator > >, boost::property > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:502:3: required from ‘struct boost::InputIterator > >, boost::property >*, std::vector > >, boost::property >, std::allocator > >, boost::property > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::InputIterator > >, boost::property >*, std::vector > >, boost::property >, std::allocator > >, boost::property > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> >]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied > >, boost::property >*, std::vector > >, boost::property >, std::allocator > >, boost::property > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::value’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied > >, boost::property >*, std::vector > >, boost::property >, std::allocator > >, boost::property > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:72:8: [ skipping 3 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/graph_concepts.hpp:89:9: required from ‘boost::concepts::IncidenceGraph::~IncidenceGraph() [with G = R_adjacency_list]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/graph_concepts.hpp:75:1: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::IncidenceGraphConcept >]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/depth_first_search.hpp:129:9: required from ‘void boost::detail::depth_first_visit_impl(const IncidenceGraph&, typename boost::graph_traits::vertex_descriptor, DFSVisitor&, ColorMap, TerminatorFunc) [with IncidenceGraph = R_adjacency_list; DFSVisitor = boost::dfs_visitor<>; ColorMap = boost::vec_adj_list_vertex_property_map, boost::property, boost::no_property, boost::listS>, boost::adjacency_list, boost::property, boost::no_property, boost::listS>*, boost::default_color_type, boost::default_color_type&, boost::vertex_color_t>; TerminatorFunc = nontruth2; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/depth_first_search.hpp:417:35: required from ‘void boost::depth_first_visit(const IncidenceGraph&, typename graph_traits::vertex_descriptor, DFSVisitor, ColorMap) [with IncidenceGraph = R_adjacency_list; DFSVisitor = dfs_visitor<>; ColorMap = vec_adj_list_vertex_property_map, property, no_property, listS>, adjacency_list, property, no_property, listS>*, default_color_type, default_color_type&, vertex_color_t>; typename graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/cuthill_mckee_ordering.hpp:146:30: required from ‘OutputIterator boost::cuthill_mckee_ordering(const Graph&, OutputIterator, ColorMap, DegreeMap) [with Graph = R_adjacency_list; OutputIterator = std::reverse_iterator<__gnu_cxx::__normal_iterator > >; ColorMap = vec_adj_list_vertex_property_map, property, no_property, listS>, adjacency_list, property, no_property, listS>*, default_color_type, default_color_type&, vertex_color_t>; DegreeMap = degree_property_map >]’ ordering.cpp:98:25: required from here /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::EqualityComparable > >, boost::property >*, std::vector > >, boost::property >, std::allocator > >, boost::property > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> >]’ 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ^ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements > >, boost::property >*, std::vector > >, boost::property >, std::allocator > >, boost::property > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >]’: /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:512:7: required from ‘struct boost::InputIterator > >, boost::property >*, std::vector > >, boost::property >, std::allocator > >, boost::property > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::InputIterator > >, boost::property >*, std::vector > >, boost::property >, std::allocator > >, boost::property > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> >]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied > >, boost::property >*, std::vector > >, boost::property >, std::allocator > >, boost::property > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::value’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied > >, boost::property >*, std::vector > >, boost::property >, std::allocator > >, boost::property > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_ > >, boost::property >*, std::vector > >, boost::property >, std::allocator > >, boost::property > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> >)>’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/graph_concepts.hpp:53:35: [ skipping 2 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/graph_concepts.hpp:89:9: required from ‘boost::concepts::IncidenceGraph::~IncidenceGraph() [with G = R_adjacency_list]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/graph_concepts.hpp:75:1: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::IncidenceGraphConcept >]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/depth_first_search.hpp:129:9: required from ‘void boost::detail::depth_first_visit_impl(const IncidenceGraph&, typename boost::graph_traits::vertex_descriptor, DFSVisitor&, ColorMap, TerminatorFunc) [with IncidenceGraph = R_adjacency_list; DFSVisitor = boost::dfs_visitor<>; ColorMap = boost::vec_adj_list_vertex_property_map, boost::property, boost::no_property, boost::listS>, boost::adjacency_list, boost::property, boost::no_property, boost::listS>*, boost::default_color_type, boost::default_color_type&, boost::vertex_color_t>; TerminatorFunc = nontruth2; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/depth_first_search.hpp:417:35: required from ‘void boost::depth_first_visit(const IncidenceGraph&, typename graph_traits::vertex_descriptor, DFSVisitor, ColorMap) [with IncidenceGraph = R_adjacency_list; DFSVisitor = dfs_visitor<>; ColorMap = vec_adj_list_vertex_property_map, property, no_property, listS>, adjacency_list, property, no_property, listS>*, default_color_type, default_color_type&, vertex_color_t>; typename graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/cuthill_mckee_ordering.hpp:146:30: required from ‘OutputIterator boost::cuthill_mckee_ordering(const Graph&, OutputIterator, ColorMap, DegreeMap) [with Graph = R_adjacency_list; OutputIterator = std::reverse_iterator<__gnu_cxx::__normal_iterator > >; ColorMap = vec_adj_list_vertex_property_map, property, no_property, listS>, adjacency_list, property, no_property, listS>*, default_color_type, default_color_type&, vertex_color_t>; DegreeMap = degree_property_map >]’ ordering.cpp:98:25: required from here /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::InputIterator > >, boost::property >*, std::vector > >, boost::property >, std::allocator > >, boost::property > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> >]’ 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ^ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::InputIterator > >, boost::property >*, std::vector > >, boost::property >, std::allocator > >, boost::property > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> >]’: /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/graph_concepts.hpp:53:35: required from ‘boost::concepts::MultiPassInputIterator::~MultiPassInputIterator() [with T = boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >, boost::property >*, std::vector > >, boost::property >, std::allocator > >, boost::property > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::MultiPassInputIterator > >, boost::property >*, std::vector > >, boost::property >, std::allocator > >, boost::property > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> >]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/graph_concepts.hpp:89:9: required from ‘boost::concepts::IncidenceGraph::~IncidenceGraph() [with G = R_adjacency_list]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/graph_concepts.hpp:75:1: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::IncidenceGraphConcept >]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/depth_first_search.hpp:129:9: required from ‘void boost::detail::depth_first_visit_impl(const IncidenceGraph&, typename boost::graph_traits::vertex_descriptor, DFSVisitor&, ColorMap, TerminatorFunc) [with IncidenceGraph = R_adjacency_list; DFSVisitor = boost::dfs_visitor<>; ColorMap = boost::vec_adj_list_vertex_property_map, boost::property, boost::no_property, boost::listS>, boost::adjacency_list, boost::property, boost::no_property, boost::listS>*, boost::default_color_type, boost::default_color_type&, boost::vertex_color_t>; TerminatorFunc = nontruth2; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/depth_first_search.hpp:417:35: required from ‘void boost::depth_first_visit(const IncidenceGraph&, typename graph_traits::vertex_descriptor, DFSVisitor, ColorMap) [with IncidenceGraph = R_adjacency_list; DFSVisitor = dfs_visitor<>; ColorMap = vec_adj_list_vertex_property_map, property, no_property, listS>, adjacency_list, property, no_property, listS>*, default_color_type, default_color_type&, vertex_color_t>; typename graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/cuthill_mckee_ordering.hpp:146:30: required from ‘OutputIterator boost::cuthill_mckee_ordering(const Graph&, OutputIterator, ColorMap, DegreeMap) [with Graph = R_adjacency_list; OutputIterator = std::reverse_iterator<__gnu_cxx::__normal_iterator > >; ColorMap = vec_adj_list_vertex_property_map, property, no_property, listS>, adjacency_list, property, no_property, listS>*, default_color_type, default_color_type&, vertex_color_t>; DegreeMap = degree_property_map >]’ ordering.cpp:98:25: required from here /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::InputIterator::~InputIterator() [with TT = boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >, boost::property >*, std::vector > >, boost::property >, std::allocator > >, boost::property > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>]’ 37 | ~model() | ^ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:512:7: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 512 | BOOST_CONCEPT_USAGE(InputIterator) | ^~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements > >]’: /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:167:5: required from ‘struct boost::CopyConstructible >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:165:3: required from ‘struct boost::CopyConstructibleConcept >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::CopyConstructibleConcept >]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied > >::value’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied > >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:72:8: [ skipping 7 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/breadth_first_search.hpp:118:24: required from ‘void boost::breadth_first_visit(const IncidenceGraph&, typename graph_traits::vertex_descriptor, Buffer&, BFSVisitor, ColorMap) [with IncidenceGraph = R_adjacency_list; Buffer = sparse::rcm_queue >, std::deque > >; BFSVisitor = bfs_visitor<>; ColorMap = vec_adj_list_vertex_property_map, property, no_property, listS>, adjacency_list, property, no_property, listS>*, default_color_type, default_color_type&, vertex_color_t>; typename graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/breadth_first_search.hpp:363:24: required from ‘void boost::breadth_first_visit(const IncidenceGraph&, typename graph_traits::vertex_descriptor, const bgl_named_params&) [with IncidenceGraph = R_adjacency_list; P = vec_adj_list_vertex_property_map, property, no_property, listS>, adjacency_list, property, no_property, listS>*, default_color_type, default_color_type&, vertex_color_t>; T = vertex_color_t; R = bgl_named_params >, std::deque > > >, buffer_param_t, no_property>; typename graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/detail/sparse_ordering.hpp:152:24: required from ‘Vertex boost::pseudo_peripheral_pair(const Graph&, const Vertex&, int&, ColorMap, DegreeMap) [with Graph = R_adjacency_list; Vertex = long unsigned int; ColorMap = vec_adj_list_vertex_property_map, property, no_property, listS>, adjacency_list, property, no_property, listS>*, default_color_type, default_color_type&, vertex_color_t>; DegreeMap = degree_property_map >]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/detail/sparse_ordering.hpp:170:31: required from ‘Vertex boost::find_starting_node(const Graph&, Vertex, Color, Degree) [with Graph = R_adjacency_list; Vertex = long unsigned int; Color = vec_adj_list_vertex_property_map, property, no_property, listS>, adjacency_list, property, no_property, listS>*, default_color_type, default_color_type&, vertex_color_t>; Degree = degree_property_map >]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/cuthill_mckee_ordering.hpp:155:32: required from ‘OutputIterator boost::cuthill_mckee_ordering(const Graph&, OutputIterator, ColorMap, DegreeMap) [with Graph = R_adjacency_list; OutputIterator = std::reverse_iterator<__gnu_cxx::__normal_iterator > >; ColorMap = vec_adj_list_vertex_property_map, property, no_property, listS>, adjacency_list, property, no_property, listS>*, default_color_type, default_color_type&, vertex_color_t>; DegreeMap = degree_property_map >]’ ordering.cpp:98:25: required from here /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::CopyConstructible >]’ 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ^ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::CopyConstructibleConcept >]’: /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/depth_first_search.hpp:41:9: required from ‘void boost::BFSVisitorConcept::constraints() [with Visitor = boost::bfs_visitor<>; Graph = R_adjacency_list]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::BFSVisitorConcept, R_adjacency_list >]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied, R_adjacency_list > >::value’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied, R_adjacency_list > >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:72:8: [ skipping 2 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/breadth_first_search.hpp:118:24: required from ‘void boost::breadth_first_visit(const IncidenceGraph&, typename graph_traits::vertex_descriptor, Buffer&, BFSVisitor, ColorMap) [with IncidenceGraph = R_adjacency_list; Buffer = sparse::rcm_queue >, std::deque > >; BFSVisitor = bfs_visitor<>; ColorMap = vec_adj_list_vertex_property_map, property, no_property, listS>, adjacency_list, property, no_property, listS>*, default_color_type, default_color_type&, vertex_color_t>; typename graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/breadth_first_search.hpp:363:24: required from ‘void boost::breadth_first_visit(const IncidenceGraph&, typename graph_traits::vertex_descriptor, const bgl_named_params&) [with IncidenceGraph = R_adjacency_list; P = vec_adj_list_vertex_property_map, property, no_property, listS>, adjacency_list, property, no_property, listS>*, default_color_type, default_color_type&, vertex_color_t>; T = vertex_color_t; R = bgl_named_params >, std::deque > > >, buffer_param_t, no_property>; typename graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/detail/sparse_ordering.hpp:152:24: required from ‘Vertex boost::pseudo_peripheral_pair(const Graph&, const Vertex&, int&, ColorMap, DegreeMap) [with Graph = R_adjacency_list; Vertex = long unsigned int; ColorMap = vec_adj_list_vertex_property_map, property, no_property, listS>, adjacency_list, property, no_property, listS>*, default_color_type, default_color_type&, vertex_color_t>; DegreeMap = degree_property_map >]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/detail/sparse_ordering.hpp:170:31: required from ‘Vertex boost::find_starting_node(const Graph&, Vertex, Color, Degree) [with Graph = R_adjacency_list; Vertex = long unsigned int; Color = vec_adj_list_vertex_property_map, property, no_property, listS>, adjacency_list, property, no_property, listS>*, default_color_type, default_color_type&, vertex_color_t>; Degree = degree_property_map >]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/cuthill_mckee_ordering.hpp:155:32: required from ‘OutputIterator boost::cuthill_mckee_ordering(const Graph&, OutputIterator, ColorMap, DegreeMap) [with Graph = R_adjacency_list; OutputIterator = std::reverse_iterator<__gnu_cxx::__normal_iterator > >; ColorMap = vec_adj_list_vertex_property_map, property, no_property, listS>, adjacency_list, property, no_property, listS>*, default_color_type, default_color_type&, vertex_color_t>; DegreeMap = degree_property_map >]’ ordering.cpp:98:25: required from here /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:165:17: note: in a call to non-static member function ‘boost::CopyConstructibleConcept >::~CopyConstructibleConcept()’ 165 | BOOST_concept(CopyConstructible,(TT)) | ^~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/preprocessor/cat.hpp:29:34: note: in definition of macro ‘BOOST_PP_CAT_I’ 29 | # define BOOST_PP_CAT_I(a, b) a ## b | ^ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/concept_def.hpp:23:12: note: in expansion of macro ‘BOOST_PP_CAT’ 23 | struct BOOST_PP_CAT(name,Concept) \ | ^~~~~~~~~~~~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:165:3: note: in expansion of macro ‘BOOST_concept’ 165 | BOOST_concept(CopyConstructible,(TT)) | ^~~~~~~~~~~~~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::DefaultConstructible]’: /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements >]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:137:5: required from ‘struct boost::DefaultConstructible’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::DefaultConstructible]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied >::value’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:72:8: [ skipping 10 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_ > >)>’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/isomorphism.hpp:494:5: required from ‘bool boost::isomorphism(const Graph1&, const Graph2&, IsoMapping, Invariant1, Invariant2, std::size_t, IndexMap1, IndexMap2) [with Graph1 = adjacency_list >; Graph2 = adjacency_list >; IsoMapping = iterator_property_map<__gnu_cxx::__normal_iterator >, adj_list_vertex_property_map >, int, int&, vertex_index_t>, void*, void*&>; Invariant1 = degree_vertex_invariant >, int, const int&, vertex_index_t> >, adjacency_list > >; Invariant2 = degree_vertex_invariant >, int, const int&, vertex_index_t> >, adjacency_list > >; IndexMap1 = adj_list_vertex_property_map >, int, const int&, vertex_index_t>; IndexMap2 = adj_list_vertex_property_map >, int, const int&, vertex_index_t>; std::size_t = long unsigned int]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/isomorphism.hpp:651:42: required from ‘bool boost::graph::detail::isomorphism_impl::operator()(const Graph1&, const Graph2&, const ArgPack&) const [with ArgPack = boost::parameter::aux::arg_list >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&> >, boost::parameter::aux::empty_arg_list, std::integral_constant >; Graph1 = boost::adjacency_list >; Graph2 = boost::adjacency_list >]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/isomorphism.hpp:662:5: required from ‘typename boost::result_of(Param0, Param1, const ArgPack&)>::type boost::graph::isomorphism_with_named_params(const Param0&, const Param1&, const ArgPack&) [with Param0 = boost::adjacency_list >; Param1 = boost::adjacency_list >; ArgPack = boost::parameter::aux::arg_list >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&> >, boost::parameter::aux::empty_arg_list, std::integral_constant >; typename boost::result_of(Param0, Param1, const ArgPack&)>::type = bool]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/isomorphism.hpp:666:1: required from ‘typename boost::result_of(Param0, Param1, const typename boost::detail::convert_bgl_params_to_boost_parameter >::type&)>::type boost::isomorphism(const Param0&, const Param1&, const bgl_named_params&) [with Param0 = adjacency_list >; Param1 = adjacency_list >; P = iterator_property_map<__gnu_cxx::__normal_iterator >, adj_list_vertex_property_map >, int, int&, vertex_index_t>, void*, void*&>; T = vertex_isomorphism_t; R = no_property; typename result_of(Param0, Param1, const typename detail::convert_bgl_params_to_boost_parameter >::type&)>::type = bool; typename detail::convert_bgl_params_to_boost_parameter >::type = parameter::aux::arg_list >, adj_list_vertex_property_map >, int, int&, vertex_index_t>, void*, void*&> >, parameter::aux::empty_arg_list, std::integral_constant >]’ ordering.cpp:68:18: required from here /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::DefaultConstructible::~DefaultConstructible() [with TT = void*]’ 37 | ~model() | ^ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:137:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 137 | BOOST_CONCEPT_USAGE(DefaultConstructible) { | ^~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::EqualityComparable]’: /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements >]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:233:5: required from ‘struct boost::EqualityComparable’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::EqualityComparable]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied >::value’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:72:8: [ skipping 10 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_ > >)>’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/isomorphism.hpp:494:5: required from ‘bool boost::isomorphism(const Graph1&, const Graph2&, IsoMapping, Invariant1, Invariant2, std::size_t, IndexMap1, IndexMap2) [with Graph1 = adjacency_list >; Graph2 = adjacency_list >; IsoMapping = iterator_property_map<__gnu_cxx::__normal_iterator >, adj_list_vertex_property_map >, int, int&, vertex_index_t>, void*, void*&>; Invariant1 = degree_vertex_invariant >, int, const int&, vertex_index_t> >, adjacency_list > >; Invariant2 = degree_vertex_invariant >, int, const int&, vertex_index_t> >, adjacency_list > >; IndexMap1 = adj_list_vertex_property_map >, int, const int&, vertex_index_t>; IndexMap2 = adj_list_vertex_property_map >, int, const int&, vertex_index_t>; std::size_t = long unsigned int]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/isomorphism.hpp:651:42: required from ‘bool boost::graph::detail::isomorphism_impl::operator()(const Graph1&, const Graph2&, const ArgPack&) const [with ArgPack = boost::parameter::aux::arg_list >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&> >, boost::parameter::aux::empty_arg_list, std::integral_constant >; Graph1 = boost::adjacency_list >; Graph2 = boost::adjacency_list >]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/isomorphism.hpp:662:5: required from ‘typename boost::result_of(Param0, Param1, const ArgPack&)>::type boost::graph::isomorphism_with_named_params(const Param0&, const Param1&, const ArgPack&) [with Param0 = boost::adjacency_list >; Param1 = boost::adjacency_list >; ArgPack = boost::parameter::aux::arg_list >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&> >, boost::parameter::aux::empty_arg_list, std::integral_constant >; typename boost::result_of(Param0, Param1, const ArgPack&)>::type = bool]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/isomorphism.hpp:666:1: required from ‘typename boost::result_of(Param0, Param1, const typename boost::detail::convert_bgl_params_to_boost_parameter >::type&)>::type boost::isomorphism(const Param0&, const Param1&, const bgl_named_params&) [with Param0 = adjacency_list >; Param1 = adjacency_list >; P = iterator_property_map<__gnu_cxx::__normal_iterator >, adj_list_vertex_property_map >, int, int&, vertex_index_t>, void*, void*&>; T = vertex_isomorphism_t; R = no_property; typename result_of(Param0, Param1, const typename detail::convert_bgl_params_to_boost_parameter >::type&)>::type = bool; typename detail::convert_bgl_params_to_boost_parameter >::type = parameter::aux::arg_list >, adj_list_vertex_property_map >, int, int&, vertex_index_t>, void*, void*&> >, parameter::aux::empty_arg_list, std::integral_constant >]’ ordering.cpp:68:18: required from here /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::EqualityComparable::~EqualityComparable() [with TT = void*]’ 37 | ~model() | ^ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:233:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 233 | BOOST_CONCEPT_USAGE(EqualityComparable) { | ^~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::Assignable]’: /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements >]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:145:5: required from ‘struct boost::Assignable’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::Assignable]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied >::value’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:72:8: [ skipping 10 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_ > >)>’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/isomorphism.hpp:494:5: required from ‘bool boost::isomorphism(const Graph1&, const Graph2&, IsoMapping, Invariant1, Invariant2, std::size_t, IndexMap1, IndexMap2) [with Graph1 = adjacency_list >; Graph2 = adjacency_list >; IsoMapping = iterator_property_map<__gnu_cxx::__normal_iterator >, adj_list_vertex_property_map >, int, int&, vertex_index_t>, void*, void*&>; Invariant1 = degree_vertex_invariant >, int, const int&, vertex_index_t> >, adjacency_list > >; Invariant2 = degree_vertex_invariant >, int, const int&, vertex_index_t> >, adjacency_list > >; IndexMap1 = adj_list_vertex_property_map >, int, const int&, vertex_index_t>; IndexMap2 = adj_list_vertex_property_map >, int, const int&, vertex_index_t>; std::size_t = long unsigned int]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/isomorphism.hpp:651:42: required from ‘bool boost::graph::detail::isomorphism_impl::operator()(const Graph1&, const Graph2&, const ArgPack&) const [with ArgPack = boost::parameter::aux::arg_list >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&> >, boost::parameter::aux::empty_arg_list, std::integral_constant >; Graph1 = boost::adjacency_list >; Graph2 = boost::adjacency_list >]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/isomorphism.hpp:662:5: required from ‘typename boost::result_of(Param0, Param1, const ArgPack&)>::type boost::graph::isomorphism_with_named_params(const Param0&, const Param1&, const ArgPack&) [with Param0 = boost::adjacency_list >; Param1 = boost::adjacency_list >; ArgPack = boost::parameter::aux::arg_list >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&> >, boost::parameter::aux::empty_arg_list, std::integral_constant >; typename boost::result_of(Param0, Param1, const ArgPack&)>::type = bool]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/isomorphism.hpp:666:1: required from ‘typename boost::result_of(Param0, Param1, const typename boost::detail::convert_bgl_params_to_boost_parameter >::type&)>::type boost::isomorphism(const Param0&, const Param1&, const bgl_named_params&) [with Param0 = adjacency_list >; Param1 = adjacency_list >; P = iterator_property_map<__gnu_cxx::__normal_iterator >, adj_list_vertex_property_map >, int, int&, vertex_index_t>, void*, void*&>; T = vertex_isomorphism_t; R = no_property; typename result_of(Param0, Param1, const typename detail::convert_bgl_params_to_boost_parameter >::type&)>::type = bool; typename detail::convert_bgl_params_to_boost_parameter >::type = parameter::aux::arg_list >, adj_list_vertex_property_map >, int, int&, vertex_index_t>, void*, void*&> >, parameter::aux::empty_arg_list, std::integral_constant >]’ ordering.cpp:68:18: required from here /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::Assignable::~Assignable() [with TT = void*]’ 37 | ~model() | ^ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:145:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 145 | BOOST_CONCEPT_USAGE(Assignable) { | ^~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements > >]’: /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:145:5: required from ‘struct boost::Assignable >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:502:3: required from ‘struct boost::InputIterator >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::InputIterator >]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied > >::value’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied > >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:72:8: [ skipping 4 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/graph_concepts.hpp:176:1: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::VertexListGraphConcept > >]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/isomorphism.hpp:494:5: required from ‘bool boost::isomorphism(const Graph1&, const Graph2&, IsoMapping, Invariant1, Invariant2, std::size_t, IndexMap1, IndexMap2) [with Graph1 = adjacency_list >; Graph2 = adjacency_list >; IsoMapping = iterator_property_map<__gnu_cxx::__normal_iterator >, adj_list_vertex_property_map >, int, int&, vertex_index_t>, void*, void*&>; Invariant1 = degree_vertex_invariant >, int, const int&, vertex_index_t> >, adjacency_list > >; Invariant2 = degree_vertex_invariant >, int, const int&, vertex_index_t> >, adjacency_list > >; IndexMap1 = adj_list_vertex_property_map >, int, const int&, vertex_index_t>; IndexMap2 = adj_list_vertex_property_map >, int, const int&, vertex_index_t>; std::size_t = long unsigned int]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/isomorphism.hpp:651:42: required from ‘bool boost::graph::detail::isomorphism_impl::operator()(const Graph1&, const Graph2&, const ArgPack&) const [with ArgPack = boost::parameter::aux::arg_list >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&> >, boost::parameter::aux::empty_arg_list, std::integral_constant >; Graph1 = boost::adjacency_list >; Graph2 = boost::adjacency_list >]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/isomorphism.hpp:662:5: required from ‘typename boost::result_of(Param0, Param1, const ArgPack&)>::type boost::graph::isomorphism_with_named_params(const Param0&, const Param1&, const ArgPack&) [with Param0 = boost::adjacency_list >; Param1 = boost::adjacency_list >; ArgPack = boost::parameter::aux::arg_list >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&> >, boost::parameter::aux::empty_arg_list, std::integral_constant >; typename boost::result_of(Param0, Param1, const ArgPack&)>::type = bool]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/isomorphism.hpp:666:1: required from ‘typename boost::result_of(Param0, Param1, const typename boost::detail::convert_bgl_params_to_boost_parameter >::type&)>::type boost::isomorphism(const Param0&, const Param1&, const bgl_named_params&) [with Param0 = adjacency_list >; Param1 = adjacency_list >; P = iterator_property_map<__gnu_cxx::__normal_iterator >, adj_list_vertex_property_map >, int, int&, vertex_index_t>, void*, void*&>; T = vertex_isomorphism_t; R = no_property; typename result_of(Param0, Param1, const typename detail::convert_bgl_params_to_boost_parameter >::type&)>::type = bool; typename detail::convert_bgl_params_to_boost_parameter >::type = parameter::aux::arg_list >, adj_list_vertex_property_map >, int, int&, vertex_index_t>, void*, void*&> >, parameter::aux::empty_arg_list, std::integral_constant >]’ ordering.cpp:68:18: required from here /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::Assignable >]’ 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ^ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements > >]’: /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:233:5: required from ‘struct boost::EqualityComparable >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:502:3: required from ‘struct boost::InputIterator >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::InputIterator >]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied > >::value’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied > >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:72:8: [ skipping 4 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/graph_concepts.hpp:176:1: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::VertexListGraphConcept > >]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/isomorphism.hpp:494:5: required from ‘bool boost::isomorphism(const Graph1&, const Graph2&, IsoMapping, Invariant1, Invariant2, std::size_t, IndexMap1, IndexMap2) [with Graph1 = adjacency_list >; Graph2 = adjacency_list >; IsoMapping = iterator_property_map<__gnu_cxx::__normal_iterator >, adj_list_vertex_property_map >, int, int&, vertex_index_t>, void*, void*&>; Invariant1 = degree_vertex_invariant >, int, const int&, vertex_index_t> >, adjacency_list > >; Invariant2 = degree_vertex_invariant >, int, const int&, vertex_index_t> >, adjacency_list > >; IndexMap1 = adj_list_vertex_property_map >, int, const int&, vertex_index_t>; IndexMap2 = adj_list_vertex_property_map >, int, const int&, vertex_index_t>; std::size_t = long unsigned int]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/isomorphism.hpp:651:42: required from ‘bool boost::graph::detail::isomorphism_impl::operator()(const Graph1&, const Graph2&, const ArgPack&) const [with ArgPack = boost::parameter::aux::arg_list >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&> >, boost::parameter::aux::empty_arg_list, std::integral_constant >; Graph1 = boost::adjacency_list >; Graph2 = boost::adjacency_list >]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/isomorphism.hpp:662:5: required from ‘typename boost::result_of(Param0, Param1, const ArgPack&)>::type boost::graph::isomorphism_with_named_params(const Param0&, const Param1&, const ArgPack&) [with Param0 = boost::adjacency_list >; Param1 = boost::adjacency_list >; ArgPack = boost::parameter::aux::arg_list >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&> >, boost::parameter::aux::empty_arg_list, std::integral_constant >; typename boost::result_of(Param0, Param1, const ArgPack&)>::type = bool]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/isomorphism.hpp:666:1: required from ‘typename boost::result_of(Param0, Param1, const typename boost::detail::convert_bgl_params_to_boost_parameter >::type&)>::type boost::isomorphism(const Param0&, const Param1&, const bgl_named_params&) [with Param0 = adjacency_list >; Param1 = adjacency_list >; P = iterator_property_map<__gnu_cxx::__normal_iterator >, adj_list_vertex_property_map >, int, int&, vertex_index_t>, void*, void*&>; T = vertex_isomorphism_t; R = no_property; typename result_of(Param0, Param1, const typename detail::convert_bgl_params_to_boost_parameter >::type&)>::type = bool; typename detail::convert_bgl_params_to_boost_parameter >::type = parameter::aux::arg_list >, adj_list_vertex_property_map >, int, int&, vertex_index_t>, void*, void*&> >, parameter::aux::empty_arg_list, std::integral_constant >]’ ordering.cpp:68:18: required from here /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::EqualityComparable >]’ 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ^ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements > >]’: /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:512:7: required from ‘struct boost::InputIterator >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::InputIterator >]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied > >::value’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied > >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_ >)>’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/graph_concepts.hpp:53:35: [ skipping 3 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/graph_concepts.hpp:176:1: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::VertexListGraphConcept > >]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/isomorphism.hpp:494:5: required from ‘bool boost::isomorphism(const Graph1&, const Graph2&, IsoMapping, Invariant1, Invariant2, std::size_t, IndexMap1, IndexMap2) [with Graph1 = adjacency_list >; Graph2 = adjacency_list >; IsoMapping = iterator_property_map<__gnu_cxx::__normal_iterator >, adj_list_vertex_property_map >, int, int&, vertex_index_t>, void*, void*&>; Invariant1 = degree_vertex_invariant >, int, const int&, vertex_index_t> >, adjacency_list > >; Invariant2 = degree_vertex_invariant >, int, const int&, vertex_index_t> >, adjacency_list > >; IndexMap1 = adj_list_vertex_property_map >, int, const int&, vertex_index_t>; IndexMap2 = adj_list_vertex_property_map >, int, const int&, vertex_index_t>; std::size_t = long unsigned int]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/isomorphism.hpp:651:42: required from ‘bool boost::graph::detail::isomorphism_impl::operator()(const Graph1&, const Graph2&, const ArgPack&) const [with ArgPack = boost::parameter::aux::arg_list >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&> >, boost::parameter::aux::empty_arg_list, std::integral_constant >; Graph1 = boost::adjacency_list >; Graph2 = boost::adjacency_list >]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/isomorphism.hpp:662:5: required from ‘typename boost::result_of(Param0, Param1, const ArgPack&)>::type boost::graph::isomorphism_with_named_params(const Param0&, const Param1&, const ArgPack&) [with Param0 = boost::adjacency_list >; Param1 = boost::adjacency_list >; ArgPack = boost::parameter::aux::arg_list >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&> >, boost::parameter::aux::empty_arg_list, std::integral_constant >; typename boost::result_of(Param0, Param1, const ArgPack&)>::type = bool]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/isomorphism.hpp:666:1: required from ‘typename boost::result_of(Param0, Param1, const typename boost::detail::convert_bgl_params_to_boost_parameter >::type&)>::type boost::isomorphism(const Param0&, const Param1&, const bgl_named_params&) [with Param0 = adjacency_list >; Param1 = adjacency_list >; P = iterator_property_map<__gnu_cxx::__normal_iterator >, adj_list_vertex_property_map >, int, int&, vertex_index_t>, void*, void*&>; T = vertex_isomorphism_t; R = no_property; typename result_of(Param0, Param1, const typename detail::convert_bgl_params_to_boost_parameter >::type&)>::type = bool; typename detail::convert_bgl_params_to_boost_parameter >::type = parameter::aux::arg_list >, adj_list_vertex_property_map >, int, int&, vertex_index_t>, void*, void*&> >, parameter::aux::empty_arg_list, std::integral_constant >]’ ordering.cpp:68:18: required from here /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::InputIterator >]’ 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ^ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::InputIterator >]’: /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/graph_concepts.hpp:53:35: required from ‘boost::concepts::MultiPassInputIterator::~MultiPassInputIterator() [with T = std::_List_iterator]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::MultiPassInputIterator >]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/graph_concepts.hpp:184:9: required from ‘boost::concepts::VertexListGraph::~VertexListGraph() [with G = boost::adjacency_list >]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/graph_concepts.hpp:176:1: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::VertexListGraphConcept > >]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/isomorphism.hpp:494:5: required from ‘bool boost::isomorphism(const Graph1&, const Graph2&, IsoMapping, Invariant1, Invariant2, std::size_t, IndexMap1, IndexMap2) [with Graph1 = adjacency_list >; Graph2 = adjacency_list >; IsoMapping = iterator_property_map<__gnu_cxx::__normal_iterator >, adj_list_vertex_property_map >, int, int&, vertex_index_t>, void*, void*&>; Invariant1 = degree_vertex_invariant >, int, const int&, vertex_index_t> >, adjacency_list > >; Invariant2 = degree_vertex_invariant >, int, const int&, vertex_index_t> >, adjacency_list > >; IndexMap1 = adj_list_vertex_property_map >, int, const int&, vertex_index_t>; IndexMap2 = adj_list_vertex_property_map >, int, const int&, vertex_index_t>; std::size_t = long unsigned int]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/isomorphism.hpp:651:42: required from ‘bool boost::graph::detail::isomorphism_impl::operator()(const Graph1&, const Graph2&, const ArgPack&) const [with ArgPack = boost::parameter::aux::arg_list >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&> >, boost::parameter::aux::empty_arg_list, std::integral_constant >; Graph1 = boost::adjacency_list >; Graph2 = boost::adjacency_list >]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/isomorphism.hpp:662:5: required from ‘typename boost::result_of(Param0, Param1, const ArgPack&)>::type boost::graph::isomorphism_with_named_params(const Param0&, const Param1&, const ArgPack&) [with Param0 = boost::adjacency_list >; Param1 = boost::adjacency_list >; ArgPack = boost::parameter::aux::arg_list >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&> >, boost::parameter::aux::empty_arg_list, std::integral_constant >; typename boost::result_of(Param0, Param1, const ArgPack&)>::type = bool]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/isomorphism.hpp:666:1: required from ‘typename boost::result_of(Param0, Param1, const typename boost::detail::convert_bgl_params_to_boost_parameter >::type&)>::type boost::isomorphism(const Param0&, const Param1&, const bgl_named_params&) [with Param0 = adjacency_list >; Param1 = adjacency_list >; P = iterator_property_map<__gnu_cxx::__normal_iterator >, adj_list_vertex_property_map >, int, int&, vertex_index_t>, void*, void*&>; T = vertex_isomorphism_t; R = no_property; typename result_of(Param0, Param1, const typename detail::convert_bgl_params_to_boost_parameter >::type&)>::type = bool; typename detail::convert_bgl_params_to_boost_parameter >::type = parameter::aux::arg_list >, adj_list_vertex_property_map >, int, int&, vertex_index_t>, void*, void*&> >, parameter::aux::empty_arg_list, std::integral_constant >]’ ordering.cpp:68:18: required from here /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::InputIterator::~InputIterator() [with TT = std::_List_iterator]’ 37 | ~model() | ^ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:512:7: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 512 | BOOST_CONCEPT_USAGE(InputIterator) | ^~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements >, boost::detail::edge_desc_impl, long int> > >]’: /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:145:5: required from ‘struct boost::Assignable >, boost::detail::edge_desc_impl, long int> >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:502:3: required from ‘struct boost::InputIterator >, boost::detail::edge_desc_impl, long int> >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::InputIterator >, boost::detail::edge_desc_impl, long int> >]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied >, boost::detail::edge_desc_impl, long int> > >::value’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied >, boost::detail::edge_desc_impl, long int> > >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:72:8: [ skipping 4 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/graph_concepts.hpp:226:1: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::EdgeListGraphConcept > >]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/isomorphism.hpp:495:5: required from ‘bool boost::isomorphism(const Graph1&, const Graph2&, IsoMapping, Invariant1, Invariant2, std::size_t, IndexMap1, IndexMap2) [with Graph1 = adjacency_list >; Graph2 = adjacency_list >; IsoMapping = iterator_property_map<__gnu_cxx::__normal_iterator >, adj_list_vertex_property_map >, int, int&, vertex_index_t>, void*, void*&>; Invariant1 = degree_vertex_invariant >, int, const int&, vertex_index_t> >, adjacency_list > >; Invariant2 = degree_vertex_invariant >, int, const int&, vertex_index_t> >, adjacency_list > >; IndexMap1 = adj_list_vertex_property_map >, int, const int&, vertex_index_t>; IndexMap2 = adj_list_vertex_property_map >, int, const int&, vertex_index_t>; std::size_t = long unsigned int]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/isomorphism.hpp:651:42: required from ‘bool boost::graph::detail::isomorphism_impl::operator()(const Graph1&, const Graph2&, const ArgPack&) const [with ArgPack = boost::parameter::aux::arg_list >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&> >, boost::parameter::aux::empty_arg_list, std::integral_constant >; Graph1 = boost::adjacency_list >; Graph2 = boost::adjacency_list >]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/isomorphism.hpp:662:5: required from ‘typename boost::result_of(Param0, Param1, const ArgPack&)>::type boost::graph::isomorphism_with_named_params(const Param0&, const Param1&, const ArgPack&) [with Param0 = boost::adjacency_list >; Param1 = boost::adjacency_list >; ArgPack = boost::parameter::aux::arg_list >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&> >, boost::parameter::aux::empty_arg_list, std::integral_constant >; typename boost::result_of(Param0, Param1, const ArgPack&)>::type = bool]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/isomorphism.hpp:666:1: required from ‘typename boost::result_of(Param0, Param1, const typename boost::detail::convert_bgl_params_to_boost_parameter >::type&)>::type boost::isomorphism(const Param0&, const Param1&, const bgl_named_params&) [with Param0 = adjacency_list >; Param1 = adjacency_list >; P = iterator_property_map<__gnu_cxx::__normal_iterator >, adj_list_vertex_property_map >, int, int&, vertex_index_t>, void*, void*&>; T = vertex_isomorphism_t; R = no_property; typename result_of(Param0, Param1, const typename detail::convert_bgl_params_to_boost_parameter >::type&)>::type = bool; typename detail::convert_bgl_params_to_boost_parameter >::type = parameter::aux::arg_list >, adj_list_vertex_property_map >, int, int&, vertex_index_t>, void*, void*&> >, parameter::aux::empty_arg_list, std::integral_constant >]’ ordering.cpp:68:18: required from here /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::Assignable >, boost::detail::edge_desc_impl, long int> >]’ 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ^ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements >, boost::detail::edge_desc_impl, long int> > >]’: /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:233:5: required from ‘struct boost::EqualityComparable >, boost::detail::edge_desc_impl, long int> >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:502:3: required from ‘struct boost::InputIterator >, boost::detail::edge_desc_impl, long int> >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::InputIterator >, boost::detail::edge_desc_impl, long int> >]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied >, boost::detail::edge_desc_impl, long int> > >::value’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied >, boost::detail::edge_desc_impl, long int> > >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:72:8: [ skipping 4 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/graph_concepts.hpp:226:1: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::EdgeListGraphConcept > >]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/isomorphism.hpp:495:5: required from ‘bool boost::isomorphism(const Graph1&, const Graph2&, IsoMapping, Invariant1, Invariant2, std::size_t, IndexMap1, IndexMap2) [with Graph1 = adjacency_list >; Graph2 = adjacency_list >; IsoMapping = iterator_property_map<__gnu_cxx::__normal_iterator >, adj_list_vertex_property_map >, int, int&, vertex_index_t>, void*, void*&>; Invariant1 = degree_vertex_invariant >, int, const int&, vertex_index_t> >, adjacency_list > >; Invariant2 = degree_vertex_invariant >, int, const int&, vertex_index_t> >, adjacency_list > >; IndexMap1 = adj_list_vertex_property_map >, int, const int&, vertex_index_t>; IndexMap2 = adj_list_vertex_property_map >, int, const int&, vertex_index_t>; std::size_t = long unsigned int]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/isomorphism.hpp:651:42: required from ‘bool boost::graph::detail::isomorphism_impl::operator()(const Graph1&, const Graph2&, const ArgPack&) const [with ArgPack = boost::parameter::aux::arg_list >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&> >, boost::parameter::aux::empty_arg_list, std::integral_constant >; Graph1 = boost::adjacency_list >; Graph2 = boost::adjacency_list >]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/isomorphism.hpp:662:5: required from ‘typename boost::result_of(Param0, Param1, const ArgPack&)>::type boost::graph::isomorphism_with_named_params(const Param0&, const Param1&, const ArgPack&) [with Param0 = boost::adjacency_list >; Param1 = boost::adjacency_list >; ArgPack = boost::parameter::aux::arg_list >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&> >, boost::parameter::aux::empty_arg_list, std::integral_constant >; typename boost::result_of(Param0, Param1, const ArgPack&)>::type = bool]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/isomorphism.hpp:666:1: required from ‘typename boost::result_of(Param0, Param1, const typename boost::detail::convert_bgl_params_to_boost_parameter >::type&)>::type boost::isomorphism(const Param0&, const Param1&, const bgl_named_params&) [with Param0 = adjacency_list >; Param1 = adjacency_list >; P = iterator_property_map<__gnu_cxx::__normal_iterator >, adj_list_vertex_property_map >, int, int&, vertex_index_t>, void*, void*&>; T = vertex_isomorphism_t; R = no_property; typename result_of(Param0, Param1, const typename detail::convert_bgl_params_to_boost_parameter >::type&)>::type = bool; typename detail::convert_bgl_params_to_boost_parameter >::type = parameter::aux::arg_list >, adj_list_vertex_property_map >, int, int&, vertex_index_t>, void*, void*&> >, parameter::aux::empty_arg_list, std::integral_constant >]’ ordering.cpp:68:18: required from here /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::EqualityComparable >, boost::detail::edge_desc_impl, long int> >]’ 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ^ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements >, boost::detail::edge_desc_impl, long int> > >]’: /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:512:7: required from ‘struct boost::InputIterator >, boost::detail::edge_desc_impl, long int> >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::InputIterator >, boost::detail::edge_desc_impl, long int> >]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied >, boost::detail::edge_desc_impl, long int> > >::value’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied >, boost::detail::edge_desc_impl, long int> > >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_ >, boost::detail::edge_desc_impl, long int> >)>’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/graph_concepts.hpp:53:35: [ skipping 3 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/graph_concepts.hpp:226:1: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::EdgeListGraphConcept > >]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/isomorphism.hpp:495:5: required from ‘bool boost::isomorphism(const Graph1&, const Graph2&, IsoMapping, Invariant1, Invariant2, std::size_t, IndexMap1, IndexMap2) [with Graph1 = adjacency_list >; Graph2 = adjacency_list >; IsoMapping = iterator_property_map<__gnu_cxx::__normal_iterator >, adj_list_vertex_property_map >, int, int&, vertex_index_t>, void*, void*&>; Invariant1 = degree_vertex_invariant >, int, const int&, vertex_index_t> >, adjacency_list > >; Invariant2 = degree_vertex_invariant >, int, const int&, vertex_index_t> >, adjacency_list > >; IndexMap1 = adj_list_vertex_property_map >, int, const int&, vertex_index_t>; IndexMap2 = adj_list_vertex_property_map >, int, const int&, vertex_index_t>; std::size_t = long unsigned int]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/isomorphism.hpp:651:42: required from ‘bool boost::graph::detail::isomorphism_impl::operator()(const Graph1&, const Graph2&, const ArgPack&) const [with ArgPack = boost::parameter::aux::arg_list >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&> >, boost::parameter::aux::empty_arg_list, std::integral_constant >; Graph1 = boost::adjacency_list >; Graph2 = boost::adjacency_list >]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/isomorphism.hpp:662:5: required from ‘typename boost::result_of(Param0, Param1, const ArgPack&)>::type boost::graph::isomorphism_with_named_params(const Param0&, const Param1&, const ArgPack&) [with Param0 = boost::adjacency_list >; Param1 = boost::adjacency_list >; ArgPack = boost::parameter::aux::arg_list >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&> >, boost::parameter::aux::empty_arg_list, std::integral_constant >; typename boost::result_of(Param0, Param1, const ArgPack&)>::type = bool]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/isomorphism.hpp:666:1: required from ‘typename boost::result_of(Param0, Param1, const typename boost::detail::convert_bgl_params_to_boost_parameter >::type&)>::type boost::isomorphism(const Param0&, const Param1&, const bgl_named_params&) [with Param0 = adjacency_list >; Param1 = adjacency_list >; P = iterator_property_map<__gnu_cxx::__normal_iterator >, adj_list_vertex_property_map >, int, int&, vertex_index_t>, void*, void*&>; T = vertex_isomorphism_t; R = no_property; typename result_of(Param0, Param1, const typename detail::convert_bgl_params_to_boost_parameter >::type&)>::type = bool; typename detail::convert_bgl_params_to_boost_parameter >::type = parameter::aux::arg_list >, adj_list_vertex_property_map >, int, int&, vertex_index_t>, void*, void*&> >, parameter::aux::empty_arg_list, std::integral_constant >]’ ordering.cpp:68:18: required from here /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::InputIterator >, boost::detail::edge_desc_impl, long int> >]’ 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ^ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::InputIterator >, boost::detail::edge_desc_impl, long int> >]’: /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/graph_concepts.hpp:53:35: required from ‘boost::concepts::MultiPassInputIterator::~MultiPassInputIterator() [with T = boost::detail::undirected_edge_iter >, boost::detail::edge_desc_impl, long int>]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::MultiPassInputIterator >, boost::detail::edge_desc_impl, long int> >]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/graph_concepts.hpp:235:9: required from ‘boost::concepts::EdgeListGraph::~EdgeListGraph() [with G = boost::adjacency_list >]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/graph_concepts.hpp:226:1: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::EdgeListGraphConcept > >]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/isomorphism.hpp:495:5: required from ‘bool boost::isomorphism(const Graph1&, const Graph2&, IsoMapping, Invariant1, Invariant2, std::size_t, IndexMap1, IndexMap2) [with Graph1 = adjacency_list >; Graph2 = adjacency_list >; IsoMapping = iterator_property_map<__gnu_cxx::__normal_iterator >, adj_list_vertex_property_map >, int, int&, vertex_index_t>, void*, void*&>; Invariant1 = degree_vertex_invariant >, int, const int&, vertex_index_t> >, adjacency_list > >; Invariant2 = degree_vertex_invariant >, int, const int&, vertex_index_t> >, adjacency_list > >; IndexMap1 = adj_list_vertex_property_map >, int, const int&, vertex_index_t>; IndexMap2 = adj_list_vertex_property_map >, int, const int&, vertex_index_t>; std::size_t = long unsigned int]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/isomorphism.hpp:651:42: required from ‘bool boost::graph::detail::isomorphism_impl::operator()(const Graph1&, const Graph2&, const ArgPack&) const [with ArgPack = boost::parameter::aux::arg_list >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&> >, boost::parameter::aux::empty_arg_list, std::integral_constant >; Graph1 = boost::adjacency_list >; Graph2 = boost::adjacency_list >]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/isomorphism.hpp:662:5: required from ‘typename boost::result_of(Param0, Param1, const ArgPack&)>::type boost::graph::isomorphism_with_named_params(const Param0&, const Param1&, const ArgPack&) [with Param0 = boost::adjacency_list >; Param1 = boost::adjacency_list >; ArgPack = boost::parameter::aux::arg_list >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&> >, boost::parameter::aux::empty_arg_list, std::integral_constant >; typename boost::result_of(Param0, Param1, const ArgPack&)>::type = bool]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/isomorphism.hpp:666:1: required from ‘typename boost::result_of(Param0, Param1, const typename boost::detail::convert_bgl_params_to_boost_parameter >::type&)>::type boost::isomorphism(const Param0&, const Param1&, const bgl_named_params&) [with Param0 = adjacency_list >; Param1 = adjacency_list >; P = iterator_property_map<__gnu_cxx::__normal_iterator >, adj_list_vertex_property_map >, int, int&, vertex_index_t>, void*, void*&>; T = vertex_isomorphism_t; R = no_property; typename result_of(Param0, Param1, const typename detail::convert_bgl_params_to_boost_parameter >::type&)>::type = bool; typename detail::convert_bgl_params_to_boost_parameter >::type = parameter::aux::arg_list >, adj_list_vertex_property_map >, int, int&, vertex_index_t>, void*, void*&> >, parameter::aux::empty_arg_list, std::integral_constant >]’ ordering.cpp:68:18: required from here /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::InputIterator::~InputIterator() [with TT = boost::detail::undirected_edge_iter >, boost::detail::edge_desc_impl, long int>]’ 37 | ~model() | ^ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:512:7: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 512 | BOOST_CONCEPT_USAGE(InputIterator) | ^~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::concepts::IncidenceGraph > >]’: /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements > > >]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/graph_concepts.hpp:87:5: required from ‘struct boost::concepts::IncidenceGraph > >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/graph_concepts.hpp:75:1: required from ‘struct boost::concepts::IncidenceGraphConcept > >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::concepts::IncidenceGraphConcept > >]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied > > >::value’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:45:51: [ skipping 4 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/isomorphism.hpp:209:38: required from ‘bool boost::detail::isomorphism_algo::test_isomorphism() [with Graph1 = boost::adjacency_list >; Graph2 = boost::adjacency_list >; IsoMapping = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&>; Invariant1 = boost::degree_vertex_invariant >, int, const int&, boost::vertex_index_t> >, boost::adjacency_list > >; Invariant2 = boost::degree_vertex_invariant >, int, const int&, boost::vertex_index_t> >, boost::adjacency_list > >; IndexMap1 = boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>; IndexMap2 = boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/isomorphism.hpp:532:33: required from ‘bool boost::isomorphism(const Graph1&, const Graph2&, IsoMapping, Invariant1, Invariant2, std::size_t, IndexMap1, IndexMap2) [with Graph1 = adjacency_list >; Graph2 = adjacency_list >; IsoMapping = iterator_property_map<__gnu_cxx::__normal_iterator >, adj_list_vertex_property_map >, int, int&, vertex_index_t>, void*, void*&>; Invariant1 = degree_vertex_invariant >, int, const int&, vertex_index_t> >, adjacency_list > >; Invariant2 = degree_vertex_invariant >, int, const int&, vertex_index_t> >, adjacency_list > >; IndexMap1 = adj_list_vertex_property_map >, int, const int&, vertex_index_t>; IndexMap2 = adj_list_vertex_property_map >, int, const int&, vertex_index_t>; std::size_t = long unsigned int]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/isomorphism.hpp:651:42: required from ‘bool boost::graph::detail::isomorphism_impl::operator()(const Graph1&, const Graph2&, const ArgPack&) const [with ArgPack = boost::parameter::aux::arg_list >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&> >, boost::parameter::aux::empty_arg_list, std::integral_constant >; Graph1 = boost::adjacency_list >; Graph2 = boost::adjacency_list >]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/isomorphism.hpp:662:5: required from ‘typename boost::result_of(Param0, Param1, const ArgPack&)>::type boost::graph::isomorphism_with_named_params(const Param0&, const Param1&, const ArgPack&) [with Param0 = boost::adjacency_list >; Param1 = boost::adjacency_list >; ArgPack = boost::parameter::aux::arg_list >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&> >, boost::parameter::aux::empty_arg_list, std::integral_constant >; typename boost::result_of(Param0, Param1, const ArgPack&)>::type = bool]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/isomorphism.hpp:666:1: required from ‘typename boost::result_of(Param0, Param1, const typename boost::detail::convert_bgl_params_to_boost_parameter >::type&)>::type boost::isomorphism(const Param0&, const Param1&, const bgl_named_params&) [with Param0 = adjacency_list >; Param1 = adjacency_list >; P = iterator_property_map<__gnu_cxx::__normal_iterator >, adj_list_vertex_property_map >, int, int&, vertex_index_t>, void*, void*&>; T = vertex_isomorphism_t; R = no_property; typename result_of(Param0, Param1, const typename detail::convert_bgl_params_to_boost_parameter >::type&)>::type = bool; typename detail::convert_bgl_params_to_boost_parameter >::type = parameter::aux::arg_list >, adj_list_vertex_property_map >, int, int&, vertex_index_t>, void*, void*&> >, parameter::aux::empty_arg_list, std::integral_constant >]’ ordering.cpp:68:18: required from here /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::concepts::IncidenceGraph::~IncidenceGraph() [with G = boost::adjacency_list >]’ 37 | ~model() | ^ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/graph_concepts.hpp:87:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 87 | BOOST_CONCEPT_USAGE(IncidenceGraph) | ^~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements >, boost::adjacency_list >, boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&>, boost::degree_vertex_invariant >, int, const int&, boost::vertex_index_t> >, boost::adjacency_list > >, boost::degree_vertex_invariant >, int, const int&, boost::vertex_index_t> >, boost::adjacency_list > >, boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>, boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t> >::record_dfs_order> >]’: /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:167:5: required from ‘struct boost::CopyConstructible >, boost::adjacency_list >, boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&>, boost::degree_vertex_invariant >, int, const int&, boost::vertex_index_t> >, boost::adjacency_list > >, boost::degree_vertex_invariant >, int, const int&, boost::vertex_index_t> >, boost::adjacency_list > >, boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>, boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t> >::record_dfs_order>’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:165:3: required from ‘struct boost::CopyConstructibleConcept >, boost::adjacency_list >, boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&>, boost::degree_vertex_invariant >, int, const int&, boost::vertex_index_t> >, boost::adjacency_list > >, boost::degree_vertex_invariant >, int, const int&, boost::vertex_index_t> >, boost::adjacency_list > >, boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>, boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t> >::record_dfs_order>’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::CopyConstructibleConcept >, boost::adjacency_list >, boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&>, boost::degree_vertex_invariant >, int, const int&, boost::vertex_index_t> >, boost::adjacency_list > >, boost::degree_vertex_invariant >, int, const int&, boost::vertex_index_t> >, boost::adjacency_list > >, boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>, boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t> >::record_dfs_order>]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied >, boost::adjacency_list >, boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&>, boost::degree_vertex_invariant >, int, const int&, boost::vertex_index_t> >, boost::adjacency_list > >, boost::degree_vertex_invariant >, int, const int&, boost::vertex_index_t> >, boost::adjacency_list > >, boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>, boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t> >::record_dfs_order> >::value’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied >, boost::adjacency_list >, boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&>, boost::degree_vertex_invariant >, int, const int&, boost::vertex_index_t> >, boost::adjacency_list > >, boost::degree_vertex_invariant >, int, const int&, boost::vertex_index_t> >, boost::adjacency_list > >, boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>, boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t> >::record_dfs_order> >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:72:8: [ skipping 8 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/isomorphism.hpp:209:38: required from ‘bool boost::detail::isomorphism_algo::test_isomorphism() [with Graph1 = boost::adjacency_list >; Graph2 = boost::adjacency_list >; IsoMapping = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&>; Invariant1 = boost::degree_vertex_invariant >, int, const int&, boost::vertex_index_t> >, boost::adjacency_list > >; Invariant2 = boost::degree_vertex_invariant >, int, const int&, boost::vertex_index_t> >, boost::adjacency_list > >; IndexMap1 = boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>; IndexMap2 = boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/isomorphism.hpp:532:33: required from ‘bool boost::isomorphism(const Graph1&, const Graph2&, IsoMapping, Invariant1, Invariant2, std::size_t, IndexMap1, IndexMap2) [with Graph1 = adjacency_list >; Graph2 = adjacency_list >; IsoMapping = iterator_property_map<__gnu_cxx::__normal_iterator >, adj_list_vertex_property_map >, int, int&, vertex_index_t>, void*, void*&>; Invariant1 = degree_vertex_invariant >, int, const int&, vertex_index_t> >, adjacency_list > >; Invariant2 = degree_vertex_invariant >, int, const int&, vertex_index_t> >, adjacency_list > >; IndexMap1 = adj_list_vertex_property_map >, int, const int&, vertex_index_t>; IndexMap2 = adj_list_vertex_property_map >, int, const int&, vertex_index_t>; std::size_t = long unsigned int]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/isomorphism.hpp:651:42: required from ‘bool boost::graph::detail::isomorphism_impl::operator()(const Graph1&, const Graph2&, const ArgPack&) const [with ArgPack = boost::parameter::aux::arg_list >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&> >, boost::parameter::aux::empty_arg_list, std::integral_constant >; Graph1 = boost::adjacency_list >; Graph2 = boost::adjacency_list >]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/isomorphism.hpp:662:5: required from ‘typename boost::result_of(Param0, Param1, const ArgPack&)>::type boost::graph::isomorphism_with_named_params(const Param0&, const Param1&, const ArgPack&) [with Param0 = boost::adjacency_list >; Param1 = boost::adjacency_list >; ArgPack = boost::parameter::aux::arg_list >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&> >, boost::parameter::aux::empty_arg_list, std::integral_constant >; typename boost::result_of(Param0, Param1, const ArgPack&)>::type = bool]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/isomorphism.hpp:666:1: required from ‘typename boost::result_of(Param0, Param1, const typename boost::detail::convert_bgl_params_to_boost_parameter >::type&)>::type boost::isomorphism(const Param0&, const Param1&, const bgl_named_params&) [with Param0 = adjacency_list >; Param1 = adjacency_list >; P = iterator_property_map<__gnu_cxx::__normal_iterator >, adj_list_vertex_property_map >, int, int&, vertex_index_t>, void*, void*&>; T = vertex_isomorphism_t; R = no_property; typename result_of(Param0, Param1, const typename detail::convert_bgl_params_to_boost_parameter >::type&)>::type = bool; typename detail::convert_bgl_params_to_boost_parameter >::type = parameter::aux::arg_list >, adj_list_vertex_property_map >, int, int&, vertex_index_t>, void*, void*&> >, parameter::aux::empty_arg_list, std::integral_constant >]’ ordering.cpp:68:18: required from here /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::CopyConstructible >, boost::adjacency_list >, boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&>, boost::degree_vertex_invariant >, int, const int&, boost::vertex_index_t> >, boost::adjacency_list > >, boost::degree_vertex_invariant >, int, const int&, boost::vertex_index_t> >, boost::adjacency_list > >, boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>, boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t> >::record_dfs_order>]’ 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ^ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::CopyConstructibleConcept >, boost::adjacency_list >, boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&>, boost::degree_vertex_invariant >, int, const int&, boost::vertex_index_t> >, boost::adjacency_list > >, boost::degree_vertex_invariant >, int, const int&, boost::vertex_index_t> >, boost::adjacency_list > >, boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>, boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t> >::record_dfs_order>]’: /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/depth_first_search.hpp:41:9: required from ‘void boost::DFSVisitorConcept::constraints() [with Visitor = boost::detail::isomorphism_algo >, boost::adjacency_list >, boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&>, boost::degree_vertex_invariant >, int, const int&, boost::vertex_index_t> >, boost::adjacency_list > >, boost::degree_vertex_invariant >, int, const int&, boost::vertex_index_t> >, boost::adjacency_list > >, boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>, boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t> >::record_dfs_order; Graph = boost::adjacency_list >]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::DFSVisitorConcept >, boost::adjacency_list >, boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&>, boost::degree_vertex_invariant >, int, const int&, boost::vertex_index_t> >, boost::adjacency_list > >, boost::degree_vertex_invariant >, int, const int&, boost::vertex_index_t> >, boost::adjacency_list > >, boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>, boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t> >::record_dfs_order, boost::adjacency_list > >]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied >, boost::adjacency_list >, boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&>, boost::degree_vertex_invariant >, int, const int&, boost::vertex_index_t> >, boost::adjacency_list > >, boost::degree_vertex_invariant >, int, const int&, boost::vertex_index_t> >, boost::adjacency_list > >, boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>, boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t> >::record_dfs_order, boost::adjacency_list > > >::value’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied >, boost::adjacency_list >, boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&>, boost::degree_vertex_invariant >, int, const int&, boost::vertex_index_t> >, boost::adjacency_list > >, boost::degree_vertex_invariant >, int, const int&, boost::vertex_index_t> >, boost::adjacency_list > >, boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>, boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t> >::record_dfs_order, boost::adjacency_list > > >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_ >, boost::adjacency_list >, boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&>, boost::degree_vertex_invariant >, int, const int&, boost::vertex_index_t> >, boost::adjacency_list > >, boost::degree_vertex_invariant >, int, const int&, boost::vertex_index_t> >, boost::adjacency_list > >, boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>, boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t> >::record_dfs_order, boost::adjacency_list > >)>’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/depth_first_search.hpp:130:9: [ skipping 2 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/isomorphism.hpp:209:38: required from ‘bool boost::detail::isomorphism_algo::test_isomorphism() [with Graph1 = boost::adjacency_list >; Graph2 = boost::adjacency_list >; IsoMapping = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&>; Invariant1 = boost::degree_vertex_invariant >, int, const int&, boost::vertex_index_t> >, boost::adjacency_list > >; Invariant2 = boost::degree_vertex_invariant >, int, const int&, boost::vertex_index_t> >, boost::adjacency_list > >; IndexMap1 = boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>; IndexMap2 = boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/isomorphism.hpp:532:33: required from ‘bool boost::isomorphism(const Graph1&, const Graph2&, IsoMapping, Invariant1, Invariant2, std::size_t, IndexMap1, IndexMap2) [with Graph1 = adjacency_list >; Graph2 = adjacency_list >; IsoMapping = iterator_property_map<__gnu_cxx::__normal_iterator >, adj_list_vertex_property_map >, int, int&, vertex_index_t>, void*, void*&>; Invariant1 = degree_vertex_invariant >, int, const int&, vertex_index_t> >, adjacency_list > >; Invariant2 = degree_vertex_invariant >, int, const int&, vertex_index_t> >, adjacency_list > >; IndexMap1 = adj_list_vertex_property_map >, int, const int&, vertex_index_t>; IndexMap2 = adj_list_vertex_property_map >, int, const int&, vertex_index_t>; std::size_t = long unsigned int]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/isomorphism.hpp:651:42: required from ‘bool boost::graph::detail::isomorphism_impl::operator()(const Graph1&, const Graph2&, const ArgPack&) const [with ArgPack = boost::parameter::aux::arg_list >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&> >, boost::parameter::aux::empty_arg_list, std::integral_constant >; Graph1 = boost::adjacency_list >; Graph2 = boost::adjacency_list >]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/isomorphism.hpp:662:5: required from ‘typename boost::result_of(Param0, Param1, const ArgPack&)>::type boost::graph::isomorphism_with_named_params(const Param0&, const Param1&, const ArgPack&) [with Param0 = boost::adjacency_list >; Param1 = boost::adjacency_list >; ArgPack = boost::parameter::aux::arg_list >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&> >, boost::parameter::aux::empty_arg_list, std::integral_constant >; typename boost::result_of(Param0, Param1, const ArgPack&)>::type = bool]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/isomorphism.hpp:666:1: required from ‘typename boost::result_of(Param0, Param1, const typename boost::detail::convert_bgl_params_to_boost_parameter >::type&)>::type boost::isomorphism(const Param0&, const Param1&, const bgl_named_params&) [with Param0 = adjacency_list >; Param1 = adjacency_list >; P = iterator_property_map<__gnu_cxx::__normal_iterator >, adj_list_vertex_property_map >, int, int&, vertex_index_t>, void*, void*&>; T = vertex_isomorphism_t; R = no_property; typename result_of(Param0, Param1, const typename detail::convert_bgl_params_to_boost_parameter >::type&)>::type = bool; typename detail::convert_bgl_params_to_boost_parameter >::type = parameter::aux::arg_list >, adj_list_vertex_property_map >, int, int&, vertex_index_t>, void*, void*&> >, parameter::aux::empty_arg_list, std::integral_constant >]’ ordering.cpp:68:18: required from here /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:165:17: note: in a call to non-static member function ‘boost::CopyConstructibleConcept >, boost::adjacency_list >, boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&>, boost::degree_vertex_invariant >, int, const int&, boost::vertex_index_t> >, boost::adjacency_list > >, boost::degree_vertex_invariant >, int, const int&, boost::vertex_index_t> >, boost::adjacency_list > >, boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>, boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t> >::record_dfs_order>::~CopyConstructibleConcept()’ 165 | BOOST_concept(CopyConstructible,(TT)) | ^~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/preprocessor/cat.hpp:29:34: note: in definition of macro ‘BOOST_PP_CAT_I’ 29 | # define BOOST_PP_CAT_I(a, b) a ## b | ^ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/concept_def.hpp:23:12: note: in expansion of macro ‘BOOST_PP_CAT’ 23 | struct BOOST_PP_CAT(name,Concept) \ | ^~~~~~~~~~~~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:165:3: note: in expansion of macro ‘BOOST_concept’ 165 | BOOST_concept(CopyConstructible,(TT)) | ^~~~~~~~~~~~~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::constraint::failed() [with Model = boost::ReadablePropertyMapConcept >, boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>, boost::default_color_type, boost::default_color_type&>, void*>]’: /home/omnipath/local/R/4.4-3.20/BH/include/boost/property_map/property_map.hpp:206:7: required from ‘void boost::ReadWritePropertyMapConcept::constraints() [with PMap = boost::safe_iterator_property_map<__gnu_cxx::__normal_iterator >, boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>, boost::default_color_type, boost::default_color_type&>; Key = void*]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::ReadWritePropertyMapConcept >, boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>, boost::default_color_type, boost::default_color_type&>, void*>]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied >, boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>, boost::default_color_type, boost::default_color_type&>, void*> >::value’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied >, boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>, boost::default_color_type, boost::default_color_type&>, void*> >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_ >, boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>, boost::default_color_type, boost::default_color_type&>, void*>)>’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/depth_first_search.hpp:134:9: [ skipping 2 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/isomorphism.hpp:209:38: required from ‘bool boost::detail::isomorphism_algo::test_isomorphism() [with Graph1 = boost::adjacency_list >; Graph2 = boost::adjacency_list >; IsoMapping = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&>; Invariant1 = boost::degree_vertex_invariant >, int, const int&, boost::vertex_index_t> >, boost::adjacency_list > >; Invariant2 = boost::degree_vertex_invariant >, int, const int&, boost::vertex_index_t> >, boost::adjacency_list > >; IndexMap1 = boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>; IndexMap2 = boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/isomorphism.hpp:532:33: required from ‘bool boost::isomorphism(const Graph1&, const Graph2&, IsoMapping, Invariant1, Invariant2, std::size_t, IndexMap1, IndexMap2) [with Graph1 = adjacency_list >; Graph2 = adjacency_list >; IsoMapping = iterator_property_map<__gnu_cxx::__normal_iterator >, adj_list_vertex_property_map >, int, int&, vertex_index_t>, void*, void*&>; Invariant1 = degree_vertex_invariant >, int, const int&, vertex_index_t> >, adjacency_list > >; Invariant2 = degree_vertex_invariant >, int, const int&, vertex_index_t> >, adjacency_list > >; IndexMap1 = adj_list_vertex_property_map >, int, const int&, vertex_index_t>; IndexMap2 = adj_list_vertex_property_map >, int, const int&, vertex_index_t>; std::size_t = long unsigned int]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/isomorphism.hpp:651:42: required from ‘bool boost::graph::detail::isomorphism_impl::operator()(const Graph1&, const Graph2&, const ArgPack&) const [with ArgPack = boost::parameter::aux::arg_list >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&> >, boost::parameter::aux::empty_arg_list, std::integral_constant >; Graph1 = boost::adjacency_list >; Graph2 = boost::adjacency_list >]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/isomorphism.hpp:662:5: required from ‘typename boost::result_of(Param0, Param1, const ArgPack&)>::type boost::graph::isomorphism_with_named_params(const Param0&, const Param1&, const ArgPack&) [with Param0 = boost::adjacency_list >; Param1 = boost::adjacency_list >; ArgPack = boost::parameter::aux::arg_list >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&> >, boost::parameter::aux::empty_arg_list, std::integral_constant >; typename boost::result_of(Param0, Param1, const ArgPack&)>::type = bool]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/isomorphism.hpp:666:1: required from ‘typename boost::result_of(Param0, Param1, const typename boost::detail::convert_bgl_params_to_boost_parameter >::type&)>::type boost::isomorphism(const Param0&, const Param1&, const bgl_named_params&) [with Param0 = adjacency_list >; Param1 = adjacency_list >; P = iterator_property_map<__gnu_cxx::__normal_iterator >, adj_list_vertex_property_map >, int, int&, vertex_index_t>, void*, void*&>; T = vertex_isomorphism_t; R = no_property; typename result_of(Param0, Param1, const typename detail::convert_bgl_params_to_boost_parameter >::type&)>::type = bool; typename detail::convert_bgl_params_to_boost_parameter >::type = parameter::aux::arg_list >, adj_list_vertex_property_map >, int, int&, vertex_index_t>, void*, void*&> >, parameter::aux::empty_arg_list, std::integral_constant >]’ ordering.cpp:68:18: required from here /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:65:52: warning: ‘this’ pointer is null [-Wnonnull] 65 | static void failed() { ((Model*)0)->constraints(); } | ~~~~~~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/property_map/property_map.hpp:147:10: note: in a call to non-static member function ‘void boost::ReadablePropertyMapConcept::constraints() [with PMap = boost::safe_iterator_property_map<__gnu_cxx::__normal_iterator >, boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>, boost::default_color_type, boost::default_color_type&>; Key = void*]’ 147 | void constraints() { | ^~~~~~~~~~~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::constraint::failed() [with Model = boost::WritablePropertyMapConcept >, boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>, boost::default_color_type, boost::default_color_type&>, void*>]’: /home/omnipath/local/R/4.4-3.20/BH/include/boost/property_map/property_map.hpp:207:7: required from ‘void boost::ReadWritePropertyMapConcept::constraints() [with PMap = boost::safe_iterator_property_map<__gnu_cxx::__normal_iterator >, boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>, boost::default_color_type, boost::default_color_type&>; Key = void*]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::ReadWritePropertyMapConcept >, boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>, boost::default_color_type, boost::default_color_type&>, void*>]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied >, boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>, boost::default_color_type, boost::default_color_type&>, void*> >::value’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied >, boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>, boost::default_color_type, boost::default_color_type&>, void*> >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_ >, boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>, boost::default_color_type, boost::default_color_type&>, void*>)>’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/depth_first_search.hpp:134:9: [ skipping 2 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/isomorphism.hpp:209:38: required from ‘bool boost::detail::isomorphism_algo::test_isomorphism() [with Graph1 = boost::adjacency_list >; Graph2 = boost::adjacency_list >; IsoMapping = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&>; Invariant1 = boost::degree_vertex_invariant >, int, const int&, boost::vertex_index_t> >, boost::adjacency_list > >; Invariant2 = boost::degree_vertex_invariant >, int, const int&, boost::vertex_index_t> >, boost::adjacency_list > >; IndexMap1 = boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>; IndexMap2 = boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/isomorphism.hpp:532:33: required from ‘bool boost::isomorphism(const Graph1&, const Graph2&, IsoMapping, Invariant1, Invariant2, std::size_t, IndexMap1, IndexMap2) [with Graph1 = adjacency_list >; Graph2 = adjacency_list >; IsoMapping = iterator_property_map<__gnu_cxx::__normal_iterator >, adj_list_vertex_property_map >, int, int&, vertex_index_t>, void*, void*&>; Invariant1 = degree_vertex_invariant >, int, const int&, vertex_index_t> >, adjacency_list > >; Invariant2 = degree_vertex_invariant >, int, const int&, vertex_index_t> >, adjacency_list > >; IndexMap1 = adj_list_vertex_property_map >, int, const int&, vertex_index_t>; IndexMap2 = adj_list_vertex_property_map >, int, const int&, vertex_index_t>; std::size_t = long unsigned int]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/isomorphism.hpp:651:42: required from ‘bool boost::graph::detail::isomorphism_impl::operator()(const Graph1&, const Graph2&, const ArgPack&) const [with ArgPack = boost::parameter::aux::arg_list >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&> >, boost::parameter::aux::empty_arg_list, std::integral_constant >; Graph1 = boost::adjacency_list >; Graph2 = boost::adjacency_list >]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/isomorphism.hpp:662:5: required from ‘typename boost::result_of(Param0, Param1, const ArgPack&)>::type boost::graph::isomorphism_with_named_params(const Param0&, const Param1&, const ArgPack&) [with Param0 = boost::adjacency_list >; Param1 = boost::adjacency_list >; ArgPack = boost::parameter::aux::arg_list >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&> >, boost::parameter::aux::empty_arg_list, std::integral_constant >; typename boost::result_of(Param0, Param1, const ArgPack&)>::type = bool]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/isomorphism.hpp:666:1: required from ‘typename boost::result_of(Param0, Param1, const typename boost::detail::convert_bgl_params_to_boost_parameter >::type&)>::type boost::isomorphism(const Param0&, const Param1&, const bgl_named_params&) [with Param0 = adjacency_list >; Param1 = adjacency_list >; P = iterator_property_map<__gnu_cxx::__normal_iterator >, adj_list_vertex_property_map >, int, int&, vertex_index_t>, void*, void*&>; T = vertex_isomorphism_t; R = no_property; typename result_of(Param0, Param1, const typename detail::convert_bgl_params_to_boost_parameter >::type&)>::type = bool; typename detail::convert_bgl_params_to_boost_parameter >::type = parameter::aux::arg_list >, adj_list_vertex_property_map >, int, int&, vertex_index_t>, void*, void*&> >, parameter::aux::empty_arg_list, std::integral_constant >]’ ordering.cpp:68:18: required from here /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:65:52: warning: ‘this’ pointer is null [-Wnonnull] 65 | static void failed() { ((Model*)0)->constraints(); } | ~~~~~~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/property_map/property_map.hpp:179:10: note: in a call to non-static member function ‘void boost::WritablePropertyMapConcept::constraints() [with PMap = boost::safe_iterator_property_map<__gnu_cxx::__normal_iterator >, boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>, boost::default_color_type, boost::default_color_type&>; Key = void*]’ 179 | void constraints() { | ^~~~~~~~~~~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::CopyConstructible >, void*, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator >, boost::no_property>*, std::vector >, boost::no_property>, std::allocator >, boost::no_property> > > >, void*, boost::detail::edge_desc_impl, long int>, long int> >]’: /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements >, void*, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator >, boost::no_property>*, std::vector >, boost::no_property>, std::allocator >, boost::no_property> > > >, void*, boost::detail::edge_desc_impl, long int>, long int> > >]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:167:5: required from ‘struct boost::CopyConstructible >, void*, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator >, boost::no_property>*, std::vector >, boost::no_property>, std::allocator >, boost::no_property> > > >, void*, boost::detail::edge_desc_impl, long int>, long int> >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/range/concepts.hpp:125:16: required from ‘struct boost::range_detail::IncrementableIteratorConcept >, void*, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator >, boost::no_property>*, std::vector >, boost::no_property>, std::allocator >, boost::no_property> > > >, void*, boost::detail::edge_desc_impl, long int>, long int> >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/range/concepts.hpp:147:16: required from ‘struct boost::range_detail::SinglePassIteratorConcept >, void*, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator >, boost::no_property>*, std::vector >, boost::no_property>, std::allocator >, boost::no_property> > > >, void*, boost::detail::edge_desc_impl, long int>, long int> >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::range_detail::SinglePassIteratorConcept >, void*, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator >, boost::no_property>*, std::vector >, boost::no_property>, std::allocator >, boost::no_property> > > >, void*, boost::detail::edge_desc_impl, long int>, long int> >]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:42:5: [ skipping 10 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/isomorphism.hpp:229:26: required from ‘bool boost::detail::isomorphism_algo::test_isomorphism() [with Graph1 = boost::adjacency_list >; Graph2 = boost::adjacency_list >; IsoMapping = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&>; Invariant1 = boost::degree_vertex_invariant >, int, const int&, boost::vertex_index_t> >, boost::adjacency_list > >; Invariant2 = boost::degree_vertex_invariant >, int, const int&, boost::vertex_index_t> >, boost::adjacency_list > >; IndexMap1 = boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>; IndexMap2 = boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/isomorphism.hpp:532:33: required from ‘bool boost::isomorphism(const Graph1&, const Graph2&, IsoMapping, Invariant1, Invariant2, std::size_t, IndexMap1, IndexMap2) [with Graph1 = adjacency_list >; Graph2 = adjacency_list >; IsoMapping = iterator_property_map<__gnu_cxx::__normal_iterator >, adj_list_vertex_property_map >, int, int&, vertex_index_t>, void*, void*&>; Invariant1 = degree_vertex_invariant >, int, const int&, vertex_index_t> >, adjacency_list > >; Invariant2 = degree_vertex_invariant >, int, const int&, vertex_index_t> >, adjacency_list > >; IndexMap1 = adj_list_vertex_property_map >, int, const int&, vertex_index_t>; IndexMap2 = adj_list_vertex_property_map >, int, const int&, vertex_index_t>; std::size_t = long unsigned int]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/isomorphism.hpp:651:42: required from ‘bool boost::graph::detail::isomorphism_impl::operator()(const Graph1&, const Graph2&, const ArgPack&) const [with ArgPack = boost::parameter::aux::arg_list >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&> >, boost::parameter::aux::empty_arg_list, std::integral_constant >; Graph1 = boost::adjacency_list >; Graph2 = boost::adjacency_list >]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/isomorphism.hpp:662:5: required from ‘typename boost::result_of(Param0, Param1, const ArgPack&)>::type boost::graph::isomorphism_with_named_params(const Param0&, const Param1&, const ArgPack&) [with Param0 = boost::adjacency_list >; Param1 = boost::adjacency_list >; ArgPack = boost::parameter::aux::arg_list >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&> >, boost::parameter::aux::empty_arg_list, std::integral_constant >; typename boost::result_of(Param0, Param1, const ArgPack&)>::type = bool]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/isomorphism.hpp:666:1: required from ‘typename boost::result_of(Param0, Param1, const typename boost::detail::convert_bgl_params_to_boost_parameter >::type&)>::type boost::isomorphism(const Param0&, const Param1&, const bgl_named_params&) [with Param0 = adjacency_list >; Param1 = adjacency_list >; P = iterator_property_map<__gnu_cxx::__normal_iterator >, adj_list_vertex_property_map >, int, int&, vertex_index_t>, void*, void*&>; T = vertex_isomorphism_t; R = no_property; typename result_of(Param0, Param1, const typename detail::convert_bgl_params_to_boost_parameter >::type&)>::type = bool; typename detail::convert_bgl_params_to_boost_parameter >::type = parameter::aux::arg_list >, adj_list_vertex_property_map >, int, int&, vertex_index_t>, void*, void*&> >, parameter::aux::empty_arg_list, std::integral_constant >]’ ordering.cpp:68:18: required from here /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::CopyConstructible::~CopyConstructible() [with TT = boost::adjacency_iterator >, void*, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator >, boost::no_property>*, std::vector >, boost::no_property>, std::allocator >, boost::no_property> > > >, void*, boost::detail::edge_desc_impl, long int>, long int>]’ 37 | ~model() | ^ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:167:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 167 | BOOST_CONCEPT_USAGE(CopyConstructible) { | ^~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::Convertible, boost::iterators::incrementable_traversal_tag>]’: /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements, boost::iterators::incrementable_traversal_tag> >]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:208:5: required from ‘struct boost::Convertible, boost::iterators::incrementable_traversal_tag>’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::Convertible, boost::iterators::incrementable_traversal_tag>]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied, boost::iterators::incrementable_traversal_tag> >::value’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied, boost::iterators::incrementable_traversal_tag> >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:72:8: [ skipping 14 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/isomorphism.hpp:229:26: required from ‘bool boost::detail::isomorphism_algo::test_isomorphism() [with Graph1 = boost::adjacency_list >; Graph2 = boost::adjacency_list >; IsoMapping = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&>; Invariant1 = boost::degree_vertex_invariant >, int, const int&, boost::vertex_index_t> >, boost::adjacency_list > >; Invariant2 = boost::degree_vertex_invariant >, int, const int&, boost::vertex_index_t> >, boost::adjacency_list > >; IndexMap1 = boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>; IndexMap2 = boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/isomorphism.hpp:532:33: required from ‘bool boost::isomorphism(const Graph1&, const Graph2&, IsoMapping, Invariant1, Invariant2, std::size_t, IndexMap1, IndexMap2) [with Graph1 = adjacency_list >; Graph2 = adjacency_list >; IsoMapping = iterator_property_map<__gnu_cxx::__normal_iterator >, adj_list_vertex_property_map >, int, int&, vertex_index_t>, void*, void*&>; Invariant1 = degree_vertex_invariant >, int, const int&, vertex_index_t> >, adjacency_list > >; Invariant2 = degree_vertex_invariant >, int, const int&, vertex_index_t> >, adjacency_list > >; IndexMap1 = adj_list_vertex_property_map >, int, const int&, vertex_index_t>; IndexMap2 = adj_list_vertex_property_map >, int, const int&, vertex_index_t>; std::size_t = long unsigned int]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/isomorphism.hpp:651:42: required from ‘bool boost::graph::detail::isomorphism_impl::operator()(const Graph1&, const Graph2&, const ArgPack&) const [with ArgPack = boost::parameter::aux::arg_list >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&> >, boost::parameter::aux::empty_arg_list, std::integral_constant >; Graph1 = boost::adjacency_list >; Graph2 = boost::adjacency_list >]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/isomorphism.hpp:662:5: required from ‘typename boost::result_of(Param0, Param1, const ArgPack&)>::type boost::graph::isomorphism_with_named_params(const Param0&, const Param1&, const ArgPack&) [with Param0 = boost::adjacency_list >; Param1 = boost::adjacency_list >; ArgPack = boost::parameter::aux::arg_list >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&> >, boost::parameter::aux::empty_arg_list, std::integral_constant >; typename boost::result_of(Param0, Param1, const ArgPack&)>::type = bool]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/isomorphism.hpp:666:1: required from ‘typename boost::result_of(Param0, Param1, const typename boost::detail::convert_bgl_params_to_boost_parameter >::type&)>::type boost::isomorphism(const Param0&, const Param1&, const bgl_named_params&) [with Param0 = adjacency_list >; Param1 = adjacency_list >; P = iterator_property_map<__gnu_cxx::__normal_iterator >, adj_list_vertex_property_map >, int, int&, vertex_index_t>, void*, void*&>; T = vertex_isomorphism_t; R = no_property; typename result_of(Param0, Param1, const typename detail::convert_bgl_params_to_boost_parameter >::type&)>::type = bool; typename detail::convert_bgl_params_to_boost_parameter >::type = parameter::aux::arg_list >, adj_list_vertex_property_map >, int, int&, vertex_index_t>, void*, void*&> >, parameter::aux::empty_arg_list, std::integral_constant >]’ ordering.cpp:68:18: required from here /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::Convertible::~Convertible() [with X = boost::iterators::detail::iterator_category_with_traversal; Y = boost::iterators::incrementable_traversal_tag]’ 37 | ~model() | ^ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:208:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 208 | BOOST_CONCEPT_USAGE(Convertible) { | ^~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::range_detail::IncrementableIteratorConcept >, void*, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator >, boost::no_property>*, std::vector >, boost::no_property>, std::allocator >, boost::no_property> > > >, void*, boost::detail::edge_desc_impl, long int>, long int> >]’: /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements >, void*, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator >, boost::no_property>*, std::vector >, boost::no_property>, std::allocator >, boost::no_property> > > >, void*, boost::detail::edge_desc_impl, long int>, long int> > >]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/range/concepts.hpp:136:13: required from ‘struct boost::range_detail::IncrementableIteratorConcept >, void*, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator >, boost::no_property>*, std::vector >, boost::no_property>, std::allocator >, boost::no_property> > > >, void*, boost::detail::edge_desc_impl, long int>, long int> >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/range/concepts.hpp:147:16: required from ‘struct boost::range_detail::SinglePassIteratorConcept >, void*, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator >, boost::no_property>*, std::vector >, boost::no_property>, std::allocator >, boost::no_property> > > >, void*, boost::detail::edge_desc_impl, long int>, long int> >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::range_detail::SinglePassIteratorConcept >, void*, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator >, boost::no_property>*, std::vector >, boost::no_property>, std::allocator >, boost::no_property> > > >, void*, boost::detail::edge_desc_impl, long int>, long int> >]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied >, void*, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator >, boost::no_property>*, std::vector >, boost::no_property>, std::allocator >, boost::no_property> > > >, void*, boost::detail::edge_desc_impl, long int>, long int> > >::value’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:45:51: [ skipping 9 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/isomorphism.hpp:229:26: required from ‘bool boost::detail::isomorphism_algo::test_isomorphism() [with Graph1 = boost::adjacency_list >; Graph2 = boost::adjacency_list >; IsoMapping = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&>; Invariant1 = boost::degree_vertex_invariant >, int, const int&, boost::vertex_index_t> >, boost::adjacency_list > >; Invariant2 = boost::degree_vertex_invariant >, int, const int&, boost::vertex_index_t> >, boost::adjacency_list > >; IndexMap1 = boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>; IndexMap2 = boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/isomorphism.hpp:532:33: required from ‘bool boost::isomorphism(const Graph1&, const Graph2&, IsoMapping, Invariant1, Invariant2, std::size_t, IndexMap1, IndexMap2) [with Graph1 = adjacency_list >; Graph2 = adjacency_list >; IsoMapping = iterator_property_map<__gnu_cxx::__normal_iterator >, adj_list_vertex_property_map >, int, int&, vertex_index_t>, void*, void*&>; Invariant1 = degree_vertex_invariant >, int, const int&, vertex_index_t> >, adjacency_list > >; Invariant2 = degree_vertex_invariant >, int, const int&, vertex_index_t> >, adjacency_list > >; IndexMap1 = adj_list_vertex_property_map >, int, const int&, vertex_index_t>; IndexMap2 = adj_list_vertex_property_map >, int, const int&, vertex_index_t>; std::size_t = long unsigned int]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/isomorphism.hpp:651:42: required from ‘bool boost::graph::detail::isomorphism_impl::operator()(const Graph1&, const Graph2&, const ArgPack&) const [with ArgPack = boost::parameter::aux::arg_list >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&> >, boost::parameter::aux::empty_arg_list, std::integral_constant >; Graph1 = boost::adjacency_list >; Graph2 = boost::adjacency_list >]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/isomorphism.hpp:662:5: required from ‘typename boost::result_of(Param0, Param1, const ArgPack&)>::type boost::graph::isomorphism_with_named_params(const Param0&, const Param1&, const ArgPack&) [with Param0 = boost::adjacency_list >; Param1 = boost::adjacency_list >; ArgPack = boost::parameter::aux::arg_list >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&> >, boost::parameter::aux::empty_arg_list, std::integral_constant >; typename boost::result_of(Param0, Param1, const ArgPack&)>::type = bool]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/isomorphism.hpp:666:1: required from ‘typename boost::result_of(Param0, Param1, const typename boost::detail::convert_bgl_params_to_boost_parameter >::type&)>::type boost::isomorphism(const Param0&, const Param1&, const bgl_named_params&) [with Param0 = adjacency_list >; Param1 = adjacency_list >; P = iterator_property_map<__gnu_cxx::__normal_iterator >, adj_list_vertex_property_map >, int, int&, vertex_index_t>, void*, void*&>; T = vertex_isomorphism_t; R = no_property; typename result_of(Param0, Param1, const typename detail::convert_bgl_params_to_boost_parameter >::type&)>::type = bool; typename detail::convert_bgl_params_to_boost_parameter >::type = parameter::aux::arg_list >, adj_list_vertex_property_map >, int, int&, vertex_index_t>, void*, void*&> >, parameter::aux::empty_arg_list, std::integral_constant >]’ ordering.cpp:68:18: required from here /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::range_detail::IncrementableIteratorConcept::~IncrementableIteratorConcept() [with Iterator = boost::adjacency_iterator >, void*, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator >, boost::no_property>*, std::vector >, boost::no_property>, std::allocator >, boost::no_property> > > >, void*, boost::detail::edge_desc_impl, long int>, long int>]’ 37 | ~model() | ^ /home/omnipath/local/R/4.4-3.20/BH/include/boost/range/concepts.hpp:136:13: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 136 | BOOST_CONCEPT_USAGE(IncrementableIteratorConcept) | ^~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::EqualityComparable >, void*, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator >, boost::no_property>*, std::vector >, boost::no_property>, std::allocator >, boost::no_property> > > >, void*, boost::detail::edge_desc_impl, long int>, long int> >]’: /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements >, void*, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator >, boost::no_property>*, std::vector >, boost::no_property>, std::allocator >, boost::no_property> > > >, void*, boost::detail::edge_desc_impl, long int>, long int> > >]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:233:5: required from ‘struct boost::EqualityComparable >, void*, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator >, boost::no_property>*, std::vector >, boost::no_property>, std::allocator >, boost::no_property> > > >, void*, boost::detail::edge_desc_impl, long int>, long int> >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/range/concepts.hpp:147:16: required from ‘struct boost::range_detail::SinglePassIteratorConcept >, void*, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator >, boost::no_property>*, std::vector >, boost::no_property>, std::allocator >, boost::no_property> > > >, void*, boost::detail::edge_desc_impl, long int>, long int> >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::range_detail::SinglePassIteratorConcept >, void*, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator >, boost::no_property>*, std::vector >, boost::no_property>, std::allocator >, boost::no_property> > > >, void*, boost::detail::edge_desc_impl, long int>, long int> >]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied >, void*, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator >, boost::no_property>*, std::vector >, boost::no_property>, std::allocator >, boost::no_property> > > >, void*, boost::detail::edge_desc_impl, long int>, long int> > >::value’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:45:51: [ skipping 9 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/isomorphism.hpp:229:26: required from ‘bool boost::detail::isomorphism_algo::test_isomorphism() [with Graph1 = boost::adjacency_list >; Graph2 = boost::adjacency_list >; IsoMapping = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&>; Invariant1 = boost::degree_vertex_invariant >, int, const int&, boost::vertex_index_t> >, boost::adjacency_list > >; Invariant2 = boost::degree_vertex_invariant >, int, const int&, boost::vertex_index_t> >, boost::adjacency_list > >; IndexMap1 = boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>; IndexMap2 = boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/isomorphism.hpp:532:33: required from ‘bool boost::isomorphism(const Graph1&, const Graph2&, IsoMapping, Invariant1, Invariant2, std::size_t, IndexMap1, IndexMap2) [with Graph1 = adjacency_list >; Graph2 = adjacency_list >; IsoMapping = iterator_property_map<__gnu_cxx::__normal_iterator >, adj_list_vertex_property_map >, int, int&, vertex_index_t>, void*, void*&>; Invariant1 = degree_vertex_invariant >, int, const int&, vertex_index_t> >, adjacency_list > >; Invariant2 = degree_vertex_invariant >, int, const int&, vertex_index_t> >, adjacency_list > >; IndexMap1 = adj_list_vertex_property_map >, int, const int&, vertex_index_t>; IndexMap2 = adj_list_vertex_property_map >, int, const int&, vertex_index_t>; std::size_t = long unsigned int]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/isomorphism.hpp:651:42: required from ‘bool boost::graph::detail::isomorphism_impl::operator()(const Graph1&, const Graph2&, const ArgPack&) const [with ArgPack = boost::parameter::aux::arg_list >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&> >, boost::parameter::aux::empty_arg_list, std::integral_constant >; Graph1 = boost::adjacency_list >; Graph2 = boost::adjacency_list >]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/isomorphism.hpp:662:5: required from ‘typename boost::result_of(Param0, Param1, const ArgPack&)>::type boost::graph::isomorphism_with_named_params(const Param0&, const Param1&, const ArgPack&) [with Param0 = boost::adjacency_list >; Param1 = boost::adjacency_list >; ArgPack = boost::parameter::aux::arg_list >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&> >, boost::parameter::aux::empty_arg_list, std::integral_constant >; typename boost::result_of(Param0, Param1, const ArgPack&)>::type = bool]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/isomorphism.hpp:666:1: required from ‘typename boost::result_of(Param0, Param1, const typename boost::detail::convert_bgl_params_to_boost_parameter >::type&)>::type boost::isomorphism(const Param0&, const Param1&, const bgl_named_params&) [with Param0 = adjacency_list >; Param1 = adjacency_list >; P = iterator_property_map<__gnu_cxx::__normal_iterator >, adj_list_vertex_property_map >, int, int&, vertex_index_t>, void*, void*&>; T = vertex_isomorphism_t; R = no_property; typename result_of(Param0, Param1, const typename detail::convert_bgl_params_to_boost_parameter >::type&)>::type = bool; typename detail::convert_bgl_params_to_boost_parameter >::type = parameter::aux::arg_list >, adj_list_vertex_property_map >, int, int&, vertex_index_t>, void*, void*&> >, parameter::aux::empty_arg_list, std::integral_constant >]’ ordering.cpp:68:18: required from here /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::EqualityComparable::~EqualityComparable() [with TT = boost::adjacency_iterator >, void*, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator >, boost::no_property>*, std::vector >, boost::no_property>, std::allocator >, boost::no_property> > > >, void*, boost::detail::edge_desc_impl, long int>, long int>]’ 37 | ~model() | ^ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:233:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 233 | BOOST_CONCEPT_USAGE(EqualityComparable) { | ^~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::Convertible, boost::iterators::single_pass_traversal_tag>]’: /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements, boost::iterators::single_pass_traversal_tag> >]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:208:5: required from ‘struct boost::Convertible, boost::iterators::single_pass_traversal_tag>’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::Convertible, boost::iterators::single_pass_traversal_tag>]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied, boost::iterators::single_pass_traversal_tag> >::value’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied, boost::iterators::single_pass_traversal_tag> >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:72:8: [ skipping 13 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/isomorphism.hpp:229:26: required from ‘bool boost::detail::isomorphism_algo::test_isomorphism() [with Graph1 = boost::adjacency_list >; Graph2 = boost::adjacency_list >; IsoMapping = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&>; Invariant1 = boost::degree_vertex_invariant >, int, const int&, boost::vertex_index_t> >, boost::adjacency_list > >; Invariant2 = boost::degree_vertex_invariant >, int, const int&, boost::vertex_index_t> >, boost::adjacency_list > >; IndexMap1 = boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>; IndexMap2 = boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/isomorphism.hpp:532:33: required from ‘bool boost::isomorphism(const Graph1&, const Graph2&, IsoMapping, Invariant1, Invariant2, std::size_t, IndexMap1, IndexMap2) [with Graph1 = adjacency_list >; Graph2 = adjacency_list >; IsoMapping = iterator_property_map<__gnu_cxx::__normal_iterator >, adj_list_vertex_property_map >, int, int&, vertex_index_t>, void*, void*&>; Invariant1 = degree_vertex_invariant >, int, const int&, vertex_index_t> >, adjacency_list > >; Invariant2 = degree_vertex_invariant >, int, const int&, vertex_index_t> >, adjacency_list > >; IndexMap1 = adj_list_vertex_property_map >, int, const int&, vertex_index_t>; IndexMap2 = adj_list_vertex_property_map >, int, const int&, vertex_index_t>; std::size_t = long unsigned int]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/isomorphism.hpp:651:42: required from ‘bool boost::graph::detail::isomorphism_impl::operator()(const Graph1&, const Graph2&, const ArgPack&) const [with ArgPack = boost::parameter::aux::arg_list >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&> >, boost::parameter::aux::empty_arg_list, std::integral_constant >; Graph1 = boost::adjacency_list >; Graph2 = boost::adjacency_list >]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/isomorphism.hpp:662:5: required from ‘typename boost::result_of(Param0, Param1, const ArgPack&)>::type boost::graph::isomorphism_with_named_params(const Param0&, const Param1&, const ArgPack&) [with Param0 = boost::adjacency_list >; Param1 = boost::adjacency_list >; ArgPack = boost::parameter::aux::arg_list >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&> >, boost::parameter::aux::empty_arg_list, std::integral_constant >; typename boost::result_of(Param0, Param1, const ArgPack&)>::type = bool]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/isomorphism.hpp:666:1: required from ‘typename boost::result_of(Param0, Param1, const typename boost::detail::convert_bgl_params_to_boost_parameter >::type&)>::type boost::isomorphism(const Param0&, const Param1&, const bgl_named_params&) [with Param0 = adjacency_list >; Param1 = adjacency_list >; P = iterator_property_map<__gnu_cxx::__normal_iterator >, adj_list_vertex_property_map >, int, int&, vertex_index_t>, void*, void*&>; T = vertex_isomorphism_t; R = no_property; typename result_of(Param0, Param1, const typename detail::convert_bgl_params_to_boost_parameter >::type&)>::type = bool; typename detail::convert_bgl_params_to_boost_parameter >::type = parameter::aux::arg_list >, adj_list_vertex_property_map >, int, int&, vertex_index_t>, void*, void*&> >, parameter::aux::empty_arg_list, std::integral_constant >]’ ordering.cpp:68:18: required from here /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::Convertible::~Convertible() [with X = boost::iterators::detail::iterator_category_with_traversal; Y = boost::iterators::single_pass_traversal_tag]’ 37 | ~model() | ^ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:208:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 208 | BOOST_CONCEPT_USAGE(Convertible) { | ^~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::range_detail::SinglePassIteratorConcept >, void*, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator >, boost::no_property>*, std::vector >, boost::no_property>, std::allocator >, boost::no_property> > > >, void*, boost::detail::edge_desc_impl, long int>, long int> >]’: /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements >, void*, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator >, boost::no_property>*, std::vector >, boost::no_property>, std::allocator >, boost::no_property> > > >, void*, boost::detail::edge_desc_impl, long int>, long int> > >]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/range/concepts.hpp:158:13: required from ‘struct boost::range_detail::SinglePassIteratorConcept >, void*, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator >, boost::no_property>*, std::vector >, boost::no_property>, std::allocator >, boost::no_property> > > >, void*, boost::detail::edge_desc_impl, long int>, long int> >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::range_detail::SinglePassIteratorConcept >, void*, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator >, boost::no_property>*, std::vector >, boost::no_property>, std::allocator >, boost::no_property> > > >, void*, boost::detail::edge_desc_impl, long int>, long int> >]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied >, void*, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator >, boost::no_property>*, std::vector >, boost::no_property>, std::allocator >, boost::no_property> > > >, void*, boost::detail::edge_desc_impl, long int>, long int> > >::value’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied >, void*, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator >, boost::no_property>*, std::vector >, boost::no_property>, std::allocator >, boost::no_property> > > >, void*, boost::detail::edge_desc_impl, long int>, long int> > >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:72:8: [ skipping 8 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/isomorphism.hpp:229:26: required from ‘bool boost::detail::isomorphism_algo::test_isomorphism() [with Graph1 = boost::adjacency_list >; Graph2 = boost::adjacency_list >; IsoMapping = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&>; Invariant1 = boost::degree_vertex_invariant >, int, const int&, boost::vertex_index_t> >, boost::adjacency_list > >; Invariant2 = boost::degree_vertex_invariant >, int, const int&, boost::vertex_index_t> >, boost::adjacency_list > >; IndexMap1 = boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>; IndexMap2 = boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/isomorphism.hpp:532:33: required from ‘bool boost::isomorphism(const Graph1&, const Graph2&, IsoMapping, Invariant1, Invariant2, std::size_t, IndexMap1, IndexMap2) [with Graph1 = adjacency_list >; Graph2 = adjacency_list >; IsoMapping = iterator_property_map<__gnu_cxx::__normal_iterator >, adj_list_vertex_property_map >, int, int&, vertex_index_t>, void*, void*&>; Invariant1 = degree_vertex_invariant >, int, const int&, vertex_index_t> >, adjacency_list > >; Invariant2 = degree_vertex_invariant >, int, const int&, vertex_index_t> >, adjacency_list > >; IndexMap1 = adj_list_vertex_property_map >, int, const int&, vertex_index_t>; IndexMap2 = adj_list_vertex_property_map >, int, const int&, vertex_index_t>; std::size_t = long unsigned int]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/isomorphism.hpp:651:42: required from ‘bool boost::graph::detail::isomorphism_impl::operator()(const Graph1&, const Graph2&, const ArgPack&) const [with ArgPack = boost::parameter::aux::arg_list >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&> >, boost::parameter::aux::empty_arg_list, std::integral_constant >; Graph1 = boost::adjacency_list >; Graph2 = boost::adjacency_list >]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/isomorphism.hpp:662:5: required from ‘typename boost::result_of(Param0, Param1, const ArgPack&)>::type boost::graph::isomorphism_with_named_params(const Param0&, const Param1&, const ArgPack&) [with Param0 = boost::adjacency_list >; Param1 = boost::adjacency_list >; ArgPack = boost::parameter::aux::arg_list >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&> >, boost::parameter::aux::empty_arg_list, std::integral_constant >; typename boost::result_of(Param0, Param1, const ArgPack&)>::type = bool]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/isomorphism.hpp:666:1: required from ‘typename boost::result_of(Param0, Param1, const typename boost::detail::convert_bgl_params_to_boost_parameter >::type&)>::type boost::isomorphism(const Param0&, const Param1&, const bgl_named_params&) [with Param0 = adjacency_list >; Param1 = adjacency_list >; P = iterator_property_map<__gnu_cxx::__normal_iterator >, adj_list_vertex_property_map >, int, int&, vertex_index_t>, void*, void*&>; T = vertex_isomorphism_t; R = no_property; typename result_of(Param0, Param1, const typename detail::convert_bgl_params_to_boost_parameter >::type&)>::type = bool; typename detail::convert_bgl_params_to_boost_parameter >::type = parameter::aux::arg_list >, adj_list_vertex_property_map >, int, int&, vertex_index_t>, void*, void*&> >, parameter::aux::empty_arg_list, std::integral_constant >]’ ordering.cpp:68:18: required from here /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::range_detail::SinglePassIteratorConcept::~SinglePassIteratorConcept() [with Iterator = boost::adjacency_iterator >, void*, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator >, boost::no_property>*, std::vector >, boost::no_property>, std::allocator >, boost::no_property> > > >, void*, boost::detail::edge_desc_impl, long int>, long int>]’ 37 | ~model() | ^ /home/omnipath/local/R/4.4-3.20/BH/include/boost/range/concepts.hpp:158:13: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 158 | BOOST_CONCEPT_USAGE(SinglePassIteratorConcept) | ^~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::SinglePassRangeConcept >, void*, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator >, boost::no_property>*, std::vector >, boost::no_property>, std::allocator >, boost::no_property> > > >, void*, boost::detail::edge_desc_impl, long int>, long int>, boost::adjacency_iterator >, void*, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator >, boost::no_property>*, std::vector >, boost::no_property>, std::allocator >, boost::no_property> > > >, void*, boost::detail::edge_desc_impl, long int>, long int> > >]’: /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements >, void*, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator >, boost::no_property>*, std::vector >, boost::no_property>, std::allocator >, boost::no_property> > > >, void*, boost::detail::edge_desc_impl, long int>, long int>, boost::adjacency_iterator >, void*, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator >, boost::no_property>*, std::vector >, boost::no_property>, std::allocator >, boost::no_property> > > >, void*, boost::detail::edge_desc_impl, long int>, long int> > > >]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/range/concepts.hpp:284:9: required from ‘struct boost::SinglePassRangeConcept >, void*, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator >, boost::no_property>*, std::vector >, boost::no_property>, std::allocator >, boost::no_property> > > >, void*, boost::detail::edge_desc_impl, long int>, long int>, boost::adjacency_iterator >, void*, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator >, boost::no_property>*, std::vector >, boost::no_property>, std::allocator >, boost::no_property> > > >, void*, boost::detail::edge_desc_impl, long int>, long int> > >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::SinglePassRangeConcept >, void*, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator >, boost::no_property>*, std::vector >, boost::no_property>, std::allocator >, boost::no_property> > > >, void*, boost::detail::edge_desc_impl, long int>, long int>, boost::adjacency_iterator >, void*, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator >, boost::no_property>*, std::vector >, boost::no_property>, std::allocator >, boost::no_property> > > >, void*, boost::detail::edge_desc_impl, long int>, long int> > >]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied >, void*, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator >, boost::no_property>*, std::vector >, boost::no_property>, std::allocator >, boost::no_property> > > >, void*, boost::detail::edge_desc_impl, long int>, long int>, boost::adjacency_iterator >, void*, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator >, boost::no_property>*, std::vector >, boost::no_property>, std::allocator >, boost::no_property> > > >, void*, boost::detail::edge_desc_impl, long int>, long int> > > >::value’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied >, void*, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator >, boost::no_property>*, std::vector >, boost::no_property>, std::allocator >, boost::no_property> > > >, void*, boost::detail::edge_desc_impl, long int>, long int>, boost::adjacency_iterator >, void*, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator >, boost::no_property>*, std::vector >, boost::no_property>, std::allocator >, boost::no_property> > > >, void*, boost::detail::edge_desc_impl, long int>, long int> > > >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:72:8: [ skipping 3 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/isomorphism.hpp:229:26: required from ‘bool boost::detail::isomorphism_algo::test_isomorphism() [with Graph1 = boost::adjacency_list >; Graph2 = boost::adjacency_list >; IsoMapping = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&>; Invariant1 = boost::degree_vertex_invariant >, int, const int&, boost::vertex_index_t> >, boost::adjacency_list > >; Invariant2 = boost::degree_vertex_invariant >, int, const int&, boost::vertex_index_t> >, boost::adjacency_list > >; IndexMap1 = boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>; IndexMap2 = boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/isomorphism.hpp:532:33: required from ‘bool boost::isomorphism(const Graph1&, const Graph2&, IsoMapping, Invariant1, Invariant2, std::size_t, IndexMap1, IndexMap2) [with Graph1 = adjacency_list >; Graph2 = adjacency_list >; IsoMapping = iterator_property_map<__gnu_cxx::__normal_iterator >, adj_list_vertex_property_map >, int, int&, vertex_index_t>, void*, void*&>; Invariant1 = degree_vertex_invariant >, int, const int&, vertex_index_t> >, adjacency_list > >; Invariant2 = degree_vertex_invariant >, int, const int&, vertex_index_t> >, adjacency_list > >; IndexMap1 = adj_list_vertex_property_map >, int, const int&, vertex_index_t>; IndexMap2 = adj_list_vertex_property_map >, int, const int&, vertex_index_t>; std::size_t = long unsigned int]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/isomorphism.hpp:651:42: required from ‘bool boost::graph::detail::isomorphism_impl::operator()(const Graph1&, const Graph2&, const ArgPack&) const [with ArgPack = boost::parameter::aux::arg_list >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&> >, boost::parameter::aux::empty_arg_list, std::integral_constant >; Graph1 = boost::adjacency_list >; Graph2 = boost::adjacency_list >]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/isomorphism.hpp:662:5: required from ‘typename boost::result_of(Param0, Param1, const ArgPack&)>::type boost::graph::isomorphism_with_named_params(const Param0&, const Param1&, const ArgPack&) [with Param0 = boost::adjacency_list >; Param1 = boost::adjacency_list >; ArgPack = boost::parameter::aux::arg_list >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&> >, boost::parameter::aux::empty_arg_list, std::integral_constant >; typename boost::result_of(Param0, Param1, const ArgPack&)>::type = bool]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/isomorphism.hpp:666:1: required from ‘typename boost::result_of(Param0, Param1, const typename boost::detail::convert_bgl_params_to_boost_parameter >::type&)>::type boost::isomorphism(const Param0&, const Param1&, const bgl_named_params&) [with Param0 = adjacency_list >; Param1 = adjacency_list >; P = iterator_property_map<__gnu_cxx::__normal_iterator >, adj_list_vertex_property_map >, int, int&, vertex_index_t>, void*, void*&>; T = vertex_isomorphism_t; R = no_property; typename result_of(Param0, Param1, const typename detail::convert_bgl_params_to_boost_parameter >::type&)>::type = bool; typename detail::convert_bgl_params_to_boost_parameter >::type = parameter::aux::arg_list >, adj_list_vertex_property_map >, int, int&, vertex_index_t>, void*, void*&> >, parameter::aux::empty_arg_list, std::integral_constant >]’ ordering.cpp:68:18: required from here /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::SinglePassRangeConcept::~SinglePassRangeConcept() [with T = const std::pair >, void*, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator >, boost::no_property>*, std::vector >, boost::no_property>, std::allocator >, boost::no_property> > > >, void*, boost::detail::edge_desc_impl, long int>, long int>, boost::adjacency_iterator >, void*, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator >, boost::no_property>*, std::vector >, boost::no_property>, std::allocator >, boost::no_property> > > >, void*, boost::detail::edge_desc_impl, long int>, long int> >]’ 37 | ~model() | ^ /home/omnipath/local/R/4.4-3.20/BH/include/boost/range/concepts.hpp:284:9: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 284 | BOOST_CONCEPT_USAGE(SinglePassRangeConcept) | ^~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::Assignable > >, boost::property >*, std::vector > >, boost::property >, std::allocator > >, boost::property > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> >]’: /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements > >, boost::property >*, std::vector > >, boost::property >, std::allocator > >, boost::property > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:145:5: required from ‘struct boost::Assignable > >, boost::property >*, std::vector > >, boost::property >, std::allocator > >, boost::property > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:502:3: required from ‘struct boost::InputIterator > >, boost::property >*, std::vector > >, boost::property >, std::allocator > >, boost::property > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::InputIterator > >, boost::property >*, std::vector > >, boost::property >, std::allocator > >, boost::property > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> >]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied > >, boost::property >*, std::vector > >, boost::property >, std::allocator > >, boost::property > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::value’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:45:51: [ skipping 4 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/graph_concepts.hpp:89:9: required from ‘boost::concepts::IncidenceGraph::~IncidenceGraph() [with G = R_adjacency_list]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/graph_concepts.hpp:75:1: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::IncidenceGraphConcept >]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/depth_first_search.hpp:129:9: required from ‘void boost::detail::depth_first_visit_impl(const IncidenceGraph&, typename boost::graph_traits::vertex_descriptor, DFSVisitor&, ColorMap, TerminatorFunc) [with IncidenceGraph = R_adjacency_list; DFSVisitor = boost::dfs_visitor<>; ColorMap = boost::vec_adj_list_vertex_property_map, boost::property, boost::no_property, boost::listS>, boost::adjacency_list, boost::property, boost::no_property, boost::listS>*, boost::default_color_type, boost::default_color_type&, boost::vertex_color_t>; TerminatorFunc = nontruth2; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/depth_first_search.hpp:417:35: required from ‘void boost::depth_first_visit(const IncidenceGraph&, typename graph_traits::vertex_descriptor, DFSVisitor, ColorMap) [with IncidenceGraph = R_adjacency_list; DFSVisitor = dfs_visitor<>; ColorMap = vec_adj_list_vertex_property_map, property, no_property, listS>, adjacency_list, property, no_property, listS>*, default_color_type, default_color_type&, vertex_color_t>; typename graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/cuthill_mckee_ordering.hpp:146:30: required from ‘OutputIterator boost::cuthill_mckee_ordering(const Graph&, OutputIterator, ColorMap, DegreeMap) [with Graph = R_adjacency_list; OutputIterator = std::reverse_iterator<__gnu_cxx::__normal_iterator > >; ColorMap = vec_adj_list_vertex_property_map, property, no_property, listS>, adjacency_list, property, no_property, listS>*, default_color_type, default_color_type&, vertex_color_t>; DegreeMap = degree_property_map >]’ ordering.cpp:98:25: required from here /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::Assignable::~Assignable() [with TT = boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >, boost::property >*, std::vector > >, boost::property >, std::allocator > >, boost::property > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>]’ 37 | ~model() | ^ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:145:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 145 | BOOST_CONCEPT_USAGE(Assignable) { | ^~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::EqualityComparable > >, boost::property >*, std::vector > >, boost::property >, std::allocator > >, boost::property > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> >]’: /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements > >, boost::property >*, std::vector > >, boost::property >, std::allocator > >, boost::property > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:233:5: required from ‘struct boost::EqualityComparable > >, boost::property >*, std::vector > >, boost::property >, std::allocator > >, boost::property > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:502:3: required from ‘struct boost::InputIterator > >, boost::property >*, std::vector > >, boost::property >, std::allocator > >, boost::property > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::InputIterator > >, boost::property >*, std::vector > >, boost::property >, std::allocator > >, boost::property > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> >]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied > >, boost::property >*, std::vector > >, boost::property >, std::allocator > >, boost::property > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::value’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:45:51: [ skipping 4 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/graph_concepts.hpp:89:9: required from ‘boost::concepts::IncidenceGraph::~IncidenceGraph() [with G = R_adjacency_list]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/graph_concepts.hpp:75:1: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::IncidenceGraphConcept >]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/depth_first_search.hpp:129:9: required from ‘void boost::detail::depth_first_visit_impl(const IncidenceGraph&, typename boost::graph_traits::vertex_descriptor, DFSVisitor&, ColorMap, TerminatorFunc) [with IncidenceGraph = R_adjacency_list; DFSVisitor = boost::dfs_visitor<>; ColorMap = boost::vec_adj_list_vertex_property_map, boost::property, boost::no_property, boost::listS>, boost::adjacency_list, boost::property, boost::no_property, boost::listS>*, boost::default_color_type, boost::default_color_type&, boost::vertex_color_t>; TerminatorFunc = nontruth2; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/depth_first_search.hpp:417:35: required from ‘void boost::depth_first_visit(const IncidenceGraph&, typename graph_traits::vertex_descriptor, DFSVisitor, ColorMap) [with IncidenceGraph = R_adjacency_list; DFSVisitor = dfs_visitor<>; ColorMap = vec_adj_list_vertex_property_map, property, no_property, listS>, adjacency_list, property, no_property, listS>*, default_color_type, default_color_type&, vertex_color_t>; typename graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/cuthill_mckee_ordering.hpp:146:30: required from ‘OutputIterator boost::cuthill_mckee_ordering(const Graph&, OutputIterator, ColorMap, DegreeMap) [with Graph = R_adjacency_list; OutputIterator = std::reverse_iterator<__gnu_cxx::__normal_iterator > >; ColorMap = vec_adj_list_vertex_property_map, property, no_property, listS>, adjacency_list, property, no_property, listS>*, default_color_type, default_color_type&, vertex_color_t>; DegreeMap = degree_property_map >]’ ordering.cpp:98:25: required from here /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::EqualityComparable::~EqualityComparable() [with TT = boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >, boost::property >*, std::vector > >, boost::property >, std::allocator > >, boost::property > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>]’ 37 | ~model() | ^ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:233:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 233 | BOOST_CONCEPT_USAGE(EqualityComparable) { | ^~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::InputIterator > >, boost::property >*, std::vector > >, boost::property >, std::allocator > >, boost::property > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> >]’: /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements > >, boost::property >*, std::vector > >, boost::property >, std::allocator > >, boost::property > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:512:7: required from ‘struct boost::InputIterator > >, boost::property >*, std::vector > >, boost::property >, std::allocator > >, boost::property > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::InputIterator > >, boost::property >*, std::vector > >, boost::property >, std::allocator > >, boost::property > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> >]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied > >, boost::property >*, std::vector > >, boost::property >, std::allocator > >, boost::property > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::value’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied > >, boost::property >*, std::vector > >, boost::property >, std::allocator > >, boost::property > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:72:8: [ skipping 3 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/graph_concepts.hpp:89:9: required from ‘boost::concepts::IncidenceGraph::~IncidenceGraph() [with G = R_adjacency_list]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/graph_concepts.hpp:75:1: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::IncidenceGraphConcept >]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/depth_first_search.hpp:129:9: required from ‘void boost::detail::depth_first_visit_impl(const IncidenceGraph&, typename boost::graph_traits::vertex_descriptor, DFSVisitor&, ColorMap, TerminatorFunc) [with IncidenceGraph = R_adjacency_list; DFSVisitor = boost::dfs_visitor<>; ColorMap = boost::vec_adj_list_vertex_property_map, boost::property, boost::no_property, boost::listS>, boost::adjacency_list, boost::property, boost::no_property, boost::listS>*, boost::default_color_type, boost::default_color_type&, boost::vertex_color_t>; TerminatorFunc = nontruth2; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/depth_first_search.hpp:417:35: required from ‘void boost::depth_first_visit(const IncidenceGraph&, typename graph_traits::vertex_descriptor, DFSVisitor, ColorMap) [with IncidenceGraph = R_adjacency_list; DFSVisitor = dfs_visitor<>; ColorMap = vec_adj_list_vertex_property_map, property, no_property, listS>, adjacency_list, property, no_property, listS>*, default_color_type, default_color_type&, vertex_color_t>; typename graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/cuthill_mckee_ordering.hpp:146:30: required from ‘OutputIterator boost::cuthill_mckee_ordering(const Graph&, OutputIterator, ColorMap, DegreeMap) [with Graph = R_adjacency_list; OutputIterator = std::reverse_iterator<__gnu_cxx::__normal_iterator > >; ColorMap = vec_adj_list_vertex_property_map, property, no_property, listS>, adjacency_list, property, no_property, listS>*, default_color_type, default_color_type&, vertex_color_t>; DegreeMap = degree_property_map >]’ ordering.cpp:98:25: required from here /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::InputIterator::~InputIterator() [with TT = boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >, boost::property >*, std::vector > >, boost::property >, std::allocator > >, boost::property > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>]’ 37 | ~model() | ^ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:512:7: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 512 | BOOST_CONCEPT_USAGE(InputIterator) | ^~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::CopyConstructible >]’: /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements > >]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:167:5: required from ‘struct boost::CopyConstructible >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:165:3: required from ‘struct boost::CopyConstructibleConcept >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::CopyConstructibleConcept >]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied > >::value’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:45:51: [ skipping 8 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/breadth_first_search.hpp:118:24: required from ‘void boost::breadth_first_visit(const IncidenceGraph&, typename graph_traits::vertex_descriptor, Buffer&, BFSVisitor, ColorMap) [with IncidenceGraph = R_adjacency_list; Buffer = sparse::rcm_queue >, std::deque > >; BFSVisitor = bfs_visitor<>; ColorMap = vec_adj_list_vertex_property_map, property, no_property, listS>, adjacency_list, property, no_property, listS>*, default_color_type, default_color_type&, vertex_color_t>; typename graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/breadth_first_search.hpp:363:24: required from ‘void boost::breadth_first_visit(const IncidenceGraph&, typename graph_traits::vertex_descriptor, const bgl_named_params&) [with IncidenceGraph = R_adjacency_list; P = vec_adj_list_vertex_property_map, property, no_property, listS>, adjacency_list, property, no_property, listS>*, default_color_type, default_color_type&, vertex_color_t>; T = vertex_color_t; R = bgl_named_params >, std::deque > > >, buffer_param_t, no_property>; typename graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/detail/sparse_ordering.hpp:152:24: required from ‘Vertex boost::pseudo_peripheral_pair(const Graph&, const Vertex&, int&, ColorMap, DegreeMap) [with Graph = R_adjacency_list; Vertex = long unsigned int; ColorMap = vec_adj_list_vertex_property_map, property, no_property, listS>, adjacency_list, property, no_property, listS>*, default_color_type, default_color_type&, vertex_color_t>; DegreeMap = degree_property_map >]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/detail/sparse_ordering.hpp:170:31: required from ‘Vertex boost::find_starting_node(const Graph&, Vertex, Color, Degree) [with Graph = R_adjacency_list; Vertex = long unsigned int; Color = vec_adj_list_vertex_property_map, property, no_property, listS>, adjacency_list, property, no_property, listS>*, default_color_type, default_color_type&, vertex_color_t>; Degree = degree_property_map >]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/cuthill_mckee_ordering.hpp:155:32: required from ‘OutputIterator boost::cuthill_mckee_ordering(const Graph&, OutputIterator, ColorMap, DegreeMap) [with Graph = R_adjacency_list; OutputIterator = std::reverse_iterator<__gnu_cxx::__normal_iterator > >; ColorMap = vec_adj_list_vertex_property_map, property, no_property, listS>, adjacency_list, property, no_property, listS>*, default_color_type, default_color_type&, vertex_color_t>; DegreeMap = degree_property_map >]’ ordering.cpp:98:25: required from here /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::CopyConstructible::~CopyConstructible() [with TT = boost::bfs_visitor<>]’ 37 | ~model() | ^ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:167:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 167 | BOOST_CONCEPT_USAGE(CopyConstructible) { | ^~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements > > > > >]’: /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/graph_concepts.hpp:66:5: required from ‘struct boost::concepts::Graph > > > >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/graph_concepts.hpp:75:1: required from ‘struct boost::concepts::IncidenceGraph > > > >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/graph_concepts.hpp:75:1: required from ‘struct boost::concepts::IncidenceGraphConcept > > > >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::concepts::IncidenceGraphConcept > > > >]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied > > > > >::value’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:45:51: [ skipping 5 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/breadth_first_search.hpp:262:29: required from ‘void boost::detail::bfs_helper(VertexListGraph&, typename boost::graph_traits::vertex_descriptor, ColorMap, BFSVisitor, const boost::bgl_named_params&, mpl_::false_) [with VertexListGraph = boost::adjacency_list > > >; ColorMap = boost::two_bit_color_map > >, long unsigned int> >; BFSVisitor = boost::bfs_visitor >, boost::vec_adj_list_vertex_id_map > >, long unsigned int>, long unsigned int, long unsigned int&>, boost::on_tree_edge> >; P = boost::bfs_visitor >, boost::vec_adj_list_vertex_id_map > >, long unsigned int>, long unsigned int, long unsigned int&>, boost::on_tree_edge> >; T = boost::graph_visitor_t; R = boost::no_property; typename boost::graph_traits::vertex_descriptor = long unsigned int; mpl_::false_ = mpl_::bool_]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/breadth_first_search.hpp:309:23: required from ‘static void boost::detail::bfs_dispatch::apply(VertexListGraph&, typename boost::graph_traits::vertex_descriptor, const boost::bgl_named_params&, boost::param_not_found) [with VertexListGraph = boost::adjacency_list > > >; P = boost::bfs_visitor >, boost::vec_adj_list_vertex_id_map > >, long unsigned int>, long unsigned int, long unsigned int&>, boost::on_tree_edge> >; T = boost::graph_visitor_t; R = boost::no_property; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/breadth_first_search.hpp:339:37: required from ‘void boost::breadth_first_search(const VertexListGraph&, typename graph_traits::vertex_descriptor, const bgl_named_params&) [with VertexListGraph = adjacency_list > > >; P = bfs_visitor >, vec_adj_list_vertex_id_map > >, long unsigned int>, long unsigned int, long unsigned int&>, on_tree_edge> >; T = graph_visitor_t; R = no_property; typename graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/sloan_ordering.hpp:175:29: required from ‘typename boost::graph_traits::vertex_descriptor boost::sloan_start_end_vertices(Graph&, typename graph_traits::vertex_descriptor&, ColorMap, DegreeMap) [with Graph = adjacency_list > > >; ColorMap = vec_adj_list_vertex_property_map > > >, adjacency_list > > >*, default_color_type, default_color_type&, vertex_color_t>; DegreeMap = degree_property_map > > > >; typename graph_traits::vertex_descriptor = long unsigned int; typename graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/sloan_ordering.hpp:429:33: required from ‘OutputIterator boost::sloan_ordering(Graph&, OutputIterator, Color, Degree, Priority, Weight, Weight) [with Graph = adjacency_list > > >; OutputIterator = __gnu_cxx::__normal_iterator >; Color = vec_adj_list_vertex_property_map > > >, adjacency_list > > >*, default_color_type, default_color_type&, vertex_color_t>; Degree = degree_property_map > > > >; Priority = vec_adj_list_vertex_property_map > > >, adjacency_list > > >*, double, double&, vertex_priority_t>; Weight = int]’ ordering.cpp:245:17: required from here /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::concepts::Graph > > > >]’ 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ^ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements > > > > >]’: /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/graph_concepts.hpp:87:5: required from ‘struct boost::concepts::IncidenceGraph > > > >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/graph_concepts.hpp:75:1: required from ‘struct boost::concepts::IncidenceGraphConcept > > > >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::concepts::IncidenceGraphConcept > > > >]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied > > > > >::value’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied > > > > >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:72:8: [ skipping 4 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/breadth_first_search.hpp:262:29: required from ‘void boost::detail::bfs_helper(VertexListGraph&, typename boost::graph_traits::vertex_descriptor, ColorMap, BFSVisitor, const boost::bgl_named_params&, mpl_::false_) [with VertexListGraph = boost::adjacency_list > > >; ColorMap = boost::two_bit_color_map > >, long unsigned int> >; BFSVisitor = boost::bfs_visitor >, boost::vec_adj_list_vertex_id_map > >, long unsigned int>, long unsigned int, long unsigned int&>, boost::on_tree_edge> >; P = boost::bfs_visitor >, boost::vec_adj_list_vertex_id_map > >, long unsigned int>, long unsigned int, long unsigned int&>, boost::on_tree_edge> >; T = boost::graph_visitor_t; R = boost::no_property; typename boost::graph_traits::vertex_descriptor = long unsigned int; mpl_::false_ = mpl_::bool_]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/breadth_first_search.hpp:309:23: required from ‘static void boost::detail::bfs_dispatch::apply(VertexListGraph&, typename boost::graph_traits::vertex_descriptor, const boost::bgl_named_params&, boost::param_not_found) [with VertexListGraph = boost::adjacency_list > > >; P = boost::bfs_visitor >, boost::vec_adj_list_vertex_id_map > >, long unsigned int>, long unsigned int, long unsigned int&>, boost::on_tree_edge> >; T = boost::graph_visitor_t; R = boost::no_property; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/breadth_first_search.hpp:339:37: required from ‘void boost::breadth_first_search(const VertexListGraph&, typename graph_traits::vertex_descriptor, const bgl_named_params&) [with VertexListGraph = adjacency_list > > >; P = bfs_visitor >, vec_adj_list_vertex_id_map > >, long unsigned int>, long unsigned int, long unsigned int&>, on_tree_edge> >; T = graph_visitor_t; R = no_property; typename graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/sloan_ordering.hpp:175:29: required from ‘typename boost::graph_traits::vertex_descriptor boost::sloan_start_end_vertices(Graph&, typename graph_traits::vertex_descriptor&, ColorMap, DegreeMap) [with Graph = adjacency_list > > >; ColorMap = vec_adj_list_vertex_property_map > > >, adjacency_list > > >*, default_color_type, default_color_type&, vertex_color_t>; DegreeMap = degree_property_map > > > >; typename graph_traits::vertex_descriptor = long unsigned int; typename graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/sloan_ordering.hpp:429:33: required from ‘OutputIterator boost::sloan_ordering(Graph&, OutputIterator, Color, Degree, Priority, Weight, Weight) [with Graph = adjacency_list > > >; OutputIterator = __gnu_cxx::__normal_iterator >; Color = vec_adj_list_vertex_property_map > > >, adjacency_list > > >*, default_color_type, default_color_type&, vertex_color_t>; Degree = degree_property_map > > > >; Priority = vec_adj_list_vertex_property_map > > >, adjacency_list > > >*, double, double&, vertex_priority_t>; Weight = int]’ ordering.cpp:245:17: required from here /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::concepts::IncidenceGraph > > > >]’ 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ^ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::IncidenceGraphConcept > > > >]’: /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/depth_first_search.hpp:129:9: required from ‘void boost::breadth_first_visit(const IncidenceGraph&, SourceIterator, SourceIterator, Buffer&, BFSVisitor, ColorMap) [with IncidenceGraph = adjacency_list > > >; Buffer = queue > >; BFSVisitor = bfs_visitor >, vec_adj_list_vertex_id_map > >, long unsigned int>, long unsigned int, long unsigned int&>, on_tree_edge> >; ColorMap = two_bit_color_map > >, long unsigned int> >; SourceIterator = long unsigned int*]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/breadth_first_search.hpp:136:24: required from ‘void boost::breadth_first_search(const VertexListGraph&, SourceIterator, SourceIterator, Buffer&, BFSVisitor, ColorMap) [with VertexListGraph = adjacency_list > > >; SourceIterator = long unsigned int*; Buffer = queue > >; BFSVisitor = bfs_visitor >, vec_adj_list_vertex_id_map > >, long unsigned int>, long unsigned int, long unsigned int&>, on_tree_edge> >; ColorMap = two_bit_color_map > >, long unsigned int> >]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/breadth_first_search.hpp:147:25: required from ‘void boost::breadth_first_search(const VertexListGraph&, typename graph_traits::vertex_descriptor, Buffer&, BFSVisitor, ColorMap) [with VertexListGraph = adjacency_list > > >; Buffer = queue > >; BFSVisitor = bfs_visitor >, vec_adj_list_vertex_id_map > >, long unsigned int>, long unsigned int, long unsigned int&>, on_tree_edge> >; ColorMap = two_bit_color_map > >, long unsigned int> >; typename graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/breadth_first_search.hpp:262:29: required from ‘void boost::detail::bfs_helper(VertexListGraph&, typename boost::graph_traits::vertex_descriptor, ColorMap, BFSVisitor, const boost::bgl_named_params&, mpl_::false_) [with VertexListGraph = boost::adjacency_list > > >; ColorMap = boost::two_bit_color_map > >, long unsigned int> >; BFSVisitor = boost::bfs_visitor >, boost::vec_adj_list_vertex_id_map > >, long unsigned int>, long unsigned int, long unsigned int&>, boost::on_tree_edge> >; P = boost::bfs_visitor >, boost::vec_adj_list_vertex_id_map > >, long unsigned int>, long unsigned int, long unsigned int&>, boost::on_tree_edge> >; T = boost::graph_visitor_t; R = boost::no_property; typename boost::graph_traits::vertex_descriptor = long unsigned int; mpl_::false_ = mpl_::bool_]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/breadth_first_search.hpp:309:23: required from ‘static void boost::detail::bfs_dispatch::apply(VertexListGraph&, typename boost::graph_traits::vertex_descriptor, const boost::bgl_named_params&, boost::param_not_found) [with VertexListGraph = boost::adjacency_list > > >; P = boost::bfs_visitor >, boost::vec_adj_list_vertex_id_map > >, long unsigned int>, long unsigned int, long unsigned int&>, boost::on_tree_edge> >; T = boost::graph_visitor_t; R = boost::no_property; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/breadth_first_search.hpp:339:37: required from ‘void boost::breadth_first_search(const VertexListGraph&, typename graph_traits::vertex_descriptor, const bgl_named_params&) [with VertexListGraph = adjacency_list > > >; P = bfs_visitor >, vec_adj_list_vertex_id_map > >, long unsigned int>, long unsigned int, long unsigned int&>, on_tree_edge> >; T = graph_visitor_t; R = no_property; typename graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/sloan_ordering.hpp:175:29: required from ‘typename boost::graph_traits::vertex_descriptor boost::sloan_start_end_vertices(Graph&, typename graph_traits::vertex_descriptor&, ColorMap, DegreeMap) [with Graph = adjacency_list > > >; ColorMap = vec_adj_list_vertex_property_map > > >, adjacency_list > > >*, default_color_type, default_color_type&, vertex_color_t>; DegreeMap = degree_property_map > > > >; typename graph_traits::vertex_descriptor = long unsigned int; typename graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/sloan_ordering.hpp:429:33: required from ‘OutputIterator boost::sloan_ordering(Graph&, OutputIterator, Color, Degree, Priority, Weight, Weight) [with Graph = adjacency_list > > >; OutputIterator = __gnu_cxx::__normal_iterator >; Color = vec_adj_list_vertex_property_map > > >, adjacency_list > > >*, default_color_type, default_color_type&, vertex_color_t>; Degree = degree_property_map > > > >; Priority = vec_adj_list_vertex_property_map > > >, adjacency_list > > >*, double, double&, vertex_priority_t>; Weight = int]’ ordering.cpp:245:17: required from here /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/graph_concepts.hpp:75:15: note: in a call to non-static member function ‘boost::concepts::IncidenceGraphConcept > > > >::~IncidenceGraphConcept()’ 75 | BOOST_concept(IncidenceGraph, (G)) : Graph< G > | ^~~~~~~~~~~~~~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/preprocessor/cat.hpp:29:34: note: in definition of macro ‘BOOST_PP_CAT_I’ 29 | # define BOOST_PP_CAT_I(a, b) a ## b | ^ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/concept_def.hpp:23:12: note: in expansion of macro ‘BOOST_PP_CAT’ 23 | struct BOOST_PP_CAT(name,Concept) \ | ^~~~~~~~~~~~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/graph_concepts.hpp:75:1: note: in expansion of macro ‘BOOST_concept’ 75 | BOOST_concept(IncidenceGraph, (G)) : Graph< G > | ^~~~~~~~~~~~~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::constraint::failed() [with Model = boost::BFSVisitorConcept >, boost::vec_adj_list_vertex_id_map > >, long unsigned int>, long unsigned int, long unsigned int&>, boost::on_tree_edge> >, boost::adjacency_list > > > >]’: /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/breadth_first_search.hpp:65:5: required from ‘void boost::breadth_first_visit(const IncidenceGraph&, SourceIterator, SourceIterator, Buffer&, BFSVisitor, ColorMap) [with IncidenceGraph = adjacency_list > > >; Buffer = queue > >; BFSVisitor = bfs_visitor >, vec_adj_list_vertex_id_map > >, long unsigned int>, long unsigned int, long unsigned int&>, on_tree_edge> >; ColorMap = two_bit_color_map > >, long unsigned int> >; SourceIterator = long unsigned int*]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/breadth_first_search.hpp:136:24: required from ‘void boost::breadth_first_search(const VertexListGraph&, SourceIterator, SourceIterator, Buffer&, BFSVisitor, ColorMap) [with VertexListGraph = adjacency_list > > >; SourceIterator = long unsigned int*; Buffer = queue > >; BFSVisitor = bfs_visitor >, vec_adj_list_vertex_id_map > >, long unsigned int>, long unsigned int, long unsigned int&>, on_tree_edge> >; ColorMap = two_bit_color_map > >, long unsigned int> >]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/breadth_first_search.hpp:147:25: required from ‘void boost::breadth_first_search(const VertexListGraph&, typename graph_traits::vertex_descriptor, Buffer&, BFSVisitor, ColorMap) [with VertexListGraph = adjacency_list > > >; Buffer = queue > >; BFSVisitor = bfs_visitor >, vec_adj_list_vertex_id_map > >, long unsigned int>, long unsigned int, long unsigned int&>, on_tree_edge> >; ColorMap = two_bit_color_map > >, long unsigned int> >; typename graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/breadth_first_search.hpp:262:29: required from ‘void boost::detail::bfs_helper(VertexListGraph&, typename boost::graph_traits::vertex_descriptor, ColorMap, BFSVisitor, const boost::bgl_named_params&, mpl_::false_) [with VertexListGraph = boost::adjacency_list > > >; ColorMap = boost::two_bit_color_map > >, long unsigned int> >; BFSVisitor = boost::bfs_visitor >, boost::vec_adj_list_vertex_id_map > >, long unsigned int>, long unsigned int, long unsigned int&>, boost::on_tree_edge> >; P = boost::bfs_visitor >, boost::vec_adj_list_vertex_id_map > >, long unsigned int>, long unsigned int, long unsigned int&>, boost::on_tree_edge> >; T = boost::graph_visitor_t; R = boost::no_property; typename boost::graph_traits::vertex_descriptor = long unsigned int; mpl_::false_ = mpl_::bool_]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/breadth_first_search.hpp:309:23: required from ‘static void boost::detail::bfs_dispatch::apply(VertexListGraph&, typename boost::graph_traits::vertex_descriptor, const boost::bgl_named_params&, boost::param_not_found) [with VertexListGraph = boost::adjacency_list > > >; P = boost::bfs_visitor >, boost::vec_adj_list_vertex_id_map > >, long unsigned int>, long unsigned int, long unsigned int&>, boost::on_tree_edge> >; T = boost::graph_visitor_t; R = boost::no_property; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/breadth_first_search.hpp:339:37: required from ‘void boost::breadth_first_search(const VertexListGraph&, typename graph_traits::vertex_descriptor, const bgl_named_params&) [with VertexListGraph = adjacency_list > > >; P = bfs_visitor >, vec_adj_list_vertex_id_map > >, long unsigned int>, long unsigned int, long unsigned int&>, on_tree_edge> >; T = graph_visitor_t; R = no_property; typename graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/sloan_ordering.hpp:175:29: required from ‘typename boost::graph_traits::vertex_descriptor boost::sloan_start_end_vertices(Graph&, typename graph_traits::vertex_descriptor&, ColorMap, DegreeMap) [with Graph = adjacency_list > > >; ColorMap = vec_adj_list_vertex_property_map > > >, adjacency_list > > >*, default_color_type, default_color_type&, vertex_color_t>; DegreeMap = degree_property_map > > > >; typename graph_traits::vertex_descriptor = long unsigned int; typename graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/sloan_ordering.hpp:429:33: required from ‘OutputIterator boost::sloan_ordering(Graph&, OutputIterator, Color, Degree, Priority, Weight, Weight) [with Graph = adjacency_list > > >; OutputIterator = __gnu_cxx::__normal_iterator >; Color = vec_adj_list_vertex_property_map > > >, adjacency_list > > >*, default_color_type, default_color_type&, vertex_color_t>; Degree = degree_property_map > > > >; Priority = vec_adj_list_vertex_property_map > > >, adjacency_list > > >*, double, double&, vertex_priority_t>; Weight = int]’ ordering.cpp:245:17: required from here /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:65:52: warning: ‘this’ pointer is null [-Wnonnull] 65 | static void failed() { ((Model*)0)->constraints(); } | ~~~~~~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/breadth_first_search.hpp:37:10: note: in a call to non-static member function ‘void boost::BFSVisitorConcept::constraints() [with Visitor = boost::bfs_visitor >, boost::vec_adj_list_vertex_id_map > >, long unsigned int>, long unsigned int, long unsigned int&>, boost::on_tree_edge> >; Graph = boost::adjacency_list > > >]’ 37 | void constraints() | ^~~~~~~~~~~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::constraint::failed() [with Model = boost::ReadWritePropertyMapConcept > >, long unsigned int> >, long unsigned int>]’: /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/breadth_first_search.hpp:66:5: required from ‘void boost::breadth_first_visit(const IncidenceGraph&, SourceIterator, SourceIterator, Buffer&, BFSVisitor, ColorMap) [with IncidenceGraph = adjacency_list > > >; Buffer = queue > >; BFSVisitor = bfs_visitor >, vec_adj_list_vertex_id_map > >, long unsigned int>, long unsigned int, long unsigned int&>, on_tree_edge> >; ColorMap = two_bit_color_map > >, long unsigned int> >; SourceIterator = long unsigned int*]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/breadth_first_search.hpp:136:24: required from ‘void boost::breadth_first_search(const VertexListGraph&, SourceIterator, SourceIterator, Buffer&, BFSVisitor, ColorMap) [with VertexListGraph = adjacency_list > > >; SourceIterator = long unsigned int*; Buffer = queue > >; BFSVisitor = bfs_visitor >, vec_adj_list_vertex_id_map > >, long unsigned int>, long unsigned int, long unsigned int&>, on_tree_edge> >; ColorMap = two_bit_color_map > >, long unsigned int> >]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/breadth_first_search.hpp:147:25: required from ‘void boost::breadth_first_search(const VertexListGraph&, typename graph_traits::vertex_descriptor, Buffer&, BFSVisitor, ColorMap) [with VertexListGraph = adjacency_list > > >; Buffer = queue > >; BFSVisitor = bfs_visitor >, vec_adj_list_vertex_id_map > >, long unsigned int>, long unsigned int, long unsigned int&>, on_tree_edge> >; ColorMap = two_bit_color_map > >, long unsigned int> >; typename graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/breadth_first_search.hpp:262:29: required from ‘void boost::detail::bfs_helper(VertexListGraph&, typename boost::graph_traits::vertex_descriptor, ColorMap, BFSVisitor, const boost::bgl_named_params&, mpl_::false_) [with VertexListGraph = boost::adjacency_list > > >; ColorMap = boost::two_bit_color_map > >, long unsigned int> >; BFSVisitor = boost::bfs_visitor >, boost::vec_adj_list_vertex_id_map > >, long unsigned int>, long unsigned int, long unsigned int&>, boost::on_tree_edge> >; P = boost::bfs_visitor >, boost::vec_adj_list_vertex_id_map > >, long unsigned int>, long unsigned int, long unsigned int&>, boost::on_tree_edge> >; T = boost::graph_visitor_t; R = boost::no_property; typename boost::graph_traits::vertex_descriptor = long unsigned int; mpl_::false_ = mpl_::bool_]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/breadth_first_search.hpp:309:23: required from ‘static void boost::detail::bfs_dispatch::apply(VertexListGraph&, typename boost::graph_traits::vertex_descriptor, const boost::bgl_named_params&, boost::param_not_found) [with VertexListGraph = boost::adjacency_list > > >; P = boost::bfs_visitor >, boost::vec_adj_list_vertex_id_map > >, long unsigned int>, long unsigned int, long unsigned int&>, boost::on_tree_edge> >; T = boost::graph_visitor_t; R = boost::no_property; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/breadth_first_search.hpp:339:37: required from ‘void boost::breadth_first_search(const VertexListGraph&, typename graph_traits::vertex_descriptor, const bgl_named_params&) [with VertexListGraph = adjacency_list > > >; P = bfs_visitor >, vec_adj_list_vertex_id_map > >, long unsigned int>, long unsigned int, long unsigned int&>, on_tree_edge> >; T = graph_visitor_t; R = no_property; typename graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/sloan_ordering.hpp:175:29: required from ‘typename boost::graph_traits::vertex_descriptor boost::sloan_start_end_vertices(Graph&, typename graph_traits::vertex_descriptor&, ColorMap, DegreeMap) [with Graph = adjacency_list > > >; ColorMap = vec_adj_list_vertex_property_map > > >, adjacency_list > > >*, default_color_type, default_color_type&, vertex_color_t>; DegreeMap = degree_property_map > > > >; typename graph_traits::vertex_descriptor = long unsigned int; typename graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/sloan_ordering.hpp:429:33: required from ‘OutputIterator boost::sloan_ordering(Graph&, OutputIterator, Color, Degree, Priority, Weight, Weight) [with Graph = adjacency_list > > >; OutputIterator = __gnu_cxx::__normal_iterator >; Color = vec_adj_list_vertex_property_map > > >, adjacency_list > > >*, default_color_type, default_color_type&, vertex_color_t>; Degree = degree_property_map > > > >; Priority = vec_adj_list_vertex_property_map > > >, adjacency_list > > >*, double, double&, vertex_priority_t>; Weight = int]’ ordering.cpp:245:17: required from here /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:65:52: warning: ‘this’ pointer is null [-Wnonnull] 65 | static void failed() { ((Model*)0)->constraints(); } | ~~~~~~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/property_map/property_map.hpp:205:10: note: in a call to non-static member function ‘void boost::ReadWritePropertyMapConcept::constraints() [with PMap = boost::two_bit_color_map > >, long unsigned int> >; Key = long unsigned int]’ 205 | void constraints() { | ^~~~~~~~~~~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::Assignable >]’: /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements > >]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:145:5: required from ‘struct boost::Assignable >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:502:3: required from ‘struct boost::InputIterator >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::InputIterator >]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied > >::value’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:45:51: [ skipping 5 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/graph_concepts.hpp:176:1: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::VertexListGraphConcept > >]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/isomorphism.hpp:494:5: required from ‘bool boost::isomorphism(const Graph1&, const Graph2&, IsoMapping, Invariant1, Invariant2, std::size_t, IndexMap1, IndexMap2) [with Graph1 = adjacency_list >; Graph2 = adjacency_list >; IsoMapping = iterator_property_map<__gnu_cxx::__normal_iterator >, adj_list_vertex_property_map >, int, int&, vertex_index_t>, void*, void*&>; Invariant1 = degree_vertex_invariant >, int, const int&, vertex_index_t> >, adjacency_list > >; Invariant2 = degree_vertex_invariant >, int, const int&, vertex_index_t> >, adjacency_list > >; IndexMap1 = adj_list_vertex_property_map >, int, const int&, vertex_index_t>; IndexMap2 = adj_list_vertex_property_map >, int, const int&, vertex_index_t>; std::size_t = long unsigned int]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/isomorphism.hpp:651:42: required from ‘bool boost::graph::detail::isomorphism_impl::operator()(const Graph1&, const Graph2&, const ArgPack&) const [with ArgPack = boost::parameter::aux::arg_list >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&> >, boost::parameter::aux::empty_arg_list, std::integral_constant >; Graph1 = boost::adjacency_list >; Graph2 = boost::adjacency_list >]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/isomorphism.hpp:662:5: required from ‘typename boost::result_of(Param0, Param1, const ArgPack&)>::type boost::graph::isomorphism_with_named_params(const Param0&, const Param1&, const ArgPack&) [with Param0 = boost::adjacency_list >; Param1 = boost::adjacency_list >; ArgPack = boost::parameter::aux::arg_list >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&> >, boost::parameter::aux::empty_arg_list, std::integral_constant >; typename boost::result_of(Param0, Param1, const ArgPack&)>::type = bool]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/isomorphism.hpp:666:1: required from ‘typename boost::result_of(Param0, Param1, const typename boost::detail::convert_bgl_params_to_boost_parameter >::type&)>::type boost::isomorphism(const Param0&, const Param1&, const bgl_named_params&) [with Param0 = adjacency_list >; Param1 = adjacency_list >; P = iterator_property_map<__gnu_cxx::__normal_iterator >, adj_list_vertex_property_map >, int, int&, vertex_index_t>, void*, void*&>; T = vertex_isomorphism_t; R = no_property; typename result_of(Param0, Param1, const typename detail::convert_bgl_params_to_boost_parameter >::type&)>::type = bool; typename detail::convert_bgl_params_to_boost_parameter >::type = parameter::aux::arg_list >, adj_list_vertex_property_map >, int, int&, vertex_index_t>, void*, void*&> >, parameter::aux::empty_arg_list, std::integral_constant >]’ ordering.cpp:68:18: required from here /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::Assignable::~Assignable() [with TT = std::_List_iterator]’ 37 | ~model() | ^ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:145:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 145 | BOOST_CONCEPT_USAGE(Assignable) { | ^~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::EqualityComparable >]’: /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements > >]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:233:5: required from ‘struct boost::EqualityComparable >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:502:3: required from ‘struct boost::InputIterator >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::InputIterator >]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied > >::value’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:45:51: [ skipping 5 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/graph_concepts.hpp:176:1: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::VertexListGraphConcept > >]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/isomorphism.hpp:494:5: required from ‘bool boost::isomorphism(const Graph1&, const Graph2&, IsoMapping, Invariant1, Invariant2, std::size_t, IndexMap1, IndexMap2) [with Graph1 = adjacency_list >; Graph2 = adjacency_list >; IsoMapping = iterator_property_map<__gnu_cxx::__normal_iterator >, adj_list_vertex_property_map >, int, int&, vertex_index_t>, void*, void*&>; Invariant1 = degree_vertex_invariant >, int, const int&, vertex_index_t> >, adjacency_list > >; Invariant2 = degree_vertex_invariant >, int, const int&, vertex_index_t> >, adjacency_list > >; IndexMap1 = adj_list_vertex_property_map >, int, const int&, vertex_index_t>; IndexMap2 = adj_list_vertex_property_map >, int, const int&, vertex_index_t>; std::size_t = long unsigned int]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/isomorphism.hpp:651:42: required from ‘bool boost::graph::detail::isomorphism_impl::operator()(const Graph1&, const Graph2&, const ArgPack&) const [with ArgPack = boost::parameter::aux::arg_list >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&> >, boost::parameter::aux::empty_arg_list, std::integral_constant >; Graph1 = boost::adjacency_list >; Graph2 = boost::adjacency_list >]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/isomorphism.hpp:662:5: required from ‘typename boost::result_of(Param0, Param1, const ArgPack&)>::type boost::graph::isomorphism_with_named_params(const Param0&, const Param1&, const ArgPack&) [with Param0 = boost::adjacency_list >; Param1 = boost::adjacency_list >; ArgPack = boost::parameter::aux::arg_list >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&> >, boost::parameter::aux::empty_arg_list, std::integral_constant >; typename boost::result_of(Param0, Param1, const ArgPack&)>::type = bool]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/isomorphism.hpp:666:1: required from ‘typename boost::result_of(Param0, Param1, const typename boost::detail::convert_bgl_params_to_boost_parameter >::type&)>::type boost::isomorphism(const Param0&, const Param1&, const bgl_named_params&) [with Param0 = adjacency_list >; Param1 = adjacency_list >; P = iterator_property_map<__gnu_cxx::__normal_iterator >, adj_list_vertex_property_map >, int, int&, vertex_index_t>, void*, void*&>; T = vertex_isomorphism_t; R = no_property; typename result_of(Param0, Param1, const typename detail::convert_bgl_params_to_boost_parameter >::type&)>::type = bool; typename detail::convert_bgl_params_to_boost_parameter >::type = parameter::aux::arg_list >, adj_list_vertex_property_map >, int, int&, vertex_index_t>, void*, void*&> >, parameter::aux::empty_arg_list, std::integral_constant >]’ ordering.cpp:68:18: required from here /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::EqualityComparable::~EqualityComparable() [with TT = std::_List_iterator]’ 37 | ~model() | ^ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:233:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 233 | BOOST_CONCEPT_USAGE(EqualityComparable) { | ^~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::InputIterator >]’: /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements > >]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:512:7: required from ‘struct boost::InputIterator >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::InputIterator >]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied > >::value’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied > >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:72:8: [ skipping 4 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/graph_concepts.hpp:176:1: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::VertexListGraphConcept > >]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/isomorphism.hpp:494:5: required from ‘bool boost::isomorphism(const Graph1&, const Graph2&, IsoMapping, Invariant1, Invariant2, std::size_t, IndexMap1, IndexMap2) [with Graph1 = adjacency_list >; Graph2 = adjacency_list >; IsoMapping = iterator_property_map<__gnu_cxx::__normal_iterator >, adj_list_vertex_property_map >, int, int&, vertex_index_t>, void*, void*&>; Invariant1 = degree_vertex_invariant >, int, const int&, vertex_index_t> >, adjacency_list > >; Invariant2 = degree_vertex_invariant >, int, const int&, vertex_index_t> >, adjacency_list > >; IndexMap1 = adj_list_vertex_property_map >, int, const int&, vertex_index_t>; IndexMap2 = adj_list_vertex_property_map >, int, const int&, vertex_index_t>; std::size_t = long unsigned int]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/isomorphism.hpp:651:42: required from ‘bool boost::graph::detail::isomorphism_impl::operator()(const Graph1&, const Graph2&, const ArgPack&) const [with ArgPack = boost::parameter::aux::arg_list >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&> >, boost::parameter::aux::empty_arg_list, std::integral_constant >; Graph1 = boost::adjacency_list >; Graph2 = boost::adjacency_list >]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/isomorphism.hpp:662:5: required from ‘typename boost::result_of(Param0, Param1, const ArgPack&)>::type boost::graph::isomorphism_with_named_params(const Param0&, const Param1&, const ArgPack&) [with Param0 = boost::adjacency_list >; Param1 = boost::adjacency_list >; ArgPack = boost::parameter::aux::arg_list >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&> >, boost::parameter::aux::empty_arg_list, std::integral_constant >; typename boost::result_of(Param0, Param1, const ArgPack&)>::type = bool]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/isomorphism.hpp:666:1: required from ‘typename boost::result_of(Param0, Param1, const typename boost::detail::convert_bgl_params_to_boost_parameter >::type&)>::type boost::isomorphism(const Param0&, const Param1&, const bgl_named_params&) [with Param0 = adjacency_list >; Param1 = adjacency_list >; P = iterator_property_map<__gnu_cxx::__normal_iterator >, adj_list_vertex_property_map >, int, int&, vertex_index_t>, void*, void*&>; T = vertex_isomorphism_t; R = no_property; typename result_of(Param0, Param1, const typename detail::convert_bgl_params_to_boost_parameter >::type&)>::type = bool; typename detail::convert_bgl_params_to_boost_parameter >::type = parameter::aux::arg_list >, adj_list_vertex_property_map >, int, int&, vertex_index_t>, void*, void*&> >, parameter::aux::empty_arg_list, std::integral_constant >]’ ordering.cpp:68:18: required from here /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::InputIterator::~InputIterator() [with TT = std::_List_iterator]’ 37 | ~model() | ^ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:512:7: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 512 | BOOST_CONCEPT_USAGE(InputIterator) | ^~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::Assignable >, boost::detail::edge_desc_impl, long int> >]’: /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements >, boost::detail::edge_desc_impl, long int> > >]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:145:5: required from ‘struct boost::Assignable >, boost::detail::edge_desc_impl, long int> >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:502:3: required from ‘struct boost::InputIterator >, boost::detail::edge_desc_impl, long int> >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::InputIterator >, boost::detail::edge_desc_impl, long int> >]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied >, boost::detail::edge_desc_impl, long int> > >::value’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:45:51: [ skipping 5 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/graph_concepts.hpp:226:1: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::EdgeListGraphConcept > >]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/isomorphism.hpp:495:5: required from ‘bool boost::isomorphism(const Graph1&, const Graph2&, IsoMapping, Invariant1, Invariant2, std::size_t, IndexMap1, IndexMap2) [with Graph1 = adjacency_list >; Graph2 = adjacency_list >; IsoMapping = iterator_property_map<__gnu_cxx::__normal_iterator >, adj_list_vertex_property_map >, int, int&, vertex_index_t>, void*, void*&>; Invariant1 = degree_vertex_invariant >, int, const int&, vertex_index_t> >, adjacency_list > >; Invariant2 = degree_vertex_invariant >, int, const int&, vertex_index_t> >, adjacency_list > >; IndexMap1 = adj_list_vertex_property_map >, int, const int&, vertex_index_t>; IndexMap2 = adj_list_vertex_property_map >, int, const int&, vertex_index_t>; std::size_t = long unsigned int]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/isomorphism.hpp:651:42: required from ‘bool boost::graph::detail::isomorphism_impl::operator()(const Graph1&, const Graph2&, const ArgPack&) const [with ArgPack = boost::parameter::aux::arg_list >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&> >, boost::parameter::aux::empty_arg_list, std::integral_constant >; Graph1 = boost::adjacency_list >; Graph2 = boost::adjacency_list >]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/isomorphism.hpp:662:5: required from ‘typename boost::result_of(Param0, Param1, const ArgPack&)>::type boost::graph::isomorphism_with_named_params(const Param0&, const Param1&, const ArgPack&) [with Param0 = boost::adjacency_list >; Param1 = boost::adjacency_list >; ArgPack = boost::parameter::aux::arg_list >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&> >, boost::parameter::aux::empty_arg_list, std::integral_constant >; typename boost::result_of(Param0, Param1, const ArgPack&)>::type = bool]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/isomorphism.hpp:666:1: required from ‘typename boost::result_of(Param0, Param1, const typename boost::detail::convert_bgl_params_to_boost_parameter >::type&)>::type boost::isomorphism(const Param0&, const Param1&, const bgl_named_params&) [with Param0 = adjacency_list >; Param1 = adjacency_list >; P = iterator_property_map<__gnu_cxx::__normal_iterator >, adj_list_vertex_property_map >, int, int&, vertex_index_t>, void*, void*&>; T = vertex_isomorphism_t; R = no_property; typename result_of(Param0, Param1, const typename detail::convert_bgl_params_to_boost_parameter >::type&)>::type = bool; typename detail::convert_bgl_params_to_boost_parameter >::type = parameter::aux::arg_list >, adj_list_vertex_property_map >, int, int&, vertex_index_t>, void*, void*&> >, parameter::aux::empty_arg_list, std::integral_constant >]’ ordering.cpp:68:18: required from here /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::Assignable::~Assignable() [with TT = boost::detail::undirected_edge_iter >, boost::detail::edge_desc_impl, long int>]’ 37 | ~model() | ^ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:145:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 145 | BOOST_CONCEPT_USAGE(Assignable) { | ^~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::EqualityComparable >, boost::detail::edge_desc_impl, long int> >]’: /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements >, boost::detail::edge_desc_impl, long int> > >]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:233:5: required from ‘struct boost::EqualityComparable >, boost::detail::edge_desc_impl, long int> >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:502:3: required from ‘struct boost::InputIterator >, boost::detail::edge_desc_impl, long int> >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::InputIterator >, boost::detail::edge_desc_impl, long int> >]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied >, boost::detail::edge_desc_impl, long int> > >::value’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:45:51: [ skipping 5 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/graph_concepts.hpp:226:1: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::EdgeListGraphConcept > >]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/isomorphism.hpp:495:5: required from ‘bool boost::isomorphism(const Graph1&, const Graph2&, IsoMapping, Invariant1, Invariant2, std::size_t, IndexMap1, IndexMap2) [with Graph1 = adjacency_list >; Graph2 = adjacency_list >; IsoMapping = iterator_property_map<__gnu_cxx::__normal_iterator >, adj_list_vertex_property_map >, int, int&, vertex_index_t>, void*, void*&>; Invariant1 = degree_vertex_invariant >, int, const int&, vertex_index_t> >, adjacency_list > >; Invariant2 = degree_vertex_invariant >, int, const int&, vertex_index_t> >, adjacency_list > >; IndexMap1 = adj_list_vertex_property_map >, int, const int&, vertex_index_t>; IndexMap2 = adj_list_vertex_property_map >, int, const int&, vertex_index_t>; std::size_t = long unsigned int]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/isomorphism.hpp:651:42: required from ‘bool boost::graph::detail::isomorphism_impl::operator()(const Graph1&, const Graph2&, const ArgPack&) const [with ArgPack = boost::parameter::aux::arg_list >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&> >, boost::parameter::aux::empty_arg_list, std::integral_constant >; Graph1 = boost::adjacency_list >; Graph2 = boost::adjacency_list >]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/isomorphism.hpp:662:5: required from ‘typename boost::result_of(Param0, Param1, const ArgPack&)>::type boost::graph::isomorphism_with_named_params(const Param0&, const Param1&, const ArgPack&) [with Param0 = boost::adjacency_list >; Param1 = boost::adjacency_list >; ArgPack = boost::parameter::aux::arg_list >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&> >, boost::parameter::aux::empty_arg_list, std::integral_constant >; typename boost::result_of(Param0, Param1, const ArgPack&)>::type = bool]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/isomorphism.hpp:666:1: required from ‘typename boost::result_of(Param0, Param1, const typename boost::detail::convert_bgl_params_to_boost_parameter >::type&)>::type boost::isomorphism(const Param0&, const Param1&, const bgl_named_params&) [with Param0 = adjacency_list >; Param1 = adjacency_list >; P = iterator_property_map<__gnu_cxx::__normal_iterator >, adj_list_vertex_property_map >, int, int&, vertex_index_t>, void*, void*&>; T = vertex_isomorphism_t; R = no_property; typename result_of(Param0, Param1, const typename detail::convert_bgl_params_to_boost_parameter >::type&)>::type = bool; typename detail::convert_bgl_params_to_boost_parameter >::type = parameter::aux::arg_list >, adj_list_vertex_property_map >, int, int&, vertex_index_t>, void*, void*&> >, parameter::aux::empty_arg_list, std::integral_constant >]’ ordering.cpp:68:18: required from here /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::EqualityComparable::~EqualityComparable() [with TT = boost::detail::undirected_edge_iter >, boost::detail::edge_desc_impl, long int>]’ 37 | ~model() | ^ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:233:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 233 | BOOST_CONCEPT_USAGE(EqualityComparable) { | ^~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::InputIterator >, boost::detail::edge_desc_impl, long int> >]’: /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements >, boost::detail::edge_desc_impl, long int> > >]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:512:7: required from ‘struct boost::InputIterator >, boost::detail::edge_desc_impl, long int> >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::InputIterator >, boost::detail::edge_desc_impl, long int> >]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied >, boost::detail::edge_desc_impl, long int> > >::value’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied >, boost::detail::edge_desc_impl, long int> > >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:72:8: [ skipping 4 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/graph_concepts.hpp:226:1: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::EdgeListGraphConcept > >]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/isomorphism.hpp:495:5: required from ‘bool boost::isomorphism(const Graph1&, const Graph2&, IsoMapping, Invariant1, Invariant2, std::size_t, IndexMap1, IndexMap2) [with Graph1 = adjacency_list >; Graph2 = adjacency_list >; IsoMapping = iterator_property_map<__gnu_cxx::__normal_iterator >, adj_list_vertex_property_map >, int, int&, vertex_index_t>, void*, void*&>; Invariant1 = degree_vertex_invariant >, int, const int&, vertex_index_t> >, adjacency_list > >; Invariant2 = degree_vertex_invariant >, int, const int&, vertex_index_t> >, adjacency_list > >; IndexMap1 = adj_list_vertex_property_map >, int, const int&, vertex_index_t>; IndexMap2 = adj_list_vertex_property_map >, int, const int&, vertex_index_t>; std::size_t = long unsigned int]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/isomorphism.hpp:651:42: required from ‘bool boost::graph::detail::isomorphism_impl::operator()(const Graph1&, const Graph2&, const ArgPack&) const [with ArgPack = boost::parameter::aux::arg_list >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&> >, boost::parameter::aux::empty_arg_list, std::integral_constant >; Graph1 = boost::adjacency_list >; Graph2 = boost::adjacency_list >]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/isomorphism.hpp:662:5: required from ‘typename boost::result_of(Param0, Param1, const ArgPack&)>::type boost::graph::isomorphism_with_named_params(const Param0&, const Param1&, const ArgPack&) [with Param0 = boost::adjacency_list >; Param1 = boost::adjacency_list >; ArgPack = boost::parameter::aux::arg_list >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&> >, boost::parameter::aux::empty_arg_list, std::integral_constant >; typename boost::result_of(Param0, Param1, const ArgPack&)>::type = bool]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/isomorphism.hpp:666:1: required from ‘typename boost::result_of(Param0, Param1, const typename boost::detail::convert_bgl_params_to_boost_parameter >::type&)>::type boost::isomorphism(const Param0&, const Param1&, const bgl_named_params&) [with Param0 = adjacency_list >; Param1 = adjacency_list >; P = iterator_property_map<__gnu_cxx::__normal_iterator >, adj_list_vertex_property_map >, int, int&, vertex_index_t>, void*, void*&>; T = vertex_isomorphism_t; R = no_property; typename result_of(Param0, Param1, const typename detail::convert_bgl_params_to_boost_parameter >::type&)>::type = bool; typename detail::convert_bgl_params_to_boost_parameter >::type = parameter::aux::arg_list >, adj_list_vertex_property_map >, int, int&, vertex_index_t>, void*, void*&> >, parameter::aux::empty_arg_list, std::integral_constant >]’ ordering.cpp:68:18: required from here /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::InputIterator::~InputIterator() [with TT = boost::detail::undirected_edge_iter >, boost::detail::edge_desc_impl, long int>]’ 37 | ~model() | ^ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:512:7: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 512 | BOOST_CONCEPT_USAGE(InputIterator) | ^~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements >, boost::no_property>*, std::vector >, boost::no_property>, std::allocator >, boost::no_property> > > >, void*, boost::detail::edge_desc_impl, long int> > >]’: /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/graph_concepts.hpp:52:50: required from ‘struct boost::concepts::MultiPassInputIterator >, boost::no_property>*, std::vector >, boost::no_property>, std::allocator >, boost::no_property> > > >, void*, boost::detail::edge_desc_impl, long int> >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::concepts::MultiPassInputIterator >, boost::no_property>*, std::vector >, boost::no_property>, std::allocator >, boost::no_property> > > >, void*, boost::detail::edge_desc_impl, long int> >]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied >, boost::no_property>*, std::vector >, boost::no_property>, std::allocator >, boost::no_property> > > >, void*, boost::detail::edge_desc_impl, long int> > >::value’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied >, boost::no_property>*, std::vector >, boost::no_property>, std::allocator >, boost::no_property> > > >, void*, boost::detail::edge_desc_impl, long int> > >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_ >, boost::no_property>*, std::vector >, boost::no_property>, std::allocator >, boost::no_property> > > >, void*, boost::detail::edge_desc_impl, long int> >)>’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/graph_concepts.hpp:89:9: [ skipping 4 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/isomorphism.hpp:209:38: required from ‘bool boost::detail::isomorphism_algo::test_isomorphism() [with Graph1 = boost::adjacency_list >; Graph2 = boost::adjacency_list >; IsoMapping = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&>; Invariant1 = boost::degree_vertex_invariant >, int, const int&, boost::vertex_index_t> >, boost::adjacency_list > >; Invariant2 = boost::degree_vertex_invariant >, int, const int&, boost::vertex_index_t> >, boost::adjacency_list > >; IndexMap1 = boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>; IndexMap2 = boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/isomorphism.hpp:532:33: required from ‘bool boost::isomorphism(const Graph1&, const Graph2&, IsoMapping, Invariant1, Invariant2, std::size_t, IndexMap1, IndexMap2) [with Graph1 = adjacency_list >; Graph2 = adjacency_list >; IsoMapping = iterator_property_map<__gnu_cxx::__normal_iterator >, adj_list_vertex_property_map >, int, int&, vertex_index_t>, void*, void*&>; Invariant1 = degree_vertex_invariant >, int, const int&, vertex_index_t> >, adjacency_list > >; Invariant2 = degree_vertex_invariant >, int, const int&, vertex_index_t> >, adjacency_list > >; IndexMap1 = adj_list_vertex_property_map >, int, const int&, vertex_index_t>; IndexMap2 = adj_list_vertex_property_map >, int, const int&, vertex_index_t>; std::size_t = long unsigned int]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/isomorphism.hpp:651:42: required from ‘bool boost::graph::detail::isomorphism_impl::operator()(const Graph1&, const Graph2&, const ArgPack&) const [with ArgPack = boost::parameter::aux::arg_list >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&> >, boost::parameter::aux::empty_arg_list, std::integral_constant >; Graph1 = boost::adjacency_list >; Graph2 = boost::adjacency_list >]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/isomorphism.hpp:662:5: required from ‘typename boost::result_of(Param0, Param1, const ArgPack&)>::type boost::graph::isomorphism_with_named_params(const Param0&, const Param1&, const ArgPack&) [with Param0 = boost::adjacency_list >; Param1 = boost::adjacency_list >; ArgPack = boost::parameter::aux::arg_list >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&> >, boost::parameter::aux::empty_arg_list, std::integral_constant >; typename boost::result_of(Param0, Param1, const ArgPack&)>::type = bool]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/isomorphism.hpp:666:1: required from ‘typename boost::result_of(Param0, Param1, const typename boost::detail::convert_bgl_params_to_boost_parameter >::type&)>::type boost::isomorphism(const Param0&, const Param1&, const bgl_named_params&) [with Param0 = adjacency_list >; Param1 = adjacency_list >; P = iterator_property_map<__gnu_cxx::__normal_iterator >, adj_list_vertex_property_map >, int, int&, vertex_index_t>, void*, void*&>; T = vertex_isomorphism_t; R = no_property; typename result_of(Param0, Param1, const typename detail::convert_bgl_params_to_boost_parameter >::type&)>::type = bool; typename detail::convert_bgl_params_to_boost_parameter >::type = parameter::aux::arg_list >, adj_list_vertex_property_map >, int, int&, vertex_index_t>, void*, void*&> >, parameter::aux::empty_arg_list, std::integral_constant >]’ ordering.cpp:68:18: required from here /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::concepts::MultiPassInputIterator >, boost::no_property>*, std::vector >, boost::no_property>, std::allocator >, boost::no_property> > > >, void*, boost::detail::edge_desc_impl, long int> >]’ 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ^ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::MultiPassInputIterator >, boost::no_property>*, std::vector >, boost::no_property>, std::allocator >, boost::no_property> > > >, void*, boost::detail::edge_desc_impl, long int> >]’: /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/graph_concepts.hpp:89:9: required from ‘boost::concepts::IncidenceGraph::~IncidenceGraph() [with G = boost::adjacency_list >]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/graph_concepts.hpp:75:1: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::IncidenceGraphConcept > >]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/depth_first_search.hpp:129:9: required from ‘void boost::detail::depth_first_visit_impl(const IncidenceGraph&, typename boost::graph_traits::vertex_descriptor, DFSVisitor&, ColorMap, TerminatorFunc) [with IncidenceGraph = boost::adjacency_list >; DFSVisitor = isomorphism_algo >, boost::adjacency_list >, boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&>, boost::degree_vertex_invariant >, int, const int&, boost::vertex_index_t> >, boost::adjacency_list > >, boost::degree_vertex_invariant >, int, const int&, boost::vertex_index_t> >, boost::adjacency_list > >, boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>, boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t> >::record_dfs_order; ColorMap = boost::safe_iterator_property_map<__gnu_cxx::__normal_iterator >, boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>, boost::default_color_type, boost::default_color_type&>; TerminatorFunc = nontruth2; typename boost::graph_traits::vertex_descriptor = void*]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/depth_first_search.hpp:417:35: required from ‘void boost::depth_first_visit(const IncidenceGraph&, typename graph_traits::vertex_descriptor, DFSVisitor, ColorMap) [with IncidenceGraph = adjacency_list >; DFSVisitor = detail::isomorphism_algo >, adjacency_list >, iterator_property_map<__gnu_cxx::__normal_iterator >, adj_list_vertex_property_map >, int, int&, vertex_index_t>, void*, void*&>, degree_vertex_invariant >, int, const int&, vertex_index_t> >, adjacency_list > >, degree_vertex_invariant >, int, const int&, vertex_index_t> >, adjacency_list > >, adj_list_vertex_property_map >, int, const int&, vertex_index_t>, adj_list_vertex_property_map >, int, const int&, vertex_index_t> >::record_dfs_order; ColorMap = safe_iterator_property_map<__gnu_cxx::__normal_iterator >, adj_list_vertex_property_map >, int, const int&, vertex_index_t>, default_color_type, default_color_type&>; typename graph_traits::vertex_descriptor = void*]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/isomorphism.hpp:209:38: required from ‘bool boost::detail::isomorphism_algo::test_isomorphism() [with Graph1 = boost::adjacency_list >; Graph2 = boost::adjacency_list >; IsoMapping = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&>; Invariant1 = boost::degree_vertex_invariant >, int, const int&, boost::vertex_index_t> >, boost::adjacency_list > >; Invariant2 = boost::degree_vertex_invariant >, int, const int&, boost::vertex_index_t> >, boost::adjacency_list > >; IndexMap1 = boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>; IndexMap2 = boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/isomorphism.hpp:532:33: required from ‘bool boost::isomorphism(const Graph1&, const Graph2&, IsoMapping, Invariant1, Invariant2, std::size_t, IndexMap1, IndexMap2) [with Graph1 = adjacency_list >; Graph2 = adjacency_list >; IsoMapping = iterator_property_map<__gnu_cxx::__normal_iterator >, adj_list_vertex_property_map >, int, int&, vertex_index_t>, void*, void*&>; Invariant1 = degree_vertex_invariant >, int, const int&, vertex_index_t> >, adjacency_list > >; Invariant2 = degree_vertex_invariant >, int, const int&, vertex_index_t> >, adjacency_list > >; IndexMap1 = adj_list_vertex_property_map >, int, const int&, vertex_index_t>; IndexMap2 = adj_list_vertex_property_map >, int, const int&, vertex_index_t>; std::size_t = long unsigned int]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/isomorphism.hpp:651:42: required from ‘bool boost::graph::detail::isomorphism_impl::operator()(const Graph1&, const Graph2&, const ArgPack&) const [with ArgPack = boost::parameter::aux::arg_list >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&> >, boost::parameter::aux::empty_arg_list, std::integral_constant >; Graph1 = boost::adjacency_list >; Graph2 = boost::adjacency_list >]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/isomorphism.hpp:662:5: required from ‘typename boost::result_of(Param0, Param1, const ArgPack&)>::type boost::graph::isomorphism_with_named_params(const Param0&, const Param1&, const ArgPack&) [with Param0 = boost::adjacency_list >; Param1 = boost::adjacency_list >; ArgPack = boost::parameter::aux::arg_list >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&> >, boost::parameter::aux::empty_arg_list, std::integral_constant >; typename boost::result_of(Param0, Param1, const ArgPack&)>::type = bool]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/isomorphism.hpp:666:1: required from ‘typename boost::result_of(Param0, Param1, const typename boost::detail::convert_bgl_params_to_boost_parameter >::type&)>::type boost::isomorphism(const Param0&, const Param1&, const bgl_named_params&) [with Param0 = adjacency_list >; Param1 = adjacency_list >; P = iterator_property_map<__gnu_cxx::__normal_iterator >, adj_list_vertex_property_map >, int, int&, vertex_index_t>, void*, void*&>; T = vertex_isomorphism_t; R = no_property; typename result_of(Param0, Param1, const typename detail::convert_bgl_params_to_boost_parameter >::type&)>::type = bool; typename detail::convert_bgl_params_to_boost_parameter >::type = parameter::aux::arg_list >, adj_list_vertex_property_map >, int, int&, vertex_index_t>, void*, void*&> >, parameter::aux::empty_arg_list, std::integral_constant >]’ ordering.cpp:68:18: required from here /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::concepts::MultiPassInputIterator::~MultiPassInputIterator() [with T = boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator >, boost::no_property>*, std::vector >, boost::no_property>, std::allocator >, boost::no_property> > > >, void*, boost::detail::edge_desc_impl, long int>]’ 37 | ~model() | ^ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/graph_concepts.hpp:52:50: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 52 | BOOST_concept(MultiPassInputIterator, (T)) { BOOST_CONCEPT_USAGE( | ^~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::CopyConstructible >, boost::adjacency_list >, boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&>, boost::degree_vertex_invariant >, int, const int&, boost::vertex_index_t> >, boost::adjacency_list > >, boost::degree_vertex_invariant >, int, const int&, boost::vertex_index_t> >, boost::adjacency_list > >, boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>, boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t> >::record_dfs_order>]’: /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements >, boost::adjacency_list >, boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&>, boost::degree_vertex_invariant >, int, const int&, boost::vertex_index_t> >, boost::adjacency_list > >, boost::degree_vertex_invariant >, int, const int&, boost::vertex_index_t> >, boost::adjacency_list > >, boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>, boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t> >::record_dfs_order> >]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:167:5: required from ‘struct boost::CopyConstructible >, boost::adjacency_list >, boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&>, boost::degree_vertex_invariant >, int, const int&, boost::vertex_index_t> >, boost::adjacency_list > >, boost::degree_vertex_invariant >, int, const int&, boost::vertex_index_t> >, boost::adjacency_list > >, boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>, boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t> >::record_dfs_order>’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:165:3: required from ‘struct boost::CopyConstructibleConcept >, boost::adjacency_list >, boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&>, boost::degree_vertex_invariant >, int, const int&, boost::vertex_index_t> >, boost::adjacency_list > >, boost::degree_vertex_invariant >, int, const int&, boost::vertex_index_t> >, boost::adjacency_list > >, boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>, boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t> >::record_dfs_order>’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::CopyConstructibleConcept >, boost::adjacency_list >, boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&>, boost::degree_vertex_invariant >, int, const int&, boost::vertex_index_t> >, boost::adjacency_list > >, boost::degree_vertex_invariant >, int, const int&, boost::vertex_index_t> >, boost::adjacency_list > >, boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>, boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t> >::record_dfs_order>]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied >, boost::adjacency_list >, boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&>, boost::degree_vertex_invariant >, int, const int&, boost::vertex_index_t> >, boost::adjacency_list > >, boost::degree_vertex_invariant >, int, const int&, boost::vertex_index_t> >, boost::adjacency_list > >, boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>, boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t> >::record_dfs_order> >::value’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:45:51: [ skipping 9 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/isomorphism.hpp:209:38: required from ‘bool boost::detail::isomorphism_algo::test_isomorphism() [with Graph1 = boost::adjacency_list >; Graph2 = boost::adjacency_list >; IsoMapping = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&>; Invariant1 = boost::degree_vertex_invariant >, int, const int&, boost::vertex_index_t> >, boost::adjacency_list > >; Invariant2 = boost::degree_vertex_invariant >, int, const int&, boost::vertex_index_t> >, boost::adjacency_list > >; IndexMap1 = boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>; IndexMap2 = boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/isomorphism.hpp:532:33: required from ‘bool boost::isomorphism(const Graph1&, const Graph2&, IsoMapping, Invariant1, Invariant2, std::size_t, IndexMap1, IndexMap2) [with Graph1 = adjacency_list >; Graph2 = adjacency_list >; IsoMapping = iterator_property_map<__gnu_cxx::__normal_iterator >, adj_list_vertex_property_map >, int, int&, vertex_index_t>, void*, void*&>; Invariant1 = degree_vertex_invariant >, int, const int&, vertex_index_t> >, adjacency_list > >; Invariant2 = degree_vertex_invariant >, int, const int&, vertex_index_t> >, adjacency_list > >; IndexMap1 = adj_list_vertex_property_map >, int, const int&, vertex_index_t>; IndexMap2 = adj_list_vertex_property_map >, int, const int&, vertex_index_t>; std::size_t = long unsigned int]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/isomorphism.hpp:651:42: required from ‘bool boost::graph::detail::isomorphism_impl::operator()(const Graph1&, const Graph2&, const ArgPack&) const [with ArgPack = boost::parameter::aux::arg_list >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&> >, boost::parameter::aux::empty_arg_list, std::integral_constant >; Graph1 = boost::adjacency_list >; Graph2 = boost::adjacency_list >]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/isomorphism.hpp:662:5: required from ‘typename boost::result_of(Param0, Param1, const ArgPack&)>::type boost::graph::isomorphism_with_named_params(const Param0&, const Param1&, const ArgPack&) [with Param0 = boost::adjacency_list >; Param1 = boost::adjacency_list >; ArgPack = boost::parameter::aux::arg_list >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&> >, boost::parameter::aux::empty_arg_list, std::integral_constant >; typename boost::result_of(Param0, Param1, const ArgPack&)>::type = bool]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/isomorphism.hpp:666:1: required from ‘typename boost::result_of(Param0, Param1, const typename boost::detail::convert_bgl_params_to_boost_parameter >::type&)>::type boost::isomorphism(const Param0&, const Param1&, const bgl_named_params&) [with Param0 = adjacency_list >; Param1 = adjacency_list >; P = iterator_property_map<__gnu_cxx::__normal_iterator >, adj_list_vertex_property_map >, int, int&, vertex_index_t>, void*, void*&>; T = vertex_isomorphism_t; R = no_property; typename result_of(Param0, Param1, const typename detail::convert_bgl_params_to_boost_parameter >::type&)>::type = bool; typename detail::convert_bgl_params_to_boost_parameter >::type = parameter::aux::arg_list >, adj_list_vertex_property_map >, int, int&, vertex_index_t>, void*, void*&> >, parameter::aux::empty_arg_list, std::integral_constant >]’ ordering.cpp:68:18: required from here /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::CopyConstructible::~CopyConstructible() [with TT = boost::detail::isomorphism_algo >, boost::adjacency_list >, boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&>, boost::degree_vertex_invariant >, int, const int&, boost::vertex_index_t> >, boost::adjacency_list > >, boost::degree_vertex_invariant >, int, const int&, boost::vertex_index_t> >, boost::adjacency_list > >, boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>, boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t> >::record_dfs_order]’ 37 | ~model() | ^ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:167:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 167 | BOOST_CONCEPT_USAGE(CopyConstructible) { | ^~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements, std::input_iterator_tag> >]’: /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:208:5: required from ‘struct boost::Convertible, std::input_iterator_tag>’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::Convertible, std::input_iterator_tag>]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied, std::input_iterator_tag> >::value’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied, std::input_iterator_tag> >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_, std::input_iterator_tag>)>’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:515:9: [ skipping 4 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/graph_concepts.hpp:89:9: required from ‘boost::concepts::IncidenceGraph::~IncidenceGraph() [with G = R_adjacency_list]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/graph_concepts.hpp:75:1: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::IncidenceGraphConcept >]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/depth_first_search.hpp:129:9: required from ‘void boost::detail::depth_first_visit_impl(const IncidenceGraph&, typename boost::graph_traits::vertex_descriptor, DFSVisitor&, ColorMap, TerminatorFunc) [with IncidenceGraph = R_adjacency_list; DFSVisitor = boost::dfs_visitor<>; ColorMap = boost::vec_adj_list_vertex_property_map, boost::property, boost::no_property, boost::listS>, boost::adjacency_list, boost::property, boost::no_property, boost::listS>*, boost::default_color_type, boost::default_color_type&, boost::vertex_color_t>; TerminatorFunc = nontruth2; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/depth_first_search.hpp:417:35: required from ‘void boost::depth_first_visit(const IncidenceGraph&, typename graph_traits::vertex_descriptor, DFSVisitor, ColorMap) [with IncidenceGraph = R_adjacency_list; DFSVisitor = dfs_visitor<>; ColorMap = vec_adj_list_vertex_property_map, property, no_property, listS>, adjacency_list, property, no_property, listS>*, default_color_type, default_color_type&, vertex_color_t>; typename graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/cuthill_mckee_ordering.hpp:146:30: required from ‘OutputIterator boost::cuthill_mckee_ordering(const Graph&, OutputIterator, ColorMap, DegreeMap) [with Graph = R_adjacency_list; OutputIterator = std::reverse_iterator<__gnu_cxx::__normal_iterator > >; ColorMap = vec_adj_list_vertex_property_map, property, no_property, listS>, adjacency_list, property, no_property, listS>*, default_color_type, default_color_type&, vertex_color_t>; DegreeMap = degree_property_map >]’ ordering.cpp:98:25: required from here /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::Convertible, std::input_iterator_tag>]’ 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ^ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::Convertible, std::input_iterator_tag>]’: /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:515:9: required from ‘boost::InputIterator::~InputIterator() [with TT = boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >, boost::property >*, std::vector > >, boost::property >, std::allocator > >, boost::property > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::InputIterator > >, boost::property >*, std::vector > >, boost::property >, std::allocator > >, boost::property > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> >]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/graph_concepts.hpp:53:35: required from ‘boost::concepts::MultiPassInputIterator::~MultiPassInputIterator() [with T = boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >, boost::property >*, std::vector > >, boost::property >, std::allocator > >, boost::property > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::MultiPassInputIterator > >, boost::property >*, std::vector > >, boost::property >, std::allocator > >, boost::property > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> >]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/graph_concepts.hpp:89:9: required from ‘boost::concepts::IncidenceGraph::~IncidenceGraph() [with G = R_adjacency_list]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/graph_concepts.hpp:75:1: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::IncidenceGraphConcept >]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/depth_first_search.hpp:129:9: required from ‘void boost::detail::depth_first_visit_impl(const IncidenceGraph&, typename boost::graph_traits::vertex_descriptor, DFSVisitor&, ColorMap, TerminatorFunc) [with IncidenceGraph = R_adjacency_list; DFSVisitor = boost::dfs_visitor<>; ColorMap = boost::vec_adj_list_vertex_property_map, boost::property, boost::no_property, boost::listS>, boost::adjacency_list, boost::property, boost::no_property, boost::listS>*, boost::default_color_type, boost::default_color_type&, boost::vertex_color_t>; TerminatorFunc = nontruth2; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/depth_first_search.hpp:417:35: required from ‘void boost::depth_first_visit(const IncidenceGraph&, typename graph_traits::vertex_descriptor, DFSVisitor, ColorMap) [with IncidenceGraph = R_adjacency_list; DFSVisitor = dfs_visitor<>; ColorMap = vec_adj_list_vertex_property_map, property, no_property, listS>, adjacency_list, property, no_property, listS>*, default_color_type, default_color_type&, vertex_color_t>; typename graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/cuthill_mckee_ordering.hpp:146:30: required from ‘OutputIterator boost::cuthill_mckee_ordering(const Graph&, OutputIterator, ColorMap, DegreeMap) [with Graph = R_adjacency_list; OutputIterator = std::reverse_iterator<__gnu_cxx::__normal_iterator > >; ColorMap = vec_adj_list_vertex_property_map, property, no_property, listS>, adjacency_list, property, no_property, listS>*, default_color_type, default_color_type&, vertex_color_t>; DegreeMap = degree_property_map >]’ ordering.cpp:98:25: required from here /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::Convertible::~Convertible() [with X = boost::iterators::detail::iterator_category_with_traversal; Y = std::input_iterator_tag]’ 37 | ~model() | ^ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:208:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 208 | BOOST_CONCEPT_USAGE(Convertible) { | ^~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::concepts::Graph > > > >]’: /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements > > > > >]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/graph_concepts.hpp:66:5: required from ‘struct boost::concepts::Graph > > > >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/graph_concepts.hpp:75:1: required from ‘struct boost::concepts::IncidenceGraph > > > >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/graph_concepts.hpp:75:1: required from ‘struct boost::concepts::IncidenceGraphConcept > > > >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::concepts::IncidenceGraphConcept > > > >]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:42:5: [ skipping 6 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/breadth_first_search.hpp:262:29: required from ‘void boost::detail::bfs_helper(VertexListGraph&, typename boost::graph_traits::vertex_descriptor, ColorMap, BFSVisitor, const boost::bgl_named_params&, mpl_::false_) [with VertexListGraph = boost::adjacency_list > > >; ColorMap = boost::two_bit_color_map > >, long unsigned int> >; BFSVisitor = boost::bfs_visitor >, boost::vec_adj_list_vertex_id_map > >, long unsigned int>, long unsigned int, long unsigned int&>, boost::on_tree_edge> >; P = boost::bfs_visitor >, boost::vec_adj_list_vertex_id_map > >, long unsigned int>, long unsigned int, long unsigned int&>, boost::on_tree_edge> >; T = boost::graph_visitor_t; R = boost::no_property; typename boost::graph_traits::vertex_descriptor = long unsigned int; mpl_::false_ = mpl_::bool_]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/breadth_first_search.hpp:309:23: required from ‘static void boost::detail::bfs_dispatch::apply(VertexListGraph&, typename boost::graph_traits::vertex_descriptor, const boost::bgl_named_params&, boost::param_not_found) [with VertexListGraph = boost::adjacency_list > > >; P = boost::bfs_visitor >, boost::vec_adj_list_vertex_id_map > >, long unsigned int>, long unsigned int, long unsigned int&>, boost::on_tree_edge> >; T = boost::graph_visitor_t; R = boost::no_property; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/breadth_first_search.hpp:339:37: required from ‘void boost::breadth_first_search(const VertexListGraph&, typename graph_traits::vertex_descriptor, const bgl_named_params&) [with VertexListGraph = adjacency_list > > >; P = bfs_visitor >, vec_adj_list_vertex_id_map > >, long unsigned int>, long unsigned int, long unsigned int&>, on_tree_edge> >; T = graph_visitor_t; R = no_property; typename graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/sloan_ordering.hpp:175:29: required from ‘typename boost::graph_traits::vertex_descriptor boost::sloan_start_end_vertices(Graph&, typename graph_traits::vertex_descriptor&, ColorMap, DegreeMap) [with Graph = adjacency_list > > >; ColorMap = vec_adj_list_vertex_property_map > > >, adjacency_list > > >*, default_color_type, default_color_type&, vertex_color_t>; DegreeMap = degree_property_map > > > >; typename graph_traits::vertex_descriptor = long unsigned int; typename graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/sloan_ordering.hpp:429:33: required from ‘OutputIterator boost::sloan_ordering(Graph&, OutputIterator, Color, Degree, Priority, Weight, Weight) [with Graph = adjacency_list > > >; OutputIterator = __gnu_cxx::__normal_iterator >; Color = vec_adj_list_vertex_property_map > > >, adjacency_list > > >*, default_color_type, default_color_type&, vertex_color_t>; Degree = degree_property_map > > > >; Priority = vec_adj_list_vertex_property_map > > >, adjacency_list > > >*, double, double&, vertex_priority_t>; Weight = int]’ ordering.cpp:245:17: required from here /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::concepts::Graph::~Graph() [with G = boost::adjacency_list > > >]’ 37 | ~model() | ^ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/graph_concepts.hpp:66:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 66 | BOOST_CONCEPT_USAGE(Graph) | ^~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::concepts::IncidenceGraph > > > >]’: /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements > > > > >]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/graph_concepts.hpp:87:5: required from ‘struct boost::concepts::IncidenceGraph > > > >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/graph_concepts.hpp:75:1: required from ‘struct boost::concepts::IncidenceGraphConcept > > > >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::concepts::IncidenceGraphConcept > > > >]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied > > > > >::value’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:45:51: [ skipping 5 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/breadth_first_search.hpp:262:29: required from ‘void boost::detail::bfs_helper(VertexListGraph&, typename boost::graph_traits::vertex_descriptor, ColorMap, BFSVisitor, const boost::bgl_named_params&, mpl_::false_) [with VertexListGraph = boost::adjacency_list > > >; ColorMap = boost::two_bit_color_map > >, long unsigned int> >; BFSVisitor = boost::bfs_visitor >, boost::vec_adj_list_vertex_id_map > >, long unsigned int>, long unsigned int, long unsigned int&>, boost::on_tree_edge> >; P = boost::bfs_visitor >, boost::vec_adj_list_vertex_id_map > >, long unsigned int>, long unsigned int, long unsigned int&>, boost::on_tree_edge> >; T = boost::graph_visitor_t; R = boost::no_property; typename boost::graph_traits::vertex_descriptor = long unsigned int; mpl_::false_ = mpl_::bool_]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/breadth_first_search.hpp:309:23: required from ‘static void boost::detail::bfs_dispatch::apply(VertexListGraph&, typename boost::graph_traits::vertex_descriptor, const boost::bgl_named_params&, boost::param_not_found) [with VertexListGraph = boost::adjacency_list > > >; P = boost::bfs_visitor >, boost::vec_adj_list_vertex_id_map > >, long unsigned int>, long unsigned int, long unsigned int&>, boost::on_tree_edge> >; T = boost::graph_visitor_t; R = boost::no_property; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/breadth_first_search.hpp:339:37: required from ‘void boost::breadth_first_search(const VertexListGraph&, typename graph_traits::vertex_descriptor, const bgl_named_params&) [with VertexListGraph = adjacency_list > > >; P = bfs_visitor >, vec_adj_list_vertex_id_map > >, long unsigned int>, long unsigned int, long unsigned int&>, on_tree_edge> >; T = graph_visitor_t; R = no_property; typename graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/sloan_ordering.hpp:175:29: required from ‘typename boost::graph_traits::vertex_descriptor boost::sloan_start_end_vertices(Graph&, typename graph_traits::vertex_descriptor&, ColorMap, DegreeMap) [with Graph = adjacency_list > > >; ColorMap = vec_adj_list_vertex_property_map > > >, adjacency_list > > >*, default_color_type, default_color_type&, vertex_color_t>; DegreeMap = degree_property_map > > > >; typename graph_traits::vertex_descriptor = long unsigned int; typename graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/sloan_ordering.hpp:429:33: required from ‘OutputIterator boost::sloan_ordering(Graph&, OutputIterator, Color, Degree, Priority, Weight, Weight) [with Graph = adjacency_list > > >; OutputIterator = __gnu_cxx::__normal_iterator >; Color = vec_adj_list_vertex_property_map > > >, adjacency_list > > >*, default_color_type, default_color_type&, vertex_color_t>; Degree = degree_property_map > > > >; Priority = vec_adj_list_vertex_property_map > > >, adjacency_list > > >*, double, double&, vertex_priority_t>; Weight = int]’ ordering.cpp:245:17: required from here /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::concepts::IncidenceGraph::~IncidenceGraph() [with G = boost::adjacency_list > > >]’ 37 | ~model() | ^ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/graph_concepts.hpp:87:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 87 | BOOST_CONCEPT_USAGE(IncidenceGraph) | ^~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements >, boost::vec_adj_list_vertex_id_map > >, long unsigned int>, long unsigned int, long unsigned int&>, boost::on_tree_edge> > > >]’: /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:167:5: required from ‘struct boost::CopyConstructible >, boost::vec_adj_list_vertex_id_map > >, long unsigned int>, long unsigned int, long unsigned int&>, boost::on_tree_edge> > >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:165:3: required from ‘struct boost::CopyConstructibleConcept >, boost::vec_adj_list_vertex_id_map > >, long unsigned int>, long unsigned int, long unsigned int&>, boost::on_tree_edge> > >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::CopyConstructibleConcept >, boost::vec_adj_list_vertex_id_map > >, long unsigned int>, long unsigned int, long unsigned int&>, boost::on_tree_edge> > >]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied >, boost::vec_adj_list_vertex_id_map > >, long unsigned int>, long unsigned int, long unsigned int&>, boost::on_tree_edge> > > >::value’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied >, boost::vec_adj_list_vertex_id_map > >, long unsigned int>, long unsigned int, long unsigned int&>, boost::on_tree_edge> > > >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:72:8: [ skipping 9 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/breadth_first_search.hpp:262:29: required from ‘void boost::detail::bfs_helper(VertexListGraph&, typename boost::graph_traits::vertex_descriptor, ColorMap, BFSVisitor, const boost::bgl_named_params&, mpl_::false_) [with VertexListGraph = boost::adjacency_list > > >; ColorMap = boost::two_bit_color_map > >, long unsigned int> >; BFSVisitor = boost::bfs_visitor >, boost::vec_adj_list_vertex_id_map > >, long unsigned int>, long unsigned int, long unsigned int&>, boost::on_tree_edge> >; P = boost::bfs_visitor >, boost::vec_adj_list_vertex_id_map > >, long unsigned int>, long unsigned int, long unsigned int&>, boost::on_tree_edge> >; T = boost::graph_visitor_t; R = boost::no_property; typename boost::graph_traits::vertex_descriptor = long unsigned int; mpl_::false_ = mpl_::bool_]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/breadth_first_search.hpp:309:23: required from ‘static void boost::detail::bfs_dispatch::apply(VertexListGraph&, typename boost::graph_traits::vertex_descriptor, const boost::bgl_named_params&, boost::param_not_found) [with VertexListGraph = boost::adjacency_list > > >; P = boost::bfs_visitor >, boost::vec_adj_list_vertex_id_map > >, long unsigned int>, long unsigned int, long unsigned int&>, boost::on_tree_edge> >; T = boost::graph_visitor_t; R = boost::no_property; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/breadth_first_search.hpp:339:37: required from ‘void boost::breadth_first_search(const VertexListGraph&, typename graph_traits::vertex_descriptor, const bgl_named_params&) [with VertexListGraph = adjacency_list > > >; P = bfs_visitor >, vec_adj_list_vertex_id_map > >, long unsigned int>, long unsigned int, long unsigned int&>, on_tree_edge> >; T = graph_visitor_t; R = no_property; typename graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/sloan_ordering.hpp:175:29: required from ‘typename boost::graph_traits::vertex_descriptor boost::sloan_start_end_vertices(Graph&, typename graph_traits::vertex_descriptor&, ColorMap, DegreeMap) [with Graph = adjacency_list > > >; ColorMap = vec_adj_list_vertex_property_map > > >, adjacency_list > > >*, default_color_type, default_color_type&, vertex_color_t>; DegreeMap = degree_property_map > > > >; typename graph_traits::vertex_descriptor = long unsigned int; typename graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/sloan_ordering.hpp:429:33: required from ‘OutputIterator boost::sloan_ordering(Graph&, OutputIterator, Color, Degree, Priority, Weight, Weight) [with Graph = adjacency_list > > >; OutputIterator = __gnu_cxx::__normal_iterator >; Color = vec_adj_list_vertex_property_map > > >, adjacency_list > > >*, default_color_type, default_color_type&, vertex_color_t>; Degree = degree_property_map > > > >; Priority = vec_adj_list_vertex_property_map > > >, adjacency_list > > >*, double, double&, vertex_priority_t>; Weight = int]’ ordering.cpp:245:17: required from here /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::CopyConstructible >, boost::vec_adj_list_vertex_id_map > >, long unsigned int>, long unsigned int, long unsigned int&>, boost::on_tree_edge> > >]’ 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ^ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::CopyConstructibleConcept >, boost::vec_adj_list_vertex_id_map > >, long unsigned int>, long unsigned int, long unsigned int&>, boost::on_tree_edge> > >]’: /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/depth_first_search.hpp:41:9: required from ‘void boost::BFSVisitorConcept::constraints() [with Visitor = boost::bfs_visitor >, boost::vec_adj_list_vertex_id_map > >, long unsigned int>, long unsigned int, long unsigned int&>, boost::on_tree_edge> >; Graph = boost::adjacency_list > > >]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::BFSVisitorConcept >, boost::vec_adj_list_vertex_id_map > >, long unsigned int>, long unsigned int, long unsigned int&>, boost::on_tree_edge> >, boost::adjacency_list > > > >]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied >, boost::vec_adj_list_vertex_id_map > >, long unsigned int>, long unsigned int, long unsigned int&>, boost::on_tree_edge> >, boost::adjacency_list > > > > >::value’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied >, boost::vec_adj_list_vertex_id_map > >, long unsigned int>, long unsigned int, long unsigned int&>, boost::on_tree_edge> >, boost::adjacency_list > > > > >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_ >, boost::vec_adj_list_vertex_id_map > >, long unsigned int>, long unsigned int, long unsigned int&>, boost::on_tree_edge> >, boost::adjacency_list > > > >)>’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/breadth_first_search.hpp:65:5: [ skipping 3 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/breadth_first_search.hpp:262:29: required from ‘void boost::detail::bfs_helper(VertexListGraph&, typename boost::graph_traits::vertex_descriptor, ColorMap, BFSVisitor, const boost::bgl_named_params&, mpl_::false_) [with VertexListGraph = boost::adjacency_list > > >; ColorMap = boost::two_bit_color_map > >, long unsigned int> >; BFSVisitor = boost::bfs_visitor >, boost::vec_adj_list_vertex_id_map > >, long unsigned int>, long unsigned int, long unsigned int&>, boost::on_tree_edge> >; P = boost::bfs_visitor >, boost::vec_adj_list_vertex_id_map > >, long unsigned int>, long unsigned int, long unsigned int&>, boost::on_tree_edge> >; T = boost::graph_visitor_t; R = boost::no_property; typename boost::graph_traits::vertex_descriptor = long unsigned int; mpl_::false_ = mpl_::bool_]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/breadth_first_search.hpp:309:23: required from ‘static void boost::detail::bfs_dispatch::apply(VertexListGraph&, typename boost::graph_traits::vertex_descriptor, const boost::bgl_named_params&, boost::param_not_found) [with VertexListGraph = boost::adjacency_list > > >; P = boost::bfs_visitor >, boost::vec_adj_list_vertex_id_map > >, long unsigned int>, long unsigned int, long unsigned int&>, boost::on_tree_edge> >; T = boost::graph_visitor_t; R = boost::no_property; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/breadth_first_search.hpp:339:37: required from ‘void boost::breadth_first_search(const VertexListGraph&, typename graph_traits::vertex_descriptor, const bgl_named_params&) [with VertexListGraph = adjacency_list > > >; P = bfs_visitor >, vec_adj_list_vertex_id_map > >, long unsigned int>, long unsigned int, long unsigned int&>, on_tree_edge> >; T = graph_visitor_t; R = no_property; typename graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/sloan_ordering.hpp:175:29: required from ‘typename boost::graph_traits::vertex_descriptor boost::sloan_start_end_vertices(Graph&, typename graph_traits::vertex_descriptor&, ColorMap, DegreeMap) [with Graph = adjacency_list > > >; ColorMap = vec_adj_list_vertex_property_map > > >, adjacency_list > > >*, default_color_type, default_color_type&, vertex_color_t>; DegreeMap = degree_property_map > > > >; typename graph_traits::vertex_descriptor = long unsigned int; typename graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/sloan_ordering.hpp:429:33: required from ‘OutputIterator boost::sloan_ordering(Graph&, OutputIterator, Color, Degree, Priority, Weight, Weight) [with Graph = adjacency_list > > >; OutputIterator = __gnu_cxx::__normal_iterator >; Color = vec_adj_list_vertex_property_map > > >, adjacency_list > > >*, default_color_type, default_color_type&, vertex_color_t>; Degree = degree_property_map > > > >; Priority = vec_adj_list_vertex_property_map > > >, adjacency_list > > >*, double, double&, vertex_priority_t>; Weight = int]’ ordering.cpp:245:17: required from here /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:165:17: note: in a call to non-static member function ‘boost::CopyConstructibleConcept >, boost::vec_adj_list_vertex_id_map > >, long unsigned int>, long unsigned int, long unsigned int&>, boost::on_tree_edge> > >::~CopyConstructibleConcept()’ 165 | BOOST_concept(CopyConstructible,(TT)) | ^~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/preprocessor/cat.hpp:29:34: note: in definition of macro ‘BOOST_PP_CAT_I’ 29 | # define BOOST_PP_CAT_I(a, b) a ## b | ^ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/concept_def.hpp:23:12: note: in expansion of macro ‘BOOST_PP_CAT’ 23 | struct BOOST_PP_CAT(name,Concept) \ | ^~~~~~~~~~~~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:165:3: note: in expansion of macro ‘BOOST_concept’ 165 | BOOST_concept(CopyConstructible,(TT)) | ^~~~~~~~~~~~~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::constraint::failed() [with Model = boost::ReadablePropertyMapConcept > >, long unsigned int> >, long unsigned int>]’: /home/omnipath/local/R/4.4-3.20/BH/include/boost/property_map/property_map.hpp:206:7: required from ‘void boost::ReadWritePropertyMapConcept::constraints() [with PMap = boost::two_bit_color_map > >, long unsigned int> >; Key = long unsigned int]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::ReadWritePropertyMapConcept > >, long unsigned int> >, long unsigned int>]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied > >, long unsigned int> >, long unsigned int> >::value’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied > >, long unsigned int> >, long unsigned int> >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_ > >, long unsigned int> >, long unsigned int>)>’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/breadth_first_search.hpp:66:5: [ skipping 3 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/breadth_first_search.hpp:262:29: required from ‘void boost::detail::bfs_helper(VertexListGraph&, typename boost::graph_traits::vertex_descriptor, ColorMap, BFSVisitor, const boost::bgl_named_params&, mpl_::false_) [with VertexListGraph = boost::adjacency_list > > >; ColorMap = boost::two_bit_color_map > >, long unsigned int> >; BFSVisitor = boost::bfs_visitor >, boost::vec_adj_list_vertex_id_map > >, long unsigned int>, long unsigned int, long unsigned int&>, boost::on_tree_edge> >; P = boost::bfs_visitor >, boost::vec_adj_list_vertex_id_map > >, long unsigned int>, long unsigned int, long unsigned int&>, boost::on_tree_edge> >; T = boost::graph_visitor_t; R = boost::no_property; typename boost::graph_traits::vertex_descriptor = long unsigned int; mpl_::false_ = mpl_::bool_]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/breadth_first_search.hpp:309:23: required from ‘static void boost::detail::bfs_dispatch::apply(VertexListGraph&, typename boost::graph_traits::vertex_descriptor, const boost::bgl_named_params&, boost::param_not_found) [with VertexListGraph = boost::adjacency_list > > >; P = boost::bfs_visitor >, boost::vec_adj_list_vertex_id_map > >, long unsigned int>, long unsigned int, long unsigned int&>, boost::on_tree_edge> >; T = boost::graph_visitor_t; R = boost::no_property; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/breadth_first_search.hpp:339:37: required from ‘void boost::breadth_first_search(const VertexListGraph&, typename graph_traits::vertex_descriptor, const bgl_named_params&) [with VertexListGraph = adjacency_list > > >; P = bfs_visitor >, vec_adj_list_vertex_id_map > >, long unsigned int>, long unsigned int, long unsigned int&>, on_tree_edge> >; T = graph_visitor_t; R = no_property; typename graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/sloan_ordering.hpp:175:29: required from ‘typename boost::graph_traits::vertex_descriptor boost::sloan_start_end_vertices(Graph&, typename graph_traits::vertex_descriptor&, ColorMap, DegreeMap) [with Graph = adjacency_list > > >; ColorMap = vec_adj_list_vertex_property_map > > >, adjacency_list > > >*, default_color_type, default_color_type&, vertex_color_t>; DegreeMap = degree_property_map > > > >; typename graph_traits::vertex_descriptor = long unsigned int; typename graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/sloan_ordering.hpp:429:33: required from ‘OutputIterator boost::sloan_ordering(Graph&, OutputIterator, Color, Degree, Priority, Weight, Weight) [with Graph = adjacency_list > > >; OutputIterator = __gnu_cxx::__normal_iterator >; Color = vec_adj_list_vertex_property_map > > >, adjacency_list > > >*, default_color_type, default_color_type&, vertex_color_t>; Degree = degree_property_map > > > >; Priority = vec_adj_list_vertex_property_map > > >, adjacency_list > > >*, double, double&, vertex_priority_t>; Weight = int]’ ordering.cpp:245:17: required from here /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:65:52: warning: ‘this’ pointer is null [-Wnonnull] 65 | static void failed() { ((Model*)0)->constraints(); } | ~~~~~~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/property_map/property_map.hpp:147:10: note: in a call to non-static member function ‘void boost::ReadablePropertyMapConcept::constraints() [with PMap = boost::two_bit_color_map > >, long unsigned int> >; Key = long unsigned int]’ 147 | void constraints() { | ^~~~~~~~~~~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::constraint::failed() [with Model = boost::WritablePropertyMapConcept > >, long unsigned int> >, long unsigned int>]’: /home/omnipath/local/R/4.4-3.20/BH/include/boost/property_map/property_map.hpp:207:7: required from ‘void boost::ReadWritePropertyMapConcept::constraints() [with PMap = boost::two_bit_color_map > >, long unsigned int> >; Key = long unsigned int]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::ReadWritePropertyMapConcept > >, long unsigned int> >, long unsigned int>]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied > >, long unsigned int> >, long unsigned int> >::value’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied > >, long unsigned int> >, long unsigned int> >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_ > >, long unsigned int> >, long unsigned int>)>’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/breadth_first_search.hpp:66:5: [ skipping 3 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/breadth_first_search.hpp:262:29: required from ‘void boost::detail::bfs_helper(VertexListGraph&, typename boost::graph_traits::vertex_descriptor, ColorMap, BFSVisitor, const boost::bgl_named_params&, mpl_::false_) [with VertexListGraph = boost::adjacency_list > > >; ColorMap = boost::two_bit_color_map > >, long unsigned int> >; BFSVisitor = boost::bfs_visitor >, boost::vec_adj_list_vertex_id_map > >, long unsigned int>, long unsigned int, long unsigned int&>, boost::on_tree_edge> >; P = boost::bfs_visitor >, boost::vec_adj_list_vertex_id_map > >, long unsigned int>, long unsigned int, long unsigned int&>, boost::on_tree_edge> >; T = boost::graph_visitor_t; R = boost::no_property; typename boost::graph_traits::vertex_descriptor = long unsigned int; mpl_::false_ = mpl_::bool_]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/breadth_first_search.hpp:309:23: required from ‘static void boost::detail::bfs_dispatch::apply(VertexListGraph&, typename boost::graph_traits::vertex_descriptor, const boost::bgl_named_params&, boost::param_not_found) [with VertexListGraph = boost::adjacency_list > > >; P = boost::bfs_visitor >, boost::vec_adj_list_vertex_id_map > >, long unsigned int>, long unsigned int, long unsigned int&>, boost::on_tree_edge> >; T = boost::graph_visitor_t; R = boost::no_property; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/breadth_first_search.hpp:339:37: required from ‘void boost::breadth_first_search(const VertexListGraph&, typename graph_traits::vertex_descriptor, const bgl_named_params&) [with VertexListGraph = adjacency_list > > >; P = bfs_visitor >, vec_adj_list_vertex_id_map > >, long unsigned int>, long unsigned int, long unsigned int&>, on_tree_edge> >; T = graph_visitor_t; R = no_property; typename graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/sloan_ordering.hpp:175:29: required from ‘typename boost::graph_traits::vertex_descriptor boost::sloan_start_end_vertices(Graph&, typename graph_traits::vertex_descriptor&, ColorMap, DegreeMap) [with Graph = adjacency_list > > >; ColorMap = vec_adj_list_vertex_property_map > > >, adjacency_list > > >*, default_color_type, default_color_type&, vertex_color_t>; DegreeMap = degree_property_map > > > >; typename graph_traits::vertex_descriptor = long unsigned int; typename graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/sloan_ordering.hpp:429:33: required from ‘OutputIterator boost::sloan_ordering(Graph&, OutputIterator, Color, Degree, Priority, Weight, Weight) [with Graph = adjacency_list > > >; OutputIterator = __gnu_cxx::__normal_iterator >; Color = vec_adj_list_vertex_property_map > > >, adjacency_list > > >*, default_color_type, default_color_type&, vertex_color_t>; Degree = degree_property_map > > > >; Priority = vec_adj_list_vertex_property_map > > >, adjacency_list > > >*, double, double&, vertex_priority_t>; Weight = int]’ ordering.cpp:245:17: required from here /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:65:52: warning: ‘this’ pointer is null [-Wnonnull] 65 | static void failed() { ((Model*)0)->constraints(); } | ~~~~~~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/property_map/property_map.hpp:179:10: note: in a call to non-static member function ‘void boost::WritablePropertyMapConcept::constraints() [with PMap = boost::two_bit_color_map > >, long unsigned int> >; Key = long unsigned int]’ 179 | void constraints() { | ^~~~~~~~~~~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements >]’: /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:208:5: required from ‘struct boost::Convertible’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:206:3: required from ‘struct boost::ConvertibleConcept’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::ConvertibleConcept]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied >::value’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:72:8: [ skipping 9 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/breadth_first_search.hpp:262:29: required from ‘void boost::detail::bfs_helper(VertexListGraph&, typename boost::graph_traits::vertex_descriptor, ColorMap, BFSVisitor, const boost::bgl_named_params&, mpl_::false_) [with VertexListGraph = boost::adjacency_list > > >; ColorMap = boost::two_bit_color_map > >, long unsigned int> >; BFSVisitor = boost::bfs_visitor >, boost::vec_adj_list_vertex_id_map > >, long unsigned int>, long unsigned int, long unsigned int&>, boost::on_tree_edge> >; P = boost::bfs_visitor >, boost::vec_adj_list_vertex_id_map > >, long unsigned int>, long unsigned int, long unsigned int&>, boost::on_tree_edge> >; T = boost::graph_visitor_t; R = boost::no_property; typename boost::graph_traits::vertex_descriptor = long unsigned int; mpl_::false_ = mpl_::bool_]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/breadth_first_search.hpp:309:23: required from ‘static void boost::detail::bfs_dispatch::apply(VertexListGraph&, typename boost::graph_traits::vertex_descriptor, const boost::bgl_named_params&, boost::param_not_found) [with VertexListGraph = boost::adjacency_list > > >; P = boost::bfs_visitor >, boost::vec_adj_list_vertex_id_map > >, long unsigned int>, long unsigned int, long unsigned int&>, boost::on_tree_edge> >; T = boost::graph_visitor_t; R = boost::no_property; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/breadth_first_search.hpp:339:37: required from ‘void boost::breadth_first_search(const VertexListGraph&, typename graph_traits::vertex_descriptor, const bgl_named_params&) [with VertexListGraph = adjacency_list > > >; P = bfs_visitor >, vec_adj_list_vertex_id_map > >, long unsigned int>, long unsigned int, long unsigned int&>, on_tree_edge> >; T = graph_visitor_t; R = no_property; typename graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/sloan_ordering.hpp:175:29: required from ‘typename boost::graph_traits::vertex_descriptor boost::sloan_start_end_vertices(Graph&, typename graph_traits::vertex_descriptor&, ColorMap, DegreeMap) [with Graph = adjacency_list > > >; ColorMap = vec_adj_list_vertex_property_map > > >, adjacency_list > > >*, default_color_type, default_color_type&, vertex_color_t>; DegreeMap = degree_property_map > > > >; typename graph_traits::vertex_descriptor = long unsigned int; typename graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/sloan_ordering.hpp:429:33: required from ‘OutputIterator boost::sloan_ordering(Graph&, OutputIterator, Color, Degree, Priority, Weight, Weight) [with Graph = adjacency_list > > >; OutputIterator = __gnu_cxx::__normal_iterator >; Color = vec_adj_list_vertex_property_map > > >, adjacency_list > > >*, default_color_type, default_color_type&, vertex_color_t>; Degree = degree_property_map > > > >; Priority = vec_adj_list_vertex_property_map > > >, adjacency_list > > >*, double, double&, vertex_priority_t>; Weight = int]’ ordering.cpp:245:17: required from here /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::Convertible]’ 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ^ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::ConvertibleConcept]’: /home/omnipath/local/R/4.4-3.20/BH/include/boost/property_map/property_map.hpp:208:7: required from ‘void boost::ReadWritePropertyMapConcept::constraints() [with PMap = boost::two_bit_color_map > >, long unsigned int> >; Key = long unsigned int]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::ReadWritePropertyMapConcept > >, long unsigned int> >, long unsigned int>]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied > >, long unsigned int> >, long unsigned int> >::value’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied > >, long unsigned int> >, long unsigned int> >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_ > >, long unsigned int> >, long unsigned int>)>’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/breadth_first_search.hpp:66:5: [ skipping 3 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/breadth_first_search.hpp:262:29: required from ‘void boost::detail::bfs_helper(VertexListGraph&, typename boost::graph_traits::vertex_descriptor, ColorMap, BFSVisitor, const boost::bgl_named_params&, mpl_::false_) [with VertexListGraph = boost::adjacency_list > > >; ColorMap = boost::two_bit_color_map > >, long unsigned int> >; BFSVisitor = boost::bfs_visitor >, boost::vec_adj_list_vertex_id_map > >, long unsigned int>, long unsigned int, long unsigned int&>, boost::on_tree_edge> >; P = boost::bfs_visitor >, boost::vec_adj_list_vertex_id_map > >, long unsigned int>, long unsigned int, long unsigned int&>, boost::on_tree_edge> >; T = boost::graph_visitor_t; R = boost::no_property; typename boost::graph_traits::vertex_descriptor = long unsigned int; mpl_::false_ = mpl_::bool_]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/breadth_first_search.hpp:309:23: required from ‘static void boost::detail::bfs_dispatch::apply(VertexListGraph&, typename boost::graph_traits::vertex_descriptor, const boost::bgl_named_params&, boost::param_not_found) [with VertexListGraph = boost::adjacency_list > > >; P = boost::bfs_visitor >, boost::vec_adj_list_vertex_id_map > >, long unsigned int>, long unsigned int, long unsigned int&>, boost::on_tree_edge> >; T = boost::graph_visitor_t; R = boost::no_property; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/breadth_first_search.hpp:339:37: required from ‘void boost::breadth_first_search(const VertexListGraph&, typename graph_traits::vertex_descriptor, const bgl_named_params&) [with VertexListGraph = adjacency_list > > >; P = bfs_visitor >, vec_adj_list_vertex_id_map > >, long unsigned int>, long unsigned int, long unsigned int&>, on_tree_edge> >; T = graph_visitor_t; R = no_property; typename graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/sloan_ordering.hpp:175:29: required from ‘typename boost::graph_traits::vertex_descriptor boost::sloan_start_end_vertices(Graph&, typename graph_traits::vertex_descriptor&, ColorMap, DegreeMap) [with Graph = adjacency_list > > >; ColorMap = vec_adj_list_vertex_property_map > > >, adjacency_list > > >*, default_color_type, default_color_type&, vertex_color_t>; DegreeMap = degree_property_map > > > >; typename graph_traits::vertex_descriptor = long unsigned int; typename graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/sloan_ordering.hpp:429:33: required from ‘OutputIterator boost::sloan_ordering(Graph&, OutputIterator, Color, Degree, Priority, Weight, Weight) [with Graph = adjacency_list > > >; OutputIterator = __gnu_cxx::__normal_iterator >; Color = vec_adj_list_vertex_property_map > > >, adjacency_list > > >*, default_color_type, default_color_type&, vertex_color_t>; Degree = degree_property_map > > > >; Priority = vec_adj_list_vertex_property_map > > >, adjacency_list > > >*, double, double&, vertex_priority_t>; Weight = int]’ ordering.cpp:245:17: required from here /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:206:17: note: in a call to non-static member function ‘boost::ConvertibleConcept::~ConvertibleConcept()’ 206 | BOOST_concept(Convertible,(X)(Y)) | ^~~~~~~~~~~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/preprocessor/cat.hpp:29:34: note: in definition of macro ‘BOOST_PP_CAT_I’ 29 | # define BOOST_PP_CAT_I(a, b) a ## b | ^ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/concept_def.hpp:23:12: note: in expansion of macro ‘BOOST_PP_CAT’ 23 | struct BOOST_PP_CAT(name,Concept) \ | ^~~~~~~~~~~~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:206:3: note: in expansion of macro ‘BOOST_concept’ 206 | BOOST_concept(Convertible,(X)(Y)) | ^~~~~~~~~~~~~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements >]’: /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:208:5: required from ‘struct boost::Convertible’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::Convertible]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied >::value’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_)>’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:515:9: [ skipping 5 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/graph_concepts.hpp:176:1: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::VertexListGraphConcept > >]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/isomorphism.hpp:494:5: required from ‘bool boost::isomorphism(const Graph1&, const Graph2&, IsoMapping, Invariant1, Invariant2, std::size_t, IndexMap1, IndexMap2) [with Graph1 = adjacency_list >; Graph2 = adjacency_list >; IsoMapping = iterator_property_map<__gnu_cxx::__normal_iterator >, adj_list_vertex_property_map >, int, int&, vertex_index_t>, void*, void*&>; Invariant1 = degree_vertex_invariant >, int, const int&, vertex_index_t> >, adjacency_list > >; Invariant2 = degree_vertex_invariant >, int, const int&, vertex_index_t> >, adjacency_list > >; IndexMap1 = adj_list_vertex_property_map >, int, const int&, vertex_index_t>; IndexMap2 = adj_list_vertex_property_map >, int, const int&, vertex_index_t>; std::size_t = long unsigned int]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/isomorphism.hpp:651:42: required from ‘bool boost::graph::detail::isomorphism_impl::operator()(const Graph1&, const Graph2&, const ArgPack&) const [with ArgPack = boost::parameter::aux::arg_list >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&> >, boost::parameter::aux::empty_arg_list, std::integral_constant >; Graph1 = boost::adjacency_list >; Graph2 = boost::adjacency_list >]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/isomorphism.hpp:662:5: required from ‘typename boost::result_of(Param0, Param1, const ArgPack&)>::type boost::graph::isomorphism_with_named_params(const Param0&, const Param1&, const ArgPack&) [with Param0 = boost::adjacency_list >; Param1 = boost::adjacency_list >; ArgPack = boost::parameter::aux::arg_list >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&> >, boost::parameter::aux::empty_arg_list, std::integral_constant >; typename boost::result_of(Param0, Param1, const ArgPack&)>::type = bool]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/isomorphism.hpp:666:1: required from ‘typename boost::result_of(Param0, Param1, const typename boost::detail::convert_bgl_params_to_boost_parameter >::type&)>::type boost::isomorphism(const Param0&, const Param1&, const bgl_named_params&) [with Param0 = adjacency_list >; Param1 = adjacency_list >; P = iterator_property_map<__gnu_cxx::__normal_iterator >, adj_list_vertex_property_map >, int, int&, vertex_index_t>, void*, void*&>; T = vertex_isomorphism_t; R = no_property; typename result_of(Param0, Param1, const typename detail::convert_bgl_params_to_boost_parameter >::type&)>::type = bool; typename detail::convert_bgl_params_to_boost_parameter >::type = parameter::aux::arg_list >, adj_list_vertex_property_map >, int, int&, vertex_index_t>, void*, void*&> >, parameter::aux::empty_arg_list, std::integral_constant >]’ ordering.cpp:68:18: required from here /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::Convertible]’ 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ^ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::Convertible]’: /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:515:9: required from ‘boost::InputIterator::~InputIterator() [with TT = std::_List_iterator]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::InputIterator >]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/graph_concepts.hpp:53:35: required from ‘boost::concepts::MultiPassInputIterator::~MultiPassInputIterator() [with T = std::_List_iterator]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::MultiPassInputIterator >]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/graph_concepts.hpp:184:9: required from ‘boost::concepts::VertexListGraph::~VertexListGraph() [with G = boost::adjacency_list >]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/graph_concepts.hpp:176:1: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::VertexListGraphConcept > >]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/isomorphism.hpp:494:5: required from ‘bool boost::isomorphism(const Graph1&, const Graph2&, IsoMapping, Invariant1, Invariant2, std::size_t, IndexMap1, IndexMap2) [with Graph1 = adjacency_list >; Graph2 = adjacency_list >; IsoMapping = iterator_property_map<__gnu_cxx::__normal_iterator >, adj_list_vertex_property_map >, int, int&, vertex_index_t>, void*, void*&>; Invariant1 = degree_vertex_invariant >, int, const int&, vertex_index_t> >, adjacency_list > >; Invariant2 = degree_vertex_invariant >, int, const int&, vertex_index_t> >, adjacency_list > >; IndexMap1 = adj_list_vertex_property_map >, int, const int&, vertex_index_t>; IndexMap2 = adj_list_vertex_property_map >, int, const int&, vertex_index_t>; std::size_t = long unsigned int]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/isomorphism.hpp:651:42: required from ‘bool boost::graph::detail::isomorphism_impl::operator()(const Graph1&, const Graph2&, const ArgPack&) const [with ArgPack = boost::parameter::aux::arg_list >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&> >, boost::parameter::aux::empty_arg_list, std::integral_constant >; Graph1 = boost::adjacency_list >; Graph2 = boost::adjacency_list >]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/isomorphism.hpp:662:5: required from ‘typename boost::result_of(Param0, Param1, const ArgPack&)>::type boost::graph::isomorphism_with_named_params(const Param0&, const Param1&, const ArgPack&) [with Param0 = boost::adjacency_list >; Param1 = boost::adjacency_list >; ArgPack = boost::parameter::aux::arg_list >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&> >, boost::parameter::aux::empty_arg_list, std::integral_constant >; typename boost::result_of(Param0, Param1, const ArgPack&)>::type = bool]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/isomorphism.hpp:666:1: required from ‘typename boost::result_of(Param0, Param1, const typename boost::detail::convert_bgl_params_to_boost_parameter >::type&)>::type boost::isomorphism(const Param0&, const Param1&, const bgl_named_params&) [with Param0 = adjacency_list >; Param1 = adjacency_list >; P = iterator_property_map<__gnu_cxx::__normal_iterator >, adj_list_vertex_property_map >, int, int&, vertex_index_t>, void*, void*&>; T = vertex_isomorphism_t; R = no_property; typename result_of(Param0, Param1, const typename detail::convert_bgl_params_to_boost_parameter >::type&)>::type = bool; typename detail::convert_bgl_params_to_boost_parameter >::type = parameter::aux::arg_list >, adj_list_vertex_property_map >, int, int&, vertex_index_t>, void*, void*&> >, parameter::aux::empty_arg_list, std::integral_constant >]’ ordering.cpp:68:18: required from here /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::Convertible::~Convertible() [with X = std::bidirectional_iterator_tag; Y = std::input_iterator_tag]’ 37 | ~model() | ^ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:208:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 208 | BOOST_CONCEPT_USAGE(Convertible) { | ^~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements, std::input_iterator_tag> >]’: /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:208:5: required from ‘struct boost::Convertible, std::input_iterator_tag>’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::Convertible, std::input_iterator_tag>]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied, std::input_iterator_tag> >::value’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied, std::input_iterator_tag> >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_, std::input_iterator_tag>)>’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:515:9: [ skipping 5 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/graph_concepts.hpp:226:1: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::EdgeListGraphConcept > >]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/isomorphism.hpp:495:5: required from ‘bool boost::isomorphism(const Graph1&, const Graph2&, IsoMapping, Invariant1, Invariant2, std::size_t, IndexMap1, IndexMap2) [with Graph1 = adjacency_list >; Graph2 = adjacency_list >; IsoMapping = iterator_property_map<__gnu_cxx::__normal_iterator >, adj_list_vertex_property_map >, int, int&, vertex_index_t>, void*, void*&>; Invariant1 = degree_vertex_invariant >, int, const int&, vertex_index_t> >, adjacency_list > >; Invariant2 = degree_vertex_invariant >, int, const int&, vertex_index_t> >, adjacency_list > >; IndexMap1 = adj_list_vertex_property_map >, int, const int&, vertex_index_t>; IndexMap2 = adj_list_vertex_property_map >, int, const int&, vertex_index_t>; std::size_t = long unsigned int]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/isomorphism.hpp:651:42: required from ‘bool boost::graph::detail::isomorphism_impl::operator()(const Graph1&, const Graph2&, const ArgPack&) const [with ArgPack = boost::parameter::aux::arg_list >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&> >, boost::parameter::aux::empty_arg_list, std::integral_constant >; Graph1 = boost::adjacency_list >; Graph2 = boost::adjacency_list >]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/isomorphism.hpp:662:5: required from ‘typename boost::result_of(Param0, Param1, const ArgPack&)>::type boost::graph::isomorphism_with_named_params(const Param0&, const Param1&, const ArgPack&) [with Param0 = boost::adjacency_list >; Param1 = boost::adjacency_list >; ArgPack = boost::parameter::aux::arg_list >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&> >, boost::parameter::aux::empty_arg_list, std::integral_constant >; typename boost::result_of(Param0, Param1, const ArgPack&)>::type = bool]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/isomorphism.hpp:666:1: required from ‘typename boost::result_of(Param0, Param1, const typename boost::detail::convert_bgl_params_to_boost_parameter >::type&)>::type boost::isomorphism(const Param0&, const Param1&, const bgl_named_params&) [with Param0 = adjacency_list >; Param1 = adjacency_list >; P = iterator_property_map<__gnu_cxx::__normal_iterator >, adj_list_vertex_property_map >, int, int&, vertex_index_t>, void*, void*&>; T = vertex_isomorphism_t; R = no_property; typename result_of(Param0, Param1, const typename detail::convert_bgl_params_to_boost_parameter >::type&)>::type = bool; typename detail::convert_bgl_params_to_boost_parameter >::type = parameter::aux::arg_list >, adj_list_vertex_property_map >, int, int&, vertex_index_t>, void*, void*&> >, parameter::aux::empty_arg_list, std::integral_constant >]’ ordering.cpp:68:18: required from here /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::Convertible, std::input_iterator_tag>]’ 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ^ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::Convertible, std::input_iterator_tag>]’: /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:515:9: required from ‘boost::InputIterator::~InputIterator() [with TT = boost::detail::undirected_edge_iter >, boost::detail::edge_desc_impl, long int>]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::InputIterator >, boost::detail::edge_desc_impl, long int> >]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/graph_concepts.hpp:53:35: required from ‘boost::concepts::MultiPassInputIterator::~MultiPassInputIterator() [with T = boost::detail::undirected_edge_iter >, boost::detail::edge_desc_impl, long int>]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::MultiPassInputIterator >, boost::detail::edge_desc_impl, long int> >]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/graph_concepts.hpp:235:9: required from ‘boost::concepts::EdgeListGraph::~EdgeListGraph() [with G = boost::adjacency_list >]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/graph_concepts.hpp:226:1: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::EdgeListGraphConcept > >]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/isomorphism.hpp:495:5: required from ‘bool boost::isomorphism(const Graph1&, const Graph2&, IsoMapping, Invariant1, Invariant2, std::size_t, IndexMap1, IndexMap2) [with Graph1 = adjacency_list >; Graph2 = adjacency_list >; IsoMapping = iterator_property_map<__gnu_cxx::__normal_iterator >, adj_list_vertex_property_map >, int, int&, vertex_index_t>, void*, void*&>; Invariant1 = degree_vertex_invariant >, int, const int&, vertex_index_t> >, adjacency_list > >; Invariant2 = degree_vertex_invariant >, int, const int&, vertex_index_t> >, adjacency_list > >; IndexMap1 = adj_list_vertex_property_map >, int, const int&, vertex_index_t>; IndexMap2 = adj_list_vertex_property_map >, int, const int&, vertex_index_t>; std::size_t = long unsigned int]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/isomorphism.hpp:651:42: required from ‘bool boost::graph::detail::isomorphism_impl::operator()(const Graph1&, const Graph2&, const ArgPack&) const [with ArgPack = boost::parameter::aux::arg_list >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&> >, boost::parameter::aux::empty_arg_list, std::integral_constant >; Graph1 = boost::adjacency_list >; Graph2 = boost::adjacency_list >]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/isomorphism.hpp:662:5: required from ‘typename boost::result_of(Param0, Param1, const ArgPack&)>::type boost::graph::isomorphism_with_named_params(const Param0&, const Param1&, const ArgPack&) [with Param0 = boost::adjacency_list >; Param1 = boost::adjacency_list >; ArgPack = boost::parameter::aux::arg_list >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&> >, boost::parameter::aux::empty_arg_list, std::integral_constant >; typename boost::result_of(Param0, Param1, const ArgPack&)>::type = bool]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/isomorphism.hpp:666:1: required from ‘typename boost::result_of(Param0, Param1, const typename boost::detail::convert_bgl_params_to_boost_parameter >::type&)>::type boost::isomorphism(const Param0&, const Param1&, const bgl_named_params&) [with Param0 = adjacency_list >; Param1 = adjacency_list >; P = iterator_property_map<__gnu_cxx::__normal_iterator >, adj_list_vertex_property_map >, int, int&, vertex_index_t>, void*, void*&>; T = vertex_isomorphism_t; R = no_property; typename result_of(Param0, Param1, const typename detail::convert_bgl_params_to_boost_parameter >::type&)>::type = bool; typename detail::convert_bgl_params_to_boost_parameter >::type = parameter::aux::arg_list >, adj_list_vertex_property_map >, int, int&, vertex_index_t>, void*, void*&> >, parameter::aux::empty_arg_list, std::integral_constant >]’ ordering.cpp:68:18: required from here /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::Convertible::~Convertible() [with X = boost::iterators::detail::iterator_category_with_traversal; Y = std::input_iterator_tag]’ 37 | ~model() | ^ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:208:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 208 | BOOST_CONCEPT_USAGE(Convertible) { | ^~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::concepts::MultiPassInputIterator >, boost::no_property>*, std::vector >, boost::no_property>, std::allocator >, boost::no_property> > > >, void*, boost::detail::edge_desc_impl, long int> >]’: /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements >, boost::no_property>*, std::vector >, boost::no_property>, std::allocator >, boost::no_property> > > >, void*, boost::detail::edge_desc_impl, long int> > >]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/graph_concepts.hpp:52:50: required from ‘struct boost::concepts::MultiPassInputIterator >, boost::no_property>*, std::vector >, boost::no_property>, std::allocator >, boost::no_property> > > >, void*, boost::detail::edge_desc_impl, long int> >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::concepts::MultiPassInputIterator >, boost::no_property>*, std::vector >, boost::no_property>, std::allocator >, boost::no_property> > > >, void*, boost::detail::edge_desc_impl, long int> >]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied >, boost::no_property>*, std::vector >, boost::no_property>, std::allocator >, boost::no_property> > > >, void*, boost::detail::edge_desc_impl, long int> > >::value’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied >, boost::no_property>*, std::vector >, boost::no_property>, std::allocator >, boost::no_property> > > >, void*, boost::detail::edge_desc_impl, long int> > >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:72:8: [ skipping 5 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/isomorphism.hpp:209:38: required from ‘bool boost::detail::isomorphism_algo::test_isomorphism() [with Graph1 = boost::adjacency_list >; Graph2 = boost::adjacency_list >; IsoMapping = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&>; Invariant1 = boost::degree_vertex_invariant >, int, const int&, boost::vertex_index_t> >, boost::adjacency_list > >; Invariant2 = boost::degree_vertex_invariant >, int, const int&, boost::vertex_index_t> >, boost::adjacency_list > >; IndexMap1 = boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>; IndexMap2 = boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/isomorphism.hpp:532:33: required from ‘bool boost::isomorphism(const Graph1&, const Graph2&, IsoMapping, Invariant1, Invariant2, std::size_t, IndexMap1, IndexMap2) [with Graph1 = adjacency_list >; Graph2 = adjacency_list >; IsoMapping = iterator_property_map<__gnu_cxx::__normal_iterator >, adj_list_vertex_property_map >, int, int&, vertex_index_t>, void*, void*&>; Invariant1 = degree_vertex_invariant >, int, const int&, vertex_index_t> >, adjacency_list > >; Invariant2 = degree_vertex_invariant >, int, const int&, vertex_index_t> >, adjacency_list > >; IndexMap1 = adj_list_vertex_property_map >, int, const int&, vertex_index_t>; IndexMap2 = adj_list_vertex_property_map >, int, const int&, vertex_index_t>; std::size_t = long unsigned int]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/isomorphism.hpp:651:42: required from ‘bool boost::graph::detail::isomorphism_impl::operator()(const Graph1&, const Graph2&, const ArgPack&) const [with ArgPack = boost::parameter::aux::arg_list >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&> >, boost::parameter::aux::empty_arg_list, std::integral_constant >; Graph1 = boost::adjacency_list >; Graph2 = boost::adjacency_list >]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/isomorphism.hpp:662:5: required from ‘typename boost::result_of(Param0, Param1, const ArgPack&)>::type boost::graph::isomorphism_with_named_params(const Param0&, const Param1&, const ArgPack&) [with Param0 = boost::adjacency_list >; Param1 = boost::adjacency_list >; ArgPack = boost::parameter::aux::arg_list >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&> >, boost::parameter::aux::empty_arg_list, std::integral_constant >; typename boost::result_of(Param0, Param1, const ArgPack&)>::type = bool]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/isomorphism.hpp:666:1: required from ‘typename boost::result_of(Param0, Param1, const typename boost::detail::convert_bgl_params_to_boost_parameter >::type&)>::type boost::isomorphism(const Param0&, const Param1&, const bgl_named_params&) [with Param0 = adjacency_list >; Param1 = adjacency_list >; P = iterator_property_map<__gnu_cxx::__normal_iterator >, adj_list_vertex_property_map >, int, int&, vertex_index_t>, void*, void*&>; T = vertex_isomorphism_t; R = no_property; typename result_of(Param0, Param1, const typename detail::convert_bgl_params_to_boost_parameter >::type&)>::type = bool; typename detail::convert_bgl_params_to_boost_parameter >::type = parameter::aux::arg_list >, adj_list_vertex_property_map >, int, int&, vertex_index_t>, void*, void*&> >, parameter::aux::empty_arg_list, std::integral_constant >]’ ordering.cpp:68:18: required from here /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::concepts::MultiPassInputIterator::~MultiPassInputIterator() [with T = boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator >, boost::no_property>*, std::vector >, boost::no_property>, std::allocator >, boost::no_property> > > >, void*, boost::detail::edge_desc_impl, long int>]’ 37 | ~model() | ^ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/graph_concepts.hpp:52:50: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 52 | BOOST_concept(MultiPassInputIterator, (T)) { BOOST_CONCEPT_USAGE( | ^~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::Convertible, std::input_iterator_tag>]’: /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements, std::input_iterator_tag> >]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:208:5: required from ‘struct boost::Convertible, std::input_iterator_tag>’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::Convertible, std::input_iterator_tag>]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied, std::input_iterator_tag> >::value’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied, std::input_iterator_tag> >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:72:8: [ skipping 5 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/graph_concepts.hpp:89:9: required from ‘boost::concepts::IncidenceGraph::~IncidenceGraph() [with G = R_adjacency_list]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/graph_concepts.hpp:75:1: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::IncidenceGraphConcept >]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/depth_first_search.hpp:129:9: required from ‘void boost::detail::depth_first_visit_impl(const IncidenceGraph&, typename boost::graph_traits::vertex_descriptor, DFSVisitor&, ColorMap, TerminatorFunc) [with IncidenceGraph = R_adjacency_list; DFSVisitor = boost::dfs_visitor<>; ColorMap = boost::vec_adj_list_vertex_property_map, boost::property, boost::no_property, boost::listS>, boost::adjacency_list, boost::property, boost::no_property, boost::listS>*, boost::default_color_type, boost::default_color_type&, boost::vertex_color_t>; TerminatorFunc = nontruth2; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/depth_first_search.hpp:417:35: required from ‘void boost::depth_first_visit(const IncidenceGraph&, typename graph_traits::vertex_descriptor, DFSVisitor, ColorMap) [with IncidenceGraph = R_adjacency_list; DFSVisitor = dfs_visitor<>; ColorMap = vec_adj_list_vertex_property_map, property, no_property, listS>, adjacency_list, property, no_property, listS>*, default_color_type, default_color_type&, vertex_color_t>; typename graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/cuthill_mckee_ordering.hpp:146:30: required from ‘OutputIterator boost::cuthill_mckee_ordering(const Graph&, OutputIterator, ColorMap, DegreeMap) [with Graph = R_adjacency_list; OutputIterator = std::reverse_iterator<__gnu_cxx::__normal_iterator > >; ColorMap = vec_adj_list_vertex_property_map, property, no_property, listS>, adjacency_list, property, no_property, listS>*, default_color_type, default_color_type&, vertex_color_t>; DegreeMap = degree_property_map >]’ ordering.cpp:98:25: required from here /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::Convertible::~Convertible() [with X = boost::iterators::detail::iterator_category_with_traversal; Y = std::input_iterator_tag]’ 37 | ~model() | ^ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:208:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 208 | BOOST_CONCEPT_USAGE(Convertible) { | ^~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements >, boost::no_property> >, long unsigned int, boost::detail::edge_desc_impl, long int> > >]’: /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/graph_concepts.hpp:52:50: required from ‘struct boost::concepts::MultiPassInputIterator >, boost::no_property> >, long unsigned int, boost::detail::edge_desc_impl, long int> >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::concepts::MultiPassInputIterator >, boost::no_property> >, long unsigned int, boost::detail::edge_desc_impl, long int> >]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied >, boost::no_property> >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::value’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied >, boost::no_property> >, long unsigned int, boost::detail::edge_desc_impl, long int> > >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_ >, boost::no_property> >, long unsigned int, boost::detail::edge_desc_impl, long int> >)>’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/graph_concepts.hpp:89:9: [ skipping 5 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/breadth_first_search.hpp:262:29: required from ‘void boost::detail::bfs_helper(VertexListGraph&, typename boost::graph_traits::vertex_descriptor, ColorMap, BFSVisitor, const boost::bgl_named_params&, mpl_::false_) [with VertexListGraph = boost::adjacency_list > > >; ColorMap = boost::two_bit_color_map > >, long unsigned int> >; BFSVisitor = boost::bfs_visitor >, boost::vec_adj_list_vertex_id_map > >, long unsigned int>, long unsigned int, long unsigned int&>, boost::on_tree_edge> >; P = boost::bfs_visitor >, boost::vec_adj_list_vertex_id_map > >, long unsigned int>, long unsigned int, long unsigned int&>, boost::on_tree_edge> >; T = boost::graph_visitor_t; R = boost::no_property; typename boost::graph_traits::vertex_descriptor = long unsigned int; mpl_::false_ = mpl_::bool_]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/breadth_first_search.hpp:309:23: required from ‘static void boost::detail::bfs_dispatch::apply(VertexListGraph&, typename boost::graph_traits::vertex_descriptor, const boost::bgl_named_params&, boost::param_not_found) [with VertexListGraph = boost::adjacency_list > > >; P = boost::bfs_visitor >, boost::vec_adj_list_vertex_id_map > >, long unsigned int>, long unsigned int, long unsigned int&>, boost::on_tree_edge> >; T = boost::graph_visitor_t; R = boost::no_property; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/breadth_first_search.hpp:339:37: required from ‘void boost::breadth_first_search(const VertexListGraph&, typename graph_traits::vertex_descriptor, const bgl_named_params&) [with VertexListGraph = adjacency_list > > >; P = bfs_visitor >, vec_adj_list_vertex_id_map > >, long unsigned int>, long unsigned int, long unsigned int&>, on_tree_edge> >; T = graph_visitor_t; R = no_property; typename graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/sloan_ordering.hpp:175:29: required from ‘typename boost::graph_traits::vertex_descriptor boost::sloan_start_end_vertices(Graph&, typename graph_traits::vertex_descriptor&, ColorMap, DegreeMap) [with Graph = adjacency_list > > >; ColorMap = vec_adj_list_vertex_property_map > > >, adjacency_list > > >*, default_color_type, default_color_type&, vertex_color_t>; DegreeMap = degree_property_map > > > >; typename graph_traits::vertex_descriptor = long unsigned int; typename graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/sloan_ordering.hpp:429:33: required from ‘OutputIterator boost::sloan_ordering(Graph&, OutputIterator, Color, Degree, Priority, Weight, Weight) [with Graph = adjacency_list > > >; OutputIterator = __gnu_cxx::__normal_iterator >; Color = vec_adj_list_vertex_property_map > > >, adjacency_list > > >*, default_color_type, default_color_type&, vertex_color_t>; Degree = degree_property_map > > > >; Priority = vec_adj_list_vertex_property_map > > >, adjacency_list > > >*, double, double&, vertex_priority_t>; Weight = int]’ ordering.cpp:245:17: required from here /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::concepts::MultiPassInputIterator >, boost::no_property> >, long unsigned int, boost::detail::edge_desc_impl, long int> >]’ 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ^ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::MultiPassInputIterator >, boost::no_property> >, long unsigned int, boost::detail::edge_desc_impl, long int> >]’: /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/graph_concepts.hpp:89:9: required from ‘boost::concepts::IncidenceGraph::~IncidenceGraph() [with G = boost::adjacency_list > > >]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/graph_concepts.hpp:75:1: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::IncidenceGraphConcept > > > >]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/depth_first_search.hpp:129:9: required from ‘void boost::breadth_first_visit(const IncidenceGraph&, SourceIterator, SourceIterator, Buffer&, BFSVisitor, ColorMap) [with IncidenceGraph = adjacency_list > > >; Buffer = queue > >; BFSVisitor = bfs_visitor >, vec_adj_list_vertex_id_map > >, long unsigned int>, long unsigned int, long unsigned int&>, on_tree_edge> >; ColorMap = two_bit_color_map > >, long unsigned int> >; SourceIterator = long unsigned int*]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/breadth_first_search.hpp:136:24: required from ‘void boost::breadth_first_search(const VertexListGraph&, SourceIterator, SourceIterator, Buffer&, BFSVisitor, ColorMap) [with VertexListGraph = adjacency_list > > >; SourceIterator = long unsigned int*; Buffer = queue > >; BFSVisitor = bfs_visitor >, vec_adj_list_vertex_id_map > >, long unsigned int>, long unsigned int, long unsigned int&>, on_tree_edge> >; ColorMap = two_bit_color_map > >, long unsigned int> >]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/breadth_first_search.hpp:147:25: required from ‘void boost::breadth_first_search(const VertexListGraph&, typename graph_traits::vertex_descriptor, Buffer&, BFSVisitor, ColorMap) [with VertexListGraph = adjacency_list > > >; Buffer = queue > >; BFSVisitor = bfs_visitor >, vec_adj_list_vertex_id_map > >, long unsigned int>, long unsigned int, long unsigned int&>, on_tree_edge> >; ColorMap = two_bit_color_map > >, long unsigned int> >; typename graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/breadth_first_search.hpp:262:29: required from ‘void boost::detail::bfs_helper(VertexListGraph&, typename boost::graph_traits::vertex_descriptor, ColorMap, BFSVisitor, const boost::bgl_named_params&, mpl_::false_) [with VertexListGraph = boost::adjacency_list > > >; ColorMap = boost::two_bit_color_map > >, long unsigned int> >; BFSVisitor = boost::bfs_visitor >, boost::vec_adj_list_vertex_id_map > >, long unsigned int>, long unsigned int, long unsigned int&>, boost::on_tree_edge> >; P = boost::bfs_visitor >, boost::vec_adj_list_vertex_id_map > >, long unsigned int>, long unsigned int, long unsigned int&>, boost::on_tree_edge> >; T = boost::graph_visitor_t; R = boost::no_property; typename boost::graph_traits::vertex_descriptor = long unsigned int; mpl_::false_ = mpl_::bool_]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/breadth_first_search.hpp:309:23: required from ‘static void boost::detail::bfs_dispatch::apply(VertexListGraph&, typename boost::graph_traits::vertex_descriptor, const boost::bgl_named_params&, boost::param_not_found) [with VertexListGraph = boost::adjacency_list > > >; P = boost::bfs_visitor >, boost::vec_adj_list_vertex_id_map > >, long unsigned int>, long unsigned int, long unsigned int&>, boost::on_tree_edge> >; T = boost::graph_visitor_t; R = boost::no_property; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/breadth_first_search.hpp:339:37: required from ‘void boost::breadth_first_search(const VertexListGraph&, typename graph_traits::vertex_descriptor, const bgl_named_params&) [with VertexListGraph = adjacency_list > > >; P = bfs_visitor >, vec_adj_list_vertex_id_map > >, long unsigned int>, long unsigned int, long unsigned int&>, on_tree_edge> >; T = graph_visitor_t; R = no_property; typename graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/sloan_ordering.hpp:175:29: required from ‘typename boost::graph_traits::vertex_descriptor boost::sloan_start_end_vertices(Graph&, typename graph_traits::vertex_descriptor&, ColorMap, DegreeMap) [with Graph = adjacency_list > > >; ColorMap = vec_adj_list_vertex_property_map > > >, adjacency_list > > >*, default_color_type, default_color_type&, vertex_color_t>; DegreeMap = degree_property_map > > > >; typename graph_traits::vertex_descriptor = long unsigned int; typename graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/sloan_ordering.hpp:429:33: required from ‘OutputIterator boost::sloan_ordering(Graph&, OutputIterator, Color, Degree, Priority, Weight, Weight) [with Graph = adjacency_list > > >; OutputIterator = __gnu_cxx::__normal_iterator >; Color = vec_adj_list_vertex_property_map > > >, adjacency_list > > >*, default_color_type, default_color_type&, vertex_color_t>; Degree = degree_property_map > > > >; Priority = vec_adj_list_vertex_property_map > > >, adjacency_list > > >*, double, double&, vertex_priority_t>; Weight = int]’ ordering.cpp:245:17: required from here /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::concepts::MultiPassInputIterator::~MultiPassInputIterator() [with T = boost::detail::out_edge_iter >, boost::no_property> >, long unsigned int, boost::detail::edge_desc_impl, long int>]’ 37 | ~model() | ^ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/graph_concepts.hpp:52:50: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 52 | BOOST_concept(MultiPassInputIterator, (T)) { BOOST_CONCEPT_USAGE( | ^~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::CopyConstructible >, boost::vec_adj_list_vertex_id_map > >, long unsigned int>, long unsigned int, long unsigned int&>, boost::on_tree_edge> > >]’: /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements >, boost::vec_adj_list_vertex_id_map > >, long unsigned int>, long unsigned int, long unsigned int&>, boost::on_tree_edge> > > >]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:167:5: required from ‘struct boost::CopyConstructible >, boost::vec_adj_list_vertex_id_map > >, long unsigned int>, long unsigned int, long unsigned int&>, boost::on_tree_edge> > >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:165:3: required from ‘struct boost::CopyConstructibleConcept >, boost::vec_adj_list_vertex_id_map > >, long unsigned int>, long unsigned int, long unsigned int&>, boost::on_tree_edge> > >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::CopyConstructibleConcept >, boost::vec_adj_list_vertex_id_map > >, long unsigned int>, long unsigned int, long unsigned int&>, boost::on_tree_edge> > >]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied >, boost::vec_adj_list_vertex_id_map > >, long unsigned int>, long unsigned int, long unsigned int&>, boost::on_tree_edge> > > >::value’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:45:51: [ skipping 10 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/breadth_first_search.hpp:262:29: required from ‘void boost::detail::bfs_helper(VertexListGraph&, typename boost::graph_traits::vertex_descriptor, ColorMap, BFSVisitor, const boost::bgl_named_params&, mpl_::false_) [with VertexListGraph = boost::adjacency_list > > >; ColorMap = boost::two_bit_color_map > >, long unsigned int> >; BFSVisitor = boost::bfs_visitor >, boost::vec_adj_list_vertex_id_map > >, long unsigned int>, long unsigned int, long unsigned int&>, boost::on_tree_edge> >; P = boost::bfs_visitor >, boost::vec_adj_list_vertex_id_map > >, long unsigned int>, long unsigned int, long unsigned int&>, boost::on_tree_edge> >; T = boost::graph_visitor_t; R = boost::no_property; typename boost::graph_traits::vertex_descriptor = long unsigned int; mpl_::false_ = mpl_::bool_]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/breadth_first_search.hpp:309:23: required from ‘static void boost::detail::bfs_dispatch::apply(VertexListGraph&, typename boost::graph_traits::vertex_descriptor, const boost::bgl_named_params&, boost::param_not_found) [with VertexListGraph = boost::adjacency_list > > >; P = boost::bfs_visitor >, boost::vec_adj_list_vertex_id_map > >, long unsigned int>, long unsigned int, long unsigned int&>, boost::on_tree_edge> >; T = boost::graph_visitor_t; R = boost::no_property; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/breadth_first_search.hpp:339:37: required from ‘void boost::breadth_first_search(const VertexListGraph&, typename graph_traits::vertex_descriptor, const bgl_named_params&) [with VertexListGraph = adjacency_list > > >; P = bfs_visitor >, vec_adj_list_vertex_id_map > >, long unsigned int>, long unsigned int, long unsigned int&>, on_tree_edge> >; T = graph_visitor_t; R = no_property; typename graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/sloan_ordering.hpp:175:29: required from ‘typename boost::graph_traits::vertex_descriptor boost::sloan_start_end_vertices(Graph&, typename graph_traits::vertex_descriptor&, ColorMap, DegreeMap) [with Graph = adjacency_list > > >; ColorMap = vec_adj_list_vertex_property_map > > >, adjacency_list > > >*, default_color_type, default_color_type&, vertex_color_t>; DegreeMap = degree_property_map > > > >; typename graph_traits::vertex_descriptor = long unsigned int; typename graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/sloan_ordering.hpp:429:33: required from ‘OutputIterator boost::sloan_ordering(Graph&, OutputIterator, Color, Degree, Priority, Weight, Weight) [with Graph = adjacency_list > > >; OutputIterator = __gnu_cxx::__normal_iterator >; Color = vec_adj_list_vertex_property_map > > >, adjacency_list > > >*, default_color_type, default_color_type&, vertex_color_t>; Degree = degree_property_map > > > >; Priority = vec_adj_list_vertex_property_map > > >, adjacency_list > > >*, double, double&, vertex_priority_t>; Weight = int]’ ordering.cpp:245:17: required from here /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::CopyConstructible::~CopyConstructible() [with TT = boost::bfs_visitor >, boost::vec_adj_list_vertex_id_map > >, long unsigned int>, long unsigned int, long unsigned int&>, boost::on_tree_edge> >]’ 37 | ~model() | ^ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:167:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 167 | BOOST_CONCEPT_USAGE(CopyConstructible) { | ^~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements >]’: /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:208:5: required from ‘struct boost::Convertible’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:206:3: required from ‘struct boost::ConvertibleConcept’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::ConvertibleConcept]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied >::value’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:72:8: [ skipping 14 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/breadth_first_search.hpp:262:29: required from ‘void boost::detail::bfs_helper(VertexListGraph&, typename boost::graph_traits::vertex_descriptor, ColorMap, BFSVisitor, const boost::bgl_named_params&, mpl_::false_) [with VertexListGraph = boost::adjacency_list > > >; ColorMap = boost::two_bit_color_map > >, long unsigned int> >; BFSVisitor = boost::bfs_visitor >, boost::vec_adj_list_vertex_id_map > >, long unsigned int>, long unsigned int, long unsigned int&>, boost::on_tree_edge> >; P = boost::bfs_visitor >, boost::vec_adj_list_vertex_id_map > >, long unsigned int>, long unsigned int, long unsigned int&>, boost::on_tree_edge> >; T = boost::graph_visitor_t; R = boost::no_property; typename boost::graph_traits::vertex_descriptor = long unsigned int; mpl_::false_ = mpl_::bool_]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/breadth_first_search.hpp:309:23: required from ‘static void boost::detail::bfs_dispatch::apply(VertexListGraph&, typename boost::graph_traits::vertex_descriptor, const boost::bgl_named_params&, boost::param_not_found) [with VertexListGraph = boost::adjacency_list > > >; P = boost::bfs_visitor >, boost::vec_adj_list_vertex_id_map > >, long unsigned int>, long unsigned int, long unsigned int&>, boost::on_tree_edge> >; T = boost::graph_visitor_t; R = boost::no_property; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/breadth_first_search.hpp:339:37: required from ‘void boost::breadth_first_search(const VertexListGraph&, typename graph_traits::vertex_descriptor, const bgl_named_params&) [with VertexListGraph = adjacency_list > > >; P = bfs_visitor >, vec_adj_list_vertex_id_map > >, long unsigned int>, long unsigned int, long unsigned int&>, on_tree_edge> >; T = graph_visitor_t; R = no_property; typename graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/sloan_ordering.hpp:175:29: required from ‘typename boost::graph_traits::vertex_descriptor boost::sloan_start_end_vertices(Graph&, typename graph_traits::vertex_descriptor&, ColorMap, DegreeMap) [with Graph = adjacency_list > > >; ColorMap = vec_adj_list_vertex_property_map > > >, adjacency_list > > >*, default_color_type, default_color_type&, vertex_color_t>; DegreeMap = degree_property_map > > > >; typename graph_traits::vertex_descriptor = long unsigned int; typename graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/sloan_ordering.hpp:429:33: required from ‘OutputIterator boost::sloan_ordering(Graph&, OutputIterator, Color, Degree, Priority, Weight, Weight) [with Graph = adjacency_list > > >; OutputIterator = __gnu_cxx::__normal_iterator >; Color = vec_adj_list_vertex_property_map > > >, adjacency_list > > >*, default_color_type, default_color_type&, vertex_color_t>; Degree = degree_property_map > > > >; Priority = vec_adj_list_vertex_property_map > > >, adjacency_list > > >*, double, double&, vertex_priority_t>; Weight = int]’ ordering.cpp:245:17: required from here /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::Convertible]’ 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ^ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::ConvertibleConcept]’: /home/omnipath/local/R/4.4-3.20/BH/include/boost/property_map/property_map.hpp:148:7: required from ‘void boost::ReadablePropertyMapConcept::constraints() [with PMap = boost::two_bit_color_map > >, long unsigned int> >; Key = long unsigned int]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::ReadablePropertyMapConcept > >, long unsigned int> >, long unsigned int>]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied > >, long unsigned int> >, long unsigned int> >::value’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied > >, long unsigned int> >, long unsigned int> >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_ > >, long unsigned int> >, long unsigned int>)>’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/property_map/property_map.hpp:206:7: [ skipping 8 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/breadth_first_search.hpp:262:29: required from ‘void boost::detail::bfs_helper(VertexListGraph&, typename boost::graph_traits::vertex_descriptor, ColorMap, BFSVisitor, const boost::bgl_named_params&, mpl_::false_) [with VertexListGraph = boost::adjacency_list > > >; ColorMap = boost::two_bit_color_map > >, long unsigned int> >; BFSVisitor = boost::bfs_visitor >, boost::vec_adj_list_vertex_id_map > >, long unsigned int>, long unsigned int, long unsigned int&>, boost::on_tree_edge> >; P = boost::bfs_visitor >, boost::vec_adj_list_vertex_id_map > >, long unsigned int>, long unsigned int, long unsigned int&>, boost::on_tree_edge> >; T = boost::graph_visitor_t; R = boost::no_property; typename boost::graph_traits::vertex_descriptor = long unsigned int; mpl_::false_ = mpl_::bool_]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/breadth_first_search.hpp:309:23: required from ‘static void boost::detail::bfs_dispatch::apply(VertexListGraph&, typename boost::graph_traits::vertex_descriptor, const boost::bgl_named_params&, boost::param_not_found) [with VertexListGraph = boost::adjacency_list > > >; P = boost::bfs_visitor >, boost::vec_adj_list_vertex_id_map > >, long unsigned int>, long unsigned int, long unsigned int&>, boost::on_tree_edge> >; T = boost::graph_visitor_t; R = boost::no_property; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/breadth_first_search.hpp:339:37: required from ‘void boost::breadth_first_search(const VertexListGraph&, typename graph_traits::vertex_descriptor, const bgl_named_params&) [with VertexListGraph = adjacency_list > > >; P = bfs_visitor >, vec_adj_list_vertex_id_map > >, long unsigned int>, long unsigned int, long unsigned int&>, on_tree_edge> >; T = graph_visitor_t; R = no_property; typename graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/sloan_ordering.hpp:175:29: required from ‘typename boost::graph_traits::vertex_descriptor boost::sloan_start_end_vertices(Graph&, typename graph_traits::vertex_descriptor&, ColorMap, DegreeMap) [with Graph = adjacency_list > > >; ColorMap = vec_adj_list_vertex_property_map > > >, adjacency_list > > >*, default_color_type, default_color_type&, vertex_color_t>; DegreeMap = degree_property_map > > > >; typename graph_traits::vertex_descriptor = long unsigned int; typename graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/sloan_ordering.hpp:429:33: required from ‘OutputIterator boost::sloan_ordering(Graph&, OutputIterator, Color, Degree, Priority, Weight, Weight) [with Graph = adjacency_list > > >; OutputIterator = __gnu_cxx::__normal_iterator >; Color = vec_adj_list_vertex_property_map > > >, adjacency_list > > >*, default_color_type, default_color_type&, vertex_color_t>; Degree = degree_property_map > > > >; Priority = vec_adj_list_vertex_property_map > > >, adjacency_list > > >*, double, double&, vertex_priority_t>; Weight = int]’ ordering.cpp:245:17: required from here /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:206:17: note: in a call to non-static member function ‘boost::ConvertibleConcept::~ConvertibleConcept()’ 206 | BOOST_concept(Convertible,(X)(Y)) | ^~~~~~~~~~~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/preprocessor/cat.hpp:29:34: note: in definition of macro ‘BOOST_PP_CAT_I’ 29 | # define BOOST_PP_CAT_I(a, b) a ## b | ^ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/concept_def.hpp:23:12: note: in expansion of macro ‘BOOST_PP_CAT’ 23 | struct BOOST_PP_CAT(name,Concept) \ | ^~~~~~~~~~~~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:206:3: note: in expansion of macro ‘BOOST_concept’ 206 | BOOST_concept(Convertible,(X)(Y)) | ^~~~~~~~~~~~~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements >]’: /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:208:5: required from ‘struct boost::Convertible’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:206:3: required from ‘struct boost::ConvertibleConcept’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::ConvertibleConcept]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied >::value’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:72:8: [ skipping 14 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/breadth_first_search.hpp:262:29: required from ‘void boost::detail::bfs_helper(VertexListGraph&, typename boost::graph_traits::vertex_descriptor, ColorMap, BFSVisitor, const boost::bgl_named_params&, mpl_::false_) [with VertexListGraph = boost::adjacency_list > > >; ColorMap = boost::two_bit_color_map > >, long unsigned int> >; BFSVisitor = boost::bfs_visitor >, boost::vec_adj_list_vertex_id_map > >, long unsigned int>, long unsigned int, long unsigned int&>, boost::on_tree_edge> >; P = boost::bfs_visitor >, boost::vec_adj_list_vertex_id_map > >, long unsigned int>, long unsigned int, long unsigned int&>, boost::on_tree_edge> >; T = boost::graph_visitor_t; R = boost::no_property; typename boost::graph_traits::vertex_descriptor = long unsigned int; mpl_::false_ = mpl_::bool_]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/breadth_first_search.hpp:309:23: required from ‘static void boost::detail::bfs_dispatch::apply(VertexListGraph&, typename boost::graph_traits::vertex_descriptor, const boost::bgl_named_params&, boost::param_not_found) [with VertexListGraph = boost::adjacency_list > > >; P = boost::bfs_visitor >, boost::vec_adj_list_vertex_id_map > >, long unsigned int>, long unsigned int, long unsigned int&>, boost::on_tree_edge> >; T = boost::graph_visitor_t; R = boost::no_property; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/breadth_first_search.hpp:339:37: required from ‘void boost::breadth_first_search(const VertexListGraph&, typename graph_traits::vertex_descriptor, const bgl_named_params&) [with VertexListGraph = adjacency_list > > >; P = bfs_visitor >, vec_adj_list_vertex_id_map > >, long unsigned int>, long unsigned int, long unsigned int&>, on_tree_edge> >; T = graph_visitor_t; R = no_property; typename graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/sloan_ordering.hpp:175:29: required from ‘typename boost::graph_traits::vertex_descriptor boost::sloan_start_end_vertices(Graph&, typename graph_traits::vertex_descriptor&, ColorMap, DegreeMap) [with Graph = adjacency_list > > >; ColorMap = vec_adj_list_vertex_property_map > > >, adjacency_list > > >*, default_color_type, default_color_type&, vertex_color_t>; DegreeMap = degree_property_map > > > >; typename graph_traits::vertex_descriptor = long unsigned int; typename graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/sloan_ordering.hpp:429:33: required from ‘OutputIterator boost::sloan_ordering(Graph&, OutputIterator, Color, Degree, Priority, Weight, Weight) [with Graph = adjacency_list > > >; OutputIterator = __gnu_cxx::__normal_iterator >; Color = vec_adj_list_vertex_property_map > > >, adjacency_list > > >*, default_color_type, default_color_type&, vertex_color_t>; Degree = degree_property_map > > > >; Priority = vec_adj_list_vertex_property_map > > >, adjacency_list > > >*, double, double&, vertex_priority_t>; Weight = int]’ ordering.cpp:245:17: required from here /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::Convertible]’ 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ^ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::ConvertibleConcept]’: /home/omnipath/local/R/4.4-3.20/BH/include/boost/property_map/property_map.hpp:180:7: required from ‘void boost::WritablePropertyMapConcept::constraints() [with PMap = boost::two_bit_color_map > >, long unsigned int> >; Key = long unsigned int]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::WritablePropertyMapConcept > >, long unsigned int> >, long unsigned int>]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied > >, long unsigned int> >, long unsigned int> >::value’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied > >, long unsigned int> >, long unsigned int> >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_ > >, long unsigned int> >, long unsigned int>)>’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/property_map/property_map.hpp:207:7: [ skipping 8 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/breadth_first_search.hpp:262:29: required from ‘void boost::detail::bfs_helper(VertexListGraph&, typename boost::graph_traits::vertex_descriptor, ColorMap, BFSVisitor, const boost::bgl_named_params&, mpl_::false_) [with VertexListGraph = boost::adjacency_list > > >; ColorMap = boost::two_bit_color_map > >, long unsigned int> >; BFSVisitor = boost::bfs_visitor >, boost::vec_adj_list_vertex_id_map > >, long unsigned int>, long unsigned int, long unsigned int&>, boost::on_tree_edge> >; P = boost::bfs_visitor >, boost::vec_adj_list_vertex_id_map > >, long unsigned int>, long unsigned int, long unsigned int&>, boost::on_tree_edge> >; T = boost::graph_visitor_t; R = boost::no_property; typename boost::graph_traits::vertex_descriptor = long unsigned int; mpl_::false_ = mpl_::bool_]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/breadth_first_search.hpp:309:23: required from ‘static void boost::detail::bfs_dispatch::apply(VertexListGraph&, typename boost::graph_traits::vertex_descriptor, const boost::bgl_named_params&, boost::param_not_found) [with VertexListGraph = boost::adjacency_list > > >; P = boost::bfs_visitor >, boost::vec_adj_list_vertex_id_map > >, long unsigned int>, long unsigned int, long unsigned int&>, boost::on_tree_edge> >; T = boost::graph_visitor_t; R = boost::no_property; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/breadth_first_search.hpp:339:37: required from ‘void boost::breadth_first_search(const VertexListGraph&, typename graph_traits::vertex_descriptor, const bgl_named_params&) [with VertexListGraph = adjacency_list > > >; P = bfs_visitor >, vec_adj_list_vertex_id_map > >, long unsigned int>, long unsigned int, long unsigned int&>, on_tree_edge> >; T = graph_visitor_t; R = no_property; typename graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/sloan_ordering.hpp:175:29: required from ‘typename boost::graph_traits::vertex_descriptor boost::sloan_start_end_vertices(Graph&, typename graph_traits::vertex_descriptor&, ColorMap, DegreeMap) [with Graph = adjacency_list > > >; ColorMap = vec_adj_list_vertex_property_map > > >, adjacency_list > > >*, default_color_type, default_color_type&, vertex_color_t>; DegreeMap = degree_property_map > > > >; typename graph_traits::vertex_descriptor = long unsigned int; typename graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/sloan_ordering.hpp:429:33: required from ‘OutputIterator boost::sloan_ordering(Graph&, OutputIterator, Color, Degree, Priority, Weight, Weight) [with Graph = adjacency_list > > >; OutputIterator = __gnu_cxx::__normal_iterator >; Color = vec_adj_list_vertex_property_map > > >, adjacency_list > > >*, default_color_type, default_color_type&, vertex_color_t>; Degree = degree_property_map > > > >; Priority = vec_adj_list_vertex_property_map > > >, adjacency_list > > >*, double, double&, vertex_priority_t>; Weight = int]’ ordering.cpp:245:17: required from here /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:206:17: note: in a call to non-static member function ‘boost::ConvertibleConcept::~ConvertibleConcept()’ 206 | BOOST_concept(Convertible,(X)(Y)) | ^~~~~~~~~~~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/preprocessor/cat.hpp:29:34: note: in definition of macro ‘BOOST_PP_CAT_I’ 29 | # define BOOST_PP_CAT_I(a, b) a ## b | ^ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/concept_def.hpp:23:12: note: in expansion of macro ‘BOOST_PP_CAT’ 23 | struct BOOST_PP_CAT(name,Concept) \ | ^~~~~~~~~~~~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:206:3: note: in expansion of macro ‘BOOST_concept’ 206 | BOOST_concept(Convertible,(X)(Y)) | ^~~~~~~~~~~~~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::Convertible]’: /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements >]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:208:5: required from ‘struct boost::Convertible’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:206:3: required from ‘struct boost::ConvertibleConcept’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::ConvertibleConcept]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied >::value’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:45:51: [ skipping 10 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/breadth_first_search.hpp:262:29: required from ‘void boost::detail::bfs_helper(VertexListGraph&, typename boost::graph_traits::vertex_descriptor, ColorMap, BFSVisitor, const boost::bgl_named_params&, mpl_::false_) [with VertexListGraph = boost::adjacency_list > > >; ColorMap = boost::two_bit_color_map > >, long unsigned int> >; BFSVisitor = boost::bfs_visitor >, boost::vec_adj_list_vertex_id_map > >, long unsigned int>, long unsigned int, long unsigned int&>, boost::on_tree_edge> >; P = boost::bfs_visitor >, boost::vec_adj_list_vertex_id_map > >, long unsigned int>, long unsigned int, long unsigned int&>, boost::on_tree_edge> >; T = boost::graph_visitor_t; R = boost::no_property; typename boost::graph_traits::vertex_descriptor = long unsigned int; mpl_::false_ = mpl_::bool_]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/breadth_first_search.hpp:309:23: required from ‘static void boost::detail::bfs_dispatch::apply(VertexListGraph&, typename boost::graph_traits::vertex_descriptor, const boost::bgl_named_params&, boost::param_not_found) [with VertexListGraph = boost::adjacency_list > > >; P = boost::bfs_visitor >, boost::vec_adj_list_vertex_id_map > >, long unsigned int>, long unsigned int, long unsigned int&>, boost::on_tree_edge> >; T = boost::graph_visitor_t; R = boost::no_property; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/breadth_first_search.hpp:339:37: required from ‘void boost::breadth_first_search(const VertexListGraph&, typename graph_traits::vertex_descriptor, const bgl_named_params&) [with VertexListGraph = adjacency_list > > >; P = bfs_visitor >, vec_adj_list_vertex_id_map > >, long unsigned int>, long unsigned int, long unsigned int&>, on_tree_edge> >; T = graph_visitor_t; R = no_property; typename graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/sloan_ordering.hpp:175:29: required from ‘typename boost::graph_traits::vertex_descriptor boost::sloan_start_end_vertices(Graph&, typename graph_traits::vertex_descriptor&, ColorMap, DegreeMap) [with Graph = adjacency_list > > >; ColorMap = vec_adj_list_vertex_property_map > > >, adjacency_list > > >*, default_color_type, default_color_type&, vertex_color_t>; DegreeMap = degree_property_map > > > >; typename graph_traits::vertex_descriptor = long unsigned int; typename graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/sloan_ordering.hpp:429:33: required from ‘OutputIterator boost::sloan_ordering(Graph&, OutputIterator, Color, Degree, Priority, Weight, Weight) [with Graph = adjacency_list > > >; OutputIterator = __gnu_cxx::__normal_iterator >; Color = vec_adj_list_vertex_property_map > > >, adjacency_list > > >*, default_color_type, default_color_type&, vertex_color_t>; Degree = degree_property_map > > > >; Priority = vec_adj_list_vertex_property_map > > >, adjacency_list > > >*, double, double&, vertex_priority_t>; Weight = int]’ ordering.cpp:245:17: required from here /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::Convertible::~Convertible() [with X = boost::read_write_property_map_tag; Y = boost::read_write_property_map_tag]’ 37 | ~model() | ^ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:208:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 208 | BOOST_CONCEPT_USAGE(Convertible) { | ^~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::Convertible]’: /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements >]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:208:5: required from ‘struct boost::Convertible’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::Convertible]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied >::value’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:72:8: [ skipping 6 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/graph_concepts.hpp:176:1: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::VertexListGraphConcept > >]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/isomorphism.hpp:494:5: required from ‘bool boost::isomorphism(const Graph1&, const Graph2&, IsoMapping, Invariant1, Invariant2, std::size_t, IndexMap1, IndexMap2) [with Graph1 = adjacency_list >; Graph2 = adjacency_list >; IsoMapping = iterator_property_map<__gnu_cxx::__normal_iterator >, adj_list_vertex_property_map >, int, int&, vertex_index_t>, void*, void*&>; Invariant1 = degree_vertex_invariant >, int, const int&, vertex_index_t> >, adjacency_list > >; Invariant2 = degree_vertex_invariant >, int, const int&, vertex_index_t> >, adjacency_list > >; IndexMap1 = adj_list_vertex_property_map >, int, const int&, vertex_index_t>; IndexMap2 = adj_list_vertex_property_map >, int, const int&, vertex_index_t>; std::size_t = long unsigned int]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/isomorphism.hpp:651:42: required from ‘bool boost::graph::detail::isomorphism_impl::operator()(const Graph1&, const Graph2&, const ArgPack&) const [with ArgPack = boost::parameter::aux::arg_list >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&> >, boost::parameter::aux::empty_arg_list, std::integral_constant >; Graph1 = boost::adjacency_list >; Graph2 = boost::adjacency_list >]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/isomorphism.hpp:662:5: required from ‘typename boost::result_of(Param0, Param1, const ArgPack&)>::type boost::graph::isomorphism_with_named_params(const Param0&, const Param1&, const ArgPack&) [with Param0 = boost::adjacency_list >; Param1 = boost::adjacency_list >; ArgPack = boost::parameter::aux::arg_list >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&> >, boost::parameter::aux::empty_arg_list, std::integral_constant >; typename boost::result_of(Param0, Param1, const ArgPack&)>::type = bool]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/isomorphism.hpp:666:1: required from ‘typename boost::result_of(Param0, Param1, const typename boost::detail::convert_bgl_params_to_boost_parameter >::type&)>::type boost::isomorphism(const Param0&, const Param1&, const bgl_named_params&) [with Param0 = adjacency_list >; Param1 = adjacency_list >; P = iterator_property_map<__gnu_cxx::__normal_iterator >, adj_list_vertex_property_map >, int, int&, vertex_index_t>, void*, void*&>; T = vertex_isomorphism_t; R = no_property; typename result_of(Param0, Param1, const typename detail::convert_bgl_params_to_boost_parameter >::type&)>::type = bool; typename detail::convert_bgl_params_to_boost_parameter >::type = parameter::aux::arg_list >, adj_list_vertex_property_map >, int, int&, vertex_index_t>, void*, void*&> >, parameter::aux::empty_arg_list, std::integral_constant >]’ ordering.cpp:68:18: required from here /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::Convertible::~Convertible() [with X = std::bidirectional_iterator_tag; Y = std::input_iterator_tag]’ 37 | ~model() | ^ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:208:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 208 | BOOST_CONCEPT_USAGE(Convertible) { | ^~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::Convertible, std::input_iterator_tag>]’: /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements, std::input_iterator_tag> >]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:208:5: required from ‘struct boost::Convertible, std::input_iterator_tag>’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::Convertible, std::input_iterator_tag>]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied, std::input_iterator_tag> >::value’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied, std::input_iterator_tag> >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:72:8: [ skipping 6 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/graph_concepts.hpp:226:1: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::EdgeListGraphConcept > >]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/isomorphism.hpp:495:5: required from ‘bool boost::isomorphism(const Graph1&, const Graph2&, IsoMapping, Invariant1, Invariant2, std::size_t, IndexMap1, IndexMap2) [with Graph1 = adjacency_list >; Graph2 = adjacency_list >; IsoMapping = iterator_property_map<__gnu_cxx::__normal_iterator >, adj_list_vertex_property_map >, int, int&, vertex_index_t>, void*, void*&>; Invariant1 = degree_vertex_invariant >, int, const int&, vertex_index_t> >, adjacency_list > >; Invariant2 = degree_vertex_invariant >, int, const int&, vertex_index_t> >, adjacency_list > >; IndexMap1 = adj_list_vertex_property_map >, int, const int&, vertex_index_t>; IndexMap2 = adj_list_vertex_property_map >, int, const int&, vertex_index_t>; std::size_t = long unsigned int]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/isomorphism.hpp:651:42: required from ‘bool boost::graph::detail::isomorphism_impl::operator()(const Graph1&, const Graph2&, const ArgPack&) const [with ArgPack = boost::parameter::aux::arg_list >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&> >, boost::parameter::aux::empty_arg_list, std::integral_constant >; Graph1 = boost::adjacency_list >; Graph2 = boost::adjacency_list >]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/isomorphism.hpp:662:5: required from ‘typename boost::result_of(Param0, Param1, const ArgPack&)>::type boost::graph::isomorphism_with_named_params(const Param0&, const Param1&, const ArgPack&) [with Param0 = boost::adjacency_list >; Param1 = boost::adjacency_list >; ArgPack = boost::parameter::aux::arg_list >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&> >, boost::parameter::aux::empty_arg_list, std::integral_constant >; typename boost::result_of(Param0, Param1, const ArgPack&)>::type = bool]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/isomorphism.hpp:666:1: required from ‘typename boost::result_of(Param0, Param1, const typename boost::detail::convert_bgl_params_to_boost_parameter >::type&)>::type boost::isomorphism(const Param0&, const Param1&, const bgl_named_params&) [with Param0 = adjacency_list >; Param1 = adjacency_list >; P = iterator_property_map<__gnu_cxx::__normal_iterator >, adj_list_vertex_property_map >, int, int&, vertex_index_t>, void*, void*&>; T = vertex_isomorphism_t; R = no_property; typename result_of(Param0, Param1, const typename detail::convert_bgl_params_to_boost_parameter >::type&)>::type = bool; typename detail::convert_bgl_params_to_boost_parameter >::type = parameter::aux::arg_list >, adj_list_vertex_property_map >, int, int&, vertex_index_t>, void*, void*&> >, parameter::aux::empty_arg_list, std::integral_constant >]’ ordering.cpp:68:18: required from here /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::Convertible::~Convertible() [with X = boost::iterators::detail::iterator_category_with_traversal; Y = std::input_iterator_tag]’ 37 | ~model() | ^ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:208:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 208 | BOOST_CONCEPT_USAGE(Convertible) { | ^~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements >, boost::no_property>*, std::vector >, boost::no_property>, std::allocator >, boost::no_property> > > >, void*, boost::detail::edge_desc_impl, long int> > >]’: /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:145:5: required from ‘struct boost::Assignable >, boost::no_property>*, std::vector >, boost::no_property>, std::allocator >, boost::no_property> > > >, void*, boost::detail::edge_desc_impl, long int> >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:502:3: required from ‘struct boost::InputIterator >, boost::no_property>*, std::vector >, boost::no_property>, std::allocator >, boost::no_property> > > >, void*, boost::detail::edge_desc_impl, long int> >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::InputIterator >, boost::no_property>*, std::vector >, boost::no_property>, std::allocator >, boost::no_property> > > >, void*, boost::detail::edge_desc_impl, long int> >]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied >, boost::no_property>*, std::vector >, boost::no_property>, std::allocator >, boost::no_property> > > >, void*, boost::detail::edge_desc_impl, long int> > >::value’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied >, boost::no_property>*, std::vector >, boost::no_property>, std::allocator >, boost::no_property> > > >, void*, boost::detail::edge_desc_impl, long int> > >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:72:8: [ skipping 7 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/isomorphism.hpp:209:38: required from ‘bool boost::detail::isomorphism_algo::test_isomorphism() [with Graph1 = boost::adjacency_list >; Graph2 = boost::adjacency_list >; IsoMapping = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&>; Invariant1 = boost::degree_vertex_invariant >, int, const int&, boost::vertex_index_t> >, boost::adjacency_list > >; Invariant2 = boost::degree_vertex_invariant >, int, const int&, boost::vertex_index_t> >, boost::adjacency_list > >; IndexMap1 = boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>; IndexMap2 = boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/isomorphism.hpp:532:33: required from ‘bool boost::isomorphism(const Graph1&, const Graph2&, IsoMapping, Invariant1, Invariant2, std::size_t, IndexMap1, IndexMap2) [with Graph1 = adjacency_list >; Graph2 = adjacency_list >; IsoMapping = iterator_property_map<__gnu_cxx::__normal_iterator >, adj_list_vertex_property_map >, int, int&, vertex_index_t>, void*, void*&>; Invariant1 = degree_vertex_invariant >, int, const int&, vertex_index_t> >, adjacency_list > >; Invariant2 = degree_vertex_invariant >, int, const int&, vertex_index_t> >, adjacency_list > >; IndexMap1 = adj_list_vertex_property_map >, int, const int&, vertex_index_t>; IndexMap2 = adj_list_vertex_property_map >, int, const int&, vertex_index_t>; std::size_t = long unsigned int]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/isomorphism.hpp:651:42: required from ‘bool boost::graph::detail::isomorphism_impl::operator()(const Graph1&, const Graph2&, const ArgPack&) const [with ArgPack = boost::parameter::aux::arg_list >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&> >, boost::parameter::aux::empty_arg_list, std::integral_constant >; Graph1 = boost::adjacency_list >; Graph2 = boost::adjacency_list >]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/isomorphism.hpp:662:5: required from ‘typename boost::result_of(Param0, Param1, const ArgPack&)>::type boost::graph::isomorphism_with_named_params(const Param0&, const Param1&, const ArgPack&) [with Param0 = boost::adjacency_list >; Param1 = boost::adjacency_list >; ArgPack = boost::parameter::aux::arg_list >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&> >, boost::parameter::aux::empty_arg_list, std::integral_constant >; typename boost::result_of(Param0, Param1, const ArgPack&)>::type = bool]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/isomorphism.hpp:666:1: required from ‘typename boost::result_of(Param0, Param1, const typename boost::detail::convert_bgl_params_to_boost_parameter >::type&)>::type boost::isomorphism(const Param0&, const Param1&, const bgl_named_params&) [with Param0 = adjacency_list >; Param1 = adjacency_list >; P = iterator_property_map<__gnu_cxx::__normal_iterator >, adj_list_vertex_property_map >, int, int&, vertex_index_t>, void*, void*&>; T = vertex_isomorphism_t; R = no_property; typename result_of(Param0, Param1, const typename detail::convert_bgl_params_to_boost_parameter >::type&)>::type = bool; typename detail::convert_bgl_params_to_boost_parameter >::type = parameter::aux::arg_list >, adj_list_vertex_property_map >, int, int&, vertex_index_t>, void*, void*&> >, parameter::aux::empty_arg_list, std::integral_constant >]’ ordering.cpp:68:18: required from here /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::Assignable >, boost::no_property>*, std::vector >, boost::no_property>, std::allocator >, boost::no_property> > > >, void*, boost::detail::edge_desc_impl, long int> >]’ 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ^ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements >, boost::no_property>*, std::vector >, boost::no_property>, std::allocator >, boost::no_property> > > >, void*, boost::detail::edge_desc_impl, long int> > >]’: /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:233:5: required from ‘struct boost::EqualityComparable >, boost::no_property>*, std::vector >, boost::no_property>, std::allocator >, boost::no_property> > > >, void*, boost::detail::edge_desc_impl, long int> >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:502:3: required from ‘struct boost::InputIterator >, boost::no_property>*, std::vector >, boost::no_property>, std::allocator >, boost::no_property> > > >, void*, boost::detail::edge_desc_impl, long int> >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::InputIterator >, boost::no_property>*, std::vector >, boost::no_property>, std::allocator >, boost::no_property> > > >, void*, boost::detail::edge_desc_impl, long int> >]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied >, boost::no_property>*, std::vector >, boost::no_property>, std::allocator >, boost::no_property> > > >, void*, boost::detail::edge_desc_impl, long int> > >::value’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied >, boost::no_property>*, std::vector >, boost::no_property>, std::allocator >, boost::no_property> > > >, void*, boost::detail::edge_desc_impl, long int> > >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:72:8: [ skipping 7 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/isomorphism.hpp:209:38: required from ‘bool boost::detail::isomorphism_algo::test_isomorphism() [with Graph1 = boost::adjacency_list >; Graph2 = boost::adjacency_list >; IsoMapping = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&>; Invariant1 = boost::degree_vertex_invariant >, int, const int&, boost::vertex_index_t> >, boost::adjacency_list > >; Invariant2 = boost::degree_vertex_invariant >, int, const int&, boost::vertex_index_t> >, boost::adjacency_list > >; IndexMap1 = boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>; IndexMap2 = boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/isomorphism.hpp:532:33: required from ‘bool boost::isomorphism(const Graph1&, const Graph2&, IsoMapping, Invariant1, Invariant2, std::size_t, IndexMap1, IndexMap2) [with Graph1 = adjacency_list >; Graph2 = adjacency_list >; IsoMapping = iterator_property_map<__gnu_cxx::__normal_iterator >, adj_list_vertex_property_map >, int, int&, vertex_index_t>, void*, void*&>; Invariant1 = degree_vertex_invariant >, int, const int&, vertex_index_t> >, adjacency_list > >; Invariant2 = degree_vertex_invariant >, int, const int&, vertex_index_t> >, adjacency_list > >; IndexMap1 = adj_list_vertex_property_map >, int, const int&, vertex_index_t>; IndexMap2 = adj_list_vertex_property_map >, int, const int&, vertex_index_t>; std::size_t = long unsigned int]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/isomorphism.hpp:651:42: required from ‘bool boost::graph::detail::isomorphism_impl::operator()(const Graph1&, const Graph2&, const ArgPack&) const [with ArgPack = boost::parameter::aux::arg_list >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&> >, boost::parameter::aux::empty_arg_list, std::integral_constant >; Graph1 = boost::adjacency_list >; Graph2 = boost::adjacency_list >]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/isomorphism.hpp:662:5: required from ‘typename boost::result_of(Param0, Param1, const ArgPack&)>::type boost::graph::isomorphism_with_named_params(const Param0&, const Param1&, const ArgPack&) [with Param0 = boost::adjacency_list >; Param1 = boost::adjacency_list >; ArgPack = boost::parameter::aux::arg_list >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&> >, boost::parameter::aux::empty_arg_list, std::integral_constant >; typename boost::result_of(Param0, Param1, const ArgPack&)>::type = bool]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/isomorphism.hpp:666:1: required from ‘typename boost::result_of(Param0, Param1, const typename boost::detail::convert_bgl_params_to_boost_parameter >::type&)>::type boost::isomorphism(const Param0&, const Param1&, const bgl_named_params&) [with Param0 = adjacency_list >; Param1 = adjacency_list >; P = iterator_property_map<__gnu_cxx::__normal_iterator >, adj_list_vertex_property_map >, int, int&, vertex_index_t>, void*, void*&>; T = vertex_isomorphism_t; R = no_property; typename result_of(Param0, Param1, const typename detail::convert_bgl_params_to_boost_parameter >::type&)>::type = bool; typename detail::convert_bgl_params_to_boost_parameter >::type = parameter::aux::arg_list >, adj_list_vertex_property_map >, int, int&, vertex_index_t>, void*, void*&> >, parameter::aux::empty_arg_list, std::integral_constant >]’ ordering.cpp:68:18: required from here /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::EqualityComparable >, boost::no_property>*, std::vector >, boost::no_property>, std::allocator >, boost::no_property> > > >, void*, boost::detail::edge_desc_impl, long int> >]’ 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ^ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements >, boost::no_property>*, std::vector >, boost::no_property>, std::allocator >, boost::no_property> > > >, void*, boost::detail::edge_desc_impl, long int> > >]’: /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:512:7: required from ‘struct boost::InputIterator >, boost::no_property>*, std::vector >, boost::no_property>, std::allocator >, boost::no_property> > > >, void*, boost::detail::edge_desc_impl, long int> >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::InputIterator >, boost::no_property>*, std::vector >, boost::no_property>, std::allocator >, boost::no_property> > > >, void*, boost::detail::edge_desc_impl, long int> >]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied >, boost::no_property>*, std::vector >, boost::no_property>, std::allocator >, boost::no_property> > > >, void*, boost::detail::edge_desc_impl, long int> > >::value’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied >, boost::no_property>*, std::vector >, boost::no_property>, std::allocator >, boost::no_property> > > >, void*, boost::detail::edge_desc_impl, long int> > >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_ >, boost::no_property>*, std::vector >, boost::no_property>, std::allocator >, boost::no_property> > > >, void*, boost::detail::edge_desc_impl, long int> >)>’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/graph_concepts.hpp:53:35: [ skipping 6 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/isomorphism.hpp:209:38: required from ‘bool boost::detail::isomorphism_algo::test_isomorphism() [with Graph1 = boost::adjacency_list >; Graph2 = boost::adjacency_list >; IsoMapping = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&>; Invariant1 = boost::degree_vertex_invariant >, int, const int&, boost::vertex_index_t> >, boost::adjacency_list > >; Invariant2 = boost::degree_vertex_invariant >, int, const int&, boost::vertex_index_t> >, boost::adjacency_list > >; IndexMap1 = boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>; IndexMap2 = boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/isomorphism.hpp:532:33: required from ‘bool boost::isomorphism(const Graph1&, const Graph2&, IsoMapping, Invariant1, Invariant2, std::size_t, IndexMap1, IndexMap2) [with Graph1 = adjacency_list >; Graph2 = adjacency_list >; IsoMapping = iterator_property_map<__gnu_cxx::__normal_iterator >, adj_list_vertex_property_map >, int, int&, vertex_index_t>, void*, void*&>; Invariant1 = degree_vertex_invariant >, int, const int&, vertex_index_t> >, adjacency_list > >; Invariant2 = degree_vertex_invariant >, int, const int&, vertex_index_t> >, adjacency_list > >; IndexMap1 = adj_list_vertex_property_map >, int, const int&, vertex_index_t>; IndexMap2 = adj_list_vertex_property_map >, int, const int&, vertex_index_t>; std::size_t = long unsigned int]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/isomorphism.hpp:651:42: required from ‘bool boost::graph::detail::isomorphism_impl::operator()(const Graph1&, const Graph2&, const ArgPack&) const [with ArgPack = boost::parameter::aux::arg_list >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&> >, boost::parameter::aux::empty_arg_list, std::integral_constant >; Graph1 = boost::adjacency_list >; Graph2 = boost::adjacency_list >]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/isomorphism.hpp:662:5: required from ‘typename boost::result_of(Param0, Param1, const ArgPack&)>::type boost::graph::isomorphism_with_named_params(const Param0&, const Param1&, const ArgPack&) [with Param0 = boost::adjacency_list >; Param1 = boost::adjacency_list >; ArgPack = boost::parameter::aux::arg_list >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&> >, boost::parameter::aux::empty_arg_list, std::integral_constant >; typename boost::result_of(Param0, Param1, const ArgPack&)>::type = bool]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/isomorphism.hpp:666:1: required from ‘typename boost::result_of(Param0, Param1, const typename boost::detail::convert_bgl_params_to_boost_parameter >::type&)>::type boost::isomorphism(const Param0&, const Param1&, const bgl_named_params&) [with Param0 = adjacency_list >; Param1 = adjacency_list >; P = iterator_property_map<__gnu_cxx::__normal_iterator >, adj_list_vertex_property_map >, int, int&, vertex_index_t>, void*, void*&>; T = vertex_isomorphism_t; R = no_property; typename result_of(Param0, Param1, const typename detail::convert_bgl_params_to_boost_parameter >::type&)>::type = bool; typename detail::convert_bgl_params_to_boost_parameter >::type = parameter::aux::arg_list >, adj_list_vertex_property_map >, int, int&, vertex_index_t>, void*, void*&> >, parameter::aux::empty_arg_list, std::integral_constant >]’ ordering.cpp:68:18: required from here /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::InputIterator >, boost::no_property>*, std::vector >, boost::no_property>, std::allocator >, boost::no_property> > > >, void*, boost::detail::edge_desc_impl, long int> >]’ 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ^ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::InputIterator >, boost::no_property>*, std::vector >, boost::no_property>, std::allocator >, boost::no_property> > > >, void*, boost::detail::edge_desc_impl, long int> >]’: /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/graph_concepts.hpp:53:35: required from ‘boost::concepts::MultiPassInputIterator::~MultiPassInputIterator() [with T = boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator >, boost::no_property>*, std::vector >, boost::no_property>, std::allocator >, boost::no_property> > > >, void*, boost::detail::edge_desc_impl, long int>]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::MultiPassInputIterator >, boost::no_property>*, std::vector >, boost::no_property>, std::allocator >, boost::no_property> > > >, void*, boost::detail::edge_desc_impl, long int> >]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/graph_concepts.hpp:89:9: required from ‘boost::concepts::IncidenceGraph::~IncidenceGraph() [with G = boost::adjacency_list >]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/graph_concepts.hpp:75:1: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::IncidenceGraphConcept > >]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/depth_first_search.hpp:129:9: [ skipping 2 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/isomorphism.hpp:209:38: required from ‘bool boost::detail::isomorphism_algo::test_isomorphism() [with Graph1 = boost::adjacency_list >; Graph2 = boost::adjacency_list >; IsoMapping = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&>; Invariant1 = boost::degree_vertex_invariant >, int, const int&, boost::vertex_index_t> >, boost::adjacency_list > >; Invariant2 = boost::degree_vertex_invariant >, int, const int&, boost::vertex_index_t> >, boost::adjacency_list > >; IndexMap1 = boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>; IndexMap2 = boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/isomorphism.hpp:532:33: required from ‘bool boost::isomorphism(const Graph1&, const Graph2&, IsoMapping, Invariant1, Invariant2, std::size_t, IndexMap1, IndexMap2) [with Graph1 = adjacency_list >; Graph2 = adjacency_list >; IsoMapping = iterator_property_map<__gnu_cxx::__normal_iterator >, adj_list_vertex_property_map >, int, int&, vertex_index_t>, void*, void*&>; Invariant1 = degree_vertex_invariant >, int, const int&, vertex_index_t> >, adjacency_list > >; Invariant2 = degree_vertex_invariant >, int, const int&, vertex_index_t> >, adjacency_list > >; IndexMap1 = adj_list_vertex_property_map >, int, const int&, vertex_index_t>; IndexMap2 = adj_list_vertex_property_map >, int, const int&, vertex_index_t>; std::size_t = long unsigned int]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/isomorphism.hpp:651:42: required from ‘bool boost::graph::detail::isomorphism_impl::operator()(const Graph1&, const Graph2&, const ArgPack&) const [with ArgPack = boost::parameter::aux::arg_list >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&> >, boost::parameter::aux::empty_arg_list, std::integral_constant >; Graph1 = boost::adjacency_list >; Graph2 = boost::adjacency_list >]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/isomorphism.hpp:662:5: required from ‘typename boost::result_of(Param0, Param1, const ArgPack&)>::type boost::graph::isomorphism_with_named_params(const Param0&, const Param1&, const ArgPack&) [with Param0 = boost::adjacency_list >; Param1 = boost::adjacency_list >; ArgPack = boost::parameter::aux::arg_list >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&> >, boost::parameter::aux::empty_arg_list, std::integral_constant >; typename boost::result_of(Param0, Param1, const ArgPack&)>::type = bool]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/isomorphism.hpp:666:1: required from ‘typename boost::result_of(Param0, Param1, const typename boost::detail::convert_bgl_params_to_boost_parameter >::type&)>::type boost::isomorphism(const Param0&, const Param1&, const bgl_named_params&) [with Param0 = adjacency_list >; Param1 = adjacency_list >; P = iterator_property_map<__gnu_cxx::__normal_iterator >, adj_list_vertex_property_map >, int, int&, vertex_index_t>, void*, void*&>; T = vertex_isomorphism_t; R = no_property; typename result_of(Param0, Param1, const typename detail::convert_bgl_params_to_boost_parameter >::type&)>::type = bool; typename detail::convert_bgl_params_to_boost_parameter >::type = parameter::aux::arg_list >, adj_list_vertex_property_map >, int, int&, vertex_index_t>, void*, void*&> >, parameter::aux::empty_arg_list, std::integral_constant >]’ ordering.cpp:68:18: required from here /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::InputIterator::~InputIterator() [with TT = boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator >, boost::no_property>*, std::vector >, boost::no_property>, std::allocator >, boost::no_property> > > >, void*, boost::detail::edge_desc_impl, long int>]’ 37 | ~model() | ^ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:512:7: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 512 | BOOST_CONCEPT_USAGE(InputIterator) | ^~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::concepts::MultiPassInputIterator >, boost::no_property> >, long unsigned int, boost::detail::edge_desc_impl, long int> >]’: /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements >, boost::no_property> >, long unsigned int, boost::detail::edge_desc_impl, long int> > >]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/graph_concepts.hpp:52:50: required from ‘struct boost::concepts::MultiPassInputIterator >, boost::no_property> >, long unsigned int, boost::detail::edge_desc_impl, long int> >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::concepts::MultiPassInputIterator >, boost::no_property> >, long unsigned int, boost::detail::edge_desc_impl, long int> >]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied >, boost::no_property> >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::value’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied >, boost::no_property> >, long unsigned int, boost::detail::edge_desc_impl, long int> > >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:72:8: [ skipping 6 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/breadth_first_search.hpp:262:29: required from ‘void boost::detail::bfs_helper(VertexListGraph&, typename boost::graph_traits::vertex_descriptor, ColorMap, BFSVisitor, const boost::bgl_named_params&, mpl_::false_) [with VertexListGraph = boost::adjacency_list > > >; ColorMap = boost::two_bit_color_map > >, long unsigned int> >; BFSVisitor = boost::bfs_visitor >, boost::vec_adj_list_vertex_id_map > >, long unsigned int>, long unsigned int, long unsigned int&>, boost::on_tree_edge> >; P = boost::bfs_visitor >, boost::vec_adj_list_vertex_id_map > >, long unsigned int>, long unsigned int, long unsigned int&>, boost::on_tree_edge> >; T = boost::graph_visitor_t; R = boost::no_property; typename boost::graph_traits::vertex_descriptor = long unsigned int; mpl_::false_ = mpl_::bool_]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/breadth_first_search.hpp:309:23: required from ‘static void boost::detail::bfs_dispatch::apply(VertexListGraph&, typename boost::graph_traits::vertex_descriptor, const boost::bgl_named_params&, boost::param_not_found) [with VertexListGraph = boost::adjacency_list > > >; P = boost::bfs_visitor >, boost::vec_adj_list_vertex_id_map > >, long unsigned int>, long unsigned int, long unsigned int&>, boost::on_tree_edge> >; T = boost::graph_visitor_t; R = boost::no_property; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/breadth_first_search.hpp:339:37: required from ‘void boost::breadth_first_search(const VertexListGraph&, typename graph_traits::vertex_descriptor, const bgl_named_params&) [with VertexListGraph = adjacency_list > > >; P = bfs_visitor >, vec_adj_list_vertex_id_map > >, long unsigned int>, long unsigned int, long unsigned int&>, on_tree_edge> >; T = graph_visitor_t; R = no_property; typename graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/sloan_ordering.hpp:175:29: required from ‘typename boost::graph_traits::vertex_descriptor boost::sloan_start_end_vertices(Graph&, typename graph_traits::vertex_descriptor&, ColorMap, DegreeMap) [with Graph = adjacency_list > > >; ColorMap = vec_adj_list_vertex_property_map > > >, adjacency_list > > >*, default_color_type, default_color_type&, vertex_color_t>; DegreeMap = degree_property_map > > > >; typename graph_traits::vertex_descriptor = long unsigned int; typename graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/sloan_ordering.hpp:429:33: required from ‘OutputIterator boost::sloan_ordering(Graph&, OutputIterator, Color, Degree, Priority, Weight, Weight) [with Graph = adjacency_list > > >; OutputIterator = __gnu_cxx::__normal_iterator >; Color = vec_adj_list_vertex_property_map > > >, adjacency_list > > >*, default_color_type, default_color_type&, vertex_color_t>; Degree = degree_property_map > > > >; Priority = vec_adj_list_vertex_property_map > > >, adjacency_list > > >*, double, double&, vertex_priority_t>; Weight = int]’ ordering.cpp:245:17: required from here /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::concepts::MultiPassInputIterator::~MultiPassInputIterator() [with T = boost::detail::out_edge_iter >, boost::no_property> >, long unsigned int, boost::detail::edge_desc_impl, long int>]’ 37 | ~model() | ^ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/graph_concepts.hpp:52:50: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 52 | BOOST_concept(MultiPassInputIterator, (T)) { BOOST_CONCEPT_USAGE( | ^~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::Convertible]’: /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements >]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:208:5: required from ‘struct boost::Convertible’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:206:3: required from ‘struct boost::ConvertibleConcept’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::ConvertibleConcept]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied >::value’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:45:51: [ skipping 15 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/breadth_first_search.hpp:262:29: required from ‘void boost::detail::bfs_helper(VertexListGraph&, typename boost::graph_traits::vertex_descriptor, ColorMap, BFSVisitor, const boost::bgl_named_params&, mpl_::false_) [with VertexListGraph = boost::adjacency_list > > >; ColorMap = boost::two_bit_color_map > >, long unsigned int> >; BFSVisitor = boost::bfs_visitor >, boost::vec_adj_list_vertex_id_map > >, long unsigned int>, long unsigned int, long unsigned int&>, boost::on_tree_edge> >; P = boost::bfs_visitor >, boost::vec_adj_list_vertex_id_map > >, long unsigned int>, long unsigned int, long unsigned int&>, boost::on_tree_edge> >; T = boost::graph_visitor_t; R = boost::no_property; typename boost::graph_traits::vertex_descriptor = long unsigned int; mpl_::false_ = mpl_::bool_]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/breadth_first_search.hpp:309:23: required from ‘static void boost::detail::bfs_dispatch::apply(VertexListGraph&, typename boost::graph_traits::vertex_descriptor, const boost::bgl_named_params&, boost::param_not_found) [with VertexListGraph = boost::adjacency_list > > >; P = boost::bfs_visitor >, boost::vec_adj_list_vertex_id_map > >, long unsigned int>, long unsigned int, long unsigned int&>, boost::on_tree_edge> >; T = boost::graph_visitor_t; R = boost::no_property; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/breadth_first_search.hpp:339:37: required from ‘void boost::breadth_first_search(const VertexListGraph&, typename graph_traits::vertex_descriptor, const bgl_named_params&) [with VertexListGraph = adjacency_list > > >; P = bfs_visitor >, vec_adj_list_vertex_id_map > >, long unsigned int>, long unsigned int, long unsigned int&>, on_tree_edge> >; T = graph_visitor_t; R = no_property; typename graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/sloan_ordering.hpp:175:29: required from ‘typename boost::graph_traits::vertex_descriptor boost::sloan_start_end_vertices(Graph&, typename graph_traits::vertex_descriptor&, ColorMap, DegreeMap) [with Graph = adjacency_list > > >; ColorMap = vec_adj_list_vertex_property_map > > >, adjacency_list > > >*, default_color_type, default_color_type&, vertex_color_t>; DegreeMap = degree_property_map > > > >; typename graph_traits::vertex_descriptor = long unsigned int; typename graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/sloan_ordering.hpp:429:33: required from ‘OutputIterator boost::sloan_ordering(Graph&, OutputIterator, Color, Degree, Priority, Weight, Weight) [with Graph = adjacency_list > > >; OutputIterator = __gnu_cxx::__normal_iterator >; Color = vec_adj_list_vertex_property_map > > >, adjacency_list > > >*, default_color_type, default_color_type&, vertex_color_t>; Degree = degree_property_map > > > >; Priority = vec_adj_list_vertex_property_map > > >, adjacency_list > > >*, double, double&, vertex_priority_t>; Weight = int]’ ordering.cpp:245:17: required from here /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::Convertible::~Convertible() [with X = boost::read_write_property_map_tag; Y = boost::readable_property_map_tag]’ 37 | ~model() | ^ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:208:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 208 | BOOST_CONCEPT_USAGE(Convertible) { | ^~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::Convertible]’: /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements >]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:208:5: required from ‘struct boost::Convertible’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:206:3: required from ‘struct boost::ConvertibleConcept’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::ConvertibleConcept]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied >::value’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:45:51: [ skipping 15 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/breadth_first_search.hpp:262:29: required from ‘void boost::detail::bfs_helper(VertexListGraph&, typename boost::graph_traits::vertex_descriptor, ColorMap, BFSVisitor, const boost::bgl_named_params&, mpl_::false_) [with VertexListGraph = boost::adjacency_list > > >; ColorMap = boost::two_bit_color_map > >, long unsigned int> >; BFSVisitor = boost::bfs_visitor >, boost::vec_adj_list_vertex_id_map > >, long unsigned int>, long unsigned int, long unsigned int&>, boost::on_tree_edge> >; P = boost::bfs_visitor >, boost::vec_adj_list_vertex_id_map > >, long unsigned int>, long unsigned int, long unsigned int&>, boost::on_tree_edge> >; T = boost::graph_visitor_t; R = boost::no_property; typename boost::graph_traits::vertex_descriptor = long unsigned int; mpl_::false_ = mpl_::bool_]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/breadth_first_search.hpp:309:23: required from ‘static void boost::detail::bfs_dispatch::apply(VertexListGraph&, typename boost::graph_traits::vertex_descriptor, const boost::bgl_named_params&, boost::param_not_found) [with VertexListGraph = boost::adjacency_list > > >; P = boost::bfs_visitor >, boost::vec_adj_list_vertex_id_map > >, long unsigned int>, long unsigned int, long unsigned int&>, boost::on_tree_edge> >; T = boost::graph_visitor_t; R = boost::no_property; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/breadth_first_search.hpp:339:37: required from ‘void boost::breadth_first_search(const VertexListGraph&, typename graph_traits::vertex_descriptor, const bgl_named_params&) [with VertexListGraph = adjacency_list > > >; P = bfs_visitor >, vec_adj_list_vertex_id_map > >, long unsigned int>, long unsigned int, long unsigned int&>, on_tree_edge> >; T = graph_visitor_t; R = no_property; typename graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/sloan_ordering.hpp:175:29: required from ‘typename boost::graph_traits::vertex_descriptor boost::sloan_start_end_vertices(Graph&, typename graph_traits::vertex_descriptor&, ColorMap, DegreeMap) [with Graph = adjacency_list > > >; ColorMap = vec_adj_list_vertex_property_map > > >, adjacency_list > > >*, default_color_type, default_color_type&, vertex_color_t>; DegreeMap = degree_property_map > > > >; typename graph_traits::vertex_descriptor = long unsigned int; typename graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/sloan_ordering.hpp:429:33: required from ‘OutputIterator boost::sloan_ordering(Graph&, OutputIterator, Color, Degree, Priority, Weight, Weight) [with Graph = adjacency_list > > >; OutputIterator = __gnu_cxx::__normal_iterator >; Color = vec_adj_list_vertex_property_map > > >, adjacency_list > > >*, default_color_type, default_color_type&, vertex_color_t>; Degree = degree_property_map > > > >; Priority = vec_adj_list_vertex_property_map > > >, adjacency_list > > >*, double, double&, vertex_priority_t>; Weight = int]’ ordering.cpp:245:17: required from here /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::Convertible::~Convertible() [with X = boost::read_write_property_map_tag; Y = boost::writable_property_map_tag]’ 37 | ~model() | ^ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:208:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 208 | BOOST_CONCEPT_USAGE(Convertible) { | ^~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::Assignable >, boost::no_property>*, std::vector >, boost::no_property>, std::allocator >, boost::no_property> > > >, void*, boost::detail::edge_desc_impl, long int> >]’: /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements >, boost::no_property>*, std::vector >, boost::no_property>, std::allocator >, boost::no_property> > > >, void*, boost::detail::edge_desc_impl, long int> > >]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:145:5: required from ‘struct boost::Assignable >, boost::no_property>*, std::vector >, boost::no_property>, std::allocator >, boost::no_property> > > >, void*, boost::detail::edge_desc_impl, long int> >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:502:3: required from ‘struct boost::InputIterator >, boost::no_property>*, std::vector >, boost::no_property>, std::allocator >, boost::no_property> > > >, void*, boost::detail::edge_desc_impl, long int> >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::InputIterator >, boost::no_property>*, std::vector >, boost::no_property>, std::allocator >, boost::no_property> > > >, void*, boost::detail::edge_desc_impl, long int> >]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied >, boost::no_property>*, std::vector >, boost::no_property>, std::allocator >, boost::no_property> > > >, void*, boost::detail::edge_desc_impl, long int> > >::value’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:45:51: [ skipping 8 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/isomorphism.hpp:209:38: required from ‘bool boost::detail::isomorphism_algo::test_isomorphism() [with Graph1 = boost::adjacency_list >; Graph2 = boost::adjacency_list >; IsoMapping = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&>; Invariant1 = boost::degree_vertex_invariant >, int, const int&, boost::vertex_index_t> >, boost::adjacency_list > >; Invariant2 = boost::degree_vertex_invariant >, int, const int&, boost::vertex_index_t> >, boost::adjacency_list > >; IndexMap1 = boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>; IndexMap2 = boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/isomorphism.hpp:532:33: required from ‘bool boost::isomorphism(const Graph1&, const Graph2&, IsoMapping, Invariant1, Invariant2, std::size_t, IndexMap1, IndexMap2) [with Graph1 = adjacency_list >; Graph2 = adjacency_list >; IsoMapping = iterator_property_map<__gnu_cxx::__normal_iterator >, adj_list_vertex_property_map >, int, int&, vertex_index_t>, void*, void*&>; Invariant1 = degree_vertex_invariant >, int, const int&, vertex_index_t> >, adjacency_list > >; Invariant2 = degree_vertex_invariant >, int, const int&, vertex_index_t> >, adjacency_list > >; IndexMap1 = adj_list_vertex_property_map >, int, const int&, vertex_index_t>; IndexMap2 = adj_list_vertex_property_map >, int, const int&, vertex_index_t>; std::size_t = long unsigned int]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/isomorphism.hpp:651:42: required from ‘bool boost::graph::detail::isomorphism_impl::operator()(const Graph1&, const Graph2&, const ArgPack&) const [with ArgPack = boost::parameter::aux::arg_list >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&> >, boost::parameter::aux::empty_arg_list, std::integral_constant >; Graph1 = boost::adjacency_list >; Graph2 = boost::adjacency_list >]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/isomorphism.hpp:662:5: required from ‘typename boost::result_of(Param0, Param1, const ArgPack&)>::type boost::graph::isomorphism_with_named_params(const Param0&, const Param1&, const ArgPack&) [with Param0 = boost::adjacency_list >; Param1 = boost::adjacency_list >; ArgPack = boost::parameter::aux::arg_list >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&> >, boost::parameter::aux::empty_arg_list, std::integral_constant >; typename boost::result_of(Param0, Param1, const ArgPack&)>::type = bool]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/isomorphism.hpp:666:1: required from ‘typename boost::result_of(Param0, Param1, const typename boost::detail::convert_bgl_params_to_boost_parameter >::type&)>::type boost::isomorphism(const Param0&, const Param1&, const bgl_named_params&) [with Param0 = adjacency_list >; Param1 = adjacency_list >; P = iterator_property_map<__gnu_cxx::__normal_iterator >, adj_list_vertex_property_map >, int, int&, vertex_index_t>, void*, void*&>; T = vertex_isomorphism_t; R = no_property; typename result_of(Param0, Param1, const typename detail::convert_bgl_params_to_boost_parameter >::type&)>::type = bool; typename detail::convert_bgl_params_to_boost_parameter >::type = parameter::aux::arg_list >, adj_list_vertex_property_map >, int, int&, vertex_index_t>, void*, void*&> >, parameter::aux::empty_arg_list, std::integral_constant >]’ ordering.cpp:68:18: required from here /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::Assignable::~Assignable() [with TT = boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator >, boost::no_property>*, std::vector >, boost::no_property>, std::allocator >, boost::no_property> > > >, void*, boost::detail::edge_desc_impl, long int>]’ 37 | ~model() | ^ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:145:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 145 | BOOST_CONCEPT_USAGE(Assignable) { | ^~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::EqualityComparable >, boost::no_property>*, std::vector >, boost::no_property>, std::allocator >, boost::no_property> > > >, void*, boost::detail::edge_desc_impl, long int> >]’: /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements >, boost::no_property>*, std::vector >, boost::no_property>, std::allocator >, boost::no_property> > > >, void*, boost::detail::edge_desc_impl, long int> > >]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:233:5: required from ‘struct boost::EqualityComparable >, boost::no_property>*, std::vector >, boost::no_property>, std::allocator >, boost::no_property> > > >, void*, boost::detail::edge_desc_impl, long int> >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:502:3: required from ‘struct boost::InputIterator >, boost::no_property>*, std::vector >, boost::no_property>, std::allocator >, boost::no_property> > > >, void*, boost::detail::edge_desc_impl, long int> >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::InputIterator >, boost::no_property>*, std::vector >, boost::no_property>, std::allocator >, boost::no_property> > > >, void*, boost::detail::edge_desc_impl, long int> >]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied >, boost::no_property>*, std::vector >, boost::no_property>, std::allocator >, boost::no_property> > > >, void*, boost::detail::edge_desc_impl, long int> > >::value’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:45:51: [ skipping 8 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/isomorphism.hpp:209:38: required from ‘bool boost::detail::isomorphism_algo::test_isomorphism() [with Graph1 = boost::adjacency_list >; Graph2 = boost::adjacency_list >; IsoMapping = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&>; Invariant1 = boost::degree_vertex_invariant >, int, const int&, boost::vertex_index_t> >, boost::adjacency_list > >; Invariant2 = boost::degree_vertex_invariant >, int, const int&, boost::vertex_index_t> >, boost::adjacency_list > >; IndexMap1 = boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>; IndexMap2 = boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/isomorphism.hpp:532:33: required from ‘bool boost::isomorphism(const Graph1&, const Graph2&, IsoMapping, Invariant1, Invariant2, std::size_t, IndexMap1, IndexMap2) [with Graph1 = adjacency_list >; Graph2 = adjacency_list >; IsoMapping = iterator_property_map<__gnu_cxx::__normal_iterator >, adj_list_vertex_property_map >, int, int&, vertex_index_t>, void*, void*&>; Invariant1 = degree_vertex_invariant >, int, const int&, vertex_index_t> >, adjacency_list > >; Invariant2 = degree_vertex_invariant >, int, const int&, vertex_index_t> >, adjacency_list > >; IndexMap1 = adj_list_vertex_property_map >, int, const int&, vertex_index_t>; IndexMap2 = adj_list_vertex_property_map >, int, const int&, vertex_index_t>; std::size_t = long unsigned int]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/isomorphism.hpp:651:42: required from ‘bool boost::graph::detail::isomorphism_impl::operator()(const Graph1&, const Graph2&, const ArgPack&) const [with ArgPack = boost::parameter::aux::arg_list >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&> >, boost::parameter::aux::empty_arg_list, std::integral_constant >; Graph1 = boost::adjacency_list >; Graph2 = boost::adjacency_list >]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/isomorphism.hpp:662:5: required from ‘typename boost::result_of(Param0, Param1, const ArgPack&)>::type boost::graph::isomorphism_with_named_params(const Param0&, const Param1&, const ArgPack&) [with Param0 = boost::adjacency_list >; Param1 = boost::adjacency_list >; ArgPack = boost::parameter::aux::arg_list >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&> >, boost::parameter::aux::empty_arg_list, std::integral_constant >; typename boost::result_of(Param0, Param1, const ArgPack&)>::type = bool]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/isomorphism.hpp:666:1: required from ‘typename boost::result_of(Param0, Param1, const typename boost::detail::convert_bgl_params_to_boost_parameter >::type&)>::type boost::isomorphism(const Param0&, const Param1&, const bgl_named_params&) [with Param0 = adjacency_list >; Param1 = adjacency_list >; P = iterator_property_map<__gnu_cxx::__normal_iterator >, adj_list_vertex_property_map >, int, int&, vertex_index_t>, void*, void*&>; T = vertex_isomorphism_t; R = no_property; typename result_of(Param0, Param1, const typename detail::convert_bgl_params_to_boost_parameter >::type&)>::type = bool; typename detail::convert_bgl_params_to_boost_parameter >::type = parameter::aux::arg_list >, adj_list_vertex_property_map >, int, int&, vertex_index_t>, void*, void*&> >, parameter::aux::empty_arg_list, std::integral_constant >]’ ordering.cpp:68:18: required from here /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::EqualityComparable::~EqualityComparable() [with TT = boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator >, boost::no_property>*, std::vector >, boost::no_property>, std::allocator >, boost::no_property> > > >, void*, boost::detail::edge_desc_impl, long int>]’ 37 | ~model() | ^ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:233:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 233 | BOOST_CONCEPT_USAGE(EqualityComparable) { | ^~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::InputIterator >, boost::no_property>*, std::vector >, boost::no_property>, std::allocator >, boost::no_property> > > >, void*, boost::detail::edge_desc_impl, long int> >]’: /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements >, boost::no_property>*, std::vector >, boost::no_property>, std::allocator >, boost::no_property> > > >, void*, boost::detail::edge_desc_impl, long int> > >]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:512:7: required from ‘struct boost::InputIterator >, boost::no_property>*, std::vector >, boost::no_property>, std::allocator >, boost::no_property> > > >, void*, boost::detail::edge_desc_impl, long int> >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::InputIterator >, boost::no_property>*, std::vector >, boost::no_property>, std::allocator >, boost::no_property> > > >, void*, boost::detail::edge_desc_impl, long int> >]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied >, boost::no_property>*, std::vector >, boost::no_property>, std::allocator >, boost::no_property> > > >, void*, boost::detail::edge_desc_impl, long int> > >::value’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied >, boost::no_property>*, std::vector >, boost::no_property>, std::allocator >, boost::no_property> > > >, void*, boost::detail::edge_desc_impl, long int> > >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:72:8: [ skipping 7 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/isomorphism.hpp:209:38: required from ‘bool boost::detail::isomorphism_algo::test_isomorphism() [with Graph1 = boost::adjacency_list >; Graph2 = boost::adjacency_list >; IsoMapping = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&>; Invariant1 = boost::degree_vertex_invariant >, int, const int&, boost::vertex_index_t> >, boost::adjacency_list > >; Invariant2 = boost::degree_vertex_invariant >, int, const int&, boost::vertex_index_t> >, boost::adjacency_list > >; IndexMap1 = boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>; IndexMap2 = boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/isomorphism.hpp:532:33: required from ‘bool boost::isomorphism(const Graph1&, const Graph2&, IsoMapping, Invariant1, Invariant2, std::size_t, IndexMap1, IndexMap2) [with Graph1 = adjacency_list >; Graph2 = adjacency_list >; IsoMapping = iterator_property_map<__gnu_cxx::__normal_iterator >, adj_list_vertex_property_map >, int, int&, vertex_index_t>, void*, void*&>; Invariant1 = degree_vertex_invariant >, int, const int&, vertex_index_t> >, adjacency_list > >; Invariant2 = degree_vertex_invariant >, int, const int&, vertex_index_t> >, adjacency_list > >; IndexMap1 = adj_list_vertex_property_map >, int, const int&, vertex_index_t>; IndexMap2 = adj_list_vertex_property_map >, int, const int&, vertex_index_t>; std::size_t = long unsigned int]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/isomorphism.hpp:651:42: required from ‘bool boost::graph::detail::isomorphism_impl::operator()(const Graph1&, const Graph2&, const ArgPack&) const [with ArgPack = boost::parameter::aux::arg_list >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&> >, boost::parameter::aux::empty_arg_list, std::integral_constant >; Graph1 = boost::adjacency_list >; Graph2 = boost::adjacency_list >]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/isomorphism.hpp:662:5: required from ‘typename boost::result_of(Param0, Param1, const ArgPack&)>::type boost::graph::isomorphism_with_named_params(const Param0&, const Param1&, const ArgPack&) [with Param0 = boost::adjacency_list >; Param1 = boost::adjacency_list >; ArgPack = boost::parameter::aux::arg_list >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&> >, boost::parameter::aux::empty_arg_list, std::integral_constant >; typename boost::result_of(Param0, Param1, const ArgPack&)>::type = bool]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/isomorphism.hpp:666:1: required from ‘typename boost::result_of(Param0, Param1, const typename boost::detail::convert_bgl_params_to_boost_parameter >::type&)>::type boost::isomorphism(const Param0&, const Param1&, const bgl_named_params&) [with Param0 = adjacency_list >; Param1 = adjacency_list >; P = iterator_property_map<__gnu_cxx::__normal_iterator >, adj_list_vertex_property_map >, int, int&, vertex_index_t>, void*, void*&>; T = vertex_isomorphism_t; R = no_property; typename result_of(Param0, Param1, const typename detail::convert_bgl_params_to_boost_parameter >::type&)>::type = bool; typename detail::convert_bgl_params_to_boost_parameter >::type = parameter::aux::arg_list >, adj_list_vertex_property_map >, int, int&, vertex_index_t>, void*, void*&> >, parameter::aux::empty_arg_list, std::integral_constant >]’ ordering.cpp:68:18: required from here /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::InputIterator::~InputIterator() [with TT = boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator >, boost::no_property>*, std::vector >, boost::no_property>, std::allocator >, boost::no_property> > > >, void*, boost::detail::edge_desc_impl, long int>]’ 37 | ~model() | ^ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:512:7: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 512 | BOOST_CONCEPT_USAGE(InputIterator) | ^~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements >, boost::no_property> >, long unsigned int, boost::detail::edge_desc_impl, long int> > >]’: /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:145:5: required from ‘struct boost::Assignable >, boost::no_property> >, long unsigned int, boost::detail::edge_desc_impl, long int> >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:502:3: required from ‘struct boost::InputIterator >, boost::no_property> >, long unsigned int, boost::detail::edge_desc_impl, long int> >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::InputIterator >, boost::no_property> >, long unsigned int, boost::detail::edge_desc_impl, long int> >]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied >, boost::no_property> >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::value’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied >, boost::no_property> >, long unsigned int, boost::detail::edge_desc_impl, long int> > >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:72:8: [ skipping 8 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/breadth_first_search.hpp:262:29: required from ‘void boost::detail::bfs_helper(VertexListGraph&, typename boost::graph_traits::vertex_descriptor, ColorMap, BFSVisitor, const boost::bgl_named_params&, mpl_::false_) [with VertexListGraph = boost::adjacency_list > > >; ColorMap = boost::two_bit_color_map > >, long unsigned int> >; BFSVisitor = boost::bfs_visitor >, boost::vec_adj_list_vertex_id_map > >, long unsigned int>, long unsigned int, long unsigned int&>, boost::on_tree_edge> >; P = boost::bfs_visitor >, boost::vec_adj_list_vertex_id_map > >, long unsigned int>, long unsigned int, long unsigned int&>, boost::on_tree_edge> >; T = boost::graph_visitor_t; R = boost::no_property; typename boost::graph_traits::vertex_descriptor = long unsigned int; mpl_::false_ = mpl_::bool_]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/breadth_first_search.hpp:309:23: required from ‘static void boost::detail::bfs_dispatch::apply(VertexListGraph&, typename boost::graph_traits::vertex_descriptor, const boost::bgl_named_params&, boost::param_not_found) [with VertexListGraph = boost::adjacency_list > > >; P = boost::bfs_visitor >, boost::vec_adj_list_vertex_id_map > >, long unsigned int>, long unsigned int, long unsigned int&>, boost::on_tree_edge> >; T = boost::graph_visitor_t; R = boost::no_property; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/breadth_first_search.hpp:339:37: required from ‘void boost::breadth_first_search(const VertexListGraph&, typename graph_traits::vertex_descriptor, const bgl_named_params&) [with VertexListGraph = adjacency_list > > >; P = bfs_visitor >, vec_adj_list_vertex_id_map > >, long unsigned int>, long unsigned int, long unsigned int&>, on_tree_edge> >; T = graph_visitor_t; R = no_property; typename graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/sloan_ordering.hpp:175:29: required from ‘typename boost::graph_traits::vertex_descriptor boost::sloan_start_end_vertices(Graph&, typename graph_traits::vertex_descriptor&, ColorMap, DegreeMap) [with Graph = adjacency_list > > >; ColorMap = vec_adj_list_vertex_property_map > > >, adjacency_list > > >*, default_color_type, default_color_type&, vertex_color_t>; DegreeMap = degree_property_map > > > >; typename graph_traits::vertex_descriptor = long unsigned int; typename graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/sloan_ordering.hpp:429:33: required from ‘OutputIterator boost::sloan_ordering(Graph&, OutputIterator, Color, Degree, Priority, Weight, Weight) [with Graph = adjacency_list > > >; OutputIterator = __gnu_cxx::__normal_iterator >; Color = vec_adj_list_vertex_property_map > > >, adjacency_list > > >*, default_color_type, default_color_type&, vertex_color_t>; Degree = degree_property_map > > > >; Priority = vec_adj_list_vertex_property_map > > >, adjacency_list > > >*, double, double&, vertex_priority_t>; Weight = int]’ ordering.cpp:245:17: required from here /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::Assignable >, boost::no_property> >, long unsigned int, boost::detail::edge_desc_impl, long int> >]’ 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ^ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements >, boost::no_property> >, long unsigned int, boost::detail::edge_desc_impl, long int> > >]’: /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:233:5: required from ‘struct boost::EqualityComparable >, boost::no_property> >, long unsigned int, boost::detail::edge_desc_impl, long int> >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:502:3: required from ‘struct boost::InputIterator >, boost::no_property> >, long unsigned int, boost::detail::edge_desc_impl, long int> >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::InputIterator >, boost::no_property> >, long unsigned int, boost::detail::edge_desc_impl, long int> >]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied >, boost::no_property> >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::value’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied >, boost::no_property> >, long unsigned int, boost::detail::edge_desc_impl, long int> > >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:72:8: [ skipping 8 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/breadth_first_search.hpp:262:29: required from ‘void boost::detail::bfs_helper(VertexListGraph&, typename boost::graph_traits::vertex_descriptor, ColorMap, BFSVisitor, const boost::bgl_named_params&, mpl_::false_) [with VertexListGraph = boost::adjacency_list > > >; ColorMap = boost::two_bit_color_map > >, long unsigned int> >; BFSVisitor = boost::bfs_visitor >, boost::vec_adj_list_vertex_id_map > >, long unsigned int>, long unsigned int, long unsigned int&>, boost::on_tree_edge> >; P = boost::bfs_visitor >, boost::vec_adj_list_vertex_id_map > >, long unsigned int>, long unsigned int, long unsigned int&>, boost::on_tree_edge> >; T = boost::graph_visitor_t; R = boost::no_property; typename boost::graph_traits::vertex_descriptor = long unsigned int; mpl_::false_ = mpl_::bool_]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/breadth_first_search.hpp:309:23: required from ‘static void boost::detail::bfs_dispatch::apply(VertexListGraph&, typename boost::graph_traits::vertex_descriptor, const boost::bgl_named_params&, boost::param_not_found) [with VertexListGraph = boost::adjacency_list > > >; P = boost::bfs_visitor >, boost::vec_adj_list_vertex_id_map > >, long unsigned int>, long unsigned int, long unsigned int&>, boost::on_tree_edge> >; T = boost::graph_visitor_t; R = boost::no_property; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/breadth_first_search.hpp:339:37: required from ‘void boost::breadth_first_search(const VertexListGraph&, typename graph_traits::vertex_descriptor, const bgl_named_params&) [with VertexListGraph = adjacency_list > > >; P = bfs_visitor >, vec_adj_list_vertex_id_map > >, long unsigned int>, long unsigned int, long unsigned int&>, on_tree_edge> >; T = graph_visitor_t; R = no_property; typename graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/sloan_ordering.hpp:175:29: required from ‘typename boost::graph_traits::vertex_descriptor boost::sloan_start_end_vertices(Graph&, typename graph_traits::vertex_descriptor&, ColorMap, DegreeMap) [with Graph = adjacency_list > > >; ColorMap = vec_adj_list_vertex_property_map > > >, adjacency_list > > >*, default_color_type, default_color_type&, vertex_color_t>; DegreeMap = degree_property_map > > > >; typename graph_traits::vertex_descriptor = long unsigned int; typename graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/sloan_ordering.hpp:429:33: required from ‘OutputIterator boost::sloan_ordering(Graph&, OutputIterator, Color, Degree, Priority, Weight, Weight) [with Graph = adjacency_list > > >; OutputIterator = __gnu_cxx::__normal_iterator >; Color = vec_adj_list_vertex_property_map > > >, adjacency_list > > >*, default_color_type, default_color_type&, vertex_color_t>; Degree = degree_property_map > > > >; Priority = vec_adj_list_vertex_property_map > > >, adjacency_list > > >*, double, double&, vertex_priority_t>; Weight = int]’ ordering.cpp:245:17: required from here /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::EqualityComparable >, boost::no_property> >, long unsigned int, boost::detail::edge_desc_impl, long int> >]’ 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ^ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements >, boost::no_property> >, long unsigned int, boost::detail::edge_desc_impl, long int> > >]’: /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:512:7: required from ‘struct boost::InputIterator >, boost::no_property> >, long unsigned int, boost::detail::edge_desc_impl, long int> >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::InputIterator >, boost::no_property> >, long unsigned int, boost::detail::edge_desc_impl, long int> >]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied >, boost::no_property> >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::value’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied >, boost::no_property> >, long unsigned int, boost::detail::edge_desc_impl, long int> > >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_ >, boost::no_property> >, long unsigned int, boost::detail::edge_desc_impl, long int> >)>’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/graph_concepts.hpp:53:35: [ skipping 7 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/breadth_first_search.hpp:262:29: required from ‘void boost::detail::bfs_helper(VertexListGraph&, typename boost::graph_traits::vertex_descriptor, ColorMap, BFSVisitor, const boost::bgl_named_params&, mpl_::false_) [with VertexListGraph = boost::adjacency_list > > >; ColorMap = boost::two_bit_color_map > >, long unsigned int> >; BFSVisitor = boost::bfs_visitor >, boost::vec_adj_list_vertex_id_map > >, long unsigned int>, long unsigned int, long unsigned int&>, boost::on_tree_edge> >; P = boost::bfs_visitor >, boost::vec_adj_list_vertex_id_map > >, long unsigned int>, long unsigned int, long unsigned int&>, boost::on_tree_edge> >; T = boost::graph_visitor_t; R = boost::no_property; typename boost::graph_traits::vertex_descriptor = long unsigned int; mpl_::false_ = mpl_::bool_]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/breadth_first_search.hpp:309:23: required from ‘static void boost::detail::bfs_dispatch::apply(VertexListGraph&, typename boost::graph_traits::vertex_descriptor, const boost::bgl_named_params&, boost::param_not_found) [with VertexListGraph = boost::adjacency_list > > >; P = boost::bfs_visitor >, boost::vec_adj_list_vertex_id_map > >, long unsigned int>, long unsigned int, long unsigned int&>, boost::on_tree_edge> >; T = boost::graph_visitor_t; R = boost::no_property; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/breadth_first_search.hpp:339:37: required from ‘void boost::breadth_first_search(const VertexListGraph&, typename graph_traits::vertex_descriptor, const bgl_named_params&) [with VertexListGraph = adjacency_list > > >; P = bfs_visitor >, vec_adj_list_vertex_id_map > >, long unsigned int>, long unsigned int, long unsigned int&>, on_tree_edge> >; T = graph_visitor_t; R = no_property; typename graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/sloan_ordering.hpp:175:29: required from ‘typename boost::graph_traits::vertex_descriptor boost::sloan_start_end_vertices(Graph&, typename graph_traits::vertex_descriptor&, ColorMap, DegreeMap) [with Graph = adjacency_list > > >; ColorMap = vec_adj_list_vertex_property_map > > >, adjacency_list > > >*, default_color_type, default_color_type&, vertex_color_t>; DegreeMap = degree_property_map > > > >; typename graph_traits::vertex_descriptor = long unsigned int; typename graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/sloan_ordering.hpp:429:33: required from ‘OutputIterator boost::sloan_ordering(Graph&, OutputIterator, Color, Degree, Priority, Weight, Weight) [with Graph = adjacency_list > > >; OutputIterator = __gnu_cxx::__normal_iterator >; Color = vec_adj_list_vertex_property_map > > >, adjacency_list > > >*, default_color_type, default_color_type&, vertex_color_t>; Degree = degree_property_map > > > >; Priority = vec_adj_list_vertex_property_map > > >, adjacency_list > > >*, double, double&, vertex_priority_t>; Weight = int]’ ordering.cpp:245:17: required from here /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::InputIterator >, boost::no_property> >, long unsigned int, boost::detail::edge_desc_impl, long int> >]’ 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ^ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::InputIterator >, boost::no_property> >, long unsigned int, boost::detail::edge_desc_impl, long int> >]’: /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/graph_concepts.hpp:53:35: required from ‘boost::concepts::MultiPassInputIterator::~MultiPassInputIterator() [with T = boost::detail::out_edge_iter >, boost::no_property> >, long unsigned int, boost::detail::edge_desc_impl, long int>]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::MultiPassInputIterator >, boost::no_property> >, long unsigned int, boost::detail::edge_desc_impl, long int> >]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/graph_concepts.hpp:89:9: required from ‘boost::concepts::IncidenceGraph::~IncidenceGraph() [with G = boost::adjacency_list > > >]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/graph_concepts.hpp:75:1: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::IncidenceGraphConcept > > > >]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/depth_first_search.hpp:129:9: required from ‘void boost::breadth_first_visit(const IncidenceGraph&, SourceIterator, SourceIterator, Buffer&, BFSVisitor, ColorMap) [with IncidenceGraph = adjacency_list > > >; Buffer = queue > >; BFSVisitor = bfs_visitor >, vec_adj_list_vertex_id_map > >, long unsigned int>, long unsigned int, long unsigned int&>, on_tree_edge> >; ColorMap = two_bit_color_map > >, long unsigned int> >; SourceIterator = long unsigned int*]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/breadth_first_search.hpp:136:24: [ skipping 2 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/breadth_first_search.hpp:262:29: required from ‘void boost::detail::bfs_helper(VertexListGraph&, typename boost::graph_traits::vertex_descriptor, ColorMap, BFSVisitor, const boost::bgl_named_params&, mpl_::false_) [with VertexListGraph = boost::adjacency_list > > >; ColorMap = boost::two_bit_color_map > >, long unsigned int> >; BFSVisitor = boost::bfs_visitor >, boost::vec_adj_list_vertex_id_map > >, long unsigned int>, long unsigned int, long unsigned int&>, boost::on_tree_edge> >; P = boost::bfs_visitor >, boost::vec_adj_list_vertex_id_map > >, long unsigned int>, long unsigned int, long unsigned int&>, boost::on_tree_edge> >; T = boost::graph_visitor_t; R = boost::no_property; typename boost::graph_traits::vertex_descriptor = long unsigned int; mpl_::false_ = mpl_::bool_]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/breadth_first_search.hpp:309:23: required from ‘static void boost::detail::bfs_dispatch::apply(VertexListGraph&, typename boost::graph_traits::vertex_descriptor, const boost::bgl_named_params&, boost::param_not_found) [with VertexListGraph = boost::adjacency_list > > >; P = boost::bfs_visitor >, boost::vec_adj_list_vertex_id_map > >, long unsigned int>, long unsigned int, long unsigned int&>, boost::on_tree_edge> >; T = boost::graph_visitor_t; R = boost::no_property; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/breadth_first_search.hpp:339:37: required from ‘void boost::breadth_first_search(const VertexListGraph&, typename graph_traits::vertex_descriptor, const bgl_named_params&) [with VertexListGraph = adjacency_list > > >; P = bfs_visitor >, vec_adj_list_vertex_id_map > >, long unsigned int>, long unsigned int, long unsigned int&>, on_tree_edge> >; T = graph_visitor_t; R = no_property; typename graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/sloan_ordering.hpp:175:29: required from ‘typename boost::graph_traits::vertex_descriptor boost::sloan_start_end_vertices(Graph&, typename graph_traits::vertex_descriptor&, ColorMap, DegreeMap) [with Graph = adjacency_list > > >; ColorMap = vec_adj_list_vertex_property_map > > >, adjacency_list > > >*, default_color_type, default_color_type&, vertex_color_t>; DegreeMap = degree_property_map > > > >; typename graph_traits::vertex_descriptor = long unsigned int; typename graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/sloan_ordering.hpp:429:33: required from ‘OutputIterator boost::sloan_ordering(Graph&, OutputIterator, Color, Degree, Priority, Weight, Weight) [with Graph = adjacency_list > > >; OutputIterator = __gnu_cxx::__normal_iterator >; Color = vec_adj_list_vertex_property_map > > >, adjacency_list > > >*, default_color_type, default_color_type&, vertex_color_t>; Degree = degree_property_map > > > >; Priority = vec_adj_list_vertex_property_map > > >, adjacency_list > > >*, double, double&, vertex_priority_t>; Weight = int]’ ordering.cpp:245:17: required from here /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::InputIterator::~InputIterator() [with TT = boost::detail::out_edge_iter >, boost::no_property> >, long unsigned int, boost::detail::edge_desc_impl, long int>]’ 37 | ~model() | ^ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:512:7: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 512 | BOOST_CONCEPT_USAGE(InputIterator) | ^~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::Assignable >, boost::no_property> >, long unsigned int, boost::detail::edge_desc_impl, long int> >]’: /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements >, boost::no_property> >, long unsigned int, boost::detail::edge_desc_impl, long int> > >]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:145:5: required from ‘struct boost::Assignable >, boost::no_property> >, long unsigned int, boost::detail::edge_desc_impl, long int> >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:502:3: required from ‘struct boost::InputIterator >, boost::no_property> >, long unsigned int, boost::detail::edge_desc_impl, long int> >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::InputIterator >, boost::no_property> >, long unsigned int, boost::detail::edge_desc_impl, long int> >]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied >, boost::no_property> >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::value’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:45:51: [ skipping 9 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/breadth_first_search.hpp:262:29: required from ‘void boost::detail::bfs_helper(VertexListGraph&, typename boost::graph_traits::vertex_descriptor, ColorMap, BFSVisitor, const boost::bgl_named_params&, mpl_::false_) [with VertexListGraph = boost::adjacency_list > > >; ColorMap = boost::two_bit_color_map > >, long unsigned int> >; BFSVisitor = boost::bfs_visitor >, boost::vec_adj_list_vertex_id_map > >, long unsigned int>, long unsigned int, long unsigned int&>, boost::on_tree_edge> >; P = boost::bfs_visitor >, boost::vec_adj_list_vertex_id_map > >, long unsigned int>, long unsigned int, long unsigned int&>, boost::on_tree_edge> >; T = boost::graph_visitor_t; R = boost::no_property; typename boost::graph_traits::vertex_descriptor = long unsigned int; mpl_::false_ = mpl_::bool_]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/breadth_first_search.hpp:309:23: required from ‘static void boost::detail::bfs_dispatch::apply(VertexListGraph&, typename boost::graph_traits::vertex_descriptor, const boost::bgl_named_params&, boost::param_not_found) [with VertexListGraph = boost::adjacency_list > > >; P = boost::bfs_visitor >, boost::vec_adj_list_vertex_id_map > >, long unsigned int>, long unsigned int, long unsigned int&>, boost::on_tree_edge> >; T = boost::graph_visitor_t; R = boost::no_property; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/breadth_first_search.hpp:339:37: required from ‘void boost::breadth_first_search(const VertexListGraph&, typename graph_traits::vertex_descriptor, const bgl_named_params&) [with VertexListGraph = adjacency_list > > >; P = bfs_visitor >, vec_adj_list_vertex_id_map > >, long unsigned int>, long unsigned int, long unsigned int&>, on_tree_edge> >; T = graph_visitor_t; R = no_property; typename graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/sloan_ordering.hpp:175:29: required from ‘typename boost::graph_traits::vertex_descriptor boost::sloan_start_end_vertices(Graph&, typename graph_traits::vertex_descriptor&, ColorMap, DegreeMap) [with Graph = adjacency_list > > >; ColorMap = vec_adj_list_vertex_property_map > > >, adjacency_list > > >*, default_color_type, default_color_type&, vertex_color_t>; DegreeMap = degree_property_map > > > >; typename graph_traits::vertex_descriptor = long unsigned int; typename graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/sloan_ordering.hpp:429:33: required from ‘OutputIterator boost::sloan_ordering(Graph&, OutputIterator, Color, Degree, Priority, Weight, Weight) [with Graph = adjacency_list > > >; OutputIterator = __gnu_cxx::__normal_iterator >; Color = vec_adj_list_vertex_property_map > > >, adjacency_list > > >*, default_color_type, default_color_type&, vertex_color_t>; Degree = degree_property_map > > > >; Priority = vec_adj_list_vertex_property_map > > >, adjacency_list > > >*, double, double&, vertex_priority_t>; Weight = int]’ ordering.cpp:245:17: required from here /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::Assignable::~Assignable() [with TT = boost::detail::out_edge_iter >, boost::no_property> >, long unsigned int, boost::detail::edge_desc_impl, long int>]’ 37 | ~model() | ^ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:145:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 145 | BOOST_CONCEPT_USAGE(Assignable) { | ^~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::EqualityComparable >, boost::no_property> >, long unsigned int, boost::detail::edge_desc_impl, long int> >]’: /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements >, boost::no_property> >, long unsigned int, boost::detail::edge_desc_impl, long int> > >]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:233:5: required from ‘struct boost::EqualityComparable >, boost::no_property> >, long unsigned int, boost::detail::edge_desc_impl, long int> >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:502:3: required from ‘struct boost::InputIterator >, boost::no_property> >, long unsigned int, boost::detail::edge_desc_impl, long int> >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::InputIterator >, boost::no_property> >, long unsigned int, boost::detail::edge_desc_impl, long int> >]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied >, boost::no_property> >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::value’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:45:51: [ skipping 9 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/breadth_first_search.hpp:262:29: required from ‘void boost::detail::bfs_helper(VertexListGraph&, typename boost::graph_traits::vertex_descriptor, ColorMap, BFSVisitor, const boost::bgl_named_params&, mpl_::false_) [with VertexListGraph = boost::adjacency_list > > >; ColorMap = boost::two_bit_color_map > >, long unsigned int> >; BFSVisitor = boost::bfs_visitor >, boost::vec_adj_list_vertex_id_map > >, long unsigned int>, long unsigned int, long unsigned int&>, boost::on_tree_edge> >; P = boost::bfs_visitor >, boost::vec_adj_list_vertex_id_map > >, long unsigned int>, long unsigned int, long unsigned int&>, boost::on_tree_edge> >; T = boost::graph_visitor_t; R = boost::no_property; typename boost::graph_traits::vertex_descriptor = long unsigned int; mpl_::false_ = mpl_::bool_]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/breadth_first_search.hpp:309:23: required from ‘static void boost::detail::bfs_dispatch::apply(VertexListGraph&, typename boost::graph_traits::vertex_descriptor, const boost::bgl_named_params&, boost::param_not_found) [with VertexListGraph = boost::adjacency_list > > >; P = boost::bfs_visitor >, boost::vec_adj_list_vertex_id_map > >, long unsigned int>, long unsigned int, long unsigned int&>, boost::on_tree_edge> >; T = boost::graph_visitor_t; R = boost::no_property; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/breadth_first_search.hpp:339:37: required from ‘void boost::breadth_first_search(const VertexListGraph&, typename graph_traits::vertex_descriptor, const bgl_named_params&) [with VertexListGraph = adjacency_list > > >; P = bfs_visitor >, vec_adj_list_vertex_id_map > >, long unsigned int>, long unsigned int, long unsigned int&>, on_tree_edge> >; T = graph_visitor_t; R = no_property; typename graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/sloan_ordering.hpp:175:29: required from ‘typename boost::graph_traits::vertex_descriptor boost::sloan_start_end_vertices(Graph&, typename graph_traits::vertex_descriptor&, ColorMap, DegreeMap) [with Graph = adjacency_list > > >; ColorMap = vec_adj_list_vertex_property_map > > >, adjacency_list > > >*, default_color_type, default_color_type&, vertex_color_t>; DegreeMap = degree_property_map > > > >; typename graph_traits::vertex_descriptor = long unsigned int; typename graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/sloan_ordering.hpp:429:33: required from ‘OutputIterator boost::sloan_ordering(Graph&, OutputIterator, Color, Degree, Priority, Weight, Weight) [with Graph = adjacency_list > > >; OutputIterator = __gnu_cxx::__normal_iterator >; Color = vec_adj_list_vertex_property_map > > >, adjacency_list > > >*, default_color_type, default_color_type&, vertex_color_t>; Degree = degree_property_map > > > >; Priority = vec_adj_list_vertex_property_map > > >, adjacency_list > > >*, double, double&, vertex_priority_t>; Weight = int]’ ordering.cpp:245:17: required from here /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::EqualityComparable::~EqualityComparable() [with TT = boost::detail::out_edge_iter >, boost::no_property> >, long unsigned int, boost::detail::edge_desc_impl, long int>]’ 37 | ~model() | ^ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:233:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 233 | BOOST_CONCEPT_USAGE(EqualityComparable) { | ^~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::InputIterator >, boost::no_property> >, long unsigned int, boost::detail::edge_desc_impl, long int> >]’: /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements >, boost::no_property> >, long unsigned int, boost::detail::edge_desc_impl, long int> > >]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:512:7: required from ‘struct boost::InputIterator >, boost::no_property> >, long unsigned int, boost::detail::edge_desc_impl, long int> >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::InputIterator >, boost::no_property> >, long unsigned int, boost::detail::edge_desc_impl, long int> >]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied >, boost::no_property> >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::value’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied >, boost::no_property> >, long unsigned int, boost::detail::edge_desc_impl, long int> > >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:72:8: [ skipping 8 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/breadth_first_search.hpp:262:29: required from ‘void boost::detail::bfs_helper(VertexListGraph&, typename boost::graph_traits::vertex_descriptor, ColorMap, BFSVisitor, const boost::bgl_named_params&, mpl_::false_) [with VertexListGraph = boost::adjacency_list > > >; ColorMap = boost::two_bit_color_map > >, long unsigned int> >; BFSVisitor = boost::bfs_visitor >, boost::vec_adj_list_vertex_id_map > >, long unsigned int>, long unsigned int, long unsigned int&>, boost::on_tree_edge> >; P = boost::bfs_visitor >, boost::vec_adj_list_vertex_id_map > >, long unsigned int>, long unsigned int, long unsigned int&>, boost::on_tree_edge> >; T = boost::graph_visitor_t; R = boost::no_property; typename boost::graph_traits::vertex_descriptor = long unsigned int; mpl_::false_ = mpl_::bool_]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/breadth_first_search.hpp:309:23: required from ‘static void boost::detail::bfs_dispatch::apply(VertexListGraph&, typename boost::graph_traits::vertex_descriptor, const boost::bgl_named_params&, boost::param_not_found) [with VertexListGraph = boost::adjacency_list > > >; P = boost::bfs_visitor >, boost::vec_adj_list_vertex_id_map > >, long unsigned int>, long unsigned int, long unsigned int&>, boost::on_tree_edge> >; T = boost::graph_visitor_t; R = boost::no_property; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/breadth_first_search.hpp:339:37: required from ‘void boost::breadth_first_search(const VertexListGraph&, typename graph_traits::vertex_descriptor, const bgl_named_params&) [with VertexListGraph = adjacency_list > > >; P = bfs_visitor >, vec_adj_list_vertex_id_map > >, long unsigned int>, long unsigned int, long unsigned int&>, on_tree_edge> >; T = graph_visitor_t; R = no_property; typename graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/sloan_ordering.hpp:175:29: required from ‘typename boost::graph_traits::vertex_descriptor boost::sloan_start_end_vertices(Graph&, typename graph_traits::vertex_descriptor&, ColorMap, DegreeMap) [with Graph = adjacency_list > > >; ColorMap = vec_adj_list_vertex_property_map > > >, adjacency_list > > >*, default_color_type, default_color_type&, vertex_color_t>; DegreeMap = degree_property_map > > > >; typename graph_traits::vertex_descriptor = long unsigned int; typename graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/sloan_ordering.hpp:429:33: required from ‘OutputIterator boost::sloan_ordering(Graph&, OutputIterator, Color, Degree, Priority, Weight, Weight) [with Graph = adjacency_list > > >; OutputIterator = __gnu_cxx::__normal_iterator >; Color = vec_adj_list_vertex_property_map > > >, adjacency_list > > >*, default_color_type, default_color_type&, vertex_color_t>; Degree = degree_property_map > > > >; Priority = vec_adj_list_vertex_property_map > > >, adjacency_list > > >*, double, double&, vertex_priority_t>; Weight = int]’ ordering.cpp:245:17: required from here /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::InputIterator::~InputIterator() [with TT = boost::detail::out_edge_iter >, boost::no_property> >, long unsigned int, boost::detail::edge_desc_impl, long int>]’ 37 | ~model() | ^ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:512:7: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 512 | BOOST_CONCEPT_USAGE(InputIterator) | ^~~~~~~~~~~~~~~~~~~ g++ -std=gnu++17 -I"/usr/share/R/include" -DNDEBUG -I'/home/omnipath/local/R/4.4-3.20/BH/include' -fpic -g -O2 -fno-omit-frame-pointer -mno-omit-leaf-frame-pointer -ffile-prefix-map=/build/r-base-EawLoD/r-base-4.4.1=. -fstack-protector-strong -fstack-clash-protection -Wformat -Werror=format-security -fcf-protection -fdebug-prefix-map=/build/r-base-EawLoD/r-base-4.4.1=/usr/src/r-base-4.4.1-1.2404.0 -Wdate-time -D_FORTIFY_SOURCE=3 -c planar.cpp -o planar.o In file included from /home/omnipath/local/R/4.4-3.20/BH/include/boost/smart_ptr/shared_ptr.hpp:18, from /home/omnipath/local/R/4.4-3.20/BH/include/boost/property_map/vector_property_map.hpp:14, from /home/omnipath/local/R/4.4-3.20/BH/include/boost/property_map/property_map.hpp:598, from RBGL.hpp:17, from planar.cpp:1: /home/omnipath/local/R/4.4-3.20/BH/include/boost/smart_ptr/detail/shared_count.hpp:361:33: warning: ‘template class std::auto_ptr’ is deprecated: use 'std::unique_ptr' instead [-Wdeprecated-declarations] 361 | explicit shared_count( std::auto_ptr & r ): pi_( new sp_counted_impl_p( r.get() ) ) | ^~~~~~~~ In file included from /usr/include/c++/13/memory:78, from /home/omnipath/local/R/4.4-3.20/BH/include/boost/smart_ptr/detail/sp_counted_impl.hpp:35, from /home/omnipath/local/R/4.4-3.20/BH/include/boost/smart_ptr/detail/shared_count.hpp:27: /usr/include/c++/13/bits/unique_ptr.h:65:28: note: declared here 65 | template class auto_ptr; | ^~~~~~~~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/smart_ptr/shared_ptr.hpp:251:65: warning: ‘template class std::auto_ptr’ is deprecated: use 'std::unique_ptr' instead [-Wdeprecated-declarations] 251 | template< class T, class R > struct sp_enable_if_auto_ptr< std::auto_ptr< T >, R > | ^~~~~~~~ /usr/include/c++/13/bits/unique_ptr.h:65:28: note: declared here 65 | template class auto_ptr; | ^~~~~~~~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/smart_ptr/shared_ptr.hpp:508:31: warning: ‘template class std::auto_ptr’ is deprecated: use 'std::unique_ptr' instead [-Wdeprecated-declarations] 508 | explicit shared_ptr( std::auto_ptr & r ): px(r.get()), pn() | ^~~~~~~~ /usr/include/c++/13/bits/unique_ptr.h:65:28: note: declared here 65 | template class auto_ptr; | ^~~~~~~~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/smart_ptr/shared_ptr.hpp:521:22: warning: ‘template class std::auto_ptr’ is deprecated: use 'std::unique_ptr' instead [-Wdeprecated-declarations] 521 | shared_ptr( std::auto_ptr && r ): px(r.get()), pn() | ^~~~~~~~ /usr/include/c++/13/bits/unique_ptr.h:65:28: note: declared here 65 | template class auto_ptr; | ^~~~~~~~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/smart_ptr/shared_ptr.hpp:604:34: warning: ‘template class std::auto_ptr’ is deprecated: use 'std::unique_ptr' instead [-Wdeprecated-declarations] 604 | shared_ptr & operator=( std::auto_ptr & r ) | ^~~~~~~~ /usr/include/c++/13/bits/unique_ptr.h:65:28: note: declared here 65 | template class auto_ptr; | ^~~~~~~~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/smart_ptr/shared_ptr.hpp:613:34: warning: ‘template class std::auto_ptr’ is deprecated: use 'std::unique_ptr' instead [-Wdeprecated-declarations] 613 | shared_ptr & operator=( std::auto_ptr && r ) | ^~~~~~~~ /usr/include/c++/13/bits/unique_ptr.h:65:28: note: declared here 65 | template class auto_ptr; | ^~~~~~~~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/smart_ptr/shared_ptr.hpp: In member function ‘boost::shared_ptr& boost::shared_ptr::operator=(std::auto_ptr<_Up>&&)’: /home/omnipath/local/R/4.4-3.20/BH/include/boost/smart_ptr/shared_ptr.hpp:615:38: warning: ‘template class std::auto_ptr’ is deprecated: use 'std::unique_ptr' instead [-Wdeprecated-declarations] 615 | this_type( static_cast< std::auto_ptr && >( r ) ).swap( *this ); | ^~~~~~~~ /usr/include/c++/13/bits/unique_ptr.h:65:28: note: declared here 65 | template class auto_ptr; | ^~~~~~~~ In file included from /home/omnipath/local/R/4.4-3.20/BH/include/boost/scoped_ptr.hpp:13, from /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/adjacency_list.hpp:22, from RBGL.hpp:38: /home/omnipath/local/R/4.4-3.20/BH/include/boost/smart_ptr/scoped_ptr.hpp: At global scope: /home/omnipath/local/R/4.4-3.20/BH/include/boost/smart_ptr/scoped_ptr.hpp:75:31: warning: ‘template class std::auto_ptr’ is deprecated: use 'std::unique_ptr' instead [-Wdeprecated-declarations] 75 | explicit scoped_ptr( std::auto_ptr p ) BOOST_SP_NOEXCEPT : px( p.release() ) | ^~~~~~~~ /usr/include/c++/13/bits/unique_ptr.h:65:28: note: declared here 65 | template class auto_ptr; | ^~~~~~~~ In file included from /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/assert.hpp:35, from /home/omnipath/local/R/4.4-3.20/BH/include/boost/property_map/property_map.hpp:19: /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::constraint::failed() [with Model = boost::WritablePropertyMapConcept >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>, long unsigned int>]’: /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/connected_components.hpp:76:5: required from ‘typename boost::property_traits::value_type boost::connected_components(const Graph&, ComponentMap, typename enable_if_c::traversal_category>::value, graph::detail::no_parameter>::type) [with Graph = adjacency_list, property >; ComponentMap = iterator_property_map<__gnu_cxx::__normal_iterator >, vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>; typename property_traits::value_type = long unsigned int; typename enable_if_c::traversal_category>::value, graph::detail::no_parameter>::type = graph::detail::no_parameter; typename graph_traits::traversal_category = undir_adj_list_traversal_tag]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/make_connected.hpp:38:51: required from ‘void boost::make_connected(Graph&, VertexIndexMap, AddEdgeVisitor&) [with Graph = adjacency_list, property >; VertexIndexMap = vec_adj_list_vertex_id_map, long unsigned int>; AddEdgeVisitor = my_add_edge_visitor, property >, long unsigned int>]’ planar.cpp:211:26: required from here /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:65:52: warning: ‘this’ pointer is null [-Wnonnull] 65 | static void failed() { ((Model*)0)->constraints(); } | ~~~~~~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/property_map/property_map.hpp:179:10: note: in a call to non-static member function ‘void boost::WritablePropertyMapConcept::constraints() [with PMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>; Key = long unsigned int]’ 179 | void constraints() { | ^~~~~~~~~~~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements >]’: /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:208:5: required from ‘struct boost::Convertible’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:206:3: required from ‘struct boost::ConvertibleConcept’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::ConvertibleConcept]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied >::value’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:72:8: [ skipping 3 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>, long unsigned int> >::value’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>, long unsigned int> >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_ >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>, long unsigned int>)>’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/connected_components.hpp:76:5: required from ‘typename boost::property_traits::value_type boost::connected_components(const Graph&, ComponentMap, typename enable_if_c::traversal_category>::value, graph::detail::no_parameter>::type) [with Graph = adjacency_list, property >; ComponentMap = iterator_property_map<__gnu_cxx::__normal_iterator >, vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>; typename property_traits::value_type = long unsigned int; typename enable_if_c::traversal_category>::value, graph::detail::no_parameter>::type = graph::detail::no_parameter; typename graph_traits::traversal_category = undir_adj_list_traversal_tag]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/make_connected.hpp:38:51: required from ‘void boost::make_connected(Graph&, VertexIndexMap, AddEdgeVisitor&) [with Graph = adjacency_list, property >; VertexIndexMap = vec_adj_list_vertex_id_map, long unsigned int>; AddEdgeVisitor = my_add_edge_visitor, property >, long unsigned int>]’ planar.cpp:211:26: required from here /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ In file included from /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:31, from /home/omnipath/local/R/4.4-3.20/BH/include/boost/property_map/property_map.hpp:20: /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::Convertible]’ 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ^ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::ConvertibleConcept]’: /home/omnipath/local/R/4.4-3.20/BH/include/boost/property_map/property_map.hpp:180:7: required from ‘void boost::WritablePropertyMapConcept::constraints() [with PMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>; Key = long unsigned int]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::WritablePropertyMapConcept >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>, long unsigned int>]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>, long unsigned int> >::value’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>, long unsigned int> >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_ >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>, long unsigned int>)>’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/connected_components.hpp:76:5: required from ‘typename boost::property_traits::value_type boost::connected_components(const Graph&, ComponentMap, typename enable_if_c::traversal_category>::value, graph::detail::no_parameter>::type) [with Graph = adjacency_list, property >; ComponentMap = iterator_property_map<__gnu_cxx::__normal_iterator >, vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>; typename property_traits::value_type = long unsigned int; typename enable_if_c::traversal_category>::value, graph::detail::no_parameter>::type = graph::detail::no_parameter; typename graph_traits::traversal_category = undir_adj_list_traversal_tag]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/make_connected.hpp:38:51: required from ‘void boost::make_connected(Graph&, VertexIndexMap, AddEdgeVisitor&) [with Graph = adjacency_list, property >; VertexIndexMap = vec_adj_list_vertex_id_map, long unsigned int>; AddEdgeVisitor = my_add_edge_visitor, property >, long unsigned int>]’ planar.cpp:211:26: required from here /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ In file included from /home/omnipath/local/R/4.4-3.20/BH/include/boost/preprocessor/repetition/enum_binary_params.hpp:15, from /home/omnipath/local/R/4.4-3.20/BH/include/boost/utility/base_from_member.hpp:15, from /home/omnipath/local/R/4.4-3.20/BH/include/boost/utility.hpp:15, from RBGL.hpp:16: /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:206:17: note: in a call to non-static member function ‘boost::ConvertibleConcept::~ConvertibleConcept()’ 206 | BOOST_concept(Convertible,(X)(Y)) | ^~~~~~~~~~~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/preprocessor/cat.hpp:29:34: note: in definition of macro ‘BOOST_PP_CAT_I’ 29 | # define BOOST_PP_CAT_I(a, b) a ## b | ^ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/concept_def.hpp:23:12: note: in expansion of macro ‘BOOST_PP_CAT’ 23 | struct BOOST_PP_CAT(name,Concept) \ | ^~~~~~~~~~~~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:206:3: note: in expansion of macro ‘BOOST_concept’ 206 | BOOST_concept(Convertible,(X)(Y)) | ^~~~~~~~~~~~~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::Convertible]’: /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements >]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:208:5: required from ‘struct boost::Convertible’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:206:3: required from ‘struct boost::ConvertibleConcept’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::ConvertibleConcept]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied >::value’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:45:51: [ skipping 4 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>, long unsigned int> >::value’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>, long unsigned int> >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_ >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>, long unsigned int>)>’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/connected_components.hpp:76:5: required from ‘typename boost::property_traits::value_type boost::connected_components(const Graph&, ComponentMap, typename enable_if_c::traversal_category>::value, graph::detail::no_parameter>::type) [with Graph = adjacency_list, property >; ComponentMap = iterator_property_map<__gnu_cxx::__normal_iterator >, vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>; typename property_traits::value_type = long unsigned int; typename enable_if_c::traversal_category>::value, graph::detail::no_parameter>::type = graph::detail::no_parameter; typename graph_traits::traversal_category = undir_adj_list_traversal_tag]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/make_connected.hpp:38:51: required from ‘void boost::make_connected(Graph&, VertexIndexMap, AddEdgeVisitor&) [with Graph = adjacency_list, property >; VertexIndexMap = vec_adj_list_vertex_id_map, long unsigned int>; AddEdgeVisitor = my_add_edge_visitor, property >, long unsigned int>]’ planar.cpp:211:26: required from here /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::Convertible::~Convertible() [with X = boost::lvalue_property_map_tag; Y = boost::writable_property_map_tag]’ 37 | ~model() | ^ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:208:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 208 | BOOST_CONCEPT_USAGE(Convertible) { | ^~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements > > >]’: /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:145:5: required from ‘struct boost::Assignable<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:502:3: required from ‘struct boost::InputIterator<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:540:3: required from ‘struct boost::ForwardIterator<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:568:3: required from ‘struct boost::BidirectionalIterator<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:597:3: required from ‘struct boost::RandomAccessIterator<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:597:3: [ skipping 5 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.4-3.20/BH/include/boost/property_map/property_map.hpp:354:5: required from ‘boost::iterator_property_map boost::make_iterator_property_map(RAIter, ID, Value) [with RAIter = __gnu_cxx::__normal_iterator >; Value = long unsigned int; ID = vec_adj_list_vertex_id_map, long unsigned int>]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/biconnected_components.hpp:338:43: required from ‘static std::pair boost::detail::bicomp_dispatch1::apply(const Graph&, ComponentMap, OutputIterator, VertexIndexMap, const boost::bgl_named_params&, boost::param_not_found) [with Graph = boost::adjacency_list, boost::property >; ComponentMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::adj_list_edge_property_map, boost::edge_index_t>, long unsigned int, long unsigned int&>; OutputIterator = std::back_insert_iterator >; VertexIndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>; P = int; T = boost::buffer_param_t; R = boost::no_property]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/biconnected_components.hpp:368:60: required from ‘std::pair boost::biconnected_components(const Graph&, ComponentMap, OutputIterator, const bgl_named_params&) [with Graph = adjacency_list, property >; ComponentMap = iterator_property_map<__gnu_cxx::__normal_iterator >, adj_list_edge_property_map, edge_index_t>, long unsigned int, long unsigned int&>; OutputIterator = std::back_insert_iterator >; P = int; T = buffer_param_t; R = no_property]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/biconnected_components.hpp:377:34: required from ‘std::pair boost::biconnected_components(const Graph&, ComponentMap, OutputIterator) [with Graph = adjacency_list, property >; ComponentMap = iterator_property_map<__gnu_cxx::__normal_iterator >, adj_list_edge_property_map, edge_index_t>, long unsigned int, long unsigned int&>; OutputIterator = std::back_insert_iterator >]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/make_biconnected_planar.hpp:44:27: required from ‘void boost::make_biconnected_planar(Graph&, PlanarEmbedding, EdgeIndexMap, AddEdgeVisitor&) [with Graph = adjacency_list, property >; PlanarEmbedding = std::vector >*; EdgeIndexMap = adj_list_edge_property_map, edge_index_t>; AddEdgeVisitor = my_add_edge_visitor, property >, long unsigned int>]’ planar.cpp:213:35: required from here /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::Assignable<__gnu_cxx::__normal_iterator > >]’ 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ^ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements > > >]’: /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:233:5: required from ‘struct boost::EqualityComparable<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:502:3: required from ‘struct boost::InputIterator<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:540:3: required from ‘struct boost::ForwardIterator<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:568:3: required from ‘struct boost::BidirectionalIterator<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:597:3: required from ‘struct boost::RandomAccessIterator<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:597:3: [ skipping 5 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.4-3.20/BH/include/boost/property_map/property_map.hpp:354:5: required from ‘boost::iterator_property_map boost::make_iterator_property_map(RAIter, ID, Value) [with RAIter = __gnu_cxx::__normal_iterator >; Value = long unsigned int; ID = vec_adj_list_vertex_id_map, long unsigned int>]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/biconnected_components.hpp:338:43: required from ‘static std::pair boost::detail::bicomp_dispatch1::apply(const Graph&, ComponentMap, OutputIterator, VertexIndexMap, const boost::bgl_named_params&, boost::param_not_found) [with Graph = boost::adjacency_list, boost::property >; ComponentMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::adj_list_edge_property_map, boost::edge_index_t>, long unsigned int, long unsigned int&>; OutputIterator = std::back_insert_iterator >; VertexIndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>; P = int; T = boost::buffer_param_t; R = boost::no_property]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/biconnected_components.hpp:368:60: required from ‘std::pair boost::biconnected_components(const Graph&, ComponentMap, OutputIterator, const bgl_named_params&) [with Graph = adjacency_list, property >; ComponentMap = iterator_property_map<__gnu_cxx::__normal_iterator >, adj_list_edge_property_map, edge_index_t>, long unsigned int, long unsigned int&>; OutputIterator = std::back_insert_iterator >; P = int; T = buffer_param_t; R = no_property]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/biconnected_components.hpp:377:34: required from ‘std::pair boost::biconnected_components(const Graph&, ComponentMap, OutputIterator) [with Graph = adjacency_list, property >; ComponentMap = iterator_property_map<__gnu_cxx::__normal_iterator >, adj_list_edge_property_map, edge_index_t>, long unsigned int, long unsigned int&>; OutputIterator = std::back_insert_iterator >]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/make_biconnected_planar.hpp:44:27: required from ‘void boost::make_biconnected_planar(Graph&, PlanarEmbedding, EdgeIndexMap, AddEdgeVisitor&) [with Graph = adjacency_list, property >; PlanarEmbedding = std::vector >*; EdgeIndexMap = adj_list_edge_property_map, edge_index_t>; AddEdgeVisitor = my_add_edge_visitor, property >, long unsigned int>]’ planar.cpp:213:35: required from here /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::EqualityComparable<__gnu_cxx::__normal_iterator > >]’ 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ^ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements > > >]’: /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:512:7: required from ‘struct boost::InputIterator<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:540:3: required from ‘struct boost::ForwardIterator<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:568:3: required from ‘struct boost::BidirectionalIterator<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:597:3: required from ‘struct boost::RandomAccessIterator<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:597:3: required from ‘struct boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:32:62: [ skipping 4 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.4-3.20/BH/include/boost/property_map/property_map.hpp:354:5: required from ‘boost::iterator_property_map boost::make_iterator_property_map(RAIter, ID, Value) [with RAIter = __gnu_cxx::__normal_iterator >; Value = long unsigned int; ID = vec_adj_list_vertex_id_map, long unsigned int>]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/biconnected_components.hpp:338:43: required from ‘static std::pair boost::detail::bicomp_dispatch1::apply(const Graph&, ComponentMap, OutputIterator, VertexIndexMap, const boost::bgl_named_params&, boost::param_not_found) [with Graph = boost::adjacency_list, boost::property >; ComponentMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::adj_list_edge_property_map, boost::edge_index_t>, long unsigned int, long unsigned int&>; OutputIterator = std::back_insert_iterator >; VertexIndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>; P = int; T = boost::buffer_param_t; R = boost::no_property]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/biconnected_components.hpp:368:60: required from ‘std::pair boost::biconnected_components(const Graph&, ComponentMap, OutputIterator, const bgl_named_params&) [with Graph = adjacency_list, property >; ComponentMap = iterator_property_map<__gnu_cxx::__normal_iterator >, adj_list_edge_property_map, edge_index_t>, long unsigned int, long unsigned int&>; OutputIterator = std::back_insert_iterator >; P = int; T = buffer_param_t; R = no_property]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/biconnected_components.hpp:377:34: required from ‘std::pair boost::biconnected_components(const Graph&, ComponentMap, OutputIterator) [with Graph = adjacency_list, property >; ComponentMap = iterator_property_map<__gnu_cxx::__normal_iterator >, adj_list_edge_property_map, edge_index_t>, long unsigned int, long unsigned int&>; OutputIterator = std::back_insert_iterator >]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/make_biconnected_planar.hpp:44:27: required from ‘void boost::make_biconnected_planar(Graph&, PlanarEmbedding, EdgeIndexMap, AddEdgeVisitor&) [with Graph = adjacency_list, property >; PlanarEmbedding = std::vector >*; EdgeIndexMap = adj_list_edge_property_map, edge_index_t>; AddEdgeVisitor = my_add_edge_visitor, property >, long unsigned int>]’ planar.cpp:213:35: required from here /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::InputIterator<__gnu_cxx::__normal_iterator > >]’ 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ^ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements > > >]’: /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:543:7: required from ‘struct boost::ForwardIterator<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:568:3: required from ‘struct boost::BidirectionalIterator<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:597:3: required from ‘struct boost::RandomAccessIterator<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:597:3: required from ‘struct boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator > >]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:42:5: [ skipping 3 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.4-3.20/BH/include/boost/property_map/property_map.hpp:354:5: required from ‘boost::iterator_property_map boost::make_iterator_property_map(RAIter, ID, Value) [with RAIter = __gnu_cxx::__normal_iterator >; Value = long unsigned int; ID = vec_adj_list_vertex_id_map, long unsigned int>]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/biconnected_components.hpp:338:43: required from ‘static std::pair boost::detail::bicomp_dispatch1::apply(const Graph&, ComponentMap, OutputIterator, VertexIndexMap, const boost::bgl_named_params&, boost::param_not_found) [with Graph = boost::adjacency_list, boost::property >; ComponentMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::adj_list_edge_property_map, boost::edge_index_t>, long unsigned int, long unsigned int&>; OutputIterator = std::back_insert_iterator >; VertexIndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>; P = int; T = boost::buffer_param_t; R = boost::no_property]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/biconnected_components.hpp:368:60: required from ‘std::pair boost::biconnected_components(const Graph&, ComponentMap, OutputIterator, const bgl_named_params&) [with Graph = adjacency_list, property >; ComponentMap = iterator_property_map<__gnu_cxx::__normal_iterator >, adj_list_edge_property_map, edge_index_t>, long unsigned int, long unsigned int&>; OutputIterator = std::back_insert_iterator >; P = int; T = buffer_param_t; R = no_property]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/biconnected_components.hpp:377:34: required from ‘std::pair boost::biconnected_components(const Graph&, ComponentMap, OutputIterator) [with Graph = adjacency_list, property >; ComponentMap = iterator_property_map<__gnu_cxx::__normal_iterator >, adj_list_edge_property_map, edge_index_t>, long unsigned int, long unsigned int&>; OutputIterator = std::back_insert_iterator >]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/make_biconnected_planar.hpp:44:27: required from ‘void boost::make_biconnected_planar(Graph&, PlanarEmbedding, EdgeIndexMap, AddEdgeVisitor&) [with Graph = adjacency_list, property >; PlanarEmbedding = std::vector >*; EdgeIndexMap = adj_list_edge_property_map, edge_index_t>; AddEdgeVisitor = my_add_edge_visitor, property >, long unsigned int>]’ planar.cpp:213:35: required from here /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::ForwardIterator<__gnu_cxx::__normal_iterator > >]’ 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ^ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements > > >]’: /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:571:7: required from ‘struct boost::BidirectionalIterator<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:597:3: required from ‘struct boost::RandomAccessIterator<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:597:3: required from ‘struct boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator > >]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied > > >::value’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:45:51: [ skipping 2 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.4-3.20/BH/include/boost/property_map/property_map.hpp:354:5: required from ‘boost::iterator_property_map boost::make_iterator_property_map(RAIter, ID, Value) [with RAIter = __gnu_cxx::__normal_iterator >; Value = long unsigned int; ID = vec_adj_list_vertex_id_map, long unsigned int>]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/biconnected_components.hpp:338:43: required from ‘static std::pair boost::detail::bicomp_dispatch1::apply(const Graph&, ComponentMap, OutputIterator, VertexIndexMap, const boost::bgl_named_params&, boost::param_not_found) [with Graph = boost::adjacency_list, boost::property >; ComponentMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::adj_list_edge_property_map, boost::edge_index_t>, long unsigned int, long unsigned int&>; OutputIterator = std::back_insert_iterator >; VertexIndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>; P = int; T = boost::buffer_param_t; R = boost::no_property]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/biconnected_components.hpp:368:60: required from ‘std::pair boost::biconnected_components(const Graph&, ComponentMap, OutputIterator, const bgl_named_params&) [with Graph = adjacency_list, property >; ComponentMap = iterator_property_map<__gnu_cxx::__normal_iterator >, adj_list_edge_property_map, edge_index_t>, long unsigned int, long unsigned int&>; OutputIterator = std::back_insert_iterator >; P = int; T = buffer_param_t; R = no_property]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/biconnected_components.hpp:377:34: required from ‘std::pair boost::biconnected_components(const Graph&, ComponentMap, OutputIterator) [with Graph = adjacency_list, property >; ComponentMap = iterator_property_map<__gnu_cxx::__normal_iterator >, adj_list_edge_property_map, edge_index_t>, long unsigned int, long unsigned int&>; OutputIterator = std::back_insert_iterator >]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/make_biconnected_planar.hpp:44:27: required from ‘void boost::make_biconnected_planar(Graph&, PlanarEmbedding, EdgeIndexMap, AddEdgeVisitor&) [with Graph = adjacency_list, property >; PlanarEmbedding = std::vector >*; EdgeIndexMap = adj_list_edge_property_map, edge_index_t>; AddEdgeVisitor = my_add_edge_visitor, property >, long unsigned int>]’ planar.cpp:213:35: required from here /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::BidirectionalIterator<__gnu_cxx::__normal_iterator > >]’ 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ^ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements > > >]’: /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:253:5: required from ‘struct boost::Comparable<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:597:3: required from ‘struct boost::RandomAccessIterator<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:597:3: required from ‘struct boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator > >]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied > > >::value’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:45:51: [ skipping 2 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.4-3.20/BH/include/boost/property_map/property_map.hpp:354:5: required from ‘boost::iterator_property_map boost::make_iterator_property_map(RAIter, ID, Value) [with RAIter = __gnu_cxx::__normal_iterator >; Value = long unsigned int; ID = vec_adj_list_vertex_id_map, long unsigned int>]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/biconnected_components.hpp:338:43: required from ‘static std::pair boost::detail::bicomp_dispatch1::apply(const Graph&, ComponentMap, OutputIterator, VertexIndexMap, const boost::bgl_named_params&, boost::param_not_found) [with Graph = boost::adjacency_list, boost::property >; ComponentMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::adj_list_edge_property_map, boost::edge_index_t>, long unsigned int, long unsigned int&>; OutputIterator = std::back_insert_iterator >; VertexIndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>; P = int; T = boost::buffer_param_t; R = boost::no_property]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/biconnected_components.hpp:368:60: required from ‘std::pair boost::biconnected_components(const Graph&, ComponentMap, OutputIterator, const bgl_named_params&) [with Graph = adjacency_list, property >; ComponentMap = iterator_property_map<__gnu_cxx::__normal_iterator >, adj_list_edge_property_map, edge_index_t>, long unsigned int, long unsigned int&>; OutputIterator = std::back_insert_iterator >; P = int; T = buffer_param_t; R = no_property]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/biconnected_components.hpp:377:34: required from ‘std::pair boost::biconnected_components(const Graph&, ComponentMap, OutputIterator) [with Graph = adjacency_list, property >; ComponentMap = iterator_property_map<__gnu_cxx::__normal_iterator >, adj_list_edge_property_map, edge_index_t>, long unsigned int, long unsigned int&>; OutputIterator = std::back_insert_iterator >]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/make_biconnected_planar.hpp:44:27: required from ‘void boost::make_biconnected_planar(Graph&, PlanarEmbedding, EdgeIndexMap, AddEdgeVisitor&) [with Graph = adjacency_list, property >; PlanarEmbedding = std::vector >*; EdgeIndexMap = adj_list_edge_property_map, edge_index_t>; AddEdgeVisitor = my_add_edge_visitor, property >, long unsigned int>]’ planar.cpp:213:35: required from here /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::Comparable<__gnu_cxx::__normal_iterator > >]’ 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ^ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements > > >]’: /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:601:7: required from ‘struct boost::RandomAccessIterator<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:597:3: required from ‘struct boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator > >]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied > > >::value’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:45:51: [ skipping 2 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.4-3.20/BH/include/boost/property_map/property_map.hpp:354:5: required from ‘boost::iterator_property_map boost::make_iterator_property_map(RAIter, ID, Value) [with RAIter = __gnu_cxx::__normal_iterator >; Value = long unsigned int; ID = vec_adj_list_vertex_id_map, long unsigned int>]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/biconnected_components.hpp:338:43: required from ‘static std::pair boost::detail::bicomp_dispatch1::apply(const Graph&, ComponentMap, OutputIterator, VertexIndexMap, const boost::bgl_named_params&, boost::param_not_found) [with Graph = boost::adjacency_list, boost::property >; ComponentMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::adj_list_edge_property_map, boost::edge_index_t>, long unsigned int, long unsigned int&>; OutputIterator = std::back_insert_iterator >; VertexIndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>; P = int; T = boost::buffer_param_t; R = boost::no_property]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/biconnected_components.hpp:368:60: required from ‘std::pair boost::biconnected_components(const Graph&, ComponentMap, OutputIterator, const bgl_named_params&) [with Graph = adjacency_list, property >; ComponentMap = iterator_property_map<__gnu_cxx::__normal_iterator >, adj_list_edge_property_map, edge_index_t>, long unsigned int, long unsigned int&>; OutputIterator = std::back_insert_iterator >; P = int; T = buffer_param_t; R = no_property]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/biconnected_components.hpp:377:34: required from ‘std::pair boost::biconnected_components(const Graph&, ComponentMap, OutputIterator) [with Graph = adjacency_list, property >; ComponentMap = iterator_property_map<__gnu_cxx::__normal_iterator >, adj_list_edge_property_map, edge_index_t>, long unsigned int, long unsigned int&>; OutputIterator = std::back_insert_iterator >]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/make_biconnected_planar.hpp:44:27: required from ‘void boost::make_biconnected_planar(Graph&, PlanarEmbedding, EdgeIndexMap, AddEdgeVisitor&) [with Graph = adjacency_list, property >; PlanarEmbedding = std::vector >*; EdgeIndexMap = adj_list_edge_property_map, edge_index_t>; AddEdgeVisitor = my_add_edge_visitor, property >, long unsigned int>]’ planar.cpp:213:35: required from here /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::RandomAccessIterator<__gnu_cxx::__normal_iterator > >]’ 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ^ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator > >]’: /home/omnipath/local/R/4.4-3.20/BH/include/boost/property_map/property_map.hpp:354:5: required from ‘boost::iterator_property_map boost::make_iterator_property_map(RAIter, ID, Value) [with RAIter = __gnu_cxx::__normal_iterator >; Value = long unsigned int; ID = vec_adj_list_vertex_id_map, long unsigned int>]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/biconnected_components.hpp:338:43: required from ‘static std::pair boost::detail::bicomp_dispatch1::apply(const Graph&, ComponentMap, OutputIterator, VertexIndexMap, const boost::bgl_named_params&, boost::param_not_found) [with Graph = boost::adjacency_list, boost::property >; ComponentMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::adj_list_edge_property_map, boost::edge_index_t>, long unsigned int, long unsigned int&>; OutputIterator = std::back_insert_iterator >; VertexIndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>; P = int; T = boost::buffer_param_t; R = boost::no_property]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/biconnected_components.hpp:368:60: required from ‘std::pair boost::biconnected_components(const Graph&, ComponentMap, OutputIterator, const bgl_named_params&) [with Graph = adjacency_list, property >; ComponentMap = iterator_property_map<__gnu_cxx::__normal_iterator >, adj_list_edge_property_map, edge_index_t>, long unsigned int, long unsigned int&>; OutputIterator = std::back_insert_iterator >; P = int; T = buffer_param_t; R = no_property]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/biconnected_components.hpp:377:34: required from ‘std::pair boost::biconnected_components(const Graph&, ComponentMap, OutputIterator) [with Graph = adjacency_list, property >; ComponentMap = iterator_property_map<__gnu_cxx::__normal_iterator >, adj_list_edge_property_map, edge_index_t>, long unsigned int, long unsigned int&>; OutputIterator = std::back_insert_iterator >]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/make_biconnected_planar.hpp:44:27: required from ‘void boost::make_biconnected_planar(Graph&, PlanarEmbedding, EdgeIndexMap, AddEdgeVisitor&) [with Graph = adjacency_list, property >; PlanarEmbedding = std::vector >*; EdgeIndexMap = adj_list_edge_property_map, edge_index_t>; AddEdgeVisitor = my_add_edge_visitor, property >, long unsigned int>]’ planar.cpp:213:35: required from here /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:597:17: note: in a call to non-static member function ‘boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator > >::~RandomAccessIteratorConcept()’ 597 | BOOST_concept(RandomAccessIterator,(TT)) | ^~~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/preprocessor/cat.hpp:29:34: note: in definition of macro ‘BOOST_PP_CAT_I’ 29 | # define BOOST_PP_CAT_I(a, b) a ## b | ^ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/concept_def.hpp:23:12: note: in expansion of macro ‘BOOST_PP_CAT’ 23 | struct BOOST_PP_CAT(name,Concept) \ | ^~~~~~~~~~~~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:597:3: note: in expansion of macro ‘BOOST_concept’ 597 | BOOST_concept(RandomAccessIterator,(TT)) | ^~~~~~~~~~~~~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::constraint::failed() [with Model = boost::DFSVisitorConcept >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&> >, boost::adjacency_list, boost::property > >]’: /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/depth_first_search.hpp:130:9: required from ‘void boost::depth_first_search(const VertexListGraph&, DFSVisitor, ColorMap, typename graph_traits::vertex_descriptor) [with VertexListGraph = adjacency_list, property >; DFSVisitor = detail::components_recorder >, vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&> >; ColorMap = shared_array_property_map, long unsigned int> >; typename graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/depth_first_search.hpp:397:42: required from ‘void boost::graph::detail::depth_first_search_impl::operator()(const Graph&, const ArgPack&) const [with ArgPack = boost::parameter::aux::arg_list >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&> > >, boost::parameter::aux::empty_arg_list, std::integral_constant >; Graph = boost::adjacency_list, boost::property >]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/depth_first_search.hpp:406:5: required from ‘typename boost::result_of(Param0, const ArgPack&)>::type boost::graph::depth_first_search_with_named_params(const Param0&, const ArgPack&) [with Param0 = boost::adjacency_list, boost::property >; ArgPack = boost::parameter::aux::arg_list >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&> > >, boost::parameter::aux::empty_arg_list, std::integral_constant >; typename boost::result_of(Param0, const ArgPack&)>::type = void]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/depth_first_search.hpp:409:1: required from ‘typename boost::result_of(Param0, const typename boost::detail::convert_bgl_params_to_boost_parameter >::type&)>::type boost::depth_first_search(const Param0&, const bgl_named_params&) [with Param0 = adjacency_list, property >; P = detail::components_recorder >, vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&> >; T = graph_visitor_t; R = no_property; typename result_of(Param0, const typename detail::convert_bgl_params_to_boost_parameter >::type&)>::type = void; typename detail::convert_bgl_params_to_boost_parameter >::type = parameter::aux::arg_list >, vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&> > >, parameter::aux::empty_arg_list, std::integral_constant >]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/connected_components.hpp:106:23: required from ‘typename boost::property_traits::value_type boost::connected_components(const Graph&, ComponentMap, typename enable_if_c::traversal_category>::value, graph::detail::no_parameter>::type) [with Graph = adjacency_list, property >; ComponentMap = iterator_property_map<__gnu_cxx::__normal_iterator >, vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>; typename property_traits::value_type = long unsigned int; typename enable_if_c::traversal_category>::value, graph::detail::no_parameter>::type = graph::detail::no_parameter; typename graph_traits::traversal_category = undir_adj_list_traversal_tag]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/make_connected.hpp:38:51: required from ‘void boost::make_connected(Graph&, VertexIndexMap, AddEdgeVisitor&) [with Graph = adjacency_list, property >; VertexIndexMap = vec_adj_list_vertex_id_map, long unsigned int>; AddEdgeVisitor = my_add_edge_visitor, property >, long unsigned int>]’ planar.cpp:211:26: required from here /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:65:52: warning: ‘this’ pointer is null [-Wnonnull] 65 | static void failed() { ((Model*)0)->constraints(); } | ~~~~~~~~~~~~~~~~~~~~~~~~^~ In file included from /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/planar_detail/boyer_myrvold_impl.hpp:19, from /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/boyer_myrvold_planar_test.hpp:12, from planar.cpp:3: /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/depth_first_search.hpp:39:10: note: in a call to non-static member function ‘void boost::DFSVisitorConcept::constraints() [with Visitor = boost::detail::components_recorder >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&> >; Graph = boost::adjacency_list, boost::property >]’ 39 | void constraints() | ^~~~~~~~~~~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::Assignable<__gnu_cxx::__normal_iterator > >]’: /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements > > >]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:145:5: required from ‘struct boost::Assignable<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:502:3: required from ‘struct boost::InputIterator<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:540:3: required from ‘struct boost::ForwardIterator<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:568:3: required from ‘struct boost::BidirectionalIterator<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:597:3: [ skipping 6 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.4-3.20/BH/include/boost/property_map/property_map.hpp:354:5: required from ‘boost::iterator_property_map boost::make_iterator_property_map(RAIter, ID, Value) [with RAIter = __gnu_cxx::__normal_iterator >; Value = long unsigned int; ID = vec_adj_list_vertex_id_map, long unsigned int>]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/biconnected_components.hpp:338:43: required from ‘static std::pair boost::detail::bicomp_dispatch1::apply(const Graph&, ComponentMap, OutputIterator, VertexIndexMap, const boost::bgl_named_params&, boost::param_not_found) [with Graph = boost::adjacency_list, boost::property >; ComponentMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::adj_list_edge_property_map, boost::edge_index_t>, long unsigned int, long unsigned int&>; OutputIterator = std::back_insert_iterator >; VertexIndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>; P = int; T = boost::buffer_param_t; R = boost::no_property]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/biconnected_components.hpp:368:60: required from ‘std::pair boost::biconnected_components(const Graph&, ComponentMap, OutputIterator, const bgl_named_params&) [with Graph = adjacency_list, property >; ComponentMap = iterator_property_map<__gnu_cxx::__normal_iterator >, adj_list_edge_property_map, edge_index_t>, long unsigned int, long unsigned int&>; OutputIterator = std::back_insert_iterator >; P = int; T = buffer_param_t; R = no_property]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/biconnected_components.hpp:377:34: required from ‘std::pair boost::biconnected_components(const Graph&, ComponentMap, OutputIterator) [with Graph = adjacency_list, property >; ComponentMap = iterator_property_map<__gnu_cxx::__normal_iterator >, adj_list_edge_property_map, edge_index_t>, long unsigned int, long unsigned int&>; OutputIterator = std::back_insert_iterator >]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/make_biconnected_planar.hpp:44:27: required from ‘void boost::make_biconnected_planar(Graph&, PlanarEmbedding, EdgeIndexMap, AddEdgeVisitor&) [with Graph = adjacency_list, property >; PlanarEmbedding = std::vector >*; EdgeIndexMap = adj_list_edge_property_map, edge_index_t>; AddEdgeVisitor = my_add_edge_visitor, property >, long unsigned int>]’ planar.cpp:213:35: required from here /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::Assignable::~Assignable() [with TT = __gnu_cxx::__normal_iterator >]’ 37 | ~model() | ^ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:145:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 145 | BOOST_CONCEPT_USAGE(Assignable) { | ^~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::EqualityComparable<__gnu_cxx::__normal_iterator > >]’: /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements > > >]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:233:5: required from ‘struct boost::EqualityComparable<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:502:3: required from ‘struct boost::InputIterator<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:540:3: required from ‘struct boost::ForwardIterator<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:568:3: required from ‘struct boost::BidirectionalIterator<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:597:3: [ skipping 6 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.4-3.20/BH/include/boost/property_map/property_map.hpp:354:5: required from ‘boost::iterator_property_map boost::make_iterator_property_map(RAIter, ID, Value) [with RAIter = __gnu_cxx::__normal_iterator >; Value = long unsigned int; ID = vec_adj_list_vertex_id_map, long unsigned int>]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/biconnected_components.hpp:338:43: required from ‘static std::pair boost::detail::bicomp_dispatch1::apply(const Graph&, ComponentMap, OutputIterator, VertexIndexMap, const boost::bgl_named_params&, boost::param_not_found) [with Graph = boost::adjacency_list, boost::property >; ComponentMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::adj_list_edge_property_map, boost::edge_index_t>, long unsigned int, long unsigned int&>; OutputIterator = std::back_insert_iterator >; VertexIndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>; P = int; T = boost::buffer_param_t; R = boost::no_property]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/biconnected_components.hpp:368:60: required from ‘std::pair boost::biconnected_components(const Graph&, ComponentMap, OutputIterator, const bgl_named_params&) [with Graph = adjacency_list, property >; ComponentMap = iterator_property_map<__gnu_cxx::__normal_iterator >, adj_list_edge_property_map, edge_index_t>, long unsigned int, long unsigned int&>; OutputIterator = std::back_insert_iterator >; P = int; T = buffer_param_t; R = no_property]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/biconnected_components.hpp:377:34: required from ‘std::pair boost::biconnected_components(const Graph&, ComponentMap, OutputIterator) [with Graph = adjacency_list, property >; ComponentMap = iterator_property_map<__gnu_cxx::__normal_iterator >, adj_list_edge_property_map, edge_index_t>, long unsigned int, long unsigned int&>; OutputIterator = std::back_insert_iterator >]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/make_biconnected_planar.hpp:44:27: required from ‘void boost::make_biconnected_planar(Graph&, PlanarEmbedding, EdgeIndexMap, AddEdgeVisitor&) [with Graph = adjacency_list, property >; PlanarEmbedding = std::vector >*; EdgeIndexMap = adj_list_edge_property_map, edge_index_t>; AddEdgeVisitor = my_add_edge_visitor, property >, long unsigned int>]’ planar.cpp:213:35: required from here /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::EqualityComparable::~EqualityComparable() [with TT = __gnu_cxx::__normal_iterator >]’ 37 | ~model() | ^ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:233:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 233 | BOOST_CONCEPT_USAGE(EqualityComparable) { | ^~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::InputIterator<__gnu_cxx::__normal_iterator > >]’: /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements > > >]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:512:7: required from ‘struct boost::InputIterator<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:540:3: required from ‘struct boost::ForwardIterator<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:568:3: required from ‘struct boost::BidirectionalIterator<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:597:3: required from ‘struct boost::RandomAccessIterator<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:597:3: [ skipping 5 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.4-3.20/BH/include/boost/property_map/property_map.hpp:354:5: required from ‘boost::iterator_property_map boost::make_iterator_property_map(RAIter, ID, Value) [with RAIter = __gnu_cxx::__normal_iterator >; Value = long unsigned int; ID = vec_adj_list_vertex_id_map, long unsigned int>]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/biconnected_components.hpp:338:43: required from ‘static std::pair boost::detail::bicomp_dispatch1::apply(const Graph&, ComponentMap, OutputIterator, VertexIndexMap, const boost::bgl_named_params&, boost::param_not_found) [with Graph = boost::adjacency_list, boost::property >; ComponentMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::adj_list_edge_property_map, boost::edge_index_t>, long unsigned int, long unsigned int&>; OutputIterator = std::back_insert_iterator >; VertexIndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>; P = int; T = boost::buffer_param_t; R = boost::no_property]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/biconnected_components.hpp:368:60: required from ‘std::pair boost::biconnected_components(const Graph&, ComponentMap, OutputIterator, const bgl_named_params&) [with Graph = adjacency_list, property >; ComponentMap = iterator_property_map<__gnu_cxx::__normal_iterator >, adj_list_edge_property_map, edge_index_t>, long unsigned int, long unsigned int&>; OutputIterator = std::back_insert_iterator >; P = int; T = buffer_param_t; R = no_property]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/biconnected_components.hpp:377:34: required from ‘std::pair boost::biconnected_components(const Graph&, ComponentMap, OutputIterator) [with Graph = adjacency_list, property >; ComponentMap = iterator_property_map<__gnu_cxx::__normal_iterator >, adj_list_edge_property_map, edge_index_t>, long unsigned int, long unsigned int&>; OutputIterator = std::back_insert_iterator >]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/make_biconnected_planar.hpp:44:27: required from ‘void boost::make_biconnected_planar(Graph&, PlanarEmbedding, EdgeIndexMap, AddEdgeVisitor&) [with Graph = adjacency_list, property >; PlanarEmbedding = std::vector >*; EdgeIndexMap = adj_list_edge_property_map, edge_index_t>; AddEdgeVisitor = my_add_edge_visitor, property >, long unsigned int>]’ planar.cpp:213:35: required from here /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::InputIterator::~InputIterator() [with TT = __gnu_cxx::__normal_iterator >]’ 37 | ~model() | ^ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:512:7: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 512 | BOOST_CONCEPT_USAGE(InputIterator) | ^~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::ForwardIterator<__gnu_cxx::__normal_iterator > >]’: /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements > > >]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:543:7: required from ‘struct boost::ForwardIterator<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:568:3: required from ‘struct boost::BidirectionalIterator<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:597:3: required from ‘struct boost::RandomAccessIterator<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:597:3: required from ‘struct boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:32:62: [ skipping 4 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.4-3.20/BH/include/boost/property_map/property_map.hpp:354:5: required from ‘boost::iterator_property_map boost::make_iterator_property_map(RAIter, ID, Value) [with RAIter = __gnu_cxx::__normal_iterator >; Value = long unsigned int; ID = vec_adj_list_vertex_id_map, long unsigned int>]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/biconnected_components.hpp:338:43: required from ‘static std::pair boost::detail::bicomp_dispatch1::apply(const Graph&, ComponentMap, OutputIterator, VertexIndexMap, const boost::bgl_named_params&, boost::param_not_found) [with Graph = boost::adjacency_list, boost::property >; ComponentMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::adj_list_edge_property_map, boost::edge_index_t>, long unsigned int, long unsigned int&>; OutputIterator = std::back_insert_iterator >; VertexIndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>; P = int; T = boost::buffer_param_t; R = boost::no_property]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/biconnected_components.hpp:368:60: required from ‘std::pair boost::biconnected_components(const Graph&, ComponentMap, OutputIterator, const bgl_named_params&) [with Graph = adjacency_list, property >; ComponentMap = iterator_property_map<__gnu_cxx::__normal_iterator >, adj_list_edge_property_map, edge_index_t>, long unsigned int, long unsigned int&>; OutputIterator = std::back_insert_iterator >; P = int; T = buffer_param_t; R = no_property]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/biconnected_components.hpp:377:34: required from ‘std::pair boost::biconnected_components(const Graph&, ComponentMap, OutputIterator) [with Graph = adjacency_list, property >; ComponentMap = iterator_property_map<__gnu_cxx::__normal_iterator >, adj_list_edge_property_map, edge_index_t>, long unsigned int, long unsigned int&>; OutputIterator = std::back_insert_iterator >]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/make_biconnected_planar.hpp:44:27: required from ‘void boost::make_biconnected_planar(Graph&, PlanarEmbedding, EdgeIndexMap, AddEdgeVisitor&) [with Graph = adjacency_list, property >; PlanarEmbedding = std::vector >*; EdgeIndexMap = adj_list_edge_property_map, edge_index_t>; AddEdgeVisitor = my_add_edge_visitor, property >, long unsigned int>]’ planar.cpp:213:35: required from here /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::ForwardIterator::~ForwardIterator() [with TT = __gnu_cxx::__normal_iterator >]’ 37 | ~model() | ^ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:543:7: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 543 | BOOST_CONCEPT_USAGE(ForwardIterator) | ^~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::BidirectionalIterator<__gnu_cxx::__normal_iterator > >]’: /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements > > >]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:571:7: required from ‘struct boost::BidirectionalIterator<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:597:3: required from ‘struct boost::RandomAccessIterator<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:597:3: required from ‘struct boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator > >]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:42:5: [ skipping 3 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.4-3.20/BH/include/boost/property_map/property_map.hpp:354:5: required from ‘boost::iterator_property_map boost::make_iterator_property_map(RAIter, ID, Value) [with RAIter = __gnu_cxx::__normal_iterator >; Value = long unsigned int; ID = vec_adj_list_vertex_id_map, long unsigned int>]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/biconnected_components.hpp:338:43: required from ‘static std::pair boost::detail::bicomp_dispatch1::apply(const Graph&, ComponentMap, OutputIterator, VertexIndexMap, const boost::bgl_named_params&, boost::param_not_found) [with Graph = boost::adjacency_list, boost::property >; ComponentMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::adj_list_edge_property_map, boost::edge_index_t>, long unsigned int, long unsigned int&>; OutputIterator = std::back_insert_iterator >; VertexIndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>; P = int; T = boost::buffer_param_t; R = boost::no_property]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/biconnected_components.hpp:368:60: required from ‘std::pair boost::biconnected_components(const Graph&, ComponentMap, OutputIterator, const bgl_named_params&) [with Graph = adjacency_list, property >; ComponentMap = iterator_property_map<__gnu_cxx::__normal_iterator >, adj_list_edge_property_map, edge_index_t>, long unsigned int, long unsigned int&>; OutputIterator = std::back_insert_iterator >; P = int; T = buffer_param_t; R = no_property]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/biconnected_components.hpp:377:34: required from ‘std::pair boost::biconnected_components(const Graph&, ComponentMap, OutputIterator) [with Graph = adjacency_list, property >; ComponentMap = iterator_property_map<__gnu_cxx::__normal_iterator >, adj_list_edge_property_map, edge_index_t>, long unsigned int, long unsigned int&>; OutputIterator = std::back_insert_iterator >]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/make_biconnected_planar.hpp:44:27: required from ‘void boost::make_biconnected_planar(Graph&, PlanarEmbedding, EdgeIndexMap, AddEdgeVisitor&) [with Graph = adjacency_list, property >; PlanarEmbedding = std::vector >*; EdgeIndexMap = adj_list_edge_property_map, edge_index_t>; AddEdgeVisitor = my_add_edge_visitor, property >, long unsigned int>]’ planar.cpp:213:35: required from here /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::BidirectionalIterator::~BidirectionalIterator() [with TT = __gnu_cxx::__normal_iterator >]’ 37 | ~model() | ^ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:571:7: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 571 | BOOST_CONCEPT_USAGE(BidirectionalIterator) | ^~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::Comparable<__gnu_cxx::__normal_iterator > >]’: /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements > > >]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:253:5: required from ‘struct boost::Comparable<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:597:3: required from ‘struct boost::RandomAccessIterator<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:597:3: required from ‘struct boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator > >]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:42:5: [ skipping 3 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.4-3.20/BH/include/boost/property_map/property_map.hpp:354:5: required from ‘boost::iterator_property_map boost::make_iterator_property_map(RAIter, ID, Value) [with RAIter = __gnu_cxx::__normal_iterator >; Value = long unsigned int; ID = vec_adj_list_vertex_id_map, long unsigned int>]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/biconnected_components.hpp:338:43: required from ‘static std::pair boost::detail::bicomp_dispatch1::apply(const Graph&, ComponentMap, OutputIterator, VertexIndexMap, const boost::bgl_named_params&, boost::param_not_found) [with Graph = boost::adjacency_list, boost::property >; ComponentMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::adj_list_edge_property_map, boost::edge_index_t>, long unsigned int, long unsigned int&>; OutputIterator = std::back_insert_iterator >; VertexIndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>; P = int; T = boost::buffer_param_t; R = boost::no_property]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/biconnected_components.hpp:368:60: required from ‘std::pair boost::biconnected_components(const Graph&, ComponentMap, OutputIterator, const bgl_named_params&) [with Graph = adjacency_list, property >; ComponentMap = iterator_property_map<__gnu_cxx::__normal_iterator >, adj_list_edge_property_map, edge_index_t>, long unsigned int, long unsigned int&>; OutputIterator = std::back_insert_iterator >; P = int; T = buffer_param_t; R = no_property]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/biconnected_components.hpp:377:34: required from ‘std::pair boost::biconnected_components(const Graph&, ComponentMap, OutputIterator) [with Graph = adjacency_list, property >; ComponentMap = iterator_property_map<__gnu_cxx::__normal_iterator >, adj_list_edge_property_map, edge_index_t>, long unsigned int, long unsigned int&>; OutputIterator = std::back_insert_iterator >]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/make_biconnected_planar.hpp:44:27: required from ‘void boost::make_biconnected_planar(Graph&, PlanarEmbedding, EdgeIndexMap, AddEdgeVisitor&) [with Graph = adjacency_list, property >; PlanarEmbedding = std::vector >*; EdgeIndexMap = adj_list_edge_property_map, edge_index_t>; AddEdgeVisitor = my_add_edge_visitor, property >, long unsigned int>]’ planar.cpp:213:35: required from here /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::Comparable::~Comparable() [with TT = __gnu_cxx::__normal_iterator >]’ 37 | ~model() | ^ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:253:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 253 | BOOST_CONCEPT_USAGE(Comparable) { | ^~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::RandomAccessIterator<__gnu_cxx::__normal_iterator > >]’: /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements > > >]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:601:7: required from ‘struct boost::RandomAccessIterator<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:597:3: required from ‘struct boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator > >]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied > > >::value’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:45:51: [ skipping 2 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.4-3.20/BH/include/boost/property_map/property_map.hpp:354:5: required from ‘boost::iterator_property_map boost::make_iterator_property_map(RAIter, ID, Value) [with RAIter = __gnu_cxx::__normal_iterator >; Value = long unsigned int; ID = vec_adj_list_vertex_id_map, long unsigned int>]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/biconnected_components.hpp:338:43: required from ‘static std::pair boost::detail::bicomp_dispatch1::apply(const Graph&, ComponentMap, OutputIterator, VertexIndexMap, const boost::bgl_named_params&, boost::param_not_found) [with Graph = boost::adjacency_list, boost::property >; ComponentMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::adj_list_edge_property_map, boost::edge_index_t>, long unsigned int, long unsigned int&>; OutputIterator = std::back_insert_iterator >; VertexIndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>; P = int; T = boost::buffer_param_t; R = boost::no_property]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/biconnected_components.hpp:368:60: required from ‘std::pair boost::biconnected_components(const Graph&, ComponentMap, OutputIterator, const bgl_named_params&) [with Graph = adjacency_list, property >; ComponentMap = iterator_property_map<__gnu_cxx::__normal_iterator >, adj_list_edge_property_map, edge_index_t>, long unsigned int, long unsigned int&>; OutputIterator = std::back_insert_iterator >; P = int; T = buffer_param_t; R = no_property]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/biconnected_components.hpp:377:34: required from ‘std::pair boost::biconnected_components(const Graph&, ComponentMap, OutputIterator) [with Graph = adjacency_list, property >; ComponentMap = iterator_property_map<__gnu_cxx::__normal_iterator >, adj_list_edge_property_map, edge_index_t>, long unsigned int, long unsigned int&>; OutputIterator = std::back_insert_iterator >]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/make_biconnected_planar.hpp:44:27: required from ‘void boost::make_biconnected_planar(Graph&, PlanarEmbedding, EdgeIndexMap, AddEdgeVisitor&) [with Graph = adjacency_list, property >; PlanarEmbedding = std::vector >*; EdgeIndexMap = adj_list_edge_property_map, edge_index_t>; AddEdgeVisitor = my_add_edge_visitor, property >, long unsigned int>]’ planar.cpp:213:35: required from here /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::RandomAccessIterator::~RandomAccessIterator() [with TT = __gnu_cxx::__normal_iterator >]’ 37 | ~model() | ^ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:601:7: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 601 | BOOST_CONCEPT_USAGE(RandomAccessIterator) | ^~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements > >]’: /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/graph_concepts.hpp:66:5: required from ‘struct boost::concepts::Graph >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/graph_concepts.hpp:176:1: required from ‘struct boost::concepts::VertexListGraph >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/graph_concepts.hpp:176:1: required from ‘struct boost::concepts::VertexListGraphConcept >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::concepts::VertexListGraphConcept >]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied > >::value’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:45:51: [ skipping 3 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/isomorphism.hpp:651:42: required from ‘bool boost::graph::detail::isomorphism_impl::operator()(const Graph1&, const Graph2&, const ArgPack&) const [with ArgPack = boost::parameter::aux::empty_arg_list; Graph1 = boost::adjacency_list; Graph2 = boost::adjacency_list]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/isomorphism.hpp:662:5: required from ‘typename boost::result_of(Param0, Param1, const ArgPack&)>::type boost::graph::isomorphism_with_named_params(const Param0&, const Param1&, const ArgPack&) [with Param0 = boost::adjacency_list; Param1 = boost::adjacency_list; ArgPack = boost::parameter::aux::empty_arg_list; typename boost::result_of(Param0, Param1, const ArgPack&)>::type = bool]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/isomorphism.hpp:666:1: required from ‘typename boost::result_of(Param0, Param1, const boost::parameter::aux::empty_arg_list&)>::type boost::isomorphism(const Param0&, const Param1&) [with Param0 = adjacency_list; Param1 = adjacency_list; typename result_of(Param0, Param1, const parameter::aux::empty_arg_list&)>::type = bool]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/is_kuratowski_subgraph.hpp:278:34: required from ‘bool boost::is_kuratowski_subgraph(const Graph&, ForwardIterator, ForwardIterator, VertexIndexMap) [with Graph = adjacency_list, property >; ForwardIterator = __gnu_cxx::__normal_iterator*, std::vector > >; VertexIndexMap = vec_adj_list_vertex_id_map, long unsigned int>]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/is_kuratowski_subgraph.hpp:290:34: required from ‘bool boost::is_kuratowski_subgraph(const Graph&, ForwardIterator, ForwardIterator) [with Graph = adjacency_list, property >; ForwardIterator = __gnu_cxx::__normal_iterator*, std::vector > >]’ planar.cpp:435:37: required from here /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::concepts::Graph >]’ 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ^ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements > >]’: /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/graph_concepts.hpp:182:5: required from ‘struct boost::concepts::VertexListGraph >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/graph_concepts.hpp:176:1: required from ‘struct boost::concepts::VertexListGraphConcept >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::concepts::VertexListGraphConcept >]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied > >::value’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied > >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:72:8: [ skipping 2 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/isomorphism.hpp:651:42: required from ‘bool boost::graph::detail::isomorphism_impl::operator()(const Graph1&, const Graph2&, const ArgPack&) const [with ArgPack = boost::parameter::aux::empty_arg_list; Graph1 = boost::adjacency_list; Graph2 = boost::adjacency_list]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/isomorphism.hpp:662:5: required from ‘typename boost::result_of(Param0, Param1, const ArgPack&)>::type boost::graph::isomorphism_with_named_params(const Param0&, const Param1&, const ArgPack&) [with Param0 = boost::adjacency_list; Param1 = boost::adjacency_list; ArgPack = boost::parameter::aux::empty_arg_list; typename boost::result_of(Param0, Param1, const ArgPack&)>::type = bool]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/isomorphism.hpp:666:1: required from ‘typename boost::result_of(Param0, Param1, const boost::parameter::aux::empty_arg_list&)>::type boost::isomorphism(const Param0&, const Param1&) [with Param0 = adjacency_list; Param1 = adjacency_list; typename result_of(Param0, Param1, const parameter::aux::empty_arg_list&)>::type = bool]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/is_kuratowski_subgraph.hpp:278:34: required from ‘bool boost::is_kuratowski_subgraph(const Graph&, ForwardIterator, ForwardIterator, VertexIndexMap) [with Graph = adjacency_list, property >; ForwardIterator = __gnu_cxx::__normal_iterator*, std::vector > >; VertexIndexMap = vec_adj_list_vertex_id_map, long unsigned int>]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/is_kuratowski_subgraph.hpp:290:34: required from ‘bool boost::is_kuratowski_subgraph(const Graph&, ForwardIterator, ForwardIterator) [with Graph = adjacency_list, property >; ForwardIterator = __gnu_cxx::__normal_iterator*, std::vector > >]’ planar.cpp:435:37: required from here /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::concepts::VertexListGraph >]’ 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ^ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::VertexListGraphConcept >]’: /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/isomorphism.hpp:494:5: required from ‘bool boost::isomorphism(const Graph1&, const Graph2&, IsoMapping, Invariant1, Invariant2, std::size_t, IndexMap1, IndexMap2) [with Graph1 = adjacency_list; Graph2 = adjacency_list; IsoMapping = shared_array_property_map >; Invariant1 = degree_vertex_invariant >, adjacency_list >; Invariant2 = degree_vertex_invariant >, adjacency_list >; IndexMap1 = vec_adj_list_vertex_id_map; IndexMap2 = vec_adj_list_vertex_id_map; std::size_t = long unsigned int]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/isomorphism.hpp:651:42: required from ‘bool boost::graph::detail::isomorphism_impl::operator()(const Graph1&, const Graph2&, const ArgPack&) const [with ArgPack = boost::parameter::aux::empty_arg_list; Graph1 = boost::adjacency_list; Graph2 = boost::adjacency_list]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/isomorphism.hpp:662:5: required from ‘typename boost::result_of(Param0, Param1, const ArgPack&)>::type boost::graph::isomorphism_with_named_params(const Param0&, const Param1&, const ArgPack&) [with Param0 = boost::adjacency_list; Param1 = boost::adjacency_list; ArgPack = boost::parameter::aux::empty_arg_list; typename boost::result_of(Param0, Param1, const ArgPack&)>::type = bool]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/isomorphism.hpp:666:1: required from ‘typename boost::result_of(Param0, Param1, const boost::parameter::aux::empty_arg_list&)>::type boost::isomorphism(const Param0&, const Param1&) [with Param0 = adjacency_list; Param1 = adjacency_list; typename result_of(Param0, Param1, const parameter::aux::empty_arg_list&)>::type = bool]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/is_kuratowski_subgraph.hpp:278:34: required from ‘bool boost::is_kuratowski_subgraph(const Graph&, ForwardIterator, ForwardIterator, VertexIndexMap) [with Graph = adjacency_list, property >; ForwardIterator = __gnu_cxx::__normal_iterator*, std::vector > >; VertexIndexMap = vec_adj_list_vertex_id_map, long unsigned int>]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/is_kuratowski_subgraph.hpp:290:34: required from ‘bool boost::is_kuratowski_subgraph(const Graph&, ForwardIterator, ForwardIterator) [with Graph = adjacency_list, property >; ForwardIterator = __gnu_cxx::__normal_iterator*, std::vector > >]’ planar.cpp:435:37: required from here /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/graph_concepts.hpp:176:15: note: in a call to non-static member function ‘boost::concepts::VertexListGraphConcept >::~VertexListGraphConcept()’ 176 | BOOST_concept(VertexListGraph, (G)) : Graph< G > | ^~~~~~~~~~~~~~~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/preprocessor/cat.hpp:29:34: note: in definition of macro ‘BOOST_PP_CAT_I’ 29 | # define BOOST_PP_CAT_I(a, b) a ## b | ^ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/concept_def.hpp:23:12: note: in expansion of macro ‘BOOST_PP_CAT’ 23 | struct BOOST_PP_CAT(name,Concept) \ | ^~~~~~~~~~~~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/graph_concepts.hpp:176:1: note: in expansion of macro ‘BOOST_concept’ 176 | BOOST_concept(VertexListGraph, (G)) : Graph< G > | ^~~~~~~~~~~~~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements > >]’: /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/graph_concepts.hpp:233:5: required from ‘struct boost::concepts::EdgeListGraph >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/graph_concepts.hpp:226:1: required from ‘struct boost::concepts::EdgeListGraphConcept >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::concepts::EdgeListGraphConcept >]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied > >::value’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied > >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:72:8: [ skipping 2 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/isomorphism.hpp:651:42: required from ‘bool boost::graph::detail::isomorphism_impl::operator()(const Graph1&, const Graph2&, const ArgPack&) const [with ArgPack = boost::parameter::aux::empty_arg_list; Graph1 = boost::adjacency_list; Graph2 = boost::adjacency_list]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/isomorphism.hpp:662:5: required from ‘typename boost::result_of(Param0, Param1, const ArgPack&)>::type boost::graph::isomorphism_with_named_params(const Param0&, const Param1&, const ArgPack&) [with Param0 = boost::adjacency_list; Param1 = boost::adjacency_list; ArgPack = boost::parameter::aux::empty_arg_list; typename boost::result_of(Param0, Param1, const ArgPack&)>::type = bool]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/isomorphism.hpp:666:1: required from ‘typename boost::result_of(Param0, Param1, const boost::parameter::aux::empty_arg_list&)>::type boost::isomorphism(const Param0&, const Param1&) [with Param0 = adjacency_list; Param1 = adjacency_list; typename result_of(Param0, Param1, const parameter::aux::empty_arg_list&)>::type = bool]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/is_kuratowski_subgraph.hpp:278:34: required from ‘bool boost::is_kuratowski_subgraph(const Graph&, ForwardIterator, ForwardIterator, VertexIndexMap) [with Graph = adjacency_list, property >; ForwardIterator = __gnu_cxx::__normal_iterator*, std::vector > >; VertexIndexMap = vec_adj_list_vertex_id_map, long unsigned int>]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/is_kuratowski_subgraph.hpp:290:34: required from ‘bool boost::is_kuratowski_subgraph(const Graph&, ForwardIterator, ForwardIterator) [with Graph = adjacency_list, property >; ForwardIterator = __gnu_cxx::__normal_iterator*, std::vector > >]’ planar.cpp:435:37: required from here /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::concepts::EdgeListGraph >]’ 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ^ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::EdgeListGraphConcept >]’: /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/isomorphism.hpp:495:5: required from ‘bool boost::isomorphism(const Graph1&, const Graph2&, IsoMapping, Invariant1, Invariant2, std::size_t, IndexMap1, IndexMap2) [with Graph1 = adjacency_list; Graph2 = adjacency_list; IsoMapping = shared_array_property_map >; Invariant1 = degree_vertex_invariant >, adjacency_list >; Invariant2 = degree_vertex_invariant >, adjacency_list >; IndexMap1 = vec_adj_list_vertex_id_map; IndexMap2 = vec_adj_list_vertex_id_map; std::size_t = long unsigned int]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/isomorphism.hpp:651:42: required from ‘bool boost::graph::detail::isomorphism_impl::operator()(const Graph1&, const Graph2&, const ArgPack&) const [with ArgPack = boost::parameter::aux::empty_arg_list; Graph1 = boost::adjacency_list; Graph2 = boost::adjacency_list]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/isomorphism.hpp:662:5: required from ‘typename boost::result_of(Param0, Param1, const ArgPack&)>::type boost::graph::isomorphism_with_named_params(const Param0&, const Param1&, const ArgPack&) [with Param0 = boost::adjacency_list; Param1 = boost::adjacency_list; ArgPack = boost::parameter::aux::empty_arg_list; typename boost::result_of(Param0, Param1, const ArgPack&)>::type = bool]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/isomorphism.hpp:666:1: required from ‘typename boost::result_of(Param0, Param1, const boost::parameter::aux::empty_arg_list&)>::type boost::isomorphism(const Param0&, const Param1&) [with Param0 = adjacency_list; Param1 = adjacency_list; typename result_of(Param0, Param1, const parameter::aux::empty_arg_list&)>::type = bool]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/is_kuratowski_subgraph.hpp:278:34: required from ‘bool boost::is_kuratowski_subgraph(const Graph&, ForwardIterator, ForwardIterator, VertexIndexMap) [with Graph = adjacency_list, property >; ForwardIterator = __gnu_cxx::__normal_iterator*, std::vector > >; VertexIndexMap = vec_adj_list_vertex_id_map, long unsigned int>]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/is_kuratowski_subgraph.hpp:290:34: required from ‘bool boost::is_kuratowski_subgraph(const Graph&, ForwardIterator, ForwardIterator) [with Graph = adjacency_list, property >; ForwardIterator = __gnu_cxx::__normal_iterator*, std::vector > >]’ planar.cpp:435:37: required from here /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/graph_concepts.hpp:226:15: note: in a call to non-static member function ‘boost::concepts::EdgeListGraphConcept >::~EdgeListGraphConcept()’ 226 | BOOST_concept(EdgeListGraph, (G)) : Graph< G > | ^~~~~~~~~~~~~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/preprocessor/cat.hpp:29:34: note: in definition of macro ‘BOOST_PP_CAT_I’ 29 | # define BOOST_PP_CAT_I(a, b) a ## b | ^ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/concept_def.hpp:23:12: note: in expansion of macro ‘BOOST_PP_CAT’ 23 | struct BOOST_PP_CAT(name,Concept) \ | ^~~~~~~~~~~~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/graph_concepts.hpp:226:1: note: in expansion of macro ‘BOOST_concept’ 226 | BOOST_concept(EdgeListGraph, (G)) : Graph< G > | ^~~~~~~~~~~~~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements >, boost::adjacency_list >, long unsigned int, long unsigned int> >]’: /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:321:7: required from ‘struct boost::UnaryFunction >, boost::adjacency_list >, long unsigned int, long unsigned int>’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:454:3: required from ‘struct boost::AdaptableUnaryFunction >, boost::adjacency_list >, long unsigned int, long unsigned int>’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:454:3: required from ‘struct boost::AdaptableUnaryFunctionConcept >, boost::adjacency_list >, long unsigned int, long unsigned int>’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::AdaptableUnaryFunctionConcept >, boost::adjacency_list >, long unsigned int, long unsigned int>]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied >, boost::adjacency_list >, long unsigned int, long unsigned int> >::value’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:45:51: [ skipping 3 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/isomorphism.hpp:651:42: required from ‘bool boost::graph::detail::isomorphism_impl::operator()(const Graph1&, const Graph2&, const ArgPack&) const [with ArgPack = boost::parameter::aux::empty_arg_list; Graph1 = boost::adjacency_list; Graph2 = boost::adjacency_list]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/isomorphism.hpp:662:5: required from ‘typename boost::result_of(Param0, Param1, const ArgPack&)>::type boost::graph::isomorphism_with_named_params(const Param0&, const Param1&, const ArgPack&) [with Param0 = boost::adjacency_list; Param1 = boost::adjacency_list; ArgPack = boost::parameter::aux::empty_arg_list; typename boost::result_of(Param0, Param1, const ArgPack&)>::type = bool]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/isomorphism.hpp:666:1: required from ‘typename boost::result_of(Param0, Param1, const boost::parameter::aux::empty_arg_list&)>::type boost::isomorphism(const Param0&, const Param1&) [with Param0 = adjacency_list; Param1 = adjacency_list; typename result_of(Param0, Param1, const parameter::aux::empty_arg_list&)>::type = bool]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/is_kuratowski_subgraph.hpp:278:34: required from ‘bool boost::is_kuratowski_subgraph(const Graph&, ForwardIterator, ForwardIterator, VertexIndexMap) [with Graph = adjacency_list, property >; ForwardIterator = __gnu_cxx::__normal_iterator*, std::vector > >; VertexIndexMap = vec_adj_list_vertex_id_map, long unsigned int>]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/is_kuratowski_subgraph.hpp:290:34: required from ‘bool boost::is_kuratowski_subgraph(const Graph&, ForwardIterator, ForwardIterator) [with Graph = adjacency_list, property >; ForwardIterator = __gnu_cxx::__normal_iterator*, std::vector > >]’ planar.cpp:435:37: required from here /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::UnaryFunction >, boost::adjacency_list >, long unsigned int, long unsigned int>]’ 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ^ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::AdaptableUnaryFunctionConcept >, boost::adjacency_list >, long unsigned int, long unsigned int>]’: /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/isomorphism.hpp:504:5: required from ‘bool boost::isomorphism(const Graph1&, const Graph2&, IsoMapping, Invariant1, Invariant2, std::size_t, IndexMap1, IndexMap2) [with Graph1 = adjacency_list; Graph2 = adjacency_list; IsoMapping = shared_array_property_map >; Invariant1 = degree_vertex_invariant >, adjacency_list >; Invariant2 = degree_vertex_invariant >, adjacency_list >; IndexMap1 = vec_adj_list_vertex_id_map; IndexMap2 = vec_adj_list_vertex_id_map; std::size_t = long unsigned int]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/isomorphism.hpp:651:42: required from ‘bool boost::graph::detail::isomorphism_impl::operator()(const Graph1&, const Graph2&, const ArgPack&) const [with ArgPack = boost::parameter::aux::empty_arg_list; Graph1 = boost::adjacency_list; Graph2 = boost::adjacency_list]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/isomorphism.hpp:662:5: required from ‘typename boost::result_of(Param0, Param1, const ArgPack&)>::type boost::graph::isomorphism_with_named_params(const Param0&, const Param1&, const ArgPack&) [with Param0 = boost::adjacency_list; Param1 = boost::adjacency_list; ArgPack = boost::parameter::aux::empty_arg_list; typename boost::result_of(Param0, Param1, const ArgPack&)>::type = bool]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/isomorphism.hpp:666:1: required from ‘typename boost::result_of(Param0, Param1, const boost::parameter::aux::empty_arg_list&)>::type boost::isomorphism(const Param0&, const Param1&) [with Param0 = adjacency_list; Param1 = adjacency_list; typename result_of(Param0, Param1, const parameter::aux::empty_arg_list&)>::type = bool]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/is_kuratowski_subgraph.hpp:278:34: required from ‘bool boost::is_kuratowski_subgraph(const Graph&, ForwardIterator, ForwardIterator, VertexIndexMap) [with Graph = adjacency_list, property >; ForwardIterator = __gnu_cxx::__normal_iterator*, std::vector > >; VertexIndexMap = vec_adj_list_vertex_id_map, long unsigned int>]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/is_kuratowski_subgraph.hpp:290:34: required from ‘bool boost::is_kuratowski_subgraph(const Graph&, ForwardIterator, ForwardIterator) [with Graph = adjacency_list, property >; ForwardIterator = __gnu_cxx::__normal_iterator*, std::vector > >]’ planar.cpp:435:37: required from here /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:454:17: note: in a call to non-static member function ‘boost::AdaptableUnaryFunctionConcept >, boost::adjacency_list >, long unsigned int, long unsigned int>::~AdaptableUnaryFunctionConcept()’ 454 | BOOST_concept(AdaptableUnaryFunction,(Func)(Return)(Arg)) | ^~~~~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/preprocessor/cat.hpp:29:34: note: in definition of macro ‘BOOST_PP_CAT_I’ 29 | # define BOOST_PP_CAT_I(a, b) a ## b | ^ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/concept_def.hpp:23:12: note: in expansion of macro ‘BOOST_PP_CAT’ 23 | struct BOOST_PP_CAT(name,Concept) \ | ^~~~~~~~~~~~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:454:3: note: in expansion of macro ‘BOOST_concept’ 454 | BOOST_concept(AdaptableUnaryFunction,(Func)(Return)(Arg)) | ^~~~~~~~~~~~~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::constraint::failed() [with Model = boost::ReadWritePropertyMapConcept >, long unsigned int>]’: /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/depth_first_search.hpp:134:9: required from ‘bool boost::isomorphism(const Graph1&, const Graph2&, IsoMapping, Invariant1, Invariant2, std::size_t, IndexMap1, IndexMap2) [with Graph1 = adjacency_list; Graph2 = adjacency_list; IsoMapping = shared_array_property_map >; Invariant1 = degree_vertex_invariant >, adjacency_list >; Invariant2 = degree_vertex_invariant >, adjacency_list >; IndexMap1 = vec_adj_list_vertex_id_map; IndexMap2 = vec_adj_list_vertex_id_map; std::size_t = long unsigned int]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/isomorphism.hpp:651:42: required from ‘bool boost::graph::detail::isomorphism_impl::operator()(const Graph1&, const Graph2&, const ArgPack&) const [with ArgPack = boost::parameter::aux::empty_arg_list; Graph1 = boost::adjacency_list; Graph2 = boost::adjacency_list]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/isomorphism.hpp:662:5: required from ‘typename boost::result_of(Param0, Param1, const ArgPack&)>::type boost::graph::isomorphism_with_named_params(const Param0&, const Param1&, const ArgPack&) [with Param0 = boost::adjacency_list; Param1 = boost::adjacency_list; ArgPack = boost::parameter::aux::empty_arg_list; typename boost::result_of(Param0, Param1, const ArgPack&)>::type = bool]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/isomorphism.hpp:666:1: required from ‘typename boost::result_of(Param0, Param1, const boost::parameter::aux::empty_arg_list&)>::type boost::isomorphism(const Param0&, const Param1&) [with Param0 = adjacency_list; Param1 = adjacency_list; typename result_of(Param0, Param1, const parameter::aux::empty_arg_list&)>::type = bool]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/is_kuratowski_subgraph.hpp:278:34: required from ‘bool boost::is_kuratowski_subgraph(const Graph&, ForwardIterator, ForwardIterator, VertexIndexMap) [with Graph = adjacency_list, property >; ForwardIterator = __gnu_cxx::__normal_iterator*, std::vector > >; VertexIndexMap = vec_adj_list_vertex_id_map, long unsigned int>]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/is_kuratowski_subgraph.hpp:290:34: required from ‘bool boost::is_kuratowski_subgraph(const Graph&, ForwardIterator, ForwardIterator) [with Graph = adjacency_list, property >; ForwardIterator = __gnu_cxx::__normal_iterator*, std::vector > >]’ planar.cpp:435:37: required from here /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:65:52: warning: ‘this’ pointer is null [-Wnonnull] 65 | static void failed() { ((Model*)0)->constraints(); } | ~~~~~~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/property_map/property_map.hpp:205:10: note: in a call to non-static member function ‘void boost::ReadWritePropertyMapConcept::constraints() [with PMap = boost::shared_array_property_map >; Key = long unsigned int]’ 205 | void constraints() { | ^~~~~~~~~~~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::constraint::failed() [with Model = boost::ReadablePropertyMapConcept, long unsigned int>]’: /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/isomorphism.hpp:515:5: required from ‘bool boost::isomorphism(const Graph1&, const Graph2&, IsoMapping, Invariant1, Invariant2, std::size_t, IndexMap1, IndexMap2) [with Graph1 = adjacency_list; Graph2 = adjacency_list; IsoMapping = shared_array_property_map >; Invariant1 = degree_vertex_invariant >, adjacency_list >; Invariant2 = degree_vertex_invariant >, adjacency_list >; IndexMap1 = vec_adj_list_vertex_id_map; IndexMap2 = vec_adj_list_vertex_id_map; std::size_t = long unsigned int]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/isomorphism.hpp:651:42: required from ‘bool boost::graph::detail::isomorphism_impl::operator()(const Graph1&, const Graph2&, const ArgPack&) const [with ArgPack = boost::parameter::aux::empty_arg_list; Graph1 = boost::adjacency_list; Graph2 = boost::adjacency_list]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/isomorphism.hpp:662:5: required from ‘typename boost::result_of(Param0, Param1, const ArgPack&)>::type boost::graph::isomorphism_with_named_params(const Param0&, const Param1&, const ArgPack&) [with Param0 = boost::adjacency_list; Param1 = boost::adjacency_list; ArgPack = boost::parameter::aux::empty_arg_list; typename boost::result_of(Param0, Param1, const ArgPack&)>::type = bool]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/isomorphism.hpp:666:1: required from ‘typename boost::result_of(Param0, Param1, const boost::parameter::aux::empty_arg_list&)>::type boost::isomorphism(const Param0&, const Param1&) [with Param0 = adjacency_list; Param1 = adjacency_list; typename result_of(Param0, Param1, const parameter::aux::empty_arg_list&)>::type = bool]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/is_kuratowski_subgraph.hpp:278:34: required from ‘bool boost::is_kuratowski_subgraph(const Graph&, ForwardIterator, ForwardIterator, VertexIndexMap) [with Graph = adjacency_list, property >; ForwardIterator = __gnu_cxx::__normal_iterator*, std::vector > >; VertexIndexMap = vec_adj_list_vertex_id_map, long unsigned int>]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/is_kuratowski_subgraph.hpp:290:34: required from ‘bool boost::is_kuratowski_subgraph(const Graph&, ForwardIterator, ForwardIterator) [with Graph = adjacency_list, property >; ForwardIterator = __gnu_cxx::__normal_iterator*, std::vector > >]’ planar.cpp:435:37: required from here /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:65:52: warning: ‘this’ pointer is null [-Wnonnull] 65 | static void failed() { ((Model*)0)->constraints(); } | ~~~~~~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/property_map/property_map.hpp:147:10: note: in a call to non-static member function ‘void boost::ReadablePropertyMapConcept::constraints() [with PMap = boost::vec_adj_list_vertex_id_map; Key = long unsigned int]’ 147 | void constraints() { | ^~~~~~~~~~~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&> > > >]’: /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:167:5: required from ‘struct boost::CopyConstructible >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&> > >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:165:3: required from ‘struct boost::CopyConstructibleConcept >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&> > >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::CopyConstructibleConcept >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&> > >]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&> > > >::value’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&> > > >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:72:8: [ skipping 7 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/depth_first_search.hpp:397:42: required from ‘void boost::graph::detail::depth_first_search_impl::operator()(const Graph&, const ArgPack&) const [with ArgPack = boost::parameter::aux::arg_list >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&> > >, boost::parameter::aux::empty_arg_list, std::integral_constant >; Graph = boost::adjacency_list, boost::property >]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/depth_first_search.hpp:406:5: required from ‘typename boost::result_of(Param0, const ArgPack&)>::type boost::graph::depth_first_search_with_named_params(const Param0&, const ArgPack&) [with Param0 = boost::adjacency_list, boost::property >; ArgPack = boost::parameter::aux::arg_list >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&> > >, boost::parameter::aux::empty_arg_list, std::integral_constant >; typename boost::result_of(Param0, const ArgPack&)>::type = void]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/depth_first_search.hpp:409:1: required from ‘typename boost::result_of(Param0, const typename boost::detail::convert_bgl_params_to_boost_parameter >::type&)>::type boost::depth_first_search(const Param0&, const bgl_named_params&) [with Param0 = adjacency_list, property >; P = detail::components_recorder >, vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&> >; T = graph_visitor_t; R = no_property; typename result_of(Param0, const typename detail::convert_bgl_params_to_boost_parameter >::type&)>::type = void; typename detail::convert_bgl_params_to_boost_parameter >::type = parameter::aux::arg_list >, vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&> > >, parameter::aux::empty_arg_list, std::integral_constant >]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/connected_components.hpp:106:23: required from ‘typename boost::property_traits::value_type boost::connected_components(const Graph&, ComponentMap, typename enable_if_c::traversal_category>::value, graph::detail::no_parameter>::type) [with Graph = adjacency_list, property >; ComponentMap = iterator_property_map<__gnu_cxx::__normal_iterator >, vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>; typename property_traits::value_type = long unsigned int; typename enable_if_c::traversal_category>::value, graph::detail::no_parameter>::type = graph::detail::no_parameter; typename graph_traits::traversal_category = undir_adj_list_traversal_tag]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/make_connected.hpp:38:51: required from ‘void boost::make_connected(Graph&, VertexIndexMap, AddEdgeVisitor&) [with Graph = adjacency_list, property >; VertexIndexMap = vec_adj_list_vertex_id_map, long unsigned int>; AddEdgeVisitor = my_add_edge_visitor, property >, long unsigned int>]’ planar.cpp:211:26: required from here /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::CopyConstructible >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&> > >]’ 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ^ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::CopyConstructibleConcept >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&> > >]’: /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/depth_first_search.hpp:41:9: required from ‘void boost::DFSVisitorConcept::constraints() [with Visitor = boost::detail::components_recorder >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&> >; Graph = boost::adjacency_list, boost::property >]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::DFSVisitorConcept >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&> >, boost::adjacency_list, boost::property > >]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&> >, boost::adjacency_list, boost::property > > >::value’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&> >, boost::adjacency_list, boost::property > > >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:72:8: [ skipping 2 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/depth_first_search.hpp:397:42: required from ‘void boost::graph::detail::depth_first_search_impl::operator()(const Graph&, const ArgPack&) const [with ArgPack = boost::parameter::aux::arg_list >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&> > >, boost::parameter::aux::empty_arg_list, std::integral_constant >; Graph = boost::adjacency_list, boost::property >]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/depth_first_search.hpp:406:5: required from ‘typename boost::result_of(Param0, const ArgPack&)>::type boost::graph::depth_first_search_with_named_params(const Param0&, const ArgPack&) [with Param0 = boost::adjacency_list, boost::property >; ArgPack = boost::parameter::aux::arg_list >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&> > >, boost::parameter::aux::empty_arg_list, std::integral_constant >; typename boost::result_of(Param0, const ArgPack&)>::type = void]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/depth_first_search.hpp:409:1: required from ‘typename boost::result_of(Param0, const typename boost::detail::convert_bgl_params_to_boost_parameter >::type&)>::type boost::depth_first_search(const Param0&, const bgl_named_params&) [with Param0 = adjacency_list, property >; P = detail::components_recorder >, vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&> >; T = graph_visitor_t; R = no_property; typename result_of(Param0, const typename detail::convert_bgl_params_to_boost_parameter >::type&)>::type = void; typename detail::convert_bgl_params_to_boost_parameter >::type = parameter::aux::arg_list >, vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&> > >, parameter::aux::empty_arg_list, std::integral_constant >]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/connected_components.hpp:106:23: required from ‘typename boost::property_traits::value_type boost::connected_components(const Graph&, ComponentMap, typename enable_if_c::traversal_category>::value, graph::detail::no_parameter>::type) [with Graph = adjacency_list, property >; ComponentMap = iterator_property_map<__gnu_cxx::__normal_iterator >, vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>; typename property_traits::value_type = long unsigned int; typename enable_if_c::traversal_category>::value, graph::detail::no_parameter>::type = graph::detail::no_parameter; typename graph_traits::traversal_category = undir_adj_list_traversal_tag]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/make_connected.hpp:38:51: required from ‘void boost::make_connected(Graph&, VertexIndexMap, AddEdgeVisitor&) [with Graph = adjacency_list, property >; VertexIndexMap = vec_adj_list_vertex_id_map, long unsigned int>; AddEdgeVisitor = my_add_edge_visitor, property >, long unsigned int>]’ planar.cpp:211:26: required from here /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:165:17: note: in a call to non-static member function ‘boost::CopyConstructibleConcept >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&> > >::~CopyConstructibleConcept()’ 165 | BOOST_concept(CopyConstructible,(TT)) | ^~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/preprocessor/cat.hpp:29:34: note: in definition of macro ‘BOOST_PP_CAT_I’ 29 | # define BOOST_PP_CAT_I(a, b) a ## b | ^ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/concept_def.hpp:23:12: note: in expansion of macro ‘BOOST_PP_CAT’ 23 | struct BOOST_PP_CAT(name,Concept) \ | ^~~~~~~~~~~~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:165:3: note: in expansion of macro ‘BOOST_concept’ 165 | BOOST_concept(CopyConstructible,(TT)) | ^~~~~~~~~~~~~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements, boost::property > > >]’: /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/graph_concepts.hpp:66:5: required from ‘struct boost::concepts::Graph, boost::property > >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/graph_concepts.hpp:75:1: required from ‘struct boost::concepts::IncidenceGraph, boost::property > >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/graph_concepts.hpp:75:1: required from ‘struct boost::concepts::IncidenceGraphConcept, boost::property > >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::concepts::IncidenceGraphConcept, boost::property > >]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied, boost::property > > >::value’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:45:51: [ skipping 4 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/depth_first_search.hpp:397:42: required from ‘void boost::graph::detail::depth_first_search_impl::operator()(const Graph&, const ArgPack&) const [with ArgPack = boost::parameter::aux::arg_list >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&> > >, boost::parameter::aux::empty_arg_list, std::integral_constant >; Graph = boost::adjacency_list, boost::property >]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/depth_first_search.hpp:406:5: required from ‘typename boost::result_of(Param0, const ArgPack&)>::type boost::graph::depth_first_search_with_named_params(const Param0&, const ArgPack&) [with Param0 = boost::adjacency_list, boost::property >; ArgPack = boost::parameter::aux::arg_list >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&> > >, boost::parameter::aux::empty_arg_list, std::integral_constant >; typename boost::result_of(Param0, const ArgPack&)>::type = void]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/depth_first_search.hpp:409:1: required from ‘typename boost::result_of(Param0, const typename boost::detail::convert_bgl_params_to_boost_parameter >::type&)>::type boost::depth_first_search(const Param0&, const bgl_named_params&) [with Param0 = adjacency_list, property >; P = detail::components_recorder >, vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&> >; T = graph_visitor_t; R = no_property; typename result_of(Param0, const typename detail::convert_bgl_params_to_boost_parameter >::type&)>::type = void; typename detail::convert_bgl_params_to_boost_parameter >::type = parameter::aux::arg_list >, vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&> > >, parameter::aux::empty_arg_list, std::integral_constant >]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/connected_components.hpp:106:23: required from ‘typename boost::property_traits::value_type boost::connected_components(const Graph&, ComponentMap, typename enable_if_c::traversal_category>::value, graph::detail::no_parameter>::type) [with Graph = adjacency_list, property >; ComponentMap = iterator_property_map<__gnu_cxx::__normal_iterator >, vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>; typename property_traits::value_type = long unsigned int; typename enable_if_c::traversal_category>::value, graph::detail::no_parameter>::type = graph::detail::no_parameter; typename graph_traits::traversal_category = undir_adj_list_traversal_tag]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/make_connected.hpp:38:51: required from ‘void boost::make_connected(Graph&, VertexIndexMap, AddEdgeVisitor&) [with Graph = adjacency_list, property >; VertexIndexMap = vec_adj_list_vertex_id_map, long unsigned int>; AddEdgeVisitor = my_add_edge_visitor, property >, long unsigned int>]’ planar.cpp:211:26: required from here /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::concepts::Graph, boost::property > >]’ 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ^ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements, boost::property > > >]’: /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/graph_concepts.hpp:87:5: required from ‘struct boost::concepts::IncidenceGraph, boost::property > >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/graph_concepts.hpp:75:1: required from ‘struct boost::concepts::IncidenceGraphConcept, boost::property > >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::concepts::IncidenceGraphConcept, boost::property > >]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied, boost::property > > >::value’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied, boost::property > > >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:72:8: [ skipping 3 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/depth_first_search.hpp:397:42: required from ‘void boost::graph::detail::depth_first_search_impl::operator()(const Graph&, const ArgPack&) const [with ArgPack = boost::parameter::aux::arg_list >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&> > >, boost::parameter::aux::empty_arg_list, std::integral_constant >; Graph = boost::adjacency_list, boost::property >]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/depth_first_search.hpp:406:5: required from ‘typename boost::result_of(Param0, const ArgPack&)>::type boost::graph::depth_first_search_with_named_params(const Param0&, const ArgPack&) [with Param0 = boost::adjacency_list, boost::property >; ArgPack = boost::parameter::aux::arg_list >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&> > >, boost::parameter::aux::empty_arg_list, std::integral_constant >; typename boost::result_of(Param0, const ArgPack&)>::type = void]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/depth_first_search.hpp:409:1: required from ‘typename boost::result_of(Param0, const typename boost::detail::convert_bgl_params_to_boost_parameter >::type&)>::type boost::depth_first_search(const Param0&, const bgl_named_params&) [with Param0 = adjacency_list, property >; P = detail::components_recorder >, vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&> >; T = graph_visitor_t; R = no_property; typename result_of(Param0, const typename detail::convert_bgl_params_to_boost_parameter >::type&)>::type = void; typename detail::convert_bgl_params_to_boost_parameter >::type = parameter::aux::arg_list >, vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&> > >, parameter::aux::empty_arg_list, std::integral_constant >]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/connected_components.hpp:106:23: required from ‘typename boost::property_traits::value_type boost::connected_components(const Graph&, ComponentMap, typename enable_if_c::traversal_category>::value, graph::detail::no_parameter>::type) [with Graph = adjacency_list, property >; ComponentMap = iterator_property_map<__gnu_cxx::__normal_iterator >, vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>; typename property_traits::value_type = long unsigned int; typename enable_if_c::traversal_category>::value, graph::detail::no_parameter>::type = graph::detail::no_parameter; typename graph_traits::traversal_category = undir_adj_list_traversal_tag]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/make_connected.hpp:38:51: required from ‘void boost::make_connected(Graph&, VertexIndexMap, AddEdgeVisitor&) [with Graph = adjacency_list, property >; VertexIndexMap = vec_adj_list_vertex_id_map, long unsigned int>; AddEdgeVisitor = my_add_edge_visitor, property >, long unsigned int>]’ planar.cpp:211:26: required from here /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::concepts::IncidenceGraph, boost::property > >]’ 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ^ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::IncidenceGraphConcept, boost::property > >]’: /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/depth_first_search.hpp:129:9: required from ‘void boost::detail::depth_first_visit_impl(const IncidenceGraph&, typename boost::graph_traits::vertex_descriptor, DFSVisitor&, ColorMap, TerminatorFunc) [with IncidenceGraph = boost::adjacency_list, boost::property >; DFSVisitor = components_recorder >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&> >; ColorMap = boost::shared_array_property_map, long unsigned int> >; TerminatorFunc = nontruth2; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/depth_first_search.hpp:286:39: required from ‘void boost::depth_first_search(const VertexListGraph&, DFSVisitor, ColorMap, typename graph_traits::vertex_descriptor) [with VertexListGraph = adjacency_list, property >; DFSVisitor = detail::components_recorder >, vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&> >; ColorMap = shared_array_property_map, long unsigned int> >; typename graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/depth_first_search.hpp:397:42: required from ‘void boost::graph::detail::depth_first_search_impl::operator()(const Graph&, const ArgPack&) const [with ArgPack = boost::parameter::aux::arg_list >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&> > >, boost::parameter::aux::empty_arg_list, std::integral_constant >; Graph = boost::adjacency_list, boost::property >]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/depth_first_search.hpp:406:5: required from ‘typename boost::result_of(Param0, const ArgPack&)>::type boost::graph::depth_first_search_with_named_params(const Param0&, const ArgPack&) [with Param0 = boost::adjacency_list, boost::property >; ArgPack = boost::parameter::aux::arg_list >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&> > >, boost::parameter::aux::empty_arg_list, std::integral_constant >; typename boost::result_of(Param0, const ArgPack&)>::type = void]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/depth_first_search.hpp:409:1: required from ‘typename boost::result_of(Param0, const typename boost::detail::convert_bgl_params_to_boost_parameter >::type&)>::type boost::depth_first_search(const Param0&, const bgl_named_params&) [with Param0 = adjacency_list, property >; P = detail::components_recorder >, vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&> >; T = graph_visitor_t; R = no_property; typename result_of(Param0, const typename detail::convert_bgl_params_to_boost_parameter >::type&)>::type = void; typename detail::convert_bgl_params_to_boost_parameter >::type = parameter::aux::arg_list >, vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&> > >, parameter::aux::empty_arg_list, std::integral_constant >]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/connected_components.hpp:106:23: required from ‘typename boost::property_traits::value_type boost::connected_components(const Graph&, ComponentMap, typename enable_if_c::traversal_category>::value, graph::detail::no_parameter>::type) [with Graph = adjacency_list, property >; ComponentMap = iterator_property_map<__gnu_cxx::__normal_iterator >, vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>; typename property_traits::value_type = long unsigned int; typename enable_if_c::traversal_category>::value, graph::detail::no_parameter>::type = graph::detail::no_parameter; typename graph_traits::traversal_category = undir_adj_list_traversal_tag]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/make_connected.hpp:38:51: required from ‘void boost::make_connected(Graph&, VertexIndexMap, AddEdgeVisitor&) [with Graph = adjacency_list, property >; VertexIndexMap = vec_adj_list_vertex_id_map, long unsigned int>; AddEdgeVisitor = my_add_edge_visitor, property >, long unsigned int>]’ planar.cpp:211:26: required from here /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/graph_concepts.hpp:75:15: note: in a call to non-static member function ‘boost::concepts::IncidenceGraphConcept, boost::property > >::~IncidenceGraphConcept()’ 75 | BOOST_concept(IncidenceGraph, (G)) : Graph< G > | ^~~~~~~~~~~~~~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/preprocessor/cat.hpp:29:34: note: in definition of macro ‘BOOST_PP_CAT_I’ 29 | # define BOOST_PP_CAT_I(a, b) a ## b | ^ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/concept_def.hpp:23:12: note: in expansion of macro ‘BOOST_PP_CAT’ 23 | struct BOOST_PP_CAT(name,Concept) \ | ^~~~~~~~~~~~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/graph_concepts.hpp:75:1: note: in expansion of macro ‘BOOST_concept’ 75 | BOOST_concept(IncidenceGraph, (G)) : Graph< G > | ^~~~~~~~~~~~~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::constraint::failed() [with Model = boost::ReadWritePropertyMapConcept, long unsigned int> >, long unsigned int>]’: /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/depth_first_search.hpp:134:9: required from ‘void boost::detail::depth_first_visit_impl(const IncidenceGraph&, typename boost::graph_traits::vertex_descriptor, DFSVisitor&, ColorMap, TerminatorFunc) [with IncidenceGraph = boost::adjacency_list, boost::property >; DFSVisitor = components_recorder >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&> >; ColorMap = boost::shared_array_property_map, long unsigned int> >; TerminatorFunc = nontruth2; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/depth_first_search.hpp:286:39: required from ‘void boost::depth_first_search(const VertexListGraph&, DFSVisitor, ColorMap, typename graph_traits::vertex_descriptor) [with VertexListGraph = adjacency_list, property >; DFSVisitor = detail::components_recorder >, vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&> >; ColorMap = shared_array_property_map, long unsigned int> >; typename graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/depth_first_search.hpp:397:42: required from ‘void boost::graph::detail::depth_first_search_impl::operator()(const Graph&, const ArgPack&) const [with ArgPack = boost::parameter::aux::arg_list >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&> > >, boost::parameter::aux::empty_arg_list, std::integral_constant >; Graph = boost::adjacency_list, boost::property >]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/depth_first_search.hpp:406:5: required from ‘typename boost::result_of(Param0, const ArgPack&)>::type boost::graph::depth_first_search_with_named_params(const Param0&, const ArgPack&) [with Param0 = boost::adjacency_list, boost::property >; ArgPack = boost::parameter::aux::arg_list >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&> > >, boost::parameter::aux::empty_arg_list, std::integral_constant >; typename boost::result_of(Param0, const ArgPack&)>::type = void]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/depth_first_search.hpp:409:1: required from ‘typename boost::result_of(Param0, const typename boost::detail::convert_bgl_params_to_boost_parameter >::type&)>::type boost::depth_first_search(const Param0&, const bgl_named_params&) [with Param0 = adjacency_list, property >; P = detail::components_recorder >, vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&> >; T = graph_visitor_t; R = no_property; typename result_of(Param0, const typename detail::convert_bgl_params_to_boost_parameter >::type&)>::type = void; typename detail::convert_bgl_params_to_boost_parameter >::type = parameter::aux::arg_list >, vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&> > >, parameter::aux::empty_arg_list, std::integral_constant >]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/connected_components.hpp:106:23: required from ‘typename boost::property_traits::value_type boost::connected_components(const Graph&, ComponentMap, typename enable_if_c::traversal_category>::value, graph::detail::no_parameter>::type) [with Graph = adjacency_list, property >; ComponentMap = iterator_property_map<__gnu_cxx::__normal_iterator >, vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>; typename property_traits::value_type = long unsigned int; typename enable_if_c::traversal_category>::value, graph::detail::no_parameter>::type = graph::detail::no_parameter; typename graph_traits::traversal_category = undir_adj_list_traversal_tag]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/make_connected.hpp:38:51: required from ‘void boost::make_connected(Graph&, VertexIndexMap, AddEdgeVisitor&) [with Graph = adjacency_list, property >; VertexIndexMap = vec_adj_list_vertex_id_map, long unsigned int>; AddEdgeVisitor = my_add_edge_visitor, property >, long unsigned int>]’ planar.cpp:211:26: required from here /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:65:52: warning: ‘this’ pointer is null [-Wnonnull] 65 | static void failed() { ((Model*)0)->constraints(); } | ~~~~~~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/property_map/property_map.hpp:205:10: note: in a call to non-static member function ‘void boost::ReadWritePropertyMapConcept::constraints() [with PMap = boost::shared_array_property_map, long unsigned int> >; Key = long unsigned int]’ 205 | void constraints() { | ^~~~~~~~~~~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements >]’: /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:233:5: required from ‘struct boost::EqualityComparable’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/graph_concepts.hpp:502:1: required from ‘struct boost::concepts::ColorValue’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/graph_concepts.hpp:502:1: required from ‘struct boost::concepts::ColorValueConcept’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::concepts::ColorValueConcept]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied >::value’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:45:51: [ skipping 4 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/depth_first_search.hpp:397:42: required from ‘void boost::graph::detail::depth_first_search_impl::operator()(const Graph&, const ArgPack&) const [with ArgPack = boost::parameter::aux::arg_list >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&> > >, boost::parameter::aux::empty_arg_list, std::integral_constant >; Graph = boost::adjacency_list, boost::property >]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/depth_first_search.hpp:406:5: required from ‘typename boost::result_of(Param0, const ArgPack&)>::type boost::graph::depth_first_search_with_named_params(const Param0&, const ArgPack&) [with Param0 = boost::adjacency_list, boost::property >; ArgPack = boost::parameter::aux::arg_list >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&> > >, boost::parameter::aux::empty_arg_list, std::integral_constant >; typename boost::result_of(Param0, const ArgPack&)>::type = void]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/depth_first_search.hpp:409:1: required from ‘typename boost::result_of(Param0, const typename boost::detail::convert_bgl_params_to_boost_parameter >::type&)>::type boost::depth_first_search(const Param0&, const bgl_named_params&) [with Param0 = adjacency_list, property >; P = detail::components_recorder >, vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&> >; T = graph_visitor_t; R = no_property; typename result_of(Param0, const typename detail::convert_bgl_params_to_boost_parameter >::type&)>::type = void; typename detail::convert_bgl_params_to_boost_parameter >::type = parameter::aux::arg_list >, vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&> > >, parameter::aux::empty_arg_list, std::integral_constant >]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/connected_components.hpp:106:23: required from ‘typename boost::property_traits::value_type boost::connected_components(const Graph&, ComponentMap, typename enable_if_c::traversal_category>::value, graph::detail::no_parameter>::type) [with Graph = adjacency_list, property >; ComponentMap = iterator_property_map<__gnu_cxx::__normal_iterator >, vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>; typename property_traits::value_type = long unsigned int; typename enable_if_c::traversal_category>::value, graph::detail::no_parameter>::type = graph::detail::no_parameter; typename graph_traits::traversal_category = undir_adj_list_traversal_tag]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/make_connected.hpp:38:51: required from ‘void boost::make_connected(Graph&, VertexIndexMap, AddEdgeVisitor&) [with Graph = adjacency_list, property >; VertexIndexMap = vec_adj_list_vertex_id_map, long unsigned int>; AddEdgeVisitor = my_add_edge_visitor, property >, long unsigned int>]’ planar.cpp:211:26: required from here /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::EqualityComparable]’ 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ^ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements >]’: /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:137:5: required from ‘struct boost::DefaultConstructible’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/graph_concepts.hpp:502:1: required from ‘struct boost::concepts::ColorValue’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/graph_concepts.hpp:502:1: required from ‘struct boost::concepts::ColorValueConcept’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::concepts::ColorValueConcept]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied >::value’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:45:51: [ skipping 4 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/depth_first_search.hpp:397:42: required from ‘void boost::graph::detail::depth_first_search_impl::operator()(const Graph&, const ArgPack&) const [with ArgPack = boost::parameter::aux::arg_list >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&> > >, boost::parameter::aux::empty_arg_list, std::integral_constant >; Graph = boost::adjacency_list, boost::property >]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/depth_first_search.hpp:406:5: required from ‘typename boost::result_of(Param0, const ArgPack&)>::type boost::graph::depth_first_search_with_named_params(const Param0&, const ArgPack&) [with Param0 = boost::adjacency_list, boost::property >; ArgPack = boost::parameter::aux::arg_list >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&> > >, boost::parameter::aux::empty_arg_list, std::integral_constant >; typename boost::result_of(Param0, const ArgPack&)>::type = void]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/depth_first_search.hpp:409:1: required from ‘typename boost::result_of(Param0, const typename boost::detail::convert_bgl_params_to_boost_parameter >::type&)>::type boost::depth_first_search(const Param0&, const bgl_named_params&) [with Param0 = adjacency_list, property >; P = detail::components_recorder >, vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&> >; T = graph_visitor_t; R = no_property; typename result_of(Param0, const typename detail::convert_bgl_params_to_boost_parameter >::type&)>::type = void; typename detail::convert_bgl_params_to_boost_parameter >::type = parameter::aux::arg_list >, vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&> > >, parameter::aux::empty_arg_list, std::integral_constant >]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/connected_components.hpp:106:23: required from ‘typename boost::property_traits::value_type boost::connected_components(const Graph&, ComponentMap, typename enable_if_c::traversal_category>::value, graph::detail::no_parameter>::type) [with Graph = adjacency_list, property >; ComponentMap = iterator_property_map<__gnu_cxx::__normal_iterator >, vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>; typename property_traits::value_type = long unsigned int; typename enable_if_c::traversal_category>::value, graph::detail::no_parameter>::type = graph::detail::no_parameter; typename graph_traits::traversal_category = undir_adj_list_traversal_tag]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/make_connected.hpp:38:51: required from ‘void boost::make_connected(Graph&, VertexIndexMap, AddEdgeVisitor&) [with Graph = adjacency_list, property >; VertexIndexMap = vec_adj_list_vertex_id_map, long unsigned int>; AddEdgeVisitor = my_add_edge_visitor, property >, long unsigned int>]’ planar.cpp:211:26: required from here /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::DefaultConstructible]’ 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ^ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements >]’: /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/graph_concepts.hpp:505:5: required from ‘struct boost::concepts::ColorValue’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/graph_concepts.hpp:502:1: required from ‘struct boost::concepts::ColorValueConcept’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::concepts::ColorValueConcept]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied >::value’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:72:8: [ skipping 3 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/depth_first_search.hpp:397:42: required from ‘void boost::graph::detail::depth_first_search_impl::operator()(const Graph&, const ArgPack&) const [with ArgPack = boost::parameter::aux::arg_list >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&> > >, boost::parameter::aux::empty_arg_list, std::integral_constant >; Graph = boost::adjacency_list, boost::property >]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/depth_first_search.hpp:406:5: required from ‘typename boost::result_of(Param0, const ArgPack&)>::type boost::graph::depth_first_search_with_named_params(const Param0&, const ArgPack&) [with Param0 = boost::adjacency_list, boost::property >; ArgPack = boost::parameter::aux::arg_list >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&> > >, boost::parameter::aux::empty_arg_list, std::integral_constant >; typename boost::result_of(Param0, const ArgPack&)>::type = void]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/depth_first_search.hpp:409:1: required from ‘typename boost::result_of(Param0, const typename boost::detail::convert_bgl_params_to_boost_parameter >::type&)>::type boost::depth_first_search(const Param0&, const bgl_named_params&) [with Param0 = adjacency_list, property >; P = detail::components_recorder >, vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&> >; T = graph_visitor_t; R = no_property; typename result_of(Param0, const typename detail::convert_bgl_params_to_boost_parameter >::type&)>::type = void; typename detail::convert_bgl_params_to_boost_parameter >::type = parameter::aux::arg_list >, vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&> > >, parameter::aux::empty_arg_list, std::integral_constant >]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/connected_components.hpp:106:23: required from ‘typename boost::property_traits::value_type boost::connected_components(const Graph&, ComponentMap, typename enable_if_c::traversal_category>::value, graph::detail::no_parameter>::type) [with Graph = adjacency_list, property >; ComponentMap = iterator_property_map<__gnu_cxx::__normal_iterator >, vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>; typename property_traits::value_type = long unsigned int; typename enable_if_c::traversal_category>::value, graph::detail::no_parameter>::type = graph::detail::no_parameter; typename graph_traits::traversal_category = undir_adj_list_traversal_tag]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/make_connected.hpp:38:51: required from ‘void boost::make_connected(Graph&, VertexIndexMap, AddEdgeVisitor&) [with Graph = adjacency_list, property >; VertexIndexMap = vec_adj_list_vertex_id_map, long unsigned int>; AddEdgeVisitor = my_add_edge_visitor, property >, long unsigned int>]’ planar.cpp:211:26: required from here /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::concepts::ColorValue]’ 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ^ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::ColorValueConcept]’: /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/depth_first_search.hpp:136:9: required from ‘void boost::detail::depth_first_visit_impl(const IncidenceGraph&, typename boost::graph_traits::vertex_descriptor, DFSVisitor&, ColorMap, TerminatorFunc) [with IncidenceGraph = boost::adjacency_list, boost::property >; DFSVisitor = components_recorder >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&> >; ColorMap = boost::shared_array_property_map, long unsigned int> >; TerminatorFunc = nontruth2; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/depth_first_search.hpp:286:39: required from ‘void boost::depth_first_search(const VertexListGraph&, DFSVisitor, ColorMap, typename graph_traits::vertex_descriptor) [with VertexListGraph = adjacency_list, property >; DFSVisitor = detail::components_recorder >, vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&> >; ColorMap = shared_array_property_map, long unsigned int> >; typename graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/depth_first_search.hpp:397:42: required from ‘void boost::graph::detail::depth_first_search_impl::operator()(const Graph&, const ArgPack&) const [with ArgPack = boost::parameter::aux::arg_list >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&> > >, boost::parameter::aux::empty_arg_list, std::integral_constant >; Graph = boost::adjacency_list, boost::property >]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/depth_first_search.hpp:406:5: required from ‘typename boost::result_of(Param0, const ArgPack&)>::type boost::graph::depth_first_search_with_named_params(const Param0&, const ArgPack&) [with Param0 = boost::adjacency_list, boost::property >; ArgPack = boost::parameter::aux::arg_list >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&> > >, boost::parameter::aux::empty_arg_list, std::integral_constant >; typename boost::result_of(Param0, const ArgPack&)>::type = void]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/depth_first_search.hpp:409:1: required from ‘typename boost::result_of(Param0, const typename boost::detail::convert_bgl_params_to_boost_parameter >::type&)>::type boost::depth_first_search(const Param0&, const bgl_named_params&) [with Param0 = adjacency_list, property >; P = detail::components_recorder >, vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&> >; T = graph_visitor_t; R = no_property; typename result_of(Param0, const typename detail::convert_bgl_params_to_boost_parameter >::type&)>::type = void; typename detail::convert_bgl_params_to_boost_parameter >::type = parameter::aux::arg_list >, vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&> > >, parameter::aux::empty_arg_list, std::integral_constant >]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/connected_components.hpp:106:23: required from ‘typename boost::property_traits::value_type boost::connected_components(const Graph&, ComponentMap, typename enable_if_c::traversal_category>::value, graph::detail::no_parameter>::type) [with Graph = adjacency_list, property >; ComponentMap = iterator_property_map<__gnu_cxx::__normal_iterator >, vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>; typename property_traits::value_type = long unsigned int; typename enable_if_c::traversal_category>::value, graph::detail::no_parameter>::type = graph::detail::no_parameter; typename graph_traits::traversal_category = undir_adj_list_traversal_tag]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/make_connected.hpp:38:51: required from ‘void boost::make_connected(Graph&, VertexIndexMap, AddEdgeVisitor&) [with Graph = adjacency_list, property >; VertexIndexMap = vec_adj_list_vertex_id_map, long unsigned int>; AddEdgeVisitor = my_add_edge_visitor, property >, long unsigned int>]’ planar.cpp:211:26: required from here /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/graph_concepts.hpp:502:15: note: in a call to non-static member function ‘boost::concepts::ColorValueConcept::~ColorValueConcept()’ 502 | BOOST_concept(ColorValue, (C)) | ^~~~~~~~~~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/preprocessor/cat.hpp:29:34: note: in definition of macro ‘BOOST_PP_CAT_I’ 29 | # define BOOST_PP_CAT_I(a, b) a ## b | ^ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/concept_def.hpp:23:12: note: in expansion of macro ‘BOOST_PP_CAT’ 23 | struct BOOST_PP_CAT(name,Concept) \ | ^~~~~~~~~~~~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/graph_concepts.hpp:502:1: note: in expansion of macro ‘BOOST_concept’ 502 | BOOST_concept(ColorValue, (C)) | ^~~~~~~~~~~~~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements >]’: /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:208:5: required from ‘struct boost::Convertible’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::Convertible]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied >::value’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_)>’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:603:11: [ skipping 2 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.4-3.20/BH/include/boost/property_map/property_map.hpp:354:5: required from ‘boost::iterator_property_map boost::make_iterator_property_map(RAIter, ID, Value) [with RAIter = __gnu_cxx::__normal_iterator >; Value = long unsigned int; ID = vec_adj_list_vertex_id_map, long unsigned int>]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/biconnected_components.hpp:338:43: required from ‘static std::pair boost::detail::bicomp_dispatch1::apply(const Graph&, ComponentMap, OutputIterator, VertexIndexMap, const boost::bgl_named_params&, boost::param_not_found) [with Graph = boost::adjacency_list, boost::property >; ComponentMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::adj_list_edge_property_map, boost::edge_index_t>, long unsigned int, long unsigned int&>; OutputIterator = std::back_insert_iterator >; VertexIndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>; P = int; T = boost::buffer_param_t; R = boost::no_property]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/biconnected_components.hpp:368:60: required from ‘std::pair boost::biconnected_components(const Graph&, ComponentMap, OutputIterator, const bgl_named_params&) [with Graph = adjacency_list, property >; ComponentMap = iterator_property_map<__gnu_cxx::__normal_iterator >, adj_list_edge_property_map, edge_index_t>, long unsigned int, long unsigned int&>; OutputIterator = std::back_insert_iterator >; P = int; T = buffer_param_t; R = no_property]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/biconnected_components.hpp:377:34: required from ‘std::pair boost::biconnected_components(const Graph&, ComponentMap, OutputIterator) [with Graph = adjacency_list, property >; ComponentMap = iterator_property_map<__gnu_cxx::__normal_iterator >, adj_list_edge_property_map, edge_index_t>, long unsigned int, long unsigned int&>; OutputIterator = std::back_insert_iterator >]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/make_biconnected_planar.hpp:44:27: required from ‘void boost::make_biconnected_planar(Graph&, PlanarEmbedding, EdgeIndexMap, AddEdgeVisitor&) [with Graph = adjacency_list, property >; PlanarEmbedding = std::vector >*; EdgeIndexMap = adj_list_edge_property_map, edge_index_t>; AddEdgeVisitor = my_add_edge_visitor, property >, long unsigned int>]’ planar.cpp:213:35: required from here /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::Convertible]’ 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ^ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::Convertible]’: /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:603:11: required from ‘boost::RandomAccessIterator::~RandomAccessIterator() [with TT = __gnu_cxx::__normal_iterator >]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:597:3: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator > >]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/property_map/property_map.hpp:354:5: required from ‘boost::iterator_property_map boost::make_iterator_property_map(RAIter, ID, Value) [with RAIter = __gnu_cxx::__normal_iterator >; Value = long unsigned int; ID = vec_adj_list_vertex_id_map, long unsigned int>]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/biconnected_components.hpp:338:43: required from ‘static std::pair boost::detail::bicomp_dispatch1::apply(const Graph&, ComponentMap, OutputIterator, VertexIndexMap, const boost::bgl_named_params&, boost::param_not_found) [with Graph = boost::adjacency_list, boost::property >; ComponentMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::adj_list_edge_property_map, boost::edge_index_t>, long unsigned int, long unsigned int&>; OutputIterator = std::back_insert_iterator >; VertexIndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>; P = int; T = boost::buffer_param_t; R = boost::no_property]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/biconnected_components.hpp:368:60: required from ‘std::pair boost::biconnected_components(const Graph&, ComponentMap, OutputIterator, const bgl_named_params&) [with Graph = adjacency_list, property >; ComponentMap = iterator_property_map<__gnu_cxx::__normal_iterator >, adj_list_edge_property_map, edge_index_t>, long unsigned int, long unsigned int&>; OutputIterator = std::back_insert_iterator >; P = int; T = buffer_param_t; R = no_property]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/biconnected_components.hpp:377:34: required from ‘std::pair boost::biconnected_components(const Graph&, ComponentMap, OutputIterator) [with Graph = adjacency_list, property >; ComponentMap = iterator_property_map<__gnu_cxx::__normal_iterator >, adj_list_edge_property_map, edge_index_t>, long unsigned int, long unsigned int&>; OutputIterator = std::back_insert_iterator >]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/make_biconnected_planar.hpp:44:27: required from ‘void boost::make_biconnected_planar(Graph&, PlanarEmbedding, EdgeIndexMap, AddEdgeVisitor&) [with Graph = adjacency_list, property >; PlanarEmbedding = std::vector >*; EdgeIndexMap = adj_list_edge_property_map, edge_index_t>; AddEdgeVisitor = my_add_edge_visitor, property >, long unsigned int>]’ planar.cpp:213:35: required from here /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::Convertible::~Convertible() [with X = std::random_access_iterator_tag; Y = std::random_access_iterator_tag]’ 37 | ~model() | ^ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:208:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 208 | BOOST_CONCEPT_USAGE(Convertible) { | ^~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements, boost::property > > >]’: /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/graph_concepts.hpp:182:5: required from ‘struct boost::concepts::VertexListGraph, boost::property > >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/graph_concepts.hpp:176:1: required from ‘struct boost::concepts::VertexListGraphConcept, boost::property > >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::concepts::VertexListGraphConcept, boost::property > >]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied, boost::property > > >::value’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied, boost::property > > >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:72:8: [ skipping 3 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/biconnected_components.hpp:295:60: required from ‘static std::pair boost::detail::bicomp_dispatch2::apply(const Graph&, ComponentMap, OutputIterator, VertexIndexMap, DiscoverTimeMap, const boost::bgl_named_params&, boost::param_not_found) [with Graph = boost::adjacency_list, boost::property >; ComponentMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::adj_list_edge_property_map, boost::edge_index_t>, long unsigned int, long unsigned int&>; OutputIterator = std::back_insert_iterator >; VertexIndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>; DiscoverTimeMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>; P = int; T = boost::buffer_param_t; R = boost::no_property]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/biconnected_components.hpp:336:60: required from ‘static std::pair boost::detail::bicomp_dispatch1::apply(const Graph&, ComponentMap, OutputIterator, VertexIndexMap, const boost::bgl_named_params&, boost::param_not_found) [with Graph = boost::adjacency_list, boost::property >; ComponentMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::adj_list_edge_property_map, boost::edge_index_t>, long unsigned int, long unsigned int&>; OutputIterator = std::back_insert_iterator >; VertexIndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>; P = int; T = boost::buffer_param_t; R = boost::no_property]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/biconnected_components.hpp:368:60: required from ‘std::pair boost::biconnected_components(const Graph&, ComponentMap, OutputIterator, const bgl_named_params&) [with Graph = adjacency_list, property >; ComponentMap = iterator_property_map<__gnu_cxx::__normal_iterator >, adj_list_edge_property_map, edge_index_t>, long unsigned int, long unsigned int&>; OutputIterator = std::back_insert_iterator >; P = int; T = buffer_param_t; R = no_property]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/biconnected_components.hpp:377:34: required from ‘std::pair boost::biconnected_components(const Graph&, ComponentMap, OutputIterator) [with Graph = adjacency_list, property >; ComponentMap = iterator_property_map<__gnu_cxx::__normal_iterator >, adj_list_edge_property_map, edge_index_t>, long unsigned int, long unsigned int&>; OutputIterator = std::back_insert_iterator >]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/make_biconnected_planar.hpp:44:27: required from ‘void boost::make_biconnected_planar(Graph&, PlanarEmbedding, EdgeIndexMap, AddEdgeVisitor&) [with Graph = adjacency_list, property >; PlanarEmbedding = std::vector >*; EdgeIndexMap = adj_list_edge_property_map, edge_index_t>; AddEdgeVisitor = my_add_edge_visitor, property >, long unsigned int>]’ planar.cpp:213:35: required from here /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::concepts::VertexListGraph, boost::property > >]’ 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ^ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::VertexListGraphConcept, boost::property > >]’: /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/isomorphism.hpp:494:5: required from ‘std::pair boost::detail::biconnected_components_impl(const Graph&, ComponentMap, OutputIterator, VertexIndexMap, DiscoverTimeMap, LowPointMap, PredecessorMap, DFSVisitor) [with Graph = boost::adjacency_list, boost::property >; ComponentMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::adj_list_edge_property_map, boost::edge_index_t>, long unsigned int, long unsigned int&>; OutputIterator = std::back_insert_iterator >; VertexIndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>; DiscoverTimeMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>; LowPointMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>; PredecessorMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>; DFSVisitor = boost::dfs_visitor<>]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/biconnected_components.hpp:250:47: required from ‘static std::pair boost::detail::bicomp_dispatch3::apply(const Graph&, ComponentMap, OutputIterator, VertexIndexMap, DiscoverTimeMap, LowPointMap, const boost::bgl_named_params&, boost::param_not_found) [with Graph = boost::adjacency_list, boost::property >; ComponentMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::adj_list_edge_property_map, boost::edge_index_t>, long unsigned int, long unsigned int&>; OutputIterator = std::back_insert_iterator >; VertexIndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>; DiscoverTimeMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>; LowPointMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>; P = int; T = boost::buffer_param_t; R = boost::no_property]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/biconnected_components.hpp:295:60: required from ‘static std::pair boost::detail::bicomp_dispatch2::apply(const Graph&, ComponentMap, OutputIterator, VertexIndexMap, DiscoverTimeMap, const boost::bgl_named_params&, boost::param_not_found) [with Graph = boost::adjacency_list, boost::property >; ComponentMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::adj_list_edge_property_map, boost::edge_index_t>, long unsigned int, long unsigned int&>; OutputIterator = std::back_insert_iterator >; VertexIndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>; DiscoverTimeMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>; P = int; T = boost::buffer_param_t; R = boost::no_property]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/biconnected_components.hpp:336:60: required from ‘static std::pair boost::detail::bicomp_dispatch1::apply(const Graph&, ComponentMap, OutputIterator, VertexIndexMap, const boost::bgl_named_params&, boost::param_not_found) [with Graph = boost::adjacency_list, boost::property >; ComponentMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::adj_list_edge_property_map, boost::edge_index_t>, long unsigned int, long unsigned int&>; OutputIterator = std::back_insert_iterator >; VertexIndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>; P = int; T = boost::buffer_param_t; R = boost::no_property]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/biconnected_components.hpp:368:60: required from ‘std::pair boost::biconnected_components(const Graph&, ComponentMap, OutputIterator, const bgl_named_params&) [with Graph = adjacency_list, property >; ComponentMap = iterator_property_map<__gnu_cxx::__normal_iterator >, adj_list_edge_property_map, edge_index_t>, long unsigned int, long unsigned int&>; OutputIterator = std::back_insert_iterator >; P = int; T = buffer_param_t; R = no_property]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/biconnected_components.hpp:377:34: required from ‘std::pair boost::biconnected_components(const Graph&, ComponentMap, OutputIterator) [with Graph = adjacency_list, property >; ComponentMap = iterator_property_map<__gnu_cxx::__normal_iterator >, adj_list_edge_property_map, edge_index_t>, long unsigned int, long unsigned int&>; OutputIterator = std::back_insert_iterator >]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/make_biconnected_planar.hpp:44:27: required from ‘void boost::make_biconnected_planar(Graph&, PlanarEmbedding, EdgeIndexMap, AddEdgeVisitor&) [with Graph = adjacency_list, property >; PlanarEmbedding = std::vector >*; EdgeIndexMap = adj_list_edge_property_map, edge_index_t>; AddEdgeVisitor = my_add_edge_visitor, property >, long unsigned int>]’ planar.cpp:213:35: required from here /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/graph_concepts.hpp:176:15: note: in a call to non-static member function ‘boost::concepts::VertexListGraphConcept, boost::property > >::~VertexListGraphConcept()’ 176 | BOOST_concept(VertexListGraph, (G)) : Graph< G > | ^~~~~~~~~~~~~~~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/preprocessor/cat.hpp:29:34: note: in definition of macro ‘BOOST_PP_CAT_I’ 29 | # define BOOST_PP_CAT_I(a, b) a ## b | ^ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/concept_def.hpp:23:12: note: in expansion of macro ‘BOOST_PP_CAT’ 23 | struct BOOST_PP_CAT(name,Concept) \ | ^~~~~~~~~~~~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/graph_concepts.hpp:176:1: note: in expansion of macro ‘BOOST_concept’ 176 | BOOST_concept(VertexListGraph, (G)) : Graph< G > | ^~~~~~~~~~~~~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::constraint::failed() [with Model = boost::WritablePropertyMapConcept >, boost::adj_list_edge_property_map, boost::edge_index_t>, long unsigned int, long unsigned int&>, boost::detail::edge_desc_impl >]’: /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/biconnected_components.hpp:190:9: required from ‘std::pair boost::detail::biconnected_components_impl(const Graph&, ComponentMap, OutputIterator, VertexIndexMap, DiscoverTimeMap, LowPointMap, PredecessorMap, DFSVisitor) [with Graph = boost::adjacency_list, boost::property >; ComponentMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::adj_list_edge_property_map, boost::edge_index_t>, long unsigned int, long unsigned int&>; OutputIterator = std::back_insert_iterator >; VertexIndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>; DiscoverTimeMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>; LowPointMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>; PredecessorMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>; DFSVisitor = boost::dfs_visitor<>]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/biconnected_components.hpp:250:47: required from ‘static std::pair boost::detail::bicomp_dispatch3::apply(const Graph&, ComponentMap, OutputIterator, VertexIndexMap, DiscoverTimeMap, LowPointMap, const boost::bgl_named_params&, boost::param_not_found) [with Graph = boost::adjacency_list, boost::property >; ComponentMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::adj_list_edge_property_map, boost::edge_index_t>, long unsigned int, long unsigned int&>; OutputIterator = std::back_insert_iterator >; VertexIndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>; DiscoverTimeMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>; LowPointMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>; P = int; T = boost::buffer_param_t; R = boost::no_property]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/biconnected_components.hpp:295:60: required from ‘static std::pair boost::detail::bicomp_dispatch2::apply(const Graph&, ComponentMap, OutputIterator, VertexIndexMap, DiscoverTimeMap, const boost::bgl_named_params&, boost::param_not_found) [with Graph = boost::adjacency_list, boost::property >; ComponentMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::adj_list_edge_property_map, boost::edge_index_t>, long unsigned int, long unsigned int&>; OutputIterator = std::back_insert_iterator >; VertexIndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>; DiscoverTimeMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>; P = int; T = boost::buffer_param_t; R = boost::no_property]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/biconnected_components.hpp:336:60: required from ‘static std::pair boost::detail::bicomp_dispatch1::apply(const Graph&, ComponentMap, OutputIterator, VertexIndexMap, const boost::bgl_named_params&, boost::param_not_found) [with Graph = boost::adjacency_list, boost::property >; ComponentMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::adj_list_edge_property_map, boost::edge_index_t>, long unsigned int, long unsigned int&>; OutputIterator = std::back_insert_iterator >; VertexIndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>; P = int; T = boost::buffer_param_t; R = boost::no_property]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/biconnected_components.hpp:368:60: required from ‘std::pair boost::biconnected_components(const Graph&, ComponentMap, OutputIterator, const bgl_named_params&) [with Graph = adjacency_list, property >; ComponentMap = iterator_property_map<__gnu_cxx::__normal_iterator >, adj_list_edge_property_map, edge_index_t>, long unsigned int, long unsigned int&>; OutputIterator = std::back_insert_iterator >; P = int; T = buffer_param_t; R = no_property]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/biconnected_components.hpp:377:34: required from ‘std::pair boost::biconnected_components(const Graph&, ComponentMap, OutputIterator) [with Graph = adjacency_list, property >; ComponentMap = iterator_property_map<__gnu_cxx::__normal_iterator >, adj_list_edge_property_map, edge_index_t>, long unsigned int, long unsigned int&>; OutputIterator = std::back_insert_iterator >]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/make_biconnected_planar.hpp:44:27: required from ‘void boost::make_biconnected_planar(Graph&, PlanarEmbedding, EdgeIndexMap, AddEdgeVisitor&) [with Graph = adjacency_list, property >; PlanarEmbedding = std::vector >*; EdgeIndexMap = adj_list_edge_property_map, edge_index_t>; AddEdgeVisitor = my_add_edge_visitor, property >, long unsigned int>]’ planar.cpp:213:35: required from here /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:65:52: warning: ‘this’ pointer is null [-Wnonnull] 65 | static void failed() { ((Model*)0)->constraints(); } | ~~~~~~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/property_map/property_map.hpp:179:10: note: in a call to non-static member function ‘void boost::WritablePropertyMapConcept::constraints() [with PMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::adj_list_edge_property_map, boost::edge_index_t>, long unsigned int, long unsigned int&>; Key = boost::detail::edge_desc_impl]’ 179 | void constraints() { | ^~~~~~~~~~~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::constraint::failed() [with Model = boost::ReadWritePropertyMapConcept >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>, long unsigned int>]’: /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/biconnected_components.hpp:192:9: required from ‘std::pair boost::detail::biconnected_components_impl(const Graph&, ComponentMap, OutputIterator, VertexIndexMap, DiscoverTimeMap, LowPointMap, PredecessorMap, DFSVisitor) [with Graph = boost::adjacency_list, boost::property >; ComponentMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::adj_list_edge_property_map, boost::edge_index_t>, long unsigned int, long unsigned int&>; OutputIterator = std::back_insert_iterator >; VertexIndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>; DiscoverTimeMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>; LowPointMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>; PredecessorMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>; DFSVisitor = boost::dfs_visitor<>]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/biconnected_components.hpp:250:47: required from ‘static std::pair boost::detail::bicomp_dispatch3::apply(const Graph&, ComponentMap, OutputIterator, VertexIndexMap, DiscoverTimeMap, LowPointMap, const boost::bgl_named_params&, boost::param_not_found) [with Graph = boost::adjacency_list, boost::property >; ComponentMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::adj_list_edge_property_map, boost::edge_index_t>, long unsigned int, long unsigned int&>; OutputIterator = std::back_insert_iterator >; VertexIndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>; DiscoverTimeMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>; LowPointMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>; P = int; T = boost::buffer_param_t; R = boost::no_property]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/biconnected_components.hpp:295:60: required from ‘static std::pair boost::detail::bicomp_dispatch2::apply(const Graph&, ComponentMap, OutputIterator, VertexIndexMap, DiscoverTimeMap, const boost::bgl_named_params&, boost::param_not_found) [with Graph = boost::adjacency_list, boost::property >; ComponentMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::adj_list_edge_property_map, boost::edge_index_t>, long unsigned int, long unsigned int&>; OutputIterator = std::back_insert_iterator >; VertexIndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>; DiscoverTimeMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>; P = int; T = boost::buffer_param_t; R = boost::no_property]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/biconnected_components.hpp:336:60: required from ‘static std::pair boost::detail::bicomp_dispatch1::apply(const Graph&, ComponentMap, OutputIterator, VertexIndexMap, const boost::bgl_named_params&, boost::param_not_found) [with Graph = boost::adjacency_list, boost::property >; ComponentMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::adj_list_edge_property_map, boost::edge_index_t>, long unsigned int, long unsigned int&>; OutputIterator = std::back_insert_iterator >; VertexIndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>; P = int; T = boost::buffer_param_t; R = boost::no_property]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/biconnected_components.hpp:368:60: required from ‘std::pair boost::biconnected_components(const Graph&, ComponentMap, OutputIterator, const bgl_named_params&) [with Graph = adjacency_list, property >; ComponentMap = iterator_property_map<__gnu_cxx::__normal_iterator >, adj_list_edge_property_map, edge_index_t>, long unsigned int, long unsigned int&>; OutputIterator = std::back_insert_iterator >; P = int; T = buffer_param_t; R = no_property]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/biconnected_components.hpp:377:34: required from ‘std::pair boost::biconnected_components(const Graph&, ComponentMap, OutputIterator) [with Graph = adjacency_list, property >; ComponentMap = iterator_property_map<__gnu_cxx::__normal_iterator >, adj_list_edge_property_map, edge_index_t>, long unsigned int, long unsigned int&>; OutputIterator = std::back_insert_iterator >]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/make_biconnected_planar.hpp:44:27: required from ‘void boost::make_biconnected_planar(Graph&, PlanarEmbedding, EdgeIndexMap, AddEdgeVisitor&) [with Graph = adjacency_list, property >; PlanarEmbedding = std::vector >*; EdgeIndexMap = adj_list_edge_property_map, edge_index_t>; AddEdgeVisitor = my_add_edge_visitor, property >, long unsigned int>]’ planar.cpp:213:35: required from here /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:65:52: warning: ‘this’ pointer is null [-Wnonnull] 65 | static void failed() { ((Model*)0)->constraints(); } | ~~~~~~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/property_map/property_map.hpp:205:10: note: in a call to non-static member function ‘void boost::ReadWritePropertyMapConcept::constraints() [with PMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>; Key = long unsigned int]’ 205 | void constraints() { | ^~~~~~~~~~~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::concepts::Graph >]’: /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements > >]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/graph_concepts.hpp:66:5: required from ‘struct boost::concepts::Graph >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/graph_concepts.hpp:176:1: required from ‘struct boost::concepts::VertexListGraph >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/graph_concepts.hpp:176:1: required from ‘struct boost::concepts::VertexListGraphConcept >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::concepts::VertexListGraphConcept >]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:42:5: [ skipping 4 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/isomorphism.hpp:651:42: required from ‘bool boost::graph::detail::isomorphism_impl::operator()(const Graph1&, const Graph2&, const ArgPack&) const [with ArgPack = boost::parameter::aux::empty_arg_list; Graph1 = boost::adjacency_list; Graph2 = boost::adjacency_list]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/isomorphism.hpp:662:5: required from ‘typename boost::result_of(Param0, Param1, const ArgPack&)>::type boost::graph::isomorphism_with_named_params(const Param0&, const Param1&, const ArgPack&) [with Param0 = boost::adjacency_list; Param1 = boost::adjacency_list; ArgPack = boost::parameter::aux::empty_arg_list; typename boost::result_of(Param0, Param1, const ArgPack&)>::type = bool]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/isomorphism.hpp:666:1: required from ‘typename boost::result_of(Param0, Param1, const boost::parameter::aux::empty_arg_list&)>::type boost::isomorphism(const Param0&, const Param1&) [with Param0 = adjacency_list; Param1 = adjacency_list; typename result_of(Param0, Param1, const parameter::aux::empty_arg_list&)>::type = bool]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/is_kuratowski_subgraph.hpp:278:34: required from ‘bool boost::is_kuratowski_subgraph(const Graph&, ForwardIterator, ForwardIterator, VertexIndexMap) [with Graph = adjacency_list, property >; ForwardIterator = __gnu_cxx::__normal_iterator*, std::vector > >; VertexIndexMap = vec_adj_list_vertex_id_map, long unsigned int>]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/is_kuratowski_subgraph.hpp:290:34: required from ‘bool boost::is_kuratowski_subgraph(const Graph&, ForwardIterator, ForwardIterator) [with Graph = adjacency_list, property >; ForwardIterator = __gnu_cxx::__normal_iterator*, std::vector > >]’ planar.cpp:435:37: required from here /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::concepts::Graph::~Graph() [with G = boost::adjacency_list]’ 37 | ~model() | ^ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/graph_concepts.hpp:66:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 66 | BOOST_CONCEPT_USAGE(Graph) | ^~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::concepts::VertexListGraph >]’: /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements > >]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/graph_concepts.hpp:182:5: required from ‘struct boost::concepts::VertexListGraph >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/graph_concepts.hpp:176:1: required from ‘struct boost::concepts::VertexListGraphConcept >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::concepts::VertexListGraphConcept >]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied > >::value’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:45:51: [ skipping 3 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/isomorphism.hpp:651:42: required from ‘bool boost::graph::detail::isomorphism_impl::operator()(const Graph1&, const Graph2&, const ArgPack&) const [with ArgPack = boost::parameter::aux::empty_arg_list; Graph1 = boost::adjacency_list; Graph2 = boost::adjacency_list]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/isomorphism.hpp:662:5: required from ‘typename boost::result_of(Param0, Param1, const ArgPack&)>::type boost::graph::isomorphism_with_named_params(const Param0&, const Param1&, const ArgPack&) [with Param0 = boost::adjacency_list; Param1 = boost::adjacency_list; ArgPack = boost::parameter::aux::empty_arg_list; typename boost::result_of(Param0, Param1, const ArgPack&)>::type = bool]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/isomorphism.hpp:666:1: required from ‘typename boost::result_of(Param0, Param1, const boost::parameter::aux::empty_arg_list&)>::type boost::isomorphism(const Param0&, const Param1&) [with Param0 = adjacency_list; Param1 = adjacency_list; typename result_of(Param0, Param1, const parameter::aux::empty_arg_list&)>::type = bool]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/is_kuratowski_subgraph.hpp:278:34: required from ‘bool boost::is_kuratowski_subgraph(const Graph&, ForwardIterator, ForwardIterator, VertexIndexMap) [with Graph = adjacency_list, property >; ForwardIterator = __gnu_cxx::__normal_iterator*, std::vector > >; VertexIndexMap = vec_adj_list_vertex_id_map, long unsigned int>]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/is_kuratowski_subgraph.hpp:290:34: required from ‘bool boost::is_kuratowski_subgraph(const Graph&, ForwardIterator, ForwardIterator) [with Graph = adjacency_list, property >; ForwardIterator = __gnu_cxx::__normal_iterator*, std::vector > >]’ planar.cpp:435:37: required from here /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::concepts::VertexListGraph::~VertexListGraph() [with G = boost::adjacency_list]’ 37 | ~model() | ^ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/graph_concepts.hpp:182:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 182 | BOOST_CONCEPT_USAGE(VertexListGraph) | ^~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::concepts::EdgeListGraph >]’: /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements > >]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/graph_concepts.hpp:233:5: required from ‘struct boost::concepts::EdgeListGraph >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/graph_concepts.hpp:226:1: required from ‘struct boost::concepts::EdgeListGraphConcept >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::concepts::EdgeListGraphConcept >]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied > >::value’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:45:51: [ skipping 3 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/isomorphism.hpp:651:42: required from ‘bool boost::graph::detail::isomorphism_impl::operator()(const Graph1&, const Graph2&, const ArgPack&) const [with ArgPack = boost::parameter::aux::empty_arg_list; Graph1 = boost::adjacency_list; Graph2 = boost::adjacency_list]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/isomorphism.hpp:662:5: required from ‘typename boost::result_of(Param0, Param1, const ArgPack&)>::type boost::graph::isomorphism_with_named_params(const Param0&, const Param1&, const ArgPack&) [with Param0 = boost::adjacency_list; Param1 = boost::adjacency_list; ArgPack = boost::parameter::aux::empty_arg_list; typename boost::result_of(Param0, Param1, const ArgPack&)>::type = bool]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/isomorphism.hpp:666:1: required from ‘typename boost::result_of(Param0, Param1, const boost::parameter::aux::empty_arg_list&)>::type boost::isomorphism(const Param0&, const Param1&) [with Param0 = adjacency_list; Param1 = adjacency_list; typename result_of(Param0, Param1, const parameter::aux::empty_arg_list&)>::type = bool]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/is_kuratowski_subgraph.hpp:278:34: required from ‘bool boost::is_kuratowski_subgraph(const Graph&, ForwardIterator, ForwardIterator, VertexIndexMap) [with Graph = adjacency_list, property >; ForwardIterator = __gnu_cxx::__normal_iterator*, std::vector > >; VertexIndexMap = vec_adj_list_vertex_id_map, long unsigned int>]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/is_kuratowski_subgraph.hpp:290:34: required from ‘bool boost::is_kuratowski_subgraph(const Graph&, ForwardIterator, ForwardIterator) [with Graph = adjacency_list, property >; ForwardIterator = __gnu_cxx::__normal_iterator*, std::vector > >]’ planar.cpp:435:37: required from here /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::concepts::EdgeListGraph::~EdgeListGraph() [with G = boost::adjacency_list]’ 37 | ~model() | ^ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/graph_concepts.hpp:233:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 233 | BOOST_CONCEPT_USAGE(EdgeListGraph) | ^~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::UnaryFunction >, boost::adjacency_list >, long unsigned int, long unsigned int>]’: /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements >, boost::adjacency_list >, long unsigned int, long unsigned int> >]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:321:7: required from ‘struct boost::UnaryFunction >, boost::adjacency_list >, long unsigned int, long unsigned int>’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:454:3: required from ‘struct boost::AdaptableUnaryFunction >, boost::adjacency_list >, long unsigned int, long unsigned int>’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:454:3: required from ‘struct boost::AdaptableUnaryFunctionConcept >, boost::adjacency_list >, long unsigned int, long unsigned int>’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::AdaptableUnaryFunctionConcept >, boost::adjacency_list >, long unsigned int, long unsigned int>]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:42:5: [ skipping 4 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/isomorphism.hpp:651:42: required from ‘bool boost::graph::detail::isomorphism_impl::operator()(const Graph1&, const Graph2&, const ArgPack&) const [with ArgPack = boost::parameter::aux::empty_arg_list; Graph1 = boost::adjacency_list; Graph2 = boost::adjacency_list]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/isomorphism.hpp:662:5: required from ‘typename boost::result_of(Param0, Param1, const ArgPack&)>::type boost::graph::isomorphism_with_named_params(const Param0&, const Param1&, const ArgPack&) [with Param0 = boost::adjacency_list; Param1 = boost::adjacency_list; ArgPack = boost::parameter::aux::empty_arg_list; typename boost::result_of(Param0, Param1, const ArgPack&)>::type = bool]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/isomorphism.hpp:666:1: required from ‘typename boost::result_of(Param0, Param1, const boost::parameter::aux::empty_arg_list&)>::type boost::isomorphism(const Param0&, const Param1&) [with Param0 = adjacency_list; Param1 = adjacency_list; typename result_of(Param0, Param1, const parameter::aux::empty_arg_list&)>::type = bool]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/is_kuratowski_subgraph.hpp:278:34: required from ‘bool boost::is_kuratowski_subgraph(const Graph&, ForwardIterator, ForwardIterator, VertexIndexMap) [with Graph = adjacency_list, property >; ForwardIterator = __gnu_cxx::__normal_iterator*, std::vector > >; VertexIndexMap = vec_adj_list_vertex_id_map, long unsigned int>]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/is_kuratowski_subgraph.hpp:290:34: required from ‘bool boost::is_kuratowski_subgraph(const Graph&, ForwardIterator, ForwardIterator) [with Graph = adjacency_list, property >; ForwardIterator = __gnu_cxx::__normal_iterator*, std::vector > >]’ planar.cpp:435:37: required from here /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::UnaryFunction::~UnaryFunction() [with Func = boost::degree_vertex_invariant >, boost::adjacency_list >; Return = long unsigned int; Arg = long unsigned int]’ 37 | ~model() | ^ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:321:7: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 321 | BOOST_CONCEPT_USAGE(UnaryFunction) { test(is_void()); } | ^~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::constraint::failed() [with Model = boost::ReadablePropertyMapConcept >, long unsigned int>]’: /home/omnipath/local/R/4.4-3.20/BH/include/boost/property_map/property_map.hpp:206:7: required from ‘void boost::ReadWritePropertyMapConcept::constraints() [with PMap = boost::shared_array_property_map >; Key = long unsigned int]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::ReadWritePropertyMapConcept >, long unsigned int>]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied >, long unsigned int> >::value’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied >, long unsigned int> >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:72:8: [ skipping 2 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/isomorphism.hpp:651:42: required from ‘bool boost::graph::detail::isomorphism_impl::operator()(const Graph1&, const Graph2&, const ArgPack&) const [with ArgPack = boost::parameter::aux::empty_arg_list; Graph1 = boost::adjacency_list; Graph2 = boost::adjacency_list]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/isomorphism.hpp:662:5: required from ‘typename boost::result_of(Param0, Param1, const ArgPack&)>::type boost::graph::isomorphism_with_named_params(const Param0&, const Param1&, const ArgPack&) [with Param0 = boost::adjacency_list; Param1 = boost::adjacency_list; ArgPack = boost::parameter::aux::empty_arg_list; typename boost::result_of(Param0, Param1, const ArgPack&)>::type = bool]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/isomorphism.hpp:666:1: required from ‘typename boost::result_of(Param0, Param1, const boost::parameter::aux::empty_arg_list&)>::type boost::isomorphism(const Param0&, const Param1&) [with Param0 = adjacency_list; Param1 = adjacency_list; typename result_of(Param0, Param1, const parameter::aux::empty_arg_list&)>::type = bool]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/is_kuratowski_subgraph.hpp:278:34: required from ‘bool boost::is_kuratowski_subgraph(const Graph&, ForwardIterator, ForwardIterator, VertexIndexMap) [with Graph = adjacency_list, property >; ForwardIterator = __gnu_cxx::__normal_iterator*, std::vector > >; VertexIndexMap = vec_adj_list_vertex_id_map, long unsigned int>]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/is_kuratowski_subgraph.hpp:290:34: required from ‘bool boost::is_kuratowski_subgraph(const Graph&, ForwardIterator, ForwardIterator) [with Graph = adjacency_list, property >; ForwardIterator = __gnu_cxx::__normal_iterator*, std::vector > >]’ planar.cpp:435:37: required from here /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:65:52: warning: ‘this’ pointer is null [-Wnonnull] 65 | static void failed() { ((Model*)0)->constraints(); } | ~~~~~~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/property_map/property_map.hpp:147:10: note: in a call to non-static member function ‘void boost::ReadablePropertyMapConcept::constraints() [with PMap = boost::shared_array_property_map >; Key = long unsigned int]’ 147 | void constraints() { | ^~~~~~~~~~~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::constraint::failed() [with Model = boost::WritablePropertyMapConcept >, long unsigned int>]’: /home/omnipath/local/R/4.4-3.20/BH/include/boost/property_map/property_map.hpp:207:7: required from ‘void boost::ReadWritePropertyMapConcept::constraints() [with PMap = boost::shared_array_property_map >; Key = long unsigned int]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::ReadWritePropertyMapConcept >, long unsigned int>]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied >, long unsigned int> >::value’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied >, long unsigned int> >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:72:8: [ skipping 2 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/isomorphism.hpp:651:42: required from ‘bool boost::graph::detail::isomorphism_impl::operator()(const Graph1&, const Graph2&, const ArgPack&) const [with ArgPack = boost::parameter::aux::empty_arg_list; Graph1 = boost::adjacency_list; Graph2 = boost::adjacency_list]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/isomorphism.hpp:662:5: required from ‘typename boost::result_of(Param0, Param1, const ArgPack&)>::type boost::graph::isomorphism_with_named_params(const Param0&, const Param1&, const ArgPack&) [with Param0 = boost::adjacency_list; Param1 = boost::adjacency_list; ArgPack = boost::parameter::aux::empty_arg_list; typename boost::result_of(Param0, Param1, const ArgPack&)>::type = bool]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/isomorphism.hpp:666:1: required from ‘typename boost::result_of(Param0, Param1, const boost::parameter::aux::empty_arg_list&)>::type boost::isomorphism(const Param0&, const Param1&) [with Param0 = adjacency_list; Param1 = adjacency_list; typename result_of(Param0, Param1, const parameter::aux::empty_arg_list&)>::type = bool]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/is_kuratowski_subgraph.hpp:278:34: required from ‘bool boost::is_kuratowski_subgraph(const Graph&, ForwardIterator, ForwardIterator, VertexIndexMap) [with Graph = adjacency_list, property >; ForwardIterator = __gnu_cxx::__normal_iterator*, std::vector > >; VertexIndexMap = vec_adj_list_vertex_id_map, long unsigned int>]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/is_kuratowski_subgraph.hpp:290:34: required from ‘bool boost::is_kuratowski_subgraph(const Graph&, ForwardIterator, ForwardIterator) [with Graph = adjacency_list, property >; ForwardIterator = __gnu_cxx::__normal_iterator*, std::vector > >]’ planar.cpp:435:37: required from here /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:65:52: warning: ‘this’ pointer is null [-Wnonnull] 65 | static void failed() { ((Model*)0)->constraints(); } | ~~~~~~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/property_map/property_map.hpp:179:10: note: in a call to non-static member function ‘void boost::WritablePropertyMapConcept::constraints() [with PMap = boost::shared_array_property_map >; Key = long unsigned int]’ 179 | void constraints() { | ^~~~~~~~~~~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements >]’: /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:208:5: required from ‘struct boost::Convertible’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:206:3: required from ‘struct boost::ConvertibleConcept’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::ConvertibleConcept]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied >::value’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:72:8: [ skipping 7 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/isomorphism.hpp:651:42: required from ‘bool boost::graph::detail::isomorphism_impl::operator()(const Graph1&, const Graph2&, const ArgPack&) const [with ArgPack = boost::parameter::aux::empty_arg_list; Graph1 = boost::adjacency_list; Graph2 = boost::adjacency_list]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/isomorphism.hpp:662:5: required from ‘typename boost::result_of(Param0, Param1, const ArgPack&)>::type boost::graph::isomorphism_with_named_params(const Param0&, const Param1&, const ArgPack&) [with Param0 = boost::adjacency_list; Param1 = boost::adjacency_list; ArgPack = boost::parameter::aux::empty_arg_list; typename boost::result_of(Param0, Param1, const ArgPack&)>::type = bool]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/isomorphism.hpp:666:1: required from ‘typename boost::result_of(Param0, Param1, const boost::parameter::aux::empty_arg_list&)>::type boost::isomorphism(const Param0&, const Param1&) [with Param0 = adjacency_list; Param1 = adjacency_list; typename result_of(Param0, Param1, const parameter::aux::empty_arg_list&)>::type = bool]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/is_kuratowski_subgraph.hpp:278:34: required from ‘bool boost::is_kuratowski_subgraph(const Graph&, ForwardIterator, ForwardIterator, VertexIndexMap) [with Graph = adjacency_list, property >; ForwardIterator = __gnu_cxx::__normal_iterator*, std::vector > >; VertexIndexMap = vec_adj_list_vertex_id_map, long unsigned int>]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/is_kuratowski_subgraph.hpp:290:34: required from ‘bool boost::is_kuratowski_subgraph(const Graph&, ForwardIterator, ForwardIterator) [with Graph = adjacency_list, property >; ForwardIterator = __gnu_cxx::__normal_iterator*, std::vector > >]’ planar.cpp:435:37: required from here /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::Convertible]’ 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ^ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::ConvertibleConcept]’: /home/omnipath/local/R/4.4-3.20/BH/include/boost/property_map/property_map.hpp:208:7: required from ‘void boost::ReadWritePropertyMapConcept::constraints() [with PMap = boost::shared_array_property_map >; Key = long unsigned int]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::ReadWritePropertyMapConcept >, long unsigned int>]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied >, long unsigned int> >::value’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied >, long unsigned int> >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:72:8: [ skipping 2 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/isomorphism.hpp:651:42: required from ‘bool boost::graph::detail::isomorphism_impl::operator()(const Graph1&, const Graph2&, const ArgPack&) const [with ArgPack = boost::parameter::aux::empty_arg_list; Graph1 = boost::adjacency_list; Graph2 = boost::adjacency_list]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/isomorphism.hpp:662:5: required from ‘typename boost::result_of(Param0, Param1, const ArgPack&)>::type boost::graph::isomorphism_with_named_params(const Param0&, const Param1&, const ArgPack&) [with Param0 = boost::adjacency_list; Param1 = boost::adjacency_list; ArgPack = boost::parameter::aux::empty_arg_list; typename boost::result_of(Param0, Param1, const ArgPack&)>::type = bool]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/isomorphism.hpp:666:1: required from ‘typename boost::result_of(Param0, Param1, const boost::parameter::aux::empty_arg_list&)>::type boost::isomorphism(const Param0&, const Param1&) [with Param0 = adjacency_list; Param1 = adjacency_list; typename result_of(Param0, Param1, const parameter::aux::empty_arg_list&)>::type = bool]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/is_kuratowski_subgraph.hpp:278:34: required from ‘bool boost::is_kuratowski_subgraph(const Graph&, ForwardIterator, ForwardIterator, VertexIndexMap) [with Graph = adjacency_list, property >; ForwardIterator = __gnu_cxx::__normal_iterator*, std::vector > >; VertexIndexMap = vec_adj_list_vertex_id_map, long unsigned int>]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/is_kuratowski_subgraph.hpp:290:34: required from ‘bool boost::is_kuratowski_subgraph(const Graph&, ForwardIterator, ForwardIterator) [with Graph = adjacency_list, property >; ForwardIterator = __gnu_cxx::__normal_iterator*, std::vector > >]’ planar.cpp:435:37: required from here /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:206:17: note: in a call to non-static member function ‘boost::ConvertibleConcept::~ConvertibleConcept()’ 206 | BOOST_concept(Convertible,(X)(Y)) | ^~~~~~~~~~~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/preprocessor/cat.hpp:29:34: note: in definition of macro ‘BOOST_PP_CAT_I’ 29 | # define BOOST_PP_CAT_I(a, b) a ## b | ^ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/concept_def.hpp:23:12: note: in expansion of macro ‘BOOST_PP_CAT’ 23 | struct BOOST_PP_CAT(name,Concept) \ | ^~~~~~~~~~~~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:206:3: note: in expansion of macro ‘BOOST_concept’ 206 | BOOST_concept(Convertible,(X)(Y)) | ^~~~~~~~~~~~~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements >]’: /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:208:5: required from ‘struct boost::Convertible’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:206:3: required from ‘struct boost::ConvertibleConcept’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::ConvertibleConcept]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied >::value’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:72:8: [ skipping 7 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/isomorphism.hpp:651:42: required from ‘bool boost::graph::detail::isomorphism_impl::operator()(const Graph1&, const Graph2&, const ArgPack&) const [with ArgPack = boost::parameter::aux::empty_arg_list; Graph1 = boost::adjacency_list; Graph2 = boost::adjacency_list]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/isomorphism.hpp:662:5: required from ‘typename boost::result_of(Param0, Param1, const ArgPack&)>::type boost::graph::isomorphism_with_named_params(const Param0&, const Param1&, const ArgPack&) [with Param0 = boost::adjacency_list; Param1 = boost::adjacency_list; ArgPack = boost::parameter::aux::empty_arg_list; typename boost::result_of(Param0, Param1, const ArgPack&)>::type = bool]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/isomorphism.hpp:666:1: required from ‘typename boost::result_of(Param0, Param1, const boost::parameter::aux::empty_arg_list&)>::type boost::isomorphism(const Param0&, const Param1&) [with Param0 = adjacency_list; Param1 = adjacency_list; typename result_of(Param0, Param1, const parameter::aux::empty_arg_list&)>::type = bool]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/is_kuratowski_subgraph.hpp:278:34: required from ‘bool boost::is_kuratowski_subgraph(const Graph&, ForwardIterator, ForwardIterator, VertexIndexMap) [with Graph = adjacency_list, property >; ForwardIterator = __gnu_cxx::__normal_iterator*, std::vector > >; VertexIndexMap = vec_adj_list_vertex_id_map, long unsigned int>]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/is_kuratowski_subgraph.hpp:290:34: required from ‘bool boost::is_kuratowski_subgraph(const Graph&, ForwardIterator, ForwardIterator) [with Graph = adjacency_list, property >; ForwardIterator = __gnu_cxx::__normal_iterator*, std::vector > >]’ planar.cpp:435:37: required from here /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::Convertible]’ 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ^ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::ConvertibleConcept]’: /home/omnipath/local/R/4.4-3.20/BH/include/boost/property_map/property_map.hpp:148:7: required from ‘void boost::ReadablePropertyMapConcept::constraints() [with PMap = boost::vec_adj_list_vertex_id_map; Key = long unsigned int]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::ReadablePropertyMapConcept, long unsigned int>]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied, long unsigned int> >::value’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied, long unsigned int> >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:72:8: [ skipping 2 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/isomorphism.hpp:651:42: required from ‘bool boost::graph::detail::isomorphism_impl::operator()(const Graph1&, const Graph2&, const ArgPack&) const [with ArgPack = boost::parameter::aux::empty_arg_list; Graph1 = boost::adjacency_list; Graph2 = boost::adjacency_list]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/isomorphism.hpp:662:5: required from ‘typename boost::result_of(Param0, Param1, const ArgPack&)>::type boost::graph::isomorphism_with_named_params(const Param0&, const Param1&, const ArgPack&) [with Param0 = boost::adjacency_list; Param1 = boost::adjacency_list; ArgPack = boost::parameter::aux::empty_arg_list; typename boost::result_of(Param0, Param1, const ArgPack&)>::type = bool]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/isomorphism.hpp:666:1: required from ‘typename boost::result_of(Param0, Param1, const boost::parameter::aux::empty_arg_list&)>::type boost::isomorphism(const Param0&, const Param1&) [with Param0 = adjacency_list; Param1 = adjacency_list; typename result_of(Param0, Param1, const parameter::aux::empty_arg_list&)>::type = bool]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/is_kuratowski_subgraph.hpp:278:34: required from ‘bool boost::is_kuratowski_subgraph(const Graph&, ForwardIterator, ForwardIterator, VertexIndexMap) [with Graph = adjacency_list, property >; ForwardIterator = __gnu_cxx::__normal_iterator*, std::vector > >; VertexIndexMap = vec_adj_list_vertex_id_map, long unsigned int>]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/is_kuratowski_subgraph.hpp:290:34: required from ‘bool boost::is_kuratowski_subgraph(const Graph&, ForwardIterator, ForwardIterator) [with Graph = adjacency_list, property >; ForwardIterator = __gnu_cxx::__normal_iterator*, std::vector > >]’ planar.cpp:435:37: required from here /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:206:17: note: in a call to non-static member function ‘boost::ConvertibleConcept::~ConvertibleConcept()’ 206 | BOOST_concept(Convertible,(X)(Y)) | ^~~~~~~~~~~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/preprocessor/cat.hpp:29:34: note: in definition of macro ‘BOOST_PP_CAT_I’ 29 | # define BOOST_PP_CAT_I(a, b) a ## b | ^ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/concept_def.hpp:23:12: note: in expansion of macro ‘BOOST_PP_CAT’ 23 | struct BOOST_PP_CAT(name,Concept) \ | ^~~~~~~~~~~~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:206:3: note: in expansion of macro ‘BOOST_concept’ 206 | BOOST_concept(Convertible,(X)(Y)) | ^~~~~~~~~~~~~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::constraint::failed() [with Model = boost::DFSVisitorConcept >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>, boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>, boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>, boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>, boost::iterator_property_map<__gnu_cxx::__normal_iterator*, std::vector > >, boost::vec_adj_list_vertex_id_map, long unsigned int>, boost::detail::edge_desc_impl, boost::detail::edge_desc_impl&>, long unsigned int>, boost::adjacency_list, boost::property > >]’: /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/depth_first_search.hpp:130:9: required from ‘void boost::depth_first_search(const VertexListGraph&, DFSVisitor, ColorMap, typename graph_traits::vertex_descriptor) [with VertexListGraph = adjacency_list, property >; DFSVisitor = planar_dfs_visitor >, vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>, iterator_property_map<__gnu_cxx::__normal_iterator >, vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>, iterator_property_map<__gnu_cxx::__normal_iterator >, vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>, iterator_property_map<__gnu_cxx::__normal_iterator >, vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>, iterator_property_map<__gnu_cxx::__normal_iterator*, std::vector > >, vec_adj_list_vertex_id_map, long unsigned int>, detail::edge_desc_impl, detail::edge_desc_impl&>, long unsigned int>; ColorMap = shared_array_property_map, long unsigned int> >; typename graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/depth_first_search.hpp:397:42: required from ‘void boost::graph::detail::depth_first_search_impl::operator()(const Graph&, const ArgPack&) const [with ArgPack = boost::parameter::aux::arg_list, long unsigned int> >, boost::parameter::aux::arg_list >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>, boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>, boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>, boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>, boost::iterator_property_map<__gnu_cxx::__normal_iterator*, std::vector > >, boost::vec_adj_list_vertex_id_map, long unsigned int>, boost::detail::edge_desc_impl, boost::detail::edge_desc_impl&>, long unsigned int> >, boost::parameter::aux::empty_arg_list, std::integral_constant >, std::integral_constant >; Graph = boost::adjacency_list, boost::property >]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/depth_first_search.hpp:406:5: required from ‘typename boost::result_of(Param0, const ArgPack&)>::type boost::graph::depth_first_search_with_named_params(const Param0&, const ArgPack&) [with Param0 = boost::adjacency_list, boost::property >; ArgPack = boost::parameter::aux::arg_list, long unsigned int> >, boost::parameter::aux::arg_list >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>, boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>, boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>, boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>, boost::iterator_property_map<__gnu_cxx::__normal_iterator*, std::vector > >, boost::vec_adj_list_vertex_id_map, long unsigned int>, boost::detail::edge_desc_impl, boost::detail::edge_desc_impl&>, long unsigned int> >, boost::parameter::aux::empty_arg_list, std::integral_constant >, std::integral_constant >; typename boost::result_of(Param0, const ArgPack&)>::type = void]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/depth_first_search.hpp:409:1: required from ‘typename boost::result_of(Param0, const typename boost::detail::convert_bgl_params_to_boost_parameter >::type&)>::type boost::depth_first_search(const Param0&, const bgl_named_params&) [with Param0 = adjacency_list, property >; P = vec_adj_list_vertex_id_map, long unsigned int>; T = vertex_index_t; R = bgl_named_params >, vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>, iterator_property_map<__gnu_cxx::__normal_iterator >, vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>, iterator_property_map<__gnu_cxx::__normal_iterator >, vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>, iterator_property_map<__gnu_cxx::__normal_iterator >, vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>, iterator_property_map<__gnu_cxx::__normal_iterator*, std::vector > >, vec_adj_list_vertex_id_map, long unsigned int>, detail::edge_desc_impl, detail::edge_desc_impl&>, long unsigned int>, graph_visitor_t, no_property>; typename result_of(Param0, const typename detail::convert_bgl_params_to_boost_parameter >::type&)>::type = void; typename detail::convert_bgl_params_to_boost_parameter >::type = parameter::aux::arg_list, long unsigned int> >, parameter::aux::arg_list >, vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>, iterator_property_map<__gnu_cxx::__normal_iterator >, vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>, iterator_property_map<__gnu_cxx::__normal_iterator >, vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>, iterator_property_map<__gnu_cxx::__normal_iterator >, vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>, iterator_property_map<__gnu_cxx::__normal_iterator*, std::vector > >, vec_adj_list_vertex_id_map, long unsigned int>, detail::edge_desc_impl, detail::edge_desc_impl&>, long unsigned int> >, parameter::aux::empty_arg_list, std::integral_constant >, std::integral_constant >]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/planar_detail/boyer_myrvold_impl.hpp:251:27: required from ‘boost::boyer_myrvold_impl::boyer_myrvold_impl(const Graph&, VertexIndexMap) [with Graph = boost::adjacency_list, boost::property >; VertexIndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>; StoreOldHandlesPolicy = boost::graph::detail::no_old_handles; StoreEmbeddingPolicy = boost::graph::detail::no_embedding]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/boyer_myrvold_planar_test.hpp:66:17: required from ‘bool boost::boyer_myrvold_params::core::dispatched_boyer_myrvold(const ArgumentPack&, mpl_::true_, mpl_::true_) [with ArgumentPack = boost::parameter::aux::flat_like_arg_list, boost::property, boost::no_property, boost::listS> > >, std::integral_constant > >; mpl_::true_ = mpl_::bool_]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/boyer_myrvold_planar_test.hpp:211:44: required from ‘bool boost::boyer_myrvold_params::core::boyer_myrvold_planarity_test(const ArgumentPack&) [with ArgumentPack = boost::parameter::aux::flat_like_arg_list, boost::property, boost::no_property, boost::listS> > >, std::integral_constant > >]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/boyer_myrvold_planar_test.hpp:223:68: required from ‘bool boost::boyer_myrvold_planarity_test(const A0&) [with A0 = adjacency_list, property >]’ planar.cpp:121:48: required from here /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:65:52: warning: ‘this’ pointer is null [-Wnonnull] 65 | static void failed() { ((Model*)0)->constraints(); } | ~~~~~~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/depth_first_search.hpp:39:10: note: in a call to non-static member function ‘void boost::DFSVisitorConcept::constraints() [with Visitor = boost::planar_dfs_visitor >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>, boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>, boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>, boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>, boost::iterator_property_map<__gnu_cxx::__normal_iterator*, std::vector > >, boost::vec_adj_list_vertex_id_map, long unsigned int>, boost::detail::edge_desc_impl, boost::detail::edge_desc_impl&>, long unsigned int>; Graph = boost::adjacency_list, boost::property >]’ 39 | void constraints() | ^~~~~~~~~~~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::CopyConstructible >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&> > >]’: /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&> > > >]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:167:5: required from ‘struct boost::CopyConstructible >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&> > >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:165:3: required from ‘struct boost::CopyConstructibleConcept >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&> > >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::CopyConstructibleConcept >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&> > >]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&> > > >::value’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:45:51: [ skipping 8 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/depth_first_search.hpp:397:42: required from ‘void boost::graph::detail::depth_first_search_impl::operator()(const Graph&, const ArgPack&) const [with ArgPack = boost::parameter::aux::arg_list >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&> > >, boost::parameter::aux::empty_arg_list, std::integral_constant >; Graph = boost::adjacency_list, boost::property >]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/depth_first_search.hpp:406:5: required from ‘typename boost::result_of(Param0, const ArgPack&)>::type boost::graph::depth_first_search_with_named_params(const Param0&, const ArgPack&) [with Param0 = boost::adjacency_list, boost::property >; ArgPack = boost::parameter::aux::arg_list >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&> > >, boost::parameter::aux::empty_arg_list, std::integral_constant >; typename boost::result_of(Param0, const ArgPack&)>::type = void]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/depth_first_search.hpp:409:1: required from ‘typename boost::result_of(Param0, const typename boost::detail::convert_bgl_params_to_boost_parameter >::type&)>::type boost::depth_first_search(const Param0&, const bgl_named_params&) [with Param0 = adjacency_list, property >; P = detail::components_recorder >, vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&> >; T = graph_visitor_t; R = no_property; typename result_of(Param0, const typename detail::convert_bgl_params_to_boost_parameter >::type&)>::type = void; typename detail::convert_bgl_params_to_boost_parameter >::type = parameter::aux::arg_list >, vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&> > >, parameter::aux::empty_arg_list, std::integral_constant >]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/connected_components.hpp:106:23: required from ‘typename boost::property_traits::value_type boost::connected_components(const Graph&, ComponentMap, typename enable_if_c::traversal_category>::value, graph::detail::no_parameter>::type) [with Graph = adjacency_list, property >; ComponentMap = iterator_property_map<__gnu_cxx::__normal_iterator >, vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>; typename property_traits::value_type = long unsigned int; typename enable_if_c::traversal_category>::value, graph::detail::no_parameter>::type = graph::detail::no_parameter; typename graph_traits::traversal_category = undir_adj_list_traversal_tag]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/make_connected.hpp:38:51: required from ‘void boost::make_connected(Graph&, VertexIndexMap, AddEdgeVisitor&) [with Graph = adjacency_list, property >; VertexIndexMap = vec_adj_list_vertex_id_map, long unsigned int>; AddEdgeVisitor = my_add_edge_visitor, property >, long unsigned int>]’ planar.cpp:211:26: required from here /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::CopyConstructible::~CopyConstructible() [with TT = boost::detail::components_recorder >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&> >]’ 37 | ~model() | ^ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:167:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 167 | BOOST_CONCEPT_USAGE(CopyConstructible) { | ^~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::concepts::Graph, boost::property > >]’: /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements, boost::property > > >]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/graph_concepts.hpp:66:5: required from ‘struct boost::concepts::Graph, boost::property > >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/graph_concepts.hpp:75:1: required from ‘struct boost::concepts::IncidenceGraph, boost::property > >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/graph_concepts.hpp:75:1: required from ‘struct boost::concepts::IncidenceGraphConcept, boost::property > >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::concepts::IncidenceGraphConcept, boost::property > >]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:42:5: [ skipping 5 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/depth_first_search.hpp:397:42: required from ‘void boost::graph::detail::depth_first_search_impl::operator()(const Graph&, const ArgPack&) const [with ArgPack = boost::parameter::aux::arg_list >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&> > >, boost::parameter::aux::empty_arg_list, std::integral_constant >; Graph = boost::adjacency_list, boost::property >]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/depth_first_search.hpp:406:5: required from ‘typename boost::result_of(Param0, const ArgPack&)>::type boost::graph::depth_first_search_with_named_params(const Param0&, const ArgPack&) [with Param0 = boost::adjacency_list, boost::property >; ArgPack = boost::parameter::aux::arg_list >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&> > >, boost::parameter::aux::empty_arg_list, std::integral_constant >; typename boost::result_of(Param0, const ArgPack&)>::type = void]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/depth_first_search.hpp:409:1: required from ‘typename boost::result_of(Param0, const typename boost::detail::convert_bgl_params_to_boost_parameter >::type&)>::type boost::depth_first_search(const Param0&, const bgl_named_params&) [with Param0 = adjacency_list, property >; P = detail::components_recorder >, vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&> >; T = graph_visitor_t; R = no_property; typename result_of(Param0, const typename detail::convert_bgl_params_to_boost_parameter >::type&)>::type = void; typename detail::convert_bgl_params_to_boost_parameter >::type = parameter::aux::arg_list >, vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&> > >, parameter::aux::empty_arg_list, std::integral_constant >]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/connected_components.hpp:106:23: required from ‘typename boost::property_traits::value_type boost::connected_components(const Graph&, ComponentMap, typename enable_if_c::traversal_category>::value, graph::detail::no_parameter>::type) [with Graph = adjacency_list, property >; ComponentMap = iterator_property_map<__gnu_cxx::__normal_iterator >, vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>; typename property_traits::value_type = long unsigned int; typename enable_if_c::traversal_category>::value, graph::detail::no_parameter>::type = graph::detail::no_parameter; typename graph_traits::traversal_category = undir_adj_list_traversal_tag]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/make_connected.hpp:38:51: required from ‘void boost::make_connected(Graph&, VertexIndexMap, AddEdgeVisitor&) [with Graph = adjacency_list, property >; VertexIndexMap = vec_adj_list_vertex_id_map, long unsigned int>; AddEdgeVisitor = my_add_edge_visitor, property >, long unsigned int>]’ planar.cpp:211:26: required from here /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::concepts::Graph::~Graph() [with G = boost::adjacency_list, boost::property >]’ 37 | ~model() | ^ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/graph_concepts.hpp:66:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 66 | BOOST_CONCEPT_USAGE(Graph) | ^~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::concepts::IncidenceGraph, boost::property > >]’: /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements, boost::property > > >]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/graph_concepts.hpp:87:5: required from ‘struct boost::concepts::IncidenceGraph, boost::property > >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/graph_concepts.hpp:75:1: required from ‘struct boost::concepts::IncidenceGraphConcept, boost::property > >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::concepts::IncidenceGraphConcept, boost::property > >]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied, boost::property > > >::value’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:45:51: [ skipping 4 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/depth_first_search.hpp:397:42: required from ‘void boost::graph::detail::depth_first_search_impl::operator()(const Graph&, const ArgPack&) const [with ArgPack = boost::parameter::aux::arg_list >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&> > >, boost::parameter::aux::empty_arg_list, std::integral_constant >; Graph = boost::adjacency_list, boost::property >]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/depth_first_search.hpp:406:5: required from ‘typename boost::result_of(Param0, const ArgPack&)>::type boost::graph::depth_first_search_with_named_params(const Param0&, const ArgPack&) [with Param0 = boost::adjacency_list, boost::property >; ArgPack = boost::parameter::aux::arg_list >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&> > >, boost::parameter::aux::empty_arg_list, std::integral_constant >; typename boost::result_of(Param0, const ArgPack&)>::type = void]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/depth_first_search.hpp:409:1: required from ‘typename boost::result_of(Param0, const typename boost::detail::convert_bgl_params_to_boost_parameter >::type&)>::type boost::depth_first_search(const Param0&, const bgl_named_params&) [with Param0 = adjacency_list, property >; P = detail::components_recorder >, vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&> >; T = graph_visitor_t; R = no_property; typename result_of(Param0, const typename detail::convert_bgl_params_to_boost_parameter >::type&)>::type = void; typename detail::convert_bgl_params_to_boost_parameter >::type = parameter::aux::arg_list >, vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&> > >, parameter::aux::empty_arg_list, std::integral_constant >]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/connected_components.hpp:106:23: required from ‘typename boost::property_traits::value_type boost::connected_components(const Graph&, ComponentMap, typename enable_if_c::traversal_category>::value, graph::detail::no_parameter>::type) [with Graph = adjacency_list, property >; ComponentMap = iterator_property_map<__gnu_cxx::__normal_iterator >, vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>; typename property_traits::value_type = long unsigned int; typename enable_if_c::traversal_category>::value, graph::detail::no_parameter>::type = graph::detail::no_parameter; typename graph_traits::traversal_category = undir_adj_list_traversal_tag]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/make_connected.hpp:38:51: required from ‘void boost::make_connected(Graph&, VertexIndexMap, AddEdgeVisitor&) [with Graph = adjacency_list, property >; VertexIndexMap = vec_adj_list_vertex_id_map, long unsigned int>; AddEdgeVisitor = my_add_edge_visitor, property >, long unsigned int>]’ planar.cpp:211:26: required from here /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::concepts::IncidenceGraph::~IncidenceGraph() [with G = boost::adjacency_list, boost::property >]’ 37 | ~model() | ^ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/graph_concepts.hpp:87:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 87 | BOOST_CONCEPT_USAGE(IncidenceGraph) | ^~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::constraint::failed() [with Model = boost::ReadablePropertyMapConcept, long unsigned int> >, long unsigned int>]’: /home/omnipath/local/R/4.4-3.20/BH/include/boost/property_map/property_map.hpp:206:7: required from ‘void boost::ReadWritePropertyMapConcept::constraints() [with PMap = boost::shared_array_property_map, long unsigned int> >; Key = long unsigned int]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::ReadWritePropertyMapConcept, long unsigned int> >, long unsigned int>]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied, long unsigned int> >, long unsigned int> >::value’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied, long unsigned int> >, long unsigned int> >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_, long unsigned int> >, long unsigned int>)>’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/depth_first_search.hpp:134:9: [ skipping 2 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/depth_first_search.hpp:397:42: required from ‘void boost::graph::detail::depth_first_search_impl::operator()(const Graph&, const ArgPack&) const [with ArgPack = boost::parameter::aux::arg_list >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&> > >, boost::parameter::aux::empty_arg_list, std::integral_constant >; Graph = boost::adjacency_list, boost::property >]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/depth_first_search.hpp:406:5: required from ‘typename boost::result_of(Param0, const ArgPack&)>::type boost::graph::depth_first_search_with_named_params(const Param0&, const ArgPack&) [with Param0 = boost::adjacency_list, boost::property >; ArgPack = boost::parameter::aux::arg_list >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&> > >, boost::parameter::aux::empty_arg_list, std::integral_constant >; typename boost::result_of(Param0, const ArgPack&)>::type = void]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/depth_first_search.hpp:409:1: required from ‘typename boost::result_of(Param0, const typename boost::detail::convert_bgl_params_to_boost_parameter >::type&)>::type boost::depth_first_search(const Param0&, const bgl_named_params&) [with Param0 = adjacency_list, property >; P = detail::components_recorder >, vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&> >; T = graph_visitor_t; R = no_property; typename result_of(Param0, const typename detail::convert_bgl_params_to_boost_parameter >::type&)>::type = void; typename detail::convert_bgl_params_to_boost_parameter >::type = parameter::aux::arg_list >, vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&> > >, parameter::aux::empty_arg_list, std::integral_constant >]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/connected_components.hpp:106:23: required from ‘typename boost::property_traits::value_type boost::connected_components(const Graph&, ComponentMap, typename enable_if_c::traversal_category>::value, graph::detail::no_parameter>::type) [with Graph = adjacency_list, property >; ComponentMap = iterator_property_map<__gnu_cxx::__normal_iterator >, vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>; typename property_traits::value_type = long unsigned int; typename enable_if_c::traversal_category>::value, graph::detail::no_parameter>::type = graph::detail::no_parameter; typename graph_traits::traversal_category = undir_adj_list_traversal_tag]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/make_connected.hpp:38:51: required from ‘void boost::make_connected(Graph&, VertexIndexMap, AddEdgeVisitor&) [with Graph = adjacency_list, property >; VertexIndexMap = vec_adj_list_vertex_id_map, long unsigned int>; AddEdgeVisitor = my_add_edge_visitor, property >, long unsigned int>]’ planar.cpp:211:26: required from here /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:65:52: warning: ‘this’ pointer is null [-Wnonnull] 65 | static void failed() { ((Model*)0)->constraints(); } | ~~~~~~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/property_map/property_map.hpp:147:10: note: in a call to non-static member function ‘void boost::ReadablePropertyMapConcept::constraints() [with PMap = boost::shared_array_property_map, long unsigned int> >; Key = long unsigned int]’ 147 | void constraints() { | ^~~~~~~~~~~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::constraint::failed() [with Model = boost::WritablePropertyMapConcept, long unsigned int> >, long unsigned int>]’: /home/omnipath/local/R/4.4-3.20/BH/include/boost/property_map/property_map.hpp:207:7: required from ‘void boost::ReadWritePropertyMapConcept::constraints() [with PMap = boost::shared_array_property_map, long unsigned int> >; Key = long unsigned int]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::ReadWritePropertyMapConcept, long unsigned int> >, long unsigned int>]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied, long unsigned int> >, long unsigned int> >::value’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied, long unsigned int> >, long unsigned int> >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_, long unsigned int> >, long unsigned int>)>’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/depth_first_search.hpp:134:9: [ skipping 2 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/depth_first_search.hpp:397:42: required from ‘void boost::graph::detail::depth_first_search_impl::operator()(const Graph&, const ArgPack&) const [with ArgPack = boost::parameter::aux::arg_list >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&> > >, boost::parameter::aux::empty_arg_list, std::integral_constant >; Graph = boost::adjacency_list, boost::property >]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/depth_first_search.hpp:406:5: required from ‘typename boost::result_of(Param0, const ArgPack&)>::type boost::graph::depth_first_search_with_named_params(const Param0&, const ArgPack&) [with Param0 = boost::adjacency_list, boost::property >; ArgPack = boost::parameter::aux::arg_list >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&> > >, boost::parameter::aux::empty_arg_list, std::integral_constant >; typename boost::result_of(Param0, const ArgPack&)>::type = void]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/depth_first_search.hpp:409:1: required from ‘typename boost::result_of(Param0, const typename boost::detail::convert_bgl_params_to_boost_parameter >::type&)>::type boost::depth_first_search(const Param0&, const bgl_named_params&) [with Param0 = adjacency_list, property >; P = detail::components_recorder >, vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&> >; T = graph_visitor_t; R = no_property; typename result_of(Param0, const typename detail::convert_bgl_params_to_boost_parameter >::type&)>::type = void; typename detail::convert_bgl_params_to_boost_parameter >::type = parameter::aux::arg_list >, vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&> > >, parameter::aux::empty_arg_list, std::integral_constant >]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/connected_components.hpp:106:23: required from ‘typename boost::property_traits::value_type boost::connected_components(const Graph&, ComponentMap, typename enable_if_c::traversal_category>::value, graph::detail::no_parameter>::type) [with Graph = adjacency_list, property >; ComponentMap = iterator_property_map<__gnu_cxx::__normal_iterator >, vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>; typename property_traits::value_type = long unsigned int; typename enable_if_c::traversal_category>::value, graph::detail::no_parameter>::type = graph::detail::no_parameter; typename graph_traits::traversal_category = undir_adj_list_traversal_tag]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/make_connected.hpp:38:51: required from ‘void boost::make_connected(Graph&, VertexIndexMap, AddEdgeVisitor&) [with Graph = adjacency_list, property >; VertexIndexMap = vec_adj_list_vertex_id_map, long unsigned int>; AddEdgeVisitor = my_add_edge_visitor, property >, long unsigned int>]’ planar.cpp:211:26: required from here /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:65:52: warning: ‘this’ pointer is null [-Wnonnull] 65 | static void failed() { ((Model*)0)->constraints(); } | ~~~~~~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/property_map/property_map.hpp:179:10: note: in a call to non-static member function ‘void boost::WritablePropertyMapConcept::constraints() [with PMap = boost::shared_array_property_map, long unsigned int> >; Key = long unsigned int]’ 179 | void constraints() { | ^~~~~~~~~~~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::EqualityComparable]’: /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements >]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:233:5: required from ‘struct boost::EqualityComparable’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/graph_concepts.hpp:502:1: required from ‘struct boost::concepts::ColorValue’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/graph_concepts.hpp:502:1: required from ‘struct boost::concepts::ColorValueConcept’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::concepts::ColorValueConcept]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:42:5: [ skipping 5 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/depth_first_search.hpp:397:42: required from ‘void boost::graph::detail::depth_first_search_impl::operator()(const Graph&, const ArgPack&) const [with ArgPack = boost::parameter::aux::arg_list >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&> > >, boost::parameter::aux::empty_arg_list, std::integral_constant >; Graph = boost::adjacency_list, boost::property >]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/depth_first_search.hpp:406:5: required from ‘typename boost::result_of(Param0, const ArgPack&)>::type boost::graph::depth_first_search_with_named_params(const Param0&, const ArgPack&) [with Param0 = boost::adjacency_list, boost::property >; ArgPack = boost::parameter::aux::arg_list >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&> > >, boost::parameter::aux::empty_arg_list, std::integral_constant >; typename boost::result_of(Param0, const ArgPack&)>::type = void]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/depth_first_search.hpp:409:1: required from ‘typename boost::result_of(Param0, const typename boost::detail::convert_bgl_params_to_boost_parameter >::type&)>::type boost::depth_first_search(const Param0&, const bgl_named_params&) [with Param0 = adjacency_list, property >; P = detail::components_recorder >, vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&> >; T = graph_visitor_t; R = no_property; typename result_of(Param0, const typename detail::convert_bgl_params_to_boost_parameter >::type&)>::type = void; typename detail::convert_bgl_params_to_boost_parameter >::type = parameter::aux::arg_list >, vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&> > >, parameter::aux::empty_arg_list, std::integral_constant >]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/connected_components.hpp:106:23: required from ‘typename boost::property_traits::value_type boost::connected_components(const Graph&, ComponentMap, typename enable_if_c::traversal_category>::value, graph::detail::no_parameter>::type) [with Graph = adjacency_list, property >; ComponentMap = iterator_property_map<__gnu_cxx::__normal_iterator >, vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>; typename property_traits::value_type = long unsigned int; typename enable_if_c::traversal_category>::value, graph::detail::no_parameter>::type = graph::detail::no_parameter; typename graph_traits::traversal_category = undir_adj_list_traversal_tag]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/make_connected.hpp:38:51: required from ‘void boost::make_connected(Graph&, VertexIndexMap, AddEdgeVisitor&) [with Graph = adjacency_list, property >; VertexIndexMap = vec_adj_list_vertex_id_map, long unsigned int>; AddEdgeVisitor = my_add_edge_visitor, property >, long unsigned int>]’ planar.cpp:211:26: required from here /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::EqualityComparable::~EqualityComparable() [with TT = boost::default_color_type]’ 37 | ~model() | ^ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:233:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 233 | BOOST_CONCEPT_USAGE(EqualityComparable) { | ^~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::DefaultConstructible]’: /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements >]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:137:5: required from ‘struct boost::DefaultConstructible’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/graph_concepts.hpp:502:1: required from ‘struct boost::concepts::ColorValue’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/graph_concepts.hpp:502:1: required from ‘struct boost::concepts::ColorValueConcept’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::concepts::ColorValueConcept]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:42:5: [ skipping 5 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/depth_first_search.hpp:397:42: required from ‘void boost::graph::detail::depth_first_search_impl::operator()(const Graph&, const ArgPack&) const [with ArgPack = boost::parameter::aux::arg_list >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&> > >, boost::parameter::aux::empty_arg_list, std::integral_constant >; Graph = boost::adjacency_list, boost::property >]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/depth_first_search.hpp:406:5: required from ‘typename boost::result_of(Param0, const ArgPack&)>::type boost::graph::depth_first_search_with_named_params(const Param0&, const ArgPack&) [with Param0 = boost::adjacency_list, boost::property >; ArgPack = boost::parameter::aux::arg_list >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&> > >, boost::parameter::aux::empty_arg_list, std::integral_constant >; typename boost::result_of(Param0, const ArgPack&)>::type = void]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/depth_first_search.hpp:409:1: required from ‘typename boost::result_of(Param0, const typename boost::detail::convert_bgl_params_to_boost_parameter >::type&)>::type boost::depth_first_search(const Param0&, const bgl_named_params&) [with Param0 = adjacency_list, property >; P = detail::components_recorder >, vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&> >; T = graph_visitor_t; R = no_property; typename result_of(Param0, const typename detail::convert_bgl_params_to_boost_parameter >::type&)>::type = void; typename detail::convert_bgl_params_to_boost_parameter >::type = parameter::aux::arg_list >, vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&> > >, parameter::aux::empty_arg_list, std::integral_constant >]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/connected_components.hpp:106:23: required from ‘typename boost::property_traits::value_type boost::connected_components(const Graph&, ComponentMap, typename enable_if_c::traversal_category>::value, graph::detail::no_parameter>::type) [with Graph = adjacency_list, property >; ComponentMap = iterator_property_map<__gnu_cxx::__normal_iterator >, vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>; typename property_traits::value_type = long unsigned int; typename enable_if_c::traversal_category>::value, graph::detail::no_parameter>::type = graph::detail::no_parameter; typename graph_traits::traversal_category = undir_adj_list_traversal_tag]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/make_connected.hpp:38:51: required from ‘void boost::make_connected(Graph&, VertexIndexMap, AddEdgeVisitor&) [with Graph = adjacency_list, property >; VertexIndexMap = vec_adj_list_vertex_id_map, long unsigned int>; AddEdgeVisitor = my_add_edge_visitor, property >, long unsigned int>]’ planar.cpp:211:26: required from here /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::DefaultConstructible::~DefaultConstructible() [with TT = boost::default_color_type]’ 37 | ~model() | ^ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:137:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 137 | BOOST_CONCEPT_USAGE(DefaultConstructible) { | ^~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::concepts::ColorValue]’: /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements >]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/graph_concepts.hpp:505:5: required from ‘struct boost::concepts::ColorValue’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/graph_concepts.hpp:502:1: required from ‘struct boost::concepts::ColorValueConcept’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::concepts::ColorValueConcept]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied >::value’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:45:51: [ skipping 4 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/depth_first_search.hpp:397:42: required from ‘void boost::graph::detail::depth_first_search_impl::operator()(const Graph&, const ArgPack&) const [with ArgPack = boost::parameter::aux::arg_list >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&> > >, boost::parameter::aux::empty_arg_list, std::integral_constant >; Graph = boost::adjacency_list, boost::property >]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/depth_first_search.hpp:406:5: required from ‘typename boost::result_of(Param0, const ArgPack&)>::type boost::graph::depth_first_search_with_named_params(const Param0&, const ArgPack&) [with Param0 = boost::adjacency_list, boost::property >; ArgPack = boost::parameter::aux::arg_list >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&> > >, boost::parameter::aux::empty_arg_list, std::integral_constant >; typename boost::result_of(Param0, const ArgPack&)>::type = void]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/depth_first_search.hpp:409:1: required from ‘typename boost::result_of(Param0, const typename boost::detail::convert_bgl_params_to_boost_parameter >::type&)>::type boost::depth_first_search(const Param0&, const bgl_named_params&) [with Param0 = adjacency_list, property >; P = detail::components_recorder >, vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&> >; T = graph_visitor_t; R = no_property; typename result_of(Param0, const typename detail::convert_bgl_params_to_boost_parameter >::type&)>::type = void; typename detail::convert_bgl_params_to_boost_parameter >::type = parameter::aux::arg_list >, vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&> > >, parameter::aux::empty_arg_list, std::integral_constant >]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/connected_components.hpp:106:23: required from ‘typename boost::property_traits::value_type boost::connected_components(const Graph&, ComponentMap, typename enable_if_c::traversal_category>::value, graph::detail::no_parameter>::type) [with Graph = adjacency_list, property >; ComponentMap = iterator_property_map<__gnu_cxx::__normal_iterator >, vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>; typename property_traits::value_type = long unsigned int; typename enable_if_c::traversal_category>::value, graph::detail::no_parameter>::type = graph::detail::no_parameter; typename graph_traits::traversal_category = undir_adj_list_traversal_tag]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/make_connected.hpp:38:51: required from ‘void boost::make_connected(Graph&, VertexIndexMap, AddEdgeVisitor&) [with Graph = adjacency_list, property >; VertexIndexMap = vec_adj_list_vertex_id_map, long unsigned int>; AddEdgeVisitor = my_add_edge_visitor, property >, long unsigned int>]’ planar.cpp:211:26: required from here /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::concepts::ColorValue::~ColorValue() [with C = boost::default_color_type]’ 37 | ~model() | ^ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/graph_concepts.hpp:505:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 505 | BOOST_CONCEPT_USAGE(ColorValue) | ^~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::SignedInteger]’: /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:514:9: required from ‘boost::InputIterator::~InputIterator() [with TT = __gnu_cxx::__normal_iterator >]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/usage.hpp:20:48: required from ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::InputIterator<__gnu_cxx::__normal_iterator > >]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements > > >]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:512:7: required from ‘struct boost::InputIterator<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:540:3: required from ‘struct boost::ForwardIterator<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:568:3: [ skipping 7 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.4-3.20/BH/include/boost/property_map/property_map.hpp:354:5: required from ‘boost::iterator_property_map boost::make_iterator_property_map(RAIter, ID, Value) [with RAIter = __gnu_cxx::__normal_iterator >; Value = long unsigned int; ID = vec_adj_list_vertex_id_map, long unsigned int>]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/biconnected_components.hpp:338:43: required from ‘static std::pair boost::detail::bicomp_dispatch1::apply(const Graph&, ComponentMap, OutputIterator, VertexIndexMap, const boost::bgl_named_params&, boost::param_not_found) [with Graph = boost::adjacency_list, boost::property >; ComponentMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::adj_list_edge_property_map, boost::edge_index_t>, long unsigned int, long unsigned int&>; OutputIterator = std::back_insert_iterator >; VertexIndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>; P = int; T = boost::buffer_param_t; R = boost::no_property]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/biconnected_components.hpp:368:60: required from ‘std::pair boost::biconnected_components(const Graph&, ComponentMap, OutputIterator, const bgl_named_params&) [with Graph = adjacency_list, property >; ComponentMap = iterator_property_map<__gnu_cxx::__normal_iterator >, adj_list_edge_property_map, edge_index_t>, long unsigned int, long unsigned int&>; OutputIterator = std::back_insert_iterator >; P = int; T = buffer_param_t; R = no_property]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/biconnected_components.hpp:377:34: required from ‘std::pair boost::biconnected_components(const Graph&, ComponentMap, OutputIterator) [with Graph = adjacency_list, property >; ComponentMap = iterator_property_map<__gnu_cxx::__normal_iterator >, adj_list_edge_property_map, edge_index_t>, long unsigned int, long unsigned int&>; OutputIterator = std::back_insert_iterator >]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/make_biconnected_planar.hpp:44:27: required from ‘void boost::make_biconnected_planar(Graph&, PlanarEmbedding, EdgeIndexMap, AddEdgeVisitor&) [with Graph = adjacency_list, property >; PlanarEmbedding = std::vector >*; EdgeIndexMap = adj_list_edge_property_map, edge_index_t>; AddEdgeVisitor = my_add_edge_visitor, property >, long unsigned int>]’ planar.cpp:213:35: required from here /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:107:22: note: in a call to non-static member function ‘boost::SignedInteger::~SignedInteger()’ 107 | template <> struct SignedInteger {}; | ^~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements >]’: /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:208:5: required from ‘struct boost::Convertible’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::Convertible]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied >::value’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_)>’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:515:9: [ skipping 12 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.4-3.20/BH/include/boost/property_map/property_map.hpp:354:5: required from ‘boost::iterator_property_map boost::make_iterator_property_map(RAIter, ID, Value) [with RAIter = __gnu_cxx::__normal_iterator >; Value = long unsigned int; ID = vec_adj_list_vertex_id_map, long unsigned int>]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/biconnected_components.hpp:338:43: required from ‘static std::pair boost::detail::bicomp_dispatch1::apply(const Graph&, ComponentMap, OutputIterator, VertexIndexMap, const boost::bgl_named_params&, boost::param_not_found) [with Graph = boost::adjacency_list, boost::property >; ComponentMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::adj_list_edge_property_map, boost::edge_index_t>, long unsigned int, long unsigned int&>; OutputIterator = std::back_insert_iterator >; VertexIndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>; P = int; T = boost::buffer_param_t; R = boost::no_property]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/biconnected_components.hpp:368:60: required from ‘std::pair boost::biconnected_components(const Graph&, ComponentMap, OutputIterator, const bgl_named_params&) [with Graph = adjacency_list, property >; ComponentMap = iterator_property_map<__gnu_cxx::__normal_iterator >, adj_list_edge_property_map, edge_index_t>, long unsigned int, long unsigned int&>; OutputIterator = std::back_insert_iterator >; P = int; T = buffer_param_t; R = no_property]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/biconnected_components.hpp:377:34: required from ‘std::pair boost::biconnected_components(const Graph&, ComponentMap, OutputIterator) [with Graph = adjacency_list, property >; ComponentMap = iterator_property_map<__gnu_cxx::__normal_iterator >, adj_list_edge_property_map, edge_index_t>, long unsigned int, long unsigned int&>; OutputIterator = std::back_insert_iterator >]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/make_biconnected_planar.hpp:44:27: required from ‘void boost::make_biconnected_planar(Graph&, PlanarEmbedding, EdgeIndexMap, AddEdgeVisitor&) [with Graph = adjacency_list, property >; PlanarEmbedding = std::vector >*; EdgeIndexMap = adj_list_edge_property_map, edge_index_t>; AddEdgeVisitor = my_add_edge_visitor, property >, long unsigned int>]’ planar.cpp:213:35: required from here /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::Convertible]’ 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ^ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::Convertible]’: /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:515:9: required from ‘boost::InputIterator::~InputIterator() [with TT = __gnu_cxx::__normal_iterator >]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/usage.hpp:20:48: required from ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::InputIterator<__gnu_cxx::__normal_iterator > >]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements > > >]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:512:7: required from ‘struct boost::InputIterator<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:540:3: required from ‘struct boost::ForwardIterator<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:568:3: [ skipping 7 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.4-3.20/BH/include/boost/property_map/property_map.hpp:354:5: required from ‘boost::iterator_property_map boost::make_iterator_property_map(RAIter, ID, Value) [with RAIter = __gnu_cxx::__normal_iterator >; Value = long unsigned int; ID = vec_adj_list_vertex_id_map, long unsigned int>]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/biconnected_components.hpp:338:43: required from ‘static std::pair boost::detail::bicomp_dispatch1::apply(const Graph&, ComponentMap, OutputIterator, VertexIndexMap, const boost::bgl_named_params&, boost::param_not_found) [with Graph = boost::adjacency_list, boost::property >; ComponentMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::adj_list_edge_property_map, boost::edge_index_t>, long unsigned int, long unsigned int&>; OutputIterator = std::back_insert_iterator >; VertexIndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>; P = int; T = boost::buffer_param_t; R = boost::no_property]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/biconnected_components.hpp:368:60: required from ‘std::pair boost::biconnected_components(const Graph&, ComponentMap, OutputIterator, const bgl_named_params&) [with Graph = adjacency_list, property >; ComponentMap = iterator_property_map<__gnu_cxx::__normal_iterator >, adj_list_edge_property_map, edge_index_t>, long unsigned int, long unsigned int&>; OutputIterator = std::back_insert_iterator >; P = int; T = buffer_param_t; R = no_property]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/biconnected_components.hpp:377:34: required from ‘std::pair boost::biconnected_components(const Graph&, ComponentMap, OutputIterator) [with Graph = adjacency_list, property >; ComponentMap = iterator_property_map<__gnu_cxx::__normal_iterator >, adj_list_edge_property_map, edge_index_t>, long unsigned int, long unsigned int&>; OutputIterator = std::back_insert_iterator >]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/make_biconnected_planar.hpp:44:27: required from ‘void boost::make_biconnected_planar(Graph&, PlanarEmbedding, EdgeIndexMap, AddEdgeVisitor&) [with Graph = adjacency_list, property >; PlanarEmbedding = std::vector >*; EdgeIndexMap = adj_list_edge_property_map, edge_index_t>; AddEdgeVisitor = my_add_edge_visitor, property >, long unsigned int>]’ planar.cpp:213:35: required from here /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::Convertible::~Convertible() [with X = std::random_access_iterator_tag; Y = std::input_iterator_tag]’ 37 | ~model() | ^ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:208:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 208 | BOOST_CONCEPT_USAGE(Convertible) { | ^~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements >]’: /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:208:5: required from ‘struct boost::Convertible’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::Convertible]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied >::value’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_)>’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:545:11: [ skipping 11 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.4-3.20/BH/include/boost/property_map/property_map.hpp:354:5: required from ‘boost::iterator_property_map boost::make_iterator_property_map(RAIter, ID, Value) [with RAIter = __gnu_cxx::__normal_iterator >; Value = long unsigned int; ID = vec_adj_list_vertex_id_map, long unsigned int>]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/biconnected_components.hpp:338:43: required from ‘static std::pair boost::detail::bicomp_dispatch1::apply(const Graph&, ComponentMap, OutputIterator, VertexIndexMap, const boost::bgl_named_params&, boost::param_not_found) [with Graph = boost::adjacency_list, boost::property >; ComponentMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::adj_list_edge_property_map, boost::edge_index_t>, long unsigned int, long unsigned int&>; OutputIterator = std::back_insert_iterator >; VertexIndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>; P = int; T = boost::buffer_param_t; R = boost::no_property]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/biconnected_components.hpp:368:60: required from ‘std::pair boost::biconnected_components(const Graph&, ComponentMap, OutputIterator, const bgl_named_params&) [with Graph = adjacency_list, property >; ComponentMap = iterator_property_map<__gnu_cxx::__normal_iterator >, adj_list_edge_property_map, edge_index_t>, long unsigned int, long unsigned int&>; OutputIterator = std::back_insert_iterator >; P = int; T = buffer_param_t; R = no_property]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/biconnected_components.hpp:377:34: required from ‘std::pair boost::biconnected_components(const Graph&, ComponentMap, OutputIterator) [with Graph = adjacency_list, property >; ComponentMap = iterator_property_map<__gnu_cxx::__normal_iterator >, adj_list_edge_property_map, edge_index_t>, long unsigned int, long unsigned int&>; OutputIterator = std::back_insert_iterator >]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/make_biconnected_planar.hpp:44:27: required from ‘void boost::make_biconnected_planar(Graph&, PlanarEmbedding, EdgeIndexMap, AddEdgeVisitor&) [with Graph = adjacency_list, property >; PlanarEmbedding = std::vector >*; EdgeIndexMap = adj_list_edge_property_map, edge_index_t>; AddEdgeVisitor = my_add_edge_visitor, property >, long unsigned int>]’ planar.cpp:213:35: required from here /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::Convertible]’ 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ^ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::Convertible]’: /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:545:11: required from ‘boost::ForwardIterator::~ForwardIterator() [with TT = __gnu_cxx::__normal_iterator >]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/usage.hpp:20:48: required from ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::ForwardIterator<__gnu_cxx::__normal_iterator > >]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements > > >]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:543:7: required from ‘struct boost::ForwardIterator<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:568:3: required from ‘struct boost::BidirectionalIterator<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:597:3: [ skipping 6 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.4-3.20/BH/include/boost/property_map/property_map.hpp:354:5: required from ‘boost::iterator_property_map boost::make_iterator_property_map(RAIter, ID, Value) [with RAIter = __gnu_cxx::__normal_iterator >; Value = long unsigned int; ID = vec_adj_list_vertex_id_map, long unsigned int>]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/biconnected_components.hpp:338:43: required from ‘static std::pair boost::detail::bicomp_dispatch1::apply(const Graph&, ComponentMap, OutputIterator, VertexIndexMap, const boost::bgl_named_params&, boost::param_not_found) [with Graph = boost::adjacency_list, boost::property >; ComponentMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::adj_list_edge_property_map, boost::edge_index_t>, long unsigned int, long unsigned int&>; OutputIterator = std::back_insert_iterator >; VertexIndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>; P = int; T = boost::buffer_param_t; R = boost::no_property]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/biconnected_components.hpp:368:60: required from ‘std::pair boost::biconnected_components(const Graph&, ComponentMap, OutputIterator, const bgl_named_params&) [with Graph = adjacency_list, property >; ComponentMap = iterator_property_map<__gnu_cxx::__normal_iterator >, adj_list_edge_property_map, edge_index_t>, long unsigned int, long unsigned int&>; OutputIterator = std::back_insert_iterator >; P = int; T = buffer_param_t; R = no_property]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/biconnected_components.hpp:377:34: required from ‘std::pair boost::biconnected_components(const Graph&, ComponentMap, OutputIterator) [with Graph = adjacency_list, property >; ComponentMap = iterator_property_map<__gnu_cxx::__normal_iterator >, adj_list_edge_property_map, edge_index_t>, long unsigned int, long unsigned int&>; OutputIterator = std::back_insert_iterator >]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/make_biconnected_planar.hpp:44:27: required from ‘void boost::make_biconnected_planar(Graph&, PlanarEmbedding, EdgeIndexMap, AddEdgeVisitor&) [with Graph = adjacency_list, property >; PlanarEmbedding = std::vector >*; EdgeIndexMap = adj_list_edge_property_map, edge_index_t>; AddEdgeVisitor = my_add_edge_visitor, property >, long unsigned int>]’ planar.cpp:213:35: required from here /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::Convertible::~Convertible() [with X = std::random_access_iterator_tag; Y = std::forward_iterator_tag]’ 37 | ~model() | ^ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:208:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 208 | BOOST_CONCEPT_USAGE(Convertible) { | ^~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements >]’: /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:208:5: required from ‘struct boost::Convertible’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::Convertible]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied >::value’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_)>’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:573:11: [ skipping 10 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.4-3.20/BH/include/boost/property_map/property_map.hpp:354:5: required from ‘boost::iterator_property_map boost::make_iterator_property_map(RAIter, ID, Value) [with RAIter = __gnu_cxx::__normal_iterator >; Value = long unsigned int; ID = vec_adj_list_vertex_id_map, long unsigned int>]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/biconnected_components.hpp:338:43: required from ‘static std::pair boost::detail::bicomp_dispatch1::apply(const Graph&, ComponentMap, OutputIterator, VertexIndexMap, const boost::bgl_named_params&, boost::param_not_found) [with Graph = boost::adjacency_list, boost::property >; ComponentMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::adj_list_edge_property_map, boost::edge_index_t>, long unsigned int, long unsigned int&>; OutputIterator = std::back_insert_iterator >; VertexIndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>; P = int; T = boost::buffer_param_t; R = boost::no_property]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/biconnected_components.hpp:368:60: required from ‘std::pair boost::biconnected_components(const Graph&, ComponentMap, OutputIterator, const bgl_named_params&) [with Graph = adjacency_list, property >; ComponentMap = iterator_property_map<__gnu_cxx::__normal_iterator >, adj_list_edge_property_map, edge_index_t>, long unsigned int, long unsigned int&>; OutputIterator = std::back_insert_iterator >; P = int; T = buffer_param_t; R = no_property]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/biconnected_components.hpp:377:34: required from ‘std::pair boost::biconnected_components(const Graph&, ComponentMap, OutputIterator) [with Graph = adjacency_list, property >; ComponentMap = iterator_property_map<__gnu_cxx::__normal_iterator >, adj_list_edge_property_map, edge_index_t>, long unsigned int, long unsigned int&>; OutputIterator = std::back_insert_iterator >]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/make_biconnected_planar.hpp:44:27: required from ‘void boost::make_biconnected_planar(Graph&, PlanarEmbedding, EdgeIndexMap, AddEdgeVisitor&) [with Graph = adjacency_list, property >; PlanarEmbedding = std::vector >*; EdgeIndexMap = adj_list_edge_property_map, edge_index_t>; AddEdgeVisitor = my_add_edge_visitor, property >, long unsigned int>]’ planar.cpp:213:35: required from here /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::Convertible]’ 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ^ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::Convertible]’: /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:573:11: required from ‘boost::BidirectionalIterator::~BidirectionalIterator() [with TT = __gnu_cxx::__normal_iterator >]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/usage.hpp:20:48: required from ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::BidirectionalIterator<__gnu_cxx::__normal_iterator > >]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements > > >]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:571:7: required from ‘struct boost::BidirectionalIterator<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:597:3: required from ‘struct boost::RandomAccessIterator<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:597:3: [ skipping 5 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.4-3.20/BH/include/boost/property_map/property_map.hpp:354:5: required from ‘boost::iterator_property_map boost::make_iterator_property_map(RAIter, ID, Value) [with RAIter = __gnu_cxx::__normal_iterator >; Value = long unsigned int; ID = vec_adj_list_vertex_id_map, long unsigned int>]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/biconnected_components.hpp:338:43: required from ‘static std::pair boost::detail::bicomp_dispatch1::apply(const Graph&, ComponentMap, OutputIterator, VertexIndexMap, const boost::bgl_named_params&, boost::param_not_found) [with Graph = boost::adjacency_list, boost::property >; ComponentMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::adj_list_edge_property_map, boost::edge_index_t>, long unsigned int, long unsigned int&>; OutputIterator = std::back_insert_iterator >; VertexIndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>; P = int; T = boost::buffer_param_t; R = boost::no_property]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/biconnected_components.hpp:368:60: required from ‘std::pair boost::biconnected_components(const Graph&, ComponentMap, OutputIterator, const bgl_named_params&) [with Graph = adjacency_list, property >; ComponentMap = iterator_property_map<__gnu_cxx::__normal_iterator >, adj_list_edge_property_map, edge_index_t>, long unsigned int, long unsigned int&>; OutputIterator = std::back_insert_iterator >; P = int; T = buffer_param_t; R = no_property]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/biconnected_components.hpp:377:34: required from ‘std::pair boost::biconnected_components(const Graph&, ComponentMap, OutputIterator) [with Graph = adjacency_list, property >; ComponentMap = iterator_property_map<__gnu_cxx::__normal_iterator >, adj_list_edge_property_map, edge_index_t>, long unsigned int, long unsigned int&>; OutputIterator = std::back_insert_iterator >]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/make_biconnected_planar.hpp:44:27: required from ‘void boost::make_biconnected_planar(Graph&, PlanarEmbedding, EdgeIndexMap, AddEdgeVisitor&) [with Graph = adjacency_list, property >; PlanarEmbedding = std::vector >*; EdgeIndexMap = adj_list_edge_property_map, edge_index_t>; AddEdgeVisitor = my_add_edge_visitor, property >, long unsigned int>]’ planar.cpp:213:35: required from here /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::Convertible::~Convertible() [with X = std::random_access_iterator_tag; Y = std::bidirectional_iterator_tag]’ 37 | ~model() | ^ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:208:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 208 | BOOST_CONCEPT_USAGE(Convertible) { | ^~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::Convertible]’: /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements >]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:208:5: required from ‘struct boost::Convertible’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::Convertible]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied >::value’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:72:8: [ skipping 3 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.4-3.20/BH/include/boost/property_map/property_map.hpp:354:5: required from ‘boost::iterator_property_map boost::make_iterator_property_map(RAIter, ID, Value) [with RAIter = __gnu_cxx::__normal_iterator >; Value = long unsigned int; ID = vec_adj_list_vertex_id_map, long unsigned int>]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/biconnected_components.hpp:338:43: required from ‘static std::pair boost::detail::bicomp_dispatch1::apply(const Graph&, ComponentMap, OutputIterator, VertexIndexMap, const boost::bgl_named_params&, boost::param_not_found) [with Graph = boost::adjacency_list, boost::property >; ComponentMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::adj_list_edge_property_map, boost::edge_index_t>, long unsigned int, long unsigned int&>; OutputIterator = std::back_insert_iterator >; VertexIndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>; P = int; T = boost::buffer_param_t; R = boost::no_property]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/biconnected_components.hpp:368:60: required from ‘std::pair boost::biconnected_components(const Graph&, ComponentMap, OutputIterator, const bgl_named_params&) [with Graph = adjacency_list, property >; ComponentMap = iterator_property_map<__gnu_cxx::__normal_iterator >, adj_list_edge_property_map, edge_index_t>, long unsigned int, long unsigned int&>; OutputIterator = std::back_insert_iterator >; P = int; T = buffer_param_t; R = no_property]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/biconnected_components.hpp:377:34: required from ‘std::pair boost::biconnected_components(const Graph&, ComponentMap, OutputIterator) [with Graph = adjacency_list, property >; ComponentMap = iterator_property_map<__gnu_cxx::__normal_iterator >, adj_list_edge_property_map, edge_index_t>, long unsigned int, long unsigned int&>; OutputIterator = std::back_insert_iterator >]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/make_biconnected_planar.hpp:44:27: required from ‘void boost::make_biconnected_planar(Graph&, PlanarEmbedding, EdgeIndexMap, AddEdgeVisitor&) [with Graph = adjacency_list, property >; PlanarEmbedding = std::vector >*; EdgeIndexMap = adj_list_edge_property_map, edge_index_t>; AddEdgeVisitor = my_add_edge_visitor, property >, long unsigned int>]’ planar.cpp:213:35: required from here /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::Convertible::~Convertible() [with X = std::random_access_iterator_tag; Y = std::random_access_iterator_tag]’ 37 | ~model() | ^ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:208:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 208 | BOOST_CONCEPT_USAGE(Convertible) { | ^~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::concepts::VertexListGraph, boost::property > >]’: /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements, boost::property > > >]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/graph_concepts.hpp:182:5: required from ‘struct boost::concepts::VertexListGraph, boost::property > >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/graph_concepts.hpp:176:1: required from ‘struct boost::concepts::VertexListGraphConcept, boost::property > >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::concepts::VertexListGraphConcept, boost::property > >]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied, boost::property > > >::value’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:45:51: [ skipping 4 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/biconnected_components.hpp:295:60: required from ‘static std::pair boost::detail::bicomp_dispatch2::apply(const Graph&, ComponentMap, OutputIterator, VertexIndexMap, DiscoverTimeMap, const boost::bgl_named_params&, boost::param_not_found) [with Graph = boost::adjacency_list, boost::property >; ComponentMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::adj_list_edge_property_map, boost::edge_index_t>, long unsigned int, long unsigned int&>; OutputIterator = std::back_insert_iterator >; VertexIndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>; DiscoverTimeMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>; P = int; T = boost::buffer_param_t; R = boost::no_property]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/biconnected_components.hpp:336:60: required from ‘static std::pair boost::detail::bicomp_dispatch1::apply(const Graph&, ComponentMap, OutputIterator, VertexIndexMap, const boost::bgl_named_params&, boost::param_not_found) [with Graph = boost::adjacency_list, boost::property >; ComponentMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::adj_list_edge_property_map, boost::edge_index_t>, long unsigned int, long unsigned int&>; OutputIterator = std::back_insert_iterator >; VertexIndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>; P = int; T = boost::buffer_param_t; R = boost::no_property]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/biconnected_components.hpp:368:60: required from ‘std::pair boost::biconnected_components(const Graph&, ComponentMap, OutputIterator, const bgl_named_params&) [with Graph = adjacency_list, property >; ComponentMap = iterator_property_map<__gnu_cxx::__normal_iterator >, adj_list_edge_property_map, edge_index_t>, long unsigned int, long unsigned int&>; OutputIterator = std::back_insert_iterator >; P = int; T = buffer_param_t; R = no_property]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/biconnected_components.hpp:377:34: required from ‘std::pair boost::biconnected_components(const Graph&, ComponentMap, OutputIterator) [with Graph = adjacency_list, property >; ComponentMap = iterator_property_map<__gnu_cxx::__normal_iterator >, adj_list_edge_property_map, edge_index_t>, long unsigned int, long unsigned int&>; OutputIterator = std::back_insert_iterator >]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/make_biconnected_planar.hpp:44:27: required from ‘void boost::make_biconnected_planar(Graph&, PlanarEmbedding, EdgeIndexMap, AddEdgeVisitor&) [with Graph = adjacency_list, property >; PlanarEmbedding = std::vector >*; EdgeIndexMap = adj_list_edge_property_map, edge_index_t>; AddEdgeVisitor = my_add_edge_visitor, property >, long unsigned int>]’ planar.cpp:213:35: required from here /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::concepts::VertexListGraph::~VertexListGraph() [with G = boost::adjacency_list, boost::property >]’ 37 | ~model() | ^ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/graph_concepts.hpp:182:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 182 | BOOST_CONCEPT_USAGE(VertexListGraph) | ^~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::constraint::failed() [with Model = boost::ReadablePropertyMapConcept >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>, long unsigned int>]’: /home/omnipath/local/R/4.4-3.20/BH/include/boost/property_map/property_map.hpp:206:7: required from ‘void boost::ReadWritePropertyMapConcept::constraints() [with PMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>; Key = long unsigned int]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::ReadWritePropertyMapConcept >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>, long unsigned int>]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>, long unsigned int> >::value’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>, long unsigned int> >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_ >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>, long unsigned int>)>’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/biconnected_components.hpp:192:9: [ skipping 2 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/biconnected_components.hpp:295:60: required from ‘static std::pair boost::detail::bicomp_dispatch2::apply(const Graph&, ComponentMap, OutputIterator, VertexIndexMap, DiscoverTimeMap, const boost::bgl_named_params&, boost::param_not_found) [with Graph = boost::adjacency_list, boost::property >; ComponentMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::adj_list_edge_property_map, boost::edge_index_t>, long unsigned int, long unsigned int&>; OutputIterator = std::back_insert_iterator >; VertexIndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>; DiscoverTimeMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>; P = int; T = boost::buffer_param_t; R = boost::no_property]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/biconnected_components.hpp:336:60: required from ‘static std::pair boost::detail::bicomp_dispatch1::apply(const Graph&, ComponentMap, OutputIterator, VertexIndexMap, const boost::bgl_named_params&, boost::param_not_found) [with Graph = boost::adjacency_list, boost::property >; ComponentMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::adj_list_edge_property_map, boost::edge_index_t>, long unsigned int, long unsigned int&>; OutputIterator = std::back_insert_iterator >; VertexIndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>; P = int; T = boost::buffer_param_t; R = boost::no_property]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/biconnected_components.hpp:368:60: required from ‘std::pair boost::biconnected_components(const Graph&, ComponentMap, OutputIterator, const bgl_named_params&) [with Graph = adjacency_list, property >; ComponentMap = iterator_property_map<__gnu_cxx::__normal_iterator >, adj_list_edge_property_map, edge_index_t>, long unsigned int, long unsigned int&>; OutputIterator = std::back_insert_iterator >; P = int; T = buffer_param_t; R = no_property]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/biconnected_components.hpp:377:34: required from ‘std::pair boost::biconnected_components(const Graph&, ComponentMap, OutputIterator) [with Graph = adjacency_list, property >; ComponentMap = iterator_property_map<__gnu_cxx::__normal_iterator >, adj_list_edge_property_map, edge_index_t>, long unsigned int, long unsigned int&>; OutputIterator = std::back_insert_iterator >]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/make_biconnected_planar.hpp:44:27: required from ‘void boost::make_biconnected_planar(Graph&, PlanarEmbedding, EdgeIndexMap, AddEdgeVisitor&) [with Graph = adjacency_list, property >; PlanarEmbedding = std::vector >*; EdgeIndexMap = adj_list_edge_property_map, edge_index_t>; AddEdgeVisitor = my_add_edge_visitor, property >, long unsigned int>]’ planar.cpp:213:35: required from here /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:65:52: warning: ‘this’ pointer is null [-Wnonnull] 65 | static void failed() { ((Model*)0)->constraints(); } | ~~~~~~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/property_map/property_map.hpp:147:10: note: in a call to non-static member function ‘void boost::ReadablePropertyMapConcept::constraints() [with PMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>; Key = long unsigned int]’ 147 | void constraints() { | ^~~~~~~~~~~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements > >]’: /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/graph_concepts.hpp:52:50: required from ‘struct boost::concepts::MultiPassInputIterator >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::concepts::MultiPassInputIterator >]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied > >::value’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied > >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_ >)>’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/graph_concepts.hpp:184:9: [ skipping 3 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/isomorphism.hpp:651:42: required from ‘bool boost::graph::detail::isomorphism_impl::operator()(const Graph1&, const Graph2&, const ArgPack&) const [with ArgPack = boost::parameter::aux::empty_arg_list; Graph1 = boost::adjacency_list; Graph2 = boost::adjacency_list]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/isomorphism.hpp:662:5: required from ‘typename boost::result_of(Param0, Param1, const ArgPack&)>::type boost::graph::isomorphism_with_named_params(const Param0&, const Param1&, const ArgPack&) [with Param0 = boost::adjacency_list; Param1 = boost::adjacency_list; ArgPack = boost::parameter::aux::empty_arg_list; typename boost::result_of(Param0, Param1, const ArgPack&)>::type = bool]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/isomorphism.hpp:666:1: required from ‘typename boost::result_of(Param0, Param1, const boost::parameter::aux::empty_arg_list&)>::type boost::isomorphism(const Param0&, const Param1&) [with Param0 = adjacency_list; Param1 = adjacency_list; typename result_of(Param0, Param1, const parameter::aux::empty_arg_list&)>::type = bool]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/is_kuratowski_subgraph.hpp:278:34: required from ‘bool boost::is_kuratowski_subgraph(const Graph&, ForwardIterator, ForwardIterator, VertexIndexMap) [with Graph = adjacency_list, property >; ForwardIterator = __gnu_cxx::__normal_iterator*, std::vector > >; VertexIndexMap = vec_adj_list_vertex_id_map, long unsigned int>]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/is_kuratowski_subgraph.hpp:290:34: required from ‘bool boost::is_kuratowski_subgraph(const Graph&, ForwardIterator, ForwardIterator) [with Graph = adjacency_list, property >; ForwardIterator = __gnu_cxx::__normal_iterator*, std::vector > >]’ planar.cpp:435:37: required from here /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::concepts::MultiPassInputIterator >]’ 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ^ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::MultiPassInputIterator >]’: /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/graph_concepts.hpp:184:9: required from ‘boost::concepts::VertexListGraph::~VertexListGraph() [with G = boost::adjacency_list]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/graph_concepts.hpp:176:1: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::VertexListGraphConcept >]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/isomorphism.hpp:494:5: required from ‘bool boost::isomorphism(const Graph1&, const Graph2&, IsoMapping, Invariant1, Invariant2, std::size_t, IndexMap1, IndexMap2) [with Graph1 = adjacency_list; Graph2 = adjacency_list; IsoMapping = shared_array_property_map >; Invariant1 = degree_vertex_invariant >, adjacency_list >; Invariant2 = degree_vertex_invariant >, adjacency_list >; IndexMap1 = vec_adj_list_vertex_id_map; IndexMap2 = vec_adj_list_vertex_id_map; std::size_t = long unsigned int]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/isomorphism.hpp:651:42: required from ‘bool boost::graph::detail::isomorphism_impl::operator()(const Graph1&, const Graph2&, const ArgPack&) const [with ArgPack = boost::parameter::aux::empty_arg_list; Graph1 = boost::adjacency_list; Graph2 = boost::adjacency_list]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/isomorphism.hpp:662:5: required from ‘typename boost::result_of(Param0, Param1, const ArgPack&)>::type boost::graph::isomorphism_with_named_params(const Param0&, const Param1&, const ArgPack&) [with Param0 = boost::adjacency_list; Param1 = boost::adjacency_list; ArgPack = boost::parameter::aux::empty_arg_list; typename boost::result_of(Param0, Param1, const ArgPack&)>::type = bool]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/isomorphism.hpp:666:1: required from ‘typename boost::result_of(Param0, Param1, const boost::parameter::aux::empty_arg_list&)>::type boost::isomorphism(const Param0&, const Param1&) [with Param0 = adjacency_list; Param1 = adjacency_list; typename result_of(Param0, Param1, const parameter::aux::empty_arg_list&)>::type = bool]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/is_kuratowski_subgraph.hpp:278:34: required from ‘bool boost::is_kuratowski_subgraph(const Graph&, ForwardIterator, ForwardIterator, VertexIndexMap) [with Graph = adjacency_list, property >; ForwardIterator = __gnu_cxx::__normal_iterator*, std::vector > >; VertexIndexMap = vec_adj_list_vertex_id_map, long unsigned int>]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/is_kuratowski_subgraph.hpp:290:34: required from ‘bool boost::is_kuratowski_subgraph(const Graph&, ForwardIterator, ForwardIterator) [with Graph = adjacency_list, property >; ForwardIterator = __gnu_cxx::__normal_iterator*, std::vector > >]’ planar.cpp:435:37: required from here /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::concepts::MultiPassInputIterator::~MultiPassInputIterator() [with T = boost::range_detail::integer_iterator]’ 37 | ~model() | ^ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/graph_concepts.hpp:52:50: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 52 | BOOST_concept(MultiPassInputIterator, (T)) { BOOST_CONCEPT_USAGE( | ^~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements >]’: /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:208:5: required from ‘struct boost::Convertible’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::Convertible]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied >::value’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_)>’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/graph_concepts.hpp:185:9: [ skipping 3 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/isomorphism.hpp:651:42: required from ‘bool boost::graph::detail::isomorphism_impl::operator()(const Graph1&, const Graph2&, const ArgPack&) const [with ArgPack = boost::parameter::aux::empty_arg_list; Graph1 = boost::adjacency_list; Graph2 = boost::adjacency_list]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/isomorphism.hpp:662:5: required from ‘typename boost::result_of(Param0, Param1, const ArgPack&)>::type boost::graph::isomorphism_with_named_params(const Param0&, const Param1&, const ArgPack&) [with Param0 = boost::adjacency_list; Param1 = boost::adjacency_list; ArgPack = boost::parameter::aux::empty_arg_list; typename boost::result_of(Param0, Param1, const ArgPack&)>::type = bool]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/isomorphism.hpp:666:1: required from ‘typename boost::result_of(Param0, Param1, const boost::parameter::aux::empty_arg_list&)>::type boost::isomorphism(const Param0&, const Param1&) [with Param0 = adjacency_list; Param1 = adjacency_list; typename result_of(Param0, Param1, const parameter::aux::empty_arg_list&)>::type = bool]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/is_kuratowski_subgraph.hpp:278:34: required from ‘bool boost::is_kuratowski_subgraph(const Graph&, ForwardIterator, ForwardIterator, VertexIndexMap) [with Graph = adjacency_list, property >; ForwardIterator = __gnu_cxx::__normal_iterator*, std::vector > >; VertexIndexMap = vec_adj_list_vertex_id_map, long unsigned int>]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/is_kuratowski_subgraph.hpp:290:34: required from ‘bool boost::is_kuratowski_subgraph(const Graph&, ForwardIterator, ForwardIterator) [with Graph = adjacency_list, property >; ForwardIterator = __gnu_cxx::__normal_iterator*, std::vector > >]’ planar.cpp:435:37: required from here /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::Convertible]’ 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ^ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::Convertible]’: /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/graph_concepts.hpp:185:9: required from ‘boost::concepts::VertexListGraph::~VertexListGraph() [with G = boost::adjacency_list]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/graph_concepts.hpp:176:1: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::VertexListGraphConcept >]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/isomorphism.hpp:494:5: required from ‘bool boost::isomorphism(const Graph1&, const Graph2&, IsoMapping, Invariant1, Invariant2, std::size_t, IndexMap1, IndexMap2) [with Graph1 = adjacency_list; Graph2 = adjacency_list; IsoMapping = shared_array_property_map >; Invariant1 = degree_vertex_invariant >, adjacency_list >; Invariant2 = degree_vertex_invariant >, adjacency_list >; IndexMap1 = vec_adj_list_vertex_id_map; IndexMap2 = vec_adj_list_vertex_id_map; std::size_t = long unsigned int]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/isomorphism.hpp:651:42: required from ‘bool boost::graph::detail::isomorphism_impl::operator()(const Graph1&, const Graph2&, const ArgPack&) const [with ArgPack = boost::parameter::aux::empty_arg_list; Graph1 = boost::adjacency_list; Graph2 = boost::adjacency_list]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/isomorphism.hpp:662:5: required from ‘typename boost::result_of(Param0, Param1, const ArgPack&)>::type boost::graph::isomorphism_with_named_params(const Param0&, const Param1&, const ArgPack&) [with Param0 = boost::adjacency_list; Param1 = boost::adjacency_list; ArgPack = boost::parameter::aux::empty_arg_list; typename boost::result_of(Param0, Param1, const ArgPack&)>::type = bool]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/isomorphism.hpp:666:1: required from ‘typename boost::result_of(Param0, Param1, const boost::parameter::aux::empty_arg_list&)>::type boost::isomorphism(const Param0&, const Param1&) [with Param0 = adjacency_list; Param1 = adjacency_list; typename result_of(Param0, Param1, const parameter::aux::empty_arg_list&)>::type = bool]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/is_kuratowski_subgraph.hpp:278:34: required from ‘bool boost::is_kuratowski_subgraph(const Graph&, ForwardIterator, ForwardIterator, VertexIndexMap) [with Graph = adjacency_list, property >; ForwardIterator = __gnu_cxx::__normal_iterator*, std::vector > >; VertexIndexMap = vec_adj_list_vertex_id_map, long unsigned int>]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/is_kuratowski_subgraph.hpp:290:34: required from ‘bool boost::is_kuratowski_subgraph(const Graph&, ForwardIterator, ForwardIterator) [with Graph = adjacency_list, property >; ForwardIterator = __gnu_cxx::__normal_iterator*, std::vector > >]’ planar.cpp:435:37: required from here /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::Convertible::~Convertible() [with X = boost::undir_adj_list_traversal_tag; Y = boost::vertex_list_graph_tag]’ 37 | ~model() | ^ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:208:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 208 | BOOST_CONCEPT_USAGE(Convertible) { | ^~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements >, boost::detail::edge_desc_impl, long int> > >]’: /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/graph_concepts.hpp:52:50: required from ‘struct boost::concepts::MultiPassInputIterator >, boost::detail::edge_desc_impl, long int> >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::concepts::MultiPassInputIterator >, boost::detail::edge_desc_impl, long int> >]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied >, boost::detail::edge_desc_impl, long int> > >::value’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied >, boost::detail::edge_desc_impl, long int> > >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_ >, boost::detail::edge_desc_impl, long int> >)>’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/graph_concepts.hpp:235:9: [ skipping 3 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/isomorphism.hpp:651:42: required from ‘bool boost::graph::detail::isomorphism_impl::operator()(const Graph1&, const Graph2&, const ArgPack&) const [with ArgPack = boost::parameter::aux::empty_arg_list; Graph1 = boost::adjacency_list; Graph2 = boost::adjacency_list]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/isomorphism.hpp:662:5: required from ‘typename boost::result_of(Param0, Param1, const ArgPack&)>::type boost::graph::isomorphism_with_named_params(const Param0&, const Param1&, const ArgPack&) [with Param0 = boost::adjacency_list; Param1 = boost::adjacency_list; ArgPack = boost::parameter::aux::empty_arg_list; typename boost::result_of(Param0, Param1, const ArgPack&)>::type = bool]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/isomorphism.hpp:666:1: required from ‘typename boost::result_of(Param0, Param1, const boost::parameter::aux::empty_arg_list&)>::type boost::isomorphism(const Param0&, const Param1&) [with Param0 = adjacency_list; Param1 = adjacency_list; typename result_of(Param0, Param1, const parameter::aux::empty_arg_list&)>::type = bool]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/is_kuratowski_subgraph.hpp:278:34: required from ‘bool boost::is_kuratowski_subgraph(const Graph&, ForwardIterator, ForwardIterator, VertexIndexMap) [with Graph = adjacency_list, property >; ForwardIterator = __gnu_cxx::__normal_iterator*, std::vector > >; VertexIndexMap = vec_adj_list_vertex_id_map, long unsigned int>]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/is_kuratowski_subgraph.hpp:290:34: required from ‘bool boost::is_kuratowski_subgraph(const Graph&, ForwardIterator, ForwardIterator) [with Graph = adjacency_list, property >; ForwardIterator = __gnu_cxx::__normal_iterator*, std::vector > >]’ planar.cpp:435:37: required from here /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::concepts::MultiPassInputIterator >, boost::detail::edge_desc_impl, long int> >]’ 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ^ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::MultiPassInputIterator >, boost::detail::edge_desc_impl, long int> >]’: /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/graph_concepts.hpp:235:9: required from ‘boost::concepts::EdgeListGraph::~EdgeListGraph() [with G = boost::adjacency_list]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/graph_concepts.hpp:226:1: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::EdgeListGraphConcept >]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/isomorphism.hpp:495:5: required from ‘bool boost::isomorphism(const Graph1&, const Graph2&, IsoMapping, Invariant1, Invariant2, std::size_t, IndexMap1, IndexMap2) [with Graph1 = adjacency_list; Graph2 = adjacency_list; IsoMapping = shared_array_property_map >; Invariant1 = degree_vertex_invariant >, adjacency_list >; Invariant2 = degree_vertex_invariant >, adjacency_list >; IndexMap1 = vec_adj_list_vertex_id_map; IndexMap2 = vec_adj_list_vertex_id_map; std::size_t = long unsigned int]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/isomorphism.hpp:651:42: required from ‘bool boost::graph::detail::isomorphism_impl::operator()(const Graph1&, const Graph2&, const ArgPack&) const [with ArgPack = boost::parameter::aux::empty_arg_list; Graph1 = boost::adjacency_list; Graph2 = boost::adjacency_list]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/isomorphism.hpp:662:5: required from ‘typename boost::result_of(Param0, Param1, const ArgPack&)>::type boost::graph::isomorphism_with_named_params(const Param0&, const Param1&, const ArgPack&) [with Param0 = boost::adjacency_list; Param1 = boost::adjacency_list; ArgPack = boost::parameter::aux::empty_arg_list; typename boost::result_of(Param0, Param1, const ArgPack&)>::type = bool]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/isomorphism.hpp:666:1: required from ‘typename boost::result_of(Param0, Param1, const boost::parameter::aux::empty_arg_list&)>::type boost::isomorphism(const Param0&, const Param1&) [with Param0 = adjacency_list; Param1 = adjacency_list; typename result_of(Param0, Param1, const parameter::aux::empty_arg_list&)>::type = bool]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/is_kuratowski_subgraph.hpp:278:34: required from ‘bool boost::is_kuratowski_subgraph(const Graph&, ForwardIterator, ForwardIterator, VertexIndexMap) [with Graph = adjacency_list, property >; ForwardIterator = __gnu_cxx::__normal_iterator*, std::vector > >; VertexIndexMap = vec_adj_list_vertex_id_map, long unsigned int>]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/is_kuratowski_subgraph.hpp:290:34: required from ‘bool boost::is_kuratowski_subgraph(const Graph&, ForwardIterator, ForwardIterator) [with Graph = adjacency_list, property >; ForwardIterator = __gnu_cxx::__normal_iterator*, std::vector > >]’ planar.cpp:435:37: required from here /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::concepts::MultiPassInputIterator::~MultiPassInputIterator() [with T = boost::detail::undirected_edge_iter >, boost::detail::edge_desc_impl, long int>]’ 37 | ~model() | ^ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/graph_concepts.hpp:52:50: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 52 | BOOST_concept(MultiPassInputIterator, (T)) { BOOST_CONCEPT_USAGE( | ^~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements > >]’: /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:137:5: required from ‘struct boost::DefaultConstructible >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::DefaultConstructible >]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied > >::value’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied > >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_ >)>’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/graph_concepts.hpp:90:9: [ skipping 3 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/isomorphism.hpp:651:42: required from ‘bool boost::graph::detail::isomorphism_impl::operator()(const Graph1&, const Graph2&, const ArgPack&) const [with ArgPack = boost::parameter::aux::empty_arg_list; Graph1 = boost::adjacency_list; Graph2 = boost::adjacency_list]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/isomorphism.hpp:662:5: required from ‘typename boost::result_of(Param0, Param1, const ArgPack&)>::type boost::graph::isomorphism_with_named_params(const Param0&, const Param1&, const ArgPack&) [with Param0 = boost::adjacency_list; Param1 = boost::adjacency_list; ArgPack = boost::parameter::aux::empty_arg_list; typename boost::result_of(Param0, Param1, const ArgPack&)>::type = bool]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/isomorphism.hpp:666:1: required from ‘typename boost::result_of(Param0, Param1, const boost::parameter::aux::empty_arg_list&)>::type boost::isomorphism(const Param0&, const Param1&) [with Param0 = adjacency_list; Param1 = adjacency_list; typename result_of(Param0, Param1, const parameter::aux::empty_arg_list&)>::type = bool]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/is_kuratowski_subgraph.hpp:278:34: required from ‘bool boost::is_kuratowski_subgraph(const Graph&, ForwardIterator, ForwardIterator, VertexIndexMap) [with Graph = adjacency_list, property >; ForwardIterator = __gnu_cxx::__normal_iterator*, std::vector > >; VertexIndexMap = vec_adj_list_vertex_id_map, long unsigned int>]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/is_kuratowski_subgraph.hpp:290:34: required from ‘bool boost::is_kuratowski_subgraph(const Graph&, ForwardIterator, ForwardIterator) [with Graph = adjacency_list, property >; ForwardIterator = __gnu_cxx::__normal_iterator*, std::vector > >]’ planar.cpp:435:37: required from here /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::DefaultConstructible >]’ 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ^ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::DefaultConstructible >]’: /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/graph_concepts.hpp:90:9: required from ‘boost::concepts::EdgeListGraph::~EdgeListGraph() [with G = boost::adjacency_list]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/graph_concepts.hpp:226:1: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::EdgeListGraphConcept >]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/isomorphism.hpp:495:5: required from ‘bool boost::isomorphism(const Graph1&, const Graph2&, IsoMapping, Invariant1, Invariant2, std::size_t, IndexMap1, IndexMap2) [with Graph1 = adjacency_list; Graph2 = adjacency_list; IsoMapping = shared_array_property_map >; Invariant1 = degree_vertex_invariant >, adjacency_list >; Invariant2 = degree_vertex_invariant >, adjacency_list >; IndexMap1 = vec_adj_list_vertex_id_map; IndexMap2 = vec_adj_list_vertex_id_map; std::size_t = long unsigned int]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/isomorphism.hpp:651:42: required from ‘bool boost::graph::detail::isomorphism_impl::operator()(const Graph1&, const Graph2&, const ArgPack&) const [with ArgPack = boost::parameter::aux::empty_arg_list; Graph1 = boost::adjacency_list; Graph2 = boost::adjacency_list]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/isomorphism.hpp:662:5: required from ‘typename boost::result_of(Param0, Param1, const ArgPack&)>::type boost::graph::isomorphism_with_named_params(const Param0&, const Param1&, const ArgPack&) [with Param0 = boost::adjacency_list; Param1 = boost::adjacency_list; ArgPack = boost::parameter::aux::empty_arg_list; typename boost::result_of(Param0, Param1, const ArgPack&)>::type = bool]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/isomorphism.hpp:666:1: required from ‘typename boost::result_of(Param0, Param1, const boost::parameter::aux::empty_arg_list&)>::type boost::isomorphism(const Param0&, const Param1&) [with Param0 = adjacency_list; Param1 = adjacency_list; typename result_of(Param0, Param1, const parameter::aux::empty_arg_list&)>::type = bool]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/is_kuratowski_subgraph.hpp:278:34: required from ‘bool boost::is_kuratowski_subgraph(const Graph&, ForwardIterator, ForwardIterator, VertexIndexMap) [with Graph = adjacency_list, property >; ForwardIterator = __gnu_cxx::__normal_iterator*, std::vector > >; VertexIndexMap = vec_adj_list_vertex_id_map, long unsigned int>]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/is_kuratowski_subgraph.hpp:290:34: required from ‘bool boost::is_kuratowski_subgraph(const Graph&, ForwardIterator, ForwardIterator) [with Graph = adjacency_list, property >; ForwardIterator = __gnu_cxx::__normal_iterator*, std::vector > >]’ planar.cpp:435:37: required from here /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::DefaultConstructible::~DefaultConstructible() [with TT = boost::detail::edge_desc_impl]’ 37 | ~model() | ^ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:137:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 137 | BOOST_CONCEPT_USAGE(DefaultConstructible) { | ^~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements > >]’: /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:233:5: required from ‘struct boost::EqualityComparable >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::EqualityComparable >]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied > >::value’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied > >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_ >)>’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/graph_concepts.hpp:91:9: [ skipping 3 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/isomorphism.hpp:651:42: required from ‘bool boost::graph::detail::isomorphism_impl::operator()(const Graph1&, const Graph2&, const ArgPack&) const [with ArgPack = boost::parameter::aux::empty_arg_list; Graph1 = boost::adjacency_list; Graph2 = boost::adjacency_list]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/isomorphism.hpp:662:5: required from ‘typename boost::result_of(Param0, Param1, const ArgPack&)>::type boost::graph::isomorphism_with_named_params(const Param0&, const Param1&, const ArgPack&) [with Param0 = boost::adjacency_list; Param1 = boost::adjacency_list; ArgPack = boost::parameter::aux::empty_arg_list; typename boost::result_of(Param0, Param1, const ArgPack&)>::type = bool]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/isomorphism.hpp:666:1: required from ‘typename boost::result_of(Param0, Param1, const boost::parameter::aux::empty_arg_list&)>::type boost::isomorphism(const Param0&, const Param1&) [with Param0 = adjacency_list; Param1 = adjacency_list; typename result_of(Param0, Param1, const parameter::aux::empty_arg_list&)>::type = bool]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/is_kuratowski_subgraph.hpp:278:34: required from ‘bool boost::is_kuratowski_subgraph(const Graph&, ForwardIterator, ForwardIterator, VertexIndexMap) [with Graph = adjacency_list, property >; ForwardIterator = __gnu_cxx::__normal_iterator*, std::vector > >; VertexIndexMap = vec_adj_list_vertex_id_map, long unsigned int>]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/is_kuratowski_subgraph.hpp:290:34: required from ‘bool boost::is_kuratowski_subgraph(const Graph&, ForwardIterator, ForwardIterator) [with Graph = adjacency_list, property >; ForwardIterator = __gnu_cxx::__normal_iterator*, std::vector > >]’ planar.cpp:435:37: required from here /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::EqualityComparable >]’ 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ^ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::EqualityComparable >]’: /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/graph_concepts.hpp:91:9: required from ‘boost::concepts::EdgeListGraph::~EdgeListGraph() [with G = boost::adjacency_list]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/graph_concepts.hpp:226:1: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::EdgeListGraphConcept >]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/isomorphism.hpp:495:5: required from ‘bool boost::isomorphism(const Graph1&, const Graph2&, IsoMapping, Invariant1, Invariant2, std::size_t, IndexMap1, IndexMap2) [with Graph1 = adjacency_list; Graph2 = adjacency_list; IsoMapping = shared_array_property_map >; Invariant1 = degree_vertex_invariant >, adjacency_list >; Invariant2 = degree_vertex_invariant >, adjacency_list >; IndexMap1 = vec_adj_list_vertex_id_map; IndexMap2 = vec_adj_list_vertex_id_map; std::size_t = long unsigned int]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/isomorphism.hpp:651:42: required from ‘bool boost::graph::detail::isomorphism_impl::operator()(const Graph1&, const Graph2&, const ArgPack&) const [with ArgPack = boost::parameter::aux::empty_arg_list; Graph1 = boost::adjacency_list; Graph2 = boost::adjacency_list]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/isomorphism.hpp:662:5: required from ‘typename boost::result_of(Param0, Param1, const ArgPack&)>::type boost::graph::isomorphism_with_named_params(const Param0&, const Param1&, const ArgPack&) [with Param0 = boost::adjacency_list; Param1 = boost::adjacency_list; ArgPack = boost::parameter::aux::empty_arg_list; typename boost::result_of(Param0, Param1, const ArgPack&)>::type = bool]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/isomorphism.hpp:666:1: required from ‘typename boost::result_of(Param0, Param1, const boost::parameter::aux::empty_arg_list&)>::type boost::isomorphism(const Param0&, const Param1&) [with Param0 = adjacency_list; Param1 = adjacency_list; typename result_of(Param0, Param1, const parameter::aux::empty_arg_list&)>::type = bool]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/is_kuratowski_subgraph.hpp:278:34: required from ‘bool boost::is_kuratowski_subgraph(const Graph&, ForwardIterator, ForwardIterator, VertexIndexMap) [with Graph = adjacency_list, property >; ForwardIterator = __gnu_cxx::__normal_iterator*, std::vector > >; VertexIndexMap = vec_adj_list_vertex_id_map, long unsigned int>]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/is_kuratowski_subgraph.hpp:290:34: required from ‘bool boost::is_kuratowski_subgraph(const Graph&, ForwardIterator, ForwardIterator) [with Graph = adjacency_list, property >; ForwardIterator = __gnu_cxx::__normal_iterator*, std::vector > >]’ planar.cpp:435:37: required from here /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::EqualityComparable::~EqualityComparable() [with TT = boost::detail::edge_desc_impl]’ 37 | ~model() | ^ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:233:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 233 | BOOST_CONCEPT_USAGE(EqualityComparable) { | ^~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements > >]’: /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:145:5: required from ‘struct boost::Assignable >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::Assignable >]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied > >::value’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied > >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_ >)>’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/graph_concepts.hpp:92:9: [ skipping 3 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/isomorphism.hpp:651:42: required from ‘bool boost::graph::detail::isomorphism_impl::operator()(const Graph1&, const Graph2&, const ArgPack&) const [with ArgPack = boost::parameter::aux::empty_arg_list; Graph1 = boost::adjacency_list; Graph2 = boost::adjacency_list]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/isomorphism.hpp:662:5: required from ‘typename boost::result_of(Param0, Param1, const ArgPack&)>::type boost::graph::isomorphism_with_named_params(const Param0&, const Param1&, const ArgPack&) [with Param0 = boost::adjacency_list; Param1 = boost::adjacency_list; ArgPack = boost::parameter::aux::empty_arg_list; typename boost::result_of(Param0, Param1, const ArgPack&)>::type = bool]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/isomorphism.hpp:666:1: required from ‘typename boost::result_of(Param0, Param1, const boost::parameter::aux::empty_arg_list&)>::type boost::isomorphism(const Param0&, const Param1&) [with Param0 = adjacency_list; Param1 = adjacency_list; typename result_of(Param0, Param1, const parameter::aux::empty_arg_list&)>::type = bool]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/is_kuratowski_subgraph.hpp:278:34: required from ‘bool boost::is_kuratowski_subgraph(const Graph&, ForwardIterator, ForwardIterator, VertexIndexMap) [with Graph = adjacency_list, property >; ForwardIterator = __gnu_cxx::__normal_iterator*, std::vector > >; VertexIndexMap = vec_adj_list_vertex_id_map, long unsigned int>]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/is_kuratowski_subgraph.hpp:290:34: required from ‘bool boost::is_kuratowski_subgraph(const Graph&, ForwardIterator, ForwardIterator) [with Graph = adjacency_list, property >; ForwardIterator = __gnu_cxx::__normal_iterator*, std::vector > >]’ planar.cpp:435:37: required from here /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::Assignable >]’ 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ^ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::Assignable >]’: /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/graph_concepts.hpp:92:9: required from ‘boost::concepts::EdgeListGraph::~EdgeListGraph() [with G = boost::adjacency_list]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/graph_concepts.hpp:226:1: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::EdgeListGraphConcept >]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/isomorphism.hpp:495:5: required from ‘bool boost::isomorphism(const Graph1&, const Graph2&, IsoMapping, Invariant1, Invariant2, std::size_t, IndexMap1, IndexMap2) [with Graph1 = adjacency_list; Graph2 = adjacency_list; IsoMapping = shared_array_property_map >; Invariant1 = degree_vertex_invariant >, adjacency_list >; Invariant2 = degree_vertex_invariant >, adjacency_list >; IndexMap1 = vec_adj_list_vertex_id_map; IndexMap2 = vec_adj_list_vertex_id_map; std::size_t = long unsigned int]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/isomorphism.hpp:651:42: required from ‘bool boost::graph::detail::isomorphism_impl::operator()(const Graph1&, const Graph2&, const ArgPack&) const [with ArgPack = boost::parameter::aux::empty_arg_list; Graph1 = boost::adjacency_list; Graph2 = boost::adjacency_list]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/isomorphism.hpp:662:5: required from ‘typename boost::result_of(Param0, Param1, const ArgPack&)>::type boost::graph::isomorphism_with_named_params(const Param0&, const Param1&, const ArgPack&) [with Param0 = boost::adjacency_list; Param1 = boost::adjacency_list; ArgPack = boost::parameter::aux::empty_arg_list; typename boost::result_of(Param0, Param1, const ArgPack&)>::type = bool]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/isomorphism.hpp:666:1: required from ‘typename boost::result_of(Param0, Param1, const boost::parameter::aux::empty_arg_list&)>::type boost::isomorphism(const Param0&, const Param1&) [with Param0 = adjacency_list; Param1 = adjacency_list; typename result_of(Param0, Param1, const parameter::aux::empty_arg_list&)>::type = bool]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/is_kuratowski_subgraph.hpp:278:34: required from ‘bool boost::is_kuratowski_subgraph(const Graph&, ForwardIterator, ForwardIterator, VertexIndexMap) [with Graph = adjacency_list, property >; ForwardIterator = __gnu_cxx::__normal_iterator*, std::vector > >; VertexIndexMap = vec_adj_list_vertex_id_map, long unsigned int>]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/is_kuratowski_subgraph.hpp:290:34: required from ‘bool boost::is_kuratowski_subgraph(const Graph&, ForwardIterator, ForwardIterator) [with Graph = adjacency_list, property >; ForwardIterator = __gnu_cxx::__normal_iterator*, std::vector > >]’ planar.cpp:435:37: required from here /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::Assignable::~Assignable() [with TT = boost::detail::edge_desc_impl]’ 37 | ~model() | ^ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:145:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 145 | BOOST_CONCEPT_USAGE(Assignable) { | ^~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements >]’: /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:208:5: required from ‘struct boost::Convertible’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::Convertible]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied >::value’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_)>’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/graph_concepts.hpp:239:9: [ skipping 3 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/isomorphism.hpp:651:42: required from ‘bool boost::graph::detail::isomorphism_impl::operator()(const Graph1&, const Graph2&, const ArgPack&) const [with ArgPack = boost::parameter::aux::empty_arg_list; Graph1 = boost::adjacency_list; Graph2 = boost::adjacency_list]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/isomorphism.hpp:662:5: required from ‘typename boost::result_of(Param0, Param1, const ArgPack&)>::type boost::graph::isomorphism_with_named_params(const Param0&, const Param1&, const ArgPack&) [with Param0 = boost::adjacency_list; Param1 = boost::adjacency_list; ArgPack = boost::parameter::aux::empty_arg_list; typename boost::result_of(Param0, Param1, const ArgPack&)>::type = bool]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/isomorphism.hpp:666:1: required from ‘typename boost::result_of(Param0, Param1, const boost::parameter::aux::empty_arg_list&)>::type boost::isomorphism(const Param0&, const Param1&) [with Param0 = adjacency_list; Param1 = adjacency_list; typename result_of(Param0, Param1, const parameter::aux::empty_arg_list&)>::type = bool]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/is_kuratowski_subgraph.hpp:278:34: required from ‘bool boost::is_kuratowski_subgraph(const Graph&, ForwardIterator, ForwardIterator, VertexIndexMap) [with Graph = adjacency_list, property >; ForwardIterator = __gnu_cxx::__normal_iterator*, std::vector > >; VertexIndexMap = vec_adj_list_vertex_id_map, long unsigned int>]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/is_kuratowski_subgraph.hpp:290:34: required from ‘bool boost::is_kuratowski_subgraph(const Graph&, ForwardIterator, ForwardIterator) [with Graph = adjacency_list, property >; ForwardIterator = __gnu_cxx::__normal_iterator*, std::vector > >]’ planar.cpp:435:37: required from here /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::Convertible]’ 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ^ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::Convertible]’: /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/graph_concepts.hpp:239:9: required from ‘boost::concepts::EdgeListGraph::~EdgeListGraph() [with G = boost::adjacency_list]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/graph_concepts.hpp:226:1: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::EdgeListGraphConcept >]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/isomorphism.hpp:495:5: required from ‘bool boost::isomorphism(const Graph1&, const Graph2&, IsoMapping, Invariant1, Invariant2, std::size_t, IndexMap1, IndexMap2) [with Graph1 = adjacency_list; Graph2 = adjacency_list; IsoMapping = shared_array_property_map >; Invariant1 = degree_vertex_invariant >, adjacency_list >; Invariant2 = degree_vertex_invariant >, adjacency_list >; IndexMap1 = vec_adj_list_vertex_id_map; IndexMap2 = vec_adj_list_vertex_id_map; std::size_t = long unsigned int]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/isomorphism.hpp:651:42: required from ‘bool boost::graph::detail::isomorphism_impl::operator()(const Graph1&, const Graph2&, const ArgPack&) const [with ArgPack = boost::parameter::aux::empty_arg_list; Graph1 = boost::adjacency_list; Graph2 = boost::adjacency_list]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/isomorphism.hpp:662:5: required from ‘typename boost::result_of(Param0, Param1, const ArgPack&)>::type boost::graph::isomorphism_with_named_params(const Param0&, const Param1&, const ArgPack&) [with Param0 = boost::adjacency_list; Param1 = boost::adjacency_list; ArgPack = boost::parameter::aux::empty_arg_list; typename boost::result_of(Param0, Param1, const ArgPack&)>::type = bool]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/isomorphism.hpp:666:1: required from ‘typename boost::result_of(Param0, Param1, const boost::parameter::aux::empty_arg_list&)>::type boost::isomorphism(const Param0&, const Param1&) [with Param0 = adjacency_list; Param1 = adjacency_list; typename result_of(Param0, Param1, const parameter::aux::empty_arg_list&)>::type = bool]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/is_kuratowski_subgraph.hpp:278:34: required from ‘bool boost::is_kuratowski_subgraph(const Graph&, ForwardIterator, ForwardIterator, VertexIndexMap) [with Graph = adjacency_list, property >; ForwardIterator = __gnu_cxx::__normal_iterator*, std::vector > >; VertexIndexMap = vec_adj_list_vertex_id_map, long unsigned int>]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/is_kuratowski_subgraph.hpp:290:34: required from ‘bool boost::is_kuratowski_subgraph(const Graph&, ForwardIterator, ForwardIterator) [with Graph = adjacency_list, property >; ForwardIterator = __gnu_cxx::__normal_iterator*, std::vector > >]’ planar.cpp:435:37: required from here /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::Convertible::~Convertible() [with X = boost::undir_adj_list_traversal_tag; Y = boost::edge_list_graph_tag]’ 37 | ~model() | ^ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:208:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 208 | BOOST_CONCEPT_USAGE(Convertible) { | ^~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements >]’: /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:208:5: required from ‘struct boost::Convertible’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::Convertible]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied >::value’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_)>’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:450:11: [ skipping 3 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/isomorphism.hpp:651:42: required from ‘bool boost::graph::detail::isomorphism_impl::operator()(const Graph1&, const Graph2&, const ArgPack&) const [with ArgPack = boost::parameter::aux::empty_arg_list; Graph1 = boost::adjacency_list; Graph2 = boost::adjacency_list]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/isomorphism.hpp:662:5: required from ‘typename boost::result_of(Param0, Param1, const ArgPack&)>::type boost::graph::isomorphism_with_named_params(const Param0&, const Param1&, const ArgPack&) [with Param0 = boost::adjacency_list; Param1 = boost::adjacency_list; ArgPack = boost::parameter::aux::empty_arg_list; typename boost::result_of(Param0, Param1, const ArgPack&)>::type = bool]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/isomorphism.hpp:666:1: required from ‘typename boost::result_of(Param0, Param1, const boost::parameter::aux::empty_arg_list&)>::type boost::isomorphism(const Param0&, const Param1&) [with Param0 = adjacency_list; Param1 = adjacency_list; typename result_of(Param0, Param1, const parameter::aux::empty_arg_list&)>::type = bool]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/is_kuratowski_subgraph.hpp:278:34: required from ‘bool boost::is_kuratowski_subgraph(const Graph&, ForwardIterator, ForwardIterator, VertexIndexMap) [with Graph = adjacency_list, property >; ForwardIterator = __gnu_cxx::__normal_iterator*, std::vector > >; VertexIndexMap = vec_adj_list_vertex_id_map, long unsigned int>]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/is_kuratowski_subgraph.hpp:290:34: required from ‘bool boost::is_kuratowski_subgraph(const Graph&, ForwardIterator, ForwardIterator) [with Graph = adjacency_list, property >; ForwardIterator = __gnu_cxx::__normal_iterator*, std::vector > >]’ planar.cpp:435:37: required from here /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::Convertible]’ 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ^ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::Convertible]’: /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:450:11: required from ‘boost::AdaptableUnaryFunction::~AdaptableUnaryFunction() [with Func = boost::degree_vertex_invariant >, boost::adjacency_list >; Return = long unsigned int; Arg = long unsigned int]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:454:3: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::AdaptableUnaryFunctionConcept >, boost::adjacency_list >, long unsigned int, long unsigned int>]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/isomorphism.hpp:504:5: required from ‘bool boost::isomorphism(const Graph1&, const Graph2&, IsoMapping, Invariant1, Invariant2, std::size_t, IndexMap1, IndexMap2) [with Graph1 = adjacency_list; Graph2 = adjacency_list; IsoMapping = shared_array_property_map >; Invariant1 = degree_vertex_invariant >, adjacency_list >; Invariant2 = degree_vertex_invariant >, adjacency_list >; IndexMap1 = vec_adj_list_vertex_id_map; IndexMap2 = vec_adj_list_vertex_id_map; std::size_t = long unsigned int]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/isomorphism.hpp:651:42: required from ‘bool boost::graph::detail::isomorphism_impl::operator()(const Graph1&, const Graph2&, const ArgPack&) const [with ArgPack = boost::parameter::aux::empty_arg_list; Graph1 = boost::adjacency_list; Graph2 = boost::adjacency_list]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/isomorphism.hpp:662:5: required from ‘typename boost::result_of(Param0, Param1, const ArgPack&)>::type boost::graph::isomorphism_with_named_params(const Param0&, const Param1&, const ArgPack&) [with Param0 = boost::adjacency_list; Param1 = boost::adjacency_list; ArgPack = boost::parameter::aux::empty_arg_list; typename boost::result_of(Param0, Param1, const ArgPack&)>::type = bool]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/isomorphism.hpp:666:1: required from ‘typename boost::result_of(Param0, Param1, const boost::parameter::aux::empty_arg_list&)>::type boost::isomorphism(const Param0&, const Param1&) [with Param0 = adjacency_list; Param1 = adjacency_list; typename result_of(Param0, Param1, const parameter::aux::empty_arg_list&)>::type = bool]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/is_kuratowski_subgraph.hpp:278:34: required from ‘bool boost::is_kuratowski_subgraph(const Graph&, ForwardIterator, ForwardIterator, VertexIndexMap) [with Graph = adjacency_list, property >; ForwardIterator = __gnu_cxx::__normal_iterator*, std::vector > >; VertexIndexMap = vec_adj_list_vertex_id_map, long unsigned int>]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/is_kuratowski_subgraph.hpp:290:34: required from ‘bool boost::is_kuratowski_subgraph(const Graph&, ForwardIterator, ForwardIterator) [with Graph = adjacency_list, property >; ForwardIterator = __gnu_cxx::__normal_iterator*, std::vector > >]’ planar.cpp:435:37: required from here /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::Convertible::~Convertible() [with X = long unsigned int; Y = long unsigned int]’ 37 | ~model() | ^ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:208:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 208 | BOOST_CONCEPT_USAGE(Convertible) { | ^~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements >]’: /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:208:5: required from ‘struct boost::Convertible’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:206:3: required from ‘struct boost::ConvertibleConcept’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::ConvertibleConcept]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied >::value’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:72:8: [ skipping 12 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/isomorphism.hpp:651:42: required from ‘bool boost::graph::detail::isomorphism_impl::operator()(const Graph1&, const Graph2&, const ArgPack&) const [with ArgPack = boost::parameter::aux::empty_arg_list; Graph1 = boost::adjacency_list; Graph2 = boost::adjacency_list]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/isomorphism.hpp:662:5: required from ‘typename boost::result_of(Param0, Param1, const ArgPack&)>::type boost::graph::isomorphism_with_named_params(const Param0&, const Param1&, const ArgPack&) [with Param0 = boost::adjacency_list; Param1 = boost::adjacency_list; ArgPack = boost::parameter::aux::empty_arg_list; typename boost::result_of(Param0, Param1, const ArgPack&)>::type = bool]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/isomorphism.hpp:666:1: required from ‘typename boost::result_of(Param0, Param1, const boost::parameter::aux::empty_arg_list&)>::type boost::isomorphism(const Param0&, const Param1&) [with Param0 = adjacency_list; Param1 = adjacency_list; typename result_of(Param0, Param1, const parameter::aux::empty_arg_list&)>::type = bool]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/is_kuratowski_subgraph.hpp:278:34: required from ‘bool boost::is_kuratowski_subgraph(const Graph&, ForwardIterator, ForwardIterator, VertexIndexMap) [with Graph = adjacency_list, property >; ForwardIterator = __gnu_cxx::__normal_iterator*, std::vector > >; VertexIndexMap = vec_adj_list_vertex_id_map, long unsigned int>]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/is_kuratowski_subgraph.hpp:290:34: required from ‘bool boost::is_kuratowski_subgraph(const Graph&, ForwardIterator, ForwardIterator) [with Graph = adjacency_list, property >; ForwardIterator = __gnu_cxx::__normal_iterator*, std::vector > >]’ planar.cpp:435:37: required from here /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::Convertible]’ 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ^ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::ConvertibleConcept]’: /home/omnipath/local/R/4.4-3.20/BH/include/boost/property_map/property_map.hpp:148:7: required from ‘void boost::ReadablePropertyMapConcept::constraints() [with PMap = boost::shared_array_property_map >; Key = long unsigned int]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::ReadablePropertyMapConcept >, long unsigned int>]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied >, long unsigned int> >::value’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied >, long unsigned int> >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_ >, long unsigned int>)>’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/property_map/property_map.hpp:206:7: [ skipping 6 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/isomorphism.hpp:651:42: required from ‘bool boost::graph::detail::isomorphism_impl::operator()(const Graph1&, const Graph2&, const ArgPack&) const [with ArgPack = boost::parameter::aux::empty_arg_list; Graph1 = boost::adjacency_list; Graph2 = boost::adjacency_list]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/isomorphism.hpp:662:5: required from ‘typename boost::result_of(Param0, Param1, const ArgPack&)>::type boost::graph::isomorphism_with_named_params(const Param0&, const Param1&, const ArgPack&) [with Param0 = boost::adjacency_list; Param1 = boost::adjacency_list; ArgPack = boost::parameter::aux::empty_arg_list; typename boost::result_of(Param0, Param1, const ArgPack&)>::type = bool]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/isomorphism.hpp:666:1: required from ‘typename boost::result_of(Param0, Param1, const boost::parameter::aux::empty_arg_list&)>::type boost::isomorphism(const Param0&, const Param1&) [with Param0 = adjacency_list; Param1 = adjacency_list; typename result_of(Param0, Param1, const parameter::aux::empty_arg_list&)>::type = bool]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/is_kuratowski_subgraph.hpp:278:34: required from ‘bool boost::is_kuratowski_subgraph(const Graph&, ForwardIterator, ForwardIterator, VertexIndexMap) [with Graph = adjacency_list, property >; ForwardIterator = __gnu_cxx::__normal_iterator*, std::vector > >; VertexIndexMap = vec_adj_list_vertex_id_map, long unsigned int>]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/is_kuratowski_subgraph.hpp:290:34: required from ‘bool boost::is_kuratowski_subgraph(const Graph&, ForwardIterator, ForwardIterator) [with Graph = adjacency_list, property >; ForwardIterator = __gnu_cxx::__normal_iterator*, std::vector > >]’ planar.cpp:435:37: required from here /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:206:17: note: in a call to non-static member function ‘boost::ConvertibleConcept::~ConvertibleConcept()’ 206 | BOOST_concept(Convertible,(X)(Y)) | ^~~~~~~~~~~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/preprocessor/cat.hpp:29:34: note: in definition of macro ‘BOOST_PP_CAT_I’ 29 | # define BOOST_PP_CAT_I(a, b) a ## b | ^ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/concept_def.hpp:23:12: note: in expansion of macro ‘BOOST_PP_CAT’ 23 | struct BOOST_PP_CAT(name,Concept) \ | ^~~~~~~~~~~~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:206:3: note: in expansion of macro ‘BOOST_concept’ 206 | BOOST_concept(Convertible,(X)(Y)) | ^~~~~~~~~~~~~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::Convertible]’: /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements >]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:208:5: required from ‘struct boost::Convertible’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:206:3: required from ‘struct boost::ConvertibleConcept’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::ConvertibleConcept]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied >::value’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:45:51: [ skipping 8 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/isomorphism.hpp:651:42: required from ‘bool boost::graph::detail::isomorphism_impl::operator()(const Graph1&, const Graph2&, const ArgPack&) const [with ArgPack = boost::parameter::aux::empty_arg_list; Graph1 = boost::adjacency_list; Graph2 = boost::adjacency_list]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/isomorphism.hpp:662:5: required from ‘typename boost::result_of(Param0, Param1, const ArgPack&)>::type boost::graph::isomorphism_with_named_params(const Param0&, const Param1&, const ArgPack&) [with Param0 = boost::adjacency_list; Param1 = boost::adjacency_list; ArgPack = boost::parameter::aux::empty_arg_list; typename boost::result_of(Param0, Param1, const ArgPack&)>::type = bool]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/isomorphism.hpp:666:1: required from ‘typename boost::result_of(Param0, Param1, const boost::parameter::aux::empty_arg_list&)>::type boost::isomorphism(const Param0&, const Param1&) [with Param0 = adjacency_list; Param1 = adjacency_list; typename result_of(Param0, Param1, const parameter::aux::empty_arg_list&)>::type = bool]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/is_kuratowski_subgraph.hpp:278:34: required from ‘bool boost::is_kuratowski_subgraph(const Graph&, ForwardIterator, ForwardIterator, VertexIndexMap) [with Graph = adjacency_list, property >; ForwardIterator = __gnu_cxx::__normal_iterator*, std::vector > >; VertexIndexMap = vec_adj_list_vertex_id_map, long unsigned int>]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/is_kuratowski_subgraph.hpp:290:34: required from ‘bool boost::is_kuratowski_subgraph(const Graph&, ForwardIterator, ForwardIterator) [with Graph = adjacency_list, property >; ForwardIterator = __gnu_cxx::__normal_iterator*, std::vector > >]’ planar.cpp:435:37: required from here /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::Convertible::~Convertible() [with X = boost::lvalue_property_map_tag; Y = boost::read_write_property_map_tag]’ 37 | ~model() | ^ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:208:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 208 | BOOST_CONCEPT_USAGE(Convertible) { | ^~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::Convertible]’: /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements >]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:208:5: required from ‘struct boost::Convertible’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:206:3: required from ‘struct boost::ConvertibleConcept’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::ConvertibleConcept]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied >::value’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:45:51: [ skipping 8 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/isomorphism.hpp:651:42: required from ‘bool boost::graph::detail::isomorphism_impl::operator()(const Graph1&, const Graph2&, const ArgPack&) const [with ArgPack = boost::parameter::aux::empty_arg_list; Graph1 = boost::adjacency_list; Graph2 = boost::adjacency_list]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/isomorphism.hpp:662:5: required from ‘typename boost::result_of(Param0, Param1, const ArgPack&)>::type boost::graph::isomorphism_with_named_params(const Param0&, const Param1&, const ArgPack&) [with Param0 = boost::adjacency_list; Param1 = boost::adjacency_list; ArgPack = boost::parameter::aux::empty_arg_list; typename boost::result_of(Param0, Param1, const ArgPack&)>::type = bool]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/isomorphism.hpp:666:1: required from ‘typename boost::result_of(Param0, Param1, const boost::parameter::aux::empty_arg_list&)>::type boost::isomorphism(const Param0&, const Param1&) [with Param0 = adjacency_list; Param1 = adjacency_list; typename result_of(Param0, Param1, const parameter::aux::empty_arg_list&)>::type = bool]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/is_kuratowski_subgraph.hpp:278:34: required from ‘bool boost::is_kuratowski_subgraph(const Graph&, ForwardIterator, ForwardIterator, VertexIndexMap) [with Graph = adjacency_list, property >; ForwardIterator = __gnu_cxx::__normal_iterator*, std::vector > >; VertexIndexMap = vec_adj_list_vertex_id_map, long unsigned int>]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/is_kuratowski_subgraph.hpp:290:34: required from ‘bool boost::is_kuratowski_subgraph(const Graph&, ForwardIterator, ForwardIterator) [with Graph = adjacency_list, property >; ForwardIterator = __gnu_cxx::__normal_iterator*, std::vector > >]’ planar.cpp:435:37: required from here /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::Convertible::~Convertible() [with X = boost::readable_property_map_tag; Y = boost::readable_property_map_tag]’ 37 | ~model() | ^ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:208:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 208 | BOOST_CONCEPT_USAGE(Convertible) { | ^~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements > > >]’: /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:145:5: required from ‘struct boost::Assignable<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:502:3: required from ‘struct boost::InputIterator<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:540:3: required from ‘struct boost::ForwardIterator<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:568:3: required from ‘struct boost::BidirectionalIterator<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:597:3: required from ‘struct boost::RandomAccessIterator<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:597:3: [ skipping 8 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/isomorphism.hpp:651:42: required from ‘bool boost::graph::detail::isomorphism_impl::operator()(const Graph1&, const Graph2&, const ArgPack&) const [with ArgPack = boost::parameter::aux::empty_arg_list; Graph1 = boost::adjacency_list; Graph2 = boost::adjacency_list]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/isomorphism.hpp:662:5: required from ‘typename boost::result_of(Param0, Param1, const ArgPack&)>::type boost::graph::isomorphism_with_named_params(const Param0&, const Param1&, const ArgPack&) [with Param0 = boost::adjacency_list; Param1 = boost::adjacency_list; ArgPack = boost::parameter::aux::empty_arg_list; typename boost::result_of(Param0, Param1, const ArgPack&)>::type = bool]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/isomorphism.hpp:666:1: required from ‘typename boost::result_of(Param0, Param1, const boost::parameter::aux::empty_arg_list&)>::type boost::isomorphism(const Param0&, const Param1&) [with Param0 = adjacency_list; Param1 = adjacency_list; typename result_of(Param0, Param1, const parameter::aux::empty_arg_list&)>::type = bool]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/is_kuratowski_subgraph.hpp:278:34: required from ‘bool boost::is_kuratowski_subgraph(const Graph&, ForwardIterator, ForwardIterator, VertexIndexMap) [with Graph = adjacency_list, property >; ForwardIterator = __gnu_cxx::__normal_iterator*, std::vector > >; VertexIndexMap = vec_adj_list_vertex_id_map, long unsigned int>]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/is_kuratowski_subgraph.hpp:290:34: required from ‘bool boost::is_kuratowski_subgraph(const Graph&, ForwardIterator, ForwardIterator) [with Graph = adjacency_list, property >; ForwardIterator = __gnu_cxx::__normal_iterator*, std::vector > >]’ planar.cpp:435:37: required from here /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::Assignable<__gnu_cxx::__normal_iterator > >]’ 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ^ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements > > >]’: /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:233:5: required from ‘struct boost::EqualityComparable<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:502:3: required from ‘struct boost::InputIterator<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:540:3: required from ‘struct boost::ForwardIterator<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:568:3: required from ‘struct boost::BidirectionalIterator<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:597:3: required from ‘struct boost::RandomAccessIterator<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:597:3: [ skipping 8 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/isomorphism.hpp:651:42: required from ‘bool boost::graph::detail::isomorphism_impl::operator()(const Graph1&, const Graph2&, const ArgPack&) const [with ArgPack = boost::parameter::aux::empty_arg_list; Graph1 = boost::adjacency_list; Graph2 = boost::adjacency_list]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/isomorphism.hpp:662:5: required from ‘typename boost::result_of(Param0, Param1, const ArgPack&)>::type boost::graph::isomorphism_with_named_params(const Param0&, const Param1&, const ArgPack&) [with Param0 = boost::adjacency_list; Param1 = boost::adjacency_list; ArgPack = boost::parameter::aux::empty_arg_list; typename boost::result_of(Param0, Param1, const ArgPack&)>::type = bool]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/isomorphism.hpp:666:1: required from ‘typename boost::result_of(Param0, Param1, const boost::parameter::aux::empty_arg_list&)>::type boost::isomorphism(const Param0&, const Param1&) [with Param0 = adjacency_list; Param1 = adjacency_list; typename result_of(Param0, Param1, const parameter::aux::empty_arg_list&)>::type = bool]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/is_kuratowski_subgraph.hpp:278:34: required from ‘bool boost::is_kuratowski_subgraph(const Graph&, ForwardIterator, ForwardIterator, VertexIndexMap) [with Graph = adjacency_list, property >; ForwardIterator = __gnu_cxx::__normal_iterator*, std::vector > >; VertexIndexMap = vec_adj_list_vertex_id_map, long unsigned int>]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/is_kuratowski_subgraph.hpp:290:34: required from ‘bool boost::is_kuratowski_subgraph(const Graph&, ForwardIterator, ForwardIterator) [with Graph = adjacency_list, property >; ForwardIterator = __gnu_cxx::__normal_iterator*, std::vector > >]’ planar.cpp:435:37: required from here /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::EqualityComparable<__gnu_cxx::__normal_iterator > >]’ 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ^ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements > > >]’: /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:512:7: required from ‘struct boost::InputIterator<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:540:3: required from ‘struct boost::ForwardIterator<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:568:3: required from ‘struct boost::BidirectionalIterator<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:597:3: required from ‘struct boost::RandomAccessIterator<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:597:3: required from ‘struct boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:32:62: [ skipping 7 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/isomorphism.hpp:651:42: required from ‘bool boost::graph::detail::isomorphism_impl::operator()(const Graph1&, const Graph2&, const ArgPack&) const [with ArgPack = boost::parameter::aux::empty_arg_list; Graph1 = boost::adjacency_list; Graph2 = boost::adjacency_list]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/isomorphism.hpp:662:5: required from ‘typename boost::result_of(Param0, Param1, const ArgPack&)>::type boost::graph::isomorphism_with_named_params(const Param0&, const Param1&, const ArgPack&) [with Param0 = boost::adjacency_list; Param1 = boost::adjacency_list; ArgPack = boost::parameter::aux::empty_arg_list; typename boost::result_of(Param0, Param1, const ArgPack&)>::type = bool]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/isomorphism.hpp:666:1: required from ‘typename boost::result_of(Param0, Param1, const boost::parameter::aux::empty_arg_list&)>::type boost::isomorphism(const Param0&, const Param1&) [with Param0 = adjacency_list; Param1 = adjacency_list; typename result_of(Param0, Param1, const parameter::aux::empty_arg_list&)>::type = bool]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/is_kuratowski_subgraph.hpp:278:34: required from ‘bool boost::is_kuratowski_subgraph(const Graph&, ForwardIterator, ForwardIterator, VertexIndexMap) [with Graph = adjacency_list, property >; ForwardIterator = __gnu_cxx::__normal_iterator*, std::vector > >; VertexIndexMap = vec_adj_list_vertex_id_map, long unsigned int>]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/is_kuratowski_subgraph.hpp:290:34: required from ‘bool boost::is_kuratowski_subgraph(const Graph&, ForwardIterator, ForwardIterator) [with Graph = adjacency_list, property >; ForwardIterator = __gnu_cxx::__normal_iterator*, std::vector > >]’ planar.cpp:435:37: required from here /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::InputIterator<__gnu_cxx::__normal_iterator > >]’ 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ^ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements > > >]’: /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:543:7: required from ‘struct boost::ForwardIterator<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:568:3: required from ‘struct boost::BidirectionalIterator<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:597:3: required from ‘struct boost::RandomAccessIterator<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:597:3: required from ‘struct boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator > >]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:42:5: [ skipping 6 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/isomorphism.hpp:651:42: required from ‘bool boost::graph::detail::isomorphism_impl::operator()(const Graph1&, const Graph2&, const ArgPack&) const [with ArgPack = boost::parameter::aux::empty_arg_list; Graph1 = boost::adjacency_list; Graph2 = boost::adjacency_list]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/isomorphism.hpp:662:5: required from ‘typename boost::result_of(Param0, Param1, const ArgPack&)>::type boost::graph::isomorphism_with_named_params(const Param0&, const Param1&, const ArgPack&) [with Param0 = boost::adjacency_list; Param1 = boost::adjacency_list; ArgPack = boost::parameter::aux::empty_arg_list; typename boost::result_of(Param0, Param1, const ArgPack&)>::type = bool]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/isomorphism.hpp:666:1: required from ‘typename boost::result_of(Param0, Param1, const boost::parameter::aux::empty_arg_list&)>::type boost::isomorphism(const Param0&, const Param1&) [with Param0 = adjacency_list; Param1 = adjacency_list; typename result_of(Param0, Param1, const parameter::aux::empty_arg_list&)>::type = bool]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/is_kuratowski_subgraph.hpp:278:34: required from ‘bool boost::is_kuratowski_subgraph(const Graph&, ForwardIterator, ForwardIterator, VertexIndexMap) [with Graph = adjacency_list, property >; ForwardIterator = __gnu_cxx::__normal_iterator*, std::vector > >; VertexIndexMap = vec_adj_list_vertex_id_map, long unsigned int>]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/is_kuratowski_subgraph.hpp:290:34: required from ‘bool boost::is_kuratowski_subgraph(const Graph&, ForwardIterator, ForwardIterator) [with Graph = adjacency_list, property >; ForwardIterator = __gnu_cxx::__normal_iterator*, std::vector > >]’ planar.cpp:435:37: required from here /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::ForwardIterator<__gnu_cxx::__normal_iterator > >]’ 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ^ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements > > >]’: /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:571:7: required from ‘struct boost::BidirectionalIterator<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:597:3: required from ‘struct boost::RandomAccessIterator<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:597:3: required from ‘struct boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator > >]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied > > >::value’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:45:51: [ skipping 5 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/isomorphism.hpp:651:42: required from ‘bool boost::graph::detail::isomorphism_impl::operator()(const Graph1&, const Graph2&, const ArgPack&) const [with ArgPack = boost::parameter::aux::empty_arg_list; Graph1 = boost::adjacency_list; Graph2 = boost::adjacency_list]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/isomorphism.hpp:662:5: required from ‘typename boost::result_of(Param0, Param1, const ArgPack&)>::type boost::graph::isomorphism_with_named_params(const Param0&, const Param1&, const ArgPack&) [with Param0 = boost::adjacency_list; Param1 = boost::adjacency_list; ArgPack = boost::parameter::aux::empty_arg_list; typename boost::result_of(Param0, Param1, const ArgPack&)>::type = bool]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/isomorphism.hpp:666:1: required from ‘typename boost::result_of(Param0, Param1, const boost::parameter::aux::empty_arg_list&)>::type boost::isomorphism(const Param0&, const Param1&) [with Param0 = adjacency_list; Param1 = adjacency_list; typename result_of(Param0, Param1, const parameter::aux::empty_arg_list&)>::type = bool]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/is_kuratowski_subgraph.hpp:278:34: required from ‘bool boost::is_kuratowski_subgraph(const Graph&, ForwardIterator, ForwardIterator, VertexIndexMap) [with Graph = adjacency_list, property >; ForwardIterator = __gnu_cxx::__normal_iterator*, std::vector > >; VertexIndexMap = vec_adj_list_vertex_id_map, long unsigned int>]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/is_kuratowski_subgraph.hpp:290:34: required from ‘bool boost::is_kuratowski_subgraph(const Graph&, ForwardIterator, ForwardIterator) [with Graph = adjacency_list, property >; ForwardIterator = __gnu_cxx::__normal_iterator*, std::vector > >]’ planar.cpp:435:37: required from here /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::BidirectionalIterator<__gnu_cxx::__normal_iterator > >]’ 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ^ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements > > >]’: /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:253:5: required from ‘struct boost::Comparable<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:597:3: required from ‘struct boost::RandomAccessIterator<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:597:3: required from ‘struct boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator > >]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied > > >::value’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:45:51: [ skipping 5 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/isomorphism.hpp:651:42: required from ‘bool boost::graph::detail::isomorphism_impl::operator()(const Graph1&, const Graph2&, const ArgPack&) const [with ArgPack = boost::parameter::aux::empty_arg_list; Graph1 = boost::adjacency_list; Graph2 = boost::adjacency_list]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/isomorphism.hpp:662:5: required from ‘typename boost::result_of(Param0, Param1, const ArgPack&)>::type boost::graph::isomorphism_with_named_params(const Param0&, const Param1&, const ArgPack&) [with Param0 = boost::adjacency_list; Param1 = boost::adjacency_list; ArgPack = boost::parameter::aux::empty_arg_list; typename boost::result_of(Param0, Param1, const ArgPack&)>::type = bool]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/isomorphism.hpp:666:1: required from ‘typename boost::result_of(Param0, Param1, const boost::parameter::aux::empty_arg_list&)>::type boost::isomorphism(const Param0&, const Param1&) [with Param0 = adjacency_list; Param1 = adjacency_list; typename result_of(Param0, Param1, const parameter::aux::empty_arg_list&)>::type = bool]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/is_kuratowski_subgraph.hpp:278:34: required from ‘bool boost::is_kuratowski_subgraph(const Graph&, ForwardIterator, ForwardIterator, VertexIndexMap) [with Graph = adjacency_list, property >; ForwardIterator = __gnu_cxx::__normal_iterator*, std::vector > >; VertexIndexMap = vec_adj_list_vertex_id_map, long unsigned int>]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/is_kuratowski_subgraph.hpp:290:34: required from ‘bool boost::is_kuratowski_subgraph(const Graph&, ForwardIterator, ForwardIterator) [with Graph = adjacency_list, property >; ForwardIterator = __gnu_cxx::__normal_iterator*, std::vector > >]’ planar.cpp:435:37: required from here /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::Comparable<__gnu_cxx::__normal_iterator > >]’ 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ^ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements > > >]’: /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:601:7: required from ‘struct boost::RandomAccessIterator<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:597:3: required from ‘struct boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator > >]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied > > >::value’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied > > >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:72:8: [ skipping 4 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/isomorphism.hpp:651:42: required from ‘bool boost::graph::detail::isomorphism_impl::operator()(const Graph1&, const Graph2&, const ArgPack&) const [with ArgPack = boost::parameter::aux::empty_arg_list; Graph1 = boost::adjacency_list; Graph2 = boost::adjacency_list]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/isomorphism.hpp:662:5: required from ‘typename boost::result_of(Param0, Param1, const ArgPack&)>::type boost::graph::isomorphism_with_named_params(const Param0&, const Param1&, const ArgPack&) [with Param0 = boost::adjacency_list; Param1 = boost::adjacency_list; ArgPack = boost::parameter::aux::empty_arg_list; typename boost::result_of(Param0, Param1, const ArgPack&)>::type = bool]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/isomorphism.hpp:666:1: required from ‘typename boost::result_of(Param0, Param1, const boost::parameter::aux::empty_arg_list&)>::type boost::isomorphism(const Param0&, const Param1&) [with Param0 = adjacency_list; Param1 = adjacency_list; typename result_of(Param0, Param1, const parameter::aux::empty_arg_list&)>::type = bool]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/is_kuratowski_subgraph.hpp:278:34: required from ‘bool boost::is_kuratowski_subgraph(const Graph&, ForwardIterator, ForwardIterator, VertexIndexMap) [with Graph = adjacency_list, property >; ForwardIterator = __gnu_cxx::__normal_iterator*, std::vector > >; VertexIndexMap = vec_adj_list_vertex_id_map, long unsigned int>]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/is_kuratowski_subgraph.hpp:290:34: required from ‘bool boost::is_kuratowski_subgraph(const Graph&, ForwardIterator, ForwardIterator) [with Graph = adjacency_list, property >; ForwardIterator = __gnu_cxx::__normal_iterator*, std::vector > >]’ planar.cpp:435:37: required from here /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::RandomAccessIterator<__gnu_cxx::__normal_iterator > >]’ 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ^ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator > >]’: /home/omnipath/local/R/4.4-3.20/BH/include/boost/property_map/property_map.hpp:354:5: required from ‘boost::safe_iterator_property_map >::value_type, typename std::iterator_traits< >::reference> boost::make_safe_iterator_property_map(RAIter, std::size_t, ID) [with RAIter = __gnu_cxx::__normal_iterator >; ID = vec_adj_list_vertex_id_map; typename std::iterator_traits< >::value_type = char; typename std::iterator_traits< >::reference = char&; std::size_t = long unsigned int]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/isomorphism.hpp:153:51: required from ‘boost::detail::isomorphism_algo::isomorphism_algo(const Graph1&, const Graph2&, IsoMapping, Invariant1, Invariant2, std::size_t, IndexMap1, IndexMap2) [with Graph1 = boost::adjacency_list; Graph2 = boost::adjacency_list; IsoMapping = boost::shared_array_property_map >; Invariant1 = boost::degree_vertex_invariant >, boost::adjacency_list >; Invariant2 = boost::degree_vertex_invariant >, boost::adjacency_list >; IndexMap1 = boost::vec_adj_list_vertex_id_map; IndexMap2 = boost::vec_adj_list_vertex_id_map; std::size_t = long unsigned int]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/isomorphism.hpp:530:9: required from ‘bool boost::isomorphism(const Graph1&, const Graph2&, IsoMapping, Invariant1, Invariant2, std::size_t, IndexMap1, IndexMap2) [with Graph1 = adjacency_list; Graph2 = adjacency_list; IsoMapping = shared_array_property_map >; Invariant1 = degree_vertex_invariant >, adjacency_list >; Invariant2 = degree_vertex_invariant >, adjacency_list >; IndexMap1 = vec_adj_list_vertex_id_map; IndexMap2 = vec_adj_list_vertex_id_map; std::size_t = long unsigned int]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/isomorphism.hpp:651:42: required from ‘bool boost::graph::detail::isomorphism_impl::operator()(const Graph1&, const Graph2&, const ArgPack&) const [with ArgPack = boost::parameter::aux::empty_arg_list; Graph1 = boost::adjacency_list; Graph2 = boost::adjacency_list]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/isomorphism.hpp:662:5: required from ‘typename boost::result_of(Param0, Param1, const ArgPack&)>::type boost::graph::isomorphism_with_named_params(const Param0&, const Param1&, const ArgPack&) [with Param0 = boost::adjacency_list; Param1 = boost::adjacency_list; ArgPack = boost::parameter::aux::empty_arg_list; typename boost::result_of(Param0, Param1, const ArgPack&)>::type = bool]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/isomorphism.hpp:666:1: required from ‘typename boost::result_of(Param0, Param1, const boost::parameter::aux::empty_arg_list&)>::type boost::isomorphism(const Param0&, const Param1&) [with Param0 = adjacency_list; Param1 = adjacency_list; typename result_of(Param0, Param1, const parameter::aux::empty_arg_list&)>::type = bool]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/is_kuratowski_subgraph.hpp:278:34: required from ‘bool boost::is_kuratowski_subgraph(const Graph&, ForwardIterator, ForwardIterator, VertexIndexMap) [with Graph = adjacency_list, property >; ForwardIterator = __gnu_cxx::__normal_iterator*, std::vector > >; VertexIndexMap = vec_adj_list_vertex_id_map, long unsigned int>]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/is_kuratowski_subgraph.hpp:290:34: required from ‘bool boost::is_kuratowski_subgraph(const Graph&, ForwardIterator, ForwardIterator) [with Graph = adjacency_list, property >; ForwardIterator = __gnu_cxx::__normal_iterator*, std::vector > >]’ planar.cpp:435:37: required from here /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:597:17: note: in a call to non-static member function ‘boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator > >::~RandomAccessIteratorConcept()’ 597 | BOOST_concept(RandomAccessIterator,(TT)) | ^~~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/preprocessor/cat.hpp:29:34: note: in definition of macro ‘BOOST_PP_CAT_I’ 29 | # define BOOST_PP_CAT_I(a, b) a ## b | ^ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/concept_def.hpp:23:12: note: in expansion of macro ‘BOOST_PP_CAT’ 23 | struct BOOST_PP_CAT(name,Concept) \ | ^~~~~~~~~~~~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:597:3: note: in expansion of macro ‘BOOST_concept’ 597 | BOOST_concept(RandomAccessIterator,(TT)) | ^~~~~~~~~~~~~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements > > >]’: /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:167:5: required from ‘struct boost::CopyConstructible<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/range/concepts.hpp:125:16: required from ‘struct boost::range_detail::IncrementableIteratorConcept<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/range/concepts.hpp:147:16: required from ‘struct boost::range_detail::SinglePassIteratorConcept<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::range_detail::SinglePassIteratorConcept<__gnu_cxx::__normal_iterator > >]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied > > >::value’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:45:51: [ skipping 13 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/isomorphism.hpp:651:42: required from ‘bool boost::graph::detail::isomorphism_impl::operator()(const Graph1&, const Graph2&, const ArgPack&) const [with ArgPack = boost::parameter::aux::empty_arg_list; Graph1 = boost::adjacency_list; Graph2 = boost::adjacency_list]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/isomorphism.hpp:662:5: required from ‘typename boost::result_of(Param0, Param1, const ArgPack&)>::type boost::graph::isomorphism_with_named_params(const Param0&, const Param1&, const ArgPack&) [with Param0 = boost::adjacency_list; Param1 = boost::adjacency_list; ArgPack = boost::parameter::aux::empty_arg_list; typename boost::result_of(Param0, Param1, const ArgPack&)>::type = bool]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/isomorphism.hpp:666:1: required from ‘typename boost::result_of(Param0, Param1, const boost::parameter::aux::empty_arg_list&)>::type boost::isomorphism(const Param0&, const Param1&) [with Param0 = adjacency_list; Param1 = adjacency_list; typename result_of(Param0, Param1, const parameter::aux::empty_arg_list&)>::type = bool]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/is_kuratowski_subgraph.hpp:278:34: required from ‘bool boost::is_kuratowski_subgraph(const Graph&, ForwardIterator, ForwardIterator, VertexIndexMap) [with Graph = adjacency_list, property >; ForwardIterator = __gnu_cxx::__normal_iterator*, std::vector > >; VertexIndexMap = vec_adj_list_vertex_id_map, long unsigned int>]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/is_kuratowski_subgraph.hpp:290:34: required from ‘bool boost::is_kuratowski_subgraph(const Graph&, ForwardIterator, ForwardIterator) [with Graph = adjacency_list, property >; ForwardIterator = __gnu_cxx::__normal_iterator*, std::vector > >]’ planar.cpp:435:37: required from here /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::CopyConstructible<__gnu_cxx::__normal_iterator > >]’ 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ^ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements >]’: /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:208:5: required from ‘struct boost::Convertible’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::Convertible]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied >::value’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_)>’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/iterator/iterator_concepts.hpp:114:7: [ skipping 17 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/isomorphism.hpp:651:42: required from ‘bool boost::graph::detail::isomorphism_impl::operator()(const Graph1&, const Graph2&, const ArgPack&) const [with ArgPack = boost::parameter::aux::empty_arg_list; Graph1 = boost::adjacency_list; Graph2 = boost::adjacency_list]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/isomorphism.hpp:662:5: required from ‘typename boost::result_of(Param0, Param1, const ArgPack&)>::type boost::graph::isomorphism_with_named_params(const Param0&, const Param1&, const ArgPack&) [with Param0 = boost::adjacency_list; Param1 = boost::adjacency_list; ArgPack = boost::parameter::aux::empty_arg_list; typename boost::result_of(Param0, Param1, const ArgPack&)>::type = bool]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/isomorphism.hpp:666:1: required from ‘typename boost::result_of(Param0, Param1, const boost::parameter::aux::empty_arg_list&)>::type boost::isomorphism(const Param0&, const Param1&) [with Param0 = adjacency_list; Param1 = adjacency_list; typename result_of(Param0, Param1, const parameter::aux::empty_arg_list&)>::type = bool]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/is_kuratowski_subgraph.hpp:278:34: required from ‘bool boost::is_kuratowski_subgraph(const Graph&, ForwardIterator, ForwardIterator, VertexIndexMap) [with Graph = adjacency_list, property >; ForwardIterator = __gnu_cxx::__normal_iterator*, std::vector > >; VertexIndexMap = vec_adj_list_vertex_id_map, long unsigned int>]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/is_kuratowski_subgraph.hpp:290:34: required from ‘bool boost::is_kuratowski_subgraph(const Graph&, ForwardIterator, ForwardIterator) [with Graph = adjacency_list, property >; ForwardIterator = __gnu_cxx::__normal_iterator*, std::vector > >]’ planar.cpp:435:37: required from here /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::Convertible]’ 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ^ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::Convertible]’: /home/omnipath/local/R/4.4-3.20/BH/include/boost/iterator/iterator_concepts.hpp:114:7: required from ‘struct boost::range_detail::IncrementableIteratorConcept<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/range/concepts.hpp:147:16: required from ‘struct boost::range_detail::SinglePassIteratorConcept<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::range_detail::SinglePassIteratorConcept<__gnu_cxx::__normal_iterator > >]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied > > >::value’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied > > >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:72:8: [ skipping 12 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/isomorphism.hpp:651:42: required from ‘bool boost::graph::detail::isomorphism_impl::operator()(const Graph1&, const Graph2&, const ArgPack&) const [with ArgPack = boost::parameter::aux::empty_arg_list; Graph1 = boost::adjacency_list; Graph2 = boost::adjacency_list]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/isomorphism.hpp:662:5: required from ‘typename boost::result_of(Param0, Param1, const ArgPack&)>::type boost::graph::isomorphism_with_named_params(const Param0&, const Param1&, const ArgPack&) [with Param0 = boost::adjacency_list; Param1 = boost::adjacency_list; ArgPack = boost::parameter::aux::empty_arg_list; typename boost::result_of(Param0, Param1, const ArgPack&)>::type = bool]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/isomorphism.hpp:666:1: required from ‘typename boost::result_of(Param0, Param1, const boost::parameter::aux::empty_arg_list&)>::type boost::isomorphism(const Param0&, const Param1&) [with Param0 = adjacency_list; Param1 = adjacency_list; typename result_of(Param0, Param1, const parameter::aux::empty_arg_list&)>::type = bool]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/is_kuratowski_subgraph.hpp:278:34: required from ‘bool boost::is_kuratowski_subgraph(const Graph&, ForwardIterator, ForwardIterator, VertexIndexMap) [with Graph = adjacency_list, property >; ForwardIterator = __gnu_cxx::__normal_iterator*, std::vector > >; VertexIndexMap = vec_adj_list_vertex_id_map, long unsigned int>]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/is_kuratowski_subgraph.hpp:290:34: required from ‘bool boost::is_kuratowski_subgraph(const Graph&, ForwardIterator, ForwardIterator) [with Graph = adjacency_list, property >; ForwardIterator = __gnu_cxx::__normal_iterator*, std::vector > >]’ planar.cpp:435:37: required from here /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::Convertible::~Convertible() [with X = boost::iterators::random_access_traversal_tag; Y = boost::iterators::incrementable_traversal_tag]’ 37 | ~model() | ^ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:208:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 208 | BOOST_CONCEPT_USAGE(Convertible) { | ^~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements > > >]’: /home/omnipath/local/R/4.4-3.20/BH/include/boost/range/concepts.hpp:136:13: required from ‘struct boost::range_detail::IncrementableIteratorConcept<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/range/concepts.hpp:147:16: required from ‘struct boost::range_detail::SinglePassIteratorConcept<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::range_detail::SinglePassIteratorConcept<__gnu_cxx::__normal_iterator > >]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied > > >::value’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied > > >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:72:8: [ skipping 12 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/isomorphism.hpp:651:42: required from ‘bool boost::graph::detail::isomorphism_impl::operator()(const Graph1&, const Graph2&, const ArgPack&) const [with ArgPack = boost::parameter::aux::empty_arg_list; Graph1 = boost::adjacency_list; Graph2 = boost::adjacency_list]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/isomorphism.hpp:662:5: required from ‘typename boost::result_of(Param0, Param1, const ArgPack&)>::type boost::graph::isomorphism_with_named_params(const Param0&, const Param1&, const ArgPack&) [with Param0 = boost::adjacency_list; Param1 = boost::adjacency_list; ArgPack = boost::parameter::aux::empty_arg_list; typename boost::result_of(Param0, Param1, const ArgPack&)>::type = bool]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/isomorphism.hpp:666:1: required from ‘typename boost::result_of(Param0, Param1, const boost::parameter::aux::empty_arg_list&)>::type boost::isomorphism(const Param0&, const Param1&) [with Param0 = adjacency_list; Param1 = adjacency_list; typename result_of(Param0, Param1, const parameter::aux::empty_arg_list&)>::type = bool]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/is_kuratowski_subgraph.hpp:278:34: required from ‘bool boost::is_kuratowski_subgraph(const Graph&, ForwardIterator, ForwardIterator, VertexIndexMap) [with Graph = adjacency_list, property >; ForwardIterator = __gnu_cxx::__normal_iterator*, std::vector > >; VertexIndexMap = vec_adj_list_vertex_id_map, long unsigned int>]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/is_kuratowski_subgraph.hpp:290:34: required from ‘bool boost::is_kuratowski_subgraph(const Graph&, ForwardIterator, ForwardIterator) [with Graph = adjacency_list, property >; ForwardIterator = __gnu_cxx::__normal_iterator*, std::vector > >]’ planar.cpp:435:37: required from here /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::range_detail::IncrementableIteratorConcept<__gnu_cxx::__normal_iterator > >]’ 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ^ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements >]’: /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:208:5: required from ‘struct boost::Convertible’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::Convertible]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied >::value’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_)>’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/range/concepts.hpp:152:13: [ skipping 16 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/isomorphism.hpp:651:42: required from ‘bool boost::graph::detail::isomorphism_impl::operator()(const Graph1&, const Graph2&, const ArgPack&) const [with ArgPack = boost::parameter::aux::empty_arg_list; Graph1 = boost::adjacency_list; Graph2 = boost::adjacency_list]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/isomorphism.hpp:662:5: required from ‘typename boost::result_of(Param0, Param1, const ArgPack&)>::type boost::graph::isomorphism_with_named_params(const Param0&, const Param1&, const ArgPack&) [with Param0 = boost::adjacency_list; Param1 = boost::adjacency_list; ArgPack = boost::parameter::aux::empty_arg_list; typename boost::result_of(Param0, Param1, const ArgPack&)>::type = bool]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/isomorphism.hpp:666:1: required from ‘typename boost::result_of(Param0, Param1, const boost::parameter::aux::empty_arg_list&)>::type boost::isomorphism(const Param0&, const Param1&) [with Param0 = adjacency_list; Param1 = adjacency_list; typename result_of(Param0, Param1, const parameter::aux::empty_arg_list&)>::type = bool]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/is_kuratowski_subgraph.hpp:278:34: required from ‘bool boost::is_kuratowski_subgraph(const Graph&, ForwardIterator, ForwardIterator, VertexIndexMap) [with Graph = adjacency_list, property >; ForwardIterator = __gnu_cxx::__normal_iterator*, std::vector > >; VertexIndexMap = vec_adj_list_vertex_id_map, long unsigned int>]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/is_kuratowski_subgraph.hpp:290:34: required from ‘bool boost::is_kuratowski_subgraph(const Graph&, ForwardIterator, ForwardIterator) [with Graph = adjacency_list, property >; ForwardIterator = __gnu_cxx::__normal_iterator*, std::vector > >]’ planar.cpp:435:37: required from here /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::Convertible]’ 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ^ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::Convertible]’: /home/omnipath/local/R/4.4-3.20/BH/include/boost/range/concepts.hpp:152:13: required from ‘struct boost::range_detail::SinglePassIteratorConcept<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::range_detail::SinglePassIteratorConcept<__gnu_cxx::__normal_iterator > >]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied > > >::value’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied > > >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_ > >)>’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/range/concepts.hpp:278:9: [ skipping 11 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/isomorphism.hpp:651:42: required from ‘bool boost::graph::detail::isomorphism_impl::operator()(const Graph1&, const Graph2&, const ArgPack&) const [with ArgPack = boost::parameter::aux::empty_arg_list; Graph1 = boost::adjacency_list; Graph2 = boost::adjacency_list]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/isomorphism.hpp:662:5: required from ‘typename boost::result_of(Param0, Param1, const ArgPack&)>::type boost::graph::isomorphism_with_named_params(const Param0&, const Param1&, const ArgPack&) [with Param0 = boost::adjacency_list; Param1 = boost::adjacency_list; ArgPack = boost::parameter::aux::empty_arg_list; typename boost::result_of(Param0, Param1, const ArgPack&)>::type = bool]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/isomorphism.hpp:666:1: required from ‘typename boost::result_of(Param0, Param1, const boost::parameter::aux::empty_arg_list&)>::type boost::isomorphism(const Param0&, const Param1&) [with Param0 = adjacency_list; Param1 = adjacency_list; typename result_of(Param0, Param1, const parameter::aux::empty_arg_list&)>::type = bool]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/is_kuratowski_subgraph.hpp:278:34: required from ‘bool boost::is_kuratowski_subgraph(const Graph&, ForwardIterator, ForwardIterator, VertexIndexMap) [with Graph = adjacency_list, property >; ForwardIterator = __gnu_cxx::__normal_iterator*, std::vector > >; VertexIndexMap = vec_adj_list_vertex_id_map, long unsigned int>]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/is_kuratowski_subgraph.hpp:290:34: required from ‘bool boost::is_kuratowski_subgraph(const Graph&, ForwardIterator, ForwardIterator) [with Graph = adjacency_list, property >; ForwardIterator = __gnu_cxx::__normal_iterator*, std::vector > >]’ planar.cpp:435:37: required from here /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::Convertible::~Convertible() [with X = boost::iterators::random_access_traversal_tag; Y = boost::iterators::single_pass_traversal_tag]’ 37 | ~model() | ^ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:208:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 208 | BOOST_CONCEPT_USAGE(Convertible) { | ^~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements > > >]’: /home/omnipath/local/R/4.4-3.20/BH/include/boost/range/concepts.hpp:158:13: required from ‘struct boost::range_detail::SinglePassIteratorConcept<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::range_detail::SinglePassIteratorConcept<__gnu_cxx::__normal_iterator > >]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied > > >::value’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied > > >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_ > >)>’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/range/concepts.hpp:278:9: [ skipping 11 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/isomorphism.hpp:651:42: required from ‘bool boost::graph::detail::isomorphism_impl::operator()(const Graph1&, const Graph2&, const ArgPack&) const [with ArgPack = boost::parameter::aux::empty_arg_list; Graph1 = boost::adjacency_list; Graph2 = boost::adjacency_list]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/isomorphism.hpp:662:5: required from ‘typename boost::result_of(Param0, Param1, const ArgPack&)>::type boost::graph::isomorphism_with_named_params(const Param0&, const Param1&, const ArgPack&) [with Param0 = boost::adjacency_list; Param1 = boost::adjacency_list; ArgPack = boost::parameter::aux::empty_arg_list; typename boost::result_of(Param0, Param1, const ArgPack&)>::type = bool]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/isomorphism.hpp:666:1: required from ‘typename boost::result_of(Param0, Param1, const boost::parameter::aux::empty_arg_list&)>::type boost::isomorphism(const Param0&, const Param1&) [with Param0 = adjacency_list; Param1 = adjacency_list; typename result_of(Param0, Param1, const parameter::aux::empty_arg_list&)>::type = bool]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/is_kuratowski_subgraph.hpp:278:34: required from ‘bool boost::is_kuratowski_subgraph(const Graph&, ForwardIterator, ForwardIterator, VertexIndexMap) [with Graph = adjacency_list, property >; ForwardIterator = __gnu_cxx::__normal_iterator*, std::vector > >; VertexIndexMap = vec_adj_list_vertex_id_map, long unsigned int>]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/is_kuratowski_subgraph.hpp:290:34: required from ‘bool boost::is_kuratowski_subgraph(const Graph&, ForwardIterator, ForwardIterator) [with Graph = adjacency_list, property >; ForwardIterator = __gnu_cxx::__normal_iterator*, std::vector > >]’ planar.cpp:435:37: required from here /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::range_detail::SinglePassIteratorConcept<__gnu_cxx::__normal_iterator > >]’ 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ^ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::range_detail::SinglePassIteratorConcept<__gnu_cxx::__normal_iterator > >]’: /home/omnipath/local/R/4.4-3.20/BH/include/boost/range/concepts.hpp:278:9: required from ‘struct boost::SinglePassRangeConcept >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/range/concepts.hpp:318:12: required from ‘struct boost::ForwardRangeConcept >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/range/concepts.hpp:352:12: required from ‘struct boost::BidirectionalRangeConcept >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/range/concepts.hpp:370:12: required from ‘struct boost::RandomAccessRangeConcept >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::RandomAccessRangeConcept >]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:42:5: [ skipping 6 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/isomorphism.hpp:651:42: required from ‘bool boost::graph::detail::isomorphism_impl::operator()(const Graph1&, const Graph2&, const ArgPack&) const [with ArgPack = boost::parameter::aux::empty_arg_list; Graph1 = boost::adjacency_list; Graph2 = boost::adjacency_list]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/isomorphism.hpp:662:5: required from ‘typename boost::result_of(Param0, Param1, const ArgPack&)>::type boost::graph::isomorphism_with_named_params(const Param0&, const Param1&, const ArgPack&) [with Param0 = boost::adjacency_list; Param1 = boost::adjacency_list; ArgPack = boost::parameter::aux::empty_arg_list; typename boost::result_of(Param0, Param1, const ArgPack&)>::type = bool]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/isomorphism.hpp:666:1: required from ‘typename boost::result_of(Param0, Param1, const boost::parameter::aux::empty_arg_list&)>::type boost::isomorphism(const Param0&, const Param1&) [with Param0 = adjacency_list; Param1 = adjacency_list; typename result_of(Param0, Param1, const parameter::aux::empty_arg_list&)>::type = bool]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/is_kuratowski_subgraph.hpp:278:34: required from ‘bool boost::is_kuratowski_subgraph(const Graph&, ForwardIterator, ForwardIterator, VertexIndexMap) [with Graph = adjacency_list, property >; ForwardIterator = __gnu_cxx::__normal_iterator*, std::vector > >; VertexIndexMap = vec_adj_list_vertex_id_map, long unsigned int>]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/is_kuratowski_subgraph.hpp:290:34: required from ‘bool boost::is_kuratowski_subgraph(const Graph&, ForwardIterator, ForwardIterator) [with Graph = adjacency_list, property >; ForwardIterator = __gnu_cxx::__normal_iterator*, std::vector > >]’ planar.cpp:435:37: required from here /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::range_detail::SinglePassIteratorConcept::~SinglePassIteratorConcept() [with Iterator = __gnu_cxx::__normal_iterator >]’ 37 | ~model() | ^ /home/omnipath/local/R/4.4-3.20/BH/include/boost/range/concepts.hpp:158:13: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 158 | BOOST_CONCEPT_USAGE(SinglePassIteratorConcept) | ^~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements > > >]’: /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:167:5: required from ‘struct boost::CopyConstructible<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/range/concepts.hpp:125:16: required from ‘struct boost::range_detail::IncrementableIteratorConcept<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/range/concepts.hpp:147:16: required from ‘struct boost::range_detail::SinglePassIteratorConcept<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::range_detail::SinglePassIteratorConcept<__gnu_cxx::__normal_iterator > >]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied > > >::value’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:45:51: [ skipping 13 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/isomorphism.hpp:651:42: required from ‘bool boost::graph::detail::isomorphism_impl::operator()(const Graph1&, const Graph2&, const ArgPack&) const [with ArgPack = boost::parameter::aux::empty_arg_list; Graph1 = boost::adjacency_list; Graph2 = boost::adjacency_list]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/isomorphism.hpp:662:5: required from ‘typename boost::result_of(Param0, Param1, const ArgPack&)>::type boost::graph::isomorphism_with_named_params(const Param0&, const Param1&, const ArgPack&) [with Param0 = boost::adjacency_list; Param1 = boost::adjacency_list; ArgPack = boost::parameter::aux::empty_arg_list; typename boost::result_of(Param0, Param1, const ArgPack&)>::type = bool]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/isomorphism.hpp:666:1: required from ‘typename boost::result_of(Param0, Param1, const boost::parameter::aux::empty_arg_list&)>::type boost::isomorphism(const Param0&, const Param1&) [with Param0 = adjacency_list; Param1 = adjacency_list; typename result_of(Param0, Param1, const parameter::aux::empty_arg_list&)>::type = bool]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/is_kuratowski_subgraph.hpp:278:34: required from ‘bool boost::is_kuratowski_subgraph(const Graph&, ForwardIterator, ForwardIterator, VertexIndexMap) [with Graph = adjacency_list, property >; ForwardIterator = __gnu_cxx::__normal_iterator*, std::vector > >; VertexIndexMap = vec_adj_list_vertex_id_map, long unsigned int>]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/is_kuratowski_subgraph.hpp:290:34: required from ‘bool boost::is_kuratowski_subgraph(const Graph&, ForwardIterator, ForwardIterator) [with Graph = adjacency_list, property >; ForwardIterator = __gnu_cxx::__normal_iterator*, std::vector > >]’ planar.cpp:435:37: required from here /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::CopyConstructible<__gnu_cxx::__normal_iterator > >]’ 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ^ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements > > >]’: /home/omnipath/local/R/4.4-3.20/BH/include/boost/range/concepts.hpp:136:13: required from ‘struct boost::range_detail::IncrementableIteratorConcept<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/range/concepts.hpp:147:16: required from ‘struct boost::range_detail::SinglePassIteratorConcept<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::range_detail::SinglePassIteratorConcept<__gnu_cxx::__normal_iterator > >]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied > > >::value’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied > > >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:72:8: [ skipping 12 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/isomorphism.hpp:651:42: required from ‘bool boost::graph::detail::isomorphism_impl::operator()(const Graph1&, const Graph2&, const ArgPack&) const [with ArgPack = boost::parameter::aux::empty_arg_list; Graph1 = boost::adjacency_list; Graph2 = boost::adjacency_list]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/isomorphism.hpp:662:5: required from ‘typename boost::result_of(Param0, Param1, const ArgPack&)>::type boost::graph::isomorphism_with_named_params(const Param0&, const Param1&, const ArgPack&) [with Param0 = boost::adjacency_list; Param1 = boost::adjacency_list; ArgPack = boost::parameter::aux::empty_arg_list; typename boost::result_of(Param0, Param1, const ArgPack&)>::type = bool]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/isomorphism.hpp:666:1: required from ‘typename boost::result_of(Param0, Param1, const boost::parameter::aux::empty_arg_list&)>::type boost::isomorphism(const Param0&, const Param1&) [with Param0 = adjacency_list; Param1 = adjacency_list; typename result_of(Param0, Param1, const parameter::aux::empty_arg_list&)>::type = bool]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/is_kuratowski_subgraph.hpp:278:34: required from ‘bool boost::is_kuratowski_subgraph(const Graph&, ForwardIterator, ForwardIterator, VertexIndexMap) [with Graph = adjacency_list, property >; ForwardIterator = __gnu_cxx::__normal_iterator*, std::vector > >; VertexIndexMap = vec_adj_list_vertex_id_map, long unsigned int>]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/is_kuratowski_subgraph.hpp:290:34: required from ‘bool boost::is_kuratowski_subgraph(const Graph&, ForwardIterator, ForwardIterator) [with Graph = adjacency_list, property >; ForwardIterator = __gnu_cxx::__normal_iterator*, std::vector > >]’ planar.cpp:435:37: required from here /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::range_detail::IncrementableIteratorConcept<__gnu_cxx::__normal_iterator > >]’ 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ^ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements > > >]’: /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:233:5: required from ‘struct boost::EqualityComparable<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/range/concepts.hpp:147:16: required from ‘struct boost::range_detail::SinglePassIteratorConcept<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::range_detail::SinglePassIteratorConcept<__gnu_cxx::__normal_iterator > >]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied > > >::value’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied > > >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:72:8: [ skipping 12 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/isomorphism.hpp:651:42: required from ‘bool boost::graph::detail::isomorphism_impl::operator()(const Graph1&, const Graph2&, const ArgPack&) const [with ArgPack = boost::parameter::aux::empty_arg_list; Graph1 = boost::adjacency_list; Graph2 = boost::adjacency_list]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/isomorphism.hpp:662:5: required from ‘typename boost::result_of(Param0, Param1, const ArgPack&)>::type boost::graph::isomorphism_with_named_params(const Param0&, const Param1&, const ArgPack&) [with Param0 = boost::adjacency_list; Param1 = boost::adjacency_list; ArgPack = boost::parameter::aux::empty_arg_list; typename boost::result_of(Param0, Param1, const ArgPack&)>::type = bool]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/isomorphism.hpp:666:1: required from ‘typename boost::result_of(Param0, Param1, const boost::parameter::aux::empty_arg_list&)>::type boost::isomorphism(const Param0&, const Param1&) [with Param0 = adjacency_list; Param1 = adjacency_list; typename result_of(Param0, Param1, const parameter::aux::empty_arg_list&)>::type = bool]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/is_kuratowski_subgraph.hpp:278:34: required from ‘bool boost::is_kuratowski_subgraph(const Graph&, ForwardIterator, ForwardIterator, VertexIndexMap) [with Graph = adjacency_list, property >; ForwardIterator = __gnu_cxx::__normal_iterator*, std::vector > >; VertexIndexMap = vec_adj_list_vertex_id_map, long unsigned int>]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/is_kuratowski_subgraph.hpp:290:34: required from ‘bool boost::is_kuratowski_subgraph(const Graph&, ForwardIterator, ForwardIterator) [with Graph = adjacency_list, property >; ForwardIterator = __gnu_cxx::__normal_iterator*, std::vector > >]’ planar.cpp:435:37: required from here /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::EqualityComparable<__gnu_cxx::__normal_iterator > >]’ 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ^ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements > > >]’: /home/omnipath/local/R/4.4-3.20/BH/include/boost/range/concepts.hpp:158:13: required from ‘struct boost::range_detail::SinglePassIteratorConcept<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::range_detail::SinglePassIteratorConcept<__gnu_cxx::__normal_iterator > >]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied > > >::value’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied > > >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_ > >)>’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/range/concepts.hpp:281:9: [ skipping 11 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/isomorphism.hpp:651:42: required from ‘bool boost::graph::detail::isomorphism_impl::operator()(const Graph1&, const Graph2&, const ArgPack&) const [with ArgPack = boost::parameter::aux::empty_arg_list; Graph1 = boost::adjacency_list; Graph2 = boost::adjacency_list]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/isomorphism.hpp:662:5: required from ‘typename boost::result_of(Param0, Param1, const ArgPack&)>::type boost::graph::isomorphism_with_named_params(const Param0&, const Param1&, const ArgPack&) [with Param0 = boost::adjacency_list; Param1 = boost::adjacency_list; ArgPack = boost::parameter::aux::empty_arg_list; typename boost::result_of(Param0, Param1, const ArgPack&)>::type = bool]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/isomorphism.hpp:666:1: required from ‘typename boost::result_of(Param0, Param1, const boost::parameter::aux::empty_arg_list&)>::type boost::isomorphism(const Param0&, const Param1&) [with Param0 = adjacency_list; Param1 = adjacency_list; typename result_of(Param0, Param1, const parameter::aux::empty_arg_list&)>::type = bool]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/is_kuratowski_subgraph.hpp:278:34: required from ‘bool boost::is_kuratowski_subgraph(const Graph&, ForwardIterator, ForwardIterator, VertexIndexMap) [with Graph = adjacency_list, property >; ForwardIterator = __gnu_cxx::__normal_iterator*, std::vector > >; VertexIndexMap = vec_adj_list_vertex_id_map, long unsigned int>]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/is_kuratowski_subgraph.hpp:290:34: required from ‘bool boost::is_kuratowski_subgraph(const Graph&, ForwardIterator, ForwardIterator) [with Graph = adjacency_list, property >; ForwardIterator = __gnu_cxx::__normal_iterator*, std::vector > >]’ planar.cpp:435:37: required from here /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::range_detail::SinglePassIteratorConcept<__gnu_cxx::__normal_iterator > >]’ 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ^ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::range_detail::SinglePassIteratorConcept<__gnu_cxx::__normal_iterator > >]’: /home/omnipath/local/R/4.4-3.20/BH/include/boost/range/concepts.hpp:281:9: required from ‘struct boost::SinglePassRangeConcept >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/range/concepts.hpp:318:12: required from ‘struct boost::ForwardRangeConcept >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/range/concepts.hpp:352:12: required from ‘struct boost::BidirectionalRangeConcept >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/range/concepts.hpp:370:12: required from ‘struct boost::RandomAccessRangeConcept >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::RandomAccessRangeConcept >]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:42:5: [ skipping 6 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/isomorphism.hpp:651:42: required from ‘bool boost::graph::detail::isomorphism_impl::operator()(const Graph1&, const Graph2&, const ArgPack&) const [with ArgPack = boost::parameter::aux::empty_arg_list; Graph1 = boost::adjacency_list; Graph2 = boost::adjacency_list]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/isomorphism.hpp:662:5: required from ‘typename boost::result_of(Param0, Param1, const ArgPack&)>::type boost::graph::isomorphism_with_named_params(const Param0&, const Param1&, const ArgPack&) [with Param0 = boost::adjacency_list; Param1 = boost::adjacency_list; ArgPack = boost::parameter::aux::empty_arg_list; typename boost::result_of(Param0, Param1, const ArgPack&)>::type = bool]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/isomorphism.hpp:666:1: required from ‘typename boost::result_of(Param0, Param1, const boost::parameter::aux::empty_arg_list&)>::type boost::isomorphism(const Param0&, const Param1&) [with Param0 = adjacency_list; Param1 = adjacency_list; typename result_of(Param0, Param1, const parameter::aux::empty_arg_list&)>::type = bool]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/is_kuratowski_subgraph.hpp:278:34: required from ‘bool boost::is_kuratowski_subgraph(const Graph&, ForwardIterator, ForwardIterator, VertexIndexMap) [with Graph = adjacency_list, property >; ForwardIterator = __gnu_cxx::__normal_iterator*, std::vector > >; VertexIndexMap = vec_adj_list_vertex_id_map, long unsigned int>]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/is_kuratowski_subgraph.hpp:290:34: required from ‘bool boost::is_kuratowski_subgraph(const Graph&, ForwardIterator, ForwardIterator) [with Graph = adjacency_list, property >; ForwardIterator = __gnu_cxx::__normal_iterator*, std::vector > >]’ planar.cpp:435:37: required from here /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::range_detail::SinglePassIteratorConcept::~SinglePassIteratorConcept() [with Iterator = __gnu_cxx::__normal_iterator >]’ 37 | ~model() | ^ /home/omnipath/local/R/4.4-3.20/BH/include/boost/range/concepts.hpp:158:13: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 158 | BOOST_CONCEPT_USAGE(SinglePassIteratorConcept) | ^~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements > >]’: /home/omnipath/local/R/4.4-3.20/BH/include/boost/range/concepts.hpp:284:9: required from ‘struct boost::SinglePassRangeConcept >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/range/concepts.hpp:318:12: required from ‘struct boost::ForwardRangeConcept >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/range/concepts.hpp:352:12: required from ‘struct boost::BidirectionalRangeConcept >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/range/concepts.hpp:370:12: required from ‘struct boost::RandomAccessRangeConcept >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::RandomAccessRangeConcept >]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:42:5: [ skipping 6 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/isomorphism.hpp:651:42: required from ‘bool boost::graph::detail::isomorphism_impl::operator()(const Graph1&, const Graph2&, const ArgPack&) const [with ArgPack = boost::parameter::aux::empty_arg_list; Graph1 = boost::adjacency_list; Graph2 = boost::adjacency_list]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/isomorphism.hpp:662:5: required from ‘typename boost::result_of(Param0, Param1, const ArgPack&)>::type boost::graph::isomorphism_with_named_params(const Param0&, const Param1&, const ArgPack&) [with Param0 = boost::adjacency_list; Param1 = boost::adjacency_list; ArgPack = boost::parameter::aux::empty_arg_list; typename boost::result_of(Param0, Param1, const ArgPack&)>::type = bool]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/isomorphism.hpp:666:1: required from ‘typename boost::result_of(Param0, Param1, const boost::parameter::aux::empty_arg_list&)>::type boost::isomorphism(const Param0&, const Param1&) [with Param0 = adjacency_list; Param1 = adjacency_list; typename result_of(Param0, Param1, const parameter::aux::empty_arg_list&)>::type = bool]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/is_kuratowski_subgraph.hpp:278:34: required from ‘bool boost::is_kuratowski_subgraph(const Graph&, ForwardIterator, ForwardIterator, VertexIndexMap) [with Graph = adjacency_list, property >; ForwardIterator = __gnu_cxx::__normal_iterator*, std::vector > >; VertexIndexMap = vec_adj_list_vertex_id_map, long unsigned int>]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/is_kuratowski_subgraph.hpp:290:34: required from ‘bool boost::is_kuratowski_subgraph(const Graph&, ForwardIterator, ForwardIterator) [with Graph = adjacency_list, property >; ForwardIterator = __gnu_cxx::__normal_iterator*, std::vector > >]’ planar.cpp:435:37: required from here /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::SinglePassRangeConcept >]’ 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ^ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements > > >]’: /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:137:5: required from ‘struct boost::DefaultConstructible<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/range/concepts.hpp:181:16: required from ‘struct boost::range_detail::ForwardIteratorConcept<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::range_detail::ForwardIteratorConcept<__gnu_cxx::__normal_iterator > >]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied > > >::value’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied > > >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:72:8: [ skipping 11 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/isomorphism.hpp:651:42: required from ‘bool boost::graph::detail::isomorphism_impl::operator()(const Graph1&, const Graph2&, const ArgPack&) const [with ArgPack = boost::parameter::aux::empty_arg_list; Graph1 = boost::adjacency_list; Graph2 = boost::adjacency_list]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/isomorphism.hpp:662:5: required from ‘typename boost::result_of(Param0, Param1, const ArgPack&)>::type boost::graph::isomorphism_with_named_params(const Param0&, const Param1&, const ArgPack&) [with Param0 = boost::adjacency_list; Param1 = boost::adjacency_list; ArgPack = boost::parameter::aux::empty_arg_list; typename boost::result_of(Param0, Param1, const ArgPack&)>::type = bool]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/isomorphism.hpp:666:1: required from ‘typename boost::result_of(Param0, Param1, const boost::parameter::aux::empty_arg_list&)>::type boost::isomorphism(const Param0&, const Param1&) [with Param0 = adjacency_list; Param1 = adjacency_list; typename result_of(Param0, Param1, const parameter::aux::empty_arg_list&)>::type = bool]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/is_kuratowski_subgraph.hpp:278:34: required from ‘bool boost::is_kuratowski_subgraph(const Graph&, ForwardIterator, ForwardIterator, VertexIndexMap) [with Graph = adjacency_list, property >; ForwardIterator = __gnu_cxx::__normal_iterator*, std::vector > >; VertexIndexMap = vec_adj_list_vertex_id_map, long unsigned int>]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/is_kuratowski_subgraph.hpp:290:34: required from ‘bool boost::is_kuratowski_subgraph(const Graph&, ForwardIterator, ForwardIterator) [with Graph = adjacency_list, property >; ForwardIterator = __gnu_cxx::__normal_iterator*, std::vector > >]’ planar.cpp:435:37: required from here /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::DefaultConstructible<__gnu_cxx::__normal_iterator > >]’ 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ^ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements >]’: /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:208:5: required from ‘struct boost::Convertible’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::Convertible]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied >::value’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_)>’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/range/concepts.hpp:191:13: [ skipping 15 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/isomorphism.hpp:651:42: required from ‘bool boost::graph::detail::isomorphism_impl::operator()(const Graph1&, const Graph2&, const ArgPack&) const [with ArgPack = boost::parameter::aux::empty_arg_list; Graph1 = boost::adjacency_list; Graph2 = boost::adjacency_list]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/isomorphism.hpp:662:5: required from ‘typename boost::result_of(Param0, Param1, const ArgPack&)>::type boost::graph::isomorphism_with_named_params(const Param0&, const Param1&, const ArgPack&) [with Param0 = boost::adjacency_list; Param1 = boost::adjacency_list; ArgPack = boost::parameter::aux::empty_arg_list; typename boost::result_of(Param0, Param1, const ArgPack&)>::type = bool]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/isomorphism.hpp:666:1: required from ‘typename boost::result_of(Param0, Param1, const boost::parameter::aux::empty_arg_list&)>::type boost::isomorphism(const Param0&, const Param1&) [with Param0 = adjacency_list; Param1 = adjacency_list; typename result_of(Param0, Param1, const parameter::aux::empty_arg_list&)>::type = bool]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/is_kuratowski_subgraph.hpp:278:34: required from ‘bool boost::is_kuratowski_subgraph(const Graph&, ForwardIterator, ForwardIterator, VertexIndexMap) [with Graph = adjacency_list, property >; ForwardIterator = __gnu_cxx::__normal_iterator*, std::vector > >; VertexIndexMap = vec_adj_list_vertex_id_map, long unsigned int>]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/is_kuratowski_subgraph.hpp:290:34: required from ‘bool boost::is_kuratowski_subgraph(const Graph&, ForwardIterator, ForwardIterator) [with Graph = adjacency_list, property >; ForwardIterator = __gnu_cxx::__normal_iterator*, std::vector > >]’ planar.cpp:435:37: required from here /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::Convertible]’ 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ^ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::Convertible]’: /home/omnipath/local/R/4.4-3.20/BH/include/boost/range/concepts.hpp:191:13: required from ‘struct boost::range_detail::ForwardIteratorConcept<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::range_detail::ForwardIteratorConcept<__gnu_cxx::__normal_iterator > >]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied > > >::value’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied > > >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_ > >)>’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/range/concepts.hpp:321:9: [ skipping 10 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/isomorphism.hpp:651:42: required from ‘bool boost::graph::detail::isomorphism_impl::operator()(const Graph1&, const Graph2&, const ArgPack&) const [with ArgPack = boost::parameter::aux::empty_arg_list; Graph1 = boost::adjacency_list; Graph2 = boost::adjacency_list]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/isomorphism.hpp:662:5: required from ‘typename boost::result_of(Param0, Param1, const ArgPack&)>::type boost::graph::isomorphism_with_named_params(const Param0&, const Param1&, const ArgPack&) [with Param0 = boost::adjacency_list; Param1 = boost::adjacency_list; ArgPack = boost::parameter::aux::empty_arg_list; typename boost::result_of(Param0, Param1, const ArgPack&)>::type = bool]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/isomorphism.hpp:666:1: required from ‘typename boost::result_of(Param0, Param1, const boost::parameter::aux::empty_arg_list&)>::type boost::isomorphism(const Param0&, const Param1&) [with Param0 = adjacency_list; Param1 = adjacency_list; typename result_of(Param0, Param1, const parameter::aux::empty_arg_list&)>::type = bool]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/is_kuratowski_subgraph.hpp:278:34: required from ‘bool boost::is_kuratowski_subgraph(const Graph&, ForwardIterator, ForwardIterator, VertexIndexMap) [with Graph = adjacency_list, property >; ForwardIterator = __gnu_cxx::__normal_iterator*, std::vector > >; VertexIndexMap = vec_adj_list_vertex_id_map, long unsigned int>]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/is_kuratowski_subgraph.hpp:290:34: required from ‘bool boost::is_kuratowski_subgraph(const Graph&, ForwardIterator, ForwardIterator) [with Graph = adjacency_list, property >; ForwardIterator = __gnu_cxx::__normal_iterator*, std::vector > >]’ planar.cpp:435:37: required from here /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::Convertible::~Convertible() [with X = boost::iterators::random_access_traversal_tag; Y = boost::iterators::forward_traversal_tag]’ 37 | ~model() | ^ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:208:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 208 | BOOST_CONCEPT_USAGE(Convertible) { | ^~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements > > >]’: /home/omnipath/local/R/4.4-3.20/BH/include/boost/range/concepts.hpp:197:13: required from ‘struct boost::range_detail::ForwardIteratorConcept<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::range_detail::ForwardIteratorConcept<__gnu_cxx::__normal_iterator > >]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied > > >::value’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied > > >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_ > >)>’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/range/concepts.hpp:321:9: [ skipping 10 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/isomorphism.hpp:651:42: required from ‘bool boost::graph::detail::isomorphism_impl::operator()(const Graph1&, const Graph2&, const ArgPack&) const [with ArgPack = boost::parameter::aux::empty_arg_list; Graph1 = boost::adjacency_list; Graph2 = boost::adjacency_list]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/isomorphism.hpp:662:5: required from ‘typename boost::result_of(Param0, Param1, const ArgPack&)>::type boost::graph::isomorphism_with_named_params(const Param0&, const Param1&, const ArgPack&) [with Param0 = boost::adjacency_list; Param1 = boost::adjacency_list; ArgPack = boost::parameter::aux::empty_arg_list; typename boost::result_of(Param0, Param1, const ArgPack&)>::type = bool]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/isomorphism.hpp:666:1: required from ‘typename boost::result_of(Param0, Param1, const boost::parameter::aux::empty_arg_list&)>::type boost::isomorphism(const Param0&, const Param1&) [with Param0 = adjacency_list; Param1 = adjacency_list; typename result_of(Param0, Param1, const parameter::aux::empty_arg_list&)>::type = bool]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/is_kuratowski_subgraph.hpp:278:34: required from ‘bool boost::is_kuratowski_subgraph(const Graph&, ForwardIterator, ForwardIterator, VertexIndexMap) [with Graph = adjacency_list, property >; ForwardIterator = __gnu_cxx::__normal_iterator*, std::vector > >; VertexIndexMap = vec_adj_list_vertex_id_map, long unsigned int>]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/is_kuratowski_subgraph.hpp:290:34: required from ‘bool boost::is_kuratowski_subgraph(const Graph&, ForwardIterator, ForwardIterator) [with Graph = adjacency_list, property >; ForwardIterator = __gnu_cxx::__normal_iterator*, std::vector > >]’ planar.cpp:435:37: required from here /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::range_detail::ForwardIteratorConcept<__gnu_cxx::__normal_iterator > >]’ 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ^ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::range_detail::ForwardIteratorConcept<__gnu_cxx::__normal_iterator > >]’: /home/omnipath/local/R/4.4-3.20/BH/include/boost/range/concepts.hpp:321:9: required from ‘struct boost::ForwardRangeConcept >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/range/concepts.hpp:352:12: required from ‘struct boost::BidirectionalRangeConcept >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/range/concepts.hpp:370:12: required from ‘struct boost::RandomAccessRangeConcept >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::RandomAccessRangeConcept >]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied > >::value’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:45:51: [ skipping 5 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/isomorphism.hpp:651:42: required from ‘bool boost::graph::detail::isomorphism_impl::operator()(const Graph1&, const Graph2&, const ArgPack&) const [with ArgPack = boost::parameter::aux::empty_arg_list; Graph1 = boost::adjacency_list; Graph2 = boost::adjacency_list]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/isomorphism.hpp:662:5: required from ‘typename boost::result_of(Param0, Param1, const ArgPack&)>::type boost::graph::isomorphism_with_named_params(const Param0&, const Param1&, const ArgPack&) [with Param0 = boost::adjacency_list; Param1 = boost::adjacency_list; ArgPack = boost::parameter::aux::empty_arg_list; typename boost::result_of(Param0, Param1, const ArgPack&)>::type = bool]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/isomorphism.hpp:666:1: required from ‘typename boost::result_of(Param0, Param1, const boost::parameter::aux::empty_arg_list&)>::type boost::isomorphism(const Param0&, const Param1&) [with Param0 = adjacency_list; Param1 = adjacency_list; typename result_of(Param0, Param1, const parameter::aux::empty_arg_list&)>::type = bool]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/is_kuratowski_subgraph.hpp:278:34: required from ‘bool boost::is_kuratowski_subgraph(const Graph&, ForwardIterator, ForwardIterator, VertexIndexMap) [with Graph = adjacency_list, property >; ForwardIterator = __gnu_cxx::__normal_iterator*, std::vector > >; VertexIndexMap = vec_adj_list_vertex_id_map, long unsigned int>]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/is_kuratowski_subgraph.hpp:290:34: required from ‘bool boost::is_kuratowski_subgraph(const Graph&, ForwardIterator, ForwardIterator) [with Graph = adjacency_list, property >; ForwardIterator = __gnu_cxx::__normal_iterator*, std::vector > >]’ planar.cpp:435:37: required from here /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::range_detail::ForwardIteratorConcept::~ForwardIteratorConcept() [with Iterator = __gnu_cxx::__normal_iterator >]’ 37 | ~model() | ^ /home/omnipath/local/R/4.4-3.20/BH/include/boost/range/concepts.hpp:197:13: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 197 | BOOST_CONCEPT_USAGE(ForwardIteratorConcept) | ^~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements > > >]’: /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:137:5: required from ‘struct boost::DefaultConstructible<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/range/concepts.hpp:181:16: required from ‘struct boost::range_detail::ForwardIteratorConcept<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::range_detail::ForwardIteratorConcept<__gnu_cxx::__normal_iterator > >]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied > > >::value’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied > > >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:72:8: [ skipping 11 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/isomorphism.hpp:651:42: required from ‘bool boost::graph::detail::isomorphism_impl::operator()(const Graph1&, const Graph2&, const ArgPack&) const [with ArgPack = boost::parameter::aux::empty_arg_list; Graph1 = boost::adjacency_list; Graph2 = boost::adjacency_list]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/isomorphism.hpp:662:5: required from ‘typename boost::result_of(Param0, Param1, const ArgPack&)>::type boost::graph::isomorphism_with_named_params(const Param0&, const Param1&, const ArgPack&) [with Param0 = boost::adjacency_list; Param1 = boost::adjacency_list; ArgPack = boost::parameter::aux::empty_arg_list; typename boost::result_of(Param0, Param1, const ArgPack&)>::type = bool]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/isomorphism.hpp:666:1: required from ‘typename boost::result_of(Param0, Param1, const boost::parameter::aux::empty_arg_list&)>::type boost::isomorphism(const Param0&, const Param1&) [with Param0 = adjacency_list; Param1 = adjacency_list; typename result_of(Param0, Param1, const parameter::aux::empty_arg_list&)>::type = bool]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/is_kuratowski_subgraph.hpp:278:34: required from ‘bool boost::is_kuratowski_subgraph(const Graph&, ForwardIterator, ForwardIterator, VertexIndexMap) [with Graph = adjacency_list, property >; ForwardIterator = __gnu_cxx::__normal_iterator*, std::vector > >; VertexIndexMap = vec_adj_list_vertex_id_map, long unsigned int>]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/is_kuratowski_subgraph.hpp:290:34: required from ‘bool boost::is_kuratowski_subgraph(const Graph&, ForwardIterator, ForwardIterator) [with Graph = adjacency_list, property >; ForwardIterator = __gnu_cxx::__normal_iterator*, std::vector > >]’ planar.cpp:435:37: required from here /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::DefaultConstructible<__gnu_cxx::__normal_iterator > >]’ 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ^ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements > > >]’: /home/omnipath/local/R/4.4-3.20/BH/include/boost/range/concepts.hpp:197:13: required from ‘struct boost::range_detail::ForwardIteratorConcept<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::range_detail::ForwardIteratorConcept<__gnu_cxx::__normal_iterator > >]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied > > >::value’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied > > >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_ > >)>’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/range/concepts.hpp:322:9: [ skipping 10 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/isomorphism.hpp:651:42: required from ‘bool boost::graph::detail::isomorphism_impl::operator()(const Graph1&, const Graph2&, const ArgPack&) const [with ArgPack = boost::parameter::aux::empty_arg_list; Graph1 = boost::adjacency_list; Graph2 = boost::adjacency_list]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/isomorphism.hpp:662:5: required from ‘typename boost::result_of(Param0, Param1, const ArgPack&)>::type boost::graph::isomorphism_with_named_params(const Param0&, const Param1&, const ArgPack&) [with Param0 = boost::adjacency_list; Param1 = boost::adjacency_list; ArgPack = boost::parameter::aux::empty_arg_list; typename boost::result_of(Param0, Param1, const ArgPack&)>::type = bool]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/isomorphism.hpp:666:1: required from ‘typename boost::result_of(Param0, Param1, const boost::parameter::aux::empty_arg_list&)>::type boost::isomorphism(const Param0&, const Param1&) [with Param0 = adjacency_list; Param1 = adjacency_list; typename result_of(Param0, Param1, const parameter::aux::empty_arg_list&)>::type = bool]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/is_kuratowski_subgraph.hpp:278:34: required from ‘bool boost::is_kuratowski_subgraph(const Graph&, ForwardIterator, ForwardIterator, VertexIndexMap) [with Graph = adjacency_list, property >; ForwardIterator = __gnu_cxx::__normal_iterator*, std::vector > >; VertexIndexMap = vec_adj_list_vertex_id_map, long unsigned int>]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/is_kuratowski_subgraph.hpp:290:34: required from ‘bool boost::is_kuratowski_subgraph(const Graph&, ForwardIterator, ForwardIterator) [with Graph = adjacency_list, property >; ForwardIterator = __gnu_cxx::__normal_iterator*, std::vector > >]’ planar.cpp:435:37: required from here /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::range_detail::ForwardIteratorConcept<__gnu_cxx::__normal_iterator > >]’ 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ^ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::range_detail::ForwardIteratorConcept<__gnu_cxx::__normal_iterator > >]’: /home/omnipath/local/R/4.4-3.20/BH/include/boost/range/concepts.hpp:322:9: required from ‘struct boost::ForwardRangeConcept >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/range/concepts.hpp:352:12: required from ‘struct boost::BidirectionalRangeConcept >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/range/concepts.hpp:370:12: required from ‘struct boost::RandomAccessRangeConcept >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::RandomAccessRangeConcept >]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied > >::value’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:45:51: [ skipping 5 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/isomorphism.hpp:651:42: required from ‘bool boost::graph::detail::isomorphism_impl::operator()(const Graph1&, const Graph2&, const ArgPack&) const [with ArgPack = boost::parameter::aux::empty_arg_list; Graph1 = boost::adjacency_list; Graph2 = boost::adjacency_list]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/isomorphism.hpp:662:5: required from ‘typename boost::result_of(Param0, Param1, const ArgPack&)>::type boost::graph::isomorphism_with_named_params(const Param0&, const Param1&, const ArgPack&) [with Param0 = boost::adjacency_list; Param1 = boost::adjacency_list; ArgPack = boost::parameter::aux::empty_arg_list; typename boost::result_of(Param0, Param1, const ArgPack&)>::type = bool]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/isomorphism.hpp:666:1: required from ‘typename boost::result_of(Param0, Param1, const boost::parameter::aux::empty_arg_list&)>::type boost::isomorphism(const Param0&, const Param1&) [with Param0 = adjacency_list; Param1 = adjacency_list; typename result_of(Param0, Param1, const parameter::aux::empty_arg_list&)>::type = bool]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/is_kuratowski_subgraph.hpp:278:34: required from ‘bool boost::is_kuratowski_subgraph(const Graph&, ForwardIterator, ForwardIterator, VertexIndexMap) [with Graph = adjacency_list, property >; ForwardIterator = __gnu_cxx::__normal_iterator*, std::vector > >; VertexIndexMap = vec_adj_list_vertex_id_map, long unsigned int>]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/is_kuratowski_subgraph.hpp:290:34: required from ‘bool boost::is_kuratowski_subgraph(const Graph&, ForwardIterator, ForwardIterator) [with Graph = adjacency_list, property >; ForwardIterator = __gnu_cxx::__normal_iterator*, std::vector > >]’ planar.cpp:435:37: required from here /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::range_detail::ForwardIteratorConcept::~ForwardIteratorConcept() [with Iterator = __gnu_cxx::__normal_iterator >]’ 37 | ~model() | ^ /home/omnipath/local/R/4.4-3.20/BH/include/boost/range/concepts.hpp:197:13: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 197 | BOOST_CONCEPT_USAGE(ForwardIteratorConcept) | ^~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements >]’: /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:208:5: required from ‘struct boost::Convertible’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::Convertible]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied >::value’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_)>’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/range/concepts.hpp:218:14: [ skipping 14 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/isomorphism.hpp:651:42: required from ‘bool boost::graph::detail::isomorphism_impl::operator()(const Graph1&, const Graph2&, const ArgPack&) const [with ArgPack = boost::parameter::aux::empty_arg_list; Graph1 = boost::adjacency_list; Graph2 = boost::adjacency_list]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/isomorphism.hpp:662:5: required from ‘typename boost::result_of(Param0, Param1, const ArgPack&)>::type boost::graph::isomorphism_with_named_params(const Param0&, const Param1&, const ArgPack&) [with Param0 = boost::adjacency_list; Param1 = boost::adjacency_list; ArgPack = boost::parameter::aux::empty_arg_list; typename boost::result_of(Param0, Param1, const ArgPack&)>::type = bool]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/isomorphism.hpp:666:1: required from ‘typename boost::result_of(Param0, Param1, const boost::parameter::aux::empty_arg_list&)>::type boost::isomorphism(const Param0&, const Param1&) [with Param0 = adjacency_list; Param1 = adjacency_list; typename result_of(Param0, Param1, const parameter::aux::empty_arg_list&)>::type = bool]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/is_kuratowski_subgraph.hpp:278:34: required from ‘bool boost::is_kuratowski_subgraph(const Graph&, ForwardIterator, ForwardIterator, VertexIndexMap) [with Graph = adjacency_list, property >; ForwardIterator = __gnu_cxx::__normal_iterator*, std::vector > >; VertexIndexMap = vec_adj_list_vertex_id_map, long unsigned int>]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/is_kuratowski_subgraph.hpp:290:34: required from ‘bool boost::is_kuratowski_subgraph(const Graph&, ForwardIterator, ForwardIterator) [with Graph = adjacency_list, property >; ForwardIterator = __gnu_cxx::__normal_iterator*, std::vector > >]’ planar.cpp:435:37: required from here /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::Convertible]’ 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ^ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::Convertible]’: /home/omnipath/local/R/4.4-3.20/BH/include/boost/range/concepts.hpp:218:14: required from ‘struct boost::range_detail::BidirectionalIteratorConcept<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::range_detail::BidirectionalIteratorConcept<__gnu_cxx::__normal_iterator > >]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied > > >::value’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied > > >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_ > >)>’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/range/concepts.hpp:355:9: [ skipping 9 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/isomorphism.hpp:651:42: required from ‘bool boost::graph::detail::isomorphism_impl::operator()(const Graph1&, const Graph2&, const ArgPack&) const [with ArgPack = boost::parameter::aux::empty_arg_list; Graph1 = boost::adjacency_list; Graph2 = boost::adjacency_list]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/isomorphism.hpp:662:5: required from ‘typename boost::result_of(Param0, Param1, const ArgPack&)>::type boost::graph::isomorphism_with_named_params(const Param0&, const Param1&, const ArgPack&) [with Param0 = boost::adjacency_list; Param1 = boost::adjacency_list; ArgPack = boost::parameter::aux::empty_arg_list; typename boost::result_of(Param0, Param1, const ArgPack&)>::type = bool]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/isomorphism.hpp:666:1: required from ‘typename boost::result_of(Param0, Param1, const boost::parameter::aux::empty_arg_list&)>::type boost::isomorphism(const Param0&, const Param1&) [with Param0 = adjacency_list; Param1 = adjacency_list; typename result_of(Param0, Param1, const parameter::aux::empty_arg_list&)>::type = bool]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/is_kuratowski_subgraph.hpp:278:34: required from ‘bool boost::is_kuratowski_subgraph(const Graph&, ForwardIterator, ForwardIterator, VertexIndexMap) [with Graph = adjacency_list, property >; ForwardIterator = __gnu_cxx::__normal_iterator*, std::vector > >; VertexIndexMap = vec_adj_list_vertex_id_map, long unsigned int>]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/is_kuratowski_subgraph.hpp:290:34: required from ‘bool boost::is_kuratowski_subgraph(const Graph&, ForwardIterator, ForwardIterator) [with Graph = adjacency_list, property >; ForwardIterator = __gnu_cxx::__normal_iterator*, std::vector > >]’ planar.cpp:435:37: required from here /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::Convertible::~Convertible() [with X = boost::iterators::random_access_traversal_tag; Y = boost::iterators::bidirectional_traversal_tag]’ 37 | ~model() | ^ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:208:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 208 | BOOST_CONCEPT_USAGE(Convertible) { | ^~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements > > >]’: /home/omnipath/local/R/4.4-3.20/BH/include/boost/range/concepts.hpp:224:14: required from ‘struct boost::range_detail::BidirectionalIteratorConcept<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::range_detail::BidirectionalIteratorConcept<__gnu_cxx::__normal_iterator > >]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied > > >::value’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied > > >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_ > >)>’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/range/concepts.hpp:355:9: [ skipping 9 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/isomorphism.hpp:651:42: required from ‘bool boost::graph::detail::isomorphism_impl::operator()(const Graph1&, const Graph2&, const ArgPack&) const [with ArgPack = boost::parameter::aux::empty_arg_list; Graph1 = boost::adjacency_list; Graph2 = boost::adjacency_list]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/isomorphism.hpp:662:5: required from ‘typename boost::result_of(Param0, Param1, const ArgPack&)>::type boost::graph::isomorphism_with_named_params(const Param0&, const Param1&, const ArgPack&) [with Param0 = boost::adjacency_list; Param1 = boost::adjacency_list; ArgPack = boost::parameter::aux::empty_arg_list; typename boost::result_of(Param0, Param1, const ArgPack&)>::type = bool]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/isomorphism.hpp:666:1: required from ‘typename boost::result_of(Param0, Param1, const boost::parameter::aux::empty_arg_list&)>::type boost::isomorphism(const Param0&, const Param1&) [with Param0 = adjacency_list; Param1 = adjacency_list; typename result_of(Param0, Param1, const parameter::aux::empty_arg_list&)>::type = bool]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/is_kuratowski_subgraph.hpp:278:34: required from ‘bool boost::is_kuratowski_subgraph(const Graph&, ForwardIterator, ForwardIterator, VertexIndexMap) [with Graph = adjacency_list, property >; ForwardIterator = __gnu_cxx::__normal_iterator*, std::vector > >; VertexIndexMap = vec_adj_list_vertex_id_map, long unsigned int>]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/is_kuratowski_subgraph.hpp:290:34: required from ‘bool boost::is_kuratowski_subgraph(const Graph&, ForwardIterator, ForwardIterator) [with Graph = adjacency_list, property >; ForwardIterator = __gnu_cxx::__normal_iterator*, std::vector > >]’ planar.cpp:435:37: required from here /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::range_detail::BidirectionalIteratorConcept<__gnu_cxx::__normal_iterator > >]’ 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ^ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::range_detail::BidirectionalIteratorConcept<__gnu_cxx::__normal_iterator > >]’: /home/omnipath/local/R/4.4-3.20/BH/include/boost/range/concepts.hpp:355:9: required from ‘struct boost::BidirectionalRangeConcept >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/range/concepts.hpp:370:12: required from ‘struct boost::RandomAccessRangeConcept >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::RandomAccessRangeConcept >]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied > >::value’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied > >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:72:8: [ skipping 4 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/isomorphism.hpp:651:42: required from ‘bool boost::graph::detail::isomorphism_impl::operator()(const Graph1&, const Graph2&, const ArgPack&) const [with ArgPack = boost::parameter::aux::empty_arg_list; Graph1 = boost::adjacency_list; Graph2 = boost::adjacency_list]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/isomorphism.hpp:662:5: required from ‘typename boost::result_of(Param0, Param1, const ArgPack&)>::type boost::graph::isomorphism_with_named_params(const Param0&, const Param1&, const ArgPack&) [with Param0 = boost::adjacency_list; Param1 = boost::adjacency_list; ArgPack = boost::parameter::aux::empty_arg_list; typename boost::result_of(Param0, Param1, const ArgPack&)>::type = bool]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/isomorphism.hpp:666:1: required from ‘typename boost::result_of(Param0, Param1, const boost::parameter::aux::empty_arg_list&)>::type boost::isomorphism(const Param0&, const Param1&) [with Param0 = adjacency_list; Param1 = adjacency_list; typename result_of(Param0, Param1, const parameter::aux::empty_arg_list&)>::type = bool]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/is_kuratowski_subgraph.hpp:278:34: required from ‘bool boost::is_kuratowski_subgraph(const Graph&, ForwardIterator, ForwardIterator, VertexIndexMap) [with Graph = adjacency_list, property >; ForwardIterator = __gnu_cxx::__normal_iterator*, std::vector > >; VertexIndexMap = vec_adj_list_vertex_id_map, long unsigned int>]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/is_kuratowski_subgraph.hpp:290:34: required from ‘bool boost::is_kuratowski_subgraph(const Graph&, ForwardIterator, ForwardIterator) [with Graph = adjacency_list, property >; ForwardIterator = __gnu_cxx::__normal_iterator*, std::vector > >]’ planar.cpp:435:37: required from here /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::range_detail::BidirectionalIteratorConcept::~BidirectionalIteratorConcept() [with Iterator = __gnu_cxx::__normal_iterator >]’ 37 | ~model() | ^ /home/omnipath/local/R/4.4-3.20/BH/include/boost/range/concepts.hpp:224:14: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 224 | BOOST_CONCEPT_USAGE(BidirectionalIteratorConcept) | ^~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements > > >]’: /home/omnipath/local/R/4.4-3.20/BH/include/boost/range/concepts.hpp:224:14: required from ‘struct boost::range_detail::BidirectionalIteratorConcept<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::range_detail::BidirectionalIteratorConcept<__gnu_cxx::__normal_iterator > >]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied > > >::value’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied > > >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_ > >)>’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/range/concepts.hpp:356:9: [ skipping 9 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/isomorphism.hpp:651:42: required from ‘bool boost::graph::detail::isomorphism_impl::operator()(const Graph1&, const Graph2&, const ArgPack&) const [with ArgPack = boost::parameter::aux::empty_arg_list; Graph1 = boost::adjacency_list; Graph2 = boost::adjacency_list]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/isomorphism.hpp:662:5: required from ‘typename boost::result_of(Param0, Param1, const ArgPack&)>::type boost::graph::isomorphism_with_named_params(const Param0&, const Param1&, const ArgPack&) [with Param0 = boost::adjacency_list; Param1 = boost::adjacency_list; ArgPack = boost::parameter::aux::empty_arg_list; typename boost::result_of(Param0, Param1, const ArgPack&)>::type = bool]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/isomorphism.hpp:666:1: required from ‘typename boost::result_of(Param0, Param1, const boost::parameter::aux::empty_arg_list&)>::type boost::isomorphism(const Param0&, const Param1&) [with Param0 = adjacency_list; Param1 = adjacency_list; typename result_of(Param0, Param1, const parameter::aux::empty_arg_list&)>::type = bool]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/is_kuratowski_subgraph.hpp:278:34: required from ‘bool boost::is_kuratowski_subgraph(const Graph&, ForwardIterator, ForwardIterator, VertexIndexMap) [with Graph = adjacency_list, property >; ForwardIterator = __gnu_cxx::__normal_iterator*, std::vector > >; VertexIndexMap = vec_adj_list_vertex_id_map, long unsigned int>]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/is_kuratowski_subgraph.hpp:290:34: required from ‘bool boost::is_kuratowski_subgraph(const Graph&, ForwardIterator, ForwardIterator) [with Graph = adjacency_list, property >; ForwardIterator = __gnu_cxx::__normal_iterator*, std::vector > >]’ planar.cpp:435:37: required from here /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::range_detail::BidirectionalIteratorConcept<__gnu_cxx::__normal_iterator > >]’ 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ^ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::range_detail::BidirectionalIteratorConcept<__gnu_cxx::__normal_iterator > >]’: /home/omnipath/local/R/4.4-3.20/BH/include/boost/range/concepts.hpp:356:9: required from ‘struct boost::BidirectionalRangeConcept >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/range/concepts.hpp:370:12: required from ‘struct boost::RandomAccessRangeConcept >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::RandomAccessRangeConcept >]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied > >::value’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied > >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:72:8: [ skipping 4 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/isomorphism.hpp:651:42: required from ‘bool boost::graph::detail::isomorphism_impl::operator()(const Graph1&, const Graph2&, const ArgPack&) const [with ArgPack = boost::parameter::aux::empty_arg_list; Graph1 = boost::adjacency_list; Graph2 = boost::adjacency_list]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/isomorphism.hpp:662:5: required from ‘typename boost::result_of(Param0, Param1, const ArgPack&)>::type boost::graph::isomorphism_with_named_params(const Param0&, const Param1&, const ArgPack&) [with Param0 = boost::adjacency_list; Param1 = boost::adjacency_list; ArgPack = boost::parameter::aux::empty_arg_list; typename boost::result_of(Param0, Param1, const ArgPack&)>::type = bool]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/isomorphism.hpp:666:1: required from ‘typename boost::result_of(Param0, Param1, const boost::parameter::aux::empty_arg_list&)>::type boost::isomorphism(const Param0&, const Param1&) [with Param0 = adjacency_list; Param1 = adjacency_list; typename result_of(Param0, Param1, const parameter::aux::empty_arg_list&)>::type = bool]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/is_kuratowski_subgraph.hpp:278:34: required from ‘bool boost::is_kuratowski_subgraph(const Graph&, ForwardIterator, ForwardIterator, VertexIndexMap) [with Graph = adjacency_list, property >; ForwardIterator = __gnu_cxx::__normal_iterator*, std::vector > >; VertexIndexMap = vec_adj_list_vertex_id_map, long unsigned int>]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/is_kuratowski_subgraph.hpp:290:34: required from ‘bool boost::is_kuratowski_subgraph(const Graph&, ForwardIterator, ForwardIterator) [with Graph = adjacency_list, property >; ForwardIterator = __gnu_cxx::__normal_iterator*, std::vector > >]’ planar.cpp:435:37: required from here /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::range_detail::BidirectionalIteratorConcept::~BidirectionalIteratorConcept() [with Iterator = __gnu_cxx::__normal_iterator >]’ 37 | ~model() | ^ /home/omnipath/local/R/4.4-3.20/BH/include/boost/range/concepts.hpp:224:14: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 224 | BOOST_CONCEPT_USAGE(BidirectionalIteratorConcept) | ^~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements >]’: /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:208:5: required from ‘struct boost::Convertible’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::Convertible]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied >::value’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_)>’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/range/concepts.hpp:239:14: [ skipping 13 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/isomorphism.hpp:651:42: required from ‘bool boost::graph::detail::isomorphism_impl::operator()(const Graph1&, const Graph2&, const ArgPack&) const [with ArgPack = boost::parameter::aux::empty_arg_list; Graph1 = boost::adjacency_list; Graph2 = boost::adjacency_list]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/isomorphism.hpp:662:5: required from ‘typename boost::result_of(Param0, Param1, const ArgPack&)>::type boost::graph::isomorphism_with_named_params(const Param0&, const Param1&, const ArgPack&) [with Param0 = boost::adjacency_list; Param1 = boost::adjacency_list; ArgPack = boost::parameter::aux::empty_arg_list; typename boost::result_of(Param0, Param1, const ArgPack&)>::type = bool]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/isomorphism.hpp:666:1: required from ‘typename boost::result_of(Param0, Param1, const boost::parameter::aux::empty_arg_list&)>::type boost::isomorphism(const Param0&, const Param1&) [with Param0 = adjacency_list; Param1 = adjacency_list; typename result_of(Param0, Param1, const parameter::aux::empty_arg_list&)>::type = bool]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/is_kuratowski_subgraph.hpp:278:34: required from ‘bool boost::is_kuratowski_subgraph(const Graph&, ForwardIterator, ForwardIterator, VertexIndexMap) [with Graph = adjacency_list, property >; ForwardIterator = __gnu_cxx::__normal_iterator*, std::vector > >; VertexIndexMap = vec_adj_list_vertex_id_map, long unsigned int>]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/is_kuratowski_subgraph.hpp:290:34: required from ‘bool boost::is_kuratowski_subgraph(const Graph&, ForwardIterator, ForwardIterator) [with Graph = adjacency_list, property >; ForwardIterator = __gnu_cxx::__normal_iterator*, std::vector > >]’ planar.cpp:435:37: required from here /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::Convertible]’ 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ^ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::Convertible]’: /home/omnipath/local/R/4.4-3.20/BH/include/boost/range/concepts.hpp:239:14: required from ‘struct boost::range_detail::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::range_detail::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator > >]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied > > >::value’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied > > >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_ > >)>’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/range/concepts.hpp:373:9: [ skipping 8 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/isomorphism.hpp:651:42: required from ‘bool boost::graph::detail::isomorphism_impl::operator()(const Graph1&, const Graph2&, const ArgPack&) const [with ArgPack = boost::parameter::aux::empty_arg_list; Graph1 = boost::adjacency_list; Graph2 = boost::adjacency_list]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/isomorphism.hpp:662:5: required from ‘typename boost::result_of(Param0, Param1, const ArgPack&)>::type boost::graph::isomorphism_with_named_params(const Param0&, const Param1&, const ArgPack&) [with Param0 = boost::adjacency_list; Param1 = boost::adjacency_list; ArgPack = boost::parameter::aux::empty_arg_list; typename boost::result_of(Param0, Param1, const ArgPack&)>::type = bool]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/isomorphism.hpp:666:1: required from ‘typename boost::result_of(Param0, Param1, const boost::parameter::aux::empty_arg_list&)>::type boost::isomorphism(const Param0&, const Param1&) [with Param0 = adjacency_list; Param1 = adjacency_list; typename result_of(Param0, Param1, const parameter::aux::empty_arg_list&)>::type = bool]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/is_kuratowski_subgraph.hpp:278:34: required from ‘bool boost::is_kuratowski_subgraph(const Graph&, ForwardIterator, ForwardIterator, VertexIndexMap) [with Graph = adjacency_list, property >; ForwardIterator = __gnu_cxx::__normal_iterator*, std::vector > >; VertexIndexMap = vec_adj_list_vertex_id_map, long unsigned int>]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/is_kuratowski_subgraph.hpp:290:34: required from ‘bool boost::is_kuratowski_subgraph(const Graph&, ForwardIterator, ForwardIterator) [with Graph = adjacency_list, property >; ForwardIterator = __gnu_cxx::__normal_iterator*, std::vector > >]’ planar.cpp:435:37: required from here /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::Convertible::~Convertible() [with X = boost::iterators::random_access_traversal_tag; Y = boost::iterators::random_access_traversal_tag]’ 37 | ~model() | ^ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:208:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 208 | BOOST_CONCEPT_USAGE(Convertible) { | ^~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements > > >]’: /home/omnipath/local/R/4.4-3.20/BH/include/boost/range/concepts.hpp:245:14: required from ‘struct boost::range_detail::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::range_detail::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator > >]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied > > >::value’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied > > >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_ > >)>’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/range/concepts.hpp:373:9: [ skipping 8 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/isomorphism.hpp:651:42: required from ‘bool boost::graph::detail::isomorphism_impl::operator()(const Graph1&, const Graph2&, const ArgPack&) const [with ArgPack = boost::parameter::aux::empty_arg_list; Graph1 = boost::adjacency_list; Graph2 = boost::adjacency_list]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/isomorphism.hpp:662:5: required from ‘typename boost::result_of(Param0, Param1, const ArgPack&)>::type boost::graph::isomorphism_with_named_params(const Param0&, const Param1&, const ArgPack&) [with Param0 = boost::adjacency_list; Param1 = boost::adjacency_list; ArgPack = boost::parameter::aux::empty_arg_list; typename boost::result_of(Param0, Param1, const ArgPack&)>::type = bool]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/isomorphism.hpp:666:1: required from ‘typename boost::result_of(Param0, Param1, const boost::parameter::aux::empty_arg_list&)>::type boost::isomorphism(const Param0&, const Param1&) [with Param0 = adjacency_list; Param1 = adjacency_list; typename result_of(Param0, Param1, const parameter::aux::empty_arg_list&)>::type = bool]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/is_kuratowski_subgraph.hpp:278:34: required from ‘bool boost::is_kuratowski_subgraph(const Graph&, ForwardIterator, ForwardIterator, VertexIndexMap) [with Graph = adjacency_list, property >; ForwardIterator = __gnu_cxx::__normal_iterator*, std::vector > >; VertexIndexMap = vec_adj_list_vertex_id_map, long unsigned int>]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/is_kuratowski_subgraph.hpp:290:34: required from ‘bool boost::is_kuratowski_subgraph(const Graph&, ForwardIterator, ForwardIterator) [with Graph = adjacency_list, property >; ForwardIterator = __gnu_cxx::__normal_iterator*, std::vector > >]’ planar.cpp:435:37: required from here /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::range_detail::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator > >]’ 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ^ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::range_detail::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator > >]’: /home/omnipath/local/R/4.4-3.20/BH/include/boost/range/concepts.hpp:373:9: required from ‘struct boost::RandomAccessRangeConcept >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::RandomAccessRangeConcept >]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied > >::value’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied > >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_ >)>’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/range/algorithm/sort.hpp:32:5: [ skipping 3 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/isomorphism.hpp:651:42: required from ‘bool boost::graph::detail::isomorphism_impl::operator()(const Graph1&, const Graph2&, const ArgPack&) const [with ArgPack = boost::parameter::aux::empty_arg_list; Graph1 = boost::adjacency_list; Graph2 = boost::adjacency_list]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/isomorphism.hpp:662:5: required from ‘typename boost::result_of(Param0, Param1, const ArgPack&)>::type boost::graph::isomorphism_with_named_params(const Param0&, const Param1&, const ArgPack&) [with Param0 = boost::adjacency_list; Param1 = boost::adjacency_list; ArgPack = boost::parameter::aux::empty_arg_list; typename boost::result_of(Param0, Param1, const ArgPack&)>::type = bool]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/isomorphism.hpp:666:1: required from ‘typename boost::result_of(Param0, Param1, const boost::parameter::aux::empty_arg_list&)>::type boost::isomorphism(const Param0&, const Param1&) [with Param0 = adjacency_list; Param1 = adjacency_list; typename result_of(Param0, Param1, const parameter::aux::empty_arg_list&)>::type = bool]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/is_kuratowski_subgraph.hpp:278:34: required from ‘bool boost::is_kuratowski_subgraph(const Graph&, ForwardIterator, ForwardIterator, VertexIndexMap) [with Graph = adjacency_list, property >; ForwardIterator = __gnu_cxx::__normal_iterator*, std::vector > >; VertexIndexMap = vec_adj_list_vertex_id_map, long unsigned int>]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/is_kuratowski_subgraph.hpp:290:34: required from ‘bool boost::is_kuratowski_subgraph(const Graph&, ForwardIterator, ForwardIterator) [with Graph = adjacency_list, property >; ForwardIterator = __gnu_cxx::__normal_iterator*, std::vector > >]’ planar.cpp:435:37: required from here /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::range_detail::RandomAccessIteratorConcept::~RandomAccessIteratorConcept() [with Iterator = __gnu_cxx::__normal_iterator >]’ 37 | ~model() | ^ /home/omnipath/local/R/4.4-3.20/BH/include/boost/range/concepts.hpp:245:14: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 245 | BOOST_CONCEPT_USAGE(RandomAccessIteratorConcept) | ^~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements > > >]’: /home/omnipath/local/R/4.4-3.20/BH/include/boost/range/concepts.hpp:245:14: required from ‘struct boost::range_detail::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::range_detail::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator > >]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied > > >::value’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied > > >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_ > >)>’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/range/concepts.hpp:374:9: [ skipping 8 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/isomorphism.hpp:651:42: required from ‘bool boost::graph::detail::isomorphism_impl::operator()(const Graph1&, const Graph2&, const ArgPack&) const [with ArgPack = boost::parameter::aux::empty_arg_list; Graph1 = boost::adjacency_list; Graph2 = boost::adjacency_list]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/isomorphism.hpp:662:5: required from ‘typename boost::result_of(Param0, Param1, const ArgPack&)>::type boost::graph::isomorphism_with_named_params(const Param0&, const Param1&, const ArgPack&) [with Param0 = boost::adjacency_list; Param1 = boost::adjacency_list; ArgPack = boost::parameter::aux::empty_arg_list; typename boost::result_of(Param0, Param1, const ArgPack&)>::type = bool]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/isomorphism.hpp:666:1: required from ‘typename boost::result_of(Param0, Param1, const boost::parameter::aux::empty_arg_list&)>::type boost::isomorphism(const Param0&, const Param1&) [with Param0 = adjacency_list; Param1 = adjacency_list; typename result_of(Param0, Param1, const parameter::aux::empty_arg_list&)>::type = bool]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/is_kuratowski_subgraph.hpp:278:34: required from ‘bool boost::is_kuratowski_subgraph(const Graph&, ForwardIterator, ForwardIterator, VertexIndexMap) [with Graph = adjacency_list, property >; ForwardIterator = __gnu_cxx::__normal_iterator*, std::vector > >; VertexIndexMap = vec_adj_list_vertex_id_map, long unsigned int>]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/is_kuratowski_subgraph.hpp:290:34: required from ‘bool boost::is_kuratowski_subgraph(const Graph&, ForwardIterator, ForwardIterator) [with Graph = adjacency_list, property >; ForwardIterator = __gnu_cxx::__normal_iterator*, std::vector > >]’ planar.cpp:435:37: required from here /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::range_detail::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator > >]’ 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ^ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::range_detail::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator > >]’: /home/omnipath/local/R/4.4-3.20/BH/include/boost/range/concepts.hpp:374:9: required from ‘struct boost::RandomAccessRangeConcept >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::RandomAccessRangeConcept >]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied > >::value’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied > >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_ >)>’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/range/algorithm/sort.hpp:32:5: [ skipping 3 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/isomorphism.hpp:651:42: required from ‘bool boost::graph::detail::isomorphism_impl::operator()(const Graph1&, const Graph2&, const ArgPack&) const [with ArgPack = boost::parameter::aux::empty_arg_list; Graph1 = boost::adjacency_list; Graph2 = boost::adjacency_list]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/isomorphism.hpp:662:5: required from ‘typename boost::result_of(Param0, Param1, const ArgPack&)>::type boost::graph::isomorphism_with_named_params(const Param0&, const Param1&, const ArgPack&) [with Param0 = boost::adjacency_list; Param1 = boost::adjacency_list; ArgPack = boost::parameter::aux::empty_arg_list; typename boost::result_of(Param0, Param1, const ArgPack&)>::type = bool]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/isomorphism.hpp:666:1: required from ‘typename boost::result_of(Param0, Param1, const boost::parameter::aux::empty_arg_list&)>::type boost::isomorphism(const Param0&, const Param1&) [with Param0 = adjacency_list; Param1 = adjacency_list; typename result_of(Param0, Param1, const parameter::aux::empty_arg_list&)>::type = bool]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/is_kuratowski_subgraph.hpp:278:34: required from ‘bool boost::is_kuratowski_subgraph(const Graph&, ForwardIterator, ForwardIterator, VertexIndexMap) [with Graph = adjacency_list, property >; ForwardIterator = __gnu_cxx::__normal_iterator*, std::vector > >; VertexIndexMap = vec_adj_list_vertex_id_map, long unsigned int>]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/is_kuratowski_subgraph.hpp:290:34: required from ‘bool boost::is_kuratowski_subgraph(const Graph&, ForwardIterator, ForwardIterator) [with Graph = adjacency_list, property >; ForwardIterator = __gnu_cxx::__normal_iterator*, std::vector > >]’ planar.cpp:435:37: required from here /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::range_detail::RandomAccessIteratorConcept::~RandomAccessIteratorConcept() [with Iterator = __gnu_cxx::__normal_iterator >]’ 37 | ~model() | ^ /home/omnipath/local/R/4.4-3.20/BH/include/boost/range/concepts.hpp:245:14: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 245 | BOOST_CONCEPT_USAGE(RandomAccessIteratorConcept) | ^~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::RandomAccessRangeConcept >]’: /home/omnipath/local/R/4.4-3.20/BH/include/boost/range/algorithm/sort.hpp:32:5: required from ‘RandomAccessRange& boost::range::sort(RandomAccessRange&) [with RandomAccessRange = std::vector]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/isomorphism.hpp:172:21: required from ‘bool boost::detail::isomorphism_algo::test_isomorphism() [with Graph1 = boost::adjacency_list; Graph2 = boost::adjacency_list; IsoMapping = boost::shared_array_property_map >; Invariant1 = boost::degree_vertex_invariant >, boost::adjacency_list >; Invariant2 = boost::degree_vertex_invariant >, boost::adjacency_list >; IndexMap1 = boost::vec_adj_list_vertex_id_map; IndexMap2 = boost::vec_adj_list_vertex_id_map]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/isomorphism.hpp:532:33: required from ‘bool boost::isomorphism(const Graph1&, const Graph2&, IsoMapping, Invariant1, Invariant2, std::size_t, IndexMap1, IndexMap2) [with Graph1 = adjacency_list; Graph2 = adjacency_list; IsoMapping = shared_array_property_map >; Invariant1 = degree_vertex_invariant >, adjacency_list >; Invariant2 = degree_vertex_invariant >, adjacency_list >; IndexMap1 = vec_adj_list_vertex_id_map; IndexMap2 = vec_adj_list_vertex_id_map; std::size_t = long unsigned int]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/isomorphism.hpp:651:42: required from ‘bool boost::graph::detail::isomorphism_impl::operator()(const Graph1&, const Graph2&, const ArgPack&) const [with ArgPack = boost::parameter::aux::empty_arg_list; Graph1 = boost::adjacency_list; Graph2 = boost::adjacency_list]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/isomorphism.hpp:662:5: required from ‘typename boost::result_of(Param0, Param1, const ArgPack&)>::type boost::graph::isomorphism_with_named_params(const Param0&, const Param1&, const ArgPack&) [with Param0 = boost::adjacency_list; Param1 = boost::adjacency_list; ArgPack = boost::parameter::aux::empty_arg_list; typename boost::result_of(Param0, Param1, const ArgPack&)>::type = bool]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/isomorphism.hpp:666:1: required from ‘typename boost::result_of(Param0, Param1, const boost::parameter::aux::empty_arg_list&)>::type boost::isomorphism(const Param0&, const Param1&) [with Param0 = adjacency_list; Param1 = adjacency_list; typename result_of(Param0, Param1, const parameter::aux::empty_arg_list&)>::type = bool]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/is_kuratowski_subgraph.hpp:278:34: required from ‘bool boost::is_kuratowski_subgraph(const Graph&, ForwardIterator, ForwardIterator, VertexIndexMap) [with Graph = adjacency_list, property >; ForwardIterator = __gnu_cxx::__normal_iterator*, std::vector > >; VertexIndexMap = vec_adj_list_vertex_id_map, long unsigned int>]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/is_kuratowski_subgraph.hpp:290:34: required from ‘bool boost::is_kuratowski_subgraph(const Graph&, ForwardIterator, ForwardIterator) [with Graph = adjacency_list, property >; ForwardIterator = __gnu_cxx::__normal_iterator*, std::vector > >]’ planar.cpp:435:37: required from here /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ In file included from /home/omnipath/local/R/4.4-3.20/BH/include/boost/range/size_type.hpp:20, from /home/omnipath/local/R/4.4-3.20/BH/include/boost/range/size.hpp:21, from /home/omnipath/local/R/4.4-3.20/BH/include/boost/range/functions.hpp:20, from /home/omnipath/local/R/4.4-3.20/BH/include/boost/range/iterator_range_core.hpp:38, from /home/omnipath/local/R/4.4-3.20/BH/include/boost/range/iterator_range.hpp:13, from /home/omnipath/local/R/4.4-3.20/BH/include/boost/range/irange.hpp:16, from /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/detail/adjacency_list.hpp:21, from /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/adjacency_list.hpp:255: /home/omnipath/local/R/4.4-3.20/BH/include/boost/range/concepts.hpp:370:12: note: in a call to non-static member function ‘boost::RandomAccessRangeConcept >::~RandomAccessRangeConcept()’ 370 | struct RandomAccessRangeConcept : BidirectionalRangeConcept | ^~~~~~~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements > >]’: /home/omnipath/local/R/4.4-3.20/BH/include/boost/range/concepts.hpp:284:9: required from ‘struct boost::SinglePassRangeConcept >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::SinglePassRangeConcept >]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied > >::value’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied > >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_ >)>’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/range/algorithm/equal.hpp:174:13: [ skipping 3 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/isomorphism.hpp:651:42: required from ‘bool boost::graph::detail::isomorphism_impl::operator()(const Graph1&, const Graph2&, const ArgPack&) const [with ArgPack = boost::parameter::aux::empty_arg_list; Graph1 = boost::adjacency_list; Graph2 = boost::adjacency_list]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/isomorphism.hpp:662:5: required from ‘typename boost::result_of(Param0, Param1, const ArgPack&)>::type boost::graph::isomorphism_with_named_params(const Param0&, const Param1&, const ArgPack&) [with Param0 = boost::adjacency_list; Param1 = boost::adjacency_list; ArgPack = boost::parameter::aux::empty_arg_list; typename boost::result_of(Param0, Param1, const ArgPack&)>::type = bool]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/isomorphism.hpp:666:1: required from ‘typename boost::result_of(Param0, Param1, const boost::parameter::aux::empty_arg_list&)>::type boost::isomorphism(const Param0&, const Param1&) [with Param0 = adjacency_list; Param1 = adjacency_list; typename result_of(Param0, Param1, const parameter::aux::empty_arg_list&)>::type = bool]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/is_kuratowski_subgraph.hpp:278:34: required from ‘bool boost::is_kuratowski_subgraph(const Graph&, ForwardIterator, ForwardIterator, VertexIndexMap) [with Graph = adjacency_list, property >; ForwardIterator = __gnu_cxx::__normal_iterator*, std::vector > >; VertexIndexMap = vec_adj_list_vertex_id_map, long unsigned int>]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/is_kuratowski_subgraph.hpp:290:34: required from ‘bool boost::is_kuratowski_subgraph(const Graph&, ForwardIterator, ForwardIterator) [with Graph = adjacency_list, property >; ForwardIterator = __gnu_cxx::__normal_iterator*, std::vector > >]’ planar.cpp:435:37: required from here /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::SinglePassRangeConcept >]’ 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ^ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::SinglePassRangeConcept >]’: /home/omnipath/local/R/4.4-3.20/BH/include/boost/range/algorithm/equal.hpp:174:13: required from ‘bool boost::range::equal(const SinglePassRange1&, const SinglePassRange2&) [with SinglePassRange1 = std::vector; SinglePassRange2 = std::vector]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/isomorphism.hpp:178:27: required from ‘bool boost::detail::isomorphism_algo::test_isomorphism() [with Graph1 = boost::adjacency_list; Graph2 = boost::adjacency_list; IsoMapping = boost::shared_array_property_map >; Invariant1 = boost::degree_vertex_invariant >, boost::adjacency_list >; Invariant2 = boost::degree_vertex_invariant >, boost::adjacency_list >; IndexMap1 = boost::vec_adj_list_vertex_id_map; IndexMap2 = boost::vec_adj_list_vertex_id_map]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/isomorphism.hpp:532:33: required from ‘bool boost::isomorphism(const Graph1&, const Graph2&, IsoMapping, Invariant1, Invariant2, std::size_t, IndexMap1, IndexMap2) [with Graph1 = adjacency_list; Graph2 = adjacency_list; IsoMapping = shared_array_property_map >; Invariant1 = degree_vertex_invariant >, adjacency_list >; Invariant2 = degree_vertex_invariant >, adjacency_list >; IndexMap1 = vec_adj_list_vertex_id_map; IndexMap2 = vec_adj_list_vertex_id_map; std::size_t = long unsigned int]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/isomorphism.hpp:651:42: required from ‘bool boost::graph::detail::isomorphism_impl::operator()(const Graph1&, const Graph2&, const ArgPack&) const [with ArgPack = boost::parameter::aux::empty_arg_list; Graph1 = boost::adjacency_list; Graph2 = boost::adjacency_list]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/isomorphism.hpp:662:5: required from ‘typename boost::result_of(Param0, Param1, const ArgPack&)>::type boost::graph::isomorphism_with_named_params(const Param0&, const Param1&, const ArgPack&) [with Param0 = boost::adjacency_list; Param1 = boost::adjacency_list; ArgPack = boost::parameter::aux::empty_arg_list; typename boost::result_of(Param0, Param1, const ArgPack&)>::type = bool]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/isomorphism.hpp:666:1: required from ‘typename boost::result_of(Param0, Param1, const boost::parameter::aux::empty_arg_list&)>::type boost::isomorphism(const Param0&, const Param1&) [with Param0 = adjacency_list; Param1 = adjacency_list; typename result_of(Param0, Param1, const parameter::aux::empty_arg_list&)>::type = bool]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/is_kuratowski_subgraph.hpp:278:34: required from ‘bool boost::is_kuratowski_subgraph(const Graph&, ForwardIterator, ForwardIterator, VertexIndexMap) [with Graph = adjacency_list, property >; ForwardIterator = __gnu_cxx::__normal_iterator*, std::vector > >; VertexIndexMap = vec_adj_list_vertex_id_map, long unsigned int>]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/is_kuratowski_subgraph.hpp:290:34: required from ‘bool boost::is_kuratowski_subgraph(const Graph&, ForwardIterator, ForwardIterator) [with Graph = adjacency_list, property >; ForwardIterator = __gnu_cxx::__normal_iterator*, std::vector > >]’ planar.cpp:435:37: required from here /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::SinglePassRangeConcept::~SinglePassRangeConcept() [with T = const std::vector]’ 37 | ~model() | ^ /home/omnipath/local/R/4.4-3.20/BH/include/boost/range/concepts.hpp:284:9: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 284 | BOOST_CONCEPT_USAGE(SinglePassRangeConcept) | ^~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements > > >]’: /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:145:5: required from ‘struct boost::Assignable<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:502:3: required from ‘struct boost::InputIterator<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:540:3: required from ‘struct boost::ForwardIterator<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:568:3: required from ‘struct boost::BidirectionalIterator<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:597:3: required from ‘struct boost::RandomAccessIterator<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:597:3: [ skipping 8 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/isomorphism.hpp:651:42: required from ‘bool boost::graph::detail::isomorphism_impl::operator()(const Graph1&, const Graph2&, const ArgPack&) const [with ArgPack = boost::parameter::aux::empty_arg_list; Graph1 = boost::adjacency_list; Graph2 = boost::adjacency_list]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/isomorphism.hpp:662:5: required from ‘typename boost::result_of(Param0, Param1, const ArgPack&)>::type boost::graph::isomorphism_with_named_params(const Param0&, const Param1&, const ArgPack&) [with Param0 = boost::adjacency_list; Param1 = boost::adjacency_list; ArgPack = boost::parameter::aux::empty_arg_list; typename boost::result_of(Param0, Param1, const ArgPack&)>::type = bool]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/isomorphism.hpp:666:1: required from ‘typename boost::result_of(Param0, Param1, const boost::parameter::aux::empty_arg_list&)>::type boost::isomorphism(const Param0&, const Param1&) [with Param0 = adjacency_list; Param1 = adjacency_list; typename result_of(Param0, Param1, const parameter::aux::empty_arg_list&)>::type = bool]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/is_kuratowski_subgraph.hpp:278:34: required from ‘bool boost::is_kuratowski_subgraph(const Graph&, ForwardIterator, ForwardIterator, VertexIndexMap) [with Graph = adjacency_list, property >; ForwardIterator = __gnu_cxx::__normal_iterator*, std::vector > >; VertexIndexMap = vec_adj_list_vertex_id_map, long unsigned int>]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/is_kuratowski_subgraph.hpp:290:34: required from ‘bool boost::is_kuratowski_subgraph(const Graph&, ForwardIterator, ForwardIterator) [with Graph = adjacency_list, property >; ForwardIterator = __gnu_cxx::__normal_iterator*, std::vector > >]’ planar.cpp:435:37: required from here /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::Assignable<__gnu_cxx::__normal_iterator > >]’ 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ^ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements > > >]’: /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:233:5: required from ‘struct boost::EqualityComparable<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:502:3: required from ‘struct boost::InputIterator<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:540:3: required from ‘struct boost::ForwardIterator<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:568:3: required from ‘struct boost::BidirectionalIterator<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:597:3: required from ‘struct boost::RandomAccessIterator<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:597:3: [ skipping 8 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/isomorphism.hpp:651:42: required from ‘bool boost::graph::detail::isomorphism_impl::operator()(const Graph1&, const Graph2&, const ArgPack&) const [with ArgPack = boost::parameter::aux::empty_arg_list; Graph1 = boost::adjacency_list; Graph2 = boost::adjacency_list]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/isomorphism.hpp:662:5: required from ‘typename boost::result_of(Param0, Param1, const ArgPack&)>::type boost::graph::isomorphism_with_named_params(const Param0&, const Param1&, const ArgPack&) [with Param0 = boost::adjacency_list; Param1 = boost::adjacency_list; ArgPack = boost::parameter::aux::empty_arg_list; typename boost::result_of(Param0, Param1, const ArgPack&)>::type = bool]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/isomorphism.hpp:666:1: required from ‘typename boost::result_of(Param0, Param1, const boost::parameter::aux::empty_arg_list&)>::type boost::isomorphism(const Param0&, const Param1&) [with Param0 = adjacency_list; Param1 = adjacency_list; typename result_of(Param0, Param1, const parameter::aux::empty_arg_list&)>::type = bool]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/is_kuratowski_subgraph.hpp:278:34: required from ‘bool boost::is_kuratowski_subgraph(const Graph&, ForwardIterator, ForwardIterator, VertexIndexMap) [with Graph = adjacency_list, property >; ForwardIterator = __gnu_cxx::__normal_iterator*, std::vector > >; VertexIndexMap = vec_adj_list_vertex_id_map, long unsigned int>]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/is_kuratowski_subgraph.hpp:290:34: required from ‘bool boost::is_kuratowski_subgraph(const Graph&, ForwardIterator, ForwardIterator) [with Graph = adjacency_list, property >; ForwardIterator = __gnu_cxx::__normal_iterator*, std::vector > >]’ planar.cpp:435:37: required from here /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::EqualityComparable<__gnu_cxx::__normal_iterator > >]’ 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ^ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements > > >]’: /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:512:7: required from ‘struct boost::InputIterator<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:540:3: required from ‘struct boost::ForwardIterator<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:568:3: required from ‘struct boost::BidirectionalIterator<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:597:3: required from ‘struct boost::RandomAccessIterator<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:597:3: required from ‘struct boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:32:62: [ skipping 7 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/isomorphism.hpp:651:42: required from ‘bool boost::graph::detail::isomorphism_impl::operator()(const Graph1&, const Graph2&, const ArgPack&) const [with ArgPack = boost::parameter::aux::empty_arg_list; Graph1 = boost::adjacency_list; Graph2 = boost::adjacency_list]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/isomorphism.hpp:662:5: required from ‘typename boost::result_of(Param0, Param1, const ArgPack&)>::type boost::graph::isomorphism_with_named_params(const Param0&, const Param1&, const ArgPack&) [with Param0 = boost::adjacency_list; Param1 = boost::adjacency_list; ArgPack = boost::parameter::aux::empty_arg_list; typename boost::result_of(Param0, Param1, const ArgPack&)>::type = bool]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/isomorphism.hpp:666:1: required from ‘typename boost::result_of(Param0, Param1, const boost::parameter::aux::empty_arg_list&)>::type boost::isomorphism(const Param0&, const Param1&) [with Param0 = adjacency_list; Param1 = adjacency_list; typename result_of(Param0, Param1, const parameter::aux::empty_arg_list&)>::type = bool]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/is_kuratowski_subgraph.hpp:278:34: required from ‘bool boost::is_kuratowski_subgraph(const Graph&, ForwardIterator, ForwardIterator, VertexIndexMap) [with Graph = adjacency_list, property >; ForwardIterator = __gnu_cxx::__normal_iterator*, std::vector > >; VertexIndexMap = vec_adj_list_vertex_id_map, long unsigned int>]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/is_kuratowski_subgraph.hpp:290:34: required from ‘bool boost::is_kuratowski_subgraph(const Graph&, ForwardIterator, ForwardIterator) [with Graph = adjacency_list, property >; ForwardIterator = __gnu_cxx::__normal_iterator*, std::vector > >]’ planar.cpp:435:37: required from here /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::InputIterator<__gnu_cxx::__normal_iterator > >]’ 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ^ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements > > >]’: /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:543:7: required from ‘struct boost::ForwardIterator<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:568:3: required from ‘struct boost::BidirectionalIterator<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:597:3: required from ‘struct boost::RandomAccessIterator<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:597:3: required from ‘struct boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator > >]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:42:5: [ skipping 6 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/isomorphism.hpp:651:42: required from ‘bool boost::graph::detail::isomorphism_impl::operator()(const Graph1&, const Graph2&, const ArgPack&) const [with ArgPack = boost::parameter::aux::empty_arg_list; Graph1 = boost::adjacency_list; Graph2 = boost::adjacency_list]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/isomorphism.hpp:662:5: required from ‘typename boost::result_of(Param0, Param1, const ArgPack&)>::type boost::graph::isomorphism_with_named_params(const Param0&, const Param1&, const ArgPack&) [with Param0 = boost::adjacency_list; Param1 = boost::adjacency_list; ArgPack = boost::parameter::aux::empty_arg_list; typename boost::result_of(Param0, Param1, const ArgPack&)>::type = bool]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/isomorphism.hpp:666:1: required from ‘typename boost::result_of(Param0, Param1, const boost::parameter::aux::empty_arg_list&)>::type boost::isomorphism(const Param0&, const Param1&) [with Param0 = adjacency_list; Param1 = adjacency_list; typename result_of(Param0, Param1, const parameter::aux::empty_arg_list&)>::type = bool]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/is_kuratowski_subgraph.hpp:278:34: required from ‘bool boost::is_kuratowski_subgraph(const Graph&, ForwardIterator, ForwardIterator, VertexIndexMap) [with Graph = adjacency_list, property >; ForwardIterator = __gnu_cxx::__normal_iterator*, std::vector > >; VertexIndexMap = vec_adj_list_vertex_id_map, long unsigned int>]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/is_kuratowski_subgraph.hpp:290:34: required from ‘bool boost::is_kuratowski_subgraph(const Graph&, ForwardIterator, ForwardIterator) [with Graph = adjacency_list, property >; ForwardIterator = __gnu_cxx::__normal_iterator*, std::vector > >]’ planar.cpp:435:37: required from here /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::ForwardIterator<__gnu_cxx::__normal_iterator > >]’ 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ^ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements > > >]’: /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:571:7: required from ‘struct boost::BidirectionalIterator<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:597:3: required from ‘struct boost::RandomAccessIterator<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:597:3: required from ‘struct boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator > >]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied > > >::value’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:45:51: [ skipping 5 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/isomorphism.hpp:651:42: required from ‘bool boost::graph::detail::isomorphism_impl::operator()(const Graph1&, const Graph2&, const ArgPack&) const [with ArgPack = boost::parameter::aux::empty_arg_list; Graph1 = boost::adjacency_list; Graph2 = boost::adjacency_list]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/isomorphism.hpp:662:5: required from ‘typename boost::result_of(Param0, Param1, const ArgPack&)>::type boost::graph::isomorphism_with_named_params(const Param0&, const Param1&, const ArgPack&) [with Param0 = boost::adjacency_list; Param1 = boost::adjacency_list; ArgPack = boost::parameter::aux::empty_arg_list; typename boost::result_of(Param0, Param1, const ArgPack&)>::type = bool]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/isomorphism.hpp:666:1: required from ‘typename boost::result_of(Param0, Param1, const boost::parameter::aux::empty_arg_list&)>::type boost::isomorphism(const Param0&, const Param1&) [with Param0 = adjacency_list; Param1 = adjacency_list; typename result_of(Param0, Param1, const parameter::aux::empty_arg_list&)>::type = bool]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/is_kuratowski_subgraph.hpp:278:34: required from ‘bool boost::is_kuratowski_subgraph(const Graph&, ForwardIterator, ForwardIterator, VertexIndexMap) [with Graph = adjacency_list, property >; ForwardIterator = __gnu_cxx::__normal_iterator*, std::vector > >; VertexIndexMap = vec_adj_list_vertex_id_map, long unsigned int>]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/is_kuratowski_subgraph.hpp:290:34: required from ‘bool boost::is_kuratowski_subgraph(const Graph&, ForwardIterator, ForwardIterator) [with Graph = adjacency_list, property >; ForwardIterator = __gnu_cxx::__normal_iterator*, std::vector > >]’ planar.cpp:435:37: required from here /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::BidirectionalIterator<__gnu_cxx::__normal_iterator > >]’ 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ^ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements > > >]’: /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:253:5: required from ‘struct boost::Comparable<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:597:3: required from ‘struct boost::RandomAccessIterator<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:597:3: required from ‘struct boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator > >]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied > > >::value’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:45:51: [ skipping 5 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/isomorphism.hpp:651:42: required from ‘bool boost::graph::detail::isomorphism_impl::operator()(const Graph1&, const Graph2&, const ArgPack&) const [with ArgPack = boost::parameter::aux::empty_arg_list; Graph1 = boost::adjacency_list; Graph2 = boost::adjacency_list]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/isomorphism.hpp:662:5: required from ‘typename boost::result_of(Param0, Param1, const ArgPack&)>::type boost::graph::isomorphism_with_named_params(const Param0&, const Param1&, const ArgPack&) [with Param0 = boost::adjacency_list; Param1 = boost::adjacency_list; ArgPack = boost::parameter::aux::empty_arg_list; typename boost::result_of(Param0, Param1, const ArgPack&)>::type = bool]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/isomorphism.hpp:666:1: required from ‘typename boost::result_of(Param0, Param1, const boost::parameter::aux::empty_arg_list&)>::type boost::isomorphism(const Param0&, const Param1&) [with Param0 = adjacency_list; Param1 = adjacency_list; typename result_of(Param0, Param1, const parameter::aux::empty_arg_list&)>::type = bool]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/is_kuratowski_subgraph.hpp:278:34: required from ‘bool boost::is_kuratowski_subgraph(const Graph&, ForwardIterator, ForwardIterator, VertexIndexMap) [with Graph = adjacency_list, property >; ForwardIterator = __gnu_cxx::__normal_iterator*, std::vector > >; VertexIndexMap = vec_adj_list_vertex_id_map, long unsigned int>]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/is_kuratowski_subgraph.hpp:290:34: required from ‘bool boost::is_kuratowski_subgraph(const Graph&, ForwardIterator, ForwardIterator) [with Graph = adjacency_list, property >; ForwardIterator = __gnu_cxx::__normal_iterator*, std::vector > >]’ planar.cpp:435:37: required from here /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::Comparable<__gnu_cxx::__normal_iterator > >]’ 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ^ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements > > >]’: /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:601:7: required from ‘struct boost::RandomAccessIterator<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:597:3: required from ‘struct boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator > >]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied > > >::value’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied > > >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:72:8: [ skipping 4 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/isomorphism.hpp:651:42: required from ‘bool boost::graph::detail::isomorphism_impl::operator()(const Graph1&, const Graph2&, const ArgPack&) const [with ArgPack = boost::parameter::aux::empty_arg_list; Graph1 = boost::adjacency_list; Graph2 = boost::adjacency_list]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/isomorphism.hpp:662:5: required from ‘typename boost::result_of(Param0, Param1, const ArgPack&)>::type boost::graph::isomorphism_with_named_params(const Param0&, const Param1&, const ArgPack&) [with Param0 = boost::adjacency_list; Param1 = boost::adjacency_list; ArgPack = boost::parameter::aux::empty_arg_list; typename boost::result_of(Param0, Param1, const ArgPack&)>::type = bool]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/isomorphism.hpp:666:1: required from ‘typename boost::result_of(Param0, Param1, const boost::parameter::aux::empty_arg_list&)>::type boost::isomorphism(const Param0&, const Param1&) [with Param0 = adjacency_list; Param1 = adjacency_list; typename result_of(Param0, Param1, const parameter::aux::empty_arg_list&)>::type = bool]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/is_kuratowski_subgraph.hpp:278:34: required from ‘bool boost::is_kuratowski_subgraph(const Graph&, ForwardIterator, ForwardIterator, VertexIndexMap) [with Graph = adjacency_list, property >; ForwardIterator = __gnu_cxx::__normal_iterator*, std::vector > >; VertexIndexMap = vec_adj_list_vertex_id_map, long unsigned int>]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/is_kuratowski_subgraph.hpp:290:34: required from ‘bool boost::is_kuratowski_subgraph(const Graph&, ForwardIterator, ForwardIterator) [with Graph = adjacency_list, property >; ForwardIterator = __gnu_cxx::__normal_iterator*, std::vector > >]’ planar.cpp:435:37: required from here /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::RandomAccessIterator<__gnu_cxx::__normal_iterator > >]’ 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ^ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator > >]’: /home/omnipath/local/R/4.4-3.20/BH/include/boost/property_map/property_map.hpp:354:5: required from ‘boost::safe_iterator_property_map >::value_type, typename std::iterator_traits< >::reference> boost::make_safe_iterator_property_map(RAIter, std::size_t, ID) [with RAIter = __gnu_cxx::__normal_iterator >; ID = vec_adj_list_vertex_id_map; typename std::iterator_traits< >::value_type = int; typename std::iterator_traits< >::reference = int&; std::size_t = long unsigned int]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/isomorphism.hpp:214:54: required from ‘bool boost::detail::isomorphism_algo::test_isomorphism() [with Graph1 = boost::adjacency_list; Graph2 = boost::adjacency_list; IsoMapping = boost::shared_array_property_map >; Invariant1 = boost::degree_vertex_invariant >, boost::adjacency_list >; Invariant2 = boost::degree_vertex_invariant >, boost::adjacency_list >; IndexMap1 = boost::vec_adj_list_vertex_id_map; IndexMap2 = boost::vec_adj_list_vertex_id_map]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/isomorphism.hpp:532:33: required from ‘bool boost::isomorphism(const Graph1&, const Graph2&, IsoMapping, Invariant1, Invariant2, std::size_t, IndexMap1, IndexMap2) [with Graph1 = adjacency_list; Graph2 = adjacency_list; IsoMapping = shared_array_property_map >; Invariant1 = degree_vertex_invariant >, adjacency_list >; Invariant2 = degree_vertex_invariant >, adjacency_list >; IndexMap1 = vec_adj_list_vertex_id_map; IndexMap2 = vec_adj_list_vertex_id_map; std::size_t = long unsigned int]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/isomorphism.hpp:651:42: required from ‘bool boost::graph::detail::isomorphism_impl::operator()(const Graph1&, const Graph2&, const ArgPack&) const [with ArgPack = boost::parameter::aux::empty_arg_list; Graph1 = boost::adjacency_list; Graph2 = boost::adjacency_list]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/isomorphism.hpp:662:5: required from ‘typename boost::result_of(Param0, Param1, const ArgPack&)>::type boost::graph::isomorphism_with_named_params(const Param0&, const Param1&, const ArgPack&) [with Param0 = boost::adjacency_list; Param1 = boost::adjacency_list; ArgPack = boost::parameter::aux::empty_arg_list; typename boost::result_of(Param0, Param1, const ArgPack&)>::type = bool]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/isomorphism.hpp:666:1: required from ‘typename boost::result_of(Param0, Param1, const boost::parameter::aux::empty_arg_list&)>::type boost::isomorphism(const Param0&, const Param1&) [with Param0 = adjacency_list; Param1 = adjacency_list; typename result_of(Param0, Param1, const parameter::aux::empty_arg_list&)>::type = bool]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/is_kuratowski_subgraph.hpp:278:34: required from ‘bool boost::is_kuratowski_subgraph(const Graph&, ForwardIterator, ForwardIterator, VertexIndexMap) [with Graph = adjacency_list, property >; ForwardIterator = __gnu_cxx::__normal_iterator*, std::vector > >; VertexIndexMap = vec_adj_list_vertex_id_map, long unsigned int>]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/is_kuratowski_subgraph.hpp:290:34: required from ‘bool boost::is_kuratowski_subgraph(const Graph&, ForwardIterator, ForwardIterator) [with Graph = adjacency_list, property >; ForwardIterator = __gnu_cxx::__normal_iterator*, std::vector > >]’ planar.cpp:435:37: required from here /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:597:17: note: in a call to non-static member function ‘boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator > >::~RandomAccessIteratorConcept()’ 597 | BOOST_concept(RandomAccessIterator,(TT)) | ^~~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/preprocessor/cat.hpp:29:34: note: in definition of macro ‘BOOST_PP_CAT_I’ 29 | # define BOOST_PP_CAT_I(a, b) a ## b | ^ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/concept_def.hpp:23:12: note: in expansion of macro ‘BOOST_PP_CAT’ 23 | struct BOOST_PP_CAT(name,Concept) \ | ^~~~~~~~~~~~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:597:3: note: in expansion of macro ‘BOOST_concept’ 597 | BOOST_concept(RandomAccessIterator,(TT)) | ^~~~~~~~~~~~~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements*, std::vector > > > >]’: /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:167:5: required from ‘struct boost::CopyConstructible<__gnu_cxx::__normal_iterator*, std::vector > > >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/range/concepts.hpp:125:16: required from ‘struct boost::range_detail::IncrementableIteratorConcept<__gnu_cxx::__normal_iterator*, std::vector > > >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/range/concepts.hpp:147:16: required from ‘struct boost::range_detail::SinglePassIteratorConcept<__gnu_cxx::__normal_iterator*, std::vector > > >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::range_detail::SinglePassIteratorConcept<__gnu_cxx::__normal_iterator*, std::vector > > >]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied*, std::vector > > > >::value’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:45:51: [ skipping 13 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/isomorphism.hpp:651:42: required from ‘bool boost::graph::detail::isomorphism_impl::operator()(const Graph1&, const Graph2&, const ArgPack&) const [with ArgPack = boost::parameter::aux::empty_arg_list; Graph1 = boost::adjacency_list; Graph2 = boost::adjacency_list]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/isomorphism.hpp:662:5: required from ‘typename boost::result_of(Param0, Param1, const ArgPack&)>::type boost::graph::isomorphism_with_named_params(const Param0&, const Param1&, const ArgPack&) [with Param0 = boost::adjacency_list; Param1 = boost::adjacency_list; ArgPack = boost::parameter::aux::empty_arg_list; typename boost::result_of(Param0, Param1, const ArgPack&)>::type = bool]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/isomorphism.hpp:666:1: required from ‘typename boost::result_of(Param0, Param1, const boost::parameter::aux::empty_arg_list&)>::type boost::isomorphism(const Param0&, const Param1&) [with Param0 = adjacency_list; Param1 = adjacency_list; typename result_of(Param0, Param1, const parameter::aux::empty_arg_list&)>::type = bool]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/is_kuratowski_subgraph.hpp:278:34: required from ‘bool boost::is_kuratowski_subgraph(const Graph&, ForwardIterator, ForwardIterator, VertexIndexMap) [with Graph = adjacency_list, property >; ForwardIterator = __gnu_cxx::__normal_iterator*, std::vector > >; VertexIndexMap = vec_adj_list_vertex_id_map, long unsigned int>]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/is_kuratowski_subgraph.hpp:290:34: required from ‘bool boost::is_kuratowski_subgraph(const Graph&, ForwardIterator, ForwardIterator) [with Graph = adjacency_list, property >; ForwardIterator = __gnu_cxx::__normal_iterator*, std::vector > >]’ planar.cpp:435:37: required from here /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::CopyConstructible<__gnu_cxx::__normal_iterator*, std::vector > > >]’ 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ^ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements*, std::vector > > > >]’: /home/omnipath/local/R/4.4-3.20/BH/include/boost/range/concepts.hpp:136:13: required from ‘struct boost::range_detail::IncrementableIteratorConcept<__gnu_cxx::__normal_iterator*, std::vector > > >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/range/concepts.hpp:147:16: required from ‘struct boost::range_detail::SinglePassIteratorConcept<__gnu_cxx::__normal_iterator*, std::vector > > >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::range_detail::SinglePassIteratorConcept<__gnu_cxx::__normal_iterator*, std::vector > > >]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied*, std::vector > > > >::value’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied*, std::vector > > > >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:72:8: [ skipping 12 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/isomorphism.hpp:651:42: required from ‘bool boost::graph::detail::isomorphism_impl::operator()(const Graph1&, const Graph2&, const ArgPack&) const [with ArgPack = boost::parameter::aux::empty_arg_list; Graph1 = boost::adjacency_list; Graph2 = boost::adjacency_list]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/isomorphism.hpp:662:5: required from ‘typename boost::result_of(Param0, Param1, const ArgPack&)>::type boost::graph::isomorphism_with_named_params(const Param0&, const Param1&, const ArgPack&) [with Param0 = boost::adjacency_list; Param1 = boost::adjacency_list; ArgPack = boost::parameter::aux::empty_arg_list; typename boost::result_of(Param0, Param1, const ArgPack&)>::type = bool]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/isomorphism.hpp:666:1: required from ‘typename boost::result_of(Param0, Param1, const boost::parameter::aux::empty_arg_list&)>::type boost::isomorphism(const Param0&, const Param1&) [with Param0 = adjacency_list; Param1 = adjacency_list; typename result_of(Param0, Param1, const parameter::aux::empty_arg_list&)>::type = bool]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/is_kuratowski_subgraph.hpp:278:34: required from ‘bool boost::is_kuratowski_subgraph(const Graph&, ForwardIterator, ForwardIterator, VertexIndexMap) [with Graph = adjacency_list, property >; ForwardIterator = __gnu_cxx::__normal_iterator*, std::vector > >; VertexIndexMap = vec_adj_list_vertex_id_map, long unsigned int>]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/is_kuratowski_subgraph.hpp:290:34: required from ‘bool boost::is_kuratowski_subgraph(const Graph&, ForwardIterator, ForwardIterator) [with Graph = adjacency_list, property >; ForwardIterator = __gnu_cxx::__normal_iterator*, std::vector > >]’ planar.cpp:435:37: required from here /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::range_detail::IncrementableIteratorConcept<__gnu_cxx::__normal_iterator*, std::vector > > >]’ 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ^ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements*, std::vector > > > >]’: /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:233:5: required from ‘struct boost::EqualityComparable<__gnu_cxx::__normal_iterator*, std::vector > > >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/range/concepts.hpp:147:16: required from ‘struct boost::range_detail::SinglePassIteratorConcept<__gnu_cxx::__normal_iterator*, std::vector > > >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::range_detail::SinglePassIteratorConcept<__gnu_cxx::__normal_iterator*, std::vector > > >]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied*, std::vector > > > >::value’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied*, std::vector > > > >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:72:8: [ skipping 12 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/isomorphism.hpp:651:42: required from ‘bool boost::graph::detail::isomorphism_impl::operator()(const Graph1&, const Graph2&, const ArgPack&) const [with ArgPack = boost::parameter::aux::empty_arg_list; Graph1 = boost::adjacency_list; Graph2 = boost::adjacency_list]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/isomorphism.hpp:662:5: required from ‘typename boost::result_of(Param0, Param1, const ArgPack&)>::type boost::graph::isomorphism_with_named_params(const Param0&, const Param1&, const ArgPack&) [with Param0 = boost::adjacency_list; Param1 = boost::adjacency_list; ArgPack = boost::parameter::aux::empty_arg_list; typename boost::result_of(Param0, Param1, const ArgPack&)>::type = bool]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/isomorphism.hpp:666:1: required from ‘typename boost::result_of(Param0, Param1, const boost::parameter::aux::empty_arg_list&)>::type boost::isomorphism(const Param0&, const Param1&) [with Param0 = adjacency_list; Param1 = adjacency_list; typename result_of(Param0, Param1, const parameter::aux::empty_arg_list&)>::type = bool]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/is_kuratowski_subgraph.hpp:278:34: required from ‘bool boost::is_kuratowski_subgraph(const Graph&, ForwardIterator, ForwardIterator, VertexIndexMap) [with Graph = adjacency_list, property >; ForwardIterator = __gnu_cxx::__normal_iterator*, std::vector > >; VertexIndexMap = vec_adj_list_vertex_id_map, long unsigned int>]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/is_kuratowski_subgraph.hpp:290:34: required from ‘bool boost::is_kuratowski_subgraph(const Graph&, ForwardIterator, ForwardIterator) [with Graph = adjacency_list, property >; ForwardIterator = __gnu_cxx::__normal_iterator*, std::vector > >]’ planar.cpp:435:37: required from here /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::EqualityComparable<__gnu_cxx::__normal_iterator*, std::vector > > >]’ 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ^ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements*, std::vector > > > >]’: /home/omnipath/local/R/4.4-3.20/BH/include/boost/range/concepts.hpp:158:13: required from ‘struct boost::range_detail::SinglePassIteratorConcept<__gnu_cxx::__normal_iterator*, std::vector > > >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::range_detail::SinglePassIteratorConcept<__gnu_cxx::__normal_iterator*, std::vector > > >]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied*, std::vector > > > >::value’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied*, std::vector > > > >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_*, std::vector > > >)>’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/range/concepts.hpp:278:9: [ skipping 11 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/isomorphism.hpp:651:42: required from ‘bool boost::graph::detail::isomorphism_impl::operator()(const Graph1&, const Graph2&, const ArgPack&) const [with ArgPack = boost::parameter::aux::empty_arg_list; Graph1 = boost::adjacency_list; Graph2 = boost::adjacency_list]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/isomorphism.hpp:662:5: required from ‘typename boost::result_of(Param0, Param1, const ArgPack&)>::type boost::graph::isomorphism_with_named_params(const Param0&, const Param1&, const ArgPack&) [with Param0 = boost::adjacency_list; Param1 = boost::adjacency_list; ArgPack = boost::parameter::aux::empty_arg_list; typename boost::result_of(Param0, Param1, const ArgPack&)>::type = bool]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/isomorphism.hpp:666:1: required from ‘typename boost::result_of(Param0, Param1, const boost::parameter::aux::empty_arg_list&)>::type boost::isomorphism(const Param0&, const Param1&) [with Param0 = adjacency_list; Param1 = adjacency_list; typename result_of(Param0, Param1, const parameter::aux::empty_arg_list&)>::type = bool]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/is_kuratowski_subgraph.hpp:278:34: required from ‘bool boost::is_kuratowski_subgraph(const Graph&, ForwardIterator, ForwardIterator, VertexIndexMap) [with Graph = adjacency_list, property >; ForwardIterator = __gnu_cxx::__normal_iterator*, std::vector > >; VertexIndexMap = vec_adj_list_vertex_id_map, long unsigned int>]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/is_kuratowski_subgraph.hpp:290:34: required from ‘bool boost::is_kuratowski_subgraph(const Graph&, ForwardIterator, ForwardIterator) [with Graph = adjacency_list, property >; ForwardIterator = __gnu_cxx::__normal_iterator*, std::vector > >]’ planar.cpp:435:37: required from here /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::range_detail::SinglePassIteratorConcept<__gnu_cxx::__normal_iterator*, std::vector > > >]’ 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ^ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::range_detail::SinglePassIteratorConcept<__gnu_cxx::__normal_iterator*, std::vector > > >]’: /home/omnipath/local/R/4.4-3.20/BH/include/boost/range/concepts.hpp:278:9: required from ‘struct boost::SinglePassRangeConcept > >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/range/concepts.hpp:318:12: required from ‘struct boost::ForwardRangeConcept > >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/range/concepts.hpp:352:12: required from ‘struct boost::BidirectionalRangeConcept > >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/range/concepts.hpp:370:12: required from ‘struct boost::RandomAccessRangeConcept > >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::RandomAccessRangeConcept > >]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:42:5: [ skipping 6 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/isomorphism.hpp:651:42: required from ‘bool boost::graph::detail::isomorphism_impl::operator()(const Graph1&, const Graph2&, const ArgPack&) const [with ArgPack = boost::parameter::aux::empty_arg_list; Graph1 = boost::adjacency_list; Graph2 = boost::adjacency_list]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/isomorphism.hpp:662:5: required from ‘typename boost::result_of(Param0, Param1, const ArgPack&)>::type boost::graph::isomorphism_with_named_params(const Param0&, const Param1&, const ArgPack&) [with Param0 = boost::adjacency_list; Param1 = boost::adjacency_list; ArgPack = boost::parameter::aux::empty_arg_list; typename boost::result_of(Param0, Param1, const ArgPack&)>::type = bool]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/isomorphism.hpp:666:1: required from ‘typename boost::result_of(Param0, Param1, const boost::parameter::aux::empty_arg_list&)>::type boost::isomorphism(const Param0&, const Param1&) [with Param0 = adjacency_list; Param1 = adjacency_list; typename result_of(Param0, Param1, const parameter::aux::empty_arg_list&)>::type = bool]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/is_kuratowski_subgraph.hpp:278:34: required from ‘bool boost::is_kuratowski_subgraph(const Graph&, ForwardIterator, ForwardIterator, VertexIndexMap) [with Graph = adjacency_list, property >; ForwardIterator = __gnu_cxx::__normal_iterator*, std::vector > >; VertexIndexMap = vec_adj_list_vertex_id_map, long unsigned int>]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/is_kuratowski_subgraph.hpp:290:34: required from ‘bool boost::is_kuratowski_subgraph(const Graph&, ForwardIterator, ForwardIterator) [with Graph = adjacency_list, property >; ForwardIterator = __gnu_cxx::__normal_iterator*, std::vector > >]’ planar.cpp:435:37: required from here /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::range_detail::SinglePassIteratorConcept::~SinglePassIteratorConcept() [with Iterator = __gnu_cxx::__normal_iterator*, std::vector > >]’ 37 | ~model() | ^ /home/omnipath/local/R/4.4-3.20/BH/include/boost/range/concepts.hpp:158:13: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 158 | BOOST_CONCEPT_USAGE(SinglePassIteratorConcept) | ^~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements*, std::vector > > > >]’: /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:167:5: required from ‘struct boost::CopyConstructible<__gnu_cxx::__normal_iterator*, std::vector > > >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/range/concepts.hpp:125:16: required from ‘struct boost::range_detail::IncrementableIteratorConcept<__gnu_cxx::__normal_iterator*, std::vector > > >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/range/concepts.hpp:147:16: required from ‘struct boost::range_detail::SinglePassIteratorConcept<__gnu_cxx::__normal_iterator*, std::vector > > >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::range_detail::SinglePassIteratorConcept<__gnu_cxx::__normal_iterator*, std::vector > > >]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied*, std::vector > > > >::value’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:45:51: [ skipping 13 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/isomorphism.hpp:651:42: required from ‘bool boost::graph::detail::isomorphism_impl::operator()(const Graph1&, const Graph2&, const ArgPack&) const [with ArgPack = boost::parameter::aux::empty_arg_list; Graph1 = boost::adjacency_list; Graph2 = boost::adjacency_list]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/isomorphism.hpp:662:5: required from ‘typename boost::result_of(Param0, Param1, const ArgPack&)>::type boost::graph::isomorphism_with_named_params(const Param0&, const Param1&, const ArgPack&) [with Param0 = boost::adjacency_list; Param1 = boost::adjacency_list; ArgPack = boost::parameter::aux::empty_arg_list; typename boost::result_of(Param0, Param1, const ArgPack&)>::type = bool]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/isomorphism.hpp:666:1: required from ‘typename boost::result_of(Param0, Param1, const boost::parameter::aux::empty_arg_list&)>::type boost::isomorphism(const Param0&, const Param1&) [with Param0 = adjacency_list; Param1 = adjacency_list; typename result_of(Param0, Param1, const parameter::aux::empty_arg_list&)>::type = bool]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/is_kuratowski_subgraph.hpp:278:34: required from ‘bool boost::is_kuratowski_subgraph(const Graph&, ForwardIterator, ForwardIterator, VertexIndexMap) [with Graph = adjacency_list, property >; ForwardIterator = __gnu_cxx::__normal_iterator*, std::vector > >; VertexIndexMap = vec_adj_list_vertex_id_map, long unsigned int>]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/is_kuratowski_subgraph.hpp:290:34: required from ‘bool boost::is_kuratowski_subgraph(const Graph&, ForwardIterator, ForwardIterator) [with Graph = adjacency_list, property >; ForwardIterator = __gnu_cxx::__normal_iterator*, std::vector > >]’ planar.cpp:435:37: required from here /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::CopyConstructible<__gnu_cxx::__normal_iterator*, std::vector > > >]’ 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ^ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements*, std::vector > > > >]’: /home/omnipath/local/R/4.4-3.20/BH/include/boost/range/concepts.hpp:136:13: required from ‘struct boost::range_detail::IncrementableIteratorConcept<__gnu_cxx::__normal_iterator*, std::vector > > >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/range/concepts.hpp:147:16: required from ‘struct boost::range_detail::SinglePassIteratorConcept<__gnu_cxx::__normal_iterator*, std::vector > > >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::range_detail::SinglePassIteratorConcept<__gnu_cxx::__normal_iterator*, std::vector > > >]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied*, std::vector > > > >::value’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied*, std::vector > > > >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:72:8: [ skipping 12 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/isomorphism.hpp:651:42: required from ‘bool boost::graph::detail::isomorphism_impl::operator()(const Graph1&, const Graph2&, const ArgPack&) const [with ArgPack = boost::parameter::aux::empty_arg_list; Graph1 = boost::adjacency_list; Graph2 = boost::adjacency_list]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/isomorphism.hpp:662:5: required from ‘typename boost::result_of(Param0, Param1, const ArgPack&)>::type boost::graph::isomorphism_with_named_params(const Param0&, const Param1&, const ArgPack&) [with Param0 = boost::adjacency_list; Param1 = boost::adjacency_list; ArgPack = boost::parameter::aux::empty_arg_list; typename boost::result_of(Param0, Param1, const ArgPack&)>::type = bool]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/isomorphism.hpp:666:1: required from ‘typename boost::result_of(Param0, Param1, const boost::parameter::aux::empty_arg_list&)>::type boost::isomorphism(const Param0&, const Param1&) [with Param0 = adjacency_list; Param1 = adjacency_list; typename result_of(Param0, Param1, const parameter::aux::empty_arg_list&)>::type = bool]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/is_kuratowski_subgraph.hpp:278:34: required from ‘bool boost::is_kuratowski_subgraph(const Graph&, ForwardIterator, ForwardIterator, VertexIndexMap) [with Graph = adjacency_list, property >; ForwardIterator = __gnu_cxx::__normal_iterator*, std::vector > >; VertexIndexMap = vec_adj_list_vertex_id_map, long unsigned int>]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/is_kuratowski_subgraph.hpp:290:34: required from ‘bool boost::is_kuratowski_subgraph(const Graph&, ForwardIterator, ForwardIterator) [with Graph = adjacency_list, property >; ForwardIterator = __gnu_cxx::__normal_iterator*, std::vector > >]’ planar.cpp:435:37: required from here /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::range_detail::IncrementableIteratorConcept<__gnu_cxx::__normal_iterator*, std::vector > > >]’ 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ^ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements*, std::vector > > > >]’: /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:233:5: required from ‘struct boost::EqualityComparable<__gnu_cxx::__normal_iterator*, std::vector > > >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/range/concepts.hpp:147:16: required from ‘struct boost::range_detail::SinglePassIteratorConcept<__gnu_cxx::__normal_iterator*, std::vector > > >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::range_detail::SinglePassIteratorConcept<__gnu_cxx::__normal_iterator*, std::vector > > >]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied*, std::vector > > > >::value’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied*, std::vector > > > >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:72:8: [ skipping 12 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/isomorphism.hpp:651:42: required from ‘bool boost::graph::detail::isomorphism_impl::operator()(const Graph1&, const Graph2&, const ArgPack&) const [with ArgPack = boost::parameter::aux::empty_arg_list; Graph1 = boost::adjacency_list; Graph2 = boost::adjacency_list]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/isomorphism.hpp:662:5: required from ‘typename boost::result_of(Param0, Param1, const ArgPack&)>::type boost::graph::isomorphism_with_named_params(const Param0&, const Param1&, const ArgPack&) [with Param0 = boost::adjacency_list; Param1 = boost::adjacency_list; ArgPack = boost::parameter::aux::empty_arg_list; typename boost::result_of(Param0, Param1, const ArgPack&)>::type = bool]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/isomorphism.hpp:666:1: required from ‘typename boost::result_of(Param0, Param1, const boost::parameter::aux::empty_arg_list&)>::type boost::isomorphism(const Param0&, const Param1&) [with Param0 = adjacency_list; Param1 = adjacency_list; typename result_of(Param0, Param1, const parameter::aux::empty_arg_list&)>::type = bool]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/is_kuratowski_subgraph.hpp:278:34: required from ‘bool boost::is_kuratowski_subgraph(const Graph&, ForwardIterator, ForwardIterator, VertexIndexMap) [with Graph = adjacency_list, property >; ForwardIterator = __gnu_cxx::__normal_iterator*, std::vector > >; VertexIndexMap = vec_adj_list_vertex_id_map, long unsigned int>]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/is_kuratowski_subgraph.hpp:290:34: required from ‘bool boost::is_kuratowski_subgraph(const Graph&, ForwardIterator, ForwardIterator) [with Graph = adjacency_list, property >; ForwardIterator = __gnu_cxx::__normal_iterator*, std::vector > >]’ planar.cpp:435:37: required from here /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::EqualityComparable<__gnu_cxx::__normal_iterator*, std::vector > > >]’ 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ^ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements*, std::vector > > > >]’: /home/omnipath/local/R/4.4-3.20/BH/include/boost/range/concepts.hpp:158:13: required from ‘struct boost::range_detail::SinglePassIteratorConcept<__gnu_cxx::__normal_iterator*, std::vector > > >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::range_detail::SinglePassIteratorConcept<__gnu_cxx::__normal_iterator*, std::vector > > >]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied*, std::vector > > > >::value’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied*, std::vector > > > >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_*, std::vector > > >)>’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/range/concepts.hpp:281:9: [ skipping 11 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/isomorphism.hpp:651:42: required from ‘bool boost::graph::detail::isomorphism_impl::operator()(const Graph1&, const Graph2&, const ArgPack&) const [with ArgPack = boost::parameter::aux::empty_arg_list; Graph1 = boost::adjacency_list; Graph2 = boost::adjacency_list]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/isomorphism.hpp:662:5: required from ‘typename boost::result_of(Param0, Param1, const ArgPack&)>::type boost::graph::isomorphism_with_named_params(const Param0&, const Param1&, const ArgPack&) [with Param0 = boost::adjacency_list; Param1 = boost::adjacency_list; ArgPack = boost::parameter::aux::empty_arg_list; typename boost::result_of(Param0, Param1, const ArgPack&)>::type = bool]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/isomorphism.hpp:666:1: required from ‘typename boost::result_of(Param0, Param1, const boost::parameter::aux::empty_arg_list&)>::type boost::isomorphism(const Param0&, const Param1&) [with Param0 = adjacency_list; Param1 = adjacency_list; typename result_of(Param0, Param1, const parameter::aux::empty_arg_list&)>::type = bool]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/is_kuratowski_subgraph.hpp:278:34: required from ‘bool boost::is_kuratowski_subgraph(const Graph&, ForwardIterator, ForwardIterator, VertexIndexMap) [with Graph = adjacency_list, property >; ForwardIterator = __gnu_cxx::__normal_iterator*, std::vector > >; VertexIndexMap = vec_adj_list_vertex_id_map, long unsigned int>]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/is_kuratowski_subgraph.hpp:290:34: required from ‘bool boost::is_kuratowski_subgraph(const Graph&, ForwardIterator, ForwardIterator) [with Graph = adjacency_list, property >; ForwardIterator = __gnu_cxx::__normal_iterator*, std::vector > >]’ planar.cpp:435:37: required from here /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::range_detail::SinglePassIteratorConcept<__gnu_cxx::__normal_iterator*, std::vector > > >]’ 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ^ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::range_detail::SinglePassIteratorConcept<__gnu_cxx::__normal_iterator*, std::vector > > >]’: /home/omnipath/local/R/4.4-3.20/BH/include/boost/range/concepts.hpp:281:9: required from ‘struct boost::SinglePassRangeConcept > >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/range/concepts.hpp:318:12: required from ‘struct boost::ForwardRangeConcept > >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/range/concepts.hpp:352:12: required from ‘struct boost::BidirectionalRangeConcept > >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/range/concepts.hpp:370:12: required from ‘struct boost::RandomAccessRangeConcept > >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::RandomAccessRangeConcept > >]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:42:5: [ skipping 6 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/isomorphism.hpp:651:42: required from ‘bool boost::graph::detail::isomorphism_impl::operator()(const Graph1&, const Graph2&, const ArgPack&) const [with ArgPack = boost::parameter::aux::empty_arg_list; Graph1 = boost::adjacency_list; Graph2 = boost::adjacency_list]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/isomorphism.hpp:662:5: required from ‘typename boost::result_of(Param0, Param1, const ArgPack&)>::type boost::graph::isomorphism_with_named_params(const Param0&, const Param1&, const ArgPack&) [with Param0 = boost::adjacency_list; Param1 = boost::adjacency_list; ArgPack = boost::parameter::aux::empty_arg_list; typename boost::result_of(Param0, Param1, const ArgPack&)>::type = bool]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/isomorphism.hpp:666:1: required from ‘typename boost::result_of(Param0, Param1, const boost::parameter::aux::empty_arg_list&)>::type boost::isomorphism(const Param0&, const Param1&) [with Param0 = adjacency_list; Param1 = adjacency_list; typename result_of(Param0, Param1, const parameter::aux::empty_arg_list&)>::type = bool]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/is_kuratowski_subgraph.hpp:278:34: required from ‘bool boost::is_kuratowski_subgraph(const Graph&, ForwardIterator, ForwardIterator, VertexIndexMap) [with Graph = adjacency_list, property >; ForwardIterator = __gnu_cxx::__normal_iterator*, std::vector > >; VertexIndexMap = vec_adj_list_vertex_id_map, long unsigned int>]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/is_kuratowski_subgraph.hpp:290:34: required from ‘bool boost::is_kuratowski_subgraph(const Graph&, ForwardIterator, ForwardIterator) [with Graph = adjacency_list, property >; ForwardIterator = __gnu_cxx::__normal_iterator*, std::vector > >]’ planar.cpp:435:37: required from here /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::range_detail::SinglePassIteratorConcept::~SinglePassIteratorConcept() [with Iterator = __gnu_cxx::__normal_iterator*, std::vector > >]’ 37 | ~model() | ^ /home/omnipath/local/R/4.4-3.20/BH/include/boost/range/concepts.hpp:158:13: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 158 | BOOST_CONCEPT_USAGE(SinglePassIteratorConcept) | ^~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements > > >]’: /home/omnipath/local/R/4.4-3.20/BH/include/boost/range/concepts.hpp:284:9: required from ‘struct boost::SinglePassRangeConcept > >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/range/concepts.hpp:318:12: required from ‘struct boost::ForwardRangeConcept > >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/range/concepts.hpp:352:12: required from ‘struct boost::BidirectionalRangeConcept > >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/range/concepts.hpp:370:12: required from ‘struct boost::RandomAccessRangeConcept > >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::RandomAccessRangeConcept > >]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:42:5: [ skipping 6 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/isomorphism.hpp:651:42: required from ‘bool boost::graph::detail::isomorphism_impl::operator()(const Graph1&, const Graph2&, const ArgPack&) const [with ArgPack = boost::parameter::aux::empty_arg_list; Graph1 = boost::adjacency_list; Graph2 = boost::adjacency_list]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/isomorphism.hpp:662:5: required from ‘typename boost::result_of(Param0, Param1, const ArgPack&)>::type boost::graph::isomorphism_with_named_params(const Param0&, const Param1&, const ArgPack&) [with Param0 = boost::adjacency_list; Param1 = boost::adjacency_list; ArgPack = boost::parameter::aux::empty_arg_list; typename boost::result_of(Param0, Param1, const ArgPack&)>::type = bool]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/isomorphism.hpp:666:1: required from ‘typename boost::result_of(Param0, Param1, const boost::parameter::aux::empty_arg_list&)>::type boost::isomorphism(const Param0&, const Param1&) [with Param0 = adjacency_list; Param1 = adjacency_list; typename result_of(Param0, Param1, const parameter::aux::empty_arg_list&)>::type = bool]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/is_kuratowski_subgraph.hpp:278:34: required from ‘bool boost::is_kuratowski_subgraph(const Graph&, ForwardIterator, ForwardIterator, VertexIndexMap) [with Graph = adjacency_list, property >; ForwardIterator = __gnu_cxx::__normal_iterator*, std::vector > >; VertexIndexMap = vec_adj_list_vertex_id_map, long unsigned int>]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/is_kuratowski_subgraph.hpp:290:34: required from ‘bool boost::is_kuratowski_subgraph(const Graph&, ForwardIterator, ForwardIterator) [with Graph = adjacency_list, property >; ForwardIterator = __gnu_cxx::__normal_iterator*, std::vector > >]’ planar.cpp:435:37: required from here /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::SinglePassRangeConcept > >]’ 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ^ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements*, std::vector > > > >]’: /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:137:5: required from ‘struct boost::DefaultConstructible<__gnu_cxx::__normal_iterator*, std::vector > > >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/range/concepts.hpp:181:16: required from ‘struct boost::range_detail::ForwardIteratorConcept<__gnu_cxx::__normal_iterator*, std::vector > > >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::range_detail::ForwardIteratorConcept<__gnu_cxx::__normal_iterator*, std::vector > > >]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied*, std::vector > > > >::value’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied*, std::vector > > > >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:72:8: [ skipping 11 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/isomorphism.hpp:651:42: required from ‘bool boost::graph::detail::isomorphism_impl::operator()(const Graph1&, const Graph2&, const ArgPack&) const [with ArgPack = boost::parameter::aux::empty_arg_list; Graph1 = boost::adjacency_list; Graph2 = boost::adjacency_list]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/isomorphism.hpp:662:5: required from ‘typename boost::result_of(Param0, Param1, const ArgPack&)>::type boost::graph::isomorphism_with_named_params(const Param0&, const Param1&, const ArgPack&) [with Param0 = boost::adjacency_list; Param1 = boost::adjacency_list; ArgPack = boost::parameter::aux::empty_arg_list; typename boost::result_of(Param0, Param1, const ArgPack&)>::type = bool]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/isomorphism.hpp:666:1: required from ‘typename boost::result_of(Param0, Param1, const boost::parameter::aux::empty_arg_list&)>::type boost::isomorphism(const Param0&, const Param1&) [with Param0 = adjacency_list; Param1 = adjacency_list; typename result_of(Param0, Param1, const parameter::aux::empty_arg_list&)>::type = bool]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/is_kuratowski_subgraph.hpp:278:34: required from ‘bool boost::is_kuratowski_subgraph(const Graph&, ForwardIterator, ForwardIterator, VertexIndexMap) [with Graph = adjacency_list, property >; ForwardIterator = __gnu_cxx::__normal_iterator*, std::vector > >; VertexIndexMap = vec_adj_list_vertex_id_map, long unsigned int>]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/is_kuratowski_subgraph.hpp:290:34: required from ‘bool boost::is_kuratowski_subgraph(const Graph&, ForwardIterator, ForwardIterator) [with Graph = adjacency_list, property >; ForwardIterator = __gnu_cxx::__normal_iterator*, std::vector > >]’ planar.cpp:435:37: required from here /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::DefaultConstructible<__gnu_cxx::__normal_iterator*, std::vector > > >]’ 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ^ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements*, std::vector > > > >]’: /home/omnipath/local/R/4.4-3.20/BH/include/boost/range/concepts.hpp:197:13: required from ‘struct boost::range_detail::ForwardIteratorConcept<__gnu_cxx::__normal_iterator*, std::vector > > >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::range_detail::ForwardIteratorConcept<__gnu_cxx::__normal_iterator*, std::vector > > >]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied*, std::vector > > > >::value’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied*, std::vector > > > >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_*, std::vector > > >)>’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/range/concepts.hpp:321:9: [ skipping 10 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/isomorphism.hpp:651:42: required from ‘bool boost::graph::detail::isomorphism_impl::operator()(const Graph1&, const Graph2&, const ArgPack&) const [with ArgPack = boost::parameter::aux::empty_arg_list; Graph1 = boost::adjacency_list; Graph2 = boost::adjacency_list]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/isomorphism.hpp:662:5: required from ‘typename boost::result_of(Param0, Param1, const ArgPack&)>::type boost::graph::isomorphism_with_named_params(const Param0&, const Param1&, const ArgPack&) [with Param0 = boost::adjacency_list; Param1 = boost::adjacency_list; ArgPack = boost::parameter::aux::empty_arg_list; typename boost::result_of(Param0, Param1, const ArgPack&)>::type = bool]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/isomorphism.hpp:666:1: required from ‘typename boost::result_of(Param0, Param1, const boost::parameter::aux::empty_arg_list&)>::type boost::isomorphism(const Param0&, const Param1&) [with Param0 = adjacency_list; Param1 = adjacency_list; typename result_of(Param0, Param1, const parameter::aux::empty_arg_list&)>::type = bool]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/is_kuratowski_subgraph.hpp:278:34: required from ‘bool boost::is_kuratowski_subgraph(const Graph&, ForwardIterator, ForwardIterator, VertexIndexMap) [with Graph = adjacency_list, property >; ForwardIterator = __gnu_cxx::__normal_iterator*, std::vector > >; VertexIndexMap = vec_adj_list_vertex_id_map, long unsigned int>]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/is_kuratowski_subgraph.hpp:290:34: required from ‘bool boost::is_kuratowski_subgraph(const Graph&, ForwardIterator, ForwardIterator) [with Graph = adjacency_list, property >; ForwardIterator = __gnu_cxx::__normal_iterator*, std::vector > >]’ planar.cpp:435:37: required from here /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::range_detail::ForwardIteratorConcept<__gnu_cxx::__normal_iterator*, std::vector > > >]’ 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ^ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::range_detail::ForwardIteratorConcept<__gnu_cxx::__normal_iterator*, std::vector > > >]’: /home/omnipath/local/R/4.4-3.20/BH/include/boost/range/concepts.hpp:321:9: required from ‘struct boost::ForwardRangeConcept > >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/range/concepts.hpp:352:12: required from ‘struct boost::BidirectionalRangeConcept > >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/range/concepts.hpp:370:12: required from ‘struct boost::RandomAccessRangeConcept > >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::RandomAccessRangeConcept > >]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied > > >::value’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:45:51: [ skipping 5 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/isomorphism.hpp:651:42: required from ‘bool boost::graph::detail::isomorphism_impl::operator()(const Graph1&, const Graph2&, const ArgPack&) const [with ArgPack = boost::parameter::aux::empty_arg_list; Graph1 = boost::adjacency_list; Graph2 = boost::adjacency_list]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/isomorphism.hpp:662:5: required from ‘typename boost::result_of(Param0, Param1, const ArgPack&)>::type boost::graph::isomorphism_with_named_params(const Param0&, const Param1&, const ArgPack&) [with Param0 = boost::adjacency_list; Param1 = boost::adjacency_list; ArgPack = boost::parameter::aux::empty_arg_list; typename boost::result_of(Param0, Param1, const ArgPack&)>::type = bool]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/isomorphism.hpp:666:1: required from ‘typename boost::result_of(Param0, Param1, const boost::parameter::aux::empty_arg_list&)>::type boost::isomorphism(const Param0&, const Param1&) [with Param0 = adjacency_list; Param1 = adjacency_list; typename result_of(Param0, Param1, const parameter::aux::empty_arg_list&)>::type = bool]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/is_kuratowski_subgraph.hpp:278:34: required from ‘bool boost::is_kuratowski_subgraph(const Graph&, ForwardIterator, ForwardIterator, VertexIndexMap) [with Graph = adjacency_list, property >; ForwardIterator = __gnu_cxx::__normal_iterator*, std::vector > >; VertexIndexMap = vec_adj_list_vertex_id_map, long unsigned int>]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/is_kuratowski_subgraph.hpp:290:34: required from ‘bool boost::is_kuratowski_subgraph(const Graph&, ForwardIterator, ForwardIterator) [with Graph = adjacency_list, property >; ForwardIterator = __gnu_cxx::__normal_iterator*, std::vector > >]’ planar.cpp:435:37: required from here /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::range_detail::ForwardIteratorConcept::~ForwardIteratorConcept() [with Iterator = __gnu_cxx::__normal_iterator*, std::vector > >]’ 37 | ~model() | ^ /home/omnipath/local/R/4.4-3.20/BH/include/boost/range/concepts.hpp:197:13: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 197 | BOOST_CONCEPT_USAGE(ForwardIteratorConcept) | ^~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements*, std::vector > > > >]’: /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:137:5: required from ‘struct boost::DefaultConstructible<__gnu_cxx::__normal_iterator*, std::vector > > >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/range/concepts.hpp:181:16: required from ‘struct boost::range_detail::ForwardIteratorConcept<__gnu_cxx::__normal_iterator*, std::vector > > >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::range_detail::ForwardIteratorConcept<__gnu_cxx::__normal_iterator*, std::vector > > >]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied*, std::vector > > > >::value’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied*, std::vector > > > >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:72:8: [ skipping 11 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/isomorphism.hpp:651:42: required from ‘bool boost::graph::detail::isomorphism_impl::operator()(const Graph1&, const Graph2&, const ArgPack&) const [with ArgPack = boost::parameter::aux::empty_arg_list; Graph1 = boost::adjacency_list; Graph2 = boost::adjacency_list]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/isomorphism.hpp:662:5: required from ‘typename boost::result_of(Param0, Param1, const ArgPack&)>::type boost::graph::isomorphism_with_named_params(const Param0&, const Param1&, const ArgPack&) [with Param0 = boost::adjacency_list; Param1 = boost::adjacency_list; ArgPack = boost::parameter::aux::empty_arg_list; typename boost::result_of(Param0, Param1, const ArgPack&)>::type = bool]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/isomorphism.hpp:666:1: required from ‘typename boost::result_of(Param0, Param1, const boost::parameter::aux::empty_arg_list&)>::type boost::isomorphism(const Param0&, const Param1&) [with Param0 = adjacency_list; Param1 = adjacency_list; typename result_of(Param0, Param1, const parameter::aux::empty_arg_list&)>::type = bool]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/is_kuratowski_subgraph.hpp:278:34: required from ‘bool boost::is_kuratowski_subgraph(const Graph&, ForwardIterator, ForwardIterator, VertexIndexMap) [with Graph = adjacency_list, property >; ForwardIterator = __gnu_cxx::__normal_iterator*, std::vector > >; VertexIndexMap = vec_adj_list_vertex_id_map, long unsigned int>]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/is_kuratowski_subgraph.hpp:290:34: required from ‘bool boost::is_kuratowski_subgraph(const Graph&, ForwardIterator, ForwardIterator) [with Graph = adjacency_list, property >; ForwardIterator = __gnu_cxx::__normal_iterator*, std::vector > >]’ planar.cpp:435:37: required from here /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::DefaultConstructible<__gnu_cxx::__normal_iterator*, std::vector > > >]’ 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ^ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements*, std::vector > > > >]’: /home/omnipath/local/R/4.4-3.20/BH/include/boost/range/concepts.hpp:197:13: required from ‘struct boost::range_detail::ForwardIteratorConcept<__gnu_cxx::__normal_iterator*, std::vector > > >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::range_detail::ForwardIteratorConcept<__gnu_cxx::__normal_iterator*, std::vector > > >]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied*, std::vector > > > >::value’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied*, std::vector > > > >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_*, std::vector > > >)>’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/range/concepts.hpp:322:9: [ skipping 10 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/isomorphism.hpp:651:42: required from ‘bool boost::graph::detail::isomorphism_impl::operator()(const Graph1&, const Graph2&, const ArgPack&) const [with ArgPack = boost::parameter::aux::empty_arg_list; Graph1 = boost::adjacency_list; Graph2 = boost::adjacency_list]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/isomorphism.hpp:662:5: required from ‘typename boost::result_of(Param0, Param1, const ArgPack&)>::type boost::graph::isomorphism_with_named_params(const Param0&, const Param1&, const ArgPack&) [with Param0 = boost::adjacency_list; Param1 = boost::adjacency_list; ArgPack = boost::parameter::aux::empty_arg_list; typename boost::result_of(Param0, Param1, const ArgPack&)>::type = bool]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/isomorphism.hpp:666:1: required from ‘typename boost::result_of(Param0, Param1, const boost::parameter::aux::empty_arg_list&)>::type boost::isomorphism(const Param0&, const Param1&) [with Param0 = adjacency_list; Param1 = adjacency_list; typename result_of(Param0, Param1, const parameter::aux::empty_arg_list&)>::type = bool]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/is_kuratowski_subgraph.hpp:278:34: required from ‘bool boost::is_kuratowski_subgraph(const Graph&, ForwardIterator, ForwardIterator, VertexIndexMap) [with Graph = adjacency_list, property >; ForwardIterator = __gnu_cxx::__normal_iterator*, std::vector > >; VertexIndexMap = vec_adj_list_vertex_id_map, long unsigned int>]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/is_kuratowski_subgraph.hpp:290:34: required from ‘bool boost::is_kuratowski_subgraph(const Graph&, ForwardIterator, ForwardIterator) [with Graph = adjacency_list, property >; ForwardIterator = __gnu_cxx::__normal_iterator*, std::vector > >]’ planar.cpp:435:37: required from here /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::range_detail::ForwardIteratorConcept<__gnu_cxx::__normal_iterator*, std::vector > > >]’ 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ^ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::range_detail::ForwardIteratorConcept<__gnu_cxx::__normal_iterator*, std::vector > > >]’: /home/omnipath/local/R/4.4-3.20/BH/include/boost/range/concepts.hpp:322:9: required from ‘struct boost::ForwardRangeConcept > >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/range/concepts.hpp:352:12: required from ‘struct boost::BidirectionalRangeConcept > >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/range/concepts.hpp:370:12: required from ‘struct boost::RandomAccessRangeConcept > >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::RandomAccessRangeConcept > >]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied > > >::value’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:45:51: [ skipping 5 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/isomorphism.hpp:651:42: required from ‘bool boost::graph::detail::isomorphism_impl::operator()(const Graph1&, const Graph2&, const ArgPack&) const [with ArgPack = boost::parameter::aux::empty_arg_list; Graph1 = boost::adjacency_list; Graph2 = boost::adjacency_list]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/isomorphism.hpp:662:5: required from ‘typename boost::result_of(Param0, Param1, const ArgPack&)>::type boost::graph::isomorphism_with_named_params(const Param0&, const Param1&, const ArgPack&) [with Param0 = boost::adjacency_list; Param1 = boost::adjacency_list; ArgPack = boost::parameter::aux::empty_arg_list; typename boost::result_of(Param0, Param1, const ArgPack&)>::type = bool]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/isomorphism.hpp:666:1: required from ‘typename boost::result_of(Param0, Param1, const boost::parameter::aux::empty_arg_list&)>::type boost::isomorphism(const Param0&, const Param1&) [with Param0 = adjacency_list; Param1 = adjacency_list; typename result_of(Param0, Param1, const parameter::aux::empty_arg_list&)>::type = bool]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/is_kuratowski_subgraph.hpp:278:34: required from ‘bool boost::is_kuratowski_subgraph(const Graph&, ForwardIterator, ForwardIterator, VertexIndexMap) [with Graph = adjacency_list, property >; ForwardIterator = __gnu_cxx::__normal_iterator*, std::vector > >; VertexIndexMap = vec_adj_list_vertex_id_map, long unsigned int>]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/is_kuratowski_subgraph.hpp:290:34: required from ‘bool boost::is_kuratowski_subgraph(const Graph&, ForwardIterator, ForwardIterator) [with Graph = adjacency_list, property >; ForwardIterator = __gnu_cxx::__normal_iterator*, std::vector > >]’ planar.cpp:435:37: required from here /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::range_detail::ForwardIteratorConcept::~ForwardIteratorConcept() [with Iterator = __gnu_cxx::__normal_iterator*, std::vector > >]’ 37 | ~model() | ^ /home/omnipath/local/R/4.4-3.20/BH/include/boost/range/concepts.hpp:197:13: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 197 | BOOST_CONCEPT_USAGE(ForwardIteratorConcept) | ^~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements*, std::vector > > > >]’: /home/omnipath/local/R/4.4-3.20/BH/include/boost/range/concepts.hpp:224:14: required from ‘struct boost::range_detail::BidirectionalIteratorConcept<__gnu_cxx::__normal_iterator*, std::vector > > >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::range_detail::BidirectionalIteratorConcept<__gnu_cxx::__normal_iterator*, std::vector > > >]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied*, std::vector > > > >::value’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied*, std::vector > > > >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_*, std::vector > > >)>’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/range/concepts.hpp:355:9: [ skipping 9 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/isomorphism.hpp:651:42: required from ‘bool boost::graph::detail::isomorphism_impl::operator()(const Graph1&, const Graph2&, const ArgPack&) const [with ArgPack = boost::parameter::aux::empty_arg_list; Graph1 = boost::adjacency_list; Graph2 = boost::adjacency_list]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/isomorphism.hpp:662:5: required from ‘typename boost::result_of(Param0, Param1, const ArgPack&)>::type boost::graph::isomorphism_with_named_params(const Param0&, const Param1&, const ArgPack&) [with Param0 = boost::adjacency_list; Param1 = boost::adjacency_list; ArgPack = boost::parameter::aux::empty_arg_list; typename boost::result_of(Param0, Param1, const ArgPack&)>::type = bool]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/isomorphism.hpp:666:1: required from ‘typename boost::result_of(Param0, Param1, const boost::parameter::aux::empty_arg_list&)>::type boost::isomorphism(const Param0&, const Param1&) [with Param0 = adjacency_list; Param1 = adjacency_list; typename result_of(Param0, Param1, const parameter::aux::empty_arg_list&)>::type = bool]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/is_kuratowski_subgraph.hpp:278:34: required from ‘bool boost::is_kuratowski_subgraph(const Graph&, ForwardIterator, ForwardIterator, VertexIndexMap) [with Graph = adjacency_list, property >; ForwardIterator = __gnu_cxx::__normal_iterator*, std::vector > >; VertexIndexMap = vec_adj_list_vertex_id_map, long unsigned int>]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/is_kuratowski_subgraph.hpp:290:34: required from ‘bool boost::is_kuratowski_subgraph(const Graph&, ForwardIterator, ForwardIterator) [with Graph = adjacency_list, property >; ForwardIterator = __gnu_cxx::__normal_iterator*, std::vector > >]’ planar.cpp:435:37: required from here /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::range_detail::BidirectionalIteratorConcept<__gnu_cxx::__normal_iterator*, std::vector > > >]’ 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ^ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::range_detail::BidirectionalIteratorConcept<__gnu_cxx::__normal_iterator*, std::vector > > >]’: /home/omnipath/local/R/4.4-3.20/BH/include/boost/range/concepts.hpp:355:9: required from ‘struct boost::BidirectionalRangeConcept > >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/range/concepts.hpp:370:12: required from ‘struct boost::RandomAccessRangeConcept > >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::RandomAccessRangeConcept > >]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied > > >::value’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied > > >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:72:8: [ skipping 4 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/isomorphism.hpp:651:42: required from ‘bool boost::graph::detail::isomorphism_impl::operator()(const Graph1&, const Graph2&, const ArgPack&) const [with ArgPack = boost::parameter::aux::empty_arg_list; Graph1 = boost::adjacency_list; Graph2 = boost::adjacency_list]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/isomorphism.hpp:662:5: required from ‘typename boost::result_of(Param0, Param1, const ArgPack&)>::type boost::graph::isomorphism_with_named_params(const Param0&, const Param1&, const ArgPack&) [with Param0 = boost::adjacency_list; Param1 = boost::adjacency_list; ArgPack = boost::parameter::aux::empty_arg_list; typename boost::result_of(Param0, Param1, const ArgPack&)>::type = bool]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/isomorphism.hpp:666:1: required from ‘typename boost::result_of(Param0, Param1, const boost::parameter::aux::empty_arg_list&)>::type boost::isomorphism(const Param0&, const Param1&) [with Param0 = adjacency_list; Param1 = adjacency_list; typename result_of(Param0, Param1, const parameter::aux::empty_arg_list&)>::type = bool]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/is_kuratowski_subgraph.hpp:278:34: required from ‘bool boost::is_kuratowski_subgraph(const Graph&, ForwardIterator, ForwardIterator, VertexIndexMap) [with Graph = adjacency_list, property >; ForwardIterator = __gnu_cxx::__normal_iterator*, std::vector > >; VertexIndexMap = vec_adj_list_vertex_id_map, long unsigned int>]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/is_kuratowski_subgraph.hpp:290:34: required from ‘bool boost::is_kuratowski_subgraph(const Graph&, ForwardIterator, ForwardIterator) [with Graph = adjacency_list, property >; ForwardIterator = __gnu_cxx::__normal_iterator*, std::vector > >]’ planar.cpp:435:37: required from here /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::range_detail::BidirectionalIteratorConcept::~BidirectionalIteratorConcept() [with Iterator = __gnu_cxx::__normal_iterator*, std::vector > >]’ 37 | ~model() | ^ /home/omnipath/local/R/4.4-3.20/BH/include/boost/range/concepts.hpp:224:14: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 224 | BOOST_CONCEPT_USAGE(BidirectionalIteratorConcept) | ^~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements*, std::vector > > > >]’: /home/omnipath/local/R/4.4-3.20/BH/include/boost/range/concepts.hpp:224:14: required from ‘struct boost::range_detail::BidirectionalIteratorConcept<__gnu_cxx::__normal_iterator*, std::vector > > >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::range_detail::BidirectionalIteratorConcept<__gnu_cxx::__normal_iterator*, std::vector > > >]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied*, std::vector > > > >::value’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied*, std::vector > > > >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_*, std::vector > > >)>’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/range/concepts.hpp:356:9: [ skipping 9 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/isomorphism.hpp:651:42: required from ‘bool boost::graph::detail::isomorphism_impl::operator()(const Graph1&, const Graph2&, const ArgPack&) const [with ArgPack = boost::parameter::aux::empty_arg_list; Graph1 = boost::adjacency_list; Graph2 = boost::adjacency_list]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/isomorphism.hpp:662:5: required from ‘typename boost::result_of(Param0, Param1, const ArgPack&)>::type boost::graph::isomorphism_with_named_params(const Param0&, const Param1&, const ArgPack&) [with Param0 = boost::adjacency_list; Param1 = boost::adjacency_list; ArgPack = boost::parameter::aux::empty_arg_list; typename boost::result_of(Param0, Param1, const ArgPack&)>::type = bool]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/isomorphism.hpp:666:1: required from ‘typename boost::result_of(Param0, Param1, const boost::parameter::aux::empty_arg_list&)>::type boost::isomorphism(const Param0&, const Param1&) [with Param0 = adjacency_list; Param1 = adjacency_list; typename result_of(Param0, Param1, const parameter::aux::empty_arg_list&)>::type = bool]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/is_kuratowski_subgraph.hpp:278:34: required from ‘bool boost::is_kuratowski_subgraph(const Graph&, ForwardIterator, ForwardIterator, VertexIndexMap) [with Graph = adjacency_list, property >; ForwardIterator = __gnu_cxx::__normal_iterator*, std::vector > >; VertexIndexMap = vec_adj_list_vertex_id_map, long unsigned int>]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/is_kuratowski_subgraph.hpp:290:34: required from ‘bool boost::is_kuratowski_subgraph(const Graph&, ForwardIterator, ForwardIterator) [with Graph = adjacency_list, property >; ForwardIterator = __gnu_cxx::__normal_iterator*, std::vector > >]’ planar.cpp:435:37: required from here /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::range_detail::BidirectionalIteratorConcept<__gnu_cxx::__normal_iterator*, std::vector > > >]’ 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ^ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::range_detail::BidirectionalIteratorConcept<__gnu_cxx::__normal_iterator*, std::vector > > >]’: /home/omnipath/local/R/4.4-3.20/BH/include/boost/range/concepts.hpp:356:9: required from ‘struct boost::BidirectionalRangeConcept > >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/range/concepts.hpp:370:12: required from ‘struct boost::RandomAccessRangeConcept > >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::RandomAccessRangeConcept > >]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied > > >::value’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied > > >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:72:8: [ skipping 4 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/isomorphism.hpp:651:42: required from ‘bool boost::graph::detail::isomorphism_impl::operator()(const Graph1&, const Graph2&, const ArgPack&) const [with ArgPack = boost::parameter::aux::empty_arg_list; Graph1 = boost::adjacency_list; Graph2 = boost::adjacency_list]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/isomorphism.hpp:662:5: required from ‘typename boost::result_of(Param0, Param1, const ArgPack&)>::type boost::graph::isomorphism_with_named_params(const Param0&, const Param1&, const ArgPack&) [with Param0 = boost::adjacency_list; Param1 = boost::adjacency_list; ArgPack = boost::parameter::aux::empty_arg_list; typename boost::result_of(Param0, Param1, const ArgPack&)>::type = bool]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/isomorphism.hpp:666:1: required from ‘typename boost::result_of(Param0, Param1, const boost::parameter::aux::empty_arg_list&)>::type boost::isomorphism(const Param0&, const Param1&) [with Param0 = adjacency_list; Param1 = adjacency_list; typename result_of(Param0, Param1, const parameter::aux::empty_arg_list&)>::type = bool]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/is_kuratowski_subgraph.hpp:278:34: required from ‘bool boost::is_kuratowski_subgraph(const Graph&, ForwardIterator, ForwardIterator, VertexIndexMap) [with Graph = adjacency_list, property >; ForwardIterator = __gnu_cxx::__normal_iterator*, std::vector > >; VertexIndexMap = vec_adj_list_vertex_id_map, long unsigned int>]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/is_kuratowski_subgraph.hpp:290:34: required from ‘bool boost::is_kuratowski_subgraph(const Graph&, ForwardIterator, ForwardIterator) [with Graph = adjacency_list, property >; ForwardIterator = __gnu_cxx::__normal_iterator*, std::vector > >]’ planar.cpp:435:37: required from here /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::range_detail::BidirectionalIteratorConcept::~BidirectionalIteratorConcept() [with Iterator = __gnu_cxx::__normal_iterator*, std::vector > >]’ 37 | ~model() | ^ /home/omnipath/local/R/4.4-3.20/BH/include/boost/range/concepts.hpp:224:14: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 224 | BOOST_CONCEPT_USAGE(BidirectionalIteratorConcept) | ^~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements*, std::vector > > > >]’: /home/omnipath/local/R/4.4-3.20/BH/include/boost/range/concepts.hpp:245:14: required from ‘struct boost::range_detail::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator*, std::vector > > >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::range_detail::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator*, std::vector > > >]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied*, std::vector > > > >::value’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied*, std::vector > > > >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_*, std::vector > > >)>’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/range/concepts.hpp:373:9: [ skipping 8 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/isomorphism.hpp:651:42: required from ‘bool boost::graph::detail::isomorphism_impl::operator()(const Graph1&, const Graph2&, const ArgPack&) const [with ArgPack = boost::parameter::aux::empty_arg_list; Graph1 = boost::adjacency_list; Graph2 = boost::adjacency_list]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/isomorphism.hpp:662:5: required from ‘typename boost::result_of(Param0, Param1, const ArgPack&)>::type boost::graph::isomorphism_with_named_params(const Param0&, const Param1&, const ArgPack&) [with Param0 = boost::adjacency_list; Param1 = boost::adjacency_list; ArgPack = boost::parameter::aux::empty_arg_list; typename boost::result_of(Param0, Param1, const ArgPack&)>::type = bool]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/isomorphism.hpp:666:1: required from ‘typename boost::result_of(Param0, Param1, const boost::parameter::aux::empty_arg_list&)>::type boost::isomorphism(const Param0&, const Param1&) [with Param0 = adjacency_list; Param1 = adjacency_list; typename result_of(Param0, Param1, const parameter::aux::empty_arg_list&)>::type = bool]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/is_kuratowski_subgraph.hpp:278:34: required from ‘bool boost::is_kuratowski_subgraph(const Graph&, ForwardIterator, ForwardIterator, VertexIndexMap) [with Graph = adjacency_list, property >; ForwardIterator = __gnu_cxx::__normal_iterator*, std::vector > >; VertexIndexMap = vec_adj_list_vertex_id_map, long unsigned int>]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/is_kuratowski_subgraph.hpp:290:34: required from ‘bool boost::is_kuratowski_subgraph(const Graph&, ForwardIterator, ForwardIterator) [with Graph = adjacency_list, property >; ForwardIterator = __gnu_cxx::__normal_iterator*, std::vector > >]’ planar.cpp:435:37: required from here /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::range_detail::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator*, std::vector > > >]’ 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ^ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::range_detail::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator*, std::vector > > >]’: /home/omnipath/local/R/4.4-3.20/BH/include/boost/range/concepts.hpp:373:9: required from ‘struct boost::RandomAccessRangeConcept > >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::RandomAccessRangeConcept > >]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied > > >::value’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied > > >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_ > >)>’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/range/algorithm/sort.hpp:32:5: [ skipping 3 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/isomorphism.hpp:651:42: required from ‘bool boost::graph::detail::isomorphism_impl::operator()(const Graph1&, const Graph2&, const ArgPack&) const [with ArgPack = boost::parameter::aux::empty_arg_list; Graph1 = boost::adjacency_list; Graph2 = boost::adjacency_list]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/isomorphism.hpp:662:5: required from ‘typename boost::result_of(Param0, Param1, const ArgPack&)>::type boost::graph::isomorphism_with_named_params(const Param0&, const Param1&, const ArgPack&) [with Param0 = boost::adjacency_list; Param1 = boost::adjacency_list; ArgPack = boost::parameter::aux::empty_arg_list; typename boost::result_of(Param0, Param1, const ArgPack&)>::type = bool]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/isomorphism.hpp:666:1: required from ‘typename boost::result_of(Param0, Param1, const boost::parameter::aux::empty_arg_list&)>::type boost::isomorphism(const Param0&, const Param1&) [with Param0 = adjacency_list; Param1 = adjacency_list; typename result_of(Param0, Param1, const parameter::aux::empty_arg_list&)>::type = bool]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/is_kuratowski_subgraph.hpp:278:34: required from ‘bool boost::is_kuratowski_subgraph(const Graph&, ForwardIterator, ForwardIterator, VertexIndexMap) [with Graph = adjacency_list, property >; ForwardIterator = __gnu_cxx::__normal_iterator*, std::vector > >; VertexIndexMap = vec_adj_list_vertex_id_map, long unsigned int>]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/is_kuratowski_subgraph.hpp:290:34: required from ‘bool boost::is_kuratowski_subgraph(const Graph&, ForwardIterator, ForwardIterator) [with Graph = adjacency_list, property >; ForwardIterator = __gnu_cxx::__normal_iterator*, std::vector > >]’ planar.cpp:435:37: required from here /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::range_detail::RandomAccessIteratorConcept::~RandomAccessIteratorConcept() [with Iterator = __gnu_cxx::__normal_iterator*, std::vector > >]’ 37 | ~model() | ^ /home/omnipath/local/R/4.4-3.20/BH/include/boost/range/concepts.hpp:245:14: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 245 | BOOST_CONCEPT_USAGE(RandomAccessIteratorConcept) | ^~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements*, std::vector > > > >]’: /home/omnipath/local/R/4.4-3.20/BH/include/boost/range/concepts.hpp:245:14: required from ‘struct boost::range_detail::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator*, std::vector > > >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::range_detail::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator*, std::vector > > >]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied*, std::vector > > > >::value’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied*, std::vector > > > >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_*, std::vector > > >)>’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/range/concepts.hpp:374:9: [ skipping 8 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/isomorphism.hpp:651:42: required from ‘bool boost::graph::detail::isomorphism_impl::operator()(const Graph1&, const Graph2&, const ArgPack&) const [with ArgPack = boost::parameter::aux::empty_arg_list; Graph1 = boost::adjacency_list; Graph2 = boost::adjacency_list]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/isomorphism.hpp:662:5: required from ‘typename boost::result_of(Param0, Param1, const ArgPack&)>::type boost::graph::isomorphism_with_named_params(const Param0&, const Param1&, const ArgPack&) [with Param0 = boost::adjacency_list; Param1 = boost::adjacency_list; ArgPack = boost::parameter::aux::empty_arg_list; typename boost::result_of(Param0, Param1, const ArgPack&)>::type = bool]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/isomorphism.hpp:666:1: required from ‘typename boost::result_of(Param0, Param1, const boost::parameter::aux::empty_arg_list&)>::type boost::isomorphism(const Param0&, const Param1&) [with Param0 = adjacency_list; Param1 = adjacency_list; typename result_of(Param0, Param1, const parameter::aux::empty_arg_list&)>::type = bool]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/is_kuratowski_subgraph.hpp:278:34: required from ‘bool boost::is_kuratowski_subgraph(const Graph&, ForwardIterator, ForwardIterator, VertexIndexMap) [with Graph = adjacency_list, property >; ForwardIterator = __gnu_cxx::__normal_iterator*, std::vector > >; VertexIndexMap = vec_adj_list_vertex_id_map, long unsigned int>]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/is_kuratowski_subgraph.hpp:290:34: required from ‘bool boost::is_kuratowski_subgraph(const Graph&, ForwardIterator, ForwardIterator) [with Graph = adjacency_list, property >; ForwardIterator = __gnu_cxx::__normal_iterator*, std::vector > >]’ planar.cpp:435:37: required from here /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::range_detail::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator*, std::vector > > >]’ 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ^ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::range_detail::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator*, std::vector > > >]’: /home/omnipath/local/R/4.4-3.20/BH/include/boost/range/concepts.hpp:374:9: required from ‘struct boost::RandomAccessRangeConcept > >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::RandomAccessRangeConcept > >]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied > > >::value’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied > > >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_ > >)>’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/range/algorithm/sort.hpp:32:5: [ skipping 3 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/isomorphism.hpp:651:42: required from ‘bool boost::graph::detail::isomorphism_impl::operator()(const Graph1&, const Graph2&, const ArgPack&) const [with ArgPack = boost::parameter::aux::empty_arg_list; Graph1 = boost::adjacency_list; Graph2 = boost::adjacency_list]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/isomorphism.hpp:662:5: required from ‘typename boost::result_of(Param0, Param1, const ArgPack&)>::type boost::graph::isomorphism_with_named_params(const Param0&, const Param1&, const ArgPack&) [with Param0 = boost::adjacency_list; Param1 = boost::adjacency_list; ArgPack = boost::parameter::aux::empty_arg_list; typename boost::result_of(Param0, Param1, const ArgPack&)>::type = bool]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/isomorphism.hpp:666:1: required from ‘typename boost::result_of(Param0, Param1, const boost::parameter::aux::empty_arg_list&)>::type boost::isomorphism(const Param0&, const Param1&) [with Param0 = adjacency_list; Param1 = adjacency_list; typename result_of(Param0, Param1, const parameter::aux::empty_arg_list&)>::type = bool]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/is_kuratowski_subgraph.hpp:278:34: required from ‘bool boost::is_kuratowski_subgraph(const Graph&, ForwardIterator, ForwardIterator, VertexIndexMap) [with Graph = adjacency_list, property >; ForwardIterator = __gnu_cxx::__normal_iterator*, std::vector > >; VertexIndexMap = vec_adj_list_vertex_id_map, long unsigned int>]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/is_kuratowski_subgraph.hpp:290:34: required from ‘bool boost::is_kuratowski_subgraph(const Graph&, ForwardIterator, ForwardIterator) [with Graph = adjacency_list, property >; ForwardIterator = __gnu_cxx::__normal_iterator*, std::vector > >]’ planar.cpp:435:37: required from here /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::range_detail::RandomAccessIteratorConcept::~RandomAccessIteratorConcept() [with Iterator = __gnu_cxx::__normal_iterator*, std::vector > >]’ 37 | ~model() | ^ /home/omnipath/local/R/4.4-3.20/BH/include/boost/range/concepts.hpp:245:14: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 245 | BOOST_CONCEPT_USAGE(RandomAccessIteratorConcept) | ^~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::RandomAccessRangeConcept > >]’: /home/omnipath/local/R/4.4-3.20/BH/include/boost/range/algorithm/sort.hpp:32:5: required from ‘RandomAccessRange& boost::range::sort(RandomAccessRange&, BinaryPredicate) [with RandomAccessRange = std::vector >; BinaryPredicate = boost::detail::isomorphism_algo, boost::adjacency_list, boost::shared_array_property_map >, boost::degree_vertex_invariant >, boost::adjacency_list >, boost::degree_vertex_invariant >, boost::adjacency_list >, boost::vec_adj_list_vertex_id_map, boost::vec_adj_list_vertex_id_map >::edge_cmp]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/isomorphism.hpp:226:17: required from ‘bool boost::detail::isomorphism_algo::test_isomorphism() [with Graph1 = boost::adjacency_list; Graph2 = boost::adjacency_list; IsoMapping = boost::shared_array_property_map >; Invariant1 = boost::degree_vertex_invariant >, boost::adjacency_list >; Invariant2 = boost::degree_vertex_invariant >, boost::adjacency_list >; IndexMap1 = boost::vec_adj_list_vertex_id_map; IndexMap2 = boost::vec_adj_list_vertex_id_map]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/isomorphism.hpp:532:33: required from ‘bool boost::isomorphism(const Graph1&, const Graph2&, IsoMapping, Invariant1, Invariant2, std::size_t, IndexMap1, IndexMap2) [with Graph1 = adjacency_list; Graph2 = adjacency_list; IsoMapping = shared_array_property_map >; Invariant1 = degree_vertex_invariant >, adjacency_list >; Invariant2 = degree_vertex_invariant >, adjacency_list >; IndexMap1 = vec_adj_list_vertex_id_map; IndexMap2 = vec_adj_list_vertex_id_map; std::size_t = long unsigned int]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/isomorphism.hpp:651:42: required from ‘bool boost::graph::detail::isomorphism_impl::operator()(const Graph1&, const Graph2&, const ArgPack&) const [with ArgPack = boost::parameter::aux::empty_arg_list; Graph1 = boost::adjacency_list; Graph2 = boost::adjacency_list]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/isomorphism.hpp:662:5: required from ‘typename boost::result_of(Param0, Param1, const ArgPack&)>::type boost::graph::isomorphism_with_named_params(const Param0&, const Param1&, const ArgPack&) [with Param0 = boost::adjacency_list; Param1 = boost::adjacency_list; ArgPack = boost::parameter::aux::empty_arg_list; typename boost::result_of(Param0, Param1, const ArgPack&)>::type = bool]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/isomorphism.hpp:666:1: required from ‘typename boost::result_of(Param0, Param1, const boost::parameter::aux::empty_arg_list&)>::type boost::isomorphism(const Param0&, const Param1&) [with Param0 = adjacency_list; Param1 = adjacency_list; typename result_of(Param0, Param1, const parameter::aux::empty_arg_list&)>::type = bool]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/is_kuratowski_subgraph.hpp:278:34: required from ‘bool boost::is_kuratowski_subgraph(const Graph&, ForwardIterator, ForwardIterator, VertexIndexMap) [with Graph = adjacency_list, property >; ForwardIterator = __gnu_cxx::__normal_iterator*, std::vector > >; VertexIndexMap = vec_adj_list_vertex_id_map, long unsigned int>]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/is_kuratowski_subgraph.hpp:290:34: required from ‘bool boost::is_kuratowski_subgraph(const Graph&, ForwardIterator, ForwardIterator) [with Graph = adjacency_list, property >; ForwardIterator = __gnu_cxx::__normal_iterator*, std::vector > >]’ planar.cpp:435:37: required from here /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/range/concepts.hpp:370:12: note: in a call to non-static member function ‘boost::RandomAccessRangeConcept > >::~RandomAccessRangeConcept()’ 370 | struct RandomAccessRangeConcept : BidirectionalRangeConcept | ^~~~~~~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::constraint::failed() [with Model = boost::DFSVisitorConcept, boost::filtered_graph, boost::keep_all, boost::maximum_cardinality_matching_verifier, long unsigned int*, boost::vec_adj_list_vertex_id_map, long unsigned int> >::non_odd_vertex >, boost::vec_adj_list_vertex_id_map, long unsigned int>, int, int&> > > >]’: /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/depth_first_search.hpp:130:9: required from ‘void boost::depth_first_search(const VertexListGraph&, DFSVisitor, ColorMap, typename graph_traits::vertex_descriptor) [with VertexListGraph = filtered_graph, keep_all, maximum_cardinality_matching_verifier, long unsigned int*, vec_adj_list_vertex_id_map, long unsigned int> >::non_odd_vertex >, vec_adj_list_vertex_id_map, long unsigned int>, int, int&> > >; DFSVisitor = detail::odd_components_counter; ColorMap = shared_array_property_map, long unsigned int> >; typename graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/depth_first_search.hpp:397:42: required from ‘void boost::graph::detail::depth_first_search_impl::operator()(const Graph&, const ArgPack&) const [with ArgPack = boost::parameter::aux::arg_list, long unsigned int> >, boost::parameter::aux::arg_list >, boost::parameter::aux::empty_arg_list, std::integral_constant >, std::integral_constant >; Graph = boost::filtered_graph, boost::keep_all, boost::maximum_cardinality_matching_verifier, long unsigned int*, boost::vec_adj_list_vertex_id_map, long unsigned int> >::non_odd_vertex >, boost::vec_adj_list_vertex_id_map, long unsigned int>, int, int&> > >]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/depth_first_search.hpp:406:5: required from ‘typename boost::result_of(Param0, const ArgPack&)>::type boost::graph::depth_first_search_with_named_params(const Param0&, const ArgPack&) [with Param0 = boost::filtered_graph, boost::keep_all, boost::maximum_cardinality_matching_verifier, long unsigned int*, boost::vec_adj_list_vertex_id_map, long unsigned int> >::non_odd_vertex >, boost::vec_adj_list_vertex_id_map, long unsigned int>, int, int&> > >; ArgPack = boost::parameter::aux::arg_list, long unsigned int> >, boost::parameter::aux::arg_list >, boost::parameter::aux::empty_arg_list, std::integral_constant >, std::integral_constant >; typename boost::result_of(Param0, const ArgPack&)>::type = void]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/depth_first_search.hpp:409:1: required from ‘typename boost::result_of(Param0, const typename boost::detail::convert_bgl_params_to_boost_parameter >::type&)>::type boost::depth_first_search(const Param0&, const bgl_named_params&) [with Param0 = filtered_graph, keep_all, maximum_cardinality_matching_verifier, long unsigned int*, vec_adj_list_vertex_id_map, long unsigned int> >::non_odd_vertex >, vec_adj_list_vertex_id_map, long unsigned int>, int, int&> > >; P = vec_adj_list_vertex_id_map, long unsigned int>; T = vertex_index_t; R = bgl_named_params, graph_visitor_t, no_property>; typename result_of(Param0, const typename detail::convert_bgl_params_to_boost_parameter >::type&)>::type = void; typename detail::convert_bgl_params_to_boost_parameter >::type = parameter::aux::arg_list, long unsigned int> >, parameter::aux::arg_list >, parameter::aux::empty_arg_list, std::integral_constant >, std::integral_constant >]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/max_cardinality_matching.hpp:779:27: required from ‘static bool boost::maximum_cardinality_matching_verifier::verify_matching(const Graph&, MateMap, VertexIndexMap) [with Graph = R_adjacency_list; MateMap = long unsigned int*; VertexIndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/max_cardinality_matching.hpp:807:79: required from ‘bool boost::matching(const Graph&, MateMap, VertexIndexMap) [with Graph = R_adjacency_list; MateMap = long unsigned int*; VertexIndexMap = vec_adj_list_vertex_id_map, long unsigned int>; AugmentingPathFinder = edmonds_augmenting_path_finder; InitialMatchingFinder = extra_greedy_matching; MatchingVerifier = maximum_cardinality_matching_verifier]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/max_cardinality_matching.hpp:817:48: required from ‘bool boost::checked_edmonds_maximum_cardinality_matching(const Graph&, MateMap, VertexIndexMap) [with Graph = R_adjacency_list; MateMap = long unsigned int*; VertexIndexMap = vec_adj_list_vertex_id_map, long unsigned int>]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/max_cardinality_matching.hpp:824:56: required from ‘bool boost::checked_edmonds_maximum_cardinality_matching(const Graph&, MateMap) [with Graph = R_adjacency_list; MateMap = long unsigned int*]’ planar.cpp:686:60: required from here /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:65:52: warning: ‘this’ pointer is null [-Wnonnull] 65 | static void failed() { ((Model*)0)->constraints(); } | ~~~~~~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/depth_first_search.hpp:39:10: note: in a call to non-static member function ‘void boost::DFSVisitorConcept::constraints() [with Visitor = boost::detail::odd_components_counter; Graph = boost::filtered_graph, boost::keep_all, boost::maximum_cardinality_matching_verifier, long unsigned int*, boost::vec_adj_list_vertex_id_map, long unsigned int> >::non_odd_vertex >, boost::vec_adj_list_vertex_id_map, long unsigned int>, int, int&> > >]’ 39 | void constraints() | ^~~~~~~~~~~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>, boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>, boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>, boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>, boost::iterator_property_map<__gnu_cxx::__normal_iterator*, std::vector > >, boost::vec_adj_list_vertex_id_map, long unsigned int>, boost::detail::edge_desc_impl, boost::detail::edge_desc_impl&>, long unsigned int> > >]’: /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:167:5: required from ‘struct boost::CopyConstructible >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>, boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>, boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>, boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>, boost::iterator_property_map<__gnu_cxx::__normal_iterator*, std::vector > >, boost::vec_adj_list_vertex_id_map, long unsigned int>, boost::detail::edge_desc_impl, boost::detail::edge_desc_impl&>, long unsigned int> >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:165:3: required from ‘struct boost::CopyConstructibleConcept >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>, boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>, boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>, boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>, boost::iterator_property_map<__gnu_cxx::__normal_iterator*, std::vector > >, boost::vec_adj_list_vertex_id_map, long unsigned int>, boost::detail::edge_desc_impl, boost::detail::edge_desc_impl&>, long unsigned int> >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::CopyConstructibleConcept >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>, boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>, boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>, boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>, boost::iterator_property_map<__gnu_cxx::__normal_iterator*, std::vector > >, boost::vec_adj_list_vertex_id_map, long unsigned int>, boost::detail::edge_desc_impl, boost::detail::edge_desc_impl&>, long unsigned int> >]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>, boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>, boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>, boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>, boost::iterator_property_map<__gnu_cxx::__normal_iterator*, std::vector > >, boost::vec_adj_list_vertex_id_map, long unsigned int>, boost::detail::edge_desc_impl, boost::detail::edge_desc_impl&>, long unsigned int> > >::value’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>, boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>, boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>, boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>, boost::iterator_property_map<__gnu_cxx::__normal_iterator*, std::vector > >, boost::vec_adj_list_vertex_id_map, long unsigned int>, boost::detail::edge_desc_impl, boost::detail::edge_desc_impl&>, long unsigned int> > >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:72:8: [ skipping 9 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/depth_first_search.hpp:409:1: required from ‘typename boost::result_of(Param0, const typename boost::detail::convert_bgl_params_to_boost_parameter >::type&)>::type boost::depth_first_search(const Param0&, const bgl_named_params&) [with Param0 = adjacency_list, property >; P = vec_adj_list_vertex_id_map, long unsigned int>; T = vertex_index_t; R = bgl_named_params >, vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>, iterator_property_map<__gnu_cxx::__normal_iterator >, vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>, iterator_property_map<__gnu_cxx::__normal_iterator >, vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>, iterator_property_map<__gnu_cxx::__normal_iterator >, vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>, iterator_property_map<__gnu_cxx::__normal_iterator*, std::vector > >, vec_adj_list_vertex_id_map, long unsigned int>, detail::edge_desc_impl, detail::edge_desc_impl&>, long unsigned int>, graph_visitor_t, no_property>; typename result_of(Param0, const typename detail::convert_bgl_params_to_boost_parameter >::type&)>::type = void; typename detail::convert_bgl_params_to_boost_parameter >::type = parameter::aux::arg_list, long unsigned int> >, parameter::aux::arg_list >, vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>, iterator_property_map<__gnu_cxx::__normal_iterator >, vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>, iterator_property_map<__gnu_cxx::__normal_iterator >, vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>, iterator_property_map<__gnu_cxx::__normal_iterator >, vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>, iterator_property_map<__gnu_cxx::__normal_iterator*, std::vector > >, vec_adj_list_vertex_id_map, long unsigned int>, detail::edge_desc_impl, detail::edge_desc_impl&>, long unsigned int> >, parameter::aux::empty_arg_list, std::integral_constant >, std::integral_constant >]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/planar_detail/boyer_myrvold_impl.hpp:251:27: required from ‘boost::boyer_myrvold_impl::boyer_myrvold_impl(const Graph&, VertexIndexMap) [with Graph = boost::adjacency_list, boost::property >; VertexIndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>; StoreOldHandlesPolicy = boost::graph::detail::no_old_handles; StoreEmbeddingPolicy = boost::graph::detail::no_embedding]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/boyer_myrvold_planar_test.hpp:66:17: required from ‘bool boost::boyer_myrvold_params::core::dispatched_boyer_myrvold(const ArgumentPack&, mpl_::true_, mpl_::true_) [with ArgumentPack = boost::parameter::aux::flat_like_arg_list, boost::property, boost::no_property, boost::listS> > >, std::integral_constant > >; mpl_::true_ = mpl_::bool_]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/boyer_myrvold_planar_test.hpp:211:44: required from ‘bool boost::boyer_myrvold_params::core::boyer_myrvold_planarity_test(const ArgumentPack&) [with ArgumentPack = boost::parameter::aux::flat_like_arg_list, boost::property, boost::no_property, boost::listS> > >, std::integral_constant > >]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/boyer_myrvold_planar_test.hpp:223:68: required from ‘bool boost::boyer_myrvold_planarity_test(const A0&) [with A0 = adjacency_list, property >]’ planar.cpp:121:48: required from here /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::CopyConstructible >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>, boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>, boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>, boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>, boost::iterator_property_map<__gnu_cxx::__normal_iterator*, std::vector > >, boost::vec_adj_list_vertex_id_map, long unsigned int>, boost::detail::edge_desc_impl, boost::detail::edge_desc_impl&>, long unsigned int> >]’ 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ^ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::CopyConstructibleConcept >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>, boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>, boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>, boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>, boost::iterator_property_map<__gnu_cxx::__normal_iterator*, std::vector > >, boost::vec_adj_list_vertex_id_map, long unsigned int>, boost::detail::edge_desc_impl, boost::detail::edge_desc_impl&>, long unsigned int> >]’: /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/depth_first_search.hpp:41:9: required from ‘void boost::DFSVisitorConcept::constraints() [with Visitor = boost::planar_dfs_visitor >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>, boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>, boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>, boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>, boost::iterator_property_map<__gnu_cxx::__normal_iterator*, std::vector > >, boost::vec_adj_list_vertex_id_map, long unsigned int>, boost::detail::edge_desc_impl, boost::detail::edge_desc_impl&>, long unsigned int>; Graph = boost::adjacency_list, boost::property >]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::DFSVisitorConcept >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>, boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>, boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>, boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>, boost::iterator_property_map<__gnu_cxx::__normal_iterator*, std::vector > >, boost::vec_adj_list_vertex_id_map, long unsigned int>, boost::detail::edge_desc_impl, boost::detail::edge_desc_impl&>, long unsigned int>, boost::adjacency_list, boost::property > >]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>, boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>, boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>, boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>, boost::iterator_property_map<__gnu_cxx::__normal_iterator*, std::vector > >, boost::vec_adj_list_vertex_id_map, long unsigned int>, boost::detail::edge_desc_impl, boost::detail::edge_desc_impl&>, long unsigned int>, boost::adjacency_list, boost::property > > >::value’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>, boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>, boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>, boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>, boost::iterator_property_map<__gnu_cxx::__normal_iterator*, std::vector > >, boost::vec_adj_list_vertex_id_map, long unsigned int>, boost::detail::edge_desc_impl, boost::detail::edge_desc_impl&>, long unsigned int>, boost::adjacency_list, boost::property > > >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_ >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>, boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>, boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>, boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>, boost::iterator_property_map<__gnu_cxx::__normal_iterator*, std::vector > >, boost::vec_adj_list_vertex_id_map, long unsigned int>, boost::detail::edge_desc_impl, boost::detail::edge_desc_impl&>, long unsigned int>, boost::adjacency_list, boost::property > >)>’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/depth_first_search.hpp:130:9: [ skipping 3 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/depth_first_search.hpp:409:1: required from ‘typename boost::result_of(Param0, const typename boost::detail::convert_bgl_params_to_boost_parameter >::type&)>::type boost::depth_first_search(const Param0&, const bgl_named_params&) [with Param0 = adjacency_list, property >; P = vec_adj_list_vertex_id_map, long unsigned int>; T = vertex_index_t; R = bgl_named_params >, vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>, iterator_property_map<__gnu_cxx::__normal_iterator >, vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>, iterator_property_map<__gnu_cxx::__normal_iterator >, vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>, iterator_property_map<__gnu_cxx::__normal_iterator >, vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>, iterator_property_map<__gnu_cxx::__normal_iterator*, std::vector > >, vec_adj_list_vertex_id_map, long unsigned int>, detail::edge_desc_impl, detail::edge_desc_impl&>, long unsigned int>, graph_visitor_t, no_property>; typename result_of(Param0, const typename detail::convert_bgl_params_to_boost_parameter >::type&)>::type = void; typename detail::convert_bgl_params_to_boost_parameter >::type = parameter::aux::arg_list, long unsigned int> >, parameter::aux::arg_list >, vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>, iterator_property_map<__gnu_cxx::__normal_iterator >, vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>, iterator_property_map<__gnu_cxx::__normal_iterator >, vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>, iterator_property_map<__gnu_cxx::__normal_iterator >, vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>, iterator_property_map<__gnu_cxx::__normal_iterator*, std::vector > >, vec_adj_list_vertex_id_map, long unsigned int>, detail::edge_desc_impl, detail::edge_desc_impl&>, long unsigned int> >, parameter::aux::empty_arg_list, std::integral_constant >, std::integral_constant >]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/planar_detail/boyer_myrvold_impl.hpp:251:27: required from ‘boost::boyer_myrvold_impl::boyer_myrvold_impl(const Graph&, VertexIndexMap) [with Graph = boost::adjacency_list, boost::property >; VertexIndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>; StoreOldHandlesPolicy = boost::graph::detail::no_old_handles; StoreEmbeddingPolicy = boost::graph::detail::no_embedding]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/boyer_myrvold_planar_test.hpp:66:17: required from ‘bool boost::boyer_myrvold_params::core::dispatched_boyer_myrvold(const ArgumentPack&, mpl_::true_, mpl_::true_) [with ArgumentPack = boost::parameter::aux::flat_like_arg_list, boost::property, boost::no_property, boost::listS> > >, std::integral_constant > >; mpl_::true_ = mpl_::bool_]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/boyer_myrvold_planar_test.hpp:211:44: required from ‘bool boost::boyer_myrvold_params::core::boyer_myrvold_planarity_test(const ArgumentPack&) [with ArgumentPack = boost::parameter::aux::flat_like_arg_list, boost::property, boost::no_property, boost::listS> > >, std::integral_constant > >]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/boyer_myrvold_planar_test.hpp:223:68: required from ‘bool boost::boyer_myrvold_planarity_test(const A0&) [with A0 = adjacency_list, property >]’ planar.cpp:121:48: required from here /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:165:17: note: in a call to non-static member function ‘boost::CopyConstructibleConcept >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>, boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>, boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>, boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>, boost::iterator_property_map<__gnu_cxx::__normal_iterator*, std::vector > >, boost::vec_adj_list_vertex_id_map, long unsigned int>, boost::detail::edge_desc_impl, boost::detail::edge_desc_impl&>, long unsigned int> >::~CopyConstructibleConcept()’ 165 | BOOST_concept(CopyConstructible,(TT)) | ^~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/preprocessor/cat.hpp:29:34: note: in definition of macro ‘BOOST_PP_CAT_I’ 29 | # define BOOST_PP_CAT_I(a, b) a ## b | ^ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/concept_def.hpp:23:12: note: in expansion of macro ‘BOOST_PP_CAT’ 23 | struct BOOST_PP_CAT(name,Concept) \ | ^~~~~~~~~~~~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:165:3: note: in expansion of macro ‘BOOST_concept’ 165 | BOOST_concept(CopyConstructible,(TT)) | ^~~~~~~~~~~~~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements > >, boost::property >*, std::vector > >, boost::property >, std::allocator > >, boost::property > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >]’: /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/graph_concepts.hpp:52:50: required from ‘struct boost::concepts::MultiPassInputIterator > >, boost::property >*, std::vector > >, boost::property >, std::allocator > >, boost::property > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::concepts::MultiPassInputIterator > >, boost::property >*, std::vector > >, boost::property >, std::allocator > >, boost::property > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> >]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied > >, boost::property >*, std::vector > >, boost::property >, std::allocator > >, boost::property > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::value’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied > >, boost::property >*, std::vector > >, boost::property >, std::allocator > >, boost::property > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_ > >, boost::property >*, std::vector > >, boost::property >, std::allocator > >, boost::property > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> >)>’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/graph_concepts.hpp:89:9: [ skipping 4 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/depth_first_search.hpp:397:42: required from ‘void boost::graph::detail::depth_first_search_impl::operator()(const Graph&, const ArgPack&) const [with ArgPack = boost::parameter::aux::arg_list >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&> > >, boost::parameter::aux::empty_arg_list, std::integral_constant >; Graph = boost::adjacency_list, boost::property >]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/depth_first_search.hpp:406:5: required from ‘typename boost::result_of(Param0, const ArgPack&)>::type boost::graph::depth_first_search_with_named_params(const Param0&, const ArgPack&) [with Param0 = boost::adjacency_list, boost::property >; ArgPack = boost::parameter::aux::arg_list >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&> > >, boost::parameter::aux::empty_arg_list, std::integral_constant >; typename boost::result_of(Param0, const ArgPack&)>::type = void]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/depth_first_search.hpp:409:1: required from ‘typename boost::result_of(Param0, const typename boost::detail::convert_bgl_params_to_boost_parameter >::type&)>::type boost::depth_first_search(const Param0&, const bgl_named_params&) [with Param0 = adjacency_list, property >; P = detail::components_recorder >, vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&> >; T = graph_visitor_t; R = no_property; typename result_of(Param0, const typename detail::convert_bgl_params_to_boost_parameter >::type&)>::type = void; typename detail::convert_bgl_params_to_boost_parameter >::type = parameter::aux::arg_list >, vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&> > >, parameter::aux::empty_arg_list, std::integral_constant >]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/connected_components.hpp:106:23: required from ‘typename boost::property_traits::value_type boost::connected_components(const Graph&, ComponentMap, typename enable_if_c::traversal_category>::value, graph::detail::no_parameter>::type) [with Graph = adjacency_list, property >; ComponentMap = iterator_property_map<__gnu_cxx::__normal_iterator >, vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>; typename property_traits::value_type = long unsigned int; typename enable_if_c::traversal_category>::value, graph::detail::no_parameter>::type = graph::detail::no_parameter; typename graph_traits::traversal_category = undir_adj_list_traversal_tag]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/make_connected.hpp:38:51: required from ‘void boost::make_connected(Graph&, VertexIndexMap, AddEdgeVisitor&) [with Graph = adjacency_list, property >; VertexIndexMap = vec_adj_list_vertex_id_map, long unsigned int>; AddEdgeVisitor = my_add_edge_visitor, property >, long unsigned int>]’ planar.cpp:211:26: required from here /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::concepts::MultiPassInputIterator > >, boost::property >*, std::vector > >, boost::property >, std::allocator > >, boost::property > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> >]’ 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ^ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::MultiPassInputIterator > >, boost::property >*, std::vector > >, boost::property >, std::allocator > >, boost::property > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> >]’: /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/graph_concepts.hpp:89:9: required from ‘boost::concepts::IncidenceGraph::~IncidenceGraph() [with G = boost::adjacency_list, boost::property >]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/graph_concepts.hpp:75:1: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::IncidenceGraphConcept, boost::property > >]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/depth_first_search.hpp:129:9: required from ‘void boost::detail::depth_first_visit_impl(const IncidenceGraph&, typename boost::graph_traits::vertex_descriptor, DFSVisitor&, ColorMap, TerminatorFunc) [with IncidenceGraph = boost::adjacency_list, boost::property >; DFSVisitor = components_recorder >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&> >; ColorMap = boost::shared_array_property_map, long unsigned int> >; TerminatorFunc = nontruth2; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/depth_first_search.hpp:286:39: required from ‘void boost::depth_first_search(const VertexListGraph&, DFSVisitor, ColorMap, typename graph_traits::vertex_descriptor) [with VertexListGraph = adjacency_list, property >; DFSVisitor = detail::components_recorder >, vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&> >; ColorMap = shared_array_property_map, long unsigned int> >; typename graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/depth_first_search.hpp:397:42: required from ‘void boost::graph::detail::depth_first_search_impl::operator()(const Graph&, const ArgPack&) const [with ArgPack = boost::parameter::aux::arg_list >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&> > >, boost::parameter::aux::empty_arg_list, std::integral_constant >; Graph = boost::adjacency_list, boost::property >]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/depth_first_search.hpp:406:5: required from ‘typename boost::result_of(Param0, const ArgPack&)>::type boost::graph::depth_first_search_with_named_params(const Param0&, const ArgPack&) [with Param0 = boost::adjacency_list, boost::property >; ArgPack = boost::parameter::aux::arg_list >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&> > >, boost::parameter::aux::empty_arg_list, std::integral_constant >; typename boost::result_of(Param0, const ArgPack&)>::type = void]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/depth_first_search.hpp:409:1: required from ‘typename boost::result_of(Param0, const typename boost::detail::convert_bgl_params_to_boost_parameter >::type&)>::type boost::depth_first_search(const Param0&, const bgl_named_params&) [with Param0 = adjacency_list, property >; P = detail::components_recorder >, vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&> >; T = graph_visitor_t; R = no_property; typename result_of(Param0, const typename detail::convert_bgl_params_to_boost_parameter >::type&)>::type = void; typename detail::convert_bgl_params_to_boost_parameter >::type = parameter::aux::arg_list >, vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&> > >, parameter::aux::empty_arg_list, std::integral_constant >]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/connected_components.hpp:106:23: required from ‘typename boost::property_traits::value_type boost::connected_components(const Graph&, ComponentMap, typename enable_if_c::traversal_category>::value, graph::detail::no_parameter>::type) [with Graph = adjacency_list, property >; ComponentMap = iterator_property_map<__gnu_cxx::__normal_iterator >, vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>; typename property_traits::value_type = long unsigned int; typename enable_if_c::traversal_category>::value, graph::detail::no_parameter>::type = graph::detail::no_parameter; typename graph_traits::traversal_category = undir_adj_list_traversal_tag]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/make_connected.hpp:38:51: required from ‘void boost::make_connected(Graph&, VertexIndexMap, AddEdgeVisitor&) [with Graph = adjacency_list, property >; VertexIndexMap = vec_adj_list_vertex_id_map, long unsigned int>; AddEdgeVisitor = my_add_edge_visitor, property >, long unsigned int>]’ planar.cpp:211:26: required from here /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::concepts::MultiPassInputIterator::~MultiPassInputIterator() [with T = boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >, boost::property >*, std::vector > >, boost::property >, std::allocator > >, boost::property > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>]’ 37 | ~model() | ^ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/graph_concepts.hpp:52:50: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 52 | BOOST_concept(MultiPassInputIterator, (T)) { BOOST_CONCEPT_USAGE( | ^~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements >]’: /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:208:5: required from ‘struct boost::Convertible’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::Convertible]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied >::value’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_)>’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/graph_concepts.hpp:93:9: [ skipping 4 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/depth_first_search.hpp:397:42: required from ‘void boost::graph::detail::depth_first_search_impl::operator()(const Graph&, const ArgPack&) const [with ArgPack = boost::parameter::aux::arg_list >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&> > >, boost::parameter::aux::empty_arg_list, std::integral_constant >; Graph = boost::adjacency_list, boost::property >]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/depth_first_search.hpp:406:5: required from ‘typename boost::result_of(Param0, const ArgPack&)>::type boost::graph::depth_first_search_with_named_params(const Param0&, const ArgPack&) [with Param0 = boost::adjacency_list, boost::property >; ArgPack = boost::parameter::aux::arg_list >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&> > >, boost::parameter::aux::empty_arg_list, std::integral_constant >; typename boost::result_of(Param0, const ArgPack&)>::type = void]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/depth_first_search.hpp:409:1: required from ‘typename boost::result_of(Param0, const typename boost::detail::convert_bgl_params_to_boost_parameter >::type&)>::type boost::depth_first_search(const Param0&, const bgl_named_params&) [with Param0 = adjacency_list, property >; P = detail::components_recorder >, vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&> >; T = graph_visitor_t; R = no_property; typename result_of(Param0, const typename detail::convert_bgl_params_to_boost_parameter >::type&)>::type = void; typename detail::convert_bgl_params_to_boost_parameter >::type = parameter::aux::arg_list >, vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&> > >, parameter::aux::empty_arg_list, std::integral_constant >]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/connected_components.hpp:106:23: required from ‘typename boost::property_traits::value_type boost::connected_components(const Graph&, ComponentMap, typename enable_if_c::traversal_category>::value, graph::detail::no_parameter>::type) [with Graph = adjacency_list, property >; ComponentMap = iterator_property_map<__gnu_cxx::__normal_iterator >, vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>; typename property_traits::value_type = long unsigned int; typename enable_if_c::traversal_category>::value, graph::detail::no_parameter>::type = graph::detail::no_parameter; typename graph_traits::traversal_category = undir_adj_list_traversal_tag]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/make_connected.hpp:38:51: required from ‘void boost::make_connected(Graph&, VertexIndexMap, AddEdgeVisitor&) [with Graph = adjacency_list, property >; VertexIndexMap = vec_adj_list_vertex_id_map, long unsigned int>; AddEdgeVisitor = my_add_edge_visitor, property >, long unsigned int>]’ planar.cpp:211:26: required from here /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::Convertible]’ 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ^ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::Convertible]’: /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/graph_concepts.hpp:93:9: required from ‘boost::concepts::IncidenceGraph::~IncidenceGraph() [with G = boost::adjacency_list, boost::property >]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/graph_concepts.hpp:75:1: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::IncidenceGraphConcept, boost::property > >]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/depth_first_search.hpp:129:9: required from ‘void boost::detail::depth_first_visit_impl(const IncidenceGraph&, typename boost::graph_traits::vertex_descriptor, DFSVisitor&, ColorMap, TerminatorFunc) [with IncidenceGraph = boost::adjacency_list, boost::property >; DFSVisitor = components_recorder >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&> >; ColorMap = boost::shared_array_property_map, long unsigned int> >; TerminatorFunc = nontruth2; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/depth_first_search.hpp:286:39: required from ‘void boost::depth_first_search(const VertexListGraph&, DFSVisitor, ColorMap, typename graph_traits::vertex_descriptor) [with VertexListGraph = adjacency_list, property >; DFSVisitor = detail::components_recorder >, vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&> >; ColorMap = shared_array_property_map, long unsigned int> >; typename graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/depth_first_search.hpp:397:42: required from ‘void boost::graph::detail::depth_first_search_impl::operator()(const Graph&, const ArgPack&) const [with ArgPack = boost::parameter::aux::arg_list >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&> > >, boost::parameter::aux::empty_arg_list, std::integral_constant >; Graph = boost::adjacency_list, boost::property >]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/depth_first_search.hpp:406:5: required from ‘typename boost::result_of(Param0, const ArgPack&)>::type boost::graph::depth_first_search_with_named_params(const Param0&, const ArgPack&) [with Param0 = boost::adjacency_list, boost::property >; ArgPack = boost::parameter::aux::arg_list >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&> > >, boost::parameter::aux::empty_arg_list, std::integral_constant >; typename boost::result_of(Param0, const ArgPack&)>::type = void]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/depth_first_search.hpp:409:1: required from ‘typename boost::result_of(Param0, const typename boost::detail::convert_bgl_params_to_boost_parameter >::type&)>::type boost::depth_first_search(const Param0&, const bgl_named_params&) [with Param0 = adjacency_list, property >; P = detail::components_recorder >, vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&> >; T = graph_visitor_t; R = no_property; typename result_of(Param0, const typename detail::convert_bgl_params_to_boost_parameter >::type&)>::type = void; typename detail::convert_bgl_params_to_boost_parameter >::type = parameter::aux::arg_list >, vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&> > >, parameter::aux::empty_arg_list, std::integral_constant >]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/connected_components.hpp:106:23: required from ‘typename boost::property_traits::value_type boost::connected_components(const Graph&, ComponentMap, typename enable_if_c::traversal_category>::value, graph::detail::no_parameter>::type) [with Graph = adjacency_list, property >; ComponentMap = iterator_property_map<__gnu_cxx::__normal_iterator >, vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>; typename property_traits::value_type = long unsigned int; typename enable_if_c::traversal_category>::value, graph::detail::no_parameter>::type = graph::detail::no_parameter; typename graph_traits::traversal_category = undir_adj_list_traversal_tag]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/make_connected.hpp:38:51: required from ‘void boost::make_connected(Graph&, VertexIndexMap, AddEdgeVisitor&) [with Graph = adjacency_list, property >; VertexIndexMap = vec_adj_list_vertex_id_map, long unsigned int>; AddEdgeVisitor = my_add_edge_visitor, property >, long unsigned int>]’ planar.cpp:211:26: required from here /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::Convertible::~Convertible() [with X = boost::undir_adj_list_traversal_tag; Y = boost::incidence_graph_tag]’ 37 | ~model() | ^ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:208:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 208 | BOOST_CONCEPT_USAGE(Convertible) { | ^~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::Convertible]’: /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements >]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:208:5: required from ‘struct boost::Convertible’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::Convertible]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied >::value’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:72:8: [ skipping 13 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.4-3.20/BH/include/boost/property_map/property_map.hpp:354:5: required from ‘boost::iterator_property_map boost::make_iterator_property_map(RAIter, ID, Value) [with RAIter = __gnu_cxx::__normal_iterator >; Value = long unsigned int; ID = vec_adj_list_vertex_id_map, long unsigned int>]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/biconnected_components.hpp:338:43: required from ‘static std::pair boost::detail::bicomp_dispatch1::apply(const Graph&, ComponentMap, OutputIterator, VertexIndexMap, const boost::bgl_named_params&, boost::param_not_found) [with Graph = boost::adjacency_list, boost::property >; ComponentMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::adj_list_edge_property_map, boost::edge_index_t>, long unsigned int, long unsigned int&>; OutputIterator = std::back_insert_iterator >; VertexIndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>; P = int; T = boost::buffer_param_t; R = boost::no_property]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/biconnected_components.hpp:368:60: required from ‘std::pair boost::biconnected_components(const Graph&, ComponentMap, OutputIterator, const bgl_named_params&) [with Graph = adjacency_list, property >; ComponentMap = iterator_property_map<__gnu_cxx::__normal_iterator >, adj_list_edge_property_map, edge_index_t>, long unsigned int, long unsigned int&>; OutputIterator = std::back_insert_iterator >; P = int; T = buffer_param_t; R = no_property]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/biconnected_components.hpp:377:34: required from ‘std::pair boost::biconnected_components(const Graph&, ComponentMap, OutputIterator) [with Graph = adjacency_list, property >; ComponentMap = iterator_property_map<__gnu_cxx::__normal_iterator >, adj_list_edge_property_map, edge_index_t>, long unsigned int, long unsigned int&>; OutputIterator = std::back_insert_iterator >]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/make_biconnected_planar.hpp:44:27: required from ‘void boost::make_biconnected_planar(Graph&, PlanarEmbedding, EdgeIndexMap, AddEdgeVisitor&) [with Graph = adjacency_list, property >; PlanarEmbedding = std::vector >*; EdgeIndexMap = adj_list_edge_property_map, edge_index_t>; AddEdgeVisitor = my_add_edge_visitor, property >, long unsigned int>]’ planar.cpp:213:35: required from here /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::Convertible::~Convertible() [with X = std::random_access_iterator_tag; Y = std::input_iterator_tag]’ 37 | ~model() | ^ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:208:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 208 | BOOST_CONCEPT_USAGE(Convertible) { | ^~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::Convertible]’: /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements >]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:208:5: required from ‘struct boost::Convertible’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::Convertible]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied >::value’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:72:8: [ skipping 12 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.4-3.20/BH/include/boost/property_map/property_map.hpp:354:5: required from ‘boost::iterator_property_map boost::make_iterator_property_map(RAIter, ID, Value) [with RAIter = __gnu_cxx::__normal_iterator >; Value = long unsigned int; ID = vec_adj_list_vertex_id_map, long unsigned int>]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/biconnected_components.hpp:338:43: required from ‘static std::pair boost::detail::bicomp_dispatch1::apply(const Graph&, ComponentMap, OutputIterator, VertexIndexMap, const boost::bgl_named_params&, boost::param_not_found) [with Graph = boost::adjacency_list, boost::property >; ComponentMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::adj_list_edge_property_map, boost::edge_index_t>, long unsigned int, long unsigned int&>; OutputIterator = std::back_insert_iterator >; VertexIndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>; P = int; T = boost::buffer_param_t; R = boost::no_property]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/biconnected_components.hpp:368:60: required from ‘std::pair boost::biconnected_components(const Graph&, ComponentMap, OutputIterator, const bgl_named_params&) [with Graph = adjacency_list, property >; ComponentMap = iterator_property_map<__gnu_cxx::__normal_iterator >, adj_list_edge_property_map, edge_index_t>, long unsigned int, long unsigned int&>; OutputIterator = std::back_insert_iterator >; P = int; T = buffer_param_t; R = no_property]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/biconnected_components.hpp:377:34: required from ‘std::pair boost::biconnected_components(const Graph&, ComponentMap, OutputIterator) [with Graph = adjacency_list, property >; ComponentMap = iterator_property_map<__gnu_cxx::__normal_iterator >, adj_list_edge_property_map, edge_index_t>, long unsigned int, long unsigned int&>; OutputIterator = std::back_insert_iterator >]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/make_biconnected_planar.hpp:44:27: required from ‘void boost::make_biconnected_planar(Graph&, PlanarEmbedding, EdgeIndexMap, AddEdgeVisitor&) [with Graph = adjacency_list, property >; PlanarEmbedding = std::vector >*; EdgeIndexMap = adj_list_edge_property_map, edge_index_t>; AddEdgeVisitor = my_add_edge_visitor, property >, long unsigned int>]’ planar.cpp:213:35: required from here /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::Convertible::~Convertible() [with X = std::random_access_iterator_tag; Y = std::forward_iterator_tag]’ 37 | ~model() | ^ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:208:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 208 | BOOST_CONCEPT_USAGE(Convertible) { | ^~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::Convertible]’: /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements >]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:208:5: required from ‘struct boost::Convertible’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::Convertible]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied >::value’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:72:8: [ skipping 11 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.4-3.20/BH/include/boost/property_map/property_map.hpp:354:5: required from ‘boost::iterator_property_map boost::make_iterator_property_map(RAIter, ID, Value) [with RAIter = __gnu_cxx::__normal_iterator >; Value = long unsigned int; ID = vec_adj_list_vertex_id_map, long unsigned int>]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/biconnected_components.hpp:338:43: required from ‘static std::pair boost::detail::bicomp_dispatch1::apply(const Graph&, ComponentMap, OutputIterator, VertexIndexMap, const boost::bgl_named_params&, boost::param_not_found) [with Graph = boost::adjacency_list, boost::property >; ComponentMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::adj_list_edge_property_map, boost::edge_index_t>, long unsigned int, long unsigned int&>; OutputIterator = std::back_insert_iterator >; VertexIndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>; P = int; T = boost::buffer_param_t; R = boost::no_property]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/biconnected_components.hpp:368:60: required from ‘std::pair boost::biconnected_components(const Graph&, ComponentMap, OutputIterator, const bgl_named_params&) [with Graph = adjacency_list, property >; ComponentMap = iterator_property_map<__gnu_cxx::__normal_iterator >, adj_list_edge_property_map, edge_index_t>, long unsigned int, long unsigned int&>; OutputIterator = std::back_insert_iterator >; P = int; T = buffer_param_t; R = no_property]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/biconnected_components.hpp:377:34: required from ‘std::pair boost::biconnected_components(const Graph&, ComponentMap, OutputIterator) [with Graph = adjacency_list, property >; ComponentMap = iterator_property_map<__gnu_cxx::__normal_iterator >, adj_list_edge_property_map, edge_index_t>, long unsigned int, long unsigned int&>; OutputIterator = std::back_insert_iterator >]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/make_biconnected_planar.hpp:44:27: required from ‘void boost::make_biconnected_planar(Graph&, PlanarEmbedding, EdgeIndexMap, AddEdgeVisitor&) [with Graph = adjacency_list, property >; PlanarEmbedding = std::vector >*; EdgeIndexMap = adj_list_edge_property_map, edge_index_t>; AddEdgeVisitor = my_add_edge_visitor, property >, long unsigned int>]’ planar.cpp:213:35: required from here /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::Convertible::~Convertible() [with X = std::random_access_iterator_tag; Y = std::bidirectional_iterator_tag]’ 37 | ~model() | ^ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:208:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 208 | BOOST_CONCEPT_USAGE(Convertible) { | ^~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements >]’: /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:137:5: required from ‘struct boost::DefaultConstructible’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::DefaultConstructible]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied >::value’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_)>’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/graph_concepts.hpp:68:9: [ skipping 11 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/isomorphism.hpp:651:42: required from ‘bool boost::graph::detail::isomorphism_impl::operator()(const Graph1&, const Graph2&, const ArgPack&) const [with ArgPack = boost::parameter::aux::empty_arg_list; Graph1 = boost::adjacency_list; Graph2 = boost::adjacency_list]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/isomorphism.hpp:662:5: required from ‘typename boost::result_of(Param0, Param1, const ArgPack&)>::type boost::graph::isomorphism_with_named_params(const Param0&, const Param1&, const ArgPack&) [with Param0 = boost::adjacency_list; Param1 = boost::adjacency_list; ArgPack = boost::parameter::aux::empty_arg_list; typename boost::result_of(Param0, Param1, const ArgPack&)>::type = bool]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/isomorphism.hpp:666:1: required from ‘typename boost::result_of(Param0, Param1, const boost::parameter::aux::empty_arg_list&)>::type boost::isomorphism(const Param0&, const Param1&) [with Param0 = adjacency_list; Param1 = adjacency_list; typename result_of(Param0, Param1, const parameter::aux::empty_arg_list&)>::type = bool]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/is_kuratowski_subgraph.hpp:278:34: required from ‘bool boost::is_kuratowski_subgraph(const Graph&, ForwardIterator, ForwardIterator, VertexIndexMap) [with Graph = adjacency_list, property >; ForwardIterator = __gnu_cxx::__normal_iterator*, std::vector > >; VertexIndexMap = vec_adj_list_vertex_id_map, long unsigned int>]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/is_kuratowski_subgraph.hpp:290:34: required from ‘bool boost::is_kuratowski_subgraph(const Graph&, ForwardIterator, ForwardIterator) [with Graph = adjacency_list, property >; ForwardIterator = __gnu_cxx::__normal_iterator*, std::vector > >]’ planar.cpp:435:37: required from here /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::DefaultConstructible]’ 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ^ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::DefaultConstructible]’: /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/graph_concepts.hpp:68:9: required from ‘boost::concepts::Graph::~Graph() [with G = boost::adjacency_list]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/usage.hpp:20:48: required from ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::concepts::Graph >]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements > >]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/graph_concepts.hpp:66:5: required from ‘struct boost::concepts::Graph >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/graph_concepts.hpp:176:1: required from ‘struct boost::concepts::VertexListGraph >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/graph_concepts.hpp:176:1: [ skipping 6 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/isomorphism.hpp:651:42: required from ‘bool boost::graph::detail::isomorphism_impl::operator()(const Graph1&, const Graph2&, const ArgPack&) const [with ArgPack = boost::parameter::aux::empty_arg_list; Graph1 = boost::adjacency_list; Graph2 = boost::adjacency_list]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/isomorphism.hpp:662:5: required from ‘typename boost::result_of(Param0, Param1, const ArgPack&)>::type boost::graph::isomorphism_with_named_params(const Param0&, const Param1&, const ArgPack&) [with Param0 = boost::adjacency_list; Param1 = boost::adjacency_list; ArgPack = boost::parameter::aux::empty_arg_list; typename boost::result_of(Param0, Param1, const ArgPack&)>::type = bool]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/isomorphism.hpp:666:1: required from ‘typename boost::result_of(Param0, Param1, const boost::parameter::aux::empty_arg_list&)>::type boost::isomorphism(const Param0&, const Param1&) [with Param0 = adjacency_list; Param1 = adjacency_list; typename result_of(Param0, Param1, const parameter::aux::empty_arg_list&)>::type = bool]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/is_kuratowski_subgraph.hpp:278:34: required from ‘bool boost::is_kuratowski_subgraph(const Graph&, ForwardIterator, ForwardIterator, VertexIndexMap) [with Graph = adjacency_list, property >; ForwardIterator = __gnu_cxx::__normal_iterator*, std::vector > >; VertexIndexMap = vec_adj_list_vertex_id_map, long unsigned int>]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/is_kuratowski_subgraph.hpp:290:34: required from ‘bool boost::is_kuratowski_subgraph(const Graph&, ForwardIterator, ForwardIterator) [with Graph = adjacency_list, property >; ForwardIterator = __gnu_cxx::__normal_iterator*, std::vector > >]’ planar.cpp:435:37: required from here /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::DefaultConstructible::~DefaultConstructible() [with TT = long unsigned int]’ 37 | ~model() | ^ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:137:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 137 | BOOST_CONCEPT_USAGE(DefaultConstructible) { | ^~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements >]’: /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:233:5: required from ‘struct boost::EqualityComparable’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::EqualityComparable]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied >::value’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_)>’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/graph_concepts.hpp:69:9: [ skipping 11 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/isomorphism.hpp:651:42: required from ‘bool boost::graph::detail::isomorphism_impl::operator()(const Graph1&, const Graph2&, const ArgPack&) const [with ArgPack = boost::parameter::aux::empty_arg_list; Graph1 = boost::adjacency_list; Graph2 = boost::adjacency_list]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/isomorphism.hpp:662:5: required from ‘typename boost::result_of(Param0, Param1, const ArgPack&)>::type boost::graph::isomorphism_with_named_params(const Param0&, const Param1&, const ArgPack&) [with Param0 = boost::adjacency_list; Param1 = boost::adjacency_list; ArgPack = boost::parameter::aux::empty_arg_list; typename boost::result_of(Param0, Param1, const ArgPack&)>::type = bool]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/isomorphism.hpp:666:1: required from ‘typename boost::result_of(Param0, Param1, const boost::parameter::aux::empty_arg_list&)>::type boost::isomorphism(const Param0&, const Param1&) [with Param0 = adjacency_list; Param1 = adjacency_list; typename result_of(Param0, Param1, const parameter::aux::empty_arg_list&)>::type = bool]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/is_kuratowski_subgraph.hpp:278:34: required from ‘bool boost::is_kuratowski_subgraph(const Graph&, ForwardIterator, ForwardIterator, VertexIndexMap) [with Graph = adjacency_list, property >; ForwardIterator = __gnu_cxx::__normal_iterator*, std::vector > >; VertexIndexMap = vec_adj_list_vertex_id_map, long unsigned int>]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/is_kuratowski_subgraph.hpp:290:34: required from ‘bool boost::is_kuratowski_subgraph(const Graph&, ForwardIterator, ForwardIterator) [with Graph = adjacency_list, property >; ForwardIterator = __gnu_cxx::__normal_iterator*, std::vector > >]’ planar.cpp:435:37: required from here /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::EqualityComparable]’ 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ^ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::EqualityComparable]’: /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/graph_concepts.hpp:69:9: required from ‘boost::concepts::Graph::~Graph() [with G = boost::adjacency_list]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/usage.hpp:20:48: required from ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::concepts::Graph >]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements > >]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/graph_concepts.hpp:66:5: required from ‘struct boost::concepts::Graph >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/graph_concepts.hpp:176:1: required from ‘struct boost::concepts::VertexListGraph >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/graph_concepts.hpp:176:1: [ skipping 6 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/isomorphism.hpp:651:42: required from ‘bool boost::graph::detail::isomorphism_impl::operator()(const Graph1&, const Graph2&, const ArgPack&) const [with ArgPack = boost::parameter::aux::empty_arg_list; Graph1 = boost::adjacency_list; Graph2 = boost::adjacency_list]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/isomorphism.hpp:662:5: required from ‘typename boost::result_of(Param0, Param1, const ArgPack&)>::type boost::graph::isomorphism_with_named_params(const Param0&, const Param1&, const ArgPack&) [with Param0 = boost::adjacency_list; Param1 = boost::adjacency_list; ArgPack = boost::parameter::aux::empty_arg_list; typename boost::result_of(Param0, Param1, const ArgPack&)>::type = bool]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/isomorphism.hpp:666:1: required from ‘typename boost::result_of(Param0, Param1, const boost::parameter::aux::empty_arg_list&)>::type boost::isomorphism(const Param0&, const Param1&) [with Param0 = adjacency_list; Param1 = adjacency_list; typename result_of(Param0, Param1, const parameter::aux::empty_arg_list&)>::type = bool]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/is_kuratowski_subgraph.hpp:278:34: required from ‘bool boost::is_kuratowski_subgraph(const Graph&, ForwardIterator, ForwardIterator, VertexIndexMap) [with Graph = adjacency_list, property >; ForwardIterator = __gnu_cxx::__normal_iterator*, std::vector > >; VertexIndexMap = vec_adj_list_vertex_id_map, long unsigned int>]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/is_kuratowski_subgraph.hpp:290:34: required from ‘bool boost::is_kuratowski_subgraph(const Graph&, ForwardIterator, ForwardIterator) [with Graph = adjacency_list, property >; ForwardIterator = __gnu_cxx::__normal_iterator*, std::vector > >]’ planar.cpp:435:37: required from here /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::EqualityComparable::~EqualityComparable() [with TT = long unsigned int]’ 37 | ~model() | ^ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:233:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 233 | BOOST_CONCEPT_USAGE(EqualityComparable) { | ^~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements >]’: /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:145:5: required from ‘struct boost::Assignable’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::Assignable]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied >::value’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_)>’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/graph_concepts.hpp:70:9: [ skipping 11 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/isomorphism.hpp:651:42: required from ‘bool boost::graph::detail::isomorphism_impl::operator()(const Graph1&, const Graph2&, const ArgPack&) const [with ArgPack = boost::parameter::aux::empty_arg_list; Graph1 = boost::adjacency_list; Graph2 = boost::adjacency_list]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/isomorphism.hpp:662:5: required from ‘typename boost::result_of(Param0, Param1, const ArgPack&)>::type boost::graph::isomorphism_with_named_params(const Param0&, const Param1&, const ArgPack&) [with Param0 = boost::adjacency_list; Param1 = boost::adjacency_list; ArgPack = boost::parameter::aux::empty_arg_list; typename boost::result_of(Param0, Param1, const ArgPack&)>::type = bool]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/isomorphism.hpp:666:1: required from ‘typename boost::result_of(Param0, Param1, const boost::parameter::aux::empty_arg_list&)>::type boost::isomorphism(const Param0&, const Param1&) [with Param0 = adjacency_list; Param1 = adjacency_list; typename result_of(Param0, Param1, const parameter::aux::empty_arg_list&)>::type = bool]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/is_kuratowski_subgraph.hpp:278:34: required from ‘bool boost::is_kuratowski_subgraph(const Graph&, ForwardIterator, ForwardIterator, VertexIndexMap) [with Graph = adjacency_list, property >; ForwardIterator = __gnu_cxx::__normal_iterator*, std::vector > >; VertexIndexMap = vec_adj_list_vertex_id_map, long unsigned int>]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/is_kuratowski_subgraph.hpp:290:34: required from ‘bool boost::is_kuratowski_subgraph(const Graph&, ForwardIterator, ForwardIterator) [with Graph = adjacency_list, property >; ForwardIterator = __gnu_cxx::__normal_iterator*, std::vector > >]’ planar.cpp:435:37: required from here /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::Assignable]’ 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ^ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::Assignable]’: /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/graph_concepts.hpp:70:9: required from ‘boost::concepts::Graph::~Graph() [with G = boost::adjacency_list]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/usage.hpp:20:48: required from ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::concepts::Graph >]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements > >]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/graph_concepts.hpp:66:5: required from ‘struct boost::concepts::Graph >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/graph_concepts.hpp:176:1: required from ‘struct boost::concepts::VertexListGraph >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/graph_concepts.hpp:176:1: [ skipping 6 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/isomorphism.hpp:651:42: required from ‘bool boost::graph::detail::isomorphism_impl::operator()(const Graph1&, const Graph2&, const ArgPack&) const [with ArgPack = boost::parameter::aux::empty_arg_list; Graph1 = boost::adjacency_list; Graph2 = boost::adjacency_list]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/isomorphism.hpp:662:5: required from ‘typename boost::result_of(Param0, Param1, const ArgPack&)>::type boost::graph::isomorphism_with_named_params(const Param0&, const Param1&, const ArgPack&) [with Param0 = boost::adjacency_list; Param1 = boost::adjacency_list; ArgPack = boost::parameter::aux::empty_arg_list; typename boost::result_of(Param0, Param1, const ArgPack&)>::type = bool]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/isomorphism.hpp:666:1: required from ‘typename boost::result_of(Param0, Param1, const boost::parameter::aux::empty_arg_list&)>::type boost::isomorphism(const Param0&, const Param1&) [with Param0 = adjacency_list; Param1 = adjacency_list; typename result_of(Param0, Param1, const parameter::aux::empty_arg_list&)>::type = bool]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/is_kuratowski_subgraph.hpp:278:34: required from ‘bool boost::is_kuratowski_subgraph(const Graph&, ForwardIterator, ForwardIterator, VertexIndexMap) [with Graph = adjacency_list, property >; ForwardIterator = __gnu_cxx::__normal_iterator*, std::vector > >; VertexIndexMap = vec_adj_list_vertex_id_map, long unsigned int>]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/is_kuratowski_subgraph.hpp:290:34: required from ‘bool boost::is_kuratowski_subgraph(const Graph&, ForwardIterator, ForwardIterator) [with Graph = adjacency_list, property >; ForwardIterator = __gnu_cxx::__normal_iterator*, std::vector > >]’ planar.cpp:435:37: required from here /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::Assignable::~Assignable() [with TT = long unsigned int]’ 37 | ~model() | ^ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:145:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 145 | BOOST_CONCEPT_USAGE(Assignable) { | ^~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::concepts::MultiPassInputIterator >]’: /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements > >]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/graph_concepts.hpp:52:50: required from ‘struct boost::concepts::MultiPassInputIterator >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::concepts::MultiPassInputIterator >]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied > >::value’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied > >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:72:8: [ skipping 4 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/isomorphism.hpp:651:42: required from ‘bool boost::graph::detail::isomorphism_impl::operator()(const Graph1&, const Graph2&, const ArgPack&) const [with ArgPack = boost::parameter::aux::empty_arg_list; Graph1 = boost::adjacency_list; Graph2 = boost::adjacency_list]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/isomorphism.hpp:662:5: required from ‘typename boost::result_of(Param0, Param1, const ArgPack&)>::type boost::graph::isomorphism_with_named_params(const Param0&, const Param1&, const ArgPack&) [with Param0 = boost::adjacency_list; Param1 = boost::adjacency_list; ArgPack = boost::parameter::aux::empty_arg_list; typename boost::result_of(Param0, Param1, const ArgPack&)>::type = bool]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/isomorphism.hpp:666:1: required from ‘typename boost::result_of(Param0, Param1, const boost::parameter::aux::empty_arg_list&)>::type boost::isomorphism(const Param0&, const Param1&) [with Param0 = adjacency_list; Param1 = adjacency_list; typename result_of(Param0, Param1, const parameter::aux::empty_arg_list&)>::type = bool]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/is_kuratowski_subgraph.hpp:278:34: required from ‘bool boost::is_kuratowski_subgraph(const Graph&, ForwardIterator, ForwardIterator, VertexIndexMap) [with Graph = adjacency_list, property >; ForwardIterator = __gnu_cxx::__normal_iterator*, std::vector > >; VertexIndexMap = vec_adj_list_vertex_id_map, long unsigned int>]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/is_kuratowski_subgraph.hpp:290:34: required from ‘bool boost::is_kuratowski_subgraph(const Graph&, ForwardIterator, ForwardIterator) [with Graph = adjacency_list, property >; ForwardIterator = __gnu_cxx::__normal_iterator*, std::vector > >]’ planar.cpp:435:37: required from here /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::concepts::MultiPassInputIterator::~MultiPassInputIterator() [with T = boost::range_detail::integer_iterator]’ 37 | ~model() | ^ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/graph_concepts.hpp:52:50: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 52 | BOOST_concept(MultiPassInputIterator, (T)) { BOOST_CONCEPT_USAGE( | ^~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::Convertible]’: /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements >]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:208:5: required from ‘struct boost::Convertible’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::Convertible]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied >::value’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:72:8: [ skipping 4 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/isomorphism.hpp:651:42: required from ‘bool boost::graph::detail::isomorphism_impl::operator()(const Graph1&, const Graph2&, const ArgPack&) const [with ArgPack = boost::parameter::aux::empty_arg_list; Graph1 = boost::adjacency_list; Graph2 = boost::adjacency_list]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/isomorphism.hpp:662:5: required from ‘typename boost::result_of(Param0, Param1, const ArgPack&)>::type boost::graph::isomorphism_with_named_params(const Param0&, const Param1&, const ArgPack&) [with Param0 = boost::adjacency_list; Param1 = boost::adjacency_list; ArgPack = boost::parameter::aux::empty_arg_list; typename boost::result_of(Param0, Param1, const ArgPack&)>::type = bool]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/isomorphism.hpp:666:1: required from ‘typename boost::result_of(Param0, Param1, const boost::parameter::aux::empty_arg_list&)>::type boost::isomorphism(const Param0&, const Param1&) [with Param0 = adjacency_list; Param1 = adjacency_list; typename result_of(Param0, Param1, const parameter::aux::empty_arg_list&)>::type = bool]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/is_kuratowski_subgraph.hpp:278:34: required from ‘bool boost::is_kuratowski_subgraph(const Graph&, ForwardIterator, ForwardIterator, VertexIndexMap) [with Graph = adjacency_list, property >; ForwardIterator = __gnu_cxx::__normal_iterator*, std::vector > >; VertexIndexMap = vec_adj_list_vertex_id_map, long unsigned int>]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/is_kuratowski_subgraph.hpp:290:34: required from ‘bool boost::is_kuratowski_subgraph(const Graph&, ForwardIterator, ForwardIterator) [with Graph = adjacency_list, property >; ForwardIterator = __gnu_cxx::__normal_iterator*, std::vector > >]’ planar.cpp:435:37: required from here /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::Convertible::~Convertible() [with X = boost::undir_adj_list_traversal_tag; Y = boost::vertex_list_graph_tag]’ 37 | ~model() | ^ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:208:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 208 | BOOST_CONCEPT_USAGE(Convertible) { | ^~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::concepts::MultiPassInputIterator >, boost::detail::edge_desc_impl, long int> >]’: /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements >, boost::detail::edge_desc_impl, long int> > >]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/graph_concepts.hpp:52:50: required from ‘struct boost::concepts::MultiPassInputIterator >, boost::detail::edge_desc_impl, long int> >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::concepts::MultiPassInputIterator >, boost::detail::edge_desc_impl, long int> >]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied >, boost::detail::edge_desc_impl, long int> > >::value’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied >, boost::detail::edge_desc_impl, long int> > >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:72:8: [ skipping 4 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/isomorphism.hpp:651:42: required from ‘bool boost::graph::detail::isomorphism_impl::operator()(const Graph1&, const Graph2&, const ArgPack&) const [with ArgPack = boost::parameter::aux::empty_arg_list; Graph1 = boost::adjacency_list; Graph2 = boost::adjacency_list]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/isomorphism.hpp:662:5: required from ‘typename boost::result_of(Param0, Param1, const ArgPack&)>::type boost::graph::isomorphism_with_named_params(const Param0&, const Param1&, const ArgPack&) [with Param0 = boost::adjacency_list; Param1 = boost::adjacency_list; ArgPack = boost::parameter::aux::empty_arg_list; typename boost::result_of(Param0, Param1, const ArgPack&)>::type = bool]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/isomorphism.hpp:666:1: required from ‘typename boost::result_of(Param0, Param1, const boost::parameter::aux::empty_arg_list&)>::type boost::isomorphism(const Param0&, const Param1&) [with Param0 = adjacency_list; Param1 = adjacency_list; typename result_of(Param0, Param1, const parameter::aux::empty_arg_list&)>::type = bool]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/is_kuratowski_subgraph.hpp:278:34: required from ‘bool boost::is_kuratowski_subgraph(const Graph&, ForwardIterator, ForwardIterator, VertexIndexMap) [with Graph = adjacency_list, property >; ForwardIterator = __gnu_cxx::__normal_iterator*, std::vector > >; VertexIndexMap = vec_adj_list_vertex_id_map, long unsigned int>]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/is_kuratowski_subgraph.hpp:290:34: required from ‘bool boost::is_kuratowski_subgraph(const Graph&, ForwardIterator, ForwardIterator) [with Graph = adjacency_list, property >; ForwardIterator = __gnu_cxx::__normal_iterator*, std::vector > >]’ planar.cpp:435:37: required from here /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::concepts::MultiPassInputIterator::~MultiPassInputIterator() [with T = boost::detail::undirected_edge_iter >, boost::detail::edge_desc_impl, long int>]’ 37 | ~model() | ^ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/graph_concepts.hpp:52:50: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 52 | BOOST_concept(MultiPassInputIterator, (T)) { BOOST_CONCEPT_USAGE( | ^~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::DefaultConstructible >]’: /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements > >]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:137:5: required from ‘struct boost::DefaultConstructible >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::DefaultConstructible >]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied > >::value’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied > >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:72:8: [ skipping 4 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/isomorphism.hpp:651:42: required from ‘bool boost::graph::detail::isomorphism_impl::operator()(const Graph1&, const Graph2&, const ArgPack&) const [with ArgPack = boost::parameter::aux::empty_arg_list; Graph1 = boost::adjacency_list; Graph2 = boost::adjacency_list]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/isomorphism.hpp:662:5: required from ‘typename boost::result_of(Param0, Param1, const ArgPack&)>::type boost::graph::isomorphism_with_named_params(const Param0&, const Param1&, const ArgPack&) [with Param0 = boost::adjacency_list; Param1 = boost::adjacency_list; ArgPack = boost::parameter::aux::empty_arg_list; typename boost::result_of(Param0, Param1, const ArgPack&)>::type = bool]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/isomorphism.hpp:666:1: required from ‘typename boost::result_of(Param0, Param1, const boost::parameter::aux::empty_arg_list&)>::type boost::isomorphism(const Param0&, const Param1&) [with Param0 = adjacency_list; Param1 = adjacency_list; typename result_of(Param0, Param1, const parameter::aux::empty_arg_list&)>::type = bool]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/is_kuratowski_subgraph.hpp:278:34: required from ‘bool boost::is_kuratowski_subgraph(const Graph&, ForwardIterator, ForwardIterator, VertexIndexMap) [with Graph = adjacency_list, property >; ForwardIterator = __gnu_cxx::__normal_iterator*, std::vector > >; VertexIndexMap = vec_adj_list_vertex_id_map, long unsigned int>]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/is_kuratowski_subgraph.hpp:290:34: required from ‘bool boost::is_kuratowski_subgraph(const Graph&, ForwardIterator, ForwardIterator) [with Graph = adjacency_list, property >; ForwardIterator = __gnu_cxx::__normal_iterator*, std::vector > >]’ planar.cpp:435:37: required from here /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::DefaultConstructible::~DefaultConstructible() [with TT = boost::detail::edge_desc_impl]’ 37 | ~model() | ^ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:137:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 137 | BOOST_CONCEPT_USAGE(DefaultConstructible) { | ^~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::EqualityComparable >]’: /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements > >]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:233:5: required from ‘struct boost::EqualityComparable >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::EqualityComparable >]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied > >::value’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied > >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:72:8: [ skipping 4 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/isomorphism.hpp:651:42: required from ‘bool boost::graph::detail::isomorphism_impl::operator()(const Graph1&, const Graph2&, const ArgPack&) const [with ArgPack = boost::parameter::aux::empty_arg_list; Graph1 = boost::adjacency_list; Graph2 = boost::adjacency_list]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/isomorphism.hpp:662:5: required from ‘typename boost::result_of(Param0, Param1, const ArgPack&)>::type boost::graph::isomorphism_with_named_params(const Param0&, const Param1&, const ArgPack&) [with Param0 = boost::adjacency_list; Param1 = boost::adjacency_list; ArgPack = boost::parameter::aux::empty_arg_list; typename boost::result_of(Param0, Param1, const ArgPack&)>::type = bool]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/isomorphism.hpp:666:1: required from ‘typename boost::result_of(Param0, Param1, const boost::parameter::aux::empty_arg_list&)>::type boost::isomorphism(const Param0&, const Param1&) [with Param0 = adjacency_list; Param1 = adjacency_list; typename result_of(Param0, Param1, const parameter::aux::empty_arg_list&)>::type = bool]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/is_kuratowski_subgraph.hpp:278:34: required from ‘bool boost::is_kuratowski_subgraph(const Graph&, ForwardIterator, ForwardIterator, VertexIndexMap) [with Graph = adjacency_list, property >; ForwardIterator = __gnu_cxx::__normal_iterator*, std::vector > >; VertexIndexMap = vec_adj_list_vertex_id_map, long unsigned int>]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/is_kuratowski_subgraph.hpp:290:34: required from ‘bool boost::is_kuratowski_subgraph(const Graph&, ForwardIterator, ForwardIterator) [with Graph = adjacency_list, property >; ForwardIterator = __gnu_cxx::__normal_iterator*, std::vector > >]’ planar.cpp:435:37: required from here /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::EqualityComparable::~EqualityComparable() [with TT = boost::detail::edge_desc_impl]’ 37 | ~model() | ^ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:233:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 233 | BOOST_CONCEPT_USAGE(EqualityComparable) { | ^~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::Assignable >]’: /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements > >]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:145:5: required from ‘struct boost::Assignable >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::Assignable >]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied > >::value’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied > >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:72:8: [ skipping 4 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/isomorphism.hpp:651:42: required from ‘bool boost::graph::detail::isomorphism_impl::operator()(const Graph1&, const Graph2&, const ArgPack&) const [with ArgPack = boost::parameter::aux::empty_arg_list; Graph1 = boost::adjacency_list; Graph2 = boost::adjacency_list]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/isomorphism.hpp:662:5: required from ‘typename boost::result_of(Param0, Param1, const ArgPack&)>::type boost::graph::isomorphism_with_named_params(const Param0&, const Param1&, const ArgPack&) [with Param0 = boost::adjacency_list; Param1 = boost::adjacency_list; ArgPack = boost::parameter::aux::empty_arg_list; typename boost::result_of(Param0, Param1, const ArgPack&)>::type = bool]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/isomorphism.hpp:666:1: required from ‘typename boost::result_of(Param0, Param1, const boost::parameter::aux::empty_arg_list&)>::type boost::isomorphism(const Param0&, const Param1&) [with Param0 = adjacency_list; Param1 = adjacency_list; typename result_of(Param0, Param1, const parameter::aux::empty_arg_list&)>::type = bool]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/is_kuratowski_subgraph.hpp:278:34: required from ‘bool boost::is_kuratowski_subgraph(const Graph&, ForwardIterator, ForwardIterator, VertexIndexMap) [with Graph = adjacency_list, property >; ForwardIterator = __gnu_cxx::__normal_iterator*, std::vector > >; VertexIndexMap = vec_adj_list_vertex_id_map, long unsigned int>]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/is_kuratowski_subgraph.hpp:290:34: required from ‘bool boost::is_kuratowski_subgraph(const Graph&, ForwardIterator, ForwardIterator) [with Graph = adjacency_list, property >; ForwardIterator = __gnu_cxx::__normal_iterator*, std::vector > >]’ planar.cpp:435:37: required from here /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::Assignable::~Assignable() [with TT = boost::detail::edge_desc_impl]’ 37 | ~model() | ^ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:145:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 145 | BOOST_CONCEPT_USAGE(Assignable) { | ^~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::Convertible]’: /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements >]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:208:5: required from ‘struct boost::Convertible’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::Convertible]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied >::value’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:72:8: [ skipping 4 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/isomorphism.hpp:651:42: required from ‘bool boost::graph::detail::isomorphism_impl::operator()(const Graph1&, const Graph2&, const ArgPack&) const [with ArgPack = boost::parameter::aux::empty_arg_list; Graph1 = boost::adjacency_list; Graph2 = boost::adjacency_list]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/isomorphism.hpp:662:5: required from ‘typename boost::result_of(Param0, Param1, const ArgPack&)>::type boost::graph::isomorphism_with_named_params(const Param0&, const Param1&, const ArgPack&) [with Param0 = boost::adjacency_list; Param1 = boost::adjacency_list; ArgPack = boost::parameter::aux::empty_arg_list; typename boost::result_of(Param0, Param1, const ArgPack&)>::type = bool]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/isomorphism.hpp:666:1: required from ‘typename boost::result_of(Param0, Param1, const boost::parameter::aux::empty_arg_list&)>::type boost::isomorphism(const Param0&, const Param1&) [with Param0 = adjacency_list; Param1 = adjacency_list; typename result_of(Param0, Param1, const parameter::aux::empty_arg_list&)>::type = bool]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/is_kuratowski_subgraph.hpp:278:34: required from ‘bool boost::is_kuratowski_subgraph(const Graph&, ForwardIterator, ForwardIterator, VertexIndexMap) [with Graph = adjacency_list, property >; ForwardIterator = __gnu_cxx::__normal_iterator*, std::vector > >; VertexIndexMap = vec_adj_list_vertex_id_map, long unsigned int>]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/is_kuratowski_subgraph.hpp:290:34: required from ‘bool boost::is_kuratowski_subgraph(const Graph&, ForwardIterator, ForwardIterator) [with Graph = adjacency_list, property >; ForwardIterator = __gnu_cxx::__normal_iterator*, std::vector > >]’ planar.cpp:435:37: required from here /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::Convertible::~Convertible() [with X = boost::undir_adj_list_traversal_tag; Y = boost::edge_list_graph_tag]’ 37 | ~model() | ^ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:208:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 208 | BOOST_CONCEPT_USAGE(Convertible) { | ^~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::Convertible]’: /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements >]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:208:5: required from ‘struct boost::Convertible’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::Convertible]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied >::value’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:72:8: [ skipping 4 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/isomorphism.hpp:651:42: required from ‘bool boost::graph::detail::isomorphism_impl::operator()(const Graph1&, const Graph2&, const ArgPack&) const [with ArgPack = boost::parameter::aux::empty_arg_list; Graph1 = boost::adjacency_list; Graph2 = boost::adjacency_list]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/isomorphism.hpp:662:5: required from ‘typename boost::result_of(Param0, Param1, const ArgPack&)>::type boost::graph::isomorphism_with_named_params(const Param0&, const Param1&, const ArgPack&) [with Param0 = boost::adjacency_list; Param1 = boost::adjacency_list; ArgPack = boost::parameter::aux::empty_arg_list; typename boost::result_of(Param0, Param1, const ArgPack&)>::type = bool]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/isomorphism.hpp:666:1: required from ‘typename boost::result_of(Param0, Param1, const boost::parameter::aux::empty_arg_list&)>::type boost::isomorphism(const Param0&, const Param1&) [with Param0 = adjacency_list; Param1 = adjacency_list; typename result_of(Param0, Param1, const parameter::aux::empty_arg_list&)>::type = bool]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/is_kuratowski_subgraph.hpp:278:34: required from ‘bool boost::is_kuratowski_subgraph(const Graph&, ForwardIterator, ForwardIterator, VertexIndexMap) [with Graph = adjacency_list, property >; ForwardIterator = __gnu_cxx::__normal_iterator*, std::vector > >; VertexIndexMap = vec_adj_list_vertex_id_map, long unsigned int>]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/is_kuratowski_subgraph.hpp:290:34: required from ‘bool boost::is_kuratowski_subgraph(const Graph&, ForwardIterator, ForwardIterator) [with Graph = adjacency_list, property >; ForwardIterator = __gnu_cxx::__normal_iterator*, std::vector > >]’ planar.cpp:435:37: required from here /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::Convertible::~Convertible() [with X = long unsigned int; Y = long unsigned int]’ 37 | ~model() | ^ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:208:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 208 | BOOST_CONCEPT_USAGE(Convertible) { | ^~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::Convertible]’: /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements >]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:208:5: required from ‘struct boost::Convertible’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:206:3: required from ‘struct boost::ConvertibleConcept’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::ConvertibleConcept]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied >::value’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:45:51: [ skipping 13 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/isomorphism.hpp:651:42: required from ‘bool boost::graph::detail::isomorphism_impl::operator()(const Graph1&, const Graph2&, const ArgPack&) const [with ArgPack = boost::parameter::aux::empty_arg_list; Graph1 = boost::adjacency_list; Graph2 = boost::adjacency_list]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/isomorphism.hpp:662:5: required from ‘typename boost::result_of(Param0, Param1, const ArgPack&)>::type boost::graph::isomorphism_with_named_params(const Param0&, const Param1&, const ArgPack&) [with Param0 = boost::adjacency_list; Param1 = boost::adjacency_list; ArgPack = boost::parameter::aux::empty_arg_list; typename boost::result_of(Param0, Param1, const ArgPack&)>::type = bool]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/isomorphism.hpp:666:1: required from ‘typename boost::result_of(Param0, Param1, const boost::parameter::aux::empty_arg_list&)>::type boost::isomorphism(const Param0&, const Param1&) [with Param0 = adjacency_list; Param1 = adjacency_list; typename result_of(Param0, Param1, const parameter::aux::empty_arg_list&)>::type = bool]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/is_kuratowski_subgraph.hpp:278:34: required from ‘bool boost::is_kuratowski_subgraph(const Graph&, ForwardIterator, ForwardIterator, VertexIndexMap) [with Graph = adjacency_list, property >; ForwardIterator = __gnu_cxx::__normal_iterator*, std::vector > >; VertexIndexMap = vec_adj_list_vertex_id_map, long unsigned int>]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/is_kuratowski_subgraph.hpp:290:34: required from ‘bool boost::is_kuratowski_subgraph(const Graph&, ForwardIterator, ForwardIterator) [with Graph = adjacency_list, property >; ForwardIterator = __gnu_cxx::__normal_iterator*, std::vector > >]’ planar.cpp:435:37: required from here /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::Convertible::~Convertible() [with X = boost::lvalue_property_map_tag; Y = boost::readable_property_map_tag]’ 37 | ~model() | ^ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:208:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 208 | BOOST_CONCEPT_USAGE(Convertible) { | ^~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::Assignable<__gnu_cxx::__normal_iterator > >]’: /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements > > >]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:145:5: required from ‘struct boost::Assignable<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:502:3: required from ‘struct boost::InputIterator<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:540:3: required from ‘struct boost::ForwardIterator<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:568:3: required from ‘struct boost::BidirectionalIterator<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:597:3: [ skipping 9 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/isomorphism.hpp:651:42: required from ‘bool boost::graph::detail::isomorphism_impl::operator()(const Graph1&, const Graph2&, const ArgPack&) const [with ArgPack = boost::parameter::aux::empty_arg_list; Graph1 = boost::adjacency_list; Graph2 = boost::adjacency_list]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/isomorphism.hpp:662:5: required from ‘typename boost::result_of(Param0, Param1, const ArgPack&)>::type boost::graph::isomorphism_with_named_params(const Param0&, const Param1&, const ArgPack&) [with Param0 = boost::adjacency_list; Param1 = boost::adjacency_list; ArgPack = boost::parameter::aux::empty_arg_list; typename boost::result_of(Param0, Param1, const ArgPack&)>::type = bool]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/isomorphism.hpp:666:1: required from ‘typename boost::result_of(Param0, Param1, const boost::parameter::aux::empty_arg_list&)>::type boost::isomorphism(const Param0&, const Param1&) [with Param0 = adjacency_list; Param1 = adjacency_list; typename result_of(Param0, Param1, const parameter::aux::empty_arg_list&)>::type = bool]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/is_kuratowski_subgraph.hpp:278:34: required from ‘bool boost::is_kuratowski_subgraph(const Graph&, ForwardIterator, ForwardIterator, VertexIndexMap) [with Graph = adjacency_list, property >; ForwardIterator = __gnu_cxx::__normal_iterator*, std::vector > >; VertexIndexMap = vec_adj_list_vertex_id_map, long unsigned int>]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/is_kuratowski_subgraph.hpp:290:34: required from ‘bool boost::is_kuratowski_subgraph(const Graph&, ForwardIterator, ForwardIterator) [with Graph = adjacency_list, property >; ForwardIterator = __gnu_cxx::__normal_iterator*, std::vector > >]’ planar.cpp:435:37: required from here /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::Assignable::~Assignable() [with TT = __gnu_cxx::__normal_iterator >]’ 37 | ~model() | ^ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:145:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 145 | BOOST_CONCEPT_USAGE(Assignable) { | ^~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::EqualityComparable<__gnu_cxx::__normal_iterator > >]’: /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements > > >]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:233:5: required from ‘struct boost::EqualityComparable<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:502:3: required from ‘struct boost::InputIterator<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:540:3: required from ‘struct boost::ForwardIterator<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:568:3: required from ‘struct boost::BidirectionalIterator<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:597:3: [ skipping 9 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/isomorphism.hpp:651:42: required from ‘bool boost::graph::detail::isomorphism_impl::operator()(const Graph1&, const Graph2&, const ArgPack&) const [with ArgPack = boost::parameter::aux::empty_arg_list; Graph1 = boost::adjacency_list; Graph2 = boost::adjacency_list]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/isomorphism.hpp:662:5: required from ‘typename boost::result_of(Param0, Param1, const ArgPack&)>::type boost::graph::isomorphism_with_named_params(const Param0&, const Param1&, const ArgPack&) [with Param0 = boost::adjacency_list; Param1 = boost::adjacency_list; ArgPack = boost::parameter::aux::empty_arg_list; typename boost::result_of(Param0, Param1, const ArgPack&)>::type = bool]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/isomorphism.hpp:666:1: required from ‘typename boost::result_of(Param0, Param1, const boost::parameter::aux::empty_arg_list&)>::type boost::isomorphism(const Param0&, const Param1&) [with Param0 = adjacency_list; Param1 = adjacency_list; typename result_of(Param0, Param1, const parameter::aux::empty_arg_list&)>::type = bool]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/is_kuratowski_subgraph.hpp:278:34: required from ‘bool boost::is_kuratowski_subgraph(const Graph&, ForwardIterator, ForwardIterator, VertexIndexMap) [with Graph = adjacency_list, property >; ForwardIterator = __gnu_cxx::__normal_iterator*, std::vector > >; VertexIndexMap = vec_adj_list_vertex_id_map, long unsigned int>]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/is_kuratowski_subgraph.hpp:290:34: required from ‘bool boost::is_kuratowski_subgraph(const Graph&, ForwardIterator, ForwardIterator) [with Graph = adjacency_list, property >; ForwardIterator = __gnu_cxx::__normal_iterator*, std::vector > >]’ planar.cpp:435:37: required from here /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::EqualityComparable::~EqualityComparable() [with TT = __gnu_cxx::__normal_iterator >]’ 37 | ~model() | ^ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:233:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 233 | BOOST_CONCEPT_USAGE(EqualityComparable) { | ^~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::InputIterator<__gnu_cxx::__normal_iterator > >]’: /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements > > >]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:512:7: required from ‘struct boost::InputIterator<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:540:3: required from ‘struct boost::ForwardIterator<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:568:3: required from ‘struct boost::BidirectionalIterator<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:597:3: required from ‘struct boost::RandomAccessIterator<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:597:3: [ skipping 8 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/isomorphism.hpp:651:42: required from ‘bool boost::graph::detail::isomorphism_impl::operator()(const Graph1&, const Graph2&, const ArgPack&) const [with ArgPack = boost::parameter::aux::empty_arg_list; Graph1 = boost::adjacency_list; Graph2 = boost::adjacency_list]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/isomorphism.hpp:662:5: required from ‘typename boost::result_of(Param0, Param1, const ArgPack&)>::type boost::graph::isomorphism_with_named_params(const Param0&, const Param1&, const ArgPack&) [with Param0 = boost::adjacency_list; Param1 = boost::adjacency_list; ArgPack = boost::parameter::aux::empty_arg_list; typename boost::result_of(Param0, Param1, const ArgPack&)>::type = bool]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/isomorphism.hpp:666:1: required from ‘typename boost::result_of(Param0, Param1, const boost::parameter::aux::empty_arg_list&)>::type boost::isomorphism(const Param0&, const Param1&) [with Param0 = adjacency_list; Param1 = adjacency_list; typename result_of(Param0, Param1, const parameter::aux::empty_arg_list&)>::type = bool]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/is_kuratowski_subgraph.hpp:278:34: required from ‘bool boost::is_kuratowski_subgraph(const Graph&, ForwardIterator, ForwardIterator, VertexIndexMap) [with Graph = adjacency_list, property >; ForwardIterator = __gnu_cxx::__normal_iterator*, std::vector > >; VertexIndexMap = vec_adj_list_vertex_id_map, long unsigned int>]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/is_kuratowski_subgraph.hpp:290:34: required from ‘bool boost::is_kuratowski_subgraph(const Graph&, ForwardIterator, ForwardIterator) [with Graph = adjacency_list, property >; ForwardIterator = __gnu_cxx::__normal_iterator*, std::vector > >]’ planar.cpp:435:37: required from here /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::InputIterator::~InputIterator() [with TT = __gnu_cxx::__normal_iterator >]’ 37 | ~model() | ^ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:512:7: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 512 | BOOST_CONCEPT_USAGE(InputIterator) | ^~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::ForwardIterator<__gnu_cxx::__normal_iterator > >]’: /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements > > >]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:543:7: required from ‘struct boost::ForwardIterator<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:568:3: required from ‘struct boost::BidirectionalIterator<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:597:3: required from ‘struct boost::RandomAccessIterator<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:597:3: required from ‘struct boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:32:62: [ skipping 7 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/isomorphism.hpp:651:42: required from ‘bool boost::graph::detail::isomorphism_impl::operator()(const Graph1&, const Graph2&, const ArgPack&) const [with ArgPack = boost::parameter::aux::empty_arg_list; Graph1 = boost::adjacency_list; Graph2 = boost::adjacency_list]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/isomorphism.hpp:662:5: required from ‘typename boost::result_of(Param0, Param1, const ArgPack&)>::type boost::graph::isomorphism_with_named_params(const Param0&, const Param1&, const ArgPack&) [with Param0 = boost::adjacency_list; Param1 = boost::adjacency_list; ArgPack = boost::parameter::aux::empty_arg_list; typename boost::result_of(Param0, Param1, const ArgPack&)>::type = bool]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/isomorphism.hpp:666:1: required from ‘typename boost::result_of(Param0, Param1, const boost::parameter::aux::empty_arg_list&)>::type boost::isomorphism(const Param0&, const Param1&) [with Param0 = adjacency_list; Param1 = adjacency_list; typename result_of(Param0, Param1, const parameter::aux::empty_arg_list&)>::type = bool]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/is_kuratowski_subgraph.hpp:278:34: required from ‘bool boost::is_kuratowski_subgraph(const Graph&, ForwardIterator, ForwardIterator, VertexIndexMap) [with Graph = adjacency_list, property >; ForwardIterator = __gnu_cxx::__normal_iterator*, std::vector > >; VertexIndexMap = vec_adj_list_vertex_id_map, long unsigned int>]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/is_kuratowski_subgraph.hpp:290:34: required from ‘bool boost::is_kuratowski_subgraph(const Graph&, ForwardIterator, ForwardIterator) [with Graph = adjacency_list, property >; ForwardIterator = __gnu_cxx::__normal_iterator*, std::vector > >]’ planar.cpp:435:37: required from here /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::ForwardIterator::~ForwardIterator() [with TT = __gnu_cxx::__normal_iterator >]’ 37 | ~model() | ^ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:543:7: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 543 | BOOST_CONCEPT_USAGE(ForwardIterator) | ^~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::BidirectionalIterator<__gnu_cxx::__normal_iterator > >]’: /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements > > >]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:571:7: required from ‘struct boost::BidirectionalIterator<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:597:3: required from ‘struct boost::RandomAccessIterator<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:597:3: required from ‘struct boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator > >]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:42:5: [ skipping 6 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/isomorphism.hpp:651:42: required from ‘bool boost::graph::detail::isomorphism_impl::operator()(const Graph1&, const Graph2&, const ArgPack&) const [with ArgPack = boost::parameter::aux::empty_arg_list; Graph1 = boost::adjacency_list; Graph2 = boost::adjacency_list]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/isomorphism.hpp:662:5: required from ‘typename boost::result_of(Param0, Param1, const ArgPack&)>::type boost::graph::isomorphism_with_named_params(const Param0&, const Param1&, const ArgPack&) [with Param0 = boost::adjacency_list; Param1 = boost::adjacency_list; ArgPack = boost::parameter::aux::empty_arg_list; typename boost::result_of(Param0, Param1, const ArgPack&)>::type = bool]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/isomorphism.hpp:666:1: required from ‘typename boost::result_of(Param0, Param1, const boost::parameter::aux::empty_arg_list&)>::type boost::isomorphism(const Param0&, const Param1&) [with Param0 = adjacency_list; Param1 = adjacency_list; typename result_of(Param0, Param1, const parameter::aux::empty_arg_list&)>::type = bool]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/is_kuratowski_subgraph.hpp:278:34: required from ‘bool boost::is_kuratowski_subgraph(const Graph&, ForwardIterator, ForwardIterator, VertexIndexMap) [with Graph = adjacency_list, property >; ForwardIterator = __gnu_cxx::__normal_iterator*, std::vector > >; VertexIndexMap = vec_adj_list_vertex_id_map, long unsigned int>]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/is_kuratowski_subgraph.hpp:290:34: required from ‘bool boost::is_kuratowski_subgraph(const Graph&, ForwardIterator, ForwardIterator) [with Graph = adjacency_list, property >; ForwardIterator = __gnu_cxx::__normal_iterator*, std::vector > >]’ planar.cpp:435:37: required from here /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::BidirectionalIterator::~BidirectionalIterator() [with TT = __gnu_cxx::__normal_iterator >]’ 37 | ~model() | ^ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:571:7: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 571 | BOOST_CONCEPT_USAGE(BidirectionalIterator) | ^~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::Comparable<__gnu_cxx::__normal_iterator > >]’: /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements > > >]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:253:5: required from ‘struct boost::Comparable<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:597:3: required from ‘struct boost::RandomAccessIterator<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:597:3: required from ‘struct boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator > >]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:42:5: [ skipping 6 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/isomorphism.hpp:651:42: required from ‘bool boost::graph::detail::isomorphism_impl::operator()(const Graph1&, const Graph2&, const ArgPack&) const [with ArgPack = boost::parameter::aux::empty_arg_list; Graph1 = boost::adjacency_list; Graph2 = boost::adjacency_list]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/isomorphism.hpp:662:5: required from ‘typename boost::result_of(Param0, Param1, const ArgPack&)>::type boost::graph::isomorphism_with_named_params(const Param0&, const Param1&, const ArgPack&) [with Param0 = boost::adjacency_list; Param1 = boost::adjacency_list; ArgPack = boost::parameter::aux::empty_arg_list; typename boost::result_of(Param0, Param1, const ArgPack&)>::type = bool]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/isomorphism.hpp:666:1: required from ‘typename boost::result_of(Param0, Param1, const boost::parameter::aux::empty_arg_list&)>::type boost::isomorphism(const Param0&, const Param1&) [with Param0 = adjacency_list; Param1 = adjacency_list; typename result_of(Param0, Param1, const parameter::aux::empty_arg_list&)>::type = bool]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/is_kuratowski_subgraph.hpp:278:34: required from ‘bool boost::is_kuratowski_subgraph(const Graph&, ForwardIterator, ForwardIterator, VertexIndexMap) [with Graph = adjacency_list, property >; ForwardIterator = __gnu_cxx::__normal_iterator*, std::vector > >; VertexIndexMap = vec_adj_list_vertex_id_map, long unsigned int>]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/is_kuratowski_subgraph.hpp:290:34: required from ‘bool boost::is_kuratowski_subgraph(const Graph&, ForwardIterator, ForwardIterator) [with Graph = adjacency_list, property >; ForwardIterator = __gnu_cxx::__normal_iterator*, std::vector > >]’ planar.cpp:435:37: required from here /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::Comparable::~Comparable() [with TT = __gnu_cxx::__normal_iterator >]’ 37 | ~model() | ^ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:253:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 253 | BOOST_CONCEPT_USAGE(Comparable) { | ^~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::RandomAccessIterator<__gnu_cxx::__normal_iterator > >]’: /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements > > >]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:601:7: required from ‘struct boost::RandomAccessIterator<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:597:3: required from ‘struct boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator > >]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied > > >::value’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:45:51: [ skipping 5 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/isomorphism.hpp:651:42: required from ‘bool boost::graph::detail::isomorphism_impl::operator()(const Graph1&, const Graph2&, const ArgPack&) const [with ArgPack = boost::parameter::aux::empty_arg_list; Graph1 = boost::adjacency_list; Graph2 = boost::adjacency_list]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/isomorphism.hpp:662:5: required from ‘typename boost::result_of(Param0, Param1, const ArgPack&)>::type boost::graph::isomorphism_with_named_params(const Param0&, const Param1&, const ArgPack&) [with Param0 = boost::adjacency_list; Param1 = boost::adjacency_list; ArgPack = boost::parameter::aux::empty_arg_list; typename boost::result_of(Param0, Param1, const ArgPack&)>::type = bool]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/isomorphism.hpp:666:1: required from ‘typename boost::result_of(Param0, Param1, const boost::parameter::aux::empty_arg_list&)>::type boost::isomorphism(const Param0&, const Param1&) [with Param0 = adjacency_list; Param1 = adjacency_list; typename result_of(Param0, Param1, const parameter::aux::empty_arg_list&)>::type = bool]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/is_kuratowski_subgraph.hpp:278:34: required from ‘bool boost::is_kuratowski_subgraph(const Graph&, ForwardIterator, ForwardIterator, VertexIndexMap) [with Graph = adjacency_list, property >; ForwardIterator = __gnu_cxx::__normal_iterator*, std::vector > >; VertexIndexMap = vec_adj_list_vertex_id_map, long unsigned int>]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/is_kuratowski_subgraph.hpp:290:34: required from ‘bool boost::is_kuratowski_subgraph(const Graph&, ForwardIterator, ForwardIterator) [with Graph = adjacency_list, property >; ForwardIterator = __gnu_cxx::__normal_iterator*, std::vector > >]’ planar.cpp:435:37: required from here /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::RandomAccessIterator::~RandomAccessIterator() [with TT = __gnu_cxx::__normal_iterator >]’ 37 | ~model() | ^ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:601:7: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 601 | BOOST_CONCEPT_USAGE(RandomAccessIterator) | ^~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::CopyConstructible<__gnu_cxx::__normal_iterator > >]’: /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements > > >]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:167:5: required from ‘struct boost::CopyConstructible<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/range/concepts.hpp:125:16: required from ‘struct boost::range_detail::IncrementableIteratorConcept<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/range/concepts.hpp:147:16: required from ‘struct boost::range_detail::SinglePassIteratorConcept<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::range_detail::SinglePassIteratorConcept<__gnu_cxx::__normal_iterator > >]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:42:5: [ skipping 14 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/isomorphism.hpp:651:42: required from ‘bool boost::graph::detail::isomorphism_impl::operator()(const Graph1&, const Graph2&, const ArgPack&) const [with ArgPack = boost::parameter::aux::empty_arg_list; Graph1 = boost::adjacency_list; Graph2 = boost::adjacency_list]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/isomorphism.hpp:662:5: required from ‘typename boost::result_of(Param0, Param1, const ArgPack&)>::type boost::graph::isomorphism_with_named_params(const Param0&, const Param1&, const ArgPack&) [with Param0 = boost::adjacency_list; Param1 = boost::adjacency_list; ArgPack = boost::parameter::aux::empty_arg_list; typename boost::result_of(Param0, Param1, const ArgPack&)>::type = bool]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/isomorphism.hpp:666:1: required from ‘typename boost::result_of(Param0, Param1, const boost::parameter::aux::empty_arg_list&)>::type boost::isomorphism(const Param0&, const Param1&) [with Param0 = adjacency_list; Param1 = adjacency_list; typename result_of(Param0, Param1, const parameter::aux::empty_arg_list&)>::type = bool]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/is_kuratowski_subgraph.hpp:278:34: required from ‘bool boost::is_kuratowski_subgraph(const Graph&, ForwardIterator, ForwardIterator, VertexIndexMap) [with Graph = adjacency_list, property >; ForwardIterator = __gnu_cxx::__normal_iterator*, std::vector > >; VertexIndexMap = vec_adj_list_vertex_id_map, long unsigned int>]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/is_kuratowski_subgraph.hpp:290:34: required from ‘bool boost::is_kuratowski_subgraph(const Graph&, ForwardIterator, ForwardIterator) [with Graph = adjacency_list, property >; ForwardIterator = __gnu_cxx::__normal_iterator*, std::vector > >]’ planar.cpp:435:37: required from here /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::CopyConstructible::~CopyConstructible() [with TT = __gnu_cxx::__normal_iterator >]’ 37 | ~model() | ^ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:167:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 167 | BOOST_CONCEPT_USAGE(CopyConstructible) { | ^~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::Convertible]’: /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements >]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:208:5: required from ‘struct boost::Convertible’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::Convertible]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied >::value’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:72:8: [ skipping 18 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/isomorphism.hpp:651:42: required from ‘bool boost::graph::detail::isomorphism_impl::operator()(const Graph1&, const Graph2&, const ArgPack&) const [with ArgPack = boost::parameter::aux::empty_arg_list; Graph1 = boost::adjacency_list; Graph2 = boost::adjacency_list]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/isomorphism.hpp:662:5: required from ‘typename boost::result_of(Param0, Param1, const ArgPack&)>::type boost::graph::isomorphism_with_named_params(const Param0&, const Param1&, const ArgPack&) [with Param0 = boost::adjacency_list; Param1 = boost::adjacency_list; ArgPack = boost::parameter::aux::empty_arg_list; typename boost::result_of(Param0, Param1, const ArgPack&)>::type = bool]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/isomorphism.hpp:666:1: required from ‘typename boost::result_of(Param0, Param1, const boost::parameter::aux::empty_arg_list&)>::type boost::isomorphism(const Param0&, const Param1&) [with Param0 = adjacency_list; Param1 = adjacency_list; typename result_of(Param0, Param1, const parameter::aux::empty_arg_list&)>::type = bool]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/is_kuratowski_subgraph.hpp:278:34: required from ‘bool boost::is_kuratowski_subgraph(const Graph&, ForwardIterator, ForwardIterator, VertexIndexMap) [with Graph = adjacency_list, property >; ForwardIterator = __gnu_cxx::__normal_iterator*, std::vector > >; VertexIndexMap = vec_adj_list_vertex_id_map, long unsigned int>]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/is_kuratowski_subgraph.hpp:290:34: required from ‘bool boost::is_kuratowski_subgraph(const Graph&, ForwardIterator, ForwardIterator) [with Graph = adjacency_list, property >; ForwardIterator = __gnu_cxx::__normal_iterator*, std::vector > >]’ planar.cpp:435:37: required from here /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::Convertible::~Convertible() [with X = boost::iterators::random_access_traversal_tag; Y = boost::iterators::incrementable_traversal_tag]’ 37 | ~model() | ^ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:208:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 208 | BOOST_CONCEPT_USAGE(Convertible) { | ^~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::range_detail::IncrementableIteratorConcept<__gnu_cxx::__normal_iterator > >]’: /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements > > >]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/range/concepts.hpp:136:13: required from ‘struct boost::range_detail::IncrementableIteratorConcept<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/range/concepts.hpp:147:16: required from ‘struct boost::range_detail::SinglePassIteratorConcept<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::range_detail::SinglePassIteratorConcept<__gnu_cxx::__normal_iterator > >]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied > > >::value’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:45:51: [ skipping 13 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/isomorphism.hpp:651:42: required from ‘bool boost::graph::detail::isomorphism_impl::operator()(const Graph1&, const Graph2&, const ArgPack&) const [with ArgPack = boost::parameter::aux::empty_arg_list; Graph1 = boost::adjacency_list; Graph2 = boost::adjacency_list]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/isomorphism.hpp:662:5: required from ‘typename boost::result_of(Param0, Param1, const ArgPack&)>::type boost::graph::isomorphism_with_named_params(const Param0&, const Param1&, const ArgPack&) [with Param0 = boost::adjacency_list; Param1 = boost::adjacency_list; ArgPack = boost::parameter::aux::empty_arg_list; typename boost::result_of(Param0, Param1, const ArgPack&)>::type = bool]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/isomorphism.hpp:666:1: required from ‘typename boost::result_of(Param0, Param1, const boost::parameter::aux::empty_arg_list&)>::type boost::isomorphism(const Param0&, const Param1&) [with Param0 = adjacency_list; Param1 = adjacency_list; typename result_of(Param0, Param1, const parameter::aux::empty_arg_list&)>::type = bool]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/is_kuratowski_subgraph.hpp:278:34: required from ‘bool boost::is_kuratowski_subgraph(const Graph&, ForwardIterator, ForwardIterator, VertexIndexMap) [with Graph = adjacency_list, property >; ForwardIterator = __gnu_cxx::__normal_iterator*, std::vector > >; VertexIndexMap = vec_adj_list_vertex_id_map, long unsigned int>]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/is_kuratowski_subgraph.hpp:290:34: required from ‘bool boost::is_kuratowski_subgraph(const Graph&, ForwardIterator, ForwardIterator) [with Graph = adjacency_list, property >; ForwardIterator = __gnu_cxx::__normal_iterator*, std::vector > >]’ planar.cpp:435:37: required from here /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::range_detail::IncrementableIteratorConcept::~IncrementableIteratorConcept() [with Iterator = __gnu_cxx::__normal_iterator >]’ 37 | ~model() | ^ /home/omnipath/local/R/4.4-3.20/BH/include/boost/range/concepts.hpp:136:13: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 136 | BOOST_CONCEPT_USAGE(IncrementableIteratorConcept) | ^~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::Convertible]’: /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements >]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:208:5: required from ‘struct boost::Convertible’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::Convertible]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied >::value’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:72:8: [ skipping 17 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/isomorphism.hpp:651:42: required from ‘bool boost::graph::detail::isomorphism_impl::operator()(const Graph1&, const Graph2&, const ArgPack&) const [with ArgPack = boost::parameter::aux::empty_arg_list; Graph1 = boost::adjacency_list; Graph2 = boost::adjacency_list]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/isomorphism.hpp:662:5: required from ‘typename boost::result_of(Param0, Param1, const ArgPack&)>::type boost::graph::isomorphism_with_named_params(const Param0&, const Param1&, const ArgPack&) [with Param0 = boost::adjacency_list; Param1 = boost::adjacency_list; ArgPack = boost::parameter::aux::empty_arg_list; typename boost::result_of(Param0, Param1, const ArgPack&)>::type = bool]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/isomorphism.hpp:666:1: required from ‘typename boost::result_of(Param0, Param1, const boost::parameter::aux::empty_arg_list&)>::type boost::isomorphism(const Param0&, const Param1&) [with Param0 = adjacency_list; Param1 = adjacency_list; typename result_of(Param0, Param1, const parameter::aux::empty_arg_list&)>::type = bool]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/is_kuratowski_subgraph.hpp:278:34: required from ‘bool boost::is_kuratowski_subgraph(const Graph&, ForwardIterator, ForwardIterator, VertexIndexMap) [with Graph = adjacency_list, property >; ForwardIterator = __gnu_cxx::__normal_iterator*, std::vector > >; VertexIndexMap = vec_adj_list_vertex_id_map, long unsigned int>]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/is_kuratowski_subgraph.hpp:290:34: required from ‘bool boost::is_kuratowski_subgraph(const Graph&, ForwardIterator, ForwardIterator) [with Graph = adjacency_list, property >; ForwardIterator = __gnu_cxx::__normal_iterator*, std::vector > >]’ planar.cpp:435:37: required from here /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::Convertible::~Convertible() [with X = boost::iterators::random_access_traversal_tag; Y = boost::iterators::single_pass_traversal_tag]’ 37 | ~model() | ^ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:208:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 208 | BOOST_CONCEPT_USAGE(Convertible) { | ^~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::range_detail::SinglePassIteratorConcept<__gnu_cxx::__normal_iterator > >]’: /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements > > >]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/range/concepts.hpp:158:13: required from ‘struct boost::range_detail::SinglePassIteratorConcept<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::range_detail::SinglePassIteratorConcept<__gnu_cxx::__normal_iterator > >]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied > > >::value’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied > > >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:72:8: [ skipping 12 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/isomorphism.hpp:651:42: required from ‘bool boost::graph::detail::isomorphism_impl::operator()(const Graph1&, const Graph2&, const ArgPack&) const [with ArgPack = boost::parameter::aux::empty_arg_list; Graph1 = boost::adjacency_list; Graph2 = boost::adjacency_list]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/isomorphism.hpp:662:5: required from ‘typename boost::result_of(Param0, Param1, const ArgPack&)>::type boost::graph::isomorphism_with_named_params(const Param0&, const Param1&, const ArgPack&) [with Param0 = boost::adjacency_list; Param1 = boost::adjacency_list; ArgPack = boost::parameter::aux::empty_arg_list; typename boost::result_of(Param0, Param1, const ArgPack&)>::type = bool]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/isomorphism.hpp:666:1: required from ‘typename boost::result_of(Param0, Param1, const boost::parameter::aux::empty_arg_list&)>::type boost::isomorphism(const Param0&, const Param1&) [with Param0 = adjacency_list; Param1 = adjacency_list; typename result_of(Param0, Param1, const parameter::aux::empty_arg_list&)>::type = bool]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/is_kuratowski_subgraph.hpp:278:34: required from ‘bool boost::is_kuratowski_subgraph(const Graph&, ForwardIterator, ForwardIterator, VertexIndexMap) [with Graph = adjacency_list, property >; ForwardIterator = __gnu_cxx::__normal_iterator*, std::vector > >; VertexIndexMap = vec_adj_list_vertex_id_map, long unsigned int>]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/is_kuratowski_subgraph.hpp:290:34: required from ‘bool boost::is_kuratowski_subgraph(const Graph&, ForwardIterator, ForwardIterator) [with Graph = adjacency_list, property >; ForwardIterator = __gnu_cxx::__normal_iterator*, std::vector > >]’ planar.cpp:435:37: required from here /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::range_detail::SinglePassIteratorConcept::~SinglePassIteratorConcept() [with Iterator = __gnu_cxx::__normal_iterator >]’ 37 | ~model() | ^ /home/omnipath/local/R/4.4-3.20/BH/include/boost/range/concepts.hpp:158:13: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 158 | BOOST_CONCEPT_USAGE(SinglePassIteratorConcept) | ^~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::CopyConstructible<__gnu_cxx::__normal_iterator > >]’: /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements > > >]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:167:5: required from ‘struct boost::CopyConstructible<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/range/concepts.hpp:125:16: required from ‘struct boost::range_detail::IncrementableIteratorConcept<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/range/concepts.hpp:147:16: required from ‘struct boost::range_detail::SinglePassIteratorConcept<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::range_detail::SinglePassIteratorConcept<__gnu_cxx::__normal_iterator > >]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:42:5: [ skipping 14 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/isomorphism.hpp:651:42: required from ‘bool boost::graph::detail::isomorphism_impl::operator()(const Graph1&, const Graph2&, const ArgPack&) const [with ArgPack = boost::parameter::aux::empty_arg_list; Graph1 = boost::adjacency_list; Graph2 = boost::adjacency_list]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/isomorphism.hpp:662:5: required from ‘typename boost::result_of(Param0, Param1, const ArgPack&)>::type boost::graph::isomorphism_with_named_params(const Param0&, const Param1&, const ArgPack&) [with Param0 = boost::adjacency_list; Param1 = boost::adjacency_list; ArgPack = boost::parameter::aux::empty_arg_list; typename boost::result_of(Param0, Param1, const ArgPack&)>::type = bool]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/isomorphism.hpp:666:1: required from ‘typename boost::result_of(Param0, Param1, const boost::parameter::aux::empty_arg_list&)>::type boost::isomorphism(const Param0&, const Param1&) [with Param0 = adjacency_list; Param1 = adjacency_list; typename result_of(Param0, Param1, const parameter::aux::empty_arg_list&)>::type = bool]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/is_kuratowski_subgraph.hpp:278:34: required from ‘bool boost::is_kuratowski_subgraph(const Graph&, ForwardIterator, ForwardIterator, VertexIndexMap) [with Graph = adjacency_list, property >; ForwardIterator = __gnu_cxx::__normal_iterator*, std::vector > >; VertexIndexMap = vec_adj_list_vertex_id_map, long unsigned int>]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/is_kuratowski_subgraph.hpp:290:34: required from ‘bool boost::is_kuratowski_subgraph(const Graph&, ForwardIterator, ForwardIterator) [with Graph = adjacency_list, property >; ForwardIterator = __gnu_cxx::__normal_iterator*, std::vector > >]’ planar.cpp:435:37: required from here /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::CopyConstructible::~CopyConstructible() [with TT = __gnu_cxx::__normal_iterator >]’ 37 | ~model() | ^ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:167:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 167 | BOOST_CONCEPT_USAGE(CopyConstructible) { | ^~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::range_detail::IncrementableIteratorConcept<__gnu_cxx::__normal_iterator > >]’: /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements > > >]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/range/concepts.hpp:136:13: required from ‘struct boost::range_detail::IncrementableIteratorConcept<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/range/concepts.hpp:147:16: required from ‘struct boost::range_detail::SinglePassIteratorConcept<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::range_detail::SinglePassIteratorConcept<__gnu_cxx::__normal_iterator > >]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied > > >::value’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:45:51: [ skipping 13 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/isomorphism.hpp:651:42: required from ‘bool boost::graph::detail::isomorphism_impl::operator()(const Graph1&, const Graph2&, const ArgPack&) const [with ArgPack = boost::parameter::aux::empty_arg_list; Graph1 = boost::adjacency_list; Graph2 = boost::adjacency_list]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/isomorphism.hpp:662:5: required from ‘typename boost::result_of(Param0, Param1, const ArgPack&)>::type boost::graph::isomorphism_with_named_params(const Param0&, const Param1&, const ArgPack&) [with Param0 = boost::adjacency_list; Param1 = boost::adjacency_list; ArgPack = boost::parameter::aux::empty_arg_list; typename boost::result_of(Param0, Param1, const ArgPack&)>::type = bool]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/isomorphism.hpp:666:1: required from ‘typename boost::result_of(Param0, Param1, const boost::parameter::aux::empty_arg_list&)>::type boost::isomorphism(const Param0&, const Param1&) [with Param0 = adjacency_list; Param1 = adjacency_list; typename result_of(Param0, Param1, const parameter::aux::empty_arg_list&)>::type = bool]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/is_kuratowski_subgraph.hpp:278:34: required from ‘bool boost::is_kuratowski_subgraph(const Graph&, ForwardIterator, ForwardIterator, VertexIndexMap) [with Graph = adjacency_list, property >; ForwardIterator = __gnu_cxx::__normal_iterator*, std::vector > >; VertexIndexMap = vec_adj_list_vertex_id_map, long unsigned int>]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/is_kuratowski_subgraph.hpp:290:34: required from ‘bool boost::is_kuratowski_subgraph(const Graph&, ForwardIterator, ForwardIterator) [with Graph = adjacency_list, property >; ForwardIterator = __gnu_cxx::__normal_iterator*, std::vector > >]’ planar.cpp:435:37: required from here /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::range_detail::IncrementableIteratorConcept::~IncrementableIteratorConcept() [with Iterator = __gnu_cxx::__normal_iterator >]’ 37 | ~model() | ^ /home/omnipath/local/R/4.4-3.20/BH/include/boost/range/concepts.hpp:136:13: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 136 | BOOST_CONCEPT_USAGE(IncrementableIteratorConcept) | ^~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::EqualityComparable<__gnu_cxx::__normal_iterator > >]’: /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements > > >]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:233:5: required from ‘struct boost::EqualityComparable<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/range/concepts.hpp:147:16: required from ‘struct boost::range_detail::SinglePassIteratorConcept<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::range_detail::SinglePassIteratorConcept<__gnu_cxx::__normal_iterator > >]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied > > >::value’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:45:51: [ skipping 13 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/isomorphism.hpp:651:42: required from ‘bool boost::graph::detail::isomorphism_impl::operator()(const Graph1&, const Graph2&, const ArgPack&) const [with ArgPack = boost::parameter::aux::empty_arg_list; Graph1 = boost::adjacency_list; Graph2 = boost::adjacency_list]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/isomorphism.hpp:662:5: required from ‘typename boost::result_of(Param0, Param1, const ArgPack&)>::type boost::graph::isomorphism_with_named_params(const Param0&, const Param1&, const ArgPack&) [with Param0 = boost::adjacency_list; Param1 = boost::adjacency_list; ArgPack = boost::parameter::aux::empty_arg_list; typename boost::result_of(Param0, Param1, const ArgPack&)>::type = bool]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/isomorphism.hpp:666:1: required from ‘typename boost::result_of(Param0, Param1, const boost::parameter::aux::empty_arg_list&)>::type boost::isomorphism(const Param0&, const Param1&) [with Param0 = adjacency_list; Param1 = adjacency_list; typename result_of(Param0, Param1, const parameter::aux::empty_arg_list&)>::type = bool]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/is_kuratowski_subgraph.hpp:278:34: required from ‘bool boost::is_kuratowski_subgraph(const Graph&, ForwardIterator, ForwardIterator, VertexIndexMap) [with Graph = adjacency_list, property >; ForwardIterator = __gnu_cxx::__normal_iterator*, std::vector > >; VertexIndexMap = vec_adj_list_vertex_id_map, long unsigned int>]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/is_kuratowski_subgraph.hpp:290:34: required from ‘bool boost::is_kuratowski_subgraph(const Graph&, ForwardIterator, ForwardIterator) [with Graph = adjacency_list, property >; ForwardIterator = __gnu_cxx::__normal_iterator*, std::vector > >]’ planar.cpp:435:37: required from here /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::EqualityComparable::~EqualityComparable() [with TT = __gnu_cxx::__normal_iterator >]’ 37 | ~model() | ^ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:233:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 233 | BOOST_CONCEPT_USAGE(EqualityComparable) { | ^~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::range_detail::SinglePassIteratorConcept<__gnu_cxx::__normal_iterator > >]’: /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements > > >]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/range/concepts.hpp:158:13: required from ‘struct boost::range_detail::SinglePassIteratorConcept<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::range_detail::SinglePassIteratorConcept<__gnu_cxx::__normal_iterator > >]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied > > >::value’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied > > >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:72:8: [ skipping 12 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/isomorphism.hpp:651:42: required from ‘bool boost::graph::detail::isomorphism_impl::operator()(const Graph1&, const Graph2&, const ArgPack&) const [with ArgPack = boost::parameter::aux::empty_arg_list; Graph1 = boost::adjacency_list; Graph2 = boost::adjacency_list]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/isomorphism.hpp:662:5: required from ‘typename boost::result_of(Param0, Param1, const ArgPack&)>::type boost::graph::isomorphism_with_named_params(const Param0&, const Param1&, const ArgPack&) [with Param0 = boost::adjacency_list; Param1 = boost::adjacency_list; ArgPack = boost::parameter::aux::empty_arg_list; typename boost::result_of(Param0, Param1, const ArgPack&)>::type = bool]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/isomorphism.hpp:666:1: required from ‘typename boost::result_of(Param0, Param1, const boost::parameter::aux::empty_arg_list&)>::type boost::isomorphism(const Param0&, const Param1&) [with Param0 = adjacency_list; Param1 = adjacency_list; typename result_of(Param0, Param1, const parameter::aux::empty_arg_list&)>::type = bool]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/is_kuratowski_subgraph.hpp:278:34: required from ‘bool boost::is_kuratowski_subgraph(const Graph&, ForwardIterator, ForwardIterator, VertexIndexMap) [with Graph = adjacency_list, property >; ForwardIterator = __gnu_cxx::__normal_iterator*, std::vector > >; VertexIndexMap = vec_adj_list_vertex_id_map, long unsigned int>]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/is_kuratowski_subgraph.hpp:290:34: required from ‘bool boost::is_kuratowski_subgraph(const Graph&, ForwardIterator, ForwardIterator) [with Graph = adjacency_list, property >; ForwardIterator = __gnu_cxx::__normal_iterator*, std::vector > >]’ planar.cpp:435:37: required from here /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::range_detail::SinglePassIteratorConcept::~SinglePassIteratorConcept() [with Iterator = __gnu_cxx::__normal_iterator >]’ 37 | ~model() | ^ /home/omnipath/local/R/4.4-3.20/BH/include/boost/range/concepts.hpp:158:13: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 158 | BOOST_CONCEPT_USAGE(SinglePassIteratorConcept) | ^~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::SinglePassRangeConcept >]’: /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements > >]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/range/concepts.hpp:284:9: required from ‘struct boost::SinglePassRangeConcept >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/range/concepts.hpp:318:12: required from ‘struct boost::ForwardRangeConcept >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/range/concepts.hpp:352:12: required from ‘struct boost::BidirectionalRangeConcept >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/range/concepts.hpp:370:12: required from ‘struct boost::RandomAccessRangeConcept >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:32:62: [ skipping 7 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/isomorphism.hpp:651:42: required from ‘bool boost::graph::detail::isomorphism_impl::operator()(const Graph1&, const Graph2&, const ArgPack&) const [with ArgPack = boost::parameter::aux::empty_arg_list; Graph1 = boost::adjacency_list; Graph2 = boost::adjacency_list]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/isomorphism.hpp:662:5: required from ‘typename boost::result_of(Param0, Param1, const ArgPack&)>::type boost::graph::isomorphism_with_named_params(const Param0&, const Param1&, const ArgPack&) [with Param0 = boost::adjacency_list; Param1 = boost::adjacency_list; ArgPack = boost::parameter::aux::empty_arg_list; typename boost::result_of(Param0, Param1, const ArgPack&)>::type = bool]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/isomorphism.hpp:666:1: required from ‘typename boost::result_of(Param0, Param1, const boost::parameter::aux::empty_arg_list&)>::type boost::isomorphism(const Param0&, const Param1&) [with Param0 = adjacency_list; Param1 = adjacency_list; typename result_of(Param0, Param1, const parameter::aux::empty_arg_list&)>::type = bool]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/is_kuratowski_subgraph.hpp:278:34: required from ‘bool boost::is_kuratowski_subgraph(const Graph&, ForwardIterator, ForwardIterator, VertexIndexMap) [with Graph = adjacency_list, property >; ForwardIterator = __gnu_cxx::__normal_iterator*, std::vector > >; VertexIndexMap = vec_adj_list_vertex_id_map, long unsigned int>]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/is_kuratowski_subgraph.hpp:290:34: required from ‘bool boost::is_kuratowski_subgraph(const Graph&, ForwardIterator, ForwardIterator) [with Graph = adjacency_list, property >; ForwardIterator = __gnu_cxx::__normal_iterator*, std::vector > >]’ planar.cpp:435:37: required from here /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::SinglePassRangeConcept::~SinglePassRangeConcept() [with T = std::vector]’ 37 | ~model() | ^ /home/omnipath/local/R/4.4-3.20/BH/include/boost/range/concepts.hpp:284:9: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 284 | BOOST_CONCEPT_USAGE(SinglePassRangeConcept) | ^~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::DefaultConstructible<__gnu_cxx::__normal_iterator > >]’: /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements > > >]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:137:5: required from ‘struct boost::DefaultConstructible<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/range/concepts.hpp:181:16: required from ‘struct boost::range_detail::ForwardIteratorConcept<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::range_detail::ForwardIteratorConcept<__gnu_cxx::__normal_iterator > >]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied > > >::value’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:45:51: [ skipping 12 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/isomorphism.hpp:651:42: required from ‘bool boost::graph::detail::isomorphism_impl::operator()(const Graph1&, const Graph2&, const ArgPack&) const [with ArgPack = boost::parameter::aux::empty_arg_list; Graph1 = boost::adjacency_list; Graph2 = boost::adjacency_list]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/isomorphism.hpp:662:5: required from ‘typename boost::result_of(Param0, Param1, const ArgPack&)>::type boost::graph::isomorphism_with_named_params(const Param0&, const Param1&, const ArgPack&) [with Param0 = boost::adjacency_list; Param1 = boost::adjacency_list; ArgPack = boost::parameter::aux::empty_arg_list; typename boost::result_of(Param0, Param1, const ArgPack&)>::type = bool]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/isomorphism.hpp:666:1: required from ‘typename boost::result_of(Param0, Param1, const boost::parameter::aux::empty_arg_list&)>::type boost::isomorphism(const Param0&, const Param1&) [with Param0 = adjacency_list; Param1 = adjacency_list; typename result_of(Param0, Param1, const parameter::aux::empty_arg_list&)>::type = bool]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/is_kuratowski_subgraph.hpp:278:34: required from ‘bool boost::is_kuratowski_subgraph(const Graph&, ForwardIterator, ForwardIterator, VertexIndexMap) [with Graph = adjacency_list, property >; ForwardIterator = __gnu_cxx::__normal_iterator*, std::vector > >; VertexIndexMap = vec_adj_list_vertex_id_map, long unsigned int>]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/is_kuratowski_subgraph.hpp:290:34: required from ‘bool boost::is_kuratowski_subgraph(const Graph&, ForwardIterator, ForwardIterator) [with Graph = adjacency_list, property >; ForwardIterator = __gnu_cxx::__normal_iterator*, std::vector > >]’ planar.cpp:435:37: required from here /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::DefaultConstructible::~DefaultConstructible() [with TT = __gnu_cxx::__normal_iterator >]’ 37 | ~model() | ^ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:137:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 137 | BOOST_CONCEPT_USAGE(DefaultConstructible) { | ^~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::Convertible]’: /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements >]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:208:5: required from ‘struct boost::Convertible’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::Convertible]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied >::value’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:72:8: [ skipping 16 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/isomorphism.hpp:651:42: required from ‘bool boost::graph::detail::isomorphism_impl::operator()(const Graph1&, const Graph2&, const ArgPack&) const [with ArgPack = boost::parameter::aux::empty_arg_list; Graph1 = boost::adjacency_list; Graph2 = boost::adjacency_list]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/isomorphism.hpp:662:5: required from ‘typename boost::result_of(Param0, Param1, const ArgPack&)>::type boost::graph::isomorphism_with_named_params(const Param0&, const Param1&, const ArgPack&) [with Param0 = boost::adjacency_list; Param1 = boost::adjacency_list; ArgPack = boost::parameter::aux::empty_arg_list; typename boost::result_of(Param0, Param1, const ArgPack&)>::type = bool]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/isomorphism.hpp:666:1: required from ‘typename boost::result_of(Param0, Param1, const boost::parameter::aux::empty_arg_list&)>::type boost::isomorphism(const Param0&, const Param1&) [with Param0 = adjacency_list; Param1 = adjacency_list; typename result_of(Param0, Param1, const parameter::aux::empty_arg_list&)>::type = bool]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/is_kuratowski_subgraph.hpp:278:34: required from ‘bool boost::is_kuratowski_subgraph(const Graph&, ForwardIterator, ForwardIterator, VertexIndexMap) [with Graph = adjacency_list, property >; ForwardIterator = __gnu_cxx::__normal_iterator*, std::vector > >; VertexIndexMap = vec_adj_list_vertex_id_map, long unsigned int>]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/is_kuratowski_subgraph.hpp:290:34: required from ‘bool boost::is_kuratowski_subgraph(const Graph&, ForwardIterator, ForwardIterator) [with Graph = adjacency_list, property >; ForwardIterator = __gnu_cxx::__normal_iterator*, std::vector > >]’ planar.cpp:435:37: required from here /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::Convertible::~Convertible() [with X = boost::iterators::random_access_traversal_tag; Y = boost::iterators::forward_traversal_tag]’ 37 | ~model() | ^ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:208:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 208 | BOOST_CONCEPT_USAGE(Convertible) { | ^~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::range_detail::ForwardIteratorConcept<__gnu_cxx::__normal_iterator > >]’: /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements > > >]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/range/concepts.hpp:197:13: required from ‘struct boost::range_detail::ForwardIteratorConcept<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::range_detail::ForwardIteratorConcept<__gnu_cxx::__normal_iterator > >]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied > > >::value’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied > > >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:72:8: [ skipping 11 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/isomorphism.hpp:651:42: required from ‘bool boost::graph::detail::isomorphism_impl::operator()(const Graph1&, const Graph2&, const ArgPack&) const [with ArgPack = boost::parameter::aux::empty_arg_list; Graph1 = boost::adjacency_list; Graph2 = boost::adjacency_list]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/isomorphism.hpp:662:5: required from ‘typename boost::result_of(Param0, Param1, const ArgPack&)>::type boost::graph::isomorphism_with_named_params(const Param0&, const Param1&, const ArgPack&) [with Param0 = boost::adjacency_list; Param1 = boost::adjacency_list; ArgPack = boost::parameter::aux::empty_arg_list; typename boost::result_of(Param0, Param1, const ArgPack&)>::type = bool]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/isomorphism.hpp:666:1: required from ‘typename boost::result_of(Param0, Param1, const boost::parameter::aux::empty_arg_list&)>::type boost::isomorphism(const Param0&, const Param1&) [with Param0 = adjacency_list; Param1 = adjacency_list; typename result_of(Param0, Param1, const parameter::aux::empty_arg_list&)>::type = bool]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/is_kuratowski_subgraph.hpp:278:34: required from ‘bool boost::is_kuratowski_subgraph(const Graph&, ForwardIterator, ForwardIterator, VertexIndexMap) [with Graph = adjacency_list, property >; ForwardIterator = __gnu_cxx::__normal_iterator*, std::vector > >; VertexIndexMap = vec_adj_list_vertex_id_map, long unsigned int>]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/is_kuratowski_subgraph.hpp:290:34: required from ‘bool boost::is_kuratowski_subgraph(const Graph&, ForwardIterator, ForwardIterator) [with Graph = adjacency_list, property >; ForwardIterator = __gnu_cxx::__normal_iterator*, std::vector > >]’ planar.cpp:435:37: required from here /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::range_detail::ForwardIteratorConcept::~ForwardIteratorConcept() [with Iterator = __gnu_cxx::__normal_iterator >]’ 37 | ~model() | ^ /home/omnipath/local/R/4.4-3.20/BH/include/boost/range/concepts.hpp:197:13: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 197 | BOOST_CONCEPT_USAGE(ForwardIteratorConcept) | ^~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::DefaultConstructible<__gnu_cxx::__normal_iterator > >]’: /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements > > >]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:137:5: required from ‘struct boost::DefaultConstructible<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/range/concepts.hpp:181:16: required from ‘struct boost::range_detail::ForwardIteratorConcept<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::range_detail::ForwardIteratorConcept<__gnu_cxx::__normal_iterator > >]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied > > >::value’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:45:51: [ skipping 12 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/isomorphism.hpp:651:42: required from ‘bool boost::graph::detail::isomorphism_impl::operator()(const Graph1&, const Graph2&, const ArgPack&) const [with ArgPack = boost::parameter::aux::empty_arg_list; Graph1 = boost::adjacency_list; Graph2 = boost::adjacency_list]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/isomorphism.hpp:662:5: required from ‘typename boost::result_of(Param0, Param1, const ArgPack&)>::type boost::graph::isomorphism_with_named_params(const Param0&, const Param1&, const ArgPack&) [with Param0 = boost::adjacency_list; Param1 = boost::adjacency_list; ArgPack = boost::parameter::aux::empty_arg_list; typename boost::result_of(Param0, Param1, const ArgPack&)>::type = bool]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/isomorphism.hpp:666:1: required from ‘typename boost::result_of(Param0, Param1, const boost::parameter::aux::empty_arg_list&)>::type boost::isomorphism(const Param0&, const Param1&) [with Param0 = adjacency_list; Param1 = adjacency_list; typename result_of(Param0, Param1, const parameter::aux::empty_arg_list&)>::type = bool]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/is_kuratowski_subgraph.hpp:278:34: required from ‘bool boost::is_kuratowski_subgraph(const Graph&, ForwardIterator, ForwardIterator, VertexIndexMap) [with Graph = adjacency_list, property >; ForwardIterator = __gnu_cxx::__normal_iterator*, std::vector > >; VertexIndexMap = vec_adj_list_vertex_id_map, long unsigned int>]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/is_kuratowski_subgraph.hpp:290:34: required from ‘bool boost::is_kuratowski_subgraph(const Graph&, ForwardIterator, ForwardIterator) [with Graph = adjacency_list, property >; ForwardIterator = __gnu_cxx::__normal_iterator*, std::vector > >]’ planar.cpp:435:37: required from here /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::DefaultConstructible::~DefaultConstructible() [with TT = __gnu_cxx::__normal_iterator >]’ 37 | ~model() | ^ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:137:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 137 | BOOST_CONCEPT_USAGE(DefaultConstructible) { | ^~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::range_detail::ForwardIteratorConcept<__gnu_cxx::__normal_iterator > >]’: /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements > > >]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/range/concepts.hpp:197:13: required from ‘struct boost::range_detail::ForwardIteratorConcept<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::range_detail::ForwardIteratorConcept<__gnu_cxx::__normal_iterator > >]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied > > >::value’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied > > >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:72:8: [ skipping 11 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/isomorphism.hpp:651:42: required from ‘bool boost::graph::detail::isomorphism_impl::operator()(const Graph1&, const Graph2&, const ArgPack&) const [with ArgPack = boost::parameter::aux::empty_arg_list; Graph1 = boost::adjacency_list; Graph2 = boost::adjacency_list]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/isomorphism.hpp:662:5: required from ‘typename boost::result_of(Param0, Param1, const ArgPack&)>::type boost::graph::isomorphism_with_named_params(const Param0&, const Param1&, const ArgPack&) [with Param0 = boost::adjacency_list; Param1 = boost::adjacency_list; ArgPack = boost::parameter::aux::empty_arg_list; typename boost::result_of(Param0, Param1, const ArgPack&)>::type = bool]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/isomorphism.hpp:666:1: required from ‘typename boost::result_of(Param0, Param1, const boost::parameter::aux::empty_arg_list&)>::type boost::isomorphism(const Param0&, const Param1&) [with Param0 = adjacency_list; Param1 = adjacency_list; typename result_of(Param0, Param1, const parameter::aux::empty_arg_list&)>::type = bool]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/is_kuratowski_subgraph.hpp:278:34: required from ‘bool boost::is_kuratowski_subgraph(const Graph&, ForwardIterator, ForwardIterator, VertexIndexMap) [with Graph = adjacency_list, property >; ForwardIterator = __gnu_cxx::__normal_iterator*, std::vector > >; VertexIndexMap = vec_adj_list_vertex_id_map, long unsigned int>]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/is_kuratowski_subgraph.hpp:290:34: required from ‘bool boost::is_kuratowski_subgraph(const Graph&, ForwardIterator, ForwardIterator) [with Graph = adjacency_list, property >; ForwardIterator = __gnu_cxx::__normal_iterator*, std::vector > >]’ planar.cpp:435:37: required from here /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::range_detail::ForwardIteratorConcept::~ForwardIteratorConcept() [with Iterator = __gnu_cxx::__normal_iterator >]’ 37 | ~model() | ^ /home/omnipath/local/R/4.4-3.20/BH/include/boost/range/concepts.hpp:197:13: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 197 | BOOST_CONCEPT_USAGE(ForwardIteratorConcept) | ^~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::Convertible]’: /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements >]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:208:5: required from ‘struct boost::Convertible’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::Convertible]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied >::value’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:72:8: [ skipping 15 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/isomorphism.hpp:651:42: required from ‘bool boost::graph::detail::isomorphism_impl::operator()(const Graph1&, const Graph2&, const ArgPack&) const [with ArgPack = boost::parameter::aux::empty_arg_list; Graph1 = boost::adjacency_list; Graph2 = boost::adjacency_list]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/isomorphism.hpp:662:5: required from ‘typename boost::result_of(Param0, Param1, const ArgPack&)>::type boost::graph::isomorphism_with_named_params(const Param0&, const Param1&, const ArgPack&) [with Param0 = boost::adjacency_list; Param1 = boost::adjacency_list; ArgPack = boost::parameter::aux::empty_arg_list; typename boost::result_of(Param0, Param1, const ArgPack&)>::type = bool]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/isomorphism.hpp:666:1: required from ‘typename boost::result_of(Param0, Param1, const boost::parameter::aux::empty_arg_list&)>::type boost::isomorphism(const Param0&, const Param1&) [with Param0 = adjacency_list; Param1 = adjacency_list; typename result_of(Param0, Param1, const parameter::aux::empty_arg_list&)>::type = bool]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/is_kuratowski_subgraph.hpp:278:34: required from ‘bool boost::is_kuratowski_subgraph(const Graph&, ForwardIterator, ForwardIterator, VertexIndexMap) [with Graph = adjacency_list, property >; ForwardIterator = __gnu_cxx::__normal_iterator*, std::vector > >; VertexIndexMap = vec_adj_list_vertex_id_map, long unsigned int>]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/is_kuratowski_subgraph.hpp:290:34: required from ‘bool boost::is_kuratowski_subgraph(const Graph&, ForwardIterator, ForwardIterator) [with Graph = adjacency_list, property >; ForwardIterator = __gnu_cxx::__normal_iterator*, std::vector > >]’ planar.cpp:435:37: required from here /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::Convertible::~Convertible() [with X = boost::iterators::random_access_traversal_tag; Y = boost::iterators::bidirectional_traversal_tag]’ 37 | ~model() | ^ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:208:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 208 | BOOST_CONCEPT_USAGE(Convertible) { | ^~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::range_detail::BidirectionalIteratorConcept<__gnu_cxx::__normal_iterator > >]’: /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements > > >]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/range/concepts.hpp:224:14: required from ‘struct boost::range_detail::BidirectionalIteratorConcept<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::range_detail::BidirectionalIteratorConcept<__gnu_cxx::__normal_iterator > >]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied > > >::value’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied > > >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:72:8: [ skipping 10 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/isomorphism.hpp:651:42: required from ‘bool boost::graph::detail::isomorphism_impl::operator()(const Graph1&, const Graph2&, const ArgPack&) const [with ArgPack = boost::parameter::aux::empty_arg_list; Graph1 = boost::adjacency_list; Graph2 = boost::adjacency_list]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/isomorphism.hpp:662:5: required from ‘typename boost::result_of(Param0, Param1, const ArgPack&)>::type boost::graph::isomorphism_with_named_params(const Param0&, const Param1&, const ArgPack&) [with Param0 = boost::adjacency_list; Param1 = boost::adjacency_list; ArgPack = boost::parameter::aux::empty_arg_list; typename boost::result_of(Param0, Param1, const ArgPack&)>::type = bool]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/isomorphism.hpp:666:1: required from ‘typename boost::result_of(Param0, Param1, const boost::parameter::aux::empty_arg_list&)>::type boost::isomorphism(const Param0&, const Param1&) [with Param0 = adjacency_list; Param1 = adjacency_list; typename result_of(Param0, Param1, const parameter::aux::empty_arg_list&)>::type = bool]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/is_kuratowski_subgraph.hpp:278:34: required from ‘bool boost::is_kuratowski_subgraph(const Graph&, ForwardIterator, ForwardIterator, VertexIndexMap) [with Graph = adjacency_list, property >; ForwardIterator = __gnu_cxx::__normal_iterator*, std::vector > >; VertexIndexMap = vec_adj_list_vertex_id_map, long unsigned int>]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/is_kuratowski_subgraph.hpp:290:34: required from ‘bool boost::is_kuratowski_subgraph(const Graph&, ForwardIterator, ForwardIterator) [with Graph = adjacency_list, property >; ForwardIterator = __gnu_cxx::__normal_iterator*, std::vector > >]’ planar.cpp:435:37: required from here /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::range_detail::BidirectionalIteratorConcept::~BidirectionalIteratorConcept() [with Iterator = __gnu_cxx::__normal_iterator >]’ 37 | ~model() | ^ /home/omnipath/local/R/4.4-3.20/BH/include/boost/range/concepts.hpp:224:14: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 224 | BOOST_CONCEPT_USAGE(BidirectionalIteratorConcept) | ^~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::range_detail::BidirectionalIteratorConcept<__gnu_cxx::__normal_iterator > >]’: /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements > > >]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/range/concepts.hpp:224:14: required from ‘struct boost::range_detail::BidirectionalIteratorConcept<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::range_detail::BidirectionalIteratorConcept<__gnu_cxx::__normal_iterator > >]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied > > >::value’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied > > >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:72:8: [ skipping 10 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/isomorphism.hpp:651:42: required from ‘bool boost::graph::detail::isomorphism_impl::operator()(const Graph1&, const Graph2&, const ArgPack&) const [with ArgPack = boost::parameter::aux::empty_arg_list; Graph1 = boost::adjacency_list; Graph2 = boost::adjacency_list]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/isomorphism.hpp:662:5: required from ‘typename boost::result_of(Param0, Param1, const ArgPack&)>::type boost::graph::isomorphism_with_named_params(const Param0&, const Param1&, const ArgPack&) [with Param0 = boost::adjacency_list; Param1 = boost::adjacency_list; ArgPack = boost::parameter::aux::empty_arg_list; typename boost::result_of(Param0, Param1, const ArgPack&)>::type = bool]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/isomorphism.hpp:666:1: required from ‘typename boost::result_of(Param0, Param1, const boost::parameter::aux::empty_arg_list&)>::type boost::isomorphism(const Param0&, const Param1&) [with Param0 = adjacency_list; Param1 = adjacency_list; typename result_of(Param0, Param1, const parameter::aux::empty_arg_list&)>::type = bool]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/is_kuratowski_subgraph.hpp:278:34: required from ‘bool boost::is_kuratowski_subgraph(const Graph&, ForwardIterator, ForwardIterator, VertexIndexMap) [with Graph = adjacency_list, property >; ForwardIterator = __gnu_cxx::__normal_iterator*, std::vector > >; VertexIndexMap = vec_adj_list_vertex_id_map, long unsigned int>]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/is_kuratowski_subgraph.hpp:290:34: required from ‘bool boost::is_kuratowski_subgraph(const Graph&, ForwardIterator, ForwardIterator) [with Graph = adjacency_list, property >; ForwardIterator = __gnu_cxx::__normal_iterator*, std::vector > >]’ planar.cpp:435:37: required from here /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::range_detail::BidirectionalIteratorConcept::~BidirectionalIteratorConcept() [with Iterator = __gnu_cxx::__normal_iterator >]’ 37 | ~model() | ^ /home/omnipath/local/R/4.4-3.20/BH/include/boost/range/concepts.hpp:224:14: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 224 | BOOST_CONCEPT_USAGE(BidirectionalIteratorConcept) | ^~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::Convertible]’: /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements >]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:208:5: required from ‘struct boost::Convertible’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::Convertible]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied >::value’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:72:8: [ skipping 14 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/isomorphism.hpp:651:42: required from ‘bool boost::graph::detail::isomorphism_impl::operator()(const Graph1&, const Graph2&, const ArgPack&) const [with ArgPack = boost::parameter::aux::empty_arg_list; Graph1 = boost::adjacency_list; Graph2 = boost::adjacency_list]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/isomorphism.hpp:662:5: required from ‘typename boost::result_of(Param0, Param1, const ArgPack&)>::type boost::graph::isomorphism_with_named_params(const Param0&, const Param1&, const ArgPack&) [with Param0 = boost::adjacency_list; Param1 = boost::adjacency_list; ArgPack = boost::parameter::aux::empty_arg_list; typename boost::result_of(Param0, Param1, const ArgPack&)>::type = bool]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/isomorphism.hpp:666:1: required from ‘typename boost::result_of(Param0, Param1, const boost::parameter::aux::empty_arg_list&)>::type boost::isomorphism(const Param0&, const Param1&) [with Param0 = adjacency_list; Param1 = adjacency_list; typename result_of(Param0, Param1, const parameter::aux::empty_arg_list&)>::type = bool]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/is_kuratowski_subgraph.hpp:278:34: required from ‘bool boost::is_kuratowski_subgraph(const Graph&, ForwardIterator, ForwardIterator, VertexIndexMap) [with Graph = adjacency_list, property >; ForwardIterator = __gnu_cxx::__normal_iterator*, std::vector > >; VertexIndexMap = vec_adj_list_vertex_id_map, long unsigned int>]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/is_kuratowski_subgraph.hpp:290:34: required from ‘bool boost::is_kuratowski_subgraph(const Graph&, ForwardIterator, ForwardIterator) [with Graph = adjacency_list, property >; ForwardIterator = __gnu_cxx::__normal_iterator*, std::vector > >]’ planar.cpp:435:37: required from here /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::Convertible::~Convertible() [with X = boost::iterators::random_access_traversal_tag; Y = boost::iterators::random_access_traversal_tag]’ 37 | ~model() | ^ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:208:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 208 | BOOST_CONCEPT_USAGE(Convertible) { | ^~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::range_detail::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator > >]’: /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements > > >]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/range/concepts.hpp:245:14: required from ‘struct boost::range_detail::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::range_detail::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator > >]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied > > >::value’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied > > >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:72:8: [ skipping 9 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/isomorphism.hpp:651:42: required from ‘bool boost::graph::detail::isomorphism_impl::operator()(const Graph1&, const Graph2&, const ArgPack&) const [with ArgPack = boost::parameter::aux::empty_arg_list; Graph1 = boost::adjacency_list; Graph2 = boost::adjacency_list]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/isomorphism.hpp:662:5: required from ‘typename boost::result_of(Param0, Param1, const ArgPack&)>::type boost::graph::isomorphism_with_named_params(const Param0&, const Param1&, const ArgPack&) [with Param0 = boost::adjacency_list; Param1 = boost::adjacency_list; ArgPack = boost::parameter::aux::empty_arg_list; typename boost::result_of(Param0, Param1, const ArgPack&)>::type = bool]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/isomorphism.hpp:666:1: required from ‘typename boost::result_of(Param0, Param1, const boost::parameter::aux::empty_arg_list&)>::type boost::isomorphism(const Param0&, const Param1&) [with Param0 = adjacency_list; Param1 = adjacency_list; typename result_of(Param0, Param1, const parameter::aux::empty_arg_list&)>::type = bool]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/is_kuratowski_subgraph.hpp:278:34: required from ‘bool boost::is_kuratowski_subgraph(const Graph&, ForwardIterator, ForwardIterator, VertexIndexMap) [with Graph = adjacency_list, property >; ForwardIterator = __gnu_cxx::__normal_iterator*, std::vector > >; VertexIndexMap = vec_adj_list_vertex_id_map, long unsigned int>]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/is_kuratowski_subgraph.hpp:290:34: required from ‘bool boost::is_kuratowski_subgraph(const Graph&, ForwardIterator, ForwardIterator) [with Graph = adjacency_list, property >; ForwardIterator = __gnu_cxx::__normal_iterator*, std::vector > >]’ planar.cpp:435:37: required from here /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::range_detail::RandomAccessIteratorConcept::~RandomAccessIteratorConcept() [with Iterator = __gnu_cxx::__normal_iterator >]’ 37 | ~model() | ^ /home/omnipath/local/R/4.4-3.20/BH/include/boost/range/concepts.hpp:245:14: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 245 | BOOST_CONCEPT_USAGE(RandomAccessIteratorConcept) | ^~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::range_detail::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator > >]’: /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements > > >]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/range/concepts.hpp:245:14: required from ‘struct boost::range_detail::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::range_detail::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator > >]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied > > >::value’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied > > >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:72:8: [ skipping 9 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/isomorphism.hpp:651:42: required from ‘bool boost::graph::detail::isomorphism_impl::operator()(const Graph1&, const Graph2&, const ArgPack&) const [with ArgPack = boost::parameter::aux::empty_arg_list; Graph1 = boost::adjacency_list; Graph2 = boost::adjacency_list]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/isomorphism.hpp:662:5: required from ‘typename boost::result_of(Param0, Param1, const ArgPack&)>::type boost::graph::isomorphism_with_named_params(const Param0&, const Param1&, const ArgPack&) [with Param0 = boost::adjacency_list; Param1 = boost::adjacency_list; ArgPack = boost::parameter::aux::empty_arg_list; typename boost::result_of(Param0, Param1, const ArgPack&)>::type = bool]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/isomorphism.hpp:666:1: required from ‘typename boost::result_of(Param0, Param1, const boost::parameter::aux::empty_arg_list&)>::type boost::isomorphism(const Param0&, const Param1&) [with Param0 = adjacency_list; Param1 = adjacency_list; typename result_of(Param0, Param1, const parameter::aux::empty_arg_list&)>::type = bool]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/is_kuratowski_subgraph.hpp:278:34: required from ‘bool boost::is_kuratowski_subgraph(const Graph&, ForwardIterator, ForwardIterator, VertexIndexMap) [with Graph = adjacency_list, property >; ForwardIterator = __gnu_cxx::__normal_iterator*, std::vector > >; VertexIndexMap = vec_adj_list_vertex_id_map, long unsigned int>]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/is_kuratowski_subgraph.hpp:290:34: required from ‘bool boost::is_kuratowski_subgraph(const Graph&, ForwardIterator, ForwardIterator) [with Graph = adjacency_list, property >; ForwardIterator = __gnu_cxx::__normal_iterator*, std::vector > >]’ planar.cpp:435:37: required from here /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::range_detail::RandomAccessIteratorConcept::~RandomAccessIteratorConcept() [with Iterator = __gnu_cxx::__normal_iterator >]’ 37 | ~model() | ^ /home/omnipath/local/R/4.4-3.20/BH/include/boost/range/concepts.hpp:245:14: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 245 | BOOST_CONCEPT_USAGE(RandomAccessIteratorConcept) | ^~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::SinglePassRangeConcept >]’: /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements > >]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/range/concepts.hpp:284:9: required from ‘struct boost::SinglePassRangeConcept >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::SinglePassRangeConcept >]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied > >::value’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied > >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:72:8: [ skipping 4 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/isomorphism.hpp:651:42: required from ‘bool boost::graph::detail::isomorphism_impl::operator()(const Graph1&, const Graph2&, const ArgPack&) const [with ArgPack = boost::parameter::aux::empty_arg_list; Graph1 = boost::adjacency_list; Graph2 = boost::adjacency_list]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/isomorphism.hpp:662:5: required from ‘typename boost::result_of(Param0, Param1, const ArgPack&)>::type boost::graph::isomorphism_with_named_params(const Param0&, const Param1&, const ArgPack&) [with Param0 = boost::adjacency_list; Param1 = boost::adjacency_list; ArgPack = boost::parameter::aux::empty_arg_list; typename boost::result_of(Param0, Param1, const ArgPack&)>::type = bool]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/isomorphism.hpp:666:1: required from ‘typename boost::result_of(Param0, Param1, const boost::parameter::aux::empty_arg_list&)>::type boost::isomorphism(const Param0&, const Param1&) [with Param0 = adjacency_list; Param1 = adjacency_list; typename result_of(Param0, Param1, const parameter::aux::empty_arg_list&)>::type = bool]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/is_kuratowski_subgraph.hpp:278:34: required from ‘bool boost::is_kuratowski_subgraph(const Graph&, ForwardIterator, ForwardIterator, VertexIndexMap) [with Graph = adjacency_list, property >; ForwardIterator = __gnu_cxx::__normal_iterator*, std::vector > >; VertexIndexMap = vec_adj_list_vertex_id_map, long unsigned int>]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/is_kuratowski_subgraph.hpp:290:34: required from ‘bool boost::is_kuratowski_subgraph(const Graph&, ForwardIterator, ForwardIterator) [with Graph = adjacency_list, property >; ForwardIterator = __gnu_cxx::__normal_iterator*, std::vector > >]’ planar.cpp:435:37: required from here /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::SinglePassRangeConcept::~SinglePassRangeConcept() [with T = const std::vector]’ 37 | ~model() | ^ /home/omnipath/local/R/4.4-3.20/BH/include/boost/range/concepts.hpp:284:9: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 284 | BOOST_CONCEPT_USAGE(SinglePassRangeConcept) | ^~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements > >]’: /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/graph_concepts.hpp:87:5: required from ‘struct boost::concepts::IncidenceGraph >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/graph_concepts.hpp:75:1: required from ‘struct boost::concepts::IncidenceGraphConcept >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::concepts::IncidenceGraphConcept >]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied > >::value’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied > >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:72:8: [ skipping 5 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/isomorphism.hpp:651:42: required from ‘bool boost::graph::detail::isomorphism_impl::operator()(const Graph1&, const Graph2&, const ArgPack&) const [with ArgPack = boost::parameter::aux::empty_arg_list; Graph1 = boost::adjacency_list; Graph2 = boost::adjacency_list]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/isomorphism.hpp:662:5: required from ‘typename boost::result_of(Param0, Param1, const ArgPack&)>::type boost::graph::isomorphism_with_named_params(const Param0&, const Param1&, const ArgPack&) [with Param0 = boost::adjacency_list; Param1 = boost::adjacency_list; ArgPack = boost::parameter::aux::empty_arg_list; typename boost::result_of(Param0, Param1, const ArgPack&)>::type = bool]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/isomorphism.hpp:666:1: required from ‘typename boost::result_of(Param0, Param1, const boost::parameter::aux::empty_arg_list&)>::type boost::isomorphism(const Param0&, const Param1&) [with Param0 = adjacency_list; Param1 = adjacency_list; typename result_of(Param0, Param1, const parameter::aux::empty_arg_list&)>::type = bool]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/is_kuratowski_subgraph.hpp:278:34: required from ‘bool boost::is_kuratowski_subgraph(const Graph&, ForwardIterator, ForwardIterator, VertexIndexMap) [with Graph = adjacency_list, property >; ForwardIterator = __gnu_cxx::__normal_iterator*, std::vector > >; VertexIndexMap = vec_adj_list_vertex_id_map, long unsigned int>]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/is_kuratowski_subgraph.hpp:290:34: required from ‘bool boost::is_kuratowski_subgraph(const Graph&, ForwardIterator, ForwardIterator) [with Graph = adjacency_list, property >; ForwardIterator = __gnu_cxx::__normal_iterator*, std::vector > >]’ planar.cpp:435:37: required from here /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::concepts::IncidenceGraph >]’ 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ^ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::IncidenceGraphConcept >]’: /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/depth_first_search.hpp:129:9: required from ‘void boost::detail::depth_first_visit_impl(const IncidenceGraph&, typename boost::graph_traits::vertex_descriptor, DFSVisitor&, ColorMap, TerminatorFunc) [with IncidenceGraph = boost::adjacency_list; DFSVisitor = isomorphism_algo, boost::adjacency_list, boost::shared_array_property_map >, boost::degree_vertex_invariant >, boost::adjacency_list >, boost::degree_vertex_invariant >, boost::adjacency_list >, boost::vec_adj_list_vertex_id_map, boost::vec_adj_list_vertex_id_map >::record_dfs_order; ColorMap = boost::safe_iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map, boost::default_color_type, boost::default_color_type&>; TerminatorFunc = nontruth2; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/depth_first_search.hpp:417:35: required from ‘void boost::depth_first_visit(const IncidenceGraph&, typename graph_traits::vertex_descriptor, DFSVisitor, ColorMap) [with IncidenceGraph = adjacency_list; DFSVisitor = detail::isomorphism_algo, adjacency_list, shared_array_property_map >, degree_vertex_invariant >, adjacency_list >, degree_vertex_invariant >, adjacency_list >, vec_adj_list_vertex_id_map, vec_adj_list_vertex_id_map >::record_dfs_order; ColorMap = safe_iterator_property_map<__gnu_cxx::__normal_iterator >, vec_adj_list_vertex_id_map, default_color_type, default_color_type&>; typename graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/isomorphism.hpp:209:38: required from ‘bool boost::detail::isomorphism_algo::test_isomorphism() [with Graph1 = boost::adjacency_list; Graph2 = boost::adjacency_list; IsoMapping = boost::shared_array_property_map >; Invariant1 = boost::degree_vertex_invariant >, boost::adjacency_list >; Invariant2 = boost::degree_vertex_invariant >, boost::adjacency_list >; IndexMap1 = boost::vec_adj_list_vertex_id_map; IndexMap2 = boost::vec_adj_list_vertex_id_map]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/isomorphism.hpp:532:33: required from ‘bool boost::isomorphism(const Graph1&, const Graph2&, IsoMapping, Invariant1, Invariant2, std::size_t, IndexMap1, IndexMap2) [with Graph1 = adjacency_list; Graph2 = adjacency_list; IsoMapping = shared_array_property_map >; Invariant1 = degree_vertex_invariant >, adjacency_list >; Invariant2 = degree_vertex_invariant >, adjacency_list >; IndexMap1 = vec_adj_list_vertex_id_map; IndexMap2 = vec_adj_list_vertex_id_map; std::size_t = long unsigned int]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/isomorphism.hpp:651:42: required from ‘bool boost::graph::detail::isomorphism_impl::operator()(const Graph1&, const Graph2&, const ArgPack&) const [with ArgPack = boost::parameter::aux::empty_arg_list; Graph1 = boost::adjacency_list; Graph2 = boost::adjacency_list]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/isomorphism.hpp:662:5: required from ‘typename boost::result_of(Param0, Param1, const ArgPack&)>::type boost::graph::isomorphism_with_named_params(const Param0&, const Param1&, const ArgPack&) [with Param0 = boost::adjacency_list; Param1 = boost::adjacency_list; ArgPack = boost::parameter::aux::empty_arg_list; typename boost::result_of(Param0, Param1, const ArgPack&)>::type = bool]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/isomorphism.hpp:666:1: required from ‘typename boost::result_of(Param0, Param1, const boost::parameter::aux::empty_arg_list&)>::type boost::isomorphism(const Param0&, const Param1&) [with Param0 = adjacency_list; Param1 = adjacency_list; typename result_of(Param0, Param1, const parameter::aux::empty_arg_list&)>::type = bool]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/is_kuratowski_subgraph.hpp:278:34: required from ‘bool boost::is_kuratowski_subgraph(const Graph&, ForwardIterator, ForwardIterator, VertexIndexMap) [with Graph = adjacency_list, property >; ForwardIterator = __gnu_cxx::__normal_iterator*, std::vector > >; VertexIndexMap = vec_adj_list_vertex_id_map, long unsigned int>]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/is_kuratowski_subgraph.hpp:290:34: required from ‘bool boost::is_kuratowski_subgraph(const Graph&, ForwardIterator, ForwardIterator) [with Graph = adjacency_list, property >; ForwardIterator = __gnu_cxx::__normal_iterator*, std::vector > >]’ planar.cpp:435:37: required from here /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/graph_concepts.hpp:75:15: note: in a call to non-static member function ‘boost::concepts::IncidenceGraphConcept >::~IncidenceGraphConcept()’ 75 | BOOST_concept(IncidenceGraph, (G)) : Graph< G > | ^~~~~~~~~~~~~~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/preprocessor/cat.hpp:29:34: note: in definition of macro ‘BOOST_PP_CAT_I’ 29 | # define BOOST_PP_CAT_I(a, b) a ## b | ^ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/concept_def.hpp:23:12: note: in expansion of macro ‘BOOST_PP_CAT’ 23 | struct BOOST_PP_CAT(name,Concept) \ | ^~~~~~~~~~~~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/graph_concepts.hpp:75:1: note: in expansion of macro ‘BOOST_concept’ 75 | BOOST_concept(IncidenceGraph, (G)) : Graph< G > | ^~~~~~~~~~~~~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::constraint::failed() [with Model = boost::DFSVisitorConcept, boost::adjacency_list, boost::shared_array_property_map >, boost::degree_vertex_invariant >, boost::adjacency_list >, boost::degree_vertex_invariant >, boost::adjacency_list >, boost::vec_adj_list_vertex_id_map, boost::vec_adj_list_vertex_id_map >::record_dfs_order, boost::adjacency_list >]’: /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/depth_first_search.hpp:130:9: required from ‘void boost::detail::depth_first_visit_impl(const IncidenceGraph&, typename boost::graph_traits::vertex_descriptor, DFSVisitor&, ColorMap, TerminatorFunc) [with IncidenceGraph = boost::adjacency_list; DFSVisitor = isomorphism_algo, boost::adjacency_list, boost::shared_array_property_map >, boost::degree_vertex_invariant >, boost::adjacency_list >, boost::degree_vertex_invariant >, boost::adjacency_list >, boost::vec_adj_list_vertex_id_map, boost::vec_adj_list_vertex_id_map >::record_dfs_order; ColorMap = boost::safe_iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map, boost::default_color_type, boost::default_color_type&>; TerminatorFunc = nontruth2; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/depth_first_search.hpp:417:35: required from ‘void boost::depth_first_visit(const IncidenceGraph&, typename graph_traits::vertex_descriptor, DFSVisitor, ColorMap) [with IncidenceGraph = adjacency_list; DFSVisitor = detail::isomorphism_algo, adjacency_list, shared_array_property_map >, degree_vertex_invariant >, adjacency_list >, degree_vertex_invariant >, adjacency_list >, vec_adj_list_vertex_id_map, vec_adj_list_vertex_id_map >::record_dfs_order; ColorMap = safe_iterator_property_map<__gnu_cxx::__normal_iterator >, vec_adj_list_vertex_id_map, default_color_type, default_color_type&>; typename graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/isomorphism.hpp:209:38: required from ‘bool boost::detail::isomorphism_algo::test_isomorphism() [with Graph1 = boost::adjacency_list; Graph2 = boost::adjacency_list; IsoMapping = boost::shared_array_property_map >; Invariant1 = boost::degree_vertex_invariant >, boost::adjacency_list >; Invariant2 = boost::degree_vertex_invariant >, boost::adjacency_list >; IndexMap1 = boost::vec_adj_list_vertex_id_map; IndexMap2 = boost::vec_adj_list_vertex_id_map]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/isomorphism.hpp:532:33: required from ‘bool boost::isomorphism(const Graph1&, const Graph2&, IsoMapping, Invariant1, Invariant2, std::size_t, IndexMap1, IndexMap2) [with Graph1 = adjacency_list; Graph2 = adjacency_list; IsoMapping = shared_array_property_map >; Invariant1 = degree_vertex_invariant >, adjacency_list >; Invariant2 = degree_vertex_invariant >, adjacency_list >; IndexMap1 = vec_adj_list_vertex_id_map; IndexMap2 = vec_adj_list_vertex_id_map; std::size_t = long unsigned int]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/isomorphism.hpp:651:42: required from ‘bool boost::graph::detail::isomorphism_impl::operator()(const Graph1&, const Graph2&, const ArgPack&) const [with ArgPack = boost::parameter::aux::empty_arg_list; Graph1 = boost::adjacency_list; Graph2 = boost::adjacency_list]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/isomorphism.hpp:662:5: required from ‘typename boost::result_of(Param0, Param1, const ArgPack&)>::type boost::graph::isomorphism_with_named_params(const Param0&, const Param1&, const ArgPack&) [with Param0 = boost::adjacency_list; Param1 = boost::adjacency_list; ArgPack = boost::parameter::aux::empty_arg_list; typename boost::result_of(Param0, Param1, const ArgPack&)>::type = bool]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/isomorphism.hpp:666:1: required from ‘typename boost::result_of(Param0, Param1, const boost::parameter::aux::empty_arg_list&)>::type boost::isomorphism(const Param0&, const Param1&) [with Param0 = adjacency_list; Param1 = adjacency_list; typename result_of(Param0, Param1, const parameter::aux::empty_arg_list&)>::type = bool]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/is_kuratowski_subgraph.hpp:278:34: required from ‘bool boost::is_kuratowski_subgraph(const Graph&, ForwardIterator, ForwardIterator, VertexIndexMap) [with Graph = adjacency_list, property >; ForwardIterator = __gnu_cxx::__normal_iterator*, std::vector > >; VertexIndexMap = vec_adj_list_vertex_id_map, long unsigned int>]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/is_kuratowski_subgraph.hpp:290:34: required from ‘bool boost::is_kuratowski_subgraph(const Graph&, ForwardIterator, ForwardIterator) [with Graph = adjacency_list, property >; ForwardIterator = __gnu_cxx::__normal_iterator*, std::vector > >]’ planar.cpp:435:37: required from here /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:65:52: warning: ‘this’ pointer is null [-Wnonnull] 65 | static void failed() { ((Model*)0)->constraints(); } | ~~~~~~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/depth_first_search.hpp:39:10: note: in a call to non-static member function ‘void boost::DFSVisitorConcept::constraints() [with Visitor = boost::detail::isomorphism_algo, boost::adjacency_list, boost::shared_array_property_map >, boost::degree_vertex_invariant >, boost::adjacency_list >, boost::degree_vertex_invariant >, boost::adjacency_list >, boost::vec_adj_list_vertex_id_map, boost::vec_adj_list_vertex_id_map >::record_dfs_order; Graph = boost::adjacency_list]’ 39 | void constraints() | ^~~~~~~~~~~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::constraint::failed() [with Model = boost::ReadWritePropertyMapConcept >, boost::vec_adj_list_vertex_id_map, boost::default_color_type, boost::default_color_type&>, long unsigned int>]’: /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/depth_first_search.hpp:134:9: required from ‘void boost::detail::depth_first_visit_impl(const IncidenceGraph&, typename boost::graph_traits::vertex_descriptor, DFSVisitor&, ColorMap, TerminatorFunc) [with IncidenceGraph = boost::adjacency_list; DFSVisitor = isomorphism_algo, boost::adjacency_list, boost::shared_array_property_map >, boost::degree_vertex_invariant >, boost::adjacency_list >, boost::degree_vertex_invariant >, boost::adjacency_list >, boost::vec_adj_list_vertex_id_map, boost::vec_adj_list_vertex_id_map >::record_dfs_order; ColorMap = boost::safe_iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map, boost::default_color_type, boost::default_color_type&>; TerminatorFunc = nontruth2; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/depth_first_search.hpp:417:35: required from ‘void boost::depth_first_visit(const IncidenceGraph&, typename graph_traits::vertex_descriptor, DFSVisitor, ColorMap) [with IncidenceGraph = adjacency_list; DFSVisitor = detail::isomorphism_algo, adjacency_list, shared_array_property_map >, degree_vertex_invariant >, adjacency_list >, degree_vertex_invariant >, adjacency_list >, vec_adj_list_vertex_id_map, vec_adj_list_vertex_id_map >::record_dfs_order; ColorMap = safe_iterator_property_map<__gnu_cxx::__normal_iterator >, vec_adj_list_vertex_id_map, default_color_type, default_color_type&>; typename graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/isomorphism.hpp:209:38: required from ‘bool boost::detail::isomorphism_algo::test_isomorphism() [with Graph1 = boost::adjacency_list; Graph2 = boost::adjacency_list; IsoMapping = boost::shared_array_property_map >; Invariant1 = boost::degree_vertex_invariant >, boost::adjacency_list >; Invariant2 = boost::degree_vertex_invariant >, boost::adjacency_list >; IndexMap1 = boost::vec_adj_list_vertex_id_map; IndexMap2 = boost::vec_adj_list_vertex_id_map]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/isomorphism.hpp:532:33: required from ‘bool boost::isomorphism(const Graph1&, const Graph2&, IsoMapping, Invariant1, Invariant2, std::size_t, IndexMap1, IndexMap2) [with Graph1 = adjacency_list; Graph2 = adjacency_list; IsoMapping = shared_array_property_map >; Invariant1 = degree_vertex_invariant >, adjacency_list >; Invariant2 = degree_vertex_invariant >, adjacency_list >; IndexMap1 = vec_adj_list_vertex_id_map; IndexMap2 = vec_adj_list_vertex_id_map; std::size_t = long unsigned int]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/isomorphism.hpp:651:42: required from ‘bool boost::graph::detail::isomorphism_impl::operator()(const Graph1&, const Graph2&, const ArgPack&) const [with ArgPack = boost::parameter::aux::empty_arg_list; Graph1 = boost::adjacency_list; Graph2 = boost::adjacency_list]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/isomorphism.hpp:662:5: required from ‘typename boost::result_of(Param0, Param1, const ArgPack&)>::type boost::graph::isomorphism_with_named_params(const Param0&, const Param1&, const ArgPack&) [with Param0 = boost::adjacency_list; Param1 = boost::adjacency_list; ArgPack = boost::parameter::aux::empty_arg_list; typename boost::result_of(Param0, Param1, const ArgPack&)>::type = bool]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/isomorphism.hpp:666:1: required from ‘typename boost::result_of(Param0, Param1, const boost::parameter::aux::empty_arg_list&)>::type boost::isomorphism(const Param0&, const Param1&) [with Param0 = adjacency_list; Param1 = adjacency_list; typename result_of(Param0, Param1, const parameter::aux::empty_arg_list&)>::type = bool]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/is_kuratowski_subgraph.hpp:278:34: required from ‘bool boost::is_kuratowski_subgraph(const Graph&, ForwardIterator, ForwardIterator, VertexIndexMap) [with Graph = adjacency_list, property >; ForwardIterator = __gnu_cxx::__normal_iterator*, std::vector > >; VertexIndexMap = vec_adj_list_vertex_id_map, long unsigned int>]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/is_kuratowski_subgraph.hpp:290:34: required from ‘bool boost::is_kuratowski_subgraph(const Graph&, ForwardIterator, ForwardIterator) [with Graph = adjacency_list, property >; ForwardIterator = __gnu_cxx::__normal_iterator*, std::vector > >]’ planar.cpp:435:37: required from here /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:65:52: warning: ‘this’ pointer is null [-Wnonnull] 65 | static void failed() { ((Model*)0)->constraints(); } | ~~~~~~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/property_map/property_map.hpp:205:10: note: in a call to non-static member function ‘void boost::ReadWritePropertyMapConcept::constraints() [with PMap = boost::safe_iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map, boost::default_color_type, boost::default_color_type&>; Key = long unsigned int]’ 205 | void constraints() { | ^~~~~~~~~~~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::Assignable<__gnu_cxx::__normal_iterator > >]’: /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements > > >]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:145:5: required from ‘struct boost::Assignable<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:502:3: required from ‘struct boost::InputIterator<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:540:3: required from ‘struct boost::ForwardIterator<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:568:3: required from ‘struct boost::BidirectionalIterator<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:597:3: [ skipping 9 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/isomorphism.hpp:651:42: required from ‘bool boost::graph::detail::isomorphism_impl::operator()(const Graph1&, const Graph2&, const ArgPack&) const [with ArgPack = boost::parameter::aux::empty_arg_list; Graph1 = boost::adjacency_list; Graph2 = boost::adjacency_list]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/isomorphism.hpp:662:5: required from ‘typename boost::result_of(Param0, Param1, const ArgPack&)>::type boost::graph::isomorphism_with_named_params(const Param0&, const Param1&, const ArgPack&) [with Param0 = boost::adjacency_list; Param1 = boost::adjacency_list; ArgPack = boost::parameter::aux::empty_arg_list; typename boost::result_of(Param0, Param1, const ArgPack&)>::type = bool]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/isomorphism.hpp:666:1: required from ‘typename boost::result_of(Param0, Param1, const boost::parameter::aux::empty_arg_list&)>::type boost::isomorphism(const Param0&, const Param1&) [with Param0 = adjacency_list; Param1 = adjacency_list; typename result_of(Param0, Param1, const parameter::aux::empty_arg_list&)>::type = bool]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/is_kuratowski_subgraph.hpp:278:34: required from ‘bool boost::is_kuratowski_subgraph(const Graph&, ForwardIterator, ForwardIterator, VertexIndexMap) [with Graph = adjacency_list, property >; ForwardIterator = __gnu_cxx::__normal_iterator*, std::vector > >; VertexIndexMap = vec_adj_list_vertex_id_map, long unsigned int>]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/is_kuratowski_subgraph.hpp:290:34: required from ‘bool boost::is_kuratowski_subgraph(const Graph&, ForwardIterator, ForwardIterator) [with Graph = adjacency_list, property >; ForwardIterator = __gnu_cxx::__normal_iterator*, std::vector > >]’ planar.cpp:435:37: required from here /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::Assignable::~Assignable() [with TT = __gnu_cxx::__normal_iterator >]’ 37 | ~model() | ^ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:145:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 145 | BOOST_CONCEPT_USAGE(Assignable) { | ^~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::EqualityComparable<__gnu_cxx::__normal_iterator > >]’: /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements > > >]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:233:5: required from ‘struct boost::EqualityComparable<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:502:3: required from ‘struct boost::InputIterator<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:540:3: required from ‘struct boost::ForwardIterator<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:568:3: required from ‘struct boost::BidirectionalIterator<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:597:3: [ skipping 9 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/isomorphism.hpp:651:42: required from ‘bool boost::graph::detail::isomorphism_impl::operator()(const Graph1&, const Graph2&, const ArgPack&) const [with ArgPack = boost::parameter::aux::empty_arg_list; Graph1 = boost::adjacency_list; Graph2 = boost::adjacency_list]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/isomorphism.hpp:662:5: required from ‘typename boost::result_of(Param0, Param1, const ArgPack&)>::type boost::graph::isomorphism_with_named_params(const Param0&, const Param1&, const ArgPack&) [with Param0 = boost::adjacency_list; Param1 = boost::adjacency_list; ArgPack = boost::parameter::aux::empty_arg_list; typename boost::result_of(Param0, Param1, const ArgPack&)>::type = bool]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/isomorphism.hpp:666:1: required from ‘typename boost::result_of(Param0, Param1, const boost::parameter::aux::empty_arg_list&)>::type boost::isomorphism(const Param0&, const Param1&) [with Param0 = adjacency_list; Param1 = adjacency_list; typename result_of(Param0, Param1, const parameter::aux::empty_arg_list&)>::type = bool]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/is_kuratowski_subgraph.hpp:278:34: required from ‘bool boost::is_kuratowski_subgraph(const Graph&, ForwardIterator, ForwardIterator, VertexIndexMap) [with Graph = adjacency_list, property >; ForwardIterator = __gnu_cxx::__normal_iterator*, std::vector > >; VertexIndexMap = vec_adj_list_vertex_id_map, long unsigned int>]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/is_kuratowski_subgraph.hpp:290:34: required from ‘bool boost::is_kuratowski_subgraph(const Graph&, ForwardIterator, ForwardIterator) [with Graph = adjacency_list, property >; ForwardIterator = __gnu_cxx::__normal_iterator*, std::vector > >]’ planar.cpp:435:37: required from here /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::EqualityComparable::~EqualityComparable() [with TT = __gnu_cxx::__normal_iterator >]’ 37 | ~model() | ^ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:233:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 233 | BOOST_CONCEPT_USAGE(EqualityComparable) { | ^~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::InputIterator<__gnu_cxx::__normal_iterator > >]’: /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements > > >]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:512:7: required from ‘struct boost::InputIterator<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:540:3: required from ‘struct boost::ForwardIterator<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:568:3: required from ‘struct boost::BidirectionalIterator<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:597:3: required from ‘struct boost::RandomAccessIterator<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:597:3: [ skipping 8 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/isomorphism.hpp:651:42: required from ‘bool boost::graph::detail::isomorphism_impl::operator()(const Graph1&, const Graph2&, const ArgPack&) const [with ArgPack = boost::parameter::aux::empty_arg_list; Graph1 = boost::adjacency_list; Graph2 = boost::adjacency_list]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/isomorphism.hpp:662:5: required from ‘typename boost::result_of(Param0, Param1, const ArgPack&)>::type boost::graph::isomorphism_with_named_params(const Param0&, const Param1&, const ArgPack&) [with Param0 = boost::adjacency_list; Param1 = boost::adjacency_list; ArgPack = boost::parameter::aux::empty_arg_list; typename boost::result_of(Param0, Param1, const ArgPack&)>::type = bool]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/isomorphism.hpp:666:1: required from ‘typename boost::result_of(Param0, Param1, const boost::parameter::aux::empty_arg_list&)>::type boost::isomorphism(const Param0&, const Param1&) [with Param0 = adjacency_list; Param1 = adjacency_list; typename result_of(Param0, Param1, const parameter::aux::empty_arg_list&)>::type = bool]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/is_kuratowski_subgraph.hpp:278:34: required from ‘bool boost::is_kuratowski_subgraph(const Graph&, ForwardIterator, ForwardIterator, VertexIndexMap) [with Graph = adjacency_list, property >; ForwardIterator = __gnu_cxx::__normal_iterator*, std::vector > >; VertexIndexMap = vec_adj_list_vertex_id_map, long unsigned int>]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/is_kuratowski_subgraph.hpp:290:34: required from ‘bool boost::is_kuratowski_subgraph(const Graph&, ForwardIterator, ForwardIterator) [with Graph = adjacency_list, property >; ForwardIterator = __gnu_cxx::__normal_iterator*, std::vector > >]’ planar.cpp:435:37: required from here /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::InputIterator::~InputIterator() [with TT = __gnu_cxx::__normal_iterator >]’ 37 | ~model() | ^ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:512:7: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 512 | BOOST_CONCEPT_USAGE(InputIterator) | ^~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::ForwardIterator<__gnu_cxx::__normal_iterator > >]’: /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements > > >]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:543:7: required from ‘struct boost::ForwardIterator<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:568:3: required from ‘struct boost::BidirectionalIterator<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:597:3: required from ‘struct boost::RandomAccessIterator<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:597:3: required from ‘struct boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:32:62: [ skipping 7 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/isomorphism.hpp:651:42: required from ‘bool boost::graph::detail::isomorphism_impl::operator()(const Graph1&, const Graph2&, const ArgPack&) const [with ArgPack = boost::parameter::aux::empty_arg_list; Graph1 = boost::adjacency_list; Graph2 = boost::adjacency_list]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/isomorphism.hpp:662:5: required from ‘typename boost::result_of(Param0, Param1, const ArgPack&)>::type boost::graph::isomorphism_with_named_params(const Param0&, const Param1&, const ArgPack&) [with Param0 = boost::adjacency_list; Param1 = boost::adjacency_list; ArgPack = boost::parameter::aux::empty_arg_list; typename boost::result_of(Param0, Param1, const ArgPack&)>::type = bool]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/isomorphism.hpp:666:1: required from ‘typename boost::result_of(Param0, Param1, const boost::parameter::aux::empty_arg_list&)>::type boost::isomorphism(const Param0&, const Param1&) [with Param0 = adjacency_list; Param1 = adjacency_list; typename result_of(Param0, Param1, const parameter::aux::empty_arg_list&)>::type = bool]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/is_kuratowski_subgraph.hpp:278:34: required from ‘bool boost::is_kuratowski_subgraph(const Graph&, ForwardIterator, ForwardIterator, VertexIndexMap) [with Graph = adjacency_list, property >; ForwardIterator = __gnu_cxx::__normal_iterator*, std::vector > >; VertexIndexMap = vec_adj_list_vertex_id_map, long unsigned int>]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/is_kuratowski_subgraph.hpp:290:34: required from ‘bool boost::is_kuratowski_subgraph(const Graph&, ForwardIterator, ForwardIterator) [with Graph = adjacency_list, property >; ForwardIterator = __gnu_cxx::__normal_iterator*, std::vector > >]’ planar.cpp:435:37: required from here /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::ForwardIterator::~ForwardIterator() [with TT = __gnu_cxx::__normal_iterator >]’ 37 | ~model() | ^ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:543:7: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 543 | BOOST_CONCEPT_USAGE(ForwardIterator) | ^~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::BidirectionalIterator<__gnu_cxx::__normal_iterator > >]’: /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements > > >]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:571:7: required from ‘struct boost::BidirectionalIterator<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:597:3: required from ‘struct boost::RandomAccessIterator<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:597:3: required from ‘struct boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator > >]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:42:5: [ skipping 6 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/isomorphism.hpp:651:42: required from ‘bool boost::graph::detail::isomorphism_impl::operator()(const Graph1&, const Graph2&, const ArgPack&) const [with ArgPack = boost::parameter::aux::empty_arg_list; Graph1 = boost::adjacency_list; Graph2 = boost::adjacency_list]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/isomorphism.hpp:662:5: required from ‘typename boost::result_of(Param0, Param1, const ArgPack&)>::type boost::graph::isomorphism_with_named_params(const Param0&, const Param1&, const ArgPack&) [with Param0 = boost::adjacency_list; Param1 = boost::adjacency_list; ArgPack = boost::parameter::aux::empty_arg_list; typename boost::result_of(Param0, Param1, const ArgPack&)>::type = bool]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/isomorphism.hpp:666:1: required from ‘typename boost::result_of(Param0, Param1, const boost::parameter::aux::empty_arg_list&)>::type boost::isomorphism(const Param0&, const Param1&) [with Param0 = adjacency_list; Param1 = adjacency_list; typename result_of(Param0, Param1, const parameter::aux::empty_arg_list&)>::type = bool]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/is_kuratowski_subgraph.hpp:278:34: required from ‘bool boost::is_kuratowski_subgraph(const Graph&, ForwardIterator, ForwardIterator, VertexIndexMap) [with Graph = adjacency_list, property >; ForwardIterator = __gnu_cxx::__normal_iterator*, std::vector > >; VertexIndexMap = vec_adj_list_vertex_id_map, long unsigned int>]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/is_kuratowski_subgraph.hpp:290:34: required from ‘bool boost::is_kuratowski_subgraph(const Graph&, ForwardIterator, ForwardIterator) [with Graph = adjacency_list, property >; ForwardIterator = __gnu_cxx::__normal_iterator*, std::vector > >]’ planar.cpp:435:37: required from here /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::BidirectionalIterator::~BidirectionalIterator() [with TT = __gnu_cxx::__normal_iterator >]’ 37 | ~model() | ^ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:571:7: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 571 | BOOST_CONCEPT_USAGE(BidirectionalIterator) | ^~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::Comparable<__gnu_cxx::__normal_iterator > >]’: /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements > > >]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:253:5: required from ‘struct boost::Comparable<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:597:3: required from ‘struct boost::RandomAccessIterator<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:597:3: required from ‘struct boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator > >]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:42:5: [ skipping 6 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/isomorphism.hpp:651:42: required from ‘bool boost::graph::detail::isomorphism_impl::operator()(const Graph1&, const Graph2&, const ArgPack&) const [with ArgPack = boost::parameter::aux::empty_arg_list; Graph1 = boost::adjacency_list; Graph2 = boost::adjacency_list]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/isomorphism.hpp:662:5: required from ‘typename boost::result_of(Param0, Param1, const ArgPack&)>::type boost::graph::isomorphism_with_named_params(const Param0&, const Param1&, const ArgPack&) [with Param0 = boost::adjacency_list; Param1 = boost::adjacency_list; ArgPack = boost::parameter::aux::empty_arg_list; typename boost::result_of(Param0, Param1, const ArgPack&)>::type = bool]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/isomorphism.hpp:666:1: required from ‘typename boost::result_of(Param0, Param1, const boost::parameter::aux::empty_arg_list&)>::type boost::isomorphism(const Param0&, const Param1&) [with Param0 = adjacency_list; Param1 = adjacency_list; typename result_of(Param0, Param1, const parameter::aux::empty_arg_list&)>::type = bool]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/is_kuratowski_subgraph.hpp:278:34: required from ‘bool boost::is_kuratowski_subgraph(const Graph&, ForwardIterator, ForwardIterator, VertexIndexMap) [with Graph = adjacency_list, property >; ForwardIterator = __gnu_cxx::__normal_iterator*, std::vector > >; VertexIndexMap = vec_adj_list_vertex_id_map, long unsigned int>]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/is_kuratowski_subgraph.hpp:290:34: required from ‘bool boost::is_kuratowski_subgraph(const Graph&, ForwardIterator, ForwardIterator) [with Graph = adjacency_list, property >; ForwardIterator = __gnu_cxx::__normal_iterator*, std::vector > >]’ planar.cpp:435:37: required from here /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::Comparable::~Comparable() [with TT = __gnu_cxx::__normal_iterator >]’ 37 | ~model() | ^ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:253:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 253 | BOOST_CONCEPT_USAGE(Comparable) { | ^~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::RandomAccessIterator<__gnu_cxx::__normal_iterator > >]’: /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements > > >]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:601:7: required from ‘struct boost::RandomAccessIterator<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:597:3: required from ‘struct boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator > >]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied > > >::value’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:45:51: [ skipping 5 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/isomorphism.hpp:651:42: required from ‘bool boost::graph::detail::isomorphism_impl::operator()(const Graph1&, const Graph2&, const ArgPack&) const [with ArgPack = boost::parameter::aux::empty_arg_list; Graph1 = boost::adjacency_list; Graph2 = boost::adjacency_list]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/isomorphism.hpp:662:5: required from ‘typename boost::result_of(Param0, Param1, const ArgPack&)>::type boost::graph::isomorphism_with_named_params(const Param0&, const Param1&, const ArgPack&) [with Param0 = boost::adjacency_list; Param1 = boost::adjacency_list; ArgPack = boost::parameter::aux::empty_arg_list; typename boost::result_of(Param0, Param1, const ArgPack&)>::type = bool]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/isomorphism.hpp:666:1: required from ‘typename boost::result_of(Param0, Param1, const boost::parameter::aux::empty_arg_list&)>::type boost::isomorphism(const Param0&, const Param1&) [with Param0 = adjacency_list; Param1 = adjacency_list; typename result_of(Param0, Param1, const parameter::aux::empty_arg_list&)>::type = bool]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/is_kuratowski_subgraph.hpp:278:34: required from ‘bool boost::is_kuratowski_subgraph(const Graph&, ForwardIterator, ForwardIterator, VertexIndexMap) [with Graph = adjacency_list, property >; ForwardIterator = __gnu_cxx::__normal_iterator*, std::vector > >; VertexIndexMap = vec_adj_list_vertex_id_map, long unsigned int>]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/is_kuratowski_subgraph.hpp:290:34: required from ‘bool boost::is_kuratowski_subgraph(const Graph&, ForwardIterator, ForwardIterator) [with Graph = adjacency_list, property >; ForwardIterator = __gnu_cxx::__normal_iterator*, std::vector > >]’ planar.cpp:435:37: required from here /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::RandomAccessIterator::~RandomAccessIterator() [with TT = __gnu_cxx::__normal_iterator >]’ 37 | ~model() | ^ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:601:7: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 601 | BOOST_CONCEPT_USAGE(RandomAccessIterator) | ^~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::CopyConstructible<__gnu_cxx::__normal_iterator*, std::vector > > >]’: /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements*, std::vector > > > >]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:167:5: required from ‘struct boost::CopyConstructible<__gnu_cxx::__normal_iterator*, std::vector > > >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/range/concepts.hpp:125:16: required from ‘struct boost::range_detail::IncrementableIteratorConcept<__gnu_cxx::__normal_iterator*, std::vector > > >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/range/concepts.hpp:147:16: required from ‘struct boost::range_detail::SinglePassIteratorConcept<__gnu_cxx::__normal_iterator*, std::vector > > >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::range_detail::SinglePassIteratorConcept<__gnu_cxx::__normal_iterator*, std::vector > > >]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:42:5: [ skipping 14 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/isomorphism.hpp:651:42: required from ‘bool boost::graph::detail::isomorphism_impl::operator()(const Graph1&, const Graph2&, const ArgPack&) const [with ArgPack = boost::parameter::aux::empty_arg_list; Graph1 = boost::adjacency_list; Graph2 = boost::adjacency_list]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/isomorphism.hpp:662:5: required from ‘typename boost::result_of(Param0, Param1, const ArgPack&)>::type boost::graph::isomorphism_with_named_params(const Param0&, const Param1&, const ArgPack&) [with Param0 = boost::adjacency_list; Param1 = boost::adjacency_list; ArgPack = boost::parameter::aux::empty_arg_list; typename boost::result_of(Param0, Param1, const ArgPack&)>::type = bool]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/isomorphism.hpp:666:1: required from ‘typename boost::result_of(Param0, Param1, const boost::parameter::aux::empty_arg_list&)>::type boost::isomorphism(const Param0&, const Param1&) [with Param0 = adjacency_list; Param1 = adjacency_list; typename result_of(Param0, Param1, const parameter::aux::empty_arg_list&)>::type = bool]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/is_kuratowski_subgraph.hpp:278:34: required from ‘bool boost::is_kuratowski_subgraph(const Graph&, ForwardIterator, ForwardIterator, VertexIndexMap) [with Graph = adjacency_list, property >; ForwardIterator = __gnu_cxx::__normal_iterator*, std::vector > >; VertexIndexMap = vec_adj_list_vertex_id_map, long unsigned int>]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/is_kuratowski_subgraph.hpp:290:34: required from ‘bool boost::is_kuratowski_subgraph(const Graph&, ForwardIterator, ForwardIterator) [with Graph = adjacency_list, property >; ForwardIterator = __gnu_cxx::__normal_iterator*, std::vector > >]’ planar.cpp:435:37: required from here /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::CopyConstructible::~CopyConstructible() [with TT = __gnu_cxx::__normal_iterator*, std::vector > >]’ 37 | ~model() | ^ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:167:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 167 | BOOST_CONCEPT_USAGE(CopyConstructible) { | ^~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::range_detail::IncrementableIteratorConcept<__gnu_cxx::__normal_iterator*, std::vector > > >]’: /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements*, std::vector > > > >]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/range/concepts.hpp:136:13: required from ‘struct boost::range_detail::IncrementableIteratorConcept<__gnu_cxx::__normal_iterator*, std::vector > > >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/range/concepts.hpp:147:16: required from ‘struct boost::range_detail::SinglePassIteratorConcept<__gnu_cxx::__normal_iterator*, std::vector > > >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::range_detail::SinglePassIteratorConcept<__gnu_cxx::__normal_iterator*, std::vector > > >]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied*, std::vector > > > >::value’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:45:51: [ skipping 13 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/isomorphism.hpp:651:42: required from ‘bool boost::graph::detail::isomorphism_impl::operator()(const Graph1&, const Graph2&, const ArgPack&) const [with ArgPack = boost::parameter::aux::empty_arg_list; Graph1 = boost::adjacency_list; Graph2 = boost::adjacency_list]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/isomorphism.hpp:662:5: required from ‘typename boost::result_of(Param0, Param1, const ArgPack&)>::type boost::graph::isomorphism_with_named_params(const Param0&, const Param1&, const ArgPack&) [with Param0 = boost::adjacency_list; Param1 = boost::adjacency_list; ArgPack = boost::parameter::aux::empty_arg_list; typename boost::result_of(Param0, Param1, const ArgPack&)>::type = bool]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/isomorphism.hpp:666:1: required from ‘typename boost::result_of(Param0, Param1, const boost::parameter::aux::empty_arg_list&)>::type boost::isomorphism(const Param0&, const Param1&) [with Param0 = adjacency_list; Param1 = adjacency_list; typename result_of(Param0, Param1, const parameter::aux::empty_arg_list&)>::type = bool]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/is_kuratowski_subgraph.hpp:278:34: required from ‘bool boost::is_kuratowski_subgraph(const Graph&, ForwardIterator, ForwardIterator, VertexIndexMap) [with Graph = adjacency_list, property >; ForwardIterator = __gnu_cxx::__normal_iterator*, std::vector > >; VertexIndexMap = vec_adj_list_vertex_id_map, long unsigned int>]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/is_kuratowski_subgraph.hpp:290:34: required from ‘bool boost::is_kuratowski_subgraph(const Graph&, ForwardIterator, ForwardIterator) [with Graph = adjacency_list, property >; ForwardIterator = __gnu_cxx::__normal_iterator*, std::vector > >]’ planar.cpp:435:37: required from here /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::range_detail::IncrementableIteratorConcept::~IncrementableIteratorConcept() [with Iterator = __gnu_cxx::__normal_iterator*, std::vector > >]’ 37 | ~model() | ^ /home/omnipath/local/R/4.4-3.20/BH/include/boost/range/concepts.hpp:136:13: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 136 | BOOST_CONCEPT_USAGE(IncrementableIteratorConcept) | ^~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::EqualityComparable<__gnu_cxx::__normal_iterator*, std::vector > > >]’: /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements*, std::vector > > > >]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:233:5: required from ‘struct boost::EqualityComparable<__gnu_cxx::__normal_iterator*, std::vector > > >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/range/concepts.hpp:147:16: required from ‘struct boost::range_detail::SinglePassIteratorConcept<__gnu_cxx::__normal_iterator*, std::vector > > >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::range_detail::SinglePassIteratorConcept<__gnu_cxx::__normal_iterator*, std::vector > > >]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied*, std::vector > > > >::value’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:45:51: [ skipping 13 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/isomorphism.hpp:651:42: required from ‘bool boost::graph::detail::isomorphism_impl::operator()(const Graph1&, const Graph2&, const ArgPack&) const [with ArgPack = boost::parameter::aux::empty_arg_list; Graph1 = boost::adjacency_list; Graph2 = boost::adjacency_list]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/isomorphism.hpp:662:5: required from ‘typename boost::result_of(Param0, Param1, const ArgPack&)>::type boost::graph::isomorphism_with_named_params(const Param0&, const Param1&, const ArgPack&) [with Param0 = boost::adjacency_list; Param1 = boost::adjacency_list; ArgPack = boost::parameter::aux::empty_arg_list; typename boost::result_of(Param0, Param1, const ArgPack&)>::type = bool]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/isomorphism.hpp:666:1: required from ‘typename boost::result_of(Param0, Param1, const boost::parameter::aux::empty_arg_list&)>::type boost::isomorphism(const Param0&, const Param1&) [with Param0 = adjacency_list; Param1 = adjacency_list; typename result_of(Param0, Param1, const parameter::aux::empty_arg_list&)>::type = bool]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/is_kuratowski_subgraph.hpp:278:34: required from ‘bool boost::is_kuratowski_subgraph(const Graph&, ForwardIterator, ForwardIterator, VertexIndexMap) [with Graph = adjacency_list, property >; ForwardIterator = __gnu_cxx::__normal_iterator*, std::vector > >; VertexIndexMap = vec_adj_list_vertex_id_map, long unsigned int>]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/is_kuratowski_subgraph.hpp:290:34: required from ‘bool boost::is_kuratowski_subgraph(const Graph&, ForwardIterator, ForwardIterator) [with Graph = adjacency_list, property >; ForwardIterator = __gnu_cxx::__normal_iterator*, std::vector > >]’ planar.cpp:435:37: required from here /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::EqualityComparable::~EqualityComparable() [with TT = __gnu_cxx::__normal_iterator*, std::vector > >]’ 37 | ~model() | ^ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:233:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 233 | BOOST_CONCEPT_USAGE(EqualityComparable) { | ^~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::range_detail::SinglePassIteratorConcept<__gnu_cxx::__normal_iterator*, std::vector > > >]’: /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements*, std::vector > > > >]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/range/concepts.hpp:158:13: required from ‘struct boost::range_detail::SinglePassIteratorConcept<__gnu_cxx::__normal_iterator*, std::vector > > >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::range_detail::SinglePassIteratorConcept<__gnu_cxx::__normal_iterator*, std::vector > > >]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied*, std::vector > > > >::value’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied*, std::vector > > > >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:72:8: [ skipping 12 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/isomorphism.hpp:651:42: required from ‘bool boost::graph::detail::isomorphism_impl::operator()(const Graph1&, const Graph2&, const ArgPack&) const [with ArgPack = boost::parameter::aux::empty_arg_list; Graph1 = boost::adjacency_list; Graph2 = boost::adjacency_list]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/isomorphism.hpp:662:5: required from ‘typename boost::result_of(Param0, Param1, const ArgPack&)>::type boost::graph::isomorphism_with_named_params(const Param0&, const Param1&, const ArgPack&) [with Param0 = boost::adjacency_list; Param1 = boost::adjacency_list; ArgPack = boost::parameter::aux::empty_arg_list; typename boost::result_of(Param0, Param1, const ArgPack&)>::type = bool]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/isomorphism.hpp:666:1: required from ‘typename boost::result_of(Param0, Param1, const boost::parameter::aux::empty_arg_list&)>::type boost::isomorphism(const Param0&, const Param1&) [with Param0 = adjacency_list; Param1 = adjacency_list; typename result_of(Param0, Param1, const parameter::aux::empty_arg_list&)>::type = bool]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/is_kuratowski_subgraph.hpp:278:34: required from ‘bool boost::is_kuratowski_subgraph(const Graph&, ForwardIterator, ForwardIterator, VertexIndexMap) [with Graph = adjacency_list, property >; ForwardIterator = __gnu_cxx::__normal_iterator*, std::vector > >; VertexIndexMap = vec_adj_list_vertex_id_map, long unsigned int>]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/is_kuratowski_subgraph.hpp:290:34: required from ‘bool boost::is_kuratowski_subgraph(const Graph&, ForwardIterator, ForwardIterator) [with Graph = adjacency_list, property >; ForwardIterator = __gnu_cxx::__normal_iterator*, std::vector > >]’ planar.cpp:435:37: required from here /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::range_detail::SinglePassIteratorConcept::~SinglePassIteratorConcept() [with Iterator = __gnu_cxx::__normal_iterator*, std::vector > >]’ 37 | ~model() | ^ /home/omnipath/local/R/4.4-3.20/BH/include/boost/range/concepts.hpp:158:13: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 158 | BOOST_CONCEPT_USAGE(SinglePassIteratorConcept) | ^~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::CopyConstructible<__gnu_cxx::__normal_iterator*, std::vector > > >]’: /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements*, std::vector > > > >]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:167:5: required from ‘struct boost::CopyConstructible<__gnu_cxx::__normal_iterator*, std::vector > > >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/range/concepts.hpp:125:16: required from ‘struct boost::range_detail::IncrementableIteratorConcept<__gnu_cxx::__normal_iterator*, std::vector > > >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/range/concepts.hpp:147:16: required from ‘struct boost::range_detail::SinglePassIteratorConcept<__gnu_cxx::__normal_iterator*, std::vector > > >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::range_detail::SinglePassIteratorConcept<__gnu_cxx::__normal_iterator*, std::vector > > >]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:42:5: [ skipping 14 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/isomorphism.hpp:651:42: required from ‘bool boost::graph::detail::isomorphism_impl::operator()(const Graph1&, const Graph2&, const ArgPack&) const [with ArgPack = boost::parameter::aux::empty_arg_list; Graph1 = boost::adjacency_list; Graph2 = boost::adjacency_list]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/isomorphism.hpp:662:5: required from ‘typename boost::result_of(Param0, Param1, const ArgPack&)>::type boost::graph::isomorphism_with_named_params(const Param0&, const Param1&, const ArgPack&) [with Param0 = boost::adjacency_list; Param1 = boost::adjacency_list; ArgPack = boost::parameter::aux::empty_arg_list; typename boost::result_of(Param0, Param1, const ArgPack&)>::type = bool]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/isomorphism.hpp:666:1: required from ‘typename boost::result_of(Param0, Param1, const boost::parameter::aux::empty_arg_list&)>::type boost::isomorphism(const Param0&, const Param1&) [with Param0 = adjacency_list; Param1 = adjacency_list; typename result_of(Param0, Param1, const parameter::aux::empty_arg_list&)>::type = bool]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/is_kuratowski_subgraph.hpp:278:34: required from ‘bool boost::is_kuratowski_subgraph(const Graph&, ForwardIterator, ForwardIterator, VertexIndexMap) [with Graph = adjacency_list, property >; ForwardIterator = __gnu_cxx::__normal_iterator*, std::vector > >; VertexIndexMap = vec_adj_list_vertex_id_map, long unsigned int>]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/is_kuratowski_subgraph.hpp:290:34: required from ‘bool boost::is_kuratowski_subgraph(const Graph&, ForwardIterator, ForwardIterator) [with Graph = adjacency_list, property >; ForwardIterator = __gnu_cxx::__normal_iterator*, std::vector > >]’ planar.cpp:435:37: required from here /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::CopyConstructible::~CopyConstructible() [with TT = __gnu_cxx::__normal_iterator*, std::vector > >]’ 37 | ~model() | ^ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:167:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 167 | BOOST_CONCEPT_USAGE(CopyConstructible) { | ^~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::range_detail::IncrementableIteratorConcept<__gnu_cxx::__normal_iterator*, std::vector > > >]’: /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements*, std::vector > > > >]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/range/concepts.hpp:136:13: required from ‘struct boost::range_detail::IncrementableIteratorConcept<__gnu_cxx::__normal_iterator*, std::vector > > >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/range/concepts.hpp:147:16: required from ‘struct boost::range_detail::SinglePassIteratorConcept<__gnu_cxx::__normal_iterator*, std::vector > > >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::range_detail::SinglePassIteratorConcept<__gnu_cxx::__normal_iterator*, std::vector > > >]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied*, std::vector > > > >::value’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:45:51: [ skipping 13 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/isomorphism.hpp:651:42: required from ‘bool boost::graph::detail::isomorphism_impl::operator()(const Graph1&, const Graph2&, const ArgPack&) const [with ArgPack = boost::parameter::aux::empty_arg_list; Graph1 = boost::adjacency_list; Graph2 = boost::adjacency_list]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/isomorphism.hpp:662:5: required from ‘typename boost::result_of(Param0, Param1, const ArgPack&)>::type boost::graph::isomorphism_with_named_params(const Param0&, const Param1&, const ArgPack&) [with Param0 = boost::adjacency_list; Param1 = boost::adjacency_list; ArgPack = boost::parameter::aux::empty_arg_list; typename boost::result_of(Param0, Param1, const ArgPack&)>::type = bool]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/isomorphism.hpp:666:1: required from ‘typename boost::result_of(Param0, Param1, const boost::parameter::aux::empty_arg_list&)>::type boost::isomorphism(const Param0&, const Param1&) [with Param0 = adjacency_list; Param1 = adjacency_list; typename result_of(Param0, Param1, const parameter::aux::empty_arg_list&)>::type = bool]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/is_kuratowski_subgraph.hpp:278:34: required from ‘bool boost::is_kuratowski_subgraph(const Graph&, ForwardIterator, ForwardIterator, VertexIndexMap) [with Graph = adjacency_list, property >; ForwardIterator = __gnu_cxx::__normal_iterator*, std::vector > >; VertexIndexMap = vec_adj_list_vertex_id_map, long unsigned int>]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/is_kuratowski_subgraph.hpp:290:34: required from ‘bool boost::is_kuratowski_subgraph(const Graph&, ForwardIterator, ForwardIterator) [with Graph = adjacency_list, property >; ForwardIterator = __gnu_cxx::__normal_iterator*, std::vector > >]’ planar.cpp:435:37: required from here /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::range_detail::IncrementableIteratorConcept::~IncrementableIteratorConcept() [with Iterator = __gnu_cxx::__normal_iterator*, std::vector > >]’ 37 | ~model() | ^ /home/omnipath/local/R/4.4-3.20/BH/include/boost/range/concepts.hpp:136:13: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 136 | BOOST_CONCEPT_USAGE(IncrementableIteratorConcept) | ^~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::EqualityComparable<__gnu_cxx::__normal_iterator*, std::vector > > >]’: /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements*, std::vector > > > >]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:233:5: required from ‘struct boost::EqualityComparable<__gnu_cxx::__normal_iterator*, std::vector > > >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/range/concepts.hpp:147:16: required from ‘struct boost::range_detail::SinglePassIteratorConcept<__gnu_cxx::__normal_iterator*, std::vector > > >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::range_detail::SinglePassIteratorConcept<__gnu_cxx::__normal_iterator*, std::vector > > >]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied*, std::vector > > > >::value’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:45:51: [ skipping 13 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/isomorphism.hpp:651:42: required from ‘bool boost::graph::detail::isomorphism_impl::operator()(const Graph1&, const Graph2&, const ArgPack&) const [with ArgPack = boost::parameter::aux::empty_arg_list; Graph1 = boost::adjacency_list; Graph2 = boost::adjacency_list]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/isomorphism.hpp:662:5: required from ‘typename boost::result_of(Param0, Param1, const ArgPack&)>::type boost::graph::isomorphism_with_named_params(const Param0&, const Param1&, const ArgPack&) [with Param0 = boost::adjacency_list; Param1 = boost::adjacency_list; ArgPack = boost::parameter::aux::empty_arg_list; typename boost::result_of(Param0, Param1, const ArgPack&)>::type = bool]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/isomorphism.hpp:666:1: required from ‘typename boost::result_of(Param0, Param1, const boost::parameter::aux::empty_arg_list&)>::type boost::isomorphism(const Param0&, const Param1&) [with Param0 = adjacency_list; Param1 = adjacency_list; typename result_of(Param0, Param1, const parameter::aux::empty_arg_list&)>::type = bool]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/is_kuratowski_subgraph.hpp:278:34: required from ‘bool boost::is_kuratowski_subgraph(const Graph&, ForwardIterator, ForwardIterator, VertexIndexMap) [with Graph = adjacency_list, property >; ForwardIterator = __gnu_cxx::__normal_iterator*, std::vector > >; VertexIndexMap = vec_adj_list_vertex_id_map, long unsigned int>]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/is_kuratowski_subgraph.hpp:290:34: required from ‘bool boost::is_kuratowski_subgraph(const Graph&, ForwardIterator, ForwardIterator) [with Graph = adjacency_list, property >; ForwardIterator = __gnu_cxx::__normal_iterator*, std::vector > >]’ planar.cpp:435:37: required from here /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::EqualityComparable::~EqualityComparable() [with TT = __gnu_cxx::__normal_iterator*, std::vector > >]’ 37 | ~model() | ^ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:233:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 233 | BOOST_CONCEPT_USAGE(EqualityComparable) { | ^~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::range_detail::SinglePassIteratorConcept<__gnu_cxx::__normal_iterator*, std::vector > > >]’: /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements*, std::vector > > > >]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/range/concepts.hpp:158:13: required from ‘struct boost::range_detail::SinglePassIteratorConcept<__gnu_cxx::__normal_iterator*, std::vector > > >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::range_detail::SinglePassIteratorConcept<__gnu_cxx::__normal_iterator*, std::vector > > >]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied*, std::vector > > > >::value’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied*, std::vector > > > >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:72:8: [ skipping 12 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/isomorphism.hpp:651:42: required from ‘bool boost::graph::detail::isomorphism_impl::operator()(const Graph1&, const Graph2&, const ArgPack&) const [with ArgPack = boost::parameter::aux::empty_arg_list; Graph1 = boost::adjacency_list; Graph2 = boost::adjacency_list]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/isomorphism.hpp:662:5: required from ‘typename boost::result_of(Param0, Param1, const ArgPack&)>::type boost::graph::isomorphism_with_named_params(const Param0&, const Param1&, const ArgPack&) [with Param0 = boost::adjacency_list; Param1 = boost::adjacency_list; ArgPack = boost::parameter::aux::empty_arg_list; typename boost::result_of(Param0, Param1, const ArgPack&)>::type = bool]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/isomorphism.hpp:666:1: required from ‘typename boost::result_of(Param0, Param1, const boost::parameter::aux::empty_arg_list&)>::type boost::isomorphism(const Param0&, const Param1&) [with Param0 = adjacency_list; Param1 = adjacency_list; typename result_of(Param0, Param1, const parameter::aux::empty_arg_list&)>::type = bool]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/is_kuratowski_subgraph.hpp:278:34: required from ‘bool boost::is_kuratowski_subgraph(const Graph&, ForwardIterator, ForwardIterator, VertexIndexMap) [with Graph = adjacency_list, property >; ForwardIterator = __gnu_cxx::__normal_iterator*, std::vector > >; VertexIndexMap = vec_adj_list_vertex_id_map, long unsigned int>]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/is_kuratowski_subgraph.hpp:290:34: required from ‘bool boost::is_kuratowski_subgraph(const Graph&, ForwardIterator, ForwardIterator) [with Graph = adjacency_list, property >; ForwardIterator = __gnu_cxx::__normal_iterator*, std::vector > >]’ planar.cpp:435:37: required from here /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::range_detail::SinglePassIteratorConcept::~SinglePassIteratorConcept() [with Iterator = __gnu_cxx::__normal_iterator*, std::vector > >]’ 37 | ~model() | ^ /home/omnipath/local/R/4.4-3.20/BH/include/boost/range/concepts.hpp:158:13: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 158 | BOOST_CONCEPT_USAGE(SinglePassIteratorConcept) | ^~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::SinglePassRangeConcept > >]’: /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements > > >]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/range/concepts.hpp:284:9: required from ‘struct boost::SinglePassRangeConcept > >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/range/concepts.hpp:318:12: required from ‘struct boost::ForwardRangeConcept > >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/range/concepts.hpp:352:12: required from ‘struct boost::BidirectionalRangeConcept > >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/range/concepts.hpp:370:12: required from ‘struct boost::RandomAccessRangeConcept > >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:32:62: [ skipping 7 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/isomorphism.hpp:651:42: required from ‘bool boost::graph::detail::isomorphism_impl::operator()(const Graph1&, const Graph2&, const ArgPack&) const [with ArgPack = boost::parameter::aux::empty_arg_list; Graph1 = boost::adjacency_list; Graph2 = boost::adjacency_list]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/isomorphism.hpp:662:5: required from ‘typename boost::result_of(Param0, Param1, const ArgPack&)>::type boost::graph::isomorphism_with_named_params(const Param0&, const Param1&, const ArgPack&) [with Param0 = boost::adjacency_list; Param1 = boost::adjacency_list; ArgPack = boost::parameter::aux::empty_arg_list; typename boost::result_of(Param0, Param1, const ArgPack&)>::type = bool]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/isomorphism.hpp:666:1: required from ‘typename boost::result_of(Param0, Param1, const boost::parameter::aux::empty_arg_list&)>::type boost::isomorphism(const Param0&, const Param1&) [with Param0 = adjacency_list; Param1 = adjacency_list; typename result_of(Param0, Param1, const parameter::aux::empty_arg_list&)>::type = bool]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/is_kuratowski_subgraph.hpp:278:34: required from ‘bool boost::is_kuratowski_subgraph(const Graph&, ForwardIterator, ForwardIterator, VertexIndexMap) [with Graph = adjacency_list, property >; ForwardIterator = __gnu_cxx::__normal_iterator*, std::vector > >; VertexIndexMap = vec_adj_list_vertex_id_map, long unsigned int>]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/is_kuratowski_subgraph.hpp:290:34: required from ‘bool boost::is_kuratowski_subgraph(const Graph&, ForwardIterator, ForwardIterator) [with Graph = adjacency_list, property >; ForwardIterator = __gnu_cxx::__normal_iterator*, std::vector > >]’ planar.cpp:435:37: required from here /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::SinglePassRangeConcept::~SinglePassRangeConcept() [with T = std::vector >]’ 37 | ~model() | ^ /home/omnipath/local/R/4.4-3.20/BH/include/boost/range/concepts.hpp:284:9: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 284 | BOOST_CONCEPT_USAGE(SinglePassRangeConcept) | ^~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::DefaultConstructible<__gnu_cxx::__normal_iterator*, std::vector > > >]’: /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements*, std::vector > > > >]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:137:5: required from ‘struct boost::DefaultConstructible<__gnu_cxx::__normal_iterator*, std::vector > > >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/range/concepts.hpp:181:16: required from ‘struct boost::range_detail::ForwardIteratorConcept<__gnu_cxx::__normal_iterator*, std::vector > > >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::range_detail::ForwardIteratorConcept<__gnu_cxx::__normal_iterator*, std::vector > > >]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied*, std::vector > > > >::value’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:45:51: [ skipping 12 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/isomorphism.hpp:651:42: required from ‘bool boost::graph::detail::isomorphism_impl::operator()(const Graph1&, const Graph2&, const ArgPack&) const [with ArgPack = boost::parameter::aux::empty_arg_list; Graph1 = boost::adjacency_list; Graph2 = boost::adjacency_list]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/isomorphism.hpp:662:5: required from ‘typename boost::result_of(Param0, Param1, const ArgPack&)>::type boost::graph::isomorphism_with_named_params(const Param0&, const Param1&, const ArgPack&) [with Param0 = boost::adjacency_list; Param1 = boost::adjacency_list; ArgPack = boost::parameter::aux::empty_arg_list; typename boost::result_of(Param0, Param1, const ArgPack&)>::type = bool]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/isomorphism.hpp:666:1: required from ‘typename boost::result_of(Param0, Param1, const boost::parameter::aux::empty_arg_list&)>::type boost::isomorphism(const Param0&, const Param1&) [with Param0 = adjacency_list; Param1 = adjacency_list; typename result_of(Param0, Param1, const parameter::aux::empty_arg_list&)>::type = bool]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/is_kuratowski_subgraph.hpp:278:34: required from ‘bool boost::is_kuratowski_subgraph(const Graph&, ForwardIterator, ForwardIterator, VertexIndexMap) [with Graph = adjacency_list, property >; ForwardIterator = __gnu_cxx::__normal_iterator*, std::vector > >; VertexIndexMap = vec_adj_list_vertex_id_map, long unsigned int>]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/is_kuratowski_subgraph.hpp:290:34: required from ‘bool boost::is_kuratowski_subgraph(const Graph&, ForwardIterator, ForwardIterator) [with Graph = adjacency_list, property >; ForwardIterator = __gnu_cxx::__normal_iterator*, std::vector > >]’ planar.cpp:435:37: required from here /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::DefaultConstructible::~DefaultConstructible() [with TT = __gnu_cxx::__normal_iterator*, std::vector > >]’ 37 | ~model() | ^ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:137:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 137 | BOOST_CONCEPT_USAGE(DefaultConstructible) { | ^~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::range_detail::ForwardIteratorConcept<__gnu_cxx::__normal_iterator*, std::vector > > >]’: /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements*, std::vector > > > >]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/range/concepts.hpp:197:13: required from ‘struct boost::range_detail::ForwardIteratorConcept<__gnu_cxx::__normal_iterator*, std::vector > > >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::range_detail::ForwardIteratorConcept<__gnu_cxx::__normal_iterator*, std::vector > > >]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied*, std::vector > > > >::value’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied*, std::vector > > > >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:72:8: [ skipping 11 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/isomorphism.hpp:651:42: required from ‘bool boost::graph::detail::isomorphism_impl::operator()(const Graph1&, const Graph2&, const ArgPack&) const [with ArgPack = boost::parameter::aux::empty_arg_list; Graph1 = boost::adjacency_list; Graph2 = boost::adjacency_list]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/isomorphism.hpp:662:5: required from ‘typename boost::result_of(Param0, Param1, const ArgPack&)>::type boost::graph::isomorphism_with_named_params(const Param0&, const Param1&, const ArgPack&) [with Param0 = boost::adjacency_list; Param1 = boost::adjacency_list; ArgPack = boost::parameter::aux::empty_arg_list; typename boost::result_of(Param0, Param1, const ArgPack&)>::type = bool]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/isomorphism.hpp:666:1: required from ‘typename boost::result_of(Param0, Param1, const boost::parameter::aux::empty_arg_list&)>::type boost::isomorphism(const Param0&, const Param1&) [with Param0 = adjacency_list; Param1 = adjacency_list; typename result_of(Param0, Param1, const parameter::aux::empty_arg_list&)>::type = bool]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/is_kuratowski_subgraph.hpp:278:34: required from ‘bool boost::is_kuratowski_subgraph(const Graph&, ForwardIterator, ForwardIterator, VertexIndexMap) [with Graph = adjacency_list, property >; ForwardIterator = __gnu_cxx::__normal_iterator*, std::vector > >; VertexIndexMap = vec_adj_list_vertex_id_map, long unsigned int>]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/is_kuratowski_subgraph.hpp:290:34: required from ‘bool boost::is_kuratowski_subgraph(const Graph&, ForwardIterator, ForwardIterator) [with Graph = adjacency_list, property >; ForwardIterator = __gnu_cxx::__normal_iterator*, std::vector > >]’ planar.cpp:435:37: required from here /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::range_detail::ForwardIteratorConcept::~ForwardIteratorConcept() [with Iterator = __gnu_cxx::__normal_iterator*, std::vector > >]’ 37 | ~model() | ^ /home/omnipath/local/R/4.4-3.20/BH/include/boost/range/concepts.hpp:197:13: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 197 | BOOST_CONCEPT_USAGE(ForwardIteratorConcept) | ^~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::DefaultConstructible<__gnu_cxx::__normal_iterator*, std::vector > > >]’: /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements*, std::vector > > > >]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:137:5: required from ‘struct boost::DefaultConstructible<__gnu_cxx::__normal_iterator*, std::vector > > >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/range/concepts.hpp:181:16: required from ‘struct boost::range_detail::ForwardIteratorConcept<__gnu_cxx::__normal_iterator*, std::vector > > >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::range_detail::ForwardIteratorConcept<__gnu_cxx::__normal_iterator*, std::vector > > >]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied*, std::vector > > > >::value’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:45:51: [ skipping 12 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/isomorphism.hpp:651:42: required from ‘bool boost::graph::detail::isomorphism_impl::operator()(const Graph1&, const Graph2&, const ArgPack&) const [with ArgPack = boost::parameter::aux::empty_arg_list; Graph1 = boost::adjacency_list; Graph2 = boost::adjacency_list]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/isomorphism.hpp:662:5: required from ‘typename boost::result_of(Param0, Param1, const ArgPack&)>::type boost::graph::isomorphism_with_named_params(const Param0&, const Param1&, const ArgPack&) [with Param0 = boost::adjacency_list; Param1 = boost::adjacency_list; ArgPack = boost::parameter::aux::empty_arg_list; typename boost::result_of(Param0, Param1, const ArgPack&)>::type = bool]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/isomorphism.hpp:666:1: required from ‘typename boost::result_of(Param0, Param1, const boost::parameter::aux::empty_arg_list&)>::type boost::isomorphism(const Param0&, const Param1&) [with Param0 = adjacency_list; Param1 = adjacency_list; typename result_of(Param0, Param1, const parameter::aux::empty_arg_list&)>::type = bool]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/is_kuratowski_subgraph.hpp:278:34: required from ‘bool boost::is_kuratowski_subgraph(const Graph&, ForwardIterator, ForwardIterator, VertexIndexMap) [with Graph = adjacency_list, property >; ForwardIterator = __gnu_cxx::__normal_iterator*, std::vector > >; VertexIndexMap = vec_adj_list_vertex_id_map, long unsigned int>]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/is_kuratowski_subgraph.hpp:290:34: required from ‘bool boost::is_kuratowski_subgraph(const Graph&, ForwardIterator, ForwardIterator) [with Graph = adjacency_list, property >; ForwardIterator = __gnu_cxx::__normal_iterator*, std::vector > >]’ planar.cpp:435:37: required from here /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::DefaultConstructible::~DefaultConstructible() [with TT = __gnu_cxx::__normal_iterator*, std::vector > >]’ 37 | ~model() | ^ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:137:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 137 | BOOST_CONCEPT_USAGE(DefaultConstructible) { | ^~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::range_detail::ForwardIteratorConcept<__gnu_cxx::__normal_iterator*, std::vector > > >]’: /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements*, std::vector > > > >]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/range/concepts.hpp:197:13: required from ‘struct boost::range_detail::ForwardIteratorConcept<__gnu_cxx::__normal_iterator*, std::vector > > >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::range_detail::ForwardIteratorConcept<__gnu_cxx::__normal_iterator*, std::vector > > >]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied*, std::vector > > > >::value’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied*, std::vector > > > >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:72:8: [ skipping 11 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/isomorphism.hpp:651:42: required from ‘bool boost::graph::detail::isomorphism_impl::operator()(const Graph1&, const Graph2&, const ArgPack&) const [with ArgPack = boost::parameter::aux::empty_arg_list; Graph1 = boost::adjacency_list; Graph2 = boost::adjacency_list]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/isomorphism.hpp:662:5: required from ‘typename boost::result_of(Param0, Param1, const ArgPack&)>::type boost::graph::isomorphism_with_named_params(const Param0&, const Param1&, const ArgPack&) [with Param0 = boost::adjacency_list; Param1 = boost::adjacency_list; ArgPack = boost::parameter::aux::empty_arg_list; typename boost::result_of(Param0, Param1, const ArgPack&)>::type = bool]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/isomorphism.hpp:666:1: required from ‘typename boost::result_of(Param0, Param1, const boost::parameter::aux::empty_arg_list&)>::type boost::isomorphism(const Param0&, const Param1&) [with Param0 = adjacency_list; Param1 = adjacency_list; typename result_of(Param0, Param1, const parameter::aux::empty_arg_list&)>::type = bool]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/is_kuratowski_subgraph.hpp:278:34: required from ‘bool boost::is_kuratowski_subgraph(const Graph&, ForwardIterator, ForwardIterator, VertexIndexMap) [with Graph = adjacency_list, property >; ForwardIterator = __gnu_cxx::__normal_iterator*, std::vector > >; VertexIndexMap = vec_adj_list_vertex_id_map, long unsigned int>]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/is_kuratowski_subgraph.hpp:290:34: required from ‘bool boost::is_kuratowski_subgraph(const Graph&, ForwardIterator, ForwardIterator) [with Graph = adjacency_list, property >; ForwardIterator = __gnu_cxx::__normal_iterator*, std::vector > >]’ planar.cpp:435:37: required from here /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::range_detail::ForwardIteratorConcept::~ForwardIteratorConcept() [with Iterator = __gnu_cxx::__normal_iterator*, std::vector > >]’ 37 | ~model() | ^ /home/omnipath/local/R/4.4-3.20/BH/include/boost/range/concepts.hpp:197:13: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 197 | BOOST_CONCEPT_USAGE(ForwardIteratorConcept) | ^~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::range_detail::BidirectionalIteratorConcept<__gnu_cxx::__normal_iterator*, std::vector > > >]’: /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements*, std::vector > > > >]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/range/concepts.hpp:224:14: required from ‘struct boost::range_detail::BidirectionalIteratorConcept<__gnu_cxx::__normal_iterator*, std::vector > > >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::range_detail::BidirectionalIteratorConcept<__gnu_cxx::__normal_iterator*, std::vector > > >]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied*, std::vector > > > >::value’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied*, std::vector > > > >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:72:8: [ skipping 10 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/isomorphism.hpp:651:42: required from ‘bool boost::graph::detail::isomorphism_impl::operator()(const Graph1&, const Graph2&, const ArgPack&) const [with ArgPack = boost::parameter::aux::empty_arg_list; Graph1 = boost::adjacency_list; Graph2 = boost::adjacency_list]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/isomorphism.hpp:662:5: required from ‘typename boost::result_of(Param0, Param1, const ArgPack&)>::type boost::graph::isomorphism_with_named_params(const Param0&, const Param1&, const ArgPack&) [with Param0 = boost::adjacency_list; Param1 = boost::adjacency_list; ArgPack = boost::parameter::aux::empty_arg_list; typename boost::result_of(Param0, Param1, const ArgPack&)>::type = bool]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/isomorphism.hpp:666:1: required from ‘typename boost::result_of(Param0, Param1, const boost::parameter::aux::empty_arg_list&)>::type boost::isomorphism(const Param0&, const Param1&) [with Param0 = adjacency_list; Param1 = adjacency_list; typename result_of(Param0, Param1, const parameter::aux::empty_arg_list&)>::type = bool]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/is_kuratowski_subgraph.hpp:278:34: required from ‘bool boost::is_kuratowski_subgraph(const Graph&, ForwardIterator, ForwardIterator, VertexIndexMap) [with Graph = adjacency_list, property >; ForwardIterator = __gnu_cxx::__normal_iterator*, std::vector > >; VertexIndexMap = vec_adj_list_vertex_id_map, long unsigned int>]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/is_kuratowski_subgraph.hpp:290:34: required from ‘bool boost::is_kuratowski_subgraph(const Graph&, ForwardIterator, ForwardIterator) [with Graph = adjacency_list, property >; ForwardIterator = __gnu_cxx::__normal_iterator*, std::vector > >]’ planar.cpp:435:37: required from here /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::range_detail::BidirectionalIteratorConcept::~BidirectionalIteratorConcept() [with Iterator = __gnu_cxx::__normal_iterator*, std::vector > >]’ 37 | ~model() | ^ /home/omnipath/local/R/4.4-3.20/BH/include/boost/range/concepts.hpp:224:14: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 224 | BOOST_CONCEPT_USAGE(BidirectionalIteratorConcept) | ^~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::range_detail::BidirectionalIteratorConcept<__gnu_cxx::__normal_iterator*, std::vector > > >]’: /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements*, std::vector > > > >]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/range/concepts.hpp:224:14: required from ‘struct boost::range_detail::BidirectionalIteratorConcept<__gnu_cxx::__normal_iterator*, std::vector > > >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::range_detail::BidirectionalIteratorConcept<__gnu_cxx::__normal_iterator*, std::vector > > >]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied*, std::vector > > > >::value’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied*, std::vector > > > >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:72:8: [ skipping 10 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/isomorphism.hpp:651:42: required from ‘bool boost::graph::detail::isomorphism_impl::operator()(const Graph1&, const Graph2&, const ArgPack&) const [with ArgPack = boost::parameter::aux::empty_arg_list; Graph1 = boost::adjacency_list; Graph2 = boost::adjacency_list]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/isomorphism.hpp:662:5: required from ‘typename boost::result_of(Param0, Param1, const ArgPack&)>::type boost::graph::isomorphism_with_named_params(const Param0&, const Param1&, const ArgPack&) [with Param0 = boost::adjacency_list; Param1 = boost::adjacency_list; ArgPack = boost::parameter::aux::empty_arg_list; typename boost::result_of(Param0, Param1, const ArgPack&)>::type = bool]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/isomorphism.hpp:666:1: required from ‘typename boost::result_of(Param0, Param1, const boost::parameter::aux::empty_arg_list&)>::type boost::isomorphism(const Param0&, const Param1&) [with Param0 = adjacency_list; Param1 = adjacency_list; typename result_of(Param0, Param1, const parameter::aux::empty_arg_list&)>::type = bool]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/is_kuratowski_subgraph.hpp:278:34: required from ‘bool boost::is_kuratowski_subgraph(const Graph&, ForwardIterator, ForwardIterator, VertexIndexMap) [with Graph = adjacency_list, property >; ForwardIterator = __gnu_cxx::__normal_iterator*, std::vector > >; VertexIndexMap = vec_adj_list_vertex_id_map, long unsigned int>]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/is_kuratowski_subgraph.hpp:290:34: required from ‘bool boost::is_kuratowski_subgraph(const Graph&, ForwardIterator, ForwardIterator) [with Graph = adjacency_list, property >; ForwardIterator = __gnu_cxx::__normal_iterator*, std::vector > >]’ planar.cpp:435:37: required from here /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::range_detail::BidirectionalIteratorConcept::~BidirectionalIteratorConcept() [with Iterator = __gnu_cxx::__normal_iterator*, std::vector > >]’ 37 | ~model() | ^ /home/omnipath/local/R/4.4-3.20/BH/include/boost/range/concepts.hpp:224:14: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 224 | BOOST_CONCEPT_USAGE(BidirectionalIteratorConcept) | ^~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::range_detail::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator*, std::vector > > >]’: /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements*, std::vector > > > >]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/range/concepts.hpp:245:14: required from ‘struct boost::range_detail::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator*, std::vector > > >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::range_detail::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator*, std::vector > > >]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied*, std::vector > > > >::value’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied*, std::vector > > > >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:72:8: [ skipping 9 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/isomorphism.hpp:651:42: required from ‘bool boost::graph::detail::isomorphism_impl::operator()(const Graph1&, const Graph2&, const ArgPack&) const [with ArgPack = boost::parameter::aux::empty_arg_list; Graph1 = boost::adjacency_list; Graph2 = boost::adjacency_list]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/isomorphism.hpp:662:5: required from ‘typename boost::result_of(Param0, Param1, const ArgPack&)>::type boost::graph::isomorphism_with_named_params(const Param0&, const Param1&, const ArgPack&) [with Param0 = boost::adjacency_list; Param1 = boost::adjacency_list; ArgPack = boost::parameter::aux::empty_arg_list; typename boost::result_of(Param0, Param1, const ArgPack&)>::type = bool]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/isomorphism.hpp:666:1: required from ‘typename boost::result_of(Param0, Param1, const boost::parameter::aux::empty_arg_list&)>::type boost::isomorphism(const Param0&, const Param1&) [with Param0 = adjacency_list; Param1 = adjacency_list; typename result_of(Param0, Param1, const parameter::aux::empty_arg_list&)>::type = bool]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/is_kuratowski_subgraph.hpp:278:34: required from ‘bool boost::is_kuratowski_subgraph(const Graph&, ForwardIterator, ForwardIterator, VertexIndexMap) [with Graph = adjacency_list, property >; ForwardIterator = __gnu_cxx::__normal_iterator*, std::vector > >; VertexIndexMap = vec_adj_list_vertex_id_map, long unsigned int>]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/is_kuratowski_subgraph.hpp:290:34: required from ‘bool boost::is_kuratowski_subgraph(const Graph&, ForwardIterator, ForwardIterator) [with Graph = adjacency_list, property >; ForwardIterator = __gnu_cxx::__normal_iterator*, std::vector > >]’ planar.cpp:435:37: required from here /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::range_detail::RandomAccessIteratorConcept::~RandomAccessIteratorConcept() [with Iterator = __gnu_cxx::__normal_iterator*, std::vector > >]’ 37 | ~model() | ^ /home/omnipath/local/R/4.4-3.20/BH/include/boost/range/concepts.hpp:245:14: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 245 | BOOST_CONCEPT_USAGE(RandomAccessIteratorConcept) | ^~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::range_detail::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator*, std::vector > > >]’: /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements*, std::vector > > > >]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/range/concepts.hpp:245:14: required from ‘struct boost::range_detail::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator*, std::vector > > >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::range_detail::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator*, std::vector > > >]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied*, std::vector > > > >::value’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied*, std::vector > > > >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:72:8: [ skipping 9 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/isomorphism.hpp:651:42: required from ‘bool boost::graph::detail::isomorphism_impl::operator()(const Graph1&, const Graph2&, const ArgPack&) const [with ArgPack = boost::parameter::aux::empty_arg_list; Graph1 = boost::adjacency_list; Graph2 = boost::adjacency_list]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/isomorphism.hpp:662:5: required from ‘typename boost::result_of(Param0, Param1, const ArgPack&)>::type boost::graph::isomorphism_with_named_params(const Param0&, const Param1&, const ArgPack&) [with Param0 = boost::adjacency_list; Param1 = boost::adjacency_list; ArgPack = boost::parameter::aux::empty_arg_list; typename boost::result_of(Param0, Param1, const ArgPack&)>::type = bool]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/isomorphism.hpp:666:1: required from ‘typename boost::result_of(Param0, Param1, const boost::parameter::aux::empty_arg_list&)>::type boost::isomorphism(const Param0&, const Param1&) [with Param0 = adjacency_list; Param1 = adjacency_list; typename result_of(Param0, Param1, const parameter::aux::empty_arg_list&)>::type = bool]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/is_kuratowski_subgraph.hpp:278:34: required from ‘bool boost::is_kuratowski_subgraph(const Graph&, ForwardIterator, ForwardIterator, VertexIndexMap) [with Graph = adjacency_list, property >; ForwardIterator = __gnu_cxx::__normal_iterator*, std::vector > >; VertexIndexMap = vec_adj_list_vertex_id_map, long unsigned int>]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/is_kuratowski_subgraph.hpp:290:34: required from ‘bool boost::is_kuratowski_subgraph(const Graph&, ForwardIterator, ForwardIterator) [with Graph = adjacency_list, property >; ForwardIterator = __gnu_cxx::__normal_iterator*, std::vector > >]’ planar.cpp:435:37: required from here /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::range_detail::RandomAccessIteratorConcept::~RandomAccessIteratorConcept() [with Iterator = __gnu_cxx::__normal_iterator*, std::vector > >]’ 37 | ~model() | ^ /home/omnipath/local/R/4.4-3.20/BH/include/boost/range/concepts.hpp:245:14: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 245 | BOOST_CONCEPT_USAGE(RandomAccessIteratorConcept) | ^~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements, long unsigned int, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator >, boost::no_property>*, std::vector >, boost::no_property>, std::allocator >, boost::no_property> > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, long int> > >]’: /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:167:5: required from ‘struct boost::CopyConstructible, long unsigned int, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator >, boost::no_property>*, std::vector >, boost::no_property>, std::allocator >, boost::no_property> > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, long int> >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/range/concepts.hpp:125:16: required from ‘struct boost::range_detail::IncrementableIteratorConcept, long unsigned int, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator >, boost::no_property>*, std::vector >, boost::no_property>, std::allocator >, boost::no_property> > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, long int> >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/range/concepts.hpp:147:16: required from ‘struct boost::range_detail::SinglePassIteratorConcept, long unsigned int, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator >, boost::no_property>*, std::vector >, boost::no_property>, std::allocator >, boost::no_property> > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, long int> >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::range_detail::SinglePassIteratorConcept, long unsigned int, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator >, boost::no_property>*, std::vector >, boost::no_property>, std::allocator >, boost::no_property> > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, long int> >]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied, long unsigned int, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator >, boost::no_property>*, std::vector >, boost::no_property>, std::allocator >, boost::no_property> > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, long int> > >::value’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:45:51: [ skipping 11 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/isomorphism.hpp:651:42: required from ‘bool boost::graph::detail::isomorphism_impl::operator()(const Graph1&, const Graph2&, const ArgPack&) const [with ArgPack = boost::parameter::aux::empty_arg_list; Graph1 = boost::adjacency_list; Graph2 = boost::adjacency_list]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/isomorphism.hpp:662:5: required from ‘typename boost::result_of(Param0, Param1, const ArgPack&)>::type boost::graph::isomorphism_with_named_params(const Param0&, const Param1&, const ArgPack&) [with Param0 = boost::adjacency_list; Param1 = boost::adjacency_list; ArgPack = boost::parameter::aux::empty_arg_list; typename boost::result_of(Param0, Param1, const ArgPack&)>::type = bool]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/isomorphism.hpp:666:1: required from ‘typename boost::result_of(Param0, Param1, const boost::parameter::aux::empty_arg_list&)>::type boost::isomorphism(const Param0&, const Param1&) [with Param0 = adjacency_list; Param1 = adjacency_list; typename result_of(Param0, Param1, const parameter::aux::empty_arg_list&)>::type = bool]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/is_kuratowski_subgraph.hpp:278:34: required from ‘bool boost::is_kuratowski_subgraph(const Graph&, ForwardIterator, ForwardIterator, VertexIndexMap) [with Graph = adjacency_list, property >; ForwardIterator = __gnu_cxx::__normal_iterator*, std::vector > >; VertexIndexMap = vec_adj_list_vertex_id_map, long unsigned int>]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/is_kuratowski_subgraph.hpp:290:34: required from ‘bool boost::is_kuratowski_subgraph(const Graph&, ForwardIterator, ForwardIterator) [with Graph = adjacency_list, property >; ForwardIterator = __gnu_cxx::__normal_iterator*, std::vector > >]’ planar.cpp:435:37: required from here /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::CopyConstructible, long unsigned int, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator >, boost::no_property>*, std::vector >, boost::no_property>, std::allocator >, boost::no_property> > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, long int> >]’ 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ^ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements, boost::iterators::incrementable_traversal_tag> >]’: /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:208:5: required from ‘struct boost::Convertible, boost::iterators::incrementable_traversal_tag>’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::Convertible, boost::iterators::incrementable_traversal_tag>]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied, boost::iterators::incrementable_traversal_tag> >::value’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied, boost::iterators::incrementable_traversal_tag> >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_, boost::iterators::incrementable_traversal_tag>)>’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/iterator/iterator_concepts.hpp:114:7: [ skipping 15 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/isomorphism.hpp:651:42: required from ‘bool boost::graph::detail::isomorphism_impl::operator()(const Graph1&, const Graph2&, const ArgPack&) const [with ArgPack = boost::parameter::aux::empty_arg_list; Graph1 = boost::adjacency_list; Graph2 = boost::adjacency_list]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/isomorphism.hpp:662:5: required from ‘typename boost::result_of(Param0, Param1, const ArgPack&)>::type boost::graph::isomorphism_with_named_params(const Param0&, const Param1&, const ArgPack&) [with Param0 = boost::adjacency_list; Param1 = boost::adjacency_list; ArgPack = boost::parameter::aux::empty_arg_list; typename boost::result_of(Param0, Param1, const ArgPack&)>::type = bool]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/isomorphism.hpp:666:1: required from ‘typename boost::result_of(Param0, Param1, const boost::parameter::aux::empty_arg_list&)>::type boost::isomorphism(const Param0&, const Param1&) [with Param0 = adjacency_list; Param1 = adjacency_list; typename result_of(Param0, Param1, const parameter::aux::empty_arg_list&)>::type = bool]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/is_kuratowski_subgraph.hpp:278:34: required from ‘bool boost::is_kuratowski_subgraph(const Graph&, ForwardIterator, ForwardIterator, VertexIndexMap) [with Graph = adjacency_list, property >; ForwardIterator = __gnu_cxx::__normal_iterator*, std::vector > >; VertexIndexMap = vec_adj_list_vertex_id_map, long unsigned int>]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/is_kuratowski_subgraph.hpp:290:34: required from ‘bool boost::is_kuratowski_subgraph(const Graph&, ForwardIterator, ForwardIterator) [with Graph = adjacency_list, property >; ForwardIterator = __gnu_cxx::__normal_iterator*, std::vector > >]’ planar.cpp:435:37: required from here /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::Convertible, boost::iterators::incrementable_traversal_tag>]’ 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ^ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::Convertible, boost::iterators::incrementable_traversal_tag>]’: /home/omnipath/local/R/4.4-3.20/BH/include/boost/iterator/iterator_concepts.hpp:114:7: required from ‘struct boost::range_detail::IncrementableIteratorConcept, long unsigned int, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator >, boost::no_property>*, std::vector >, boost::no_property>, std::allocator >, boost::no_property> > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, long int> >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/range/concepts.hpp:147:16: required from ‘struct boost::range_detail::SinglePassIteratorConcept, long unsigned int, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator >, boost::no_property>*, std::vector >, boost::no_property>, std::allocator >, boost::no_property> > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, long int> >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::range_detail::SinglePassIteratorConcept, long unsigned int, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator >, boost::no_property>*, std::vector >, boost::no_property>, std::allocator >, boost::no_property> > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, long int> >]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied, long unsigned int, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator >, boost::no_property>*, std::vector >, boost::no_property>, std::allocator >, boost::no_property> > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, long int> > >::value’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied, long unsigned int, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator >, boost::no_property>*, std::vector >, boost::no_property>, std::allocator >, boost::no_property> > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, long int> > >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:72:8: [ skipping 10 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/isomorphism.hpp:651:42: required from ‘bool boost::graph::detail::isomorphism_impl::operator()(const Graph1&, const Graph2&, const ArgPack&) const [with ArgPack = boost::parameter::aux::empty_arg_list; Graph1 = boost::adjacency_list; Graph2 = boost::adjacency_list]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/isomorphism.hpp:662:5: required from ‘typename boost::result_of(Param0, Param1, const ArgPack&)>::type boost::graph::isomorphism_with_named_params(const Param0&, const Param1&, const ArgPack&) [with Param0 = boost::adjacency_list; Param1 = boost::adjacency_list; ArgPack = boost::parameter::aux::empty_arg_list; typename boost::result_of(Param0, Param1, const ArgPack&)>::type = bool]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/isomorphism.hpp:666:1: required from ‘typename boost::result_of(Param0, Param1, const boost::parameter::aux::empty_arg_list&)>::type boost::isomorphism(const Param0&, const Param1&) [with Param0 = adjacency_list; Param1 = adjacency_list; typename result_of(Param0, Param1, const parameter::aux::empty_arg_list&)>::type = bool]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/is_kuratowski_subgraph.hpp:278:34: required from ‘bool boost::is_kuratowski_subgraph(const Graph&, ForwardIterator, ForwardIterator, VertexIndexMap) [with Graph = adjacency_list, property >; ForwardIterator = __gnu_cxx::__normal_iterator*, std::vector > >; VertexIndexMap = vec_adj_list_vertex_id_map, long unsigned int>]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/is_kuratowski_subgraph.hpp:290:34: required from ‘bool boost::is_kuratowski_subgraph(const Graph&, ForwardIterator, ForwardIterator) [with Graph = adjacency_list, property >; ForwardIterator = __gnu_cxx::__normal_iterator*, std::vector > >]’ planar.cpp:435:37: required from here /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::Convertible::~Convertible() [with X = boost::iterators::detail::iterator_category_with_traversal; Y = boost::iterators::incrementable_traversal_tag]’ 37 | ~model() | ^ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:208:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 208 | BOOST_CONCEPT_USAGE(Convertible) { | ^~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements, long unsigned int, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator >, boost::no_property>*, std::vector >, boost::no_property>, std::allocator >, boost::no_property> > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, long int> > >]’: /home/omnipath/local/R/4.4-3.20/BH/include/boost/range/concepts.hpp:136:13: required from ‘struct boost::range_detail::IncrementableIteratorConcept, long unsigned int, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator >, boost::no_property>*, std::vector >, boost::no_property>, std::allocator >, boost::no_property> > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, long int> >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/range/concepts.hpp:147:16: required from ‘struct boost::range_detail::SinglePassIteratorConcept, long unsigned int, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator >, boost::no_property>*, std::vector >, boost::no_property>, std::allocator >, boost::no_property> > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, long int> >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::range_detail::SinglePassIteratorConcept, long unsigned int, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator >, boost::no_property>*, std::vector >, boost::no_property>, std::allocator >, boost::no_property> > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, long int> >]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied, long unsigned int, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator >, boost::no_property>*, std::vector >, boost::no_property>, std::allocator >, boost::no_property> > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, long int> > >::value’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied, long unsigned int, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator >, boost::no_property>*, std::vector >, boost::no_property>, std::allocator >, boost::no_property> > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, long int> > >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:72:8: [ skipping 10 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/isomorphism.hpp:651:42: required from ‘bool boost::graph::detail::isomorphism_impl::operator()(const Graph1&, const Graph2&, const ArgPack&) const [with ArgPack = boost::parameter::aux::empty_arg_list; Graph1 = boost::adjacency_list; Graph2 = boost::adjacency_list]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/isomorphism.hpp:662:5: required from ‘typename boost::result_of(Param0, Param1, const ArgPack&)>::type boost::graph::isomorphism_with_named_params(const Param0&, const Param1&, const ArgPack&) [with Param0 = boost::adjacency_list; Param1 = boost::adjacency_list; ArgPack = boost::parameter::aux::empty_arg_list; typename boost::result_of(Param0, Param1, const ArgPack&)>::type = bool]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/isomorphism.hpp:666:1: required from ‘typename boost::result_of(Param0, Param1, const boost::parameter::aux::empty_arg_list&)>::type boost::isomorphism(const Param0&, const Param1&) [with Param0 = adjacency_list; Param1 = adjacency_list; typename result_of(Param0, Param1, const parameter::aux::empty_arg_list&)>::type = bool]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/is_kuratowski_subgraph.hpp:278:34: required from ‘bool boost::is_kuratowski_subgraph(const Graph&, ForwardIterator, ForwardIterator, VertexIndexMap) [with Graph = adjacency_list, property >; ForwardIterator = __gnu_cxx::__normal_iterator*, std::vector > >; VertexIndexMap = vec_adj_list_vertex_id_map, long unsigned int>]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/is_kuratowski_subgraph.hpp:290:34: required from ‘bool boost::is_kuratowski_subgraph(const Graph&, ForwardIterator, ForwardIterator) [with Graph = adjacency_list, property >; ForwardIterator = __gnu_cxx::__normal_iterator*, std::vector > >]’ planar.cpp:435:37: required from here /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::range_detail::IncrementableIteratorConcept, long unsigned int, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator >, boost::no_property>*, std::vector >, boost::no_property>, std::allocator >, boost::no_property> > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, long int> >]’ 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ^ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements, long unsigned int, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator >, boost::no_property>*, std::vector >, boost::no_property>, std::allocator >, boost::no_property> > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, long int> > >]’: /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:233:5: required from ‘struct boost::EqualityComparable, long unsigned int, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator >, boost::no_property>*, std::vector >, boost::no_property>, std::allocator >, boost::no_property> > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, long int> >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/range/concepts.hpp:147:16: required from ‘struct boost::range_detail::SinglePassIteratorConcept, long unsigned int, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator >, boost::no_property>*, std::vector >, boost::no_property>, std::allocator >, boost::no_property> > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, long int> >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::range_detail::SinglePassIteratorConcept, long unsigned int, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator >, boost::no_property>*, std::vector >, boost::no_property>, std::allocator >, boost::no_property> > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, long int> >]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied, long unsigned int, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator >, boost::no_property>*, std::vector >, boost::no_property>, std::allocator >, boost::no_property> > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, long int> > >::value’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied, long unsigned int, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator >, boost::no_property>*, std::vector >, boost::no_property>, std::allocator >, boost::no_property> > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, long int> > >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:72:8: [ skipping 10 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/isomorphism.hpp:651:42: required from ‘bool boost::graph::detail::isomorphism_impl::operator()(const Graph1&, const Graph2&, const ArgPack&) const [with ArgPack = boost::parameter::aux::empty_arg_list; Graph1 = boost::adjacency_list; Graph2 = boost::adjacency_list]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/isomorphism.hpp:662:5: required from ‘typename boost::result_of(Param0, Param1, const ArgPack&)>::type boost::graph::isomorphism_with_named_params(const Param0&, const Param1&, const ArgPack&) [with Param0 = boost::adjacency_list; Param1 = boost::adjacency_list; ArgPack = boost::parameter::aux::empty_arg_list; typename boost::result_of(Param0, Param1, const ArgPack&)>::type = bool]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/isomorphism.hpp:666:1: required from ‘typename boost::result_of(Param0, Param1, const boost::parameter::aux::empty_arg_list&)>::type boost::isomorphism(const Param0&, const Param1&) [with Param0 = adjacency_list; Param1 = adjacency_list; typename result_of(Param0, Param1, const parameter::aux::empty_arg_list&)>::type = bool]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/is_kuratowski_subgraph.hpp:278:34: required from ‘bool boost::is_kuratowski_subgraph(const Graph&, ForwardIterator, ForwardIterator, VertexIndexMap) [with Graph = adjacency_list, property >; ForwardIterator = __gnu_cxx::__normal_iterator*, std::vector > >; VertexIndexMap = vec_adj_list_vertex_id_map, long unsigned int>]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/is_kuratowski_subgraph.hpp:290:34: required from ‘bool boost::is_kuratowski_subgraph(const Graph&, ForwardIterator, ForwardIterator) [with Graph = adjacency_list, property >; ForwardIterator = __gnu_cxx::__normal_iterator*, std::vector > >]’ planar.cpp:435:37: required from here /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::EqualityComparable, long unsigned int, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator >, boost::no_property>*, std::vector >, boost::no_property>, std::allocator >, boost::no_property> > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, long int> >]’ 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ^ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements, boost::iterators::single_pass_traversal_tag> >]’: /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:208:5: required from ‘struct boost::Convertible, boost::iterators::single_pass_traversal_tag>’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::Convertible, boost::iterators::single_pass_traversal_tag>]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied, boost::iterators::single_pass_traversal_tag> >::value’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied, boost::iterators::single_pass_traversal_tag> >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_, boost::iterators::single_pass_traversal_tag>)>’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/range/concepts.hpp:152:13: [ skipping 14 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/isomorphism.hpp:651:42: required from ‘bool boost::graph::detail::isomorphism_impl::operator()(const Graph1&, const Graph2&, const ArgPack&) const [with ArgPack = boost::parameter::aux::empty_arg_list; Graph1 = boost::adjacency_list; Graph2 = boost::adjacency_list]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/isomorphism.hpp:662:5: required from ‘typename boost::result_of(Param0, Param1, const ArgPack&)>::type boost::graph::isomorphism_with_named_params(const Param0&, const Param1&, const ArgPack&) [with Param0 = boost::adjacency_list; Param1 = boost::adjacency_list; ArgPack = boost::parameter::aux::empty_arg_list; typename boost::result_of(Param0, Param1, const ArgPack&)>::type = bool]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/isomorphism.hpp:666:1: required from ‘typename boost::result_of(Param0, Param1, const boost::parameter::aux::empty_arg_list&)>::type boost::isomorphism(const Param0&, const Param1&) [with Param0 = adjacency_list; Param1 = adjacency_list; typename result_of(Param0, Param1, const parameter::aux::empty_arg_list&)>::type = bool]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/is_kuratowski_subgraph.hpp:278:34: required from ‘bool boost::is_kuratowski_subgraph(const Graph&, ForwardIterator, ForwardIterator, VertexIndexMap) [with Graph = adjacency_list, property >; ForwardIterator = __gnu_cxx::__normal_iterator*, std::vector > >; VertexIndexMap = vec_adj_list_vertex_id_map, long unsigned int>]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/is_kuratowski_subgraph.hpp:290:34: required from ‘bool boost::is_kuratowski_subgraph(const Graph&, ForwardIterator, ForwardIterator) [with Graph = adjacency_list, property >; ForwardIterator = __gnu_cxx::__normal_iterator*, std::vector > >]’ planar.cpp:435:37: required from here /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::Convertible, boost::iterators::single_pass_traversal_tag>]’ 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ^ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::Convertible, boost::iterators::single_pass_traversal_tag>]’: /home/omnipath/local/R/4.4-3.20/BH/include/boost/range/concepts.hpp:152:13: required from ‘struct boost::range_detail::SinglePassIteratorConcept, long unsigned int, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator >, boost::no_property>*, std::vector >, boost::no_property>, std::allocator >, boost::no_property> > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, long int> >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::range_detail::SinglePassIteratorConcept, long unsigned int, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator >, boost::no_property>*, std::vector >, boost::no_property>, std::allocator >, boost::no_property> > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, long int> >]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied, long unsigned int, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator >, boost::no_property>*, std::vector >, boost::no_property>, std::allocator >, boost::no_property> > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, long int> > >::value’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied, long unsigned int, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator >, boost::no_property>*, std::vector >, boost::no_property>, std::allocator >, boost::no_property> > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, long int> > >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_, long unsigned int, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator >, boost::no_property>*, std::vector >, boost::no_property>, std::allocator >, boost::no_property> > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, long int> >)>’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/range/concepts.hpp:278:9: [ skipping 9 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/isomorphism.hpp:651:42: required from ‘bool boost::graph::detail::isomorphism_impl::operator()(const Graph1&, const Graph2&, const ArgPack&) const [with ArgPack = boost::parameter::aux::empty_arg_list; Graph1 = boost::adjacency_list; Graph2 = boost::adjacency_list]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/isomorphism.hpp:662:5: required from ‘typename boost::result_of(Param0, Param1, const ArgPack&)>::type boost::graph::isomorphism_with_named_params(const Param0&, const Param1&, const ArgPack&) [with Param0 = boost::adjacency_list; Param1 = boost::adjacency_list; ArgPack = boost::parameter::aux::empty_arg_list; typename boost::result_of(Param0, Param1, const ArgPack&)>::type = bool]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/isomorphism.hpp:666:1: required from ‘typename boost::result_of(Param0, Param1, const boost::parameter::aux::empty_arg_list&)>::type boost::isomorphism(const Param0&, const Param1&) [with Param0 = adjacency_list; Param1 = adjacency_list; typename result_of(Param0, Param1, const parameter::aux::empty_arg_list&)>::type = bool]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/is_kuratowski_subgraph.hpp:278:34: required from ‘bool boost::is_kuratowski_subgraph(const Graph&, ForwardIterator, ForwardIterator, VertexIndexMap) [with Graph = adjacency_list, property >; ForwardIterator = __gnu_cxx::__normal_iterator*, std::vector > >; VertexIndexMap = vec_adj_list_vertex_id_map, long unsigned int>]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/is_kuratowski_subgraph.hpp:290:34: required from ‘bool boost::is_kuratowski_subgraph(const Graph&, ForwardIterator, ForwardIterator) [with Graph = adjacency_list, property >; ForwardIterator = __gnu_cxx::__normal_iterator*, std::vector > >]’ planar.cpp:435:37: required from here /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::Convertible::~Convertible() [with X = boost::iterators::detail::iterator_category_with_traversal; Y = boost::iterators::single_pass_traversal_tag]’ 37 | ~model() | ^ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:208:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 208 | BOOST_CONCEPT_USAGE(Convertible) { | ^~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements, long unsigned int, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator >, boost::no_property>*, std::vector >, boost::no_property>, std::allocator >, boost::no_property> > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, long int> > >]’: /home/omnipath/local/R/4.4-3.20/BH/include/boost/range/concepts.hpp:158:13: required from ‘struct boost::range_detail::SinglePassIteratorConcept, long unsigned int, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator >, boost::no_property>*, std::vector >, boost::no_property>, std::allocator >, boost::no_property> > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, long int> >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::range_detail::SinglePassIteratorConcept, long unsigned int, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator >, boost::no_property>*, std::vector >, boost::no_property>, std::allocator >, boost::no_property> > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, long int> >]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied, long unsigned int, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator >, boost::no_property>*, std::vector >, boost::no_property>, std::allocator >, boost::no_property> > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, long int> > >::value’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied, long unsigned int, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator >, boost::no_property>*, std::vector >, boost::no_property>, std::allocator >, boost::no_property> > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, long int> > >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_, long unsigned int, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator >, boost::no_property>*, std::vector >, boost::no_property>, std::allocator >, boost::no_property> > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, long int> >)>’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/range/concepts.hpp:278:9: [ skipping 9 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/isomorphism.hpp:651:42: required from ‘bool boost::graph::detail::isomorphism_impl::operator()(const Graph1&, const Graph2&, const ArgPack&) const [with ArgPack = boost::parameter::aux::empty_arg_list; Graph1 = boost::adjacency_list; Graph2 = boost::adjacency_list]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/isomorphism.hpp:662:5: required from ‘typename boost::result_of(Param0, Param1, const ArgPack&)>::type boost::graph::isomorphism_with_named_params(const Param0&, const Param1&, const ArgPack&) [with Param0 = boost::adjacency_list; Param1 = boost::adjacency_list; ArgPack = boost::parameter::aux::empty_arg_list; typename boost::result_of(Param0, Param1, const ArgPack&)>::type = bool]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/isomorphism.hpp:666:1: required from ‘typename boost::result_of(Param0, Param1, const boost::parameter::aux::empty_arg_list&)>::type boost::isomorphism(const Param0&, const Param1&) [with Param0 = adjacency_list; Param1 = adjacency_list; typename result_of(Param0, Param1, const parameter::aux::empty_arg_list&)>::type = bool]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/is_kuratowski_subgraph.hpp:278:34: required from ‘bool boost::is_kuratowski_subgraph(const Graph&, ForwardIterator, ForwardIterator, VertexIndexMap) [with Graph = adjacency_list, property >; ForwardIterator = __gnu_cxx::__normal_iterator*, std::vector > >; VertexIndexMap = vec_adj_list_vertex_id_map, long unsigned int>]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/is_kuratowski_subgraph.hpp:290:34: required from ‘bool boost::is_kuratowski_subgraph(const Graph&, ForwardIterator, ForwardIterator) [with Graph = adjacency_list, property >; ForwardIterator = __gnu_cxx::__normal_iterator*, std::vector > >]’ planar.cpp:435:37: required from here /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::range_detail::SinglePassIteratorConcept, long unsigned int, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator >, boost::no_property>*, std::vector >, boost::no_property>, std::allocator >, boost::no_property> > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, long int> >]’ 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ^ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::range_detail::SinglePassIteratorConcept, long unsigned int, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator >, boost::no_property>*, std::vector >, boost::no_property>, std::allocator >, boost::no_property> > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, long int> >]’: /home/omnipath/local/R/4.4-3.20/BH/include/boost/range/concepts.hpp:278:9: required from ‘struct boost::SinglePassRangeConcept, long unsigned int, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator >, boost::no_property>*, std::vector >, boost::no_property>, std::allocator >, boost::no_property> > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, long int>, boost::adjacency_iterator, long unsigned int, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator >, boost::no_property>*, std::vector >, boost::no_property>, std::allocator >, boost::no_property> > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, long int> > >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::SinglePassRangeConcept, long unsigned int, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator >, boost::no_property>*, std::vector >, boost::no_property>, std::allocator >, boost::no_property> > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, long int>, boost::adjacency_iterator, long unsigned int, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator >, boost::no_property>*, std::vector >, boost::no_property>, std::allocator >, boost::no_property> > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, long int> > >]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied, long unsigned int, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator >, boost::no_property>*, std::vector >, boost::no_property>, std::allocator >, boost::no_property> > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, long int>, boost::adjacency_iterator, long unsigned int, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator >, boost::no_property>*, std::vector >, boost::no_property>, std::allocator >, boost::no_property> > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, long int> > > >::value’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied, long unsigned int, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator >, boost::no_property>*, std::vector >, boost::no_property>, std::allocator >, boost::no_property> > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, long int>, boost::adjacency_iterator, long unsigned int, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator >, boost::no_property>*, std::vector >, boost::no_property>, std::allocator >, boost::no_property> > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, long int> > > >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_, long unsigned int, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator >, boost::no_property>*, std::vector >, boost::no_property>, std::allocator >, boost::no_property> > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, long int>, boost::adjacency_iterator, long unsigned int, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator >, boost::no_property>*, std::vector >, boost::no_property>, std::allocator >, boost::no_property> > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, long int> > >)>’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/range/algorithm/equal.hpp:174:13: [ skipping 4 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/isomorphism.hpp:651:42: required from ‘bool boost::graph::detail::isomorphism_impl::operator()(const Graph1&, const Graph2&, const ArgPack&) const [with ArgPack = boost::parameter::aux::empty_arg_list; Graph1 = boost::adjacency_list; Graph2 = boost::adjacency_list]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/isomorphism.hpp:662:5: required from ‘typename boost::result_of(Param0, Param1, const ArgPack&)>::type boost::graph::isomorphism_with_named_params(const Param0&, const Param1&, const ArgPack&) [with Param0 = boost::adjacency_list; Param1 = boost::adjacency_list; ArgPack = boost::parameter::aux::empty_arg_list; typename boost::result_of(Param0, Param1, const ArgPack&)>::type = bool]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/isomorphism.hpp:666:1: required from ‘typename boost::result_of(Param0, Param1, const boost::parameter::aux::empty_arg_list&)>::type boost::isomorphism(const Param0&, const Param1&) [with Param0 = adjacency_list; Param1 = adjacency_list; typename result_of(Param0, Param1, const parameter::aux::empty_arg_list&)>::type = bool]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/is_kuratowski_subgraph.hpp:278:34: required from ‘bool boost::is_kuratowski_subgraph(const Graph&, ForwardIterator, ForwardIterator, VertexIndexMap) [with Graph = adjacency_list, property >; ForwardIterator = __gnu_cxx::__normal_iterator*, std::vector > >; VertexIndexMap = vec_adj_list_vertex_id_map, long unsigned int>]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/is_kuratowski_subgraph.hpp:290:34: required from ‘bool boost::is_kuratowski_subgraph(const Graph&, ForwardIterator, ForwardIterator) [with Graph = adjacency_list, property >; ForwardIterator = __gnu_cxx::__normal_iterator*, std::vector > >]’ planar.cpp:435:37: required from here /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::range_detail::SinglePassIteratorConcept::~SinglePassIteratorConcept() [with Iterator = boost::adjacency_iterator, long unsigned int, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator >, boost::no_property>*, std::vector >, boost::no_property>, std::allocator >, boost::no_property> > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, long int>]’ 37 | ~model() | ^ /home/omnipath/local/R/4.4-3.20/BH/include/boost/range/concepts.hpp:158:13: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 158 | BOOST_CONCEPT_USAGE(SinglePassIteratorConcept) | ^~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements, long unsigned int, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator >, boost::no_property>*, std::vector >, boost::no_property>, std::allocator >, boost::no_property> > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, long int>, boost::adjacency_iterator, long unsigned int, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator >, boost::no_property>*, std::vector >, boost::no_property>, std::allocator >, boost::no_property> > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, long int> > > >]’: /home/omnipath/local/R/4.4-3.20/BH/include/boost/range/concepts.hpp:284:9: required from ‘struct boost::SinglePassRangeConcept, long unsigned int, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator >, boost::no_property>*, std::vector >, boost::no_property>, std::allocator >, boost::no_property> > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, long int>, boost::adjacency_iterator, long unsigned int, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator >, boost::no_property>*, std::vector >, boost::no_property>, std::allocator >, boost::no_property> > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, long int> > >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::SinglePassRangeConcept, long unsigned int, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator >, boost::no_property>*, std::vector >, boost::no_property>, std::allocator >, boost::no_property> > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, long int>, boost::adjacency_iterator, long unsigned int, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator >, boost::no_property>*, std::vector >, boost::no_property>, std::allocator >, boost::no_property> > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, long int> > >]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied, long unsigned int, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator >, boost::no_property>*, std::vector >, boost::no_property>, std::allocator >, boost::no_property> > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, long int>, boost::adjacency_iterator, long unsigned int, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator >, boost::no_property>*, std::vector >, boost::no_property>, std::allocator >, boost::no_property> > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, long int> > > >::value’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied, long unsigned int, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator >, boost::no_property>*, std::vector >, boost::no_property>, std::allocator >, boost::no_property> > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, long int>, boost::adjacency_iterator, long unsigned int, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator >, boost::no_property>*, std::vector >, boost::no_property>, std::allocator >, boost::no_property> > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, long int> > > >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_, long unsigned int, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator >, boost::no_property>*, std::vector >, boost::no_property>, std::allocator >, boost::no_property> > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, long int>, boost::adjacency_iterator, long unsigned int, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator >, boost::no_property>*, std::vector >, boost::no_property>, std::allocator >, boost::no_property> > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, long int> > >)>’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/range/algorithm/equal.hpp:174:13: [ skipping 4 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/isomorphism.hpp:651:42: required from ‘bool boost::graph::detail::isomorphism_impl::operator()(const Graph1&, const Graph2&, const ArgPack&) const [with ArgPack = boost::parameter::aux::empty_arg_list; Graph1 = boost::adjacency_list; Graph2 = boost::adjacency_list]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/isomorphism.hpp:662:5: required from ‘typename boost::result_of(Param0, Param1, const ArgPack&)>::type boost::graph::isomorphism_with_named_params(const Param0&, const Param1&, const ArgPack&) [with Param0 = boost::adjacency_list; Param1 = boost::adjacency_list; ArgPack = boost::parameter::aux::empty_arg_list; typename boost::result_of(Param0, Param1, const ArgPack&)>::type = bool]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/isomorphism.hpp:666:1: required from ‘typename boost::result_of(Param0, Param1, const boost::parameter::aux::empty_arg_list&)>::type boost::isomorphism(const Param0&, const Param1&) [with Param0 = adjacency_list; Param1 = adjacency_list; typename result_of(Param0, Param1, const parameter::aux::empty_arg_list&)>::type = bool]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/is_kuratowski_subgraph.hpp:278:34: required from ‘bool boost::is_kuratowski_subgraph(const Graph&, ForwardIterator, ForwardIterator, VertexIndexMap) [with Graph = adjacency_list, property >; ForwardIterator = __gnu_cxx::__normal_iterator*, std::vector > >; VertexIndexMap = vec_adj_list_vertex_id_map, long unsigned int>]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/is_kuratowski_subgraph.hpp:290:34: required from ‘bool boost::is_kuratowski_subgraph(const Graph&, ForwardIterator, ForwardIterator) [with Graph = adjacency_list, property >; ForwardIterator = __gnu_cxx::__normal_iterator*, std::vector > >]’ planar.cpp:435:37: required from here /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::SinglePassRangeConcept, long unsigned int, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator >, boost::no_property>*, std::vector >, boost::no_property>, std::allocator >, boost::no_property> > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, long int>, boost::adjacency_iterator, long unsigned int, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator >, boost::no_property>*, std::vector >, boost::no_property>, std::allocator >, boost::no_property> > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, long int> > >]’ 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ^ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::SinglePassRangeConcept, long unsigned int, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator >, boost::no_property>*, std::vector >, boost::no_property>, std::allocator >, boost::no_property> > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, long int>, boost::adjacency_iterator, long unsigned int, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator >, boost::no_property>*, std::vector >, boost::no_property>, std::allocator >, boost::no_property> > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, long int> > >]’: /home/omnipath/local/R/4.4-3.20/BH/include/boost/range/algorithm/equal.hpp:174:13: required from ‘typename boost::range_difference::type boost::range::count_if(const SinglePassRange&, UnaryPredicate) [with SinglePassRange = std::pair, long unsigned int, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator >, boost::no_property>*, std::vector >, boost::no_property>, std::allocator >, boost::no_property> > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, long int>, boost::adjacency_iterator, long unsigned int, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator >, boost::no_property>*, std::vector >, boost::no_property>, std::allocator >, boost::no_property> > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, long int> >; UnaryPredicate = boost::indirect_pmap >, boost::vec_adj_list_vertex_id_map, char, char&> >; typename boost::range_difference::type = long int]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/isomorphism.hpp:304:51: required from ‘bool boost::detail::isomorphism_algo::match(edge_iter, int) [with Graph1 = boost::adjacency_list; Graph2 = boost::adjacency_list; IsoMapping = boost::shared_array_property_map >; Invariant1 = boost::degree_vertex_invariant >, boost::adjacency_list >; Invariant2 = boost::degree_vertex_invariant >, boost::adjacency_list >; IndexMap1 = boost::vec_adj_list_vertex_id_map; IndexMap2 = boost::vec_adj_list_vertex_id_map; edge_iter = std::vector >::iterator]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/isomorphism.hpp:229:26: required from ‘bool boost::detail::isomorphism_algo::test_isomorphism() [with Graph1 = boost::adjacency_list; Graph2 = boost::adjacency_list; IsoMapping = boost::shared_array_property_map >; Invariant1 = boost::degree_vertex_invariant >, boost::adjacency_list >; Invariant2 = boost::degree_vertex_invariant >, boost::adjacency_list >; IndexMap1 = boost::vec_adj_list_vertex_id_map; IndexMap2 = boost::vec_adj_list_vertex_id_map]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/isomorphism.hpp:532:33: required from ‘bool boost::isomorphism(const Graph1&, const Graph2&, IsoMapping, Invariant1, Invariant2, std::size_t, IndexMap1, IndexMap2) [with Graph1 = adjacency_list; Graph2 = adjacency_list; IsoMapping = shared_array_property_map >; Invariant1 = degree_vertex_invariant >, adjacency_list >; Invariant2 = degree_vertex_invariant >, adjacency_list >; IndexMap1 = vec_adj_list_vertex_id_map; IndexMap2 = vec_adj_list_vertex_id_map; std::size_t = long unsigned int]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/isomorphism.hpp:651:42: required from ‘bool boost::graph::detail::isomorphism_impl::operator()(const Graph1&, const Graph2&, const ArgPack&) const [with ArgPack = boost::parameter::aux::empty_arg_list; Graph1 = boost::adjacency_list; Graph2 = boost::adjacency_list]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/isomorphism.hpp:662:5: required from ‘typename boost::result_of(Param0, Param1, const ArgPack&)>::type boost::graph::isomorphism_with_named_params(const Param0&, const Param1&, const ArgPack&) [with Param0 = boost::adjacency_list; Param1 = boost::adjacency_list; ArgPack = boost::parameter::aux::empty_arg_list; typename boost::result_of(Param0, Param1, const ArgPack&)>::type = bool]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/isomorphism.hpp:666:1: required from ‘typename boost::result_of(Param0, Param1, const boost::parameter::aux::empty_arg_list&)>::type boost::isomorphism(const Param0&, const Param1&) [with Param0 = adjacency_list; Param1 = adjacency_list; typename result_of(Param0, Param1, const parameter::aux::empty_arg_list&)>::type = bool]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/is_kuratowski_subgraph.hpp:278:34: required from ‘bool boost::is_kuratowski_subgraph(const Graph&, ForwardIterator, ForwardIterator, VertexIndexMap) [with Graph = adjacency_list, property >; ForwardIterator = __gnu_cxx::__normal_iterator*, std::vector > >; VertexIndexMap = vec_adj_list_vertex_id_map, long unsigned int>]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/is_kuratowski_subgraph.hpp:290:34: required from ‘bool boost::is_kuratowski_subgraph(const Graph&, ForwardIterator, ForwardIterator) [with Graph = adjacency_list, property >; ForwardIterator = __gnu_cxx::__normal_iterator*, std::vector > >]’ planar.cpp:435:37: required from here /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::SinglePassRangeConcept::~SinglePassRangeConcept() [with T = const std::pair, long unsigned int, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator >, boost::no_property>*, std::vector >, boost::no_property>, std::allocator >, boost::no_property> > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, long int>, boost::adjacency_iterator, long unsigned int, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator >, boost::no_property>*, std::vector >, boost::no_property>, std::allocator >, boost::no_property> > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, long int> >]’ 37 | ~model() | ^ /home/omnipath/local/R/4.4-3.20/BH/include/boost/range/concepts.hpp:284:9: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 284 | BOOST_CONCEPT_USAGE(SinglePassRangeConcept) | ^~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements > >]’: /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:167:5: required from ‘struct boost::CopyConstructible >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:165:3: required from ‘struct boost::CopyConstructibleConcept >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::CopyConstructibleConcept >]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied > >::value’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied > >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:72:8: [ skipping 9 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/depth_first_search.hpp:409:1: required from ‘typename boost::result_of(Param0, const typename boost::detail::convert_bgl_params_to_boost_parameter >::type&)>::type boost::depth_first_search(const Param0&, const bgl_named_params&) [with Param0 = filtered_graph, keep_all, maximum_cardinality_matching_verifier, long unsigned int*, vec_adj_list_vertex_id_map, long unsigned int> >::non_odd_vertex >, vec_adj_list_vertex_id_map, long unsigned int>, int, int&> > >; P = vec_adj_list_vertex_id_map, long unsigned int>; T = vertex_index_t; R = bgl_named_params, graph_visitor_t, no_property>; typename result_of(Param0, const typename detail::convert_bgl_params_to_boost_parameter >::type&)>::type = void; typename detail::convert_bgl_params_to_boost_parameter >::type = parameter::aux::arg_list, long unsigned int> >, parameter::aux::arg_list >, parameter::aux::empty_arg_list, std::integral_constant >, std::integral_constant >]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/max_cardinality_matching.hpp:779:27: required from ‘static bool boost::maximum_cardinality_matching_verifier::verify_matching(const Graph&, MateMap, VertexIndexMap) [with Graph = R_adjacency_list; MateMap = long unsigned int*; VertexIndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/max_cardinality_matching.hpp:807:79: required from ‘bool boost::matching(const Graph&, MateMap, VertexIndexMap) [with Graph = R_adjacency_list; MateMap = long unsigned int*; VertexIndexMap = vec_adj_list_vertex_id_map, long unsigned int>; AugmentingPathFinder = edmonds_augmenting_path_finder; InitialMatchingFinder = extra_greedy_matching; MatchingVerifier = maximum_cardinality_matching_verifier]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/max_cardinality_matching.hpp:817:48: required from ‘bool boost::checked_edmonds_maximum_cardinality_matching(const Graph&, MateMap, VertexIndexMap) [with Graph = R_adjacency_list; MateMap = long unsigned int*; VertexIndexMap = vec_adj_list_vertex_id_map, long unsigned int>]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/max_cardinality_matching.hpp:824:56: required from ‘bool boost::checked_edmonds_maximum_cardinality_matching(const Graph&, MateMap) [with Graph = R_adjacency_list; MateMap = long unsigned int*]’ planar.cpp:686:60: required from here /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::CopyConstructible >]’ 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ^ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::CopyConstructibleConcept >]’: /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/depth_first_search.hpp:41:9: required from ‘void boost::DFSVisitorConcept::constraints() [with Visitor = boost::detail::odd_components_counter; Graph = boost::filtered_graph, boost::keep_all, boost::maximum_cardinality_matching_verifier, long unsigned int*, boost::vec_adj_list_vertex_id_map, long unsigned int> >::non_odd_vertex >, boost::vec_adj_list_vertex_id_map, long unsigned int>, int, int&> > >]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::DFSVisitorConcept, boost::filtered_graph, boost::keep_all, boost::maximum_cardinality_matching_verifier, long unsigned int*, boost::vec_adj_list_vertex_id_map, long unsigned int> >::non_odd_vertex >, boost::vec_adj_list_vertex_id_map, long unsigned int>, int, int&> > > >]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied, boost::filtered_graph, boost::keep_all, boost::maximum_cardinality_matching_verifier, long unsigned int*, boost::vec_adj_list_vertex_id_map, long unsigned int> >::non_odd_vertex >, boost::vec_adj_list_vertex_id_map, long unsigned int>, int, int&> > > > >::value’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied, boost::filtered_graph, boost::keep_all, boost::maximum_cardinality_matching_verifier, long unsigned int*, boost::vec_adj_list_vertex_id_map, long unsigned int> >::non_odd_vertex >, boost::vec_adj_list_vertex_id_map, long unsigned int>, int, int&> > > > >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_, boost::filtered_graph, boost::keep_all, boost::maximum_cardinality_matching_verifier, long unsigned int*, boost::vec_adj_list_vertex_id_map, long unsigned int> >::non_odd_vertex >, boost::vec_adj_list_vertex_id_map, long unsigned int>, int, int&> > > >)>’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/depth_first_search.hpp:130:9: [ skipping 3 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/depth_first_search.hpp:409:1: required from ‘typename boost::result_of(Param0, const typename boost::detail::convert_bgl_params_to_boost_parameter >::type&)>::type boost::depth_first_search(const Param0&, const bgl_named_params&) [with Param0 = filtered_graph, keep_all, maximum_cardinality_matching_verifier, long unsigned int*, vec_adj_list_vertex_id_map, long unsigned int> >::non_odd_vertex >, vec_adj_list_vertex_id_map, long unsigned int>, int, int&> > >; P = vec_adj_list_vertex_id_map, long unsigned int>; T = vertex_index_t; R = bgl_named_params, graph_visitor_t, no_property>; typename result_of(Param0, const typename detail::convert_bgl_params_to_boost_parameter >::type&)>::type = void; typename detail::convert_bgl_params_to_boost_parameter >::type = parameter::aux::arg_list, long unsigned int> >, parameter::aux::arg_list >, parameter::aux::empty_arg_list, std::integral_constant >, std::integral_constant >]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/max_cardinality_matching.hpp:779:27: required from ‘static bool boost::maximum_cardinality_matching_verifier::verify_matching(const Graph&, MateMap, VertexIndexMap) [with Graph = R_adjacency_list; MateMap = long unsigned int*; VertexIndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/max_cardinality_matching.hpp:807:79: required from ‘bool boost::matching(const Graph&, MateMap, VertexIndexMap) [with Graph = R_adjacency_list; MateMap = long unsigned int*; VertexIndexMap = vec_adj_list_vertex_id_map, long unsigned int>; AugmentingPathFinder = edmonds_augmenting_path_finder; InitialMatchingFinder = extra_greedy_matching; MatchingVerifier = maximum_cardinality_matching_verifier]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/max_cardinality_matching.hpp:817:48: required from ‘bool boost::checked_edmonds_maximum_cardinality_matching(const Graph&, MateMap, VertexIndexMap) [with Graph = R_adjacency_list; MateMap = long unsigned int*; VertexIndexMap = vec_adj_list_vertex_id_map, long unsigned int>]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/max_cardinality_matching.hpp:824:56: required from ‘bool boost::checked_edmonds_maximum_cardinality_matching(const Graph&, MateMap) [with Graph = R_adjacency_list; MateMap = long unsigned int*]’ planar.cpp:686:60: required from here /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:165:17: note: in a call to non-static member function ‘boost::CopyConstructibleConcept >::~CopyConstructibleConcept()’ 165 | BOOST_concept(CopyConstructible,(TT)) | ^~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/preprocessor/cat.hpp:29:34: note: in definition of macro ‘BOOST_PP_CAT_I’ 29 | # define BOOST_PP_CAT_I(a, b) a ## b | ^ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/concept_def.hpp:23:12: note: in expansion of macro ‘BOOST_PP_CAT’ 23 | struct BOOST_PP_CAT(name,Concept) \ | ^~~~~~~~~~~~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:165:3: note: in expansion of macro ‘BOOST_concept’ 165 | BOOST_concept(CopyConstructible,(TT)) | ^~~~~~~~~~~~~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements, boost::keep_all, boost::maximum_cardinality_matching_verifier, long unsigned int*, boost::vec_adj_list_vertex_id_map, long unsigned int> >::non_odd_vertex >, boost::vec_adj_list_vertex_id_map, long unsigned int>, int, int&> > > > >]’: /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/graph_concepts.hpp:66:5: required from ‘struct boost::concepts::Graph, boost::keep_all, boost::maximum_cardinality_matching_verifier, long unsigned int*, boost::vec_adj_list_vertex_id_map, long unsigned int> >::non_odd_vertex >, boost::vec_adj_list_vertex_id_map, long unsigned int>, int, int&> > > >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/graph_concepts.hpp:75:1: required from ‘struct boost::concepts::IncidenceGraph, boost::keep_all, boost::maximum_cardinality_matching_verifier, long unsigned int*, boost::vec_adj_list_vertex_id_map, long unsigned int> >::non_odd_vertex >, boost::vec_adj_list_vertex_id_map, long unsigned int>, int, int&> > > >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/graph_concepts.hpp:75:1: required from ‘struct boost::concepts::IncidenceGraphConcept, boost::keep_all, boost::maximum_cardinality_matching_verifier, long unsigned int*, boost::vec_adj_list_vertex_id_map, long unsigned int> >::non_odd_vertex >, boost::vec_adj_list_vertex_id_map, long unsigned int>, int, int&> > > >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::concepts::IncidenceGraphConcept, boost::keep_all, boost::maximum_cardinality_matching_verifier, long unsigned int*, boost::vec_adj_list_vertex_id_map, long unsigned int> >::non_odd_vertex >, boost::vec_adj_list_vertex_id_map, long unsigned int>, int, int&> > > >]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied, boost::keep_all, boost::maximum_cardinality_matching_verifier, long unsigned int*, boost::vec_adj_list_vertex_id_map, long unsigned int> >::non_odd_vertex >, boost::vec_adj_list_vertex_id_map, long unsigned int>, int, int&> > > > >::value’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:45:51: [ skipping 6 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/depth_first_search.hpp:409:1: required from ‘typename boost::result_of(Param0, const typename boost::detail::convert_bgl_params_to_boost_parameter >::type&)>::type boost::depth_first_search(const Param0&, const bgl_named_params&) [with Param0 = filtered_graph, keep_all, maximum_cardinality_matching_verifier, long unsigned int*, vec_adj_list_vertex_id_map, long unsigned int> >::non_odd_vertex >, vec_adj_list_vertex_id_map, long unsigned int>, int, int&> > >; P = vec_adj_list_vertex_id_map, long unsigned int>; T = vertex_index_t; R = bgl_named_params, graph_visitor_t, no_property>; typename result_of(Param0, const typename detail::convert_bgl_params_to_boost_parameter >::type&)>::type = void; typename detail::convert_bgl_params_to_boost_parameter >::type = parameter::aux::arg_list, long unsigned int> >, parameter::aux::arg_list >, parameter::aux::empty_arg_list, std::integral_constant >, std::integral_constant >]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/max_cardinality_matching.hpp:779:27: required from ‘static bool boost::maximum_cardinality_matching_verifier::verify_matching(const Graph&, MateMap, VertexIndexMap) [with Graph = R_adjacency_list; MateMap = long unsigned int*; VertexIndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/max_cardinality_matching.hpp:807:79: required from ‘bool boost::matching(const Graph&, MateMap, VertexIndexMap) [with Graph = R_adjacency_list; MateMap = long unsigned int*; VertexIndexMap = vec_adj_list_vertex_id_map, long unsigned int>; AugmentingPathFinder = edmonds_augmenting_path_finder; InitialMatchingFinder = extra_greedy_matching; MatchingVerifier = maximum_cardinality_matching_verifier]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/max_cardinality_matching.hpp:817:48: required from ‘bool boost::checked_edmonds_maximum_cardinality_matching(const Graph&, MateMap, VertexIndexMap) [with Graph = R_adjacency_list; MateMap = long unsigned int*; VertexIndexMap = vec_adj_list_vertex_id_map, long unsigned int>]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/max_cardinality_matching.hpp:824:56: required from ‘bool boost::checked_edmonds_maximum_cardinality_matching(const Graph&, MateMap) [with Graph = R_adjacency_list; MateMap = long unsigned int*]’ planar.cpp:686:60: required from here /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::concepts::Graph, boost::keep_all, boost::maximum_cardinality_matching_verifier, long unsigned int*, boost::vec_adj_list_vertex_id_map, long unsigned int> >::non_odd_vertex >, boost::vec_adj_list_vertex_id_map, long unsigned int>, int, int&> > > >]’ 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ^ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements, boost::keep_all, boost::maximum_cardinality_matching_verifier, long unsigned int*, boost::vec_adj_list_vertex_id_map, long unsigned int> >::non_odd_vertex >, boost::vec_adj_list_vertex_id_map, long unsigned int>, int, int&> > > > >]’: /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/graph_concepts.hpp:87:5: required from ‘struct boost::concepts::IncidenceGraph, boost::keep_all, boost::maximum_cardinality_matching_verifier, long unsigned int*, boost::vec_adj_list_vertex_id_map, long unsigned int> >::non_odd_vertex >, boost::vec_adj_list_vertex_id_map, long unsigned int>, int, int&> > > >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/graph_concepts.hpp:75:1: required from ‘struct boost::concepts::IncidenceGraphConcept, boost::keep_all, boost::maximum_cardinality_matching_verifier, long unsigned int*, boost::vec_adj_list_vertex_id_map, long unsigned int> >::non_odd_vertex >, boost::vec_adj_list_vertex_id_map, long unsigned int>, int, int&> > > >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::concepts::IncidenceGraphConcept, boost::keep_all, boost::maximum_cardinality_matching_verifier, long unsigned int*, boost::vec_adj_list_vertex_id_map, long unsigned int> >::non_odd_vertex >, boost::vec_adj_list_vertex_id_map, long unsigned int>, int, int&> > > >]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied, boost::keep_all, boost::maximum_cardinality_matching_verifier, long unsigned int*, boost::vec_adj_list_vertex_id_map, long unsigned int> >::non_odd_vertex >, boost::vec_adj_list_vertex_id_map, long unsigned int>, int, int&> > > > >::value’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied, boost::keep_all, boost::maximum_cardinality_matching_verifier, long unsigned int*, boost::vec_adj_list_vertex_id_map, long unsigned int> >::non_odd_vertex >, boost::vec_adj_list_vertex_id_map, long unsigned int>, int, int&> > > > >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:72:8: [ skipping 5 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/depth_first_search.hpp:409:1: required from ‘typename boost::result_of(Param0, const typename boost::detail::convert_bgl_params_to_boost_parameter >::type&)>::type boost::depth_first_search(const Param0&, const bgl_named_params&) [with Param0 = filtered_graph, keep_all, maximum_cardinality_matching_verifier, long unsigned int*, vec_adj_list_vertex_id_map, long unsigned int> >::non_odd_vertex >, vec_adj_list_vertex_id_map, long unsigned int>, int, int&> > >; P = vec_adj_list_vertex_id_map, long unsigned int>; T = vertex_index_t; R = bgl_named_params, graph_visitor_t, no_property>; typename result_of(Param0, const typename detail::convert_bgl_params_to_boost_parameter >::type&)>::type = void; typename detail::convert_bgl_params_to_boost_parameter >::type = parameter::aux::arg_list, long unsigned int> >, parameter::aux::arg_list >, parameter::aux::empty_arg_list, std::integral_constant >, std::integral_constant >]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/max_cardinality_matching.hpp:779:27: required from ‘static bool boost::maximum_cardinality_matching_verifier::verify_matching(const Graph&, MateMap, VertexIndexMap) [with Graph = R_adjacency_list; MateMap = long unsigned int*; VertexIndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/max_cardinality_matching.hpp:807:79: required from ‘bool boost::matching(const Graph&, MateMap, VertexIndexMap) [with Graph = R_adjacency_list; MateMap = long unsigned int*; VertexIndexMap = vec_adj_list_vertex_id_map, long unsigned int>; AugmentingPathFinder = edmonds_augmenting_path_finder; InitialMatchingFinder = extra_greedy_matching; MatchingVerifier = maximum_cardinality_matching_verifier]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/max_cardinality_matching.hpp:817:48: required from ‘bool boost::checked_edmonds_maximum_cardinality_matching(const Graph&, MateMap, VertexIndexMap) [with Graph = R_adjacency_list; MateMap = long unsigned int*; VertexIndexMap = vec_adj_list_vertex_id_map, long unsigned int>]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/max_cardinality_matching.hpp:824:56: required from ‘bool boost::checked_edmonds_maximum_cardinality_matching(const Graph&, MateMap) [with Graph = R_adjacency_list; MateMap = long unsigned int*]’ planar.cpp:686:60: required from here /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::concepts::IncidenceGraph, boost::keep_all, boost::maximum_cardinality_matching_verifier, long unsigned int*, boost::vec_adj_list_vertex_id_map, long unsigned int> >::non_odd_vertex >, boost::vec_adj_list_vertex_id_map, long unsigned int>, int, int&> > > >]’ 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ^ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::IncidenceGraphConcept, boost::keep_all, boost::maximum_cardinality_matching_verifier, long unsigned int*, boost::vec_adj_list_vertex_id_map, long unsigned int> >::non_odd_vertex >, boost::vec_adj_list_vertex_id_map, long unsigned int>, int, int&> > > >]’: /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/depth_first_search.hpp:129:9: required from ‘void boost::detail::depth_first_visit_impl(const IncidenceGraph&, typename boost::graph_traits::vertex_descriptor, DFSVisitor&, ColorMap, TerminatorFunc) [with IncidenceGraph = boost::filtered_graph, boost::keep_all, boost::maximum_cardinality_matching_verifier, long unsigned int*, boost::vec_adj_list_vertex_id_map, long unsigned int> >::non_odd_vertex >, boost::vec_adj_list_vertex_id_map, long unsigned int>, int, int&> > >; DFSVisitor = odd_components_counter; ColorMap = boost::shared_array_property_map, long unsigned int> >; TerminatorFunc = nontruth2; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/depth_first_search.hpp:286:39: required from ‘void boost::depth_first_search(const VertexListGraph&, DFSVisitor, ColorMap, typename graph_traits::vertex_descriptor) [with VertexListGraph = filtered_graph, keep_all, maximum_cardinality_matching_verifier, long unsigned int*, vec_adj_list_vertex_id_map, long unsigned int> >::non_odd_vertex >, vec_adj_list_vertex_id_map, long unsigned int>, int, int&> > >; DFSVisitor = detail::odd_components_counter; ColorMap = shared_array_property_map, long unsigned int> >; typename graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/depth_first_search.hpp:397:42: required from ‘void boost::graph::detail::depth_first_search_impl::operator()(const Graph&, const ArgPack&) const [with ArgPack = boost::parameter::aux::arg_list, long unsigned int> >, boost::parameter::aux::arg_list >, boost::parameter::aux::empty_arg_list, std::integral_constant >, std::integral_constant >; Graph = boost::filtered_graph, boost::keep_all, boost::maximum_cardinality_matching_verifier, long unsigned int*, boost::vec_adj_list_vertex_id_map, long unsigned int> >::non_odd_vertex >, boost::vec_adj_list_vertex_id_map, long unsigned int>, int, int&> > >]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/depth_first_search.hpp:406:5: required from ‘typename boost::result_of(Param0, const ArgPack&)>::type boost::graph::depth_first_search_with_named_params(const Param0&, const ArgPack&) [with Param0 = boost::filtered_graph, boost::keep_all, boost::maximum_cardinality_matching_verifier, long unsigned int*, boost::vec_adj_list_vertex_id_map, long unsigned int> >::non_odd_vertex >, boost::vec_adj_list_vertex_id_map, long unsigned int>, int, int&> > >; ArgPack = boost::parameter::aux::arg_list, long unsigned int> >, boost::parameter::aux::arg_list >, boost::parameter::aux::empty_arg_list, std::integral_constant >, std::integral_constant >; typename boost::result_of(Param0, const ArgPack&)>::type = void]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/depth_first_search.hpp:409:1: required from ‘typename boost::result_of(Param0, const typename boost::detail::convert_bgl_params_to_boost_parameter >::type&)>::type boost::depth_first_search(const Param0&, const bgl_named_params&) [with Param0 = filtered_graph, keep_all, maximum_cardinality_matching_verifier, long unsigned int*, vec_adj_list_vertex_id_map, long unsigned int> >::non_odd_vertex >, vec_adj_list_vertex_id_map, long unsigned int>, int, int&> > >; P = vec_adj_list_vertex_id_map, long unsigned int>; T = vertex_index_t; R = bgl_named_params, graph_visitor_t, no_property>; typename result_of(Param0, const typename detail::convert_bgl_params_to_boost_parameter >::type&)>::type = void; typename detail::convert_bgl_params_to_boost_parameter >::type = parameter::aux::arg_list, long unsigned int> >, parameter::aux::arg_list >, parameter::aux::empty_arg_list, std::integral_constant >, std::integral_constant >]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/max_cardinality_matching.hpp:779:27: required from ‘static bool boost::maximum_cardinality_matching_verifier::verify_matching(const Graph&, MateMap, VertexIndexMap) [with Graph = R_adjacency_list; MateMap = long unsigned int*; VertexIndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/max_cardinality_matching.hpp:807:79: required from ‘bool boost::matching(const Graph&, MateMap, VertexIndexMap) [with Graph = R_adjacency_list; MateMap = long unsigned int*; VertexIndexMap = vec_adj_list_vertex_id_map, long unsigned int>; AugmentingPathFinder = edmonds_augmenting_path_finder; InitialMatchingFinder = extra_greedy_matching; MatchingVerifier = maximum_cardinality_matching_verifier]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/max_cardinality_matching.hpp:817:48: required from ‘bool boost::checked_edmonds_maximum_cardinality_matching(const Graph&, MateMap, VertexIndexMap) [with Graph = R_adjacency_list; MateMap = long unsigned int*; VertexIndexMap = vec_adj_list_vertex_id_map, long unsigned int>]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/max_cardinality_matching.hpp:824:56: required from ‘bool boost::checked_edmonds_maximum_cardinality_matching(const Graph&, MateMap) [with Graph = R_adjacency_list; MateMap = long unsigned int*]’ planar.cpp:686:60: required from here /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/graph_concepts.hpp:75:15: note: in a call to non-static member function ‘boost::concepts::IncidenceGraphConcept, boost::keep_all, boost::maximum_cardinality_matching_verifier, long unsigned int*, boost::vec_adj_list_vertex_id_map, long unsigned int> >::non_odd_vertex >, boost::vec_adj_list_vertex_id_map, long unsigned int>, int, int&> > > >::~IncidenceGraphConcept()’ 75 | BOOST_concept(IncidenceGraph, (G)) : Graph< G > | ^~~~~~~~~~~~~~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/preprocessor/cat.hpp:29:34: note: in definition of macro ‘BOOST_PP_CAT_I’ 29 | # define BOOST_PP_CAT_I(a, b) a ## b | ^ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/concept_def.hpp:23:12: note: in expansion of macro ‘BOOST_PP_CAT’ 23 | struct BOOST_PP_CAT(name,Concept) \ | ^~~~~~~~~~~~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/graph_concepts.hpp:75:1: note: in expansion of macro ‘BOOST_concept’ 75 | BOOST_concept(IncidenceGraph, (G)) : Graph< G > | ^~~~~~~~~~~~~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::constraint::failed() [with Model = boost::ReadWritePropertyMapConcept, long unsigned int> >, long unsigned int>]’: /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/depth_first_search.hpp:134:9: required from ‘void boost::detail::depth_first_visit_impl(const IncidenceGraph&, typename boost::graph_traits::vertex_descriptor, DFSVisitor&, ColorMap, TerminatorFunc) [with IncidenceGraph = boost::filtered_graph, boost::keep_all, boost::maximum_cardinality_matching_verifier, long unsigned int*, boost::vec_adj_list_vertex_id_map, long unsigned int> >::non_odd_vertex >, boost::vec_adj_list_vertex_id_map, long unsigned int>, int, int&> > >; DFSVisitor = odd_components_counter; ColorMap = boost::shared_array_property_map, long unsigned int> >; TerminatorFunc = nontruth2; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/depth_first_search.hpp:286:39: required from ‘void boost::depth_first_search(const VertexListGraph&, DFSVisitor, ColorMap, typename graph_traits::vertex_descriptor) [with VertexListGraph = filtered_graph, keep_all, maximum_cardinality_matching_verifier, long unsigned int*, vec_adj_list_vertex_id_map, long unsigned int> >::non_odd_vertex >, vec_adj_list_vertex_id_map, long unsigned int>, int, int&> > >; DFSVisitor = detail::odd_components_counter; ColorMap = shared_array_property_map, long unsigned int> >; typename graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/depth_first_search.hpp:397:42: required from ‘void boost::graph::detail::depth_first_search_impl::operator()(const Graph&, const ArgPack&) const [with ArgPack = boost::parameter::aux::arg_list, long unsigned int> >, boost::parameter::aux::arg_list >, boost::parameter::aux::empty_arg_list, std::integral_constant >, std::integral_constant >; Graph = boost::filtered_graph, boost::keep_all, boost::maximum_cardinality_matching_verifier, long unsigned int*, boost::vec_adj_list_vertex_id_map, long unsigned int> >::non_odd_vertex >, boost::vec_adj_list_vertex_id_map, long unsigned int>, int, int&> > >]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/depth_first_search.hpp:406:5: required from ‘typename boost::result_of(Param0, const ArgPack&)>::type boost::graph::depth_first_search_with_named_params(const Param0&, const ArgPack&) [with Param0 = boost::filtered_graph, boost::keep_all, boost::maximum_cardinality_matching_verifier, long unsigned int*, boost::vec_adj_list_vertex_id_map, long unsigned int> >::non_odd_vertex >, boost::vec_adj_list_vertex_id_map, long unsigned int>, int, int&> > >; ArgPack = boost::parameter::aux::arg_list, long unsigned int> >, boost::parameter::aux::arg_list >, boost::parameter::aux::empty_arg_list, std::integral_constant >, std::integral_constant >; typename boost::result_of(Param0, const ArgPack&)>::type = void]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/depth_first_search.hpp:409:1: required from ‘typename boost::result_of(Param0, const typename boost::detail::convert_bgl_params_to_boost_parameter >::type&)>::type boost::depth_first_search(const Param0&, const bgl_named_params&) [with Param0 = filtered_graph, keep_all, maximum_cardinality_matching_verifier, long unsigned int*, vec_adj_list_vertex_id_map, long unsigned int> >::non_odd_vertex >, vec_adj_list_vertex_id_map, long unsigned int>, int, int&> > >; P = vec_adj_list_vertex_id_map, long unsigned int>; T = vertex_index_t; R = bgl_named_params, graph_visitor_t, no_property>; typename result_of(Param0, const typename detail::convert_bgl_params_to_boost_parameter >::type&)>::type = void; typename detail::convert_bgl_params_to_boost_parameter >::type = parameter::aux::arg_list, long unsigned int> >, parameter::aux::arg_list >, parameter::aux::empty_arg_list, std::integral_constant >, std::integral_constant >]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/max_cardinality_matching.hpp:779:27: required from ‘static bool boost::maximum_cardinality_matching_verifier::verify_matching(const Graph&, MateMap, VertexIndexMap) [with Graph = R_adjacency_list; MateMap = long unsigned int*; VertexIndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/max_cardinality_matching.hpp:807:79: required from ‘bool boost::matching(const Graph&, MateMap, VertexIndexMap) [with Graph = R_adjacency_list; MateMap = long unsigned int*; VertexIndexMap = vec_adj_list_vertex_id_map, long unsigned int>; AugmentingPathFinder = edmonds_augmenting_path_finder; InitialMatchingFinder = extra_greedy_matching; MatchingVerifier = maximum_cardinality_matching_verifier]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/max_cardinality_matching.hpp:817:48: required from ‘bool boost::checked_edmonds_maximum_cardinality_matching(const Graph&, MateMap, VertexIndexMap) [with Graph = R_adjacency_list; MateMap = long unsigned int*; VertexIndexMap = vec_adj_list_vertex_id_map, long unsigned int>]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/max_cardinality_matching.hpp:824:56: required from ‘bool boost::checked_edmonds_maximum_cardinality_matching(const Graph&, MateMap) [with Graph = R_adjacency_list; MateMap = long unsigned int*]’ planar.cpp:686:60: required from here /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:65:52: warning: ‘this’ pointer is null [-Wnonnull] 65 | static void failed() { ((Model*)0)->constraints(); } | ~~~~~~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/property_map/property_map.hpp:205:10: note: in a call to non-static member function ‘void boost::ReadWritePropertyMapConcept::constraints() [with PMap = boost::shared_array_property_map, long unsigned int> >; Key = long unsigned int]’ 205 | void constraints() { | ^~~~~~~~~~~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::CopyConstructible >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>, boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>, boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>, boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>, boost::iterator_property_map<__gnu_cxx::__normal_iterator*, std::vector > >, boost::vec_adj_list_vertex_id_map, long unsigned int>, boost::detail::edge_desc_impl, boost::detail::edge_desc_impl&>, long unsigned int> >]’: /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>, boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>, boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>, boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>, boost::iterator_property_map<__gnu_cxx::__normal_iterator*, std::vector > >, boost::vec_adj_list_vertex_id_map, long unsigned int>, boost::detail::edge_desc_impl, boost::detail::edge_desc_impl&>, long unsigned int> > >]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:167:5: required from ‘struct boost::CopyConstructible >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>, boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>, boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>, boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>, boost::iterator_property_map<__gnu_cxx::__normal_iterator*, std::vector > >, boost::vec_adj_list_vertex_id_map, long unsigned int>, boost::detail::edge_desc_impl, boost::detail::edge_desc_impl&>, long unsigned int> >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:165:3: required from ‘struct boost::CopyConstructibleConcept >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>, boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>, boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>, boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>, boost::iterator_property_map<__gnu_cxx::__normal_iterator*, std::vector > >, boost::vec_adj_list_vertex_id_map, long unsigned int>, boost::detail::edge_desc_impl, boost::detail::edge_desc_impl&>, long unsigned int> >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::CopyConstructibleConcept >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>, boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>, boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>, boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>, boost::iterator_property_map<__gnu_cxx::__normal_iterator*, std::vector > >, boost::vec_adj_list_vertex_id_map, long unsigned int>, boost::detail::edge_desc_impl, boost::detail::edge_desc_impl&>, long unsigned int> >]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>, boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>, boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>, boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>, boost::iterator_property_map<__gnu_cxx::__normal_iterator*, std::vector > >, boost::vec_adj_list_vertex_id_map, long unsigned int>, boost::detail::edge_desc_impl, boost::detail::edge_desc_impl&>, long unsigned int> > >::value’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:45:51: [ skipping 10 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/depth_first_search.hpp:409:1: required from ‘typename boost::result_of(Param0, const typename boost::detail::convert_bgl_params_to_boost_parameter >::type&)>::type boost::depth_first_search(const Param0&, const bgl_named_params&) [with Param0 = adjacency_list, property >; P = vec_adj_list_vertex_id_map, long unsigned int>; T = vertex_index_t; R = bgl_named_params >, vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>, iterator_property_map<__gnu_cxx::__normal_iterator >, vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>, iterator_property_map<__gnu_cxx::__normal_iterator >, vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>, iterator_property_map<__gnu_cxx::__normal_iterator >, vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>, iterator_property_map<__gnu_cxx::__normal_iterator*, std::vector > >, vec_adj_list_vertex_id_map, long unsigned int>, detail::edge_desc_impl, detail::edge_desc_impl&>, long unsigned int>, graph_visitor_t, no_property>; typename result_of(Param0, const typename detail::convert_bgl_params_to_boost_parameter >::type&)>::type = void; typename detail::convert_bgl_params_to_boost_parameter >::type = parameter::aux::arg_list, long unsigned int> >, parameter::aux::arg_list >, vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>, iterator_property_map<__gnu_cxx::__normal_iterator >, vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>, iterator_property_map<__gnu_cxx::__normal_iterator >, vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>, iterator_property_map<__gnu_cxx::__normal_iterator >, vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>, iterator_property_map<__gnu_cxx::__normal_iterator*, std::vector > >, vec_adj_list_vertex_id_map, long unsigned int>, detail::edge_desc_impl, detail::edge_desc_impl&>, long unsigned int> >, parameter::aux::empty_arg_list, std::integral_constant >, std::integral_constant >]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/planar_detail/boyer_myrvold_impl.hpp:251:27: required from ‘boost::boyer_myrvold_impl::boyer_myrvold_impl(const Graph&, VertexIndexMap) [with Graph = boost::adjacency_list, boost::property >; VertexIndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>; StoreOldHandlesPolicy = boost::graph::detail::no_old_handles; StoreEmbeddingPolicy = boost::graph::detail::no_embedding]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/boyer_myrvold_planar_test.hpp:66:17: required from ‘bool boost::boyer_myrvold_params::core::dispatched_boyer_myrvold(const ArgumentPack&, mpl_::true_, mpl_::true_) [with ArgumentPack = boost::parameter::aux::flat_like_arg_list, boost::property, boost::no_property, boost::listS> > >, std::integral_constant > >; mpl_::true_ = mpl_::bool_]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/boyer_myrvold_planar_test.hpp:211:44: required from ‘bool boost::boyer_myrvold_params::core::boyer_myrvold_planarity_test(const ArgumentPack&) [with ArgumentPack = boost::parameter::aux::flat_like_arg_list, boost::property, boost::no_property, boost::listS> > >, std::integral_constant > >]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/boyer_myrvold_planar_test.hpp:223:68: required from ‘bool boost::boyer_myrvold_planarity_test(const A0&) [with A0 = adjacency_list, property >]’ planar.cpp:121:48: required from here /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::CopyConstructible::~CopyConstructible() [with TT = boost::planar_dfs_visitor >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>, boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>, boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>, boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>, boost::iterator_property_map<__gnu_cxx::__normal_iterator*, std::vector > >, boost::vec_adj_list_vertex_id_map, long unsigned int>, boost::detail::edge_desc_impl, boost::detail::edge_desc_impl&>, long unsigned int>]’ 37 | ~model() | ^ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:167:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 167 | BOOST_CONCEPT_USAGE(CopyConstructible) { | ^~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::concepts::MultiPassInputIterator > >, boost::property >*, std::vector > >, boost::property >, std::allocator > >, boost::property > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> >]’: /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements > >, boost::property >*, std::vector > >, boost::property >, std::allocator > >, boost::property > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/graph_concepts.hpp:52:50: required from ‘struct boost::concepts::MultiPassInputIterator > >, boost::property >*, std::vector > >, boost::property >, std::allocator > >, boost::property > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::concepts::MultiPassInputIterator > >, boost::property >*, std::vector > >, boost::property >, std::allocator > >, boost::property > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> >]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied > >, boost::property >*, std::vector > >, boost::property >, std::allocator > >, boost::property > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::value’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied > >, boost::property >*, std::vector > >, boost::property >, std::allocator > >, boost::property > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:72:8: [ skipping 5 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/depth_first_search.hpp:397:42: required from ‘void boost::graph::detail::depth_first_search_impl::operator()(const Graph&, const ArgPack&) const [with ArgPack = boost::parameter::aux::arg_list >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&> > >, boost::parameter::aux::empty_arg_list, std::integral_constant >; Graph = boost::adjacency_list, boost::property >]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/depth_first_search.hpp:406:5: required from ‘typename boost::result_of(Param0, const ArgPack&)>::type boost::graph::depth_first_search_with_named_params(const Param0&, const ArgPack&) [with Param0 = boost::adjacency_list, boost::property >; ArgPack = boost::parameter::aux::arg_list >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&> > >, boost::parameter::aux::empty_arg_list, std::integral_constant >; typename boost::result_of(Param0, const ArgPack&)>::type = void]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/depth_first_search.hpp:409:1: required from ‘typename boost::result_of(Param0, const typename boost::detail::convert_bgl_params_to_boost_parameter >::type&)>::type boost::depth_first_search(const Param0&, const bgl_named_params&) [with Param0 = adjacency_list, property >; P = detail::components_recorder >, vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&> >; T = graph_visitor_t; R = no_property; typename result_of(Param0, const typename detail::convert_bgl_params_to_boost_parameter >::type&)>::type = void; typename detail::convert_bgl_params_to_boost_parameter >::type = parameter::aux::arg_list >, vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&> > >, parameter::aux::empty_arg_list, std::integral_constant >]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/connected_components.hpp:106:23: required from ‘typename boost::property_traits::value_type boost::connected_components(const Graph&, ComponentMap, typename enable_if_c::traversal_category>::value, graph::detail::no_parameter>::type) [with Graph = adjacency_list, property >; ComponentMap = iterator_property_map<__gnu_cxx::__normal_iterator >, vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>; typename property_traits::value_type = long unsigned int; typename enable_if_c::traversal_category>::value, graph::detail::no_parameter>::type = graph::detail::no_parameter; typename graph_traits::traversal_category = undir_adj_list_traversal_tag]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/make_connected.hpp:38:51: required from ‘void boost::make_connected(Graph&, VertexIndexMap, AddEdgeVisitor&) [with Graph = adjacency_list, property >; VertexIndexMap = vec_adj_list_vertex_id_map, long unsigned int>; AddEdgeVisitor = my_add_edge_visitor, property >, long unsigned int>]’ planar.cpp:211:26: required from here /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::concepts::MultiPassInputIterator::~MultiPassInputIterator() [with T = boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >, boost::property >*, std::vector > >, boost::property >, std::allocator > >, boost::property > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>]’ 37 | ~model() | ^ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/graph_concepts.hpp:52:50: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 52 | BOOST_concept(MultiPassInputIterator, (T)) { BOOST_CONCEPT_USAGE( | ^~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::Convertible]’: /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements >]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:208:5: required from ‘struct boost::Convertible’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::Convertible]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied >::value’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:72:8: [ skipping 5 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/depth_first_search.hpp:397:42: required from ‘void boost::graph::detail::depth_first_search_impl::operator()(const Graph&, const ArgPack&) const [with ArgPack = boost::parameter::aux::arg_list >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&> > >, boost::parameter::aux::empty_arg_list, std::integral_constant >; Graph = boost::adjacency_list, boost::property >]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/depth_first_search.hpp:406:5: required from ‘typename boost::result_of(Param0, const ArgPack&)>::type boost::graph::depth_first_search_with_named_params(const Param0&, const ArgPack&) [with Param0 = boost::adjacency_list, boost::property >; ArgPack = boost::parameter::aux::arg_list >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&> > >, boost::parameter::aux::empty_arg_list, std::integral_constant >; typename boost::result_of(Param0, const ArgPack&)>::type = void]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/depth_first_search.hpp:409:1: required from ‘typename boost::result_of(Param0, const typename boost::detail::convert_bgl_params_to_boost_parameter >::type&)>::type boost::depth_first_search(const Param0&, const bgl_named_params&) [with Param0 = adjacency_list, property >; P = detail::components_recorder >, vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&> >; T = graph_visitor_t; R = no_property; typename result_of(Param0, const typename detail::convert_bgl_params_to_boost_parameter >::type&)>::type = void; typename detail::convert_bgl_params_to_boost_parameter >::type = parameter::aux::arg_list >, vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&> > >, parameter::aux::empty_arg_list, std::integral_constant >]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/connected_components.hpp:106:23: required from ‘typename boost::property_traits::value_type boost::connected_components(const Graph&, ComponentMap, typename enable_if_c::traversal_category>::value, graph::detail::no_parameter>::type) [with Graph = adjacency_list, property >; ComponentMap = iterator_property_map<__gnu_cxx::__normal_iterator >, vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>; typename property_traits::value_type = long unsigned int; typename enable_if_c::traversal_category>::value, graph::detail::no_parameter>::type = graph::detail::no_parameter; typename graph_traits::traversal_category = undir_adj_list_traversal_tag]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/make_connected.hpp:38:51: required from ‘void boost::make_connected(Graph&, VertexIndexMap, AddEdgeVisitor&) [with Graph = adjacency_list, property >; VertexIndexMap = vec_adj_list_vertex_id_map, long unsigned int>; AddEdgeVisitor = my_add_edge_visitor, property >, long unsigned int>]’ planar.cpp:211:26: required from here /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::Convertible::~Convertible() [with X = boost::undir_adj_list_traversal_tag; Y = boost::incidence_graph_tag]’ 37 | ~model() | ^ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:208:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 208 | BOOST_CONCEPT_USAGE(Convertible) { | ^~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::DefaultConstructible]’: /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements >]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:137:5: required from ‘struct boost::DefaultConstructible’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::DefaultConstructible]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied >::value’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:72:8: [ skipping 12 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/isomorphism.hpp:651:42: required from ‘bool boost::graph::detail::isomorphism_impl::operator()(const Graph1&, const Graph2&, const ArgPack&) const [with ArgPack = boost::parameter::aux::empty_arg_list; Graph1 = boost::adjacency_list; Graph2 = boost::adjacency_list]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/isomorphism.hpp:662:5: required from ‘typename boost::result_of(Param0, Param1, const ArgPack&)>::type boost::graph::isomorphism_with_named_params(const Param0&, const Param1&, const ArgPack&) [with Param0 = boost::adjacency_list; Param1 = boost::adjacency_list; ArgPack = boost::parameter::aux::empty_arg_list; typename boost::result_of(Param0, Param1, const ArgPack&)>::type = bool]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/isomorphism.hpp:666:1: required from ‘typename boost::result_of(Param0, Param1, const boost::parameter::aux::empty_arg_list&)>::type boost::isomorphism(const Param0&, const Param1&) [with Param0 = adjacency_list; Param1 = adjacency_list; typename result_of(Param0, Param1, const parameter::aux::empty_arg_list&)>::type = bool]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/is_kuratowski_subgraph.hpp:278:34: required from ‘bool boost::is_kuratowski_subgraph(const Graph&, ForwardIterator, ForwardIterator, VertexIndexMap) [with Graph = adjacency_list, property >; ForwardIterator = __gnu_cxx::__normal_iterator*, std::vector > >; VertexIndexMap = vec_adj_list_vertex_id_map, long unsigned int>]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/is_kuratowski_subgraph.hpp:290:34: required from ‘bool boost::is_kuratowski_subgraph(const Graph&, ForwardIterator, ForwardIterator) [with Graph = adjacency_list, property >; ForwardIterator = __gnu_cxx::__normal_iterator*, std::vector > >]’ planar.cpp:435:37: required from here /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::DefaultConstructible::~DefaultConstructible() [with TT = long unsigned int]’ 37 | ~model() | ^ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:137:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 137 | BOOST_CONCEPT_USAGE(DefaultConstructible) { | ^~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::EqualityComparable]’: /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements >]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:233:5: required from ‘struct boost::EqualityComparable’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::EqualityComparable]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied >::value’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:72:8: [ skipping 12 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/isomorphism.hpp:651:42: required from ‘bool boost::graph::detail::isomorphism_impl::operator()(const Graph1&, const Graph2&, const ArgPack&) const [with ArgPack = boost::parameter::aux::empty_arg_list; Graph1 = boost::adjacency_list; Graph2 = boost::adjacency_list]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/isomorphism.hpp:662:5: required from ‘typename boost::result_of(Param0, Param1, const ArgPack&)>::type boost::graph::isomorphism_with_named_params(const Param0&, const Param1&, const ArgPack&) [with Param0 = boost::adjacency_list; Param1 = boost::adjacency_list; ArgPack = boost::parameter::aux::empty_arg_list; typename boost::result_of(Param0, Param1, const ArgPack&)>::type = bool]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/isomorphism.hpp:666:1: required from ‘typename boost::result_of(Param0, Param1, const boost::parameter::aux::empty_arg_list&)>::type boost::isomorphism(const Param0&, const Param1&) [with Param0 = adjacency_list; Param1 = adjacency_list; typename result_of(Param0, Param1, const parameter::aux::empty_arg_list&)>::type = bool]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/is_kuratowski_subgraph.hpp:278:34: required from ‘bool boost::is_kuratowski_subgraph(const Graph&, ForwardIterator, ForwardIterator, VertexIndexMap) [with Graph = adjacency_list, property >; ForwardIterator = __gnu_cxx::__normal_iterator*, std::vector > >; VertexIndexMap = vec_adj_list_vertex_id_map, long unsigned int>]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/is_kuratowski_subgraph.hpp:290:34: required from ‘bool boost::is_kuratowski_subgraph(const Graph&, ForwardIterator, ForwardIterator) [with Graph = adjacency_list, property >; ForwardIterator = __gnu_cxx::__normal_iterator*, std::vector > >]’ planar.cpp:435:37: required from here /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::EqualityComparable::~EqualityComparable() [with TT = long unsigned int]’ 37 | ~model() | ^ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:233:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 233 | BOOST_CONCEPT_USAGE(EqualityComparable) { | ^~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::Assignable]’: /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements >]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:145:5: required from ‘struct boost::Assignable’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::Assignable]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied >::value’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:72:8: [ skipping 12 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/isomorphism.hpp:651:42: required from ‘bool boost::graph::detail::isomorphism_impl::operator()(const Graph1&, const Graph2&, const ArgPack&) const [with ArgPack = boost::parameter::aux::empty_arg_list; Graph1 = boost::adjacency_list; Graph2 = boost::adjacency_list]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/isomorphism.hpp:662:5: required from ‘typename boost::result_of(Param0, Param1, const ArgPack&)>::type boost::graph::isomorphism_with_named_params(const Param0&, const Param1&, const ArgPack&) [with Param0 = boost::adjacency_list; Param1 = boost::adjacency_list; ArgPack = boost::parameter::aux::empty_arg_list; typename boost::result_of(Param0, Param1, const ArgPack&)>::type = bool]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/isomorphism.hpp:666:1: required from ‘typename boost::result_of(Param0, Param1, const boost::parameter::aux::empty_arg_list&)>::type boost::isomorphism(const Param0&, const Param1&) [with Param0 = adjacency_list; Param1 = adjacency_list; typename result_of(Param0, Param1, const parameter::aux::empty_arg_list&)>::type = bool]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/is_kuratowski_subgraph.hpp:278:34: required from ‘bool boost::is_kuratowski_subgraph(const Graph&, ForwardIterator, ForwardIterator, VertexIndexMap) [with Graph = adjacency_list, property >; ForwardIterator = __gnu_cxx::__normal_iterator*, std::vector > >; VertexIndexMap = vec_adj_list_vertex_id_map, long unsigned int>]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/is_kuratowski_subgraph.hpp:290:34: required from ‘bool boost::is_kuratowski_subgraph(const Graph&, ForwardIterator, ForwardIterator) [with Graph = adjacency_list, property >; ForwardIterator = __gnu_cxx::__normal_iterator*, std::vector > >]’ planar.cpp:435:37: required from here /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::Assignable::~Assignable() [with TT = long unsigned int]’ 37 | ~model() | ^ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:145:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 145 | BOOST_CONCEPT_USAGE(Assignable) { | ^~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements > >]’: /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:145:5: required from ‘struct boost::Assignable >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:502:3: required from ‘struct boost::InputIterator >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::InputIterator >]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied > >::value’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied > >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:72:8: [ skipping 6 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/isomorphism.hpp:651:42: required from ‘bool boost::graph::detail::isomorphism_impl::operator()(const Graph1&, const Graph2&, const ArgPack&) const [with ArgPack = boost::parameter::aux::empty_arg_list; Graph1 = boost::adjacency_list; Graph2 = boost::adjacency_list]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/isomorphism.hpp:662:5: required from ‘typename boost::result_of(Param0, Param1, const ArgPack&)>::type boost::graph::isomorphism_with_named_params(const Param0&, const Param1&, const ArgPack&) [with Param0 = boost::adjacency_list; Param1 = boost::adjacency_list; ArgPack = boost::parameter::aux::empty_arg_list; typename boost::result_of(Param0, Param1, const ArgPack&)>::type = bool]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/isomorphism.hpp:666:1: required from ‘typename boost::result_of(Param0, Param1, const boost::parameter::aux::empty_arg_list&)>::type boost::isomorphism(const Param0&, const Param1&) [with Param0 = adjacency_list; Param1 = adjacency_list; typename result_of(Param0, Param1, const parameter::aux::empty_arg_list&)>::type = bool]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/is_kuratowski_subgraph.hpp:278:34: required from ‘bool boost::is_kuratowski_subgraph(const Graph&, ForwardIterator, ForwardIterator, VertexIndexMap) [with Graph = adjacency_list, property >; ForwardIterator = __gnu_cxx::__normal_iterator*, std::vector > >; VertexIndexMap = vec_adj_list_vertex_id_map, long unsigned int>]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/is_kuratowski_subgraph.hpp:290:34: required from ‘bool boost::is_kuratowski_subgraph(const Graph&, ForwardIterator, ForwardIterator) [with Graph = adjacency_list, property >; ForwardIterator = __gnu_cxx::__normal_iterator*, std::vector > >]’ planar.cpp:435:37: required from here /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::Assignable >]’ 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ^ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements > >]’: /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:233:5: required from ‘struct boost::EqualityComparable >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:502:3: required from ‘struct boost::InputIterator >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::InputIterator >]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied > >::value’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied > >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:72:8: [ skipping 6 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/isomorphism.hpp:651:42: required from ‘bool boost::graph::detail::isomorphism_impl::operator()(const Graph1&, const Graph2&, const ArgPack&) const [with ArgPack = boost::parameter::aux::empty_arg_list; Graph1 = boost::adjacency_list; Graph2 = boost::adjacency_list]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/isomorphism.hpp:662:5: required from ‘typename boost::result_of(Param0, Param1, const ArgPack&)>::type boost::graph::isomorphism_with_named_params(const Param0&, const Param1&, const ArgPack&) [with Param0 = boost::adjacency_list; Param1 = boost::adjacency_list; ArgPack = boost::parameter::aux::empty_arg_list; typename boost::result_of(Param0, Param1, const ArgPack&)>::type = bool]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/isomorphism.hpp:666:1: required from ‘typename boost::result_of(Param0, Param1, const boost::parameter::aux::empty_arg_list&)>::type boost::isomorphism(const Param0&, const Param1&) [with Param0 = adjacency_list; Param1 = adjacency_list; typename result_of(Param0, Param1, const parameter::aux::empty_arg_list&)>::type = bool]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/is_kuratowski_subgraph.hpp:278:34: required from ‘bool boost::is_kuratowski_subgraph(const Graph&, ForwardIterator, ForwardIterator, VertexIndexMap) [with Graph = adjacency_list, property >; ForwardIterator = __gnu_cxx::__normal_iterator*, std::vector > >; VertexIndexMap = vec_adj_list_vertex_id_map, long unsigned int>]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/is_kuratowski_subgraph.hpp:290:34: required from ‘bool boost::is_kuratowski_subgraph(const Graph&, ForwardIterator, ForwardIterator) [with Graph = adjacency_list, property >; ForwardIterator = __gnu_cxx::__normal_iterator*, std::vector > >]’ planar.cpp:435:37: required from here /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::EqualityComparable >]’ 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ^ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements > >]’: /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:512:7: required from ‘struct boost::InputIterator >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::InputIterator >]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied > >::value’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied > >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_ >)>’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/graph_concepts.hpp:53:35: [ skipping 5 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/isomorphism.hpp:651:42: required from ‘bool boost::graph::detail::isomorphism_impl::operator()(const Graph1&, const Graph2&, const ArgPack&) const [with ArgPack = boost::parameter::aux::empty_arg_list; Graph1 = boost::adjacency_list; Graph2 = boost::adjacency_list]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/isomorphism.hpp:662:5: required from ‘typename boost::result_of(Param0, Param1, const ArgPack&)>::type boost::graph::isomorphism_with_named_params(const Param0&, const Param1&, const ArgPack&) [with Param0 = boost::adjacency_list; Param1 = boost::adjacency_list; ArgPack = boost::parameter::aux::empty_arg_list; typename boost::result_of(Param0, Param1, const ArgPack&)>::type = bool]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/isomorphism.hpp:666:1: required from ‘typename boost::result_of(Param0, Param1, const boost::parameter::aux::empty_arg_list&)>::type boost::isomorphism(const Param0&, const Param1&) [with Param0 = adjacency_list; Param1 = adjacency_list; typename result_of(Param0, Param1, const parameter::aux::empty_arg_list&)>::type = bool]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/is_kuratowski_subgraph.hpp:278:34: required from ‘bool boost::is_kuratowski_subgraph(const Graph&, ForwardIterator, ForwardIterator, VertexIndexMap) [with Graph = adjacency_list, property >; ForwardIterator = __gnu_cxx::__normal_iterator*, std::vector > >; VertexIndexMap = vec_adj_list_vertex_id_map, long unsigned int>]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/is_kuratowski_subgraph.hpp:290:34: required from ‘bool boost::is_kuratowski_subgraph(const Graph&, ForwardIterator, ForwardIterator) [with Graph = adjacency_list, property >; ForwardIterator = __gnu_cxx::__normal_iterator*, std::vector > >]’ planar.cpp:435:37: required from here /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::InputIterator >]’ 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ^ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::InputIterator >]’: /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/graph_concepts.hpp:53:35: required from ‘boost::concepts::MultiPassInputIterator::~MultiPassInputIterator() [with T = boost::range_detail::integer_iterator]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::MultiPassInputIterator >]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/graph_concepts.hpp:184:9: required from ‘boost::concepts::VertexListGraph::~VertexListGraph() [with G = boost::adjacency_list]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/graph_concepts.hpp:176:1: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::VertexListGraphConcept >]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/isomorphism.hpp:494:5: required from ‘bool boost::isomorphism(const Graph1&, const Graph2&, IsoMapping, Invariant1, Invariant2, std::size_t, IndexMap1, IndexMap2) [with Graph1 = adjacency_list; Graph2 = adjacency_list; IsoMapping = shared_array_property_map >; Invariant1 = degree_vertex_invariant >, adjacency_list >; Invariant2 = degree_vertex_invariant >, adjacency_list >; IndexMap1 = vec_adj_list_vertex_id_map; IndexMap2 = vec_adj_list_vertex_id_map; std::size_t = long unsigned int]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/isomorphism.hpp:651:42: required from ‘bool boost::graph::detail::isomorphism_impl::operator()(const Graph1&, const Graph2&, const ArgPack&) const [with ArgPack = boost::parameter::aux::empty_arg_list; Graph1 = boost::adjacency_list; Graph2 = boost::adjacency_list]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/isomorphism.hpp:662:5: required from ‘typename boost::result_of(Param0, Param1, const ArgPack&)>::type boost::graph::isomorphism_with_named_params(const Param0&, const Param1&, const ArgPack&) [with Param0 = boost::adjacency_list; Param1 = boost::adjacency_list; ArgPack = boost::parameter::aux::empty_arg_list; typename boost::result_of(Param0, Param1, const ArgPack&)>::type = bool]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/isomorphism.hpp:666:1: required from ‘typename boost::result_of(Param0, Param1, const boost::parameter::aux::empty_arg_list&)>::type boost::isomorphism(const Param0&, const Param1&) [with Param0 = adjacency_list; Param1 = adjacency_list; typename result_of(Param0, Param1, const parameter::aux::empty_arg_list&)>::type = bool]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/is_kuratowski_subgraph.hpp:278:34: required from ‘bool boost::is_kuratowski_subgraph(const Graph&, ForwardIterator, ForwardIterator, VertexIndexMap) [with Graph = adjacency_list, property >; ForwardIterator = __gnu_cxx::__normal_iterator*, std::vector > >; VertexIndexMap = vec_adj_list_vertex_id_map, long unsigned int>]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/is_kuratowski_subgraph.hpp:290:34: required from ‘bool boost::is_kuratowski_subgraph(const Graph&, ForwardIterator, ForwardIterator) [with Graph = adjacency_list, property >; ForwardIterator = __gnu_cxx::__normal_iterator*, std::vector > >]’ planar.cpp:435:37: required from here /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::InputIterator::~InputIterator() [with TT = boost::range_detail::integer_iterator]’ 37 | ~model() | ^ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:512:7: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 512 | BOOST_CONCEPT_USAGE(InputIterator) | ^~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements >, boost::detail::edge_desc_impl, long int> > >]’: /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:145:5: required from ‘struct boost::Assignable >, boost::detail::edge_desc_impl, long int> >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:502:3: required from ‘struct boost::InputIterator >, boost::detail::edge_desc_impl, long int> >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::InputIterator >, boost::detail::edge_desc_impl, long int> >]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied >, boost::detail::edge_desc_impl, long int> > >::value’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied >, boost::detail::edge_desc_impl, long int> > >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:72:8: [ skipping 6 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/isomorphism.hpp:651:42: required from ‘bool boost::graph::detail::isomorphism_impl::operator()(const Graph1&, const Graph2&, const ArgPack&) const [with ArgPack = boost::parameter::aux::empty_arg_list; Graph1 = boost::adjacency_list; Graph2 = boost::adjacency_list]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/isomorphism.hpp:662:5: required from ‘typename boost::result_of(Param0, Param1, const ArgPack&)>::type boost::graph::isomorphism_with_named_params(const Param0&, const Param1&, const ArgPack&) [with Param0 = boost::adjacency_list; Param1 = boost::adjacency_list; ArgPack = boost::parameter::aux::empty_arg_list; typename boost::result_of(Param0, Param1, const ArgPack&)>::type = bool]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/isomorphism.hpp:666:1: required from ‘typename boost::result_of(Param0, Param1, const boost::parameter::aux::empty_arg_list&)>::type boost::isomorphism(const Param0&, const Param1&) [with Param0 = adjacency_list; Param1 = adjacency_list; typename result_of(Param0, Param1, const parameter::aux::empty_arg_list&)>::type = bool]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/is_kuratowski_subgraph.hpp:278:34: required from ‘bool boost::is_kuratowski_subgraph(const Graph&, ForwardIterator, ForwardIterator, VertexIndexMap) [with Graph = adjacency_list, property >; ForwardIterator = __gnu_cxx::__normal_iterator*, std::vector > >; VertexIndexMap = vec_adj_list_vertex_id_map, long unsigned int>]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/is_kuratowski_subgraph.hpp:290:34: required from ‘bool boost::is_kuratowski_subgraph(const Graph&, ForwardIterator, ForwardIterator) [with Graph = adjacency_list, property >; ForwardIterator = __gnu_cxx::__normal_iterator*, std::vector > >]’ planar.cpp:435:37: required from here /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::Assignable >, boost::detail::edge_desc_impl, long int> >]’ 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ^ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements >, boost::detail::edge_desc_impl, long int> > >]’: /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:233:5: required from ‘struct boost::EqualityComparable >, boost::detail::edge_desc_impl, long int> >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:502:3: required from ‘struct boost::InputIterator >, boost::detail::edge_desc_impl, long int> >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::InputIterator >, boost::detail::edge_desc_impl, long int> >]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied >, boost::detail::edge_desc_impl, long int> > >::value’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied >, boost::detail::edge_desc_impl, long int> > >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:72:8: [ skipping 6 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/isomorphism.hpp:651:42: required from ‘bool boost::graph::detail::isomorphism_impl::operator()(const Graph1&, const Graph2&, const ArgPack&) const [with ArgPack = boost::parameter::aux::empty_arg_list; Graph1 = boost::adjacency_list; Graph2 = boost::adjacency_list]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/isomorphism.hpp:662:5: required from ‘typename boost::result_of(Param0, Param1, const ArgPack&)>::type boost::graph::isomorphism_with_named_params(const Param0&, const Param1&, const ArgPack&) [with Param0 = boost::adjacency_list; Param1 = boost::adjacency_list; ArgPack = boost::parameter::aux::empty_arg_list; typename boost::result_of(Param0, Param1, const ArgPack&)>::type = bool]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/isomorphism.hpp:666:1: required from ‘typename boost::result_of(Param0, Param1, const boost::parameter::aux::empty_arg_list&)>::type boost::isomorphism(const Param0&, const Param1&) [with Param0 = adjacency_list; Param1 = adjacency_list; typename result_of(Param0, Param1, const parameter::aux::empty_arg_list&)>::type = bool]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/is_kuratowski_subgraph.hpp:278:34: required from ‘bool boost::is_kuratowski_subgraph(const Graph&, ForwardIterator, ForwardIterator, VertexIndexMap) [with Graph = adjacency_list, property >; ForwardIterator = __gnu_cxx::__normal_iterator*, std::vector > >; VertexIndexMap = vec_adj_list_vertex_id_map, long unsigned int>]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/is_kuratowski_subgraph.hpp:290:34: required from ‘bool boost::is_kuratowski_subgraph(const Graph&, ForwardIterator, ForwardIterator) [with Graph = adjacency_list, property >; ForwardIterator = __gnu_cxx::__normal_iterator*, std::vector > >]’ planar.cpp:435:37: required from here /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::EqualityComparable >, boost::detail::edge_desc_impl, long int> >]’ 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ^ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements >, boost::detail::edge_desc_impl, long int> > >]’: /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:512:7: required from ‘struct boost::InputIterator >, boost::detail::edge_desc_impl, long int> >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::InputIterator >, boost::detail::edge_desc_impl, long int> >]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied >, boost::detail::edge_desc_impl, long int> > >::value’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied >, boost::detail::edge_desc_impl, long int> > >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_ >, boost::detail::edge_desc_impl, long int> >)>’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/graph_concepts.hpp:53:35: [ skipping 5 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/isomorphism.hpp:651:42: required from ‘bool boost::graph::detail::isomorphism_impl::operator()(const Graph1&, const Graph2&, const ArgPack&) const [with ArgPack = boost::parameter::aux::empty_arg_list; Graph1 = boost::adjacency_list; Graph2 = boost::adjacency_list]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/isomorphism.hpp:662:5: required from ‘typename boost::result_of(Param0, Param1, const ArgPack&)>::type boost::graph::isomorphism_with_named_params(const Param0&, const Param1&, const ArgPack&) [with Param0 = boost::adjacency_list; Param1 = boost::adjacency_list; ArgPack = boost::parameter::aux::empty_arg_list; typename boost::result_of(Param0, Param1, const ArgPack&)>::type = bool]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/isomorphism.hpp:666:1: required from ‘typename boost::result_of(Param0, Param1, const boost::parameter::aux::empty_arg_list&)>::type boost::isomorphism(const Param0&, const Param1&) [with Param0 = adjacency_list; Param1 = adjacency_list; typename result_of(Param0, Param1, const parameter::aux::empty_arg_list&)>::type = bool]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/is_kuratowski_subgraph.hpp:278:34: required from ‘bool boost::is_kuratowski_subgraph(const Graph&, ForwardIterator, ForwardIterator, VertexIndexMap) [with Graph = adjacency_list, property >; ForwardIterator = __gnu_cxx::__normal_iterator*, std::vector > >; VertexIndexMap = vec_adj_list_vertex_id_map, long unsigned int>]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/is_kuratowski_subgraph.hpp:290:34: required from ‘bool boost::is_kuratowski_subgraph(const Graph&, ForwardIterator, ForwardIterator) [with Graph = adjacency_list, property >; ForwardIterator = __gnu_cxx::__normal_iterator*, std::vector > >]’ planar.cpp:435:37: required from here /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::InputIterator >, boost::detail::edge_desc_impl, long int> >]’ 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ^ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::InputIterator >, boost::detail::edge_desc_impl, long int> >]’: /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/graph_concepts.hpp:53:35: required from ‘boost::concepts::MultiPassInputIterator::~MultiPassInputIterator() [with T = boost::detail::undirected_edge_iter >, boost::detail::edge_desc_impl, long int>]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::MultiPassInputIterator >, boost::detail::edge_desc_impl, long int> >]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/graph_concepts.hpp:235:9: required from ‘boost::concepts::EdgeListGraph::~EdgeListGraph() [with G = boost::adjacency_list]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/graph_concepts.hpp:226:1: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::EdgeListGraphConcept >]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/isomorphism.hpp:495:5: required from ‘bool boost::isomorphism(const Graph1&, const Graph2&, IsoMapping, Invariant1, Invariant2, std::size_t, IndexMap1, IndexMap2) [with Graph1 = adjacency_list; Graph2 = adjacency_list; IsoMapping = shared_array_property_map >; Invariant1 = degree_vertex_invariant >, adjacency_list >; Invariant2 = degree_vertex_invariant >, adjacency_list >; IndexMap1 = vec_adj_list_vertex_id_map; IndexMap2 = vec_adj_list_vertex_id_map; std::size_t = long unsigned int]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/isomorphism.hpp:651:42: required from ‘bool boost::graph::detail::isomorphism_impl::operator()(const Graph1&, const Graph2&, const ArgPack&) const [with ArgPack = boost::parameter::aux::empty_arg_list; Graph1 = boost::adjacency_list; Graph2 = boost::adjacency_list]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/isomorphism.hpp:662:5: required from ‘typename boost::result_of(Param0, Param1, const ArgPack&)>::type boost::graph::isomorphism_with_named_params(const Param0&, const Param1&, const ArgPack&) [with Param0 = boost::adjacency_list; Param1 = boost::adjacency_list; ArgPack = boost::parameter::aux::empty_arg_list; typename boost::result_of(Param0, Param1, const ArgPack&)>::type = bool]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/isomorphism.hpp:666:1: required from ‘typename boost::result_of(Param0, Param1, const boost::parameter::aux::empty_arg_list&)>::type boost::isomorphism(const Param0&, const Param1&) [with Param0 = adjacency_list; Param1 = adjacency_list; typename result_of(Param0, Param1, const parameter::aux::empty_arg_list&)>::type = bool]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/is_kuratowski_subgraph.hpp:278:34: required from ‘bool boost::is_kuratowski_subgraph(const Graph&, ForwardIterator, ForwardIterator, VertexIndexMap) [with Graph = adjacency_list, property >; ForwardIterator = __gnu_cxx::__normal_iterator*, std::vector > >; VertexIndexMap = vec_adj_list_vertex_id_map, long unsigned int>]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/is_kuratowski_subgraph.hpp:290:34: required from ‘bool boost::is_kuratowski_subgraph(const Graph&, ForwardIterator, ForwardIterator) [with Graph = adjacency_list, property >; ForwardIterator = __gnu_cxx::__normal_iterator*, std::vector > >]’ planar.cpp:435:37: required from here /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::InputIterator::~InputIterator() [with TT = boost::detail::undirected_edge_iter >, boost::detail::edge_desc_impl, long int>]’ 37 | ~model() | ^ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:512:7: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 512 | BOOST_CONCEPT_USAGE(InputIterator) | ^~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::concepts::IncidenceGraph >]’: /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements > >]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/graph_concepts.hpp:87:5: required from ‘struct boost::concepts::IncidenceGraph >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/graph_concepts.hpp:75:1: required from ‘struct boost::concepts::IncidenceGraphConcept >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::concepts::IncidenceGraphConcept >]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied > >::value’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:45:51: [ skipping 6 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/isomorphism.hpp:651:42: required from ‘bool boost::graph::detail::isomorphism_impl::operator()(const Graph1&, const Graph2&, const ArgPack&) const [with ArgPack = boost::parameter::aux::empty_arg_list; Graph1 = boost::adjacency_list; Graph2 = boost::adjacency_list]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/isomorphism.hpp:662:5: required from ‘typename boost::result_of(Param0, Param1, const ArgPack&)>::type boost::graph::isomorphism_with_named_params(const Param0&, const Param1&, const ArgPack&) [with Param0 = boost::adjacency_list; Param1 = boost::adjacency_list; ArgPack = boost::parameter::aux::empty_arg_list; typename boost::result_of(Param0, Param1, const ArgPack&)>::type = bool]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/isomorphism.hpp:666:1: required from ‘typename boost::result_of(Param0, Param1, const boost::parameter::aux::empty_arg_list&)>::type boost::isomorphism(const Param0&, const Param1&) [with Param0 = adjacency_list; Param1 = adjacency_list; typename result_of(Param0, Param1, const parameter::aux::empty_arg_list&)>::type = bool]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/is_kuratowski_subgraph.hpp:278:34: required from ‘bool boost::is_kuratowski_subgraph(const Graph&, ForwardIterator, ForwardIterator, VertexIndexMap) [with Graph = adjacency_list, property >; ForwardIterator = __gnu_cxx::__normal_iterator*, std::vector > >; VertexIndexMap = vec_adj_list_vertex_id_map, long unsigned int>]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/is_kuratowski_subgraph.hpp:290:34: required from ‘bool boost::is_kuratowski_subgraph(const Graph&, ForwardIterator, ForwardIterator) [with Graph = adjacency_list, property >; ForwardIterator = __gnu_cxx::__normal_iterator*, std::vector > >]’ planar.cpp:435:37: required from here /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::concepts::IncidenceGraph::~IncidenceGraph() [with G = boost::adjacency_list]’ 37 | ~model() | ^ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/graph_concepts.hpp:87:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 87 | BOOST_CONCEPT_USAGE(IncidenceGraph) | ^~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements, boost::adjacency_list, boost::shared_array_property_map >, boost::degree_vertex_invariant >, boost::adjacency_list >, boost::degree_vertex_invariant >, boost::adjacency_list >, boost::vec_adj_list_vertex_id_map, boost::vec_adj_list_vertex_id_map >::record_dfs_order> >]’: /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:167:5: required from ‘struct boost::CopyConstructible, boost::adjacency_list, boost::shared_array_property_map >, boost::degree_vertex_invariant >, boost::adjacency_list >, boost::degree_vertex_invariant >, boost::adjacency_list >, boost::vec_adj_list_vertex_id_map, boost::vec_adj_list_vertex_id_map >::record_dfs_order>’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:165:3: required from ‘struct boost::CopyConstructibleConcept, boost::adjacency_list, boost::shared_array_property_map >, boost::degree_vertex_invariant >, boost::adjacency_list >, boost::degree_vertex_invariant >, boost::adjacency_list >, boost::vec_adj_list_vertex_id_map, boost::vec_adj_list_vertex_id_map >::record_dfs_order>’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::CopyConstructibleConcept, boost::adjacency_list, boost::shared_array_property_map >, boost::degree_vertex_invariant >, boost::adjacency_list >, boost::degree_vertex_invariant >, boost::adjacency_list >, boost::vec_adj_list_vertex_id_map, boost::vec_adj_list_vertex_id_map >::record_dfs_order>]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied, boost::adjacency_list, boost::shared_array_property_map >, boost::degree_vertex_invariant >, boost::adjacency_list >, boost::degree_vertex_invariant >, boost::adjacency_list >, boost::vec_adj_list_vertex_id_map, boost::vec_adj_list_vertex_id_map >::record_dfs_order> >::value’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied, boost::adjacency_list, boost::shared_array_property_map >, boost::degree_vertex_invariant >, boost::adjacency_list >, boost::degree_vertex_invariant >, boost::adjacency_list >, boost::vec_adj_list_vertex_id_map, boost::vec_adj_list_vertex_id_map >::record_dfs_order> >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:72:8: [ skipping 10 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/isomorphism.hpp:651:42: required from ‘bool boost::graph::detail::isomorphism_impl::operator()(const Graph1&, const Graph2&, const ArgPack&) const [with ArgPack = boost::parameter::aux::empty_arg_list; Graph1 = boost::adjacency_list; Graph2 = boost::adjacency_list]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/isomorphism.hpp:662:5: required from ‘typename boost::result_of(Param0, Param1, const ArgPack&)>::type boost::graph::isomorphism_with_named_params(const Param0&, const Param1&, const ArgPack&) [with Param0 = boost::adjacency_list; Param1 = boost::adjacency_list; ArgPack = boost::parameter::aux::empty_arg_list; typename boost::result_of(Param0, Param1, const ArgPack&)>::type = bool]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/isomorphism.hpp:666:1: required from ‘typename boost::result_of(Param0, Param1, const boost::parameter::aux::empty_arg_list&)>::type boost::isomorphism(const Param0&, const Param1&) [with Param0 = adjacency_list; Param1 = adjacency_list; typename result_of(Param0, Param1, const parameter::aux::empty_arg_list&)>::type = bool]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/is_kuratowski_subgraph.hpp:278:34: required from ‘bool boost::is_kuratowski_subgraph(const Graph&, ForwardIterator, ForwardIterator, VertexIndexMap) [with Graph = adjacency_list, property >; ForwardIterator = __gnu_cxx::__normal_iterator*, std::vector > >; VertexIndexMap = vec_adj_list_vertex_id_map, long unsigned int>]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/is_kuratowski_subgraph.hpp:290:34: required from ‘bool boost::is_kuratowski_subgraph(const Graph&, ForwardIterator, ForwardIterator) [with Graph = adjacency_list, property >; ForwardIterator = __gnu_cxx::__normal_iterator*, std::vector > >]’ planar.cpp:435:37: required from here /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::CopyConstructible, boost::adjacency_list, boost::shared_array_property_map >, boost::degree_vertex_invariant >, boost::adjacency_list >, boost::degree_vertex_invariant >, boost::adjacency_list >, boost::vec_adj_list_vertex_id_map, boost::vec_adj_list_vertex_id_map >::record_dfs_order>]’ 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ^ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::CopyConstructibleConcept, boost::adjacency_list, boost::shared_array_property_map >, boost::degree_vertex_invariant >, boost::adjacency_list >, boost::degree_vertex_invariant >, boost::adjacency_list >, boost::vec_adj_list_vertex_id_map, boost::vec_adj_list_vertex_id_map >::record_dfs_order>]’: /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/depth_first_search.hpp:41:9: required from ‘void boost::DFSVisitorConcept::constraints() [with Visitor = boost::detail::isomorphism_algo, boost::adjacency_list, boost::shared_array_property_map >, boost::degree_vertex_invariant >, boost::adjacency_list >, boost::degree_vertex_invariant >, boost::adjacency_list >, boost::vec_adj_list_vertex_id_map, boost::vec_adj_list_vertex_id_map >::record_dfs_order; Graph = boost::adjacency_list]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::DFSVisitorConcept, boost::adjacency_list, boost::shared_array_property_map >, boost::degree_vertex_invariant >, boost::adjacency_list >, boost::degree_vertex_invariant >, boost::adjacency_list >, boost::vec_adj_list_vertex_id_map, boost::vec_adj_list_vertex_id_map >::record_dfs_order, boost::adjacency_list >]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied, boost::adjacency_list, boost::shared_array_property_map >, boost::degree_vertex_invariant >, boost::adjacency_list >, boost::degree_vertex_invariant >, boost::adjacency_list >, boost::vec_adj_list_vertex_id_map, boost::vec_adj_list_vertex_id_map >::record_dfs_order, boost::adjacency_list > >::value’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied, boost::adjacency_list, boost::shared_array_property_map >, boost::degree_vertex_invariant >, boost::adjacency_list >, boost::degree_vertex_invariant >, boost::adjacency_list >, boost::vec_adj_list_vertex_id_map, boost::vec_adj_list_vertex_id_map >::record_dfs_order, boost::adjacency_list > >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_, boost::adjacency_list, boost::shared_array_property_map >, boost::degree_vertex_invariant >, boost::adjacency_list >, boost::degree_vertex_invariant >, boost::adjacency_list >, boost::vec_adj_list_vertex_id_map, boost::vec_adj_list_vertex_id_map >::record_dfs_order, boost::adjacency_list >)>’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/depth_first_search.hpp:130:9: [ skipping 4 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/isomorphism.hpp:651:42: required from ‘bool boost::graph::detail::isomorphism_impl::operator()(const Graph1&, const Graph2&, const ArgPack&) const [with ArgPack = boost::parameter::aux::empty_arg_list; Graph1 = boost::adjacency_list; Graph2 = boost::adjacency_list]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/isomorphism.hpp:662:5: required from ‘typename boost::result_of(Param0, Param1, const ArgPack&)>::type boost::graph::isomorphism_with_named_params(const Param0&, const Param1&, const ArgPack&) [with Param0 = boost::adjacency_list; Param1 = boost::adjacency_list; ArgPack = boost::parameter::aux::empty_arg_list; typename boost::result_of(Param0, Param1, const ArgPack&)>::type = bool]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/isomorphism.hpp:666:1: required from ‘typename boost::result_of(Param0, Param1, const boost::parameter::aux::empty_arg_list&)>::type boost::isomorphism(const Param0&, const Param1&) [with Param0 = adjacency_list; Param1 = adjacency_list; typename result_of(Param0, Param1, const parameter::aux::empty_arg_list&)>::type = bool]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/is_kuratowski_subgraph.hpp:278:34: required from ‘bool boost::is_kuratowski_subgraph(const Graph&, ForwardIterator, ForwardIterator, VertexIndexMap) [with Graph = adjacency_list, property >; ForwardIterator = __gnu_cxx::__normal_iterator*, std::vector > >; VertexIndexMap = vec_adj_list_vertex_id_map, long unsigned int>]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/is_kuratowski_subgraph.hpp:290:34: required from ‘bool boost::is_kuratowski_subgraph(const Graph&, ForwardIterator, ForwardIterator) [with Graph = adjacency_list, property >; ForwardIterator = __gnu_cxx::__normal_iterator*, std::vector > >]’ planar.cpp:435:37: required from here /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:165:17: note: in a call to non-static member function ‘boost::CopyConstructibleConcept, boost::adjacency_list, boost::shared_array_property_map >, boost::degree_vertex_invariant >, boost::adjacency_list >, boost::degree_vertex_invariant >, boost::adjacency_list >, boost::vec_adj_list_vertex_id_map, boost::vec_adj_list_vertex_id_map >::record_dfs_order>::~CopyConstructibleConcept()’ 165 | BOOST_concept(CopyConstructible,(TT)) | ^~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/preprocessor/cat.hpp:29:34: note: in definition of macro ‘BOOST_PP_CAT_I’ 29 | # define BOOST_PP_CAT_I(a, b) a ## b | ^ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/concept_def.hpp:23:12: note: in expansion of macro ‘BOOST_PP_CAT’ 23 | struct BOOST_PP_CAT(name,Concept) \ | ^~~~~~~~~~~~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:165:3: note: in expansion of macro ‘BOOST_concept’ 165 | BOOST_concept(CopyConstructible,(TT)) | ^~~~~~~~~~~~~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::constraint::failed() [with Model = boost::ReadablePropertyMapConcept >, boost::vec_adj_list_vertex_id_map, boost::default_color_type, boost::default_color_type&>, long unsigned int>]’: /home/omnipath/local/R/4.4-3.20/BH/include/boost/property_map/property_map.hpp:206:7: required from ‘void boost::ReadWritePropertyMapConcept::constraints() [with PMap = boost::safe_iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map, boost::default_color_type, boost::default_color_type&>; Key = long unsigned int]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::ReadWritePropertyMapConcept >, boost::vec_adj_list_vertex_id_map, boost::default_color_type, boost::default_color_type&>, long unsigned int>]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied >, boost::vec_adj_list_vertex_id_map, boost::default_color_type, boost::default_color_type&>, long unsigned int> >::value’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied >, boost::vec_adj_list_vertex_id_map, boost::default_color_type, boost::default_color_type&>, long unsigned int> >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_ >, boost::vec_adj_list_vertex_id_map, boost::default_color_type, boost::default_color_type&>, long unsigned int>)>’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/depth_first_search.hpp:134:9: [ skipping 4 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/isomorphism.hpp:651:42: required from ‘bool boost::graph::detail::isomorphism_impl::operator()(const Graph1&, const Graph2&, const ArgPack&) const [with ArgPack = boost::parameter::aux::empty_arg_list; Graph1 = boost::adjacency_list; Graph2 = boost::adjacency_list]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/isomorphism.hpp:662:5: required from ‘typename boost::result_of(Param0, Param1, const ArgPack&)>::type boost::graph::isomorphism_with_named_params(const Param0&, const Param1&, const ArgPack&) [with Param0 = boost::adjacency_list; Param1 = boost::adjacency_list; ArgPack = boost::parameter::aux::empty_arg_list; typename boost::result_of(Param0, Param1, const ArgPack&)>::type = bool]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/isomorphism.hpp:666:1: required from ‘typename boost::result_of(Param0, Param1, const boost::parameter::aux::empty_arg_list&)>::type boost::isomorphism(const Param0&, const Param1&) [with Param0 = adjacency_list; Param1 = adjacency_list; typename result_of(Param0, Param1, const parameter::aux::empty_arg_list&)>::type = bool]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/is_kuratowski_subgraph.hpp:278:34: required from ‘bool boost::is_kuratowski_subgraph(const Graph&, ForwardIterator, ForwardIterator, VertexIndexMap) [with Graph = adjacency_list, property >; ForwardIterator = __gnu_cxx::__normal_iterator*, std::vector > >; VertexIndexMap = vec_adj_list_vertex_id_map, long unsigned int>]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/is_kuratowski_subgraph.hpp:290:34: required from ‘bool boost::is_kuratowski_subgraph(const Graph&, ForwardIterator, ForwardIterator) [with Graph = adjacency_list, property >; ForwardIterator = __gnu_cxx::__normal_iterator*, std::vector > >]’ planar.cpp:435:37: required from here /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:65:52: warning: ‘this’ pointer is null [-Wnonnull] 65 | static void failed() { ((Model*)0)->constraints(); } | ~~~~~~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/property_map/property_map.hpp:147:10: note: in a call to non-static member function ‘void boost::ReadablePropertyMapConcept::constraints() [with PMap = boost::safe_iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map, boost::default_color_type, boost::default_color_type&>; Key = long unsigned int]’ 147 | void constraints() { | ^~~~~~~~~~~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::constraint::failed() [with Model = boost::WritablePropertyMapConcept >, boost::vec_adj_list_vertex_id_map, boost::default_color_type, boost::default_color_type&>, long unsigned int>]’: /home/omnipath/local/R/4.4-3.20/BH/include/boost/property_map/property_map.hpp:207:7: required from ‘void boost::ReadWritePropertyMapConcept::constraints() [with PMap = boost::safe_iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map, boost::default_color_type, boost::default_color_type&>; Key = long unsigned int]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::ReadWritePropertyMapConcept >, boost::vec_adj_list_vertex_id_map, boost::default_color_type, boost::default_color_type&>, long unsigned int>]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied >, boost::vec_adj_list_vertex_id_map, boost::default_color_type, boost::default_color_type&>, long unsigned int> >::value’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied >, boost::vec_adj_list_vertex_id_map, boost::default_color_type, boost::default_color_type&>, long unsigned int> >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_ >, boost::vec_adj_list_vertex_id_map, boost::default_color_type, boost::default_color_type&>, long unsigned int>)>’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/depth_first_search.hpp:134:9: [ skipping 4 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/isomorphism.hpp:651:42: required from ‘bool boost::graph::detail::isomorphism_impl::operator()(const Graph1&, const Graph2&, const ArgPack&) const [with ArgPack = boost::parameter::aux::empty_arg_list; Graph1 = boost::adjacency_list; Graph2 = boost::adjacency_list]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/isomorphism.hpp:662:5: required from ‘typename boost::result_of(Param0, Param1, const ArgPack&)>::type boost::graph::isomorphism_with_named_params(const Param0&, const Param1&, const ArgPack&) [with Param0 = boost::adjacency_list; Param1 = boost::adjacency_list; ArgPack = boost::parameter::aux::empty_arg_list; typename boost::result_of(Param0, Param1, const ArgPack&)>::type = bool]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/isomorphism.hpp:666:1: required from ‘typename boost::result_of(Param0, Param1, const boost::parameter::aux::empty_arg_list&)>::type boost::isomorphism(const Param0&, const Param1&) [with Param0 = adjacency_list; Param1 = adjacency_list; typename result_of(Param0, Param1, const parameter::aux::empty_arg_list&)>::type = bool]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/is_kuratowski_subgraph.hpp:278:34: required from ‘bool boost::is_kuratowski_subgraph(const Graph&, ForwardIterator, ForwardIterator, VertexIndexMap) [with Graph = adjacency_list, property >; ForwardIterator = __gnu_cxx::__normal_iterator*, std::vector > >; VertexIndexMap = vec_adj_list_vertex_id_map, long unsigned int>]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/is_kuratowski_subgraph.hpp:290:34: required from ‘bool boost::is_kuratowski_subgraph(const Graph&, ForwardIterator, ForwardIterator) [with Graph = adjacency_list, property >; ForwardIterator = __gnu_cxx::__normal_iterator*, std::vector > >]’ planar.cpp:435:37: required from here /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:65:52: warning: ‘this’ pointer is null [-Wnonnull] 65 | static void failed() { ((Model*)0)->constraints(); } | ~~~~~~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/property_map/property_map.hpp:179:10: note: in a call to non-static member function ‘void boost::WritablePropertyMapConcept::constraints() [with PMap = boost::safe_iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map, boost::default_color_type, boost::default_color_type&>; Key = long unsigned int]’ 179 | void constraints() { | ^~~~~~~~~~~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::CopyConstructible, long unsigned int, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator >, boost::no_property>*, std::vector >, boost::no_property>, std::allocator >, boost::no_property> > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, long int> >]’: /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements, long unsigned int, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator >, boost::no_property>*, std::vector >, boost::no_property>, std::allocator >, boost::no_property> > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, long int> > >]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:167:5: required from ‘struct boost::CopyConstructible, long unsigned int, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator >, boost::no_property>*, std::vector >, boost::no_property>, std::allocator >, boost::no_property> > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, long int> >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/range/concepts.hpp:125:16: required from ‘struct boost::range_detail::IncrementableIteratorConcept, long unsigned int, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator >, boost::no_property>*, std::vector >, boost::no_property>, std::allocator >, boost::no_property> > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, long int> >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/range/concepts.hpp:147:16: required from ‘struct boost::range_detail::SinglePassIteratorConcept, long unsigned int, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator >, boost::no_property>*, std::vector >, boost::no_property>, std::allocator >, boost::no_property> > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, long int> >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::range_detail::SinglePassIteratorConcept, long unsigned int, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator >, boost::no_property>*, std::vector >, boost::no_property>, std::allocator >, boost::no_property> > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, long int> >]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:42:5: [ skipping 12 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/isomorphism.hpp:651:42: required from ‘bool boost::graph::detail::isomorphism_impl::operator()(const Graph1&, const Graph2&, const ArgPack&) const [with ArgPack = boost::parameter::aux::empty_arg_list; Graph1 = boost::adjacency_list; Graph2 = boost::adjacency_list]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/isomorphism.hpp:662:5: required from ‘typename boost::result_of(Param0, Param1, const ArgPack&)>::type boost::graph::isomorphism_with_named_params(const Param0&, const Param1&, const ArgPack&) [with Param0 = boost::adjacency_list; Param1 = boost::adjacency_list; ArgPack = boost::parameter::aux::empty_arg_list; typename boost::result_of(Param0, Param1, const ArgPack&)>::type = bool]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/isomorphism.hpp:666:1: required from ‘typename boost::result_of(Param0, Param1, const boost::parameter::aux::empty_arg_list&)>::type boost::isomorphism(const Param0&, const Param1&) [with Param0 = adjacency_list; Param1 = adjacency_list; typename result_of(Param0, Param1, const parameter::aux::empty_arg_list&)>::type = bool]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/is_kuratowski_subgraph.hpp:278:34: required from ‘bool boost::is_kuratowski_subgraph(const Graph&, ForwardIterator, ForwardIterator, VertexIndexMap) [with Graph = adjacency_list, property >; ForwardIterator = __gnu_cxx::__normal_iterator*, std::vector > >; VertexIndexMap = vec_adj_list_vertex_id_map, long unsigned int>]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/is_kuratowski_subgraph.hpp:290:34: required from ‘bool boost::is_kuratowski_subgraph(const Graph&, ForwardIterator, ForwardIterator) [with Graph = adjacency_list, property >; ForwardIterator = __gnu_cxx::__normal_iterator*, std::vector > >]’ planar.cpp:435:37: required from here /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::CopyConstructible::~CopyConstructible() [with TT = boost::adjacency_iterator, long unsigned int, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator >, boost::no_property>*, std::vector >, boost::no_property>, std::allocator >, boost::no_property> > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, long int>]’ 37 | ~model() | ^ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:167:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 167 | BOOST_CONCEPT_USAGE(CopyConstructible) { | ^~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::Convertible, boost::iterators::incrementable_traversal_tag>]’: /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements, boost::iterators::incrementable_traversal_tag> >]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:208:5: required from ‘struct boost::Convertible, boost::iterators::incrementable_traversal_tag>’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::Convertible, boost::iterators::incrementable_traversal_tag>]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied, boost::iterators::incrementable_traversal_tag> >::value’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied, boost::iterators::incrementable_traversal_tag> >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:72:8: [ skipping 16 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/isomorphism.hpp:651:42: required from ‘bool boost::graph::detail::isomorphism_impl::operator()(const Graph1&, const Graph2&, const ArgPack&) const [with ArgPack = boost::parameter::aux::empty_arg_list; Graph1 = boost::adjacency_list; Graph2 = boost::adjacency_list]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/isomorphism.hpp:662:5: required from ‘typename boost::result_of(Param0, Param1, const ArgPack&)>::type boost::graph::isomorphism_with_named_params(const Param0&, const Param1&, const ArgPack&) [with Param0 = boost::adjacency_list; Param1 = boost::adjacency_list; ArgPack = boost::parameter::aux::empty_arg_list; typename boost::result_of(Param0, Param1, const ArgPack&)>::type = bool]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/isomorphism.hpp:666:1: required from ‘typename boost::result_of(Param0, Param1, const boost::parameter::aux::empty_arg_list&)>::type boost::isomorphism(const Param0&, const Param1&) [with Param0 = adjacency_list; Param1 = adjacency_list; typename result_of(Param0, Param1, const parameter::aux::empty_arg_list&)>::type = bool]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/is_kuratowski_subgraph.hpp:278:34: required from ‘bool boost::is_kuratowski_subgraph(const Graph&, ForwardIterator, ForwardIterator, VertexIndexMap) [with Graph = adjacency_list, property >; ForwardIterator = __gnu_cxx::__normal_iterator*, std::vector > >; VertexIndexMap = vec_adj_list_vertex_id_map, long unsigned int>]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/is_kuratowski_subgraph.hpp:290:34: required from ‘bool boost::is_kuratowski_subgraph(const Graph&, ForwardIterator, ForwardIterator) [with Graph = adjacency_list, property >; ForwardIterator = __gnu_cxx::__normal_iterator*, std::vector > >]’ planar.cpp:435:37: required from here /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::Convertible::~Convertible() [with X = boost::iterators::detail::iterator_category_with_traversal; Y = boost::iterators::incrementable_traversal_tag]’ 37 | ~model() | ^ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:208:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 208 | BOOST_CONCEPT_USAGE(Convertible) { | ^~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::range_detail::IncrementableIteratorConcept, long unsigned int, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator >, boost::no_property>*, std::vector >, boost::no_property>, std::allocator >, boost::no_property> > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, long int> >]’: /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements, long unsigned int, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator >, boost::no_property>*, std::vector >, boost::no_property>, std::allocator >, boost::no_property> > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, long int> > >]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/range/concepts.hpp:136:13: required from ‘struct boost::range_detail::IncrementableIteratorConcept, long unsigned int, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator >, boost::no_property>*, std::vector >, boost::no_property>, std::allocator >, boost::no_property> > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, long int> >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/range/concepts.hpp:147:16: required from ‘struct boost::range_detail::SinglePassIteratorConcept, long unsigned int, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator >, boost::no_property>*, std::vector >, boost::no_property>, std::allocator >, boost::no_property> > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, long int> >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::range_detail::SinglePassIteratorConcept, long unsigned int, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator >, boost::no_property>*, std::vector >, boost::no_property>, std::allocator >, boost::no_property> > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, long int> >]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied, long unsigned int, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator >, boost::no_property>*, std::vector >, boost::no_property>, std::allocator >, boost::no_property> > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, long int> > >::value’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:45:51: [ skipping 11 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/isomorphism.hpp:651:42: required from ‘bool boost::graph::detail::isomorphism_impl::operator()(const Graph1&, const Graph2&, const ArgPack&) const [with ArgPack = boost::parameter::aux::empty_arg_list; Graph1 = boost::adjacency_list; Graph2 = boost::adjacency_list]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/isomorphism.hpp:662:5: required from ‘typename boost::result_of(Param0, Param1, const ArgPack&)>::type boost::graph::isomorphism_with_named_params(const Param0&, const Param1&, const ArgPack&) [with Param0 = boost::adjacency_list; Param1 = boost::adjacency_list; ArgPack = boost::parameter::aux::empty_arg_list; typename boost::result_of(Param0, Param1, const ArgPack&)>::type = bool]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/isomorphism.hpp:666:1: required from ‘typename boost::result_of(Param0, Param1, const boost::parameter::aux::empty_arg_list&)>::type boost::isomorphism(const Param0&, const Param1&) [with Param0 = adjacency_list; Param1 = adjacency_list; typename result_of(Param0, Param1, const parameter::aux::empty_arg_list&)>::type = bool]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/is_kuratowski_subgraph.hpp:278:34: required from ‘bool boost::is_kuratowski_subgraph(const Graph&, ForwardIterator, ForwardIterator, VertexIndexMap) [with Graph = adjacency_list, property >; ForwardIterator = __gnu_cxx::__normal_iterator*, std::vector > >; VertexIndexMap = vec_adj_list_vertex_id_map, long unsigned int>]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/is_kuratowski_subgraph.hpp:290:34: required from ‘bool boost::is_kuratowski_subgraph(const Graph&, ForwardIterator, ForwardIterator) [with Graph = adjacency_list, property >; ForwardIterator = __gnu_cxx::__normal_iterator*, std::vector > >]’ planar.cpp:435:37: required from here /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::range_detail::IncrementableIteratorConcept::~IncrementableIteratorConcept() [with Iterator = boost::adjacency_iterator, long unsigned int, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator >, boost::no_property>*, std::vector >, boost::no_property>, std::allocator >, boost::no_property> > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, long int>]’ 37 | ~model() | ^ /home/omnipath/local/R/4.4-3.20/BH/include/boost/range/concepts.hpp:136:13: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 136 | BOOST_CONCEPT_USAGE(IncrementableIteratorConcept) | ^~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::EqualityComparable, long unsigned int, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator >, boost::no_property>*, std::vector >, boost::no_property>, std::allocator >, boost::no_property> > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, long int> >]’: /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements, long unsigned int, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator >, boost::no_property>*, std::vector >, boost::no_property>, std::allocator >, boost::no_property> > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, long int> > >]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:233:5: required from ‘struct boost::EqualityComparable, long unsigned int, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator >, boost::no_property>*, std::vector >, boost::no_property>, std::allocator >, boost::no_property> > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, long int> >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/range/concepts.hpp:147:16: required from ‘struct boost::range_detail::SinglePassIteratorConcept, long unsigned int, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator >, boost::no_property>*, std::vector >, boost::no_property>, std::allocator >, boost::no_property> > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, long int> >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::range_detail::SinglePassIteratorConcept, long unsigned int, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator >, boost::no_property>*, std::vector >, boost::no_property>, std::allocator >, boost::no_property> > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, long int> >]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied, long unsigned int, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator >, boost::no_property>*, std::vector >, boost::no_property>, std::allocator >, boost::no_property> > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, long int> > >::value’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:45:51: [ skipping 11 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/isomorphism.hpp:651:42: required from ‘bool boost::graph::detail::isomorphism_impl::operator()(const Graph1&, const Graph2&, const ArgPack&) const [with ArgPack = boost::parameter::aux::empty_arg_list; Graph1 = boost::adjacency_list; Graph2 = boost::adjacency_list]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/isomorphism.hpp:662:5: required from ‘typename boost::result_of(Param0, Param1, const ArgPack&)>::type boost::graph::isomorphism_with_named_params(const Param0&, const Param1&, const ArgPack&) [with Param0 = boost::adjacency_list; Param1 = boost::adjacency_list; ArgPack = boost::parameter::aux::empty_arg_list; typename boost::result_of(Param0, Param1, const ArgPack&)>::type = bool]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/isomorphism.hpp:666:1: required from ‘typename boost::result_of(Param0, Param1, const boost::parameter::aux::empty_arg_list&)>::type boost::isomorphism(const Param0&, const Param1&) [with Param0 = adjacency_list; Param1 = adjacency_list; typename result_of(Param0, Param1, const parameter::aux::empty_arg_list&)>::type = bool]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/is_kuratowski_subgraph.hpp:278:34: required from ‘bool boost::is_kuratowski_subgraph(const Graph&, ForwardIterator, ForwardIterator, VertexIndexMap) [with Graph = adjacency_list, property >; ForwardIterator = __gnu_cxx::__normal_iterator*, std::vector > >; VertexIndexMap = vec_adj_list_vertex_id_map, long unsigned int>]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/is_kuratowski_subgraph.hpp:290:34: required from ‘bool boost::is_kuratowski_subgraph(const Graph&, ForwardIterator, ForwardIterator) [with Graph = adjacency_list, property >; ForwardIterator = __gnu_cxx::__normal_iterator*, std::vector > >]’ planar.cpp:435:37: required from here /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::EqualityComparable::~EqualityComparable() [with TT = boost::adjacency_iterator, long unsigned int, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator >, boost::no_property>*, std::vector >, boost::no_property>, std::allocator >, boost::no_property> > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, long int>]’ 37 | ~model() | ^ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:233:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 233 | BOOST_CONCEPT_USAGE(EqualityComparable) { | ^~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::Convertible, boost::iterators::single_pass_traversal_tag>]’: /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements, boost::iterators::single_pass_traversal_tag> >]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:208:5: required from ‘struct boost::Convertible, boost::iterators::single_pass_traversal_tag>’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::Convertible, boost::iterators::single_pass_traversal_tag>]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied, boost::iterators::single_pass_traversal_tag> >::value’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied, boost::iterators::single_pass_traversal_tag> >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:72:8: [ skipping 15 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/isomorphism.hpp:651:42: required from ‘bool boost::graph::detail::isomorphism_impl::operator()(const Graph1&, const Graph2&, const ArgPack&) const [with ArgPack = boost::parameter::aux::empty_arg_list; Graph1 = boost::adjacency_list; Graph2 = boost::adjacency_list]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/isomorphism.hpp:662:5: required from ‘typename boost::result_of(Param0, Param1, const ArgPack&)>::type boost::graph::isomorphism_with_named_params(const Param0&, const Param1&, const ArgPack&) [with Param0 = boost::adjacency_list; Param1 = boost::adjacency_list; ArgPack = boost::parameter::aux::empty_arg_list; typename boost::result_of(Param0, Param1, const ArgPack&)>::type = bool]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/isomorphism.hpp:666:1: required from ‘typename boost::result_of(Param0, Param1, const boost::parameter::aux::empty_arg_list&)>::type boost::isomorphism(const Param0&, const Param1&) [with Param0 = adjacency_list; Param1 = adjacency_list; typename result_of(Param0, Param1, const parameter::aux::empty_arg_list&)>::type = bool]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/is_kuratowski_subgraph.hpp:278:34: required from ‘bool boost::is_kuratowski_subgraph(const Graph&, ForwardIterator, ForwardIterator, VertexIndexMap) [with Graph = adjacency_list, property >; ForwardIterator = __gnu_cxx::__normal_iterator*, std::vector > >; VertexIndexMap = vec_adj_list_vertex_id_map, long unsigned int>]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/is_kuratowski_subgraph.hpp:290:34: required from ‘bool boost::is_kuratowski_subgraph(const Graph&, ForwardIterator, ForwardIterator) [with Graph = adjacency_list, property >; ForwardIterator = __gnu_cxx::__normal_iterator*, std::vector > >]’ planar.cpp:435:37: required from here /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::Convertible::~Convertible() [with X = boost::iterators::detail::iterator_category_with_traversal; Y = boost::iterators::single_pass_traversal_tag]’ 37 | ~model() | ^ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:208:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 208 | BOOST_CONCEPT_USAGE(Convertible) { | ^~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::range_detail::SinglePassIteratorConcept, long unsigned int, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator >, boost::no_property>*, std::vector >, boost::no_property>, std::allocator >, boost::no_property> > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, long int> >]’: /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements, long unsigned int, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator >, boost::no_property>*, std::vector >, boost::no_property>, std::allocator >, boost::no_property> > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, long int> > >]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/range/concepts.hpp:158:13: required from ‘struct boost::range_detail::SinglePassIteratorConcept, long unsigned int, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator >, boost::no_property>*, std::vector >, boost::no_property>, std::allocator >, boost::no_property> > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, long int> >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::range_detail::SinglePassIteratorConcept, long unsigned int, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator >, boost::no_property>*, std::vector >, boost::no_property>, std::allocator >, boost::no_property> > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, long int> >]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied, long unsigned int, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator >, boost::no_property>*, std::vector >, boost::no_property>, std::allocator >, boost::no_property> > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, long int> > >::value’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied, long unsigned int, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator >, boost::no_property>*, std::vector >, boost::no_property>, std::allocator >, boost::no_property> > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, long int> > >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:72:8: [ skipping 10 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/isomorphism.hpp:651:42: required from ‘bool boost::graph::detail::isomorphism_impl::operator()(const Graph1&, const Graph2&, const ArgPack&) const [with ArgPack = boost::parameter::aux::empty_arg_list; Graph1 = boost::adjacency_list; Graph2 = boost::adjacency_list]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/isomorphism.hpp:662:5: required from ‘typename boost::result_of(Param0, Param1, const ArgPack&)>::type boost::graph::isomorphism_with_named_params(const Param0&, const Param1&, const ArgPack&) [with Param0 = boost::adjacency_list; Param1 = boost::adjacency_list; ArgPack = boost::parameter::aux::empty_arg_list; typename boost::result_of(Param0, Param1, const ArgPack&)>::type = bool]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/isomorphism.hpp:666:1: required from ‘typename boost::result_of(Param0, Param1, const boost::parameter::aux::empty_arg_list&)>::type boost::isomorphism(const Param0&, const Param1&) [with Param0 = adjacency_list; Param1 = adjacency_list; typename result_of(Param0, Param1, const parameter::aux::empty_arg_list&)>::type = bool]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/is_kuratowski_subgraph.hpp:278:34: required from ‘bool boost::is_kuratowski_subgraph(const Graph&, ForwardIterator, ForwardIterator, VertexIndexMap) [with Graph = adjacency_list, property >; ForwardIterator = __gnu_cxx::__normal_iterator*, std::vector > >; VertexIndexMap = vec_adj_list_vertex_id_map, long unsigned int>]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/is_kuratowski_subgraph.hpp:290:34: required from ‘bool boost::is_kuratowski_subgraph(const Graph&, ForwardIterator, ForwardIterator) [with Graph = adjacency_list, property >; ForwardIterator = __gnu_cxx::__normal_iterator*, std::vector > >]’ planar.cpp:435:37: required from here /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::range_detail::SinglePassIteratorConcept::~SinglePassIteratorConcept() [with Iterator = boost::adjacency_iterator, long unsigned int, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator >, boost::no_property>*, std::vector >, boost::no_property>, std::allocator >, boost::no_property> > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, long int>]’ 37 | ~model() | ^ /home/omnipath/local/R/4.4-3.20/BH/include/boost/range/concepts.hpp:158:13: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 158 | BOOST_CONCEPT_USAGE(SinglePassIteratorConcept) | ^~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::SinglePassRangeConcept, long unsigned int, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator >, boost::no_property>*, std::vector >, boost::no_property>, std::allocator >, boost::no_property> > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, long int>, boost::adjacency_iterator, long unsigned int, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator >, boost::no_property>*, std::vector >, boost::no_property>, std::allocator >, boost::no_property> > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, long int> > >]’: /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements, long unsigned int, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator >, boost::no_property>*, std::vector >, boost::no_property>, std::allocator >, boost::no_property> > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, long int>, boost::adjacency_iterator, long unsigned int, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator >, boost::no_property>*, std::vector >, boost::no_property>, std::allocator >, boost::no_property> > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, long int> > > >]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/range/concepts.hpp:284:9: required from ‘struct boost::SinglePassRangeConcept, long unsigned int, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator >, boost::no_property>*, std::vector >, boost::no_property>, std::allocator >, boost::no_property> > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, long int>, boost::adjacency_iterator, long unsigned int, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator >, boost::no_property>*, std::vector >, boost::no_property>, std::allocator >, boost::no_property> > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, long int> > >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::SinglePassRangeConcept, long unsigned int, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator >, boost::no_property>*, std::vector >, boost::no_property>, std::allocator >, boost::no_property> > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, long int>, boost::adjacency_iterator, long unsigned int, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator >, boost::no_property>*, std::vector >, boost::no_property>, std::allocator >, boost::no_property> > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, long int> > >]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied, long unsigned int, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator >, boost::no_property>*, std::vector >, boost::no_property>, std::allocator >, boost::no_property> > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, long int>, boost::adjacency_iterator, long unsigned int, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator >, boost::no_property>*, std::vector >, boost::no_property>, std::allocator >, boost::no_property> > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, long int> > > >::value’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied, long unsigned int, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator >, boost::no_property>*, std::vector >, boost::no_property>, std::allocator >, boost::no_property> > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, long int>, boost::adjacency_iterator, long unsigned int, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator >, boost::no_property>*, std::vector >, boost::no_property>, std::allocator >, boost::no_property> > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, long int> > > >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:72:8: [ skipping 5 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/isomorphism.hpp:651:42: required from ‘bool boost::graph::detail::isomorphism_impl::operator()(const Graph1&, const Graph2&, const ArgPack&) const [with ArgPack = boost::parameter::aux::empty_arg_list; Graph1 = boost::adjacency_list; Graph2 = boost::adjacency_list]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/isomorphism.hpp:662:5: required from ‘typename boost::result_of(Param0, Param1, const ArgPack&)>::type boost::graph::isomorphism_with_named_params(const Param0&, const Param1&, const ArgPack&) [with Param0 = boost::adjacency_list; Param1 = boost::adjacency_list; ArgPack = boost::parameter::aux::empty_arg_list; typename boost::result_of(Param0, Param1, const ArgPack&)>::type = bool]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/isomorphism.hpp:666:1: required from ‘typename boost::result_of(Param0, Param1, const boost::parameter::aux::empty_arg_list&)>::type boost::isomorphism(const Param0&, const Param1&) [with Param0 = adjacency_list; Param1 = adjacency_list; typename result_of(Param0, Param1, const parameter::aux::empty_arg_list&)>::type = bool]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/is_kuratowski_subgraph.hpp:278:34: required from ‘bool boost::is_kuratowski_subgraph(const Graph&, ForwardIterator, ForwardIterator, VertexIndexMap) [with Graph = adjacency_list, property >; ForwardIterator = __gnu_cxx::__normal_iterator*, std::vector > >; VertexIndexMap = vec_adj_list_vertex_id_map, long unsigned int>]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/is_kuratowski_subgraph.hpp:290:34: required from ‘bool boost::is_kuratowski_subgraph(const Graph&, ForwardIterator, ForwardIterator) [with Graph = adjacency_list, property >; ForwardIterator = __gnu_cxx::__normal_iterator*, std::vector > >]’ planar.cpp:435:37: required from here /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::SinglePassRangeConcept::~SinglePassRangeConcept() [with T = const std::pair, long unsigned int, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator >, boost::no_property>*, std::vector >, boost::no_property>, std::allocator >, boost::no_property> > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, long int>, boost::adjacency_iterator, long unsigned int, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator >, boost::no_property>*, std::vector >, boost::no_property>, std::allocator >, boost::no_property> > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, long int> >]’ 37 | ~model() | ^ /home/omnipath/local/R/4.4-3.20/BH/include/boost/range/concepts.hpp:284:9: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 284 | BOOST_CONCEPT_USAGE(SinglePassRangeConcept) | ^~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::CopyConstructible >]’: /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements > >]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:167:5: required from ‘struct boost::CopyConstructible >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:165:3: required from ‘struct boost::CopyConstructibleConcept >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::CopyConstructibleConcept >]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied > >::value’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:45:51: [ skipping 10 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/depth_first_search.hpp:409:1: required from ‘typename boost::result_of(Param0, const typename boost::detail::convert_bgl_params_to_boost_parameter >::type&)>::type boost::depth_first_search(const Param0&, const bgl_named_params&) [with Param0 = filtered_graph, keep_all, maximum_cardinality_matching_verifier, long unsigned int*, vec_adj_list_vertex_id_map, long unsigned int> >::non_odd_vertex >, vec_adj_list_vertex_id_map, long unsigned int>, int, int&> > >; P = vec_adj_list_vertex_id_map, long unsigned int>; T = vertex_index_t; R = bgl_named_params, graph_visitor_t, no_property>; typename result_of(Param0, const typename detail::convert_bgl_params_to_boost_parameter >::type&)>::type = void; typename detail::convert_bgl_params_to_boost_parameter >::type = parameter::aux::arg_list, long unsigned int> >, parameter::aux::arg_list >, parameter::aux::empty_arg_list, std::integral_constant >, std::integral_constant >]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/max_cardinality_matching.hpp:779:27: required from ‘static bool boost::maximum_cardinality_matching_verifier::verify_matching(const Graph&, MateMap, VertexIndexMap) [with Graph = R_adjacency_list; MateMap = long unsigned int*; VertexIndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/max_cardinality_matching.hpp:807:79: required from ‘bool boost::matching(const Graph&, MateMap, VertexIndexMap) [with Graph = R_adjacency_list; MateMap = long unsigned int*; VertexIndexMap = vec_adj_list_vertex_id_map, long unsigned int>; AugmentingPathFinder = edmonds_augmenting_path_finder; InitialMatchingFinder = extra_greedy_matching; MatchingVerifier = maximum_cardinality_matching_verifier]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/max_cardinality_matching.hpp:817:48: required from ‘bool boost::checked_edmonds_maximum_cardinality_matching(const Graph&, MateMap, VertexIndexMap) [with Graph = R_adjacency_list; MateMap = long unsigned int*; VertexIndexMap = vec_adj_list_vertex_id_map, long unsigned int>]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/max_cardinality_matching.hpp:824:56: required from ‘bool boost::checked_edmonds_maximum_cardinality_matching(const Graph&, MateMap) [with Graph = R_adjacency_list; MateMap = long unsigned int*]’ planar.cpp:686:60: required from here /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::CopyConstructible::~CopyConstructible() [with TT = boost::detail::odd_components_counter]’ 37 | ~model() | ^ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:167:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 167 | BOOST_CONCEPT_USAGE(CopyConstructible) { | ^~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::concepts::Graph, boost::keep_all, boost::maximum_cardinality_matching_verifier, long unsigned int*, boost::vec_adj_list_vertex_id_map, long unsigned int> >::non_odd_vertex >, boost::vec_adj_list_vertex_id_map, long unsigned int>, int, int&> > > >]’: /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements, boost::keep_all, boost::maximum_cardinality_matching_verifier, long unsigned int*, boost::vec_adj_list_vertex_id_map, long unsigned int> >::non_odd_vertex >, boost::vec_adj_list_vertex_id_map, long unsigned int>, int, int&> > > > >]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/graph_concepts.hpp:66:5: required from ‘struct boost::concepts::Graph, boost::keep_all, boost::maximum_cardinality_matching_verifier, long unsigned int*, boost::vec_adj_list_vertex_id_map, long unsigned int> >::non_odd_vertex >, boost::vec_adj_list_vertex_id_map, long unsigned int>, int, int&> > > >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/graph_concepts.hpp:75:1: required from ‘struct boost::concepts::IncidenceGraph, boost::keep_all, boost::maximum_cardinality_matching_verifier, long unsigned int*, boost::vec_adj_list_vertex_id_map, long unsigned int> >::non_odd_vertex >, boost::vec_adj_list_vertex_id_map, long unsigned int>, int, int&> > > >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/graph_concepts.hpp:75:1: required from ‘struct boost::concepts::IncidenceGraphConcept, boost::keep_all, boost::maximum_cardinality_matching_verifier, long unsigned int*, boost::vec_adj_list_vertex_id_map, long unsigned int> >::non_odd_vertex >, boost::vec_adj_list_vertex_id_map, long unsigned int>, int, int&> > > >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::concepts::IncidenceGraphConcept, boost::keep_all, boost::maximum_cardinality_matching_verifier, long unsigned int*, boost::vec_adj_list_vertex_id_map, long unsigned int> >::non_odd_vertex >, boost::vec_adj_list_vertex_id_map, long unsigned int>, int, int&> > > >]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:42:5: [ skipping 7 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/depth_first_search.hpp:409:1: required from ‘typename boost::result_of(Param0, const typename boost::detail::convert_bgl_params_to_boost_parameter >::type&)>::type boost::depth_first_search(const Param0&, const bgl_named_params&) [with Param0 = filtered_graph, keep_all, maximum_cardinality_matching_verifier, long unsigned int*, vec_adj_list_vertex_id_map, long unsigned int> >::non_odd_vertex >, vec_adj_list_vertex_id_map, long unsigned int>, int, int&> > >; P = vec_adj_list_vertex_id_map, long unsigned int>; T = vertex_index_t; R = bgl_named_params, graph_visitor_t, no_property>; typename result_of(Param0, const typename detail::convert_bgl_params_to_boost_parameter >::type&)>::type = void; typename detail::convert_bgl_params_to_boost_parameter >::type = parameter::aux::arg_list, long unsigned int> >, parameter::aux::arg_list >, parameter::aux::empty_arg_list, std::integral_constant >, std::integral_constant >]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/max_cardinality_matching.hpp:779:27: required from ‘static bool boost::maximum_cardinality_matching_verifier::verify_matching(const Graph&, MateMap, VertexIndexMap) [with Graph = R_adjacency_list; MateMap = long unsigned int*; VertexIndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/max_cardinality_matching.hpp:807:79: required from ‘bool boost::matching(const Graph&, MateMap, VertexIndexMap) [with Graph = R_adjacency_list; MateMap = long unsigned int*; VertexIndexMap = vec_adj_list_vertex_id_map, long unsigned int>; AugmentingPathFinder = edmonds_augmenting_path_finder; InitialMatchingFinder = extra_greedy_matching; MatchingVerifier = maximum_cardinality_matching_verifier]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/max_cardinality_matching.hpp:817:48: required from ‘bool boost::checked_edmonds_maximum_cardinality_matching(const Graph&, MateMap, VertexIndexMap) [with Graph = R_adjacency_list; MateMap = long unsigned int*; VertexIndexMap = vec_adj_list_vertex_id_map, long unsigned int>]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/max_cardinality_matching.hpp:824:56: required from ‘bool boost::checked_edmonds_maximum_cardinality_matching(const Graph&, MateMap) [with Graph = R_adjacency_list; MateMap = long unsigned int*]’ planar.cpp:686:60: required from here /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::concepts::Graph::~Graph() [with G = boost::filtered_graph, boost::keep_all, boost::maximum_cardinality_matching_verifier, long unsigned int*, boost::vec_adj_list_vertex_id_map, long unsigned int> >::non_odd_vertex >, boost::vec_adj_list_vertex_id_map, long unsigned int>, int, int&> > >]’ 37 | ~model() | ^ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/graph_concepts.hpp:66:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 66 | BOOST_CONCEPT_USAGE(Graph) | ^~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::concepts::IncidenceGraph, boost::keep_all, boost::maximum_cardinality_matching_verifier, long unsigned int*, boost::vec_adj_list_vertex_id_map, long unsigned int> >::non_odd_vertex >, boost::vec_adj_list_vertex_id_map, long unsigned int>, int, int&> > > >]’: /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements, boost::keep_all, boost::maximum_cardinality_matching_verifier, long unsigned int*, boost::vec_adj_list_vertex_id_map, long unsigned int> >::non_odd_vertex >, boost::vec_adj_list_vertex_id_map, long unsigned int>, int, int&> > > > >]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/graph_concepts.hpp:87:5: required from ‘struct boost::concepts::IncidenceGraph, boost::keep_all, boost::maximum_cardinality_matching_verifier, long unsigned int*, boost::vec_adj_list_vertex_id_map, long unsigned int> >::non_odd_vertex >, boost::vec_adj_list_vertex_id_map, long unsigned int>, int, int&> > > >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/graph_concepts.hpp:75:1: required from ‘struct boost::concepts::IncidenceGraphConcept, boost::keep_all, boost::maximum_cardinality_matching_verifier, long unsigned int*, boost::vec_adj_list_vertex_id_map, long unsigned int> >::non_odd_vertex >, boost::vec_adj_list_vertex_id_map, long unsigned int>, int, int&> > > >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::concepts::IncidenceGraphConcept, boost::keep_all, boost::maximum_cardinality_matching_verifier, long unsigned int*, boost::vec_adj_list_vertex_id_map, long unsigned int> >::non_odd_vertex >, boost::vec_adj_list_vertex_id_map, long unsigned int>, int, int&> > > >]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied, boost::keep_all, boost::maximum_cardinality_matching_verifier, long unsigned int*, boost::vec_adj_list_vertex_id_map, long unsigned int> >::non_odd_vertex >, boost::vec_adj_list_vertex_id_map, long unsigned int>, int, int&> > > > >::value’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:45:51: [ skipping 6 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/depth_first_search.hpp:409:1: required from ‘typename boost::result_of(Param0, const typename boost::detail::convert_bgl_params_to_boost_parameter >::type&)>::type boost::depth_first_search(const Param0&, const bgl_named_params&) [with Param0 = filtered_graph, keep_all, maximum_cardinality_matching_verifier, long unsigned int*, vec_adj_list_vertex_id_map, long unsigned int> >::non_odd_vertex >, vec_adj_list_vertex_id_map, long unsigned int>, int, int&> > >; P = vec_adj_list_vertex_id_map, long unsigned int>; T = vertex_index_t; R = bgl_named_params, graph_visitor_t, no_property>; typename result_of(Param0, const typename detail::convert_bgl_params_to_boost_parameter >::type&)>::type = void; typename detail::convert_bgl_params_to_boost_parameter >::type = parameter::aux::arg_list, long unsigned int> >, parameter::aux::arg_list >, parameter::aux::empty_arg_list, std::integral_constant >, std::integral_constant >]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/max_cardinality_matching.hpp:779:27: required from ‘static bool boost::maximum_cardinality_matching_verifier::verify_matching(const Graph&, MateMap, VertexIndexMap) [with Graph = R_adjacency_list; MateMap = long unsigned int*; VertexIndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/max_cardinality_matching.hpp:807:79: required from ‘bool boost::matching(const Graph&, MateMap, VertexIndexMap) [with Graph = R_adjacency_list; MateMap = long unsigned int*; VertexIndexMap = vec_adj_list_vertex_id_map, long unsigned int>; AugmentingPathFinder = edmonds_augmenting_path_finder; InitialMatchingFinder = extra_greedy_matching; MatchingVerifier = maximum_cardinality_matching_verifier]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/max_cardinality_matching.hpp:817:48: required from ‘bool boost::checked_edmonds_maximum_cardinality_matching(const Graph&, MateMap, VertexIndexMap) [with Graph = R_adjacency_list; MateMap = long unsigned int*; VertexIndexMap = vec_adj_list_vertex_id_map, long unsigned int>]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/max_cardinality_matching.hpp:824:56: required from ‘bool boost::checked_edmonds_maximum_cardinality_matching(const Graph&, MateMap) [with Graph = R_adjacency_list; MateMap = long unsigned int*]’ planar.cpp:686:60: required from here /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::concepts::IncidenceGraph::~IncidenceGraph() [with G = boost::filtered_graph, boost::keep_all, boost::maximum_cardinality_matching_verifier, long unsigned int*, boost::vec_adj_list_vertex_id_map, long unsigned int> >::non_odd_vertex >, boost::vec_adj_list_vertex_id_map, long unsigned int>, int, int&> > >]’ 37 | ~model() | ^ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/graph_concepts.hpp:87:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 87 | BOOST_CONCEPT_USAGE(IncidenceGraph) | ^~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::constraint::failed() [with Model = boost::ReadablePropertyMapConcept, long unsigned int> >, long unsigned int>]’: /home/omnipath/local/R/4.4-3.20/BH/include/boost/property_map/property_map.hpp:206:7: required from ‘void boost::ReadWritePropertyMapConcept::constraints() [with PMap = boost::shared_array_property_map, long unsigned int> >; Key = long unsigned int]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::ReadWritePropertyMapConcept, long unsigned int> >, long unsigned int>]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied, long unsigned int> >, long unsigned int> >::value’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied, long unsigned int> >, long unsigned int> >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_, long unsigned int> >, long unsigned int>)>’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/depth_first_search.hpp:134:9: [ skipping 4 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/depth_first_search.hpp:409:1: required from ‘typename boost::result_of(Param0, const typename boost::detail::convert_bgl_params_to_boost_parameter >::type&)>::type boost::depth_first_search(const Param0&, const bgl_named_params&) [with Param0 = filtered_graph, keep_all, maximum_cardinality_matching_verifier, long unsigned int*, vec_adj_list_vertex_id_map, long unsigned int> >::non_odd_vertex >, vec_adj_list_vertex_id_map, long unsigned int>, int, int&> > >; P = vec_adj_list_vertex_id_map, long unsigned int>; T = vertex_index_t; R = bgl_named_params, graph_visitor_t, no_property>; typename result_of(Param0, const typename detail::convert_bgl_params_to_boost_parameter >::type&)>::type = void; typename detail::convert_bgl_params_to_boost_parameter >::type = parameter::aux::arg_list, long unsigned int> >, parameter::aux::arg_list >, parameter::aux::empty_arg_list, std::integral_constant >, std::integral_constant >]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/max_cardinality_matching.hpp:779:27: required from ‘static bool boost::maximum_cardinality_matching_verifier::verify_matching(const Graph&, MateMap, VertexIndexMap) [with Graph = R_adjacency_list; MateMap = long unsigned int*; VertexIndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/max_cardinality_matching.hpp:807:79: required from ‘bool boost::matching(const Graph&, MateMap, VertexIndexMap) [with Graph = R_adjacency_list; MateMap = long unsigned int*; VertexIndexMap = vec_adj_list_vertex_id_map, long unsigned int>; AugmentingPathFinder = edmonds_augmenting_path_finder; InitialMatchingFinder = extra_greedy_matching; MatchingVerifier = maximum_cardinality_matching_verifier]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/max_cardinality_matching.hpp:817:48: required from ‘bool boost::checked_edmonds_maximum_cardinality_matching(const Graph&, MateMap, VertexIndexMap) [with Graph = R_adjacency_list; MateMap = long unsigned int*; VertexIndexMap = vec_adj_list_vertex_id_map, long unsigned int>]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/max_cardinality_matching.hpp:824:56: required from ‘bool boost::checked_edmonds_maximum_cardinality_matching(const Graph&, MateMap) [with Graph = R_adjacency_list; MateMap = long unsigned int*]’ planar.cpp:686:60: required from here /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:65:52: warning: ‘this’ pointer is null [-Wnonnull] 65 | static void failed() { ((Model*)0)->constraints(); } | ~~~~~~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/property_map/property_map.hpp:147:10: note: in a call to non-static member function ‘void boost::ReadablePropertyMapConcept::constraints() [with PMap = boost::shared_array_property_map, long unsigned int> >; Key = long unsigned int]’ 147 | void constraints() { | ^~~~~~~~~~~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::constraint::failed() [with Model = boost::WritablePropertyMapConcept, long unsigned int> >, long unsigned int>]’: /home/omnipath/local/R/4.4-3.20/BH/include/boost/property_map/property_map.hpp:207:7: required from ‘void boost::ReadWritePropertyMapConcept::constraints() [with PMap = boost::shared_array_property_map, long unsigned int> >; Key = long unsigned int]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::ReadWritePropertyMapConcept, long unsigned int> >, long unsigned int>]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied, long unsigned int> >, long unsigned int> >::value’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied, long unsigned int> >, long unsigned int> >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_, long unsigned int> >, long unsigned int>)>’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/depth_first_search.hpp:134:9: [ skipping 4 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/depth_first_search.hpp:409:1: required from ‘typename boost::result_of(Param0, const typename boost::detail::convert_bgl_params_to_boost_parameter >::type&)>::type boost::depth_first_search(const Param0&, const bgl_named_params&) [with Param0 = filtered_graph, keep_all, maximum_cardinality_matching_verifier, long unsigned int*, vec_adj_list_vertex_id_map, long unsigned int> >::non_odd_vertex >, vec_adj_list_vertex_id_map, long unsigned int>, int, int&> > >; P = vec_adj_list_vertex_id_map, long unsigned int>; T = vertex_index_t; R = bgl_named_params, graph_visitor_t, no_property>; typename result_of(Param0, const typename detail::convert_bgl_params_to_boost_parameter >::type&)>::type = void; typename detail::convert_bgl_params_to_boost_parameter >::type = parameter::aux::arg_list, long unsigned int> >, parameter::aux::arg_list >, parameter::aux::empty_arg_list, std::integral_constant >, std::integral_constant >]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/max_cardinality_matching.hpp:779:27: required from ‘static bool boost::maximum_cardinality_matching_verifier::verify_matching(const Graph&, MateMap, VertexIndexMap) [with Graph = R_adjacency_list; MateMap = long unsigned int*; VertexIndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/max_cardinality_matching.hpp:807:79: required from ‘bool boost::matching(const Graph&, MateMap, VertexIndexMap) [with Graph = R_adjacency_list; MateMap = long unsigned int*; VertexIndexMap = vec_adj_list_vertex_id_map, long unsigned int>; AugmentingPathFinder = edmonds_augmenting_path_finder; InitialMatchingFinder = extra_greedy_matching; MatchingVerifier = maximum_cardinality_matching_verifier]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/max_cardinality_matching.hpp:817:48: required from ‘bool boost::checked_edmonds_maximum_cardinality_matching(const Graph&, MateMap, VertexIndexMap) [with Graph = R_adjacency_list; MateMap = long unsigned int*; VertexIndexMap = vec_adj_list_vertex_id_map, long unsigned int>]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/max_cardinality_matching.hpp:824:56: required from ‘bool boost::checked_edmonds_maximum_cardinality_matching(const Graph&, MateMap) [with Graph = R_adjacency_list; MateMap = long unsigned int*]’ planar.cpp:686:60: required from here /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:65:52: warning: ‘this’ pointer is null [-Wnonnull] 65 | static void failed() { ((Model*)0)->constraints(); } | ~~~~~~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/property_map/property_map.hpp:179:10: note: in a call to non-static member function ‘void boost::WritablePropertyMapConcept::constraints() [with PMap = boost::shared_array_property_map, long unsigned int> >; Key = long unsigned int]’ 179 | void constraints() { | ^~~~~~~~~~~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements > >, boost::property >*, std::vector > >, boost::property >, std::allocator > >, boost::property > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >]’: /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:145:5: required from ‘struct boost::Assignable > >, boost::property >*, std::vector > >, boost::property >, std::allocator > >, boost::property > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:502:3: required from ‘struct boost::InputIterator > >, boost::property >*, std::vector > >, boost::property >, std::allocator > >, boost::property > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::InputIterator > >, boost::property >*, std::vector > >, boost::property >, std::allocator > >, boost::property > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> >]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied > >, boost::property >*, std::vector > >, boost::property >, std::allocator > >, boost::property > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::value’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied > >, boost::property >*, std::vector > >, boost::property >, std::allocator > >, boost::property > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:72:8: [ skipping 7 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/depth_first_search.hpp:397:42: required from ‘void boost::graph::detail::depth_first_search_impl::operator()(const Graph&, const ArgPack&) const [with ArgPack = boost::parameter::aux::arg_list >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&> > >, boost::parameter::aux::empty_arg_list, std::integral_constant >; Graph = boost::adjacency_list, boost::property >]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/depth_first_search.hpp:406:5: required from ‘typename boost::result_of(Param0, const ArgPack&)>::type boost::graph::depth_first_search_with_named_params(const Param0&, const ArgPack&) [with Param0 = boost::adjacency_list, boost::property >; ArgPack = boost::parameter::aux::arg_list >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&> > >, boost::parameter::aux::empty_arg_list, std::integral_constant >; typename boost::result_of(Param0, const ArgPack&)>::type = void]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/depth_first_search.hpp:409:1: required from ‘typename boost::result_of(Param0, const typename boost::detail::convert_bgl_params_to_boost_parameter >::type&)>::type boost::depth_first_search(const Param0&, const bgl_named_params&) [with Param0 = adjacency_list, property >; P = detail::components_recorder >, vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&> >; T = graph_visitor_t; R = no_property; typename result_of(Param0, const typename detail::convert_bgl_params_to_boost_parameter >::type&)>::type = void; typename detail::convert_bgl_params_to_boost_parameter >::type = parameter::aux::arg_list >, vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&> > >, parameter::aux::empty_arg_list, std::integral_constant >]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/connected_components.hpp:106:23: required from ‘typename boost::property_traits::value_type boost::connected_components(const Graph&, ComponentMap, typename enable_if_c::traversal_category>::value, graph::detail::no_parameter>::type) [with Graph = adjacency_list, property >; ComponentMap = iterator_property_map<__gnu_cxx::__normal_iterator >, vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>; typename property_traits::value_type = long unsigned int; typename enable_if_c::traversal_category>::value, graph::detail::no_parameter>::type = graph::detail::no_parameter; typename graph_traits::traversal_category = undir_adj_list_traversal_tag]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/make_connected.hpp:38:51: required from ‘void boost::make_connected(Graph&, VertexIndexMap, AddEdgeVisitor&) [with Graph = adjacency_list, property >; VertexIndexMap = vec_adj_list_vertex_id_map, long unsigned int>; AddEdgeVisitor = my_add_edge_visitor, property >, long unsigned int>]’ planar.cpp:211:26: required from here /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::Assignable > >, boost::property >*, std::vector > >, boost::property >, std::allocator > >, boost::property > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> >]’ 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ^ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements > >, boost::property >*, std::vector > >, boost::property >, std::allocator > >, boost::property > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >]’: /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:233:5: required from ‘struct boost::EqualityComparable > >, boost::property >*, std::vector > >, boost::property >, std::allocator > >, boost::property > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:502:3: required from ‘struct boost::InputIterator > >, boost::property >*, std::vector > >, boost::property >, std::allocator > >, boost::property > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::InputIterator > >, boost::property >*, std::vector > >, boost::property >, std::allocator > >, boost::property > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> >]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied > >, boost::property >*, std::vector > >, boost::property >, std::allocator > >, boost::property > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::value’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied > >, boost::property >*, std::vector > >, boost::property >, std::allocator > >, boost::property > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:72:8: [ skipping 7 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/depth_first_search.hpp:397:42: required from ‘void boost::graph::detail::depth_first_search_impl::operator()(const Graph&, const ArgPack&) const [with ArgPack = boost::parameter::aux::arg_list >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&> > >, boost::parameter::aux::empty_arg_list, std::integral_constant >; Graph = boost::adjacency_list, boost::property >]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/depth_first_search.hpp:406:5: required from ‘typename boost::result_of(Param0, const ArgPack&)>::type boost::graph::depth_first_search_with_named_params(const Param0&, const ArgPack&) [with Param0 = boost::adjacency_list, boost::property >; ArgPack = boost::parameter::aux::arg_list >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&> > >, boost::parameter::aux::empty_arg_list, std::integral_constant >; typename boost::result_of(Param0, const ArgPack&)>::type = void]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/depth_first_search.hpp:409:1: required from ‘typename boost::result_of(Param0, const typename boost::detail::convert_bgl_params_to_boost_parameter >::type&)>::type boost::depth_first_search(const Param0&, const bgl_named_params&) [with Param0 = adjacency_list, property >; P = detail::components_recorder >, vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&> >; T = graph_visitor_t; R = no_property; typename result_of(Param0, const typename detail::convert_bgl_params_to_boost_parameter >::type&)>::type = void; typename detail::convert_bgl_params_to_boost_parameter >::type = parameter::aux::arg_list >, vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&> > >, parameter::aux::empty_arg_list, std::integral_constant >]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/connected_components.hpp:106:23: required from ‘typename boost::property_traits::value_type boost::connected_components(const Graph&, ComponentMap, typename enable_if_c::traversal_category>::value, graph::detail::no_parameter>::type) [with Graph = adjacency_list, property >; ComponentMap = iterator_property_map<__gnu_cxx::__normal_iterator >, vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>; typename property_traits::value_type = long unsigned int; typename enable_if_c::traversal_category>::value, graph::detail::no_parameter>::type = graph::detail::no_parameter; typename graph_traits::traversal_category = undir_adj_list_traversal_tag]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/make_connected.hpp:38:51: required from ‘void boost::make_connected(Graph&, VertexIndexMap, AddEdgeVisitor&) [with Graph = adjacency_list, property >; VertexIndexMap = vec_adj_list_vertex_id_map, long unsigned int>; AddEdgeVisitor = my_add_edge_visitor, property >, long unsigned int>]’ planar.cpp:211:26: required from here /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::EqualityComparable > >, boost::property >*, std::vector > >, boost::property >, std::allocator > >, boost::property > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> >]’ 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ^ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements > >, boost::property >*, std::vector > >, boost::property >, std::allocator > >, boost::property > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >]’: /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:512:7: required from ‘struct boost::InputIterator > >, boost::property >*, std::vector > >, boost::property >, std::allocator > >, boost::property > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::InputIterator > >, boost::property >*, std::vector > >, boost::property >, std::allocator > >, boost::property > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> >]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied > >, boost::property >*, std::vector > >, boost::property >, std::allocator > >, boost::property > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::value’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied > >, boost::property >*, std::vector > >, boost::property >, std::allocator > >, boost::property > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_ > >, boost::property >*, std::vector > >, boost::property >, std::allocator > >, boost::property > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> >)>’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/graph_concepts.hpp:53:35: [ skipping 6 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/depth_first_search.hpp:397:42: required from ‘void boost::graph::detail::depth_first_search_impl::operator()(const Graph&, const ArgPack&) const [with ArgPack = boost::parameter::aux::arg_list >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&> > >, boost::parameter::aux::empty_arg_list, std::integral_constant >; Graph = boost::adjacency_list, boost::property >]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/depth_first_search.hpp:406:5: required from ‘typename boost::result_of(Param0, const ArgPack&)>::type boost::graph::depth_first_search_with_named_params(const Param0&, const ArgPack&) [with Param0 = boost::adjacency_list, boost::property >; ArgPack = boost::parameter::aux::arg_list >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&> > >, boost::parameter::aux::empty_arg_list, std::integral_constant >; typename boost::result_of(Param0, const ArgPack&)>::type = void]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/depth_first_search.hpp:409:1: required from ‘typename boost::result_of(Param0, const typename boost::detail::convert_bgl_params_to_boost_parameter >::type&)>::type boost::depth_first_search(const Param0&, const bgl_named_params&) [with Param0 = adjacency_list, property >; P = detail::components_recorder >, vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&> >; T = graph_visitor_t; R = no_property; typename result_of(Param0, const typename detail::convert_bgl_params_to_boost_parameter >::type&)>::type = void; typename detail::convert_bgl_params_to_boost_parameter >::type = parameter::aux::arg_list >, vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&> > >, parameter::aux::empty_arg_list, std::integral_constant >]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/connected_components.hpp:106:23: required from ‘typename boost::property_traits::value_type boost::connected_components(const Graph&, ComponentMap, typename enable_if_c::traversal_category>::value, graph::detail::no_parameter>::type) [with Graph = adjacency_list, property >; ComponentMap = iterator_property_map<__gnu_cxx::__normal_iterator >, vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>; typename property_traits::value_type = long unsigned int; typename enable_if_c::traversal_category>::value, graph::detail::no_parameter>::type = graph::detail::no_parameter; typename graph_traits::traversal_category = undir_adj_list_traversal_tag]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/make_connected.hpp:38:51: required from ‘void boost::make_connected(Graph&, VertexIndexMap, AddEdgeVisitor&) [with Graph = adjacency_list, property >; VertexIndexMap = vec_adj_list_vertex_id_map, long unsigned int>; AddEdgeVisitor = my_add_edge_visitor, property >, long unsigned int>]’ planar.cpp:211:26: required from here /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::InputIterator > >, boost::property >*, std::vector > >, boost::property >, std::allocator > >, boost::property > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> >]’ 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ^ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::InputIterator > >, boost::property >*, std::vector > >, boost::property >, std::allocator > >, boost::property > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> >]’: /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/graph_concepts.hpp:53:35: required from ‘boost::concepts::MultiPassInputIterator::~MultiPassInputIterator() [with T = boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >, boost::property >*, std::vector > >, boost::property >, std::allocator > >, boost::property > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::MultiPassInputIterator > >, boost::property >*, std::vector > >, boost::property >, std::allocator > >, boost::property > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> >]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/graph_concepts.hpp:89:9: required from ‘boost::concepts::IncidenceGraph::~IncidenceGraph() [with G = boost::adjacency_list, boost::property >]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/graph_concepts.hpp:75:1: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::IncidenceGraphConcept, boost::property > >]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/depth_first_search.hpp:129:9: [ skipping 2 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/depth_first_search.hpp:397:42: required from ‘void boost::graph::detail::depth_first_search_impl::operator()(const Graph&, const ArgPack&) const [with ArgPack = boost::parameter::aux::arg_list >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&> > >, boost::parameter::aux::empty_arg_list, std::integral_constant >; Graph = boost::adjacency_list, boost::property >]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/depth_first_search.hpp:406:5: required from ‘typename boost::result_of(Param0, const ArgPack&)>::type boost::graph::depth_first_search_with_named_params(const Param0&, const ArgPack&) [with Param0 = boost::adjacency_list, boost::property >; ArgPack = boost::parameter::aux::arg_list >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&> > >, boost::parameter::aux::empty_arg_list, std::integral_constant >; typename boost::result_of(Param0, const ArgPack&)>::type = void]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/depth_first_search.hpp:409:1: required from ‘typename boost::result_of(Param0, const typename boost::detail::convert_bgl_params_to_boost_parameter >::type&)>::type boost::depth_first_search(const Param0&, const bgl_named_params&) [with Param0 = adjacency_list, property >; P = detail::components_recorder >, vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&> >; T = graph_visitor_t; R = no_property; typename result_of(Param0, const typename detail::convert_bgl_params_to_boost_parameter >::type&)>::type = void; typename detail::convert_bgl_params_to_boost_parameter >::type = parameter::aux::arg_list >, vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&> > >, parameter::aux::empty_arg_list, std::integral_constant >]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/connected_components.hpp:106:23: required from ‘typename boost::property_traits::value_type boost::connected_components(const Graph&, ComponentMap, typename enable_if_c::traversal_category>::value, graph::detail::no_parameter>::type) [with Graph = adjacency_list, property >; ComponentMap = iterator_property_map<__gnu_cxx::__normal_iterator >, vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>; typename property_traits::value_type = long unsigned int; typename enable_if_c::traversal_category>::value, graph::detail::no_parameter>::type = graph::detail::no_parameter; typename graph_traits::traversal_category = undir_adj_list_traversal_tag]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/make_connected.hpp:38:51: required from ‘void boost::make_connected(Graph&, VertexIndexMap, AddEdgeVisitor&) [with Graph = adjacency_list, property >; VertexIndexMap = vec_adj_list_vertex_id_map, long unsigned int>; AddEdgeVisitor = my_add_edge_visitor, property >, long unsigned int>]’ planar.cpp:211:26: required from here /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::InputIterator::~InputIterator() [with TT = boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >, boost::property >*, std::vector > >, boost::property >, std::allocator > >, boost::property > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>]’ 37 | ~model() | ^ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:512:7: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 512 | BOOST_CONCEPT_USAGE(InputIterator) | ^~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::constraint::failed() [with Model = boost::DFSVisitorConcept >, boost::adj_list_edge_property_map, boost::edge_index_t>, long unsigned int, long unsigned int&>, boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>, boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>, boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>, std::back_insert_iterator >, std::stack, std::deque, std::allocator > > >, std::vector, boost::vec_adj_list_vertex_id_map, long unsigned int>, boost::dfs_visitor<> >, boost::adjacency_list, boost::property > >]’: /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/depth_first_search.hpp:130:9: required from ‘void boost::depth_first_search(const VertexListGraph&, DFSVisitor, ColorMap, typename graph_traits::vertex_descriptor) [with VertexListGraph = adjacency_list, property >; DFSVisitor = detail::biconnected_components_visitor >, adj_list_edge_property_map, edge_index_t>, long unsigned int, long unsigned int&>, iterator_property_map<__gnu_cxx::__normal_iterator >, vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>, iterator_property_map<__gnu_cxx::__normal_iterator >, vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>, iterator_property_map<__gnu_cxx::__normal_iterator >, vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>, std::back_insert_iterator >, std::stack, std::deque, std::allocator > > >, std::vector, vec_adj_list_vertex_id_map, long unsigned int>, dfs_visitor<> >; ColorMap = shared_array_property_map, long unsigned int> >; typename graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/depth_first_search.hpp:397:42: required from ‘void boost::graph::detail::depth_first_search_impl::operator()(const Graph&, const ArgPack&) const [with ArgPack = boost::parameter::aux::arg_list, long unsigned int> >, boost::parameter::aux::arg_list >, boost::adj_list_edge_property_map, boost::edge_index_t>, long unsigned int, long unsigned int&>, boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>, boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>, boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>, std::back_insert_iterator >, std::stack, std::deque, std::allocator > > >, std::vector, boost::vec_adj_list_vertex_id_map, long unsigned int>, boost::dfs_visitor<> > >, boost::parameter::aux::empty_arg_list, std::integral_constant >, std::integral_constant >; Graph = boost::adjacency_list, boost::property >]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/depth_first_search.hpp:406:5: required from ‘typename boost::result_of(Param0, const ArgPack&)>::type boost::graph::depth_first_search_with_named_params(const Param0&, const ArgPack&) [with Param0 = boost::adjacency_list, boost::property >; ArgPack = boost::parameter::aux::arg_list, long unsigned int> >, boost::parameter::aux::arg_list >, boost::adj_list_edge_property_map, boost::edge_index_t>, long unsigned int, long unsigned int&>, boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>, boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>, boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>, std::back_insert_iterator >, std::stack, std::deque, std::allocator > > >, std::vector, boost::vec_adj_list_vertex_id_map, long unsigned int>, boost::dfs_visitor<> > >, boost::parameter::aux::empty_arg_list, std::integral_constant >, std::integral_constant >; typename boost::result_of(Param0, const ArgPack&)>::type = void]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/depth_first_search.hpp:409:1: required from ‘typename boost::result_of(Param0, const typename boost::detail::convert_bgl_params_to_boost_parameter >::type&)>::type boost::depth_first_search(const Param0&, const bgl_named_params&) [with Param0 = adjacency_list, property >; P = vec_adj_list_vertex_id_map, long unsigned int>; T = vertex_index_t; R = bgl_named_params >, adj_list_edge_property_map, edge_index_t>, long unsigned int, long unsigned int&>, iterator_property_map<__gnu_cxx::__normal_iterator >, vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>, iterator_property_map<__gnu_cxx::__normal_iterator >, vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>, iterator_property_map<__gnu_cxx::__normal_iterator >, vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>, std::back_insert_iterator >, std::stack, std::deque, std::allocator > > >, std::vector, vec_adj_list_vertex_id_map, long unsigned int>, dfs_visitor<> >, graph_visitor_t, no_property>; typename result_of(Param0, const typename detail::convert_bgl_params_to_boost_parameter >::type&)>::type = void; typename detail::convert_bgl_params_to_boost_parameter >::type = parameter::aux::arg_list, long unsigned int> >, parameter::aux::arg_list >, adj_list_edge_property_map, edge_index_t>, long unsigned int, long unsigned int&>, iterator_property_map<__gnu_cxx::__normal_iterator >, vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>, iterator_property_map<__gnu_cxx::__normal_iterator >, vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>, iterator_property_map<__gnu_cxx::__normal_iterator >, vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>, std::back_insert_iterator >, std::stack, std::deque, std::allocator > > >, std::vector, vec_adj_list_vertex_id_map, long unsigned int>, dfs_visitor<> > >, parameter::aux::empty_arg_list, std::integral_constant >, std::integral_constant >]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/biconnected_components.hpp:211:27: [ skipping 2 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/biconnected_components.hpp:295:60: required from ‘static std::pair boost::detail::bicomp_dispatch2::apply(const Graph&, ComponentMap, OutputIterator, VertexIndexMap, DiscoverTimeMap, const boost::bgl_named_params&, boost::param_not_found) [with Graph = boost::adjacency_list, boost::property >; ComponentMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::adj_list_edge_property_map, boost::edge_index_t>, long unsigned int, long unsigned int&>; OutputIterator = std::back_insert_iterator >; VertexIndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>; DiscoverTimeMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>; P = int; T = boost::buffer_param_t; R = boost::no_property]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/biconnected_components.hpp:336:60: required from ‘static std::pair boost::detail::bicomp_dispatch1::apply(const Graph&, ComponentMap, OutputIterator, VertexIndexMap, const boost::bgl_named_params&, boost::param_not_found) [with Graph = boost::adjacency_list, boost::property >; ComponentMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::adj_list_edge_property_map, boost::edge_index_t>, long unsigned int, long unsigned int&>; OutputIterator = std::back_insert_iterator >; VertexIndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>; P = int; T = boost::buffer_param_t; R = boost::no_property]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/biconnected_components.hpp:368:60: required from ‘std::pair boost::biconnected_components(const Graph&, ComponentMap, OutputIterator, const bgl_named_params&) [with Graph = adjacency_list, property >; ComponentMap = iterator_property_map<__gnu_cxx::__normal_iterator >, adj_list_edge_property_map, edge_index_t>, long unsigned int, long unsigned int&>; OutputIterator = std::back_insert_iterator >; P = int; T = buffer_param_t; R = no_property]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/biconnected_components.hpp:377:34: required from ‘std::pair boost::biconnected_components(const Graph&, ComponentMap, OutputIterator) [with Graph = adjacency_list, property >; ComponentMap = iterator_property_map<__gnu_cxx::__normal_iterator >, adj_list_edge_property_map, edge_index_t>, long unsigned int, long unsigned int&>; OutputIterator = std::back_insert_iterator >]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/make_biconnected_planar.hpp:44:27: required from ‘void boost::make_biconnected_planar(Graph&, PlanarEmbedding, EdgeIndexMap, AddEdgeVisitor&) [with Graph = adjacency_list, property >; PlanarEmbedding = std::vector >*; EdgeIndexMap = adj_list_edge_property_map, edge_index_t>; AddEdgeVisitor = my_add_edge_visitor, property >, long unsigned int>]’ planar.cpp:213:35: required from here /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:65:52: warning: ‘this’ pointer is null [-Wnonnull] 65 | static void failed() { ((Model*)0)->constraints(); } | ~~~~~~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/depth_first_search.hpp:39:10: note: in a call to non-static member function ‘void boost::DFSVisitorConcept::constraints() [with Visitor = boost::detail::biconnected_components_visitor >, boost::adj_list_edge_property_map, boost::edge_index_t>, long unsigned int, long unsigned int&>, boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>, boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>, boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>, std::back_insert_iterator >, std::stack, std::deque, std::allocator > > >, std::vector, boost::vec_adj_list_vertex_id_map, long unsigned int>, boost::dfs_visitor<> >; Graph = boost::adjacency_list, boost::property >]’ 39 | void constraints() | ^~~~~~~~~~~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::Assignable >]’: /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements > >]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:145:5: required from ‘struct boost::Assignable >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:502:3: required from ‘struct boost::InputIterator >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::InputIterator >]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied > >::value’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:45:51: [ skipping 7 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/isomorphism.hpp:651:42: required from ‘bool boost::graph::detail::isomorphism_impl::operator()(const Graph1&, const Graph2&, const ArgPack&) const [with ArgPack = boost::parameter::aux::empty_arg_list; Graph1 = boost::adjacency_list; Graph2 = boost::adjacency_list]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/isomorphism.hpp:662:5: required from ‘typename boost::result_of(Param0, Param1, const ArgPack&)>::type boost::graph::isomorphism_with_named_params(const Param0&, const Param1&, const ArgPack&) [with Param0 = boost::adjacency_list; Param1 = boost::adjacency_list; ArgPack = boost::parameter::aux::empty_arg_list; typename boost::result_of(Param0, Param1, const ArgPack&)>::type = bool]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/isomorphism.hpp:666:1: required from ‘typename boost::result_of(Param0, Param1, const boost::parameter::aux::empty_arg_list&)>::type boost::isomorphism(const Param0&, const Param1&) [with Param0 = adjacency_list; Param1 = adjacency_list; typename result_of(Param0, Param1, const parameter::aux::empty_arg_list&)>::type = bool]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/is_kuratowski_subgraph.hpp:278:34: required from ‘bool boost::is_kuratowski_subgraph(const Graph&, ForwardIterator, ForwardIterator, VertexIndexMap) [with Graph = adjacency_list, property >; ForwardIterator = __gnu_cxx::__normal_iterator*, std::vector > >; VertexIndexMap = vec_adj_list_vertex_id_map, long unsigned int>]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/is_kuratowski_subgraph.hpp:290:34: required from ‘bool boost::is_kuratowski_subgraph(const Graph&, ForwardIterator, ForwardIterator) [with Graph = adjacency_list, property >; ForwardIterator = __gnu_cxx::__normal_iterator*, std::vector > >]’ planar.cpp:435:37: required from here /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::Assignable::~Assignable() [with TT = boost::range_detail::integer_iterator]’ 37 | ~model() | ^ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:145:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 145 | BOOST_CONCEPT_USAGE(Assignable) { | ^~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::EqualityComparable >]’: /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements > >]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:233:5: required from ‘struct boost::EqualityComparable >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:502:3: required from ‘struct boost::InputIterator >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::InputIterator >]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied > >::value’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:45:51: [ skipping 7 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/isomorphism.hpp:651:42: required from ‘bool boost::graph::detail::isomorphism_impl::operator()(const Graph1&, const Graph2&, const ArgPack&) const [with ArgPack = boost::parameter::aux::empty_arg_list; Graph1 = boost::adjacency_list; Graph2 = boost::adjacency_list]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/isomorphism.hpp:662:5: required from ‘typename boost::result_of(Param0, Param1, const ArgPack&)>::type boost::graph::isomorphism_with_named_params(const Param0&, const Param1&, const ArgPack&) [with Param0 = boost::adjacency_list; Param1 = boost::adjacency_list; ArgPack = boost::parameter::aux::empty_arg_list; typename boost::result_of(Param0, Param1, const ArgPack&)>::type = bool]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/isomorphism.hpp:666:1: required from ‘typename boost::result_of(Param0, Param1, const boost::parameter::aux::empty_arg_list&)>::type boost::isomorphism(const Param0&, const Param1&) [with Param0 = adjacency_list; Param1 = adjacency_list; typename result_of(Param0, Param1, const parameter::aux::empty_arg_list&)>::type = bool]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/is_kuratowski_subgraph.hpp:278:34: required from ‘bool boost::is_kuratowski_subgraph(const Graph&, ForwardIterator, ForwardIterator, VertexIndexMap) [with Graph = adjacency_list, property >; ForwardIterator = __gnu_cxx::__normal_iterator*, std::vector > >; VertexIndexMap = vec_adj_list_vertex_id_map, long unsigned int>]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/is_kuratowski_subgraph.hpp:290:34: required from ‘bool boost::is_kuratowski_subgraph(const Graph&, ForwardIterator, ForwardIterator) [with Graph = adjacency_list, property >; ForwardIterator = __gnu_cxx::__normal_iterator*, std::vector > >]’ planar.cpp:435:37: required from here /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::EqualityComparable::~EqualityComparable() [with TT = boost::range_detail::integer_iterator]’ 37 | ~model() | ^ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:233:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 233 | BOOST_CONCEPT_USAGE(EqualityComparable) { | ^~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::InputIterator >]’: /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements > >]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:512:7: required from ‘struct boost::InputIterator >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::InputIterator >]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied > >::value’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied > >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:72:8: [ skipping 6 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/isomorphism.hpp:651:42: required from ‘bool boost::graph::detail::isomorphism_impl::operator()(const Graph1&, const Graph2&, const ArgPack&) const [with ArgPack = boost::parameter::aux::empty_arg_list; Graph1 = boost::adjacency_list; Graph2 = boost::adjacency_list]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/isomorphism.hpp:662:5: required from ‘typename boost::result_of(Param0, Param1, const ArgPack&)>::type boost::graph::isomorphism_with_named_params(const Param0&, const Param1&, const ArgPack&) [with Param0 = boost::adjacency_list; Param1 = boost::adjacency_list; ArgPack = boost::parameter::aux::empty_arg_list; typename boost::result_of(Param0, Param1, const ArgPack&)>::type = bool]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/isomorphism.hpp:666:1: required from ‘typename boost::result_of(Param0, Param1, const boost::parameter::aux::empty_arg_list&)>::type boost::isomorphism(const Param0&, const Param1&) [with Param0 = adjacency_list; Param1 = adjacency_list; typename result_of(Param0, Param1, const parameter::aux::empty_arg_list&)>::type = bool]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/is_kuratowski_subgraph.hpp:278:34: required from ‘bool boost::is_kuratowski_subgraph(const Graph&, ForwardIterator, ForwardIterator, VertexIndexMap) [with Graph = adjacency_list, property >; ForwardIterator = __gnu_cxx::__normal_iterator*, std::vector > >; VertexIndexMap = vec_adj_list_vertex_id_map, long unsigned int>]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/is_kuratowski_subgraph.hpp:290:34: required from ‘bool boost::is_kuratowski_subgraph(const Graph&, ForwardIterator, ForwardIterator) [with Graph = adjacency_list, property >; ForwardIterator = __gnu_cxx::__normal_iterator*, std::vector > >]’ planar.cpp:435:37: required from here /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::InputIterator::~InputIterator() [with TT = boost::range_detail::integer_iterator]’ 37 | ~model() | ^ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:512:7: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 512 | BOOST_CONCEPT_USAGE(InputIterator) | ^~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::Assignable >, boost::detail::edge_desc_impl, long int> >]’: /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements >, boost::detail::edge_desc_impl, long int> > >]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:145:5: required from ‘struct boost::Assignable >, boost::detail::edge_desc_impl, long int> >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:502:3: required from ‘struct boost::InputIterator >, boost::detail::edge_desc_impl, long int> >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::InputIterator >, boost::detail::edge_desc_impl, long int> >]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied >, boost::detail::edge_desc_impl, long int> > >::value’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:45:51: [ skipping 7 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/isomorphism.hpp:651:42: required from ‘bool boost::graph::detail::isomorphism_impl::operator()(const Graph1&, const Graph2&, const ArgPack&) const [with ArgPack = boost::parameter::aux::empty_arg_list; Graph1 = boost::adjacency_list; Graph2 = boost::adjacency_list]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/isomorphism.hpp:662:5: required from ‘typename boost::result_of(Param0, Param1, const ArgPack&)>::type boost::graph::isomorphism_with_named_params(const Param0&, const Param1&, const ArgPack&) [with Param0 = boost::adjacency_list; Param1 = boost::adjacency_list; ArgPack = boost::parameter::aux::empty_arg_list; typename boost::result_of(Param0, Param1, const ArgPack&)>::type = bool]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/isomorphism.hpp:666:1: required from ‘typename boost::result_of(Param0, Param1, const boost::parameter::aux::empty_arg_list&)>::type boost::isomorphism(const Param0&, const Param1&) [with Param0 = adjacency_list; Param1 = adjacency_list; typename result_of(Param0, Param1, const parameter::aux::empty_arg_list&)>::type = bool]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/is_kuratowski_subgraph.hpp:278:34: required from ‘bool boost::is_kuratowski_subgraph(const Graph&, ForwardIterator, ForwardIterator, VertexIndexMap) [with Graph = adjacency_list, property >; ForwardIterator = __gnu_cxx::__normal_iterator*, std::vector > >; VertexIndexMap = vec_adj_list_vertex_id_map, long unsigned int>]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/is_kuratowski_subgraph.hpp:290:34: required from ‘bool boost::is_kuratowski_subgraph(const Graph&, ForwardIterator, ForwardIterator) [with Graph = adjacency_list, property >; ForwardIterator = __gnu_cxx::__normal_iterator*, std::vector > >]’ planar.cpp:435:37: required from here /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::Assignable::~Assignable() [with TT = boost::detail::undirected_edge_iter >, boost::detail::edge_desc_impl, long int>]’ 37 | ~model() | ^ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:145:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 145 | BOOST_CONCEPT_USAGE(Assignable) { | ^~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::EqualityComparable >, boost::detail::edge_desc_impl, long int> >]’: /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements >, boost::detail::edge_desc_impl, long int> > >]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:233:5: required from ‘struct boost::EqualityComparable >, boost::detail::edge_desc_impl, long int> >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:502:3: required from ‘struct boost::InputIterator >, boost::detail::edge_desc_impl, long int> >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::InputIterator >, boost::detail::edge_desc_impl, long int> >]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied >, boost::detail::edge_desc_impl, long int> > >::value’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:45:51: [ skipping 7 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/isomorphism.hpp:651:42: required from ‘bool boost::graph::detail::isomorphism_impl::operator()(const Graph1&, const Graph2&, const ArgPack&) const [with ArgPack = boost::parameter::aux::empty_arg_list; Graph1 = boost::adjacency_list; Graph2 = boost::adjacency_list]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/isomorphism.hpp:662:5: required from ‘typename boost::result_of(Param0, Param1, const ArgPack&)>::type boost::graph::isomorphism_with_named_params(const Param0&, const Param1&, const ArgPack&) [with Param0 = boost::adjacency_list; Param1 = boost::adjacency_list; ArgPack = boost::parameter::aux::empty_arg_list; typename boost::result_of(Param0, Param1, const ArgPack&)>::type = bool]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/isomorphism.hpp:666:1: required from ‘typename boost::result_of(Param0, Param1, const boost::parameter::aux::empty_arg_list&)>::type boost::isomorphism(const Param0&, const Param1&) [with Param0 = adjacency_list; Param1 = adjacency_list; typename result_of(Param0, Param1, const parameter::aux::empty_arg_list&)>::type = bool]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/is_kuratowski_subgraph.hpp:278:34: required from ‘bool boost::is_kuratowski_subgraph(const Graph&, ForwardIterator, ForwardIterator, VertexIndexMap) [with Graph = adjacency_list, property >; ForwardIterator = __gnu_cxx::__normal_iterator*, std::vector > >; VertexIndexMap = vec_adj_list_vertex_id_map, long unsigned int>]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/is_kuratowski_subgraph.hpp:290:34: required from ‘bool boost::is_kuratowski_subgraph(const Graph&, ForwardIterator, ForwardIterator) [with Graph = adjacency_list, property >; ForwardIterator = __gnu_cxx::__normal_iterator*, std::vector > >]’ planar.cpp:435:37: required from here /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::EqualityComparable::~EqualityComparable() [with TT = boost::detail::undirected_edge_iter >, boost::detail::edge_desc_impl, long int>]’ 37 | ~model() | ^ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:233:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 233 | BOOST_CONCEPT_USAGE(EqualityComparable) { | ^~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::InputIterator >, boost::detail::edge_desc_impl, long int> >]’: /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements >, boost::detail::edge_desc_impl, long int> > >]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:512:7: required from ‘struct boost::InputIterator >, boost::detail::edge_desc_impl, long int> >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::InputIterator >, boost::detail::edge_desc_impl, long int> >]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied >, boost::detail::edge_desc_impl, long int> > >::value’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied >, boost::detail::edge_desc_impl, long int> > >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:72:8: [ skipping 6 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/isomorphism.hpp:651:42: required from ‘bool boost::graph::detail::isomorphism_impl::operator()(const Graph1&, const Graph2&, const ArgPack&) const [with ArgPack = boost::parameter::aux::empty_arg_list; Graph1 = boost::adjacency_list; Graph2 = boost::adjacency_list]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/isomorphism.hpp:662:5: required from ‘typename boost::result_of(Param0, Param1, const ArgPack&)>::type boost::graph::isomorphism_with_named_params(const Param0&, const Param1&, const ArgPack&) [with Param0 = boost::adjacency_list; Param1 = boost::adjacency_list; ArgPack = boost::parameter::aux::empty_arg_list; typename boost::result_of(Param0, Param1, const ArgPack&)>::type = bool]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/isomorphism.hpp:666:1: required from ‘typename boost::result_of(Param0, Param1, const boost::parameter::aux::empty_arg_list&)>::type boost::isomorphism(const Param0&, const Param1&) [with Param0 = adjacency_list; Param1 = adjacency_list; typename result_of(Param0, Param1, const parameter::aux::empty_arg_list&)>::type = bool]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/is_kuratowski_subgraph.hpp:278:34: required from ‘bool boost::is_kuratowski_subgraph(const Graph&, ForwardIterator, ForwardIterator, VertexIndexMap) [with Graph = adjacency_list, property >; ForwardIterator = __gnu_cxx::__normal_iterator*, std::vector > >; VertexIndexMap = vec_adj_list_vertex_id_map, long unsigned int>]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/is_kuratowski_subgraph.hpp:290:34: required from ‘bool boost::is_kuratowski_subgraph(const Graph&, ForwardIterator, ForwardIterator) [with Graph = adjacency_list, property >; ForwardIterator = __gnu_cxx::__normal_iterator*, std::vector > >]’ planar.cpp:435:37: required from here /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::InputIterator::~InputIterator() [with TT = boost::detail::undirected_edge_iter >, boost::detail::edge_desc_impl, long int>]’ 37 | ~model() | ^ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:512:7: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 512 | BOOST_CONCEPT_USAGE(InputIterator) | ^~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements >, boost::no_property>*, std::vector >, boost::no_property>, std::allocator >, boost::no_property> > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >]’: /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/graph_concepts.hpp:52:50: required from ‘struct boost::concepts::MultiPassInputIterator >, boost::no_property>*, std::vector >, boost::no_property>, std::allocator >, boost::no_property> > > >, long unsigned int, boost::detail::edge_desc_impl, long int> >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::concepts::MultiPassInputIterator >, boost::no_property>*, std::vector >, boost::no_property>, std::allocator >, boost::no_property> > > >, long unsigned int, boost::detail::edge_desc_impl, long int> >]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied >, boost::no_property>*, std::vector >, boost::no_property>, std::allocator >, boost::no_property> > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::value’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied >, boost::no_property>*, std::vector >, boost::no_property>, std::allocator >, boost::no_property> > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_ >, boost::no_property>*, std::vector >, boost::no_property>, std::allocator >, boost::no_property> > > >, long unsigned int, boost::detail::edge_desc_impl, long int> >)>’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/graph_concepts.hpp:89:9: [ skipping 6 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/isomorphism.hpp:651:42: required from ‘bool boost::graph::detail::isomorphism_impl::operator()(const Graph1&, const Graph2&, const ArgPack&) const [with ArgPack = boost::parameter::aux::empty_arg_list; Graph1 = boost::adjacency_list; Graph2 = boost::adjacency_list]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/isomorphism.hpp:662:5: required from ‘typename boost::result_of(Param0, Param1, const ArgPack&)>::type boost::graph::isomorphism_with_named_params(const Param0&, const Param1&, const ArgPack&) [with Param0 = boost::adjacency_list; Param1 = boost::adjacency_list; ArgPack = boost::parameter::aux::empty_arg_list; typename boost::result_of(Param0, Param1, const ArgPack&)>::type = bool]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/isomorphism.hpp:666:1: required from ‘typename boost::result_of(Param0, Param1, const boost::parameter::aux::empty_arg_list&)>::type boost::isomorphism(const Param0&, const Param1&) [with Param0 = adjacency_list; Param1 = adjacency_list; typename result_of(Param0, Param1, const parameter::aux::empty_arg_list&)>::type = bool]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/is_kuratowski_subgraph.hpp:278:34: required from ‘bool boost::is_kuratowski_subgraph(const Graph&, ForwardIterator, ForwardIterator, VertexIndexMap) [with Graph = adjacency_list, property >; ForwardIterator = __gnu_cxx::__normal_iterator*, std::vector > >; VertexIndexMap = vec_adj_list_vertex_id_map, long unsigned int>]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/is_kuratowski_subgraph.hpp:290:34: required from ‘bool boost::is_kuratowski_subgraph(const Graph&, ForwardIterator, ForwardIterator) [with Graph = adjacency_list, property >; ForwardIterator = __gnu_cxx::__normal_iterator*, std::vector > >]’ planar.cpp:435:37: required from here /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::concepts::MultiPassInputIterator >, boost::no_property>*, std::vector >, boost::no_property>, std::allocator >, boost::no_property> > > >, long unsigned int, boost::detail::edge_desc_impl, long int> >]’ 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ^ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::MultiPassInputIterator >, boost::no_property>*, std::vector >, boost::no_property>, std::allocator >, boost::no_property> > > >, long unsigned int, boost::detail::edge_desc_impl, long int> >]’: /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/graph_concepts.hpp:89:9: required from ‘boost::concepts::IncidenceGraph::~IncidenceGraph() [with G = boost::adjacency_list]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/graph_concepts.hpp:75:1: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::IncidenceGraphConcept >]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/depth_first_search.hpp:129:9: required from ‘void boost::detail::depth_first_visit_impl(const IncidenceGraph&, typename boost::graph_traits::vertex_descriptor, DFSVisitor&, ColorMap, TerminatorFunc) [with IncidenceGraph = boost::adjacency_list; DFSVisitor = isomorphism_algo, boost::adjacency_list, boost::shared_array_property_map >, boost::degree_vertex_invariant >, boost::adjacency_list >, boost::degree_vertex_invariant >, boost::adjacency_list >, boost::vec_adj_list_vertex_id_map, boost::vec_adj_list_vertex_id_map >::record_dfs_order; ColorMap = boost::safe_iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map, boost::default_color_type, boost::default_color_type&>; TerminatorFunc = nontruth2; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/depth_first_search.hpp:417:35: required from ‘void boost::depth_first_visit(const IncidenceGraph&, typename graph_traits::vertex_descriptor, DFSVisitor, ColorMap) [with IncidenceGraph = adjacency_list; DFSVisitor = detail::isomorphism_algo, adjacency_list, shared_array_property_map >, degree_vertex_invariant >, adjacency_list >, degree_vertex_invariant >, adjacency_list >, vec_adj_list_vertex_id_map, vec_adj_list_vertex_id_map >::record_dfs_order; ColorMap = safe_iterator_property_map<__gnu_cxx::__normal_iterator >, vec_adj_list_vertex_id_map, default_color_type, default_color_type&>; typename graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/isomorphism.hpp:209:38: [ skipping 2 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/isomorphism.hpp:651:42: required from ‘bool boost::graph::detail::isomorphism_impl::operator()(const Graph1&, const Graph2&, const ArgPack&) const [with ArgPack = boost::parameter::aux::empty_arg_list; Graph1 = boost::adjacency_list; Graph2 = boost::adjacency_list]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/isomorphism.hpp:662:5: required from ‘typename boost::result_of(Param0, Param1, const ArgPack&)>::type boost::graph::isomorphism_with_named_params(const Param0&, const Param1&, const ArgPack&) [with Param0 = boost::adjacency_list; Param1 = boost::adjacency_list; ArgPack = boost::parameter::aux::empty_arg_list; typename boost::result_of(Param0, Param1, const ArgPack&)>::type = bool]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/isomorphism.hpp:666:1: required from ‘typename boost::result_of(Param0, Param1, const boost::parameter::aux::empty_arg_list&)>::type boost::isomorphism(const Param0&, const Param1&) [with Param0 = adjacency_list; Param1 = adjacency_list; typename result_of(Param0, Param1, const parameter::aux::empty_arg_list&)>::type = bool]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/is_kuratowski_subgraph.hpp:278:34: required from ‘bool boost::is_kuratowski_subgraph(const Graph&, ForwardIterator, ForwardIterator, VertexIndexMap) [with Graph = adjacency_list, property >; ForwardIterator = __gnu_cxx::__normal_iterator*, std::vector > >; VertexIndexMap = vec_adj_list_vertex_id_map, long unsigned int>]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/is_kuratowski_subgraph.hpp:290:34: required from ‘bool boost::is_kuratowski_subgraph(const Graph&, ForwardIterator, ForwardIterator) [with Graph = adjacency_list, property >; ForwardIterator = __gnu_cxx::__normal_iterator*, std::vector > >]’ planar.cpp:435:37: required from here /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::concepts::MultiPassInputIterator::~MultiPassInputIterator() [with T = boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator >, boost::no_property>*, std::vector >, boost::no_property>, std::allocator >, boost::no_property> > > >, long unsigned int, boost::detail::edge_desc_impl, long int>]’ 37 | ~model() | ^ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/graph_concepts.hpp:52:50: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 52 | BOOST_concept(MultiPassInputIterator, (T)) { BOOST_CONCEPT_USAGE( | ^~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::CopyConstructible, boost::adjacency_list, boost::shared_array_property_map >, boost::degree_vertex_invariant >, boost::adjacency_list >, boost::degree_vertex_invariant >, boost::adjacency_list >, boost::vec_adj_list_vertex_id_map, boost::vec_adj_list_vertex_id_map >::record_dfs_order>]’: /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements, boost::adjacency_list, boost::shared_array_property_map >, boost::degree_vertex_invariant >, boost::adjacency_list >, boost::degree_vertex_invariant >, boost::adjacency_list >, boost::vec_adj_list_vertex_id_map, boost::vec_adj_list_vertex_id_map >::record_dfs_order> >]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:167:5: required from ‘struct boost::CopyConstructible, boost::adjacency_list, boost::shared_array_property_map >, boost::degree_vertex_invariant >, boost::adjacency_list >, boost::degree_vertex_invariant >, boost::adjacency_list >, boost::vec_adj_list_vertex_id_map, boost::vec_adj_list_vertex_id_map >::record_dfs_order>’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:165:3: required from ‘struct boost::CopyConstructibleConcept, boost::adjacency_list, boost::shared_array_property_map >, boost::degree_vertex_invariant >, boost::adjacency_list >, boost::degree_vertex_invariant >, boost::adjacency_list >, boost::vec_adj_list_vertex_id_map, boost::vec_adj_list_vertex_id_map >::record_dfs_order>’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::CopyConstructibleConcept, boost::adjacency_list, boost::shared_array_property_map >, boost::degree_vertex_invariant >, boost::adjacency_list >, boost::degree_vertex_invariant >, boost::adjacency_list >, boost::vec_adj_list_vertex_id_map, boost::vec_adj_list_vertex_id_map >::record_dfs_order>]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied, boost::adjacency_list, boost::shared_array_property_map >, boost::degree_vertex_invariant >, boost::adjacency_list >, boost::degree_vertex_invariant >, boost::adjacency_list >, boost::vec_adj_list_vertex_id_map, boost::vec_adj_list_vertex_id_map >::record_dfs_order> >::value’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:45:51: [ skipping 11 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/isomorphism.hpp:651:42: required from ‘bool boost::graph::detail::isomorphism_impl::operator()(const Graph1&, const Graph2&, const ArgPack&) const [with ArgPack = boost::parameter::aux::empty_arg_list; Graph1 = boost::adjacency_list; Graph2 = boost::adjacency_list]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/isomorphism.hpp:662:5: required from ‘typename boost::result_of(Param0, Param1, const ArgPack&)>::type boost::graph::isomorphism_with_named_params(const Param0&, const Param1&, const ArgPack&) [with Param0 = boost::adjacency_list; Param1 = boost::adjacency_list; ArgPack = boost::parameter::aux::empty_arg_list; typename boost::result_of(Param0, Param1, const ArgPack&)>::type = bool]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/isomorphism.hpp:666:1: required from ‘typename boost::result_of(Param0, Param1, const boost::parameter::aux::empty_arg_list&)>::type boost::isomorphism(const Param0&, const Param1&) [with Param0 = adjacency_list; Param1 = adjacency_list; typename result_of(Param0, Param1, const parameter::aux::empty_arg_list&)>::type = bool]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/is_kuratowski_subgraph.hpp:278:34: required from ‘bool boost::is_kuratowski_subgraph(const Graph&, ForwardIterator, ForwardIterator, VertexIndexMap) [with Graph = adjacency_list, property >; ForwardIterator = __gnu_cxx::__normal_iterator*, std::vector > >; VertexIndexMap = vec_adj_list_vertex_id_map, long unsigned int>]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/is_kuratowski_subgraph.hpp:290:34: required from ‘bool boost::is_kuratowski_subgraph(const Graph&, ForwardIterator, ForwardIterator) [with Graph = adjacency_list, property >; ForwardIterator = __gnu_cxx::__normal_iterator*, std::vector > >]’ planar.cpp:435:37: required from here /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::CopyConstructible::~CopyConstructible() [with TT = boost::detail::isomorphism_algo, boost::adjacency_list, boost::shared_array_property_map >, boost::degree_vertex_invariant >, boost::adjacency_list >, boost::degree_vertex_invariant >, boost::adjacency_list >, boost::vec_adj_list_vertex_id_map, boost::vec_adj_list_vertex_id_map >::record_dfs_order]’ 37 | ~model() | ^ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:167:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 167 | BOOST_CONCEPT_USAGE(CopyConstructible) { | ^~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements, long unsigned int*, boost::vec_adj_list_vertex_id_map, long unsigned int> >::non_odd_vertex >, boost::vec_adj_list_vertex_id_map, long unsigned int>, int, int&> >, boost::filtered_graph, boost::keep_all, boost::maximum_cardinality_matching_verifier, long unsigned int*, boost::vec_adj_list_vertex_id_map, long unsigned int> >::non_odd_vertex >, boost::vec_adj_list_vertex_id_map, long unsigned int>, int, int&> > > >, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >, boost::property >*, std::vector > >, boost::property >, std::allocator > >, boost::property > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > > >]’: /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/graph_concepts.hpp:52:50: required from ‘struct boost::concepts::MultiPassInputIterator, long unsigned int*, boost::vec_adj_list_vertex_id_map, long unsigned int> >::non_odd_vertex >, boost::vec_adj_list_vertex_id_map, long unsigned int>, int, int&> >, boost::filtered_graph, boost::keep_all, boost::maximum_cardinality_matching_verifier, long unsigned int*, boost::vec_adj_list_vertex_id_map, long unsigned int> >::non_odd_vertex >, boost::vec_adj_list_vertex_id_map, long unsigned int>, int, int&> > > >, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >, boost::property >*, std::vector > >, boost::property >, std::allocator > >, boost::property > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::concepts::MultiPassInputIterator, long unsigned int*, boost::vec_adj_list_vertex_id_map, long unsigned int> >::non_odd_vertex >, boost::vec_adj_list_vertex_id_map, long unsigned int>, int, int&> >, boost::filtered_graph, boost::keep_all, boost::maximum_cardinality_matching_verifier, long unsigned int*, boost::vec_adj_list_vertex_id_map, long unsigned int> >::non_odd_vertex >, boost::vec_adj_list_vertex_id_map, long unsigned int>, int, int&> > > >, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >, boost::property >*, std::vector > >, boost::property >, std::allocator > >, boost::property > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied, long unsigned int*, boost::vec_adj_list_vertex_id_map, long unsigned int> >::non_odd_vertex >, boost::vec_adj_list_vertex_id_map, long unsigned int>, int, int&> >, boost::filtered_graph, boost::keep_all, boost::maximum_cardinality_matching_verifier, long unsigned int*, boost::vec_adj_list_vertex_id_map, long unsigned int> >::non_odd_vertex >, boost::vec_adj_list_vertex_id_map, long unsigned int>, int, int&> > > >, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >, boost::property >*, std::vector > >, boost::property >, std::allocator > >, boost::property > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > > >::value’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied, long unsigned int*, boost::vec_adj_list_vertex_id_map, long unsigned int> >::non_odd_vertex >, boost::vec_adj_list_vertex_id_map, long unsigned int>, int, int&> >, boost::filtered_graph, boost::keep_all, boost::maximum_cardinality_matching_verifier, long unsigned int*, boost::vec_adj_list_vertex_id_map, long unsigned int> >::non_odd_vertex >, boost::vec_adj_list_vertex_id_map, long unsigned int>, int, int&> > > >, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >, boost::property >*, std::vector > >, boost::property >, std::allocator > >, boost::property > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > > >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_, long unsigned int*, boost::vec_adj_list_vertex_id_map, long unsigned int> >::non_odd_vertex >, boost::vec_adj_list_vertex_id_map, long unsigned int>, int, int&> >, boost::filtered_graph, boost::keep_all, boost::maximum_cardinality_matching_verifier, long unsigned int*, boost::vec_adj_list_vertex_id_map, long unsigned int> >::non_odd_vertex >, boost::vec_adj_list_vertex_id_map, long unsigned int>, int, int&> > > >, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >, boost::property >*, std::vector > >, boost::property >, std::allocator > >, boost::property > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >)>’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/graph_concepts.hpp:89:9: [ skipping 6 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/depth_first_search.hpp:409:1: required from ‘typename boost::result_of(Param0, const typename boost::detail::convert_bgl_params_to_boost_parameter >::type&)>::type boost::depth_first_search(const Param0&, const bgl_named_params&) [with Param0 = filtered_graph, keep_all, maximum_cardinality_matching_verifier, long unsigned int*, vec_adj_list_vertex_id_map, long unsigned int> >::non_odd_vertex >, vec_adj_list_vertex_id_map, long unsigned int>, int, int&> > >; P = vec_adj_list_vertex_id_map, long unsigned int>; T = vertex_index_t; R = bgl_named_params, graph_visitor_t, no_property>; typename result_of(Param0, const typename detail::convert_bgl_params_to_boost_parameter >::type&)>::type = void; typename detail::convert_bgl_params_to_boost_parameter >::type = parameter::aux::arg_list, long unsigned int> >, parameter::aux::arg_list >, parameter::aux::empty_arg_list, std::integral_constant >, std::integral_constant >]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/max_cardinality_matching.hpp:779:27: required from ‘static bool boost::maximum_cardinality_matching_verifier::verify_matching(const Graph&, MateMap, VertexIndexMap) [with Graph = R_adjacency_list; MateMap = long unsigned int*; VertexIndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/max_cardinality_matching.hpp:807:79: required from ‘bool boost::matching(const Graph&, MateMap, VertexIndexMap) [with Graph = R_adjacency_list; MateMap = long unsigned int*; VertexIndexMap = vec_adj_list_vertex_id_map, long unsigned int>; AugmentingPathFinder = edmonds_augmenting_path_finder; InitialMatchingFinder = extra_greedy_matching; MatchingVerifier = maximum_cardinality_matching_verifier]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/max_cardinality_matching.hpp:817:48: required from ‘bool boost::checked_edmonds_maximum_cardinality_matching(const Graph&, MateMap, VertexIndexMap) [with Graph = R_adjacency_list; MateMap = long unsigned int*; VertexIndexMap = vec_adj_list_vertex_id_map, long unsigned int>]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/max_cardinality_matching.hpp:824:56: required from ‘bool boost::checked_edmonds_maximum_cardinality_matching(const Graph&, MateMap) [with Graph = R_adjacency_list; MateMap = long unsigned int*]’ planar.cpp:686:60: required from here /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::concepts::MultiPassInputIterator, long unsigned int*, boost::vec_adj_list_vertex_id_map, long unsigned int> >::non_odd_vertex >, boost::vec_adj_list_vertex_id_map, long unsigned int>, int, int&> >, boost::filtered_graph, boost::keep_all, boost::maximum_cardinality_matching_verifier, long unsigned int*, boost::vec_adj_list_vertex_id_map, long unsigned int> >::non_odd_vertex >, boost::vec_adj_list_vertex_id_map, long unsigned int>, int, int&> > > >, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >, boost::property >*, std::vector > >, boost::property >, std::allocator > >, boost::property > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >]’ 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ^ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::MultiPassInputIterator, long unsigned int*, boost::vec_adj_list_vertex_id_map, long unsigned int> >::non_odd_vertex >, boost::vec_adj_list_vertex_id_map, long unsigned int>, int, int&> >, boost::filtered_graph, boost::keep_all, boost::maximum_cardinality_matching_verifier, long unsigned int*, boost::vec_adj_list_vertex_id_map, long unsigned int> >::non_odd_vertex >, boost::vec_adj_list_vertex_id_map, long unsigned int>, int, int&> > > >, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >, boost::property >*, std::vector > >, boost::property >, std::allocator > >, boost::property > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >]’: /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/graph_concepts.hpp:89:9: required from ‘boost::concepts::IncidenceGraph::~IncidenceGraph() [with G = boost::filtered_graph, boost::keep_all, boost::maximum_cardinality_matching_verifier, long unsigned int*, boost::vec_adj_list_vertex_id_map, long unsigned int> >::non_odd_vertex >, boost::vec_adj_list_vertex_id_map, long unsigned int>, int, int&> > >]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/graph_concepts.hpp:75:1: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::IncidenceGraphConcept, boost::keep_all, boost::maximum_cardinality_matching_verifier, long unsigned int*, boost::vec_adj_list_vertex_id_map, long unsigned int> >::non_odd_vertex >, boost::vec_adj_list_vertex_id_map, long unsigned int>, int, int&> > > >]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/depth_first_search.hpp:129:9: required from ‘void boost::detail::depth_first_visit_impl(const IncidenceGraph&, typename boost::graph_traits::vertex_descriptor, DFSVisitor&, ColorMap, TerminatorFunc) [with IncidenceGraph = boost::filtered_graph, boost::keep_all, boost::maximum_cardinality_matching_verifier, long unsigned int*, boost::vec_adj_list_vertex_id_map, long unsigned int> >::non_odd_vertex >, boost::vec_adj_list_vertex_id_map, long unsigned int>, int, int&> > >; DFSVisitor = odd_components_counter; ColorMap = boost::shared_array_property_map, long unsigned int> >; TerminatorFunc = nontruth2; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/depth_first_search.hpp:286:39: required from ‘void boost::depth_first_search(const VertexListGraph&, DFSVisitor, ColorMap, typename graph_traits::vertex_descriptor) [with VertexListGraph = filtered_graph, keep_all, maximum_cardinality_matching_verifier, long unsigned int*, vec_adj_list_vertex_id_map, long unsigned int> >::non_odd_vertex >, vec_adj_list_vertex_id_map, long unsigned int>, int, int&> > >; DFSVisitor = detail::odd_components_counter; ColorMap = shared_array_property_map, long unsigned int> >; typename graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/depth_first_search.hpp:397:42: [ skipping 2 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/depth_first_search.hpp:409:1: required from ‘typename boost::result_of(Param0, const typename boost::detail::convert_bgl_params_to_boost_parameter >::type&)>::type boost::depth_first_search(const Param0&, const bgl_named_params&) [with Param0 = filtered_graph, keep_all, maximum_cardinality_matching_verifier, long unsigned int*, vec_adj_list_vertex_id_map, long unsigned int> >::non_odd_vertex >, vec_adj_list_vertex_id_map, long unsigned int>, int, int&> > >; P = vec_adj_list_vertex_id_map, long unsigned int>; T = vertex_index_t; R = bgl_named_params, graph_visitor_t, no_property>; typename result_of(Param0, const typename detail::convert_bgl_params_to_boost_parameter >::type&)>::type = void; typename detail::convert_bgl_params_to_boost_parameter >::type = parameter::aux::arg_list, long unsigned int> >, parameter::aux::arg_list >, parameter::aux::empty_arg_list, std::integral_constant >, std::integral_constant >]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/max_cardinality_matching.hpp:779:27: required from ‘static bool boost::maximum_cardinality_matching_verifier::verify_matching(const Graph&, MateMap, VertexIndexMap) [with Graph = R_adjacency_list; MateMap = long unsigned int*; VertexIndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/max_cardinality_matching.hpp:807:79: required from ‘bool boost::matching(const Graph&, MateMap, VertexIndexMap) [with Graph = R_adjacency_list; MateMap = long unsigned int*; VertexIndexMap = vec_adj_list_vertex_id_map, long unsigned int>; AugmentingPathFinder = edmonds_augmenting_path_finder; InitialMatchingFinder = extra_greedy_matching; MatchingVerifier = maximum_cardinality_matching_verifier]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/max_cardinality_matching.hpp:817:48: required from ‘bool boost::checked_edmonds_maximum_cardinality_matching(const Graph&, MateMap, VertexIndexMap) [with Graph = R_adjacency_list; MateMap = long unsigned int*; VertexIndexMap = vec_adj_list_vertex_id_map, long unsigned int>]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/max_cardinality_matching.hpp:824:56: required from ‘bool boost::checked_edmonds_maximum_cardinality_matching(const Graph&, MateMap) [with Graph = R_adjacency_list; MateMap = long unsigned int*]’ planar.cpp:686:60: required from here /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::concepts::MultiPassInputIterator::~MultiPassInputIterator() [with T = boost::iterators::filter_iterator, long unsigned int*, boost::vec_adj_list_vertex_id_map, long unsigned int> >::non_odd_vertex >, boost::vec_adj_list_vertex_id_map, long unsigned int>, int, int&> >, boost::filtered_graph, boost::keep_all, boost::maximum_cardinality_matching_verifier, long unsigned int*, boost::vec_adj_list_vertex_id_map, long unsigned int> >::non_odd_vertex >, boost::vec_adj_list_vertex_id_map, long unsigned int>, int, int&> > > >, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >, boost::property >*, std::vector > >, boost::property >, std::allocator > >, boost::property > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> >]’ 37 | ~model() | ^ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/graph_concepts.hpp:52:50: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 52 | BOOST_concept(MultiPassInputIterator, (T)) { BOOST_CONCEPT_USAGE( | ^~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::Assignable > >, boost::property >*, std::vector > >, boost::property >, std::allocator > >, boost::property > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> >]’: /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements > >, boost::property >*, std::vector > >, boost::property >, std::allocator > >, boost::property > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:145:5: required from ‘struct boost::Assignable > >, boost::property >*, std::vector > >, boost::property >, std::allocator > >, boost::property > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:502:3: required from ‘struct boost::InputIterator > >, boost::property >*, std::vector > >, boost::property >, std::allocator > >, boost::property > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::InputIterator > >, boost::property >*, std::vector > >, boost::property >, std::allocator > >, boost::property > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> >]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied > >, boost::property >*, std::vector > >, boost::property >, std::allocator > >, boost::property > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::value’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:45:51: [ skipping 8 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/depth_first_search.hpp:397:42: required from ‘void boost::graph::detail::depth_first_search_impl::operator()(const Graph&, const ArgPack&) const [with ArgPack = boost::parameter::aux::arg_list >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&> > >, boost::parameter::aux::empty_arg_list, std::integral_constant >; Graph = boost::adjacency_list, boost::property >]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/depth_first_search.hpp:406:5: required from ‘typename boost::result_of(Param0, const ArgPack&)>::type boost::graph::depth_first_search_with_named_params(const Param0&, const ArgPack&) [with Param0 = boost::adjacency_list, boost::property >; ArgPack = boost::parameter::aux::arg_list >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&> > >, boost::parameter::aux::empty_arg_list, std::integral_constant >; typename boost::result_of(Param0, const ArgPack&)>::type = void]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/depth_first_search.hpp:409:1: required from ‘typename boost::result_of(Param0, const typename boost::detail::convert_bgl_params_to_boost_parameter >::type&)>::type boost::depth_first_search(const Param0&, const bgl_named_params&) [with Param0 = adjacency_list, property >; P = detail::components_recorder >, vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&> >; T = graph_visitor_t; R = no_property; typename result_of(Param0, const typename detail::convert_bgl_params_to_boost_parameter >::type&)>::type = void; typename detail::convert_bgl_params_to_boost_parameter >::type = parameter::aux::arg_list >, vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&> > >, parameter::aux::empty_arg_list, std::integral_constant >]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/connected_components.hpp:106:23: required from ‘typename boost::property_traits::value_type boost::connected_components(const Graph&, ComponentMap, typename enable_if_c::traversal_category>::value, graph::detail::no_parameter>::type) [with Graph = adjacency_list, property >; ComponentMap = iterator_property_map<__gnu_cxx::__normal_iterator >, vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>; typename property_traits::value_type = long unsigned int; typename enable_if_c::traversal_category>::value, graph::detail::no_parameter>::type = graph::detail::no_parameter; typename graph_traits::traversal_category = undir_adj_list_traversal_tag]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/make_connected.hpp:38:51: required from ‘void boost::make_connected(Graph&, VertexIndexMap, AddEdgeVisitor&) [with Graph = adjacency_list, property >; VertexIndexMap = vec_adj_list_vertex_id_map, long unsigned int>; AddEdgeVisitor = my_add_edge_visitor, property >, long unsigned int>]’ planar.cpp:211:26: required from here /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::Assignable::~Assignable() [with TT = boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >, boost::property >*, std::vector > >, boost::property >, std::allocator > >, boost::property > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>]’ 37 | ~model() | ^ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:145:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 145 | BOOST_CONCEPT_USAGE(Assignable) { | ^~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::EqualityComparable > >, boost::property >*, std::vector > >, boost::property >, std::allocator > >, boost::property > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> >]’: /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements > >, boost::property >*, std::vector > >, boost::property >, std::allocator > >, boost::property > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:233:5: required from ‘struct boost::EqualityComparable > >, boost::property >*, std::vector > >, boost::property >, std::allocator > >, boost::property > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:502:3: required from ‘struct boost::InputIterator > >, boost::property >*, std::vector > >, boost::property >, std::allocator > >, boost::property > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::InputIterator > >, boost::property >*, std::vector > >, boost::property >, std::allocator > >, boost::property > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> >]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied > >, boost::property >*, std::vector > >, boost::property >, std::allocator > >, boost::property > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::value’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:45:51: [ skipping 8 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/depth_first_search.hpp:397:42: required from ‘void boost::graph::detail::depth_first_search_impl::operator()(const Graph&, const ArgPack&) const [with ArgPack = boost::parameter::aux::arg_list >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&> > >, boost::parameter::aux::empty_arg_list, std::integral_constant >; Graph = boost::adjacency_list, boost::property >]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/depth_first_search.hpp:406:5: required from ‘typename boost::result_of(Param0, const ArgPack&)>::type boost::graph::depth_first_search_with_named_params(const Param0&, const ArgPack&) [with Param0 = boost::adjacency_list, boost::property >; ArgPack = boost::parameter::aux::arg_list >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&> > >, boost::parameter::aux::empty_arg_list, std::integral_constant >; typename boost::result_of(Param0, const ArgPack&)>::type = void]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/depth_first_search.hpp:409:1: required from ‘typename boost::result_of(Param0, const typename boost::detail::convert_bgl_params_to_boost_parameter >::type&)>::type boost::depth_first_search(const Param0&, const bgl_named_params&) [with Param0 = adjacency_list, property >; P = detail::components_recorder >, vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&> >; T = graph_visitor_t; R = no_property; typename result_of(Param0, const typename detail::convert_bgl_params_to_boost_parameter >::type&)>::type = void; typename detail::convert_bgl_params_to_boost_parameter >::type = parameter::aux::arg_list >, vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&> > >, parameter::aux::empty_arg_list, std::integral_constant >]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/connected_components.hpp:106:23: required from ‘typename boost::property_traits::value_type boost::connected_components(const Graph&, ComponentMap, typename enable_if_c::traversal_category>::value, graph::detail::no_parameter>::type) [with Graph = adjacency_list, property >; ComponentMap = iterator_property_map<__gnu_cxx::__normal_iterator >, vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>; typename property_traits::value_type = long unsigned int; typename enable_if_c::traversal_category>::value, graph::detail::no_parameter>::type = graph::detail::no_parameter; typename graph_traits::traversal_category = undir_adj_list_traversal_tag]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/make_connected.hpp:38:51: required from ‘void boost::make_connected(Graph&, VertexIndexMap, AddEdgeVisitor&) [with Graph = adjacency_list, property >; VertexIndexMap = vec_adj_list_vertex_id_map, long unsigned int>; AddEdgeVisitor = my_add_edge_visitor, property >, long unsigned int>]’ planar.cpp:211:26: required from here /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::EqualityComparable::~EqualityComparable() [with TT = boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >, boost::property >*, std::vector > >, boost::property >, std::allocator > >, boost::property > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>]’ 37 | ~model() | ^ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:233:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 233 | BOOST_CONCEPT_USAGE(EqualityComparable) { | ^~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::InputIterator > >, boost::property >*, std::vector > >, boost::property >, std::allocator > >, boost::property > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> >]’: /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements > >, boost::property >*, std::vector > >, boost::property >, std::allocator > >, boost::property > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:512:7: required from ‘struct boost::InputIterator > >, boost::property >*, std::vector > >, boost::property >, std::allocator > >, boost::property > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::InputIterator > >, boost::property >*, std::vector > >, boost::property >, std::allocator > >, boost::property > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> >]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied > >, boost::property >*, std::vector > >, boost::property >, std::allocator > >, boost::property > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::value’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied > >, boost::property >*, std::vector > >, boost::property >, std::allocator > >, boost::property > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:72:8: [ skipping 7 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/depth_first_search.hpp:397:42: required from ‘void boost::graph::detail::depth_first_search_impl::operator()(const Graph&, const ArgPack&) const [with ArgPack = boost::parameter::aux::arg_list >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&> > >, boost::parameter::aux::empty_arg_list, std::integral_constant >; Graph = boost::adjacency_list, boost::property >]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/depth_first_search.hpp:406:5: required from ‘typename boost::result_of(Param0, const ArgPack&)>::type boost::graph::depth_first_search_with_named_params(const Param0&, const ArgPack&) [with Param0 = boost::adjacency_list, boost::property >; ArgPack = boost::parameter::aux::arg_list >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&> > >, boost::parameter::aux::empty_arg_list, std::integral_constant >; typename boost::result_of(Param0, const ArgPack&)>::type = void]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/depth_first_search.hpp:409:1: required from ‘typename boost::result_of(Param0, const typename boost::detail::convert_bgl_params_to_boost_parameter >::type&)>::type boost::depth_first_search(const Param0&, const bgl_named_params&) [with Param0 = adjacency_list, property >; P = detail::components_recorder >, vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&> >; T = graph_visitor_t; R = no_property; typename result_of(Param0, const typename detail::convert_bgl_params_to_boost_parameter >::type&)>::type = void; typename detail::convert_bgl_params_to_boost_parameter >::type = parameter::aux::arg_list >, vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&> > >, parameter::aux::empty_arg_list, std::integral_constant >]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/connected_components.hpp:106:23: required from ‘typename boost::property_traits::value_type boost::connected_components(const Graph&, ComponentMap, typename enable_if_c::traversal_category>::value, graph::detail::no_parameter>::type) [with Graph = adjacency_list, property >; ComponentMap = iterator_property_map<__gnu_cxx::__normal_iterator >, vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>; typename property_traits::value_type = long unsigned int; typename enable_if_c::traversal_category>::value, graph::detail::no_parameter>::type = graph::detail::no_parameter; typename graph_traits::traversal_category = undir_adj_list_traversal_tag]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/make_connected.hpp:38:51: required from ‘void boost::make_connected(Graph&, VertexIndexMap, AddEdgeVisitor&) [with Graph = adjacency_list, property >; VertexIndexMap = vec_adj_list_vertex_id_map, long unsigned int>; AddEdgeVisitor = my_add_edge_visitor, property >, long unsigned int>]’ planar.cpp:211:26: required from here /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::InputIterator::~InputIterator() [with TT = boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >, boost::property >*, std::vector > >, boost::property >, std::allocator > >, boost::property > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>]’ 37 | ~model() | ^ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:512:7: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 512 | BOOST_CONCEPT_USAGE(InputIterator) | ^~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements >, boost::adj_list_edge_property_map, boost::edge_index_t>, long unsigned int, long unsigned int&>, boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>, boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>, boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>, std::back_insert_iterator >, std::stack, std::deque, std::allocator > > >, std::vector, boost::vec_adj_list_vertex_id_map, long unsigned int>, boost::dfs_visitor<> > > >]’: /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:167:5: required from ‘struct boost::CopyConstructible >, boost::adj_list_edge_property_map, boost::edge_index_t>, long unsigned int, long unsigned int&>, boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>, boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>, boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>, std::back_insert_iterator >, std::stack, std::deque, std::allocator > > >, std::vector, boost::vec_adj_list_vertex_id_map, long unsigned int>, boost::dfs_visitor<> > >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:165:3: required from ‘struct boost::CopyConstructibleConcept >, boost::adj_list_edge_property_map, boost::edge_index_t>, long unsigned int, long unsigned int&>, boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>, boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>, boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>, std::back_insert_iterator >, std::stack, std::deque, std::allocator > > >, std::vector, boost::vec_adj_list_vertex_id_map, long unsigned int>, boost::dfs_visitor<> > >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::CopyConstructibleConcept >, boost::adj_list_edge_property_map, boost::edge_index_t>, long unsigned int, long unsigned int&>, boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>, boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>, boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>, std::back_insert_iterator >, std::stack, std::deque, std::allocator > > >, std::vector, boost::vec_adj_list_vertex_id_map, long unsigned int>, boost::dfs_visitor<> > >]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied >, boost::adj_list_edge_property_map, boost::edge_index_t>, long unsigned int, long unsigned int&>, boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>, boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>, boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>, std::back_insert_iterator >, std::stack, std::deque, std::allocator > > >, std::vector, boost::vec_adj_list_vertex_id_map, long unsigned int>, boost::dfs_visitor<> > > >::value’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied >, boost::adj_list_edge_property_map, boost::edge_index_t>, long unsigned int, long unsigned int&>, boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>, boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>, boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>, std::back_insert_iterator >, std::stack, std::deque, std::allocator > > >, std::vector, boost::vec_adj_list_vertex_id_map, long unsigned int>, boost::dfs_visitor<> > > >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:72:8: [ skipping 12 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/biconnected_components.hpp:295:60: required from ‘static std::pair boost::detail::bicomp_dispatch2::apply(const Graph&, ComponentMap, OutputIterator, VertexIndexMap, DiscoverTimeMap, const boost::bgl_named_params&, boost::param_not_found) [with Graph = boost::adjacency_list, boost::property >; ComponentMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::adj_list_edge_property_map, boost::edge_index_t>, long unsigned int, long unsigned int&>; OutputIterator = std::back_insert_iterator >; VertexIndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>; DiscoverTimeMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>; P = int; T = boost::buffer_param_t; R = boost::no_property]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/biconnected_components.hpp:336:60: required from ‘static std::pair boost::detail::bicomp_dispatch1::apply(const Graph&, ComponentMap, OutputIterator, VertexIndexMap, const boost::bgl_named_params&, boost::param_not_found) [with Graph = boost::adjacency_list, boost::property >; ComponentMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::adj_list_edge_property_map, boost::edge_index_t>, long unsigned int, long unsigned int&>; OutputIterator = std::back_insert_iterator >; VertexIndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>; P = int; T = boost::buffer_param_t; R = boost::no_property]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/biconnected_components.hpp:368:60: required from ‘std::pair boost::biconnected_components(const Graph&, ComponentMap, OutputIterator, const bgl_named_params&) [with Graph = adjacency_list, property >; ComponentMap = iterator_property_map<__gnu_cxx::__normal_iterator >, adj_list_edge_property_map, edge_index_t>, long unsigned int, long unsigned int&>; OutputIterator = std::back_insert_iterator >; P = int; T = buffer_param_t; R = no_property]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/biconnected_components.hpp:377:34: required from ‘std::pair boost::biconnected_components(const Graph&, ComponentMap, OutputIterator) [with Graph = adjacency_list, property >; ComponentMap = iterator_property_map<__gnu_cxx::__normal_iterator >, adj_list_edge_property_map, edge_index_t>, long unsigned int, long unsigned int&>; OutputIterator = std::back_insert_iterator >]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/make_biconnected_planar.hpp:44:27: required from ‘void boost::make_biconnected_planar(Graph&, PlanarEmbedding, EdgeIndexMap, AddEdgeVisitor&) [with Graph = adjacency_list, property >; PlanarEmbedding = std::vector >*; EdgeIndexMap = adj_list_edge_property_map, edge_index_t>; AddEdgeVisitor = my_add_edge_visitor, property >, long unsigned int>]’ planar.cpp:213:35: required from here /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::CopyConstructible >, boost::adj_list_edge_property_map, boost::edge_index_t>, long unsigned int, long unsigned int&>, boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>, boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>, boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>, std::back_insert_iterator >, std::stack, std::deque, std::allocator > > >, std::vector, boost::vec_adj_list_vertex_id_map, long unsigned int>, boost::dfs_visitor<> > >]’ 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ^ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::CopyConstructibleConcept >, boost::adj_list_edge_property_map, boost::edge_index_t>, long unsigned int, long unsigned int&>, boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>, boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>, boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>, std::back_insert_iterator >, std::stack, std::deque, std::allocator > > >, std::vector, boost::vec_adj_list_vertex_id_map, long unsigned int>, boost::dfs_visitor<> > >]’: /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/depth_first_search.hpp:41:9: required from ‘void boost::DFSVisitorConcept::constraints() [with Visitor = boost::detail::biconnected_components_visitor >, boost::adj_list_edge_property_map, boost::edge_index_t>, long unsigned int, long unsigned int&>, boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>, boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>, boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>, std::back_insert_iterator >, std::stack, std::deque, std::allocator > > >, std::vector, boost::vec_adj_list_vertex_id_map, long unsigned int>, boost::dfs_visitor<> >; Graph = boost::adjacency_list, boost::property >]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::DFSVisitorConcept >, boost::adj_list_edge_property_map, boost::edge_index_t>, long unsigned int, long unsigned int&>, boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>, boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>, boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>, std::back_insert_iterator >, std::stack, std::deque, std::allocator > > >, std::vector, boost::vec_adj_list_vertex_id_map, long unsigned int>, boost::dfs_visitor<> >, boost::adjacency_list, boost::property > >]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied >, boost::adj_list_edge_property_map, boost::edge_index_t>, long unsigned int, long unsigned int&>, boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>, boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>, boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>, std::back_insert_iterator >, std::stack, std::deque, std::allocator > > >, std::vector, boost::vec_adj_list_vertex_id_map, long unsigned int>, boost::dfs_visitor<> >, boost::adjacency_list, boost::property > > >::value’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied >, boost::adj_list_edge_property_map, boost::edge_index_t>, long unsigned int, long unsigned int&>, boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>, boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>, boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>, std::back_insert_iterator >, std::stack, std::deque, std::allocator > > >, std::vector, boost::vec_adj_list_vertex_id_map, long unsigned int>, boost::dfs_visitor<> >, boost::adjacency_list, boost::property > > >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_ >, boost::adj_list_edge_property_map, boost::edge_index_t>, long unsigned int, long unsigned int&>, boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>, boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>, boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>, std::back_insert_iterator >, std::stack, std::deque, std::allocator > > >, std::vector, boost::vec_adj_list_vertex_id_map, long unsigned int>, boost::dfs_visitor<> >, boost::adjacency_list, boost::property > >)>’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/depth_first_search.hpp:130:9: [ skipping 6 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/biconnected_components.hpp:295:60: required from ‘static std::pair boost::detail::bicomp_dispatch2::apply(const Graph&, ComponentMap, OutputIterator, VertexIndexMap, DiscoverTimeMap, const boost::bgl_named_params&, boost::param_not_found) [with Graph = boost::adjacency_list, boost::property >; ComponentMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::adj_list_edge_property_map, boost::edge_index_t>, long unsigned int, long unsigned int&>; OutputIterator = std::back_insert_iterator >; VertexIndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>; DiscoverTimeMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>; P = int; T = boost::buffer_param_t; R = boost::no_property]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/biconnected_components.hpp:336:60: required from ‘static std::pair boost::detail::bicomp_dispatch1::apply(const Graph&, ComponentMap, OutputIterator, VertexIndexMap, const boost::bgl_named_params&, boost::param_not_found) [with Graph = boost::adjacency_list, boost::property >; ComponentMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::adj_list_edge_property_map, boost::edge_index_t>, long unsigned int, long unsigned int&>; OutputIterator = std::back_insert_iterator >; VertexIndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>; P = int; T = boost::buffer_param_t; R = boost::no_property]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/biconnected_components.hpp:368:60: required from ‘std::pair boost::biconnected_components(const Graph&, ComponentMap, OutputIterator, const bgl_named_params&) [with Graph = adjacency_list, property >; ComponentMap = iterator_property_map<__gnu_cxx::__normal_iterator >, adj_list_edge_property_map, edge_index_t>, long unsigned int, long unsigned int&>; OutputIterator = std::back_insert_iterator >; P = int; T = buffer_param_t; R = no_property]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/biconnected_components.hpp:377:34: required from ‘std::pair boost::biconnected_components(const Graph&, ComponentMap, OutputIterator) [with Graph = adjacency_list, property >; ComponentMap = iterator_property_map<__gnu_cxx::__normal_iterator >, adj_list_edge_property_map, edge_index_t>, long unsigned int, long unsigned int&>; OutputIterator = std::back_insert_iterator >]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/make_biconnected_planar.hpp:44:27: required from ‘void boost::make_biconnected_planar(Graph&, PlanarEmbedding, EdgeIndexMap, AddEdgeVisitor&) [with Graph = adjacency_list, property >; PlanarEmbedding = std::vector >*; EdgeIndexMap = adj_list_edge_property_map, edge_index_t>; AddEdgeVisitor = my_add_edge_visitor, property >, long unsigned int>]’ planar.cpp:213:35: required from here /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:165:17: note: in a call to non-static member function ‘boost::CopyConstructibleConcept >, boost::adj_list_edge_property_map, boost::edge_index_t>, long unsigned int, long unsigned int&>, boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>, boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>, boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>, std::back_insert_iterator >, std::stack, std::deque, std::allocator > > >, std::vector, boost::vec_adj_list_vertex_id_map, long unsigned int>, boost::dfs_visitor<> > >::~CopyConstructibleConcept()’ 165 | BOOST_concept(CopyConstructible,(TT)) | ^~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/preprocessor/cat.hpp:29:34: note: in definition of macro ‘BOOST_PP_CAT_I’ 29 | # define BOOST_PP_CAT_I(a, b) a ## b | ^ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/concept_def.hpp:23:12: note: in expansion of macro ‘BOOST_PP_CAT’ 23 | struct BOOST_PP_CAT(name,Concept) \ | ^~~~~~~~~~~~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:165:3: note: in expansion of macro ‘BOOST_concept’ 165 | BOOST_concept(CopyConstructible,(TT)) | ^~~~~~~~~~~~~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements, std::input_iterator_tag> >]’: /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:208:5: required from ‘struct boost::Convertible, std::input_iterator_tag>’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::Convertible, std::input_iterator_tag>]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied, std::input_iterator_tag> >::value’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied, std::input_iterator_tag> >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_, std::input_iterator_tag>)>’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:515:9: [ skipping 7 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/isomorphism.hpp:651:42: required from ‘bool boost::graph::detail::isomorphism_impl::operator()(const Graph1&, const Graph2&, const ArgPack&) const [with ArgPack = boost::parameter::aux::empty_arg_list; Graph1 = boost::adjacency_list; Graph2 = boost::adjacency_list]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/isomorphism.hpp:662:5: required from ‘typename boost::result_of(Param0, Param1, const ArgPack&)>::type boost::graph::isomorphism_with_named_params(const Param0&, const Param1&, const ArgPack&) [with Param0 = boost::adjacency_list; Param1 = boost::adjacency_list; ArgPack = boost::parameter::aux::empty_arg_list; typename boost::result_of(Param0, Param1, const ArgPack&)>::type = bool]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/isomorphism.hpp:666:1: required from ‘typename boost::result_of(Param0, Param1, const boost::parameter::aux::empty_arg_list&)>::type boost::isomorphism(const Param0&, const Param1&) [with Param0 = adjacency_list; Param1 = adjacency_list; typename result_of(Param0, Param1, const parameter::aux::empty_arg_list&)>::type = bool]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/is_kuratowski_subgraph.hpp:278:34: required from ‘bool boost::is_kuratowski_subgraph(const Graph&, ForwardIterator, ForwardIterator, VertexIndexMap) [with Graph = adjacency_list, property >; ForwardIterator = __gnu_cxx::__normal_iterator*, std::vector > >; VertexIndexMap = vec_adj_list_vertex_id_map, long unsigned int>]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/is_kuratowski_subgraph.hpp:290:34: required from ‘bool boost::is_kuratowski_subgraph(const Graph&, ForwardIterator, ForwardIterator) [with Graph = adjacency_list, property >; ForwardIterator = __gnu_cxx::__normal_iterator*, std::vector > >]’ planar.cpp:435:37: required from here /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::Convertible, std::input_iterator_tag>]’ 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ^ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::Convertible, std::input_iterator_tag>]’: /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:515:9: required from ‘boost::InputIterator::~InputIterator() [with TT = boost::detail::undirected_edge_iter >, boost::detail::edge_desc_impl, long int>]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::InputIterator >, boost::detail::edge_desc_impl, long int> >]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/graph_concepts.hpp:53:35: required from ‘boost::concepts::MultiPassInputIterator::~MultiPassInputIterator() [with T = boost::detail::undirected_edge_iter >, boost::detail::edge_desc_impl, long int>]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::MultiPassInputIterator >, boost::detail::edge_desc_impl, long int> >]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/graph_concepts.hpp:235:9: required from ‘boost::concepts::EdgeListGraph::~EdgeListGraph() [with G = boost::adjacency_list]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/graph_concepts.hpp:226:1: [ skipping 2 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/isomorphism.hpp:651:42: required from ‘bool boost::graph::detail::isomorphism_impl::operator()(const Graph1&, const Graph2&, const ArgPack&) const [with ArgPack = boost::parameter::aux::empty_arg_list; Graph1 = boost::adjacency_list; Graph2 = boost::adjacency_list]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/isomorphism.hpp:662:5: required from ‘typename boost::result_of(Param0, Param1, const ArgPack&)>::type boost::graph::isomorphism_with_named_params(const Param0&, const Param1&, const ArgPack&) [with Param0 = boost::adjacency_list; Param1 = boost::adjacency_list; ArgPack = boost::parameter::aux::empty_arg_list; typename boost::result_of(Param0, Param1, const ArgPack&)>::type = bool]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/isomorphism.hpp:666:1: required from ‘typename boost::result_of(Param0, Param1, const boost::parameter::aux::empty_arg_list&)>::type boost::isomorphism(const Param0&, const Param1&) [with Param0 = adjacency_list; Param1 = adjacency_list; typename result_of(Param0, Param1, const parameter::aux::empty_arg_list&)>::type = bool]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/is_kuratowski_subgraph.hpp:278:34: required from ‘bool boost::is_kuratowski_subgraph(const Graph&, ForwardIterator, ForwardIterator, VertexIndexMap) [with Graph = adjacency_list, property >; ForwardIterator = __gnu_cxx::__normal_iterator*, std::vector > >; VertexIndexMap = vec_adj_list_vertex_id_map, long unsigned int>]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/is_kuratowski_subgraph.hpp:290:34: required from ‘bool boost::is_kuratowski_subgraph(const Graph&, ForwardIterator, ForwardIterator) [with Graph = adjacency_list, property >; ForwardIterator = __gnu_cxx::__normal_iterator*, std::vector > >]’ planar.cpp:435:37: required from here /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::Convertible::~Convertible() [with X = boost::iterators::detail::iterator_category_with_traversal; Y = std::input_iterator_tag]’ 37 | ~model() | ^ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:208:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 208 | BOOST_CONCEPT_USAGE(Convertible) { | ^~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::concepts::MultiPassInputIterator >, boost::no_property>*, std::vector >, boost::no_property>, std::allocator >, boost::no_property> > > >, long unsigned int, boost::detail::edge_desc_impl, long int> >]’: /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements >, boost::no_property>*, std::vector >, boost::no_property>, std::allocator >, boost::no_property> > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/graph_concepts.hpp:52:50: required from ‘struct boost::concepts::MultiPassInputIterator >, boost::no_property>*, std::vector >, boost::no_property>, std::allocator >, boost::no_property> > > >, long unsigned int, boost::detail::edge_desc_impl, long int> >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::concepts::MultiPassInputIterator >, boost::no_property>*, std::vector >, boost::no_property>, std::allocator >, boost::no_property> > > >, long unsigned int, boost::detail::edge_desc_impl, long int> >]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied >, boost::no_property>*, std::vector >, boost::no_property>, std::allocator >, boost::no_property> > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::value’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied >, boost::no_property>*, std::vector >, boost::no_property>, std::allocator >, boost::no_property> > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:72:8: [ skipping 7 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/isomorphism.hpp:651:42: required from ‘bool boost::graph::detail::isomorphism_impl::operator()(const Graph1&, const Graph2&, const ArgPack&) const [with ArgPack = boost::parameter::aux::empty_arg_list; Graph1 = boost::adjacency_list; Graph2 = boost::adjacency_list]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/isomorphism.hpp:662:5: required from ‘typename boost::result_of(Param0, Param1, const ArgPack&)>::type boost::graph::isomorphism_with_named_params(const Param0&, const Param1&, const ArgPack&) [with Param0 = boost::adjacency_list; Param1 = boost::adjacency_list; ArgPack = boost::parameter::aux::empty_arg_list; typename boost::result_of(Param0, Param1, const ArgPack&)>::type = bool]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/isomorphism.hpp:666:1: required from ‘typename boost::result_of(Param0, Param1, const boost::parameter::aux::empty_arg_list&)>::type boost::isomorphism(const Param0&, const Param1&) [with Param0 = adjacency_list; Param1 = adjacency_list; typename result_of(Param0, Param1, const parameter::aux::empty_arg_list&)>::type = bool]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/is_kuratowski_subgraph.hpp:278:34: required from ‘bool boost::is_kuratowski_subgraph(const Graph&, ForwardIterator, ForwardIterator, VertexIndexMap) [with Graph = adjacency_list, property >; ForwardIterator = __gnu_cxx::__normal_iterator*, std::vector > >; VertexIndexMap = vec_adj_list_vertex_id_map, long unsigned int>]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/is_kuratowski_subgraph.hpp:290:34: required from ‘bool boost::is_kuratowski_subgraph(const Graph&, ForwardIterator, ForwardIterator) [with Graph = adjacency_list, property >; ForwardIterator = __gnu_cxx::__normal_iterator*, std::vector > >]’ planar.cpp:435:37: required from here /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::concepts::MultiPassInputIterator::~MultiPassInputIterator() [with T = boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator >, boost::no_property>*, std::vector >, boost::no_property>, std::allocator >, boost::no_property> > > >, long unsigned int, boost::detail::edge_desc_impl, long int>]’ 37 | ~model() | ^ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/graph_concepts.hpp:52:50: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 52 | BOOST_concept(MultiPassInputIterator, (T)) { BOOST_CONCEPT_USAGE( | ^~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::concepts::MultiPassInputIterator, long unsigned int*, boost::vec_adj_list_vertex_id_map, long unsigned int> >::non_odd_vertex >, boost::vec_adj_list_vertex_id_map, long unsigned int>, int, int&> >, boost::filtered_graph, boost::keep_all, boost::maximum_cardinality_matching_verifier, long unsigned int*, boost::vec_adj_list_vertex_id_map, long unsigned int> >::non_odd_vertex >, boost::vec_adj_list_vertex_id_map, long unsigned int>, int, int&> > > >, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >, boost::property >*, std::vector > >, boost::property >, std::allocator > >, boost::property > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >]’: /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements, long unsigned int*, boost::vec_adj_list_vertex_id_map, long unsigned int> >::non_odd_vertex >, boost::vec_adj_list_vertex_id_map, long unsigned int>, int, int&> >, boost::filtered_graph, boost::keep_all, boost::maximum_cardinality_matching_verifier, long unsigned int*, boost::vec_adj_list_vertex_id_map, long unsigned int> >::non_odd_vertex >, boost::vec_adj_list_vertex_id_map, long unsigned int>, int, int&> > > >, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >, boost::property >*, std::vector > >, boost::property >, std::allocator > >, boost::property > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > > >]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/graph_concepts.hpp:52:50: required from ‘struct boost::concepts::MultiPassInputIterator, long unsigned int*, boost::vec_adj_list_vertex_id_map, long unsigned int> >::non_odd_vertex >, boost::vec_adj_list_vertex_id_map, long unsigned int>, int, int&> >, boost::filtered_graph, boost::keep_all, boost::maximum_cardinality_matching_verifier, long unsigned int*, boost::vec_adj_list_vertex_id_map, long unsigned int> >::non_odd_vertex >, boost::vec_adj_list_vertex_id_map, long unsigned int>, int, int&> > > >, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >, boost::property >*, std::vector > >, boost::property >, std::allocator > >, boost::property > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::concepts::MultiPassInputIterator, long unsigned int*, boost::vec_adj_list_vertex_id_map, long unsigned int> >::non_odd_vertex >, boost::vec_adj_list_vertex_id_map, long unsigned int>, int, int&> >, boost::filtered_graph, boost::keep_all, boost::maximum_cardinality_matching_verifier, long unsigned int*, boost::vec_adj_list_vertex_id_map, long unsigned int> >::non_odd_vertex >, boost::vec_adj_list_vertex_id_map, long unsigned int>, int, int&> > > >, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >, boost::property >*, std::vector > >, boost::property >, std::allocator > >, boost::property > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied, long unsigned int*, boost::vec_adj_list_vertex_id_map, long unsigned int> >::non_odd_vertex >, boost::vec_adj_list_vertex_id_map, long unsigned int>, int, int&> >, boost::filtered_graph, boost::keep_all, boost::maximum_cardinality_matching_verifier, long unsigned int*, boost::vec_adj_list_vertex_id_map, long unsigned int> >::non_odd_vertex >, boost::vec_adj_list_vertex_id_map, long unsigned int>, int, int&> > > >, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >, boost::property >*, std::vector > >, boost::property >, std::allocator > >, boost::property > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > > >::value’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied, long unsigned int*, boost::vec_adj_list_vertex_id_map, long unsigned int> >::non_odd_vertex >, boost::vec_adj_list_vertex_id_map, long unsigned int>, int, int&> >, boost::filtered_graph, boost::keep_all, boost::maximum_cardinality_matching_verifier, long unsigned int*, boost::vec_adj_list_vertex_id_map, long unsigned int> >::non_odd_vertex >, boost::vec_adj_list_vertex_id_map, long unsigned int>, int, int&> > > >, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >, boost::property >*, std::vector > >, boost::property >, std::allocator > >, boost::property > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > > >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:72:8: [ skipping 7 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/depth_first_search.hpp:409:1: required from ‘typename boost::result_of(Param0, const typename boost::detail::convert_bgl_params_to_boost_parameter >::type&)>::type boost::depth_first_search(const Param0&, const bgl_named_params&) [with Param0 = filtered_graph, keep_all, maximum_cardinality_matching_verifier, long unsigned int*, vec_adj_list_vertex_id_map, long unsigned int> >::non_odd_vertex >, vec_adj_list_vertex_id_map, long unsigned int>, int, int&> > >; P = vec_adj_list_vertex_id_map, long unsigned int>; T = vertex_index_t; R = bgl_named_params, graph_visitor_t, no_property>; typename result_of(Param0, const typename detail::convert_bgl_params_to_boost_parameter >::type&)>::type = void; typename detail::convert_bgl_params_to_boost_parameter >::type = parameter::aux::arg_list, long unsigned int> >, parameter::aux::arg_list >, parameter::aux::empty_arg_list, std::integral_constant >, std::integral_constant >]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/max_cardinality_matching.hpp:779:27: required from ‘static bool boost::maximum_cardinality_matching_verifier::verify_matching(const Graph&, MateMap, VertexIndexMap) [with Graph = R_adjacency_list; MateMap = long unsigned int*; VertexIndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/max_cardinality_matching.hpp:807:79: required from ‘bool boost::matching(const Graph&, MateMap, VertexIndexMap) [with Graph = R_adjacency_list; MateMap = long unsigned int*; VertexIndexMap = vec_adj_list_vertex_id_map, long unsigned int>; AugmentingPathFinder = edmonds_augmenting_path_finder; InitialMatchingFinder = extra_greedy_matching; MatchingVerifier = maximum_cardinality_matching_verifier]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/max_cardinality_matching.hpp:817:48: required from ‘bool boost::checked_edmonds_maximum_cardinality_matching(const Graph&, MateMap, VertexIndexMap) [with Graph = R_adjacency_list; MateMap = long unsigned int*; VertexIndexMap = vec_adj_list_vertex_id_map, long unsigned int>]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/max_cardinality_matching.hpp:824:56: required from ‘bool boost::checked_edmonds_maximum_cardinality_matching(const Graph&, MateMap) [with Graph = R_adjacency_list; MateMap = long unsigned int*]’ planar.cpp:686:60: required from here /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::concepts::MultiPassInputIterator::~MultiPassInputIterator() [with T = boost::iterators::filter_iterator, long unsigned int*, boost::vec_adj_list_vertex_id_map, long unsigned int> >::non_odd_vertex >, boost::vec_adj_list_vertex_id_map, long unsigned int>, int, int&> >, boost::filtered_graph, boost::keep_all, boost::maximum_cardinality_matching_verifier, long unsigned int*, boost::vec_adj_list_vertex_id_map, long unsigned int> >::non_odd_vertex >, boost::vec_adj_list_vertex_id_map, long unsigned int>, int, int&> > > >, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >, boost::property >*, std::vector > >, boost::property >, std::allocator > >, boost::property > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> >]’ 37 | ~model() | ^ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/graph_concepts.hpp:52:50: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 52 | BOOST_concept(MultiPassInputIterator, (T)) { BOOST_CONCEPT_USAGE( | ^~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements, std::input_iterator_tag> >]’: /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:208:5: required from ‘struct boost::Convertible, std::input_iterator_tag>’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::Convertible, std::input_iterator_tag>]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied, std::input_iterator_tag> >::value’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied, std::input_iterator_tag> >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_, std::input_iterator_tag>)>’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:515:9: [ skipping 8 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/depth_first_search.hpp:397:42: required from ‘void boost::graph::detail::depth_first_search_impl::operator()(const Graph&, const ArgPack&) const [with ArgPack = boost::parameter::aux::arg_list >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&> > >, boost::parameter::aux::empty_arg_list, std::integral_constant >; Graph = boost::adjacency_list, boost::property >]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/depth_first_search.hpp:406:5: required from ‘typename boost::result_of(Param0, const ArgPack&)>::type boost::graph::depth_first_search_with_named_params(const Param0&, const ArgPack&) [with Param0 = boost::adjacency_list, boost::property >; ArgPack = boost::parameter::aux::arg_list >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&> > >, boost::parameter::aux::empty_arg_list, std::integral_constant >; typename boost::result_of(Param0, const ArgPack&)>::type = void]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/depth_first_search.hpp:409:1: required from ‘typename boost::result_of(Param0, const typename boost::detail::convert_bgl_params_to_boost_parameter >::type&)>::type boost::depth_first_search(const Param0&, const bgl_named_params&) [with Param0 = adjacency_list, property >; P = detail::components_recorder >, vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&> >; T = graph_visitor_t; R = no_property; typename result_of(Param0, const typename detail::convert_bgl_params_to_boost_parameter >::type&)>::type = void; typename detail::convert_bgl_params_to_boost_parameter >::type = parameter::aux::arg_list >, vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&> > >, parameter::aux::empty_arg_list, std::integral_constant >]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/connected_components.hpp:106:23: required from ‘typename boost::property_traits::value_type boost::connected_components(const Graph&, ComponentMap, typename enable_if_c::traversal_category>::value, graph::detail::no_parameter>::type) [with Graph = adjacency_list, property >; ComponentMap = iterator_property_map<__gnu_cxx::__normal_iterator >, vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>; typename property_traits::value_type = long unsigned int; typename enable_if_c::traversal_category>::value, graph::detail::no_parameter>::type = graph::detail::no_parameter; typename graph_traits::traversal_category = undir_adj_list_traversal_tag]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/make_connected.hpp:38:51: required from ‘void boost::make_connected(Graph&, VertexIndexMap, AddEdgeVisitor&) [with Graph = adjacency_list, property >; VertexIndexMap = vec_adj_list_vertex_id_map, long unsigned int>; AddEdgeVisitor = my_add_edge_visitor, property >, long unsigned int>]’ planar.cpp:211:26: required from here /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::Convertible, std::input_iterator_tag>]’ 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ^ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::Convertible, std::input_iterator_tag>]’: /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:515:9: required from ‘boost::InputIterator::~InputIterator() [with TT = boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >, boost::property >*, std::vector > >, boost::property >, std::allocator > >, boost::property > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::InputIterator > >, boost::property >*, std::vector > >, boost::property >, std::allocator > >, boost::property > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> >]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/graph_concepts.hpp:53:35: required from ‘boost::concepts::MultiPassInputIterator::~MultiPassInputIterator() [with T = boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >, boost::property >*, std::vector > >, boost::property >, std::allocator > >, boost::property > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::MultiPassInputIterator > >, boost::property >*, std::vector > >, boost::property >, std::allocator > >, boost::property > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> >]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/graph_concepts.hpp:89:9: required from ‘boost::concepts::IncidenceGraph::~IncidenceGraph() [with G = boost::adjacency_list, boost::property >]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/graph_concepts.hpp:75:1: [ skipping 3 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/depth_first_search.hpp:397:42: required from ‘void boost::graph::detail::depth_first_search_impl::operator()(const Graph&, const ArgPack&) const [with ArgPack = boost::parameter::aux::arg_list >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&> > >, boost::parameter::aux::empty_arg_list, std::integral_constant >; Graph = boost::adjacency_list, boost::property >]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/depth_first_search.hpp:406:5: required from ‘typename boost::result_of(Param0, const ArgPack&)>::type boost::graph::depth_first_search_with_named_params(const Param0&, const ArgPack&) [with Param0 = boost::adjacency_list, boost::property >; ArgPack = boost::parameter::aux::arg_list >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&> > >, boost::parameter::aux::empty_arg_list, std::integral_constant >; typename boost::result_of(Param0, const ArgPack&)>::type = void]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/depth_first_search.hpp:409:1: required from ‘typename boost::result_of(Param0, const typename boost::detail::convert_bgl_params_to_boost_parameter >::type&)>::type boost::depth_first_search(const Param0&, const bgl_named_params&) [with Param0 = adjacency_list, property >; P = detail::components_recorder >, vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&> >; T = graph_visitor_t; R = no_property; typename result_of(Param0, const typename detail::convert_bgl_params_to_boost_parameter >::type&)>::type = void; typename detail::convert_bgl_params_to_boost_parameter >::type = parameter::aux::arg_list >, vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&> > >, parameter::aux::empty_arg_list, std::integral_constant >]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/connected_components.hpp:106:23: required from ‘typename boost::property_traits::value_type boost::connected_components(const Graph&, ComponentMap, typename enable_if_c::traversal_category>::value, graph::detail::no_parameter>::type) [with Graph = adjacency_list, property >; ComponentMap = iterator_property_map<__gnu_cxx::__normal_iterator >, vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>; typename property_traits::value_type = long unsigned int; typename enable_if_c::traversal_category>::value, graph::detail::no_parameter>::type = graph::detail::no_parameter; typename graph_traits::traversal_category = undir_adj_list_traversal_tag]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/make_connected.hpp:38:51: required from ‘void boost::make_connected(Graph&, VertexIndexMap, AddEdgeVisitor&) [with Graph = adjacency_list, property >; VertexIndexMap = vec_adj_list_vertex_id_map, long unsigned int>; AddEdgeVisitor = my_add_edge_visitor, property >, long unsigned int>]’ planar.cpp:211:26: required from here /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::Convertible::~Convertible() [with X = boost::iterators::detail::iterator_category_with_traversal; Y = std::input_iterator_tag]’ 37 | ~model() | ^ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:208:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 208 | BOOST_CONCEPT_USAGE(Convertible) { | ^~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::CopyConstructible >, boost::adj_list_edge_property_map, boost::edge_index_t>, long unsigned int, long unsigned int&>, boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>, boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>, boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>, std::back_insert_iterator >, std::stack, std::deque, std::allocator > > >, std::vector, boost::vec_adj_list_vertex_id_map, long unsigned int>, boost::dfs_visitor<> > >]’: /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements >, boost::adj_list_edge_property_map, boost::edge_index_t>, long unsigned int, long unsigned int&>, boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>, boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>, boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>, std::back_insert_iterator >, std::stack, std::deque, std::allocator > > >, std::vector, boost::vec_adj_list_vertex_id_map, long unsigned int>, boost::dfs_visitor<> > > >]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:167:5: required from ‘struct boost::CopyConstructible >, boost::adj_list_edge_property_map, boost::edge_index_t>, long unsigned int, long unsigned int&>, boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>, boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>, boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>, std::back_insert_iterator >, std::stack, std::deque, std::allocator > > >, std::vector, boost::vec_adj_list_vertex_id_map, long unsigned int>, boost::dfs_visitor<> > >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:165:3: required from ‘struct boost::CopyConstructibleConcept >, boost::adj_list_edge_property_map, boost::edge_index_t>, long unsigned int, long unsigned int&>, boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>, boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>, boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>, std::back_insert_iterator >, std::stack, std::deque, std::allocator > > >, std::vector, boost::vec_adj_list_vertex_id_map, long unsigned int>, boost::dfs_visitor<> > >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::CopyConstructibleConcept >, boost::adj_list_edge_property_map, boost::edge_index_t>, long unsigned int, long unsigned int&>, boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>, boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>, boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>, std::back_insert_iterator >, std::stack, std::deque, std::allocator > > >, std::vector, boost::vec_adj_list_vertex_id_map, long unsigned int>, boost::dfs_visitor<> > >]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied >, boost::adj_list_edge_property_map, boost::edge_index_t>, long unsigned int, long unsigned int&>, boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>, boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>, boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>, std::back_insert_iterator >, std::stack, std::deque, std::allocator > > >, std::vector, boost::vec_adj_list_vertex_id_map, long unsigned int>, boost::dfs_visitor<> > > >::value’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:45:51: [ skipping 13 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/biconnected_components.hpp:295:60: required from ‘static std::pair boost::detail::bicomp_dispatch2::apply(const Graph&, ComponentMap, OutputIterator, VertexIndexMap, DiscoverTimeMap, const boost::bgl_named_params&, boost::param_not_found) [with Graph = boost::adjacency_list, boost::property >; ComponentMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::adj_list_edge_property_map, boost::edge_index_t>, long unsigned int, long unsigned int&>; OutputIterator = std::back_insert_iterator >; VertexIndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>; DiscoverTimeMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>; P = int; T = boost::buffer_param_t; R = boost::no_property]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/biconnected_components.hpp:336:60: required from ‘static std::pair boost::detail::bicomp_dispatch1::apply(const Graph&, ComponentMap, OutputIterator, VertexIndexMap, const boost::bgl_named_params&, boost::param_not_found) [with Graph = boost::adjacency_list, boost::property >; ComponentMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::adj_list_edge_property_map, boost::edge_index_t>, long unsigned int, long unsigned int&>; OutputIterator = std::back_insert_iterator >; VertexIndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>; P = int; T = boost::buffer_param_t; R = boost::no_property]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/biconnected_components.hpp:368:60: required from ‘std::pair boost::biconnected_components(const Graph&, ComponentMap, OutputIterator, const bgl_named_params&) [with Graph = adjacency_list, property >; ComponentMap = iterator_property_map<__gnu_cxx::__normal_iterator >, adj_list_edge_property_map, edge_index_t>, long unsigned int, long unsigned int&>; OutputIterator = std::back_insert_iterator >; P = int; T = buffer_param_t; R = no_property]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/biconnected_components.hpp:377:34: required from ‘std::pair boost::biconnected_components(const Graph&, ComponentMap, OutputIterator) [with Graph = adjacency_list, property >; ComponentMap = iterator_property_map<__gnu_cxx::__normal_iterator >, adj_list_edge_property_map, edge_index_t>, long unsigned int, long unsigned int&>; OutputIterator = std::back_insert_iterator >]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/make_biconnected_planar.hpp:44:27: required from ‘void boost::make_biconnected_planar(Graph&, PlanarEmbedding, EdgeIndexMap, AddEdgeVisitor&) [with Graph = adjacency_list, property >; PlanarEmbedding = std::vector >*; EdgeIndexMap = adj_list_edge_property_map, edge_index_t>; AddEdgeVisitor = my_add_edge_visitor, property >, long unsigned int>]’ planar.cpp:213:35: required from here /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::CopyConstructible::~CopyConstructible() [with TT = boost::detail::biconnected_components_visitor >, boost::adj_list_edge_property_map, boost::edge_index_t>, long unsigned int, long unsigned int&>, boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>, boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>, boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>, std::back_insert_iterator >, std::stack, std::deque, std::allocator > > >, std::vector, boost::vec_adj_list_vertex_id_map, long unsigned int>, boost::dfs_visitor<> >]’ 37 | ~model() | ^ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:167:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 167 | BOOST_CONCEPT_USAGE(CopyConstructible) { | ^~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::Convertible, std::input_iterator_tag>]’: /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements, std::input_iterator_tag> >]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:208:5: required from ‘struct boost::Convertible, std::input_iterator_tag>’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::Convertible, std::input_iterator_tag>]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied, std::input_iterator_tag> >::value’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied, std::input_iterator_tag> >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:72:8: [ skipping 8 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/isomorphism.hpp:651:42: required from ‘bool boost::graph::detail::isomorphism_impl::operator()(const Graph1&, const Graph2&, const ArgPack&) const [with ArgPack = boost::parameter::aux::empty_arg_list; Graph1 = boost::adjacency_list; Graph2 = boost::adjacency_list]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/isomorphism.hpp:662:5: required from ‘typename boost::result_of(Param0, Param1, const ArgPack&)>::type boost::graph::isomorphism_with_named_params(const Param0&, const Param1&, const ArgPack&) [with Param0 = boost::adjacency_list; Param1 = boost::adjacency_list; ArgPack = boost::parameter::aux::empty_arg_list; typename boost::result_of(Param0, Param1, const ArgPack&)>::type = bool]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/isomorphism.hpp:666:1: required from ‘typename boost::result_of(Param0, Param1, const boost::parameter::aux::empty_arg_list&)>::type boost::isomorphism(const Param0&, const Param1&) [with Param0 = adjacency_list; Param1 = adjacency_list; typename result_of(Param0, Param1, const parameter::aux::empty_arg_list&)>::type = bool]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/is_kuratowski_subgraph.hpp:278:34: required from ‘bool boost::is_kuratowski_subgraph(const Graph&, ForwardIterator, ForwardIterator, VertexIndexMap) [with Graph = adjacency_list, property >; ForwardIterator = __gnu_cxx::__normal_iterator*, std::vector > >; VertexIndexMap = vec_adj_list_vertex_id_map, long unsigned int>]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/is_kuratowski_subgraph.hpp:290:34: required from ‘bool boost::is_kuratowski_subgraph(const Graph&, ForwardIterator, ForwardIterator) [with Graph = adjacency_list, property >; ForwardIterator = __gnu_cxx::__normal_iterator*, std::vector > >]’ planar.cpp:435:37: required from here /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::Convertible::~Convertible() [with X = boost::iterators::detail::iterator_category_with_traversal; Y = std::input_iterator_tag]’ 37 | ~model() | ^ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:208:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 208 | BOOST_CONCEPT_USAGE(Convertible) { | ^~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements >, boost::no_property>*, std::vector >, boost::no_property>, std::allocator >, boost::no_property> > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >]’: /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:145:5: required from ‘struct boost::Assignable >, boost::no_property>*, std::vector >, boost::no_property>, std::allocator >, boost::no_property> > > >, long unsigned int, boost::detail::edge_desc_impl, long int> >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:502:3: required from ‘struct boost::InputIterator >, boost::no_property>*, std::vector >, boost::no_property>, std::allocator >, boost::no_property> > > >, long unsigned int, boost::detail::edge_desc_impl, long int> >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::InputIterator >, boost::no_property>*, std::vector >, boost::no_property>, std::allocator >, boost::no_property> > > >, long unsigned int, boost::detail::edge_desc_impl, long int> >]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied >, boost::no_property>*, std::vector >, boost::no_property>, std::allocator >, boost::no_property> > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::value’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied >, boost::no_property>*, std::vector >, boost::no_property>, std::allocator >, boost::no_property> > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:72:8: [ skipping 9 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/isomorphism.hpp:651:42: required from ‘bool boost::graph::detail::isomorphism_impl::operator()(const Graph1&, const Graph2&, const ArgPack&) const [with ArgPack = boost::parameter::aux::empty_arg_list; Graph1 = boost::adjacency_list; Graph2 = boost::adjacency_list]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/isomorphism.hpp:662:5: required from ‘typename boost::result_of(Param0, Param1, const ArgPack&)>::type boost::graph::isomorphism_with_named_params(const Param0&, const Param1&, const ArgPack&) [with Param0 = boost::adjacency_list; Param1 = boost::adjacency_list; ArgPack = boost::parameter::aux::empty_arg_list; typename boost::result_of(Param0, Param1, const ArgPack&)>::type = bool]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/isomorphism.hpp:666:1: required from ‘typename boost::result_of(Param0, Param1, const boost::parameter::aux::empty_arg_list&)>::type boost::isomorphism(const Param0&, const Param1&) [with Param0 = adjacency_list; Param1 = adjacency_list; typename result_of(Param0, Param1, const parameter::aux::empty_arg_list&)>::type = bool]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/is_kuratowski_subgraph.hpp:278:34: required from ‘bool boost::is_kuratowski_subgraph(const Graph&, ForwardIterator, ForwardIterator, VertexIndexMap) [with Graph = adjacency_list, property >; ForwardIterator = __gnu_cxx::__normal_iterator*, std::vector > >; VertexIndexMap = vec_adj_list_vertex_id_map, long unsigned int>]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/is_kuratowski_subgraph.hpp:290:34: required from ‘bool boost::is_kuratowski_subgraph(const Graph&, ForwardIterator, ForwardIterator) [with Graph = adjacency_list, property >; ForwardIterator = __gnu_cxx::__normal_iterator*, std::vector > >]’ planar.cpp:435:37: required from here /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::Assignable >, boost::no_property>*, std::vector >, boost::no_property>, std::allocator >, boost::no_property> > > >, long unsigned int, boost::detail::edge_desc_impl, long int> >]’ 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ^ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements >, boost::no_property>*, std::vector >, boost::no_property>, std::allocator >, boost::no_property> > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >]’: /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:233:5: required from ‘struct boost::EqualityComparable >, boost::no_property>*, std::vector >, boost::no_property>, std::allocator >, boost::no_property> > > >, long unsigned int, boost::detail::edge_desc_impl, long int> >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:502:3: required from ‘struct boost::InputIterator >, boost::no_property>*, std::vector >, boost::no_property>, std::allocator >, boost::no_property> > > >, long unsigned int, boost::detail::edge_desc_impl, long int> >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::InputIterator >, boost::no_property>*, std::vector >, boost::no_property>, std::allocator >, boost::no_property> > > >, long unsigned int, boost::detail::edge_desc_impl, long int> >]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied >, boost::no_property>*, std::vector >, boost::no_property>, std::allocator >, boost::no_property> > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::value’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied >, boost::no_property>*, std::vector >, boost::no_property>, std::allocator >, boost::no_property> > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:72:8: [ skipping 9 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/isomorphism.hpp:651:42: required from ‘bool boost::graph::detail::isomorphism_impl::operator()(const Graph1&, const Graph2&, const ArgPack&) const [with ArgPack = boost::parameter::aux::empty_arg_list; Graph1 = boost::adjacency_list; Graph2 = boost::adjacency_list]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/isomorphism.hpp:662:5: required from ‘typename boost::result_of(Param0, Param1, const ArgPack&)>::type boost::graph::isomorphism_with_named_params(const Param0&, const Param1&, const ArgPack&) [with Param0 = boost::adjacency_list; Param1 = boost::adjacency_list; ArgPack = boost::parameter::aux::empty_arg_list; typename boost::result_of(Param0, Param1, const ArgPack&)>::type = bool]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/isomorphism.hpp:666:1: required from ‘typename boost::result_of(Param0, Param1, const boost::parameter::aux::empty_arg_list&)>::type boost::isomorphism(const Param0&, const Param1&) [with Param0 = adjacency_list; Param1 = adjacency_list; typename result_of(Param0, Param1, const parameter::aux::empty_arg_list&)>::type = bool]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/is_kuratowski_subgraph.hpp:278:34: required from ‘bool boost::is_kuratowski_subgraph(const Graph&, ForwardIterator, ForwardIterator, VertexIndexMap) [with Graph = adjacency_list, property >; ForwardIterator = __gnu_cxx::__normal_iterator*, std::vector > >; VertexIndexMap = vec_adj_list_vertex_id_map, long unsigned int>]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/is_kuratowski_subgraph.hpp:290:34: required from ‘bool boost::is_kuratowski_subgraph(const Graph&, ForwardIterator, ForwardIterator) [with Graph = adjacency_list, property >; ForwardIterator = __gnu_cxx::__normal_iterator*, std::vector > >]’ planar.cpp:435:37: required from here /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::EqualityComparable >, boost::no_property>*, std::vector >, boost::no_property>, std::allocator >, boost::no_property> > > >, long unsigned int, boost::detail::edge_desc_impl, long int> >]’ 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ^ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements >, boost::no_property>*, std::vector >, boost::no_property>, std::allocator >, boost::no_property> > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >]’: /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:512:7: required from ‘struct boost::InputIterator >, boost::no_property>*, std::vector >, boost::no_property>, std::allocator >, boost::no_property> > > >, long unsigned int, boost::detail::edge_desc_impl, long int> >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::InputIterator >, boost::no_property>*, std::vector >, boost::no_property>, std::allocator >, boost::no_property> > > >, long unsigned int, boost::detail::edge_desc_impl, long int> >]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied >, boost::no_property>*, std::vector >, boost::no_property>, std::allocator >, boost::no_property> > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::value’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied >, boost::no_property>*, std::vector >, boost::no_property>, std::allocator >, boost::no_property> > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_ >, boost::no_property>*, std::vector >, boost::no_property>, std::allocator >, boost::no_property> > > >, long unsigned int, boost::detail::edge_desc_impl, long int> >)>’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/graph_concepts.hpp:53:35: [ skipping 8 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/isomorphism.hpp:651:42: required from ‘bool boost::graph::detail::isomorphism_impl::operator()(const Graph1&, const Graph2&, const ArgPack&) const [with ArgPack = boost::parameter::aux::empty_arg_list; Graph1 = boost::adjacency_list; Graph2 = boost::adjacency_list]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/isomorphism.hpp:662:5: required from ‘typename boost::result_of(Param0, Param1, const ArgPack&)>::type boost::graph::isomorphism_with_named_params(const Param0&, const Param1&, const ArgPack&) [with Param0 = boost::adjacency_list; Param1 = boost::adjacency_list; ArgPack = boost::parameter::aux::empty_arg_list; typename boost::result_of(Param0, Param1, const ArgPack&)>::type = bool]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/isomorphism.hpp:666:1: required from ‘typename boost::result_of(Param0, Param1, const boost::parameter::aux::empty_arg_list&)>::type boost::isomorphism(const Param0&, const Param1&) [with Param0 = adjacency_list; Param1 = adjacency_list; typename result_of(Param0, Param1, const parameter::aux::empty_arg_list&)>::type = bool]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/is_kuratowski_subgraph.hpp:278:34: required from ‘bool boost::is_kuratowski_subgraph(const Graph&, ForwardIterator, ForwardIterator, VertexIndexMap) [with Graph = adjacency_list, property >; ForwardIterator = __gnu_cxx::__normal_iterator*, std::vector > >; VertexIndexMap = vec_adj_list_vertex_id_map, long unsigned int>]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/is_kuratowski_subgraph.hpp:290:34: required from ‘bool boost::is_kuratowski_subgraph(const Graph&, ForwardIterator, ForwardIterator) [with Graph = adjacency_list, property >; ForwardIterator = __gnu_cxx::__normal_iterator*, std::vector > >]’ planar.cpp:435:37: required from here /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::InputIterator >, boost::no_property>*, std::vector >, boost::no_property>, std::allocator >, boost::no_property> > > >, long unsigned int, boost::detail::edge_desc_impl, long int> >]’ 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ^ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::InputIterator >, boost::no_property>*, std::vector >, boost::no_property>, std::allocator >, boost::no_property> > > >, long unsigned int, boost::detail::edge_desc_impl, long int> >]’: /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/graph_concepts.hpp:53:35: required from ‘boost::concepts::MultiPassInputIterator::~MultiPassInputIterator() [with T = boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator >, boost::no_property>*, std::vector >, boost::no_property>, std::allocator >, boost::no_property> > > >, long unsigned int, boost::detail::edge_desc_impl, long int>]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::MultiPassInputIterator >, boost::no_property>*, std::vector >, boost::no_property>, std::allocator >, boost::no_property> > > >, long unsigned int, boost::detail::edge_desc_impl, long int> >]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/graph_concepts.hpp:89:9: required from ‘boost::concepts::IncidenceGraph::~IncidenceGraph() [with G = boost::adjacency_list]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/graph_concepts.hpp:75:1: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::IncidenceGraphConcept >]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/depth_first_search.hpp:129:9: required from ‘void boost::detail::depth_first_visit_impl(const IncidenceGraph&, typename boost::graph_traits::vertex_descriptor, DFSVisitor&, ColorMap, TerminatorFunc) [with IncidenceGraph = boost::adjacency_list; DFSVisitor = isomorphism_algo, boost::adjacency_list, boost::shared_array_property_map >, boost::degree_vertex_invariant >, boost::adjacency_list >, boost::degree_vertex_invariant >, boost::adjacency_list >, boost::vec_adj_list_vertex_id_map, boost::vec_adj_list_vertex_id_map >::record_dfs_order; ColorMap = boost::safe_iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map, boost::default_color_type, boost::default_color_type&>; TerminatorFunc = nontruth2; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/depth_first_search.hpp:417:35: [ skipping 3 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/isomorphism.hpp:651:42: required from ‘bool boost::graph::detail::isomorphism_impl::operator()(const Graph1&, const Graph2&, const ArgPack&) const [with ArgPack = boost::parameter::aux::empty_arg_list; Graph1 = boost::adjacency_list; Graph2 = boost::adjacency_list]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/isomorphism.hpp:662:5: required from ‘typename boost::result_of(Param0, Param1, const ArgPack&)>::type boost::graph::isomorphism_with_named_params(const Param0&, const Param1&, const ArgPack&) [with Param0 = boost::adjacency_list; Param1 = boost::adjacency_list; ArgPack = boost::parameter::aux::empty_arg_list; typename boost::result_of(Param0, Param1, const ArgPack&)>::type = bool]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/isomorphism.hpp:666:1: required from ‘typename boost::result_of(Param0, Param1, const boost::parameter::aux::empty_arg_list&)>::type boost::isomorphism(const Param0&, const Param1&) [with Param0 = adjacency_list; Param1 = adjacency_list; typename result_of(Param0, Param1, const parameter::aux::empty_arg_list&)>::type = bool]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/is_kuratowski_subgraph.hpp:278:34: required from ‘bool boost::is_kuratowski_subgraph(const Graph&, ForwardIterator, ForwardIterator, VertexIndexMap) [with Graph = adjacency_list, property >; ForwardIterator = __gnu_cxx::__normal_iterator*, std::vector > >; VertexIndexMap = vec_adj_list_vertex_id_map, long unsigned int>]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/is_kuratowski_subgraph.hpp:290:34: required from ‘bool boost::is_kuratowski_subgraph(const Graph&, ForwardIterator, ForwardIterator) [with Graph = adjacency_list, property >; ForwardIterator = __gnu_cxx::__normal_iterator*, std::vector > >]’ planar.cpp:435:37: required from here /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::InputIterator::~InputIterator() [with TT = boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator >, boost::no_property>*, std::vector >, boost::no_property>, std::allocator >, boost::no_property> > > >, long unsigned int, boost::detail::edge_desc_impl, long int>]’ 37 | ~model() | ^ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:512:7: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 512 | BOOST_CONCEPT_USAGE(InputIterator) | ^~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements, long unsigned int*, boost::vec_adj_list_vertex_id_map, long unsigned int> >::non_odd_vertex >, boost::vec_adj_list_vertex_id_map, long unsigned int>, int, int&> >, boost::filtered_graph, boost::keep_all, boost::maximum_cardinality_matching_verifier, long unsigned int*, boost::vec_adj_list_vertex_id_map, long unsigned int> >::non_odd_vertex >, boost::vec_adj_list_vertex_id_map, long unsigned int>, int, int&> > > >, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >, boost::property >*, std::vector > >, boost::property >, std::allocator > >, boost::property > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > > >]’: /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:145:5: required from ‘struct boost::Assignable, long unsigned int*, boost::vec_adj_list_vertex_id_map, long unsigned int> >::non_odd_vertex >, boost::vec_adj_list_vertex_id_map, long unsigned int>, int, int&> >, boost::filtered_graph, boost::keep_all, boost::maximum_cardinality_matching_verifier, long unsigned int*, boost::vec_adj_list_vertex_id_map, long unsigned int> >::non_odd_vertex >, boost::vec_adj_list_vertex_id_map, long unsigned int>, int, int&> > > >, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >, boost::property >*, std::vector > >, boost::property >, std::allocator > >, boost::property > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:502:3: required from ‘struct boost::InputIterator, long unsigned int*, boost::vec_adj_list_vertex_id_map, long unsigned int> >::non_odd_vertex >, boost::vec_adj_list_vertex_id_map, long unsigned int>, int, int&> >, boost::filtered_graph, boost::keep_all, boost::maximum_cardinality_matching_verifier, long unsigned int*, boost::vec_adj_list_vertex_id_map, long unsigned int> >::non_odd_vertex >, boost::vec_adj_list_vertex_id_map, long unsigned int>, int, int&> > > >, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >, boost::property >*, std::vector > >, boost::property >, std::allocator > >, boost::property > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::InputIterator, long unsigned int*, boost::vec_adj_list_vertex_id_map, long unsigned int> >::non_odd_vertex >, boost::vec_adj_list_vertex_id_map, long unsigned int>, int, int&> >, boost::filtered_graph, boost::keep_all, boost::maximum_cardinality_matching_verifier, long unsigned int*, boost::vec_adj_list_vertex_id_map, long unsigned int> >::non_odd_vertex >, boost::vec_adj_list_vertex_id_map, long unsigned int>, int, int&> > > >, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >, boost::property >*, std::vector > >, boost::property >, std::allocator > >, boost::property > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied, long unsigned int*, boost::vec_adj_list_vertex_id_map, long unsigned int> >::non_odd_vertex >, boost::vec_adj_list_vertex_id_map, long unsigned int>, int, int&> >, boost::filtered_graph, boost::keep_all, boost::maximum_cardinality_matching_verifier, long unsigned int*, boost::vec_adj_list_vertex_id_map, long unsigned int> >::non_odd_vertex >, boost::vec_adj_list_vertex_id_map, long unsigned int>, int, int&> > > >, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >, boost::property >*, std::vector > >, boost::property >, std::allocator > >, boost::property > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > > >::value’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied, long unsigned int*, boost::vec_adj_list_vertex_id_map, long unsigned int> >::non_odd_vertex >, boost::vec_adj_list_vertex_id_map, long unsigned int>, int, int&> >, boost::filtered_graph, boost::keep_all, boost::maximum_cardinality_matching_verifier, long unsigned int*, boost::vec_adj_list_vertex_id_map, long unsigned int> >::non_odd_vertex >, boost::vec_adj_list_vertex_id_map, long unsigned int>, int, int&> > > >, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >, boost::property >*, std::vector > >, boost::property >, std::allocator > >, boost::property > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > > >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:72:8: [ skipping 9 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/depth_first_search.hpp:409:1: required from ‘typename boost::result_of(Param0, const typename boost::detail::convert_bgl_params_to_boost_parameter >::type&)>::type boost::depth_first_search(const Param0&, const bgl_named_params&) [with Param0 = filtered_graph, keep_all, maximum_cardinality_matching_verifier, long unsigned int*, vec_adj_list_vertex_id_map, long unsigned int> >::non_odd_vertex >, vec_adj_list_vertex_id_map, long unsigned int>, int, int&> > >; P = vec_adj_list_vertex_id_map, long unsigned int>; T = vertex_index_t; R = bgl_named_params, graph_visitor_t, no_property>; typename result_of(Param0, const typename detail::convert_bgl_params_to_boost_parameter >::type&)>::type = void; typename detail::convert_bgl_params_to_boost_parameter >::type = parameter::aux::arg_list, long unsigned int> >, parameter::aux::arg_list >, parameter::aux::empty_arg_list, std::integral_constant >, std::integral_constant >]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/max_cardinality_matching.hpp:779:27: required from ‘static bool boost::maximum_cardinality_matching_verifier::verify_matching(const Graph&, MateMap, VertexIndexMap) [with Graph = R_adjacency_list; MateMap = long unsigned int*; VertexIndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/max_cardinality_matching.hpp:807:79: required from ‘bool boost::matching(const Graph&, MateMap, VertexIndexMap) [with Graph = R_adjacency_list; MateMap = long unsigned int*; VertexIndexMap = vec_adj_list_vertex_id_map, long unsigned int>; AugmentingPathFinder = edmonds_augmenting_path_finder; InitialMatchingFinder = extra_greedy_matching; MatchingVerifier = maximum_cardinality_matching_verifier]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/max_cardinality_matching.hpp:817:48: required from ‘bool boost::checked_edmonds_maximum_cardinality_matching(const Graph&, MateMap, VertexIndexMap) [with Graph = R_adjacency_list; MateMap = long unsigned int*; VertexIndexMap = vec_adj_list_vertex_id_map, long unsigned int>]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/max_cardinality_matching.hpp:824:56: required from ‘bool boost::checked_edmonds_maximum_cardinality_matching(const Graph&, MateMap) [with Graph = R_adjacency_list; MateMap = long unsigned int*]’ planar.cpp:686:60: required from here /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::Assignable, long unsigned int*, boost::vec_adj_list_vertex_id_map, long unsigned int> >::non_odd_vertex >, boost::vec_adj_list_vertex_id_map, long unsigned int>, int, int&> >, boost::filtered_graph, boost::keep_all, boost::maximum_cardinality_matching_verifier, long unsigned int*, boost::vec_adj_list_vertex_id_map, long unsigned int> >::non_odd_vertex >, boost::vec_adj_list_vertex_id_map, long unsigned int>, int, int&> > > >, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >, boost::property >*, std::vector > >, boost::property >, std::allocator > >, boost::property > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >]’ 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ^ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements, long unsigned int*, boost::vec_adj_list_vertex_id_map, long unsigned int> >::non_odd_vertex >, boost::vec_adj_list_vertex_id_map, long unsigned int>, int, int&> >, boost::filtered_graph, boost::keep_all, boost::maximum_cardinality_matching_verifier, long unsigned int*, boost::vec_adj_list_vertex_id_map, long unsigned int> >::non_odd_vertex >, boost::vec_adj_list_vertex_id_map, long unsigned int>, int, int&> > > >, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >, boost::property >*, std::vector > >, boost::property >, std::allocator > >, boost::property > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > > >]’: /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:233:5: required from ‘struct boost::EqualityComparable, long unsigned int*, boost::vec_adj_list_vertex_id_map, long unsigned int> >::non_odd_vertex >, boost::vec_adj_list_vertex_id_map, long unsigned int>, int, int&> >, boost::filtered_graph, boost::keep_all, boost::maximum_cardinality_matching_verifier, long unsigned int*, boost::vec_adj_list_vertex_id_map, long unsigned int> >::non_odd_vertex >, boost::vec_adj_list_vertex_id_map, long unsigned int>, int, int&> > > >, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >, boost::property >*, std::vector > >, boost::property >, std::allocator > >, boost::property > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:502:3: required from ‘struct boost::InputIterator, long unsigned int*, boost::vec_adj_list_vertex_id_map, long unsigned int> >::non_odd_vertex >, boost::vec_adj_list_vertex_id_map, long unsigned int>, int, int&> >, boost::filtered_graph, boost::keep_all, boost::maximum_cardinality_matching_verifier, long unsigned int*, boost::vec_adj_list_vertex_id_map, long unsigned int> >::non_odd_vertex >, boost::vec_adj_list_vertex_id_map, long unsigned int>, int, int&> > > >, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >, boost::property >*, std::vector > >, boost::property >, std::allocator > >, boost::property > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::InputIterator, long unsigned int*, boost::vec_adj_list_vertex_id_map, long unsigned int> >::non_odd_vertex >, boost::vec_adj_list_vertex_id_map, long unsigned int>, int, int&> >, boost::filtered_graph, boost::keep_all, boost::maximum_cardinality_matching_verifier, long unsigned int*, boost::vec_adj_list_vertex_id_map, long unsigned int> >::non_odd_vertex >, boost::vec_adj_list_vertex_id_map, long unsigned int>, int, int&> > > >, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >, boost::property >*, std::vector > >, boost::property >, std::allocator > >, boost::property > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied, long unsigned int*, boost::vec_adj_list_vertex_id_map, long unsigned int> >::non_odd_vertex >, boost::vec_adj_list_vertex_id_map, long unsigned int>, int, int&> >, boost::filtered_graph, boost::keep_all, boost::maximum_cardinality_matching_verifier, long unsigned int*, boost::vec_adj_list_vertex_id_map, long unsigned int> >::non_odd_vertex >, boost::vec_adj_list_vertex_id_map, long unsigned int>, int, int&> > > >, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >, boost::property >*, std::vector > >, boost::property >, std::allocator > >, boost::property > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > > >::value’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied, long unsigned int*, boost::vec_adj_list_vertex_id_map, long unsigned int> >::non_odd_vertex >, boost::vec_adj_list_vertex_id_map, long unsigned int>, int, int&> >, boost::filtered_graph, boost::keep_all, boost::maximum_cardinality_matching_verifier, long unsigned int*, boost::vec_adj_list_vertex_id_map, long unsigned int> >::non_odd_vertex >, boost::vec_adj_list_vertex_id_map, long unsigned int>, int, int&> > > >, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >, boost::property >*, std::vector > >, boost::property >, std::allocator > >, boost::property > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > > >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:72:8: [ skipping 9 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/depth_first_search.hpp:409:1: required from ‘typename boost::result_of(Param0, const typename boost::detail::convert_bgl_params_to_boost_parameter >::type&)>::type boost::depth_first_search(const Param0&, const bgl_named_params&) [with Param0 = filtered_graph, keep_all, maximum_cardinality_matching_verifier, long unsigned int*, vec_adj_list_vertex_id_map, long unsigned int> >::non_odd_vertex >, vec_adj_list_vertex_id_map, long unsigned int>, int, int&> > >; P = vec_adj_list_vertex_id_map, long unsigned int>; T = vertex_index_t; R = bgl_named_params, graph_visitor_t, no_property>; typename result_of(Param0, const typename detail::convert_bgl_params_to_boost_parameter >::type&)>::type = void; typename detail::convert_bgl_params_to_boost_parameter >::type = parameter::aux::arg_list, long unsigned int> >, parameter::aux::arg_list >, parameter::aux::empty_arg_list, std::integral_constant >, std::integral_constant >]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/max_cardinality_matching.hpp:779:27: required from ‘static bool boost::maximum_cardinality_matching_verifier::verify_matching(const Graph&, MateMap, VertexIndexMap) [with Graph = R_adjacency_list; MateMap = long unsigned int*; VertexIndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/max_cardinality_matching.hpp:807:79: required from ‘bool boost::matching(const Graph&, MateMap, VertexIndexMap) [with Graph = R_adjacency_list; MateMap = long unsigned int*; VertexIndexMap = vec_adj_list_vertex_id_map, long unsigned int>; AugmentingPathFinder = edmonds_augmenting_path_finder; InitialMatchingFinder = extra_greedy_matching; MatchingVerifier = maximum_cardinality_matching_verifier]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/max_cardinality_matching.hpp:817:48: required from ‘bool boost::checked_edmonds_maximum_cardinality_matching(const Graph&, MateMap, VertexIndexMap) [with Graph = R_adjacency_list; MateMap = long unsigned int*; VertexIndexMap = vec_adj_list_vertex_id_map, long unsigned int>]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/max_cardinality_matching.hpp:824:56: required from ‘bool boost::checked_edmonds_maximum_cardinality_matching(const Graph&, MateMap) [with Graph = R_adjacency_list; MateMap = long unsigned int*]’ planar.cpp:686:60: required from here /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::EqualityComparable, long unsigned int*, boost::vec_adj_list_vertex_id_map, long unsigned int> >::non_odd_vertex >, boost::vec_adj_list_vertex_id_map, long unsigned int>, int, int&> >, boost::filtered_graph, boost::keep_all, boost::maximum_cardinality_matching_verifier, long unsigned int*, boost::vec_adj_list_vertex_id_map, long unsigned int> >::non_odd_vertex >, boost::vec_adj_list_vertex_id_map, long unsigned int>, int, int&> > > >, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >, boost::property >*, std::vector > >, boost::property >, std::allocator > >, boost::property > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >]’ 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ^ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements, long unsigned int*, boost::vec_adj_list_vertex_id_map, long unsigned int> >::non_odd_vertex >, boost::vec_adj_list_vertex_id_map, long unsigned int>, int, int&> >, boost::filtered_graph, boost::keep_all, boost::maximum_cardinality_matching_verifier, long unsigned int*, boost::vec_adj_list_vertex_id_map, long unsigned int> >::non_odd_vertex >, boost::vec_adj_list_vertex_id_map, long unsigned int>, int, int&> > > >, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >, boost::property >*, std::vector > >, boost::property >, std::allocator > >, boost::property > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > > >]’: /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:512:7: required from ‘struct boost::InputIterator, long unsigned int*, boost::vec_adj_list_vertex_id_map, long unsigned int> >::non_odd_vertex >, boost::vec_adj_list_vertex_id_map, long unsigned int>, int, int&> >, boost::filtered_graph, boost::keep_all, boost::maximum_cardinality_matching_verifier, long unsigned int*, boost::vec_adj_list_vertex_id_map, long unsigned int> >::non_odd_vertex >, boost::vec_adj_list_vertex_id_map, long unsigned int>, int, int&> > > >, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >, boost::property >*, std::vector > >, boost::property >, std::allocator > >, boost::property > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::InputIterator, long unsigned int*, boost::vec_adj_list_vertex_id_map, long unsigned int> >::non_odd_vertex >, boost::vec_adj_list_vertex_id_map, long unsigned int>, int, int&> >, boost::filtered_graph, boost::keep_all, boost::maximum_cardinality_matching_verifier, long unsigned int*, boost::vec_adj_list_vertex_id_map, long unsigned int> >::non_odd_vertex >, boost::vec_adj_list_vertex_id_map, long unsigned int>, int, int&> > > >, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >, boost::property >*, std::vector > >, boost::property >, std::allocator > >, boost::property > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied, long unsigned int*, boost::vec_adj_list_vertex_id_map, long unsigned int> >::non_odd_vertex >, boost::vec_adj_list_vertex_id_map, long unsigned int>, int, int&> >, boost::filtered_graph, boost::keep_all, boost::maximum_cardinality_matching_verifier, long unsigned int*, boost::vec_adj_list_vertex_id_map, long unsigned int> >::non_odd_vertex >, boost::vec_adj_list_vertex_id_map, long unsigned int>, int, int&> > > >, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >, boost::property >*, std::vector > >, boost::property >, std::allocator > >, boost::property > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > > >::value’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied, long unsigned int*, boost::vec_adj_list_vertex_id_map, long unsigned int> >::non_odd_vertex >, boost::vec_adj_list_vertex_id_map, long unsigned int>, int, int&> >, boost::filtered_graph, boost::keep_all, boost::maximum_cardinality_matching_verifier, long unsigned int*, boost::vec_adj_list_vertex_id_map, long unsigned int> >::non_odd_vertex >, boost::vec_adj_list_vertex_id_map, long unsigned int>, int, int&> > > >, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >, boost::property >*, std::vector > >, boost::property >, std::allocator > >, boost::property > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > > >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_, long unsigned int*, boost::vec_adj_list_vertex_id_map, long unsigned int> >::non_odd_vertex >, boost::vec_adj_list_vertex_id_map, long unsigned int>, int, int&> >, boost::filtered_graph, boost::keep_all, boost::maximum_cardinality_matching_verifier, long unsigned int*, boost::vec_adj_list_vertex_id_map, long unsigned int> >::non_odd_vertex >, boost::vec_adj_list_vertex_id_map, long unsigned int>, int, int&> > > >, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >, boost::property >*, std::vector > >, boost::property >, std::allocator > >, boost::property > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >)>’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/graph_concepts.hpp:53:35: [ skipping 8 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/depth_first_search.hpp:409:1: required from ‘typename boost::result_of(Param0, const typename boost::detail::convert_bgl_params_to_boost_parameter >::type&)>::type boost::depth_first_search(const Param0&, const bgl_named_params&) [with Param0 = filtered_graph, keep_all, maximum_cardinality_matching_verifier, long unsigned int*, vec_adj_list_vertex_id_map, long unsigned int> >::non_odd_vertex >, vec_adj_list_vertex_id_map, long unsigned int>, int, int&> > >; P = vec_adj_list_vertex_id_map, long unsigned int>; T = vertex_index_t; R = bgl_named_params, graph_visitor_t, no_property>; typename result_of(Param0, const typename detail::convert_bgl_params_to_boost_parameter >::type&)>::type = void; typename detail::convert_bgl_params_to_boost_parameter >::type = parameter::aux::arg_list, long unsigned int> >, parameter::aux::arg_list >, parameter::aux::empty_arg_list, std::integral_constant >, std::integral_constant >]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/max_cardinality_matching.hpp:779:27: required from ‘static bool boost::maximum_cardinality_matching_verifier::verify_matching(const Graph&, MateMap, VertexIndexMap) [with Graph = R_adjacency_list; MateMap = long unsigned int*; VertexIndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/max_cardinality_matching.hpp:807:79: required from ‘bool boost::matching(const Graph&, MateMap, VertexIndexMap) [with Graph = R_adjacency_list; MateMap = long unsigned int*; VertexIndexMap = vec_adj_list_vertex_id_map, long unsigned int>; AugmentingPathFinder = edmonds_augmenting_path_finder; InitialMatchingFinder = extra_greedy_matching; MatchingVerifier = maximum_cardinality_matching_verifier]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/max_cardinality_matching.hpp:817:48: required from ‘bool boost::checked_edmonds_maximum_cardinality_matching(const Graph&, MateMap, VertexIndexMap) [with Graph = R_adjacency_list; MateMap = long unsigned int*; VertexIndexMap = vec_adj_list_vertex_id_map, long unsigned int>]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/max_cardinality_matching.hpp:824:56: required from ‘bool boost::checked_edmonds_maximum_cardinality_matching(const Graph&, MateMap) [with Graph = R_adjacency_list; MateMap = long unsigned int*]’ planar.cpp:686:60: required from here /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::InputIterator, long unsigned int*, boost::vec_adj_list_vertex_id_map, long unsigned int> >::non_odd_vertex >, boost::vec_adj_list_vertex_id_map, long unsigned int>, int, int&> >, boost::filtered_graph, boost::keep_all, boost::maximum_cardinality_matching_verifier, long unsigned int*, boost::vec_adj_list_vertex_id_map, long unsigned int> >::non_odd_vertex >, boost::vec_adj_list_vertex_id_map, long unsigned int>, int, int&> > > >, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >, boost::property >*, std::vector > >, boost::property >, std::allocator > >, boost::property > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >]’ 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ^ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::InputIterator, long unsigned int*, boost::vec_adj_list_vertex_id_map, long unsigned int> >::non_odd_vertex >, boost::vec_adj_list_vertex_id_map, long unsigned int>, int, int&> >, boost::filtered_graph, boost::keep_all, boost::maximum_cardinality_matching_verifier, long unsigned int*, boost::vec_adj_list_vertex_id_map, long unsigned int> >::non_odd_vertex >, boost::vec_adj_list_vertex_id_map, long unsigned int>, int, int&> > > >, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >, boost::property >*, std::vector > >, boost::property >, std::allocator > >, boost::property > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >]’: /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/graph_concepts.hpp:53:35: required from ‘boost::concepts::MultiPassInputIterator::~MultiPassInputIterator() [with T = boost::iterators::filter_iterator, long unsigned int*, boost::vec_adj_list_vertex_id_map, long unsigned int> >::non_odd_vertex >, boost::vec_adj_list_vertex_id_map, long unsigned int>, int, int&> >, boost::filtered_graph, boost::keep_all, boost::maximum_cardinality_matching_verifier, long unsigned int*, boost::vec_adj_list_vertex_id_map, long unsigned int> >::non_odd_vertex >, boost::vec_adj_list_vertex_id_map, long unsigned int>, int, int&> > > >, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >, boost::property >*, std::vector > >, boost::property >, std::allocator > >, boost::property > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> >]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::MultiPassInputIterator, long unsigned int*, boost::vec_adj_list_vertex_id_map, long unsigned int> >::non_odd_vertex >, boost::vec_adj_list_vertex_id_map, long unsigned int>, int, int&> >, boost::filtered_graph, boost::keep_all, boost::maximum_cardinality_matching_verifier, long unsigned int*, boost::vec_adj_list_vertex_id_map, long unsigned int> >::non_odd_vertex >, boost::vec_adj_list_vertex_id_map, long unsigned int>, int, int&> > > >, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >, boost::property >*, std::vector > >, boost::property >, std::allocator > >, boost::property > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/graph_concepts.hpp:89:9: required from ‘boost::concepts::IncidenceGraph::~IncidenceGraph() [with G = boost::filtered_graph, boost::keep_all, boost::maximum_cardinality_matching_verifier, long unsigned int*, boost::vec_adj_list_vertex_id_map, long unsigned int> >::non_odd_vertex >, boost::vec_adj_list_vertex_id_map, long unsigned int>, int, int&> > >]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/graph_concepts.hpp:75:1: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::IncidenceGraphConcept, boost::keep_all, boost::maximum_cardinality_matching_verifier, long unsigned int*, boost::vec_adj_list_vertex_id_map, long unsigned int> >::non_odd_vertex >, boost::vec_adj_list_vertex_id_map, long unsigned int>, int, int&> > > >]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/depth_first_search.hpp:129:9: required from ‘void boost::detail::depth_first_visit_impl(const IncidenceGraph&, typename boost::graph_traits::vertex_descriptor, DFSVisitor&, ColorMap, TerminatorFunc) [with IncidenceGraph = boost::filtered_graph, boost::keep_all, boost::maximum_cardinality_matching_verifier, long unsigned int*, boost::vec_adj_list_vertex_id_map, long unsigned int> >::non_odd_vertex >, boost::vec_adj_list_vertex_id_map, long unsigned int>, int, int&> > >; DFSVisitor = odd_components_counter; ColorMap = boost::shared_array_property_map, long unsigned int> >; TerminatorFunc = nontruth2; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/depth_first_search.hpp:286:39: [ skipping 3 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/depth_first_search.hpp:409:1: required from ‘typename boost::result_of(Param0, const typename boost::detail::convert_bgl_params_to_boost_parameter >::type&)>::type boost::depth_first_search(const Param0&, const bgl_named_params&) [with Param0 = filtered_graph, keep_all, maximum_cardinality_matching_verifier, long unsigned int*, vec_adj_list_vertex_id_map, long unsigned int> >::non_odd_vertex >, vec_adj_list_vertex_id_map, long unsigned int>, int, int&> > >; P = vec_adj_list_vertex_id_map, long unsigned int>; T = vertex_index_t; R = bgl_named_params, graph_visitor_t, no_property>; typename result_of(Param0, const typename detail::convert_bgl_params_to_boost_parameter >::type&)>::type = void; typename detail::convert_bgl_params_to_boost_parameter >::type = parameter::aux::arg_list, long unsigned int> >, parameter::aux::arg_list >, parameter::aux::empty_arg_list, std::integral_constant >, std::integral_constant >]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/max_cardinality_matching.hpp:779:27: required from ‘static bool boost::maximum_cardinality_matching_verifier::verify_matching(const Graph&, MateMap, VertexIndexMap) [with Graph = R_adjacency_list; MateMap = long unsigned int*; VertexIndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/max_cardinality_matching.hpp:807:79: required from ‘bool boost::matching(const Graph&, MateMap, VertexIndexMap) [with Graph = R_adjacency_list; MateMap = long unsigned int*; VertexIndexMap = vec_adj_list_vertex_id_map, long unsigned int>; AugmentingPathFinder = edmonds_augmenting_path_finder; InitialMatchingFinder = extra_greedy_matching; MatchingVerifier = maximum_cardinality_matching_verifier]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/max_cardinality_matching.hpp:817:48: required from ‘bool boost::checked_edmonds_maximum_cardinality_matching(const Graph&, MateMap, VertexIndexMap) [with Graph = R_adjacency_list; MateMap = long unsigned int*; VertexIndexMap = vec_adj_list_vertex_id_map, long unsigned int>]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/max_cardinality_matching.hpp:824:56: required from ‘bool boost::checked_edmonds_maximum_cardinality_matching(const Graph&, MateMap) [with Graph = R_adjacency_list; MateMap = long unsigned int*]’ planar.cpp:686:60: required from here /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::InputIterator::~InputIterator() [with TT = boost::iterators::filter_iterator, long unsigned int*, boost::vec_adj_list_vertex_id_map, long unsigned int> >::non_odd_vertex >, boost::vec_adj_list_vertex_id_map, long unsigned int>, int, int&> >, boost::filtered_graph, boost::keep_all, boost::maximum_cardinality_matching_verifier, long unsigned int*, boost::vec_adj_list_vertex_id_map, long unsigned int> >::non_odd_vertex >, boost::vec_adj_list_vertex_id_map, long unsigned int>, int, int&> > > >, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >, boost::property >*, std::vector > >, boost::property >, std::allocator > >, boost::property > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> >]’ 37 | ~model() | ^ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:512:7: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 512 | BOOST_CONCEPT_USAGE(InputIterator) | ^~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::Convertible, std::input_iterator_tag>]’: /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements, std::input_iterator_tag> >]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:208:5: required from ‘struct boost::Convertible, std::input_iterator_tag>’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::Convertible, std::input_iterator_tag>]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied, std::input_iterator_tag> >::value’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied, std::input_iterator_tag> >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:72:8: [ skipping 9 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/depth_first_search.hpp:397:42: required from ‘void boost::graph::detail::depth_first_search_impl::operator()(const Graph&, const ArgPack&) const [with ArgPack = boost::parameter::aux::arg_list >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&> > >, boost::parameter::aux::empty_arg_list, std::integral_constant >; Graph = boost::adjacency_list, boost::property >]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/depth_first_search.hpp:406:5: required from ‘typename boost::result_of(Param0, const ArgPack&)>::type boost::graph::depth_first_search_with_named_params(const Param0&, const ArgPack&) [with Param0 = boost::adjacency_list, boost::property >; ArgPack = boost::parameter::aux::arg_list >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&> > >, boost::parameter::aux::empty_arg_list, std::integral_constant >; typename boost::result_of(Param0, const ArgPack&)>::type = void]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/depth_first_search.hpp:409:1: required from ‘typename boost::result_of(Param0, const typename boost::detail::convert_bgl_params_to_boost_parameter >::type&)>::type boost::depth_first_search(const Param0&, const bgl_named_params&) [with Param0 = adjacency_list, property >; P = detail::components_recorder >, vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&> >; T = graph_visitor_t; R = no_property; typename result_of(Param0, const typename detail::convert_bgl_params_to_boost_parameter >::type&)>::type = void; typename detail::convert_bgl_params_to_boost_parameter >::type = parameter::aux::arg_list >, vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&> > >, parameter::aux::empty_arg_list, std::integral_constant >]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/connected_components.hpp:106:23: required from ‘typename boost::property_traits::value_type boost::connected_components(const Graph&, ComponentMap, typename enable_if_c::traversal_category>::value, graph::detail::no_parameter>::type) [with Graph = adjacency_list, property >; ComponentMap = iterator_property_map<__gnu_cxx::__normal_iterator >, vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>; typename property_traits::value_type = long unsigned int; typename enable_if_c::traversal_category>::value, graph::detail::no_parameter>::type = graph::detail::no_parameter; typename graph_traits::traversal_category = undir_adj_list_traversal_tag]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/make_connected.hpp:38:51: required from ‘void boost::make_connected(Graph&, VertexIndexMap, AddEdgeVisitor&) [with Graph = adjacency_list, property >; VertexIndexMap = vec_adj_list_vertex_id_map, long unsigned int>; AddEdgeVisitor = my_add_edge_visitor, property >, long unsigned int>]’ planar.cpp:211:26: required from here /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::Convertible::~Convertible() [with X = boost::iterators::detail::iterator_category_with_traversal; Y = std::input_iterator_tag]’ 37 | ~model() | ^ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:208:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 208 | BOOST_CONCEPT_USAGE(Convertible) { | ^~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::Assignable >, boost::no_property>*, std::vector >, boost::no_property>, std::allocator >, boost::no_property> > > >, long unsigned int, boost::detail::edge_desc_impl, long int> >]’: /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements >, boost::no_property>*, std::vector >, boost::no_property>, std::allocator >, boost::no_property> > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:145:5: required from ‘struct boost::Assignable >, boost::no_property>*, std::vector >, boost::no_property>, std::allocator >, boost::no_property> > > >, long unsigned int, boost::detail::edge_desc_impl, long int> >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:502:3: required from ‘struct boost::InputIterator >, boost::no_property>*, std::vector >, boost::no_property>, std::allocator >, boost::no_property> > > >, long unsigned int, boost::detail::edge_desc_impl, long int> >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::InputIterator >, boost::no_property>*, std::vector >, boost::no_property>, std::allocator >, boost::no_property> > > >, long unsigned int, boost::detail::edge_desc_impl, long int> >]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied >, boost::no_property>*, std::vector >, boost::no_property>, std::allocator >, boost::no_property> > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::value’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:45:51: [ skipping 10 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/isomorphism.hpp:651:42: required from ‘bool boost::graph::detail::isomorphism_impl::operator()(const Graph1&, const Graph2&, const ArgPack&) const [with ArgPack = boost::parameter::aux::empty_arg_list; Graph1 = boost::adjacency_list; Graph2 = boost::adjacency_list]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/isomorphism.hpp:662:5: required from ‘typename boost::result_of(Param0, Param1, const ArgPack&)>::type boost::graph::isomorphism_with_named_params(const Param0&, const Param1&, const ArgPack&) [with Param0 = boost::adjacency_list; Param1 = boost::adjacency_list; ArgPack = boost::parameter::aux::empty_arg_list; typename boost::result_of(Param0, Param1, const ArgPack&)>::type = bool]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/isomorphism.hpp:666:1: required from ‘typename boost::result_of(Param0, Param1, const boost::parameter::aux::empty_arg_list&)>::type boost::isomorphism(const Param0&, const Param1&) [with Param0 = adjacency_list; Param1 = adjacency_list; typename result_of(Param0, Param1, const parameter::aux::empty_arg_list&)>::type = bool]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/is_kuratowski_subgraph.hpp:278:34: required from ‘bool boost::is_kuratowski_subgraph(const Graph&, ForwardIterator, ForwardIterator, VertexIndexMap) [with Graph = adjacency_list, property >; ForwardIterator = __gnu_cxx::__normal_iterator*, std::vector > >; VertexIndexMap = vec_adj_list_vertex_id_map, long unsigned int>]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/is_kuratowski_subgraph.hpp:290:34: required from ‘bool boost::is_kuratowski_subgraph(const Graph&, ForwardIterator, ForwardIterator) [with Graph = adjacency_list, property >; ForwardIterator = __gnu_cxx::__normal_iterator*, std::vector > >]’ planar.cpp:435:37: required from here /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::Assignable::~Assignable() [with TT = boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator >, boost::no_property>*, std::vector >, boost::no_property>, std::allocator >, boost::no_property> > > >, long unsigned int, boost::detail::edge_desc_impl, long int>]’ 37 | ~model() | ^ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:145:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 145 | BOOST_CONCEPT_USAGE(Assignable) { | ^~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::EqualityComparable >, boost::no_property>*, std::vector >, boost::no_property>, std::allocator >, boost::no_property> > > >, long unsigned int, boost::detail::edge_desc_impl, long int> >]’: /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements >, boost::no_property>*, std::vector >, boost::no_property>, std::allocator >, boost::no_property> > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:233:5: required from ‘struct boost::EqualityComparable >, boost::no_property>*, std::vector >, boost::no_property>, std::allocator >, boost::no_property> > > >, long unsigned int, boost::detail::edge_desc_impl, long int> >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:502:3: required from ‘struct boost::InputIterator >, boost::no_property>*, std::vector >, boost::no_property>, std::allocator >, boost::no_property> > > >, long unsigned int, boost::detail::edge_desc_impl, long int> >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::InputIterator >, boost::no_property>*, std::vector >, boost::no_property>, std::allocator >, boost::no_property> > > >, long unsigned int, boost::detail::edge_desc_impl, long int> >]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied >, boost::no_property>*, std::vector >, boost::no_property>, std::allocator >, boost::no_property> > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::value’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:45:51: [ skipping 10 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/isomorphism.hpp:651:42: required from ‘bool boost::graph::detail::isomorphism_impl::operator()(const Graph1&, const Graph2&, const ArgPack&) const [with ArgPack = boost::parameter::aux::empty_arg_list; Graph1 = boost::adjacency_list; Graph2 = boost::adjacency_list]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/isomorphism.hpp:662:5: required from ‘typename boost::result_of(Param0, Param1, const ArgPack&)>::type boost::graph::isomorphism_with_named_params(const Param0&, const Param1&, const ArgPack&) [with Param0 = boost::adjacency_list; Param1 = boost::adjacency_list; ArgPack = boost::parameter::aux::empty_arg_list; typename boost::result_of(Param0, Param1, const ArgPack&)>::type = bool]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/isomorphism.hpp:666:1: required from ‘typename boost::result_of(Param0, Param1, const boost::parameter::aux::empty_arg_list&)>::type boost::isomorphism(const Param0&, const Param1&) [with Param0 = adjacency_list; Param1 = adjacency_list; typename result_of(Param0, Param1, const parameter::aux::empty_arg_list&)>::type = bool]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/is_kuratowski_subgraph.hpp:278:34: required from ‘bool boost::is_kuratowski_subgraph(const Graph&, ForwardIterator, ForwardIterator, VertexIndexMap) [with Graph = adjacency_list, property >; ForwardIterator = __gnu_cxx::__normal_iterator*, std::vector > >; VertexIndexMap = vec_adj_list_vertex_id_map, long unsigned int>]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/is_kuratowski_subgraph.hpp:290:34: required from ‘bool boost::is_kuratowski_subgraph(const Graph&, ForwardIterator, ForwardIterator) [with Graph = adjacency_list, property >; ForwardIterator = __gnu_cxx::__normal_iterator*, std::vector > >]’ planar.cpp:435:37: required from here /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::EqualityComparable::~EqualityComparable() [with TT = boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator >, boost::no_property>*, std::vector >, boost::no_property>, std::allocator >, boost::no_property> > > >, long unsigned int, boost::detail::edge_desc_impl, long int>]’ 37 | ~model() | ^ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:233:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 233 | BOOST_CONCEPT_USAGE(EqualityComparable) { | ^~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::InputIterator >, boost::no_property>*, std::vector >, boost::no_property>, std::allocator >, boost::no_property> > > >, long unsigned int, boost::detail::edge_desc_impl, long int> >]’: /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements >, boost::no_property>*, std::vector >, boost::no_property>, std::allocator >, boost::no_property> > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:512:7: required from ‘struct boost::InputIterator >, boost::no_property>*, std::vector >, boost::no_property>, std::allocator >, boost::no_property> > > >, long unsigned int, boost::detail::edge_desc_impl, long int> >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::InputIterator >, boost::no_property>*, std::vector >, boost::no_property>, std::allocator >, boost::no_property> > > >, long unsigned int, boost::detail::edge_desc_impl, long int> >]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied >, boost::no_property>*, std::vector >, boost::no_property>, std::allocator >, boost::no_property> > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::value’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied >, boost::no_property>*, std::vector >, boost::no_property>, std::allocator >, boost::no_property> > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:72:8: [ skipping 9 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/isomorphism.hpp:651:42: required from ‘bool boost::graph::detail::isomorphism_impl::operator()(const Graph1&, const Graph2&, const ArgPack&) const [with ArgPack = boost::parameter::aux::empty_arg_list; Graph1 = boost::adjacency_list; Graph2 = boost::adjacency_list]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/isomorphism.hpp:662:5: required from ‘typename boost::result_of(Param0, Param1, const ArgPack&)>::type boost::graph::isomorphism_with_named_params(const Param0&, const Param1&, const ArgPack&) [with Param0 = boost::adjacency_list; Param1 = boost::adjacency_list; ArgPack = boost::parameter::aux::empty_arg_list; typename boost::result_of(Param0, Param1, const ArgPack&)>::type = bool]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/isomorphism.hpp:666:1: required from ‘typename boost::result_of(Param0, Param1, const boost::parameter::aux::empty_arg_list&)>::type boost::isomorphism(const Param0&, const Param1&) [with Param0 = adjacency_list; Param1 = adjacency_list; typename result_of(Param0, Param1, const parameter::aux::empty_arg_list&)>::type = bool]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/is_kuratowski_subgraph.hpp:278:34: required from ‘bool boost::is_kuratowski_subgraph(const Graph&, ForwardIterator, ForwardIterator, VertexIndexMap) [with Graph = adjacency_list, property >; ForwardIterator = __gnu_cxx::__normal_iterator*, std::vector > >; VertexIndexMap = vec_adj_list_vertex_id_map, long unsigned int>]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/is_kuratowski_subgraph.hpp:290:34: required from ‘bool boost::is_kuratowski_subgraph(const Graph&, ForwardIterator, ForwardIterator) [with Graph = adjacency_list, property >; ForwardIterator = __gnu_cxx::__normal_iterator*, std::vector > >]’ planar.cpp:435:37: required from here /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::InputIterator::~InputIterator() [with TT = boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator >, boost::no_property>*, std::vector >, boost::no_property>, std::allocator >, boost::no_property> > > >, long unsigned int, boost::detail::edge_desc_impl, long int>]’ 37 | ~model() | ^ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:512:7: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 512 | BOOST_CONCEPT_USAGE(InputIterator) | ^~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::Assignable, long unsigned int*, boost::vec_adj_list_vertex_id_map, long unsigned int> >::non_odd_vertex >, boost::vec_adj_list_vertex_id_map, long unsigned int>, int, int&> >, boost::filtered_graph, boost::keep_all, boost::maximum_cardinality_matching_verifier, long unsigned int*, boost::vec_adj_list_vertex_id_map, long unsigned int> >::non_odd_vertex >, boost::vec_adj_list_vertex_id_map, long unsigned int>, int, int&> > > >, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >, boost::property >*, std::vector > >, boost::property >, std::allocator > >, boost::property > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >]’: /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements, long unsigned int*, boost::vec_adj_list_vertex_id_map, long unsigned int> >::non_odd_vertex >, boost::vec_adj_list_vertex_id_map, long unsigned int>, int, int&> >, boost::filtered_graph, boost::keep_all, boost::maximum_cardinality_matching_verifier, long unsigned int*, boost::vec_adj_list_vertex_id_map, long unsigned int> >::non_odd_vertex >, boost::vec_adj_list_vertex_id_map, long unsigned int>, int, int&> > > >, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >, boost::property >*, std::vector > >, boost::property >, std::allocator > >, boost::property > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > > >]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:145:5: required from ‘struct boost::Assignable, long unsigned int*, boost::vec_adj_list_vertex_id_map, long unsigned int> >::non_odd_vertex >, boost::vec_adj_list_vertex_id_map, long unsigned int>, int, int&> >, boost::filtered_graph, boost::keep_all, boost::maximum_cardinality_matching_verifier, long unsigned int*, boost::vec_adj_list_vertex_id_map, long unsigned int> >::non_odd_vertex >, boost::vec_adj_list_vertex_id_map, long unsigned int>, int, int&> > > >, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >, boost::property >*, std::vector > >, boost::property >, std::allocator > >, boost::property > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:502:3: required from ‘struct boost::InputIterator, long unsigned int*, boost::vec_adj_list_vertex_id_map, long unsigned int> >::non_odd_vertex >, boost::vec_adj_list_vertex_id_map, long unsigned int>, int, int&> >, boost::filtered_graph, boost::keep_all, boost::maximum_cardinality_matching_verifier, long unsigned int*, boost::vec_adj_list_vertex_id_map, long unsigned int> >::non_odd_vertex >, boost::vec_adj_list_vertex_id_map, long unsigned int>, int, int&> > > >, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >, boost::property >*, std::vector > >, boost::property >, std::allocator > >, boost::property > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::InputIterator, long unsigned int*, boost::vec_adj_list_vertex_id_map, long unsigned int> >::non_odd_vertex >, boost::vec_adj_list_vertex_id_map, long unsigned int>, int, int&> >, boost::filtered_graph, boost::keep_all, boost::maximum_cardinality_matching_verifier, long unsigned int*, boost::vec_adj_list_vertex_id_map, long unsigned int> >::non_odd_vertex >, boost::vec_adj_list_vertex_id_map, long unsigned int>, int, int&> > > >, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >, boost::property >*, std::vector > >, boost::property >, std::allocator > >, boost::property > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied, long unsigned int*, boost::vec_adj_list_vertex_id_map, long unsigned int> >::non_odd_vertex >, boost::vec_adj_list_vertex_id_map, long unsigned int>, int, int&> >, boost::filtered_graph, boost::keep_all, boost::maximum_cardinality_matching_verifier, long unsigned int*, boost::vec_adj_list_vertex_id_map, long unsigned int> >::non_odd_vertex >, boost::vec_adj_list_vertex_id_map, long unsigned int>, int, int&> > > >, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >, boost::property >*, std::vector > >, boost::property >, std::allocator > >, boost::property > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > > >::value’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:45:51: [ skipping 10 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/depth_first_search.hpp:409:1: required from ‘typename boost::result_of(Param0, const typename boost::detail::convert_bgl_params_to_boost_parameter >::type&)>::type boost::depth_first_search(const Param0&, const bgl_named_params&) [with Param0 = filtered_graph, keep_all, maximum_cardinality_matching_verifier, long unsigned int*, vec_adj_list_vertex_id_map, long unsigned int> >::non_odd_vertex >, vec_adj_list_vertex_id_map, long unsigned int>, int, int&> > >; P = vec_adj_list_vertex_id_map, long unsigned int>; T = vertex_index_t; R = bgl_named_params, graph_visitor_t, no_property>; typename result_of(Param0, const typename detail::convert_bgl_params_to_boost_parameter >::type&)>::type = void; typename detail::convert_bgl_params_to_boost_parameter >::type = parameter::aux::arg_list, long unsigned int> >, parameter::aux::arg_list >, parameter::aux::empty_arg_list, std::integral_constant >, std::integral_constant >]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/max_cardinality_matching.hpp:779:27: required from ‘static bool boost::maximum_cardinality_matching_verifier::verify_matching(const Graph&, MateMap, VertexIndexMap) [with Graph = R_adjacency_list; MateMap = long unsigned int*; VertexIndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/max_cardinality_matching.hpp:807:79: required from ‘bool boost::matching(const Graph&, MateMap, VertexIndexMap) [with Graph = R_adjacency_list; MateMap = long unsigned int*; VertexIndexMap = vec_adj_list_vertex_id_map, long unsigned int>; AugmentingPathFinder = edmonds_augmenting_path_finder; InitialMatchingFinder = extra_greedy_matching; MatchingVerifier = maximum_cardinality_matching_verifier]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/max_cardinality_matching.hpp:817:48: required from ‘bool boost::checked_edmonds_maximum_cardinality_matching(const Graph&, MateMap, VertexIndexMap) [with Graph = R_adjacency_list; MateMap = long unsigned int*; VertexIndexMap = vec_adj_list_vertex_id_map, long unsigned int>]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/max_cardinality_matching.hpp:824:56: required from ‘bool boost::checked_edmonds_maximum_cardinality_matching(const Graph&, MateMap) [with Graph = R_adjacency_list; MateMap = long unsigned int*]’ planar.cpp:686:60: required from here /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::Assignable::~Assignable() [with TT = boost::iterators::filter_iterator, long unsigned int*, boost::vec_adj_list_vertex_id_map, long unsigned int> >::non_odd_vertex >, boost::vec_adj_list_vertex_id_map, long unsigned int>, int, int&> >, boost::filtered_graph, boost::keep_all, boost::maximum_cardinality_matching_verifier, long unsigned int*, boost::vec_adj_list_vertex_id_map, long unsigned int> >::non_odd_vertex >, boost::vec_adj_list_vertex_id_map, long unsigned int>, int, int&> > > >, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >, boost::property >*, std::vector > >, boost::property >, std::allocator > >, boost::property > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> >]’ 37 | ~model() | ^ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:145:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 145 | BOOST_CONCEPT_USAGE(Assignable) { | ^~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::EqualityComparable, long unsigned int*, boost::vec_adj_list_vertex_id_map, long unsigned int> >::non_odd_vertex >, boost::vec_adj_list_vertex_id_map, long unsigned int>, int, int&> >, boost::filtered_graph, boost::keep_all, boost::maximum_cardinality_matching_verifier, long unsigned int*, boost::vec_adj_list_vertex_id_map, long unsigned int> >::non_odd_vertex >, boost::vec_adj_list_vertex_id_map, long unsigned int>, int, int&> > > >, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >, boost::property >*, std::vector > >, boost::property >, std::allocator > >, boost::property > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >]’: /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements, long unsigned int*, boost::vec_adj_list_vertex_id_map, long unsigned int> >::non_odd_vertex >, boost::vec_adj_list_vertex_id_map, long unsigned int>, int, int&> >, boost::filtered_graph, boost::keep_all, boost::maximum_cardinality_matching_verifier, long unsigned int*, boost::vec_adj_list_vertex_id_map, long unsigned int> >::non_odd_vertex >, boost::vec_adj_list_vertex_id_map, long unsigned int>, int, int&> > > >, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >, boost::property >*, std::vector > >, boost::property >, std::allocator > >, boost::property > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > > >]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:233:5: required from ‘struct boost::EqualityComparable, long unsigned int*, boost::vec_adj_list_vertex_id_map, long unsigned int> >::non_odd_vertex >, boost::vec_adj_list_vertex_id_map, long unsigned int>, int, int&> >, boost::filtered_graph, boost::keep_all, boost::maximum_cardinality_matching_verifier, long unsigned int*, boost::vec_adj_list_vertex_id_map, long unsigned int> >::non_odd_vertex >, boost::vec_adj_list_vertex_id_map, long unsigned int>, int, int&> > > >, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >, boost::property >*, std::vector > >, boost::property >, std::allocator > >, boost::property > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:502:3: required from ‘struct boost::InputIterator, long unsigned int*, boost::vec_adj_list_vertex_id_map, long unsigned int> >::non_odd_vertex >, boost::vec_adj_list_vertex_id_map, long unsigned int>, int, int&> >, boost::filtered_graph, boost::keep_all, boost::maximum_cardinality_matching_verifier, long unsigned int*, boost::vec_adj_list_vertex_id_map, long unsigned int> >::non_odd_vertex >, boost::vec_adj_list_vertex_id_map, long unsigned int>, int, int&> > > >, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >, boost::property >*, std::vector > >, boost::property >, std::allocator > >, boost::property > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::InputIterator, long unsigned int*, boost::vec_adj_list_vertex_id_map, long unsigned int> >::non_odd_vertex >, boost::vec_adj_list_vertex_id_map, long unsigned int>, int, int&> >, boost::filtered_graph, boost::keep_all, boost::maximum_cardinality_matching_verifier, long unsigned int*, boost::vec_adj_list_vertex_id_map, long unsigned int> >::non_odd_vertex >, boost::vec_adj_list_vertex_id_map, long unsigned int>, int, int&> > > >, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >, boost::property >*, std::vector > >, boost::property >, std::allocator > >, boost::property > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied, long unsigned int*, boost::vec_adj_list_vertex_id_map, long unsigned int> >::non_odd_vertex >, boost::vec_adj_list_vertex_id_map, long unsigned int>, int, int&> >, boost::filtered_graph, boost::keep_all, boost::maximum_cardinality_matching_verifier, long unsigned int*, boost::vec_adj_list_vertex_id_map, long unsigned int> >::non_odd_vertex >, boost::vec_adj_list_vertex_id_map, long unsigned int>, int, int&> > > >, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >, boost::property >*, std::vector > >, boost::property >, std::allocator > >, boost::property > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > > >::value’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:45:51: [ skipping 10 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/depth_first_search.hpp:409:1: required from ‘typename boost::result_of(Param0, const typename boost::detail::convert_bgl_params_to_boost_parameter >::type&)>::type boost::depth_first_search(const Param0&, const bgl_named_params&) [with Param0 = filtered_graph, keep_all, maximum_cardinality_matching_verifier, long unsigned int*, vec_adj_list_vertex_id_map, long unsigned int> >::non_odd_vertex >, vec_adj_list_vertex_id_map, long unsigned int>, int, int&> > >; P = vec_adj_list_vertex_id_map, long unsigned int>; T = vertex_index_t; R = bgl_named_params, graph_visitor_t, no_property>; typename result_of(Param0, const typename detail::convert_bgl_params_to_boost_parameter >::type&)>::type = void; typename detail::convert_bgl_params_to_boost_parameter >::type = parameter::aux::arg_list, long unsigned int> >, parameter::aux::arg_list >, parameter::aux::empty_arg_list, std::integral_constant >, std::integral_constant >]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/max_cardinality_matching.hpp:779:27: required from ‘static bool boost::maximum_cardinality_matching_verifier::verify_matching(const Graph&, MateMap, VertexIndexMap) [with Graph = R_adjacency_list; MateMap = long unsigned int*; VertexIndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/max_cardinality_matching.hpp:807:79: required from ‘bool boost::matching(const Graph&, MateMap, VertexIndexMap) [with Graph = R_adjacency_list; MateMap = long unsigned int*; VertexIndexMap = vec_adj_list_vertex_id_map, long unsigned int>; AugmentingPathFinder = edmonds_augmenting_path_finder; InitialMatchingFinder = extra_greedy_matching; MatchingVerifier = maximum_cardinality_matching_verifier]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/max_cardinality_matching.hpp:817:48: required from ‘bool boost::checked_edmonds_maximum_cardinality_matching(const Graph&, MateMap, VertexIndexMap) [with Graph = R_adjacency_list; MateMap = long unsigned int*; VertexIndexMap = vec_adj_list_vertex_id_map, long unsigned int>]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/max_cardinality_matching.hpp:824:56: required from ‘bool boost::checked_edmonds_maximum_cardinality_matching(const Graph&, MateMap) [with Graph = R_adjacency_list; MateMap = long unsigned int*]’ planar.cpp:686:60: required from here /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::EqualityComparable::~EqualityComparable() [with TT = boost::iterators::filter_iterator, long unsigned int*, boost::vec_adj_list_vertex_id_map, long unsigned int> >::non_odd_vertex >, boost::vec_adj_list_vertex_id_map, long unsigned int>, int, int&> >, boost::filtered_graph, boost::keep_all, boost::maximum_cardinality_matching_verifier, long unsigned int*, boost::vec_adj_list_vertex_id_map, long unsigned int> >::non_odd_vertex >, boost::vec_adj_list_vertex_id_map, long unsigned int>, int, int&> > > >, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >, boost::property >*, std::vector > >, boost::property >, std::allocator > >, boost::property > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> >]’ 37 | ~model() | ^ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:233:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 233 | BOOST_CONCEPT_USAGE(EqualityComparable) { | ^~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::InputIterator, long unsigned int*, boost::vec_adj_list_vertex_id_map, long unsigned int> >::non_odd_vertex >, boost::vec_adj_list_vertex_id_map, long unsigned int>, int, int&> >, boost::filtered_graph, boost::keep_all, boost::maximum_cardinality_matching_verifier, long unsigned int*, boost::vec_adj_list_vertex_id_map, long unsigned int> >::non_odd_vertex >, boost::vec_adj_list_vertex_id_map, long unsigned int>, int, int&> > > >, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >, boost::property >*, std::vector > >, boost::property >, std::allocator > >, boost::property > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >]’: /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements, long unsigned int*, boost::vec_adj_list_vertex_id_map, long unsigned int> >::non_odd_vertex >, boost::vec_adj_list_vertex_id_map, long unsigned int>, int, int&> >, boost::filtered_graph, boost::keep_all, boost::maximum_cardinality_matching_verifier, long unsigned int*, boost::vec_adj_list_vertex_id_map, long unsigned int> >::non_odd_vertex >, boost::vec_adj_list_vertex_id_map, long unsigned int>, int, int&> > > >, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >, boost::property >*, std::vector > >, boost::property >, std::allocator > >, boost::property > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > > >]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:512:7: required from ‘struct boost::InputIterator, long unsigned int*, boost::vec_adj_list_vertex_id_map, long unsigned int> >::non_odd_vertex >, boost::vec_adj_list_vertex_id_map, long unsigned int>, int, int&> >, boost::filtered_graph, boost::keep_all, boost::maximum_cardinality_matching_verifier, long unsigned int*, boost::vec_adj_list_vertex_id_map, long unsigned int> >::non_odd_vertex >, boost::vec_adj_list_vertex_id_map, long unsigned int>, int, int&> > > >, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >, boost::property >*, std::vector > >, boost::property >, std::allocator > >, boost::property > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::InputIterator, long unsigned int*, boost::vec_adj_list_vertex_id_map, long unsigned int> >::non_odd_vertex >, boost::vec_adj_list_vertex_id_map, long unsigned int>, int, int&> >, boost::filtered_graph, boost::keep_all, boost::maximum_cardinality_matching_verifier, long unsigned int*, boost::vec_adj_list_vertex_id_map, long unsigned int> >::non_odd_vertex >, boost::vec_adj_list_vertex_id_map, long unsigned int>, int, int&> > > >, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >, boost::property >*, std::vector > >, boost::property >, std::allocator > >, boost::property > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied, long unsigned int*, boost::vec_adj_list_vertex_id_map, long unsigned int> >::non_odd_vertex >, boost::vec_adj_list_vertex_id_map, long unsigned int>, int, int&> >, boost::filtered_graph, boost::keep_all, boost::maximum_cardinality_matching_verifier, long unsigned int*, boost::vec_adj_list_vertex_id_map, long unsigned int> >::non_odd_vertex >, boost::vec_adj_list_vertex_id_map, long unsigned int>, int, int&> > > >, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >, boost::property >*, std::vector > >, boost::property >, std::allocator > >, boost::property > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > > >::value’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied, long unsigned int*, boost::vec_adj_list_vertex_id_map, long unsigned int> >::non_odd_vertex >, boost::vec_adj_list_vertex_id_map, long unsigned int>, int, int&> >, boost::filtered_graph, boost::keep_all, boost::maximum_cardinality_matching_verifier, long unsigned int*, boost::vec_adj_list_vertex_id_map, long unsigned int> >::non_odd_vertex >, boost::vec_adj_list_vertex_id_map, long unsigned int>, int, int&> > > >, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >, boost::property >*, std::vector > >, boost::property >, std::allocator > >, boost::property > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > > >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:72:8: [ skipping 9 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/depth_first_search.hpp:409:1: required from ‘typename boost::result_of(Param0, const typename boost::detail::convert_bgl_params_to_boost_parameter >::type&)>::type boost::depth_first_search(const Param0&, const bgl_named_params&) [with Param0 = filtered_graph, keep_all, maximum_cardinality_matching_verifier, long unsigned int*, vec_adj_list_vertex_id_map, long unsigned int> >::non_odd_vertex >, vec_adj_list_vertex_id_map, long unsigned int>, int, int&> > >; P = vec_adj_list_vertex_id_map, long unsigned int>; T = vertex_index_t; R = bgl_named_params, graph_visitor_t, no_property>; typename result_of(Param0, const typename detail::convert_bgl_params_to_boost_parameter >::type&)>::type = void; typename detail::convert_bgl_params_to_boost_parameter >::type = parameter::aux::arg_list, long unsigned int> >, parameter::aux::arg_list >, parameter::aux::empty_arg_list, std::integral_constant >, std::integral_constant >]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/max_cardinality_matching.hpp:779:27: required from ‘static bool boost::maximum_cardinality_matching_verifier::verify_matching(const Graph&, MateMap, VertexIndexMap) [with Graph = R_adjacency_list; MateMap = long unsigned int*; VertexIndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/max_cardinality_matching.hpp:807:79: required from ‘bool boost::matching(const Graph&, MateMap, VertexIndexMap) [with Graph = R_adjacency_list; MateMap = long unsigned int*; VertexIndexMap = vec_adj_list_vertex_id_map, long unsigned int>; AugmentingPathFinder = edmonds_augmenting_path_finder; InitialMatchingFinder = extra_greedy_matching; MatchingVerifier = maximum_cardinality_matching_verifier]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/max_cardinality_matching.hpp:817:48: required from ‘bool boost::checked_edmonds_maximum_cardinality_matching(const Graph&, MateMap, VertexIndexMap) [with Graph = R_adjacency_list; MateMap = long unsigned int*; VertexIndexMap = vec_adj_list_vertex_id_map, long unsigned int>]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/max_cardinality_matching.hpp:824:56: required from ‘bool boost::checked_edmonds_maximum_cardinality_matching(const Graph&, MateMap) [with Graph = R_adjacency_list; MateMap = long unsigned int*]’ planar.cpp:686:60: required from here /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::InputIterator::~InputIterator() [with TT = boost::iterators::filter_iterator, long unsigned int*, boost::vec_adj_list_vertex_id_map, long unsigned int> >::non_odd_vertex >, boost::vec_adj_list_vertex_id_map, long unsigned int>, int, int&> >, boost::filtered_graph, boost::keep_all, boost::maximum_cardinality_matching_verifier, long unsigned int*, boost::vec_adj_list_vertex_id_map, long unsigned int> >::non_odd_vertex >, boost::vec_adj_list_vertex_id_map, long unsigned int>, int, int&> > > >, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >, boost::property >*, std::vector > >, boost::property >, std::allocator > >, boost::property > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> >]’ 37 | ~model() | ^ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:512:7: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 512 | BOOST_CONCEPT_USAGE(InputIterator) | ^~~~~~~~~~~~~~~~~~~ g++ -std=gnu++17 -I"/usr/share/R/include" -DNDEBUG -I'/home/omnipath/local/R/4.4-3.20/BH/include' -fpic -g -O2 -fno-omit-frame-pointer -mno-omit-leaf-frame-pointer -ffile-prefix-map=/build/r-base-EawLoD/r-base-4.4.1=. -fstack-protector-strong -fstack-clash-protection -Wformat -Werror=format-security -fcf-protection -fdebug-prefix-map=/build/r-base-EawLoD/r-base-4.4.1=/usr/src/r-base-4.4.1-1.2404.0 -Wdate-time -D_FORTIFY_SOURCE=3 -c registerSigHandlers.cpp -o registerSigHandlers.o In file included from /home/omnipath/local/R/4.4-3.20/BH/include/boost/smart_ptr/shared_ptr.hpp:18, from /home/omnipath/local/R/4.4-3.20/BH/include/boost/property_map/vector_property_map.hpp:14, from /home/omnipath/local/R/4.4-3.20/BH/include/boost/property_map/property_map.hpp:598, from RBGL.hpp:17, from registerSigHandlers.cpp:1: /home/omnipath/local/R/4.4-3.20/BH/include/boost/smart_ptr/detail/shared_count.hpp:361:33: warning: ‘template class std::auto_ptr’ is deprecated: use 'std::unique_ptr' instead [-Wdeprecated-declarations] 361 | explicit shared_count( std::auto_ptr & r ): pi_( new sp_counted_impl_p( r.get() ) ) | ^~~~~~~~ In file included from /usr/include/c++/13/memory:78, from /home/omnipath/local/R/4.4-3.20/BH/include/boost/smart_ptr/detail/sp_counted_impl.hpp:35, from /home/omnipath/local/R/4.4-3.20/BH/include/boost/smart_ptr/detail/shared_count.hpp:27: /usr/include/c++/13/bits/unique_ptr.h:65:28: note: declared here 65 | template class auto_ptr; | ^~~~~~~~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/smart_ptr/shared_ptr.hpp:251:65: warning: ‘template class std::auto_ptr’ is deprecated: use 'std::unique_ptr' instead [-Wdeprecated-declarations] 251 | template< class T, class R > struct sp_enable_if_auto_ptr< std::auto_ptr< T >, R > | ^~~~~~~~ /usr/include/c++/13/bits/unique_ptr.h:65:28: note: declared here 65 | template class auto_ptr; | ^~~~~~~~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/smart_ptr/shared_ptr.hpp:508:31: warning: ‘template class std::auto_ptr’ is deprecated: use 'std::unique_ptr' instead [-Wdeprecated-declarations] 508 | explicit shared_ptr( std::auto_ptr & r ): px(r.get()), pn() | ^~~~~~~~ /usr/include/c++/13/bits/unique_ptr.h:65:28: note: declared here 65 | template class auto_ptr; | ^~~~~~~~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/smart_ptr/shared_ptr.hpp:521:22: warning: ‘template class std::auto_ptr’ is deprecated: use 'std::unique_ptr' instead [-Wdeprecated-declarations] 521 | shared_ptr( std::auto_ptr && r ): px(r.get()), pn() | ^~~~~~~~ /usr/include/c++/13/bits/unique_ptr.h:65:28: note: declared here 65 | template class auto_ptr; | ^~~~~~~~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/smart_ptr/shared_ptr.hpp:604:34: warning: ‘template class std::auto_ptr’ is deprecated: use 'std::unique_ptr' instead [-Wdeprecated-declarations] 604 | shared_ptr & operator=( std::auto_ptr & r ) | ^~~~~~~~ /usr/include/c++/13/bits/unique_ptr.h:65:28: note: declared here 65 | template class auto_ptr; | ^~~~~~~~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/smart_ptr/shared_ptr.hpp:613:34: warning: ‘template class std::auto_ptr’ is deprecated: use 'std::unique_ptr' instead [-Wdeprecated-declarations] 613 | shared_ptr & operator=( std::auto_ptr && r ) | ^~~~~~~~ /usr/include/c++/13/bits/unique_ptr.h:65:28: note: declared here 65 | template class auto_ptr; | ^~~~~~~~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/smart_ptr/shared_ptr.hpp: In member function ‘boost::shared_ptr& boost::shared_ptr::operator=(std::auto_ptr<_Up>&&)’: /home/omnipath/local/R/4.4-3.20/BH/include/boost/smart_ptr/shared_ptr.hpp:615:38: warning: ‘template class std::auto_ptr’ is deprecated: use 'std::unique_ptr' instead [-Wdeprecated-declarations] 615 | this_type( static_cast< std::auto_ptr && >( r ) ).swap( *this ); | ^~~~~~~~ /usr/include/c++/13/bits/unique_ptr.h:65:28: note: declared here 65 | template class auto_ptr; | ^~~~~~~~ In file included from /home/omnipath/local/R/4.4-3.20/BH/include/boost/scoped_ptr.hpp:13, from /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/adjacency_list.hpp:22, from RBGL.hpp:38: /home/omnipath/local/R/4.4-3.20/BH/include/boost/smart_ptr/scoped_ptr.hpp: At global scope: /home/omnipath/local/R/4.4-3.20/BH/include/boost/smart_ptr/scoped_ptr.hpp:75:31: warning: ‘template class std::auto_ptr’ is deprecated: use 'std::unique_ptr' instead [-Wdeprecated-declarations] 75 | explicit scoped_ptr( std::auto_ptr p ) BOOST_SP_NOEXCEPT : px( p.release() ) | ^~~~~~~~ /usr/include/c++/13/bits/unique_ptr.h:65:28: note: declared here 65 | template class auto_ptr; | ^~~~~~~~ g++ -std=gnu++17 -I"/usr/share/R/include" -DNDEBUG -I'/home/omnipath/local/R/4.4-3.20/BH/include' -fpic -g -O2 -fno-omit-frame-pointer -mno-omit-leaf-frame-pointer -ffile-prefix-map=/build/r-base-EawLoD/r-base-4.4.1=. -fstack-protector-strong -fstack-clash-protection -Wformat -Werror=format-security -fcf-protection -fdebug-prefix-map=/build/r-base-EawLoD/r-base-4.4.1=/usr/src/r-base-4.4.1-1.2404.0 -Wdate-time -D_FORTIFY_SOURCE=3 -c shortestPath.cpp -o shortestPath.o In file included from /home/omnipath/local/R/4.4-3.20/BH/include/boost/smart_ptr/shared_ptr.hpp:18, from /home/omnipath/local/R/4.4-3.20/BH/include/boost/property_map/vector_property_map.hpp:14, from /home/omnipath/local/R/4.4-3.20/BH/include/boost/property_map/property_map.hpp:598, from RBGL.hpp:17, from shortestPath.cpp:1: /home/omnipath/local/R/4.4-3.20/BH/include/boost/smart_ptr/detail/shared_count.hpp:361:33: warning: ‘template class std::auto_ptr’ is deprecated: use 'std::unique_ptr' instead [-Wdeprecated-declarations] 361 | explicit shared_count( std::auto_ptr & r ): pi_( new sp_counted_impl_p( r.get() ) ) | ^~~~~~~~ In file included from /usr/include/c++/13/memory:78, from /home/omnipath/local/R/4.4-3.20/BH/include/boost/smart_ptr/detail/sp_counted_impl.hpp:35, from /home/omnipath/local/R/4.4-3.20/BH/include/boost/smart_ptr/detail/shared_count.hpp:27: /usr/include/c++/13/bits/unique_ptr.h:65:28: note: declared here 65 | template class auto_ptr; | ^~~~~~~~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/smart_ptr/shared_ptr.hpp:251:65: warning: ‘template class std::auto_ptr’ is deprecated: use 'std::unique_ptr' instead [-Wdeprecated-declarations] 251 | template< class T, class R > struct sp_enable_if_auto_ptr< std::auto_ptr< T >, R > | ^~~~~~~~ /usr/include/c++/13/bits/unique_ptr.h:65:28: note: declared here 65 | template class auto_ptr; | ^~~~~~~~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/smart_ptr/shared_ptr.hpp:508:31: warning: ‘template class std::auto_ptr’ is deprecated: use 'std::unique_ptr' instead [-Wdeprecated-declarations] 508 | explicit shared_ptr( std::auto_ptr & r ): px(r.get()), pn() | ^~~~~~~~ /usr/include/c++/13/bits/unique_ptr.h:65:28: note: declared here 65 | template class auto_ptr; | ^~~~~~~~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/smart_ptr/shared_ptr.hpp:521:22: warning: ‘template class std::auto_ptr’ is deprecated: use 'std::unique_ptr' instead [-Wdeprecated-declarations] 521 | shared_ptr( std::auto_ptr && r ): px(r.get()), pn() | ^~~~~~~~ /usr/include/c++/13/bits/unique_ptr.h:65:28: note: declared here 65 | template class auto_ptr; | ^~~~~~~~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/smart_ptr/shared_ptr.hpp:604:34: warning: ‘template class std::auto_ptr’ is deprecated: use 'std::unique_ptr' instead [-Wdeprecated-declarations] 604 | shared_ptr & operator=( std::auto_ptr & r ) | ^~~~~~~~ /usr/include/c++/13/bits/unique_ptr.h:65:28: note: declared here 65 | template class auto_ptr; | ^~~~~~~~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/smart_ptr/shared_ptr.hpp:613:34: warning: ‘template class std::auto_ptr’ is deprecated: use 'std::unique_ptr' instead [-Wdeprecated-declarations] 613 | shared_ptr & operator=( std::auto_ptr && r ) | ^~~~~~~~ /usr/include/c++/13/bits/unique_ptr.h:65:28: note: declared here 65 | template class auto_ptr; | ^~~~~~~~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/smart_ptr/shared_ptr.hpp: In member function ‘boost::shared_ptr& boost::shared_ptr::operator=(std::auto_ptr<_Up>&&)’: /home/omnipath/local/R/4.4-3.20/BH/include/boost/smart_ptr/shared_ptr.hpp:615:38: warning: ‘template class std::auto_ptr’ is deprecated: use 'std::unique_ptr' instead [-Wdeprecated-declarations] 615 | this_type( static_cast< std::auto_ptr && >( r ) ).swap( *this ); | ^~~~~~~~ /usr/include/c++/13/bits/unique_ptr.h:65:28: note: declared here 65 | template class auto_ptr; | ^~~~~~~~ In file included from /home/omnipath/local/R/4.4-3.20/BH/include/boost/scoped_ptr.hpp:13, from /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/adjacency_list.hpp:22, from RBGL.hpp:38: /home/omnipath/local/R/4.4-3.20/BH/include/boost/smart_ptr/scoped_ptr.hpp: At global scope: /home/omnipath/local/R/4.4-3.20/BH/include/boost/smart_ptr/scoped_ptr.hpp:75:31: warning: ‘template class std::auto_ptr’ is deprecated: use 'std::unique_ptr' instead [-Wdeprecated-declarations] 75 | explicit scoped_ptr( std::auto_ptr p ) BOOST_SP_NOEXCEPT : px( p.release() ) | ^~~~~~~~ /usr/include/c++/13/bits/unique_ptr.h:65:28: note: declared here 65 | template class auto_ptr; | ^~~~~~~~ In file included from /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/assert.hpp:35, from /home/omnipath/local/R/4.4-3.20/BH/include/boost/property_map/property_map.hpp:19: /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements > > >]’: /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:145:5: required from ‘struct boost::Assignable<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:502:3: required from ‘struct boost::InputIterator<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:540:3: required from ‘struct boost::ForwardIterator<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:568:3: required from ‘struct boost::BidirectionalIterator<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:597:3: required from ‘struct boost::RandomAccessIterator<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:597:3: [ skipping 3 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied > > >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_ > >)>’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/property_map/property_map.hpp:354:5: required from ‘boost::iterator_property_map boost::make_iterator_property_map(RAIter, ID, Value) [with RAIter = __gnu_cxx::__normal_iterator >; Value = double; ID = vec_adj_list_vertex_id_map, long unsigned int>]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/dijkstra_shortest_paths.hpp:556:43: required from ‘void boost::detail::dijkstra_dispatch1(const VertexListGraph&, typename boost::graph_traits::vertex_descriptor, DistanceMap, WeightMap, IndexMap, const Params&) [with VertexListGraph = R_adjacency_list; DistanceMap = double*; WeightMap = boost::adj_list_edge_property_map, boost::edge_weight_t>; IndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>; Params = boost::bgl_named_params >; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/dijkstra_shortest_paths.hpp:570:31: required from ‘void boost::dijkstra_shortest_paths(const VertexListGraph&, typename graph_traits::vertex_descriptor, const bgl_named_params&) [with VertexListGraph = R_adjacency_list; Param = double*; Tag = vertex_distance_t; Rest = bgl_named_params; typename graph_traits::vertex_descriptor = long unsigned int]’ shortestPath.cpp:25:32: required from here /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ In file included from /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:31, from /home/omnipath/local/R/4.4-3.20/BH/include/boost/property_map/property_map.hpp:20: /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::Assignable<__gnu_cxx::__normal_iterator > >]’ 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ^ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements > > >]’: /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:233:5: required from ‘struct boost::EqualityComparable<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:502:3: required from ‘struct boost::InputIterator<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:540:3: required from ‘struct boost::ForwardIterator<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:568:3: required from ‘struct boost::BidirectionalIterator<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:597:3: required from ‘struct boost::RandomAccessIterator<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:597:3: [ skipping 3 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied > > >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_ > >)>’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/property_map/property_map.hpp:354:5: required from ‘boost::iterator_property_map boost::make_iterator_property_map(RAIter, ID, Value) [with RAIter = __gnu_cxx::__normal_iterator >; Value = double; ID = vec_adj_list_vertex_id_map, long unsigned int>]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/dijkstra_shortest_paths.hpp:556:43: required from ‘void boost::detail::dijkstra_dispatch1(const VertexListGraph&, typename boost::graph_traits::vertex_descriptor, DistanceMap, WeightMap, IndexMap, const Params&) [with VertexListGraph = R_adjacency_list; DistanceMap = double*; WeightMap = boost::adj_list_edge_property_map, boost::edge_weight_t>; IndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>; Params = boost::bgl_named_params >; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/dijkstra_shortest_paths.hpp:570:31: required from ‘void boost::dijkstra_shortest_paths(const VertexListGraph&, typename graph_traits::vertex_descriptor, const bgl_named_params&) [with VertexListGraph = R_adjacency_list; Param = double*; Tag = vertex_distance_t; Rest = bgl_named_params; typename graph_traits::vertex_descriptor = long unsigned int]’ shortestPath.cpp:25:32: required from here /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::EqualityComparable<__gnu_cxx::__normal_iterator > >]’ 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ^ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements > > >]’: /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:512:7: required from ‘struct boost::InputIterator<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:540:3: required from ‘struct boost::ForwardIterator<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:568:3: required from ‘struct boost::BidirectionalIterator<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:597:3: required from ‘struct boost::RandomAccessIterator<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:597:3: required from ‘struct boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:32:62: [ skipping 2 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied > > >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_ > >)>’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/property_map/property_map.hpp:354:5: required from ‘boost::iterator_property_map boost::make_iterator_property_map(RAIter, ID, Value) [with RAIter = __gnu_cxx::__normal_iterator >; Value = double; ID = vec_adj_list_vertex_id_map, long unsigned int>]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/dijkstra_shortest_paths.hpp:556:43: required from ‘void boost::detail::dijkstra_dispatch1(const VertexListGraph&, typename boost::graph_traits::vertex_descriptor, DistanceMap, WeightMap, IndexMap, const Params&) [with VertexListGraph = R_adjacency_list; DistanceMap = double*; WeightMap = boost::adj_list_edge_property_map, boost::edge_weight_t>; IndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>; Params = boost::bgl_named_params >; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/dijkstra_shortest_paths.hpp:570:31: required from ‘void boost::dijkstra_shortest_paths(const VertexListGraph&, typename graph_traits::vertex_descriptor, const bgl_named_params&) [with VertexListGraph = R_adjacency_list; Param = double*; Tag = vertex_distance_t; Rest = bgl_named_params; typename graph_traits::vertex_descriptor = long unsigned int]’ shortestPath.cpp:25:32: required from here /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::InputIterator<__gnu_cxx::__normal_iterator > >]’ 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ^ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements > > >]’: /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:543:7: required from ‘struct boost::ForwardIterator<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:568:3: required from ‘struct boost::BidirectionalIterator<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:597:3: required from ‘struct boost::RandomAccessIterator<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:597:3: required from ‘struct boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:32:62: [ skipping 2 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied > > >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_ > >)>’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/property_map/property_map.hpp:354:5: required from ‘boost::iterator_property_map boost::make_iterator_property_map(RAIter, ID, Value) [with RAIter = __gnu_cxx::__normal_iterator >; Value = double; ID = vec_adj_list_vertex_id_map, long unsigned int>]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/dijkstra_shortest_paths.hpp:556:43: required from ‘void boost::detail::dijkstra_dispatch1(const VertexListGraph&, typename boost::graph_traits::vertex_descriptor, DistanceMap, WeightMap, IndexMap, const Params&) [with VertexListGraph = R_adjacency_list; DistanceMap = double*; WeightMap = boost::adj_list_edge_property_map, boost::edge_weight_t>; IndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>; Params = boost::bgl_named_params >; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/dijkstra_shortest_paths.hpp:570:31: required from ‘void boost::dijkstra_shortest_paths(const VertexListGraph&, typename graph_traits::vertex_descriptor, const bgl_named_params&) [with VertexListGraph = R_adjacency_list; Param = double*; Tag = vertex_distance_t; Rest = bgl_named_params; typename graph_traits::vertex_descriptor = long unsigned int]’ shortestPath.cpp:25:32: required from here /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::ForwardIterator<__gnu_cxx::__normal_iterator > >]’ 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ^ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements > > >]’: /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:571:7: required from ‘struct boost::BidirectionalIterator<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:597:3: required from ‘struct boost::RandomAccessIterator<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:597:3: required from ‘struct boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator > >]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied > > >::value’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied > > >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_ > >)>’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/property_map/property_map.hpp:354:5: required from ‘boost::iterator_property_map boost::make_iterator_property_map(RAIter, ID, Value) [with RAIter = __gnu_cxx::__normal_iterator >; Value = double; ID = vec_adj_list_vertex_id_map, long unsigned int>]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/dijkstra_shortest_paths.hpp:556:43: required from ‘void boost::detail::dijkstra_dispatch1(const VertexListGraph&, typename boost::graph_traits::vertex_descriptor, DistanceMap, WeightMap, IndexMap, const Params&) [with VertexListGraph = R_adjacency_list; DistanceMap = double*; WeightMap = boost::adj_list_edge_property_map, boost::edge_weight_t>; IndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>; Params = boost::bgl_named_params >; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/dijkstra_shortest_paths.hpp:570:31: required from ‘void boost::dijkstra_shortest_paths(const VertexListGraph&, typename graph_traits::vertex_descriptor, const bgl_named_params&) [with VertexListGraph = R_adjacency_list; Param = double*; Tag = vertex_distance_t; Rest = bgl_named_params; typename graph_traits::vertex_descriptor = long unsigned int]’ shortestPath.cpp:25:32: required from here /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::BidirectionalIterator<__gnu_cxx::__normal_iterator > >]’ 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ^ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements > > >]’: /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:253:5: required from ‘struct boost::Comparable<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:597:3: required from ‘struct boost::RandomAccessIterator<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:597:3: required from ‘struct boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator > >]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied > > >::value’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied > > >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_ > >)>’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/property_map/property_map.hpp:354:5: required from ‘boost::iterator_property_map boost::make_iterator_property_map(RAIter, ID, Value) [with RAIter = __gnu_cxx::__normal_iterator >; Value = double; ID = vec_adj_list_vertex_id_map, long unsigned int>]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/dijkstra_shortest_paths.hpp:556:43: required from ‘void boost::detail::dijkstra_dispatch1(const VertexListGraph&, typename boost::graph_traits::vertex_descriptor, DistanceMap, WeightMap, IndexMap, const Params&) [with VertexListGraph = R_adjacency_list; DistanceMap = double*; WeightMap = boost::adj_list_edge_property_map, boost::edge_weight_t>; IndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>; Params = boost::bgl_named_params >; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/dijkstra_shortest_paths.hpp:570:31: required from ‘void boost::dijkstra_shortest_paths(const VertexListGraph&, typename graph_traits::vertex_descriptor, const bgl_named_params&) [with VertexListGraph = R_adjacency_list; Param = double*; Tag = vertex_distance_t; Rest = bgl_named_params; typename graph_traits::vertex_descriptor = long unsigned int]’ shortestPath.cpp:25:32: required from here /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::Comparable<__gnu_cxx::__normal_iterator > >]’ 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ^ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements > > >]’: /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:601:7: required from ‘struct boost::RandomAccessIterator<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:597:3: required from ‘struct boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator > >]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied > > >::value’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied > > >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_ > >)>’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/property_map/property_map.hpp:354:5: required from ‘boost::iterator_property_map boost::make_iterator_property_map(RAIter, ID, Value) [with RAIter = __gnu_cxx::__normal_iterator >; Value = double; ID = vec_adj_list_vertex_id_map, long unsigned int>]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/dijkstra_shortest_paths.hpp:556:43: required from ‘void boost::detail::dijkstra_dispatch1(const VertexListGraph&, typename boost::graph_traits::vertex_descriptor, DistanceMap, WeightMap, IndexMap, const Params&) [with VertexListGraph = R_adjacency_list; DistanceMap = double*; WeightMap = boost::adj_list_edge_property_map, boost::edge_weight_t>; IndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>; Params = boost::bgl_named_params >; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/dijkstra_shortest_paths.hpp:570:31: required from ‘void boost::dijkstra_shortest_paths(const VertexListGraph&, typename graph_traits::vertex_descriptor, const bgl_named_params&) [with VertexListGraph = R_adjacency_list; Param = double*; Tag = vertex_distance_t; Rest = bgl_named_params; typename graph_traits::vertex_descriptor = long unsigned int]’ shortestPath.cpp:25:32: required from here /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::RandomAccessIterator<__gnu_cxx::__normal_iterator > >]’ 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ^ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator > >]’: /home/omnipath/local/R/4.4-3.20/BH/include/boost/property_map/property_map.hpp:354:5: required from ‘boost::iterator_property_map boost::make_iterator_property_map(RAIter, ID, Value) [with RAIter = __gnu_cxx::__normal_iterator >; Value = double; ID = vec_adj_list_vertex_id_map, long unsigned int>]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/dijkstra_shortest_paths.hpp:556:43: required from ‘void boost::detail::dijkstra_dispatch1(const VertexListGraph&, typename boost::graph_traits::vertex_descriptor, DistanceMap, WeightMap, IndexMap, const Params&) [with VertexListGraph = R_adjacency_list; DistanceMap = double*; WeightMap = boost::adj_list_edge_property_map, boost::edge_weight_t>; IndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>; Params = boost::bgl_named_params >; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/dijkstra_shortest_paths.hpp:570:31: required from ‘void boost::dijkstra_shortest_paths(const VertexListGraph&, typename graph_traits::vertex_descriptor, const bgl_named_params&) [with VertexListGraph = R_adjacency_list; Param = double*; Tag = vertex_distance_t; Rest = bgl_named_params; typename graph_traits::vertex_descriptor = long unsigned int]’ shortestPath.cpp:25:32: required from here /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ In file included from /home/omnipath/local/R/4.4-3.20/BH/include/boost/preprocessor/repetition/enum_binary_params.hpp:15, from /home/omnipath/local/R/4.4-3.20/BH/include/boost/utility/base_from_member.hpp:15, from /home/omnipath/local/R/4.4-3.20/BH/include/boost/utility.hpp:15, from RBGL.hpp:16: /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:597:17: note: in a call to non-static member function ‘boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator > >::~RandomAccessIteratorConcept()’ 597 | BOOST_concept(RandomAccessIterator,(TT)) | ^~~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/preprocessor/cat.hpp:29:34: note: in definition of macro ‘BOOST_PP_CAT_I’ 29 | # define BOOST_PP_CAT_I(a, b) a ## b | ^ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/concept_def.hpp:23:12: note: in expansion of macro ‘BOOST_PP_CAT’ 23 | struct BOOST_PP_CAT(name,Concept) \ | ^~~~~~~~~~~~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:597:3: note: in expansion of macro ‘BOOST_concept’ 597 | BOOST_concept(RandomAccessIterator,(TT)) | ^~~~~~~~~~~~~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements, long unsigned int, double> >]’: /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/graph_concepts.hpp:516:5: required from ‘struct boost::concepts::BasicMatrix, long unsigned int, double>’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/graph_concepts.hpp:514:1: required from ‘struct boost::concepts::BasicMatrixConcept, long unsigned int, double>’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::concepts::BasicMatrixConcept, long unsigned int, double>]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied, long unsigned int, double> >::value’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied, long unsigned int, double> >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_, long unsigned int, double>)>’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/johnson_all_pairs_shortest.hpp:46:5: required from ‘bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, VertexID, Weight, const BinaryPredicate&, const BinaryFunction&, const Infinity&, DistanceZero) [with VertexAndEdgeListGraph = R_adjacency_list; DistanceMatrix = Basic2DMatrix; VertexID = vec_adj_list_vertex_id_map, long unsigned int>; Weight = adj_list_edge_property_map, edge_weight_t>; BinaryPredicate = std::less; BinaryFunction = closed_plus; Infinity = double; DistanceZero = double]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/johnson_all_pairs_shortest.hpp:164:48: required from ‘bool boost::detail::johnson_dispatch(VertexAndEdgeListGraph&, DistanceMatrix&, const boost::bgl_named_params&, Weight, VertexID) [with VertexAndEdgeListGraph = R_adjacency_list; DistanceMatrix = Basic2DMatrix; P = int; T = int; R = boost::no_property; Weight = boost::adj_list_edge_property_map, boost::edge_weight_t>; VertexID = boost::vec_adj_list_vertex_id_map, long unsigned int>]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/johnson_all_pairs_shortest.hpp:192:36: required from ‘bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&) [with VertexAndEdgeListGraph = R_adjacency_list; DistanceMatrix = Basic2DMatrix]’ shortestPath.cpp:56:41: required from here /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::concepts::BasicMatrix, long unsigned int, double>]’ 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ^ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::BasicMatrixConcept, long unsigned int, double>]’: /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/johnson_all_pairs_shortest.hpp:46:5: required from ‘bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, VertexID, Weight, const BinaryPredicate&, const BinaryFunction&, const Infinity&, DistanceZero) [with VertexAndEdgeListGraph = R_adjacency_list; DistanceMatrix = Basic2DMatrix; VertexID = vec_adj_list_vertex_id_map, long unsigned int>; Weight = adj_list_edge_property_map, edge_weight_t>; BinaryPredicate = std::less; BinaryFunction = closed_plus; Infinity = double; DistanceZero = double]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/johnson_all_pairs_shortest.hpp:164:48: required from ‘bool boost::detail::johnson_dispatch(VertexAndEdgeListGraph&, DistanceMatrix&, const boost::bgl_named_params&, Weight, VertexID) [with VertexAndEdgeListGraph = R_adjacency_list; DistanceMatrix = Basic2DMatrix; P = int; T = int; R = boost::no_property; Weight = boost::adj_list_edge_property_map, boost::edge_weight_t>; VertexID = boost::vec_adj_list_vertex_id_map, long unsigned int>]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/johnson_all_pairs_shortest.hpp:192:36: required from ‘bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&) [with VertexAndEdgeListGraph = R_adjacency_list; DistanceMatrix = Basic2DMatrix]’ shortestPath.cpp:56:41: required from here /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/graph_concepts.hpp:514:15: note: in a call to non-static member function ‘boost::concepts::BasicMatrixConcept, long unsigned int, double>::~BasicMatrixConcept()’ 514 | BOOST_concept(BasicMatrix, (M)(I)(V)) | ^~~~~~~~~~~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/preprocessor/cat.hpp:29:34: note: in definition of macro ‘BOOST_PP_CAT_I’ 29 | # define BOOST_PP_CAT_I(a, b) a ## b | ^ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/concept_def.hpp:23:12: note: in expansion of macro ‘BOOST_PP_CAT’ 23 | struct BOOST_PP_CAT(name,Concept) \ | ^~~~~~~~~~~~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/graph_concepts.hpp:514:1: note: in expansion of macro ‘BOOST_concept’ 514 | BOOST_concept(BasicMatrix, (M)(I)(V)) | ^~~~~~~~~~~~~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements > > >]’: /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:145:5: required from ‘struct boost::Assignable<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:502:3: required from ‘struct boost::InputIterator<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:540:3: required from ‘struct boost::ForwardIterator<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:568:3: required from ‘struct boost::BidirectionalIterator<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:597:3: required from ‘struct boost::RandomAccessIterator<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:597:3: [ skipping 3 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied > > >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_ > >)>’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/property_map/property_map.hpp:354:5: required from ‘boost::iterator_property_map boost::make_iterator_property_map(RAIter, ID, Value) [with RAIter = __gnu_cxx::__normal_iterator >; Value = default_color_type; ID = vec_adj_list_vertex_id_map, long unsigned int>]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/dag_shortest_paths.hpp:120:43: required from ‘void boost::detail::dag_sp_dispatch1(const VertexListGraph&, typename boost::graph_traits::vertex_descriptor, DistanceMap, WeightMap, ColorMap, IndexMap, DijkstraVisitor, const Params&) [with VertexListGraph = R_adjacency_list; DijkstraVisitor = boost::dijkstra_visitor<>; DistanceMap = double*; WeightMap = boost::adj_list_edge_property_map, boost::edge_weight_t>; ColorMap = boost::param_not_found; IndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>; Params = boost::bgl_named_params >; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/dag_shortest_paths.hpp:134:29: required from ‘void boost::dag_shortest_paths(const VertexListGraph&, typename graph_traits::vertex_descriptor, const bgl_named_params&) [with VertexListGraph = R_adjacency_list; Param = double*; Tag = vertex_distance_t; Rest = bgl_named_params; typename graph_traits::vertex_descriptor = long unsigned int]’ shortestPath.cpp:144:27: required from here /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::Assignable<__gnu_cxx::__normal_iterator > >]’ 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ^ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements > > >]’: /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:233:5: required from ‘struct boost::EqualityComparable<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:502:3: required from ‘struct boost::InputIterator<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:540:3: required from ‘struct boost::ForwardIterator<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:568:3: required from ‘struct boost::BidirectionalIterator<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:597:3: required from ‘struct boost::RandomAccessIterator<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:597:3: [ skipping 3 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied > > >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_ > >)>’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/property_map/property_map.hpp:354:5: required from ‘boost::iterator_property_map boost::make_iterator_property_map(RAIter, ID, Value) [with RAIter = __gnu_cxx::__normal_iterator >; Value = default_color_type; ID = vec_adj_list_vertex_id_map, long unsigned int>]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/dag_shortest_paths.hpp:120:43: required from ‘void boost::detail::dag_sp_dispatch1(const VertexListGraph&, typename boost::graph_traits::vertex_descriptor, DistanceMap, WeightMap, ColorMap, IndexMap, DijkstraVisitor, const Params&) [with VertexListGraph = R_adjacency_list; DijkstraVisitor = boost::dijkstra_visitor<>; DistanceMap = double*; WeightMap = boost::adj_list_edge_property_map, boost::edge_weight_t>; ColorMap = boost::param_not_found; IndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>; Params = boost::bgl_named_params >; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/dag_shortest_paths.hpp:134:29: required from ‘void boost::dag_shortest_paths(const VertexListGraph&, typename graph_traits::vertex_descriptor, const bgl_named_params&) [with VertexListGraph = R_adjacency_list; Param = double*; Tag = vertex_distance_t; Rest = bgl_named_params; typename graph_traits::vertex_descriptor = long unsigned int]’ shortestPath.cpp:144:27: required from here /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::EqualityComparable<__gnu_cxx::__normal_iterator > >]’ 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ^ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements > > >]’: /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:512:7: required from ‘struct boost::InputIterator<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:540:3: required from ‘struct boost::ForwardIterator<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:568:3: required from ‘struct boost::BidirectionalIterator<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:597:3: required from ‘struct boost::RandomAccessIterator<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:597:3: required from ‘struct boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:32:62: [ skipping 2 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied > > >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_ > >)>’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/property_map/property_map.hpp:354:5: required from ‘boost::iterator_property_map boost::make_iterator_property_map(RAIter, ID, Value) [with RAIter = __gnu_cxx::__normal_iterator >; Value = default_color_type; ID = vec_adj_list_vertex_id_map, long unsigned int>]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/dag_shortest_paths.hpp:120:43: required from ‘void boost::detail::dag_sp_dispatch1(const VertexListGraph&, typename boost::graph_traits::vertex_descriptor, DistanceMap, WeightMap, ColorMap, IndexMap, DijkstraVisitor, const Params&) [with VertexListGraph = R_adjacency_list; DijkstraVisitor = boost::dijkstra_visitor<>; DistanceMap = double*; WeightMap = boost::adj_list_edge_property_map, boost::edge_weight_t>; ColorMap = boost::param_not_found; IndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>; Params = boost::bgl_named_params >; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/dag_shortest_paths.hpp:134:29: required from ‘void boost::dag_shortest_paths(const VertexListGraph&, typename graph_traits::vertex_descriptor, const bgl_named_params&) [with VertexListGraph = R_adjacency_list; Param = double*; Tag = vertex_distance_t; Rest = bgl_named_params; typename graph_traits::vertex_descriptor = long unsigned int]’ shortestPath.cpp:144:27: required from here /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::InputIterator<__gnu_cxx::__normal_iterator > >]’ 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ^ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements > > >]’: /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:543:7: required from ‘struct boost::ForwardIterator<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:568:3: required from ‘struct boost::BidirectionalIterator<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:597:3: required from ‘struct boost::RandomAccessIterator<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:597:3: required from ‘struct boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:32:62: [ skipping 2 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied > > >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_ > >)>’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/property_map/property_map.hpp:354:5: required from ‘boost::iterator_property_map boost::make_iterator_property_map(RAIter, ID, Value) [with RAIter = __gnu_cxx::__normal_iterator >; Value = default_color_type; ID = vec_adj_list_vertex_id_map, long unsigned int>]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/dag_shortest_paths.hpp:120:43: required from ‘void boost::detail::dag_sp_dispatch1(const VertexListGraph&, typename boost::graph_traits::vertex_descriptor, DistanceMap, WeightMap, ColorMap, IndexMap, DijkstraVisitor, const Params&) [with VertexListGraph = R_adjacency_list; DijkstraVisitor = boost::dijkstra_visitor<>; DistanceMap = double*; WeightMap = boost::adj_list_edge_property_map, boost::edge_weight_t>; ColorMap = boost::param_not_found; IndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>; Params = boost::bgl_named_params >; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/dag_shortest_paths.hpp:134:29: required from ‘void boost::dag_shortest_paths(const VertexListGraph&, typename graph_traits::vertex_descriptor, const bgl_named_params&) [with VertexListGraph = R_adjacency_list; Param = double*; Tag = vertex_distance_t; Rest = bgl_named_params; typename graph_traits::vertex_descriptor = long unsigned int]’ shortestPath.cpp:144:27: required from here /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::ForwardIterator<__gnu_cxx::__normal_iterator > >]’ 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ^ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements > > >]’: /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:571:7: required from ‘struct boost::BidirectionalIterator<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:597:3: required from ‘struct boost::RandomAccessIterator<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:597:3: required from ‘struct boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator > >]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied > > >::value’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied > > >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_ > >)>’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/property_map/property_map.hpp:354:5: required from ‘boost::iterator_property_map boost::make_iterator_property_map(RAIter, ID, Value) [with RAIter = __gnu_cxx::__normal_iterator >; Value = default_color_type; ID = vec_adj_list_vertex_id_map, long unsigned int>]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/dag_shortest_paths.hpp:120:43: required from ‘void boost::detail::dag_sp_dispatch1(const VertexListGraph&, typename boost::graph_traits::vertex_descriptor, DistanceMap, WeightMap, ColorMap, IndexMap, DijkstraVisitor, const Params&) [with VertexListGraph = R_adjacency_list; DijkstraVisitor = boost::dijkstra_visitor<>; DistanceMap = double*; WeightMap = boost::adj_list_edge_property_map, boost::edge_weight_t>; ColorMap = boost::param_not_found; IndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>; Params = boost::bgl_named_params >; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/dag_shortest_paths.hpp:134:29: required from ‘void boost::dag_shortest_paths(const VertexListGraph&, typename graph_traits::vertex_descriptor, const bgl_named_params&) [with VertexListGraph = R_adjacency_list; Param = double*; Tag = vertex_distance_t; Rest = bgl_named_params; typename graph_traits::vertex_descriptor = long unsigned int]’ shortestPath.cpp:144:27: required from here /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::BidirectionalIterator<__gnu_cxx::__normal_iterator > >]’ 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ^ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements > > >]’: /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:253:5: required from ‘struct boost::Comparable<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:597:3: required from ‘struct boost::RandomAccessIterator<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:597:3: required from ‘struct boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator > >]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied > > >::value’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied > > >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_ > >)>’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/property_map/property_map.hpp:354:5: required from ‘boost::iterator_property_map boost::make_iterator_property_map(RAIter, ID, Value) [with RAIter = __gnu_cxx::__normal_iterator >; Value = default_color_type; ID = vec_adj_list_vertex_id_map, long unsigned int>]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/dag_shortest_paths.hpp:120:43: required from ‘void boost::detail::dag_sp_dispatch1(const VertexListGraph&, typename boost::graph_traits::vertex_descriptor, DistanceMap, WeightMap, ColorMap, IndexMap, DijkstraVisitor, const Params&) [with VertexListGraph = R_adjacency_list; DijkstraVisitor = boost::dijkstra_visitor<>; DistanceMap = double*; WeightMap = boost::adj_list_edge_property_map, boost::edge_weight_t>; ColorMap = boost::param_not_found; IndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>; Params = boost::bgl_named_params >; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/dag_shortest_paths.hpp:134:29: required from ‘void boost::dag_shortest_paths(const VertexListGraph&, typename graph_traits::vertex_descriptor, const bgl_named_params&) [with VertexListGraph = R_adjacency_list; Param = double*; Tag = vertex_distance_t; Rest = bgl_named_params; typename graph_traits::vertex_descriptor = long unsigned int]’ shortestPath.cpp:144:27: required from here /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::Comparable<__gnu_cxx::__normal_iterator > >]’ 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ^ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements > > >]’: /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:601:7: required from ‘struct boost::RandomAccessIterator<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:597:3: required from ‘struct boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator > >]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied > > >::value’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied > > >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_ > >)>’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/property_map/property_map.hpp:354:5: required from ‘boost::iterator_property_map boost::make_iterator_property_map(RAIter, ID, Value) [with RAIter = __gnu_cxx::__normal_iterator >; Value = default_color_type; ID = vec_adj_list_vertex_id_map, long unsigned int>]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/dag_shortest_paths.hpp:120:43: required from ‘void boost::detail::dag_sp_dispatch1(const VertexListGraph&, typename boost::graph_traits::vertex_descriptor, DistanceMap, WeightMap, ColorMap, IndexMap, DijkstraVisitor, const Params&) [with VertexListGraph = R_adjacency_list; DijkstraVisitor = boost::dijkstra_visitor<>; DistanceMap = double*; WeightMap = boost::adj_list_edge_property_map, boost::edge_weight_t>; ColorMap = boost::param_not_found; IndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>; Params = boost::bgl_named_params >; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/dag_shortest_paths.hpp:134:29: required from ‘void boost::dag_shortest_paths(const VertexListGraph&, typename graph_traits::vertex_descriptor, const bgl_named_params&) [with VertexListGraph = R_adjacency_list; Param = double*; Tag = vertex_distance_t; Rest = bgl_named_params; typename graph_traits::vertex_descriptor = long unsigned int]’ shortestPath.cpp:144:27: required from here /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::RandomAccessIterator<__gnu_cxx::__normal_iterator > >]’ 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ^ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator > >]’: /home/omnipath/local/R/4.4-3.20/BH/include/boost/property_map/property_map.hpp:354:5: required from ‘boost::iterator_property_map boost::make_iterator_property_map(RAIter, ID, Value) [with RAIter = __gnu_cxx::__normal_iterator >; Value = default_color_type; ID = vec_adj_list_vertex_id_map, long unsigned int>]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/dag_shortest_paths.hpp:120:43: required from ‘void boost::detail::dag_sp_dispatch1(const VertexListGraph&, typename boost::graph_traits::vertex_descriptor, DistanceMap, WeightMap, ColorMap, IndexMap, DijkstraVisitor, const Params&) [with VertexListGraph = R_adjacency_list; DijkstraVisitor = boost::dijkstra_visitor<>; DistanceMap = double*; WeightMap = boost::adj_list_edge_property_map, boost::edge_weight_t>; ColorMap = boost::param_not_found; IndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>; Params = boost::bgl_named_params >; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/dag_shortest_paths.hpp:134:29: required from ‘void boost::dag_shortest_paths(const VertexListGraph&, typename graph_traits::vertex_descriptor, const bgl_named_params&) [with VertexListGraph = R_adjacency_list; Param = double*; Tag = vertex_distance_t; Rest = bgl_named_params; typename graph_traits::vertex_descriptor = long unsigned int]’ shortestPath.cpp:144:27: required from here /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:597:17: note: in a call to non-static member function ‘boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator > >::~RandomAccessIteratorConcept()’ 597 | BOOST_concept(RandomAccessIterator,(TT)) | ^~~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/preprocessor/cat.hpp:29:34: note: in definition of macro ‘BOOST_PP_CAT_I’ 29 | # define BOOST_PP_CAT_I(a, b) a ## b | ^ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/concept_def.hpp:23:12: note: in expansion of macro ‘BOOST_PP_CAT’ 23 | struct BOOST_PP_CAT(name,Concept) \ | ^~~~~~~~~~~~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:597:3: note: in expansion of macro ‘BOOST_concept’ 597 | BOOST_concept(RandomAccessIterator,(TT)) | ^~~~~~~~~~~~~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements > >]’: /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/graph_concepts.hpp:66:5: required from ‘struct boost::concepts::Graph >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/graph_concepts.hpp:176:1: required from ‘struct boost::concepts::VertexListGraph >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/graph_concepts.hpp:176:1: required from ‘struct boost::concepts::VertexListGraphConcept >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::concepts::VertexListGraphConcept >]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied > >::value’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied > >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_ >)>’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/bellman_ford_shortest_paths.hpp:218:5: required from ‘bool boost::floyd_warshall_all_pairs_shortest_paths(const VertexAndEdgeListGraph&, DistanceMatrix&, const WeightMap&, const BinaryPredicate&, const BinaryFunction&, const Infinity&, const Zero&) [with VertexAndEdgeListGraph = R_adjacency_list; DistanceMatrix = Basic2DMatrix; WeightMap = adj_list_edge_property_map, edge_weight_t>; BinaryPredicate = std::less; BinaryFunction = closed_plus; Infinity = double; Zero = double]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/floyd_warshall_shortest.hpp:172:55: required from ‘bool boost::detail::floyd_warshall_noninit_dispatch(const VertexAndEdgeListGraph&, DistanceMatrix&, WeightMap, const boost::bgl_named_params&) [with VertexAndEdgeListGraph = R_adjacency_list; DistanceMatrix = Basic2DMatrix; WeightMap = boost::adj_list_edge_property_map, boost::edge_weight_t>; P = int; T = int; R = boost::no_property]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/floyd_warshall_shortest.hpp:217:51: required from ‘bool boost::floyd_warshall_all_pairs_shortest_paths(const VertexAndEdgeListGraph&, DistanceMatrix&) [with VertexAndEdgeListGraph = R_adjacency_list; DistanceMatrix = Basic2DMatrix]’ shortestPath.cpp:186:48: required from here /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::concepts::Graph >]’ 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ^ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements > >]’: /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/graph_concepts.hpp:182:5: required from ‘struct boost::concepts::VertexListGraph >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/graph_concepts.hpp:176:1: required from ‘struct boost::concepts::VertexListGraphConcept >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::concepts::VertexListGraphConcept >]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied > >::value’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied > >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_ >)>’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/bellman_ford_shortest_paths.hpp:218:5: required from ‘bool boost::floyd_warshall_all_pairs_shortest_paths(const VertexAndEdgeListGraph&, DistanceMatrix&, const WeightMap&, const BinaryPredicate&, const BinaryFunction&, const Infinity&, const Zero&) [with VertexAndEdgeListGraph = R_adjacency_list; DistanceMatrix = Basic2DMatrix; WeightMap = adj_list_edge_property_map, edge_weight_t>; BinaryPredicate = std::less; BinaryFunction = closed_plus; Infinity = double; Zero = double]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/floyd_warshall_shortest.hpp:172:55: required from ‘bool boost::detail::floyd_warshall_noninit_dispatch(const VertexAndEdgeListGraph&, DistanceMatrix&, WeightMap, const boost::bgl_named_params&) [with VertexAndEdgeListGraph = R_adjacency_list; DistanceMatrix = Basic2DMatrix; WeightMap = boost::adj_list_edge_property_map, boost::edge_weight_t>; P = int; T = int; R = boost::no_property]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/floyd_warshall_shortest.hpp:217:51: required from ‘bool boost::floyd_warshall_all_pairs_shortest_paths(const VertexAndEdgeListGraph&, DistanceMatrix&) [with VertexAndEdgeListGraph = R_adjacency_list; DistanceMatrix = Basic2DMatrix]’ shortestPath.cpp:186:48: required from here /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::concepts::VertexListGraph >]’ 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ^ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::VertexListGraphConcept >]’: /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/bellman_ford_shortest_paths.hpp:218:5: required from ‘bool boost::floyd_warshall_all_pairs_shortest_paths(const VertexAndEdgeListGraph&, DistanceMatrix&, const WeightMap&, const BinaryPredicate&, const BinaryFunction&, const Infinity&, const Zero&) [with VertexAndEdgeListGraph = R_adjacency_list; DistanceMatrix = Basic2DMatrix; WeightMap = adj_list_edge_property_map, edge_weight_t>; BinaryPredicate = std::less; BinaryFunction = closed_plus; Infinity = double; Zero = double]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/floyd_warshall_shortest.hpp:172:55: required from ‘bool boost::detail::floyd_warshall_noninit_dispatch(const VertexAndEdgeListGraph&, DistanceMatrix&, WeightMap, const boost::bgl_named_params&) [with VertexAndEdgeListGraph = R_adjacency_list; DistanceMatrix = Basic2DMatrix; WeightMap = boost::adj_list_edge_property_map, boost::edge_weight_t>; P = int; T = int; R = boost::no_property]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/floyd_warshall_shortest.hpp:217:51: required from ‘bool boost::floyd_warshall_all_pairs_shortest_paths(const VertexAndEdgeListGraph&, DistanceMatrix&) [with VertexAndEdgeListGraph = R_adjacency_list; DistanceMatrix = Basic2DMatrix]’ shortestPath.cpp:186:48: required from here /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/graph_concepts.hpp:176:15: note: in a call to non-static member function ‘boost::concepts::VertexListGraphConcept >::~VertexListGraphConcept()’ 176 | BOOST_concept(VertexListGraph, (G)) : Graph< G > | ^~~~~~~~~~~~~~~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/preprocessor/cat.hpp:29:34: note: in definition of macro ‘BOOST_PP_CAT_I’ 29 | # define BOOST_PP_CAT_I(a, b) a ## b | ^ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/concept_def.hpp:23:12: note: in expansion of macro ‘BOOST_PP_CAT’ 23 | struct BOOST_PP_CAT(name,Concept) \ | ^~~~~~~~~~~~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/graph_concepts.hpp:176:1: note: in expansion of macro ‘BOOST_concept’ 176 | BOOST_concept(VertexListGraph, (G)) : Graph< G > | ^~~~~~~~~~~~~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements > >]’: /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/graph_concepts.hpp:233:5: required from ‘struct boost::concepts::EdgeListGraph >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/graph_concepts.hpp:226:1: required from ‘struct boost::concepts::EdgeListGraphConcept >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::concepts::EdgeListGraphConcept >]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied > >::value’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied > >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_ >)>’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/bellman_ford_shortest_paths.hpp:97:5: required from ‘bool boost::floyd_warshall_all_pairs_shortest_paths(const VertexAndEdgeListGraph&, DistanceMatrix&, const WeightMap&, const BinaryPredicate&, const BinaryFunction&, const Infinity&, const Zero&) [with VertexAndEdgeListGraph = R_adjacency_list; DistanceMatrix = Basic2DMatrix; WeightMap = adj_list_edge_property_map, edge_weight_t>; BinaryPredicate = std::less; BinaryFunction = closed_plus; Infinity = double; Zero = double]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/floyd_warshall_shortest.hpp:172:55: required from ‘bool boost::detail::floyd_warshall_noninit_dispatch(const VertexAndEdgeListGraph&, DistanceMatrix&, WeightMap, const boost::bgl_named_params&) [with VertexAndEdgeListGraph = R_adjacency_list; DistanceMatrix = Basic2DMatrix; WeightMap = boost::adj_list_edge_property_map, boost::edge_weight_t>; P = int; T = int; R = boost::no_property]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/floyd_warshall_shortest.hpp:217:51: required from ‘bool boost::floyd_warshall_all_pairs_shortest_paths(const VertexAndEdgeListGraph&, DistanceMatrix&) [with VertexAndEdgeListGraph = R_adjacency_list; DistanceMatrix = Basic2DMatrix]’ shortestPath.cpp:186:48: required from here /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::concepts::EdgeListGraph >]’ 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ^ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::EdgeListGraphConcept >]’: /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/bellman_ford_shortest_paths.hpp:97:5: required from ‘bool boost::floyd_warshall_all_pairs_shortest_paths(const VertexAndEdgeListGraph&, DistanceMatrix&, const WeightMap&, const BinaryPredicate&, const BinaryFunction&, const Infinity&, const Zero&) [with VertexAndEdgeListGraph = R_adjacency_list; DistanceMatrix = Basic2DMatrix; WeightMap = adj_list_edge_property_map, edge_weight_t>; BinaryPredicate = std::less; BinaryFunction = closed_plus; Infinity = double; Zero = double]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/floyd_warshall_shortest.hpp:172:55: required from ‘bool boost::detail::floyd_warshall_noninit_dispatch(const VertexAndEdgeListGraph&, DistanceMatrix&, WeightMap, const boost::bgl_named_params&) [with VertexAndEdgeListGraph = R_adjacency_list; DistanceMatrix = Basic2DMatrix; WeightMap = boost::adj_list_edge_property_map, boost::edge_weight_t>; P = int; T = int; R = boost::no_property]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/floyd_warshall_shortest.hpp:217:51: required from ‘bool boost::floyd_warshall_all_pairs_shortest_paths(const VertexAndEdgeListGraph&, DistanceMatrix&) [with VertexAndEdgeListGraph = R_adjacency_list; DistanceMatrix = Basic2DMatrix]’ shortestPath.cpp:186:48: required from here /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/graph_concepts.hpp:226:15: note: in a call to non-static member function ‘boost::concepts::EdgeListGraphConcept >::~EdgeListGraphConcept()’ 226 | BOOST_concept(EdgeListGraph, (G)) : Graph< G > | ^~~~~~~~~~~~~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/preprocessor/cat.hpp:29:34: note: in definition of macro ‘BOOST_PP_CAT_I’ 29 | # define BOOST_PP_CAT_I(a, b) a ## b | ^ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/concept_def.hpp:23:12: note: in expansion of macro ‘BOOST_PP_CAT’ 23 | struct BOOST_PP_CAT(name,Concept) \ | ^~~~~~~~~~~~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/graph_concepts.hpp:226:1: note: in expansion of macro ‘BOOST_concept’ 226 | BOOST_concept(EdgeListGraph, (G)) : Graph< G > | ^~~~~~~~~~~~~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements > >]’: /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/graph_concepts.hpp:87:5: required from ‘struct boost::concepts::IncidenceGraph >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/graph_concepts.hpp:75:1: required from ‘struct boost::concepts::IncidenceGraphConcept >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::concepts::IncidenceGraphConcept >]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied > >::value’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied > >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_ >)>’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/breadth_first_search.hpp:62:5: required from ‘bool boost::floyd_warshall_all_pairs_shortest_paths(const VertexAndEdgeListGraph&, DistanceMatrix&, const WeightMap&, const BinaryPredicate&, const BinaryFunction&, const Infinity&, const Zero&) [with VertexAndEdgeListGraph = R_adjacency_list; DistanceMatrix = Basic2DMatrix; WeightMap = adj_list_edge_property_map, edge_weight_t>; BinaryPredicate = std::less; BinaryFunction = closed_plus; Infinity = double; Zero = double]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/floyd_warshall_shortest.hpp:172:55: required from ‘bool boost::detail::floyd_warshall_noninit_dispatch(const VertexAndEdgeListGraph&, DistanceMatrix&, WeightMap, const boost::bgl_named_params&) [with VertexAndEdgeListGraph = R_adjacency_list; DistanceMatrix = Basic2DMatrix; WeightMap = boost::adj_list_edge_property_map, boost::edge_weight_t>; P = int; T = int; R = boost::no_property]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/floyd_warshall_shortest.hpp:217:51: required from ‘bool boost::floyd_warshall_all_pairs_shortest_paths(const VertexAndEdgeListGraph&, DistanceMatrix&) [with VertexAndEdgeListGraph = R_adjacency_list; DistanceMatrix = Basic2DMatrix]’ shortestPath.cpp:186:48: required from here /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::concepts::IncidenceGraph >]’ 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ^ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::IncidenceGraphConcept >]’: /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/breadth_first_search.hpp:62:5: required from ‘bool boost::floyd_warshall_all_pairs_shortest_paths(const VertexAndEdgeListGraph&, DistanceMatrix&, const WeightMap&, const BinaryPredicate&, const BinaryFunction&, const Infinity&, const Zero&) [with VertexAndEdgeListGraph = R_adjacency_list; DistanceMatrix = Basic2DMatrix; WeightMap = adj_list_edge_property_map, edge_weight_t>; BinaryPredicate = std::less; BinaryFunction = closed_plus; Infinity = double; Zero = double]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/floyd_warshall_shortest.hpp:172:55: required from ‘bool boost::detail::floyd_warshall_noninit_dispatch(const VertexAndEdgeListGraph&, DistanceMatrix&, WeightMap, const boost::bgl_named_params&) [with VertexAndEdgeListGraph = R_adjacency_list; DistanceMatrix = Basic2DMatrix; WeightMap = boost::adj_list_edge_property_map, boost::edge_weight_t>; P = int; T = int; R = boost::no_property]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/floyd_warshall_shortest.hpp:217:51: required from ‘bool boost::floyd_warshall_all_pairs_shortest_paths(const VertexAndEdgeListGraph&, DistanceMatrix&) [with VertexAndEdgeListGraph = R_adjacency_list; DistanceMatrix = Basic2DMatrix]’ shortestPath.cpp:186:48: required from here /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/graph_concepts.hpp:75:15: note: in a call to non-static member function ‘boost::concepts::IncidenceGraphConcept >::~IncidenceGraphConcept()’ 75 | BOOST_concept(IncidenceGraph, (G)) : Graph< G > | ^~~~~~~~~~~~~~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/preprocessor/cat.hpp:29:34: note: in definition of macro ‘BOOST_PP_CAT_I’ 29 | # define BOOST_PP_CAT_I(a, b) a ## b | ^ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/concept_def.hpp:23:12: note: in expansion of macro ‘BOOST_PP_CAT’ 23 | struct BOOST_PP_CAT(name,Concept) \ | ^~~~~~~~~~~~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/graph_concepts.hpp:75:1: note: in expansion of macro ‘BOOST_concept’ 75 | BOOST_concept(IncidenceGraph, (G)) : Graph< G > | ^~~~~~~~~~~~~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::Assignable<__gnu_cxx::__normal_iterator > >]’: /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements > > >]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:145:5: required from ‘struct boost::Assignable<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:502:3: required from ‘struct boost::InputIterator<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:540:3: required from ‘struct boost::ForwardIterator<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:568:3: required from ‘struct boost::BidirectionalIterator<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:597:3: [ skipping 4 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied > > >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_ > >)>’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/property_map/property_map.hpp:354:5: required from ‘boost::iterator_property_map boost::make_iterator_property_map(RAIter, ID, Value) [with RAIter = __gnu_cxx::__normal_iterator >; Value = double; ID = vec_adj_list_vertex_id_map, long unsigned int>]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/dijkstra_shortest_paths.hpp:556:43: required from ‘void boost::detail::dijkstra_dispatch1(const VertexListGraph&, typename boost::graph_traits::vertex_descriptor, DistanceMap, WeightMap, IndexMap, const Params&) [with VertexListGraph = R_adjacency_list; DistanceMap = double*; WeightMap = boost::adj_list_edge_property_map, boost::edge_weight_t>; IndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>; Params = boost::bgl_named_params >; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/dijkstra_shortest_paths.hpp:570:31: required from ‘void boost::dijkstra_shortest_paths(const VertexListGraph&, typename graph_traits::vertex_descriptor, const bgl_named_params&) [with VertexListGraph = R_adjacency_list; Param = double*; Tag = vertex_distance_t; Rest = bgl_named_params; typename graph_traits::vertex_descriptor = long unsigned int]’ shortestPath.cpp:25:32: required from here /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::Assignable::~Assignable() [with TT = __gnu_cxx::__normal_iterator >]’ 37 | ~model() | ^ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:145:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 145 | BOOST_CONCEPT_USAGE(Assignable) { | ^~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::EqualityComparable<__gnu_cxx::__normal_iterator > >]’: /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements > > >]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:233:5: required from ‘struct boost::EqualityComparable<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:502:3: required from ‘struct boost::InputIterator<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:540:3: required from ‘struct boost::ForwardIterator<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:568:3: required from ‘struct boost::BidirectionalIterator<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:597:3: [ skipping 4 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied > > >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_ > >)>’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/property_map/property_map.hpp:354:5: required from ‘boost::iterator_property_map boost::make_iterator_property_map(RAIter, ID, Value) [with RAIter = __gnu_cxx::__normal_iterator >; Value = double; ID = vec_adj_list_vertex_id_map, long unsigned int>]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/dijkstra_shortest_paths.hpp:556:43: required from ‘void boost::detail::dijkstra_dispatch1(const VertexListGraph&, typename boost::graph_traits::vertex_descriptor, DistanceMap, WeightMap, IndexMap, const Params&) [with VertexListGraph = R_adjacency_list; DistanceMap = double*; WeightMap = boost::adj_list_edge_property_map, boost::edge_weight_t>; IndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>; Params = boost::bgl_named_params >; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/dijkstra_shortest_paths.hpp:570:31: required from ‘void boost::dijkstra_shortest_paths(const VertexListGraph&, typename graph_traits::vertex_descriptor, const bgl_named_params&) [with VertexListGraph = R_adjacency_list; Param = double*; Tag = vertex_distance_t; Rest = bgl_named_params; typename graph_traits::vertex_descriptor = long unsigned int]’ shortestPath.cpp:25:32: required from here /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::EqualityComparable::~EqualityComparable() [with TT = __gnu_cxx::__normal_iterator >]’ 37 | ~model() | ^ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:233:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 233 | BOOST_CONCEPT_USAGE(EqualityComparable) { | ^~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::InputIterator<__gnu_cxx::__normal_iterator > >]’: /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements > > >]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:512:7: required from ‘struct boost::InputIterator<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:540:3: required from ‘struct boost::ForwardIterator<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:568:3: required from ‘struct boost::BidirectionalIterator<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:597:3: required from ‘struct boost::RandomAccessIterator<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:597:3: [ skipping 3 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied > > >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_ > >)>’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/property_map/property_map.hpp:354:5: required from ‘boost::iterator_property_map boost::make_iterator_property_map(RAIter, ID, Value) [with RAIter = __gnu_cxx::__normal_iterator >; Value = double; ID = vec_adj_list_vertex_id_map, long unsigned int>]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/dijkstra_shortest_paths.hpp:556:43: required from ‘void boost::detail::dijkstra_dispatch1(const VertexListGraph&, typename boost::graph_traits::vertex_descriptor, DistanceMap, WeightMap, IndexMap, const Params&) [with VertexListGraph = R_adjacency_list; DistanceMap = double*; WeightMap = boost::adj_list_edge_property_map, boost::edge_weight_t>; IndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>; Params = boost::bgl_named_params >; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/dijkstra_shortest_paths.hpp:570:31: required from ‘void boost::dijkstra_shortest_paths(const VertexListGraph&, typename graph_traits::vertex_descriptor, const bgl_named_params&) [with VertexListGraph = R_adjacency_list; Param = double*; Tag = vertex_distance_t; Rest = bgl_named_params; typename graph_traits::vertex_descriptor = long unsigned int]’ shortestPath.cpp:25:32: required from here /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::InputIterator::~InputIterator() [with TT = __gnu_cxx::__normal_iterator >]’ 37 | ~model() | ^ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:512:7: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 512 | BOOST_CONCEPT_USAGE(InputIterator) | ^~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::ForwardIterator<__gnu_cxx::__normal_iterator > >]’: /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements > > >]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:543:7: required from ‘struct boost::ForwardIterator<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:568:3: required from ‘struct boost::BidirectionalIterator<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:597:3: required from ‘struct boost::RandomAccessIterator<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:597:3: required from ‘struct boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:32:62: [ skipping 2 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied > > >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_ > >)>’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/property_map/property_map.hpp:354:5: required from ‘boost::iterator_property_map boost::make_iterator_property_map(RAIter, ID, Value) [with RAIter = __gnu_cxx::__normal_iterator >; Value = double; ID = vec_adj_list_vertex_id_map, long unsigned int>]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/dijkstra_shortest_paths.hpp:556:43: required from ‘void boost::detail::dijkstra_dispatch1(const VertexListGraph&, typename boost::graph_traits::vertex_descriptor, DistanceMap, WeightMap, IndexMap, const Params&) [with VertexListGraph = R_adjacency_list; DistanceMap = double*; WeightMap = boost::adj_list_edge_property_map, boost::edge_weight_t>; IndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>; Params = boost::bgl_named_params >; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/dijkstra_shortest_paths.hpp:570:31: required from ‘void boost::dijkstra_shortest_paths(const VertexListGraph&, typename graph_traits::vertex_descriptor, const bgl_named_params&) [with VertexListGraph = R_adjacency_list; Param = double*; Tag = vertex_distance_t; Rest = bgl_named_params; typename graph_traits::vertex_descriptor = long unsigned int]’ shortestPath.cpp:25:32: required from here /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::ForwardIterator::~ForwardIterator() [with TT = __gnu_cxx::__normal_iterator >]’ 37 | ~model() | ^ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:543:7: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 543 | BOOST_CONCEPT_USAGE(ForwardIterator) | ^~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::BidirectionalIterator<__gnu_cxx::__normal_iterator > >]’: /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements > > >]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:571:7: required from ‘struct boost::BidirectionalIterator<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:597:3: required from ‘struct boost::RandomAccessIterator<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:597:3: required from ‘struct boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:32:62: [ skipping 2 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied > > >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_ > >)>’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/property_map/property_map.hpp:354:5: required from ‘boost::iterator_property_map boost::make_iterator_property_map(RAIter, ID, Value) [with RAIter = __gnu_cxx::__normal_iterator >; Value = double; ID = vec_adj_list_vertex_id_map, long unsigned int>]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/dijkstra_shortest_paths.hpp:556:43: required from ‘void boost::detail::dijkstra_dispatch1(const VertexListGraph&, typename boost::graph_traits::vertex_descriptor, DistanceMap, WeightMap, IndexMap, const Params&) [with VertexListGraph = R_adjacency_list; DistanceMap = double*; WeightMap = boost::adj_list_edge_property_map, boost::edge_weight_t>; IndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>; Params = boost::bgl_named_params >; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/dijkstra_shortest_paths.hpp:570:31: required from ‘void boost::dijkstra_shortest_paths(const VertexListGraph&, typename graph_traits::vertex_descriptor, const bgl_named_params&) [with VertexListGraph = R_adjacency_list; Param = double*; Tag = vertex_distance_t; Rest = bgl_named_params; typename graph_traits::vertex_descriptor = long unsigned int]’ shortestPath.cpp:25:32: required from here /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::BidirectionalIterator::~BidirectionalIterator() [with TT = __gnu_cxx::__normal_iterator >]’ 37 | ~model() | ^ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:571:7: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 571 | BOOST_CONCEPT_USAGE(BidirectionalIterator) | ^~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::Comparable<__gnu_cxx::__normal_iterator > >]’: /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements > > >]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:253:5: required from ‘struct boost::Comparable<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:597:3: required from ‘struct boost::RandomAccessIterator<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:597:3: required from ‘struct boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:32:62: [ skipping 2 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied > > >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_ > >)>’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/property_map/property_map.hpp:354:5: required from ‘boost::iterator_property_map boost::make_iterator_property_map(RAIter, ID, Value) [with RAIter = __gnu_cxx::__normal_iterator >; Value = double; ID = vec_adj_list_vertex_id_map, long unsigned int>]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/dijkstra_shortest_paths.hpp:556:43: required from ‘void boost::detail::dijkstra_dispatch1(const VertexListGraph&, typename boost::graph_traits::vertex_descriptor, DistanceMap, WeightMap, IndexMap, const Params&) [with VertexListGraph = R_adjacency_list; DistanceMap = double*; WeightMap = boost::adj_list_edge_property_map, boost::edge_weight_t>; IndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>; Params = boost::bgl_named_params >; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/dijkstra_shortest_paths.hpp:570:31: required from ‘void boost::dijkstra_shortest_paths(const VertexListGraph&, typename graph_traits::vertex_descriptor, const bgl_named_params&) [with VertexListGraph = R_adjacency_list; Param = double*; Tag = vertex_distance_t; Rest = bgl_named_params; typename graph_traits::vertex_descriptor = long unsigned int]’ shortestPath.cpp:25:32: required from here /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::Comparable::~Comparable() [with TT = __gnu_cxx::__normal_iterator >]’ 37 | ~model() | ^ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:253:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 253 | BOOST_CONCEPT_USAGE(Comparable) { | ^~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::RandomAccessIterator<__gnu_cxx::__normal_iterator > >]’: /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements > > >]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:601:7: required from ‘struct boost::RandomAccessIterator<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:597:3: required from ‘struct boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator > >]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied > > >::value’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied > > >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_ > >)>’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/property_map/property_map.hpp:354:5: required from ‘boost::iterator_property_map boost::make_iterator_property_map(RAIter, ID, Value) [with RAIter = __gnu_cxx::__normal_iterator >; Value = double; ID = vec_adj_list_vertex_id_map, long unsigned int>]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/dijkstra_shortest_paths.hpp:556:43: required from ‘void boost::detail::dijkstra_dispatch1(const VertexListGraph&, typename boost::graph_traits::vertex_descriptor, DistanceMap, WeightMap, IndexMap, const Params&) [with VertexListGraph = R_adjacency_list; DistanceMap = double*; WeightMap = boost::adj_list_edge_property_map, boost::edge_weight_t>; IndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>; Params = boost::bgl_named_params >; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/dijkstra_shortest_paths.hpp:570:31: required from ‘void boost::dijkstra_shortest_paths(const VertexListGraph&, typename graph_traits::vertex_descriptor, const bgl_named_params&) [with VertexListGraph = R_adjacency_list; Param = double*; Tag = vertex_distance_t; Rest = bgl_named_params; typename graph_traits::vertex_descriptor = long unsigned int]’ shortestPath.cpp:25:32: required from here /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::RandomAccessIterator::~RandomAccessIterator() [with TT = __gnu_cxx::__normal_iterator >]’ 37 | ~model() | ^ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:601:7: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 601 | BOOST_CONCEPT_USAGE(RandomAccessIterator) | ^~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::concepts::BasicMatrix, long unsigned int, double>]’: /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements, long unsigned int, double> >]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/graph_concepts.hpp:516:5: required from ‘struct boost::concepts::BasicMatrix, long unsigned int, double>’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/graph_concepts.hpp:514:1: required from ‘struct boost::concepts::BasicMatrixConcept, long unsigned int, double>’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::concepts::BasicMatrixConcept, long unsigned int, double>]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied, long unsigned int, double> >::value’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied, long unsigned int, double> >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_, long unsigned int, double>)>’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/johnson_all_pairs_shortest.hpp:46:5: required from ‘bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, VertexID, Weight, const BinaryPredicate&, const BinaryFunction&, const Infinity&, DistanceZero) [with VertexAndEdgeListGraph = R_adjacency_list; DistanceMatrix = Basic2DMatrix; VertexID = vec_adj_list_vertex_id_map, long unsigned int>; Weight = adj_list_edge_property_map, edge_weight_t>; BinaryPredicate = std::less; BinaryFunction = closed_plus; Infinity = double; DistanceZero = double]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/johnson_all_pairs_shortest.hpp:164:48: required from ‘bool boost::detail::johnson_dispatch(VertexAndEdgeListGraph&, DistanceMatrix&, const boost::bgl_named_params&, Weight, VertexID) [with VertexAndEdgeListGraph = R_adjacency_list; DistanceMatrix = Basic2DMatrix; P = int; T = int; R = boost::no_property; Weight = boost::adj_list_edge_property_map, boost::edge_weight_t>; VertexID = boost::vec_adj_list_vertex_id_map, long unsigned int>]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/johnson_all_pairs_shortest.hpp:192:36: required from ‘bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&) [with VertexAndEdgeListGraph = R_adjacency_list; DistanceMatrix = Basic2DMatrix]’ shortestPath.cpp:56:41: required from here /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::concepts::BasicMatrix::~BasicMatrix() [with M = Basic2DMatrix; I = long unsigned int; V = double]’ 37 | ~model() | ^ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/graph_concepts.hpp:516:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 516 | BOOST_CONCEPT_USAGE(BasicMatrix) | ^~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements, boost::property >, boost::no_property, boost::listS> > >]’: /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/graph_concepts.hpp:66:5: required from ‘struct boost::concepts::Graph, boost::property >, boost::no_property, boost::listS> >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/graph_concepts.hpp:226:1: required from ‘struct boost::concepts::EdgeListGraph, boost::property >, boost::no_property, boost::listS> >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/graph_concepts.hpp:226:1: required from ‘struct boost::concepts::EdgeListGraphConcept, boost::property >, boost::no_property, boost::listS> >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::concepts::EdgeListGraphConcept, boost::property >, boost::no_property, boost::listS> >]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:42:5: [ skipping 2 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_, boost::property >, boost::no_property, boost::listS> >)>’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/bellman_ford_shortest_paths.hpp:97:5: required from ‘bool boost::bellman_ford_shortest_paths(EdgeListGraph&, Size, WeightMap, PredecessorMap, DistanceMap, BinaryFunction, BinaryPredicate, BellmanFordVisitor) [with EdgeListGraph = adjacency_list, property >, no_property, listS>; Size = long unsigned int; WeightMap = adj_list_edge_property_map >, edge_weight_t>; PredecessorMap = dummy_property_map; DistanceMap = vec_adj_list_vertex_property_map, property >, no_property, listS>, adjacency_list, property >, no_property, listS>*, double, double&, vertex_distance_t>; BinaryFunction = closed_plus; BinaryPredicate = std::less; BellmanFordVisitor = bellman_visitor<>]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/johnson_all_pairs_shortest.hpp:112:36: required from ‘bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, VertexID, Weight, const BinaryPredicate&, const BinaryFunction&, const Infinity&, DistanceZero) [with VertexAndEdgeListGraph = R_adjacency_list; DistanceMatrix = Basic2DMatrix; VertexID = vec_adj_list_vertex_id_map, long unsigned int>; Weight = adj_list_edge_property_map, edge_weight_t>; BinaryPredicate = std::less; BinaryFunction = closed_plus; Infinity = double; DistanceZero = double]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/johnson_all_pairs_shortest.hpp:164:48: required from ‘bool boost::detail::johnson_dispatch(VertexAndEdgeListGraph&, DistanceMatrix&, const boost::bgl_named_params&, Weight, VertexID) [with VertexAndEdgeListGraph = R_adjacency_list; DistanceMatrix = Basic2DMatrix; P = int; T = int; R = boost::no_property; Weight = boost::adj_list_edge_property_map, boost::edge_weight_t>; VertexID = boost::vec_adj_list_vertex_id_map, long unsigned int>]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/johnson_all_pairs_shortest.hpp:192:36: required from ‘bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&) [with VertexAndEdgeListGraph = R_adjacency_list; DistanceMatrix = Basic2DMatrix]’ shortestPath.cpp:56:41: required from here /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::concepts::Graph, boost::property >, boost::no_property, boost::listS> >]’ 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ^ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements, boost::property >, boost::no_property, boost::listS> > >]’: /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/graph_concepts.hpp:233:5: required from ‘struct boost::concepts::EdgeListGraph, boost::property >, boost::no_property, boost::listS> >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/graph_concepts.hpp:226:1: required from ‘struct boost::concepts::EdgeListGraphConcept, boost::property >, boost::no_property, boost::listS> >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::concepts::EdgeListGraphConcept, boost::property >, boost::no_property, boost::listS> >]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied, boost::property >, boost::no_property, boost::listS> > >::value’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied, boost::property >, boost::no_property, boost::listS> > >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_, boost::property >, boost::no_property, boost::listS> >)>’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/bellman_ford_shortest_paths.hpp:97:5: required from ‘bool boost::bellman_ford_shortest_paths(EdgeListGraph&, Size, WeightMap, PredecessorMap, DistanceMap, BinaryFunction, BinaryPredicate, BellmanFordVisitor) [with EdgeListGraph = adjacency_list, property >, no_property, listS>; Size = long unsigned int; WeightMap = adj_list_edge_property_map >, edge_weight_t>; PredecessorMap = dummy_property_map; DistanceMap = vec_adj_list_vertex_property_map, property >, no_property, listS>, adjacency_list, property >, no_property, listS>*, double, double&, vertex_distance_t>; BinaryFunction = closed_plus; BinaryPredicate = std::less; BellmanFordVisitor = bellman_visitor<>]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/johnson_all_pairs_shortest.hpp:112:36: required from ‘bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, VertexID, Weight, const BinaryPredicate&, const BinaryFunction&, const Infinity&, DistanceZero) [with VertexAndEdgeListGraph = R_adjacency_list; DistanceMatrix = Basic2DMatrix; VertexID = vec_adj_list_vertex_id_map, long unsigned int>; Weight = adj_list_edge_property_map, edge_weight_t>; BinaryPredicate = std::less; BinaryFunction = closed_plus; Infinity = double; DistanceZero = double]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/johnson_all_pairs_shortest.hpp:164:48: required from ‘bool boost::detail::johnson_dispatch(VertexAndEdgeListGraph&, DistanceMatrix&, const boost::bgl_named_params&, Weight, VertexID) [with VertexAndEdgeListGraph = R_adjacency_list; DistanceMatrix = Basic2DMatrix; P = int; T = int; R = boost::no_property; Weight = boost::adj_list_edge_property_map, boost::edge_weight_t>; VertexID = boost::vec_adj_list_vertex_id_map, long unsigned int>]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/johnson_all_pairs_shortest.hpp:192:36: required from ‘bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&) [with VertexAndEdgeListGraph = R_adjacency_list; DistanceMatrix = Basic2DMatrix]’ shortestPath.cpp:56:41: required from here /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::concepts::EdgeListGraph, boost::property >, boost::no_property, boost::listS> >]’ 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ^ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::EdgeListGraphConcept, boost::property >, boost::no_property, boost::listS> >]’: /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/bellman_ford_shortest_paths.hpp:97:5: required from ‘bool boost::bellman_ford_shortest_paths(EdgeListGraph&, Size, WeightMap, PredecessorMap, DistanceMap, BinaryFunction, BinaryPredicate, BellmanFordVisitor) [with EdgeListGraph = adjacency_list, property >, no_property, listS>; Size = long unsigned int; WeightMap = adj_list_edge_property_map >, edge_weight_t>; PredecessorMap = dummy_property_map; DistanceMap = vec_adj_list_vertex_property_map, property >, no_property, listS>, adjacency_list, property >, no_property, listS>*, double, double&, vertex_distance_t>; BinaryFunction = closed_plus; BinaryPredicate = std::less; BellmanFordVisitor = bellman_visitor<>]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/johnson_all_pairs_shortest.hpp:112:36: required from ‘bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, VertexID, Weight, const BinaryPredicate&, const BinaryFunction&, const Infinity&, DistanceZero) [with VertexAndEdgeListGraph = R_adjacency_list; DistanceMatrix = Basic2DMatrix; VertexID = vec_adj_list_vertex_id_map, long unsigned int>; Weight = adj_list_edge_property_map, edge_weight_t>; BinaryPredicate = std::less; BinaryFunction = closed_plus; Infinity = double; DistanceZero = double]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/johnson_all_pairs_shortest.hpp:164:48: required from ‘bool boost::detail::johnson_dispatch(VertexAndEdgeListGraph&, DistanceMatrix&, const boost::bgl_named_params&, Weight, VertexID) [with VertexAndEdgeListGraph = R_adjacency_list; DistanceMatrix = Basic2DMatrix; P = int; T = int; R = boost::no_property; Weight = boost::adj_list_edge_property_map, boost::edge_weight_t>; VertexID = boost::vec_adj_list_vertex_id_map, long unsigned int>]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/johnson_all_pairs_shortest.hpp:192:36: required from ‘bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&) [with VertexAndEdgeListGraph = R_adjacency_list; DistanceMatrix = Basic2DMatrix]’ shortestPath.cpp:56:41: required from here /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/graph_concepts.hpp:226:15: note: in a call to non-static member function ‘boost::concepts::EdgeListGraphConcept, boost::property >, boost::no_property, boost::listS> >::~EdgeListGraphConcept()’ 226 | BOOST_concept(EdgeListGraph, (G)) : Graph< G > | ^~~~~~~~~~~~~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/preprocessor/cat.hpp:29:34: note: in definition of macro ‘BOOST_PP_CAT_I’ 29 | # define BOOST_PP_CAT_I(a, b) a ## b | ^ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/concept_def.hpp:23:12: note: in expansion of macro ‘BOOST_PP_CAT’ 23 | struct BOOST_PP_CAT(name,Concept) \ | ^~~~~~~~~~~~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/graph_concepts.hpp:226:1: note: in expansion of macro ‘BOOST_concept’ 226 | BOOST_concept(EdgeListGraph, (G)) : Graph< G > | ^~~~~~~~~~~~~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::constraint::failed() [with Model = boost::ReadWritePropertyMapConcept, boost::property >, boost::no_property, boost::listS>, boost::adjacency_list, boost::property >, boost::no_property, boost::listS>*, double, double&, boost::vertex_distance_t>, long unsigned int>]’: /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/bellman_ford_shortest_paths.hpp:101:5: required from ‘bool boost::bellman_ford_shortest_paths(EdgeListGraph&, Size, WeightMap, PredecessorMap, DistanceMap, BinaryFunction, BinaryPredicate, BellmanFordVisitor) [with EdgeListGraph = adjacency_list, property >, no_property, listS>; Size = long unsigned int; WeightMap = adj_list_edge_property_map >, edge_weight_t>; PredecessorMap = dummy_property_map; DistanceMap = vec_adj_list_vertex_property_map, property >, no_property, listS>, adjacency_list, property >, no_property, listS>*, double, double&, vertex_distance_t>; BinaryFunction = closed_plus; BinaryPredicate = std::less; BellmanFordVisitor = bellman_visitor<>]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/johnson_all_pairs_shortest.hpp:112:36: required from ‘bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, VertexID, Weight, const BinaryPredicate&, const BinaryFunction&, const Infinity&, DistanceZero) [with VertexAndEdgeListGraph = R_adjacency_list; DistanceMatrix = Basic2DMatrix; VertexID = vec_adj_list_vertex_id_map, long unsigned int>; Weight = adj_list_edge_property_map, edge_weight_t>; BinaryPredicate = std::less; BinaryFunction = closed_plus; Infinity = double; DistanceZero = double]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/johnson_all_pairs_shortest.hpp:164:48: required from ‘bool boost::detail::johnson_dispatch(VertexAndEdgeListGraph&, DistanceMatrix&, const boost::bgl_named_params&, Weight, VertexID) [with VertexAndEdgeListGraph = R_adjacency_list; DistanceMatrix = Basic2DMatrix; P = int; T = int; R = boost::no_property; Weight = boost::adj_list_edge_property_map, boost::edge_weight_t>; VertexID = boost::vec_adj_list_vertex_id_map, long unsigned int>]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/johnson_all_pairs_shortest.hpp:192:36: required from ‘bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&) [with VertexAndEdgeListGraph = R_adjacency_list; DistanceMatrix = Basic2DMatrix]’ shortestPath.cpp:56:41: required from here /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:65:52: warning: ‘this’ pointer is null [-Wnonnull] 65 | static void failed() { ((Model*)0)->constraints(); } | ~~~~~~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/property_map/property_map.hpp:205:10: note: in a call to non-static member function ‘void boost::ReadWritePropertyMapConcept::constraints() [with PMap = boost::vec_adj_list_vertex_property_map, boost::property >, boost::no_property, boost::listS>, boost::adjacency_list, boost::property >, boost::no_property, boost::listS>*, double, double&, boost::vertex_distance_t>; Key = long unsigned int]’ 205 | void constraints() { | ^~~~~~~~~~~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::constraint::failed() [with Model = boost::ReadablePropertyMapConcept >, boost::edge_weight_t>, boost::detail::edge_desc_impl >]’: /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/bellman_ford_shortest_paths.hpp:102:5: required from ‘bool boost::bellman_ford_shortest_paths(EdgeListGraph&, Size, WeightMap, PredecessorMap, DistanceMap, BinaryFunction, BinaryPredicate, BellmanFordVisitor) [with EdgeListGraph = adjacency_list, property >, no_property, listS>; Size = long unsigned int; WeightMap = adj_list_edge_property_map >, edge_weight_t>; PredecessorMap = dummy_property_map; DistanceMap = vec_adj_list_vertex_property_map, property >, no_property, listS>, adjacency_list, property >, no_property, listS>*, double, double&, vertex_distance_t>; BinaryFunction = closed_plus; BinaryPredicate = std::less; BellmanFordVisitor = bellman_visitor<>]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/johnson_all_pairs_shortest.hpp:112:36: required from ‘bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, VertexID, Weight, const BinaryPredicate&, const BinaryFunction&, const Infinity&, DistanceZero) [with VertexAndEdgeListGraph = R_adjacency_list; DistanceMatrix = Basic2DMatrix; VertexID = vec_adj_list_vertex_id_map, long unsigned int>; Weight = adj_list_edge_property_map, edge_weight_t>; BinaryPredicate = std::less; BinaryFunction = closed_plus; Infinity = double; DistanceZero = double]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/johnson_all_pairs_shortest.hpp:164:48: required from ‘bool boost::detail::johnson_dispatch(VertexAndEdgeListGraph&, DistanceMatrix&, const boost::bgl_named_params&, Weight, VertexID) [with VertexAndEdgeListGraph = R_adjacency_list; DistanceMatrix = Basic2DMatrix; P = int; T = int; R = boost::no_property; Weight = boost::adj_list_edge_property_map, boost::edge_weight_t>; VertexID = boost::vec_adj_list_vertex_id_map, long unsigned int>]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/johnson_all_pairs_shortest.hpp:192:36: required from ‘bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&) [with VertexAndEdgeListGraph = R_adjacency_list; DistanceMatrix = Basic2DMatrix]’ shortestPath.cpp:56:41: required from here /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:65:52: warning: ‘this’ pointer is null [-Wnonnull] 65 | static void failed() { ((Model*)0)->constraints(); } | ~~~~~~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/property_map/property_map.hpp:147:10: note: in a call to non-static member function ‘void boost::ReadablePropertyMapConcept::constraints() [with PMap = boost::adj_list_edge_property_map >, boost::edge_weight_t>; Key = boost::detail::edge_desc_impl]’ 147 | void constraints() { | ^~~~~~~~~~~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements > > >]’: /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/graph_concepts.hpp:66:5: required from ‘struct boost::concepts::Graph > >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/graph_concepts.hpp:226:1: required from ‘struct boost::concepts::EdgeListGraph > >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/graph_concepts.hpp:226:1: required from ‘struct boost::concepts::EdgeListGraphConcept > >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::concepts::EdgeListGraphConcept > >]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:42:5: [ skipping 2 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_ > >)>’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/bellman_ford_shortest_paths.hpp:97:5: required from ‘bool boost::bellman_ford_shortest_paths(EdgeListGraph&, Size, WeightMap, PredecessorMap, DistanceMap, BinaryFunction, BinaryPredicate, BellmanFordVisitor) [with EdgeListGraph = adjacency_list >; Size = int; WeightMap = adj_list_edge_property_map, edge_weight_t>; PredecessorMap = long unsigned int*; DistanceMap = double*; BinaryFunction = closed_plus; BinaryPredicate = std::less; BellmanFordVisitor = bellman_visitor<>]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/bellman_ford_shortest_paths.hpp:176:43: required from ‘bool boost::detail::bellman_dispatch2(VertexAndEdgeListGraph&, boost::param_not_found, Size, WeightMap, PredecessorMap, DistanceMap, const boost::bgl_named_params&) [with VertexAndEdgeListGraph = boost::adjacency_list >; Size = int; WeightMap = boost::adj_list_edge_property_map, boost::edge_weight_t>; PredecessorMap = long unsigned int*; DistanceMap = double*; P = double*; T = boost::vertex_distance_t; R = boost::bgl_named_params, boost::edge_weight_t>, boost::edge_weight_t, boost::no_property> >]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/bellman_ford_shortest_paths.hpp:190:41: required from ‘bool boost::detail::bellman_dispatch(EdgeListGraph&, Size, WeightMap, DistanceMap, const boost::bgl_named_params&) [with EdgeListGraph = boost::adjacency_list >; Size = int; WeightMap = boost::adj_list_edge_property_map, boost::edge_weight_t>; DistanceMap = double*; P = double*; T = boost::vertex_distance_t; R = boost::bgl_named_params, boost::edge_weight_t>, boost::edge_weight_t, boost::no_property> >]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/bellman_ford_shortest_paths.hpp:201:36: required from ‘bool boost::bellman_ford_shortest_paths(EdgeListGraph&, Size, const bgl_named_params&) [with EdgeListGraph = adjacency_list >; Size = int; P = double*; T = vertex_distance_t; R = bgl_named_params, edge_weight_t>, edge_weight_t, no_property> >]’ shortestPath.cpp:105:45: required from here /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::concepts::Graph > >]’ 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ^ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements > > >]’: /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/graph_concepts.hpp:233:5: required from ‘struct boost::concepts::EdgeListGraph > >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/graph_concepts.hpp:226:1: required from ‘struct boost::concepts::EdgeListGraphConcept > >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::concepts::EdgeListGraphConcept > >]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied > > >::value’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied > > >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_ > >)>’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/bellman_ford_shortest_paths.hpp:97:5: required from ‘bool boost::bellman_ford_shortest_paths(EdgeListGraph&, Size, WeightMap, PredecessorMap, DistanceMap, BinaryFunction, BinaryPredicate, BellmanFordVisitor) [with EdgeListGraph = adjacency_list >; Size = int; WeightMap = adj_list_edge_property_map, edge_weight_t>; PredecessorMap = long unsigned int*; DistanceMap = double*; BinaryFunction = closed_plus; BinaryPredicate = std::less; BellmanFordVisitor = bellman_visitor<>]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/bellman_ford_shortest_paths.hpp:176:43: required from ‘bool boost::detail::bellman_dispatch2(VertexAndEdgeListGraph&, boost::param_not_found, Size, WeightMap, PredecessorMap, DistanceMap, const boost::bgl_named_params&) [with VertexAndEdgeListGraph = boost::adjacency_list >; Size = int; WeightMap = boost::adj_list_edge_property_map, boost::edge_weight_t>; PredecessorMap = long unsigned int*; DistanceMap = double*; P = double*; T = boost::vertex_distance_t; R = boost::bgl_named_params, boost::edge_weight_t>, boost::edge_weight_t, boost::no_property> >]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/bellman_ford_shortest_paths.hpp:190:41: required from ‘bool boost::detail::bellman_dispatch(EdgeListGraph&, Size, WeightMap, DistanceMap, const boost::bgl_named_params&) [with EdgeListGraph = boost::adjacency_list >; Size = int; WeightMap = boost::adj_list_edge_property_map, boost::edge_weight_t>; DistanceMap = double*; P = double*; T = boost::vertex_distance_t; R = boost::bgl_named_params, boost::edge_weight_t>, boost::edge_weight_t, boost::no_property> >]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/bellman_ford_shortest_paths.hpp:201:36: required from ‘bool boost::bellman_ford_shortest_paths(EdgeListGraph&, Size, const bgl_named_params&) [with EdgeListGraph = adjacency_list >; Size = int; P = double*; T = vertex_distance_t; R = bgl_named_params, edge_weight_t>, edge_weight_t, no_property> >]’ shortestPath.cpp:105:45: required from here /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::concepts::EdgeListGraph > >]’ 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ^ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::EdgeListGraphConcept > >]’: /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/bellman_ford_shortest_paths.hpp:97:5: required from ‘bool boost::bellman_ford_shortest_paths(EdgeListGraph&, Size, WeightMap, PredecessorMap, DistanceMap, BinaryFunction, BinaryPredicate, BellmanFordVisitor) [with EdgeListGraph = adjacency_list >; Size = int; WeightMap = adj_list_edge_property_map, edge_weight_t>; PredecessorMap = long unsigned int*; DistanceMap = double*; BinaryFunction = closed_plus; BinaryPredicate = std::less; BellmanFordVisitor = bellman_visitor<>]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/bellman_ford_shortest_paths.hpp:176:43: required from ‘bool boost::detail::bellman_dispatch2(VertexAndEdgeListGraph&, boost::param_not_found, Size, WeightMap, PredecessorMap, DistanceMap, const boost::bgl_named_params&) [with VertexAndEdgeListGraph = boost::adjacency_list >; Size = int; WeightMap = boost::adj_list_edge_property_map, boost::edge_weight_t>; PredecessorMap = long unsigned int*; DistanceMap = double*; P = double*; T = boost::vertex_distance_t; R = boost::bgl_named_params, boost::edge_weight_t>, boost::edge_weight_t, boost::no_property> >]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/bellman_ford_shortest_paths.hpp:190:41: required from ‘bool boost::detail::bellman_dispatch(EdgeListGraph&, Size, WeightMap, DistanceMap, const boost::bgl_named_params&) [with EdgeListGraph = boost::adjacency_list >; Size = int; WeightMap = boost::adj_list_edge_property_map, boost::edge_weight_t>; DistanceMap = double*; P = double*; T = boost::vertex_distance_t; R = boost::bgl_named_params, boost::edge_weight_t>, boost::edge_weight_t, boost::no_property> >]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/bellman_ford_shortest_paths.hpp:201:36: required from ‘bool boost::bellman_ford_shortest_paths(EdgeListGraph&, Size, const bgl_named_params&) [with EdgeListGraph = adjacency_list >; Size = int; P = double*; T = vertex_distance_t; R = bgl_named_params, edge_weight_t>, edge_weight_t, no_property> >]’ shortestPath.cpp:105:45: required from here /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/graph_concepts.hpp:226:15: note: in a call to non-static member function ‘boost::concepts::EdgeListGraphConcept > >::~EdgeListGraphConcept()’ 226 | BOOST_concept(EdgeListGraph, (G)) : Graph< G > | ^~~~~~~~~~~~~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/preprocessor/cat.hpp:29:34: note: in definition of macro ‘BOOST_PP_CAT_I’ 29 | # define BOOST_PP_CAT_I(a, b) a ## b | ^ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/concept_def.hpp:23:12: note: in expansion of macro ‘BOOST_PP_CAT’ 23 | struct BOOST_PP_CAT(name,Concept) \ | ^~~~~~~~~~~~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/graph_concepts.hpp:226:1: note: in expansion of macro ‘BOOST_concept’ 226 | BOOST_concept(EdgeListGraph, (G)) : Graph< G > | ^~~~~~~~~~~~~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::constraint::failed() [with Model = boost::ReadWritePropertyMapConcept]’: /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/bellman_ford_shortest_paths.hpp:101:5: required from ‘bool boost::bellman_ford_shortest_paths(EdgeListGraph&, Size, WeightMap, PredecessorMap, DistanceMap, BinaryFunction, BinaryPredicate, BellmanFordVisitor) [with EdgeListGraph = adjacency_list >; Size = int; WeightMap = adj_list_edge_property_map, edge_weight_t>; PredecessorMap = long unsigned int*; DistanceMap = double*; BinaryFunction = closed_plus; BinaryPredicate = std::less; BellmanFordVisitor = bellman_visitor<>]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/bellman_ford_shortest_paths.hpp:176:43: required from ‘bool boost::detail::bellman_dispatch2(VertexAndEdgeListGraph&, boost::param_not_found, Size, WeightMap, PredecessorMap, DistanceMap, const boost::bgl_named_params&) [with VertexAndEdgeListGraph = boost::adjacency_list >; Size = int; WeightMap = boost::adj_list_edge_property_map, boost::edge_weight_t>; PredecessorMap = long unsigned int*; DistanceMap = double*; P = double*; T = boost::vertex_distance_t; R = boost::bgl_named_params, boost::edge_weight_t>, boost::edge_weight_t, boost::no_property> >]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/bellman_ford_shortest_paths.hpp:190:41: required from ‘bool boost::detail::bellman_dispatch(EdgeListGraph&, Size, WeightMap, DistanceMap, const boost::bgl_named_params&) [with EdgeListGraph = boost::adjacency_list >; Size = int; WeightMap = boost::adj_list_edge_property_map, boost::edge_weight_t>; DistanceMap = double*; P = double*; T = boost::vertex_distance_t; R = boost::bgl_named_params, boost::edge_weight_t>, boost::edge_weight_t, boost::no_property> >]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/bellman_ford_shortest_paths.hpp:201:36: required from ‘bool boost::bellman_ford_shortest_paths(EdgeListGraph&, Size, const bgl_named_params&) [with EdgeListGraph = adjacency_list >; Size = int; P = double*; T = vertex_distance_t; R = bgl_named_params, edge_weight_t>, edge_weight_t, no_property> >]’ shortestPath.cpp:105:45: required from here /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:65:52: warning: ‘this’ pointer is null [-Wnonnull] 65 | static void failed() { ((Model*)0)->constraints(); } | ~~~~~~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/property_map/property_map.hpp:205:10: note: in a call to non-static member function ‘void boost::ReadWritePropertyMapConcept::constraints() [with PMap = double*; Key = long unsigned int]’ 205 | void constraints() { | ^~~~~~~~~~~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::constraint::failed() [with Model = boost::ReadablePropertyMapConcept, boost::edge_weight_t>, boost::detail::edge_desc_impl >]’: /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/bellman_ford_shortest_paths.hpp:102:5: required from ‘bool boost::bellman_ford_shortest_paths(EdgeListGraph&, Size, WeightMap, PredecessorMap, DistanceMap, BinaryFunction, BinaryPredicate, BellmanFordVisitor) [with EdgeListGraph = adjacency_list >; Size = int; WeightMap = adj_list_edge_property_map, edge_weight_t>; PredecessorMap = long unsigned int*; DistanceMap = double*; BinaryFunction = closed_plus; BinaryPredicate = std::less; BellmanFordVisitor = bellman_visitor<>]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/bellman_ford_shortest_paths.hpp:176:43: required from ‘bool boost::detail::bellman_dispatch2(VertexAndEdgeListGraph&, boost::param_not_found, Size, WeightMap, PredecessorMap, DistanceMap, const boost::bgl_named_params&) [with VertexAndEdgeListGraph = boost::adjacency_list >; Size = int; WeightMap = boost::adj_list_edge_property_map, boost::edge_weight_t>; PredecessorMap = long unsigned int*; DistanceMap = double*; P = double*; T = boost::vertex_distance_t; R = boost::bgl_named_params, boost::edge_weight_t>, boost::edge_weight_t, boost::no_property> >]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/bellman_ford_shortest_paths.hpp:190:41: required from ‘bool boost::detail::bellman_dispatch(EdgeListGraph&, Size, WeightMap, DistanceMap, const boost::bgl_named_params&) [with EdgeListGraph = boost::adjacency_list >; Size = int; WeightMap = boost::adj_list_edge_property_map, boost::edge_weight_t>; DistanceMap = double*; P = double*; T = boost::vertex_distance_t; R = boost::bgl_named_params, boost::edge_weight_t>, boost::edge_weight_t, boost::no_property> >]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/bellman_ford_shortest_paths.hpp:201:36: required from ‘bool boost::bellman_ford_shortest_paths(EdgeListGraph&, Size, const bgl_named_params&) [with EdgeListGraph = adjacency_list >; Size = int; P = double*; T = vertex_distance_t; R = bgl_named_params, edge_weight_t>, edge_weight_t, no_property> >]’ shortestPath.cpp:105:45: required from here /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:65:52: warning: ‘this’ pointer is null [-Wnonnull] 65 | static void failed() { ((Model*)0)->constraints(); } | ~~~~~~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/property_map/property_map.hpp:147:10: note: in a call to non-static member function ‘void boost::ReadablePropertyMapConcept::constraints() [with PMap = boost::adj_list_edge_property_map, boost::edge_weight_t>; Key = boost::detail::edge_desc_impl]’ 147 | void constraints() { | ^~~~~~~~~~~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::Assignable<__gnu_cxx::__normal_iterator > >]’: /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements > > >]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:145:5: required from ‘struct boost::Assignable<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:502:3: required from ‘struct boost::InputIterator<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:540:3: required from ‘struct boost::ForwardIterator<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:568:3: required from ‘struct boost::BidirectionalIterator<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:597:3: [ skipping 4 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied > > >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_ > >)>’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/property_map/property_map.hpp:354:5: required from ‘boost::iterator_property_map boost::make_iterator_property_map(RAIter, ID, Value) [with RAIter = __gnu_cxx::__normal_iterator >; Value = default_color_type; ID = vec_adj_list_vertex_id_map, long unsigned int>]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/dag_shortest_paths.hpp:120:43: required from ‘void boost::detail::dag_sp_dispatch1(const VertexListGraph&, typename boost::graph_traits::vertex_descriptor, DistanceMap, WeightMap, ColorMap, IndexMap, DijkstraVisitor, const Params&) [with VertexListGraph = R_adjacency_list; DijkstraVisitor = boost::dijkstra_visitor<>; DistanceMap = double*; WeightMap = boost::adj_list_edge_property_map, boost::edge_weight_t>; ColorMap = boost::param_not_found; IndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>; Params = boost::bgl_named_params >; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/dag_shortest_paths.hpp:134:29: required from ‘void boost::dag_shortest_paths(const VertexListGraph&, typename graph_traits::vertex_descriptor, const bgl_named_params&) [with VertexListGraph = R_adjacency_list; Param = double*; Tag = vertex_distance_t; Rest = bgl_named_params; typename graph_traits::vertex_descriptor = long unsigned int]’ shortestPath.cpp:144:27: required from here /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::Assignable::~Assignable() [with TT = __gnu_cxx::__normal_iterator >]’ 37 | ~model() | ^ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:145:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 145 | BOOST_CONCEPT_USAGE(Assignable) { | ^~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::EqualityComparable<__gnu_cxx::__normal_iterator > >]’: /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements > > >]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:233:5: required from ‘struct boost::EqualityComparable<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:502:3: required from ‘struct boost::InputIterator<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:540:3: required from ‘struct boost::ForwardIterator<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:568:3: required from ‘struct boost::BidirectionalIterator<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:597:3: [ skipping 4 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied > > >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_ > >)>’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/property_map/property_map.hpp:354:5: required from ‘boost::iterator_property_map boost::make_iterator_property_map(RAIter, ID, Value) [with RAIter = __gnu_cxx::__normal_iterator >; Value = default_color_type; ID = vec_adj_list_vertex_id_map, long unsigned int>]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/dag_shortest_paths.hpp:120:43: required from ‘void boost::detail::dag_sp_dispatch1(const VertexListGraph&, typename boost::graph_traits::vertex_descriptor, DistanceMap, WeightMap, ColorMap, IndexMap, DijkstraVisitor, const Params&) [with VertexListGraph = R_adjacency_list; DijkstraVisitor = boost::dijkstra_visitor<>; DistanceMap = double*; WeightMap = boost::adj_list_edge_property_map, boost::edge_weight_t>; ColorMap = boost::param_not_found; IndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>; Params = boost::bgl_named_params >; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/dag_shortest_paths.hpp:134:29: required from ‘void boost::dag_shortest_paths(const VertexListGraph&, typename graph_traits::vertex_descriptor, const bgl_named_params&) [with VertexListGraph = R_adjacency_list; Param = double*; Tag = vertex_distance_t; Rest = bgl_named_params; typename graph_traits::vertex_descriptor = long unsigned int]’ shortestPath.cpp:144:27: required from here /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::EqualityComparable::~EqualityComparable() [with TT = __gnu_cxx::__normal_iterator >]’ 37 | ~model() | ^ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:233:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 233 | BOOST_CONCEPT_USAGE(EqualityComparable) { | ^~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::InputIterator<__gnu_cxx::__normal_iterator > >]’: /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements > > >]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:512:7: required from ‘struct boost::InputIterator<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:540:3: required from ‘struct boost::ForwardIterator<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:568:3: required from ‘struct boost::BidirectionalIterator<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:597:3: required from ‘struct boost::RandomAccessIterator<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:597:3: [ skipping 3 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied > > >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_ > >)>’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/property_map/property_map.hpp:354:5: required from ‘boost::iterator_property_map boost::make_iterator_property_map(RAIter, ID, Value) [with RAIter = __gnu_cxx::__normal_iterator >; Value = default_color_type; ID = vec_adj_list_vertex_id_map, long unsigned int>]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/dag_shortest_paths.hpp:120:43: required from ‘void boost::detail::dag_sp_dispatch1(const VertexListGraph&, typename boost::graph_traits::vertex_descriptor, DistanceMap, WeightMap, ColorMap, IndexMap, DijkstraVisitor, const Params&) [with VertexListGraph = R_adjacency_list; DijkstraVisitor = boost::dijkstra_visitor<>; DistanceMap = double*; WeightMap = boost::adj_list_edge_property_map, boost::edge_weight_t>; ColorMap = boost::param_not_found; IndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>; Params = boost::bgl_named_params >; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/dag_shortest_paths.hpp:134:29: required from ‘void boost::dag_shortest_paths(const VertexListGraph&, typename graph_traits::vertex_descriptor, const bgl_named_params&) [with VertexListGraph = R_adjacency_list; Param = double*; Tag = vertex_distance_t; Rest = bgl_named_params; typename graph_traits::vertex_descriptor = long unsigned int]’ shortestPath.cpp:144:27: required from here /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::InputIterator::~InputIterator() [with TT = __gnu_cxx::__normal_iterator >]’ 37 | ~model() | ^ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:512:7: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 512 | BOOST_CONCEPT_USAGE(InputIterator) | ^~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::ForwardIterator<__gnu_cxx::__normal_iterator > >]’: /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements > > >]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:543:7: required from ‘struct boost::ForwardIterator<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:568:3: required from ‘struct boost::BidirectionalIterator<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:597:3: required from ‘struct boost::RandomAccessIterator<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:597:3: required from ‘struct boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:32:62: [ skipping 2 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied > > >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_ > >)>’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/property_map/property_map.hpp:354:5: required from ‘boost::iterator_property_map boost::make_iterator_property_map(RAIter, ID, Value) [with RAIter = __gnu_cxx::__normal_iterator >; Value = default_color_type; ID = vec_adj_list_vertex_id_map, long unsigned int>]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/dag_shortest_paths.hpp:120:43: required from ‘void boost::detail::dag_sp_dispatch1(const VertexListGraph&, typename boost::graph_traits::vertex_descriptor, DistanceMap, WeightMap, ColorMap, IndexMap, DijkstraVisitor, const Params&) [with VertexListGraph = R_adjacency_list; DijkstraVisitor = boost::dijkstra_visitor<>; DistanceMap = double*; WeightMap = boost::adj_list_edge_property_map, boost::edge_weight_t>; ColorMap = boost::param_not_found; IndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>; Params = boost::bgl_named_params >; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/dag_shortest_paths.hpp:134:29: required from ‘void boost::dag_shortest_paths(const VertexListGraph&, typename graph_traits::vertex_descriptor, const bgl_named_params&) [with VertexListGraph = R_adjacency_list; Param = double*; Tag = vertex_distance_t; Rest = bgl_named_params; typename graph_traits::vertex_descriptor = long unsigned int]’ shortestPath.cpp:144:27: required from here /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::ForwardIterator::~ForwardIterator() [with TT = __gnu_cxx::__normal_iterator >]’ 37 | ~model() | ^ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:543:7: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 543 | BOOST_CONCEPT_USAGE(ForwardIterator) | ^~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::BidirectionalIterator<__gnu_cxx::__normal_iterator > >]’: /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements > > >]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:571:7: required from ‘struct boost::BidirectionalIterator<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:597:3: required from ‘struct boost::RandomAccessIterator<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:597:3: required from ‘struct boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:32:62: [ skipping 2 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied > > >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_ > >)>’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/property_map/property_map.hpp:354:5: required from ‘boost::iterator_property_map boost::make_iterator_property_map(RAIter, ID, Value) [with RAIter = __gnu_cxx::__normal_iterator >; Value = default_color_type; ID = vec_adj_list_vertex_id_map, long unsigned int>]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/dag_shortest_paths.hpp:120:43: required from ‘void boost::detail::dag_sp_dispatch1(const VertexListGraph&, typename boost::graph_traits::vertex_descriptor, DistanceMap, WeightMap, ColorMap, IndexMap, DijkstraVisitor, const Params&) [with VertexListGraph = R_adjacency_list; DijkstraVisitor = boost::dijkstra_visitor<>; DistanceMap = double*; WeightMap = boost::adj_list_edge_property_map, boost::edge_weight_t>; ColorMap = boost::param_not_found; IndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>; Params = boost::bgl_named_params >; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/dag_shortest_paths.hpp:134:29: required from ‘void boost::dag_shortest_paths(const VertexListGraph&, typename graph_traits::vertex_descriptor, const bgl_named_params&) [with VertexListGraph = R_adjacency_list; Param = double*; Tag = vertex_distance_t; Rest = bgl_named_params; typename graph_traits::vertex_descriptor = long unsigned int]’ shortestPath.cpp:144:27: required from here /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::BidirectionalIterator::~BidirectionalIterator() [with TT = __gnu_cxx::__normal_iterator >]’ 37 | ~model() | ^ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:571:7: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 571 | BOOST_CONCEPT_USAGE(BidirectionalIterator) | ^~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::Comparable<__gnu_cxx::__normal_iterator > >]’: /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements > > >]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:253:5: required from ‘struct boost::Comparable<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:597:3: required from ‘struct boost::RandomAccessIterator<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:597:3: required from ‘struct boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:32:62: [ skipping 2 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied > > >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_ > >)>’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/property_map/property_map.hpp:354:5: required from ‘boost::iterator_property_map boost::make_iterator_property_map(RAIter, ID, Value) [with RAIter = __gnu_cxx::__normal_iterator >; Value = default_color_type; ID = vec_adj_list_vertex_id_map, long unsigned int>]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/dag_shortest_paths.hpp:120:43: required from ‘void boost::detail::dag_sp_dispatch1(const VertexListGraph&, typename boost::graph_traits::vertex_descriptor, DistanceMap, WeightMap, ColorMap, IndexMap, DijkstraVisitor, const Params&) [with VertexListGraph = R_adjacency_list; DijkstraVisitor = boost::dijkstra_visitor<>; DistanceMap = double*; WeightMap = boost::adj_list_edge_property_map, boost::edge_weight_t>; ColorMap = boost::param_not_found; IndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>; Params = boost::bgl_named_params >; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/dag_shortest_paths.hpp:134:29: required from ‘void boost::dag_shortest_paths(const VertexListGraph&, typename graph_traits::vertex_descriptor, const bgl_named_params&) [with VertexListGraph = R_adjacency_list; Param = double*; Tag = vertex_distance_t; Rest = bgl_named_params; typename graph_traits::vertex_descriptor = long unsigned int]’ shortestPath.cpp:144:27: required from here /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::Comparable::~Comparable() [with TT = __gnu_cxx::__normal_iterator >]’ 37 | ~model() | ^ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:253:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 253 | BOOST_CONCEPT_USAGE(Comparable) { | ^~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::RandomAccessIterator<__gnu_cxx::__normal_iterator > >]’: /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements > > >]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:601:7: required from ‘struct boost::RandomAccessIterator<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:597:3: required from ‘struct boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator > >]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied > > >::value’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied > > >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_ > >)>’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/property_map/property_map.hpp:354:5: required from ‘boost::iterator_property_map boost::make_iterator_property_map(RAIter, ID, Value) [with RAIter = __gnu_cxx::__normal_iterator >; Value = default_color_type; ID = vec_adj_list_vertex_id_map, long unsigned int>]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/dag_shortest_paths.hpp:120:43: required from ‘void boost::detail::dag_sp_dispatch1(const VertexListGraph&, typename boost::graph_traits::vertex_descriptor, DistanceMap, WeightMap, ColorMap, IndexMap, DijkstraVisitor, const Params&) [with VertexListGraph = R_adjacency_list; DijkstraVisitor = boost::dijkstra_visitor<>; DistanceMap = double*; WeightMap = boost::adj_list_edge_property_map, boost::edge_weight_t>; ColorMap = boost::param_not_found; IndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>; Params = boost::bgl_named_params >; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/dag_shortest_paths.hpp:134:29: required from ‘void boost::dag_shortest_paths(const VertexListGraph&, typename graph_traits::vertex_descriptor, const bgl_named_params&) [with VertexListGraph = R_adjacency_list; Param = double*; Tag = vertex_distance_t; Rest = bgl_named_params; typename graph_traits::vertex_descriptor = long unsigned int]’ shortestPath.cpp:144:27: required from here /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::RandomAccessIterator::~RandomAccessIterator() [with TT = __gnu_cxx::__normal_iterator >]’ 37 | ~model() | ^ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:601:7: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 601 | BOOST_CONCEPT_USAGE(RandomAccessIterator) | ^~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::concepts::Graph >]’: /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements > >]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/graph_concepts.hpp:66:5: required from ‘struct boost::concepts::Graph >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/graph_concepts.hpp:176:1: required from ‘struct boost::concepts::VertexListGraph >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/graph_concepts.hpp:176:1: required from ‘struct boost::concepts::VertexListGraphConcept >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:32:62: [ skipping 2 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied > >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_ >)>’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/bellman_ford_shortest_paths.hpp:218:5: required from ‘bool boost::floyd_warshall_all_pairs_shortest_paths(const VertexAndEdgeListGraph&, DistanceMatrix&, const WeightMap&, const BinaryPredicate&, const BinaryFunction&, const Infinity&, const Zero&) [with VertexAndEdgeListGraph = R_adjacency_list; DistanceMatrix = Basic2DMatrix; WeightMap = adj_list_edge_property_map, edge_weight_t>; BinaryPredicate = std::less; BinaryFunction = closed_plus; Infinity = double; Zero = double]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/floyd_warshall_shortest.hpp:172:55: required from ‘bool boost::detail::floyd_warshall_noninit_dispatch(const VertexAndEdgeListGraph&, DistanceMatrix&, WeightMap, const boost::bgl_named_params&) [with VertexAndEdgeListGraph = R_adjacency_list; DistanceMatrix = Basic2DMatrix; WeightMap = boost::adj_list_edge_property_map, boost::edge_weight_t>; P = int; T = int; R = boost::no_property]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/floyd_warshall_shortest.hpp:217:51: required from ‘bool boost::floyd_warshall_all_pairs_shortest_paths(const VertexAndEdgeListGraph&, DistanceMatrix&) [with VertexAndEdgeListGraph = R_adjacency_list; DistanceMatrix = Basic2DMatrix]’ shortestPath.cpp:186:48: required from here /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::concepts::Graph::~Graph() [with G = R_adjacency_list]’ 37 | ~model() | ^ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/graph_concepts.hpp:66:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 66 | BOOST_CONCEPT_USAGE(Graph) | ^~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::concepts::VertexListGraph >]’: /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements > >]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/graph_concepts.hpp:182:5: required from ‘struct boost::concepts::VertexListGraph >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/graph_concepts.hpp:176:1: required from ‘struct boost::concepts::VertexListGraphConcept >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::concepts::VertexListGraphConcept >]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied > >::value’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied > >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_ >)>’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/bellman_ford_shortest_paths.hpp:218:5: required from ‘bool boost::floyd_warshall_all_pairs_shortest_paths(const VertexAndEdgeListGraph&, DistanceMatrix&, const WeightMap&, const BinaryPredicate&, const BinaryFunction&, const Infinity&, const Zero&) [with VertexAndEdgeListGraph = R_adjacency_list; DistanceMatrix = Basic2DMatrix; WeightMap = adj_list_edge_property_map, edge_weight_t>; BinaryPredicate = std::less; BinaryFunction = closed_plus; Infinity = double; Zero = double]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/floyd_warshall_shortest.hpp:172:55: required from ‘bool boost::detail::floyd_warshall_noninit_dispatch(const VertexAndEdgeListGraph&, DistanceMatrix&, WeightMap, const boost::bgl_named_params&) [with VertexAndEdgeListGraph = R_adjacency_list; DistanceMatrix = Basic2DMatrix; WeightMap = boost::adj_list_edge_property_map, boost::edge_weight_t>; P = int; T = int; R = boost::no_property]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/floyd_warshall_shortest.hpp:217:51: required from ‘bool boost::floyd_warshall_all_pairs_shortest_paths(const VertexAndEdgeListGraph&, DistanceMatrix&) [with VertexAndEdgeListGraph = R_adjacency_list; DistanceMatrix = Basic2DMatrix]’ shortestPath.cpp:186:48: required from here /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::concepts::VertexListGraph::~VertexListGraph() [with G = R_adjacency_list]’ 37 | ~model() | ^ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/graph_concepts.hpp:182:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 182 | BOOST_CONCEPT_USAGE(VertexListGraph) | ^~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::concepts::EdgeListGraph >]’: /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements > >]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/graph_concepts.hpp:233:5: required from ‘struct boost::concepts::EdgeListGraph >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/graph_concepts.hpp:226:1: required from ‘struct boost::concepts::EdgeListGraphConcept >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::concepts::EdgeListGraphConcept >]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied > >::value’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied > >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_ >)>’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/bellman_ford_shortest_paths.hpp:97:5: required from ‘bool boost::floyd_warshall_all_pairs_shortest_paths(const VertexAndEdgeListGraph&, DistanceMatrix&, const WeightMap&, const BinaryPredicate&, const BinaryFunction&, const Infinity&, const Zero&) [with VertexAndEdgeListGraph = R_adjacency_list; DistanceMatrix = Basic2DMatrix; WeightMap = adj_list_edge_property_map, edge_weight_t>; BinaryPredicate = std::less; BinaryFunction = closed_plus; Infinity = double; Zero = double]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/floyd_warshall_shortest.hpp:172:55: required from ‘bool boost::detail::floyd_warshall_noninit_dispatch(const VertexAndEdgeListGraph&, DistanceMatrix&, WeightMap, const boost::bgl_named_params&) [with VertexAndEdgeListGraph = R_adjacency_list; DistanceMatrix = Basic2DMatrix; WeightMap = boost::adj_list_edge_property_map, boost::edge_weight_t>; P = int; T = int; R = boost::no_property]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/floyd_warshall_shortest.hpp:217:51: required from ‘bool boost::floyd_warshall_all_pairs_shortest_paths(const VertexAndEdgeListGraph&, DistanceMatrix&) [with VertexAndEdgeListGraph = R_adjacency_list; DistanceMatrix = Basic2DMatrix]’ shortestPath.cpp:186:48: required from here /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::concepts::EdgeListGraph::~EdgeListGraph() [with G = R_adjacency_list]’ 37 | ~model() | ^ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/graph_concepts.hpp:233:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 233 | BOOST_CONCEPT_USAGE(EdgeListGraph) | ^~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::concepts::IncidenceGraph >]’: /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements > >]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/graph_concepts.hpp:87:5: required from ‘struct boost::concepts::IncidenceGraph >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/graph_concepts.hpp:75:1: required from ‘struct boost::concepts::IncidenceGraphConcept >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::concepts::IncidenceGraphConcept >]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied > >::value’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied > >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_ >)>’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/breadth_first_search.hpp:62:5: required from ‘bool boost::floyd_warshall_all_pairs_shortest_paths(const VertexAndEdgeListGraph&, DistanceMatrix&, const WeightMap&, const BinaryPredicate&, const BinaryFunction&, const Infinity&, const Zero&) [with VertexAndEdgeListGraph = R_adjacency_list; DistanceMatrix = Basic2DMatrix; WeightMap = adj_list_edge_property_map, edge_weight_t>; BinaryPredicate = std::less; BinaryFunction = closed_plus; Infinity = double; Zero = double]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/floyd_warshall_shortest.hpp:172:55: required from ‘bool boost::detail::floyd_warshall_noninit_dispatch(const VertexAndEdgeListGraph&, DistanceMatrix&, WeightMap, const boost::bgl_named_params&) [with VertexAndEdgeListGraph = R_adjacency_list; DistanceMatrix = Basic2DMatrix; WeightMap = boost::adj_list_edge_property_map, boost::edge_weight_t>; P = int; T = int; R = boost::no_property]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/floyd_warshall_shortest.hpp:217:51: required from ‘bool boost::floyd_warshall_all_pairs_shortest_paths(const VertexAndEdgeListGraph&, DistanceMatrix&) [with VertexAndEdgeListGraph = R_adjacency_list; DistanceMatrix = Basic2DMatrix]’ shortestPath.cpp:186:48: required from here /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::concepts::IncidenceGraph::~IncidenceGraph() [with G = R_adjacency_list]’ 37 | ~model() | ^ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/graph_concepts.hpp:87:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 87 | BOOST_CONCEPT_USAGE(IncidenceGraph) | ^~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements >]’: /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:208:5: required from ‘struct boost::Convertible’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::Convertible]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied >::value’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_)>’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:603:11: required from ‘boost::RandomAccessIterator::~RandomAccessIterator() [with TT = __gnu_cxx::__normal_iterator >]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:597:3: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator > >]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/property_map/property_map.hpp:354:5: required from ‘boost::iterator_property_map boost::make_iterator_property_map(RAIter, ID, Value) [with RAIter = __gnu_cxx::__normal_iterator >; Value = double; ID = vec_adj_list_vertex_id_map, long unsigned int>]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/dijkstra_shortest_paths.hpp:556:43: required from ‘void boost::detail::dijkstra_dispatch1(const VertexListGraph&, typename boost::graph_traits::vertex_descriptor, DistanceMap, WeightMap, IndexMap, const Params&) [with VertexListGraph = R_adjacency_list; DistanceMap = double*; WeightMap = boost::adj_list_edge_property_map, boost::edge_weight_t>; IndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>; Params = boost::bgl_named_params >; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/dijkstra_shortest_paths.hpp:570:31: required from ‘void boost::dijkstra_shortest_paths(const VertexListGraph&, typename graph_traits::vertex_descriptor, const bgl_named_params&) [with VertexListGraph = R_adjacency_list; Param = double*; Tag = vertex_distance_t; Rest = bgl_named_params; typename graph_traits::vertex_descriptor = long unsigned int]’ shortestPath.cpp:25:32: required from here /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::Convertible]’ 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ^ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::Convertible]’: /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:603:11: required from ‘boost::RandomAccessIterator::~RandomAccessIterator() [with TT = __gnu_cxx::__normal_iterator >]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:597:3: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator > >]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/property_map/property_map.hpp:354:5: required from ‘boost::iterator_property_map boost::make_iterator_property_map(RAIter, ID, Value) [with RAIter = __gnu_cxx::__normal_iterator >; Value = double; ID = vec_adj_list_vertex_id_map, long unsigned int>]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/dijkstra_shortest_paths.hpp:556:43: required from ‘void boost::detail::dijkstra_dispatch1(const VertexListGraph&, typename boost::graph_traits::vertex_descriptor, DistanceMap, WeightMap, IndexMap, const Params&) [with VertexListGraph = R_adjacency_list; DistanceMap = double*; WeightMap = boost::adj_list_edge_property_map, boost::edge_weight_t>; IndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>; Params = boost::bgl_named_params >; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/dijkstra_shortest_paths.hpp:570:31: required from ‘void boost::dijkstra_shortest_paths(const VertexListGraph&, typename graph_traits::vertex_descriptor, const bgl_named_params&) [with VertexListGraph = R_adjacency_list; Param = double*; Tag = vertex_distance_t; Rest = bgl_named_params; typename graph_traits::vertex_descriptor = long unsigned int]’ shortestPath.cpp:25:32: required from here /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::Convertible::~Convertible() [with X = std::random_access_iterator_tag; Y = std::random_access_iterator_tag]’ 37 | ~model() | ^ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:208:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 208 | BOOST_CONCEPT_USAGE(Convertible) { | ^~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::concepts::Graph, boost::property >, boost::no_property, boost::listS> >]’: /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements, boost::property >, boost::no_property, boost::listS> > >]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/graph_concepts.hpp:66:5: required from ‘struct boost::concepts::Graph, boost::property >, boost::no_property, boost::listS> >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/graph_concepts.hpp:226:1: required from ‘struct boost::concepts::EdgeListGraph, boost::property >, boost::no_property, boost::listS> >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/graph_concepts.hpp:226:1: required from ‘struct boost::concepts::EdgeListGraphConcept, boost::property >, boost::no_property, boost::listS> >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::concepts::EdgeListGraphConcept, boost::property >, boost::no_property, boost::listS> >]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:42:5: [ skipping 2 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_, boost::property >, boost::no_property, boost::listS> >)>’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/bellman_ford_shortest_paths.hpp:97:5: required from ‘bool boost::bellman_ford_shortest_paths(EdgeListGraph&, Size, WeightMap, PredecessorMap, DistanceMap, BinaryFunction, BinaryPredicate, BellmanFordVisitor) [with EdgeListGraph = adjacency_list, property >, no_property, listS>; Size = long unsigned int; WeightMap = adj_list_edge_property_map >, edge_weight_t>; PredecessorMap = dummy_property_map; DistanceMap = vec_adj_list_vertex_property_map, property >, no_property, listS>, adjacency_list, property >, no_property, listS>*, double, double&, vertex_distance_t>; BinaryFunction = closed_plus; BinaryPredicate = std::less; BellmanFordVisitor = bellman_visitor<>]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/johnson_all_pairs_shortest.hpp:112:36: required from ‘bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, VertexID, Weight, const BinaryPredicate&, const BinaryFunction&, const Infinity&, DistanceZero) [with VertexAndEdgeListGraph = R_adjacency_list; DistanceMatrix = Basic2DMatrix; VertexID = vec_adj_list_vertex_id_map, long unsigned int>; Weight = adj_list_edge_property_map, edge_weight_t>; BinaryPredicate = std::less; BinaryFunction = closed_plus; Infinity = double; DistanceZero = double]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/johnson_all_pairs_shortest.hpp:164:48: required from ‘bool boost::detail::johnson_dispatch(VertexAndEdgeListGraph&, DistanceMatrix&, const boost::bgl_named_params&, Weight, VertexID) [with VertexAndEdgeListGraph = R_adjacency_list; DistanceMatrix = Basic2DMatrix; P = int; T = int; R = boost::no_property; Weight = boost::adj_list_edge_property_map, boost::edge_weight_t>; VertexID = boost::vec_adj_list_vertex_id_map, long unsigned int>]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/johnson_all_pairs_shortest.hpp:192:36: required from ‘bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&) [with VertexAndEdgeListGraph = R_adjacency_list; DistanceMatrix = Basic2DMatrix]’ shortestPath.cpp:56:41: required from here /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::concepts::Graph::~Graph() [with G = boost::adjacency_list, boost::property >, boost::no_property, boost::listS>]’ 37 | ~model() | ^ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/graph_concepts.hpp:66:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 66 | BOOST_CONCEPT_USAGE(Graph) | ^~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::concepts::EdgeListGraph, boost::property >, boost::no_property, boost::listS> >]’: /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements, boost::property >, boost::no_property, boost::listS> > >]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/graph_concepts.hpp:233:5: required from ‘struct boost::concepts::EdgeListGraph, boost::property >, boost::no_property, boost::listS> >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/graph_concepts.hpp:226:1: required from ‘struct boost::concepts::EdgeListGraphConcept, boost::property >, boost::no_property, boost::listS> >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::concepts::EdgeListGraphConcept, boost::property >, boost::no_property, boost::listS> >]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:42:5: [ skipping 2 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_, boost::property >, boost::no_property, boost::listS> >)>’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/bellman_ford_shortest_paths.hpp:97:5: required from ‘bool boost::bellman_ford_shortest_paths(EdgeListGraph&, Size, WeightMap, PredecessorMap, DistanceMap, BinaryFunction, BinaryPredicate, BellmanFordVisitor) [with EdgeListGraph = adjacency_list, property >, no_property, listS>; Size = long unsigned int; WeightMap = adj_list_edge_property_map >, edge_weight_t>; PredecessorMap = dummy_property_map; DistanceMap = vec_adj_list_vertex_property_map, property >, no_property, listS>, adjacency_list, property >, no_property, listS>*, double, double&, vertex_distance_t>; BinaryFunction = closed_plus; BinaryPredicate = std::less; BellmanFordVisitor = bellman_visitor<>]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/johnson_all_pairs_shortest.hpp:112:36: required from ‘bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, VertexID, Weight, const BinaryPredicate&, const BinaryFunction&, const Infinity&, DistanceZero) [with VertexAndEdgeListGraph = R_adjacency_list; DistanceMatrix = Basic2DMatrix; VertexID = vec_adj_list_vertex_id_map, long unsigned int>; Weight = adj_list_edge_property_map, edge_weight_t>; BinaryPredicate = std::less; BinaryFunction = closed_plus; Infinity = double; DistanceZero = double]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/johnson_all_pairs_shortest.hpp:164:48: required from ‘bool boost::detail::johnson_dispatch(VertexAndEdgeListGraph&, DistanceMatrix&, const boost::bgl_named_params&, Weight, VertexID) [with VertexAndEdgeListGraph = R_adjacency_list; DistanceMatrix = Basic2DMatrix; P = int; T = int; R = boost::no_property; Weight = boost::adj_list_edge_property_map, boost::edge_weight_t>; VertexID = boost::vec_adj_list_vertex_id_map, long unsigned int>]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/johnson_all_pairs_shortest.hpp:192:36: required from ‘bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&) [with VertexAndEdgeListGraph = R_adjacency_list; DistanceMatrix = Basic2DMatrix]’ shortestPath.cpp:56:41: required from here /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::concepts::EdgeListGraph::~EdgeListGraph() [with G = boost::adjacency_list, boost::property >, boost::no_property, boost::listS>]’ 37 | ~model() | ^ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/graph_concepts.hpp:233:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 233 | BOOST_CONCEPT_USAGE(EdgeListGraph) | ^~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::constraint::failed() [with Model = boost::ReadablePropertyMapConcept, boost::property >, boost::no_property, boost::listS>, boost::adjacency_list, boost::property >, boost::no_property, boost::listS>*, double, double&, boost::vertex_distance_t>, long unsigned int>]’: /home/omnipath/local/R/4.4-3.20/BH/include/boost/property_map/property_map.hpp:206:7: required from ‘void boost::ReadWritePropertyMapConcept::constraints() [with PMap = boost::vec_adj_list_vertex_property_map, boost::property >, boost::no_property, boost::listS>, boost::adjacency_list, boost::property >, boost::no_property, boost::listS>*, double, double&, boost::vertex_distance_t>; Key = long unsigned int]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::ReadWritePropertyMapConcept, boost::property >, boost::no_property, boost::listS>, boost::adjacency_list, boost::property >, boost::no_property, boost::listS>*, double, double&, boost::vertex_distance_t>, long unsigned int>]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied, boost::property >, boost::no_property, boost::listS>, boost::adjacency_list, boost::property >, boost::no_property, boost::listS>*, double, double&, boost::vertex_distance_t>, long unsigned int> >::value’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied, boost::property >, boost::no_property, boost::listS>, boost::adjacency_list, boost::property >, boost::no_property, boost::listS>*, double, double&, boost::vertex_distance_t>, long unsigned int> >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_, boost::property >, boost::no_property, boost::listS>, boost::adjacency_list, boost::property >, boost::no_property, boost::listS>*, double, double&, boost::vertex_distance_t>, long unsigned int>)>’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/bellman_ford_shortest_paths.hpp:101:5: required from ‘bool boost::bellman_ford_shortest_paths(EdgeListGraph&, Size, WeightMap, PredecessorMap, DistanceMap, BinaryFunction, BinaryPredicate, BellmanFordVisitor) [with EdgeListGraph = adjacency_list, property >, no_property, listS>; Size = long unsigned int; WeightMap = adj_list_edge_property_map >, edge_weight_t>; PredecessorMap = dummy_property_map; DistanceMap = vec_adj_list_vertex_property_map, property >, no_property, listS>, adjacency_list, property >, no_property, listS>*, double, double&, vertex_distance_t>; BinaryFunction = closed_plus; BinaryPredicate = std::less; BellmanFordVisitor = bellman_visitor<>]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/johnson_all_pairs_shortest.hpp:112:36: required from ‘bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, VertexID, Weight, const BinaryPredicate&, const BinaryFunction&, const Infinity&, DistanceZero) [with VertexAndEdgeListGraph = R_adjacency_list; DistanceMatrix = Basic2DMatrix; VertexID = vec_adj_list_vertex_id_map, long unsigned int>; Weight = adj_list_edge_property_map, edge_weight_t>; BinaryPredicate = std::less; BinaryFunction = closed_plus; Infinity = double; DistanceZero = double]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/johnson_all_pairs_shortest.hpp:164:48: required from ‘bool boost::detail::johnson_dispatch(VertexAndEdgeListGraph&, DistanceMatrix&, const boost::bgl_named_params&, Weight, VertexID) [with VertexAndEdgeListGraph = R_adjacency_list; DistanceMatrix = Basic2DMatrix; P = int; T = int; R = boost::no_property; Weight = boost::adj_list_edge_property_map, boost::edge_weight_t>; VertexID = boost::vec_adj_list_vertex_id_map, long unsigned int>]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/johnson_all_pairs_shortest.hpp:192:36: required from ‘bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&) [with VertexAndEdgeListGraph = R_adjacency_list; DistanceMatrix = Basic2DMatrix]’ shortestPath.cpp:56:41: required from here /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:65:52: warning: ‘this’ pointer is null [-Wnonnull] 65 | static void failed() { ((Model*)0)->constraints(); } | ~~~~~~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/property_map/property_map.hpp:147:10: note: in a call to non-static member function ‘void boost::ReadablePropertyMapConcept::constraints() [with PMap = boost::vec_adj_list_vertex_property_map, boost::property >, boost::no_property, boost::listS>, boost::adjacency_list, boost::property >, boost::no_property, boost::listS>*, double, double&, boost::vertex_distance_t>; Key = long unsigned int]’ 147 | void constraints() { | ^~~~~~~~~~~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::constraint::failed() [with Model = boost::WritablePropertyMapConcept, boost::property >, boost::no_property, boost::listS>, boost::adjacency_list, boost::property >, boost::no_property, boost::listS>*, double, double&, boost::vertex_distance_t>, long unsigned int>]’: /home/omnipath/local/R/4.4-3.20/BH/include/boost/property_map/property_map.hpp:207:7: required from ‘void boost::ReadWritePropertyMapConcept::constraints() [with PMap = boost::vec_adj_list_vertex_property_map, boost::property >, boost::no_property, boost::listS>, boost::adjacency_list, boost::property >, boost::no_property, boost::listS>*, double, double&, boost::vertex_distance_t>; Key = long unsigned int]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::ReadWritePropertyMapConcept, boost::property >, boost::no_property, boost::listS>, boost::adjacency_list, boost::property >, boost::no_property, boost::listS>*, double, double&, boost::vertex_distance_t>, long unsigned int>]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied, boost::property >, boost::no_property, boost::listS>, boost::adjacency_list, boost::property >, boost::no_property, boost::listS>*, double, double&, boost::vertex_distance_t>, long unsigned int> >::value’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied, boost::property >, boost::no_property, boost::listS>, boost::adjacency_list, boost::property >, boost::no_property, boost::listS>*, double, double&, boost::vertex_distance_t>, long unsigned int> >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_, boost::property >, boost::no_property, boost::listS>, boost::adjacency_list, boost::property >, boost::no_property, boost::listS>*, double, double&, boost::vertex_distance_t>, long unsigned int>)>’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/bellman_ford_shortest_paths.hpp:101:5: required from ‘bool boost::bellman_ford_shortest_paths(EdgeListGraph&, Size, WeightMap, PredecessorMap, DistanceMap, BinaryFunction, BinaryPredicate, BellmanFordVisitor) [with EdgeListGraph = adjacency_list, property >, no_property, listS>; Size = long unsigned int; WeightMap = adj_list_edge_property_map >, edge_weight_t>; PredecessorMap = dummy_property_map; DistanceMap = vec_adj_list_vertex_property_map, property >, no_property, listS>, adjacency_list, property >, no_property, listS>*, double, double&, vertex_distance_t>; BinaryFunction = closed_plus; BinaryPredicate = std::less; BellmanFordVisitor = bellman_visitor<>]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/johnson_all_pairs_shortest.hpp:112:36: required from ‘bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, VertexID, Weight, const BinaryPredicate&, const BinaryFunction&, const Infinity&, DistanceZero) [with VertexAndEdgeListGraph = R_adjacency_list; DistanceMatrix = Basic2DMatrix; VertexID = vec_adj_list_vertex_id_map, long unsigned int>; Weight = adj_list_edge_property_map, edge_weight_t>; BinaryPredicate = std::less; BinaryFunction = closed_plus; Infinity = double; DistanceZero = double]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/johnson_all_pairs_shortest.hpp:164:48: required from ‘bool boost::detail::johnson_dispatch(VertexAndEdgeListGraph&, DistanceMatrix&, const boost::bgl_named_params&, Weight, VertexID) [with VertexAndEdgeListGraph = R_adjacency_list; DistanceMatrix = Basic2DMatrix; P = int; T = int; R = boost::no_property; Weight = boost::adj_list_edge_property_map, boost::edge_weight_t>; VertexID = boost::vec_adj_list_vertex_id_map, long unsigned int>]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/johnson_all_pairs_shortest.hpp:192:36: required from ‘bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&) [with VertexAndEdgeListGraph = R_adjacency_list; DistanceMatrix = Basic2DMatrix]’ shortestPath.cpp:56:41: required from here /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:65:52: warning: ‘this’ pointer is null [-Wnonnull] 65 | static void failed() { ((Model*)0)->constraints(); } | ~~~~~~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/property_map/property_map.hpp:179:10: note: in a call to non-static member function ‘void boost::WritablePropertyMapConcept::constraints() [with PMap = boost::vec_adj_list_vertex_property_map, boost::property >, boost::no_property, boost::listS>, boost::adjacency_list, boost::property >, boost::no_property, boost::listS>*, double, double&, boost::vertex_distance_t>; Key = long unsigned int]’ 179 | void constraints() { | ^~~~~~~~~~~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements >]’: /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:208:5: required from ‘struct boost::Convertible’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:206:3: required from ‘struct boost::ConvertibleConcept’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::ConvertibleConcept]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied >::value’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:72:8: [ skipping 5 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_, boost::property >, boost::no_property, boost::listS>, boost::adjacency_list, boost::property >, boost::no_property, boost::listS>*, double, double&, boost::vertex_distance_t>, long unsigned int>)>’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/bellman_ford_shortest_paths.hpp:101:5: required from ‘bool boost::bellman_ford_shortest_paths(EdgeListGraph&, Size, WeightMap, PredecessorMap, DistanceMap, BinaryFunction, BinaryPredicate, BellmanFordVisitor) [with EdgeListGraph = adjacency_list, property >, no_property, listS>; Size = long unsigned int; WeightMap = adj_list_edge_property_map >, edge_weight_t>; PredecessorMap = dummy_property_map; DistanceMap = vec_adj_list_vertex_property_map, property >, no_property, listS>, adjacency_list, property >, no_property, listS>*, double, double&, vertex_distance_t>; BinaryFunction = closed_plus; BinaryPredicate = std::less; BellmanFordVisitor = bellman_visitor<>]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/johnson_all_pairs_shortest.hpp:112:36: required from ‘bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, VertexID, Weight, const BinaryPredicate&, const BinaryFunction&, const Infinity&, DistanceZero) [with VertexAndEdgeListGraph = R_adjacency_list; DistanceMatrix = Basic2DMatrix; VertexID = vec_adj_list_vertex_id_map, long unsigned int>; Weight = adj_list_edge_property_map, edge_weight_t>; BinaryPredicate = std::less; BinaryFunction = closed_plus; Infinity = double; DistanceZero = double]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/johnson_all_pairs_shortest.hpp:164:48: required from ‘bool boost::detail::johnson_dispatch(VertexAndEdgeListGraph&, DistanceMatrix&, const boost::bgl_named_params&, Weight, VertexID) [with VertexAndEdgeListGraph = R_adjacency_list; DistanceMatrix = Basic2DMatrix; P = int; T = int; R = boost::no_property; Weight = boost::adj_list_edge_property_map, boost::edge_weight_t>; VertexID = boost::vec_adj_list_vertex_id_map, long unsigned int>]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/johnson_all_pairs_shortest.hpp:192:36: required from ‘bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&) [with VertexAndEdgeListGraph = R_adjacency_list; DistanceMatrix = Basic2DMatrix]’ shortestPath.cpp:56:41: required from here /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::Convertible]’ 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ^ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::ConvertibleConcept]’: /home/omnipath/local/R/4.4-3.20/BH/include/boost/property_map/property_map.hpp:208:7: required from ‘void boost::ReadWritePropertyMapConcept::constraints() [with PMap = boost::vec_adj_list_vertex_property_map, boost::property >, boost::no_property, boost::listS>, boost::adjacency_list, boost::property >, boost::no_property, boost::listS>*, double, double&, boost::vertex_distance_t>; Key = long unsigned int]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::ReadWritePropertyMapConcept, boost::property >, boost::no_property, boost::listS>, boost::adjacency_list, boost::property >, boost::no_property, boost::listS>*, double, double&, boost::vertex_distance_t>, long unsigned int>]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied, boost::property >, boost::no_property, boost::listS>, boost::adjacency_list, boost::property >, boost::no_property, boost::listS>*, double, double&, boost::vertex_distance_t>, long unsigned int> >::value’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied, boost::property >, boost::no_property, boost::listS>, boost::adjacency_list, boost::property >, boost::no_property, boost::listS>*, double, double&, boost::vertex_distance_t>, long unsigned int> >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_, boost::property >, boost::no_property, boost::listS>, boost::adjacency_list, boost::property >, boost::no_property, boost::listS>*, double, double&, boost::vertex_distance_t>, long unsigned int>)>’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/bellman_ford_shortest_paths.hpp:101:5: required from ‘bool boost::bellman_ford_shortest_paths(EdgeListGraph&, Size, WeightMap, PredecessorMap, DistanceMap, BinaryFunction, BinaryPredicate, BellmanFordVisitor) [with EdgeListGraph = adjacency_list, property >, no_property, listS>; Size = long unsigned int; WeightMap = adj_list_edge_property_map >, edge_weight_t>; PredecessorMap = dummy_property_map; DistanceMap = vec_adj_list_vertex_property_map, property >, no_property, listS>, adjacency_list, property >, no_property, listS>*, double, double&, vertex_distance_t>; BinaryFunction = closed_plus; BinaryPredicate = std::less; BellmanFordVisitor = bellman_visitor<>]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/johnson_all_pairs_shortest.hpp:112:36: required from ‘bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, VertexID, Weight, const BinaryPredicate&, const BinaryFunction&, const Infinity&, DistanceZero) [with VertexAndEdgeListGraph = R_adjacency_list; DistanceMatrix = Basic2DMatrix; VertexID = vec_adj_list_vertex_id_map, long unsigned int>; Weight = adj_list_edge_property_map, edge_weight_t>; BinaryPredicate = std::less; BinaryFunction = closed_plus; Infinity = double; DistanceZero = double]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/johnson_all_pairs_shortest.hpp:164:48: required from ‘bool boost::detail::johnson_dispatch(VertexAndEdgeListGraph&, DistanceMatrix&, const boost::bgl_named_params&, Weight, VertexID) [with VertexAndEdgeListGraph = R_adjacency_list; DistanceMatrix = Basic2DMatrix; P = int; T = int; R = boost::no_property; Weight = boost::adj_list_edge_property_map, boost::edge_weight_t>; VertexID = boost::vec_adj_list_vertex_id_map, long unsigned int>]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/johnson_all_pairs_shortest.hpp:192:36: required from ‘bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&) [with VertexAndEdgeListGraph = R_adjacency_list; DistanceMatrix = Basic2DMatrix]’ shortestPath.cpp:56:41: required from here /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:206:17: note: in a call to non-static member function ‘boost::ConvertibleConcept::~ConvertibleConcept()’ 206 | BOOST_concept(Convertible,(X)(Y)) | ^~~~~~~~~~~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/preprocessor/cat.hpp:29:34: note: in definition of macro ‘BOOST_PP_CAT_I’ 29 | # define BOOST_PP_CAT_I(a, b) a ## b | ^ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/concept_def.hpp:23:12: note: in expansion of macro ‘BOOST_PP_CAT’ 23 | struct BOOST_PP_CAT(name,Concept) \ | ^~~~~~~~~~~~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:206:3: note: in expansion of macro ‘BOOST_concept’ 206 | BOOST_concept(Convertible,(X)(Y)) | ^~~~~~~~~~~~~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements >]’: /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:208:5: required from ‘struct boost::Convertible’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:206:3: required from ‘struct boost::ConvertibleConcept’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::ConvertibleConcept]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied >::value’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:72:8: [ skipping 5 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_ >, boost::edge_weight_t>, boost::detail::edge_desc_impl >)>’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/bellman_ford_shortest_paths.hpp:102:5: required from ‘bool boost::bellman_ford_shortest_paths(EdgeListGraph&, Size, WeightMap, PredecessorMap, DistanceMap, BinaryFunction, BinaryPredicate, BellmanFordVisitor) [with EdgeListGraph = adjacency_list, property >, no_property, listS>; Size = long unsigned int; WeightMap = adj_list_edge_property_map >, edge_weight_t>; PredecessorMap = dummy_property_map; DistanceMap = vec_adj_list_vertex_property_map, property >, no_property, listS>, adjacency_list, property >, no_property, listS>*, double, double&, vertex_distance_t>; BinaryFunction = closed_plus; BinaryPredicate = std::less; BellmanFordVisitor = bellman_visitor<>]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/johnson_all_pairs_shortest.hpp:112:36: required from ‘bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, VertexID, Weight, const BinaryPredicate&, const BinaryFunction&, const Infinity&, DistanceZero) [with VertexAndEdgeListGraph = R_adjacency_list; DistanceMatrix = Basic2DMatrix; VertexID = vec_adj_list_vertex_id_map, long unsigned int>; Weight = adj_list_edge_property_map, edge_weight_t>; BinaryPredicate = std::less; BinaryFunction = closed_plus; Infinity = double; DistanceZero = double]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/johnson_all_pairs_shortest.hpp:164:48: required from ‘bool boost::detail::johnson_dispatch(VertexAndEdgeListGraph&, DistanceMatrix&, const boost::bgl_named_params&, Weight, VertexID) [with VertexAndEdgeListGraph = R_adjacency_list; DistanceMatrix = Basic2DMatrix; P = int; T = int; R = boost::no_property; Weight = boost::adj_list_edge_property_map, boost::edge_weight_t>; VertexID = boost::vec_adj_list_vertex_id_map, long unsigned int>]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/johnson_all_pairs_shortest.hpp:192:36: required from ‘bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&) [with VertexAndEdgeListGraph = R_adjacency_list; DistanceMatrix = Basic2DMatrix]’ shortestPath.cpp:56:41: required from here /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::Convertible]’ 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ^ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::ConvertibleConcept]’: /home/omnipath/local/R/4.4-3.20/BH/include/boost/property_map/property_map.hpp:148:7: required from ‘void boost::ReadablePropertyMapConcept::constraints() [with PMap = boost::adj_list_edge_property_map >, boost::edge_weight_t>; Key = boost::detail::edge_desc_impl]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::ReadablePropertyMapConcept >, boost::edge_weight_t>, boost::detail::edge_desc_impl >]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied >, boost::edge_weight_t>, boost::detail::edge_desc_impl > >::value’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied >, boost::edge_weight_t>, boost::detail::edge_desc_impl > >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_ >, boost::edge_weight_t>, boost::detail::edge_desc_impl >)>’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/bellman_ford_shortest_paths.hpp:102:5: required from ‘bool boost::bellman_ford_shortest_paths(EdgeListGraph&, Size, WeightMap, PredecessorMap, DistanceMap, BinaryFunction, BinaryPredicate, BellmanFordVisitor) [with EdgeListGraph = adjacency_list, property >, no_property, listS>; Size = long unsigned int; WeightMap = adj_list_edge_property_map >, edge_weight_t>; PredecessorMap = dummy_property_map; DistanceMap = vec_adj_list_vertex_property_map, property >, no_property, listS>, adjacency_list, property >, no_property, listS>*, double, double&, vertex_distance_t>; BinaryFunction = closed_plus; BinaryPredicate = std::less; BellmanFordVisitor = bellman_visitor<>]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/johnson_all_pairs_shortest.hpp:112:36: required from ‘bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, VertexID, Weight, const BinaryPredicate&, const BinaryFunction&, const Infinity&, DistanceZero) [with VertexAndEdgeListGraph = R_adjacency_list; DistanceMatrix = Basic2DMatrix; VertexID = vec_adj_list_vertex_id_map, long unsigned int>; Weight = adj_list_edge_property_map, edge_weight_t>; BinaryPredicate = std::less; BinaryFunction = closed_plus; Infinity = double; DistanceZero = double]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/johnson_all_pairs_shortest.hpp:164:48: required from ‘bool boost::detail::johnson_dispatch(VertexAndEdgeListGraph&, DistanceMatrix&, const boost::bgl_named_params&, Weight, VertexID) [with VertexAndEdgeListGraph = R_adjacency_list; DistanceMatrix = Basic2DMatrix; P = int; T = int; R = boost::no_property; Weight = boost::adj_list_edge_property_map, boost::edge_weight_t>; VertexID = boost::vec_adj_list_vertex_id_map, long unsigned int>]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/johnson_all_pairs_shortest.hpp:192:36: required from ‘bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&) [with VertexAndEdgeListGraph = R_adjacency_list; DistanceMatrix = Basic2DMatrix]’ shortestPath.cpp:56:41: required from here /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:206:17: note: in a call to non-static member function ‘boost::ConvertibleConcept::~ConvertibleConcept()’ 206 | BOOST_concept(Convertible,(X)(Y)) | ^~~~~~~~~~~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/preprocessor/cat.hpp:29:34: note: in definition of macro ‘BOOST_PP_CAT_I’ 29 | # define BOOST_PP_CAT_I(a, b) a ## b | ^ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/concept_def.hpp:23:12: note: in expansion of macro ‘BOOST_PP_CAT’ 23 | struct BOOST_PP_CAT(name,Concept) \ | ^~~~~~~~~~~~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:206:3: note: in expansion of macro ‘BOOST_concept’ 206 | BOOST_concept(Convertible,(X)(Y)) | ^~~~~~~~~~~~~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::concepts::Graph > >]’: /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements > > >]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/graph_concepts.hpp:66:5: required from ‘struct boost::concepts::Graph > >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/graph_concepts.hpp:226:1: required from ‘struct boost::concepts::EdgeListGraph > >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/graph_concepts.hpp:226:1: required from ‘struct boost::concepts::EdgeListGraphConcept > >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::concepts::EdgeListGraphConcept > >]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:42:5: [ skipping 2 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_ > >)>’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/bellman_ford_shortest_paths.hpp:97:5: required from ‘bool boost::bellman_ford_shortest_paths(EdgeListGraph&, Size, WeightMap, PredecessorMap, DistanceMap, BinaryFunction, BinaryPredicate, BellmanFordVisitor) [with EdgeListGraph = adjacency_list >; Size = int; WeightMap = adj_list_edge_property_map, edge_weight_t>; PredecessorMap = long unsigned int*; DistanceMap = double*; BinaryFunction = closed_plus; BinaryPredicate = std::less; BellmanFordVisitor = bellman_visitor<>]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/bellman_ford_shortest_paths.hpp:176:43: required from ‘bool boost::detail::bellman_dispatch2(VertexAndEdgeListGraph&, boost::param_not_found, Size, WeightMap, PredecessorMap, DistanceMap, const boost::bgl_named_params&) [with VertexAndEdgeListGraph = boost::adjacency_list >; Size = int; WeightMap = boost::adj_list_edge_property_map, boost::edge_weight_t>; PredecessorMap = long unsigned int*; DistanceMap = double*; P = double*; T = boost::vertex_distance_t; R = boost::bgl_named_params, boost::edge_weight_t>, boost::edge_weight_t, boost::no_property> >]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/bellman_ford_shortest_paths.hpp:190:41: required from ‘bool boost::detail::bellman_dispatch(EdgeListGraph&, Size, WeightMap, DistanceMap, const boost::bgl_named_params&) [with EdgeListGraph = boost::adjacency_list >; Size = int; WeightMap = boost::adj_list_edge_property_map, boost::edge_weight_t>; DistanceMap = double*; P = double*; T = boost::vertex_distance_t; R = boost::bgl_named_params, boost::edge_weight_t>, boost::edge_weight_t, boost::no_property> >]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/bellman_ford_shortest_paths.hpp:201:36: required from ‘bool boost::bellman_ford_shortest_paths(EdgeListGraph&, Size, const bgl_named_params&) [with EdgeListGraph = adjacency_list >; Size = int; P = double*; T = vertex_distance_t; R = bgl_named_params, edge_weight_t>, edge_weight_t, no_property> >]’ shortestPath.cpp:105:45: required from here /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::concepts::Graph::~Graph() [with G = boost::adjacency_list >]’ 37 | ~model() | ^ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/graph_concepts.hpp:66:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 66 | BOOST_CONCEPT_USAGE(Graph) | ^~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::concepts::EdgeListGraph > >]’: /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements > > >]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/graph_concepts.hpp:233:5: required from ‘struct boost::concepts::EdgeListGraph > >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/graph_concepts.hpp:226:1: required from ‘struct boost::concepts::EdgeListGraphConcept > >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::concepts::EdgeListGraphConcept > >]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:42:5: [ skipping 2 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_ > >)>’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/bellman_ford_shortest_paths.hpp:97:5: required from ‘bool boost::bellman_ford_shortest_paths(EdgeListGraph&, Size, WeightMap, PredecessorMap, DistanceMap, BinaryFunction, BinaryPredicate, BellmanFordVisitor) [with EdgeListGraph = adjacency_list >; Size = int; WeightMap = adj_list_edge_property_map, edge_weight_t>; PredecessorMap = long unsigned int*; DistanceMap = double*; BinaryFunction = closed_plus; BinaryPredicate = std::less; BellmanFordVisitor = bellman_visitor<>]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/bellman_ford_shortest_paths.hpp:176:43: required from ‘bool boost::detail::bellman_dispatch2(VertexAndEdgeListGraph&, boost::param_not_found, Size, WeightMap, PredecessorMap, DistanceMap, const boost::bgl_named_params&) [with VertexAndEdgeListGraph = boost::adjacency_list >; Size = int; WeightMap = boost::adj_list_edge_property_map, boost::edge_weight_t>; PredecessorMap = long unsigned int*; DistanceMap = double*; P = double*; T = boost::vertex_distance_t; R = boost::bgl_named_params, boost::edge_weight_t>, boost::edge_weight_t, boost::no_property> >]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/bellman_ford_shortest_paths.hpp:190:41: required from ‘bool boost::detail::bellman_dispatch(EdgeListGraph&, Size, WeightMap, DistanceMap, const boost::bgl_named_params&) [with EdgeListGraph = boost::adjacency_list >; Size = int; WeightMap = boost::adj_list_edge_property_map, boost::edge_weight_t>; DistanceMap = double*; P = double*; T = boost::vertex_distance_t; R = boost::bgl_named_params, boost::edge_weight_t>, boost::edge_weight_t, boost::no_property> >]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/bellman_ford_shortest_paths.hpp:201:36: required from ‘bool boost::bellman_ford_shortest_paths(EdgeListGraph&, Size, const bgl_named_params&) [with EdgeListGraph = adjacency_list >; Size = int; P = double*; T = vertex_distance_t; R = bgl_named_params, edge_weight_t>, edge_weight_t, no_property> >]’ shortestPath.cpp:105:45: required from here /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::concepts::EdgeListGraph::~EdgeListGraph() [with G = boost::adjacency_list >]’ 37 | ~model() | ^ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/graph_concepts.hpp:233:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 233 | BOOST_CONCEPT_USAGE(EdgeListGraph) | ^~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::constraint::failed() [with Model = boost::ReadablePropertyMapConcept]’: /home/omnipath/local/R/4.4-3.20/BH/include/boost/property_map/property_map.hpp:206:7: required from ‘void boost::ReadWritePropertyMapConcept::constraints() [with PMap = double*; Key = long unsigned int]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::ReadWritePropertyMapConcept]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied >::value’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_)>’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/bellman_ford_shortest_paths.hpp:101:5: required from ‘bool boost::bellman_ford_shortest_paths(EdgeListGraph&, Size, WeightMap, PredecessorMap, DistanceMap, BinaryFunction, BinaryPredicate, BellmanFordVisitor) [with EdgeListGraph = adjacency_list >; Size = int; WeightMap = adj_list_edge_property_map, edge_weight_t>; PredecessorMap = long unsigned int*; DistanceMap = double*; BinaryFunction = closed_plus; BinaryPredicate = std::less; BellmanFordVisitor = bellman_visitor<>]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/bellman_ford_shortest_paths.hpp:176:43: required from ‘bool boost::detail::bellman_dispatch2(VertexAndEdgeListGraph&, boost::param_not_found, Size, WeightMap, PredecessorMap, DistanceMap, const boost::bgl_named_params&) [with VertexAndEdgeListGraph = boost::adjacency_list >; Size = int; WeightMap = boost::adj_list_edge_property_map, boost::edge_weight_t>; PredecessorMap = long unsigned int*; DistanceMap = double*; P = double*; T = boost::vertex_distance_t; R = boost::bgl_named_params, boost::edge_weight_t>, boost::edge_weight_t, boost::no_property> >]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/bellman_ford_shortest_paths.hpp:190:41: required from ‘bool boost::detail::bellman_dispatch(EdgeListGraph&, Size, WeightMap, DistanceMap, const boost::bgl_named_params&) [with EdgeListGraph = boost::adjacency_list >; Size = int; WeightMap = boost::adj_list_edge_property_map, boost::edge_weight_t>; DistanceMap = double*; P = double*; T = boost::vertex_distance_t; R = boost::bgl_named_params, boost::edge_weight_t>, boost::edge_weight_t, boost::no_property> >]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/bellman_ford_shortest_paths.hpp:201:36: required from ‘bool boost::bellman_ford_shortest_paths(EdgeListGraph&, Size, const bgl_named_params&) [with EdgeListGraph = adjacency_list >; Size = int; P = double*; T = vertex_distance_t; R = bgl_named_params, edge_weight_t>, edge_weight_t, no_property> >]’ shortestPath.cpp:105:45: required from here /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:65:52: warning: ‘this’ pointer is null [-Wnonnull] 65 | static void failed() { ((Model*)0)->constraints(); } | ~~~~~~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/property_map/property_map.hpp:147:10: note: in a call to non-static member function ‘void boost::ReadablePropertyMapConcept::constraints() [with PMap = double*; Key = long unsigned int]’ 147 | void constraints() { | ^~~~~~~~~~~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::constraint::failed() [with Model = boost::WritablePropertyMapConcept]’: /home/omnipath/local/R/4.4-3.20/BH/include/boost/property_map/property_map.hpp:207:7: required from ‘void boost::ReadWritePropertyMapConcept::constraints() [with PMap = double*; Key = long unsigned int]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::ReadWritePropertyMapConcept]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied >::value’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_)>’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/bellman_ford_shortest_paths.hpp:101:5: required from ‘bool boost::bellman_ford_shortest_paths(EdgeListGraph&, Size, WeightMap, PredecessorMap, DistanceMap, BinaryFunction, BinaryPredicate, BellmanFordVisitor) [with EdgeListGraph = adjacency_list >; Size = int; WeightMap = adj_list_edge_property_map, edge_weight_t>; PredecessorMap = long unsigned int*; DistanceMap = double*; BinaryFunction = closed_plus; BinaryPredicate = std::less; BellmanFordVisitor = bellman_visitor<>]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/bellman_ford_shortest_paths.hpp:176:43: required from ‘bool boost::detail::bellman_dispatch2(VertexAndEdgeListGraph&, boost::param_not_found, Size, WeightMap, PredecessorMap, DistanceMap, const boost::bgl_named_params&) [with VertexAndEdgeListGraph = boost::adjacency_list >; Size = int; WeightMap = boost::adj_list_edge_property_map, boost::edge_weight_t>; PredecessorMap = long unsigned int*; DistanceMap = double*; P = double*; T = boost::vertex_distance_t; R = boost::bgl_named_params, boost::edge_weight_t>, boost::edge_weight_t, boost::no_property> >]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/bellman_ford_shortest_paths.hpp:190:41: required from ‘bool boost::detail::bellman_dispatch(EdgeListGraph&, Size, WeightMap, DistanceMap, const boost::bgl_named_params&) [with EdgeListGraph = boost::adjacency_list >; Size = int; WeightMap = boost::adj_list_edge_property_map, boost::edge_weight_t>; DistanceMap = double*; P = double*; T = boost::vertex_distance_t; R = boost::bgl_named_params, boost::edge_weight_t>, boost::edge_weight_t, boost::no_property> >]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/bellman_ford_shortest_paths.hpp:201:36: required from ‘bool boost::bellman_ford_shortest_paths(EdgeListGraph&, Size, const bgl_named_params&) [with EdgeListGraph = adjacency_list >; Size = int; P = double*; T = vertex_distance_t; R = bgl_named_params, edge_weight_t>, edge_weight_t, no_property> >]’ shortestPath.cpp:105:45: required from here /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:65:52: warning: ‘this’ pointer is null [-Wnonnull] 65 | static void failed() { ((Model*)0)->constraints(); } | ~~~~~~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/property_map/property_map.hpp:179:10: note: in a call to non-static member function ‘void boost::WritablePropertyMapConcept::constraints() [with PMap = double*; Key = long unsigned int]’ 179 | void constraints() { | ^~~~~~~~~~~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements > >]’: /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/graph_concepts.hpp:52:50: required from ‘struct boost::concepts::MultiPassInputIterator >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::concepts::MultiPassInputIterator >]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied > >::value’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied > >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_ >)>’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/graph_concepts.hpp:184:9: required from ‘boost::concepts::VertexListGraph::~VertexListGraph() [with G = R_adjacency_list]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/graph_concepts.hpp:176:1: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::VertexListGraphConcept >]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/bellman_ford_shortest_paths.hpp:218:5: required from ‘bool boost::floyd_warshall_all_pairs_shortest_paths(const VertexAndEdgeListGraph&, DistanceMatrix&, const WeightMap&, const BinaryPredicate&, const BinaryFunction&, const Infinity&, const Zero&) [with VertexAndEdgeListGraph = R_adjacency_list; DistanceMatrix = Basic2DMatrix; WeightMap = adj_list_edge_property_map, edge_weight_t>; BinaryPredicate = std::less; BinaryFunction = closed_plus; Infinity = double; Zero = double]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/floyd_warshall_shortest.hpp:172:55: required from ‘bool boost::detail::floyd_warshall_noninit_dispatch(const VertexAndEdgeListGraph&, DistanceMatrix&, WeightMap, const boost::bgl_named_params&) [with VertexAndEdgeListGraph = R_adjacency_list; DistanceMatrix = Basic2DMatrix; WeightMap = boost::adj_list_edge_property_map, boost::edge_weight_t>; P = int; T = int; R = boost::no_property]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/floyd_warshall_shortest.hpp:217:51: required from ‘bool boost::floyd_warshall_all_pairs_shortest_paths(const VertexAndEdgeListGraph&, DistanceMatrix&) [with VertexAndEdgeListGraph = R_adjacency_list; DistanceMatrix = Basic2DMatrix]’ shortestPath.cpp:186:48: required from here /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::concepts::MultiPassInputIterator >]’ 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ^ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::MultiPassInputIterator >]’: /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/graph_concepts.hpp:184:9: required from ‘boost::concepts::VertexListGraph::~VertexListGraph() [with G = R_adjacency_list]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/graph_concepts.hpp:176:1: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::VertexListGraphConcept >]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/bellman_ford_shortest_paths.hpp:218:5: required from ‘bool boost::floyd_warshall_all_pairs_shortest_paths(const VertexAndEdgeListGraph&, DistanceMatrix&, const WeightMap&, const BinaryPredicate&, const BinaryFunction&, const Infinity&, const Zero&) [with VertexAndEdgeListGraph = R_adjacency_list; DistanceMatrix = Basic2DMatrix; WeightMap = adj_list_edge_property_map, edge_weight_t>; BinaryPredicate = std::less; BinaryFunction = closed_plus; Infinity = double; Zero = double]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/floyd_warshall_shortest.hpp:172:55: required from ‘bool boost::detail::floyd_warshall_noninit_dispatch(const VertexAndEdgeListGraph&, DistanceMatrix&, WeightMap, const boost::bgl_named_params&) [with VertexAndEdgeListGraph = R_adjacency_list; DistanceMatrix = Basic2DMatrix; WeightMap = boost::adj_list_edge_property_map, boost::edge_weight_t>; P = int; T = int; R = boost::no_property]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/floyd_warshall_shortest.hpp:217:51: required from ‘bool boost::floyd_warshall_all_pairs_shortest_paths(const VertexAndEdgeListGraph&, DistanceMatrix&) [with VertexAndEdgeListGraph = R_adjacency_list; DistanceMatrix = Basic2DMatrix]’ shortestPath.cpp:186:48: required from here /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::concepts::MultiPassInputIterator::~MultiPassInputIterator() [with T = boost::range_detail::integer_iterator]’ 37 | ~model() | ^ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/graph_concepts.hpp:52:50: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 52 | BOOST_concept(MultiPassInputIterator, (T)) { BOOST_CONCEPT_USAGE( | ^~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements >]’: /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:208:5: required from ‘struct boost::Convertible’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::Convertible]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied >::value’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_)>’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/graph_concepts.hpp:185:9: required from ‘boost::concepts::VertexListGraph::~VertexListGraph() [with G = R_adjacency_list]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/graph_concepts.hpp:176:1: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::VertexListGraphConcept >]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/bellman_ford_shortest_paths.hpp:218:5: required from ‘bool boost::floyd_warshall_all_pairs_shortest_paths(const VertexAndEdgeListGraph&, DistanceMatrix&, const WeightMap&, const BinaryPredicate&, const BinaryFunction&, const Infinity&, const Zero&) [with VertexAndEdgeListGraph = R_adjacency_list; DistanceMatrix = Basic2DMatrix; WeightMap = adj_list_edge_property_map, edge_weight_t>; BinaryPredicate = std::less; BinaryFunction = closed_plus; Infinity = double; Zero = double]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/floyd_warshall_shortest.hpp:172:55: required from ‘bool boost::detail::floyd_warshall_noninit_dispatch(const VertexAndEdgeListGraph&, DistanceMatrix&, WeightMap, const boost::bgl_named_params&) [with VertexAndEdgeListGraph = R_adjacency_list; DistanceMatrix = Basic2DMatrix; WeightMap = boost::adj_list_edge_property_map, boost::edge_weight_t>; P = int; T = int; R = boost::no_property]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/floyd_warshall_shortest.hpp:217:51: required from ‘bool boost::floyd_warshall_all_pairs_shortest_paths(const VertexAndEdgeListGraph&, DistanceMatrix&) [with VertexAndEdgeListGraph = R_adjacency_list; DistanceMatrix = Basic2DMatrix]’ shortestPath.cpp:186:48: required from here /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::Convertible]’ 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ^ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::Convertible]’: /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/graph_concepts.hpp:185:9: required from ‘boost::concepts::VertexListGraph::~VertexListGraph() [with G = R_adjacency_list]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/graph_concepts.hpp:176:1: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::VertexListGraphConcept >]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/bellman_ford_shortest_paths.hpp:218:5: required from ‘bool boost::floyd_warshall_all_pairs_shortest_paths(const VertexAndEdgeListGraph&, DistanceMatrix&, const WeightMap&, const BinaryPredicate&, const BinaryFunction&, const Infinity&, const Zero&) [with VertexAndEdgeListGraph = R_adjacency_list; DistanceMatrix = Basic2DMatrix; WeightMap = adj_list_edge_property_map, edge_weight_t>; BinaryPredicate = std::less; BinaryFunction = closed_plus; Infinity = double; Zero = double]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/floyd_warshall_shortest.hpp:172:55: required from ‘bool boost::detail::floyd_warshall_noninit_dispatch(const VertexAndEdgeListGraph&, DistanceMatrix&, WeightMap, const boost::bgl_named_params&) [with VertexAndEdgeListGraph = R_adjacency_list; DistanceMatrix = Basic2DMatrix; WeightMap = boost::adj_list_edge_property_map, boost::edge_weight_t>; P = int; T = int; R = boost::no_property]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/floyd_warshall_shortest.hpp:217:51: required from ‘bool boost::floyd_warshall_all_pairs_shortest_paths(const VertexAndEdgeListGraph&, DistanceMatrix&) [with VertexAndEdgeListGraph = R_adjacency_list; DistanceMatrix = Basic2DMatrix]’ shortestPath.cpp:186:48: required from here /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::Convertible::~Convertible() [with X = boost::adj_list_dir_traversal_tag; Y = boost::vertex_list_graph_tag]’ 37 | ~model() | ^ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:208:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 208 | BOOST_CONCEPT_USAGE(Convertible) { | ^~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator >*, std::vector >, std::allocator > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::adjacency_list, boost::property, boost::no_property, boost::listS> > > >]’: /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/graph_concepts.hpp:52:50: required from ‘struct boost::concepts::MultiPassInputIterator, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator >*, std::vector >, std::allocator > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::adjacency_list, boost::property, boost::no_property, boost::listS> > >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::concepts::MultiPassInputIterator, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator >*, std::vector >, std::allocator > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::adjacency_list, boost::property, boost::no_property, boost::listS> > >]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator >*, std::vector >, std::allocator > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::adjacency_list, boost::property, boost::no_property, boost::listS> > > >::value’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator >*, std::vector >, std::allocator > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::adjacency_list, boost::property, boost::no_property, boost::listS> > > >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator >*, std::vector >, std::allocator > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::adjacency_list, boost::property, boost::no_property, boost::listS> > >)>’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/graph_concepts.hpp:235:9: required from ‘boost::concepts::EdgeListGraph::~EdgeListGraph() [with G = R_adjacency_list]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/graph_concepts.hpp:226:1: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::EdgeListGraphConcept >]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/bellman_ford_shortest_paths.hpp:97:5: required from ‘bool boost::floyd_warshall_all_pairs_shortest_paths(const VertexAndEdgeListGraph&, DistanceMatrix&, const WeightMap&, const BinaryPredicate&, const BinaryFunction&, const Infinity&, const Zero&) [with VertexAndEdgeListGraph = R_adjacency_list; DistanceMatrix = Basic2DMatrix; WeightMap = adj_list_edge_property_map, edge_weight_t>; BinaryPredicate = std::less; BinaryFunction = closed_plus; Infinity = double; Zero = double]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/floyd_warshall_shortest.hpp:172:55: required from ‘bool boost::detail::floyd_warshall_noninit_dispatch(const VertexAndEdgeListGraph&, DistanceMatrix&, WeightMap, const boost::bgl_named_params&) [with VertexAndEdgeListGraph = R_adjacency_list; DistanceMatrix = Basic2DMatrix; WeightMap = boost::adj_list_edge_property_map, boost::edge_weight_t>; P = int; T = int; R = boost::no_property]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/floyd_warshall_shortest.hpp:217:51: required from ‘bool boost::floyd_warshall_all_pairs_shortest_paths(const VertexAndEdgeListGraph&, DistanceMatrix&) [with VertexAndEdgeListGraph = R_adjacency_list; DistanceMatrix = Basic2DMatrix]’ shortestPath.cpp:186:48: required from here /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::concepts::MultiPassInputIterator, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator >*, std::vector >, std::allocator > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::adjacency_list, boost::property, boost::no_property, boost::listS> > >]’ 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ^ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::MultiPassInputIterator, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator >*, std::vector >, std::allocator > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::adjacency_list, boost::property, boost::no_property, boost::listS> > >]’: /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/graph_concepts.hpp:235:9: required from ‘boost::concepts::EdgeListGraph::~EdgeListGraph() [with G = R_adjacency_list]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/graph_concepts.hpp:226:1: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::EdgeListGraphConcept >]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/bellman_ford_shortest_paths.hpp:97:5: required from ‘bool boost::floyd_warshall_all_pairs_shortest_paths(const VertexAndEdgeListGraph&, DistanceMatrix&, const WeightMap&, const BinaryPredicate&, const BinaryFunction&, const Infinity&, const Zero&) [with VertexAndEdgeListGraph = R_adjacency_list; DistanceMatrix = Basic2DMatrix; WeightMap = adj_list_edge_property_map, edge_weight_t>; BinaryPredicate = std::less; BinaryFunction = closed_plus; Infinity = double; Zero = double]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/floyd_warshall_shortest.hpp:172:55: required from ‘bool boost::detail::floyd_warshall_noninit_dispatch(const VertexAndEdgeListGraph&, DistanceMatrix&, WeightMap, const boost::bgl_named_params&) [with VertexAndEdgeListGraph = R_adjacency_list; DistanceMatrix = Basic2DMatrix; WeightMap = boost::adj_list_edge_property_map, boost::edge_weight_t>; P = int; T = int; R = boost::no_property]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/floyd_warshall_shortest.hpp:217:51: required from ‘bool boost::floyd_warshall_all_pairs_shortest_paths(const VertexAndEdgeListGraph&, DistanceMatrix&) [with VertexAndEdgeListGraph = R_adjacency_list; DistanceMatrix = Basic2DMatrix]’ shortestPath.cpp:186:48: required from here /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::concepts::MultiPassInputIterator::~MultiPassInputIterator() [with T = boost::detail::adj_list_edge_iterator, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator >*, std::vector >, std::allocator > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::adjacency_list, boost::property, boost::no_property, boost::listS> >]’ 37 | ~model() | ^ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/graph_concepts.hpp:52:50: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 52 | BOOST_concept(MultiPassInputIterator, (T)) { BOOST_CONCEPT_USAGE( | ^~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements > >]’: /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:137:5: required from ‘struct boost::DefaultConstructible >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::DefaultConstructible >]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied > >::value’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied > >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_ >)>’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/graph_concepts.hpp:90:9: required from ‘boost::concepts::EdgeListGraph::~EdgeListGraph() [with G = R_adjacency_list]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/graph_concepts.hpp:226:1: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::EdgeListGraphConcept >]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/bellman_ford_shortest_paths.hpp:97:5: required from ‘bool boost::floyd_warshall_all_pairs_shortest_paths(const VertexAndEdgeListGraph&, DistanceMatrix&, const WeightMap&, const BinaryPredicate&, const BinaryFunction&, const Infinity&, const Zero&) [with VertexAndEdgeListGraph = R_adjacency_list; DistanceMatrix = Basic2DMatrix; WeightMap = adj_list_edge_property_map, edge_weight_t>; BinaryPredicate = std::less; BinaryFunction = closed_plus; Infinity = double; Zero = double]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/floyd_warshall_shortest.hpp:172:55: required from ‘bool boost::detail::floyd_warshall_noninit_dispatch(const VertexAndEdgeListGraph&, DistanceMatrix&, WeightMap, const boost::bgl_named_params&) [with VertexAndEdgeListGraph = R_adjacency_list; DistanceMatrix = Basic2DMatrix; WeightMap = boost::adj_list_edge_property_map, boost::edge_weight_t>; P = int; T = int; R = boost::no_property]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/floyd_warshall_shortest.hpp:217:51: required from ‘bool boost::floyd_warshall_all_pairs_shortest_paths(const VertexAndEdgeListGraph&, DistanceMatrix&) [with VertexAndEdgeListGraph = R_adjacency_list; DistanceMatrix = Basic2DMatrix]’ shortestPath.cpp:186:48: required from here /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::DefaultConstructible >]’ 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ^ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::DefaultConstructible >]’: /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/graph_concepts.hpp:90:9: required from ‘boost::concepts::EdgeListGraph::~EdgeListGraph() [with G = R_adjacency_list]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/graph_concepts.hpp:226:1: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::EdgeListGraphConcept >]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/bellman_ford_shortest_paths.hpp:97:5: required from ‘bool boost::floyd_warshall_all_pairs_shortest_paths(const VertexAndEdgeListGraph&, DistanceMatrix&, const WeightMap&, const BinaryPredicate&, const BinaryFunction&, const Infinity&, const Zero&) [with VertexAndEdgeListGraph = R_adjacency_list; DistanceMatrix = Basic2DMatrix; WeightMap = adj_list_edge_property_map, edge_weight_t>; BinaryPredicate = std::less; BinaryFunction = closed_plus; Infinity = double; Zero = double]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/floyd_warshall_shortest.hpp:172:55: required from ‘bool boost::detail::floyd_warshall_noninit_dispatch(const VertexAndEdgeListGraph&, DistanceMatrix&, WeightMap, const boost::bgl_named_params&) [with VertexAndEdgeListGraph = R_adjacency_list; DistanceMatrix = Basic2DMatrix; WeightMap = boost::adj_list_edge_property_map, boost::edge_weight_t>; P = int; T = int; R = boost::no_property]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/floyd_warshall_shortest.hpp:217:51: required from ‘bool boost::floyd_warshall_all_pairs_shortest_paths(const VertexAndEdgeListGraph&, DistanceMatrix&) [with VertexAndEdgeListGraph = R_adjacency_list; DistanceMatrix = Basic2DMatrix]’ shortestPath.cpp:186:48: required from here /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::DefaultConstructible::~DefaultConstructible() [with TT = boost::detail::edge_desc_impl]’ 37 | ~model() | ^ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:137:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 137 | BOOST_CONCEPT_USAGE(DefaultConstructible) { | ^~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements > >]’: /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:233:5: required from ‘struct boost::EqualityComparable >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::EqualityComparable >]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied > >::value’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied > >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_ >)>’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/graph_concepts.hpp:91:9: required from ‘boost::concepts::EdgeListGraph::~EdgeListGraph() [with G = R_adjacency_list]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/graph_concepts.hpp:226:1: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::EdgeListGraphConcept >]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/bellman_ford_shortest_paths.hpp:97:5: required from ‘bool boost::floyd_warshall_all_pairs_shortest_paths(const VertexAndEdgeListGraph&, DistanceMatrix&, const WeightMap&, const BinaryPredicate&, const BinaryFunction&, const Infinity&, const Zero&) [with VertexAndEdgeListGraph = R_adjacency_list; DistanceMatrix = Basic2DMatrix; WeightMap = adj_list_edge_property_map, edge_weight_t>; BinaryPredicate = std::less; BinaryFunction = closed_plus; Infinity = double; Zero = double]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/floyd_warshall_shortest.hpp:172:55: required from ‘bool boost::detail::floyd_warshall_noninit_dispatch(const VertexAndEdgeListGraph&, DistanceMatrix&, WeightMap, const boost::bgl_named_params&) [with VertexAndEdgeListGraph = R_adjacency_list; DistanceMatrix = Basic2DMatrix; WeightMap = boost::adj_list_edge_property_map, boost::edge_weight_t>; P = int; T = int; R = boost::no_property]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/floyd_warshall_shortest.hpp:217:51: required from ‘bool boost::floyd_warshall_all_pairs_shortest_paths(const VertexAndEdgeListGraph&, DistanceMatrix&) [with VertexAndEdgeListGraph = R_adjacency_list; DistanceMatrix = Basic2DMatrix]’ shortestPath.cpp:186:48: required from here /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::EqualityComparable >]’ 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ^ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::EqualityComparable >]’: /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/graph_concepts.hpp:91:9: required from ‘boost::concepts::EdgeListGraph::~EdgeListGraph() [with G = R_adjacency_list]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/graph_concepts.hpp:226:1: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::EdgeListGraphConcept >]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/bellman_ford_shortest_paths.hpp:97:5: required from ‘bool boost::floyd_warshall_all_pairs_shortest_paths(const VertexAndEdgeListGraph&, DistanceMatrix&, const WeightMap&, const BinaryPredicate&, const BinaryFunction&, const Infinity&, const Zero&) [with VertexAndEdgeListGraph = R_adjacency_list; DistanceMatrix = Basic2DMatrix; WeightMap = adj_list_edge_property_map, edge_weight_t>; BinaryPredicate = std::less; BinaryFunction = closed_plus; Infinity = double; Zero = double]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/floyd_warshall_shortest.hpp:172:55: required from ‘bool boost::detail::floyd_warshall_noninit_dispatch(const VertexAndEdgeListGraph&, DistanceMatrix&, WeightMap, const boost::bgl_named_params&) [with VertexAndEdgeListGraph = R_adjacency_list; DistanceMatrix = Basic2DMatrix; WeightMap = boost::adj_list_edge_property_map, boost::edge_weight_t>; P = int; T = int; R = boost::no_property]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/floyd_warshall_shortest.hpp:217:51: required from ‘bool boost::floyd_warshall_all_pairs_shortest_paths(const VertexAndEdgeListGraph&, DistanceMatrix&) [with VertexAndEdgeListGraph = R_adjacency_list; DistanceMatrix = Basic2DMatrix]’ shortestPath.cpp:186:48: required from here /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::EqualityComparable::~EqualityComparable() [with TT = boost::detail::edge_desc_impl]’ 37 | ~model() | ^ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:233:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 233 | BOOST_CONCEPT_USAGE(EqualityComparable) { | ^~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements > >]’: /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:145:5: required from ‘struct boost::Assignable >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::Assignable >]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied > >::value’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied > >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_ >)>’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/graph_concepts.hpp:92:9: required from ‘boost::concepts::EdgeListGraph::~EdgeListGraph() [with G = R_adjacency_list]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/graph_concepts.hpp:226:1: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::EdgeListGraphConcept >]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/bellman_ford_shortest_paths.hpp:97:5: required from ‘bool boost::floyd_warshall_all_pairs_shortest_paths(const VertexAndEdgeListGraph&, DistanceMatrix&, const WeightMap&, const BinaryPredicate&, const BinaryFunction&, const Infinity&, const Zero&) [with VertexAndEdgeListGraph = R_adjacency_list; DistanceMatrix = Basic2DMatrix; WeightMap = adj_list_edge_property_map, edge_weight_t>; BinaryPredicate = std::less; BinaryFunction = closed_plus; Infinity = double; Zero = double]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/floyd_warshall_shortest.hpp:172:55: required from ‘bool boost::detail::floyd_warshall_noninit_dispatch(const VertexAndEdgeListGraph&, DistanceMatrix&, WeightMap, const boost::bgl_named_params&) [with VertexAndEdgeListGraph = R_adjacency_list; DistanceMatrix = Basic2DMatrix; WeightMap = boost::adj_list_edge_property_map, boost::edge_weight_t>; P = int; T = int; R = boost::no_property]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/floyd_warshall_shortest.hpp:217:51: required from ‘bool boost::floyd_warshall_all_pairs_shortest_paths(const VertexAndEdgeListGraph&, DistanceMatrix&) [with VertexAndEdgeListGraph = R_adjacency_list; DistanceMatrix = Basic2DMatrix]’ shortestPath.cpp:186:48: required from here /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::Assignable >]’ 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ^ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::Assignable >]’: /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/graph_concepts.hpp:92:9: required from ‘boost::concepts::EdgeListGraph::~EdgeListGraph() [with G = R_adjacency_list]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/graph_concepts.hpp:226:1: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::EdgeListGraphConcept >]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/bellman_ford_shortest_paths.hpp:97:5: required from ‘bool boost::floyd_warshall_all_pairs_shortest_paths(const VertexAndEdgeListGraph&, DistanceMatrix&, const WeightMap&, const BinaryPredicate&, const BinaryFunction&, const Infinity&, const Zero&) [with VertexAndEdgeListGraph = R_adjacency_list; DistanceMatrix = Basic2DMatrix; WeightMap = adj_list_edge_property_map, edge_weight_t>; BinaryPredicate = std::less; BinaryFunction = closed_plus; Infinity = double; Zero = double]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/floyd_warshall_shortest.hpp:172:55: required from ‘bool boost::detail::floyd_warshall_noninit_dispatch(const VertexAndEdgeListGraph&, DistanceMatrix&, WeightMap, const boost::bgl_named_params&) [with VertexAndEdgeListGraph = R_adjacency_list; DistanceMatrix = Basic2DMatrix; WeightMap = boost::adj_list_edge_property_map, boost::edge_weight_t>; P = int; T = int; R = boost::no_property]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/floyd_warshall_shortest.hpp:217:51: required from ‘bool boost::floyd_warshall_all_pairs_shortest_paths(const VertexAndEdgeListGraph&, DistanceMatrix&) [with VertexAndEdgeListGraph = R_adjacency_list; DistanceMatrix = Basic2DMatrix]’ shortestPath.cpp:186:48: required from here /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::Assignable::~Assignable() [with TT = boost::detail::edge_desc_impl]’ 37 | ~model() | ^ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:145:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 145 | BOOST_CONCEPT_USAGE(Assignable) { | ^~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements >]’: /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:208:5: required from ‘struct boost::Convertible’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::Convertible]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied >::value’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_)>’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/graph_concepts.hpp:239:9: required from ‘boost::concepts::EdgeListGraph::~EdgeListGraph() [with G = R_adjacency_list]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/graph_concepts.hpp:226:1: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::EdgeListGraphConcept >]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/bellman_ford_shortest_paths.hpp:97:5: required from ‘bool boost::floyd_warshall_all_pairs_shortest_paths(const VertexAndEdgeListGraph&, DistanceMatrix&, const WeightMap&, const BinaryPredicate&, const BinaryFunction&, const Infinity&, const Zero&) [with VertexAndEdgeListGraph = R_adjacency_list; DistanceMatrix = Basic2DMatrix; WeightMap = adj_list_edge_property_map, edge_weight_t>; BinaryPredicate = std::less; BinaryFunction = closed_plus; Infinity = double; Zero = double]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/floyd_warshall_shortest.hpp:172:55: required from ‘bool boost::detail::floyd_warshall_noninit_dispatch(const VertexAndEdgeListGraph&, DistanceMatrix&, WeightMap, const boost::bgl_named_params&) [with VertexAndEdgeListGraph = R_adjacency_list; DistanceMatrix = Basic2DMatrix; WeightMap = boost::adj_list_edge_property_map, boost::edge_weight_t>; P = int; T = int; R = boost::no_property]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/floyd_warshall_shortest.hpp:217:51: required from ‘bool boost::floyd_warshall_all_pairs_shortest_paths(const VertexAndEdgeListGraph&, DistanceMatrix&) [with VertexAndEdgeListGraph = R_adjacency_list; DistanceMatrix = Basic2DMatrix]’ shortestPath.cpp:186:48: required from here /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::Convertible]’ 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ^ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::Convertible]’: /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/graph_concepts.hpp:239:9: required from ‘boost::concepts::EdgeListGraph::~EdgeListGraph() [with G = R_adjacency_list]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/graph_concepts.hpp:226:1: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::EdgeListGraphConcept >]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/bellman_ford_shortest_paths.hpp:97:5: required from ‘bool boost::floyd_warshall_all_pairs_shortest_paths(const VertexAndEdgeListGraph&, DistanceMatrix&, const WeightMap&, const BinaryPredicate&, const BinaryFunction&, const Infinity&, const Zero&) [with VertexAndEdgeListGraph = R_adjacency_list; DistanceMatrix = Basic2DMatrix; WeightMap = adj_list_edge_property_map, edge_weight_t>; BinaryPredicate = std::less; BinaryFunction = closed_plus; Infinity = double; Zero = double]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/floyd_warshall_shortest.hpp:172:55: required from ‘bool boost::detail::floyd_warshall_noninit_dispatch(const VertexAndEdgeListGraph&, DistanceMatrix&, WeightMap, const boost::bgl_named_params&) [with VertexAndEdgeListGraph = R_adjacency_list; DistanceMatrix = Basic2DMatrix; WeightMap = boost::adj_list_edge_property_map, boost::edge_weight_t>; P = int; T = int; R = boost::no_property]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/floyd_warshall_shortest.hpp:217:51: required from ‘bool boost::floyd_warshall_all_pairs_shortest_paths(const VertexAndEdgeListGraph&, DistanceMatrix&) [with VertexAndEdgeListGraph = R_adjacency_list; DistanceMatrix = Basic2DMatrix]’ shortestPath.cpp:186:48: required from here /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::Convertible::~Convertible() [with X = boost::adj_list_dir_traversal_tag; Y = boost::edge_list_graph_tag]’ 37 | ~model() | ^ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:208:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 208 | BOOST_CONCEPT_USAGE(Convertible) { | ^~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements >*, std::vector >, std::allocator > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >]’: /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/graph_concepts.hpp:52:50: required from ‘struct boost::concepts::MultiPassInputIterator >*, std::vector >, std::allocator > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::concepts::MultiPassInputIterator >*, std::vector >, std::allocator > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> >]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied >*, std::vector >, std::allocator > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::value’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied >*, std::vector >, std::allocator > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_ >*, std::vector >, std::allocator > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> >)>’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/graph_concepts.hpp:89:9: required from ‘boost::concepts::IncidenceGraph::~IncidenceGraph() [with G = R_adjacency_list]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/graph_concepts.hpp:75:1: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::IncidenceGraphConcept >]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/breadth_first_search.hpp:62:5: required from ‘bool boost::floyd_warshall_all_pairs_shortest_paths(const VertexAndEdgeListGraph&, DistanceMatrix&, const WeightMap&, const BinaryPredicate&, const BinaryFunction&, const Infinity&, const Zero&) [with VertexAndEdgeListGraph = R_adjacency_list; DistanceMatrix = Basic2DMatrix; WeightMap = adj_list_edge_property_map, edge_weight_t>; BinaryPredicate = std::less; BinaryFunction = closed_plus; Infinity = double; Zero = double]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/floyd_warshall_shortest.hpp:172:55: required from ‘bool boost::detail::floyd_warshall_noninit_dispatch(const VertexAndEdgeListGraph&, DistanceMatrix&, WeightMap, const boost::bgl_named_params&) [with VertexAndEdgeListGraph = R_adjacency_list; DistanceMatrix = Basic2DMatrix; WeightMap = boost::adj_list_edge_property_map, boost::edge_weight_t>; P = int; T = int; R = boost::no_property]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/floyd_warshall_shortest.hpp:217:51: required from ‘bool boost::floyd_warshall_all_pairs_shortest_paths(const VertexAndEdgeListGraph&, DistanceMatrix&) [with VertexAndEdgeListGraph = R_adjacency_list; DistanceMatrix = Basic2DMatrix]’ shortestPath.cpp:186:48: required from here /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::concepts::MultiPassInputIterator >*, std::vector >, std::allocator > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> >]’ 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ^ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::MultiPassInputIterator >*, std::vector >, std::allocator > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> >]’: /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/graph_concepts.hpp:89:9: required from ‘boost::concepts::IncidenceGraph::~IncidenceGraph() [with G = R_adjacency_list]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/graph_concepts.hpp:75:1: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::IncidenceGraphConcept >]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/breadth_first_search.hpp:62:5: required from ‘bool boost::floyd_warshall_all_pairs_shortest_paths(const VertexAndEdgeListGraph&, DistanceMatrix&, const WeightMap&, const BinaryPredicate&, const BinaryFunction&, const Infinity&, const Zero&) [with VertexAndEdgeListGraph = R_adjacency_list; DistanceMatrix = Basic2DMatrix; WeightMap = adj_list_edge_property_map, edge_weight_t>; BinaryPredicate = std::less; BinaryFunction = closed_plus; Infinity = double; Zero = double]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/floyd_warshall_shortest.hpp:172:55: required from ‘bool boost::detail::floyd_warshall_noninit_dispatch(const VertexAndEdgeListGraph&, DistanceMatrix&, WeightMap, const boost::bgl_named_params&) [with VertexAndEdgeListGraph = R_adjacency_list; DistanceMatrix = Basic2DMatrix; WeightMap = boost::adj_list_edge_property_map, boost::edge_weight_t>; P = int; T = int; R = boost::no_property]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/floyd_warshall_shortest.hpp:217:51: required from ‘bool boost::floyd_warshall_all_pairs_shortest_paths(const VertexAndEdgeListGraph&, DistanceMatrix&) [with VertexAndEdgeListGraph = R_adjacency_list; DistanceMatrix = Basic2DMatrix]’ shortestPath.cpp:186:48: required from here /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::concepts::MultiPassInputIterator::~MultiPassInputIterator() [with T = boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator >*, std::vector >, std::allocator > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>]’ 37 | ~model() | ^ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/graph_concepts.hpp:52:50: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 52 | BOOST_concept(MultiPassInputIterator, (T)) { BOOST_CONCEPT_USAGE( | ^~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements >]’: /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:208:5: required from ‘struct boost::Convertible’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::Convertible]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied >::value’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_)>’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/graph_concepts.hpp:93:9: required from ‘boost::concepts::IncidenceGraph::~IncidenceGraph() [with G = R_adjacency_list]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/graph_concepts.hpp:75:1: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::IncidenceGraphConcept >]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/breadth_first_search.hpp:62:5: required from ‘bool boost::floyd_warshall_all_pairs_shortest_paths(const VertexAndEdgeListGraph&, DistanceMatrix&, const WeightMap&, const BinaryPredicate&, const BinaryFunction&, const Infinity&, const Zero&) [with VertexAndEdgeListGraph = R_adjacency_list; DistanceMatrix = Basic2DMatrix; WeightMap = adj_list_edge_property_map, edge_weight_t>; BinaryPredicate = std::less; BinaryFunction = closed_plus; Infinity = double; Zero = double]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/floyd_warshall_shortest.hpp:172:55: required from ‘bool boost::detail::floyd_warshall_noninit_dispatch(const VertexAndEdgeListGraph&, DistanceMatrix&, WeightMap, const boost::bgl_named_params&) [with VertexAndEdgeListGraph = R_adjacency_list; DistanceMatrix = Basic2DMatrix; WeightMap = boost::adj_list_edge_property_map, boost::edge_weight_t>; P = int; T = int; R = boost::no_property]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/floyd_warshall_shortest.hpp:217:51: required from ‘bool boost::floyd_warshall_all_pairs_shortest_paths(const VertexAndEdgeListGraph&, DistanceMatrix&) [with VertexAndEdgeListGraph = R_adjacency_list; DistanceMatrix = Basic2DMatrix]’ shortestPath.cpp:186:48: required from here /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::Convertible]’ 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ^ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::Convertible]’: /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/graph_concepts.hpp:93:9: required from ‘boost::concepts::IncidenceGraph::~IncidenceGraph() [with G = R_adjacency_list]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/graph_concepts.hpp:75:1: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::IncidenceGraphConcept >]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/breadth_first_search.hpp:62:5: required from ‘bool boost::floyd_warshall_all_pairs_shortest_paths(const VertexAndEdgeListGraph&, DistanceMatrix&, const WeightMap&, const BinaryPredicate&, const BinaryFunction&, const Infinity&, const Zero&) [with VertexAndEdgeListGraph = R_adjacency_list; DistanceMatrix = Basic2DMatrix; WeightMap = adj_list_edge_property_map, edge_weight_t>; BinaryPredicate = std::less; BinaryFunction = closed_plus; Infinity = double; Zero = double]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/floyd_warshall_shortest.hpp:172:55: required from ‘bool boost::detail::floyd_warshall_noninit_dispatch(const VertexAndEdgeListGraph&, DistanceMatrix&, WeightMap, const boost::bgl_named_params&) [with VertexAndEdgeListGraph = R_adjacency_list; DistanceMatrix = Basic2DMatrix; WeightMap = boost::adj_list_edge_property_map, boost::edge_weight_t>; P = int; T = int; R = boost::no_property]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/floyd_warshall_shortest.hpp:217:51: required from ‘bool boost::floyd_warshall_all_pairs_shortest_paths(const VertexAndEdgeListGraph&, DistanceMatrix&) [with VertexAndEdgeListGraph = R_adjacency_list; DistanceMatrix = Basic2DMatrix]’ shortestPath.cpp:186:48: required from here /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::Convertible::~Convertible() [with X = boost::adj_list_dir_traversal_tag; Y = boost::incidence_graph_tag]’ 37 | ~model() | ^ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:208:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 208 | BOOST_CONCEPT_USAGE(Convertible) { | ^~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::SignedInteger]’: /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:514:9: required from ‘boost::InputIterator::~InputIterator() [with TT = __gnu_cxx::__normal_iterator >]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/usage.hpp:20:48: required from ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::InputIterator<__gnu_cxx::__normal_iterator > >]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements > > >]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:512:7: required from ‘struct boost::InputIterator<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:540:3: required from ‘struct boost::ForwardIterator<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:568:3: [ skipping 5 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied > > >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_ > >)>’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/property_map/property_map.hpp:354:5: required from ‘boost::iterator_property_map boost::make_iterator_property_map(RAIter, ID, Value) [with RAIter = __gnu_cxx::__normal_iterator >; Value = double; ID = vec_adj_list_vertex_id_map, long unsigned int>]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/dijkstra_shortest_paths.hpp:556:43: required from ‘void boost::detail::dijkstra_dispatch1(const VertexListGraph&, typename boost::graph_traits::vertex_descriptor, DistanceMap, WeightMap, IndexMap, const Params&) [with VertexListGraph = R_adjacency_list; DistanceMap = double*; WeightMap = boost::adj_list_edge_property_map, boost::edge_weight_t>; IndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>; Params = boost::bgl_named_params >; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/dijkstra_shortest_paths.hpp:570:31: required from ‘void boost::dijkstra_shortest_paths(const VertexListGraph&, typename graph_traits::vertex_descriptor, const bgl_named_params&) [with VertexListGraph = R_adjacency_list; Param = double*; Tag = vertex_distance_t; Rest = bgl_named_params; typename graph_traits::vertex_descriptor = long unsigned int]’ shortestPath.cpp:25:32: required from here /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:107:22: note: in a call to non-static member function ‘boost::SignedInteger::~SignedInteger()’ 107 | template <> struct SignedInteger {}; | ^~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements >]’: /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:208:5: required from ‘struct boost::Convertible’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::Convertible]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied >::value’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_)>’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:515:9: [ skipping 10 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied > > >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_ > >)>’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/property_map/property_map.hpp:354:5: required from ‘boost::iterator_property_map boost::make_iterator_property_map(RAIter, ID, Value) [with RAIter = __gnu_cxx::__normal_iterator >; Value = double; ID = vec_adj_list_vertex_id_map, long unsigned int>]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/dijkstra_shortest_paths.hpp:556:43: required from ‘void boost::detail::dijkstra_dispatch1(const VertexListGraph&, typename boost::graph_traits::vertex_descriptor, DistanceMap, WeightMap, IndexMap, const Params&) [with VertexListGraph = R_adjacency_list; DistanceMap = double*; WeightMap = boost::adj_list_edge_property_map, boost::edge_weight_t>; IndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>; Params = boost::bgl_named_params >; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/dijkstra_shortest_paths.hpp:570:31: required from ‘void boost::dijkstra_shortest_paths(const VertexListGraph&, typename graph_traits::vertex_descriptor, const bgl_named_params&) [with VertexListGraph = R_adjacency_list; Param = double*; Tag = vertex_distance_t; Rest = bgl_named_params; typename graph_traits::vertex_descriptor = long unsigned int]’ shortestPath.cpp:25:32: required from here /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::Convertible]’ 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ^ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::Convertible]’: /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:515:9: required from ‘boost::InputIterator::~InputIterator() [with TT = __gnu_cxx::__normal_iterator >]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/usage.hpp:20:48: required from ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::InputIterator<__gnu_cxx::__normal_iterator > >]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements > > >]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:512:7: required from ‘struct boost::InputIterator<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:540:3: required from ‘struct boost::ForwardIterator<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:568:3: [ skipping 5 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied > > >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_ > >)>’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/property_map/property_map.hpp:354:5: required from ‘boost::iterator_property_map boost::make_iterator_property_map(RAIter, ID, Value) [with RAIter = __gnu_cxx::__normal_iterator >; Value = double; ID = vec_adj_list_vertex_id_map, long unsigned int>]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/dijkstra_shortest_paths.hpp:556:43: required from ‘void boost::detail::dijkstra_dispatch1(const VertexListGraph&, typename boost::graph_traits::vertex_descriptor, DistanceMap, WeightMap, IndexMap, const Params&) [with VertexListGraph = R_adjacency_list; DistanceMap = double*; WeightMap = boost::adj_list_edge_property_map, boost::edge_weight_t>; IndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>; Params = boost::bgl_named_params >; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/dijkstra_shortest_paths.hpp:570:31: required from ‘void boost::dijkstra_shortest_paths(const VertexListGraph&, typename graph_traits::vertex_descriptor, const bgl_named_params&) [with VertexListGraph = R_adjacency_list; Param = double*; Tag = vertex_distance_t; Rest = bgl_named_params; typename graph_traits::vertex_descriptor = long unsigned int]’ shortestPath.cpp:25:32: required from here /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::Convertible::~Convertible() [with X = std::random_access_iterator_tag; Y = std::input_iterator_tag]’ 37 | ~model() | ^ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:208:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 208 | BOOST_CONCEPT_USAGE(Convertible) { | ^~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements >]’: /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:208:5: required from ‘struct boost::Convertible’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::Convertible]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied >::value’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_)>’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:545:11: [ skipping 9 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied > > >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_ > >)>’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/property_map/property_map.hpp:354:5: required from ‘boost::iterator_property_map boost::make_iterator_property_map(RAIter, ID, Value) [with RAIter = __gnu_cxx::__normal_iterator >; Value = double; ID = vec_adj_list_vertex_id_map, long unsigned int>]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/dijkstra_shortest_paths.hpp:556:43: required from ‘void boost::detail::dijkstra_dispatch1(const VertexListGraph&, typename boost::graph_traits::vertex_descriptor, DistanceMap, WeightMap, IndexMap, const Params&) [with VertexListGraph = R_adjacency_list; DistanceMap = double*; WeightMap = boost::adj_list_edge_property_map, boost::edge_weight_t>; IndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>; Params = boost::bgl_named_params >; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/dijkstra_shortest_paths.hpp:570:31: required from ‘void boost::dijkstra_shortest_paths(const VertexListGraph&, typename graph_traits::vertex_descriptor, const bgl_named_params&) [with VertexListGraph = R_adjacency_list; Param = double*; Tag = vertex_distance_t; Rest = bgl_named_params; typename graph_traits::vertex_descriptor = long unsigned int]’ shortestPath.cpp:25:32: required from here /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::Convertible]’ 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ^ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::Convertible]’: /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:545:11: required from ‘boost::ForwardIterator::~ForwardIterator() [with TT = __gnu_cxx::__normal_iterator >]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/usage.hpp:20:48: required from ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::ForwardIterator<__gnu_cxx::__normal_iterator > >]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements > > >]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:543:7: required from ‘struct boost::ForwardIterator<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:568:3: required from ‘struct boost::BidirectionalIterator<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:597:3: [ skipping 4 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied > > >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_ > >)>’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/property_map/property_map.hpp:354:5: required from ‘boost::iterator_property_map boost::make_iterator_property_map(RAIter, ID, Value) [with RAIter = __gnu_cxx::__normal_iterator >; Value = double; ID = vec_adj_list_vertex_id_map, long unsigned int>]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/dijkstra_shortest_paths.hpp:556:43: required from ‘void boost::detail::dijkstra_dispatch1(const VertexListGraph&, typename boost::graph_traits::vertex_descriptor, DistanceMap, WeightMap, IndexMap, const Params&) [with VertexListGraph = R_adjacency_list; DistanceMap = double*; WeightMap = boost::adj_list_edge_property_map, boost::edge_weight_t>; IndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>; Params = boost::bgl_named_params >; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/dijkstra_shortest_paths.hpp:570:31: required from ‘void boost::dijkstra_shortest_paths(const VertexListGraph&, typename graph_traits::vertex_descriptor, const bgl_named_params&) [with VertexListGraph = R_adjacency_list; Param = double*; Tag = vertex_distance_t; Rest = bgl_named_params; typename graph_traits::vertex_descriptor = long unsigned int]’ shortestPath.cpp:25:32: required from here /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::Convertible::~Convertible() [with X = std::random_access_iterator_tag; Y = std::forward_iterator_tag]’ 37 | ~model() | ^ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:208:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 208 | BOOST_CONCEPT_USAGE(Convertible) { | ^~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements >]’: /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:208:5: required from ‘struct boost::Convertible’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::Convertible]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied >::value’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_)>’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:573:11: [ skipping 8 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied > > >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_ > >)>’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/property_map/property_map.hpp:354:5: required from ‘boost::iterator_property_map boost::make_iterator_property_map(RAIter, ID, Value) [with RAIter = __gnu_cxx::__normal_iterator >; Value = double; ID = vec_adj_list_vertex_id_map, long unsigned int>]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/dijkstra_shortest_paths.hpp:556:43: required from ‘void boost::detail::dijkstra_dispatch1(const VertexListGraph&, typename boost::graph_traits::vertex_descriptor, DistanceMap, WeightMap, IndexMap, const Params&) [with VertexListGraph = R_adjacency_list; DistanceMap = double*; WeightMap = boost::adj_list_edge_property_map, boost::edge_weight_t>; IndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>; Params = boost::bgl_named_params >; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/dijkstra_shortest_paths.hpp:570:31: required from ‘void boost::dijkstra_shortest_paths(const VertexListGraph&, typename graph_traits::vertex_descriptor, const bgl_named_params&) [with VertexListGraph = R_adjacency_list; Param = double*; Tag = vertex_distance_t; Rest = bgl_named_params; typename graph_traits::vertex_descriptor = long unsigned int]’ shortestPath.cpp:25:32: required from here /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::Convertible]’ 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ^ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::Convertible]’: /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:573:11: required from ‘boost::BidirectionalIterator::~BidirectionalIterator() [with TT = __gnu_cxx::__normal_iterator >]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/usage.hpp:20:48: required from ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::BidirectionalIterator<__gnu_cxx::__normal_iterator > >]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements > > >]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:571:7: required from ‘struct boost::BidirectionalIterator<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:597:3: required from ‘struct boost::RandomAccessIterator<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:597:3: [ skipping 3 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied > > >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_ > >)>’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/property_map/property_map.hpp:354:5: required from ‘boost::iterator_property_map boost::make_iterator_property_map(RAIter, ID, Value) [with RAIter = __gnu_cxx::__normal_iterator >; Value = double; ID = vec_adj_list_vertex_id_map, long unsigned int>]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/dijkstra_shortest_paths.hpp:556:43: required from ‘void boost::detail::dijkstra_dispatch1(const VertexListGraph&, typename boost::graph_traits::vertex_descriptor, DistanceMap, WeightMap, IndexMap, const Params&) [with VertexListGraph = R_adjacency_list; DistanceMap = double*; WeightMap = boost::adj_list_edge_property_map, boost::edge_weight_t>; IndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>; Params = boost::bgl_named_params >; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/dijkstra_shortest_paths.hpp:570:31: required from ‘void boost::dijkstra_shortest_paths(const VertexListGraph&, typename graph_traits::vertex_descriptor, const bgl_named_params&) [with VertexListGraph = R_adjacency_list; Param = double*; Tag = vertex_distance_t; Rest = bgl_named_params; typename graph_traits::vertex_descriptor = long unsigned int]’ shortestPath.cpp:25:32: required from here /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::Convertible::~Convertible() [with X = std::random_access_iterator_tag; Y = std::bidirectional_iterator_tag]’ 37 | ~model() | ^ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:208:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 208 | BOOST_CONCEPT_USAGE(Convertible) { | ^~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::Convertible]’: /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements >]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:208:5: required from ‘struct boost::Convertible’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::Convertible]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied >::value’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:45:51: [ skipping 2 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:603:11: required from ‘boost::RandomAccessIterator::~RandomAccessIterator() [with TT = __gnu_cxx::__normal_iterator >]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:597:3: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator > >]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/property_map/property_map.hpp:354:5: required from ‘boost::iterator_property_map boost::make_iterator_property_map(RAIter, ID, Value) [with RAIter = __gnu_cxx::__normal_iterator >; Value = double; ID = vec_adj_list_vertex_id_map, long unsigned int>]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/dijkstra_shortest_paths.hpp:556:43: required from ‘void boost::detail::dijkstra_dispatch1(const VertexListGraph&, typename boost::graph_traits::vertex_descriptor, DistanceMap, WeightMap, IndexMap, const Params&) [with VertexListGraph = R_adjacency_list; DistanceMap = double*; WeightMap = boost::adj_list_edge_property_map, boost::edge_weight_t>; IndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>; Params = boost::bgl_named_params >; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/dijkstra_shortest_paths.hpp:570:31: required from ‘void boost::dijkstra_shortest_paths(const VertexListGraph&, typename graph_traits::vertex_descriptor, const bgl_named_params&) [with VertexListGraph = R_adjacency_list; Param = double*; Tag = vertex_distance_t; Rest = bgl_named_params; typename graph_traits::vertex_descriptor = long unsigned int]’ shortestPath.cpp:25:32: required from here /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::Convertible::~Convertible() [with X = std::random_access_iterator_tag; Y = std::random_access_iterator_tag]’ 37 | ~model() | ^ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:208:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 208 | BOOST_CONCEPT_USAGE(Convertible) { | ^~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::adjacency_list, boost::property >, boost::no_property, boost::listS> > > >]’: /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/graph_concepts.hpp:52:50: required from ‘struct boost::concepts::MultiPassInputIterator, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::adjacency_list, boost::property >, boost::no_property, boost::listS> > >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::concepts::MultiPassInputIterator, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::adjacency_list, boost::property >, boost::no_property, boost::listS> > >]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::adjacency_list, boost::property >, boost::no_property, boost::listS> > > >::value’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::adjacency_list, boost::property >, boost::no_property, boost::listS> > > >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:72:8: [ skipping 2 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/graph_concepts.hpp:226:1: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::EdgeListGraphConcept, boost::property >, boost::no_property, boost::listS> >]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/bellman_ford_shortest_paths.hpp:97:5: required from ‘bool boost::bellman_ford_shortest_paths(EdgeListGraph&, Size, WeightMap, PredecessorMap, DistanceMap, BinaryFunction, BinaryPredicate, BellmanFordVisitor) [with EdgeListGraph = adjacency_list, property >, no_property, listS>; Size = long unsigned int; WeightMap = adj_list_edge_property_map >, edge_weight_t>; PredecessorMap = dummy_property_map; DistanceMap = vec_adj_list_vertex_property_map, property >, no_property, listS>, adjacency_list, property >, no_property, listS>*, double, double&, vertex_distance_t>; BinaryFunction = closed_plus; BinaryPredicate = std::less; BellmanFordVisitor = bellman_visitor<>]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/johnson_all_pairs_shortest.hpp:112:36: required from ‘bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, VertexID, Weight, const BinaryPredicate&, const BinaryFunction&, const Infinity&, DistanceZero) [with VertexAndEdgeListGraph = R_adjacency_list; DistanceMatrix = Basic2DMatrix; VertexID = vec_adj_list_vertex_id_map, long unsigned int>; Weight = adj_list_edge_property_map, edge_weight_t>; BinaryPredicate = std::less; BinaryFunction = closed_plus; Infinity = double; DistanceZero = double]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/johnson_all_pairs_shortest.hpp:164:48: required from ‘bool boost::detail::johnson_dispatch(VertexAndEdgeListGraph&, DistanceMatrix&, const boost::bgl_named_params&, Weight, VertexID) [with VertexAndEdgeListGraph = R_adjacency_list; DistanceMatrix = Basic2DMatrix; P = int; T = int; R = boost::no_property; Weight = boost::adj_list_edge_property_map, boost::edge_weight_t>; VertexID = boost::vec_adj_list_vertex_id_map, long unsigned int>]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/johnson_all_pairs_shortest.hpp:192:36: required from ‘bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&) [with VertexAndEdgeListGraph = R_adjacency_list; DistanceMatrix = Basic2DMatrix]’ shortestPath.cpp:56:41: required from here /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::concepts::MultiPassInputIterator, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::adjacency_list, boost::property >, boost::no_property, boost::listS> > >]’ 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ^ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::MultiPassInputIterator, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::adjacency_list, boost::property >, boost::no_property, boost::listS> > >]’: /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/graph_concepts.hpp:235:9: required from ‘boost::concepts::EdgeListGraph::~EdgeListGraph() [with G = boost::adjacency_list, boost::property >, boost::no_property, boost::listS>]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/graph_concepts.hpp:226:1: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::EdgeListGraphConcept, boost::property >, boost::no_property, boost::listS> >]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/bellman_ford_shortest_paths.hpp:97:5: required from ‘bool boost::bellman_ford_shortest_paths(EdgeListGraph&, Size, WeightMap, PredecessorMap, DistanceMap, BinaryFunction, BinaryPredicate, BellmanFordVisitor) [with EdgeListGraph = adjacency_list, property >, no_property, listS>; Size = long unsigned int; WeightMap = adj_list_edge_property_map >, edge_weight_t>; PredecessorMap = dummy_property_map; DistanceMap = vec_adj_list_vertex_property_map, property >, no_property, listS>, adjacency_list, property >, no_property, listS>*, double, double&, vertex_distance_t>; BinaryFunction = closed_plus; BinaryPredicate = std::less; BellmanFordVisitor = bellman_visitor<>]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/johnson_all_pairs_shortest.hpp:112:36: required from ‘bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, VertexID, Weight, const BinaryPredicate&, const BinaryFunction&, const Infinity&, DistanceZero) [with VertexAndEdgeListGraph = R_adjacency_list; DistanceMatrix = Basic2DMatrix; VertexID = vec_adj_list_vertex_id_map, long unsigned int>; Weight = adj_list_edge_property_map, edge_weight_t>; BinaryPredicate = std::less; BinaryFunction = closed_plus; Infinity = double; DistanceZero = double]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/johnson_all_pairs_shortest.hpp:164:48: required from ‘bool boost::detail::johnson_dispatch(VertexAndEdgeListGraph&, DistanceMatrix&, const boost::bgl_named_params&, Weight, VertexID) [with VertexAndEdgeListGraph = R_adjacency_list; DistanceMatrix = Basic2DMatrix; P = int; T = int; R = boost::no_property; Weight = boost::adj_list_edge_property_map, boost::edge_weight_t>; VertexID = boost::vec_adj_list_vertex_id_map, long unsigned int>]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/johnson_all_pairs_shortest.hpp:192:36: required from ‘bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&) [with VertexAndEdgeListGraph = R_adjacency_list; DistanceMatrix = Basic2DMatrix]’ shortestPath.cpp:56:41: required from here /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::concepts::MultiPassInputIterator::~MultiPassInputIterator() [with T = boost::detail::adj_list_edge_iterator, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::adjacency_list, boost::property >, boost::no_property, boost::listS> >]’ 37 | ~model() | ^ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/graph_concepts.hpp:52:50: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 52 | BOOST_concept(MultiPassInputIterator, (T)) { BOOST_CONCEPT_USAGE( | ^~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements >]’: /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:208:5: required from ‘struct boost::Convertible’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:206:3: required from ‘struct boost::ConvertibleConcept’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::ConvertibleConcept]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied >::value’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:72:8: [ skipping 10 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_, boost::property >, boost::no_property, boost::listS>, boost::adjacency_list, boost::property >, boost::no_property, boost::listS>*, double, double&, boost::vertex_distance_t>, long unsigned int>)>’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/bellman_ford_shortest_paths.hpp:101:5: required from ‘bool boost::bellman_ford_shortest_paths(EdgeListGraph&, Size, WeightMap, PredecessorMap, DistanceMap, BinaryFunction, BinaryPredicate, BellmanFordVisitor) [with EdgeListGraph = adjacency_list, property >, no_property, listS>; Size = long unsigned int; WeightMap = adj_list_edge_property_map >, edge_weight_t>; PredecessorMap = dummy_property_map; DistanceMap = vec_adj_list_vertex_property_map, property >, no_property, listS>, adjacency_list, property >, no_property, listS>*, double, double&, vertex_distance_t>; BinaryFunction = closed_plus; BinaryPredicate = std::less; BellmanFordVisitor = bellman_visitor<>]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/johnson_all_pairs_shortest.hpp:112:36: required from ‘bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, VertexID, Weight, const BinaryPredicate&, const BinaryFunction&, const Infinity&, DistanceZero) [with VertexAndEdgeListGraph = R_adjacency_list; DistanceMatrix = Basic2DMatrix; VertexID = vec_adj_list_vertex_id_map, long unsigned int>; Weight = adj_list_edge_property_map, edge_weight_t>; BinaryPredicate = std::less; BinaryFunction = closed_plus; Infinity = double; DistanceZero = double]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/johnson_all_pairs_shortest.hpp:164:48: required from ‘bool boost::detail::johnson_dispatch(VertexAndEdgeListGraph&, DistanceMatrix&, const boost::bgl_named_params&, Weight, VertexID) [with VertexAndEdgeListGraph = R_adjacency_list; DistanceMatrix = Basic2DMatrix; P = int; T = int; R = boost::no_property; Weight = boost::adj_list_edge_property_map, boost::edge_weight_t>; VertexID = boost::vec_adj_list_vertex_id_map, long unsigned int>]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/johnson_all_pairs_shortest.hpp:192:36: required from ‘bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&) [with VertexAndEdgeListGraph = R_adjacency_list; DistanceMatrix = Basic2DMatrix]’ shortestPath.cpp:56:41: required from here /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::Convertible]’ 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ^ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::ConvertibleConcept]’: /home/omnipath/local/R/4.4-3.20/BH/include/boost/property_map/property_map.hpp:180:7: required from ‘void boost::WritablePropertyMapConcept::constraints() [with PMap = boost::vec_adj_list_vertex_property_map, boost::property >, boost::no_property, boost::listS>, boost::adjacency_list, boost::property >, boost::no_property, boost::listS>*, double, double&, boost::vertex_distance_t>; Key = long unsigned int]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::WritablePropertyMapConcept, boost::property >, boost::no_property, boost::listS>, boost::adjacency_list, boost::property >, boost::no_property, boost::listS>*, double, double&, boost::vertex_distance_t>, long unsigned int>]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied, boost::property >, boost::no_property, boost::listS>, boost::adjacency_list, boost::property >, boost::no_property, boost::listS>*, double, double&, boost::vertex_distance_t>, long unsigned int> >::value’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied, boost::property >, boost::no_property, boost::listS>, boost::adjacency_list, boost::property >, boost::no_property, boost::listS>*, double, double&, boost::vertex_distance_t>, long unsigned int> >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_, boost::property >, boost::no_property, boost::listS>, boost::adjacency_list, boost::property >, boost::no_property, boost::listS>*, double, double&, boost::vertex_distance_t>, long unsigned int>)>’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/property_map/property_map.hpp:207:7: [ skipping 4 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_, boost::property >, boost::no_property, boost::listS>, boost::adjacency_list, boost::property >, boost::no_property, boost::listS>*, double, double&, boost::vertex_distance_t>, long unsigned int>)>’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/bellman_ford_shortest_paths.hpp:101:5: required from ‘bool boost::bellman_ford_shortest_paths(EdgeListGraph&, Size, WeightMap, PredecessorMap, DistanceMap, BinaryFunction, BinaryPredicate, BellmanFordVisitor) [with EdgeListGraph = adjacency_list, property >, no_property, listS>; Size = long unsigned int; WeightMap = adj_list_edge_property_map >, edge_weight_t>; PredecessorMap = dummy_property_map; DistanceMap = vec_adj_list_vertex_property_map, property >, no_property, listS>, adjacency_list, property >, no_property, listS>*, double, double&, vertex_distance_t>; BinaryFunction = closed_plus; BinaryPredicate = std::less; BellmanFordVisitor = bellman_visitor<>]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/johnson_all_pairs_shortest.hpp:112:36: required from ‘bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, VertexID, Weight, const BinaryPredicate&, const BinaryFunction&, const Infinity&, DistanceZero) [with VertexAndEdgeListGraph = R_adjacency_list; DistanceMatrix = Basic2DMatrix; VertexID = vec_adj_list_vertex_id_map, long unsigned int>; Weight = adj_list_edge_property_map, edge_weight_t>; BinaryPredicate = std::less; BinaryFunction = closed_plus; Infinity = double; DistanceZero = double]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/johnson_all_pairs_shortest.hpp:164:48: required from ‘bool boost::detail::johnson_dispatch(VertexAndEdgeListGraph&, DistanceMatrix&, const boost::bgl_named_params&, Weight, VertexID) [with VertexAndEdgeListGraph = R_adjacency_list; DistanceMatrix = Basic2DMatrix; P = int; T = int; R = boost::no_property; Weight = boost::adj_list_edge_property_map, boost::edge_weight_t>; VertexID = boost::vec_adj_list_vertex_id_map, long unsigned int>]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/johnson_all_pairs_shortest.hpp:192:36: required from ‘bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&) [with VertexAndEdgeListGraph = R_adjacency_list; DistanceMatrix = Basic2DMatrix]’ shortestPath.cpp:56:41: required from here /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:206:17: note: in a call to non-static member function ‘boost::ConvertibleConcept::~ConvertibleConcept()’ 206 | BOOST_concept(Convertible,(X)(Y)) | ^~~~~~~~~~~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/preprocessor/cat.hpp:29:34: note: in definition of macro ‘BOOST_PP_CAT_I’ 29 | # define BOOST_PP_CAT_I(a, b) a ## b | ^ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/concept_def.hpp:23:12: note: in expansion of macro ‘BOOST_PP_CAT’ 23 | struct BOOST_PP_CAT(name,Concept) \ | ^~~~~~~~~~~~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:206:3: note: in expansion of macro ‘BOOST_concept’ 206 | BOOST_concept(Convertible,(X)(Y)) | ^~~~~~~~~~~~~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::Convertible]’: /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements >]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:208:5: required from ‘struct boost::Convertible’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:206:3: required from ‘struct boost::ConvertibleConcept’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::ConvertibleConcept]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied >::value’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:45:51: [ skipping 6 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_, boost::property >, boost::no_property, boost::listS>, boost::adjacency_list, boost::property >, boost::no_property, boost::listS>*, double, double&, boost::vertex_distance_t>, long unsigned int>)>’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/bellman_ford_shortest_paths.hpp:101:5: required from ‘bool boost::bellman_ford_shortest_paths(EdgeListGraph&, Size, WeightMap, PredecessorMap, DistanceMap, BinaryFunction, BinaryPredicate, BellmanFordVisitor) [with EdgeListGraph = adjacency_list, property >, no_property, listS>; Size = long unsigned int; WeightMap = adj_list_edge_property_map >, edge_weight_t>; PredecessorMap = dummy_property_map; DistanceMap = vec_adj_list_vertex_property_map, property >, no_property, listS>, adjacency_list, property >, no_property, listS>*, double, double&, vertex_distance_t>; BinaryFunction = closed_plus; BinaryPredicate = std::less; BellmanFordVisitor = bellman_visitor<>]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/johnson_all_pairs_shortest.hpp:112:36: required from ‘bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, VertexID, Weight, const BinaryPredicate&, const BinaryFunction&, const Infinity&, DistanceZero) [with VertexAndEdgeListGraph = R_adjacency_list; DistanceMatrix = Basic2DMatrix; VertexID = vec_adj_list_vertex_id_map, long unsigned int>; Weight = adj_list_edge_property_map, edge_weight_t>; BinaryPredicate = std::less; BinaryFunction = closed_plus; Infinity = double; DistanceZero = double]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/johnson_all_pairs_shortest.hpp:164:48: required from ‘bool boost::detail::johnson_dispatch(VertexAndEdgeListGraph&, DistanceMatrix&, const boost::bgl_named_params&, Weight, VertexID) [with VertexAndEdgeListGraph = R_adjacency_list; DistanceMatrix = Basic2DMatrix; P = int; T = int; R = boost::no_property; Weight = boost::adj_list_edge_property_map, boost::edge_weight_t>; VertexID = boost::vec_adj_list_vertex_id_map, long unsigned int>]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/johnson_all_pairs_shortest.hpp:192:36: required from ‘bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&) [with VertexAndEdgeListGraph = R_adjacency_list; DistanceMatrix = Basic2DMatrix]’ shortestPath.cpp:56:41: required from here /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::Convertible::~Convertible() [with X = boost::lvalue_property_map_tag; Y = boost::read_write_property_map_tag]’ 37 | ~model() | ^ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:208:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 208 | BOOST_CONCEPT_USAGE(Convertible) { | ^~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::Convertible]’: /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements >]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:208:5: required from ‘struct boost::Convertible’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:206:3: required from ‘struct boost::ConvertibleConcept’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::ConvertibleConcept]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied >::value’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:45:51: [ skipping 6 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_ >, boost::edge_weight_t>, boost::detail::edge_desc_impl >)>’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/bellman_ford_shortest_paths.hpp:102:5: required from ‘bool boost::bellman_ford_shortest_paths(EdgeListGraph&, Size, WeightMap, PredecessorMap, DistanceMap, BinaryFunction, BinaryPredicate, BellmanFordVisitor) [with EdgeListGraph = adjacency_list, property >, no_property, listS>; Size = long unsigned int; WeightMap = adj_list_edge_property_map >, edge_weight_t>; PredecessorMap = dummy_property_map; DistanceMap = vec_adj_list_vertex_property_map, property >, no_property, listS>, adjacency_list, property >, no_property, listS>*, double, double&, vertex_distance_t>; BinaryFunction = closed_plus; BinaryPredicate = std::less; BellmanFordVisitor = bellman_visitor<>]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/johnson_all_pairs_shortest.hpp:112:36: required from ‘bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, VertexID, Weight, const BinaryPredicate&, const BinaryFunction&, const Infinity&, DistanceZero) [with VertexAndEdgeListGraph = R_adjacency_list; DistanceMatrix = Basic2DMatrix; VertexID = vec_adj_list_vertex_id_map, long unsigned int>; Weight = adj_list_edge_property_map, edge_weight_t>; BinaryPredicate = std::less; BinaryFunction = closed_plus; Infinity = double; DistanceZero = double]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/johnson_all_pairs_shortest.hpp:164:48: required from ‘bool boost::detail::johnson_dispatch(VertexAndEdgeListGraph&, DistanceMatrix&, const boost::bgl_named_params&, Weight, VertexID) [with VertexAndEdgeListGraph = R_adjacency_list; DistanceMatrix = Basic2DMatrix; P = int; T = int; R = boost::no_property; Weight = boost::adj_list_edge_property_map, boost::edge_weight_t>; VertexID = boost::vec_adj_list_vertex_id_map, long unsigned int>]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/johnson_all_pairs_shortest.hpp:192:36: required from ‘bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&) [with VertexAndEdgeListGraph = R_adjacency_list; DistanceMatrix = Basic2DMatrix]’ shortestPath.cpp:56:41: required from here /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::Convertible::~Convertible() [with X = boost::lvalue_property_map_tag; Y = boost::readable_property_map_tag]’ 37 | ~model() | ^ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:208:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 208 | BOOST_CONCEPT_USAGE(Convertible) { | ^~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator >*, std::vector >, std::allocator > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::adjacency_list > > > >]’: /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/graph_concepts.hpp:52:50: required from ‘struct boost::concepts::MultiPassInputIterator, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator >*, std::vector >, std::allocator > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::adjacency_list > > >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::concepts::MultiPassInputIterator, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator >*, std::vector >, std::allocator > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::adjacency_list > > >]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator >*, std::vector >, std::allocator > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::adjacency_list > > > >::value’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator >*, std::vector >, std::allocator > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::adjacency_list > > > >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:72:8: [ skipping 2 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/graph_concepts.hpp:226:1: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::EdgeListGraphConcept > >]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/bellman_ford_shortest_paths.hpp:97:5: required from ‘bool boost::bellman_ford_shortest_paths(EdgeListGraph&, Size, WeightMap, PredecessorMap, DistanceMap, BinaryFunction, BinaryPredicate, BellmanFordVisitor) [with EdgeListGraph = adjacency_list >; Size = int; WeightMap = adj_list_edge_property_map, edge_weight_t>; PredecessorMap = long unsigned int*; DistanceMap = double*; BinaryFunction = closed_plus; BinaryPredicate = std::less; BellmanFordVisitor = bellman_visitor<>]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/bellman_ford_shortest_paths.hpp:176:43: required from ‘bool boost::detail::bellman_dispatch2(VertexAndEdgeListGraph&, boost::param_not_found, Size, WeightMap, PredecessorMap, DistanceMap, const boost::bgl_named_params&) [with VertexAndEdgeListGraph = boost::adjacency_list >; Size = int; WeightMap = boost::adj_list_edge_property_map, boost::edge_weight_t>; PredecessorMap = long unsigned int*; DistanceMap = double*; P = double*; T = boost::vertex_distance_t; R = boost::bgl_named_params, boost::edge_weight_t>, boost::edge_weight_t, boost::no_property> >]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/bellman_ford_shortest_paths.hpp:190:41: required from ‘bool boost::detail::bellman_dispatch(EdgeListGraph&, Size, WeightMap, DistanceMap, const boost::bgl_named_params&) [with EdgeListGraph = boost::adjacency_list >; Size = int; WeightMap = boost::adj_list_edge_property_map, boost::edge_weight_t>; DistanceMap = double*; P = double*; T = boost::vertex_distance_t; R = boost::bgl_named_params, boost::edge_weight_t>, boost::edge_weight_t, boost::no_property> >]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/bellman_ford_shortest_paths.hpp:201:36: required from ‘bool boost::bellman_ford_shortest_paths(EdgeListGraph&, Size, const bgl_named_params&) [with EdgeListGraph = adjacency_list >; Size = int; P = double*; T = vertex_distance_t; R = bgl_named_params, edge_weight_t>, edge_weight_t, no_property> >]’ shortestPath.cpp:105:45: required from here /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::concepts::MultiPassInputIterator, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator >*, std::vector >, std::allocator > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::adjacency_list > > >]’ 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ^ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::MultiPassInputIterator, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator >*, std::vector >, std::allocator > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::adjacency_list > > >]’: /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/graph_concepts.hpp:235:9: required from ‘boost::concepts::EdgeListGraph::~EdgeListGraph() [with G = boost::adjacency_list >]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/graph_concepts.hpp:226:1: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::EdgeListGraphConcept > >]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/bellman_ford_shortest_paths.hpp:97:5: required from ‘bool boost::bellman_ford_shortest_paths(EdgeListGraph&, Size, WeightMap, PredecessorMap, DistanceMap, BinaryFunction, BinaryPredicate, BellmanFordVisitor) [with EdgeListGraph = adjacency_list >; Size = int; WeightMap = adj_list_edge_property_map, edge_weight_t>; PredecessorMap = long unsigned int*; DistanceMap = double*; BinaryFunction = closed_plus; BinaryPredicate = std::less; BellmanFordVisitor = bellman_visitor<>]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/bellman_ford_shortest_paths.hpp:176:43: required from ‘bool boost::detail::bellman_dispatch2(VertexAndEdgeListGraph&, boost::param_not_found, Size, WeightMap, PredecessorMap, DistanceMap, const boost::bgl_named_params&) [with VertexAndEdgeListGraph = boost::adjacency_list >; Size = int; WeightMap = boost::adj_list_edge_property_map, boost::edge_weight_t>; PredecessorMap = long unsigned int*; DistanceMap = double*; P = double*; T = boost::vertex_distance_t; R = boost::bgl_named_params, boost::edge_weight_t>, boost::edge_weight_t, boost::no_property> >]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/bellman_ford_shortest_paths.hpp:190:41: required from ‘bool boost::detail::bellman_dispatch(EdgeListGraph&, Size, WeightMap, DistanceMap, const boost::bgl_named_params&) [with EdgeListGraph = boost::adjacency_list >; Size = int; WeightMap = boost::adj_list_edge_property_map, boost::edge_weight_t>; DistanceMap = double*; P = double*; T = boost::vertex_distance_t; R = boost::bgl_named_params, boost::edge_weight_t>, boost::edge_weight_t, boost::no_property> >]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/bellman_ford_shortest_paths.hpp:201:36: required from ‘bool boost::bellman_ford_shortest_paths(EdgeListGraph&, Size, const bgl_named_params&) [with EdgeListGraph = adjacency_list >; Size = int; P = double*; T = vertex_distance_t; R = bgl_named_params, edge_weight_t>, edge_weight_t, no_property> >]’ shortestPath.cpp:105:45: required from here /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::concepts::MultiPassInputIterator::~MultiPassInputIterator() [with T = boost::detail::adj_list_edge_iterator, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator >*, std::vector >, std::allocator > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::adjacency_list > >]’ 37 | ~model() | ^ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/graph_concepts.hpp:52:50: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 52 | BOOST_concept(MultiPassInputIterator, (T)) { BOOST_CONCEPT_USAGE( | ^~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::constraint::failed() [with Model = boost::DFSVisitorConcept > >, R_adjacency_list >]’: /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/depth_first_search.hpp:130:9: required from ‘void boost::detail::depth_first_visit_impl(const IncidenceGraph&, typename boost::graph_traits::vertex_descriptor, DFSVisitor&, ColorMap, TerminatorFunc) [with IncidenceGraph = R_adjacency_list; DFSVisitor = boost::topo_sort_visitor > >; ColorMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map, long unsigned int>, boost::default_color_type, boost::default_color_type&>; TerminatorFunc = nontruth2; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/depth_first_search.hpp:417:35: required from ‘void boost::depth_first_visit(const IncidenceGraph&, typename graph_traits::vertex_descriptor, DFSVisitor, ColorMap) [with IncidenceGraph = R_adjacency_list; DFSVisitor = topo_sort_visitor > >; ColorMap = iterator_property_map<__gnu_cxx::__normal_iterator >, vec_adj_list_vertex_id_map, long unsigned int>, default_color_type, default_color_type&>; typename graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/dag_shortest_paths.hpp:42:22: required from ‘void boost::dag_shortest_paths(const VertexListGraph&, typename graph_traits::vertex_descriptor, DistanceMap, WeightMap, ColorMap, PredecessorMap, DijkstraVisitor, Compare, Combine, DistInf, DistZero) [with VertexListGraph = R_adjacency_list; DijkstraVisitor = dijkstra_visitor<>; DistanceMap = double*; WeightMap = adj_list_edge_property_map, edge_weight_t>; ColorMap = iterator_property_map<__gnu_cxx::__normal_iterator >, vec_adj_list_vertex_id_map, long unsigned int>, default_color_type, default_color_type&>; PredecessorMap = long unsigned int*; Compare = std::less; Combine = closed_plus; DistInf = double; DistZero = double; typename graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/dag_shortest_paths.hpp:90:27: required from ‘void boost::detail::dag_sp_dispatch2(const VertexListGraph&, typename boost::graph_traits::vertex_descriptor, DistanceMap, WeightMap, ColorMap, IndexMap, DijkstraVisitor, const Params&) [with VertexListGraph = R_adjacency_list; DijkstraVisitor = boost::dijkstra_visitor<>; DistanceMap = double*; WeightMap = boost::adj_list_edge_property_map, boost::edge_weight_t>; ColorMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map, long unsigned int>, boost::default_color_type, boost::default_color_type&>; IndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>; Params = boost::bgl_named_params >; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/dag_shortest_paths.hpp:114:25: required from ‘void boost::detail::dag_sp_dispatch1(const VertexListGraph&, typename boost::graph_traits::vertex_descriptor, DistanceMap, WeightMap, ColorMap, IndexMap, DijkstraVisitor, const Params&) [with VertexListGraph = R_adjacency_list; DijkstraVisitor = boost::dijkstra_visitor<>; DistanceMap = double*; WeightMap = boost::adj_list_edge_property_map, boost::edge_weight_t>; ColorMap = boost::param_not_found; IndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>; Params = boost::bgl_named_params >; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/dag_shortest_paths.hpp:134:29: required from ‘void boost::dag_shortest_paths(const VertexListGraph&, typename graph_traits::vertex_descriptor, const bgl_named_params&) [with VertexListGraph = R_adjacency_list; Param = double*; Tag = vertex_distance_t; Rest = bgl_named_params; typename graph_traits::vertex_descriptor = long unsigned int]’ shortestPath.cpp:144:27: required from here /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:65:52: warning: ‘this’ pointer is null [-Wnonnull] 65 | static void failed() { ((Model*)0)->constraints(); } | ~~~~~~~~~~~~~~~~~~~~~~~~^~ In file included from /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/topological_sort.hpp:16, from /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/dag_shortest_paths.hpp:13, from shortestPath.cpp:5: /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/depth_first_search.hpp:39:10: note: in a call to non-static member function ‘void boost::DFSVisitorConcept::constraints() [with Visitor = boost::topo_sort_visitor > >; Graph = R_adjacency_list]’ 39 | void constraints() | ^~~~~~~~~~~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::constraint::failed() [with Model = boost::ReadWritePropertyMapConcept >, boost::vec_adj_list_vertex_id_map, long unsigned int>, boost::default_color_type, boost::default_color_type&>, long unsigned int>]’: /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/depth_first_search.hpp:134:9: required from ‘void boost::detail::depth_first_visit_impl(const IncidenceGraph&, typename boost::graph_traits::vertex_descriptor, DFSVisitor&, ColorMap, TerminatorFunc) [with IncidenceGraph = R_adjacency_list; DFSVisitor = boost::topo_sort_visitor > >; ColorMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map, long unsigned int>, boost::default_color_type, boost::default_color_type&>; TerminatorFunc = nontruth2; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/depth_first_search.hpp:417:35: required from ‘void boost::depth_first_visit(const IncidenceGraph&, typename graph_traits::vertex_descriptor, DFSVisitor, ColorMap) [with IncidenceGraph = R_adjacency_list; DFSVisitor = topo_sort_visitor > >; ColorMap = iterator_property_map<__gnu_cxx::__normal_iterator >, vec_adj_list_vertex_id_map, long unsigned int>, default_color_type, default_color_type&>; typename graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/dag_shortest_paths.hpp:42:22: required from ‘void boost::dag_shortest_paths(const VertexListGraph&, typename graph_traits::vertex_descriptor, DistanceMap, WeightMap, ColorMap, PredecessorMap, DijkstraVisitor, Compare, Combine, DistInf, DistZero) [with VertexListGraph = R_adjacency_list; DijkstraVisitor = dijkstra_visitor<>; DistanceMap = double*; WeightMap = adj_list_edge_property_map, edge_weight_t>; ColorMap = iterator_property_map<__gnu_cxx::__normal_iterator >, vec_adj_list_vertex_id_map, long unsigned int>, default_color_type, default_color_type&>; PredecessorMap = long unsigned int*; Compare = std::less; Combine = closed_plus; DistInf = double; DistZero = double; typename graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/dag_shortest_paths.hpp:90:27: required from ‘void boost::detail::dag_sp_dispatch2(const VertexListGraph&, typename boost::graph_traits::vertex_descriptor, DistanceMap, WeightMap, ColorMap, IndexMap, DijkstraVisitor, const Params&) [with VertexListGraph = R_adjacency_list; DijkstraVisitor = boost::dijkstra_visitor<>; DistanceMap = double*; WeightMap = boost::adj_list_edge_property_map, boost::edge_weight_t>; ColorMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map, long unsigned int>, boost::default_color_type, boost::default_color_type&>; IndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>; Params = boost::bgl_named_params >; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/dag_shortest_paths.hpp:114:25: required from ‘void boost::detail::dag_sp_dispatch1(const VertexListGraph&, typename boost::graph_traits::vertex_descriptor, DistanceMap, WeightMap, ColorMap, IndexMap, DijkstraVisitor, const Params&) [with VertexListGraph = R_adjacency_list; DijkstraVisitor = boost::dijkstra_visitor<>; DistanceMap = double*; WeightMap = boost::adj_list_edge_property_map, boost::edge_weight_t>; ColorMap = boost::param_not_found; IndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>; Params = boost::bgl_named_params >; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/dag_shortest_paths.hpp:134:29: required from ‘void boost::dag_shortest_paths(const VertexListGraph&, typename graph_traits::vertex_descriptor, const bgl_named_params&) [with VertexListGraph = R_adjacency_list; Param = double*; Tag = vertex_distance_t; Rest = bgl_named_params; typename graph_traits::vertex_descriptor = long unsigned int]’ shortestPath.cpp:144:27: required from here /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:65:52: warning: ‘this’ pointer is null [-Wnonnull] 65 | static void failed() { ((Model*)0)->constraints(); } | ~~~~~~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/property_map/property_map.hpp:205:10: note: in a call to non-static member function ‘void boost::ReadWritePropertyMapConcept::constraints() [with PMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map, long unsigned int>, boost::default_color_type, boost::default_color_type&>; Key = long unsigned int]’ 205 | void constraints() { | ^~~~~~~~~~~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements >]’: /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:233:5: required from ‘struct boost::EqualityComparable’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/graph_concepts.hpp:502:1: required from ‘struct boost::concepts::ColorValue’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/graph_concepts.hpp:502:1: required from ‘struct boost::concepts::ColorValueConcept’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::concepts::ColorValueConcept]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied >::value’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:45:51: [ skipping 3 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/depth_first_search.hpp:417:35: required from ‘void boost::depth_first_visit(const IncidenceGraph&, typename graph_traits::vertex_descriptor, DFSVisitor, ColorMap) [with IncidenceGraph = R_adjacency_list; DFSVisitor = topo_sort_visitor > >; ColorMap = iterator_property_map<__gnu_cxx::__normal_iterator >, vec_adj_list_vertex_id_map, long unsigned int>, default_color_type, default_color_type&>; typename graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/dag_shortest_paths.hpp:42:22: required from ‘void boost::dag_shortest_paths(const VertexListGraph&, typename graph_traits::vertex_descriptor, DistanceMap, WeightMap, ColorMap, PredecessorMap, DijkstraVisitor, Compare, Combine, DistInf, DistZero) [with VertexListGraph = R_adjacency_list; DijkstraVisitor = dijkstra_visitor<>; DistanceMap = double*; WeightMap = adj_list_edge_property_map, edge_weight_t>; ColorMap = iterator_property_map<__gnu_cxx::__normal_iterator >, vec_adj_list_vertex_id_map, long unsigned int>, default_color_type, default_color_type&>; PredecessorMap = long unsigned int*; Compare = std::less; Combine = closed_plus; DistInf = double; DistZero = double; typename graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/dag_shortest_paths.hpp:90:27: required from ‘void boost::detail::dag_sp_dispatch2(const VertexListGraph&, typename boost::graph_traits::vertex_descriptor, DistanceMap, WeightMap, ColorMap, IndexMap, DijkstraVisitor, const Params&) [with VertexListGraph = R_adjacency_list; DijkstraVisitor = boost::dijkstra_visitor<>; DistanceMap = double*; WeightMap = boost::adj_list_edge_property_map, boost::edge_weight_t>; ColorMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map, long unsigned int>, boost::default_color_type, boost::default_color_type&>; IndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>; Params = boost::bgl_named_params >; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/dag_shortest_paths.hpp:114:25: required from ‘void boost::detail::dag_sp_dispatch1(const VertexListGraph&, typename boost::graph_traits::vertex_descriptor, DistanceMap, WeightMap, ColorMap, IndexMap, DijkstraVisitor, const Params&) [with VertexListGraph = R_adjacency_list; DijkstraVisitor = boost::dijkstra_visitor<>; DistanceMap = double*; WeightMap = boost::adj_list_edge_property_map, boost::edge_weight_t>; ColorMap = boost::param_not_found; IndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>; Params = boost::bgl_named_params >; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/dag_shortest_paths.hpp:134:29: required from ‘void boost::dag_shortest_paths(const VertexListGraph&, typename graph_traits::vertex_descriptor, const bgl_named_params&) [with VertexListGraph = R_adjacency_list; Param = double*; Tag = vertex_distance_t; Rest = bgl_named_params; typename graph_traits::vertex_descriptor = long unsigned int]’ shortestPath.cpp:144:27: required from here /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::EqualityComparable]’ 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ^ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements >]’: /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:137:5: required from ‘struct boost::DefaultConstructible’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/graph_concepts.hpp:502:1: required from ‘struct boost::concepts::ColorValue’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/graph_concepts.hpp:502:1: required from ‘struct boost::concepts::ColorValueConcept’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::concepts::ColorValueConcept]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied >::value’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:45:51: [ skipping 3 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/depth_first_search.hpp:417:35: required from ‘void boost::depth_first_visit(const IncidenceGraph&, typename graph_traits::vertex_descriptor, DFSVisitor, ColorMap) [with IncidenceGraph = R_adjacency_list; DFSVisitor = topo_sort_visitor > >; ColorMap = iterator_property_map<__gnu_cxx::__normal_iterator >, vec_adj_list_vertex_id_map, long unsigned int>, default_color_type, default_color_type&>; typename graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/dag_shortest_paths.hpp:42:22: required from ‘void boost::dag_shortest_paths(const VertexListGraph&, typename graph_traits::vertex_descriptor, DistanceMap, WeightMap, ColorMap, PredecessorMap, DijkstraVisitor, Compare, Combine, DistInf, DistZero) [with VertexListGraph = R_adjacency_list; DijkstraVisitor = dijkstra_visitor<>; DistanceMap = double*; WeightMap = adj_list_edge_property_map, edge_weight_t>; ColorMap = iterator_property_map<__gnu_cxx::__normal_iterator >, vec_adj_list_vertex_id_map, long unsigned int>, default_color_type, default_color_type&>; PredecessorMap = long unsigned int*; Compare = std::less; Combine = closed_plus; DistInf = double; DistZero = double; typename graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/dag_shortest_paths.hpp:90:27: required from ‘void boost::detail::dag_sp_dispatch2(const VertexListGraph&, typename boost::graph_traits::vertex_descriptor, DistanceMap, WeightMap, ColorMap, IndexMap, DijkstraVisitor, const Params&) [with VertexListGraph = R_adjacency_list; DijkstraVisitor = boost::dijkstra_visitor<>; DistanceMap = double*; WeightMap = boost::adj_list_edge_property_map, boost::edge_weight_t>; ColorMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map, long unsigned int>, boost::default_color_type, boost::default_color_type&>; IndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>; Params = boost::bgl_named_params >; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/dag_shortest_paths.hpp:114:25: required from ‘void boost::detail::dag_sp_dispatch1(const VertexListGraph&, typename boost::graph_traits::vertex_descriptor, DistanceMap, WeightMap, ColorMap, IndexMap, DijkstraVisitor, const Params&) [with VertexListGraph = R_adjacency_list; DijkstraVisitor = boost::dijkstra_visitor<>; DistanceMap = double*; WeightMap = boost::adj_list_edge_property_map, boost::edge_weight_t>; ColorMap = boost::param_not_found; IndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>; Params = boost::bgl_named_params >; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/dag_shortest_paths.hpp:134:29: required from ‘void boost::dag_shortest_paths(const VertexListGraph&, typename graph_traits::vertex_descriptor, const bgl_named_params&) [with VertexListGraph = R_adjacency_list; Param = double*; Tag = vertex_distance_t; Rest = bgl_named_params; typename graph_traits::vertex_descriptor = long unsigned int]’ shortestPath.cpp:144:27: required from here /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::DefaultConstructible]’ 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ^ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements >]’: /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/graph_concepts.hpp:505:5: required from ‘struct boost::concepts::ColorValue’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/graph_concepts.hpp:502:1: required from ‘struct boost::concepts::ColorValueConcept’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::concepts::ColorValueConcept]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied >::value’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:72:8: [ skipping 2 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/depth_first_search.hpp:417:35: required from ‘void boost::depth_first_visit(const IncidenceGraph&, typename graph_traits::vertex_descriptor, DFSVisitor, ColorMap) [with IncidenceGraph = R_adjacency_list; DFSVisitor = topo_sort_visitor > >; ColorMap = iterator_property_map<__gnu_cxx::__normal_iterator >, vec_adj_list_vertex_id_map, long unsigned int>, default_color_type, default_color_type&>; typename graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/dag_shortest_paths.hpp:42:22: required from ‘void boost::dag_shortest_paths(const VertexListGraph&, typename graph_traits::vertex_descriptor, DistanceMap, WeightMap, ColorMap, PredecessorMap, DijkstraVisitor, Compare, Combine, DistInf, DistZero) [with VertexListGraph = R_adjacency_list; DijkstraVisitor = dijkstra_visitor<>; DistanceMap = double*; WeightMap = adj_list_edge_property_map, edge_weight_t>; ColorMap = iterator_property_map<__gnu_cxx::__normal_iterator >, vec_adj_list_vertex_id_map, long unsigned int>, default_color_type, default_color_type&>; PredecessorMap = long unsigned int*; Compare = std::less; Combine = closed_plus; DistInf = double; DistZero = double; typename graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/dag_shortest_paths.hpp:90:27: required from ‘void boost::detail::dag_sp_dispatch2(const VertexListGraph&, typename boost::graph_traits::vertex_descriptor, DistanceMap, WeightMap, ColorMap, IndexMap, DijkstraVisitor, const Params&) [with VertexListGraph = R_adjacency_list; DijkstraVisitor = boost::dijkstra_visitor<>; DistanceMap = double*; WeightMap = boost::adj_list_edge_property_map, boost::edge_weight_t>; ColorMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map, long unsigned int>, boost::default_color_type, boost::default_color_type&>; IndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>; Params = boost::bgl_named_params >; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/dag_shortest_paths.hpp:114:25: required from ‘void boost::detail::dag_sp_dispatch1(const VertexListGraph&, typename boost::graph_traits::vertex_descriptor, DistanceMap, WeightMap, ColorMap, IndexMap, DijkstraVisitor, const Params&) [with VertexListGraph = R_adjacency_list; DijkstraVisitor = boost::dijkstra_visitor<>; DistanceMap = double*; WeightMap = boost::adj_list_edge_property_map, boost::edge_weight_t>; ColorMap = boost::param_not_found; IndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>; Params = boost::bgl_named_params >; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/dag_shortest_paths.hpp:134:29: required from ‘void boost::dag_shortest_paths(const VertexListGraph&, typename graph_traits::vertex_descriptor, const bgl_named_params&) [with VertexListGraph = R_adjacency_list; Param = double*; Tag = vertex_distance_t; Rest = bgl_named_params; typename graph_traits::vertex_descriptor = long unsigned int]’ shortestPath.cpp:144:27: required from here /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::concepts::ColorValue]’ 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ^ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::ColorValueConcept]’: /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/depth_first_search.hpp:136:9: required from ‘void boost::detail::depth_first_visit_impl(const IncidenceGraph&, typename boost::graph_traits::vertex_descriptor, DFSVisitor&, ColorMap, TerminatorFunc) [with IncidenceGraph = R_adjacency_list; DFSVisitor = boost::topo_sort_visitor > >; ColorMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map, long unsigned int>, boost::default_color_type, boost::default_color_type&>; TerminatorFunc = nontruth2; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/depth_first_search.hpp:417:35: required from ‘void boost::depth_first_visit(const IncidenceGraph&, typename graph_traits::vertex_descriptor, DFSVisitor, ColorMap) [with IncidenceGraph = R_adjacency_list; DFSVisitor = topo_sort_visitor > >; ColorMap = iterator_property_map<__gnu_cxx::__normal_iterator >, vec_adj_list_vertex_id_map, long unsigned int>, default_color_type, default_color_type&>; typename graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/dag_shortest_paths.hpp:42:22: required from ‘void boost::dag_shortest_paths(const VertexListGraph&, typename graph_traits::vertex_descriptor, DistanceMap, WeightMap, ColorMap, PredecessorMap, DijkstraVisitor, Compare, Combine, DistInf, DistZero) [with VertexListGraph = R_adjacency_list; DijkstraVisitor = dijkstra_visitor<>; DistanceMap = double*; WeightMap = adj_list_edge_property_map, edge_weight_t>; ColorMap = iterator_property_map<__gnu_cxx::__normal_iterator >, vec_adj_list_vertex_id_map, long unsigned int>, default_color_type, default_color_type&>; PredecessorMap = long unsigned int*; Compare = std::less; Combine = closed_plus; DistInf = double; DistZero = double; typename graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/dag_shortest_paths.hpp:90:27: required from ‘void boost::detail::dag_sp_dispatch2(const VertexListGraph&, typename boost::graph_traits::vertex_descriptor, DistanceMap, WeightMap, ColorMap, IndexMap, DijkstraVisitor, const Params&) [with VertexListGraph = R_adjacency_list; DijkstraVisitor = boost::dijkstra_visitor<>; DistanceMap = double*; WeightMap = boost::adj_list_edge_property_map, boost::edge_weight_t>; ColorMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map, long unsigned int>, boost::default_color_type, boost::default_color_type&>; IndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>; Params = boost::bgl_named_params >; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/dag_shortest_paths.hpp:114:25: required from ‘void boost::detail::dag_sp_dispatch1(const VertexListGraph&, typename boost::graph_traits::vertex_descriptor, DistanceMap, WeightMap, ColorMap, IndexMap, DijkstraVisitor, const Params&) [with VertexListGraph = R_adjacency_list; DijkstraVisitor = boost::dijkstra_visitor<>; DistanceMap = double*; WeightMap = boost::adj_list_edge_property_map, boost::edge_weight_t>; ColorMap = boost::param_not_found; IndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>; Params = boost::bgl_named_params >; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/dag_shortest_paths.hpp:134:29: required from ‘void boost::dag_shortest_paths(const VertexListGraph&, typename graph_traits::vertex_descriptor, const bgl_named_params&) [with VertexListGraph = R_adjacency_list; Param = double*; Tag = vertex_distance_t; Rest = bgl_named_params; typename graph_traits::vertex_descriptor = long unsigned int]’ shortestPath.cpp:144:27: required from here /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/graph_concepts.hpp:502:15: note: in a call to non-static member function ‘boost::concepts::ColorValueConcept::~ColorValueConcept()’ 502 | BOOST_concept(ColorValue, (C)) | ^~~~~~~~~~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/preprocessor/cat.hpp:29:34: note: in definition of macro ‘BOOST_PP_CAT_I’ 29 | # define BOOST_PP_CAT_I(a, b) a ## b | ^ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/concept_def.hpp:23:12: note: in expansion of macro ‘BOOST_PP_CAT’ 23 | struct BOOST_PP_CAT(name,Concept) \ | ^~~~~~~~~~~~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/graph_concepts.hpp:502:1: note: in expansion of macro ‘BOOST_concept’ 502 | BOOST_concept(ColorValue, (C)) | ^~~~~~~~~~~~~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements >]’: /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:137:5: required from ‘struct boost::DefaultConstructible’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::DefaultConstructible]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied >::value’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_)>’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/graph_concepts.hpp:68:9: [ skipping 8 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied > >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_ >)>’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/bellman_ford_shortest_paths.hpp:218:5: required from ‘bool boost::floyd_warshall_all_pairs_shortest_paths(const VertexAndEdgeListGraph&, DistanceMatrix&, const WeightMap&, const BinaryPredicate&, const BinaryFunction&, const Infinity&, const Zero&) [with VertexAndEdgeListGraph = R_adjacency_list; DistanceMatrix = Basic2DMatrix; WeightMap = adj_list_edge_property_map, edge_weight_t>; BinaryPredicate = std::less; BinaryFunction = closed_plus; Infinity = double; Zero = double]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/floyd_warshall_shortest.hpp:172:55: required from ‘bool boost::detail::floyd_warshall_noninit_dispatch(const VertexAndEdgeListGraph&, DistanceMatrix&, WeightMap, const boost::bgl_named_params&) [with VertexAndEdgeListGraph = R_adjacency_list; DistanceMatrix = Basic2DMatrix; WeightMap = boost::adj_list_edge_property_map, boost::edge_weight_t>; P = int; T = int; R = boost::no_property]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/floyd_warshall_shortest.hpp:217:51: required from ‘bool boost::floyd_warshall_all_pairs_shortest_paths(const VertexAndEdgeListGraph&, DistanceMatrix&) [with VertexAndEdgeListGraph = R_adjacency_list; DistanceMatrix = Basic2DMatrix]’ shortestPath.cpp:186:48: required from here /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::DefaultConstructible]’ 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ^ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::DefaultConstructible]’: /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/graph_concepts.hpp:68:9: required from ‘boost::concepts::Graph::~Graph() [with G = R_adjacency_list]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/usage.hpp:20:48: required from ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::concepts::Graph >]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements > >]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/graph_concepts.hpp:66:5: required from ‘struct boost::concepts::Graph >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/graph_concepts.hpp:176:1: required from ‘struct boost::concepts::VertexListGraph >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/graph_concepts.hpp:176:1: [ skipping 3 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied > >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_ >)>’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/bellman_ford_shortest_paths.hpp:218:5: required from ‘bool boost::floyd_warshall_all_pairs_shortest_paths(const VertexAndEdgeListGraph&, DistanceMatrix&, const WeightMap&, const BinaryPredicate&, const BinaryFunction&, const Infinity&, const Zero&) [with VertexAndEdgeListGraph = R_adjacency_list; DistanceMatrix = Basic2DMatrix; WeightMap = adj_list_edge_property_map, edge_weight_t>; BinaryPredicate = std::less; BinaryFunction = closed_plus; Infinity = double; Zero = double]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/floyd_warshall_shortest.hpp:172:55: required from ‘bool boost::detail::floyd_warshall_noninit_dispatch(const VertexAndEdgeListGraph&, DistanceMatrix&, WeightMap, const boost::bgl_named_params&) [with VertexAndEdgeListGraph = R_adjacency_list; DistanceMatrix = Basic2DMatrix; WeightMap = boost::adj_list_edge_property_map, boost::edge_weight_t>; P = int; T = int; R = boost::no_property]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/floyd_warshall_shortest.hpp:217:51: required from ‘bool boost::floyd_warshall_all_pairs_shortest_paths(const VertexAndEdgeListGraph&, DistanceMatrix&) [with VertexAndEdgeListGraph = R_adjacency_list; DistanceMatrix = Basic2DMatrix]’ shortestPath.cpp:186:48: required from here /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::DefaultConstructible::~DefaultConstructible() [with TT = long unsigned int]’ 37 | ~model() | ^ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:137:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 137 | BOOST_CONCEPT_USAGE(DefaultConstructible) { | ^~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements >]’: /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:233:5: required from ‘struct boost::EqualityComparable’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::EqualityComparable]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied >::value’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_)>’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/graph_concepts.hpp:69:9: [ skipping 8 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied > >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_ >)>’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/bellman_ford_shortest_paths.hpp:218:5: required from ‘bool boost::floyd_warshall_all_pairs_shortest_paths(const VertexAndEdgeListGraph&, DistanceMatrix&, const WeightMap&, const BinaryPredicate&, const BinaryFunction&, const Infinity&, const Zero&) [with VertexAndEdgeListGraph = R_adjacency_list; DistanceMatrix = Basic2DMatrix; WeightMap = adj_list_edge_property_map, edge_weight_t>; BinaryPredicate = std::less; BinaryFunction = closed_plus; Infinity = double; Zero = double]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/floyd_warshall_shortest.hpp:172:55: required from ‘bool boost::detail::floyd_warshall_noninit_dispatch(const VertexAndEdgeListGraph&, DistanceMatrix&, WeightMap, const boost::bgl_named_params&) [with VertexAndEdgeListGraph = R_adjacency_list; DistanceMatrix = Basic2DMatrix; WeightMap = boost::adj_list_edge_property_map, boost::edge_weight_t>; P = int; T = int; R = boost::no_property]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/floyd_warshall_shortest.hpp:217:51: required from ‘bool boost::floyd_warshall_all_pairs_shortest_paths(const VertexAndEdgeListGraph&, DistanceMatrix&) [with VertexAndEdgeListGraph = R_adjacency_list; DistanceMatrix = Basic2DMatrix]’ shortestPath.cpp:186:48: required from here /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::EqualityComparable]’ 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ^ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::EqualityComparable]’: /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/graph_concepts.hpp:69:9: required from ‘boost::concepts::Graph::~Graph() [with G = R_adjacency_list]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/usage.hpp:20:48: required from ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::concepts::Graph >]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements > >]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/graph_concepts.hpp:66:5: required from ‘struct boost::concepts::Graph >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/graph_concepts.hpp:176:1: required from ‘struct boost::concepts::VertexListGraph >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/graph_concepts.hpp:176:1: [ skipping 3 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied > >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_ >)>’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/bellman_ford_shortest_paths.hpp:218:5: required from ‘bool boost::floyd_warshall_all_pairs_shortest_paths(const VertexAndEdgeListGraph&, DistanceMatrix&, const WeightMap&, const BinaryPredicate&, const BinaryFunction&, const Infinity&, const Zero&) [with VertexAndEdgeListGraph = R_adjacency_list; DistanceMatrix = Basic2DMatrix; WeightMap = adj_list_edge_property_map, edge_weight_t>; BinaryPredicate = std::less; BinaryFunction = closed_plus; Infinity = double; Zero = double]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/floyd_warshall_shortest.hpp:172:55: required from ‘bool boost::detail::floyd_warshall_noninit_dispatch(const VertexAndEdgeListGraph&, DistanceMatrix&, WeightMap, const boost::bgl_named_params&) [with VertexAndEdgeListGraph = R_adjacency_list; DistanceMatrix = Basic2DMatrix; WeightMap = boost::adj_list_edge_property_map, boost::edge_weight_t>; P = int; T = int; R = boost::no_property]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/floyd_warshall_shortest.hpp:217:51: required from ‘bool boost::floyd_warshall_all_pairs_shortest_paths(const VertexAndEdgeListGraph&, DistanceMatrix&) [with VertexAndEdgeListGraph = R_adjacency_list; DistanceMatrix = Basic2DMatrix]’ shortestPath.cpp:186:48: required from here /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::EqualityComparable::~EqualityComparable() [with TT = long unsigned int]’ 37 | ~model() | ^ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:233:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 233 | BOOST_CONCEPT_USAGE(EqualityComparable) { | ^~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements >]’: /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:145:5: required from ‘struct boost::Assignable’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::Assignable]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied >::value’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_)>’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/graph_concepts.hpp:70:9: [ skipping 8 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied > >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_ >)>’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/bellman_ford_shortest_paths.hpp:218:5: required from ‘bool boost::floyd_warshall_all_pairs_shortest_paths(const VertexAndEdgeListGraph&, DistanceMatrix&, const WeightMap&, const BinaryPredicate&, const BinaryFunction&, const Infinity&, const Zero&) [with VertexAndEdgeListGraph = R_adjacency_list; DistanceMatrix = Basic2DMatrix; WeightMap = adj_list_edge_property_map, edge_weight_t>; BinaryPredicate = std::less; BinaryFunction = closed_plus; Infinity = double; Zero = double]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/floyd_warshall_shortest.hpp:172:55: required from ‘bool boost::detail::floyd_warshall_noninit_dispatch(const VertexAndEdgeListGraph&, DistanceMatrix&, WeightMap, const boost::bgl_named_params&) [with VertexAndEdgeListGraph = R_adjacency_list; DistanceMatrix = Basic2DMatrix; WeightMap = boost::adj_list_edge_property_map, boost::edge_weight_t>; P = int; T = int; R = boost::no_property]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/floyd_warshall_shortest.hpp:217:51: required from ‘bool boost::floyd_warshall_all_pairs_shortest_paths(const VertexAndEdgeListGraph&, DistanceMatrix&) [with VertexAndEdgeListGraph = R_adjacency_list; DistanceMatrix = Basic2DMatrix]’ shortestPath.cpp:186:48: required from here /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::Assignable]’ 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ^ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::Assignable]’: /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/graph_concepts.hpp:70:9: required from ‘boost::concepts::Graph::~Graph() [with G = R_adjacency_list]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/usage.hpp:20:48: required from ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::concepts::Graph >]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements > >]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/graph_concepts.hpp:66:5: required from ‘struct boost::concepts::Graph >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/graph_concepts.hpp:176:1: required from ‘struct boost::concepts::VertexListGraph >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/graph_concepts.hpp:176:1: [ skipping 3 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied > >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_ >)>’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/bellman_ford_shortest_paths.hpp:218:5: required from ‘bool boost::floyd_warshall_all_pairs_shortest_paths(const VertexAndEdgeListGraph&, DistanceMatrix&, const WeightMap&, const BinaryPredicate&, const BinaryFunction&, const Infinity&, const Zero&) [with VertexAndEdgeListGraph = R_adjacency_list; DistanceMatrix = Basic2DMatrix; WeightMap = adj_list_edge_property_map, edge_weight_t>; BinaryPredicate = std::less; BinaryFunction = closed_plus; Infinity = double; Zero = double]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/floyd_warshall_shortest.hpp:172:55: required from ‘bool boost::detail::floyd_warshall_noninit_dispatch(const VertexAndEdgeListGraph&, DistanceMatrix&, WeightMap, const boost::bgl_named_params&) [with VertexAndEdgeListGraph = R_adjacency_list; DistanceMatrix = Basic2DMatrix; WeightMap = boost::adj_list_edge_property_map, boost::edge_weight_t>; P = int; T = int; R = boost::no_property]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/floyd_warshall_shortest.hpp:217:51: required from ‘bool boost::floyd_warshall_all_pairs_shortest_paths(const VertexAndEdgeListGraph&, DistanceMatrix&) [with VertexAndEdgeListGraph = R_adjacency_list; DistanceMatrix = Basic2DMatrix]’ shortestPath.cpp:186:48: required from here /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::Assignable::~Assignable() [with TT = long unsigned int]’ 37 | ~model() | ^ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:145:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 145 | BOOST_CONCEPT_USAGE(Assignable) { | ^~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::concepts::MultiPassInputIterator >]’: /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements > >]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/graph_concepts.hpp:52:50: required from ‘struct boost::concepts::MultiPassInputIterator >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::concepts::MultiPassInputIterator >]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied > >::value’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:45:51: [ skipping 2 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/graph_concepts.hpp:184:9: required from ‘boost::concepts::VertexListGraph::~VertexListGraph() [with G = R_adjacency_list]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/graph_concepts.hpp:176:1: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::VertexListGraphConcept >]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/bellman_ford_shortest_paths.hpp:218:5: required from ‘bool boost::floyd_warshall_all_pairs_shortest_paths(const VertexAndEdgeListGraph&, DistanceMatrix&, const WeightMap&, const BinaryPredicate&, const BinaryFunction&, const Infinity&, const Zero&) [with VertexAndEdgeListGraph = R_adjacency_list; DistanceMatrix = Basic2DMatrix; WeightMap = adj_list_edge_property_map, edge_weight_t>; BinaryPredicate = std::less; BinaryFunction = closed_plus; Infinity = double; Zero = double]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/floyd_warshall_shortest.hpp:172:55: required from ‘bool boost::detail::floyd_warshall_noninit_dispatch(const VertexAndEdgeListGraph&, DistanceMatrix&, WeightMap, const boost::bgl_named_params&) [with VertexAndEdgeListGraph = R_adjacency_list; DistanceMatrix = Basic2DMatrix; WeightMap = boost::adj_list_edge_property_map, boost::edge_weight_t>; P = int; T = int; R = boost::no_property]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/floyd_warshall_shortest.hpp:217:51: required from ‘bool boost::floyd_warshall_all_pairs_shortest_paths(const VertexAndEdgeListGraph&, DistanceMatrix&) [with VertexAndEdgeListGraph = R_adjacency_list; DistanceMatrix = Basic2DMatrix]’ shortestPath.cpp:186:48: required from here /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::concepts::MultiPassInputIterator::~MultiPassInputIterator() [with T = boost::range_detail::integer_iterator]’ 37 | ~model() | ^ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/graph_concepts.hpp:52:50: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 52 | BOOST_concept(MultiPassInputIterator, (T)) { BOOST_CONCEPT_USAGE( | ^~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::Convertible]’: /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements >]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:208:5: required from ‘struct boost::Convertible’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::Convertible]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied >::value’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:45:51: [ skipping 2 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/graph_concepts.hpp:185:9: required from ‘boost::concepts::VertexListGraph::~VertexListGraph() [with G = R_adjacency_list]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/graph_concepts.hpp:176:1: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::VertexListGraphConcept >]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/bellman_ford_shortest_paths.hpp:218:5: required from ‘bool boost::floyd_warshall_all_pairs_shortest_paths(const VertexAndEdgeListGraph&, DistanceMatrix&, const WeightMap&, const BinaryPredicate&, const BinaryFunction&, const Infinity&, const Zero&) [with VertexAndEdgeListGraph = R_adjacency_list; DistanceMatrix = Basic2DMatrix; WeightMap = adj_list_edge_property_map, edge_weight_t>; BinaryPredicate = std::less; BinaryFunction = closed_plus; Infinity = double; Zero = double]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/floyd_warshall_shortest.hpp:172:55: required from ‘bool boost::detail::floyd_warshall_noninit_dispatch(const VertexAndEdgeListGraph&, DistanceMatrix&, WeightMap, const boost::bgl_named_params&) [with VertexAndEdgeListGraph = R_adjacency_list; DistanceMatrix = Basic2DMatrix; WeightMap = boost::adj_list_edge_property_map, boost::edge_weight_t>; P = int; T = int; R = boost::no_property]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/floyd_warshall_shortest.hpp:217:51: required from ‘bool boost::floyd_warshall_all_pairs_shortest_paths(const VertexAndEdgeListGraph&, DistanceMatrix&) [with VertexAndEdgeListGraph = R_adjacency_list; DistanceMatrix = Basic2DMatrix]’ shortestPath.cpp:186:48: required from here /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::Convertible::~Convertible() [with X = boost::adj_list_dir_traversal_tag; Y = boost::vertex_list_graph_tag]’ 37 | ~model() | ^ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:208:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 208 | BOOST_CONCEPT_USAGE(Convertible) { | ^~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::concepts::MultiPassInputIterator, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator >*, std::vector >, std::allocator > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::adjacency_list, boost::property, boost::no_property, boost::listS> > >]’: /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator >*, std::vector >, std::allocator > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::adjacency_list, boost::property, boost::no_property, boost::listS> > > >]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/graph_concepts.hpp:52:50: required from ‘struct boost::concepts::MultiPassInputIterator, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator >*, std::vector >, std::allocator > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::adjacency_list, boost::property, boost::no_property, boost::listS> > >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::concepts::MultiPassInputIterator, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator >*, std::vector >, std::allocator > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::adjacency_list, boost::property, boost::no_property, boost::listS> > >]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator >*, std::vector >, std::allocator > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::adjacency_list, boost::property, boost::no_property, boost::listS> > > >::value’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:45:51: [ skipping 2 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/graph_concepts.hpp:235:9: required from ‘boost::concepts::EdgeListGraph::~EdgeListGraph() [with G = R_adjacency_list]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/graph_concepts.hpp:226:1: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::EdgeListGraphConcept >]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/bellman_ford_shortest_paths.hpp:97:5: required from ‘bool boost::floyd_warshall_all_pairs_shortest_paths(const VertexAndEdgeListGraph&, DistanceMatrix&, const WeightMap&, const BinaryPredicate&, const BinaryFunction&, const Infinity&, const Zero&) [with VertexAndEdgeListGraph = R_adjacency_list; DistanceMatrix = Basic2DMatrix; WeightMap = adj_list_edge_property_map, edge_weight_t>; BinaryPredicate = std::less; BinaryFunction = closed_plus; Infinity = double; Zero = double]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/floyd_warshall_shortest.hpp:172:55: required from ‘bool boost::detail::floyd_warshall_noninit_dispatch(const VertexAndEdgeListGraph&, DistanceMatrix&, WeightMap, const boost::bgl_named_params&) [with VertexAndEdgeListGraph = R_adjacency_list; DistanceMatrix = Basic2DMatrix; WeightMap = boost::adj_list_edge_property_map, boost::edge_weight_t>; P = int; T = int; R = boost::no_property]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/floyd_warshall_shortest.hpp:217:51: required from ‘bool boost::floyd_warshall_all_pairs_shortest_paths(const VertexAndEdgeListGraph&, DistanceMatrix&) [with VertexAndEdgeListGraph = R_adjacency_list; DistanceMatrix = Basic2DMatrix]’ shortestPath.cpp:186:48: required from here /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::concepts::MultiPassInputIterator::~MultiPassInputIterator() [with T = boost::detail::adj_list_edge_iterator, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator >*, std::vector >, std::allocator > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::adjacency_list, boost::property, boost::no_property, boost::listS> >]’ 37 | ~model() | ^ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/graph_concepts.hpp:52:50: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 52 | BOOST_concept(MultiPassInputIterator, (T)) { BOOST_CONCEPT_USAGE( | ^~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::DefaultConstructible >]’: /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements > >]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:137:5: required from ‘struct boost::DefaultConstructible >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::DefaultConstructible >]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied > >::value’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:45:51: [ skipping 2 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/graph_concepts.hpp:90:9: required from ‘boost::concepts::EdgeListGraph::~EdgeListGraph() [with G = R_adjacency_list]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/graph_concepts.hpp:226:1: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::EdgeListGraphConcept >]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/bellman_ford_shortest_paths.hpp:97:5: required from ‘bool boost::floyd_warshall_all_pairs_shortest_paths(const VertexAndEdgeListGraph&, DistanceMatrix&, const WeightMap&, const BinaryPredicate&, const BinaryFunction&, const Infinity&, const Zero&) [with VertexAndEdgeListGraph = R_adjacency_list; DistanceMatrix = Basic2DMatrix; WeightMap = adj_list_edge_property_map, edge_weight_t>; BinaryPredicate = std::less; BinaryFunction = closed_plus; Infinity = double; Zero = double]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/floyd_warshall_shortest.hpp:172:55: required from ‘bool boost::detail::floyd_warshall_noninit_dispatch(const VertexAndEdgeListGraph&, DistanceMatrix&, WeightMap, const boost::bgl_named_params&) [with VertexAndEdgeListGraph = R_adjacency_list; DistanceMatrix = Basic2DMatrix; WeightMap = boost::adj_list_edge_property_map, boost::edge_weight_t>; P = int; T = int; R = boost::no_property]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/floyd_warshall_shortest.hpp:217:51: required from ‘bool boost::floyd_warshall_all_pairs_shortest_paths(const VertexAndEdgeListGraph&, DistanceMatrix&) [with VertexAndEdgeListGraph = R_adjacency_list; DistanceMatrix = Basic2DMatrix]’ shortestPath.cpp:186:48: required from here /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::DefaultConstructible::~DefaultConstructible() [with TT = boost::detail::edge_desc_impl]’ 37 | ~model() | ^ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:137:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 137 | BOOST_CONCEPT_USAGE(DefaultConstructible) { | ^~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::EqualityComparable >]’: /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements > >]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:233:5: required from ‘struct boost::EqualityComparable >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::EqualityComparable >]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied > >::value’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:45:51: [ skipping 2 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/graph_concepts.hpp:91:9: required from ‘boost::concepts::EdgeListGraph::~EdgeListGraph() [with G = R_adjacency_list]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/graph_concepts.hpp:226:1: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::EdgeListGraphConcept >]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/bellman_ford_shortest_paths.hpp:97:5: required from ‘bool boost::floyd_warshall_all_pairs_shortest_paths(const VertexAndEdgeListGraph&, DistanceMatrix&, const WeightMap&, const BinaryPredicate&, const BinaryFunction&, const Infinity&, const Zero&) [with VertexAndEdgeListGraph = R_adjacency_list; DistanceMatrix = Basic2DMatrix; WeightMap = adj_list_edge_property_map, edge_weight_t>; BinaryPredicate = std::less; BinaryFunction = closed_plus; Infinity = double; Zero = double]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/floyd_warshall_shortest.hpp:172:55: required from ‘bool boost::detail::floyd_warshall_noninit_dispatch(const VertexAndEdgeListGraph&, DistanceMatrix&, WeightMap, const boost::bgl_named_params&) [with VertexAndEdgeListGraph = R_adjacency_list; DistanceMatrix = Basic2DMatrix; WeightMap = boost::adj_list_edge_property_map, boost::edge_weight_t>; P = int; T = int; R = boost::no_property]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/floyd_warshall_shortest.hpp:217:51: required from ‘bool boost::floyd_warshall_all_pairs_shortest_paths(const VertexAndEdgeListGraph&, DistanceMatrix&) [with VertexAndEdgeListGraph = R_adjacency_list; DistanceMatrix = Basic2DMatrix]’ shortestPath.cpp:186:48: required from here /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::EqualityComparable::~EqualityComparable() [with TT = boost::detail::edge_desc_impl]’ 37 | ~model() | ^ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:233:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 233 | BOOST_CONCEPT_USAGE(EqualityComparable) { | ^~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::Assignable >]’: /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements > >]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:145:5: required from ‘struct boost::Assignable >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::Assignable >]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied > >::value’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:45:51: [ skipping 2 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/graph_concepts.hpp:92:9: required from ‘boost::concepts::EdgeListGraph::~EdgeListGraph() [with G = R_adjacency_list]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/graph_concepts.hpp:226:1: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::EdgeListGraphConcept >]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/bellman_ford_shortest_paths.hpp:97:5: required from ‘bool boost::floyd_warshall_all_pairs_shortest_paths(const VertexAndEdgeListGraph&, DistanceMatrix&, const WeightMap&, const BinaryPredicate&, const BinaryFunction&, const Infinity&, const Zero&) [with VertexAndEdgeListGraph = R_adjacency_list; DistanceMatrix = Basic2DMatrix; WeightMap = adj_list_edge_property_map, edge_weight_t>; BinaryPredicate = std::less; BinaryFunction = closed_plus; Infinity = double; Zero = double]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/floyd_warshall_shortest.hpp:172:55: required from ‘bool boost::detail::floyd_warshall_noninit_dispatch(const VertexAndEdgeListGraph&, DistanceMatrix&, WeightMap, const boost::bgl_named_params&) [with VertexAndEdgeListGraph = R_adjacency_list; DistanceMatrix = Basic2DMatrix; WeightMap = boost::adj_list_edge_property_map, boost::edge_weight_t>; P = int; T = int; R = boost::no_property]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/floyd_warshall_shortest.hpp:217:51: required from ‘bool boost::floyd_warshall_all_pairs_shortest_paths(const VertexAndEdgeListGraph&, DistanceMatrix&) [with VertexAndEdgeListGraph = R_adjacency_list; DistanceMatrix = Basic2DMatrix]’ shortestPath.cpp:186:48: required from here /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::Assignable::~Assignable() [with TT = boost::detail::edge_desc_impl]’ 37 | ~model() | ^ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:145:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 145 | BOOST_CONCEPT_USAGE(Assignable) { | ^~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::Convertible]’: /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements >]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:208:5: required from ‘struct boost::Convertible’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::Convertible]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied >::value’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:45:51: [ skipping 2 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/graph_concepts.hpp:239:9: required from ‘boost::concepts::EdgeListGraph::~EdgeListGraph() [with G = R_adjacency_list]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/graph_concepts.hpp:226:1: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::EdgeListGraphConcept >]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/bellman_ford_shortest_paths.hpp:97:5: required from ‘bool boost::floyd_warshall_all_pairs_shortest_paths(const VertexAndEdgeListGraph&, DistanceMatrix&, const WeightMap&, const BinaryPredicate&, const BinaryFunction&, const Infinity&, const Zero&) [with VertexAndEdgeListGraph = R_adjacency_list; DistanceMatrix = Basic2DMatrix; WeightMap = adj_list_edge_property_map, edge_weight_t>; BinaryPredicate = std::less; BinaryFunction = closed_plus; Infinity = double; Zero = double]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/floyd_warshall_shortest.hpp:172:55: required from ‘bool boost::detail::floyd_warshall_noninit_dispatch(const VertexAndEdgeListGraph&, DistanceMatrix&, WeightMap, const boost::bgl_named_params&) [with VertexAndEdgeListGraph = R_adjacency_list; DistanceMatrix = Basic2DMatrix; WeightMap = boost::adj_list_edge_property_map, boost::edge_weight_t>; P = int; T = int; R = boost::no_property]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/floyd_warshall_shortest.hpp:217:51: required from ‘bool boost::floyd_warshall_all_pairs_shortest_paths(const VertexAndEdgeListGraph&, DistanceMatrix&) [with VertexAndEdgeListGraph = R_adjacency_list; DistanceMatrix = Basic2DMatrix]’ shortestPath.cpp:186:48: required from here /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::Convertible::~Convertible() [with X = boost::adj_list_dir_traversal_tag; Y = boost::edge_list_graph_tag]’ 37 | ~model() | ^ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:208:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 208 | BOOST_CONCEPT_USAGE(Convertible) { | ^~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::concepts::MultiPassInputIterator >*, std::vector >, std::allocator > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> >]’: /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements >*, std::vector >, std::allocator > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/graph_concepts.hpp:52:50: required from ‘struct boost::concepts::MultiPassInputIterator >*, std::vector >, std::allocator > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::concepts::MultiPassInputIterator >*, std::vector >, std::allocator > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> >]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied >*, std::vector >, std::allocator > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::value’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:45:51: [ skipping 2 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/graph_concepts.hpp:89:9: required from ‘boost::concepts::IncidenceGraph::~IncidenceGraph() [with G = R_adjacency_list]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/graph_concepts.hpp:75:1: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::IncidenceGraphConcept >]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/breadth_first_search.hpp:62:5: required from ‘bool boost::floyd_warshall_all_pairs_shortest_paths(const VertexAndEdgeListGraph&, DistanceMatrix&, const WeightMap&, const BinaryPredicate&, const BinaryFunction&, const Infinity&, const Zero&) [with VertexAndEdgeListGraph = R_adjacency_list; DistanceMatrix = Basic2DMatrix; WeightMap = adj_list_edge_property_map, edge_weight_t>; BinaryPredicate = std::less; BinaryFunction = closed_plus; Infinity = double; Zero = double]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/floyd_warshall_shortest.hpp:172:55: required from ‘bool boost::detail::floyd_warshall_noninit_dispatch(const VertexAndEdgeListGraph&, DistanceMatrix&, WeightMap, const boost::bgl_named_params&) [with VertexAndEdgeListGraph = R_adjacency_list; DistanceMatrix = Basic2DMatrix; WeightMap = boost::adj_list_edge_property_map, boost::edge_weight_t>; P = int; T = int; R = boost::no_property]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/floyd_warshall_shortest.hpp:217:51: required from ‘bool boost::floyd_warshall_all_pairs_shortest_paths(const VertexAndEdgeListGraph&, DistanceMatrix&) [with VertexAndEdgeListGraph = R_adjacency_list; DistanceMatrix = Basic2DMatrix]’ shortestPath.cpp:186:48: required from here /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::concepts::MultiPassInputIterator::~MultiPassInputIterator() [with T = boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator >*, std::vector >, std::allocator > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>]’ 37 | ~model() | ^ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/graph_concepts.hpp:52:50: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 52 | BOOST_concept(MultiPassInputIterator, (T)) { BOOST_CONCEPT_USAGE( | ^~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::Convertible]’: /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements >]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:208:5: required from ‘struct boost::Convertible’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::Convertible]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied >::value’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:45:51: [ skipping 2 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/graph_concepts.hpp:93:9: required from ‘boost::concepts::IncidenceGraph::~IncidenceGraph() [with G = R_adjacency_list]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/graph_concepts.hpp:75:1: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::IncidenceGraphConcept >]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/breadth_first_search.hpp:62:5: required from ‘bool boost::floyd_warshall_all_pairs_shortest_paths(const VertexAndEdgeListGraph&, DistanceMatrix&, const WeightMap&, const BinaryPredicate&, const BinaryFunction&, const Infinity&, const Zero&) [with VertexAndEdgeListGraph = R_adjacency_list; DistanceMatrix = Basic2DMatrix; WeightMap = adj_list_edge_property_map, edge_weight_t>; BinaryPredicate = std::less; BinaryFunction = closed_plus; Infinity = double; Zero = double]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/floyd_warshall_shortest.hpp:172:55: required from ‘bool boost::detail::floyd_warshall_noninit_dispatch(const VertexAndEdgeListGraph&, DistanceMatrix&, WeightMap, const boost::bgl_named_params&) [with VertexAndEdgeListGraph = R_adjacency_list; DistanceMatrix = Basic2DMatrix; WeightMap = boost::adj_list_edge_property_map, boost::edge_weight_t>; P = int; T = int; R = boost::no_property]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/floyd_warshall_shortest.hpp:217:51: required from ‘bool boost::floyd_warshall_all_pairs_shortest_paths(const VertexAndEdgeListGraph&, DistanceMatrix&) [with VertexAndEdgeListGraph = R_adjacency_list; DistanceMatrix = Basic2DMatrix]’ shortestPath.cpp:186:48: required from here /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::Convertible::~Convertible() [with X = boost::adj_list_dir_traversal_tag; Y = boost::incidence_graph_tag]’ 37 | ~model() | ^ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:208:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 208 | BOOST_CONCEPT_USAGE(Convertible) { | ^~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::Convertible]’: /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements >]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:208:5: required from ‘struct boost::Convertible’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::Convertible]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied >::value’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:72:8: [ skipping 11 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied > > >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_ > >)>’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/property_map/property_map.hpp:354:5: required from ‘boost::iterator_property_map boost::make_iterator_property_map(RAIter, ID, Value) [with RAIter = __gnu_cxx::__normal_iterator >; Value = double; ID = vec_adj_list_vertex_id_map, long unsigned int>]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/dijkstra_shortest_paths.hpp:556:43: required from ‘void boost::detail::dijkstra_dispatch1(const VertexListGraph&, typename boost::graph_traits::vertex_descriptor, DistanceMap, WeightMap, IndexMap, const Params&) [with VertexListGraph = R_adjacency_list; DistanceMap = double*; WeightMap = boost::adj_list_edge_property_map, boost::edge_weight_t>; IndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>; Params = boost::bgl_named_params >; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/dijkstra_shortest_paths.hpp:570:31: required from ‘void boost::dijkstra_shortest_paths(const VertexListGraph&, typename graph_traits::vertex_descriptor, const bgl_named_params&) [with VertexListGraph = R_adjacency_list; Param = double*; Tag = vertex_distance_t; Rest = bgl_named_params; typename graph_traits::vertex_descriptor = long unsigned int]’ shortestPath.cpp:25:32: required from here /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::Convertible::~Convertible() [with X = std::random_access_iterator_tag; Y = std::input_iterator_tag]’ 37 | ~model() | ^ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:208:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 208 | BOOST_CONCEPT_USAGE(Convertible) { | ^~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::Convertible]’: /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements >]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:208:5: required from ‘struct boost::Convertible’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::Convertible]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied >::value’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:72:8: [ skipping 10 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied > > >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_ > >)>’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/property_map/property_map.hpp:354:5: required from ‘boost::iterator_property_map boost::make_iterator_property_map(RAIter, ID, Value) [with RAIter = __gnu_cxx::__normal_iterator >; Value = double; ID = vec_adj_list_vertex_id_map, long unsigned int>]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/dijkstra_shortest_paths.hpp:556:43: required from ‘void boost::detail::dijkstra_dispatch1(const VertexListGraph&, typename boost::graph_traits::vertex_descriptor, DistanceMap, WeightMap, IndexMap, const Params&) [with VertexListGraph = R_adjacency_list; DistanceMap = double*; WeightMap = boost::adj_list_edge_property_map, boost::edge_weight_t>; IndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>; Params = boost::bgl_named_params >; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/dijkstra_shortest_paths.hpp:570:31: required from ‘void boost::dijkstra_shortest_paths(const VertexListGraph&, typename graph_traits::vertex_descriptor, const bgl_named_params&) [with VertexListGraph = R_adjacency_list; Param = double*; Tag = vertex_distance_t; Rest = bgl_named_params; typename graph_traits::vertex_descriptor = long unsigned int]’ shortestPath.cpp:25:32: required from here /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::Convertible::~Convertible() [with X = std::random_access_iterator_tag; Y = std::forward_iterator_tag]’ 37 | ~model() | ^ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:208:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 208 | BOOST_CONCEPT_USAGE(Convertible) { | ^~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::Convertible]’: /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements >]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:208:5: required from ‘struct boost::Convertible’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::Convertible]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied >::value’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:72:8: [ skipping 9 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied > > >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_ > >)>’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/property_map/property_map.hpp:354:5: required from ‘boost::iterator_property_map boost::make_iterator_property_map(RAIter, ID, Value) [with RAIter = __gnu_cxx::__normal_iterator >; Value = double; ID = vec_adj_list_vertex_id_map, long unsigned int>]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/dijkstra_shortest_paths.hpp:556:43: required from ‘void boost::detail::dijkstra_dispatch1(const VertexListGraph&, typename boost::graph_traits::vertex_descriptor, DistanceMap, WeightMap, IndexMap, const Params&) [with VertexListGraph = R_adjacency_list; DistanceMap = double*; WeightMap = boost::adj_list_edge_property_map, boost::edge_weight_t>; IndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>; Params = boost::bgl_named_params >; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/dijkstra_shortest_paths.hpp:570:31: required from ‘void boost::dijkstra_shortest_paths(const VertexListGraph&, typename graph_traits::vertex_descriptor, const bgl_named_params&) [with VertexListGraph = R_adjacency_list; Param = double*; Tag = vertex_distance_t; Rest = bgl_named_params; typename graph_traits::vertex_descriptor = long unsigned int]’ shortestPath.cpp:25:32: required from here /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::Convertible::~Convertible() [with X = std::random_access_iterator_tag; Y = std::bidirectional_iterator_tag]’ 37 | ~model() | ^ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:208:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 208 | BOOST_CONCEPT_USAGE(Convertible) { | ^~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::concepts::MultiPassInputIterator, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::adjacency_list, boost::property >, boost::no_property, boost::listS> > >]’: /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::adjacency_list, boost::property >, boost::no_property, boost::listS> > > >]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/graph_concepts.hpp:52:50: required from ‘struct boost::concepts::MultiPassInputIterator, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::adjacency_list, boost::property >, boost::no_property, boost::listS> > >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::concepts::MultiPassInputIterator, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::adjacency_list, boost::property >, boost::no_property, boost::listS> > >]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::adjacency_list, boost::property >, boost::no_property, boost::listS> > > >::value’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::adjacency_list, boost::property >, boost::no_property, boost::listS> > > >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:72:8: [ skipping 2 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/graph_concepts.hpp:226:1: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::EdgeListGraphConcept, boost::property >, boost::no_property, boost::listS> >]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/bellman_ford_shortest_paths.hpp:97:5: required from ‘bool boost::bellman_ford_shortest_paths(EdgeListGraph&, Size, WeightMap, PredecessorMap, DistanceMap, BinaryFunction, BinaryPredicate, BellmanFordVisitor) [with EdgeListGraph = adjacency_list, property >, no_property, listS>; Size = long unsigned int; WeightMap = adj_list_edge_property_map >, edge_weight_t>; PredecessorMap = dummy_property_map; DistanceMap = vec_adj_list_vertex_property_map, property >, no_property, listS>, adjacency_list, property >, no_property, listS>*, double, double&, vertex_distance_t>; BinaryFunction = closed_plus; BinaryPredicate = std::less; BellmanFordVisitor = bellman_visitor<>]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/johnson_all_pairs_shortest.hpp:112:36: required from ‘bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, VertexID, Weight, const BinaryPredicate&, const BinaryFunction&, const Infinity&, DistanceZero) [with VertexAndEdgeListGraph = R_adjacency_list; DistanceMatrix = Basic2DMatrix; VertexID = vec_adj_list_vertex_id_map, long unsigned int>; Weight = adj_list_edge_property_map, edge_weight_t>; BinaryPredicate = std::less; BinaryFunction = closed_plus; Infinity = double; DistanceZero = double]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/johnson_all_pairs_shortest.hpp:164:48: required from ‘bool boost::detail::johnson_dispatch(VertexAndEdgeListGraph&, DistanceMatrix&, const boost::bgl_named_params&, Weight, VertexID) [with VertexAndEdgeListGraph = R_adjacency_list; DistanceMatrix = Basic2DMatrix; P = int; T = int; R = boost::no_property; Weight = boost::adj_list_edge_property_map, boost::edge_weight_t>; VertexID = boost::vec_adj_list_vertex_id_map, long unsigned int>]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/johnson_all_pairs_shortest.hpp:192:36: required from ‘bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&) [with VertexAndEdgeListGraph = R_adjacency_list; DistanceMatrix = Basic2DMatrix]’ shortestPath.cpp:56:41: required from here /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::concepts::MultiPassInputIterator::~MultiPassInputIterator() [with T = boost::detail::adj_list_edge_iterator, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::adjacency_list, boost::property >, boost::no_property, boost::listS> >]’ 37 | ~model() | ^ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/graph_concepts.hpp:52:50: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 52 | BOOST_concept(MultiPassInputIterator, (T)) { BOOST_CONCEPT_USAGE( | ^~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::Convertible]’: /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements >]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:208:5: required from ‘struct boost::Convertible’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:206:3: required from ‘struct boost::ConvertibleConcept’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::ConvertibleConcept]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied >::value’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:45:51: [ skipping 11 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_, boost::property >, boost::no_property, boost::listS>, boost::adjacency_list, boost::property >, boost::no_property, boost::listS>*, double, double&, boost::vertex_distance_t>, long unsigned int>)>’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/bellman_ford_shortest_paths.hpp:101:5: required from ‘bool boost::bellman_ford_shortest_paths(EdgeListGraph&, Size, WeightMap, PredecessorMap, DistanceMap, BinaryFunction, BinaryPredicate, BellmanFordVisitor) [with EdgeListGraph = adjacency_list, property >, no_property, listS>; Size = long unsigned int; WeightMap = adj_list_edge_property_map >, edge_weight_t>; PredecessorMap = dummy_property_map; DistanceMap = vec_adj_list_vertex_property_map, property >, no_property, listS>, adjacency_list, property >, no_property, listS>*, double, double&, vertex_distance_t>; BinaryFunction = closed_plus; BinaryPredicate = std::less; BellmanFordVisitor = bellman_visitor<>]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/johnson_all_pairs_shortest.hpp:112:36: required from ‘bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, VertexID, Weight, const BinaryPredicate&, const BinaryFunction&, const Infinity&, DistanceZero) [with VertexAndEdgeListGraph = R_adjacency_list; DistanceMatrix = Basic2DMatrix; VertexID = vec_adj_list_vertex_id_map, long unsigned int>; Weight = adj_list_edge_property_map, edge_weight_t>; BinaryPredicate = std::less; BinaryFunction = closed_plus; Infinity = double; DistanceZero = double]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/johnson_all_pairs_shortest.hpp:164:48: required from ‘bool boost::detail::johnson_dispatch(VertexAndEdgeListGraph&, DistanceMatrix&, const boost::bgl_named_params&, Weight, VertexID) [with VertexAndEdgeListGraph = R_adjacency_list; DistanceMatrix = Basic2DMatrix; P = int; T = int; R = boost::no_property; Weight = boost::adj_list_edge_property_map, boost::edge_weight_t>; VertexID = boost::vec_adj_list_vertex_id_map, long unsigned int>]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/johnson_all_pairs_shortest.hpp:192:36: required from ‘bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&) [with VertexAndEdgeListGraph = R_adjacency_list; DistanceMatrix = Basic2DMatrix]’ shortestPath.cpp:56:41: required from here /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::Convertible::~Convertible() [with X = boost::lvalue_property_map_tag; Y = boost::writable_property_map_tag]’ 37 | ~model() | ^ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:208:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 208 | BOOST_CONCEPT_USAGE(Convertible) { | ^~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::concepts::MultiPassInputIterator, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator >*, std::vector >, std::allocator > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::adjacency_list > > >]’: /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator >*, std::vector >, std::allocator > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::adjacency_list > > > >]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/graph_concepts.hpp:52:50: required from ‘struct boost::concepts::MultiPassInputIterator, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator >*, std::vector >, std::allocator > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::adjacency_list > > >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::concepts::MultiPassInputIterator, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator >*, std::vector >, std::allocator > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::adjacency_list > > >]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator >*, std::vector >, std::allocator > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::adjacency_list > > > >::value’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator >*, std::vector >, std::allocator > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::adjacency_list > > > >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:72:8: [ skipping 2 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/graph_concepts.hpp:226:1: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::EdgeListGraphConcept > >]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/bellman_ford_shortest_paths.hpp:97:5: required from ‘bool boost::bellman_ford_shortest_paths(EdgeListGraph&, Size, WeightMap, PredecessorMap, DistanceMap, BinaryFunction, BinaryPredicate, BellmanFordVisitor) [with EdgeListGraph = adjacency_list >; Size = int; WeightMap = adj_list_edge_property_map, edge_weight_t>; PredecessorMap = long unsigned int*; DistanceMap = double*; BinaryFunction = closed_plus; BinaryPredicate = std::less; BellmanFordVisitor = bellman_visitor<>]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/bellman_ford_shortest_paths.hpp:176:43: required from ‘bool boost::detail::bellman_dispatch2(VertexAndEdgeListGraph&, boost::param_not_found, Size, WeightMap, PredecessorMap, DistanceMap, const boost::bgl_named_params&) [with VertexAndEdgeListGraph = boost::adjacency_list >; Size = int; WeightMap = boost::adj_list_edge_property_map, boost::edge_weight_t>; PredecessorMap = long unsigned int*; DistanceMap = double*; P = double*; T = boost::vertex_distance_t; R = boost::bgl_named_params, boost::edge_weight_t>, boost::edge_weight_t, boost::no_property> >]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/bellman_ford_shortest_paths.hpp:190:41: required from ‘bool boost::detail::bellman_dispatch(EdgeListGraph&, Size, WeightMap, DistanceMap, const boost::bgl_named_params&) [with EdgeListGraph = boost::adjacency_list >; Size = int; WeightMap = boost::adj_list_edge_property_map, boost::edge_weight_t>; DistanceMap = double*; P = double*; T = boost::vertex_distance_t; R = boost::bgl_named_params, boost::edge_weight_t>, boost::edge_weight_t, boost::no_property> >]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/bellman_ford_shortest_paths.hpp:201:36: required from ‘bool boost::bellman_ford_shortest_paths(EdgeListGraph&, Size, const bgl_named_params&) [with EdgeListGraph = adjacency_list >; Size = int; P = double*; T = vertex_distance_t; R = bgl_named_params, edge_weight_t>, edge_weight_t, no_property> >]’ shortestPath.cpp:105:45: required from here /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::concepts::MultiPassInputIterator::~MultiPassInputIterator() [with T = boost::detail::adj_list_edge_iterator, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator >*, std::vector >, std::allocator > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::adjacency_list > >]’ 37 | ~model() | ^ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/graph_concepts.hpp:52:50: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 52 | BOOST_concept(MultiPassInputIterator, (T)) { BOOST_CONCEPT_USAGE( | ^~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements > > > >]’: /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:167:5: required from ‘struct boost::CopyConstructible > > >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:165:3: required from ‘struct boost::CopyConstructibleConcept > > >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::CopyConstructibleConcept > > >]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied > > > >::value’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied > > > >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:72:8: [ skipping 7 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/depth_first_search.hpp:417:35: required from ‘void boost::depth_first_visit(const IncidenceGraph&, typename graph_traits::vertex_descriptor, DFSVisitor, ColorMap) [with IncidenceGraph = R_adjacency_list; DFSVisitor = topo_sort_visitor > >; ColorMap = iterator_property_map<__gnu_cxx::__normal_iterator >, vec_adj_list_vertex_id_map, long unsigned int>, default_color_type, default_color_type&>; typename graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/dag_shortest_paths.hpp:42:22: required from ‘void boost::dag_shortest_paths(const VertexListGraph&, typename graph_traits::vertex_descriptor, DistanceMap, WeightMap, ColorMap, PredecessorMap, DijkstraVisitor, Compare, Combine, DistInf, DistZero) [with VertexListGraph = R_adjacency_list; DijkstraVisitor = dijkstra_visitor<>; DistanceMap = double*; WeightMap = adj_list_edge_property_map, edge_weight_t>; ColorMap = iterator_property_map<__gnu_cxx::__normal_iterator >, vec_adj_list_vertex_id_map, long unsigned int>, default_color_type, default_color_type&>; PredecessorMap = long unsigned int*; Compare = std::less; Combine = closed_plus; DistInf = double; DistZero = double; typename graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/dag_shortest_paths.hpp:90:27: required from ‘void boost::detail::dag_sp_dispatch2(const VertexListGraph&, typename boost::graph_traits::vertex_descriptor, DistanceMap, WeightMap, ColorMap, IndexMap, DijkstraVisitor, const Params&) [with VertexListGraph = R_adjacency_list; DijkstraVisitor = boost::dijkstra_visitor<>; DistanceMap = double*; WeightMap = boost::adj_list_edge_property_map, boost::edge_weight_t>; ColorMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map, long unsigned int>, boost::default_color_type, boost::default_color_type&>; IndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>; Params = boost::bgl_named_params >; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/dag_shortest_paths.hpp:114:25: required from ‘void boost::detail::dag_sp_dispatch1(const VertexListGraph&, typename boost::graph_traits::vertex_descriptor, DistanceMap, WeightMap, ColorMap, IndexMap, DijkstraVisitor, const Params&) [with VertexListGraph = R_adjacency_list; DijkstraVisitor = boost::dijkstra_visitor<>; DistanceMap = double*; WeightMap = boost::adj_list_edge_property_map, boost::edge_weight_t>; ColorMap = boost::param_not_found; IndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>; Params = boost::bgl_named_params >; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/dag_shortest_paths.hpp:134:29: required from ‘void boost::dag_shortest_paths(const VertexListGraph&, typename graph_traits::vertex_descriptor, const bgl_named_params&) [with VertexListGraph = R_adjacency_list; Param = double*; Tag = vertex_distance_t; Rest = bgl_named_params; typename graph_traits::vertex_descriptor = long unsigned int]’ shortestPath.cpp:144:27: required from here /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::CopyConstructible > > >]’ 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ^ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::CopyConstructibleConcept > > >]’: /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/breadth_first_search.hpp:39:9: required from ‘void boost::DFSVisitorConcept::constraints() [with Visitor = boost::topo_sort_visitor > >; Graph = R_adjacency_list]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::DFSVisitorConcept > >, R_adjacency_list >]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied > >, R_adjacency_list > >::value’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied > >, R_adjacency_list > >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:72:8: [ skipping 2 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/depth_first_search.hpp:417:35: required from ‘void boost::depth_first_visit(const IncidenceGraph&, typename graph_traits::vertex_descriptor, DFSVisitor, ColorMap) [with IncidenceGraph = R_adjacency_list; DFSVisitor = topo_sort_visitor > >; ColorMap = iterator_property_map<__gnu_cxx::__normal_iterator >, vec_adj_list_vertex_id_map, long unsigned int>, default_color_type, default_color_type&>; typename graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/dag_shortest_paths.hpp:42:22: required from ‘void boost::dag_shortest_paths(const VertexListGraph&, typename graph_traits::vertex_descriptor, DistanceMap, WeightMap, ColorMap, PredecessorMap, DijkstraVisitor, Compare, Combine, DistInf, DistZero) [with VertexListGraph = R_adjacency_list; DijkstraVisitor = dijkstra_visitor<>; DistanceMap = double*; WeightMap = adj_list_edge_property_map, edge_weight_t>; ColorMap = iterator_property_map<__gnu_cxx::__normal_iterator >, vec_adj_list_vertex_id_map, long unsigned int>, default_color_type, default_color_type&>; PredecessorMap = long unsigned int*; Compare = std::less; Combine = closed_plus; DistInf = double; DistZero = double; typename graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/dag_shortest_paths.hpp:90:27: required from ‘void boost::detail::dag_sp_dispatch2(const VertexListGraph&, typename boost::graph_traits::vertex_descriptor, DistanceMap, WeightMap, ColorMap, IndexMap, DijkstraVisitor, const Params&) [with VertexListGraph = R_adjacency_list; DijkstraVisitor = boost::dijkstra_visitor<>; DistanceMap = double*; WeightMap = boost::adj_list_edge_property_map, boost::edge_weight_t>; ColorMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map, long unsigned int>, boost::default_color_type, boost::default_color_type&>; IndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>; Params = boost::bgl_named_params >; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/dag_shortest_paths.hpp:114:25: required from ‘void boost::detail::dag_sp_dispatch1(const VertexListGraph&, typename boost::graph_traits::vertex_descriptor, DistanceMap, WeightMap, ColorMap, IndexMap, DijkstraVisitor, const Params&) [with VertexListGraph = R_adjacency_list; DijkstraVisitor = boost::dijkstra_visitor<>; DistanceMap = double*; WeightMap = boost::adj_list_edge_property_map, boost::edge_weight_t>; ColorMap = boost::param_not_found; IndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>; Params = boost::bgl_named_params >; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/dag_shortest_paths.hpp:134:29: required from ‘void boost::dag_shortest_paths(const VertexListGraph&, typename graph_traits::vertex_descriptor, const bgl_named_params&) [with VertexListGraph = R_adjacency_list; Param = double*; Tag = vertex_distance_t; Rest = bgl_named_params; typename graph_traits::vertex_descriptor = long unsigned int]’ shortestPath.cpp:144:27: required from here /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:165:17: note: in a call to non-static member function ‘boost::CopyConstructibleConcept > > >::~CopyConstructibleConcept()’ 165 | BOOST_concept(CopyConstructible,(TT)) | ^~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/preprocessor/cat.hpp:29:34: note: in definition of macro ‘BOOST_PP_CAT_I’ 29 | # define BOOST_PP_CAT_I(a, b) a ## b | ^ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/concept_def.hpp:23:12: note: in expansion of macro ‘BOOST_PP_CAT’ 23 | struct BOOST_PP_CAT(name,Concept) \ | ^~~~~~~~~~~~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:165:3: note: in expansion of macro ‘BOOST_concept’ 165 | BOOST_concept(CopyConstructible,(TT)) | ^~~~~~~~~~~~~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::constraint::failed() [with Model = boost::ReadablePropertyMapConcept >, boost::vec_adj_list_vertex_id_map, long unsigned int>, boost::default_color_type, boost::default_color_type&>, long unsigned int>]’: /home/omnipath/local/R/4.4-3.20/BH/include/boost/property_map/property_map.hpp:206:7: required from ‘void boost::ReadWritePropertyMapConcept::constraints() [with PMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map, long unsigned int>, boost::default_color_type, boost::default_color_type&>; Key = long unsigned int]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::ReadWritePropertyMapConcept >, boost::vec_adj_list_vertex_id_map, long unsigned int>, boost::default_color_type, boost::default_color_type&>, long unsigned int>]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied >, boost::vec_adj_list_vertex_id_map, long unsigned int>, boost::default_color_type, boost::default_color_type&>, long unsigned int> >::value’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied >, boost::vec_adj_list_vertex_id_map, long unsigned int>, boost::default_color_type, boost::default_color_type&>, long unsigned int> >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:72:8: [ skipping 2 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/depth_first_search.hpp:417:35: required from ‘void boost::depth_first_visit(const IncidenceGraph&, typename graph_traits::vertex_descriptor, DFSVisitor, ColorMap) [with IncidenceGraph = R_adjacency_list; DFSVisitor = topo_sort_visitor > >; ColorMap = iterator_property_map<__gnu_cxx::__normal_iterator >, vec_adj_list_vertex_id_map, long unsigned int>, default_color_type, default_color_type&>; typename graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/dag_shortest_paths.hpp:42:22: required from ‘void boost::dag_shortest_paths(const VertexListGraph&, typename graph_traits::vertex_descriptor, DistanceMap, WeightMap, ColorMap, PredecessorMap, DijkstraVisitor, Compare, Combine, DistInf, DistZero) [with VertexListGraph = R_adjacency_list; DijkstraVisitor = dijkstra_visitor<>; DistanceMap = double*; WeightMap = adj_list_edge_property_map, edge_weight_t>; ColorMap = iterator_property_map<__gnu_cxx::__normal_iterator >, vec_adj_list_vertex_id_map, long unsigned int>, default_color_type, default_color_type&>; PredecessorMap = long unsigned int*; Compare = std::less; Combine = closed_plus; DistInf = double; DistZero = double; typename graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/dag_shortest_paths.hpp:90:27: required from ‘void boost::detail::dag_sp_dispatch2(const VertexListGraph&, typename boost::graph_traits::vertex_descriptor, DistanceMap, WeightMap, ColorMap, IndexMap, DijkstraVisitor, const Params&) [with VertexListGraph = R_adjacency_list; DijkstraVisitor = boost::dijkstra_visitor<>; DistanceMap = double*; WeightMap = boost::adj_list_edge_property_map, boost::edge_weight_t>; ColorMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map, long unsigned int>, boost::default_color_type, boost::default_color_type&>; IndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>; Params = boost::bgl_named_params >; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/dag_shortest_paths.hpp:114:25: required from ‘void boost::detail::dag_sp_dispatch1(const VertexListGraph&, typename boost::graph_traits::vertex_descriptor, DistanceMap, WeightMap, ColorMap, IndexMap, DijkstraVisitor, const Params&) [with VertexListGraph = R_adjacency_list; DijkstraVisitor = boost::dijkstra_visitor<>; DistanceMap = double*; WeightMap = boost::adj_list_edge_property_map, boost::edge_weight_t>; ColorMap = boost::param_not_found; IndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>; Params = boost::bgl_named_params >; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/dag_shortest_paths.hpp:134:29: required from ‘void boost::dag_shortest_paths(const VertexListGraph&, typename graph_traits::vertex_descriptor, const bgl_named_params&) [with VertexListGraph = R_adjacency_list; Param = double*; Tag = vertex_distance_t; Rest = bgl_named_params; typename graph_traits::vertex_descriptor = long unsigned int]’ shortestPath.cpp:144:27: required from here /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:65:52: warning: ‘this’ pointer is null [-Wnonnull] 65 | static void failed() { ((Model*)0)->constraints(); } | ~~~~~~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/property_map/property_map.hpp:147:10: note: in a call to non-static member function ‘void boost::ReadablePropertyMapConcept::constraints() [with PMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map, long unsigned int>, boost::default_color_type, boost::default_color_type&>; Key = long unsigned int]’ 147 | void constraints() { | ^~~~~~~~~~~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::constraint::failed() [with Model = boost::WritablePropertyMapConcept >, boost::vec_adj_list_vertex_id_map, long unsigned int>, boost::default_color_type, boost::default_color_type&>, long unsigned int>]’: /home/omnipath/local/R/4.4-3.20/BH/include/boost/property_map/property_map.hpp:207:7: required from ‘void boost::ReadWritePropertyMapConcept::constraints() [with PMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map, long unsigned int>, boost::default_color_type, boost::default_color_type&>; Key = long unsigned int]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::ReadWritePropertyMapConcept >, boost::vec_adj_list_vertex_id_map, long unsigned int>, boost::default_color_type, boost::default_color_type&>, long unsigned int>]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied >, boost::vec_adj_list_vertex_id_map, long unsigned int>, boost::default_color_type, boost::default_color_type&>, long unsigned int> >::value’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied >, boost::vec_adj_list_vertex_id_map, long unsigned int>, boost::default_color_type, boost::default_color_type&>, long unsigned int> >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:72:8: [ skipping 2 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/depth_first_search.hpp:417:35: required from ‘void boost::depth_first_visit(const IncidenceGraph&, typename graph_traits::vertex_descriptor, DFSVisitor, ColorMap) [with IncidenceGraph = R_adjacency_list; DFSVisitor = topo_sort_visitor > >; ColorMap = iterator_property_map<__gnu_cxx::__normal_iterator >, vec_adj_list_vertex_id_map, long unsigned int>, default_color_type, default_color_type&>; typename graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/dag_shortest_paths.hpp:42:22: required from ‘void boost::dag_shortest_paths(const VertexListGraph&, typename graph_traits::vertex_descriptor, DistanceMap, WeightMap, ColorMap, PredecessorMap, DijkstraVisitor, Compare, Combine, DistInf, DistZero) [with VertexListGraph = R_adjacency_list; DijkstraVisitor = dijkstra_visitor<>; DistanceMap = double*; WeightMap = adj_list_edge_property_map, edge_weight_t>; ColorMap = iterator_property_map<__gnu_cxx::__normal_iterator >, vec_adj_list_vertex_id_map, long unsigned int>, default_color_type, default_color_type&>; PredecessorMap = long unsigned int*; Compare = std::less; Combine = closed_plus; DistInf = double; DistZero = double; typename graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/dag_shortest_paths.hpp:90:27: required from ‘void boost::detail::dag_sp_dispatch2(const VertexListGraph&, typename boost::graph_traits::vertex_descriptor, DistanceMap, WeightMap, ColorMap, IndexMap, DijkstraVisitor, const Params&) [with VertexListGraph = R_adjacency_list; DijkstraVisitor = boost::dijkstra_visitor<>; DistanceMap = double*; WeightMap = boost::adj_list_edge_property_map, boost::edge_weight_t>; ColorMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map, long unsigned int>, boost::default_color_type, boost::default_color_type&>; IndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>; Params = boost::bgl_named_params >; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/dag_shortest_paths.hpp:114:25: required from ‘void boost::detail::dag_sp_dispatch1(const VertexListGraph&, typename boost::graph_traits::vertex_descriptor, DistanceMap, WeightMap, ColorMap, IndexMap, DijkstraVisitor, const Params&) [with VertexListGraph = R_adjacency_list; DijkstraVisitor = boost::dijkstra_visitor<>; DistanceMap = double*; WeightMap = boost::adj_list_edge_property_map, boost::edge_weight_t>; ColorMap = boost::param_not_found; IndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>; Params = boost::bgl_named_params >; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/dag_shortest_paths.hpp:134:29: required from ‘void boost::dag_shortest_paths(const VertexListGraph&, typename graph_traits::vertex_descriptor, const bgl_named_params&) [with VertexListGraph = R_adjacency_list; Param = double*; Tag = vertex_distance_t; Rest = bgl_named_params; typename graph_traits::vertex_descriptor = long unsigned int]’ shortestPath.cpp:144:27: required from here /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:65:52: warning: ‘this’ pointer is null [-Wnonnull] 65 | static void failed() { ((Model*)0)->constraints(); } | ~~~~~~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/property_map/property_map.hpp:179:10: note: in a call to non-static member function ‘void boost::WritablePropertyMapConcept::constraints() [with PMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map, long unsigned int>, boost::default_color_type, boost::default_color_type&>; Key = long unsigned int]’ 179 | void constraints() { | ^~~~~~~~~~~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::EqualityComparable]’: /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements >]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:233:5: required from ‘struct boost::EqualityComparable’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/graph_concepts.hpp:502:1: required from ‘struct boost::concepts::ColorValue’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/graph_concepts.hpp:502:1: required from ‘struct boost::concepts::ColorValueConcept’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::concepts::ColorValueConcept]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:42:5: [ skipping 4 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/depth_first_search.hpp:417:35: required from ‘void boost::depth_first_visit(const IncidenceGraph&, typename graph_traits::vertex_descriptor, DFSVisitor, ColorMap) [with IncidenceGraph = R_adjacency_list; DFSVisitor = topo_sort_visitor > >; ColorMap = iterator_property_map<__gnu_cxx::__normal_iterator >, vec_adj_list_vertex_id_map, long unsigned int>, default_color_type, default_color_type&>; typename graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/dag_shortest_paths.hpp:42:22: required from ‘void boost::dag_shortest_paths(const VertexListGraph&, typename graph_traits::vertex_descriptor, DistanceMap, WeightMap, ColorMap, PredecessorMap, DijkstraVisitor, Compare, Combine, DistInf, DistZero) [with VertexListGraph = R_adjacency_list; DijkstraVisitor = dijkstra_visitor<>; DistanceMap = double*; WeightMap = adj_list_edge_property_map, edge_weight_t>; ColorMap = iterator_property_map<__gnu_cxx::__normal_iterator >, vec_adj_list_vertex_id_map, long unsigned int>, default_color_type, default_color_type&>; PredecessorMap = long unsigned int*; Compare = std::less; Combine = closed_plus; DistInf = double; DistZero = double; typename graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/dag_shortest_paths.hpp:90:27: required from ‘void boost::detail::dag_sp_dispatch2(const VertexListGraph&, typename boost::graph_traits::vertex_descriptor, DistanceMap, WeightMap, ColorMap, IndexMap, DijkstraVisitor, const Params&) [with VertexListGraph = R_adjacency_list; DijkstraVisitor = boost::dijkstra_visitor<>; DistanceMap = double*; WeightMap = boost::adj_list_edge_property_map, boost::edge_weight_t>; ColorMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map, long unsigned int>, boost::default_color_type, boost::default_color_type&>; IndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>; Params = boost::bgl_named_params >; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/dag_shortest_paths.hpp:114:25: required from ‘void boost::detail::dag_sp_dispatch1(const VertexListGraph&, typename boost::graph_traits::vertex_descriptor, DistanceMap, WeightMap, ColorMap, IndexMap, DijkstraVisitor, const Params&) [with VertexListGraph = R_adjacency_list; DijkstraVisitor = boost::dijkstra_visitor<>; DistanceMap = double*; WeightMap = boost::adj_list_edge_property_map, boost::edge_weight_t>; ColorMap = boost::param_not_found; IndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>; Params = boost::bgl_named_params >; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/dag_shortest_paths.hpp:134:29: required from ‘void boost::dag_shortest_paths(const VertexListGraph&, typename graph_traits::vertex_descriptor, const bgl_named_params&) [with VertexListGraph = R_adjacency_list; Param = double*; Tag = vertex_distance_t; Rest = bgl_named_params; typename graph_traits::vertex_descriptor = long unsigned int]’ shortestPath.cpp:144:27: required from here /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::EqualityComparable::~EqualityComparable() [with TT = boost::default_color_type]’ 37 | ~model() | ^ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:233:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 233 | BOOST_CONCEPT_USAGE(EqualityComparable) { | ^~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::DefaultConstructible]’: /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements >]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:137:5: required from ‘struct boost::DefaultConstructible’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/graph_concepts.hpp:502:1: required from ‘struct boost::concepts::ColorValue’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/graph_concepts.hpp:502:1: required from ‘struct boost::concepts::ColorValueConcept’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::concepts::ColorValueConcept]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:42:5: [ skipping 4 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/depth_first_search.hpp:417:35: required from ‘void boost::depth_first_visit(const IncidenceGraph&, typename graph_traits::vertex_descriptor, DFSVisitor, ColorMap) [with IncidenceGraph = R_adjacency_list; DFSVisitor = topo_sort_visitor > >; ColorMap = iterator_property_map<__gnu_cxx::__normal_iterator >, vec_adj_list_vertex_id_map, long unsigned int>, default_color_type, default_color_type&>; typename graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/dag_shortest_paths.hpp:42:22: required from ‘void boost::dag_shortest_paths(const VertexListGraph&, typename graph_traits::vertex_descriptor, DistanceMap, WeightMap, ColorMap, PredecessorMap, DijkstraVisitor, Compare, Combine, DistInf, DistZero) [with VertexListGraph = R_adjacency_list; DijkstraVisitor = dijkstra_visitor<>; DistanceMap = double*; WeightMap = adj_list_edge_property_map, edge_weight_t>; ColorMap = iterator_property_map<__gnu_cxx::__normal_iterator >, vec_adj_list_vertex_id_map, long unsigned int>, default_color_type, default_color_type&>; PredecessorMap = long unsigned int*; Compare = std::less; Combine = closed_plus; DistInf = double; DistZero = double; typename graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/dag_shortest_paths.hpp:90:27: required from ‘void boost::detail::dag_sp_dispatch2(const VertexListGraph&, typename boost::graph_traits::vertex_descriptor, DistanceMap, WeightMap, ColorMap, IndexMap, DijkstraVisitor, const Params&) [with VertexListGraph = R_adjacency_list; DijkstraVisitor = boost::dijkstra_visitor<>; DistanceMap = double*; WeightMap = boost::adj_list_edge_property_map, boost::edge_weight_t>; ColorMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map, long unsigned int>, boost::default_color_type, boost::default_color_type&>; IndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>; Params = boost::bgl_named_params >; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/dag_shortest_paths.hpp:114:25: required from ‘void boost::detail::dag_sp_dispatch1(const VertexListGraph&, typename boost::graph_traits::vertex_descriptor, DistanceMap, WeightMap, ColorMap, IndexMap, DijkstraVisitor, const Params&) [with VertexListGraph = R_adjacency_list; DijkstraVisitor = boost::dijkstra_visitor<>; DistanceMap = double*; WeightMap = boost::adj_list_edge_property_map, boost::edge_weight_t>; ColorMap = boost::param_not_found; IndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>; Params = boost::bgl_named_params >; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/dag_shortest_paths.hpp:134:29: required from ‘void boost::dag_shortest_paths(const VertexListGraph&, typename graph_traits::vertex_descriptor, const bgl_named_params&) [with VertexListGraph = R_adjacency_list; Param = double*; Tag = vertex_distance_t; Rest = bgl_named_params; typename graph_traits::vertex_descriptor = long unsigned int]’ shortestPath.cpp:144:27: required from here /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::DefaultConstructible::~DefaultConstructible() [with TT = boost::default_color_type]’ 37 | ~model() | ^ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:137:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 137 | BOOST_CONCEPT_USAGE(DefaultConstructible) { | ^~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::concepts::ColorValue]’: /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements >]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/graph_concepts.hpp:505:5: required from ‘struct boost::concepts::ColorValue’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/graph_concepts.hpp:502:1: required from ‘struct boost::concepts::ColorValueConcept’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::concepts::ColorValueConcept]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied >::value’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:45:51: [ skipping 3 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/depth_first_search.hpp:417:35: required from ‘void boost::depth_first_visit(const IncidenceGraph&, typename graph_traits::vertex_descriptor, DFSVisitor, ColorMap) [with IncidenceGraph = R_adjacency_list; DFSVisitor = topo_sort_visitor > >; ColorMap = iterator_property_map<__gnu_cxx::__normal_iterator >, vec_adj_list_vertex_id_map, long unsigned int>, default_color_type, default_color_type&>; typename graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/dag_shortest_paths.hpp:42:22: required from ‘void boost::dag_shortest_paths(const VertexListGraph&, typename graph_traits::vertex_descriptor, DistanceMap, WeightMap, ColorMap, PredecessorMap, DijkstraVisitor, Compare, Combine, DistInf, DistZero) [with VertexListGraph = R_adjacency_list; DijkstraVisitor = dijkstra_visitor<>; DistanceMap = double*; WeightMap = adj_list_edge_property_map, edge_weight_t>; ColorMap = iterator_property_map<__gnu_cxx::__normal_iterator >, vec_adj_list_vertex_id_map, long unsigned int>, default_color_type, default_color_type&>; PredecessorMap = long unsigned int*; Compare = std::less; Combine = closed_plus; DistInf = double; DistZero = double; typename graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/dag_shortest_paths.hpp:90:27: required from ‘void boost::detail::dag_sp_dispatch2(const VertexListGraph&, typename boost::graph_traits::vertex_descriptor, DistanceMap, WeightMap, ColorMap, IndexMap, DijkstraVisitor, const Params&) [with VertexListGraph = R_adjacency_list; DijkstraVisitor = boost::dijkstra_visitor<>; DistanceMap = double*; WeightMap = boost::adj_list_edge_property_map, boost::edge_weight_t>; ColorMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map, long unsigned int>, boost::default_color_type, boost::default_color_type&>; IndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>; Params = boost::bgl_named_params >; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/dag_shortest_paths.hpp:114:25: required from ‘void boost::detail::dag_sp_dispatch1(const VertexListGraph&, typename boost::graph_traits::vertex_descriptor, DistanceMap, WeightMap, ColorMap, IndexMap, DijkstraVisitor, const Params&) [with VertexListGraph = R_adjacency_list; DijkstraVisitor = boost::dijkstra_visitor<>; DistanceMap = double*; WeightMap = boost::adj_list_edge_property_map, boost::edge_weight_t>; ColorMap = boost::param_not_found; IndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>; Params = boost::bgl_named_params >; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/dag_shortest_paths.hpp:134:29: required from ‘void boost::dag_shortest_paths(const VertexListGraph&, typename graph_traits::vertex_descriptor, const bgl_named_params&) [with VertexListGraph = R_adjacency_list; Param = double*; Tag = vertex_distance_t; Rest = bgl_named_params; typename graph_traits::vertex_descriptor = long unsigned int]’ shortestPath.cpp:144:27: required from here /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::concepts::ColorValue::~ColorValue() [with C = boost::default_color_type]’ 37 | ~model() | ^ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/graph_concepts.hpp:505:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 505 | BOOST_CONCEPT_USAGE(ColorValue) | ^~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::DefaultConstructible]’: /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements >]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:137:5: required from ‘struct boost::DefaultConstructible’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::DefaultConstructible]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied >::value’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:72:8: [ skipping 9 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied > >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_ >)>’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/bellman_ford_shortest_paths.hpp:218:5: required from ‘bool boost::floyd_warshall_all_pairs_shortest_paths(const VertexAndEdgeListGraph&, DistanceMatrix&, const WeightMap&, const BinaryPredicate&, const BinaryFunction&, const Infinity&, const Zero&) [with VertexAndEdgeListGraph = R_adjacency_list; DistanceMatrix = Basic2DMatrix; WeightMap = adj_list_edge_property_map, edge_weight_t>; BinaryPredicate = std::less; BinaryFunction = closed_plus; Infinity = double; Zero = double]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/floyd_warshall_shortest.hpp:172:55: required from ‘bool boost::detail::floyd_warshall_noninit_dispatch(const VertexAndEdgeListGraph&, DistanceMatrix&, WeightMap, const boost::bgl_named_params&) [with VertexAndEdgeListGraph = R_adjacency_list; DistanceMatrix = Basic2DMatrix; WeightMap = boost::adj_list_edge_property_map, boost::edge_weight_t>; P = int; T = int; R = boost::no_property]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/floyd_warshall_shortest.hpp:217:51: required from ‘bool boost::floyd_warshall_all_pairs_shortest_paths(const VertexAndEdgeListGraph&, DistanceMatrix&) [with VertexAndEdgeListGraph = R_adjacency_list; DistanceMatrix = Basic2DMatrix]’ shortestPath.cpp:186:48: required from here /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::DefaultConstructible::~DefaultConstructible() [with TT = long unsigned int]’ 37 | ~model() | ^ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:137:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 137 | BOOST_CONCEPT_USAGE(DefaultConstructible) { | ^~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::EqualityComparable]’: /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements >]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:233:5: required from ‘struct boost::EqualityComparable’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::EqualityComparable]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied >::value’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:72:8: [ skipping 9 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied > >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_ >)>’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/bellman_ford_shortest_paths.hpp:218:5: required from ‘bool boost::floyd_warshall_all_pairs_shortest_paths(const VertexAndEdgeListGraph&, DistanceMatrix&, const WeightMap&, const BinaryPredicate&, const BinaryFunction&, const Infinity&, const Zero&) [with VertexAndEdgeListGraph = R_adjacency_list; DistanceMatrix = Basic2DMatrix; WeightMap = adj_list_edge_property_map, edge_weight_t>; BinaryPredicate = std::less; BinaryFunction = closed_plus; Infinity = double; Zero = double]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/floyd_warshall_shortest.hpp:172:55: required from ‘bool boost::detail::floyd_warshall_noninit_dispatch(const VertexAndEdgeListGraph&, DistanceMatrix&, WeightMap, const boost::bgl_named_params&) [with VertexAndEdgeListGraph = R_adjacency_list; DistanceMatrix = Basic2DMatrix; WeightMap = boost::adj_list_edge_property_map, boost::edge_weight_t>; P = int; T = int; R = boost::no_property]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/floyd_warshall_shortest.hpp:217:51: required from ‘bool boost::floyd_warshall_all_pairs_shortest_paths(const VertexAndEdgeListGraph&, DistanceMatrix&) [with VertexAndEdgeListGraph = R_adjacency_list; DistanceMatrix = Basic2DMatrix]’ shortestPath.cpp:186:48: required from here /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::EqualityComparable::~EqualityComparable() [with TT = long unsigned int]’ 37 | ~model() | ^ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:233:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 233 | BOOST_CONCEPT_USAGE(EqualityComparable) { | ^~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::Assignable]’: /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements >]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:145:5: required from ‘struct boost::Assignable’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::Assignable]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied >::value’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:72:8: [ skipping 9 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied > >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_ >)>’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/bellman_ford_shortest_paths.hpp:218:5: required from ‘bool boost::floyd_warshall_all_pairs_shortest_paths(const VertexAndEdgeListGraph&, DistanceMatrix&, const WeightMap&, const BinaryPredicate&, const BinaryFunction&, const Infinity&, const Zero&) [with VertexAndEdgeListGraph = R_adjacency_list; DistanceMatrix = Basic2DMatrix; WeightMap = adj_list_edge_property_map, edge_weight_t>; BinaryPredicate = std::less; BinaryFunction = closed_plus; Infinity = double; Zero = double]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/floyd_warshall_shortest.hpp:172:55: required from ‘bool boost::detail::floyd_warshall_noninit_dispatch(const VertexAndEdgeListGraph&, DistanceMatrix&, WeightMap, const boost::bgl_named_params&) [with VertexAndEdgeListGraph = R_adjacency_list; DistanceMatrix = Basic2DMatrix; WeightMap = boost::adj_list_edge_property_map, boost::edge_weight_t>; P = int; T = int; R = boost::no_property]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/floyd_warshall_shortest.hpp:217:51: required from ‘bool boost::floyd_warshall_all_pairs_shortest_paths(const VertexAndEdgeListGraph&, DistanceMatrix&) [with VertexAndEdgeListGraph = R_adjacency_list; DistanceMatrix = Basic2DMatrix]’ shortestPath.cpp:186:48: required from here /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::Assignable::~Assignable() [with TT = long unsigned int]’ 37 | ~model() | ^ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:145:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 145 | BOOST_CONCEPT_USAGE(Assignable) { | ^~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements > >]’: /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:145:5: required from ‘struct boost::Assignable >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:502:3: required from ‘struct boost::InputIterator >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::InputIterator >]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied > >::value’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied > >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:72:8: [ skipping 3 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/graph_concepts.hpp:184:9: required from ‘boost::concepts::VertexListGraph::~VertexListGraph() [with G = R_adjacency_list]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/graph_concepts.hpp:176:1: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::VertexListGraphConcept >]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/bellman_ford_shortest_paths.hpp:218:5: required from ‘bool boost::floyd_warshall_all_pairs_shortest_paths(const VertexAndEdgeListGraph&, DistanceMatrix&, const WeightMap&, const BinaryPredicate&, const BinaryFunction&, const Infinity&, const Zero&) [with VertexAndEdgeListGraph = R_adjacency_list; DistanceMatrix = Basic2DMatrix; WeightMap = adj_list_edge_property_map, edge_weight_t>; BinaryPredicate = std::less; BinaryFunction = closed_plus; Infinity = double; Zero = double]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/floyd_warshall_shortest.hpp:172:55: required from ‘bool boost::detail::floyd_warshall_noninit_dispatch(const VertexAndEdgeListGraph&, DistanceMatrix&, WeightMap, const boost::bgl_named_params&) [with VertexAndEdgeListGraph = R_adjacency_list; DistanceMatrix = Basic2DMatrix; WeightMap = boost::adj_list_edge_property_map, boost::edge_weight_t>; P = int; T = int; R = boost::no_property]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/floyd_warshall_shortest.hpp:217:51: required from ‘bool boost::floyd_warshall_all_pairs_shortest_paths(const VertexAndEdgeListGraph&, DistanceMatrix&) [with VertexAndEdgeListGraph = R_adjacency_list; DistanceMatrix = Basic2DMatrix]’ shortestPath.cpp:186:48: required from here /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::Assignable >]’ 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ^ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements > >]’: /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:233:5: required from ‘struct boost::EqualityComparable >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:502:3: required from ‘struct boost::InputIterator >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::InputIterator >]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied > >::value’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied > >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:72:8: [ skipping 3 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/graph_concepts.hpp:184:9: required from ‘boost::concepts::VertexListGraph::~VertexListGraph() [with G = R_adjacency_list]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/graph_concepts.hpp:176:1: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::VertexListGraphConcept >]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/bellman_ford_shortest_paths.hpp:218:5: required from ‘bool boost::floyd_warshall_all_pairs_shortest_paths(const VertexAndEdgeListGraph&, DistanceMatrix&, const WeightMap&, const BinaryPredicate&, const BinaryFunction&, const Infinity&, const Zero&) [with VertexAndEdgeListGraph = R_adjacency_list; DistanceMatrix = Basic2DMatrix; WeightMap = adj_list_edge_property_map, edge_weight_t>; BinaryPredicate = std::less; BinaryFunction = closed_plus; Infinity = double; Zero = double]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/floyd_warshall_shortest.hpp:172:55: required from ‘bool boost::detail::floyd_warshall_noninit_dispatch(const VertexAndEdgeListGraph&, DistanceMatrix&, WeightMap, const boost::bgl_named_params&) [with VertexAndEdgeListGraph = R_adjacency_list; DistanceMatrix = Basic2DMatrix; WeightMap = boost::adj_list_edge_property_map, boost::edge_weight_t>; P = int; T = int; R = boost::no_property]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/floyd_warshall_shortest.hpp:217:51: required from ‘bool boost::floyd_warshall_all_pairs_shortest_paths(const VertexAndEdgeListGraph&, DistanceMatrix&) [with VertexAndEdgeListGraph = R_adjacency_list; DistanceMatrix = Basic2DMatrix]’ shortestPath.cpp:186:48: required from here /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::EqualityComparable >]’ 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ^ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements > >]’: /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:512:7: required from ‘struct boost::InputIterator >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::InputIterator >]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied > >::value’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied > >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_ >)>’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/graph_concepts.hpp:53:35: [ skipping 2 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/graph_concepts.hpp:184:9: required from ‘boost::concepts::VertexListGraph::~VertexListGraph() [with G = R_adjacency_list]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/graph_concepts.hpp:176:1: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::VertexListGraphConcept >]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/bellman_ford_shortest_paths.hpp:218:5: required from ‘bool boost::floyd_warshall_all_pairs_shortest_paths(const VertexAndEdgeListGraph&, DistanceMatrix&, const WeightMap&, const BinaryPredicate&, const BinaryFunction&, const Infinity&, const Zero&) [with VertexAndEdgeListGraph = R_adjacency_list; DistanceMatrix = Basic2DMatrix; WeightMap = adj_list_edge_property_map, edge_weight_t>; BinaryPredicate = std::less; BinaryFunction = closed_plus; Infinity = double; Zero = double]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/floyd_warshall_shortest.hpp:172:55: required from ‘bool boost::detail::floyd_warshall_noninit_dispatch(const VertexAndEdgeListGraph&, DistanceMatrix&, WeightMap, const boost::bgl_named_params&) [with VertexAndEdgeListGraph = R_adjacency_list; DistanceMatrix = Basic2DMatrix; WeightMap = boost::adj_list_edge_property_map, boost::edge_weight_t>; P = int; T = int; R = boost::no_property]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/floyd_warshall_shortest.hpp:217:51: required from ‘bool boost::floyd_warshall_all_pairs_shortest_paths(const VertexAndEdgeListGraph&, DistanceMatrix&) [with VertexAndEdgeListGraph = R_adjacency_list; DistanceMatrix = Basic2DMatrix]’ shortestPath.cpp:186:48: required from here /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::InputIterator >]’ 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ^ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::InputIterator >]’: /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/graph_concepts.hpp:53:35: required from ‘boost::concepts::MultiPassInputIterator::~MultiPassInputIterator() [with T = boost::range_detail::integer_iterator]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::MultiPassInputIterator >]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/graph_concepts.hpp:184:9: required from ‘boost::concepts::VertexListGraph::~VertexListGraph() [with G = R_adjacency_list]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/graph_concepts.hpp:176:1: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::VertexListGraphConcept >]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/bellman_ford_shortest_paths.hpp:218:5: required from ‘bool boost::floyd_warshall_all_pairs_shortest_paths(const VertexAndEdgeListGraph&, DistanceMatrix&, const WeightMap&, const BinaryPredicate&, const BinaryFunction&, const Infinity&, const Zero&) [with VertexAndEdgeListGraph = R_adjacency_list; DistanceMatrix = Basic2DMatrix; WeightMap = adj_list_edge_property_map, edge_weight_t>; BinaryPredicate = std::less; BinaryFunction = closed_plus; Infinity = double; Zero = double]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/floyd_warshall_shortest.hpp:172:55: required from ‘bool boost::detail::floyd_warshall_noninit_dispatch(const VertexAndEdgeListGraph&, DistanceMatrix&, WeightMap, const boost::bgl_named_params&) [with VertexAndEdgeListGraph = R_adjacency_list; DistanceMatrix = Basic2DMatrix; WeightMap = boost::adj_list_edge_property_map, boost::edge_weight_t>; P = int; T = int; R = boost::no_property]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/floyd_warshall_shortest.hpp:217:51: required from ‘bool boost::floyd_warshall_all_pairs_shortest_paths(const VertexAndEdgeListGraph&, DistanceMatrix&) [with VertexAndEdgeListGraph = R_adjacency_list; DistanceMatrix = Basic2DMatrix]’ shortestPath.cpp:186:48: required from here /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::InputIterator::~InputIterator() [with TT = boost::range_detail::integer_iterator]’ 37 | ~model() | ^ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:512:7: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 512 | BOOST_CONCEPT_USAGE(InputIterator) | ^~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator >*, std::vector >, std::allocator > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::adjacency_list, boost::property, boost::no_property, boost::listS> > > >]’: /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:145:5: required from ‘struct boost::Assignable, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator >*, std::vector >, std::allocator > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::adjacency_list, boost::property, boost::no_property, boost::listS> > >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:502:3: required from ‘struct boost::InputIterator, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator >*, std::vector >, std::allocator > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::adjacency_list, boost::property, boost::no_property, boost::listS> > >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::InputIterator, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator >*, std::vector >, std::allocator > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::adjacency_list, boost::property, boost::no_property, boost::listS> > >]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator >*, std::vector >, std::allocator > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::adjacency_list, boost::property, boost::no_property, boost::listS> > > >::value’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator >*, std::vector >, std::allocator > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::adjacency_list, boost::property, boost::no_property, boost::listS> > > >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:72:8: [ skipping 3 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/graph_concepts.hpp:235:9: required from ‘boost::concepts::EdgeListGraph::~EdgeListGraph() [with G = R_adjacency_list]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/graph_concepts.hpp:226:1: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::EdgeListGraphConcept >]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/bellman_ford_shortest_paths.hpp:97:5: required from ‘bool boost::floyd_warshall_all_pairs_shortest_paths(const VertexAndEdgeListGraph&, DistanceMatrix&, const WeightMap&, const BinaryPredicate&, const BinaryFunction&, const Infinity&, const Zero&) [with VertexAndEdgeListGraph = R_adjacency_list; DistanceMatrix = Basic2DMatrix; WeightMap = adj_list_edge_property_map, edge_weight_t>; BinaryPredicate = std::less; BinaryFunction = closed_plus; Infinity = double; Zero = double]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/floyd_warshall_shortest.hpp:172:55: required from ‘bool boost::detail::floyd_warshall_noninit_dispatch(const VertexAndEdgeListGraph&, DistanceMatrix&, WeightMap, const boost::bgl_named_params&) [with VertexAndEdgeListGraph = R_adjacency_list; DistanceMatrix = Basic2DMatrix; WeightMap = boost::adj_list_edge_property_map, boost::edge_weight_t>; P = int; T = int; R = boost::no_property]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/floyd_warshall_shortest.hpp:217:51: required from ‘bool boost::floyd_warshall_all_pairs_shortest_paths(const VertexAndEdgeListGraph&, DistanceMatrix&) [with VertexAndEdgeListGraph = R_adjacency_list; DistanceMatrix = Basic2DMatrix]’ shortestPath.cpp:186:48: required from here /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::Assignable, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator >*, std::vector >, std::allocator > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::adjacency_list, boost::property, boost::no_property, boost::listS> > >]’ 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ^ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator >*, std::vector >, std::allocator > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::adjacency_list, boost::property, boost::no_property, boost::listS> > > >]’: /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:233:5: required from ‘struct boost::EqualityComparable, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator >*, std::vector >, std::allocator > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::adjacency_list, boost::property, boost::no_property, boost::listS> > >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:502:3: required from ‘struct boost::InputIterator, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator >*, std::vector >, std::allocator > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::adjacency_list, boost::property, boost::no_property, boost::listS> > >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::InputIterator, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator >*, std::vector >, std::allocator > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::adjacency_list, boost::property, boost::no_property, boost::listS> > >]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator >*, std::vector >, std::allocator > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::adjacency_list, boost::property, boost::no_property, boost::listS> > > >::value’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator >*, std::vector >, std::allocator > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::adjacency_list, boost::property, boost::no_property, boost::listS> > > >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:72:8: [ skipping 3 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/graph_concepts.hpp:235:9: required from ‘boost::concepts::EdgeListGraph::~EdgeListGraph() [with G = R_adjacency_list]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/graph_concepts.hpp:226:1: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::EdgeListGraphConcept >]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/bellman_ford_shortest_paths.hpp:97:5: required from ‘bool boost::floyd_warshall_all_pairs_shortest_paths(const VertexAndEdgeListGraph&, DistanceMatrix&, const WeightMap&, const BinaryPredicate&, const BinaryFunction&, const Infinity&, const Zero&) [with VertexAndEdgeListGraph = R_adjacency_list; DistanceMatrix = Basic2DMatrix; WeightMap = adj_list_edge_property_map, edge_weight_t>; BinaryPredicate = std::less; BinaryFunction = closed_plus; Infinity = double; Zero = double]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/floyd_warshall_shortest.hpp:172:55: required from ‘bool boost::detail::floyd_warshall_noninit_dispatch(const VertexAndEdgeListGraph&, DistanceMatrix&, WeightMap, const boost::bgl_named_params&) [with VertexAndEdgeListGraph = R_adjacency_list; DistanceMatrix = Basic2DMatrix; WeightMap = boost::adj_list_edge_property_map, boost::edge_weight_t>; P = int; T = int; R = boost::no_property]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/floyd_warshall_shortest.hpp:217:51: required from ‘bool boost::floyd_warshall_all_pairs_shortest_paths(const VertexAndEdgeListGraph&, DistanceMatrix&) [with VertexAndEdgeListGraph = R_adjacency_list; DistanceMatrix = Basic2DMatrix]’ shortestPath.cpp:186:48: required from here /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::EqualityComparable, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator >*, std::vector >, std::allocator > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::adjacency_list, boost::property, boost::no_property, boost::listS> > >]’ 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ^ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator >*, std::vector >, std::allocator > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::adjacency_list, boost::property, boost::no_property, boost::listS> > > >]’: /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:512:7: required from ‘struct boost::InputIterator, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator >*, std::vector >, std::allocator > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::adjacency_list, boost::property, boost::no_property, boost::listS> > >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::InputIterator, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator >*, std::vector >, std::allocator > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::adjacency_list, boost::property, boost::no_property, boost::listS> > >]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator >*, std::vector >, std::allocator > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::adjacency_list, boost::property, boost::no_property, boost::listS> > > >::value’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator >*, std::vector >, std::allocator > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::adjacency_list, boost::property, boost::no_property, boost::listS> > > >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator >*, std::vector >, std::allocator > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::adjacency_list, boost::property, boost::no_property, boost::listS> > >)>’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/graph_concepts.hpp:53:35: [ skipping 2 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/graph_concepts.hpp:235:9: required from ‘boost::concepts::EdgeListGraph::~EdgeListGraph() [with G = R_adjacency_list]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/graph_concepts.hpp:226:1: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::EdgeListGraphConcept >]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/bellman_ford_shortest_paths.hpp:97:5: required from ‘bool boost::floyd_warshall_all_pairs_shortest_paths(const VertexAndEdgeListGraph&, DistanceMatrix&, const WeightMap&, const BinaryPredicate&, const BinaryFunction&, const Infinity&, const Zero&) [with VertexAndEdgeListGraph = R_adjacency_list; DistanceMatrix = Basic2DMatrix; WeightMap = adj_list_edge_property_map, edge_weight_t>; BinaryPredicate = std::less; BinaryFunction = closed_plus; Infinity = double; Zero = double]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/floyd_warshall_shortest.hpp:172:55: required from ‘bool boost::detail::floyd_warshall_noninit_dispatch(const VertexAndEdgeListGraph&, DistanceMatrix&, WeightMap, const boost::bgl_named_params&) [with VertexAndEdgeListGraph = R_adjacency_list; DistanceMatrix = Basic2DMatrix; WeightMap = boost::adj_list_edge_property_map, boost::edge_weight_t>; P = int; T = int; R = boost::no_property]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/floyd_warshall_shortest.hpp:217:51: required from ‘bool boost::floyd_warshall_all_pairs_shortest_paths(const VertexAndEdgeListGraph&, DistanceMatrix&) [with VertexAndEdgeListGraph = R_adjacency_list; DistanceMatrix = Basic2DMatrix]’ shortestPath.cpp:186:48: required from here /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::InputIterator, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator >*, std::vector >, std::allocator > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::adjacency_list, boost::property, boost::no_property, boost::listS> > >]’ 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ^ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::InputIterator, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator >*, std::vector >, std::allocator > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::adjacency_list, boost::property, boost::no_property, boost::listS> > >]’: /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/graph_concepts.hpp:53:35: required from ‘boost::concepts::MultiPassInputIterator::~MultiPassInputIterator() [with T = boost::detail::adj_list_edge_iterator, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator >*, std::vector >, std::allocator > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::adjacency_list, boost::property, boost::no_property, boost::listS> >]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::MultiPassInputIterator, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator >*, std::vector >, std::allocator > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::adjacency_list, boost::property, boost::no_property, boost::listS> > >]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/graph_concepts.hpp:235:9: required from ‘boost::concepts::EdgeListGraph::~EdgeListGraph() [with G = R_adjacency_list]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/graph_concepts.hpp:226:1: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::EdgeListGraphConcept >]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/bellman_ford_shortest_paths.hpp:97:5: required from ‘bool boost::floyd_warshall_all_pairs_shortest_paths(const VertexAndEdgeListGraph&, DistanceMatrix&, const WeightMap&, const BinaryPredicate&, const BinaryFunction&, const Infinity&, const Zero&) [with VertexAndEdgeListGraph = R_adjacency_list; DistanceMatrix = Basic2DMatrix; WeightMap = adj_list_edge_property_map, edge_weight_t>; BinaryPredicate = std::less; BinaryFunction = closed_plus; Infinity = double; Zero = double]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/floyd_warshall_shortest.hpp:172:55: required from ‘bool boost::detail::floyd_warshall_noninit_dispatch(const VertexAndEdgeListGraph&, DistanceMatrix&, WeightMap, const boost::bgl_named_params&) [with VertexAndEdgeListGraph = R_adjacency_list; DistanceMatrix = Basic2DMatrix; WeightMap = boost::adj_list_edge_property_map, boost::edge_weight_t>; P = int; T = int; R = boost::no_property]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/floyd_warshall_shortest.hpp:217:51: required from ‘bool boost::floyd_warshall_all_pairs_shortest_paths(const VertexAndEdgeListGraph&, DistanceMatrix&) [with VertexAndEdgeListGraph = R_adjacency_list; DistanceMatrix = Basic2DMatrix]’ shortestPath.cpp:186:48: required from here /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::InputIterator::~InputIterator() [with TT = boost::detail::adj_list_edge_iterator, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator >*, std::vector >, std::allocator > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::adjacency_list, boost::property, boost::no_property, boost::listS> >]’ 37 | ~model() | ^ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:512:7: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 512 | BOOST_CONCEPT_USAGE(InputIterator) | ^~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements >*, std::vector >, std::allocator > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >]’: /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:145:5: required from ‘struct boost::Assignable >*, std::vector >, std::allocator > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:502:3: required from ‘struct boost::InputIterator >*, std::vector >, std::allocator > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::InputIterator >*, std::vector >, std::allocator > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> >]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied >*, std::vector >, std::allocator > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::value’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied >*, std::vector >, std::allocator > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:72:8: [ skipping 3 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/graph_concepts.hpp:89:9: required from ‘boost::concepts::IncidenceGraph::~IncidenceGraph() [with G = R_adjacency_list]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/graph_concepts.hpp:75:1: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::IncidenceGraphConcept >]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/breadth_first_search.hpp:62:5: required from ‘bool boost::floyd_warshall_all_pairs_shortest_paths(const VertexAndEdgeListGraph&, DistanceMatrix&, const WeightMap&, const BinaryPredicate&, const BinaryFunction&, const Infinity&, const Zero&) [with VertexAndEdgeListGraph = R_adjacency_list; DistanceMatrix = Basic2DMatrix; WeightMap = adj_list_edge_property_map, edge_weight_t>; BinaryPredicate = std::less; BinaryFunction = closed_plus; Infinity = double; Zero = double]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/floyd_warshall_shortest.hpp:172:55: required from ‘bool boost::detail::floyd_warshall_noninit_dispatch(const VertexAndEdgeListGraph&, DistanceMatrix&, WeightMap, const boost::bgl_named_params&) [with VertexAndEdgeListGraph = R_adjacency_list; DistanceMatrix = Basic2DMatrix; WeightMap = boost::adj_list_edge_property_map, boost::edge_weight_t>; P = int; T = int; R = boost::no_property]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/floyd_warshall_shortest.hpp:217:51: required from ‘bool boost::floyd_warshall_all_pairs_shortest_paths(const VertexAndEdgeListGraph&, DistanceMatrix&) [with VertexAndEdgeListGraph = R_adjacency_list; DistanceMatrix = Basic2DMatrix]’ shortestPath.cpp:186:48: required from here /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::Assignable >*, std::vector >, std::allocator > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> >]’ 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ^ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements >*, std::vector >, std::allocator > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >]’: /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:233:5: required from ‘struct boost::EqualityComparable >*, std::vector >, std::allocator > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:502:3: required from ‘struct boost::InputIterator >*, std::vector >, std::allocator > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::InputIterator >*, std::vector >, std::allocator > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> >]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied >*, std::vector >, std::allocator > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::value’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied >*, std::vector >, std::allocator > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:72:8: [ skipping 3 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/graph_concepts.hpp:89:9: required from ‘boost::concepts::IncidenceGraph::~IncidenceGraph() [with G = R_adjacency_list]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/graph_concepts.hpp:75:1: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::IncidenceGraphConcept >]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/breadth_first_search.hpp:62:5: required from ‘bool boost::floyd_warshall_all_pairs_shortest_paths(const VertexAndEdgeListGraph&, DistanceMatrix&, const WeightMap&, const BinaryPredicate&, const BinaryFunction&, const Infinity&, const Zero&) [with VertexAndEdgeListGraph = R_adjacency_list; DistanceMatrix = Basic2DMatrix; WeightMap = adj_list_edge_property_map, edge_weight_t>; BinaryPredicate = std::less; BinaryFunction = closed_plus; Infinity = double; Zero = double]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/floyd_warshall_shortest.hpp:172:55: required from ‘bool boost::detail::floyd_warshall_noninit_dispatch(const VertexAndEdgeListGraph&, DistanceMatrix&, WeightMap, const boost::bgl_named_params&) [with VertexAndEdgeListGraph = R_adjacency_list; DistanceMatrix = Basic2DMatrix; WeightMap = boost::adj_list_edge_property_map, boost::edge_weight_t>; P = int; T = int; R = boost::no_property]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/floyd_warshall_shortest.hpp:217:51: required from ‘bool boost::floyd_warshall_all_pairs_shortest_paths(const VertexAndEdgeListGraph&, DistanceMatrix&) [with VertexAndEdgeListGraph = R_adjacency_list; DistanceMatrix = Basic2DMatrix]’ shortestPath.cpp:186:48: required from here /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::EqualityComparable >*, std::vector >, std::allocator > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> >]’ 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ^ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements >*, std::vector >, std::allocator > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >]’: /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:512:7: required from ‘struct boost::InputIterator >*, std::vector >, std::allocator > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::InputIterator >*, std::vector >, std::allocator > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> >]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied >*, std::vector >, std::allocator > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::value’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied >*, std::vector >, std::allocator > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_ >*, std::vector >, std::allocator > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> >)>’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/graph_concepts.hpp:53:35: [ skipping 2 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/graph_concepts.hpp:89:9: required from ‘boost::concepts::IncidenceGraph::~IncidenceGraph() [with G = R_adjacency_list]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/graph_concepts.hpp:75:1: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::IncidenceGraphConcept >]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/breadth_first_search.hpp:62:5: required from ‘bool boost::floyd_warshall_all_pairs_shortest_paths(const VertexAndEdgeListGraph&, DistanceMatrix&, const WeightMap&, const BinaryPredicate&, const BinaryFunction&, const Infinity&, const Zero&) [with VertexAndEdgeListGraph = R_adjacency_list; DistanceMatrix = Basic2DMatrix; WeightMap = adj_list_edge_property_map, edge_weight_t>; BinaryPredicate = std::less; BinaryFunction = closed_plus; Infinity = double; Zero = double]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/floyd_warshall_shortest.hpp:172:55: required from ‘bool boost::detail::floyd_warshall_noninit_dispatch(const VertexAndEdgeListGraph&, DistanceMatrix&, WeightMap, const boost::bgl_named_params&) [with VertexAndEdgeListGraph = R_adjacency_list; DistanceMatrix = Basic2DMatrix; WeightMap = boost::adj_list_edge_property_map, boost::edge_weight_t>; P = int; T = int; R = boost::no_property]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/floyd_warshall_shortest.hpp:217:51: required from ‘bool boost::floyd_warshall_all_pairs_shortest_paths(const VertexAndEdgeListGraph&, DistanceMatrix&) [with VertexAndEdgeListGraph = R_adjacency_list; DistanceMatrix = Basic2DMatrix]’ shortestPath.cpp:186:48: required from here /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::InputIterator >*, std::vector >, std::allocator > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> >]’ 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ^ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::InputIterator >*, std::vector >, std::allocator > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> >]’: /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/graph_concepts.hpp:53:35: required from ‘boost::concepts::MultiPassInputIterator::~MultiPassInputIterator() [with T = boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator >*, std::vector >, std::allocator > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::MultiPassInputIterator >*, std::vector >, std::allocator > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> >]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/graph_concepts.hpp:89:9: required from ‘boost::concepts::IncidenceGraph::~IncidenceGraph() [with G = R_adjacency_list]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/graph_concepts.hpp:75:1: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::IncidenceGraphConcept >]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/breadth_first_search.hpp:62:5: required from ‘bool boost::floyd_warshall_all_pairs_shortest_paths(const VertexAndEdgeListGraph&, DistanceMatrix&, const WeightMap&, const BinaryPredicate&, const BinaryFunction&, const Infinity&, const Zero&) [with VertexAndEdgeListGraph = R_adjacency_list; DistanceMatrix = Basic2DMatrix; WeightMap = adj_list_edge_property_map, edge_weight_t>; BinaryPredicate = std::less; BinaryFunction = closed_plus; Infinity = double; Zero = double]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/floyd_warshall_shortest.hpp:172:55: required from ‘bool boost::detail::floyd_warshall_noninit_dispatch(const VertexAndEdgeListGraph&, DistanceMatrix&, WeightMap, const boost::bgl_named_params&) [with VertexAndEdgeListGraph = R_adjacency_list; DistanceMatrix = Basic2DMatrix; WeightMap = boost::adj_list_edge_property_map, boost::edge_weight_t>; P = int; T = int; R = boost::no_property]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/floyd_warshall_shortest.hpp:217:51: required from ‘bool boost::floyd_warshall_all_pairs_shortest_paths(const VertexAndEdgeListGraph&, DistanceMatrix&) [with VertexAndEdgeListGraph = R_adjacency_list; DistanceMatrix = Basic2DMatrix]’ shortestPath.cpp:186:48: required from here /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::InputIterator::~InputIterator() [with TT = boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator >*, std::vector >, std::allocator > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>]’ 37 | ~model() | ^ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:512:7: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 512 | BOOST_CONCEPT_USAGE(InputIterator) | ^~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::adjacency_list, boost::property >, boost::no_property, boost::listS> > > >]’: /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:145:5: required from ‘struct boost::Assignable, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::adjacency_list, boost::property >, boost::no_property, boost::listS> > >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:502:3: required from ‘struct boost::InputIterator, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::adjacency_list, boost::property >, boost::no_property, boost::listS> > >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::InputIterator, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::adjacency_list, boost::property >, boost::no_property, boost::listS> > >]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::adjacency_list, boost::property >, boost::no_property, boost::listS> > > >::value’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::adjacency_list, boost::property >, boost::no_property, boost::listS> > > >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:72:8: [ skipping 4 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/graph_concepts.hpp:226:1: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::EdgeListGraphConcept, boost::property >, boost::no_property, boost::listS> >]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/bellman_ford_shortest_paths.hpp:97:5: required from ‘bool boost::bellman_ford_shortest_paths(EdgeListGraph&, Size, WeightMap, PredecessorMap, DistanceMap, BinaryFunction, BinaryPredicate, BellmanFordVisitor) [with EdgeListGraph = adjacency_list, property >, no_property, listS>; Size = long unsigned int; WeightMap = adj_list_edge_property_map >, edge_weight_t>; PredecessorMap = dummy_property_map; DistanceMap = vec_adj_list_vertex_property_map, property >, no_property, listS>, adjacency_list, property >, no_property, listS>*, double, double&, vertex_distance_t>; BinaryFunction = closed_plus; BinaryPredicate = std::less; BellmanFordVisitor = bellman_visitor<>]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/johnson_all_pairs_shortest.hpp:112:36: required from ‘bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, VertexID, Weight, const BinaryPredicate&, const BinaryFunction&, const Infinity&, DistanceZero) [with VertexAndEdgeListGraph = R_adjacency_list; DistanceMatrix = Basic2DMatrix; VertexID = vec_adj_list_vertex_id_map, long unsigned int>; Weight = adj_list_edge_property_map, edge_weight_t>; BinaryPredicate = std::less; BinaryFunction = closed_plus; Infinity = double; DistanceZero = double]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/johnson_all_pairs_shortest.hpp:164:48: required from ‘bool boost::detail::johnson_dispatch(VertexAndEdgeListGraph&, DistanceMatrix&, const boost::bgl_named_params&, Weight, VertexID) [with VertexAndEdgeListGraph = R_adjacency_list; DistanceMatrix = Basic2DMatrix; P = int; T = int; R = boost::no_property; Weight = boost::adj_list_edge_property_map, boost::edge_weight_t>; VertexID = boost::vec_adj_list_vertex_id_map, long unsigned int>]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/johnson_all_pairs_shortest.hpp:192:36: required from ‘bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&) [with VertexAndEdgeListGraph = R_adjacency_list; DistanceMatrix = Basic2DMatrix]’ shortestPath.cpp:56:41: required from here /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::Assignable, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::adjacency_list, boost::property >, boost::no_property, boost::listS> > >]’ 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ^ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::adjacency_list, boost::property >, boost::no_property, boost::listS> > > >]’: /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:233:5: required from ‘struct boost::EqualityComparable, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::adjacency_list, boost::property >, boost::no_property, boost::listS> > >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:502:3: required from ‘struct boost::InputIterator, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::adjacency_list, boost::property >, boost::no_property, boost::listS> > >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::InputIterator, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::adjacency_list, boost::property >, boost::no_property, boost::listS> > >]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::adjacency_list, boost::property >, boost::no_property, boost::listS> > > >::value’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::adjacency_list, boost::property >, boost::no_property, boost::listS> > > >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:72:8: [ skipping 4 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/graph_concepts.hpp:226:1: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::EdgeListGraphConcept, boost::property >, boost::no_property, boost::listS> >]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/bellman_ford_shortest_paths.hpp:97:5: required from ‘bool boost::bellman_ford_shortest_paths(EdgeListGraph&, Size, WeightMap, PredecessorMap, DistanceMap, BinaryFunction, BinaryPredicate, BellmanFordVisitor) [with EdgeListGraph = adjacency_list, property >, no_property, listS>; Size = long unsigned int; WeightMap = adj_list_edge_property_map >, edge_weight_t>; PredecessorMap = dummy_property_map; DistanceMap = vec_adj_list_vertex_property_map, property >, no_property, listS>, adjacency_list, property >, no_property, listS>*, double, double&, vertex_distance_t>; BinaryFunction = closed_plus; BinaryPredicate = std::less; BellmanFordVisitor = bellman_visitor<>]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/johnson_all_pairs_shortest.hpp:112:36: required from ‘bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, VertexID, Weight, const BinaryPredicate&, const BinaryFunction&, const Infinity&, DistanceZero) [with VertexAndEdgeListGraph = R_adjacency_list; DistanceMatrix = Basic2DMatrix; VertexID = vec_adj_list_vertex_id_map, long unsigned int>; Weight = adj_list_edge_property_map, edge_weight_t>; BinaryPredicate = std::less; BinaryFunction = closed_plus; Infinity = double; DistanceZero = double]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/johnson_all_pairs_shortest.hpp:164:48: required from ‘bool boost::detail::johnson_dispatch(VertexAndEdgeListGraph&, DistanceMatrix&, const boost::bgl_named_params&, Weight, VertexID) [with VertexAndEdgeListGraph = R_adjacency_list; DistanceMatrix = Basic2DMatrix; P = int; T = int; R = boost::no_property; Weight = boost::adj_list_edge_property_map, boost::edge_weight_t>; VertexID = boost::vec_adj_list_vertex_id_map, long unsigned int>]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/johnson_all_pairs_shortest.hpp:192:36: required from ‘bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&) [with VertexAndEdgeListGraph = R_adjacency_list; DistanceMatrix = Basic2DMatrix]’ shortestPath.cpp:56:41: required from here /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::EqualityComparable, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::adjacency_list, boost::property >, boost::no_property, boost::listS> > >]’ 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ^ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::adjacency_list, boost::property >, boost::no_property, boost::listS> > > >]’: /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:512:7: required from ‘struct boost::InputIterator, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::adjacency_list, boost::property >, boost::no_property, boost::listS> > >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::InputIterator, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::adjacency_list, boost::property >, boost::no_property, boost::listS> > >]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::adjacency_list, boost::property >, boost::no_property, boost::listS> > > >::value’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::adjacency_list, boost::property >, boost::no_property, boost::listS> > > >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::adjacency_list, boost::property >, boost::no_property, boost::listS> > >)>’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/graph_concepts.hpp:53:35: [ skipping 3 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/graph_concepts.hpp:226:1: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::EdgeListGraphConcept, boost::property >, boost::no_property, boost::listS> >]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/bellman_ford_shortest_paths.hpp:97:5: required from ‘bool boost::bellman_ford_shortest_paths(EdgeListGraph&, Size, WeightMap, PredecessorMap, DistanceMap, BinaryFunction, BinaryPredicate, BellmanFordVisitor) [with EdgeListGraph = adjacency_list, property >, no_property, listS>; Size = long unsigned int; WeightMap = adj_list_edge_property_map >, edge_weight_t>; PredecessorMap = dummy_property_map; DistanceMap = vec_adj_list_vertex_property_map, property >, no_property, listS>, adjacency_list, property >, no_property, listS>*, double, double&, vertex_distance_t>; BinaryFunction = closed_plus; BinaryPredicate = std::less; BellmanFordVisitor = bellman_visitor<>]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/johnson_all_pairs_shortest.hpp:112:36: required from ‘bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, VertexID, Weight, const BinaryPredicate&, const BinaryFunction&, const Infinity&, DistanceZero) [with VertexAndEdgeListGraph = R_adjacency_list; DistanceMatrix = Basic2DMatrix; VertexID = vec_adj_list_vertex_id_map, long unsigned int>; Weight = adj_list_edge_property_map, edge_weight_t>; BinaryPredicate = std::less; BinaryFunction = closed_plus; Infinity = double; DistanceZero = double]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/johnson_all_pairs_shortest.hpp:164:48: required from ‘bool boost::detail::johnson_dispatch(VertexAndEdgeListGraph&, DistanceMatrix&, const boost::bgl_named_params&, Weight, VertexID) [with VertexAndEdgeListGraph = R_adjacency_list; DistanceMatrix = Basic2DMatrix; P = int; T = int; R = boost::no_property; Weight = boost::adj_list_edge_property_map, boost::edge_weight_t>; VertexID = boost::vec_adj_list_vertex_id_map, long unsigned int>]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/johnson_all_pairs_shortest.hpp:192:36: required from ‘bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&) [with VertexAndEdgeListGraph = R_adjacency_list; DistanceMatrix = Basic2DMatrix]’ shortestPath.cpp:56:41: required from here /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::InputIterator, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::adjacency_list, boost::property >, boost::no_property, boost::listS> > >]’ 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ^ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::InputIterator, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::adjacency_list, boost::property >, boost::no_property, boost::listS> > >]’: /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/graph_concepts.hpp:53:35: required from ‘boost::concepts::MultiPassInputIterator::~MultiPassInputIterator() [with T = boost::detail::adj_list_edge_iterator, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::adjacency_list, boost::property >, boost::no_property, boost::listS> >]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::MultiPassInputIterator, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::adjacency_list, boost::property >, boost::no_property, boost::listS> > >]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/graph_concepts.hpp:235:9: required from ‘boost::concepts::EdgeListGraph::~EdgeListGraph() [with G = boost::adjacency_list, boost::property >, boost::no_property, boost::listS>]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/graph_concepts.hpp:226:1: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::EdgeListGraphConcept, boost::property >, boost::no_property, boost::listS> >]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/bellman_ford_shortest_paths.hpp:97:5: required from ‘bool boost::bellman_ford_shortest_paths(EdgeListGraph&, Size, WeightMap, PredecessorMap, DistanceMap, BinaryFunction, BinaryPredicate, BellmanFordVisitor) [with EdgeListGraph = adjacency_list, property >, no_property, listS>; Size = long unsigned int; WeightMap = adj_list_edge_property_map >, edge_weight_t>; PredecessorMap = dummy_property_map; DistanceMap = vec_adj_list_vertex_property_map, property >, no_property, listS>, adjacency_list, property >, no_property, listS>*, double, double&, vertex_distance_t>; BinaryFunction = closed_plus; BinaryPredicate = std::less; BellmanFordVisitor = bellman_visitor<>]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/johnson_all_pairs_shortest.hpp:112:36: required from ‘bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, VertexID, Weight, const BinaryPredicate&, const BinaryFunction&, const Infinity&, DistanceZero) [with VertexAndEdgeListGraph = R_adjacency_list; DistanceMatrix = Basic2DMatrix; VertexID = vec_adj_list_vertex_id_map, long unsigned int>; Weight = adj_list_edge_property_map, edge_weight_t>; BinaryPredicate = std::less; BinaryFunction = closed_plus; Infinity = double; DistanceZero = double]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/johnson_all_pairs_shortest.hpp:164:48: required from ‘bool boost::detail::johnson_dispatch(VertexAndEdgeListGraph&, DistanceMatrix&, const boost::bgl_named_params&, Weight, VertexID) [with VertexAndEdgeListGraph = R_adjacency_list; DistanceMatrix = Basic2DMatrix; P = int; T = int; R = boost::no_property; Weight = boost::adj_list_edge_property_map, boost::edge_weight_t>; VertexID = boost::vec_adj_list_vertex_id_map, long unsigned int>]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/johnson_all_pairs_shortest.hpp:192:36: required from ‘bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&) [with VertexAndEdgeListGraph = R_adjacency_list; DistanceMatrix = Basic2DMatrix]’ shortestPath.cpp:56:41: required from here /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::InputIterator::~InputIterator() [with TT = boost::detail::adj_list_edge_iterator, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::adjacency_list, boost::property >, boost::no_property, boost::listS> >]’ 37 | ~model() | ^ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:512:7: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 512 | BOOST_CONCEPT_USAGE(InputIterator) | ^~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator >*, std::vector >, std::allocator > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::adjacency_list > > > >]’: /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:145:5: required from ‘struct boost::Assignable, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator >*, std::vector >, std::allocator > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::adjacency_list > > >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:502:3: required from ‘struct boost::InputIterator, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator >*, std::vector >, std::allocator > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::adjacency_list > > >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::InputIterator, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator >*, std::vector >, std::allocator > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::adjacency_list > > >]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator >*, std::vector >, std::allocator > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::adjacency_list > > > >::value’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator >*, std::vector >, std::allocator > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::adjacency_list > > > >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:72:8: [ skipping 4 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/graph_concepts.hpp:226:1: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::EdgeListGraphConcept > >]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/bellman_ford_shortest_paths.hpp:97:5: required from ‘bool boost::bellman_ford_shortest_paths(EdgeListGraph&, Size, WeightMap, PredecessorMap, DistanceMap, BinaryFunction, BinaryPredicate, BellmanFordVisitor) [with EdgeListGraph = adjacency_list >; Size = int; WeightMap = adj_list_edge_property_map, edge_weight_t>; PredecessorMap = long unsigned int*; DistanceMap = double*; BinaryFunction = closed_plus; BinaryPredicate = std::less; BellmanFordVisitor = bellman_visitor<>]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/bellman_ford_shortest_paths.hpp:176:43: required from ‘bool boost::detail::bellman_dispatch2(VertexAndEdgeListGraph&, boost::param_not_found, Size, WeightMap, PredecessorMap, DistanceMap, const boost::bgl_named_params&) [with VertexAndEdgeListGraph = boost::adjacency_list >; Size = int; WeightMap = boost::adj_list_edge_property_map, boost::edge_weight_t>; PredecessorMap = long unsigned int*; DistanceMap = double*; P = double*; T = boost::vertex_distance_t; R = boost::bgl_named_params, boost::edge_weight_t>, boost::edge_weight_t, boost::no_property> >]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/bellman_ford_shortest_paths.hpp:190:41: required from ‘bool boost::detail::bellman_dispatch(EdgeListGraph&, Size, WeightMap, DistanceMap, const boost::bgl_named_params&) [with EdgeListGraph = boost::adjacency_list >; Size = int; WeightMap = boost::adj_list_edge_property_map, boost::edge_weight_t>; DistanceMap = double*; P = double*; T = boost::vertex_distance_t; R = boost::bgl_named_params, boost::edge_weight_t>, boost::edge_weight_t, boost::no_property> >]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/bellman_ford_shortest_paths.hpp:201:36: required from ‘bool boost::bellman_ford_shortest_paths(EdgeListGraph&, Size, const bgl_named_params&) [with EdgeListGraph = adjacency_list >; Size = int; P = double*; T = vertex_distance_t; R = bgl_named_params, edge_weight_t>, edge_weight_t, no_property> >]’ shortestPath.cpp:105:45: required from here /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::Assignable, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator >*, std::vector >, std::allocator > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::adjacency_list > > >]’ 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ^ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator >*, std::vector >, std::allocator > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::adjacency_list > > > >]’: /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:233:5: required from ‘struct boost::EqualityComparable, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator >*, std::vector >, std::allocator > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::adjacency_list > > >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:502:3: required from ‘struct boost::InputIterator, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator >*, std::vector >, std::allocator > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::adjacency_list > > >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::InputIterator, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator >*, std::vector >, std::allocator > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::adjacency_list > > >]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator >*, std::vector >, std::allocator > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::adjacency_list > > > >::value’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator >*, std::vector >, std::allocator > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::adjacency_list > > > >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:72:8: [ skipping 4 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/graph_concepts.hpp:226:1: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::EdgeListGraphConcept > >]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/bellman_ford_shortest_paths.hpp:97:5: required from ‘bool boost::bellman_ford_shortest_paths(EdgeListGraph&, Size, WeightMap, PredecessorMap, DistanceMap, BinaryFunction, BinaryPredicate, BellmanFordVisitor) [with EdgeListGraph = adjacency_list >; Size = int; WeightMap = adj_list_edge_property_map, edge_weight_t>; PredecessorMap = long unsigned int*; DistanceMap = double*; BinaryFunction = closed_plus; BinaryPredicate = std::less; BellmanFordVisitor = bellman_visitor<>]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/bellman_ford_shortest_paths.hpp:176:43: required from ‘bool boost::detail::bellman_dispatch2(VertexAndEdgeListGraph&, boost::param_not_found, Size, WeightMap, PredecessorMap, DistanceMap, const boost::bgl_named_params&) [with VertexAndEdgeListGraph = boost::adjacency_list >; Size = int; WeightMap = boost::adj_list_edge_property_map, boost::edge_weight_t>; PredecessorMap = long unsigned int*; DistanceMap = double*; P = double*; T = boost::vertex_distance_t; R = boost::bgl_named_params, boost::edge_weight_t>, boost::edge_weight_t, boost::no_property> >]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/bellman_ford_shortest_paths.hpp:190:41: required from ‘bool boost::detail::bellman_dispatch(EdgeListGraph&, Size, WeightMap, DistanceMap, const boost::bgl_named_params&) [with EdgeListGraph = boost::adjacency_list >; Size = int; WeightMap = boost::adj_list_edge_property_map, boost::edge_weight_t>; DistanceMap = double*; P = double*; T = boost::vertex_distance_t; R = boost::bgl_named_params, boost::edge_weight_t>, boost::edge_weight_t, boost::no_property> >]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/bellman_ford_shortest_paths.hpp:201:36: required from ‘bool boost::bellman_ford_shortest_paths(EdgeListGraph&, Size, const bgl_named_params&) [with EdgeListGraph = adjacency_list >; Size = int; P = double*; T = vertex_distance_t; R = bgl_named_params, edge_weight_t>, edge_weight_t, no_property> >]’ shortestPath.cpp:105:45: required from here /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::EqualityComparable, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator >*, std::vector >, std::allocator > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::adjacency_list > > >]’ 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ^ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator >*, std::vector >, std::allocator > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::adjacency_list > > > >]’: /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:512:7: required from ‘struct boost::InputIterator, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator >*, std::vector >, std::allocator > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::adjacency_list > > >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::InputIterator, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator >*, std::vector >, std::allocator > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::adjacency_list > > >]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator >*, std::vector >, std::allocator > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::adjacency_list > > > >::value’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator >*, std::vector >, std::allocator > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::adjacency_list > > > >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator >*, std::vector >, std::allocator > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::adjacency_list > > >)>’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/graph_concepts.hpp:53:35: [ skipping 3 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/graph_concepts.hpp:226:1: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::EdgeListGraphConcept > >]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/bellman_ford_shortest_paths.hpp:97:5: required from ‘bool boost::bellman_ford_shortest_paths(EdgeListGraph&, Size, WeightMap, PredecessorMap, DistanceMap, BinaryFunction, BinaryPredicate, BellmanFordVisitor) [with EdgeListGraph = adjacency_list >; Size = int; WeightMap = adj_list_edge_property_map, edge_weight_t>; PredecessorMap = long unsigned int*; DistanceMap = double*; BinaryFunction = closed_plus; BinaryPredicate = std::less; BellmanFordVisitor = bellman_visitor<>]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/bellman_ford_shortest_paths.hpp:176:43: required from ‘bool boost::detail::bellman_dispatch2(VertexAndEdgeListGraph&, boost::param_not_found, Size, WeightMap, PredecessorMap, DistanceMap, const boost::bgl_named_params&) [with VertexAndEdgeListGraph = boost::adjacency_list >; Size = int; WeightMap = boost::adj_list_edge_property_map, boost::edge_weight_t>; PredecessorMap = long unsigned int*; DistanceMap = double*; P = double*; T = boost::vertex_distance_t; R = boost::bgl_named_params, boost::edge_weight_t>, boost::edge_weight_t, boost::no_property> >]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/bellman_ford_shortest_paths.hpp:190:41: required from ‘bool boost::detail::bellman_dispatch(EdgeListGraph&, Size, WeightMap, DistanceMap, const boost::bgl_named_params&) [with EdgeListGraph = boost::adjacency_list >; Size = int; WeightMap = boost::adj_list_edge_property_map, boost::edge_weight_t>; DistanceMap = double*; P = double*; T = boost::vertex_distance_t; R = boost::bgl_named_params, boost::edge_weight_t>, boost::edge_weight_t, boost::no_property> >]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/bellman_ford_shortest_paths.hpp:201:36: required from ‘bool boost::bellman_ford_shortest_paths(EdgeListGraph&, Size, const bgl_named_params&) [with EdgeListGraph = adjacency_list >; Size = int; P = double*; T = vertex_distance_t; R = bgl_named_params, edge_weight_t>, edge_weight_t, no_property> >]’ shortestPath.cpp:105:45: required from here /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::InputIterator, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator >*, std::vector >, std::allocator > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::adjacency_list > > >]’ 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ^ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::InputIterator, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator >*, std::vector >, std::allocator > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::adjacency_list > > >]’: /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/graph_concepts.hpp:53:35: required from ‘boost::concepts::MultiPassInputIterator::~MultiPassInputIterator() [with T = boost::detail::adj_list_edge_iterator, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator >*, std::vector >, std::allocator > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::adjacency_list > >]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::MultiPassInputIterator, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator >*, std::vector >, std::allocator > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::adjacency_list > > >]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/graph_concepts.hpp:235:9: required from ‘boost::concepts::EdgeListGraph::~EdgeListGraph() [with G = boost::adjacency_list >]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/graph_concepts.hpp:226:1: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::EdgeListGraphConcept > >]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/bellman_ford_shortest_paths.hpp:97:5: required from ‘bool boost::bellman_ford_shortest_paths(EdgeListGraph&, Size, WeightMap, PredecessorMap, DistanceMap, BinaryFunction, BinaryPredicate, BellmanFordVisitor) [with EdgeListGraph = adjacency_list >; Size = int; WeightMap = adj_list_edge_property_map, edge_weight_t>; PredecessorMap = long unsigned int*; DistanceMap = double*; BinaryFunction = closed_plus; BinaryPredicate = std::less; BellmanFordVisitor = bellman_visitor<>]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/bellman_ford_shortest_paths.hpp:176:43: required from ‘bool boost::detail::bellman_dispatch2(VertexAndEdgeListGraph&, boost::param_not_found, Size, WeightMap, PredecessorMap, DistanceMap, const boost::bgl_named_params&) [with VertexAndEdgeListGraph = boost::adjacency_list >; Size = int; WeightMap = boost::adj_list_edge_property_map, boost::edge_weight_t>; PredecessorMap = long unsigned int*; DistanceMap = double*; P = double*; T = boost::vertex_distance_t; R = boost::bgl_named_params, boost::edge_weight_t>, boost::edge_weight_t, boost::no_property> >]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/bellman_ford_shortest_paths.hpp:190:41: required from ‘bool boost::detail::bellman_dispatch(EdgeListGraph&, Size, WeightMap, DistanceMap, const boost::bgl_named_params&) [with EdgeListGraph = boost::adjacency_list >; Size = int; WeightMap = boost::adj_list_edge_property_map, boost::edge_weight_t>; DistanceMap = double*; P = double*; T = boost::vertex_distance_t; R = boost::bgl_named_params, boost::edge_weight_t>, boost::edge_weight_t, boost::no_property> >]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/bellman_ford_shortest_paths.hpp:201:36: required from ‘bool boost::bellman_ford_shortest_paths(EdgeListGraph&, Size, const bgl_named_params&) [with EdgeListGraph = adjacency_list >; Size = int; P = double*; T = vertex_distance_t; R = bgl_named_params, edge_weight_t>, edge_weight_t, no_property> >]’ shortestPath.cpp:105:45: required from here /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::InputIterator::~InputIterator() [with TT = boost::detail::adj_list_edge_iterator, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator >*, std::vector >, std::allocator > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::adjacency_list > >]’ 37 | ~model() | ^ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:512:7: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 512 | BOOST_CONCEPT_USAGE(InputIterator) | ^~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::CopyConstructible > > >]’: /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements > > > >]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:167:5: required from ‘struct boost::CopyConstructible > > >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:165:3: required from ‘struct boost::CopyConstructibleConcept > > >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::CopyConstructibleConcept > > >]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied > > > >::value’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:45:51: [ skipping 8 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/depth_first_search.hpp:417:35: required from ‘void boost::depth_first_visit(const IncidenceGraph&, typename graph_traits::vertex_descriptor, DFSVisitor, ColorMap) [with IncidenceGraph = R_adjacency_list; DFSVisitor = topo_sort_visitor > >; ColorMap = iterator_property_map<__gnu_cxx::__normal_iterator >, vec_adj_list_vertex_id_map, long unsigned int>, default_color_type, default_color_type&>; typename graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/dag_shortest_paths.hpp:42:22: required from ‘void boost::dag_shortest_paths(const VertexListGraph&, typename graph_traits::vertex_descriptor, DistanceMap, WeightMap, ColorMap, PredecessorMap, DijkstraVisitor, Compare, Combine, DistInf, DistZero) [with VertexListGraph = R_adjacency_list; DijkstraVisitor = dijkstra_visitor<>; DistanceMap = double*; WeightMap = adj_list_edge_property_map, edge_weight_t>; ColorMap = iterator_property_map<__gnu_cxx::__normal_iterator >, vec_adj_list_vertex_id_map, long unsigned int>, default_color_type, default_color_type&>; PredecessorMap = long unsigned int*; Compare = std::less; Combine = closed_plus; DistInf = double; DistZero = double; typename graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/dag_shortest_paths.hpp:90:27: required from ‘void boost::detail::dag_sp_dispatch2(const VertexListGraph&, typename boost::graph_traits::vertex_descriptor, DistanceMap, WeightMap, ColorMap, IndexMap, DijkstraVisitor, const Params&) [with VertexListGraph = R_adjacency_list; DijkstraVisitor = boost::dijkstra_visitor<>; DistanceMap = double*; WeightMap = boost::adj_list_edge_property_map, boost::edge_weight_t>; ColorMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map, long unsigned int>, boost::default_color_type, boost::default_color_type&>; IndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>; Params = boost::bgl_named_params >; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/dag_shortest_paths.hpp:114:25: required from ‘void boost::detail::dag_sp_dispatch1(const VertexListGraph&, typename boost::graph_traits::vertex_descriptor, DistanceMap, WeightMap, ColorMap, IndexMap, DijkstraVisitor, const Params&) [with VertexListGraph = R_adjacency_list; DijkstraVisitor = boost::dijkstra_visitor<>; DistanceMap = double*; WeightMap = boost::adj_list_edge_property_map, boost::edge_weight_t>; ColorMap = boost::param_not_found; IndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>; Params = boost::bgl_named_params >; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/dag_shortest_paths.hpp:134:29: required from ‘void boost::dag_shortest_paths(const VertexListGraph&, typename graph_traits::vertex_descriptor, const bgl_named_params&) [with VertexListGraph = R_adjacency_list; Param = double*; Tag = vertex_distance_t; Rest = bgl_named_params; typename graph_traits::vertex_descriptor = long unsigned int]’ shortestPath.cpp:144:27: required from here /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::CopyConstructible::~CopyConstructible() [with TT = boost::topo_sort_visitor > >]’ 37 | ~model() | ^ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:167:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 167 | BOOST_CONCEPT_USAGE(CopyConstructible) { | ^~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::Assignable >]’: /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements > >]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:145:5: required from ‘struct boost::Assignable >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:502:3: required from ‘struct boost::InputIterator >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::InputIterator >]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied > >::value’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:45:51: [ skipping 4 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/graph_concepts.hpp:184:9: required from ‘boost::concepts::VertexListGraph::~VertexListGraph() [with G = R_adjacency_list]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/graph_concepts.hpp:176:1: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::VertexListGraphConcept >]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/bellman_ford_shortest_paths.hpp:218:5: required from ‘bool boost::floyd_warshall_all_pairs_shortest_paths(const VertexAndEdgeListGraph&, DistanceMatrix&, const WeightMap&, const BinaryPredicate&, const BinaryFunction&, const Infinity&, const Zero&) [with VertexAndEdgeListGraph = R_adjacency_list; DistanceMatrix = Basic2DMatrix; WeightMap = adj_list_edge_property_map, edge_weight_t>; BinaryPredicate = std::less; BinaryFunction = closed_plus; Infinity = double; Zero = double]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/floyd_warshall_shortest.hpp:172:55: required from ‘bool boost::detail::floyd_warshall_noninit_dispatch(const VertexAndEdgeListGraph&, DistanceMatrix&, WeightMap, const boost::bgl_named_params&) [with VertexAndEdgeListGraph = R_adjacency_list; DistanceMatrix = Basic2DMatrix; WeightMap = boost::adj_list_edge_property_map, boost::edge_weight_t>; P = int; T = int; R = boost::no_property]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/floyd_warshall_shortest.hpp:217:51: required from ‘bool boost::floyd_warshall_all_pairs_shortest_paths(const VertexAndEdgeListGraph&, DistanceMatrix&) [with VertexAndEdgeListGraph = R_adjacency_list; DistanceMatrix = Basic2DMatrix]’ shortestPath.cpp:186:48: required from here /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::Assignable::~Assignable() [with TT = boost::range_detail::integer_iterator]’ 37 | ~model() | ^ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:145:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 145 | BOOST_CONCEPT_USAGE(Assignable) { | ^~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::EqualityComparable >]’: /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements > >]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:233:5: required from ‘struct boost::EqualityComparable >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:502:3: required from ‘struct boost::InputIterator >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::InputIterator >]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied > >::value’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:45:51: [ skipping 4 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/graph_concepts.hpp:184:9: required from ‘boost::concepts::VertexListGraph::~VertexListGraph() [with G = R_adjacency_list]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/graph_concepts.hpp:176:1: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::VertexListGraphConcept >]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/bellman_ford_shortest_paths.hpp:218:5: required from ‘bool boost::floyd_warshall_all_pairs_shortest_paths(const VertexAndEdgeListGraph&, DistanceMatrix&, const WeightMap&, const BinaryPredicate&, const BinaryFunction&, const Infinity&, const Zero&) [with VertexAndEdgeListGraph = R_adjacency_list; DistanceMatrix = Basic2DMatrix; WeightMap = adj_list_edge_property_map, edge_weight_t>; BinaryPredicate = std::less; BinaryFunction = closed_plus; Infinity = double; Zero = double]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/floyd_warshall_shortest.hpp:172:55: required from ‘bool boost::detail::floyd_warshall_noninit_dispatch(const VertexAndEdgeListGraph&, DistanceMatrix&, WeightMap, const boost::bgl_named_params&) [with VertexAndEdgeListGraph = R_adjacency_list; DistanceMatrix = Basic2DMatrix; WeightMap = boost::adj_list_edge_property_map, boost::edge_weight_t>; P = int; T = int; R = boost::no_property]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/floyd_warshall_shortest.hpp:217:51: required from ‘bool boost::floyd_warshall_all_pairs_shortest_paths(const VertexAndEdgeListGraph&, DistanceMatrix&) [with VertexAndEdgeListGraph = R_adjacency_list; DistanceMatrix = Basic2DMatrix]’ shortestPath.cpp:186:48: required from here /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::EqualityComparable::~EqualityComparable() [with TT = boost::range_detail::integer_iterator]’ 37 | ~model() | ^ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:233:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 233 | BOOST_CONCEPT_USAGE(EqualityComparable) { | ^~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::InputIterator >]’: /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements > >]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:512:7: required from ‘struct boost::InputIterator >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::InputIterator >]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied > >::value’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied > >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:72:8: [ skipping 3 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/graph_concepts.hpp:184:9: required from ‘boost::concepts::VertexListGraph::~VertexListGraph() [with G = R_adjacency_list]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/graph_concepts.hpp:176:1: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::VertexListGraphConcept >]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/bellman_ford_shortest_paths.hpp:218:5: required from ‘bool boost::floyd_warshall_all_pairs_shortest_paths(const VertexAndEdgeListGraph&, DistanceMatrix&, const WeightMap&, const BinaryPredicate&, const BinaryFunction&, const Infinity&, const Zero&) [with VertexAndEdgeListGraph = R_adjacency_list; DistanceMatrix = Basic2DMatrix; WeightMap = adj_list_edge_property_map, edge_weight_t>; BinaryPredicate = std::less; BinaryFunction = closed_plus; Infinity = double; Zero = double]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/floyd_warshall_shortest.hpp:172:55: required from ‘bool boost::detail::floyd_warshall_noninit_dispatch(const VertexAndEdgeListGraph&, DistanceMatrix&, WeightMap, const boost::bgl_named_params&) [with VertexAndEdgeListGraph = R_adjacency_list; DistanceMatrix = Basic2DMatrix; WeightMap = boost::adj_list_edge_property_map, boost::edge_weight_t>; P = int; T = int; R = boost::no_property]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/floyd_warshall_shortest.hpp:217:51: required from ‘bool boost::floyd_warshall_all_pairs_shortest_paths(const VertexAndEdgeListGraph&, DistanceMatrix&) [with VertexAndEdgeListGraph = R_adjacency_list; DistanceMatrix = Basic2DMatrix]’ shortestPath.cpp:186:48: required from here /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::InputIterator::~InputIterator() [with TT = boost::range_detail::integer_iterator]’ 37 | ~model() | ^ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:512:7: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 512 | BOOST_CONCEPT_USAGE(InputIterator) | ^~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::Assignable, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator >*, std::vector >, std::allocator > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::adjacency_list, boost::property, boost::no_property, boost::listS> > >]’: /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator >*, std::vector >, std::allocator > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::adjacency_list, boost::property, boost::no_property, boost::listS> > > >]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:145:5: required from ‘struct boost::Assignable, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator >*, std::vector >, std::allocator > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::adjacency_list, boost::property, boost::no_property, boost::listS> > >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:502:3: required from ‘struct boost::InputIterator, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator >*, std::vector >, std::allocator > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::adjacency_list, boost::property, boost::no_property, boost::listS> > >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::InputIterator, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator >*, std::vector >, std::allocator > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::adjacency_list, boost::property, boost::no_property, boost::listS> > >]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator >*, std::vector >, std::allocator > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::adjacency_list, boost::property, boost::no_property, boost::listS> > > >::value’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:45:51: [ skipping 4 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/graph_concepts.hpp:235:9: required from ‘boost::concepts::EdgeListGraph::~EdgeListGraph() [with G = R_adjacency_list]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/graph_concepts.hpp:226:1: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::EdgeListGraphConcept >]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/bellman_ford_shortest_paths.hpp:97:5: required from ‘bool boost::floyd_warshall_all_pairs_shortest_paths(const VertexAndEdgeListGraph&, DistanceMatrix&, const WeightMap&, const BinaryPredicate&, const BinaryFunction&, const Infinity&, const Zero&) [with VertexAndEdgeListGraph = R_adjacency_list; DistanceMatrix = Basic2DMatrix; WeightMap = adj_list_edge_property_map, edge_weight_t>; BinaryPredicate = std::less; BinaryFunction = closed_plus; Infinity = double; Zero = double]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/floyd_warshall_shortest.hpp:172:55: required from ‘bool boost::detail::floyd_warshall_noninit_dispatch(const VertexAndEdgeListGraph&, DistanceMatrix&, WeightMap, const boost::bgl_named_params&) [with VertexAndEdgeListGraph = R_adjacency_list; DistanceMatrix = Basic2DMatrix; WeightMap = boost::adj_list_edge_property_map, boost::edge_weight_t>; P = int; T = int; R = boost::no_property]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/floyd_warshall_shortest.hpp:217:51: required from ‘bool boost::floyd_warshall_all_pairs_shortest_paths(const VertexAndEdgeListGraph&, DistanceMatrix&) [with VertexAndEdgeListGraph = R_adjacency_list; DistanceMatrix = Basic2DMatrix]’ shortestPath.cpp:186:48: required from here /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::Assignable::~Assignable() [with TT = boost::detail::adj_list_edge_iterator, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator >*, std::vector >, std::allocator > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::adjacency_list, boost::property, boost::no_property, boost::listS> >]’ 37 | ~model() | ^ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:145:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 145 | BOOST_CONCEPT_USAGE(Assignable) { | ^~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::EqualityComparable, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator >*, std::vector >, std::allocator > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::adjacency_list, boost::property, boost::no_property, boost::listS> > >]’: /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator >*, std::vector >, std::allocator > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::adjacency_list, boost::property, boost::no_property, boost::listS> > > >]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:233:5: required from ‘struct boost::EqualityComparable, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator >*, std::vector >, std::allocator > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::adjacency_list, boost::property, boost::no_property, boost::listS> > >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:502:3: required from ‘struct boost::InputIterator, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator >*, std::vector >, std::allocator > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::adjacency_list, boost::property, boost::no_property, boost::listS> > >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::InputIterator, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator >*, std::vector >, std::allocator > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::adjacency_list, boost::property, boost::no_property, boost::listS> > >]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator >*, std::vector >, std::allocator > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::adjacency_list, boost::property, boost::no_property, boost::listS> > > >::value’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:45:51: [ skipping 4 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/graph_concepts.hpp:235:9: required from ‘boost::concepts::EdgeListGraph::~EdgeListGraph() [with G = R_adjacency_list]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/graph_concepts.hpp:226:1: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::EdgeListGraphConcept >]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/bellman_ford_shortest_paths.hpp:97:5: required from ‘bool boost::floyd_warshall_all_pairs_shortest_paths(const VertexAndEdgeListGraph&, DistanceMatrix&, const WeightMap&, const BinaryPredicate&, const BinaryFunction&, const Infinity&, const Zero&) [with VertexAndEdgeListGraph = R_adjacency_list; DistanceMatrix = Basic2DMatrix; WeightMap = adj_list_edge_property_map, edge_weight_t>; BinaryPredicate = std::less; BinaryFunction = closed_plus; Infinity = double; Zero = double]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/floyd_warshall_shortest.hpp:172:55: required from ‘bool boost::detail::floyd_warshall_noninit_dispatch(const VertexAndEdgeListGraph&, DistanceMatrix&, WeightMap, const boost::bgl_named_params&) [with VertexAndEdgeListGraph = R_adjacency_list; DistanceMatrix = Basic2DMatrix; WeightMap = boost::adj_list_edge_property_map, boost::edge_weight_t>; P = int; T = int; R = boost::no_property]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/floyd_warshall_shortest.hpp:217:51: required from ‘bool boost::floyd_warshall_all_pairs_shortest_paths(const VertexAndEdgeListGraph&, DistanceMatrix&) [with VertexAndEdgeListGraph = R_adjacency_list; DistanceMatrix = Basic2DMatrix]’ shortestPath.cpp:186:48: required from here /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::EqualityComparable::~EqualityComparable() [with TT = boost::detail::adj_list_edge_iterator, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator >*, std::vector >, std::allocator > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::adjacency_list, boost::property, boost::no_property, boost::listS> >]’ 37 | ~model() | ^ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:233:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 233 | BOOST_CONCEPT_USAGE(EqualityComparable) { | ^~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::InputIterator, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator >*, std::vector >, std::allocator > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::adjacency_list, boost::property, boost::no_property, boost::listS> > >]’: /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator >*, std::vector >, std::allocator > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::adjacency_list, boost::property, boost::no_property, boost::listS> > > >]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:512:7: required from ‘struct boost::InputIterator, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator >*, std::vector >, std::allocator > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::adjacency_list, boost::property, boost::no_property, boost::listS> > >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::InputIterator, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator >*, std::vector >, std::allocator > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::adjacency_list, boost::property, boost::no_property, boost::listS> > >]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator >*, std::vector >, std::allocator > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::adjacency_list, boost::property, boost::no_property, boost::listS> > > >::value’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator >*, std::vector >, std::allocator > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::adjacency_list, boost::property, boost::no_property, boost::listS> > > >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:72:8: [ skipping 3 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/graph_concepts.hpp:235:9: required from ‘boost::concepts::EdgeListGraph::~EdgeListGraph() [with G = R_adjacency_list]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/graph_concepts.hpp:226:1: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::EdgeListGraphConcept >]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/bellman_ford_shortest_paths.hpp:97:5: required from ‘bool boost::floyd_warshall_all_pairs_shortest_paths(const VertexAndEdgeListGraph&, DistanceMatrix&, const WeightMap&, const BinaryPredicate&, const BinaryFunction&, const Infinity&, const Zero&) [with VertexAndEdgeListGraph = R_adjacency_list; DistanceMatrix = Basic2DMatrix; WeightMap = adj_list_edge_property_map, edge_weight_t>; BinaryPredicate = std::less; BinaryFunction = closed_plus; Infinity = double; Zero = double]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/floyd_warshall_shortest.hpp:172:55: required from ‘bool boost::detail::floyd_warshall_noninit_dispatch(const VertexAndEdgeListGraph&, DistanceMatrix&, WeightMap, const boost::bgl_named_params&) [with VertexAndEdgeListGraph = R_adjacency_list; DistanceMatrix = Basic2DMatrix; WeightMap = boost::adj_list_edge_property_map, boost::edge_weight_t>; P = int; T = int; R = boost::no_property]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/floyd_warshall_shortest.hpp:217:51: required from ‘bool boost::floyd_warshall_all_pairs_shortest_paths(const VertexAndEdgeListGraph&, DistanceMatrix&) [with VertexAndEdgeListGraph = R_adjacency_list; DistanceMatrix = Basic2DMatrix]’ shortestPath.cpp:186:48: required from here /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::InputIterator::~InputIterator() [with TT = boost::detail::adj_list_edge_iterator, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator >*, std::vector >, std::allocator > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::adjacency_list, boost::property, boost::no_property, boost::listS> >]’ 37 | ~model() | ^ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:512:7: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 512 | BOOST_CONCEPT_USAGE(InputIterator) | ^~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::Assignable >*, std::vector >, std::allocator > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> >]’: /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements >*, std::vector >, std::allocator > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:145:5: required from ‘struct boost::Assignable >*, std::vector >, std::allocator > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:502:3: required from ‘struct boost::InputIterator >*, std::vector >, std::allocator > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::InputIterator >*, std::vector >, std::allocator > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> >]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied >*, std::vector >, std::allocator > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::value’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:45:51: [ skipping 4 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/graph_concepts.hpp:89:9: required from ‘boost::concepts::IncidenceGraph::~IncidenceGraph() [with G = R_adjacency_list]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/graph_concepts.hpp:75:1: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::IncidenceGraphConcept >]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/breadth_first_search.hpp:62:5: required from ‘bool boost::floyd_warshall_all_pairs_shortest_paths(const VertexAndEdgeListGraph&, DistanceMatrix&, const WeightMap&, const BinaryPredicate&, const BinaryFunction&, const Infinity&, const Zero&) [with VertexAndEdgeListGraph = R_adjacency_list; DistanceMatrix = Basic2DMatrix; WeightMap = adj_list_edge_property_map, edge_weight_t>; BinaryPredicate = std::less; BinaryFunction = closed_plus; Infinity = double; Zero = double]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/floyd_warshall_shortest.hpp:172:55: required from ‘bool boost::detail::floyd_warshall_noninit_dispatch(const VertexAndEdgeListGraph&, DistanceMatrix&, WeightMap, const boost::bgl_named_params&) [with VertexAndEdgeListGraph = R_adjacency_list; DistanceMatrix = Basic2DMatrix; WeightMap = boost::adj_list_edge_property_map, boost::edge_weight_t>; P = int; T = int; R = boost::no_property]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/floyd_warshall_shortest.hpp:217:51: required from ‘bool boost::floyd_warshall_all_pairs_shortest_paths(const VertexAndEdgeListGraph&, DistanceMatrix&) [with VertexAndEdgeListGraph = R_adjacency_list; DistanceMatrix = Basic2DMatrix]’ shortestPath.cpp:186:48: required from here /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::Assignable::~Assignable() [with TT = boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator >*, std::vector >, std::allocator > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>]’ 37 | ~model() | ^ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:145:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 145 | BOOST_CONCEPT_USAGE(Assignable) { | ^~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::EqualityComparable >*, std::vector >, std::allocator > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> >]’: /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements >*, std::vector >, std::allocator > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:233:5: required from ‘struct boost::EqualityComparable >*, std::vector >, std::allocator > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:502:3: required from ‘struct boost::InputIterator >*, std::vector >, std::allocator > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::InputIterator >*, std::vector >, std::allocator > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> >]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied >*, std::vector >, std::allocator > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::value’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:45:51: [ skipping 4 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/graph_concepts.hpp:89:9: required from ‘boost::concepts::IncidenceGraph::~IncidenceGraph() [with G = R_adjacency_list]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/graph_concepts.hpp:75:1: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::IncidenceGraphConcept >]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/breadth_first_search.hpp:62:5: required from ‘bool boost::floyd_warshall_all_pairs_shortest_paths(const VertexAndEdgeListGraph&, DistanceMatrix&, const WeightMap&, const BinaryPredicate&, const BinaryFunction&, const Infinity&, const Zero&) [with VertexAndEdgeListGraph = R_adjacency_list; DistanceMatrix = Basic2DMatrix; WeightMap = adj_list_edge_property_map, edge_weight_t>; BinaryPredicate = std::less; BinaryFunction = closed_plus; Infinity = double; Zero = double]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/floyd_warshall_shortest.hpp:172:55: required from ‘bool boost::detail::floyd_warshall_noninit_dispatch(const VertexAndEdgeListGraph&, DistanceMatrix&, WeightMap, const boost::bgl_named_params&) [with VertexAndEdgeListGraph = R_adjacency_list; DistanceMatrix = Basic2DMatrix; WeightMap = boost::adj_list_edge_property_map, boost::edge_weight_t>; P = int; T = int; R = boost::no_property]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/floyd_warshall_shortest.hpp:217:51: required from ‘bool boost::floyd_warshall_all_pairs_shortest_paths(const VertexAndEdgeListGraph&, DistanceMatrix&) [with VertexAndEdgeListGraph = R_adjacency_list; DistanceMatrix = Basic2DMatrix]’ shortestPath.cpp:186:48: required from here /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::EqualityComparable::~EqualityComparable() [with TT = boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator >*, std::vector >, std::allocator > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>]’ 37 | ~model() | ^ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:233:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 233 | BOOST_CONCEPT_USAGE(EqualityComparable) { | ^~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::InputIterator >*, std::vector >, std::allocator > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> >]’: /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements >*, std::vector >, std::allocator > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:512:7: required from ‘struct boost::InputIterator >*, std::vector >, std::allocator > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::InputIterator >*, std::vector >, std::allocator > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> >]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied >*, std::vector >, std::allocator > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::value’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied >*, std::vector >, std::allocator > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:72:8: [ skipping 3 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/graph_concepts.hpp:89:9: required from ‘boost::concepts::IncidenceGraph::~IncidenceGraph() [with G = R_adjacency_list]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/graph_concepts.hpp:75:1: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::IncidenceGraphConcept >]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/breadth_first_search.hpp:62:5: required from ‘bool boost::floyd_warshall_all_pairs_shortest_paths(const VertexAndEdgeListGraph&, DistanceMatrix&, const WeightMap&, const BinaryPredicate&, const BinaryFunction&, const Infinity&, const Zero&) [with VertexAndEdgeListGraph = R_adjacency_list; DistanceMatrix = Basic2DMatrix; WeightMap = adj_list_edge_property_map, edge_weight_t>; BinaryPredicate = std::less; BinaryFunction = closed_plus; Infinity = double; Zero = double]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/floyd_warshall_shortest.hpp:172:55: required from ‘bool boost::detail::floyd_warshall_noninit_dispatch(const VertexAndEdgeListGraph&, DistanceMatrix&, WeightMap, const boost::bgl_named_params&) [with VertexAndEdgeListGraph = R_adjacency_list; DistanceMatrix = Basic2DMatrix; WeightMap = boost::adj_list_edge_property_map, boost::edge_weight_t>; P = int; T = int; R = boost::no_property]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/floyd_warshall_shortest.hpp:217:51: required from ‘bool boost::floyd_warshall_all_pairs_shortest_paths(const VertexAndEdgeListGraph&, DistanceMatrix&) [with VertexAndEdgeListGraph = R_adjacency_list; DistanceMatrix = Basic2DMatrix]’ shortestPath.cpp:186:48: required from here /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::InputIterator::~InputIterator() [with TT = boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator >*, std::vector >, std::allocator > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>]’ 37 | ~model() | ^ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:512:7: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 512 | BOOST_CONCEPT_USAGE(InputIterator) | ^~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::constraint::failed() [with Model = boost::BFSVisitorConcept, boost::d_ary_heap_indirect, long unsigned int>, long unsigned int, long unsigned int&>, double*, std::less, std::vector >, boost::adj_list_edge_property_map, boost::edge_weight_t>, long unsigned int*, double*, std::plus, std::less >, R_adjacency_list >]’: /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/breadth_first_search.hpp:65:5: required from ‘void boost::breadth_first_visit(const IncidenceGraph&, SourceIterator, SourceIterator, Buffer&, BFSVisitor, ColorMap) [with IncidenceGraph = R_adjacency_list; Buffer = d_ary_heap_indirect, long unsigned int>, long unsigned int, long unsigned int&>, double*, std::less, std::vector >; BFSVisitor = detail::dijkstra_bfs_visitor, d_ary_heap_indirect, long unsigned int>, long unsigned int, long unsigned int&>, double*, std::less, std::vector >, adj_list_edge_property_map, edge_weight_t>, long unsigned int*, double*, std::plus, std::less >; ColorMap = two_bit_color_map, long unsigned int> >; SourceIterator = long unsigned int*]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/dijkstra_shortest_paths.hpp:387:24: required from ‘void boost::dijkstra_shortest_paths_no_init(const Graph&, SourceInputIter, SourceInputIter, PredecessorMap, DistanceMap, WeightMap, IndexMap, Compare, Combine, DistZero, DijkstraVisitor, ColorMap) [with Graph = R_adjacency_list; SourceInputIter = long unsigned int*; DijkstraVisitor = dijkstra_visitor<>; PredecessorMap = long unsigned int*; DistanceMap = double*; WeightMap = adj_list_edge_property_map, edge_weight_t>; IndexMap = vec_adj_list_vertex_id_map, long unsigned int>; Compare = std::less; Combine = std::plus; DistZero = double; ColorMap = two_bit_color_map, long unsigned int> >]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/dijkstra_shortest_paths.hpp:464:36: required from ‘void boost::dijkstra_shortest_paths(const VertexListGraph&, SourceInputIter, SourceInputIter, PredecessorMap, DistanceMap, WeightMap, IndexMap, Compare, Combine, DistInf, DistZero, DijkstraVisitor, ColorMap) [with VertexListGraph = R_adjacency_list; SourceInputIter = long unsigned int*; DijkstraVisitor = dijkstra_visitor<>; PredecessorMap = long unsigned int*; DistanceMap = double*; WeightMap = adj_list_edge_property_map, edge_weight_t>; IndexMap = vec_adj_list_vertex_id_map, long unsigned int>; Compare = std::less; Combine = std::plus; DistInf = double; DistZero = double; ColorMap = two_bit_color_map, long unsigned int> >]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/dijkstra_shortest_paths.hpp:417:28: required from ‘void boost::dijkstra_shortest_paths(const VertexListGraph&, SourceInputIter, SourceInputIter, PredecessorMap, DistanceMap, WeightMap, IndexMap, Compare, Combine, DistInf, DistZero, DijkstraVisitor, const bgl_named_params&, typename enable_if_c::traversal_category>::value, graph::detail::no_parameter>::type) [with VertexListGraph = R_adjacency_list; SourceInputIter = long unsigned int*; DijkstraVisitor = dijkstra_visitor<>; PredecessorMap = long unsigned int*; DistanceMap = double*; WeightMap = adj_list_edge_property_map, edge_weight_t>; IndexMap = vec_adj_list_vertex_id_map, long unsigned int>; Compare = std::less; Combine = std::plus; DistInf = double; DistZero = double; T = char; Tag = detail::unused_tag_type; Base = no_property; typename enable_if_c::traversal_category>::value, graph::detail::no_parameter>::type = graph::detail::no_parameter; typename graph_traits::traversal_category = adj_list_dir_traversal_tag]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/dijkstra_shortest_paths.hpp:491:28: required from ‘void boost::dijkstra_shortest_paths(const VertexListGraph&, SourceInputIter, SourceInputIter, PredecessorMap, DistanceMap, WeightMap, IndexMap, Compare, Combine, DistInf, DistZero, DijkstraVisitor) [with VertexListGraph = R_adjacency_list; SourceInputIter = long unsigned int*; DijkstraVisitor = dijkstra_visitor<>; PredecessorMap = long unsigned int*; DistanceMap = double*; WeightMap = adj_list_edge_property_map, edge_weight_t>; IndexMap = vec_adj_list_vertex_id_map, long unsigned int>; Compare = std::less; Combine = std::plus; DistInf = double; DistZero = double]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/dijkstra_shortest_paths.hpp:434:28: required from ‘void boost::dijkstra_shortest_paths(const VertexListGraph&, typename graph_traits::vertex_descriptor, PredecessorMap, DistanceMap, WeightMap, IndexMap, Compare, Combine, DistInf, DistZero, DijkstraVisitor, const bgl_named_params&, typename enable_if_c::traversal_category>::value, graph::detail::no_parameter>::type) [with VertexListGraph = R_adjacency_list; DijkstraVisitor = dijkstra_visitor<>; PredecessorMap = long unsigned int*; DistanceMap = double*; WeightMap = adj_list_edge_property_map, edge_weight_t>; IndexMap = vec_adj_list_vertex_id_map, long unsigned int>; Compare = std::less; Combine = std::plus; DistInf = double; DistZero = double; T = double*; Tag = vertex_distance_t; Base = bgl_named_params; typename graph_traits::vertex_descriptor = long unsigned int; typename enable_if_c::traversal_category>::value, graph::detail::no_parameter>::type = graph::detail::no_parameter; typename graph_traits::traversal_category = adj_list_dir_traversal_tag]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/dijkstra_shortest_paths.hpp:528:32: required from ‘void boost::detail::dijkstra_dispatch2(const VertexListGraph&, typename boost::graph_traits::vertex_descriptor, DistanceMap, WeightMap, IndexMap, const Params&) [with VertexListGraph = R_adjacency_list; DistanceMap = double*; WeightMap = boost::adj_list_edge_property_map, boost::edge_weight_t>; IndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>; Params = boost::bgl_named_params >; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/dijkstra_shortest_paths.hpp:554:35: required from ‘void boost::detail::dijkstra_dispatch1(const VertexListGraph&, typename boost::graph_traits::vertex_descriptor, DistanceMap, WeightMap, IndexMap, const Params&) [with VertexListGraph = R_adjacency_list; DistanceMap = double*; WeightMap = boost::adj_list_edge_property_map, boost::edge_weight_t>; IndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>; Params = boost::bgl_named_params >; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/dijkstra_shortest_paths.hpp:570:31: required from ‘void boost::dijkstra_shortest_paths(const VertexListGraph&, typename graph_traits::vertex_descriptor, const bgl_named_params&) [with VertexListGraph = R_adjacency_list; Param = double*; Tag = vertex_distance_t; Rest = bgl_named_params; typename graph_traits::vertex_descriptor = long unsigned int]’ shortestPath.cpp:25:32: required from here /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:65:52: warning: ‘this’ pointer is null [-Wnonnull] 65 | static void failed() { ((Model*)0)->constraints(); } | ~~~~~~~~~~~~~~~~~~~~~~~~^~ In file included from /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/dijkstra_shortest_paths.hpp:21, from shortestPath.cpp:3: /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/breadth_first_search.hpp:37:10: note: in a call to non-static member function ‘void boost::BFSVisitorConcept::constraints() [with Visitor = boost::detail::dijkstra_bfs_visitor, boost::d_ary_heap_indirect, long unsigned int>, long unsigned int, long unsigned int&>, double*, std::less, std::vector >, boost::adj_list_edge_property_map, boost::edge_weight_t>, long unsigned int*, double*, std::plus, std::less >; Graph = R_adjacency_list]’ 37 | void constraints() | ^~~~~~~~~~~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::constraint::failed() [with Model = boost::ReadWritePropertyMapConcept, long unsigned int> >, long unsigned int>]’: /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/breadth_first_search.hpp:66:5: required from ‘void boost::breadth_first_visit(const IncidenceGraph&, SourceIterator, SourceIterator, Buffer&, BFSVisitor, ColorMap) [with IncidenceGraph = R_adjacency_list; Buffer = d_ary_heap_indirect, long unsigned int>, long unsigned int, long unsigned int&>, double*, std::less, std::vector >; BFSVisitor = detail::dijkstra_bfs_visitor, d_ary_heap_indirect, long unsigned int>, long unsigned int, long unsigned int&>, double*, std::less, std::vector >, adj_list_edge_property_map, edge_weight_t>, long unsigned int*, double*, std::plus, std::less >; ColorMap = two_bit_color_map, long unsigned int> >; SourceIterator = long unsigned int*]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/dijkstra_shortest_paths.hpp:387:24: required from ‘void boost::dijkstra_shortest_paths_no_init(const Graph&, SourceInputIter, SourceInputIter, PredecessorMap, DistanceMap, WeightMap, IndexMap, Compare, Combine, DistZero, DijkstraVisitor, ColorMap) [with Graph = R_adjacency_list; SourceInputIter = long unsigned int*; DijkstraVisitor = dijkstra_visitor<>; PredecessorMap = long unsigned int*; DistanceMap = double*; WeightMap = adj_list_edge_property_map, edge_weight_t>; IndexMap = vec_adj_list_vertex_id_map, long unsigned int>; Compare = std::less; Combine = std::plus; DistZero = double; ColorMap = two_bit_color_map, long unsigned int> >]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/dijkstra_shortest_paths.hpp:464:36: required from ‘void boost::dijkstra_shortest_paths(const VertexListGraph&, SourceInputIter, SourceInputIter, PredecessorMap, DistanceMap, WeightMap, IndexMap, Compare, Combine, DistInf, DistZero, DijkstraVisitor, ColorMap) [with VertexListGraph = R_adjacency_list; SourceInputIter = long unsigned int*; DijkstraVisitor = dijkstra_visitor<>; PredecessorMap = long unsigned int*; DistanceMap = double*; WeightMap = adj_list_edge_property_map, edge_weight_t>; IndexMap = vec_adj_list_vertex_id_map, long unsigned int>; Compare = std::less; Combine = std::plus; DistInf = double; DistZero = double; ColorMap = two_bit_color_map, long unsigned int> >]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/dijkstra_shortest_paths.hpp:417:28: required from ‘void boost::dijkstra_shortest_paths(const VertexListGraph&, SourceInputIter, SourceInputIter, PredecessorMap, DistanceMap, WeightMap, IndexMap, Compare, Combine, DistInf, DistZero, DijkstraVisitor, const bgl_named_params&, typename enable_if_c::traversal_category>::value, graph::detail::no_parameter>::type) [with VertexListGraph = R_adjacency_list; SourceInputIter = long unsigned int*; DijkstraVisitor = dijkstra_visitor<>; PredecessorMap = long unsigned int*; DistanceMap = double*; WeightMap = adj_list_edge_property_map, edge_weight_t>; IndexMap = vec_adj_list_vertex_id_map, long unsigned int>; Compare = std::less; Combine = std::plus; DistInf = double; DistZero = double; T = char; Tag = detail::unused_tag_type; Base = no_property; typename enable_if_c::traversal_category>::value, graph::detail::no_parameter>::type = graph::detail::no_parameter; typename graph_traits::traversal_category = adj_list_dir_traversal_tag]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/dijkstra_shortest_paths.hpp:491:28: required from ‘void boost::dijkstra_shortest_paths(const VertexListGraph&, SourceInputIter, SourceInputIter, PredecessorMap, DistanceMap, WeightMap, IndexMap, Compare, Combine, DistInf, DistZero, DijkstraVisitor) [with VertexListGraph = R_adjacency_list; SourceInputIter = long unsigned int*; DijkstraVisitor = dijkstra_visitor<>; PredecessorMap = long unsigned int*; DistanceMap = double*; WeightMap = adj_list_edge_property_map, edge_weight_t>; IndexMap = vec_adj_list_vertex_id_map, long unsigned int>; Compare = std::less; Combine = std::plus; DistInf = double; DistZero = double]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/dijkstra_shortest_paths.hpp:434:28: required from ‘void boost::dijkstra_shortest_paths(const VertexListGraph&, typename graph_traits::vertex_descriptor, PredecessorMap, DistanceMap, WeightMap, IndexMap, Compare, Combine, DistInf, DistZero, DijkstraVisitor, const bgl_named_params&, typename enable_if_c::traversal_category>::value, graph::detail::no_parameter>::type) [with VertexListGraph = R_adjacency_list; DijkstraVisitor = dijkstra_visitor<>; PredecessorMap = long unsigned int*; DistanceMap = double*; WeightMap = adj_list_edge_property_map, edge_weight_t>; IndexMap = vec_adj_list_vertex_id_map, long unsigned int>; Compare = std::less; Combine = std::plus; DistInf = double; DistZero = double; T = double*; Tag = vertex_distance_t; Base = bgl_named_params; typename graph_traits::vertex_descriptor = long unsigned int; typename enable_if_c::traversal_category>::value, graph::detail::no_parameter>::type = graph::detail::no_parameter; typename graph_traits::traversal_category = adj_list_dir_traversal_tag]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/dijkstra_shortest_paths.hpp:528:32: required from ‘void boost::detail::dijkstra_dispatch2(const VertexListGraph&, typename boost::graph_traits::vertex_descriptor, DistanceMap, WeightMap, IndexMap, const Params&) [with VertexListGraph = R_adjacency_list; DistanceMap = double*; WeightMap = boost::adj_list_edge_property_map, boost::edge_weight_t>; IndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>; Params = boost::bgl_named_params >; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/dijkstra_shortest_paths.hpp:554:35: required from ‘void boost::detail::dijkstra_dispatch1(const VertexListGraph&, typename boost::graph_traits::vertex_descriptor, DistanceMap, WeightMap, IndexMap, const Params&) [with VertexListGraph = R_adjacency_list; DistanceMap = double*; WeightMap = boost::adj_list_edge_property_map, boost::edge_weight_t>; IndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>; Params = boost::bgl_named_params >; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/dijkstra_shortest_paths.hpp:570:31: required from ‘void boost::dijkstra_shortest_paths(const VertexListGraph&, typename graph_traits::vertex_descriptor, const bgl_named_params&) [with VertexListGraph = R_adjacency_list; Param = double*; Tag = vertex_distance_t; Rest = bgl_named_params; typename graph_traits::vertex_descriptor = long unsigned int]’ shortestPath.cpp:25:32: required from here /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:65:52: warning: ‘this’ pointer is null [-Wnonnull] 65 | static void failed() { ((Model*)0)->constraints(); } | ~~~~~~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/property_map/property_map.hpp:205:10: note: in a call to non-static member function ‘void boost::ReadWritePropertyMapConcept::constraints() [with PMap = boost::two_bit_color_map, long unsigned int> >; Key = long unsigned int]’ 205 | void constraints() { | ^~~~~~~~~~~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::Assignable, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::adjacency_list, boost::property >, boost::no_property, boost::listS> > >]’: /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::adjacency_list, boost::property >, boost::no_property, boost::listS> > > >]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:145:5: required from ‘struct boost::Assignable, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::adjacency_list, boost::property >, boost::no_property, boost::listS> > >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:502:3: required from ‘struct boost::InputIterator, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::adjacency_list, boost::property >, boost::no_property, boost::listS> > >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::InputIterator, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::adjacency_list, boost::property >, boost::no_property, boost::listS> > >]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::adjacency_list, boost::property >, boost::no_property, boost::listS> > > >::value’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:45:51: [ skipping 5 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/graph_concepts.hpp:226:1: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::EdgeListGraphConcept, boost::property >, boost::no_property, boost::listS> >]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/bellman_ford_shortest_paths.hpp:97:5: required from ‘bool boost::bellman_ford_shortest_paths(EdgeListGraph&, Size, WeightMap, PredecessorMap, DistanceMap, BinaryFunction, BinaryPredicate, BellmanFordVisitor) [with EdgeListGraph = adjacency_list, property >, no_property, listS>; Size = long unsigned int; WeightMap = adj_list_edge_property_map >, edge_weight_t>; PredecessorMap = dummy_property_map; DistanceMap = vec_adj_list_vertex_property_map, property >, no_property, listS>, adjacency_list, property >, no_property, listS>*, double, double&, vertex_distance_t>; BinaryFunction = closed_plus; BinaryPredicate = std::less; BellmanFordVisitor = bellman_visitor<>]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/johnson_all_pairs_shortest.hpp:112:36: required from ‘bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, VertexID, Weight, const BinaryPredicate&, const BinaryFunction&, const Infinity&, DistanceZero) [with VertexAndEdgeListGraph = R_adjacency_list; DistanceMatrix = Basic2DMatrix; VertexID = vec_adj_list_vertex_id_map, long unsigned int>; Weight = adj_list_edge_property_map, edge_weight_t>; BinaryPredicate = std::less; BinaryFunction = closed_plus; Infinity = double; DistanceZero = double]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/johnson_all_pairs_shortest.hpp:164:48: required from ‘bool boost::detail::johnson_dispatch(VertexAndEdgeListGraph&, DistanceMatrix&, const boost::bgl_named_params&, Weight, VertexID) [with VertexAndEdgeListGraph = R_adjacency_list; DistanceMatrix = Basic2DMatrix; P = int; T = int; R = boost::no_property; Weight = boost::adj_list_edge_property_map, boost::edge_weight_t>; VertexID = boost::vec_adj_list_vertex_id_map, long unsigned int>]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/johnson_all_pairs_shortest.hpp:192:36: required from ‘bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&) [with VertexAndEdgeListGraph = R_adjacency_list; DistanceMatrix = Basic2DMatrix]’ shortestPath.cpp:56:41: required from here /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::Assignable::~Assignable() [with TT = boost::detail::adj_list_edge_iterator, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::adjacency_list, boost::property >, boost::no_property, boost::listS> >]’ 37 | ~model() | ^ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:145:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 145 | BOOST_CONCEPT_USAGE(Assignable) { | ^~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::EqualityComparable, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::adjacency_list, boost::property >, boost::no_property, boost::listS> > >]’: /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::adjacency_list, boost::property >, boost::no_property, boost::listS> > > >]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:233:5: required from ‘struct boost::EqualityComparable, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::adjacency_list, boost::property >, boost::no_property, boost::listS> > >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:502:3: required from ‘struct boost::InputIterator, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::adjacency_list, boost::property >, boost::no_property, boost::listS> > >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::InputIterator, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::adjacency_list, boost::property >, boost::no_property, boost::listS> > >]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::adjacency_list, boost::property >, boost::no_property, boost::listS> > > >::value’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:45:51: [ skipping 5 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/graph_concepts.hpp:226:1: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::EdgeListGraphConcept, boost::property >, boost::no_property, boost::listS> >]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/bellman_ford_shortest_paths.hpp:97:5: required from ‘bool boost::bellman_ford_shortest_paths(EdgeListGraph&, Size, WeightMap, PredecessorMap, DistanceMap, BinaryFunction, BinaryPredicate, BellmanFordVisitor) [with EdgeListGraph = adjacency_list, property >, no_property, listS>; Size = long unsigned int; WeightMap = adj_list_edge_property_map >, edge_weight_t>; PredecessorMap = dummy_property_map; DistanceMap = vec_adj_list_vertex_property_map, property >, no_property, listS>, adjacency_list, property >, no_property, listS>*, double, double&, vertex_distance_t>; BinaryFunction = closed_plus; BinaryPredicate = std::less; BellmanFordVisitor = bellman_visitor<>]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/johnson_all_pairs_shortest.hpp:112:36: required from ‘bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, VertexID, Weight, const BinaryPredicate&, const BinaryFunction&, const Infinity&, DistanceZero) [with VertexAndEdgeListGraph = R_adjacency_list; DistanceMatrix = Basic2DMatrix; VertexID = vec_adj_list_vertex_id_map, long unsigned int>; Weight = adj_list_edge_property_map, edge_weight_t>; BinaryPredicate = std::less; BinaryFunction = closed_plus; Infinity = double; DistanceZero = double]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/johnson_all_pairs_shortest.hpp:164:48: required from ‘bool boost::detail::johnson_dispatch(VertexAndEdgeListGraph&, DistanceMatrix&, const boost::bgl_named_params&, Weight, VertexID) [with VertexAndEdgeListGraph = R_adjacency_list; DistanceMatrix = Basic2DMatrix; P = int; T = int; R = boost::no_property; Weight = boost::adj_list_edge_property_map, boost::edge_weight_t>; VertexID = boost::vec_adj_list_vertex_id_map, long unsigned int>]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/johnson_all_pairs_shortest.hpp:192:36: required from ‘bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&) [with VertexAndEdgeListGraph = R_adjacency_list; DistanceMatrix = Basic2DMatrix]’ shortestPath.cpp:56:41: required from here /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::EqualityComparable::~EqualityComparable() [with TT = boost::detail::adj_list_edge_iterator, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::adjacency_list, boost::property >, boost::no_property, boost::listS> >]’ 37 | ~model() | ^ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:233:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 233 | BOOST_CONCEPT_USAGE(EqualityComparable) { | ^~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::InputIterator, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::adjacency_list, boost::property >, boost::no_property, boost::listS> > >]’: /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::adjacency_list, boost::property >, boost::no_property, boost::listS> > > >]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:512:7: required from ‘struct boost::InputIterator, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::adjacency_list, boost::property >, boost::no_property, boost::listS> > >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::InputIterator, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::adjacency_list, boost::property >, boost::no_property, boost::listS> > >]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::adjacency_list, boost::property >, boost::no_property, boost::listS> > > >::value’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::adjacency_list, boost::property >, boost::no_property, boost::listS> > > >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:72:8: [ skipping 4 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/graph_concepts.hpp:226:1: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::EdgeListGraphConcept, boost::property >, boost::no_property, boost::listS> >]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/bellman_ford_shortest_paths.hpp:97:5: required from ‘bool boost::bellman_ford_shortest_paths(EdgeListGraph&, Size, WeightMap, PredecessorMap, DistanceMap, BinaryFunction, BinaryPredicate, BellmanFordVisitor) [with EdgeListGraph = adjacency_list, property >, no_property, listS>; Size = long unsigned int; WeightMap = adj_list_edge_property_map >, edge_weight_t>; PredecessorMap = dummy_property_map; DistanceMap = vec_adj_list_vertex_property_map, property >, no_property, listS>, adjacency_list, property >, no_property, listS>*, double, double&, vertex_distance_t>; BinaryFunction = closed_plus; BinaryPredicate = std::less; BellmanFordVisitor = bellman_visitor<>]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/johnson_all_pairs_shortest.hpp:112:36: required from ‘bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, VertexID, Weight, const BinaryPredicate&, const BinaryFunction&, const Infinity&, DistanceZero) [with VertexAndEdgeListGraph = R_adjacency_list; DistanceMatrix = Basic2DMatrix; VertexID = vec_adj_list_vertex_id_map, long unsigned int>; Weight = adj_list_edge_property_map, edge_weight_t>; BinaryPredicate = std::less; BinaryFunction = closed_plus; Infinity = double; DistanceZero = double]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/johnson_all_pairs_shortest.hpp:164:48: required from ‘bool boost::detail::johnson_dispatch(VertexAndEdgeListGraph&, DistanceMatrix&, const boost::bgl_named_params&, Weight, VertexID) [with VertexAndEdgeListGraph = R_adjacency_list; DistanceMatrix = Basic2DMatrix; P = int; T = int; R = boost::no_property; Weight = boost::adj_list_edge_property_map, boost::edge_weight_t>; VertexID = boost::vec_adj_list_vertex_id_map, long unsigned int>]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/johnson_all_pairs_shortest.hpp:192:36: required from ‘bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&) [with VertexAndEdgeListGraph = R_adjacency_list; DistanceMatrix = Basic2DMatrix]’ shortestPath.cpp:56:41: required from here /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::InputIterator::~InputIterator() [with TT = boost::detail::adj_list_edge_iterator, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::adjacency_list, boost::property >, boost::no_property, boost::listS> >]’ 37 | ~model() | ^ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:512:7: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 512 | BOOST_CONCEPT_USAGE(InputIterator) | ^~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements, boost::property >, boost::no_property, boost::listS> > >]’: /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/graph_concepts.hpp:87:5: required from ‘struct boost::concepts::IncidenceGraph, boost::property >, boost::no_property, boost::listS> >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/graph_concepts.hpp:75:1: required from ‘struct boost::concepts::IncidenceGraphConcept, boost::property >, boost::no_property, boost::listS> >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::concepts::IncidenceGraphConcept, boost::property >, boost::no_property, boost::listS> >]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied, boost::property >, boost::no_property, boost::listS> > >::value’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied, boost::property >, boost::no_property, boost::listS> > >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:72:8: [ skipping 5 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/dijkstra_shortest_paths.hpp:491:28: required from ‘void boost::dijkstra_shortest_paths(const VertexListGraph&, SourceInputIter, SourceInputIter, PredecessorMap, DistanceMap, WeightMap, IndexMap, Compare, Combine, DistInf, DistZero, DijkstraVisitor) [with VertexListGraph = adjacency_list, property >, no_property, listS>; SourceInputIter = long unsigned int*; DijkstraVisitor = dijkstra_visitor<>; PredecessorMap = dummy_property_map; DistanceMap = vec_adj_list_vertex_property_map, property >, no_property, listS>, adjacency_list, property >, no_property, listS>*, double, double&, vertex_distance_t>; WeightMap = adj_list_edge_property_map >, edge_weight2_t>; IndexMap = vec_adj_list_vertex_id_map, long unsigned int>; Compare = std::less; Combine = closed_plus; DistInf = double; DistZero = double]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/dijkstra_shortest_paths.hpp:505:28: required from ‘void boost::dijkstra_shortest_paths(const VertexListGraph&, typename graph_traits::vertex_descriptor, PredecessorMap, DistanceMap, WeightMap, IndexMap, Compare, Combine, DistInf, DistZero, DijkstraVisitor) [with VertexListGraph = adjacency_list, property >, no_property, listS>; DijkstraVisitor = dijkstra_visitor<>; PredecessorMap = dummy_property_map; DistanceMap = vec_adj_list_vertex_property_map, property >, no_property, listS>, adjacency_list, property >, no_property, listS>*, double, double&, vertex_distance_t>; WeightMap = adj_list_edge_property_map >, edge_weight2_t>; IndexMap = vec_adj_list_vertex_id_map, long unsigned int>; Compare = std::less; Combine = closed_plus; DistInf = double; DistZero = double; typename graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/johnson_all_pairs_shortest.hpp:127:36: required from ‘bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, VertexID, Weight, const BinaryPredicate&, const BinaryFunction&, const Infinity&, DistanceZero) [with VertexAndEdgeListGraph = R_adjacency_list; DistanceMatrix = Basic2DMatrix; VertexID = vec_adj_list_vertex_id_map, long unsigned int>; Weight = adj_list_edge_property_map, edge_weight_t>; BinaryPredicate = std::less; BinaryFunction = closed_plus; Infinity = double; DistanceZero = double]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/johnson_all_pairs_shortest.hpp:164:48: required from ‘bool boost::detail::johnson_dispatch(VertexAndEdgeListGraph&, DistanceMatrix&, const boost::bgl_named_params&, Weight, VertexID) [with VertexAndEdgeListGraph = R_adjacency_list; DistanceMatrix = Basic2DMatrix; P = int; T = int; R = boost::no_property; Weight = boost::adj_list_edge_property_map, boost::edge_weight_t>; VertexID = boost::vec_adj_list_vertex_id_map, long unsigned int>]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/johnson_all_pairs_shortest.hpp:192:36: required from ‘bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&) [with VertexAndEdgeListGraph = R_adjacency_list; DistanceMatrix = Basic2DMatrix]’ shortestPath.cpp:56:41: required from here /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::concepts::IncidenceGraph, boost::property >, boost::no_property, boost::listS> >]’ 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ^ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::IncidenceGraphConcept, boost::property >, boost::no_property, boost::listS> >]’: /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/breadth_first_search.hpp:62:5: required from ‘void boost::breadth_first_visit(const IncidenceGraph&, SourceIterator, SourceIterator, Buffer&, BFSVisitor, ColorMap) [with IncidenceGraph = adjacency_list, property >, no_property, listS>; Buffer = d_ary_heap_indirect, long unsigned int>, long unsigned int, long unsigned int&>, vec_adj_list_vertex_property_map, property >, no_property, listS>, adjacency_list, property >, no_property, listS>*, double, double&, vertex_distance_t>, std::less, std::vector >; BFSVisitor = detail::dijkstra_bfs_visitor, d_ary_heap_indirect, long unsigned int>, long unsigned int, long unsigned int&>, vec_adj_list_vertex_property_map, property >, no_property, listS>, adjacency_list, property >, no_property, listS>*, double, double&, vertex_distance_t>, std::less, std::vector >, adj_list_edge_property_map >, edge_weight2_t>, dummy_property_map, vec_adj_list_vertex_property_map, property >, no_property, listS>, adjacency_list, property >, no_property, listS>*, double, double&, vertex_distance_t>, closed_plus, std::less >; ColorMap = two_bit_color_map, long unsigned int> >; SourceIterator = long unsigned int*]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/dijkstra_shortest_paths.hpp:387:24: required from ‘void boost::dijkstra_shortest_paths_no_init(const Graph&, SourceInputIter, SourceInputIter, PredecessorMap, DistanceMap, WeightMap, IndexMap, Compare, Combine, DistZero, DijkstraVisitor, ColorMap) [with Graph = adjacency_list, property >, no_property, listS>; SourceInputIter = long unsigned int*; DijkstraVisitor = dijkstra_visitor<>; PredecessorMap = dummy_property_map; DistanceMap = vec_adj_list_vertex_property_map, property >, no_property, listS>, adjacency_list, property >, no_property, listS>*, double, double&, vertex_distance_t>; WeightMap = adj_list_edge_property_map >, edge_weight2_t>; IndexMap = vec_adj_list_vertex_id_map, long unsigned int>; Compare = std::less; Combine = closed_plus; DistZero = double; ColorMap = two_bit_color_map, long unsigned int> >]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/dijkstra_shortest_paths.hpp:464:36: required from ‘void boost::dijkstra_shortest_paths(const VertexListGraph&, SourceInputIter, SourceInputIter, PredecessorMap, DistanceMap, WeightMap, IndexMap, Compare, Combine, DistInf, DistZero, DijkstraVisitor, ColorMap) [with VertexListGraph = adjacency_list, property >, no_property, listS>; SourceInputIter = long unsigned int*; DijkstraVisitor = dijkstra_visitor<>; PredecessorMap = dummy_property_map; DistanceMap = vec_adj_list_vertex_property_map, property >, no_property, listS>, adjacency_list, property >, no_property, listS>*, double, double&, vertex_distance_t>; WeightMap = adj_list_edge_property_map >, edge_weight2_t>; IndexMap = vec_adj_list_vertex_id_map, long unsigned int>; Compare = std::less; Combine = closed_plus; DistInf = double; DistZero = double; ColorMap = two_bit_color_map, long unsigned int> >]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/dijkstra_shortest_paths.hpp:417:28: required from ‘void boost::dijkstra_shortest_paths(const VertexListGraph&, SourceInputIter, SourceInputIter, PredecessorMap, DistanceMap, WeightMap, IndexMap, Compare, Combine, DistInf, DistZero, DijkstraVisitor, const bgl_named_params&, typename enable_if_c::traversal_category>::value, graph::detail::no_parameter>::type) [with VertexListGraph = adjacency_list, property >, no_property, listS>; SourceInputIter = long unsigned int*; DijkstraVisitor = dijkstra_visitor<>; PredecessorMap = dummy_property_map; DistanceMap = vec_adj_list_vertex_property_map, property >, no_property, listS>, adjacency_list, property >, no_property, listS>*, double, double&, vertex_distance_t>; WeightMap = adj_list_edge_property_map >, edge_weight2_t>; IndexMap = vec_adj_list_vertex_id_map, long unsigned int>; Compare = std::less; Combine = closed_plus; DistInf = double; DistZero = double; T = char; Tag = detail::unused_tag_type; Base = no_property; typename enable_if_c::traversal_category>::value, graph::detail::no_parameter>::type = graph::detail::no_parameter; typename graph_traits::traversal_category = adj_list_dir_traversal_tag]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/dijkstra_shortest_paths.hpp:491:28: required from ‘void boost::dijkstra_shortest_paths(const VertexListGraph&, SourceInputIter, SourceInputIter, PredecessorMap, DistanceMap, WeightMap, IndexMap, Compare, Combine, DistInf, DistZero, DijkstraVisitor) [with VertexListGraph = adjacency_list, property >, no_property, listS>; SourceInputIter = long unsigned int*; DijkstraVisitor = dijkstra_visitor<>; PredecessorMap = dummy_property_map; DistanceMap = vec_adj_list_vertex_property_map, property >, no_property, listS>, adjacency_list, property >, no_property, listS>*, double, double&, vertex_distance_t>; WeightMap = adj_list_edge_property_map >, edge_weight2_t>; IndexMap = vec_adj_list_vertex_id_map, long unsigned int>; Compare = std::less; Combine = closed_plus; DistInf = double; DistZero = double]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/dijkstra_shortest_paths.hpp:505:28: required from ‘void boost::dijkstra_shortest_paths(const VertexListGraph&, typename graph_traits::vertex_descriptor, PredecessorMap, DistanceMap, WeightMap, IndexMap, Compare, Combine, DistInf, DistZero, DijkstraVisitor) [with VertexListGraph = adjacency_list, property >, no_property, listS>; DijkstraVisitor = dijkstra_visitor<>; PredecessorMap = dummy_property_map; DistanceMap = vec_adj_list_vertex_property_map, property >, no_property, listS>, adjacency_list, property >, no_property, listS>*, double, double&, vertex_distance_t>; WeightMap = adj_list_edge_property_map >, edge_weight2_t>; IndexMap = vec_adj_list_vertex_id_map, long unsigned int>; Compare = std::less; Combine = closed_plus; DistInf = double; DistZero = double; typename graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/johnson_all_pairs_shortest.hpp:127:36: required from ‘bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, VertexID, Weight, const BinaryPredicate&, const BinaryFunction&, const Infinity&, DistanceZero) [with VertexAndEdgeListGraph = R_adjacency_list; DistanceMatrix = Basic2DMatrix; VertexID = vec_adj_list_vertex_id_map, long unsigned int>; Weight = adj_list_edge_property_map, edge_weight_t>; BinaryPredicate = std::less; BinaryFunction = closed_plus; Infinity = double; DistanceZero = double]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/johnson_all_pairs_shortest.hpp:164:48: required from ‘bool boost::detail::johnson_dispatch(VertexAndEdgeListGraph&, DistanceMatrix&, const boost::bgl_named_params&, Weight, VertexID) [with VertexAndEdgeListGraph = R_adjacency_list; DistanceMatrix = Basic2DMatrix; P = int; T = int; R = boost::no_property; Weight = boost::adj_list_edge_property_map, boost::edge_weight_t>; VertexID = boost::vec_adj_list_vertex_id_map, long unsigned int>]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/johnson_all_pairs_shortest.hpp:192:36: required from ‘bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&) [with VertexAndEdgeListGraph = R_adjacency_list; DistanceMatrix = Basic2DMatrix]’ shortestPath.cpp:56:41: required from here /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/graph_concepts.hpp:75:15: note: in a call to non-static member function ‘boost::concepts::IncidenceGraphConcept, boost::property >, boost::no_property, boost::listS> >::~IncidenceGraphConcept()’ 75 | BOOST_concept(IncidenceGraph, (G)) : Graph< G > | ^~~~~~~~~~~~~~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/preprocessor/cat.hpp:29:34: note: in definition of macro ‘BOOST_PP_CAT_I’ 29 | # define BOOST_PP_CAT_I(a, b) a ## b | ^ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/concept_def.hpp:23:12: note: in expansion of macro ‘BOOST_PP_CAT’ 23 | struct BOOST_PP_CAT(name,Concept) \ | ^~~~~~~~~~~~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/graph_concepts.hpp:75:1: note: in expansion of macro ‘BOOST_concept’ 75 | BOOST_concept(IncidenceGraph, (G)) : Graph< G > | ^~~~~~~~~~~~~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::constraint::failed() [with Model = boost::BFSVisitorConcept, boost::d_ary_heap_indirect, long unsigned int>, long unsigned int, long unsigned int&>, boost::vec_adj_list_vertex_property_map, boost::property >, boost::no_property, boost::listS>, boost::adjacency_list, boost::property >, boost::no_property, boost::listS>*, double, double&, boost::vertex_distance_t>, std::less, std::vector >, boost::adj_list_edge_property_map >, boost::edge_weight2_t>, boost::dummy_property_map, boost::vec_adj_list_vertex_property_map, boost::property >, boost::no_property, boost::listS>, boost::adjacency_list, boost::property >, boost::no_property, boost::listS>*, double, double&, boost::vertex_distance_t>, boost::closed_plus, std::less >, boost::adjacency_list, boost::property >, boost::no_property, boost::listS> >]’: /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/breadth_first_search.hpp:65:5: required from ‘void boost::breadth_first_visit(const IncidenceGraph&, SourceIterator, SourceIterator, Buffer&, BFSVisitor, ColorMap) [with IncidenceGraph = adjacency_list, property >, no_property, listS>; Buffer = d_ary_heap_indirect, long unsigned int>, long unsigned int, long unsigned int&>, vec_adj_list_vertex_property_map, property >, no_property, listS>, adjacency_list, property >, no_property, listS>*, double, double&, vertex_distance_t>, std::less, std::vector >; BFSVisitor = detail::dijkstra_bfs_visitor, d_ary_heap_indirect, long unsigned int>, long unsigned int, long unsigned int&>, vec_adj_list_vertex_property_map, property >, no_property, listS>, adjacency_list, property >, no_property, listS>*, double, double&, vertex_distance_t>, std::less, std::vector >, adj_list_edge_property_map >, edge_weight2_t>, dummy_property_map, vec_adj_list_vertex_property_map, property >, no_property, listS>, adjacency_list, property >, no_property, listS>*, double, double&, vertex_distance_t>, closed_plus, std::less >; ColorMap = two_bit_color_map, long unsigned int> >; SourceIterator = long unsigned int*]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/dijkstra_shortest_paths.hpp:387:24: required from ‘void boost::dijkstra_shortest_paths_no_init(const Graph&, SourceInputIter, SourceInputIter, PredecessorMap, DistanceMap, WeightMap, IndexMap, Compare, Combine, DistZero, DijkstraVisitor, ColorMap) [with Graph = adjacency_list, property >, no_property, listS>; SourceInputIter = long unsigned int*; DijkstraVisitor = dijkstra_visitor<>; PredecessorMap = dummy_property_map; DistanceMap = vec_adj_list_vertex_property_map, property >, no_property, listS>, adjacency_list, property >, no_property, listS>*, double, double&, vertex_distance_t>; WeightMap = adj_list_edge_property_map >, edge_weight2_t>; IndexMap = vec_adj_list_vertex_id_map, long unsigned int>; Compare = std::less; Combine = closed_plus; DistZero = double; ColorMap = two_bit_color_map, long unsigned int> >]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/dijkstra_shortest_paths.hpp:464:36: required from ‘void boost::dijkstra_shortest_paths(const VertexListGraph&, SourceInputIter, SourceInputIter, PredecessorMap, DistanceMap, WeightMap, IndexMap, Compare, Combine, DistInf, DistZero, DijkstraVisitor, ColorMap) [with VertexListGraph = adjacency_list, property >, no_property, listS>; SourceInputIter = long unsigned int*; DijkstraVisitor = dijkstra_visitor<>; PredecessorMap = dummy_property_map; DistanceMap = vec_adj_list_vertex_property_map, property >, no_property, listS>, adjacency_list, property >, no_property, listS>*, double, double&, vertex_distance_t>; WeightMap = adj_list_edge_property_map >, edge_weight2_t>; IndexMap = vec_adj_list_vertex_id_map, long unsigned int>; Compare = std::less; Combine = closed_plus; DistInf = double; DistZero = double; ColorMap = two_bit_color_map, long unsigned int> >]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/dijkstra_shortest_paths.hpp:417:28: required from ‘void boost::dijkstra_shortest_paths(const VertexListGraph&, SourceInputIter, SourceInputIter, PredecessorMap, DistanceMap, WeightMap, IndexMap, Compare, Combine, DistInf, DistZero, DijkstraVisitor, const bgl_named_params&, typename enable_if_c::traversal_category>::value, graph::detail::no_parameter>::type) [with VertexListGraph = adjacency_list, property >, no_property, listS>; SourceInputIter = long unsigned int*; DijkstraVisitor = dijkstra_visitor<>; PredecessorMap = dummy_property_map; DistanceMap = vec_adj_list_vertex_property_map, property >, no_property, listS>, adjacency_list, property >, no_property, listS>*, double, double&, vertex_distance_t>; WeightMap = adj_list_edge_property_map >, edge_weight2_t>; IndexMap = vec_adj_list_vertex_id_map, long unsigned int>; Compare = std::less; Combine = closed_plus; DistInf = double; DistZero = double; T = char; Tag = detail::unused_tag_type; Base = no_property; typename enable_if_c::traversal_category>::value, graph::detail::no_parameter>::type = graph::detail::no_parameter; typename graph_traits::traversal_category = adj_list_dir_traversal_tag]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/dijkstra_shortest_paths.hpp:491:28: required from ‘void boost::dijkstra_shortest_paths(const VertexListGraph&, SourceInputIter, SourceInputIter, PredecessorMap, DistanceMap, WeightMap, IndexMap, Compare, Combine, DistInf, DistZero, DijkstraVisitor) [with VertexListGraph = adjacency_list, property >, no_property, listS>; SourceInputIter = long unsigned int*; DijkstraVisitor = dijkstra_visitor<>; PredecessorMap = dummy_property_map; DistanceMap = vec_adj_list_vertex_property_map, property >, no_property, listS>, adjacency_list, property >, no_property, listS>*, double, double&, vertex_distance_t>; WeightMap = adj_list_edge_property_map >, edge_weight2_t>; IndexMap = vec_adj_list_vertex_id_map, long unsigned int>; Compare = std::less; Combine = closed_plus; DistInf = double; DistZero = double]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/dijkstra_shortest_paths.hpp:505:28: required from ‘void boost::dijkstra_shortest_paths(const VertexListGraph&, typename graph_traits::vertex_descriptor, PredecessorMap, DistanceMap, WeightMap, IndexMap, Compare, Combine, DistInf, DistZero, DijkstraVisitor) [with VertexListGraph = adjacency_list, property >, no_property, listS>; DijkstraVisitor = dijkstra_visitor<>; PredecessorMap = dummy_property_map; DistanceMap = vec_adj_list_vertex_property_map, property >, no_property, listS>, adjacency_list, property >, no_property, listS>*, double, double&, vertex_distance_t>; WeightMap = adj_list_edge_property_map >, edge_weight2_t>; IndexMap = vec_adj_list_vertex_id_map, long unsigned int>; Compare = std::less; Combine = closed_plus; DistInf = double; DistZero = double; typename graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/johnson_all_pairs_shortest.hpp:127:36: required from ‘bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, VertexID, Weight, const BinaryPredicate&, const BinaryFunction&, const Infinity&, DistanceZero) [with VertexAndEdgeListGraph = R_adjacency_list; DistanceMatrix = Basic2DMatrix; VertexID = vec_adj_list_vertex_id_map, long unsigned int>; Weight = adj_list_edge_property_map, edge_weight_t>; BinaryPredicate = std::less; BinaryFunction = closed_plus; Infinity = double; DistanceZero = double]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/johnson_all_pairs_shortest.hpp:164:48: required from ‘bool boost::detail::johnson_dispatch(VertexAndEdgeListGraph&, DistanceMatrix&, const boost::bgl_named_params&, Weight, VertexID) [with VertexAndEdgeListGraph = R_adjacency_list; DistanceMatrix = Basic2DMatrix; P = int; T = int; R = boost::no_property; Weight = boost::adj_list_edge_property_map, boost::edge_weight_t>; VertexID = boost::vec_adj_list_vertex_id_map, long unsigned int>]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/johnson_all_pairs_shortest.hpp:192:36: required from ‘bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&) [with VertexAndEdgeListGraph = R_adjacency_list; DistanceMatrix = Basic2DMatrix]’ shortestPath.cpp:56:41: required from here /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:65:52: warning: ‘this’ pointer is null [-Wnonnull] 65 | static void failed() { ((Model*)0)->constraints(); } | ~~~~~~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/breadth_first_search.hpp:37:10: note: in a call to non-static member function ‘void boost::BFSVisitorConcept::constraints() [with Visitor = boost::detail::dijkstra_bfs_visitor, boost::d_ary_heap_indirect, long unsigned int>, long unsigned int, long unsigned int&>, boost::vec_adj_list_vertex_property_map, boost::property >, boost::no_property, boost::listS>, boost::adjacency_list, boost::property >, boost::no_property, boost::listS>*, double, double&, boost::vertex_distance_t>, std::less, std::vector >, boost::adj_list_edge_property_map >, boost::edge_weight2_t>, boost::dummy_property_map, boost::vec_adj_list_vertex_property_map, boost::property >, boost::no_property, boost::listS>, boost::adjacency_list, boost::property >, boost::no_property, boost::listS>*, double, double&, boost::vertex_distance_t>, boost::closed_plus, std::less >; Graph = boost::adjacency_list, boost::property >, boost::no_property, boost::listS>]’ 37 | void constraints() | ^~~~~~~~~~~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::constraint::failed() [with Model = boost::ReadWritePropertyMapConcept, long unsigned int> >, long unsigned int>]’: /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/breadth_first_search.hpp:66:5: required from ‘void boost::breadth_first_visit(const IncidenceGraph&, SourceIterator, SourceIterator, Buffer&, BFSVisitor, ColorMap) [with IncidenceGraph = adjacency_list, property >, no_property, listS>; Buffer = d_ary_heap_indirect, long unsigned int>, long unsigned int, long unsigned int&>, vec_adj_list_vertex_property_map, property >, no_property, listS>, adjacency_list, property >, no_property, listS>*, double, double&, vertex_distance_t>, std::less, std::vector >; BFSVisitor = detail::dijkstra_bfs_visitor, d_ary_heap_indirect, long unsigned int>, long unsigned int, long unsigned int&>, vec_adj_list_vertex_property_map, property >, no_property, listS>, adjacency_list, property >, no_property, listS>*, double, double&, vertex_distance_t>, std::less, std::vector >, adj_list_edge_property_map >, edge_weight2_t>, dummy_property_map, vec_adj_list_vertex_property_map, property >, no_property, listS>, adjacency_list, property >, no_property, listS>*, double, double&, vertex_distance_t>, closed_plus, std::less >; ColorMap = two_bit_color_map, long unsigned int> >; SourceIterator = long unsigned int*]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/dijkstra_shortest_paths.hpp:387:24: required from ‘void boost::dijkstra_shortest_paths_no_init(const Graph&, SourceInputIter, SourceInputIter, PredecessorMap, DistanceMap, WeightMap, IndexMap, Compare, Combine, DistZero, DijkstraVisitor, ColorMap) [with Graph = adjacency_list, property >, no_property, listS>; SourceInputIter = long unsigned int*; DijkstraVisitor = dijkstra_visitor<>; PredecessorMap = dummy_property_map; DistanceMap = vec_adj_list_vertex_property_map, property >, no_property, listS>, adjacency_list, property >, no_property, listS>*, double, double&, vertex_distance_t>; WeightMap = adj_list_edge_property_map >, edge_weight2_t>; IndexMap = vec_adj_list_vertex_id_map, long unsigned int>; Compare = std::less; Combine = closed_plus; DistZero = double; ColorMap = two_bit_color_map, long unsigned int> >]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/dijkstra_shortest_paths.hpp:464:36: required from ‘void boost::dijkstra_shortest_paths(const VertexListGraph&, SourceInputIter, SourceInputIter, PredecessorMap, DistanceMap, WeightMap, IndexMap, Compare, Combine, DistInf, DistZero, DijkstraVisitor, ColorMap) [with VertexListGraph = adjacency_list, property >, no_property, listS>; SourceInputIter = long unsigned int*; DijkstraVisitor = dijkstra_visitor<>; PredecessorMap = dummy_property_map; DistanceMap = vec_adj_list_vertex_property_map, property >, no_property, listS>, adjacency_list, property >, no_property, listS>*, double, double&, vertex_distance_t>; WeightMap = adj_list_edge_property_map >, edge_weight2_t>; IndexMap = vec_adj_list_vertex_id_map, long unsigned int>; Compare = std::less; Combine = closed_plus; DistInf = double; DistZero = double; ColorMap = two_bit_color_map, long unsigned int> >]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/dijkstra_shortest_paths.hpp:417:28: required from ‘void boost::dijkstra_shortest_paths(const VertexListGraph&, SourceInputIter, SourceInputIter, PredecessorMap, DistanceMap, WeightMap, IndexMap, Compare, Combine, DistInf, DistZero, DijkstraVisitor, const bgl_named_params&, typename enable_if_c::traversal_category>::value, graph::detail::no_parameter>::type) [with VertexListGraph = adjacency_list, property >, no_property, listS>; SourceInputIter = long unsigned int*; DijkstraVisitor = dijkstra_visitor<>; PredecessorMap = dummy_property_map; DistanceMap = vec_adj_list_vertex_property_map, property >, no_property, listS>, adjacency_list, property >, no_property, listS>*, double, double&, vertex_distance_t>; WeightMap = adj_list_edge_property_map >, edge_weight2_t>; IndexMap = vec_adj_list_vertex_id_map, long unsigned int>; Compare = std::less; Combine = closed_plus; DistInf = double; DistZero = double; T = char; Tag = detail::unused_tag_type; Base = no_property; typename enable_if_c::traversal_category>::value, graph::detail::no_parameter>::type = graph::detail::no_parameter; typename graph_traits::traversal_category = adj_list_dir_traversal_tag]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/dijkstra_shortest_paths.hpp:491:28: required from ‘void boost::dijkstra_shortest_paths(const VertexListGraph&, SourceInputIter, SourceInputIter, PredecessorMap, DistanceMap, WeightMap, IndexMap, Compare, Combine, DistInf, DistZero, DijkstraVisitor) [with VertexListGraph = adjacency_list, property >, no_property, listS>; SourceInputIter = long unsigned int*; DijkstraVisitor = dijkstra_visitor<>; PredecessorMap = dummy_property_map; DistanceMap = vec_adj_list_vertex_property_map, property >, no_property, listS>, adjacency_list, property >, no_property, listS>*, double, double&, vertex_distance_t>; WeightMap = adj_list_edge_property_map >, edge_weight2_t>; IndexMap = vec_adj_list_vertex_id_map, long unsigned int>; Compare = std::less; Combine = closed_plus; DistInf = double; DistZero = double]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/dijkstra_shortest_paths.hpp:505:28: required from ‘void boost::dijkstra_shortest_paths(const VertexListGraph&, typename graph_traits::vertex_descriptor, PredecessorMap, DistanceMap, WeightMap, IndexMap, Compare, Combine, DistInf, DistZero, DijkstraVisitor) [with VertexListGraph = adjacency_list, property >, no_property, listS>; DijkstraVisitor = dijkstra_visitor<>; PredecessorMap = dummy_property_map; DistanceMap = vec_adj_list_vertex_property_map, property >, no_property, listS>, adjacency_list, property >, no_property, listS>*, double, double&, vertex_distance_t>; WeightMap = adj_list_edge_property_map >, edge_weight2_t>; IndexMap = vec_adj_list_vertex_id_map, long unsigned int>; Compare = std::less; Combine = closed_plus; DistInf = double; DistZero = double; typename graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/johnson_all_pairs_shortest.hpp:127:36: required from ‘bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, VertexID, Weight, const BinaryPredicate&, const BinaryFunction&, const Infinity&, DistanceZero) [with VertexAndEdgeListGraph = R_adjacency_list; DistanceMatrix = Basic2DMatrix; VertexID = vec_adj_list_vertex_id_map, long unsigned int>; Weight = adj_list_edge_property_map, edge_weight_t>; BinaryPredicate = std::less; BinaryFunction = closed_plus; Infinity = double; DistanceZero = double]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/johnson_all_pairs_shortest.hpp:164:48: required from ‘bool boost::detail::johnson_dispatch(VertexAndEdgeListGraph&, DistanceMatrix&, const boost::bgl_named_params&, Weight, VertexID) [with VertexAndEdgeListGraph = R_adjacency_list; DistanceMatrix = Basic2DMatrix; P = int; T = int; R = boost::no_property; Weight = boost::adj_list_edge_property_map, boost::edge_weight_t>; VertexID = boost::vec_adj_list_vertex_id_map, long unsigned int>]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/johnson_all_pairs_shortest.hpp:192:36: required from ‘bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&) [with VertexAndEdgeListGraph = R_adjacency_list; DistanceMatrix = Basic2DMatrix]’ shortestPath.cpp:56:41: required from here /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:65:52: warning: ‘this’ pointer is null [-Wnonnull] 65 | static void failed() { ((Model*)0)->constraints(); } | ~~~~~~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/property_map/property_map.hpp:205:10: note: in a call to non-static member function ‘void boost::ReadWritePropertyMapConcept::constraints() [with PMap = boost::two_bit_color_map, long unsigned int> >; Key = long unsigned int]’ 205 | void constraints() { | ^~~~~~~~~~~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::Assignable, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator >*, std::vector >, std::allocator > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::adjacency_list > > >]’: /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator >*, std::vector >, std::allocator > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::adjacency_list > > > >]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:145:5: required from ‘struct boost::Assignable, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator >*, std::vector >, std::allocator > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::adjacency_list > > >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:502:3: required from ‘struct boost::InputIterator, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator >*, std::vector >, std::allocator > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::adjacency_list > > >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::InputIterator, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator >*, std::vector >, std::allocator > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::adjacency_list > > >]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator >*, std::vector >, std::allocator > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::adjacency_list > > > >::value’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:45:51: [ skipping 5 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/graph_concepts.hpp:226:1: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::EdgeListGraphConcept > >]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/bellman_ford_shortest_paths.hpp:97:5: required from ‘bool boost::bellman_ford_shortest_paths(EdgeListGraph&, Size, WeightMap, PredecessorMap, DistanceMap, BinaryFunction, BinaryPredicate, BellmanFordVisitor) [with EdgeListGraph = adjacency_list >; Size = int; WeightMap = adj_list_edge_property_map, edge_weight_t>; PredecessorMap = long unsigned int*; DistanceMap = double*; BinaryFunction = closed_plus; BinaryPredicate = std::less; BellmanFordVisitor = bellman_visitor<>]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/bellman_ford_shortest_paths.hpp:176:43: required from ‘bool boost::detail::bellman_dispatch2(VertexAndEdgeListGraph&, boost::param_not_found, Size, WeightMap, PredecessorMap, DistanceMap, const boost::bgl_named_params&) [with VertexAndEdgeListGraph = boost::adjacency_list >; Size = int; WeightMap = boost::adj_list_edge_property_map, boost::edge_weight_t>; PredecessorMap = long unsigned int*; DistanceMap = double*; P = double*; T = boost::vertex_distance_t; R = boost::bgl_named_params, boost::edge_weight_t>, boost::edge_weight_t, boost::no_property> >]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/bellman_ford_shortest_paths.hpp:190:41: required from ‘bool boost::detail::bellman_dispatch(EdgeListGraph&, Size, WeightMap, DistanceMap, const boost::bgl_named_params&) [with EdgeListGraph = boost::adjacency_list >; Size = int; WeightMap = boost::adj_list_edge_property_map, boost::edge_weight_t>; DistanceMap = double*; P = double*; T = boost::vertex_distance_t; R = boost::bgl_named_params, boost::edge_weight_t>, boost::edge_weight_t, boost::no_property> >]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/bellman_ford_shortest_paths.hpp:201:36: required from ‘bool boost::bellman_ford_shortest_paths(EdgeListGraph&, Size, const bgl_named_params&) [with EdgeListGraph = adjacency_list >; Size = int; P = double*; T = vertex_distance_t; R = bgl_named_params, edge_weight_t>, edge_weight_t, no_property> >]’ shortestPath.cpp:105:45: required from here /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::Assignable::~Assignable() [with TT = boost::detail::adj_list_edge_iterator, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator >*, std::vector >, std::allocator > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::adjacency_list > >]’ 37 | ~model() | ^ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:145:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 145 | BOOST_CONCEPT_USAGE(Assignable) { | ^~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::EqualityComparable, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator >*, std::vector >, std::allocator > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::adjacency_list > > >]’: /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator >*, std::vector >, std::allocator > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::adjacency_list > > > >]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:233:5: required from ‘struct boost::EqualityComparable, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator >*, std::vector >, std::allocator > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::adjacency_list > > >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:502:3: required from ‘struct boost::InputIterator, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator >*, std::vector >, std::allocator > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::adjacency_list > > >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::InputIterator, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator >*, std::vector >, std::allocator > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::adjacency_list > > >]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator >*, std::vector >, std::allocator > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::adjacency_list > > > >::value’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:45:51: [ skipping 5 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/graph_concepts.hpp:226:1: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::EdgeListGraphConcept > >]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/bellman_ford_shortest_paths.hpp:97:5: required from ‘bool boost::bellman_ford_shortest_paths(EdgeListGraph&, Size, WeightMap, PredecessorMap, DistanceMap, BinaryFunction, BinaryPredicate, BellmanFordVisitor) [with EdgeListGraph = adjacency_list >; Size = int; WeightMap = adj_list_edge_property_map, edge_weight_t>; PredecessorMap = long unsigned int*; DistanceMap = double*; BinaryFunction = closed_plus; BinaryPredicate = std::less; BellmanFordVisitor = bellman_visitor<>]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/bellman_ford_shortest_paths.hpp:176:43: required from ‘bool boost::detail::bellman_dispatch2(VertexAndEdgeListGraph&, boost::param_not_found, Size, WeightMap, PredecessorMap, DistanceMap, const boost::bgl_named_params&) [with VertexAndEdgeListGraph = boost::adjacency_list >; Size = int; WeightMap = boost::adj_list_edge_property_map, boost::edge_weight_t>; PredecessorMap = long unsigned int*; DistanceMap = double*; P = double*; T = boost::vertex_distance_t; R = boost::bgl_named_params, boost::edge_weight_t>, boost::edge_weight_t, boost::no_property> >]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/bellman_ford_shortest_paths.hpp:190:41: required from ‘bool boost::detail::bellman_dispatch(EdgeListGraph&, Size, WeightMap, DistanceMap, const boost::bgl_named_params&) [with EdgeListGraph = boost::adjacency_list >; Size = int; WeightMap = boost::adj_list_edge_property_map, boost::edge_weight_t>; DistanceMap = double*; P = double*; T = boost::vertex_distance_t; R = boost::bgl_named_params, boost::edge_weight_t>, boost::edge_weight_t, boost::no_property> >]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/bellman_ford_shortest_paths.hpp:201:36: required from ‘bool boost::bellman_ford_shortest_paths(EdgeListGraph&, Size, const bgl_named_params&) [with EdgeListGraph = adjacency_list >; Size = int; P = double*; T = vertex_distance_t; R = bgl_named_params, edge_weight_t>, edge_weight_t, no_property> >]’ shortestPath.cpp:105:45: required from here /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::EqualityComparable::~EqualityComparable() [with TT = boost::detail::adj_list_edge_iterator, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator >*, std::vector >, std::allocator > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::adjacency_list > >]’ 37 | ~model() | ^ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:233:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 233 | BOOST_CONCEPT_USAGE(EqualityComparable) { | ^~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::InputIterator, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator >*, std::vector >, std::allocator > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::adjacency_list > > >]’: /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator >*, std::vector >, std::allocator > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::adjacency_list > > > >]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:512:7: required from ‘struct boost::InputIterator, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator >*, std::vector >, std::allocator > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::adjacency_list > > >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::InputIterator, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator >*, std::vector >, std::allocator > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::adjacency_list > > >]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator >*, std::vector >, std::allocator > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::adjacency_list > > > >::value’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator >*, std::vector >, std::allocator > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::adjacency_list > > > >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:72:8: [ skipping 4 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/graph_concepts.hpp:226:1: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::EdgeListGraphConcept > >]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/bellman_ford_shortest_paths.hpp:97:5: required from ‘bool boost::bellman_ford_shortest_paths(EdgeListGraph&, Size, WeightMap, PredecessorMap, DistanceMap, BinaryFunction, BinaryPredicate, BellmanFordVisitor) [with EdgeListGraph = adjacency_list >; Size = int; WeightMap = adj_list_edge_property_map, edge_weight_t>; PredecessorMap = long unsigned int*; DistanceMap = double*; BinaryFunction = closed_plus; BinaryPredicate = std::less; BellmanFordVisitor = bellman_visitor<>]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/bellman_ford_shortest_paths.hpp:176:43: required from ‘bool boost::detail::bellman_dispatch2(VertexAndEdgeListGraph&, boost::param_not_found, Size, WeightMap, PredecessorMap, DistanceMap, const boost::bgl_named_params&) [with VertexAndEdgeListGraph = boost::adjacency_list >; Size = int; WeightMap = boost::adj_list_edge_property_map, boost::edge_weight_t>; PredecessorMap = long unsigned int*; DistanceMap = double*; P = double*; T = boost::vertex_distance_t; R = boost::bgl_named_params, boost::edge_weight_t>, boost::edge_weight_t, boost::no_property> >]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/bellman_ford_shortest_paths.hpp:190:41: required from ‘bool boost::detail::bellman_dispatch(EdgeListGraph&, Size, WeightMap, DistanceMap, const boost::bgl_named_params&) [with EdgeListGraph = boost::adjacency_list >; Size = int; WeightMap = boost::adj_list_edge_property_map, boost::edge_weight_t>; DistanceMap = double*; P = double*; T = boost::vertex_distance_t; R = boost::bgl_named_params, boost::edge_weight_t>, boost::edge_weight_t, boost::no_property> >]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/bellman_ford_shortest_paths.hpp:201:36: required from ‘bool boost::bellman_ford_shortest_paths(EdgeListGraph&, Size, const bgl_named_params&) [with EdgeListGraph = adjacency_list >; Size = int; P = double*; T = vertex_distance_t; R = bgl_named_params, edge_weight_t>, edge_weight_t, no_property> >]’ shortestPath.cpp:105:45: required from here /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::InputIterator::~InputIterator() [with TT = boost::detail::adj_list_edge_iterator, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator >*, std::vector >, std::allocator > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::adjacency_list > >]’ 37 | ~model() | ^ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:512:7: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 512 | BOOST_CONCEPT_USAGE(InputIterator) | ^~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements >]’: /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:208:5: required from ‘struct boost::Convertible’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::Convertible]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied >::value’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_)>’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:515:9: [ skipping 4 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/graph_concepts.hpp:235:9: required from ‘boost::concepts::EdgeListGraph::~EdgeListGraph() [with G = R_adjacency_list]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/graph_concepts.hpp:226:1: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::EdgeListGraphConcept >]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/bellman_ford_shortest_paths.hpp:97:5: required from ‘bool boost::floyd_warshall_all_pairs_shortest_paths(const VertexAndEdgeListGraph&, DistanceMatrix&, const WeightMap&, const BinaryPredicate&, const BinaryFunction&, const Infinity&, const Zero&) [with VertexAndEdgeListGraph = R_adjacency_list; DistanceMatrix = Basic2DMatrix; WeightMap = adj_list_edge_property_map, edge_weight_t>; BinaryPredicate = std::less; BinaryFunction = closed_plus; Infinity = double; Zero = double]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/floyd_warshall_shortest.hpp:172:55: required from ‘bool boost::detail::floyd_warshall_noninit_dispatch(const VertexAndEdgeListGraph&, DistanceMatrix&, WeightMap, const boost::bgl_named_params&) [with VertexAndEdgeListGraph = R_adjacency_list; DistanceMatrix = Basic2DMatrix; WeightMap = boost::adj_list_edge_property_map, boost::edge_weight_t>; P = int; T = int; R = boost::no_property]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/floyd_warshall_shortest.hpp:217:51: required from ‘bool boost::floyd_warshall_all_pairs_shortest_paths(const VertexAndEdgeListGraph&, DistanceMatrix&) [with VertexAndEdgeListGraph = R_adjacency_list; DistanceMatrix = Basic2DMatrix]’ shortestPath.cpp:186:48: required from here /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::Convertible]’ 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ^ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::Convertible]’: /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:515:9: required from ‘boost::InputIterator::~InputIterator() [with TT = boost::detail::adj_list_edge_iterator, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator >*, std::vector >, std::allocator > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::adjacency_list, boost::property, boost::no_property, boost::listS> >]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::InputIterator, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator >*, std::vector >, std::allocator > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::adjacency_list, boost::property, boost::no_property, boost::listS> > >]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/graph_concepts.hpp:53:35: required from ‘boost::concepts::MultiPassInputIterator::~MultiPassInputIterator() [with T = boost::detail::adj_list_edge_iterator, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator >*, std::vector >, std::allocator > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::adjacency_list, boost::property, boost::no_property, boost::listS> >]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::MultiPassInputIterator, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator >*, std::vector >, std::allocator > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::adjacency_list, boost::property, boost::no_property, boost::listS> > >]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/graph_concepts.hpp:235:9: required from ‘boost::concepts::EdgeListGraph::~EdgeListGraph() [with G = R_adjacency_list]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/graph_concepts.hpp:226:1: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::EdgeListGraphConcept >]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/bellman_ford_shortest_paths.hpp:97:5: required from ‘bool boost::floyd_warshall_all_pairs_shortest_paths(const VertexAndEdgeListGraph&, DistanceMatrix&, const WeightMap&, const BinaryPredicate&, const BinaryFunction&, const Infinity&, const Zero&) [with VertexAndEdgeListGraph = R_adjacency_list; DistanceMatrix = Basic2DMatrix; WeightMap = adj_list_edge_property_map, edge_weight_t>; BinaryPredicate = std::less; BinaryFunction = closed_plus; Infinity = double; Zero = double]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/floyd_warshall_shortest.hpp:172:55: required from ‘bool boost::detail::floyd_warshall_noninit_dispatch(const VertexAndEdgeListGraph&, DistanceMatrix&, WeightMap, const boost::bgl_named_params&) [with VertexAndEdgeListGraph = R_adjacency_list; DistanceMatrix = Basic2DMatrix; WeightMap = boost::adj_list_edge_property_map, boost::edge_weight_t>; P = int; T = int; R = boost::no_property]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/floyd_warshall_shortest.hpp:217:51: required from ‘bool boost::floyd_warshall_all_pairs_shortest_paths(const VertexAndEdgeListGraph&, DistanceMatrix&) [with VertexAndEdgeListGraph = R_adjacency_list; DistanceMatrix = Basic2DMatrix]’ shortestPath.cpp:186:48: required from here /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::Convertible::~Convertible() [with X = std::forward_iterator_tag; Y = std::input_iterator_tag]’ 37 | ~model() | ^ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:208:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 208 | BOOST_CONCEPT_USAGE(Convertible) { | ^~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements, std::input_iterator_tag> >]’: /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:208:5: required from ‘struct boost::Convertible, std::input_iterator_tag>’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::Convertible, std::input_iterator_tag>]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied, std::input_iterator_tag> >::value’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied, std::input_iterator_tag> >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_, std::input_iterator_tag>)>’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:515:9: [ skipping 4 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/graph_concepts.hpp:89:9: required from ‘boost::concepts::IncidenceGraph::~IncidenceGraph() [with G = R_adjacency_list]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/graph_concepts.hpp:75:1: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::IncidenceGraphConcept >]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/breadth_first_search.hpp:62:5: required from ‘bool boost::floyd_warshall_all_pairs_shortest_paths(const VertexAndEdgeListGraph&, DistanceMatrix&, const WeightMap&, const BinaryPredicate&, const BinaryFunction&, const Infinity&, const Zero&) [with VertexAndEdgeListGraph = R_adjacency_list; DistanceMatrix = Basic2DMatrix; WeightMap = adj_list_edge_property_map, edge_weight_t>; BinaryPredicate = std::less; BinaryFunction = closed_plus; Infinity = double; Zero = double]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/floyd_warshall_shortest.hpp:172:55: required from ‘bool boost::detail::floyd_warshall_noninit_dispatch(const VertexAndEdgeListGraph&, DistanceMatrix&, WeightMap, const boost::bgl_named_params&) [with VertexAndEdgeListGraph = R_adjacency_list; DistanceMatrix = Basic2DMatrix; WeightMap = boost::adj_list_edge_property_map, boost::edge_weight_t>; P = int; T = int; R = boost::no_property]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/floyd_warshall_shortest.hpp:217:51: required from ‘bool boost::floyd_warshall_all_pairs_shortest_paths(const VertexAndEdgeListGraph&, DistanceMatrix&) [with VertexAndEdgeListGraph = R_adjacency_list; DistanceMatrix = Basic2DMatrix]’ shortestPath.cpp:186:48: required from here /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::Convertible, std::input_iterator_tag>]’ 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ^ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::Convertible, std::input_iterator_tag>]’: /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:515:9: required from ‘boost::InputIterator::~InputIterator() [with TT = boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator >*, std::vector >, std::allocator > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::InputIterator >*, std::vector >, std::allocator > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> >]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/graph_concepts.hpp:53:35: required from ‘boost::concepts::MultiPassInputIterator::~MultiPassInputIterator() [with T = boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator >*, std::vector >, std::allocator > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::MultiPassInputIterator >*, std::vector >, std::allocator > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> >]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/graph_concepts.hpp:89:9: required from ‘boost::concepts::IncidenceGraph::~IncidenceGraph() [with G = R_adjacency_list]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/graph_concepts.hpp:75:1: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::IncidenceGraphConcept >]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/breadth_first_search.hpp:62:5: required from ‘bool boost::floyd_warshall_all_pairs_shortest_paths(const VertexAndEdgeListGraph&, DistanceMatrix&, const WeightMap&, const BinaryPredicate&, const BinaryFunction&, const Infinity&, const Zero&) [with VertexAndEdgeListGraph = R_adjacency_list; DistanceMatrix = Basic2DMatrix; WeightMap = adj_list_edge_property_map, edge_weight_t>; BinaryPredicate = std::less; BinaryFunction = closed_plus; Infinity = double; Zero = double]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/floyd_warshall_shortest.hpp:172:55: required from ‘bool boost::detail::floyd_warshall_noninit_dispatch(const VertexAndEdgeListGraph&, DistanceMatrix&, WeightMap, const boost::bgl_named_params&) [with VertexAndEdgeListGraph = R_adjacency_list; DistanceMatrix = Basic2DMatrix; WeightMap = boost::adj_list_edge_property_map, boost::edge_weight_t>; P = int; T = int; R = boost::no_property]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/floyd_warshall_shortest.hpp:217:51: required from ‘bool boost::floyd_warshall_all_pairs_shortest_paths(const VertexAndEdgeListGraph&, DistanceMatrix&) [with VertexAndEdgeListGraph = R_adjacency_list; DistanceMatrix = Basic2DMatrix]’ shortestPath.cpp:186:48: required from here /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::Convertible::~Convertible() [with X = boost::iterators::detail::iterator_category_with_traversal; Y = std::input_iterator_tag]’ 37 | ~model() | ^ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:208:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 208 | BOOST_CONCEPT_USAGE(Convertible) { | ^~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements, boost::d_ary_heap_indirect, long unsigned int>, long unsigned int, long unsigned int&>, double*, std::less, std::vector >, boost::adj_list_edge_property_map, boost::edge_weight_t>, long unsigned int*, double*, std::plus, std::less > > >]’: /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:167:5: required from ‘struct boost::CopyConstructible, boost::d_ary_heap_indirect, long unsigned int>, long unsigned int, long unsigned int&>, double*, std::less, std::vector >, boost::adj_list_edge_property_map, boost::edge_weight_t>, long unsigned int*, double*, std::plus, std::less > >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:165:3: required from ‘struct boost::CopyConstructibleConcept, boost::d_ary_heap_indirect, long unsigned int>, long unsigned int, long unsigned int&>, double*, std::less, std::vector >, boost::adj_list_edge_property_map, boost::edge_weight_t>, long unsigned int*, double*, std::plus, std::less > >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::CopyConstructibleConcept, boost::d_ary_heap_indirect, long unsigned int>, long unsigned int, long unsigned int&>, double*, std::less, std::vector >, boost::adj_list_edge_property_map, boost::edge_weight_t>, long unsigned int*, double*, std::plus, std::less > >]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied, boost::d_ary_heap_indirect, long unsigned int>, long unsigned int, long unsigned int&>, double*, std::less, std::vector >, boost::adj_list_edge_property_map, boost::edge_weight_t>, long unsigned int*, double*, std::plus, std::less > > >::value’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied, boost::d_ary_heap_indirect, long unsigned int>, long unsigned int, long unsigned int&>, double*, std::less, std::vector >, boost::adj_list_edge_property_map, boost::edge_weight_t>, long unsigned int*, double*, std::plus, std::less > > >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:72:8: [ skipping 10 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/dijkstra_shortest_paths.hpp:491:28: required from ‘void boost::dijkstra_shortest_paths(const VertexListGraph&, SourceInputIter, SourceInputIter, PredecessorMap, DistanceMap, WeightMap, IndexMap, Compare, Combine, DistInf, DistZero, DijkstraVisitor) [with VertexListGraph = R_adjacency_list; SourceInputIter = long unsigned int*; DijkstraVisitor = dijkstra_visitor<>; PredecessorMap = long unsigned int*; DistanceMap = double*; WeightMap = adj_list_edge_property_map, edge_weight_t>; IndexMap = vec_adj_list_vertex_id_map, long unsigned int>; Compare = std::less; Combine = std::plus; DistInf = double; DistZero = double]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/dijkstra_shortest_paths.hpp:434:28: required from ‘void boost::dijkstra_shortest_paths(const VertexListGraph&, typename graph_traits::vertex_descriptor, PredecessorMap, DistanceMap, WeightMap, IndexMap, Compare, Combine, DistInf, DistZero, DijkstraVisitor, const bgl_named_params&, typename enable_if_c::traversal_category>::value, graph::detail::no_parameter>::type) [with VertexListGraph = R_adjacency_list; DijkstraVisitor = dijkstra_visitor<>; PredecessorMap = long unsigned int*; DistanceMap = double*; WeightMap = adj_list_edge_property_map, edge_weight_t>; IndexMap = vec_adj_list_vertex_id_map, long unsigned int>; Compare = std::less; Combine = std::plus; DistInf = double; DistZero = double; T = double*; Tag = vertex_distance_t; Base = bgl_named_params; typename graph_traits::vertex_descriptor = long unsigned int; typename enable_if_c::traversal_category>::value, graph::detail::no_parameter>::type = graph::detail::no_parameter; typename graph_traits::traversal_category = adj_list_dir_traversal_tag]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/dijkstra_shortest_paths.hpp:528:32: required from ‘void boost::detail::dijkstra_dispatch2(const VertexListGraph&, typename boost::graph_traits::vertex_descriptor, DistanceMap, WeightMap, IndexMap, const Params&) [with VertexListGraph = R_adjacency_list; DistanceMap = double*; WeightMap = boost::adj_list_edge_property_map, boost::edge_weight_t>; IndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>; Params = boost::bgl_named_params >; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/dijkstra_shortest_paths.hpp:554:35: required from ‘void boost::detail::dijkstra_dispatch1(const VertexListGraph&, typename boost::graph_traits::vertex_descriptor, DistanceMap, WeightMap, IndexMap, const Params&) [with VertexListGraph = R_adjacency_list; DistanceMap = double*; WeightMap = boost::adj_list_edge_property_map, boost::edge_weight_t>; IndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>; Params = boost::bgl_named_params >; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/dijkstra_shortest_paths.hpp:570:31: required from ‘void boost::dijkstra_shortest_paths(const VertexListGraph&, typename graph_traits::vertex_descriptor, const bgl_named_params&) [with VertexListGraph = R_adjacency_list; Param = double*; Tag = vertex_distance_t; Rest = bgl_named_params; typename graph_traits::vertex_descriptor = long unsigned int]’ shortestPath.cpp:25:32: required from here /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::CopyConstructible, boost::d_ary_heap_indirect, long unsigned int>, long unsigned int, long unsigned int&>, double*, std::less, std::vector >, boost::adj_list_edge_property_map, boost::edge_weight_t>, long unsigned int*, double*, std::plus, std::less > >]’ 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ^ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::CopyConstructibleConcept, boost::d_ary_heap_indirect, long unsigned int>, long unsigned int, long unsigned int&>, double*, std::less, std::vector >, boost::adj_list_edge_property_map, boost::edge_weight_t>, long unsigned int*, double*, std::plus, std::less > >]’: /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/breadth_first_search.hpp:39:9: required from ‘void boost::BFSVisitorConcept::constraints() [with Visitor = boost::detail::dijkstra_bfs_visitor, boost::d_ary_heap_indirect, long unsigned int>, long unsigned int, long unsigned int&>, double*, std::less, std::vector >, boost::adj_list_edge_property_map, boost::edge_weight_t>, long unsigned int*, double*, std::plus, std::less >; Graph = R_adjacency_list]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::BFSVisitorConcept, boost::d_ary_heap_indirect, long unsigned int>, long unsigned int, long unsigned int&>, double*, std::less, std::vector >, boost::adj_list_edge_property_map, boost::edge_weight_t>, long unsigned int*, double*, std::plus, std::less >, R_adjacency_list >]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied, boost::d_ary_heap_indirect, long unsigned int>, long unsigned int, long unsigned int&>, double*, std::less, std::vector >, boost::adj_list_edge_property_map, boost::edge_weight_t>, long unsigned int*, double*, std::plus, std::less >, R_adjacency_list > >::value’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied, boost::d_ary_heap_indirect, long unsigned int>, long unsigned int, long unsigned int&>, double*, std::less, std::vector >, boost::adj_list_edge_property_map, boost::edge_weight_t>, long unsigned int*, double*, std::plus, std::less >, R_adjacency_list > >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_, boost::d_ary_heap_indirect, long unsigned int>, long unsigned int, long unsigned int&>, double*, std::less, std::vector >, boost::adj_list_edge_property_map, boost::edge_weight_t>, long unsigned int*, double*, std::plus, std::less >, R_adjacency_list >)>’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/breadth_first_search.hpp:65:5: [ skipping 4 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/dijkstra_shortest_paths.hpp:491:28: required from ‘void boost::dijkstra_shortest_paths(const VertexListGraph&, SourceInputIter, SourceInputIter, PredecessorMap, DistanceMap, WeightMap, IndexMap, Compare, Combine, DistInf, DistZero, DijkstraVisitor) [with VertexListGraph = R_adjacency_list; SourceInputIter = long unsigned int*; DijkstraVisitor = dijkstra_visitor<>; PredecessorMap = long unsigned int*; DistanceMap = double*; WeightMap = adj_list_edge_property_map, edge_weight_t>; IndexMap = vec_adj_list_vertex_id_map, long unsigned int>; Compare = std::less; Combine = std::plus; DistInf = double; DistZero = double]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/dijkstra_shortest_paths.hpp:434:28: required from ‘void boost::dijkstra_shortest_paths(const VertexListGraph&, typename graph_traits::vertex_descriptor, PredecessorMap, DistanceMap, WeightMap, IndexMap, Compare, Combine, DistInf, DistZero, DijkstraVisitor, const bgl_named_params&, typename enable_if_c::traversal_category>::value, graph::detail::no_parameter>::type) [with VertexListGraph = R_adjacency_list; DijkstraVisitor = dijkstra_visitor<>; PredecessorMap = long unsigned int*; DistanceMap = double*; WeightMap = adj_list_edge_property_map, edge_weight_t>; IndexMap = vec_adj_list_vertex_id_map, long unsigned int>; Compare = std::less; Combine = std::plus; DistInf = double; DistZero = double; T = double*; Tag = vertex_distance_t; Base = bgl_named_params; typename graph_traits::vertex_descriptor = long unsigned int; typename enable_if_c::traversal_category>::value, graph::detail::no_parameter>::type = graph::detail::no_parameter; typename graph_traits::traversal_category = adj_list_dir_traversal_tag]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/dijkstra_shortest_paths.hpp:528:32: required from ‘void boost::detail::dijkstra_dispatch2(const VertexListGraph&, typename boost::graph_traits::vertex_descriptor, DistanceMap, WeightMap, IndexMap, const Params&) [with VertexListGraph = R_adjacency_list; DistanceMap = double*; WeightMap = boost::adj_list_edge_property_map, boost::edge_weight_t>; IndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>; Params = boost::bgl_named_params >; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/dijkstra_shortest_paths.hpp:554:35: required from ‘void boost::detail::dijkstra_dispatch1(const VertexListGraph&, typename boost::graph_traits::vertex_descriptor, DistanceMap, WeightMap, IndexMap, const Params&) [with VertexListGraph = R_adjacency_list; DistanceMap = double*; WeightMap = boost::adj_list_edge_property_map, boost::edge_weight_t>; IndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>; Params = boost::bgl_named_params >; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/dijkstra_shortest_paths.hpp:570:31: required from ‘void boost::dijkstra_shortest_paths(const VertexListGraph&, typename graph_traits::vertex_descriptor, const bgl_named_params&) [with VertexListGraph = R_adjacency_list; Param = double*; Tag = vertex_distance_t; Rest = bgl_named_params; typename graph_traits::vertex_descriptor = long unsigned int]’ shortestPath.cpp:25:32: required from here /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:165:17: note: in a call to non-static member function ‘boost::CopyConstructibleConcept, boost::d_ary_heap_indirect, long unsigned int>, long unsigned int, long unsigned int&>, double*, std::less, std::vector >, boost::adj_list_edge_property_map, boost::edge_weight_t>, long unsigned int*, double*, std::plus, std::less > >::~CopyConstructibleConcept()’ 165 | BOOST_concept(CopyConstructible,(TT)) | ^~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/preprocessor/cat.hpp:29:34: note: in definition of macro ‘BOOST_PP_CAT_I’ 29 | # define BOOST_PP_CAT_I(a, b) a ## b | ^ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/concept_def.hpp:23:12: note: in expansion of macro ‘BOOST_PP_CAT’ 23 | struct BOOST_PP_CAT(name,Concept) \ | ^~~~~~~~~~~~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:165:3: note: in expansion of macro ‘BOOST_concept’ 165 | BOOST_concept(CopyConstructible,(TT)) | ^~~~~~~~~~~~~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::constraint::failed() [with Model = boost::ReadablePropertyMapConcept, long unsigned int> >, long unsigned int>]’: /home/omnipath/local/R/4.4-3.20/BH/include/boost/property_map/property_map.hpp:206:7: required from ‘void boost::ReadWritePropertyMapConcept::constraints() [with PMap = boost::two_bit_color_map, long unsigned int> >; Key = long unsigned int]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::ReadWritePropertyMapConcept, long unsigned int> >, long unsigned int>]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied, long unsigned int> >, long unsigned int> >::value’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied, long unsigned int> >, long unsigned int> >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_, long unsigned int> >, long unsigned int>)>’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/breadth_first_search.hpp:66:5: [ skipping 4 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/dijkstra_shortest_paths.hpp:491:28: required from ‘void boost::dijkstra_shortest_paths(const VertexListGraph&, SourceInputIter, SourceInputIter, PredecessorMap, DistanceMap, WeightMap, IndexMap, Compare, Combine, DistInf, DistZero, DijkstraVisitor) [with VertexListGraph = R_adjacency_list; SourceInputIter = long unsigned int*; DijkstraVisitor = dijkstra_visitor<>; PredecessorMap = long unsigned int*; DistanceMap = double*; WeightMap = adj_list_edge_property_map, edge_weight_t>; IndexMap = vec_adj_list_vertex_id_map, long unsigned int>; Compare = std::less; Combine = std::plus; DistInf = double; DistZero = double]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/dijkstra_shortest_paths.hpp:434:28: required from ‘void boost::dijkstra_shortest_paths(const VertexListGraph&, typename graph_traits::vertex_descriptor, PredecessorMap, DistanceMap, WeightMap, IndexMap, Compare, Combine, DistInf, DistZero, DijkstraVisitor, const bgl_named_params&, typename enable_if_c::traversal_category>::value, graph::detail::no_parameter>::type) [with VertexListGraph = R_adjacency_list; DijkstraVisitor = dijkstra_visitor<>; PredecessorMap = long unsigned int*; DistanceMap = double*; WeightMap = adj_list_edge_property_map, edge_weight_t>; IndexMap = vec_adj_list_vertex_id_map, long unsigned int>; Compare = std::less; Combine = std::plus; DistInf = double; DistZero = double; T = double*; Tag = vertex_distance_t; Base = bgl_named_params; typename graph_traits::vertex_descriptor = long unsigned int; typename enable_if_c::traversal_category>::value, graph::detail::no_parameter>::type = graph::detail::no_parameter; typename graph_traits::traversal_category = adj_list_dir_traversal_tag]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/dijkstra_shortest_paths.hpp:528:32: required from ‘void boost::detail::dijkstra_dispatch2(const VertexListGraph&, typename boost::graph_traits::vertex_descriptor, DistanceMap, WeightMap, IndexMap, const Params&) [with VertexListGraph = R_adjacency_list; DistanceMap = double*; WeightMap = boost::adj_list_edge_property_map, boost::edge_weight_t>; IndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>; Params = boost::bgl_named_params >; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/dijkstra_shortest_paths.hpp:554:35: required from ‘void boost::detail::dijkstra_dispatch1(const VertexListGraph&, typename boost::graph_traits::vertex_descriptor, DistanceMap, WeightMap, IndexMap, const Params&) [with VertexListGraph = R_adjacency_list; DistanceMap = double*; WeightMap = boost::adj_list_edge_property_map, boost::edge_weight_t>; IndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>; Params = boost::bgl_named_params >; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/dijkstra_shortest_paths.hpp:570:31: required from ‘void boost::dijkstra_shortest_paths(const VertexListGraph&, typename graph_traits::vertex_descriptor, const bgl_named_params&) [with VertexListGraph = R_adjacency_list; Param = double*; Tag = vertex_distance_t; Rest = bgl_named_params; typename graph_traits::vertex_descriptor = long unsigned int]’ shortestPath.cpp:25:32: required from here /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:65:52: warning: ‘this’ pointer is null [-Wnonnull] 65 | static void failed() { ((Model*)0)->constraints(); } | ~~~~~~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/property_map/property_map.hpp:147:10: note: in a call to non-static member function ‘void boost::ReadablePropertyMapConcept::constraints() [with PMap = boost::two_bit_color_map, long unsigned int> >; Key = long unsigned int]’ 147 | void constraints() { | ^~~~~~~~~~~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::constraint::failed() [with Model = boost::WritablePropertyMapConcept, long unsigned int> >, long unsigned int>]’: /home/omnipath/local/R/4.4-3.20/BH/include/boost/property_map/property_map.hpp:207:7: required from ‘void boost::ReadWritePropertyMapConcept::constraints() [with PMap = boost::two_bit_color_map, long unsigned int> >; Key = long unsigned int]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::ReadWritePropertyMapConcept, long unsigned int> >, long unsigned int>]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied, long unsigned int> >, long unsigned int> >::value’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied, long unsigned int> >, long unsigned int> >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_, long unsigned int> >, long unsigned int>)>’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/breadth_first_search.hpp:66:5: [ skipping 4 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/dijkstra_shortest_paths.hpp:491:28: required from ‘void boost::dijkstra_shortest_paths(const VertexListGraph&, SourceInputIter, SourceInputIter, PredecessorMap, DistanceMap, WeightMap, IndexMap, Compare, Combine, DistInf, DistZero, DijkstraVisitor) [with VertexListGraph = R_adjacency_list; SourceInputIter = long unsigned int*; DijkstraVisitor = dijkstra_visitor<>; PredecessorMap = long unsigned int*; DistanceMap = double*; WeightMap = adj_list_edge_property_map, edge_weight_t>; IndexMap = vec_adj_list_vertex_id_map, long unsigned int>; Compare = std::less; Combine = std::plus; DistInf = double; DistZero = double]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/dijkstra_shortest_paths.hpp:434:28: required from ‘void boost::dijkstra_shortest_paths(const VertexListGraph&, typename graph_traits::vertex_descriptor, PredecessorMap, DistanceMap, WeightMap, IndexMap, Compare, Combine, DistInf, DistZero, DijkstraVisitor, const bgl_named_params&, typename enable_if_c::traversal_category>::value, graph::detail::no_parameter>::type) [with VertexListGraph = R_adjacency_list; DijkstraVisitor = dijkstra_visitor<>; PredecessorMap = long unsigned int*; DistanceMap = double*; WeightMap = adj_list_edge_property_map, edge_weight_t>; IndexMap = vec_adj_list_vertex_id_map, long unsigned int>; Compare = std::less; Combine = std::plus; DistInf = double; DistZero = double; T = double*; Tag = vertex_distance_t; Base = bgl_named_params; typename graph_traits::vertex_descriptor = long unsigned int; typename enable_if_c::traversal_category>::value, graph::detail::no_parameter>::type = graph::detail::no_parameter; typename graph_traits::traversal_category = adj_list_dir_traversal_tag]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/dijkstra_shortest_paths.hpp:528:32: required from ‘void boost::detail::dijkstra_dispatch2(const VertexListGraph&, typename boost::graph_traits::vertex_descriptor, DistanceMap, WeightMap, IndexMap, const Params&) [with VertexListGraph = R_adjacency_list; DistanceMap = double*; WeightMap = boost::adj_list_edge_property_map, boost::edge_weight_t>; IndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>; Params = boost::bgl_named_params >; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/dijkstra_shortest_paths.hpp:554:35: required from ‘void boost::detail::dijkstra_dispatch1(const VertexListGraph&, typename boost::graph_traits::vertex_descriptor, DistanceMap, WeightMap, IndexMap, const Params&) [with VertexListGraph = R_adjacency_list; DistanceMap = double*; WeightMap = boost::adj_list_edge_property_map, boost::edge_weight_t>; IndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>; Params = boost::bgl_named_params >; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/dijkstra_shortest_paths.hpp:570:31: required from ‘void boost::dijkstra_shortest_paths(const VertexListGraph&, typename graph_traits::vertex_descriptor, const bgl_named_params&) [with VertexListGraph = R_adjacency_list; Param = double*; Tag = vertex_distance_t; Rest = bgl_named_params; typename graph_traits::vertex_descriptor = long unsigned int]’ shortestPath.cpp:25:32: required from here /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:65:52: warning: ‘this’ pointer is null [-Wnonnull] 65 | static void failed() { ((Model*)0)->constraints(); } | ~~~~~~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/property_map/property_map.hpp:179:10: note: in a call to non-static member function ‘void boost::WritablePropertyMapConcept::constraints() [with PMap = boost::two_bit_color_map, long unsigned int> >; Key = long unsigned int]’ 179 | void constraints() { | ^~~~~~~~~~~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements >]’: /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:208:5: required from ‘struct boost::Convertible’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:206:3: required from ‘struct boost::ConvertibleConcept’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::ConvertibleConcept]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied >::value’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:72:8: [ skipping 10 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/dijkstra_shortest_paths.hpp:491:28: required from ‘void boost::dijkstra_shortest_paths(const VertexListGraph&, SourceInputIter, SourceInputIter, PredecessorMap, DistanceMap, WeightMap, IndexMap, Compare, Combine, DistInf, DistZero, DijkstraVisitor) [with VertexListGraph = R_adjacency_list; SourceInputIter = long unsigned int*; DijkstraVisitor = dijkstra_visitor<>; PredecessorMap = long unsigned int*; DistanceMap = double*; WeightMap = adj_list_edge_property_map, edge_weight_t>; IndexMap = vec_adj_list_vertex_id_map, long unsigned int>; Compare = std::less; Combine = std::plus; DistInf = double; DistZero = double]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/dijkstra_shortest_paths.hpp:434:28: required from ‘void boost::dijkstra_shortest_paths(const VertexListGraph&, typename graph_traits::vertex_descriptor, PredecessorMap, DistanceMap, WeightMap, IndexMap, Compare, Combine, DistInf, DistZero, DijkstraVisitor, const bgl_named_params&, typename enable_if_c::traversal_category>::value, graph::detail::no_parameter>::type) [with VertexListGraph = R_adjacency_list; DijkstraVisitor = dijkstra_visitor<>; PredecessorMap = long unsigned int*; DistanceMap = double*; WeightMap = adj_list_edge_property_map, edge_weight_t>; IndexMap = vec_adj_list_vertex_id_map, long unsigned int>; Compare = std::less; Combine = std::plus; DistInf = double; DistZero = double; T = double*; Tag = vertex_distance_t; Base = bgl_named_params; typename graph_traits::vertex_descriptor = long unsigned int; typename enable_if_c::traversal_category>::value, graph::detail::no_parameter>::type = graph::detail::no_parameter; typename graph_traits::traversal_category = adj_list_dir_traversal_tag]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/dijkstra_shortest_paths.hpp:528:32: required from ‘void boost::detail::dijkstra_dispatch2(const VertexListGraph&, typename boost::graph_traits::vertex_descriptor, DistanceMap, WeightMap, IndexMap, const Params&) [with VertexListGraph = R_adjacency_list; DistanceMap = double*; WeightMap = boost::adj_list_edge_property_map, boost::edge_weight_t>; IndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>; Params = boost::bgl_named_params >; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/dijkstra_shortest_paths.hpp:554:35: required from ‘void boost::detail::dijkstra_dispatch1(const VertexListGraph&, typename boost::graph_traits::vertex_descriptor, DistanceMap, WeightMap, IndexMap, const Params&) [with VertexListGraph = R_adjacency_list; DistanceMap = double*; WeightMap = boost::adj_list_edge_property_map, boost::edge_weight_t>; IndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>; Params = boost::bgl_named_params >; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/dijkstra_shortest_paths.hpp:570:31: required from ‘void boost::dijkstra_shortest_paths(const VertexListGraph&, typename graph_traits::vertex_descriptor, const bgl_named_params&) [with VertexListGraph = R_adjacency_list; Param = double*; Tag = vertex_distance_t; Rest = bgl_named_params; typename graph_traits::vertex_descriptor = long unsigned int]’ shortestPath.cpp:25:32: required from here /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::Convertible]’ 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ^ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::ConvertibleConcept]’: /home/omnipath/local/R/4.4-3.20/BH/include/boost/property_map/property_map.hpp:208:7: required from ‘void boost::ReadWritePropertyMapConcept::constraints() [with PMap = boost::two_bit_color_map, long unsigned int> >; Key = long unsigned int]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::ReadWritePropertyMapConcept, long unsigned int> >, long unsigned int>]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied, long unsigned int> >, long unsigned int> >::value’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied, long unsigned int> >, long unsigned int> >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_, long unsigned int> >, long unsigned int>)>’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/breadth_first_search.hpp:66:5: [ skipping 4 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/dijkstra_shortest_paths.hpp:491:28: required from ‘void boost::dijkstra_shortest_paths(const VertexListGraph&, SourceInputIter, SourceInputIter, PredecessorMap, DistanceMap, WeightMap, IndexMap, Compare, Combine, DistInf, DistZero, DijkstraVisitor) [with VertexListGraph = R_adjacency_list; SourceInputIter = long unsigned int*; DijkstraVisitor = dijkstra_visitor<>; PredecessorMap = long unsigned int*; DistanceMap = double*; WeightMap = adj_list_edge_property_map, edge_weight_t>; IndexMap = vec_adj_list_vertex_id_map, long unsigned int>; Compare = std::less; Combine = std::plus; DistInf = double; DistZero = double]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/dijkstra_shortest_paths.hpp:434:28: required from ‘void boost::dijkstra_shortest_paths(const VertexListGraph&, typename graph_traits::vertex_descriptor, PredecessorMap, DistanceMap, WeightMap, IndexMap, Compare, Combine, DistInf, DistZero, DijkstraVisitor, const bgl_named_params&, typename enable_if_c::traversal_category>::value, graph::detail::no_parameter>::type) [with VertexListGraph = R_adjacency_list; DijkstraVisitor = dijkstra_visitor<>; PredecessorMap = long unsigned int*; DistanceMap = double*; WeightMap = adj_list_edge_property_map, edge_weight_t>; IndexMap = vec_adj_list_vertex_id_map, long unsigned int>; Compare = std::less; Combine = std::plus; DistInf = double; DistZero = double; T = double*; Tag = vertex_distance_t; Base = bgl_named_params; typename graph_traits::vertex_descriptor = long unsigned int; typename enable_if_c::traversal_category>::value, graph::detail::no_parameter>::type = graph::detail::no_parameter; typename graph_traits::traversal_category = adj_list_dir_traversal_tag]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/dijkstra_shortest_paths.hpp:528:32: required from ‘void boost::detail::dijkstra_dispatch2(const VertexListGraph&, typename boost::graph_traits::vertex_descriptor, DistanceMap, WeightMap, IndexMap, const Params&) [with VertexListGraph = R_adjacency_list; DistanceMap = double*; WeightMap = boost::adj_list_edge_property_map, boost::edge_weight_t>; IndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>; Params = boost::bgl_named_params >; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/dijkstra_shortest_paths.hpp:554:35: required from ‘void boost::detail::dijkstra_dispatch1(const VertexListGraph&, typename boost::graph_traits::vertex_descriptor, DistanceMap, WeightMap, IndexMap, const Params&) [with VertexListGraph = R_adjacency_list; DistanceMap = double*; WeightMap = boost::adj_list_edge_property_map, boost::edge_weight_t>; IndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>; Params = boost::bgl_named_params >; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/dijkstra_shortest_paths.hpp:570:31: required from ‘void boost::dijkstra_shortest_paths(const VertexListGraph&, typename graph_traits::vertex_descriptor, const bgl_named_params&) [with VertexListGraph = R_adjacency_list; Param = double*; Tag = vertex_distance_t; Rest = bgl_named_params; typename graph_traits::vertex_descriptor = long unsigned int]’ shortestPath.cpp:25:32: required from here /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:206:17: note: in a call to non-static member function ‘boost::ConvertibleConcept::~ConvertibleConcept()’ 206 | BOOST_concept(Convertible,(X)(Y)) | ^~~~~~~~~~~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/preprocessor/cat.hpp:29:34: note: in definition of macro ‘BOOST_PP_CAT_I’ 29 | # define BOOST_PP_CAT_I(a, b) a ## b | ^ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/concept_def.hpp:23:12: note: in expansion of macro ‘BOOST_PP_CAT’ 23 | struct BOOST_PP_CAT(name,Concept) \ | ^~~~~~~~~~~~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:206:3: note: in expansion of macro ‘BOOST_concept’ 206 | BOOST_concept(Convertible,(X)(Y)) | ^~~~~~~~~~~~~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::concepts::IncidenceGraph, boost::property >, boost::no_property, boost::listS> >]’: /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements, boost::property >, boost::no_property, boost::listS> > >]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/graph_concepts.hpp:87:5: required from ‘struct boost::concepts::IncidenceGraph, boost::property >, boost::no_property, boost::listS> >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/graph_concepts.hpp:75:1: required from ‘struct boost::concepts::IncidenceGraphConcept, boost::property >, boost::no_property, boost::listS> >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::concepts::IncidenceGraphConcept, boost::property >, boost::no_property, boost::listS> >]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied, boost::property >, boost::no_property, boost::listS> > >::value’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:45:51: [ skipping 6 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/dijkstra_shortest_paths.hpp:491:28: required from ‘void boost::dijkstra_shortest_paths(const VertexListGraph&, SourceInputIter, SourceInputIter, PredecessorMap, DistanceMap, WeightMap, IndexMap, Compare, Combine, DistInf, DistZero, DijkstraVisitor) [with VertexListGraph = adjacency_list, property >, no_property, listS>; SourceInputIter = long unsigned int*; DijkstraVisitor = dijkstra_visitor<>; PredecessorMap = dummy_property_map; DistanceMap = vec_adj_list_vertex_property_map, property >, no_property, listS>, adjacency_list, property >, no_property, listS>*, double, double&, vertex_distance_t>; WeightMap = adj_list_edge_property_map >, edge_weight2_t>; IndexMap = vec_adj_list_vertex_id_map, long unsigned int>; Compare = std::less; Combine = closed_plus; DistInf = double; DistZero = double]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/dijkstra_shortest_paths.hpp:505:28: required from ‘void boost::dijkstra_shortest_paths(const VertexListGraph&, typename graph_traits::vertex_descriptor, PredecessorMap, DistanceMap, WeightMap, IndexMap, Compare, Combine, DistInf, DistZero, DijkstraVisitor) [with VertexListGraph = adjacency_list, property >, no_property, listS>; DijkstraVisitor = dijkstra_visitor<>; PredecessorMap = dummy_property_map; DistanceMap = vec_adj_list_vertex_property_map, property >, no_property, listS>, adjacency_list, property >, no_property, listS>*, double, double&, vertex_distance_t>; WeightMap = adj_list_edge_property_map >, edge_weight2_t>; IndexMap = vec_adj_list_vertex_id_map, long unsigned int>; Compare = std::less; Combine = closed_plus; DistInf = double; DistZero = double; typename graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/johnson_all_pairs_shortest.hpp:127:36: required from ‘bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, VertexID, Weight, const BinaryPredicate&, const BinaryFunction&, const Infinity&, DistanceZero) [with VertexAndEdgeListGraph = R_adjacency_list; DistanceMatrix = Basic2DMatrix; VertexID = vec_adj_list_vertex_id_map, long unsigned int>; Weight = adj_list_edge_property_map, edge_weight_t>; BinaryPredicate = std::less; BinaryFunction = closed_plus; Infinity = double; DistanceZero = double]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/johnson_all_pairs_shortest.hpp:164:48: required from ‘bool boost::detail::johnson_dispatch(VertexAndEdgeListGraph&, DistanceMatrix&, const boost::bgl_named_params&, Weight, VertexID) [with VertexAndEdgeListGraph = R_adjacency_list; DistanceMatrix = Basic2DMatrix; P = int; T = int; R = boost::no_property; Weight = boost::adj_list_edge_property_map, boost::edge_weight_t>; VertexID = boost::vec_adj_list_vertex_id_map, long unsigned int>]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/johnson_all_pairs_shortest.hpp:192:36: required from ‘bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&) [with VertexAndEdgeListGraph = R_adjacency_list; DistanceMatrix = Basic2DMatrix]’ shortestPath.cpp:56:41: required from here /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::concepts::IncidenceGraph::~IncidenceGraph() [with G = boost::adjacency_list, boost::property >, boost::no_property, boost::listS>]’ 37 | ~model() | ^ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/graph_concepts.hpp:87:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 87 | BOOST_CONCEPT_USAGE(IncidenceGraph) | ^~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements, boost::d_ary_heap_indirect, long unsigned int>, long unsigned int, long unsigned int&>, boost::vec_adj_list_vertex_property_map, boost::property >, boost::no_property, boost::listS>, boost::adjacency_list, boost::property >, boost::no_property, boost::listS>*, double, double&, boost::vertex_distance_t>, std::less, std::vector >, boost::adj_list_edge_property_map >, boost::edge_weight2_t>, boost::dummy_property_map, boost::vec_adj_list_vertex_property_map, boost::property >, boost::no_property, boost::listS>, boost::adjacency_list, boost::property >, boost::no_property, boost::listS>*, double, double&, boost::vertex_distance_t>, boost::closed_plus, std::less > > >]’: /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:167:5: required from ‘struct boost::CopyConstructible, boost::d_ary_heap_indirect, long unsigned int>, long unsigned int, long unsigned int&>, boost::vec_adj_list_vertex_property_map, boost::property >, boost::no_property, boost::listS>, boost::adjacency_list, boost::property >, boost::no_property, boost::listS>*, double, double&, boost::vertex_distance_t>, std::less, std::vector >, boost::adj_list_edge_property_map >, boost::edge_weight2_t>, boost::dummy_property_map, boost::vec_adj_list_vertex_property_map, boost::property >, boost::no_property, boost::listS>, boost::adjacency_list, boost::property >, boost::no_property, boost::listS>*, double, double&, boost::vertex_distance_t>, boost::closed_plus, std::less > >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:165:3: required from ‘struct boost::CopyConstructibleConcept, boost::d_ary_heap_indirect, long unsigned int>, long unsigned int, long unsigned int&>, boost::vec_adj_list_vertex_property_map, boost::property >, boost::no_property, boost::listS>, boost::adjacency_list, boost::property >, boost::no_property, boost::listS>*, double, double&, boost::vertex_distance_t>, std::less, std::vector >, boost::adj_list_edge_property_map >, boost::edge_weight2_t>, boost::dummy_property_map, boost::vec_adj_list_vertex_property_map, boost::property >, boost::no_property, boost::listS>, boost::adjacency_list, boost::property >, boost::no_property, boost::listS>*, double, double&, boost::vertex_distance_t>, boost::closed_plus, std::less > >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::CopyConstructibleConcept, boost::d_ary_heap_indirect, long unsigned int>, long unsigned int, long unsigned int&>, boost::vec_adj_list_vertex_property_map, boost::property >, boost::no_property, boost::listS>, boost::adjacency_list, boost::property >, boost::no_property, boost::listS>*, double, double&, boost::vertex_distance_t>, std::less, std::vector >, boost::adj_list_edge_property_map >, boost::edge_weight2_t>, boost::dummy_property_map, boost::vec_adj_list_vertex_property_map, boost::property >, boost::no_property, boost::listS>, boost::adjacency_list, boost::property >, boost::no_property, boost::listS>*, double, double&, boost::vertex_distance_t>, boost::closed_plus, std::less > >]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied, boost::d_ary_heap_indirect, long unsigned int>, long unsigned int, long unsigned int&>, boost::vec_adj_list_vertex_property_map, boost::property >, boost::no_property, boost::listS>, boost::adjacency_list, boost::property >, boost::no_property, boost::listS>*, double, double&, boost::vertex_distance_t>, std::less, std::vector >, boost::adj_list_edge_property_map >, boost::edge_weight2_t>, boost::dummy_property_map, boost::vec_adj_list_vertex_property_map, boost::property >, boost::no_property, boost::listS>, boost::adjacency_list, boost::property >, boost::no_property, boost::listS>*, double, double&, boost::vertex_distance_t>, boost::closed_plus, std::less > > >::value’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied, boost::d_ary_heap_indirect, long unsigned int>, long unsigned int, long unsigned int&>, boost::vec_adj_list_vertex_property_map, boost::property >, boost::no_property, boost::listS>, boost::adjacency_list, boost::property >, boost::no_property, boost::listS>*, double, double&, boost::vertex_distance_t>, std::less, std::vector >, boost::adj_list_edge_property_map >, boost::edge_weight2_t>, boost::dummy_property_map, boost::vec_adj_list_vertex_property_map, boost::property >, boost::no_property, boost::listS>, boost::adjacency_list, boost::property >, boost::no_property, boost::listS>*, double, double&, boost::vertex_distance_t>, boost::closed_plus, std::less > > >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:72:8: [ skipping 10 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/dijkstra_shortest_paths.hpp:491:28: required from ‘void boost::dijkstra_shortest_paths(const VertexListGraph&, SourceInputIter, SourceInputIter, PredecessorMap, DistanceMap, WeightMap, IndexMap, Compare, Combine, DistInf, DistZero, DijkstraVisitor) [with VertexListGraph = adjacency_list, property >, no_property, listS>; SourceInputIter = long unsigned int*; DijkstraVisitor = dijkstra_visitor<>; PredecessorMap = dummy_property_map; DistanceMap = vec_adj_list_vertex_property_map, property >, no_property, listS>, adjacency_list, property >, no_property, listS>*, double, double&, vertex_distance_t>; WeightMap = adj_list_edge_property_map >, edge_weight2_t>; IndexMap = vec_adj_list_vertex_id_map, long unsigned int>; Compare = std::less; Combine = closed_plus; DistInf = double; DistZero = double]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/dijkstra_shortest_paths.hpp:505:28: required from ‘void boost::dijkstra_shortest_paths(const VertexListGraph&, typename graph_traits::vertex_descriptor, PredecessorMap, DistanceMap, WeightMap, IndexMap, Compare, Combine, DistInf, DistZero, DijkstraVisitor) [with VertexListGraph = adjacency_list, property >, no_property, listS>; DijkstraVisitor = dijkstra_visitor<>; PredecessorMap = dummy_property_map; DistanceMap = vec_adj_list_vertex_property_map, property >, no_property, listS>, adjacency_list, property >, no_property, listS>*, double, double&, vertex_distance_t>; WeightMap = adj_list_edge_property_map >, edge_weight2_t>; IndexMap = vec_adj_list_vertex_id_map, long unsigned int>; Compare = std::less; Combine = closed_plus; DistInf = double; DistZero = double; typename graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/johnson_all_pairs_shortest.hpp:127:36: required from ‘bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, VertexID, Weight, const BinaryPredicate&, const BinaryFunction&, const Infinity&, DistanceZero) [with VertexAndEdgeListGraph = R_adjacency_list; DistanceMatrix = Basic2DMatrix; VertexID = vec_adj_list_vertex_id_map, long unsigned int>; Weight = adj_list_edge_property_map, edge_weight_t>; BinaryPredicate = std::less; BinaryFunction = closed_plus; Infinity = double; DistanceZero = double]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/johnson_all_pairs_shortest.hpp:164:48: required from ‘bool boost::detail::johnson_dispatch(VertexAndEdgeListGraph&, DistanceMatrix&, const boost::bgl_named_params&, Weight, VertexID) [with VertexAndEdgeListGraph = R_adjacency_list; DistanceMatrix = Basic2DMatrix; P = int; T = int; R = boost::no_property; Weight = boost::adj_list_edge_property_map, boost::edge_weight_t>; VertexID = boost::vec_adj_list_vertex_id_map, long unsigned int>]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/johnson_all_pairs_shortest.hpp:192:36: required from ‘bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&) [with VertexAndEdgeListGraph = R_adjacency_list; DistanceMatrix = Basic2DMatrix]’ shortestPath.cpp:56:41: required from here /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::CopyConstructible, boost::d_ary_heap_indirect, long unsigned int>, long unsigned int, long unsigned int&>, boost::vec_adj_list_vertex_property_map, boost::property >, boost::no_property, boost::listS>, boost::adjacency_list, boost::property >, boost::no_property, boost::listS>*, double, double&, boost::vertex_distance_t>, std::less, std::vector >, boost::adj_list_edge_property_map >, boost::edge_weight2_t>, boost::dummy_property_map, boost::vec_adj_list_vertex_property_map, boost::property >, boost::no_property, boost::listS>, boost::adjacency_list, boost::property >, boost::no_property, boost::listS>*, double, double&, boost::vertex_distance_t>, boost::closed_plus, std::less > >]’ 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ^ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::CopyConstructibleConcept, boost::d_ary_heap_indirect, long unsigned int>, long unsigned int, long unsigned int&>, boost::vec_adj_list_vertex_property_map, boost::property >, boost::no_property, boost::listS>, boost::adjacency_list, boost::property >, boost::no_property, boost::listS>*, double, double&, boost::vertex_distance_t>, std::less, std::vector >, boost::adj_list_edge_property_map >, boost::edge_weight2_t>, boost::dummy_property_map, boost::vec_adj_list_vertex_property_map, boost::property >, boost::no_property, boost::listS>, boost::adjacency_list, boost::property >, boost::no_property, boost::listS>*, double, double&, boost::vertex_distance_t>, boost::closed_plus, std::less > >]’: /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/breadth_first_search.hpp:39:9: required from ‘void boost::BFSVisitorConcept::constraints() [with Visitor = boost::detail::dijkstra_bfs_visitor, boost::d_ary_heap_indirect, long unsigned int>, long unsigned int, long unsigned int&>, boost::vec_adj_list_vertex_property_map, boost::property >, boost::no_property, boost::listS>, boost::adjacency_list, boost::property >, boost::no_property, boost::listS>*, double, double&, boost::vertex_distance_t>, std::less, std::vector >, boost::adj_list_edge_property_map >, boost::edge_weight2_t>, boost::dummy_property_map, boost::vec_adj_list_vertex_property_map, boost::property >, boost::no_property, boost::listS>, boost::adjacency_list, boost::property >, boost::no_property, boost::listS>*, double, double&, boost::vertex_distance_t>, boost::closed_plus, std::less >; Graph = boost::adjacency_list, boost::property >, boost::no_property, boost::listS>]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::BFSVisitorConcept, boost::d_ary_heap_indirect, long unsigned int>, long unsigned int, long unsigned int&>, boost::vec_adj_list_vertex_property_map, boost::property >, boost::no_property, boost::listS>, boost::adjacency_list, boost::property >, boost::no_property, boost::listS>*, double, double&, boost::vertex_distance_t>, std::less, std::vector >, boost::adj_list_edge_property_map >, boost::edge_weight2_t>, boost::dummy_property_map, boost::vec_adj_list_vertex_property_map, boost::property >, boost::no_property, boost::listS>, boost::adjacency_list, boost::property >, boost::no_property, boost::listS>*, double, double&, boost::vertex_distance_t>, boost::closed_plus, std::less >, boost::adjacency_list, boost::property >, boost::no_property, boost::listS> >]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied, boost::d_ary_heap_indirect, long unsigned int>, long unsigned int, long unsigned int&>, boost::vec_adj_list_vertex_property_map, boost::property >, boost::no_property, boost::listS>, boost::adjacency_list, boost::property >, boost::no_property, boost::listS>*, double, double&, boost::vertex_distance_t>, std::less, std::vector >, boost::adj_list_edge_property_map >, boost::edge_weight2_t>, boost::dummy_property_map, boost::vec_adj_list_vertex_property_map, boost::property >, boost::no_property, boost::listS>, boost::adjacency_list, boost::property >, boost::no_property, boost::listS>*, double, double&, boost::vertex_distance_t>, boost::closed_plus, std::less >, boost::adjacency_list, boost::property >, boost::no_property, boost::listS> > >::value’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied, boost::d_ary_heap_indirect, long unsigned int>, long unsigned int, long unsigned int&>, boost::vec_adj_list_vertex_property_map, boost::property >, boost::no_property, boost::listS>, boost::adjacency_list, boost::property >, boost::no_property, boost::listS>*, double, double&, boost::vertex_distance_t>, std::less, std::vector >, boost::adj_list_edge_property_map >, boost::edge_weight2_t>, boost::dummy_property_map, boost::vec_adj_list_vertex_property_map, boost::property >, boost::no_property, boost::listS>, boost::adjacency_list, boost::property >, boost::no_property, boost::listS>*, double, double&, boost::vertex_distance_t>, boost::closed_plus, std::less >, boost::adjacency_list, boost::property >, boost::no_property, boost::listS> > >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_, boost::d_ary_heap_indirect, long unsigned int>, long unsigned int, long unsigned int&>, boost::vec_adj_list_vertex_property_map, boost::property >, boost::no_property, boost::listS>, boost::adjacency_list, boost::property >, boost::no_property, boost::listS>*, double, double&, boost::vertex_distance_t>, std::less, std::vector >, boost::adj_list_edge_property_map >, boost::edge_weight2_t>, boost::dummy_property_map, boost::vec_adj_list_vertex_property_map, boost::property >, boost::no_property, boost::listS>, boost::adjacency_list, boost::property >, boost::no_property, boost::listS>*, double, double&, boost::vertex_distance_t>, boost::closed_plus, std::less >, boost::adjacency_list, boost::property >, boost::no_property, boost::listS> >)>’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/breadth_first_search.hpp:65:5: [ skipping 4 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/dijkstra_shortest_paths.hpp:491:28: required from ‘void boost::dijkstra_shortest_paths(const VertexListGraph&, SourceInputIter, SourceInputIter, PredecessorMap, DistanceMap, WeightMap, IndexMap, Compare, Combine, DistInf, DistZero, DijkstraVisitor) [with VertexListGraph = adjacency_list, property >, no_property, listS>; SourceInputIter = long unsigned int*; DijkstraVisitor = dijkstra_visitor<>; PredecessorMap = dummy_property_map; DistanceMap = vec_adj_list_vertex_property_map, property >, no_property, listS>, adjacency_list, property >, no_property, listS>*, double, double&, vertex_distance_t>; WeightMap = adj_list_edge_property_map >, edge_weight2_t>; IndexMap = vec_adj_list_vertex_id_map, long unsigned int>; Compare = std::less; Combine = closed_plus; DistInf = double; DistZero = double]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/dijkstra_shortest_paths.hpp:505:28: required from ‘void boost::dijkstra_shortest_paths(const VertexListGraph&, typename graph_traits::vertex_descriptor, PredecessorMap, DistanceMap, WeightMap, IndexMap, Compare, Combine, DistInf, DistZero, DijkstraVisitor) [with VertexListGraph = adjacency_list, property >, no_property, listS>; DijkstraVisitor = dijkstra_visitor<>; PredecessorMap = dummy_property_map; DistanceMap = vec_adj_list_vertex_property_map, property >, no_property, listS>, adjacency_list, property >, no_property, listS>*, double, double&, vertex_distance_t>; WeightMap = adj_list_edge_property_map >, edge_weight2_t>; IndexMap = vec_adj_list_vertex_id_map, long unsigned int>; Compare = std::less; Combine = closed_plus; DistInf = double; DistZero = double; typename graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/johnson_all_pairs_shortest.hpp:127:36: required from ‘bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, VertexID, Weight, const BinaryPredicate&, const BinaryFunction&, const Infinity&, DistanceZero) [with VertexAndEdgeListGraph = R_adjacency_list; DistanceMatrix = Basic2DMatrix; VertexID = vec_adj_list_vertex_id_map, long unsigned int>; Weight = adj_list_edge_property_map, edge_weight_t>; BinaryPredicate = std::less; BinaryFunction = closed_plus; Infinity = double; DistanceZero = double]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/johnson_all_pairs_shortest.hpp:164:48: required from ‘bool boost::detail::johnson_dispatch(VertexAndEdgeListGraph&, DistanceMatrix&, const boost::bgl_named_params&, Weight, VertexID) [with VertexAndEdgeListGraph = R_adjacency_list; DistanceMatrix = Basic2DMatrix; P = int; T = int; R = boost::no_property; Weight = boost::adj_list_edge_property_map, boost::edge_weight_t>; VertexID = boost::vec_adj_list_vertex_id_map, long unsigned int>]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/johnson_all_pairs_shortest.hpp:192:36: required from ‘bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&) [with VertexAndEdgeListGraph = R_adjacency_list; DistanceMatrix = Basic2DMatrix]’ shortestPath.cpp:56:41: required from here /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:165:17: note: in a call to non-static member function ‘boost::CopyConstructibleConcept, boost::d_ary_heap_indirect, long unsigned int>, long unsigned int, long unsigned int&>, boost::vec_adj_list_vertex_property_map, boost::property >, boost::no_property, boost::listS>, boost::adjacency_list, boost::property >, boost::no_property, boost::listS>*, double, double&, boost::vertex_distance_t>, std::less, std::vector >, boost::adj_list_edge_property_map >, boost::edge_weight2_t>, boost::dummy_property_map, boost::vec_adj_list_vertex_property_map, boost::property >, boost::no_property, boost::listS>, boost::adjacency_list, boost::property >, boost::no_property, boost::listS>*, double, double&, boost::vertex_distance_t>, boost::closed_plus, std::less > >::~CopyConstructibleConcept()’ 165 | BOOST_concept(CopyConstructible,(TT)) | ^~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/preprocessor/cat.hpp:29:34: note: in definition of macro ‘BOOST_PP_CAT_I’ 29 | # define BOOST_PP_CAT_I(a, b) a ## b | ^ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/concept_def.hpp:23:12: note: in expansion of macro ‘BOOST_PP_CAT’ 23 | struct BOOST_PP_CAT(name,Concept) \ | ^~~~~~~~~~~~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:165:3: note: in expansion of macro ‘BOOST_concept’ 165 | BOOST_concept(CopyConstructible,(TT)) | ^~~~~~~~~~~~~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::constraint::failed() [with Model = boost::ReadablePropertyMapConcept, long unsigned int> >, long unsigned int>]’: /home/omnipath/local/R/4.4-3.20/BH/include/boost/property_map/property_map.hpp:206:7: required from ‘void boost::ReadWritePropertyMapConcept::constraints() [with PMap = boost::two_bit_color_map, long unsigned int> >; Key = long unsigned int]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::ReadWritePropertyMapConcept, long unsigned int> >, long unsigned int>]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied, long unsigned int> >, long unsigned int> >::value’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied, long unsigned int> >, long unsigned int> >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_, long unsigned int> >, long unsigned int>)>’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/breadth_first_search.hpp:66:5: [ skipping 4 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/dijkstra_shortest_paths.hpp:491:28: required from ‘void boost::dijkstra_shortest_paths(const VertexListGraph&, SourceInputIter, SourceInputIter, PredecessorMap, DistanceMap, WeightMap, IndexMap, Compare, Combine, DistInf, DistZero, DijkstraVisitor) [with VertexListGraph = adjacency_list, property >, no_property, listS>; SourceInputIter = long unsigned int*; DijkstraVisitor = dijkstra_visitor<>; PredecessorMap = dummy_property_map; DistanceMap = vec_adj_list_vertex_property_map, property >, no_property, listS>, adjacency_list, property >, no_property, listS>*, double, double&, vertex_distance_t>; WeightMap = adj_list_edge_property_map >, edge_weight2_t>; IndexMap = vec_adj_list_vertex_id_map, long unsigned int>; Compare = std::less; Combine = closed_plus; DistInf = double; DistZero = double]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/dijkstra_shortest_paths.hpp:505:28: required from ‘void boost::dijkstra_shortest_paths(const VertexListGraph&, typename graph_traits::vertex_descriptor, PredecessorMap, DistanceMap, WeightMap, IndexMap, Compare, Combine, DistInf, DistZero, DijkstraVisitor) [with VertexListGraph = adjacency_list, property >, no_property, listS>; DijkstraVisitor = dijkstra_visitor<>; PredecessorMap = dummy_property_map; DistanceMap = vec_adj_list_vertex_property_map, property >, no_property, listS>, adjacency_list, property >, no_property, listS>*, double, double&, vertex_distance_t>; WeightMap = adj_list_edge_property_map >, edge_weight2_t>; IndexMap = vec_adj_list_vertex_id_map, long unsigned int>; Compare = std::less; Combine = closed_plus; DistInf = double; DistZero = double; typename graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/johnson_all_pairs_shortest.hpp:127:36: required from ‘bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, VertexID, Weight, const BinaryPredicate&, const BinaryFunction&, const Infinity&, DistanceZero) [with VertexAndEdgeListGraph = R_adjacency_list; DistanceMatrix = Basic2DMatrix; VertexID = vec_adj_list_vertex_id_map, long unsigned int>; Weight = adj_list_edge_property_map, edge_weight_t>; BinaryPredicate = std::less; BinaryFunction = closed_plus; Infinity = double; DistanceZero = double]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/johnson_all_pairs_shortest.hpp:164:48: required from ‘bool boost::detail::johnson_dispatch(VertexAndEdgeListGraph&, DistanceMatrix&, const boost::bgl_named_params&, Weight, VertexID) [with VertexAndEdgeListGraph = R_adjacency_list; DistanceMatrix = Basic2DMatrix; P = int; T = int; R = boost::no_property; Weight = boost::adj_list_edge_property_map, boost::edge_weight_t>; VertexID = boost::vec_adj_list_vertex_id_map, long unsigned int>]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/johnson_all_pairs_shortest.hpp:192:36: required from ‘bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&) [with VertexAndEdgeListGraph = R_adjacency_list; DistanceMatrix = Basic2DMatrix]’ shortestPath.cpp:56:41: required from here /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:65:52: warning: ‘this’ pointer is null [-Wnonnull] 65 | static void failed() { ((Model*)0)->constraints(); } | ~~~~~~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/property_map/property_map.hpp:147:10: note: in a call to non-static member function ‘void boost::ReadablePropertyMapConcept::constraints() [with PMap = boost::two_bit_color_map, long unsigned int> >; Key = long unsigned int]’ 147 | void constraints() { | ^~~~~~~~~~~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::constraint::failed() [with Model = boost::WritablePropertyMapConcept, long unsigned int> >, long unsigned int>]’: /home/omnipath/local/R/4.4-3.20/BH/include/boost/property_map/property_map.hpp:207:7: required from ‘void boost::ReadWritePropertyMapConcept::constraints() [with PMap = boost::two_bit_color_map, long unsigned int> >; Key = long unsigned int]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::ReadWritePropertyMapConcept, long unsigned int> >, long unsigned int>]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied, long unsigned int> >, long unsigned int> >::value’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied, long unsigned int> >, long unsigned int> >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_, long unsigned int> >, long unsigned int>)>’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/breadth_first_search.hpp:66:5: [ skipping 4 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/dijkstra_shortest_paths.hpp:491:28: required from ‘void boost::dijkstra_shortest_paths(const VertexListGraph&, SourceInputIter, SourceInputIter, PredecessorMap, DistanceMap, WeightMap, IndexMap, Compare, Combine, DistInf, DistZero, DijkstraVisitor) [with VertexListGraph = adjacency_list, property >, no_property, listS>; SourceInputIter = long unsigned int*; DijkstraVisitor = dijkstra_visitor<>; PredecessorMap = dummy_property_map; DistanceMap = vec_adj_list_vertex_property_map, property >, no_property, listS>, adjacency_list, property >, no_property, listS>*, double, double&, vertex_distance_t>; WeightMap = adj_list_edge_property_map >, edge_weight2_t>; IndexMap = vec_adj_list_vertex_id_map, long unsigned int>; Compare = std::less; Combine = closed_plus; DistInf = double; DistZero = double]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/dijkstra_shortest_paths.hpp:505:28: required from ‘void boost::dijkstra_shortest_paths(const VertexListGraph&, typename graph_traits::vertex_descriptor, PredecessorMap, DistanceMap, WeightMap, IndexMap, Compare, Combine, DistInf, DistZero, DijkstraVisitor) [with VertexListGraph = adjacency_list, property >, no_property, listS>; DijkstraVisitor = dijkstra_visitor<>; PredecessorMap = dummy_property_map; DistanceMap = vec_adj_list_vertex_property_map, property >, no_property, listS>, adjacency_list, property >, no_property, listS>*, double, double&, vertex_distance_t>; WeightMap = adj_list_edge_property_map >, edge_weight2_t>; IndexMap = vec_adj_list_vertex_id_map, long unsigned int>; Compare = std::less; Combine = closed_plus; DistInf = double; DistZero = double; typename graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/johnson_all_pairs_shortest.hpp:127:36: required from ‘bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, VertexID, Weight, const BinaryPredicate&, const BinaryFunction&, const Infinity&, DistanceZero) [with VertexAndEdgeListGraph = R_adjacency_list; DistanceMatrix = Basic2DMatrix; VertexID = vec_adj_list_vertex_id_map, long unsigned int>; Weight = adj_list_edge_property_map, edge_weight_t>; BinaryPredicate = std::less; BinaryFunction = closed_plus; Infinity = double; DistanceZero = double]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/johnson_all_pairs_shortest.hpp:164:48: required from ‘bool boost::detail::johnson_dispatch(VertexAndEdgeListGraph&, DistanceMatrix&, const boost::bgl_named_params&, Weight, VertexID) [with VertexAndEdgeListGraph = R_adjacency_list; DistanceMatrix = Basic2DMatrix; P = int; T = int; R = boost::no_property; Weight = boost::adj_list_edge_property_map, boost::edge_weight_t>; VertexID = boost::vec_adj_list_vertex_id_map, long unsigned int>]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/johnson_all_pairs_shortest.hpp:192:36: required from ‘bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&) [with VertexAndEdgeListGraph = R_adjacency_list; DistanceMatrix = Basic2DMatrix]’ shortestPath.cpp:56:41: required from here /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:65:52: warning: ‘this’ pointer is null [-Wnonnull] 65 | static void failed() { ((Model*)0)->constraints(); } | ~~~~~~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/property_map/property_map.hpp:179:10: note: in a call to non-static member function ‘void boost::WritablePropertyMapConcept::constraints() [with PMap = boost::two_bit_color_map, long unsigned int> >; Key = long unsigned int]’ 179 | void constraints() { | ^~~~~~~~~~~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::Convertible]’: /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements >]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:208:5: required from ‘struct boost::Convertible’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::Convertible]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied >::value’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:72:8: [ skipping 5 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/graph_concepts.hpp:235:9: required from ‘boost::concepts::EdgeListGraph::~EdgeListGraph() [with G = R_adjacency_list]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/graph_concepts.hpp:226:1: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::EdgeListGraphConcept >]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/bellman_ford_shortest_paths.hpp:97:5: required from ‘bool boost::floyd_warshall_all_pairs_shortest_paths(const VertexAndEdgeListGraph&, DistanceMatrix&, const WeightMap&, const BinaryPredicate&, const BinaryFunction&, const Infinity&, const Zero&) [with VertexAndEdgeListGraph = R_adjacency_list; DistanceMatrix = Basic2DMatrix; WeightMap = adj_list_edge_property_map, edge_weight_t>; BinaryPredicate = std::less; BinaryFunction = closed_plus; Infinity = double; Zero = double]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/floyd_warshall_shortest.hpp:172:55: required from ‘bool boost::detail::floyd_warshall_noninit_dispatch(const VertexAndEdgeListGraph&, DistanceMatrix&, WeightMap, const boost::bgl_named_params&) [with VertexAndEdgeListGraph = R_adjacency_list; DistanceMatrix = Basic2DMatrix; WeightMap = boost::adj_list_edge_property_map, boost::edge_weight_t>; P = int; T = int; R = boost::no_property]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/floyd_warshall_shortest.hpp:217:51: required from ‘bool boost::floyd_warshall_all_pairs_shortest_paths(const VertexAndEdgeListGraph&, DistanceMatrix&) [with VertexAndEdgeListGraph = R_adjacency_list; DistanceMatrix = Basic2DMatrix]’ shortestPath.cpp:186:48: required from here /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::Convertible::~Convertible() [with X = std::forward_iterator_tag; Y = std::input_iterator_tag]’ 37 | ~model() | ^ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:208:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 208 | BOOST_CONCEPT_USAGE(Convertible) { | ^~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::Convertible, std::input_iterator_tag>]’: /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements, std::input_iterator_tag> >]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:208:5: required from ‘struct boost::Convertible, std::input_iterator_tag>’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::Convertible, std::input_iterator_tag>]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied, std::input_iterator_tag> >::value’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied, std::input_iterator_tag> >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:72:8: [ skipping 5 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/graph_concepts.hpp:89:9: required from ‘boost::concepts::IncidenceGraph::~IncidenceGraph() [with G = R_adjacency_list]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/graph_concepts.hpp:75:1: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::IncidenceGraphConcept >]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/breadth_first_search.hpp:62:5: required from ‘bool boost::floyd_warshall_all_pairs_shortest_paths(const VertexAndEdgeListGraph&, DistanceMatrix&, const WeightMap&, const BinaryPredicate&, const BinaryFunction&, const Infinity&, const Zero&) [with VertexAndEdgeListGraph = R_adjacency_list; DistanceMatrix = Basic2DMatrix; WeightMap = adj_list_edge_property_map, edge_weight_t>; BinaryPredicate = std::less; BinaryFunction = closed_plus; Infinity = double; Zero = double]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/floyd_warshall_shortest.hpp:172:55: required from ‘bool boost::detail::floyd_warshall_noninit_dispatch(const VertexAndEdgeListGraph&, DistanceMatrix&, WeightMap, const boost::bgl_named_params&) [with VertexAndEdgeListGraph = R_adjacency_list; DistanceMatrix = Basic2DMatrix; WeightMap = boost::adj_list_edge_property_map, boost::edge_weight_t>; P = int; T = int; R = boost::no_property]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/floyd_warshall_shortest.hpp:217:51: required from ‘bool boost::floyd_warshall_all_pairs_shortest_paths(const VertexAndEdgeListGraph&, DistanceMatrix&) [with VertexAndEdgeListGraph = R_adjacency_list; DistanceMatrix = Basic2DMatrix]’ shortestPath.cpp:186:48: required from here /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::Convertible::~Convertible() [with X = boost::iterators::detail::iterator_category_with_traversal; Y = std::input_iterator_tag]’ 37 | ~model() | ^ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:208:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 208 | BOOST_CONCEPT_USAGE(Convertible) { | ^~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements >]’: /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:145:5: required from ‘struct boost::Assignable’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:502:3: required from ‘struct boost::InputIterator’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:540:3: required from ‘struct boost::ForwardIterator’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:568:3: required from ‘struct boost::BidirectionalIterator’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:597:3: required from ‘struct boost::RandomAccessIterator’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:597:3: [ skipping 11 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/dijkstra_shortest_paths.hpp:491:28: required from ‘void boost::dijkstra_shortest_paths(const VertexListGraph&, SourceInputIter, SourceInputIter, PredecessorMap, DistanceMap, WeightMap, IndexMap, Compare, Combine, DistInf, DistZero, DijkstraVisitor) [with VertexListGraph = R_adjacency_list; SourceInputIter = long unsigned int*; DijkstraVisitor = dijkstra_visitor<>; PredecessorMap = long unsigned int*; DistanceMap = double*; WeightMap = adj_list_edge_property_map, edge_weight_t>; IndexMap = vec_adj_list_vertex_id_map, long unsigned int>; Compare = std::less; Combine = std::plus; DistInf = double; DistZero = double]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/dijkstra_shortest_paths.hpp:434:28: required from ‘void boost::dijkstra_shortest_paths(const VertexListGraph&, typename graph_traits::vertex_descriptor, PredecessorMap, DistanceMap, WeightMap, IndexMap, Compare, Combine, DistInf, DistZero, DijkstraVisitor, const bgl_named_params&, typename enable_if_c::traversal_category>::value, graph::detail::no_parameter>::type) [with VertexListGraph = R_adjacency_list; DijkstraVisitor = dijkstra_visitor<>; PredecessorMap = long unsigned int*; DistanceMap = double*; WeightMap = adj_list_edge_property_map, edge_weight_t>; IndexMap = vec_adj_list_vertex_id_map, long unsigned int>; Compare = std::less; Combine = std::plus; DistInf = double; DistZero = double; T = double*; Tag = vertex_distance_t; Base = bgl_named_params; typename graph_traits::vertex_descriptor = long unsigned int; typename enable_if_c::traversal_category>::value, graph::detail::no_parameter>::type = graph::detail::no_parameter; typename graph_traits::traversal_category = adj_list_dir_traversal_tag]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/dijkstra_shortest_paths.hpp:528:32: required from ‘void boost::detail::dijkstra_dispatch2(const VertexListGraph&, typename boost::graph_traits::vertex_descriptor, DistanceMap, WeightMap, IndexMap, const Params&) [with VertexListGraph = R_adjacency_list; DistanceMap = double*; WeightMap = boost::adj_list_edge_property_map, boost::edge_weight_t>; IndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>; Params = boost::bgl_named_params >; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/dijkstra_shortest_paths.hpp:554:35: required from ‘void boost::detail::dijkstra_dispatch1(const VertexListGraph&, typename boost::graph_traits::vertex_descriptor, DistanceMap, WeightMap, IndexMap, const Params&) [with VertexListGraph = R_adjacency_list; DistanceMap = double*; WeightMap = boost::adj_list_edge_property_map, boost::edge_weight_t>; IndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>; Params = boost::bgl_named_params >; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/dijkstra_shortest_paths.hpp:570:31: required from ‘void boost::dijkstra_shortest_paths(const VertexListGraph&, typename graph_traits::vertex_descriptor, const bgl_named_params&) [with VertexListGraph = R_adjacency_list; Param = double*; Tag = vertex_distance_t; Rest = bgl_named_params; typename graph_traits::vertex_descriptor = long unsigned int]’ shortestPath.cpp:25:32: required from here /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::Assignable]’ 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ^ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements >]’: /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:233:5: required from ‘struct boost::EqualityComparable’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:502:3: required from ‘struct boost::InputIterator’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:540:3: required from ‘struct boost::ForwardIterator’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:568:3: required from ‘struct boost::BidirectionalIterator’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:597:3: required from ‘struct boost::RandomAccessIterator’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:597:3: [ skipping 11 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/dijkstra_shortest_paths.hpp:491:28: required from ‘void boost::dijkstra_shortest_paths(const VertexListGraph&, SourceInputIter, SourceInputIter, PredecessorMap, DistanceMap, WeightMap, IndexMap, Compare, Combine, DistInf, DistZero, DijkstraVisitor) [with VertexListGraph = R_adjacency_list; SourceInputIter = long unsigned int*; DijkstraVisitor = dijkstra_visitor<>; PredecessorMap = long unsigned int*; DistanceMap = double*; WeightMap = adj_list_edge_property_map, edge_weight_t>; IndexMap = vec_adj_list_vertex_id_map, long unsigned int>; Compare = std::less; Combine = std::plus; DistInf = double; DistZero = double]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/dijkstra_shortest_paths.hpp:434:28: required from ‘void boost::dijkstra_shortest_paths(const VertexListGraph&, typename graph_traits::vertex_descriptor, PredecessorMap, DistanceMap, WeightMap, IndexMap, Compare, Combine, DistInf, DistZero, DijkstraVisitor, const bgl_named_params&, typename enable_if_c::traversal_category>::value, graph::detail::no_parameter>::type) [with VertexListGraph = R_adjacency_list; DijkstraVisitor = dijkstra_visitor<>; PredecessorMap = long unsigned int*; DistanceMap = double*; WeightMap = adj_list_edge_property_map, edge_weight_t>; IndexMap = vec_adj_list_vertex_id_map, long unsigned int>; Compare = std::less; Combine = std::plus; DistInf = double; DistZero = double; T = double*; Tag = vertex_distance_t; Base = bgl_named_params; typename graph_traits::vertex_descriptor = long unsigned int; typename enable_if_c::traversal_category>::value, graph::detail::no_parameter>::type = graph::detail::no_parameter; typename graph_traits::traversal_category = adj_list_dir_traversal_tag]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/dijkstra_shortest_paths.hpp:528:32: required from ‘void boost::detail::dijkstra_dispatch2(const VertexListGraph&, typename boost::graph_traits::vertex_descriptor, DistanceMap, WeightMap, IndexMap, const Params&) [with VertexListGraph = R_adjacency_list; DistanceMap = double*; WeightMap = boost::adj_list_edge_property_map, boost::edge_weight_t>; IndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>; Params = boost::bgl_named_params >; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/dijkstra_shortest_paths.hpp:554:35: required from ‘void boost::detail::dijkstra_dispatch1(const VertexListGraph&, typename boost::graph_traits::vertex_descriptor, DistanceMap, WeightMap, IndexMap, const Params&) [with VertexListGraph = R_adjacency_list; DistanceMap = double*; WeightMap = boost::adj_list_edge_property_map, boost::edge_weight_t>; IndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>; Params = boost::bgl_named_params >; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/dijkstra_shortest_paths.hpp:570:31: required from ‘void boost::dijkstra_shortest_paths(const VertexListGraph&, typename graph_traits::vertex_descriptor, const bgl_named_params&) [with VertexListGraph = R_adjacency_list; Param = double*; Tag = vertex_distance_t; Rest = bgl_named_params; typename graph_traits::vertex_descriptor = long unsigned int]’ shortestPath.cpp:25:32: required from here /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::EqualityComparable]’ 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ^ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements >]’: /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:512:7: required from ‘struct boost::InputIterator’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:540:3: required from ‘struct boost::ForwardIterator’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:568:3: required from ‘struct boost::BidirectionalIterator’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:597:3: required from ‘struct boost::RandomAccessIterator’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:597:3: required from ‘struct boost::RandomAccessIteratorConcept’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:32:62: [ skipping 10 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/dijkstra_shortest_paths.hpp:491:28: required from ‘void boost::dijkstra_shortest_paths(const VertexListGraph&, SourceInputIter, SourceInputIter, PredecessorMap, DistanceMap, WeightMap, IndexMap, Compare, Combine, DistInf, DistZero, DijkstraVisitor) [with VertexListGraph = R_adjacency_list; SourceInputIter = long unsigned int*; DijkstraVisitor = dijkstra_visitor<>; PredecessorMap = long unsigned int*; DistanceMap = double*; WeightMap = adj_list_edge_property_map, edge_weight_t>; IndexMap = vec_adj_list_vertex_id_map, long unsigned int>; Compare = std::less; Combine = std::plus; DistInf = double; DistZero = double]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/dijkstra_shortest_paths.hpp:434:28: required from ‘void boost::dijkstra_shortest_paths(const VertexListGraph&, typename graph_traits::vertex_descriptor, PredecessorMap, DistanceMap, WeightMap, IndexMap, Compare, Combine, DistInf, DistZero, DijkstraVisitor, const bgl_named_params&, typename enable_if_c::traversal_category>::value, graph::detail::no_parameter>::type) [with VertexListGraph = R_adjacency_list; DijkstraVisitor = dijkstra_visitor<>; PredecessorMap = long unsigned int*; DistanceMap = double*; WeightMap = adj_list_edge_property_map, edge_weight_t>; IndexMap = vec_adj_list_vertex_id_map, long unsigned int>; Compare = std::less; Combine = std::plus; DistInf = double; DistZero = double; T = double*; Tag = vertex_distance_t; Base = bgl_named_params; typename graph_traits::vertex_descriptor = long unsigned int; typename enable_if_c::traversal_category>::value, graph::detail::no_parameter>::type = graph::detail::no_parameter; typename graph_traits::traversal_category = adj_list_dir_traversal_tag]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/dijkstra_shortest_paths.hpp:528:32: required from ‘void boost::detail::dijkstra_dispatch2(const VertexListGraph&, typename boost::graph_traits::vertex_descriptor, DistanceMap, WeightMap, IndexMap, const Params&) [with VertexListGraph = R_adjacency_list; DistanceMap = double*; WeightMap = boost::adj_list_edge_property_map, boost::edge_weight_t>; IndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>; Params = boost::bgl_named_params >; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/dijkstra_shortest_paths.hpp:554:35: required from ‘void boost::detail::dijkstra_dispatch1(const VertexListGraph&, typename boost::graph_traits::vertex_descriptor, DistanceMap, WeightMap, IndexMap, const Params&) [with VertexListGraph = R_adjacency_list; DistanceMap = double*; WeightMap = boost::adj_list_edge_property_map, boost::edge_weight_t>; IndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>; Params = boost::bgl_named_params >; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/dijkstra_shortest_paths.hpp:570:31: required from ‘void boost::dijkstra_shortest_paths(const VertexListGraph&, typename graph_traits::vertex_descriptor, const bgl_named_params&) [with VertexListGraph = R_adjacency_list; Param = double*; Tag = vertex_distance_t; Rest = bgl_named_params; typename graph_traits::vertex_descriptor = long unsigned int]’ shortestPath.cpp:25:32: required from here /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::InputIterator]’ 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ^ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements >]’: /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:543:7: required from ‘struct boost::ForwardIterator’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:568:3: required from ‘struct boost::BidirectionalIterator’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:597:3: required from ‘struct boost::RandomAccessIterator’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:597:3: required from ‘struct boost::RandomAccessIteratorConcept’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::RandomAccessIteratorConcept]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:42:5: [ skipping 9 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/dijkstra_shortest_paths.hpp:491:28: required from ‘void boost::dijkstra_shortest_paths(const VertexListGraph&, SourceInputIter, SourceInputIter, PredecessorMap, DistanceMap, WeightMap, IndexMap, Compare, Combine, DistInf, DistZero, DijkstraVisitor) [with VertexListGraph = R_adjacency_list; SourceInputIter = long unsigned int*; DijkstraVisitor = dijkstra_visitor<>; PredecessorMap = long unsigned int*; DistanceMap = double*; WeightMap = adj_list_edge_property_map, edge_weight_t>; IndexMap = vec_adj_list_vertex_id_map, long unsigned int>; Compare = std::less; Combine = std::plus; DistInf = double; DistZero = double]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/dijkstra_shortest_paths.hpp:434:28: required from ‘void boost::dijkstra_shortest_paths(const VertexListGraph&, typename graph_traits::vertex_descriptor, PredecessorMap, DistanceMap, WeightMap, IndexMap, Compare, Combine, DistInf, DistZero, DijkstraVisitor, const bgl_named_params&, typename enable_if_c::traversal_category>::value, graph::detail::no_parameter>::type) [with VertexListGraph = R_adjacency_list; DijkstraVisitor = dijkstra_visitor<>; PredecessorMap = long unsigned int*; DistanceMap = double*; WeightMap = adj_list_edge_property_map, edge_weight_t>; IndexMap = vec_adj_list_vertex_id_map, long unsigned int>; Compare = std::less; Combine = std::plus; DistInf = double; DistZero = double; T = double*; Tag = vertex_distance_t; Base = bgl_named_params; typename graph_traits::vertex_descriptor = long unsigned int; typename enable_if_c::traversal_category>::value, graph::detail::no_parameter>::type = graph::detail::no_parameter; typename graph_traits::traversal_category = adj_list_dir_traversal_tag]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/dijkstra_shortest_paths.hpp:528:32: required from ‘void boost::detail::dijkstra_dispatch2(const VertexListGraph&, typename boost::graph_traits::vertex_descriptor, DistanceMap, WeightMap, IndexMap, const Params&) [with VertexListGraph = R_adjacency_list; DistanceMap = double*; WeightMap = boost::adj_list_edge_property_map, boost::edge_weight_t>; IndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>; Params = boost::bgl_named_params >; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/dijkstra_shortest_paths.hpp:554:35: required from ‘void boost::detail::dijkstra_dispatch1(const VertexListGraph&, typename boost::graph_traits::vertex_descriptor, DistanceMap, WeightMap, IndexMap, const Params&) [with VertexListGraph = R_adjacency_list; DistanceMap = double*; WeightMap = boost::adj_list_edge_property_map, boost::edge_weight_t>; IndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>; Params = boost::bgl_named_params >; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/dijkstra_shortest_paths.hpp:570:31: required from ‘void boost::dijkstra_shortest_paths(const VertexListGraph&, typename graph_traits::vertex_descriptor, const bgl_named_params&) [with VertexListGraph = R_adjacency_list; Param = double*; Tag = vertex_distance_t; Rest = bgl_named_params; typename graph_traits::vertex_descriptor = long unsigned int]’ shortestPath.cpp:25:32: required from here /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::ForwardIterator]’ 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ^ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements >]’: /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:571:7: required from ‘struct boost::BidirectionalIterator’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:597:3: required from ‘struct boost::RandomAccessIterator’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:597:3: required from ‘struct boost::RandomAccessIteratorConcept’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::RandomAccessIteratorConcept]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied >::value’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:45:51: [ skipping 8 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/dijkstra_shortest_paths.hpp:491:28: required from ‘void boost::dijkstra_shortest_paths(const VertexListGraph&, SourceInputIter, SourceInputIter, PredecessorMap, DistanceMap, WeightMap, IndexMap, Compare, Combine, DistInf, DistZero, DijkstraVisitor) [with VertexListGraph = R_adjacency_list; SourceInputIter = long unsigned int*; DijkstraVisitor = dijkstra_visitor<>; PredecessorMap = long unsigned int*; DistanceMap = double*; WeightMap = adj_list_edge_property_map, edge_weight_t>; IndexMap = vec_adj_list_vertex_id_map, long unsigned int>; Compare = std::less; Combine = std::plus; DistInf = double; DistZero = double]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/dijkstra_shortest_paths.hpp:434:28: required from ‘void boost::dijkstra_shortest_paths(const VertexListGraph&, typename graph_traits::vertex_descriptor, PredecessorMap, DistanceMap, WeightMap, IndexMap, Compare, Combine, DistInf, DistZero, DijkstraVisitor, const bgl_named_params&, typename enable_if_c::traversal_category>::value, graph::detail::no_parameter>::type) [with VertexListGraph = R_adjacency_list; DijkstraVisitor = dijkstra_visitor<>; PredecessorMap = long unsigned int*; DistanceMap = double*; WeightMap = adj_list_edge_property_map, edge_weight_t>; IndexMap = vec_adj_list_vertex_id_map, long unsigned int>; Compare = std::less; Combine = std::plus; DistInf = double; DistZero = double; T = double*; Tag = vertex_distance_t; Base = bgl_named_params; typename graph_traits::vertex_descriptor = long unsigned int; typename enable_if_c::traversal_category>::value, graph::detail::no_parameter>::type = graph::detail::no_parameter; typename graph_traits::traversal_category = adj_list_dir_traversal_tag]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/dijkstra_shortest_paths.hpp:528:32: required from ‘void boost::detail::dijkstra_dispatch2(const VertexListGraph&, typename boost::graph_traits::vertex_descriptor, DistanceMap, WeightMap, IndexMap, const Params&) [with VertexListGraph = R_adjacency_list; DistanceMap = double*; WeightMap = boost::adj_list_edge_property_map, boost::edge_weight_t>; IndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>; Params = boost::bgl_named_params >; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/dijkstra_shortest_paths.hpp:554:35: required from ‘void boost::detail::dijkstra_dispatch1(const VertexListGraph&, typename boost::graph_traits::vertex_descriptor, DistanceMap, WeightMap, IndexMap, const Params&) [with VertexListGraph = R_adjacency_list; DistanceMap = double*; WeightMap = boost::adj_list_edge_property_map, boost::edge_weight_t>; IndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>; Params = boost::bgl_named_params >; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/dijkstra_shortest_paths.hpp:570:31: required from ‘void boost::dijkstra_shortest_paths(const VertexListGraph&, typename graph_traits::vertex_descriptor, const bgl_named_params&) [with VertexListGraph = R_adjacency_list; Param = double*; Tag = vertex_distance_t; Rest = bgl_named_params; typename graph_traits::vertex_descriptor = long unsigned int]’ shortestPath.cpp:25:32: required from here /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::BidirectionalIterator]’ 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ^ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements >]’: /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:253:5: required from ‘struct boost::Comparable’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:597:3: required from ‘struct boost::RandomAccessIterator’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:597:3: required from ‘struct boost::RandomAccessIteratorConcept’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::RandomAccessIteratorConcept]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied >::value’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:45:51: [ skipping 8 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/dijkstra_shortest_paths.hpp:491:28: required from ‘void boost::dijkstra_shortest_paths(const VertexListGraph&, SourceInputIter, SourceInputIter, PredecessorMap, DistanceMap, WeightMap, IndexMap, Compare, Combine, DistInf, DistZero, DijkstraVisitor) [with VertexListGraph = R_adjacency_list; SourceInputIter = long unsigned int*; DijkstraVisitor = dijkstra_visitor<>; PredecessorMap = long unsigned int*; DistanceMap = double*; WeightMap = adj_list_edge_property_map, edge_weight_t>; IndexMap = vec_adj_list_vertex_id_map, long unsigned int>; Compare = std::less; Combine = std::plus; DistInf = double; DistZero = double]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/dijkstra_shortest_paths.hpp:434:28: required from ‘void boost::dijkstra_shortest_paths(const VertexListGraph&, typename graph_traits::vertex_descriptor, PredecessorMap, DistanceMap, WeightMap, IndexMap, Compare, Combine, DistInf, DistZero, DijkstraVisitor, const bgl_named_params&, typename enable_if_c::traversal_category>::value, graph::detail::no_parameter>::type) [with VertexListGraph = R_adjacency_list; DijkstraVisitor = dijkstra_visitor<>; PredecessorMap = long unsigned int*; DistanceMap = double*; WeightMap = adj_list_edge_property_map, edge_weight_t>; IndexMap = vec_adj_list_vertex_id_map, long unsigned int>; Compare = std::less; Combine = std::plus; DistInf = double; DistZero = double; T = double*; Tag = vertex_distance_t; Base = bgl_named_params; typename graph_traits::vertex_descriptor = long unsigned int; typename enable_if_c::traversal_category>::value, graph::detail::no_parameter>::type = graph::detail::no_parameter; typename graph_traits::traversal_category = adj_list_dir_traversal_tag]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/dijkstra_shortest_paths.hpp:528:32: required from ‘void boost::detail::dijkstra_dispatch2(const VertexListGraph&, typename boost::graph_traits::vertex_descriptor, DistanceMap, WeightMap, IndexMap, const Params&) [with VertexListGraph = R_adjacency_list; DistanceMap = double*; WeightMap = boost::adj_list_edge_property_map, boost::edge_weight_t>; IndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>; Params = boost::bgl_named_params >; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/dijkstra_shortest_paths.hpp:554:35: required from ‘void boost::detail::dijkstra_dispatch1(const VertexListGraph&, typename boost::graph_traits::vertex_descriptor, DistanceMap, WeightMap, IndexMap, const Params&) [with VertexListGraph = R_adjacency_list; DistanceMap = double*; WeightMap = boost::adj_list_edge_property_map, boost::edge_weight_t>; IndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>; Params = boost::bgl_named_params >; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/dijkstra_shortest_paths.hpp:570:31: required from ‘void boost::dijkstra_shortest_paths(const VertexListGraph&, typename graph_traits::vertex_descriptor, const bgl_named_params&) [with VertexListGraph = R_adjacency_list; Param = double*; Tag = vertex_distance_t; Rest = bgl_named_params; typename graph_traits::vertex_descriptor = long unsigned int]’ shortestPath.cpp:25:32: required from here /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::Comparable]’ 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ^ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements >]’: /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:601:7: required from ‘struct boost::RandomAccessIterator’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:597:3: required from ‘struct boost::RandomAccessIteratorConcept’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::RandomAccessIteratorConcept]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied >::value’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:72:8: [ skipping 7 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/dijkstra_shortest_paths.hpp:491:28: required from ‘void boost::dijkstra_shortest_paths(const VertexListGraph&, SourceInputIter, SourceInputIter, PredecessorMap, DistanceMap, WeightMap, IndexMap, Compare, Combine, DistInf, DistZero, DijkstraVisitor) [with VertexListGraph = R_adjacency_list; SourceInputIter = long unsigned int*; DijkstraVisitor = dijkstra_visitor<>; PredecessorMap = long unsigned int*; DistanceMap = double*; WeightMap = adj_list_edge_property_map, edge_weight_t>; IndexMap = vec_adj_list_vertex_id_map, long unsigned int>; Compare = std::less; Combine = std::plus; DistInf = double; DistZero = double]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/dijkstra_shortest_paths.hpp:434:28: required from ‘void boost::dijkstra_shortest_paths(const VertexListGraph&, typename graph_traits::vertex_descriptor, PredecessorMap, DistanceMap, WeightMap, IndexMap, Compare, Combine, DistInf, DistZero, DijkstraVisitor, const bgl_named_params&, typename enable_if_c::traversal_category>::value, graph::detail::no_parameter>::type) [with VertexListGraph = R_adjacency_list; DijkstraVisitor = dijkstra_visitor<>; PredecessorMap = long unsigned int*; DistanceMap = double*; WeightMap = adj_list_edge_property_map, edge_weight_t>; IndexMap = vec_adj_list_vertex_id_map, long unsigned int>; Compare = std::less; Combine = std::plus; DistInf = double; DistZero = double; T = double*; Tag = vertex_distance_t; Base = bgl_named_params; typename graph_traits::vertex_descriptor = long unsigned int; typename enable_if_c::traversal_category>::value, graph::detail::no_parameter>::type = graph::detail::no_parameter; typename graph_traits::traversal_category = adj_list_dir_traversal_tag]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/dijkstra_shortest_paths.hpp:528:32: required from ‘void boost::detail::dijkstra_dispatch2(const VertexListGraph&, typename boost::graph_traits::vertex_descriptor, DistanceMap, WeightMap, IndexMap, const Params&) [with VertexListGraph = R_adjacency_list; DistanceMap = double*; WeightMap = boost::adj_list_edge_property_map, boost::edge_weight_t>; IndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>; Params = boost::bgl_named_params >; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/dijkstra_shortest_paths.hpp:554:35: required from ‘void boost::detail::dijkstra_dispatch1(const VertexListGraph&, typename boost::graph_traits::vertex_descriptor, DistanceMap, WeightMap, IndexMap, const Params&) [with VertexListGraph = R_adjacency_list; DistanceMap = double*; WeightMap = boost::adj_list_edge_property_map, boost::edge_weight_t>; IndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>; Params = boost::bgl_named_params >; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/dijkstra_shortest_paths.hpp:570:31: required from ‘void boost::dijkstra_shortest_paths(const VertexListGraph&, typename graph_traits::vertex_descriptor, const bgl_named_params&) [with VertexListGraph = R_adjacency_list; Param = double*; Tag = vertex_distance_t; Rest = bgl_named_params; typename graph_traits::vertex_descriptor = long unsigned int]’ shortestPath.cpp:25:32: required from here /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::RandomAccessIterator]’ 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ^ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::RandomAccessIteratorConcept]’: /home/omnipath/local/R/4.4-3.20/BH/include/boost/property_map/property_map.hpp:354:5: required from ‘boost::iterator_property_map >::value_type, typename std::iterator_traits< >::reference> boost::make_iterator_property_map(RAIter, ID) [with RAIter = long unsigned int*; ID = vec_adj_list_vertex_id_map, long unsigned int>; typename std::iterator_traits< >::value_type = long unsigned int; typename std::iterator_traits< >::reference = long unsigned int&]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/dijkstra_shortest_paths.hpp:245:46: required from ‘static boost::detail::vertex_property_map_generator_helper::type boost::detail::vertex_property_map_generator_helper::build(const Graph&, const IndexMap&, boost::scoped_array&) [with Graph = R_adjacency_list; IndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>; Value = long unsigned int; type = boost::iterator_property_map, long unsigned int>, long unsigned int, long unsigned int&>]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/dijkstra_shortest_paths.hpp:273:33: required from ‘static boost::detail::vertex_property_map_generator::type boost::detail::vertex_property_map_generator::build(const Graph&, const IndexMap&, boost::scoped_array&) [with Graph = R_adjacency_list; IndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>; Value = long unsigned int; type = boost::iterator_property_map, long unsigned int>, long unsigned int, long unsigned int&>]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/dijkstra_shortest_paths.hpp:377:38: required from ‘void boost::dijkstra_shortest_paths_no_init(const Graph&, SourceInputIter, SourceInputIter, PredecessorMap, DistanceMap, WeightMap, IndexMap, Compare, Combine, DistZero, DijkstraVisitor, ColorMap) [with Graph = R_adjacency_list; SourceInputIter = long unsigned int*; DijkstraVisitor = dijkstra_visitor<>; PredecessorMap = long unsigned int*; DistanceMap = double*; WeightMap = adj_list_edge_property_map, edge_weight_t>; IndexMap = vec_adj_list_vertex_id_map, long unsigned int>; Compare = std::less; Combine = std::plus; DistZero = double; ColorMap = two_bit_color_map, long unsigned int> >]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/dijkstra_shortest_paths.hpp:464:36: [ skipping 2 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/dijkstra_shortest_paths.hpp:491:28: required from ‘void boost::dijkstra_shortest_paths(const VertexListGraph&, SourceInputIter, SourceInputIter, PredecessorMap, DistanceMap, WeightMap, IndexMap, Compare, Combine, DistInf, DistZero, DijkstraVisitor) [with VertexListGraph = R_adjacency_list; SourceInputIter = long unsigned int*; DijkstraVisitor = dijkstra_visitor<>; PredecessorMap = long unsigned int*; DistanceMap = double*; WeightMap = adj_list_edge_property_map, edge_weight_t>; IndexMap = vec_adj_list_vertex_id_map, long unsigned int>; Compare = std::less; Combine = std::plus; DistInf = double; DistZero = double]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/dijkstra_shortest_paths.hpp:434:28: required from ‘void boost::dijkstra_shortest_paths(const VertexListGraph&, typename graph_traits::vertex_descriptor, PredecessorMap, DistanceMap, WeightMap, IndexMap, Compare, Combine, DistInf, DistZero, DijkstraVisitor, const bgl_named_params&, typename enable_if_c::traversal_category>::value, graph::detail::no_parameter>::type) [with VertexListGraph = R_adjacency_list; DijkstraVisitor = dijkstra_visitor<>; PredecessorMap = long unsigned int*; DistanceMap = double*; WeightMap = adj_list_edge_property_map, edge_weight_t>; IndexMap = vec_adj_list_vertex_id_map, long unsigned int>; Compare = std::less; Combine = std::plus; DistInf = double; DistZero = double; T = double*; Tag = vertex_distance_t; Base = bgl_named_params; typename graph_traits::vertex_descriptor = long unsigned int; typename enable_if_c::traversal_category>::value, graph::detail::no_parameter>::type = graph::detail::no_parameter; typename graph_traits::traversal_category = adj_list_dir_traversal_tag]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/dijkstra_shortest_paths.hpp:528:32: required from ‘void boost::detail::dijkstra_dispatch2(const VertexListGraph&, typename boost::graph_traits::vertex_descriptor, DistanceMap, WeightMap, IndexMap, const Params&) [with VertexListGraph = R_adjacency_list; DistanceMap = double*; WeightMap = boost::adj_list_edge_property_map, boost::edge_weight_t>; IndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>; Params = boost::bgl_named_params >; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/dijkstra_shortest_paths.hpp:554:35: required from ‘void boost::detail::dijkstra_dispatch1(const VertexListGraph&, typename boost::graph_traits::vertex_descriptor, DistanceMap, WeightMap, IndexMap, const Params&) [with VertexListGraph = R_adjacency_list; DistanceMap = double*; WeightMap = boost::adj_list_edge_property_map, boost::edge_weight_t>; IndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>; Params = boost::bgl_named_params >; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/dijkstra_shortest_paths.hpp:570:31: required from ‘void boost::dijkstra_shortest_paths(const VertexListGraph&, typename graph_traits::vertex_descriptor, const bgl_named_params&) [with VertexListGraph = R_adjacency_list; Param = double*; Tag = vertex_distance_t; Rest = bgl_named_params; typename graph_traits::vertex_descriptor = long unsigned int]’ shortestPath.cpp:25:32: required from here /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:597:17: note: in a call to non-static member function ‘boost::RandomAccessIteratorConcept::~RandomAccessIteratorConcept()’ 597 | BOOST_concept(RandomAccessIterator,(TT)) | ^~~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/preprocessor/cat.hpp:29:34: note: in definition of macro ‘BOOST_PP_CAT_I’ 29 | # define BOOST_PP_CAT_I(a, b) a ## b | ^ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/concept_def.hpp:23:12: note: in expansion of macro ‘BOOST_PP_CAT’ 23 | struct BOOST_PP_CAT(name,Concept) \ | ^~~~~~~~~~~~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:597:3: note: in expansion of macro ‘BOOST_concept’ 597 | BOOST_concept(RandomAccessIterator,(TT)) | ^~~~~~~~~~~~~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::CopyConstructible, boost::d_ary_heap_indirect, long unsigned int>, long unsigned int, long unsigned int&>, double*, std::less, std::vector >, boost::adj_list_edge_property_map, boost::edge_weight_t>, long unsigned int*, double*, std::plus, std::less > >]’: /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements, boost::d_ary_heap_indirect, long unsigned int>, long unsigned int, long unsigned int&>, double*, std::less, std::vector >, boost::adj_list_edge_property_map, boost::edge_weight_t>, long unsigned int*, double*, std::plus, std::less > > >]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:167:5: required from ‘struct boost::CopyConstructible, boost::d_ary_heap_indirect, long unsigned int>, long unsigned int, long unsigned int&>, double*, std::less, std::vector >, boost::adj_list_edge_property_map, boost::edge_weight_t>, long unsigned int*, double*, std::plus, std::less > >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:165:3: required from ‘struct boost::CopyConstructibleConcept, boost::d_ary_heap_indirect, long unsigned int>, long unsigned int, long unsigned int&>, double*, std::less, std::vector >, boost::adj_list_edge_property_map, boost::edge_weight_t>, long unsigned int*, double*, std::plus, std::less > >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::CopyConstructibleConcept, boost::d_ary_heap_indirect, long unsigned int>, long unsigned int, long unsigned int&>, double*, std::less, std::vector >, boost::adj_list_edge_property_map, boost::edge_weight_t>, long unsigned int*, double*, std::plus, std::less > >]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied, boost::d_ary_heap_indirect, long unsigned int>, long unsigned int, long unsigned int&>, double*, std::less, std::vector >, boost::adj_list_edge_property_map, boost::edge_weight_t>, long unsigned int*, double*, std::plus, std::less > > >::value’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:45:51: [ skipping 11 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/dijkstra_shortest_paths.hpp:491:28: required from ‘void boost::dijkstra_shortest_paths(const VertexListGraph&, SourceInputIter, SourceInputIter, PredecessorMap, DistanceMap, WeightMap, IndexMap, Compare, Combine, DistInf, DistZero, DijkstraVisitor) [with VertexListGraph = R_adjacency_list; SourceInputIter = long unsigned int*; DijkstraVisitor = dijkstra_visitor<>; PredecessorMap = long unsigned int*; DistanceMap = double*; WeightMap = adj_list_edge_property_map, edge_weight_t>; IndexMap = vec_adj_list_vertex_id_map, long unsigned int>; Compare = std::less; Combine = std::plus; DistInf = double; DistZero = double]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/dijkstra_shortest_paths.hpp:434:28: required from ‘void boost::dijkstra_shortest_paths(const VertexListGraph&, typename graph_traits::vertex_descriptor, PredecessorMap, DistanceMap, WeightMap, IndexMap, Compare, Combine, DistInf, DistZero, DijkstraVisitor, const bgl_named_params&, typename enable_if_c::traversal_category>::value, graph::detail::no_parameter>::type) [with VertexListGraph = R_adjacency_list; DijkstraVisitor = dijkstra_visitor<>; PredecessorMap = long unsigned int*; DistanceMap = double*; WeightMap = adj_list_edge_property_map, edge_weight_t>; IndexMap = vec_adj_list_vertex_id_map, long unsigned int>; Compare = std::less; Combine = std::plus; DistInf = double; DistZero = double; T = double*; Tag = vertex_distance_t; Base = bgl_named_params; typename graph_traits::vertex_descriptor = long unsigned int; typename enable_if_c::traversal_category>::value, graph::detail::no_parameter>::type = graph::detail::no_parameter; typename graph_traits::traversal_category = adj_list_dir_traversal_tag]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/dijkstra_shortest_paths.hpp:528:32: required from ‘void boost::detail::dijkstra_dispatch2(const VertexListGraph&, typename boost::graph_traits::vertex_descriptor, DistanceMap, WeightMap, IndexMap, const Params&) [with VertexListGraph = R_adjacency_list; DistanceMap = double*; WeightMap = boost::adj_list_edge_property_map, boost::edge_weight_t>; IndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>; Params = boost::bgl_named_params >; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/dijkstra_shortest_paths.hpp:554:35: required from ‘void boost::detail::dijkstra_dispatch1(const VertexListGraph&, typename boost::graph_traits::vertex_descriptor, DistanceMap, WeightMap, IndexMap, const Params&) [with VertexListGraph = R_adjacency_list; DistanceMap = double*; WeightMap = boost::adj_list_edge_property_map, boost::edge_weight_t>; IndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>; Params = boost::bgl_named_params >; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/dijkstra_shortest_paths.hpp:570:31: required from ‘void boost::dijkstra_shortest_paths(const VertexListGraph&, typename graph_traits::vertex_descriptor, const bgl_named_params&) [with VertexListGraph = R_adjacency_list; Param = double*; Tag = vertex_distance_t; Rest = bgl_named_params; typename graph_traits::vertex_descriptor = long unsigned int]’ shortestPath.cpp:25:32: required from here /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::CopyConstructible::~CopyConstructible() [with TT = boost::detail::dijkstra_bfs_visitor, boost::d_ary_heap_indirect, long unsigned int>, long unsigned int, long unsigned int&>, double*, std::less, std::vector >, boost::adj_list_edge_property_map, boost::edge_weight_t>, long unsigned int*, double*, std::plus, std::less >]’ 37 | ~model() | ^ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:167:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 167 | BOOST_CONCEPT_USAGE(CopyConstructible) { | ^~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements >]’: /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:208:5: required from ‘struct boost::Convertible’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:206:3: required from ‘struct boost::ConvertibleConcept’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::ConvertibleConcept]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied >::value’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:72:8: [ skipping 15 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/dijkstra_shortest_paths.hpp:491:28: required from ‘void boost::dijkstra_shortest_paths(const VertexListGraph&, SourceInputIter, SourceInputIter, PredecessorMap, DistanceMap, WeightMap, IndexMap, Compare, Combine, DistInf, DistZero, DijkstraVisitor) [with VertexListGraph = R_adjacency_list; SourceInputIter = long unsigned int*; DijkstraVisitor = dijkstra_visitor<>; PredecessorMap = long unsigned int*; DistanceMap = double*; WeightMap = adj_list_edge_property_map, edge_weight_t>; IndexMap = vec_adj_list_vertex_id_map, long unsigned int>; Compare = std::less; Combine = std::plus; DistInf = double; DistZero = double]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/dijkstra_shortest_paths.hpp:434:28: required from ‘void boost::dijkstra_shortest_paths(const VertexListGraph&, typename graph_traits::vertex_descriptor, PredecessorMap, DistanceMap, WeightMap, IndexMap, Compare, Combine, DistInf, DistZero, DijkstraVisitor, const bgl_named_params&, typename enable_if_c::traversal_category>::value, graph::detail::no_parameter>::type) [with VertexListGraph = R_adjacency_list; DijkstraVisitor = dijkstra_visitor<>; PredecessorMap = long unsigned int*; DistanceMap = double*; WeightMap = adj_list_edge_property_map, edge_weight_t>; IndexMap = vec_adj_list_vertex_id_map, long unsigned int>; Compare = std::less; Combine = std::plus; DistInf = double; DistZero = double; T = double*; Tag = vertex_distance_t; Base = bgl_named_params; typename graph_traits::vertex_descriptor = long unsigned int; typename enable_if_c::traversal_category>::value, graph::detail::no_parameter>::type = graph::detail::no_parameter; typename graph_traits::traversal_category = adj_list_dir_traversal_tag]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/dijkstra_shortest_paths.hpp:528:32: required from ‘void boost::detail::dijkstra_dispatch2(const VertexListGraph&, typename boost::graph_traits::vertex_descriptor, DistanceMap, WeightMap, IndexMap, const Params&) [with VertexListGraph = R_adjacency_list; DistanceMap = double*; WeightMap = boost::adj_list_edge_property_map, boost::edge_weight_t>; IndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>; Params = boost::bgl_named_params >; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/dijkstra_shortest_paths.hpp:554:35: required from ‘void boost::detail::dijkstra_dispatch1(const VertexListGraph&, typename boost::graph_traits::vertex_descriptor, DistanceMap, WeightMap, IndexMap, const Params&) [with VertexListGraph = R_adjacency_list; DistanceMap = double*; WeightMap = boost::adj_list_edge_property_map, boost::edge_weight_t>; IndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>; Params = boost::bgl_named_params >; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/dijkstra_shortest_paths.hpp:570:31: required from ‘void boost::dijkstra_shortest_paths(const VertexListGraph&, typename graph_traits::vertex_descriptor, const bgl_named_params&) [with VertexListGraph = R_adjacency_list; Param = double*; Tag = vertex_distance_t; Rest = bgl_named_params; typename graph_traits::vertex_descriptor = long unsigned int]’ shortestPath.cpp:25:32: required from here /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::Convertible]’ 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ^ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::ConvertibleConcept]’: /home/omnipath/local/R/4.4-3.20/BH/include/boost/property_map/property_map.hpp:148:7: required from ‘void boost::ReadablePropertyMapConcept::constraints() [with PMap = boost::two_bit_color_map, long unsigned int> >; Key = long unsigned int]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::ReadablePropertyMapConcept, long unsigned int> >, long unsigned int>]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied, long unsigned int> >, long unsigned int> >::value’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied, long unsigned int> >, long unsigned int> >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_, long unsigned int> >, long unsigned int>)>’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/property_map/property_map.hpp:206:7: [ skipping 9 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/dijkstra_shortest_paths.hpp:491:28: required from ‘void boost::dijkstra_shortest_paths(const VertexListGraph&, SourceInputIter, SourceInputIter, PredecessorMap, DistanceMap, WeightMap, IndexMap, Compare, Combine, DistInf, DistZero, DijkstraVisitor) [with VertexListGraph = R_adjacency_list; SourceInputIter = long unsigned int*; DijkstraVisitor = dijkstra_visitor<>; PredecessorMap = long unsigned int*; DistanceMap = double*; WeightMap = adj_list_edge_property_map, edge_weight_t>; IndexMap = vec_adj_list_vertex_id_map, long unsigned int>; Compare = std::less; Combine = std::plus; DistInf = double; DistZero = double]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/dijkstra_shortest_paths.hpp:434:28: required from ‘void boost::dijkstra_shortest_paths(const VertexListGraph&, typename graph_traits::vertex_descriptor, PredecessorMap, DistanceMap, WeightMap, IndexMap, Compare, Combine, DistInf, DistZero, DijkstraVisitor, const bgl_named_params&, typename enable_if_c::traversal_category>::value, graph::detail::no_parameter>::type) [with VertexListGraph = R_adjacency_list; DijkstraVisitor = dijkstra_visitor<>; PredecessorMap = long unsigned int*; DistanceMap = double*; WeightMap = adj_list_edge_property_map, edge_weight_t>; IndexMap = vec_adj_list_vertex_id_map, long unsigned int>; Compare = std::less; Combine = std::plus; DistInf = double; DistZero = double; T = double*; Tag = vertex_distance_t; Base = bgl_named_params; typename graph_traits::vertex_descriptor = long unsigned int; typename enable_if_c::traversal_category>::value, graph::detail::no_parameter>::type = graph::detail::no_parameter; typename graph_traits::traversal_category = adj_list_dir_traversal_tag]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/dijkstra_shortest_paths.hpp:528:32: required from ‘void boost::detail::dijkstra_dispatch2(const VertexListGraph&, typename boost::graph_traits::vertex_descriptor, DistanceMap, WeightMap, IndexMap, const Params&) [with VertexListGraph = R_adjacency_list; DistanceMap = double*; WeightMap = boost::adj_list_edge_property_map, boost::edge_weight_t>; IndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>; Params = boost::bgl_named_params >; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/dijkstra_shortest_paths.hpp:554:35: required from ‘void boost::detail::dijkstra_dispatch1(const VertexListGraph&, typename boost::graph_traits::vertex_descriptor, DistanceMap, WeightMap, IndexMap, const Params&) [with VertexListGraph = R_adjacency_list; DistanceMap = double*; WeightMap = boost::adj_list_edge_property_map, boost::edge_weight_t>; IndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>; Params = boost::bgl_named_params >; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/dijkstra_shortest_paths.hpp:570:31: required from ‘void boost::dijkstra_shortest_paths(const VertexListGraph&, typename graph_traits::vertex_descriptor, const bgl_named_params&) [with VertexListGraph = R_adjacency_list; Param = double*; Tag = vertex_distance_t; Rest = bgl_named_params; typename graph_traits::vertex_descriptor = long unsigned int]’ shortestPath.cpp:25:32: required from here /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:206:17: note: in a call to non-static member function ‘boost::ConvertibleConcept::~ConvertibleConcept()’ 206 | BOOST_concept(Convertible,(X)(Y)) | ^~~~~~~~~~~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/preprocessor/cat.hpp:29:34: note: in definition of macro ‘BOOST_PP_CAT_I’ 29 | # define BOOST_PP_CAT_I(a, b) a ## b | ^ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/concept_def.hpp:23:12: note: in expansion of macro ‘BOOST_PP_CAT’ 23 | struct BOOST_PP_CAT(name,Concept) \ | ^~~~~~~~~~~~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:206:3: note: in expansion of macro ‘BOOST_concept’ 206 | BOOST_concept(Convertible,(X)(Y)) | ^~~~~~~~~~~~~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements >]’: /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:208:5: required from ‘struct boost::Convertible’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:206:3: required from ‘struct boost::ConvertibleConcept’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::ConvertibleConcept]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied >::value’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:72:8: [ skipping 15 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/dijkstra_shortest_paths.hpp:491:28: required from ‘void boost::dijkstra_shortest_paths(const VertexListGraph&, SourceInputIter, SourceInputIter, PredecessorMap, DistanceMap, WeightMap, IndexMap, Compare, Combine, DistInf, DistZero, DijkstraVisitor) [with VertexListGraph = R_adjacency_list; SourceInputIter = long unsigned int*; DijkstraVisitor = dijkstra_visitor<>; PredecessorMap = long unsigned int*; DistanceMap = double*; WeightMap = adj_list_edge_property_map, edge_weight_t>; IndexMap = vec_adj_list_vertex_id_map, long unsigned int>; Compare = std::less; Combine = std::plus; DistInf = double; DistZero = double]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/dijkstra_shortest_paths.hpp:434:28: required from ‘void boost::dijkstra_shortest_paths(const VertexListGraph&, typename graph_traits::vertex_descriptor, PredecessorMap, DistanceMap, WeightMap, IndexMap, Compare, Combine, DistInf, DistZero, DijkstraVisitor, const bgl_named_params&, typename enable_if_c::traversal_category>::value, graph::detail::no_parameter>::type) [with VertexListGraph = R_adjacency_list; DijkstraVisitor = dijkstra_visitor<>; PredecessorMap = long unsigned int*; DistanceMap = double*; WeightMap = adj_list_edge_property_map, edge_weight_t>; IndexMap = vec_adj_list_vertex_id_map, long unsigned int>; Compare = std::less; Combine = std::plus; DistInf = double; DistZero = double; T = double*; Tag = vertex_distance_t; Base = bgl_named_params; typename graph_traits::vertex_descriptor = long unsigned int; typename enable_if_c::traversal_category>::value, graph::detail::no_parameter>::type = graph::detail::no_parameter; typename graph_traits::traversal_category = adj_list_dir_traversal_tag]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/dijkstra_shortest_paths.hpp:528:32: required from ‘void boost::detail::dijkstra_dispatch2(const VertexListGraph&, typename boost::graph_traits::vertex_descriptor, DistanceMap, WeightMap, IndexMap, const Params&) [with VertexListGraph = R_adjacency_list; DistanceMap = double*; WeightMap = boost::adj_list_edge_property_map, boost::edge_weight_t>; IndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>; Params = boost::bgl_named_params >; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/dijkstra_shortest_paths.hpp:554:35: required from ‘void boost::detail::dijkstra_dispatch1(const VertexListGraph&, typename boost::graph_traits::vertex_descriptor, DistanceMap, WeightMap, IndexMap, const Params&) [with VertexListGraph = R_adjacency_list; DistanceMap = double*; WeightMap = boost::adj_list_edge_property_map, boost::edge_weight_t>; IndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>; Params = boost::bgl_named_params >; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/dijkstra_shortest_paths.hpp:570:31: required from ‘void boost::dijkstra_shortest_paths(const VertexListGraph&, typename graph_traits::vertex_descriptor, const bgl_named_params&) [with VertexListGraph = R_adjacency_list; Param = double*; Tag = vertex_distance_t; Rest = bgl_named_params; typename graph_traits::vertex_descriptor = long unsigned int]’ shortestPath.cpp:25:32: required from here /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::Convertible]’ 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ^ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::ConvertibleConcept]’: /home/omnipath/local/R/4.4-3.20/BH/include/boost/property_map/property_map.hpp:180:7: required from ‘void boost::WritablePropertyMapConcept::constraints() [with PMap = boost::two_bit_color_map, long unsigned int> >; Key = long unsigned int]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::WritablePropertyMapConcept, long unsigned int> >, long unsigned int>]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied, long unsigned int> >, long unsigned int> >::value’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied, long unsigned int> >, long unsigned int> >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_, long unsigned int> >, long unsigned int>)>’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/property_map/property_map.hpp:207:7: [ skipping 9 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/dijkstra_shortest_paths.hpp:491:28: required from ‘void boost::dijkstra_shortest_paths(const VertexListGraph&, SourceInputIter, SourceInputIter, PredecessorMap, DistanceMap, WeightMap, IndexMap, Compare, Combine, DistInf, DistZero, DijkstraVisitor) [with VertexListGraph = R_adjacency_list; SourceInputIter = long unsigned int*; DijkstraVisitor = dijkstra_visitor<>; PredecessorMap = long unsigned int*; DistanceMap = double*; WeightMap = adj_list_edge_property_map, edge_weight_t>; IndexMap = vec_adj_list_vertex_id_map, long unsigned int>; Compare = std::less; Combine = std::plus; DistInf = double; DistZero = double]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/dijkstra_shortest_paths.hpp:434:28: required from ‘void boost::dijkstra_shortest_paths(const VertexListGraph&, typename graph_traits::vertex_descriptor, PredecessorMap, DistanceMap, WeightMap, IndexMap, Compare, Combine, DistInf, DistZero, DijkstraVisitor, const bgl_named_params&, typename enable_if_c::traversal_category>::value, graph::detail::no_parameter>::type) [with VertexListGraph = R_adjacency_list; DijkstraVisitor = dijkstra_visitor<>; PredecessorMap = long unsigned int*; DistanceMap = double*; WeightMap = adj_list_edge_property_map, edge_weight_t>; IndexMap = vec_adj_list_vertex_id_map, long unsigned int>; Compare = std::less; Combine = std::plus; DistInf = double; DistZero = double; T = double*; Tag = vertex_distance_t; Base = bgl_named_params; typename graph_traits::vertex_descriptor = long unsigned int; typename enable_if_c::traversal_category>::value, graph::detail::no_parameter>::type = graph::detail::no_parameter; typename graph_traits::traversal_category = adj_list_dir_traversal_tag]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/dijkstra_shortest_paths.hpp:528:32: required from ‘void boost::detail::dijkstra_dispatch2(const VertexListGraph&, typename boost::graph_traits::vertex_descriptor, DistanceMap, WeightMap, IndexMap, const Params&) [with VertexListGraph = R_adjacency_list; DistanceMap = double*; WeightMap = boost::adj_list_edge_property_map, boost::edge_weight_t>; IndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>; Params = boost::bgl_named_params >; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/dijkstra_shortest_paths.hpp:554:35: required from ‘void boost::detail::dijkstra_dispatch1(const VertexListGraph&, typename boost::graph_traits::vertex_descriptor, DistanceMap, WeightMap, IndexMap, const Params&) [with VertexListGraph = R_adjacency_list; DistanceMap = double*; WeightMap = boost::adj_list_edge_property_map, boost::edge_weight_t>; IndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>; Params = boost::bgl_named_params >; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/dijkstra_shortest_paths.hpp:570:31: required from ‘void boost::dijkstra_shortest_paths(const VertexListGraph&, typename graph_traits::vertex_descriptor, const bgl_named_params&) [with VertexListGraph = R_adjacency_list; Param = double*; Tag = vertex_distance_t; Rest = bgl_named_params; typename graph_traits::vertex_descriptor = long unsigned int]’ shortestPath.cpp:25:32: required from here /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:206:17: note: in a call to non-static member function ‘boost::ConvertibleConcept::~ConvertibleConcept()’ 206 | BOOST_concept(Convertible,(X)(Y)) | ^~~~~~~~~~~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/preprocessor/cat.hpp:29:34: note: in definition of macro ‘BOOST_PP_CAT_I’ 29 | # define BOOST_PP_CAT_I(a, b) a ## b | ^ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/concept_def.hpp:23:12: note: in expansion of macro ‘BOOST_PP_CAT’ 23 | struct BOOST_PP_CAT(name,Concept) \ | ^~~~~~~~~~~~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:206:3: note: in expansion of macro ‘BOOST_concept’ 206 | BOOST_concept(Convertible,(X)(Y)) | ^~~~~~~~~~~~~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::Convertible]’: /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements >]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:208:5: required from ‘struct boost::Convertible’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:206:3: required from ‘struct boost::ConvertibleConcept’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::ConvertibleConcept]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied >::value’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:45:51: [ skipping 11 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/dijkstra_shortest_paths.hpp:491:28: required from ‘void boost::dijkstra_shortest_paths(const VertexListGraph&, SourceInputIter, SourceInputIter, PredecessorMap, DistanceMap, WeightMap, IndexMap, Compare, Combine, DistInf, DistZero, DijkstraVisitor) [with VertexListGraph = R_adjacency_list; SourceInputIter = long unsigned int*; DijkstraVisitor = dijkstra_visitor<>; PredecessorMap = long unsigned int*; DistanceMap = double*; WeightMap = adj_list_edge_property_map, edge_weight_t>; IndexMap = vec_adj_list_vertex_id_map, long unsigned int>; Compare = std::less; Combine = std::plus; DistInf = double; DistZero = double]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/dijkstra_shortest_paths.hpp:434:28: required from ‘void boost::dijkstra_shortest_paths(const VertexListGraph&, typename graph_traits::vertex_descriptor, PredecessorMap, DistanceMap, WeightMap, IndexMap, Compare, Combine, DistInf, DistZero, DijkstraVisitor, const bgl_named_params&, typename enable_if_c::traversal_category>::value, graph::detail::no_parameter>::type) [with VertexListGraph = R_adjacency_list; DijkstraVisitor = dijkstra_visitor<>; PredecessorMap = long unsigned int*; DistanceMap = double*; WeightMap = adj_list_edge_property_map, edge_weight_t>; IndexMap = vec_adj_list_vertex_id_map, long unsigned int>; Compare = std::less; Combine = std::plus; DistInf = double; DistZero = double; T = double*; Tag = vertex_distance_t; Base = bgl_named_params; typename graph_traits::vertex_descriptor = long unsigned int; typename enable_if_c::traversal_category>::value, graph::detail::no_parameter>::type = graph::detail::no_parameter; typename graph_traits::traversal_category = adj_list_dir_traversal_tag]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/dijkstra_shortest_paths.hpp:528:32: required from ‘void boost::detail::dijkstra_dispatch2(const VertexListGraph&, typename boost::graph_traits::vertex_descriptor, DistanceMap, WeightMap, IndexMap, const Params&) [with VertexListGraph = R_adjacency_list; DistanceMap = double*; WeightMap = boost::adj_list_edge_property_map, boost::edge_weight_t>; IndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>; Params = boost::bgl_named_params >; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/dijkstra_shortest_paths.hpp:554:35: required from ‘void boost::detail::dijkstra_dispatch1(const VertexListGraph&, typename boost::graph_traits::vertex_descriptor, DistanceMap, WeightMap, IndexMap, const Params&) [with VertexListGraph = R_adjacency_list; DistanceMap = double*; WeightMap = boost::adj_list_edge_property_map, boost::edge_weight_t>; IndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>; Params = boost::bgl_named_params >; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/dijkstra_shortest_paths.hpp:570:31: required from ‘void boost::dijkstra_shortest_paths(const VertexListGraph&, typename graph_traits::vertex_descriptor, const bgl_named_params&) [with VertexListGraph = R_adjacency_list; Param = double*; Tag = vertex_distance_t; Rest = bgl_named_params; typename graph_traits::vertex_descriptor = long unsigned int]’ shortestPath.cpp:25:32: required from here /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::Convertible::~Convertible() [with X = boost::read_write_property_map_tag; Y = boost::read_write_property_map_tag]’ 37 | ~model() | ^ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:208:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 208 | BOOST_CONCEPT_USAGE(Convertible) { | ^~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >]’: /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/graph_concepts.hpp:52:50: required from ‘struct boost::concepts::MultiPassInputIterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::concepts::MultiPassInputIterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> >]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::value’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_ > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> >)>’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/graph_concepts.hpp:89:9: [ skipping 6 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/dijkstra_shortest_paths.hpp:491:28: required from ‘void boost::dijkstra_shortest_paths(const VertexListGraph&, SourceInputIter, SourceInputIter, PredecessorMap, DistanceMap, WeightMap, IndexMap, Compare, Combine, DistInf, DistZero, DijkstraVisitor) [with VertexListGraph = adjacency_list, property >, no_property, listS>; SourceInputIter = long unsigned int*; DijkstraVisitor = dijkstra_visitor<>; PredecessorMap = dummy_property_map; DistanceMap = vec_adj_list_vertex_property_map, property >, no_property, listS>, adjacency_list, property >, no_property, listS>*, double, double&, vertex_distance_t>; WeightMap = adj_list_edge_property_map >, edge_weight2_t>; IndexMap = vec_adj_list_vertex_id_map, long unsigned int>; Compare = std::less; Combine = closed_plus; DistInf = double; DistZero = double]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/dijkstra_shortest_paths.hpp:505:28: required from ‘void boost::dijkstra_shortest_paths(const VertexListGraph&, typename graph_traits::vertex_descriptor, PredecessorMap, DistanceMap, WeightMap, IndexMap, Compare, Combine, DistInf, DistZero, DijkstraVisitor) [with VertexListGraph = adjacency_list, property >, no_property, listS>; DijkstraVisitor = dijkstra_visitor<>; PredecessorMap = dummy_property_map; DistanceMap = vec_adj_list_vertex_property_map, property >, no_property, listS>, adjacency_list, property >, no_property, listS>*, double, double&, vertex_distance_t>; WeightMap = adj_list_edge_property_map >, edge_weight2_t>; IndexMap = vec_adj_list_vertex_id_map, long unsigned int>; Compare = std::less; Combine = closed_plus; DistInf = double; DistZero = double; typename graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/johnson_all_pairs_shortest.hpp:127:36: required from ‘bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, VertexID, Weight, const BinaryPredicate&, const BinaryFunction&, const Infinity&, DistanceZero) [with VertexAndEdgeListGraph = R_adjacency_list; DistanceMatrix = Basic2DMatrix; VertexID = vec_adj_list_vertex_id_map, long unsigned int>; Weight = adj_list_edge_property_map, edge_weight_t>; BinaryPredicate = std::less; BinaryFunction = closed_plus; Infinity = double; DistanceZero = double]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/johnson_all_pairs_shortest.hpp:164:48: required from ‘bool boost::detail::johnson_dispatch(VertexAndEdgeListGraph&, DistanceMatrix&, const boost::bgl_named_params&, Weight, VertexID) [with VertexAndEdgeListGraph = R_adjacency_list; DistanceMatrix = Basic2DMatrix; P = int; T = int; R = boost::no_property; Weight = boost::adj_list_edge_property_map, boost::edge_weight_t>; VertexID = boost::vec_adj_list_vertex_id_map, long unsigned int>]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/johnson_all_pairs_shortest.hpp:192:36: required from ‘bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&) [with VertexAndEdgeListGraph = R_adjacency_list; DistanceMatrix = Basic2DMatrix]’ shortestPath.cpp:56:41: required from here /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::concepts::MultiPassInputIterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> >]’ 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ^ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::MultiPassInputIterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> >]’: /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/graph_concepts.hpp:89:9: required from ‘boost::concepts::IncidenceGraph::~IncidenceGraph() [with G = boost::adjacency_list, boost::property >, boost::no_property, boost::listS>]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/graph_concepts.hpp:75:1: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::IncidenceGraphConcept, boost::property >, boost::no_property, boost::listS> >]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/breadth_first_search.hpp:62:5: required from ‘void boost::breadth_first_visit(const IncidenceGraph&, SourceIterator, SourceIterator, Buffer&, BFSVisitor, ColorMap) [with IncidenceGraph = adjacency_list, property >, no_property, listS>; Buffer = d_ary_heap_indirect, long unsigned int>, long unsigned int, long unsigned int&>, vec_adj_list_vertex_property_map, property >, no_property, listS>, adjacency_list, property >, no_property, listS>*, double, double&, vertex_distance_t>, std::less, std::vector >; BFSVisitor = detail::dijkstra_bfs_visitor, d_ary_heap_indirect, long unsigned int>, long unsigned int, long unsigned int&>, vec_adj_list_vertex_property_map, property >, no_property, listS>, adjacency_list, property >, no_property, listS>*, double, double&, vertex_distance_t>, std::less, std::vector >, adj_list_edge_property_map >, edge_weight2_t>, dummy_property_map, vec_adj_list_vertex_property_map, property >, no_property, listS>, adjacency_list, property >, no_property, listS>*, double, double&, vertex_distance_t>, closed_plus, std::less >; ColorMap = two_bit_color_map, long unsigned int> >; SourceIterator = long unsigned int*]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/dijkstra_shortest_paths.hpp:387:24: required from ‘void boost::dijkstra_shortest_paths_no_init(const Graph&, SourceInputIter, SourceInputIter, PredecessorMap, DistanceMap, WeightMap, IndexMap, Compare, Combine, DistZero, DijkstraVisitor, ColorMap) [with Graph = adjacency_list, property >, no_property, listS>; SourceInputIter = long unsigned int*; DijkstraVisitor = dijkstra_visitor<>; PredecessorMap = dummy_property_map; DistanceMap = vec_adj_list_vertex_property_map, property >, no_property, listS>, adjacency_list, property >, no_property, listS>*, double, double&, vertex_distance_t>; WeightMap = adj_list_edge_property_map >, edge_weight2_t>; IndexMap = vec_adj_list_vertex_id_map, long unsigned int>; Compare = std::less; Combine = closed_plus; DistZero = double; ColorMap = two_bit_color_map, long unsigned int> >]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/dijkstra_shortest_paths.hpp:464:36: [ skipping 2 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/dijkstra_shortest_paths.hpp:491:28: required from ‘void boost::dijkstra_shortest_paths(const VertexListGraph&, SourceInputIter, SourceInputIter, PredecessorMap, DistanceMap, WeightMap, IndexMap, Compare, Combine, DistInf, DistZero, DijkstraVisitor) [with VertexListGraph = adjacency_list, property >, no_property, listS>; SourceInputIter = long unsigned int*; DijkstraVisitor = dijkstra_visitor<>; PredecessorMap = dummy_property_map; DistanceMap = vec_adj_list_vertex_property_map, property >, no_property, listS>, adjacency_list, property >, no_property, listS>*, double, double&, vertex_distance_t>; WeightMap = adj_list_edge_property_map >, edge_weight2_t>; IndexMap = vec_adj_list_vertex_id_map, long unsigned int>; Compare = std::less; Combine = closed_plus; DistInf = double; DistZero = double]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/dijkstra_shortest_paths.hpp:505:28: required from ‘void boost::dijkstra_shortest_paths(const VertexListGraph&, typename graph_traits::vertex_descriptor, PredecessorMap, DistanceMap, WeightMap, IndexMap, Compare, Combine, DistInf, DistZero, DijkstraVisitor) [with VertexListGraph = adjacency_list, property >, no_property, listS>; DijkstraVisitor = dijkstra_visitor<>; PredecessorMap = dummy_property_map; DistanceMap = vec_adj_list_vertex_property_map, property >, no_property, listS>, adjacency_list, property >, no_property, listS>*, double, double&, vertex_distance_t>; WeightMap = adj_list_edge_property_map >, edge_weight2_t>; IndexMap = vec_adj_list_vertex_id_map, long unsigned int>; Compare = std::less; Combine = closed_plus; DistInf = double; DistZero = double; typename graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/johnson_all_pairs_shortest.hpp:127:36: required from ‘bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, VertexID, Weight, const BinaryPredicate&, const BinaryFunction&, const Infinity&, DistanceZero) [with VertexAndEdgeListGraph = R_adjacency_list; DistanceMatrix = Basic2DMatrix; VertexID = vec_adj_list_vertex_id_map, long unsigned int>; Weight = adj_list_edge_property_map, edge_weight_t>; BinaryPredicate = std::less; BinaryFunction = closed_plus; Infinity = double; DistanceZero = double]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/johnson_all_pairs_shortest.hpp:164:48: required from ‘bool boost::detail::johnson_dispatch(VertexAndEdgeListGraph&, DistanceMatrix&, const boost::bgl_named_params&, Weight, VertexID) [with VertexAndEdgeListGraph = R_adjacency_list; DistanceMatrix = Basic2DMatrix; P = int; T = int; R = boost::no_property; Weight = boost::adj_list_edge_property_map, boost::edge_weight_t>; VertexID = boost::vec_adj_list_vertex_id_map, long unsigned int>]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/johnson_all_pairs_shortest.hpp:192:36: required from ‘bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&) [with VertexAndEdgeListGraph = R_adjacency_list; DistanceMatrix = Basic2DMatrix]’ shortestPath.cpp:56:41: required from here /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::concepts::MultiPassInputIterator::~MultiPassInputIterator() [with T = boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>]’ 37 | ~model() | ^ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/graph_concepts.hpp:52:50: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 52 | BOOST_concept(MultiPassInputIterator, (T)) { BOOST_CONCEPT_USAGE( | ^~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::CopyConstructible, boost::d_ary_heap_indirect, long unsigned int>, long unsigned int, long unsigned int&>, boost::vec_adj_list_vertex_property_map, boost::property >, boost::no_property, boost::listS>, boost::adjacency_list, boost::property >, boost::no_property, boost::listS>*, double, double&, boost::vertex_distance_t>, std::less, std::vector >, boost::adj_list_edge_property_map >, boost::edge_weight2_t>, boost::dummy_property_map, boost::vec_adj_list_vertex_property_map, boost::property >, boost::no_property, boost::listS>, boost::adjacency_list, boost::property >, boost::no_property, boost::listS>*, double, double&, boost::vertex_distance_t>, boost::closed_plus, std::less > >]’: /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements, boost::d_ary_heap_indirect, long unsigned int>, long unsigned int, long unsigned int&>, boost::vec_adj_list_vertex_property_map, boost::property >, boost::no_property, boost::listS>, boost::adjacency_list, boost::property >, boost::no_property, boost::listS>*, double, double&, boost::vertex_distance_t>, std::less, std::vector >, boost::adj_list_edge_property_map >, boost::edge_weight2_t>, boost::dummy_property_map, boost::vec_adj_list_vertex_property_map, boost::property >, boost::no_property, boost::listS>, boost::adjacency_list, boost::property >, boost::no_property, boost::listS>*, double, double&, boost::vertex_distance_t>, boost::closed_plus, std::less > > >]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:167:5: required from ‘struct boost::CopyConstructible, boost::d_ary_heap_indirect, long unsigned int>, long unsigned int, long unsigned int&>, boost::vec_adj_list_vertex_property_map, boost::property >, boost::no_property, boost::listS>, boost::adjacency_list, boost::property >, boost::no_property, boost::listS>*, double, double&, boost::vertex_distance_t>, std::less, std::vector >, boost::adj_list_edge_property_map >, boost::edge_weight2_t>, boost::dummy_property_map, boost::vec_adj_list_vertex_property_map, boost::property >, boost::no_property, boost::listS>, boost::adjacency_list, boost::property >, boost::no_property, boost::listS>*, double, double&, boost::vertex_distance_t>, boost::closed_plus, std::less > >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:165:3: required from ‘struct boost::CopyConstructibleConcept, boost::d_ary_heap_indirect, long unsigned int>, long unsigned int, long unsigned int&>, boost::vec_adj_list_vertex_property_map, boost::property >, boost::no_property, boost::listS>, boost::adjacency_list, boost::property >, boost::no_property, boost::listS>*, double, double&, boost::vertex_distance_t>, std::less, std::vector >, boost::adj_list_edge_property_map >, boost::edge_weight2_t>, boost::dummy_property_map, boost::vec_adj_list_vertex_property_map, boost::property >, boost::no_property, boost::listS>, boost::adjacency_list, boost::property >, boost::no_property, boost::listS>*, double, double&, boost::vertex_distance_t>, boost::closed_plus, std::less > >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::CopyConstructibleConcept, boost::d_ary_heap_indirect, long unsigned int>, long unsigned int, long unsigned int&>, boost::vec_adj_list_vertex_property_map, boost::property >, boost::no_property, boost::listS>, boost::adjacency_list, boost::property >, boost::no_property, boost::listS>*, double, double&, boost::vertex_distance_t>, std::less, std::vector >, boost::adj_list_edge_property_map >, boost::edge_weight2_t>, boost::dummy_property_map, boost::vec_adj_list_vertex_property_map, boost::property >, boost::no_property, boost::listS>, boost::adjacency_list, boost::property >, boost::no_property, boost::listS>*, double, double&, boost::vertex_distance_t>, boost::closed_plus, std::less > >]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied, boost::d_ary_heap_indirect, long unsigned int>, long unsigned int, long unsigned int&>, boost::vec_adj_list_vertex_property_map, boost::property >, boost::no_property, boost::listS>, boost::adjacency_list, boost::property >, boost::no_property, boost::listS>*, double, double&, boost::vertex_distance_t>, std::less, std::vector >, boost::adj_list_edge_property_map >, boost::edge_weight2_t>, boost::dummy_property_map, boost::vec_adj_list_vertex_property_map, boost::property >, boost::no_property, boost::listS>, boost::adjacency_list, boost::property >, boost::no_property, boost::listS>*, double, double&, boost::vertex_distance_t>, boost::closed_plus, std::less > > >::value’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:45:51: [ skipping 11 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/dijkstra_shortest_paths.hpp:491:28: required from ‘void boost::dijkstra_shortest_paths(const VertexListGraph&, SourceInputIter, SourceInputIter, PredecessorMap, DistanceMap, WeightMap, IndexMap, Compare, Combine, DistInf, DistZero, DijkstraVisitor) [with VertexListGraph = adjacency_list, property >, no_property, listS>; SourceInputIter = long unsigned int*; DijkstraVisitor = dijkstra_visitor<>; PredecessorMap = dummy_property_map; DistanceMap = vec_adj_list_vertex_property_map, property >, no_property, listS>, adjacency_list, property >, no_property, listS>*, double, double&, vertex_distance_t>; WeightMap = adj_list_edge_property_map >, edge_weight2_t>; IndexMap = vec_adj_list_vertex_id_map, long unsigned int>; Compare = std::less; Combine = closed_plus; DistInf = double; DistZero = double]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/dijkstra_shortest_paths.hpp:505:28: required from ‘void boost::dijkstra_shortest_paths(const VertexListGraph&, typename graph_traits::vertex_descriptor, PredecessorMap, DistanceMap, WeightMap, IndexMap, Compare, Combine, DistInf, DistZero, DijkstraVisitor) [with VertexListGraph = adjacency_list, property >, no_property, listS>; DijkstraVisitor = dijkstra_visitor<>; PredecessorMap = dummy_property_map; DistanceMap = vec_adj_list_vertex_property_map, property >, no_property, listS>, adjacency_list, property >, no_property, listS>*, double, double&, vertex_distance_t>; WeightMap = adj_list_edge_property_map >, edge_weight2_t>; IndexMap = vec_adj_list_vertex_id_map, long unsigned int>; Compare = std::less; Combine = closed_plus; DistInf = double; DistZero = double; typename graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/johnson_all_pairs_shortest.hpp:127:36: required from ‘bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, VertexID, Weight, const BinaryPredicate&, const BinaryFunction&, const Infinity&, DistanceZero) [with VertexAndEdgeListGraph = R_adjacency_list; DistanceMatrix = Basic2DMatrix; VertexID = vec_adj_list_vertex_id_map, long unsigned int>; Weight = adj_list_edge_property_map, edge_weight_t>; BinaryPredicate = std::less; BinaryFunction = closed_plus; Infinity = double; DistanceZero = double]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/johnson_all_pairs_shortest.hpp:164:48: required from ‘bool boost::detail::johnson_dispatch(VertexAndEdgeListGraph&, DistanceMatrix&, const boost::bgl_named_params&, Weight, VertexID) [with VertexAndEdgeListGraph = R_adjacency_list; DistanceMatrix = Basic2DMatrix; P = int; T = int; R = boost::no_property; Weight = boost::adj_list_edge_property_map, boost::edge_weight_t>; VertexID = boost::vec_adj_list_vertex_id_map, long unsigned int>]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/johnson_all_pairs_shortest.hpp:192:36: required from ‘bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&) [with VertexAndEdgeListGraph = R_adjacency_list; DistanceMatrix = Basic2DMatrix]’ shortestPath.cpp:56:41: required from here /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::CopyConstructible::~CopyConstructible() [with TT = boost::detail::dijkstra_bfs_visitor, boost::d_ary_heap_indirect, long unsigned int>, long unsigned int, long unsigned int&>, boost::vec_adj_list_vertex_property_map, boost::property >, boost::no_property, boost::listS>, boost::adjacency_list, boost::property >, boost::no_property, boost::listS>*, double, double&, boost::vertex_distance_t>, std::less, std::vector >, boost::adj_list_edge_property_map >, boost::edge_weight2_t>, boost::dummy_property_map, boost::vec_adj_list_vertex_property_map, boost::property >, boost::no_property, boost::listS>, boost::adjacency_list, boost::property >, boost::no_property, boost::listS>*, double, double&, boost::vertex_distance_t>, boost::closed_plus, std::less >]’ 37 | ~model() | ^ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:167:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 167 | BOOST_CONCEPT_USAGE(CopyConstructible) { | ^~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::Assignable]’: /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements >]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:145:5: required from ‘struct boost::Assignable’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:502:3: required from ‘struct boost::InputIterator’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:540:3: required from ‘struct boost::ForwardIterator’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:568:3: required from ‘struct boost::BidirectionalIterator’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:597:3: [ skipping 12 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/dijkstra_shortest_paths.hpp:491:28: required from ‘void boost::dijkstra_shortest_paths(const VertexListGraph&, SourceInputIter, SourceInputIter, PredecessorMap, DistanceMap, WeightMap, IndexMap, Compare, Combine, DistInf, DistZero, DijkstraVisitor) [with VertexListGraph = R_adjacency_list; SourceInputIter = long unsigned int*; DijkstraVisitor = dijkstra_visitor<>; PredecessorMap = long unsigned int*; DistanceMap = double*; WeightMap = adj_list_edge_property_map, edge_weight_t>; IndexMap = vec_adj_list_vertex_id_map, long unsigned int>; Compare = std::less; Combine = std::plus; DistInf = double; DistZero = double]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/dijkstra_shortest_paths.hpp:434:28: required from ‘void boost::dijkstra_shortest_paths(const VertexListGraph&, typename graph_traits::vertex_descriptor, PredecessorMap, DistanceMap, WeightMap, IndexMap, Compare, Combine, DistInf, DistZero, DijkstraVisitor, const bgl_named_params&, typename enable_if_c::traversal_category>::value, graph::detail::no_parameter>::type) [with VertexListGraph = R_adjacency_list; DijkstraVisitor = dijkstra_visitor<>; PredecessorMap = long unsigned int*; DistanceMap = double*; WeightMap = adj_list_edge_property_map, edge_weight_t>; IndexMap = vec_adj_list_vertex_id_map, long unsigned int>; Compare = std::less; Combine = std::plus; DistInf = double; DistZero = double; T = double*; Tag = vertex_distance_t; Base = bgl_named_params; typename graph_traits::vertex_descriptor = long unsigned int; typename enable_if_c::traversal_category>::value, graph::detail::no_parameter>::type = graph::detail::no_parameter; typename graph_traits::traversal_category = adj_list_dir_traversal_tag]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/dijkstra_shortest_paths.hpp:528:32: required from ‘void boost::detail::dijkstra_dispatch2(const VertexListGraph&, typename boost::graph_traits::vertex_descriptor, DistanceMap, WeightMap, IndexMap, const Params&) [with VertexListGraph = R_adjacency_list; DistanceMap = double*; WeightMap = boost::adj_list_edge_property_map, boost::edge_weight_t>; IndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>; Params = boost::bgl_named_params >; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/dijkstra_shortest_paths.hpp:554:35: required from ‘void boost::detail::dijkstra_dispatch1(const VertexListGraph&, typename boost::graph_traits::vertex_descriptor, DistanceMap, WeightMap, IndexMap, const Params&) [with VertexListGraph = R_adjacency_list; DistanceMap = double*; WeightMap = boost::adj_list_edge_property_map, boost::edge_weight_t>; IndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>; Params = boost::bgl_named_params >; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/dijkstra_shortest_paths.hpp:570:31: required from ‘void boost::dijkstra_shortest_paths(const VertexListGraph&, typename graph_traits::vertex_descriptor, const bgl_named_params&) [with VertexListGraph = R_adjacency_list; Param = double*; Tag = vertex_distance_t; Rest = bgl_named_params; typename graph_traits::vertex_descriptor = long unsigned int]’ shortestPath.cpp:25:32: required from here /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::Assignable::~Assignable() [with TT = long unsigned int*]’ 37 | ~model() | ^ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:145:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 145 | BOOST_CONCEPT_USAGE(Assignable) { | ^~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::EqualityComparable]’: /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements >]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:233:5: required from ‘struct boost::EqualityComparable’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:502:3: required from ‘struct boost::InputIterator’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:540:3: required from ‘struct boost::ForwardIterator’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:568:3: required from ‘struct boost::BidirectionalIterator’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:597:3: [ skipping 12 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/dijkstra_shortest_paths.hpp:491:28: required from ‘void boost::dijkstra_shortest_paths(const VertexListGraph&, SourceInputIter, SourceInputIter, PredecessorMap, DistanceMap, WeightMap, IndexMap, Compare, Combine, DistInf, DistZero, DijkstraVisitor) [with VertexListGraph = R_adjacency_list; SourceInputIter = long unsigned int*; DijkstraVisitor = dijkstra_visitor<>; PredecessorMap = long unsigned int*; DistanceMap = double*; WeightMap = adj_list_edge_property_map, edge_weight_t>; IndexMap = vec_adj_list_vertex_id_map, long unsigned int>; Compare = std::less; Combine = std::plus; DistInf = double; DistZero = double]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/dijkstra_shortest_paths.hpp:434:28: required from ‘void boost::dijkstra_shortest_paths(const VertexListGraph&, typename graph_traits::vertex_descriptor, PredecessorMap, DistanceMap, WeightMap, IndexMap, Compare, Combine, DistInf, DistZero, DijkstraVisitor, const bgl_named_params&, typename enable_if_c::traversal_category>::value, graph::detail::no_parameter>::type) [with VertexListGraph = R_adjacency_list; DijkstraVisitor = dijkstra_visitor<>; PredecessorMap = long unsigned int*; DistanceMap = double*; WeightMap = adj_list_edge_property_map, edge_weight_t>; IndexMap = vec_adj_list_vertex_id_map, long unsigned int>; Compare = std::less; Combine = std::plus; DistInf = double; DistZero = double; T = double*; Tag = vertex_distance_t; Base = bgl_named_params; typename graph_traits::vertex_descriptor = long unsigned int; typename enable_if_c::traversal_category>::value, graph::detail::no_parameter>::type = graph::detail::no_parameter; typename graph_traits::traversal_category = adj_list_dir_traversal_tag]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/dijkstra_shortest_paths.hpp:528:32: required from ‘void boost::detail::dijkstra_dispatch2(const VertexListGraph&, typename boost::graph_traits::vertex_descriptor, DistanceMap, WeightMap, IndexMap, const Params&) [with VertexListGraph = R_adjacency_list; DistanceMap = double*; WeightMap = boost::adj_list_edge_property_map, boost::edge_weight_t>; IndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>; Params = boost::bgl_named_params >; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/dijkstra_shortest_paths.hpp:554:35: required from ‘void boost::detail::dijkstra_dispatch1(const VertexListGraph&, typename boost::graph_traits::vertex_descriptor, DistanceMap, WeightMap, IndexMap, const Params&) [with VertexListGraph = R_adjacency_list; DistanceMap = double*; WeightMap = boost::adj_list_edge_property_map, boost::edge_weight_t>; IndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>; Params = boost::bgl_named_params >; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/dijkstra_shortest_paths.hpp:570:31: required from ‘void boost::dijkstra_shortest_paths(const VertexListGraph&, typename graph_traits::vertex_descriptor, const bgl_named_params&) [with VertexListGraph = R_adjacency_list; Param = double*; Tag = vertex_distance_t; Rest = bgl_named_params; typename graph_traits::vertex_descriptor = long unsigned int]’ shortestPath.cpp:25:32: required from here /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::EqualityComparable::~EqualityComparable() [with TT = long unsigned int*]’ 37 | ~model() | ^ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:233:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 233 | BOOST_CONCEPT_USAGE(EqualityComparable) { | ^~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::InputIterator]’: /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements >]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:512:7: required from ‘struct boost::InputIterator’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:540:3: required from ‘struct boost::ForwardIterator’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:568:3: required from ‘struct boost::BidirectionalIterator’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:597:3: required from ‘struct boost::RandomAccessIterator’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:597:3: [ skipping 11 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/dijkstra_shortest_paths.hpp:491:28: required from ‘void boost::dijkstra_shortest_paths(const VertexListGraph&, SourceInputIter, SourceInputIter, PredecessorMap, DistanceMap, WeightMap, IndexMap, Compare, Combine, DistInf, DistZero, DijkstraVisitor) [with VertexListGraph = R_adjacency_list; SourceInputIter = long unsigned int*; DijkstraVisitor = dijkstra_visitor<>; PredecessorMap = long unsigned int*; DistanceMap = double*; WeightMap = adj_list_edge_property_map, edge_weight_t>; IndexMap = vec_adj_list_vertex_id_map, long unsigned int>; Compare = std::less; Combine = std::plus; DistInf = double; DistZero = double]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/dijkstra_shortest_paths.hpp:434:28: required from ‘void boost::dijkstra_shortest_paths(const VertexListGraph&, typename graph_traits::vertex_descriptor, PredecessorMap, DistanceMap, WeightMap, IndexMap, Compare, Combine, DistInf, DistZero, DijkstraVisitor, const bgl_named_params&, typename enable_if_c::traversal_category>::value, graph::detail::no_parameter>::type) [with VertexListGraph = R_adjacency_list; DijkstraVisitor = dijkstra_visitor<>; PredecessorMap = long unsigned int*; DistanceMap = double*; WeightMap = adj_list_edge_property_map, edge_weight_t>; IndexMap = vec_adj_list_vertex_id_map, long unsigned int>; Compare = std::less; Combine = std::plus; DistInf = double; DistZero = double; T = double*; Tag = vertex_distance_t; Base = bgl_named_params; typename graph_traits::vertex_descriptor = long unsigned int; typename enable_if_c::traversal_category>::value, graph::detail::no_parameter>::type = graph::detail::no_parameter; typename graph_traits::traversal_category = adj_list_dir_traversal_tag]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/dijkstra_shortest_paths.hpp:528:32: required from ‘void boost::detail::dijkstra_dispatch2(const VertexListGraph&, typename boost::graph_traits::vertex_descriptor, DistanceMap, WeightMap, IndexMap, const Params&) [with VertexListGraph = R_adjacency_list; DistanceMap = double*; WeightMap = boost::adj_list_edge_property_map, boost::edge_weight_t>; IndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>; Params = boost::bgl_named_params >; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/dijkstra_shortest_paths.hpp:554:35: required from ‘void boost::detail::dijkstra_dispatch1(const VertexListGraph&, typename boost::graph_traits::vertex_descriptor, DistanceMap, WeightMap, IndexMap, const Params&) [with VertexListGraph = R_adjacency_list; DistanceMap = double*; WeightMap = boost::adj_list_edge_property_map, boost::edge_weight_t>; IndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>; Params = boost::bgl_named_params >; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/dijkstra_shortest_paths.hpp:570:31: required from ‘void boost::dijkstra_shortest_paths(const VertexListGraph&, typename graph_traits::vertex_descriptor, const bgl_named_params&) [with VertexListGraph = R_adjacency_list; Param = double*; Tag = vertex_distance_t; Rest = bgl_named_params; typename graph_traits::vertex_descriptor = long unsigned int]’ shortestPath.cpp:25:32: required from here /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::InputIterator::~InputIterator() [with TT = long unsigned int*]’ 37 | ~model() | ^ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:512:7: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 512 | BOOST_CONCEPT_USAGE(InputIterator) | ^~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::ForwardIterator]’: /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements >]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:543:7: required from ‘struct boost::ForwardIterator’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:568:3: required from ‘struct boost::BidirectionalIterator’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:597:3: required from ‘struct boost::RandomAccessIterator’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:597:3: required from ‘struct boost::RandomAccessIteratorConcept’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:32:62: [ skipping 10 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/dijkstra_shortest_paths.hpp:491:28: required from ‘void boost::dijkstra_shortest_paths(const VertexListGraph&, SourceInputIter, SourceInputIter, PredecessorMap, DistanceMap, WeightMap, IndexMap, Compare, Combine, DistInf, DistZero, DijkstraVisitor) [with VertexListGraph = R_adjacency_list; SourceInputIter = long unsigned int*; DijkstraVisitor = dijkstra_visitor<>; PredecessorMap = long unsigned int*; DistanceMap = double*; WeightMap = adj_list_edge_property_map, edge_weight_t>; IndexMap = vec_adj_list_vertex_id_map, long unsigned int>; Compare = std::less; Combine = std::plus; DistInf = double; DistZero = double]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/dijkstra_shortest_paths.hpp:434:28: required from ‘void boost::dijkstra_shortest_paths(const VertexListGraph&, typename graph_traits::vertex_descriptor, PredecessorMap, DistanceMap, WeightMap, IndexMap, Compare, Combine, DistInf, DistZero, DijkstraVisitor, const bgl_named_params&, typename enable_if_c::traversal_category>::value, graph::detail::no_parameter>::type) [with VertexListGraph = R_adjacency_list; DijkstraVisitor = dijkstra_visitor<>; PredecessorMap = long unsigned int*; DistanceMap = double*; WeightMap = adj_list_edge_property_map, edge_weight_t>; IndexMap = vec_adj_list_vertex_id_map, long unsigned int>; Compare = std::less; Combine = std::plus; DistInf = double; DistZero = double; T = double*; Tag = vertex_distance_t; Base = bgl_named_params; typename graph_traits::vertex_descriptor = long unsigned int; typename enable_if_c::traversal_category>::value, graph::detail::no_parameter>::type = graph::detail::no_parameter; typename graph_traits::traversal_category = adj_list_dir_traversal_tag]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/dijkstra_shortest_paths.hpp:528:32: required from ‘void boost::detail::dijkstra_dispatch2(const VertexListGraph&, typename boost::graph_traits::vertex_descriptor, DistanceMap, WeightMap, IndexMap, const Params&) [with VertexListGraph = R_adjacency_list; DistanceMap = double*; WeightMap = boost::adj_list_edge_property_map, boost::edge_weight_t>; IndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>; Params = boost::bgl_named_params >; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/dijkstra_shortest_paths.hpp:554:35: required from ‘void boost::detail::dijkstra_dispatch1(const VertexListGraph&, typename boost::graph_traits::vertex_descriptor, DistanceMap, WeightMap, IndexMap, const Params&) [with VertexListGraph = R_adjacency_list; DistanceMap = double*; WeightMap = boost::adj_list_edge_property_map, boost::edge_weight_t>; IndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>; Params = boost::bgl_named_params >; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/dijkstra_shortest_paths.hpp:570:31: required from ‘void boost::dijkstra_shortest_paths(const VertexListGraph&, typename graph_traits::vertex_descriptor, const bgl_named_params&) [with VertexListGraph = R_adjacency_list; Param = double*; Tag = vertex_distance_t; Rest = bgl_named_params; typename graph_traits::vertex_descriptor = long unsigned int]’ shortestPath.cpp:25:32: required from here /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::ForwardIterator::~ForwardIterator() [with TT = long unsigned int*]’ 37 | ~model() | ^ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:543:7: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 543 | BOOST_CONCEPT_USAGE(ForwardIterator) | ^~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::BidirectionalIterator]’: /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements >]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:571:7: required from ‘struct boost::BidirectionalIterator’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:597:3: required from ‘struct boost::RandomAccessIterator’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:597:3: required from ‘struct boost::RandomAccessIteratorConcept’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::RandomAccessIteratorConcept]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:42:5: [ skipping 9 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/dijkstra_shortest_paths.hpp:491:28: required from ‘void boost::dijkstra_shortest_paths(const VertexListGraph&, SourceInputIter, SourceInputIter, PredecessorMap, DistanceMap, WeightMap, IndexMap, Compare, Combine, DistInf, DistZero, DijkstraVisitor) [with VertexListGraph = R_adjacency_list; SourceInputIter = long unsigned int*; DijkstraVisitor = dijkstra_visitor<>; PredecessorMap = long unsigned int*; DistanceMap = double*; WeightMap = adj_list_edge_property_map, edge_weight_t>; IndexMap = vec_adj_list_vertex_id_map, long unsigned int>; Compare = std::less; Combine = std::plus; DistInf = double; DistZero = double]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/dijkstra_shortest_paths.hpp:434:28: required from ‘void boost::dijkstra_shortest_paths(const VertexListGraph&, typename graph_traits::vertex_descriptor, PredecessorMap, DistanceMap, WeightMap, IndexMap, Compare, Combine, DistInf, DistZero, DijkstraVisitor, const bgl_named_params&, typename enable_if_c::traversal_category>::value, graph::detail::no_parameter>::type) [with VertexListGraph = R_adjacency_list; DijkstraVisitor = dijkstra_visitor<>; PredecessorMap = long unsigned int*; DistanceMap = double*; WeightMap = adj_list_edge_property_map, edge_weight_t>; IndexMap = vec_adj_list_vertex_id_map, long unsigned int>; Compare = std::less; Combine = std::plus; DistInf = double; DistZero = double; T = double*; Tag = vertex_distance_t; Base = bgl_named_params; typename graph_traits::vertex_descriptor = long unsigned int; typename enable_if_c::traversal_category>::value, graph::detail::no_parameter>::type = graph::detail::no_parameter; typename graph_traits::traversal_category = adj_list_dir_traversal_tag]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/dijkstra_shortest_paths.hpp:528:32: required from ‘void boost::detail::dijkstra_dispatch2(const VertexListGraph&, typename boost::graph_traits::vertex_descriptor, DistanceMap, WeightMap, IndexMap, const Params&) [with VertexListGraph = R_adjacency_list; DistanceMap = double*; WeightMap = boost::adj_list_edge_property_map, boost::edge_weight_t>; IndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>; Params = boost::bgl_named_params >; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/dijkstra_shortest_paths.hpp:554:35: required from ‘void boost::detail::dijkstra_dispatch1(const VertexListGraph&, typename boost::graph_traits::vertex_descriptor, DistanceMap, WeightMap, IndexMap, const Params&) [with VertexListGraph = R_adjacency_list; DistanceMap = double*; WeightMap = boost::adj_list_edge_property_map, boost::edge_weight_t>; IndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>; Params = boost::bgl_named_params >; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/dijkstra_shortest_paths.hpp:570:31: required from ‘void boost::dijkstra_shortest_paths(const VertexListGraph&, typename graph_traits::vertex_descriptor, const bgl_named_params&) [with VertexListGraph = R_adjacency_list; Param = double*; Tag = vertex_distance_t; Rest = bgl_named_params; typename graph_traits::vertex_descriptor = long unsigned int]’ shortestPath.cpp:25:32: required from here /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::BidirectionalIterator::~BidirectionalIterator() [with TT = long unsigned int*]’ 37 | ~model() | ^ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:571:7: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 571 | BOOST_CONCEPT_USAGE(BidirectionalIterator) | ^~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::Comparable]’: /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements >]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:253:5: required from ‘struct boost::Comparable’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:597:3: required from ‘struct boost::RandomAccessIterator’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:597:3: required from ‘struct boost::RandomAccessIteratorConcept’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::RandomAccessIteratorConcept]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:42:5: [ skipping 9 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/dijkstra_shortest_paths.hpp:491:28: required from ‘void boost::dijkstra_shortest_paths(const VertexListGraph&, SourceInputIter, SourceInputIter, PredecessorMap, DistanceMap, WeightMap, IndexMap, Compare, Combine, DistInf, DistZero, DijkstraVisitor) [with VertexListGraph = R_adjacency_list; SourceInputIter = long unsigned int*; DijkstraVisitor = dijkstra_visitor<>; PredecessorMap = long unsigned int*; DistanceMap = double*; WeightMap = adj_list_edge_property_map, edge_weight_t>; IndexMap = vec_adj_list_vertex_id_map, long unsigned int>; Compare = std::less; Combine = std::plus; DistInf = double; DistZero = double]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/dijkstra_shortest_paths.hpp:434:28: required from ‘void boost::dijkstra_shortest_paths(const VertexListGraph&, typename graph_traits::vertex_descriptor, PredecessorMap, DistanceMap, WeightMap, IndexMap, Compare, Combine, DistInf, DistZero, DijkstraVisitor, const bgl_named_params&, typename enable_if_c::traversal_category>::value, graph::detail::no_parameter>::type) [with VertexListGraph = R_adjacency_list; DijkstraVisitor = dijkstra_visitor<>; PredecessorMap = long unsigned int*; DistanceMap = double*; WeightMap = adj_list_edge_property_map, edge_weight_t>; IndexMap = vec_adj_list_vertex_id_map, long unsigned int>; Compare = std::less; Combine = std::plus; DistInf = double; DistZero = double; T = double*; Tag = vertex_distance_t; Base = bgl_named_params; typename graph_traits::vertex_descriptor = long unsigned int; typename enable_if_c::traversal_category>::value, graph::detail::no_parameter>::type = graph::detail::no_parameter; typename graph_traits::traversal_category = adj_list_dir_traversal_tag]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/dijkstra_shortest_paths.hpp:528:32: required from ‘void boost::detail::dijkstra_dispatch2(const VertexListGraph&, typename boost::graph_traits::vertex_descriptor, DistanceMap, WeightMap, IndexMap, const Params&) [with VertexListGraph = R_adjacency_list; DistanceMap = double*; WeightMap = boost::adj_list_edge_property_map, boost::edge_weight_t>; IndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>; Params = boost::bgl_named_params >; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/dijkstra_shortest_paths.hpp:554:35: required from ‘void boost::detail::dijkstra_dispatch1(const VertexListGraph&, typename boost::graph_traits::vertex_descriptor, DistanceMap, WeightMap, IndexMap, const Params&) [with VertexListGraph = R_adjacency_list; DistanceMap = double*; WeightMap = boost::adj_list_edge_property_map, boost::edge_weight_t>; IndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>; Params = boost::bgl_named_params >; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/dijkstra_shortest_paths.hpp:570:31: required from ‘void boost::dijkstra_shortest_paths(const VertexListGraph&, typename graph_traits::vertex_descriptor, const bgl_named_params&) [with VertexListGraph = R_adjacency_list; Param = double*; Tag = vertex_distance_t; Rest = bgl_named_params; typename graph_traits::vertex_descriptor = long unsigned int]’ shortestPath.cpp:25:32: required from here /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::Comparable::~Comparable() [with TT = long unsigned int*]’ 37 | ~model() | ^ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:253:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 253 | BOOST_CONCEPT_USAGE(Comparable) { | ^~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::RandomAccessIterator]’: /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements >]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:601:7: required from ‘struct boost::RandomAccessIterator’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:597:3: required from ‘struct boost::RandomAccessIteratorConcept’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::RandomAccessIteratorConcept]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied >::value’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:45:51: [ skipping 8 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/dijkstra_shortest_paths.hpp:491:28: required from ‘void boost::dijkstra_shortest_paths(const VertexListGraph&, SourceInputIter, SourceInputIter, PredecessorMap, DistanceMap, WeightMap, IndexMap, Compare, Combine, DistInf, DistZero, DijkstraVisitor) [with VertexListGraph = R_adjacency_list; SourceInputIter = long unsigned int*; DijkstraVisitor = dijkstra_visitor<>; PredecessorMap = long unsigned int*; DistanceMap = double*; WeightMap = adj_list_edge_property_map, edge_weight_t>; IndexMap = vec_adj_list_vertex_id_map, long unsigned int>; Compare = std::less; Combine = std::plus; DistInf = double; DistZero = double]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/dijkstra_shortest_paths.hpp:434:28: required from ‘void boost::dijkstra_shortest_paths(const VertexListGraph&, typename graph_traits::vertex_descriptor, PredecessorMap, DistanceMap, WeightMap, IndexMap, Compare, Combine, DistInf, DistZero, DijkstraVisitor, const bgl_named_params&, typename enable_if_c::traversal_category>::value, graph::detail::no_parameter>::type) [with VertexListGraph = R_adjacency_list; DijkstraVisitor = dijkstra_visitor<>; PredecessorMap = long unsigned int*; DistanceMap = double*; WeightMap = adj_list_edge_property_map, edge_weight_t>; IndexMap = vec_adj_list_vertex_id_map, long unsigned int>; Compare = std::less; Combine = std::plus; DistInf = double; DistZero = double; T = double*; Tag = vertex_distance_t; Base = bgl_named_params; typename graph_traits::vertex_descriptor = long unsigned int; typename enable_if_c::traversal_category>::value, graph::detail::no_parameter>::type = graph::detail::no_parameter; typename graph_traits::traversal_category = adj_list_dir_traversal_tag]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/dijkstra_shortest_paths.hpp:528:32: required from ‘void boost::detail::dijkstra_dispatch2(const VertexListGraph&, typename boost::graph_traits::vertex_descriptor, DistanceMap, WeightMap, IndexMap, const Params&) [with VertexListGraph = R_adjacency_list; DistanceMap = double*; WeightMap = boost::adj_list_edge_property_map, boost::edge_weight_t>; IndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>; Params = boost::bgl_named_params >; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/dijkstra_shortest_paths.hpp:554:35: required from ‘void boost::detail::dijkstra_dispatch1(const VertexListGraph&, typename boost::graph_traits::vertex_descriptor, DistanceMap, WeightMap, IndexMap, const Params&) [with VertexListGraph = R_adjacency_list; DistanceMap = double*; WeightMap = boost::adj_list_edge_property_map, boost::edge_weight_t>; IndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>; Params = boost::bgl_named_params >; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/dijkstra_shortest_paths.hpp:570:31: required from ‘void boost::dijkstra_shortest_paths(const VertexListGraph&, typename graph_traits::vertex_descriptor, const bgl_named_params&) [with VertexListGraph = R_adjacency_list; Param = double*; Tag = vertex_distance_t; Rest = bgl_named_params; typename graph_traits::vertex_descriptor = long unsigned int]’ shortestPath.cpp:25:32: required from here /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::RandomAccessIterator::~RandomAccessIterator() [with TT = long unsigned int*]’ 37 | ~model() | ^ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:601:7: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 601 | BOOST_CONCEPT_USAGE(RandomAccessIterator) | ^~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::Convertible]’: /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements >]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:208:5: required from ‘struct boost::Convertible’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:206:3: required from ‘struct boost::ConvertibleConcept’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::ConvertibleConcept]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied >::value’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:45:51: [ skipping 16 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/dijkstra_shortest_paths.hpp:491:28: required from ‘void boost::dijkstra_shortest_paths(const VertexListGraph&, SourceInputIter, SourceInputIter, PredecessorMap, DistanceMap, WeightMap, IndexMap, Compare, Combine, DistInf, DistZero, DijkstraVisitor) [with VertexListGraph = R_adjacency_list; SourceInputIter = long unsigned int*; DijkstraVisitor = dijkstra_visitor<>; PredecessorMap = long unsigned int*; DistanceMap = double*; WeightMap = adj_list_edge_property_map, edge_weight_t>; IndexMap = vec_adj_list_vertex_id_map, long unsigned int>; Compare = std::less; Combine = std::plus; DistInf = double; DistZero = double]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/dijkstra_shortest_paths.hpp:434:28: required from ‘void boost::dijkstra_shortest_paths(const VertexListGraph&, typename graph_traits::vertex_descriptor, PredecessorMap, DistanceMap, WeightMap, IndexMap, Compare, Combine, DistInf, DistZero, DijkstraVisitor, const bgl_named_params&, typename enable_if_c::traversal_category>::value, graph::detail::no_parameter>::type) [with VertexListGraph = R_adjacency_list; DijkstraVisitor = dijkstra_visitor<>; PredecessorMap = long unsigned int*; DistanceMap = double*; WeightMap = adj_list_edge_property_map, edge_weight_t>; IndexMap = vec_adj_list_vertex_id_map, long unsigned int>; Compare = std::less; Combine = std::plus; DistInf = double; DistZero = double; T = double*; Tag = vertex_distance_t; Base = bgl_named_params; typename graph_traits::vertex_descriptor = long unsigned int; typename enable_if_c::traversal_category>::value, graph::detail::no_parameter>::type = graph::detail::no_parameter; typename graph_traits::traversal_category = adj_list_dir_traversal_tag]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/dijkstra_shortest_paths.hpp:528:32: required from ‘void boost::detail::dijkstra_dispatch2(const VertexListGraph&, typename boost::graph_traits::vertex_descriptor, DistanceMap, WeightMap, IndexMap, const Params&) [with VertexListGraph = R_adjacency_list; DistanceMap = double*; WeightMap = boost::adj_list_edge_property_map, boost::edge_weight_t>; IndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>; Params = boost::bgl_named_params >; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/dijkstra_shortest_paths.hpp:554:35: required from ‘void boost::detail::dijkstra_dispatch1(const VertexListGraph&, typename boost::graph_traits::vertex_descriptor, DistanceMap, WeightMap, IndexMap, const Params&) [with VertexListGraph = R_adjacency_list; DistanceMap = double*; WeightMap = boost::adj_list_edge_property_map, boost::edge_weight_t>; IndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>; Params = boost::bgl_named_params >; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/dijkstra_shortest_paths.hpp:570:31: required from ‘void boost::dijkstra_shortest_paths(const VertexListGraph&, typename graph_traits::vertex_descriptor, const bgl_named_params&) [with VertexListGraph = R_adjacency_list; Param = double*; Tag = vertex_distance_t; Rest = bgl_named_params; typename graph_traits::vertex_descriptor = long unsigned int]’ shortestPath.cpp:25:32: required from here /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::Convertible::~Convertible() [with X = boost::read_write_property_map_tag; Y = boost::readable_property_map_tag]’ 37 | ~model() | ^ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:208:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 208 | BOOST_CONCEPT_USAGE(Convertible) { | ^~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::Convertible]’: /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements >]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:208:5: required from ‘struct boost::Convertible’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:206:3: required from ‘struct boost::ConvertibleConcept’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::ConvertibleConcept]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied >::value’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:45:51: [ skipping 16 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/dijkstra_shortest_paths.hpp:491:28: required from ‘void boost::dijkstra_shortest_paths(const VertexListGraph&, SourceInputIter, SourceInputIter, PredecessorMap, DistanceMap, WeightMap, IndexMap, Compare, Combine, DistInf, DistZero, DijkstraVisitor) [with VertexListGraph = R_adjacency_list; SourceInputIter = long unsigned int*; DijkstraVisitor = dijkstra_visitor<>; PredecessorMap = long unsigned int*; DistanceMap = double*; WeightMap = adj_list_edge_property_map, edge_weight_t>; IndexMap = vec_adj_list_vertex_id_map, long unsigned int>; Compare = std::less; Combine = std::plus; DistInf = double; DistZero = double]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/dijkstra_shortest_paths.hpp:434:28: required from ‘void boost::dijkstra_shortest_paths(const VertexListGraph&, typename graph_traits::vertex_descriptor, PredecessorMap, DistanceMap, WeightMap, IndexMap, Compare, Combine, DistInf, DistZero, DijkstraVisitor, const bgl_named_params&, typename enable_if_c::traversal_category>::value, graph::detail::no_parameter>::type) [with VertexListGraph = R_adjacency_list; DijkstraVisitor = dijkstra_visitor<>; PredecessorMap = long unsigned int*; DistanceMap = double*; WeightMap = adj_list_edge_property_map, edge_weight_t>; IndexMap = vec_adj_list_vertex_id_map, long unsigned int>; Compare = std::less; Combine = std::plus; DistInf = double; DistZero = double; T = double*; Tag = vertex_distance_t; Base = bgl_named_params; typename graph_traits::vertex_descriptor = long unsigned int; typename enable_if_c::traversal_category>::value, graph::detail::no_parameter>::type = graph::detail::no_parameter; typename graph_traits::traversal_category = adj_list_dir_traversal_tag]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/dijkstra_shortest_paths.hpp:528:32: required from ‘void boost::detail::dijkstra_dispatch2(const VertexListGraph&, typename boost::graph_traits::vertex_descriptor, DistanceMap, WeightMap, IndexMap, const Params&) [with VertexListGraph = R_adjacency_list; DistanceMap = double*; WeightMap = boost::adj_list_edge_property_map, boost::edge_weight_t>; IndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>; Params = boost::bgl_named_params >; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/dijkstra_shortest_paths.hpp:554:35: required from ‘void boost::detail::dijkstra_dispatch1(const VertexListGraph&, typename boost::graph_traits::vertex_descriptor, DistanceMap, WeightMap, IndexMap, const Params&) [with VertexListGraph = R_adjacency_list; DistanceMap = double*; WeightMap = boost::adj_list_edge_property_map, boost::edge_weight_t>; IndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>; Params = boost::bgl_named_params >; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/dijkstra_shortest_paths.hpp:570:31: required from ‘void boost::dijkstra_shortest_paths(const VertexListGraph&, typename graph_traits::vertex_descriptor, const bgl_named_params&) [with VertexListGraph = R_adjacency_list; Param = double*; Tag = vertex_distance_t; Rest = bgl_named_params; typename graph_traits::vertex_descriptor = long unsigned int]’ shortestPath.cpp:25:32: required from here /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::Convertible::~Convertible() [with X = boost::read_write_property_map_tag; Y = boost::writable_property_map_tag]’ 37 | ~model() | ^ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:208:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 208 | BOOST_CONCEPT_USAGE(Convertible) { | ^~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::concepts::MultiPassInputIterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> >]’: /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/graph_concepts.hpp:52:50: required from ‘struct boost::concepts::MultiPassInputIterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::concepts::MultiPassInputIterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> >]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::value’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:72:8: [ skipping 7 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/dijkstra_shortest_paths.hpp:491:28: required from ‘void boost::dijkstra_shortest_paths(const VertexListGraph&, SourceInputIter, SourceInputIter, PredecessorMap, DistanceMap, WeightMap, IndexMap, Compare, Combine, DistInf, DistZero, DijkstraVisitor) [with VertexListGraph = adjacency_list, property >, no_property, listS>; SourceInputIter = long unsigned int*; DijkstraVisitor = dijkstra_visitor<>; PredecessorMap = dummy_property_map; DistanceMap = vec_adj_list_vertex_property_map, property >, no_property, listS>, adjacency_list, property >, no_property, listS>*, double, double&, vertex_distance_t>; WeightMap = adj_list_edge_property_map >, edge_weight2_t>; IndexMap = vec_adj_list_vertex_id_map, long unsigned int>; Compare = std::less; Combine = closed_plus; DistInf = double; DistZero = double]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/dijkstra_shortest_paths.hpp:505:28: required from ‘void boost::dijkstra_shortest_paths(const VertexListGraph&, typename graph_traits::vertex_descriptor, PredecessorMap, DistanceMap, WeightMap, IndexMap, Compare, Combine, DistInf, DistZero, DijkstraVisitor) [with VertexListGraph = adjacency_list, property >, no_property, listS>; DijkstraVisitor = dijkstra_visitor<>; PredecessorMap = dummy_property_map; DistanceMap = vec_adj_list_vertex_property_map, property >, no_property, listS>, adjacency_list, property >, no_property, listS>*, double, double&, vertex_distance_t>; WeightMap = adj_list_edge_property_map >, edge_weight2_t>; IndexMap = vec_adj_list_vertex_id_map, long unsigned int>; Compare = std::less; Combine = closed_plus; DistInf = double; DistZero = double; typename graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/johnson_all_pairs_shortest.hpp:127:36: required from ‘bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, VertexID, Weight, const BinaryPredicate&, const BinaryFunction&, const Infinity&, DistanceZero) [with VertexAndEdgeListGraph = R_adjacency_list; DistanceMatrix = Basic2DMatrix; VertexID = vec_adj_list_vertex_id_map, long unsigned int>; Weight = adj_list_edge_property_map, edge_weight_t>; BinaryPredicate = std::less; BinaryFunction = closed_plus; Infinity = double; DistanceZero = double]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/johnson_all_pairs_shortest.hpp:164:48: required from ‘bool boost::detail::johnson_dispatch(VertexAndEdgeListGraph&, DistanceMatrix&, const boost::bgl_named_params&, Weight, VertexID) [with VertexAndEdgeListGraph = R_adjacency_list; DistanceMatrix = Basic2DMatrix; P = int; T = int; R = boost::no_property; Weight = boost::adj_list_edge_property_map, boost::edge_weight_t>; VertexID = boost::vec_adj_list_vertex_id_map, long unsigned int>]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/johnson_all_pairs_shortest.hpp:192:36: required from ‘bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&) [with VertexAndEdgeListGraph = R_adjacency_list; DistanceMatrix = Basic2DMatrix]’ shortestPath.cpp:56:41: required from here /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::concepts::MultiPassInputIterator::~MultiPassInputIterator() [with T = boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>]’ 37 | ~model() | ^ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/graph_concepts.hpp:52:50: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 52 | BOOST_concept(MultiPassInputIterator, (T)) { BOOST_CONCEPT_USAGE( | ^~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >]’: /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:145:5: required from ‘struct boost::Assignable > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:502:3: required from ‘struct boost::InputIterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::InputIterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> >]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::value’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:72:8: [ skipping 9 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/dijkstra_shortest_paths.hpp:491:28: required from ‘void boost::dijkstra_shortest_paths(const VertexListGraph&, SourceInputIter, SourceInputIter, PredecessorMap, DistanceMap, WeightMap, IndexMap, Compare, Combine, DistInf, DistZero, DijkstraVisitor) [with VertexListGraph = adjacency_list, property >, no_property, listS>; SourceInputIter = long unsigned int*; DijkstraVisitor = dijkstra_visitor<>; PredecessorMap = dummy_property_map; DistanceMap = vec_adj_list_vertex_property_map, property >, no_property, listS>, adjacency_list, property >, no_property, listS>*, double, double&, vertex_distance_t>; WeightMap = adj_list_edge_property_map >, edge_weight2_t>; IndexMap = vec_adj_list_vertex_id_map, long unsigned int>; Compare = std::less; Combine = closed_plus; DistInf = double; DistZero = double]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/dijkstra_shortest_paths.hpp:505:28: required from ‘void boost::dijkstra_shortest_paths(const VertexListGraph&, typename graph_traits::vertex_descriptor, PredecessorMap, DistanceMap, WeightMap, IndexMap, Compare, Combine, DistInf, DistZero, DijkstraVisitor) [with VertexListGraph = adjacency_list, property >, no_property, listS>; DijkstraVisitor = dijkstra_visitor<>; PredecessorMap = dummy_property_map; DistanceMap = vec_adj_list_vertex_property_map, property >, no_property, listS>, adjacency_list, property >, no_property, listS>*, double, double&, vertex_distance_t>; WeightMap = adj_list_edge_property_map >, edge_weight2_t>; IndexMap = vec_adj_list_vertex_id_map, long unsigned int>; Compare = std::less; Combine = closed_plus; DistInf = double; DistZero = double; typename graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/johnson_all_pairs_shortest.hpp:127:36: required from ‘bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, VertexID, Weight, const BinaryPredicate&, const BinaryFunction&, const Infinity&, DistanceZero) [with VertexAndEdgeListGraph = R_adjacency_list; DistanceMatrix = Basic2DMatrix; VertexID = vec_adj_list_vertex_id_map, long unsigned int>; Weight = adj_list_edge_property_map, edge_weight_t>; BinaryPredicate = std::less; BinaryFunction = closed_plus; Infinity = double; DistanceZero = double]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/johnson_all_pairs_shortest.hpp:164:48: required from ‘bool boost::detail::johnson_dispatch(VertexAndEdgeListGraph&, DistanceMatrix&, const boost::bgl_named_params&, Weight, VertexID) [with VertexAndEdgeListGraph = R_adjacency_list; DistanceMatrix = Basic2DMatrix; P = int; T = int; R = boost::no_property; Weight = boost::adj_list_edge_property_map, boost::edge_weight_t>; VertexID = boost::vec_adj_list_vertex_id_map, long unsigned int>]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/johnson_all_pairs_shortest.hpp:192:36: required from ‘bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&) [with VertexAndEdgeListGraph = R_adjacency_list; DistanceMatrix = Basic2DMatrix]’ shortestPath.cpp:56:41: required from here /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::Assignable > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> >]’ 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ^ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >]’: /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:233:5: required from ‘struct boost::EqualityComparable > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:502:3: required from ‘struct boost::InputIterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::InputIterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> >]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::value’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:72:8: [ skipping 9 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/dijkstra_shortest_paths.hpp:491:28: required from ‘void boost::dijkstra_shortest_paths(const VertexListGraph&, SourceInputIter, SourceInputIter, PredecessorMap, DistanceMap, WeightMap, IndexMap, Compare, Combine, DistInf, DistZero, DijkstraVisitor) [with VertexListGraph = adjacency_list, property >, no_property, listS>; SourceInputIter = long unsigned int*; DijkstraVisitor = dijkstra_visitor<>; PredecessorMap = dummy_property_map; DistanceMap = vec_adj_list_vertex_property_map, property >, no_property, listS>, adjacency_list, property >, no_property, listS>*, double, double&, vertex_distance_t>; WeightMap = adj_list_edge_property_map >, edge_weight2_t>; IndexMap = vec_adj_list_vertex_id_map, long unsigned int>; Compare = std::less; Combine = closed_plus; DistInf = double; DistZero = double]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/dijkstra_shortest_paths.hpp:505:28: required from ‘void boost::dijkstra_shortest_paths(const VertexListGraph&, typename graph_traits::vertex_descriptor, PredecessorMap, DistanceMap, WeightMap, IndexMap, Compare, Combine, DistInf, DistZero, DijkstraVisitor) [with VertexListGraph = adjacency_list, property >, no_property, listS>; DijkstraVisitor = dijkstra_visitor<>; PredecessorMap = dummy_property_map; DistanceMap = vec_adj_list_vertex_property_map, property >, no_property, listS>, adjacency_list, property >, no_property, listS>*, double, double&, vertex_distance_t>; WeightMap = adj_list_edge_property_map >, edge_weight2_t>; IndexMap = vec_adj_list_vertex_id_map, long unsigned int>; Compare = std::less; Combine = closed_plus; DistInf = double; DistZero = double; typename graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/johnson_all_pairs_shortest.hpp:127:36: required from ‘bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, VertexID, Weight, const BinaryPredicate&, const BinaryFunction&, const Infinity&, DistanceZero) [with VertexAndEdgeListGraph = R_adjacency_list; DistanceMatrix = Basic2DMatrix; VertexID = vec_adj_list_vertex_id_map, long unsigned int>; Weight = adj_list_edge_property_map, edge_weight_t>; BinaryPredicate = std::less; BinaryFunction = closed_plus; Infinity = double; DistanceZero = double]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/johnson_all_pairs_shortest.hpp:164:48: required from ‘bool boost::detail::johnson_dispatch(VertexAndEdgeListGraph&, DistanceMatrix&, const boost::bgl_named_params&, Weight, VertexID) [with VertexAndEdgeListGraph = R_adjacency_list; DistanceMatrix = Basic2DMatrix; P = int; T = int; R = boost::no_property; Weight = boost::adj_list_edge_property_map, boost::edge_weight_t>; VertexID = boost::vec_adj_list_vertex_id_map, long unsigned int>]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/johnson_all_pairs_shortest.hpp:192:36: required from ‘bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&) [with VertexAndEdgeListGraph = R_adjacency_list; DistanceMatrix = Basic2DMatrix]’ shortestPath.cpp:56:41: required from here /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::EqualityComparable > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> >]’ 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ^ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >]’: /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:512:7: required from ‘struct boost::InputIterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::InputIterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> >]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::value’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_ > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> >)>’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/graph_concepts.hpp:53:35: [ skipping 8 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/dijkstra_shortest_paths.hpp:491:28: required from ‘void boost::dijkstra_shortest_paths(const VertexListGraph&, SourceInputIter, SourceInputIter, PredecessorMap, DistanceMap, WeightMap, IndexMap, Compare, Combine, DistInf, DistZero, DijkstraVisitor) [with VertexListGraph = adjacency_list, property >, no_property, listS>; SourceInputIter = long unsigned int*; DijkstraVisitor = dijkstra_visitor<>; PredecessorMap = dummy_property_map; DistanceMap = vec_adj_list_vertex_property_map, property >, no_property, listS>, adjacency_list, property >, no_property, listS>*, double, double&, vertex_distance_t>; WeightMap = adj_list_edge_property_map >, edge_weight2_t>; IndexMap = vec_adj_list_vertex_id_map, long unsigned int>; Compare = std::less; Combine = closed_plus; DistInf = double; DistZero = double]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/dijkstra_shortest_paths.hpp:505:28: required from ‘void boost::dijkstra_shortest_paths(const VertexListGraph&, typename graph_traits::vertex_descriptor, PredecessorMap, DistanceMap, WeightMap, IndexMap, Compare, Combine, DistInf, DistZero, DijkstraVisitor) [with VertexListGraph = adjacency_list, property >, no_property, listS>; DijkstraVisitor = dijkstra_visitor<>; PredecessorMap = dummy_property_map; DistanceMap = vec_adj_list_vertex_property_map, property >, no_property, listS>, adjacency_list, property >, no_property, listS>*, double, double&, vertex_distance_t>; WeightMap = adj_list_edge_property_map >, edge_weight2_t>; IndexMap = vec_adj_list_vertex_id_map, long unsigned int>; Compare = std::less; Combine = closed_plus; DistInf = double; DistZero = double; typename graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/johnson_all_pairs_shortest.hpp:127:36: required from ‘bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, VertexID, Weight, const BinaryPredicate&, const BinaryFunction&, const Infinity&, DistanceZero) [with VertexAndEdgeListGraph = R_adjacency_list; DistanceMatrix = Basic2DMatrix; VertexID = vec_adj_list_vertex_id_map, long unsigned int>; Weight = adj_list_edge_property_map, edge_weight_t>; BinaryPredicate = std::less; BinaryFunction = closed_plus; Infinity = double; DistanceZero = double]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/johnson_all_pairs_shortest.hpp:164:48: required from ‘bool boost::detail::johnson_dispatch(VertexAndEdgeListGraph&, DistanceMatrix&, const boost::bgl_named_params&, Weight, VertexID) [with VertexAndEdgeListGraph = R_adjacency_list; DistanceMatrix = Basic2DMatrix; P = int; T = int; R = boost::no_property; Weight = boost::adj_list_edge_property_map, boost::edge_weight_t>; VertexID = boost::vec_adj_list_vertex_id_map, long unsigned int>]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/johnson_all_pairs_shortest.hpp:192:36: required from ‘bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&) [with VertexAndEdgeListGraph = R_adjacency_list; DistanceMatrix = Basic2DMatrix]’ shortestPath.cpp:56:41: required from here /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::InputIterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> >]’ 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ^ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::InputIterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> >]’: /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/graph_concepts.hpp:53:35: required from ‘boost::concepts::MultiPassInputIterator::~MultiPassInputIterator() [with T = boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::MultiPassInputIterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> >]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/graph_concepts.hpp:89:9: required from ‘boost::concepts::IncidenceGraph::~IncidenceGraph() [with G = boost::adjacency_list, boost::property >, boost::no_property, boost::listS>]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/graph_concepts.hpp:75:1: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::IncidenceGraphConcept, boost::property >, boost::no_property, boost::listS> >]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/breadth_first_search.hpp:62:5: required from ‘void boost::breadth_first_visit(const IncidenceGraph&, SourceIterator, SourceIterator, Buffer&, BFSVisitor, ColorMap) [with IncidenceGraph = adjacency_list, property >, no_property, listS>; Buffer = d_ary_heap_indirect, long unsigned int>, long unsigned int, long unsigned int&>, vec_adj_list_vertex_property_map, property >, no_property, listS>, adjacency_list, property >, no_property, listS>*, double, double&, vertex_distance_t>, std::less, std::vector >; BFSVisitor = detail::dijkstra_bfs_visitor, d_ary_heap_indirect, long unsigned int>, long unsigned int, long unsigned int&>, vec_adj_list_vertex_property_map, property >, no_property, listS>, adjacency_list, property >, no_property, listS>*, double, double&, vertex_distance_t>, std::less, std::vector >, adj_list_edge_property_map >, edge_weight2_t>, dummy_property_map, vec_adj_list_vertex_property_map, property >, no_property, listS>, adjacency_list, property >, no_property, listS>*, double, double&, vertex_distance_t>, closed_plus, std::less >; ColorMap = two_bit_color_map, long unsigned int> >; SourceIterator = long unsigned int*]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/dijkstra_shortest_paths.hpp:387:24: [ skipping 3 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/dijkstra_shortest_paths.hpp:491:28: required from ‘void boost::dijkstra_shortest_paths(const VertexListGraph&, SourceInputIter, SourceInputIter, PredecessorMap, DistanceMap, WeightMap, IndexMap, Compare, Combine, DistInf, DistZero, DijkstraVisitor) [with VertexListGraph = adjacency_list, property >, no_property, listS>; SourceInputIter = long unsigned int*; DijkstraVisitor = dijkstra_visitor<>; PredecessorMap = dummy_property_map; DistanceMap = vec_adj_list_vertex_property_map, property >, no_property, listS>, adjacency_list, property >, no_property, listS>*, double, double&, vertex_distance_t>; WeightMap = adj_list_edge_property_map >, edge_weight2_t>; IndexMap = vec_adj_list_vertex_id_map, long unsigned int>; Compare = std::less; Combine = closed_plus; DistInf = double; DistZero = double]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/dijkstra_shortest_paths.hpp:505:28: required from ‘void boost::dijkstra_shortest_paths(const VertexListGraph&, typename graph_traits::vertex_descriptor, PredecessorMap, DistanceMap, WeightMap, IndexMap, Compare, Combine, DistInf, DistZero, DijkstraVisitor) [with VertexListGraph = adjacency_list, property >, no_property, listS>; DijkstraVisitor = dijkstra_visitor<>; PredecessorMap = dummy_property_map; DistanceMap = vec_adj_list_vertex_property_map, property >, no_property, listS>, adjacency_list, property >, no_property, listS>*, double, double&, vertex_distance_t>; WeightMap = adj_list_edge_property_map >, edge_weight2_t>; IndexMap = vec_adj_list_vertex_id_map, long unsigned int>; Compare = std::less; Combine = closed_plus; DistInf = double; DistZero = double; typename graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/johnson_all_pairs_shortest.hpp:127:36: required from ‘bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, VertexID, Weight, const BinaryPredicate&, const BinaryFunction&, const Infinity&, DistanceZero) [with VertexAndEdgeListGraph = R_adjacency_list; DistanceMatrix = Basic2DMatrix; VertexID = vec_adj_list_vertex_id_map, long unsigned int>; Weight = adj_list_edge_property_map, edge_weight_t>; BinaryPredicate = std::less; BinaryFunction = closed_plus; Infinity = double; DistanceZero = double]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/johnson_all_pairs_shortest.hpp:164:48: required from ‘bool boost::detail::johnson_dispatch(VertexAndEdgeListGraph&, DistanceMatrix&, const boost::bgl_named_params&, Weight, VertexID) [with VertexAndEdgeListGraph = R_adjacency_list; DistanceMatrix = Basic2DMatrix; P = int; T = int; R = boost::no_property; Weight = boost::adj_list_edge_property_map, boost::edge_weight_t>; VertexID = boost::vec_adj_list_vertex_id_map, long unsigned int>]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/johnson_all_pairs_shortest.hpp:192:36: required from ‘bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&) [with VertexAndEdgeListGraph = R_adjacency_list; DistanceMatrix = Basic2DMatrix]’ shortestPath.cpp:56:41: required from here /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::InputIterator::~InputIterator() [with TT = boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>]’ 37 | ~model() | ^ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:512:7: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 512 | BOOST_CONCEPT_USAGE(InputIterator) | ^~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::Assignable > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> >]’: /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:145:5: required from ‘struct boost::Assignable > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:502:3: required from ‘struct boost::InputIterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::InputIterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> >]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::value’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:45:51: [ skipping 10 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/dijkstra_shortest_paths.hpp:491:28: required from ‘void boost::dijkstra_shortest_paths(const VertexListGraph&, SourceInputIter, SourceInputIter, PredecessorMap, DistanceMap, WeightMap, IndexMap, Compare, Combine, DistInf, DistZero, DijkstraVisitor) [with VertexListGraph = adjacency_list, property >, no_property, listS>; SourceInputIter = long unsigned int*; DijkstraVisitor = dijkstra_visitor<>; PredecessorMap = dummy_property_map; DistanceMap = vec_adj_list_vertex_property_map, property >, no_property, listS>, adjacency_list, property >, no_property, listS>*, double, double&, vertex_distance_t>; WeightMap = adj_list_edge_property_map >, edge_weight2_t>; IndexMap = vec_adj_list_vertex_id_map, long unsigned int>; Compare = std::less; Combine = closed_plus; DistInf = double; DistZero = double]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/dijkstra_shortest_paths.hpp:505:28: required from ‘void boost::dijkstra_shortest_paths(const VertexListGraph&, typename graph_traits::vertex_descriptor, PredecessorMap, DistanceMap, WeightMap, IndexMap, Compare, Combine, DistInf, DistZero, DijkstraVisitor) [with VertexListGraph = adjacency_list, property >, no_property, listS>; DijkstraVisitor = dijkstra_visitor<>; PredecessorMap = dummy_property_map; DistanceMap = vec_adj_list_vertex_property_map, property >, no_property, listS>, adjacency_list, property >, no_property, listS>*, double, double&, vertex_distance_t>; WeightMap = adj_list_edge_property_map >, edge_weight2_t>; IndexMap = vec_adj_list_vertex_id_map, long unsigned int>; Compare = std::less; Combine = closed_plus; DistInf = double; DistZero = double; typename graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/johnson_all_pairs_shortest.hpp:127:36: required from ‘bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, VertexID, Weight, const BinaryPredicate&, const BinaryFunction&, const Infinity&, DistanceZero) [with VertexAndEdgeListGraph = R_adjacency_list; DistanceMatrix = Basic2DMatrix; VertexID = vec_adj_list_vertex_id_map, long unsigned int>; Weight = adj_list_edge_property_map, edge_weight_t>; BinaryPredicate = std::less; BinaryFunction = closed_plus; Infinity = double; DistanceZero = double]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/johnson_all_pairs_shortest.hpp:164:48: required from ‘bool boost::detail::johnson_dispatch(VertexAndEdgeListGraph&, DistanceMatrix&, const boost::bgl_named_params&, Weight, VertexID) [with VertexAndEdgeListGraph = R_adjacency_list; DistanceMatrix = Basic2DMatrix; P = int; T = int; R = boost::no_property; Weight = boost::adj_list_edge_property_map, boost::edge_weight_t>; VertexID = boost::vec_adj_list_vertex_id_map, long unsigned int>]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/johnson_all_pairs_shortest.hpp:192:36: required from ‘bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&) [with VertexAndEdgeListGraph = R_adjacency_list; DistanceMatrix = Basic2DMatrix]’ shortestPath.cpp:56:41: required from here /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::Assignable::~Assignable() [with TT = boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>]’ 37 | ~model() | ^ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:145:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 145 | BOOST_CONCEPT_USAGE(Assignable) { | ^~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::EqualityComparable > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> >]’: /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:233:5: required from ‘struct boost::EqualityComparable > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:502:3: required from ‘struct boost::InputIterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::InputIterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> >]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::value’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:45:51: [ skipping 10 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/dijkstra_shortest_paths.hpp:491:28: required from ‘void boost::dijkstra_shortest_paths(const VertexListGraph&, SourceInputIter, SourceInputIter, PredecessorMap, DistanceMap, WeightMap, IndexMap, Compare, Combine, DistInf, DistZero, DijkstraVisitor) [with VertexListGraph = adjacency_list, property >, no_property, listS>; SourceInputIter = long unsigned int*; DijkstraVisitor = dijkstra_visitor<>; PredecessorMap = dummy_property_map; DistanceMap = vec_adj_list_vertex_property_map, property >, no_property, listS>, adjacency_list, property >, no_property, listS>*, double, double&, vertex_distance_t>; WeightMap = adj_list_edge_property_map >, edge_weight2_t>; IndexMap = vec_adj_list_vertex_id_map, long unsigned int>; Compare = std::less; Combine = closed_plus; DistInf = double; DistZero = double]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/dijkstra_shortest_paths.hpp:505:28: required from ‘void boost::dijkstra_shortest_paths(const VertexListGraph&, typename graph_traits::vertex_descriptor, PredecessorMap, DistanceMap, WeightMap, IndexMap, Compare, Combine, DistInf, DistZero, DijkstraVisitor) [with VertexListGraph = adjacency_list, property >, no_property, listS>; DijkstraVisitor = dijkstra_visitor<>; PredecessorMap = dummy_property_map; DistanceMap = vec_adj_list_vertex_property_map, property >, no_property, listS>, adjacency_list, property >, no_property, listS>*, double, double&, vertex_distance_t>; WeightMap = adj_list_edge_property_map >, edge_weight2_t>; IndexMap = vec_adj_list_vertex_id_map, long unsigned int>; Compare = std::less; Combine = closed_plus; DistInf = double; DistZero = double; typename graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/johnson_all_pairs_shortest.hpp:127:36: required from ‘bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, VertexID, Weight, const BinaryPredicate&, const BinaryFunction&, const Infinity&, DistanceZero) [with VertexAndEdgeListGraph = R_adjacency_list; DistanceMatrix = Basic2DMatrix; VertexID = vec_adj_list_vertex_id_map, long unsigned int>; Weight = adj_list_edge_property_map, edge_weight_t>; BinaryPredicate = std::less; BinaryFunction = closed_plus; Infinity = double; DistanceZero = double]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/johnson_all_pairs_shortest.hpp:164:48: required from ‘bool boost::detail::johnson_dispatch(VertexAndEdgeListGraph&, DistanceMatrix&, const boost::bgl_named_params&, Weight, VertexID) [with VertexAndEdgeListGraph = R_adjacency_list; DistanceMatrix = Basic2DMatrix; P = int; T = int; R = boost::no_property; Weight = boost::adj_list_edge_property_map, boost::edge_weight_t>; VertexID = boost::vec_adj_list_vertex_id_map, long unsigned int>]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/johnson_all_pairs_shortest.hpp:192:36: required from ‘bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&) [with VertexAndEdgeListGraph = R_adjacency_list; DistanceMatrix = Basic2DMatrix]’ shortestPath.cpp:56:41: required from here /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::EqualityComparable::~EqualityComparable() [with TT = boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>]’ 37 | ~model() | ^ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:233:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 233 | BOOST_CONCEPT_USAGE(EqualityComparable) { | ^~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::InputIterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> >]’: /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:512:7: required from ‘struct boost::InputIterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::InputIterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> >]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::value’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:72:8: [ skipping 9 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/dijkstra_shortest_paths.hpp:491:28: required from ‘void boost::dijkstra_shortest_paths(const VertexListGraph&, SourceInputIter, SourceInputIter, PredecessorMap, DistanceMap, WeightMap, IndexMap, Compare, Combine, DistInf, DistZero, DijkstraVisitor) [with VertexListGraph = adjacency_list, property >, no_property, listS>; SourceInputIter = long unsigned int*; DijkstraVisitor = dijkstra_visitor<>; PredecessorMap = dummy_property_map; DistanceMap = vec_adj_list_vertex_property_map, property >, no_property, listS>, adjacency_list, property >, no_property, listS>*, double, double&, vertex_distance_t>; WeightMap = adj_list_edge_property_map >, edge_weight2_t>; IndexMap = vec_adj_list_vertex_id_map, long unsigned int>; Compare = std::less; Combine = closed_plus; DistInf = double; DistZero = double]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/dijkstra_shortest_paths.hpp:505:28: required from ‘void boost::dijkstra_shortest_paths(const VertexListGraph&, typename graph_traits::vertex_descriptor, PredecessorMap, DistanceMap, WeightMap, IndexMap, Compare, Combine, DistInf, DistZero, DijkstraVisitor) [with VertexListGraph = adjacency_list, property >, no_property, listS>; DijkstraVisitor = dijkstra_visitor<>; PredecessorMap = dummy_property_map; DistanceMap = vec_adj_list_vertex_property_map, property >, no_property, listS>, adjacency_list, property >, no_property, listS>*, double, double&, vertex_distance_t>; WeightMap = adj_list_edge_property_map >, edge_weight2_t>; IndexMap = vec_adj_list_vertex_id_map, long unsigned int>; Compare = std::less; Combine = closed_plus; DistInf = double; DistZero = double; typename graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/johnson_all_pairs_shortest.hpp:127:36: required from ‘bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, VertexID, Weight, const BinaryPredicate&, const BinaryFunction&, const Infinity&, DistanceZero) [with VertexAndEdgeListGraph = R_adjacency_list; DistanceMatrix = Basic2DMatrix; VertexID = vec_adj_list_vertex_id_map, long unsigned int>; Weight = adj_list_edge_property_map, edge_weight_t>; BinaryPredicate = std::less; BinaryFunction = closed_plus; Infinity = double; DistanceZero = double]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/johnson_all_pairs_shortest.hpp:164:48: required from ‘bool boost::detail::johnson_dispatch(VertexAndEdgeListGraph&, DistanceMatrix&, const boost::bgl_named_params&, Weight, VertexID) [with VertexAndEdgeListGraph = R_adjacency_list; DistanceMatrix = Basic2DMatrix; P = int; T = int; R = boost::no_property; Weight = boost::adj_list_edge_property_map, boost::edge_weight_t>; VertexID = boost::vec_adj_list_vertex_id_map, long unsigned int>]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/johnson_all_pairs_shortest.hpp:192:36: required from ‘bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&) [with VertexAndEdgeListGraph = R_adjacency_list; DistanceMatrix = Basic2DMatrix]’ shortestPath.cpp:56:41: required from here /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::InputIterator::~InputIterator() [with TT = boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>]’ 37 | ~model() | ^ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:512:7: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 512 | BOOST_CONCEPT_USAGE(InputIterator) | ^~~~~~~~~~~~~~~~~~~ g++ -std=gnu++17 -I"/usr/share/R/include" -DNDEBUG -I'/home/omnipath/local/R/4.4-3.20/BH/include' -fpic -g -O2 -fno-omit-frame-pointer -mno-omit-leaf-frame-pointer -ffile-prefix-map=/build/r-base-EawLoD/r-base-4.4.1=. -fstack-protector-strong -fstack-clash-protection -Wformat -Werror=format-security -fcf-protection -fdebug-prefix-map=/build/r-base-EawLoD/r-base-4.4.1=/usr/src/r-base-4.4.1-1.2404.0 -Wdate-time -D_FORTIFY_SOURCE=3 -c sna.cpp -o sna.o In file included from /home/omnipath/local/R/4.4-3.20/BH/include/boost/smart_ptr/shared_ptr.hpp:18, from /home/omnipath/local/R/4.4-3.20/BH/include/boost/property_map/vector_property_map.hpp:14, from /home/omnipath/local/R/4.4-3.20/BH/include/boost/property_map/property_map.hpp:598, from RBGL.hpp:17, from sna.cpp:1: /home/omnipath/local/R/4.4-3.20/BH/include/boost/smart_ptr/detail/shared_count.hpp:361:33: warning: ‘template class std::auto_ptr’ is deprecated: use 'std::unique_ptr' instead [-Wdeprecated-declarations] 361 | explicit shared_count( std::auto_ptr & r ): pi_( new sp_counted_impl_p( r.get() ) ) | ^~~~~~~~ In file included from /usr/include/c++/13/memory:78, from /home/omnipath/local/R/4.4-3.20/BH/include/boost/smart_ptr/detail/sp_counted_impl.hpp:35, from /home/omnipath/local/R/4.4-3.20/BH/include/boost/smart_ptr/detail/shared_count.hpp:27: /usr/include/c++/13/bits/unique_ptr.h:65:28: note: declared here 65 | template class auto_ptr; | ^~~~~~~~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/smart_ptr/shared_ptr.hpp:251:65: warning: ‘template class std::auto_ptr’ is deprecated: use 'std::unique_ptr' instead [-Wdeprecated-declarations] 251 | template< class T, class R > struct sp_enable_if_auto_ptr< std::auto_ptr< T >, R > | ^~~~~~~~ /usr/include/c++/13/bits/unique_ptr.h:65:28: note: declared here 65 | template class auto_ptr; | ^~~~~~~~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/smart_ptr/shared_ptr.hpp:508:31: warning: ‘template class std::auto_ptr’ is deprecated: use 'std::unique_ptr' instead [-Wdeprecated-declarations] 508 | explicit shared_ptr( std::auto_ptr & r ): px(r.get()), pn() | ^~~~~~~~ /usr/include/c++/13/bits/unique_ptr.h:65:28: note: declared here 65 | template class auto_ptr; | ^~~~~~~~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/smart_ptr/shared_ptr.hpp:521:22: warning: ‘template class std::auto_ptr’ is deprecated: use 'std::unique_ptr' instead [-Wdeprecated-declarations] 521 | shared_ptr( std::auto_ptr && r ): px(r.get()), pn() | ^~~~~~~~ /usr/include/c++/13/bits/unique_ptr.h:65:28: note: declared here 65 | template class auto_ptr; | ^~~~~~~~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/smart_ptr/shared_ptr.hpp:604:34: warning: ‘template class std::auto_ptr’ is deprecated: use 'std::unique_ptr' instead [-Wdeprecated-declarations] 604 | shared_ptr & operator=( std::auto_ptr & r ) | ^~~~~~~~ /usr/include/c++/13/bits/unique_ptr.h:65:28: note: declared here 65 | template class auto_ptr; | ^~~~~~~~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/smart_ptr/shared_ptr.hpp:613:34: warning: ‘template class std::auto_ptr’ is deprecated: use 'std::unique_ptr' instead [-Wdeprecated-declarations] 613 | shared_ptr & operator=( std::auto_ptr && r ) | ^~~~~~~~ /usr/include/c++/13/bits/unique_ptr.h:65:28: note: declared here 65 | template class auto_ptr; | ^~~~~~~~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/smart_ptr/shared_ptr.hpp: In member function ‘boost::shared_ptr& boost::shared_ptr::operator=(std::auto_ptr<_Up>&&)’: /home/omnipath/local/R/4.4-3.20/BH/include/boost/smart_ptr/shared_ptr.hpp:615:38: warning: ‘template class std::auto_ptr’ is deprecated: use 'std::unique_ptr' instead [-Wdeprecated-declarations] 615 | this_type( static_cast< std::auto_ptr && >( r ) ).swap( *this ); | ^~~~~~~~ /usr/include/c++/13/bits/unique_ptr.h:65:28: note: declared here 65 | template class auto_ptr; | ^~~~~~~~ In file included from /home/omnipath/local/R/4.4-3.20/BH/include/boost/scoped_ptr.hpp:13, from /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/adjacency_list.hpp:22, from RBGL.hpp:38: /home/omnipath/local/R/4.4-3.20/BH/include/boost/smart_ptr/scoped_ptr.hpp: At global scope: /home/omnipath/local/R/4.4-3.20/BH/include/boost/smart_ptr/scoped_ptr.hpp:75:31: warning: ‘template class std::auto_ptr’ is deprecated: use 'std::unique_ptr' instead [-Wdeprecated-declarations] 75 | explicit scoped_ptr( std::auto_ptr p ) BOOST_SP_NOEXCEPT : px( p.release() ) | ^~~~~~~~ /usr/include/c++/13/bits/unique_ptr.h:65:28: note: declared here 65 | template class auto_ptr; | ^~~~~~~~ In file included from /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/assert.hpp:35, from /home/omnipath/local/R/4.4-3.20/BH/include/boost/property_map/property_map.hpp:19: /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements, long unsigned int, double> >]’: /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/graph_concepts.hpp:516:5: required from ‘struct boost::concepts::BasicMatrix, long unsigned int, double>’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/graph_concepts.hpp:514:1: required from ‘struct boost::concepts::BasicMatrixConcept, long unsigned int, double>’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::concepts::BasicMatrixConcept, long unsigned int, double>]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied, long unsigned int, double> >::value’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied, long unsigned int, double> >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_, long unsigned int, double>)>’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/johnson_all_pairs_shortest.hpp:46:5: required from ‘bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, VertexID, Weight, const BinaryPredicate&, const BinaryFunction&, const Infinity&, DistanceZero) [with VertexAndEdgeListGraph = R_adjacency_list; DistanceMatrix = Basic2DMatrix; VertexID = vec_adj_list_vertex_id_map, long unsigned int>; Weight = adj_list_edge_property_map, edge_weight_t>; BinaryPredicate = std::less; BinaryFunction = closed_plus; Infinity = double; DistanceZero = double]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/johnson_all_pairs_shortest.hpp:164:48: required from ‘bool boost::detail::johnson_dispatch(VertexAndEdgeListGraph&, DistanceMatrix&, const boost::bgl_named_params&, Weight, VertexID) [with VertexAndEdgeListGraph = R_adjacency_list; DistanceMatrix = Basic2DMatrix; P = int; T = int; R = boost::no_property; Weight = boost::adj_list_edge_property_map, boost::edge_weight_t>; VertexID = boost::vec_adj_list_vertex_id_map, long unsigned int>]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/johnson_all_pairs_shortest.hpp:192:36: required from ‘bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&) [with VertexAndEdgeListGraph = R_adjacency_list; DistanceMatrix = Basic2DMatrix]’ sna.cpp:105:41: required from here /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ In file included from /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:31, from /home/omnipath/local/R/4.4-3.20/BH/include/boost/property_map/property_map.hpp:20: /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::concepts::BasicMatrix, long unsigned int, double>]’ 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ^ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::BasicMatrixConcept, long unsigned int, double>]’: /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/johnson_all_pairs_shortest.hpp:46:5: required from ‘bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, VertexID, Weight, const BinaryPredicate&, const BinaryFunction&, const Infinity&, DistanceZero) [with VertexAndEdgeListGraph = R_adjacency_list; DistanceMatrix = Basic2DMatrix; VertexID = vec_adj_list_vertex_id_map, long unsigned int>; Weight = adj_list_edge_property_map, edge_weight_t>; BinaryPredicate = std::less; BinaryFunction = closed_plus; Infinity = double; DistanceZero = double]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/johnson_all_pairs_shortest.hpp:164:48: required from ‘bool boost::detail::johnson_dispatch(VertexAndEdgeListGraph&, DistanceMatrix&, const boost::bgl_named_params&, Weight, VertexID) [with VertexAndEdgeListGraph = R_adjacency_list; DistanceMatrix = Basic2DMatrix; P = int; T = int; R = boost::no_property; Weight = boost::adj_list_edge_property_map, boost::edge_weight_t>; VertexID = boost::vec_adj_list_vertex_id_map, long unsigned int>]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/johnson_all_pairs_shortest.hpp:192:36: required from ‘bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&) [with VertexAndEdgeListGraph = R_adjacency_list; DistanceMatrix = Basic2DMatrix]’ sna.cpp:105:41: required from here /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ In file included from /home/omnipath/local/R/4.4-3.20/BH/include/boost/preprocessor/repetition/enum_binary_params.hpp:15, from /home/omnipath/local/R/4.4-3.20/BH/include/boost/utility/base_from_member.hpp:15, from /home/omnipath/local/R/4.4-3.20/BH/include/boost/utility.hpp:15, from RBGL.hpp:16: /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/graph_concepts.hpp:514:15: note: in a call to non-static member function ‘boost::concepts::BasicMatrixConcept, long unsigned int, double>::~BasicMatrixConcept()’ 514 | BOOST_concept(BasicMatrix, (M)(I)(V)) | ^~~~~~~~~~~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/preprocessor/cat.hpp:29:34: note: in definition of macro ‘BOOST_PP_CAT_I’ 29 | # define BOOST_PP_CAT_I(a, b) a ## b | ^ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/concept_def.hpp:23:12: note: in expansion of macro ‘BOOST_PP_CAT’ 23 | struct BOOST_PP_CAT(name,Concept) \ | ^~~~~~~~~~~~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/graph_concepts.hpp:514:1: note: in expansion of macro ‘BOOST_concept’ 514 | BOOST_concept(BasicMatrix, (M)(I)(V)) | ^~~~~~~~~~~~~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::concepts::BasicMatrix, long unsigned int, double>]’: /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements, long unsigned int, double> >]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/graph_concepts.hpp:516:5: required from ‘struct boost::concepts::BasicMatrix, long unsigned int, double>’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/graph_concepts.hpp:514:1: required from ‘struct boost::concepts::BasicMatrixConcept, long unsigned int, double>’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::concepts::BasicMatrixConcept, long unsigned int, double>]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied, long unsigned int, double> >::value’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied, long unsigned int, double> >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_, long unsigned int, double>)>’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/johnson_all_pairs_shortest.hpp:46:5: required from ‘bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, VertexID, Weight, const BinaryPredicate&, const BinaryFunction&, const Infinity&, DistanceZero) [with VertexAndEdgeListGraph = R_adjacency_list; DistanceMatrix = Basic2DMatrix; VertexID = vec_adj_list_vertex_id_map, long unsigned int>; Weight = adj_list_edge_property_map, edge_weight_t>; BinaryPredicate = std::less; BinaryFunction = closed_plus; Infinity = double; DistanceZero = double]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/johnson_all_pairs_shortest.hpp:164:48: required from ‘bool boost::detail::johnson_dispatch(VertexAndEdgeListGraph&, DistanceMatrix&, const boost::bgl_named_params&, Weight, VertexID) [with VertexAndEdgeListGraph = R_adjacency_list; DistanceMatrix = Basic2DMatrix; P = int; T = int; R = boost::no_property; Weight = boost::adj_list_edge_property_map, boost::edge_weight_t>; VertexID = boost::vec_adj_list_vertex_id_map, long unsigned int>]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/johnson_all_pairs_shortest.hpp:192:36: required from ‘bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&) [with VertexAndEdgeListGraph = R_adjacency_list; DistanceMatrix = Basic2DMatrix]’ sna.cpp:105:41: required from here /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::concepts::BasicMatrix::~BasicMatrix() [with M = Basic2DMatrix; I = long unsigned int; V = double]’ 37 | ~model() | ^ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/graph_concepts.hpp:516:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 516 | BOOST_CONCEPT_USAGE(BasicMatrix) | ^~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements, boost::property >, boost::no_property, boost::listS> > >]’: /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/graph_concepts.hpp:66:5: required from ‘struct boost::concepts::Graph, boost::property >, boost::no_property, boost::listS> >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/graph_concepts.hpp:226:1: required from ‘struct boost::concepts::EdgeListGraph, boost::property >, boost::no_property, boost::listS> >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/graph_concepts.hpp:226:1: required from ‘struct boost::concepts::EdgeListGraphConcept, boost::property >, boost::no_property, boost::listS> >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::concepts::EdgeListGraphConcept, boost::property >, boost::no_property, boost::listS> >]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:42:5: [ skipping 2 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_, boost::property >, boost::no_property, boost::listS> >)>’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/bellman_ford_shortest_paths.hpp:97:5: required from ‘bool boost::bellman_ford_shortest_paths(EdgeListGraph&, Size, WeightMap, PredecessorMap, DistanceMap, BinaryFunction, BinaryPredicate, BellmanFordVisitor) [with EdgeListGraph = adjacency_list, property >, no_property, listS>; Size = long unsigned int; WeightMap = adj_list_edge_property_map >, edge_weight_t>; PredecessorMap = dummy_property_map; DistanceMap = vec_adj_list_vertex_property_map, property >, no_property, listS>, adjacency_list, property >, no_property, listS>*, double, double&, vertex_distance_t>; BinaryFunction = closed_plus; BinaryPredicate = std::less; BellmanFordVisitor = bellman_visitor<>]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/johnson_all_pairs_shortest.hpp:112:36: required from ‘bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, VertexID, Weight, const BinaryPredicate&, const BinaryFunction&, const Infinity&, DistanceZero) [with VertexAndEdgeListGraph = R_adjacency_list; DistanceMatrix = Basic2DMatrix; VertexID = vec_adj_list_vertex_id_map, long unsigned int>; Weight = adj_list_edge_property_map, edge_weight_t>; BinaryPredicate = std::less; BinaryFunction = closed_plus; Infinity = double; DistanceZero = double]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/johnson_all_pairs_shortest.hpp:164:48: required from ‘bool boost::detail::johnson_dispatch(VertexAndEdgeListGraph&, DistanceMatrix&, const boost::bgl_named_params&, Weight, VertexID) [with VertexAndEdgeListGraph = R_adjacency_list; DistanceMatrix = Basic2DMatrix; P = int; T = int; R = boost::no_property; Weight = boost::adj_list_edge_property_map, boost::edge_weight_t>; VertexID = boost::vec_adj_list_vertex_id_map, long unsigned int>]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/johnson_all_pairs_shortest.hpp:192:36: required from ‘bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&) [with VertexAndEdgeListGraph = R_adjacency_list; DistanceMatrix = Basic2DMatrix]’ sna.cpp:105:41: required from here /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::concepts::Graph, boost::property >, boost::no_property, boost::listS> >]’ 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ^ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements, boost::property >, boost::no_property, boost::listS> > >]’: /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/graph_concepts.hpp:233:5: required from ‘struct boost::concepts::EdgeListGraph, boost::property >, boost::no_property, boost::listS> >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/graph_concepts.hpp:226:1: required from ‘struct boost::concepts::EdgeListGraphConcept, boost::property >, boost::no_property, boost::listS> >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::concepts::EdgeListGraphConcept, boost::property >, boost::no_property, boost::listS> >]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied, boost::property >, boost::no_property, boost::listS> > >::value’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied, boost::property >, boost::no_property, boost::listS> > >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_, boost::property >, boost::no_property, boost::listS> >)>’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/bellman_ford_shortest_paths.hpp:97:5: required from ‘bool boost::bellman_ford_shortest_paths(EdgeListGraph&, Size, WeightMap, PredecessorMap, DistanceMap, BinaryFunction, BinaryPredicate, BellmanFordVisitor) [with EdgeListGraph = adjacency_list, property >, no_property, listS>; Size = long unsigned int; WeightMap = adj_list_edge_property_map >, edge_weight_t>; PredecessorMap = dummy_property_map; DistanceMap = vec_adj_list_vertex_property_map, property >, no_property, listS>, adjacency_list, property >, no_property, listS>*, double, double&, vertex_distance_t>; BinaryFunction = closed_plus; BinaryPredicate = std::less; BellmanFordVisitor = bellman_visitor<>]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/johnson_all_pairs_shortest.hpp:112:36: required from ‘bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, VertexID, Weight, const BinaryPredicate&, const BinaryFunction&, const Infinity&, DistanceZero) [with VertexAndEdgeListGraph = R_adjacency_list; DistanceMatrix = Basic2DMatrix; VertexID = vec_adj_list_vertex_id_map, long unsigned int>; Weight = adj_list_edge_property_map, edge_weight_t>; BinaryPredicate = std::less; BinaryFunction = closed_plus; Infinity = double; DistanceZero = double]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/johnson_all_pairs_shortest.hpp:164:48: required from ‘bool boost::detail::johnson_dispatch(VertexAndEdgeListGraph&, DistanceMatrix&, const boost::bgl_named_params&, Weight, VertexID) [with VertexAndEdgeListGraph = R_adjacency_list; DistanceMatrix = Basic2DMatrix; P = int; T = int; R = boost::no_property; Weight = boost::adj_list_edge_property_map, boost::edge_weight_t>; VertexID = boost::vec_adj_list_vertex_id_map, long unsigned int>]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/johnson_all_pairs_shortest.hpp:192:36: required from ‘bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&) [with VertexAndEdgeListGraph = R_adjacency_list; DistanceMatrix = Basic2DMatrix]’ sna.cpp:105:41: required from here /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::concepts::EdgeListGraph, boost::property >, boost::no_property, boost::listS> >]’ 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ^ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::EdgeListGraphConcept, boost::property >, boost::no_property, boost::listS> >]’: /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/bellman_ford_shortest_paths.hpp:97:5: required from ‘bool boost::bellman_ford_shortest_paths(EdgeListGraph&, Size, WeightMap, PredecessorMap, DistanceMap, BinaryFunction, BinaryPredicate, BellmanFordVisitor) [with EdgeListGraph = adjacency_list, property >, no_property, listS>; Size = long unsigned int; WeightMap = adj_list_edge_property_map >, edge_weight_t>; PredecessorMap = dummy_property_map; DistanceMap = vec_adj_list_vertex_property_map, property >, no_property, listS>, adjacency_list, property >, no_property, listS>*, double, double&, vertex_distance_t>; BinaryFunction = closed_plus; BinaryPredicate = std::less; BellmanFordVisitor = bellman_visitor<>]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/johnson_all_pairs_shortest.hpp:112:36: required from ‘bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, VertexID, Weight, const BinaryPredicate&, const BinaryFunction&, const Infinity&, DistanceZero) [with VertexAndEdgeListGraph = R_adjacency_list; DistanceMatrix = Basic2DMatrix; VertexID = vec_adj_list_vertex_id_map, long unsigned int>; Weight = adj_list_edge_property_map, edge_weight_t>; BinaryPredicate = std::less; BinaryFunction = closed_plus; Infinity = double; DistanceZero = double]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/johnson_all_pairs_shortest.hpp:164:48: required from ‘bool boost::detail::johnson_dispatch(VertexAndEdgeListGraph&, DistanceMatrix&, const boost::bgl_named_params&, Weight, VertexID) [with VertexAndEdgeListGraph = R_adjacency_list; DistanceMatrix = Basic2DMatrix; P = int; T = int; R = boost::no_property; Weight = boost::adj_list_edge_property_map, boost::edge_weight_t>; VertexID = boost::vec_adj_list_vertex_id_map, long unsigned int>]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/johnson_all_pairs_shortest.hpp:192:36: required from ‘bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&) [with VertexAndEdgeListGraph = R_adjacency_list; DistanceMatrix = Basic2DMatrix]’ sna.cpp:105:41: required from here /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/graph_concepts.hpp:226:15: note: in a call to non-static member function ‘boost::concepts::EdgeListGraphConcept, boost::property >, boost::no_property, boost::listS> >::~EdgeListGraphConcept()’ 226 | BOOST_concept(EdgeListGraph, (G)) : Graph< G > | ^~~~~~~~~~~~~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/preprocessor/cat.hpp:29:34: note: in definition of macro ‘BOOST_PP_CAT_I’ 29 | # define BOOST_PP_CAT_I(a, b) a ## b | ^ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/concept_def.hpp:23:12: note: in expansion of macro ‘BOOST_PP_CAT’ 23 | struct BOOST_PP_CAT(name,Concept) \ | ^~~~~~~~~~~~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/graph_concepts.hpp:226:1: note: in expansion of macro ‘BOOST_concept’ 226 | BOOST_concept(EdgeListGraph, (G)) : Graph< G > | ^~~~~~~~~~~~~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::constraint::failed() [with Model = boost::ReadWritePropertyMapConcept, boost::property >, boost::no_property, boost::listS>, boost::adjacency_list, boost::property >, boost::no_property, boost::listS>*, double, double&, boost::vertex_distance_t>, long unsigned int>]’: /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/bellman_ford_shortest_paths.hpp:101:5: required from ‘bool boost::bellman_ford_shortest_paths(EdgeListGraph&, Size, WeightMap, PredecessorMap, DistanceMap, BinaryFunction, BinaryPredicate, BellmanFordVisitor) [with EdgeListGraph = adjacency_list, property >, no_property, listS>; Size = long unsigned int; WeightMap = adj_list_edge_property_map >, edge_weight_t>; PredecessorMap = dummy_property_map; DistanceMap = vec_adj_list_vertex_property_map, property >, no_property, listS>, adjacency_list, property >, no_property, listS>*, double, double&, vertex_distance_t>; BinaryFunction = closed_plus; BinaryPredicate = std::less; BellmanFordVisitor = bellman_visitor<>]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/johnson_all_pairs_shortest.hpp:112:36: required from ‘bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, VertexID, Weight, const BinaryPredicate&, const BinaryFunction&, const Infinity&, DistanceZero) [with VertexAndEdgeListGraph = R_adjacency_list; DistanceMatrix = Basic2DMatrix; VertexID = vec_adj_list_vertex_id_map, long unsigned int>; Weight = adj_list_edge_property_map, edge_weight_t>; BinaryPredicate = std::less; BinaryFunction = closed_plus; Infinity = double; DistanceZero = double]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/johnson_all_pairs_shortest.hpp:164:48: required from ‘bool boost::detail::johnson_dispatch(VertexAndEdgeListGraph&, DistanceMatrix&, const boost::bgl_named_params&, Weight, VertexID) [with VertexAndEdgeListGraph = R_adjacency_list; DistanceMatrix = Basic2DMatrix; P = int; T = int; R = boost::no_property; Weight = boost::adj_list_edge_property_map, boost::edge_weight_t>; VertexID = boost::vec_adj_list_vertex_id_map, long unsigned int>]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/johnson_all_pairs_shortest.hpp:192:36: required from ‘bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&) [with VertexAndEdgeListGraph = R_adjacency_list; DistanceMatrix = Basic2DMatrix]’ sna.cpp:105:41: required from here /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:65:52: warning: ‘this’ pointer is null [-Wnonnull] 65 | static void failed() { ((Model*)0)->constraints(); } | ~~~~~~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/property_map/property_map.hpp:205:10: note: in a call to non-static member function ‘void boost::ReadWritePropertyMapConcept::constraints() [with PMap = boost::vec_adj_list_vertex_property_map, boost::property >, boost::no_property, boost::listS>, boost::adjacency_list, boost::property >, boost::no_property, boost::listS>*, double, double&, boost::vertex_distance_t>; Key = long unsigned int]’ 205 | void constraints() { | ^~~~~~~~~~~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::constraint::failed() [with Model = boost::ReadablePropertyMapConcept >, boost::edge_weight_t>, boost::detail::edge_desc_impl >]’: /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/bellman_ford_shortest_paths.hpp:102:5: required from ‘bool boost::bellman_ford_shortest_paths(EdgeListGraph&, Size, WeightMap, PredecessorMap, DistanceMap, BinaryFunction, BinaryPredicate, BellmanFordVisitor) [with EdgeListGraph = adjacency_list, property >, no_property, listS>; Size = long unsigned int; WeightMap = adj_list_edge_property_map >, edge_weight_t>; PredecessorMap = dummy_property_map; DistanceMap = vec_adj_list_vertex_property_map, property >, no_property, listS>, adjacency_list, property >, no_property, listS>*, double, double&, vertex_distance_t>; BinaryFunction = closed_plus; BinaryPredicate = std::less; BellmanFordVisitor = bellman_visitor<>]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/johnson_all_pairs_shortest.hpp:112:36: required from ‘bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, VertexID, Weight, const BinaryPredicate&, const BinaryFunction&, const Infinity&, DistanceZero) [with VertexAndEdgeListGraph = R_adjacency_list; DistanceMatrix = Basic2DMatrix; VertexID = vec_adj_list_vertex_id_map, long unsigned int>; Weight = adj_list_edge_property_map, edge_weight_t>; BinaryPredicate = std::less; BinaryFunction = closed_plus; Infinity = double; DistanceZero = double]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/johnson_all_pairs_shortest.hpp:164:48: required from ‘bool boost::detail::johnson_dispatch(VertexAndEdgeListGraph&, DistanceMatrix&, const boost::bgl_named_params&, Weight, VertexID) [with VertexAndEdgeListGraph = R_adjacency_list; DistanceMatrix = Basic2DMatrix; P = int; T = int; R = boost::no_property; Weight = boost::adj_list_edge_property_map, boost::edge_weight_t>; VertexID = boost::vec_adj_list_vertex_id_map, long unsigned int>]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/johnson_all_pairs_shortest.hpp:192:36: required from ‘bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&) [with VertexAndEdgeListGraph = R_adjacency_list; DistanceMatrix = Basic2DMatrix]’ sna.cpp:105:41: required from here /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:65:52: warning: ‘this’ pointer is null [-Wnonnull] 65 | static void failed() { ((Model*)0)->constraints(); } | ~~~~~~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/property_map/property_map.hpp:147:10: note: in a call to non-static member function ‘void boost::ReadablePropertyMapConcept::constraints() [with PMap = boost::adj_list_edge_property_map >, boost::edge_weight_t>; Key = boost::detail::edge_desc_impl]’ 147 | void constraints() { | ^~~~~~~~~~~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements*, std::vector, std::allocator > > > > >]’: /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:145:5: required from ‘struct boost::Assignable<__gnu_cxx::__normal_iterator*, std::vector, std::allocator > > > >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:502:3: required from ‘struct boost::InputIterator<__gnu_cxx::__normal_iterator*, std::vector, std::allocator > > > >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:540:3: required from ‘struct boost::ForwardIterator<__gnu_cxx::__normal_iterator*, std::vector, std::allocator > > > >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:568:3: required from ‘struct boost::BidirectionalIterator<__gnu_cxx::__normal_iterator*, std::vector, std::allocator > > > >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:597:3: required from ‘struct boost::RandomAccessIterator<__gnu_cxx::__normal_iterator*, std::vector, std::allocator > > > >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:597:3: [ skipping 4 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_*, std::vector, std::allocator > > > >)>’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/property_map/property_map.hpp:354:5: required from ‘boost::iterator_property_map boost::make_iterator_property_map(RAIter, ID, Value) [with RAIter = __gnu_cxx::__normal_iterator*, std::vector, std::allocator > > >; Value = detail::edge_desc_impl; ID = vec_adj_list_vertex_id_map]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/edmonds_karp_max_flow.hpp:209:43: required from ‘static typename boost::detail::edge_capacity_value::type boost::detail::edmonds_karp_dispatch1::apply(Graph&, typename boost::graph_traits::vertex_descriptor, typename boost::graph_traits::vertex_descriptor, const boost::bgl_named_params&, boost::param_not_found) [with Graph = boost::adjacency_list > > > >; P = int; T = boost::buffer_param_t; R = boost::no_property; typename boost::detail::edge_capacity_value::type = double; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/edmonds_karp_max_flow.hpp:228:57: required from ‘typename boost::detail::edge_capacity_value::type boost::edmonds_karp_max_flow(Graph&, typename graph_traits::vertex_descriptor, typename graph_traits::vertex_descriptor, const bgl_named_params&) [with Graph = adjacency_list > > > >; P = int; T = buffer_param_t; R = no_property; typename detail::edge_capacity_value::type = double; typename graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/edmonds_karp_max_flow.hpp:240:33: required from ‘typename boost::property_traits::const_type>::value_type boost::edmonds_karp_max_flow(Graph&, typename graph_traits::vertex_descriptor, typename graph_traits::vertex_descriptor) [with Graph = adjacency_list > > > >; typename property_traits::const_type>::value_type = double; typename property_map::const_type = adj_list_edge_property_map > > >, edge_capacity_t>; typename graph_traits::vertex_descriptor = long unsigned int]’ sna.cpp:204:54: required from here /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::Assignable<__gnu_cxx::__normal_iterator*, std::vector, std::allocator > > > >]’ 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ^ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements*, std::vector, std::allocator > > > > >]’: /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:233:5: required from ‘struct boost::EqualityComparable<__gnu_cxx::__normal_iterator*, std::vector, std::allocator > > > >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:502:3: required from ‘struct boost::InputIterator<__gnu_cxx::__normal_iterator*, std::vector, std::allocator > > > >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:540:3: required from ‘struct boost::ForwardIterator<__gnu_cxx::__normal_iterator*, std::vector, std::allocator > > > >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:568:3: required from ‘struct boost::BidirectionalIterator<__gnu_cxx::__normal_iterator*, std::vector, std::allocator > > > >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:597:3: required from ‘struct boost::RandomAccessIterator<__gnu_cxx::__normal_iterator*, std::vector, std::allocator > > > >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:597:3: [ skipping 4 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_*, std::vector, std::allocator > > > >)>’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/property_map/property_map.hpp:354:5: required from ‘boost::iterator_property_map boost::make_iterator_property_map(RAIter, ID, Value) [with RAIter = __gnu_cxx::__normal_iterator*, std::vector, std::allocator > > >; Value = detail::edge_desc_impl; ID = vec_adj_list_vertex_id_map]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/edmonds_karp_max_flow.hpp:209:43: required from ‘static typename boost::detail::edge_capacity_value::type boost::detail::edmonds_karp_dispatch1::apply(Graph&, typename boost::graph_traits::vertex_descriptor, typename boost::graph_traits::vertex_descriptor, const boost::bgl_named_params&, boost::param_not_found) [with Graph = boost::adjacency_list > > > >; P = int; T = boost::buffer_param_t; R = boost::no_property; typename boost::detail::edge_capacity_value::type = double; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/edmonds_karp_max_flow.hpp:228:57: required from ‘typename boost::detail::edge_capacity_value::type boost::edmonds_karp_max_flow(Graph&, typename graph_traits::vertex_descriptor, typename graph_traits::vertex_descriptor, const bgl_named_params&) [with Graph = adjacency_list > > > >; P = int; T = buffer_param_t; R = no_property; typename detail::edge_capacity_value::type = double; typename graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/edmonds_karp_max_flow.hpp:240:33: required from ‘typename boost::property_traits::const_type>::value_type boost::edmonds_karp_max_flow(Graph&, typename graph_traits::vertex_descriptor, typename graph_traits::vertex_descriptor) [with Graph = adjacency_list > > > >; typename property_traits::const_type>::value_type = double; typename property_map::const_type = adj_list_edge_property_map > > >, edge_capacity_t>; typename graph_traits::vertex_descriptor = long unsigned int]’ sna.cpp:204:54: required from here /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::EqualityComparable<__gnu_cxx::__normal_iterator*, std::vector, std::allocator > > > >]’ 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ^ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements*, std::vector, std::allocator > > > > >]’: /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:512:7: required from ‘struct boost::InputIterator<__gnu_cxx::__normal_iterator*, std::vector, std::allocator > > > >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:540:3: required from ‘struct boost::ForwardIterator<__gnu_cxx::__normal_iterator*, std::vector, std::allocator > > > >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:568:3: required from ‘struct boost::BidirectionalIterator<__gnu_cxx::__normal_iterator*, std::vector, std::allocator > > > >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:597:3: required from ‘struct boost::RandomAccessIterator<__gnu_cxx::__normal_iterator*, std::vector, std::allocator > > > >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:597:3: required from ‘struct boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator*, std::vector, std::allocator > > > >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:32:62: [ skipping 3 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_*, std::vector, std::allocator > > > >)>’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/property_map/property_map.hpp:354:5: required from ‘boost::iterator_property_map boost::make_iterator_property_map(RAIter, ID, Value) [with RAIter = __gnu_cxx::__normal_iterator*, std::vector, std::allocator > > >; Value = detail::edge_desc_impl; ID = vec_adj_list_vertex_id_map]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/edmonds_karp_max_flow.hpp:209:43: required from ‘static typename boost::detail::edge_capacity_value::type boost::detail::edmonds_karp_dispatch1::apply(Graph&, typename boost::graph_traits::vertex_descriptor, typename boost::graph_traits::vertex_descriptor, const boost::bgl_named_params&, boost::param_not_found) [with Graph = boost::adjacency_list > > > >; P = int; T = boost::buffer_param_t; R = boost::no_property; typename boost::detail::edge_capacity_value::type = double; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/edmonds_karp_max_flow.hpp:228:57: required from ‘typename boost::detail::edge_capacity_value::type boost::edmonds_karp_max_flow(Graph&, typename graph_traits::vertex_descriptor, typename graph_traits::vertex_descriptor, const bgl_named_params&) [with Graph = adjacency_list > > > >; P = int; T = buffer_param_t; R = no_property; typename detail::edge_capacity_value::type = double; typename graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/edmonds_karp_max_flow.hpp:240:33: required from ‘typename boost::property_traits::const_type>::value_type boost::edmonds_karp_max_flow(Graph&, typename graph_traits::vertex_descriptor, typename graph_traits::vertex_descriptor) [with Graph = adjacency_list > > > >; typename property_traits::const_type>::value_type = double; typename property_map::const_type = adj_list_edge_property_map > > >, edge_capacity_t>; typename graph_traits::vertex_descriptor = long unsigned int]’ sna.cpp:204:54: required from here /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::InputIterator<__gnu_cxx::__normal_iterator*, std::vector, std::allocator > > > >]’ 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ^ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements*, std::vector, std::allocator > > > > >]’: /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:543:7: required from ‘struct boost::ForwardIterator<__gnu_cxx::__normal_iterator*, std::vector, std::allocator > > > >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:568:3: required from ‘struct boost::BidirectionalIterator<__gnu_cxx::__normal_iterator*, std::vector, std::allocator > > > >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:597:3: required from ‘struct boost::RandomAccessIterator<__gnu_cxx::__normal_iterator*, std::vector, std::allocator > > > >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:597:3: required from ‘struct boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator*, std::vector, std::allocator > > > >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator*, std::vector, std::allocator > > > >]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:42:5: [ skipping 2 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_*, std::vector, std::allocator > > > >)>’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/property_map/property_map.hpp:354:5: required from ‘boost::iterator_property_map boost::make_iterator_property_map(RAIter, ID, Value) [with RAIter = __gnu_cxx::__normal_iterator*, std::vector, std::allocator > > >; Value = detail::edge_desc_impl; ID = vec_adj_list_vertex_id_map]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/edmonds_karp_max_flow.hpp:209:43: required from ‘static typename boost::detail::edge_capacity_value::type boost::detail::edmonds_karp_dispatch1::apply(Graph&, typename boost::graph_traits::vertex_descriptor, typename boost::graph_traits::vertex_descriptor, const boost::bgl_named_params&, boost::param_not_found) [with Graph = boost::adjacency_list > > > >; P = int; T = boost::buffer_param_t; R = boost::no_property; typename boost::detail::edge_capacity_value::type = double; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/edmonds_karp_max_flow.hpp:228:57: required from ‘typename boost::detail::edge_capacity_value::type boost::edmonds_karp_max_flow(Graph&, typename graph_traits::vertex_descriptor, typename graph_traits::vertex_descriptor, const bgl_named_params&) [with Graph = adjacency_list > > > >; P = int; T = buffer_param_t; R = no_property; typename detail::edge_capacity_value::type = double; typename graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/edmonds_karp_max_flow.hpp:240:33: required from ‘typename boost::property_traits::const_type>::value_type boost::edmonds_karp_max_flow(Graph&, typename graph_traits::vertex_descriptor, typename graph_traits::vertex_descriptor) [with Graph = adjacency_list > > > >; typename property_traits::const_type>::value_type = double; typename property_map::const_type = adj_list_edge_property_map > > >, edge_capacity_t>; typename graph_traits::vertex_descriptor = long unsigned int]’ sna.cpp:204:54: required from here /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::ForwardIterator<__gnu_cxx::__normal_iterator*, std::vector, std::allocator > > > >]’ 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ^ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements*, std::vector, std::allocator > > > > >]’: /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:571:7: required from ‘struct boost::BidirectionalIterator<__gnu_cxx::__normal_iterator*, std::vector, std::allocator > > > >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:597:3: required from ‘struct boost::RandomAccessIterator<__gnu_cxx::__normal_iterator*, std::vector, std::allocator > > > >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:597:3: required from ‘struct boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator*, std::vector, std::allocator > > > >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator*, std::vector, std::allocator > > > >]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:42:5: [ skipping 2 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_*, std::vector, std::allocator > > > >)>’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/property_map/property_map.hpp:354:5: required from ‘boost::iterator_property_map boost::make_iterator_property_map(RAIter, ID, Value) [with RAIter = __gnu_cxx::__normal_iterator*, std::vector, std::allocator > > >; Value = detail::edge_desc_impl; ID = vec_adj_list_vertex_id_map]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/edmonds_karp_max_flow.hpp:209:43: required from ‘static typename boost::detail::edge_capacity_value::type boost::detail::edmonds_karp_dispatch1::apply(Graph&, typename boost::graph_traits::vertex_descriptor, typename boost::graph_traits::vertex_descriptor, const boost::bgl_named_params&, boost::param_not_found) [with Graph = boost::adjacency_list > > > >; P = int; T = boost::buffer_param_t; R = boost::no_property; typename boost::detail::edge_capacity_value::type = double; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/edmonds_karp_max_flow.hpp:228:57: required from ‘typename boost::detail::edge_capacity_value::type boost::edmonds_karp_max_flow(Graph&, typename graph_traits::vertex_descriptor, typename graph_traits::vertex_descriptor, const bgl_named_params&) [with Graph = adjacency_list > > > >; P = int; T = buffer_param_t; R = no_property; typename detail::edge_capacity_value::type = double; typename graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/edmonds_karp_max_flow.hpp:240:33: required from ‘typename boost::property_traits::const_type>::value_type boost::edmonds_karp_max_flow(Graph&, typename graph_traits::vertex_descriptor, typename graph_traits::vertex_descriptor) [with Graph = adjacency_list > > > >; typename property_traits::const_type>::value_type = double; typename property_map::const_type = adj_list_edge_property_map > > >, edge_capacity_t>; typename graph_traits::vertex_descriptor = long unsigned int]’ sna.cpp:204:54: required from here /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::BidirectionalIterator<__gnu_cxx::__normal_iterator*, std::vector, std::allocator > > > >]’ 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ^ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements*, std::vector, std::allocator > > > > >]’: /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:253:5: required from ‘struct boost::Comparable<__gnu_cxx::__normal_iterator*, std::vector, std::allocator > > > >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:597:3: required from ‘struct boost::RandomAccessIterator<__gnu_cxx::__normal_iterator*, std::vector, std::allocator > > > >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:597:3: required from ‘struct boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator*, std::vector, std::allocator > > > >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator*, std::vector, std::allocator > > > >]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:42:5: [ skipping 2 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_*, std::vector, std::allocator > > > >)>’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/property_map/property_map.hpp:354:5: required from ‘boost::iterator_property_map boost::make_iterator_property_map(RAIter, ID, Value) [with RAIter = __gnu_cxx::__normal_iterator*, std::vector, std::allocator > > >; Value = detail::edge_desc_impl; ID = vec_adj_list_vertex_id_map]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/edmonds_karp_max_flow.hpp:209:43: required from ‘static typename boost::detail::edge_capacity_value::type boost::detail::edmonds_karp_dispatch1::apply(Graph&, typename boost::graph_traits::vertex_descriptor, typename boost::graph_traits::vertex_descriptor, const boost::bgl_named_params&, boost::param_not_found) [with Graph = boost::adjacency_list > > > >; P = int; T = boost::buffer_param_t; R = boost::no_property; typename boost::detail::edge_capacity_value::type = double; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/edmonds_karp_max_flow.hpp:228:57: required from ‘typename boost::detail::edge_capacity_value::type boost::edmonds_karp_max_flow(Graph&, typename graph_traits::vertex_descriptor, typename graph_traits::vertex_descriptor, const bgl_named_params&) [with Graph = adjacency_list > > > >; P = int; T = buffer_param_t; R = no_property; typename detail::edge_capacity_value::type = double; typename graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/edmonds_karp_max_flow.hpp:240:33: required from ‘typename boost::property_traits::const_type>::value_type boost::edmonds_karp_max_flow(Graph&, typename graph_traits::vertex_descriptor, typename graph_traits::vertex_descriptor) [with Graph = adjacency_list > > > >; typename property_traits::const_type>::value_type = double; typename property_map::const_type = adj_list_edge_property_map > > >, edge_capacity_t>; typename graph_traits::vertex_descriptor = long unsigned int]’ sna.cpp:204:54: required from here /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::Comparable<__gnu_cxx::__normal_iterator*, std::vector, std::allocator > > > >]’ 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ^ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements*, std::vector, std::allocator > > > > >]’: /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:601:7: required from ‘struct boost::RandomAccessIterator<__gnu_cxx::__normal_iterator*, std::vector, std::allocator > > > >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:597:3: required from ‘struct boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator*, std::vector, std::allocator > > > >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator*, std::vector, std::allocator > > > >]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied*, std::vector, std::allocator > > > > >::value’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied*, std::vector, std::allocator > > > > >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_*, std::vector, std::allocator > > > >)>’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/property_map/property_map.hpp:354:5: required from ‘boost::iterator_property_map boost::make_iterator_property_map(RAIter, ID, Value) [with RAIter = __gnu_cxx::__normal_iterator*, std::vector, std::allocator > > >; Value = detail::edge_desc_impl; ID = vec_adj_list_vertex_id_map]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/edmonds_karp_max_flow.hpp:209:43: required from ‘static typename boost::detail::edge_capacity_value::type boost::detail::edmonds_karp_dispatch1::apply(Graph&, typename boost::graph_traits::vertex_descriptor, typename boost::graph_traits::vertex_descriptor, const boost::bgl_named_params&, boost::param_not_found) [with Graph = boost::adjacency_list > > > >; P = int; T = boost::buffer_param_t; R = boost::no_property; typename boost::detail::edge_capacity_value::type = double; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/edmonds_karp_max_flow.hpp:228:57: required from ‘typename boost::detail::edge_capacity_value::type boost::edmonds_karp_max_flow(Graph&, typename graph_traits::vertex_descriptor, typename graph_traits::vertex_descriptor, const bgl_named_params&) [with Graph = adjacency_list > > > >; P = int; T = buffer_param_t; R = no_property; typename detail::edge_capacity_value::type = double; typename graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/edmonds_karp_max_flow.hpp:240:33: required from ‘typename boost::property_traits::const_type>::value_type boost::edmonds_karp_max_flow(Graph&, typename graph_traits::vertex_descriptor, typename graph_traits::vertex_descriptor) [with Graph = adjacency_list > > > >; typename property_traits::const_type>::value_type = double; typename property_map::const_type = adj_list_edge_property_map > > >, edge_capacity_t>; typename graph_traits::vertex_descriptor = long unsigned int]’ sna.cpp:204:54: required from here /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::RandomAccessIterator<__gnu_cxx::__normal_iterator*, std::vector, std::allocator > > > >]’ 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ^ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator*, std::vector, std::allocator > > > >]’: /home/omnipath/local/R/4.4-3.20/BH/include/boost/property_map/property_map.hpp:354:5: required from ‘boost::iterator_property_map boost::make_iterator_property_map(RAIter, ID, Value) [with RAIter = __gnu_cxx::__normal_iterator*, std::vector, std::allocator > > >; Value = detail::edge_desc_impl; ID = vec_adj_list_vertex_id_map]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/edmonds_karp_max_flow.hpp:209:43: required from ‘static typename boost::detail::edge_capacity_value::type boost::detail::edmonds_karp_dispatch1::apply(Graph&, typename boost::graph_traits::vertex_descriptor, typename boost::graph_traits::vertex_descriptor, const boost::bgl_named_params&, boost::param_not_found) [with Graph = boost::adjacency_list > > > >; P = int; T = boost::buffer_param_t; R = boost::no_property; typename boost::detail::edge_capacity_value::type = double; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/edmonds_karp_max_flow.hpp:228:57: required from ‘typename boost::detail::edge_capacity_value::type boost::edmonds_karp_max_flow(Graph&, typename graph_traits::vertex_descriptor, typename graph_traits::vertex_descriptor, const bgl_named_params&) [with Graph = adjacency_list > > > >; P = int; T = buffer_param_t; R = no_property; typename detail::edge_capacity_value::type = double; typename graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/edmonds_karp_max_flow.hpp:240:33: required from ‘typename boost::property_traits::const_type>::value_type boost::edmonds_karp_max_flow(Graph&, typename graph_traits::vertex_descriptor, typename graph_traits::vertex_descriptor) [with Graph = adjacency_list > > > >; typename property_traits::const_type>::value_type = double; typename property_map::const_type = adj_list_edge_property_map > > >, edge_capacity_t>; typename graph_traits::vertex_descriptor = long unsigned int]’ sna.cpp:204:54: required from here /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:597:17: note: in a call to non-static member function ‘boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator*, std::vector, std::allocator > > > >::~RandomAccessIteratorConcept()’ 597 | BOOST_concept(RandomAccessIterator,(TT)) | ^~~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/preprocessor/cat.hpp:29:34: note: in definition of macro ‘BOOST_PP_CAT_I’ 29 | # define BOOST_PP_CAT_I(a, b) a ## b | ^ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/concept_def.hpp:23:12: note: in expansion of macro ‘BOOST_PP_CAT’ 23 | struct BOOST_PP_CAT(name,Concept) \ | ^~~~~~~~~~~~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:597:3: note: in expansion of macro ‘BOOST_concept’ 597 | BOOST_concept(RandomAccessIterator,(TT)) | ^~~~~~~~~~~~~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::concepts::Graph, boost::property >, boost::no_property, boost::listS> >]’: /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements, boost::property >, boost::no_property, boost::listS> > >]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/graph_concepts.hpp:66:5: required from ‘struct boost::concepts::Graph, boost::property >, boost::no_property, boost::listS> >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/graph_concepts.hpp:226:1: required from ‘struct boost::concepts::EdgeListGraph, boost::property >, boost::no_property, boost::listS> >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/graph_concepts.hpp:226:1: required from ‘struct boost::concepts::EdgeListGraphConcept, boost::property >, boost::no_property, boost::listS> >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::concepts::EdgeListGraphConcept, boost::property >, boost::no_property, boost::listS> >]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:42:5: [ skipping 2 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_, boost::property >, boost::no_property, boost::listS> >)>’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/bellman_ford_shortest_paths.hpp:97:5: required from ‘bool boost::bellman_ford_shortest_paths(EdgeListGraph&, Size, WeightMap, PredecessorMap, DistanceMap, BinaryFunction, BinaryPredicate, BellmanFordVisitor) [with EdgeListGraph = adjacency_list, property >, no_property, listS>; Size = long unsigned int; WeightMap = adj_list_edge_property_map >, edge_weight_t>; PredecessorMap = dummy_property_map; DistanceMap = vec_adj_list_vertex_property_map, property >, no_property, listS>, adjacency_list, property >, no_property, listS>*, double, double&, vertex_distance_t>; BinaryFunction = closed_plus; BinaryPredicate = std::less; BellmanFordVisitor = bellman_visitor<>]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/johnson_all_pairs_shortest.hpp:112:36: required from ‘bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, VertexID, Weight, const BinaryPredicate&, const BinaryFunction&, const Infinity&, DistanceZero) [with VertexAndEdgeListGraph = R_adjacency_list; DistanceMatrix = Basic2DMatrix; VertexID = vec_adj_list_vertex_id_map, long unsigned int>; Weight = adj_list_edge_property_map, edge_weight_t>; BinaryPredicate = std::less; BinaryFunction = closed_plus; Infinity = double; DistanceZero = double]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/johnson_all_pairs_shortest.hpp:164:48: required from ‘bool boost::detail::johnson_dispatch(VertexAndEdgeListGraph&, DistanceMatrix&, const boost::bgl_named_params&, Weight, VertexID) [with VertexAndEdgeListGraph = R_adjacency_list; DistanceMatrix = Basic2DMatrix; P = int; T = int; R = boost::no_property; Weight = boost::adj_list_edge_property_map, boost::edge_weight_t>; VertexID = boost::vec_adj_list_vertex_id_map, long unsigned int>]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/johnson_all_pairs_shortest.hpp:192:36: required from ‘bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&) [with VertexAndEdgeListGraph = R_adjacency_list; DistanceMatrix = Basic2DMatrix]’ sna.cpp:105:41: required from here /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::concepts::Graph::~Graph() [with G = boost::adjacency_list, boost::property >, boost::no_property, boost::listS>]’ 37 | ~model() | ^ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/graph_concepts.hpp:66:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 66 | BOOST_CONCEPT_USAGE(Graph) | ^~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::concepts::EdgeListGraph, boost::property >, boost::no_property, boost::listS> >]’: /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements, boost::property >, boost::no_property, boost::listS> > >]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/graph_concepts.hpp:233:5: required from ‘struct boost::concepts::EdgeListGraph, boost::property >, boost::no_property, boost::listS> >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/graph_concepts.hpp:226:1: required from ‘struct boost::concepts::EdgeListGraphConcept, boost::property >, boost::no_property, boost::listS> >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::concepts::EdgeListGraphConcept, boost::property >, boost::no_property, boost::listS> >]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:42:5: [ skipping 2 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_, boost::property >, boost::no_property, boost::listS> >)>’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/bellman_ford_shortest_paths.hpp:97:5: required from ‘bool boost::bellman_ford_shortest_paths(EdgeListGraph&, Size, WeightMap, PredecessorMap, DistanceMap, BinaryFunction, BinaryPredicate, BellmanFordVisitor) [with EdgeListGraph = adjacency_list, property >, no_property, listS>; Size = long unsigned int; WeightMap = adj_list_edge_property_map >, edge_weight_t>; PredecessorMap = dummy_property_map; DistanceMap = vec_adj_list_vertex_property_map, property >, no_property, listS>, adjacency_list, property >, no_property, listS>*, double, double&, vertex_distance_t>; BinaryFunction = closed_plus; BinaryPredicate = std::less; BellmanFordVisitor = bellman_visitor<>]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/johnson_all_pairs_shortest.hpp:112:36: required from ‘bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, VertexID, Weight, const BinaryPredicate&, const BinaryFunction&, const Infinity&, DistanceZero) [with VertexAndEdgeListGraph = R_adjacency_list; DistanceMatrix = Basic2DMatrix; VertexID = vec_adj_list_vertex_id_map, long unsigned int>; Weight = adj_list_edge_property_map, edge_weight_t>; BinaryPredicate = std::less; BinaryFunction = closed_plus; Infinity = double; DistanceZero = double]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/johnson_all_pairs_shortest.hpp:164:48: required from ‘bool boost::detail::johnson_dispatch(VertexAndEdgeListGraph&, DistanceMatrix&, const boost::bgl_named_params&, Weight, VertexID) [with VertexAndEdgeListGraph = R_adjacency_list; DistanceMatrix = Basic2DMatrix; P = int; T = int; R = boost::no_property; Weight = boost::adj_list_edge_property_map, boost::edge_weight_t>; VertexID = boost::vec_adj_list_vertex_id_map, long unsigned int>]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/johnson_all_pairs_shortest.hpp:192:36: required from ‘bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&) [with VertexAndEdgeListGraph = R_adjacency_list; DistanceMatrix = Basic2DMatrix]’ sna.cpp:105:41: required from here /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::concepts::EdgeListGraph::~EdgeListGraph() [with G = boost::adjacency_list, boost::property >, boost::no_property, boost::listS>]’ 37 | ~model() | ^ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/graph_concepts.hpp:233:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 233 | BOOST_CONCEPT_USAGE(EdgeListGraph) | ^~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::constraint::failed() [with Model = boost::ReadablePropertyMapConcept, boost::property >, boost::no_property, boost::listS>, boost::adjacency_list, boost::property >, boost::no_property, boost::listS>*, double, double&, boost::vertex_distance_t>, long unsigned int>]’: /home/omnipath/local/R/4.4-3.20/BH/include/boost/property_map/property_map.hpp:206:7: required from ‘void boost::ReadWritePropertyMapConcept::constraints() [with PMap = boost::vec_adj_list_vertex_property_map, boost::property >, boost::no_property, boost::listS>, boost::adjacency_list, boost::property >, boost::no_property, boost::listS>*, double, double&, boost::vertex_distance_t>; Key = long unsigned int]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::ReadWritePropertyMapConcept, boost::property >, boost::no_property, boost::listS>, boost::adjacency_list, boost::property >, boost::no_property, boost::listS>*, double, double&, boost::vertex_distance_t>, long unsigned int>]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied, boost::property >, boost::no_property, boost::listS>, boost::adjacency_list, boost::property >, boost::no_property, boost::listS>*, double, double&, boost::vertex_distance_t>, long unsigned int> >::value’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied, boost::property >, boost::no_property, boost::listS>, boost::adjacency_list, boost::property >, boost::no_property, boost::listS>*, double, double&, boost::vertex_distance_t>, long unsigned int> >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_, boost::property >, boost::no_property, boost::listS>, boost::adjacency_list, boost::property >, boost::no_property, boost::listS>*, double, double&, boost::vertex_distance_t>, long unsigned int>)>’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/bellman_ford_shortest_paths.hpp:101:5: required from ‘bool boost::bellman_ford_shortest_paths(EdgeListGraph&, Size, WeightMap, PredecessorMap, DistanceMap, BinaryFunction, BinaryPredicate, BellmanFordVisitor) [with EdgeListGraph = adjacency_list, property >, no_property, listS>; Size = long unsigned int; WeightMap = adj_list_edge_property_map >, edge_weight_t>; PredecessorMap = dummy_property_map; DistanceMap = vec_adj_list_vertex_property_map, property >, no_property, listS>, adjacency_list, property >, no_property, listS>*, double, double&, vertex_distance_t>; BinaryFunction = closed_plus; BinaryPredicate = std::less; BellmanFordVisitor = bellman_visitor<>]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/johnson_all_pairs_shortest.hpp:112:36: required from ‘bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, VertexID, Weight, const BinaryPredicate&, const BinaryFunction&, const Infinity&, DistanceZero) [with VertexAndEdgeListGraph = R_adjacency_list; DistanceMatrix = Basic2DMatrix; VertexID = vec_adj_list_vertex_id_map, long unsigned int>; Weight = adj_list_edge_property_map, edge_weight_t>; BinaryPredicate = std::less; BinaryFunction = closed_plus; Infinity = double; DistanceZero = double]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/johnson_all_pairs_shortest.hpp:164:48: required from ‘bool boost::detail::johnson_dispatch(VertexAndEdgeListGraph&, DistanceMatrix&, const boost::bgl_named_params&, Weight, VertexID) [with VertexAndEdgeListGraph = R_adjacency_list; DistanceMatrix = Basic2DMatrix; P = int; T = int; R = boost::no_property; Weight = boost::adj_list_edge_property_map, boost::edge_weight_t>; VertexID = boost::vec_adj_list_vertex_id_map, long unsigned int>]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/johnson_all_pairs_shortest.hpp:192:36: required from ‘bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&) [with VertexAndEdgeListGraph = R_adjacency_list; DistanceMatrix = Basic2DMatrix]’ sna.cpp:105:41: required from here /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:65:52: warning: ‘this’ pointer is null [-Wnonnull] 65 | static void failed() { ((Model*)0)->constraints(); } | ~~~~~~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/property_map/property_map.hpp:147:10: note: in a call to non-static member function ‘void boost::ReadablePropertyMapConcept::constraints() [with PMap = boost::vec_adj_list_vertex_property_map, boost::property >, boost::no_property, boost::listS>, boost::adjacency_list, boost::property >, boost::no_property, boost::listS>*, double, double&, boost::vertex_distance_t>; Key = long unsigned int]’ 147 | void constraints() { | ^~~~~~~~~~~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::constraint::failed() [with Model = boost::WritablePropertyMapConcept, boost::property >, boost::no_property, boost::listS>, boost::adjacency_list, boost::property >, boost::no_property, boost::listS>*, double, double&, boost::vertex_distance_t>, long unsigned int>]’: /home/omnipath/local/R/4.4-3.20/BH/include/boost/property_map/property_map.hpp:207:7: required from ‘void boost::ReadWritePropertyMapConcept::constraints() [with PMap = boost::vec_adj_list_vertex_property_map, boost::property >, boost::no_property, boost::listS>, boost::adjacency_list, boost::property >, boost::no_property, boost::listS>*, double, double&, boost::vertex_distance_t>; Key = long unsigned int]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::ReadWritePropertyMapConcept, boost::property >, boost::no_property, boost::listS>, boost::adjacency_list, boost::property >, boost::no_property, boost::listS>*, double, double&, boost::vertex_distance_t>, long unsigned int>]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied, boost::property >, boost::no_property, boost::listS>, boost::adjacency_list, boost::property >, boost::no_property, boost::listS>*, double, double&, boost::vertex_distance_t>, long unsigned int> >::value’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied, boost::property >, boost::no_property, boost::listS>, boost::adjacency_list, boost::property >, boost::no_property, boost::listS>*, double, double&, boost::vertex_distance_t>, long unsigned int> >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_, boost::property >, boost::no_property, boost::listS>, boost::adjacency_list, boost::property >, boost::no_property, boost::listS>*, double, double&, boost::vertex_distance_t>, long unsigned int>)>’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/bellman_ford_shortest_paths.hpp:101:5: required from ‘bool boost::bellman_ford_shortest_paths(EdgeListGraph&, Size, WeightMap, PredecessorMap, DistanceMap, BinaryFunction, BinaryPredicate, BellmanFordVisitor) [with EdgeListGraph = adjacency_list, property >, no_property, listS>; Size = long unsigned int; WeightMap = adj_list_edge_property_map >, edge_weight_t>; PredecessorMap = dummy_property_map; DistanceMap = vec_adj_list_vertex_property_map, property >, no_property, listS>, adjacency_list, property >, no_property, listS>*, double, double&, vertex_distance_t>; BinaryFunction = closed_plus; BinaryPredicate = std::less; BellmanFordVisitor = bellman_visitor<>]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/johnson_all_pairs_shortest.hpp:112:36: required from ‘bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, VertexID, Weight, const BinaryPredicate&, const BinaryFunction&, const Infinity&, DistanceZero) [with VertexAndEdgeListGraph = R_adjacency_list; DistanceMatrix = Basic2DMatrix; VertexID = vec_adj_list_vertex_id_map, long unsigned int>; Weight = adj_list_edge_property_map, edge_weight_t>; BinaryPredicate = std::less; BinaryFunction = closed_plus; Infinity = double; DistanceZero = double]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/johnson_all_pairs_shortest.hpp:164:48: required from ‘bool boost::detail::johnson_dispatch(VertexAndEdgeListGraph&, DistanceMatrix&, const boost::bgl_named_params&, Weight, VertexID) [with VertexAndEdgeListGraph = R_adjacency_list; DistanceMatrix = Basic2DMatrix; P = int; T = int; R = boost::no_property; Weight = boost::adj_list_edge_property_map, boost::edge_weight_t>; VertexID = boost::vec_adj_list_vertex_id_map, long unsigned int>]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/johnson_all_pairs_shortest.hpp:192:36: required from ‘bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&) [with VertexAndEdgeListGraph = R_adjacency_list; DistanceMatrix = Basic2DMatrix]’ sna.cpp:105:41: required from here /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:65:52: warning: ‘this’ pointer is null [-Wnonnull] 65 | static void failed() { ((Model*)0)->constraints(); } | ~~~~~~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/property_map/property_map.hpp:179:10: note: in a call to non-static member function ‘void boost::WritablePropertyMapConcept::constraints() [with PMap = boost::vec_adj_list_vertex_property_map, boost::property >, boost::no_property, boost::listS>, boost::adjacency_list, boost::property >, boost::no_property, boost::listS>*, double, double&, boost::vertex_distance_t>; Key = long unsigned int]’ 179 | void constraints() { | ^~~~~~~~~~~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements >]’: /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:208:5: required from ‘struct boost::Convertible’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:206:3: required from ‘struct boost::ConvertibleConcept’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::ConvertibleConcept]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied >::value’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:72:8: [ skipping 5 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_, boost::property >, boost::no_property, boost::listS>, boost::adjacency_list, boost::property >, boost::no_property, boost::listS>*, double, double&, boost::vertex_distance_t>, long unsigned int>)>’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/bellman_ford_shortest_paths.hpp:101:5: required from ‘bool boost::bellman_ford_shortest_paths(EdgeListGraph&, Size, WeightMap, PredecessorMap, DistanceMap, BinaryFunction, BinaryPredicate, BellmanFordVisitor) [with EdgeListGraph = adjacency_list, property >, no_property, listS>; Size = long unsigned int; WeightMap = adj_list_edge_property_map >, edge_weight_t>; PredecessorMap = dummy_property_map; DistanceMap = vec_adj_list_vertex_property_map, property >, no_property, listS>, adjacency_list, property >, no_property, listS>*, double, double&, vertex_distance_t>; BinaryFunction = closed_plus; BinaryPredicate = std::less; BellmanFordVisitor = bellman_visitor<>]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/johnson_all_pairs_shortest.hpp:112:36: required from ‘bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, VertexID, Weight, const BinaryPredicate&, const BinaryFunction&, const Infinity&, DistanceZero) [with VertexAndEdgeListGraph = R_adjacency_list; DistanceMatrix = Basic2DMatrix; VertexID = vec_adj_list_vertex_id_map, long unsigned int>; Weight = adj_list_edge_property_map, edge_weight_t>; BinaryPredicate = std::less; BinaryFunction = closed_plus; Infinity = double; DistanceZero = double]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/johnson_all_pairs_shortest.hpp:164:48: required from ‘bool boost::detail::johnson_dispatch(VertexAndEdgeListGraph&, DistanceMatrix&, const boost::bgl_named_params&, Weight, VertexID) [with VertexAndEdgeListGraph = R_adjacency_list; DistanceMatrix = Basic2DMatrix; P = int; T = int; R = boost::no_property; Weight = boost::adj_list_edge_property_map, boost::edge_weight_t>; VertexID = boost::vec_adj_list_vertex_id_map, long unsigned int>]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/johnson_all_pairs_shortest.hpp:192:36: required from ‘bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&) [with VertexAndEdgeListGraph = R_adjacency_list; DistanceMatrix = Basic2DMatrix]’ sna.cpp:105:41: required from here /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::Convertible]’ 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ^ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::ConvertibleConcept]’: /home/omnipath/local/R/4.4-3.20/BH/include/boost/property_map/property_map.hpp:208:7: required from ‘void boost::ReadWritePropertyMapConcept::constraints() [with PMap = boost::vec_adj_list_vertex_property_map, boost::property >, boost::no_property, boost::listS>, boost::adjacency_list, boost::property >, boost::no_property, boost::listS>*, double, double&, boost::vertex_distance_t>; Key = long unsigned int]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::ReadWritePropertyMapConcept, boost::property >, boost::no_property, boost::listS>, boost::adjacency_list, boost::property >, boost::no_property, boost::listS>*, double, double&, boost::vertex_distance_t>, long unsigned int>]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied, boost::property >, boost::no_property, boost::listS>, boost::adjacency_list, boost::property >, boost::no_property, boost::listS>*, double, double&, boost::vertex_distance_t>, long unsigned int> >::value’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied, boost::property >, boost::no_property, boost::listS>, boost::adjacency_list, boost::property >, boost::no_property, boost::listS>*, double, double&, boost::vertex_distance_t>, long unsigned int> >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_, boost::property >, boost::no_property, boost::listS>, boost::adjacency_list, boost::property >, boost::no_property, boost::listS>*, double, double&, boost::vertex_distance_t>, long unsigned int>)>’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/bellman_ford_shortest_paths.hpp:101:5: required from ‘bool boost::bellman_ford_shortest_paths(EdgeListGraph&, Size, WeightMap, PredecessorMap, DistanceMap, BinaryFunction, BinaryPredicate, BellmanFordVisitor) [with EdgeListGraph = adjacency_list, property >, no_property, listS>; Size = long unsigned int; WeightMap = adj_list_edge_property_map >, edge_weight_t>; PredecessorMap = dummy_property_map; DistanceMap = vec_adj_list_vertex_property_map, property >, no_property, listS>, adjacency_list, property >, no_property, listS>*, double, double&, vertex_distance_t>; BinaryFunction = closed_plus; BinaryPredicate = std::less; BellmanFordVisitor = bellman_visitor<>]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/johnson_all_pairs_shortest.hpp:112:36: required from ‘bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, VertexID, Weight, const BinaryPredicate&, const BinaryFunction&, const Infinity&, DistanceZero) [with VertexAndEdgeListGraph = R_adjacency_list; DistanceMatrix = Basic2DMatrix; VertexID = vec_adj_list_vertex_id_map, long unsigned int>; Weight = adj_list_edge_property_map, edge_weight_t>; BinaryPredicate = std::less; BinaryFunction = closed_plus; Infinity = double; DistanceZero = double]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/johnson_all_pairs_shortest.hpp:164:48: required from ‘bool boost::detail::johnson_dispatch(VertexAndEdgeListGraph&, DistanceMatrix&, const boost::bgl_named_params&, Weight, VertexID) [with VertexAndEdgeListGraph = R_adjacency_list; DistanceMatrix = Basic2DMatrix; P = int; T = int; R = boost::no_property; Weight = boost::adj_list_edge_property_map, boost::edge_weight_t>; VertexID = boost::vec_adj_list_vertex_id_map, long unsigned int>]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/johnson_all_pairs_shortest.hpp:192:36: required from ‘bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&) [with VertexAndEdgeListGraph = R_adjacency_list; DistanceMatrix = Basic2DMatrix]’ sna.cpp:105:41: required from here /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:206:17: note: in a call to non-static member function ‘boost::ConvertibleConcept::~ConvertibleConcept()’ 206 | BOOST_concept(Convertible,(X)(Y)) | ^~~~~~~~~~~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/preprocessor/cat.hpp:29:34: note: in definition of macro ‘BOOST_PP_CAT_I’ 29 | # define BOOST_PP_CAT_I(a, b) a ## b | ^ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/concept_def.hpp:23:12: note: in expansion of macro ‘BOOST_PP_CAT’ 23 | struct BOOST_PP_CAT(name,Concept) \ | ^~~~~~~~~~~~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:206:3: note: in expansion of macro ‘BOOST_concept’ 206 | BOOST_concept(Convertible,(X)(Y)) | ^~~~~~~~~~~~~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements >]’: /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:208:5: required from ‘struct boost::Convertible’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:206:3: required from ‘struct boost::ConvertibleConcept’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::ConvertibleConcept]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied >::value’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:72:8: [ skipping 5 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_ >, boost::edge_weight_t>, boost::detail::edge_desc_impl >)>’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/bellman_ford_shortest_paths.hpp:102:5: required from ‘bool boost::bellman_ford_shortest_paths(EdgeListGraph&, Size, WeightMap, PredecessorMap, DistanceMap, BinaryFunction, BinaryPredicate, BellmanFordVisitor) [with EdgeListGraph = adjacency_list, property >, no_property, listS>; Size = long unsigned int; WeightMap = adj_list_edge_property_map >, edge_weight_t>; PredecessorMap = dummy_property_map; DistanceMap = vec_adj_list_vertex_property_map, property >, no_property, listS>, adjacency_list, property >, no_property, listS>*, double, double&, vertex_distance_t>; BinaryFunction = closed_plus; BinaryPredicate = std::less; BellmanFordVisitor = bellman_visitor<>]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/johnson_all_pairs_shortest.hpp:112:36: required from ‘bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, VertexID, Weight, const BinaryPredicate&, const BinaryFunction&, const Infinity&, DistanceZero) [with VertexAndEdgeListGraph = R_adjacency_list; DistanceMatrix = Basic2DMatrix; VertexID = vec_adj_list_vertex_id_map, long unsigned int>; Weight = adj_list_edge_property_map, edge_weight_t>; BinaryPredicate = std::less; BinaryFunction = closed_plus; Infinity = double; DistanceZero = double]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/johnson_all_pairs_shortest.hpp:164:48: required from ‘bool boost::detail::johnson_dispatch(VertexAndEdgeListGraph&, DistanceMatrix&, const boost::bgl_named_params&, Weight, VertexID) [with VertexAndEdgeListGraph = R_adjacency_list; DistanceMatrix = Basic2DMatrix; P = int; T = int; R = boost::no_property; Weight = boost::adj_list_edge_property_map, boost::edge_weight_t>; VertexID = boost::vec_adj_list_vertex_id_map, long unsigned int>]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/johnson_all_pairs_shortest.hpp:192:36: required from ‘bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&) [with VertexAndEdgeListGraph = R_adjacency_list; DistanceMatrix = Basic2DMatrix]’ sna.cpp:105:41: required from here /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::Convertible]’ 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ^ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::ConvertibleConcept]’: /home/omnipath/local/R/4.4-3.20/BH/include/boost/property_map/property_map.hpp:148:7: required from ‘void boost::ReadablePropertyMapConcept::constraints() [with PMap = boost::adj_list_edge_property_map >, boost::edge_weight_t>; Key = boost::detail::edge_desc_impl]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::ReadablePropertyMapConcept >, boost::edge_weight_t>, boost::detail::edge_desc_impl >]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied >, boost::edge_weight_t>, boost::detail::edge_desc_impl > >::value’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied >, boost::edge_weight_t>, boost::detail::edge_desc_impl > >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_ >, boost::edge_weight_t>, boost::detail::edge_desc_impl >)>’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/bellman_ford_shortest_paths.hpp:102:5: required from ‘bool boost::bellman_ford_shortest_paths(EdgeListGraph&, Size, WeightMap, PredecessorMap, DistanceMap, BinaryFunction, BinaryPredicate, BellmanFordVisitor) [with EdgeListGraph = adjacency_list, property >, no_property, listS>; Size = long unsigned int; WeightMap = adj_list_edge_property_map >, edge_weight_t>; PredecessorMap = dummy_property_map; DistanceMap = vec_adj_list_vertex_property_map, property >, no_property, listS>, adjacency_list, property >, no_property, listS>*, double, double&, vertex_distance_t>; BinaryFunction = closed_plus; BinaryPredicate = std::less; BellmanFordVisitor = bellman_visitor<>]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/johnson_all_pairs_shortest.hpp:112:36: required from ‘bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, VertexID, Weight, const BinaryPredicate&, const BinaryFunction&, const Infinity&, DistanceZero) [with VertexAndEdgeListGraph = R_adjacency_list; DistanceMatrix = Basic2DMatrix; VertexID = vec_adj_list_vertex_id_map, long unsigned int>; Weight = adj_list_edge_property_map, edge_weight_t>; BinaryPredicate = std::less; BinaryFunction = closed_plus; Infinity = double; DistanceZero = double]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/johnson_all_pairs_shortest.hpp:164:48: required from ‘bool boost::detail::johnson_dispatch(VertexAndEdgeListGraph&, DistanceMatrix&, const boost::bgl_named_params&, Weight, VertexID) [with VertexAndEdgeListGraph = R_adjacency_list; DistanceMatrix = Basic2DMatrix; P = int; T = int; R = boost::no_property; Weight = boost::adj_list_edge_property_map, boost::edge_weight_t>; VertexID = boost::vec_adj_list_vertex_id_map, long unsigned int>]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/johnson_all_pairs_shortest.hpp:192:36: required from ‘bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&) [with VertexAndEdgeListGraph = R_adjacency_list; DistanceMatrix = Basic2DMatrix]’ sna.cpp:105:41: required from here /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:206:17: note: in a call to non-static member function ‘boost::ConvertibleConcept::~ConvertibleConcept()’ 206 | BOOST_concept(Convertible,(X)(Y)) | ^~~~~~~~~~~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/preprocessor/cat.hpp:29:34: note: in definition of macro ‘BOOST_PP_CAT_I’ 29 | # define BOOST_PP_CAT_I(a, b) a ## b | ^ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/concept_def.hpp:23:12: note: in expansion of macro ‘BOOST_PP_CAT’ 23 | struct BOOST_PP_CAT(name,Concept) \ | ^~~~~~~~~~~~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:206:3: note: in expansion of macro ‘BOOST_concept’ 206 | BOOST_concept(Convertible,(X)(Y)) | ^~~~~~~~~~~~~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::Assignable<__gnu_cxx::__normal_iterator*, std::vector, std::allocator > > > >]’: /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements*, std::vector, std::allocator > > > > >]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:145:5: required from ‘struct boost::Assignable<__gnu_cxx::__normal_iterator*, std::vector, std::allocator > > > >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:502:3: required from ‘struct boost::InputIterator<__gnu_cxx::__normal_iterator*, std::vector, std::allocator > > > >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:540:3: required from ‘struct boost::ForwardIterator<__gnu_cxx::__normal_iterator*, std::vector, std::allocator > > > >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:568:3: required from ‘struct boost::BidirectionalIterator<__gnu_cxx::__normal_iterator*, std::vector, std::allocator > > > >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:597:3: [ skipping 5 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_*, std::vector, std::allocator > > > >)>’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/property_map/property_map.hpp:354:5: required from ‘boost::iterator_property_map boost::make_iterator_property_map(RAIter, ID, Value) [with RAIter = __gnu_cxx::__normal_iterator*, std::vector, std::allocator > > >; Value = detail::edge_desc_impl; ID = vec_adj_list_vertex_id_map]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/edmonds_karp_max_flow.hpp:209:43: required from ‘static typename boost::detail::edge_capacity_value::type boost::detail::edmonds_karp_dispatch1::apply(Graph&, typename boost::graph_traits::vertex_descriptor, typename boost::graph_traits::vertex_descriptor, const boost::bgl_named_params&, boost::param_not_found) [with Graph = boost::adjacency_list > > > >; P = int; T = boost::buffer_param_t; R = boost::no_property; typename boost::detail::edge_capacity_value::type = double; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/edmonds_karp_max_flow.hpp:228:57: required from ‘typename boost::detail::edge_capacity_value::type boost::edmonds_karp_max_flow(Graph&, typename graph_traits::vertex_descriptor, typename graph_traits::vertex_descriptor, const bgl_named_params&) [with Graph = adjacency_list > > > >; P = int; T = buffer_param_t; R = no_property; typename detail::edge_capacity_value::type = double; typename graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/edmonds_karp_max_flow.hpp:240:33: required from ‘typename boost::property_traits::const_type>::value_type boost::edmonds_karp_max_flow(Graph&, typename graph_traits::vertex_descriptor, typename graph_traits::vertex_descriptor) [with Graph = adjacency_list > > > >; typename property_traits::const_type>::value_type = double; typename property_map::const_type = adj_list_edge_property_map > > >, edge_capacity_t>; typename graph_traits::vertex_descriptor = long unsigned int]’ sna.cpp:204:54: required from here /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::Assignable::~Assignable() [with TT = __gnu_cxx::__normal_iterator*, std::vector, std::allocator > > >]’ 37 | ~model() | ^ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:145:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 145 | BOOST_CONCEPT_USAGE(Assignable) { | ^~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::EqualityComparable<__gnu_cxx::__normal_iterator*, std::vector, std::allocator > > > >]’: /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements*, std::vector, std::allocator > > > > >]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:233:5: required from ‘struct boost::EqualityComparable<__gnu_cxx::__normal_iterator*, std::vector, std::allocator > > > >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:502:3: required from ‘struct boost::InputIterator<__gnu_cxx::__normal_iterator*, std::vector, std::allocator > > > >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:540:3: required from ‘struct boost::ForwardIterator<__gnu_cxx::__normal_iterator*, std::vector, std::allocator > > > >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:568:3: required from ‘struct boost::BidirectionalIterator<__gnu_cxx::__normal_iterator*, std::vector, std::allocator > > > >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:597:3: [ skipping 5 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_*, std::vector, std::allocator > > > >)>’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/property_map/property_map.hpp:354:5: required from ‘boost::iterator_property_map boost::make_iterator_property_map(RAIter, ID, Value) [with RAIter = __gnu_cxx::__normal_iterator*, std::vector, std::allocator > > >; Value = detail::edge_desc_impl; ID = vec_adj_list_vertex_id_map]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/edmonds_karp_max_flow.hpp:209:43: required from ‘static typename boost::detail::edge_capacity_value::type boost::detail::edmonds_karp_dispatch1::apply(Graph&, typename boost::graph_traits::vertex_descriptor, typename boost::graph_traits::vertex_descriptor, const boost::bgl_named_params&, boost::param_not_found) [with Graph = boost::adjacency_list > > > >; P = int; T = boost::buffer_param_t; R = boost::no_property; typename boost::detail::edge_capacity_value::type = double; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/edmonds_karp_max_flow.hpp:228:57: required from ‘typename boost::detail::edge_capacity_value::type boost::edmonds_karp_max_flow(Graph&, typename graph_traits::vertex_descriptor, typename graph_traits::vertex_descriptor, const bgl_named_params&) [with Graph = adjacency_list > > > >; P = int; T = buffer_param_t; R = no_property; typename detail::edge_capacity_value::type = double; typename graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/edmonds_karp_max_flow.hpp:240:33: required from ‘typename boost::property_traits::const_type>::value_type boost::edmonds_karp_max_flow(Graph&, typename graph_traits::vertex_descriptor, typename graph_traits::vertex_descriptor) [with Graph = adjacency_list > > > >; typename property_traits::const_type>::value_type = double; typename property_map::const_type = adj_list_edge_property_map > > >, edge_capacity_t>; typename graph_traits::vertex_descriptor = long unsigned int]’ sna.cpp:204:54: required from here /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::EqualityComparable::~EqualityComparable() [with TT = __gnu_cxx::__normal_iterator*, std::vector, std::allocator > > >]’ 37 | ~model() | ^ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:233:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 233 | BOOST_CONCEPT_USAGE(EqualityComparable) { | ^~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::InputIterator<__gnu_cxx::__normal_iterator*, std::vector, std::allocator > > > >]’: /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements*, std::vector, std::allocator > > > > >]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:512:7: required from ‘struct boost::InputIterator<__gnu_cxx::__normal_iterator*, std::vector, std::allocator > > > >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:540:3: required from ‘struct boost::ForwardIterator<__gnu_cxx::__normal_iterator*, std::vector, std::allocator > > > >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:568:3: required from ‘struct boost::BidirectionalIterator<__gnu_cxx::__normal_iterator*, std::vector, std::allocator > > > >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:597:3: required from ‘struct boost::RandomAccessIterator<__gnu_cxx::__normal_iterator*, std::vector, std::allocator > > > >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:597:3: [ skipping 4 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_*, std::vector, std::allocator > > > >)>’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/property_map/property_map.hpp:354:5: required from ‘boost::iterator_property_map boost::make_iterator_property_map(RAIter, ID, Value) [with RAIter = __gnu_cxx::__normal_iterator*, std::vector, std::allocator > > >; Value = detail::edge_desc_impl; ID = vec_adj_list_vertex_id_map]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/edmonds_karp_max_flow.hpp:209:43: required from ‘static typename boost::detail::edge_capacity_value::type boost::detail::edmonds_karp_dispatch1::apply(Graph&, typename boost::graph_traits::vertex_descriptor, typename boost::graph_traits::vertex_descriptor, const boost::bgl_named_params&, boost::param_not_found) [with Graph = boost::adjacency_list > > > >; P = int; T = boost::buffer_param_t; R = boost::no_property; typename boost::detail::edge_capacity_value::type = double; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/edmonds_karp_max_flow.hpp:228:57: required from ‘typename boost::detail::edge_capacity_value::type boost::edmonds_karp_max_flow(Graph&, typename graph_traits::vertex_descriptor, typename graph_traits::vertex_descriptor, const bgl_named_params&) [with Graph = adjacency_list > > > >; P = int; T = buffer_param_t; R = no_property; typename detail::edge_capacity_value::type = double; typename graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/edmonds_karp_max_flow.hpp:240:33: required from ‘typename boost::property_traits::const_type>::value_type boost::edmonds_karp_max_flow(Graph&, typename graph_traits::vertex_descriptor, typename graph_traits::vertex_descriptor) [with Graph = adjacency_list > > > >; typename property_traits::const_type>::value_type = double; typename property_map::const_type = adj_list_edge_property_map > > >, edge_capacity_t>; typename graph_traits::vertex_descriptor = long unsigned int]’ sna.cpp:204:54: required from here /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::InputIterator::~InputIterator() [with TT = __gnu_cxx::__normal_iterator*, std::vector, std::allocator > > >]’ 37 | ~model() | ^ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:512:7: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 512 | BOOST_CONCEPT_USAGE(InputIterator) | ^~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::ForwardIterator<__gnu_cxx::__normal_iterator*, std::vector, std::allocator > > > >]’: /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements*, std::vector, std::allocator > > > > >]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:543:7: required from ‘struct boost::ForwardIterator<__gnu_cxx::__normal_iterator*, std::vector, std::allocator > > > >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:568:3: required from ‘struct boost::BidirectionalIterator<__gnu_cxx::__normal_iterator*, std::vector, std::allocator > > > >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:597:3: required from ‘struct boost::RandomAccessIterator<__gnu_cxx::__normal_iterator*, std::vector, std::allocator > > > >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:597:3: required from ‘struct boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator*, std::vector, std::allocator > > > >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:32:62: [ skipping 3 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_*, std::vector, std::allocator > > > >)>’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/property_map/property_map.hpp:354:5: required from ‘boost::iterator_property_map boost::make_iterator_property_map(RAIter, ID, Value) [with RAIter = __gnu_cxx::__normal_iterator*, std::vector, std::allocator > > >; Value = detail::edge_desc_impl; ID = vec_adj_list_vertex_id_map]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/edmonds_karp_max_flow.hpp:209:43: required from ‘static typename boost::detail::edge_capacity_value::type boost::detail::edmonds_karp_dispatch1::apply(Graph&, typename boost::graph_traits::vertex_descriptor, typename boost::graph_traits::vertex_descriptor, const boost::bgl_named_params&, boost::param_not_found) [with Graph = boost::adjacency_list > > > >; P = int; T = boost::buffer_param_t; R = boost::no_property; typename boost::detail::edge_capacity_value::type = double; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/edmonds_karp_max_flow.hpp:228:57: required from ‘typename boost::detail::edge_capacity_value::type boost::edmonds_karp_max_flow(Graph&, typename graph_traits::vertex_descriptor, typename graph_traits::vertex_descriptor, const bgl_named_params&) [with Graph = adjacency_list > > > >; P = int; T = buffer_param_t; R = no_property; typename detail::edge_capacity_value::type = double; typename graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/edmonds_karp_max_flow.hpp:240:33: required from ‘typename boost::property_traits::const_type>::value_type boost::edmonds_karp_max_flow(Graph&, typename graph_traits::vertex_descriptor, typename graph_traits::vertex_descriptor) [with Graph = adjacency_list > > > >; typename property_traits::const_type>::value_type = double; typename property_map::const_type = adj_list_edge_property_map > > >, edge_capacity_t>; typename graph_traits::vertex_descriptor = long unsigned int]’ sna.cpp:204:54: required from here /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::ForwardIterator::~ForwardIterator() [with TT = __gnu_cxx::__normal_iterator*, std::vector, std::allocator > > >]’ 37 | ~model() | ^ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:543:7: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 543 | BOOST_CONCEPT_USAGE(ForwardIterator) | ^~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::BidirectionalIterator<__gnu_cxx::__normal_iterator*, std::vector, std::allocator > > > >]’: /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements*, std::vector, std::allocator > > > > >]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:571:7: required from ‘struct boost::BidirectionalIterator<__gnu_cxx::__normal_iterator*, std::vector, std::allocator > > > >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:597:3: required from ‘struct boost::RandomAccessIterator<__gnu_cxx::__normal_iterator*, std::vector, std::allocator > > > >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:597:3: required from ‘struct boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator*, std::vector, std::allocator > > > >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator*, std::vector, std::allocator > > > >]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:42:5: [ skipping 2 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_*, std::vector, std::allocator > > > >)>’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/property_map/property_map.hpp:354:5: required from ‘boost::iterator_property_map boost::make_iterator_property_map(RAIter, ID, Value) [with RAIter = __gnu_cxx::__normal_iterator*, std::vector, std::allocator > > >; Value = detail::edge_desc_impl; ID = vec_adj_list_vertex_id_map]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/edmonds_karp_max_flow.hpp:209:43: required from ‘static typename boost::detail::edge_capacity_value::type boost::detail::edmonds_karp_dispatch1::apply(Graph&, typename boost::graph_traits::vertex_descriptor, typename boost::graph_traits::vertex_descriptor, const boost::bgl_named_params&, boost::param_not_found) [with Graph = boost::adjacency_list > > > >; P = int; T = boost::buffer_param_t; R = boost::no_property; typename boost::detail::edge_capacity_value::type = double; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/edmonds_karp_max_flow.hpp:228:57: required from ‘typename boost::detail::edge_capacity_value::type boost::edmonds_karp_max_flow(Graph&, typename graph_traits::vertex_descriptor, typename graph_traits::vertex_descriptor, const bgl_named_params&) [with Graph = adjacency_list > > > >; P = int; T = buffer_param_t; R = no_property; typename detail::edge_capacity_value::type = double; typename graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/edmonds_karp_max_flow.hpp:240:33: required from ‘typename boost::property_traits::const_type>::value_type boost::edmonds_karp_max_flow(Graph&, typename graph_traits::vertex_descriptor, typename graph_traits::vertex_descriptor) [with Graph = adjacency_list > > > >; typename property_traits::const_type>::value_type = double; typename property_map::const_type = adj_list_edge_property_map > > >, edge_capacity_t>; typename graph_traits::vertex_descriptor = long unsigned int]’ sna.cpp:204:54: required from here /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::BidirectionalIterator::~BidirectionalIterator() [with TT = __gnu_cxx::__normal_iterator*, std::vector, std::allocator > > >]’ 37 | ~model() | ^ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:571:7: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 571 | BOOST_CONCEPT_USAGE(BidirectionalIterator) | ^~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::Comparable<__gnu_cxx::__normal_iterator*, std::vector, std::allocator > > > >]’: /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements*, std::vector, std::allocator > > > > >]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:253:5: required from ‘struct boost::Comparable<__gnu_cxx::__normal_iterator*, std::vector, std::allocator > > > >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:597:3: required from ‘struct boost::RandomAccessIterator<__gnu_cxx::__normal_iterator*, std::vector, std::allocator > > > >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:597:3: required from ‘struct boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator*, std::vector, std::allocator > > > >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator*, std::vector, std::allocator > > > >]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:42:5: [ skipping 2 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_*, std::vector, std::allocator > > > >)>’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/property_map/property_map.hpp:354:5: required from ‘boost::iterator_property_map boost::make_iterator_property_map(RAIter, ID, Value) [with RAIter = __gnu_cxx::__normal_iterator*, std::vector, std::allocator > > >; Value = detail::edge_desc_impl; ID = vec_adj_list_vertex_id_map]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/edmonds_karp_max_flow.hpp:209:43: required from ‘static typename boost::detail::edge_capacity_value::type boost::detail::edmonds_karp_dispatch1::apply(Graph&, typename boost::graph_traits::vertex_descriptor, typename boost::graph_traits::vertex_descriptor, const boost::bgl_named_params&, boost::param_not_found) [with Graph = boost::adjacency_list > > > >; P = int; T = boost::buffer_param_t; R = boost::no_property; typename boost::detail::edge_capacity_value::type = double; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/edmonds_karp_max_flow.hpp:228:57: required from ‘typename boost::detail::edge_capacity_value::type boost::edmonds_karp_max_flow(Graph&, typename graph_traits::vertex_descriptor, typename graph_traits::vertex_descriptor, const bgl_named_params&) [with Graph = adjacency_list > > > >; P = int; T = buffer_param_t; R = no_property; typename detail::edge_capacity_value::type = double; typename graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/edmonds_karp_max_flow.hpp:240:33: required from ‘typename boost::property_traits::const_type>::value_type boost::edmonds_karp_max_flow(Graph&, typename graph_traits::vertex_descriptor, typename graph_traits::vertex_descriptor) [with Graph = adjacency_list > > > >; typename property_traits::const_type>::value_type = double; typename property_map::const_type = adj_list_edge_property_map > > >, edge_capacity_t>; typename graph_traits::vertex_descriptor = long unsigned int]’ sna.cpp:204:54: required from here /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::Comparable::~Comparable() [with TT = __gnu_cxx::__normal_iterator*, std::vector, std::allocator > > >]’ 37 | ~model() | ^ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:253:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 253 | BOOST_CONCEPT_USAGE(Comparable) { | ^~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::RandomAccessIterator<__gnu_cxx::__normal_iterator*, std::vector, std::allocator > > > >]’: /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements*, std::vector, std::allocator > > > > >]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:601:7: required from ‘struct boost::RandomAccessIterator<__gnu_cxx::__normal_iterator*, std::vector, std::allocator > > > >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:597:3: required from ‘struct boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator*, std::vector, std::allocator > > > >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator*, std::vector, std::allocator > > > >]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:42:5: [ skipping 2 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_*, std::vector, std::allocator > > > >)>’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/property_map/property_map.hpp:354:5: required from ‘boost::iterator_property_map boost::make_iterator_property_map(RAIter, ID, Value) [with RAIter = __gnu_cxx::__normal_iterator*, std::vector, std::allocator > > >; Value = detail::edge_desc_impl; ID = vec_adj_list_vertex_id_map]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/edmonds_karp_max_flow.hpp:209:43: required from ‘static typename boost::detail::edge_capacity_value::type boost::detail::edmonds_karp_dispatch1::apply(Graph&, typename boost::graph_traits::vertex_descriptor, typename boost::graph_traits::vertex_descriptor, const boost::bgl_named_params&, boost::param_not_found) [with Graph = boost::adjacency_list > > > >; P = int; T = boost::buffer_param_t; R = boost::no_property; typename boost::detail::edge_capacity_value::type = double; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/edmonds_karp_max_flow.hpp:228:57: required from ‘typename boost::detail::edge_capacity_value::type boost::edmonds_karp_max_flow(Graph&, typename graph_traits::vertex_descriptor, typename graph_traits::vertex_descriptor, const bgl_named_params&) [with Graph = adjacency_list > > > >; P = int; T = buffer_param_t; R = no_property; typename detail::edge_capacity_value::type = double; typename graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/edmonds_karp_max_flow.hpp:240:33: required from ‘typename boost::property_traits::const_type>::value_type boost::edmonds_karp_max_flow(Graph&, typename graph_traits::vertex_descriptor, typename graph_traits::vertex_descriptor) [with Graph = adjacency_list > > > >; typename property_traits::const_type>::value_type = double; typename property_map::const_type = adj_list_edge_property_map > > >, edge_capacity_t>; typename graph_traits::vertex_descriptor = long unsigned int]’ sna.cpp:204:54: required from here /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::RandomAccessIterator::~RandomAccessIterator() [with TT = __gnu_cxx::__normal_iterator*, std::vector, std::allocator > > >]’ 37 | ~model() | ^ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:601:7: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 601 | BOOST_CONCEPT_USAGE(RandomAccessIterator) | ^~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements > > >]’: /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:145:5: required from ‘struct boost::Assignable<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:502:3: required from ‘struct boost::InputIterator<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:540:3: required from ‘struct boost::ForwardIterator<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:568:3: required from ‘struct boost::BidirectionalIterator<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:597:3: required from ‘struct boost::RandomAccessIterator<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:597:3: [ skipping 5 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.4-3.20/BH/include/boost/property_map/property_map.hpp:354:5: required from ‘boost::iterator_property_map boost::make_iterator_property_map(RAIter, ID, Value) [with RAIter = __gnu_cxx::__normal_iterator >; Value = default_color_type; ID = vec_adj_list_vertex_id_map]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/edmonds_karp_max_flow.hpp:161:43: required from ‘static typename boost::detail::edge_capacity_value::type boost::detail::edmonds_karp_dispatch2::apply(Graph&, typename boost::graph_traits::vertex_descriptor, typename boost::graph_traits::vertex_descriptor, PredMap, const boost::bgl_named_params&, boost::param_not_found) [with Graph = boost::adjacency_list > > > >; PredMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator*, std::vector, std::allocator > > >, boost::vec_adj_list_vertex_id_map, boost::detail::edge_desc_impl, boost::detail::edge_desc_impl&>; P = int; T = boost::buffer_param_t; R = boost::no_property; typename boost::detail::edge_capacity_value::type = double; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/edmonds_karp_max_flow.hpp:208:54: required from ‘static typename boost::detail::edge_capacity_value::type boost::detail::edmonds_karp_dispatch1::apply(Graph&, typename boost::graph_traits::vertex_descriptor, typename boost::graph_traits::vertex_descriptor, const boost::bgl_named_params&, boost::param_not_found) [with Graph = boost::adjacency_list > > > >; P = int; T = boost::buffer_param_t; R = boost::no_property; typename boost::detail::edge_capacity_value::type = double; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/edmonds_karp_max_flow.hpp:228:57: required from ‘typename boost::detail::edge_capacity_value::type boost::edmonds_karp_max_flow(Graph&, typename graph_traits::vertex_descriptor, typename graph_traits::vertex_descriptor, const bgl_named_params&) [with Graph = adjacency_list > > > >; P = int; T = buffer_param_t; R = no_property; typename detail::edge_capacity_value::type = double; typename graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/edmonds_karp_max_flow.hpp:240:33: required from ‘typename boost::property_traits::const_type>::value_type boost::edmonds_karp_max_flow(Graph&, typename graph_traits::vertex_descriptor, typename graph_traits::vertex_descriptor) [with Graph = adjacency_list > > > >; typename property_traits::const_type>::value_type = double; typename property_map::const_type = adj_list_edge_property_map > > >, edge_capacity_t>; typename graph_traits::vertex_descriptor = long unsigned int]’ sna.cpp:204:54: required from here /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::Assignable<__gnu_cxx::__normal_iterator > >]’ 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ^ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements > > >]’: /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:233:5: required from ‘struct boost::EqualityComparable<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:502:3: required from ‘struct boost::InputIterator<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:540:3: required from ‘struct boost::ForwardIterator<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:568:3: required from ‘struct boost::BidirectionalIterator<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:597:3: required from ‘struct boost::RandomAccessIterator<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:597:3: [ skipping 5 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.4-3.20/BH/include/boost/property_map/property_map.hpp:354:5: required from ‘boost::iterator_property_map boost::make_iterator_property_map(RAIter, ID, Value) [with RAIter = __gnu_cxx::__normal_iterator >; Value = default_color_type; ID = vec_adj_list_vertex_id_map]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/edmonds_karp_max_flow.hpp:161:43: required from ‘static typename boost::detail::edge_capacity_value::type boost::detail::edmonds_karp_dispatch2::apply(Graph&, typename boost::graph_traits::vertex_descriptor, typename boost::graph_traits::vertex_descriptor, PredMap, const boost::bgl_named_params&, boost::param_not_found) [with Graph = boost::adjacency_list > > > >; PredMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator*, std::vector, std::allocator > > >, boost::vec_adj_list_vertex_id_map, boost::detail::edge_desc_impl, boost::detail::edge_desc_impl&>; P = int; T = boost::buffer_param_t; R = boost::no_property; typename boost::detail::edge_capacity_value::type = double; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/edmonds_karp_max_flow.hpp:208:54: required from ‘static typename boost::detail::edge_capacity_value::type boost::detail::edmonds_karp_dispatch1::apply(Graph&, typename boost::graph_traits::vertex_descriptor, typename boost::graph_traits::vertex_descriptor, const boost::bgl_named_params&, boost::param_not_found) [with Graph = boost::adjacency_list > > > >; P = int; T = boost::buffer_param_t; R = boost::no_property; typename boost::detail::edge_capacity_value::type = double; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/edmonds_karp_max_flow.hpp:228:57: required from ‘typename boost::detail::edge_capacity_value::type boost::edmonds_karp_max_flow(Graph&, typename graph_traits::vertex_descriptor, typename graph_traits::vertex_descriptor, const bgl_named_params&) [with Graph = adjacency_list > > > >; P = int; T = buffer_param_t; R = no_property; typename detail::edge_capacity_value::type = double; typename graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/edmonds_karp_max_flow.hpp:240:33: required from ‘typename boost::property_traits::const_type>::value_type boost::edmonds_karp_max_flow(Graph&, typename graph_traits::vertex_descriptor, typename graph_traits::vertex_descriptor) [with Graph = adjacency_list > > > >; typename property_traits::const_type>::value_type = double; typename property_map::const_type = adj_list_edge_property_map > > >, edge_capacity_t>; typename graph_traits::vertex_descriptor = long unsigned int]’ sna.cpp:204:54: required from here /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::EqualityComparable<__gnu_cxx::__normal_iterator > >]’ 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ^ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements > > >]’: /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:512:7: required from ‘struct boost::InputIterator<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:540:3: required from ‘struct boost::ForwardIterator<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:568:3: required from ‘struct boost::BidirectionalIterator<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:597:3: required from ‘struct boost::RandomAccessIterator<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:597:3: required from ‘struct boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:32:62: [ skipping 4 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.4-3.20/BH/include/boost/property_map/property_map.hpp:354:5: required from ‘boost::iterator_property_map boost::make_iterator_property_map(RAIter, ID, Value) [with RAIter = __gnu_cxx::__normal_iterator >; Value = default_color_type; ID = vec_adj_list_vertex_id_map]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/edmonds_karp_max_flow.hpp:161:43: required from ‘static typename boost::detail::edge_capacity_value::type boost::detail::edmonds_karp_dispatch2::apply(Graph&, typename boost::graph_traits::vertex_descriptor, typename boost::graph_traits::vertex_descriptor, PredMap, const boost::bgl_named_params&, boost::param_not_found) [with Graph = boost::adjacency_list > > > >; PredMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator*, std::vector, std::allocator > > >, boost::vec_adj_list_vertex_id_map, boost::detail::edge_desc_impl, boost::detail::edge_desc_impl&>; P = int; T = boost::buffer_param_t; R = boost::no_property; typename boost::detail::edge_capacity_value::type = double; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/edmonds_karp_max_flow.hpp:208:54: required from ‘static typename boost::detail::edge_capacity_value::type boost::detail::edmonds_karp_dispatch1::apply(Graph&, typename boost::graph_traits::vertex_descriptor, typename boost::graph_traits::vertex_descriptor, const boost::bgl_named_params&, boost::param_not_found) [with Graph = boost::adjacency_list > > > >; P = int; T = boost::buffer_param_t; R = boost::no_property; typename boost::detail::edge_capacity_value::type = double; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/edmonds_karp_max_flow.hpp:228:57: required from ‘typename boost::detail::edge_capacity_value::type boost::edmonds_karp_max_flow(Graph&, typename graph_traits::vertex_descriptor, typename graph_traits::vertex_descriptor, const bgl_named_params&) [with Graph = adjacency_list > > > >; P = int; T = buffer_param_t; R = no_property; typename detail::edge_capacity_value::type = double; typename graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/edmonds_karp_max_flow.hpp:240:33: required from ‘typename boost::property_traits::const_type>::value_type boost::edmonds_karp_max_flow(Graph&, typename graph_traits::vertex_descriptor, typename graph_traits::vertex_descriptor) [with Graph = adjacency_list > > > >; typename property_traits::const_type>::value_type = double; typename property_map::const_type = adj_list_edge_property_map > > >, edge_capacity_t>; typename graph_traits::vertex_descriptor = long unsigned int]’ sna.cpp:204:54: required from here /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::InputIterator<__gnu_cxx::__normal_iterator > >]’ 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ^ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements > > >]’: /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:543:7: required from ‘struct boost::ForwardIterator<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:568:3: required from ‘struct boost::BidirectionalIterator<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:597:3: required from ‘struct boost::RandomAccessIterator<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:597:3: required from ‘struct boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator > >]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:42:5: [ skipping 3 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.4-3.20/BH/include/boost/property_map/property_map.hpp:354:5: required from ‘boost::iterator_property_map boost::make_iterator_property_map(RAIter, ID, Value) [with RAIter = __gnu_cxx::__normal_iterator >; Value = default_color_type; ID = vec_adj_list_vertex_id_map]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/edmonds_karp_max_flow.hpp:161:43: required from ‘static typename boost::detail::edge_capacity_value::type boost::detail::edmonds_karp_dispatch2::apply(Graph&, typename boost::graph_traits::vertex_descriptor, typename boost::graph_traits::vertex_descriptor, PredMap, const boost::bgl_named_params&, boost::param_not_found) [with Graph = boost::adjacency_list > > > >; PredMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator*, std::vector, std::allocator > > >, boost::vec_adj_list_vertex_id_map, boost::detail::edge_desc_impl, boost::detail::edge_desc_impl&>; P = int; T = boost::buffer_param_t; R = boost::no_property; typename boost::detail::edge_capacity_value::type = double; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/edmonds_karp_max_flow.hpp:208:54: required from ‘static typename boost::detail::edge_capacity_value::type boost::detail::edmonds_karp_dispatch1::apply(Graph&, typename boost::graph_traits::vertex_descriptor, typename boost::graph_traits::vertex_descriptor, const boost::bgl_named_params&, boost::param_not_found) [with Graph = boost::adjacency_list > > > >; P = int; T = boost::buffer_param_t; R = boost::no_property; typename boost::detail::edge_capacity_value::type = double; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/edmonds_karp_max_flow.hpp:228:57: required from ‘typename boost::detail::edge_capacity_value::type boost::edmonds_karp_max_flow(Graph&, typename graph_traits::vertex_descriptor, typename graph_traits::vertex_descriptor, const bgl_named_params&) [with Graph = adjacency_list > > > >; P = int; T = buffer_param_t; R = no_property; typename detail::edge_capacity_value::type = double; typename graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/edmonds_karp_max_flow.hpp:240:33: required from ‘typename boost::property_traits::const_type>::value_type boost::edmonds_karp_max_flow(Graph&, typename graph_traits::vertex_descriptor, typename graph_traits::vertex_descriptor) [with Graph = adjacency_list > > > >; typename property_traits::const_type>::value_type = double; typename property_map::const_type = adj_list_edge_property_map > > >, edge_capacity_t>; typename graph_traits::vertex_descriptor = long unsigned int]’ sna.cpp:204:54: required from here /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::ForwardIterator<__gnu_cxx::__normal_iterator > >]’ 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ^ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements > > >]’: /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:571:7: required from ‘struct boost::BidirectionalIterator<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:597:3: required from ‘struct boost::RandomAccessIterator<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:597:3: required from ‘struct boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator > >]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied > > >::value’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:45:51: [ skipping 2 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.4-3.20/BH/include/boost/property_map/property_map.hpp:354:5: required from ‘boost::iterator_property_map boost::make_iterator_property_map(RAIter, ID, Value) [with RAIter = __gnu_cxx::__normal_iterator >; Value = default_color_type; ID = vec_adj_list_vertex_id_map]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/edmonds_karp_max_flow.hpp:161:43: required from ‘static typename boost::detail::edge_capacity_value::type boost::detail::edmonds_karp_dispatch2::apply(Graph&, typename boost::graph_traits::vertex_descriptor, typename boost::graph_traits::vertex_descriptor, PredMap, const boost::bgl_named_params&, boost::param_not_found) [with Graph = boost::adjacency_list > > > >; PredMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator*, std::vector, std::allocator > > >, boost::vec_adj_list_vertex_id_map, boost::detail::edge_desc_impl, boost::detail::edge_desc_impl&>; P = int; T = boost::buffer_param_t; R = boost::no_property; typename boost::detail::edge_capacity_value::type = double; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/edmonds_karp_max_flow.hpp:208:54: required from ‘static typename boost::detail::edge_capacity_value::type boost::detail::edmonds_karp_dispatch1::apply(Graph&, typename boost::graph_traits::vertex_descriptor, typename boost::graph_traits::vertex_descriptor, const boost::bgl_named_params&, boost::param_not_found) [with Graph = boost::adjacency_list > > > >; P = int; T = boost::buffer_param_t; R = boost::no_property; typename boost::detail::edge_capacity_value::type = double; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/edmonds_karp_max_flow.hpp:228:57: required from ‘typename boost::detail::edge_capacity_value::type boost::edmonds_karp_max_flow(Graph&, typename graph_traits::vertex_descriptor, typename graph_traits::vertex_descriptor, const bgl_named_params&) [with Graph = adjacency_list > > > >; P = int; T = buffer_param_t; R = no_property; typename detail::edge_capacity_value::type = double; typename graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/edmonds_karp_max_flow.hpp:240:33: required from ‘typename boost::property_traits::const_type>::value_type boost::edmonds_karp_max_flow(Graph&, typename graph_traits::vertex_descriptor, typename graph_traits::vertex_descriptor) [with Graph = adjacency_list > > > >; typename property_traits::const_type>::value_type = double; typename property_map::const_type = adj_list_edge_property_map > > >, edge_capacity_t>; typename graph_traits::vertex_descriptor = long unsigned int]’ sna.cpp:204:54: required from here /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::BidirectionalIterator<__gnu_cxx::__normal_iterator > >]’ 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ^ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements > > >]’: /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:253:5: required from ‘struct boost::Comparable<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:597:3: required from ‘struct boost::RandomAccessIterator<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:597:3: required from ‘struct boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator > >]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied > > >::value’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:45:51: [ skipping 2 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.4-3.20/BH/include/boost/property_map/property_map.hpp:354:5: required from ‘boost::iterator_property_map boost::make_iterator_property_map(RAIter, ID, Value) [with RAIter = __gnu_cxx::__normal_iterator >; Value = default_color_type; ID = vec_adj_list_vertex_id_map]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/edmonds_karp_max_flow.hpp:161:43: required from ‘static typename boost::detail::edge_capacity_value::type boost::detail::edmonds_karp_dispatch2::apply(Graph&, typename boost::graph_traits::vertex_descriptor, typename boost::graph_traits::vertex_descriptor, PredMap, const boost::bgl_named_params&, boost::param_not_found) [with Graph = boost::adjacency_list > > > >; PredMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator*, std::vector, std::allocator > > >, boost::vec_adj_list_vertex_id_map, boost::detail::edge_desc_impl, boost::detail::edge_desc_impl&>; P = int; T = boost::buffer_param_t; R = boost::no_property; typename boost::detail::edge_capacity_value::type = double; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/edmonds_karp_max_flow.hpp:208:54: required from ‘static typename boost::detail::edge_capacity_value::type boost::detail::edmonds_karp_dispatch1::apply(Graph&, typename boost::graph_traits::vertex_descriptor, typename boost::graph_traits::vertex_descriptor, const boost::bgl_named_params&, boost::param_not_found) [with Graph = boost::adjacency_list > > > >; P = int; T = boost::buffer_param_t; R = boost::no_property; typename boost::detail::edge_capacity_value::type = double; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/edmonds_karp_max_flow.hpp:228:57: required from ‘typename boost::detail::edge_capacity_value::type boost::edmonds_karp_max_flow(Graph&, typename graph_traits::vertex_descriptor, typename graph_traits::vertex_descriptor, const bgl_named_params&) [with Graph = adjacency_list > > > >; P = int; T = buffer_param_t; R = no_property; typename detail::edge_capacity_value::type = double; typename graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/edmonds_karp_max_flow.hpp:240:33: required from ‘typename boost::property_traits::const_type>::value_type boost::edmonds_karp_max_flow(Graph&, typename graph_traits::vertex_descriptor, typename graph_traits::vertex_descriptor) [with Graph = adjacency_list > > > >; typename property_traits::const_type>::value_type = double; typename property_map::const_type = adj_list_edge_property_map > > >, edge_capacity_t>; typename graph_traits::vertex_descriptor = long unsigned int]’ sna.cpp:204:54: required from here /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::Comparable<__gnu_cxx::__normal_iterator > >]’ 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ^ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements > > >]’: /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:601:7: required from ‘struct boost::RandomAccessIterator<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:597:3: required from ‘struct boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator > >]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied > > >::value’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:45:51: [ skipping 2 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.4-3.20/BH/include/boost/property_map/property_map.hpp:354:5: required from ‘boost::iterator_property_map boost::make_iterator_property_map(RAIter, ID, Value) [with RAIter = __gnu_cxx::__normal_iterator >; Value = default_color_type; ID = vec_adj_list_vertex_id_map]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/edmonds_karp_max_flow.hpp:161:43: required from ‘static typename boost::detail::edge_capacity_value::type boost::detail::edmonds_karp_dispatch2::apply(Graph&, typename boost::graph_traits::vertex_descriptor, typename boost::graph_traits::vertex_descriptor, PredMap, const boost::bgl_named_params&, boost::param_not_found) [with Graph = boost::adjacency_list > > > >; PredMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator*, std::vector, std::allocator > > >, boost::vec_adj_list_vertex_id_map, boost::detail::edge_desc_impl, boost::detail::edge_desc_impl&>; P = int; T = boost::buffer_param_t; R = boost::no_property; typename boost::detail::edge_capacity_value::type = double; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/edmonds_karp_max_flow.hpp:208:54: required from ‘static typename boost::detail::edge_capacity_value::type boost::detail::edmonds_karp_dispatch1::apply(Graph&, typename boost::graph_traits::vertex_descriptor, typename boost::graph_traits::vertex_descriptor, const boost::bgl_named_params&, boost::param_not_found) [with Graph = boost::adjacency_list > > > >; P = int; T = boost::buffer_param_t; R = boost::no_property; typename boost::detail::edge_capacity_value::type = double; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/edmonds_karp_max_flow.hpp:228:57: required from ‘typename boost::detail::edge_capacity_value::type boost::edmonds_karp_max_flow(Graph&, typename graph_traits::vertex_descriptor, typename graph_traits::vertex_descriptor, const bgl_named_params&) [with Graph = adjacency_list > > > >; P = int; T = buffer_param_t; R = no_property; typename detail::edge_capacity_value::type = double; typename graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/edmonds_karp_max_flow.hpp:240:33: required from ‘typename boost::property_traits::const_type>::value_type boost::edmonds_karp_max_flow(Graph&, typename graph_traits::vertex_descriptor, typename graph_traits::vertex_descriptor) [with Graph = adjacency_list > > > >; typename property_traits::const_type>::value_type = double; typename property_map::const_type = adj_list_edge_property_map > > >, edge_capacity_t>; typename graph_traits::vertex_descriptor = long unsigned int]’ sna.cpp:204:54: required from here /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::RandomAccessIterator<__gnu_cxx::__normal_iterator > >]’ 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ^ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator > >]’: /home/omnipath/local/R/4.4-3.20/BH/include/boost/property_map/property_map.hpp:354:5: required from ‘boost::iterator_property_map boost::make_iterator_property_map(RAIter, ID, Value) [with RAIter = __gnu_cxx::__normal_iterator >; Value = default_color_type; ID = vec_adj_list_vertex_id_map]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/edmonds_karp_max_flow.hpp:161:43: required from ‘static typename boost::detail::edge_capacity_value::type boost::detail::edmonds_karp_dispatch2::apply(Graph&, typename boost::graph_traits::vertex_descriptor, typename boost::graph_traits::vertex_descriptor, PredMap, const boost::bgl_named_params&, boost::param_not_found) [with Graph = boost::adjacency_list > > > >; PredMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator*, std::vector, std::allocator > > >, boost::vec_adj_list_vertex_id_map, boost::detail::edge_desc_impl, boost::detail::edge_desc_impl&>; P = int; T = boost::buffer_param_t; R = boost::no_property; typename boost::detail::edge_capacity_value::type = double; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/edmonds_karp_max_flow.hpp:208:54: required from ‘static typename boost::detail::edge_capacity_value::type boost::detail::edmonds_karp_dispatch1::apply(Graph&, typename boost::graph_traits::vertex_descriptor, typename boost::graph_traits::vertex_descriptor, const boost::bgl_named_params&, boost::param_not_found) [with Graph = boost::adjacency_list > > > >; P = int; T = boost::buffer_param_t; R = boost::no_property; typename boost::detail::edge_capacity_value::type = double; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/edmonds_karp_max_flow.hpp:228:57: required from ‘typename boost::detail::edge_capacity_value::type boost::edmonds_karp_max_flow(Graph&, typename graph_traits::vertex_descriptor, typename graph_traits::vertex_descriptor, const bgl_named_params&) [with Graph = adjacency_list > > > >; P = int; T = buffer_param_t; R = no_property; typename detail::edge_capacity_value::type = double; typename graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/edmonds_karp_max_flow.hpp:240:33: required from ‘typename boost::property_traits::const_type>::value_type boost::edmonds_karp_max_flow(Graph&, typename graph_traits::vertex_descriptor, typename graph_traits::vertex_descriptor) [with Graph = adjacency_list > > > >; typename property_traits::const_type>::value_type = double; typename property_map::const_type = adj_list_edge_property_map > > >, edge_capacity_t>; typename graph_traits::vertex_descriptor = long unsigned int]’ sna.cpp:204:54: required from here /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:597:17: note: in a call to non-static member function ‘boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator > >::~RandomAccessIteratorConcept()’ 597 | BOOST_concept(RandomAccessIterator,(TT)) | ^~~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/preprocessor/cat.hpp:29:34: note: in definition of macro ‘BOOST_PP_CAT_I’ 29 | # define BOOST_PP_CAT_I(a, b) a ## b | ^ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/concept_def.hpp:23:12: note: in expansion of macro ‘BOOST_PP_CAT’ 23 | struct BOOST_PP_CAT(name,Concept) \ | ^~~~~~~~~~~~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:597:3: note: in expansion of macro ‘BOOST_concept’ 597 | BOOST_concept(RandomAccessIterator,(TT)) | ^~~~~~~~~~~~~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::adjacency_list, boost::property >, boost::no_property, boost::listS> > > >]’: /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/graph_concepts.hpp:52:50: required from ‘struct boost::concepts::MultiPassInputIterator, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::adjacency_list, boost::property >, boost::no_property, boost::listS> > >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::concepts::MultiPassInputIterator, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::adjacency_list, boost::property >, boost::no_property, boost::listS> > >]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::adjacency_list, boost::property >, boost::no_property, boost::listS> > > >::value’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::adjacency_list, boost::property >, boost::no_property, boost::listS> > > >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:72:8: [ skipping 2 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/graph_concepts.hpp:226:1: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::EdgeListGraphConcept, boost::property >, boost::no_property, boost::listS> >]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/bellman_ford_shortest_paths.hpp:97:5: required from ‘bool boost::bellman_ford_shortest_paths(EdgeListGraph&, Size, WeightMap, PredecessorMap, DistanceMap, BinaryFunction, BinaryPredicate, BellmanFordVisitor) [with EdgeListGraph = adjacency_list, property >, no_property, listS>; Size = long unsigned int; WeightMap = adj_list_edge_property_map >, edge_weight_t>; PredecessorMap = dummy_property_map; DistanceMap = vec_adj_list_vertex_property_map, property >, no_property, listS>, adjacency_list, property >, no_property, listS>*, double, double&, vertex_distance_t>; BinaryFunction = closed_plus; BinaryPredicate = std::less; BellmanFordVisitor = bellman_visitor<>]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/johnson_all_pairs_shortest.hpp:112:36: required from ‘bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, VertexID, Weight, const BinaryPredicate&, const BinaryFunction&, const Infinity&, DistanceZero) [with VertexAndEdgeListGraph = R_adjacency_list; DistanceMatrix = Basic2DMatrix; VertexID = vec_adj_list_vertex_id_map, long unsigned int>; Weight = adj_list_edge_property_map, edge_weight_t>; BinaryPredicate = std::less; BinaryFunction = closed_plus; Infinity = double; DistanceZero = double]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/johnson_all_pairs_shortest.hpp:164:48: required from ‘bool boost::detail::johnson_dispatch(VertexAndEdgeListGraph&, DistanceMatrix&, const boost::bgl_named_params&, Weight, VertexID) [with VertexAndEdgeListGraph = R_adjacency_list; DistanceMatrix = Basic2DMatrix; P = int; T = int; R = boost::no_property; Weight = boost::adj_list_edge_property_map, boost::edge_weight_t>; VertexID = boost::vec_adj_list_vertex_id_map, long unsigned int>]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/johnson_all_pairs_shortest.hpp:192:36: required from ‘bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&) [with VertexAndEdgeListGraph = R_adjacency_list; DistanceMatrix = Basic2DMatrix]’ sna.cpp:105:41: required from here /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::concepts::MultiPassInputIterator, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::adjacency_list, boost::property >, boost::no_property, boost::listS> > >]’ 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ^ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::MultiPassInputIterator, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::adjacency_list, boost::property >, boost::no_property, boost::listS> > >]’: /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/graph_concepts.hpp:235:9: required from ‘boost::concepts::EdgeListGraph::~EdgeListGraph() [with G = boost::adjacency_list, boost::property >, boost::no_property, boost::listS>]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/graph_concepts.hpp:226:1: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::EdgeListGraphConcept, boost::property >, boost::no_property, boost::listS> >]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/bellman_ford_shortest_paths.hpp:97:5: required from ‘bool boost::bellman_ford_shortest_paths(EdgeListGraph&, Size, WeightMap, PredecessorMap, DistanceMap, BinaryFunction, BinaryPredicate, BellmanFordVisitor) [with EdgeListGraph = adjacency_list, property >, no_property, listS>; Size = long unsigned int; WeightMap = adj_list_edge_property_map >, edge_weight_t>; PredecessorMap = dummy_property_map; DistanceMap = vec_adj_list_vertex_property_map, property >, no_property, listS>, adjacency_list, property >, no_property, listS>*, double, double&, vertex_distance_t>; BinaryFunction = closed_plus; BinaryPredicate = std::less; BellmanFordVisitor = bellman_visitor<>]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/johnson_all_pairs_shortest.hpp:112:36: required from ‘bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, VertexID, Weight, const BinaryPredicate&, const BinaryFunction&, const Infinity&, DistanceZero) [with VertexAndEdgeListGraph = R_adjacency_list; DistanceMatrix = Basic2DMatrix; VertexID = vec_adj_list_vertex_id_map, long unsigned int>; Weight = adj_list_edge_property_map, edge_weight_t>; BinaryPredicate = std::less; BinaryFunction = closed_plus; Infinity = double; DistanceZero = double]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/johnson_all_pairs_shortest.hpp:164:48: required from ‘bool boost::detail::johnson_dispatch(VertexAndEdgeListGraph&, DistanceMatrix&, const boost::bgl_named_params&, Weight, VertexID) [with VertexAndEdgeListGraph = R_adjacency_list; DistanceMatrix = Basic2DMatrix; P = int; T = int; R = boost::no_property; Weight = boost::adj_list_edge_property_map, boost::edge_weight_t>; VertexID = boost::vec_adj_list_vertex_id_map, long unsigned int>]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/johnson_all_pairs_shortest.hpp:192:36: required from ‘bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&) [with VertexAndEdgeListGraph = R_adjacency_list; DistanceMatrix = Basic2DMatrix]’ sna.cpp:105:41: required from here /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::concepts::MultiPassInputIterator::~MultiPassInputIterator() [with T = boost::detail::adj_list_edge_iterator, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::adjacency_list, boost::property >, boost::no_property, boost::listS> >]’ 37 | ~model() | ^ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/graph_concepts.hpp:52:50: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 52 | BOOST_concept(MultiPassInputIterator, (T)) { BOOST_CONCEPT_USAGE( | ^~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements > >]’: /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:137:5: required from ‘struct boost::DefaultConstructible >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::DefaultConstructible >]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied > >::value’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied > >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:72:8: [ skipping 2 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/graph_concepts.hpp:226:1: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::EdgeListGraphConcept, boost::property >, boost::no_property, boost::listS> >]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/bellman_ford_shortest_paths.hpp:97:5: required from ‘bool boost::bellman_ford_shortest_paths(EdgeListGraph&, Size, WeightMap, PredecessorMap, DistanceMap, BinaryFunction, BinaryPredicate, BellmanFordVisitor) [with EdgeListGraph = adjacency_list, property >, no_property, listS>; Size = long unsigned int; WeightMap = adj_list_edge_property_map >, edge_weight_t>; PredecessorMap = dummy_property_map; DistanceMap = vec_adj_list_vertex_property_map, property >, no_property, listS>, adjacency_list, property >, no_property, listS>*, double, double&, vertex_distance_t>; BinaryFunction = closed_plus; BinaryPredicate = std::less; BellmanFordVisitor = bellman_visitor<>]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/johnson_all_pairs_shortest.hpp:112:36: required from ‘bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, VertexID, Weight, const BinaryPredicate&, const BinaryFunction&, const Infinity&, DistanceZero) [with VertexAndEdgeListGraph = R_adjacency_list; DistanceMatrix = Basic2DMatrix; VertexID = vec_adj_list_vertex_id_map, long unsigned int>; Weight = adj_list_edge_property_map, edge_weight_t>; BinaryPredicate = std::less; BinaryFunction = closed_plus; Infinity = double; DistanceZero = double]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/johnson_all_pairs_shortest.hpp:164:48: required from ‘bool boost::detail::johnson_dispatch(VertexAndEdgeListGraph&, DistanceMatrix&, const boost::bgl_named_params&, Weight, VertexID) [with VertexAndEdgeListGraph = R_adjacency_list; DistanceMatrix = Basic2DMatrix; P = int; T = int; R = boost::no_property; Weight = boost::adj_list_edge_property_map, boost::edge_weight_t>; VertexID = boost::vec_adj_list_vertex_id_map, long unsigned int>]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/johnson_all_pairs_shortest.hpp:192:36: required from ‘bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&) [with VertexAndEdgeListGraph = R_adjacency_list; DistanceMatrix = Basic2DMatrix]’ sna.cpp:105:41: required from here /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::DefaultConstructible >]’ 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ^ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::DefaultConstructible >]’: /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/graph_concepts.hpp:90:9: required from ‘boost::concepts::EdgeListGraph::~EdgeListGraph() [with G = boost::adjacency_list, boost::property >, boost::no_property, boost::listS>]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/graph_concepts.hpp:226:1: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::EdgeListGraphConcept, boost::property >, boost::no_property, boost::listS> >]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/bellman_ford_shortest_paths.hpp:97:5: required from ‘bool boost::bellman_ford_shortest_paths(EdgeListGraph&, Size, WeightMap, PredecessorMap, DistanceMap, BinaryFunction, BinaryPredicate, BellmanFordVisitor) [with EdgeListGraph = adjacency_list, property >, no_property, listS>; Size = long unsigned int; WeightMap = adj_list_edge_property_map >, edge_weight_t>; PredecessorMap = dummy_property_map; DistanceMap = vec_adj_list_vertex_property_map, property >, no_property, listS>, adjacency_list, property >, no_property, listS>*, double, double&, vertex_distance_t>; BinaryFunction = closed_plus; BinaryPredicate = std::less; BellmanFordVisitor = bellman_visitor<>]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/johnson_all_pairs_shortest.hpp:112:36: required from ‘bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, VertexID, Weight, const BinaryPredicate&, const BinaryFunction&, const Infinity&, DistanceZero) [with VertexAndEdgeListGraph = R_adjacency_list; DistanceMatrix = Basic2DMatrix; VertexID = vec_adj_list_vertex_id_map, long unsigned int>; Weight = adj_list_edge_property_map, edge_weight_t>; BinaryPredicate = std::less; BinaryFunction = closed_plus; Infinity = double; DistanceZero = double]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/johnson_all_pairs_shortest.hpp:164:48: required from ‘bool boost::detail::johnson_dispatch(VertexAndEdgeListGraph&, DistanceMatrix&, const boost::bgl_named_params&, Weight, VertexID) [with VertexAndEdgeListGraph = R_adjacency_list; DistanceMatrix = Basic2DMatrix; P = int; T = int; R = boost::no_property; Weight = boost::adj_list_edge_property_map, boost::edge_weight_t>; VertexID = boost::vec_adj_list_vertex_id_map, long unsigned int>]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/johnson_all_pairs_shortest.hpp:192:36: required from ‘bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&) [with VertexAndEdgeListGraph = R_adjacency_list; DistanceMatrix = Basic2DMatrix]’ sna.cpp:105:41: required from here /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::DefaultConstructible::~DefaultConstructible() [with TT = boost::detail::edge_desc_impl]’ 37 | ~model() | ^ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:137:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 137 | BOOST_CONCEPT_USAGE(DefaultConstructible) { | ^~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements > >]’: /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:233:5: required from ‘struct boost::EqualityComparable >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::EqualityComparable >]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied > >::value’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied > >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:72:8: [ skipping 2 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/graph_concepts.hpp:226:1: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::EdgeListGraphConcept, boost::property >, boost::no_property, boost::listS> >]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/bellman_ford_shortest_paths.hpp:97:5: required from ‘bool boost::bellman_ford_shortest_paths(EdgeListGraph&, Size, WeightMap, PredecessorMap, DistanceMap, BinaryFunction, BinaryPredicate, BellmanFordVisitor) [with EdgeListGraph = adjacency_list, property >, no_property, listS>; Size = long unsigned int; WeightMap = adj_list_edge_property_map >, edge_weight_t>; PredecessorMap = dummy_property_map; DistanceMap = vec_adj_list_vertex_property_map, property >, no_property, listS>, adjacency_list, property >, no_property, listS>*, double, double&, vertex_distance_t>; BinaryFunction = closed_plus; BinaryPredicate = std::less; BellmanFordVisitor = bellman_visitor<>]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/johnson_all_pairs_shortest.hpp:112:36: required from ‘bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, VertexID, Weight, const BinaryPredicate&, const BinaryFunction&, const Infinity&, DistanceZero) [with VertexAndEdgeListGraph = R_adjacency_list; DistanceMatrix = Basic2DMatrix; VertexID = vec_adj_list_vertex_id_map, long unsigned int>; Weight = adj_list_edge_property_map, edge_weight_t>; BinaryPredicate = std::less; BinaryFunction = closed_plus; Infinity = double; DistanceZero = double]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/johnson_all_pairs_shortest.hpp:164:48: required from ‘bool boost::detail::johnson_dispatch(VertexAndEdgeListGraph&, DistanceMatrix&, const boost::bgl_named_params&, Weight, VertexID) [with VertexAndEdgeListGraph = R_adjacency_list; DistanceMatrix = Basic2DMatrix; P = int; T = int; R = boost::no_property; Weight = boost::adj_list_edge_property_map, boost::edge_weight_t>; VertexID = boost::vec_adj_list_vertex_id_map, long unsigned int>]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/johnson_all_pairs_shortest.hpp:192:36: required from ‘bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&) [with VertexAndEdgeListGraph = R_adjacency_list; DistanceMatrix = Basic2DMatrix]’ sna.cpp:105:41: required from here /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::EqualityComparable >]’ 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ^ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::EqualityComparable >]’: /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/graph_concepts.hpp:91:9: required from ‘boost::concepts::EdgeListGraph::~EdgeListGraph() [with G = boost::adjacency_list, boost::property >, boost::no_property, boost::listS>]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/graph_concepts.hpp:226:1: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::EdgeListGraphConcept, boost::property >, boost::no_property, boost::listS> >]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/bellman_ford_shortest_paths.hpp:97:5: required from ‘bool boost::bellman_ford_shortest_paths(EdgeListGraph&, Size, WeightMap, PredecessorMap, DistanceMap, BinaryFunction, BinaryPredicate, BellmanFordVisitor) [with EdgeListGraph = adjacency_list, property >, no_property, listS>; Size = long unsigned int; WeightMap = adj_list_edge_property_map >, edge_weight_t>; PredecessorMap = dummy_property_map; DistanceMap = vec_adj_list_vertex_property_map, property >, no_property, listS>, adjacency_list, property >, no_property, listS>*, double, double&, vertex_distance_t>; BinaryFunction = closed_plus; BinaryPredicate = std::less; BellmanFordVisitor = bellman_visitor<>]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/johnson_all_pairs_shortest.hpp:112:36: required from ‘bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, VertexID, Weight, const BinaryPredicate&, const BinaryFunction&, const Infinity&, DistanceZero) [with VertexAndEdgeListGraph = R_adjacency_list; DistanceMatrix = Basic2DMatrix; VertexID = vec_adj_list_vertex_id_map, long unsigned int>; Weight = adj_list_edge_property_map, edge_weight_t>; BinaryPredicate = std::less; BinaryFunction = closed_plus; Infinity = double; DistanceZero = double]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/johnson_all_pairs_shortest.hpp:164:48: required from ‘bool boost::detail::johnson_dispatch(VertexAndEdgeListGraph&, DistanceMatrix&, const boost::bgl_named_params&, Weight, VertexID) [with VertexAndEdgeListGraph = R_adjacency_list; DistanceMatrix = Basic2DMatrix; P = int; T = int; R = boost::no_property; Weight = boost::adj_list_edge_property_map, boost::edge_weight_t>; VertexID = boost::vec_adj_list_vertex_id_map, long unsigned int>]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/johnson_all_pairs_shortest.hpp:192:36: required from ‘bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&) [with VertexAndEdgeListGraph = R_adjacency_list; DistanceMatrix = Basic2DMatrix]’ sna.cpp:105:41: required from here /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::EqualityComparable::~EqualityComparable() [with TT = boost::detail::edge_desc_impl]’ 37 | ~model() | ^ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:233:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 233 | BOOST_CONCEPT_USAGE(EqualityComparable) { | ^~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements > >]’: /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:145:5: required from ‘struct boost::Assignable >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::Assignable >]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied > >::value’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied > >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:72:8: [ skipping 2 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/graph_concepts.hpp:226:1: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::EdgeListGraphConcept, boost::property >, boost::no_property, boost::listS> >]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/bellman_ford_shortest_paths.hpp:97:5: required from ‘bool boost::bellman_ford_shortest_paths(EdgeListGraph&, Size, WeightMap, PredecessorMap, DistanceMap, BinaryFunction, BinaryPredicate, BellmanFordVisitor) [with EdgeListGraph = adjacency_list, property >, no_property, listS>; Size = long unsigned int; WeightMap = adj_list_edge_property_map >, edge_weight_t>; PredecessorMap = dummy_property_map; DistanceMap = vec_adj_list_vertex_property_map, property >, no_property, listS>, adjacency_list, property >, no_property, listS>*, double, double&, vertex_distance_t>; BinaryFunction = closed_plus; BinaryPredicate = std::less; BellmanFordVisitor = bellman_visitor<>]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/johnson_all_pairs_shortest.hpp:112:36: required from ‘bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, VertexID, Weight, const BinaryPredicate&, const BinaryFunction&, const Infinity&, DistanceZero) [with VertexAndEdgeListGraph = R_adjacency_list; DistanceMatrix = Basic2DMatrix; VertexID = vec_adj_list_vertex_id_map, long unsigned int>; Weight = adj_list_edge_property_map, edge_weight_t>; BinaryPredicate = std::less; BinaryFunction = closed_plus; Infinity = double; DistanceZero = double]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/johnson_all_pairs_shortest.hpp:164:48: required from ‘bool boost::detail::johnson_dispatch(VertexAndEdgeListGraph&, DistanceMatrix&, const boost::bgl_named_params&, Weight, VertexID) [with VertexAndEdgeListGraph = R_adjacency_list; DistanceMatrix = Basic2DMatrix; P = int; T = int; R = boost::no_property; Weight = boost::adj_list_edge_property_map, boost::edge_weight_t>; VertexID = boost::vec_adj_list_vertex_id_map, long unsigned int>]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/johnson_all_pairs_shortest.hpp:192:36: required from ‘bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&) [with VertexAndEdgeListGraph = R_adjacency_list; DistanceMatrix = Basic2DMatrix]’ sna.cpp:105:41: required from here /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::Assignable >]’ 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ^ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::Assignable >]’: /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/graph_concepts.hpp:92:9: required from ‘boost::concepts::EdgeListGraph::~EdgeListGraph() [with G = boost::adjacency_list, boost::property >, boost::no_property, boost::listS>]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/graph_concepts.hpp:226:1: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::EdgeListGraphConcept, boost::property >, boost::no_property, boost::listS> >]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/bellman_ford_shortest_paths.hpp:97:5: required from ‘bool boost::bellman_ford_shortest_paths(EdgeListGraph&, Size, WeightMap, PredecessorMap, DistanceMap, BinaryFunction, BinaryPredicate, BellmanFordVisitor) [with EdgeListGraph = adjacency_list, property >, no_property, listS>; Size = long unsigned int; WeightMap = adj_list_edge_property_map >, edge_weight_t>; PredecessorMap = dummy_property_map; DistanceMap = vec_adj_list_vertex_property_map, property >, no_property, listS>, adjacency_list, property >, no_property, listS>*, double, double&, vertex_distance_t>; BinaryFunction = closed_plus; BinaryPredicate = std::less; BellmanFordVisitor = bellman_visitor<>]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/johnson_all_pairs_shortest.hpp:112:36: required from ‘bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, VertexID, Weight, const BinaryPredicate&, const BinaryFunction&, const Infinity&, DistanceZero) [with VertexAndEdgeListGraph = R_adjacency_list; DistanceMatrix = Basic2DMatrix; VertexID = vec_adj_list_vertex_id_map, long unsigned int>; Weight = adj_list_edge_property_map, edge_weight_t>; BinaryPredicate = std::less; BinaryFunction = closed_plus; Infinity = double; DistanceZero = double]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/johnson_all_pairs_shortest.hpp:164:48: required from ‘bool boost::detail::johnson_dispatch(VertexAndEdgeListGraph&, DistanceMatrix&, const boost::bgl_named_params&, Weight, VertexID) [with VertexAndEdgeListGraph = R_adjacency_list; DistanceMatrix = Basic2DMatrix; P = int; T = int; R = boost::no_property; Weight = boost::adj_list_edge_property_map, boost::edge_weight_t>; VertexID = boost::vec_adj_list_vertex_id_map, long unsigned int>]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/johnson_all_pairs_shortest.hpp:192:36: required from ‘bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&) [with VertexAndEdgeListGraph = R_adjacency_list; DistanceMatrix = Basic2DMatrix]’ sna.cpp:105:41: required from here /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::Assignable::~Assignable() [with TT = boost::detail::edge_desc_impl]’ 37 | ~model() | ^ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:145:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 145 | BOOST_CONCEPT_USAGE(Assignable) { | ^~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements >]’: /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:208:5: required from ‘struct boost::Convertible’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::Convertible]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied >::value’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:72:8: [ skipping 2 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/graph_concepts.hpp:226:1: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::EdgeListGraphConcept, boost::property >, boost::no_property, boost::listS> >]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/bellman_ford_shortest_paths.hpp:97:5: required from ‘bool boost::bellman_ford_shortest_paths(EdgeListGraph&, Size, WeightMap, PredecessorMap, DistanceMap, BinaryFunction, BinaryPredicate, BellmanFordVisitor) [with EdgeListGraph = adjacency_list, property >, no_property, listS>; Size = long unsigned int; WeightMap = adj_list_edge_property_map >, edge_weight_t>; PredecessorMap = dummy_property_map; DistanceMap = vec_adj_list_vertex_property_map, property >, no_property, listS>, adjacency_list, property >, no_property, listS>*, double, double&, vertex_distance_t>; BinaryFunction = closed_plus; BinaryPredicate = std::less; BellmanFordVisitor = bellman_visitor<>]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/johnson_all_pairs_shortest.hpp:112:36: required from ‘bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, VertexID, Weight, const BinaryPredicate&, const BinaryFunction&, const Infinity&, DistanceZero) [with VertexAndEdgeListGraph = R_adjacency_list; DistanceMatrix = Basic2DMatrix; VertexID = vec_adj_list_vertex_id_map, long unsigned int>; Weight = adj_list_edge_property_map, edge_weight_t>; BinaryPredicate = std::less; BinaryFunction = closed_plus; Infinity = double; DistanceZero = double]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/johnson_all_pairs_shortest.hpp:164:48: required from ‘bool boost::detail::johnson_dispatch(VertexAndEdgeListGraph&, DistanceMatrix&, const boost::bgl_named_params&, Weight, VertexID) [with VertexAndEdgeListGraph = R_adjacency_list; DistanceMatrix = Basic2DMatrix; P = int; T = int; R = boost::no_property; Weight = boost::adj_list_edge_property_map, boost::edge_weight_t>; VertexID = boost::vec_adj_list_vertex_id_map, long unsigned int>]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/johnson_all_pairs_shortest.hpp:192:36: required from ‘bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&) [with VertexAndEdgeListGraph = R_adjacency_list; DistanceMatrix = Basic2DMatrix]’ sna.cpp:105:41: required from here /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::Convertible]’ 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ^ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::Convertible]’: /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/graph_concepts.hpp:239:9: required from ‘boost::concepts::EdgeListGraph::~EdgeListGraph() [with G = boost::adjacency_list, boost::property >, boost::no_property, boost::listS>]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/graph_concepts.hpp:226:1: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::EdgeListGraphConcept, boost::property >, boost::no_property, boost::listS> >]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/bellman_ford_shortest_paths.hpp:97:5: required from ‘bool boost::bellman_ford_shortest_paths(EdgeListGraph&, Size, WeightMap, PredecessorMap, DistanceMap, BinaryFunction, BinaryPredicate, BellmanFordVisitor) [with EdgeListGraph = adjacency_list, property >, no_property, listS>; Size = long unsigned int; WeightMap = adj_list_edge_property_map >, edge_weight_t>; PredecessorMap = dummy_property_map; DistanceMap = vec_adj_list_vertex_property_map, property >, no_property, listS>, adjacency_list, property >, no_property, listS>*, double, double&, vertex_distance_t>; BinaryFunction = closed_plus; BinaryPredicate = std::less; BellmanFordVisitor = bellman_visitor<>]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/johnson_all_pairs_shortest.hpp:112:36: required from ‘bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, VertexID, Weight, const BinaryPredicate&, const BinaryFunction&, const Infinity&, DistanceZero) [with VertexAndEdgeListGraph = R_adjacency_list; DistanceMatrix = Basic2DMatrix; VertexID = vec_adj_list_vertex_id_map, long unsigned int>; Weight = adj_list_edge_property_map, edge_weight_t>; BinaryPredicate = std::less; BinaryFunction = closed_plus; Infinity = double; DistanceZero = double]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/johnson_all_pairs_shortest.hpp:164:48: required from ‘bool boost::detail::johnson_dispatch(VertexAndEdgeListGraph&, DistanceMatrix&, const boost::bgl_named_params&, Weight, VertexID) [with VertexAndEdgeListGraph = R_adjacency_list; DistanceMatrix = Basic2DMatrix; P = int; T = int; R = boost::no_property; Weight = boost::adj_list_edge_property_map, boost::edge_weight_t>; VertexID = boost::vec_adj_list_vertex_id_map, long unsigned int>]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/johnson_all_pairs_shortest.hpp:192:36: required from ‘bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&) [with VertexAndEdgeListGraph = R_adjacency_list; DistanceMatrix = Basic2DMatrix]’ sna.cpp:105:41: required from here /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::Convertible::~Convertible() [with X = boost::adj_list_dir_traversal_tag; Y = boost::edge_list_graph_tag]’ 37 | ~model() | ^ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:208:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 208 | BOOST_CONCEPT_USAGE(Convertible) { | ^~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements >]’: /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:208:5: required from ‘struct boost::Convertible’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:206:3: required from ‘struct boost::ConvertibleConcept’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::ConvertibleConcept]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied >::value’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:72:8: [ skipping 10 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_, boost::property >, boost::no_property, boost::listS>, boost::adjacency_list, boost::property >, boost::no_property, boost::listS>*, double, double&, boost::vertex_distance_t>, long unsigned int>)>’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/bellman_ford_shortest_paths.hpp:101:5: required from ‘bool boost::bellman_ford_shortest_paths(EdgeListGraph&, Size, WeightMap, PredecessorMap, DistanceMap, BinaryFunction, BinaryPredicate, BellmanFordVisitor) [with EdgeListGraph = adjacency_list, property >, no_property, listS>; Size = long unsigned int; WeightMap = adj_list_edge_property_map >, edge_weight_t>; PredecessorMap = dummy_property_map; DistanceMap = vec_adj_list_vertex_property_map, property >, no_property, listS>, adjacency_list, property >, no_property, listS>*, double, double&, vertex_distance_t>; BinaryFunction = closed_plus; BinaryPredicate = std::less; BellmanFordVisitor = bellman_visitor<>]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/johnson_all_pairs_shortest.hpp:112:36: required from ‘bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, VertexID, Weight, const BinaryPredicate&, const BinaryFunction&, const Infinity&, DistanceZero) [with VertexAndEdgeListGraph = R_adjacency_list; DistanceMatrix = Basic2DMatrix; VertexID = vec_adj_list_vertex_id_map, long unsigned int>; Weight = adj_list_edge_property_map, edge_weight_t>; BinaryPredicate = std::less; BinaryFunction = closed_plus; Infinity = double; DistanceZero = double]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/johnson_all_pairs_shortest.hpp:164:48: required from ‘bool boost::detail::johnson_dispatch(VertexAndEdgeListGraph&, DistanceMatrix&, const boost::bgl_named_params&, Weight, VertexID) [with VertexAndEdgeListGraph = R_adjacency_list; DistanceMatrix = Basic2DMatrix; P = int; T = int; R = boost::no_property; Weight = boost::adj_list_edge_property_map, boost::edge_weight_t>; VertexID = boost::vec_adj_list_vertex_id_map, long unsigned int>]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/johnson_all_pairs_shortest.hpp:192:36: required from ‘bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&) [with VertexAndEdgeListGraph = R_adjacency_list; DistanceMatrix = Basic2DMatrix]’ sna.cpp:105:41: required from here /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::Convertible]’ 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ^ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::ConvertibleConcept]’: /home/omnipath/local/R/4.4-3.20/BH/include/boost/property_map/property_map.hpp:180:7: required from ‘void boost::WritablePropertyMapConcept::constraints() [with PMap = boost::vec_adj_list_vertex_property_map, boost::property >, boost::no_property, boost::listS>, boost::adjacency_list, boost::property >, boost::no_property, boost::listS>*, double, double&, boost::vertex_distance_t>; Key = long unsigned int]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::WritablePropertyMapConcept, boost::property >, boost::no_property, boost::listS>, boost::adjacency_list, boost::property >, boost::no_property, boost::listS>*, double, double&, boost::vertex_distance_t>, long unsigned int>]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied, boost::property >, boost::no_property, boost::listS>, boost::adjacency_list, boost::property >, boost::no_property, boost::listS>*, double, double&, boost::vertex_distance_t>, long unsigned int> >::value’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied, boost::property >, boost::no_property, boost::listS>, boost::adjacency_list, boost::property >, boost::no_property, boost::listS>*, double, double&, boost::vertex_distance_t>, long unsigned int> >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_, boost::property >, boost::no_property, boost::listS>, boost::adjacency_list, boost::property >, boost::no_property, boost::listS>*, double, double&, boost::vertex_distance_t>, long unsigned int>)>’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/property_map/property_map.hpp:207:7: [ skipping 4 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_, boost::property >, boost::no_property, boost::listS>, boost::adjacency_list, boost::property >, boost::no_property, boost::listS>*, double, double&, boost::vertex_distance_t>, long unsigned int>)>’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/bellman_ford_shortest_paths.hpp:101:5: required from ‘bool boost::bellman_ford_shortest_paths(EdgeListGraph&, Size, WeightMap, PredecessorMap, DistanceMap, BinaryFunction, BinaryPredicate, BellmanFordVisitor) [with EdgeListGraph = adjacency_list, property >, no_property, listS>; Size = long unsigned int; WeightMap = adj_list_edge_property_map >, edge_weight_t>; PredecessorMap = dummy_property_map; DistanceMap = vec_adj_list_vertex_property_map, property >, no_property, listS>, adjacency_list, property >, no_property, listS>*, double, double&, vertex_distance_t>; BinaryFunction = closed_plus; BinaryPredicate = std::less; BellmanFordVisitor = bellman_visitor<>]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/johnson_all_pairs_shortest.hpp:112:36: required from ‘bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, VertexID, Weight, const BinaryPredicate&, const BinaryFunction&, const Infinity&, DistanceZero) [with VertexAndEdgeListGraph = R_adjacency_list; DistanceMatrix = Basic2DMatrix; VertexID = vec_adj_list_vertex_id_map, long unsigned int>; Weight = adj_list_edge_property_map, edge_weight_t>; BinaryPredicate = std::less; BinaryFunction = closed_plus; Infinity = double; DistanceZero = double]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/johnson_all_pairs_shortest.hpp:164:48: required from ‘bool boost::detail::johnson_dispatch(VertexAndEdgeListGraph&, DistanceMatrix&, const boost::bgl_named_params&, Weight, VertexID) [with VertexAndEdgeListGraph = R_adjacency_list; DistanceMatrix = Basic2DMatrix; P = int; T = int; R = boost::no_property; Weight = boost::adj_list_edge_property_map, boost::edge_weight_t>; VertexID = boost::vec_adj_list_vertex_id_map, long unsigned int>]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/johnson_all_pairs_shortest.hpp:192:36: required from ‘bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&) [with VertexAndEdgeListGraph = R_adjacency_list; DistanceMatrix = Basic2DMatrix]’ sna.cpp:105:41: required from here /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:206:17: note: in a call to non-static member function ‘boost::ConvertibleConcept::~ConvertibleConcept()’ 206 | BOOST_concept(Convertible,(X)(Y)) | ^~~~~~~~~~~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/preprocessor/cat.hpp:29:34: note: in definition of macro ‘BOOST_PP_CAT_I’ 29 | # define BOOST_PP_CAT_I(a, b) a ## b | ^ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/concept_def.hpp:23:12: note: in expansion of macro ‘BOOST_PP_CAT’ 23 | struct BOOST_PP_CAT(name,Concept) \ | ^~~~~~~~~~~~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:206:3: note: in expansion of macro ‘BOOST_concept’ 206 | BOOST_concept(Convertible,(X)(Y)) | ^~~~~~~~~~~~~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::Convertible]’: /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements >]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:208:5: required from ‘struct boost::Convertible’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:206:3: required from ‘struct boost::ConvertibleConcept’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::ConvertibleConcept]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied >::value’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:45:51: [ skipping 6 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_, boost::property >, boost::no_property, boost::listS>, boost::adjacency_list, boost::property >, boost::no_property, boost::listS>*, double, double&, boost::vertex_distance_t>, long unsigned int>)>’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/bellman_ford_shortest_paths.hpp:101:5: required from ‘bool boost::bellman_ford_shortest_paths(EdgeListGraph&, Size, WeightMap, PredecessorMap, DistanceMap, BinaryFunction, BinaryPredicate, BellmanFordVisitor) [with EdgeListGraph = adjacency_list, property >, no_property, listS>; Size = long unsigned int; WeightMap = adj_list_edge_property_map >, edge_weight_t>; PredecessorMap = dummy_property_map; DistanceMap = vec_adj_list_vertex_property_map, property >, no_property, listS>, adjacency_list, property >, no_property, listS>*, double, double&, vertex_distance_t>; BinaryFunction = closed_plus; BinaryPredicate = std::less; BellmanFordVisitor = bellman_visitor<>]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/johnson_all_pairs_shortest.hpp:112:36: required from ‘bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, VertexID, Weight, const BinaryPredicate&, const BinaryFunction&, const Infinity&, DistanceZero) [with VertexAndEdgeListGraph = R_adjacency_list; DistanceMatrix = Basic2DMatrix; VertexID = vec_adj_list_vertex_id_map, long unsigned int>; Weight = adj_list_edge_property_map, edge_weight_t>; BinaryPredicate = std::less; BinaryFunction = closed_plus; Infinity = double; DistanceZero = double]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/johnson_all_pairs_shortest.hpp:164:48: required from ‘bool boost::detail::johnson_dispatch(VertexAndEdgeListGraph&, DistanceMatrix&, const boost::bgl_named_params&, Weight, VertexID) [with VertexAndEdgeListGraph = R_adjacency_list; DistanceMatrix = Basic2DMatrix; P = int; T = int; R = boost::no_property; Weight = boost::adj_list_edge_property_map, boost::edge_weight_t>; VertexID = boost::vec_adj_list_vertex_id_map, long unsigned int>]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/johnson_all_pairs_shortest.hpp:192:36: required from ‘bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&) [with VertexAndEdgeListGraph = R_adjacency_list; DistanceMatrix = Basic2DMatrix]’ sna.cpp:105:41: required from here /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::Convertible::~Convertible() [with X = boost::lvalue_property_map_tag; Y = boost::read_write_property_map_tag]’ 37 | ~model() | ^ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:208:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 208 | BOOST_CONCEPT_USAGE(Convertible) { | ^~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::Convertible]’: /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements >]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:208:5: required from ‘struct boost::Convertible’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:206:3: required from ‘struct boost::ConvertibleConcept’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::ConvertibleConcept]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied >::value’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:45:51: [ skipping 6 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_ >, boost::edge_weight_t>, boost::detail::edge_desc_impl >)>’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/bellman_ford_shortest_paths.hpp:102:5: required from ‘bool boost::bellman_ford_shortest_paths(EdgeListGraph&, Size, WeightMap, PredecessorMap, DistanceMap, BinaryFunction, BinaryPredicate, BellmanFordVisitor) [with EdgeListGraph = adjacency_list, property >, no_property, listS>; Size = long unsigned int; WeightMap = adj_list_edge_property_map >, edge_weight_t>; PredecessorMap = dummy_property_map; DistanceMap = vec_adj_list_vertex_property_map, property >, no_property, listS>, adjacency_list, property >, no_property, listS>*, double, double&, vertex_distance_t>; BinaryFunction = closed_plus; BinaryPredicate = std::less; BellmanFordVisitor = bellman_visitor<>]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/johnson_all_pairs_shortest.hpp:112:36: required from ‘bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, VertexID, Weight, const BinaryPredicate&, const BinaryFunction&, const Infinity&, DistanceZero) [with VertexAndEdgeListGraph = R_adjacency_list; DistanceMatrix = Basic2DMatrix; VertexID = vec_adj_list_vertex_id_map, long unsigned int>; Weight = adj_list_edge_property_map, edge_weight_t>; BinaryPredicate = std::less; BinaryFunction = closed_plus; Infinity = double; DistanceZero = double]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/johnson_all_pairs_shortest.hpp:164:48: required from ‘bool boost::detail::johnson_dispatch(VertexAndEdgeListGraph&, DistanceMatrix&, const boost::bgl_named_params&, Weight, VertexID) [with VertexAndEdgeListGraph = R_adjacency_list; DistanceMatrix = Basic2DMatrix; P = int; T = int; R = boost::no_property; Weight = boost::adj_list_edge_property_map, boost::edge_weight_t>; VertexID = boost::vec_adj_list_vertex_id_map, long unsigned int>]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/johnson_all_pairs_shortest.hpp:192:36: required from ‘bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&) [with VertexAndEdgeListGraph = R_adjacency_list; DistanceMatrix = Basic2DMatrix]’ sna.cpp:105:41: required from here /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::Convertible::~Convertible() [with X = boost::lvalue_property_map_tag; Y = boost::readable_property_map_tag]’ 37 | ~model() | ^ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:208:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 208 | BOOST_CONCEPT_USAGE(Convertible) { | ^~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements >]’: /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:208:5: required from ‘struct boost::Convertible’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::Convertible]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied >::value’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:72:8: [ skipping 2 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:597:3: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator*, std::vector, std::allocator > > > >]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/property_map/property_map.hpp:354:5: required from ‘boost::iterator_property_map boost::make_iterator_property_map(RAIter, ID, Value) [with RAIter = __gnu_cxx::__normal_iterator*, std::vector, std::allocator > > >; Value = detail::edge_desc_impl; ID = vec_adj_list_vertex_id_map]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/edmonds_karp_max_flow.hpp:209:43: required from ‘static typename boost::detail::edge_capacity_value::type boost::detail::edmonds_karp_dispatch1::apply(Graph&, typename boost::graph_traits::vertex_descriptor, typename boost::graph_traits::vertex_descriptor, const boost::bgl_named_params&, boost::param_not_found) [with Graph = boost::adjacency_list > > > >; P = int; T = boost::buffer_param_t; R = boost::no_property; typename boost::detail::edge_capacity_value::type = double; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/edmonds_karp_max_flow.hpp:228:57: required from ‘typename boost::detail::edge_capacity_value::type boost::edmonds_karp_max_flow(Graph&, typename graph_traits::vertex_descriptor, typename graph_traits::vertex_descriptor, const bgl_named_params&) [with Graph = adjacency_list > > > >; P = int; T = buffer_param_t; R = no_property; typename detail::edge_capacity_value::type = double; typename graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/edmonds_karp_max_flow.hpp:240:33: required from ‘typename boost::property_traits::const_type>::value_type boost::edmonds_karp_max_flow(Graph&, typename graph_traits::vertex_descriptor, typename graph_traits::vertex_descriptor) [with Graph = adjacency_list > > > >; typename property_traits::const_type>::value_type = double; typename property_map::const_type = adj_list_edge_property_map > > >, edge_capacity_t>; typename graph_traits::vertex_descriptor = long unsigned int]’ sna.cpp:204:54: required from here /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::Convertible]’ 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ^ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::Convertible]’: /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:603:11: required from ‘boost::RandomAccessIterator::~RandomAccessIterator() [with TT = __gnu_cxx::__normal_iterator*, std::vector, std::allocator > > >]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:597:3: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator*, std::vector, std::allocator > > > >]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/property_map/property_map.hpp:354:5: required from ‘boost::iterator_property_map boost::make_iterator_property_map(RAIter, ID, Value) [with RAIter = __gnu_cxx::__normal_iterator*, std::vector, std::allocator > > >; Value = detail::edge_desc_impl; ID = vec_adj_list_vertex_id_map]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/edmonds_karp_max_flow.hpp:209:43: required from ‘static typename boost::detail::edge_capacity_value::type boost::detail::edmonds_karp_dispatch1::apply(Graph&, typename boost::graph_traits::vertex_descriptor, typename boost::graph_traits::vertex_descriptor, const boost::bgl_named_params&, boost::param_not_found) [with Graph = boost::adjacency_list > > > >; P = int; T = boost::buffer_param_t; R = boost::no_property; typename boost::detail::edge_capacity_value::type = double; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/edmonds_karp_max_flow.hpp:228:57: required from ‘typename boost::detail::edge_capacity_value::type boost::edmonds_karp_max_flow(Graph&, typename graph_traits::vertex_descriptor, typename graph_traits::vertex_descriptor, const bgl_named_params&) [with Graph = adjacency_list > > > >; P = int; T = buffer_param_t; R = no_property; typename detail::edge_capacity_value::type = double; typename graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/edmonds_karp_max_flow.hpp:240:33: required from ‘typename boost::property_traits::const_type>::value_type boost::edmonds_karp_max_flow(Graph&, typename graph_traits::vertex_descriptor, typename graph_traits::vertex_descriptor) [with Graph = adjacency_list > > > >; typename property_traits::const_type>::value_type = double; typename property_map::const_type = adj_list_edge_property_map > > >, edge_capacity_t>; typename graph_traits::vertex_descriptor = long unsigned int]’ sna.cpp:204:54: required from here /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::Convertible::~Convertible() [with X = std::random_access_iterator_tag; Y = std::random_access_iterator_tag]’ 37 | ~model() | ^ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:208:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 208 | BOOST_CONCEPT_USAGE(Convertible) { | ^~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::Assignable<__gnu_cxx::__normal_iterator > >]’: /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements > > >]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:145:5: required from ‘struct boost::Assignable<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:502:3: required from ‘struct boost::InputIterator<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:540:3: required from ‘struct boost::ForwardIterator<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:568:3: required from ‘struct boost::BidirectionalIterator<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:597:3: [ skipping 6 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.4-3.20/BH/include/boost/property_map/property_map.hpp:354:5: required from ‘boost::iterator_property_map boost::make_iterator_property_map(RAIter, ID, Value) [with RAIter = __gnu_cxx::__normal_iterator >; Value = default_color_type; ID = vec_adj_list_vertex_id_map]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/edmonds_karp_max_flow.hpp:161:43: required from ‘static typename boost::detail::edge_capacity_value::type boost::detail::edmonds_karp_dispatch2::apply(Graph&, typename boost::graph_traits::vertex_descriptor, typename boost::graph_traits::vertex_descriptor, PredMap, const boost::bgl_named_params&, boost::param_not_found) [with Graph = boost::adjacency_list > > > >; PredMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator*, std::vector, std::allocator > > >, boost::vec_adj_list_vertex_id_map, boost::detail::edge_desc_impl, boost::detail::edge_desc_impl&>; P = int; T = boost::buffer_param_t; R = boost::no_property; typename boost::detail::edge_capacity_value::type = double; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/edmonds_karp_max_flow.hpp:208:54: required from ‘static typename boost::detail::edge_capacity_value::type boost::detail::edmonds_karp_dispatch1::apply(Graph&, typename boost::graph_traits::vertex_descriptor, typename boost::graph_traits::vertex_descriptor, const boost::bgl_named_params&, boost::param_not_found) [with Graph = boost::adjacency_list > > > >; P = int; T = boost::buffer_param_t; R = boost::no_property; typename boost::detail::edge_capacity_value::type = double; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/edmonds_karp_max_flow.hpp:228:57: required from ‘typename boost::detail::edge_capacity_value::type boost::edmonds_karp_max_flow(Graph&, typename graph_traits::vertex_descriptor, typename graph_traits::vertex_descriptor, const bgl_named_params&) [with Graph = adjacency_list > > > >; P = int; T = buffer_param_t; R = no_property; typename detail::edge_capacity_value::type = double; typename graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/edmonds_karp_max_flow.hpp:240:33: required from ‘typename boost::property_traits::const_type>::value_type boost::edmonds_karp_max_flow(Graph&, typename graph_traits::vertex_descriptor, typename graph_traits::vertex_descriptor) [with Graph = adjacency_list > > > >; typename property_traits::const_type>::value_type = double; typename property_map::const_type = adj_list_edge_property_map > > >, edge_capacity_t>; typename graph_traits::vertex_descriptor = long unsigned int]’ sna.cpp:204:54: required from here /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::Assignable::~Assignable() [with TT = __gnu_cxx::__normal_iterator >]’ 37 | ~model() | ^ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:145:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 145 | BOOST_CONCEPT_USAGE(Assignable) { | ^~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::EqualityComparable<__gnu_cxx::__normal_iterator > >]’: /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements > > >]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:233:5: required from ‘struct boost::EqualityComparable<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:502:3: required from ‘struct boost::InputIterator<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:540:3: required from ‘struct boost::ForwardIterator<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:568:3: required from ‘struct boost::BidirectionalIterator<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:597:3: [ skipping 6 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.4-3.20/BH/include/boost/property_map/property_map.hpp:354:5: required from ‘boost::iterator_property_map boost::make_iterator_property_map(RAIter, ID, Value) [with RAIter = __gnu_cxx::__normal_iterator >; Value = default_color_type; ID = vec_adj_list_vertex_id_map]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/edmonds_karp_max_flow.hpp:161:43: required from ‘static typename boost::detail::edge_capacity_value::type boost::detail::edmonds_karp_dispatch2::apply(Graph&, typename boost::graph_traits::vertex_descriptor, typename boost::graph_traits::vertex_descriptor, PredMap, const boost::bgl_named_params&, boost::param_not_found) [with Graph = boost::adjacency_list > > > >; PredMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator*, std::vector, std::allocator > > >, boost::vec_adj_list_vertex_id_map, boost::detail::edge_desc_impl, boost::detail::edge_desc_impl&>; P = int; T = boost::buffer_param_t; R = boost::no_property; typename boost::detail::edge_capacity_value::type = double; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/edmonds_karp_max_flow.hpp:208:54: required from ‘static typename boost::detail::edge_capacity_value::type boost::detail::edmonds_karp_dispatch1::apply(Graph&, typename boost::graph_traits::vertex_descriptor, typename boost::graph_traits::vertex_descriptor, const boost::bgl_named_params&, boost::param_not_found) [with Graph = boost::adjacency_list > > > >; P = int; T = boost::buffer_param_t; R = boost::no_property; typename boost::detail::edge_capacity_value::type = double; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/edmonds_karp_max_flow.hpp:228:57: required from ‘typename boost::detail::edge_capacity_value::type boost::edmonds_karp_max_flow(Graph&, typename graph_traits::vertex_descriptor, typename graph_traits::vertex_descriptor, const bgl_named_params&) [with Graph = adjacency_list > > > >; P = int; T = buffer_param_t; R = no_property; typename detail::edge_capacity_value::type = double; typename graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/edmonds_karp_max_flow.hpp:240:33: required from ‘typename boost::property_traits::const_type>::value_type boost::edmonds_karp_max_flow(Graph&, typename graph_traits::vertex_descriptor, typename graph_traits::vertex_descriptor) [with Graph = adjacency_list > > > >; typename property_traits::const_type>::value_type = double; typename property_map::const_type = adj_list_edge_property_map > > >, edge_capacity_t>; typename graph_traits::vertex_descriptor = long unsigned int]’ sna.cpp:204:54: required from here /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::EqualityComparable::~EqualityComparable() [with TT = __gnu_cxx::__normal_iterator >]’ 37 | ~model() | ^ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:233:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 233 | BOOST_CONCEPT_USAGE(EqualityComparable) { | ^~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::InputIterator<__gnu_cxx::__normal_iterator > >]’: /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements > > >]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:512:7: required from ‘struct boost::InputIterator<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:540:3: required from ‘struct boost::ForwardIterator<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:568:3: required from ‘struct boost::BidirectionalIterator<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:597:3: required from ‘struct boost::RandomAccessIterator<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:597:3: [ skipping 5 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.4-3.20/BH/include/boost/property_map/property_map.hpp:354:5: required from ‘boost::iterator_property_map boost::make_iterator_property_map(RAIter, ID, Value) [with RAIter = __gnu_cxx::__normal_iterator >; Value = default_color_type; ID = vec_adj_list_vertex_id_map]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/edmonds_karp_max_flow.hpp:161:43: required from ‘static typename boost::detail::edge_capacity_value::type boost::detail::edmonds_karp_dispatch2::apply(Graph&, typename boost::graph_traits::vertex_descriptor, typename boost::graph_traits::vertex_descriptor, PredMap, const boost::bgl_named_params&, boost::param_not_found) [with Graph = boost::adjacency_list > > > >; PredMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator*, std::vector, std::allocator > > >, boost::vec_adj_list_vertex_id_map, boost::detail::edge_desc_impl, boost::detail::edge_desc_impl&>; P = int; T = boost::buffer_param_t; R = boost::no_property; typename boost::detail::edge_capacity_value::type = double; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/edmonds_karp_max_flow.hpp:208:54: required from ‘static typename boost::detail::edge_capacity_value::type boost::detail::edmonds_karp_dispatch1::apply(Graph&, typename boost::graph_traits::vertex_descriptor, typename boost::graph_traits::vertex_descriptor, const boost::bgl_named_params&, boost::param_not_found) [with Graph = boost::adjacency_list > > > >; P = int; T = boost::buffer_param_t; R = boost::no_property; typename boost::detail::edge_capacity_value::type = double; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/edmonds_karp_max_flow.hpp:228:57: required from ‘typename boost::detail::edge_capacity_value::type boost::edmonds_karp_max_flow(Graph&, typename graph_traits::vertex_descriptor, typename graph_traits::vertex_descriptor, const bgl_named_params&) [with Graph = adjacency_list > > > >; P = int; T = buffer_param_t; R = no_property; typename detail::edge_capacity_value::type = double; typename graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/edmonds_karp_max_flow.hpp:240:33: required from ‘typename boost::property_traits::const_type>::value_type boost::edmonds_karp_max_flow(Graph&, typename graph_traits::vertex_descriptor, typename graph_traits::vertex_descriptor) [with Graph = adjacency_list > > > >; typename property_traits::const_type>::value_type = double; typename property_map::const_type = adj_list_edge_property_map > > >, edge_capacity_t>; typename graph_traits::vertex_descriptor = long unsigned int]’ sna.cpp:204:54: required from here /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::InputIterator::~InputIterator() [with TT = __gnu_cxx::__normal_iterator >]’ 37 | ~model() | ^ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:512:7: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 512 | BOOST_CONCEPT_USAGE(InputIterator) | ^~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::ForwardIterator<__gnu_cxx::__normal_iterator > >]’: /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements > > >]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:543:7: required from ‘struct boost::ForwardIterator<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:568:3: required from ‘struct boost::BidirectionalIterator<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:597:3: required from ‘struct boost::RandomAccessIterator<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:597:3: required from ‘struct boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:32:62: [ skipping 4 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.4-3.20/BH/include/boost/property_map/property_map.hpp:354:5: required from ‘boost::iterator_property_map boost::make_iterator_property_map(RAIter, ID, Value) [with RAIter = __gnu_cxx::__normal_iterator >; Value = default_color_type; ID = vec_adj_list_vertex_id_map]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/edmonds_karp_max_flow.hpp:161:43: required from ‘static typename boost::detail::edge_capacity_value::type boost::detail::edmonds_karp_dispatch2::apply(Graph&, typename boost::graph_traits::vertex_descriptor, typename boost::graph_traits::vertex_descriptor, PredMap, const boost::bgl_named_params&, boost::param_not_found) [with Graph = boost::adjacency_list > > > >; PredMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator*, std::vector, std::allocator > > >, boost::vec_adj_list_vertex_id_map, boost::detail::edge_desc_impl, boost::detail::edge_desc_impl&>; P = int; T = boost::buffer_param_t; R = boost::no_property; typename boost::detail::edge_capacity_value::type = double; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/edmonds_karp_max_flow.hpp:208:54: required from ‘static typename boost::detail::edge_capacity_value::type boost::detail::edmonds_karp_dispatch1::apply(Graph&, typename boost::graph_traits::vertex_descriptor, typename boost::graph_traits::vertex_descriptor, const boost::bgl_named_params&, boost::param_not_found) [with Graph = boost::adjacency_list > > > >; P = int; T = boost::buffer_param_t; R = boost::no_property; typename boost::detail::edge_capacity_value::type = double; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/edmonds_karp_max_flow.hpp:228:57: required from ‘typename boost::detail::edge_capacity_value::type boost::edmonds_karp_max_flow(Graph&, typename graph_traits::vertex_descriptor, typename graph_traits::vertex_descriptor, const bgl_named_params&) [with Graph = adjacency_list > > > >; P = int; T = buffer_param_t; R = no_property; typename detail::edge_capacity_value::type = double; typename graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/edmonds_karp_max_flow.hpp:240:33: required from ‘typename boost::property_traits::const_type>::value_type boost::edmonds_karp_max_flow(Graph&, typename graph_traits::vertex_descriptor, typename graph_traits::vertex_descriptor) [with Graph = adjacency_list > > > >; typename property_traits::const_type>::value_type = double; typename property_map::const_type = adj_list_edge_property_map > > >, edge_capacity_t>; typename graph_traits::vertex_descriptor = long unsigned int]’ sna.cpp:204:54: required from here /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::ForwardIterator::~ForwardIterator() [with TT = __gnu_cxx::__normal_iterator >]’ 37 | ~model() | ^ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:543:7: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 543 | BOOST_CONCEPT_USAGE(ForwardIterator) | ^~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::BidirectionalIterator<__gnu_cxx::__normal_iterator > >]’: /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements > > >]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:571:7: required from ‘struct boost::BidirectionalIterator<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:597:3: required from ‘struct boost::RandomAccessIterator<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:597:3: required from ‘struct boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator > >]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:42:5: [ skipping 3 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.4-3.20/BH/include/boost/property_map/property_map.hpp:354:5: required from ‘boost::iterator_property_map boost::make_iterator_property_map(RAIter, ID, Value) [with RAIter = __gnu_cxx::__normal_iterator >; Value = default_color_type; ID = vec_adj_list_vertex_id_map]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/edmonds_karp_max_flow.hpp:161:43: required from ‘static typename boost::detail::edge_capacity_value::type boost::detail::edmonds_karp_dispatch2::apply(Graph&, typename boost::graph_traits::vertex_descriptor, typename boost::graph_traits::vertex_descriptor, PredMap, const boost::bgl_named_params&, boost::param_not_found) [with Graph = boost::adjacency_list > > > >; PredMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator*, std::vector, std::allocator > > >, boost::vec_adj_list_vertex_id_map, boost::detail::edge_desc_impl, boost::detail::edge_desc_impl&>; P = int; T = boost::buffer_param_t; R = boost::no_property; typename boost::detail::edge_capacity_value::type = double; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/edmonds_karp_max_flow.hpp:208:54: required from ‘static typename boost::detail::edge_capacity_value::type boost::detail::edmonds_karp_dispatch1::apply(Graph&, typename boost::graph_traits::vertex_descriptor, typename boost::graph_traits::vertex_descriptor, const boost::bgl_named_params&, boost::param_not_found) [with Graph = boost::adjacency_list > > > >; P = int; T = boost::buffer_param_t; R = boost::no_property; typename boost::detail::edge_capacity_value::type = double; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/edmonds_karp_max_flow.hpp:228:57: required from ‘typename boost::detail::edge_capacity_value::type boost::edmonds_karp_max_flow(Graph&, typename graph_traits::vertex_descriptor, typename graph_traits::vertex_descriptor, const bgl_named_params&) [with Graph = adjacency_list > > > >; P = int; T = buffer_param_t; R = no_property; typename detail::edge_capacity_value::type = double; typename graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/edmonds_karp_max_flow.hpp:240:33: required from ‘typename boost::property_traits::const_type>::value_type boost::edmonds_karp_max_flow(Graph&, typename graph_traits::vertex_descriptor, typename graph_traits::vertex_descriptor) [with Graph = adjacency_list > > > >; typename property_traits::const_type>::value_type = double; typename property_map::const_type = adj_list_edge_property_map > > >, edge_capacity_t>; typename graph_traits::vertex_descriptor = long unsigned int]’ sna.cpp:204:54: required from here /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::BidirectionalIterator::~BidirectionalIterator() [with TT = __gnu_cxx::__normal_iterator >]’ 37 | ~model() | ^ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:571:7: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 571 | BOOST_CONCEPT_USAGE(BidirectionalIterator) | ^~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::Comparable<__gnu_cxx::__normal_iterator > >]’: /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements > > >]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:253:5: required from ‘struct boost::Comparable<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:597:3: required from ‘struct boost::RandomAccessIterator<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:597:3: required from ‘struct boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator > >]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:42:5: [ skipping 3 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.4-3.20/BH/include/boost/property_map/property_map.hpp:354:5: required from ‘boost::iterator_property_map boost::make_iterator_property_map(RAIter, ID, Value) [with RAIter = __gnu_cxx::__normal_iterator >; Value = default_color_type; ID = vec_adj_list_vertex_id_map]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/edmonds_karp_max_flow.hpp:161:43: required from ‘static typename boost::detail::edge_capacity_value::type boost::detail::edmonds_karp_dispatch2::apply(Graph&, typename boost::graph_traits::vertex_descriptor, typename boost::graph_traits::vertex_descriptor, PredMap, const boost::bgl_named_params&, boost::param_not_found) [with Graph = boost::adjacency_list > > > >; PredMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator*, std::vector, std::allocator > > >, boost::vec_adj_list_vertex_id_map, boost::detail::edge_desc_impl, boost::detail::edge_desc_impl&>; P = int; T = boost::buffer_param_t; R = boost::no_property; typename boost::detail::edge_capacity_value::type = double; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/edmonds_karp_max_flow.hpp:208:54: required from ‘static typename boost::detail::edge_capacity_value::type boost::detail::edmonds_karp_dispatch1::apply(Graph&, typename boost::graph_traits::vertex_descriptor, typename boost::graph_traits::vertex_descriptor, const boost::bgl_named_params&, boost::param_not_found) [with Graph = boost::adjacency_list > > > >; P = int; T = boost::buffer_param_t; R = boost::no_property; typename boost::detail::edge_capacity_value::type = double; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/edmonds_karp_max_flow.hpp:228:57: required from ‘typename boost::detail::edge_capacity_value::type boost::edmonds_karp_max_flow(Graph&, typename graph_traits::vertex_descriptor, typename graph_traits::vertex_descriptor, const bgl_named_params&) [with Graph = adjacency_list > > > >; P = int; T = buffer_param_t; R = no_property; typename detail::edge_capacity_value::type = double; typename graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/edmonds_karp_max_flow.hpp:240:33: required from ‘typename boost::property_traits::const_type>::value_type boost::edmonds_karp_max_flow(Graph&, typename graph_traits::vertex_descriptor, typename graph_traits::vertex_descriptor) [with Graph = adjacency_list > > > >; typename property_traits::const_type>::value_type = double; typename property_map::const_type = adj_list_edge_property_map > > >, edge_capacity_t>; typename graph_traits::vertex_descriptor = long unsigned int]’ sna.cpp:204:54: required from here /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::Comparable::~Comparable() [with TT = __gnu_cxx::__normal_iterator >]’ 37 | ~model() | ^ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:253:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 253 | BOOST_CONCEPT_USAGE(Comparable) { | ^~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::RandomAccessIterator<__gnu_cxx::__normal_iterator > >]’: /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements > > >]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:601:7: required from ‘struct boost::RandomAccessIterator<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:597:3: required from ‘struct boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator > >]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied > > >::value’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:45:51: [ skipping 2 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.4-3.20/BH/include/boost/property_map/property_map.hpp:354:5: required from ‘boost::iterator_property_map boost::make_iterator_property_map(RAIter, ID, Value) [with RAIter = __gnu_cxx::__normal_iterator >; Value = default_color_type; ID = vec_adj_list_vertex_id_map]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/edmonds_karp_max_flow.hpp:161:43: required from ‘static typename boost::detail::edge_capacity_value::type boost::detail::edmonds_karp_dispatch2::apply(Graph&, typename boost::graph_traits::vertex_descriptor, typename boost::graph_traits::vertex_descriptor, PredMap, const boost::bgl_named_params&, boost::param_not_found) [with Graph = boost::adjacency_list > > > >; PredMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator*, std::vector, std::allocator > > >, boost::vec_adj_list_vertex_id_map, boost::detail::edge_desc_impl, boost::detail::edge_desc_impl&>; P = int; T = boost::buffer_param_t; R = boost::no_property; typename boost::detail::edge_capacity_value::type = double; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/edmonds_karp_max_flow.hpp:208:54: required from ‘static typename boost::detail::edge_capacity_value::type boost::detail::edmonds_karp_dispatch1::apply(Graph&, typename boost::graph_traits::vertex_descriptor, typename boost::graph_traits::vertex_descriptor, const boost::bgl_named_params&, boost::param_not_found) [with Graph = boost::adjacency_list > > > >; P = int; T = boost::buffer_param_t; R = boost::no_property; typename boost::detail::edge_capacity_value::type = double; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/edmonds_karp_max_flow.hpp:228:57: required from ‘typename boost::detail::edge_capacity_value::type boost::edmonds_karp_max_flow(Graph&, typename graph_traits::vertex_descriptor, typename graph_traits::vertex_descriptor, const bgl_named_params&) [with Graph = adjacency_list > > > >; P = int; T = buffer_param_t; R = no_property; typename detail::edge_capacity_value::type = double; typename graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/edmonds_karp_max_flow.hpp:240:33: required from ‘typename boost::property_traits::const_type>::value_type boost::edmonds_karp_max_flow(Graph&, typename graph_traits::vertex_descriptor, typename graph_traits::vertex_descriptor) [with Graph = adjacency_list > > > >; typename property_traits::const_type>::value_type = double; typename property_map::const_type = adj_list_edge_property_map > > >, edge_capacity_t>; typename graph_traits::vertex_descriptor = long unsigned int]’ sna.cpp:204:54: required from here /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::RandomAccessIterator::~RandomAccessIterator() [with TT = __gnu_cxx::__normal_iterator >]’ 37 | ~model() | ^ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:601:7: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 601 | BOOST_CONCEPT_USAGE(RandomAccessIterator) | ^~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements >]’: /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:137:5: required from ‘struct boost::DefaultConstructible’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::DefaultConstructible]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied >::value’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_)>’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/graph_concepts.hpp:68:9: [ skipping 9 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_, boost::property >, boost::no_property, boost::listS> >)>’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/bellman_ford_shortest_paths.hpp:97:5: required from ‘bool boost::bellman_ford_shortest_paths(EdgeListGraph&, Size, WeightMap, PredecessorMap, DistanceMap, BinaryFunction, BinaryPredicate, BellmanFordVisitor) [with EdgeListGraph = adjacency_list, property >, no_property, listS>; Size = long unsigned int; WeightMap = adj_list_edge_property_map >, edge_weight_t>; PredecessorMap = dummy_property_map; DistanceMap = vec_adj_list_vertex_property_map, property >, no_property, listS>, adjacency_list, property >, no_property, listS>*, double, double&, vertex_distance_t>; BinaryFunction = closed_plus; BinaryPredicate = std::less; BellmanFordVisitor = bellman_visitor<>]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/johnson_all_pairs_shortest.hpp:112:36: required from ‘bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, VertexID, Weight, const BinaryPredicate&, const BinaryFunction&, const Infinity&, DistanceZero) [with VertexAndEdgeListGraph = R_adjacency_list; DistanceMatrix = Basic2DMatrix; VertexID = vec_adj_list_vertex_id_map, long unsigned int>; Weight = adj_list_edge_property_map, edge_weight_t>; BinaryPredicate = std::less; BinaryFunction = closed_plus; Infinity = double; DistanceZero = double]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/johnson_all_pairs_shortest.hpp:164:48: required from ‘bool boost::detail::johnson_dispatch(VertexAndEdgeListGraph&, DistanceMatrix&, const boost::bgl_named_params&, Weight, VertexID) [with VertexAndEdgeListGraph = R_adjacency_list; DistanceMatrix = Basic2DMatrix; P = int; T = int; R = boost::no_property; Weight = boost::adj_list_edge_property_map, boost::edge_weight_t>; VertexID = boost::vec_adj_list_vertex_id_map, long unsigned int>]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/johnson_all_pairs_shortest.hpp:192:36: required from ‘bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&) [with VertexAndEdgeListGraph = R_adjacency_list; DistanceMatrix = Basic2DMatrix]’ sna.cpp:105:41: required from here /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::DefaultConstructible]’ 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ^ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::DefaultConstructible]’: /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/graph_concepts.hpp:68:9: required from ‘boost::concepts::Graph::~Graph() [with G = boost::adjacency_list, boost::property >, boost::no_property, boost::listS>]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/usage.hpp:20:48: required from ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::concepts::Graph, boost::property >, boost::no_property, boost::listS> >]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements, boost::property >, boost::no_property, boost::listS> > >]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/graph_concepts.hpp:66:5: required from ‘struct boost::concepts::Graph, boost::property >, boost::no_property, boost::listS> >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/graph_concepts.hpp:226:1: required from ‘struct boost::concepts::EdgeListGraph, boost::property >, boost::no_property, boost::listS> >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/graph_concepts.hpp:226:1: [ skipping 4 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_, boost::property >, boost::no_property, boost::listS> >)>’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/bellman_ford_shortest_paths.hpp:97:5: required from ‘bool boost::bellman_ford_shortest_paths(EdgeListGraph&, Size, WeightMap, PredecessorMap, DistanceMap, BinaryFunction, BinaryPredicate, BellmanFordVisitor) [with EdgeListGraph = adjacency_list, property >, no_property, listS>; Size = long unsigned int; WeightMap = adj_list_edge_property_map >, edge_weight_t>; PredecessorMap = dummy_property_map; DistanceMap = vec_adj_list_vertex_property_map, property >, no_property, listS>, adjacency_list, property >, no_property, listS>*, double, double&, vertex_distance_t>; BinaryFunction = closed_plus; BinaryPredicate = std::less; BellmanFordVisitor = bellman_visitor<>]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/johnson_all_pairs_shortest.hpp:112:36: required from ‘bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, VertexID, Weight, const BinaryPredicate&, const BinaryFunction&, const Infinity&, DistanceZero) [with VertexAndEdgeListGraph = R_adjacency_list; DistanceMatrix = Basic2DMatrix; VertexID = vec_adj_list_vertex_id_map, long unsigned int>; Weight = adj_list_edge_property_map, edge_weight_t>; BinaryPredicate = std::less; BinaryFunction = closed_plus; Infinity = double; DistanceZero = double]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/johnson_all_pairs_shortest.hpp:164:48: required from ‘bool boost::detail::johnson_dispatch(VertexAndEdgeListGraph&, DistanceMatrix&, const boost::bgl_named_params&, Weight, VertexID) [with VertexAndEdgeListGraph = R_adjacency_list; DistanceMatrix = Basic2DMatrix; P = int; T = int; R = boost::no_property; Weight = boost::adj_list_edge_property_map, boost::edge_weight_t>; VertexID = boost::vec_adj_list_vertex_id_map, long unsigned int>]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/johnson_all_pairs_shortest.hpp:192:36: required from ‘bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&) [with VertexAndEdgeListGraph = R_adjacency_list; DistanceMatrix = Basic2DMatrix]’ sna.cpp:105:41: required from here /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::DefaultConstructible::~DefaultConstructible() [with TT = long unsigned int]’ 37 | ~model() | ^ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:137:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 137 | BOOST_CONCEPT_USAGE(DefaultConstructible) { | ^~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements >]’: /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:233:5: required from ‘struct boost::EqualityComparable’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::EqualityComparable]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied >::value’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_)>’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/graph_concepts.hpp:69:9: [ skipping 9 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_, boost::property >, boost::no_property, boost::listS> >)>’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/bellman_ford_shortest_paths.hpp:97:5: required from ‘bool boost::bellman_ford_shortest_paths(EdgeListGraph&, Size, WeightMap, PredecessorMap, DistanceMap, BinaryFunction, BinaryPredicate, BellmanFordVisitor) [with EdgeListGraph = adjacency_list, property >, no_property, listS>; Size = long unsigned int; WeightMap = adj_list_edge_property_map >, edge_weight_t>; PredecessorMap = dummy_property_map; DistanceMap = vec_adj_list_vertex_property_map, property >, no_property, listS>, adjacency_list, property >, no_property, listS>*, double, double&, vertex_distance_t>; BinaryFunction = closed_plus; BinaryPredicate = std::less; BellmanFordVisitor = bellman_visitor<>]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/johnson_all_pairs_shortest.hpp:112:36: required from ‘bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, VertexID, Weight, const BinaryPredicate&, const BinaryFunction&, const Infinity&, DistanceZero) [with VertexAndEdgeListGraph = R_adjacency_list; DistanceMatrix = Basic2DMatrix; VertexID = vec_adj_list_vertex_id_map, long unsigned int>; Weight = adj_list_edge_property_map, edge_weight_t>; BinaryPredicate = std::less; BinaryFunction = closed_plus; Infinity = double; DistanceZero = double]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/johnson_all_pairs_shortest.hpp:164:48: required from ‘bool boost::detail::johnson_dispatch(VertexAndEdgeListGraph&, DistanceMatrix&, const boost::bgl_named_params&, Weight, VertexID) [with VertexAndEdgeListGraph = R_adjacency_list; DistanceMatrix = Basic2DMatrix; P = int; T = int; R = boost::no_property; Weight = boost::adj_list_edge_property_map, boost::edge_weight_t>; VertexID = boost::vec_adj_list_vertex_id_map, long unsigned int>]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/johnson_all_pairs_shortest.hpp:192:36: required from ‘bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&) [with VertexAndEdgeListGraph = R_adjacency_list; DistanceMatrix = Basic2DMatrix]’ sna.cpp:105:41: required from here /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::EqualityComparable]’ 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ^ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::EqualityComparable]’: /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/graph_concepts.hpp:69:9: required from ‘boost::concepts::Graph::~Graph() [with G = boost::adjacency_list, boost::property >, boost::no_property, boost::listS>]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/usage.hpp:20:48: required from ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::concepts::Graph, boost::property >, boost::no_property, boost::listS> >]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements, boost::property >, boost::no_property, boost::listS> > >]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/graph_concepts.hpp:66:5: required from ‘struct boost::concepts::Graph, boost::property >, boost::no_property, boost::listS> >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/graph_concepts.hpp:226:1: required from ‘struct boost::concepts::EdgeListGraph, boost::property >, boost::no_property, boost::listS> >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/graph_concepts.hpp:226:1: [ skipping 4 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_, boost::property >, boost::no_property, boost::listS> >)>’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/bellman_ford_shortest_paths.hpp:97:5: required from ‘bool boost::bellman_ford_shortest_paths(EdgeListGraph&, Size, WeightMap, PredecessorMap, DistanceMap, BinaryFunction, BinaryPredicate, BellmanFordVisitor) [with EdgeListGraph = adjacency_list, property >, no_property, listS>; Size = long unsigned int; WeightMap = adj_list_edge_property_map >, edge_weight_t>; PredecessorMap = dummy_property_map; DistanceMap = vec_adj_list_vertex_property_map, property >, no_property, listS>, adjacency_list, property >, no_property, listS>*, double, double&, vertex_distance_t>; BinaryFunction = closed_plus; BinaryPredicate = std::less; BellmanFordVisitor = bellman_visitor<>]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/johnson_all_pairs_shortest.hpp:112:36: required from ‘bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, VertexID, Weight, const BinaryPredicate&, const BinaryFunction&, const Infinity&, DistanceZero) [with VertexAndEdgeListGraph = R_adjacency_list; DistanceMatrix = Basic2DMatrix; VertexID = vec_adj_list_vertex_id_map, long unsigned int>; Weight = adj_list_edge_property_map, edge_weight_t>; BinaryPredicate = std::less; BinaryFunction = closed_plus; Infinity = double; DistanceZero = double]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/johnson_all_pairs_shortest.hpp:164:48: required from ‘bool boost::detail::johnson_dispatch(VertexAndEdgeListGraph&, DistanceMatrix&, const boost::bgl_named_params&, Weight, VertexID) [with VertexAndEdgeListGraph = R_adjacency_list; DistanceMatrix = Basic2DMatrix; P = int; T = int; R = boost::no_property; Weight = boost::adj_list_edge_property_map, boost::edge_weight_t>; VertexID = boost::vec_adj_list_vertex_id_map, long unsigned int>]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/johnson_all_pairs_shortest.hpp:192:36: required from ‘bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&) [with VertexAndEdgeListGraph = R_adjacency_list; DistanceMatrix = Basic2DMatrix]’ sna.cpp:105:41: required from here /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::EqualityComparable::~EqualityComparable() [with TT = long unsigned int]’ 37 | ~model() | ^ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:233:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 233 | BOOST_CONCEPT_USAGE(EqualityComparable) { | ^~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements >]’: /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:145:5: required from ‘struct boost::Assignable’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::Assignable]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied >::value’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_)>’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/graph_concepts.hpp:70:9: [ skipping 9 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_, boost::property >, boost::no_property, boost::listS> >)>’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/bellman_ford_shortest_paths.hpp:97:5: required from ‘bool boost::bellman_ford_shortest_paths(EdgeListGraph&, Size, WeightMap, PredecessorMap, DistanceMap, BinaryFunction, BinaryPredicate, BellmanFordVisitor) [with EdgeListGraph = adjacency_list, property >, no_property, listS>; Size = long unsigned int; WeightMap = adj_list_edge_property_map >, edge_weight_t>; PredecessorMap = dummy_property_map; DistanceMap = vec_adj_list_vertex_property_map, property >, no_property, listS>, adjacency_list, property >, no_property, listS>*, double, double&, vertex_distance_t>; BinaryFunction = closed_plus; BinaryPredicate = std::less; BellmanFordVisitor = bellman_visitor<>]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/johnson_all_pairs_shortest.hpp:112:36: required from ‘bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, VertexID, Weight, const BinaryPredicate&, const BinaryFunction&, const Infinity&, DistanceZero) [with VertexAndEdgeListGraph = R_adjacency_list; DistanceMatrix = Basic2DMatrix; VertexID = vec_adj_list_vertex_id_map, long unsigned int>; Weight = adj_list_edge_property_map, edge_weight_t>; BinaryPredicate = std::less; BinaryFunction = closed_plus; Infinity = double; DistanceZero = double]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/johnson_all_pairs_shortest.hpp:164:48: required from ‘bool boost::detail::johnson_dispatch(VertexAndEdgeListGraph&, DistanceMatrix&, const boost::bgl_named_params&, Weight, VertexID) [with VertexAndEdgeListGraph = R_adjacency_list; DistanceMatrix = Basic2DMatrix; P = int; T = int; R = boost::no_property; Weight = boost::adj_list_edge_property_map, boost::edge_weight_t>; VertexID = boost::vec_adj_list_vertex_id_map, long unsigned int>]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/johnson_all_pairs_shortest.hpp:192:36: required from ‘bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&) [with VertexAndEdgeListGraph = R_adjacency_list; DistanceMatrix = Basic2DMatrix]’ sna.cpp:105:41: required from here /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::Assignable]’ 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ^ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::Assignable]’: /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/graph_concepts.hpp:70:9: required from ‘boost::concepts::Graph::~Graph() [with G = boost::adjacency_list, boost::property >, boost::no_property, boost::listS>]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/usage.hpp:20:48: required from ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::concepts::Graph, boost::property >, boost::no_property, boost::listS> >]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements, boost::property >, boost::no_property, boost::listS> > >]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/graph_concepts.hpp:66:5: required from ‘struct boost::concepts::Graph, boost::property >, boost::no_property, boost::listS> >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/graph_concepts.hpp:226:1: required from ‘struct boost::concepts::EdgeListGraph, boost::property >, boost::no_property, boost::listS> >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/graph_concepts.hpp:226:1: [ skipping 4 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_, boost::property >, boost::no_property, boost::listS> >)>’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/bellman_ford_shortest_paths.hpp:97:5: required from ‘bool boost::bellman_ford_shortest_paths(EdgeListGraph&, Size, WeightMap, PredecessorMap, DistanceMap, BinaryFunction, BinaryPredicate, BellmanFordVisitor) [with EdgeListGraph = adjacency_list, property >, no_property, listS>; Size = long unsigned int; WeightMap = adj_list_edge_property_map >, edge_weight_t>; PredecessorMap = dummy_property_map; DistanceMap = vec_adj_list_vertex_property_map, property >, no_property, listS>, adjacency_list, property >, no_property, listS>*, double, double&, vertex_distance_t>; BinaryFunction = closed_plus; BinaryPredicate = std::less; BellmanFordVisitor = bellman_visitor<>]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/johnson_all_pairs_shortest.hpp:112:36: required from ‘bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, VertexID, Weight, const BinaryPredicate&, const BinaryFunction&, const Infinity&, DistanceZero) [with VertexAndEdgeListGraph = R_adjacency_list; DistanceMatrix = Basic2DMatrix; VertexID = vec_adj_list_vertex_id_map, long unsigned int>; Weight = adj_list_edge_property_map, edge_weight_t>; BinaryPredicate = std::less; BinaryFunction = closed_plus; Infinity = double; DistanceZero = double]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/johnson_all_pairs_shortest.hpp:164:48: required from ‘bool boost::detail::johnson_dispatch(VertexAndEdgeListGraph&, DistanceMatrix&, const boost::bgl_named_params&, Weight, VertexID) [with VertexAndEdgeListGraph = R_adjacency_list; DistanceMatrix = Basic2DMatrix; P = int; T = int; R = boost::no_property; Weight = boost::adj_list_edge_property_map, boost::edge_weight_t>; VertexID = boost::vec_adj_list_vertex_id_map, long unsigned int>]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/johnson_all_pairs_shortest.hpp:192:36: required from ‘bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&) [with VertexAndEdgeListGraph = R_adjacency_list; DistanceMatrix = Basic2DMatrix]’ sna.cpp:105:41: required from here /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::Assignable::~Assignable() [with TT = long unsigned int]’ 37 | ~model() | ^ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:145:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 145 | BOOST_CONCEPT_USAGE(Assignable) { | ^~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::concepts::MultiPassInputIterator, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::adjacency_list, boost::property >, boost::no_property, boost::listS> > >]’: /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::adjacency_list, boost::property >, boost::no_property, boost::listS> > > >]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/graph_concepts.hpp:52:50: required from ‘struct boost::concepts::MultiPassInputIterator, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::adjacency_list, boost::property >, boost::no_property, boost::listS> > >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::concepts::MultiPassInputIterator, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::adjacency_list, boost::property >, boost::no_property, boost::listS> > >]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::adjacency_list, boost::property >, boost::no_property, boost::listS> > > >::value’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::adjacency_list, boost::property >, boost::no_property, boost::listS> > > >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:72:8: [ skipping 2 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/graph_concepts.hpp:226:1: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::EdgeListGraphConcept, boost::property >, boost::no_property, boost::listS> >]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/bellman_ford_shortest_paths.hpp:97:5: required from ‘bool boost::bellman_ford_shortest_paths(EdgeListGraph&, Size, WeightMap, PredecessorMap, DistanceMap, BinaryFunction, BinaryPredicate, BellmanFordVisitor) [with EdgeListGraph = adjacency_list, property >, no_property, listS>; Size = long unsigned int; WeightMap = adj_list_edge_property_map >, edge_weight_t>; PredecessorMap = dummy_property_map; DistanceMap = vec_adj_list_vertex_property_map, property >, no_property, listS>, adjacency_list, property >, no_property, listS>*, double, double&, vertex_distance_t>; BinaryFunction = closed_plus; BinaryPredicate = std::less; BellmanFordVisitor = bellman_visitor<>]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/johnson_all_pairs_shortest.hpp:112:36: required from ‘bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, VertexID, Weight, const BinaryPredicate&, const BinaryFunction&, const Infinity&, DistanceZero) [with VertexAndEdgeListGraph = R_adjacency_list; DistanceMatrix = Basic2DMatrix; VertexID = vec_adj_list_vertex_id_map, long unsigned int>; Weight = adj_list_edge_property_map, edge_weight_t>; BinaryPredicate = std::less; BinaryFunction = closed_plus; Infinity = double; DistanceZero = double]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/johnson_all_pairs_shortest.hpp:164:48: required from ‘bool boost::detail::johnson_dispatch(VertexAndEdgeListGraph&, DistanceMatrix&, const boost::bgl_named_params&, Weight, VertexID) [with VertexAndEdgeListGraph = R_adjacency_list; DistanceMatrix = Basic2DMatrix; P = int; T = int; R = boost::no_property; Weight = boost::adj_list_edge_property_map, boost::edge_weight_t>; VertexID = boost::vec_adj_list_vertex_id_map, long unsigned int>]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/johnson_all_pairs_shortest.hpp:192:36: required from ‘bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&) [with VertexAndEdgeListGraph = R_adjacency_list; DistanceMatrix = Basic2DMatrix]’ sna.cpp:105:41: required from here /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::concepts::MultiPassInputIterator::~MultiPassInputIterator() [with T = boost::detail::adj_list_edge_iterator, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::adjacency_list, boost::property >, boost::no_property, boost::listS> >]’ 37 | ~model() | ^ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/graph_concepts.hpp:52:50: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 52 | BOOST_concept(MultiPassInputIterator, (T)) { BOOST_CONCEPT_USAGE( | ^~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::DefaultConstructible >]’: /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements > >]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:137:5: required from ‘struct boost::DefaultConstructible >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::DefaultConstructible >]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied > >::value’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied > >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:72:8: [ skipping 2 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/graph_concepts.hpp:226:1: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::EdgeListGraphConcept, boost::property >, boost::no_property, boost::listS> >]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/bellman_ford_shortest_paths.hpp:97:5: required from ‘bool boost::bellman_ford_shortest_paths(EdgeListGraph&, Size, WeightMap, PredecessorMap, DistanceMap, BinaryFunction, BinaryPredicate, BellmanFordVisitor) [with EdgeListGraph = adjacency_list, property >, no_property, listS>; Size = long unsigned int; WeightMap = adj_list_edge_property_map >, edge_weight_t>; PredecessorMap = dummy_property_map; DistanceMap = vec_adj_list_vertex_property_map, property >, no_property, listS>, adjacency_list, property >, no_property, listS>*, double, double&, vertex_distance_t>; BinaryFunction = closed_plus; BinaryPredicate = std::less; BellmanFordVisitor = bellman_visitor<>]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/johnson_all_pairs_shortest.hpp:112:36: required from ‘bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, VertexID, Weight, const BinaryPredicate&, const BinaryFunction&, const Infinity&, DistanceZero) [with VertexAndEdgeListGraph = R_adjacency_list; DistanceMatrix = Basic2DMatrix; VertexID = vec_adj_list_vertex_id_map, long unsigned int>; Weight = adj_list_edge_property_map, edge_weight_t>; BinaryPredicate = std::less; BinaryFunction = closed_plus; Infinity = double; DistanceZero = double]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/johnson_all_pairs_shortest.hpp:164:48: required from ‘bool boost::detail::johnson_dispatch(VertexAndEdgeListGraph&, DistanceMatrix&, const boost::bgl_named_params&, Weight, VertexID) [with VertexAndEdgeListGraph = R_adjacency_list; DistanceMatrix = Basic2DMatrix; P = int; T = int; R = boost::no_property; Weight = boost::adj_list_edge_property_map, boost::edge_weight_t>; VertexID = boost::vec_adj_list_vertex_id_map, long unsigned int>]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/johnson_all_pairs_shortest.hpp:192:36: required from ‘bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&) [with VertexAndEdgeListGraph = R_adjacency_list; DistanceMatrix = Basic2DMatrix]’ sna.cpp:105:41: required from here /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::DefaultConstructible::~DefaultConstructible() [with TT = boost::detail::edge_desc_impl]’ 37 | ~model() | ^ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:137:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 137 | BOOST_CONCEPT_USAGE(DefaultConstructible) { | ^~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::EqualityComparable >]’: /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements > >]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:233:5: required from ‘struct boost::EqualityComparable >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::EqualityComparable >]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied > >::value’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied > >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:72:8: [ skipping 2 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/graph_concepts.hpp:226:1: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::EdgeListGraphConcept, boost::property >, boost::no_property, boost::listS> >]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/bellman_ford_shortest_paths.hpp:97:5: required from ‘bool boost::bellman_ford_shortest_paths(EdgeListGraph&, Size, WeightMap, PredecessorMap, DistanceMap, BinaryFunction, BinaryPredicate, BellmanFordVisitor) [with EdgeListGraph = adjacency_list, property >, no_property, listS>; Size = long unsigned int; WeightMap = adj_list_edge_property_map >, edge_weight_t>; PredecessorMap = dummy_property_map; DistanceMap = vec_adj_list_vertex_property_map, property >, no_property, listS>, adjacency_list, property >, no_property, listS>*, double, double&, vertex_distance_t>; BinaryFunction = closed_plus; BinaryPredicate = std::less; BellmanFordVisitor = bellman_visitor<>]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/johnson_all_pairs_shortest.hpp:112:36: required from ‘bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, VertexID, Weight, const BinaryPredicate&, const BinaryFunction&, const Infinity&, DistanceZero) [with VertexAndEdgeListGraph = R_adjacency_list; DistanceMatrix = Basic2DMatrix; VertexID = vec_adj_list_vertex_id_map, long unsigned int>; Weight = adj_list_edge_property_map, edge_weight_t>; BinaryPredicate = std::less; BinaryFunction = closed_plus; Infinity = double; DistanceZero = double]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/johnson_all_pairs_shortest.hpp:164:48: required from ‘bool boost::detail::johnson_dispatch(VertexAndEdgeListGraph&, DistanceMatrix&, const boost::bgl_named_params&, Weight, VertexID) [with VertexAndEdgeListGraph = R_adjacency_list; DistanceMatrix = Basic2DMatrix; P = int; T = int; R = boost::no_property; Weight = boost::adj_list_edge_property_map, boost::edge_weight_t>; VertexID = boost::vec_adj_list_vertex_id_map, long unsigned int>]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/johnson_all_pairs_shortest.hpp:192:36: required from ‘bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&) [with VertexAndEdgeListGraph = R_adjacency_list; DistanceMatrix = Basic2DMatrix]’ sna.cpp:105:41: required from here /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::EqualityComparable::~EqualityComparable() [with TT = boost::detail::edge_desc_impl]’ 37 | ~model() | ^ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:233:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 233 | BOOST_CONCEPT_USAGE(EqualityComparable) { | ^~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::Assignable >]’: /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements > >]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:145:5: required from ‘struct boost::Assignable >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::Assignable >]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied > >::value’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied > >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:72:8: [ skipping 2 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/graph_concepts.hpp:226:1: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::EdgeListGraphConcept, boost::property >, boost::no_property, boost::listS> >]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/bellman_ford_shortest_paths.hpp:97:5: required from ‘bool boost::bellman_ford_shortest_paths(EdgeListGraph&, Size, WeightMap, PredecessorMap, DistanceMap, BinaryFunction, BinaryPredicate, BellmanFordVisitor) [with EdgeListGraph = adjacency_list, property >, no_property, listS>; Size = long unsigned int; WeightMap = adj_list_edge_property_map >, edge_weight_t>; PredecessorMap = dummy_property_map; DistanceMap = vec_adj_list_vertex_property_map, property >, no_property, listS>, adjacency_list, property >, no_property, listS>*, double, double&, vertex_distance_t>; BinaryFunction = closed_plus; BinaryPredicate = std::less; BellmanFordVisitor = bellman_visitor<>]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/johnson_all_pairs_shortest.hpp:112:36: required from ‘bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, VertexID, Weight, const BinaryPredicate&, const BinaryFunction&, const Infinity&, DistanceZero) [with VertexAndEdgeListGraph = R_adjacency_list; DistanceMatrix = Basic2DMatrix; VertexID = vec_adj_list_vertex_id_map, long unsigned int>; Weight = adj_list_edge_property_map, edge_weight_t>; BinaryPredicate = std::less; BinaryFunction = closed_plus; Infinity = double; DistanceZero = double]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/johnson_all_pairs_shortest.hpp:164:48: required from ‘bool boost::detail::johnson_dispatch(VertexAndEdgeListGraph&, DistanceMatrix&, const boost::bgl_named_params&, Weight, VertexID) [with VertexAndEdgeListGraph = R_adjacency_list; DistanceMatrix = Basic2DMatrix; P = int; T = int; R = boost::no_property; Weight = boost::adj_list_edge_property_map, boost::edge_weight_t>; VertexID = boost::vec_adj_list_vertex_id_map, long unsigned int>]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/johnson_all_pairs_shortest.hpp:192:36: required from ‘bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&) [with VertexAndEdgeListGraph = R_adjacency_list; DistanceMatrix = Basic2DMatrix]’ sna.cpp:105:41: required from here /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::Assignable::~Assignable() [with TT = boost::detail::edge_desc_impl]’ 37 | ~model() | ^ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:145:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 145 | BOOST_CONCEPT_USAGE(Assignable) { | ^~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::Convertible]’: /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements >]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:208:5: required from ‘struct boost::Convertible’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::Convertible]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied >::value’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:72:8: [ skipping 2 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/graph_concepts.hpp:226:1: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::EdgeListGraphConcept, boost::property >, boost::no_property, boost::listS> >]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/bellman_ford_shortest_paths.hpp:97:5: required from ‘bool boost::bellman_ford_shortest_paths(EdgeListGraph&, Size, WeightMap, PredecessorMap, DistanceMap, BinaryFunction, BinaryPredicate, BellmanFordVisitor) [with EdgeListGraph = adjacency_list, property >, no_property, listS>; Size = long unsigned int; WeightMap = adj_list_edge_property_map >, edge_weight_t>; PredecessorMap = dummy_property_map; DistanceMap = vec_adj_list_vertex_property_map, property >, no_property, listS>, adjacency_list, property >, no_property, listS>*, double, double&, vertex_distance_t>; BinaryFunction = closed_plus; BinaryPredicate = std::less; BellmanFordVisitor = bellman_visitor<>]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/johnson_all_pairs_shortest.hpp:112:36: required from ‘bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, VertexID, Weight, const BinaryPredicate&, const BinaryFunction&, const Infinity&, DistanceZero) [with VertexAndEdgeListGraph = R_adjacency_list; DistanceMatrix = Basic2DMatrix; VertexID = vec_adj_list_vertex_id_map, long unsigned int>; Weight = adj_list_edge_property_map, edge_weight_t>; BinaryPredicate = std::less; BinaryFunction = closed_plus; Infinity = double; DistanceZero = double]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/johnson_all_pairs_shortest.hpp:164:48: required from ‘bool boost::detail::johnson_dispatch(VertexAndEdgeListGraph&, DistanceMatrix&, const boost::bgl_named_params&, Weight, VertexID) [with VertexAndEdgeListGraph = R_adjacency_list; DistanceMatrix = Basic2DMatrix; P = int; T = int; R = boost::no_property; Weight = boost::adj_list_edge_property_map, boost::edge_weight_t>; VertexID = boost::vec_adj_list_vertex_id_map, long unsigned int>]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/johnson_all_pairs_shortest.hpp:192:36: required from ‘bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&) [with VertexAndEdgeListGraph = R_adjacency_list; DistanceMatrix = Basic2DMatrix]’ sna.cpp:105:41: required from here /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::Convertible::~Convertible() [with X = boost::adj_list_dir_traversal_tag; Y = boost::edge_list_graph_tag]’ 37 | ~model() | ^ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:208:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 208 | BOOST_CONCEPT_USAGE(Convertible) { | ^~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::Convertible]’: /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements >]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:208:5: required from ‘struct boost::Convertible’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:206:3: required from ‘struct boost::ConvertibleConcept’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::ConvertibleConcept]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied >::value’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:45:51: [ skipping 11 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_, boost::property >, boost::no_property, boost::listS>, boost::adjacency_list, boost::property >, boost::no_property, boost::listS>*, double, double&, boost::vertex_distance_t>, long unsigned int>)>’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/bellman_ford_shortest_paths.hpp:101:5: required from ‘bool boost::bellman_ford_shortest_paths(EdgeListGraph&, Size, WeightMap, PredecessorMap, DistanceMap, BinaryFunction, BinaryPredicate, BellmanFordVisitor) [with EdgeListGraph = adjacency_list, property >, no_property, listS>; Size = long unsigned int; WeightMap = adj_list_edge_property_map >, edge_weight_t>; PredecessorMap = dummy_property_map; DistanceMap = vec_adj_list_vertex_property_map, property >, no_property, listS>, adjacency_list, property >, no_property, listS>*, double, double&, vertex_distance_t>; BinaryFunction = closed_plus; BinaryPredicate = std::less; BellmanFordVisitor = bellman_visitor<>]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/johnson_all_pairs_shortest.hpp:112:36: required from ‘bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, VertexID, Weight, const BinaryPredicate&, const BinaryFunction&, const Infinity&, DistanceZero) [with VertexAndEdgeListGraph = R_adjacency_list; DistanceMatrix = Basic2DMatrix; VertexID = vec_adj_list_vertex_id_map, long unsigned int>; Weight = adj_list_edge_property_map, edge_weight_t>; BinaryPredicate = std::less; BinaryFunction = closed_plus; Infinity = double; DistanceZero = double]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/johnson_all_pairs_shortest.hpp:164:48: required from ‘bool boost::detail::johnson_dispatch(VertexAndEdgeListGraph&, DistanceMatrix&, const boost::bgl_named_params&, Weight, VertexID) [with VertexAndEdgeListGraph = R_adjacency_list; DistanceMatrix = Basic2DMatrix; P = int; T = int; R = boost::no_property; Weight = boost::adj_list_edge_property_map, boost::edge_weight_t>; VertexID = boost::vec_adj_list_vertex_id_map, long unsigned int>]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/johnson_all_pairs_shortest.hpp:192:36: required from ‘bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&) [with VertexAndEdgeListGraph = R_adjacency_list; DistanceMatrix = Basic2DMatrix]’ sna.cpp:105:41: required from here /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::Convertible::~Convertible() [with X = boost::lvalue_property_map_tag; Y = boost::writable_property_map_tag]’ 37 | ~model() | ^ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:208:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 208 | BOOST_CONCEPT_USAGE(Convertible) { | ^~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::SignedInteger]’: /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:514:9: required from ‘boost::InputIterator::~InputIterator() [with TT = __gnu_cxx::__normal_iterator*, std::vector, std::allocator > > >]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/usage.hpp:20:48: required from ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::InputIterator<__gnu_cxx::__normal_iterator*, std::vector, std::allocator > > > >]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements*, std::vector, std::allocator > > > > >]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:512:7: required from ‘struct boost::InputIterator<__gnu_cxx::__normal_iterator*, std::vector, std::allocator > > > >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:540:3: required from ‘struct boost::ForwardIterator<__gnu_cxx::__normal_iterator*, std::vector, std::allocator > > > >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:568:3: [ skipping 6 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_*, std::vector, std::allocator > > > >)>’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/property_map/property_map.hpp:354:5: required from ‘boost::iterator_property_map boost::make_iterator_property_map(RAIter, ID, Value) [with RAIter = __gnu_cxx::__normal_iterator*, std::vector, std::allocator > > >; Value = detail::edge_desc_impl; ID = vec_adj_list_vertex_id_map]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/edmonds_karp_max_flow.hpp:209:43: required from ‘static typename boost::detail::edge_capacity_value::type boost::detail::edmonds_karp_dispatch1::apply(Graph&, typename boost::graph_traits::vertex_descriptor, typename boost::graph_traits::vertex_descriptor, const boost::bgl_named_params&, boost::param_not_found) [with Graph = boost::adjacency_list > > > >; P = int; T = boost::buffer_param_t; R = boost::no_property; typename boost::detail::edge_capacity_value::type = double; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/edmonds_karp_max_flow.hpp:228:57: required from ‘typename boost::detail::edge_capacity_value::type boost::edmonds_karp_max_flow(Graph&, typename graph_traits::vertex_descriptor, typename graph_traits::vertex_descriptor, const bgl_named_params&) [with Graph = adjacency_list > > > >; P = int; T = buffer_param_t; R = no_property; typename detail::edge_capacity_value::type = double; typename graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/edmonds_karp_max_flow.hpp:240:33: required from ‘typename boost::property_traits::const_type>::value_type boost::edmonds_karp_max_flow(Graph&, typename graph_traits::vertex_descriptor, typename graph_traits::vertex_descriptor) [with Graph = adjacency_list > > > >; typename property_traits::const_type>::value_type = double; typename property_map::const_type = adj_list_edge_property_map > > >, edge_capacity_t>; typename graph_traits::vertex_descriptor = long unsigned int]’ sna.cpp:204:54: required from here /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:107:22: note: in a call to non-static member function ‘boost::SignedInteger::~SignedInteger()’ 107 | template <> struct SignedInteger {}; | ^~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements >]’: /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:208:5: required from ‘struct boost::Convertible’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::Convertible]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied >::value’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_)>’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:515:9: [ skipping 11 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_*, std::vector, std::allocator > > > >)>’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/property_map/property_map.hpp:354:5: required from ‘boost::iterator_property_map boost::make_iterator_property_map(RAIter, ID, Value) [with RAIter = __gnu_cxx::__normal_iterator*, std::vector, std::allocator > > >; Value = detail::edge_desc_impl; ID = vec_adj_list_vertex_id_map]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/edmonds_karp_max_flow.hpp:209:43: required from ‘static typename boost::detail::edge_capacity_value::type boost::detail::edmonds_karp_dispatch1::apply(Graph&, typename boost::graph_traits::vertex_descriptor, typename boost::graph_traits::vertex_descriptor, const boost::bgl_named_params&, boost::param_not_found) [with Graph = boost::adjacency_list > > > >; P = int; T = boost::buffer_param_t; R = boost::no_property; typename boost::detail::edge_capacity_value::type = double; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/edmonds_karp_max_flow.hpp:228:57: required from ‘typename boost::detail::edge_capacity_value::type boost::edmonds_karp_max_flow(Graph&, typename graph_traits::vertex_descriptor, typename graph_traits::vertex_descriptor, const bgl_named_params&) [with Graph = adjacency_list > > > >; P = int; T = buffer_param_t; R = no_property; typename detail::edge_capacity_value::type = double; typename graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/edmonds_karp_max_flow.hpp:240:33: required from ‘typename boost::property_traits::const_type>::value_type boost::edmonds_karp_max_flow(Graph&, typename graph_traits::vertex_descriptor, typename graph_traits::vertex_descriptor) [with Graph = adjacency_list > > > >; typename property_traits::const_type>::value_type = double; typename property_map::const_type = adj_list_edge_property_map > > >, edge_capacity_t>; typename graph_traits::vertex_descriptor = long unsigned int]’ sna.cpp:204:54: required from here /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::Convertible]’ 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ^ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::Convertible]’: /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:515:9: required from ‘boost::InputIterator::~InputIterator() [with TT = __gnu_cxx::__normal_iterator*, std::vector, std::allocator > > >]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/usage.hpp:20:48: required from ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::InputIterator<__gnu_cxx::__normal_iterator*, std::vector, std::allocator > > > >]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements*, std::vector, std::allocator > > > > >]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:512:7: required from ‘struct boost::InputIterator<__gnu_cxx::__normal_iterator*, std::vector, std::allocator > > > >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:540:3: required from ‘struct boost::ForwardIterator<__gnu_cxx::__normal_iterator*, std::vector, std::allocator > > > >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:568:3: [ skipping 6 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_*, std::vector, std::allocator > > > >)>’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/property_map/property_map.hpp:354:5: required from ‘boost::iterator_property_map boost::make_iterator_property_map(RAIter, ID, Value) [with RAIter = __gnu_cxx::__normal_iterator*, std::vector, std::allocator > > >; Value = detail::edge_desc_impl; ID = vec_adj_list_vertex_id_map]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/edmonds_karp_max_flow.hpp:209:43: required from ‘static typename boost::detail::edge_capacity_value::type boost::detail::edmonds_karp_dispatch1::apply(Graph&, typename boost::graph_traits::vertex_descriptor, typename boost::graph_traits::vertex_descriptor, const boost::bgl_named_params&, boost::param_not_found) [with Graph = boost::adjacency_list > > > >; P = int; T = boost::buffer_param_t; R = boost::no_property; typename boost::detail::edge_capacity_value::type = double; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/edmonds_karp_max_flow.hpp:228:57: required from ‘typename boost::detail::edge_capacity_value::type boost::edmonds_karp_max_flow(Graph&, typename graph_traits::vertex_descriptor, typename graph_traits::vertex_descriptor, const bgl_named_params&) [with Graph = adjacency_list > > > >; P = int; T = buffer_param_t; R = no_property; typename detail::edge_capacity_value::type = double; typename graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/edmonds_karp_max_flow.hpp:240:33: required from ‘typename boost::property_traits::const_type>::value_type boost::edmonds_karp_max_flow(Graph&, typename graph_traits::vertex_descriptor, typename graph_traits::vertex_descriptor) [with Graph = adjacency_list > > > >; typename property_traits::const_type>::value_type = double; typename property_map::const_type = adj_list_edge_property_map > > >, edge_capacity_t>; typename graph_traits::vertex_descriptor = long unsigned int]’ sna.cpp:204:54: required from here /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::Convertible::~Convertible() [with X = std::random_access_iterator_tag; Y = std::input_iterator_tag]’ 37 | ~model() | ^ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:208:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 208 | BOOST_CONCEPT_USAGE(Convertible) { | ^~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements >]’: /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:208:5: required from ‘struct boost::Convertible’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::Convertible]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied >::value’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_)>’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:545:11: [ skipping 10 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_*, std::vector, std::allocator > > > >)>’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/property_map/property_map.hpp:354:5: required from ‘boost::iterator_property_map boost::make_iterator_property_map(RAIter, ID, Value) [with RAIter = __gnu_cxx::__normal_iterator*, std::vector, std::allocator > > >; Value = detail::edge_desc_impl; ID = vec_adj_list_vertex_id_map]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/edmonds_karp_max_flow.hpp:209:43: required from ‘static typename boost::detail::edge_capacity_value::type boost::detail::edmonds_karp_dispatch1::apply(Graph&, typename boost::graph_traits::vertex_descriptor, typename boost::graph_traits::vertex_descriptor, const boost::bgl_named_params&, boost::param_not_found) [with Graph = boost::adjacency_list > > > >; P = int; T = boost::buffer_param_t; R = boost::no_property; typename boost::detail::edge_capacity_value::type = double; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/edmonds_karp_max_flow.hpp:228:57: required from ‘typename boost::detail::edge_capacity_value::type boost::edmonds_karp_max_flow(Graph&, typename graph_traits::vertex_descriptor, typename graph_traits::vertex_descriptor, const bgl_named_params&) [with Graph = adjacency_list > > > >; P = int; T = buffer_param_t; R = no_property; typename detail::edge_capacity_value::type = double; typename graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/edmonds_karp_max_flow.hpp:240:33: required from ‘typename boost::property_traits::const_type>::value_type boost::edmonds_karp_max_flow(Graph&, typename graph_traits::vertex_descriptor, typename graph_traits::vertex_descriptor) [with Graph = adjacency_list > > > >; typename property_traits::const_type>::value_type = double; typename property_map::const_type = adj_list_edge_property_map > > >, edge_capacity_t>; typename graph_traits::vertex_descriptor = long unsigned int]’ sna.cpp:204:54: required from here /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::Convertible]’ 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ^ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::Convertible]’: /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:545:11: required from ‘boost::ForwardIterator::~ForwardIterator() [with TT = __gnu_cxx::__normal_iterator*, std::vector, std::allocator > > >]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/usage.hpp:20:48: required from ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::ForwardIterator<__gnu_cxx::__normal_iterator*, std::vector, std::allocator > > > >]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements*, std::vector, std::allocator > > > > >]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:543:7: required from ‘struct boost::ForwardIterator<__gnu_cxx::__normal_iterator*, std::vector, std::allocator > > > >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:568:3: required from ‘struct boost::BidirectionalIterator<__gnu_cxx::__normal_iterator*, std::vector, std::allocator > > > >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:597:3: [ skipping 5 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_*, std::vector, std::allocator > > > >)>’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/property_map/property_map.hpp:354:5: required from ‘boost::iterator_property_map boost::make_iterator_property_map(RAIter, ID, Value) [with RAIter = __gnu_cxx::__normal_iterator*, std::vector, std::allocator > > >; Value = detail::edge_desc_impl; ID = vec_adj_list_vertex_id_map]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/edmonds_karp_max_flow.hpp:209:43: required from ‘static typename boost::detail::edge_capacity_value::type boost::detail::edmonds_karp_dispatch1::apply(Graph&, typename boost::graph_traits::vertex_descriptor, typename boost::graph_traits::vertex_descriptor, const boost::bgl_named_params&, boost::param_not_found) [with Graph = boost::adjacency_list > > > >; P = int; T = boost::buffer_param_t; R = boost::no_property; typename boost::detail::edge_capacity_value::type = double; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/edmonds_karp_max_flow.hpp:228:57: required from ‘typename boost::detail::edge_capacity_value::type boost::edmonds_karp_max_flow(Graph&, typename graph_traits::vertex_descriptor, typename graph_traits::vertex_descriptor, const bgl_named_params&) [with Graph = adjacency_list > > > >; P = int; T = buffer_param_t; R = no_property; typename detail::edge_capacity_value::type = double; typename graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/edmonds_karp_max_flow.hpp:240:33: required from ‘typename boost::property_traits::const_type>::value_type boost::edmonds_karp_max_flow(Graph&, typename graph_traits::vertex_descriptor, typename graph_traits::vertex_descriptor) [with Graph = adjacency_list > > > >; typename property_traits::const_type>::value_type = double; typename property_map::const_type = adj_list_edge_property_map > > >, edge_capacity_t>; typename graph_traits::vertex_descriptor = long unsigned int]’ sna.cpp:204:54: required from here /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::Convertible::~Convertible() [with X = std::random_access_iterator_tag; Y = std::forward_iterator_tag]’ 37 | ~model() | ^ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:208:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 208 | BOOST_CONCEPT_USAGE(Convertible) { | ^~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements >]’: /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:208:5: required from ‘struct boost::Convertible’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::Convertible]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied >::value’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_)>’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:573:11: [ skipping 9 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_*, std::vector, std::allocator > > > >)>’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/property_map/property_map.hpp:354:5: required from ‘boost::iterator_property_map boost::make_iterator_property_map(RAIter, ID, Value) [with RAIter = __gnu_cxx::__normal_iterator*, std::vector, std::allocator > > >; Value = detail::edge_desc_impl; ID = vec_adj_list_vertex_id_map]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/edmonds_karp_max_flow.hpp:209:43: required from ‘static typename boost::detail::edge_capacity_value::type boost::detail::edmonds_karp_dispatch1::apply(Graph&, typename boost::graph_traits::vertex_descriptor, typename boost::graph_traits::vertex_descriptor, const boost::bgl_named_params&, boost::param_not_found) [with Graph = boost::adjacency_list > > > >; P = int; T = boost::buffer_param_t; R = boost::no_property; typename boost::detail::edge_capacity_value::type = double; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/edmonds_karp_max_flow.hpp:228:57: required from ‘typename boost::detail::edge_capacity_value::type boost::edmonds_karp_max_flow(Graph&, typename graph_traits::vertex_descriptor, typename graph_traits::vertex_descriptor, const bgl_named_params&) [with Graph = adjacency_list > > > >; P = int; T = buffer_param_t; R = no_property; typename detail::edge_capacity_value::type = double; typename graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/edmonds_karp_max_flow.hpp:240:33: required from ‘typename boost::property_traits::const_type>::value_type boost::edmonds_karp_max_flow(Graph&, typename graph_traits::vertex_descriptor, typename graph_traits::vertex_descriptor) [with Graph = adjacency_list > > > >; typename property_traits::const_type>::value_type = double; typename property_map::const_type = adj_list_edge_property_map > > >, edge_capacity_t>; typename graph_traits::vertex_descriptor = long unsigned int]’ sna.cpp:204:54: required from here /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::Convertible]’ 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ^ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::Convertible]’: /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:573:11: required from ‘boost::BidirectionalIterator::~BidirectionalIterator() [with TT = __gnu_cxx::__normal_iterator*, std::vector, std::allocator > > >]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/usage.hpp:20:48: required from ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::BidirectionalIterator<__gnu_cxx::__normal_iterator*, std::vector, std::allocator > > > >]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements*, std::vector, std::allocator > > > > >]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:571:7: required from ‘struct boost::BidirectionalIterator<__gnu_cxx::__normal_iterator*, std::vector, std::allocator > > > >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:597:3: required from ‘struct boost::RandomAccessIterator<__gnu_cxx::__normal_iterator*, std::vector, std::allocator > > > >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:597:3: [ skipping 4 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_*, std::vector, std::allocator > > > >)>’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/property_map/property_map.hpp:354:5: required from ‘boost::iterator_property_map boost::make_iterator_property_map(RAIter, ID, Value) [with RAIter = __gnu_cxx::__normal_iterator*, std::vector, std::allocator > > >; Value = detail::edge_desc_impl; ID = vec_adj_list_vertex_id_map]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/edmonds_karp_max_flow.hpp:209:43: required from ‘static typename boost::detail::edge_capacity_value::type boost::detail::edmonds_karp_dispatch1::apply(Graph&, typename boost::graph_traits::vertex_descriptor, typename boost::graph_traits::vertex_descriptor, const boost::bgl_named_params&, boost::param_not_found) [with Graph = boost::adjacency_list > > > >; P = int; T = boost::buffer_param_t; R = boost::no_property; typename boost::detail::edge_capacity_value::type = double; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/edmonds_karp_max_flow.hpp:228:57: required from ‘typename boost::detail::edge_capacity_value::type boost::edmonds_karp_max_flow(Graph&, typename graph_traits::vertex_descriptor, typename graph_traits::vertex_descriptor, const bgl_named_params&) [with Graph = adjacency_list > > > >; P = int; T = buffer_param_t; R = no_property; typename detail::edge_capacity_value::type = double; typename graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/edmonds_karp_max_flow.hpp:240:33: required from ‘typename boost::property_traits::const_type>::value_type boost::edmonds_karp_max_flow(Graph&, typename graph_traits::vertex_descriptor, typename graph_traits::vertex_descriptor) [with Graph = adjacency_list > > > >; typename property_traits::const_type>::value_type = double; typename property_map::const_type = adj_list_edge_property_map > > >, edge_capacity_t>; typename graph_traits::vertex_descriptor = long unsigned int]’ sna.cpp:204:54: required from here /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::Convertible::~Convertible() [with X = std::random_access_iterator_tag; Y = std::bidirectional_iterator_tag]’ 37 | ~model() | ^ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:208:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 208 | BOOST_CONCEPT_USAGE(Convertible) { | ^~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::Convertible]’: /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements >]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:208:5: required from ‘struct boost::Convertible’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::Convertible]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied >::value’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:72:8: [ skipping 2 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:597:3: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator*, std::vector, std::allocator > > > >]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/property_map/property_map.hpp:354:5: required from ‘boost::iterator_property_map boost::make_iterator_property_map(RAIter, ID, Value) [with RAIter = __gnu_cxx::__normal_iterator*, std::vector, std::allocator > > >; Value = detail::edge_desc_impl; ID = vec_adj_list_vertex_id_map]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/edmonds_karp_max_flow.hpp:209:43: required from ‘static typename boost::detail::edge_capacity_value::type boost::detail::edmonds_karp_dispatch1::apply(Graph&, typename boost::graph_traits::vertex_descriptor, typename boost::graph_traits::vertex_descriptor, const boost::bgl_named_params&, boost::param_not_found) [with Graph = boost::adjacency_list > > > >; P = int; T = boost::buffer_param_t; R = boost::no_property; typename boost::detail::edge_capacity_value::type = double; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/edmonds_karp_max_flow.hpp:228:57: required from ‘typename boost::detail::edge_capacity_value::type boost::edmonds_karp_max_flow(Graph&, typename graph_traits::vertex_descriptor, typename graph_traits::vertex_descriptor, const bgl_named_params&) [with Graph = adjacency_list > > > >; P = int; T = buffer_param_t; R = no_property; typename detail::edge_capacity_value::type = double; typename graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/edmonds_karp_max_flow.hpp:240:33: required from ‘typename boost::property_traits::const_type>::value_type boost::edmonds_karp_max_flow(Graph&, typename graph_traits::vertex_descriptor, typename graph_traits::vertex_descriptor) [with Graph = adjacency_list > > > >; typename property_traits::const_type>::value_type = double; typename property_map::const_type = adj_list_edge_property_map > > >, edge_capacity_t>; typename graph_traits::vertex_descriptor = long unsigned int]’ sna.cpp:204:54: required from here /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::Convertible::~Convertible() [with X = std::random_access_iterator_tag; Y = std::random_access_iterator_tag]’ 37 | ~model() | ^ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:208:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 208 | BOOST_CONCEPT_USAGE(Convertible) { | ^~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::DefaultConstructible]’: /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements >]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:137:5: required from ‘struct boost::DefaultConstructible’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::DefaultConstructible]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied >::value’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:72:8: [ skipping 10 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_, boost::property >, boost::no_property, boost::listS> >)>’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/bellman_ford_shortest_paths.hpp:97:5: required from ‘bool boost::bellman_ford_shortest_paths(EdgeListGraph&, Size, WeightMap, PredecessorMap, DistanceMap, BinaryFunction, BinaryPredicate, BellmanFordVisitor) [with EdgeListGraph = adjacency_list, property >, no_property, listS>; Size = long unsigned int; WeightMap = adj_list_edge_property_map >, edge_weight_t>; PredecessorMap = dummy_property_map; DistanceMap = vec_adj_list_vertex_property_map, property >, no_property, listS>, adjacency_list, property >, no_property, listS>*, double, double&, vertex_distance_t>; BinaryFunction = closed_plus; BinaryPredicate = std::less; BellmanFordVisitor = bellman_visitor<>]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/johnson_all_pairs_shortest.hpp:112:36: required from ‘bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, VertexID, Weight, const BinaryPredicate&, const BinaryFunction&, const Infinity&, DistanceZero) [with VertexAndEdgeListGraph = R_adjacency_list; DistanceMatrix = Basic2DMatrix; VertexID = vec_adj_list_vertex_id_map, long unsigned int>; Weight = adj_list_edge_property_map, edge_weight_t>; BinaryPredicate = std::less; BinaryFunction = closed_plus; Infinity = double; DistanceZero = double]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/johnson_all_pairs_shortest.hpp:164:48: required from ‘bool boost::detail::johnson_dispatch(VertexAndEdgeListGraph&, DistanceMatrix&, const boost::bgl_named_params&, Weight, VertexID) [with VertexAndEdgeListGraph = R_adjacency_list; DistanceMatrix = Basic2DMatrix; P = int; T = int; R = boost::no_property; Weight = boost::adj_list_edge_property_map, boost::edge_weight_t>; VertexID = boost::vec_adj_list_vertex_id_map, long unsigned int>]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/johnson_all_pairs_shortest.hpp:192:36: required from ‘bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&) [with VertexAndEdgeListGraph = R_adjacency_list; DistanceMatrix = Basic2DMatrix]’ sna.cpp:105:41: required from here /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::DefaultConstructible::~DefaultConstructible() [with TT = long unsigned int]’ 37 | ~model() | ^ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:137:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 137 | BOOST_CONCEPT_USAGE(DefaultConstructible) { | ^~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::EqualityComparable]’: /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements >]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:233:5: required from ‘struct boost::EqualityComparable’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::EqualityComparable]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied >::value’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:72:8: [ skipping 10 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_, boost::property >, boost::no_property, boost::listS> >)>’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/bellman_ford_shortest_paths.hpp:97:5: required from ‘bool boost::bellman_ford_shortest_paths(EdgeListGraph&, Size, WeightMap, PredecessorMap, DistanceMap, BinaryFunction, BinaryPredicate, BellmanFordVisitor) [with EdgeListGraph = adjacency_list, property >, no_property, listS>; Size = long unsigned int; WeightMap = adj_list_edge_property_map >, edge_weight_t>; PredecessorMap = dummy_property_map; DistanceMap = vec_adj_list_vertex_property_map, property >, no_property, listS>, adjacency_list, property >, no_property, listS>*, double, double&, vertex_distance_t>; BinaryFunction = closed_plus; BinaryPredicate = std::less; BellmanFordVisitor = bellman_visitor<>]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/johnson_all_pairs_shortest.hpp:112:36: required from ‘bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, VertexID, Weight, const BinaryPredicate&, const BinaryFunction&, const Infinity&, DistanceZero) [with VertexAndEdgeListGraph = R_adjacency_list; DistanceMatrix = Basic2DMatrix; VertexID = vec_adj_list_vertex_id_map, long unsigned int>; Weight = adj_list_edge_property_map, edge_weight_t>; BinaryPredicate = std::less; BinaryFunction = closed_plus; Infinity = double; DistanceZero = double]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/johnson_all_pairs_shortest.hpp:164:48: required from ‘bool boost::detail::johnson_dispatch(VertexAndEdgeListGraph&, DistanceMatrix&, const boost::bgl_named_params&, Weight, VertexID) [with VertexAndEdgeListGraph = R_adjacency_list; DistanceMatrix = Basic2DMatrix; P = int; T = int; R = boost::no_property; Weight = boost::adj_list_edge_property_map, boost::edge_weight_t>; VertexID = boost::vec_adj_list_vertex_id_map, long unsigned int>]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/johnson_all_pairs_shortest.hpp:192:36: required from ‘bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&) [with VertexAndEdgeListGraph = R_adjacency_list; DistanceMatrix = Basic2DMatrix]’ sna.cpp:105:41: required from here /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::EqualityComparable::~EqualityComparable() [with TT = long unsigned int]’ 37 | ~model() | ^ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:233:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 233 | BOOST_CONCEPT_USAGE(EqualityComparable) { | ^~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::Assignable]’: /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements >]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:145:5: required from ‘struct boost::Assignable’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::Assignable]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied >::value’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:72:8: [ skipping 10 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_, boost::property >, boost::no_property, boost::listS> >)>’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/bellman_ford_shortest_paths.hpp:97:5: required from ‘bool boost::bellman_ford_shortest_paths(EdgeListGraph&, Size, WeightMap, PredecessorMap, DistanceMap, BinaryFunction, BinaryPredicate, BellmanFordVisitor) [with EdgeListGraph = adjacency_list, property >, no_property, listS>; Size = long unsigned int; WeightMap = adj_list_edge_property_map >, edge_weight_t>; PredecessorMap = dummy_property_map; DistanceMap = vec_adj_list_vertex_property_map, property >, no_property, listS>, adjacency_list, property >, no_property, listS>*, double, double&, vertex_distance_t>; BinaryFunction = closed_plus; BinaryPredicate = std::less; BellmanFordVisitor = bellman_visitor<>]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/johnson_all_pairs_shortest.hpp:112:36: required from ‘bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, VertexID, Weight, const BinaryPredicate&, const BinaryFunction&, const Infinity&, DistanceZero) [with VertexAndEdgeListGraph = R_adjacency_list; DistanceMatrix = Basic2DMatrix; VertexID = vec_adj_list_vertex_id_map, long unsigned int>; Weight = adj_list_edge_property_map, edge_weight_t>; BinaryPredicate = std::less; BinaryFunction = closed_plus; Infinity = double; DistanceZero = double]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/johnson_all_pairs_shortest.hpp:164:48: required from ‘bool boost::detail::johnson_dispatch(VertexAndEdgeListGraph&, DistanceMatrix&, const boost::bgl_named_params&, Weight, VertexID) [with VertexAndEdgeListGraph = R_adjacency_list; DistanceMatrix = Basic2DMatrix; P = int; T = int; R = boost::no_property; Weight = boost::adj_list_edge_property_map, boost::edge_weight_t>; VertexID = boost::vec_adj_list_vertex_id_map, long unsigned int>]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/johnson_all_pairs_shortest.hpp:192:36: required from ‘bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&) [with VertexAndEdgeListGraph = R_adjacency_list; DistanceMatrix = Basic2DMatrix]’ sna.cpp:105:41: required from here /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::Assignable::~Assignable() [with TT = long unsigned int]’ 37 | ~model() | ^ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:145:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 145 | BOOST_CONCEPT_USAGE(Assignable) { | ^~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::adjacency_list, boost::property >, boost::no_property, boost::listS> > > >]’: /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:145:5: required from ‘struct boost::Assignable, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::adjacency_list, boost::property >, boost::no_property, boost::listS> > >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:502:3: required from ‘struct boost::InputIterator, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::adjacency_list, boost::property >, boost::no_property, boost::listS> > >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::InputIterator, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::adjacency_list, boost::property >, boost::no_property, boost::listS> > >]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::adjacency_list, boost::property >, boost::no_property, boost::listS> > > >::value’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::adjacency_list, boost::property >, boost::no_property, boost::listS> > > >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:72:8: [ skipping 4 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/graph_concepts.hpp:226:1: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::EdgeListGraphConcept, boost::property >, boost::no_property, boost::listS> >]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/bellman_ford_shortest_paths.hpp:97:5: required from ‘bool boost::bellman_ford_shortest_paths(EdgeListGraph&, Size, WeightMap, PredecessorMap, DistanceMap, BinaryFunction, BinaryPredicate, BellmanFordVisitor) [with EdgeListGraph = adjacency_list, property >, no_property, listS>; Size = long unsigned int; WeightMap = adj_list_edge_property_map >, edge_weight_t>; PredecessorMap = dummy_property_map; DistanceMap = vec_adj_list_vertex_property_map, property >, no_property, listS>, adjacency_list, property >, no_property, listS>*, double, double&, vertex_distance_t>; BinaryFunction = closed_plus; BinaryPredicate = std::less; BellmanFordVisitor = bellman_visitor<>]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/johnson_all_pairs_shortest.hpp:112:36: required from ‘bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, VertexID, Weight, const BinaryPredicate&, const BinaryFunction&, const Infinity&, DistanceZero) [with VertexAndEdgeListGraph = R_adjacency_list; DistanceMatrix = Basic2DMatrix; VertexID = vec_adj_list_vertex_id_map, long unsigned int>; Weight = adj_list_edge_property_map, edge_weight_t>; BinaryPredicate = std::less; BinaryFunction = closed_plus; Infinity = double; DistanceZero = double]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/johnson_all_pairs_shortest.hpp:164:48: required from ‘bool boost::detail::johnson_dispatch(VertexAndEdgeListGraph&, DistanceMatrix&, const boost::bgl_named_params&, Weight, VertexID) [with VertexAndEdgeListGraph = R_adjacency_list; DistanceMatrix = Basic2DMatrix; P = int; T = int; R = boost::no_property; Weight = boost::adj_list_edge_property_map, boost::edge_weight_t>; VertexID = boost::vec_adj_list_vertex_id_map, long unsigned int>]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/johnson_all_pairs_shortest.hpp:192:36: required from ‘bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&) [with VertexAndEdgeListGraph = R_adjacency_list; DistanceMatrix = Basic2DMatrix]’ sna.cpp:105:41: required from here /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::Assignable, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::adjacency_list, boost::property >, boost::no_property, boost::listS> > >]’ 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ^ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::adjacency_list, boost::property >, boost::no_property, boost::listS> > > >]’: /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:233:5: required from ‘struct boost::EqualityComparable, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::adjacency_list, boost::property >, boost::no_property, boost::listS> > >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:502:3: required from ‘struct boost::InputIterator, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::adjacency_list, boost::property >, boost::no_property, boost::listS> > >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::InputIterator, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::adjacency_list, boost::property >, boost::no_property, boost::listS> > >]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::adjacency_list, boost::property >, boost::no_property, boost::listS> > > >::value’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::adjacency_list, boost::property >, boost::no_property, boost::listS> > > >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:72:8: [ skipping 4 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/graph_concepts.hpp:226:1: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::EdgeListGraphConcept, boost::property >, boost::no_property, boost::listS> >]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/bellman_ford_shortest_paths.hpp:97:5: required from ‘bool boost::bellman_ford_shortest_paths(EdgeListGraph&, Size, WeightMap, PredecessorMap, DistanceMap, BinaryFunction, BinaryPredicate, BellmanFordVisitor) [with EdgeListGraph = adjacency_list, property >, no_property, listS>; Size = long unsigned int; WeightMap = adj_list_edge_property_map >, edge_weight_t>; PredecessorMap = dummy_property_map; DistanceMap = vec_adj_list_vertex_property_map, property >, no_property, listS>, adjacency_list, property >, no_property, listS>*, double, double&, vertex_distance_t>; BinaryFunction = closed_plus; BinaryPredicate = std::less; BellmanFordVisitor = bellman_visitor<>]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/johnson_all_pairs_shortest.hpp:112:36: required from ‘bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, VertexID, Weight, const BinaryPredicate&, const BinaryFunction&, const Infinity&, DistanceZero) [with VertexAndEdgeListGraph = R_adjacency_list; DistanceMatrix = Basic2DMatrix; VertexID = vec_adj_list_vertex_id_map, long unsigned int>; Weight = adj_list_edge_property_map, edge_weight_t>; BinaryPredicate = std::less; BinaryFunction = closed_plus; Infinity = double; DistanceZero = double]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/johnson_all_pairs_shortest.hpp:164:48: required from ‘bool boost::detail::johnson_dispatch(VertexAndEdgeListGraph&, DistanceMatrix&, const boost::bgl_named_params&, Weight, VertexID) [with VertexAndEdgeListGraph = R_adjacency_list; DistanceMatrix = Basic2DMatrix; P = int; T = int; R = boost::no_property; Weight = boost::adj_list_edge_property_map, boost::edge_weight_t>; VertexID = boost::vec_adj_list_vertex_id_map, long unsigned int>]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/johnson_all_pairs_shortest.hpp:192:36: required from ‘bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&) [with VertexAndEdgeListGraph = R_adjacency_list; DistanceMatrix = Basic2DMatrix]’ sna.cpp:105:41: required from here /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::EqualityComparable, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::adjacency_list, boost::property >, boost::no_property, boost::listS> > >]’ 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ^ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::adjacency_list, boost::property >, boost::no_property, boost::listS> > > >]’: /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:512:7: required from ‘struct boost::InputIterator, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::adjacency_list, boost::property >, boost::no_property, boost::listS> > >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::InputIterator, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::adjacency_list, boost::property >, boost::no_property, boost::listS> > >]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::adjacency_list, boost::property >, boost::no_property, boost::listS> > > >::value’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::adjacency_list, boost::property >, boost::no_property, boost::listS> > > >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::adjacency_list, boost::property >, boost::no_property, boost::listS> > >)>’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/graph_concepts.hpp:53:35: [ skipping 3 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/graph_concepts.hpp:226:1: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::EdgeListGraphConcept, boost::property >, boost::no_property, boost::listS> >]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/bellman_ford_shortest_paths.hpp:97:5: required from ‘bool boost::bellman_ford_shortest_paths(EdgeListGraph&, Size, WeightMap, PredecessorMap, DistanceMap, BinaryFunction, BinaryPredicate, BellmanFordVisitor) [with EdgeListGraph = adjacency_list, property >, no_property, listS>; Size = long unsigned int; WeightMap = adj_list_edge_property_map >, edge_weight_t>; PredecessorMap = dummy_property_map; DistanceMap = vec_adj_list_vertex_property_map, property >, no_property, listS>, adjacency_list, property >, no_property, listS>*, double, double&, vertex_distance_t>; BinaryFunction = closed_plus; BinaryPredicate = std::less; BellmanFordVisitor = bellman_visitor<>]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/johnson_all_pairs_shortest.hpp:112:36: required from ‘bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, VertexID, Weight, const BinaryPredicate&, const BinaryFunction&, const Infinity&, DistanceZero) [with VertexAndEdgeListGraph = R_adjacency_list; DistanceMatrix = Basic2DMatrix; VertexID = vec_adj_list_vertex_id_map, long unsigned int>; Weight = adj_list_edge_property_map, edge_weight_t>; BinaryPredicate = std::less; BinaryFunction = closed_plus; Infinity = double; DistanceZero = double]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/johnson_all_pairs_shortest.hpp:164:48: required from ‘bool boost::detail::johnson_dispatch(VertexAndEdgeListGraph&, DistanceMatrix&, const boost::bgl_named_params&, Weight, VertexID) [with VertexAndEdgeListGraph = R_adjacency_list; DistanceMatrix = Basic2DMatrix; P = int; T = int; R = boost::no_property; Weight = boost::adj_list_edge_property_map, boost::edge_weight_t>; VertexID = boost::vec_adj_list_vertex_id_map, long unsigned int>]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/johnson_all_pairs_shortest.hpp:192:36: required from ‘bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&) [with VertexAndEdgeListGraph = R_adjacency_list; DistanceMatrix = Basic2DMatrix]’ sna.cpp:105:41: required from here /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::InputIterator, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::adjacency_list, boost::property >, boost::no_property, boost::listS> > >]’ 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ^ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::InputIterator, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::adjacency_list, boost::property >, boost::no_property, boost::listS> > >]’: /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/graph_concepts.hpp:53:35: required from ‘boost::concepts::MultiPassInputIterator::~MultiPassInputIterator() [with T = boost::detail::adj_list_edge_iterator, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::adjacency_list, boost::property >, boost::no_property, boost::listS> >]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::MultiPassInputIterator, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::adjacency_list, boost::property >, boost::no_property, boost::listS> > >]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/graph_concepts.hpp:235:9: required from ‘boost::concepts::EdgeListGraph::~EdgeListGraph() [with G = boost::adjacency_list, boost::property >, boost::no_property, boost::listS>]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/graph_concepts.hpp:226:1: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::EdgeListGraphConcept, boost::property >, boost::no_property, boost::listS> >]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/bellman_ford_shortest_paths.hpp:97:5: required from ‘bool boost::bellman_ford_shortest_paths(EdgeListGraph&, Size, WeightMap, PredecessorMap, DistanceMap, BinaryFunction, BinaryPredicate, BellmanFordVisitor) [with EdgeListGraph = adjacency_list, property >, no_property, listS>; Size = long unsigned int; WeightMap = adj_list_edge_property_map >, edge_weight_t>; PredecessorMap = dummy_property_map; DistanceMap = vec_adj_list_vertex_property_map, property >, no_property, listS>, adjacency_list, property >, no_property, listS>*, double, double&, vertex_distance_t>; BinaryFunction = closed_plus; BinaryPredicate = std::less; BellmanFordVisitor = bellman_visitor<>]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/johnson_all_pairs_shortest.hpp:112:36: required from ‘bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, VertexID, Weight, const BinaryPredicate&, const BinaryFunction&, const Infinity&, DistanceZero) [with VertexAndEdgeListGraph = R_adjacency_list; DistanceMatrix = Basic2DMatrix; VertexID = vec_adj_list_vertex_id_map, long unsigned int>; Weight = adj_list_edge_property_map, edge_weight_t>; BinaryPredicate = std::less; BinaryFunction = closed_plus; Infinity = double; DistanceZero = double]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/johnson_all_pairs_shortest.hpp:164:48: required from ‘bool boost::detail::johnson_dispatch(VertexAndEdgeListGraph&, DistanceMatrix&, const boost::bgl_named_params&, Weight, VertexID) [with VertexAndEdgeListGraph = R_adjacency_list; DistanceMatrix = Basic2DMatrix; P = int; T = int; R = boost::no_property; Weight = boost::adj_list_edge_property_map, boost::edge_weight_t>; VertexID = boost::vec_adj_list_vertex_id_map, long unsigned int>]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/johnson_all_pairs_shortest.hpp:192:36: required from ‘bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&) [with VertexAndEdgeListGraph = R_adjacency_list; DistanceMatrix = Basic2DMatrix]’ sna.cpp:105:41: required from here /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::InputIterator::~InputIterator() [with TT = boost::detail::adj_list_edge_iterator, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::adjacency_list, boost::property >, boost::no_property, boost::listS> >]’ 37 | ~model() | ^ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:512:7: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 512 | BOOST_CONCEPT_USAGE(InputIterator) | ^~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::Convertible]’: /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements >]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:208:5: required from ‘struct boost::Convertible’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::Convertible]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied >::value’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:72:8: [ skipping 12 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_*, std::vector, std::allocator > > > >)>’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/property_map/property_map.hpp:354:5: required from ‘boost::iterator_property_map boost::make_iterator_property_map(RAIter, ID, Value) [with RAIter = __gnu_cxx::__normal_iterator*, std::vector, std::allocator > > >; Value = detail::edge_desc_impl; ID = vec_adj_list_vertex_id_map]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/edmonds_karp_max_flow.hpp:209:43: required from ‘static typename boost::detail::edge_capacity_value::type boost::detail::edmonds_karp_dispatch1::apply(Graph&, typename boost::graph_traits::vertex_descriptor, typename boost::graph_traits::vertex_descriptor, const boost::bgl_named_params&, boost::param_not_found) [with Graph = boost::adjacency_list > > > >; P = int; T = boost::buffer_param_t; R = boost::no_property; typename boost::detail::edge_capacity_value::type = double; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/edmonds_karp_max_flow.hpp:228:57: required from ‘typename boost::detail::edge_capacity_value::type boost::edmonds_karp_max_flow(Graph&, typename graph_traits::vertex_descriptor, typename graph_traits::vertex_descriptor, const bgl_named_params&) [with Graph = adjacency_list > > > >; P = int; T = buffer_param_t; R = no_property; typename detail::edge_capacity_value::type = double; typename graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/edmonds_karp_max_flow.hpp:240:33: required from ‘typename boost::property_traits::const_type>::value_type boost::edmonds_karp_max_flow(Graph&, typename graph_traits::vertex_descriptor, typename graph_traits::vertex_descriptor) [with Graph = adjacency_list > > > >; typename property_traits::const_type>::value_type = double; typename property_map::const_type = adj_list_edge_property_map > > >, edge_capacity_t>; typename graph_traits::vertex_descriptor = long unsigned int]’ sna.cpp:204:54: required from here /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::Convertible::~Convertible() [with X = std::random_access_iterator_tag; Y = std::input_iterator_tag]’ 37 | ~model() | ^ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:208:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 208 | BOOST_CONCEPT_USAGE(Convertible) { | ^~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::Convertible]’: /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements >]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:208:5: required from ‘struct boost::Convertible’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::Convertible]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied >::value’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:72:8: [ skipping 11 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_*, std::vector, std::allocator > > > >)>’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/property_map/property_map.hpp:354:5: required from ‘boost::iterator_property_map boost::make_iterator_property_map(RAIter, ID, Value) [with RAIter = __gnu_cxx::__normal_iterator*, std::vector, std::allocator > > >; Value = detail::edge_desc_impl; ID = vec_adj_list_vertex_id_map]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/edmonds_karp_max_flow.hpp:209:43: required from ‘static typename boost::detail::edge_capacity_value::type boost::detail::edmonds_karp_dispatch1::apply(Graph&, typename boost::graph_traits::vertex_descriptor, typename boost::graph_traits::vertex_descriptor, const boost::bgl_named_params&, boost::param_not_found) [with Graph = boost::adjacency_list > > > >; P = int; T = boost::buffer_param_t; R = boost::no_property; typename boost::detail::edge_capacity_value::type = double; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/edmonds_karp_max_flow.hpp:228:57: required from ‘typename boost::detail::edge_capacity_value::type boost::edmonds_karp_max_flow(Graph&, typename graph_traits::vertex_descriptor, typename graph_traits::vertex_descriptor, const bgl_named_params&) [with Graph = adjacency_list > > > >; P = int; T = buffer_param_t; R = no_property; typename detail::edge_capacity_value::type = double; typename graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/edmonds_karp_max_flow.hpp:240:33: required from ‘typename boost::property_traits::const_type>::value_type boost::edmonds_karp_max_flow(Graph&, typename graph_traits::vertex_descriptor, typename graph_traits::vertex_descriptor) [with Graph = adjacency_list > > > >; typename property_traits::const_type>::value_type = double; typename property_map::const_type = adj_list_edge_property_map > > >, edge_capacity_t>; typename graph_traits::vertex_descriptor = long unsigned int]’ sna.cpp:204:54: required from here /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::Convertible::~Convertible() [with X = std::random_access_iterator_tag; Y = std::forward_iterator_tag]’ 37 | ~model() | ^ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:208:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 208 | BOOST_CONCEPT_USAGE(Convertible) { | ^~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::Convertible]’: /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements >]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:208:5: required from ‘struct boost::Convertible’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::Convertible]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied >::value’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:72:8: [ skipping 10 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_*, std::vector, std::allocator > > > >)>’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/property_map/property_map.hpp:354:5: required from ‘boost::iterator_property_map boost::make_iterator_property_map(RAIter, ID, Value) [with RAIter = __gnu_cxx::__normal_iterator*, std::vector, std::allocator > > >; Value = detail::edge_desc_impl; ID = vec_adj_list_vertex_id_map]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/edmonds_karp_max_flow.hpp:209:43: required from ‘static typename boost::detail::edge_capacity_value::type boost::detail::edmonds_karp_dispatch1::apply(Graph&, typename boost::graph_traits::vertex_descriptor, typename boost::graph_traits::vertex_descriptor, const boost::bgl_named_params&, boost::param_not_found) [with Graph = boost::adjacency_list > > > >; P = int; T = boost::buffer_param_t; R = boost::no_property; typename boost::detail::edge_capacity_value::type = double; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/edmonds_karp_max_flow.hpp:228:57: required from ‘typename boost::detail::edge_capacity_value::type boost::edmonds_karp_max_flow(Graph&, typename graph_traits::vertex_descriptor, typename graph_traits::vertex_descriptor, const bgl_named_params&) [with Graph = adjacency_list > > > >; P = int; T = buffer_param_t; R = no_property; typename detail::edge_capacity_value::type = double; typename graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/edmonds_karp_max_flow.hpp:240:33: required from ‘typename boost::property_traits::const_type>::value_type boost::edmonds_karp_max_flow(Graph&, typename graph_traits::vertex_descriptor, typename graph_traits::vertex_descriptor) [with Graph = adjacency_list > > > >; typename property_traits::const_type>::value_type = double; typename property_map::const_type = adj_list_edge_property_map > > >, edge_capacity_t>; typename graph_traits::vertex_descriptor = long unsigned int]’ sna.cpp:204:54: required from here /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::Convertible::~Convertible() [with X = std::random_access_iterator_tag; Y = std::bidirectional_iterator_tag]’ 37 | ~model() | ^ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:208:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 208 | BOOST_CONCEPT_USAGE(Convertible) { | ^~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements > > > >, boost::is_residual_edge > > >, boost::edge_residual_capacity_t> >, boost::keep_all> > >]’: /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/graph_concepts.hpp:66:5: required from ‘struct boost::concepts::Graph > > > >, boost::is_residual_edge > > >, boost::edge_residual_capacity_t> >, boost::keep_all> >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/graph_concepts.hpp:75:1: required from ‘struct boost::concepts::IncidenceGraph > > > >, boost::is_residual_edge > > >, boost::edge_residual_capacity_t> >, boost::keep_all> >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/graph_concepts.hpp:75:1: required from ‘struct boost::concepts::IncidenceGraphConcept > > > >, boost::is_residual_edge > > >, boost::edge_residual_capacity_t> >, boost::keep_all> >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::concepts::IncidenceGraphConcept > > > >, boost::is_residual_edge > > >, boost::edge_residual_capacity_t> >, boost::keep_all> >]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied > > > >, boost::is_residual_edge > > >, boost::edge_residual_capacity_t> >, boost::keep_all> > >::value’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:45:51: [ skipping 5 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/edmonds_karp_max_flow.hpp:101:29: required from ‘typename boost::property_traits::value_type boost::edmonds_karp_max_flow(Graph&, typename graph_traits::vertex_descriptor, typename graph_traits::vertex_descriptor, CapacityEdgeMap, ResidualCapacityEdgeMap, ReverseEdgeMap, ColorMap, PredEdgeMap) [with Graph = adjacency_list > > > >; CapacityEdgeMap = adj_list_edge_property_map > > >, edge_capacity_t>; ResidualCapacityEdgeMap = adj_list_edge_property_map > > >, edge_residual_capacity_t>; ReverseEdgeMap = adj_list_edge_property_map, const detail::edge_desc_impl&, long unsigned int, const property > > >, edge_reverse_t>; ColorMap = iterator_property_map<__gnu_cxx::__normal_iterator >, vec_adj_list_vertex_id_map, default_color_type, default_color_type&>; PredEdgeMap = iterator_property_map<__gnu_cxx::__normal_iterator*, std::vector, std::allocator > > >, vec_adj_list_vertex_id_map, detail::edge_desc_impl, detail::edge_desc_impl&>; typename property_traits::value_type = double; typename graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/edmonds_karp_max_flow.hpp:154:41: required from ‘static typename boost::detail::edge_capacity_value::type boost::detail::edmonds_karp_dispatch2::apply(Graph&, typename boost::graph_traits::vertex_descriptor, typename boost::graph_traits::vertex_descriptor, PredMap, const boost::bgl_named_params&, boost::param_not_found) [with Graph = boost::adjacency_list > > > >; PredMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator*, std::vector, std::allocator > > >, boost::vec_adj_list_vertex_id_map, boost::detail::edge_desc_impl, boost::detail::edge_desc_impl&>; P = int; T = boost::buffer_param_t; R = boost::no_property; typename boost::detail::edge_capacity_value::type = double; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/edmonds_karp_max_flow.hpp:208:54: required from ‘static typename boost::detail::edge_capacity_value::type boost::detail::edmonds_karp_dispatch1::apply(Graph&, typename boost::graph_traits::vertex_descriptor, typename boost::graph_traits::vertex_descriptor, const boost::bgl_named_params&, boost::param_not_found) [with Graph = boost::adjacency_list > > > >; P = int; T = boost::buffer_param_t; R = boost::no_property; typename boost::detail::edge_capacity_value::type = double; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/edmonds_karp_max_flow.hpp:228:57: required from ‘typename boost::detail::edge_capacity_value::type boost::edmonds_karp_max_flow(Graph&, typename graph_traits::vertex_descriptor, typename graph_traits::vertex_descriptor, const bgl_named_params&) [with Graph = adjacency_list > > > >; P = int; T = buffer_param_t; R = no_property; typename detail::edge_capacity_value::type = double; typename graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/edmonds_karp_max_flow.hpp:240:33: required from ‘typename boost::property_traits::const_type>::value_type boost::edmonds_karp_max_flow(Graph&, typename graph_traits::vertex_descriptor, typename graph_traits::vertex_descriptor) [with Graph = adjacency_list > > > >; typename property_traits::const_type>::value_type = double; typename property_map::const_type = adj_list_edge_property_map > > >, edge_capacity_t>; typename graph_traits::vertex_descriptor = long unsigned int]’ sna.cpp:204:54: required from here /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::concepts::Graph > > > >, boost::is_residual_edge > > >, boost::edge_residual_capacity_t> >, boost::keep_all> >]’ 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ^ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements > > > >, boost::is_residual_edge > > >, boost::edge_residual_capacity_t> >, boost::keep_all> > >]’: /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/graph_concepts.hpp:87:5: required from ‘struct boost::concepts::IncidenceGraph > > > >, boost::is_residual_edge > > >, boost::edge_residual_capacity_t> >, boost::keep_all> >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/graph_concepts.hpp:75:1: required from ‘struct boost::concepts::IncidenceGraphConcept > > > >, boost::is_residual_edge > > >, boost::edge_residual_capacity_t> >, boost::keep_all> >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::concepts::IncidenceGraphConcept > > > >, boost::is_residual_edge > > >, boost::edge_residual_capacity_t> >, boost::keep_all> >]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied > > > >, boost::is_residual_edge > > >, boost::edge_residual_capacity_t> >, boost::keep_all> > >::value’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied > > > >, boost::is_residual_edge > > >, boost::edge_residual_capacity_t> >, boost::keep_all> > >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:72:8: [ skipping 4 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/edmonds_karp_max_flow.hpp:101:29: required from ‘typename boost::property_traits::value_type boost::edmonds_karp_max_flow(Graph&, typename graph_traits::vertex_descriptor, typename graph_traits::vertex_descriptor, CapacityEdgeMap, ResidualCapacityEdgeMap, ReverseEdgeMap, ColorMap, PredEdgeMap) [with Graph = adjacency_list > > > >; CapacityEdgeMap = adj_list_edge_property_map > > >, edge_capacity_t>; ResidualCapacityEdgeMap = adj_list_edge_property_map > > >, edge_residual_capacity_t>; ReverseEdgeMap = adj_list_edge_property_map, const detail::edge_desc_impl&, long unsigned int, const property > > >, edge_reverse_t>; ColorMap = iterator_property_map<__gnu_cxx::__normal_iterator >, vec_adj_list_vertex_id_map, default_color_type, default_color_type&>; PredEdgeMap = iterator_property_map<__gnu_cxx::__normal_iterator*, std::vector, std::allocator > > >, vec_adj_list_vertex_id_map, detail::edge_desc_impl, detail::edge_desc_impl&>; typename property_traits::value_type = double; typename graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/edmonds_karp_max_flow.hpp:154:41: required from ‘static typename boost::detail::edge_capacity_value::type boost::detail::edmonds_karp_dispatch2::apply(Graph&, typename boost::graph_traits::vertex_descriptor, typename boost::graph_traits::vertex_descriptor, PredMap, const boost::bgl_named_params&, boost::param_not_found) [with Graph = boost::adjacency_list > > > >; PredMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator*, std::vector, std::allocator > > >, boost::vec_adj_list_vertex_id_map, boost::detail::edge_desc_impl, boost::detail::edge_desc_impl&>; P = int; T = boost::buffer_param_t; R = boost::no_property; typename boost::detail::edge_capacity_value::type = double; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/edmonds_karp_max_flow.hpp:208:54: required from ‘static typename boost::detail::edge_capacity_value::type boost::detail::edmonds_karp_dispatch1::apply(Graph&, typename boost::graph_traits::vertex_descriptor, typename boost::graph_traits::vertex_descriptor, const boost::bgl_named_params&, boost::param_not_found) [with Graph = boost::adjacency_list > > > >; P = int; T = boost::buffer_param_t; R = boost::no_property; typename boost::detail::edge_capacity_value::type = double; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/edmonds_karp_max_flow.hpp:228:57: required from ‘typename boost::detail::edge_capacity_value::type boost::edmonds_karp_max_flow(Graph&, typename graph_traits::vertex_descriptor, typename graph_traits::vertex_descriptor, const bgl_named_params&) [with Graph = adjacency_list > > > >; P = int; T = buffer_param_t; R = no_property; typename detail::edge_capacity_value::type = double; typename graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/edmonds_karp_max_flow.hpp:240:33: required from ‘typename boost::property_traits::const_type>::value_type boost::edmonds_karp_max_flow(Graph&, typename graph_traits::vertex_descriptor, typename graph_traits::vertex_descriptor) [with Graph = adjacency_list > > > >; typename property_traits::const_type>::value_type = double; typename property_map::const_type = adj_list_edge_property_map > > >, edge_capacity_t>; typename graph_traits::vertex_descriptor = long unsigned int]’ sna.cpp:204:54: required from here /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::concepts::IncidenceGraph > > > >, boost::is_residual_edge > > >, boost::edge_residual_capacity_t> >, boost::keep_all> >]’ 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ^ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::IncidenceGraphConcept > > > >, boost::is_residual_edge > > >, boost::edge_residual_capacity_t> >, boost::keep_all> >]’: /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/breadth_first_search.hpp:62:5: required from ‘void boost::breadth_first_visit(const IncidenceGraph&, SourceIterator, SourceIterator, Buffer&, BFSVisitor, ColorMap) [with IncidenceGraph = filtered_graph > > > >, is_residual_edge > > >, edge_residual_capacity_t> >, keep_all>; Buffer = queue > >; BFSVisitor = bfs_visitor*, std::vector, std::allocator > > >, vec_adj_list_vertex_id_map, detail::edge_desc_impl, detail::edge_desc_impl&>, on_tree_edge> >; ColorMap = iterator_property_map<__gnu_cxx::__normal_iterator >, vec_adj_list_vertex_id_map, default_color_type, default_color_type&>; SourceIterator = long unsigned int*]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/breadth_first_search.hpp:136:24: required from ‘void boost::breadth_first_search(const VertexListGraph&, SourceIterator, SourceIterator, Buffer&, BFSVisitor, ColorMap) [with VertexListGraph = filtered_graph > > > >, is_residual_edge > > >, edge_residual_capacity_t> >, keep_all>; SourceIterator = long unsigned int*; Buffer = queue > >; BFSVisitor = bfs_visitor*, std::vector, std::allocator > > >, vec_adj_list_vertex_id_map, detail::edge_desc_impl, detail::edge_desc_impl&>, on_tree_edge> >; ColorMap = iterator_property_map<__gnu_cxx::__normal_iterator >, vec_adj_list_vertex_id_map, default_color_type, default_color_type&>]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/breadth_first_search.hpp:147:25: required from ‘void boost::breadth_first_search(const VertexListGraph&, typename graph_traits::vertex_descriptor, Buffer&, BFSVisitor, ColorMap) [with VertexListGraph = filtered_graph > > > >, is_residual_edge > > >, edge_residual_capacity_t> >, keep_all>; Buffer = queue > >; BFSVisitor = bfs_visitor*, std::vector, std::allocator > > >, vec_adj_list_vertex_id_map, detail::edge_desc_impl, detail::edge_desc_impl&>, on_tree_edge> >; ColorMap = iterator_property_map<__gnu_cxx::__normal_iterator >, vec_adj_list_vertex_id_map, default_color_type, default_color_type&>; typename graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/edmonds_karp_max_flow.hpp:101:29: required from ‘typename boost::property_traits::value_type boost::edmonds_karp_max_flow(Graph&, typename graph_traits::vertex_descriptor, typename graph_traits::vertex_descriptor, CapacityEdgeMap, ResidualCapacityEdgeMap, ReverseEdgeMap, ColorMap, PredEdgeMap) [with Graph = adjacency_list > > > >; CapacityEdgeMap = adj_list_edge_property_map > > >, edge_capacity_t>; ResidualCapacityEdgeMap = adj_list_edge_property_map > > >, edge_residual_capacity_t>; ReverseEdgeMap = adj_list_edge_property_map, const detail::edge_desc_impl&, long unsigned int, const property > > >, edge_reverse_t>; ColorMap = iterator_property_map<__gnu_cxx::__normal_iterator >, vec_adj_list_vertex_id_map, default_color_type, default_color_type&>; PredEdgeMap = iterator_property_map<__gnu_cxx::__normal_iterator*, std::vector, std::allocator > > >, vec_adj_list_vertex_id_map, detail::edge_desc_impl, detail::edge_desc_impl&>; typename property_traits::value_type = double; typename graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/edmonds_karp_max_flow.hpp:154:41: required from ‘static typename boost::detail::edge_capacity_value::type boost::detail::edmonds_karp_dispatch2::apply(Graph&, typename boost::graph_traits::vertex_descriptor, typename boost::graph_traits::vertex_descriptor, PredMap, const boost::bgl_named_params&, boost::param_not_found) [with Graph = boost::adjacency_list > > > >; PredMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator*, std::vector, std::allocator > > >, boost::vec_adj_list_vertex_id_map, boost::detail::edge_desc_impl, boost::detail::edge_desc_impl&>; P = int; T = boost::buffer_param_t; R = boost::no_property; typename boost::detail::edge_capacity_value::type = double; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/edmonds_karp_max_flow.hpp:208:54: required from ‘static typename boost::detail::edge_capacity_value::type boost::detail::edmonds_karp_dispatch1::apply(Graph&, typename boost::graph_traits::vertex_descriptor, typename boost::graph_traits::vertex_descriptor, const boost::bgl_named_params&, boost::param_not_found) [with Graph = boost::adjacency_list > > > >; P = int; T = boost::buffer_param_t; R = boost::no_property; typename boost::detail::edge_capacity_value::type = double; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/edmonds_karp_max_flow.hpp:228:57: required from ‘typename boost::detail::edge_capacity_value::type boost::edmonds_karp_max_flow(Graph&, typename graph_traits::vertex_descriptor, typename graph_traits::vertex_descriptor, const bgl_named_params&) [with Graph = adjacency_list > > > >; P = int; T = buffer_param_t; R = no_property; typename detail::edge_capacity_value::type = double; typename graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/edmonds_karp_max_flow.hpp:240:33: required from ‘typename boost::property_traits::const_type>::value_type boost::edmonds_karp_max_flow(Graph&, typename graph_traits::vertex_descriptor, typename graph_traits::vertex_descriptor) [with Graph = adjacency_list > > > >; typename property_traits::const_type>::value_type = double; typename property_map::const_type = adj_list_edge_property_map > > >, edge_capacity_t>; typename graph_traits::vertex_descriptor = long unsigned int]’ sna.cpp:204:54: required from here /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/graph_concepts.hpp:75:15: note: in a call to non-static member function ‘boost::concepts::IncidenceGraphConcept > > > >, boost::is_residual_edge > > >, boost::edge_residual_capacity_t> >, boost::keep_all> >::~IncidenceGraphConcept()’ 75 | BOOST_concept(IncidenceGraph, (G)) : Graph< G > | ^~~~~~~~~~~~~~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/preprocessor/cat.hpp:29:34: note: in definition of macro ‘BOOST_PP_CAT_I’ 29 | # define BOOST_PP_CAT_I(a, b) a ## b | ^ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/concept_def.hpp:23:12: note: in expansion of macro ‘BOOST_PP_CAT’ 23 | struct BOOST_PP_CAT(name,Concept) \ | ^~~~~~~~~~~~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/graph_concepts.hpp:75:1: note: in expansion of macro ‘BOOST_concept’ 75 | BOOST_concept(IncidenceGraph, (G)) : Graph< G > | ^~~~~~~~~~~~~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::constraint::failed() [with Model = boost::BFSVisitorConcept*, std::vector, std::allocator > > >, boost::vec_adj_list_vertex_id_map, boost::detail::edge_desc_impl, boost::detail::edge_desc_impl&>, boost::on_tree_edge> >, boost::filtered_graph > > > >, boost::is_residual_edge > > >, boost::edge_residual_capacity_t> >, boost::keep_all> >]’: /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/breadth_first_search.hpp:65:5: required from ‘void boost::breadth_first_visit(const IncidenceGraph&, SourceIterator, SourceIterator, Buffer&, BFSVisitor, ColorMap) [with IncidenceGraph = filtered_graph > > > >, is_residual_edge > > >, edge_residual_capacity_t> >, keep_all>; Buffer = queue > >; BFSVisitor = bfs_visitor*, std::vector, std::allocator > > >, vec_adj_list_vertex_id_map, detail::edge_desc_impl, detail::edge_desc_impl&>, on_tree_edge> >; ColorMap = iterator_property_map<__gnu_cxx::__normal_iterator >, vec_adj_list_vertex_id_map, default_color_type, default_color_type&>; SourceIterator = long unsigned int*]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/breadth_first_search.hpp:136:24: required from ‘void boost::breadth_first_search(const VertexListGraph&, SourceIterator, SourceIterator, Buffer&, BFSVisitor, ColorMap) [with VertexListGraph = filtered_graph > > > >, is_residual_edge > > >, edge_residual_capacity_t> >, keep_all>; SourceIterator = long unsigned int*; Buffer = queue > >; BFSVisitor = bfs_visitor*, std::vector, std::allocator > > >, vec_adj_list_vertex_id_map, detail::edge_desc_impl, detail::edge_desc_impl&>, on_tree_edge> >; ColorMap = iterator_property_map<__gnu_cxx::__normal_iterator >, vec_adj_list_vertex_id_map, default_color_type, default_color_type&>]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/breadth_first_search.hpp:147:25: required from ‘void boost::breadth_first_search(const VertexListGraph&, typename graph_traits::vertex_descriptor, Buffer&, BFSVisitor, ColorMap) [with VertexListGraph = filtered_graph > > > >, is_residual_edge > > >, edge_residual_capacity_t> >, keep_all>; Buffer = queue > >; BFSVisitor = bfs_visitor*, std::vector, std::allocator > > >, vec_adj_list_vertex_id_map, detail::edge_desc_impl, detail::edge_desc_impl&>, on_tree_edge> >; ColorMap = iterator_property_map<__gnu_cxx::__normal_iterator >, vec_adj_list_vertex_id_map, default_color_type, default_color_type&>; typename graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/edmonds_karp_max_flow.hpp:101:29: required from ‘typename boost::property_traits::value_type boost::edmonds_karp_max_flow(Graph&, typename graph_traits::vertex_descriptor, typename graph_traits::vertex_descriptor, CapacityEdgeMap, ResidualCapacityEdgeMap, ReverseEdgeMap, ColorMap, PredEdgeMap) [with Graph = adjacency_list > > > >; CapacityEdgeMap = adj_list_edge_property_map > > >, edge_capacity_t>; ResidualCapacityEdgeMap = adj_list_edge_property_map > > >, edge_residual_capacity_t>; ReverseEdgeMap = adj_list_edge_property_map, const detail::edge_desc_impl&, long unsigned int, const property > > >, edge_reverse_t>; ColorMap = iterator_property_map<__gnu_cxx::__normal_iterator >, vec_adj_list_vertex_id_map, default_color_type, default_color_type&>; PredEdgeMap = iterator_property_map<__gnu_cxx::__normal_iterator*, std::vector, std::allocator > > >, vec_adj_list_vertex_id_map, detail::edge_desc_impl, detail::edge_desc_impl&>; typename property_traits::value_type = double; typename graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/edmonds_karp_max_flow.hpp:154:41: required from ‘static typename boost::detail::edge_capacity_value::type boost::detail::edmonds_karp_dispatch2::apply(Graph&, typename boost::graph_traits::vertex_descriptor, typename boost::graph_traits::vertex_descriptor, PredMap, const boost::bgl_named_params&, boost::param_not_found) [with Graph = boost::adjacency_list > > > >; PredMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator*, std::vector, std::allocator > > >, boost::vec_adj_list_vertex_id_map, boost::detail::edge_desc_impl, boost::detail::edge_desc_impl&>; P = int; T = boost::buffer_param_t; R = boost::no_property; typename boost::detail::edge_capacity_value::type = double; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/edmonds_karp_max_flow.hpp:208:54: required from ‘static typename boost::detail::edge_capacity_value::type boost::detail::edmonds_karp_dispatch1::apply(Graph&, typename boost::graph_traits::vertex_descriptor, typename boost::graph_traits::vertex_descriptor, const boost::bgl_named_params&, boost::param_not_found) [with Graph = boost::adjacency_list > > > >; P = int; T = boost::buffer_param_t; R = boost::no_property; typename boost::detail::edge_capacity_value::type = double; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/edmonds_karp_max_flow.hpp:228:57: required from ‘typename boost::detail::edge_capacity_value::type boost::edmonds_karp_max_flow(Graph&, typename graph_traits::vertex_descriptor, typename graph_traits::vertex_descriptor, const bgl_named_params&) [with Graph = adjacency_list > > > >; P = int; T = buffer_param_t; R = no_property; typename detail::edge_capacity_value::type = double; typename graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/edmonds_karp_max_flow.hpp:240:33: required from ‘typename boost::property_traits::const_type>::value_type boost::edmonds_karp_max_flow(Graph&, typename graph_traits::vertex_descriptor, typename graph_traits::vertex_descriptor) [with Graph = adjacency_list > > > >; typename property_traits::const_type>::value_type = double; typename property_map::const_type = adj_list_edge_property_map > > >, edge_capacity_t>; typename graph_traits::vertex_descriptor = long unsigned int]’ sna.cpp:204:54: required from here /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:65:52: warning: ‘this’ pointer is null [-Wnonnull] 65 | static void failed() { ((Model*)0)->constraints(); } | ~~~~~~~~~~~~~~~~~~~~~~~~^~ In file included from /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/dijkstra_shortest_paths.hpp:21, from /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/johnson_all_pairs_shortest.hpp:29, from sna.cpp:3: /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/breadth_first_search.hpp:37:10: note: in a call to non-static member function ‘void boost::BFSVisitorConcept::constraints() [with Visitor = boost::bfs_visitor*, std::vector, std::allocator > > >, boost::vec_adj_list_vertex_id_map, boost::detail::edge_desc_impl, boost::detail::edge_desc_impl&>, boost::on_tree_edge> >; Graph = boost::filtered_graph > > > >, boost::is_residual_edge > > >, boost::edge_residual_capacity_t> >, boost::keep_all>]’ 37 | void constraints() | ^~~~~~~~~~~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::constraint::failed() [with Model = boost::ReadWritePropertyMapConcept >, boost::vec_adj_list_vertex_id_map, boost::default_color_type, boost::default_color_type&>, long unsigned int>]’: /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/breadth_first_search.hpp:66:5: required from ‘void boost::breadth_first_visit(const IncidenceGraph&, SourceIterator, SourceIterator, Buffer&, BFSVisitor, ColorMap) [with IncidenceGraph = filtered_graph > > > >, is_residual_edge > > >, edge_residual_capacity_t> >, keep_all>; Buffer = queue > >; BFSVisitor = bfs_visitor*, std::vector, std::allocator > > >, vec_adj_list_vertex_id_map, detail::edge_desc_impl, detail::edge_desc_impl&>, on_tree_edge> >; ColorMap = iterator_property_map<__gnu_cxx::__normal_iterator >, vec_adj_list_vertex_id_map, default_color_type, default_color_type&>; SourceIterator = long unsigned int*]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/breadth_first_search.hpp:136:24: required from ‘void boost::breadth_first_search(const VertexListGraph&, SourceIterator, SourceIterator, Buffer&, BFSVisitor, ColorMap) [with VertexListGraph = filtered_graph > > > >, is_residual_edge > > >, edge_residual_capacity_t> >, keep_all>; SourceIterator = long unsigned int*; Buffer = queue > >; BFSVisitor = bfs_visitor*, std::vector, std::allocator > > >, vec_adj_list_vertex_id_map, detail::edge_desc_impl, detail::edge_desc_impl&>, on_tree_edge> >; ColorMap = iterator_property_map<__gnu_cxx::__normal_iterator >, vec_adj_list_vertex_id_map, default_color_type, default_color_type&>]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/breadth_first_search.hpp:147:25: required from ‘void boost::breadth_first_search(const VertexListGraph&, typename graph_traits::vertex_descriptor, Buffer&, BFSVisitor, ColorMap) [with VertexListGraph = filtered_graph > > > >, is_residual_edge > > >, edge_residual_capacity_t> >, keep_all>; Buffer = queue > >; BFSVisitor = bfs_visitor*, std::vector, std::allocator > > >, vec_adj_list_vertex_id_map, detail::edge_desc_impl, detail::edge_desc_impl&>, on_tree_edge> >; ColorMap = iterator_property_map<__gnu_cxx::__normal_iterator >, vec_adj_list_vertex_id_map, default_color_type, default_color_type&>; typename graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/edmonds_karp_max_flow.hpp:101:29: required from ‘typename boost::property_traits::value_type boost::edmonds_karp_max_flow(Graph&, typename graph_traits::vertex_descriptor, typename graph_traits::vertex_descriptor, CapacityEdgeMap, ResidualCapacityEdgeMap, ReverseEdgeMap, ColorMap, PredEdgeMap) [with Graph = adjacency_list > > > >; CapacityEdgeMap = adj_list_edge_property_map > > >, edge_capacity_t>; ResidualCapacityEdgeMap = adj_list_edge_property_map > > >, edge_residual_capacity_t>; ReverseEdgeMap = adj_list_edge_property_map, const detail::edge_desc_impl&, long unsigned int, const property > > >, edge_reverse_t>; ColorMap = iterator_property_map<__gnu_cxx::__normal_iterator >, vec_adj_list_vertex_id_map, default_color_type, default_color_type&>; PredEdgeMap = iterator_property_map<__gnu_cxx::__normal_iterator*, std::vector, std::allocator > > >, vec_adj_list_vertex_id_map, detail::edge_desc_impl, detail::edge_desc_impl&>; typename property_traits::value_type = double; typename graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/edmonds_karp_max_flow.hpp:154:41: required from ‘static typename boost::detail::edge_capacity_value::type boost::detail::edmonds_karp_dispatch2::apply(Graph&, typename boost::graph_traits::vertex_descriptor, typename boost::graph_traits::vertex_descriptor, PredMap, const boost::bgl_named_params&, boost::param_not_found) [with Graph = boost::adjacency_list > > > >; PredMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator*, std::vector, std::allocator > > >, boost::vec_adj_list_vertex_id_map, boost::detail::edge_desc_impl, boost::detail::edge_desc_impl&>; P = int; T = boost::buffer_param_t; R = boost::no_property; typename boost::detail::edge_capacity_value::type = double; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/edmonds_karp_max_flow.hpp:208:54: required from ‘static typename boost::detail::edge_capacity_value::type boost::detail::edmonds_karp_dispatch1::apply(Graph&, typename boost::graph_traits::vertex_descriptor, typename boost::graph_traits::vertex_descriptor, const boost::bgl_named_params&, boost::param_not_found) [with Graph = boost::adjacency_list > > > >; P = int; T = boost::buffer_param_t; R = boost::no_property; typename boost::detail::edge_capacity_value::type = double; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/edmonds_karp_max_flow.hpp:228:57: required from ‘typename boost::detail::edge_capacity_value::type boost::edmonds_karp_max_flow(Graph&, typename graph_traits::vertex_descriptor, typename graph_traits::vertex_descriptor, const bgl_named_params&) [with Graph = adjacency_list > > > >; P = int; T = buffer_param_t; R = no_property; typename detail::edge_capacity_value::type = double; typename graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/edmonds_karp_max_flow.hpp:240:33: required from ‘typename boost::property_traits::const_type>::value_type boost::edmonds_karp_max_flow(Graph&, typename graph_traits::vertex_descriptor, typename graph_traits::vertex_descriptor) [with Graph = adjacency_list > > > >; typename property_traits::const_type>::value_type = double; typename property_map::const_type = adj_list_edge_property_map > > >, edge_capacity_t>; typename graph_traits::vertex_descriptor = long unsigned int]’ sna.cpp:204:54: required from here /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:65:52: warning: ‘this’ pointer is null [-Wnonnull] 65 | static void failed() { ((Model*)0)->constraints(); } | ~~~~~~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/property_map/property_map.hpp:205:10: note: in a call to non-static member function ‘void boost::ReadWritePropertyMapConcept::constraints() [with PMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map, boost::default_color_type, boost::default_color_type&>; Key = long unsigned int]’ 205 | void constraints() { | ^~~~~~~~~~~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::Assignable, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::adjacency_list, boost::property >, boost::no_property, boost::listS> > >]’: /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::adjacency_list, boost::property >, boost::no_property, boost::listS> > > >]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:145:5: required from ‘struct boost::Assignable, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::adjacency_list, boost::property >, boost::no_property, boost::listS> > >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:502:3: required from ‘struct boost::InputIterator, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::adjacency_list, boost::property >, boost::no_property, boost::listS> > >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::InputIterator, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::adjacency_list, boost::property >, boost::no_property, boost::listS> > >]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::adjacency_list, boost::property >, boost::no_property, boost::listS> > > >::value’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:45:51: [ skipping 5 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/graph_concepts.hpp:226:1: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::EdgeListGraphConcept, boost::property >, boost::no_property, boost::listS> >]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/bellman_ford_shortest_paths.hpp:97:5: required from ‘bool boost::bellman_ford_shortest_paths(EdgeListGraph&, Size, WeightMap, PredecessorMap, DistanceMap, BinaryFunction, BinaryPredicate, BellmanFordVisitor) [with EdgeListGraph = adjacency_list, property >, no_property, listS>; Size = long unsigned int; WeightMap = adj_list_edge_property_map >, edge_weight_t>; PredecessorMap = dummy_property_map; DistanceMap = vec_adj_list_vertex_property_map, property >, no_property, listS>, adjacency_list, property >, no_property, listS>*, double, double&, vertex_distance_t>; BinaryFunction = closed_plus; BinaryPredicate = std::less; BellmanFordVisitor = bellman_visitor<>]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/johnson_all_pairs_shortest.hpp:112:36: required from ‘bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, VertexID, Weight, const BinaryPredicate&, const BinaryFunction&, const Infinity&, DistanceZero) [with VertexAndEdgeListGraph = R_adjacency_list; DistanceMatrix = Basic2DMatrix; VertexID = vec_adj_list_vertex_id_map, long unsigned int>; Weight = adj_list_edge_property_map, edge_weight_t>; BinaryPredicate = std::less; BinaryFunction = closed_plus; Infinity = double; DistanceZero = double]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/johnson_all_pairs_shortest.hpp:164:48: required from ‘bool boost::detail::johnson_dispatch(VertexAndEdgeListGraph&, DistanceMatrix&, const boost::bgl_named_params&, Weight, VertexID) [with VertexAndEdgeListGraph = R_adjacency_list; DistanceMatrix = Basic2DMatrix; P = int; T = int; R = boost::no_property; Weight = boost::adj_list_edge_property_map, boost::edge_weight_t>; VertexID = boost::vec_adj_list_vertex_id_map, long unsigned int>]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/johnson_all_pairs_shortest.hpp:192:36: required from ‘bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&) [with VertexAndEdgeListGraph = R_adjacency_list; DistanceMatrix = Basic2DMatrix]’ sna.cpp:105:41: required from here /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::Assignable::~Assignable() [with TT = boost::detail::adj_list_edge_iterator, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::adjacency_list, boost::property >, boost::no_property, boost::listS> >]’ 37 | ~model() | ^ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:145:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 145 | BOOST_CONCEPT_USAGE(Assignable) { | ^~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::EqualityComparable, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::adjacency_list, boost::property >, boost::no_property, boost::listS> > >]’: /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::adjacency_list, boost::property >, boost::no_property, boost::listS> > > >]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:233:5: required from ‘struct boost::EqualityComparable, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::adjacency_list, boost::property >, boost::no_property, boost::listS> > >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:502:3: required from ‘struct boost::InputIterator, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::adjacency_list, boost::property >, boost::no_property, boost::listS> > >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::InputIterator, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::adjacency_list, boost::property >, boost::no_property, boost::listS> > >]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::adjacency_list, boost::property >, boost::no_property, boost::listS> > > >::value’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:45:51: [ skipping 5 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/graph_concepts.hpp:226:1: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::EdgeListGraphConcept, boost::property >, boost::no_property, boost::listS> >]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/bellman_ford_shortest_paths.hpp:97:5: required from ‘bool boost::bellman_ford_shortest_paths(EdgeListGraph&, Size, WeightMap, PredecessorMap, DistanceMap, BinaryFunction, BinaryPredicate, BellmanFordVisitor) [with EdgeListGraph = adjacency_list, property >, no_property, listS>; Size = long unsigned int; WeightMap = adj_list_edge_property_map >, edge_weight_t>; PredecessorMap = dummy_property_map; DistanceMap = vec_adj_list_vertex_property_map, property >, no_property, listS>, adjacency_list, property >, no_property, listS>*, double, double&, vertex_distance_t>; BinaryFunction = closed_plus; BinaryPredicate = std::less; BellmanFordVisitor = bellman_visitor<>]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/johnson_all_pairs_shortest.hpp:112:36: required from ‘bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, VertexID, Weight, const BinaryPredicate&, const BinaryFunction&, const Infinity&, DistanceZero) [with VertexAndEdgeListGraph = R_adjacency_list; DistanceMatrix = Basic2DMatrix; VertexID = vec_adj_list_vertex_id_map, long unsigned int>; Weight = adj_list_edge_property_map, edge_weight_t>; BinaryPredicate = std::less; BinaryFunction = closed_plus; Infinity = double; DistanceZero = double]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/johnson_all_pairs_shortest.hpp:164:48: required from ‘bool boost::detail::johnson_dispatch(VertexAndEdgeListGraph&, DistanceMatrix&, const boost::bgl_named_params&, Weight, VertexID) [with VertexAndEdgeListGraph = R_adjacency_list; DistanceMatrix = Basic2DMatrix; P = int; T = int; R = boost::no_property; Weight = boost::adj_list_edge_property_map, boost::edge_weight_t>; VertexID = boost::vec_adj_list_vertex_id_map, long unsigned int>]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/johnson_all_pairs_shortest.hpp:192:36: required from ‘bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&) [with VertexAndEdgeListGraph = R_adjacency_list; DistanceMatrix = Basic2DMatrix]’ sna.cpp:105:41: required from here /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::EqualityComparable::~EqualityComparable() [with TT = boost::detail::adj_list_edge_iterator, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::adjacency_list, boost::property >, boost::no_property, boost::listS> >]’ 37 | ~model() | ^ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:233:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 233 | BOOST_CONCEPT_USAGE(EqualityComparable) { | ^~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::InputIterator, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::adjacency_list, boost::property >, boost::no_property, boost::listS> > >]’: /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::adjacency_list, boost::property >, boost::no_property, boost::listS> > > >]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:512:7: required from ‘struct boost::InputIterator, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::adjacency_list, boost::property >, boost::no_property, boost::listS> > >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::InputIterator, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::adjacency_list, boost::property >, boost::no_property, boost::listS> > >]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::adjacency_list, boost::property >, boost::no_property, boost::listS> > > >::value’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::adjacency_list, boost::property >, boost::no_property, boost::listS> > > >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:72:8: [ skipping 4 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/graph_concepts.hpp:226:1: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::EdgeListGraphConcept, boost::property >, boost::no_property, boost::listS> >]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/bellman_ford_shortest_paths.hpp:97:5: required from ‘bool boost::bellman_ford_shortest_paths(EdgeListGraph&, Size, WeightMap, PredecessorMap, DistanceMap, BinaryFunction, BinaryPredicate, BellmanFordVisitor) [with EdgeListGraph = adjacency_list, property >, no_property, listS>; Size = long unsigned int; WeightMap = adj_list_edge_property_map >, edge_weight_t>; PredecessorMap = dummy_property_map; DistanceMap = vec_adj_list_vertex_property_map, property >, no_property, listS>, adjacency_list, property >, no_property, listS>*, double, double&, vertex_distance_t>; BinaryFunction = closed_plus; BinaryPredicate = std::less; BellmanFordVisitor = bellman_visitor<>]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/johnson_all_pairs_shortest.hpp:112:36: required from ‘bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, VertexID, Weight, const BinaryPredicate&, const BinaryFunction&, const Infinity&, DistanceZero) [with VertexAndEdgeListGraph = R_adjacency_list; DistanceMatrix = Basic2DMatrix; VertexID = vec_adj_list_vertex_id_map, long unsigned int>; Weight = adj_list_edge_property_map, edge_weight_t>; BinaryPredicate = std::less; BinaryFunction = closed_plus; Infinity = double; DistanceZero = double]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/johnson_all_pairs_shortest.hpp:164:48: required from ‘bool boost::detail::johnson_dispatch(VertexAndEdgeListGraph&, DistanceMatrix&, const boost::bgl_named_params&, Weight, VertexID) [with VertexAndEdgeListGraph = R_adjacency_list; DistanceMatrix = Basic2DMatrix; P = int; T = int; R = boost::no_property; Weight = boost::adj_list_edge_property_map, boost::edge_weight_t>; VertexID = boost::vec_adj_list_vertex_id_map, long unsigned int>]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/johnson_all_pairs_shortest.hpp:192:36: required from ‘bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&) [with VertexAndEdgeListGraph = R_adjacency_list; DistanceMatrix = Basic2DMatrix]’ sna.cpp:105:41: required from here /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::InputIterator::~InputIterator() [with TT = boost::detail::adj_list_edge_iterator, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::adjacency_list, boost::property >, boost::no_property, boost::listS> >]’ 37 | ~model() | ^ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:512:7: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 512 | BOOST_CONCEPT_USAGE(InputIterator) | ^~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements, boost::property >, boost::no_property, boost::listS> > >]’: /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/graph_concepts.hpp:87:5: required from ‘struct boost::concepts::IncidenceGraph, boost::property >, boost::no_property, boost::listS> >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/graph_concepts.hpp:75:1: required from ‘struct boost::concepts::IncidenceGraphConcept, boost::property >, boost::no_property, boost::listS> >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::concepts::IncidenceGraphConcept, boost::property >, boost::no_property, boost::listS> >]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied, boost::property >, boost::no_property, boost::listS> > >::value’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied, boost::property >, boost::no_property, boost::listS> > >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:72:8: [ skipping 5 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/dijkstra_shortest_paths.hpp:491:28: required from ‘void boost::dijkstra_shortest_paths(const VertexListGraph&, SourceInputIter, SourceInputIter, PredecessorMap, DistanceMap, WeightMap, IndexMap, Compare, Combine, DistInf, DistZero, DijkstraVisitor) [with VertexListGraph = adjacency_list, property >, no_property, listS>; SourceInputIter = long unsigned int*; DijkstraVisitor = dijkstra_visitor<>; PredecessorMap = dummy_property_map; DistanceMap = vec_adj_list_vertex_property_map, property >, no_property, listS>, adjacency_list, property >, no_property, listS>*, double, double&, vertex_distance_t>; WeightMap = adj_list_edge_property_map >, edge_weight2_t>; IndexMap = vec_adj_list_vertex_id_map, long unsigned int>; Compare = std::less; Combine = closed_plus; DistInf = double; DistZero = double]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/dijkstra_shortest_paths.hpp:505:28: required from ‘void boost::dijkstra_shortest_paths(const VertexListGraph&, typename graph_traits::vertex_descriptor, PredecessorMap, DistanceMap, WeightMap, IndexMap, Compare, Combine, DistInf, DistZero, DijkstraVisitor) [with VertexListGraph = adjacency_list, property >, no_property, listS>; DijkstraVisitor = dijkstra_visitor<>; PredecessorMap = dummy_property_map; DistanceMap = vec_adj_list_vertex_property_map, property >, no_property, listS>, adjacency_list, property >, no_property, listS>*, double, double&, vertex_distance_t>; WeightMap = adj_list_edge_property_map >, edge_weight2_t>; IndexMap = vec_adj_list_vertex_id_map, long unsigned int>; Compare = std::less; Combine = closed_plus; DistInf = double; DistZero = double; typename graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/johnson_all_pairs_shortest.hpp:127:36: required from ‘bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, VertexID, Weight, const BinaryPredicate&, const BinaryFunction&, const Infinity&, DistanceZero) [with VertexAndEdgeListGraph = R_adjacency_list; DistanceMatrix = Basic2DMatrix; VertexID = vec_adj_list_vertex_id_map, long unsigned int>; Weight = adj_list_edge_property_map, edge_weight_t>; BinaryPredicate = std::less; BinaryFunction = closed_plus; Infinity = double; DistanceZero = double]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/johnson_all_pairs_shortest.hpp:164:48: required from ‘bool boost::detail::johnson_dispatch(VertexAndEdgeListGraph&, DistanceMatrix&, const boost::bgl_named_params&, Weight, VertexID) [with VertexAndEdgeListGraph = R_adjacency_list; DistanceMatrix = Basic2DMatrix; P = int; T = int; R = boost::no_property; Weight = boost::adj_list_edge_property_map, boost::edge_weight_t>; VertexID = boost::vec_adj_list_vertex_id_map, long unsigned int>]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/johnson_all_pairs_shortest.hpp:192:36: required from ‘bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&) [with VertexAndEdgeListGraph = R_adjacency_list; DistanceMatrix = Basic2DMatrix]’ sna.cpp:105:41: required from here /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::concepts::IncidenceGraph, boost::property >, boost::no_property, boost::listS> >]’ 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ^ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::IncidenceGraphConcept, boost::property >, boost::no_property, boost::listS> >]’: /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/breadth_first_search.hpp:62:5: required from ‘void boost::breadth_first_visit(const IncidenceGraph&, SourceIterator, SourceIterator, Buffer&, BFSVisitor, ColorMap) [with IncidenceGraph = adjacency_list, property >, no_property, listS>; Buffer = d_ary_heap_indirect, long unsigned int>, long unsigned int, long unsigned int&>, vec_adj_list_vertex_property_map, property >, no_property, listS>, adjacency_list, property >, no_property, listS>*, double, double&, vertex_distance_t>, std::less, std::vector > >; BFSVisitor = detail::dijkstra_bfs_visitor, d_ary_heap_indirect, long unsigned int>, long unsigned int, long unsigned int&>, vec_adj_list_vertex_property_map, property >, no_property, listS>, adjacency_list, property >, no_property, listS>*, double, double&, vertex_distance_t>, std::less, std::vector > >, adj_list_edge_property_map >, edge_weight2_t>, dummy_property_map, vec_adj_list_vertex_property_map, property >, no_property, listS>, adjacency_list, property >, no_property, listS>*, double, double&, vertex_distance_t>, closed_plus, std::less >; ColorMap = two_bit_color_map, long unsigned int> >; SourceIterator = long unsigned int*]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/dijkstra_shortest_paths.hpp:387:24: required from ‘void boost::dijkstra_shortest_paths_no_init(const Graph&, SourceInputIter, SourceInputIter, PredecessorMap, DistanceMap, WeightMap, IndexMap, Compare, Combine, DistZero, DijkstraVisitor, ColorMap) [with Graph = adjacency_list, property >, no_property, listS>; SourceInputIter = long unsigned int*; DijkstraVisitor = dijkstra_visitor<>; PredecessorMap = dummy_property_map; DistanceMap = vec_adj_list_vertex_property_map, property >, no_property, listS>, adjacency_list, property >, no_property, listS>*, double, double&, vertex_distance_t>; WeightMap = adj_list_edge_property_map >, edge_weight2_t>; IndexMap = vec_adj_list_vertex_id_map, long unsigned int>; Compare = std::less; Combine = closed_plus; DistZero = double; ColorMap = two_bit_color_map, long unsigned int> >]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/dijkstra_shortest_paths.hpp:464:36: required from ‘void boost::dijkstra_shortest_paths(const VertexListGraph&, SourceInputIter, SourceInputIter, PredecessorMap, DistanceMap, WeightMap, IndexMap, Compare, Combine, DistInf, DistZero, DijkstraVisitor, ColorMap) [with VertexListGraph = adjacency_list, property >, no_property, listS>; SourceInputIter = long unsigned int*; DijkstraVisitor = dijkstra_visitor<>; PredecessorMap = dummy_property_map; DistanceMap = vec_adj_list_vertex_property_map, property >, no_property, listS>, adjacency_list, property >, no_property, listS>*, double, double&, vertex_distance_t>; WeightMap = adj_list_edge_property_map >, edge_weight2_t>; IndexMap = vec_adj_list_vertex_id_map, long unsigned int>; Compare = std::less; Combine = closed_plus; DistInf = double; DistZero = double; ColorMap = two_bit_color_map, long unsigned int> >]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/dijkstra_shortest_paths.hpp:417:28: required from ‘void boost::dijkstra_shortest_paths(const VertexListGraph&, SourceInputIter, SourceInputIter, PredecessorMap, DistanceMap, WeightMap, IndexMap, Compare, Combine, DistInf, DistZero, DijkstraVisitor, const bgl_named_params&, typename enable_if_c::traversal_category>::value, graph::detail::no_parameter>::type) [with VertexListGraph = adjacency_list, property >, no_property, listS>; SourceInputIter = long unsigned int*; DijkstraVisitor = dijkstra_visitor<>; PredecessorMap = dummy_property_map; DistanceMap = vec_adj_list_vertex_property_map, property >, no_property, listS>, adjacency_list, property >, no_property, listS>*, double, double&, vertex_distance_t>; WeightMap = adj_list_edge_property_map >, edge_weight2_t>; IndexMap = vec_adj_list_vertex_id_map, long unsigned int>; Compare = std::less; Combine = closed_plus; DistInf = double; DistZero = double; T = char; Tag = detail::unused_tag_type; Base = no_property; typename enable_if_c::traversal_category>::value, graph::detail::no_parameter>::type = graph::detail::no_parameter; typename graph_traits::traversal_category = adj_list_dir_traversal_tag]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/dijkstra_shortest_paths.hpp:491:28: required from ‘void boost::dijkstra_shortest_paths(const VertexListGraph&, SourceInputIter, SourceInputIter, PredecessorMap, DistanceMap, WeightMap, IndexMap, Compare, Combine, DistInf, DistZero, DijkstraVisitor) [with VertexListGraph = adjacency_list, property >, no_property, listS>; SourceInputIter = long unsigned int*; DijkstraVisitor = dijkstra_visitor<>; PredecessorMap = dummy_property_map; DistanceMap = vec_adj_list_vertex_property_map, property >, no_property, listS>, adjacency_list, property >, no_property, listS>*, double, double&, vertex_distance_t>; WeightMap = adj_list_edge_property_map >, edge_weight2_t>; IndexMap = vec_adj_list_vertex_id_map, long unsigned int>; Compare = std::less; Combine = closed_plus; DistInf = double; DistZero = double]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/dijkstra_shortest_paths.hpp:505:28: required from ‘void boost::dijkstra_shortest_paths(const VertexListGraph&, typename graph_traits::vertex_descriptor, PredecessorMap, DistanceMap, WeightMap, IndexMap, Compare, Combine, DistInf, DistZero, DijkstraVisitor) [with VertexListGraph = adjacency_list, property >, no_property, listS>; DijkstraVisitor = dijkstra_visitor<>; PredecessorMap = dummy_property_map; DistanceMap = vec_adj_list_vertex_property_map, property >, no_property, listS>, adjacency_list, property >, no_property, listS>*, double, double&, vertex_distance_t>; WeightMap = adj_list_edge_property_map >, edge_weight2_t>; IndexMap = vec_adj_list_vertex_id_map, long unsigned int>; Compare = std::less; Combine = closed_plus; DistInf = double; DistZero = double; typename graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/johnson_all_pairs_shortest.hpp:127:36: required from ‘bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, VertexID, Weight, const BinaryPredicate&, const BinaryFunction&, const Infinity&, DistanceZero) [with VertexAndEdgeListGraph = R_adjacency_list; DistanceMatrix = Basic2DMatrix; VertexID = vec_adj_list_vertex_id_map, long unsigned int>; Weight = adj_list_edge_property_map, edge_weight_t>; BinaryPredicate = std::less; BinaryFunction = closed_plus; Infinity = double; DistanceZero = double]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/johnson_all_pairs_shortest.hpp:164:48: required from ‘bool boost::detail::johnson_dispatch(VertexAndEdgeListGraph&, DistanceMatrix&, const boost::bgl_named_params&, Weight, VertexID) [with VertexAndEdgeListGraph = R_adjacency_list; DistanceMatrix = Basic2DMatrix; P = int; T = int; R = boost::no_property; Weight = boost::adj_list_edge_property_map, boost::edge_weight_t>; VertexID = boost::vec_adj_list_vertex_id_map, long unsigned int>]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/johnson_all_pairs_shortest.hpp:192:36: required from ‘bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&) [with VertexAndEdgeListGraph = R_adjacency_list; DistanceMatrix = Basic2DMatrix]’ sna.cpp:105:41: required from here /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/graph_concepts.hpp:75:15: note: in a call to non-static member function ‘boost::concepts::IncidenceGraphConcept, boost::property >, boost::no_property, boost::listS> >::~IncidenceGraphConcept()’ 75 | BOOST_concept(IncidenceGraph, (G)) : Graph< G > | ^~~~~~~~~~~~~~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/preprocessor/cat.hpp:29:34: note: in definition of macro ‘BOOST_PP_CAT_I’ 29 | # define BOOST_PP_CAT_I(a, b) a ## b | ^ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/concept_def.hpp:23:12: note: in expansion of macro ‘BOOST_PP_CAT’ 23 | struct BOOST_PP_CAT(name,Concept) \ | ^~~~~~~~~~~~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/graph_concepts.hpp:75:1: note: in expansion of macro ‘BOOST_concept’ 75 | BOOST_concept(IncidenceGraph, (G)) : Graph< G > | ^~~~~~~~~~~~~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::constraint::failed() [with Model = boost::BFSVisitorConcept, boost::d_ary_heap_indirect, long unsigned int>, long unsigned int, long unsigned int&>, boost::vec_adj_list_vertex_property_map, boost::property >, boost::no_property, boost::listS>, boost::adjacency_list, boost::property >, boost::no_property, boost::listS>*, double, double&, boost::vertex_distance_t>, std::less, std::vector > >, boost::adj_list_edge_property_map >, boost::edge_weight2_t>, boost::dummy_property_map, boost::vec_adj_list_vertex_property_map, boost::property >, boost::no_property, boost::listS>, boost::adjacency_list, boost::property >, boost::no_property, boost::listS>*, double, double&, boost::vertex_distance_t>, boost::closed_plus, std::less >, boost::adjacency_list, boost::property >, boost::no_property, boost::listS> >]’: /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/breadth_first_search.hpp:65:5: required from ‘void boost::breadth_first_visit(const IncidenceGraph&, SourceIterator, SourceIterator, Buffer&, BFSVisitor, ColorMap) [with IncidenceGraph = adjacency_list, property >, no_property, listS>; Buffer = d_ary_heap_indirect, long unsigned int>, long unsigned int, long unsigned int&>, vec_adj_list_vertex_property_map, property >, no_property, listS>, adjacency_list, property >, no_property, listS>*, double, double&, vertex_distance_t>, std::less, std::vector > >; BFSVisitor = detail::dijkstra_bfs_visitor, d_ary_heap_indirect, long unsigned int>, long unsigned int, long unsigned int&>, vec_adj_list_vertex_property_map, property >, no_property, listS>, adjacency_list, property >, no_property, listS>*, double, double&, vertex_distance_t>, std::less, std::vector > >, adj_list_edge_property_map >, edge_weight2_t>, dummy_property_map, vec_adj_list_vertex_property_map, property >, no_property, listS>, adjacency_list, property >, no_property, listS>*, double, double&, vertex_distance_t>, closed_plus, std::less >; ColorMap = two_bit_color_map, long unsigned int> >; SourceIterator = long unsigned int*]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/dijkstra_shortest_paths.hpp:387:24: required from ‘void boost::dijkstra_shortest_paths_no_init(const Graph&, SourceInputIter, SourceInputIter, PredecessorMap, DistanceMap, WeightMap, IndexMap, Compare, Combine, DistZero, DijkstraVisitor, ColorMap) [with Graph = adjacency_list, property >, no_property, listS>; SourceInputIter = long unsigned int*; DijkstraVisitor = dijkstra_visitor<>; PredecessorMap = dummy_property_map; DistanceMap = vec_adj_list_vertex_property_map, property >, no_property, listS>, adjacency_list, property >, no_property, listS>*, double, double&, vertex_distance_t>; WeightMap = adj_list_edge_property_map >, edge_weight2_t>; IndexMap = vec_adj_list_vertex_id_map, long unsigned int>; Compare = std::less; Combine = closed_plus; DistZero = double; ColorMap = two_bit_color_map, long unsigned int> >]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/dijkstra_shortest_paths.hpp:464:36: required from ‘void boost::dijkstra_shortest_paths(const VertexListGraph&, SourceInputIter, SourceInputIter, PredecessorMap, DistanceMap, WeightMap, IndexMap, Compare, Combine, DistInf, DistZero, DijkstraVisitor, ColorMap) [with VertexListGraph = adjacency_list, property >, no_property, listS>; SourceInputIter = long unsigned int*; DijkstraVisitor = dijkstra_visitor<>; PredecessorMap = dummy_property_map; DistanceMap = vec_adj_list_vertex_property_map, property >, no_property, listS>, adjacency_list, property >, no_property, listS>*, double, double&, vertex_distance_t>; WeightMap = adj_list_edge_property_map >, edge_weight2_t>; IndexMap = vec_adj_list_vertex_id_map, long unsigned int>; Compare = std::less; Combine = closed_plus; DistInf = double; DistZero = double; ColorMap = two_bit_color_map, long unsigned int> >]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/dijkstra_shortest_paths.hpp:417:28: required from ‘void boost::dijkstra_shortest_paths(const VertexListGraph&, SourceInputIter, SourceInputIter, PredecessorMap, DistanceMap, WeightMap, IndexMap, Compare, Combine, DistInf, DistZero, DijkstraVisitor, const bgl_named_params&, typename enable_if_c::traversal_category>::value, graph::detail::no_parameter>::type) [with VertexListGraph = adjacency_list, property >, no_property, listS>; SourceInputIter = long unsigned int*; DijkstraVisitor = dijkstra_visitor<>; PredecessorMap = dummy_property_map; DistanceMap = vec_adj_list_vertex_property_map, property >, no_property, listS>, adjacency_list, property >, no_property, listS>*, double, double&, vertex_distance_t>; WeightMap = adj_list_edge_property_map >, edge_weight2_t>; IndexMap = vec_adj_list_vertex_id_map, long unsigned int>; Compare = std::less; Combine = closed_plus; DistInf = double; DistZero = double; T = char; Tag = detail::unused_tag_type; Base = no_property; typename enable_if_c::traversal_category>::value, graph::detail::no_parameter>::type = graph::detail::no_parameter; typename graph_traits::traversal_category = adj_list_dir_traversal_tag]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/dijkstra_shortest_paths.hpp:491:28: required from ‘void boost::dijkstra_shortest_paths(const VertexListGraph&, SourceInputIter, SourceInputIter, PredecessorMap, DistanceMap, WeightMap, IndexMap, Compare, Combine, DistInf, DistZero, DijkstraVisitor) [with VertexListGraph = adjacency_list, property >, no_property, listS>; SourceInputIter = long unsigned int*; DijkstraVisitor = dijkstra_visitor<>; PredecessorMap = dummy_property_map; DistanceMap = vec_adj_list_vertex_property_map, property >, no_property, listS>, adjacency_list, property >, no_property, listS>*, double, double&, vertex_distance_t>; WeightMap = adj_list_edge_property_map >, edge_weight2_t>; IndexMap = vec_adj_list_vertex_id_map, long unsigned int>; Compare = std::less; Combine = closed_plus; DistInf = double; DistZero = double]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/dijkstra_shortest_paths.hpp:505:28: required from ‘void boost::dijkstra_shortest_paths(const VertexListGraph&, typename graph_traits::vertex_descriptor, PredecessorMap, DistanceMap, WeightMap, IndexMap, Compare, Combine, DistInf, DistZero, DijkstraVisitor) [with VertexListGraph = adjacency_list, property >, no_property, listS>; DijkstraVisitor = dijkstra_visitor<>; PredecessorMap = dummy_property_map; DistanceMap = vec_adj_list_vertex_property_map, property >, no_property, listS>, adjacency_list, property >, no_property, listS>*, double, double&, vertex_distance_t>; WeightMap = adj_list_edge_property_map >, edge_weight2_t>; IndexMap = vec_adj_list_vertex_id_map, long unsigned int>; Compare = std::less; Combine = closed_plus; DistInf = double; DistZero = double; typename graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/johnson_all_pairs_shortest.hpp:127:36: required from ‘bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, VertexID, Weight, const BinaryPredicate&, const BinaryFunction&, const Infinity&, DistanceZero) [with VertexAndEdgeListGraph = R_adjacency_list; DistanceMatrix = Basic2DMatrix; VertexID = vec_adj_list_vertex_id_map, long unsigned int>; Weight = adj_list_edge_property_map, edge_weight_t>; BinaryPredicate = std::less; BinaryFunction = closed_plus; Infinity = double; DistanceZero = double]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/johnson_all_pairs_shortest.hpp:164:48: required from ‘bool boost::detail::johnson_dispatch(VertexAndEdgeListGraph&, DistanceMatrix&, const boost::bgl_named_params&, Weight, VertexID) [with VertexAndEdgeListGraph = R_adjacency_list; DistanceMatrix = Basic2DMatrix; P = int; T = int; R = boost::no_property; Weight = boost::adj_list_edge_property_map, boost::edge_weight_t>; VertexID = boost::vec_adj_list_vertex_id_map, long unsigned int>]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/johnson_all_pairs_shortest.hpp:192:36: required from ‘bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&) [with VertexAndEdgeListGraph = R_adjacency_list; DistanceMatrix = Basic2DMatrix]’ sna.cpp:105:41: required from here /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:65:52: warning: ‘this’ pointer is null [-Wnonnull] 65 | static void failed() { ((Model*)0)->constraints(); } | ~~~~~~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/breadth_first_search.hpp:37:10: note: in a call to non-static member function ‘void boost::BFSVisitorConcept::constraints() [with Visitor = boost::detail::dijkstra_bfs_visitor, boost::d_ary_heap_indirect, long unsigned int>, long unsigned int, long unsigned int&>, boost::vec_adj_list_vertex_property_map, boost::property >, boost::no_property, boost::listS>, boost::adjacency_list, boost::property >, boost::no_property, boost::listS>*, double, double&, boost::vertex_distance_t>, std::less, std::vector > >, boost::adj_list_edge_property_map >, boost::edge_weight2_t>, boost::dummy_property_map, boost::vec_adj_list_vertex_property_map, boost::property >, boost::no_property, boost::listS>, boost::adjacency_list, boost::property >, boost::no_property, boost::listS>*, double, double&, boost::vertex_distance_t>, boost::closed_plus, std::less >; Graph = boost::adjacency_list, boost::property >, boost::no_property, boost::listS>]’ 37 | void constraints() | ^~~~~~~~~~~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::constraint::failed() [with Model = boost::ReadWritePropertyMapConcept, long unsigned int> >, long unsigned int>]’: /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/breadth_first_search.hpp:66:5: required from ‘void boost::breadth_first_visit(const IncidenceGraph&, SourceIterator, SourceIterator, Buffer&, BFSVisitor, ColorMap) [with IncidenceGraph = adjacency_list, property >, no_property, listS>; Buffer = d_ary_heap_indirect, long unsigned int>, long unsigned int, long unsigned int&>, vec_adj_list_vertex_property_map, property >, no_property, listS>, adjacency_list, property >, no_property, listS>*, double, double&, vertex_distance_t>, std::less, std::vector > >; BFSVisitor = detail::dijkstra_bfs_visitor, d_ary_heap_indirect, long unsigned int>, long unsigned int, long unsigned int&>, vec_adj_list_vertex_property_map, property >, no_property, listS>, adjacency_list, property >, no_property, listS>*, double, double&, vertex_distance_t>, std::less, std::vector > >, adj_list_edge_property_map >, edge_weight2_t>, dummy_property_map, vec_adj_list_vertex_property_map, property >, no_property, listS>, adjacency_list, property >, no_property, listS>*, double, double&, vertex_distance_t>, closed_plus, std::less >; ColorMap = two_bit_color_map, long unsigned int> >; SourceIterator = long unsigned int*]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/dijkstra_shortest_paths.hpp:387:24: required from ‘void boost::dijkstra_shortest_paths_no_init(const Graph&, SourceInputIter, SourceInputIter, PredecessorMap, DistanceMap, WeightMap, IndexMap, Compare, Combine, DistZero, DijkstraVisitor, ColorMap) [with Graph = adjacency_list, property >, no_property, listS>; SourceInputIter = long unsigned int*; DijkstraVisitor = dijkstra_visitor<>; PredecessorMap = dummy_property_map; DistanceMap = vec_adj_list_vertex_property_map, property >, no_property, listS>, adjacency_list, property >, no_property, listS>*, double, double&, vertex_distance_t>; WeightMap = adj_list_edge_property_map >, edge_weight2_t>; IndexMap = vec_adj_list_vertex_id_map, long unsigned int>; Compare = std::less; Combine = closed_plus; DistZero = double; ColorMap = two_bit_color_map, long unsigned int> >]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/dijkstra_shortest_paths.hpp:464:36: required from ‘void boost::dijkstra_shortest_paths(const VertexListGraph&, SourceInputIter, SourceInputIter, PredecessorMap, DistanceMap, WeightMap, IndexMap, Compare, Combine, DistInf, DistZero, DijkstraVisitor, ColorMap) [with VertexListGraph = adjacency_list, property >, no_property, listS>; SourceInputIter = long unsigned int*; DijkstraVisitor = dijkstra_visitor<>; PredecessorMap = dummy_property_map; DistanceMap = vec_adj_list_vertex_property_map, property >, no_property, listS>, adjacency_list, property >, no_property, listS>*, double, double&, vertex_distance_t>; WeightMap = adj_list_edge_property_map >, edge_weight2_t>; IndexMap = vec_adj_list_vertex_id_map, long unsigned int>; Compare = std::less; Combine = closed_plus; DistInf = double; DistZero = double; ColorMap = two_bit_color_map, long unsigned int> >]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/dijkstra_shortest_paths.hpp:417:28: required from ‘void boost::dijkstra_shortest_paths(const VertexListGraph&, SourceInputIter, SourceInputIter, PredecessorMap, DistanceMap, WeightMap, IndexMap, Compare, Combine, DistInf, DistZero, DijkstraVisitor, const bgl_named_params&, typename enable_if_c::traversal_category>::value, graph::detail::no_parameter>::type) [with VertexListGraph = adjacency_list, property >, no_property, listS>; SourceInputIter = long unsigned int*; DijkstraVisitor = dijkstra_visitor<>; PredecessorMap = dummy_property_map; DistanceMap = vec_adj_list_vertex_property_map, property >, no_property, listS>, adjacency_list, property >, no_property, listS>*, double, double&, vertex_distance_t>; WeightMap = adj_list_edge_property_map >, edge_weight2_t>; IndexMap = vec_adj_list_vertex_id_map, long unsigned int>; Compare = std::less; Combine = closed_plus; DistInf = double; DistZero = double; T = char; Tag = detail::unused_tag_type; Base = no_property; typename enable_if_c::traversal_category>::value, graph::detail::no_parameter>::type = graph::detail::no_parameter; typename graph_traits::traversal_category = adj_list_dir_traversal_tag]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/dijkstra_shortest_paths.hpp:491:28: required from ‘void boost::dijkstra_shortest_paths(const VertexListGraph&, SourceInputIter, SourceInputIter, PredecessorMap, DistanceMap, WeightMap, IndexMap, Compare, Combine, DistInf, DistZero, DijkstraVisitor) [with VertexListGraph = adjacency_list, property >, no_property, listS>; SourceInputIter = long unsigned int*; DijkstraVisitor = dijkstra_visitor<>; PredecessorMap = dummy_property_map; DistanceMap = vec_adj_list_vertex_property_map, property >, no_property, listS>, adjacency_list, property >, no_property, listS>*, double, double&, vertex_distance_t>; WeightMap = adj_list_edge_property_map >, edge_weight2_t>; IndexMap = vec_adj_list_vertex_id_map, long unsigned int>; Compare = std::less; Combine = closed_plus; DistInf = double; DistZero = double]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/dijkstra_shortest_paths.hpp:505:28: required from ‘void boost::dijkstra_shortest_paths(const VertexListGraph&, typename graph_traits::vertex_descriptor, PredecessorMap, DistanceMap, WeightMap, IndexMap, Compare, Combine, DistInf, DistZero, DijkstraVisitor) [with VertexListGraph = adjacency_list, property >, no_property, listS>; DijkstraVisitor = dijkstra_visitor<>; PredecessorMap = dummy_property_map; DistanceMap = vec_adj_list_vertex_property_map, property >, no_property, listS>, adjacency_list, property >, no_property, listS>*, double, double&, vertex_distance_t>; WeightMap = adj_list_edge_property_map >, edge_weight2_t>; IndexMap = vec_adj_list_vertex_id_map, long unsigned int>; Compare = std::less; Combine = closed_plus; DistInf = double; DistZero = double; typename graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/johnson_all_pairs_shortest.hpp:127:36: required from ‘bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, VertexID, Weight, const BinaryPredicate&, const BinaryFunction&, const Infinity&, DistanceZero) [with VertexAndEdgeListGraph = R_adjacency_list; DistanceMatrix = Basic2DMatrix; VertexID = vec_adj_list_vertex_id_map, long unsigned int>; Weight = adj_list_edge_property_map, edge_weight_t>; BinaryPredicate = std::less; BinaryFunction = closed_plus; Infinity = double; DistanceZero = double]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/johnson_all_pairs_shortest.hpp:164:48: required from ‘bool boost::detail::johnson_dispatch(VertexAndEdgeListGraph&, DistanceMatrix&, const boost::bgl_named_params&, Weight, VertexID) [with VertexAndEdgeListGraph = R_adjacency_list; DistanceMatrix = Basic2DMatrix; P = int; T = int; R = boost::no_property; Weight = boost::adj_list_edge_property_map, boost::edge_weight_t>; VertexID = boost::vec_adj_list_vertex_id_map, long unsigned int>]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/johnson_all_pairs_shortest.hpp:192:36: required from ‘bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&) [with VertexAndEdgeListGraph = R_adjacency_list; DistanceMatrix = Basic2DMatrix]’ sna.cpp:105:41: required from here /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:65:52: warning: ‘this’ pointer is null [-Wnonnull] 65 | static void failed() { ((Model*)0)->constraints(); } | ~~~~~~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/property_map/property_map.hpp:205:10: note: in a call to non-static member function ‘void boost::ReadWritePropertyMapConcept::constraints() [with PMap = boost::two_bit_color_map, long unsigned int> >; Key = long unsigned int]’ 205 | void constraints() { | ^~~~~~~~~~~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::concepts::Graph > > > >, boost::is_residual_edge > > >, boost::edge_residual_capacity_t> >, boost::keep_all> >]’: /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements > > > >, boost::is_residual_edge > > >, boost::edge_residual_capacity_t> >, boost::keep_all> > >]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/graph_concepts.hpp:66:5: required from ‘struct boost::concepts::Graph > > > >, boost::is_residual_edge > > >, boost::edge_residual_capacity_t> >, boost::keep_all> >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/graph_concepts.hpp:75:1: required from ‘struct boost::concepts::IncidenceGraph > > > >, boost::is_residual_edge > > >, boost::edge_residual_capacity_t> >, boost::keep_all> >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/graph_concepts.hpp:75:1: required from ‘struct boost::concepts::IncidenceGraphConcept > > > >, boost::is_residual_edge > > >, boost::edge_residual_capacity_t> >, boost::keep_all> >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::concepts::IncidenceGraphConcept > > > >, boost::is_residual_edge > > >, boost::edge_residual_capacity_t> >, boost::keep_all> >]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:42:5: [ skipping 6 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/edmonds_karp_max_flow.hpp:101:29: required from ‘typename boost::property_traits::value_type boost::edmonds_karp_max_flow(Graph&, typename graph_traits::vertex_descriptor, typename graph_traits::vertex_descriptor, CapacityEdgeMap, ResidualCapacityEdgeMap, ReverseEdgeMap, ColorMap, PredEdgeMap) [with Graph = adjacency_list > > > >; CapacityEdgeMap = adj_list_edge_property_map > > >, edge_capacity_t>; ResidualCapacityEdgeMap = adj_list_edge_property_map > > >, edge_residual_capacity_t>; ReverseEdgeMap = adj_list_edge_property_map, const detail::edge_desc_impl&, long unsigned int, const property > > >, edge_reverse_t>; ColorMap = iterator_property_map<__gnu_cxx::__normal_iterator >, vec_adj_list_vertex_id_map, default_color_type, default_color_type&>; PredEdgeMap = iterator_property_map<__gnu_cxx::__normal_iterator*, std::vector, std::allocator > > >, vec_adj_list_vertex_id_map, detail::edge_desc_impl, detail::edge_desc_impl&>; typename property_traits::value_type = double; typename graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/edmonds_karp_max_flow.hpp:154:41: required from ‘static typename boost::detail::edge_capacity_value::type boost::detail::edmonds_karp_dispatch2::apply(Graph&, typename boost::graph_traits::vertex_descriptor, typename boost::graph_traits::vertex_descriptor, PredMap, const boost::bgl_named_params&, boost::param_not_found) [with Graph = boost::adjacency_list > > > >; PredMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator*, std::vector, std::allocator > > >, boost::vec_adj_list_vertex_id_map, boost::detail::edge_desc_impl, boost::detail::edge_desc_impl&>; P = int; T = boost::buffer_param_t; R = boost::no_property; typename boost::detail::edge_capacity_value::type = double; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/edmonds_karp_max_flow.hpp:208:54: required from ‘static typename boost::detail::edge_capacity_value::type boost::detail::edmonds_karp_dispatch1::apply(Graph&, typename boost::graph_traits::vertex_descriptor, typename boost::graph_traits::vertex_descriptor, const boost::bgl_named_params&, boost::param_not_found) [with Graph = boost::adjacency_list > > > >; P = int; T = boost::buffer_param_t; R = boost::no_property; typename boost::detail::edge_capacity_value::type = double; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/edmonds_karp_max_flow.hpp:228:57: required from ‘typename boost::detail::edge_capacity_value::type boost::edmonds_karp_max_flow(Graph&, typename graph_traits::vertex_descriptor, typename graph_traits::vertex_descriptor, const bgl_named_params&) [with Graph = adjacency_list > > > >; P = int; T = buffer_param_t; R = no_property; typename detail::edge_capacity_value::type = double; typename graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/edmonds_karp_max_flow.hpp:240:33: required from ‘typename boost::property_traits::const_type>::value_type boost::edmonds_karp_max_flow(Graph&, typename graph_traits::vertex_descriptor, typename graph_traits::vertex_descriptor) [with Graph = adjacency_list > > > >; typename property_traits::const_type>::value_type = double; typename property_map::const_type = adj_list_edge_property_map > > >, edge_capacity_t>; typename graph_traits::vertex_descriptor = long unsigned int]’ sna.cpp:204:54: required from here /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::concepts::Graph::~Graph() [with G = boost::filtered_graph > > > >, boost::is_residual_edge > > >, boost::edge_residual_capacity_t> >, boost::keep_all>]’ 37 | ~model() | ^ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/graph_concepts.hpp:66:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 66 | BOOST_CONCEPT_USAGE(Graph) | ^~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::concepts::IncidenceGraph > > > >, boost::is_residual_edge > > >, boost::edge_residual_capacity_t> >, boost::keep_all> >]’: /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements > > > >, boost::is_residual_edge > > >, boost::edge_residual_capacity_t> >, boost::keep_all> > >]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/graph_concepts.hpp:87:5: required from ‘struct boost::concepts::IncidenceGraph > > > >, boost::is_residual_edge > > >, boost::edge_residual_capacity_t> >, boost::keep_all> >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/graph_concepts.hpp:75:1: required from ‘struct boost::concepts::IncidenceGraphConcept > > > >, boost::is_residual_edge > > >, boost::edge_residual_capacity_t> >, boost::keep_all> >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::concepts::IncidenceGraphConcept > > > >, boost::is_residual_edge > > >, boost::edge_residual_capacity_t> >, boost::keep_all> >]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied > > > >, boost::is_residual_edge > > >, boost::edge_residual_capacity_t> >, boost::keep_all> > >::value’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:45:51: [ skipping 5 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/edmonds_karp_max_flow.hpp:101:29: required from ‘typename boost::property_traits::value_type boost::edmonds_karp_max_flow(Graph&, typename graph_traits::vertex_descriptor, typename graph_traits::vertex_descriptor, CapacityEdgeMap, ResidualCapacityEdgeMap, ReverseEdgeMap, ColorMap, PredEdgeMap) [with Graph = adjacency_list > > > >; CapacityEdgeMap = adj_list_edge_property_map > > >, edge_capacity_t>; ResidualCapacityEdgeMap = adj_list_edge_property_map > > >, edge_residual_capacity_t>; ReverseEdgeMap = adj_list_edge_property_map, const detail::edge_desc_impl&, long unsigned int, const property > > >, edge_reverse_t>; ColorMap = iterator_property_map<__gnu_cxx::__normal_iterator >, vec_adj_list_vertex_id_map, default_color_type, default_color_type&>; PredEdgeMap = iterator_property_map<__gnu_cxx::__normal_iterator*, std::vector, std::allocator > > >, vec_adj_list_vertex_id_map, detail::edge_desc_impl, detail::edge_desc_impl&>; typename property_traits::value_type = double; typename graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/edmonds_karp_max_flow.hpp:154:41: required from ‘static typename boost::detail::edge_capacity_value::type boost::detail::edmonds_karp_dispatch2::apply(Graph&, typename boost::graph_traits::vertex_descriptor, typename boost::graph_traits::vertex_descriptor, PredMap, const boost::bgl_named_params&, boost::param_not_found) [with Graph = boost::adjacency_list > > > >; PredMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator*, std::vector, std::allocator > > >, boost::vec_adj_list_vertex_id_map, boost::detail::edge_desc_impl, boost::detail::edge_desc_impl&>; P = int; T = boost::buffer_param_t; R = boost::no_property; typename boost::detail::edge_capacity_value::type = double; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/edmonds_karp_max_flow.hpp:208:54: required from ‘static typename boost::detail::edge_capacity_value::type boost::detail::edmonds_karp_dispatch1::apply(Graph&, typename boost::graph_traits::vertex_descriptor, typename boost::graph_traits::vertex_descriptor, const boost::bgl_named_params&, boost::param_not_found) [with Graph = boost::adjacency_list > > > >; P = int; T = boost::buffer_param_t; R = boost::no_property; typename boost::detail::edge_capacity_value::type = double; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/edmonds_karp_max_flow.hpp:228:57: required from ‘typename boost::detail::edge_capacity_value::type boost::edmonds_karp_max_flow(Graph&, typename graph_traits::vertex_descriptor, typename graph_traits::vertex_descriptor, const bgl_named_params&) [with Graph = adjacency_list > > > >; P = int; T = buffer_param_t; R = no_property; typename detail::edge_capacity_value::type = double; typename graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/edmonds_karp_max_flow.hpp:240:33: required from ‘typename boost::property_traits::const_type>::value_type boost::edmonds_karp_max_flow(Graph&, typename graph_traits::vertex_descriptor, typename graph_traits::vertex_descriptor) [with Graph = adjacency_list > > > >; typename property_traits::const_type>::value_type = double; typename property_map::const_type = adj_list_edge_property_map > > >, edge_capacity_t>; typename graph_traits::vertex_descriptor = long unsigned int]’ sna.cpp:204:54: required from here /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::concepts::IncidenceGraph::~IncidenceGraph() [with G = boost::filtered_graph > > > >, boost::is_residual_edge > > >, boost::edge_residual_capacity_t> >, boost::keep_all>]’ 37 | ~model() | ^ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/graph_concepts.hpp:87:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 87 | BOOST_CONCEPT_USAGE(IncidenceGraph) | ^~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements*, std::vector, std::allocator > > >, boost::vec_adj_list_vertex_id_map, boost::detail::edge_desc_impl, boost::detail::edge_desc_impl&>, boost::on_tree_edge> > > >]’: /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:167:5: required from ‘struct boost::CopyConstructible*, std::vector, std::allocator > > >, boost::vec_adj_list_vertex_id_map, boost::detail::edge_desc_impl, boost::detail::edge_desc_impl&>, boost::on_tree_edge> > >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:165:3: required from ‘struct boost::CopyConstructibleConcept*, std::vector, std::allocator > > >, boost::vec_adj_list_vertex_id_map, boost::detail::edge_desc_impl, boost::detail::edge_desc_impl&>, boost::on_tree_edge> > >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::CopyConstructibleConcept*, std::vector, std::allocator > > >, boost::vec_adj_list_vertex_id_map, boost::detail::edge_desc_impl, boost::detail::edge_desc_impl&>, boost::on_tree_edge> > >]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied*, std::vector, std::allocator > > >, boost::vec_adj_list_vertex_id_map, boost::detail::edge_desc_impl, boost::detail::edge_desc_impl&>, boost::on_tree_edge> > > >::value’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied*, std::vector, std::allocator > > >, boost::vec_adj_list_vertex_id_map, boost::detail::edge_desc_impl, boost::detail::edge_desc_impl&>, boost::on_tree_edge> > > >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:72:8: [ skipping 9 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/edmonds_karp_max_flow.hpp:101:29: required from ‘typename boost::property_traits::value_type boost::edmonds_karp_max_flow(Graph&, typename graph_traits::vertex_descriptor, typename graph_traits::vertex_descriptor, CapacityEdgeMap, ResidualCapacityEdgeMap, ReverseEdgeMap, ColorMap, PredEdgeMap) [with Graph = adjacency_list > > > >; CapacityEdgeMap = adj_list_edge_property_map > > >, edge_capacity_t>; ResidualCapacityEdgeMap = adj_list_edge_property_map > > >, edge_residual_capacity_t>; ReverseEdgeMap = adj_list_edge_property_map, const detail::edge_desc_impl&, long unsigned int, const property > > >, edge_reverse_t>; ColorMap = iterator_property_map<__gnu_cxx::__normal_iterator >, vec_adj_list_vertex_id_map, default_color_type, default_color_type&>; PredEdgeMap = iterator_property_map<__gnu_cxx::__normal_iterator*, std::vector, std::allocator > > >, vec_adj_list_vertex_id_map, detail::edge_desc_impl, detail::edge_desc_impl&>; typename property_traits::value_type = double; typename graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/edmonds_karp_max_flow.hpp:154:41: required from ‘static typename boost::detail::edge_capacity_value::type boost::detail::edmonds_karp_dispatch2::apply(Graph&, typename boost::graph_traits::vertex_descriptor, typename boost::graph_traits::vertex_descriptor, PredMap, const boost::bgl_named_params&, boost::param_not_found) [with Graph = boost::adjacency_list > > > >; PredMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator*, std::vector, std::allocator > > >, boost::vec_adj_list_vertex_id_map, boost::detail::edge_desc_impl, boost::detail::edge_desc_impl&>; P = int; T = boost::buffer_param_t; R = boost::no_property; typename boost::detail::edge_capacity_value::type = double; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/edmonds_karp_max_flow.hpp:208:54: required from ‘static typename boost::detail::edge_capacity_value::type boost::detail::edmonds_karp_dispatch1::apply(Graph&, typename boost::graph_traits::vertex_descriptor, typename boost::graph_traits::vertex_descriptor, const boost::bgl_named_params&, boost::param_not_found) [with Graph = boost::adjacency_list > > > >; P = int; T = boost::buffer_param_t; R = boost::no_property; typename boost::detail::edge_capacity_value::type = double; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/edmonds_karp_max_flow.hpp:228:57: required from ‘typename boost::detail::edge_capacity_value::type boost::edmonds_karp_max_flow(Graph&, typename graph_traits::vertex_descriptor, typename graph_traits::vertex_descriptor, const bgl_named_params&) [with Graph = adjacency_list > > > >; P = int; T = buffer_param_t; R = no_property; typename detail::edge_capacity_value::type = double; typename graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/edmonds_karp_max_flow.hpp:240:33: required from ‘typename boost::property_traits::const_type>::value_type boost::edmonds_karp_max_flow(Graph&, typename graph_traits::vertex_descriptor, typename graph_traits::vertex_descriptor) [with Graph = adjacency_list > > > >; typename property_traits::const_type>::value_type = double; typename property_map::const_type = adj_list_edge_property_map > > >, edge_capacity_t>; typename graph_traits::vertex_descriptor = long unsigned int]’ sna.cpp:204:54: required from here /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::CopyConstructible*, std::vector, std::allocator > > >, boost::vec_adj_list_vertex_id_map, boost::detail::edge_desc_impl, boost::detail::edge_desc_impl&>, boost::on_tree_edge> > >]’ 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ^ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::CopyConstructibleConcept*, std::vector, std::allocator > > >, boost::vec_adj_list_vertex_id_map, boost::detail::edge_desc_impl, boost::detail::edge_desc_impl&>, boost::on_tree_edge> > >]’: /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/bellman_ford_shortest_paths.hpp:40:9: required from ‘void boost::BFSVisitorConcept::constraints() [with Visitor = boost::bfs_visitor*, std::vector, std::allocator > > >, boost::vec_adj_list_vertex_id_map, boost::detail::edge_desc_impl, boost::detail::edge_desc_impl&>, boost::on_tree_edge> >; Graph = boost::filtered_graph > > > >, boost::is_residual_edge > > >, boost::edge_residual_capacity_t> >, boost::keep_all>]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::BFSVisitorConcept*, std::vector, std::allocator > > >, boost::vec_adj_list_vertex_id_map, boost::detail::edge_desc_impl, boost::detail::edge_desc_impl&>, boost::on_tree_edge> >, boost::filtered_graph > > > >, boost::is_residual_edge > > >, boost::edge_residual_capacity_t> >, boost::keep_all> >]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied*, std::vector, std::allocator > > >, boost::vec_adj_list_vertex_id_map, boost::detail::edge_desc_impl, boost::detail::edge_desc_impl&>, boost::on_tree_edge> >, boost::filtered_graph > > > >, boost::is_residual_edge > > >, boost::edge_residual_capacity_t> >, boost::keep_all> > >::value’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied*, std::vector, std::allocator > > >, boost::vec_adj_list_vertex_id_map, boost::detail::edge_desc_impl, boost::detail::edge_desc_impl&>, boost::on_tree_edge> >, boost::filtered_graph > > > >, boost::is_residual_edge > > >, boost::edge_residual_capacity_t> >, boost::keep_all> > >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_*, std::vector, std::allocator > > >, boost::vec_adj_list_vertex_id_map, boost::detail::edge_desc_impl, boost::detail::edge_desc_impl&>, boost::on_tree_edge> >, boost::filtered_graph > > > >, boost::is_residual_edge > > >, boost::edge_residual_capacity_t> >, boost::keep_all> >)>’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/breadth_first_search.hpp:65:5: [ skipping 3 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/edmonds_karp_max_flow.hpp:101:29: required from ‘typename boost::property_traits::value_type boost::edmonds_karp_max_flow(Graph&, typename graph_traits::vertex_descriptor, typename graph_traits::vertex_descriptor, CapacityEdgeMap, ResidualCapacityEdgeMap, ReverseEdgeMap, ColorMap, PredEdgeMap) [with Graph = adjacency_list > > > >; CapacityEdgeMap = adj_list_edge_property_map > > >, edge_capacity_t>; ResidualCapacityEdgeMap = adj_list_edge_property_map > > >, edge_residual_capacity_t>; ReverseEdgeMap = adj_list_edge_property_map, const detail::edge_desc_impl&, long unsigned int, const property > > >, edge_reverse_t>; ColorMap = iterator_property_map<__gnu_cxx::__normal_iterator >, vec_adj_list_vertex_id_map, default_color_type, default_color_type&>; PredEdgeMap = iterator_property_map<__gnu_cxx::__normal_iterator*, std::vector, std::allocator > > >, vec_adj_list_vertex_id_map, detail::edge_desc_impl, detail::edge_desc_impl&>; typename property_traits::value_type = double; typename graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/edmonds_karp_max_flow.hpp:154:41: required from ‘static typename boost::detail::edge_capacity_value::type boost::detail::edmonds_karp_dispatch2::apply(Graph&, typename boost::graph_traits::vertex_descriptor, typename boost::graph_traits::vertex_descriptor, PredMap, const boost::bgl_named_params&, boost::param_not_found) [with Graph = boost::adjacency_list > > > >; PredMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator*, std::vector, std::allocator > > >, boost::vec_adj_list_vertex_id_map, boost::detail::edge_desc_impl, boost::detail::edge_desc_impl&>; P = int; T = boost::buffer_param_t; R = boost::no_property; typename boost::detail::edge_capacity_value::type = double; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/edmonds_karp_max_flow.hpp:208:54: required from ‘static typename boost::detail::edge_capacity_value::type boost::detail::edmonds_karp_dispatch1::apply(Graph&, typename boost::graph_traits::vertex_descriptor, typename boost::graph_traits::vertex_descriptor, const boost::bgl_named_params&, boost::param_not_found) [with Graph = boost::adjacency_list > > > >; P = int; T = boost::buffer_param_t; R = boost::no_property; typename boost::detail::edge_capacity_value::type = double; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/edmonds_karp_max_flow.hpp:228:57: required from ‘typename boost::detail::edge_capacity_value::type boost::edmonds_karp_max_flow(Graph&, typename graph_traits::vertex_descriptor, typename graph_traits::vertex_descriptor, const bgl_named_params&) [with Graph = adjacency_list > > > >; P = int; T = buffer_param_t; R = no_property; typename detail::edge_capacity_value::type = double; typename graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/edmonds_karp_max_flow.hpp:240:33: required from ‘typename boost::property_traits::const_type>::value_type boost::edmonds_karp_max_flow(Graph&, typename graph_traits::vertex_descriptor, typename graph_traits::vertex_descriptor) [with Graph = adjacency_list > > > >; typename property_traits::const_type>::value_type = double; typename property_map::const_type = adj_list_edge_property_map > > >, edge_capacity_t>; typename graph_traits::vertex_descriptor = long unsigned int]’ sna.cpp:204:54: required from here /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:165:17: note: in a call to non-static member function ‘boost::CopyConstructibleConcept*, std::vector, std::allocator > > >, boost::vec_adj_list_vertex_id_map, boost::detail::edge_desc_impl, boost::detail::edge_desc_impl&>, boost::on_tree_edge> > >::~CopyConstructibleConcept()’ 165 | BOOST_concept(CopyConstructible,(TT)) | ^~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/preprocessor/cat.hpp:29:34: note: in definition of macro ‘BOOST_PP_CAT_I’ 29 | # define BOOST_PP_CAT_I(a, b) a ## b | ^ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/concept_def.hpp:23:12: note: in expansion of macro ‘BOOST_PP_CAT’ 23 | struct BOOST_PP_CAT(name,Concept) \ | ^~~~~~~~~~~~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:165:3: note: in expansion of macro ‘BOOST_concept’ 165 | BOOST_concept(CopyConstructible,(TT)) | ^~~~~~~~~~~~~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::constraint::failed() [with Model = boost::ReadablePropertyMapConcept >, boost::vec_adj_list_vertex_id_map, boost::default_color_type, boost::default_color_type&>, long unsigned int>]’: /home/omnipath/local/R/4.4-3.20/BH/include/boost/property_map/property_map.hpp:206:7: required from ‘void boost::ReadWritePropertyMapConcept::constraints() [with PMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map, boost::default_color_type, boost::default_color_type&>; Key = long unsigned int]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::ReadWritePropertyMapConcept >, boost::vec_adj_list_vertex_id_map, boost::default_color_type, boost::default_color_type&>, long unsigned int>]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied >, boost::vec_adj_list_vertex_id_map, boost::default_color_type, boost::default_color_type&>, long unsigned int> >::value’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied >, boost::vec_adj_list_vertex_id_map, boost::default_color_type, boost::default_color_type&>, long unsigned int> >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_ >, boost::vec_adj_list_vertex_id_map, boost::default_color_type, boost::default_color_type&>, long unsigned int>)>’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/breadth_first_search.hpp:66:5: [ skipping 3 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/edmonds_karp_max_flow.hpp:101:29: required from ‘typename boost::property_traits::value_type boost::edmonds_karp_max_flow(Graph&, typename graph_traits::vertex_descriptor, typename graph_traits::vertex_descriptor, CapacityEdgeMap, ResidualCapacityEdgeMap, ReverseEdgeMap, ColorMap, PredEdgeMap) [with Graph = adjacency_list > > > >; CapacityEdgeMap = adj_list_edge_property_map > > >, edge_capacity_t>; ResidualCapacityEdgeMap = adj_list_edge_property_map > > >, edge_residual_capacity_t>; ReverseEdgeMap = adj_list_edge_property_map, const detail::edge_desc_impl&, long unsigned int, const property > > >, edge_reverse_t>; ColorMap = iterator_property_map<__gnu_cxx::__normal_iterator >, vec_adj_list_vertex_id_map, default_color_type, default_color_type&>; PredEdgeMap = iterator_property_map<__gnu_cxx::__normal_iterator*, std::vector, std::allocator > > >, vec_adj_list_vertex_id_map, detail::edge_desc_impl, detail::edge_desc_impl&>; typename property_traits::value_type = double; typename graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/edmonds_karp_max_flow.hpp:154:41: required from ‘static typename boost::detail::edge_capacity_value::type boost::detail::edmonds_karp_dispatch2::apply(Graph&, typename boost::graph_traits::vertex_descriptor, typename boost::graph_traits::vertex_descriptor, PredMap, const boost::bgl_named_params&, boost::param_not_found) [with Graph = boost::adjacency_list > > > >; PredMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator*, std::vector, std::allocator > > >, boost::vec_adj_list_vertex_id_map, boost::detail::edge_desc_impl, boost::detail::edge_desc_impl&>; P = int; T = boost::buffer_param_t; R = boost::no_property; typename boost::detail::edge_capacity_value::type = double; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/edmonds_karp_max_flow.hpp:208:54: required from ‘static typename boost::detail::edge_capacity_value::type boost::detail::edmonds_karp_dispatch1::apply(Graph&, typename boost::graph_traits::vertex_descriptor, typename boost::graph_traits::vertex_descriptor, const boost::bgl_named_params&, boost::param_not_found) [with Graph = boost::adjacency_list > > > >; P = int; T = boost::buffer_param_t; R = boost::no_property; typename boost::detail::edge_capacity_value::type = double; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/edmonds_karp_max_flow.hpp:228:57: required from ‘typename boost::detail::edge_capacity_value::type boost::edmonds_karp_max_flow(Graph&, typename graph_traits::vertex_descriptor, typename graph_traits::vertex_descriptor, const bgl_named_params&) [with Graph = adjacency_list > > > >; P = int; T = buffer_param_t; R = no_property; typename detail::edge_capacity_value::type = double; typename graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/edmonds_karp_max_flow.hpp:240:33: required from ‘typename boost::property_traits::const_type>::value_type boost::edmonds_karp_max_flow(Graph&, typename graph_traits::vertex_descriptor, typename graph_traits::vertex_descriptor) [with Graph = adjacency_list > > > >; typename property_traits::const_type>::value_type = double; typename property_map::const_type = adj_list_edge_property_map > > >, edge_capacity_t>; typename graph_traits::vertex_descriptor = long unsigned int]’ sna.cpp:204:54: required from here /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:65:52: warning: ‘this’ pointer is null [-Wnonnull] 65 | static void failed() { ((Model*)0)->constraints(); } | ~~~~~~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/property_map/property_map.hpp:147:10: note: in a call to non-static member function ‘void boost::ReadablePropertyMapConcept::constraints() [with PMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map, boost::default_color_type, boost::default_color_type&>; Key = long unsigned int]’ 147 | void constraints() { | ^~~~~~~~~~~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::constraint::failed() [with Model = boost::WritablePropertyMapConcept >, boost::vec_adj_list_vertex_id_map, boost::default_color_type, boost::default_color_type&>, long unsigned int>]’: /home/omnipath/local/R/4.4-3.20/BH/include/boost/property_map/property_map.hpp:207:7: required from ‘void boost::ReadWritePropertyMapConcept::constraints() [with PMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map, boost::default_color_type, boost::default_color_type&>; Key = long unsigned int]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::ReadWritePropertyMapConcept >, boost::vec_adj_list_vertex_id_map, boost::default_color_type, boost::default_color_type&>, long unsigned int>]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied >, boost::vec_adj_list_vertex_id_map, boost::default_color_type, boost::default_color_type&>, long unsigned int> >::value’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied >, boost::vec_adj_list_vertex_id_map, boost::default_color_type, boost::default_color_type&>, long unsigned int> >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_ >, boost::vec_adj_list_vertex_id_map, boost::default_color_type, boost::default_color_type&>, long unsigned int>)>’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/breadth_first_search.hpp:66:5: [ skipping 3 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/edmonds_karp_max_flow.hpp:101:29: required from ‘typename boost::property_traits::value_type boost::edmonds_karp_max_flow(Graph&, typename graph_traits::vertex_descriptor, typename graph_traits::vertex_descriptor, CapacityEdgeMap, ResidualCapacityEdgeMap, ReverseEdgeMap, ColorMap, PredEdgeMap) [with Graph = adjacency_list > > > >; CapacityEdgeMap = adj_list_edge_property_map > > >, edge_capacity_t>; ResidualCapacityEdgeMap = adj_list_edge_property_map > > >, edge_residual_capacity_t>; ReverseEdgeMap = adj_list_edge_property_map, const detail::edge_desc_impl&, long unsigned int, const property > > >, edge_reverse_t>; ColorMap = iterator_property_map<__gnu_cxx::__normal_iterator >, vec_adj_list_vertex_id_map, default_color_type, default_color_type&>; PredEdgeMap = iterator_property_map<__gnu_cxx::__normal_iterator*, std::vector, std::allocator > > >, vec_adj_list_vertex_id_map, detail::edge_desc_impl, detail::edge_desc_impl&>; typename property_traits::value_type = double; typename graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/edmonds_karp_max_flow.hpp:154:41: required from ‘static typename boost::detail::edge_capacity_value::type boost::detail::edmonds_karp_dispatch2::apply(Graph&, typename boost::graph_traits::vertex_descriptor, typename boost::graph_traits::vertex_descriptor, PredMap, const boost::bgl_named_params&, boost::param_not_found) [with Graph = boost::adjacency_list > > > >; PredMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator*, std::vector, std::allocator > > >, boost::vec_adj_list_vertex_id_map, boost::detail::edge_desc_impl, boost::detail::edge_desc_impl&>; P = int; T = boost::buffer_param_t; R = boost::no_property; typename boost::detail::edge_capacity_value::type = double; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/edmonds_karp_max_flow.hpp:208:54: required from ‘static typename boost::detail::edge_capacity_value::type boost::detail::edmonds_karp_dispatch1::apply(Graph&, typename boost::graph_traits::vertex_descriptor, typename boost::graph_traits::vertex_descriptor, const boost::bgl_named_params&, boost::param_not_found) [with Graph = boost::adjacency_list > > > >; P = int; T = boost::buffer_param_t; R = boost::no_property; typename boost::detail::edge_capacity_value::type = double; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/edmonds_karp_max_flow.hpp:228:57: required from ‘typename boost::detail::edge_capacity_value::type boost::edmonds_karp_max_flow(Graph&, typename graph_traits::vertex_descriptor, typename graph_traits::vertex_descriptor, const bgl_named_params&) [with Graph = adjacency_list > > > >; P = int; T = buffer_param_t; R = no_property; typename detail::edge_capacity_value::type = double; typename graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/edmonds_karp_max_flow.hpp:240:33: required from ‘typename boost::property_traits::const_type>::value_type boost::edmonds_karp_max_flow(Graph&, typename graph_traits::vertex_descriptor, typename graph_traits::vertex_descriptor) [with Graph = adjacency_list > > > >; typename property_traits::const_type>::value_type = double; typename property_map::const_type = adj_list_edge_property_map > > >, edge_capacity_t>; typename graph_traits::vertex_descriptor = long unsigned int]’ sna.cpp:204:54: required from here /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:65:52: warning: ‘this’ pointer is null [-Wnonnull] 65 | static void failed() { ((Model*)0)->constraints(); } | ~~~~~~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/property_map/property_map.hpp:179:10: note: in a call to non-static member function ‘void boost::WritablePropertyMapConcept::constraints() [with PMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map, boost::default_color_type, boost::default_color_type&>; Key = long unsigned int]’ 179 | void constraints() { | ^~~~~~~~~~~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements >]’: /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:208:5: required from ‘struct boost::Convertible’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::Convertible]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied >::value’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_)>’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:515:9: [ skipping 5 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/graph_concepts.hpp:226:1: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::EdgeListGraphConcept, boost::property >, boost::no_property, boost::listS> >]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/bellman_ford_shortest_paths.hpp:97:5: required from ‘bool boost::bellman_ford_shortest_paths(EdgeListGraph&, Size, WeightMap, PredecessorMap, DistanceMap, BinaryFunction, BinaryPredicate, BellmanFordVisitor) [with EdgeListGraph = adjacency_list, property >, no_property, listS>; Size = long unsigned int; WeightMap = adj_list_edge_property_map >, edge_weight_t>; PredecessorMap = dummy_property_map; DistanceMap = vec_adj_list_vertex_property_map, property >, no_property, listS>, adjacency_list, property >, no_property, listS>*, double, double&, vertex_distance_t>; BinaryFunction = closed_plus; BinaryPredicate = std::less; BellmanFordVisitor = bellman_visitor<>]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/johnson_all_pairs_shortest.hpp:112:36: required from ‘bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, VertexID, Weight, const BinaryPredicate&, const BinaryFunction&, const Infinity&, DistanceZero) [with VertexAndEdgeListGraph = R_adjacency_list; DistanceMatrix = Basic2DMatrix; VertexID = vec_adj_list_vertex_id_map, long unsigned int>; Weight = adj_list_edge_property_map, edge_weight_t>; BinaryPredicate = std::less; BinaryFunction = closed_plus; Infinity = double; DistanceZero = double]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/johnson_all_pairs_shortest.hpp:164:48: required from ‘bool boost::detail::johnson_dispatch(VertexAndEdgeListGraph&, DistanceMatrix&, const boost::bgl_named_params&, Weight, VertexID) [with VertexAndEdgeListGraph = R_adjacency_list; DistanceMatrix = Basic2DMatrix; P = int; T = int; R = boost::no_property; Weight = boost::adj_list_edge_property_map, boost::edge_weight_t>; VertexID = boost::vec_adj_list_vertex_id_map, long unsigned int>]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/johnson_all_pairs_shortest.hpp:192:36: required from ‘bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&) [with VertexAndEdgeListGraph = R_adjacency_list; DistanceMatrix = Basic2DMatrix]’ sna.cpp:105:41: required from here /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::Convertible]’ 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ^ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::Convertible]’: /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:515:9: required from ‘boost::InputIterator::~InputIterator() [with TT = boost::detail::adj_list_edge_iterator, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::adjacency_list, boost::property >, boost::no_property, boost::listS> >]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::InputIterator, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::adjacency_list, boost::property >, boost::no_property, boost::listS> > >]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/graph_concepts.hpp:53:35: required from ‘boost::concepts::MultiPassInputIterator::~MultiPassInputIterator() [with T = boost::detail::adj_list_edge_iterator, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::adjacency_list, boost::property >, boost::no_property, boost::listS> >]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::MultiPassInputIterator, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::adjacency_list, boost::property >, boost::no_property, boost::listS> > >]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/graph_concepts.hpp:235:9: required from ‘boost::concepts::EdgeListGraph::~EdgeListGraph() [with G = boost::adjacency_list, boost::property >, boost::no_property, boost::listS>]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/graph_concepts.hpp:226:1: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::EdgeListGraphConcept, boost::property >, boost::no_property, boost::listS> >]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/bellman_ford_shortest_paths.hpp:97:5: required from ‘bool boost::bellman_ford_shortest_paths(EdgeListGraph&, Size, WeightMap, PredecessorMap, DistanceMap, BinaryFunction, BinaryPredicate, BellmanFordVisitor) [with EdgeListGraph = adjacency_list, property >, no_property, listS>; Size = long unsigned int; WeightMap = adj_list_edge_property_map >, edge_weight_t>; PredecessorMap = dummy_property_map; DistanceMap = vec_adj_list_vertex_property_map, property >, no_property, listS>, adjacency_list, property >, no_property, listS>*, double, double&, vertex_distance_t>; BinaryFunction = closed_plus; BinaryPredicate = std::less; BellmanFordVisitor = bellman_visitor<>]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/johnson_all_pairs_shortest.hpp:112:36: required from ‘bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, VertexID, Weight, const BinaryPredicate&, const BinaryFunction&, const Infinity&, DistanceZero) [with VertexAndEdgeListGraph = R_adjacency_list; DistanceMatrix = Basic2DMatrix; VertexID = vec_adj_list_vertex_id_map, long unsigned int>; Weight = adj_list_edge_property_map, edge_weight_t>; BinaryPredicate = std::less; BinaryFunction = closed_plus; Infinity = double; DistanceZero = double]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/johnson_all_pairs_shortest.hpp:164:48: required from ‘bool boost::detail::johnson_dispatch(VertexAndEdgeListGraph&, DistanceMatrix&, const boost::bgl_named_params&, Weight, VertexID) [with VertexAndEdgeListGraph = R_adjacency_list; DistanceMatrix = Basic2DMatrix; P = int; T = int; R = boost::no_property; Weight = boost::adj_list_edge_property_map, boost::edge_weight_t>; VertexID = boost::vec_adj_list_vertex_id_map, long unsigned int>]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/johnson_all_pairs_shortest.hpp:192:36: required from ‘bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&) [with VertexAndEdgeListGraph = R_adjacency_list; DistanceMatrix = Basic2DMatrix]’ sna.cpp:105:41: required from here /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::Convertible::~Convertible() [with X = std::forward_iterator_tag; Y = std::input_iterator_tag]’ 37 | ~model() | ^ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:208:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 208 | BOOST_CONCEPT_USAGE(Convertible) { | ^~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::concepts::IncidenceGraph, boost::property >, boost::no_property, boost::listS> >]’: /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements, boost::property >, boost::no_property, boost::listS> > >]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/graph_concepts.hpp:87:5: required from ‘struct boost::concepts::IncidenceGraph, boost::property >, boost::no_property, boost::listS> >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/graph_concepts.hpp:75:1: required from ‘struct boost::concepts::IncidenceGraphConcept, boost::property >, boost::no_property, boost::listS> >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::concepts::IncidenceGraphConcept, boost::property >, boost::no_property, boost::listS> >]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied, boost::property >, boost::no_property, boost::listS> > >::value’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:45:51: [ skipping 6 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/dijkstra_shortest_paths.hpp:491:28: required from ‘void boost::dijkstra_shortest_paths(const VertexListGraph&, SourceInputIter, SourceInputIter, PredecessorMap, DistanceMap, WeightMap, IndexMap, Compare, Combine, DistInf, DistZero, DijkstraVisitor) [with VertexListGraph = adjacency_list, property >, no_property, listS>; SourceInputIter = long unsigned int*; DijkstraVisitor = dijkstra_visitor<>; PredecessorMap = dummy_property_map; DistanceMap = vec_adj_list_vertex_property_map, property >, no_property, listS>, adjacency_list, property >, no_property, listS>*, double, double&, vertex_distance_t>; WeightMap = adj_list_edge_property_map >, edge_weight2_t>; IndexMap = vec_adj_list_vertex_id_map, long unsigned int>; Compare = std::less; Combine = closed_plus; DistInf = double; DistZero = double]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/dijkstra_shortest_paths.hpp:505:28: required from ‘void boost::dijkstra_shortest_paths(const VertexListGraph&, typename graph_traits::vertex_descriptor, PredecessorMap, DistanceMap, WeightMap, IndexMap, Compare, Combine, DistInf, DistZero, DijkstraVisitor) [with VertexListGraph = adjacency_list, property >, no_property, listS>; DijkstraVisitor = dijkstra_visitor<>; PredecessorMap = dummy_property_map; DistanceMap = vec_adj_list_vertex_property_map, property >, no_property, listS>, adjacency_list, property >, no_property, listS>*, double, double&, vertex_distance_t>; WeightMap = adj_list_edge_property_map >, edge_weight2_t>; IndexMap = vec_adj_list_vertex_id_map, long unsigned int>; Compare = std::less; Combine = closed_plus; DistInf = double; DistZero = double; typename graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/johnson_all_pairs_shortest.hpp:127:36: required from ‘bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, VertexID, Weight, const BinaryPredicate&, const BinaryFunction&, const Infinity&, DistanceZero) [with VertexAndEdgeListGraph = R_adjacency_list; DistanceMatrix = Basic2DMatrix; VertexID = vec_adj_list_vertex_id_map, long unsigned int>; Weight = adj_list_edge_property_map, edge_weight_t>; BinaryPredicate = std::less; BinaryFunction = closed_plus; Infinity = double; DistanceZero = double]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/johnson_all_pairs_shortest.hpp:164:48: required from ‘bool boost::detail::johnson_dispatch(VertexAndEdgeListGraph&, DistanceMatrix&, const boost::bgl_named_params&, Weight, VertexID) [with VertexAndEdgeListGraph = R_adjacency_list; DistanceMatrix = Basic2DMatrix; P = int; T = int; R = boost::no_property; Weight = boost::adj_list_edge_property_map, boost::edge_weight_t>; VertexID = boost::vec_adj_list_vertex_id_map, long unsigned int>]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/johnson_all_pairs_shortest.hpp:192:36: required from ‘bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&) [with VertexAndEdgeListGraph = R_adjacency_list; DistanceMatrix = Basic2DMatrix]’ sna.cpp:105:41: required from here /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::concepts::IncidenceGraph::~IncidenceGraph() [with G = boost::adjacency_list, boost::property >, boost::no_property, boost::listS>]’ 37 | ~model() | ^ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/graph_concepts.hpp:87:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 87 | BOOST_CONCEPT_USAGE(IncidenceGraph) | ^~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements, boost::d_ary_heap_indirect, long unsigned int>, long unsigned int, long unsigned int&>, boost::vec_adj_list_vertex_property_map, boost::property >, boost::no_property, boost::listS>, boost::adjacency_list, boost::property >, boost::no_property, boost::listS>*, double, double&, boost::vertex_distance_t>, std::less, std::vector > >, boost::adj_list_edge_property_map >, boost::edge_weight2_t>, boost::dummy_property_map, boost::vec_adj_list_vertex_property_map, boost::property >, boost::no_property, boost::listS>, boost::adjacency_list, boost::property >, boost::no_property, boost::listS>*, double, double&, boost::vertex_distance_t>, boost::closed_plus, std::less > > >]’: /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:167:5: required from ‘struct boost::CopyConstructible, boost::d_ary_heap_indirect, long unsigned int>, long unsigned int, long unsigned int&>, boost::vec_adj_list_vertex_property_map, boost::property >, boost::no_property, boost::listS>, boost::adjacency_list, boost::property >, boost::no_property, boost::listS>*, double, double&, boost::vertex_distance_t>, std::less, std::vector > >, boost::adj_list_edge_property_map >, boost::edge_weight2_t>, boost::dummy_property_map, boost::vec_adj_list_vertex_property_map, boost::property >, boost::no_property, boost::listS>, boost::adjacency_list, boost::property >, boost::no_property, boost::listS>*, double, double&, boost::vertex_distance_t>, boost::closed_plus, std::less > >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:165:3: required from ‘struct boost::CopyConstructibleConcept, boost::d_ary_heap_indirect, long unsigned int>, long unsigned int, long unsigned int&>, boost::vec_adj_list_vertex_property_map, boost::property >, boost::no_property, boost::listS>, boost::adjacency_list, boost::property >, boost::no_property, boost::listS>*, double, double&, boost::vertex_distance_t>, std::less, std::vector > >, boost::adj_list_edge_property_map >, boost::edge_weight2_t>, boost::dummy_property_map, boost::vec_adj_list_vertex_property_map, boost::property >, boost::no_property, boost::listS>, boost::adjacency_list, boost::property >, boost::no_property, boost::listS>*, double, double&, boost::vertex_distance_t>, boost::closed_plus, std::less > >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::CopyConstructibleConcept, boost::d_ary_heap_indirect, long unsigned int>, long unsigned int, long unsigned int&>, boost::vec_adj_list_vertex_property_map, boost::property >, boost::no_property, boost::listS>, boost::adjacency_list, boost::property >, boost::no_property, boost::listS>*, double, double&, boost::vertex_distance_t>, std::less, std::vector > >, boost::adj_list_edge_property_map >, boost::edge_weight2_t>, boost::dummy_property_map, boost::vec_adj_list_vertex_property_map, boost::property >, boost::no_property, boost::listS>, boost::adjacency_list, boost::property >, boost::no_property, boost::listS>*, double, double&, boost::vertex_distance_t>, boost::closed_plus, std::less > >]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied, boost::d_ary_heap_indirect, long unsigned int>, long unsigned int, long unsigned int&>, boost::vec_adj_list_vertex_property_map, boost::property >, boost::no_property, boost::listS>, boost::adjacency_list, boost::property >, boost::no_property, boost::listS>*, double, double&, boost::vertex_distance_t>, std::less, std::vector > >, boost::adj_list_edge_property_map >, boost::edge_weight2_t>, boost::dummy_property_map, boost::vec_adj_list_vertex_property_map, boost::property >, boost::no_property, boost::listS>, boost::adjacency_list, boost::property >, boost::no_property, boost::listS>*, double, double&, boost::vertex_distance_t>, boost::closed_plus, std::less > > >::value’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied, boost::d_ary_heap_indirect, long unsigned int>, long unsigned int, long unsigned int&>, boost::vec_adj_list_vertex_property_map, boost::property >, boost::no_property, boost::listS>, boost::adjacency_list, boost::property >, boost::no_property, boost::listS>*, double, double&, boost::vertex_distance_t>, std::less, std::vector > >, boost::adj_list_edge_property_map >, boost::edge_weight2_t>, boost::dummy_property_map, boost::vec_adj_list_vertex_property_map, boost::property >, boost::no_property, boost::listS>, boost::adjacency_list, boost::property >, boost::no_property, boost::listS>*, double, double&, boost::vertex_distance_t>, boost::closed_plus, std::less > > >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:72:8: [ skipping 10 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/dijkstra_shortest_paths.hpp:491:28: required from ‘void boost::dijkstra_shortest_paths(const VertexListGraph&, SourceInputIter, SourceInputIter, PredecessorMap, DistanceMap, WeightMap, IndexMap, Compare, Combine, DistInf, DistZero, DijkstraVisitor) [with VertexListGraph = adjacency_list, property >, no_property, listS>; SourceInputIter = long unsigned int*; DijkstraVisitor = dijkstra_visitor<>; PredecessorMap = dummy_property_map; DistanceMap = vec_adj_list_vertex_property_map, property >, no_property, listS>, adjacency_list, property >, no_property, listS>*, double, double&, vertex_distance_t>; WeightMap = adj_list_edge_property_map >, edge_weight2_t>; IndexMap = vec_adj_list_vertex_id_map, long unsigned int>; Compare = std::less; Combine = closed_plus; DistInf = double; DistZero = double]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/dijkstra_shortest_paths.hpp:505:28: required from ‘void boost::dijkstra_shortest_paths(const VertexListGraph&, typename graph_traits::vertex_descriptor, PredecessorMap, DistanceMap, WeightMap, IndexMap, Compare, Combine, DistInf, DistZero, DijkstraVisitor) [with VertexListGraph = adjacency_list, property >, no_property, listS>; DijkstraVisitor = dijkstra_visitor<>; PredecessorMap = dummy_property_map; DistanceMap = vec_adj_list_vertex_property_map, property >, no_property, listS>, adjacency_list, property >, no_property, listS>*, double, double&, vertex_distance_t>; WeightMap = adj_list_edge_property_map >, edge_weight2_t>; IndexMap = vec_adj_list_vertex_id_map, long unsigned int>; Compare = std::less; Combine = closed_plus; DistInf = double; DistZero = double; typename graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/johnson_all_pairs_shortest.hpp:127:36: required from ‘bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, VertexID, Weight, const BinaryPredicate&, const BinaryFunction&, const Infinity&, DistanceZero) [with VertexAndEdgeListGraph = R_adjacency_list; DistanceMatrix = Basic2DMatrix; VertexID = vec_adj_list_vertex_id_map, long unsigned int>; Weight = adj_list_edge_property_map, edge_weight_t>; BinaryPredicate = std::less; BinaryFunction = closed_plus; Infinity = double; DistanceZero = double]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/johnson_all_pairs_shortest.hpp:164:48: required from ‘bool boost::detail::johnson_dispatch(VertexAndEdgeListGraph&, DistanceMatrix&, const boost::bgl_named_params&, Weight, VertexID) [with VertexAndEdgeListGraph = R_adjacency_list; DistanceMatrix = Basic2DMatrix; P = int; T = int; R = boost::no_property; Weight = boost::adj_list_edge_property_map, boost::edge_weight_t>; VertexID = boost::vec_adj_list_vertex_id_map, long unsigned int>]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/johnson_all_pairs_shortest.hpp:192:36: required from ‘bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&) [with VertexAndEdgeListGraph = R_adjacency_list; DistanceMatrix = Basic2DMatrix]’ sna.cpp:105:41: required from here /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::CopyConstructible, boost::d_ary_heap_indirect, long unsigned int>, long unsigned int, long unsigned int&>, boost::vec_adj_list_vertex_property_map, boost::property >, boost::no_property, boost::listS>, boost::adjacency_list, boost::property >, boost::no_property, boost::listS>*, double, double&, boost::vertex_distance_t>, std::less, std::vector > >, boost::adj_list_edge_property_map >, boost::edge_weight2_t>, boost::dummy_property_map, boost::vec_adj_list_vertex_property_map, boost::property >, boost::no_property, boost::listS>, boost::adjacency_list, boost::property >, boost::no_property, boost::listS>*, double, double&, boost::vertex_distance_t>, boost::closed_plus, std::less > >]’ 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ^ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::CopyConstructibleConcept, boost::d_ary_heap_indirect, long unsigned int>, long unsigned int, long unsigned int&>, boost::vec_adj_list_vertex_property_map, boost::property >, boost::no_property, boost::listS>, boost::adjacency_list, boost::property >, boost::no_property, boost::listS>*, double, double&, boost::vertex_distance_t>, std::less, std::vector > >, boost::adj_list_edge_property_map >, boost::edge_weight2_t>, boost::dummy_property_map, boost::vec_adj_list_vertex_property_map, boost::property >, boost::no_property, boost::listS>, boost::adjacency_list, boost::property >, boost::no_property, boost::listS>*, double, double&, boost::vertex_distance_t>, boost::closed_plus, std::less > >]’: /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/bellman_ford_shortest_paths.hpp:40:9: required from ‘void boost::BFSVisitorConcept::constraints() [with Visitor = boost::detail::dijkstra_bfs_visitor, boost::d_ary_heap_indirect, long unsigned int>, long unsigned int, long unsigned int&>, boost::vec_adj_list_vertex_property_map, boost::property >, boost::no_property, boost::listS>, boost::adjacency_list, boost::property >, boost::no_property, boost::listS>*, double, double&, boost::vertex_distance_t>, std::less, std::vector > >, boost::adj_list_edge_property_map >, boost::edge_weight2_t>, boost::dummy_property_map, boost::vec_adj_list_vertex_property_map, boost::property >, boost::no_property, boost::listS>, boost::adjacency_list, boost::property >, boost::no_property, boost::listS>*, double, double&, boost::vertex_distance_t>, boost::closed_plus, std::less >; Graph = boost::adjacency_list, boost::property >, boost::no_property, boost::listS>]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::BFSVisitorConcept, boost::d_ary_heap_indirect, long unsigned int>, long unsigned int, long unsigned int&>, boost::vec_adj_list_vertex_property_map, boost::property >, boost::no_property, boost::listS>, boost::adjacency_list, boost::property >, boost::no_property, boost::listS>*, double, double&, boost::vertex_distance_t>, std::less, std::vector > >, boost::adj_list_edge_property_map >, boost::edge_weight2_t>, boost::dummy_property_map, boost::vec_adj_list_vertex_property_map, boost::property >, boost::no_property, boost::listS>, boost::adjacency_list, boost::property >, boost::no_property, boost::listS>*, double, double&, boost::vertex_distance_t>, boost::closed_plus, std::less >, boost::adjacency_list, boost::property >, boost::no_property, boost::listS> >]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied, boost::d_ary_heap_indirect, long unsigned int>, long unsigned int, long unsigned int&>, boost::vec_adj_list_vertex_property_map, boost::property >, boost::no_property, boost::listS>, boost::adjacency_list, boost::property >, boost::no_property, boost::listS>*, double, double&, boost::vertex_distance_t>, std::less, std::vector > >, boost::adj_list_edge_property_map >, boost::edge_weight2_t>, boost::dummy_property_map, boost::vec_adj_list_vertex_property_map, boost::property >, boost::no_property, boost::listS>, boost::adjacency_list, boost::property >, boost::no_property, boost::listS>*, double, double&, boost::vertex_distance_t>, boost::closed_plus, std::less >, boost::adjacency_list, boost::property >, boost::no_property, boost::listS> > >::value’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied, boost::d_ary_heap_indirect, long unsigned int>, long unsigned int, long unsigned int&>, boost::vec_adj_list_vertex_property_map, boost::property >, boost::no_property, boost::listS>, boost::adjacency_list, boost::property >, boost::no_property, boost::listS>*, double, double&, boost::vertex_distance_t>, std::less, std::vector > >, boost::adj_list_edge_property_map >, boost::edge_weight2_t>, boost::dummy_property_map, boost::vec_adj_list_vertex_property_map, boost::property >, boost::no_property, boost::listS>, boost::adjacency_list, boost::property >, boost::no_property, boost::listS>*, double, double&, boost::vertex_distance_t>, boost::closed_plus, std::less >, boost::adjacency_list, boost::property >, boost::no_property, boost::listS> > >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_, boost::d_ary_heap_indirect, long unsigned int>, long unsigned int, long unsigned int&>, boost::vec_adj_list_vertex_property_map, boost::property >, boost::no_property, boost::listS>, boost::adjacency_list, boost::property >, boost::no_property, boost::listS>*, double, double&, boost::vertex_distance_t>, std::less, std::vector > >, boost::adj_list_edge_property_map >, boost::edge_weight2_t>, boost::dummy_property_map, boost::vec_adj_list_vertex_property_map, boost::property >, boost::no_property, boost::listS>, boost::adjacency_list, boost::property >, boost::no_property, boost::listS>*, double, double&, boost::vertex_distance_t>, boost::closed_plus, std::less >, boost::adjacency_list, boost::property >, boost::no_property, boost::listS> >)>’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/breadth_first_search.hpp:65:5: [ skipping 4 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/dijkstra_shortest_paths.hpp:491:28: required from ‘void boost::dijkstra_shortest_paths(const VertexListGraph&, SourceInputIter, SourceInputIter, PredecessorMap, DistanceMap, WeightMap, IndexMap, Compare, Combine, DistInf, DistZero, DijkstraVisitor) [with VertexListGraph = adjacency_list, property >, no_property, listS>; SourceInputIter = long unsigned int*; DijkstraVisitor = dijkstra_visitor<>; PredecessorMap = dummy_property_map; DistanceMap = vec_adj_list_vertex_property_map, property >, no_property, listS>, adjacency_list, property >, no_property, listS>*, double, double&, vertex_distance_t>; WeightMap = adj_list_edge_property_map >, edge_weight2_t>; IndexMap = vec_adj_list_vertex_id_map, long unsigned int>; Compare = std::less; Combine = closed_plus; DistInf = double; DistZero = double]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/dijkstra_shortest_paths.hpp:505:28: required from ‘void boost::dijkstra_shortest_paths(const VertexListGraph&, typename graph_traits::vertex_descriptor, PredecessorMap, DistanceMap, WeightMap, IndexMap, Compare, Combine, DistInf, DistZero, DijkstraVisitor) [with VertexListGraph = adjacency_list, property >, no_property, listS>; DijkstraVisitor = dijkstra_visitor<>; PredecessorMap = dummy_property_map; DistanceMap = vec_adj_list_vertex_property_map, property >, no_property, listS>, adjacency_list, property >, no_property, listS>*, double, double&, vertex_distance_t>; WeightMap = adj_list_edge_property_map >, edge_weight2_t>; IndexMap = vec_adj_list_vertex_id_map, long unsigned int>; Compare = std::less; Combine = closed_plus; DistInf = double; DistZero = double; typename graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/johnson_all_pairs_shortest.hpp:127:36: required from ‘bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, VertexID, Weight, const BinaryPredicate&, const BinaryFunction&, const Infinity&, DistanceZero) [with VertexAndEdgeListGraph = R_adjacency_list; DistanceMatrix = Basic2DMatrix; VertexID = vec_adj_list_vertex_id_map, long unsigned int>; Weight = adj_list_edge_property_map, edge_weight_t>; BinaryPredicate = std::less; BinaryFunction = closed_plus; Infinity = double; DistanceZero = double]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/johnson_all_pairs_shortest.hpp:164:48: required from ‘bool boost::detail::johnson_dispatch(VertexAndEdgeListGraph&, DistanceMatrix&, const boost::bgl_named_params&, Weight, VertexID) [with VertexAndEdgeListGraph = R_adjacency_list; DistanceMatrix = Basic2DMatrix; P = int; T = int; R = boost::no_property; Weight = boost::adj_list_edge_property_map, boost::edge_weight_t>; VertexID = boost::vec_adj_list_vertex_id_map, long unsigned int>]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/johnson_all_pairs_shortest.hpp:192:36: required from ‘bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&) [with VertexAndEdgeListGraph = R_adjacency_list; DistanceMatrix = Basic2DMatrix]’ sna.cpp:105:41: required from here /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:165:17: note: in a call to non-static member function ‘boost::CopyConstructibleConcept, boost::d_ary_heap_indirect, long unsigned int>, long unsigned int, long unsigned int&>, boost::vec_adj_list_vertex_property_map, boost::property >, boost::no_property, boost::listS>, boost::adjacency_list, boost::property >, boost::no_property, boost::listS>*, double, double&, boost::vertex_distance_t>, std::less, std::vector > >, boost::adj_list_edge_property_map >, boost::edge_weight2_t>, boost::dummy_property_map, boost::vec_adj_list_vertex_property_map, boost::property >, boost::no_property, boost::listS>, boost::adjacency_list, boost::property >, boost::no_property, boost::listS>*, double, double&, boost::vertex_distance_t>, boost::closed_plus, std::less > >::~CopyConstructibleConcept()’ 165 | BOOST_concept(CopyConstructible,(TT)) | ^~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/preprocessor/cat.hpp:29:34: note: in definition of macro ‘BOOST_PP_CAT_I’ 29 | # define BOOST_PP_CAT_I(a, b) a ## b | ^ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/concept_def.hpp:23:12: note: in expansion of macro ‘BOOST_PP_CAT’ 23 | struct BOOST_PP_CAT(name,Concept) \ | ^~~~~~~~~~~~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:165:3: note: in expansion of macro ‘BOOST_concept’ 165 | BOOST_concept(CopyConstructible,(TT)) | ^~~~~~~~~~~~~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::constraint::failed() [with Model = boost::ReadablePropertyMapConcept, long unsigned int> >, long unsigned int>]’: /home/omnipath/local/R/4.4-3.20/BH/include/boost/property_map/property_map.hpp:206:7: required from ‘void boost::ReadWritePropertyMapConcept::constraints() [with PMap = boost::two_bit_color_map, long unsigned int> >; Key = long unsigned int]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::ReadWritePropertyMapConcept, long unsigned int> >, long unsigned int>]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied, long unsigned int> >, long unsigned int> >::value’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied, long unsigned int> >, long unsigned int> >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_, long unsigned int> >, long unsigned int>)>’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/breadth_first_search.hpp:66:5: [ skipping 4 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/dijkstra_shortest_paths.hpp:491:28: required from ‘void boost::dijkstra_shortest_paths(const VertexListGraph&, SourceInputIter, SourceInputIter, PredecessorMap, DistanceMap, WeightMap, IndexMap, Compare, Combine, DistInf, DistZero, DijkstraVisitor) [with VertexListGraph = adjacency_list, property >, no_property, listS>; SourceInputIter = long unsigned int*; DijkstraVisitor = dijkstra_visitor<>; PredecessorMap = dummy_property_map; DistanceMap = vec_adj_list_vertex_property_map, property >, no_property, listS>, adjacency_list, property >, no_property, listS>*, double, double&, vertex_distance_t>; WeightMap = adj_list_edge_property_map >, edge_weight2_t>; IndexMap = vec_adj_list_vertex_id_map, long unsigned int>; Compare = std::less; Combine = closed_plus; DistInf = double; DistZero = double]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/dijkstra_shortest_paths.hpp:505:28: required from ‘void boost::dijkstra_shortest_paths(const VertexListGraph&, typename graph_traits::vertex_descriptor, PredecessorMap, DistanceMap, WeightMap, IndexMap, Compare, Combine, DistInf, DistZero, DijkstraVisitor) [with VertexListGraph = adjacency_list, property >, no_property, listS>; DijkstraVisitor = dijkstra_visitor<>; PredecessorMap = dummy_property_map; DistanceMap = vec_adj_list_vertex_property_map, property >, no_property, listS>, adjacency_list, property >, no_property, listS>*, double, double&, vertex_distance_t>; WeightMap = adj_list_edge_property_map >, edge_weight2_t>; IndexMap = vec_adj_list_vertex_id_map, long unsigned int>; Compare = std::less; Combine = closed_plus; DistInf = double; DistZero = double; typename graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/johnson_all_pairs_shortest.hpp:127:36: required from ‘bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, VertexID, Weight, const BinaryPredicate&, const BinaryFunction&, const Infinity&, DistanceZero) [with VertexAndEdgeListGraph = R_adjacency_list; DistanceMatrix = Basic2DMatrix; VertexID = vec_adj_list_vertex_id_map, long unsigned int>; Weight = adj_list_edge_property_map, edge_weight_t>; BinaryPredicate = std::less; BinaryFunction = closed_plus; Infinity = double; DistanceZero = double]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/johnson_all_pairs_shortest.hpp:164:48: required from ‘bool boost::detail::johnson_dispatch(VertexAndEdgeListGraph&, DistanceMatrix&, const boost::bgl_named_params&, Weight, VertexID) [with VertexAndEdgeListGraph = R_adjacency_list; DistanceMatrix = Basic2DMatrix; P = int; T = int; R = boost::no_property; Weight = boost::adj_list_edge_property_map, boost::edge_weight_t>; VertexID = boost::vec_adj_list_vertex_id_map, long unsigned int>]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/johnson_all_pairs_shortest.hpp:192:36: required from ‘bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&) [with VertexAndEdgeListGraph = R_adjacency_list; DistanceMatrix = Basic2DMatrix]’ sna.cpp:105:41: required from here /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:65:52: warning: ‘this’ pointer is null [-Wnonnull] 65 | static void failed() { ((Model*)0)->constraints(); } | ~~~~~~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/property_map/property_map.hpp:147:10: note: in a call to non-static member function ‘void boost::ReadablePropertyMapConcept::constraints() [with PMap = boost::two_bit_color_map, long unsigned int> >; Key = long unsigned int]’ 147 | void constraints() { | ^~~~~~~~~~~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::constraint::failed() [with Model = boost::WritablePropertyMapConcept, long unsigned int> >, long unsigned int>]’: /home/omnipath/local/R/4.4-3.20/BH/include/boost/property_map/property_map.hpp:207:7: required from ‘void boost::ReadWritePropertyMapConcept::constraints() [with PMap = boost::two_bit_color_map, long unsigned int> >; Key = long unsigned int]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::ReadWritePropertyMapConcept, long unsigned int> >, long unsigned int>]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied, long unsigned int> >, long unsigned int> >::value’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied, long unsigned int> >, long unsigned int> >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_, long unsigned int> >, long unsigned int>)>’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/breadth_first_search.hpp:66:5: [ skipping 4 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/dijkstra_shortest_paths.hpp:491:28: required from ‘void boost::dijkstra_shortest_paths(const VertexListGraph&, SourceInputIter, SourceInputIter, PredecessorMap, DistanceMap, WeightMap, IndexMap, Compare, Combine, DistInf, DistZero, DijkstraVisitor) [with VertexListGraph = adjacency_list, property >, no_property, listS>; SourceInputIter = long unsigned int*; DijkstraVisitor = dijkstra_visitor<>; PredecessorMap = dummy_property_map; DistanceMap = vec_adj_list_vertex_property_map, property >, no_property, listS>, adjacency_list, property >, no_property, listS>*, double, double&, vertex_distance_t>; WeightMap = adj_list_edge_property_map >, edge_weight2_t>; IndexMap = vec_adj_list_vertex_id_map, long unsigned int>; Compare = std::less; Combine = closed_plus; DistInf = double; DistZero = double]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/dijkstra_shortest_paths.hpp:505:28: required from ‘void boost::dijkstra_shortest_paths(const VertexListGraph&, typename graph_traits::vertex_descriptor, PredecessorMap, DistanceMap, WeightMap, IndexMap, Compare, Combine, DistInf, DistZero, DijkstraVisitor) [with VertexListGraph = adjacency_list, property >, no_property, listS>; DijkstraVisitor = dijkstra_visitor<>; PredecessorMap = dummy_property_map; DistanceMap = vec_adj_list_vertex_property_map, property >, no_property, listS>, adjacency_list, property >, no_property, listS>*, double, double&, vertex_distance_t>; WeightMap = adj_list_edge_property_map >, edge_weight2_t>; IndexMap = vec_adj_list_vertex_id_map, long unsigned int>; Compare = std::less; Combine = closed_plus; DistInf = double; DistZero = double; typename graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/johnson_all_pairs_shortest.hpp:127:36: required from ‘bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, VertexID, Weight, const BinaryPredicate&, const BinaryFunction&, const Infinity&, DistanceZero) [with VertexAndEdgeListGraph = R_adjacency_list; DistanceMatrix = Basic2DMatrix; VertexID = vec_adj_list_vertex_id_map, long unsigned int>; Weight = adj_list_edge_property_map, edge_weight_t>; BinaryPredicate = std::less; BinaryFunction = closed_plus; Infinity = double; DistanceZero = double]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/johnson_all_pairs_shortest.hpp:164:48: required from ‘bool boost::detail::johnson_dispatch(VertexAndEdgeListGraph&, DistanceMatrix&, const boost::bgl_named_params&, Weight, VertexID) [with VertexAndEdgeListGraph = R_adjacency_list; DistanceMatrix = Basic2DMatrix; P = int; T = int; R = boost::no_property; Weight = boost::adj_list_edge_property_map, boost::edge_weight_t>; VertexID = boost::vec_adj_list_vertex_id_map, long unsigned int>]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/johnson_all_pairs_shortest.hpp:192:36: required from ‘bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&) [with VertexAndEdgeListGraph = R_adjacency_list; DistanceMatrix = Basic2DMatrix]’ sna.cpp:105:41: required from here /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:65:52: warning: ‘this’ pointer is null [-Wnonnull] 65 | static void failed() { ((Model*)0)->constraints(); } | ~~~~~~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/property_map/property_map.hpp:179:10: note: in a call to non-static member function ‘void boost::WritablePropertyMapConcept::constraints() [with PMap = boost::two_bit_color_map, long unsigned int> >; Key = long unsigned int]’ 179 | void constraints() { | ^~~~~~~~~~~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements >]’: /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:208:5: required from ‘struct boost::Convertible’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:206:3: required from ‘struct boost::ConvertibleConcept’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::ConvertibleConcept]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied >::value’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:72:8: [ skipping 10 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/dijkstra_shortest_paths.hpp:491:28: required from ‘void boost::dijkstra_shortest_paths(const VertexListGraph&, SourceInputIter, SourceInputIter, PredecessorMap, DistanceMap, WeightMap, IndexMap, Compare, Combine, DistInf, DistZero, DijkstraVisitor) [with VertexListGraph = adjacency_list, property >, no_property, listS>; SourceInputIter = long unsigned int*; DijkstraVisitor = dijkstra_visitor<>; PredecessorMap = dummy_property_map; DistanceMap = vec_adj_list_vertex_property_map, property >, no_property, listS>, adjacency_list, property >, no_property, listS>*, double, double&, vertex_distance_t>; WeightMap = adj_list_edge_property_map >, edge_weight2_t>; IndexMap = vec_adj_list_vertex_id_map, long unsigned int>; Compare = std::less; Combine = closed_plus; DistInf = double; DistZero = double]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/dijkstra_shortest_paths.hpp:505:28: required from ‘void boost::dijkstra_shortest_paths(const VertexListGraph&, typename graph_traits::vertex_descriptor, PredecessorMap, DistanceMap, WeightMap, IndexMap, Compare, Combine, DistInf, DistZero, DijkstraVisitor) [with VertexListGraph = adjacency_list, property >, no_property, listS>; DijkstraVisitor = dijkstra_visitor<>; PredecessorMap = dummy_property_map; DistanceMap = vec_adj_list_vertex_property_map, property >, no_property, listS>, adjacency_list, property >, no_property, listS>*, double, double&, vertex_distance_t>; WeightMap = adj_list_edge_property_map >, edge_weight2_t>; IndexMap = vec_adj_list_vertex_id_map, long unsigned int>; Compare = std::less; Combine = closed_plus; DistInf = double; DistZero = double; typename graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/johnson_all_pairs_shortest.hpp:127:36: required from ‘bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, VertexID, Weight, const BinaryPredicate&, const BinaryFunction&, const Infinity&, DistanceZero) [with VertexAndEdgeListGraph = R_adjacency_list; DistanceMatrix = Basic2DMatrix; VertexID = vec_adj_list_vertex_id_map, long unsigned int>; Weight = adj_list_edge_property_map, edge_weight_t>; BinaryPredicate = std::less; BinaryFunction = closed_plus; Infinity = double; DistanceZero = double]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/johnson_all_pairs_shortest.hpp:164:48: required from ‘bool boost::detail::johnson_dispatch(VertexAndEdgeListGraph&, DistanceMatrix&, const boost::bgl_named_params&, Weight, VertexID) [with VertexAndEdgeListGraph = R_adjacency_list; DistanceMatrix = Basic2DMatrix; P = int; T = int; R = boost::no_property; Weight = boost::adj_list_edge_property_map, boost::edge_weight_t>; VertexID = boost::vec_adj_list_vertex_id_map, long unsigned int>]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/johnson_all_pairs_shortest.hpp:192:36: required from ‘bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&) [with VertexAndEdgeListGraph = R_adjacency_list; DistanceMatrix = Basic2DMatrix]’ sna.cpp:105:41: required from here /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::Convertible]’ 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ^ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::ConvertibleConcept]’: /home/omnipath/local/R/4.4-3.20/BH/include/boost/property_map/property_map.hpp:208:7: required from ‘void boost::ReadWritePropertyMapConcept::constraints() [with PMap = boost::two_bit_color_map, long unsigned int> >; Key = long unsigned int]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::ReadWritePropertyMapConcept, long unsigned int> >, long unsigned int>]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied, long unsigned int> >, long unsigned int> >::value’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied, long unsigned int> >, long unsigned int> >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_, long unsigned int> >, long unsigned int>)>’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/breadth_first_search.hpp:66:5: [ skipping 4 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/dijkstra_shortest_paths.hpp:491:28: required from ‘void boost::dijkstra_shortest_paths(const VertexListGraph&, SourceInputIter, SourceInputIter, PredecessorMap, DistanceMap, WeightMap, IndexMap, Compare, Combine, DistInf, DistZero, DijkstraVisitor) [with VertexListGraph = adjacency_list, property >, no_property, listS>; SourceInputIter = long unsigned int*; DijkstraVisitor = dijkstra_visitor<>; PredecessorMap = dummy_property_map; DistanceMap = vec_adj_list_vertex_property_map, property >, no_property, listS>, adjacency_list, property >, no_property, listS>*, double, double&, vertex_distance_t>; WeightMap = adj_list_edge_property_map >, edge_weight2_t>; IndexMap = vec_adj_list_vertex_id_map, long unsigned int>; Compare = std::less; Combine = closed_plus; DistInf = double; DistZero = double]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/dijkstra_shortest_paths.hpp:505:28: required from ‘void boost::dijkstra_shortest_paths(const VertexListGraph&, typename graph_traits::vertex_descriptor, PredecessorMap, DistanceMap, WeightMap, IndexMap, Compare, Combine, DistInf, DistZero, DijkstraVisitor) [with VertexListGraph = adjacency_list, property >, no_property, listS>; DijkstraVisitor = dijkstra_visitor<>; PredecessorMap = dummy_property_map; DistanceMap = vec_adj_list_vertex_property_map, property >, no_property, listS>, adjacency_list, property >, no_property, listS>*, double, double&, vertex_distance_t>; WeightMap = adj_list_edge_property_map >, edge_weight2_t>; IndexMap = vec_adj_list_vertex_id_map, long unsigned int>; Compare = std::less; Combine = closed_plus; DistInf = double; DistZero = double; typename graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/johnson_all_pairs_shortest.hpp:127:36: required from ‘bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, VertexID, Weight, const BinaryPredicate&, const BinaryFunction&, const Infinity&, DistanceZero) [with VertexAndEdgeListGraph = R_adjacency_list; DistanceMatrix = Basic2DMatrix; VertexID = vec_adj_list_vertex_id_map, long unsigned int>; Weight = adj_list_edge_property_map, edge_weight_t>; BinaryPredicate = std::less; BinaryFunction = closed_plus; Infinity = double; DistanceZero = double]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/johnson_all_pairs_shortest.hpp:164:48: required from ‘bool boost::detail::johnson_dispatch(VertexAndEdgeListGraph&, DistanceMatrix&, const boost::bgl_named_params&, Weight, VertexID) [with VertexAndEdgeListGraph = R_adjacency_list; DistanceMatrix = Basic2DMatrix; P = int; T = int; R = boost::no_property; Weight = boost::adj_list_edge_property_map, boost::edge_weight_t>; VertexID = boost::vec_adj_list_vertex_id_map, long unsigned int>]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/johnson_all_pairs_shortest.hpp:192:36: required from ‘bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&) [with VertexAndEdgeListGraph = R_adjacency_list; DistanceMatrix = Basic2DMatrix]’ sna.cpp:105:41: required from here /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:206:17: note: in a call to non-static member function ‘boost::ConvertibleConcept::~ConvertibleConcept()’ 206 | BOOST_concept(Convertible,(X)(Y)) | ^~~~~~~~~~~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/preprocessor/cat.hpp:29:34: note: in definition of macro ‘BOOST_PP_CAT_I’ 29 | # define BOOST_PP_CAT_I(a, b) a ## b | ^ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/concept_def.hpp:23:12: note: in expansion of macro ‘BOOST_PP_CAT’ 23 | struct BOOST_PP_CAT(name,Concept) \ | ^~~~~~~~~~~~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:206:3: note: in expansion of macro ‘BOOST_concept’ 206 | BOOST_concept(Convertible,(X)(Y)) | ^~~~~~~~~~~~~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements > > >, boost::edge_residual_capacity_t> >, boost::keep_all, boost::filtered_graph > > > >, boost::is_residual_edge > > >, boost::edge_residual_capacity_t> >, boost::keep_all> >, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > > > >*, std::vector > > > >, std::allocator > > > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > > >]’: /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/graph_concepts.hpp:52:50: required from ‘struct boost::concepts::MultiPassInputIterator > > >, boost::edge_residual_capacity_t> >, boost::keep_all, boost::filtered_graph > > > >, boost::is_residual_edge > > >, boost::edge_residual_capacity_t> >, boost::keep_all> >, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > > > >*, std::vector > > > >, std::allocator > > > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::concepts::MultiPassInputIterator > > >, boost::edge_residual_capacity_t> >, boost::keep_all, boost::filtered_graph > > > >, boost::is_residual_edge > > >, boost::edge_residual_capacity_t> >, boost::keep_all> >, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > > > >*, std::vector > > > >, std::allocator > > > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied > > >, boost::edge_residual_capacity_t> >, boost::keep_all, boost::filtered_graph > > > >, boost::is_residual_edge > > >, boost::edge_residual_capacity_t> >, boost::keep_all> >, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > > > >*, std::vector > > > >, std::allocator > > > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > > >::value’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied > > >, boost::edge_residual_capacity_t> >, boost::keep_all, boost::filtered_graph > > > >, boost::is_residual_edge > > >, boost::edge_residual_capacity_t> >, boost::keep_all> >, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > > > >*, std::vector > > > >, std::allocator > > > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > > >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_ > > >, boost::edge_residual_capacity_t> >, boost::keep_all, boost::filtered_graph > > > >, boost::is_residual_edge > > >, boost::edge_residual_capacity_t> >, boost::keep_all> >, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > > > >*, std::vector > > > >, std::allocator > > > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >)>’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/graph_concepts.hpp:89:9: [ skipping 5 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/edmonds_karp_max_flow.hpp:101:29: required from ‘typename boost::property_traits::value_type boost::edmonds_karp_max_flow(Graph&, typename graph_traits::vertex_descriptor, typename graph_traits::vertex_descriptor, CapacityEdgeMap, ResidualCapacityEdgeMap, ReverseEdgeMap, ColorMap, PredEdgeMap) [with Graph = adjacency_list > > > >; CapacityEdgeMap = adj_list_edge_property_map > > >, edge_capacity_t>; ResidualCapacityEdgeMap = adj_list_edge_property_map > > >, edge_residual_capacity_t>; ReverseEdgeMap = adj_list_edge_property_map, const detail::edge_desc_impl&, long unsigned int, const property > > >, edge_reverse_t>; ColorMap = iterator_property_map<__gnu_cxx::__normal_iterator >, vec_adj_list_vertex_id_map, default_color_type, default_color_type&>; PredEdgeMap = iterator_property_map<__gnu_cxx::__normal_iterator*, std::vector, std::allocator > > >, vec_adj_list_vertex_id_map, detail::edge_desc_impl, detail::edge_desc_impl&>; typename property_traits::value_type = double; typename graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/edmonds_karp_max_flow.hpp:154:41: required from ‘static typename boost::detail::edge_capacity_value::type boost::detail::edmonds_karp_dispatch2::apply(Graph&, typename boost::graph_traits::vertex_descriptor, typename boost::graph_traits::vertex_descriptor, PredMap, const boost::bgl_named_params&, boost::param_not_found) [with Graph = boost::adjacency_list > > > >; PredMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator*, std::vector, std::allocator > > >, boost::vec_adj_list_vertex_id_map, boost::detail::edge_desc_impl, boost::detail::edge_desc_impl&>; P = int; T = boost::buffer_param_t; R = boost::no_property; typename boost::detail::edge_capacity_value::type = double; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/edmonds_karp_max_flow.hpp:208:54: required from ‘static typename boost::detail::edge_capacity_value::type boost::detail::edmonds_karp_dispatch1::apply(Graph&, typename boost::graph_traits::vertex_descriptor, typename boost::graph_traits::vertex_descriptor, const boost::bgl_named_params&, boost::param_not_found) [with Graph = boost::adjacency_list > > > >; P = int; T = boost::buffer_param_t; R = boost::no_property; typename boost::detail::edge_capacity_value::type = double; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/edmonds_karp_max_flow.hpp:228:57: required from ‘typename boost::detail::edge_capacity_value::type boost::edmonds_karp_max_flow(Graph&, typename graph_traits::vertex_descriptor, typename graph_traits::vertex_descriptor, const bgl_named_params&) [with Graph = adjacency_list > > > >; P = int; T = buffer_param_t; R = no_property; typename detail::edge_capacity_value::type = double; typename graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/edmonds_karp_max_flow.hpp:240:33: required from ‘typename boost::property_traits::const_type>::value_type boost::edmonds_karp_max_flow(Graph&, typename graph_traits::vertex_descriptor, typename graph_traits::vertex_descriptor) [with Graph = adjacency_list > > > >; typename property_traits::const_type>::value_type = double; typename property_map::const_type = adj_list_edge_property_map > > >, edge_capacity_t>; typename graph_traits::vertex_descriptor = long unsigned int]’ sna.cpp:204:54: required from here /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::concepts::MultiPassInputIterator > > >, boost::edge_residual_capacity_t> >, boost::keep_all, boost::filtered_graph > > > >, boost::is_residual_edge > > >, boost::edge_residual_capacity_t> >, boost::keep_all> >, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > > > >*, std::vector > > > >, std::allocator > > > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >]’ 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ^ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::MultiPassInputIterator > > >, boost::edge_residual_capacity_t> >, boost::keep_all, boost::filtered_graph > > > >, boost::is_residual_edge > > >, boost::edge_residual_capacity_t> >, boost::keep_all> >, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > > > >*, std::vector > > > >, std::allocator > > > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >]’: /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/graph_concepts.hpp:89:9: required from ‘boost::concepts::IncidenceGraph::~IncidenceGraph() [with G = boost::filtered_graph > > > >, boost::is_residual_edge > > >, boost::edge_residual_capacity_t> >, boost::keep_all>]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/graph_concepts.hpp:75:1: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::IncidenceGraphConcept > > > >, boost::is_residual_edge > > >, boost::edge_residual_capacity_t> >, boost::keep_all> >]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/breadth_first_search.hpp:62:5: required from ‘void boost::breadth_first_visit(const IncidenceGraph&, SourceIterator, SourceIterator, Buffer&, BFSVisitor, ColorMap) [with IncidenceGraph = filtered_graph > > > >, is_residual_edge > > >, edge_residual_capacity_t> >, keep_all>; Buffer = queue > >; BFSVisitor = bfs_visitor*, std::vector, std::allocator > > >, vec_adj_list_vertex_id_map, detail::edge_desc_impl, detail::edge_desc_impl&>, on_tree_edge> >; ColorMap = iterator_property_map<__gnu_cxx::__normal_iterator >, vec_adj_list_vertex_id_map, default_color_type, default_color_type&>; SourceIterator = long unsigned int*]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/breadth_first_search.hpp:136:24: required from ‘void boost::breadth_first_search(const VertexListGraph&, SourceIterator, SourceIterator, Buffer&, BFSVisitor, ColorMap) [with VertexListGraph = filtered_graph > > > >, is_residual_edge > > >, edge_residual_capacity_t> >, keep_all>; SourceIterator = long unsigned int*; Buffer = queue > >; BFSVisitor = bfs_visitor*, std::vector, std::allocator > > >, vec_adj_list_vertex_id_map, detail::edge_desc_impl, detail::edge_desc_impl&>, on_tree_edge> >; ColorMap = iterator_property_map<__gnu_cxx::__normal_iterator >, vec_adj_list_vertex_id_map, default_color_type, default_color_type&>]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/breadth_first_search.hpp:147:25: required from ‘void boost::breadth_first_search(const VertexListGraph&, typename graph_traits::vertex_descriptor, Buffer&, BFSVisitor, ColorMap) [with VertexListGraph = filtered_graph > > > >, is_residual_edge > > >, edge_residual_capacity_t> >, keep_all>; Buffer = queue > >; BFSVisitor = bfs_visitor*, std::vector, std::allocator > > >, vec_adj_list_vertex_id_map, detail::edge_desc_impl, detail::edge_desc_impl&>, on_tree_edge> >; ColorMap = iterator_property_map<__gnu_cxx::__normal_iterator >, vec_adj_list_vertex_id_map, default_color_type, default_color_type&>; typename graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/edmonds_karp_max_flow.hpp:101:29: required from ‘typename boost::property_traits::value_type boost::edmonds_karp_max_flow(Graph&, typename graph_traits::vertex_descriptor, typename graph_traits::vertex_descriptor, CapacityEdgeMap, ResidualCapacityEdgeMap, ReverseEdgeMap, ColorMap, PredEdgeMap) [with Graph = adjacency_list > > > >; CapacityEdgeMap = adj_list_edge_property_map > > >, edge_capacity_t>; ResidualCapacityEdgeMap = adj_list_edge_property_map > > >, edge_residual_capacity_t>; ReverseEdgeMap = adj_list_edge_property_map, const detail::edge_desc_impl&, long unsigned int, const property > > >, edge_reverse_t>; ColorMap = iterator_property_map<__gnu_cxx::__normal_iterator >, vec_adj_list_vertex_id_map, default_color_type, default_color_type&>; PredEdgeMap = iterator_property_map<__gnu_cxx::__normal_iterator*, std::vector, std::allocator > > >, vec_adj_list_vertex_id_map, detail::edge_desc_impl, detail::edge_desc_impl&>; typename property_traits::value_type = double; typename graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/edmonds_karp_max_flow.hpp:154:41: required from ‘static typename boost::detail::edge_capacity_value::type boost::detail::edmonds_karp_dispatch2::apply(Graph&, typename boost::graph_traits::vertex_descriptor, typename boost::graph_traits::vertex_descriptor, PredMap, const boost::bgl_named_params&, boost::param_not_found) [with Graph = boost::adjacency_list > > > >; PredMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator*, std::vector, std::allocator > > >, boost::vec_adj_list_vertex_id_map, boost::detail::edge_desc_impl, boost::detail::edge_desc_impl&>; P = int; T = boost::buffer_param_t; R = boost::no_property; typename boost::detail::edge_capacity_value::type = double; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/edmonds_karp_max_flow.hpp:208:54: required from ‘static typename boost::detail::edge_capacity_value::type boost::detail::edmonds_karp_dispatch1::apply(Graph&, typename boost::graph_traits::vertex_descriptor, typename boost::graph_traits::vertex_descriptor, const boost::bgl_named_params&, boost::param_not_found) [with Graph = boost::adjacency_list > > > >; P = int; T = boost::buffer_param_t; R = boost::no_property; typename boost::detail::edge_capacity_value::type = double; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/edmonds_karp_max_flow.hpp:228:57: required from ‘typename boost::detail::edge_capacity_value::type boost::edmonds_karp_max_flow(Graph&, typename graph_traits::vertex_descriptor, typename graph_traits::vertex_descriptor, const bgl_named_params&) [with Graph = adjacency_list > > > >; P = int; T = buffer_param_t; R = no_property; typename detail::edge_capacity_value::type = double; typename graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/edmonds_karp_max_flow.hpp:240:33: required from ‘typename boost::property_traits::const_type>::value_type boost::edmonds_karp_max_flow(Graph&, typename graph_traits::vertex_descriptor, typename graph_traits::vertex_descriptor) [with Graph = adjacency_list > > > >; typename property_traits::const_type>::value_type = double; typename property_map::const_type = adj_list_edge_property_map > > >, edge_capacity_t>; typename graph_traits::vertex_descriptor = long unsigned int]’ sna.cpp:204:54: required from here /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::concepts::MultiPassInputIterator::~MultiPassInputIterator() [with T = boost::iterators::filter_iterator > > >, boost::edge_residual_capacity_t> >, boost::keep_all, boost::filtered_graph > > > >, boost::is_residual_edge > > >, boost::edge_residual_capacity_t> >, boost::keep_all> >, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > > > >*, std::vector > > > >, std::allocator > > > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> >]’ 37 | ~model() | ^ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/graph_concepts.hpp:52:50: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 52 | BOOST_concept(MultiPassInputIterator, (T)) { BOOST_CONCEPT_USAGE( | ^~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements >]’: /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:208:5: required from ‘struct boost::Convertible’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::Convertible]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied >::value’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_)>’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/graph_concepts.hpp:93:9: [ skipping 5 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/edmonds_karp_max_flow.hpp:101:29: required from ‘typename boost::property_traits::value_type boost::edmonds_karp_max_flow(Graph&, typename graph_traits::vertex_descriptor, typename graph_traits::vertex_descriptor, CapacityEdgeMap, ResidualCapacityEdgeMap, ReverseEdgeMap, ColorMap, PredEdgeMap) [with Graph = adjacency_list > > > >; CapacityEdgeMap = adj_list_edge_property_map > > >, edge_capacity_t>; ResidualCapacityEdgeMap = adj_list_edge_property_map > > >, edge_residual_capacity_t>; ReverseEdgeMap = adj_list_edge_property_map, const detail::edge_desc_impl&, long unsigned int, const property > > >, edge_reverse_t>; ColorMap = iterator_property_map<__gnu_cxx::__normal_iterator >, vec_adj_list_vertex_id_map, default_color_type, default_color_type&>; PredEdgeMap = iterator_property_map<__gnu_cxx::__normal_iterator*, std::vector, std::allocator > > >, vec_adj_list_vertex_id_map, detail::edge_desc_impl, detail::edge_desc_impl&>; typename property_traits::value_type = double; typename graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/edmonds_karp_max_flow.hpp:154:41: required from ‘static typename boost::detail::edge_capacity_value::type boost::detail::edmonds_karp_dispatch2::apply(Graph&, typename boost::graph_traits::vertex_descriptor, typename boost::graph_traits::vertex_descriptor, PredMap, const boost::bgl_named_params&, boost::param_not_found) [with Graph = boost::adjacency_list > > > >; PredMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator*, std::vector, std::allocator > > >, boost::vec_adj_list_vertex_id_map, boost::detail::edge_desc_impl, boost::detail::edge_desc_impl&>; P = int; T = boost::buffer_param_t; R = boost::no_property; typename boost::detail::edge_capacity_value::type = double; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/edmonds_karp_max_flow.hpp:208:54: required from ‘static typename boost::detail::edge_capacity_value::type boost::detail::edmonds_karp_dispatch1::apply(Graph&, typename boost::graph_traits::vertex_descriptor, typename boost::graph_traits::vertex_descriptor, const boost::bgl_named_params&, boost::param_not_found) [with Graph = boost::adjacency_list > > > >; P = int; T = boost::buffer_param_t; R = boost::no_property; typename boost::detail::edge_capacity_value::type = double; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/edmonds_karp_max_flow.hpp:228:57: required from ‘typename boost::detail::edge_capacity_value::type boost::edmonds_karp_max_flow(Graph&, typename graph_traits::vertex_descriptor, typename graph_traits::vertex_descriptor, const bgl_named_params&) [with Graph = adjacency_list > > > >; P = int; T = buffer_param_t; R = no_property; typename detail::edge_capacity_value::type = double; typename graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/edmonds_karp_max_flow.hpp:240:33: required from ‘typename boost::property_traits::const_type>::value_type boost::edmonds_karp_max_flow(Graph&, typename graph_traits::vertex_descriptor, typename graph_traits::vertex_descriptor) [with Graph = adjacency_list > > > >; typename property_traits::const_type>::value_type = double; typename property_map::const_type = adj_list_edge_property_map > > >, edge_capacity_t>; typename graph_traits::vertex_descriptor = long unsigned int]’ sna.cpp:204:54: required from here /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::Convertible]’ 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ^ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::Convertible]’: /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/graph_concepts.hpp:93:9: required from ‘boost::concepts::IncidenceGraph::~IncidenceGraph() [with G = boost::filtered_graph > > > >, boost::is_residual_edge > > >, boost::edge_residual_capacity_t> >, boost::keep_all>]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/graph_concepts.hpp:75:1: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::IncidenceGraphConcept > > > >, boost::is_residual_edge > > >, boost::edge_residual_capacity_t> >, boost::keep_all> >]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/breadth_first_search.hpp:62:5: required from ‘void boost::breadth_first_visit(const IncidenceGraph&, SourceIterator, SourceIterator, Buffer&, BFSVisitor, ColorMap) [with IncidenceGraph = filtered_graph > > > >, is_residual_edge > > >, edge_residual_capacity_t> >, keep_all>; Buffer = queue > >; BFSVisitor = bfs_visitor*, std::vector, std::allocator > > >, vec_adj_list_vertex_id_map, detail::edge_desc_impl, detail::edge_desc_impl&>, on_tree_edge> >; ColorMap = iterator_property_map<__gnu_cxx::__normal_iterator >, vec_adj_list_vertex_id_map, default_color_type, default_color_type&>; SourceIterator = long unsigned int*]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/breadth_first_search.hpp:136:24: required from ‘void boost::breadth_first_search(const VertexListGraph&, SourceIterator, SourceIterator, Buffer&, BFSVisitor, ColorMap) [with VertexListGraph = filtered_graph > > > >, is_residual_edge > > >, edge_residual_capacity_t> >, keep_all>; SourceIterator = long unsigned int*; Buffer = queue > >; BFSVisitor = bfs_visitor*, std::vector, std::allocator > > >, vec_adj_list_vertex_id_map, detail::edge_desc_impl, detail::edge_desc_impl&>, on_tree_edge> >; ColorMap = iterator_property_map<__gnu_cxx::__normal_iterator >, vec_adj_list_vertex_id_map, default_color_type, default_color_type&>]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/breadth_first_search.hpp:147:25: required from ‘void boost::breadth_first_search(const VertexListGraph&, typename graph_traits::vertex_descriptor, Buffer&, BFSVisitor, ColorMap) [with VertexListGraph = filtered_graph > > > >, is_residual_edge > > >, edge_residual_capacity_t> >, keep_all>; Buffer = queue > >; BFSVisitor = bfs_visitor*, std::vector, std::allocator > > >, vec_adj_list_vertex_id_map, detail::edge_desc_impl, detail::edge_desc_impl&>, on_tree_edge> >; ColorMap = iterator_property_map<__gnu_cxx::__normal_iterator >, vec_adj_list_vertex_id_map, default_color_type, default_color_type&>; typename graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/edmonds_karp_max_flow.hpp:101:29: required from ‘typename boost::property_traits::value_type boost::edmonds_karp_max_flow(Graph&, typename graph_traits::vertex_descriptor, typename graph_traits::vertex_descriptor, CapacityEdgeMap, ResidualCapacityEdgeMap, ReverseEdgeMap, ColorMap, PredEdgeMap) [with Graph = adjacency_list > > > >; CapacityEdgeMap = adj_list_edge_property_map > > >, edge_capacity_t>; ResidualCapacityEdgeMap = adj_list_edge_property_map > > >, edge_residual_capacity_t>; ReverseEdgeMap = adj_list_edge_property_map, const detail::edge_desc_impl&, long unsigned int, const property > > >, edge_reverse_t>; ColorMap = iterator_property_map<__gnu_cxx::__normal_iterator >, vec_adj_list_vertex_id_map, default_color_type, default_color_type&>; PredEdgeMap = iterator_property_map<__gnu_cxx::__normal_iterator*, std::vector, std::allocator > > >, vec_adj_list_vertex_id_map, detail::edge_desc_impl, detail::edge_desc_impl&>; typename property_traits::value_type = double; typename graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/edmonds_karp_max_flow.hpp:154:41: required from ‘static typename boost::detail::edge_capacity_value::type boost::detail::edmonds_karp_dispatch2::apply(Graph&, typename boost::graph_traits::vertex_descriptor, typename boost::graph_traits::vertex_descriptor, PredMap, const boost::bgl_named_params&, boost::param_not_found) [with Graph = boost::adjacency_list > > > >; PredMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator*, std::vector, std::allocator > > >, boost::vec_adj_list_vertex_id_map, boost::detail::edge_desc_impl, boost::detail::edge_desc_impl&>; P = int; T = boost::buffer_param_t; R = boost::no_property; typename boost::detail::edge_capacity_value::type = double; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/edmonds_karp_max_flow.hpp:208:54: required from ‘static typename boost::detail::edge_capacity_value::type boost::detail::edmonds_karp_dispatch1::apply(Graph&, typename boost::graph_traits::vertex_descriptor, typename boost::graph_traits::vertex_descriptor, const boost::bgl_named_params&, boost::param_not_found) [with Graph = boost::adjacency_list > > > >; P = int; T = boost::buffer_param_t; R = boost::no_property; typename boost::detail::edge_capacity_value::type = double; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/edmonds_karp_max_flow.hpp:228:57: required from ‘typename boost::detail::edge_capacity_value::type boost::edmonds_karp_max_flow(Graph&, typename graph_traits::vertex_descriptor, typename graph_traits::vertex_descriptor, const bgl_named_params&) [with Graph = adjacency_list > > > >; P = int; T = buffer_param_t; R = no_property; typename detail::edge_capacity_value::type = double; typename graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/edmonds_karp_max_flow.hpp:240:33: required from ‘typename boost::property_traits::const_type>::value_type boost::edmonds_karp_max_flow(Graph&, typename graph_traits::vertex_descriptor, typename graph_traits::vertex_descriptor) [with Graph = adjacency_list > > > >; typename property_traits::const_type>::value_type = double; typename property_map::const_type = adj_list_edge_property_map > > >, edge_capacity_t>; typename graph_traits::vertex_descriptor = long unsigned int]’ sna.cpp:204:54: required from here /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::Convertible::~Convertible() [with X = boost::adj_list_dir_traversal_tag; Y = boost::incidence_graph_tag]’ 37 | ~model() | ^ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:208:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 208 | BOOST_CONCEPT_USAGE(Convertible) { | ^~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::CopyConstructible*, std::vector, std::allocator > > >, boost::vec_adj_list_vertex_id_map, boost::detail::edge_desc_impl, boost::detail::edge_desc_impl&>, boost::on_tree_edge> > >]’: /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements*, std::vector, std::allocator > > >, boost::vec_adj_list_vertex_id_map, boost::detail::edge_desc_impl, boost::detail::edge_desc_impl&>, boost::on_tree_edge> > > >]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:167:5: required from ‘struct boost::CopyConstructible*, std::vector, std::allocator > > >, boost::vec_adj_list_vertex_id_map, boost::detail::edge_desc_impl, boost::detail::edge_desc_impl&>, boost::on_tree_edge> > >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:165:3: required from ‘struct boost::CopyConstructibleConcept*, std::vector, std::allocator > > >, boost::vec_adj_list_vertex_id_map, boost::detail::edge_desc_impl, boost::detail::edge_desc_impl&>, boost::on_tree_edge> > >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::CopyConstructibleConcept*, std::vector, std::allocator > > >, boost::vec_adj_list_vertex_id_map, boost::detail::edge_desc_impl, boost::detail::edge_desc_impl&>, boost::on_tree_edge> > >]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied*, std::vector, std::allocator > > >, boost::vec_adj_list_vertex_id_map, boost::detail::edge_desc_impl, boost::detail::edge_desc_impl&>, boost::on_tree_edge> > > >::value’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:45:51: [ skipping 10 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/edmonds_karp_max_flow.hpp:101:29: required from ‘typename boost::property_traits::value_type boost::edmonds_karp_max_flow(Graph&, typename graph_traits::vertex_descriptor, typename graph_traits::vertex_descriptor, CapacityEdgeMap, ResidualCapacityEdgeMap, ReverseEdgeMap, ColorMap, PredEdgeMap) [with Graph = adjacency_list > > > >; CapacityEdgeMap = adj_list_edge_property_map > > >, edge_capacity_t>; ResidualCapacityEdgeMap = adj_list_edge_property_map > > >, edge_residual_capacity_t>; ReverseEdgeMap = adj_list_edge_property_map, const detail::edge_desc_impl&, long unsigned int, const property > > >, edge_reverse_t>; ColorMap = iterator_property_map<__gnu_cxx::__normal_iterator >, vec_adj_list_vertex_id_map, default_color_type, default_color_type&>; PredEdgeMap = iterator_property_map<__gnu_cxx::__normal_iterator*, std::vector, std::allocator > > >, vec_adj_list_vertex_id_map, detail::edge_desc_impl, detail::edge_desc_impl&>; typename property_traits::value_type = double; typename graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/edmonds_karp_max_flow.hpp:154:41: required from ‘static typename boost::detail::edge_capacity_value::type boost::detail::edmonds_karp_dispatch2::apply(Graph&, typename boost::graph_traits::vertex_descriptor, typename boost::graph_traits::vertex_descriptor, PredMap, const boost::bgl_named_params&, boost::param_not_found) [with Graph = boost::adjacency_list > > > >; PredMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator*, std::vector, std::allocator > > >, boost::vec_adj_list_vertex_id_map, boost::detail::edge_desc_impl, boost::detail::edge_desc_impl&>; P = int; T = boost::buffer_param_t; R = boost::no_property; typename boost::detail::edge_capacity_value::type = double; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/edmonds_karp_max_flow.hpp:208:54: required from ‘static typename boost::detail::edge_capacity_value::type boost::detail::edmonds_karp_dispatch1::apply(Graph&, typename boost::graph_traits::vertex_descriptor, typename boost::graph_traits::vertex_descriptor, const boost::bgl_named_params&, boost::param_not_found) [with Graph = boost::adjacency_list > > > >; P = int; T = boost::buffer_param_t; R = boost::no_property; typename boost::detail::edge_capacity_value::type = double; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/edmonds_karp_max_flow.hpp:228:57: required from ‘typename boost::detail::edge_capacity_value::type boost::edmonds_karp_max_flow(Graph&, typename graph_traits::vertex_descriptor, typename graph_traits::vertex_descriptor, const bgl_named_params&) [with Graph = adjacency_list > > > >; P = int; T = buffer_param_t; R = no_property; typename detail::edge_capacity_value::type = double; typename graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/edmonds_karp_max_flow.hpp:240:33: required from ‘typename boost::property_traits::const_type>::value_type boost::edmonds_karp_max_flow(Graph&, typename graph_traits::vertex_descriptor, typename graph_traits::vertex_descriptor) [with Graph = adjacency_list > > > >; typename property_traits::const_type>::value_type = double; typename property_map::const_type = adj_list_edge_property_map > > >, edge_capacity_t>; typename graph_traits::vertex_descriptor = long unsigned int]’ sna.cpp:204:54: required from here /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::CopyConstructible::~CopyConstructible() [with TT = boost::bfs_visitor*, std::vector, std::allocator > > >, boost::vec_adj_list_vertex_id_map, boost::detail::edge_desc_impl, boost::detail::edge_desc_impl&>, boost::on_tree_edge> >]’ 37 | ~model() | ^ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:167:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 167 | BOOST_CONCEPT_USAGE(CopyConstructible) { | ^~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::Convertible]’: /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements >]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:208:5: required from ‘struct boost::Convertible’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::Convertible]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied >::value’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:72:8: [ skipping 6 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/graph_concepts.hpp:226:1: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::EdgeListGraphConcept, boost::property >, boost::no_property, boost::listS> >]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/bellman_ford_shortest_paths.hpp:97:5: required from ‘bool boost::bellman_ford_shortest_paths(EdgeListGraph&, Size, WeightMap, PredecessorMap, DistanceMap, BinaryFunction, BinaryPredicate, BellmanFordVisitor) [with EdgeListGraph = adjacency_list, property >, no_property, listS>; Size = long unsigned int; WeightMap = adj_list_edge_property_map >, edge_weight_t>; PredecessorMap = dummy_property_map; DistanceMap = vec_adj_list_vertex_property_map, property >, no_property, listS>, adjacency_list, property >, no_property, listS>*, double, double&, vertex_distance_t>; BinaryFunction = closed_plus; BinaryPredicate = std::less; BellmanFordVisitor = bellman_visitor<>]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/johnson_all_pairs_shortest.hpp:112:36: required from ‘bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, VertexID, Weight, const BinaryPredicate&, const BinaryFunction&, const Infinity&, DistanceZero) [with VertexAndEdgeListGraph = R_adjacency_list; DistanceMatrix = Basic2DMatrix; VertexID = vec_adj_list_vertex_id_map, long unsigned int>; Weight = adj_list_edge_property_map, edge_weight_t>; BinaryPredicate = std::less; BinaryFunction = closed_plus; Infinity = double; DistanceZero = double]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/johnson_all_pairs_shortest.hpp:164:48: required from ‘bool boost::detail::johnson_dispatch(VertexAndEdgeListGraph&, DistanceMatrix&, const boost::bgl_named_params&, Weight, VertexID) [with VertexAndEdgeListGraph = R_adjacency_list; DistanceMatrix = Basic2DMatrix; P = int; T = int; R = boost::no_property; Weight = boost::adj_list_edge_property_map, boost::edge_weight_t>; VertexID = boost::vec_adj_list_vertex_id_map, long unsigned int>]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/johnson_all_pairs_shortest.hpp:192:36: required from ‘bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&) [with VertexAndEdgeListGraph = R_adjacency_list; DistanceMatrix = Basic2DMatrix]’ sna.cpp:105:41: required from here /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::Convertible::~Convertible() [with X = std::forward_iterator_tag; Y = std::input_iterator_tag]’ 37 | ~model() | ^ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:208:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 208 | BOOST_CONCEPT_USAGE(Convertible) { | ^~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements >]’: /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:145:5: required from ‘struct boost::Assignable’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:502:3: required from ‘struct boost::InputIterator’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:540:3: required from ‘struct boost::ForwardIterator’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:568:3: required from ‘struct boost::BidirectionalIterator’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:597:3: required from ‘struct boost::RandomAccessIterator’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:597:3: [ skipping 11 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/dijkstra_shortest_paths.hpp:491:28: required from ‘void boost::dijkstra_shortest_paths(const VertexListGraph&, SourceInputIter, SourceInputIter, PredecessorMap, DistanceMap, WeightMap, IndexMap, Compare, Combine, DistInf, DistZero, DijkstraVisitor) [with VertexListGraph = adjacency_list, property >, no_property, listS>; SourceInputIter = long unsigned int*; DijkstraVisitor = dijkstra_visitor<>; PredecessorMap = dummy_property_map; DistanceMap = vec_adj_list_vertex_property_map, property >, no_property, listS>, adjacency_list, property >, no_property, listS>*, double, double&, vertex_distance_t>; WeightMap = adj_list_edge_property_map >, edge_weight2_t>; IndexMap = vec_adj_list_vertex_id_map, long unsigned int>; Compare = std::less; Combine = closed_plus; DistInf = double; DistZero = double]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/dijkstra_shortest_paths.hpp:505:28: required from ‘void boost::dijkstra_shortest_paths(const VertexListGraph&, typename graph_traits::vertex_descriptor, PredecessorMap, DistanceMap, WeightMap, IndexMap, Compare, Combine, DistInf, DistZero, DijkstraVisitor) [with VertexListGraph = adjacency_list, property >, no_property, listS>; DijkstraVisitor = dijkstra_visitor<>; PredecessorMap = dummy_property_map; DistanceMap = vec_adj_list_vertex_property_map, property >, no_property, listS>, adjacency_list, property >, no_property, listS>*, double, double&, vertex_distance_t>; WeightMap = adj_list_edge_property_map >, edge_weight2_t>; IndexMap = vec_adj_list_vertex_id_map, long unsigned int>; Compare = std::less; Combine = closed_plus; DistInf = double; DistZero = double; typename graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/johnson_all_pairs_shortest.hpp:127:36: required from ‘bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, VertexID, Weight, const BinaryPredicate&, const BinaryFunction&, const Infinity&, DistanceZero) [with VertexAndEdgeListGraph = R_adjacency_list; DistanceMatrix = Basic2DMatrix; VertexID = vec_adj_list_vertex_id_map, long unsigned int>; Weight = adj_list_edge_property_map, edge_weight_t>; BinaryPredicate = std::less; BinaryFunction = closed_plus; Infinity = double; DistanceZero = double]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/johnson_all_pairs_shortest.hpp:164:48: required from ‘bool boost::detail::johnson_dispatch(VertexAndEdgeListGraph&, DistanceMatrix&, const boost::bgl_named_params&, Weight, VertexID) [with VertexAndEdgeListGraph = R_adjacency_list; DistanceMatrix = Basic2DMatrix; P = int; T = int; R = boost::no_property; Weight = boost::adj_list_edge_property_map, boost::edge_weight_t>; VertexID = boost::vec_adj_list_vertex_id_map, long unsigned int>]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/johnson_all_pairs_shortest.hpp:192:36: required from ‘bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&) [with VertexAndEdgeListGraph = R_adjacency_list; DistanceMatrix = Basic2DMatrix]’ sna.cpp:105:41: required from here /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::Assignable]’ 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ^ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements >]’: /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:233:5: required from ‘struct boost::EqualityComparable’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:502:3: required from ‘struct boost::InputIterator’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:540:3: required from ‘struct boost::ForwardIterator’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:568:3: required from ‘struct boost::BidirectionalIterator’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:597:3: required from ‘struct boost::RandomAccessIterator’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:597:3: [ skipping 11 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/dijkstra_shortest_paths.hpp:491:28: required from ‘void boost::dijkstra_shortest_paths(const VertexListGraph&, SourceInputIter, SourceInputIter, PredecessorMap, DistanceMap, WeightMap, IndexMap, Compare, Combine, DistInf, DistZero, DijkstraVisitor) [with VertexListGraph = adjacency_list, property >, no_property, listS>; SourceInputIter = long unsigned int*; DijkstraVisitor = dijkstra_visitor<>; PredecessorMap = dummy_property_map; DistanceMap = vec_adj_list_vertex_property_map, property >, no_property, listS>, adjacency_list, property >, no_property, listS>*, double, double&, vertex_distance_t>; WeightMap = adj_list_edge_property_map >, edge_weight2_t>; IndexMap = vec_adj_list_vertex_id_map, long unsigned int>; Compare = std::less; Combine = closed_plus; DistInf = double; DistZero = double]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/dijkstra_shortest_paths.hpp:505:28: required from ‘void boost::dijkstra_shortest_paths(const VertexListGraph&, typename graph_traits::vertex_descriptor, PredecessorMap, DistanceMap, WeightMap, IndexMap, Compare, Combine, DistInf, DistZero, DijkstraVisitor) [with VertexListGraph = adjacency_list, property >, no_property, listS>; DijkstraVisitor = dijkstra_visitor<>; PredecessorMap = dummy_property_map; DistanceMap = vec_adj_list_vertex_property_map, property >, no_property, listS>, adjacency_list, property >, no_property, listS>*, double, double&, vertex_distance_t>; WeightMap = adj_list_edge_property_map >, edge_weight2_t>; IndexMap = vec_adj_list_vertex_id_map, long unsigned int>; Compare = std::less; Combine = closed_plus; DistInf = double; DistZero = double; typename graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/johnson_all_pairs_shortest.hpp:127:36: required from ‘bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, VertexID, Weight, const BinaryPredicate&, const BinaryFunction&, const Infinity&, DistanceZero) [with VertexAndEdgeListGraph = R_adjacency_list; DistanceMatrix = Basic2DMatrix; VertexID = vec_adj_list_vertex_id_map, long unsigned int>; Weight = adj_list_edge_property_map, edge_weight_t>; BinaryPredicate = std::less; BinaryFunction = closed_plus; Infinity = double; DistanceZero = double]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/johnson_all_pairs_shortest.hpp:164:48: required from ‘bool boost::detail::johnson_dispatch(VertexAndEdgeListGraph&, DistanceMatrix&, const boost::bgl_named_params&, Weight, VertexID) [with VertexAndEdgeListGraph = R_adjacency_list; DistanceMatrix = Basic2DMatrix; P = int; T = int; R = boost::no_property; Weight = boost::adj_list_edge_property_map, boost::edge_weight_t>; VertexID = boost::vec_adj_list_vertex_id_map, long unsigned int>]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/johnson_all_pairs_shortest.hpp:192:36: required from ‘bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&) [with VertexAndEdgeListGraph = R_adjacency_list; DistanceMatrix = Basic2DMatrix]’ sna.cpp:105:41: required from here /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::EqualityComparable]’ 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ^ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements >]’: /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:512:7: required from ‘struct boost::InputIterator’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:540:3: required from ‘struct boost::ForwardIterator’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:568:3: required from ‘struct boost::BidirectionalIterator’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:597:3: required from ‘struct boost::RandomAccessIterator’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:597:3: required from ‘struct boost::RandomAccessIteratorConcept’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:32:62: [ skipping 10 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/dijkstra_shortest_paths.hpp:491:28: required from ‘void boost::dijkstra_shortest_paths(const VertexListGraph&, SourceInputIter, SourceInputIter, PredecessorMap, DistanceMap, WeightMap, IndexMap, Compare, Combine, DistInf, DistZero, DijkstraVisitor) [with VertexListGraph = adjacency_list, property >, no_property, listS>; SourceInputIter = long unsigned int*; DijkstraVisitor = dijkstra_visitor<>; PredecessorMap = dummy_property_map; DistanceMap = vec_adj_list_vertex_property_map, property >, no_property, listS>, adjacency_list, property >, no_property, listS>*, double, double&, vertex_distance_t>; WeightMap = adj_list_edge_property_map >, edge_weight2_t>; IndexMap = vec_adj_list_vertex_id_map, long unsigned int>; Compare = std::less; Combine = closed_plus; DistInf = double; DistZero = double]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/dijkstra_shortest_paths.hpp:505:28: required from ‘void boost::dijkstra_shortest_paths(const VertexListGraph&, typename graph_traits::vertex_descriptor, PredecessorMap, DistanceMap, WeightMap, IndexMap, Compare, Combine, DistInf, DistZero, DijkstraVisitor) [with VertexListGraph = adjacency_list, property >, no_property, listS>; DijkstraVisitor = dijkstra_visitor<>; PredecessorMap = dummy_property_map; DistanceMap = vec_adj_list_vertex_property_map, property >, no_property, listS>, adjacency_list, property >, no_property, listS>*, double, double&, vertex_distance_t>; WeightMap = adj_list_edge_property_map >, edge_weight2_t>; IndexMap = vec_adj_list_vertex_id_map, long unsigned int>; Compare = std::less; Combine = closed_plus; DistInf = double; DistZero = double; typename graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/johnson_all_pairs_shortest.hpp:127:36: required from ‘bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, VertexID, Weight, const BinaryPredicate&, const BinaryFunction&, const Infinity&, DistanceZero) [with VertexAndEdgeListGraph = R_adjacency_list; DistanceMatrix = Basic2DMatrix; VertexID = vec_adj_list_vertex_id_map, long unsigned int>; Weight = adj_list_edge_property_map, edge_weight_t>; BinaryPredicate = std::less; BinaryFunction = closed_plus; Infinity = double; DistanceZero = double]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/johnson_all_pairs_shortest.hpp:164:48: required from ‘bool boost::detail::johnson_dispatch(VertexAndEdgeListGraph&, DistanceMatrix&, const boost::bgl_named_params&, Weight, VertexID) [with VertexAndEdgeListGraph = R_adjacency_list; DistanceMatrix = Basic2DMatrix; P = int; T = int; R = boost::no_property; Weight = boost::adj_list_edge_property_map, boost::edge_weight_t>; VertexID = boost::vec_adj_list_vertex_id_map, long unsigned int>]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/johnson_all_pairs_shortest.hpp:192:36: required from ‘bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&) [with VertexAndEdgeListGraph = R_adjacency_list; DistanceMatrix = Basic2DMatrix]’ sna.cpp:105:41: required from here /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::InputIterator]’ 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ^ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements >]’: /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:543:7: required from ‘struct boost::ForwardIterator’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:568:3: required from ‘struct boost::BidirectionalIterator’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:597:3: required from ‘struct boost::RandomAccessIterator’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:597:3: required from ‘struct boost::RandomAccessIteratorConcept’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::RandomAccessIteratorConcept]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:42:5: [ skipping 9 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/dijkstra_shortest_paths.hpp:491:28: required from ‘void boost::dijkstra_shortest_paths(const VertexListGraph&, SourceInputIter, SourceInputIter, PredecessorMap, DistanceMap, WeightMap, IndexMap, Compare, Combine, DistInf, DistZero, DijkstraVisitor) [with VertexListGraph = adjacency_list, property >, no_property, listS>; SourceInputIter = long unsigned int*; DijkstraVisitor = dijkstra_visitor<>; PredecessorMap = dummy_property_map; DistanceMap = vec_adj_list_vertex_property_map, property >, no_property, listS>, adjacency_list, property >, no_property, listS>*, double, double&, vertex_distance_t>; WeightMap = adj_list_edge_property_map >, edge_weight2_t>; IndexMap = vec_adj_list_vertex_id_map, long unsigned int>; Compare = std::less; Combine = closed_plus; DistInf = double; DistZero = double]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/dijkstra_shortest_paths.hpp:505:28: required from ‘void boost::dijkstra_shortest_paths(const VertexListGraph&, typename graph_traits::vertex_descriptor, PredecessorMap, DistanceMap, WeightMap, IndexMap, Compare, Combine, DistInf, DistZero, DijkstraVisitor) [with VertexListGraph = adjacency_list, property >, no_property, listS>; DijkstraVisitor = dijkstra_visitor<>; PredecessorMap = dummy_property_map; DistanceMap = vec_adj_list_vertex_property_map, property >, no_property, listS>, adjacency_list, property >, no_property, listS>*, double, double&, vertex_distance_t>; WeightMap = adj_list_edge_property_map >, edge_weight2_t>; IndexMap = vec_adj_list_vertex_id_map, long unsigned int>; Compare = std::less; Combine = closed_plus; DistInf = double; DistZero = double; typename graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/johnson_all_pairs_shortest.hpp:127:36: required from ‘bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, VertexID, Weight, const BinaryPredicate&, const BinaryFunction&, const Infinity&, DistanceZero) [with VertexAndEdgeListGraph = R_adjacency_list; DistanceMatrix = Basic2DMatrix; VertexID = vec_adj_list_vertex_id_map, long unsigned int>; Weight = adj_list_edge_property_map, edge_weight_t>; BinaryPredicate = std::less; BinaryFunction = closed_plus; Infinity = double; DistanceZero = double]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/johnson_all_pairs_shortest.hpp:164:48: required from ‘bool boost::detail::johnson_dispatch(VertexAndEdgeListGraph&, DistanceMatrix&, const boost::bgl_named_params&, Weight, VertexID) [with VertexAndEdgeListGraph = R_adjacency_list; DistanceMatrix = Basic2DMatrix; P = int; T = int; R = boost::no_property; Weight = boost::adj_list_edge_property_map, boost::edge_weight_t>; VertexID = boost::vec_adj_list_vertex_id_map, long unsigned int>]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/johnson_all_pairs_shortest.hpp:192:36: required from ‘bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&) [with VertexAndEdgeListGraph = R_adjacency_list; DistanceMatrix = Basic2DMatrix]’ sna.cpp:105:41: required from here /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::ForwardIterator]’ 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ^ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements >]’: /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:571:7: required from ‘struct boost::BidirectionalIterator’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:597:3: required from ‘struct boost::RandomAccessIterator’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:597:3: required from ‘struct boost::RandomAccessIteratorConcept’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::RandomAccessIteratorConcept]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied >::value’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:45:51: [ skipping 8 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/dijkstra_shortest_paths.hpp:491:28: required from ‘void boost::dijkstra_shortest_paths(const VertexListGraph&, SourceInputIter, SourceInputIter, PredecessorMap, DistanceMap, WeightMap, IndexMap, Compare, Combine, DistInf, DistZero, DijkstraVisitor) [with VertexListGraph = adjacency_list, property >, no_property, listS>; SourceInputIter = long unsigned int*; DijkstraVisitor = dijkstra_visitor<>; PredecessorMap = dummy_property_map; DistanceMap = vec_adj_list_vertex_property_map, property >, no_property, listS>, adjacency_list, property >, no_property, listS>*, double, double&, vertex_distance_t>; WeightMap = adj_list_edge_property_map >, edge_weight2_t>; IndexMap = vec_adj_list_vertex_id_map, long unsigned int>; Compare = std::less; Combine = closed_plus; DistInf = double; DistZero = double]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/dijkstra_shortest_paths.hpp:505:28: required from ‘void boost::dijkstra_shortest_paths(const VertexListGraph&, typename graph_traits::vertex_descriptor, PredecessorMap, DistanceMap, WeightMap, IndexMap, Compare, Combine, DistInf, DistZero, DijkstraVisitor) [with VertexListGraph = adjacency_list, property >, no_property, listS>; DijkstraVisitor = dijkstra_visitor<>; PredecessorMap = dummy_property_map; DistanceMap = vec_adj_list_vertex_property_map, property >, no_property, listS>, adjacency_list, property >, no_property, listS>*, double, double&, vertex_distance_t>; WeightMap = adj_list_edge_property_map >, edge_weight2_t>; IndexMap = vec_adj_list_vertex_id_map, long unsigned int>; Compare = std::less; Combine = closed_plus; DistInf = double; DistZero = double; typename graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/johnson_all_pairs_shortest.hpp:127:36: required from ‘bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, VertexID, Weight, const BinaryPredicate&, const BinaryFunction&, const Infinity&, DistanceZero) [with VertexAndEdgeListGraph = R_adjacency_list; DistanceMatrix = Basic2DMatrix; VertexID = vec_adj_list_vertex_id_map, long unsigned int>; Weight = adj_list_edge_property_map, edge_weight_t>; BinaryPredicate = std::less; BinaryFunction = closed_plus; Infinity = double; DistanceZero = double]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/johnson_all_pairs_shortest.hpp:164:48: required from ‘bool boost::detail::johnson_dispatch(VertexAndEdgeListGraph&, DistanceMatrix&, const boost::bgl_named_params&, Weight, VertexID) [with VertexAndEdgeListGraph = R_adjacency_list; DistanceMatrix = Basic2DMatrix; P = int; T = int; R = boost::no_property; Weight = boost::adj_list_edge_property_map, boost::edge_weight_t>; VertexID = boost::vec_adj_list_vertex_id_map, long unsigned int>]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/johnson_all_pairs_shortest.hpp:192:36: required from ‘bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&) [with VertexAndEdgeListGraph = R_adjacency_list; DistanceMatrix = Basic2DMatrix]’ sna.cpp:105:41: required from here /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::BidirectionalIterator]’ 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ^ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements >]’: /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:253:5: required from ‘struct boost::Comparable’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:597:3: required from ‘struct boost::RandomAccessIterator’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:597:3: required from ‘struct boost::RandomAccessIteratorConcept’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::RandomAccessIteratorConcept]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied >::value’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:45:51: [ skipping 8 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/dijkstra_shortest_paths.hpp:491:28: required from ‘void boost::dijkstra_shortest_paths(const VertexListGraph&, SourceInputIter, SourceInputIter, PredecessorMap, DistanceMap, WeightMap, IndexMap, Compare, Combine, DistInf, DistZero, DijkstraVisitor) [with VertexListGraph = adjacency_list, property >, no_property, listS>; SourceInputIter = long unsigned int*; DijkstraVisitor = dijkstra_visitor<>; PredecessorMap = dummy_property_map; DistanceMap = vec_adj_list_vertex_property_map, property >, no_property, listS>, adjacency_list, property >, no_property, listS>*, double, double&, vertex_distance_t>; WeightMap = adj_list_edge_property_map >, edge_weight2_t>; IndexMap = vec_adj_list_vertex_id_map, long unsigned int>; Compare = std::less; Combine = closed_plus; DistInf = double; DistZero = double]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/dijkstra_shortest_paths.hpp:505:28: required from ‘void boost::dijkstra_shortest_paths(const VertexListGraph&, typename graph_traits::vertex_descriptor, PredecessorMap, DistanceMap, WeightMap, IndexMap, Compare, Combine, DistInf, DistZero, DijkstraVisitor) [with VertexListGraph = adjacency_list, property >, no_property, listS>; DijkstraVisitor = dijkstra_visitor<>; PredecessorMap = dummy_property_map; DistanceMap = vec_adj_list_vertex_property_map, property >, no_property, listS>, adjacency_list, property >, no_property, listS>*, double, double&, vertex_distance_t>; WeightMap = adj_list_edge_property_map >, edge_weight2_t>; IndexMap = vec_adj_list_vertex_id_map, long unsigned int>; Compare = std::less; Combine = closed_plus; DistInf = double; DistZero = double; typename graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/johnson_all_pairs_shortest.hpp:127:36: required from ‘bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, VertexID, Weight, const BinaryPredicate&, const BinaryFunction&, const Infinity&, DistanceZero) [with VertexAndEdgeListGraph = R_adjacency_list; DistanceMatrix = Basic2DMatrix; VertexID = vec_adj_list_vertex_id_map, long unsigned int>; Weight = adj_list_edge_property_map, edge_weight_t>; BinaryPredicate = std::less; BinaryFunction = closed_plus; Infinity = double; DistanceZero = double]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/johnson_all_pairs_shortest.hpp:164:48: required from ‘bool boost::detail::johnson_dispatch(VertexAndEdgeListGraph&, DistanceMatrix&, const boost::bgl_named_params&, Weight, VertexID) [with VertexAndEdgeListGraph = R_adjacency_list; DistanceMatrix = Basic2DMatrix; P = int; T = int; R = boost::no_property; Weight = boost::adj_list_edge_property_map, boost::edge_weight_t>; VertexID = boost::vec_adj_list_vertex_id_map, long unsigned int>]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/johnson_all_pairs_shortest.hpp:192:36: required from ‘bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&) [with VertexAndEdgeListGraph = R_adjacency_list; DistanceMatrix = Basic2DMatrix]’ sna.cpp:105:41: required from here /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::Comparable]’ 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ^ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements >]’: /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:601:7: required from ‘struct boost::RandomAccessIterator’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:597:3: required from ‘struct boost::RandomAccessIteratorConcept’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::RandomAccessIteratorConcept]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied >::value’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:72:8: [ skipping 7 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/dijkstra_shortest_paths.hpp:491:28: required from ‘void boost::dijkstra_shortest_paths(const VertexListGraph&, SourceInputIter, SourceInputIter, PredecessorMap, DistanceMap, WeightMap, IndexMap, Compare, Combine, DistInf, DistZero, DijkstraVisitor) [with VertexListGraph = adjacency_list, property >, no_property, listS>; SourceInputIter = long unsigned int*; DijkstraVisitor = dijkstra_visitor<>; PredecessorMap = dummy_property_map; DistanceMap = vec_adj_list_vertex_property_map, property >, no_property, listS>, adjacency_list, property >, no_property, listS>*, double, double&, vertex_distance_t>; WeightMap = adj_list_edge_property_map >, edge_weight2_t>; IndexMap = vec_adj_list_vertex_id_map, long unsigned int>; Compare = std::less; Combine = closed_plus; DistInf = double; DistZero = double]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/dijkstra_shortest_paths.hpp:505:28: required from ‘void boost::dijkstra_shortest_paths(const VertexListGraph&, typename graph_traits::vertex_descriptor, PredecessorMap, DistanceMap, WeightMap, IndexMap, Compare, Combine, DistInf, DistZero, DijkstraVisitor) [with VertexListGraph = adjacency_list, property >, no_property, listS>; DijkstraVisitor = dijkstra_visitor<>; PredecessorMap = dummy_property_map; DistanceMap = vec_adj_list_vertex_property_map, property >, no_property, listS>, adjacency_list, property >, no_property, listS>*, double, double&, vertex_distance_t>; WeightMap = adj_list_edge_property_map >, edge_weight2_t>; IndexMap = vec_adj_list_vertex_id_map, long unsigned int>; Compare = std::less; Combine = closed_plus; DistInf = double; DistZero = double; typename graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/johnson_all_pairs_shortest.hpp:127:36: required from ‘bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, VertexID, Weight, const BinaryPredicate&, const BinaryFunction&, const Infinity&, DistanceZero) [with VertexAndEdgeListGraph = R_adjacency_list; DistanceMatrix = Basic2DMatrix; VertexID = vec_adj_list_vertex_id_map, long unsigned int>; Weight = adj_list_edge_property_map, edge_weight_t>; BinaryPredicate = std::less; BinaryFunction = closed_plus; Infinity = double; DistanceZero = double]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/johnson_all_pairs_shortest.hpp:164:48: required from ‘bool boost::detail::johnson_dispatch(VertexAndEdgeListGraph&, DistanceMatrix&, const boost::bgl_named_params&, Weight, VertexID) [with VertexAndEdgeListGraph = R_adjacency_list; DistanceMatrix = Basic2DMatrix; P = int; T = int; R = boost::no_property; Weight = boost::adj_list_edge_property_map, boost::edge_weight_t>; VertexID = boost::vec_adj_list_vertex_id_map, long unsigned int>]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/johnson_all_pairs_shortest.hpp:192:36: required from ‘bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&) [with VertexAndEdgeListGraph = R_adjacency_list; DistanceMatrix = Basic2DMatrix]’ sna.cpp:105:41: required from here /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::RandomAccessIterator]’ 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ^ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::RandomAccessIteratorConcept]’: /home/omnipath/local/R/4.4-3.20/BH/include/boost/property_map/property_map.hpp:354:5: required from ‘boost::iterator_property_map >::value_type, typename std::iterator_traits< >::reference> boost::make_iterator_property_map(RAIter, ID) [with RAIter = long unsigned int*; ID = vec_adj_list_vertex_id_map, long unsigned int>; typename std::iterator_traits< >::value_type = long unsigned int; typename std::iterator_traits< >::reference = long unsigned int&]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/dijkstra_shortest_paths.hpp:245:46: required from ‘static boost::detail::vertex_property_map_generator_helper::type boost::detail::vertex_property_map_generator_helper::build(const Graph&, const IndexMap&, boost::scoped_array&) [with Graph = boost::adjacency_list, boost::property >, boost::no_property, boost::listS>; IndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>; Value = long unsigned int; type = boost::iterator_property_map, long unsigned int>, long unsigned int, long unsigned int&>]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/dijkstra_shortest_paths.hpp:273:33: required from ‘static boost::detail::vertex_property_map_generator::type boost::detail::vertex_property_map_generator::build(const Graph&, const IndexMap&, boost::scoped_array&) [with Graph = boost::adjacency_list, boost::property >, boost::no_property, boost::listS>; IndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>; Value = long unsigned int; type = boost::iterator_property_map, long unsigned int>, long unsigned int, long unsigned int&>]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/dijkstra_shortest_paths.hpp:377:38: required from ‘void boost::dijkstra_shortest_paths_no_init(const Graph&, SourceInputIter, SourceInputIter, PredecessorMap, DistanceMap, WeightMap, IndexMap, Compare, Combine, DistZero, DijkstraVisitor, ColorMap) [with Graph = adjacency_list, property >, no_property, listS>; SourceInputIter = long unsigned int*; DijkstraVisitor = dijkstra_visitor<>; PredecessorMap = dummy_property_map; DistanceMap = vec_adj_list_vertex_property_map, property >, no_property, listS>, adjacency_list, property >, no_property, listS>*, double, double&, vertex_distance_t>; WeightMap = adj_list_edge_property_map >, edge_weight2_t>; IndexMap = vec_adj_list_vertex_id_map, long unsigned int>; Compare = std::less; Combine = closed_plus; DistZero = double; ColorMap = two_bit_color_map, long unsigned int> >]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/dijkstra_shortest_paths.hpp:464:36: [ skipping 2 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/dijkstra_shortest_paths.hpp:491:28: required from ‘void boost::dijkstra_shortest_paths(const VertexListGraph&, SourceInputIter, SourceInputIter, PredecessorMap, DistanceMap, WeightMap, IndexMap, Compare, Combine, DistInf, DistZero, DijkstraVisitor) [with VertexListGraph = adjacency_list, property >, no_property, listS>; SourceInputIter = long unsigned int*; DijkstraVisitor = dijkstra_visitor<>; PredecessorMap = dummy_property_map; DistanceMap = vec_adj_list_vertex_property_map, property >, no_property, listS>, adjacency_list, property >, no_property, listS>*, double, double&, vertex_distance_t>; WeightMap = adj_list_edge_property_map >, edge_weight2_t>; IndexMap = vec_adj_list_vertex_id_map, long unsigned int>; Compare = std::less; Combine = closed_plus; DistInf = double; DistZero = double]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/dijkstra_shortest_paths.hpp:505:28: required from ‘void boost::dijkstra_shortest_paths(const VertexListGraph&, typename graph_traits::vertex_descriptor, PredecessorMap, DistanceMap, WeightMap, IndexMap, Compare, Combine, DistInf, DistZero, DijkstraVisitor) [with VertexListGraph = adjacency_list, property >, no_property, listS>; DijkstraVisitor = dijkstra_visitor<>; PredecessorMap = dummy_property_map; DistanceMap = vec_adj_list_vertex_property_map, property >, no_property, listS>, adjacency_list, property >, no_property, listS>*, double, double&, vertex_distance_t>; WeightMap = adj_list_edge_property_map >, edge_weight2_t>; IndexMap = vec_adj_list_vertex_id_map, long unsigned int>; Compare = std::less; Combine = closed_plus; DistInf = double; DistZero = double; typename graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/johnson_all_pairs_shortest.hpp:127:36: required from ‘bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, VertexID, Weight, const BinaryPredicate&, const BinaryFunction&, const Infinity&, DistanceZero) [with VertexAndEdgeListGraph = R_adjacency_list; DistanceMatrix = Basic2DMatrix; VertexID = vec_adj_list_vertex_id_map, long unsigned int>; Weight = adj_list_edge_property_map, edge_weight_t>; BinaryPredicate = std::less; BinaryFunction = closed_plus; Infinity = double; DistanceZero = double]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/johnson_all_pairs_shortest.hpp:164:48: required from ‘bool boost::detail::johnson_dispatch(VertexAndEdgeListGraph&, DistanceMatrix&, const boost::bgl_named_params&, Weight, VertexID) [with VertexAndEdgeListGraph = R_adjacency_list; DistanceMatrix = Basic2DMatrix; P = int; T = int; R = boost::no_property; Weight = boost::adj_list_edge_property_map, boost::edge_weight_t>; VertexID = boost::vec_adj_list_vertex_id_map, long unsigned int>]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/johnson_all_pairs_shortest.hpp:192:36: required from ‘bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&) [with VertexAndEdgeListGraph = R_adjacency_list; DistanceMatrix = Basic2DMatrix]’ sna.cpp:105:41: required from here /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:597:17: note: in a call to non-static member function ‘boost::RandomAccessIteratorConcept::~RandomAccessIteratorConcept()’ 597 | BOOST_concept(RandomAccessIterator,(TT)) | ^~~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/preprocessor/cat.hpp:29:34: note: in definition of macro ‘BOOST_PP_CAT_I’ 29 | # define BOOST_PP_CAT_I(a, b) a ## b | ^ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/concept_def.hpp:23:12: note: in expansion of macro ‘BOOST_PP_CAT’ 23 | struct BOOST_PP_CAT(name,Concept) \ | ^~~~~~~~~~~~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:597:3: note: in expansion of macro ‘BOOST_concept’ 597 | BOOST_concept(RandomAccessIterator,(TT)) | ^~~~~~~~~~~~~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >]’: /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/graph_concepts.hpp:52:50: required from ‘struct boost::concepts::MultiPassInputIterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::concepts::MultiPassInputIterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> >]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::value’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_ > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> >)>’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/graph_concepts.hpp:89:9: [ skipping 6 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/dijkstra_shortest_paths.hpp:491:28: required from ‘void boost::dijkstra_shortest_paths(const VertexListGraph&, SourceInputIter, SourceInputIter, PredecessorMap, DistanceMap, WeightMap, IndexMap, Compare, Combine, DistInf, DistZero, DijkstraVisitor) [with VertexListGraph = adjacency_list, property >, no_property, listS>; SourceInputIter = long unsigned int*; DijkstraVisitor = dijkstra_visitor<>; PredecessorMap = dummy_property_map; DistanceMap = vec_adj_list_vertex_property_map, property >, no_property, listS>, adjacency_list, property >, no_property, listS>*, double, double&, vertex_distance_t>; WeightMap = adj_list_edge_property_map >, edge_weight2_t>; IndexMap = vec_adj_list_vertex_id_map, long unsigned int>; Compare = std::less; Combine = closed_plus; DistInf = double; DistZero = double]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/dijkstra_shortest_paths.hpp:505:28: required from ‘void boost::dijkstra_shortest_paths(const VertexListGraph&, typename graph_traits::vertex_descriptor, PredecessorMap, DistanceMap, WeightMap, IndexMap, Compare, Combine, DistInf, DistZero, DijkstraVisitor) [with VertexListGraph = adjacency_list, property >, no_property, listS>; DijkstraVisitor = dijkstra_visitor<>; PredecessorMap = dummy_property_map; DistanceMap = vec_adj_list_vertex_property_map, property >, no_property, listS>, adjacency_list, property >, no_property, listS>*, double, double&, vertex_distance_t>; WeightMap = adj_list_edge_property_map >, edge_weight2_t>; IndexMap = vec_adj_list_vertex_id_map, long unsigned int>; Compare = std::less; Combine = closed_plus; DistInf = double; DistZero = double; typename graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/johnson_all_pairs_shortest.hpp:127:36: required from ‘bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, VertexID, Weight, const BinaryPredicate&, const BinaryFunction&, const Infinity&, DistanceZero) [with VertexAndEdgeListGraph = R_adjacency_list; DistanceMatrix = Basic2DMatrix; VertexID = vec_adj_list_vertex_id_map, long unsigned int>; Weight = adj_list_edge_property_map, edge_weight_t>; BinaryPredicate = std::less; BinaryFunction = closed_plus; Infinity = double; DistanceZero = double]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/johnson_all_pairs_shortest.hpp:164:48: required from ‘bool boost::detail::johnson_dispatch(VertexAndEdgeListGraph&, DistanceMatrix&, const boost::bgl_named_params&, Weight, VertexID) [with VertexAndEdgeListGraph = R_adjacency_list; DistanceMatrix = Basic2DMatrix; P = int; T = int; R = boost::no_property; Weight = boost::adj_list_edge_property_map, boost::edge_weight_t>; VertexID = boost::vec_adj_list_vertex_id_map, long unsigned int>]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/johnson_all_pairs_shortest.hpp:192:36: required from ‘bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&) [with VertexAndEdgeListGraph = R_adjacency_list; DistanceMatrix = Basic2DMatrix]’ sna.cpp:105:41: required from here /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::concepts::MultiPassInputIterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> >]’ 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ^ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::MultiPassInputIterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> >]’: /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/graph_concepts.hpp:89:9: required from ‘boost::concepts::IncidenceGraph::~IncidenceGraph() [with G = boost::adjacency_list, boost::property >, boost::no_property, boost::listS>]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/graph_concepts.hpp:75:1: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::IncidenceGraphConcept, boost::property >, boost::no_property, boost::listS> >]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/breadth_first_search.hpp:62:5: required from ‘void boost::breadth_first_visit(const IncidenceGraph&, SourceIterator, SourceIterator, Buffer&, BFSVisitor, ColorMap) [with IncidenceGraph = adjacency_list, property >, no_property, listS>; Buffer = d_ary_heap_indirect, long unsigned int>, long unsigned int, long unsigned int&>, vec_adj_list_vertex_property_map, property >, no_property, listS>, adjacency_list, property >, no_property, listS>*, double, double&, vertex_distance_t>, std::less, std::vector > >; BFSVisitor = detail::dijkstra_bfs_visitor, d_ary_heap_indirect, long unsigned int>, long unsigned int, long unsigned int&>, vec_adj_list_vertex_property_map, property >, no_property, listS>, adjacency_list, property >, no_property, listS>*, double, double&, vertex_distance_t>, std::less, std::vector > >, adj_list_edge_property_map >, edge_weight2_t>, dummy_property_map, vec_adj_list_vertex_property_map, property >, no_property, listS>, adjacency_list, property >, no_property, listS>*, double, double&, vertex_distance_t>, closed_plus, std::less >; ColorMap = two_bit_color_map, long unsigned int> >; SourceIterator = long unsigned int*]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/dijkstra_shortest_paths.hpp:387:24: required from ‘void boost::dijkstra_shortest_paths_no_init(const Graph&, SourceInputIter, SourceInputIter, PredecessorMap, DistanceMap, WeightMap, IndexMap, Compare, Combine, DistZero, DijkstraVisitor, ColorMap) [with Graph = adjacency_list, property >, no_property, listS>; SourceInputIter = long unsigned int*; DijkstraVisitor = dijkstra_visitor<>; PredecessorMap = dummy_property_map; DistanceMap = vec_adj_list_vertex_property_map, property >, no_property, listS>, adjacency_list, property >, no_property, listS>*, double, double&, vertex_distance_t>; WeightMap = adj_list_edge_property_map >, edge_weight2_t>; IndexMap = vec_adj_list_vertex_id_map, long unsigned int>; Compare = std::less; Combine = closed_plus; DistZero = double; ColorMap = two_bit_color_map, long unsigned int> >]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/dijkstra_shortest_paths.hpp:464:36: [ skipping 2 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/dijkstra_shortest_paths.hpp:491:28: required from ‘void boost::dijkstra_shortest_paths(const VertexListGraph&, SourceInputIter, SourceInputIter, PredecessorMap, DistanceMap, WeightMap, IndexMap, Compare, Combine, DistInf, DistZero, DijkstraVisitor) [with VertexListGraph = adjacency_list, property >, no_property, listS>; SourceInputIter = long unsigned int*; DijkstraVisitor = dijkstra_visitor<>; PredecessorMap = dummy_property_map; DistanceMap = vec_adj_list_vertex_property_map, property >, no_property, listS>, adjacency_list, property >, no_property, listS>*, double, double&, vertex_distance_t>; WeightMap = adj_list_edge_property_map >, edge_weight2_t>; IndexMap = vec_adj_list_vertex_id_map, long unsigned int>; Compare = std::less; Combine = closed_plus; DistInf = double; DistZero = double]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/dijkstra_shortest_paths.hpp:505:28: required from ‘void boost::dijkstra_shortest_paths(const VertexListGraph&, typename graph_traits::vertex_descriptor, PredecessorMap, DistanceMap, WeightMap, IndexMap, Compare, Combine, DistInf, DistZero, DijkstraVisitor) [with VertexListGraph = adjacency_list, property >, no_property, listS>; DijkstraVisitor = dijkstra_visitor<>; PredecessorMap = dummy_property_map; DistanceMap = vec_adj_list_vertex_property_map, property >, no_property, listS>, adjacency_list, property >, no_property, listS>*, double, double&, vertex_distance_t>; WeightMap = adj_list_edge_property_map >, edge_weight2_t>; IndexMap = vec_adj_list_vertex_id_map, long unsigned int>; Compare = std::less; Combine = closed_plus; DistInf = double; DistZero = double; typename graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/johnson_all_pairs_shortest.hpp:127:36: required from ‘bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, VertexID, Weight, const BinaryPredicate&, const BinaryFunction&, const Infinity&, DistanceZero) [with VertexAndEdgeListGraph = R_adjacency_list; DistanceMatrix = Basic2DMatrix; VertexID = vec_adj_list_vertex_id_map, long unsigned int>; Weight = adj_list_edge_property_map, edge_weight_t>; BinaryPredicate = std::less; BinaryFunction = closed_plus; Infinity = double; DistanceZero = double]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/johnson_all_pairs_shortest.hpp:164:48: required from ‘bool boost::detail::johnson_dispatch(VertexAndEdgeListGraph&, DistanceMatrix&, const boost::bgl_named_params&, Weight, VertexID) [with VertexAndEdgeListGraph = R_adjacency_list; DistanceMatrix = Basic2DMatrix; P = int; T = int; R = boost::no_property; Weight = boost::adj_list_edge_property_map, boost::edge_weight_t>; VertexID = boost::vec_adj_list_vertex_id_map, long unsigned int>]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/johnson_all_pairs_shortest.hpp:192:36: required from ‘bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&) [with VertexAndEdgeListGraph = R_adjacency_list; DistanceMatrix = Basic2DMatrix]’ sna.cpp:105:41: required from here /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::concepts::MultiPassInputIterator::~MultiPassInputIterator() [with T = boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>]’ 37 | ~model() | ^ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/graph_concepts.hpp:52:50: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 52 | BOOST_concept(MultiPassInputIterator, (T)) { BOOST_CONCEPT_USAGE( | ^~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::CopyConstructible, boost::d_ary_heap_indirect, long unsigned int>, long unsigned int, long unsigned int&>, boost::vec_adj_list_vertex_property_map, boost::property >, boost::no_property, boost::listS>, boost::adjacency_list, boost::property >, boost::no_property, boost::listS>*, double, double&, boost::vertex_distance_t>, std::less, std::vector > >, boost::adj_list_edge_property_map >, boost::edge_weight2_t>, boost::dummy_property_map, boost::vec_adj_list_vertex_property_map, boost::property >, boost::no_property, boost::listS>, boost::adjacency_list, boost::property >, boost::no_property, boost::listS>*, double, double&, boost::vertex_distance_t>, boost::closed_plus, std::less > >]’: /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements, boost::d_ary_heap_indirect, long unsigned int>, long unsigned int, long unsigned int&>, boost::vec_adj_list_vertex_property_map, boost::property >, boost::no_property, boost::listS>, boost::adjacency_list, boost::property >, boost::no_property, boost::listS>*, double, double&, boost::vertex_distance_t>, std::less, std::vector > >, boost::adj_list_edge_property_map >, boost::edge_weight2_t>, boost::dummy_property_map, boost::vec_adj_list_vertex_property_map, boost::property >, boost::no_property, boost::listS>, boost::adjacency_list, boost::property >, boost::no_property, boost::listS>*, double, double&, boost::vertex_distance_t>, boost::closed_plus, std::less > > >]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:167:5: required from ‘struct boost::CopyConstructible, boost::d_ary_heap_indirect, long unsigned int>, long unsigned int, long unsigned int&>, boost::vec_adj_list_vertex_property_map, boost::property >, boost::no_property, boost::listS>, boost::adjacency_list, boost::property >, boost::no_property, boost::listS>*, double, double&, boost::vertex_distance_t>, std::less, std::vector > >, boost::adj_list_edge_property_map >, boost::edge_weight2_t>, boost::dummy_property_map, boost::vec_adj_list_vertex_property_map, boost::property >, boost::no_property, boost::listS>, boost::adjacency_list, boost::property >, boost::no_property, boost::listS>*, double, double&, boost::vertex_distance_t>, boost::closed_plus, std::less > >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:165:3: required from ‘struct boost::CopyConstructibleConcept, boost::d_ary_heap_indirect, long unsigned int>, long unsigned int, long unsigned int&>, boost::vec_adj_list_vertex_property_map, boost::property >, boost::no_property, boost::listS>, boost::adjacency_list, boost::property >, boost::no_property, boost::listS>*, double, double&, boost::vertex_distance_t>, std::less, std::vector > >, boost::adj_list_edge_property_map >, boost::edge_weight2_t>, boost::dummy_property_map, boost::vec_adj_list_vertex_property_map, boost::property >, boost::no_property, boost::listS>, boost::adjacency_list, boost::property >, boost::no_property, boost::listS>*, double, double&, boost::vertex_distance_t>, boost::closed_plus, std::less > >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::CopyConstructibleConcept, boost::d_ary_heap_indirect, long unsigned int>, long unsigned int, long unsigned int&>, boost::vec_adj_list_vertex_property_map, boost::property >, boost::no_property, boost::listS>, boost::adjacency_list, boost::property >, boost::no_property, boost::listS>*, double, double&, boost::vertex_distance_t>, std::less, std::vector > >, boost::adj_list_edge_property_map >, boost::edge_weight2_t>, boost::dummy_property_map, boost::vec_adj_list_vertex_property_map, boost::property >, boost::no_property, boost::listS>, boost::adjacency_list, boost::property >, boost::no_property, boost::listS>*, double, double&, boost::vertex_distance_t>, boost::closed_plus, std::less > >]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied, boost::d_ary_heap_indirect, long unsigned int>, long unsigned int, long unsigned int&>, boost::vec_adj_list_vertex_property_map, boost::property >, boost::no_property, boost::listS>, boost::adjacency_list, boost::property >, boost::no_property, boost::listS>*, double, double&, boost::vertex_distance_t>, std::less, std::vector > >, boost::adj_list_edge_property_map >, boost::edge_weight2_t>, boost::dummy_property_map, boost::vec_adj_list_vertex_property_map, boost::property >, boost::no_property, boost::listS>, boost::adjacency_list, boost::property >, boost::no_property, boost::listS>*, double, double&, boost::vertex_distance_t>, boost::closed_plus, std::less > > >::value’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:45:51: [ skipping 11 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/dijkstra_shortest_paths.hpp:491:28: required from ‘void boost::dijkstra_shortest_paths(const VertexListGraph&, SourceInputIter, SourceInputIter, PredecessorMap, DistanceMap, WeightMap, IndexMap, Compare, Combine, DistInf, DistZero, DijkstraVisitor) [with VertexListGraph = adjacency_list, property >, no_property, listS>; SourceInputIter = long unsigned int*; DijkstraVisitor = dijkstra_visitor<>; PredecessorMap = dummy_property_map; DistanceMap = vec_adj_list_vertex_property_map, property >, no_property, listS>, adjacency_list, property >, no_property, listS>*, double, double&, vertex_distance_t>; WeightMap = adj_list_edge_property_map >, edge_weight2_t>; IndexMap = vec_adj_list_vertex_id_map, long unsigned int>; Compare = std::less; Combine = closed_plus; DistInf = double; DistZero = double]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/dijkstra_shortest_paths.hpp:505:28: required from ‘void boost::dijkstra_shortest_paths(const VertexListGraph&, typename graph_traits::vertex_descriptor, PredecessorMap, DistanceMap, WeightMap, IndexMap, Compare, Combine, DistInf, DistZero, DijkstraVisitor) [with VertexListGraph = adjacency_list, property >, no_property, listS>; DijkstraVisitor = dijkstra_visitor<>; PredecessorMap = dummy_property_map; DistanceMap = vec_adj_list_vertex_property_map, property >, no_property, listS>, adjacency_list, property >, no_property, listS>*, double, double&, vertex_distance_t>; WeightMap = adj_list_edge_property_map >, edge_weight2_t>; IndexMap = vec_adj_list_vertex_id_map, long unsigned int>; Compare = std::less; Combine = closed_plus; DistInf = double; DistZero = double; typename graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/johnson_all_pairs_shortest.hpp:127:36: required from ‘bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, VertexID, Weight, const BinaryPredicate&, const BinaryFunction&, const Infinity&, DistanceZero) [with VertexAndEdgeListGraph = R_adjacency_list; DistanceMatrix = Basic2DMatrix; VertexID = vec_adj_list_vertex_id_map, long unsigned int>; Weight = adj_list_edge_property_map, edge_weight_t>; BinaryPredicate = std::less; BinaryFunction = closed_plus; Infinity = double; DistanceZero = double]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/johnson_all_pairs_shortest.hpp:164:48: required from ‘bool boost::detail::johnson_dispatch(VertexAndEdgeListGraph&, DistanceMatrix&, const boost::bgl_named_params&, Weight, VertexID) [with VertexAndEdgeListGraph = R_adjacency_list; DistanceMatrix = Basic2DMatrix; P = int; T = int; R = boost::no_property; Weight = boost::adj_list_edge_property_map, boost::edge_weight_t>; VertexID = boost::vec_adj_list_vertex_id_map, long unsigned int>]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/johnson_all_pairs_shortest.hpp:192:36: required from ‘bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&) [with VertexAndEdgeListGraph = R_adjacency_list; DistanceMatrix = Basic2DMatrix]’ sna.cpp:105:41: required from here /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::CopyConstructible::~CopyConstructible() [with TT = boost::detail::dijkstra_bfs_visitor, boost::d_ary_heap_indirect, long unsigned int>, long unsigned int, long unsigned int&>, boost::vec_adj_list_vertex_property_map, boost::property >, boost::no_property, boost::listS>, boost::adjacency_list, boost::property >, boost::no_property, boost::listS>*, double, double&, boost::vertex_distance_t>, std::less, std::vector > >, boost::adj_list_edge_property_map >, boost::edge_weight2_t>, boost::dummy_property_map, boost::vec_adj_list_vertex_property_map, boost::property >, boost::no_property, boost::listS>, boost::adjacency_list, boost::property >, boost::no_property, boost::listS>*, double, double&, boost::vertex_distance_t>, boost::closed_plus, std::less >]’ 37 | ~model() | ^ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:167:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 167 | BOOST_CONCEPT_USAGE(CopyConstructible) { | ^~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements >]’: /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:208:5: required from ‘struct boost::Convertible’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:206:3: required from ‘struct boost::ConvertibleConcept’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::ConvertibleConcept]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied >::value’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:72:8: [ skipping 15 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/dijkstra_shortest_paths.hpp:491:28: required from ‘void boost::dijkstra_shortest_paths(const VertexListGraph&, SourceInputIter, SourceInputIter, PredecessorMap, DistanceMap, WeightMap, IndexMap, Compare, Combine, DistInf, DistZero, DijkstraVisitor) [with VertexListGraph = adjacency_list, property >, no_property, listS>; SourceInputIter = long unsigned int*; DijkstraVisitor = dijkstra_visitor<>; PredecessorMap = dummy_property_map; DistanceMap = vec_adj_list_vertex_property_map, property >, no_property, listS>, adjacency_list, property >, no_property, listS>*, double, double&, vertex_distance_t>; WeightMap = adj_list_edge_property_map >, edge_weight2_t>; IndexMap = vec_adj_list_vertex_id_map, long unsigned int>; Compare = std::less; Combine = closed_plus; DistInf = double; DistZero = double]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/dijkstra_shortest_paths.hpp:505:28: required from ‘void boost::dijkstra_shortest_paths(const VertexListGraph&, typename graph_traits::vertex_descriptor, PredecessorMap, DistanceMap, WeightMap, IndexMap, Compare, Combine, DistInf, DistZero, DijkstraVisitor) [with VertexListGraph = adjacency_list, property >, no_property, listS>; DijkstraVisitor = dijkstra_visitor<>; PredecessorMap = dummy_property_map; DistanceMap = vec_adj_list_vertex_property_map, property >, no_property, listS>, adjacency_list, property >, no_property, listS>*, double, double&, vertex_distance_t>; WeightMap = adj_list_edge_property_map >, edge_weight2_t>; IndexMap = vec_adj_list_vertex_id_map, long unsigned int>; Compare = std::less; Combine = closed_plus; DistInf = double; DistZero = double; typename graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/johnson_all_pairs_shortest.hpp:127:36: required from ‘bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, VertexID, Weight, const BinaryPredicate&, const BinaryFunction&, const Infinity&, DistanceZero) [with VertexAndEdgeListGraph = R_adjacency_list; DistanceMatrix = Basic2DMatrix; VertexID = vec_adj_list_vertex_id_map, long unsigned int>; Weight = adj_list_edge_property_map, edge_weight_t>; BinaryPredicate = std::less; BinaryFunction = closed_plus; Infinity = double; DistanceZero = double]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/johnson_all_pairs_shortest.hpp:164:48: required from ‘bool boost::detail::johnson_dispatch(VertexAndEdgeListGraph&, DistanceMatrix&, const boost::bgl_named_params&, Weight, VertexID) [with VertexAndEdgeListGraph = R_adjacency_list; DistanceMatrix = Basic2DMatrix; P = int; T = int; R = boost::no_property; Weight = boost::adj_list_edge_property_map, boost::edge_weight_t>; VertexID = boost::vec_adj_list_vertex_id_map, long unsigned int>]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/johnson_all_pairs_shortest.hpp:192:36: required from ‘bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&) [with VertexAndEdgeListGraph = R_adjacency_list; DistanceMatrix = Basic2DMatrix]’ sna.cpp:105:41: required from here /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::Convertible]’ 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ^ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::ConvertibleConcept]’: /home/omnipath/local/R/4.4-3.20/BH/include/boost/property_map/property_map.hpp:148:7: required from ‘void boost::ReadablePropertyMapConcept::constraints() [with PMap = boost::two_bit_color_map, long unsigned int> >; Key = long unsigned int]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::ReadablePropertyMapConcept, long unsigned int> >, long unsigned int>]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied, long unsigned int> >, long unsigned int> >::value’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied, long unsigned int> >, long unsigned int> >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_, long unsigned int> >, long unsigned int>)>’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/property_map/property_map.hpp:206:7: [ skipping 9 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/dijkstra_shortest_paths.hpp:491:28: required from ‘void boost::dijkstra_shortest_paths(const VertexListGraph&, SourceInputIter, SourceInputIter, PredecessorMap, DistanceMap, WeightMap, IndexMap, Compare, Combine, DistInf, DistZero, DijkstraVisitor) [with VertexListGraph = adjacency_list, property >, no_property, listS>; SourceInputIter = long unsigned int*; DijkstraVisitor = dijkstra_visitor<>; PredecessorMap = dummy_property_map; DistanceMap = vec_adj_list_vertex_property_map, property >, no_property, listS>, adjacency_list, property >, no_property, listS>*, double, double&, vertex_distance_t>; WeightMap = adj_list_edge_property_map >, edge_weight2_t>; IndexMap = vec_adj_list_vertex_id_map, long unsigned int>; Compare = std::less; Combine = closed_plus; DistInf = double; DistZero = double]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/dijkstra_shortest_paths.hpp:505:28: required from ‘void boost::dijkstra_shortest_paths(const VertexListGraph&, typename graph_traits::vertex_descriptor, PredecessorMap, DistanceMap, WeightMap, IndexMap, Compare, Combine, DistInf, DistZero, DijkstraVisitor) [with VertexListGraph = adjacency_list, property >, no_property, listS>; DijkstraVisitor = dijkstra_visitor<>; PredecessorMap = dummy_property_map; DistanceMap = vec_adj_list_vertex_property_map, property >, no_property, listS>, adjacency_list, property >, no_property, listS>*, double, double&, vertex_distance_t>; WeightMap = adj_list_edge_property_map >, edge_weight2_t>; IndexMap = vec_adj_list_vertex_id_map, long unsigned int>; Compare = std::less; Combine = closed_plus; DistInf = double; DistZero = double; typename graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/johnson_all_pairs_shortest.hpp:127:36: required from ‘bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, VertexID, Weight, const BinaryPredicate&, const BinaryFunction&, const Infinity&, DistanceZero) [with VertexAndEdgeListGraph = R_adjacency_list; DistanceMatrix = Basic2DMatrix; VertexID = vec_adj_list_vertex_id_map, long unsigned int>; Weight = adj_list_edge_property_map, edge_weight_t>; BinaryPredicate = std::less; BinaryFunction = closed_plus; Infinity = double; DistanceZero = double]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/johnson_all_pairs_shortest.hpp:164:48: required from ‘bool boost::detail::johnson_dispatch(VertexAndEdgeListGraph&, DistanceMatrix&, const boost::bgl_named_params&, Weight, VertexID) [with VertexAndEdgeListGraph = R_adjacency_list; DistanceMatrix = Basic2DMatrix; P = int; T = int; R = boost::no_property; Weight = boost::adj_list_edge_property_map, boost::edge_weight_t>; VertexID = boost::vec_adj_list_vertex_id_map, long unsigned int>]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/johnson_all_pairs_shortest.hpp:192:36: required from ‘bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&) [with VertexAndEdgeListGraph = R_adjacency_list; DistanceMatrix = Basic2DMatrix]’ sna.cpp:105:41: required from here /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:206:17: note: in a call to non-static member function ‘boost::ConvertibleConcept::~ConvertibleConcept()’ 206 | BOOST_concept(Convertible,(X)(Y)) | ^~~~~~~~~~~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/preprocessor/cat.hpp:29:34: note: in definition of macro ‘BOOST_PP_CAT_I’ 29 | # define BOOST_PP_CAT_I(a, b) a ## b | ^ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/concept_def.hpp:23:12: note: in expansion of macro ‘BOOST_PP_CAT’ 23 | struct BOOST_PP_CAT(name,Concept) \ | ^~~~~~~~~~~~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:206:3: note: in expansion of macro ‘BOOST_concept’ 206 | BOOST_concept(Convertible,(X)(Y)) | ^~~~~~~~~~~~~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements >]’: /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:208:5: required from ‘struct boost::Convertible’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:206:3: required from ‘struct boost::ConvertibleConcept’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::ConvertibleConcept]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied >::value’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:72:8: [ skipping 15 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/dijkstra_shortest_paths.hpp:491:28: required from ‘void boost::dijkstra_shortest_paths(const VertexListGraph&, SourceInputIter, SourceInputIter, PredecessorMap, DistanceMap, WeightMap, IndexMap, Compare, Combine, DistInf, DistZero, DijkstraVisitor) [with VertexListGraph = adjacency_list, property >, no_property, listS>; SourceInputIter = long unsigned int*; DijkstraVisitor = dijkstra_visitor<>; PredecessorMap = dummy_property_map; DistanceMap = vec_adj_list_vertex_property_map, property >, no_property, listS>, adjacency_list, property >, no_property, listS>*, double, double&, vertex_distance_t>; WeightMap = adj_list_edge_property_map >, edge_weight2_t>; IndexMap = vec_adj_list_vertex_id_map, long unsigned int>; Compare = std::less; Combine = closed_plus; DistInf = double; DistZero = double]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/dijkstra_shortest_paths.hpp:505:28: required from ‘void boost::dijkstra_shortest_paths(const VertexListGraph&, typename graph_traits::vertex_descriptor, PredecessorMap, DistanceMap, WeightMap, IndexMap, Compare, Combine, DistInf, DistZero, DijkstraVisitor) [with VertexListGraph = adjacency_list, property >, no_property, listS>; DijkstraVisitor = dijkstra_visitor<>; PredecessorMap = dummy_property_map; DistanceMap = vec_adj_list_vertex_property_map, property >, no_property, listS>, adjacency_list, property >, no_property, listS>*, double, double&, vertex_distance_t>; WeightMap = adj_list_edge_property_map >, edge_weight2_t>; IndexMap = vec_adj_list_vertex_id_map, long unsigned int>; Compare = std::less; Combine = closed_plus; DistInf = double; DistZero = double; typename graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/johnson_all_pairs_shortest.hpp:127:36: required from ‘bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, VertexID, Weight, const BinaryPredicate&, const BinaryFunction&, const Infinity&, DistanceZero) [with VertexAndEdgeListGraph = R_adjacency_list; DistanceMatrix = Basic2DMatrix; VertexID = vec_adj_list_vertex_id_map, long unsigned int>; Weight = adj_list_edge_property_map, edge_weight_t>; BinaryPredicate = std::less; BinaryFunction = closed_plus; Infinity = double; DistanceZero = double]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/johnson_all_pairs_shortest.hpp:164:48: required from ‘bool boost::detail::johnson_dispatch(VertexAndEdgeListGraph&, DistanceMatrix&, const boost::bgl_named_params&, Weight, VertexID) [with VertexAndEdgeListGraph = R_adjacency_list; DistanceMatrix = Basic2DMatrix; P = int; T = int; R = boost::no_property; Weight = boost::adj_list_edge_property_map, boost::edge_weight_t>; VertexID = boost::vec_adj_list_vertex_id_map, long unsigned int>]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/johnson_all_pairs_shortest.hpp:192:36: required from ‘bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&) [with VertexAndEdgeListGraph = R_adjacency_list; DistanceMatrix = Basic2DMatrix]’ sna.cpp:105:41: required from here /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::Convertible]’ 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ^ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::ConvertibleConcept]’: /home/omnipath/local/R/4.4-3.20/BH/include/boost/property_map/property_map.hpp:180:7: required from ‘void boost::WritablePropertyMapConcept::constraints() [with PMap = boost::two_bit_color_map, long unsigned int> >; Key = long unsigned int]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::WritablePropertyMapConcept, long unsigned int> >, long unsigned int>]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied, long unsigned int> >, long unsigned int> >::value’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied, long unsigned int> >, long unsigned int> >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_, long unsigned int> >, long unsigned int>)>’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/property_map/property_map.hpp:207:7: [ skipping 9 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/dijkstra_shortest_paths.hpp:491:28: required from ‘void boost::dijkstra_shortest_paths(const VertexListGraph&, SourceInputIter, SourceInputIter, PredecessorMap, DistanceMap, WeightMap, IndexMap, Compare, Combine, DistInf, DistZero, DijkstraVisitor) [with VertexListGraph = adjacency_list, property >, no_property, listS>; SourceInputIter = long unsigned int*; DijkstraVisitor = dijkstra_visitor<>; PredecessorMap = dummy_property_map; DistanceMap = vec_adj_list_vertex_property_map, property >, no_property, listS>, adjacency_list, property >, no_property, listS>*, double, double&, vertex_distance_t>; WeightMap = adj_list_edge_property_map >, edge_weight2_t>; IndexMap = vec_adj_list_vertex_id_map, long unsigned int>; Compare = std::less; Combine = closed_plus; DistInf = double; DistZero = double]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/dijkstra_shortest_paths.hpp:505:28: required from ‘void boost::dijkstra_shortest_paths(const VertexListGraph&, typename graph_traits::vertex_descriptor, PredecessorMap, DistanceMap, WeightMap, IndexMap, Compare, Combine, DistInf, DistZero, DijkstraVisitor) [with VertexListGraph = adjacency_list, property >, no_property, listS>; DijkstraVisitor = dijkstra_visitor<>; PredecessorMap = dummy_property_map; DistanceMap = vec_adj_list_vertex_property_map, property >, no_property, listS>, adjacency_list, property >, no_property, listS>*, double, double&, vertex_distance_t>; WeightMap = adj_list_edge_property_map >, edge_weight2_t>; IndexMap = vec_adj_list_vertex_id_map, long unsigned int>; Compare = std::less; Combine = closed_plus; DistInf = double; DistZero = double; typename graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/johnson_all_pairs_shortest.hpp:127:36: required from ‘bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, VertexID, Weight, const BinaryPredicate&, const BinaryFunction&, const Infinity&, DistanceZero) [with VertexAndEdgeListGraph = R_adjacency_list; DistanceMatrix = Basic2DMatrix; VertexID = vec_adj_list_vertex_id_map, long unsigned int>; Weight = adj_list_edge_property_map, edge_weight_t>; BinaryPredicate = std::less; BinaryFunction = closed_plus; Infinity = double; DistanceZero = double]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/johnson_all_pairs_shortest.hpp:164:48: required from ‘bool boost::detail::johnson_dispatch(VertexAndEdgeListGraph&, DistanceMatrix&, const boost::bgl_named_params&, Weight, VertexID) [with VertexAndEdgeListGraph = R_adjacency_list; DistanceMatrix = Basic2DMatrix; P = int; T = int; R = boost::no_property; Weight = boost::adj_list_edge_property_map, boost::edge_weight_t>; VertexID = boost::vec_adj_list_vertex_id_map, long unsigned int>]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/johnson_all_pairs_shortest.hpp:192:36: required from ‘bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&) [with VertexAndEdgeListGraph = R_adjacency_list; DistanceMatrix = Basic2DMatrix]’ sna.cpp:105:41: required from here /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:206:17: note: in a call to non-static member function ‘boost::ConvertibleConcept::~ConvertibleConcept()’ 206 | BOOST_concept(Convertible,(X)(Y)) | ^~~~~~~~~~~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/preprocessor/cat.hpp:29:34: note: in definition of macro ‘BOOST_PP_CAT_I’ 29 | # define BOOST_PP_CAT_I(a, b) a ## b | ^ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/concept_def.hpp:23:12: note: in expansion of macro ‘BOOST_PP_CAT’ 23 | struct BOOST_PP_CAT(name,Concept) \ | ^~~~~~~~~~~~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:206:3: note: in expansion of macro ‘BOOST_concept’ 206 | BOOST_concept(Convertible,(X)(Y)) | ^~~~~~~~~~~~~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::Convertible]’: /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements >]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:208:5: required from ‘struct boost::Convertible’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:206:3: required from ‘struct boost::ConvertibleConcept’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::ConvertibleConcept]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied >::value’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:45:51: [ skipping 11 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/dijkstra_shortest_paths.hpp:491:28: required from ‘void boost::dijkstra_shortest_paths(const VertexListGraph&, SourceInputIter, SourceInputIter, PredecessorMap, DistanceMap, WeightMap, IndexMap, Compare, Combine, DistInf, DistZero, DijkstraVisitor) [with VertexListGraph = adjacency_list, property >, no_property, listS>; SourceInputIter = long unsigned int*; DijkstraVisitor = dijkstra_visitor<>; PredecessorMap = dummy_property_map; DistanceMap = vec_adj_list_vertex_property_map, property >, no_property, listS>, adjacency_list, property >, no_property, listS>*, double, double&, vertex_distance_t>; WeightMap = adj_list_edge_property_map >, edge_weight2_t>; IndexMap = vec_adj_list_vertex_id_map, long unsigned int>; Compare = std::less; Combine = closed_plus; DistInf = double; DistZero = double]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/dijkstra_shortest_paths.hpp:505:28: required from ‘void boost::dijkstra_shortest_paths(const VertexListGraph&, typename graph_traits::vertex_descriptor, PredecessorMap, DistanceMap, WeightMap, IndexMap, Compare, Combine, DistInf, DistZero, DijkstraVisitor) [with VertexListGraph = adjacency_list, property >, no_property, listS>; DijkstraVisitor = dijkstra_visitor<>; PredecessorMap = dummy_property_map; DistanceMap = vec_adj_list_vertex_property_map, property >, no_property, listS>, adjacency_list, property >, no_property, listS>*, double, double&, vertex_distance_t>; WeightMap = adj_list_edge_property_map >, edge_weight2_t>; IndexMap = vec_adj_list_vertex_id_map, long unsigned int>; Compare = std::less; Combine = closed_plus; DistInf = double; DistZero = double; typename graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/johnson_all_pairs_shortest.hpp:127:36: required from ‘bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, VertexID, Weight, const BinaryPredicate&, const BinaryFunction&, const Infinity&, DistanceZero) [with VertexAndEdgeListGraph = R_adjacency_list; DistanceMatrix = Basic2DMatrix; VertexID = vec_adj_list_vertex_id_map, long unsigned int>; Weight = adj_list_edge_property_map, edge_weight_t>; BinaryPredicate = std::less; BinaryFunction = closed_plus; Infinity = double; DistanceZero = double]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/johnson_all_pairs_shortest.hpp:164:48: required from ‘bool boost::detail::johnson_dispatch(VertexAndEdgeListGraph&, DistanceMatrix&, const boost::bgl_named_params&, Weight, VertexID) [with VertexAndEdgeListGraph = R_adjacency_list; DistanceMatrix = Basic2DMatrix; P = int; T = int; R = boost::no_property; Weight = boost::adj_list_edge_property_map, boost::edge_weight_t>; VertexID = boost::vec_adj_list_vertex_id_map, long unsigned int>]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/johnson_all_pairs_shortest.hpp:192:36: required from ‘bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&) [with VertexAndEdgeListGraph = R_adjacency_list; DistanceMatrix = Basic2DMatrix]’ sna.cpp:105:41: required from here /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::Convertible::~Convertible() [with X = boost::read_write_property_map_tag; Y = boost::read_write_property_map_tag]’ 37 | ~model() | ^ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:208:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 208 | BOOST_CONCEPT_USAGE(Convertible) { | ^~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::concepts::MultiPassInputIterator > > >, boost::edge_residual_capacity_t> >, boost::keep_all, boost::filtered_graph > > > >, boost::is_residual_edge > > >, boost::edge_residual_capacity_t> >, boost::keep_all> >, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > > > >*, std::vector > > > >, std::allocator > > > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >]’: /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements > > >, boost::edge_residual_capacity_t> >, boost::keep_all, boost::filtered_graph > > > >, boost::is_residual_edge > > >, boost::edge_residual_capacity_t> >, boost::keep_all> >, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > > > >*, std::vector > > > >, std::allocator > > > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > > >]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/graph_concepts.hpp:52:50: required from ‘struct boost::concepts::MultiPassInputIterator > > >, boost::edge_residual_capacity_t> >, boost::keep_all, boost::filtered_graph > > > >, boost::is_residual_edge > > >, boost::edge_residual_capacity_t> >, boost::keep_all> >, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > > > >*, std::vector > > > >, std::allocator > > > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::concepts::MultiPassInputIterator > > >, boost::edge_residual_capacity_t> >, boost::keep_all, boost::filtered_graph > > > >, boost::is_residual_edge > > >, boost::edge_residual_capacity_t> >, boost::keep_all> >, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > > > >*, std::vector > > > >, std::allocator > > > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied > > >, boost::edge_residual_capacity_t> >, boost::keep_all, boost::filtered_graph > > > >, boost::is_residual_edge > > >, boost::edge_residual_capacity_t> >, boost::keep_all> >, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > > > >*, std::vector > > > >, std::allocator > > > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > > >::value’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied > > >, boost::edge_residual_capacity_t> >, boost::keep_all, boost::filtered_graph > > > >, boost::is_residual_edge > > >, boost::edge_residual_capacity_t> >, boost::keep_all> >, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > > > >*, std::vector > > > >, std::allocator > > > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > > >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:72:8: [ skipping 6 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/edmonds_karp_max_flow.hpp:101:29: required from ‘typename boost::property_traits::value_type boost::edmonds_karp_max_flow(Graph&, typename graph_traits::vertex_descriptor, typename graph_traits::vertex_descriptor, CapacityEdgeMap, ResidualCapacityEdgeMap, ReverseEdgeMap, ColorMap, PredEdgeMap) [with Graph = adjacency_list > > > >; CapacityEdgeMap = adj_list_edge_property_map > > >, edge_capacity_t>; ResidualCapacityEdgeMap = adj_list_edge_property_map > > >, edge_residual_capacity_t>; ReverseEdgeMap = adj_list_edge_property_map, const detail::edge_desc_impl&, long unsigned int, const property > > >, edge_reverse_t>; ColorMap = iterator_property_map<__gnu_cxx::__normal_iterator >, vec_adj_list_vertex_id_map, default_color_type, default_color_type&>; PredEdgeMap = iterator_property_map<__gnu_cxx::__normal_iterator*, std::vector, std::allocator > > >, vec_adj_list_vertex_id_map, detail::edge_desc_impl, detail::edge_desc_impl&>; typename property_traits::value_type = double; typename graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/edmonds_karp_max_flow.hpp:154:41: required from ‘static typename boost::detail::edge_capacity_value::type boost::detail::edmonds_karp_dispatch2::apply(Graph&, typename boost::graph_traits::vertex_descriptor, typename boost::graph_traits::vertex_descriptor, PredMap, const boost::bgl_named_params&, boost::param_not_found) [with Graph = boost::adjacency_list > > > >; PredMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator*, std::vector, std::allocator > > >, boost::vec_adj_list_vertex_id_map, boost::detail::edge_desc_impl, boost::detail::edge_desc_impl&>; P = int; T = boost::buffer_param_t; R = boost::no_property; typename boost::detail::edge_capacity_value::type = double; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/edmonds_karp_max_flow.hpp:208:54: required from ‘static typename boost::detail::edge_capacity_value::type boost::detail::edmonds_karp_dispatch1::apply(Graph&, typename boost::graph_traits::vertex_descriptor, typename boost::graph_traits::vertex_descriptor, const boost::bgl_named_params&, boost::param_not_found) [with Graph = boost::adjacency_list > > > >; P = int; T = boost::buffer_param_t; R = boost::no_property; typename boost::detail::edge_capacity_value::type = double; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/edmonds_karp_max_flow.hpp:228:57: required from ‘typename boost::detail::edge_capacity_value::type boost::edmonds_karp_max_flow(Graph&, typename graph_traits::vertex_descriptor, typename graph_traits::vertex_descriptor, const bgl_named_params&) [with Graph = adjacency_list > > > >; P = int; T = buffer_param_t; R = no_property; typename detail::edge_capacity_value::type = double; typename graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/edmonds_karp_max_flow.hpp:240:33: required from ‘typename boost::property_traits::const_type>::value_type boost::edmonds_karp_max_flow(Graph&, typename graph_traits::vertex_descriptor, typename graph_traits::vertex_descriptor) [with Graph = adjacency_list > > > >; typename property_traits::const_type>::value_type = double; typename property_map::const_type = adj_list_edge_property_map > > >, edge_capacity_t>; typename graph_traits::vertex_descriptor = long unsigned int]’ sna.cpp:204:54: required from here /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::concepts::MultiPassInputIterator::~MultiPassInputIterator() [with T = boost::iterators::filter_iterator > > >, boost::edge_residual_capacity_t> >, boost::keep_all, boost::filtered_graph > > > >, boost::is_residual_edge > > >, boost::edge_residual_capacity_t> >, boost::keep_all> >, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > > > >*, std::vector > > > >, std::allocator > > > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> >]’ 37 | ~model() | ^ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/graph_concepts.hpp:52:50: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 52 | BOOST_concept(MultiPassInputIterator, (T)) { BOOST_CONCEPT_USAGE( | ^~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::Convertible]’: /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements >]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:208:5: required from ‘struct boost::Convertible’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::Convertible]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied >::value’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:72:8: [ skipping 6 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/edmonds_karp_max_flow.hpp:101:29: required from ‘typename boost::property_traits::value_type boost::edmonds_karp_max_flow(Graph&, typename graph_traits::vertex_descriptor, typename graph_traits::vertex_descriptor, CapacityEdgeMap, ResidualCapacityEdgeMap, ReverseEdgeMap, ColorMap, PredEdgeMap) [with Graph = adjacency_list > > > >; CapacityEdgeMap = adj_list_edge_property_map > > >, edge_capacity_t>; ResidualCapacityEdgeMap = adj_list_edge_property_map > > >, edge_residual_capacity_t>; ReverseEdgeMap = adj_list_edge_property_map, const detail::edge_desc_impl&, long unsigned int, const property > > >, edge_reverse_t>; ColorMap = iterator_property_map<__gnu_cxx::__normal_iterator >, vec_adj_list_vertex_id_map, default_color_type, default_color_type&>; PredEdgeMap = iterator_property_map<__gnu_cxx::__normal_iterator*, std::vector, std::allocator > > >, vec_adj_list_vertex_id_map, detail::edge_desc_impl, detail::edge_desc_impl&>; typename property_traits::value_type = double; typename graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/edmonds_karp_max_flow.hpp:154:41: required from ‘static typename boost::detail::edge_capacity_value::type boost::detail::edmonds_karp_dispatch2::apply(Graph&, typename boost::graph_traits::vertex_descriptor, typename boost::graph_traits::vertex_descriptor, PredMap, const boost::bgl_named_params&, boost::param_not_found) [with Graph = boost::adjacency_list > > > >; PredMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator*, std::vector, std::allocator > > >, boost::vec_adj_list_vertex_id_map, boost::detail::edge_desc_impl, boost::detail::edge_desc_impl&>; P = int; T = boost::buffer_param_t; R = boost::no_property; typename boost::detail::edge_capacity_value::type = double; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/edmonds_karp_max_flow.hpp:208:54: required from ‘static typename boost::detail::edge_capacity_value::type boost::detail::edmonds_karp_dispatch1::apply(Graph&, typename boost::graph_traits::vertex_descriptor, typename boost::graph_traits::vertex_descriptor, const boost::bgl_named_params&, boost::param_not_found) [with Graph = boost::adjacency_list > > > >; P = int; T = boost::buffer_param_t; R = boost::no_property; typename boost::detail::edge_capacity_value::type = double; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/edmonds_karp_max_flow.hpp:228:57: required from ‘typename boost::detail::edge_capacity_value::type boost::edmonds_karp_max_flow(Graph&, typename graph_traits::vertex_descriptor, typename graph_traits::vertex_descriptor, const bgl_named_params&) [with Graph = adjacency_list > > > >; P = int; T = buffer_param_t; R = no_property; typename detail::edge_capacity_value::type = double; typename graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/edmonds_karp_max_flow.hpp:240:33: required from ‘typename boost::property_traits::const_type>::value_type boost::edmonds_karp_max_flow(Graph&, typename graph_traits::vertex_descriptor, typename graph_traits::vertex_descriptor) [with Graph = adjacency_list > > > >; typename property_traits::const_type>::value_type = double; typename property_map::const_type = adj_list_edge_property_map > > >, edge_capacity_t>; typename graph_traits::vertex_descriptor = long unsigned int]’ sna.cpp:204:54: required from here /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::Convertible::~Convertible() [with X = boost::adj_list_dir_traversal_tag; Y = boost::incidence_graph_tag]’ 37 | ~model() | ^ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:208:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 208 | BOOST_CONCEPT_USAGE(Convertible) { | ^~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::Assignable]’: /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements >]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:145:5: required from ‘struct boost::Assignable’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:502:3: required from ‘struct boost::InputIterator’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:540:3: required from ‘struct boost::ForwardIterator’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:568:3: required from ‘struct boost::BidirectionalIterator’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:597:3: [ skipping 12 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/dijkstra_shortest_paths.hpp:491:28: required from ‘void boost::dijkstra_shortest_paths(const VertexListGraph&, SourceInputIter, SourceInputIter, PredecessorMap, DistanceMap, WeightMap, IndexMap, Compare, Combine, DistInf, DistZero, DijkstraVisitor) [with VertexListGraph = adjacency_list, property >, no_property, listS>; SourceInputIter = long unsigned int*; DijkstraVisitor = dijkstra_visitor<>; PredecessorMap = dummy_property_map; DistanceMap = vec_adj_list_vertex_property_map, property >, no_property, listS>, adjacency_list, property >, no_property, listS>*, double, double&, vertex_distance_t>; WeightMap = adj_list_edge_property_map >, edge_weight2_t>; IndexMap = vec_adj_list_vertex_id_map, long unsigned int>; Compare = std::less; Combine = closed_plus; DistInf = double; DistZero = double]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/dijkstra_shortest_paths.hpp:505:28: required from ‘void boost::dijkstra_shortest_paths(const VertexListGraph&, typename graph_traits::vertex_descriptor, PredecessorMap, DistanceMap, WeightMap, IndexMap, Compare, Combine, DistInf, DistZero, DijkstraVisitor) [with VertexListGraph = adjacency_list, property >, no_property, listS>; DijkstraVisitor = dijkstra_visitor<>; PredecessorMap = dummy_property_map; DistanceMap = vec_adj_list_vertex_property_map, property >, no_property, listS>, adjacency_list, property >, no_property, listS>*, double, double&, vertex_distance_t>; WeightMap = adj_list_edge_property_map >, edge_weight2_t>; IndexMap = vec_adj_list_vertex_id_map, long unsigned int>; Compare = std::less; Combine = closed_plus; DistInf = double; DistZero = double; typename graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/johnson_all_pairs_shortest.hpp:127:36: required from ‘bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, VertexID, Weight, const BinaryPredicate&, const BinaryFunction&, const Infinity&, DistanceZero) [with VertexAndEdgeListGraph = R_adjacency_list; DistanceMatrix = Basic2DMatrix; VertexID = vec_adj_list_vertex_id_map, long unsigned int>; Weight = adj_list_edge_property_map, edge_weight_t>; BinaryPredicate = std::less; BinaryFunction = closed_plus; Infinity = double; DistanceZero = double]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/johnson_all_pairs_shortest.hpp:164:48: required from ‘bool boost::detail::johnson_dispatch(VertexAndEdgeListGraph&, DistanceMatrix&, const boost::bgl_named_params&, Weight, VertexID) [with VertexAndEdgeListGraph = R_adjacency_list; DistanceMatrix = Basic2DMatrix; P = int; T = int; R = boost::no_property; Weight = boost::adj_list_edge_property_map, boost::edge_weight_t>; VertexID = boost::vec_adj_list_vertex_id_map, long unsigned int>]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/johnson_all_pairs_shortest.hpp:192:36: required from ‘bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&) [with VertexAndEdgeListGraph = R_adjacency_list; DistanceMatrix = Basic2DMatrix]’ sna.cpp:105:41: required from here /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::Assignable::~Assignable() [with TT = long unsigned int*]’ 37 | ~model() | ^ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:145:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 145 | BOOST_CONCEPT_USAGE(Assignable) { | ^~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::EqualityComparable]’: /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements >]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:233:5: required from ‘struct boost::EqualityComparable’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:502:3: required from ‘struct boost::InputIterator’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:540:3: required from ‘struct boost::ForwardIterator’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:568:3: required from ‘struct boost::BidirectionalIterator’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:597:3: [ skipping 12 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/dijkstra_shortest_paths.hpp:491:28: required from ‘void boost::dijkstra_shortest_paths(const VertexListGraph&, SourceInputIter, SourceInputIter, PredecessorMap, DistanceMap, WeightMap, IndexMap, Compare, Combine, DistInf, DistZero, DijkstraVisitor) [with VertexListGraph = adjacency_list, property >, no_property, listS>; SourceInputIter = long unsigned int*; DijkstraVisitor = dijkstra_visitor<>; PredecessorMap = dummy_property_map; DistanceMap = vec_adj_list_vertex_property_map, property >, no_property, listS>, adjacency_list, property >, no_property, listS>*, double, double&, vertex_distance_t>; WeightMap = adj_list_edge_property_map >, edge_weight2_t>; IndexMap = vec_adj_list_vertex_id_map, long unsigned int>; Compare = std::less; Combine = closed_plus; DistInf = double; DistZero = double]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/dijkstra_shortest_paths.hpp:505:28: required from ‘void boost::dijkstra_shortest_paths(const VertexListGraph&, typename graph_traits::vertex_descriptor, PredecessorMap, DistanceMap, WeightMap, IndexMap, Compare, Combine, DistInf, DistZero, DijkstraVisitor) [with VertexListGraph = adjacency_list, property >, no_property, listS>; DijkstraVisitor = dijkstra_visitor<>; PredecessorMap = dummy_property_map; DistanceMap = vec_adj_list_vertex_property_map, property >, no_property, listS>, adjacency_list, property >, no_property, listS>*, double, double&, vertex_distance_t>; WeightMap = adj_list_edge_property_map >, edge_weight2_t>; IndexMap = vec_adj_list_vertex_id_map, long unsigned int>; Compare = std::less; Combine = closed_plus; DistInf = double; DistZero = double; typename graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/johnson_all_pairs_shortest.hpp:127:36: required from ‘bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, VertexID, Weight, const BinaryPredicate&, const BinaryFunction&, const Infinity&, DistanceZero) [with VertexAndEdgeListGraph = R_adjacency_list; DistanceMatrix = Basic2DMatrix; VertexID = vec_adj_list_vertex_id_map, long unsigned int>; Weight = adj_list_edge_property_map, edge_weight_t>; BinaryPredicate = std::less; BinaryFunction = closed_plus; Infinity = double; DistanceZero = double]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/johnson_all_pairs_shortest.hpp:164:48: required from ‘bool boost::detail::johnson_dispatch(VertexAndEdgeListGraph&, DistanceMatrix&, const boost::bgl_named_params&, Weight, VertexID) [with VertexAndEdgeListGraph = R_adjacency_list; DistanceMatrix = Basic2DMatrix; P = int; T = int; R = boost::no_property; Weight = boost::adj_list_edge_property_map, boost::edge_weight_t>; VertexID = boost::vec_adj_list_vertex_id_map, long unsigned int>]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/johnson_all_pairs_shortest.hpp:192:36: required from ‘bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&) [with VertexAndEdgeListGraph = R_adjacency_list; DistanceMatrix = Basic2DMatrix]’ sna.cpp:105:41: required from here /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::EqualityComparable::~EqualityComparable() [with TT = long unsigned int*]’ 37 | ~model() | ^ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:233:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 233 | BOOST_CONCEPT_USAGE(EqualityComparable) { | ^~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::InputIterator]’: /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements >]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:512:7: required from ‘struct boost::InputIterator’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:540:3: required from ‘struct boost::ForwardIterator’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:568:3: required from ‘struct boost::BidirectionalIterator’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:597:3: required from ‘struct boost::RandomAccessIterator’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:597:3: [ skipping 11 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/dijkstra_shortest_paths.hpp:491:28: required from ‘void boost::dijkstra_shortest_paths(const VertexListGraph&, SourceInputIter, SourceInputIter, PredecessorMap, DistanceMap, WeightMap, IndexMap, Compare, Combine, DistInf, DistZero, DijkstraVisitor) [with VertexListGraph = adjacency_list, property >, no_property, listS>; SourceInputIter = long unsigned int*; DijkstraVisitor = dijkstra_visitor<>; PredecessorMap = dummy_property_map; DistanceMap = vec_adj_list_vertex_property_map, property >, no_property, listS>, adjacency_list, property >, no_property, listS>*, double, double&, vertex_distance_t>; WeightMap = adj_list_edge_property_map >, edge_weight2_t>; IndexMap = vec_adj_list_vertex_id_map, long unsigned int>; Compare = std::less; Combine = closed_plus; DistInf = double; DistZero = double]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/dijkstra_shortest_paths.hpp:505:28: required from ‘void boost::dijkstra_shortest_paths(const VertexListGraph&, typename graph_traits::vertex_descriptor, PredecessorMap, DistanceMap, WeightMap, IndexMap, Compare, Combine, DistInf, DistZero, DijkstraVisitor) [with VertexListGraph = adjacency_list, property >, no_property, listS>; DijkstraVisitor = dijkstra_visitor<>; PredecessorMap = dummy_property_map; DistanceMap = vec_adj_list_vertex_property_map, property >, no_property, listS>, adjacency_list, property >, no_property, listS>*, double, double&, vertex_distance_t>; WeightMap = adj_list_edge_property_map >, edge_weight2_t>; IndexMap = vec_adj_list_vertex_id_map, long unsigned int>; Compare = std::less; Combine = closed_plus; DistInf = double; DistZero = double; typename graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/johnson_all_pairs_shortest.hpp:127:36: required from ‘bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, VertexID, Weight, const BinaryPredicate&, const BinaryFunction&, const Infinity&, DistanceZero) [with VertexAndEdgeListGraph = R_adjacency_list; DistanceMatrix = Basic2DMatrix; VertexID = vec_adj_list_vertex_id_map, long unsigned int>; Weight = adj_list_edge_property_map, edge_weight_t>; BinaryPredicate = std::less; BinaryFunction = closed_plus; Infinity = double; DistanceZero = double]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/johnson_all_pairs_shortest.hpp:164:48: required from ‘bool boost::detail::johnson_dispatch(VertexAndEdgeListGraph&, DistanceMatrix&, const boost::bgl_named_params&, Weight, VertexID) [with VertexAndEdgeListGraph = R_adjacency_list; DistanceMatrix = Basic2DMatrix; P = int; T = int; R = boost::no_property; Weight = boost::adj_list_edge_property_map, boost::edge_weight_t>; VertexID = boost::vec_adj_list_vertex_id_map, long unsigned int>]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/johnson_all_pairs_shortest.hpp:192:36: required from ‘bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&) [with VertexAndEdgeListGraph = R_adjacency_list; DistanceMatrix = Basic2DMatrix]’ sna.cpp:105:41: required from here /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::InputIterator::~InputIterator() [with TT = long unsigned int*]’ 37 | ~model() | ^ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:512:7: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 512 | BOOST_CONCEPT_USAGE(InputIterator) | ^~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::ForwardIterator]’: /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements >]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:543:7: required from ‘struct boost::ForwardIterator’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:568:3: required from ‘struct boost::BidirectionalIterator’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:597:3: required from ‘struct boost::RandomAccessIterator’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:597:3: required from ‘struct boost::RandomAccessIteratorConcept’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:32:62: [ skipping 10 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/dijkstra_shortest_paths.hpp:491:28: required from ‘void boost::dijkstra_shortest_paths(const VertexListGraph&, SourceInputIter, SourceInputIter, PredecessorMap, DistanceMap, WeightMap, IndexMap, Compare, Combine, DistInf, DistZero, DijkstraVisitor) [with VertexListGraph = adjacency_list, property >, no_property, listS>; SourceInputIter = long unsigned int*; DijkstraVisitor = dijkstra_visitor<>; PredecessorMap = dummy_property_map; DistanceMap = vec_adj_list_vertex_property_map, property >, no_property, listS>, adjacency_list, property >, no_property, listS>*, double, double&, vertex_distance_t>; WeightMap = adj_list_edge_property_map >, edge_weight2_t>; IndexMap = vec_adj_list_vertex_id_map, long unsigned int>; Compare = std::less; Combine = closed_plus; DistInf = double; DistZero = double]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/dijkstra_shortest_paths.hpp:505:28: required from ‘void boost::dijkstra_shortest_paths(const VertexListGraph&, typename graph_traits::vertex_descriptor, PredecessorMap, DistanceMap, WeightMap, IndexMap, Compare, Combine, DistInf, DistZero, DijkstraVisitor) [with VertexListGraph = adjacency_list, property >, no_property, listS>; DijkstraVisitor = dijkstra_visitor<>; PredecessorMap = dummy_property_map; DistanceMap = vec_adj_list_vertex_property_map, property >, no_property, listS>, adjacency_list, property >, no_property, listS>*, double, double&, vertex_distance_t>; WeightMap = adj_list_edge_property_map >, edge_weight2_t>; IndexMap = vec_adj_list_vertex_id_map, long unsigned int>; Compare = std::less; Combine = closed_plus; DistInf = double; DistZero = double; typename graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/johnson_all_pairs_shortest.hpp:127:36: required from ‘bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, VertexID, Weight, const BinaryPredicate&, const BinaryFunction&, const Infinity&, DistanceZero) [with VertexAndEdgeListGraph = R_adjacency_list; DistanceMatrix = Basic2DMatrix; VertexID = vec_adj_list_vertex_id_map, long unsigned int>; Weight = adj_list_edge_property_map, edge_weight_t>; BinaryPredicate = std::less; BinaryFunction = closed_plus; Infinity = double; DistanceZero = double]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/johnson_all_pairs_shortest.hpp:164:48: required from ‘bool boost::detail::johnson_dispatch(VertexAndEdgeListGraph&, DistanceMatrix&, const boost::bgl_named_params&, Weight, VertexID) [with VertexAndEdgeListGraph = R_adjacency_list; DistanceMatrix = Basic2DMatrix; P = int; T = int; R = boost::no_property; Weight = boost::adj_list_edge_property_map, boost::edge_weight_t>; VertexID = boost::vec_adj_list_vertex_id_map, long unsigned int>]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/johnson_all_pairs_shortest.hpp:192:36: required from ‘bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&) [with VertexAndEdgeListGraph = R_adjacency_list; DistanceMatrix = Basic2DMatrix]’ sna.cpp:105:41: required from here /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::ForwardIterator::~ForwardIterator() [with TT = long unsigned int*]’ 37 | ~model() | ^ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:543:7: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 543 | BOOST_CONCEPT_USAGE(ForwardIterator) | ^~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::BidirectionalIterator]’: /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements >]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:571:7: required from ‘struct boost::BidirectionalIterator’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:597:3: required from ‘struct boost::RandomAccessIterator’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:597:3: required from ‘struct boost::RandomAccessIteratorConcept’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::RandomAccessIteratorConcept]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:42:5: [ skipping 9 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/dijkstra_shortest_paths.hpp:491:28: required from ‘void boost::dijkstra_shortest_paths(const VertexListGraph&, SourceInputIter, SourceInputIter, PredecessorMap, DistanceMap, WeightMap, IndexMap, Compare, Combine, DistInf, DistZero, DijkstraVisitor) [with VertexListGraph = adjacency_list, property >, no_property, listS>; SourceInputIter = long unsigned int*; DijkstraVisitor = dijkstra_visitor<>; PredecessorMap = dummy_property_map; DistanceMap = vec_adj_list_vertex_property_map, property >, no_property, listS>, adjacency_list, property >, no_property, listS>*, double, double&, vertex_distance_t>; WeightMap = adj_list_edge_property_map >, edge_weight2_t>; IndexMap = vec_adj_list_vertex_id_map, long unsigned int>; Compare = std::less; Combine = closed_plus; DistInf = double; DistZero = double]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/dijkstra_shortest_paths.hpp:505:28: required from ‘void boost::dijkstra_shortest_paths(const VertexListGraph&, typename graph_traits::vertex_descriptor, PredecessorMap, DistanceMap, WeightMap, IndexMap, Compare, Combine, DistInf, DistZero, DijkstraVisitor) [with VertexListGraph = adjacency_list, property >, no_property, listS>; DijkstraVisitor = dijkstra_visitor<>; PredecessorMap = dummy_property_map; DistanceMap = vec_adj_list_vertex_property_map, property >, no_property, listS>, adjacency_list, property >, no_property, listS>*, double, double&, vertex_distance_t>; WeightMap = adj_list_edge_property_map >, edge_weight2_t>; IndexMap = vec_adj_list_vertex_id_map, long unsigned int>; Compare = std::less; Combine = closed_plus; DistInf = double; DistZero = double; typename graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/johnson_all_pairs_shortest.hpp:127:36: required from ‘bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, VertexID, Weight, const BinaryPredicate&, const BinaryFunction&, const Infinity&, DistanceZero) [with VertexAndEdgeListGraph = R_adjacency_list; DistanceMatrix = Basic2DMatrix; VertexID = vec_adj_list_vertex_id_map, long unsigned int>; Weight = adj_list_edge_property_map, edge_weight_t>; BinaryPredicate = std::less; BinaryFunction = closed_plus; Infinity = double; DistanceZero = double]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/johnson_all_pairs_shortest.hpp:164:48: required from ‘bool boost::detail::johnson_dispatch(VertexAndEdgeListGraph&, DistanceMatrix&, const boost::bgl_named_params&, Weight, VertexID) [with VertexAndEdgeListGraph = R_adjacency_list; DistanceMatrix = Basic2DMatrix; P = int; T = int; R = boost::no_property; Weight = boost::adj_list_edge_property_map, boost::edge_weight_t>; VertexID = boost::vec_adj_list_vertex_id_map, long unsigned int>]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/johnson_all_pairs_shortest.hpp:192:36: required from ‘bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&) [with VertexAndEdgeListGraph = R_adjacency_list; DistanceMatrix = Basic2DMatrix]’ sna.cpp:105:41: required from here /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::BidirectionalIterator::~BidirectionalIterator() [with TT = long unsigned int*]’ 37 | ~model() | ^ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:571:7: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 571 | BOOST_CONCEPT_USAGE(BidirectionalIterator) | ^~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::Comparable]’: /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements >]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:253:5: required from ‘struct boost::Comparable’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:597:3: required from ‘struct boost::RandomAccessIterator’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:597:3: required from ‘struct boost::RandomAccessIteratorConcept’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::RandomAccessIteratorConcept]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:42:5: [ skipping 9 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/dijkstra_shortest_paths.hpp:491:28: required from ‘void boost::dijkstra_shortest_paths(const VertexListGraph&, SourceInputIter, SourceInputIter, PredecessorMap, DistanceMap, WeightMap, IndexMap, Compare, Combine, DistInf, DistZero, DijkstraVisitor) [with VertexListGraph = adjacency_list, property >, no_property, listS>; SourceInputIter = long unsigned int*; DijkstraVisitor = dijkstra_visitor<>; PredecessorMap = dummy_property_map; DistanceMap = vec_adj_list_vertex_property_map, property >, no_property, listS>, adjacency_list, property >, no_property, listS>*, double, double&, vertex_distance_t>; WeightMap = adj_list_edge_property_map >, edge_weight2_t>; IndexMap = vec_adj_list_vertex_id_map, long unsigned int>; Compare = std::less; Combine = closed_plus; DistInf = double; DistZero = double]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/dijkstra_shortest_paths.hpp:505:28: required from ‘void boost::dijkstra_shortest_paths(const VertexListGraph&, typename graph_traits::vertex_descriptor, PredecessorMap, DistanceMap, WeightMap, IndexMap, Compare, Combine, DistInf, DistZero, DijkstraVisitor) [with VertexListGraph = adjacency_list, property >, no_property, listS>; DijkstraVisitor = dijkstra_visitor<>; PredecessorMap = dummy_property_map; DistanceMap = vec_adj_list_vertex_property_map, property >, no_property, listS>, adjacency_list, property >, no_property, listS>*, double, double&, vertex_distance_t>; WeightMap = adj_list_edge_property_map >, edge_weight2_t>; IndexMap = vec_adj_list_vertex_id_map, long unsigned int>; Compare = std::less; Combine = closed_plus; DistInf = double; DistZero = double; typename graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/johnson_all_pairs_shortest.hpp:127:36: required from ‘bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, VertexID, Weight, const BinaryPredicate&, const BinaryFunction&, const Infinity&, DistanceZero) [with VertexAndEdgeListGraph = R_adjacency_list; DistanceMatrix = Basic2DMatrix; VertexID = vec_adj_list_vertex_id_map, long unsigned int>; Weight = adj_list_edge_property_map, edge_weight_t>; BinaryPredicate = std::less; BinaryFunction = closed_plus; Infinity = double; DistanceZero = double]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/johnson_all_pairs_shortest.hpp:164:48: required from ‘bool boost::detail::johnson_dispatch(VertexAndEdgeListGraph&, DistanceMatrix&, const boost::bgl_named_params&, Weight, VertexID) [with VertexAndEdgeListGraph = R_adjacency_list; DistanceMatrix = Basic2DMatrix; P = int; T = int; R = boost::no_property; Weight = boost::adj_list_edge_property_map, boost::edge_weight_t>; VertexID = boost::vec_adj_list_vertex_id_map, long unsigned int>]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/johnson_all_pairs_shortest.hpp:192:36: required from ‘bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&) [with VertexAndEdgeListGraph = R_adjacency_list; DistanceMatrix = Basic2DMatrix]’ sna.cpp:105:41: required from here /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::Comparable::~Comparable() [with TT = long unsigned int*]’ 37 | ~model() | ^ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:253:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 253 | BOOST_CONCEPT_USAGE(Comparable) { | ^~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::RandomAccessIterator]’: /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements >]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:601:7: required from ‘struct boost::RandomAccessIterator’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:597:3: required from ‘struct boost::RandomAccessIteratorConcept’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::RandomAccessIteratorConcept]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied >::value’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:45:51: [ skipping 8 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/dijkstra_shortest_paths.hpp:491:28: required from ‘void boost::dijkstra_shortest_paths(const VertexListGraph&, SourceInputIter, SourceInputIter, PredecessorMap, DistanceMap, WeightMap, IndexMap, Compare, Combine, DistInf, DistZero, DijkstraVisitor) [with VertexListGraph = adjacency_list, property >, no_property, listS>; SourceInputIter = long unsigned int*; DijkstraVisitor = dijkstra_visitor<>; PredecessorMap = dummy_property_map; DistanceMap = vec_adj_list_vertex_property_map, property >, no_property, listS>, adjacency_list, property >, no_property, listS>*, double, double&, vertex_distance_t>; WeightMap = adj_list_edge_property_map >, edge_weight2_t>; IndexMap = vec_adj_list_vertex_id_map, long unsigned int>; Compare = std::less; Combine = closed_plus; DistInf = double; DistZero = double]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/dijkstra_shortest_paths.hpp:505:28: required from ‘void boost::dijkstra_shortest_paths(const VertexListGraph&, typename graph_traits::vertex_descriptor, PredecessorMap, DistanceMap, WeightMap, IndexMap, Compare, Combine, DistInf, DistZero, DijkstraVisitor) [with VertexListGraph = adjacency_list, property >, no_property, listS>; DijkstraVisitor = dijkstra_visitor<>; PredecessorMap = dummy_property_map; DistanceMap = vec_adj_list_vertex_property_map, property >, no_property, listS>, adjacency_list, property >, no_property, listS>*, double, double&, vertex_distance_t>; WeightMap = adj_list_edge_property_map >, edge_weight2_t>; IndexMap = vec_adj_list_vertex_id_map, long unsigned int>; Compare = std::less; Combine = closed_plus; DistInf = double; DistZero = double; typename graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/johnson_all_pairs_shortest.hpp:127:36: required from ‘bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, VertexID, Weight, const BinaryPredicate&, const BinaryFunction&, const Infinity&, DistanceZero) [with VertexAndEdgeListGraph = R_adjacency_list; DistanceMatrix = Basic2DMatrix; VertexID = vec_adj_list_vertex_id_map, long unsigned int>; Weight = adj_list_edge_property_map, edge_weight_t>; BinaryPredicate = std::less; BinaryFunction = closed_plus; Infinity = double; DistanceZero = double]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/johnson_all_pairs_shortest.hpp:164:48: required from ‘bool boost::detail::johnson_dispatch(VertexAndEdgeListGraph&, DistanceMatrix&, const boost::bgl_named_params&, Weight, VertexID) [with VertexAndEdgeListGraph = R_adjacency_list; DistanceMatrix = Basic2DMatrix; P = int; T = int; R = boost::no_property; Weight = boost::adj_list_edge_property_map, boost::edge_weight_t>; VertexID = boost::vec_adj_list_vertex_id_map, long unsigned int>]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/johnson_all_pairs_shortest.hpp:192:36: required from ‘bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&) [with VertexAndEdgeListGraph = R_adjacency_list; DistanceMatrix = Basic2DMatrix]’ sna.cpp:105:41: required from here /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::RandomAccessIterator::~RandomAccessIterator() [with TT = long unsigned int*]’ 37 | ~model() | ^ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:601:7: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 601 | BOOST_CONCEPT_USAGE(RandomAccessIterator) | ^~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::concepts::MultiPassInputIterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> >]’: /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/graph_concepts.hpp:52:50: required from ‘struct boost::concepts::MultiPassInputIterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::concepts::MultiPassInputIterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> >]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::value’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:72:8: [ skipping 7 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/dijkstra_shortest_paths.hpp:491:28: required from ‘void boost::dijkstra_shortest_paths(const VertexListGraph&, SourceInputIter, SourceInputIter, PredecessorMap, DistanceMap, WeightMap, IndexMap, Compare, Combine, DistInf, DistZero, DijkstraVisitor) [with VertexListGraph = adjacency_list, property >, no_property, listS>; SourceInputIter = long unsigned int*; DijkstraVisitor = dijkstra_visitor<>; PredecessorMap = dummy_property_map; DistanceMap = vec_adj_list_vertex_property_map, property >, no_property, listS>, adjacency_list, property >, no_property, listS>*, double, double&, vertex_distance_t>; WeightMap = adj_list_edge_property_map >, edge_weight2_t>; IndexMap = vec_adj_list_vertex_id_map, long unsigned int>; Compare = std::less; Combine = closed_plus; DistInf = double; DistZero = double]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/dijkstra_shortest_paths.hpp:505:28: required from ‘void boost::dijkstra_shortest_paths(const VertexListGraph&, typename graph_traits::vertex_descriptor, PredecessorMap, DistanceMap, WeightMap, IndexMap, Compare, Combine, DistInf, DistZero, DijkstraVisitor) [with VertexListGraph = adjacency_list, property >, no_property, listS>; DijkstraVisitor = dijkstra_visitor<>; PredecessorMap = dummy_property_map; DistanceMap = vec_adj_list_vertex_property_map, property >, no_property, listS>, adjacency_list, property >, no_property, listS>*, double, double&, vertex_distance_t>; WeightMap = adj_list_edge_property_map >, edge_weight2_t>; IndexMap = vec_adj_list_vertex_id_map, long unsigned int>; Compare = std::less; Combine = closed_plus; DistInf = double; DistZero = double; typename graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/johnson_all_pairs_shortest.hpp:127:36: required from ‘bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, VertexID, Weight, const BinaryPredicate&, const BinaryFunction&, const Infinity&, DistanceZero) [with VertexAndEdgeListGraph = R_adjacency_list; DistanceMatrix = Basic2DMatrix; VertexID = vec_adj_list_vertex_id_map, long unsigned int>; Weight = adj_list_edge_property_map, edge_weight_t>; BinaryPredicate = std::less; BinaryFunction = closed_plus; Infinity = double; DistanceZero = double]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/johnson_all_pairs_shortest.hpp:164:48: required from ‘bool boost::detail::johnson_dispatch(VertexAndEdgeListGraph&, DistanceMatrix&, const boost::bgl_named_params&, Weight, VertexID) [with VertexAndEdgeListGraph = R_adjacency_list; DistanceMatrix = Basic2DMatrix; P = int; T = int; R = boost::no_property; Weight = boost::adj_list_edge_property_map, boost::edge_weight_t>; VertexID = boost::vec_adj_list_vertex_id_map, long unsigned int>]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/johnson_all_pairs_shortest.hpp:192:36: required from ‘bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&) [with VertexAndEdgeListGraph = R_adjacency_list; DistanceMatrix = Basic2DMatrix]’ sna.cpp:105:41: required from here /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::concepts::MultiPassInputIterator::~MultiPassInputIterator() [with T = boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>]’ 37 | ~model() | ^ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/graph_concepts.hpp:52:50: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 52 | BOOST_concept(MultiPassInputIterator, (T)) { BOOST_CONCEPT_USAGE( | ^~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::Convertible]’: /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements >]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:208:5: required from ‘struct boost::Convertible’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:206:3: required from ‘struct boost::ConvertibleConcept’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::ConvertibleConcept]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied >::value’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:45:51: [ skipping 16 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/dijkstra_shortest_paths.hpp:491:28: required from ‘void boost::dijkstra_shortest_paths(const VertexListGraph&, SourceInputIter, SourceInputIter, PredecessorMap, DistanceMap, WeightMap, IndexMap, Compare, Combine, DistInf, DistZero, DijkstraVisitor) [with VertexListGraph = adjacency_list, property >, no_property, listS>; SourceInputIter = long unsigned int*; DijkstraVisitor = dijkstra_visitor<>; PredecessorMap = dummy_property_map; DistanceMap = vec_adj_list_vertex_property_map, property >, no_property, listS>, adjacency_list, property >, no_property, listS>*, double, double&, vertex_distance_t>; WeightMap = adj_list_edge_property_map >, edge_weight2_t>; IndexMap = vec_adj_list_vertex_id_map, long unsigned int>; Compare = std::less; Combine = closed_plus; DistInf = double; DistZero = double]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/dijkstra_shortest_paths.hpp:505:28: required from ‘void boost::dijkstra_shortest_paths(const VertexListGraph&, typename graph_traits::vertex_descriptor, PredecessorMap, DistanceMap, WeightMap, IndexMap, Compare, Combine, DistInf, DistZero, DijkstraVisitor) [with VertexListGraph = adjacency_list, property >, no_property, listS>; DijkstraVisitor = dijkstra_visitor<>; PredecessorMap = dummy_property_map; DistanceMap = vec_adj_list_vertex_property_map, property >, no_property, listS>, adjacency_list, property >, no_property, listS>*, double, double&, vertex_distance_t>; WeightMap = adj_list_edge_property_map >, edge_weight2_t>; IndexMap = vec_adj_list_vertex_id_map, long unsigned int>; Compare = std::less; Combine = closed_plus; DistInf = double; DistZero = double; typename graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/johnson_all_pairs_shortest.hpp:127:36: required from ‘bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, VertexID, Weight, const BinaryPredicate&, const BinaryFunction&, const Infinity&, DistanceZero) [with VertexAndEdgeListGraph = R_adjacency_list; DistanceMatrix = Basic2DMatrix; VertexID = vec_adj_list_vertex_id_map, long unsigned int>; Weight = adj_list_edge_property_map, edge_weight_t>; BinaryPredicate = std::less; BinaryFunction = closed_plus; Infinity = double; DistanceZero = double]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/johnson_all_pairs_shortest.hpp:164:48: required from ‘bool boost::detail::johnson_dispatch(VertexAndEdgeListGraph&, DistanceMatrix&, const boost::bgl_named_params&, Weight, VertexID) [with VertexAndEdgeListGraph = R_adjacency_list; DistanceMatrix = Basic2DMatrix; P = int; T = int; R = boost::no_property; Weight = boost::adj_list_edge_property_map, boost::edge_weight_t>; VertexID = boost::vec_adj_list_vertex_id_map, long unsigned int>]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/johnson_all_pairs_shortest.hpp:192:36: required from ‘bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&) [with VertexAndEdgeListGraph = R_adjacency_list; DistanceMatrix = Basic2DMatrix]’ sna.cpp:105:41: required from here /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::Convertible::~Convertible() [with X = boost::read_write_property_map_tag; Y = boost::readable_property_map_tag]’ 37 | ~model() | ^ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:208:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 208 | BOOST_CONCEPT_USAGE(Convertible) { | ^~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::Convertible]’: /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements >]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:208:5: required from ‘struct boost::Convertible’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:206:3: required from ‘struct boost::ConvertibleConcept’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::ConvertibleConcept]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied >::value’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:45:51: [ skipping 16 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/dijkstra_shortest_paths.hpp:491:28: required from ‘void boost::dijkstra_shortest_paths(const VertexListGraph&, SourceInputIter, SourceInputIter, PredecessorMap, DistanceMap, WeightMap, IndexMap, Compare, Combine, DistInf, DistZero, DijkstraVisitor) [with VertexListGraph = adjacency_list, property >, no_property, listS>; SourceInputIter = long unsigned int*; DijkstraVisitor = dijkstra_visitor<>; PredecessorMap = dummy_property_map; DistanceMap = vec_adj_list_vertex_property_map, property >, no_property, listS>, adjacency_list, property >, no_property, listS>*, double, double&, vertex_distance_t>; WeightMap = adj_list_edge_property_map >, edge_weight2_t>; IndexMap = vec_adj_list_vertex_id_map, long unsigned int>; Compare = std::less; Combine = closed_plus; DistInf = double; DistZero = double]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/dijkstra_shortest_paths.hpp:505:28: required from ‘void boost::dijkstra_shortest_paths(const VertexListGraph&, typename graph_traits::vertex_descriptor, PredecessorMap, DistanceMap, WeightMap, IndexMap, Compare, Combine, DistInf, DistZero, DijkstraVisitor) [with VertexListGraph = adjacency_list, property >, no_property, listS>; DijkstraVisitor = dijkstra_visitor<>; PredecessorMap = dummy_property_map; DistanceMap = vec_adj_list_vertex_property_map, property >, no_property, listS>, adjacency_list, property >, no_property, listS>*, double, double&, vertex_distance_t>; WeightMap = adj_list_edge_property_map >, edge_weight2_t>; IndexMap = vec_adj_list_vertex_id_map, long unsigned int>; Compare = std::less; Combine = closed_plus; DistInf = double; DistZero = double; typename graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/johnson_all_pairs_shortest.hpp:127:36: required from ‘bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, VertexID, Weight, const BinaryPredicate&, const BinaryFunction&, const Infinity&, DistanceZero) [with VertexAndEdgeListGraph = R_adjacency_list; DistanceMatrix = Basic2DMatrix; VertexID = vec_adj_list_vertex_id_map, long unsigned int>; Weight = adj_list_edge_property_map, edge_weight_t>; BinaryPredicate = std::less; BinaryFunction = closed_plus; Infinity = double; DistanceZero = double]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/johnson_all_pairs_shortest.hpp:164:48: required from ‘bool boost::detail::johnson_dispatch(VertexAndEdgeListGraph&, DistanceMatrix&, const boost::bgl_named_params&, Weight, VertexID) [with VertexAndEdgeListGraph = R_adjacency_list; DistanceMatrix = Basic2DMatrix; P = int; T = int; R = boost::no_property; Weight = boost::adj_list_edge_property_map, boost::edge_weight_t>; VertexID = boost::vec_adj_list_vertex_id_map, long unsigned int>]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/johnson_all_pairs_shortest.hpp:192:36: required from ‘bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&) [with VertexAndEdgeListGraph = R_adjacency_list; DistanceMatrix = Basic2DMatrix]’ sna.cpp:105:41: required from here /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::Convertible::~Convertible() [with X = boost::read_write_property_map_tag; Y = boost::writable_property_map_tag]’ 37 | ~model() | ^ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:208:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 208 | BOOST_CONCEPT_USAGE(Convertible) { | ^~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements > > >, boost::edge_residual_capacity_t> >, boost::keep_all, boost::filtered_graph > > > >, boost::is_residual_edge > > >, boost::edge_residual_capacity_t> >, boost::keep_all> >, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > > > >*, std::vector > > > >, std::allocator > > > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > > >]’: /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:145:5: required from ‘struct boost::Assignable > > >, boost::edge_residual_capacity_t> >, boost::keep_all, boost::filtered_graph > > > >, boost::is_residual_edge > > >, boost::edge_residual_capacity_t> >, boost::keep_all> >, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > > > >*, std::vector > > > >, std::allocator > > > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:502:3: required from ‘struct boost::InputIterator > > >, boost::edge_residual_capacity_t> >, boost::keep_all, boost::filtered_graph > > > >, boost::is_residual_edge > > >, boost::edge_residual_capacity_t> >, boost::keep_all> >, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > > > >*, std::vector > > > >, std::allocator > > > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::InputIterator > > >, boost::edge_residual_capacity_t> >, boost::keep_all, boost::filtered_graph > > > >, boost::is_residual_edge > > >, boost::edge_residual_capacity_t> >, boost::keep_all> >, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > > > >*, std::vector > > > >, std::allocator > > > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied > > >, boost::edge_residual_capacity_t> >, boost::keep_all, boost::filtered_graph > > > >, boost::is_residual_edge > > >, boost::edge_residual_capacity_t> >, boost::keep_all> >, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > > > >*, std::vector > > > >, std::allocator > > > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > > >::value’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied > > >, boost::edge_residual_capacity_t> >, boost::keep_all, boost::filtered_graph > > > >, boost::is_residual_edge > > >, boost::edge_residual_capacity_t> >, boost::keep_all> >, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > > > >*, std::vector > > > >, std::allocator > > > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > > >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:72:8: [ skipping 8 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/edmonds_karp_max_flow.hpp:101:29: required from ‘typename boost::property_traits::value_type boost::edmonds_karp_max_flow(Graph&, typename graph_traits::vertex_descriptor, typename graph_traits::vertex_descriptor, CapacityEdgeMap, ResidualCapacityEdgeMap, ReverseEdgeMap, ColorMap, PredEdgeMap) [with Graph = adjacency_list > > > >; CapacityEdgeMap = adj_list_edge_property_map > > >, edge_capacity_t>; ResidualCapacityEdgeMap = adj_list_edge_property_map > > >, edge_residual_capacity_t>; ReverseEdgeMap = adj_list_edge_property_map, const detail::edge_desc_impl&, long unsigned int, const property > > >, edge_reverse_t>; ColorMap = iterator_property_map<__gnu_cxx::__normal_iterator >, vec_adj_list_vertex_id_map, default_color_type, default_color_type&>; PredEdgeMap = iterator_property_map<__gnu_cxx::__normal_iterator*, std::vector, std::allocator > > >, vec_adj_list_vertex_id_map, detail::edge_desc_impl, detail::edge_desc_impl&>; typename property_traits::value_type = double; typename graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/edmonds_karp_max_flow.hpp:154:41: required from ‘static typename boost::detail::edge_capacity_value::type boost::detail::edmonds_karp_dispatch2::apply(Graph&, typename boost::graph_traits::vertex_descriptor, typename boost::graph_traits::vertex_descriptor, PredMap, const boost::bgl_named_params&, boost::param_not_found) [with Graph = boost::adjacency_list > > > >; PredMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator*, std::vector, std::allocator > > >, boost::vec_adj_list_vertex_id_map, boost::detail::edge_desc_impl, boost::detail::edge_desc_impl&>; P = int; T = boost::buffer_param_t; R = boost::no_property; typename boost::detail::edge_capacity_value::type = double; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/edmonds_karp_max_flow.hpp:208:54: required from ‘static typename boost::detail::edge_capacity_value::type boost::detail::edmonds_karp_dispatch1::apply(Graph&, typename boost::graph_traits::vertex_descriptor, typename boost::graph_traits::vertex_descriptor, const boost::bgl_named_params&, boost::param_not_found) [with Graph = boost::adjacency_list > > > >; P = int; T = boost::buffer_param_t; R = boost::no_property; typename boost::detail::edge_capacity_value::type = double; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/edmonds_karp_max_flow.hpp:228:57: required from ‘typename boost::detail::edge_capacity_value::type boost::edmonds_karp_max_flow(Graph&, typename graph_traits::vertex_descriptor, typename graph_traits::vertex_descriptor, const bgl_named_params&) [with Graph = adjacency_list > > > >; P = int; T = buffer_param_t; R = no_property; typename detail::edge_capacity_value::type = double; typename graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/edmonds_karp_max_flow.hpp:240:33: required from ‘typename boost::property_traits::const_type>::value_type boost::edmonds_karp_max_flow(Graph&, typename graph_traits::vertex_descriptor, typename graph_traits::vertex_descriptor) [with Graph = adjacency_list > > > >; typename property_traits::const_type>::value_type = double; typename property_map::const_type = adj_list_edge_property_map > > >, edge_capacity_t>; typename graph_traits::vertex_descriptor = long unsigned int]’ sna.cpp:204:54: required from here /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::Assignable > > >, boost::edge_residual_capacity_t> >, boost::keep_all, boost::filtered_graph > > > >, boost::is_residual_edge > > >, boost::edge_residual_capacity_t> >, boost::keep_all> >, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > > > >*, std::vector > > > >, std::allocator > > > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >]’ 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ^ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements > > >, boost::edge_residual_capacity_t> >, boost::keep_all, boost::filtered_graph > > > >, boost::is_residual_edge > > >, boost::edge_residual_capacity_t> >, boost::keep_all> >, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > > > >*, std::vector > > > >, std::allocator > > > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > > >]’: /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:233:5: required from ‘struct boost::EqualityComparable > > >, boost::edge_residual_capacity_t> >, boost::keep_all, boost::filtered_graph > > > >, boost::is_residual_edge > > >, boost::edge_residual_capacity_t> >, boost::keep_all> >, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > > > >*, std::vector > > > >, std::allocator > > > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:502:3: required from ‘struct boost::InputIterator > > >, boost::edge_residual_capacity_t> >, boost::keep_all, boost::filtered_graph > > > >, boost::is_residual_edge > > >, boost::edge_residual_capacity_t> >, boost::keep_all> >, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > > > >*, std::vector > > > >, std::allocator > > > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::InputIterator > > >, boost::edge_residual_capacity_t> >, boost::keep_all, boost::filtered_graph > > > >, boost::is_residual_edge > > >, boost::edge_residual_capacity_t> >, boost::keep_all> >, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > > > >*, std::vector > > > >, std::allocator > > > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied > > >, boost::edge_residual_capacity_t> >, boost::keep_all, boost::filtered_graph > > > >, boost::is_residual_edge > > >, boost::edge_residual_capacity_t> >, boost::keep_all> >, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > > > >*, std::vector > > > >, std::allocator > > > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > > >::value’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied > > >, boost::edge_residual_capacity_t> >, boost::keep_all, boost::filtered_graph > > > >, boost::is_residual_edge > > >, boost::edge_residual_capacity_t> >, boost::keep_all> >, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > > > >*, std::vector > > > >, std::allocator > > > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > > >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:72:8: [ skipping 8 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/edmonds_karp_max_flow.hpp:101:29: required from ‘typename boost::property_traits::value_type boost::edmonds_karp_max_flow(Graph&, typename graph_traits::vertex_descriptor, typename graph_traits::vertex_descriptor, CapacityEdgeMap, ResidualCapacityEdgeMap, ReverseEdgeMap, ColorMap, PredEdgeMap) [with Graph = adjacency_list > > > >; CapacityEdgeMap = adj_list_edge_property_map > > >, edge_capacity_t>; ResidualCapacityEdgeMap = adj_list_edge_property_map > > >, edge_residual_capacity_t>; ReverseEdgeMap = adj_list_edge_property_map, const detail::edge_desc_impl&, long unsigned int, const property > > >, edge_reverse_t>; ColorMap = iterator_property_map<__gnu_cxx::__normal_iterator >, vec_adj_list_vertex_id_map, default_color_type, default_color_type&>; PredEdgeMap = iterator_property_map<__gnu_cxx::__normal_iterator*, std::vector, std::allocator > > >, vec_adj_list_vertex_id_map, detail::edge_desc_impl, detail::edge_desc_impl&>; typename property_traits::value_type = double; typename graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/edmonds_karp_max_flow.hpp:154:41: required from ‘static typename boost::detail::edge_capacity_value::type boost::detail::edmonds_karp_dispatch2::apply(Graph&, typename boost::graph_traits::vertex_descriptor, typename boost::graph_traits::vertex_descriptor, PredMap, const boost::bgl_named_params&, boost::param_not_found) [with Graph = boost::adjacency_list > > > >; PredMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator*, std::vector, std::allocator > > >, boost::vec_adj_list_vertex_id_map, boost::detail::edge_desc_impl, boost::detail::edge_desc_impl&>; P = int; T = boost::buffer_param_t; R = boost::no_property; typename boost::detail::edge_capacity_value::type = double; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/edmonds_karp_max_flow.hpp:208:54: required from ‘static typename boost::detail::edge_capacity_value::type boost::detail::edmonds_karp_dispatch1::apply(Graph&, typename boost::graph_traits::vertex_descriptor, typename boost::graph_traits::vertex_descriptor, const boost::bgl_named_params&, boost::param_not_found) [with Graph = boost::adjacency_list > > > >; P = int; T = boost::buffer_param_t; R = boost::no_property; typename boost::detail::edge_capacity_value::type = double; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/edmonds_karp_max_flow.hpp:228:57: required from ‘typename boost::detail::edge_capacity_value::type boost::edmonds_karp_max_flow(Graph&, typename graph_traits::vertex_descriptor, typename graph_traits::vertex_descriptor, const bgl_named_params&) [with Graph = adjacency_list > > > >; P = int; T = buffer_param_t; R = no_property; typename detail::edge_capacity_value::type = double; typename graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/edmonds_karp_max_flow.hpp:240:33: required from ‘typename boost::property_traits::const_type>::value_type boost::edmonds_karp_max_flow(Graph&, typename graph_traits::vertex_descriptor, typename graph_traits::vertex_descriptor) [with Graph = adjacency_list > > > >; typename property_traits::const_type>::value_type = double; typename property_map::const_type = adj_list_edge_property_map > > >, edge_capacity_t>; typename graph_traits::vertex_descriptor = long unsigned int]’ sna.cpp:204:54: required from here /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::EqualityComparable > > >, boost::edge_residual_capacity_t> >, boost::keep_all, boost::filtered_graph > > > >, boost::is_residual_edge > > >, boost::edge_residual_capacity_t> >, boost::keep_all> >, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > > > >*, std::vector > > > >, std::allocator > > > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >]’ 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ^ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements > > >, boost::edge_residual_capacity_t> >, boost::keep_all, boost::filtered_graph > > > >, boost::is_residual_edge > > >, boost::edge_residual_capacity_t> >, boost::keep_all> >, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > > > >*, std::vector > > > >, std::allocator > > > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > > >]’: /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:512:7: required from ‘struct boost::InputIterator > > >, boost::edge_residual_capacity_t> >, boost::keep_all, boost::filtered_graph > > > >, boost::is_residual_edge > > >, boost::edge_residual_capacity_t> >, boost::keep_all> >, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > > > >*, std::vector > > > >, std::allocator > > > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::InputIterator > > >, boost::edge_residual_capacity_t> >, boost::keep_all, boost::filtered_graph > > > >, boost::is_residual_edge > > >, boost::edge_residual_capacity_t> >, boost::keep_all> >, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > > > >*, std::vector > > > >, std::allocator > > > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied > > >, boost::edge_residual_capacity_t> >, boost::keep_all, boost::filtered_graph > > > >, boost::is_residual_edge > > >, boost::edge_residual_capacity_t> >, boost::keep_all> >, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > > > >*, std::vector > > > >, std::allocator > > > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > > >::value’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied > > >, boost::edge_residual_capacity_t> >, boost::keep_all, boost::filtered_graph > > > >, boost::is_residual_edge > > >, boost::edge_residual_capacity_t> >, boost::keep_all> >, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > > > >*, std::vector > > > >, std::allocator > > > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > > >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_ > > >, boost::edge_residual_capacity_t> >, boost::keep_all, boost::filtered_graph > > > >, boost::is_residual_edge > > >, boost::edge_residual_capacity_t> >, boost::keep_all> >, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > > > >*, std::vector > > > >, std::allocator > > > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >)>’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/graph_concepts.hpp:53:35: [ skipping 7 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/edmonds_karp_max_flow.hpp:101:29: required from ‘typename boost::property_traits::value_type boost::edmonds_karp_max_flow(Graph&, typename graph_traits::vertex_descriptor, typename graph_traits::vertex_descriptor, CapacityEdgeMap, ResidualCapacityEdgeMap, ReverseEdgeMap, ColorMap, PredEdgeMap) [with Graph = adjacency_list > > > >; CapacityEdgeMap = adj_list_edge_property_map > > >, edge_capacity_t>; ResidualCapacityEdgeMap = adj_list_edge_property_map > > >, edge_residual_capacity_t>; ReverseEdgeMap = adj_list_edge_property_map, const detail::edge_desc_impl&, long unsigned int, const property > > >, edge_reverse_t>; ColorMap = iterator_property_map<__gnu_cxx::__normal_iterator >, vec_adj_list_vertex_id_map, default_color_type, default_color_type&>; PredEdgeMap = iterator_property_map<__gnu_cxx::__normal_iterator*, std::vector, std::allocator > > >, vec_adj_list_vertex_id_map, detail::edge_desc_impl, detail::edge_desc_impl&>; typename property_traits::value_type = double; typename graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/edmonds_karp_max_flow.hpp:154:41: required from ‘static typename boost::detail::edge_capacity_value::type boost::detail::edmonds_karp_dispatch2::apply(Graph&, typename boost::graph_traits::vertex_descriptor, typename boost::graph_traits::vertex_descriptor, PredMap, const boost::bgl_named_params&, boost::param_not_found) [with Graph = boost::adjacency_list > > > >; PredMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator*, std::vector, std::allocator > > >, boost::vec_adj_list_vertex_id_map, boost::detail::edge_desc_impl, boost::detail::edge_desc_impl&>; P = int; T = boost::buffer_param_t; R = boost::no_property; typename boost::detail::edge_capacity_value::type = double; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/edmonds_karp_max_flow.hpp:208:54: required from ‘static typename boost::detail::edge_capacity_value::type boost::detail::edmonds_karp_dispatch1::apply(Graph&, typename boost::graph_traits::vertex_descriptor, typename boost::graph_traits::vertex_descriptor, const boost::bgl_named_params&, boost::param_not_found) [with Graph = boost::adjacency_list > > > >; P = int; T = boost::buffer_param_t; R = boost::no_property; typename boost::detail::edge_capacity_value::type = double; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/edmonds_karp_max_flow.hpp:228:57: required from ‘typename boost::detail::edge_capacity_value::type boost::edmonds_karp_max_flow(Graph&, typename graph_traits::vertex_descriptor, typename graph_traits::vertex_descriptor, const bgl_named_params&) [with Graph = adjacency_list > > > >; P = int; T = buffer_param_t; R = no_property; typename detail::edge_capacity_value::type = double; typename graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/edmonds_karp_max_flow.hpp:240:33: required from ‘typename boost::property_traits::const_type>::value_type boost::edmonds_karp_max_flow(Graph&, typename graph_traits::vertex_descriptor, typename graph_traits::vertex_descriptor) [with Graph = adjacency_list > > > >; typename property_traits::const_type>::value_type = double; typename property_map::const_type = adj_list_edge_property_map > > >, edge_capacity_t>; typename graph_traits::vertex_descriptor = long unsigned int]’ sna.cpp:204:54: required from here /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::InputIterator > > >, boost::edge_residual_capacity_t> >, boost::keep_all, boost::filtered_graph > > > >, boost::is_residual_edge > > >, boost::edge_residual_capacity_t> >, boost::keep_all> >, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > > > >*, std::vector > > > >, std::allocator > > > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >]’ 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ^ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::InputIterator > > >, boost::edge_residual_capacity_t> >, boost::keep_all, boost::filtered_graph > > > >, boost::is_residual_edge > > >, boost::edge_residual_capacity_t> >, boost::keep_all> >, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > > > >*, std::vector > > > >, std::allocator > > > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >]’: /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/graph_concepts.hpp:53:35: required from ‘boost::concepts::MultiPassInputIterator::~MultiPassInputIterator() [with T = boost::iterators::filter_iterator > > >, boost::edge_residual_capacity_t> >, boost::keep_all, boost::filtered_graph > > > >, boost::is_residual_edge > > >, boost::edge_residual_capacity_t> >, boost::keep_all> >, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > > > >*, std::vector > > > >, std::allocator > > > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> >]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::MultiPassInputIterator > > >, boost::edge_residual_capacity_t> >, boost::keep_all, boost::filtered_graph > > > >, boost::is_residual_edge > > >, boost::edge_residual_capacity_t> >, boost::keep_all> >, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > > > >*, std::vector > > > >, std::allocator > > > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/graph_concepts.hpp:89:9: required from ‘boost::concepts::IncidenceGraph::~IncidenceGraph() [with G = boost::filtered_graph > > > >, boost::is_residual_edge > > >, boost::edge_residual_capacity_t> >, boost::keep_all>]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/graph_concepts.hpp:75:1: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::IncidenceGraphConcept > > > >, boost::is_residual_edge > > >, boost::edge_residual_capacity_t> >, boost::keep_all> >]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/breadth_first_search.hpp:62:5: required from ‘void boost::breadth_first_visit(const IncidenceGraph&, SourceIterator, SourceIterator, Buffer&, BFSVisitor, ColorMap) [with IncidenceGraph = filtered_graph > > > >, is_residual_edge > > >, edge_residual_capacity_t> >, keep_all>; Buffer = queue > >; BFSVisitor = bfs_visitor*, std::vector, std::allocator > > >, vec_adj_list_vertex_id_map, detail::edge_desc_impl, detail::edge_desc_impl&>, on_tree_edge> >; ColorMap = iterator_property_map<__gnu_cxx::__normal_iterator >, vec_adj_list_vertex_id_map, default_color_type, default_color_type&>; SourceIterator = long unsigned int*]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/breadth_first_search.hpp:136:24: [ skipping 2 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/edmonds_karp_max_flow.hpp:101:29: required from ‘typename boost::property_traits::value_type boost::edmonds_karp_max_flow(Graph&, typename graph_traits::vertex_descriptor, typename graph_traits::vertex_descriptor, CapacityEdgeMap, ResidualCapacityEdgeMap, ReverseEdgeMap, ColorMap, PredEdgeMap) [with Graph = adjacency_list > > > >; CapacityEdgeMap = adj_list_edge_property_map > > >, edge_capacity_t>; ResidualCapacityEdgeMap = adj_list_edge_property_map > > >, edge_residual_capacity_t>; ReverseEdgeMap = adj_list_edge_property_map, const detail::edge_desc_impl&, long unsigned int, const property > > >, edge_reverse_t>; ColorMap = iterator_property_map<__gnu_cxx::__normal_iterator >, vec_adj_list_vertex_id_map, default_color_type, default_color_type&>; PredEdgeMap = iterator_property_map<__gnu_cxx::__normal_iterator*, std::vector, std::allocator > > >, vec_adj_list_vertex_id_map, detail::edge_desc_impl, detail::edge_desc_impl&>; typename property_traits::value_type = double; typename graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/edmonds_karp_max_flow.hpp:154:41: required from ‘static typename boost::detail::edge_capacity_value::type boost::detail::edmonds_karp_dispatch2::apply(Graph&, typename boost::graph_traits::vertex_descriptor, typename boost::graph_traits::vertex_descriptor, PredMap, const boost::bgl_named_params&, boost::param_not_found) [with Graph = boost::adjacency_list > > > >; PredMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator*, std::vector, std::allocator > > >, boost::vec_adj_list_vertex_id_map, boost::detail::edge_desc_impl, boost::detail::edge_desc_impl&>; P = int; T = boost::buffer_param_t; R = boost::no_property; typename boost::detail::edge_capacity_value::type = double; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/edmonds_karp_max_flow.hpp:208:54: required from ‘static typename boost::detail::edge_capacity_value::type boost::detail::edmonds_karp_dispatch1::apply(Graph&, typename boost::graph_traits::vertex_descriptor, typename boost::graph_traits::vertex_descriptor, const boost::bgl_named_params&, boost::param_not_found) [with Graph = boost::adjacency_list > > > >; P = int; T = boost::buffer_param_t; R = boost::no_property; typename boost::detail::edge_capacity_value::type = double; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/edmonds_karp_max_flow.hpp:228:57: required from ‘typename boost::detail::edge_capacity_value::type boost::edmonds_karp_max_flow(Graph&, typename graph_traits::vertex_descriptor, typename graph_traits::vertex_descriptor, const bgl_named_params&) [with Graph = adjacency_list > > > >; P = int; T = buffer_param_t; R = no_property; typename detail::edge_capacity_value::type = double; typename graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/edmonds_karp_max_flow.hpp:240:33: required from ‘typename boost::property_traits::const_type>::value_type boost::edmonds_karp_max_flow(Graph&, typename graph_traits::vertex_descriptor, typename graph_traits::vertex_descriptor) [with Graph = adjacency_list > > > >; typename property_traits::const_type>::value_type = double; typename property_map::const_type = adj_list_edge_property_map > > >, edge_capacity_t>; typename graph_traits::vertex_descriptor = long unsigned int]’ sna.cpp:204:54: required from here /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::InputIterator::~InputIterator() [with TT = boost::iterators::filter_iterator > > >, boost::edge_residual_capacity_t> >, boost::keep_all, boost::filtered_graph > > > >, boost::is_residual_edge > > >, boost::edge_residual_capacity_t> >, boost::keep_all> >, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > > > >*, std::vector > > > >, std::allocator > > > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> >]’ 37 | ~model() | ^ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:512:7: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 512 | BOOST_CONCEPT_USAGE(InputIterator) | ^~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >]’: /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:145:5: required from ‘struct boost::Assignable > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:502:3: required from ‘struct boost::InputIterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::InputIterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> >]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::value’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:72:8: [ skipping 9 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/dijkstra_shortest_paths.hpp:491:28: required from ‘void boost::dijkstra_shortest_paths(const VertexListGraph&, SourceInputIter, SourceInputIter, PredecessorMap, DistanceMap, WeightMap, IndexMap, Compare, Combine, DistInf, DistZero, DijkstraVisitor) [with VertexListGraph = adjacency_list, property >, no_property, listS>; SourceInputIter = long unsigned int*; DijkstraVisitor = dijkstra_visitor<>; PredecessorMap = dummy_property_map; DistanceMap = vec_adj_list_vertex_property_map, property >, no_property, listS>, adjacency_list, property >, no_property, listS>*, double, double&, vertex_distance_t>; WeightMap = adj_list_edge_property_map >, edge_weight2_t>; IndexMap = vec_adj_list_vertex_id_map, long unsigned int>; Compare = std::less; Combine = closed_plus; DistInf = double; DistZero = double]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/dijkstra_shortest_paths.hpp:505:28: required from ‘void boost::dijkstra_shortest_paths(const VertexListGraph&, typename graph_traits::vertex_descriptor, PredecessorMap, DistanceMap, WeightMap, IndexMap, Compare, Combine, DistInf, DistZero, DijkstraVisitor) [with VertexListGraph = adjacency_list, property >, no_property, listS>; DijkstraVisitor = dijkstra_visitor<>; PredecessorMap = dummy_property_map; DistanceMap = vec_adj_list_vertex_property_map, property >, no_property, listS>, adjacency_list, property >, no_property, listS>*, double, double&, vertex_distance_t>; WeightMap = adj_list_edge_property_map >, edge_weight2_t>; IndexMap = vec_adj_list_vertex_id_map, long unsigned int>; Compare = std::less; Combine = closed_plus; DistInf = double; DistZero = double; typename graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/johnson_all_pairs_shortest.hpp:127:36: required from ‘bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, VertexID, Weight, const BinaryPredicate&, const BinaryFunction&, const Infinity&, DistanceZero) [with VertexAndEdgeListGraph = R_adjacency_list; DistanceMatrix = Basic2DMatrix; VertexID = vec_adj_list_vertex_id_map, long unsigned int>; Weight = adj_list_edge_property_map, edge_weight_t>; BinaryPredicate = std::less; BinaryFunction = closed_plus; Infinity = double; DistanceZero = double]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/johnson_all_pairs_shortest.hpp:164:48: required from ‘bool boost::detail::johnson_dispatch(VertexAndEdgeListGraph&, DistanceMatrix&, const boost::bgl_named_params&, Weight, VertexID) [with VertexAndEdgeListGraph = R_adjacency_list; DistanceMatrix = Basic2DMatrix; P = int; T = int; R = boost::no_property; Weight = boost::adj_list_edge_property_map, boost::edge_weight_t>; VertexID = boost::vec_adj_list_vertex_id_map, long unsigned int>]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/johnson_all_pairs_shortest.hpp:192:36: required from ‘bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&) [with VertexAndEdgeListGraph = R_adjacency_list; DistanceMatrix = Basic2DMatrix]’ sna.cpp:105:41: required from here /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::Assignable > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> >]’ 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ^ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >]’: /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:233:5: required from ‘struct boost::EqualityComparable > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:502:3: required from ‘struct boost::InputIterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::InputIterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> >]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::value’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:72:8: [ skipping 9 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/dijkstra_shortest_paths.hpp:491:28: required from ‘void boost::dijkstra_shortest_paths(const VertexListGraph&, SourceInputIter, SourceInputIter, PredecessorMap, DistanceMap, WeightMap, IndexMap, Compare, Combine, DistInf, DistZero, DijkstraVisitor) [with VertexListGraph = adjacency_list, property >, no_property, listS>; SourceInputIter = long unsigned int*; DijkstraVisitor = dijkstra_visitor<>; PredecessorMap = dummy_property_map; DistanceMap = vec_adj_list_vertex_property_map, property >, no_property, listS>, adjacency_list, property >, no_property, listS>*, double, double&, vertex_distance_t>; WeightMap = adj_list_edge_property_map >, edge_weight2_t>; IndexMap = vec_adj_list_vertex_id_map, long unsigned int>; Compare = std::less; Combine = closed_plus; DistInf = double; DistZero = double]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/dijkstra_shortest_paths.hpp:505:28: required from ‘void boost::dijkstra_shortest_paths(const VertexListGraph&, typename graph_traits::vertex_descriptor, PredecessorMap, DistanceMap, WeightMap, IndexMap, Compare, Combine, DistInf, DistZero, DijkstraVisitor) [with VertexListGraph = adjacency_list, property >, no_property, listS>; DijkstraVisitor = dijkstra_visitor<>; PredecessorMap = dummy_property_map; DistanceMap = vec_adj_list_vertex_property_map, property >, no_property, listS>, adjacency_list, property >, no_property, listS>*, double, double&, vertex_distance_t>; WeightMap = adj_list_edge_property_map >, edge_weight2_t>; IndexMap = vec_adj_list_vertex_id_map, long unsigned int>; Compare = std::less; Combine = closed_plus; DistInf = double; DistZero = double; typename graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/johnson_all_pairs_shortest.hpp:127:36: required from ‘bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, VertexID, Weight, const BinaryPredicate&, const BinaryFunction&, const Infinity&, DistanceZero) [with VertexAndEdgeListGraph = R_adjacency_list; DistanceMatrix = Basic2DMatrix; VertexID = vec_adj_list_vertex_id_map, long unsigned int>; Weight = adj_list_edge_property_map, edge_weight_t>; BinaryPredicate = std::less; BinaryFunction = closed_plus; Infinity = double; DistanceZero = double]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/johnson_all_pairs_shortest.hpp:164:48: required from ‘bool boost::detail::johnson_dispatch(VertexAndEdgeListGraph&, DistanceMatrix&, const boost::bgl_named_params&, Weight, VertexID) [with VertexAndEdgeListGraph = R_adjacency_list; DistanceMatrix = Basic2DMatrix; P = int; T = int; R = boost::no_property; Weight = boost::adj_list_edge_property_map, boost::edge_weight_t>; VertexID = boost::vec_adj_list_vertex_id_map, long unsigned int>]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/johnson_all_pairs_shortest.hpp:192:36: required from ‘bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&) [with VertexAndEdgeListGraph = R_adjacency_list; DistanceMatrix = Basic2DMatrix]’ sna.cpp:105:41: required from here /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::EqualityComparable > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> >]’ 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ^ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >]’: /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:512:7: required from ‘struct boost::InputIterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::InputIterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> >]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::value’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_ > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> >)>’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/graph_concepts.hpp:53:35: [ skipping 8 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/dijkstra_shortest_paths.hpp:491:28: required from ‘void boost::dijkstra_shortest_paths(const VertexListGraph&, SourceInputIter, SourceInputIter, PredecessorMap, DistanceMap, WeightMap, IndexMap, Compare, Combine, DistInf, DistZero, DijkstraVisitor) [with VertexListGraph = adjacency_list, property >, no_property, listS>; SourceInputIter = long unsigned int*; DijkstraVisitor = dijkstra_visitor<>; PredecessorMap = dummy_property_map; DistanceMap = vec_adj_list_vertex_property_map, property >, no_property, listS>, adjacency_list, property >, no_property, listS>*, double, double&, vertex_distance_t>; WeightMap = adj_list_edge_property_map >, edge_weight2_t>; IndexMap = vec_adj_list_vertex_id_map, long unsigned int>; Compare = std::less; Combine = closed_plus; DistInf = double; DistZero = double]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/dijkstra_shortest_paths.hpp:505:28: required from ‘void boost::dijkstra_shortest_paths(const VertexListGraph&, typename graph_traits::vertex_descriptor, PredecessorMap, DistanceMap, WeightMap, IndexMap, Compare, Combine, DistInf, DistZero, DijkstraVisitor) [with VertexListGraph = adjacency_list, property >, no_property, listS>; DijkstraVisitor = dijkstra_visitor<>; PredecessorMap = dummy_property_map; DistanceMap = vec_adj_list_vertex_property_map, property >, no_property, listS>, adjacency_list, property >, no_property, listS>*, double, double&, vertex_distance_t>; WeightMap = adj_list_edge_property_map >, edge_weight2_t>; IndexMap = vec_adj_list_vertex_id_map, long unsigned int>; Compare = std::less; Combine = closed_plus; DistInf = double; DistZero = double; typename graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/johnson_all_pairs_shortest.hpp:127:36: required from ‘bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, VertexID, Weight, const BinaryPredicate&, const BinaryFunction&, const Infinity&, DistanceZero) [with VertexAndEdgeListGraph = R_adjacency_list; DistanceMatrix = Basic2DMatrix; VertexID = vec_adj_list_vertex_id_map, long unsigned int>; Weight = adj_list_edge_property_map, edge_weight_t>; BinaryPredicate = std::less; BinaryFunction = closed_plus; Infinity = double; DistanceZero = double]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/johnson_all_pairs_shortest.hpp:164:48: required from ‘bool boost::detail::johnson_dispatch(VertexAndEdgeListGraph&, DistanceMatrix&, const boost::bgl_named_params&, Weight, VertexID) [with VertexAndEdgeListGraph = R_adjacency_list; DistanceMatrix = Basic2DMatrix; P = int; T = int; R = boost::no_property; Weight = boost::adj_list_edge_property_map, boost::edge_weight_t>; VertexID = boost::vec_adj_list_vertex_id_map, long unsigned int>]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/johnson_all_pairs_shortest.hpp:192:36: required from ‘bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&) [with VertexAndEdgeListGraph = R_adjacency_list; DistanceMatrix = Basic2DMatrix]’ sna.cpp:105:41: required from here /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::InputIterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> >]’ 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ^ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::InputIterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> >]’: /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/graph_concepts.hpp:53:35: required from ‘boost::concepts::MultiPassInputIterator::~MultiPassInputIterator() [with T = boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::MultiPassInputIterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> >]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/graph_concepts.hpp:89:9: required from ‘boost::concepts::IncidenceGraph::~IncidenceGraph() [with G = boost::adjacency_list, boost::property >, boost::no_property, boost::listS>]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/graph_concepts.hpp:75:1: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::IncidenceGraphConcept, boost::property >, boost::no_property, boost::listS> >]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/breadth_first_search.hpp:62:5: required from ‘void boost::breadth_first_visit(const IncidenceGraph&, SourceIterator, SourceIterator, Buffer&, BFSVisitor, ColorMap) [with IncidenceGraph = adjacency_list, property >, no_property, listS>; Buffer = d_ary_heap_indirect, long unsigned int>, long unsigned int, long unsigned int&>, vec_adj_list_vertex_property_map, property >, no_property, listS>, adjacency_list, property >, no_property, listS>*, double, double&, vertex_distance_t>, std::less, std::vector > >; BFSVisitor = detail::dijkstra_bfs_visitor, d_ary_heap_indirect, long unsigned int>, long unsigned int, long unsigned int&>, vec_adj_list_vertex_property_map, property >, no_property, listS>, adjacency_list, property >, no_property, listS>*, double, double&, vertex_distance_t>, std::less, std::vector > >, adj_list_edge_property_map >, edge_weight2_t>, dummy_property_map, vec_adj_list_vertex_property_map, property >, no_property, listS>, adjacency_list, property >, no_property, listS>*, double, double&, vertex_distance_t>, closed_plus, std::less >; ColorMap = two_bit_color_map, long unsigned int> >; SourceIterator = long unsigned int*]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/dijkstra_shortest_paths.hpp:387:24: [ skipping 3 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/dijkstra_shortest_paths.hpp:491:28: required from ‘void boost::dijkstra_shortest_paths(const VertexListGraph&, SourceInputIter, SourceInputIter, PredecessorMap, DistanceMap, WeightMap, IndexMap, Compare, Combine, DistInf, DistZero, DijkstraVisitor) [with VertexListGraph = adjacency_list, property >, no_property, listS>; SourceInputIter = long unsigned int*; DijkstraVisitor = dijkstra_visitor<>; PredecessorMap = dummy_property_map; DistanceMap = vec_adj_list_vertex_property_map, property >, no_property, listS>, adjacency_list, property >, no_property, listS>*, double, double&, vertex_distance_t>; WeightMap = adj_list_edge_property_map >, edge_weight2_t>; IndexMap = vec_adj_list_vertex_id_map, long unsigned int>; Compare = std::less; Combine = closed_plus; DistInf = double; DistZero = double]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/dijkstra_shortest_paths.hpp:505:28: required from ‘void boost::dijkstra_shortest_paths(const VertexListGraph&, typename graph_traits::vertex_descriptor, PredecessorMap, DistanceMap, WeightMap, IndexMap, Compare, Combine, DistInf, DistZero, DijkstraVisitor) [with VertexListGraph = adjacency_list, property >, no_property, listS>; DijkstraVisitor = dijkstra_visitor<>; PredecessorMap = dummy_property_map; DistanceMap = vec_adj_list_vertex_property_map, property >, no_property, listS>, adjacency_list, property >, no_property, listS>*, double, double&, vertex_distance_t>; WeightMap = adj_list_edge_property_map >, edge_weight2_t>; IndexMap = vec_adj_list_vertex_id_map, long unsigned int>; Compare = std::less; Combine = closed_plus; DistInf = double; DistZero = double; typename graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/johnson_all_pairs_shortest.hpp:127:36: required from ‘bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, VertexID, Weight, const BinaryPredicate&, const BinaryFunction&, const Infinity&, DistanceZero) [with VertexAndEdgeListGraph = R_adjacency_list; DistanceMatrix = Basic2DMatrix; VertexID = vec_adj_list_vertex_id_map, long unsigned int>; Weight = adj_list_edge_property_map, edge_weight_t>; BinaryPredicate = std::less; BinaryFunction = closed_plus; Infinity = double; DistanceZero = double]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/johnson_all_pairs_shortest.hpp:164:48: required from ‘bool boost::detail::johnson_dispatch(VertexAndEdgeListGraph&, DistanceMatrix&, const boost::bgl_named_params&, Weight, VertexID) [with VertexAndEdgeListGraph = R_adjacency_list; DistanceMatrix = Basic2DMatrix; P = int; T = int; R = boost::no_property; Weight = boost::adj_list_edge_property_map, boost::edge_weight_t>; VertexID = boost::vec_adj_list_vertex_id_map, long unsigned int>]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/johnson_all_pairs_shortest.hpp:192:36: required from ‘bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&) [with VertexAndEdgeListGraph = R_adjacency_list; DistanceMatrix = Basic2DMatrix]’ sna.cpp:105:41: required from here /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::InputIterator::~InputIterator() [with TT = boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>]’ 37 | ~model() | ^ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:512:7: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 512 | BOOST_CONCEPT_USAGE(InputIterator) | ^~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::Assignable > > >, boost::edge_residual_capacity_t> >, boost::keep_all, boost::filtered_graph > > > >, boost::is_residual_edge > > >, boost::edge_residual_capacity_t> >, boost::keep_all> >, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > > > >*, std::vector > > > >, std::allocator > > > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >]’: /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements > > >, boost::edge_residual_capacity_t> >, boost::keep_all, boost::filtered_graph > > > >, boost::is_residual_edge > > >, boost::edge_residual_capacity_t> >, boost::keep_all> >, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > > > >*, std::vector > > > >, std::allocator > > > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > > >]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:145:5: required from ‘struct boost::Assignable > > >, boost::edge_residual_capacity_t> >, boost::keep_all, boost::filtered_graph > > > >, boost::is_residual_edge > > >, boost::edge_residual_capacity_t> >, boost::keep_all> >, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > > > >*, std::vector > > > >, std::allocator > > > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:502:3: required from ‘struct boost::InputIterator > > >, boost::edge_residual_capacity_t> >, boost::keep_all, boost::filtered_graph > > > >, boost::is_residual_edge > > >, boost::edge_residual_capacity_t> >, boost::keep_all> >, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > > > >*, std::vector > > > >, std::allocator > > > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::InputIterator > > >, boost::edge_residual_capacity_t> >, boost::keep_all, boost::filtered_graph > > > >, boost::is_residual_edge > > >, boost::edge_residual_capacity_t> >, boost::keep_all> >, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > > > >*, std::vector > > > >, std::allocator > > > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied > > >, boost::edge_residual_capacity_t> >, boost::keep_all, boost::filtered_graph > > > >, boost::is_residual_edge > > >, boost::edge_residual_capacity_t> >, boost::keep_all> >, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > > > >*, std::vector > > > >, std::allocator > > > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > > >::value’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:45:51: [ skipping 9 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/edmonds_karp_max_flow.hpp:101:29: required from ‘typename boost::property_traits::value_type boost::edmonds_karp_max_flow(Graph&, typename graph_traits::vertex_descriptor, typename graph_traits::vertex_descriptor, CapacityEdgeMap, ResidualCapacityEdgeMap, ReverseEdgeMap, ColorMap, PredEdgeMap) [with Graph = adjacency_list > > > >; CapacityEdgeMap = adj_list_edge_property_map > > >, edge_capacity_t>; ResidualCapacityEdgeMap = adj_list_edge_property_map > > >, edge_residual_capacity_t>; ReverseEdgeMap = adj_list_edge_property_map, const detail::edge_desc_impl&, long unsigned int, const property > > >, edge_reverse_t>; ColorMap = iterator_property_map<__gnu_cxx::__normal_iterator >, vec_adj_list_vertex_id_map, default_color_type, default_color_type&>; PredEdgeMap = iterator_property_map<__gnu_cxx::__normal_iterator*, std::vector, std::allocator > > >, vec_adj_list_vertex_id_map, detail::edge_desc_impl, detail::edge_desc_impl&>; typename property_traits::value_type = double; typename graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/edmonds_karp_max_flow.hpp:154:41: required from ‘static typename boost::detail::edge_capacity_value::type boost::detail::edmonds_karp_dispatch2::apply(Graph&, typename boost::graph_traits::vertex_descriptor, typename boost::graph_traits::vertex_descriptor, PredMap, const boost::bgl_named_params&, boost::param_not_found) [with Graph = boost::adjacency_list > > > >; PredMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator*, std::vector, std::allocator > > >, boost::vec_adj_list_vertex_id_map, boost::detail::edge_desc_impl, boost::detail::edge_desc_impl&>; P = int; T = boost::buffer_param_t; R = boost::no_property; typename boost::detail::edge_capacity_value::type = double; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/edmonds_karp_max_flow.hpp:208:54: required from ‘static typename boost::detail::edge_capacity_value::type boost::detail::edmonds_karp_dispatch1::apply(Graph&, typename boost::graph_traits::vertex_descriptor, typename boost::graph_traits::vertex_descriptor, const boost::bgl_named_params&, boost::param_not_found) [with Graph = boost::adjacency_list > > > >; P = int; T = boost::buffer_param_t; R = boost::no_property; typename boost::detail::edge_capacity_value::type = double; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/edmonds_karp_max_flow.hpp:228:57: required from ‘typename boost::detail::edge_capacity_value::type boost::edmonds_karp_max_flow(Graph&, typename graph_traits::vertex_descriptor, typename graph_traits::vertex_descriptor, const bgl_named_params&) [with Graph = adjacency_list > > > >; P = int; T = buffer_param_t; R = no_property; typename detail::edge_capacity_value::type = double; typename graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/edmonds_karp_max_flow.hpp:240:33: required from ‘typename boost::property_traits::const_type>::value_type boost::edmonds_karp_max_flow(Graph&, typename graph_traits::vertex_descriptor, typename graph_traits::vertex_descriptor) [with Graph = adjacency_list > > > >; typename property_traits::const_type>::value_type = double; typename property_map::const_type = adj_list_edge_property_map > > >, edge_capacity_t>; typename graph_traits::vertex_descriptor = long unsigned int]’ sna.cpp:204:54: required from here /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::Assignable::~Assignable() [with TT = boost::iterators::filter_iterator > > >, boost::edge_residual_capacity_t> >, boost::keep_all, boost::filtered_graph > > > >, boost::is_residual_edge > > >, boost::edge_residual_capacity_t> >, boost::keep_all> >, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > > > >*, std::vector > > > >, std::allocator > > > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> >]’ 37 | ~model() | ^ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:145:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 145 | BOOST_CONCEPT_USAGE(Assignable) { | ^~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::EqualityComparable > > >, boost::edge_residual_capacity_t> >, boost::keep_all, boost::filtered_graph > > > >, boost::is_residual_edge > > >, boost::edge_residual_capacity_t> >, boost::keep_all> >, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > > > >*, std::vector > > > >, std::allocator > > > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >]’: /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements > > >, boost::edge_residual_capacity_t> >, boost::keep_all, boost::filtered_graph > > > >, boost::is_residual_edge > > >, boost::edge_residual_capacity_t> >, boost::keep_all> >, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > > > >*, std::vector > > > >, std::allocator > > > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > > >]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:233:5: required from ‘struct boost::EqualityComparable > > >, boost::edge_residual_capacity_t> >, boost::keep_all, boost::filtered_graph > > > >, boost::is_residual_edge > > >, boost::edge_residual_capacity_t> >, boost::keep_all> >, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > > > >*, std::vector > > > >, std::allocator > > > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:502:3: required from ‘struct boost::InputIterator > > >, boost::edge_residual_capacity_t> >, boost::keep_all, boost::filtered_graph > > > >, boost::is_residual_edge > > >, boost::edge_residual_capacity_t> >, boost::keep_all> >, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > > > >*, std::vector > > > >, std::allocator > > > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::InputIterator > > >, boost::edge_residual_capacity_t> >, boost::keep_all, boost::filtered_graph > > > >, boost::is_residual_edge > > >, boost::edge_residual_capacity_t> >, boost::keep_all> >, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > > > >*, std::vector > > > >, std::allocator > > > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied > > >, boost::edge_residual_capacity_t> >, boost::keep_all, boost::filtered_graph > > > >, boost::is_residual_edge > > >, boost::edge_residual_capacity_t> >, boost::keep_all> >, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > > > >*, std::vector > > > >, std::allocator > > > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > > >::value’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:45:51: [ skipping 9 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/edmonds_karp_max_flow.hpp:101:29: required from ‘typename boost::property_traits::value_type boost::edmonds_karp_max_flow(Graph&, typename graph_traits::vertex_descriptor, typename graph_traits::vertex_descriptor, CapacityEdgeMap, ResidualCapacityEdgeMap, ReverseEdgeMap, ColorMap, PredEdgeMap) [with Graph = adjacency_list > > > >; CapacityEdgeMap = adj_list_edge_property_map > > >, edge_capacity_t>; ResidualCapacityEdgeMap = adj_list_edge_property_map > > >, edge_residual_capacity_t>; ReverseEdgeMap = adj_list_edge_property_map, const detail::edge_desc_impl&, long unsigned int, const property > > >, edge_reverse_t>; ColorMap = iterator_property_map<__gnu_cxx::__normal_iterator >, vec_adj_list_vertex_id_map, default_color_type, default_color_type&>; PredEdgeMap = iterator_property_map<__gnu_cxx::__normal_iterator*, std::vector, std::allocator > > >, vec_adj_list_vertex_id_map, detail::edge_desc_impl, detail::edge_desc_impl&>; typename property_traits::value_type = double; typename graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/edmonds_karp_max_flow.hpp:154:41: required from ‘static typename boost::detail::edge_capacity_value::type boost::detail::edmonds_karp_dispatch2::apply(Graph&, typename boost::graph_traits::vertex_descriptor, typename boost::graph_traits::vertex_descriptor, PredMap, const boost::bgl_named_params&, boost::param_not_found) [with Graph = boost::adjacency_list > > > >; PredMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator*, std::vector, std::allocator > > >, boost::vec_adj_list_vertex_id_map, boost::detail::edge_desc_impl, boost::detail::edge_desc_impl&>; P = int; T = boost::buffer_param_t; R = boost::no_property; typename boost::detail::edge_capacity_value::type = double; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/edmonds_karp_max_flow.hpp:208:54: required from ‘static typename boost::detail::edge_capacity_value::type boost::detail::edmonds_karp_dispatch1::apply(Graph&, typename boost::graph_traits::vertex_descriptor, typename boost::graph_traits::vertex_descriptor, const boost::bgl_named_params&, boost::param_not_found) [with Graph = boost::adjacency_list > > > >; P = int; T = boost::buffer_param_t; R = boost::no_property; typename boost::detail::edge_capacity_value::type = double; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/edmonds_karp_max_flow.hpp:228:57: required from ‘typename boost::detail::edge_capacity_value::type boost::edmonds_karp_max_flow(Graph&, typename graph_traits::vertex_descriptor, typename graph_traits::vertex_descriptor, const bgl_named_params&) [with Graph = adjacency_list > > > >; P = int; T = buffer_param_t; R = no_property; typename detail::edge_capacity_value::type = double; typename graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/edmonds_karp_max_flow.hpp:240:33: required from ‘typename boost::property_traits::const_type>::value_type boost::edmonds_karp_max_flow(Graph&, typename graph_traits::vertex_descriptor, typename graph_traits::vertex_descriptor) [with Graph = adjacency_list > > > >; typename property_traits::const_type>::value_type = double; typename property_map::const_type = adj_list_edge_property_map > > >, edge_capacity_t>; typename graph_traits::vertex_descriptor = long unsigned int]’ sna.cpp:204:54: required from here /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::EqualityComparable::~EqualityComparable() [with TT = boost::iterators::filter_iterator > > >, boost::edge_residual_capacity_t> >, boost::keep_all, boost::filtered_graph > > > >, boost::is_residual_edge > > >, boost::edge_residual_capacity_t> >, boost::keep_all> >, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > > > >*, std::vector > > > >, std::allocator > > > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> >]’ 37 | ~model() | ^ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:233:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 233 | BOOST_CONCEPT_USAGE(EqualityComparable) { | ^~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::InputIterator > > >, boost::edge_residual_capacity_t> >, boost::keep_all, boost::filtered_graph > > > >, boost::is_residual_edge > > >, boost::edge_residual_capacity_t> >, boost::keep_all> >, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > > > >*, std::vector > > > >, std::allocator > > > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >]’: /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements > > >, boost::edge_residual_capacity_t> >, boost::keep_all, boost::filtered_graph > > > >, boost::is_residual_edge > > >, boost::edge_residual_capacity_t> >, boost::keep_all> >, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > > > >*, std::vector > > > >, std::allocator > > > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > > >]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:512:7: required from ‘struct boost::InputIterator > > >, boost::edge_residual_capacity_t> >, boost::keep_all, boost::filtered_graph > > > >, boost::is_residual_edge > > >, boost::edge_residual_capacity_t> >, boost::keep_all> >, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > > > >*, std::vector > > > >, std::allocator > > > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::InputIterator > > >, boost::edge_residual_capacity_t> >, boost::keep_all, boost::filtered_graph > > > >, boost::is_residual_edge > > >, boost::edge_residual_capacity_t> >, boost::keep_all> >, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > > > >*, std::vector > > > >, std::allocator > > > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied > > >, boost::edge_residual_capacity_t> >, boost::keep_all, boost::filtered_graph > > > >, boost::is_residual_edge > > >, boost::edge_residual_capacity_t> >, boost::keep_all> >, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > > > >*, std::vector > > > >, std::allocator > > > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > > >::value’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied > > >, boost::edge_residual_capacity_t> >, boost::keep_all, boost::filtered_graph > > > >, boost::is_residual_edge > > >, boost::edge_residual_capacity_t> >, boost::keep_all> >, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > > > >*, std::vector > > > >, std::allocator > > > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > > >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:72:8: [ skipping 8 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/edmonds_karp_max_flow.hpp:101:29: required from ‘typename boost::property_traits::value_type boost::edmonds_karp_max_flow(Graph&, typename graph_traits::vertex_descriptor, typename graph_traits::vertex_descriptor, CapacityEdgeMap, ResidualCapacityEdgeMap, ReverseEdgeMap, ColorMap, PredEdgeMap) [with Graph = adjacency_list > > > >; CapacityEdgeMap = adj_list_edge_property_map > > >, edge_capacity_t>; ResidualCapacityEdgeMap = adj_list_edge_property_map > > >, edge_residual_capacity_t>; ReverseEdgeMap = adj_list_edge_property_map, const detail::edge_desc_impl&, long unsigned int, const property > > >, edge_reverse_t>; ColorMap = iterator_property_map<__gnu_cxx::__normal_iterator >, vec_adj_list_vertex_id_map, default_color_type, default_color_type&>; PredEdgeMap = iterator_property_map<__gnu_cxx::__normal_iterator*, std::vector, std::allocator > > >, vec_adj_list_vertex_id_map, detail::edge_desc_impl, detail::edge_desc_impl&>; typename property_traits::value_type = double; typename graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/edmonds_karp_max_flow.hpp:154:41: required from ‘static typename boost::detail::edge_capacity_value::type boost::detail::edmonds_karp_dispatch2::apply(Graph&, typename boost::graph_traits::vertex_descriptor, typename boost::graph_traits::vertex_descriptor, PredMap, const boost::bgl_named_params&, boost::param_not_found) [with Graph = boost::adjacency_list > > > >; PredMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator*, std::vector, std::allocator > > >, boost::vec_adj_list_vertex_id_map, boost::detail::edge_desc_impl, boost::detail::edge_desc_impl&>; P = int; T = boost::buffer_param_t; R = boost::no_property; typename boost::detail::edge_capacity_value::type = double; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/edmonds_karp_max_flow.hpp:208:54: required from ‘static typename boost::detail::edge_capacity_value::type boost::detail::edmonds_karp_dispatch1::apply(Graph&, typename boost::graph_traits::vertex_descriptor, typename boost::graph_traits::vertex_descriptor, const boost::bgl_named_params&, boost::param_not_found) [with Graph = boost::adjacency_list > > > >; P = int; T = boost::buffer_param_t; R = boost::no_property; typename boost::detail::edge_capacity_value::type = double; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/edmonds_karp_max_flow.hpp:228:57: required from ‘typename boost::detail::edge_capacity_value::type boost::edmonds_karp_max_flow(Graph&, typename graph_traits::vertex_descriptor, typename graph_traits::vertex_descriptor, const bgl_named_params&) [with Graph = adjacency_list > > > >; P = int; T = buffer_param_t; R = no_property; typename detail::edge_capacity_value::type = double; typename graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/edmonds_karp_max_flow.hpp:240:33: required from ‘typename boost::property_traits::const_type>::value_type boost::edmonds_karp_max_flow(Graph&, typename graph_traits::vertex_descriptor, typename graph_traits::vertex_descriptor) [with Graph = adjacency_list > > > >; typename property_traits::const_type>::value_type = double; typename property_map::const_type = adj_list_edge_property_map > > >, edge_capacity_t>; typename graph_traits::vertex_descriptor = long unsigned int]’ sna.cpp:204:54: required from here /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::InputIterator::~InputIterator() [with TT = boost::iterators::filter_iterator > > >, boost::edge_residual_capacity_t> >, boost::keep_all, boost::filtered_graph > > > >, boost::is_residual_edge > > >, boost::edge_residual_capacity_t> >, boost::keep_all> >, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > > > >*, std::vector > > > >, std::allocator > > > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> >]’ 37 | ~model() | ^ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:512:7: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 512 | BOOST_CONCEPT_USAGE(InputIterator) | ^~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::Assignable > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> >]’: /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:145:5: required from ‘struct boost::Assignable > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:502:3: required from ‘struct boost::InputIterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::InputIterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> >]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::value’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:45:51: [ skipping 10 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/dijkstra_shortest_paths.hpp:491:28: required from ‘void boost::dijkstra_shortest_paths(const VertexListGraph&, SourceInputIter, SourceInputIter, PredecessorMap, DistanceMap, WeightMap, IndexMap, Compare, Combine, DistInf, DistZero, DijkstraVisitor) [with VertexListGraph = adjacency_list, property >, no_property, listS>; SourceInputIter = long unsigned int*; DijkstraVisitor = dijkstra_visitor<>; PredecessorMap = dummy_property_map; DistanceMap = vec_adj_list_vertex_property_map, property >, no_property, listS>, adjacency_list, property >, no_property, listS>*, double, double&, vertex_distance_t>; WeightMap = adj_list_edge_property_map >, edge_weight2_t>; IndexMap = vec_adj_list_vertex_id_map, long unsigned int>; Compare = std::less; Combine = closed_plus; DistInf = double; DistZero = double]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/dijkstra_shortest_paths.hpp:505:28: required from ‘void boost::dijkstra_shortest_paths(const VertexListGraph&, typename graph_traits::vertex_descriptor, PredecessorMap, DistanceMap, WeightMap, IndexMap, Compare, Combine, DistInf, DistZero, DijkstraVisitor) [with VertexListGraph = adjacency_list, property >, no_property, listS>; DijkstraVisitor = dijkstra_visitor<>; PredecessorMap = dummy_property_map; DistanceMap = vec_adj_list_vertex_property_map, property >, no_property, listS>, adjacency_list, property >, no_property, listS>*, double, double&, vertex_distance_t>; WeightMap = adj_list_edge_property_map >, edge_weight2_t>; IndexMap = vec_adj_list_vertex_id_map, long unsigned int>; Compare = std::less; Combine = closed_plus; DistInf = double; DistZero = double; typename graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/johnson_all_pairs_shortest.hpp:127:36: required from ‘bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, VertexID, Weight, const BinaryPredicate&, const BinaryFunction&, const Infinity&, DistanceZero) [with VertexAndEdgeListGraph = R_adjacency_list; DistanceMatrix = Basic2DMatrix; VertexID = vec_adj_list_vertex_id_map, long unsigned int>; Weight = adj_list_edge_property_map, edge_weight_t>; BinaryPredicate = std::less; BinaryFunction = closed_plus; Infinity = double; DistanceZero = double]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/johnson_all_pairs_shortest.hpp:164:48: required from ‘bool boost::detail::johnson_dispatch(VertexAndEdgeListGraph&, DistanceMatrix&, const boost::bgl_named_params&, Weight, VertexID) [with VertexAndEdgeListGraph = R_adjacency_list; DistanceMatrix = Basic2DMatrix; P = int; T = int; R = boost::no_property; Weight = boost::adj_list_edge_property_map, boost::edge_weight_t>; VertexID = boost::vec_adj_list_vertex_id_map, long unsigned int>]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/johnson_all_pairs_shortest.hpp:192:36: required from ‘bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&) [with VertexAndEdgeListGraph = R_adjacency_list; DistanceMatrix = Basic2DMatrix]’ sna.cpp:105:41: required from here /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::Assignable::~Assignable() [with TT = boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>]’ 37 | ~model() | ^ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:145:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 145 | BOOST_CONCEPT_USAGE(Assignable) { | ^~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::EqualityComparable > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> >]’: /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:233:5: required from ‘struct boost::EqualityComparable > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:502:3: required from ‘struct boost::InputIterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::InputIterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> >]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::value’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:45:51: [ skipping 10 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/dijkstra_shortest_paths.hpp:491:28: required from ‘void boost::dijkstra_shortest_paths(const VertexListGraph&, SourceInputIter, SourceInputIter, PredecessorMap, DistanceMap, WeightMap, IndexMap, Compare, Combine, DistInf, DistZero, DijkstraVisitor) [with VertexListGraph = adjacency_list, property >, no_property, listS>; SourceInputIter = long unsigned int*; DijkstraVisitor = dijkstra_visitor<>; PredecessorMap = dummy_property_map; DistanceMap = vec_adj_list_vertex_property_map, property >, no_property, listS>, adjacency_list, property >, no_property, listS>*, double, double&, vertex_distance_t>; WeightMap = adj_list_edge_property_map >, edge_weight2_t>; IndexMap = vec_adj_list_vertex_id_map, long unsigned int>; Compare = std::less; Combine = closed_plus; DistInf = double; DistZero = double]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/dijkstra_shortest_paths.hpp:505:28: required from ‘void boost::dijkstra_shortest_paths(const VertexListGraph&, typename graph_traits::vertex_descriptor, PredecessorMap, DistanceMap, WeightMap, IndexMap, Compare, Combine, DistInf, DistZero, DijkstraVisitor) [with VertexListGraph = adjacency_list, property >, no_property, listS>; DijkstraVisitor = dijkstra_visitor<>; PredecessorMap = dummy_property_map; DistanceMap = vec_adj_list_vertex_property_map, property >, no_property, listS>, adjacency_list, property >, no_property, listS>*, double, double&, vertex_distance_t>; WeightMap = adj_list_edge_property_map >, edge_weight2_t>; IndexMap = vec_adj_list_vertex_id_map, long unsigned int>; Compare = std::less; Combine = closed_plus; DistInf = double; DistZero = double; typename graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/johnson_all_pairs_shortest.hpp:127:36: required from ‘bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, VertexID, Weight, const BinaryPredicate&, const BinaryFunction&, const Infinity&, DistanceZero) [with VertexAndEdgeListGraph = R_adjacency_list; DistanceMatrix = Basic2DMatrix; VertexID = vec_adj_list_vertex_id_map, long unsigned int>; Weight = adj_list_edge_property_map, edge_weight_t>; BinaryPredicate = std::less; BinaryFunction = closed_plus; Infinity = double; DistanceZero = double]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/johnson_all_pairs_shortest.hpp:164:48: required from ‘bool boost::detail::johnson_dispatch(VertexAndEdgeListGraph&, DistanceMatrix&, const boost::bgl_named_params&, Weight, VertexID) [with VertexAndEdgeListGraph = R_adjacency_list; DistanceMatrix = Basic2DMatrix; P = int; T = int; R = boost::no_property; Weight = boost::adj_list_edge_property_map, boost::edge_weight_t>; VertexID = boost::vec_adj_list_vertex_id_map, long unsigned int>]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/johnson_all_pairs_shortest.hpp:192:36: required from ‘bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&) [with VertexAndEdgeListGraph = R_adjacency_list; DistanceMatrix = Basic2DMatrix]’ sna.cpp:105:41: required from here /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::EqualityComparable::~EqualityComparable() [with TT = boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>]’ 37 | ~model() | ^ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:233:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 233 | BOOST_CONCEPT_USAGE(EqualityComparable) { | ^~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::InputIterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> >]’: /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:512:7: required from ‘struct boost::InputIterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::InputIterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> >]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::value’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:72:8: [ skipping 9 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/dijkstra_shortest_paths.hpp:491:28: required from ‘void boost::dijkstra_shortest_paths(const VertexListGraph&, SourceInputIter, SourceInputIter, PredecessorMap, DistanceMap, WeightMap, IndexMap, Compare, Combine, DistInf, DistZero, DijkstraVisitor) [with VertexListGraph = adjacency_list, property >, no_property, listS>; SourceInputIter = long unsigned int*; DijkstraVisitor = dijkstra_visitor<>; PredecessorMap = dummy_property_map; DistanceMap = vec_adj_list_vertex_property_map, property >, no_property, listS>, adjacency_list, property >, no_property, listS>*, double, double&, vertex_distance_t>; WeightMap = adj_list_edge_property_map >, edge_weight2_t>; IndexMap = vec_adj_list_vertex_id_map, long unsigned int>; Compare = std::less; Combine = closed_plus; DistInf = double; DistZero = double]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/dijkstra_shortest_paths.hpp:505:28: required from ‘void boost::dijkstra_shortest_paths(const VertexListGraph&, typename graph_traits::vertex_descriptor, PredecessorMap, DistanceMap, WeightMap, IndexMap, Compare, Combine, DistInf, DistZero, DijkstraVisitor) [with VertexListGraph = adjacency_list, property >, no_property, listS>; DijkstraVisitor = dijkstra_visitor<>; PredecessorMap = dummy_property_map; DistanceMap = vec_adj_list_vertex_property_map, property >, no_property, listS>, adjacency_list, property >, no_property, listS>*, double, double&, vertex_distance_t>; WeightMap = adj_list_edge_property_map >, edge_weight2_t>; IndexMap = vec_adj_list_vertex_id_map, long unsigned int>; Compare = std::less; Combine = closed_plus; DistInf = double; DistZero = double; typename graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/johnson_all_pairs_shortest.hpp:127:36: required from ‘bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, VertexID, Weight, const BinaryPredicate&, const BinaryFunction&, const Infinity&, DistanceZero) [with VertexAndEdgeListGraph = R_adjacency_list; DistanceMatrix = Basic2DMatrix; VertexID = vec_adj_list_vertex_id_map, long unsigned int>; Weight = adj_list_edge_property_map, edge_weight_t>; BinaryPredicate = std::less; BinaryFunction = closed_plus; Infinity = double; DistanceZero = double]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/johnson_all_pairs_shortest.hpp:164:48: required from ‘bool boost::detail::johnson_dispatch(VertexAndEdgeListGraph&, DistanceMatrix&, const boost::bgl_named_params&, Weight, VertexID) [with VertexAndEdgeListGraph = R_adjacency_list; DistanceMatrix = Basic2DMatrix; P = int; T = int; R = boost::no_property; Weight = boost::adj_list_edge_property_map, boost::edge_weight_t>; VertexID = boost::vec_adj_list_vertex_id_map, long unsigned int>]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/johnson_all_pairs_shortest.hpp:192:36: required from ‘bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&) [with VertexAndEdgeListGraph = R_adjacency_list; DistanceMatrix = Basic2DMatrix]’ sna.cpp:105:41: required from here /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::InputIterator::~InputIterator() [with TT = boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>]’ 37 | ~model() | ^ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:512:7: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 512 | BOOST_CONCEPT_USAGE(InputIterator) | ^~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements, std::input_iterator_tag> >]’: /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:208:5: required from ‘struct boost::Convertible, std::input_iterator_tag>’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::Convertible, std::input_iterator_tag>]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied, std::input_iterator_tag> >::value’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied, std::input_iterator_tag> >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_, std::input_iterator_tag>)>’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:515:9: [ skipping 9 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/edmonds_karp_max_flow.hpp:101:29: required from ‘typename boost::property_traits::value_type boost::edmonds_karp_max_flow(Graph&, typename graph_traits::vertex_descriptor, typename graph_traits::vertex_descriptor, CapacityEdgeMap, ResidualCapacityEdgeMap, ReverseEdgeMap, ColorMap, PredEdgeMap) [with Graph = adjacency_list > > > >; CapacityEdgeMap = adj_list_edge_property_map > > >, edge_capacity_t>; ResidualCapacityEdgeMap = adj_list_edge_property_map > > >, edge_residual_capacity_t>; ReverseEdgeMap = adj_list_edge_property_map, const detail::edge_desc_impl&, long unsigned int, const property > > >, edge_reverse_t>; ColorMap = iterator_property_map<__gnu_cxx::__normal_iterator >, vec_adj_list_vertex_id_map, default_color_type, default_color_type&>; PredEdgeMap = iterator_property_map<__gnu_cxx::__normal_iterator*, std::vector, std::allocator > > >, vec_adj_list_vertex_id_map, detail::edge_desc_impl, detail::edge_desc_impl&>; typename property_traits::value_type = double; typename graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/edmonds_karp_max_flow.hpp:154:41: required from ‘static typename boost::detail::edge_capacity_value::type boost::detail::edmonds_karp_dispatch2::apply(Graph&, typename boost::graph_traits::vertex_descriptor, typename boost::graph_traits::vertex_descriptor, PredMap, const boost::bgl_named_params&, boost::param_not_found) [with Graph = boost::adjacency_list > > > >; PredMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator*, std::vector, std::allocator > > >, boost::vec_adj_list_vertex_id_map, boost::detail::edge_desc_impl, boost::detail::edge_desc_impl&>; P = int; T = boost::buffer_param_t; R = boost::no_property; typename boost::detail::edge_capacity_value::type = double; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/edmonds_karp_max_flow.hpp:208:54: required from ‘static typename boost::detail::edge_capacity_value::type boost::detail::edmonds_karp_dispatch1::apply(Graph&, typename boost::graph_traits::vertex_descriptor, typename boost::graph_traits::vertex_descriptor, const boost::bgl_named_params&, boost::param_not_found) [with Graph = boost::adjacency_list > > > >; P = int; T = boost::buffer_param_t; R = boost::no_property; typename boost::detail::edge_capacity_value::type = double; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/edmonds_karp_max_flow.hpp:228:57: required from ‘typename boost::detail::edge_capacity_value::type boost::edmonds_karp_max_flow(Graph&, typename graph_traits::vertex_descriptor, typename graph_traits::vertex_descriptor, const bgl_named_params&) [with Graph = adjacency_list > > > >; P = int; T = buffer_param_t; R = no_property; typename detail::edge_capacity_value::type = double; typename graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/edmonds_karp_max_flow.hpp:240:33: required from ‘typename boost::property_traits::const_type>::value_type boost::edmonds_karp_max_flow(Graph&, typename graph_traits::vertex_descriptor, typename graph_traits::vertex_descriptor) [with Graph = adjacency_list > > > >; typename property_traits::const_type>::value_type = double; typename property_map::const_type = adj_list_edge_property_map > > >, edge_capacity_t>; typename graph_traits::vertex_descriptor = long unsigned int]’ sna.cpp:204:54: required from here /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::Convertible, std::input_iterator_tag>]’ 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ^ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::Convertible, std::input_iterator_tag>]’: /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:515:9: required from ‘boost::InputIterator::~InputIterator() [with TT = boost::iterators::filter_iterator > > >, boost::edge_residual_capacity_t> >, boost::keep_all, boost::filtered_graph > > > >, boost::is_residual_edge > > >, boost::edge_residual_capacity_t> >, boost::keep_all> >, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > > > >*, std::vector > > > >, std::allocator > > > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> >]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::InputIterator > > >, boost::edge_residual_capacity_t> >, boost::keep_all, boost::filtered_graph > > > >, boost::is_residual_edge > > >, boost::edge_residual_capacity_t> >, boost::keep_all> >, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > > > >*, std::vector > > > >, std::allocator > > > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/graph_concepts.hpp:53:35: required from ‘boost::concepts::MultiPassInputIterator::~MultiPassInputIterator() [with T = boost::iterators::filter_iterator > > >, boost::edge_residual_capacity_t> >, boost::keep_all, boost::filtered_graph > > > >, boost::is_residual_edge > > >, boost::edge_residual_capacity_t> >, boost::keep_all> >, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > > > >*, std::vector > > > >, std::allocator > > > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> >]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::MultiPassInputIterator > > >, boost::edge_residual_capacity_t> >, boost::keep_all, boost::filtered_graph > > > >, boost::is_residual_edge > > >, boost::edge_residual_capacity_t> >, boost::keep_all> >, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > > > >*, std::vector > > > >, std::allocator > > > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/graph_concepts.hpp:89:9: required from ‘boost::concepts::IncidenceGraph::~IncidenceGraph() [with G = boost::filtered_graph > > > >, boost::is_residual_edge > > >, boost::edge_residual_capacity_t> >, boost::keep_all>]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/graph_concepts.hpp:75:1: [ skipping 4 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/edmonds_karp_max_flow.hpp:101:29: required from ‘typename boost::property_traits::value_type boost::edmonds_karp_max_flow(Graph&, typename graph_traits::vertex_descriptor, typename graph_traits::vertex_descriptor, CapacityEdgeMap, ResidualCapacityEdgeMap, ReverseEdgeMap, ColorMap, PredEdgeMap) [with Graph = adjacency_list > > > >; CapacityEdgeMap = adj_list_edge_property_map > > >, edge_capacity_t>; ResidualCapacityEdgeMap = adj_list_edge_property_map > > >, edge_residual_capacity_t>; ReverseEdgeMap = adj_list_edge_property_map, const detail::edge_desc_impl&, long unsigned int, const property > > >, edge_reverse_t>; ColorMap = iterator_property_map<__gnu_cxx::__normal_iterator >, vec_adj_list_vertex_id_map, default_color_type, default_color_type&>; PredEdgeMap = iterator_property_map<__gnu_cxx::__normal_iterator*, std::vector, std::allocator > > >, vec_adj_list_vertex_id_map, detail::edge_desc_impl, detail::edge_desc_impl&>; typename property_traits::value_type = double; typename graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/edmonds_karp_max_flow.hpp:154:41: required from ‘static typename boost::detail::edge_capacity_value::type boost::detail::edmonds_karp_dispatch2::apply(Graph&, typename boost::graph_traits::vertex_descriptor, typename boost::graph_traits::vertex_descriptor, PredMap, const boost::bgl_named_params&, boost::param_not_found) [with Graph = boost::adjacency_list > > > >; PredMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator*, std::vector, std::allocator > > >, boost::vec_adj_list_vertex_id_map, boost::detail::edge_desc_impl, boost::detail::edge_desc_impl&>; P = int; T = boost::buffer_param_t; R = boost::no_property; typename boost::detail::edge_capacity_value::type = double; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/edmonds_karp_max_flow.hpp:208:54: required from ‘static typename boost::detail::edge_capacity_value::type boost::detail::edmonds_karp_dispatch1::apply(Graph&, typename boost::graph_traits::vertex_descriptor, typename boost::graph_traits::vertex_descriptor, const boost::bgl_named_params&, boost::param_not_found) [with Graph = boost::adjacency_list > > > >; P = int; T = boost::buffer_param_t; R = boost::no_property; typename boost::detail::edge_capacity_value::type = double; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/edmonds_karp_max_flow.hpp:228:57: required from ‘typename boost::detail::edge_capacity_value::type boost::edmonds_karp_max_flow(Graph&, typename graph_traits::vertex_descriptor, typename graph_traits::vertex_descriptor, const bgl_named_params&) [with Graph = adjacency_list > > > >; P = int; T = buffer_param_t; R = no_property; typename detail::edge_capacity_value::type = double; typename graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/edmonds_karp_max_flow.hpp:240:33: required from ‘typename boost::property_traits::const_type>::value_type boost::edmonds_karp_max_flow(Graph&, typename graph_traits::vertex_descriptor, typename graph_traits::vertex_descriptor) [with Graph = adjacency_list > > > >; typename property_traits::const_type>::value_type = double; typename property_map::const_type = adj_list_edge_property_map > > >, edge_capacity_t>; typename graph_traits::vertex_descriptor = long unsigned int]’ sna.cpp:204:54: required from here /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::Convertible::~Convertible() [with X = boost::iterators::detail::iterator_category_with_traversal; Y = std::input_iterator_tag]’ 37 | ~model() | ^ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:208:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 208 | BOOST_CONCEPT_USAGE(Convertible) { | ^~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements, std::input_iterator_tag> >]’: /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:208:5: required from ‘struct boost::Convertible, std::input_iterator_tag>’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::Convertible, std::input_iterator_tag>]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied, std::input_iterator_tag> >::value’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied, std::input_iterator_tag> >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_, std::input_iterator_tag>)>’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:515:9: [ skipping 10 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/dijkstra_shortest_paths.hpp:491:28: required from ‘void boost::dijkstra_shortest_paths(const VertexListGraph&, SourceInputIter, SourceInputIter, PredecessorMap, DistanceMap, WeightMap, IndexMap, Compare, Combine, DistInf, DistZero, DijkstraVisitor) [with VertexListGraph = adjacency_list, property >, no_property, listS>; SourceInputIter = long unsigned int*; DijkstraVisitor = dijkstra_visitor<>; PredecessorMap = dummy_property_map; DistanceMap = vec_adj_list_vertex_property_map, property >, no_property, listS>, adjacency_list, property >, no_property, listS>*, double, double&, vertex_distance_t>; WeightMap = adj_list_edge_property_map >, edge_weight2_t>; IndexMap = vec_adj_list_vertex_id_map, long unsigned int>; Compare = std::less; Combine = closed_plus; DistInf = double; DistZero = double]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/dijkstra_shortest_paths.hpp:505:28: required from ‘void boost::dijkstra_shortest_paths(const VertexListGraph&, typename graph_traits::vertex_descriptor, PredecessorMap, DistanceMap, WeightMap, IndexMap, Compare, Combine, DistInf, DistZero, DijkstraVisitor) [with VertexListGraph = adjacency_list, property >, no_property, listS>; DijkstraVisitor = dijkstra_visitor<>; PredecessorMap = dummy_property_map; DistanceMap = vec_adj_list_vertex_property_map, property >, no_property, listS>, adjacency_list, property >, no_property, listS>*, double, double&, vertex_distance_t>; WeightMap = adj_list_edge_property_map >, edge_weight2_t>; IndexMap = vec_adj_list_vertex_id_map, long unsigned int>; Compare = std::less; Combine = closed_plus; DistInf = double; DistZero = double; typename graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/johnson_all_pairs_shortest.hpp:127:36: required from ‘bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, VertexID, Weight, const BinaryPredicate&, const BinaryFunction&, const Infinity&, DistanceZero) [with VertexAndEdgeListGraph = R_adjacency_list; DistanceMatrix = Basic2DMatrix; VertexID = vec_adj_list_vertex_id_map, long unsigned int>; Weight = adj_list_edge_property_map, edge_weight_t>; BinaryPredicate = std::less; BinaryFunction = closed_plus; Infinity = double; DistanceZero = double]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/johnson_all_pairs_shortest.hpp:164:48: required from ‘bool boost::detail::johnson_dispatch(VertexAndEdgeListGraph&, DistanceMatrix&, const boost::bgl_named_params&, Weight, VertexID) [with VertexAndEdgeListGraph = R_adjacency_list; DistanceMatrix = Basic2DMatrix; P = int; T = int; R = boost::no_property; Weight = boost::adj_list_edge_property_map, boost::edge_weight_t>; VertexID = boost::vec_adj_list_vertex_id_map, long unsigned int>]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/johnson_all_pairs_shortest.hpp:192:36: required from ‘bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&) [with VertexAndEdgeListGraph = R_adjacency_list; DistanceMatrix = Basic2DMatrix]’ sna.cpp:105:41: required from here /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::Convertible, std::input_iterator_tag>]’ 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ^ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::Convertible, std::input_iterator_tag>]’: /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:515:9: required from ‘boost::InputIterator::~InputIterator() [with TT = boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::InputIterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> >]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/graph_concepts.hpp:53:35: required from ‘boost::concepts::MultiPassInputIterator::~MultiPassInputIterator() [with T = boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::MultiPassInputIterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> >]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/graph_concepts.hpp:89:9: required from ‘boost::concepts::IncidenceGraph::~IncidenceGraph() [with G = boost::adjacency_list, boost::property >, boost::no_property, boost::listS>]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/graph_concepts.hpp:75:1: [ skipping 5 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/dijkstra_shortest_paths.hpp:491:28: required from ‘void boost::dijkstra_shortest_paths(const VertexListGraph&, SourceInputIter, SourceInputIter, PredecessorMap, DistanceMap, WeightMap, IndexMap, Compare, Combine, DistInf, DistZero, DijkstraVisitor) [with VertexListGraph = adjacency_list, property >, no_property, listS>; SourceInputIter = long unsigned int*; DijkstraVisitor = dijkstra_visitor<>; PredecessorMap = dummy_property_map; DistanceMap = vec_adj_list_vertex_property_map, property >, no_property, listS>, adjacency_list, property >, no_property, listS>*, double, double&, vertex_distance_t>; WeightMap = adj_list_edge_property_map >, edge_weight2_t>; IndexMap = vec_adj_list_vertex_id_map, long unsigned int>; Compare = std::less; Combine = closed_plus; DistInf = double; DistZero = double]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/dijkstra_shortest_paths.hpp:505:28: required from ‘void boost::dijkstra_shortest_paths(const VertexListGraph&, typename graph_traits::vertex_descriptor, PredecessorMap, DistanceMap, WeightMap, IndexMap, Compare, Combine, DistInf, DistZero, DijkstraVisitor) [with VertexListGraph = adjacency_list, property >, no_property, listS>; DijkstraVisitor = dijkstra_visitor<>; PredecessorMap = dummy_property_map; DistanceMap = vec_adj_list_vertex_property_map, property >, no_property, listS>, adjacency_list, property >, no_property, listS>*, double, double&, vertex_distance_t>; WeightMap = adj_list_edge_property_map >, edge_weight2_t>; IndexMap = vec_adj_list_vertex_id_map, long unsigned int>; Compare = std::less; Combine = closed_plus; DistInf = double; DistZero = double; typename graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/johnson_all_pairs_shortest.hpp:127:36: required from ‘bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, VertexID, Weight, const BinaryPredicate&, const BinaryFunction&, const Infinity&, DistanceZero) [with VertexAndEdgeListGraph = R_adjacency_list; DistanceMatrix = Basic2DMatrix; VertexID = vec_adj_list_vertex_id_map, long unsigned int>; Weight = adj_list_edge_property_map, edge_weight_t>; BinaryPredicate = std::less; BinaryFunction = closed_plus; Infinity = double; DistanceZero = double]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/johnson_all_pairs_shortest.hpp:164:48: required from ‘bool boost::detail::johnson_dispatch(VertexAndEdgeListGraph&, DistanceMatrix&, const boost::bgl_named_params&, Weight, VertexID) [with VertexAndEdgeListGraph = R_adjacency_list; DistanceMatrix = Basic2DMatrix; P = int; T = int; R = boost::no_property; Weight = boost::adj_list_edge_property_map, boost::edge_weight_t>; VertexID = boost::vec_adj_list_vertex_id_map, long unsigned int>]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/johnson_all_pairs_shortest.hpp:192:36: required from ‘bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&) [with VertexAndEdgeListGraph = R_adjacency_list; DistanceMatrix = Basic2DMatrix]’ sna.cpp:105:41: required from here /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::Convertible::~Convertible() [with X = boost::iterators::detail::iterator_category_with_traversal; Y = std::input_iterator_tag]’ 37 | ~model() | ^ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:208:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 208 | BOOST_CONCEPT_USAGE(Convertible) { | ^~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::Convertible, std::input_iterator_tag>]’: /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements, std::input_iterator_tag> >]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:208:5: required from ‘struct boost::Convertible, std::input_iterator_tag>’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::Convertible, std::input_iterator_tag>]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied, std::input_iterator_tag> >::value’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied, std::input_iterator_tag> >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:72:8: [ skipping 10 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/edmonds_karp_max_flow.hpp:101:29: required from ‘typename boost::property_traits::value_type boost::edmonds_karp_max_flow(Graph&, typename graph_traits::vertex_descriptor, typename graph_traits::vertex_descriptor, CapacityEdgeMap, ResidualCapacityEdgeMap, ReverseEdgeMap, ColorMap, PredEdgeMap) [with Graph = adjacency_list > > > >; CapacityEdgeMap = adj_list_edge_property_map > > >, edge_capacity_t>; ResidualCapacityEdgeMap = adj_list_edge_property_map > > >, edge_residual_capacity_t>; ReverseEdgeMap = adj_list_edge_property_map, const detail::edge_desc_impl&, long unsigned int, const property > > >, edge_reverse_t>; ColorMap = iterator_property_map<__gnu_cxx::__normal_iterator >, vec_adj_list_vertex_id_map, default_color_type, default_color_type&>; PredEdgeMap = iterator_property_map<__gnu_cxx::__normal_iterator*, std::vector, std::allocator > > >, vec_adj_list_vertex_id_map, detail::edge_desc_impl, detail::edge_desc_impl&>; typename property_traits::value_type = double; typename graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/edmonds_karp_max_flow.hpp:154:41: required from ‘static typename boost::detail::edge_capacity_value::type boost::detail::edmonds_karp_dispatch2::apply(Graph&, typename boost::graph_traits::vertex_descriptor, typename boost::graph_traits::vertex_descriptor, PredMap, const boost::bgl_named_params&, boost::param_not_found) [with Graph = boost::adjacency_list > > > >; PredMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator*, std::vector, std::allocator > > >, boost::vec_adj_list_vertex_id_map, boost::detail::edge_desc_impl, boost::detail::edge_desc_impl&>; P = int; T = boost::buffer_param_t; R = boost::no_property; typename boost::detail::edge_capacity_value::type = double; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/edmonds_karp_max_flow.hpp:208:54: required from ‘static typename boost::detail::edge_capacity_value::type boost::detail::edmonds_karp_dispatch1::apply(Graph&, typename boost::graph_traits::vertex_descriptor, typename boost::graph_traits::vertex_descriptor, const boost::bgl_named_params&, boost::param_not_found) [with Graph = boost::adjacency_list > > > >; P = int; T = boost::buffer_param_t; R = boost::no_property; typename boost::detail::edge_capacity_value::type = double; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/edmonds_karp_max_flow.hpp:228:57: required from ‘typename boost::detail::edge_capacity_value::type boost::edmonds_karp_max_flow(Graph&, typename graph_traits::vertex_descriptor, typename graph_traits::vertex_descriptor, const bgl_named_params&) [with Graph = adjacency_list > > > >; P = int; T = buffer_param_t; R = no_property; typename detail::edge_capacity_value::type = double; typename graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/edmonds_karp_max_flow.hpp:240:33: required from ‘typename boost::property_traits::const_type>::value_type boost::edmonds_karp_max_flow(Graph&, typename graph_traits::vertex_descriptor, typename graph_traits::vertex_descriptor) [with Graph = adjacency_list > > > >; typename property_traits::const_type>::value_type = double; typename property_map::const_type = adj_list_edge_property_map > > >, edge_capacity_t>; typename graph_traits::vertex_descriptor = long unsigned int]’ sna.cpp:204:54: required from here /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::Convertible::~Convertible() [with X = boost::iterators::detail::iterator_category_with_traversal; Y = std::input_iterator_tag]’ 37 | ~model() | ^ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:208:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 208 | BOOST_CONCEPT_USAGE(Convertible) { | ^~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::Convertible, std::input_iterator_tag>]’: /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements, std::input_iterator_tag> >]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:208:5: required from ‘struct boost::Convertible, std::input_iterator_tag>’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::Convertible, std::input_iterator_tag>]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied, std::input_iterator_tag> >::value’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied, std::input_iterator_tag> >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:72:8: [ skipping 11 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/dijkstra_shortest_paths.hpp:491:28: required from ‘void boost::dijkstra_shortest_paths(const VertexListGraph&, SourceInputIter, SourceInputIter, PredecessorMap, DistanceMap, WeightMap, IndexMap, Compare, Combine, DistInf, DistZero, DijkstraVisitor) [with VertexListGraph = adjacency_list, property >, no_property, listS>; SourceInputIter = long unsigned int*; DijkstraVisitor = dijkstra_visitor<>; PredecessorMap = dummy_property_map; DistanceMap = vec_adj_list_vertex_property_map, property >, no_property, listS>, adjacency_list, property >, no_property, listS>*, double, double&, vertex_distance_t>; WeightMap = adj_list_edge_property_map >, edge_weight2_t>; IndexMap = vec_adj_list_vertex_id_map, long unsigned int>; Compare = std::less; Combine = closed_plus; DistInf = double; DistZero = double]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/dijkstra_shortest_paths.hpp:505:28: required from ‘void boost::dijkstra_shortest_paths(const VertexListGraph&, typename graph_traits::vertex_descriptor, PredecessorMap, DistanceMap, WeightMap, IndexMap, Compare, Combine, DistInf, DistZero, DijkstraVisitor) [with VertexListGraph = adjacency_list, property >, no_property, listS>; DijkstraVisitor = dijkstra_visitor<>; PredecessorMap = dummy_property_map; DistanceMap = vec_adj_list_vertex_property_map, property >, no_property, listS>, adjacency_list, property >, no_property, listS>*, double, double&, vertex_distance_t>; WeightMap = adj_list_edge_property_map >, edge_weight2_t>; IndexMap = vec_adj_list_vertex_id_map, long unsigned int>; Compare = std::less; Combine = closed_plus; DistInf = double; DistZero = double; typename graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/johnson_all_pairs_shortest.hpp:127:36: required from ‘bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, VertexID, Weight, const BinaryPredicate&, const BinaryFunction&, const Infinity&, DistanceZero) [with VertexAndEdgeListGraph = R_adjacency_list; DistanceMatrix = Basic2DMatrix; VertexID = vec_adj_list_vertex_id_map, long unsigned int>; Weight = adj_list_edge_property_map, edge_weight_t>; BinaryPredicate = std::less; BinaryFunction = closed_plus; Infinity = double; DistanceZero = double]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/johnson_all_pairs_shortest.hpp:164:48: required from ‘bool boost::detail::johnson_dispatch(VertexAndEdgeListGraph&, DistanceMatrix&, const boost::bgl_named_params&, Weight, VertexID) [with VertexAndEdgeListGraph = R_adjacency_list; DistanceMatrix = Basic2DMatrix; P = int; T = int; R = boost::no_property; Weight = boost::adj_list_edge_property_map, boost::edge_weight_t>; VertexID = boost::vec_adj_list_vertex_id_map, long unsigned int>]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/johnson_all_pairs_shortest.hpp:192:36: required from ‘bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&) [with VertexAndEdgeListGraph = R_adjacency_list; DistanceMatrix = Basic2DMatrix]’ sna.cpp:105:41: required from here /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::Convertible::~Convertible() [with X = boost::iterators::detail::iterator_category_with_traversal; Y = std::input_iterator_tag]’ 37 | ~model() | ^ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:208:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 208 | BOOST_CONCEPT_USAGE(Convertible) { | ^~~~~~~~~~~~~~~~~~~ g++ -std=gnu++17 -I"/usr/share/R/include" -DNDEBUG -I'/home/omnipath/local/R/4.4-3.20/BH/include' -fpic -g -O2 -fno-omit-frame-pointer -mno-omit-leaf-frame-pointer -ffile-prefix-map=/build/r-base-EawLoD/r-base-4.4.1=. -fstack-protector-strong -fstack-clash-protection -Wformat -Werror=format-security -fcf-protection -fdebug-prefix-map=/build/r-base-EawLoD/r-base-4.4.1=/usr/src/r-base-4.4.1-1.2404.0 -Wdate-time -D_FORTIFY_SOURCE=3 -c transitive_closure.cpp -o transitive_closure.o In file included from /home/omnipath/local/R/4.4-3.20/BH/include/boost/bind/mem_fn.hpp:25, from /home/omnipath/local/R/4.4-3.20/BH/include/boost/bind/bind.hpp:26, from /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/transitive_closure.hpp:16, from transitive_closure.cpp:16: /home/omnipath/local/R/4.4-3.20/BH/include/boost/get_pointer.hpp:48:40: warning: ‘template class std::auto_ptr’ is deprecated: use 'std::unique_ptr' instead [-Wdeprecated-declarations] 48 | template T * get_pointer(std::auto_ptr const& p) | ^~~~~~~~ In file included from /usr/include/c++/13/memory:78, from /home/omnipath/local/R/4.4-3.20/BH/include/boost/config/no_tr1/memory.hpp:21, from /home/omnipath/local/R/4.4-3.20/BH/include/boost/get_pointer.hpp:14: /usr/include/c++/13/bits/unique_ptr.h:65:28: note: declared here 65 | template class auto_ptr; | ^~~~~~~~ In file included from /home/omnipath/local/R/4.4-3.20/BH/include/boost/smart_ptr/shared_ptr.hpp:18, from /home/omnipath/local/R/4.4-3.20/BH/include/boost/property_map/vector_property_map.hpp:14, from /home/omnipath/local/R/4.4-3.20/BH/include/boost/property_map/property_map.hpp:598, from /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/graph_concepts.hpp:17, from /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/depth_first_search.hpp:18, from /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/strong_components.hpp:17, from /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/transitive_closure.hpp:17: /home/omnipath/local/R/4.4-3.20/BH/include/boost/smart_ptr/detail/shared_count.hpp:361:33: warning: ‘template class std::auto_ptr’ is deprecated: use 'std::unique_ptr' instead [-Wdeprecated-declarations] 361 | explicit shared_count( std::auto_ptr & r ): pi_( new sp_counted_impl_p( r.get() ) ) | ^~~~~~~~ /usr/include/c++/13/bits/unique_ptr.h:65:28: note: declared here 65 | template class auto_ptr; | ^~~~~~~~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/smart_ptr/shared_ptr.hpp:251:65: warning: ‘template class std::auto_ptr’ is deprecated: use 'std::unique_ptr' instead [-Wdeprecated-declarations] 251 | template< class T, class R > struct sp_enable_if_auto_ptr< std::auto_ptr< T >, R > | ^~~~~~~~ /usr/include/c++/13/bits/unique_ptr.h:65:28: note: declared here 65 | template class auto_ptr; | ^~~~~~~~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/smart_ptr/shared_ptr.hpp:508:31: warning: ‘template class std::auto_ptr’ is deprecated: use 'std::unique_ptr' instead [-Wdeprecated-declarations] 508 | explicit shared_ptr( std::auto_ptr & r ): px(r.get()), pn() | ^~~~~~~~ /usr/include/c++/13/bits/unique_ptr.h:65:28: note: declared here 65 | template class auto_ptr; | ^~~~~~~~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/smart_ptr/shared_ptr.hpp:521:22: warning: ‘template class std::auto_ptr’ is deprecated: use 'std::unique_ptr' instead [-Wdeprecated-declarations] 521 | shared_ptr( std::auto_ptr && r ): px(r.get()), pn() | ^~~~~~~~ /usr/include/c++/13/bits/unique_ptr.h:65:28: note: declared here 65 | template class auto_ptr; | ^~~~~~~~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/smart_ptr/shared_ptr.hpp:604:34: warning: ‘template class std::auto_ptr’ is deprecated: use 'std::unique_ptr' instead [-Wdeprecated-declarations] 604 | shared_ptr & operator=( std::auto_ptr & r ) | ^~~~~~~~ /usr/include/c++/13/bits/unique_ptr.h:65:28: note: declared here 65 | template class auto_ptr; | ^~~~~~~~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/smart_ptr/shared_ptr.hpp:613:34: warning: ‘template class std::auto_ptr’ is deprecated: use 'std::unique_ptr' instead [-Wdeprecated-declarations] 613 | shared_ptr & operator=( std::auto_ptr && r ) | ^~~~~~~~ /usr/include/c++/13/bits/unique_ptr.h:65:28: note: declared here 65 | template class auto_ptr; | ^~~~~~~~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/smart_ptr/shared_ptr.hpp: In member function ‘boost::shared_ptr& boost::shared_ptr::operator=(std::auto_ptr<_Up>&&)’: /home/omnipath/local/R/4.4-3.20/BH/include/boost/smart_ptr/shared_ptr.hpp:615:38: warning: ‘template class std::auto_ptr’ is deprecated: use 'std::unique_ptr' instead [-Wdeprecated-declarations] 615 | this_type( static_cast< std::auto_ptr && >( r ) ).swap( *this ); | ^~~~~~~~ /usr/include/c++/13/bits/unique_ptr.h:65:28: note: declared here 65 | template class auto_ptr; | ^~~~~~~~ In file included from /home/omnipath/local/R/4.4-3.20/BH/include/boost/scoped_ptr.hpp:13, from /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/adjacency_list.hpp:22, from /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/transitive_closure.hpp:21: /home/omnipath/local/R/4.4-3.20/BH/include/boost/smart_ptr/scoped_ptr.hpp: At global scope: /home/omnipath/local/R/4.4-3.20/BH/include/boost/smart_ptr/scoped_ptr.hpp:75:31: warning: ‘template class std::auto_ptr’ is deprecated: use 'std::unique_ptr' instead [-Wdeprecated-declarations] 75 | explicit scoped_ptr( std::auto_ptr p ) BOOST_SP_NOEXCEPT : px( p.release() ) | ^~~~~~~~ /usr/include/c++/13/bits/unique_ptr.h:65:28: note: declared here 65 | template class auto_ptr; | ^~~~~~~~ In file included from /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/assert.hpp:35, from /home/omnipath/local/R/4.4-3.20/BH/include/boost/property_map/property_map.hpp:19: /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements > >]’: /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/graph_concepts.hpp:66:5: required from ‘struct boost::concepts::Graph >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/graph_concepts.hpp:176:1: required from ‘struct boost::concepts::VertexListGraph >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/graph_concepts.hpp:176:1: required from ‘struct boost::concepts::VertexListGraphConcept >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::concepts::VertexListGraphConcept >]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied > >::value’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied > >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_ >)>’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/transitive_closure.hpp:73:5: required from ‘void boost::transitive_closure(const Graph&, GraphTC&, G_to_TC_VertexMap, VertexIndexMap) [with Graph = R_adjacency_list; GraphTC = R_adjacency_list; G_to_TC_VertexMap = iterator_property_map, long unsigned int>, long unsigned int, long unsigned int&>; VertexIndexMap = vec_adj_list_vertex_id_map, long unsigned int>]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/transitive_closure.hpp:288:23: required from ‘void boost::transitive_closure(const Graph&, GraphTC&) [with Graph = R_adjacency_list; GraphTC = R_adjacency_list]’ transitive_closure.cpp:29:24: required from here /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ In file included from /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:31, from /home/omnipath/local/R/4.4-3.20/BH/include/boost/property_map/property_map.hpp:20: /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::concepts::Graph >]’ 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ^ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements > >]’: /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/graph_concepts.hpp:182:5: required from ‘struct boost::concepts::VertexListGraph >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/graph_concepts.hpp:176:1: required from ‘struct boost::concepts::VertexListGraphConcept >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::concepts::VertexListGraphConcept >]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied > >::value’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied > >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_ >)>’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/transitive_closure.hpp:73:5: required from ‘void boost::transitive_closure(const Graph&, GraphTC&, G_to_TC_VertexMap, VertexIndexMap) [with Graph = R_adjacency_list; GraphTC = R_adjacency_list; G_to_TC_VertexMap = iterator_property_map, long unsigned int>, long unsigned int, long unsigned int&>; VertexIndexMap = vec_adj_list_vertex_id_map, long unsigned int>]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/transitive_closure.hpp:288:23: required from ‘void boost::transitive_closure(const Graph&, GraphTC&) [with Graph = R_adjacency_list; GraphTC = R_adjacency_list]’ transitive_closure.cpp:29:24: required from here /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::concepts::VertexListGraph >]’ 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ^ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::VertexListGraphConcept >]’: /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/transitive_closure.hpp:73:5: required from ‘void boost::transitive_closure(const Graph&, GraphTC&, G_to_TC_VertexMap, VertexIndexMap) [with Graph = R_adjacency_list; GraphTC = R_adjacency_list; G_to_TC_VertexMap = iterator_property_map, long unsigned int>, long unsigned int, long unsigned int&>; VertexIndexMap = vec_adj_list_vertex_id_map, long unsigned int>]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/transitive_closure.hpp:288:23: required from ‘void boost::transitive_closure(const Graph&, GraphTC&) [with Graph = R_adjacency_list; GraphTC = R_adjacency_list]’ transitive_closure.cpp:29:24: required from here /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ In file included from /home/omnipath/local/R/4.4-3.20/BH/include/boost/mpl/aux_/integral_wrapper.hpp:22, from /home/omnipath/local/R/4.4-3.20/BH/include/boost/mpl/int.hpp:20, from /home/omnipath/local/R/4.4-3.20/BH/include/boost/mpl/lambda_fwd.hpp:23, from /home/omnipath/local/R/4.4-3.20/BH/include/boost/mpl/aux_/na_spec.hpp:18, from /home/omnipath/local/R/4.4-3.20/BH/include/boost/mpl/if.hpp:19, from /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/graph_traits.hpp:17, from /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/depth_first_search.hpp:17: /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/graph_concepts.hpp:176:15: note: in a call to non-static member function ‘boost::concepts::VertexListGraphConcept >::~VertexListGraphConcept()’ 176 | BOOST_concept(VertexListGraph, (G)) : Graph< G > | ^~~~~~~~~~~~~~~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/preprocessor/cat.hpp:29:34: note: in definition of macro ‘BOOST_PP_CAT_I’ 29 | # define BOOST_PP_CAT_I(a, b) a ## b | ^ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/concept_def.hpp:23:12: note: in expansion of macro ‘BOOST_PP_CAT’ 23 | struct BOOST_PP_CAT(name,Concept) \ | ^~~~~~~~~~~~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/graph_concepts.hpp:176:1: note: in expansion of macro ‘BOOST_concept’ 176 | BOOST_concept(VertexListGraph, (G)) : Graph< G > | ^~~~~~~~~~~~~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements > >]’: /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/graph_concepts.hpp:157:5: required from ‘struct boost::concepts::AdjacencyGraph >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/graph_concepts.hpp:152:1: required from ‘struct boost::concepts::AdjacencyGraphConcept >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::concepts::AdjacencyGraphConcept >]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied > >::value’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied > >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_ >)>’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/transitive_closure.hpp:74:5: required from ‘void boost::transitive_closure(const Graph&, GraphTC&, G_to_TC_VertexMap, VertexIndexMap) [with Graph = R_adjacency_list; GraphTC = R_adjacency_list; G_to_TC_VertexMap = iterator_property_map, long unsigned int>, long unsigned int, long unsigned int&>; VertexIndexMap = vec_adj_list_vertex_id_map, long unsigned int>]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/transitive_closure.hpp:288:23: required from ‘void boost::transitive_closure(const Graph&, GraphTC&) [with Graph = R_adjacency_list; GraphTC = R_adjacency_list]’ transitive_closure.cpp:29:24: required from here /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::concepts::AdjacencyGraph >]’ 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ^ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::AdjacencyGraphConcept >]’: /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/transitive_closure.hpp:74:5: required from ‘void boost::transitive_closure(const Graph&, GraphTC&, G_to_TC_VertexMap, VertexIndexMap) [with Graph = R_adjacency_list; GraphTC = R_adjacency_list; G_to_TC_VertexMap = iterator_property_map, long unsigned int>, long unsigned int, long unsigned int&>; VertexIndexMap = vec_adj_list_vertex_id_map, long unsigned int>]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/transitive_closure.hpp:288:23: required from ‘void boost::transitive_closure(const Graph&, GraphTC&) [with Graph = R_adjacency_list; GraphTC = R_adjacency_list]’ transitive_closure.cpp:29:24: required from here /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/graph_concepts.hpp:152:15: note: in a call to non-static member function ‘boost::concepts::AdjacencyGraphConcept >::~AdjacencyGraphConcept()’ 152 | BOOST_concept(AdjacencyGraph, (G)) : Graph< G > | ^~~~~~~~~~~~~~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/preprocessor/cat.hpp:29:34: note: in definition of macro ‘BOOST_PP_CAT_I’ 29 | # define BOOST_PP_CAT_I(a, b) a ## b | ^ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/concept_def.hpp:23:12: note: in expansion of macro ‘BOOST_PP_CAT’ 23 | struct BOOST_PP_CAT(name,Concept) \ | ^~~~~~~~~~~~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/graph_concepts.hpp:152:1: note: in expansion of macro ‘BOOST_concept’ 152 | BOOST_concept(AdjacencyGraph, (G)) : Graph< G > | ^~~~~~~~~~~~~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements > >]’: /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/graph_concepts.hpp:295:5: required from ‘struct boost::concepts::VertexMutableGraph >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/graph_concepts.hpp:292:1: required from ‘struct boost::concepts::VertexMutableGraphConcept >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::concepts::VertexMutableGraphConcept >]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied > >::value’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied > >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_ >)>’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/transitive_closure.hpp:75:5: required from ‘void boost::transitive_closure(const Graph&, GraphTC&, G_to_TC_VertexMap, VertexIndexMap) [with Graph = R_adjacency_list; GraphTC = R_adjacency_list; G_to_TC_VertexMap = iterator_property_map, long unsigned int>, long unsigned int, long unsigned int&>; VertexIndexMap = vec_adj_list_vertex_id_map, long unsigned int>]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/transitive_closure.hpp:288:23: required from ‘void boost::transitive_closure(const Graph&, GraphTC&) [with Graph = R_adjacency_list; GraphTC = R_adjacency_list]’ transitive_closure.cpp:29:24: required from here /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::concepts::VertexMutableGraph >]’ 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ^ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::VertexMutableGraphConcept >]’: /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/transitive_closure.hpp:75:5: required from ‘void boost::transitive_closure(const Graph&, GraphTC&, G_to_TC_VertexMap, VertexIndexMap) [with Graph = R_adjacency_list; GraphTC = R_adjacency_list; G_to_TC_VertexMap = iterator_property_map, long unsigned int>, long unsigned int, long unsigned int&>; VertexIndexMap = vec_adj_list_vertex_id_map, long unsigned int>]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/transitive_closure.hpp:288:23: required from ‘void boost::transitive_closure(const Graph&, GraphTC&) [with Graph = R_adjacency_list; GraphTC = R_adjacency_list]’ transitive_closure.cpp:29:24: required from here /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/graph_concepts.hpp:292:15: note: in a call to non-static member function ‘boost::concepts::VertexMutableGraphConcept >::~VertexMutableGraphConcept()’ 292 | BOOST_concept(VertexMutableGraph, (G)) | ^~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/preprocessor/cat.hpp:29:34: note: in definition of macro ‘BOOST_PP_CAT_I’ 29 | # define BOOST_PP_CAT_I(a, b) a ## b | ^ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/concept_def.hpp:23:12: note: in expansion of macro ‘BOOST_PP_CAT’ 23 | struct BOOST_PP_CAT(name,Concept) \ | ^~~~~~~~~~~~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/graph_concepts.hpp:292:1: note: in expansion of macro ‘BOOST_concept’ 292 | BOOST_concept(VertexMutableGraph, (G)) | ^~~~~~~~~~~~~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements > >]’: /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/graph_concepts.hpp:279:5: required from ‘struct boost::concepts::EdgeMutableGraph >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/graph_concepts.hpp:275:1: required from ‘struct boost::concepts::EdgeMutableGraphConcept >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::concepts::EdgeMutableGraphConcept >]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied > >::value’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied > >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_ >)>’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/transitive_closure.hpp:76:5: required from ‘void boost::transitive_closure(const Graph&, GraphTC&, G_to_TC_VertexMap, VertexIndexMap) [with Graph = R_adjacency_list; GraphTC = R_adjacency_list; G_to_TC_VertexMap = iterator_property_map, long unsigned int>, long unsigned int, long unsigned int&>; VertexIndexMap = vec_adj_list_vertex_id_map, long unsigned int>]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/transitive_closure.hpp:288:23: required from ‘void boost::transitive_closure(const Graph&, GraphTC&) [with Graph = R_adjacency_list; GraphTC = R_adjacency_list]’ transitive_closure.cpp:29:24: required from here /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::concepts::EdgeMutableGraph >]’ 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ^ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::EdgeMutableGraphConcept >]’: /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/transitive_closure.hpp:76:5: required from ‘void boost::transitive_closure(const Graph&, GraphTC&, G_to_TC_VertexMap, VertexIndexMap) [with Graph = R_adjacency_list; GraphTC = R_adjacency_list; G_to_TC_VertexMap = iterator_property_map, long unsigned int>, long unsigned int, long unsigned int&>; VertexIndexMap = vec_adj_list_vertex_id_map, long unsigned int>]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/transitive_closure.hpp:288:23: required from ‘void boost::transitive_closure(const Graph&, GraphTC&) [with Graph = R_adjacency_list; GraphTC = R_adjacency_list]’ transitive_closure.cpp:29:24: required from here /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/graph_concepts.hpp:275:15: note: in a call to non-static member function ‘boost::concepts::EdgeMutableGraphConcept >::~EdgeMutableGraphConcept()’ 275 | BOOST_concept(EdgeMutableGraph, (G)) | ^~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/preprocessor/cat.hpp:29:34: note: in definition of macro ‘BOOST_PP_CAT_I’ 29 | # define BOOST_PP_CAT_I(a, b) a ## b | ^ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/concept_def.hpp:23:12: note: in expansion of macro ‘BOOST_PP_CAT’ 23 | struct BOOST_PP_CAT(name,Concept) \ | ^~~~~~~~~~~~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/graph_concepts.hpp:275:1: note: in expansion of macro ‘BOOST_concept’ 275 | BOOST_concept(EdgeMutableGraph, (G)) | ^~~~~~~~~~~~~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::constraint::failed() [with Model = boost::ReadablePropertyMapConcept, long unsigned int>, long unsigned int>]’: /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/transitive_closure.hpp:77:5: required from ‘void boost::transitive_closure(const Graph&, GraphTC&, G_to_TC_VertexMap, VertexIndexMap) [with Graph = R_adjacency_list; GraphTC = R_adjacency_list; G_to_TC_VertexMap = iterator_property_map, long unsigned int>, long unsigned int, long unsigned int&>; VertexIndexMap = vec_adj_list_vertex_id_map, long unsigned int>]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/transitive_closure.hpp:288:23: required from ‘void boost::transitive_closure(const Graph&, GraphTC&) [with Graph = R_adjacency_list; GraphTC = R_adjacency_list]’ transitive_closure.cpp:29:24: required from here /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:65:52: warning: ‘this’ pointer is null [-Wnonnull] 65 | static void failed() { ((Model*)0)->constraints(); } | ~~~~~~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/property_map/property_map.hpp:147:10: note: in a call to non-static member function ‘void boost::ReadablePropertyMapConcept::constraints() [with PMap = boost::vec_adj_list_vertex_id_map, long unsigned int>; Key = long unsigned int]’ 147 | void constraints() { | ^~~~~~~~~~~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::concepts::Graph >]’: /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements > >]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/graph_concepts.hpp:66:5: required from ‘struct boost::concepts::Graph >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/graph_concepts.hpp:176:1: required from ‘struct boost::concepts::VertexListGraph >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/graph_concepts.hpp:176:1: required from ‘struct boost::concepts::VertexListGraphConcept >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::concepts::VertexListGraphConcept >]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied > >::value’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied > >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_ >)>’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/transitive_closure.hpp:73:5: required from ‘void boost::transitive_closure(const Graph&, GraphTC&, G_to_TC_VertexMap, VertexIndexMap) [with Graph = R_adjacency_list; GraphTC = R_adjacency_list; G_to_TC_VertexMap = iterator_property_map, long unsigned int>, long unsigned int, long unsigned int&>; VertexIndexMap = vec_adj_list_vertex_id_map, long unsigned int>]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/transitive_closure.hpp:288:23: required from ‘void boost::transitive_closure(const Graph&, GraphTC&) [with Graph = R_adjacency_list; GraphTC = R_adjacency_list]’ transitive_closure.cpp:29:24: required from here /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::concepts::Graph::~Graph() [with G = R_adjacency_list]’ 37 | ~model() | ^ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/graph_concepts.hpp:66:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 66 | BOOST_CONCEPT_USAGE(Graph) | ^~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::concepts::VertexListGraph >]’: /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements > >]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/graph_concepts.hpp:182:5: required from ‘struct boost::concepts::VertexListGraph >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/graph_concepts.hpp:176:1: required from ‘struct boost::concepts::VertexListGraphConcept >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::concepts::VertexListGraphConcept >]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied > >::value’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied > >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_ >)>’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/transitive_closure.hpp:73:5: required from ‘void boost::transitive_closure(const Graph&, GraphTC&, G_to_TC_VertexMap, VertexIndexMap) [with Graph = R_adjacency_list; GraphTC = R_adjacency_list; G_to_TC_VertexMap = iterator_property_map, long unsigned int>, long unsigned int, long unsigned int&>; VertexIndexMap = vec_adj_list_vertex_id_map, long unsigned int>]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/transitive_closure.hpp:288:23: required from ‘void boost::transitive_closure(const Graph&, GraphTC&) [with Graph = R_adjacency_list; GraphTC = R_adjacency_list]’ transitive_closure.cpp:29:24: required from here /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::concepts::VertexListGraph::~VertexListGraph() [with G = R_adjacency_list]’ 37 | ~model() | ^ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/graph_concepts.hpp:182:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 182 | BOOST_CONCEPT_USAGE(VertexListGraph) | ^~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::concepts::AdjacencyGraph >]’: /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements > >]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/graph_concepts.hpp:157:5: required from ‘struct boost::concepts::AdjacencyGraph >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/graph_concepts.hpp:152:1: required from ‘struct boost::concepts::AdjacencyGraphConcept >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::concepts::AdjacencyGraphConcept >]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied > >::value’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied > >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_ >)>’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/transitive_closure.hpp:74:5: required from ‘void boost::transitive_closure(const Graph&, GraphTC&, G_to_TC_VertexMap, VertexIndexMap) [with Graph = R_adjacency_list; GraphTC = R_adjacency_list; G_to_TC_VertexMap = iterator_property_map, long unsigned int>, long unsigned int, long unsigned int&>; VertexIndexMap = vec_adj_list_vertex_id_map, long unsigned int>]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/transitive_closure.hpp:288:23: required from ‘void boost::transitive_closure(const Graph&, GraphTC&) [with Graph = R_adjacency_list; GraphTC = R_adjacency_list]’ transitive_closure.cpp:29:24: required from here /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::concepts::AdjacencyGraph::~AdjacencyGraph() [with G = R_adjacency_list]’ 37 | ~model() | ^ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/graph_concepts.hpp:157:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 157 | BOOST_CONCEPT_USAGE(AdjacencyGraph) | ^~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::concepts::VertexMutableGraph >]’: /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements > >]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/graph_concepts.hpp:295:5: required from ‘struct boost::concepts::VertexMutableGraph >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/graph_concepts.hpp:292:1: required from ‘struct boost::concepts::VertexMutableGraphConcept >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::concepts::VertexMutableGraphConcept >]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied > >::value’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied > >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_ >)>’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/transitive_closure.hpp:75:5: required from ‘void boost::transitive_closure(const Graph&, GraphTC&, G_to_TC_VertexMap, VertexIndexMap) [with Graph = R_adjacency_list; GraphTC = R_adjacency_list; G_to_TC_VertexMap = iterator_property_map, long unsigned int>, long unsigned int, long unsigned int&>; VertexIndexMap = vec_adj_list_vertex_id_map, long unsigned int>]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/transitive_closure.hpp:288:23: required from ‘void boost::transitive_closure(const Graph&, GraphTC&) [with Graph = R_adjacency_list; GraphTC = R_adjacency_list]’ transitive_closure.cpp:29:24: required from here /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::concepts::VertexMutableGraph::~VertexMutableGraph() [with G = R_adjacency_list]’ 37 | ~model() | ^ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/graph_concepts.hpp:295:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 295 | BOOST_CONCEPT_USAGE(VertexMutableGraph) | ^~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::concepts::EdgeMutableGraph >]’: /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements > >]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/graph_concepts.hpp:279:5: required from ‘struct boost::concepts::EdgeMutableGraph >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/graph_concepts.hpp:275:1: required from ‘struct boost::concepts::EdgeMutableGraphConcept >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::concepts::EdgeMutableGraphConcept >]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied > >::value’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied > >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_ >)>’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/transitive_closure.hpp:76:5: required from ‘void boost::transitive_closure(const Graph&, GraphTC&, G_to_TC_VertexMap, VertexIndexMap) [with Graph = R_adjacency_list; GraphTC = R_adjacency_list; G_to_TC_VertexMap = iterator_property_map, long unsigned int>, long unsigned int, long unsigned int&>; VertexIndexMap = vec_adj_list_vertex_id_map, long unsigned int>]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/transitive_closure.hpp:288:23: required from ‘void boost::transitive_closure(const Graph&, GraphTC&) [with Graph = R_adjacency_list; GraphTC = R_adjacency_list]’ transitive_closure.cpp:29:24: required from here /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::concepts::EdgeMutableGraph::~EdgeMutableGraph() [with G = R_adjacency_list]’ 37 | ~model() | ^ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/graph_concepts.hpp:279:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 279 | BOOST_CONCEPT_USAGE(EdgeMutableGraph) | ^~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements >]’: /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:208:5: required from ‘struct boost::Convertible’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:206:3: required from ‘struct boost::ConvertibleConcept’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::ConvertibleConcept]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied >::value’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:72:8: [ skipping 3 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied, long unsigned int>, long unsigned int> >::value’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied, long unsigned int>, long unsigned int> >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_, long unsigned int>, long unsigned int>)>’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/transitive_closure.hpp:77:5: required from ‘void boost::transitive_closure(const Graph&, GraphTC&, G_to_TC_VertexMap, VertexIndexMap) [with Graph = R_adjacency_list; GraphTC = R_adjacency_list; G_to_TC_VertexMap = iterator_property_map, long unsigned int>, long unsigned int, long unsigned int&>; VertexIndexMap = vec_adj_list_vertex_id_map, long unsigned int>]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/transitive_closure.hpp:288:23: required from ‘void boost::transitive_closure(const Graph&, GraphTC&) [with Graph = R_adjacency_list; GraphTC = R_adjacency_list]’ transitive_closure.cpp:29:24: required from here /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::Convertible]’ 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ^ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::ConvertibleConcept]’: /home/omnipath/local/R/4.4-3.20/BH/include/boost/property_map/property_map.hpp:148:7: required from ‘void boost::ReadablePropertyMapConcept::constraints() [with PMap = boost::vec_adj_list_vertex_id_map, long unsigned int>; Key = long unsigned int]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::ReadablePropertyMapConcept, long unsigned int>, long unsigned int>]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied, long unsigned int>, long unsigned int> >::value’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied, long unsigned int>, long unsigned int> >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_, long unsigned int>, long unsigned int>)>’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/transitive_closure.hpp:77:5: required from ‘void boost::transitive_closure(const Graph&, GraphTC&, G_to_TC_VertexMap, VertexIndexMap) [with Graph = R_adjacency_list; GraphTC = R_adjacency_list; G_to_TC_VertexMap = iterator_property_map, long unsigned int>, long unsigned int, long unsigned int&>; VertexIndexMap = vec_adj_list_vertex_id_map, long unsigned int>]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/transitive_closure.hpp:288:23: required from ‘void boost::transitive_closure(const Graph&, GraphTC&) [with Graph = R_adjacency_list; GraphTC = R_adjacency_list]’ transitive_closure.cpp:29:24: required from here /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:206:17: note: in a call to non-static member function ‘boost::ConvertibleConcept::~ConvertibleConcept()’ 206 | BOOST_concept(Convertible,(X)(Y)) | ^~~~~~~~~~~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/preprocessor/cat.hpp:29:34: note: in definition of macro ‘BOOST_PP_CAT_I’ 29 | # define BOOST_PP_CAT_I(a, b) a ## b | ^ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/concept_def.hpp:23:12: note: in expansion of macro ‘BOOST_PP_CAT’ 23 | struct BOOST_PP_CAT(name,Concept) \ | ^~~~~~~~~~~~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:206:3: note: in expansion of macro ‘BOOST_concept’ 206 | BOOST_concept(Convertible,(X)(Y)) | ^~~~~~~~~~~~~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements > >]’: /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/graph_concepts.hpp:52:50: required from ‘struct boost::concepts::MultiPassInputIterator >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::concepts::MultiPassInputIterator >]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied > >::value’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied > >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_ >)>’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/graph_concepts.hpp:184:9: required from ‘boost::concepts::VertexListGraph::~VertexListGraph() [with G = R_adjacency_list]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/graph_concepts.hpp:176:1: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::VertexListGraphConcept >]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/transitive_closure.hpp:73:5: required from ‘void boost::transitive_closure(const Graph&, GraphTC&, G_to_TC_VertexMap, VertexIndexMap) [with Graph = R_adjacency_list; GraphTC = R_adjacency_list; G_to_TC_VertexMap = iterator_property_map, long unsigned int>, long unsigned int, long unsigned int&>; VertexIndexMap = vec_adj_list_vertex_id_map, long unsigned int>]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/transitive_closure.hpp:288:23: required from ‘void boost::transitive_closure(const Graph&, GraphTC&) [with Graph = R_adjacency_list; GraphTC = R_adjacency_list]’ transitive_closure.cpp:29:24: required from here /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::concepts::MultiPassInputIterator >]’ 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ^ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::MultiPassInputIterator >]’: /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/graph_concepts.hpp:184:9: required from ‘boost::concepts::VertexListGraph::~VertexListGraph() [with G = R_adjacency_list]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/graph_concepts.hpp:176:1: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::VertexListGraphConcept >]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/transitive_closure.hpp:73:5: required from ‘void boost::transitive_closure(const Graph&, GraphTC&, G_to_TC_VertexMap, VertexIndexMap) [with Graph = R_adjacency_list; GraphTC = R_adjacency_list; G_to_TC_VertexMap = iterator_property_map, long unsigned int>, long unsigned int, long unsigned int&>; VertexIndexMap = vec_adj_list_vertex_id_map, long unsigned int>]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/transitive_closure.hpp:288:23: required from ‘void boost::transitive_closure(const Graph&, GraphTC&) [with Graph = R_adjacency_list; GraphTC = R_adjacency_list]’ transitive_closure.cpp:29:24: required from here /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::concepts::MultiPassInputIterator::~MultiPassInputIterator() [with T = boost::range_detail::integer_iterator]’ 37 | ~model() | ^ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/graph_concepts.hpp:52:50: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 52 | BOOST_concept(MultiPassInputIterator, (T)) { BOOST_CONCEPT_USAGE( | ^~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements >]’: /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:208:5: required from ‘struct boost::Convertible’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::Convertible]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied >::value’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_)>’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/graph_concepts.hpp:185:9: required from ‘boost::concepts::VertexListGraph::~VertexListGraph() [with G = R_adjacency_list]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/graph_concepts.hpp:176:1: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::VertexListGraphConcept >]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/transitive_closure.hpp:73:5: required from ‘void boost::transitive_closure(const Graph&, GraphTC&, G_to_TC_VertexMap, VertexIndexMap) [with Graph = R_adjacency_list; GraphTC = R_adjacency_list; G_to_TC_VertexMap = iterator_property_map, long unsigned int>, long unsigned int, long unsigned int&>; VertexIndexMap = vec_adj_list_vertex_id_map, long unsigned int>]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/transitive_closure.hpp:288:23: required from ‘void boost::transitive_closure(const Graph&, GraphTC&) [with Graph = R_adjacency_list; GraphTC = R_adjacency_list]’ transitive_closure.cpp:29:24: required from here /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::Convertible]’ 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ^ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::Convertible]’: /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/graph_concepts.hpp:185:9: required from ‘boost::concepts::VertexListGraph::~VertexListGraph() [with G = R_adjacency_list]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/graph_concepts.hpp:176:1: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::VertexListGraphConcept >]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/transitive_closure.hpp:73:5: required from ‘void boost::transitive_closure(const Graph&, GraphTC&, G_to_TC_VertexMap, VertexIndexMap) [with Graph = R_adjacency_list; GraphTC = R_adjacency_list; G_to_TC_VertexMap = iterator_property_map, long unsigned int>, long unsigned int, long unsigned int&>; VertexIndexMap = vec_adj_list_vertex_id_map, long unsigned int>]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/transitive_closure.hpp:288:23: required from ‘void boost::transitive_closure(const Graph&, GraphTC&) [with Graph = R_adjacency_list; GraphTC = R_adjacency_list]’ transitive_closure.cpp:29:24: required from here /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::Convertible::~Convertible() [with X = boost::adj_list_dir_traversal_tag; Y = boost::vertex_list_graph_tag]’ 37 | ~model() | ^ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:208:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 208 | BOOST_CONCEPT_USAGE(Convertible) { | ^~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements, boost::property, boost::no_property, boost::listS>, long unsigned int, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator >*, std::vector >, std::allocator > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, long int> > >]’: /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/graph_concepts.hpp:52:50: required from ‘struct boost::concepts::MultiPassInputIterator, boost::property, boost::no_property, boost::listS>, long unsigned int, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator >*, std::vector >, std::allocator > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, long int> >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::concepts::MultiPassInputIterator, boost::property, boost::no_property, boost::listS>, long unsigned int, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator >*, std::vector >, std::allocator > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, long int> >]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied, boost::property, boost::no_property, boost::listS>, long unsigned int, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator >*, std::vector >, std::allocator > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, long int> > >::value’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied, boost::property, boost::no_property, boost::listS>, long unsigned int, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator >*, std::vector >, std::allocator > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, long int> > >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_, boost::property, boost::no_property, boost::listS>, long unsigned int, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator >*, std::vector >, std::allocator > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, long int> >)>’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/graph_concepts.hpp:159:9: required from ‘boost::concepts::AdjacencyGraph::~AdjacencyGraph() [with G = R_adjacency_list]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/graph_concepts.hpp:152:1: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::AdjacencyGraphConcept >]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/transitive_closure.hpp:74:5: required from ‘void boost::transitive_closure(const Graph&, GraphTC&, G_to_TC_VertexMap, VertexIndexMap) [with Graph = R_adjacency_list; GraphTC = R_adjacency_list; G_to_TC_VertexMap = iterator_property_map, long unsigned int>, long unsigned int, long unsigned int&>; VertexIndexMap = vec_adj_list_vertex_id_map, long unsigned int>]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/transitive_closure.hpp:288:23: required from ‘void boost::transitive_closure(const Graph&, GraphTC&) [with Graph = R_adjacency_list; GraphTC = R_adjacency_list]’ transitive_closure.cpp:29:24: required from here /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::concepts::MultiPassInputIterator, boost::property, boost::no_property, boost::listS>, long unsigned int, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator >*, std::vector >, std::allocator > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, long int> >]’ 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ^ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::MultiPassInputIterator, boost::property, boost::no_property, boost::listS>, long unsigned int, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator >*, std::vector >, std::allocator > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, long int> >]’: /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/graph_concepts.hpp:159:9: required from ‘boost::concepts::AdjacencyGraph::~AdjacencyGraph() [with G = R_adjacency_list]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/graph_concepts.hpp:152:1: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::AdjacencyGraphConcept >]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/transitive_closure.hpp:74:5: required from ‘void boost::transitive_closure(const Graph&, GraphTC&, G_to_TC_VertexMap, VertexIndexMap) [with Graph = R_adjacency_list; GraphTC = R_adjacency_list; G_to_TC_VertexMap = iterator_property_map, long unsigned int>, long unsigned int, long unsigned int&>; VertexIndexMap = vec_adj_list_vertex_id_map, long unsigned int>]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/transitive_closure.hpp:288:23: required from ‘void boost::transitive_closure(const Graph&, GraphTC&) [with Graph = R_adjacency_list; GraphTC = R_adjacency_list]’ transitive_closure.cpp:29:24: required from here /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::concepts::MultiPassInputIterator::~MultiPassInputIterator() [with T = boost::adjacency_iterator, boost::property, boost::no_property, boost::listS>, long unsigned int, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator >*, std::vector >, std::allocator > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, long int>]’ 37 | ~model() | ^ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/graph_concepts.hpp:52:50: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 52 | BOOST_concept(MultiPassInputIterator, (T)) { BOOST_CONCEPT_USAGE( | ^~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements >]’: /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:208:5: required from ‘struct boost::Convertible’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::Convertible]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied >::value’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_)>’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/graph_concepts.hpp:160:9: required from ‘boost::concepts::AdjacencyGraph::~AdjacencyGraph() [with G = R_adjacency_list]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/graph_concepts.hpp:152:1: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::AdjacencyGraphConcept >]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/transitive_closure.hpp:74:5: required from ‘void boost::transitive_closure(const Graph&, GraphTC&, G_to_TC_VertexMap, VertexIndexMap) [with Graph = R_adjacency_list; GraphTC = R_adjacency_list; G_to_TC_VertexMap = iterator_property_map, long unsigned int>, long unsigned int, long unsigned int&>; VertexIndexMap = vec_adj_list_vertex_id_map, long unsigned int>]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/transitive_closure.hpp:288:23: required from ‘void boost::transitive_closure(const Graph&, GraphTC&) [with Graph = R_adjacency_list; GraphTC = R_adjacency_list]’ transitive_closure.cpp:29:24: required from here /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::Convertible]’ 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ^ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::Convertible]’: /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/graph_concepts.hpp:160:9: required from ‘boost::concepts::AdjacencyGraph::~AdjacencyGraph() [with G = R_adjacency_list]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/graph_concepts.hpp:152:1: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::AdjacencyGraphConcept >]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/transitive_closure.hpp:74:5: required from ‘void boost::transitive_closure(const Graph&, GraphTC&, G_to_TC_VertexMap, VertexIndexMap) [with Graph = R_adjacency_list; GraphTC = R_adjacency_list; G_to_TC_VertexMap = iterator_property_map, long unsigned int>, long unsigned int, long unsigned int&>; VertexIndexMap = vec_adj_list_vertex_id_map, long unsigned int>]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/transitive_closure.hpp:288:23: required from ‘void boost::transitive_closure(const Graph&, GraphTC&) [with Graph = R_adjacency_list; GraphTC = R_adjacency_list]’ transitive_closure.cpp:29:24: required from here /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::Convertible::~Convertible() [with X = boost::adj_list_dir_traversal_tag; Y = boost::adjacency_graph_tag]’ 37 | ~model() | ^ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:208:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 208 | BOOST_CONCEPT_USAGE(Convertible) { | ^~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::Convertible]’: /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements >]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:208:5: required from ‘struct boost::Convertible’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:206:3: required from ‘struct boost::ConvertibleConcept’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::ConvertibleConcept]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied >::value’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:45:51: [ skipping 4 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied, long unsigned int>, long unsigned int> >::value’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied, long unsigned int>, long unsigned int> >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_, long unsigned int>, long unsigned int>)>’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/transitive_closure.hpp:77:5: required from ‘void boost::transitive_closure(const Graph&, GraphTC&, G_to_TC_VertexMap, VertexIndexMap) [with Graph = R_adjacency_list; GraphTC = R_adjacency_list; G_to_TC_VertexMap = iterator_property_map, long unsigned int>, long unsigned int, long unsigned int&>; VertexIndexMap = vec_adj_list_vertex_id_map, long unsigned int>]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/transitive_closure.hpp:288:23: required from ‘void boost::transitive_closure(const Graph&, GraphTC&) [with Graph = R_adjacency_list; GraphTC = R_adjacency_list]’ transitive_closure.cpp:29:24: required from here /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::Convertible::~Convertible() [with X = boost::readable_property_map_tag; Y = boost::readable_property_map_tag]’ 37 | ~model() | ^ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:208:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 208 | BOOST_CONCEPT_USAGE(Convertible) { | ^~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements >]’: /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:137:5: required from ‘struct boost::DefaultConstructible’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::DefaultConstructible]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied >::value’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_)>’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/graph_concepts.hpp:68:9: [ skipping 7 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied > >::value’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied > >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_ >)>’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/transitive_closure.hpp:73:5: required from ‘void boost::transitive_closure(const Graph&, GraphTC&, G_to_TC_VertexMap, VertexIndexMap) [with Graph = R_adjacency_list; GraphTC = R_adjacency_list; G_to_TC_VertexMap = iterator_property_map, long unsigned int>, long unsigned int, long unsigned int&>; VertexIndexMap = vec_adj_list_vertex_id_map, long unsigned int>]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/transitive_closure.hpp:288:23: required from ‘void boost::transitive_closure(const Graph&, GraphTC&) [with Graph = R_adjacency_list; GraphTC = R_adjacency_list]’ transitive_closure.cpp:29:24: required from here /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::DefaultConstructible]’ 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ^ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::DefaultConstructible]’: /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/graph_concepts.hpp:68:9: required from ‘boost::concepts::Graph::~Graph() [with G = R_adjacency_list]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/usage.hpp:20:48: required from ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::concepts::Graph >]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements > >]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/graph_concepts.hpp:66:5: required from ‘struct boost::concepts::Graph >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/graph_concepts.hpp:176:1: required from ‘struct boost::concepts::VertexListGraph >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/graph_concepts.hpp:176:1: [ skipping 2 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied > >::value’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied > >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_ >)>’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/transitive_closure.hpp:73:5: required from ‘void boost::transitive_closure(const Graph&, GraphTC&, G_to_TC_VertexMap, VertexIndexMap) [with Graph = R_adjacency_list; GraphTC = R_adjacency_list; G_to_TC_VertexMap = iterator_property_map, long unsigned int>, long unsigned int, long unsigned int&>; VertexIndexMap = vec_adj_list_vertex_id_map, long unsigned int>]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/transitive_closure.hpp:288:23: required from ‘void boost::transitive_closure(const Graph&, GraphTC&) [with Graph = R_adjacency_list; GraphTC = R_adjacency_list]’ transitive_closure.cpp:29:24: required from here /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::DefaultConstructible::~DefaultConstructible() [with TT = long unsigned int]’ 37 | ~model() | ^ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:137:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 137 | BOOST_CONCEPT_USAGE(DefaultConstructible) { | ^~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements >]’: /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:233:5: required from ‘struct boost::EqualityComparable’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::EqualityComparable]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied >::value’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_)>’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/graph_concepts.hpp:69:9: [ skipping 7 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied > >::value’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied > >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_ >)>’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/transitive_closure.hpp:73:5: required from ‘void boost::transitive_closure(const Graph&, GraphTC&, G_to_TC_VertexMap, VertexIndexMap) [with Graph = R_adjacency_list; GraphTC = R_adjacency_list; G_to_TC_VertexMap = iterator_property_map, long unsigned int>, long unsigned int, long unsigned int&>; VertexIndexMap = vec_adj_list_vertex_id_map, long unsigned int>]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/transitive_closure.hpp:288:23: required from ‘void boost::transitive_closure(const Graph&, GraphTC&) [with Graph = R_adjacency_list; GraphTC = R_adjacency_list]’ transitive_closure.cpp:29:24: required from here /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::EqualityComparable]’ 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ^ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::EqualityComparable]’: /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/graph_concepts.hpp:69:9: required from ‘boost::concepts::Graph::~Graph() [with G = R_adjacency_list]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/usage.hpp:20:48: required from ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::concepts::Graph >]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements > >]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/graph_concepts.hpp:66:5: required from ‘struct boost::concepts::Graph >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/graph_concepts.hpp:176:1: required from ‘struct boost::concepts::VertexListGraph >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/graph_concepts.hpp:176:1: [ skipping 2 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied > >::value’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied > >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_ >)>’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/transitive_closure.hpp:73:5: required from ‘void boost::transitive_closure(const Graph&, GraphTC&, G_to_TC_VertexMap, VertexIndexMap) [with Graph = R_adjacency_list; GraphTC = R_adjacency_list; G_to_TC_VertexMap = iterator_property_map, long unsigned int>, long unsigned int, long unsigned int&>; VertexIndexMap = vec_adj_list_vertex_id_map, long unsigned int>]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/transitive_closure.hpp:288:23: required from ‘void boost::transitive_closure(const Graph&, GraphTC&) [with Graph = R_adjacency_list; GraphTC = R_adjacency_list]’ transitive_closure.cpp:29:24: required from here /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::EqualityComparable::~EqualityComparable() [with TT = long unsigned int]’ 37 | ~model() | ^ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:233:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 233 | BOOST_CONCEPT_USAGE(EqualityComparable) { | ^~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements >]’: /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:145:5: required from ‘struct boost::Assignable’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::Assignable]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied >::value’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_)>’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/graph_concepts.hpp:70:9: [ skipping 7 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied > >::value’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied > >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_ >)>’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/transitive_closure.hpp:73:5: required from ‘void boost::transitive_closure(const Graph&, GraphTC&, G_to_TC_VertexMap, VertexIndexMap) [with Graph = R_adjacency_list; GraphTC = R_adjacency_list; G_to_TC_VertexMap = iterator_property_map, long unsigned int>, long unsigned int, long unsigned int&>; VertexIndexMap = vec_adj_list_vertex_id_map, long unsigned int>]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/transitive_closure.hpp:288:23: required from ‘void boost::transitive_closure(const Graph&, GraphTC&) [with Graph = R_adjacency_list; GraphTC = R_adjacency_list]’ transitive_closure.cpp:29:24: required from here /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::Assignable]’ 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ^ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::Assignable]’: /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/graph_concepts.hpp:70:9: required from ‘boost::concepts::Graph::~Graph() [with G = R_adjacency_list]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/usage.hpp:20:48: required from ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::concepts::Graph >]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements > >]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/graph_concepts.hpp:66:5: required from ‘struct boost::concepts::Graph >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/graph_concepts.hpp:176:1: required from ‘struct boost::concepts::VertexListGraph >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/graph_concepts.hpp:176:1: [ skipping 2 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied > >::value’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied > >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_ >)>’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/transitive_closure.hpp:73:5: required from ‘void boost::transitive_closure(const Graph&, GraphTC&, G_to_TC_VertexMap, VertexIndexMap) [with Graph = R_adjacency_list; GraphTC = R_adjacency_list; G_to_TC_VertexMap = iterator_property_map, long unsigned int>, long unsigned int, long unsigned int&>; VertexIndexMap = vec_adj_list_vertex_id_map, long unsigned int>]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/transitive_closure.hpp:288:23: required from ‘void boost::transitive_closure(const Graph&, GraphTC&) [with Graph = R_adjacency_list; GraphTC = R_adjacency_list]’ transitive_closure.cpp:29:24: required from here /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::Assignable::~Assignable() [with TT = long unsigned int]’ 37 | ~model() | ^ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:145:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 145 | BOOST_CONCEPT_USAGE(Assignable) { | ^~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::concepts::MultiPassInputIterator >]’: /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements > >]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/graph_concepts.hpp:52:50: required from ‘struct boost::concepts::MultiPassInputIterator >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::concepts::MultiPassInputIterator >]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied > >::value’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied > >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_ >)>’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/graph_concepts.hpp:184:9: required from ‘boost::concepts::VertexListGraph::~VertexListGraph() [with G = R_adjacency_list]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/graph_concepts.hpp:176:1: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::VertexListGraphConcept >]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/transitive_closure.hpp:73:5: required from ‘void boost::transitive_closure(const Graph&, GraphTC&, G_to_TC_VertexMap, VertexIndexMap) [with Graph = R_adjacency_list; GraphTC = R_adjacency_list; G_to_TC_VertexMap = iterator_property_map, long unsigned int>, long unsigned int, long unsigned int&>; VertexIndexMap = vec_adj_list_vertex_id_map, long unsigned int>]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/transitive_closure.hpp:288:23: required from ‘void boost::transitive_closure(const Graph&, GraphTC&) [with Graph = R_adjacency_list; GraphTC = R_adjacency_list]’ transitive_closure.cpp:29:24: required from here /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::concepts::MultiPassInputIterator::~MultiPassInputIterator() [with T = boost::range_detail::integer_iterator]’ 37 | ~model() | ^ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/graph_concepts.hpp:52:50: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 52 | BOOST_concept(MultiPassInputIterator, (T)) { BOOST_CONCEPT_USAGE( | ^~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::Convertible]’: /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements >]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:208:5: required from ‘struct boost::Convertible’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::Convertible]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied >::value’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_)>’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/graph_concepts.hpp:185:9: required from ‘boost::concepts::VertexListGraph::~VertexListGraph() [with G = R_adjacency_list]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/graph_concepts.hpp:176:1: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::VertexListGraphConcept >]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/transitive_closure.hpp:73:5: required from ‘void boost::transitive_closure(const Graph&, GraphTC&, G_to_TC_VertexMap, VertexIndexMap) [with Graph = R_adjacency_list; GraphTC = R_adjacency_list; G_to_TC_VertexMap = iterator_property_map, long unsigned int>, long unsigned int, long unsigned int&>; VertexIndexMap = vec_adj_list_vertex_id_map, long unsigned int>]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/transitive_closure.hpp:288:23: required from ‘void boost::transitive_closure(const Graph&, GraphTC&) [with Graph = R_adjacency_list; GraphTC = R_adjacency_list]’ transitive_closure.cpp:29:24: required from here /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::Convertible::~Convertible() [with X = boost::adj_list_dir_traversal_tag; Y = boost::vertex_list_graph_tag]’ 37 | ~model() | ^ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:208:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 208 | BOOST_CONCEPT_USAGE(Convertible) { | ^~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::concepts::MultiPassInputIterator, boost::property, boost::no_property, boost::listS>, long unsigned int, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator >*, std::vector >, std::allocator > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, long int> >]’: /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements, boost::property, boost::no_property, boost::listS>, long unsigned int, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator >*, std::vector >, std::allocator > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, long int> > >]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/graph_concepts.hpp:52:50: required from ‘struct boost::concepts::MultiPassInputIterator, boost::property, boost::no_property, boost::listS>, long unsigned int, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator >*, std::vector >, std::allocator > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, long int> >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::concepts::MultiPassInputIterator, boost::property, boost::no_property, boost::listS>, long unsigned int, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator >*, std::vector >, std::allocator > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, long int> >]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied, boost::property, boost::no_property, boost::listS>, long unsigned int, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator >*, std::vector >, std::allocator > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, long int> > >::value’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied, boost::property, boost::no_property, boost::listS>, long unsigned int, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator >*, std::vector >, std::allocator > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, long int> > >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_, boost::property, boost::no_property, boost::listS>, long unsigned int, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator >*, std::vector >, std::allocator > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, long int> >)>’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/graph_concepts.hpp:159:9: required from ‘boost::concepts::AdjacencyGraph::~AdjacencyGraph() [with G = R_adjacency_list]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/graph_concepts.hpp:152:1: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::AdjacencyGraphConcept >]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/transitive_closure.hpp:74:5: required from ‘void boost::transitive_closure(const Graph&, GraphTC&, G_to_TC_VertexMap, VertexIndexMap) [with Graph = R_adjacency_list; GraphTC = R_adjacency_list; G_to_TC_VertexMap = iterator_property_map, long unsigned int>, long unsigned int, long unsigned int&>; VertexIndexMap = vec_adj_list_vertex_id_map, long unsigned int>]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/transitive_closure.hpp:288:23: required from ‘void boost::transitive_closure(const Graph&, GraphTC&) [with Graph = R_adjacency_list; GraphTC = R_adjacency_list]’ transitive_closure.cpp:29:24: required from here /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::concepts::MultiPassInputIterator::~MultiPassInputIterator() [with T = boost::adjacency_iterator, boost::property, boost::no_property, boost::listS>, long unsigned int, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator >*, std::vector >, std::allocator > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, long int>]’ 37 | ~model() | ^ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/graph_concepts.hpp:52:50: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 52 | BOOST_concept(MultiPassInputIterator, (T)) { BOOST_CONCEPT_USAGE( | ^~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::Convertible]’: /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements >]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:208:5: required from ‘struct boost::Convertible’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::Convertible]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied >::value’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_)>’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/graph_concepts.hpp:160:9: required from ‘boost::concepts::AdjacencyGraph::~AdjacencyGraph() [with G = R_adjacency_list]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/graph_concepts.hpp:152:1: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::AdjacencyGraphConcept >]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/transitive_closure.hpp:74:5: required from ‘void boost::transitive_closure(const Graph&, GraphTC&, G_to_TC_VertexMap, VertexIndexMap) [with Graph = R_adjacency_list; GraphTC = R_adjacency_list; G_to_TC_VertexMap = iterator_property_map, long unsigned int>, long unsigned int, long unsigned int&>; VertexIndexMap = vec_adj_list_vertex_id_map, long unsigned int>]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/transitive_closure.hpp:288:23: required from ‘void boost::transitive_closure(const Graph&, GraphTC&) [with Graph = R_adjacency_list; GraphTC = R_adjacency_list]’ transitive_closure.cpp:29:24: required from here /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::Convertible::~Convertible() [with X = boost::adj_list_dir_traversal_tag; Y = boost::adjacency_graph_tag]’ 37 | ~model() | ^ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:208:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 208 | BOOST_CONCEPT_USAGE(Convertible) { | ^~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::DefaultConstructible]’: /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements >]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:137:5: required from ‘struct boost::DefaultConstructible’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::DefaultConstructible]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied >::value’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:72:8: [ skipping 8 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied > >::value’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied > >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_ >)>’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/transitive_closure.hpp:73:5: required from ‘void boost::transitive_closure(const Graph&, GraphTC&, G_to_TC_VertexMap, VertexIndexMap) [with Graph = R_adjacency_list; GraphTC = R_adjacency_list; G_to_TC_VertexMap = iterator_property_map, long unsigned int>, long unsigned int, long unsigned int&>; VertexIndexMap = vec_adj_list_vertex_id_map, long unsigned int>]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/transitive_closure.hpp:288:23: required from ‘void boost::transitive_closure(const Graph&, GraphTC&) [with Graph = R_adjacency_list; GraphTC = R_adjacency_list]’ transitive_closure.cpp:29:24: required from here /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::DefaultConstructible::~DefaultConstructible() [with TT = long unsigned int]’ 37 | ~model() | ^ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:137:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 137 | BOOST_CONCEPT_USAGE(DefaultConstructible) { | ^~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::EqualityComparable]’: /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements >]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:233:5: required from ‘struct boost::EqualityComparable’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::EqualityComparable]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied >::value’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:72:8: [ skipping 8 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied > >::value’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied > >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_ >)>’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/transitive_closure.hpp:73:5: required from ‘void boost::transitive_closure(const Graph&, GraphTC&, G_to_TC_VertexMap, VertexIndexMap) [with Graph = R_adjacency_list; GraphTC = R_adjacency_list; G_to_TC_VertexMap = iterator_property_map, long unsigned int>, long unsigned int, long unsigned int&>; VertexIndexMap = vec_adj_list_vertex_id_map, long unsigned int>]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/transitive_closure.hpp:288:23: required from ‘void boost::transitive_closure(const Graph&, GraphTC&) [with Graph = R_adjacency_list; GraphTC = R_adjacency_list]’ transitive_closure.cpp:29:24: required from here /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::EqualityComparable::~EqualityComparable() [with TT = long unsigned int]’ 37 | ~model() | ^ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:233:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 233 | BOOST_CONCEPT_USAGE(EqualityComparable) { | ^~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::Assignable]’: /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements >]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:145:5: required from ‘struct boost::Assignable’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::Assignable]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied >::value’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:72:8: [ skipping 8 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied > >::value’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied > >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_ >)>’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/transitive_closure.hpp:73:5: required from ‘void boost::transitive_closure(const Graph&, GraphTC&, G_to_TC_VertexMap, VertexIndexMap) [with Graph = R_adjacency_list; GraphTC = R_adjacency_list; G_to_TC_VertexMap = iterator_property_map, long unsigned int>, long unsigned int, long unsigned int&>; VertexIndexMap = vec_adj_list_vertex_id_map, long unsigned int>]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/transitive_closure.hpp:288:23: required from ‘void boost::transitive_closure(const Graph&, GraphTC&) [with Graph = R_adjacency_list; GraphTC = R_adjacency_list]’ transitive_closure.cpp:29:24: required from here /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::Assignable::~Assignable() [with TT = long unsigned int]’ 37 | ~model() | ^ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:145:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 145 | BOOST_CONCEPT_USAGE(Assignable) { | ^~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements > >]’: /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:145:5: required from ‘struct boost::Assignable >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:502:3: required from ‘struct boost::InputIterator >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::InputIterator >]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied > >::value’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied > >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:72:8: [ skipping 2 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::MultiPassInputIterator >]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/graph_concepts.hpp:184:9: required from ‘boost::concepts::VertexListGraph::~VertexListGraph() [with G = R_adjacency_list]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/graph_concepts.hpp:176:1: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::VertexListGraphConcept >]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/transitive_closure.hpp:73:5: required from ‘void boost::transitive_closure(const Graph&, GraphTC&, G_to_TC_VertexMap, VertexIndexMap) [with Graph = R_adjacency_list; GraphTC = R_adjacency_list; G_to_TC_VertexMap = iterator_property_map, long unsigned int>, long unsigned int, long unsigned int&>; VertexIndexMap = vec_adj_list_vertex_id_map, long unsigned int>]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/transitive_closure.hpp:288:23: required from ‘void boost::transitive_closure(const Graph&, GraphTC&) [with Graph = R_adjacency_list; GraphTC = R_adjacency_list]’ transitive_closure.cpp:29:24: required from here /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::Assignable >]’ 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ^ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements > >]’: /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:233:5: required from ‘struct boost::EqualityComparable >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:502:3: required from ‘struct boost::InputIterator >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::InputIterator >]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied > >::value’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied > >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:72:8: [ skipping 2 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::MultiPassInputIterator >]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/graph_concepts.hpp:184:9: required from ‘boost::concepts::VertexListGraph::~VertexListGraph() [with G = R_adjacency_list]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/graph_concepts.hpp:176:1: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::VertexListGraphConcept >]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/transitive_closure.hpp:73:5: required from ‘void boost::transitive_closure(const Graph&, GraphTC&, G_to_TC_VertexMap, VertexIndexMap) [with Graph = R_adjacency_list; GraphTC = R_adjacency_list; G_to_TC_VertexMap = iterator_property_map, long unsigned int>, long unsigned int, long unsigned int&>; VertexIndexMap = vec_adj_list_vertex_id_map, long unsigned int>]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/transitive_closure.hpp:288:23: required from ‘void boost::transitive_closure(const Graph&, GraphTC&) [with Graph = R_adjacency_list; GraphTC = R_adjacency_list]’ transitive_closure.cpp:29:24: required from here /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::EqualityComparable >]’ 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ^ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements > >]’: /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:512:7: required from ‘struct boost::InputIterator >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::InputIterator >]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied > >::value’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied > >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:72:8: [ skipping 2 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::MultiPassInputIterator >]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/graph_concepts.hpp:184:9: required from ‘boost::concepts::VertexListGraph::~VertexListGraph() [with G = R_adjacency_list]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/graph_concepts.hpp:176:1: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::VertexListGraphConcept >]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/transitive_closure.hpp:73:5: required from ‘void boost::transitive_closure(const Graph&, GraphTC&, G_to_TC_VertexMap, VertexIndexMap) [with Graph = R_adjacency_list; GraphTC = R_adjacency_list; G_to_TC_VertexMap = iterator_property_map, long unsigned int>, long unsigned int, long unsigned int&>; VertexIndexMap = vec_adj_list_vertex_id_map, long unsigned int>]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/transitive_closure.hpp:288:23: required from ‘void boost::transitive_closure(const Graph&, GraphTC&) [with Graph = R_adjacency_list; GraphTC = R_adjacency_list]’ transitive_closure.cpp:29:24: required from here /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::InputIterator >]’ 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ^ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::InputIterator >]’: /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/graph_concepts.hpp:53:35: required from ‘boost::concepts::MultiPassInputIterator::~MultiPassInputIterator() [with T = boost::range_detail::integer_iterator]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::MultiPassInputIterator >]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/graph_concepts.hpp:184:9: required from ‘boost::concepts::VertexListGraph::~VertexListGraph() [with G = R_adjacency_list]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/graph_concepts.hpp:176:1: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::VertexListGraphConcept >]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/transitive_closure.hpp:73:5: required from ‘void boost::transitive_closure(const Graph&, GraphTC&, G_to_TC_VertexMap, VertexIndexMap) [with Graph = R_adjacency_list; GraphTC = R_adjacency_list; G_to_TC_VertexMap = iterator_property_map, long unsigned int>, long unsigned int, long unsigned int&>; VertexIndexMap = vec_adj_list_vertex_id_map, long unsigned int>]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/transitive_closure.hpp:288:23: required from ‘void boost::transitive_closure(const Graph&, GraphTC&) [with Graph = R_adjacency_list; GraphTC = R_adjacency_list]’ transitive_closure.cpp:29:24: required from here /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::InputIterator::~InputIterator() [with TT = boost::range_detail::integer_iterator]’ 37 | ~model() | ^ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:512:7: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 512 | BOOST_CONCEPT_USAGE(InputIterator) | ^~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements, boost::property, boost::no_property, boost::listS>, long unsigned int, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator >*, std::vector >, std::allocator > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, long int> > >]’: /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:145:5: required from ‘struct boost::Assignable, boost::property, boost::no_property, boost::listS>, long unsigned int, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator >*, std::vector >, std::allocator > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, long int> >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:502:3: required from ‘struct boost::InputIterator, boost::property, boost::no_property, boost::listS>, long unsigned int, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator >*, std::vector >, std::allocator > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, long int> >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::InputIterator, boost::property, boost::no_property, boost::listS>, long unsigned int, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator >*, std::vector >, std::allocator > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, long int> >]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied, boost::property, boost::no_property, boost::listS>, long unsigned int, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator >*, std::vector >, std::allocator > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, long int> > >::value’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied, boost::property, boost::no_property, boost::listS>, long unsigned int, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator >*, std::vector >, std::allocator > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, long int> > >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:72:8: [ skipping 2 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::MultiPassInputIterator, boost::property, boost::no_property, boost::listS>, long unsigned int, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator >*, std::vector >, std::allocator > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, long int> >]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/graph_concepts.hpp:159:9: required from ‘boost::concepts::AdjacencyGraph::~AdjacencyGraph() [with G = R_adjacency_list]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/graph_concepts.hpp:152:1: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::AdjacencyGraphConcept >]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/transitive_closure.hpp:74:5: required from ‘void boost::transitive_closure(const Graph&, GraphTC&, G_to_TC_VertexMap, VertexIndexMap) [with Graph = R_adjacency_list; GraphTC = R_adjacency_list; G_to_TC_VertexMap = iterator_property_map, long unsigned int>, long unsigned int, long unsigned int&>; VertexIndexMap = vec_adj_list_vertex_id_map, long unsigned int>]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/transitive_closure.hpp:288:23: required from ‘void boost::transitive_closure(const Graph&, GraphTC&) [with Graph = R_adjacency_list; GraphTC = R_adjacency_list]’ transitive_closure.cpp:29:24: required from here /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::Assignable, boost::property, boost::no_property, boost::listS>, long unsigned int, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator >*, std::vector >, std::allocator > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, long int> >]’ 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ^ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements, boost::property, boost::no_property, boost::listS>, long unsigned int, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator >*, std::vector >, std::allocator > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, long int> > >]’: /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:233:5: required from ‘struct boost::EqualityComparable, boost::property, boost::no_property, boost::listS>, long unsigned int, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator >*, std::vector >, std::allocator > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, long int> >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:502:3: required from ‘struct boost::InputIterator, boost::property, boost::no_property, boost::listS>, long unsigned int, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator >*, std::vector >, std::allocator > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, long int> >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::InputIterator, boost::property, boost::no_property, boost::listS>, long unsigned int, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator >*, std::vector >, std::allocator > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, long int> >]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied, boost::property, boost::no_property, boost::listS>, long unsigned int, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator >*, std::vector >, std::allocator > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, long int> > >::value’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied, boost::property, boost::no_property, boost::listS>, long unsigned int, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator >*, std::vector >, std::allocator > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, long int> > >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:72:8: [ skipping 2 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::MultiPassInputIterator, boost::property, boost::no_property, boost::listS>, long unsigned int, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator >*, std::vector >, std::allocator > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, long int> >]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/graph_concepts.hpp:159:9: required from ‘boost::concepts::AdjacencyGraph::~AdjacencyGraph() [with G = R_adjacency_list]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/graph_concepts.hpp:152:1: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::AdjacencyGraphConcept >]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/transitive_closure.hpp:74:5: required from ‘void boost::transitive_closure(const Graph&, GraphTC&, G_to_TC_VertexMap, VertexIndexMap) [with Graph = R_adjacency_list; GraphTC = R_adjacency_list; G_to_TC_VertexMap = iterator_property_map, long unsigned int>, long unsigned int, long unsigned int&>; VertexIndexMap = vec_adj_list_vertex_id_map, long unsigned int>]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/transitive_closure.hpp:288:23: required from ‘void boost::transitive_closure(const Graph&, GraphTC&) [with Graph = R_adjacency_list; GraphTC = R_adjacency_list]’ transitive_closure.cpp:29:24: required from here /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::EqualityComparable, boost::property, boost::no_property, boost::listS>, long unsigned int, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator >*, std::vector >, std::allocator > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, long int> >]’ 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ^ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements, boost::property, boost::no_property, boost::listS>, long unsigned int, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator >*, std::vector >, std::allocator > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, long int> > >]’: /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:512:7: required from ‘struct boost::InputIterator, boost::property, boost::no_property, boost::listS>, long unsigned int, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator >*, std::vector >, std::allocator > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, long int> >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::InputIterator, boost::property, boost::no_property, boost::listS>, long unsigned int, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator >*, std::vector >, std::allocator > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, long int> >]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied, boost::property, boost::no_property, boost::listS>, long unsigned int, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator >*, std::vector >, std::allocator > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, long int> > >::value’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied, boost::property, boost::no_property, boost::listS>, long unsigned int, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator >*, std::vector >, std::allocator > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, long int> > >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:72:8: [ skipping 2 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::MultiPassInputIterator, boost::property, boost::no_property, boost::listS>, long unsigned int, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator >*, std::vector >, std::allocator > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, long int> >]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/graph_concepts.hpp:159:9: required from ‘boost::concepts::AdjacencyGraph::~AdjacencyGraph() [with G = R_adjacency_list]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/graph_concepts.hpp:152:1: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::AdjacencyGraphConcept >]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/transitive_closure.hpp:74:5: required from ‘void boost::transitive_closure(const Graph&, GraphTC&, G_to_TC_VertexMap, VertexIndexMap) [with Graph = R_adjacency_list; GraphTC = R_adjacency_list; G_to_TC_VertexMap = iterator_property_map, long unsigned int>, long unsigned int, long unsigned int&>; VertexIndexMap = vec_adj_list_vertex_id_map, long unsigned int>]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/transitive_closure.hpp:288:23: required from ‘void boost::transitive_closure(const Graph&, GraphTC&) [with Graph = R_adjacency_list; GraphTC = R_adjacency_list]’ transitive_closure.cpp:29:24: required from here /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::InputIterator, boost::property, boost::no_property, boost::listS>, long unsigned int, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator >*, std::vector >, std::allocator > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, long int> >]’ 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ^ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::InputIterator, boost::property, boost::no_property, boost::listS>, long unsigned int, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator >*, std::vector >, std::allocator > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, long int> >]’: /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/graph_concepts.hpp:53:35: required from ‘boost::concepts::MultiPassInputIterator::~MultiPassInputIterator() [with T = boost::adjacency_iterator, boost::property, boost::no_property, boost::listS>, long unsigned int, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator >*, std::vector >, std::allocator > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, long int>]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::MultiPassInputIterator, boost::property, boost::no_property, boost::listS>, long unsigned int, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator >*, std::vector >, std::allocator > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, long int> >]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/graph_concepts.hpp:159:9: required from ‘boost::concepts::AdjacencyGraph::~AdjacencyGraph() [with G = R_adjacency_list]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/graph_concepts.hpp:152:1: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::AdjacencyGraphConcept >]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/transitive_closure.hpp:74:5: required from ‘void boost::transitive_closure(const Graph&, GraphTC&, G_to_TC_VertexMap, VertexIndexMap) [with Graph = R_adjacency_list; GraphTC = R_adjacency_list; G_to_TC_VertexMap = iterator_property_map, long unsigned int>, long unsigned int, long unsigned int&>; VertexIndexMap = vec_adj_list_vertex_id_map, long unsigned int>]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/transitive_closure.hpp:288:23: required from ‘void boost::transitive_closure(const Graph&, GraphTC&) [with Graph = R_adjacency_list; GraphTC = R_adjacency_list]’ transitive_closure.cpp:29:24: required from here /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::InputIterator::~InputIterator() [with TT = boost::adjacency_iterator, boost::property, boost::no_property, boost::listS>, long unsigned int, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator >*, std::vector >, std::allocator > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, long int>]’ 37 | ~model() | ^ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:512:7: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 512 | BOOST_CONCEPT_USAGE(InputIterator) | ^~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements > > >]’: /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:145:5: required from ‘struct boost::Assignable<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:502:3: required from ‘struct boost::InputIterator<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:540:3: required from ‘struct boost::ForwardIterator<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:568:3: required from ‘struct boost::BidirectionalIterator<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:597:3: required from ‘struct boost::RandomAccessIterator<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:597:3: [ skipping 6 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/strong_components.hpp:206:43: required from ‘static typename boost::property_traits::value_type boost::detail::strong_comp_dispatch1::apply(const Graph&, ComponentMap, const boost::bgl_named_params&, boost::param_not_found) [with Graph = R_adjacency_list; ComponentMap = boost::iterator_property_map, long unsigned int>, long unsigned int, long unsigned int&>; P = boost::vec_adj_list_vertex_id_map, long unsigned int>; T = boost::vertex_index_t; R = boost::no_property; typename boost::property_traits::value_type = long unsigned int]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/strong_components.hpp:220:63: required from ‘typename boost::property_traits::value_type boost::detail::scc_helper1(const Graph&, ComponentMap, const boost::bgl_named_params&, RootMap) [with Graph = R_adjacency_list; ComponentMap = boost::iterator_property_map, long unsigned int>, long unsigned int, long unsigned int&>; RootMap = boost::param_not_found; P = boost::vec_adj_list_vertex_id_map, long unsigned int>; T = boost::vertex_index_t; R = boost::no_property; typename boost::property_traits::value_type = long unsigned int]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/strong_components.hpp:235:31: required from ‘typename boost::property_traits::value_type boost::strong_components(const Graph&, ComponentMap, const bgl_named_params&, typename enable_if_c::traversal_category>::value, graph::detail::no_parameter>::type) [with Graph = R_adjacency_list; ComponentMap = iterator_property_map, long unsigned int>, long unsigned int, long unsigned int&>; P = vec_adj_list_vertex_id_map, long unsigned int>; T = vertex_index_t; R = no_property; typename property_traits::value_type = long unsigned int; typename enable_if_c::traversal_category>::value, graph::detail::no_parameter>::type = graph::detail::no_parameter; typename graph_traits::traversal_category = adj_list_dir_traversal_tag]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/transitive_closure.hpp:86:28: required from ‘void boost::transitive_closure(const Graph&, GraphTC&, G_to_TC_VertexMap, VertexIndexMap) [with Graph = R_adjacency_list; GraphTC = R_adjacency_list; G_to_TC_VertexMap = iterator_property_map, long unsigned int>, long unsigned int, long unsigned int&>; VertexIndexMap = vec_adj_list_vertex_id_map, long unsigned int>]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/transitive_closure.hpp:288:23: required from ‘void boost::transitive_closure(const Graph&, GraphTC&) [with Graph = R_adjacency_list; GraphTC = R_adjacency_list]’ transitive_closure.cpp:29:24: required from here /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::Assignable<__gnu_cxx::__normal_iterator > >]’ 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ^ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements > > >]’: /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:233:5: required from ‘struct boost::EqualityComparable<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:502:3: required from ‘struct boost::InputIterator<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:540:3: required from ‘struct boost::ForwardIterator<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:568:3: required from ‘struct boost::BidirectionalIterator<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:597:3: required from ‘struct boost::RandomAccessIterator<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:597:3: [ skipping 6 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/strong_components.hpp:206:43: required from ‘static typename boost::property_traits::value_type boost::detail::strong_comp_dispatch1::apply(const Graph&, ComponentMap, const boost::bgl_named_params&, boost::param_not_found) [with Graph = R_adjacency_list; ComponentMap = boost::iterator_property_map, long unsigned int>, long unsigned int, long unsigned int&>; P = boost::vec_adj_list_vertex_id_map, long unsigned int>; T = boost::vertex_index_t; R = boost::no_property; typename boost::property_traits::value_type = long unsigned int]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/strong_components.hpp:220:63: required from ‘typename boost::property_traits::value_type boost::detail::scc_helper1(const Graph&, ComponentMap, const boost::bgl_named_params&, RootMap) [with Graph = R_adjacency_list; ComponentMap = boost::iterator_property_map, long unsigned int>, long unsigned int, long unsigned int&>; RootMap = boost::param_not_found; P = boost::vec_adj_list_vertex_id_map, long unsigned int>; T = boost::vertex_index_t; R = boost::no_property; typename boost::property_traits::value_type = long unsigned int]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/strong_components.hpp:235:31: required from ‘typename boost::property_traits::value_type boost::strong_components(const Graph&, ComponentMap, const bgl_named_params&, typename enable_if_c::traversal_category>::value, graph::detail::no_parameter>::type) [with Graph = R_adjacency_list; ComponentMap = iterator_property_map, long unsigned int>, long unsigned int, long unsigned int&>; P = vec_adj_list_vertex_id_map, long unsigned int>; T = vertex_index_t; R = no_property; typename property_traits::value_type = long unsigned int; typename enable_if_c::traversal_category>::value, graph::detail::no_parameter>::type = graph::detail::no_parameter; typename graph_traits::traversal_category = adj_list_dir_traversal_tag]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/transitive_closure.hpp:86:28: required from ‘void boost::transitive_closure(const Graph&, GraphTC&, G_to_TC_VertexMap, VertexIndexMap) [with Graph = R_adjacency_list; GraphTC = R_adjacency_list; G_to_TC_VertexMap = iterator_property_map, long unsigned int>, long unsigned int, long unsigned int&>; VertexIndexMap = vec_adj_list_vertex_id_map, long unsigned int>]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/transitive_closure.hpp:288:23: required from ‘void boost::transitive_closure(const Graph&, GraphTC&) [with Graph = R_adjacency_list; GraphTC = R_adjacency_list]’ transitive_closure.cpp:29:24: required from here /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::EqualityComparable<__gnu_cxx::__normal_iterator > >]’ 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ^ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements > > >]’: /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:512:7: required from ‘struct boost::InputIterator<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:540:3: required from ‘struct boost::ForwardIterator<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:568:3: required from ‘struct boost::BidirectionalIterator<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:597:3: required from ‘struct boost::RandomAccessIterator<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:597:3: required from ‘struct boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:32:62: [ skipping 5 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/strong_components.hpp:206:43: required from ‘static typename boost::property_traits::value_type boost::detail::strong_comp_dispatch1::apply(const Graph&, ComponentMap, const boost::bgl_named_params&, boost::param_not_found) [with Graph = R_adjacency_list; ComponentMap = boost::iterator_property_map, long unsigned int>, long unsigned int, long unsigned int&>; P = boost::vec_adj_list_vertex_id_map, long unsigned int>; T = boost::vertex_index_t; R = boost::no_property; typename boost::property_traits::value_type = long unsigned int]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/strong_components.hpp:220:63: required from ‘typename boost::property_traits::value_type boost::detail::scc_helper1(const Graph&, ComponentMap, const boost::bgl_named_params&, RootMap) [with Graph = R_adjacency_list; ComponentMap = boost::iterator_property_map, long unsigned int>, long unsigned int, long unsigned int&>; RootMap = boost::param_not_found; P = boost::vec_adj_list_vertex_id_map, long unsigned int>; T = boost::vertex_index_t; R = boost::no_property; typename boost::property_traits::value_type = long unsigned int]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/strong_components.hpp:235:31: required from ‘typename boost::property_traits::value_type boost::strong_components(const Graph&, ComponentMap, const bgl_named_params&, typename enable_if_c::traversal_category>::value, graph::detail::no_parameter>::type) [with Graph = R_adjacency_list; ComponentMap = iterator_property_map, long unsigned int>, long unsigned int, long unsigned int&>; P = vec_adj_list_vertex_id_map, long unsigned int>; T = vertex_index_t; R = no_property; typename property_traits::value_type = long unsigned int; typename enable_if_c::traversal_category>::value, graph::detail::no_parameter>::type = graph::detail::no_parameter; typename graph_traits::traversal_category = adj_list_dir_traversal_tag]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/transitive_closure.hpp:86:28: required from ‘void boost::transitive_closure(const Graph&, GraphTC&, G_to_TC_VertexMap, VertexIndexMap) [with Graph = R_adjacency_list; GraphTC = R_adjacency_list; G_to_TC_VertexMap = iterator_property_map, long unsigned int>, long unsigned int, long unsigned int&>; VertexIndexMap = vec_adj_list_vertex_id_map, long unsigned int>]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/transitive_closure.hpp:288:23: required from ‘void boost::transitive_closure(const Graph&, GraphTC&) [with Graph = R_adjacency_list; GraphTC = R_adjacency_list]’ transitive_closure.cpp:29:24: required from here /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::InputIterator<__gnu_cxx::__normal_iterator > >]’ 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ^ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements > > >]’: /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:543:7: required from ‘struct boost::ForwardIterator<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:568:3: required from ‘struct boost::BidirectionalIterator<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:597:3: required from ‘struct boost::RandomAccessIterator<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:597:3: required from ‘struct boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator > >]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:42:5: [ skipping 4 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/strong_components.hpp:206:43: required from ‘static typename boost::property_traits::value_type boost::detail::strong_comp_dispatch1::apply(const Graph&, ComponentMap, const boost::bgl_named_params&, boost::param_not_found) [with Graph = R_adjacency_list; ComponentMap = boost::iterator_property_map, long unsigned int>, long unsigned int, long unsigned int&>; P = boost::vec_adj_list_vertex_id_map, long unsigned int>; T = boost::vertex_index_t; R = boost::no_property; typename boost::property_traits::value_type = long unsigned int]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/strong_components.hpp:220:63: required from ‘typename boost::property_traits::value_type boost::detail::scc_helper1(const Graph&, ComponentMap, const boost::bgl_named_params&, RootMap) [with Graph = R_adjacency_list; ComponentMap = boost::iterator_property_map, long unsigned int>, long unsigned int, long unsigned int&>; RootMap = boost::param_not_found; P = boost::vec_adj_list_vertex_id_map, long unsigned int>; T = boost::vertex_index_t; R = boost::no_property; typename boost::property_traits::value_type = long unsigned int]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/strong_components.hpp:235:31: required from ‘typename boost::property_traits::value_type boost::strong_components(const Graph&, ComponentMap, const bgl_named_params&, typename enable_if_c::traversal_category>::value, graph::detail::no_parameter>::type) [with Graph = R_adjacency_list; ComponentMap = iterator_property_map, long unsigned int>, long unsigned int, long unsigned int&>; P = vec_adj_list_vertex_id_map, long unsigned int>; T = vertex_index_t; R = no_property; typename property_traits::value_type = long unsigned int; typename enable_if_c::traversal_category>::value, graph::detail::no_parameter>::type = graph::detail::no_parameter; typename graph_traits::traversal_category = adj_list_dir_traversal_tag]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/transitive_closure.hpp:86:28: required from ‘void boost::transitive_closure(const Graph&, GraphTC&, G_to_TC_VertexMap, VertexIndexMap) [with Graph = R_adjacency_list; GraphTC = R_adjacency_list; G_to_TC_VertexMap = iterator_property_map, long unsigned int>, long unsigned int, long unsigned int&>; VertexIndexMap = vec_adj_list_vertex_id_map, long unsigned int>]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/transitive_closure.hpp:288:23: required from ‘void boost::transitive_closure(const Graph&, GraphTC&) [with Graph = R_adjacency_list; GraphTC = R_adjacency_list]’ transitive_closure.cpp:29:24: required from here /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::ForwardIterator<__gnu_cxx::__normal_iterator > >]’ 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ^ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements > > >]’: /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:571:7: required from ‘struct boost::BidirectionalIterator<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:597:3: required from ‘struct boost::RandomAccessIterator<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:597:3: required from ‘struct boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator > >]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied > > >::value’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:45:51: [ skipping 3 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/strong_components.hpp:206:43: required from ‘static typename boost::property_traits::value_type boost::detail::strong_comp_dispatch1::apply(const Graph&, ComponentMap, const boost::bgl_named_params&, boost::param_not_found) [with Graph = R_adjacency_list; ComponentMap = boost::iterator_property_map, long unsigned int>, long unsigned int, long unsigned int&>; P = boost::vec_adj_list_vertex_id_map, long unsigned int>; T = boost::vertex_index_t; R = boost::no_property; typename boost::property_traits::value_type = long unsigned int]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/strong_components.hpp:220:63: required from ‘typename boost::property_traits::value_type boost::detail::scc_helper1(const Graph&, ComponentMap, const boost::bgl_named_params&, RootMap) [with Graph = R_adjacency_list; ComponentMap = boost::iterator_property_map, long unsigned int>, long unsigned int, long unsigned int&>; RootMap = boost::param_not_found; P = boost::vec_adj_list_vertex_id_map, long unsigned int>; T = boost::vertex_index_t; R = boost::no_property; typename boost::property_traits::value_type = long unsigned int]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/strong_components.hpp:235:31: required from ‘typename boost::property_traits::value_type boost::strong_components(const Graph&, ComponentMap, const bgl_named_params&, typename enable_if_c::traversal_category>::value, graph::detail::no_parameter>::type) [with Graph = R_adjacency_list; ComponentMap = iterator_property_map, long unsigned int>, long unsigned int, long unsigned int&>; P = vec_adj_list_vertex_id_map, long unsigned int>; T = vertex_index_t; R = no_property; typename property_traits::value_type = long unsigned int; typename enable_if_c::traversal_category>::value, graph::detail::no_parameter>::type = graph::detail::no_parameter; typename graph_traits::traversal_category = adj_list_dir_traversal_tag]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/transitive_closure.hpp:86:28: required from ‘void boost::transitive_closure(const Graph&, GraphTC&, G_to_TC_VertexMap, VertexIndexMap) [with Graph = R_adjacency_list; GraphTC = R_adjacency_list; G_to_TC_VertexMap = iterator_property_map, long unsigned int>, long unsigned int, long unsigned int&>; VertexIndexMap = vec_adj_list_vertex_id_map, long unsigned int>]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/transitive_closure.hpp:288:23: required from ‘void boost::transitive_closure(const Graph&, GraphTC&) [with Graph = R_adjacency_list; GraphTC = R_adjacency_list]’ transitive_closure.cpp:29:24: required from here /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::BidirectionalIterator<__gnu_cxx::__normal_iterator > >]’ 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ^ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements > > >]’: /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:253:5: required from ‘struct boost::Comparable<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:597:3: required from ‘struct boost::RandomAccessIterator<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:597:3: required from ‘struct boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator > >]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied > > >::value’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:45:51: [ skipping 3 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/strong_components.hpp:206:43: required from ‘static typename boost::property_traits::value_type boost::detail::strong_comp_dispatch1::apply(const Graph&, ComponentMap, const boost::bgl_named_params&, boost::param_not_found) [with Graph = R_adjacency_list; ComponentMap = boost::iterator_property_map, long unsigned int>, long unsigned int, long unsigned int&>; P = boost::vec_adj_list_vertex_id_map, long unsigned int>; T = boost::vertex_index_t; R = boost::no_property; typename boost::property_traits::value_type = long unsigned int]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/strong_components.hpp:220:63: required from ‘typename boost::property_traits::value_type boost::detail::scc_helper1(const Graph&, ComponentMap, const boost::bgl_named_params&, RootMap) [with Graph = R_adjacency_list; ComponentMap = boost::iterator_property_map, long unsigned int>, long unsigned int, long unsigned int&>; RootMap = boost::param_not_found; P = boost::vec_adj_list_vertex_id_map, long unsigned int>; T = boost::vertex_index_t; R = boost::no_property; typename boost::property_traits::value_type = long unsigned int]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/strong_components.hpp:235:31: required from ‘typename boost::property_traits::value_type boost::strong_components(const Graph&, ComponentMap, const bgl_named_params&, typename enable_if_c::traversal_category>::value, graph::detail::no_parameter>::type) [with Graph = R_adjacency_list; ComponentMap = iterator_property_map, long unsigned int>, long unsigned int, long unsigned int&>; P = vec_adj_list_vertex_id_map, long unsigned int>; T = vertex_index_t; R = no_property; typename property_traits::value_type = long unsigned int; typename enable_if_c::traversal_category>::value, graph::detail::no_parameter>::type = graph::detail::no_parameter; typename graph_traits::traversal_category = adj_list_dir_traversal_tag]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/transitive_closure.hpp:86:28: required from ‘void boost::transitive_closure(const Graph&, GraphTC&, G_to_TC_VertexMap, VertexIndexMap) [with Graph = R_adjacency_list; GraphTC = R_adjacency_list; G_to_TC_VertexMap = iterator_property_map, long unsigned int>, long unsigned int, long unsigned int&>; VertexIndexMap = vec_adj_list_vertex_id_map, long unsigned int>]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/transitive_closure.hpp:288:23: required from ‘void boost::transitive_closure(const Graph&, GraphTC&) [with Graph = R_adjacency_list; GraphTC = R_adjacency_list]’ transitive_closure.cpp:29:24: required from here /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::Comparable<__gnu_cxx::__normal_iterator > >]’ 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ^ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements > > >]’: /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:601:7: required from ‘struct boost::RandomAccessIterator<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:597:3: required from ‘struct boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator > >]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied > > >::value’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied > > >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:72:8: [ skipping 2 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/strong_components.hpp:206:43: required from ‘static typename boost::property_traits::value_type boost::detail::strong_comp_dispatch1::apply(const Graph&, ComponentMap, const boost::bgl_named_params&, boost::param_not_found) [with Graph = R_adjacency_list; ComponentMap = boost::iterator_property_map, long unsigned int>, long unsigned int, long unsigned int&>; P = boost::vec_adj_list_vertex_id_map, long unsigned int>; T = boost::vertex_index_t; R = boost::no_property; typename boost::property_traits::value_type = long unsigned int]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/strong_components.hpp:220:63: required from ‘typename boost::property_traits::value_type boost::detail::scc_helper1(const Graph&, ComponentMap, const boost::bgl_named_params&, RootMap) [with Graph = R_adjacency_list; ComponentMap = boost::iterator_property_map, long unsigned int>, long unsigned int, long unsigned int&>; RootMap = boost::param_not_found; P = boost::vec_adj_list_vertex_id_map, long unsigned int>; T = boost::vertex_index_t; R = boost::no_property; typename boost::property_traits::value_type = long unsigned int]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/strong_components.hpp:235:31: required from ‘typename boost::property_traits::value_type boost::strong_components(const Graph&, ComponentMap, const bgl_named_params&, typename enable_if_c::traversal_category>::value, graph::detail::no_parameter>::type) [with Graph = R_adjacency_list; ComponentMap = iterator_property_map, long unsigned int>, long unsigned int, long unsigned int&>; P = vec_adj_list_vertex_id_map, long unsigned int>; T = vertex_index_t; R = no_property; typename property_traits::value_type = long unsigned int; typename enable_if_c::traversal_category>::value, graph::detail::no_parameter>::type = graph::detail::no_parameter; typename graph_traits::traversal_category = adj_list_dir_traversal_tag]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/transitive_closure.hpp:86:28: required from ‘void boost::transitive_closure(const Graph&, GraphTC&, G_to_TC_VertexMap, VertexIndexMap) [with Graph = R_adjacency_list; GraphTC = R_adjacency_list; G_to_TC_VertexMap = iterator_property_map, long unsigned int>, long unsigned int, long unsigned int&>; VertexIndexMap = vec_adj_list_vertex_id_map, long unsigned int>]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/transitive_closure.hpp:288:23: required from ‘void boost::transitive_closure(const Graph&, GraphTC&) [with Graph = R_adjacency_list; GraphTC = R_adjacency_list]’ transitive_closure.cpp:29:24: required from here /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::RandomAccessIterator<__gnu_cxx::__normal_iterator > >]’ 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ^ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator > >]’: /home/omnipath/local/R/4.4-3.20/BH/include/boost/property_map/property_map.hpp:354:5: required from ‘boost::iterator_property_map boost::make_iterator_property_map(RAIter, ID, Value) [with RAIter = __gnu_cxx::__normal_iterator >; Value = long unsigned int; ID = vec_adj_list_vertex_id_map, long unsigned int>]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/strong_components.hpp:206:43: required from ‘static typename boost::property_traits::value_type boost::detail::strong_comp_dispatch1::apply(const Graph&, ComponentMap, const boost::bgl_named_params&, boost::param_not_found) [with Graph = R_adjacency_list; ComponentMap = boost::iterator_property_map, long unsigned int>, long unsigned int, long unsigned int&>; P = boost::vec_adj_list_vertex_id_map, long unsigned int>; T = boost::vertex_index_t; R = boost::no_property; typename boost::property_traits::value_type = long unsigned int]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/strong_components.hpp:220:63: required from ‘typename boost::property_traits::value_type boost::detail::scc_helper1(const Graph&, ComponentMap, const boost::bgl_named_params&, RootMap) [with Graph = R_adjacency_list; ComponentMap = boost::iterator_property_map, long unsigned int>, long unsigned int, long unsigned int&>; RootMap = boost::param_not_found; P = boost::vec_adj_list_vertex_id_map, long unsigned int>; T = boost::vertex_index_t; R = boost::no_property; typename boost::property_traits::value_type = long unsigned int]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/strong_components.hpp:235:31: required from ‘typename boost::property_traits::value_type boost::strong_components(const Graph&, ComponentMap, const bgl_named_params&, typename enable_if_c::traversal_category>::value, graph::detail::no_parameter>::type) [with Graph = R_adjacency_list; ComponentMap = iterator_property_map, long unsigned int>, long unsigned int, long unsigned int&>; P = vec_adj_list_vertex_id_map, long unsigned int>; T = vertex_index_t; R = no_property; typename property_traits::value_type = long unsigned int; typename enable_if_c::traversal_category>::value, graph::detail::no_parameter>::type = graph::detail::no_parameter; typename graph_traits::traversal_category = adj_list_dir_traversal_tag]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/transitive_closure.hpp:86:28: required from ‘void boost::transitive_closure(const Graph&, GraphTC&, G_to_TC_VertexMap, VertexIndexMap) [with Graph = R_adjacency_list; GraphTC = R_adjacency_list; G_to_TC_VertexMap = iterator_property_map, long unsigned int>, long unsigned int, long unsigned int&>; VertexIndexMap = vec_adj_list_vertex_id_map, long unsigned int>]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/transitive_closure.hpp:288:23: required from ‘void boost::transitive_closure(const Graph&, GraphTC&) [with Graph = R_adjacency_list; GraphTC = R_adjacency_list]’ transitive_closure.cpp:29:24: required from here /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:597:17: note: in a call to non-static member function ‘boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator > >::~RandomAccessIteratorConcept()’ 597 | BOOST_concept(RandomAccessIterator,(TT)) | ^~~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/preprocessor/cat.hpp:29:34: note: in definition of macro ‘BOOST_PP_CAT_I’ 29 | # define BOOST_PP_CAT_I(a, b) a ## b | ^ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/concept_def.hpp:23:12: note: in expansion of macro ‘BOOST_PP_CAT’ 23 | struct BOOST_PP_CAT(name,Concept) \ | ^~~~~~~~~~~~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:597:3: note: in expansion of macro ‘BOOST_concept’ 597 | BOOST_concept(RandomAccessIterator,(TT)) | ^~~~~~~~~~~~~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::Assignable >]’: /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements > >]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:145:5: required from ‘struct boost::Assignable >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:502:3: required from ‘struct boost::InputIterator >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::InputIterator >]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied > >::value’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:45:51: [ skipping 3 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::MultiPassInputIterator >]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/graph_concepts.hpp:184:9: required from ‘boost::concepts::VertexListGraph::~VertexListGraph() [with G = R_adjacency_list]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/graph_concepts.hpp:176:1: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::VertexListGraphConcept >]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/transitive_closure.hpp:73:5: required from ‘void boost::transitive_closure(const Graph&, GraphTC&, G_to_TC_VertexMap, VertexIndexMap) [with Graph = R_adjacency_list; GraphTC = R_adjacency_list; G_to_TC_VertexMap = iterator_property_map, long unsigned int>, long unsigned int, long unsigned int&>; VertexIndexMap = vec_adj_list_vertex_id_map, long unsigned int>]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/transitive_closure.hpp:288:23: required from ‘void boost::transitive_closure(const Graph&, GraphTC&) [with Graph = R_adjacency_list; GraphTC = R_adjacency_list]’ transitive_closure.cpp:29:24: required from here /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::Assignable::~Assignable() [with TT = boost::range_detail::integer_iterator]’ 37 | ~model() | ^ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:145:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 145 | BOOST_CONCEPT_USAGE(Assignable) { | ^~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::EqualityComparable >]’: /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements > >]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:233:5: required from ‘struct boost::EqualityComparable >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:502:3: required from ‘struct boost::InputIterator >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::InputIterator >]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied > >::value’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:45:51: [ skipping 3 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::MultiPassInputIterator >]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/graph_concepts.hpp:184:9: required from ‘boost::concepts::VertexListGraph::~VertexListGraph() [with G = R_adjacency_list]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/graph_concepts.hpp:176:1: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::VertexListGraphConcept >]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/transitive_closure.hpp:73:5: required from ‘void boost::transitive_closure(const Graph&, GraphTC&, G_to_TC_VertexMap, VertexIndexMap) [with Graph = R_adjacency_list; GraphTC = R_adjacency_list; G_to_TC_VertexMap = iterator_property_map, long unsigned int>, long unsigned int, long unsigned int&>; VertexIndexMap = vec_adj_list_vertex_id_map, long unsigned int>]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/transitive_closure.hpp:288:23: required from ‘void boost::transitive_closure(const Graph&, GraphTC&) [with Graph = R_adjacency_list; GraphTC = R_adjacency_list]’ transitive_closure.cpp:29:24: required from here /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::EqualityComparable::~EqualityComparable() [with TT = boost::range_detail::integer_iterator]’ 37 | ~model() | ^ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:233:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 233 | BOOST_CONCEPT_USAGE(EqualityComparable) { | ^~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::InputIterator >]’: /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements > >]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:512:7: required from ‘struct boost::InputIterator >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::InputIterator >]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied > >::value’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied > >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:72:8: [ skipping 2 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::MultiPassInputIterator >]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/graph_concepts.hpp:184:9: required from ‘boost::concepts::VertexListGraph::~VertexListGraph() [with G = R_adjacency_list]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/graph_concepts.hpp:176:1: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::VertexListGraphConcept >]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/transitive_closure.hpp:73:5: required from ‘void boost::transitive_closure(const Graph&, GraphTC&, G_to_TC_VertexMap, VertexIndexMap) [with Graph = R_adjacency_list; GraphTC = R_adjacency_list; G_to_TC_VertexMap = iterator_property_map, long unsigned int>, long unsigned int, long unsigned int&>; VertexIndexMap = vec_adj_list_vertex_id_map, long unsigned int>]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/transitive_closure.hpp:288:23: required from ‘void boost::transitive_closure(const Graph&, GraphTC&) [with Graph = R_adjacency_list; GraphTC = R_adjacency_list]’ transitive_closure.cpp:29:24: required from here /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::InputIterator::~InputIterator() [with TT = boost::range_detail::integer_iterator]’ 37 | ~model() | ^ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:512:7: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 512 | BOOST_CONCEPT_USAGE(InputIterator) | ^~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::Assignable, boost::property, boost::no_property, boost::listS>, long unsigned int, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator >*, std::vector >, std::allocator > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, long int> >]’: /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements, boost::property, boost::no_property, boost::listS>, long unsigned int, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator >*, std::vector >, std::allocator > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, long int> > >]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:145:5: required from ‘struct boost::Assignable, boost::property, boost::no_property, boost::listS>, long unsigned int, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator >*, std::vector >, std::allocator > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, long int> >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:502:3: required from ‘struct boost::InputIterator, boost::property, boost::no_property, boost::listS>, long unsigned int, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator >*, std::vector >, std::allocator > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, long int> >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::InputIterator, boost::property, boost::no_property, boost::listS>, long unsigned int, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator >*, std::vector >, std::allocator > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, long int> >]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied, boost::property, boost::no_property, boost::listS>, long unsigned int, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator >*, std::vector >, std::allocator > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, long int> > >::value’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:45:51: [ skipping 3 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::MultiPassInputIterator, boost::property, boost::no_property, boost::listS>, long unsigned int, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator >*, std::vector >, std::allocator > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, long int> >]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/graph_concepts.hpp:159:9: required from ‘boost::concepts::AdjacencyGraph::~AdjacencyGraph() [with G = R_adjacency_list]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/graph_concepts.hpp:152:1: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::AdjacencyGraphConcept >]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/transitive_closure.hpp:74:5: required from ‘void boost::transitive_closure(const Graph&, GraphTC&, G_to_TC_VertexMap, VertexIndexMap) [with Graph = R_adjacency_list; GraphTC = R_adjacency_list; G_to_TC_VertexMap = iterator_property_map, long unsigned int>, long unsigned int, long unsigned int&>; VertexIndexMap = vec_adj_list_vertex_id_map, long unsigned int>]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/transitive_closure.hpp:288:23: required from ‘void boost::transitive_closure(const Graph&, GraphTC&) [with Graph = R_adjacency_list; GraphTC = R_adjacency_list]’ transitive_closure.cpp:29:24: required from here /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::Assignable::~Assignable() [with TT = boost::adjacency_iterator, boost::property, boost::no_property, boost::listS>, long unsigned int, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator >*, std::vector >, std::allocator > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, long int>]’ 37 | ~model() | ^ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:145:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 145 | BOOST_CONCEPT_USAGE(Assignable) { | ^~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::EqualityComparable, boost::property, boost::no_property, boost::listS>, long unsigned int, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator >*, std::vector >, std::allocator > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, long int> >]’: /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements, boost::property, boost::no_property, boost::listS>, long unsigned int, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator >*, std::vector >, std::allocator > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, long int> > >]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:233:5: required from ‘struct boost::EqualityComparable, boost::property, boost::no_property, boost::listS>, long unsigned int, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator >*, std::vector >, std::allocator > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, long int> >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:502:3: required from ‘struct boost::InputIterator, boost::property, boost::no_property, boost::listS>, long unsigned int, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator >*, std::vector >, std::allocator > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, long int> >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::InputIterator, boost::property, boost::no_property, boost::listS>, long unsigned int, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator >*, std::vector >, std::allocator > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, long int> >]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied, boost::property, boost::no_property, boost::listS>, long unsigned int, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator >*, std::vector >, std::allocator > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, long int> > >::value’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:45:51: [ skipping 3 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::MultiPassInputIterator, boost::property, boost::no_property, boost::listS>, long unsigned int, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator >*, std::vector >, std::allocator > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, long int> >]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/graph_concepts.hpp:159:9: required from ‘boost::concepts::AdjacencyGraph::~AdjacencyGraph() [with G = R_adjacency_list]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/graph_concepts.hpp:152:1: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::AdjacencyGraphConcept >]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/transitive_closure.hpp:74:5: required from ‘void boost::transitive_closure(const Graph&, GraphTC&, G_to_TC_VertexMap, VertexIndexMap) [with Graph = R_adjacency_list; GraphTC = R_adjacency_list; G_to_TC_VertexMap = iterator_property_map, long unsigned int>, long unsigned int, long unsigned int&>; VertexIndexMap = vec_adj_list_vertex_id_map, long unsigned int>]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/transitive_closure.hpp:288:23: required from ‘void boost::transitive_closure(const Graph&, GraphTC&) [with Graph = R_adjacency_list; GraphTC = R_adjacency_list]’ transitive_closure.cpp:29:24: required from here /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::EqualityComparable::~EqualityComparable() [with TT = boost::adjacency_iterator, boost::property, boost::no_property, boost::listS>, long unsigned int, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator >*, std::vector >, std::allocator > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, long int>]’ 37 | ~model() | ^ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:233:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 233 | BOOST_CONCEPT_USAGE(EqualityComparable) { | ^~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::InputIterator, boost::property, boost::no_property, boost::listS>, long unsigned int, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator >*, std::vector >, std::allocator > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, long int> >]’: /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements, boost::property, boost::no_property, boost::listS>, long unsigned int, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator >*, std::vector >, std::allocator > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, long int> > >]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:512:7: required from ‘struct boost::InputIterator, boost::property, boost::no_property, boost::listS>, long unsigned int, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator >*, std::vector >, std::allocator > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, long int> >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::InputIterator, boost::property, boost::no_property, boost::listS>, long unsigned int, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator >*, std::vector >, std::allocator > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, long int> >]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied, boost::property, boost::no_property, boost::listS>, long unsigned int, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator >*, std::vector >, std::allocator > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, long int> > >::value’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied, boost::property, boost::no_property, boost::listS>, long unsigned int, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator >*, std::vector >, std::allocator > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, long int> > >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:72:8: [ skipping 2 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::MultiPassInputIterator, boost::property, boost::no_property, boost::listS>, long unsigned int, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator >*, std::vector >, std::allocator > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, long int> >]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/graph_concepts.hpp:159:9: required from ‘boost::concepts::AdjacencyGraph::~AdjacencyGraph() [with G = R_adjacency_list]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/graph_concepts.hpp:152:1: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::AdjacencyGraphConcept >]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/transitive_closure.hpp:74:5: required from ‘void boost::transitive_closure(const Graph&, GraphTC&, G_to_TC_VertexMap, VertexIndexMap) [with Graph = R_adjacency_list; GraphTC = R_adjacency_list; G_to_TC_VertexMap = iterator_property_map, long unsigned int>, long unsigned int, long unsigned int&>; VertexIndexMap = vec_adj_list_vertex_id_map, long unsigned int>]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/transitive_closure.hpp:288:23: required from ‘void boost::transitive_closure(const Graph&, GraphTC&) [with Graph = R_adjacency_list; GraphTC = R_adjacency_list]’ transitive_closure.cpp:29:24: required from here /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::InputIterator::~InputIterator() [with TT = boost::adjacency_iterator, boost::property, boost::no_property, boost::listS>, long unsigned int, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator >*, std::vector >, std::allocator > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, long int>]’ 37 | ~model() | ^ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:512:7: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 512 | BOOST_CONCEPT_USAGE(InputIterator) | ^~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::Assignable<__gnu_cxx::__normal_iterator > >]’: /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements > > >]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:145:5: required from ‘struct boost::Assignable<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:502:3: required from ‘struct boost::InputIterator<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:540:3: required from ‘struct boost::ForwardIterator<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:568:3: required from ‘struct boost::BidirectionalIterator<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:597:3: [ skipping 7 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/strong_components.hpp:206:43: required from ‘static typename boost::property_traits::value_type boost::detail::strong_comp_dispatch1::apply(const Graph&, ComponentMap, const boost::bgl_named_params&, boost::param_not_found) [with Graph = R_adjacency_list; ComponentMap = boost::iterator_property_map, long unsigned int>, long unsigned int, long unsigned int&>; P = boost::vec_adj_list_vertex_id_map, long unsigned int>; T = boost::vertex_index_t; R = boost::no_property; typename boost::property_traits::value_type = long unsigned int]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/strong_components.hpp:220:63: required from ‘typename boost::property_traits::value_type boost::detail::scc_helper1(const Graph&, ComponentMap, const boost::bgl_named_params&, RootMap) [with Graph = R_adjacency_list; ComponentMap = boost::iterator_property_map, long unsigned int>, long unsigned int, long unsigned int&>; RootMap = boost::param_not_found; P = boost::vec_adj_list_vertex_id_map, long unsigned int>; T = boost::vertex_index_t; R = boost::no_property; typename boost::property_traits::value_type = long unsigned int]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/strong_components.hpp:235:31: required from ‘typename boost::property_traits::value_type boost::strong_components(const Graph&, ComponentMap, const bgl_named_params&, typename enable_if_c::traversal_category>::value, graph::detail::no_parameter>::type) [with Graph = R_adjacency_list; ComponentMap = iterator_property_map, long unsigned int>, long unsigned int, long unsigned int&>; P = vec_adj_list_vertex_id_map, long unsigned int>; T = vertex_index_t; R = no_property; typename property_traits::value_type = long unsigned int; typename enable_if_c::traversal_category>::value, graph::detail::no_parameter>::type = graph::detail::no_parameter; typename graph_traits::traversal_category = adj_list_dir_traversal_tag]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/transitive_closure.hpp:86:28: required from ‘void boost::transitive_closure(const Graph&, GraphTC&, G_to_TC_VertexMap, VertexIndexMap) [with Graph = R_adjacency_list; GraphTC = R_adjacency_list; G_to_TC_VertexMap = iterator_property_map, long unsigned int>, long unsigned int, long unsigned int&>; VertexIndexMap = vec_adj_list_vertex_id_map, long unsigned int>]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/transitive_closure.hpp:288:23: required from ‘void boost::transitive_closure(const Graph&, GraphTC&) [with Graph = R_adjacency_list; GraphTC = R_adjacency_list]’ transitive_closure.cpp:29:24: required from here /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::Assignable::~Assignable() [with TT = __gnu_cxx::__normal_iterator >]’ 37 | ~model() | ^ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:145:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 145 | BOOST_CONCEPT_USAGE(Assignable) { | ^~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::EqualityComparable<__gnu_cxx::__normal_iterator > >]’: /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements > > >]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:233:5: required from ‘struct boost::EqualityComparable<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:502:3: required from ‘struct boost::InputIterator<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:540:3: required from ‘struct boost::ForwardIterator<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:568:3: required from ‘struct boost::BidirectionalIterator<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:597:3: [ skipping 7 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/strong_components.hpp:206:43: required from ‘static typename boost::property_traits::value_type boost::detail::strong_comp_dispatch1::apply(const Graph&, ComponentMap, const boost::bgl_named_params&, boost::param_not_found) [with Graph = R_adjacency_list; ComponentMap = boost::iterator_property_map, long unsigned int>, long unsigned int, long unsigned int&>; P = boost::vec_adj_list_vertex_id_map, long unsigned int>; T = boost::vertex_index_t; R = boost::no_property; typename boost::property_traits::value_type = long unsigned int]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/strong_components.hpp:220:63: required from ‘typename boost::property_traits::value_type boost::detail::scc_helper1(const Graph&, ComponentMap, const boost::bgl_named_params&, RootMap) [with Graph = R_adjacency_list; ComponentMap = boost::iterator_property_map, long unsigned int>, long unsigned int, long unsigned int&>; RootMap = boost::param_not_found; P = boost::vec_adj_list_vertex_id_map, long unsigned int>; T = boost::vertex_index_t; R = boost::no_property; typename boost::property_traits::value_type = long unsigned int]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/strong_components.hpp:235:31: required from ‘typename boost::property_traits::value_type boost::strong_components(const Graph&, ComponentMap, const bgl_named_params&, typename enable_if_c::traversal_category>::value, graph::detail::no_parameter>::type) [with Graph = R_adjacency_list; ComponentMap = iterator_property_map, long unsigned int>, long unsigned int, long unsigned int&>; P = vec_adj_list_vertex_id_map, long unsigned int>; T = vertex_index_t; R = no_property; typename property_traits::value_type = long unsigned int; typename enable_if_c::traversal_category>::value, graph::detail::no_parameter>::type = graph::detail::no_parameter; typename graph_traits::traversal_category = adj_list_dir_traversal_tag]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/transitive_closure.hpp:86:28: required from ‘void boost::transitive_closure(const Graph&, GraphTC&, G_to_TC_VertexMap, VertexIndexMap) [with Graph = R_adjacency_list; GraphTC = R_adjacency_list; G_to_TC_VertexMap = iterator_property_map, long unsigned int>, long unsigned int, long unsigned int&>; VertexIndexMap = vec_adj_list_vertex_id_map, long unsigned int>]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/transitive_closure.hpp:288:23: required from ‘void boost::transitive_closure(const Graph&, GraphTC&) [with Graph = R_adjacency_list; GraphTC = R_adjacency_list]’ transitive_closure.cpp:29:24: required from here /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::EqualityComparable::~EqualityComparable() [with TT = __gnu_cxx::__normal_iterator >]’ 37 | ~model() | ^ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:233:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 233 | BOOST_CONCEPT_USAGE(EqualityComparable) { | ^~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::InputIterator<__gnu_cxx::__normal_iterator > >]’: /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements > > >]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:512:7: required from ‘struct boost::InputIterator<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:540:3: required from ‘struct boost::ForwardIterator<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:568:3: required from ‘struct boost::BidirectionalIterator<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:597:3: required from ‘struct boost::RandomAccessIterator<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:597:3: [ skipping 6 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/strong_components.hpp:206:43: required from ‘static typename boost::property_traits::value_type boost::detail::strong_comp_dispatch1::apply(const Graph&, ComponentMap, const boost::bgl_named_params&, boost::param_not_found) [with Graph = R_adjacency_list; ComponentMap = boost::iterator_property_map, long unsigned int>, long unsigned int, long unsigned int&>; P = boost::vec_adj_list_vertex_id_map, long unsigned int>; T = boost::vertex_index_t; R = boost::no_property; typename boost::property_traits::value_type = long unsigned int]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/strong_components.hpp:220:63: required from ‘typename boost::property_traits::value_type boost::detail::scc_helper1(const Graph&, ComponentMap, const boost::bgl_named_params&, RootMap) [with Graph = R_adjacency_list; ComponentMap = boost::iterator_property_map, long unsigned int>, long unsigned int, long unsigned int&>; RootMap = boost::param_not_found; P = boost::vec_adj_list_vertex_id_map, long unsigned int>; T = boost::vertex_index_t; R = boost::no_property; typename boost::property_traits::value_type = long unsigned int]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/strong_components.hpp:235:31: required from ‘typename boost::property_traits::value_type boost::strong_components(const Graph&, ComponentMap, const bgl_named_params&, typename enable_if_c::traversal_category>::value, graph::detail::no_parameter>::type) [with Graph = R_adjacency_list; ComponentMap = iterator_property_map, long unsigned int>, long unsigned int, long unsigned int&>; P = vec_adj_list_vertex_id_map, long unsigned int>; T = vertex_index_t; R = no_property; typename property_traits::value_type = long unsigned int; typename enable_if_c::traversal_category>::value, graph::detail::no_parameter>::type = graph::detail::no_parameter; typename graph_traits::traversal_category = adj_list_dir_traversal_tag]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/transitive_closure.hpp:86:28: required from ‘void boost::transitive_closure(const Graph&, GraphTC&, G_to_TC_VertexMap, VertexIndexMap) [with Graph = R_adjacency_list; GraphTC = R_adjacency_list; G_to_TC_VertexMap = iterator_property_map, long unsigned int>, long unsigned int, long unsigned int&>; VertexIndexMap = vec_adj_list_vertex_id_map, long unsigned int>]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/transitive_closure.hpp:288:23: required from ‘void boost::transitive_closure(const Graph&, GraphTC&) [with Graph = R_adjacency_list; GraphTC = R_adjacency_list]’ transitive_closure.cpp:29:24: required from here /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::InputIterator::~InputIterator() [with TT = __gnu_cxx::__normal_iterator >]’ 37 | ~model() | ^ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:512:7: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 512 | BOOST_CONCEPT_USAGE(InputIterator) | ^~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::ForwardIterator<__gnu_cxx::__normal_iterator > >]’: /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements > > >]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:543:7: required from ‘struct boost::ForwardIterator<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:568:3: required from ‘struct boost::BidirectionalIterator<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:597:3: required from ‘struct boost::RandomAccessIterator<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:597:3: required from ‘struct boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:32:62: [ skipping 5 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/strong_components.hpp:206:43: required from ‘static typename boost::property_traits::value_type boost::detail::strong_comp_dispatch1::apply(const Graph&, ComponentMap, const boost::bgl_named_params&, boost::param_not_found) [with Graph = R_adjacency_list; ComponentMap = boost::iterator_property_map, long unsigned int>, long unsigned int, long unsigned int&>; P = boost::vec_adj_list_vertex_id_map, long unsigned int>; T = boost::vertex_index_t; R = boost::no_property; typename boost::property_traits::value_type = long unsigned int]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/strong_components.hpp:220:63: required from ‘typename boost::property_traits::value_type boost::detail::scc_helper1(const Graph&, ComponentMap, const boost::bgl_named_params&, RootMap) [with Graph = R_adjacency_list; ComponentMap = boost::iterator_property_map, long unsigned int>, long unsigned int, long unsigned int&>; RootMap = boost::param_not_found; P = boost::vec_adj_list_vertex_id_map, long unsigned int>; T = boost::vertex_index_t; R = boost::no_property; typename boost::property_traits::value_type = long unsigned int]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/strong_components.hpp:235:31: required from ‘typename boost::property_traits::value_type boost::strong_components(const Graph&, ComponentMap, const bgl_named_params&, typename enable_if_c::traversal_category>::value, graph::detail::no_parameter>::type) [with Graph = R_adjacency_list; ComponentMap = iterator_property_map, long unsigned int>, long unsigned int, long unsigned int&>; P = vec_adj_list_vertex_id_map, long unsigned int>; T = vertex_index_t; R = no_property; typename property_traits::value_type = long unsigned int; typename enable_if_c::traversal_category>::value, graph::detail::no_parameter>::type = graph::detail::no_parameter; typename graph_traits::traversal_category = adj_list_dir_traversal_tag]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/transitive_closure.hpp:86:28: required from ‘void boost::transitive_closure(const Graph&, GraphTC&, G_to_TC_VertexMap, VertexIndexMap) [with Graph = R_adjacency_list; GraphTC = R_adjacency_list; G_to_TC_VertexMap = iterator_property_map, long unsigned int>, long unsigned int, long unsigned int&>; VertexIndexMap = vec_adj_list_vertex_id_map, long unsigned int>]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/transitive_closure.hpp:288:23: required from ‘void boost::transitive_closure(const Graph&, GraphTC&) [with Graph = R_adjacency_list; GraphTC = R_adjacency_list]’ transitive_closure.cpp:29:24: required from here /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::ForwardIterator::~ForwardIterator() [with TT = __gnu_cxx::__normal_iterator >]’ 37 | ~model() | ^ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:543:7: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 543 | BOOST_CONCEPT_USAGE(ForwardIterator) | ^~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::BidirectionalIterator<__gnu_cxx::__normal_iterator > >]’: /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements > > >]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:571:7: required from ‘struct boost::BidirectionalIterator<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:597:3: required from ‘struct boost::RandomAccessIterator<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:597:3: required from ‘struct boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator > >]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:42:5: [ skipping 4 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/strong_components.hpp:206:43: required from ‘static typename boost::property_traits::value_type boost::detail::strong_comp_dispatch1::apply(const Graph&, ComponentMap, const boost::bgl_named_params&, boost::param_not_found) [with Graph = R_adjacency_list; ComponentMap = boost::iterator_property_map, long unsigned int>, long unsigned int, long unsigned int&>; P = boost::vec_adj_list_vertex_id_map, long unsigned int>; T = boost::vertex_index_t; R = boost::no_property; typename boost::property_traits::value_type = long unsigned int]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/strong_components.hpp:220:63: required from ‘typename boost::property_traits::value_type boost::detail::scc_helper1(const Graph&, ComponentMap, const boost::bgl_named_params&, RootMap) [with Graph = R_adjacency_list; ComponentMap = boost::iterator_property_map, long unsigned int>, long unsigned int, long unsigned int&>; RootMap = boost::param_not_found; P = boost::vec_adj_list_vertex_id_map, long unsigned int>; T = boost::vertex_index_t; R = boost::no_property; typename boost::property_traits::value_type = long unsigned int]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/strong_components.hpp:235:31: required from ‘typename boost::property_traits::value_type boost::strong_components(const Graph&, ComponentMap, const bgl_named_params&, typename enable_if_c::traversal_category>::value, graph::detail::no_parameter>::type) [with Graph = R_adjacency_list; ComponentMap = iterator_property_map, long unsigned int>, long unsigned int, long unsigned int&>; P = vec_adj_list_vertex_id_map, long unsigned int>; T = vertex_index_t; R = no_property; typename property_traits::value_type = long unsigned int; typename enable_if_c::traversal_category>::value, graph::detail::no_parameter>::type = graph::detail::no_parameter; typename graph_traits::traversal_category = adj_list_dir_traversal_tag]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/transitive_closure.hpp:86:28: required from ‘void boost::transitive_closure(const Graph&, GraphTC&, G_to_TC_VertexMap, VertexIndexMap) [with Graph = R_adjacency_list; GraphTC = R_adjacency_list; G_to_TC_VertexMap = iterator_property_map, long unsigned int>, long unsigned int, long unsigned int&>; VertexIndexMap = vec_adj_list_vertex_id_map, long unsigned int>]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/transitive_closure.hpp:288:23: required from ‘void boost::transitive_closure(const Graph&, GraphTC&) [with Graph = R_adjacency_list; GraphTC = R_adjacency_list]’ transitive_closure.cpp:29:24: required from here /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::BidirectionalIterator::~BidirectionalIterator() [with TT = __gnu_cxx::__normal_iterator >]’ 37 | ~model() | ^ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:571:7: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 571 | BOOST_CONCEPT_USAGE(BidirectionalIterator) | ^~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::Comparable<__gnu_cxx::__normal_iterator > >]’: /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements > > >]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:253:5: required from ‘struct boost::Comparable<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:597:3: required from ‘struct boost::RandomAccessIterator<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:597:3: required from ‘struct boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator > >]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:42:5: [ skipping 4 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/strong_components.hpp:206:43: required from ‘static typename boost::property_traits::value_type boost::detail::strong_comp_dispatch1::apply(const Graph&, ComponentMap, const boost::bgl_named_params&, boost::param_not_found) [with Graph = R_adjacency_list; ComponentMap = boost::iterator_property_map, long unsigned int>, long unsigned int, long unsigned int&>; P = boost::vec_adj_list_vertex_id_map, long unsigned int>; T = boost::vertex_index_t; R = boost::no_property; typename boost::property_traits::value_type = long unsigned int]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/strong_components.hpp:220:63: required from ‘typename boost::property_traits::value_type boost::detail::scc_helper1(const Graph&, ComponentMap, const boost::bgl_named_params&, RootMap) [with Graph = R_adjacency_list; ComponentMap = boost::iterator_property_map, long unsigned int>, long unsigned int, long unsigned int&>; RootMap = boost::param_not_found; P = boost::vec_adj_list_vertex_id_map, long unsigned int>; T = boost::vertex_index_t; R = boost::no_property; typename boost::property_traits::value_type = long unsigned int]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/strong_components.hpp:235:31: required from ‘typename boost::property_traits::value_type boost::strong_components(const Graph&, ComponentMap, const bgl_named_params&, typename enable_if_c::traversal_category>::value, graph::detail::no_parameter>::type) [with Graph = R_adjacency_list; ComponentMap = iterator_property_map, long unsigned int>, long unsigned int, long unsigned int&>; P = vec_adj_list_vertex_id_map, long unsigned int>; T = vertex_index_t; R = no_property; typename property_traits::value_type = long unsigned int; typename enable_if_c::traversal_category>::value, graph::detail::no_parameter>::type = graph::detail::no_parameter; typename graph_traits::traversal_category = adj_list_dir_traversal_tag]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/transitive_closure.hpp:86:28: required from ‘void boost::transitive_closure(const Graph&, GraphTC&, G_to_TC_VertexMap, VertexIndexMap) [with Graph = R_adjacency_list; GraphTC = R_adjacency_list; G_to_TC_VertexMap = iterator_property_map, long unsigned int>, long unsigned int, long unsigned int&>; VertexIndexMap = vec_adj_list_vertex_id_map, long unsigned int>]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/transitive_closure.hpp:288:23: required from ‘void boost::transitive_closure(const Graph&, GraphTC&) [with Graph = R_adjacency_list; GraphTC = R_adjacency_list]’ transitive_closure.cpp:29:24: required from here /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::Comparable::~Comparable() [with TT = __gnu_cxx::__normal_iterator >]’ 37 | ~model() | ^ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:253:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 253 | BOOST_CONCEPT_USAGE(Comparable) { | ^~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::RandomAccessIterator<__gnu_cxx::__normal_iterator > >]’: /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements > > >]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:601:7: required from ‘struct boost::RandomAccessIterator<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:597:3: required from ‘struct boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator > >]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied > > >::value’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:45:51: [ skipping 3 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/strong_components.hpp:206:43: required from ‘static typename boost::property_traits::value_type boost::detail::strong_comp_dispatch1::apply(const Graph&, ComponentMap, const boost::bgl_named_params&, boost::param_not_found) [with Graph = R_adjacency_list; ComponentMap = boost::iterator_property_map, long unsigned int>, long unsigned int, long unsigned int&>; P = boost::vec_adj_list_vertex_id_map, long unsigned int>; T = boost::vertex_index_t; R = boost::no_property; typename boost::property_traits::value_type = long unsigned int]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/strong_components.hpp:220:63: required from ‘typename boost::property_traits::value_type boost::detail::scc_helper1(const Graph&, ComponentMap, const boost::bgl_named_params&, RootMap) [with Graph = R_adjacency_list; ComponentMap = boost::iterator_property_map, long unsigned int>, long unsigned int, long unsigned int&>; RootMap = boost::param_not_found; P = boost::vec_adj_list_vertex_id_map, long unsigned int>; T = boost::vertex_index_t; R = boost::no_property; typename boost::property_traits::value_type = long unsigned int]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/strong_components.hpp:235:31: required from ‘typename boost::property_traits::value_type boost::strong_components(const Graph&, ComponentMap, const bgl_named_params&, typename enable_if_c::traversal_category>::value, graph::detail::no_parameter>::type) [with Graph = R_adjacency_list; ComponentMap = iterator_property_map, long unsigned int>, long unsigned int, long unsigned int&>; P = vec_adj_list_vertex_id_map, long unsigned int>; T = vertex_index_t; R = no_property; typename property_traits::value_type = long unsigned int; typename enable_if_c::traversal_category>::value, graph::detail::no_parameter>::type = graph::detail::no_parameter; typename graph_traits::traversal_category = adj_list_dir_traversal_tag]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/transitive_closure.hpp:86:28: required from ‘void boost::transitive_closure(const Graph&, GraphTC&, G_to_TC_VertexMap, VertexIndexMap) [with Graph = R_adjacency_list; GraphTC = R_adjacency_list; G_to_TC_VertexMap = iterator_property_map, long unsigned int>, long unsigned int, long unsigned int&>; VertexIndexMap = vec_adj_list_vertex_id_map, long unsigned int>]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/transitive_closure.hpp:288:23: required from ‘void boost::transitive_closure(const Graph&, GraphTC&) [with Graph = R_adjacency_list; GraphTC = R_adjacency_list]’ transitive_closure.cpp:29:24: required from here /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::RandomAccessIterator::~RandomAccessIterator() [with TT = __gnu_cxx::__normal_iterator >]’ 37 | ~model() | ^ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:601:7: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 601 | BOOST_CONCEPT_USAGE(RandomAccessIterator) | ^~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::constraint::failed() [with Model = boost::DFSVisitorConcept > >, boost::adjacency_list >]’: /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/depth_first_search.hpp:130:9: required from ‘void boost::depth_first_search(const VertexListGraph&, DFSVisitor, ColorMap, typename graph_traits::vertex_descriptor) [with VertexListGraph = adjacency_list; DFSVisitor = topo_sort_visitor > >; ColorMap = shared_array_property_map >; typename graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/depth_first_search.hpp:397:42: required from ‘void boost::graph::detail::depth_first_search_impl::operator()(const Graph&, const ArgPack&) const [with ArgPack = boost::parameter::aux::arg_list > > >, boost::parameter::aux::arg_list >, boost::parameter::aux::empty_arg_list, std::integral_constant >, std::integral_constant >; Graph = boost::adjacency_list]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/depth_first_search.hpp:406:5: required from ‘typename boost::result_of(Param0, const ArgPack&)>::type boost::graph::depth_first_search_with_named_params(const Param0&, const ArgPack&) [with Param0 = boost::adjacency_list; ArgPack = boost::parameter::aux::arg_list > > >, boost::parameter::aux::arg_list >, boost::parameter::aux::empty_arg_list, std::integral_constant >, std::integral_constant >; typename boost::result_of(Param0, const ArgPack&)>::type = void]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/depth_first_search.hpp:409:1: required from ‘typename boost::result_of(Param0, const typename boost::detail::convert_bgl_params_to_boost_parameter >::type&)>::type boost::depth_first_search(const Param0&, const bgl_named_params&) [with Param0 = adjacency_list; P = topo_sort_visitor > >; T = graph_visitor_t; R = bgl_named_params, vertex_index_t, no_property>; typename result_of(Param0, const typename detail::convert_bgl_params_to_boost_parameter >::type&)>::type = void; typename detail::convert_bgl_params_to_boost_parameter >::type = parameter::aux::arg_list > > >, parameter::aux::arg_list >, parameter::aux::empty_arg_list, std::integral_constant >, std::integral_constant >]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/topological_sort.hpp:69:23: required from ‘void boost::topological_sort(VertexListGraph&, OutputIterator, const bgl_named_params&) [with VertexListGraph = adjacency_list; OutputIterator = std::back_insert_iterator >; P = typed_identity_property_map; T = vertex_index_t; R = no_property]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/transitive_closure.hpp:122:21: required from ‘void boost::transitive_closure(const Graph&, GraphTC&, G_to_TC_VertexMap, VertexIndexMap) [with Graph = R_adjacency_list; GraphTC = R_adjacency_list; G_to_TC_VertexMap = iterator_property_map, long unsigned int>, long unsigned int, long unsigned int&>; VertexIndexMap = vec_adj_list_vertex_id_map, long unsigned int>]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/transitive_closure.hpp:288:23: required from ‘void boost::transitive_closure(const Graph&, GraphTC&) [with Graph = R_adjacency_list; GraphTC = R_adjacency_list]’ transitive_closure.cpp:29:24: required from here /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:65:52: warning: ‘this’ pointer is null [-Wnonnull] 65 | static void failed() { ((Model*)0)->constraints(); } | ~~~~~~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/depth_first_search.hpp:39:10: note: in a call to non-static member function ‘void boost::DFSVisitorConcept::constraints() [with Visitor = boost::topo_sort_visitor > >; Graph = boost::adjacency_list]’ 39 | void constraints() | ^~~~~~~~~~~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::SignedInteger]’: /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:514:9: required from ‘boost::InputIterator::~InputIterator() [with TT = boost::range_detail::integer_iterator]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::InputIterator >]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/graph_concepts.hpp:53:35: required from ‘boost::concepts::MultiPassInputIterator::~MultiPassInputIterator() [with T = boost::range_detail::integer_iterator]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::MultiPassInputIterator >]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/graph_concepts.hpp:184:9: required from ‘boost::concepts::VertexListGraph::~VertexListGraph() [with G = R_adjacency_list]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/graph_concepts.hpp:176:1: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::VertexListGraphConcept >]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/transitive_closure.hpp:73:5: required from ‘void boost::transitive_closure(const Graph&, GraphTC&, G_to_TC_VertexMap, VertexIndexMap) [with Graph = R_adjacency_list; GraphTC = R_adjacency_list; G_to_TC_VertexMap = iterator_property_map, long unsigned int>, long unsigned int, long unsigned int&>; VertexIndexMap = vec_adj_list_vertex_id_map, long unsigned int>]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/transitive_closure.hpp:288:23: required from ‘void boost::transitive_closure(const Graph&, GraphTC&) [with Graph = R_adjacency_list; GraphTC = R_adjacency_list]’ transitive_closure.cpp:29:24: required from here /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:107:22: note: in a call to non-static member function ‘boost::SignedInteger::~SignedInteger()’ 107 | template <> struct SignedInteger {}; | ^~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements >]’: /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:208:5: required from ‘struct boost::Convertible’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::Convertible]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied >::value’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_)>’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:515:9: [ skipping 3 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::MultiPassInputIterator >]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/graph_concepts.hpp:184:9: required from ‘boost::concepts::VertexListGraph::~VertexListGraph() [with G = R_adjacency_list]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/graph_concepts.hpp:176:1: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::VertexListGraphConcept >]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/transitive_closure.hpp:73:5: required from ‘void boost::transitive_closure(const Graph&, GraphTC&, G_to_TC_VertexMap, VertexIndexMap) [with Graph = R_adjacency_list; GraphTC = R_adjacency_list; G_to_TC_VertexMap = iterator_property_map, long unsigned int>, long unsigned int, long unsigned int&>; VertexIndexMap = vec_adj_list_vertex_id_map, long unsigned int>]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/transitive_closure.hpp:288:23: required from ‘void boost::transitive_closure(const Graph&, GraphTC&) [with Graph = R_adjacency_list; GraphTC = R_adjacency_list]’ transitive_closure.cpp:29:24: required from here /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::Convertible]’ 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ^ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::Convertible]’: /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:515:9: required from ‘boost::InputIterator::~InputIterator() [with TT = boost::range_detail::integer_iterator]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::InputIterator >]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/graph_concepts.hpp:53:35: required from ‘boost::concepts::MultiPassInputIterator::~MultiPassInputIterator() [with T = boost::range_detail::integer_iterator]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::MultiPassInputIterator >]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/graph_concepts.hpp:184:9: required from ‘boost::concepts::VertexListGraph::~VertexListGraph() [with G = R_adjacency_list]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/graph_concepts.hpp:176:1: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::VertexListGraphConcept >]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/transitive_closure.hpp:73:5: required from ‘void boost::transitive_closure(const Graph&, GraphTC&, G_to_TC_VertexMap, VertexIndexMap) [with Graph = R_adjacency_list; GraphTC = R_adjacency_list; G_to_TC_VertexMap = iterator_property_map, long unsigned int>, long unsigned int, long unsigned int&>; VertexIndexMap = vec_adj_list_vertex_id_map, long unsigned int>]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/transitive_closure.hpp:288:23: required from ‘void boost::transitive_closure(const Graph&, GraphTC&) [with Graph = R_adjacency_list; GraphTC = R_adjacency_list]’ transitive_closure.cpp:29:24: required from here /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::Convertible::~Convertible() [with X = std::random_access_iterator_tag; Y = std::input_iterator_tag]’ 37 | ~model() | ^ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:208:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 208 | BOOST_CONCEPT_USAGE(Convertible) { | ^~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements, std::input_iterator_tag> >]’: /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:208:5: required from ‘struct boost::Convertible, std::input_iterator_tag>’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::Convertible, std::input_iterator_tag>]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied, std::input_iterator_tag> >::value’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied, std::input_iterator_tag> >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_, std::input_iterator_tag>)>’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:515:9: [ skipping 3 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::MultiPassInputIterator, boost::property, boost::no_property, boost::listS>, long unsigned int, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator >*, std::vector >, std::allocator > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, long int> >]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/graph_concepts.hpp:159:9: required from ‘boost::concepts::AdjacencyGraph::~AdjacencyGraph() [with G = R_adjacency_list]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/graph_concepts.hpp:152:1: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::AdjacencyGraphConcept >]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/transitive_closure.hpp:74:5: required from ‘void boost::transitive_closure(const Graph&, GraphTC&, G_to_TC_VertexMap, VertexIndexMap) [with Graph = R_adjacency_list; GraphTC = R_adjacency_list; G_to_TC_VertexMap = iterator_property_map, long unsigned int>, long unsigned int, long unsigned int&>; VertexIndexMap = vec_adj_list_vertex_id_map, long unsigned int>]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/transitive_closure.hpp:288:23: required from ‘void boost::transitive_closure(const Graph&, GraphTC&) [with Graph = R_adjacency_list; GraphTC = R_adjacency_list]’ transitive_closure.cpp:29:24: required from here /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::Convertible, std::input_iterator_tag>]’ 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ^ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::Convertible, std::input_iterator_tag>]’: /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:515:9: required from ‘boost::InputIterator::~InputIterator() [with TT = boost::adjacency_iterator, boost::property, boost::no_property, boost::listS>, long unsigned int, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator >*, std::vector >, std::allocator > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, long int>]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::InputIterator, boost::property, boost::no_property, boost::listS>, long unsigned int, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator >*, std::vector >, std::allocator > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, long int> >]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/graph_concepts.hpp:53:35: required from ‘boost::concepts::MultiPassInputIterator::~MultiPassInputIterator() [with T = boost::adjacency_iterator, boost::property, boost::no_property, boost::listS>, long unsigned int, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator >*, std::vector >, std::allocator > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, long int>]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::MultiPassInputIterator, boost::property, boost::no_property, boost::listS>, long unsigned int, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator >*, std::vector >, std::allocator > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, long int> >]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/graph_concepts.hpp:159:9: required from ‘boost::concepts::AdjacencyGraph::~AdjacencyGraph() [with G = R_adjacency_list]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/graph_concepts.hpp:152:1: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::AdjacencyGraphConcept >]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/transitive_closure.hpp:74:5: required from ‘void boost::transitive_closure(const Graph&, GraphTC&, G_to_TC_VertexMap, VertexIndexMap) [with Graph = R_adjacency_list; GraphTC = R_adjacency_list; G_to_TC_VertexMap = iterator_property_map, long unsigned int>, long unsigned int, long unsigned int&>; VertexIndexMap = vec_adj_list_vertex_id_map, long unsigned int>]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/transitive_closure.hpp:288:23: required from ‘void boost::transitive_closure(const Graph&, GraphTC&) [with Graph = R_adjacency_list; GraphTC = R_adjacency_list]’ transitive_closure.cpp:29:24: required from here /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::Convertible::~Convertible() [with X = boost::iterators::detail::iterator_category_with_traversal; Y = std::input_iterator_tag]’ 37 | ~model() | ^ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:208:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 208 | BOOST_CONCEPT_USAGE(Convertible) { | ^~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements >]’: /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:208:5: required from ‘struct boost::Convertible’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::Convertible]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied >::value’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_)>’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:603:11: [ skipping 3 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/strong_components.hpp:206:43: required from ‘static typename boost::property_traits::value_type boost::detail::strong_comp_dispatch1::apply(const Graph&, ComponentMap, const boost::bgl_named_params&, boost::param_not_found) [with Graph = R_adjacency_list; ComponentMap = boost::iterator_property_map, long unsigned int>, long unsigned int, long unsigned int&>; P = boost::vec_adj_list_vertex_id_map, long unsigned int>; T = boost::vertex_index_t; R = boost::no_property; typename boost::property_traits::value_type = long unsigned int]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/strong_components.hpp:220:63: required from ‘typename boost::property_traits::value_type boost::detail::scc_helper1(const Graph&, ComponentMap, const boost::bgl_named_params&, RootMap) [with Graph = R_adjacency_list; ComponentMap = boost::iterator_property_map, long unsigned int>, long unsigned int, long unsigned int&>; RootMap = boost::param_not_found; P = boost::vec_adj_list_vertex_id_map, long unsigned int>; T = boost::vertex_index_t; R = boost::no_property; typename boost::property_traits::value_type = long unsigned int]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/strong_components.hpp:235:31: required from ‘typename boost::property_traits::value_type boost::strong_components(const Graph&, ComponentMap, const bgl_named_params&, typename enable_if_c::traversal_category>::value, graph::detail::no_parameter>::type) [with Graph = R_adjacency_list; ComponentMap = iterator_property_map, long unsigned int>, long unsigned int, long unsigned int&>; P = vec_adj_list_vertex_id_map, long unsigned int>; T = vertex_index_t; R = no_property; typename property_traits::value_type = long unsigned int; typename enable_if_c::traversal_category>::value, graph::detail::no_parameter>::type = graph::detail::no_parameter; typename graph_traits::traversal_category = adj_list_dir_traversal_tag]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/transitive_closure.hpp:86:28: required from ‘void boost::transitive_closure(const Graph&, GraphTC&, G_to_TC_VertexMap, VertexIndexMap) [with Graph = R_adjacency_list; GraphTC = R_adjacency_list; G_to_TC_VertexMap = iterator_property_map, long unsigned int>, long unsigned int, long unsigned int&>; VertexIndexMap = vec_adj_list_vertex_id_map, long unsigned int>]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/transitive_closure.hpp:288:23: required from ‘void boost::transitive_closure(const Graph&, GraphTC&) [with Graph = R_adjacency_list; GraphTC = R_adjacency_list]’ transitive_closure.cpp:29:24: required from here /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::Convertible]’ 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ^ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::Convertible]’: /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:603:11: required from ‘boost::RandomAccessIterator::~RandomAccessIterator() [with TT = __gnu_cxx::__normal_iterator >]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:597:3: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator > >]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/property_map/property_map.hpp:354:5: required from ‘boost::iterator_property_map boost::make_iterator_property_map(RAIter, ID, Value) [with RAIter = __gnu_cxx::__normal_iterator >; Value = long unsigned int; ID = vec_adj_list_vertex_id_map, long unsigned int>]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/strong_components.hpp:206:43: required from ‘static typename boost::property_traits::value_type boost::detail::strong_comp_dispatch1::apply(const Graph&, ComponentMap, const boost::bgl_named_params&, boost::param_not_found) [with Graph = R_adjacency_list; ComponentMap = boost::iterator_property_map, long unsigned int>, long unsigned int, long unsigned int&>; P = boost::vec_adj_list_vertex_id_map, long unsigned int>; T = boost::vertex_index_t; R = boost::no_property; typename boost::property_traits::value_type = long unsigned int]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/strong_components.hpp:220:63: required from ‘typename boost::property_traits::value_type boost::detail::scc_helper1(const Graph&, ComponentMap, const boost::bgl_named_params&, RootMap) [with Graph = R_adjacency_list; ComponentMap = boost::iterator_property_map, long unsigned int>, long unsigned int, long unsigned int&>; RootMap = boost::param_not_found; P = boost::vec_adj_list_vertex_id_map, long unsigned int>; T = boost::vertex_index_t; R = boost::no_property; typename boost::property_traits::value_type = long unsigned int]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/strong_components.hpp:235:31: required from ‘typename boost::property_traits::value_type boost::strong_components(const Graph&, ComponentMap, const bgl_named_params&, typename enable_if_c::traversal_category>::value, graph::detail::no_parameter>::type) [with Graph = R_adjacency_list; ComponentMap = iterator_property_map, long unsigned int>, long unsigned int, long unsigned int&>; P = vec_adj_list_vertex_id_map, long unsigned int>; T = vertex_index_t; R = no_property; typename property_traits::value_type = long unsigned int; typename enable_if_c::traversal_category>::value, graph::detail::no_parameter>::type = graph::detail::no_parameter; typename graph_traits::traversal_category = adj_list_dir_traversal_tag]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/transitive_closure.hpp:86:28: required from ‘void boost::transitive_closure(const Graph&, GraphTC&, G_to_TC_VertexMap, VertexIndexMap) [with Graph = R_adjacency_list; GraphTC = R_adjacency_list; G_to_TC_VertexMap = iterator_property_map, long unsigned int>, long unsigned int, long unsigned int&>; VertexIndexMap = vec_adj_list_vertex_id_map, long unsigned int>]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/transitive_closure.hpp:288:23: required from ‘void boost::transitive_closure(const Graph&, GraphTC&) [with Graph = R_adjacency_list; GraphTC = R_adjacency_list]’ transitive_closure.cpp:29:24: required from here /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::Convertible::~Convertible() [with X = std::random_access_iterator_tag; Y = std::random_access_iterator_tag]’ 37 | ~model() | ^ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:208:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 208 | BOOST_CONCEPT_USAGE(Convertible) { | ^~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::constraint::failed() [with Model = boost::ReadWritePropertyMapConcept, long unsigned int>, long unsigned int, long unsigned int&>, long unsigned int>]’: /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/strong_components.hpp:115:9: required from ‘typename boost::property_traits::value_type boost::detail::strong_components_impl(const Graph&, ComponentMap, RootMap, DiscoverTime, const boost::bgl_named_params&) [with Graph = R_adjacency_list; ComponentMap = boost::iterator_property_map, long unsigned int>, long unsigned int, long unsigned int&>; RootMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>; DiscoverTime = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>; P = boost::vec_adj_list_vertex_id_map, long unsigned int>; T = boost::vertex_index_t; R = boost::no_property; typename boost::property_traits::value_type = long unsigned int]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/strong_components.hpp:162:42: required from ‘static typename boost::property_traits::value_type boost::detail::strong_comp_dispatch2::apply(const Graph&, ComponentMap, RootMap, const boost::bgl_named_params&, boost::param_not_found) [with Graph = R_adjacency_list; ComponentMap = boost::iterator_property_map, long unsigned int>, long unsigned int, long unsigned int&>; RootMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>; P = boost::vec_adj_list_vertex_id_map, long unsigned int>; T = boost::vertex_index_t; R = boost::no_property; typename boost::property_traits::value_type = long unsigned int]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/strong_components.hpp:177:63: required from ‘typename boost::property_traits::value_type boost::detail::scc_helper2(const Graph&, ComponentMap, RootMap, const boost::bgl_named_params&, DiscoverTimeMap) [with Graph = R_adjacency_list; ComponentMap = boost::iterator_property_map, long unsigned int>, long unsigned int, long unsigned int&>; RootMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>; P = boost::vec_adj_list_vertex_id_map, long unsigned int>; T = boost::vertex_index_t; R = boost::no_property; DiscoverTimeMap = boost::param_not_found; typename boost::property_traits::value_type = long unsigned int]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/strong_components.hpp:205:31: required from ‘static typename boost::property_traits::value_type boost::detail::strong_comp_dispatch1::apply(const Graph&, ComponentMap, const boost::bgl_named_params&, boost::param_not_found) [with Graph = R_adjacency_list; ComponentMap = boost::iterator_property_map, long unsigned int>, long unsigned int, long unsigned int&>; P = boost::vec_adj_list_vertex_id_map, long unsigned int>; T = boost::vertex_index_t; R = boost::no_property; typename boost::property_traits::value_type = long unsigned int]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/strong_components.hpp:220:63: required from ‘typename boost::property_traits::value_type boost::detail::scc_helper1(const Graph&, ComponentMap, const boost::bgl_named_params&, RootMap) [with Graph = R_adjacency_list; ComponentMap = boost::iterator_property_map, long unsigned int>, long unsigned int, long unsigned int&>; RootMap = boost::param_not_found; P = boost::vec_adj_list_vertex_id_map, long unsigned int>; T = boost::vertex_index_t; R = boost::no_property; typename boost::property_traits::value_type = long unsigned int]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/strong_components.hpp:235:31: required from ‘typename boost::property_traits::value_type boost::strong_components(const Graph&, ComponentMap, const bgl_named_params&, typename enable_if_c::traversal_category>::value, graph::detail::no_parameter>::type) [with Graph = R_adjacency_list; ComponentMap = iterator_property_map, long unsigned int>, long unsigned int, long unsigned int&>; P = vec_adj_list_vertex_id_map, long unsigned int>; T = vertex_index_t; R = no_property; typename property_traits::value_type = long unsigned int; typename enable_if_c::traversal_category>::value, graph::detail::no_parameter>::type = graph::detail::no_parameter; typename graph_traits::traversal_category = adj_list_dir_traversal_tag]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/transitive_closure.hpp:86:28: required from ‘void boost::transitive_closure(const Graph&, GraphTC&, G_to_TC_VertexMap, VertexIndexMap) [with Graph = R_adjacency_list; GraphTC = R_adjacency_list; G_to_TC_VertexMap = iterator_property_map, long unsigned int>, long unsigned int, long unsigned int&>; VertexIndexMap = vec_adj_list_vertex_id_map, long unsigned int>]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/transitive_closure.hpp:288:23: required from ‘void boost::transitive_closure(const Graph&, GraphTC&) [with Graph = R_adjacency_list; GraphTC = R_adjacency_list]’ transitive_closure.cpp:29:24: required from here /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:65:52: warning: ‘this’ pointer is null [-Wnonnull] 65 | static void failed() { ((Model*)0)->constraints(); } | ~~~~~~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/property_map/property_map.hpp:205:10: note: in a call to non-static member function ‘void boost::ReadWritePropertyMapConcept::constraints() [with PMap = boost::iterator_property_map, long unsigned int>, long unsigned int, long unsigned int&>; Key = long unsigned int]’ 205 | void constraints() { | ^~~~~~~~~~~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::constraint::failed() [with Model = boost::ReadWritePropertyMapConcept >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>, long unsigned int>]’: /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/depth_first_search.hpp:134:9: required from ‘typename boost::property_traits::value_type boost::detail::strong_components_impl(const Graph&, ComponentMap, RootMap, DiscoverTime, const boost::bgl_named_params&) [with Graph = R_adjacency_list; ComponentMap = boost::iterator_property_map, long unsigned int>, long unsigned int, long unsigned int&>; RootMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>; DiscoverTime = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>; P = boost::vec_adj_list_vertex_id_map, long unsigned int>; T = boost::vertex_index_t; R = boost::no_property; typename boost::property_traits::value_type = long unsigned int]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/strong_components.hpp:162:42: required from ‘static typename boost::property_traits::value_type boost::detail::strong_comp_dispatch2::apply(const Graph&, ComponentMap, RootMap, const boost::bgl_named_params&, boost::param_not_found) [with Graph = R_adjacency_list; ComponentMap = boost::iterator_property_map, long unsigned int>, long unsigned int, long unsigned int&>; RootMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>; P = boost::vec_adj_list_vertex_id_map, long unsigned int>; T = boost::vertex_index_t; R = boost::no_property; typename boost::property_traits::value_type = long unsigned int]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/strong_components.hpp:177:63: required from ‘typename boost::property_traits::value_type boost::detail::scc_helper2(const Graph&, ComponentMap, RootMap, const boost::bgl_named_params&, DiscoverTimeMap) [with Graph = R_adjacency_list; ComponentMap = boost::iterator_property_map, long unsigned int>, long unsigned int, long unsigned int&>; RootMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>; P = boost::vec_adj_list_vertex_id_map, long unsigned int>; T = boost::vertex_index_t; R = boost::no_property; DiscoverTimeMap = boost::param_not_found; typename boost::property_traits::value_type = long unsigned int]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/strong_components.hpp:205:31: required from ‘static typename boost::property_traits::value_type boost::detail::strong_comp_dispatch1::apply(const Graph&, ComponentMap, const boost::bgl_named_params&, boost::param_not_found) [with Graph = R_adjacency_list; ComponentMap = boost::iterator_property_map, long unsigned int>, long unsigned int, long unsigned int&>; P = boost::vec_adj_list_vertex_id_map, long unsigned int>; T = boost::vertex_index_t; R = boost::no_property; typename boost::property_traits::value_type = long unsigned int]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/strong_components.hpp:220:63: required from ‘typename boost::property_traits::value_type boost::detail::scc_helper1(const Graph&, ComponentMap, const boost::bgl_named_params&, RootMap) [with Graph = R_adjacency_list; ComponentMap = boost::iterator_property_map, long unsigned int>, long unsigned int, long unsigned int&>; RootMap = boost::param_not_found; P = boost::vec_adj_list_vertex_id_map, long unsigned int>; T = boost::vertex_index_t; R = boost::no_property; typename boost::property_traits::value_type = long unsigned int]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/strong_components.hpp:235:31: required from ‘typename boost::property_traits::value_type boost::strong_components(const Graph&, ComponentMap, const bgl_named_params&, typename enable_if_c::traversal_category>::value, graph::detail::no_parameter>::type) [with Graph = R_adjacency_list; ComponentMap = iterator_property_map, long unsigned int>, long unsigned int, long unsigned int&>; P = vec_adj_list_vertex_id_map, long unsigned int>; T = vertex_index_t; R = no_property; typename property_traits::value_type = long unsigned int; typename enable_if_c::traversal_category>::value, graph::detail::no_parameter>::type = graph::detail::no_parameter; typename graph_traits::traversal_category = adj_list_dir_traversal_tag]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/transitive_closure.hpp:86:28: required from ‘void boost::transitive_closure(const Graph&, GraphTC&, G_to_TC_VertexMap, VertexIndexMap) [with Graph = R_adjacency_list; GraphTC = R_adjacency_list; G_to_TC_VertexMap = iterator_property_map, long unsigned int>, long unsigned int, long unsigned int&>; VertexIndexMap = vec_adj_list_vertex_id_map, long unsigned int>]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/transitive_closure.hpp:288:23: required from ‘void boost::transitive_closure(const Graph&, GraphTC&) [with Graph = R_adjacency_list; GraphTC = R_adjacency_list]’ transitive_closure.cpp:29:24: required from here /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:65:52: warning: ‘this’ pointer is null [-Wnonnull] 65 | static void failed() { ((Model*)0)->constraints(); } | ~~~~~~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/property_map/property_map.hpp:205:10: note: in a call to non-static member function ‘void boost::ReadWritePropertyMapConcept::constraints() [with PMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>; Key = long unsigned int]’ 205 | void constraints() { | ^~~~~~~~~~~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements >]’: /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:208:5: required from ‘struct boost::Convertible’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:206:3: required from ‘struct boost::ConvertibleConcept’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::ConvertibleConcept]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied >::value’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:72:8: [ skipping 4 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/strong_components.hpp:205:31: required from ‘static typename boost::property_traits::value_type boost::detail::strong_comp_dispatch1::apply(const Graph&, ComponentMap, const boost::bgl_named_params&, boost::param_not_found) [with Graph = R_adjacency_list; ComponentMap = boost::iterator_property_map, long unsigned int>, long unsigned int, long unsigned int&>; P = boost::vec_adj_list_vertex_id_map, long unsigned int>; T = boost::vertex_index_t; R = boost::no_property; typename boost::property_traits::value_type = long unsigned int]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/strong_components.hpp:220:63: required from ‘typename boost::property_traits::value_type boost::detail::scc_helper1(const Graph&, ComponentMap, const boost::bgl_named_params&, RootMap) [with Graph = R_adjacency_list; ComponentMap = boost::iterator_property_map, long unsigned int>, long unsigned int, long unsigned int&>; RootMap = boost::param_not_found; P = boost::vec_adj_list_vertex_id_map, long unsigned int>; T = boost::vertex_index_t; R = boost::no_property; typename boost::property_traits::value_type = long unsigned int]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/strong_components.hpp:235:31: required from ‘typename boost::property_traits::value_type boost::strong_components(const Graph&, ComponentMap, const bgl_named_params&, typename enable_if_c::traversal_category>::value, graph::detail::no_parameter>::type) [with Graph = R_adjacency_list; ComponentMap = iterator_property_map, long unsigned int>, long unsigned int, long unsigned int&>; P = vec_adj_list_vertex_id_map, long unsigned int>; T = vertex_index_t; R = no_property; typename property_traits::value_type = long unsigned int; typename enable_if_c::traversal_category>::value, graph::detail::no_parameter>::type = graph::detail::no_parameter; typename graph_traits::traversal_category = adj_list_dir_traversal_tag]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/transitive_closure.hpp:86:28: required from ‘void boost::transitive_closure(const Graph&, GraphTC&, G_to_TC_VertexMap, VertexIndexMap) [with Graph = R_adjacency_list; GraphTC = R_adjacency_list; G_to_TC_VertexMap = iterator_property_map, long unsigned int>, long unsigned int, long unsigned int&>; VertexIndexMap = vec_adj_list_vertex_id_map, long unsigned int>]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/transitive_closure.hpp:288:23: required from ‘void boost::transitive_closure(const Graph&, GraphTC&) [with Graph = R_adjacency_list; GraphTC = R_adjacency_list]’ transitive_closure.cpp:29:24: required from here /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::Convertible]’ 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ^ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::ConvertibleConcept]’: /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/strong_components.hpp:119:9: required from ‘typename boost::property_traits::value_type boost::detail::strong_components_impl(const Graph&, ComponentMap, RootMap, DiscoverTime, const boost::bgl_named_params&) [with Graph = R_adjacency_list; ComponentMap = boost::iterator_property_map, long unsigned int>, long unsigned int, long unsigned int&>; RootMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>; DiscoverTime = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>; P = boost::vec_adj_list_vertex_id_map, long unsigned int>; T = boost::vertex_index_t; R = boost::no_property; typename boost::property_traits::value_type = long unsigned int]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/strong_components.hpp:162:42: required from ‘static typename boost::property_traits::value_type boost::detail::strong_comp_dispatch2::apply(const Graph&, ComponentMap, RootMap, const boost::bgl_named_params&, boost::param_not_found) [with Graph = R_adjacency_list; ComponentMap = boost::iterator_property_map, long unsigned int>, long unsigned int, long unsigned int&>; RootMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>; P = boost::vec_adj_list_vertex_id_map, long unsigned int>; T = boost::vertex_index_t; R = boost::no_property; typename boost::property_traits::value_type = long unsigned int]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/strong_components.hpp:177:63: required from ‘typename boost::property_traits::value_type boost::detail::scc_helper2(const Graph&, ComponentMap, RootMap, const boost::bgl_named_params&, DiscoverTimeMap) [with Graph = R_adjacency_list; ComponentMap = boost::iterator_property_map, long unsigned int>, long unsigned int, long unsigned int&>; RootMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>; P = boost::vec_adj_list_vertex_id_map, long unsigned int>; T = boost::vertex_index_t; R = boost::no_property; DiscoverTimeMap = boost::param_not_found; typename boost::property_traits::value_type = long unsigned int]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/strong_components.hpp:205:31: required from ‘static typename boost::property_traits::value_type boost::detail::strong_comp_dispatch1::apply(const Graph&, ComponentMap, const boost::bgl_named_params&, boost::param_not_found) [with Graph = R_adjacency_list; ComponentMap = boost::iterator_property_map, long unsigned int>, long unsigned int, long unsigned int&>; P = boost::vec_adj_list_vertex_id_map, long unsigned int>; T = boost::vertex_index_t; R = boost::no_property; typename boost::property_traits::value_type = long unsigned int]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/strong_components.hpp:220:63: required from ‘typename boost::property_traits::value_type boost::detail::scc_helper1(const Graph&, ComponentMap, const boost::bgl_named_params&, RootMap) [with Graph = R_adjacency_list; ComponentMap = boost::iterator_property_map, long unsigned int>, long unsigned int, long unsigned int&>; RootMap = boost::param_not_found; P = boost::vec_adj_list_vertex_id_map, long unsigned int>; T = boost::vertex_index_t; R = boost::no_property; typename boost::property_traits::value_type = long unsigned int]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/strong_components.hpp:235:31: required from ‘typename boost::property_traits::value_type boost::strong_components(const Graph&, ComponentMap, const bgl_named_params&, typename enable_if_c::traversal_category>::value, graph::detail::no_parameter>::type) [with Graph = R_adjacency_list; ComponentMap = iterator_property_map, long unsigned int>, long unsigned int, long unsigned int&>; P = vec_adj_list_vertex_id_map, long unsigned int>; T = vertex_index_t; R = no_property; typename property_traits::value_type = long unsigned int; typename enable_if_c::traversal_category>::value, graph::detail::no_parameter>::type = graph::detail::no_parameter; typename graph_traits::traversal_category = adj_list_dir_traversal_tag]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/transitive_closure.hpp:86:28: required from ‘void boost::transitive_closure(const Graph&, GraphTC&, G_to_TC_VertexMap, VertexIndexMap) [with Graph = R_adjacency_list; GraphTC = R_adjacency_list; G_to_TC_VertexMap = iterator_property_map, long unsigned int>, long unsigned int, long unsigned int&>; VertexIndexMap = vec_adj_list_vertex_id_map, long unsigned int>]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/transitive_closure.hpp:288:23: required from ‘void boost::transitive_closure(const Graph&, GraphTC&) [with Graph = R_adjacency_list; GraphTC = R_adjacency_list]’ transitive_closure.cpp:29:24: required from here /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:206:17: note: in a call to non-static member function ‘boost::ConvertibleConcept::~ConvertibleConcept()’ 206 | BOOST_concept(Convertible,(X)(Y)) | ^~~~~~~~~~~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/preprocessor/cat.hpp:29:34: note: in definition of macro ‘BOOST_PP_CAT_I’ 29 | # define BOOST_PP_CAT_I(a, b) a ## b | ^ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/concept_def.hpp:23:12: note: in expansion of macro ‘BOOST_PP_CAT’ 23 | struct BOOST_PP_CAT(name,Concept) \ | ^~~~~~~~~~~~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:206:3: note: in expansion of macro ‘BOOST_concept’ 206 | BOOST_concept(Convertible,(X)(Y)) | ^~~~~~~~~~~~~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements > > > >]’: /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:167:5: required from ‘struct boost::CopyConstructible > > >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:165:3: required from ‘struct boost::CopyConstructibleConcept > > >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::CopyConstructibleConcept > > >]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied > > > >::value’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied > > > >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:72:8: [ skipping 8 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/depth_first_search.hpp:406:5: required from ‘typename boost::result_of(Param0, const ArgPack&)>::type boost::graph::depth_first_search_with_named_params(const Param0&, const ArgPack&) [with Param0 = boost::adjacency_list; ArgPack = boost::parameter::aux::arg_list > > >, boost::parameter::aux::arg_list >, boost::parameter::aux::empty_arg_list, std::integral_constant >, std::integral_constant >; typename boost::result_of(Param0, const ArgPack&)>::type = void]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/depth_first_search.hpp:409:1: required from ‘typename boost::result_of(Param0, const typename boost::detail::convert_bgl_params_to_boost_parameter >::type&)>::type boost::depth_first_search(const Param0&, const bgl_named_params&) [with Param0 = adjacency_list; P = topo_sort_visitor > >; T = graph_visitor_t; R = bgl_named_params, vertex_index_t, no_property>; typename result_of(Param0, const typename detail::convert_bgl_params_to_boost_parameter >::type&)>::type = void; typename detail::convert_bgl_params_to_boost_parameter >::type = parameter::aux::arg_list > > >, parameter::aux::arg_list >, parameter::aux::empty_arg_list, std::integral_constant >, std::integral_constant >]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/topological_sort.hpp:69:23: required from ‘void boost::topological_sort(VertexListGraph&, OutputIterator, const bgl_named_params&) [with VertexListGraph = adjacency_list; OutputIterator = std::back_insert_iterator >; P = typed_identity_property_map; T = vertex_index_t; R = no_property]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/transitive_closure.hpp:122:21: required from ‘void boost::transitive_closure(const Graph&, GraphTC&, G_to_TC_VertexMap, VertexIndexMap) [with Graph = R_adjacency_list; GraphTC = R_adjacency_list; G_to_TC_VertexMap = iterator_property_map, long unsigned int>, long unsigned int, long unsigned int&>; VertexIndexMap = vec_adj_list_vertex_id_map, long unsigned int>]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/transitive_closure.hpp:288:23: required from ‘void boost::transitive_closure(const Graph&, GraphTC&) [with Graph = R_adjacency_list; GraphTC = R_adjacency_list]’ transitive_closure.cpp:29:24: required from here /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::CopyConstructible > > >]’ 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ^ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::CopyConstructibleConcept > > >]’: /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/depth_first_search.hpp:41:9: required from ‘void boost::DFSVisitorConcept::constraints() [with Visitor = boost::topo_sort_visitor > >; Graph = boost::adjacency_list]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::DFSVisitorConcept > >, boost::adjacency_list >]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied > >, boost::adjacency_list > >::value’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied > >, boost::adjacency_list > >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_ > >, boost::adjacency_list >)>’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/depth_first_search.hpp:130:9: [ skipping 2 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/depth_first_search.hpp:406:5: required from ‘typename boost::result_of(Param0, const ArgPack&)>::type boost::graph::depth_first_search_with_named_params(const Param0&, const ArgPack&) [with Param0 = boost::adjacency_list; ArgPack = boost::parameter::aux::arg_list > > >, boost::parameter::aux::arg_list >, boost::parameter::aux::empty_arg_list, std::integral_constant >, std::integral_constant >; typename boost::result_of(Param0, const ArgPack&)>::type = void]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/depth_first_search.hpp:409:1: required from ‘typename boost::result_of(Param0, const typename boost::detail::convert_bgl_params_to_boost_parameter >::type&)>::type boost::depth_first_search(const Param0&, const bgl_named_params&) [with Param0 = adjacency_list; P = topo_sort_visitor > >; T = graph_visitor_t; R = bgl_named_params, vertex_index_t, no_property>; typename result_of(Param0, const typename detail::convert_bgl_params_to_boost_parameter >::type&)>::type = void; typename detail::convert_bgl_params_to_boost_parameter >::type = parameter::aux::arg_list > > >, parameter::aux::arg_list >, parameter::aux::empty_arg_list, std::integral_constant >, std::integral_constant >]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/topological_sort.hpp:69:23: required from ‘void boost::topological_sort(VertexListGraph&, OutputIterator, const bgl_named_params&) [with VertexListGraph = adjacency_list; OutputIterator = std::back_insert_iterator >; P = typed_identity_property_map; T = vertex_index_t; R = no_property]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/transitive_closure.hpp:122:21: required from ‘void boost::transitive_closure(const Graph&, GraphTC&, G_to_TC_VertexMap, VertexIndexMap) [with Graph = R_adjacency_list; GraphTC = R_adjacency_list; G_to_TC_VertexMap = iterator_property_map, long unsigned int>, long unsigned int, long unsigned int&>; VertexIndexMap = vec_adj_list_vertex_id_map, long unsigned int>]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/transitive_closure.hpp:288:23: required from ‘void boost::transitive_closure(const Graph&, GraphTC&) [with Graph = R_adjacency_list; GraphTC = R_adjacency_list]’ transitive_closure.cpp:29:24: required from here /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:165:17: note: in a call to non-static member function ‘boost::CopyConstructibleConcept > > >::~CopyConstructibleConcept()’ 165 | BOOST_concept(CopyConstructible,(TT)) | ^~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/preprocessor/cat.hpp:29:34: note: in definition of macro ‘BOOST_PP_CAT_I’ 29 | # define BOOST_PP_CAT_I(a, b) a ## b | ^ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/concept_def.hpp:23:12: note: in expansion of macro ‘BOOST_PP_CAT’ 23 | struct BOOST_PP_CAT(name,Concept) \ | ^~~~~~~~~~~~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:165:3: note: in expansion of macro ‘BOOST_concept’ 165 | BOOST_concept(CopyConstructible,(TT)) | ^~~~~~~~~~~~~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements > >]’: /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/graph_concepts.hpp:66:5: required from ‘struct boost::concepts::Graph >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/graph_concepts.hpp:75:1: required from ‘struct boost::concepts::IncidenceGraph >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/graph_concepts.hpp:75:1: required from ‘struct boost::concepts::IncidenceGraphConcept >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::concepts::IncidenceGraphConcept >]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied > >::value’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:45:51: [ skipping 5 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/depth_first_search.hpp:406:5: required from ‘typename boost::result_of(Param0, const ArgPack&)>::type boost::graph::depth_first_search_with_named_params(const Param0&, const ArgPack&) [with Param0 = boost::adjacency_list; ArgPack = boost::parameter::aux::arg_list > > >, boost::parameter::aux::arg_list >, boost::parameter::aux::empty_arg_list, std::integral_constant >, std::integral_constant >; typename boost::result_of(Param0, const ArgPack&)>::type = void]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/depth_first_search.hpp:409:1: required from ‘typename boost::result_of(Param0, const typename boost::detail::convert_bgl_params_to_boost_parameter >::type&)>::type boost::depth_first_search(const Param0&, const bgl_named_params&) [with Param0 = adjacency_list; P = topo_sort_visitor > >; T = graph_visitor_t; R = bgl_named_params, vertex_index_t, no_property>; typename result_of(Param0, const typename detail::convert_bgl_params_to_boost_parameter >::type&)>::type = void; typename detail::convert_bgl_params_to_boost_parameter >::type = parameter::aux::arg_list > > >, parameter::aux::arg_list >, parameter::aux::empty_arg_list, std::integral_constant >, std::integral_constant >]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/topological_sort.hpp:69:23: required from ‘void boost::topological_sort(VertexListGraph&, OutputIterator, const bgl_named_params&) [with VertexListGraph = adjacency_list; OutputIterator = std::back_insert_iterator >; P = typed_identity_property_map; T = vertex_index_t; R = no_property]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/transitive_closure.hpp:122:21: required from ‘void boost::transitive_closure(const Graph&, GraphTC&, G_to_TC_VertexMap, VertexIndexMap) [with Graph = R_adjacency_list; GraphTC = R_adjacency_list; G_to_TC_VertexMap = iterator_property_map, long unsigned int>, long unsigned int, long unsigned int&>; VertexIndexMap = vec_adj_list_vertex_id_map, long unsigned int>]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/transitive_closure.hpp:288:23: required from ‘void boost::transitive_closure(const Graph&, GraphTC&) [with Graph = R_adjacency_list; GraphTC = R_adjacency_list]’ transitive_closure.cpp:29:24: required from here /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::concepts::Graph >]’ 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ^ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements > >]’: /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/graph_concepts.hpp:87:5: required from ‘struct boost::concepts::IncidenceGraph >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/graph_concepts.hpp:75:1: required from ‘struct boost::concepts::IncidenceGraphConcept >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::concepts::IncidenceGraphConcept >]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied > >::value’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied > >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:72:8: [ skipping 4 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/depth_first_search.hpp:406:5: required from ‘typename boost::result_of(Param0, const ArgPack&)>::type boost::graph::depth_first_search_with_named_params(const Param0&, const ArgPack&) [with Param0 = boost::adjacency_list; ArgPack = boost::parameter::aux::arg_list > > >, boost::parameter::aux::arg_list >, boost::parameter::aux::empty_arg_list, std::integral_constant >, std::integral_constant >; typename boost::result_of(Param0, const ArgPack&)>::type = void]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/depth_first_search.hpp:409:1: required from ‘typename boost::result_of(Param0, const typename boost::detail::convert_bgl_params_to_boost_parameter >::type&)>::type boost::depth_first_search(const Param0&, const bgl_named_params&) [with Param0 = adjacency_list; P = topo_sort_visitor > >; T = graph_visitor_t; R = bgl_named_params, vertex_index_t, no_property>; typename result_of(Param0, const typename detail::convert_bgl_params_to_boost_parameter >::type&)>::type = void; typename detail::convert_bgl_params_to_boost_parameter >::type = parameter::aux::arg_list > > >, parameter::aux::arg_list >, parameter::aux::empty_arg_list, std::integral_constant >, std::integral_constant >]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/topological_sort.hpp:69:23: required from ‘void boost::topological_sort(VertexListGraph&, OutputIterator, const bgl_named_params&) [with VertexListGraph = adjacency_list; OutputIterator = std::back_insert_iterator >; P = typed_identity_property_map; T = vertex_index_t; R = no_property]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/transitive_closure.hpp:122:21: required from ‘void boost::transitive_closure(const Graph&, GraphTC&, G_to_TC_VertexMap, VertexIndexMap) [with Graph = R_adjacency_list; GraphTC = R_adjacency_list; G_to_TC_VertexMap = iterator_property_map, long unsigned int>, long unsigned int, long unsigned int&>; VertexIndexMap = vec_adj_list_vertex_id_map, long unsigned int>]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/transitive_closure.hpp:288:23: required from ‘void boost::transitive_closure(const Graph&, GraphTC&) [with Graph = R_adjacency_list; GraphTC = R_adjacency_list]’ transitive_closure.cpp:29:24: required from here /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::concepts::IncidenceGraph >]’ 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ^ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::IncidenceGraphConcept >]’: /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/depth_first_search.hpp:129:9: required from ‘void boost::detail::depth_first_visit_impl(const IncidenceGraph&, typename boost::graph_traits::vertex_descriptor, DFSVisitor&, ColorMap, TerminatorFunc) [with IncidenceGraph = boost::adjacency_list; DFSVisitor = boost::topo_sort_visitor > >; ColorMap = boost::shared_array_property_map >; TerminatorFunc = nontruth2; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/depth_first_search.hpp:286:39: required from ‘void boost::depth_first_search(const VertexListGraph&, DFSVisitor, ColorMap, typename graph_traits::vertex_descriptor) [with VertexListGraph = adjacency_list; DFSVisitor = topo_sort_visitor > >; ColorMap = shared_array_property_map >; typename graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/depth_first_search.hpp:397:42: required from ‘void boost::graph::detail::depth_first_search_impl::operator()(const Graph&, const ArgPack&) const [with ArgPack = boost::parameter::aux::arg_list > > >, boost::parameter::aux::arg_list >, boost::parameter::aux::empty_arg_list, std::integral_constant >, std::integral_constant >; Graph = boost::adjacency_list]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/depth_first_search.hpp:406:5: required from ‘typename boost::result_of(Param0, const ArgPack&)>::type boost::graph::depth_first_search_with_named_params(const Param0&, const ArgPack&) [with Param0 = boost::adjacency_list; ArgPack = boost::parameter::aux::arg_list > > >, boost::parameter::aux::arg_list >, boost::parameter::aux::empty_arg_list, std::integral_constant >, std::integral_constant >; typename boost::result_of(Param0, const ArgPack&)>::type = void]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/depth_first_search.hpp:409:1: required from ‘typename boost::result_of(Param0, const typename boost::detail::convert_bgl_params_to_boost_parameter >::type&)>::type boost::depth_first_search(const Param0&, const bgl_named_params&) [with Param0 = adjacency_list; P = topo_sort_visitor > >; T = graph_visitor_t; R = bgl_named_params, vertex_index_t, no_property>; typename result_of(Param0, const typename detail::convert_bgl_params_to_boost_parameter >::type&)>::type = void; typename detail::convert_bgl_params_to_boost_parameter >::type = parameter::aux::arg_list > > >, parameter::aux::arg_list >, parameter::aux::empty_arg_list, std::integral_constant >, std::integral_constant >]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/topological_sort.hpp:69:23: required from ‘void boost::topological_sort(VertexListGraph&, OutputIterator, const bgl_named_params&) [with VertexListGraph = adjacency_list; OutputIterator = std::back_insert_iterator >; P = typed_identity_property_map; T = vertex_index_t; R = no_property]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/transitive_closure.hpp:122:21: required from ‘void boost::transitive_closure(const Graph&, GraphTC&, G_to_TC_VertexMap, VertexIndexMap) [with Graph = R_adjacency_list; GraphTC = R_adjacency_list; G_to_TC_VertexMap = iterator_property_map, long unsigned int>, long unsigned int, long unsigned int&>; VertexIndexMap = vec_adj_list_vertex_id_map, long unsigned int>]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/transitive_closure.hpp:288:23: required from ‘void boost::transitive_closure(const Graph&, GraphTC&) [with Graph = R_adjacency_list; GraphTC = R_adjacency_list]’ transitive_closure.cpp:29:24: required from here /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/graph_concepts.hpp:75:15: note: in a call to non-static member function ‘boost::concepts::IncidenceGraphConcept >::~IncidenceGraphConcept()’ 75 | BOOST_concept(IncidenceGraph, (G)) : Graph< G > | ^~~~~~~~~~~~~~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/preprocessor/cat.hpp:29:34: note: in definition of macro ‘BOOST_PP_CAT_I’ 29 | # define BOOST_PP_CAT_I(a, b) a ## b | ^ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/concept_def.hpp:23:12: note: in expansion of macro ‘BOOST_PP_CAT’ 23 | struct BOOST_PP_CAT(name,Concept) \ | ^~~~~~~~~~~~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/graph_concepts.hpp:75:1: note: in expansion of macro ‘BOOST_concept’ 75 | BOOST_concept(IncidenceGraph, (G)) : Graph< G > | ^~~~~~~~~~~~~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::constraint::failed() [with Model = boost::ReadWritePropertyMapConcept >, long unsigned int>]’: /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/depth_first_search.hpp:134:9: required from ‘void boost::detail::depth_first_visit_impl(const IncidenceGraph&, typename boost::graph_traits::vertex_descriptor, DFSVisitor&, ColorMap, TerminatorFunc) [with IncidenceGraph = boost::adjacency_list; DFSVisitor = boost::topo_sort_visitor > >; ColorMap = boost::shared_array_property_map >; TerminatorFunc = nontruth2; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/depth_first_search.hpp:286:39: required from ‘void boost::depth_first_search(const VertexListGraph&, DFSVisitor, ColorMap, typename graph_traits::vertex_descriptor) [with VertexListGraph = adjacency_list; DFSVisitor = topo_sort_visitor > >; ColorMap = shared_array_property_map >; typename graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/depth_first_search.hpp:397:42: required from ‘void boost::graph::detail::depth_first_search_impl::operator()(const Graph&, const ArgPack&) const [with ArgPack = boost::parameter::aux::arg_list > > >, boost::parameter::aux::arg_list >, boost::parameter::aux::empty_arg_list, std::integral_constant >, std::integral_constant >; Graph = boost::adjacency_list]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/depth_first_search.hpp:406:5: required from ‘typename boost::result_of(Param0, const ArgPack&)>::type boost::graph::depth_first_search_with_named_params(const Param0&, const ArgPack&) [with Param0 = boost::adjacency_list; ArgPack = boost::parameter::aux::arg_list > > >, boost::parameter::aux::arg_list >, boost::parameter::aux::empty_arg_list, std::integral_constant >, std::integral_constant >; typename boost::result_of(Param0, const ArgPack&)>::type = void]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/depth_first_search.hpp:409:1: required from ‘typename boost::result_of(Param0, const typename boost::detail::convert_bgl_params_to_boost_parameter >::type&)>::type boost::depth_first_search(const Param0&, const bgl_named_params&) [with Param0 = adjacency_list; P = topo_sort_visitor > >; T = graph_visitor_t; R = bgl_named_params, vertex_index_t, no_property>; typename result_of(Param0, const typename detail::convert_bgl_params_to_boost_parameter >::type&)>::type = void; typename detail::convert_bgl_params_to_boost_parameter >::type = parameter::aux::arg_list > > >, parameter::aux::arg_list >, parameter::aux::empty_arg_list, std::integral_constant >, std::integral_constant >]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/topological_sort.hpp:69:23: required from ‘void boost::topological_sort(VertexListGraph&, OutputIterator, const bgl_named_params&) [with VertexListGraph = adjacency_list; OutputIterator = std::back_insert_iterator >; P = typed_identity_property_map; T = vertex_index_t; R = no_property]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/transitive_closure.hpp:122:21: required from ‘void boost::transitive_closure(const Graph&, GraphTC&, G_to_TC_VertexMap, VertexIndexMap) [with Graph = R_adjacency_list; GraphTC = R_adjacency_list; G_to_TC_VertexMap = iterator_property_map, long unsigned int>, long unsigned int, long unsigned int&>; VertexIndexMap = vec_adj_list_vertex_id_map, long unsigned int>]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/transitive_closure.hpp:288:23: required from ‘void boost::transitive_closure(const Graph&, GraphTC&) [with Graph = R_adjacency_list; GraphTC = R_adjacency_list]’ transitive_closure.cpp:29:24: required from here /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:65:52: warning: ‘this’ pointer is null [-Wnonnull] 65 | static void failed() { ((Model*)0)->constraints(); } | ~~~~~~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/property_map/property_map.hpp:205:10: note: in a call to non-static member function ‘void boost::ReadWritePropertyMapConcept::constraints() [with PMap = boost::shared_array_property_map >; Key = long unsigned int]’ 205 | void constraints() { | ^~~~~~~~~~~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements >]’: /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:233:5: required from ‘struct boost::EqualityComparable’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/graph_concepts.hpp:502:1: required from ‘struct boost::concepts::ColorValue’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/graph_concepts.hpp:502:1: required from ‘struct boost::concepts::ColorValueConcept’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::concepts::ColorValueConcept]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied >::value’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:45:51: [ skipping 5 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/depth_first_search.hpp:406:5: required from ‘typename boost::result_of(Param0, const ArgPack&)>::type boost::graph::depth_first_search_with_named_params(const Param0&, const ArgPack&) [with Param0 = boost::adjacency_list; ArgPack = boost::parameter::aux::arg_list > > >, boost::parameter::aux::arg_list >, boost::parameter::aux::empty_arg_list, std::integral_constant >, std::integral_constant >; typename boost::result_of(Param0, const ArgPack&)>::type = void]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/depth_first_search.hpp:409:1: required from ‘typename boost::result_of(Param0, const typename boost::detail::convert_bgl_params_to_boost_parameter >::type&)>::type boost::depth_first_search(const Param0&, const bgl_named_params&) [with Param0 = adjacency_list; P = topo_sort_visitor > >; T = graph_visitor_t; R = bgl_named_params, vertex_index_t, no_property>; typename result_of(Param0, const typename detail::convert_bgl_params_to_boost_parameter >::type&)>::type = void; typename detail::convert_bgl_params_to_boost_parameter >::type = parameter::aux::arg_list > > >, parameter::aux::arg_list >, parameter::aux::empty_arg_list, std::integral_constant >, std::integral_constant >]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/topological_sort.hpp:69:23: required from ‘void boost::topological_sort(VertexListGraph&, OutputIterator, const bgl_named_params&) [with VertexListGraph = adjacency_list; OutputIterator = std::back_insert_iterator >; P = typed_identity_property_map; T = vertex_index_t; R = no_property]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/transitive_closure.hpp:122:21: required from ‘void boost::transitive_closure(const Graph&, GraphTC&, G_to_TC_VertexMap, VertexIndexMap) [with Graph = R_adjacency_list; GraphTC = R_adjacency_list; G_to_TC_VertexMap = iterator_property_map, long unsigned int>, long unsigned int, long unsigned int&>; VertexIndexMap = vec_adj_list_vertex_id_map, long unsigned int>]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/transitive_closure.hpp:288:23: required from ‘void boost::transitive_closure(const Graph&, GraphTC&) [with Graph = R_adjacency_list; GraphTC = R_adjacency_list]’ transitive_closure.cpp:29:24: required from here /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::EqualityComparable]’ 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ^ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements >]’: /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:137:5: required from ‘struct boost::DefaultConstructible’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/graph_concepts.hpp:502:1: required from ‘struct boost::concepts::ColorValue’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/graph_concepts.hpp:502:1: required from ‘struct boost::concepts::ColorValueConcept’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::concepts::ColorValueConcept]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied >::value’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:45:51: [ skipping 5 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/depth_first_search.hpp:406:5: required from ‘typename boost::result_of(Param0, const ArgPack&)>::type boost::graph::depth_first_search_with_named_params(const Param0&, const ArgPack&) [with Param0 = boost::adjacency_list; ArgPack = boost::parameter::aux::arg_list > > >, boost::parameter::aux::arg_list >, boost::parameter::aux::empty_arg_list, std::integral_constant >, std::integral_constant >; typename boost::result_of(Param0, const ArgPack&)>::type = void]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/depth_first_search.hpp:409:1: required from ‘typename boost::result_of(Param0, const typename boost::detail::convert_bgl_params_to_boost_parameter >::type&)>::type boost::depth_first_search(const Param0&, const bgl_named_params&) [with Param0 = adjacency_list; P = topo_sort_visitor > >; T = graph_visitor_t; R = bgl_named_params, vertex_index_t, no_property>; typename result_of(Param0, const typename detail::convert_bgl_params_to_boost_parameter >::type&)>::type = void; typename detail::convert_bgl_params_to_boost_parameter >::type = parameter::aux::arg_list > > >, parameter::aux::arg_list >, parameter::aux::empty_arg_list, std::integral_constant >, std::integral_constant >]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/topological_sort.hpp:69:23: required from ‘void boost::topological_sort(VertexListGraph&, OutputIterator, const bgl_named_params&) [with VertexListGraph = adjacency_list; OutputIterator = std::back_insert_iterator >; P = typed_identity_property_map; T = vertex_index_t; R = no_property]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/transitive_closure.hpp:122:21: required from ‘void boost::transitive_closure(const Graph&, GraphTC&, G_to_TC_VertexMap, VertexIndexMap) [with Graph = R_adjacency_list; GraphTC = R_adjacency_list; G_to_TC_VertexMap = iterator_property_map, long unsigned int>, long unsigned int, long unsigned int&>; VertexIndexMap = vec_adj_list_vertex_id_map, long unsigned int>]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/transitive_closure.hpp:288:23: required from ‘void boost::transitive_closure(const Graph&, GraphTC&) [with Graph = R_adjacency_list; GraphTC = R_adjacency_list]’ transitive_closure.cpp:29:24: required from here /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::DefaultConstructible]’ 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ^ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements >]’: /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/graph_concepts.hpp:505:5: required from ‘struct boost::concepts::ColorValue’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/graph_concepts.hpp:502:1: required from ‘struct boost::concepts::ColorValueConcept’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::concepts::ColorValueConcept]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied >::value’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:72:8: [ skipping 4 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/depth_first_search.hpp:406:5: required from ‘typename boost::result_of(Param0, const ArgPack&)>::type boost::graph::depth_first_search_with_named_params(const Param0&, const ArgPack&) [with Param0 = boost::adjacency_list; ArgPack = boost::parameter::aux::arg_list > > >, boost::parameter::aux::arg_list >, boost::parameter::aux::empty_arg_list, std::integral_constant >, std::integral_constant >; typename boost::result_of(Param0, const ArgPack&)>::type = void]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/depth_first_search.hpp:409:1: required from ‘typename boost::result_of(Param0, const typename boost::detail::convert_bgl_params_to_boost_parameter >::type&)>::type boost::depth_first_search(const Param0&, const bgl_named_params&) [with Param0 = adjacency_list; P = topo_sort_visitor > >; T = graph_visitor_t; R = bgl_named_params, vertex_index_t, no_property>; typename result_of(Param0, const typename detail::convert_bgl_params_to_boost_parameter >::type&)>::type = void; typename detail::convert_bgl_params_to_boost_parameter >::type = parameter::aux::arg_list > > >, parameter::aux::arg_list >, parameter::aux::empty_arg_list, std::integral_constant >, std::integral_constant >]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/topological_sort.hpp:69:23: required from ‘void boost::topological_sort(VertexListGraph&, OutputIterator, const bgl_named_params&) [with VertexListGraph = adjacency_list; OutputIterator = std::back_insert_iterator >; P = typed_identity_property_map; T = vertex_index_t; R = no_property]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/transitive_closure.hpp:122:21: required from ‘void boost::transitive_closure(const Graph&, GraphTC&, G_to_TC_VertexMap, VertexIndexMap) [with Graph = R_adjacency_list; GraphTC = R_adjacency_list; G_to_TC_VertexMap = iterator_property_map, long unsigned int>, long unsigned int, long unsigned int&>; VertexIndexMap = vec_adj_list_vertex_id_map, long unsigned int>]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/transitive_closure.hpp:288:23: required from ‘void boost::transitive_closure(const Graph&, GraphTC&) [with Graph = R_adjacency_list; GraphTC = R_adjacency_list]’ transitive_closure.cpp:29:24: required from here /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::concepts::ColorValue]’ 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ^ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::ColorValueConcept]’: /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/depth_first_search.hpp:136:9: required from ‘void boost::detail::depth_first_visit_impl(const IncidenceGraph&, typename boost::graph_traits::vertex_descriptor, DFSVisitor&, ColorMap, TerminatorFunc) [with IncidenceGraph = boost::adjacency_list; DFSVisitor = boost::topo_sort_visitor > >; ColorMap = boost::shared_array_property_map >; TerminatorFunc = nontruth2; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/depth_first_search.hpp:286:39: required from ‘void boost::depth_first_search(const VertexListGraph&, DFSVisitor, ColorMap, typename graph_traits::vertex_descriptor) [with VertexListGraph = adjacency_list; DFSVisitor = topo_sort_visitor > >; ColorMap = shared_array_property_map >; typename graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/depth_first_search.hpp:397:42: required from ‘void boost::graph::detail::depth_first_search_impl::operator()(const Graph&, const ArgPack&) const [with ArgPack = boost::parameter::aux::arg_list > > >, boost::parameter::aux::arg_list >, boost::parameter::aux::empty_arg_list, std::integral_constant >, std::integral_constant >; Graph = boost::adjacency_list]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/depth_first_search.hpp:406:5: required from ‘typename boost::result_of(Param0, const ArgPack&)>::type boost::graph::depth_first_search_with_named_params(const Param0&, const ArgPack&) [with Param0 = boost::adjacency_list; ArgPack = boost::parameter::aux::arg_list > > >, boost::parameter::aux::arg_list >, boost::parameter::aux::empty_arg_list, std::integral_constant >, std::integral_constant >; typename boost::result_of(Param0, const ArgPack&)>::type = void]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/depth_first_search.hpp:409:1: required from ‘typename boost::result_of(Param0, const typename boost::detail::convert_bgl_params_to_boost_parameter >::type&)>::type boost::depth_first_search(const Param0&, const bgl_named_params&) [with Param0 = adjacency_list; P = topo_sort_visitor > >; T = graph_visitor_t; R = bgl_named_params, vertex_index_t, no_property>; typename result_of(Param0, const typename detail::convert_bgl_params_to_boost_parameter >::type&)>::type = void; typename detail::convert_bgl_params_to_boost_parameter >::type = parameter::aux::arg_list > > >, parameter::aux::arg_list >, parameter::aux::empty_arg_list, std::integral_constant >, std::integral_constant >]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/topological_sort.hpp:69:23: required from ‘void boost::topological_sort(VertexListGraph&, OutputIterator, const bgl_named_params&) [with VertexListGraph = adjacency_list; OutputIterator = std::back_insert_iterator >; P = typed_identity_property_map; T = vertex_index_t; R = no_property]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/transitive_closure.hpp:122:21: required from ‘void boost::transitive_closure(const Graph&, GraphTC&, G_to_TC_VertexMap, VertexIndexMap) [with Graph = R_adjacency_list; GraphTC = R_adjacency_list; G_to_TC_VertexMap = iterator_property_map, long unsigned int>, long unsigned int, long unsigned int&>; VertexIndexMap = vec_adj_list_vertex_id_map, long unsigned int>]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/transitive_closure.hpp:288:23: required from ‘void boost::transitive_closure(const Graph&, GraphTC&) [with Graph = R_adjacency_list; GraphTC = R_adjacency_list]’ transitive_closure.cpp:29:24: required from here /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/graph_concepts.hpp:502:15: note: in a call to non-static member function ‘boost::concepts::ColorValueConcept::~ColorValueConcept()’ 502 | BOOST_concept(ColorValue, (C)) | ^~~~~~~~~~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/preprocessor/cat.hpp:29:34: note: in definition of macro ‘BOOST_PP_CAT_I’ 29 | # define BOOST_PP_CAT_I(a, b) a ## b | ^ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/concept_def.hpp:23:12: note: in expansion of macro ‘BOOST_PP_CAT’ 23 | struct BOOST_PP_CAT(name,Concept) \ | ^~~~~~~~~~~~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/graph_concepts.hpp:502:1: note: in expansion of macro ‘BOOST_concept’ 502 | BOOST_concept(ColorValue, (C)) | ^~~~~~~~~~~~~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::Convertible]’: /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements >]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:208:5: required from ‘struct boost::Convertible’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::Convertible]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied >::value’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:72:8: [ skipping 4 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::MultiPassInputIterator >]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/graph_concepts.hpp:184:9: required from ‘boost::concepts::VertexListGraph::~VertexListGraph() [with G = R_adjacency_list]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/graph_concepts.hpp:176:1: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::VertexListGraphConcept >]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/transitive_closure.hpp:73:5: required from ‘void boost::transitive_closure(const Graph&, GraphTC&, G_to_TC_VertexMap, VertexIndexMap) [with Graph = R_adjacency_list; GraphTC = R_adjacency_list; G_to_TC_VertexMap = iterator_property_map, long unsigned int>, long unsigned int, long unsigned int&>; VertexIndexMap = vec_adj_list_vertex_id_map, long unsigned int>]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/transitive_closure.hpp:288:23: required from ‘void boost::transitive_closure(const Graph&, GraphTC&) [with Graph = R_adjacency_list; GraphTC = R_adjacency_list]’ transitive_closure.cpp:29:24: required from here /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::Convertible::~Convertible() [with X = std::random_access_iterator_tag; Y = std::input_iterator_tag]’ 37 | ~model() | ^ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:208:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 208 | BOOST_CONCEPT_USAGE(Convertible) { | ^~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::Convertible, std::input_iterator_tag>]’: /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements, std::input_iterator_tag> >]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:208:5: required from ‘struct boost::Convertible, std::input_iterator_tag>’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::Convertible, std::input_iterator_tag>]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied, std::input_iterator_tag> >::value’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied, std::input_iterator_tag> >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:72:8: [ skipping 4 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::MultiPassInputIterator, boost::property, boost::no_property, boost::listS>, long unsigned int, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator >*, std::vector >, std::allocator > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, long int> >]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/graph_concepts.hpp:159:9: required from ‘boost::concepts::AdjacencyGraph::~AdjacencyGraph() [with G = R_adjacency_list]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/graph_concepts.hpp:152:1: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::AdjacencyGraphConcept >]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/transitive_closure.hpp:74:5: required from ‘void boost::transitive_closure(const Graph&, GraphTC&, G_to_TC_VertexMap, VertexIndexMap) [with Graph = R_adjacency_list; GraphTC = R_adjacency_list; G_to_TC_VertexMap = iterator_property_map, long unsigned int>, long unsigned int, long unsigned int&>; VertexIndexMap = vec_adj_list_vertex_id_map, long unsigned int>]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/transitive_closure.hpp:288:23: required from ‘void boost::transitive_closure(const Graph&, GraphTC&) [with Graph = R_adjacency_list; GraphTC = R_adjacency_list]’ transitive_closure.cpp:29:24: required from here /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::Convertible::~Convertible() [with X = boost::iterators::detail::iterator_category_with_traversal; Y = std::input_iterator_tag]’ 37 | ~model() | ^ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:208:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 208 | BOOST_CONCEPT_USAGE(Convertible) { | ^~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements >]’: /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:208:5: required from ‘struct boost::Convertible’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::Convertible]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied >::value’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_)>’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:545:11: [ skipping 12 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/strong_components.hpp:206:43: required from ‘static typename boost::property_traits::value_type boost::detail::strong_comp_dispatch1::apply(const Graph&, ComponentMap, const boost::bgl_named_params&, boost::param_not_found) [with Graph = R_adjacency_list; ComponentMap = boost::iterator_property_map, long unsigned int>, long unsigned int, long unsigned int&>; P = boost::vec_adj_list_vertex_id_map, long unsigned int>; T = boost::vertex_index_t; R = boost::no_property; typename boost::property_traits::value_type = long unsigned int]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/strong_components.hpp:220:63: required from ‘typename boost::property_traits::value_type boost::detail::scc_helper1(const Graph&, ComponentMap, const boost::bgl_named_params&, RootMap) [with Graph = R_adjacency_list; ComponentMap = boost::iterator_property_map, long unsigned int>, long unsigned int, long unsigned int&>; RootMap = boost::param_not_found; P = boost::vec_adj_list_vertex_id_map, long unsigned int>; T = boost::vertex_index_t; R = boost::no_property; typename boost::property_traits::value_type = long unsigned int]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/strong_components.hpp:235:31: required from ‘typename boost::property_traits::value_type boost::strong_components(const Graph&, ComponentMap, const bgl_named_params&, typename enable_if_c::traversal_category>::value, graph::detail::no_parameter>::type) [with Graph = R_adjacency_list; ComponentMap = iterator_property_map, long unsigned int>, long unsigned int, long unsigned int&>; P = vec_adj_list_vertex_id_map, long unsigned int>; T = vertex_index_t; R = no_property; typename property_traits::value_type = long unsigned int; typename enable_if_c::traversal_category>::value, graph::detail::no_parameter>::type = graph::detail::no_parameter; typename graph_traits::traversal_category = adj_list_dir_traversal_tag]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/transitive_closure.hpp:86:28: required from ‘void boost::transitive_closure(const Graph&, GraphTC&, G_to_TC_VertexMap, VertexIndexMap) [with Graph = R_adjacency_list; GraphTC = R_adjacency_list; G_to_TC_VertexMap = iterator_property_map, long unsigned int>, long unsigned int, long unsigned int&>; VertexIndexMap = vec_adj_list_vertex_id_map, long unsigned int>]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/transitive_closure.hpp:288:23: required from ‘void boost::transitive_closure(const Graph&, GraphTC&) [with Graph = R_adjacency_list; GraphTC = R_adjacency_list]’ transitive_closure.cpp:29:24: required from here /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::Convertible]’ 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ^ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::Convertible]’: /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:545:11: required from ‘boost::ForwardIterator::~ForwardIterator() [with TT = __gnu_cxx::__normal_iterator >]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/usage.hpp:20:48: required from ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::ForwardIterator<__gnu_cxx::__normal_iterator > >]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements > > >]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:543:7: required from ‘struct boost::ForwardIterator<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:568:3: required from ‘struct boost::BidirectionalIterator<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:597:3: [ skipping 7 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/strong_components.hpp:206:43: required from ‘static typename boost::property_traits::value_type boost::detail::strong_comp_dispatch1::apply(const Graph&, ComponentMap, const boost::bgl_named_params&, boost::param_not_found) [with Graph = R_adjacency_list; ComponentMap = boost::iterator_property_map, long unsigned int>, long unsigned int, long unsigned int&>; P = boost::vec_adj_list_vertex_id_map, long unsigned int>; T = boost::vertex_index_t; R = boost::no_property; typename boost::property_traits::value_type = long unsigned int]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/strong_components.hpp:220:63: required from ‘typename boost::property_traits::value_type boost::detail::scc_helper1(const Graph&, ComponentMap, const boost::bgl_named_params&, RootMap) [with Graph = R_adjacency_list; ComponentMap = boost::iterator_property_map, long unsigned int>, long unsigned int, long unsigned int&>; RootMap = boost::param_not_found; P = boost::vec_adj_list_vertex_id_map, long unsigned int>; T = boost::vertex_index_t; R = boost::no_property; typename boost::property_traits::value_type = long unsigned int]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/strong_components.hpp:235:31: required from ‘typename boost::property_traits::value_type boost::strong_components(const Graph&, ComponentMap, const bgl_named_params&, typename enable_if_c::traversal_category>::value, graph::detail::no_parameter>::type) [with Graph = R_adjacency_list; ComponentMap = iterator_property_map, long unsigned int>, long unsigned int, long unsigned int&>; P = vec_adj_list_vertex_id_map, long unsigned int>; T = vertex_index_t; R = no_property; typename property_traits::value_type = long unsigned int; typename enable_if_c::traversal_category>::value, graph::detail::no_parameter>::type = graph::detail::no_parameter; typename graph_traits::traversal_category = adj_list_dir_traversal_tag]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/transitive_closure.hpp:86:28: required from ‘void boost::transitive_closure(const Graph&, GraphTC&, G_to_TC_VertexMap, VertexIndexMap) [with Graph = R_adjacency_list; GraphTC = R_adjacency_list; G_to_TC_VertexMap = iterator_property_map, long unsigned int>, long unsigned int, long unsigned int&>; VertexIndexMap = vec_adj_list_vertex_id_map, long unsigned int>]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/transitive_closure.hpp:288:23: required from ‘void boost::transitive_closure(const Graph&, GraphTC&) [with Graph = R_adjacency_list; GraphTC = R_adjacency_list]’ transitive_closure.cpp:29:24: required from here /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::Convertible::~Convertible() [with X = std::random_access_iterator_tag; Y = std::forward_iterator_tag]’ 37 | ~model() | ^ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:208:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 208 | BOOST_CONCEPT_USAGE(Convertible) { | ^~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements >]’: /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:208:5: required from ‘struct boost::Convertible’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::Convertible]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied >::value’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_)>’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:573:11: [ skipping 11 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/strong_components.hpp:206:43: required from ‘static typename boost::property_traits::value_type boost::detail::strong_comp_dispatch1::apply(const Graph&, ComponentMap, const boost::bgl_named_params&, boost::param_not_found) [with Graph = R_adjacency_list; ComponentMap = boost::iterator_property_map, long unsigned int>, long unsigned int, long unsigned int&>; P = boost::vec_adj_list_vertex_id_map, long unsigned int>; T = boost::vertex_index_t; R = boost::no_property; typename boost::property_traits::value_type = long unsigned int]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/strong_components.hpp:220:63: required from ‘typename boost::property_traits::value_type boost::detail::scc_helper1(const Graph&, ComponentMap, const boost::bgl_named_params&, RootMap) [with Graph = R_adjacency_list; ComponentMap = boost::iterator_property_map, long unsigned int>, long unsigned int, long unsigned int&>; RootMap = boost::param_not_found; P = boost::vec_adj_list_vertex_id_map, long unsigned int>; T = boost::vertex_index_t; R = boost::no_property; typename boost::property_traits::value_type = long unsigned int]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/strong_components.hpp:235:31: required from ‘typename boost::property_traits::value_type boost::strong_components(const Graph&, ComponentMap, const bgl_named_params&, typename enable_if_c::traversal_category>::value, graph::detail::no_parameter>::type) [with Graph = R_adjacency_list; ComponentMap = iterator_property_map, long unsigned int>, long unsigned int, long unsigned int&>; P = vec_adj_list_vertex_id_map, long unsigned int>; T = vertex_index_t; R = no_property; typename property_traits::value_type = long unsigned int; typename enable_if_c::traversal_category>::value, graph::detail::no_parameter>::type = graph::detail::no_parameter; typename graph_traits::traversal_category = adj_list_dir_traversal_tag]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/transitive_closure.hpp:86:28: required from ‘void boost::transitive_closure(const Graph&, GraphTC&, G_to_TC_VertexMap, VertexIndexMap) [with Graph = R_adjacency_list; GraphTC = R_adjacency_list; G_to_TC_VertexMap = iterator_property_map, long unsigned int>, long unsigned int, long unsigned int&>; VertexIndexMap = vec_adj_list_vertex_id_map, long unsigned int>]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/transitive_closure.hpp:288:23: required from ‘void boost::transitive_closure(const Graph&, GraphTC&) [with Graph = R_adjacency_list; GraphTC = R_adjacency_list]’ transitive_closure.cpp:29:24: required from here /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::Convertible]’ 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ^ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::Convertible]’: /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:573:11: required from ‘boost::BidirectionalIterator::~BidirectionalIterator() [with TT = __gnu_cxx::__normal_iterator >]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/usage.hpp:20:48: required from ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::BidirectionalIterator<__gnu_cxx::__normal_iterator > >]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements > > >]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:571:7: required from ‘struct boost::BidirectionalIterator<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:597:3: required from ‘struct boost::RandomAccessIterator<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:597:3: [ skipping 6 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/strong_components.hpp:206:43: required from ‘static typename boost::property_traits::value_type boost::detail::strong_comp_dispatch1::apply(const Graph&, ComponentMap, const boost::bgl_named_params&, boost::param_not_found) [with Graph = R_adjacency_list; ComponentMap = boost::iterator_property_map, long unsigned int>, long unsigned int, long unsigned int&>; P = boost::vec_adj_list_vertex_id_map, long unsigned int>; T = boost::vertex_index_t; R = boost::no_property; typename boost::property_traits::value_type = long unsigned int]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/strong_components.hpp:220:63: required from ‘typename boost::property_traits::value_type boost::detail::scc_helper1(const Graph&, ComponentMap, const boost::bgl_named_params&, RootMap) [with Graph = R_adjacency_list; ComponentMap = boost::iterator_property_map, long unsigned int>, long unsigned int, long unsigned int&>; RootMap = boost::param_not_found; P = boost::vec_adj_list_vertex_id_map, long unsigned int>; T = boost::vertex_index_t; R = boost::no_property; typename boost::property_traits::value_type = long unsigned int]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/strong_components.hpp:235:31: required from ‘typename boost::property_traits::value_type boost::strong_components(const Graph&, ComponentMap, const bgl_named_params&, typename enable_if_c::traversal_category>::value, graph::detail::no_parameter>::type) [with Graph = R_adjacency_list; ComponentMap = iterator_property_map, long unsigned int>, long unsigned int, long unsigned int&>; P = vec_adj_list_vertex_id_map, long unsigned int>; T = vertex_index_t; R = no_property; typename property_traits::value_type = long unsigned int; typename enable_if_c::traversal_category>::value, graph::detail::no_parameter>::type = graph::detail::no_parameter; typename graph_traits::traversal_category = adj_list_dir_traversal_tag]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/transitive_closure.hpp:86:28: required from ‘void boost::transitive_closure(const Graph&, GraphTC&, G_to_TC_VertexMap, VertexIndexMap) [with Graph = R_adjacency_list; GraphTC = R_adjacency_list; G_to_TC_VertexMap = iterator_property_map, long unsigned int>, long unsigned int, long unsigned int&>; VertexIndexMap = vec_adj_list_vertex_id_map, long unsigned int>]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/transitive_closure.hpp:288:23: required from ‘void boost::transitive_closure(const Graph&, GraphTC&) [with Graph = R_adjacency_list; GraphTC = R_adjacency_list]’ transitive_closure.cpp:29:24: required from here /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::Convertible::~Convertible() [with X = std::random_access_iterator_tag; Y = std::bidirectional_iterator_tag]’ 37 | ~model() | ^ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:208:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 208 | BOOST_CONCEPT_USAGE(Convertible) { | ^~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::Convertible]’: /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements >]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:208:5: required from ‘struct boost::Convertible’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::Convertible]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied >::value’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:72:8: [ skipping 4 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/strong_components.hpp:206:43: required from ‘static typename boost::property_traits::value_type boost::detail::strong_comp_dispatch1::apply(const Graph&, ComponentMap, const boost::bgl_named_params&, boost::param_not_found) [with Graph = R_adjacency_list; ComponentMap = boost::iterator_property_map, long unsigned int>, long unsigned int, long unsigned int&>; P = boost::vec_adj_list_vertex_id_map, long unsigned int>; T = boost::vertex_index_t; R = boost::no_property; typename boost::property_traits::value_type = long unsigned int]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/strong_components.hpp:220:63: required from ‘typename boost::property_traits::value_type boost::detail::scc_helper1(const Graph&, ComponentMap, const boost::bgl_named_params&, RootMap) [with Graph = R_adjacency_list; ComponentMap = boost::iterator_property_map, long unsigned int>, long unsigned int, long unsigned int&>; RootMap = boost::param_not_found; P = boost::vec_adj_list_vertex_id_map, long unsigned int>; T = boost::vertex_index_t; R = boost::no_property; typename boost::property_traits::value_type = long unsigned int]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/strong_components.hpp:235:31: required from ‘typename boost::property_traits::value_type boost::strong_components(const Graph&, ComponentMap, const bgl_named_params&, typename enable_if_c::traversal_category>::value, graph::detail::no_parameter>::type) [with Graph = R_adjacency_list; ComponentMap = iterator_property_map, long unsigned int>, long unsigned int, long unsigned int&>; P = vec_adj_list_vertex_id_map, long unsigned int>; T = vertex_index_t; R = no_property; typename property_traits::value_type = long unsigned int; typename enable_if_c::traversal_category>::value, graph::detail::no_parameter>::type = graph::detail::no_parameter; typename graph_traits::traversal_category = adj_list_dir_traversal_tag]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/transitive_closure.hpp:86:28: required from ‘void boost::transitive_closure(const Graph&, GraphTC&, G_to_TC_VertexMap, VertexIndexMap) [with Graph = R_adjacency_list; GraphTC = R_adjacency_list; G_to_TC_VertexMap = iterator_property_map, long unsigned int>, long unsigned int, long unsigned int&>; VertexIndexMap = vec_adj_list_vertex_id_map, long unsigned int>]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/transitive_closure.hpp:288:23: required from ‘void boost::transitive_closure(const Graph&, GraphTC&) [with Graph = R_adjacency_list; GraphTC = R_adjacency_list]’ transitive_closure.cpp:29:24: required from here /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::Convertible::~Convertible() [with X = std::random_access_iterator_tag; Y = std::random_access_iterator_tag]’ 37 | ~model() | ^ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:208:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 208 | BOOST_CONCEPT_USAGE(Convertible) { | ^~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::constraint::failed() [with Model = boost::ReadablePropertyMapConcept, long unsigned int>, long unsigned int, long unsigned int&>, long unsigned int>]’: /home/omnipath/local/R/4.4-3.20/BH/include/boost/property_map/property_map.hpp:206:7: required from ‘void boost::ReadWritePropertyMapConcept::constraints() [with PMap = boost::iterator_property_map, long unsigned int>, long unsigned int, long unsigned int&>; Key = long unsigned int]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::ReadWritePropertyMapConcept, long unsigned int>, long unsigned int, long unsigned int&>, long unsigned int>]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied, long unsigned int>, long unsigned int, long unsigned int&>, long unsigned int> >::value’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied, long unsigned int>, long unsigned int, long unsigned int&>, long unsigned int> >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_, long unsigned int>, long unsigned int, long unsigned int&>, long unsigned int>)>’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/strong_components.hpp:115:9: [ skipping 3 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/strong_components.hpp:205:31: required from ‘static typename boost::property_traits::value_type boost::detail::strong_comp_dispatch1::apply(const Graph&, ComponentMap, const boost::bgl_named_params&, boost::param_not_found) [with Graph = R_adjacency_list; ComponentMap = boost::iterator_property_map, long unsigned int>, long unsigned int, long unsigned int&>; P = boost::vec_adj_list_vertex_id_map, long unsigned int>; T = boost::vertex_index_t; R = boost::no_property; typename boost::property_traits::value_type = long unsigned int]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/strong_components.hpp:220:63: required from ‘typename boost::property_traits::value_type boost::detail::scc_helper1(const Graph&, ComponentMap, const boost::bgl_named_params&, RootMap) [with Graph = R_adjacency_list; ComponentMap = boost::iterator_property_map, long unsigned int>, long unsigned int, long unsigned int&>; RootMap = boost::param_not_found; P = boost::vec_adj_list_vertex_id_map, long unsigned int>; T = boost::vertex_index_t; R = boost::no_property; typename boost::property_traits::value_type = long unsigned int]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/strong_components.hpp:235:31: required from ‘typename boost::property_traits::value_type boost::strong_components(const Graph&, ComponentMap, const bgl_named_params&, typename enable_if_c::traversal_category>::value, graph::detail::no_parameter>::type) [with Graph = R_adjacency_list; ComponentMap = iterator_property_map, long unsigned int>, long unsigned int, long unsigned int&>; P = vec_adj_list_vertex_id_map, long unsigned int>; T = vertex_index_t; R = no_property; typename property_traits::value_type = long unsigned int; typename enable_if_c::traversal_category>::value, graph::detail::no_parameter>::type = graph::detail::no_parameter; typename graph_traits::traversal_category = adj_list_dir_traversal_tag]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/transitive_closure.hpp:86:28: required from ‘void boost::transitive_closure(const Graph&, GraphTC&, G_to_TC_VertexMap, VertexIndexMap) [with Graph = R_adjacency_list; GraphTC = R_adjacency_list; G_to_TC_VertexMap = iterator_property_map, long unsigned int>, long unsigned int, long unsigned int&>; VertexIndexMap = vec_adj_list_vertex_id_map, long unsigned int>]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/transitive_closure.hpp:288:23: required from ‘void boost::transitive_closure(const Graph&, GraphTC&) [with Graph = R_adjacency_list; GraphTC = R_adjacency_list]’ transitive_closure.cpp:29:24: required from here /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:65:52: warning: ‘this’ pointer is null [-Wnonnull] 65 | static void failed() { ((Model*)0)->constraints(); } | ~~~~~~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/property_map/property_map.hpp:147:10: note: in a call to non-static member function ‘void boost::ReadablePropertyMapConcept::constraints() [with PMap = boost::iterator_property_map, long unsigned int>, long unsigned int, long unsigned int&>; Key = long unsigned int]’ 147 | void constraints() { | ^~~~~~~~~~~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::constraint::failed() [with Model = boost::WritablePropertyMapConcept, long unsigned int>, long unsigned int, long unsigned int&>, long unsigned int>]’: /home/omnipath/local/R/4.4-3.20/BH/include/boost/property_map/property_map.hpp:207:7: required from ‘void boost::ReadWritePropertyMapConcept::constraints() [with PMap = boost::iterator_property_map, long unsigned int>, long unsigned int, long unsigned int&>; Key = long unsigned int]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::ReadWritePropertyMapConcept, long unsigned int>, long unsigned int, long unsigned int&>, long unsigned int>]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied, long unsigned int>, long unsigned int, long unsigned int&>, long unsigned int> >::value’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied, long unsigned int>, long unsigned int, long unsigned int&>, long unsigned int> >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_, long unsigned int>, long unsigned int, long unsigned int&>, long unsigned int>)>’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/strong_components.hpp:115:9: [ skipping 3 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/strong_components.hpp:205:31: required from ‘static typename boost::property_traits::value_type boost::detail::strong_comp_dispatch1::apply(const Graph&, ComponentMap, const boost::bgl_named_params&, boost::param_not_found) [with Graph = R_adjacency_list; ComponentMap = boost::iterator_property_map, long unsigned int>, long unsigned int, long unsigned int&>; P = boost::vec_adj_list_vertex_id_map, long unsigned int>; T = boost::vertex_index_t; R = boost::no_property; typename boost::property_traits::value_type = long unsigned int]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/strong_components.hpp:220:63: required from ‘typename boost::property_traits::value_type boost::detail::scc_helper1(const Graph&, ComponentMap, const boost::bgl_named_params&, RootMap) [with Graph = R_adjacency_list; ComponentMap = boost::iterator_property_map, long unsigned int>, long unsigned int, long unsigned int&>; RootMap = boost::param_not_found; P = boost::vec_adj_list_vertex_id_map, long unsigned int>; T = boost::vertex_index_t; R = boost::no_property; typename boost::property_traits::value_type = long unsigned int]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/strong_components.hpp:235:31: required from ‘typename boost::property_traits::value_type boost::strong_components(const Graph&, ComponentMap, const bgl_named_params&, typename enable_if_c::traversal_category>::value, graph::detail::no_parameter>::type) [with Graph = R_adjacency_list; ComponentMap = iterator_property_map, long unsigned int>, long unsigned int, long unsigned int&>; P = vec_adj_list_vertex_id_map, long unsigned int>; T = vertex_index_t; R = no_property; typename property_traits::value_type = long unsigned int; typename enable_if_c::traversal_category>::value, graph::detail::no_parameter>::type = graph::detail::no_parameter; typename graph_traits::traversal_category = adj_list_dir_traversal_tag]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/transitive_closure.hpp:86:28: required from ‘void boost::transitive_closure(const Graph&, GraphTC&, G_to_TC_VertexMap, VertexIndexMap) [with Graph = R_adjacency_list; GraphTC = R_adjacency_list; G_to_TC_VertexMap = iterator_property_map, long unsigned int>, long unsigned int, long unsigned int&>; VertexIndexMap = vec_adj_list_vertex_id_map, long unsigned int>]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/transitive_closure.hpp:288:23: required from ‘void boost::transitive_closure(const Graph&, GraphTC&) [with Graph = R_adjacency_list; GraphTC = R_adjacency_list]’ transitive_closure.cpp:29:24: required from here /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:65:52: warning: ‘this’ pointer is null [-Wnonnull] 65 | static void failed() { ((Model*)0)->constraints(); } | ~~~~~~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/property_map/property_map.hpp:179:10: note: in a call to non-static member function ‘void boost::WritablePropertyMapConcept::constraints() [with PMap = boost::iterator_property_map, long unsigned int>, long unsigned int, long unsigned int&>; Key = long unsigned int]’ 179 | void constraints() { | ^~~~~~~~~~~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements >]’: /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:208:5: required from ‘struct boost::Convertible’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:206:3: required from ‘struct boost::ConvertibleConcept’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::ConvertibleConcept]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied >::value’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:72:8: [ skipping 9 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/strong_components.hpp:205:31: required from ‘static typename boost::property_traits::value_type boost::detail::strong_comp_dispatch1::apply(const Graph&, ComponentMap, const boost::bgl_named_params&, boost::param_not_found) [with Graph = R_adjacency_list; ComponentMap = boost::iterator_property_map, long unsigned int>, long unsigned int, long unsigned int&>; P = boost::vec_adj_list_vertex_id_map, long unsigned int>; T = boost::vertex_index_t; R = boost::no_property; typename boost::property_traits::value_type = long unsigned int]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/strong_components.hpp:220:63: required from ‘typename boost::property_traits::value_type boost::detail::scc_helper1(const Graph&, ComponentMap, const boost::bgl_named_params&, RootMap) [with Graph = R_adjacency_list; ComponentMap = boost::iterator_property_map, long unsigned int>, long unsigned int, long unsigned int&>; RootMap = boost::param_not_found; P = boost::vec_adj_list_vertex_id_map, long unsigned int>; T = boost::vertex_index_t; R = boost::no_property; typename boost::property_traits::value_type = long unsigned int]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/strong_components.hpp:235:31: required from ‘typename boost::property_traits::value_type boost::strong_components(const Graph&, ComponentMap, const bgl_named_params&, typename enable_if_c::traversal_category>::value, graph::detail::no_parameter>::type) [with Graph = R_adjacency_list; ComponentMap = iterator_property_map, long unsigned int>, long unsigned int, long unsigned int&>; P = vec_adj_list_vertex_id_map, long unsigned int>; T = vertex_index_t; R = no_property; typename property_traits::value_type = long unsigned int; typename enable_if_c::traversal_category>::value, graph::detail::no_parameter>::type = graph::detail::no_parameter; typename graph_traits::traversal_category = adj_list_dir_traversal_tag]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/transitive_closure.hpp:86:28: required from ‘void boost::transitive_closure(const Graph&, GraphTC&, G_to_TC_VertexMap, VertexIndexMap) [with Graph = R_adjacency_list; GraphTC = R_adjacency_list; G_to_TC_VertexMap = iterator_property_map, long unsigned int>, long unsigned int, long unsigned int&>; VertexIndexMap = vec_adj_list_vertex_id_map, long unsigned int>]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/transitive_closure.hpp:288:23: required from ‘void boost::transitive_closure(const Graph&, GraphTC&) [with Graph = R_adjacency_list; GraphTC = R_adjacency_list]’ transitive_closure.cpp:29:24: required from here /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::Convertible]’ 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ^ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::ConvertibleConcept]’: /home/omnipath/local/R/4.4-3.20/BH/include/boost/property_map/property_map.hpp:208:7: required from ‘void boost::ReadWritePropertyMapConcept::constraints() [with PMap = boost::iterator_property_map, long unsigned int>, long unsigned int, long unsigned int&>; Key = long unsigned int]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::ReadWritePropertyMapConcept, long unsigned int>, long unsigned int, long unsigned int&>, long unsigned int>]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied, long unsigned int>, long unsigned int, long unsigned int&>, long unsigned int> >::value’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied, long unsigned int>, long unsigned int, long unsigned int&>, long unsigned int> >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_, long unsigned int>, long unsigned int, long unsigned int&>, long unsigned int>)>’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/strong_components.hpp:115:9: [ skipping 3 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/strong_components.hpp:205:31: required from ‘static typename boost::property_traits::value_type boost::detail::strong_comp_dispatch1::apply(const Graph&, ComponentMap, const boost::bgl_named_params&, boost::param_not_found) [with Graph = R_adjacency_list; ComponentMap = boost::iterator_property_map, long unsigned int>, long unsigned int, long unsigned int&>; P = boost::vec_adj_list_vertex_id_map, long unsigned int>; T = boost::vertex_index_t; R = boost::no_property; typename boost::property_traits::value_type = long unsigned int]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/strong_components.hpp:220:63: required from ‘typename boost::property_traits::value_type boost::detail::scc_helper1(const Graph&, ComponentMap, const boost::bgl_named_params&, RootMap) [with Graph = R_adjacency_list; ComponentMap = boost::iterator_property_map, long unsigned int>, long unsigned int, long unsigned int&>; RootMap = boost::param_not_found; P = boost::vec_adj_list_vertex_id_map, long unsigned int>; T = boost::vertex_index_t; R = boost::no_property; typename boost::property_traits::value_type = long unsigned int]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/strong_components.hpp:235:31: required from ‘typename boost::property_traits::value_type boost::strong_components(const Graph&, ComponentMap, const bgl_named_params&, typename enable_if_c::traversal_category>::value, graph::detail::no_parameter>::type) [with Graph = R_adjacency_list; ComponentMap = iterator_property_map, long unsigned int>, long unsigned int, long unsigned int&>; P = vec_adj_list_vertex_id_map, long unsigned int>; T = vertex_index_t; R = no_property; typename property_traits::value_type = long unsigned int; typename enable_if_c::traversal_category>::value, graph::detail::no_parameter>::type = graph::detail::no_parameter; typename graph_traits::traversal_category = adj_list_dir_traversal_tag]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/transitive_closure.hpp:86:28: required from ‘void boost::transitive_closure(const Graph&, GraphTC&, G_to_TC_VertexMap, VertexIndexMap) [with Graph = R_adjacency_list; GraphTC = R_adjacency_list; G_to_TC_VertexMap = iterator_property_map, long unsigned int>, long unsigned int, long unsigned int&>; VertexIndexMap = vec_adj_list_vertex_id_map, long unsigned int>]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/transitive_closure.hpp:288:23: required from ‘void boost::transitive_closure(const Graph&, GraphTC&) [with Graph = R_adjacency_list; GraphTC = R_adjacency_list]’ transitive_closure.cpp:29:24: required from here /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:206:17: note: in a call to non-static member function ‘boost::ConvertibleConcept::~ConvertibleConcept()’ 206 | BOOST_concept(Convertible,(X)(Y)) | ^~~~~~~~~~~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/preprocessor/cat.hpp:29:34: note: in definition of macro ‘BOOST_PP_CAT_I’ 29 | # define BOOST_PP_CAT_I(a, b) a ## b | ^ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/concept_def.hpp:23:12: note: in expansion of macro ‘BOOST_PP_CAT’ 23 | struct BOOST_PP_CAT(name,Concept) \ | ^~~~~~~~~~~~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:206:3: note: in expansion of macro ‘BOOST_concept’ 206 | BOOST_concept(Convertible,(X)(Y)) | ^~~~~~~~~~~~~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::constraint::failed() [with Model = boost::ReadablePropertyMapConcept >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>, long unsigned int>]’: /home/omnipath/local/R/4.4-3.20/BH/include/boost/property_map/property_map.hpp:206:7: required from ‘void boost::ReadWritePropertyMapConcept::constraints() [with PMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>; Key = long unsigned int]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::ReadWritePropertyMapConcept >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>, long unsigned int>]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>, long unsigned int> >::value’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>, long unsigned int> >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_ >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>, long unsigned int>)>’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/depth_first_search.hpp:134:9: [ skipping 3 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/strong_components.hpp:205:31: required from ‘static typename boost::property_traits::value_type boost::detail::strong_comp_dispatch1::apply(const Graph&, ComponentMap, const boost::bgl_named_params&, boost::param_not_found) [with Graph = R_adjacency_list; ComponentMap = boost::iterator_property_map, long unsigned int>, long unsigned int, long unsigned int&>; P = boost::vec_adj_list_vertex_id_map, long unsigned int>; T = boost::vertex_index_t; R = boost::no_property; typename boost::property_traits::value_type = long unsigned int]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/strong_components.hpp:220:63: required from ‘typename boost::property_traits::value_type boost::detail::scc_helper1(const Graph&, ComponentMap, const boost::bgl_named_params&, RootMap) [with Graph = R_adjacency_list; ComponentMap = boost::iterator_property_map, long unsigned int>, long unsigned int, long unsigned int&>; RootMap = boost::param_not_found; P = boost::vec_adj_list_vertex_id_map, long unsigned int>; T = boost::vertex_index_t; R = boost::no_property; typename boost::property_traits::value_type = long unsigned int]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/strong_components.hpp:235:31: required from ‘typename boost::property_traits::value_type boost::strong_components(const Graph&, ComponentMap, const bgl_named_params&, typename enable_if_c::traversal_category>::value, graph::detail::no_parameter>::type) [with Graph = R_adjacency_list; ComponentMap = iterator_property_map, long unsigned int>, long unsigned int, long unsigned int&>; P = vec_adj_list_vertex_id_map, long unsigned int>; T = vertex_index_t; R = no_property; typename property_traits::value_type = long unsigned int; typename enable_if_c::traversal_category>::value, graph::detail::no_parameter>::type = graph::detail::no_parameter; typename graph_traits::traversal_category = adj_list_dir_traversal_tag]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/transitive_closure.hpp:86:28: required from ‘void boost::transitive_closure(const Graph&, GraphTC&, G_to_TC_VertexMap, VertexIndexMap) [with Graph = R_adjacency_list; GraphTC = R_adjacency_list; G_to_TC_VertexMap = iterator_property_map, long unsigned int>, long unsigned int, long unsigned int&>; VertexIndexMap = vec_adj_list_vertex_id_map, long unsigned int>]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/transitive_closure.hpp:288:23: required from ‘void boost::transitive_closure(const Graph&, GraphTC&) [with Graph = R_adjacency_list; GraphTC = R_adjacency_list]’ transitive_closure.cpp:29:24: required from here /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:65:52: warning: ‘this’ pointer is null [-Wnonnull] 65 | static void failed() { ((Model*)0)->constraints(); } | ~~~~~~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/property_map/property_map.hpp:147:10: note: in a call to non-static member function ‘void boost::ReadablePropertyMapConcept::constraints() [with PMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>; Key = long unsigned int]’ 147 | void constraints() { | ^~~~~~~~~~~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::constraint::failed() [with Model = boost::WritablePropertyMapConcept >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>, long unsigned int>]’: /home/omnipath/local/R/4.4-3.20/BH/include/boost/property_map/property_map.hpp:207:7: required from ‘void boost::ReadWritePropertyMapConcept::constraints() [with PMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>; Key = long unsigned int]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::ReadWritePropertyMapConcept >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>, long unsigned int>]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>, long unsigned int> >::value’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>, long unsigned int> >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_ >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>, long unsigned int>)>’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/depth_first_search.hpp:134:9: [ skipping 3 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/strong_components.hpp:205:31: required from ‘static typename boost::property_traits::value_type boost::detail::strong_comp_dispatch1::apply(const Graph&, ComponentMap, const boost::bgl_named_params&, boost::param_not_found) [with Graph = R_adjacency_list; ComponentMap = boost::iterator_property_map, long unsigned int>, long unsigned int, long unsigned int&>; P = boost::vec_adj_list_vertex_id_map, long unsigned int>; T = boost::vertex_index_t; R = boost::no_property; typename boost::property_traits::value_type = long unsigned int]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/strong_components.hpp:220:63: required from ‘typename boost::property_traits::value_type boost::detail::scc_helper1(const Graph&, ComponentMap, const boost::bgl_named_params&, RootMap) [with Graph = R_adjacency_list; ComponentMap = boost::iterator_property_map, long unsigned int>, long unsigned int, long unsigned int&>; RootMap = boost::param_not_found; P = boost::vec_adj_list_vertex_id_map, long unsigned int>; T = boost::vertex_index_t; R = boost::no_property; typename boost::property_traits::value_type = long unsigned int]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/strong_components.hpp:235:31: required from ‘typename boost::property_traits::value_type boost::strong_components(const Graph&, ComponentMap, const bgl_named_params&, typename enable_if_c::traversal_category>::value, graph::detail::no_parameter>::type) [with Graph = R_adjacency_list; ComponentMap = iterator_property_map, long unsigned int>, long unsigned int, long unsigned int&>; P = vec_adj_list_vertex_id_map, long unsigned int>; T = vertex_index_t; R = no_property; typename property_traits::value_type = long unsigned int; typename enable_if_c::traversal_category>::value, graph::detail::no_parameter>::type = graph::detail::no_parameter; typename graph_traits::traversal_category = adj_list_dir_traversal_tag]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/transitive_closure.hpp:86:28: required from ‘void boost::transitive_closure(const Graph&, GraphTC&, G_to_TC_VertexMap, VertexIndexMap) [with Graph = R_adjacency_list; GraphTC = R_adjacency_list; G_to_TC_VertexMap = iterator_property_map, long unsigned int>, long unsigned int, long unsigned int&>; VertexIndexMap = vec_adj_list_vertex_id_map, long unsigned int>]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/transitive_closure.hpp:288:23: required from ‘void boost::transitive_closure(const Graph&, GraphTC&) [with Graph = R_adjacency_list; GraphTC = R_adjacency_list]’ transitive_closure.cpp:29:24: required from here /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:65:52: warning: ‘this’ pointer is null [-Wnonnull] 65 | static void failed() { ((Model*)0)->constraints(); } | ~~~~~~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/property_map/property_map.hpp:179:10: note: in a call to non-static member function ‘void boost::WritablePropertyMapConcept::constraints() [with PMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>; Key = long unsigned int]’ 179 | void constraints() { | ^~~~~~~~~~~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::Convertible]’: /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements >]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:208:5: required from ‘struct boost::Convertible’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:206:3: required from ‘struct boost::ConvertibleConcept’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::ConvertibleConcept]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied >::value’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:45:51: [ skipping 5 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/strong_components.hpp:205:31: required from ‘static typename boost::property_traits::value_type boost::detail::strong_comp_dispatch1::apply(const Graph&, ComponentMap, const boost::bgl_named_params&, boost::param_not_found) [with Graph = R_adjacency_list; ComponentMap = boost::iterator_property_map, long unsigned int>, long unsigned int, long unsigned int&>; P = boost::vec_adj_list_vertex_id_map, long unsigned int>; T = boost::vertex_index_t; R = boost::no_property; typename boost::property_traits::value_type = long unsigned int]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/strong_components.hpp:220:63: required from ‘typename boost::property_traits::value_type boost::detail::scc_helper1(const Graph&, ComponentMap, const boost::bgl_named_params&, RootMap) [with Graph = R_adjacency_list; ComponentMap = boost::iterator_property_map, long unsigned int>, long unsigned int, long unsigned int&>; RootMap = boost::param_not_found; P = boost::vec_adj_list_vertex_id_map, long unsigned int>; T = boost::vertex_index_t; R = boost::no_property; typename boost::property_traits::value_type = long unsigned int]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/strong_components.hpp:235:31: required from ‘typename boost::property_traits::value_type boost::strong_components(const Graph&, ComponentMap, const bgl_named_params&, typename enable_if_c::traversal_category>::value, graph::detail::no_parameter>::type) [with Graph = R_adjacency_list; ComponentMap = iterator_property_map, long unsigned int>, long unsigned int, long unsigned int&>; P = vec_adj_list_vertex_id_map, long unsigned int>; T = vertex_index_t; R = no_property; typename property_traits::value_type = long unsigned int; typename enable_if_c::traversal_category>::value, graph::detail::no_parameter>::type = graph::detail::no_parameter; typename graph_traits::traversal_category = adj_list_dir_traversal_tag]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/transitive_closure.hpp:86:28: required from ‘void boost::transitive_closure(const Graph&, GraphTC&, G_to_TC_VertexMap, VertexIndexMap) [with Graph = R_adjacency_list; GraphTC = R_adjacency_list; G_to_TC_VertexMap = iterator_property_map, long unsigned int>, long unsigned int, long unsigned int&>; VertexIndexMap = vec_adj_list_vertex_id_map, long unsigned int>]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/transitive_closure.hpp:288:23: required from ‘void boost::transitive_closure(const Graph&, GraphTC&) [with Graph = R_adjacency_list; GraphTC = R_adjacency_list]’ transitive_closure.cpp:29:24: required from here /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::Convertible::~Convertible() [with X = long unsigned int; Y = long unsigned int]’ 37 | ~model() | ^ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:208:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 208 | BOOST_CONCEPT_USAGE(Convertible) { | ^~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::CopyConstructible > > >]’: /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements > > > >]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:167:5: required from ‘struct boost::CopyConstructible > > >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:165:3: required from ‘struct boost::CopyConstructibleConcept > > >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::CopyConstructibleConcept > > >]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied > > > >::value’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:45:51: [ skipping 9 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/depth_first_search.hpp:406:5: required from ‘typename boost::result_of(Param0, const ArgPack&)>::type boost::graph::depth_first_search_with_named_params(const Param0&, const ArgPack&) [with Param0 = boost::adjacency_list; ArgPack = boost::parameter::aux::arg_list > > >, boost::parameter::aux::arg_list >, boost::parameter::aux::empty_arg_list, std::integral_constant >, std::integral_constant >; typename boost::result_of(Param0, const ArgPack&)>::type = void]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/depth_first_search.hpp:409:1: required from ‘typename boost::result_of(Param0, const typename boost::detail::convert_bgl_params_to_boost_parameter >::type&)>::type boost::depth_first_search(const Param0&, const bgl_named_params&) [with Param0 = adjacency_list; P = topo_sort_visitor > >; T = graph_visitor_t; R = bgl_named_params, vertex_index_t, no_property>; typename result_of(Param0, const typename detail::convert_bgl_params_to_boost_parameter >::type&)>::type = void; typename detail::convert_bgl_params_to_boost_parameter >::type = parameter::aux::arg_list > > >, parameter::aux::arg_list >, parameter::aux::empty_arg_list, std::integral_constant >, std::integral_constant >]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/topological_sort.hpp:69:23: required from ‘void boost::topological_sort(VertexListGraph&, OutputIterator, const bgl_named_params&) [with VertexListGraph = adjacency_list; OutputIterator = std::back_insert_iterator >; P = typed_identity_property_map; T = vertex_index_t; R = no_property]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/transitive_closure.hpp:122:21: required from ‘void boost::transitive_closure(const Graph&, GraphTC&, G_to_TC_VertexMap, VertexIndexMap) [with Graph = R_adjacency_list; GraphTC = R_adjacency_list; G_to_TC_VertexMap = iterator_property_map, long unsigned int>, long unsigned int, long unsigned int&>; VertexIndexMap = vec_adj_list_vertex_id_map, long unsigned int>]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/transitive_closure.hpp:288:23: required from ‘void boost::transitive_closure(const Graph&, GraphTC&) [with Graph = R_adjacency_list; GraphTC = R_adjacency_list]’ transitive_closure.cpp:29:24: required from here /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::CopyConstructible::~CopyConstructible() [with TT = boost::topo_sort_visitor > >]’ 37 | ~model() | ^ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:167:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 167 | BOOST_CONCEPT_USAGE(CopyConstructible) { | ^~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::concepts::Graph >]’: /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements > >]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/graph_concepts.hpp:66:5: required from ‘struct boost::concepts::Graph >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/graph_concepts.hpp:75:1: required from ‘struct boost::concepts::IncidenceGraph >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/graph_concepts.hpp:75:1: required from ‘struct boost::concepts::IncidenceGraphConcept >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::concepts::IncidenceGraphConcept >]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:42:5: [ skipping 6 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/depth_first_search.hpp:406:5: required from ‘typename boost::result_of(Param0, const ArgPack&)>::type boost::graph::depth_first_search_with_named_params(const Param0&, const ArgPack&) [with Param0 = boost::adjacency_list; ArgPack = boost::parameter::aux::arg_list > > >, boost::parameter::aux::arg_list >, boost::parameter::aux::empty_arg_list, std::integral_constant >, std::integral_constant >; typename boost::result_of(Param0, const ArgPack&)>::type = void]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/depth_first_search.hpp:409:1: required from ‘typename boost::result_of(Param0, const typename boost::detail::convert_bgl_params_to_boost_parameter >::type&)>::type boost::depth_first_search(const Param0&, const bgl_named_params&) [with Param0 = adjacency_list; P = topo_sort_visitor > >; T = graph_visitor_t; R = bgl_named_params, vertex_index_t, no_property>; typename result_of(Param0, const typename detail::convert_bgl_params_to_boost_parameter >::type&)>::type = void; typename detail::convert_bgl_params_to_boost_parameter >::type = parameter::aux::arg_list > > >, parameter::aux::arg_list >, parameter::aux::empty_arg_list, std::integral_constant >, std::integral_constant >]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/topological_sort.hpp:69:23: required from ‘void boost::topological_sort(VertexListGraph&, OutputIterator, const bgl_named_params&) [with VertexListGraph = adjacency_list; OutputIterator = std::back_insert_iterator >; P = typed_identity_property_map; T = vertex_index_t; R = no_property]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/transitive_closure.hpp:122:21: required from ‘void boost::transitive_closure(const Graph&, GraphTC&, G_to_TC_VertexMap, VertexIndexMap) [with Graph = R_adjacency_list; GraphTC = R_adjacency_list; G_to_TC_VertexMap = iterator_property_map, long unsigned int>, long unsigned int, long unsigned int&>; VertexIndexMap = vec_adj_list_vertex_id_map, long unsigned int>]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/transitive_closure.hpp:288:23: required from ‘void boost::transitive_closure(const Graph&, GraphTC&) [with Graph = R_adjacency_list; GraphTC = R_adjacency_list]’ transitive_closure.cpp:29:24: required from here /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::concepts::Graph::~Graph() [with G = boost::adjacency_list]’ 37 | ~model() | ^ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/graph_concepts.hpp:66:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 66 | BOOST_CONCEPT_USAGE(Graph) | ^~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::concepts::IncidenceGraph >]’: /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements > >]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/graph_concepts.hpp:87:5: required from ‘struct boost::concepts::IncidenceGraph >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/graph_concepts.hpp:75:1: required from ‘struct boost::concepts::IncidenceGraphConcept >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::concepts::IncidenceGraphConcept >]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied > >::value’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:45:51: [ skipping 5 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/depth_first_search.hpp:406:5: required from ‘typename boost::result_of(Param0, const ArgPack&)>::type boost::graph::depth_first_search_with_named_params(const Param0&, const ArgPack&) [with Param0 = boost::adjacency_list; ArgPack = boost::parameter::aux::arg_list > > >, boost::parameter::aux::arg_list >, boost::parameter::aux::empty_arg_list, std::integral_constant >, std::integral_constant >; typename boost::result_of(Param0, const ArgPack&)>::type = void]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/depth_first_search.hpp:409:1: required from ‘typename boost::result_of(Param0, const typename boost::detail::convert_bgl_params_to_boost_parameter >::type&)>::type boost::depth_first_search(const Param0&, const bgl_named_params&) [with Param0 = adjacency_list; P = topo_sort_visitor > >; T = graph_visitor_t; R = bgl_named_params, vertex_index_t, no_property>; typename result_of(Param0, const typename detail::convert_bgl_params_to_boost_parameter >::type&)>::type = void; typename detail::convert_bgl_params_to_boost_parameter >::type = parameter::aux::arg_list > > >, parameter::aux::arg_list >, parameter::aux::empty_arg_list, std::integral_constant >, std::integral_constant >]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/topological_sort.hpp:69:23: required from ‘void boost::topological_sort(VertexListGraph&, OutputIterator, const bgl_named_params&) [with VertexListGraph = adjacency_list; OutputIterator = std::back_insert_iterator >; P = typed_identity_property_map; T = vertex_index_t; R = no_property]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/transitive_closure.hpp:122:21: required from ‘void boost::transitive_closure(const Graph&, GraphTC&, G_to_TC_VertexMap, VertexIndexMap) [with Graph = R_adjacency_list; GraphTC = R_adjacency_list; G_to_TC_VertexMap = iterator_property_map, long unsigned int>, long unsigned int, long unsigned int&>; VertexIndexMap = vec_adj_list_vertex_id_map, long unsigned int>]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/transitive_closure.hpp:288:23: required from ‘void boost::transitive_closure(const Graph&, GraphTC&) [with Graph = R_adjacency_list; GraphTC = R_adjacency_list]’ transitive_closure.cpp:29:24: required from here /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::concepts::IncidenceGraph::~IncidenceGraph() [with G = boost::adjacency_list]’ 37 | ~model() | ^ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/graph_concepts.hpp:87:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 87 | BOOST_CONCEPT_USAGE(IncidenceGraph) | ^~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::constraint::failed() [with Model = boost::ReadablePropertyMapConcept >, long unsigned int>]’: /home/omnipath/local/R/4.4-3.20/BH/include/boost/property_map/property_map.hpp:206:7: required from ‘void boost::ReadWritePropertyMapConcept::constraints() [with PMap = boost::shared_array_property_map >; Key = long unsigned int]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::ReadWritePropertyMapConcept >, long unsigned int>]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied >, long unsigned int> >::value’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied >, long unsigned int> >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_ >, long unsigned int>)>’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/depth_first_search.hpp:134:9: [ skipping 3 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/depth_first_search.hpp:406:5: required from ‘typename boost::result_of(Param0, const ArgPack&)>::type boost::graph::depth_first_search_with_named_params(const Param0&, const ArgPack&) [with Param0 = boost::adjacency_list; ArgPack = boost::parameter::aux::arg_list > > >, boost::parameter::aux::arg_list >, boost::parameter::aux::empty_arg_list, std::integral_constant >, std::integral_constant >; typename boost::result_of(Param0, const ArgPack&)>::type = void]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/depth_first_search.hpp:409:1: required from ‘typename boost::result_of(Param0, const typename boost::detail::convert_bgl_params_to_boost_parameter >::type&)>::type boost::depth_first_search(const Param0&, const bgl_named_params&) [with Param0 = adjacency_list; P = topo_sort_visitor > >; T = graph_visitor_t; R = bgl_named_params, vertex_index_t, no_property>; typename result_of(Param0, const typename detail::convert_bgl_params_to_boost_parameter >::type&)>::type = void; typename detail::convert_bgl_params_to_boost_parameter >::type = parameter::aux::arg_list > > >, parameter::aux::arg_list >, parameter::aux::empty_arg_list, std::integral_constant >, std::integral_constant >]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/topological_sort.hpp:69:23: required from ‘void boost::topological_sort(VertexListGraph&, OutputIterator, const bgl_named_params&) [with VertexListGraph = adjacency_list; OutputIterator = std::back_insert_iterator >; P = typed_identity_property_map; T = vertex_index_t; R = no_property]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/transitive_closure.hpp:122:21: required from ‘void boost::transitive_closure(const Graph&, GraphTC&, G_to_TC_VertexMap, VertexIndexMap) [with Graph = R_adjacency_list; GraphTC = R_adjacency_list; G_to_TC_VertexMap = iterator_property_map, long unsigned int>, long unsigned int, long unsigned int&>; VertexIndexMap = vec_adj_list_vertex_id_map, long unsigned int>]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/transitive_closure.hpp:288:23: required from ‘void boost::transitive_closure(const Graph&, GraphTC&) [with Graph = R_adjacency_list; GraphTC = R_adjacency_list]’ transitive_closure.cpp:29:24: required from here /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:65:52: warning: ‘this’ pointer is null [-Wnonnull] 65 | static void failed() { ((Model*)0)->constraints(); } | ~~~~~~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/property_map/property_map.hpp:147:10: note: in a call to non-static member function ‘void boost::ReadablePropertyMapConcept::constraints() [with PMap = boost::shared_array_property_map >; Key = long unsigned int]’ 147 | void constraints() { | ^~~~~~~~~~~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::constraint::failed() [with Model = boost::WritablePropertyMapConcept >, long unsigned int>]’: /home/omnipath/local/R/4.4-3.20/BH/include/boost/property_map/property_map.hpp:207:7: required from ‘void boost::ReadWritePropertyMapConcept::constraints() [with PMap = boost::shared_array_property_map >; Key = long unsigned int]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::ReadWritePropertyMapConcept >, long unsigned int>]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied >, long unsigned int> >::value’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied >, long unsigned int> >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_ >, long unsigned int>)>’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/depth_first_search.hpp:134:9: [ skipping 3 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/depth_first_search.hpp:406:5: required from ‘typename boost::result_of(Param0, const ArgPack&)>::type boost::graph::depth_first_search_with_named_params(const Param0&, const ArgPack&) [with Param0 = boost::adjacency_list; ArgPack = boost::parameter::aux::arg_list > > >, boost::parameter::aux::arg_list >, boost::parameter::aux::empty_arg_list, std::integral_constant >, std::integral_constant >; typename boost::result_of(Param0, const ArgPack&)>::type = void]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/depth_first_search.hpp:409:1: required from ‘typename boost::result_of(Param0, const typename boost::detail::convert_bgl_params_to_boost_parameter >::type&)>::type boost::depth_first_search(const Param0&, const bgl_named_params&) [with Param0 = adjacency_list; P = topo_sort_visitor > >; T = graph_visitor_t; R = bgl_named_params, vertex_index_t, no_property>; typename result_of(Param0, const typename detail::convert_bgl_params_to_boost_parameter >::type&)>::type = void; typename detail::convert_bgl_params_to_boost_parameter >::type = parameter::aux::arg_list > > >, parameter::aux::arg_list >, parameter::aux::empty_arg_list, std::integral_constant >, std::integral_constant >]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/topological_sort.hpp:69:23: required from ‘void boost::topological_sort(VertexListGraph&, OutputIterator, const bgl_named_params&) [with VertexListGraph = adjacency_list; OutputIterator = std::back_insert_iterator >; P = typed_identity_property_map; T = vertex_index_t; R = no_property]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/transitive_closure.hpp:122:21: required from ‘void boost::transitive_closure(const Graph&, GraphTC&, G_to_TC_VertexMap, VertexIndexMap) [with Graph = R_adjacency_list; GraphTC = R_adjacency_list; G_to_TC_VertexMap = iterator_property_map, long unsigned int>, long unsigned int, long unsigned int&>; VertexIndexMap = vec_adj_list_vertex_id_map, long unsigned int>]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/transitive_closure.hpp:288:23: required from ‘void boost::transitive_closure(const Graph&, GraphTC&) [with Graph = R_adjacency_list; GraphTC = R_adjacency_list]’ transitive_closure.cpp:29:24: required from here /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:65:52: warning: ‘this’ pointer is null [-Wnonnull] 65 | static void failed() { ((Model*)0)->constraints(); } | ~~~~~~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/property_map/property_map.hpp:179:10: note: in a call to non-static member function ‘void boost::WritablePropertyMapConcept::constraints() [with PMap = boost::shared_array_property_map >; Key = long unsigned int]’ 179 | void constraints() { | ^~~~~~~~~~~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::EqualityComparable]’: /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements >]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:233:5: required from ‘struct boost::EqualityComparable’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/graph_concepts.hpp:502:1: required from ‘struct boost::concepts::ColorValue’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/graph_concepts.hpp:502:1: required from ‘struct boost::concepts::ColorValueConcept’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::concepts::ColorValueConcept]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:42:5: [ skipping 6 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/depth_first_search.hpp:406:5: required from ‘typename boost::result_of(Param0, const ArgPack&)>::type boost::graph::depth_first_search_with_named_params(const Param0&, const ArgPack&) [with Param0 = boost::adjacency_list; ArgPack = boost::parameter::aux::arg_list > > >, boost::parameter::aux::arg_list >, boost::parameter::aux::empty_arg_list, std::integral_constant >, std::integral_constant >; typename boost::result_of(Param0, const ArgPack&)>::type = void]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/depth_first_search.hpp:409:1: required from ‘typename boost::result_of(Param0, const typename boost::detail::convert_bgl_params_to_boost_parameter >::type&)>::type boost::depth_first_search(const Param0&, const bgl_named_params&) [with Param0 = adjacency_list; P = topo_sort_visitor > >; T = graph_visitor_t; R = bgl_named_params, vertex_index_t, no_property>; typename result_of(Param0, const typename detail::convert_bgl_params_to_boost_parameter >::type&)>::type = void; typename detail::convert_bgl_params_to_boost_parameter >::type = parameter::aux::arg_list > > >, parameter::aux::arg_list >, parameter::aux::empty_arg_list, std::integral_constant >, std::integral_constant >]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/topological_sort.hpp:69:23: required from ‘void boost::topological_sort(VertexListGraph&, OutputIterator, const bgl_named_params&) [with VertexListGraph = adjacency_list; OutputIterator = std::back_insert_iterator >; P = typed_identity_property_map; T = vertex_index_t; R = no_property]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/transitive_closure.hpp:122:21: required from ‘void boost::transitive_closure(const Graph&, GraphTC&, G_to_TC_VertexMap, VertexIndexMap) [with Graph = R_adjacency_list; GraphTC = R_adjacency_list; G_to_TC_VertexMap = iterator_property_map, long unsigned int>, long unsigned int, long unsigned int&>; VertexIndexMap = vec_adj_list_vertex_id_map, long unsigned int>]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/transitive_closure.hpp:288:23: required from ‘void boost::transitive_closure(const Graph&, GraphTC&) [with Graph = R_adjacency_list; GraphTC = R_adjacency_list]’ transitive_closure.cpp:29:24: required from here /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::EqualityComparable::~EqualityComparable() [with TT = boost::default_color_type]’ 37 | ~model() | ^ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:233:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 233 | BOOST_CONCEPT_USAGE(EqualityComparable) { | ^~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::DefaultConstructible]’: /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements >]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:137:5: required from ‘struct boost::DefaultConstructible’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/graph_concepts.hpp:502:1: required from ‘struct boost::concepts::ColorValue’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/graph_concepts.hpp:502:1: required from ‘struct boost::concepts::ColorValueConcept’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::concepts::ColorValueConcept]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:42:5: [ skipping 6 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/depth_first_search.hpp:406:5: required from ‘typename boost::result_of(Param0, const ArgPack&)>::type boost::graph::depth_first_search_with_named_params(const Param0&, const ArgPack&) [with Param0 = boost::adjacency_list; ArgPack = boost::parameter::aux::arg_list > > >, boost::parameter::aux::arg_list >, boost::parameter::aux::empty_arg_list, std::integral_constant >, std::integral_constant >; typename boost::result_of(Param0, const ArgPack&)>::type = void]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/depth_first_search.hpp:409:1: required from ‘typename boost::result_of(Param0, const typename boost::detail::convert_bgl_params_to_boost_parameter >::type&)>::type boost::depth_first_search(const Param0&, const bgl_named_params&) [with Param0 = adjacency_list; P = topo_sort_visitor > >; T = graph_visitor_t; R = bgl_named_params, vertex_index_t, no_property>; typename result_of(Param0, const typename detail::convert_bgl_params_to_boost_parameter >::type&)>::type = void; typename detail::convert_bgl_params_to_boost_parameter >::type = parameter::aux::arg_list > > >, parameter::aux::arg_list >, parameter::aux::empty_arg_list, std::integral_constant >, std::integral_constant >]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/topological_sort.hpp:69:23: required from ‘void boost::topological_sort(VertexListGraph&, OutputIterator, const bgl_named_params&) [with VertexListGraph = adjacency_list; OutputIterator = std::back_insert_iterator >; P = typed_identity_property_map; T = vertex_index_t; R = no_property]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/transitive_closure.hpp:122:21: required from ‘void boost::transitive_closure(const Graph&, GraphTC&, G_to_TC_VertexMap, VertexIndexMap) [with Graph = R_adjacency_list; GraphTC = R_adjacency_list; G_to_TC_VertexMap = iterator_property_map, long unsigned int>, long unsigned int, long unsigned int&>; VertexIndexMap = vec_adj_list_vertex_id_map, long unsigned int>]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/transitive_closure.hpp:288:23: required from ‘void boost::transitive_closure(const Graph&, GraphTC&) [with Graph = R_adjacency_list; GraphTC = R_adjacency_list]’ transitive_closure.cpp:29:24: required from here /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::DefaultConstructible::~DefaultConstructible() [with TT = boost::default_color_type]’ 37 | ~model() | ^ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:137:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 137 | BOOST_CONCEPT_USAGE(DefaultConstructible) { | ^~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::concepts::ColorValue]’: /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements >]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/graph_concepts.hpp:505:5: required from ‘struct boost::concepts::ColorValue’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/graph_concepts.hpp:502:1: required from ‘struct boost::concepts::ColorValueConcept’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::concepts::ColorValueConcept]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied >::value’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:45:51: [ skipping 5 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/depth_first_search.hpp:406:5: required from ‘typename boost::result_of(Param0, const ArgPack&)>::type boost::graph::depth_first_search_with_named_params(const Param0&, const ArgPack&) [with Param0 = boost::adjacency_list; ArgPack = boost::parameter::aux::arg_list > > >, boost::parameter::aux::arg_list >, boost::parameter::aux::empty_arg_list, std::integral_constant >, std::integral_constant >; typename boost::result_of(Param0, const ArgPack&)>::type = void]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/depth_first_search.hpp:409:1: required from ‘typename boost::result_of(Param0, const typename boost::detail::convert_bgl_params_to_boost_parameter >::type&)>::type boost::depth_first_search(const Param0&, const bgl_named_params&) [with Param0 = adjacency_list; P = topo_sort_visitor > >; T = graph_visitor_t; R = bgl_named_params, vertex_index_t, no_property>; typename result_of(Param0, const typename detail::convert_bgl_params_to_boost_parameter >::type&)>::type = void; typename detail::convert_bgl_params_to_boost_parameter >::type = parameter::aux::arg_list > > >, parameter::aux::arg_list >, parameter::aux::empty_arg_list, std::integral_constant >, std::integral_constant >]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/topological_sort.hpp:69:23: required from ‘void boost::topological_sort(VertexListGraph&, OutputIterator, const bgl_named_params&) [with VertexListGraph = adjacency_list; OutputIterator = std::back_insert_iterator >; P = typed_identity_property_map; T = vertex_index_t; R = no_property]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/transitive_closure.hpp:122:21: required from ‘void boost::transitive_closure(const Graph&, GraphTC&, G_to_TC_VertexMap, VertexIndexMap) [with Graph = R_adjacency_list; GraphTC = R_adjacency_list; G_to_TC_VertexMap = iterator_property_map, long unsigned int>, long unsigned int, long unsigned int&>; VertexIndexMap = vec_adj_list_vertex_id_map, long unsigned int>]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/transitive_closure.hpp:288:23: required from ‘void boost::transitive_closure(const Graph&, GraphTC&) [with Graph = R_adjacency_list; GraphTC = R_adjacency_list]’ transitive_closure.cpp:29:24: required from here /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::concepts::ColorValue::~ColorValue() [with C = boost::default_color_type]’ 37 | ~model() | ^ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/graph_concepts.hpp:505:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 505 | BOOST_CONCEPT_USAGE(ColorValue) | ^~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::Convertible]’: /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements >]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:208:5: required from ‘struct boost::Convertible’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::Convertible]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied >::value’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:72:8: [ skipping 13 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/strong_components.hpp:206:43: required from ‘static typename boost::property_traits::value_type boost::detail::strong_comp_dispatch1::apply(const Graph&, ComponentMap, const boost::bgl_named_params&, boost::param_not_found) [with Graph = R_adjacency_list; ComponentMap = boost::iterator_property_map, long unsigned int>, long unsigned int, long unsigned int&>; P = boost::vec_adj_list_vertex_id_map, long unsigned int>; T = boost::vertex_index_t; R = boost::no_property; typename boost::property_traits::value_type = long unsigned int]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/strong_components.hpp:220:63: required from ‘typename boost::property_traits::value_type boost::detail::scc_helper1(const Graph&, ComponentMap, const boost::bgl_named_params&, RootMap) [with Graph = R_adjacency_list; ComponentMap = boost::iterator_property_map, long unsigned int>, long unsigned int, long unsigned int&>; RootMap = boost::param_not_found; P = boost::vec_adj_list_vertex_id_map, long unsigned int>; T = boost::vertex_index_t; R = boost::no_property; typename boost::property_traits::value_type = long unsigned int]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/strong_components.hpp:235:31: required from ‘typename boost::property_traits::value_type boost::strong_components(const Graph&, ComponentMap, const bgl_named_params&, typename enable_if_c::traversal_category>::value, graph::detail::no_parameter>::type) [with Graph = R_adjacency_list; ComponentMap = iterator_property_map, long unsigned int>, long unsigned int, long unsigned int&>; P = vec_adj_list_vertex_id_map, long unsigned int>; T = vertex_index_t; R = no_property; typename property_traits::value_type = long unsigned int; typename enable_if_c::traversal_category>::value, graph::detail::no_parameter>::type = graph::detail::no_parameter; typename graph_traits::traversal_category = adj_list_dir_traversal_tag]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/transitive_closure.hpp:86:28: required from ‘void boost::transitive_closure(const Graph&, GraphTC&, G_to_TC_VertexMap, VertexIndexMap) [with Graph = R_adjacency_list; GraphTC = R_adjacency_list; G_to_TC_VertexMap = iterator_property_map, long unsigned int>, long unsigned int, long unsigned int&>; VertexIndexMap = vec_adj_list_vertex_id_map, long unsigned int>]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/transitive_closure.hpp:288:23: required from ‘void boost::transitive_closure(const Graph&, GraphTC&) [with Graph = R_adjacency_list; GraphTC = R_adjacency_list]’ transitive_closure.cpp:29:24: required from here /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::Convertible::~Convertible() [with X = std::random_access_iterator_tag; Y = std::forward_iterator_tag]’ 37 | ~model() | ^ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:208:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 208 | BOOST_CONCEPT_USAGE(Convertible) { | ^~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::Convertible]’: /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements >]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:208:5: required from ‘struct boost::Convertible’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::Convertible]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied >::value’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:72:8: [ skipping 12 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/strong_components.hpp:206:43: required from ‘static typename boost::property_traits::value_type boost::detail::strong_comp_dispatch1::apply(const Graph&, ComponentMap, const boost::bgl_named_params&, boost::param_not_found) [with Graph = R_adjacency_list; ComponentMap = boost::iterator_property_map, long unsigned int>, long unsigned int, long unsigned int&>; P = boost::vec_adj_list_vertex_id_map, long unsigned int>; T = boost::vertex_index_t; R = boost::no_property; typename boost::property_traits::value_type = long unsigned int]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/strong_components.hpp:220:63: required from ‘typename boost::property_traits::value_type boost::detail::scc_helper1(const Graph&, ComponentMap, const boost::bgl_named_params&, RootMap) [with Graph = R_adjacency_list; ComponentMap = boost::iterator_property_map, long unsigned int>, long unsigned int, long unsigned int&>; RootMap = boost::param_not_found; P = boost::vec_adj_list_vertex_id_map, long unsigned int>; T = boost::vertex_index_t; R = boost::no_property; typename boost::property_traits::value_type = long unsigned int]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/strong_components.hpp:235:31: required from ‘typename boost::property_traits::value_type boost::strong_components(const Graph&, ComponentMap, const bgl_named_params&, typename enable_if_c::traversal_category>::value, graph::detail::no_parameter>::type) [with Graph = R_adjacency_list; ComponentMap = iterator_property_map, long unsigned int>, long unsigned int, long unsigned int&>; P = vec_adj_list_vertex_id_map, long unsigned int>; T = vertex_index_t; R = no_property; typename property_traits::value_type = long unsigned int; typename enable_if_c::traversal_category>::value, graph::detail::no_parameter>::type = graph::detail::no_parameter; typename graph_traits::traversal_category = adj_list_dir_traversal_tag]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/transitive_closure.hpp:86:28: required from ‘void boost::transitive_closure(const Graph&, GraphTC&, G_to_TC_VertexMap, VertexIndexMap) [with Graph = R_adjacency_list; GraphTC = R_adjacency_list; G_to_TC_VertexMap = iterator_property_map, long unsigned int>, long unsigned int, long unsigned int&>; VertexIndexMap = vec_adj_list_vertex_id_map, long unsigned int>]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/transitive_closure.hpp:288:23: required from ‘void boost::transitive_closure(const Graph&, GraphTC&) [with Graph = R_adjacency_list; GraphTC = R_adjacency_list]’ transitive_closure.cpp:29:24: required from here /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::Convertible::~Convertible() [with X = std::random_access_iterator_tag; Y = std::bidirectional_iterator_tag]’ 37 | ~model() | ^ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:208:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 208 | BOOST_CONCEPT_USAGE(Convertible) { | ^~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements >]’: /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:208:5: required from ‘struct boost::Convertible’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:206:3: required from ‘struct boost::ConvertibleConcept’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::ConvertibleConcept]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied >::value’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:72:8: [ skipping 14 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/strong_components.hpp:205:31: required from ‘static typename boost::property_traits::value_type boost::detail::strong_comp_dispatch1::apply(const Graph&, ComponentMap, const boost::bgl_named_params&, boost::param_not_found) [with Graph = R_adjacency_list; ComponentMap = boost::iterator_property_map, long unsigned int>, long unsigned int, long unsigned int&>; P = boost::vec_adj_list_vertex_id_map, long unsigned int>; T = boost::vertex_index_t; R = boost::no_property; typename boost::property_traits::value_type = long unsigned int]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/strong_components.hpp:220:63: required from ‘typename boost::property_traits::value_type boost::detail::scc_helper1(const Graph&, ComponentMap, const boost::bgl_named_params&, RootMap) [with Graph = R_adjacency_list; ComponentMap = boost::iterator_property_map, long unsigned int>, long unsigned int, long unsigned int&>; RootMap = boost::param_not_found; P = boost::vec_adj_list_vertex_id_map, long unsigned int>; T = boost::vertex_index_t; R = boost::no_property; typename boost::property_traits::value_type = long unsigned int]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/strong_components.hpp:235:31: required from ‘typename boost::property_traits::value_type boost::strong_components(const Graph&, ComponentMap, const bgl_named_params&, typename enable_if_c::traversal_category>::value, graph::detail::no_parameter>::type) [with Graph = R_adjacency_list; ComponentMap = iterator_property_map, long unsigned int>, long unsigned int, long unsigned int&>; P = vec_adj_list_vertex_id_map, long unsigned int>; T = vertex_index_t; R = no_property; typename property_traits::value_type = long unsigned int; typename enable_if_c::traversal_category>::value, graph::detail::no_parameter>::type = graph::detail::no_parameter; typename graph_traits::traversal_category = adj_list_dir_traversal_tag]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/transitive_closure.hpp:86:28: required from ‘void boost::transitive_closure(const Graph&, GraphTC&, G_to_TC_VertexMap, VertexIndexMap) [with Graph = R_adjacency_list; GraphTC = R_adjacency_list; G_to_TC_VertexMap = iterator_property_map, long unsigned int>, long unsigned int, long unsigned int&>; VertexIndexMap = vec_adj_list_vertex_id_map, long unsigned int>]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/transitive_closure.hpp:288:23: required from ‘void boost::transitive_closure(const Graph&, GraphTC&) [with Graph = R_adjacency_list; GraphTC = R_adjacency_list]’ transitive_closure.cpp:29:24: required from here /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::Convertible]’ 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ^ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::ConvertibleConcept]’: /home/omnipath/local/R/4.4-3.20/BH/include/boost/property_map/property_map.hpp:148:7: required from ‘void boost::ReadablePropertyMapConcept::constraints() [with PMap = boost::iterator_property_map, long unsigned int>, long unsigned int, long unsigned int&>; Key = long unsigned int]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::ReadablePropertyMapConcept, long unsigned int>, long unsigned int, long unsigned int&>, long unsigned int>]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied, long unsigned int>, long unsigned int, long unsigned int&>, long unsigned int> >::value’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied, long unsigned int>, long unsigned int, long unsigned int&>, long unsigned int> >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_, long unsigned int>, long unsigned int, long unsigned int&>, long unsigned int>)>’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/property_map/property_map.hpp:206:7: [ skipping 8 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/strong_components.hpp:205:31: required from ‘static typename boost::property_traits::value_type boost::detail::strong_comp_dispatch1::apply(const Graph&, ComponentMap, const boost::bgl_named_params&, boost::param_not_found) [with Graph = R_adjacency_list; ComponentMap = boost::iterator_property_map, long unsigned int>, long unsigned int, long unsigned int&>; P = boost::vec_adj_list_vertex_id_map, long unsigned int>; T = boost::vertex_index_t; R = boost::no_property; typename boost::property_traits::value_type = long unsigned int]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/strong_components.hpp:220:63: required from ‘typename boost::property_traits::value_type boost::detail::scc_helper1(const Graph&, ComponentMap, const boost::bgl_named_params&, RootMap) [with Graph = R_adjacency_list; ComponentMap = boost::iterator_property_map, long unsigned int>, long unsigned int, long unsigned int&>; RootMap = boost::param_not_found; P = boost::vec_adj_list_vertex_id_map, long unsigned int>; T = boost::vertex_index_t; R = boost::no_property; typename boost::property_traits::value_type = long unsigned int]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/strong_components.hpp:235:31: required from ‘typename boost::property_traits::value_type boost::strong_components(const Graph&, ComponentMap, const bgl_named_params&, typename enable_if_c::traversal_category>::value, graph::detail::no_parameter>::type) [with Graph = R_adjacency_list; ComponentMap = iterator_property_map, long unsigned int>, long unsigned int, long unsigned int&>; P = vec_adj_list_vertex_id_map, long unsigned int>; T = vertex_index_t; R = no_property; typename property_traits::value_type = long unsigned int; typename enable_if_c::traversal_category>::value, graph::detail::no_parameter>::type = graph::detail::no_parameter; typename graph_traits::traversal_category = adj_list_dir_traversal_tag]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/transitive_closure.hpp:86:28: required from ‘void boost::transitive_closure(const Graph&, GraphTC&, G_to_TC_VertexMap, VertexIndexMap) [with Graph = R_adjacency_list; GraphTC = R_adjacency_list; G_to_TC_VertexMap = iterator_property_map, long unsigned int>, long unsigned int, long unsigned int&>; VertexIndexMap = vec_adj_list_vertex_id_map, long unsigned int>]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/transitive_closure.hpp:288:23: required from ‘void boost::transitive_closure(const Graph&, GraphTC&) [with Graph = R_adjacency_list; GraphTC = R_adjacency_list]’ transitive_closure.cpp:29:24: required from here /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:206:17: note: in a call to non-static member function ‘boost::ConvertibleConcept::~ConvertibleConcept()’ 206 | BOOST_concept(Convertible,(X)(Y)) | ^~~~~~~~~~~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/preprocessor/cat.hpp:29:34: note: in definition of macro ‘BOOST_PP_CAT_I’ 29 | # define BOOST_PP_CAT_I(a, b) a ## b | ^ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/concept_def.hpp:23:12: note: in expansion of macro ‘BOOST_PP_CAT’ 23 | struct BOOST_PP_CAT(name,Concept) \ | ^~~~~~~~~~~~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:206:3: note: in expansion of macro ‘BOOST_concept’ 206 | BOOST_concept(Convertible,(X)(Y)) | ^~~~~~~~~~~~~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements >]’: /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:208:5: required from ‘struct boost::Convertible’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:206:3: required from ‘struct boost::ConvertibleConcept’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::ConvertibleConcept]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied >::value’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:72:8: [ skipping 14 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/strong_components.hpp:205:31: required from ‘static typename boost::property_traits::value_type boost::detail::strong_comp_dispatch1::apply(const Graph&, ComponentMap, const boost::bgl_named_params&, boost::param_not_found) [with Graph = R_adjacency_list; ComponentMap = boost::iterator_property_map, long unsigned int>, long unsigned int, long unsigned int&>; P = boost::vec_adj_list_vertex_id_map, long unsigned int>; T = boost::vertex_index_t; R = boost::no_property; typename boost::property_traits::value_type = long unsigned int]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/strong_components.hpp:220:63: required from ‘typename boost::property_traits::value_type boost::detail::scc_helper1(const Graph&, ComponentMap, const boost::bgl_named_params&, RootMap) [with Graph = R_adjacency_list; ComponentMap = boost::iterator_property_map, long unsigned int>, long unsigned int, long unsigned int&>; RootMap = boost::param_not_found; P = boost::vec_adj_list_vertex_id_map, long unsigned int>; T = boost::vertex_index_t; R = boost::no_property; typename boost::property_traits::value_type = long unsigned int]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/strong_components.hpp:235:31: required from ‘typename boost::property_traits::value_type boost::strong_components(const Graph&, ComponentMap, const bgl_named_params&, typename enable_if_c::traversal_category>::value, graph::detail::no_parameter>::type) [with Graph = R_adjacency_list; ComponentMap = iterator_property_map, long unsigned int>, long unsigned int, long unsigned int&>; P = vec_adj_list_vertex_id_map, long unsigned int>; T = vertex_index_t; R = no_property; typename property_traits::value_type = long unsigned int; typename enable_if_c::traversal_category>::value, graph::detail::no_parameter>::type = graph::detail::no_parameter; typename graph_traits::traversal_category = adj_list_dir_traversal_tag]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/transitive_closure.hpp:86:28: required from ‘void boost::transitive_closure(const Graph&, GraphTC&, G_to_TC_VertexMap, VertexIndexMap) [with Graph = R_adjacency_list; GraphTC = R_adjacency_list; G_to_TC_VertexMap = iterator_property_map, long unsigned int>, long unsigned int, long unsigned int&>; VertexIndexMap = vec_adj_list_vertex_id_map, long unsigned int>]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/transitive_closure.hpp:288:23: required from ‘void boost::transitive_closure(const Graph&, GraphTC&) [with Graph = R_adjacency_list; GraphTC = R_adjacency_list]’ transitive_closure.cpp:29:24: required from here /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::Convertible]’ 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ^ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::ConvertibleConcept]’: /home/omnipath/local/R/4.4-3.20/BH/include/boost/property_map/property_map.hpp:180:7: required from ‘void boost::WritablePropertyMapConcept::constraints() [with PMap = boost::iterator_property_map, long unsigned int>, long unsigned int, long unsigned int&>; Key = long unsigned int]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::WritablePropertyMapConcept, long unsigned int>, long unsigned int, long unsigned int&>, long unsigned int>]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied, long unsigned int>, long unsigned int, long unsigned int&>, long unsigned int> >::value’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied, long unsigned int>, long unsigned int, long unsigned int&>, long unsigned int> >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_, long unsigned int>, long unsigned int, long unsigned int&>, long unsigned int>)>’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/property_map/property_map.hpp:207:7: [ skipping 8 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/strong_components.hpp:205:31: required from ‘static typename boost::property_traits::value_type boost::detail::strong_comp_dispatch1::apply(const Graph&, ComponentMap, const boost::bgl_named_params&, boost::param_not_found) [with Graph = R_adjacency_list; ComponentMap = boost::iterator_property_map, long unsigned int>, long unsigned int, long unsigned int&>; P = boost::vec_adj_list_vertex_id_map, long unsigned int>; T = boost::vertex_index_t; R = boost::no_property; typename boost::property_traits::value_type = long unsigned int]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/strong_components.hpp:220:63: required from ‘typename boost::property_traits::value_type boost::detail::scc_helper1(const Graph&, ComponentMap, const boost::bgl_named_params&, RootMap) [with Graph = R_adjacency_list; ComponentMap = boost::iterator_property_map, long unsigned int>, long unsigned int, long unsigned int&>; RootMap = boost::param_not_found; P = boost::vec_adj_list_vertex_id_map, long unsigned int>; T = boost::vertex_index_t; R = boost::no_property; typename boost::property_traits::value_type = long unsigned int]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/strong_components.hpp:235:31: required from ‘typename boost::property_traits::value_type boost::strong_components(const Graph&, ComponentMap, const bgl_named_params&, typename enable_if_c::traversal_category>::value, graph::detail::no_parameter>::type) [with Graph = R_adjacency_list; ComponentMap = iterator_property_map, long unsigned int>, long unsigned int, long unsigned int&>; P = vec_adj_list_vertex_id_map, long unsigned int>; T = vertex_index_t; R = no_property; typename property_traits::value_type = long unsigned int; typename enable_if_c::traversal_category>::value, graph::detail::no_parameter>::type = graph::detail::no_parameter; typename graph_traits::traversal_category = adj_list_dir_traversal_tag]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/transitive_closure.hpp:86:28: required from ‘void boost::transitive_closure(const Graph&, GraphTC&, G_to_TC_VertexMap, VertexIndexMap) [with Graph = R_adjacency_list; GraphTC = R_adjacency_list; G_to_TC_VertexMap = iterator_property_map, long unsigned int>, long unsigned int, long unsigned int&>; VertexIndexMap = vec_adj_list_vertex_id_map, long unsigned int>]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/transitive_closure.hpp:288:23: required from ‘void boost::transitive_closure(const Graph&, GraphTC&) [with Graph = R_adjacency_list; GraphTC = R_adjacency_list]’ transitive_closure.cpp:29:24: required from here /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:206:17: note: in a call to non-static member function ‘boost::ConvertibleConcept::~ConvertibleConcept()’ 206 | BOOST_concept(Convertible,(X)(Y)) | ^~~~~~~~~~~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/preprocessor/cat.hpp:29:34: note: in definition of macro ‘BOOST_PP_CAT_I’ 29 | # define BOOST_PP_CAT_I(a, b) a ## b | ^ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/concept_def.hpp:23:12: note: in expansion of macro ‘BOOST_PP_CAT’ 23 | struct BOOST_PP_CAT(name,Concept) \ | ^~~~~~~~~~~~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:206:3: note: in expansion of macro ‘BOOST_concept’ 206 | BOOST_concept(Convertible,(X)(Y)) | ^~~~~~~~~~~~~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::Convertible]’: /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements >]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:208:5: required from ‘struct boost::Convertible’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:206:3: required from ‘struct boost::ConvertibleConcept’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::ConvertibleConcept]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied >::value’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:45:51: [ skipping 10 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/strong_components.hpp:205:31: required from ‘static typename boost::property_traits::value_type boost::detail::strong_comp_dispatch1::apply(const Graph&, ComponentMap, const boost::bgl_named_params&, boost::param_not_found) [with Graph = R_adjacency_list; ComponentMap = boost::iterator_property_map, long unsigned int>, long unsigned int, long unsigned int&>; P = boost::vec_adj_list_vertex_id_map, long unsigned int>; T = boost::vertex_index_t; R = boost::no_property; typename boost::property_traits::value_type = long unsigned int]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/strong_components.hpp:220:63: required from ‘typename boost::property_traits::value_type boost::detail::scc_helper1(const Graph&, ComponentMap, const boost::bgl_named_params&, RootMap) [with Graph = R_adjacency_list; ComponentMap = boost::iterator_property_map, long unsigned int>, long unsigned int, long unsigned int&>; RootMap = boost::param_not_found; P = boost::vec_adj_list_vertex_id_map, long unsigned int>; T = boost::vertex_index_t; R = boost::no_property; typename boost::property_traits::value_type = long unsigned int]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/strong_components.hpp:235:31: required from ‘typename boost::property_traits::value_type boost::strong_components(const Graph&, ComponentMap, const bgl_named_params&, typename enable_if_c::traversal_category>::value, graph::detail::no_parameter>::type) [with Graph = R_adjacency_list; ComponentMap = iterator_property_map, long unsigned int>, long unsigned int, long unsigned int&>; P = vec_adj_list_vertex_id_map, long unsigned int>; T = vertex_index_t; R = no_property; typename property_traits::value_type = long unsigned int; typename enable_if_c::traversal_category>::value, graph::detail::no_parameter>::type = graph::detail::no_parameter; typename graph_traits::traversal_category = adj_list_dir_traversal_tag]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/transitive_closure.hpp:86:28: required from ‘void boost::transitive_closure(const Graph&, GraphTC&, G_to_TC_VertexMap, VertexIndexMap) [with Graph = R_adjacency_list; GraphTC = R_adjacency_list; G_to_TC_VertexMap = iterator_property_map, long unsigned int>, long unsigned int, long unsigned int&>; VertexIndexMap = vec_adj_list_vertex_id_map, long unsigned int>]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/transitive_closure.hpp:288:23: required from ‘void boost::transitive_closure(const Graph&, GraphTC&) [with Graph = R_adjacency_list; GraphTC = R_adjacency_list]’ transitive_closure.cpp:29:24: required from here /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::Convertible::~Convertible() [with X = boost::lvalue_property_map_tag; Y = boost::read_write_property_map_tag]’ 37 | ~model() | ^ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:208:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 208 | BOOST_CONCEPT_USAGE(Convertible) { | ^~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements*, std::vector, std::allocator > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >]’: /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/graph_concepts.hpp:52:50: required from ‘struct boost::concepts::MultiPassInputIterator*, std::vector, std::allocator > > >, long unsigned int, boost::detail::edge_desc_impl, long int> >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::concepts::MultiPassInputIterator*, std::vector, std::allocator > > >, long unsigned int, boost::detail::edge_desc_impl, long int> >]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied*, std::vector, std::allocator > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::value’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied*, std::vector, std::allocator > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_*, std::vector, std::allocator > > >, long unsigned int, boost::detail::edge_desc_impl, long int> >)>’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/graph_concepts.hpp:89:9: [ skipping 5 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/depth_first_search.hpp:406:5: required from ‘typename boost::result_of(Param0, const ArgPack&)>::type boost::graph::depth_first_search_with_named_params(const Param0&, const ArgPack&) [with Param0 = boost::adjacency_list; ArgPack = boost::parameter::aux::arg_list > > >, boost::parameter::aux::arg_list >, boost::parameter::aux::empty_arg_list, std::integral_constant >, std::integral_constant >; typename boost::result_of(Param0, const ArgPack&)>::type = void]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/depth_first_search.hpp:409:1: required from ‘typename boost::result_of(Param0, const typename boost::detail::convert_bgl_params_to_boost_parameter >::type&)>::type boost::depth_first_search(const Param0&, const bgl_named_params&) [with Param0 = adjacency_list; P = topo_sort_visitor > >; T = graph_visitor_t; R = bgl_named_params, vertex_index_t, no_property>; typename result_of(Param0, const typename detail::convert_bgl_params_to_boost_parameter >::type&)>::type = void; typename detail::convert_bgl_params_to_boost_parameter >::type = parameter::aux::arg_list > > >, parameter::aux::arg_list >, parameter::aux::empty_arg_list, std::integral_constant >, std::integral_constant >]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/topological_sort.hpp:69:23: required from ‘void boost::topological_sort(VertexListGraph&, OutputIterator, const bgl_named_params&) [with VertexListGraph = adjacency_list; OutputIterator = std::back_insert_iterator >; P = typed_identity_property_map; T = vertex_index_t; R = no_property]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/transitive_closure.hpp:122:21: required from ‘void boost::transitive_closure(const Graph&, GraphTC&, G_to_TC_VertexMap, VertexIndexMap) [with Graph = R_adjacency_list; GraphTC = R_adjacency_list; G_to_TC_VertexMap = iterator_property_map, long unsigned int>, long unsigned int, long unsigned int&>; VertexIndexMap = vec_adj_list_vertex_id_map, long unsigned int>]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/transitive_closure.hpp:288:23: required from ‘void boost::transitive_closure(const Graph&, GraphTC&) [with Graph = R_adjacency_list; GraphTC = R_adjacency_list]’ transitive_closure.cpp:29:24: required from here /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::concepts::MultiPassInputIterator*, std::vector, std::allocator > > >, long unsigned int, boost::detail::edge_desc_impl, long int> >]’ 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ^ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::MultiPassInputIterator*, std::vector, std::allocator > > >, long unsigned int, boost::detail::edge_desc_impl, long int> >]’: /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/graph_concepts.hpp:89:9: required from ‘boost::concepts::IncidenceGraph::~IncidenceGraph() [with G = boost::adjacency_list]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/graph_concepts.hpp:75:1: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::IncidenceGraphConcept >]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/depth_first_search.hpp:129:9: required from ‘void boost::detail::depth_first_visit_impl(const IncidenceGraph&, typename boost::graph_traits::vertex_descriptor, DFSVisitor&, ColorMap, TerminatorFunc) [with IncidenceGraph = boost::adjacency_list; DFSVisitor = boost::topo_sort_visitor > >; ColorMap = boost::shared_array_property_map >; TerminatorFunc = nontruth2; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/depth_first_search.hpp:286:39: required from ‘void boost::depth_first_search(const VertexListGraph&, DFSVisitor, ColorMap, typename graph_traits::vertex_descriptor) [with VertexListGraph = adjacency_list; DFSVisitor = topo_sort_visitor > >; ColorMap = shared_array_property_map >; typename graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/depth_first_search.hpp:397:42: required from ‘void boost::graph::detail::depth_first_search_impl::operator()(const Graph&, const ArgPack&) const [with ArgPack = boost::parameter::aux::arg_list > > >, boost::parameter::aux::arg_list >, boost::parameter::aux::empty_arg_list, std::integral_constant >, std::integral_constant >; Graph = boost::adjacency_list]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/depth_first_search.hpp:406:5: required from ‘typename boost::result_of(Param0, const ArgPack&)>::type boost::graph::depth_first_search_with_named_params(const Param0&, const ArgPack&) [with Param0 = boost::adjacency_list; ArgPack = boost::parameter::aux::arg_list > > >, boost::parameter::aux::arg_list >, boost::parameter::aux::empty_arg_list, std::integral_constant >, std::integral_constant >; typename boost::result_of(Param0, const ArgPack&)>::type = void]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/depth_first_search.hpp:409:1: required from ‘typename boost::result_of(Param0, const typename boost::detail::convert_bgl_params_to_boost_parameter >::type&)>::type boost::depth_first_search(const Param0&, const bgl_named_params&) [with Param0 = adjacency_list; P = topo_sort_visitor > >; T = graph_visitor_t; R = bgl_named_params, vertex_index_t, no_property>; typename result_of(Param0, const typename detail::convert_bgl_params_to_boost_parameter >::type&)>::type = void; typename detail::convert_bgl_params_to_boost_parameter >::type = parameter::aux::arg_list > > >, parameter::aux::arg_list >, parameter::aux::empty_arg_list, std::integral_constant >, std::integral_constant >]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/topological_sort.hpp:69:23: required from ‘void boost::topological_sort(VertexListGraph&, OutputIterator, const bgl_named_params&) [with VertexListGraph = adjacency_list; OutputIterator = std::back_insert_iterator >; P = typed_identity_property_map; T = vertex_index_t; R = no_property]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/transitive_closure.hpp:122:21: required from ‘void boost::transitive_closure(const Graph&, GraphTC&, G_to_TC_VertexMap, VertexIndexMap) [with Graph = R_adjacency_list; GraphTC = R_adjacency_list; G_to_TC_VertexMap = iterator_property_map, long unsigned int>, long unsigned int, long unsigned int&>; VertexIndexMap = vec_adj_list_vertex_id_map, long unsigned int>]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/transitive_closure.hpp:288:23: required from ‘void boost::transitive_closure(const Graph&, GraphTC&) [with Graph = R_adjacency_list; GraphTC = R_adjacency_list]’ transitive_closure.cpp:29:24: required from here /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::concepts::MultiPassInputIterator::~MultiPassInputIterator() [with T = boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator*, std::vector, std::allocator > > >, long unsigned int, boost::detail::edge_desc_impl, long int>]’ 37 | ~model() | ^ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/graph_concepts.hpp:52:50: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 52 | BOOST_concept(MultiPassInputIterator, (T)) { BOOST_CONCEPT_USAGE( | ^~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements > >]’: /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:137:5: required from ‘struct boost::DefaultConstructible >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::DefaultConstructible >]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied > >::value’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied > >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_ >)>’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/graph_concepts.hpp:90:9: [ skipping 5 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/depth_first_search.hpp:406:5: required from ‘typename boost::result_of(Param0, const ArgPack&)>::type boost::graph::depth_first_search_with_named_params(const Param0&, const ArgPack&) [with Param0 = boost::adjacency_list; ArgPack = boost::parameter::aux::arg_list > > >, boost::parameter::aux::arg_list >, boost::parameter::aux::empty_arg_list, std::integral_constant >, std::integral_constant >; typename boost::result_of(Param0, const ArgPack&)>::type = void]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/depth_first_search.hpp:409:1: required from ‘typename boost::result_of(Param0, const typename boost::detail::convert_bgl_params_to_boost_parameter >::type&)>::type boost::depth_first_search(const Param0&, const bgl_named_params&) [with Param0 = adjacency_list; P = topo_sort_visitor > >; T = graph_visitor_t; R = bgl_named_params, vertex_index_t, no_property>; typename result_of(Param0, const typename detail::convert_bgl_params_to_boost_parameter >::type&)>::type = void; typename detail::convert_bgl_params_to_boost_parameter >::type = parameter::aux::arg_list > > >, parameter::aux::arg_list >, parameter::aux::empty_arg_list, std::integral_constant >, std::integral_constant >]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/topological_sort.hpp:69:23: required from ‘void boost::topological_sort(VertexListGraph&, OutputIterator, const bgl_named_params&) [with VertexListGraph = adjacency_list; OutputIterator = std::back_insert_iterator >; P = typed_identity_property_map; T = vertex_index_t; R = no_property]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/transitive_closure.hpp:122:21: required from ‘void boost::transitive_closure(const Graph&, GraphTC&, G_to_TC_VertexMap, VertexIndexMap) [with Graph = R_adjacency_list; GraphTC = R_adjacency_list; G_to_TC_VertexMap = iterator_property_map, long unsigned int>, long unsigned int, long unsigned int&>; VertexIndexMap = vec_adj_list_vertex_id_map, long unsigned int>]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/transitive_closure.hpp:288:23: required from ‘void boost::transitive_closure(const Graph&, GraphTC&) [with Graph = R_adjacency_list; GraphTC = R_adjacency_list]’ transitive_closure.cpp:29:24: required from here /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::DefaultConstructible >]’ 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ^ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::DefaultConstructible >]’: /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/graph_concepts.hpp:90:9: required from ‘boost::concepts::IncidenceGraph::~IncidenceGraph() [with G = boost::adjacency_list]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/graph_concepts.hpp:75:1: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::IncidenceGraphConcept >]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/depth_first_search.hpp:129:9: required from ‘void boost::detail::depth_first_visit_impl(const IncidenceGraph&, typename boost::graph_traits::vertex_descriptor, DFSVisitor&, ColorMap, TerminatorFunc) [with IncidenceGraph = boost::adjacency_list; DFSVisitor = boost::topo_sort_visitor > >; ColorMap = boost::shared_array_property_map >; TerminatorFunc = nontruth2; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/depth_first_search.hpp:286:39: required from ‘void boost::depth_first_search(const VertexListGraph&, DFSVisitor, ColorMap, typename graph_traits::vertex_descriptor) [with VertexListGraph = adjacency_list; DFSVisitor = topo_sort_visitor > >; ColorMap = shared_array_property_map >; typename graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/depth_first_search.hpp:397:42: required from ‘void boost::graph::detail::depth_first_search_impl::operator()(const Graph&, const ArgPack&) const [with ArgPack = boost::parameter::aux::arg_list > > >, boost::parameter::aux::arg_list >, boost::parameter::aux::empty_arg_list, std::integral_constant >, std::integral_constant >; Graph = boost::adjacency_list]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/depth_first_search.hpp:406:5: required from ‘typename boost::result_of(Param0, const ArgPack&)>::type boost::graph::depth_first_search_with_named_params(const Param0&, const ArgPack&) [with Param0 = boost::adjacency_list; ArgPack = boost::parameter::aux::arg_list > > >, boost::parameter::aux::arg_list >, boost::parameter::aux::empty_arg_list, std::integral_constant >, std::integral_constant >; typename boost::result_of(Param0, const ArgPack&)>::type = void]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/depth_first_search.hpp:409:1: required from ‘typename boost::result_of(Param0, const typename boost::detail::convert_bgl_params_to_boost_parameter >::type&)>::type boost::depth_first_search(const Param0&, const bgl_named_params&) [with Param0 = adjacency_list; P = topo_sort_visitor > >; T = graph_visitor_t; R = bgl_named_params, vertex_index_t, no_property>; typename result_of(Param0, const typename detail::convert_bgl_params_to_boost_parameter >::type&)>::type = void; typename detail::convert_bgl_params_to_boost_parameter >::type = parameter::aux::arg_list > > >, parameter::aux::arg_list >, parameter::aux::empty_arg_list, std::integral_constant >, std::integral_constant >]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/topological_sort.hpp:69:23: required from ‘void boost::topological_sort(VertexListGraph&, OutputIterator, const bgl_named_params&) [with VertexListGraph = adjacency_list; OutputIterator = std::back_insert_iterator >; P = typed_identity_property_map; T = vertex_index_t; R = no_property]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/transitive_closure.hpp:122:21: required from ‘void boost::transitive_closure(const Graph&, GraphTC&, G_to_TC_VertexMap, VertexIndexMap) [with Graph = R_adjacency_list; GraphTC = R_adjacency_list; G_to_TC_VertexMap = iterator_property_map, long unsigned int>, long unsigned int, long unsigned int&>; VertexIndexMap = vec_adj_list_vertex_id_map, long unsigned int>]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/transitive_closure.hpp:288:23: required from ‘void boost::transitive_closure(const Graph&, GraphTC&) [with Graph = R_adjacency_list; GraphTC = R_adjacency_list]’ transitive_closure.cpp:29:24: required from here /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::DefaultConstructible::~DefaultConstructible() [with TT = boost::detail::edge_desc_impl]’ 37 | ~model() | ^ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:137:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 137 | BOOST_CONCEPT_USAGE(DefaultConstructible) { | ^~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements > >]’: /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:233:5: required from ‘struct boost::EqualityComparable >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::EqualityComparable >]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied > >::value’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied > >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_ >)>’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/graph_concepts.hpp:91:9: [ skipping 5 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/depth_first_search.hpp:406:5: required from ‘typename boost::result_of(Param0, const ArgPack&)>::type boost::graph::depth_first_search_with_named_params(const Param0&, const ArgPack&) [with Param0 = boost::adjacency_list; ArgPack = boost::parameter::aux::arg_list > > >, boost::parameter::aux::arg_list >, boost::parameter::aux::empty_arg_list, std::integral_constant >, std::integral_constant >; typename boost::result_of(Param0, const ArgPack&)>::type = void]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/depth_first_search.hpp:409:1: required from ‘typename boost::result_of(Param0, const typename boost::detail::convert_bgl_params_to_boost_parameter >::type&)>::type boost::depth_first_search(const Param0&, const bgl_named_params&) [with Param0 = adjacency_list; P = topo_sort_visitor > >; T = graph_visitor_t; R = bgl_named_params, vertex_index_t, no_property>; typename result_of(Param0, const typename detail::convert_bgl_params_to_boost_parameter >::type&)>::type = void; typename detail::convert_bgl_params_to_boost_parameter >::type = parameter::aux::arg_list > > >, parameter::aux::arg_list >, parameter::aux::empty_arg_list, std::integral_constant >, std::integral_constant >]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/topological_sort.hpp:69:23: required from ‘void boost::topological_sort(VertexListGraph&, OutputIterator, const bgl_named_params&) [with VertexListGraph = adjacency_list; OutputIterator = std::back_insert_iterator >; P = typed_identity_property_map; T = vertex_index_t; R = no_property]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/transitive_closure.hpp:122:21: required from ‘void boost::transitive_closure(const Graph&, GraphTC&, G_to_TC_VertexMap, VertexIndexMap) [with Graph = R_adjacency_list; GraphTC = R_adjacency_list; G_to_TC_VertexMap = iterator_property_map, long unsigned int>, long unsigned int, long unsigned int&>; VertexIndexMap = vec_adj_list_vertex_id_map, long unsigned int>]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/transitive_closure.hpp:288:23: required from ‘void boost::transitive_closure(const Graph&, GraphTC&) [with Graph = R_adjacency_list; GraphTC = R_adjacency_list]’ transitive_closure.cpp:29:24: required from here /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::EqualityComparable >]’ 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ^ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::EqualityComparable >]’: /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/graph_concepts.hpp:91:9: required from ‘boost::concepts::IncidenceGraph::~IncidenceGraph() [with G = boost::adjacency_list]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/graph_concepts.hpp:75:1: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::IncidenceGraphConcept >]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/depth_first_search.hpp:129:9: required from ‘void boost::detail::depth_first_visit_impl(const IncidenceGraph&, typename boost::graph_traits::vertex_descriptor, DFSVisitor&, ColorMap, TerminatorFunc) [with IncidenceGraph = boost::adjacency_list; DFSVisitor = boost::topo_sort_visitor > >; ColorMap = boost::shared_array_property_map >; TerminatorFunc = nontruth2; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/depth_first_search.hpp:286:39: required from ‘void boost::depth_first_search(const VertexListGraph&, DFSVisitor, ColorMap, typename graph_traits::vertex_descriptor) [with VertexListGraph = adjacency_list; DFSVisitor = topo_sort_visitor > >; ColorMap = shared_array_property_map >; typename graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/depth_first_search.hpp:397:42: required from ‘void boost::graph::detail::depth_first_search_impl::operator()(const Graph&, const ArgPack&) const [with ArgPack = boost::parameter::aux::arg_list > > >, boost::parameter::aux::arg_list >, boost::parameter::aux::empty_arg_list, std::integral_constant >, std::integral_constant >; Graph = boost::adjacency_list]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/depth_first_search.hpp:406:5: required from ‘typename boost::result_of(Param0, const ArgPack&)>::type boost::graph::depth_first_search_with_named_params(const Param0&, const ArgPack&) [with Param0 = boost::adjacency_list; ArgPack = boost::parameter::aux::arg_list > > >, boost::parameter::aux::arg_list >, boost::parameter::aux::empty_arg_list, std::integral_constant >, std::integral_constant >; typename boost::result_of(Param0, const ArgPack&)>::type = void]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/depth_first_search.hpp:409:1: required from ‘typename boost::result_of(Param0, const typename boost::detail::convert_bgl_params_to_boost_parameter >::type&)>::type boost::depth_first_search(const Param0&, const bgl_named_params&) [with Param0 = adjacency_list; P = topo_sort_visitor > >; T = graph_visitor_t; R = bgl_named_params, vertex_index_t, no_property>; typename result_of(Param0, const typename detail::convert_bgl_params_to_boost_parameter >::type&)>::type = void; typename detail::convert_bgl_params_to_boost_parameter >::type = parameter::aux::arg_list > > >, parameter::aux::arg_list >, parameter::aux::empty_arg_list, std::integral_constant >, std::integral_constant >]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/topological_sort.hpp:69:23: required from ‘void boost::topological_sort(VertexListGraph&, OutputIterator, const bgl_named_params&) [with VertexListGraph = adjacency_list; OutputIterator = std::back_insert_iterator >; P = typed_identity_property_map; T = vertex_index_t; R = no_property]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/transitive_closure.hpp:122:21: required from ‘void boost::transitive_closure(const Graph&, GraphTC&, G_to_TC_VertexMap, VertexIndexMap) [with Graph = R_adjacency_list; GraphTC = R_adjacency_list; G_to_TC_VertexMap = iterator_property_map, long unsigned int>, long unsigned int, long unsigned int&>; VertexIndexMap = vec_adj_list_vertex_id_map, long unsigned int>]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/transitive_closure.hpp:288:23: required from ‘void boost::transitive_closure(const Graph&, GraphTC&) [with Graph = R_adjacency_list; GraphTC = R_adjacency_list]’ transitive_closure.cpp:29:24: required from here /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::EqualityComparable::~EqualityComparable() [with TT = boost::detail::edge_desc_impl]’ 37 | ~model() | ^ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:233:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 233 | BOOST_CONCEPT_USAGE(EqualityComparable) { | ^~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements > >]’: /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:145:5: required from ‘struct boost::Assignable >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::Assignable >]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied > >::value’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied > >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_ >)>’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/graph_concepts.hpp:92:9: [ skipping 5 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/depth_first_search.hpp:406:5: required from ‘typename boost::result_of(Param0, const ArgPack&)>::type boost::graph::depth_first_search_with_named_params(const Param0&, const ArgPack&) [with Param0 = boost::adjacency_list; ArgPack = boost::parameter::aux::arg_list > > >, boost::parameter::aux::arg_list >, boost::parameter::aux::empty_arg_list, std::integral_constant >, std::integral_constant >; typename boost::result_of(Param0, const ArgPack&)>::type = void]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/depth_first_search.hpp:409:1: required from ‘typename boost::result_of(Param0, const typename boost::detail::convert_bgl_params_to_boost_parameter >::type&)>::type boost::depth_first_search(const Param0&, const bgl_named_params&) [with Param0 = adjacency_list; P = topo_sort_visitor > >; T = graph_visitor_t; R = bgl_named_params, vertex_index_t, no_property>; typename result_of(Param0, const typename detail::convert_bgl_params_to_boost_parameter >::type&)>::type = void; typename detail::convert_bgl_params_to_boost_parameter >::type = parameter::aux::arg_list > > >, parameter::aux::arg_list >, parameter::aux::empty_arg_list, std::integral_constant >, std::integral_constant >]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/topological_sort.hpp:69:23: required from ‘void boost::topological_sort(VertexListGraph&, OutputIterator, const bgl_named_params&) [with VertexListGraph = adjacency_list; OutputIterator = std::back_insert_iterator >; P = typed_identity_property_map; T = vertex_index_t; R = no_property]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/transitive_closure.hpp:122:21: required from ‘void boost::transitive_closure(const Graph&, GraphTC&, G_to_TC_VertexMap, VertexIndexMap) [with Graph = R_adjacency_list; GraphTC = R_adjacency_list; G_to_TC_VertexMap = iterator_property_map, long unsigned int>, long unsigned int, long unsigned int&>; VertexIndexMap = vec_adj_list_vertex_id_map, long unsigned int>]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/transitive_closure.hpp:288:23: required from ‘void boost::transitive_closure(const Graph&, GraphTC&) [with Graph = R_adjacency_list; GraphTC = R_adjacency_list]’ transitive_closure.cpp:29:24: required from here /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::Assignable >]’ 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ^ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::Assignable >]’: /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/graph_concepts.hpp:92:9: required from ‘boost::concepts::IncidenceGraph::~IncidenceGraph() [with G = boost::adjacency_list]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/graph_concepts.hpp:75:1: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::IncidenceGraphConcept >]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/depth_first_search.hpp:129:9: required from ‘void boost::detail::depth_first_visit_impl(const IncidenceGraph&, typename boost::graph_traits::vertex_descriptor, DFSVisitor&, ColorMap, TerminatorFunc) [with IncidenceGraph = boost::adjacency_list; DFSVisitor = boost::topo_sort_visitor > >; ColorMap = boost::shared_array_property_map >; TerminatorFunc = nontruth2; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/depth_first_search.hpp:286:39: required from ‘void boost::depth_first_search(const VertexListGraph&, DFSVisitor, ColorMap, typename graph_traits::vertex_descriptor) [with VertexListGraph = adjacency_list; DFSVisitor = topo_sort_visitor > >; ColorMap = shared_array_property_map >; typename graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/depth_first_search.hpp:397:42: required from ‘void boost::graph::detail::depth_first_search_impl::operator()(const Graph&, const ArgPack&) const [with ArgPack = boost::parameter::aux::arg_list > > >, boost::parameter::aux::arg_list >, boost::parameter::aux::empty_arg_list, std::integral_constant >, std::integral_constant >; Graph = boost::adjacency_list]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/depth_first_search.hpp:406:5: required from ‘typename boost::result_of(Param0, const ArgPack&)>::type boost::graph::depth_first_search_with_named_params(const Param0&, const ArgPack&) [with Param0 = boost::adjacency_list; ArgPack = boost::parameter::aux::arg_list > > >, boost::parameter::aux::arg_list >, boost::parameter::aux::empty_arg_list, std::integral_constant >, std::integral_constant >; typename boost::result_of(Param0, const ArgPack&)>::type = void]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/depth_first_search.hpp:409:1: required from ‘typename boost::result_of(Param0, const typename boost::detail::convert_bgl_params_to_boost_parameter >::type&)>::type boost::depth_first_search(const Param0&, const bgl_named_params&) [with Param0 = adjacency_list; P = topo_sort_visitor > >; T = graph_visitor_t; R = bgl_named_params, vertex_index_t, no_property>; typename result_of(Param0, const typename detail::convert_bgl_params_to_boost_parameter >::type&)>::type = void; typename detail::convert_bgl_params_to_boost_parameter >::type = parameter::aux::arg_list > > >, parameter::aux::arg_list >, parameter::aux::empty_arg_list, std::integral_constant >, std::integral_constant >]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/topological_sort.hpp:69:23: required from ‘void boost::topological_sort(VertexListGraph&, OutputIterator, const bgl_named_params&) [with VertexListGraph = adjacency_list; OutputIterator = std::back_insert_iterator >; P = typed_identity_property_map; T = vertex_index_t; R = no_property]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/transitive_closure.hpp:122:21: required from ‘void boost::transitive_closure(const Graph&, GraphTC&, G_to_TC_VertexMap, VertexIndexMap) [with Graph = R_adjacency_list; GraphTC = R_adjacency_list; G_to_TC_VertexMap = iterator_property_map, long unsigned int>, long unsigned int, long unsigned int&>; VertexIndexMap = vec_adj_list_vertex_id_map, long unsigned int>]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/transitive_closure.hpp:288:23: required from ‘void boost::transitive_closure(const Graph&, GraphTC&) [with Graph = R_adjacency_list; GraphTC = R_adjacency_list]’ transitive_closure.cpp:29:24: required from here /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::Assignable::~Assignable() [with TT = boost::detail::edge_desc_impl]’ 37 | ~model() | ^ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:145:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 145 | BOOST_CONCEPT_USAGE(Assignable) { | ^~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements >]’: /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:208:5: required from ‘struct boost::Convertible’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::Convertible]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied >::value’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_)>’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/graph_concepts.hpp:93:9: [ skipping 5 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/depth_first_search.hpp:406:5: required from ‘typename boost::result_of(Param0, const ArgPack&)>::type boost::graph::depth_first_search_with_named_params(const Param0&, const ArgPack&) [with Param0 = boost::adjacency_list; ArgPack = boost::parameter::aux::arg_list > > >, boost::parameter::aux::arg_list >, boost::parameter::aux::empty_arg_list, std::integral_constant >, std::integral_constant >; typename boost::result_of(Param0, const ArgPack&)>::type = void]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/depth_first_search.hpp:409:1: required from ‘typename boost::result_of(Param0, const typename boost::detail::convert_bgl_params_to_boost_parameter >::type&)>::type boost::depth_first_search(const Param0&, const bgl_named_params&) [with Param0 = adjacency_list; P = topo_sort_visitor > >; T = graph_visitor_t; R = bgl_named_params, vertex_index_t, no_property>; typename result_of(Param0, const typename detail::convert_bgl_params_to_boost_parameter >::type&)>::type = void; typename detail::convert_bgl_params_to_boost_parameter >::type = parameter::aux::arg_list > > >, parameter::aux::arg_list >, parameter::aux::empty_arg_list, std::integral_constant >, std::integral_constant >]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/topological_sort.hpp:69:23: required from ‘void boost::topological_sort(VertexListGraph&, OutputIterator, const bgl_named_params&) [with VertexListGraph = adjacency_list; OutputIterator = std::back_insert_iterator >; P = typed_identity_property_map; T = vertex_index_t; R = no_property]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/transitive_closure.hpp:122:21: required from ‘void boost::transitive_closure(const Graph&, GraphTC&, G_to_TC_VertexMap, VertexIndexMap) [with Graph = R_adjacency_list; GraphTC = R_adjacency_list; G_to_TC_VertexMap = iterator_property_map, long unsigned int>, long unsigned int, long unsigned int&>; VertexIndexMap = vec_adj_list_vertex_id_map, long unsigned int>]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/transitive_closure.hpp:288:23: required from ‘void boost::transitive_closure(const Graph&, GraphTC&) [with Graph = R_adjacency_list; GraphTC = R_adjacency_list]’ transitive_closure.cpp:29:24: required from here /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::Convertible]’ 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ^ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::Convertible]’: /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/graph_concepts.hpp:93:9: required from ‘boost::concepts::IncidenceGraph::~IncidenceGraph() [with G = boost::adjacency_list]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/graph_concepts.hpp:75:1: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::IncidenceGraphConcept >]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/depth_first_search.hpp:129:9: required from ‘void boost::detail::depth_first_visit_impl(const IncidenceGraph&, typename boost::graph_traits::vertex_descriptor, DFSVisitor&, ColorMap, TerminatorFunc) [with IncidenceGraph = boost::adjacency_list; DFSVisitor = boost::topo_sort_visitor > >; ColorMap = boost::shared_array_property_map >; TerminatorFunc = nontruth2; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/depth_first_search.hpp:286:39: required from ‘void boost::depth_first_search(const VertexListGraph&, DFSVisitor, ColorMap, typename graph_traits::vertex_descriptor) [with VertexListGraph = adjacency_list; DFSVisitor = topo_sort_visitor > >; ColorMap = shared_array_property_map >; typename graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/depth_first_search.hpp:397:42: required from ‘void boost::graph::detail::depth_first_search_impl::operator()(const Graph&, const ArgPack&) const [with ArgPack = boost::parameter::aux::arg_list > > >, boost::parameter::aux::arg_list >, boost::parameter::aux::empty_arg_list, std::integral_constant >, std::integral_constant >; Graph = boost::adjacency_list]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/depth_first_search.hpp:406:5: required from ‘typename boost::result_of(Param0, const ArgPack&)>::type boost::graph::depth_first_search_with_named_params(const Param0&, const ArgPack&) [with Param0 = boost::adjacency_list; ArgPack = boost::parameter::aux::arg_list > > >, boost::parameter::aux::arg_list >, boost::parameter::aux::empty_arg_list, std::integral_constant >, std::integral_constant >; typename boost::result_of(Param0, const ArgPack&)>::type = void]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/depth_first_search.hpp:409:1: required from ‘typename boost::result_of(Param0, const typename boost::detail::convert_bgl_params_to_boost_parameter >::type&)>::type boost::depth_first_search(const Param0&, const bgl_named_params&) [with Param0 = adjacency_list; P = topo_sort_visitor > >; T = graph_visitor_t; R = bgl_named_params, vertex_index_t, no_property>; typename result_of(Param0, const typename detail::convert_bgl_params_to_boost_parameter >::type&)>::type = void; typename detail::convert_bgl_params_to_boost_parameter >::type = parameter::aux::arg_list > > >, parameter::aux::arg_list >, parameter::aux::empty_arg_list, std::integral_constant >, std::integral_constant >]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/topological_sort.hpp:69:23: required from ‘void boost::topological_sort(VertexListGraph&, OutputIterator, const bgl_named_params&) [with VertexListGraph = adjacency_list; OutputIterator = std::back_insert_iterator >; P = typed_identity_property_map; T = vertex_index_t; R = no_property]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/transitive_closure.hpp:122:21: required from ‘void boost::transitive_closure(const Graph&, GraphTC&, G_to_TC_VertexMap, VertexIndexMap) [with Graph = R_adjacency_list; GraphTC = R_adjacency_list; G_to_TC_VertexMap = iterator_property_map, long unsigned int>, long unsigned int, long unsigned int&>; VertexIndexMap = vec_adj_list_vertex_id_map, long unsigned int>]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/transitive_closure.hpp:288:23: required from ‘void boost::transitive_closure(const Graph&, GraphTC&) [with Graph = R_adjacency_list; GraphTC = R_adjacency_list]’ transitive_closure.cpp:29:24: required from here /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::Convertible::~Convertible() [with X = boost::adj_list_dir_traversal_tag; Y = boost::incidence_graph_tag]’ 37 | ~model() | ^ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:208:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 208 | BOOST_CONCEPT_USAGE(Convertible) { | ^~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::Convertible]’: /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements >]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:208:5: required from ‘struct boost::Convertible’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:206:3: required from ‘struct boost::ConvertibleConcept’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::ConvertibleConcept]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied >::value’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:45:51: [ skipping 15 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/strong_components.hpp:205:31: required from ‘static typename boost::property_traits::value_type boost::detail::strong_comp_dispatch1::apply(const Graph&, ComponentMap, const boost::bgl_named_params&, boost::param_not_found) [with Graph = R_adjacency_list; ComponentMap = boost::iterator_property_map, long unsigned int>, long unsigned int, long unsigned int&>; P = boost::vec_adj_list_vertex_id_map, long unsigned int>; T = boost::vertex_index_t; R = boost::no_property; typename boost::property_traits::value_type = long unsigned int]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/strong_components.hpp:220:63: required from ‘typename boost::property_traits::value_type boost::detail::scc_helper1(const Graph&, ComponentMap, const boost::bgl_named_params&, RootMap) [with Graph = R_adjacency_list; ComponentMap = boost::iterator_property_map, long unsigned int>, long unsigned int, long unsigned int&>; RootMap = boost::param_not_found; P = boost::vec_adj_list_vertex_id_map, long unsigned int>; T = boost::vertex_index_t; R = boost::no_property; typename boost::property_traits::value_type = long unsigned int]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/strong_components.hpp:235:31: required from ‘typename boost::property_traits::value_type boost::strong_components(const Graph&, ComponentMap, const bgl_named_params&, typename enable_if_c::traversal_category>::value, graph::detail::no_parameter>::type) [with Graph = R_adjacency_list; ComponentMap = iterator_property_map, long unsigned int>, long unsigned int, long unsigned int&>; P = vec_adj_list_vertex_id_map, long unsigned int>; T = vertex_index_t; R = no_property; typename property_traits::value_type = long unsigned int; typename enable_if_c::traversal_category>::value, graph::detail::no_parameter>::type = graph::detail::no_parameter; typename graph_traits::traversal_category = adj_list_dir_traversal_tag]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/transitive_closure.hpp:86:28: required from ‘void boost::transitive_closure(const Graph&, GraphTC&, G_to_TC_VertexMap, VertexIndexMap) [with Graph = R_adjacency_list; GraphTC = R_adjacency_list; G_to_TC_VertexMap = iterator_property_map, long unsigned int>, long unsigned int, long unsigned int&>; VertexIndexMap = vec_adj_list_vertex_id_map, long unsigned int>]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/transitive_closure.hpp:288:23: required from ‘void boost::transitive_closure(const Graph&, GraphTC&) [with Graph = R_adjacency_list; GraphTC = R_adjacency_list]’ transitive_closure.cpp:29:24: required from here /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::Convertible::~Convertible() [with X = boost::lvalue_property_map_tag; Y = boost::readable_property_map_tag]’ 37 | ~model() | ^ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:208:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 208 | BOOST_CONCEPT_USAGE(Convertible) { | ^~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::Convertible]’: /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements >]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:208:5: required from ‘struct boost::Convertible’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:206:3: required from ‘struct boost::ConvertibleConcept’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::ConvertibleConcept]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied >::value’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:45:51: [ skipping 15 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/strong_components.hpp:205:31: required from ‘static typename boost::property_traits::value_type boost::detail::strong_comp_dispatch1::apply(const Graph&, ComponentMap, const boost::bgl_named_params&, boost::param_not_found) [with Graph = R_adjacency_list; ComponentMap = boost::iterator_property_map, long unsigned int>, long unsigned int, long unsigned int&>; P = boost::vec_adj_list_vertex_id_map, long unsigned int>; T = boost::vertex_index_t; R = boost::no_property; typename boost::property_traits::value_type = long unsigned int]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/strong_components.hpp:220:63: required from ‘typename boost::property_traits::value_type boost::detail::scc_helper1(const Graph&, ComponentMap, const boost::bgl_named_params&, RootMap) [with Graph = R_adjacency_list; ComponentMap = boost::iterator_property_map, long unsigned int>, long unsigned int, long unsigned int&>; RootMap = boost::param_not_found; P = boost::vec_adj_list_vertex_id_map, long unsigned int>; T = boost::vertex_index_t; R = boost::no_property; typename boost::property_traits::value_type = long unsigned int]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/strong_components.hpp:235:31: required from ‘typename boost::property_traits::value_type boost::strong_components(const Graph&, ComponentMap, const bgl_named_params&, typename enable_if_c::traversal_category>::value, graph::detail::no_parameter>::type) [with Graph = R_adjacency_list; ComponentMap = iterator_property_map, long unsigned int>, long unsigned int, long unsigned int&>; P = vec_adj_list_vertex_id_map, long unsigned int>; T = vertex_index_t; R = no_property; typename property_traits::value_type = long unsigned int; typename enable_if_c::traversal_category>::value, graph::detail::no_parameter>::type = graph::detail::no_parameter; typename graph_traits::traversal_category = adj_list_dir_traversal_tag]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/transitive_closure.hpp:86:28: required from ‘void boost::transitive_closure(const Graph&, GraphTC&, G_to_TC_VertexMap, VertexIndexMap) [with Graph = R_adjacency_list; GraphTC = R_adjacency_list; G_to_TC_VertexMap = iterator_property_map, long unsigned int>, long unsigned int, long unsigned int&>; VertexIndexMap = vec_adj_list_vertex_id_map, long unsigned int>]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/transitive_closure.hpp:288:23: required from ‘void boost::transitive_closure(const Graph&, GraphTC&) [with Graph = R_adjacency_list; GraphTC = R_adjacency_list]’ transitive_closure.cpp:29:24: required from here /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::Convertible::~Convertible() [with X = boost::lvalue_property_map_tag; Y = boost::writable_property_map_tag]’ 37 | ~model() | ^ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:208:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 208 | BOOST_CONCEPT_USAGE(Convertible) { | ^~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::concepts::MultiPassInputIterator*, std::vector, std::allocator > > >, long unsigned int, boost::detail::edge_desc_impl, long int> >]’: /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements*, std::vector, std::allocator > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/graph_concepts.hpp:52:50: required from ‘struct boost::concepts::MultiPassInputIterator*, std::vector, std::allocator > > >, long unsigned int, boost::detail::edge_desc_impl, long int> >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::concepts::MultiPassInputIterator*, std::vector, std::allocator > > >, long unsigned int, boost::detail::edge_desc_impl, long int> >]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied*, std::vector, std::allocator > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::value’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied*, std::vector, std::allocator > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:72:8: [ skipping 6 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/depth_first_search.hpp:406:5: required from ‘typename boost::result_of(Param0, const ArgPack&)>::type boost::graph::depth_first_search_with_named_params(const Param0&, const ArgPack&) [with Param0 = boost::adjacency_list; ArgPack = boost::parameter::aux::arg_list > > >, boost::parameter::aux::arg_list >, boost::parameter::aux::empty_arg_list, std::integral_constant >, std::integral_constant >; typename boost::result_of(Param0, const ArgPack&)>::type = void]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/depth_first_search.hpp:409:1: required from ‘typename boost::result_of(Param0, const typename boost::detail::convert_bgl_params_to_boost_parameter >::type&)>::type boost::depth_first_search(const Param0&, const bgl_named_params&) [with Param0 = adjacency_list; P = topo_sort_visitor > >; T = graph_visitor_t; R = bgl_named_params, vertex_index_t, no_property>; typename result_of(Param0, const typename detail::convert_bgl_params_to_boost_parameter >::type&)>::type = void; typename detail::convert_bgl_params_to_boost_parameter >::type = parameter::aux::arg_list > > >, parameter::aux::arg_list >, parameter::aux::empty_arg_list, std::integral_constant >, std::integral_constant >]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/topological_sort.hpp:69:23: required from ‘void boost::topological_sort(VertexListGraph&, OutputIterator, const bgl_named_params&) [with VertexListGraph = adjacency_list; OutputIterator = std::back_insert_iterator >; P = typed_identity_property_map; T = vertex_index_t; R = no_property]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/transitive_closure.hpp:122:21: required from ‘void boost::transitive_closure(const Graph&, GraphTC&, G_to_TC_VertexMap, VertexIndexMap) [with Graph = R_adjacency_list; GraphTC = R_adjacency_list; G_to_TC_VertexMap = iterator_property_map, long unsigned int>, long unsigned int, long unsigned int&>; VertexIndexMap = vec_adj_list_vertex_id_map, long unsigned int>]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/transitive_closure.hpp:288:23: required from ‘void boost::transitive_closure(const Graph&, GraphTC&) [with Graph = R_adjacency_list; GraphTC = R_adjacency_list]’ transitive_closure.cpp:29:24: required from here /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::concepts::MultiPassInputIterator::~MultiPassInputIterator() [with T = boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator*, std::vector, std::allocator > > >, long unsigned int, boost::detail::edge_desc_impl, long int>]’ 37 | ~model() | ^ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/graph_concepts.hpp:52:50: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 52 | BOOST_concept(MultiPassInputIterator, (T)) { BOOST_CONCEPT_USAGE( | ^~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::DefaultConstructible >]’: /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements > >]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:137:5: required from ‘struct boost::DefaultConstructible >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::DefaultConstructible >]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied > >::value’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied > >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:72:8: [ skipping 6 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/depth_first_search.hpp:406:5: required from ‘typename boost::result_of(Param0, const ArgPack&)>::type boost::graph::depth_first_search_with_named_params(const Param0&, const ArgPack&) [with Param0 = boost::adjacency_list; ArgPack = boost::parameter::aux::arg_list > > >, boost::parameter::aux::arg_list >, boost::parameter::aux::empty_arg_list, std::integral_constant >, std::integral_constant >; typename boost::result_of(Param0, const ArgPack&)>::type = void]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/depth_first_search.hpp:409:1: required from ‘typename boost::result_of(Param0, const typename boost::detail::convert_bgl_params_to_boost_parameter >::type&)>::type boost::depth_first_search(const Param0&, const bgl_named_params&) [with Param0 = adjacency_list; P = topo_sort_visitor > >; T = graph_visitor_t; R = bgl_named_params, vertex_index_t, no_property>; typename result_of(Param0, const typename detail::convert_bgl_params_to_boost_parameter >::type&)>::type = void; typename detail::convert_bgl_params_to_boost_parameter >::type = parameter::aux::arg_list > > >, parameter::aux::arg_list >, parameter::aux::empty_arg_list, std::integral_constant >, std::integral_constant >]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/topological_sort.hpp:69:23: required from ‘void boost::topological_sort(VertexListGraph&, OutputIterator, const bgl_named_params&) [with VertexListGraph = adjacency_list; OutputIterator = std::back_insert_iterator >; P = typed_identity_property_map; T = vertex_index_t; R = no_property]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/transitive_closure.hpp:122:21: required from ‘void boost::transitive_closure(const Graph&, GraphTC&, G_to_TC_VertexMap, VertexIndexMap) [with Graph = R_adjacency_list; GraphTC = R_adjacency_list; G_to_TC_VertexMap = iterator_property_map, long unsigned int>, long unsigned int, long unsigned int&>; VertexIndexMap = vec_adj_list_vertex_id_map, long unsigned int>]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/transitive_closure.hpp:288:23: required from ‘void boost::transitive_closure(const Graph&, GraphTC&) [with Graph = R_adjacency_list; GraphTC = R_adjacency_list]’ transitive_closure.cpp:29:24: required from here /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::DefaultConstructible::~DefaultConstructible() [with TT = boost::detail::edge_desc_impl]’ 37 | ~model() | ^ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:137:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 137 | BOOST_CONCEPT_USAGE(DefaultConstructible) { | ^~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::EqualityComparable >]’: /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements > >]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:233:5: required from ‘struct boost::EqualityComparable >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::EqualityComparable >]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied > >::value’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied > >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:72:8: [ skipping 6 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/depth_first_search.hpp:406:5: required from ‘typename boost::result_of(Param0, const ArgPack&)>::type boost::graph::depth_first_search_with_named_params(const Param0&, const ArgPack&) [with Param0 = boost::adjacency_list; ArgPack = boost::parameter::aux::arg_list > > >, boost::parameter::aux::arg_list >, boost::parameter::aux::empty_arg_list, std::integral_constant >, std::integral_constant >; typename boost::result_of(Param0, const ArgPack&)>::type = void]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/depth_first_search.hpp:409:1: required from ‘typename boost::result_of(Param0, const typename boost::detail::convert_bgl_params_to_boost_parameter >::type&)>::type boost::depth_first_search(const Param0&, const bgl_named_params&) [with Param0 = adjacency_list; P = topo_sort_visitor > >; T = graph_visitor_t; R = bgl_named_params, vertex_index_t, no_property>; typename result_of(Param0, const typename detail::convert_bgl_params_to_boost_parameter >::type&)>::type = void; typename detail::convert_bgl_params_to_boost_parameter >::type = parameter::aux::arg_list > > >, parameter::aux::arg_list >, parameter::aux::empty_arg_list, std::integral_constant >, std::integral_constant >]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/topological_sort.hpp:69:23: required from ‘void boost::topological_sort(VertexListGraph&, OutputIterator, const bgl_named_params&) [with VertexListGraph = adjacency_list; OutputIterator = std::back_insert_iterator >; P = typed_identity_property_map; T = vertex_index_t; R = no_property]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/transitive_closure.hpp:122:21: required from ‘void boost::transitive_closure(const Graph&, GraphTC&, G_to_TC_VertexMap, VertexIndexMap) [with Graph = R_adjacency_list; GraphTC = R_adjacency_list; G_to_TC_VertexMap = iterator_property_map, long unsigned int>, long unsigned int, long unsigned int&>; VertexIndexMap = vec_adj_list_vertex_id_map, long unsigned int>]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/transitive_closure.hpp:288:23: required from ‘void boost::transitive_closure(const Graph&, GraphTC&) [with Graph = R_adjacency_list; GraphTC = R_adjacency_list]’ transitive_closure.cpp:29:24: required from here /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::EqualityComparable::~EqualityComparable() [with TT = boost::detail::edge_desc_impl]’ 37 | ~model() | ^ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:233:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 233 | BOOST_CONCEPT_USAGE(EqualityComparable) { | ^~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::Assignable >]’: /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements > >]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:145:5: required from ‘struct boost::Assignable >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::Assignable >]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied > >::value’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied > >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:72:8: [ skipping 6 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/depth_first_search.hpp:406:5: required from ‘typename boost::result_of(Param0, const ArgPack&)>::type boost::graph::depth_first_search_with_named_params(const Param0&, const ArgPack&) [with Param0 = boost::adjacency_list; ArgPack = boost::parameter::aux::arg_list > > >, boost::parameter::aux::arg_list >, boost::parameter::aux::empty_arg_list, std::integral_constant >, std::integral_constant >; typename boost::result_of(Param0, const ArgPack&)>::type = void]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/depth_first_search.hpp:409:1: required from ‘typename boost::result_of(Param0, const typename boost::detail::convert_bgl_params_to_boost_parameter >::type&)>::type boost::depth_first_search(const Param0&, const bgl_named_params&) [with Param0 = adjacency_list; P = topo_sort_visitor > >; T = graph_visitor_t; R = bgl_named_params, vertex_index_t, no_property>; typename result_of(Param0, const typename detail::convert_bgl_params_to_boost_parameter >::type&)>::type = void; typename detail::convert_bgl_params_to_boost_parameter >::type = parameter::aux::arg_list > > >, parameter::aux::arg_list >, parameter::aux::empty_arg_list, std::integral_constant >, std::integral_constant >]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/topological_sort.hpp:69:23: required from ‘void boost::topological_sort(VertexListGraph&, OutputIterator, const bgl_named_params&) [with VertexListGraph = adjacency_list; OutputIterator = std::back_insert_iterator >; P = typed_identity_property_map; T = vertex_index_t; R = no_property]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/transitive_closure.hpp:122:21: required from ‘void boost::transitive_closure(const Graph&, GraphTC&, G_to_TC_VertexMap, VertexIndexMap) [with Graph = R_adjacency_list; GraphTC = R_adjacency_list; G_to_TC_VertexMap = iterator_property_map, long unsigned int>, long unsigned int, long unsigned int&>; VertexIndexMap = vec_adj_list_vertex_id_map, long unsigned int>]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/transitive_closure.hpp:288:23: required from ‘void boost::transitive_closure(const Graph&, GraphTC&) [with Graph = R_adjacency_list; GraphTC = R_adjacency_list]’ transitive_closure.cpp:29:24: required from here /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::Assignable::~Assignable() [with TT = boost::detail::edge_desc_impl]’ 37 | ~model() | ^ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:145:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 145 | BOOST_CONCEPT_USAGE(Assignable) { | ^~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::Convertible]’: /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements >]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:208:5: required from ‘struct boost::Convertible’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::Convertible]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied >::value’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:72:8: [ skipping 6 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/depth_first_search.hpp:406:5: required from ‘typename boost::result_of(Param0, const ArgPack&)>::type boost::graph::depth_first_search_with_named_params(const Param0&, const ArgPack&) [with Param0 = boost::adjacency_list; ArgPack = boost::parameter::aux::arg_list > > >, boost::parameter::aux::arg_list >, boost::parameter::aux::empty_arg_list, std::integral_constant >, std::integral_constant >; typename boost::result_of(Param0, const ArgPack&)>::type = void]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/depth_first_search.hpp:409:1: required from ‘typename boost::result_of(Param0, const typename boost::detail::convert_bgl_params_to_boost_parameter >::type&)>::type boost::depth_first_search(const Param0&, const bgl_named_params&) [with Param0 = adjacency_list; P = topo_sort_visitor > >; T = graph_visitor_t; R = bgl_named_params, vertex_index_t, no_property>; typename result_of(Param0, const typename detail::convert_bgl_params_to_boost_parameter >::type&)>::type = void; typename detail::convert_bgl_params_to_boost_parameter >::type = parameter::aux::arg_list > > >, parameter::aux::arg_list >, parameter::aux::empty_arg_list, std::integral_constant >, std::integral_constant >]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/topological_sort.hpp:69:23: required from ‘void boost::topological_sort(VertexListGraph&, OutputIterator, const bgl_named_params&) [with VertexListGraph = adjacency_list; OutputIterator = std::back_insert_iterator >; P = typed_identity_property_map; T = vertex_index_t; R = no_property]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/transitive_closure.hpp:122:21: required from ‘void boost::transitive_closure(const Graph&, GraphTC&, G_to_TC_VertexMap, VertexIndexMap) [with Graph = R_adjacency_list; GraphTC = R_adjacency_list; G_to_TC_VertexMap = iterator_property_map, long unsigned int>, long unsigned int, long unsigned int&>; VertexIndexMap = vec_adj_list_vertex_id_map, long unsigned int>]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/transitive_closure.hpp:288:23: required from ‘void boost::transitive_closure(const Graph&, GraphTC&) [with Graph = R_adjacency_list; GraphTC = R_adjacency_list]’ transitive_closure.cpp:29:24: required from here /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::Convertible::~Convertible() [with X = boost::adj_list_dir_traversal_tag; Y = boost::incidence_graph_tag]’ 37 | ~model() | ^ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:208:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 208 | BOOST_CONCEPT_USAGE(Convertible) { | ^~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::constraint::failed() [with Model = boost::DFSVisitorConcept, long unsigned int>, long unsigned int, long unsigned int&>, boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>, boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>, std::stack > > >, R_adjacency_list >]’: /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/depth_first_search.hpp:130:9: required from ‘void boost::depth_first_search(const VertexListGraph&, DFSVisitor, ColorMap, typename graph_traits::vertex_descriptor) [with VertexListGraph = R_adjacency_list; DFSVisitor = detail::tarjan_scc_visitor, long unsigned int>, long unsigned int, long unsigned int&>, iterator_property_map<__gnu_cxx::__normal_iterator >, vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>, iterator_property_map<__gnu_cxx::__normal_iterator >, vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>, std::stack > > >; ColorMap = shared_array_property_map, long unsigned int> >; typename graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/depth_first_search.hpp:397:42: required from ‘void boost::graph::detail::depth_first_search_impl::operator()(const Graph&, const ArgPack&) const [with ArgPack = boost::parameter::aux::arg_list, long unsigned int>, long unsigned int, long unsigned int&>, boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>, boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>, std::stack > > > >, boost::parameter::aux::arg_list, long unsigned int> >, boost::parameter::aux::empty_arg_list, std::integral_constant >, std::integral_constant >; Graph = R_adjacency_list]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/depth_first_search.hpp:406:5: required from ‘typename boost::result_of(Param0, const ArgPack&)>::type boost::graph::depth_first_search_with_named_params(const Param0&, const ArgPack&) [with Param0 = R_adjacency_list; ArgPack = boost::parameter::aux::arg_list, long unsigned int>, long unsigned int, long unsigned int&>, boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>, boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>, std::stack > > > >, boost::parameter::aux::arg_list, long unsigned int> >, boost::parameter::aux::empty_arg_list, std::integral_constant >, std::integral_constant >; typename boost::result_of(Param0, const ArgPack&)>::type = void]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/depth_first_search.hpp:409:1: required from ‘typename boost::result_of(Param0, const typename boost::detail::convert_bgl_params_to_boost_parameter >::type&)>::type boost::depth_first_search(const Param0&, const bgl_named_params&) [with Param0 = R_adjacency_list; P = detail::tarjan_scc_visitor, long unsigned int>, long unsigned int, long unsigned int&>, iterator_property_map<__gnu_cxx::__normal_iterator >, vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>, iterator_property_map<__gnu_cxx::__normal_iterator >, vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>, std::stack > > >; T = graph_visitor_t; R = bgl_named_params, long unsigned int>, vertex_index_t, no_property>; typename result_of(Param0, const typename detail::convert_bgl_params_to_boost_parameter >::type&)>::type = void; typename detail::convert_bgl_params_to_boost_parameter >::type = parameter::aux::arg_list, long unsigned int>, long unsigned int, long unsigned int&>, iterator_property_map<__gnu_cxx::__normal_iterator >, vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>, iterator_property_map<__gnu_cxx::__normal_iterator >, vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>, std::stack > > > >, parameter::aux::arg_list, long unsigned int> >, parameter::aux::empty_arg_list, std::integral_constant >, std::integral_constant >]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/strong_components.hpp:129:27: required from ‘typename boost::property_traits::value_type boost::detail::strong_components_impl(const Graph&, ComponentMap, RootMap, DiscoverTime, const boost::bgl_named_params&) [with Graph = R_adjacency_list; ComponentMap = boost::iterator_property_map, long unsigned int>, long unsigned int, long unsigned int&>; RootMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>; DiscoverTime = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>; P = boost::vec_adj_list_vertex_id_map, long unsigned int>; T = boost::vertex_index_t; R = boost::no_property; typename boost::property_traits::value_type = long unsigned int]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/strong_components.hpp:162:42: [ skipping 2 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/strong_components.hpp:205:31: required from ‘static typename boost::property_traits::value_type boost::detail::strong_comp_dispatch1::apply(const Graph&, ComponentMap, const boost::bgl_named_params&, boost::param_not_found) [with Graph = R_adjacency_list; ComponentMap = boost::iterator_property_map, long unsigned int>, long unsigned int, long unsigned int&>; P = boost::vec_adj_list_vertex_id_map, long unsigned int>; T = boost::vertex_index_t; R = boost::no_property; typename boost::property_traits::value_type = long unsigned int]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/strong_components.hpp:220:63: required from ‘typename boost::property_traits::value_type boost::detail::scc_helper1(const Graph&, ComponentMap, const boost::bgl_named_params&, RootMap) [with Graph = R_adjacency_list; ComponentMap = boost::iterator_property_map, long unsigned int>, long unsigned int, long unsigned int&>; RootMap = boost::param_not_found; P = boost::vec_adj_list_vertex_id_map, long unsigned int>; T = boost::vertex_index_t; R = boost::no_property; typename boost::property_traits::value_type = long unsigned int]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/strong_components.hpp:235:31: required from ‘typename boost::property_traits::value_type boost::strong_components(const Graph&, ComponentMap, const bgl_named_params&, typename enable_if_c::traversal_category>::value, graph::detail::no_parameter>::type) [with Graph = R_adjacency_list; ComponentMap = iterator_property_map, long unsigned int>, long unsigned int, long unsigned int&>; P = vec_adj_list_vertex_id_map, long unsigned int>; T = vertex_index_t; R = no_property; typename property_traits::value_type = long unsigned int; typename enable_if_c::traversal_category>::value, graph::detail::no_parameter>::type = graph::detail::no_parameter; typename graph_traits::traversal_category = adj_list_dir_traversal_tag]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/transitive_closure.hpp:86:28: required from ‘void boost::transitive_closure(const Graph&, GraphTC&, G_to_TC_VertexMap, VertexIndexMap) [with Graph = R_adjacency_list; GraphTC = R_adjacency_list; G_to_TC_VertexMap = iterator_property_map, long unsigned int>, long unsigned int, long unsigned int&>; VertexIndexMap = vec_adj_list_vertex_id_map, long unsigned int>]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/transitive_closure.hpp:288:23: required from ‘void boost::transitive_closure(const Graph&, GraphTC&) [with Graph = R_adjacency_list; GraphTC = R_adjacency_list]’ transitive_closure.cpp:29:24: required from here /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:65:52: warning: ‘this’ pointer is null [-Wnonnull] 65 | static void failed() { ((Model*)0)->constraints(); } | ~~~~~~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/depth_first_search.hpp:39:10: note: in a call to non-static member function ‘void boost::DFSVisitorConcept::constraints() [with Visitor = boost::detail::tarjan_scc_visitor, long unsigned int>, long unsigned int, long unsigned int&>, boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>, boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>, std::stack > > >; Graph = R_adjacency_list]’ 39 | void constraints() | ^~~~~~~~~~~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements*, std::vector, std::allocator > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >]’: /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:145:5: required from ‘struct boost::Assignable*, std::vector, std::allocator > > >, long unsigned int, boost::detail::edge_desc_impl, long int> >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:502:3: required from ‘struct boost::InputIterator*, std::vector, std::allocator > > >, long unsigned int, boost::detail::edge_desc_impl, long int> >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::InputIterator*, std::vector, std::allocator > > >, long unsigned int, boost::detail::edge_desc_impl, long int> >]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied*, std::vector, std::allocator > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::value’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied*, std::vector, std::allocator > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:72:8: [ skipping 8 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/depth_first_search.hpp:406:5: required from ‘typename boost::result_of(Param0, const ArgPack&)>::type boost::graph::depth_first_search_with_named_params(const Param0&, const ArgPack&) [with Param0 = boost::adjacency_list; ArgPack = boost::parameter::aux::arg_list > > >, boost::parameter::aux::arg_list >, boost::parameter::aux::empty_arg_list, std::integral_constant >, std::integral_constant >; typename boost::result_of(Param0, const ArgPack&)>::type = void]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/depth_first_search.hpp:409:1: required from ‘typename boost::result_of(Param0, const typename boost::detail::convert_bgl_params_to_boost_parameter >::type&)>::type boost::depth_first_search(const Param0&, const bgl_named_params&) [with Param0 = adjacency_list; P = topo_sort_visitor > >; T = graph_visitor_t; R = bgl_named_params, vertex_index_t, no_property>; typename result_of(Param0, const typename detail::convert_bgl_params_to_boost_parameter >::type&)>::type = void; typename detail::convert_bgl_params_to_boost_parameter >::type = parameter::aux::arg_list > > >, parameter::aux::arg_list >, parameter::aux::empty_arg_list, std::integral_constant >, std::integral_constant >]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/topological_sort.hpp:69:23: required from ‘void boost::topological_sort(VertexListGraph&, OutputIterator, const bgl_named_params&) [with VertexListGraph = adjacency_list; OutputIterator = std::back_insert_iterator >; P = typed_identity_property_map; T = vertex_index_t; R = no_property]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/transitive_closure.hpp:122:21: required from ‘void boost::transitive_closure(const Graph&, GraphTC&, G_to_TC_VertexMap, VertexIndexMap) [with Graph = R_adjacency_list; GraphTC = R_adjacency_list; G_to_TC_VertexMap = iterator_property_map, long unsigned int>, long unsigned int, long unsigned int&>; VertexIndexMap = vec_adj_list_vertex_id_map, long unsigned int>]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/transitive_closure.hpp:288:23: required from ‘void boost::transitive_closure(const Graph&, GraphTC&) [with Graph = R_adjacency_list; GraphTC = R_adjacency_list]’ transitive_closure.cpp:29:24: required from here /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::Assignable*, std::vector, std::allocator > > >, long unsigned int, boost::detail::edge_desc_impl, long int> >]’ 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ^ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements*, std::vector, std::allocator > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >]’: /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:233:5: required from ‘struct boost::EqualityComparable*, std::vector, std::allocator > > >, long unsigned int, boost::detail::edge_desc_impl, long int> >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:502:3: required from ‘struct boost::InputIterator*, std::vector, std::allocator > > >, long unsigned int, boost::detail::edge_desc_impl, long int> >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::InputIterator*, std::vector, std::allocator > > >, long unsigned int, boost::detail::edge_desc_impl, long int> >]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied*, std::vector, std::allocator > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::value’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied*, std::vector, std::allocator > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:72:8: [ skipping 8 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/depth_first_search.hpp:406:5: required from ‘typename boost::result_of(Param0, const ArgPack&)>::type boost::graph::depth_first_search_with_named_params(const Param0&, const ArgPack&) [with Param0 = boost::adjacency_list; ArgPack = boost::parameter::aux::arg_list > > >, boost::parameter::aux::arg_list >, boost::parameter::aux::empty_arg_list, std::integral_constant >, std::integral_constant >; typename boost::result_of(Param0, const ArgPack&)>::type = void]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/depth_first_search.hpp:409:1: required from ‘typename boost::result_of(Param0, const typename boost::detail::convert_bgl_params_to_boost_parameter >::type&)>::type boost::depth_first_search(const Param0&, const bgl_named_params&) [with Param0 = adjacency_list; P = topo_sort_visitor > >; T = graph_visitor_t; R = bgl_named_params, vertex_index_t, no_property>; typename result_of(Param0, const typename detail::convert_bgl_params_to_boost_parameter >::type&)>::type = void; typename detail::convert_bgl_params_to_boost_parameter >::type = parameter::aux::arg_list > > >, parameter::aux::arg_list >, parameter::aux::empty_arg_list, std::integral_constant >, std::integral_constant >]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/topological_sort.hpp:69:23: required from ‘void boost::topological_sort(VertexListGraph&, OutputIterator, const bgl_named_params&) [with VertexListGraph = adjacency_list; OutputIterator = std::back_insert_iterator >; P = typed_identity_property_map; T = vertex_index_t; R = no_property]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/transitive_closure.hpp:122:21: required from ‘void boost::transitive_closure(const Graph&, GraphTC&, G_to_TC_VertexMap, VertexIndexMap) [with Graph = R_adjacency_list; GraphTC = R_adjacency_list; G_to_TC_VertexMap = iterator_property_map, long unsigned int>, long unsigned int, long unsigned int&>; VertexIndexMap = vec_adj_list_vertex_id_map, long unsigned int>]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/transitive_closure.hpp:288:23: required from ‘void boost::transitive_closure(const Graph&, GraphTC&) [with Graph = R_adjacency_list; GraphTC = R_adjacency_list]’ transitive_closure.cpp:29:24: required from here /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::EqualityComparable*, std::vector, std::allocator > > >, long unsigned int, boost::detail::edge_desc_impl, long int> >]’ 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ^ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements*, std::vector, std::allocator > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >]’: /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:512:7: required from ‘struct boost::InputIterator*, std::vector, std::allocator > > >, long unsigned int, boost::detail::edge_desc_impl, long int> >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::InputIterator*, std::vector, std::allocator > > >, long unsigned int, boost::detail::edge_desc_impl, long int> >]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied*, std::vector, std::allocator > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::value’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied*, std::vector, std::allocator > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_*, std::vector, std::allocator > > >, long unsigned int, boost::detail::edge_desc_impl, long int> >)>’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/graph_concepts.hpp:53:35: [ skipping 7 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/depth_first_search.hpp:406:5: required from ‘typename boost::result_of(Param0, const ArgPack&)>::type boost::graph::depth_first_search_with_named_params(const Param0&, const ArgPack&) [with Param0 = boost::adjacency_list; ArgPack = boost::parameter::aux::arg_list > > >, boost::parameter::aux::arg_list >, boost::parameter::aux::empty_arg_list, std::integral_constant >, std::integral_constant >; typename boost::result_of(Param0, const ArgPack&)>::type = void]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/depth_first_search.hpp:409:1: required from ‘typename boost::result_of(Param0, const typename boost::detail::convert_bgl_params_to_boost_parameter >::type&)>::type boost::depth_first_search(const Param0&, const bgl_named_params&) [with Param0 = adjacency_list; P = topo_sort_visitor > >; T = graph_visitor_t; R = bgl_named_params, vertex_index_t, no_property>; typename result_of(Param0, const typename detail::convert_bgl_params_to_boost_parameter >::type&)>::type = void; typename detail::convert_bgl_params_to_boost_parameter >::type = parameter::aux::arg_list > > >, parameter::aux::arg_list >, parameter::aux::empty_arg_list, std::integral_constant >, std::integral_constant >]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/topological_sort.hpp:69:23: required from ‘void boost::topological_sort(VertexListGraph&, OutputIterator, const bgl_named_params&) [with VertexListGraph = adjacency_list; OutputIterator = std::back_insert_iterator >; P = typed_identity_property_map; T = vertex_index_t; R = no_property]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/transitive_closure.hpp:122:21: required from ‘void boost::transitive_closure(const Graph&, GraphTC&, G_to_TC_VertexMap, VertexIndexMap) [with Graph = R_adjacency_list; GraphTC = R_adjacency_list; G_to_TC_VertexMap = iterator_property_map, long unsigned int>, long unsigned int, long unsigned int&>; VertexIndexMap = vec_adj_list_vertex_id_map, long unsigned int>]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/transitive_closure.hpp:288:23: required from ‘void boost::transitive_closure(const Graph&, GraphTC&) [with Graph = R_adjacency_list; GraphTC = R_adjacency_list]’ transitive_closure.cpp:29:24: required from here /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::InputIterator*, std::vector, std::allocator > > >, long unsigned int, boost::detail::edge_desc_impl, long int> >]’ 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ^ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::InputIterator*, std::vector, std::allocator > > >, long unsigned int, boost::detail::edge_desc_impl, long int> >]’: /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/graph_concepts.hpp:53:35: required from ‘boost::concepts::MultiPassInputIterator::~MultiPassInputIterator() [with T = boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator*, std::vector, std::allocator > > >, long unsigned int, boost::detail::edge_desc_impl, long int>]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::MultiPassInputIterator*, std::vector, std::allocator > > >, long unsigned int, boost::detail::edge_desc_impl, long int> >]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/graph_concepts.hpp:89:9: required from ‘boost::concepts::IncidenceGraph::~IncidenceGraph() [with G = boost::adjacency_list]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/graph_concepts.hpp:75:1: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::IncidenceGraphConcept >]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/depth_first_search.hpp:129:9: required from ‘void boost::detail::depth_first_visit_impl(const IncidenceGraph&, typename boost::graph_traits::vertex_descriptor, DFSVisitor&, ColorMap, TerminatorFunc) [with IncidenceGraph = boost::adjacency_list; DFSVisitor = boost::topo_sort_visitor > >; ColorMap = boost::shared_array_property_map >; TerminatorFunc = nontruth2; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/depth_first_search.hpp:286:39: [ skipping 2 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/depth_first_search.hpp:406:5: required from ‘typename boost::result_of(Param0, const ArgPack&)>::type boost::graph::depth_first_search_with_named_params(const Param0&, const ArgPack&) [with Param0 = boost::adjacency_list; ArgPack = boost::parameter::aux::arg_list > > >, boost::parameter::aux::arg_list >, boost::parameter::aux::empty_arg_list, std::integral_constant >, std::integral_constant >; typename boost::result_of(Param0, const ArgPack&)>::type = void]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/depth_first_search.hpp:409:1: required from ‘typename boost::result_of(Param0, const typename boost::detail::convert_bgl_params_to_boost_parameter >::type&)>::type boost::depth_first_search(const Param0&, const bgl_named_params&) [with Param0 = adjacency_list; P = topo_sort_visitor > >; T = graph_visitor_t; R = bgl_named_params, vertex_index_t, no_property>; typename result_of(Param0, const typename detail::convert_bgl_params_to_boost_parameter >::type&)>::type = void; typename detail::convert_bgl_params_to_boost_parameter >::type = parameter::aux::arg_list > > >, parameter::aux::arg_list >, parameter::aux::empty_arg_list, std::integral_constant >, std::integral_constant >]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/topological_sort.hpp:69:23: required from ‘void boost::topological_sort(VertexListGraph&, OutputIterator, const bgl_named_params&) [with VertexListGraph = adjacency_list; OutputIterator = std::back_insert_iterator >; P = typed_identity_property_map; T = vertex_index_t; R = no_property]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/transitive_closure.hpp:122:21: required from ‘void boost::transitive_closure(const Graph&, GraphTC&, G_to_TC_VertexMap, VertexIndexMap) [with Graph = R_adjacency_list; GraphTC = R_adjacency_list; G_to_TC_VertexMap = iterator_property_map, long unsigned int>, long unsigned int, long unsigned int&>; VertexIndexMap = vec_adj_list_vertex_id_map, long unsigned int>]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/transitive_closure.hpp:288:23: required from ‘void boost::transitive_closure(const Graph&, GraphTC&) [with Graph = R_adjacency_list; GraphTC = R_adjacency_list]’ transitive_closure.cpp:29:24: required from here /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::InputIterator::~InputIterator() [with TT = boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator*, std::vector, std::allocator > > >, long unsigned int, boost::detail::edge_desc_impl, long int>]’ 37 | ~model() | ^ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:512:7: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 512 | BOOST_CONCEPT_USAGE(InputIterator) | ^~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements, long unsigned int>, long unsigned int, long unsigned int&>, boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>, boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>, std::stack > > > > >]’: /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:167:5: required from ‘struct boost::CopyConstructible, long unsigned int>, long unsigned int, long unsigned int&>, boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>, boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>, std::stack > > > >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:165:3: required from ‘struct boost::CopyConstructibleConcept, long unsigned int>, long unsigned int, long unsigned int&>, boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>, boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>, std::stack > > > >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::CopyConstructibleConcept, long unsigned int>, long unsigned int, long unsigned int&>, boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>, boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>, std::stack > > > >]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied, long unsigned int>, long unsigned int, long unsigned int&>, boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>, boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>, std::stack > > > > >::value’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied, long unsigned int>, long unsigned int, long unsigned int&>, boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>, boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>, std::stack > > > > >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:72:8: [ skipping 13 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/strong_components.hpp:205:31: required from ‘static typename boost::property_traits::value_type boost::detail::strong_comp_dispatch1::apply(const Graph&, ComponentMap, const boost::bgl_named_params&, boost::param_not_found) [with Graph = R_adjacency_list; ComponentMap = boost::iterator_property_map, long unsigned int>, long unsigned int, long unsigned int&>; P = boost::vec_adj_list_vertex_id_map, long unsigned int>; T = boost::vertex_index_t; R = boost::no_property; typename boost::property_traits::value_type = long unsigned int]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/strong_components.hpp:220:63: required from ‘typename boost::property_traits::value_type boost::detail::scc_helper1(const Graph&, ComponentMap, const boost::bgl_named_params&, RootMap) [with Graph = R_adjacency_list; ComponentMap = boost::iterator_property_map, long unsigned int>, long unsigned int, long unsigned int&>; RootMap = boost::param_not_found; P = boost::vec_adj_list_vertex_id_map, long unsigned int>; T = boost::vertex_index_t; R = boost::no_property; typename boost::property_traits::value_type = long unsigned int]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/strong_components.hpp:235:31: required from ‘typename boost::property_traits::value_type boost::strong_components(const Graph&, ComponentMap, const bgl_named_params&, typename enable_if_c::traversal_category>::value, graph::detail::no_parameter>::type) [with Graph = R_adjacency_list; ComponentMap = iterator_property_map, long unsigned int>, long unsigned int, long unsigned int&>; P = vec_adj_list_vertex_id_map, long unsigned int>; T = vertex_index_t; R = no_property; typename property_traits::value_type = long unsigned int; typename enable_if_c::traversal_category>::value, graph::detail::no_parameter>::type = graph::detail::no_parameter; typename graph_traits::traversal_category = adj_list_dir_traversal_tag]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/transitive_closure.hpp:86:28: required from ‘void boost::transitive_closure(const Graph&, GraphTC&, G_to_TC_VertexMap, VertexIndexMap) [with Graph = R_adjacency_list; GraphTC = R_adjacency_list; G_to_TC_VertexMap = iterator_property_map, long unsigned int>, long unsigned int, long unsigned int&>; VertexIndexMap = vec_adj_list_vertex_id_map, long unsigned int>]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/transitive_closure.hpp:288:23: required from ‘void boost::transitive_closure(const Graph&, GraphTC&) [with Graph = R_adjacency_list; GraphTC = R_adjacency_list]’ transitive_closure.cpp:29:24: required from here /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::CopyConstructible, long unsigned int>, long unsigned int, long unsigned int&>, boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>, boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>, std::stack > > > >]’ 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ^ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::CopyConstructibleConcept, long unsigned int>, long unsigned int, long unsigned int&>, boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>, boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>, std::stack > > > >]’: /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/depth_first_search.hpp:41:9: required from ‘void boost::DFSVisitorConcept::constraints() [with Visitor = boost::detail::tarjan_scc_visitor, long unsigned int>, long unsigned int, long unsigned int&>, boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>, boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>, std::stack > > >; Graph = R_adjacency_list]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::DFSVisitorConcept, long unsigned int>, long unsigned int, long unsigned int&>, boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>, boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>, std::stack > > >, R_adjacency_list >]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied, long unsigned int>, long unsigned int, long unsigned int&>, boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>, boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>, std::stack > > >, R_adjacency_list > >::value’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied, long unsigned int>, long unsigned int, long unsigned int&>, boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>, boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>, std::stack > > >, R_adjacency_list > >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_, long unsigned int>, long unsigned int, long unsigned int&>, boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>, boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>, std::stack > > >, R_adjacency_list >)>’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/depth_first_search.hpp:130:9: [ skipping 7 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/strong_components.hpp:205:31: required from ‘static typename boost::property_traits::value_type boost::detail::strong_comp_dispatch1::apply(const Graph&, ComponentMap, const boost::bgl_named_params&, boost::param_not_found) [with Graph = R_adjacency_list; ComponentMap = boost::iterator_property_map, long unsigned int>, long unsigned int, long unsigned int&>; P = boost::vec_adj_list_vertex_id_map, long unsigned int>; T = boost::vertex_index_t; R = boost::no_property; typename boost::property_traits::value_type = long unsigned int]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/strong_components.hpp:220:63: required from ‘typename boost::property_traits::value_type boost::detail::scc_helper1(const Graph&, ComponentMap, const boost::bgl_named_params&, RootMap) [with Graph = R_adjacency_list; ComponentMap = boost::iterator_property_map, long unsigned int>, long unsigned int, long unsigned int&>; RootMap = boost::param_not_found; P = boost::vec_adj_list_vertex_id_map, long unsigned int>; T = boost::vertex_index_t; R = boost::no_property; typename boost::property_traits::value_type = long unsigned int]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/strong_components.hpp:235:31: required from ‘typename boost::property_traits::value_type boost::strong_components(const Graph&, ComponentMap, const bgl_named_params&, typename enable_if_c::traversal_category>::value, graph::detail::no_parameter>::type) [with Graph = R_adjacency_list; ComponentMap = iterator_property_map, long unsigned int>, long unsigned int, long unsigned int&>; P = vec_adj_list_vertex_id_map, long unsigned int>; T = vertex_index_t; R = no_property; typename property_traits::value_type = long unsigned int; typename enable_if_c::traversal_category>::value, graph::detail::no_parameter>::type = graph::detail::no_parameter; typename graph_traits::traversal_category = adj_list_dir_traversal_tag]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/transitive_closure.hpp:86:28: required from ‘void boost::transitive_closure(const Graph&, GraphTC&, G_to_TC_VertexMap, VertexIndexMap) [with Graph = R_adjacency_list; GraphTC = R_adjacency_list; G_to_TC_VertexMap = iterator_property_map, long unsigned int>, long unsigned int, long unsigned int&>; VertexIndexMap = vec_adj_list_vertex_id_map, long unsigned int>]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/transitive_closure.hpp:288:23: required from ‘void boost::transitive_closure(const Graph&, GraphTC&) [with Graph = R_adjacency_list; GraphTC = R_adjacency_list]’ transitive_closure.cpp:29:24: required from here /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:165:17: note: in a call to non-static member function ‘boost::CopyConstructibleConcept, long unsigned int>, long unsigned int, long unsigned int&>, boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>, boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>, std::stack > > > >::~CopyConstructibleConcept()’ 165 | BOOST_concept(CopyConstructible,(TT)) | ^~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/preprocessor/cat.hpp:29:34: note: in definition of macro ‘BOOST_PP_CAT_I’ 29 | # define BOOST_PP_CAT_I(a, b) a ## b | ^ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/concept_def.hpp:23:12: note: in expansion of macro ‘BOOST_PP_CAT’ 23 | struct BOOST_PP_CAT(name,Concept) \ | ^~~~~~~~~~~~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:165:3: note: in expansion of macro ‘BOOST_concept’ 165 | BOOST_concept(CopyConstructible,(TT)) | ^~~~~~~~~~~~~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements > >]’: /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/graph_concepts.hpp:87:5: required from ‘struct boost::concepts::IncidenceGraph >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/graph_concepts.hpp:75:1: required from ‘struct boost::concepts::IncidenceGraphConcept >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::concepts::IncidenceGraphConcept >]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied > >::value’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied > >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:72:8: [ skipping 9 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/strong_components.hpp:205:31: required from ‘static typename boost::property_traits::value_type boost::detail::strong_comp_dispatch1::apply(const Graph&, ComponentMap, const boost::bgl_named_params&, boost::param_not_found) [with Graph = R_adjacency_list; ComponentMap = boost::iterator_property_map, long unsigned int>, long unsigned int, long unsigned int&>; P = boost::vec_adj_list_vertex_id_map, long unsigned int>; T = boost::vertex_index_t; R = boost::no_property; typename boost::property_traits::value_type = long unsigned int]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/strong_components.hpp:220:63: required from ‘typename boost::property_traits::value_type boost::detail::scc_helper1(const Graph&, ComponentMap, const boost::bgl_named_params&, RootMap) [with Graph = R_adjacency_list; ComponentMap = boost::iterator_property_map, long unsigned int>, long unsigned int, long unsigned int&>; RootMap = boost::param_not_found; P = boost::vec_adj_list_vertex_id_map, long unsigned int>; T = boost::vertex_index_t; R = boost::no_property; typename boost::property_traits::value_type = long unsigned int]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/strong_components.hpp:235:31: required from ‘typename boost::property_traits::value_type boost::strong_components(const Graph&, ComponentMap, const bgl_named_params&, typename enable_if_c::traversal_category>::value, graph::detail::no_parameter>::type) [with Graph = R_adjacency_list; ComponentMap = iterator_property_map, long unsigned int>, long unsigned int, long unsigned int&>; P = vec_adj_list_vertex_id_map, long unsigned int>; T = vertex_index_t; R = no_property; typename property_traits::value_type = long unsigned int; typename enable_if_c::traversal_category>::value, graph::detail::no_parameter>::type = graph::detail::no_parameter; typename graph_traits::traversal_category = adj_list_dir_traversal_tag]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/transitive_closure.hpp:86:28: required from ‘void boost::transitive_closure(const Graph&, GraphTC&, G_to_TC_VertexMap, VertexIndexMap) [with Graph = R_adjacency_list; GraphTC = R_adjacency_list; G_to_TC_VertexMap = iterator_property_map, long unsigned int>, long unsigned int, long unsigned int&>; VertexIndexMap = vec_adj_list_vertex_id_map, long unsigned int>]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/transitive_closure.hpp:288:23: required from ‘void boost::transitive_closure(const Graph&, GraphTC&) [with Graph = R_adjacency_list; GraphTC = R_adjacency_list]’ transitive_closure.cpp:29:24: required from here /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::concepts::IncidenceGraph >]’ 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ^ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::IncidenceGraphConcept >]’: /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/depth_first_search.hpp:129:9: required from ‘void boost::detail::depth_first_visit_impl(const IncidenceGraph&, typename boost::graph_traits::vertex_descriptor, DFSVisitor&, ColorMap, TerminatorFunc) [with IncidenceGraph = R_adjacency_list; DFSVisitor = tarjan_scc_visitor, long unsigned int>, long unsigned int, long unsigned int&>, boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>, boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>, std::stack > > >; ColorMap = boost::shared_array_property_map, long unsigned int> >; TerminatorFunc = nontruth2; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/depth_first_search.hpp:286:39: required from ‘void boost::depth_first_search(const VertexListGraph&, DFSVisitor, ColorMap, typename graph_traits::vertex_descriptor) [with VertexListGraph = R_adjacency_list; DFSVisitor = detail::tarjan_scc_visitor, long unsigned int>, long unsigned int, long unsigned int&>, iterator_property_map<__gnu_cxx::__normal_iterator >, vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>, iterator_property_map<__gnu_cxx::__normal_iterator >, vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>, std::stack > > >; ColorMap = shared_array_property_map, long unsigned int> >; typename graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/depth_first_search.hpp:397:42: required from ‘void boost::graph::detail::depth_first_search_impl::operator()(const Graph&, const ArgPack&) const [with ArgPack = boost::parameter::aux::arg_list, long unsigned int>, long unsigned int, long unsigned int&>, boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>, boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>, std::stack > > > >, boost::parameter::aux::arg_list, long unsigned int> >, boost::parameter::aux::empty_arg_list, std::integral_constant >, std::integral_constant >; Graph = R_adjacency_list]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/depth_first_search.hpp:406:5: required from ‘typename boost::result_of(Param0, const ArgPack&)>::type boost::graph::depth_first_search_with_named_params(const Param0&, const ArgPack&) [with Param0 = R_adjacency_list; ArgPack = boost::parameter::aux::arg_list, long unsigned int>, long unsigned int, long unsigned int&>, boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>, boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>, std::stack > > > >, boost::parameter::aux::arg_list, long unsigned int> >, boost::parameter::aux::empty_arg_list, std::integral_constant >, std::integral_constant >; typename boost::result_of(Param0, const ArgPack&)>::type = void]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/depth_first_search.hpp:409:1: required from ‘typename boost::result_of(Param0, const typename boost::detail::convert_bgl_params_to_boost_parameter >::type&)>::type boost::depth_first_search(const Param0&, const bgl_named_params&) [with Param0 = R_adjacency_list; P = detail::tarjan_scc_visitor, long unsigned int>, long unsigned int, long unsigned int&>, iterator_property_map<__gnu_cxx::__normal_iterator >, vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>, iterator_property_map<__gnu_cxx::__normal_iterator >, vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>, std::stack > > >; T = graph_visitor_t; R = bgl_named_params, long unsigned int>, vertex_index_t, no_property>; typename result_of(Param0, const typename detail::convert_bgl_params_to_boost_parameter >::type&)>::type = void; typename detail::convert_bgl_params_to_boost_parameter >::type = parameter::aux::arg_list, long unsigned int>, long unsigned int, long unsigned int&>, iterator_property_map<__gnu_cxx::__normal_iterator >, vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>, iterator_property_map<__gnu_cxx::__normal_iterator >, vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>, std::stack > > > >, parameter::aux::arg_list, long unsigned int> >, parameter::aux::empty_arg_list, std::integral_constant >, std::integral_constant >]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/strong_components.hpp:129:27: [ skipping 3 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/strong_components.hpp:205:31: required from ‘static typename boost::property_traits::value_type boost::detail::strong_comp_dispatch1::apply(const Graph&, ComponentMap, const boost::bgl_named_params&, boost::param_not_found) [with Graph = R_adjacency_list; ComponentMap = boost::iterator_property_map, long unsigned int>, long unsigned int, long unsigned int&>; P = boost::vec_adj_list_vertex_id_map, long unsigned int>; T = boost::vertex_index_t; R = boost::no_property; typename boost::property_traits::value_type = long unsigned int]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/strong_components.hpp:220:63: required from ‘typename boost::property_traits::value_type boost::detail::scc_helper1(const Graph&, ComponentMap, const boost::bgl_named_params&, RootMap) [with Graph = R_adjacency_list; ComponentMap = boost::iterator_property_map, long unsigned int>, long unsigned int, long unsigned int&>; RootMap = boost::param_not_found; P = boost::vec_adj_list_vertex_id_map, long unsigned int>; T = boost::vertex_index_t; R = boost::no_property; typename boost::property_traits::value_type = long unsigned int]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/strong_components.hpp:235:31: required from ‘typename boost::property_traits::value_type boost::strong_components(const Graph&, ComponentMap, const bgl_named_params&, typename enable_if_c::traversal_category>::value, graph::detail::no_parameter>::type) [with Graph = R_adjacency_list; ComponentMap = iterator_property_map, long unsigned int>, long unsigned int, long unsigned int&>; P = vec_adj_list_vertex_id_map, long unsigned int>; T = vertex_index_t; R = no_property; typename property_traits::value_type = long unsigned int; typename enable_if_c::traversal_category>::value, graph::detail::no_parameter>::type = graph::detail::no_parameter; typename graph_traits::traversal_category = adj_list_dir_traversal_tag]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/transitive_closure.hpp:86:28: required from ‘void boost::transitive_closure(const Graph&, GraphTC&, G_to_TC_VertexMap, VertexIndexMap) [with Graph = R_adjacency_list; GraphTC = R_adjacency_list; G_to_TC_VertexMap = iterator_property_map, long unsigned int>, long unsigned int, long unsigned int&>; VertexIndexMap = vec_adj_list_vertex_id_map, long unsigned int>]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/transitive_closure.hpp:288:23: required from ‘void boost::transitive_closure(const Graph&, GraphTC&) [with Graph = R_adjacency_list; GraphTC = R_adjacency_list]’ transitive_closure.cpp:29:24: required from here /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/graph_concepts.hpp:75:15: note: in a call to non-static member function ‘boost::concepts::IncidenceGraphConcept >::~IncidenceGraphConcept()’ 75 | BOOST_concept(IncidenceGraph, (G)) : Graph< G > | ^~~~~~~~~~~~~~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/preprocessor/cat.hpp:29:34: note: in definition of macro ‘BOOST_PP_CAT_I’ 29 | # define BOOST_PP_CAT_I(a, b) a ## b | ^ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/concept_def.hpp:23:12: note: in expansion of macro ‘BOOST_PP_CAT’ 23 | struct BOOST_PP_CAT(name,Concept) \ | ^~~~~~~~~~~~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/graph_concepts.hpp:75:1: note: in expansion of macro ‘BOOST_concept’ 75 | BOOST_concept(IncidenceGraph, (G)) : Graph< G > | ^~~~~~~~~~~~~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::constraint::failed() [with Model = boost::ReadWritePropertyMapConcept, long unsigned int> >, long unsigned int>]’: /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/depth_first_search.hpp:134:9: required from ‘void boost::detail::depth_first_visit_impl(const IncidenceGraph&, typename boost::graph_traits::vertex_descriptor, DFSVisitor&, ColorMap, TerminatorFunc) [with IncidenceGraph = R_adjacency_list; DFSVisitor = tarjan_scc_visitor, long unsigned int>, long unsigned int, long unsigned int&>, boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>, boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>, std::stack > > >; ColorMap = boost::shared_array_property_map, long unsigned int> >; TerminatorFunc = nontruth2; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/depth_first_search.hpp:286:39: required from ‘void boost::depth_first_search(const VertexListGraph&, DFSVisitor, ColorMap, typename graph_traits::vertex_descriptor) [with VertexListGraph = R_adjacency_list; DFSVisitor = detail::tarjan_scc_visitor, long unsigned int>, long unsigned int, long unsigned int&>, iterator_property_map<__gnu_cxx::__normal_iterator >, vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>, iterator_property_map<__gnu_cxx::__normal_iterator >, vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>, std::stack > > >; ColorMap = shared_array_property_map, long unsigned int> >; typename graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/depth_first_search.hpp:397:42: required from ‘void boost::graph::detail::depth_first_search_impl::operator()(const Graph&, const ArgPack&) const [with ArgPack = boost::parameter::aux::arg_list, long unsigned int>, long unsigned int, long unsigned int&>, boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>, boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>, std::stack > > > >, boost::parameter::aux::arg_list, long unsigned int> >, boost::parameter::aux::empty_arg_list, std::integral_constant >, std::integral_constant >; Graph = R_adjacency_list]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/depth_first_search.hpp:406:5: required from ‘typename boost::result_of(Param0, const ArgPack&)>::type boost::graph::depth_first_search_with_named_params(const Param0&, const ArgPack&) [with Param0 = R_adjacency_list; ArgPack = boost::parameter::aux::arg_list, long unsigned int>, long unsigned int, long unsigned int&>, boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>, boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>, std::stack > > > >, boost::parameter::aux::arg_list, long unsigned int> >, boost::parameter::aux::empty_arg_list, std::integral_constant >, std::integral_constant >; typename boost::result_of(Param0, const ArgPack&)>::type = void]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/depth_first_search.hpp:409:1: required from ‘typename boost::result_of(Param0, const typename boost::detail::convert_bgl_params_to_boost_parameter >::type&)>::type boost::depth_first_search(const Param0&, const bgl_named_params&) [with Param0 = R_adjacency_list; P = detail::tarjan_scc_visitor, long unsigned int>, long unsigned int, long unsigned int&>, iterator_property_map<__gnu_cxx::__normal_iterator >, vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>, iterator_property_map<__gnu_cxx::__normal_iterator >, vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>, std::stack > > >; T = graph_visitor_t; R = bgl_named_params, long unsigned int>, vertex_index_t, no_property>; typename result_of(Param0, const typename detail::convert_bgl_params_to_boost_parameter >::type&)>::type = void; typename detail::convert_bgl_params_to_boost_parameter >::type = parameter::aux::arg_list, long unsigned int>, long unsigned int, long unsigned int&>, iterator_property_map<__gnu_cxx::__normal_iterator >, vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>, iterator_property_map<__gnu_cxx::__normal_iterator >, vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>, std::stack > > > >, parameter::aux::arg_list, long unsigned int> >, parameter::aux::empty_arg_list, std::integral_constant >, std::integral_constant >]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/strong_components.hpp:129:27: [ skipping 3 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/strong_components.hpp:205:31: required from ‘static typename boost::property_traits::value_type boost::detail::strong_comp_dispatch1::apply(const Graph&, ComponentMap, const boost::bgl_named_params&, boost::param_not_found) [with Graph = R_adjacency_list; ComponentMap = boost::iterator_property_map, long unsigned int>, long unsigned int, long unsigned int&>; P = boost::vec_adj_list_vertex_id_map, long unsigned int>; T = boost::vertex_index_t; R = boost::no_property; typename boost::property_traits::value_type = long unsigned int]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/strong_components.hpp:220:63: required from ‘typename boost::property_traits::value_type boost::detail::scc_helper1(const Graph&, ComponentMap, const boost::bgl_named_params&, RootMap) [with Graph = R_adjacency_list; ComponentMap = boost::iterator_property_map, long unsigned int>, long unsigned int, long unsigned int&>; RootMap = boost::param_not_found; P = boost::vec_adj_list_vertex_id_map, long unsigned int>; T = boost::vertex_index_t; R = boost::no_property; typename boost::property_traits::value_type = long unsigned int]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/strong_components.hpp:235:31: required from ‘typename boost::property_traits::value_type boost::strong_components(const Graph&, ComponentMap, const bgl_named_params&, typename enable_if_c::traversal_category>::value, graph::detail::no_parameter>::type) [with Graph = R_adjacency_list; ComponentMap = iterator_property_map, long unsigned int>, long unsigned int, long unsigned int&>; P = vec_adj_list_vertex_id_map, long unsigned int>; T = vertex_index_t; R = no_property; typename property_traits::value_type = long unsigned int; typename enable_if_c::traversal_category>::value, graph::detail::no_parameter>::type = graph::detail::no_parameter; typename graph_traits::traversal_category = adj_list_dir_traversal_tag]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/transitive_closure.hpp:86:28: required from ‘void boost::transitive_closure(const Graph&, GraphTC&, G_to_TC_VertexMap, VertexIndexMap) [with Graph = R_adjacency_list; GraphTC = R_adjacency_list; G_to_TC_VertexMap = iterator_property_map, long unsigned int>, long unsigned int, long unsigned int&>; VertexIndexMap = vec_adj_list_vertex_id_map, long unsigned int>]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/transitive_closure.hpp:288:23: required from ‘void boost::transitive_closure(const Graph&, GraphTC&) [with Graph = R_adjacency_list; GraphTC = R_adjacency_list]’ transitive_closure.cpp:29:24: required from here /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:65:52: warning: ‘this’ pointer is null [-Wnonnull] 65 | static void failed() { ((Model*)0)->constraints(); } | ~~~~~~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/property_map/property_map.hpp:205:10: note: in a call to non-static member function ‘void boost::ReadWritePropertyMapConcept::constraints() [with PMap = boost::shared_array_property_map, long unsigned int> >; Key = long unsigned int]’ 205 | void constraints() { | ^~~~~~~~~~~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::Assignable*, std::vector, std::allocator > > >, long unsigned int, boost::detail::edge_desc_impl, long int> >]’: /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements*, std::vector, std::allocator > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:145:5: required from ‘struct boost::Assignable*, std::vector, std::allocator > > >, long unsigned int, boost::detail::edge_desc_impl, long int> >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:502:3: required from ‘struct boost::InputIterator*, std::vector, std::allocator > > >, long unsigned int, boost::detail::edge_desc_impl, long int> >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::InputIterator*, std::vector, std::allocator > > >, long unsigned int, boost::detail::edge_desc_impl, long int> >]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied*, std::vector, std::allocator > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::value’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:45:51: [ skipping 9 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/depth_first_search.hpp:406:5: required from ‘typename boost::result_of(Param0, const ArgPack&)>::type boost::graph::depth_first_search_with_named_params(const Param0&, const ArgPack&) [with Param0 = boost::adjacency_list; ArgPack = boost::parameter::aux::arg_list > > >, boost::parameter::aux::arg_list >, boost::parameter::aux::empty_arg_list, std::integral_constant >, std::integral_constant >; typename boost::result_of(Param0, const ArgPack&)>::type = void]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/depth_first_search.hpp:409:1: required from ‘typename boost::result_of(Param0, const typename boost::detail::convert_bgl_params_to_boost_parameter >::type&)>::type boost::depth_first_search(const Param0&, const bgl_named_params&) [with Param0 = adjacency_list; P = topo_sort_visitor > >; T = graph_visitor_t; R = bgl_named_params, vertex_index_t, no_property>; typename result_of(Param0, const typename detail::convert_bgl_params_to_boost_parameter >::type&)>::type = void; typename detail::convert_bgl_params_to_boost_parameter >::type = parameter::aux::arg_list > > >, parameter::aux::arg_list >, parameter::aux::empty_arg_list, std::integral_constant >, std::integral_constant >]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/topological_sort.hpp:69:23: required from ‘void boost::topological_sort(VertexListGraph&, OutputIterator, const bgl_named_params&) [with VertexListGraph = adjacency_list; OutputIterator = std::back_insert_iterator >; P = typed_identity_property_map; T = vertex_index_t; R = no_property]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/transitive_closure.hpp:122:21: required from ‘void boost::transitive_closure(const Graph&, GraphTC&, G_to_TC_VertexMap, VertexIndexMap) [with Graph = R_adjacency_list; GraphTC = R_adjacency_list; G_to_TC_VertexMap = iterator_property_map, long unsigned int>, long unsigned int, long unsigned int&>; VertexIndexMap = vec_adj_list_vertex_id_map, long unsigned int>]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/transitive_closure.hpp:288:23: required from ‘void boost::transitive_closure(const Graph&, GraphTC&) [with Graph = R_adjacency_list; GraphTC = R_adjacency_list]’ transitive_closure.cpp:29:24: required from here /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::Assignable::~Assignable() [with TT = boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator*, std::vector, std::allocator > > >, long unsigned int, boost::detail::edge_desc_impl, long int>]’ 37 | ~model() | ^ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:145:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 145 | BOOST_CONCEPT_USAGE(Assignable) { | ^~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::EqualityComparable*, std::vector, std::allocator > > >, long unsigned int, boost::detail::edge_desc_impl, long int> >]’: /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements*, std::vector, std::allocator > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:233:5: required from ‘struct boost::EqualityComparable*, std::vector, std::allocator > > >, long unsigned int, boost::detail::edge_desc_impl, long int> >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:502:3: required from ‘struct boost::InputIterator*, std::vector, std::allocator > > >, long unsigned int, boost::detail::edge_desc_impl, long int> >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::InputIterator*, std::vector, std::allocator > > >, long unsigned int, boost::detail::edge_desc_impl, long int> >]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied*, std::vector, std::allocator > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::value’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:45:51: [ skipping 9 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/depth_first_search.hpp:406:5: required from ‘typename boost::result_of(Param0, const ArgPack&)>::type boost::graph::depth_first_search_with_named_params(const Param0&, const ArgPack&) [with Param0 = boost::adjacency_list; ArgPack = boost::parameter::aux::arg_list > > >, boost::parameter::aux::arg_list >, boost::parameter::aux::empty_arg_list, std::integral_constant >, std::integral_constant >; typename boost::result_of(Param0, const ArgPack&)>::type = void]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/depth_first_search.hpp:409:1: required from ‘typename boost::result_of(Param0, const typename boost::detail::convert_bgl_params_to_boost_parameter >::type&)>::type boost::depth_first_search(const Param0&, const bgl_named_params&) [with Param0 = adjacency_list; P = topo_sort_visitor > >; T = graph_visitor_t; R = bgl_named_params, vertex_index_t, no_property>; typename result_of(Param0, const typename detail::convert_bgl_params_to_boost_parameter >::type&)>::type = void; typename detail::convert_bgl_params_to_boost_parameter >::type = parameter::aux::arg_list > > >, parameter::aux::arg_list >, parameter::aux::empty_arg_list, std::integral_constant >, std::integral_constant >]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/topological_sort.hpp:69:23: required from ‘void boost::topological_sort(VertexListGraph&, OutputIterator, const bgl_named_params&) [with VertexListGraph = adjacency_list; OutputIterator = std::back_insert_iterator >; P = typed_identity_property_map; T = vertex_index_t; R = no_property]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/transitive_closure.hpp:122:21: required from ‘void boost::transitive_closure(const Graph&, GraphTC&, G_to_TC_VertexMap, VertexIndexMap) [with Graph = R_adjacency_list; GraphTC = R_adjacency_list; G_to_TC_VertexMap = iterator_property_map, long unsigned int>, long unsigned int, long unsigned int&>; VertexIndexMap = vec_adj_list_vertex_id_map, long unsigned int>]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/transitive_closure.hpp:288:23: required from ‘void boost::transitive_closure(const Graph&, GraphTC&) [with Graph = R_adjacency_list; GraphTC = R_adjacency_list]’ transitive_closure.cpp:29:24: required from here /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::EqualityComparable::~EqualityComparable() [with TT = boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator*, std::vector, std::allocator > > >, long unsigned int, boost::detail::edge_desc_impl, long int>]’ 37 | ~model() | ^ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:233:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 233 | BOOST_CONCEPT_USAGE(EqualityComparable) { | ^~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::InputIterator*, std::vector, std::allocator > > >, long unsigned int, boost::detail::edge_desc_impl, long int> >]’: /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements*, std::vector, std::allocator > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:512:7: required from ‘struct boost::InputIterator*, std::vector, std::allocator > > >, long unsigned int, boost::detail::edge_desc_impl, long int> >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::InputIterator*, std::vector, std::allocator > > >, long unsigned int, boost::detail::edge_desc_impl, long int> >]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied*, std::vector, std::allocator > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::value’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied*, std::vector, std::allocator > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:72:8: [ skipping 8 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/depth_first_search.hpp:406:5: required from ‘typename boost::result_of(Param0, const ArgPack&)>::type boost::graph::depth_first_search_with_named_params(const Param0&, const ArgPack&) [with Param0 = boost::adjacency_list; ArgPack = boost::parameter::aux::arg_list > > >, boost::parameter::aux::arg_list >, boost::parameter::aux::empty_arg_list, std::integral_constant >, std::integral_constant >; typename boost::result_of(Param0, const ArgPack&)>::type = void]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/depth_first_search.hpp:409:1: required from ‘typename boost::result_of(Param0, const typename boost::detail::convert_bgl_params_to_boost_parameter >::type&)>::type boost::depth_first_search(const Param0&, const bgl_named_params&) [with Param0 = adjacency_list; P = topo_sort_visitor > >; T = graph_visitor_t; R = bgl_named_params, vertex_index_t, no_property>; typename result_of(Param0, const typename detail::convert_bgl_params_to_boost_parameter >::type&)>::type = void; typename detail::convert_bgl_params_to_boost_parameter >::type = parameter::aux::arg_list > > >, parameter::aux::arg_list >, parameter::aux::empty_arg_list, std::integral_constant >, std::integral_constant >]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/topological_sort.hpp:69:23: required from ‘void boost::topological_sort(VertexListGraph&, OutputIterator, const bgl_named_params&) [with VertexListGraph = adjacency_list; OutputIterator = std::back_insert_iterator >; P = typed_identity_property_map; T = vertex_index_t; R = no_property]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/transitive_closure.hpp:122:21: required from ‘void boost::transitive_closure(const Graph&, GraphTC&, G_to_TC_VertexMap, VertexIndexMap) [with Graph = R_adjacency_list; GraphTC = R_adjacency_list; G_to_TC_VertexMap = iterator_property_map, long unsigned int>, long unsigned int, long unsigned int&>; VertexIndexMap = vec_adj_list_vertex_id_map, long unsigned int>]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/transitive_closure.hpp:288:23: required from ‘void boost::transitive_closure(const Graph&, GraphTC&) [with Graph = R_adjacency_list; GraphTC = R_adjacency_list]’ transitive_closure.cpp:29:24: required from here /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::InputIterator::~InputIterator() [with TT = boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator*, std::vector, std::allocator > > >, long unsigned int, boost::detail::edge_desc_impl, long int>]’ 37 | ~model() | ^ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:512:7: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 512 | BOOST_CONCEPT_USAGE(InputIterator) | ^~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::CopyConstructible, long unsigned int>, long unsigned int, long unsigned int&>, boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>, boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>, std::stack > > > >]’: /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements, long unsigned int>, long unsigned int, long unsigned int&>, boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>, boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>, std::stack > > > > >]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:167:5: required from ‘struct boost::CopyConstructible, long unsigned int>, long unsigned int, long unsigned int&>, boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>, boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>, std::stack > > > >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:165:3: required from ‘struct boost::CopyConstructibleConcept, long unsigned int>, long unsigned int, long unsigned int&>, boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>, boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>, std::stack > > > >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::CopyConstructibleConcept, long unsigned int>, long unsigned int, long unsigned int&>, boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>, boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>, std::stack > > > >]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied, long unsigned int>, long unsigned int, long unsigned int&>, boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>, boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>, std::stack > > > > >::value’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:45:51: [ skipping 14 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/strong_components.hpp:205:31: required from ‘static typename boost::property_traits::value_type boost::detail::strong_comp_dispatch1::apply(const Graph&, ComponentMap, const boost::bgl_named_params&, boost::param_not_found) [with Graph = R_adjacency_list; ComponentMap = boost::iterator_property_map, long unsigned int>, long unsigned int, long unsigned int&>; P = boost::vec_adj_list_vertex_id_map, long unsigned int>; T = boost::vertex_index_t; R = boost::no_property; typename boost::property_traits::value_type = long unsigned int]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/strong_components.hpp:220:63: required from ‘typename boost::property_traits::value_type boost::detail::scc_helper1(const Graph&, ComponentMap, const boost::bgl_named_params&, RootMap) [with Graph = R_adjacency_list; ComponentMap = boost::iterator_property_map, long unsigned int>, long unsigned int, long unsigned int&>; RootMap = boost::param_not_found; P = boost::vec_adj_list_vertex_id_map, long unsigned int>; T = boost::vertex_index_t; R = boost::no_property; typename boost::property_traits::value_type = long unsigned int]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/strong_components.hpp:235:31: required from ‘typename boost::property_traits::value_type boost::strong_components(const Graph&, ComponentMap, const bgl_named_params&, typename enable_if_c::traversal_category>::value, graph::detail::no_parameter>::type) [with Graph = R_adjacency_list; ComponentMap = iterator_property_map, long unsigned int>, long unsigned int, long unsigned int&>; P = vec_adj_list_vertex_id_map, long unsigned int>; T = vertex_index_t; R = no_property; typename property_traits::value_type = long unsigned int; typename enable_if_c::traversal_category>::value, graph::detail::no_parameter>::type = graph::detail::no_parameter; typename graph_traits::traversal_category = adj_list_dir_traversal_tag]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/transitive_closure.hpp:86:28: required from ‘void boost::transitive_closure(const Graph&, GraphTC&, G_to_TC_VertexMap, VertexIndexMap) [with Graph = R_adjacency_list; GraphTC = R_adjacency_list; G_to_TC_VertexMap = iterator_property_map, long unsigned int>, long unsigned int, long unsigned int&>; VertexIndexMap = vec_adj_list_vertex_id_map, long unsigned int>]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/transitive_closure.hpp:288:23: required from ‘void boost::transitive_closure(const Graph&, GraphTC&) [with Graph = R_adjacency_list; GraphTC = R_adjacency_list]’ transitive_closure.cpp:29:24: required from here /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::CopyConstructible::~CopyConstructible() [with TT = boost::detail::tarjan_scc_visitor, long unsigned int>, long unsigned int, long unsigned int&>, boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>, boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>, std::stack > > >]’ 37 | ~model() | ^ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:167:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 167 | BOOST_CONCEPT_USAGE(CopyConstructible) { | ^~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::concepts::IncidenceGraph >]’: /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements > >]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/graph_concepts.hpp:87:5: required from ‘struct boost::concepts::IncidenceGraph >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/graph_concepts.hpp:75:1: required from ‘struct boost::concepts::IncidenceGraphConcept >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::concepts::IncidenceGraphConcept >]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied > >::value’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:45:51: [ skipping 10 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/strong_components.hpp:205:31: required from ‘static typename boost::property_traits::value_type boost::detail::strong_comp_dispatch1::apply(const Graph&, ComponentMap, const boost::bgl_named_params&, boost::param_not_found) [with Graph = R_adjacency_list; ComponentMap = boost::iterator_property_map, long unsigned int>, long unsigned int, long unsigned int&>; P = boost::vec_adj_list_vertex_id_map, long unsigned int>; T = boost::vertex_index_t; R = boost::no_property; typename boost::property_traits::value_type = long unsigned int]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/strong_components.hpp:220:63: required from ‘typename boost::property_traits::value_type boost::detail::scc_helper1(const Graph&, ComponentMap, const boost::bgl_named_params&, RootMap) [with Graph = R_adjacency_list; ComponentMap = boost::iterator_property_map, long unsigned int>, long unsigned int, long unsigned int&>; RootMap = boost::param_not_found; P = boost::vec_adj_list_vertex_id_map, long unsigned int>; T = boost::vertex_index_t; R = boost::no_property; typename boost::property_traits::value_type = long unsigned int]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/strong_components.hpp:235:31: required from ‘typename boost::property_traits::value_type boost::strong_components(const Graph&, ComponentMap, const bgl_named_params&, typename enable_if_c::traversal_category>::value, graph::detail::no_parameter>::type) [with Graph = R_adjacency_list; ComponentMap = iterator_property_map, long unsigned int>, long unsigned int, long unsigned int&>; P = vec_adj_list_vertex_id_map, long unsigned int>; T = vertex_index_t; R = no_property; typename property_traits::value_type = long unsigned int; typename enable_if_c::traversal_category>::value, graph::detail::no_parameter>::type = graph::detail::no_parameter; typename graph_traits::traversal_category = adj_list_dir_traversal_tag]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/transitive_closure.hpp:86:28: required from ‘void boost::transitive_closure(const Graph&, GraphTC&, G_to_TC_VertexMap, VertexIndexMap) [with Graph = R_adjacency_list; GraphTC = R_adjacency_list; G_to_TC_VertexMap = iterator_property_map, long unsigned int>, long unsigned int, long unsigned int&>; VertexIndexMap = vec_adj_list_vertex_id_map, long unsigned int>]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/transitive_closure.hpp:288:23: required from ‘void boost::transitive_closure(const Graph&, GraphTC&) [with Graph = R_adjacency_list; GraphTC = R_adjacency_list]’ transitive_closure.cpp:29:24: required from here /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::concepts::IncidenceGraph::~IncidenceGraph() [with G = R_adjacency_list]’ 37 | ~model() | ^ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/graph_concepts.hpp:87:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 87 | BOOST_CONCEPT_USAGE(IncidenceGraph) | ^~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::constraint::failed() [with Model = boost::ReadablePropertyMapConcept, long unsigned int> >, long unsigned int>]’: /home/omnipath/local/R/4.4-3.20/BH/include/boost/property_map/property_map.hpp:206:7: required from ‘void boost::ReadWritePropertyMapConcept::constraints() [with PMap = boost::shared_array_property_map, long unsigned int> >; Key = long unsigned int]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::ReadWritePropertyMapConcept, long unsigned int> >, long unsigned int>]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied, long unsigned int> >, long unsigned int> >::value’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied, long unsigned int> >, long unsigned int> >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_, long unsigned int> >, long unsigned int>)>’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/depth_first_search.hpp:134:9: [ skipping 8 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/strong_components.hpp:205:31: required from ‘static typename boost::property_traits::value_type boost::detail::strong_comp_dispatch1::apply(const Graph&, ComponentMap, const boost::bgl_named_params&, boost::param_not_found) [with Graph = R_adjacency_list; ComponentMap = boost::iterator_property_map, long unsigned int>, long unsigned int, long unsigned int&>; P = boost::vec_adj_list_vertex_id_map, long unsigned int>; T = boost::vertex_index_t; R = boost::no_property; typename boost::property_traits::value_type = long unsigned int]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/strong_components.hpp:220:63: required from ‘typename boost::property_traits::value_type boost::detail::scc_helper1(const Graph&, ComponentMap, const boost::bgl_named_params&, RootMap) [with Graph = R_adjacency_list; ComponentMap = boost::iterator_property_map, long unsigned int>, long unsigned int, long unsigned int&>; RootMap = boost::param_not_found; P = boost::vec_adj_list_vertex_id_map, long unsigned int>; T = boost::vertex_index_t; R = boost::no_property; typename boost::property_traits::value_type = long unsigned int]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/strong_components.hpp:235:31: required from ‘typename boost::property_traits::value_type boost::strong_components(const Graph&, ComponentMap, const bgl_named_params&, typename enable_if_c::traversal_category>::value, graph::detail::no_parameter>::type) [with Graph = R_adjacency_list; ComponentMap = iterator_property_map, long unsigned int>, long unsigned int, long unsigned int&>; P = vec_adj_list_vertex_id_map, long unsigned int>; T = vertex_index_t; R = no_property; typename property_traits::value_type = long unsigned int; typename enable_if_c::traversal_category>::value, graph::detail::no_parameter>::type = graph::detail::no_parameter; typename graph_traits::traversal_category = adj_list_dir_traversal_tag]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/transitive_closure.hpp:86:28: required from ‘void boost::transitive_closure(const Graph&, GraphTC&, G_to_TC_VertexMap, VertexIndexMap) [with Graph = R_adjacency_list; GraphTC = R_adjacency_list; G_to_TC_VertexMap = iterator_property_map, long unsigned int>, long unsigned int, long unsigned int&>; VertexIndexMap = vec_adj_list_vertex_id_map, long unsigned int>]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/transitive_closure.hpp:288:23: required from ‘void boost::transitive_closure(const Graph&, GraphTC&) [with Graph = R_adjacency_list; GraphTC = R_adjacency_list]’ transitive_closure.cpp:29:24: required from here /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:65:52: warning: ‘this’ pointer is null [-Wnonnull] 65 | static void failed() { ((Model*)0)->constraints(); } | ~~~~~~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/property_map/property_map.hpp:147:10: note: in a call to non-static member function ‘void boost::ReadablePropertyMapConcept::constraints() [with PMap = boost::shared_array_property_map, long unsigned int> >; Key = long unsigned int]’ 147 | void constraints() { | ^~~~~~~~~~~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::constraint::failed() [with Model = boost::WritablePropertyMapConcept, long unsigned int> >, long unsigned int>]’: /home/omnipath/local/R/4.4-3.20/BH/include/boost/property_map/property_map.hpp:207:7: required from ‘void boost::ReadWritePropertyMapConcept::constraints() [with PMap = boost::shared_array_property_map, long unsigned int> >; Key = long unsigned int]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::ReadWritePropertyMapConcept, long unsigned int> >, long unsigned int>]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied, long unsigned int> >, long unsigned int> >::value’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied, long unsigned int> >, long unsigned int> >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_, long unsigned int> >, long unsigned int>)>’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/depth_first_search.hpp:134:9: [ skipping 8 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/strong_components.hpp:205:31: required from ‘static typename boost::property_traits::value_type boost::detail::strong_comp_dispatch1::apply(const Graph&, ComponentMap, const boost::bgl_named_params&, boost::param_not_found) [with Graph = R_adjacency_list; ComponentMap = boost::iterator_property_map, long unsigned int>, long unsigned int, long unsigned int&>; P = boost::vec_adj_list_vertex_id_map, long unsigned int>; T = boost::vertex_index_t; R = boost::no_property; typename boost::property_traits::value_type = long unsigned int]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/strong_components.hpp:220:63: required from ‘typename boost::property_traits::value_type boost::detail::scc_helper1(const Graph&, ComponentMap, const boost::bgl_named_params&, RootMap) [with Graph = R_adjacency_list; ComponentMap = boost::iterator_property_map, long unsigned int>, long unsigned int, long unsigned int&>; RootMap = boost::param_not_found; P = boost::vec_adj_list_vertex_id_map, long unsigned int>; T = boost::vertex_index_t; R = boost::no_property; typename boost::property_traits::value_type = long unsigned int]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/strong_components.hpp:235:31: required from ‘typename boost::property_traits::value_type boost::strong_components(const Graph&, ComponentMap, const bgl_named_params&, typename enable_if_c::traversal_category>::value, graph::detail::no_parameter>::type) [with Graph = R_adjacency_list; ComponentMap = iterator_property_map, long unsigned int>, long unsigned int, long unsigned int&>; P = vec_adj_list_vertex_id_map, long unsigned int>; T = vertex_index_t; R = no_property; typename property_traits::value_type = long unsigned int; typename enable_if_c::traversal_category>::value, graph::detail::no_parameter>::type = graph::detail::no_parameter; typename graph_traits::traversal_category = adj_list_dir_traversal_tag]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/transitive_closure.hpp:86:28: required from ‘void boost::transitive_closure(const Graph&, GraphTC&, G_to_TC_VertexMap, VertexIndexMap) [with Graph = R_adjacency_list; GraphTC = R_adjacency_list; G_to_TC_VertexMap = iterator_property_map, long unsigned int>, long unsigned int, long unsigned int&>; VertexIndexMap = vec_adj_list_vertex_id_map, long unsigned int>]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/transitive_closure.hpp:288:23: required from ‘void boost::transitive_closure(const Graph&, GraphTC&) [with Graph = R_adjacency_list; GraphTC = R_adjacency_list]’ transitive_closure.cpp:29:24: required from here /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:65:52: warning: ‘this’ pointer is null [-Wnonnull] 65 | static void failed() { ((Model*)0)->constraints(); } | ~~~~~~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/property_map/property_map.hpp:179:10: note: in a call to non-static member function ‘void boost::WritablePropertyMapConcept::constraints() [with PMap = boost::shared_array_property_map, long unsigned int> >; Key = long unsigned int]’ 179 | void constraints() { | ^~~~~~~~~~~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements >*, std::vector >, std::allocator > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >]’: /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/graph_concepts.hpp:52:50: required from ‘struct boost::concepts::MultiPassInputIterator >*, std::vector >, std::allocator > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::concepts::MultiPassInputIterator >*, std::vector >, std::allocator > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> >]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied >*, std::vector >, std::allocator > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::value’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied >*, std::vector >, std::allocator > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_ >*, std::vector >, std::allocator > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> >)>’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/graph_concepts.hpp:89:9: [ skipping 10 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/strong_components.hpp:205:31: required from ‘static typename boost::property_traits::value_type boost::detail::strong_comp_dispatch1::apply(const Graph&, ComponentMap, const boost::bgl_named_params&, boost::param_not_found) [with Graph = R_adjacency_list; ComponentMap = boost::iterator_property_map, long unsigned int>, long unsigned int, long unsigned int&>; P = boost::vec_adj_list_vertex_id_map, long unsigned int>; T = boost::vertex_index_t; R = boost::no_property; typename boost::property_traits::value_type = long unsigned int]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/strong_components.hpp:220:63: required from ‘typename boost::property_traits::value_type boost::detail::scc_helper1(const Graph&, ComponentMap, const boost::bgl_named_params&, RootMap) [with Graph = R_adjacency_list; ComponentMap = boost::iterator_property_map, long unsigned int>, long unsigned int, long unsigned int&>; RootMap = boost::param_not_found; P = boost::vec_adj_list_vertex_id_map, long unsigned int>; T = boost::vertex_index_t; R = boost::no_property; typename boost::property_traits::value_type = long unsigned int]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/strong_components.hpp:235:31: required from ‘typename boost::property_traits::value_type boost::strong_components(const Graph&, ComponentMap, const bgl_named_params&, typename enable_if_c::traversal_category>::value, graph::detail::no_parameter>::type) [with Graph = R_adjacency_list; ComponentMap = iterator_property_map, long unsigned int>, long unsigned int, long unsigned int&>; P = vec_adj_list_vertex_id_map, long unsigned int>; T = vertex_index_t; R = no_property; typename property_traits::value_type = long unsigned int; typename enable_if_c::traversal_category>::value, graph::detail::no_parameter>::type = graph::detail::no_parameter; typename graph_traits::traversal_category = adj_list_dir_traversal_tag]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/transitive_closure.hpp:86:28: required from ‘void boost::transitive_closure(const Graph&, GraphTC&, G_to_TC_VertexMap, VertexIndexMap) [with Graph = R_adjacency_list; GraphTC = R_adjacency_list; G_to_TC_VertexMap = iterator_property_map, long unsigned int>, long unsigned int, long unsigned int&>; VertexIndexMap = vec_adj_list_vertex_id_map, long unsigned int>]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/transitive_closure.hpp:288:23: required from ‘void boost::transitive_closure(const Graph&, GraphTC&) [with Graph = R_adjacency_list; GraphTC = R_adjacency_list]’ transitive_closure.cpp:29:24: required from here /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::concepts::MultiPassInputIterator >*, std::vector >, std::allocator > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> >]’ 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ^ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::MultiPassInputIterator >*, std::vector >, std::allocator > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> >]’: /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/graph_concepts.hpp:89:9: required from ‘boost::concepts::IncidenceGraph::~IncidenceGraph() [with G = R_adjacency_list]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/graph_concepts.hpp:75:1: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::IncidenceGraphConcept >]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/depth_first_search.hpp:129:9: required from ‘void boost::detail::depth_first_visit_impl(const IncidenceGraph&, typename boost::graph_traits::vertex_descriptor, DFSVisitor&, ColorMap, TerminatorFunc) [with IncidenceGraph = R_adjacency_list; DFSVisitor = tarjan_scc_visitor, long unsigned int>, long unsigned int, long unsigned int&>, boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>, boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>, std::stack > > >; ColorMap = boost::shared_array_property_map, long unsigned int> >; TerminatorFunc = nontruth2; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/depth_first_search.hpp:286:39: required from ‘void boost::depth_first_search(const VertexListGraph&, DFSVisitor, ColorMap, typename graph_traits::vertex_descriptor) [with VertexListGraph = R_adjacency_list; DFSVisitor = detail::tarjan_scc_visitor, long unsigned int>, long unsigned int, long unsigned int&>, iterator_property_map<__gnu_cxx::__normal_iterator >, vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>, iterator_property_map<__gnu_cxx::__normal_iterator >, vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>, std::stack > > >; ColorMap = shared_array_property_map, long unsigned int> >; typename graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/depth_first_search.hpp:397:42: required from ‘void boost::graph::detail::depth_first_search_impl::operator()(const Graph&, const ArgPack&) const [with ArgPack = boost::parameter::aux::arg_list, long unsigned int>, long unsigned int, long unsigned int&>, boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>, boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>, std::stack > > > >, boost::parameter::aux::arg_list, long unsigned int> >, boost::parameter::aux::empty_arg_list, std::integral_constant >, std::integral_constant >; Graph = R_adjacency_list]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/depth_first_search.hpp:406:5: [ skipping 5 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/strong_components.hpp:205:31: required from ‘static typename boost::property_traits::value_type boost::detail::strong_comp_dispatch1::apply(const Graph&, ComponentMap, const boost::bgl_named_params&, boost::param_not_found) [with Graph = R_adjacency_list; ComponentMap = boost::iterator_property_map, long unsigned int>, long unsigned int, long unsigned int&>; P = boost::vec_adj_list_vertex_id_map, long unsigned int>; T = boost::vertex_index_t; R = boost::no_property; typename boost::property_traits::value_type = long unsigned int]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/strong_components.hpp:220:63: required from ‘typename boost::property_traits::value_type boost::detail::scc_helper1(const Graph&, ComponentMap, const boost::bgl_named_params&, RootMap) [with Graph = R_adjacency_list; ComponentMap = boost::iterator_property_map, long unsigned int>, long unsigned int, long unsigned int&>; RootMap = boost::param_not_found; P = boost::vec_adj_list_vertex_id_map, long unsigned int>; T = boost::vertex_index_t; R = boost::no_property; typename boost::property_traits::value_type = long unsigned int]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/strong_components.hpp:235:31: required from ‘typename boost::property_traits::value_type boost::strong_components(const Graph&, ComponentMap, const bgl_named_params&, typename enable_if_c::traversal_category>::value, graph::detail::no_parameter>::type) [with Graph = R_adjacency_list; ComponentMap = iterator_property_map, long unsigned int>, long unsigned int, long unsigned int&>; P = vec_adj_list_vertex_id_map, long unsigned int>; T = vertex_index_t; R = no_property; typename property_traits::value_type = long unsigned int; typename enable_if_c::traversal_category>::value, graph::detail::no_parameter>::type = graph::detail::no_parameter; typename graph_traits::traversal_category = adj_list_dir_traversal_tag]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/transitive_closure.hpp:86:28: required from ‘void boost::transitive_closure(const Graph&, GraphTC&, G_to_TC_VertexMap, VertexIndexMap) [with Graph = R_adjacency_list; GraphTC = R_adjacency_list; G_to_TC_VertexMap = iterator_property_map, long unsigned int>, long unsigned int, long unsigned int&>; VertexIndexMap = vec_adj_list_vertex_id_map, long unsigned int>]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/transitive_closure.hpp:288:23: required from ‘void boost::transitive_closure(const Graph&, GraphTC&) [with Graph = R_adjacency_list; GraphTC = R_adjacency_list]’ transitive_closure.cpp:29:24: required from here /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::concepts::MultiPassInputIterator::~MultiPassInputIterator() [with T = boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator >*, std::vector >, std::allocator > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>]’ 37 | ~model() | ^ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/graph_concepts.hpp:52:50: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 52 | BOOST_concept(MultiPassInputIterator, (T)) { BOOST_CONCEPT_USAGE( | ^~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::concepts::MultiPassInputIterator >*, std::vector >, std::allocator > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> >]’: /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements >*, std::vector >, std::allocator > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/graph_concepts.hpp:52:50: required from ‘struct boost::concepts::MultiPassInputIterator >*, std::vector >, std::allocator > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::concepts::MultiPassInputIterator >*, std::vector >, std::allocator > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> >]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied >*, std::vector >, std::allocator > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::value’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied >*, std::vector >, std::allocator > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:72:8: [ skipping 11 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/strong_components.hpp:205:31: required from ‘static typename boost::property_traits::value_type boost::detail::strong_comp_dispatch1::apply(const Graph&, ComponentMap, const boost::bgl_named_params&, boost::param_not_found) [with Graph = R_adjacency_list; ComponentMap = boost::iterator_property_map, long unsigned int>, long unsigned int, long unsigned int&>; P = boost::vec_adj_list_vertex_id_map, long unsigned int>; T = boost::vertex_index_t; R = boost::no_property; typename boost::property_traits::value_type = long unsigned int]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/strong_components.hpp:220:63: required from ‘typename boost::property_traits::value_type boost::detail::scc_helper1(const Graph&, ComponentMap, const boost::bgl_named_params&, RootMap) [with Graph = R_adjacency_list; ComponentMap = boost::iterator_property_map, long unsigned int>, long unsigned int, long unsigned int&>; RootMap = boost::param_not_found; P = boost::vec_adj_list_vertex_id_map, long unsigned int>; T = boost::vertex_index_t; R = boost::no_property; typename boost::property_traits::value_type = long unsigned int]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/strong_components.hpp:235:31: required from ‘typename boost::property_traits::value_type boost::strong_components(const Graph&, ComponentMap, const bgl_named_params&, typename enable_if_c::traversal_category>::value, graph::detail::no_parameter>::type) [with Graph = R_adjacency_list; ComponentMap = iterator_property_map, long unsigned int>, long unsigned int, long unsigned int&>; P = vec_adj_list_vertex_id_map, long unsigned int>; T = vertex_index_t; R = no_property; typename property_traits::value_type = long unsigned int; typename enable_if_c::traversal_category>::value, graph::detail::no_parameter>::type = graph::detail::no_parameter; typename graph_traits::traversal_category = adj_list_dir_traversal_tag]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/transitive_closure.hpp:86:28: required from ‘void boost::transitive_closure(const Graph&, GraphTC&, G_to_TC_VertexMap, VertexIndexMap) [with Graph = R_adjacency_list; GraphTC = R_adjacency_list; G_to_TC_VertexMap = iterator_property_map, long unsigned int>, long unsigned int, long unsigned int&>; VertexIndexMap = vec_adj_list_vertex_id_map, long unsigned int>]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/transitive_closure.hpp:288:23: required from ‘void boost::transitive_closure(const Graph&, GraphTC&) [with Graph = R_adjacency_list; GraphTC = R_adjacency_list]’ transitive_closure.cpp:29:24: required from here /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::concepts::MultiPassInputIterator::~MultiPassInputIterator() [with T = boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator >*, std::vector >, std::allocator > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>]’ 37 | ~model() | ^ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/graph_concepts.hpp:52:50: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 52 | BOOST_concept(MultiPassInputIterator, (T)) { BOOST_CONCEPT_USAGE( | ^~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements >*, std::vector >, std::allocator > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >]’: /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:145:5: required from ‘struct boost::Assignable >*, std::vector >, std::allocator > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:502:3: required from ‘struct boost::InputIterator >*, std::vector >, std::allocator > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::InputIterator >*, std::vector >, std::allocator > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> >]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied >*, std::vector >, std::allocator > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::value’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied >*, std::vector >, std::allocator > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:72:8: [ skipping 13 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/strong_components.hpp:205:31: required from ‘static typename boost::property_traits::value_type boost::detail::strong_comp_dispatch1::apply(const Graph&, ComponentMap, const boost::bgl_named_params&, boost::param_not_found) [with Graph = R_adjacency_list; ComponentMap = boost::iterator_property_map, long unsigned int>, long unsigned int, long unsigned int&>; P = boost::vec_adj_list_vertex_id_map, long unsigned int>; T = boost::vertex_index_t; R = boost::no_property; typename boost::property_traits::value_type = long unsigned int]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/strong_components.hpp:220:63: required from ‘typename boost::property_traits::value_type boost::detail::scc_helper1(const Graph&, ComponentMap, const boost::bgl_named_params&, RootMap) [with Graph = R_adjacency_list; ComponentMap = boost::iterator_property_map, long unsigned int>, long unsigned int, long unsigned int&>; RootMap = boost::param_not_found; P = boost::vec_adj_list_vertex_id_map, long unsigned int>; T = boost::vertex_index_t; R = boost::no_property; typename boost::property_traits::value_type = long unsigned int]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/strong_components.hpp:235:31: required from ‘typename boost::property_traits::value_type boost::strong_components(const Graph&, ComponentMap, const bgl_named_params&, typename enable_if_c::traversal_category>::value, graph::detail::no_parameter>::type) [with Graph = R_adjacency_list; ComponentMap = iterator_property_map, long unsigned int>, long unsigned int, long unsigned int&>; P = vec_adj_list_vertex_id_map, long unsigned int>; T = vertex_index_t; R = no_property; typename property_traits::value_type = long unsigned int; typename enable_if_c::traversal_category>::value, graph::detail::no_parameter>::type = graph::detail::no_parameter; typename graph_traits::traversal_category = adj_list_dir_traversal_tag]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/transitive_closure.hpp:86:28: required from ‘void boost::transitive_closure(const Graph&, GraphTC&, G_to_TC_VertexMap, VertexIndexMap) [with Graph = R_adjacency_list; GraphTC = R_adjacency_list; G_to_TC_VertexMap = iterator_property_map, long unsigned int>, long unsigned int, long unsigned int&>; VertexIndexMap = vec_adj_list_vertex_id_map, long unsigned int>]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/transitive_closure.hpp:288:23: required from ‘void boost::transitive_closure(const Graph&, GraphTC&) [with Graph = R_adjacency_list; GraphTC = R_adjacency_list]’ transitive_closure.cpp:29:24: required from here /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::Assignable >*, std::vector >, std::allocator > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> >]’ 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ^ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements >*, std::vector >, std::allocator > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >]’: /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:233:5: required from ‘struct boost::EqualityComparable >*, std::vector >, std::allocator > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:502:3: required from ‘struct boost::InputIterator >*, std::vector >, std::allocator > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::InputIterator >*, std::vector >, std::allocator > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> >]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied >*, std::vector >, std::allocator > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::value’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied >*, std::vector >, std::allocator > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:72:8: [ skipping 13 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/strong_components.hpp:205:31: required from ‘static typename boost::property_traits::value_type boost::detail::strong_comp_dispatch1::apply(const Graph&, ComponentMap, const boost::bgl_named_params&, boost::param_not_found) [with Graph = R_adjacency_list; ComponentMap = boost::iterator_property_map, long unsigned int>, long unsigned int, long unsigned int&>; P = boost::vec_adj_list_vertex_id_map, long unsigned int>; T = boost::vertex_index_t; R = boost::no_property; typename boost::property_traits::value_type = long unsigned int]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/strong_components.hpp:220:63: required from ‘typename boost::property_traits::value_type boost::detail::scc_helper1(const Graph&, ComponentMap, const boost::bgl_named_params&, RootMap) [with Graph = R_adjacency_list; ComponentMap = boost::iterator_property_map, long unsigned int>, long unsigned int, long unsigned int&>; RootMap = boost::param_not_found; P = boost::vec_adj_list_vertex_id_map, long unsigned int>; T = boost::vertex_index_t; R = boost::no_property; typename boost::property_traits::value_type = long unsigned int]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/strong_components.hpp:235:31: required from ‘typename boost::property_traits::value_type boost::strong_components(const Graph&, ComponentMap, const bgl_named_params&, typename enable_if_c::traversal_category>::value, graph::detail::no_parameter>::type) [with Graph = R_adjacency_list; ComponentMap = iterator_property_map, long unsigned int>, long unsigned int, long unsigned int&>; P = vec_adj_list_vertex_id_map, long unsigned int>; T = vertex_index_t; R = no_property; typename property_traits::value_type = long unsigned int; typename enable_if_c::traversal_category>::value, graph::detail::no_parameter>::type = graph::detail::no_parameter; typename graph_traits::traversal_category = adj_list_dir_traversal_tag]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/transitive_closure.hpp:86:28: required from ‘void boost::transitive_closure(const Graph&, GraphTC&, G_to_TC_VertexMap, VertexIndexMap) [with Graph = R_adjacency_list; GraphTC = R_adjacency_list; G_to_TC_VertexMap = iterator_property_map, long unsigned int>, long unsigned int, long unsigned int&>; VertexIndexMap = vec_adj_list_vertex_id_map, long unsigned int>]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/transitive_closure.hpp:288:23: required from ‘void boost::transitive_closure(const Graph&, GraphTC&) [with Graph = R_adjacency_list; GraphTC = R_adjacency_list]’ transitive_closure.cpp:29:24: required from here /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::EqualityComparable >*, std::vector >, std::allocator > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> >]’ 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ^ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements >*, std::vector >, std::allocator > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >]’: /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:512:7: required from ‘struct boost::InputIterator >*, std::vector >, std::allocator > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::InputIterator >*, std::vector >, std::allocator > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> >]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied >*, std::vector >, std::allocator > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::value’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied >*, std::vector >, std::allocator > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_ >*, std::vector >, std::allocator > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> >)>’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/graph_concepts.hpp:53:35: [ skipping 12 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/strong_components.hpp:205:31: required from ‘static typename boost::property_traits::value_type boost::detail::strong_comp_dispatch1::apply(const Graph&, ComponentMap, const boost::bgl_named_params&, boost::param_not_found) [with Graph = R_adjacency_list; ComponentMap = boost::iterator_property_map, long unsigned int>, long unsigned int, long unsigned int&>; P = boost::vec_adj_list_vertex_id_map, long unsigned int>; T = boost::vertex_index_t; R = boost::no_property; typename boost::property_traits::value_type = long unsigned int]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/strong_components.hpp:220:63: required from ‘typename boost::property_traits::value_type boost::detail::scc_helper1(const Graph&, ComponentMap, const boost::bgl_named_params&, RootMap) [with Graph = R_adjacency_list; ComponentMap = boost::iterator_property_map, long unsigned int>, long unsigned int, long unsigned int&>; RootMap = boost::param_not_found; P = boost::vec_adj_list_vertex_id_map, long unsigned int>; T = boost::vertex_index_t; R = boost::no_property; typename boost::property_traits::value_type = long unsigned int]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/strong_components.hpp:235:31: required from ‘typename boost::property_traits::value_type boost::strong_components(const Graph&, ComponentMap, const bgl_named_params&, typename enable_if_c::traversal_category>::value, graph::detail::no_parameter>::type) [with Graph = R_adjacency_list; ComponentMap = iterator_property_map, long unsigned int>, long unsigned int, long unsigned int&>; P = vec_adj_list_vertex_id_map, long unsigned int>; T = vertex_index_t; R = no_property; typename property_traits::value_type = long unsigned int; typename enable_if_c::traversal_category>::value, graph::detail::no_parameter>::type = graph::detail::no_parameter; typename graph_traits::traversal_category = adj_list_dir_traversal_tag]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/transitive_closure.hpp:86:28: required from ‘void boost::transitive_closure(const Graph&, GraphTC&, G_to_TC_VertexMap, VertexIndexMap) [with Graph = R_adjacency_list; GraphTC = R_adjacency_list; G_to_TC_VertexMap = iterator_property_map, long unsigned int>, long unsigned int, long unsigned int&>; VertexIndexMap = vec_adj_list_vertex_id_map, long unsigned int>]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/transitive_closure.hpp:288:23: required from ‘void boost::transitive_closure(const Graph&, GraphTC&) [with Graph = R_adjacency_list; GraphTC = R_adjacency_list]’ transitive_closure.cpp:29:24: required from here /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::InputIterator >*, std::vector >, std::allocator > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> >]’ 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ^ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::InputIterator >*, std::vector >, std::allocator > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> >]’: /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/graph_concepts.hpp:53:35: required from ‘boost::concepts::MultiPassInputIterator::~MultiPassInputIterator() [with T = boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator >*, std::vector >, std::allocator > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::MultiPassInputIterator >*, std::vector >, std::allocator > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> >]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/graph_concepts.hpp:89:9: required from ‘boost::concepts::IncidenceGraph::~IncidenceGraph() [with G = R_adjacency_list]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/graph_concepts.hpp:75:1: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::IncidenceGraphConcept >]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/depth_first_search.hpp:129:9: required from ‘void boost::detail::depth_first_visit_impl(const IncidenceGraph&, typename boost::graph_traits::vertex_descriptor, DFSVisitor&, ColorMap, TerminatorFunc) [with IncidenceGraph = R_adjacency_list; DFSVisitor = tarjan_scc_visitor, long unsigned int>, long unsigned int, long unsigned int&>, boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>, boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>, std::stack > > >; ColorMap = boost::shared_array_property_map, long unsigned int> >; TerminatorFunc = nontruth2; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/depth_first_search.hpp:286:39: [ skipping 7 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/strong_components.hpp:205:31: required from ‘static typename boost::property_traits::value_type boost::detail::strong_comp_dispatch1::apply(const Graph&, ComponentMap, const boost::bgl_named_params&, boost::param_not_found) [with Graph = R_adjacency_list; ComponentMap = boost::iterator_property_map, long unsigned int>, long unsigned int, long unsigned int&>; P = boost::vec_adj_list_vertex_id_map, long unsigned int>; T = boost::vertex_index_t; R = boost::no_property; typename boost::property_traits::value_type = long unsigned int]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/strong_components.hpp:220:63: required from ‘typename boost::property_traits::value_type boost::detail::scc_helper1(const Graph&, ComponentMap, const boost::bgl_named_params&, RootMap) [with Graph = R_adjacency_list; ComponentMap = boost::iterator_property_map, long unsigned int>, long unsigned int, long unsigned int&>; RootMap = boost::param_not_found; P = boost::vec_adj_list_vertex_id_map, long unsigned int>; T = boost::vertex_index_t; R = boost::no_property; typename boost::property_traits::value_type = long unsigned int]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/strong_components.hpp:235:31: required from ‘typename boost::property_traits::value_type boost::strong_components(const Graph&, ComponentMap, const bgl_named_params&, typename enable_if_c::traversal_category>::value, graph::detail::no_parameter>::type) [with Graph = R_adjacency_list; ComponentMap = iterator_property_map, long unsigned int>, long unsigned int, long unsigned int&>; P = vec_adj_list_vertex_id_map, long unsigned int>; T = vertex_index_t; R = no_property; typename property_traits::value_type = long unsigned int; typename enable_if_c::traversal_category>::value, graph::detail::no_parameter>::type = graph::detail::no_parameter; typename graph_traits::traversal_category = adj_list_dir_traversal_tag]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/transitive_closure.hpp:86:28: required from ‘void boost::transitive_closure(const Graph&, GraphTC&, G_to_TC_VertexMap, VertexIndexMap) [with Graph = R_adjacency_list; GraphTC = R_adjacency_list; G_to_TC_VertexMap = iterator_property_map, long unsigned int>, long unsigned int, long unsigned int&>; VertexIndexMap = vec_adj_list_vertex_id_map, long unsigned int>]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/transitive_closure.hpp:288:23: required from ‘void boost::transitive_closure(const Graph&, GraphTC&) [with Graph = R_adjacency_list; GraphTC = R_adjacency_list]’ transitive_closure.cpp:29:24: required from here /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::InputIterator::~InputIterator() [with TT = boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator >*, std::vector >, std::allocator > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>]’ 37 | ~model() | ^ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:512:7: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 512 | BOOST_CONCEPT_USAGE(InputIterator) | ^~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::Assignable >*, std::vector >, std::allocator > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> >]’: /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements >*, std::vector >, std::allocator > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:145:5: required from ‘struct boost::Assignable >*, std::vector >, std::allocator > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:502:3: required from ‘struct boost::InputIterator >*, std::vector >, std::allocator > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::InputIterator >*, std::vector >, std::allocator > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> >]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied >*, std::vector >, std::allocator > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::value’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:45:51: [ skipping 14 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/strong_components.hpp:205:31: required from ‘static typename boost::property_traits::value_type boost::detail::strong_comp_dispatch1::apply(const Graph&, ComponentMap, const boost::bgl_named_params&, boost::param_not_found) [with Graph = R_adjacency_list; ComponentMap = boost::iterator_property_map, long unsigned int>, long unsigned int, long unsigned int&>; P = boost::vec_adj_list_vertex_id_map, long unsigned int>; T = boost::vertex_index_t; R = boost::no_property; typename boost::property_traits::value_type = long unsigned int]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/strong_components.hpp:220:63: required from ‘typename boost::property_traits::value_type boost::detail::scc_helper1(const Graph&, ComponentMap, const boost::bgl_named_params&, RootMap) [with Graph = R_adjacency_list; ComponentMap = boost::iterator_property_map, long unsigned int>, long unsigned int, long unsigned int&>; RootMap = boost::param_not_found; P = boost::vec_adj_list_vertex_id_map, long unsigned int>; T = boost::vertex_index_t; R = boost::no_property; typename boost::property_traits::value_type = long unsigned int]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/strong_components.hpp:235:31: required from ‘typename boost::property_traits::value_type boost::strong_components(const Graph&, ComponentMap, const bgl_named_params&, typename enable_if_c::traversal_category>::value, graph::detail::no_parameter>::type) [with Graph = R_adjacency_list; ComponentMap = iterator_property_map, long unsigned int>, long unsigned int, long unsigned int&>; P = vec_adj_list_vertex_id_map, long unsigned int>; T = vertex_index_t; R = no_property; typename property_traits::value_type = long unsigned int; typename enable_if_c::traversal_category>::value, graph::detail::no_parameter>::type = graph::detail::no_parameter; typename graph_traits::traversal_category = adj_list_dir_traversal_tag]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/transitive_closure.hpp:86:28: required from ‘void boost::transitive_closure(const Graph&, GraphTC&, G_to_TC_VertexMap, VertexIndexMap) [with Graph = R_adjacency_list; GraphTC = R_adjacency_list; G_to_TC_VertexMap = iterator_property_map, long unsigned int>, long unsigned int, long unsigned int&>; VertexIndexMap = vec_adj_list_vertex_id_map, long unsigned int>]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/transitive_closure.hpp:288:23: required from ‘void boost::transitive_closure(const Graph&, GraphTC&) [with Graph = R_adjacency_list; GraphTC = R_adjacency_list]’ transitive_closure.cpp:29:24: required from here /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::Assignable::~Assignable() [with TT = boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator >*, std::vector >, std::allocator > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>]’ 37 | ~model() | ^ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:145:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 145 | BOOST_CONCEPT_USAGE(Assignable) { | ^~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::EqualityComparable >*, std::vector >, std::allocator > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> >]’: /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements >*, std::vector >, std::allocator > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:233:5: required from ‘struct boost::EqualityComparable >*, std::vector >, std::allocator > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:502:3: required from ‘struct boost::InputIterator >*, std::vector >, std::allocator > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::InputIterator >*, std::vector >, std::allocator > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> >]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied >*, std::vector >, std::allocator > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::value’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:45:51: [ skipping 14 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/strong_components.hpp:205:31: required from ‘static typename boost::property_traits::value_type boost::detail::strong_comp_dispatch1::apply(const Graph&, ComponentMap, const boost::bgl_named_params&, boost::param_not_found) [with Graph = R_adjacency_list; ComponentMap = boost::iterator_property_map, long unsigned int>, long unsigned int, long unsigned int&>; P = boost::vec_adj_list_vertex_id_map, long unsigned int>; T = boost::vertex_index_t; R = boost::no_property; typename boost::property_traits::value_type = long unsigned int]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/strong_components.hpp:220:63: required from ‘typename boost::property_traits::value_type boost::detail::scc_helper1(const Graph&, ComponentMap, const boost::bgl_named_params&, RootMap) [with Graph = R_adjacency_list; ComponentMap = boost::iterator_property_map, long unsigned int>, long unsigned int, long unsigned int&>; RootMap = boost::param_not_found; P = boost::vec_adj_list_vertex_id_map, long unsigned int>; T = boost::vertex_index_t; R = boost::no_property; typename boost::property_traits::value_type = long unsigned int]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/strong_components.hpp:235:31: required from ‘typename boost::property_traits::value_type boost::strong_components(const Graph&, ComponentMap, const bgl_named_params&, typename enable_if_c::traversal_category>::value, graph::detail::no_parameter>::type) [with Graph = R_adjacency_list; ComponentMap = iterator_property_map, long unsigned int>, long unsigned int, long unsigned int&>; P = vec_adj_list_vertex_id_map, long unsigned int>; T = vertex_index_t; R = no_property; typename property_traits::value_type = long unsigned int; typename enable_if_c::traversal_category>::value, graph::detail::no_parameter>::type = graph::detail::no_parameter; typename graph_traits::traversal_category = adj_list_dir_traversal_tag]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/transitive_closure.hpp:86:28: required from ‘void boost::transitive_closure(const Graph&, GraphTC&, G_to_TC_VertexMap, VertexIndexMap) [with Graph = R_adjacency_list; GraphTC = R_adjacency_list; G_to_TC_VertexMap = iterator_property_map, long unsigned int>, long unsigned int, long unsigned int&>; VertexIndexMap = vec_adj_list_vertex_id_map, long unsigned int>]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/transitive_closure.hpp:288:23: required from ‘void boost::transitive_closure(const Graph&, GraphTC&) [with Graph = R_adjacency_list; GraphTC = R_adjacency_list]’ transitive_closure.cpp:29:24: required from here /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::EqualityComparable::~EqualityComparable() [with TT = boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator >*, std::vector >, std::allocator > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>]’ 37 | ~model() | ^ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:233:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 233 | BOOST_CONCEPT_USAGE(EqualityComparable) { | ^~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::InputIterator >*, std::vector >, std::allocator > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> >]’: /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements >*, std::vector >, std::allocator > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:512:7: required from ‘struct boost::InputIterator >*, std::vector >, std::allocator > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::InputIterator >*, std::vector >, std::allocator > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> >]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied >*, std::vector >, std::allocator > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::value’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied >*, std::vector >, std::allocator > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/detail/general.hpp:72:8: [ skipping 13 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/strong_components.hpp:205:31: required from ‘static typename boost::property_traits::value_type boost::detail::strong_comp_dispatch1::apply(const Graph&, ComponentMap, const boost::bgl_named_params&, boost::param_not_found) [with Graph = R_adjacency_list; ComponentMap = boost::iterator_property_map, long unsigned int>, long unsigned int, long unsigned int&>; P = boost::vec_adj_list_vertex_id_map, long unsigned int>; T = boost::vertex_index_t; R = boost::no_property; typename boost::property_traits::value_type = long unsigned int]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/strong_components.hpp:220:63: required from ‘typename boost::property_traits::value_type boost::detail::scc_helper1(const Graph&, ComponentMap, const boost::bgl_named_params&, RootMap) [with Graph = R_adjacency_list; ComponentMap = boost::iterator_property_map, long unsigned int>, long unsigned int, long unsigned int&>; RootMap = boost::param_not_found; P = boost::vec_adj_list_vertex_id_map, long unsigned int>; T = boost::vertex_index_t; R = boost::no_property; typename boost::property_traits::value_type = long unsigned int]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/strong_components.hpp:235:31: required from ‘typename boost::property_traits::value_type boost::strong_components(const Graph&, ComponentMap, const bgl_named_params&, typename enable_if_c::traversal_category>::value, graph::detail::no_parameter>::type) [with Graph = R_adjacency_list; ComponentMap = iterator_property_map, long unsigned int>, long unsigned int, long unsigned int&>; P = vec_adj_list_vertex_id_map, long unsigned int>; T = vertex_index_t; R = no_property; typename property_traits::value_type = long unsigned int; typename enable_if_c::traversal_category>::value, graph::detail::no_parameter>::type = graph::detail::no_parameter; typename graph_traits::traversal_category = adj_list_dir_traversal_tag]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/transitive_closure.hpp:86:28: required from ‘void boost::transitive_closure(const Graph&, GraphTC&, G_to_TC_VertexMap, VertexIndexMap) [with Graph = R_adjacency_list; GraphTC = R_adjacency_list; G_to_TC_VertexMap = iterator_property_map, long unsigned int>, long unsigned int, long unsigned int&>; VertexIndexMap = vec_adj_list_vertex_id_map, long unsigned int>]’ /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/transitive_closure.hpp:288:23: required from ‘void boost::transitive_closure(const Graph&, GraphTC&) [with Graph = R_adjacency_list; GraphTC = R_adjacency_list]’ transitive_closure.cpp:29:24: required from here /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::InputIterator::~InputIterator() [with TT = boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator >*, std::vector >, std::allocator > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>]’ 37 | ~model() | ^ /home/omnipath/local/R/4.4-3.20/BH/include/boost/concept_check.hpp:512:7: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 512 | BOOST_CONCEPT_USAGE(InputIterator) | ^~~~~~~~~~~~~~~~~~~ g++ -std=gnu++17 -I"/usr/share/R/include" -DNDEBUG -I'/home/omnipath/local/R/4.4-3.20/BH/include' -fpic -g -O2 -fno-omit-frame-pointer -mno-omit-leaf-frame-pointer -ffile-prefix-map=/build/r-base-EawLoD/r-base-4.4.1=. -fstack-protector-strong -fstack-clash-protection -Wformat -Werror=format-security -fcf-protection -fdebug-prefix-map=/build/r-base-EawLoD/r-base-4.4.1=/usr/src/r-base-4.4.1-1.2404.0 -Wdate-time -D_FORTIFY_SOURCE=3 -c wavefront.cpp -o wavefront.o In file included from /home/omnipath/local/R/4.4-3.20/BH/include/boost/smart_ptr/shared_ptr.hpp:18, from /home/omnipath/local/R/4.4-3.20/BH/include/boost/property_map/vector_property_map.hpp:14, from /home/omnipath/local/R/4.4-3.20/BH/include/boost/property_map/property_map.hpp:598, from RBGL.hpp:17, from wavefront.cpp:1: /home/omnipath/local/R/4.4-3.20/BH/include/boost/smart_ptr/detail/shared_count.hpp:361:33: warning: ‘template class std::auto_ptr’ is deprecated: use 'std::unique_ptr' instead [-Wdeprecated-declarations] 361 | explicit shared_count( std::auto_ptr & r ): pi_( new sp_counted_impl_p( r.get() ) ) | ^~~~~~~~ In file included from /usr/include/c++/13/memory:78, from /home/omnipath/local/R/4.4-3.20/BH/include/boost/smart_ptr/detail/sp_counted_impl.hpp:35, from /home/omnipath/local/R/4.4-3.20/BH/include/boost/smart_ptr/detail/shared_count.hpp:27: /usr/include/c++/13/bits/unique_ptr.h:65:28: note: declared here 65 | template class auto_ptr; | ^~~~~~~~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/smart_ptr/shared_ptr.hpp:251:65: warning: ‘template class std::auto_ptr’ is deprecated: use 'std::unique_ptr' instead [-Wdeprecated-declarations] 251 | template< class T, class R > struct sp_enable_if_auto_ptr< std::auto_ptr< T >, R > | ^~~~~~~~ /usr/include/c++/13/bits/unique_ptr.h:65:28: note: declared here 65 | template class auto_ptr; | ^~~~~~~~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/smart_ptr/shared_ptr.hpp:508:31: warning: ‘template class std::auto_ptr’ is deprecated: use 'std::unique_ptr' instead [-Wdeprecated-declarations] 508 | explicit shared_ptr( std::auto_ptr & r ): px(r.get()), pn() | ^~~~~~~~ /usr/include/c++/13/bits/unique_ptr.h:65:28: note: declared here 65 | template class auto_ptr; | ^~~~~~~~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/smart_ptr/shared_ptr.hpp:521:22: warning: ‘template class std::auto_ptr’ is deprecated: use 'std::unique_ptr' instead [-Wdeprecated-declarations] 521 | shared_ptr( std::auto_ptr && r ): px(r.get()), pn() | ^~~~~~~~ /usr/include/c++/13/bits/unique_ptr.h:65:28: note: declared here 65 | template class auto_ptr; | ^~~~~~~~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/smart_ptr/shared_ptr.hpp:604:34: warning: ‘template class std::auto_ptr’ is deprecated: use 'std::unique_ptr' instead [-Wdeprecated-declarations] 604 | shared_ptr & operator=( std::auto_ptr & r ) | ^~~~~~~~ /usr/include/c++/13/bits/unique_ptr.h:65:28: note: declared here 65 | template class auto_ptr; | ^~~~~~~~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/smart_ptr/shared_ptr.hpp:613:34: warning: ‘template class std::auto_ptr’ is deprecated: use 'std::unique_ptr' instead [-Wdeprecated-declarations] 613 | shared_ptr & operator=( std::auto_ptr && r ) | ^~~~~~~~ /usr/include/c++/13/bits/unique_ptr.h:65:28: note: declared here 65 | template class auto_ptr; | ^~~~~~~~ /home/omnipath/local/R/4.4-3.20/BH/include/boost/smart_ptr/shared_ptr.hpp: In member function ‘boost::shared_ptr& boost::shared_ptr::operator=(std::auto_ptr<_Up>&&)’: /home/omnipath/local/R/4.4-3.20/BH/include/boost/smart_ptr/shared_ptr.hpp:615:38: warning: ‘template class std::auto_ptr’ is deprecated: use 'std::unique_ptr' instead [-Wdeprecated-declarations] 615 | this_type( static_cast< std::auto_ptr && >( r ) ).swap( *this ); | ^~~~~~~~ /usr/include/c++/13/bits/unique_ptr.h:65:28: note: declared here 65 | template class auto_ptr; | ^~~~~~~~ In file included from /home/omnipath/local/R/4.4-3.20/BH/include/boost/scoped_ptr.hpp:13, from /home/omnipath/local/R/4.4-3.20/BH/include/boost/graph/adjacency_list.hpp:22, from RBGL.hpp:38: /home/omnipath/local/R/4.4-3.20/BH/include/boost/smart_ptr/scoped_ptr.hpp: At global scope: /home/omnipath/local/R/4.4-3.20/BH/include/boost/smart_ptr/scoped_ptr.hpp:75:31: warning: ‘template class std::auto_ptr’ is deprecated: use 'std::unique_ptr' instead [-Wdeprecated-declarations] 75 | explicit scoped_ptr( std::auto_ptr p ) BOOST_SP_NOEXCEPT : px( p.release() ) | ^~~~~~~~ /usr/include/c++/13/bits/unique_ptr.h:65:28: note: declared here 65 | template class auto_ptr; | ^~~~~~~~ g++ -std=gnu++17 -shared -L/usr/lib/R/lib -Wl,-Bsymbolic-functions -flto=auto -ffat-lto-objects -Wl,-z,relro -o RBGL.so bbc.o cliques.o clusteringCoef.o dominatorTree.o edmonds_optimum_branching.o hcs.o incrConnComp.o interfaces.o minST.o mincut.o ordering.o planar.o registerSigHandlers.o shortestPath.o sna.o transitive_closure.o wavefront.o -L/usr/lib/R/lib -lR installing to /home/omnipath/local/R/4.4-3.20/00LOCK-RBGL/00new/RBGL/libs ** R ** data ** inst ** byte-compile and prepare package for lazy loading ** help *** installing help indices ** building package indices ** installing vignettes ** testing if installed package can be loaded from temporary location ** checking absolute paths in shared objects and dynamic libraries ** testing if installed package can be loaded from final location ** testing if installed package keeps a record of temporary installation path * DONE (RBGL) * installing *source* package ‘openssl’ ... ** package ‘openssl’ successfully unpacked and MD5 sums checked ** using staged installation Found pkg-config cflags and libs! Using PKG_CFLAGS= Using PKG_LIBS=-l:libssl.so.3 -l:libcrypto.so.3 ** libs using C compiler: ‘gcc (Ubuntu 13.2.0-23ubuntu4) 13.2.0’ rm -f aes.o base64.o bignum.o cert.o compatibility.o diffie.o envelope.o error.o hash.o info.o keygen.o keys.o onload.o openssh.o password.o pbkdf.o pem.o pkcs12.o pkcs7.o rand.o rsa.o signing.o ssl.o stream.o write.o x25519.o openssl.so bcrypt/libstatbcrypt.a bcrypt/bcrypt_pbkdf.o bcrypt/blowfish.o gcc -I"/usr/share/R/include" -DNDEBUG -DOPENSSL_SUPPRESS_DEPRECATED -fpic -g -O2 -fno-omit-frame-pointer -mno-omit-leaf-frame-pointer -ffile-prefix-map=/build/r-base-EawLoD/r-base-4.4.1=. -fstack-protector-strong -fstack-clash-protection -Wformat -Werror=format-security -fcf-protection -fdebug-prefix-map=/build/r-base-EawLoD/r-base-4.4.1=/usr/src/r-base-4.4.1-1.2404.0 -Wdate-time -D_FORTIFY_SOURCE=3 -c aes.c -o aes.o gcc -I"/usr/share/R/include" -DNDEBUG -DOPENSSL_SUPPRESS_DEPRECATED -fpic -g -O2 -fno-omit-frame-pointer -mno-omit-leaf-frame-pointer -ffile-prefix-map=/build/r-base-EawLoD/r-base-4.4.1=. -fstack-protector-strong -fstack-clash-protection -Wformat -Werror=format-security -fcf-protection -fdebug-prefix-map=/build/r-base-EawLoD/r-base-4.4.1=/usr/src/r-base-4.4.1-1.2404.0 -Wdate-time -D_FORTIFY_SOURCE=3 -c base64.c -o base64.o gcc -I"/usr/share/R/include" -DNDEBUG -DOPENSSL_SUPPRESS_DEPRECATED -fpic -g -O2 -fno-omit-frame-pointer -mno-omit-leaf-frame-pointer -ffile-prefix-map=/build/r-base-EawLoD/r-base-4.4.1=. -fstack-protector-strong -fstack-clash-protection -Wformat -Werror=format-security -fcf-protection -fdebug-prefix-map=/build/r-base-EawLoD/r-base-4.4.1=/usr/src/r-base-4.4.1-1.2404.0 -Wdate-time -D_FORTIFY_SOURCE=3 -c bignum.c -o bignum.o gcc -I"/usr/share/R/include" -DNDEBUG -DOPENSSL_SUPPRESS_DEPRECATED -fpic -g -O2 -fno-omit-frame-pointer -mno-omit-leaf-frame-pointer -ffile-prefix-map=/build/r-base-EawLoD/r-base-4.4.1=. -fstack-protector-strong -fstack-clash-protection -Wformat -Werror=format-security -fcf-protection -fdebug-prefix-map=/build/r-base-EawLoD/r-base-4.4.1=/usr/src/r-base-4.4.1-1.2404.0 -Wdate-time -D_FORTIFY_SOURCE=3 -c cert.c -o cert.o gcc -I"/usr/share/R/include" -DNDEBUG -DOPENSSL_SUPPRESS_DEPRECATED -fpic -g -O2 -fno-omit-frame-pointer -mno-omit-leaf-frame-pointer -ffile-prefix-map=/build/r-base-EawLoD/r-base-4.4.1=. -fstack-protector-strong -fstack-clash-protection -Wformat -Werror=format-security -fcf-protection -fdebug-prefix-map=/build/r-base-EawLoD/r-base-4.4.1=/usr/src/r-base-4.4.1-1.2404.0 -Wdate-time -D_FORTIFY_SOURCE=3 -c compatibility.c -o compatibility.o gcc -I"/usr/share/R/include" -DNDEBUG -DOPENSSL_SUPPRESS_DEPRECATED -fpic -g -O2 -fno-omit-frame-pointer -mno-omit-leaf-frame-pointer -ffile-prefix-map=/build/r-base-EawLoD/r-base-4.4.1=. -fstack-protector-strong -fstack-clash-protection -Wformat -Werror=format-security -fcf-protection -fdebug-prefix-map=/build/r-base-EawLoD/r-base-4.4.1=/usr/src/r-base-4.4.1-1.2404.0 -Wdate-time -D_FORTIFY_SOURCE=3 -c diffie.c -o diffie.o gcc -I"/usr/share/R/include" -DNDEBUG -DOPENSSL_SUPPRESS_DEPRECATED -fpic -g -O2 -fno-omit-frame-pointer -mno-omit-leaf-frame-pointer -ffile-prefix-map=/build/r-base-EawLoD/r-base-4.4.1=. -fstack-protector-strong -fstack-clash-protection -Wformat -Werror=format-security -fcf-protection -fdebug-prefix-map=/build/r-base-EawLoD/r-base-4.4.1=/usr/src/r-base-4.4.1-1.2404.0 -Wdate-time -D_FORTIFY_SOURCE=3 -c envelope.c -o envelope.o gcc -I"/usr/share/R/include" -DNDEBUG -DOPENSSL_SUPPRESS_DEPRECATED -fpic -g -O2 -fno-omit-frame-pointer -mno-omit-leaf-frame-pointer -ffile-prefix-map=/build/r-base-EawLoD/r-base-4.4.1=. -fstack-protector-strong -fstack-clash-protection -Wformat -Werror=format-security -fcf-protection -fdebug-prefix-map=/build/r-base-EawLoD/r-base-4.4.1=/usr/src/r-base-4.4.1-1.2404.0 -Wdate-time -D_FORTIFY_SOURCE=3 -c error.c -o error.o gcc -I"/usr/share/R/include" -DNDEBUG -DOPENSSL_SUPPRESS_DEPRECATED -fpic -g -O2 -fno-omit-frame-pointer -mno-omit-leaf-frame-pointer -ffile-prefix-map=/build/r-base-EawLoD/r-base-4.4.1=. -fstack-protector-strong -fstack-clash-protection -Wformat -Werror=format-security -fcf-protection -fdebug-prefix-map=/build/r-base-EawLoD/r-base-4.4.1=/usr/src/r-base-4.4.1-1.2404.0 -Wdate-time -D_FORTIFY_SOURCE=3 -c hash.c -o hash.o gcc -I"/usr/share/R/include" -DNDEBUG -DOPENSSL_SUPPRESS_DEPRECATED -fpic -g -O2 -fno-omit-frame-pointer -mno-omit-leaf-frame-pointer -ffile-prefix-map=/build/r-base-EawLoD/r-base-4.4.1=. -fstack-protector-strong -fstack-clash-protection -Wformat -Werror=format-security -fcf-protection -fdebug-prefix-map=/build/r-base-EawLoD/r-base-4.4.1=/usr/src/r-base-4.4.1-1.2404.0 -Wdate-time -D_FORTIFY_SOURCE=3 -c info.c -o info.o gcc -I"/usr/share/R/include" -DNDEBUG -DOPENSSL_SUPPRESS_DEPRECATED -fpic -g -O2 -fno-omit-frame-pointer -mno-omit-leaf-frame-pointer -ffile-prefix-map=/build/r-base-EawLoD/r-base-4.4.1=. -fstack-protector-strong -fstack-clash-protection -Wformat -Werror=format-security -fcf-protection -fdebug-prefix-map=/build/r-base-EawLoD/r-base-4.4.1=/usr/src/r-base-4.4.1-1.2404.0 -Wdate-time -D_FORTIFY_SOURCE=3 -c keygen.c -o keygen.o gcc -I"/usr/share/R/include" -DNDEBUG -DOPENSSL_SUPPRESS_DEPRECATED -fpic -g -O2 -fno-omit-frame-pointer -mno-omit-leaf-frame-pointer -ffile-prefix-map=/build/r-base-EawLoD/r-base-4.4.1=. -fstack-protector-strong -fstack-clash-protection -Wformat -Werror=format-security -fcf-protection -fdebug-prefix-map=/build/r-base-EawLoD/r-base-4.4.1=/usr/src/r-base-4.4.1-1.2404.0 -Wdate-time -D_FORTIFY_SOURCE=3 -c keys.c -o keys.o gcc -I"/usr/share/R/include" -DNDEBUG -DOPENSSL_SUPPRESS_DEPRECATED -fpic -g -O2 -fno-omit-frame-pointer -mno-omit-leaf-frame-pointer -ffile-prefix-map=/build/r-base-EawLoD/r-base-4.4.1=. -fstack-protector-strong -fstack-clash-protection -Wformat -Werror=format-security -fcf-protection -fdebug-prefix-map=/build/r-base-EawLoD/r-base-4.4.1=/usr/src/r-base-4.4.1-1.2404.0 -Wdate-time -D_FORTIFY_SOURCE=3 -c onload.c -o onload.o gcc -I"/usr/share/R/include" -DNDEBUG -DOPENSSL_SUPPRESS_DEPRECATED -fpic -g -O2 -fno-omit-frame-pointer -mno-omit-leaf-frame-pointer -ffile-prefix-map=/build/r-base-EawLoD/r-base-4.4.1=. -fstack-protector-strong -fstack-clash-protection -Wformat -Werror=format-security -fcf-protection -fdebug-prefix-map=/build/r-base-EawLoD/r-base-4.4.1=/usr/src/r-base-4.4.1-1.2404.0 -Wdate-time -D_FORTIFY_SOURCE=3 -c openssh.c -o openssh.o gcc -I"/usr/share/R/include" -DNDEBUG -DOPENSSL_SUPPRESS_DEPRECATED -fpic -g -O2 -fno-omit-frame-pointer -mno-omit-leaf-frame-pointer -ffile-prefix-map=/build/r-base-EawLoD/r-base-4.4.1=. -fstack-protector-strong -fstack-clash-protection -Wformat -Werror=format-security -fcf-protection -fdebug-prefix-map=/build/r-base-EawLoD/r-base-4.4.1=/usr/src/r-base-4.4.1-1.2404.0 -Wdate-time -D_FORTIFY_SOURCE=3 -c password.c -o password.o gcc -I"/usr/share/R/include" -DNDEBUG -DOPENSSL_SUPPRESS_DEPRECATED -fpic -g -O2 -fno-omit-frame-pointer -mno-omit-leaf-frame-pointer -ffile-prefix-map=/build/r-base-EawLoD/r-base-4.4.1=. -fstack-protector-strong -fstack-clash-protection -Wformat -Werror=format-security -fcf-protection -fdebug-prefix-map=/build/r-base-EawLoD/r-base-4.4.1=/usr/src/r-base-4.4.1-1.2404.0 -Wdate-time -D_FORTIFY_SOURCE=3 -c pbkdf.c -o pbkdf.o gcc -I"/usr/share/R/include" -DNDEBUG -DOPENSSL_SUPPRESS_DEPRECATED -fpic -g -O2 -fno-omit-frame-pointer -mno-omit-leaf-frame-pointer -ffile-prefix-map=/build/r-base-EawLoD/r-base-4.4.1=. -fstack-protector-strong -fstack-clash-protection -Wformat -Werror=format-security -fcf-protection -fdebug-prefix-map=/build/r-base-EawLoD/r-base-4.4.1=/usr/src/r-base-4.4.1-1.2404.0 -Wdate-time -D_FORTIFY_SOURCE=3 -c pem.c -o pem.o gcc -I"/usr/share/R/include" -DNDEBUG -DOPENSSL_SUPPRESS_DEPRECATED -fpic -g -O2 -fno-omit-frame-pointer -mno-omit-leaf-frame-pointer -ffile-prefix-map=/build/r-base-EawLoD/r-base-4.4.1=. -fstack-protector-strong -fstack-clash-protection -Wformat -Werror=format-security -fcf-protection -fdebug-prefix-map=/build/r-base-EawLoD/r-base-4.4.1=/usr/src/r-base-4.4.1-1.2404.0 -Wdate-time -D_FORTIFY_SOURCE=3 -c pkcs12.c -o pkcs12.o gcc -I"/usr/share/R/include" -DNDEBUG -DOPENSSL_SUPPRESS_DEPRECATED -fpic -g -O2 -fno-omit-frame-pointer -mno-omit-leaf-frame-pointer -ffile-prefix-map=/build/r-base-EawLoD/r-base-4.4.1=. -fstack-protector-strong -fstack-clash-protection -Wformat -Werror=format-security -fcf-protection -fdebug-prefix-map=/build/r-base-EawLoD/r-base-4.4.1=/usr/src/r-base-4.4.1-1.2404.0 -Wdate-time -D_FORTIFY_SOURCE=3 -c pkcs7.c -o pkcs7.o gcc -I"/usr/share/R/include" -DNDEBUG -DOPENSSL_SUPPRESS_DEPRECATED -fpic -g -O2 -fno-omit-frame-pointer -mno-omit-leaf-frame-pointer -ffile-prefix-map=/build/r-base-EawLoD/r-base-4.4.1=. -fstack-protector-strong -fstack-clash-protection -Wformat -Werror=format-security -fcf-protection -fdebug-prefix-map=/build/r-base-EawLoD/r-base-4.4.1=/usr/src/r-base-4.4.1-1.2404.0 -Wdate-time -D_FORTIFY_SOURCE=3 -c rand.c -o rand.o gcc -I"/usr/share/R/include" -DNDEBUG -DOPENSSL_SUPPRESS_DEPRECATED -fpic -g -O2 -fno-omit-frame-pointer -mno-omit-leaf-frame-pointer -ffile-prefix-map=/build/r-base-EawLoD/r-base-4.4.1=. -fstack-protector-strong -fstack-clash-protection -Wformat -Werror=format-security -fcf-protection -fdebug-prefix-map=/build/r-base-EawLoD/r-base-4.4.1=/usr/src/r-base-4.4.1-1.2404.0 -Wdate-time -D_FORTIFY_SOURCE=3 -c rsa.c -o rsa.o gcc -I"/usr/share/R/include" -DNDEBUG -DOPENSSL_SUPPRESS_DEPRECATED -fpic -g -O2 -fno-omit-frame-pointer -mno-omit-leaf-frame-pointer -ffile-prefix-map=/build/r-base-EawLoD/r-base-4.4.1=. -fstack-protector-strong -fstack-clash-protection -Wformat -Werror=format-security -fcf-protection -fdebug-prefix-map=/build/r-base-EawLoD/r-base-4.4.1=/usr/src/r-base-4.4.1-1.2404.0 -Wdate-time -D_FORTIFY_SOURCE=3 -c signing.c -o signing.o gcc -I"/usr/share/R/include" -DNDEBUG -DOPENSSL_SUPPRESS_DEPRECATED -fpic -g -O2 -fno-omit-frame-pointer -mno-omit-leaf-frame-pointer -ffile-prefix-map=/build/r-base-EawLoD/r-base-4.4.1=. -fstack-protector-strong -fstack-clash-protection -Wformat -Werror=format-security -fcf-protection -fdebug-prefix-map=/build/r-base-EawLoD/r-base-4.4.1=/usr/src/r-base-4.4.1-1.2404.0 -Wdate-time -D_FORTIFY_SOURCE=3 -c ssl.c -o ssl.o gcc -I"/usr/share/R/include" -DNDEBUG -DOPENSSL_SUPPRESS_DEPRECATED -fpic -g -O2 -fno-omit-frame-pointer -mno-omit-leaf-frame-pointer -ffile-prefix-map=/build/r-base-EawLoD/r-base-4.4.1=. -fstack-protector-strong -fstack-clash-protection -Wformat -Werror=format-security -fcf-protection -fdebug-prefix-map=/build/r-base-EawLoD/r-base-4.4.1=/usr/src/r-base-4.4.1-1.2404.0 -Wdate-time -D_FORTIFY_SOURCE=3 -c stream.c -o stream.o gcc -I"/usr/share/R/include" -DNDEBUG -DOPENSSL_SUPPRESS_DEPRECATED -fpic -g -O2 -fno-omit-frame-pointer -mno-omit-leaf-frame-pointer -ffile-prefix-map=/build/r-base-EawLoD/r-base-4.4.1=. -fstack-protector-strong -fstack-clash-protection -Wformat -Werror=format-security -fcf-protection -fdebug-prefix-map=/build/r-base-EawLoD/r-base-4.4.1=/usr/src/r-base-4.4.1-1.2404.0 -Wdate-time -D_FORTIFY_SOURCE=3 -c write.c -o write.o gcc -I"/usr/share/R/include" -DNDEBUG -DOPENSSL_SUPPRESS_DEPRECATED -fpic -g -O2 -fno-omit-frame-pointer -mno-omit-leaf-frame-pointer -ffile-prefix-map=/build/r-base-EawLoD/r-base-4.4.1=. -fstack-protector-strong -fstack-clash-protection -Wformat -Werror=format-security -fcf-protection -fdebug-prefix-map=/build/r-base-EawLoD/r-base-4.4.1=/usr/src/r-base-4.4.1-1.2404.0 -Wdate-time -D_FORTIFY_SOURCE=3 -c x25519.c -o x25519.o gcc -I"/usr/share/R/include" -DNDEBUG -DOPENSSL_SUPPRESS_DEPRECATED -fpic -g -O2 -fno-omit-frame-pointer -mno-omit-leaf-frame-pointer -ffile-prefix-map=/build/r-base-EawLoD/r-base-4.4.1=. -fstack-protector-strong -fstack-clash-protection -Wformat -Werror=format-security -fcf-protection -fdebug-prefix-map=/build/r-base-EawLoD/r-base-4.4.1=/usr/src/r-base-4.4.1-1.2404.0 -Wdate-time -D_FORTIFY_SOURCE=3 -c bcrypt/bcrypt_pbkdf.c -o bcrypt/bcrypt_pbkdf.o gcc -I"/usr/share/R/include" -DNDEBUG -DOPENSSL_SUPPRESS_DEPRECATED -fpic -g -O2 -fno-omit-frame-pointer -mno-omit-leaf-frame-pointer -ffile-prefix-map=/build/r-base-EawLoD/r-base-4.4.1=. -fstack-protector-strong -fstack-clash-protection -Wformat -Werror=format-security -fcf-protection -fdebug-prefix-map=/build/r-base-EawLoD/r-base-4.4.1=/usr/src/r-base-4.4.1-1.2404.0 -Wdate-time -D_FORTIFY_SOURCE=3 -c bcrypt/blowfish.c -o bcrypt/blowfish.o ar rcs bcrypt/libstatbcrypt.a bcrypt/bcrypt_pbkdf.o bcrypt/blowfish.o gcc -shared -L/usr/lib/R/lib -Wl,-Bsymbolic-functions -flto=auto -ffat-lto-objects -Wl,-z,relro -o openssl.so aes.o base64.o bignum.o cert.o compatibility.o diffie.o envelope.o error.o hash.o info.o keygen.o keys.o onload.o openssh.o password.o pbkdf.o pem.o pkcs12.o pkcs7.o rand.o rsa.o signing.o ssl.o stream.o write.o x25519.o -Lbcrypt -lstatbcrypt -l:libssl.so.3 -l:libcrypto.so.3 -L/usr/lib/R/lib -lR installing to /home/omnipath/local/R/4.4-3.20/00LOCK-openssl/00new/openssl/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 (openssl) * installing *source* package ‘vctrs’ ... ** package ‘vctrs’ successfully unpacked and MD5 sums checked ** using staged installation ** libs using C compiler: ‘gcc (Ubuntu 13.2.0-23ubuntu4) 13.2.0’ gcc -I"/usr/share/R/include" -DNDEBUG -I./rlang -fvisibility=hidden -fpic -g -O2 -fno-omit-frame-pointer -mno-omit-leaf-frame-pointer -ffile-prefix-map=/build/r-base-EawLoD/r-base-4.4.1=. -fstack-protector-strong -fstack-clash-protection -Wformat -Werror=format-security -fcf-protection -fdebug-prefix-map=/build/r-base-EawLoD/r-base-4.4.1=/usr/src/r-base-4.4.1-1.2404.0 -Wdate-time -D_FORTIFY_SOURCE=3 -c altrep-lazy-character.c -o altrep-lazy-character.o gcc -I"/usr/share/R/include" -DNDEBUG -I./rlang -fvisibility=hidden -fpic -g -O2 -fno-omit-frame-pointer -mno-omit-leaf-frame-pointer -ffile-prefix-map=/build/r-base-EawLoD/r-base-4.4.1=. -fstack-protector-strong -fstack-clash-protection -Wformat -Werror=format-security -fcf-protection -fdebug-prefix-map=/build/r-base-EawLoD/r-base-4.4.1=/usr/src/r-base-4.4.1-1.2404.0 -Wdate-time -D_FORTIFY_SOURCE=3 -c altrep-rle.c -o altrep-rle.o gcc -I"/usr/share/R/include" -DNDEBUG -I./rlang -fvisibility=hidden -fpic -g -O2 -fno-omit-frame-pointer -mno-omit-leaf-frame-pointer -ffile-prefix-map=/build/r-base-EawLoD/r-base-4.4.1=. -fstack-protector-strong -fstack-clash-protection -Wformat -Werror=format-security -fcf-protection -fdebug-prefix-map=/build/r-base-EawLoD/r-base-4.4.1=/usr/src/r-base-4.4.1-1.2404.0 -Wdate-time -D_FORTIFY_SOURCE=3 -c altrep.c -o altrep.o gcc -I"/usr/share/R/include" -DNDEBUG -I./rlang -fvisibility=hidden -fpic -g -O2 -fno-omit-frame-pointer -mno-omit-leaf-frame-pointer -ffile-prefix-map=/build/r-base-EawLoD/r-base-4.4.1=. -fstack-protector-strong -fstack-clash-protection -Wformat -Werror=format-security -fcf-protection -fdebug-prefix-map=/build/r-base-EawLoD/r-base-4.4.1=/usr/src/r-base-4.4.1-1.2404.0 -Wdate-time -D_FORTIFY_SOURCE=3 -c arg-counter.c -o arg-counter.o gcc -I"/usr/share/R/include" -DNDEBUG -I./rlang -fvisibility=hidden -fpic -g -O2 -fno-omit-frame-pointer -mno-omit-leaf-frame-pointer -ffile-prefix-map=/build/r-base-EawLoD/r-base-4.4.1=. -fstack-protector-strong -fstack-clash-protection -Wformat -Werror=format-security -fcf-protection -fdebug-prefix-map=/build/r-base-EawLoD/r-base-4.4.1=/usr/src/r-base-4.4.1-1.2404.0 -Wdate-time -D_FORTIFY_SOURCE=3 -c arg.c -o arg.o gcc -I"/usr/share/R/include" -DNDEBUG -I./rlang -fvisibility=hidden -fpic -g -O2 -fno-omit-frame-pointer -mno-omit-leaf-frame-pointer -ffile-prefix-map=/build/r-base-EawLoD/r-base-4.4.1=. -fstack-protector-strong -fstack-clash-protection -Wformat -Werror=format-security -fcf-protection -fdebug-prefix-map=/build/r-base-EawLoD/r-base-4.4.1=/usr/src/r-base-4.4.1-1.2404.0 -Wdate-time -D_FORTIFY_SOURCE=3 -c assert.c -o assert.o gcc -I"/usr/share/R/include" -DNDEBUG -I./rlang -fvisibility=hidden -fpic -g -O2 -fno-omit-frame-pointer -mno-omit-leaf-frame-pointer -ffile-prefix-map=/build/r-base-EawLoD/r-base-4.4.1=. -fstack-protector-strong -fstack-clash-protection -Wformat -Werror=format-security -fcf-protection -fdebug-prefix-map=/build/r-base-EawLoD/r-base-4.4.1=/usr/src/r-base-4.4.1-1.2404.0 -Wdate-time -D_FORTIFY_SOURCE=3 -c bind.c -o bind.o gcc -I"/usr/share/R/include" -DNDEBUG -I./rlang -fvisibility=hidden -fpic -g -O2 -fno-omit-frame-pointer -mno-omit-leaf-frame-pointer -ffile-prefix-map=/build/r-base-EawLoD/r-base-4.4.1=. -fstack-protector-strong -fstack-clash-protection -Wformat -Werror=format-security -fcf-protection -fdebug-prefix-map=/build/r-base-EawLoD/r-base-4.4.1=/usr/src/r-base-4.4.1-1.2404.0 -Wdate-time -D_FORTIFY_SOURCE=3 -c c-unchop.c -o c-unchop.o gcc -I"/usr/share/R/include" -DNDEBUG -I./rlang -fvisibility=hidden -fpic -g -O2 -fno-omit-frame-pointer -mno-omit-leaf-frame-pointer -ffile-prefix-map=/build/r-base-EawLoD/r-base-4.4.1=. -fstack-protector-strong -fstack-clash-protection -Wformat -Werror=format-security -fcf-protection -fdebug-prefix-map=/build/r-base-EawLoD/r-base-4.4.1=/usr/src/r-base-4.4.1-1.2404.0 -Wdate-time -D_FORTIFY_SOURCE=3 -c c.c -o c.o gcc -I"/usr/share/R/include" -DNDEBUG -I./rlang -fvisibility=hidden -fpic -g -O2 -fno-omit-frame-pointer -mno-omit-leaf-frame-pointer -ffile-prefix-map=/build/r-base-EawLoD/r-base-4.4.1=. -fstack-protector-strong -fstack-clash-protection -Wformat -Werror=format-security -fcf-protection -fdebug-prefix-map=/build/r-base-EawLoD/r-base-4.4.1=/usr/src/r-base-4.4.1-1.2404.0 -Wdate-time -D_FORTIFY_SOURCE=3 -c callables.c -o callables.o gcc -I"/usr/share/R/include" -DNDEBUG -I./rlang -fvisibility=hidden -fpic -g -O2 -fno-omit-frame-pointer -mno-omit-leaf-frame-pointer -ffile-prefix-map=/build/r-base-EawLoD/r-base-4.4.1=. -fstack-protector-strong -fstack-clash-protection -Wformat -Werror=format-security -fcf-protection -fdebug-prefix-map=/build/r-base-EawLoD/r-base-4.4.1=/usr/src/r-base-4.4.1-1.2404.0 -Wdate-time -D_FORTIFY_SOURCE=3 -c cast-bare.c -o cast-bare.o gcc -I"/usr/share/R/include" -DNDEBUG -I./rlang -fvisibility=hidden -fpic -g -O2 -fno-omit-frame-pointer -mno-omit-leaf-frame-pointer -ffile-prefix-map=/build/r-base-EawLoD/r-base-4.4.1=. -fstack-protector-strong -fstack-clash-protection -Wformat -Werror=format-security -fcf-protection -fdebug-prefix-map=/build/r-base-EawLoD/r-base-4.4.1=/usr/src/r-base-4.4.1-1.2404.0 -Wdate-time -D_FORTIFY_SOURCE=3 -c cast-dispatch.c -o cast-dispatch.o gcc -I"/usr/share/R/include" -DNDEBUG -I./rlang -fvisibility=hidden -fpic -g -O2 -fno-omit-frame-pointer -mno-omit-leaf-frame-pointer -ffile-prefix-map=/build/r-base-EawLoD/r-base-4.4.1=. -fstack-protector-strong -fstack-clash-protection -Wformat -Werror=format-security -fcf-protection -fdebug-prefix-map=/build/r-base-EawLoD/r-base-4.4.1=/usr/src/r-base-4.4.1-1.2404.0 -Wdate-time -D_FORTIFY_SOURCE=3 -c cast.c -o cast.o gcc -I"/usr/share/R/include" -DNDEBUG -I./rlang -fvisibility=hidden -fpic -g -O2 -fno-omit-frame-pointer -mno-omit-leaf-frame-pointer -ffile-prefix-map=/build/r-base-EawLoD/r-base-4.4.1=. -fstack-protector-strong -fstack-clash-protection -Wformat -Werror=format-security -fcf-protection -fdebug-prefix-map=/build/r-base-EawLoD/r-base-4.4.1=/usr/src/r-base-4.4.1-1.2404.0 -Wdate-time -D_FORTIFY_SOURCE=3 -c compare.c -o compare.o gcc -I"/usr/share/R/include" -DNDEBUG -I./rlang -fvisibility=hidden -fpic -g -O2 -fno-omit-frame-pointer -mno-omit-leaf-frame-pointer -ffile-prefix-map=/build/r-base-EawLoD/r-base-4.4.1=. -fstack-protector-strong -fstack-clash-protection -Wformat -Werror=format-security -fcf-protection -fdebug-prefix-map=/build/r-base-EawLoD/r-base-4.4.1=/usr/src/r-base-4.4.1-1.2404.0 -Wdate-time -D_FORTIFY_SOURCE=3 -c complete.c -o complete.o gcc -I"/usr/share/R/include" -DNDEBUG -I./rlang -fvisibility=hidden -fpic -g -O2 -fno-omit-frame-pointer -mno-omit-leaf-frame-pointer -ffile-prefix-map=/build/r-base-EawLoD/r-base-4.4.1=. -fstack-protector-strong -fstack-clash-protection -Wformat -Werror=format-security -fcf-protection -fdebug-prefix-map=/build/r-base-EawLoD/r-base-4.4.1=/usr/src/r-base-4.4.1-1.2404.0 -Wdate-time -D_FORTIFY_SOURCE=3 -c conditions.c -o conditions.o gcc -I"/usr/share/R/include" -DNDEBUG -I./rlang -fvisibility=hidden -fpic -g -O2 -fno-omit-frame-pointer -mno-omit-leaf-frame-pointer -ffile-prefix-map=/build/r-base-EawLoD/r-base-4.4.1=. -fstack-protector-strong -fstack-clash-protection -Wformat -Werror=format-security -fcf-protection -fdebug-prefix-map=/build/r-base-EawLoD/r-base-4.4.1=/usr/src/r-base-4.4.1-1.2404.0 -Wdate-time -D_FORTIFY_SOURCE=3 -c dictionary.c -o dictionary.o gcc -I"/usr/share/R/include" -DNDEBUG -I./rlang -fvisibility=hidden -fpic -g -O2 -fno-omit-frame-pointer -mno-omit-leaf-frame-pointer -ffile-prefix-map=/build/r-base-EawLoD/r-base-4.4.1=. -fstack-protector-strong -fstack-clash-protection -Wformat -Werror=format-security -fcf-protection -fdebug-prefix-map=/build/r-base-EawLoD/r-base-4.4.1=/usr/src/r-base-4.4.1-1.2404.0 -Wdate-time -D_FORTIFY_SOURCE=3 -c dim.c -o dim.o gcc -I"/usr/share/R/include" -DNDEBUG -I./rlang -fvisibility=hidden -fpic -g -O2 -fno-omit-frame-pointer -mno-omit-leaf-frame-pointer -ffile-prefix-map=/build/r-base-EawLoD/r-base-4.4.1=. -fstack-protector-strong -fstack-clash-protection -Wformat -Werror=format-security -fcf-protection -fdebug-prefix-map=/build/r-base-EawLoD/r-base-4.4.1=/usr/src/r-base-4.4.1-1.2404.0 -Wdate-time -D_FORTIFY_SOURCE=3 -c empty.c -o empty.o gcc -I"/usr/share/R/include" -DNDEBUG -I./rlang -fvisibility=hidden -fpic -g -O2 -fno-omit-frame-pointer -mno-omit-leaf-frame-pointer -ffile-prefix-map=/build/r-base-EawLoD/r-base-4.4.1=. -fstack-protector-strong -fstack-clash-protection -Wformat -Werror=format-security -fcf-protection -fdebug-prefix-map=/build/r-base-EawLoD/r-base-4.4.1=/usr/src/r-base-4.4.1-1.2404.0 -Wdate-time -D_FORTIFY_SOURCE=3 -c equal.c -o equal.o gcc -I"/usr/share/R/include" -DNDEBUG -I./rlang -fvisibility=hidden -fpic -g -O2 -fno-omit-frame-pointer -mno-omit-leaf-frame-pointer -ffile-prefix-map=/build/r-base-EawLoD/r-base-4.4.1=. -fstack-protector-strong -fstack-clash-protection -Wformat -Werror=format-security -fcf-protection -fdebug-prefix-map=/build/r-base-EawLoD/r-base-4.4.1=/usr/src/r-base-4.4.1-1.2404.0 -Wdate-time -D_FORTIFY_SOURCE=3 -c expand.c -o expand.o gcc -I"/usr/share/R/include" -DNDEBUG -I./rlang -fvisibility=hidden -fpic -g -O2 -fno-omit-frame-pointer -mno-omit-leaf-frame-pointer -ffile-prefix-map=/build/r-base-EawLoD/r-base-4.4.1=. -fstack-protector-strong -fstack-clash-protection -Wformat -Werror=format-security -fcf-protection -fdebug-prefix-map=/build/r-base-EawLoD/r-base-4.4.1=/usr/src/r-base-4.4.1-1.2404.0 -Wdate-time -D_FORTIFY_SOURCE=3 -c fields.c -o fields.o gcc -I"/usr/share/R/include" -DNDEBUG -I./rlang -fvisibility=hidden -fpic -g -O2 -fno-omit-frame-pointer -mno-omit-leaf-frame-pointer -ffile-prefix-map=/build/r-base-EawLoD/r-base-4.4.1=. -fstack-protector-strong -fstack-clash-protection -Wformat -Werror=format-security -fcf-protection -fdebug-prefix-map=/build/r-base-EawLoD/r-base-4.4.1=/usr/src/r-base-4.4.1-1.2404.0 -Wdate-time -D_FORTIFY_SOURCE=3 -c fill.c -o fill.o gcc -I"/usr/share/R/include" -DNDEBUG -I./rlang -fvisibility=hidden -fpic -g -O2 -fno-omit-frame-pointer -mno-omit-leaf-frame-pointer -ffile-prefix-map=/build/r-base-EawLoD/r-base-4.4.1=. -fstack-protector-strong -fstack-clash-protection -Wformat -Werror=format-security -fcf-protection -fdebug-prefix-map=/build/r-base-EawLoD/r-base-4.4.1=/usr/src/r-base-4.4.1-1.2404.0 -Wdate-time -D_FORTIFY_SOURCE=3 -c globals.c -o globals.o gcc -I"/usr/share/R/include" -DNDEBUG -I./rlang -fvisibility=hidden -fpic -g -O2 -fno-omit-frame-pointer -mno-omit-leaf-frame-pointer -ffile-prefix-map=/build/r-base-EawLoD/r-base-4.4.1=. -fstack-protector-strong -fstack-clash-protection -Wformat -Werror=format-security -fcf-protection -fdebug-prefix-map=/build/r-base-EawLoD/r-base-4.4.1=/usr/src/r-base-4.4.1-1.2404.0 -Wdate-time -D_FORTIFY_SOURCE=3 -c group.c -o group.o gcc -I"/usr/share/R/include" -DNDEBUG -I./rlang -fvisibility=hidden -fpic -g -O2 -fno-omit-frame-pointer -mno-omit-leaf-frame-pointer -ffile-prefix-map=/build/r-base-EawLoD/r-base-4.4.1=. -fstack-protector-strong -fstack-clash-protection -Wformat -Werror=format-security -fcf-protection -fdebug-prefix-map=/build/r-base-EawLoD/r-base-4.4.1=/usr/src/r-base-4.4.1-1.2404.0 -Wdate-time -D_FORTIFY_SOURCE=3 -c growable.c -o growable.o gcc -I"/usr/share/R/include" -DNDEBUG -I./rlang -fvisibility=hidden -fpic -g -O2 -fno-omit-frame-pointer -mno-omit-leaf-frame-pointer -ffile-prefix-map=/build/r-base-EawLoD/r-base-4.4.1=. -fstack-protector-strong -fstack-clash-protection -Wformat -Werror=format-security -fcf-protection -fdebug-prefix-map=/build/r-base-EawLoD/r-base-4.4.1=/usr/src/r-base-4.4.1-1.2404.0 -Wdate-time -D_FORTIFY_SOURCE=3 -c hash.c -o hash.o gcc -I"/usr/share/R/include" -DNDEBUG -I./rlang -fvisibility=hidden -fpic -g -O2 -fno-omit-frame-pointer -mno-omit-leaf-frame-pointer -ffile-prefix-map=/build/r-base-EawLoD/r-base-4.4.1=. -fstack-protector-strong -fstack-clash-protection -Wformat -Werror=format-security -fcf-protection -fdebug-prefix-map=/build/r-base-EawLoD/r-base-4.4.1=/usr/src/r-base-4.4.1-1.2404.0 -Wdate-time -D_FORTIFY_SOURCE=3 -c init.c -o init.o gcc -I"/usr/share/R/include" -DNDEBUG -I./rlang -fvisibility=hidden -fpic -g -O2 -fno-omit-frame-pointer -mno-omit-leaf-frame-pointer -ffile-prefix-map=/build/r-base-EawLoD/r-base-4.4.1=. -fstack-protector-strong -fstack-clash-protection -Wformat -Werror=format-security -fcf-protection -fdebug-prefix-map=/build/r-base-EawLoD/r-base-4.4.1=/usr/src/r-base-4.4.1-1.2404.0 -Wdate-time -D_FORTIFY_SOURCE=3 -c interval.c -o interval.o gcc -I"/usr/share/R/include" -DNDEBUG -I./rlang -fvisibility=hidden -fpic -g -O2 -fno-omit-frame-pointer -mno-omit-leaf-frame-pointer -ffile-prefix-map=/build/r-base-EawLoD/r-base-4.4.1=. -fstack-protector-strong -fstack-clash-protection -Wformat -Werror=format-security -fcf-protection -fdebug-prefix-map=/build/r-base-EawLoD/r-base-4.4.1=/usr/src/r-base-4.4.1-1.2404.0 -Wdate-time -D_FORTIFY_SOURCE=3 -c match-joint.c -o match-joint.o gcc -I"/usr/share/R/include" -DNDEBUG -I./rlang -fvisibility=hidden -fpic -g -O2 -fno-omit-frame-pointer -mno-omit-leaf-frame-pointer -ffile-prefix-map=/build/r-base-EawLoD/r-base-4.4.1=. -fstack-protector-strong -fstack-clash-protection -Wformat -Werror=format-security -fcf-protection -fdebug-prefix-map=/build/r-base-EawLoD/r-base-4.4.1=/usr/src/r-base-4.4.1-1.2404.0 -Wdate-time -D_FORTIFY_SOURCE=3 -c match.c -o match.o gcc -I"/usr/share/R/include" -DNDEBUG -I./rlang -fvisibility=hidden -fpic -g -O2 -fno-omit-frame-pointer -mno-omit-leaf-frame-pointer -ffile-prefix-map=/build/r-base-EawLoD/r-base-4.4.1=. -fstack-protector-strong -fstack-clash-protection -Wformat -Werror=format-security -fcf-protection -fdebug-prefix-map=/build/r-base-EawLoD/r-base-4.4.1=/usr/src/r-base-4.4.1-1.2404.0 -Wdate-time -D_FORTIFY_SOURCE=3 -c missing.c -o missing.o gcc -I"/usr/share/R/include" -DNDEBUG -I./rlang -fvisibility=hidden -fpic -g -O2 -fno-omit-frame-pointer -mno-omit-leaf-frame-pointer -ffile-prefix-map=/build/r-base-EawLoD/r-base-4.4.1=. -fstack-protector-strong -fstack-clash-protection -Wformat -Werror=format-security -fcf-protection -fdebug-prefix-map=/build/r-base-EawLoD/r-base-4.4.1=/usr/src/r-base-4.4.1-1.2404.0 -Wdate-time -D_FORTIFY_SOURCE=3 -c names.c -o names.o gcc -I"/usr/share/R/include" -DNDEBUG -I./rlang -fvisibility=hidden -fpic -g -O2 -fno-omit-frame-pointer -mno-omit-leaf-frame-pointer -ffile-prefix-map=/build/r-base-EawLoD/r-base-4.4.1=. -fstack-protector-strong -fstack-clash-protection -Wformat -Werror=format-security -fcf-protection -fdebug-prefix-map=/build/r-base-EawLoD/r-base-4.4.1=/usr/src/r-base-4.4.1-1.2404.0 -Wdate-time -D_FORTIFY_SOURCE=3 -c order-collate.c -o order-collate.o gcc -I"/usr/share/R/include" -DNDEBUG -I./rlang -fvisibility=hidden -fpic -g -O2 -fno-omit-frame-pointer -mno-omit-leaf-frame-pointer -ffile-prefix-map=/build/r-base-EawLoD/r-base-4.4.1=. -fstack-protector-strong -fstack-clash-protection -Wformat -Werror=format-security -fcf-protection -fdebug-prefix-map=/build/r-base-EawLoD/r-base-4.4.1=/usr/src/r-base-4.4.1-1.2404.0 -Wdate-time -D_FORTIFY_SOURCE=3 -c order-groups.c -o order-groups.o gcc -I"/usr/share/R/include" -DNDEBUG -I./rlang -fvisibility=hidden -fpic -g -O2 -fno-omit-frame-pointer -mno-omit-leaf-frame-pointer -ffile-prefix-map=/build/r-base-EawLoD/r-base-4.4.1=. -fstack-protector-strong -fstack-clash-protection -Wformat -Werror=format-security -fcf-protection -fdebug-prefix-map=/build/r-base-EawLoD/r-base-4.4.1=/usr/src/r-base-4.4.1-1.2404.0 -Wdate-time -D_FORTIFY_SOURCE=3 -c order-sortedness.c -o order-sortedness.o gcc -I"/usr/share/R/include" -DNDEBUG -I./rlang -fvisibility=hidden -fpic -g -O2 -fno-omit-frame-pointer -mno-omit-leaf-frame-pointer -ffile-prefix-map=/build/r-base-EawLoD/r-base-4.4.1=. -fstack-protector-strong -fstack-clash-protection -Wformat -Werror=format-security -fcf-protection -fdebug-prefix-map=/build/r-base-EawLoD/r-base-4.4.1=/usr/src/r-base-4.4.1-1.2404.0 -Wdate-time -D_FORTIFY_SOURCE=3 -c order-truelength.c -o order-truelength.o gcc -I"/usr/share/R/include" -DNDEBUG -I./rlang -fvisibility=hidden -fpic -g -O2 -fno-omit-frame-pointer -mno-omit-leaf-frame-pointer -ffile-prefix-map=/build/r-base-EawLoD/r-base-4.4.1=. -fstack-protector-strong -fstack-clash-protection -Wformat -Werror=format-security -fcf-protection -fdebug-prefix-map=/build/r-base-EawLoD/r-base-4.4.1=/usr/src/r-base-4.4.1-1.2404.0 -Wdate-time -D_FORTIFY_SOURCE=3 -c order.c -o order.o gcc -I"/usr/share/R/include" -DNDEBUG -I./rlang -fvisibility=hidden -fpic -g -O2 -fno-omit-frame-pointer -mno-omit-leaf-frame-pointer -ffile-prefix-map=/build/r-base-EawLoD/r-base-4.4.1=. -fstack-protector-strong -fstack-clash-protection -Wformat -Werror=format-security -fcf-protection -fdebug-prefix-map=/build/r-base-EawLoD/r-base-4.4.1=/usr/src/r-base-4.4.1-1.2404.0 -Wdate-time -D_FORTIFY_SOURCE=3 -c poly-op.c -o poly-op.o gcc -I"/usr/share/R/include" -DNDEBUG -I./rlang -fvisibility=hidden -fpic -g -O2 -fno-omit-frame-pointer -mno-omit-leaf-frame-pointer -ffile-prefix-map=/build/r-base-EawLoD/r-base-4.4.1=. -fstack-protector-strong -fstack-clash-protection -Wformat -Werror=format-security -fcf-protection -fdebug-prefix-map=/build/r-base-EawLoD/r-base-4.4.1=/usr/src/r-base-4.4.1-1.2404.0 -Wdate-time -D_FORTIFY_SOURCE=3 -c proxy-restore.c -o proxy-restore.o gcc -I"/usr/share/R/include" -DNDEBUG -I./rlang -fvisibility=hidden -fpic -g -O2 -fno-omit-frame-pointer -mno-omit-leaf-frame-pointer -ffile-prefix-map=/build/r-base-EawLoD/r-base-4.4.1=. -fstack-protector-strong -fstack-clash-protection -Wformat -Werror=format-security -fcf-protection -fdebug-prefix-map=/build/r-base-EawLoD/r-base-4.4.1=/usr/src/r-base-4.4.1-1.2404.0 -Wdate-time -D_FORTIFY_SOURCE=3 -c proxy.c -o proxy.o gcc -I"/usr/share/R/include" -DNDEBUG -I./rlang -fvisibility=hidden -fpic -g -O2 -fno-omit-frame-pointer -mno-omit-leaf-frame-pointer -ffile-prefix-map=/build/r-base-EawLoD/r-base-4.4.1=. -fstack-protector-strong -fstack-clash-protection -Wformat -Werror=format-security -fcf-protection -fdebug-prefix-map=/build/r-base-EawLoD/r-base-4.4.1=/usr/src/r-base-4.4.1-1.2404.0 -Wdate-time -D_FORTIFY_SOURCE=3 -c ptype-common.c -o ptype-common.o gcc -I"/usr/share/R/include" -DNDEBUG -I./rlang -fvisibility=hidden -fpic -g -O2 -fno-omit-frame-pointer -mno-omit-leaf-frame-pointer -ffile-prefix-map=/build/r-base-EawLoD/r-base-4.4.1=. -fstack-protector-strong -fstack-clash-protection -Wformat -Werror=format-security -fcf-protection -fdebug-prefix-map=/build/r-base-EawLoD/r-base-4.4.1=/usr/src/r-base-4.4.1-1.2404.0 -Wdate-time -D_FORTIFY_SOURCE=3 -c ptype.c -o ptype.o gcc -I"/usr/share/R/include" -DNDEBUG -I./rlang -fvisibility=hidden -fpic -g -O2 -fno-omit-frame-pointer -mno-omit-leaf-frame-pointer -ffile-prefix-map=/build/r-base-EawLoD/r-base-4.4.1=. -fstack-protector-strong -fstack-clash-protection -Wformat -Werror=format-security -fcf-protection -fdebug-prefix-map=/build/r-base-EawLoD/r-base-4.4.1=/usr/src/r-base-4.4.1-1.2404.0 -Wdate-time -D_FORTIFY_SOURCE=3 -c ptype2-dispatch.c -o ptype2-dispatch.o gcc -I"/usr/share/R/include" -DNDEBUG -I./rlang -fvisibility=hidden -fpic -g -O2 -fno-omit-frame-pointer -mno-omit-leaf-frame-pointer -ffile-prefix-map=/build/r-base-EawLoD/r-base-4.4.1=. -fstack-protector-strong -fstack-clash-protection -Wformat -Werror=format-security -fcf-protection -fdebug-prefix-map=/build/r-base-EawLoD/r-base-4.4.1=/usr/src/r-base-4.4.1-1.2404.0 -Wdate-time -D_FORTIFY_SOURCE=3 -c ptype2.c -o ptype2.o gcc -I"/usr/share/R/include" -DNDEBUG -I./rlang -fvisibility=hidden -fpic -g -O2 -fno-omit-frame-pointer -mno-omit-leaf-frame-pointer -ffile-prefix-map=/build/r-base-EawLoD/r-base-4.4.1=. -fstack-protector-strong -fstack-clash-protection -Wformat -Werror=format-security -fcf-protection -fdebug-prefix-map=/build/r-base-EawLoD/r-base-4.4.1=/usr/src/r-base-4.4.1-1.2404.0 -Wdate-time -D_FORTIFY_SOURCE=3 -c rank.c -o rank.o gcc -I"/usr/share/R/include" -DNDEBUG -I./rlang -fvisibility=hidden -fpic -g -O2 -fno-omit-frame-pointer -mno-omit-leaf-frame-pointer -ffile-prefix-map=/build/r-base-EawLoD/r-base-4.4.1=. -fstack-protector-strong -fstack-clash-protection -Wformat -Werror=format-security -fcf-protection -fdebug-prefix-map=/build/r-base-EawLoD/r-base-4.4.1=/usr/src/r-base-4.4.1-1.2404.0 -Wdate-time -D_FORTIFY_SOURCE=3 -c rep.c -o rep.o gcc -I"/usr/share/R/include" -DNDEBUG -I./rlang -fvisibility=hidden -fpic -g -O2 -fno-omit-frame-pointer -mno-omit-leaf-frame-pointer -ffile-prefix-map=/build/r-base-EawLoD/r-base-4.4.1=. -fstack-protector-strong -fstack-clash-protection -Wformat -Werror=format-security -fcf-protection -fdebug-prefix-map=/build/r-base-EawLoD/r-base-4.4.1=/usr/src/r-base-4.4.1-1.2404.0 -Wdate-time -D_FORTIFY_SOURCE=3 -c rlang-dev.c -o rlang-dev.o gcc -I"/usr/share/R/include" -DNDEBUG -I./rlang -fvisibility=hidden -fpic -g -O2 -fno-omit-frame-pointer -mno-omit-leaf-frame-pointer -ffile-prefix-map=/build/r-base-EawLoD/r-base-4.4.1=. -fstack-protector-strong -fstack-clash-protection -Wformat -Werror=format-security -fcf-protection -fdebug-prefix-map=/build/r-base-EawLoD/r-base-4.4.1=/usr/src/r-base-4.4.1-1.2404.0 -Wdate-time -D_FORTIFY_SOURCE=3 -c rlang.c -o rlang.o gcc -I"/usr/share/R/include" -DNDEBUG -I./rlang -fvisibility=hidden -fpic -g -O2 -fno-omit-frame-pointer -mno-omit-leaf-frame-pointer -ffile-prefix-map=/build/r-base-EawLoD/r-base-4.4.1=. -fstack-protector-strong -fstack-clash-protection -Wformat -Werror=format-security -fcf-protection -fdebug-prefix-map=/build/r-base-EawLoD/r-base-4.4.1=/usr/src/r-base-4.4.1-1.2404.0 -Wdate-time -D_FORTIFY_SOURCE=3 -c runs.c -o runs.o gcc -I"/usr/share/R/include" -DNDEBUG -I./rlang -fvisibility=hidden -fpic -g -O2 -fno-omit-frame-pointer -mno-omit-leaf-frame-pointer -ffile-prefix-map=/build/r-base-EawLoD/r-base-4.4.1=. -fstack-protector-strong -fstack-clash-protection -Wformat -Werror=format-security -fcf-protection -fdebug-prefix-map=/build/r-base-EawLoD/r-base-4.4.1=/usr/src/r-base-4.4.1-1.2404.0 -Wdate-time -D_FORTIFY_SOURCE=3 -c set.c -o set.o gcc -I"/usr/share/R/include" -DNDEBUG -I./rlang -fvisibility=hidden -fpic -g -O2 -fno-omit-frame-pointer -mno-omit-leaf-frame-pointer -ffile-prefix-map=/build/r-base-EawLoD/r-base-4.4.1=. -fstack-protector-strong -fstack-clash-protection -Wformat -Werror=format-security -fcf-protection -fdebug-prefix-map=/build/r-base-EawLoD/r-base-4.4.1=/usr/src/r-base-4.4.1-1.2404.0 -Wdate-time -D_FORTIFY_SOURCE=3 -c shape.c -o shape.o gcc -I"/usr/share/R/include" -DNDEBUG -I./rlang -fvisibility=hidden -fpic -g -O2 -fno-omit-frame-pointer -mno-omit-leaf-frame-pointer -ffile-prefix-map=/build/r-base-EawLoD/r-base-4.4.1=. -fstack-protector-strong -fstack-clash-protection -Wformat -Werror=format-security -fcf-protection -fdebug-prefix-map=/build/r-base-EawLoD/r-base-4.4.1=/usr/src/r-base-4.4.1-1.2404.0 -Wdate-time -D_FORTIFY_SOURCE=3 -c size-common.c -o size-common.o gcc -I"/usr/share/R/include" -DNDEBUG -I./rlang -fvisibility=hidden -fpic -g -O2 -fno-omit-frame-pointer -mno-omit-leaf-frame-pointer -ffile-prefix-map=/build/r-base-EawLoD/r-base-4.4.1=. -fstack-protector-strong -fstack-clash-protection -Wformat -Werror=format-security -fcf-protection -fdebug-prefix-map=/build/r-base-EawLoD/r-base-4.4.1=/usr/src/r-base-4.4.1-1.2404.0 -Wdate-time -D_FORTIFY_SOURCE=3 -c size.c -o size.o gcc -I"/usr/share/R/include" -DNDEBUG -I./rlang -fvisibility=hidden -fpic -g -O2 -fno-omit-frame-pointer -mno-omit-leaf-frame-pointer -ffile-prefix-map=/build/r-base-EawLoD/r-base-4.4.1=. -fstack-protector-strong -fstack-clash-protection -Wformat -Werror=format-security -fcf-protection -fdebug-prefix-map=/build/r-base-EawLoD/r-base-4.4.1=/usr/src/r-base-4.4.1-1.2404.0 -Wdate-time -D_FORTIFY_SOURCE=3 -c slice-array.c -o slice-array.o gcc -I"/usr/share/R/include" -DNDEBUG -I./rlang -fvisibility=hidden -fpic -g -O2 -fno-omit-frame-pointer -mno-omit-leaf-frame-pointer -ffile-prefix-map=/build/r-base-EawLoD/r-base-4.4.1=. -fstack-protector-strong -fstack-clash-protection -Wformat -Werror=format-security -fcf-protection -fdebug-prefix-map=/build/r-base-EawLoD/r-base-4.4.1=/usr/src/r-base-4.4.1-1.2404.0 -Wdate-time -D_FORTIFY_SOURCE=3 -c slice-assign-array.c -o slice-assign-array.o gcc -I"/usr/share/R/include" -DNDEBUG -I./rlang -fvisibility=hidden -fpic -g -O2 -fno-omit-frame-pointer -mno-omit-leaf-frame-pointer -ffile-prefix-map=/build/r-base-EawLoD/r-base-4.4.1=. -fstack-protector-strong -fstack-clash-protection -Wformat -Werror=format-security -fcf-protection -fdebug-prefix-map=/build/r-base-EawLoD/r-base-4.4.1=/usr/src/r-base-4.4.1-1.2404.0 -Wdate-time -D_FORTIFY_SOURCE=3 -c slice-assign.c -o slice-assign.o gcc -I"/usr/share/R/include" -DNDEBUG -I./rlang -fvisibility=hidden -fpic -g -O2 -fno-omit-frame-pointer -mno-omit-leaf-frame-pointer -ffile-prefix-map=/build/r-base-EawLoD/r-base-4.4.1=. -fstack-protector-strong -fstack-clash-protection -Wformat -Werror=format-security -fcf-protection -fdebug-prefix-map=/build/r-base-EawLoD/r-base-4.4.1=/usr/src/r-base-4.4.1-1.2404.0 -Wdate-time -D_FORTIFY_SOURCE=3 -c slice-chop.c -o slice-chop.o gcc -I"/usr/share/R/include" -DNDEBUG -I./rlang -fvisibility=hidden -fpic -g -O2 -fno-omit-frame-pointer -mno-omit-leaf-frame-pointer -ffile-prefix-map=/build/r-base-EawLoD/r-base-4.4.1=. -fstack-protector-strong -fstack-clash-protection -Wformat -Werror=format-security -fcf-protection -fdebug-prefix-map=/build/r-base-EawLoD/r-base-4.4.1=/usr/src/r-base-4.4.1-1.2404.0 -Wdate-time -D_FORTIFY_SOURCE=3 -c slice-interleave.c -o slice-interleave.o gcc -I"/usr/share/R/include" -DNDEBUG -I./rlang -fvisibility=hidden -fpic -g -O2 -fno-omit-frame-pointer -mno-omit-leaf-frame-pointer -ffile-prefix-map=/build/r-base-EawLoD/r-base-4.4.1=. -fstack-protector-strong -fstack-clash-protection -Wformat -Werror=format-security -fcf-protection -fdebug-prefix-map=/build/r-base-EawLoD/r-base-4.4.1=/usr/src/r-base-4.4.1-1.2404.0 -Wdate-time -D_FORTIFY_SOURCE=3 -c slice.c -o slice.o gcc -I"/usr/share/R/include" -DNDEBUG -I./rlang -fvisibility=hidden -fpic -g -O2 -fno-omit-frame-pointer -mno-omit-leaf-frame-pointer -ffile-prefix-map=/build/r-base-EawLoD/r-base-4.4.1=. -fstack-protector-strong -fstack-clash-protection -Wformat -Werror=format-security -fcf-protection -fdebug-prefix-map=/build/r-base-EawLoD/r-base-4.4.1=/usr/src/r-base-4.4.1-1.2404.0 -Wdate-time -D_FORTIFY_SOURCE=3 -c split.c -o split.o gcc -I"/usr/share/R/include" -DNDEBUG -I./rlang -fvisibility=hidden -fpic -g -O2 -fno-omit-frame-pointer -mno-omit-leaf-frame-pointer -ffile-prefix-map=/build/r-base-EawLoD/r-base-4.4.1=. -fstack-protector-strong -fstack-clash-protection -Wformat -Werror=format-security -fcf-protection -fdebug-prefix-map=/build/r-base-EawLoD/r-base-4.4.1=/usr/src/r-base-4.4.1-1.2404.0 -Wdate-time -D_FORTIFY_SOURCE=3 -c subscript-loc.c -o subscript-loc.o gcc -I"/usr/share/R/include" -DNDEBUG -I./rlang -fvisibility=hidden -fpic -g -O2 -fno-omit-frame-pointer -mno-omit-leaf-frame-pointer -ffile-prefix-map=/build/r-base-EawLoD/r-base-4.4.1=. -fstack-protector-strong -fstack-clash-protection -Wformat -Werror=format-security -fcf-protection -fdebug-prefix-map=/build/r-base-EawLoD/r-base-4.4.1=/usr/src/r-base-4.4.1-1.2404.0 -Wdate-time -D_FORTIFY_SOURCE=3 -c subscript.c -o subscript.o gcc -I"/usr/share/R/include" -DNDEBUG -I./rlang -fvisibility=hidden -fpic -g -O2 -fno-omit-frame-pointer -mno-omit-leaf-frame-pointer -ffile-prefix-map=/build/r-base-EawLoD/r-base-4.4.1=. -fstack-protector-strong -fstack-clash-protection -Wformat -Werror=format-security -fcf-protection -fdebug-prefix-map=/build/r-base-EawLoD/r-base-4.4.1=/usr/src/r-base-4.4.1-1.2404.0 -Wdate-time -D_FORTIFY_SOURCE=3 -c translate.c -o translate.o gcc -I"/usr/share/R/include" -DNDEBUG -I./rlang -fvisibility=hidden -fpic -g -O2 -fno-omit-frame-pointer -mno-omit-leaf-frame-pointer -ffile-prefix-map=/build/r-base-EawLoD/r-base-4.4.1=. -fstack-protector-strong -fstack-clash-protection -Wformat -Werror=format-security -fcf-protection -fdebug-prefix-map=/build/r-base-EawLoD/r-base-4.4.1=/usr/src/r-base-4.4.1-1.2404.0 -Wdate-time -D_FORTIFY_SOURCE=3 -c type-data-frame.c -o type-data-frame.o gcc -I"/usr/share/R/include" -DNDEBUG -I./rlang -fvisibility=hidden -fpic -g -O2 -fno-omit-frame-pointer -mno-omit-leaf-frame-pointer -ffile-prefix-map=/build/r-base-EawLoD/r-base-4.4.1=. -fstack-protector-strong -fstack-clash-protection -Wformat -Werror=format-security -fcf-protection -fdebug-prefix-map=/build/r-base-EawLoD/r-base-4.4.1=/usr/src/r-base-4.4.1-1.2404.0 -Wdate-time -D_FORTIFY_SOURCE=3 -c type-date-time.c -o type-date-time.o gcc -I"/usr/share/R/include" -DNDEBUG -I./rlang -fvisibility=hidden -fpic -g -O2 -fno-omit-frame-pointer -mno-omit-leaf-frame-pointer -ffile-prefix-map=/build/r-base-EawLoD/r-base-4.4.1=. -fstack-protector-strong -fstack-clash-protection -Wformat -Werror=format-security -fcf-protection -fdebug-prefix-map=/build/r-base-EawLoD/r-base-4.4.1=/usr/src/r-base-4.4.1-1.2404.0 -Wdate-time -D_FORTIFY_SOURCE=3 -c type-factor.c -o type-factor.o gcc -I"/usr/share/R/include" -DNDEBUG -I./rlang -fvisibility=hidden -fpic -g -O2 -fno-omit-frame-pointer -mno-omit-leaf-frame-pointer -ffile-prefix-map=/build/r-base-EawLoD/r-base-4.4.1=. -fstack-protector-strong -fstack-clash-protection -Wformat -Werror=format-security -fcf-protection -fdebug-prefix-map=/build/r-base-EawLoD/r-base-4.4.1=/usr/src/r-base-4.4.1-1.2404.0 -Wdate-time -D_FORTIFY_SOURCE=3 -c type-info.c -o type-info.o gcc -I"/usr/share/R/include" -DNDEBUG -I./rlang -fvisibility=hidden -fpic -g -O2 -fno-omit-frame-pointer -mno-omit-leaf-frame-pointer -ffile-prefix-map=/build/r-base-EawLoD/r-base-4.4.1=. -fstack-protector-strong -fstack-clash-protection -Wformat -Werror=format-security -fcf-protection -fdebug-prefix-map=/build/r-base-EawLoD/r-base-4.4.1=/usr/src/r-base-4.4.1-1.2404.0 -Wdate-time -D_FORTIFY_SOURCE=3 -c type-integer64.c -o type-integer64.o gcc -I"/usr/share/R/include" -DNDEBUG -I./rlang -fvisibility=hidden -fpic -g -O2 -fno-omit-frame-pointer -mno-omit-leaf-frame-pointer -ffile-prefix-map=/build/r-base-EawLoD/r-base-4.4.1=. -fstack-protector-strong -fstack-clash-protection -Wformat -Werror=format-security -fcf-protection -fdebug-prefix-map=/build/r-base-EawLoD/r-base-4.4.1=/usr/src/r-base-4.4.1-1.2404.0 -Wdate-time -D_FORTIFY_SOURCE=3 -c type-tibble.c -o type-tibble.o gcc -I"/usr/share/R/include" -DNDEBUG -I./rlang -fvisibility=hidden -fpic -g -O2 -fno-omit-frame-pointer -mno-omit-leaf-frame-pointer -ffile-prefix-map=/build/r-base-EawLoD/r-base-4.4.1=. -fstack-protector-strong -fstack-clash-protection -Wformat -Werror=format-security -fcf-protection -fdebug-prefix-map=/build/r-base-EawLoD/r-base-4.4.1=/usr/src/r-base-4.4.1-1.2404.0 -Wdate-time -D_FORTIFY_SOURCE=3 -c typeof2-s3.c -o typeof2-s3.o gcc -I"/usr/share/R/include" -DNDEBUG -I./rlang -fvisibility=hidden -fpic -g -O2 -fno-omit-frame-pointer -mno-omit-leaf-frame-pointer -ffile-prefix-map=/build/r-base-EawLoD/r-base-4.4.1=. -fstack-protector-strong -fstack-clash-protection -Wformat -Werror=format-security -fcf-protection -fdebug-prefix-map=/build/r-base-EawLoD/r-base-4.4.1=/usr/src/r-base-4.4.1-1.2404.0 -Wdate-time -D_FORTIFY_SOURCE=3 -c typeof2.c -o typeof2.o gcc -I"/usr/share/R/include" -DNDEBUG -I./rlang -fvisibility=hidden -fpic -g -O2 -fno-omit-frame-pointer -mno-omit-leaf-frame-pointer -ffile-prefix-map=/build/r-base-EawLoD/r-base-4.4.1=. -fstack-protector-strong -fstack-clash-protection -Wformat -Werror=format-security -fcf-protection -fdebug-prefix-map=/build/r-base-EawLoD/r-base-4.4.1=/usr/src/r-base-4.4.1-1.2404.0 -Wdate-time -D_FORTIFY_SOURCE=3 -c unspecified.c -o unspecified.o gcc -I"/usr/share/R/include" -DNDEBUG -I./rlang -fvisibility=hidden -fpic -g -O2 -fno-omit-frame-pointer -mno-omit-leaf-frame-pointer -ffile-prefix-map=/build/r-base-EawLoD/r-base-4.4.1=. -fstack-protector-strong -fstack-clash-protection -Wformat -Werror=format-security -fcf-protection -fdebug-prefix-map=/build/r-base-EawLoD/r-base-4.4.1=/usr/src/r-base-4.4.1-1.2404.0 -Wdate-time -D_FORTIFY_SOURCE=3 -c utils-dispatch.c -o utils-dispatch.o gcc -I"/usr/share/R/include" -DNDEBUG -I./rlang -fvisibility=hidden -fpic -g -O2 -fno-omit-frame-pointer -mno-omit-leaf-frame-pointer -ffile-prefix-map=/build/r-base-EawLoD/r-base-4.4.1=. -fstack-protector-strong -fstack-clash-protection -Wformat -Werror=format-security -fcf-protection -fdebug-prefix-map=/build/r-base-EawLoD/r-base-4.4.1=/usr/src/r-base-4.4.1-1.2404.0 -Wdate-time -D_FORTIFY_SOURCE=3 -c utils.c -o utils.o gcc -I"/usr/share/R/include" -DNDEBUG -I./rlang -fvisibility=hidden -fpic -g -O2 -fno-omit-frame-pointer -mno-omit-leaf-frame-pointer -ffile-prefix-map=/build/r-base-EawLoD/r-base-4.4.1=. -fstack-protector-strong -fstack-clash-protection -Wformat -Werror=format-security -fcf-protection -fdebug-prefix-map=/build/r-base-EawLoD/r-base-4.4.1=/usr/src/r-base-4.4.1-1.2404.0 -Wdate-time -D_FORTIFY_SOURCE=3 -c vctrs-core.c -o vctrs-core.o gcc -I"/usr/share/R/include" -DNDEBUG -I./rlang -fvisibility=hidden -fpic -g -O2 -fno-omit-frame-pointer -mno-omit-leaf-frame-pointer -ffile-prefix-map=/build/r-base-EawLoD/r-base-4.4.1=. -fstack-protector-strong -fstack-clash-protection -Wformat -Werror=format-security -fcf-protection -fdebug-prefix-map=/build/r-base-EawLoD/r-base-4.4.1=/usr/src/r-base-4.4.1-1.2404.0 -Wdate-time -D_FORTIFY_SOURCE=3 -c version.c -o version.o gcc -shared -L/usr/lib/R/lib -Wl,-Bsymbolic-functions -flto=auto -ffat-lto-objects -Wl,-z,relro -o vctrs.so altrep-lazy-character.o altrep-rle.o altrep.o arg-counter.o arg.o assert.o bind.o c-unchop.o c.o callables.o cast-bare.o cast-dispatch.o cast.o compare.o complete.o conditions.o dictionary.o dim.o empty.o equal.o expand.o fields.o fill.o globals.o group.o growable.o hash.o init.o interval.o match-joint.o match.o missing.o names.o order-collate.o order-groups.o order-sortedness.o order-truelength.o order.o poly-op.o proxy-restore.o proxy.o ptype-common.o ptype.o ptype2-dispatch.o ptype2.o rank.o rep.o rlang-dev.o rlang.o runs.o set.o shape.o size-common.o size.o slice-array.o slice-assign-array.o slice-assign.o slice-chop.o slice-interleave.o slice.o split.o subscript-loc.o subscript.o translate.o type-data-frame.o type-date-time.o type-factor.o type-info.o type-integer64.o type-tibble.o typeof2-s3.o typeof2.o unspecified.o utils-dispatch.o utils.o vctrs-core.o version.o -L/usr/lib/R/lib -lR installing to /home/omnipath/local/R/4.4-3.20/00LOCK-vctrs/00new/vctrs/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 (vctrs) * installing *source* package ‘callr’ ... ** package ‘callr’ 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 ** 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 (callr) * installing *source* package ‘knitr’ ... ** package ‘knitr’ successfully unpacked and MD5 sums checked ** using staged installation ** R ** demo ** inst ** byte-compile and prepare package for lazy loading ** help *** installing help indices ** building package indices ** installing vignettes ** testing if installed package can be loaded from temporary location ** testing if installed package can be loaded from final location ** testing if installed package keeps a record of temporary installation path * DONE (knitr) * installing *source* package ‘blob’ ... ** package ‘blob’ 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 (blob) * installing *source* package ‘pillar’ ... ** package ‘pillar’ 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 (pillar) * installing *source* package ‘purrr’ ... ** package ‘purrr’ successfully unpacked and MD5 sums checked ** using staged installation ** libs using C compiler: ‘gcc (Ubuntu 13.2.0-23ubuntu4) 13.2.0’ gcc -I"/usr/share/R/include" -DNDEBUG -I'/home/omnipath/local/R/4.4-3.20/cli/include' -fvisibility=hidden -fpic -g -O2 -fno-omit-frame-pointer -mno-omit-leaf-frame-pointer -ffile-prefix-map=/build/r-base-EawLoD/r-base-4.4.1=. -fstack-protector-strong -fstack-clash-protection -Wformat -Werror=format-security -fcf-protection -fdebug-prefix-map=/build/r-base-EawLoD/r-base-4.4.1=/usr/src/r-base-4.4.1-1.2404.0 -Wdate-time -D_FORTIFY_SOURCE=3 -c backports.c -o backports.o gcc -I"/usr/share/R/include" -DNDEBUG -I'/home/omnipath/local/R/4.4-3.20/cli/include' -fvisibility=hidden -fpic -g -O2 -fno-omit-frame-pointer -mno-omit-leaf-frame-pointer -ffile-prefix-map=/build/r-base-EawLoD/r-base-4.4.1=. -fstack-protector-strong -fstack-clash-protection -Wformat -Werror=format-security -fcf-protection -fdebug-prefix-map=/build/r-base-EawLoD/r-base-4.4.1=/usr/src/r-base-4.4.1-1.2404.0 -Wdate-time -D_FORTIFY_SOURCE=3 -c cleancall.c -o cleancall.o gcc -I"/usr/share/R/include" -DNDEBUG -I'/home/omnipath/local/R/4.4-3.20/cli/include' -fvisibility=hidden -fpic -g -O2 -fno-omit-frame-pointer -mno-omit-leaf-frame-pointer -ffile-prefix-map=/build/r-base-EawLoD/r-base-4.4.1=. -fstack-protector-strong -fstack-clash-protection -Wformat -Werror=format-security -fcf-protection -fdebug-prefix-map=/build/r-base-EawLoD/r-base-4.4.1=/usr/src/r-base-4.4.1-1.2404.0 -Wdate-time -D_FORTIFY_SOURCE=3 -c coerce.c -o coerce.o gcc -I"/usr/share/R/include" -DNDEBUG -I'/home/omnipath/local/R/4.4-3.20/cli/include' -fvisibility=hidden -fpic -g -O2 -fno-omit-frame-pointer -mno-omit-leaf-frame-pointer -ffile-prefix-map=/build/r-base-EawLoD/r-base-4.4.1=. -fstack-protector-strong -fstack-clash-protection -Wformat -Werror=format-security -fcf-protection -fdebug-prefix-map=/build/r-base-EawLoD/r-base-4.4.1=/usr/src/r-base-4.4.1-1.2404.0 -Wdate-time -D_FORTIFY_SOURCE=3 -c conditions.c -o conditions.o gcc -I"/usr/share/R/include" -DNDEBUG -I'/home/omnipath/local/R/4.4-3.20/cli/include' -fvisibility=hidden -fpic -g -O2 -fno-omit-frame-pointer -mno-omit-leaf-frame-pointer -ffile-prefix-map=/build/r-base-EawLoD/r-base-4.4.1=. -fstack-protector-strong -fstack-clash-protection -Wformat -Werror=format-security -fcf-protection -fdebug-prefix-map=/build/r-base-EawLoD/r-base-4.4.1=/usr/src/r-base-4.4.1-1.2404.0 -Wdate-time -D_FORTIFY_SOURCE=3 -c flatten.c -o flatten.o gcc -I"/usr/share/R/include" -DNDEBUG -I'/home/omnipath/local/R/4.4-3.20/cli/include' -fvisibility=hidden -fpic -g -O2 -fno-omit-frame-pointer -mno-omit-leaf-frame-pointer -ffile-prefix-map=/build/r-base-EawLoD/r-base-4.4.1=. -fstack-protector-strong -fstack-clash-protection -Wformat -Werror=format-security -fcf-protection -fdebug-prefix-map=/build/r-base-EawLoD/r-base-4.4.1=/usr/src/r-base-4.4.1-1.2404.0 -Wdate-time -D_FORTIFY_SOURCE=3 -c init.c -o init.o gcc -I"/usr/share/R/include" -DNDEBUG -I'/home/omnipath/local/R/4.4-3.20/cli/include' -fvisibility=hidden -fpic -g -O2 -fno-omit-frame-pointer -mno-omit-leaf-frame-pointer -ffile-prefix-map=/build/r-base-EawLoD/r-base-4.4.1=. -fstack-protector-strong -fstack-clash-protection -Wformat -Werror=format-security -fcf-protection -fdebug-prefix-map=/build/r-base-EawLoD/r-base-4.4.1=/usr/src/r-base-4.4.1-1.2404.0 -Wdate-time -D_FORTIFY_SOURCE=3 -c map.c -o map.o gcc -I"/usr/share/R/include" -DNDEBUG -I'/home/omnipath/local/R/4.4-3.20/cli/include' -fvisibility=hidden -fpic -g -O2 -fno-omit-frame-pointer -mno-omit-leaf-frame-pointer -ffile-prefix-map=/build/r-base-EawLoD/r-base-4.4.1=. -fstack-protector-strong -fstack-clash-protection -Wformat -Werror=format-security -fcf-protection -fdebug-prefix-map=/build/r-base-EawLoD/r-base-4.4.1=/usr/src/r-base-4.4.1-1.2404.0 -Wdate-time -D_FORTIFY_SOURCE=3 -c pluck.c -o pluck.o gcc -I"/usr/share/R/include" -DNDEBUG -I'/home/omnipath/local/R/4.4-3.20/cli/include' -fvisibility=hidden -fpic -g -O2 -fno-omit-frame-pointer -mno-omit-leaf-frame-pointer -ffile-prefix-map=/build/r-base-EawLoD/r-base-4.4.1=. -fstack-protector-strong -fstack-clash-protection -Wformat -Werror=format-security -fcf-protection -fdebug-prefix-map=/build/r-base-EawLoD/r-base-4.4.1=/usr/src/r-base-4.4.1-1.2404.0 -Wdate-time -D_FORTIFY_SOURCE=3 -c transpose.c -o transpose.o gcc -I"/usr/share/R/include" -DNDEBUG -I'/home/omnipath/local/R/4.4-3.20/cli/include' -fvisibility=hidden -fpic -g -O2 -fno-omit-frame-pointer -mno-omit-leaf-frame-pointer -ffile-prefix-map=/build/r-base-EawLoD/r-base-4.4.1=. -fstack-protector-strong -fstack-clash-protection -Wformat -Werror=format-security -fcf-protection -fdebug-prefix-map=/build/r-base-EawLoD/r-base-4.4.1=/usr/src/r-base-4.4.1-1.2404.0 -Wdate-time -D_FORTIFY_SOURCE=3 -c utils.c -o utils.o gcc -shared -L/usr/lib/R/lib -Wl,-Bsymbolic-functions -flto=auto -ffat-lto-objects -Wl,-z,relro -o purrr.so backports.o cleancall.o coerce.o conditions.o flatten.o init.o map.o pluck.o transpose.o utils.o -L/usr/lib/R/lib -lR installing to /home/omnipath/local/R/4.4-3.20/00LOCK-purrr/00new/purrr/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 (purrr) * installing *source* package ‘tidyselect’ ... ** package ‘tidyselect’ successfully unpacked and MD5 sums checked ** using staged installation ** R ** inst ** byte-compile and prepare package for lazy loading ** help *** installing help indices ** building package indices ** installing vignettes ** testing if installed package can be loaded from temporary location ** testing if installed package can be loaded from final location ** testing if installed package keeps a record of temporary installation path * DONE (tidyselect) * installing *source* package ‘stringr’ ... ** package ‘stringr’ 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 (stringr) * installing *source* package ‘httr’ ... ** package ‘httr’ successfully unpacked and MD5 sums checked ** using staged installation ** R ** demo ** inst ** byte-compile and prepare package for lazy loading ** help *** installing help indices ** building package indices ** installing vignettes ** testing if installed package can be loaded from temporary location ** testing if installed package can be loaded from final location ** testing if installed package keeps a record of temporary installation path * DONE (httr) * installing *source* package ‘biocViews’ ... ** package ‘biocViews’ successfully unpacked and MD5 sums checked ** using staged installation ** R ** data ** inst ** byte-compile and prepare package for lazy loading ** help *** installing help indices ** building package indices ** installing vignettes ** testing if installed package can be loaded from temporary location ** testing if installed package can be loaded from final location ** testing if installed package keeps a record of temporary installation path * DONE (biocViews) * installing *source* package ‘httr2’ ... ** package ‘httr2’ 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 (httr2) * installing *source* package ‘RSQLite’ ... ** package ‘RSQLite’ successfully unpacked and MD5 sums checked ** using staged installation ** libs using C compiler: ‘gcc (Ubuntu 13.2.0-23ubuntu4) 13.2.0’ using C++ compiler: ‘g++ (Ubuntu 13.2.0-23ubuntu4) 13.2.0’ g++ -std=gnu++17 -I"/usr/share/R/include" -DNDEBUG -I. -Ivendor -Ivendor/extensions -Ivendor/sqlite3 -DRSQLITE_USE_BUNDLED_SQLITE -DSQLITE_ENABLE_RTREE -DSQLITE_ENABLE_FTS3 -DSQLITE_ENABLE_FTS3_PARENTHESIS -DSQLITE_ENABLE_FTS5 -DSQLITE_ENABLE_JSON1 -DSQLITE_ENABLE_STAT4 -DSQLITE_SOUNDEX -DSQLITE_USE_URI=1 -DSQLITE_MAX_LENGTH=2147483647 -DHAVE_USLEEP=1 -I'/home/omnipath/local/R/4.4-3.20/plogr/include' -I'/home/omnipath/local/R/4.4-3.20/cpp11/include' -fvisibility=hidden -fpic -g -O2 -fno-omit-frame-pointer -mno-omit-leaf-frame-pointer -ffile-prefix-map=/build/r-base-EawLoD/r-base-4.4.1=. -fstack-protector-strong -fstack-clash-protection -Wformat -Werror=format-security -fcf-protection -fdebug-prefix-map=/build/r-base-EawLoD/r-base-4.4.1=/usr/src/r-base-4.4.1-1.2404.0 -Wdate-time -D_FORTIFY_SOURCE=3 -c DbColumn.cpp -o DbColumn.o g++ -std=gnu++17 -I"/usr/share/R/include" -DNDEBUG -I. -Ivendor -Ivendor/extensions -Ivendor/sqlite3 -DRSQLITE_USE_BUNDLED_SQLITE -DSQLITE_ENABLE_RTREE -DSQLITE_ENABLE_FTS3 -DSQLITE_ENABLE_FTS3_PARENTHESIS -DSQLITE_ENABLE_FTS5 -DSQLITE_ENABLE_JSON1 -DSQLITE_ENABLE_STAT4 -DSQLITE_SOUNDEX -DSQLITE_USE_URI=1 -DSQLITE_MAX_LENGTH=2147483647 -DHAVE_USLEEP=1 -I'/home/omnipath/local/R/4.4-3.20/plogr/include' -I'/home/omnipath/local/R/4.4-3.20/cpp11/include' -fvisibility=hidden -fpic -g -O2 -fno-omit-frame-pointer -mno-omit-leaf-frame-pointer -ffile-prefix-map=/build/r-base-EawLoD/r-base-4.4.1=. -fstack-protector-strong -fstack-clash-protection -Wformat -Werror=format-security -fcf-protection -fdebug-prefix-map=/build/r-base-EawLoD/r-base-4.4.1=/usr/src/r-base-4.4.1-1.2404.0 -Wdate-time -D_FORTIFY_SOURCE=3 -c DbColumnDataSource.cpp -o DbColumnDataSource.o g++ -std=gnu++17 -I"/usr/share/R/include" -DNDEBUG -I. -Ivendor -Ivendor/extensions -Ivendor/sqlite3 -DRSQLITE_USE_BUNDLED_SQLITE -DSQLITE_ENABLE_RTREE -DSQLITE_ENABLE_FTS3 -DSQLITE_ENABLE_FTS3_PARENTHESIS -DSQLITE_ENABLE_FTS5 -DSQLITE_ENABLE_JSON1 -DSQLITE_ENABLE_STAT4 -DSQLITE_SOUNDEX -DSQLITE_USE_URI=1 -DSQLITE_MAX_LENGTH=2147483647 -DHAVE_USLEEP=1 -I'/home/omnipath/local/R/4.4-3.20/plogr/include' -I'/home/omnipath/local/R/4.4-3.20/cpp11/include' -fvisibility=hidden -fpic -g -O2 -fno-omit-frame-pointer -mno-omit-leaf-frame-pointer -ffile-prefix-map=/build/r-base-EawLoD/r-base-4.4.1=. -fstack-protector-strong -fstack-clash-protection -Wformat -Werror=format-security -fcf-protection -fdebug-prefix-map=/build/r-base-EawLoD/r-base-4.4.1=/usr/src/r-base-4.4.1-1.2404.0 -Wdate-time -D_FORTIFY_SOURCE=3 -c DbColumnDataSourceFactory.cpp -o DbColumnDataSourceFactory.o g++ -std=gnu++17 -I"/usr/share/R/include" -DNDEBUG -I. -Ivendor -Ivendor/extensions -Ivendor/sqlite3 -DRSQLITE_USE_BUNDLED_SQLITE -DSQLITE_ENABLE_RTREE -DSQLITE_ENABLE_FTS3 -DSQLITE_ENABLE_FTS3_PARENTHESIS -DSQLITE_ENABLE_FTS5 -DSQLITE_ENABLE_JSON1 -DSQLITE_ENABLE_STAT4 -DSQLITE_SOUNDEX -DSQLITE_USE_URI=1 -DSQLITE_MAX_LENGTH=2147483647 -DHAVE_USLEEP=1 -I'/home/omnipath/local/R/4.4-3.20/plogr/include' -I'/home/omnipath/local/R/4.4-3.20/cpp11/include' -fvisibility=hidden -fpic -g -O2 -fno-omit-frame-pointer -mno-omit-leaf-frame-pointer -ffile-prefix-map=/build/r-base-EawLoD/r-base-4.4.1=. -fstack-protector-strong -fstack-clash-protection -Wformat -Werror=format-security -fcf-protection -fdebug-prefix-map=/build/r-base-EawLoD/r-base-4.4.1=/usr/src/r-base-4.4.1-1.2404.0 -Wdate-time -D_FORTIFY_SOURCE=3 -c DbColumnStorage.cpp -o DbColumnStorage.o g++ -std=gnu++17 -I"/usr/share/R/include" -DNDEBUG -I. -Ivendor -Ivendor/extensions -Ivendor/sqlite3 -DRSQLITE_USE_BUNDLED_SQLITE -DSQLITE_ENABLE_RTREE -DSQLITE_ENABLE_FTS3 -DSQLITE_ENABLE_FTS3_PARENTHESIS -DSQLITE_ENABLE_FTS5 -DSQLITE_ENABLE_JSON1 -DSQLITE_ENABLE_STAT4 -DSQLITE_SOUNDEX -DSQLITE_USE_URI=1 -DSQLITE_MAX_LENGTH=2147483647 -DHAVE_USLEEP=1 -I'/home/omnipath/local/R/4.4-3.20/plogr/include' -I'/home/omnipath/local/R/4.4-3.20/cpp11/include' -fvisibility=hidden -fpic -g -O2 -fno-omit-frame-pointer -mno-omit-leaf-frame-pointer -ffile-prefix-map=/build/r-base-EawLoD/r-base-4.4.1=. -fstack-protector-strong -fstack-clash-protection -Wformat -Werror=format-security -fcf-protection -fdebug-prefix-map=/build/r-base-EawLoD/r-base-4.4.1=/usr/src/r-base-4.4.1-1.2404.0 -Wdate-time -D_FORTIFY_SOURCE=3 -c DbConnection.cpp -o DbConnection.o g++ -std=gnu++17 -I"/usr/share/R/include" -DNDEBUG -I. -Ivendor -Ivendor/extensions -Ivendor/sqlite3 -DRSQLITE_USE_BUNDLED_SQLITE -DSQLITE_ENABLE_RTREE -DSQLITE_ENABLE_FTS3 -DSQLITE_ENABLE_FTS3_PARENTHESIS -DSQLITE_ENABLE_FTS5 -DSQLITE_ENABLE_JSON1 -DSQLITE_ENABLE_STAT4 -DSQLITE_SOUNDEX -DSQLITE_USE_URI=1 -DSQLITE_MAX_LENGTH=2147483647 -DHAVE_USLEEP=1 -I'/home/omnipath/local/R/4.4-3.20/plogr/include' -I'/home/omnipath/local/R/4.4-3.20/cpp11/include' -fvisibility=hidden -fpic -g -O2 -fno-omit-frame-pointer -mno-omit-leaf-frame-pointer -ffile-prefix-map=/build/r-base-EawLoD/r-base-4.4.1=. -fstack-protector-strong -fstack-clash-protection -Wformat -Werror=format-security -fcf-protection -fdebug-prefix-map=/build/r-base-EawLoD/r-base-4.4.1=/usr/src/r-base-4.4.1-1.2404.0 -Wdate-time -D_FORTIFY_SOURCE=3 -c DbDataFrame.cpp -o DbDataFrame.o In file included from vendor/boost/smart_ptr/detail/sp_thread_sleep.hpp:22, from vendor/boost/smart_ptr/detail/yield_k.hpp:23, from vendor/boost/smart_ptr/detail/spinlock_gcc_atomic.hpp:14, from vendor/boost/smart_ptr/detail/spinlock.hpp:42, from vendor/boost/smart_ptr/detail/spinlock_pool.hpp:25, from vendor/boost/smart_ptr/shared_ptr.hpp:29, from vendor/boost/shared_ptr.hpp:17, from DbColumn.h:9, from DbDataFrame.cpp:3: vendor/boost/config/pragma_message.hpp:24:34: note: ‘#pragma message: The practice of declaring the Bind placeholders (_1, _2, ...) in the global namespace is deprecated. Please use + using namespace boost::placeholders, or define BOOST_BIND_GLOBAL_PLACEHOLDERS to retain the current behavior.’ 24 | # define BOOST_PRAGMA_MESSAGE(x) _Pragma(BOOST_STRINGIZE(message(x))) | ^~~~~~~ vendor/boost/bind.hpp:36:1: note: in expansion of macro ‘BOOST_PRAGMA_MESSAGE’ 36 | BOOST_PRAGMA_MESSAGE( | ^~~~~~~~~~~~~~~~~~~~ In file included from vendor/boost/concept/assert.hpp:35, from vendor/boost/concept_check.hpp:20, from vendor/boost/range/concepts.hpp:19, from vendor/boost/range/size_type.hpp:20, from vendor/boost/range/size.hpp:21, from vendor/boost/range/functions.hpp:20, from vendor/boost/ptr_container/detail/reversible_ptr_container.hpp:30, from vendor/boost/ptr_container/ptr_sequence_adapter.hpp:20, from vendor/boost/ptr_container/ptr_vector.hpp:20, from RSQLite.h:17, from pch.h:1, from DbDataFrame.cpp:1: vendor/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements > >]’: vendor/boost/concept_check.hpp:167:5: required from ‘struct boost::CopyConstructible >’ vendor/boost/range/concepts.hpp:125:16: required from ‘struct boost::range_detail::IncrementableIteratorConcept >’ vendor/boost/range/concepts.hpp:147:16: required from ‘struct boost::range_detail::SinglePassIteratorConcept >’ vendor/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::range_detail::SinglePassIteratorConcept >]’ vendor/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied > >::value’ vendor/boost/concept/detail/has_constraints.hpp:45:51: [ skipping 3 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] vendor/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::SinglePassRangeConcept >]’ vendor/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied > >::value’ vendor/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied > >’ vendor/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_ >)>’ vendor/boost/range/size.hpp:62:9: required from ‘Fn2 boost::range::for_each(SinglePassRange1&, SinglePassRange2&, Fn2) [with SinglePassRange1 = boost::container::stable_vector; SinglePassRange2 = std::vector >; Fn2 = boost::_bi::bind_t, boost::_bi::list2, boost::arg<2> > >]’ DbDataFrame.cpp:54:18: required from here vendor/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ In file included from vendor/boost/concept_check.hpp:31: vendor/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(); } | ^ vendor/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements >]’: vendor/boost/concept_check.hpp:208:5: required from ‘struct boost::Convertible’ vendor/boost/concept/detail/has_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]’ vendor/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied >::value’ vendor/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied >’ vendor/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_)>’ vendor/boost/iterator/iterator_concepts.hpp:114:7: [ skipping 7 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] vendor/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::SinglePassRangeConcept >]’ vendor/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied > >::value’ vendor/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied > >’ vendor/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_ >)>’ vendor/boost/range/size.hpp:62:9: required from ‘Fn2 boost::range::for_each(SinglePassRange1&, SinglePassRange2&, Fn2) [with SinglePassRange1 = boost::container::stable_vector; SinglePassRange2 = std::vector >; Fn2 = boost::_bi::bind_t, boost::_bi::list2, boost::arg<2> > >]’ DbDataFrame.cpp:54:18: required from here vendor/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ vendor/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(); } | ^ vendor/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::Convertible]’: vendor/boost/iterator/iterator_concepts.hpp:114:7: required from ‘struct boost::range_detail::IncrementableIteratorConcept >’ vendor/boost/range/concepts.hpp:147:16: required from ‘struct boost::range_detail::SinglePassIteratorConcept >’ vendor/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::range_detail::SinglePassIteratorConcept >]’ vendor/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied > >::value’ vendor/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied > >’ vendor/boost/concept/detail/general.hpp:72:8: [ skipping 2 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] vendor/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::SinglePassRangeConcept >]’ vendor/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied > >::value’ vendor/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied > >’ vendor/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_ >)>’ vendor/boost/range/size.hpp:62:9: required from ‘Fn2 boost::range::for_each(SinglePassRange1&, SinglePassRange2&, Fn2) [with SinglePassRange1 = boost::container::stable_vector; SinglePassRange2 = std::vector >; Fn2 = boost::_bi::bind_t, boost::_bi::list2, boost::arg<2> > >]’ DbDataFrame.cpp:54:18: required from here vendor/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ vendor/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::Convertible::~Convertible() [with X = boost::iterators::random_access_traversal_tag; Y = boost::iterators::incrementable_traversal_tag]’ 37 | ~model() | ^ vendor/boost/concept_check.hpp:208:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 208 | BOOST_CONCEPT_USAGE(Convertible) { | ^~~~~~~~~~~~~~~~~~~ vendor/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements > >]’: vendor/boost/range/concepts.hpp:136:13: required from ‘struct boost::range_detail::IncrementableIteratorConcept >’ vendor/boost/range/concepts.hpp:147:16: required from ‘struct boost::range_detail::SinglePassIteratorConcept >’ vendor/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::range_detail::SinglePassIteratorConcept >]’ vendor/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied > >::value’ vendor/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied > >’ vendor/boost/concept/detail/general.hpp:72:8: [ skipping 2 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] vendor/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::SinglePassRangeConcept >]’ vendor/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied > >::value’ vendor/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied > >’ vendor/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_ >)>’ vendor/boost/range/size.hpp:62:9: required from ‘Fn2 boost::range::for_each(SinglePassRange1&, SinglePassRange2&, Fn2) [with SinglePassRange1 = boost::container::stable_vector; SinglePassRange2 = std::vector >; Fn2 = boost::_bi::bind_t, boost::_bi::list2, boost::arg<2> > >]’ DbDataFrame.cpp:54:18: required from here vendor/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ vendor/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::range_detail::IncrementableIteratorConcept >]’ 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ^ vendor/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements > >]’: vendor/boost/concept_check.hpp:233:5: required from ‘struct boost::EqualityComparable >’ vendor/boost/range/concepts.hpp:147:16: required from ‘struct boost::range_detail::SinglePassIteratorConcept >’ vendor/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::range_detail::SinglePassIteratorConcept >]’ vendor/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied > >::value’ vendor/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied > >’ vendor/boost/concept/detail/general.hpp:72:8: [ skipping 2 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] vendor/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::SinglePassRangeConcept >]’ vendor/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied > >::value’ vendor/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied > >’ vendor/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_ >)>’ vendor/boost/range/size.hpp:62:9: required from ‘Fn2 boost::range::for_each(SinglePassRange1&, SinglePassRange2&, Fn2) [with SinglePassRange1 = boost::container::stable_vector; SinglePassRange2 = std::vector >; Fn2 = boost::_bi::bind_t, boost::_bi::list2, boost::arg<2> > >]’ DbDataFrame.cpp:54:18: required from here vendor/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ vendor/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(); } | ^ vendor/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements >]’: vendor/boost/concept_check.hpp:208:5: required from ‘struct boost::Convertible’ vendor/boost/concept/detail/has_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]’ vendor/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied >::value’ vendor/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied >’ vendor/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_)>’ vendor/boost/range/concepts.hpp:152:13: [ skipping 6 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] vendor/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::SinglePassRangeConcept >]’ vendor/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied > >::value’ vendor/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied > >’ vendor/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_ >)>’ vendor/boost/range/size.hpp:62:9: required from ‘Fn2 boost::range::for_each(SinglePassRange1&, SinglePassRange2&, Fn2) [with SinglePassRange1 = boost::container::stable_vector; SinglePassRange2 = std::vector >; Fn2 = boost::_bi::bind_t, boost::_bi::list2, boost::arg<2> > >]’ DbDataFrame.cpp:54:18: required from here vendor/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ vendor/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(); } | ^ vendor/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::Convertible]’: vendor/boost/range/concepts.hpp:152:13: required from ‘struct boost::range_detail::SinglePassIteratorConcept >’ vendor/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::range_detail::SinglePassIteratorConcept >]’ vendor/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied > >::value’ vendor/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied > >’ vendor/boost/concept/detail/general.hpp:72:8: [ skipping 2 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] vendor/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::SinglePassRangeConcept >]’ vendor/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied > >::value’ vendor/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied > >’ vendor/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_ >)>’ vendor/boost/range/size.hpp:62:9: required from ‘Fn2 boost::range::for_each(SinglePassRange1&, SinglePassRange2&, Fn2) [with SinglePassRange1 = boost::container::stable_vector; SinglePassRange2 = std::vector >; Fn2 = boost::_bi::bind_t, boost::_bi::list2, boost::arg<2> > >]’ DbDataFrame.cpp:54:18: required from here vendor/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ vendor/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::Convertible::~Convertible() [with X = boost::iterators::random_access_traversal_tag; Y = boost::iterators::single_pass_traversal_tag]’ 37 | ~model() | ^ vendor/boost/concept_check.hpp:208:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 208 | BOOST_CONCEPT_USAGE(Convertible) { | ^~~~~~~~~~~~~~~~~~~ vendor/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements > >]’: vendor/boost/range/concepts.hpp:158:13: required from ‘struct boost::range_detail::SinglePassIteratorConcept >’ vendor/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::range_detail::SinglePassIteratorConcept >]’ vendor/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied > >::value’ vendor/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied > >’ vendor/boost/concept/detail/general.hpp:72:8: [ skipping 2 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] vendor/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::SinglePassRangeConcept >]’ vendor/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied > >::value’ vendor/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied > >’ vendor/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_ >)>’ vendor/boost/range/size.hpp:62:9: required from ‘Fn2 boost::range::for_each(SinglePassRange1&, SinglePassRange2&, Fn2) [with SinglePassRange1 = boost::container::stable_vector; SinglePassRange2 = std::vector >; Fn2 = boost::_bi::bind_t, boost::_bi::list2, boost::arg<2> > >]’ DbDataFrame.cpp:54:18: required from here vendor/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ vendor/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::range_detail::SinglePassIteratorConcept >]’ 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ^ vendor/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::range_detail::SinglePassIteratorConcept >]’: vendor/boost/range/concepts.hpp:278:9: required from ‘struct boost::SinglePassRangeConcept >’ vendor/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::SinglePassRangeConcept >]’ vendor/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied > >::value’ vendor/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied > >’ vendor/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_ >)>’ vendor/boost/range/size.hpp:62:9: required from ‘Fn2 boost::range::for_each(SinglePassRange1&, SinglePassRange2&, Fn2) [with SinglePassRange1 = boost::container::stable_vector; SinglePassRange2 = std::vector >; Fn2 = boost::_bi::bind_t, boost::_bi::list2, boost::arg<2> > >]’ DbDataFrame.cpp:54:18: required from here vendor/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ vendor/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::range_detail::SinglePassIteratorConcept::~SinglePassIteratorConcept() [with Iterator = boost::container::stable_vector_iterator]’ 37 | ~model() | ^ vendor/boost/range/concepts.hpp:158:13: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 158 | BOOST_CONCEPT_USAGE(SinglePassIteratorConcept) | ^~~~~~~~~~~~~~~~~~~ vendor/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements > >]’: vendor/boost/concept_check.hpp:167:5: required from ‘struct boost::CopyConstructible >’ vendor/boost/range/concepts.hpp:125:16: required from ‘struct boost::range_detail::IncrementableIteratorConcept >’ vendor/boost/range/concepts.hpp:147:16: required from ‘struct boost::range_detail::SinglePassIteratorConcept >’ vendor/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::range_detail::SinglePassIteratorConcept >]’ vendor/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied > >::value’ vendor/boost/concept/detail/has_constraints.hpp:45:51: [ skipping 3 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] vendor/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::SinglePassRangeConcept >]’ vendor/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied > >::value’ vendor/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied > >’ vendor/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_ >)>’ vendor/boost/range/size.hpp:62:9: required from ‘Fn2 boost::range::for_each(SinglePassRange1&, SinglePassRange2&, Fn2) [with SinglePassRange1 = boost::container::stable_vector; SinglePassRange2 = std::vector >; Fn2 = boost::_bi::bind_t, boost::_bi::list2, boost::arg<2> > >]’ DbDataFrame.cpp:54:18: required from here vendor/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ vendor/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(); } | ^ vendor/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements > >]’: vendor/boost/range/concepts.hpp:136:13: required from ‘struct boost::range_detail::IncrementableIteratorConcept >’ vendor/boost/range/concepts.hpp:147:16: required from ‘struct boost::range_detail::SinglePassIteratorConcept >’ vendor/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::range_detail::SinglePassIteratorConcept >]’ vendor/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied > >::value’ vendor/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied > >’ vendor/boost/concept/detail/general.hpp:72:8: [ skipping 2 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] vendor/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::SinglePassRangeConcept >]’ vendor/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied > >::value’ vendor/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied > >’ vendor/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_ >)>’ vendor/boost/range/size.hpp:62:9: required from ‘Fn2 boost::range::for_each(SinglePassRange1&, SinglePassRange2&, Fn2) [with SinglePassRange1 = boost::container::stable_vector; SinglePassRange2 = std::vector >; Fn2 = boost::_bi::bind_t, boost::_bi::list2, boost::arg<2> > >]’ DbDataFrame.cpp:54:18: required from here vendor/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ vendor/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::range_detail::IncrementableIteratorConcept >]’ 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ^ vendor/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements > >]’: vendor/boost/concept_check.hpp:233:5: required from ‘struct boost::EqualityComparable >’ vendor/boost/range/concepts.hpp:147:16: required from ‘struct boost::range_detail::SinglePassIteratorConcept >’ vendor/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::range_detail::SinglePassIteratorConcept >]’ vendor/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied > >::value’ vendor/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied > >’ vendor/boost/concept/detail/general.hpp:72:8: [ skipping 2 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] vendor/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::SinglePassRangeConcept >]’ vendor/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied > >::value’ vendor/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied > >’ vendor/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_ >)>’ vendor/boost/range/size.hpp:62:9: required from ‘Fn2 boost::range::for_each(SinglePassRange1&, SinglePassRange2&, Fn2) [with SinglePassRange1 = boost::container::stable_vector; SinglePassRange2 = std::vector >; Fn2 = boost::_bi::bind_t, boost::_bi::list2, boost::arg<2> > >]’ DbDataFrame.cpp:54:18: required from here vendor/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ vendor/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(); } | ^ vendor/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements > >]’: vendor/boost/range/concepts.hpp:158:13: required from ‘struct boost::range_detail::SinglePassIteratorConcept >’ vendor/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::range_detail::SinglePassIteratorConcept >]’ vendor/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied > >::value’ vendor/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied > >’ vendor/boost/concept/detail/general.hpp:72:8: [ skipping 2 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] vendor/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::SinglePassRangeConcept >]’ vendor/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied > >::value’ vendor/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied > >’ vendor/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_ >)>’ vendor/boost/range/size.hpp:62:9: required from ‘Fn2 boost::range::for_each(SinglePassRange1&, SinglePassRange2&, Fn2) [with SinglePassRange1 = boost::container::stable_vector; SinglePassRange2 = std::vector >; Fn2 = boost::_bi::bind_t, boost::_bi::list2, boost::arg<2> > >]’ DbDataFrame.cpp:54:18: required from here vendor/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ vendor/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::range_detail::SinglePassIteratorConcept >]’ 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ^ vendor/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::range_detail::SinglePassIteratorConcept >]’: vendor/boost/range/concepts.hpp:281:9: required from ‘struct boost::SinglePassRangeConcept >’ vendor/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::SinglePassRangeConcept >]’ vendor/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied > >::value’ vendor/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied > >’ vendor/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_ >)>’ vendor/boost/range/size.hpp:62:9: required from ‘Fn2 boost::range::for_each(SinglePassRange1&, SinglePassRange2&, Fn2) [with SinglePassRange1 = boost::container::stable_vector; SinglePassRange2 = std::vector >; Fn2 = boost::_bi::bind_t, boost::_bi::list2, boost::arg<2> > >]’ DbDataFrame.cpp:54:18: required from here vendor/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ vendor/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::range_detail::SinglePassIteratorConcept::~SinglePassIteratorConcept() [with Iterator = boost::container::stable_vector_iterator]’ 37 | ~model() | ^ vendor/boost/range/concepts.hpp:158:13: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 158 | BOOST_CONCEPT_USAGE(SinglePassIteratorConcept) | ^~~~~~~~~~~~~~~~~~~ vendor/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements > >]’: vendor/boost/range/concepts.hpp:284:9: required from ‘struct boost::SinglePassRangeConcept >’ vendor/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::SinglePassRangeConcept >]’ vendor/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied > >::value’ vendor/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied > >’ vendor/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_ >)>’ vendor/boost/range/size.hpp:62:9: required from ‘Fn2 boost::range::for_each(SinglePassRange1&, SinglePassRange2&, Fn2) [with SinglePassRange1 = boost::container::stable_vector; SinglePassRange2 = std::vector >; Fn2 = boost::_bi::bind_t, boost::_bi::list2, boost::arg<2> > >]’ DbDataFrame.cpp:54:18: required from here vendor/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ vendor/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::SinglePassRangeConcept >]’ 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ^ vendor/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::SinglePassRangeConcept >]’: vendor/boost/range/size.hpp:62:9: required from ‘Fn2 boost::range::for_each(SinglePassRange1&, SinglePassRange2&, Fn2) [with SinglePassRange1 = boost::container::stable_vector; SinglePassRange2 = std::vector >; Fn2 = boost::_bi::bind_t, boost::_bi::list2, boost::arg<2> > >]’ DbDataFrame.cpp:54:18: required from here vendor/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ vendor/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::SinglePassRangeConcept::~SinglePassRangeConcept() [with T = boost::container::stable_vector]’ 37 | ~model() | ^ vendor/boost/range/concepts.hpp:284:9: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 284 | BOOST_CONCEPT_USAGE(SinglePassRangeConcept) | ^~~~~~~~~~~~~~~~~~~ vendor/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements*, std::vector > > > >]’: vendor/boost/concept_check.hpp:167:5: required from ‘struct boost::CopyConstructible<__gnu_cxx::__normal_iterator*, std::vector > > >’ vendor/boost/range/concepts.hpp:125:16: required from ‘struct boost::range_detail::IncrementableIteratorConcept<__gnu_cxx::__normal_iterator*, std::vector > > >’ vendor/boost/range/concepts.hpp:147:16: required from ‘struct boost::range_detail::SinglePassIteratorConcept<__gnu_cxx::__normal_iterator*, std::vector > > >’ vendor/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::range_detail::SinglePassIteratorConcept<__gnu_cxx::__normal_iterator*, std::vector > > >]’ vendor/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied*, std::vector > > > >::value’ vendor/boost/concept/detail/has_constraints.hpp:45:51: [ skipping 3 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] vendor/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::SinglePassRangeConcept > >]’ vendor/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied > > >::value’ vendor/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied > > >’ vendor/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_ > >)>’ vendor/boost/range/algorithm_ext/for_each.hpp:54:13: required from ‘Fn2 boost::range::for_each(SinglePassRange1&, SinglePassRange2&, Fn2) [with SinglePassRange1 = boost::container::stable_vector; SinglePassRange2 = std::vector >; Fn2 = boost::_bi::bind_t, boost::_bi::list2, boost::arg<2> > >]’ DbDataFrame.cpp:54:18: required from here vendor/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ vendor/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::CopyConstructible<__gnu_cxx::__normal_iterator*, std::vector > > >]’ 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ^ vendor/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements*, std::vector > > > >]’: vendor/boost/range/concepts.hpp:136:13: required from ‘struct boost::range_detail::IncrementableIteratorConcept<__gnu_cxx::__normal_iterator*, std::vector > > >’ vendor/boost/range/concepts.hpp:147:16: required from ‘struct boost::range_detail::SinglePassIteratorConcept<__gnu_cxx::__normal_iterator*, std::vector > > >’ vendor/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::range_detail::SinglePassIteratorConcept<__gnu_cxx::__normal_iterator*, std::vector > > >]’ vendor/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied*, std::vector > > > >::value’ vendor/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied*, std::vector > > > >’ vendor/boost/concept/detail/general.hpp:72:8: [ skipping 2 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] vendor/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::SinglePassRangeConcept > >]’ vendor/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied > > >::value’ vendor/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied > > >’ vendor/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_ > >)>’ vendor/boost/range/algorithm_ext/for_each.hpp:54:13: required from ‘Fn2 boost::range::for_each(SinglePassRange1&, SinglePassRange2&, Fn2) [with SinglePassRange1 = boost::container::stable_vector; SinglePassRange2 = std::vector >; Fn2 = boost::_bi::bind_t, boost::_bi::list2, boost::arg<2> > >]’ DbDataFrame.cpp:54:18: required from here vendor/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ vendor/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::range_detail::IncrementableIteratorConcept<__gnu_cxx::__normal_iterator*, std::vector > > >]’ 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ^ vendor/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements*, std::vector > > > >]’: vendor/boost/concept_check.hpp:233:5: required from ‘struct boost::EqualityComparable<__gnu_cxx::__normal_iterator*, std::vector > > >’ vendor/boost/range/concepts.hpp:147:16: required from ‘struct boost::range_detail::SinglePassIteratorConcept<__gnu_cxx::__normal_iterator*, std::vector > > >’ vendor/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::range_detail::SinglePassIteratorConcept<__gnu_cxx::__normal_iterator*, std::vector > > >]’ vendor/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied*, std::vector > > > >::value’ vendor/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied*, std::vector > > > >’ vendor/boost/concept/detail/general.hpp:72:8: [ skipping 2 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] vendor/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::SinglePassRangeConcept > >]’ vendor/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied > > >::value’ vendor/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied > > >’ vendor/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_ > >)>’ vendor/boost/range/algorithm_ext/for_each.hpp:54:13: required from ‘Fn2 boost::range::for_each(SinglePassRange1&, SinglePassRange2&, Fn2) [with SinglePassRange1 = boost::container::stable_vector; SinglePassRange2 = std::vector >; Fn2 = boost::_bi::bind_t, boost::_bi::list2, boost::arg<2> > >]’ DbDataFrame.cpp:54:18: required from here vendor/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ vendor/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::EqualityComparable<__gnu_cxx::__normal_iterator*, std::vector > > >]’ 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ^ vendor/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements*, std::vector > > > >]’: vendor/boost/range/concepts.hpp:158:13: required from ‘struct boost::range_detail::SinglePassIteratorConcept<__gnu_cxx::__normal_iterator*, std::vector > > >’ vendor/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::range_detail::SinglePassIteratorConcept<__gnu_cxx::__normal_iterator*, std::vector > > >]’ vendor/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied*, std::vector > > > >::value’ vendor/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied*, std::vector > > > >’ vendor/boost/concept/detail/general.hpp:72:8: [ skipping 2 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] vendor/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::SinglePassRangeConcept > >]’ vendor/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied > > >::value’ vendor/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied > > >’ vendor/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_ > >)>’ vendor/boost/range/algorithm_ext/for_each.hpp:54:13: required from ‘Fn2 boost::range::for_each(SinglePassRange1&, SinglePassRange2&, Fn2) [with SinglePassRange1 = boost::container::stable_vector; SinglePassRange2 = std::vector >; Fn2 = boost::_bi::bind_t, boost::_bi::list2, boost::arg<2> > >]’ DbDataFrame.cpp:54:18: required from here vendor/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ vendor/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::range_detail::SinglePassIteratorConcept<__gnu_cxx::__normal_iterator*, std::vector > > >]’ 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ^ vendor/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::range_detail::SinglePassIteratorConcept<__gnu_cxx::__normal_iterator*, std::vector > > >]’: vendor/boost/range/concepts.hpp:278:9: required from ‘struct boost::SinglePassRangeConcept > >’ vendor/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::SinglePassRangeConcept > >]’ vendor/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied > > >::value’ vendor/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied > > >’ vendor/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_ > >)>’ vendor/boost/range/algorithm_ext/for_each.hpp:54:13: required from ‘Fn2 boost::range::for_each(SinglePassRange1&, SinglePassRange2&, Fn2) [with SinglePassRange1 = boost::container::stable_vector; SinglePassRange2 = std::vector >; Fn2 = boost::_bi::bind_t, boost::_bi::list2, boost::arg<2> > >]’ DbDataFrame.cpp:54:18: required from here vendor/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ vendor/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::range_detail::SinglePassIteratorConcept::~SinglePassIteratorConcept() [with Iterator = __gnu_cxx::__normal_iterator*, std::vector > >]’ 37 | ~model() | ^ vendor/boost/range/concepts.hpp:158:13: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 158 | BOOST_CONCEPT_USAGE(SinglePassIteratorConcept) | ^~~~~~~~~~~~~~~~~~~ vendor/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements*, std::vector > > > >]’: vendor/boost/concept_check.hpp:167:5: required from ‘struct boost::CopyConstructible<__gnu_cxx::__normal_iterator*, std::vector > > >’ vendor/boost/range/concepts.hpp:125:16: required from ‘struct boost::range_detail::IncrementableIteratorConcept<__gnu_cxx::__normal_iterator*, std::vector > > >’ vendor/boost/range/concepts.hpp:147:16: required from ‘struct boost::range_detail::SinglePassIteratorConcept<__gnu_cxx::__normal_iterator*, std::vector > > >’ vendor/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::range_detail::SinglePassIteratorConcept<__gnu_cxx::__normal_iterator*, std::vector > > >]’ vendor/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied*, std::vector > > > >::value’ vendor/boost/concept/detail/has_constraints.hpp:45:51: [ skipping 3 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] vendor/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::SinglePassRangeConcept > >]’ vendor/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied > > >::value’ vendor/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied > > >’ vendor/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_ > >)>’ vendor/boost/range/algorithm_ext/for_each.hpp:54:13: required from ‘Fn2 boost::range::for_each(SinglePassRange1&, SinglePassRange2&, Fn2) [with SinglePassRange1 = boost::container::stable_vector; SinglePassRange2 = std::vector >; Fn2 = boost::_bi::bind_t, boost::_bi::list2, boost::arg<2> > >]’ DbDataFrame.cpp:54:18: required from here vendor/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ vendor/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::CopyConstructible<__gnu_cxx::__normal_iterator*, std::vector > > >]’ 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ^ vendor/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements*, std::vector > > > >]’: vendor/boost/range/concepts.hpp:136:13: required from ‘struct boost::range_detail::IncrementableIteratorConcept<__gnu_cxx::__normal_iterator*, std::vector > > >’ vendor/boost/range/concepts.hpp:147:16: required from ‘struct boost::range_detail::SinglePassIteratorConcept<__gnu_cxx::__normal_iterator*, std::vector > > >’ vendor/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::range_detail::SinglePassIteratorConcept<__gnu_cxx::__normal_iterator*, std::vector > > >]’ vendor/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied*, std::vector > > > >::value’ vendor/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied*, std::vector > > > >’ vendor/boost/concept/detail/general.hpp:72:8: [ skipping 2 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] vendor/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::SinglePassRangeConcept > >]’ vendor/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied > > >::value’ vendor/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied > > >’ vendor/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_ > >)>’ vendor/boost/range/algorithm_ext/for_each.hpp:54:13: required from ‘Fn2 boost::range::for_each(SinglePassRange1&, SinglePassRange2&, Fn2) [with SinglePassRange1 = boost::container::stable_vector; SinglePassRange2 = std::vector >; Fn2 = boost::_bi::bind_t, boost::_bi::list2, boost::arg<2> > >]’ DbDataFrame.cpp:54:18: required from here vendor/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ vendor/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::range_detail::IncrementableIteratorConcept<__gnu_cxx::__normal_iterator*, std::vector > > >]’ 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ^ vendor/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements*, std::vector > > > >]’: vendor/boost/concept_check.hpp:233:5: required from ‘struct boost::EqualityComparable<__gnu_cxx::__normal_iterator*, std::vector > > >’ vendor/boost/range/concepts.hpp:147:16: required from ‘struct boost::range_detail::SinglePassIteratorConcept<__gnu_cxx::__normal_iterator*, std::vector > > >’ vendor/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::range_detail::SinglePassIteratorConcept<__gnu_cxx::__normal_iterator*, std::vector > > >]’ vendor/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied*, std::vector > > > >::value’ vendor/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied*, std::vector > > > >’ vendor/boost/concept/detail/general.hpp:72:8: [ skipping 2 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] vendor/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::SinglePassRangeConcept > >]’ vendor/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied > > >::value’ vendor/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied > > >’ vendor/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_ > >)>’ vendor/boost/range/algorithm_ext/for_each.hpp:54:13: required from ‘Fn2 boost::range::for_each(SinglePassRange1&, SinglePassRange2&, Fn2) [with SinglePassRange1 = boost::container::stable_vector; SinglePassRange2 = std::vector >; Fn2 = boost::_bi::bind_t, boost::_bi::list2, boost::arg<2> > >]’ DbDataFrame.cpp:54:18: required from here vendor/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ vendor/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::EqualityComparable<__gnu_cxx::__normal_iterator*, std::vector > > >]’ 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ^ vendor/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements*, std::vector > > > >]’: vendor/boost/range/concepts.hpp:158:13: required from ‘struct boost::range_detail::SinglePassIteratorConcept<__gnu_cxx::__normal_iterator*, std::vector > > >’ vendor/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::range_detail::SinglePassIteratorConcept<__gnu_cxx::__normal_iterator*, std::vector > > >]’ vendor/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied*, std::vector > > > >::value’ vendor/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied*, std::vector > > > >’ vendor/boost/concept/detail/general.hpp:72:8: [ skipping 2 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] vendor/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::SinglePassRangeConcept > >]’ vendor/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied > > >::value’ vendor/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied > > >’ vendor/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_ > >)>’ vendor/boost/range/algorithm_ext/for_each.hpp:54:13: required from ‘Fn2 boost::range::for_each(SinglePassRange1&, SinglePassRange2&, Fn2) [with SinglePassRange1 = boost::container::stable_vector; SinglePassRange2 = std::vector >; Fn2 = boost::_bi::bind_t, boost::_bi::list2, boost::arg<2> > >]’ DbDataFrame.cpp:54:18: required from here vendor/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ vendor/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::range_detail::SinglePassIteratorConcept<__gnu_cxx::__normal_iterator*, std::vector > > >]’ 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ^ vendor/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::range_detail::SinglePassIteratorConcept<__gnu_cxx::__normal_iterator*, std::vector > > >]’: vendor/boost/range/concepts.hpp:281:9: required from ‘struct boost::SinglePassRangeConcept > >’ vendor/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::SinglePassRangeConcept > >]’ vendor/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied > > >::value’ vendor/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied > > >’ vendor/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_ > >)>’ vendor/boost/range/algorithm_ext/for_each.hpp:54:13: required from ‘Fn2 boost::range::for_each(SinglePassRange1&, SinglePassRange2&, Fn2) [with SinglePassRange1 = boost::container::stable_vector; SinglePassRange2 = std::vector >; Fn2 = boost::_bi::bind_t, boost::_bi::list2, boost::arg<2> > >]’ DbDataFrame.cpp:54:18: required from here vendor/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ vendor/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::range_detail::SinglePassIteratorConcept::~SinglePassIteratorConcept() [with Iterator = __gnu_cxx::__normal_iterator*, std::vector > >]’ 37 | ~model() | ^ vendor/boost/range/concepts.hpp:158:13: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 158 | BOOST_CONCEPT_USAGE(SinglePassIteratorConcept) | ^~~~~~~~~~~~~~~~~~~ vendor/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements > > >]’: vendor/boost/range/concepts.hpp:284:9: required from ‘struct boost::SinglePassRangeConcept > >’ vendor/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::SinglePassRangeConcept > >]’ vendor/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied > > >::value’ vendor/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied > > >’ vendor/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_ > >)>’ vendor/boost/range/algorithm_ext/for_each.hpp:54:13: required from ‘Fn2 boost::range::for_each(SinglePassRange1&, SinglePassRange2&, Fn2) [with SinglePassRange1 = boost::container::stable_vector; SinglePassRange2 = std::vector >; Fn2 = boost::_bi::bind_t, boost::_bi::list2, boost::arg<2> > >]’ DbDataFrame.cpp:54:18: required from here vendor/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ vendor/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::SinglePassRangeConcept > >]’ 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ^ vendor/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::SinglePassRangeConcept > >]’: vendor/boost/range/algorithm_ext/for_each.hpp:54:13: required from ‘Fn2 boost::range::for_each(SinglePassRange1&, SinglePassRange2&, Fn2) [with SinglePassRange1 = boost::container::stable_vector; SinglePassRange2 = std::vector >; Fn2 = boost::_bi::bind_t, boost::_bi::list2, boost::arg<2> > >]’ DbDataFrame.cpp:54:18: required from here vendor/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ vendor/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::SinglePassRangeConcept::~SinglePassRangeConcept() [with T = std::vector >]’ 37 | ~model() | ^ vendor/boost/range/concepts.hpp:284:9: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 284 | BOOST_CONCEPT_USAGE(SinglePassRangeConcept) | ^~~~~~~~~~~~~~~~~~~ vendor/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::CopyConstructible >]’: vendor/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements > >]’ vendor/boost/concept_check.hpp:167:5: required from ‘struct boost::CopyConstructible >’ vendor/boost/range/concepts.hpp:125:16: required from ‘struct boost::range_detail::IncrementableIteratorConcept >’ vendor/boost/range/concepts.hpp:147:16: required from ‘struct boost::range_detail::SinglePassIteratorConcept >’ vendor/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::range_detail::SinglePassIteratorConcept >]’ vendor/boost/concept/detail/has_constraints.hpp:42:5: [ skipping 4 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] vendor/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::SinglePassRangeConcept >]’ vendor/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied > >::value’ vendor/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied > >’ vendor/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_ >)>’ vendor/boost/range/size.hpp:62:9: required from ‘Fn2 boost::range::for_each(SinglePassRange1&, SinglePassRange2&, Fn2) [with SinglePassRange1 = boost::container::stable_vector; SinglePassRange2 = std::vector >; Fn2 = boost::_bi::bind_t, boost::_bi::list2, boost::arg<2> > >]’ DbDataFrame.cpp:54:18: required from here vendor/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ vendor/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::CopyConstructible::~CopyConstructible() [with TT = boost::container::stable_vector_iterator]’ 37 | ~model() | ^ vendor/boost/concept_check.hpp:167:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 167 | BOOST_CONCEPT_USAGE(CopyConstructible) { | ^~~~~~~~~~~~~~~~~~~ vendor/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::Convertible]’: vendor/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements >]’ vendor/boost/concept_check.hpp:208:5: required from ‘struct boost::Convertible’ vendor/boost/concept/detail/has_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]’ vendor/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied >::value’ vendor/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied >’ vendor/boost/concept/detail/general.hpp:72:8: [ skipping 8 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] vendor/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::SinglePassRangeConcept >]’ vendor/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied > >::value’ vendor/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied > >’ vendor/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_ >)>’ vendor/boost/range/size.hpp:62:9: required from ‘Fn2 boost::range::for_each(SinglePassRange1&, SinglePassRange2&, Fn2) [with SinglePassRange1 = boost::container::stable_vector; SinglePassRange2 = std::vector >; Fn2 = boost::_bi::bind_t, boost::_bi::list2, boost::arg<2> > >]’ DbDataFrame.cpp:54:18: required from here vendor/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ vendor/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::Convertible::~Convertible() [with X = boost::iterators::random_access_traversal_tag; Y = boost::iterators::incrementable_traversal_tag]’ 37 | ~model() | ^ vendor/boost/concept_check.hpp:208:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 208 | BOOST_CONCEPT_USAGE(Convertible) { | ^~~~~~~~~~~~~~~~~~~ vendor/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::range_detail::IncrementableIteratorConcept >]’: vendor/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements > >]’ vendor/boost/range/concepts.hpp:136:13: required from ‘struct boost::range_detail::IncrementableIteratorConcept >’ vendor/boost/range/concepts.hpp:147:16: required from ‘struct boost::range_detail::SinglePassIteratorConcept >’ vendor/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::range_detail::SinglePassIteratorConcept >]’ vendor/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied > >::value’ vendor/boost/concept/detail/has_constraints.hpp:45:51: [ skipping 3 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] vendor/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::SinglePassRangeConcept >]’ vendor/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied > >::value’ vendor/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied > >’ vendor/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_ >)>’ vendor/boost/range/size.hpp:62:9: required from ‘Fn2 boost::range::for_each(SinglePassRange1&, SinglePassRange2&, Fn2) [with SinglePassRange1 = boost::container::stable_vector; SinglePassRange2 = std::vector >; Fn2 = boost::_bi::bind_t, boost::_bi::list2, boost::arg<2> > >]’ DbDataFrame.cpp:54:18: required from here vendor/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ vendor/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::range_detail::IncrementableIteratorConcept::~IncrementableIteratorConcept() [with Iterator = boost::container::stable_vector_iterator]’ 37 | ~model() | ^ vendor/boost/range/concepts.hpp:136:13: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 136 | BOOST_CONCEPT_USAGE(IncrementableIteratorConcept) | ^~~~~~~~~~~~~~~~~~~ vendor/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::EqualityComparable >]’: vendor/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements > >]’ vendor/boost/concept_check.hpp:233:5: required from ‘struct boost::EqualityComparable >’ vendor/boost/range/concepts.hpp:147:16: required from ‘struct boost::range_detail::SinglePassIteratorConcept >’ vendor/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::range_detail::SinglePassIteratorConcept >]’ vendor/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied > >::value’ vendor/boost/concept/detail/has_constraints.hpp:45:51: [ skipping 3 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] vendor/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::SinglePassRangeConcept >]’ vendor/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied > >::value’ vendor/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied > >’ vendor/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_ >)>’ vendor/boost/range/size.hpp:62:9: required from ‘Fn2 boost::range::for_each(SinglePassRange1&, SinglePassRange2&, Fn2) [with SinglePassRange1 = boost::container::stable_vector; SinglePassRange2 = std::vector >; Fn2 = boost::_bi::bind_t, boost::_bi::list2, boost::arg<2> > >]’ DbDataFrame.cpp:54:18: required from here vendor/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ vendor/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::EqualityComparable::~EqualityComparable() [with TT = boost::container::stable_vector_iterator]’ 37 | ~model() | ^ vendor/boost/concept_check.hpp:233:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 233 | BOOST_CONCEPT_USAGE(EqualityComparable) { | ^~~~~~~~~~~~~~~~~~~ vendor/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::Convertible]’: vendor/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements >]’ vendor/boost/concept_check.hpp:208:5: required from ‘struct boost::Convertible’ vendor/boost/concept/detail/has_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]’ vendor/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied >::value’ vendor/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied >’ vendor/boost/concept/detail/general.hpp:72:8: [ skipping 7 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] vendor/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::SinglePassRangeConcept >]’ vendor/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied > >::value’ vendor/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied > >’ vendor/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_ >)>’ vendor/boost/range/size.hpp:62:9: required from ‘Fn2 boost::range::for_each(SinglePassRange1&, SinglePassRange2&, Fn2) [with SinglePassRange1 = boost::container::stable_vector; SinglePassRange2 = std::vector >; Fn2 = boost::_bi::bind_t, boost::_bi::list2, boost::arg<2> > >]’ DbDataFrame.cpp:54:18: required from here vendor/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ vendor/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::Convertible::~Convertible() [with X = boost::iterators::random_access_traversal_tag; Y = boost::iterators::single_pass_traversal_tag]’ 37 | ~model() | ^ vendor/boost/concept_check.hpp:208:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 208 | BOOST_CONCEPT_USAGE(Convertible) { | ^~~~~~~~~~~~~~~~~~~ vendor/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::range_detail::SinglePassIteratorConcept >]’: vendor/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements > >]’ vendor/boost/range/concepts.hpp:158:13: required from ‘struct boost::range_detail::SinglePassIteratorConcept >’ vendor/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::range_detail::SinglePassIteratorConcept >]’ vendor/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied > >::value’ vendor/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied > >’ vendor/boost/concept/detail/general.hpp:72:8: [ skipping 2 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] vendor/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::SinglePassRangeConcept >]’ vendor/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied > >::value’ vendor/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied > >’ vendor/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_ >)>’ vendor/boost/range/size.hpp:62:9: required from ‘Fn2 boost::range::for_each(SinglePassRange1&, SinglePassRange2&, Fn2) [with SinglePassRange1 = boost::container::stable_vector; SinglePassRange2 = std::vector >; Fn2 = boost::_bi::bind_t, boost::_bi::list2, boost::arg<2> > >]’ DbDataFrame.cpp:54:18: required from here vendor/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ vendor/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::range_detail::SinglePassIteratorConcept::~SinglePassIteratorConcept() [with Iterator = boost::container::stable_vector_iterator]’ 37 | ~model() | ^ vendor/boost/range/concepts.hpp:158:13: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 158 | BOOST_CONCEPT_USAGE(SinglePassIteratorConcept) | ^~~~~~~~~~~~~~~~~~~ vendor/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::CopyConstructible >]’: vendor/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements > >]’ vendor/boost/concept_check.hpp:167:5: required from ‘struct boost::CopyConstructible >’ vendor/boost/range/concepts.hpp:125:16: required from ‘struct boost::range_detail::IncrementableIteratorConcept >’ vendor/boost/range/concepts.hpp:147:16: required from ‘struct boost::range_detail::SinglePassIteratorConcept >’ vendor/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::range_detail::SinglePassIteratorConcept >]’ vendor/boost/concept/detail/has_constraints.hpp:42:5: [ skipping 4 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] vendor/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::SinglePassRangeConcept >]’ vendor/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied > >::value’ vendor/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied > >’ vendor/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_ >)>’ vendor/boost/range/size.hpp:62:9: required from ‘Fn2 boost::range::for_each(SinglePassRange1&, SinglePassRange2&, Fn2) [with SinglePassRange1 = boost::container::stable_vector; SinglePassRange2 = std::vector >; Fn2 = boost::_bi::bind_t, boost::_bi::list2, boost::arg<2> > >]’ DbDataFrame.cpp:54:18: required from here vendor/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ vendor/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::CopyConstructible::~CopyConstructible() [with TT = boost::container::stable_vector_iterator]’ 37 | ~model() | ^ vendor/boost/concept_check.hpp:167:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 167 | BOOST_CONCEPT_USAGE(CopyConstructible) { | ^~~~~~~~~~~~~~~~~~~ vendor/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::range_detail::IncrementableIteratorConcept >]’: vendor/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements > >]’ vendor/boost/range/concepts.hpp:136:13: required from ‘struct boost::range_detail::IncrementableIteratorConcept >’ vendor/boost/range/concepts.hpp:147:16: required from ‘struct boost::range_detail::SinglePassIteratorConcept >’ vendor/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::range_detail::SinglePassIteratorConcept >]’ vendor/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied > >::value’ vendor/boost/concept/detail/has_constraints.hpp:45:51: [ skipping 3 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] vendor/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::SinglePassRangeConcept >]’ vendor/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied > >::value’ vendor/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied > >’ vendor/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_ >)>’ vendor/boost/range/size.hpp:62:9: required from ‘Fn2 boost::range::for_each(SinglePassRange1&, SinglePassRange2&, Fn2) [with SinglePassRange1 = boost::container::stable_vector; SinglePassRange2 = std::vector >; Fn2 = boost::_bi::bind_t, boost::_bi::list2, boost::arg<2> > >]’ DbDataFrame.cpp:54:18: required from here vendor/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ vendor/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::range_detail::IncrementableIteratorConcept::~IncrementableIteratorConcept() [with Iterator = boost::container::stable_vector_iterator]’ 37 | ~model() | ^ vendor/boost/range/concepts.hpp:136:13: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 136 | BOOST_CONCEPT_USAGE(IncrementableIteratorConcept) | ^~~~~~~~~~~~~~~~~~~ vendor/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::EqualityComparable >]’: vendor/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements > >]’ vendor/boost/concept_check.hpp:233:5: required from ‘struct boost::EqualityComparable >’ vendor/boost/range/concepts.hpp:147:16: required from ‘struct boost::range_detail::SinglePassIteratorConcept >’ vendor/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::range_detail::SinglePassIteratorConcept >]’ vendor/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied > >::value’ vendor/boost/concept/detail/has_constraints.hpp:45:51: [ skipping 3 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] vendor/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::SinglePassRangeConcept >]’ vendor/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied > >::value’ vendor/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied > >’ vendor/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_ >)>’ vendor/boost/range/size.hpp:62:9: required from ‘Fn2 boost::range::for_each(SinglePassRange1&, SinglePassRange2&, Fn2) [with SinglePassRange1 = boost::container::stable_vector; SinglePassRange2 = std::vector >; Fn2 = boost::_bi::bind_t, boost::_bi::list2, boost::arg<2> > >]’ DbDataFrame.cpp:54:18: required from here vendor/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ vendor/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::EqualityComparable::~EqualityComparable() [with TT = boost::container::stable_vector_iterator]’ 37 | ~model() | ^ vendor/boost/concept_check.hpp:233:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 233 | BOOST_CONCEPT_USAGE(EqualityComparable) { | ^~~~~~~~~~~~~~~~~~~ vendor/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::range_detail::SinglePassIteratorConcept >]’: vendor/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements > >]’ vendor/boost/range/concepts.hpp:158:13: required from ‘struct boost::range_detail::SinglePassIteratorConcept >’ vendor/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::range_detail::SinglePassIteratorConcept >]’ vendor/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied > >::value’ vendor/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied > >’ vendor/boost/concept/detail/general.hpp:72:8: [ skipping 2 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] vendor/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::SinglePassRangeConcept >]’ vendor/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied > >::value’ vendor/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied > >’ vendor/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_ >)>’ vendor/boost/range/size.hpp:62:9: required from ‘Fn2 boost::range::for_each(SinglePassRange1&, SinglePassRange2&, Fn2) [with SinglePassRange1 = boost::container::stable_vector; SinglePassRange2 = std::vector >; Fn2 = boost::_bi::bind_t, boost::_bi::list2, boost::arg<2> > >]’ DbDataFrame.cpp:54:18: required from here vendor/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ vendor/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::range_detail::SinglePassIteratorConcept::~SinglePassIteratorConcept() [with Iterator = boost::container::stable_vector_iterator]’ 37 | ~model() | ^ vendor/boost/range/concepts.hpp:158:13: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 158 | BOOST_CONCEPT_USAGE(SinglePassIteratorConcept) | ^~~~~~~~~~~~~~~~~~~ vendor/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::SinglePassRangeConcept >]’: vendor/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements > >]’ vendor/boost/range/concepts.hpp:284:9: required from ‘struct boost::SinglePassRangeConcept >’ vendor/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::SinglePassRangeConcept >]’ vendor/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied > >::value’ vendor/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied > >’ vendor/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_ >)>’ vendor/boost/range/size.hpp:62:9: required from ‘Fn2 boost::range::for_each(SinglePassRange1&, SinglePassRange2&, Fn2) [with SinglePassRange1 = boost::container::stable_vector; SinglePassRange2 = std::vector >; Fn2 = boost::_bi::bind_t, boost::_bi::list2, boost::arg<2> > >]’ DbDataFrame.cpp:54:18: required from here vendor/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ vendor/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::SinglePassRangeConcept::~SinglePassRangeConcept() [with T = boost::container::stable_vector]’ 37 | ~model() | ^ vendor/boost/range/concepts.hpp:284:9: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 284 | BOOST_CONCEPT_USAGE(SinglePassRangeConcept) | ^~~~~~~~~~~~~~~~~~~ vendor/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::CopyConstructible<__gnu_cxx::__normal_iterator*, std::vector > > >]’: vendor/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements*, std::vector > > > >]’ vendor/boost/concept_check.hpp:167:5: required from ‘struct boost::CopyConstructible<__gnu_cxx::__normal_iterator*, std::vector > > >’ vendor/boost/range/concepts.hpp:125:16: required from ‘struct boost::range_detail::IncrementableIteratorConcept<__gnu_cxx::__normal_iterator*, std::vector > > >’ vendor/boost/range/concepts.hpp:147:16: required from ‘struct boost::range_detail::SinglePassIteratorConcept<__gnu_cxx::__normal_iterator*, std::vector > > >’ vendor/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::range_detail::SinglePassIteratorConcept<__gnu_cxx::__normal_iterator*, std::vector > > >]’ vendor/boost/concept/detail/has_constraints.hpp:42:5: [ skipping 4 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] vendor/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::SinglePassRangeConcept > >]’ vendor/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied > > >::value’ vendor/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied > > >’ vendor/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_ > >)>’ vendor/boost/range/algorithm_ext/for_each.hpp:54:13: required from ‘Fn2 boost::range::for_each(SinglePassRange1&, SinglePassRange2&, Fn2) [with SinglePassRange1 = boost::container::stable_vector; SinglePassRange2 = std::vector >; Fn2 = boost::_bi::bind_t, boost::_bi::list2, boost::arg<2> > >]’ DbDataFrame.cpp:54:18: required from here vendor/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ vendor/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::CopyConstructible::~CopyConstructible() [with TT = __gnu_cxx::__normal_iterator*, std::vector > >]’ 37 | ~model() | ^ vendor/boost/concept_check.hpp:167:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 167 | BOOST_CONCEPT_USAGE(CopyConstructible) { | ^~~~~~~~~~~~~~~~~~~ vendor/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::range_detail::IncrementableIteratorConcept<__gnu_cxx::__normal_iterator*, std::vector > > >]’: vendor/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements*, std::vector > > > >]’ vendor/boost/range/concepts.hpp:136:13: required from ‘struct boost::range_detail::IncrementableIteratorConcept<__gnu_cxx::__normal_iterator*, std::vector > > >’ vendor/boost/range/concepts.hpp:147:16: required from ‘struct boost::range_detail::SinglePassIteratorConcept<__gnu_cxx::__normal_iterator*, std::vector > > >’ vendor/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::range_detail::SinglePassIteratorConcept<__gnu_cxx::__normal_iterator*, std::vector > > >]’ vendor/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied*, std::vector > > > >::value’ vendor/boost/concept/detail/has_constraints.hpp:45:51: [ skipping 3 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] vendor/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::SinglePassRangeConcept > >]’ vendor/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied > > >::value’ vendor/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied > > >’ vendor/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_ > >)>’ vendor/boost/range/algorithm_ext/for_each.hpp:54:13: required from ‘Fn2 boost::range::for_each(SinglePassRange1&, SinglePassRange2&, Fn2) [with SinglePassRange1 = boost::container::stable_vector; SinglePassRange2 = std::vector >; Fn2 = boost::_bi::bind_t, boost::_bi::list2, boost::arg<2> > >]’ DbDataFrame.cpp:54:18: required from here vendor/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ vendor/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::range_detail::IncrementableIteratorConcept::~IncrementableIteratorConcept() [with Iterator = __gnu_cxx::__normal_iterator*, std::vector > >]’ 37 | ~model() | ^ vendor/boost/range/concepts.hpp:136:13: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 136 | BOOST_CONCEPT_USAGE(IncrementableIteratorConcept) | ^~~~~~~~~~~~~~~~~~~ vendor/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::EqualityComparable<__gnu_cxx::__normal_iterator*, std::vector > > >]’: vendor/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements*, std::vector > > > >]’ vendor/boost/concept_check.hpp:233:5: required from ‘struct boost::EqualityComparable<__gnu_cxx::__normal_iterator*, std::vector > > >’ vendor/boost/range/concepts.hpp:147:16: required from ‘struct boost::range_detail::SinglePassIteratorConcept<__gnu_cxx::__normal_iterator*, std::vector > > >’ vendor/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::range_detail::SinglePassIteratorConcept<__gnu_cxx::__normal_iterator*, std::vector > > >]’ vendor/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied*, std::vector > > > >::value’ vendor/boost/concept/detail/has_constraints.hpp:45:51: [ skipping 3 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] vendor/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::SinglePassRangeConcept > >]’ vendor/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied > > >::value’ vendor/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied > > >’ vendor/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_ > >)>’ vendor/boost/range/algorithm_ext/for_each.hpp:54:13: required from ‘Fn2 boost::range::for_each(SinglePassRange1&, SinglePassRange2&, Fn2) [with SinglePassRange1 = boost::container::stable_vector; SinglePassRange2 = std::vector >; Fn2 = boost::_bi::bind_t, boost::_bi::list2, boost::arg<2> > >]’ DbDataFrame.cpp:54:18: required from here vendor/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ vendor/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::EqualityComparable::~EqualityComparable() [with TT = __gnu_cxx::__normal_iterator*, std::vector > >]’ 37 | ~model() | ^ vendor/boost/concept_check.hpp:233:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 233 | BOOST_CONCEPT_USAGE(EqualityComparable) { | ^~~~~~~~~~~~~~~~~~~ vendor/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::range_detail::SinglePassIteratorConcept<__gnu_cxx::__normal_iterator*, std::vector > > >]’: vendor/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements*, std::vector > > > >]’ vendor/boost/range/concepts.hpp:158:13: required from ‘struct boost::range_detail::SinglePassIteratorConcept<__gnu_cxx::__normal_iterator*, std::vector > > >’ vendor/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::range_detail::SinglePassIteratorConcept<__gnu_cxx::__normal_iterator*, std::vector > > >]’ vendor/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied*, std::vector > > > >::value’ vendor/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied*, std::vector > > > >’ vendor/boost/concept/detail/general.hpp:72:8: [ skipping 2 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] vendor/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::SinglePassRangeConcept > >]’ vendor/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied > > >::value’ vendor/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied > > >’ vendor/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_ > >)>’ vendor/boost/range/algorithm_ext/for_each.hpp:54:13: required from ‘Fn2 boost::range::for_each(SinglePassRange1&, SinglePassRange2&, Fn2) [with SinglePassRange1 = boost::container::stable_vector; SinglePassRange2 = std::vector >; Fn2 = boost::_bi::bind_t, boost::_bi::list2, boost::arg<2> > >]’ DbDataFrame.cpp:54:18: required from here vendor/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ vendor/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::range_detail::SinglePassIteratorConcept::~SinglePassIteratorConcept() [with Iterator = __gnu_cxx::__normal_iterator*, std::vector > >]’ 37 | ~model() | ^ vendor/boost/range/concepts.hpp:158:13: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 158 | BOOST_CONCEPT_USAGE(SinglePassIteratorConcept) | ^~~~~~~~~~~~~~~~~~~ vendor/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::CopyConstructible<__gnu_cxx::__normal_iterator*, std::vector > > >]’: vendor/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements*, std::vector > > > >]’ vendor/boost/concept_check.hpp:167:5: required from ‘struct boost::CopyConstructible<__gnu_cxx::__normal_iterator*, std::vector > > >’ vendor/boost/range/concepts.hpp:125:16: required from ‘struct boost::range_detail::IncrementableIteratorConcept<__gnu_cxx::__normal_iterator*, std::vector > > >’ vendor/boost/range/concepts.hpp:147:16: required from ‘struct boost::range_detail::SinglePassIteratorConcept<__gnu_cxx::__normal_iterator*, std::vector > > >’ vendor/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::range_detail::SinglePassIteratorConcept<__gnu_cxx::__normal_iterator*, std::vector > > >]’ vendor/boost/concept/detail/has_constraints.hpp:42:5: [ skipping 4 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] vendor/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::SinglePassRangeConcept > >]’ vendor/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied > > >::value’ vendor/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied > > >’ vendor/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_ > >)>’ vendor/boost/range/algorithm_ext/for_each.hpp:54:13: required from ‘Fn2 boost::range::for_each(SinglePassRange1&, SinglePassRange2&, Fn2) [with SinglePassRange1 = boost::container::stable_vector; SinglePassRange2 = std::vector >; Fn2 = boost::_bi::bind_t, boost::_bi::list2, boost::arg<2> > >]’ DbDataFrame.cpp:54:18: required from here vendor/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ vendor/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::CopyConstructible::~CopyConstructible() [with TT = __gnu_cxx::__normal_iterator*, std::vector > >]’ 37 | ~model() | ^ vendor/boost/concept_check.hpp:167:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 167 | BOOST_CONCEPT_USAGE(CopyConstructible) { | ^~~~~~~~~~~~~~~~~~~ vendor/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::range_detail::IncrementableIteratorConcept<__gnu_cxx::__normal_iterator*, std::vector > > >]’: vendor/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements*, std::vector > > > >]’ vendor/boost/range/concepts.hpp:136:13: required from ‘struct boost::range_detail::IncrementableIteratorConcept<__gnu_cxx::__normal_iterator*, std::vector > > >’ vendor/boost/range/concepts.hpp:147:16: required from ‘struct boost::range_detail::SinglePassIteratorConcept<__gnu_cxx::__normal_iterator*, std::vector > > >’ vendor/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::range_detail::SinglePassIteratorConcept<__gnu_cxx::__normal_iterator*, std::vector > > >]’ vendor/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied*, std::vector > > > >::value’ vendor/boost/concept/detail/has_constraints.hpp:45:51: [ skipping 3 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] vendor/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::SinglePassRangeConcept > >]’ vendor/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied > > >::value’ vendor/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied > > >’ vendor/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_ > >)>’ vendor/boost/range/algorithm_ext/for_each.hpp:54:13: required from ‘Fn2 boost::range::for_each(SinglePassRange1&, SinglePassRange2&, Fn2) [with SinglePassRange1 = boost::container::stable_vector; SinglePassRange2 = std::vector >; Fn2 = boost::_bi::bind_t, boost::_bi::list2, boost::arg<2> > >]’ DbDataFrame.cpp:54:18: required from here vendor/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ vendor/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::range_detail::IncrementableIteratorConcept::~IncrementableIteratorConcept() [with Iterator = __gnu_cxx::__normal_iterator*, std::vector > >]’ 37 | ~model() | ^ vendor/boost/range/concepts.hpp:136:13: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 136 | BOOST_CONCEPT_USAGE(IncrementableIteratorConcept) | ^~~~~~~~~~~~~~~~~~~ vendor/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::EqualityComparable<__gnu_cxx::__normal_iterator*, std::vector > > >]’: vendor/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements*, std::vector > > > >]’ vendor/boost/concept_check.hpp:233:5: required from ‘struct boost::EqualityComparable<__gnu_cxx::__normal_iterator*, std::vector > > >’ vendor/boost/range/concepts.hpp:147:16: required from ‘struct boost::range_detail::SinglePassIteratorConcept<__gnu_cxx::__normal_iterator*, std::vector > > >’ vendor/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::range_detail::SinglePassIteratorConcept<__gnu_cxx::__normal_iterator*, std::vector > > >]’ vendor/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied*, std::vector > > > >::value’ vendor/boost/concept/detail/has_constraints.hpp:45:51: [ skipping 3 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] vendor/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::SinglePassRangeConcept > >]’ vendor/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied > > >::value’ vendor/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied > > >’ vendor/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_ > >)>’ vendor/boost/range/algorithm_ext/for_each.hpp:54:13: required from ‘Fn2 boost::range::for_each(SinglePassRange1&, SinglePassRange2&, Fn2) [with SinglePassRange1 = boost::container::stable_vector; SinglePassRange2 = std::vector >; Fn2 = boost::_bi::bind_t, boost::_bi::list2, boost::arg<2> > >]’ DbDataFrame.cpp:54:18: required from here vendor/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ vendor/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::EqualityComparable::~EqualityComparable() [with TT = __gnu_cxx::__normal_iterator*, std::vector > >]’ 37 | ~model() | ^ vendor/boost/concept_check.hpp:233:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 233 | BOOST_CONCEPT_USAGE(EqualityComparable) { | ^~~~~~~~~~~~~~~~~~~ vendor/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::range_detail::SinglePassIteratorConcept<__gnu_cxx::__normal_iterator*, std::vector > > >]’: vendor/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements*, std::vector > > > >]’ vendor/boost/range/concepts.hpp:158:13: required from ‘struct boost::range_detail::SinglePassIteratorConcept<__gnu_cxx::__normal_iterator*, std::vector > > >’ vendor/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::range_detail::SinglePassIteratorConcept<__gnu_cxx::__normal_iterator*, std::vector > > >]’ vendor/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied*, std::vector > > > >::value’ vendor/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied*, std::vector > > > >’ vendor/boost/concept/detail/general.hpp:72:8: [ skipping 2 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] vendor/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::SinglePassRangeConcept > >]’ vendor/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied > > >::value’ vendor/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied > > >’ vendor/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_ > >)>’ vendor/boost/range/algorithm_ext/for_each.hpp:54:13: required from ‘Fn2 boost::range::for_each(SinglePassRange1&, SinglePassRange2&, Fn2) [with SinglePassRange1 = boost::container::stable_vector; SinglePassRange2 = std::vector >; Fn2 = boost::_bi::bind_t, boost::_bi::list2, boost::arg<2> > >]’ DbDataFrame.cpp:54:18: required from here vendor/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ vendor/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::range_detail::SinglePassIteratorConcept::~SinglePassIteratorConcept() [with Iterator = __gnu_cxx::__normal_iterator*, std::vector > >]’ 37 | ~model() | ^ vendor/boost/range/concepts.hpp:158:13: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 158 | BOOST_CONCEPT_USAGE(SinglePassIteratorConcept) | ^~~~~~~~~~~~~~~~~~~ vendor/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::SinglePassRangeConcept > >]’: vendor/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements > > >]’ vendor/boost/range/concepts.hpp:284:9: required from ‘struct boost::SinglePassRangeConcept > >’ vendor/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::SinglePassRangeConcept > >]’ vendor/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied > > >::value’ vendor/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied > > >’ vendor/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_ > >)>’ vendor/boost/range/algorithm_ext/for_each.hpp:54:13: required from ‘Fn2 boost::range::for_each(SinglePassRange1&, SinglePassRange2&, Fn2) [with SinglePassRange1 = boost::container::stable_vector; SinglePassRange2 = std::vector >; Fn2 = boost::_bi::bind_t, boost::_bi::list2, boost::arg<2> > >]’ DbDataFrame.cpp:54:18: required from here vendor/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ vendor/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::SinglePassRangeConcept::~SinglePassRangeConcept() [with T = std::vector >]’ 37 | ~model() | ^ vendor/boost/range/concepts.hpp:284:9: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 284 | BOOST_CONCEPT_USAGE(SinglePassRangeConcept) | ^~~~~~~~~~~~~~~~~~~ g++ -std=gnu++17 -I"/usr/share/R/include" -DNDEBUG -I. -Ivendor -Ivendor/extensions -Ivendor/sqlite3 -DRSQLITE_USE_BUNDLED_SQLITE -DSQLITE_ENABLE_RTREE -DSQLITE_ENABLE_FTS3 -DSQLITE_ENABLE_FTS3_PARENTHESIS -DSQLITE_ENABLE_FTS5 -DSQLITE_ENABLE_JSON1 -DSQLITE_ENABLE_STAT4 -DSQLITE_SOUNDEX -DSQLITE_USE_URI=1 -DSQLITE_MAX_LENGTH=2147483647 -DHAVE_USLEEP=1 -I'/home/omnipath/local/R/4.4-3.20/plogr/include' -I'/home/omnipath/local/R/4.4-3.20/cpp11/include' -fvisibility=hidden -fpic -g -O2 -fno-omit-frame-pointer -mno-omit-leaf-frame-pointer -ffile-prefix-map=/build/r-base-EawLoD/r-base-4.4.1=. -fstack-protector-strong -fstack-clash-protection -Wformat -Werror=format-security -fcf-protection -fdebug-prefix-map=/build/r-base-EawLoD/r-base-4.4.1=/usr/src/r-base-4.4.1-1.2404.0 -Wdate-time -D_FORTIFY_SOURCE=3 -c DbResult.cpp -o DbResult.o g++ -std=gnu++17 -I"/usr/share/R/include" -DNDEBUG -I. -Ivendor -Ivendor/extensions -Ivendor/sqlite3 -DRSQLITE_USE_BUNDLED_SQLITE -DSQLITE_ENABLE_RTREE -DSQLITE_ENABLE_FTS3 -DSQLITE_ENABLE_FTS3_PARENTHESIS -DSQLITE_ENABLE_FTS5 -DSQLITE_ENABLE_JSON1 -DSQLITE_ENABLE_STAT4 -DSQLITE_SOUNDEX -DSQLITE_USE_URI=1 -DSQLITE_MAX_LENGTH=2147483647 -DHAVE_USLEEP=1 -I'/home/omnipath/local/R/4.4-3.20/plogr/include' -I'/home/omnipath/local/R/4.4-3.20/cpp11/include' -fvisibility=hidden -fpic -g -O2 -fno-omit-frame-pointer -mno-omit-leaf-frame-pointer -ffile-prefix-map=/build/r-base-EawLoD/r-base-4.4.1=. -fstack-protector-strong -fstack-clash-protection -Wformat -Werror=format-security -fcf-protection -fdebug-prefix-map=/build/r-base-EawLoD/r-base-4.4.1=/usr/src/r-base-4.4.1-1.2404.0 -Wdate-time -D_FORTIFY_SOURCE=3 -c SqliteColumnDataSource.cpp -o SqliteColumnDataSource.o g++ -std=gnu++17 -I"/usr/share/R/include" -DNDEBUG -I. -Ivendor -Ivendor/extensions -Ivendor/sqlite3 -DRSQLITE_USE_BUNDLED_SQLITE -DSQLITE_ENABLE_RTREE -DSQLITE_ENABLE_FTS3 -DSQLITE_ENABLE_FTS3_PARENTHESIS -DSQLITE_ENABLE_FTS5 -DSQLITE_ENABLE_JSON1 -DSQLITE_ENABLE_STAT4 -DSQLITE_SOUNDEX -DSQLITE_USE_URI=1 -DSQLITE_MAX_LENGTH=2147483647 -DHAVE_USLEEP=1 -I'/home/omnipath/local/R/4.4-3.20/plogr/include' -I'/home/omnipath/local/R/4.4-3.20/cpp11/include' -fvisibility=hidden -fpic -g -O2 -fno-omit-frame-pointer -mno-omit-leaf-frame-pointer -ffile-prefix-map=/build/r-base-EawLoD/r-base-4.4.1=. -fstack-protector-strong -fstack-clash-protection -Wformat -Werror=format-security -fcf-protection -fdebug-prefix-map=/build/r-base-EawLoD/r-base-4.4.1=/usr/src/r-base-4.4.1-1.2404.0 -Wdate-time -D_FORTIFY_SOURCE=3 -c SqliteColumnDataSourceFactory.cpp -o SqliteColumnDataSourceFactory.o g++ -std=gnu++17 -I"/usr/share/R/include" -DNDEBUG -I. -Ivendor -Ivendor/extensions -Ivendor/sqlite3 -DRSQLITE_USE_BUNDLED_SQLITE -DSQLITE_ENABLE_RTREE -DSQLITE_ENABLE_FTS3 -DSQLITE_ENABLE_FTS3_PARENTHESIS -DSQLITE_ENABLE_FTS5 -DSQLITE_ENABLE_JSON1 -DSQLITE_ENABLE_STAT4 -DSQLITE_SOUNDEX -DSQLITE_USE_URI=1 -DSQLITE_MAX_LENGTH=2147483647 -DHAVE_USLEEP=1 -I'/home/omnipath/local/R/4.4-3.20/plogr/include' -I'/home/omnipath/local/R/4.4-3.20/cpp11/include' -fvisibility=hidden -fpic -g -O2 -fno-omit-frame-pointer -mno-omit-leaf-frame-pointer -ffile-prefix-map=/build/r-base-EawLoD/r-base-4.4.1=. -fstack-protector-strong -fstack-clash-protection -Wformat -Werror=format-security -fcf-protection -fdebug-prefix-map=/build/r-base-EawLoD/r-base-4.4.1=/usr/src/r-base-4.4.1-1.2404.0 -Wdate-time -D_FORTIFY_SOURCE=3 -c SqliteDataFrame.cpp -o SqliteDataFrame.o g++ -std=gnu++17 -I"/usr/share/R/include" -DNDEBUG -I. -Ivendor -Ivendor/extensions -Ivendor/sqlite3 -DRSQLITE_USE_BUNDLED_SQLITE -DSQLITE_ENABLE_RTREE -DSQLITE_ENABLE_FTS3 -DSQLITE_ENABLE_FTS3_PARENTHESIS -DSQLITE_ENABLE_FTS5 -DSQLITE_ENABLE_JSON1 -DSQLITE_ENABLE_STAT4 -DSQLITE_SOUNDEX -DSQLITE_USE_URI=1 -DSQLITE_MAX_LENGTH=2147483647 -DHAVE_USLEEP=1 -I'/home/omnipath/local/R/4.4-3.20/plogr/include' -I'/home/omnipath/local/R/4.4-3.20/cpp11/include' -fvisibility=hidden -fpic -g -O2 -fno-omit-frame-pointer -mno-omit-leaf-frame-pointer -ffile-prefix-map=/build/r-base-EawLoD/r-base-4.4.1=. -fstack-protector-strong -fstack-clash-protection -Wformat -Werror=format-security -fcf-protection -fdebug-prefix-map=/build/r-base-EawLoD/r-base-4.4.1=/usr/src/r-base-4.4.1-1.2404.0 -Wdate-time -D_FORTIFY_SOURCE=3 -c SqliteResult.cpp -o SqliteResult.o g++ -std=gnu++17 -I"/usr/share/R/include" -DNDEBUG -I. -Ivendor -Ivendor/extensions -Ivendor/sqlite3 -DRSQLITE_USE_BUNDLED_SQLITE -DSQLITE_ENABLE_RTREE -DSQLITE_ENABLE_FTS3 -DSQLITE_ENABLE_FTS3_PARENTHESIS -DSQLITE_ENABLE_FTS5 -DSQLITE_ENABLE_JSON1 -DSQLITE_ENABLE_STAT4 -DSQLITE_SOUNDEX -DSQLITE_USE_URI=1 -DSQLITE_MAX_LENGTH=2147483647 -DHAVE_USLEEP=1 -I'/home/omnipath/local/R/4.4-3.20/plogr/include' -I'/home/omnipath/local/R/4.4-3.20/cpp11/include' -fvisibility=hidden -fpic -g -O2 -fno-omit-frame-pointer -mno-omit-leaf-frame-pointer -ffile-prefix-map=/build/r-base-EawLoD/r-base-4.4.1=. -fstack-protector-strong -fstack-clash-protection -Wformat -Werror=format-security -fcf-protection -fdebug-prefix-map=/build/r-base-EawLoD/r-base-4.4.1=/usr/src/r-base-4.4.1-1.2404.0 -Wdate-time -D_FORTIFY_SOURCE=3 -c SqliteResultImpl.cpp -o SqliteResultImpl.o gcc -I"/usr/share/R/include" -DNDEBUG -I. -Ivendor -Ivendor/extensions -Ivendor/sqlite3 -DRSQLITE_USE_BUNDLED_SQLITE -DSQLITE_ENABLE_RTREE -DSQLITE_ENABLE_FTS3 -DSQLITE_ENABLE_FTS3_PARENTHESIS -DSQLITE_ENABLE_FTS5 -DSQLITE_ENABLE_JSON1 -DSQLITE_ENABLE_STAT4 -DSQLITE_SOUNDEX -DSQLITE_USE_URI=1 -DSQLITE_MAX_LENGTH=2147483647 -DHAVE_USLEEP=1 -I'/home/omnipath/local/R/4.4-3.20/plogr/include' -I'/home/omnipath/local/R/4.4-3.20/cpp11/include' -fvisibility=hidden -fpic -g -O2 -fno-omit-frame-pointer -mno-omit-leaf-frame-pointer -ffile-prefix-map=/build/r-base-EawLoD/r-base-4.4.1=. -fstack-protector-strong -fstack-clash-protection -Wformat -Werror=format-security -fcf-protection -fdebug-prefix-map=/build/r-base-EawLoD/r-base-4.4.1=/usr/src/r-base-4.4.1-1.2404.0 -Wdate-time -D_FORTIFY_SOURCE=3 -c affinity.c -o affinity.o g++ -std=gnu++17 -I"/usr/share/R/include" -DNDEBUG -I. -Ivendor -Ivendor/extensions -Ivendor/sqlite3 -DRSQLITE_USE_BUNDLED_SQLITE -DSQLITE_ENABLE_RTREE -DSQLITE_ENABLE_FTS3 -DSQLITE_ENABLE_FTS3_PARENTHESIS -DSQLITE_ENABLE_FTS5 -DSQLITE_ENABLE_JSON1 -DSQLITE_ENABLE_STAT4 -DSQLITE_SOUNDEX -DSQLITE_USE_URI=1 -DSQLITE_MAX_LENGTH=2147483647 -DHAVE_USLEEP=1 -I'/home/omnipath/local/R/4.4-3.20/plogr/include' -I'/home/omnipath/local/R/4.4-3.20/cpp11/include' -fvisibility=hidden -fpic -g -O2 -fno-omit-frame-pointer -mno-omit-leaf-frame-pointer -ffile-prefix-map=/build/r-base-EawLoD/r-base-4.4.1=. -fstack-protector-strong -fstack-clash-protection -Wformat -Werror=format-security -fcf-protection -fdebug-prefix-map=/build/r-base-EawLoD/r-base-4.4.1=/usr/src/r-base-4.4.1-1.2404.0 -Wdate-time -D_FORTIFY_SOURCE=3 -c connection.cpp -o connection.o g++ -std=gnu++17 -I"/usr/share/R/include" -DNDEBUG -I. -Ivendor -Ivendor/extensions -Ivendor/sqlite3 -DRSQLITE_USE_BUNDLED_SQLITE -DSQLITE_ENABLE_RTREE -DSQLITE_ENABLE_FTS3 -DSQLITE_ENABLE_FTS3_PARENTHESIS -DSQLITE_ENABLE_FTS5 -DSQLITE_ENABLE_JSON1 -DSQLITE_ENABLE_STAT4 -DSQLITE_SOUNDEX -DSQLITE_USE_URI=1 -DSQLITE_MAX_LENGTH=2147483647 -DHAVE_USLEEP=1 -I'/home/omnipath/local/R/4.4-3.20/plogr/include' -I'/home/omnipath/local/R/4.4-3.20/cpp11/include' -fvisibility=hidden -fpic -g -O2 -fno-omit-frame-pointer -mno-omit-leaf-frame-pointer -ffile-prefix-map=/build/r-base-EawLoD/r-base-4.4.1=. -fstack-protector-strong -fstack-clash-protection -Wformat -Werror=format-security -fcf-protection -fdebug-prefix-map=/build/r-base-EawLoD/r-base-4.4.1=/usr/src/r-base-4.4.1-1.2404.0 -Wdate-time -D_FORTIFY_SOURCE=3 -c cpp11.cpp -o cpp11.o gcc -I"/usr/share/R/include" -DNDEBUG -I. -Ivendor -Ivendor/extensions -Ivendor/sqlite3 -DRSQLITE_USE_BUNDLED_SQLITE -DSQLITE_ENABLE_RTREE -DSQLITE_ENABLE_FTS3 -DSQLITE_ENABLE_FTS3_PARENTHESIS -DSQLITE_ENABLE_FTS5 -DSQLITE_ENABLE_JSON1 -DSQLITE_ENABLE_STAT4 -DSQLITE_SOUNDEX -DSQLITE_USE_URI=1 -DSQLITE_MAX_LENGTH=2147483647 -DHAVE_USLEEP=1 -I'/home/omnipath/local/R/4.4-3.20/plogr/include' -I'/home/omnipath/local/R/4.4-3.20/cpp11/include' -fvisibility=hidden -fpic -g -O2 -fno-omit-frame-pointer -mno-omit-leaf-frame-pointer -ffile-prefix-map=/build/r-base-EawLoD/r-base-4.4.1=. -fstack-protector-strong -fstack-clash-protection -Wformat -Werror=format-security -fcf-protection -fdebug-prefix-map=/build/r-base-EawLoD/r-base-4.4.1=/usr/src/r-base-4.4.1-1.2404.0 -Wdate-time -D_FORTIFY_SOURCE=3 -c ext-csv.c -o ext-csv.o gcc -I"/usr/share/R/include" -DNDEBUG -I. -Ivendor -Ivendor/extensions -Ivendor/sqlite3 -DRSQLITE_USE_BUNDLED_SQLITE -DSQLITE_ENABLE_RTREE -DSQLITE_ENABLE_FTS3 -DSQLITE_ENABLE_FTS3_PARENTHESIS -DSQLITE_ENABLE_FTS5 -DSQLITE_ENABLE_JSON1 -DSQLITE_ENABLE_STAT4 -DSQLITE_SOUNDEX -DSQLITE_USE_URI=1 -DSQLITE_MAX_LENGTH=2147483647 -DHAVE_USLEEP=1 -I'/home/omnipath/local/R/4.4-3.20/plogr/include' -I'/home/omnipath/local/R/4.4-3.20/cpp11/include' -fvisibility=hidden -fpic -g -O2 -fno-omit-frame-pointer -mno-omit-leaf-frame-pointer -ffile-prefix-map=/build/r-base-EawLoD/r-base-4.4.1=. -fstack-protector-strong -fstack-clash-protection -Wformat -Werror=format-security -fcf-protection -fdebug-prefix-map=/build/r-base-EawLoD/r-base-4.4.1=/usr/src/r-base-4.4.1-1.2404.0 -Wdate-time -D_FORTIFY_SOURCE=3 -c ext-math.c -o ext-math.o gcc -I"/usr/share/R/include" -DNDEBUG -I. -Ivendor -Ivendor/extensions -Ivendor/sqlite3 -DRSQLITE_USE_BUNDLED_SQLITE -DSQLITE_ENABLE_RTREE -DSQLITE_ENABLE_FTS3 -DSQLITE_ENABLE_FTS3_PARENTHESIS -DSQLITE_ENABLE_FTS5 -DSQLITE_ENABLE_JSON1 -DSQLITE_ENABLE_STAT4 -DSQLITE_SOUNDEX -DSQLITE_USE_URI=1 -DSQLITE_MAX_LENGTH=2147483647 -DHAVE_USLEEP=1 -I'/home/omnipath/local/R/4.4-3.20/plogr/include' -I'/home/omnipath/local/R/4.4-3.20/cpp11/include' -fvisibility=hidden -fpic -g -O2 -fno-omit-frame-pointer -mno-omit-leaf-frame-pointer -ffile-prefix-map=/build/r-base-EawLoD/r-base-4.4.1=. -fstack-protector-strong -fstack-clash-protection -Wformat -Werror=format-security -fcf-protection -fdebug-prefix-map=/build/r-base-EawLoD/r-base-4.4.1=/usr/src/r-base-4.4.1-1.2404.0 -Wdate-time -D_FORTIFY_SOURCE=3 -c ext-regexp.c -o ext-regexp.o gcc -I"/usr/share/R/include" -DNDEBUG -I. -Ivendor -Ivendor/extensions -Ivendor/sqlite3 -DRSQLITE_USE_BUNDLED_SQLITE -DSQLITE_ENABLE_RTREE -DSQLITE_ENABLE_FTS3 -DSQLITE_ENABLE_FTS3_PARENTHESIS -DSQLITE_ENABLE_FTS5 -DSQLITE_ENABLE_JSON1 -DSQLITE_ENABLE_STAT4 -DSQLITE_SOUNDEX -DSQLITE_USE_URI=1 -DSQLITE_MAX_LENGTH=2147483647 -DHAVE_USLEEP=1 -I'/home/omnipath/local/R/4.4-3.20/plogr/include' -I'/home/omnipath/local/R/4.4-3.20/cpp11/include' -fvisibility=hidden -fpic -g -O2 -fno-omit-frame-pointer -mno-omit-leaf-frame-pointer -ffile-prefix-map=/build/r-base-EawLoD/r-base-4.4.1=. -fstack-protector-strong -fstack-clash-protection -Wformat -Werror=format-security -fcf-protection -fdebug-prefix-map=/build/r-base-EawLoD/r-base-4.4.1=/usr/src/r-base-4.4.1-1.2404.0 -Wdate-time -D_FORTIFY_SOURCE=3 -c ext-series.c -o ext-series.o g++ -std=gnu++17 -I"/usr/share/R/include" -DNDEBUG -I. -Ivendor -Ivendor/extensions -Ivendor/sqlite3 -DRSQLITE_USE_BUNDLED_SQLITE -DSQLITE_ENABLE_RTREE -DSQLITE_ENABLE_FTS3 -DSQLITE_ENABLE_FTS3_PARENTHESIS -DSQLITE_ENABLE_FTS5 -DSQLITE_ENABLE_JSON1 -DSQLITE_ENABLE_STAT4 -DSQLITE_SOUNDEX -DSQLITE_USE_URI=1 -DSQLITE_MAX_LENGTH=2147483647 -DHAVE_USLEEP=1 -I'/home/omnipath/local/R/4.4-3.20/plogr/include' -I'/home/omnipath/local/R/4.4-3.20/cpp11/include' -fvisibility=hidden -fpic -g -O2 -fno-omit-frame-pointer -mno-omit-leaf-frame-pointer -ffile-prefix-map=/build/r-base-EawLoD/r-base-4.4.1=. -fstack-protector-strong -fstack-clash-protection -Wformat -Werror=format-security -fcf-protection -fdebug-prefix-map=/build/r-base-EawLoD/r-base-4.4.1=/usr/src/r-base-4.4.1-1.2404.0 -Wdate-time -D_FORTIFY_SOURCE=3 -c extensions.cpp -o extensions.o gcc -I"/usr/share/R/include" -DNDEBUG -I. -Ivendor -Ivendor/extensions -Ivendor/sqlite3 -DRSQLITE_USE_BUNDLED_SQLITE -DSQLITE_ENABLE_RTREE -DSQLITE_ENABLE_FTS3 -DSQLITE_ENABLE_FTS3_PARENTHESIS -DSQLITE_ENABLE_FTS5 -DSQLITE_ENABLE_JSON1 -DSQLITE_ENABLE_STAT4 -DSQLITE_SOUNDEX -DSQLITE_USE_URI=1 -DSQLITE_MAX_LENGTH=2147483647 -DHAVE_USLEEP=1 -I'/home/omnipath/local/R/4.4-3.20/plogr/include' -I'/home/omnipath/local/R/4.4-3.20/cpp11/include' -fvisibility=hidden -fpic -g -O2 -fno-omit-frame-pointer -mno-omit-leaf-frame-pointer -ffile-prefix-map=/build/r-base-EawLoD/r-base-4.4.1=. -fstack-protector-strong -fstack-clash-protection -Wformat -Werror=format-security -fcf-protection -fdebug-prefix-map=/build/r-base-EawLoD/r-base-4.4.1=/usr/src/r-base-4.4.1-1.2404.0 -Wdate-time -D_FORTIFY_SOURCE=3 -c import-file.c -o import-file.o g++ -std=gnu++17 -I"/usr/share/R/include" -DNDEBUG -I. -Ivendor -Ivendor/extensions -Ivendor/sqlite3 -DRSQLITE_USE_BUNDLED_SQLITE -DSQLITE_ENABLE_RTREE -DSQLITE_ENABLE_FTS3 -DSQLITE_ENABLE_FTS3_PARENTHESIS -DSQLITE_ENABLE_FTS5 -DSQLITE_ENABLE_JSON1 -DSQLITE_ENABLE_STAT4 -DSQLITE_SOUNDEX -DSQLITE_USE_URI=1 -DSQLITE_MAX_LENGTH=2147483647 -DHAVE_USLEEP=1 -I'/home/omnipath/local/R/4.4-3.20/plogr/include' -I'/home/omnipath/local/R/4.4-3.20/cpp11/include' -fvisibility=hidden -fpic -g -O2 -fno-omit-frame-pointer -mno-omit-leaf-frame-pointer -ffile-prefix-map=/build/r-base-EawLoD/r-base-4.4.1=. -fstack-protector-strong -fstack-clash-protection -Wformat -Werror=format-security -fcf-protection -fdebug-prefix-map=/build/r-base-EawLoD/r-base-4.4.1=/usr/src/r-base-4.4.1-1.2404.0 -Wdate-time -D_FORTIFY_SOURCE=3 -c result.cpp -o result.o g++ -std=gnu++17 -I"/usr/share/R/include" -DNDEBUG -I. -Ivendor -Ivendor/extensions -Ivendor/sqlite3 -DRSQLITE_USE_BUNDLED_SQLITE -DSQLITE_ENABLE_RTREE -DSQLITE_ENABLE_FTS3 -DSQLITE_ENABLE_FTS3_PARENTHESIS -DSQLITE_ENABLE_FTS5 -DSQLITE_ENABLE_JSON1 -DSQLITE_ENABLE_STAT4 -DSQLITE_SOUNDEX -DSQLITE_USE_URI=1 -DSQLITE_MAX_LENGTH=2147483647 -DHAVE_USLEEP=1 -I'/home/omnipath/local/R/4.4-3.20/plogr/include' -I'/home/omnipath/local/R/4.4-3.20/cpp11/include' -fvisibility=hidden -fpic -g -O2 -fno-omit-frame-pointer -mno-omit-leaf-frame-pointer -ffile-prefix-map=/build/r-base-EawLoD/r-base-4.4.1=. -fstack-protector-strong -fstack-clash-protection -Wformat -Werror=format-security -fcf-protection -fdebug-prefix-map=/build/r-base-EawLoD/r-base-4.4.1=/usr/src/r-base-4.4.1-1.2404.0 -Wdate-time -D_FORTIFY_SOURCE=3 -c rsqlite.cpp -o rsqlite.o gcc -I"/usr/share/R/include" -DNDEBUG -I. -Ivendor -Ivendor/extensions -Ivendor/sqlite3 -DRSQLITE_USE_BUNDLED_SQLITE -DSQLITE_ENABLE_RTREE -DSQLITE_ENABLE_FTS3 -DSQLITE_ENABLE_FTS3_PARENTHESIS -DSQLITE_ENABLE_FTS5 -DSQLITE_ENABLE_JSON1 -DSQLITE_ENABLE_STAT4 -DSQLITE_SOUNDEX -DSQLITE_USE_URI=1 -DSQLITE_MAX_LENGTH=2147483647 -DHAVE_USLEEP=1 -I'/home/omnipath/local/R/4.4-3.20/plogr/include' -I'/home/omnipath/local/R/4.4-3.20/cpp11/include' -fvisibility=hidden -fpic -g -O2 -fno-omit-frame-pointer -mno-omit-leaf-frame-pointer -ffile-prefix-map=/build/r-base-EawLoD/r-base-4.4.1=. -fstack-protector-strong -fstack-clash-protection -Wformat -Werror=format-security -fcf-protection -fdebug-prefix-map=/build/r-base-EawLoD/r-base-4.4.1=/usr/src/r-base-4.4.1-1.2404.0 -Wdate-time -D_FORTIFY_SOURCE=3 -c vendor/sqlite3/sqlite3.c -o vendor/sqlite3/sqlite3.o g++ -std=gnu++17 -shared -L/usr/lib/R/lib -Wl,-Bsymbolic-functions -flto=auto -ffat-lto-objects -Wl,-z,relro -o RSQLite.so DbColumn.o DbColumnDataSource.o DbColumnDataSourceFactory.o DbColumnStorage.o DbConnection.o DbDataFrame.o DbResult.o SqliteColumnDataSource.o SqliteColumnDataSourceFactory.o SqliteDataFrame.o SqliteResult.o SqliteResultImpl.o affinity.o connection.o cpp11.o ext-csv.o ext-math.o ext-regexp.o ext-series.o extensions.o import-file.o result.o rsqlite.o vendor/sqlite3/sqlite3.o -L/usr/lib/R/lib -lR installing to /home/omnipath/local/R/4.4-3.20/00LOCK-RSQLite/00new/RSQLite/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 (RSQLite) * installing *source* package ‘selectr’ ... ** package ‘selectr’ 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 (selectr) * installing *source* package ‘tibble’ ... ** package ‘tibble’ successfully unpacked and MD5 sums checked ** using staged installation ** libs using C compiler: ‘gcc (Ubuntu 13.2.0-23ubuntu4) 13.2.0’ gcc -I"/usr/share/R/include" -DNDEBUG -fpic -g -O2 -fno-omit-frame-pointer -mno-omit-leaf-frame-pointer -ffile-prefix-map=/build/r-base-EawLoD/r-base-4.4.1=. -fstack-protector-strong -fstack-clash-protection -Wformat -Werror=format-security -fcf-protection -fdebug-prefix-map=/build/r-base-EawLoD/r-base-4.4.1=/usr/src/r-base-4.4.1-1.2404.0 -Wdate-time -D_FORTIFY_SOURCE=3 -c attributes.c -o attributes.o gcc -I"/usr/share/R/include" -DNDEBUG -fpic -g -O2 -fno-omit-frame-pointer -mno-omit-leaf-frame-pointer -ffile-prefix-map=/build/r-base-EawLoD/r-base-4.4.1=. -fstack-protector-strong -fstack-clash-protection -Wformat -Werror=format-security -fcf-protection -fdebug-prefix-map=/build/r-base-EawLoD/r-base-4.4.1=/usr/src/r-base-4.4.1-1.2404.0 -Wdate-time -D_FORTIFY_SOURCE=3 -c coerce.c -o coerce.o gcc -I"/usr/share/R/include" -DNDEBUG -fpic -g -O2 -fno-omit-frame-pointer -mno-omit-leaf-frame-pointer -ffile-prefix-map=/build/r-base-EawLoD/r-base-4.4.1=. -fstack-protector-strong -fstack-clash-protection -Wformat -Werror=format-security -fcf-protection -fdebug-prefix-map=/build/r-base-EawLoD/r-base-4.4.1=/usr/src/r-base-4.4.1-1.2404.0 -Wdate-time -D_FORTIFY_SOURCE=3 -c init.c -o init.o gcc -I"/usr/share/R/include" -DNDEBUG -fpic -g -O2 -fno-omit-frame-pointer -mno-omit-leaf-frame-pointer -ffile-prefix-map=/build/r-base-EawLoD/r-base-4.4.1=. -fstack-protector-strong -fstack-clash-protection -Wformat -Werror=format-security -fcf-protection -fdebug-prefix-map=/build/r-base-EawLoD/r-base-4.4.1=/usr/src/r-base-4.4.1-1.2404.0 -Wdate-time -D_FORTIFY_SOURCE=3 -c matrixToDataFrame.c -o matrixToDataFrame.o gcc -shared -L/usr/lib/R/lib -Wl,-Bsymbolic-functions -flto=auto -ffat-lto-objects -Wl,-z,relro -o tibble.so attributes.o coerce.o init.o matrixToDataFrame.o -L/usr/lib/R/lib -lR installing to /home/omnipath/local/R/4.4-3.20/00LOCK-tibble/00new/tibble/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 (tibble) * installing *source* package ‘dplyr’ ... ** package ‘dplyr’ successfully unpacked and MD5 sums checked ** using staged installation ** libs using C++ compiler: ‘g++ (Ubuntu 13.2.0-23ubuntu4) 13.2.0’ g++ -std=gnu++17 -I"/usr/share/R/include" -DNDEBUG -fpic -g -O2 -fno-omit-frame-pointer -mno-omit-leaf-frame-pointer -ffile-prefix-map=/build/r-base-EawLoD/r-base-4.4.1=. -fstack-protector-strong -fstack-clash-protection -Wformat -Werror=format-security -fcf-protection -fdebug-prefix-map=/build/r-base-EawLoD/r-base-4.4.1=/usr/src/r-base-4.4.1-1.2404.0 -Wdate-time -D_FORTIFY_SOURCE=3 -c chop.cpp -o chop.o g++ -std=gnu++17 -I"/usr/share/R/include" -DNDEBUG -fpic -g -O2 -fno-omit-frame-pointer -mno-omit-leaf-frame-pointer -ffile-prefix-map=/build/r-base-EawLoD/r-base-4.4.1=. -fstack-protector-strong -fstack-clash-protection -Wformat -Werror=format-security -fcf-protection -fdebug-prefix-map=/build/r-base-EawLoD/r-base-4.4.1=/usr/src/r-base-4.4.1-1.2404.0 -Wdate-time -D_FORTIFY_SOURCE=3 -c filter.cpp -o filter.o g++ -std=gnu++17 -I"/usr/share/R/include" -DNDEBUG -fpic -g -O2 -fno-omit-frame-pointer -mno-omit-leaf-frame-pointer -ffile-prefix-map=/build/r-base-EawLoD/r-base-4.4.1=. -fstack-protector-strong -fstack-clash-protection -Wformat -Werror=format-security -fcf-protection -fdebug-prefix-map=/build/r-base-EawLoD/r-base-4.4.1=/usr/src/r-base-4.4.1-1.2404.0 -Wdate-time -D_FORTIFY_SOURCE=3 -c funs.cpp -o funs.o g++ -std=gnu++17 -I"/usr/share/R/include" -DNDEBUG -fpic -g -O2 -fno-omit-frame-pointer -mno-omit-leaf-frame-pointer -ffile-prefix-map=/build/r-base-EawLoD/r-base-4.4.1=. -fstack-protector-strong -fstack-clash-protection -Wformat -Werror=format-security -fcf-protection -fdebug-prefix-map=/build/r-base-EawLoD/r-base-4.4.1=/usr/src/r-base-4.4.1-1.2404.0 -Wdate-time -D_FORTIFY_SOURCE=3 -c group_by.cpp -o group_by.o g++ -std=gnu++17 -I"/usr/share/R/include" -DNDEBUG -fpic -g -O2 -fno-omit-frame-pointer -mno-omit-leaf-frame-pointer -ffile-prefix-map=/build/r-base-EawLoD/r-base-4.4.1=. -fstack-protector-strong -fstack-clash-protection -Wformat -Werror=format-security -fcf-protection -fdebug-prefix-map=/build/r-base-EawLoD/r-base-4.4.1=/usr/src/r-base-4.4.1-1.2404.0 -Wdate-time -D_FORTIFY_SOURCE=3 -c group_data.cpp -o group_data.o g++ -std=gnu++17 -I"/usr/share/R/include" -DNDEBUG -fpic -g -O2 -fno-omit-frame-pointer -mno-omit-leaf-frame-pointer -ffile-prefix-map=/build/r-base-EawLoD/r-base-4.4.1=. -fstack-protector-strong -fstack-clash-protection -Wformat -Werror=format-security -fcf-protection -fdebug-prefix-map=/build/r-base-EawLoD/r-base-4.4.1=/usr/src/r-base-4.4.1-1.2404.0 -Wdate-time -D_FORTIFY_SOURCE=3 -c imports.cpp -o imports.o g++ -std=gnu++17 -I"/usr/share/R/include" -DNDEBUG -fpic -g -O2 -fno-omit-frame-pointer -mno-omit-leaf-frame-pointer -ffile-prefix-map=/build/r-base-EawLoD/r-base-4.4.1=. -fstack-protector-strong -fstack-clash-protection -Wformat -Werror=format-security -fcf-protection -fdebug-prefix-map=/build/r-base-EawLoD/r-base-4.4.1=/usr/src/r-base-4.4.1-1.2404.0 -Wdate-time -D_FORTIFY_SOURCE=3 -c init.cpp -o init.o g++ -std=gnu++17 -I"/usr/share/R/include" -DNDEBUG -fpic -g -O2 -fno-omit-frame-pointer -mno-omit-leaf-frame-pointer -ffile-prefix-map=/build/r-base-EawLoD/r-base-4.4.1=. -fstack-protector-strong -fstack-clash-protection -Wformat -Werror=format-security -fcf-protection -fdebug-prefix-map=/build/r-base-EawLoD/r-base-4.4.1=/usr/src/r-base-4.4.1-1.2404.0 -Wdate-time -D_FORTIFY_SOURCE=3 -c mask.cpp -o mask.o g++ -std=gnu++17 -I"/usr/share/R/include" -DNDEBUG -fpic -g -O2 -fno-omit-frame-pointer -mno-omit-leaf-frame-pointer -ffile-prefix-map=/build/r-base-EawLoD/r-base-4.4.1=. -fstack-protector-strong -fstack-clash-protection -Wformat -Werror=format-security -fcf-protection -fdebug-prefix-map=/build/r-base-EawLoD/r-base-4.4.1=/usr/src/r-base-4.4.1-1.2404.0 -Wdate-time -D_FORTIFY_SOURCE=3 -c mutate.cpp -o mutate.o g++ -std=gnu++17 -I"/usr/share/R/include" -DNDEBUG -fpic -g -O2 -fno-omit-frame-pointer -mno-omit-leaf-frame-pointer -ffile-prefix-map=/build/r-base-EawLoD/r-base-4.4.1=. -fstack-protector-strong -fstack-clash-protection -Wformat -Werror=format-security -fcf-protection -fdebug-prefix-map=/build/r-base-EawLoD/r-base-4.4.1=/usr/src/r-base-4.4.1-1.2404.0 -Wdate-time -D_FORTIFY_SOURCE=3 -c reconstruct.cpp -o reconstruct.o g++ -std=gnu++17 -I"/usr/share/R/include" -DNDEBUG -fpic -g -O2 -fno-omit-frame-pointer -mno-omit-leaf-frame-pointer -ffile-prefix-map=/build/r-base-EawLoD/r-base-4.4.1=. -fstack-protector-strong -fstack-clash-protection -Wformat -Werror=format-security -fcf-protection -fdebug-prefix-map=/build/r-base-EawLoD/r-base-4.4.1=/usr/src/r-base-4.4.1-1.2404.0 -Wdate-time -D_FORTIFY_SOURCE=3 -c slice.cpp -o slice.o g++ -std=gnu++17 -I"/usr/share/R/include" -DNDEBUG -fpic -g -O2 -fno-omit-frame-pointer -mno-omit-leaf-frame-pointer -ffile-prefix-map=/build/r-base-EawLoD/r-base-4.4.1=. -fstack-protector-strong -fstack-clash-protection -Wformat -Werror=format-security -fcf-protection -fdebug-prefix-map=/build/r-base-EawLoD/r-base-4.4.1=/usr/src/r-base-4.4.1-1.2404.0 -Wdate-time -D_FORTIFY_SOURCE=3 -c summarise.cpp -o summarise.o g++ -std=gnu++17 -shared -L/usr/lib/R/lib -Wl,-Bsymbolic-functions -flto=auto -ffat-lto-objects -Wl,-z,relro -o dplyr.so chop.o filter.o funs.o group_by.o group_data.o imports.o init.o mask.o mutate.o reconstruct.o slice.o summarise.o -L/usr/lib/R/lib -lR installing to /home/omnipath/local/R/4.4-3.20/00LOCK-dplyr/00new/dplyr/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 (dplyr) * installing *source* package ‘rvest’ ... ** package ‘rvest’ successfully unpacked and MD5 sums checked ** using staged installation ** R ** demo ** inst ** byte-compile and prepare package for lazy loading ** help *** installing help indices *** copying figures ** building package indices ** installing vignettes ** testing if installed package can be loaded from temporary location ** testing if installed package can be loaded from final location ** testing if installed package keeps a record of temporary installation path * DONE (rvest) * installing *source* package ‘tidyr’ ... ** package ‘tidyr’ successfully unpacked and MD5 sums checked ** using staged installation ** libs using C++ compiler: ‘g++ (Ubuntu 13.2.0-23ubuntu4) 13.2.0’ g++ -std=gnu++17 -I"/usr/share/R/include" -DNDEBUG -I'/home/omnipath/local/R/4.4-3.20/cpp11/include' -fpic -g -O2 -fno-omit-frame-pointer -mno-omit-leaf-frame-pointer -ffile-prefix-map=/build/r-base-EawLoD/r-base-4.4.1=. -fstack-protector-strong -fstack-clash-protection -Wformat -Werror=format-security -fcf-protection -fdebug-prefix-map=/build/r-base-EawLoD/r-base-4.4.1=/usr/src/r-base-4.4.1-1.2404.0 -Wdate-time -D_FORTIFY_SOURCE=3 -c cpp11.cpp -o cpp11.o g++ -std=gnu++17 -I"/usr/share/R/include" -DNDEBUG -I'/home/omnipath/local/R/4.4-3.20/cpp11/include' -fpic -g -O2 -fno-omit-frame-pointer -mno-omit-leaf-frame-pointer -ffile-prefix-map=/build/r-base-EawLoD/r-base-4.4.1=. -fstack-protector-strong -fstack-clash-protection -Wformat -Werror=format-security -fcf-protection -fdebug-prefix-map=/build/r-base-EawLoD/r-base-4.4.1=/usr/src/r-base-4.4.1-1.2404.0 -Wdate-time -D_FORTIFY_SOURCE=3 -c melt.cpp -o melt.o g++ -std=gnu++17 -I"/usr/share/R/include" -DNDEBUG -I'/home/omnipath/local/R/4.4-3.20/cpp11/include' -fpic -g -O2 -fno-omit-frame-pointer -mno-omit-leaf-frame-pointer -ffile-prefix-map=/build/r-base-EawLoD/r-base-4.4.1=. -fstack-protector-strong -fstack-clash-protection -Wformat -Werror=format-security -fcf-protection -fdebug-prefix-map=/build/r-base-EawLoD/r-base-4.4.1=/usr/src/r-base-4.4.1-1.2404.0 -Wdate-time -D_FORTIFY_SOURCE=3 -c simplifyPieces.cpp -o simplifyPieces.o g++ -std=gnu++17 -shared -L/usr/lib/R/lib -Wl,-Bsymbolic-functions -flto=auto -ffat-lto-objects -Wl,-z,relro -o tidyr.so cpp11.o melt.o simplifyPieces.o -L/usr/lib/R/lib -lR installing to /home/omnipath/local/R/4.4-3.20/00LOCK-tidyr/00new/tidyr/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 (tidyr) * installing *source* package ‘dbplyr’ ... ** package ‘dbplyr’ 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 (dbplyr) * installing *source* package ‘BiocFileCache’ ... ** using staged installation ** R ** inst ** byte-compile and prepare package for lazy loading ** help *** installing help indices ** building package indices ** installing vignettes ** testing if installed package can be loaded from temporary location ** testing if installed package can be loaded from final location ** testing if installed package keeps a record of temporary installation path * DONE (BiocFileCache) * installing *source* package ‘BiocCheck’ ... ** package ‘BiocCheck’ successfully unpacked and MD5 sums checked ** using staged installation ** R ** inst ** byte-compile and prepare package for lazy loading ** help *** installing help indices ** building package indices ** installing vignettes ** testing if installed package can be loaded from temporary location ** testing if installed package can be loaded from final location ** testing if installed package keeps a record of temporary installation path * DONE (BiocCheck) The downloaded source packages are in ‘/tmp/RtmpSoQTSW/downloaded_packages’ crayon (NA -> 1.5.3 ) [CRAN] rematch2 (NA -> 2.1.2 ) [CRAN] diffobj (NA -> 0.3.5 ) [CRAN] rprojroot (NA -> 2.0.4 ) [CRAN] pkgbuild (NA -> 1.4.4 ) [CRAN] fs (NA -> 1.6.4 ) [CRAN] desc (NA -> 1.4.3 ) [CRAN] lazyeval (NA -> 0.2.2 ) [CRAN] digest (NA -> 0.6.36 ) [CRAN] sass (NA -> 0.4.9 ) [CRAN] base64enc (NA -> 0.1-3 ) [CRAN] tinytex (NA -> 0.52 ) [CRAN] jquerylib (NA -> 0.1.4 ) [CRAN] htmltools (NA -> 0.5.8.1) [CRAN] fontawesome (NA -> 0.5.2 ) [CRAN] bslib (NA -> 0.8.0 ) [CRAN] rmarkdown (NA -> 2.27 ) [CRAN] backports (NA -> 1.5.0 ) [CRAN] timechange (NA -> 0.3.0 ) [CRAN] Rcpp (NA -> 1.0.13 ) [CRAN] prettyunits (NA -> 1.2.0 ) [CRAN] progress (NA -> 1.2.3 ) [CRAN] tzdb (NA -> 0.4.0 ) [CRAN] hms (NA -> 1.1.3 ) [CRAN] waldo (NA -> 0.5.2 ) [CRAN] praise (NA -> 1.0.0 ) [CRAN] pkgload (NA -> 1.4.0 ) [CRAN] brio (NA -> 1.1.5 ) [CRAN] rex (NA -> 1.2.1 ) [CRAN] bookdown (NA -> 0.40 ) [CRAN] bibtex (NA -> 0.5.1 ) [CRAN] lubridate (NA -> 1.9.3 ) [CRAN] plyr (NA -> 1.8.9 ) [CRAN] vroom (NA -> 1.6.5 ) [CRAN] clipr (NA -> 0.8.0 ) [CRAN] sessioninfo (NA -> 1.2.2 ) [CRAN] testthat (NA -> 3.2.1.1) [CRAN] covr (NA -> 3.6.4 ) [CRAN] BiocStyle (NA -> 2.30.0 ) [CRAN] RefManageR (NA -> 1.4.0 ) [CRAN] rjson (NA -> 0.2.21 ) [CRAN] igraph (NA -> 2.0.3 ) [CRAN] lpSolve (NA -> 5.6.20 ) [CRAN] readr (NA -> 2.1.5 ) [CRAN] Installing 44 packages: crayon, rematch2, diffobj, rprojroot, pkgbuild, fs, desc, lazyeval, digest, sass, base64enc, tinytex, jquerylib, htmltools, fontawesome, bslib, rmarkdown, backports, timechange, Rcpp, prettyunits, progress, tzdb, hms, waldo, praise, pkgload, brio, rex, bookdown, bibtex, lubridate, plyr, vroom, clipr, sessioninfo, testthat, covr, BiocStyle, RefManageR, rjson, igraph, lpSolve, readr trying URL 'https://cran.uni-muenster.de/src/contrib/crayon_1.5.3.tar.gz' Content type 'application/x-gzip' length 40396 bytes (39 KB) ================================================== downloaded 39 KB trying URL 'https://cran.uni-muenster.de/src/contrib/rematch2_2.1.2.tar.gz' Content type 'application/x-gzip' length 13366 bytes (13 KB) ================================================== downloaded 13 KB trying URL 'https://cran.uni-muenster.de/src/contrib/diffobj_0.3.5.tar.gz' Content type 'application/x-gzip' length 479276 bytes (468 KB) ================================================== downloaded 468 KB trying URL 'https://cran.uni-muenster.de/src/contrib/rprojroot_2.0.4.tar.gz' Content type 'application/x-gzip' length 59946 bytes (58 KB) ================================================== downloaded 58 KB trying URL 'https://cran.uni-muenster.de/src/contrib/pkgbuild_1.4.4.tar.gz' Content type 'application/x-gzip' length 48794 bytes (47 KB) ================================================== downloaded 47 KB trying URL 'https://cran.uni-muenster.de/src/contrib/fs_1.6.4.tar.gz' Content type 'application/x-gzip' length 1201506 bytes (1.1 MB) ================================================== downloaded 1.1 MB trying URL 'https://cran.uni-muenster.de/src/contrib/desc_1.4.3.tar.gz' Content type 'application/x-gzip' length 80066 bytes (78 KB) ================================================== downloaded 78 KB trying URL 'https://cran.uni-muenster.de/src/contrib/lazyeval_0.2.2.tar.gz' Content type 'application/x-gzip' length 83482 bytes (81 KB) ================================================== downloaded 81 KB trying URL 'https://cran.uni-muenster.de/src/contrib/digest_0.6.36.tar.gz' Content type 'application/x-gzip' length 231298 bytes (225 KB) ================================================== downloaded 225 KB trying URL 'https://cran.uni-muenster.de/src/contrib/sass_0.4.9.tar.gz' Content type 'application/x-gzip' length 3025086 bytes (2.9 MB) ================================================== downloaded 2.9 MB trying URL 'https://cran.uni-muenster.de/src/contrib/base64enc_0.1-3.tar.gz' Content type 'application/x-gzip' length 7833 bytes ================================================== downloaded 7833 bytes trying URL 'https://cran.uni-muenster.de/src/contrib/tinytex_0.52.tar.gz' Content type 'application/x-gzip' length 35032 bytes (34 KB) ================================================== downloaded 34 KB trying URL 'https://cran.uni-muenster.de/src/contrib/jquerylib_0.1.4.tar.gz' Content type 'application/x-gzip' length 520207 bytes (508 KB) ================================================== downloaded 508 KB trying URL 'https://cran.uni-muenster.de/src/contrib/htmltools_0.5.8.1.tar.gz' Content type 'application/x-gzip' length 135134 bytes (131 KB) ================================================== downloaded 131 KB trying URL 'https://cran.uni-muenster.de/src/contrib/fontawesome_0.5.2.tar.gz' Content type 'application/x-gzip' length 1281884 bytes (1.2 MB) ================================================== downloaded 1.2 MB trying URL 'https://cran.uni-muenster.de/src/contrib/bslib_0.8.0.tar.gz' Content type 'application/x-gzip' length 5136884 bytes (4.9 MB) ================================================== downloaded 4.9 MB trying URL 'https://cran.uni-muenster.de/src/contrib/rmarkdown_2.27.tar.gz' Content type 'application/x-gzip' length 2190416 bytes (2.1 MB) ================================================== downloaded 2.1 MB trying URL 'https://cran.uni-muenster.de/src/contrib/backports_1.5.0.tar.gz' Content type 'application/x-gzip' length 30687 bytes (29 KB) ================================================== downloaded 29 KB trying URL 'https://cran.uni-muenster.de/src/contrib/timechange_0.3.0.tar.gz' Content type 'application/x-gzip' length 103439 bytes (101 KB) ================================================== downloaded 101 KB trying URL 'https://cran.uni-muenster.de/src/contrib/Rcpp_1.0.13.tar.gz' Content type 'application/x-gzip' length 3435344 bytes (3.3 MB) ================================================== downloaded 3.3 MB trying URL 'https://cran.uni-muenster.de/src/contrib/prettyunits_1.2.0.tar.gz' Content type 'application/x-gzip' length 97496 bytes (95 KB) ================================================== downloaded 95 KB trying URL 'https://cran.uni-muenster.de/src/contrib/progress_1.2.3.tar.gz' Content type 'application/x-gzip' length 30499 bytes (29 KB) ================================================== downloaded 29 KB trying URL 'https://cran.uni-muenster.de/src/contrib/tzdb_0.4.0.tar.gz' Content type 'application/x-gzip' length 586327 bytes (572 KB) ================================================== downloaded 572 KB trying URL 'https://cran.uni-muenster.de/src/contrib/hms_1.1.3.tar.gz' Content type 'application/x-gzip' length 43379 bytes (42 KB) ================================================== downloaded 42 KB trying URL 'https://cran.uni-muenster.de/src/contrib/waldo_0.5.2.tar.gz' Content type 'application/x-gzip' length 39711 bytes (38 KB) ================================================== downloaded 38 KB trying URL 'https://cran.uni-muenster.de/src/contrib/praise_1.0.0.tar.gz' Content type 'application/x-gzip' length 6100 bytes ================================================== downloaded 6100 bytes trying URL 'https://cran.uni-muenster.de/src/contrib/pkgload_1.4.0.tar.gz' Content type 'application/x-gzip' length 85664 bytes (83 KB) ================================================== downloaded 83 KB trying URL 'https://cran.uni-muenster.de/src/contrib/brio_1.1.5.tar.gz' Content type 'application/x-gzip' length 13172 bytes (12 KB) ================================================== downloaded 12 KB trying URL 'https://cran.uni-muenster.de/src/contrib/rex_1.2.1.tar.gz' Content type 'application/x-gzip' length 93583 bytes (91 KB) ================================================== downloaded 91 KB trying URL 'https://cran.uni-muenster.de/src/contrib/bookdown_0.40.tar.gz' Content type 'application/x-gzip' length 859130 bytes (838 KB) ================================================== downloaded 838 KB trying URL 'https://cran.uni-muenster.de/src/contrib/bibtex_0.5.1.tar.gz' Content type 'application/x-gzip' length 79311 bytes (77 KB) ================================================== downloaded 77 KB trying URL 'https://cran.uni-muenster.de/src/contrib/lubridate_1.9.3.tar.gz' Content type 'application/x-gzip' length 428043 bytes (418 KB) ================================================== downloaded 418 KB trying URL 'https://cran.uni-muenster.de/src/contrib/plyr_1.8.9.tar.gz' Content type 'application/x-gzip' length 401488 bytes (392 KB) ================================================== downloaded 392 KB trying URL 'https://cran.uni-muenster.de/src/contrib/vroom_1.6.5.tar.gz' Content type 'application/x-gzip' length 750416 bytes (732 KB) ================================================== downloaded 732 KB trying URL 'https://cran.uni-muenster.de/src/contrib/clipr_0.8.0.tar.gz' Content type 'application/x-gzip' length 21898 bytes (21 KB) ================================================== downloaded 21 KB trying URL 'https://cran.uni-muenster.de/src/contrib/sessioninfo_1.2.2.tar.gz' Content type 'application/x-gzip' length 170924 bytes (166 KB) ================================================== downloaded 166 KB trying URL 'https://cran.uni-muenster.de/src/contrib/testthat_3.2.1.1.tar.gz' Content type 'application/x-gzip' length 739761 bytes (722 KB) ================================================== downloaded 722 KB trying URL 'https://cran.uni-muenster.de/src/contrib/covr_3.6.4.tar.gz' Content type 'application/x-gzip' length 163362 bytes (159 KB) ================================================== downloaded 159 KB trying URL 'https://bioconductor.org/packages/3.18/bioc/src/contrib/BiocStyle_2.30.0.tar.gz' Content type 'application/gzip' length 787685 bytes (769 KB) ================================================== downloaded 769 KB trying URL 'https://cran.uni-muenster.de/src/contrib/RefManageR_1.4.0.tar.gz' Content type 'application/x-gzip' length 911039 bytes (889 KB) ================================================== downloaded 889 KB trying URL 'https://cran.uni-muenster.de/src/contrib/rjson_0.2.21.tar.gz' Content type 'application/x-gzip' length 116509 bytes (113 KB) ================================================== downloaded 113 KB trying URL 'https://cran.uni-muenster.de/src/contrib/igraph_2.0.3.tar.gz' Content type 'application/x-gzip' length 4967875 bytes (4.7 MB) ================================================== downloaded 4.7 MB trying URL 'https://cran.uni-muenster.de/src/contrib/lpSolve_5.6.20.tar.gz' Content type 'application/x-gzip' length 468218 bytes (457 KB) ================================================== downloaded 457 KB trying URL 'https://cran.uni-muenster.de/src/contrib/readr_2.1.5.tar.gz' Content type 'application/x-gzip' length 298065 bytes (291 KB) ================================================== downloaded 291 KB * installing *source* package ‘crayon’ ... ** package ‘crayon’ 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 (crayon) * installing *source* package ‘rematch2’ ... ** package ‘rematch2’ 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 (rematch2) * installing *source* package ‘rprojroot’ ... ** package ‘rprojroot’ 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 (rprojroot) * installing *source* package ‘fs’ ... ** package ‘fs’ successfully unpacked and MD5 sums checked ** using staged installation ** libs using C++ compiler: ‘g++ (Ubuntu 13.2.0-23ubuntu4) 13.2.0’ g++ -std=gnu++17 -I"/usr/share/R/include" -DNDEBUG -I./libuv-1.44.2/include -I. -pthread -fpic -g -O2 -fno-omit-frame-pointer -mno-omit-leaf-frame-pointer -ffile-prefix-map=/build/r-base-EawLoD/r-base-4.4.1=. -fstack-protector-strong -fstack-clash-protection -Wformat -Werror=format-security -fcf-protection -fdebug-prefix-map=/build/r-base-EawLoD/r-base-4.4.1=/usr/src/r-base-4.4.1-1.2404.0 -Wdate-time -D_FORTIFY_SOURCE=3 -c dir.cc -o dir.o g++ -std=gnu++17 -I"/usr/share/R/include" -DNDEBUG -I./libuv-1.44.2/include -I. -pthread -fpic -g -O2 -fno-omit-frame-pointer -mno-omit-leaf-frame-pointer -ffile-prefix-map=/build/r-base-EawLoD/r-base-4.4.1=. -fstack-protector-strong -fstack-clash-protection -Wformat -Werror=format-security -fcf-protection -fdebug-prefix-map=/build/r-base-EawLoD/r-base-4.4.1=/usr/src/r-base-4.4.1-1.2404.0 -Wdate-time -D_FORTIFY_SOURCE=3 -c error.cc -o error.o g++ -std=gnu++17 -I"/usr/share/R/include" -DNDEBUG -I./libuv-1.44.2/include -I. -pthread -fpic -g -O2 -fno-omit-frame-pointer -mno-omit-leaf-frame-pointer -ffile-prefix-map=/build/r-base-EawLoD/r-base-4.4.1=. -fstack-protector-strong -fstack-clash-protection -Wformat -Werror=format-security -fcf-protection -fdebug-prefix-map=/build/r-base-EawLoD/r-base-4.4.1=/usr/src/r-base-4.4.1-1.2404.0 -Wdate-time -D_FORTIFY_SOURCE=3 -c file.cc -o file.o g++ -std=gnu++17 -I"/usr/share/R/include" -DNDEBUG -I./libuv-1.44.2/include -I. -pthread -fpic -g -O2 -fno-omit-frame-pointer -mno-omit-leaf-frame-pointer -ffile-prefix-map=/build/r-base-EawLoD/r-base-4.4.1=. -fstack-protector-strong -fstack-clash-protection -Wformat -Werror=format-security -fcf-protection -fdebug-prefix-map=/build/r-base-EawLoD/r-base-4.4.1=/usr/src/r-base-4.4.1-1.2404.0 -Wdate-time -D_FORTIFY_SOURCE=3 -c fs.cc -o fs.o g++ -std=gnu++17 -I"/usr/share/R/include" -DNDEBUG -I./libuv-1.44.2/include -I. -pthread -fpic -g -O2 -fno-omit-frame-pointer -mno-omit-leaf-frame-pointer -ffile-prefix-map=/build/r-base-EawLoD/r-base-4.4.1=. -fstack-protector-strong -fstack-clash-protection -Wformat -Werror=format-security -fcf-protection -fdebug-prefix-map=/build/r-base-EawLoD/r-base-4.4.1=/usr/src/r-base-4.4.1-1.2404.0 -Wdate-time -D_FORTIFY_SOURCE=3 -c getmode.cc -o getmode.o g++ -std=gnu++17 -I"/usr/share/R/include" -DNDEBUG -I./libuv-1.44.2/include -I. -pthread -fpic -g -O2 -fno-omit-frame-pointer -mno-omit-leaf-frame-pointer -ffile-prefix-map=/build/r-base-EawLoD/r-base-4.4.1=. -fstack-protector-strong -fstack-clash-protection -Wformat -Werror=format-security -fcf-protection -fdebug-prefix-map=/build/r-base-EawLoD/r-base-4.4.1=/usr/src/r-base-4.4.1-1.2404.0 -Wdate-time -D_FORTIFY_SOURCE=3 -c id.cc -o id.o g++ -std=gnu++17 -I"/usr/share/R/include" -DNDEBUG -I./libuv-1.44.2/include -I. -pthread -fpic -g -O2 -fno-omit-frame-pointer -mno-omit-leaf-frame-pointer -ffile-prefix-map=/build/r-base-EawLoD/r-base-4.4.1=. -fstack-protector-strong -fstack-clash-protection -Wformat -Werror=format-security -fcf-protection -fdebug-prefix-map=/build/r-base-EawLoD/r-base-4.4.1=/usr/src/r-base-4.4.1-1.2404.0 -Wdate-time -D_FORTIFY_SOURCE=3 -c init.cc -o init.o g++ -std=gnu++17 -I"/usr/share/R/include" -DNDEBUG -I./libuv-1.44.2/include -I. -pthread -fpic -g -O2 -fno-omit-frame-pointer -mno-omit-leaf-frame-pointer -ffile-prefix-map=/build/r-base-EawLoD/r-base-4.4.1=. -fstack-protector-strong -fstack-clash-protection -Wformat -Werror=format-security -fcf-protection -fdebug-prefix-map=/build/r-base-EawLoD/r-base-4.4.1=/usr/src/r-base-4.4.1-1.2404.0 -Wdate-time -D_FORTIFY_SOURCE=3 -c link.cc -o link.o g++ -std=gnu++17 -I"/usr/share/R/include" -DNDEBUG -I./libuv-1.44.2/include -I. -pthread -fpic -g -O2 -fno-omit-frame-pointer -mno-omit-leaf-frame-pointer -ffile-prefix-map=/build/r-base-EawLoD/r-base-4.4.1=. -fstack-protector-strong -fstack-clash-protection -Wformat -Werror=format-security -fcf-protection -fdebug-prefix-map=/build/r-base-EawLoD/r-base-4.4.1=/usr/src/r-base-4.4.1-1.2404.0 -Wdate-time -D_FORTIFY_SOURCE=3 -c path.cc -o path.o g++ -std=gnu++17 -I"/usr/share/R/include" -DNDEBUG -I./libuv-1.44.2/include -I. -pthread -fpic -g -O2 -fno-omit-frame-pointer -mno-omit-leaf-frame-pointer -ffile-prefix-map=/build/r-base-EawLoD/r-base-4.4.1=. -fstack-protector-strong -fstack-clash-protection -Wformat -Werror=format-security -fcf-protection -fdebug-prefix-map=/build/r-base-EawLoD/r-base-4.4.1=/usr/src/r-base-4.4.1-1.2404.0 -Wdate-time -D_FORTIFY_SOURCE=3 -c utils.cc -o utils.o g++ -std=gnu++17 -I"/usr/share/R/include" -DNDEBUG -I./libuv-1.44.2/include -I. -pthread -fpic -g -O2 -fno-omit-frame-pointer -mno-omit-leaf-frame-pointer -ffile-prefix-map=/build/r-base-EawLoD/r-base-4.4.1=. -fstack-protector-strong -fstack-clash-protection -Wformat -Werror=format-security -fcf-protection -fdebug-prefix-map=/build/r-base-EawLoD/r-base-4.4.1=/usr/src/r-base-4.4.1-1.2404.0 -Wdate-time -D_FORTIFY_SOURCE=3 -c unix/getmode.cc -o unix/getmode.o gcc -I"/usr/share/R/include" -DNDEBUG -I./libuv-1.44.2/include -I. -pthread -fpic -g -O2 -fno-omit-frame-pointer -mno-omit-leaf-frame-pointer -ffile-prefix-map=/build/r-base-EawLoD/r-base-4.4.1=. -fstack-protector-strong -fstack-clash-protection -Wformat -Werror=format-security -fcf-protection -fdebug-prefix-map=/build/r-base-EawLoD/r-base-4.4.1=/usr/src/r-base-4.4.1-1.2404.0 -Wdate-time -D_FORTIFY_SOURCE=3 -c bsd/setmode.c -o bsd/setmode.o gcc -I"/usr/share/R/include" -DNDEBUG -I./libuv-1.44.2/include -I. -pthread -fpic -g -O2 -fno-omit-frame-pointer -mno-omit-leaf-frame-pointer -ffile-prefix-map=/build/r-base-EawLoD/r-base-4.4.1=. -fstack-protector-strong -fstack-clash-protection -Wformat -Werror=format-security -fcf-protection -fdebug-prefix-map=/build/r-base-EawLoD/r-base-4.4.1=/usr/src/r-base-4.4.1-1.2404.0 -Wdate-time -D_FORTIFY_SOURCE=3 -c bsd/strmode.c -o bsd/strmode.o gcc -I"/usr/share/R/include" -DNDEBUG -I./libuv-1.44.2/include -I. -pthread -fpic -g -O2 -fno-omit-frame-pointer -mno-omit-leaf-frame-pointer -ffile-prefix-map=/build/r-base-EawLoD/r-base-4.4.1=. -fstack-protector-strong -fstack-clash-protection -Wformat -Werror=format-security -fcf-protection -fdebug-prefix-map=/build/r-base-EawLoD/r-base-4.4.1=/usr/src/r-base-4.4.1-1.2404.0 -Wdate-time -D_FORTIFY_SOURCE=3 -c bsd/reallocarray.c -o bsd/reallocarray.o (cd libuv-1.44.2 \ && CC="gcc" CPPFLAGS="" CFLAGS="-g -O2 -fno-omit-frame-pointer -mno-omit-leaf-frame-pointer -ffile-prefix-map=/build/r-base-EawLoD/r-base-4.4.1=. -fstack-protector-strong -fstack-clash-protection -Wformat -Werror=format-security -fcf-protection -fdebug-prefix-map=/build/r-base-EawLoD/r-base-4.4.1=/usr/src/r-base-4.4.1-1.2404.0 -Wdate-time -D_FORTIFY_SOURCE=3 -fpic -fvisibility=hidden -std=c99" AR="ar" RANLIB="ranlib" LDFLAGS="-Wl,-Bsymbolic-functions -flto=auto -ffat-lto-objects -Wl,-z,relro" ./configure --quiet) make --directory=libuv-1.44.2 \ HAVE_DTRACE=0 make[1]: Entering directory '/tmp/RtmpQzmA4P/R.INSTALL139f92644b103/fs/src/libuv-1.44.2' CC src/libuv_la-fs-poll.lo CC src/libuv_la-idna.lo CC src/libuv_la-inet.lo CC src/libuv_la-random.lo CC src/libuv_la-strscpy.lo CC src/libuv_la-threadpool.lo CC src/libuv_la-timer.lo CC src/libuv_la-uv-data-getter-setters.lo CC src/libuv_la-uv-common.lo In file included from src/uv-common.h:42, from src/uv-common.c:23: src/uv-common.c: In function 'uv_walk': src/queue.h:68:19: warning: storing the address of local variable 'queue' in '((void * (**)[2])MEM[(void *[2] * *)loop_13(D) + 16B])[1]' [-Wdangling-pointer=] 68 | QUEUE_PREV(q) = (n); \ | ^ src/queue.h:78:7: note: in expansion of macro 'QUEUE_SPLIT' 78 | QUEUE_SPLIT(h, q, n); \ | ^~~~~~~~~~~ src/uv-common.c:507:3: note: in expansion of macro 'QUEUE_MOVE' 507 | QUEUE_MOVE(&loop->handle_queue, &queue); | ^~~~~~~~~~ src/uv-common.c:503:9: note: 'queue' declared here 503 | QUEUE queue; | ^~~~~ src/uv-common.c:502:25: note: 'loop' declared here 502 | void uv_walk(uv_loop_t* loop, uv_walk_cb walk_cb, void* arg) { | ~~~~~~~~~~~^~~~ CC src/libuv_la-version.lo CC src/libuv_la-strtok.lo CC src/unix/libuv_la-async.lo In file included from ./src/uv-common.h:42, from src/unix/internal.h:25, from src/unix/async.c:26: src/unix/async.c: In function 'uv__async_io.part.0': ./src/queue.h:68:19: warning: storing the address of local variable 'queue' in '((void * (**)[2])MEM[(void *[2] * *)loop_6(D) + 432B])[1]' [-Wdangling-pointer=] 68 | QUEUE_PREV(q) = (n); \ | ^ ./src/queue.h:78:7: note: in expansion of macro 'QUEUE_SPLIT' 78 | QUEUE_SPLIT(h, q, n); \ | ^~~~~~~~~~~ src/unix/async.c:149:3: note: in expansion of macro 'QUEUE_MOVE' 149 | QUEUE_MOVE(&loop->async_handles, &queue); | ^~~~~~~~~~ src/unix/async.c:125:9: note: 'queue' declared here 125 | QUEUE queue; | ^~~~~ src/unix/async.c:122:37: note: 'loop' declared here 122 | static void uv__async_io(uv_loop_t* loop, uv__io_t* w, unsigned int events) { | ~~~~~~~~~~~^~~~ CC src/unix/libuv_la-core.lo In file included from ./src/uv-common.h:42, from src/unix/internal.h:25, from src/unix/core.c:22: src/unix/core.c: In function 'uv__run_pending': ./src/queue.h:68:19: warning: storing the address of local variable 'pq' in '((void * (**)[2])MEM[(void *[2] * *)loop_11(D) + 72B])[1]' [-Wdangling-pointer=] 68 | QUEUE_PREV(q) = (n); \ | ^ ./src/queue.h:78:7: note: in expansion of macro 'QUEUE_SPLIT' 78 | QUEUE_SPLIT(h, q, n); \ | ^~~~~~~~~~~ src/unix/core.c:803:3: note: in expansion of macro 'QUEUE_MOVE' 803 | QUEUE_MOVE(&loop->pending_queue, &pq); | ^~~~~~~~~~ src/unix/core.c:800:9: note: 'pq' declared here 800 | QUEUE pq; | ^~ src/unix/core.c:798:40: note: 'loop' declared here 798 | static void uv__run_pending(uv_loop_t* loop) { | ~~~~~~~~~~~^~~~ CC src/unix/libuv_la-dl.lo CC src/unix/libuv_la-fs.lo CC src/unix/libuv_la-getaddrinfo.lo CC src/unix/libuv_la-getnameinfo.lo CC src/unix/libuv_la-loop-watcher.lo In file included from ./src/uv-common.h:42, from src/unix/internal.h:25, from src/unix/loop-watcher.c:23: src/unix/loop-watcher.c: In function 'uv__run_prepare': ./src/queue.h:68:19: warning: storing the address of local variable 'queue' in '((void * (**)[2])MEM[(void *[2] * *)loop_12(D) + 384B])[1]' [-Wdangling-pointer=] 68 | QUEUE_PREV(q) = (n); \ | ^ ./src/queue.h:78:7: note: in expansion of macro 'QUEUE_SPLIT' 78 | QUEUE_SPLIT(h, q, n); \ | ^~~~~~~~~~~ src/unix/loop-watcher.c:52:5: note: in expansion of macro 'QUEUE_MOVE' 52 | QUEUE_MOVE(&loop->name##_handles, &queue); \ | ^~~~~~~~~~ src/unix/loop-watcher.c:66:1: note: in expansion of macro 'UV_LOOP_WATCHER_DEFINE' 66 | UV_LOOP_WATCHER_DEFINE(prepare, PREPARE) | ^~~~~~~~~~~~~~~~~~~~~~ src/unix/loop-watcher.c:50:11: note: 'queue' declared here 50 | QUEUE queue; \ | ^~~~~ src/unix/loop-watcher.c:66:1: note: in expansion of macro 'UV_LOOP_WATCHER_DEFINE' 66 | UV_LOOP_WATCHER_DEFINE(prepare, PREPARE) | ^~~~~~~~~~~~~~~~~~~~~~ src/unix/loop-watcher.c:48:34: note: 'loop' declared here 48 | void uv__run_##name(uv_loop_t* loop) { \ | ~~~~~~~~~~~^~~~ src/unix/loop-watcher.c:66:1: note: in expansion of macro 'UV_LOOP_WATCHER_DEFINE' 66 | UV_LOOP_WATCHER_DEFINE(prepare, PREPARE) | ^~~~~~~~~~~~~~~~~~~~~~ src/unix/loop-watcher.c: In function 'uv__run_check': ./src/queue.h:68:19: warning: storing the address of local variable 'queue' in '((void * (**)[2])MEM[(void *[2] * *)loop_12(D) + 400B])[1]' [-Wdangling-pointer=] 68 | QUEUE_PREV(q) = (n); \ | ^ ./src/queue.h:78:7: note: in expansion of macro 'QUEUE_SPLIT' 78 | QUEUE_SPLIT(h, q, n); \ | ^~~~~~~~~~~ src/unix/loop-watcher.c:52:5: note: in expansion of macro 'QUEUE_MOVE' 52 | QUEUE_MOVE(&loop->name##_handles, &queue); \ | ^~~~~~~~~~ src/unix/loop-watcher.c:67:1: note: in expansion of macro 'UV_LOOP_WATCHER_DEFINE' 67 | UV_LOOP_WATCHER_DEFINE(check, CHECK) | ^~~~~~~~~~~~~~~~~~~~~~ src/unix/loop-watcher.c:50:11: note: 'queue' declared here 50 | QUEUE queue; \ | ^~~~~ src/unix/loop-watcher.c:67:1: note: in expansion of macro 'UV_LOOP_WATCHER_DEFINE' 67 | UV_LOOP_WATCHER_DEFINE(check, CHECK) | ^~~~~~~~~~~~~~~~~~~~~~ src/unix/loop-watcher.c:48:34: note: 'loop' declared here 48 | void uv__run_##name(uv_loop_t* loop) { \ | ~~~~~~~~~~~^~~~ src/unix/loop-watcher.c:67:1: note: in expansion of macro 'UV_LOOP_WATCHER_DEFINE' 67 | UV_LOOP_WATCHER_DEFINE(check, CHECK) | ^~~~~~~~~~~~~~~~~~~~~~ src/unix/loop-watcher.c: In function 'uv__run_idle': ./src/queue.h:68:19: warning: storing the address of local variable 'queue' in '((void * (**)[2])MEM[(void *[2] * *)loop_12(D) + 416B])[1]' [-Wdangling-pointer=] 68 | QUEUE_PREV(q) = (n); \ | ^ ./src/queue.h:78:7: note: in expansion of macro 'QUEUE_SPLIT' 78 | QUEUE_SPLIT(h, q, n); \ | ^~~~~~~~~~~ src/unix/loop-watcher.c:52:5: note: in expansion of macro 'QUEUE_MOVE' 52 | QUEUE_MOVE(&loop->name##_handles, &queue); \ | ^~~~~~~~~~ src/unix/loop-watcher.c:68:1: note: in expansion of macro 'UV_LOOP_WATCHER_DEFINE' 68 | UV_LOOP_WATCHER_DEFINE(idle, IDLE) | ^~~~~~~~~~~~~~~~~~~~~~ src/unix/loop-watcher.c:50:11: note: 'queue' declared here 50 | QUEUE queue; \ | ^~~~~ src/unix/loop-watcher.c:68:1: note: in expansion of macro 'UV_LOOP_WATCHER_DEFINE' 68 | UV_LOOP_WATCHER_DEFINE(idle, IDLE) | ^~~~~~~~~~~~~~~~~~~~~~ src/unix/loop-watcher.c:48:34: note: 'loop' declared here 48 | void uv__run_##name(uv_loop_t* loop) { \ | ~~~~~~~~~~~^~~~ src/unix/loop-watcher.c:68:1: note: in expansion of macro 'UV_LOOP_WATCHER_DEFINE' 68 | UV_LOOP_WATCHER_DEFINE(idle, IDLE) | ^~~~~~~~~~~~~~~~~~~~~~ CC src/unix/libuv_la-loop.lo CC src/unix/libuv_la-pipe.lo CC src/unix/libuv_la-poll.lo CC src/unix/libuv_la-process.lo CC src/unix/libuv_la-random-devurandom.lo CC src/unix/libuv_la-signal.lo CC src/unix/libuv_la-stream.lo In file included from ./src/uv-common.h:42, from src/unix/internal.h:25, from src/unix/stream.c:23: src/unix/stream.c: In function 'uv__write_callbacks': ./src/queue.h:68:19: warning: storing the address of local variable 'pq' in '((void * (**)[2])MEM[(void *[2] * *)stream_23(D) + 208B])[1]' [-Wdangling-pointer=] 68 | QUEUE_PREV(q) = (n); \ | ^ ./src/queue.h:78:7: note: in expansion of macro 'QUEUE_SPLIT' 78 | QUEUE_SPLIT(h, q, n); \ | ^~~~~~~~~~~ src/unix/stream.c:941:3: note: in expansion of macro 'QUEUE_MOVE' 941 | QUEUE_MOVE(&stream->write_completed_queue, &pq); | ^~~~~~~~~~ src/unix/stream.c:936:9: note: 'pq' declared here 936 | QUEUE pq; | ^~ src/unix/stream.c:933:46: note: 'stream' declared here 933 | static void uv__write_callbacks(uv_stream_t* stream) { | ~~~~~~~~~~~~~^~~~~~ CC src/unix/libuv_la-tcp.lo CC src/unix/libuv_la-thread.lo CC src/unix/libuv_la-tty.lo CC src/unix/libuv_la-udp.lo CC src/unix/libuv_la-linux-core.lo CC src/unix/libuv_la-linux-inotify.lo CC src/unix/libuv_la-linux-syscalls.lo CC src/unix/libuv_la-procfs-exepath.lo CC src/unix/libuv_la-proctitle.lo CC src/unix/libuv_la-random-getrandom.lo CC src/unix/libuv_la-random-sysctl-linux.lo CC src/unix/libuv_la-epoll.lo CCLD libuv.la make[1]: Leaving directory '/tmp/RtmpQzmA4P/R.INSTALL139f92644b103/fs/src/libuv-1.44.2' g++ -std=gnu++17 -shared -L/usr/lib/R/lib -Wl,-Bsymbolic-functions -flto=auto -ffat-lto-objects -Wl,-z,relro -o fs.so dir.o error.o file.o fs.o getmode.o id.o init.o link.o path.o utils.o unix/getmode.o bsd/setmode.o bsd/strmode.o bsd/reallocarray.o ./libuv-1.44.2/.libs/libuv.a -pthread -L/usr/lib/R/lib -lR installing to /home/omnipath/local/R/4.4-3.20/00LOCK-fs/00new/fs/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 (fs) * installing *source* package ‘desc’ ... ** package ‘desc’ 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 (desc) * installing *source* package ‘lazyeval’ ... ** package ‘lazyeval’ successfully unpacked and MD5 sums checked ** using staged installation ** libs using C compiler: ‘gcc (Ubuntu 13.2.0-23ubuntu4) 13.2.0’ gcc -I"/usr/share/R/include" -DNDEBUG -fpic -g -O2 -fno-omit-frame-pointer -mno-omit-leaf-frame-pointer -ffile-prefix-map=/build/r-base-EawLoD/r-base-4.4.1=. -fstack-protector-strong -fstack-clash-protection -Wformat -Werror=format-security -fcf-protection -fdebug-prefix-map=/build/r-base-EawLoD/r-base-4.4.1=/usr/src/r-base-4.4.1-1.2404.0 -Wdate-time -D_FORTIFY_SOURCE=3 -c expr.c -o expr.o gcc -I"/usr/share/R/include" -DNDEBUG -fpic -g -O2 -fno-omit-frame-pointer -mno-omit-leaf-frame-pointer -ffile-prefix-map=/build/r-base-EawLoD/r-base-4.4.1=. -fstack-protector-strong -fstack-clash-protection -Wformat -Werror=format-security -fcf-protection -fdebug-prefix-map=/build/r-base-EawLoD/r-base-4.4.1=/usr/src/r-base-4.4.1-1.2404.0 -Wdate-time -D_FORTIFY_SOURCE=3 -c init.c -o init.o gcc -I"/usr/share/R/include" -DNDEBUG -fpic -g -O2 -fno-omit-frame-pointer -mno-omit-leaf-frame-pointer -ffile-prefix-map=/build/r-base-EawLoD/r-base-4.4.1=. -fstack-protector-strong -fstack-clash-protection -Wformat -Werror=format-security -fcf-protection -fdebug-prefix-map=/build/r-base-EawLoD/r-base-4.4.1=/usr/src/r-base-4.4.1-1.2404.0 -Wdate-time -D_FORTIFY_SOURCE=3 -c interp.c -o interp.o gcc -I"/usr/share/R/include" -DNDEBUG -fpic -g -O2 -fno-omit-frame-pointer -mno-omit-leaf-frame-pointer -ffile-prefix-map=/build/r-base-EawLoD/r-base-4.4.1=. -fstack-protector-strong -fstack-clash-protection -Wformat -Werror=format-security -fcf-protection -fdebug-prefix-map=/build/r-base-EawLoD/r-base-4.4.1=/usr/src/r-base-4.4.1-1.2404.0 -Wdate-time -D_FORTIFY_SOURCE=3 -c lazy.c -o lazy.o gcc -I"/usr/share/R/include" -DNDEBUG -fpic -g -O2 -fno-omit-frame-pointer -mno-omit-leaf-frame-pointer -ffile-prefix-map=/build/r-base-EawLoD/r-base-4.4.1=. -fstack-protector-strong -fstack-clash-protection -Wformat -Werror=format-security -fcf-protection -fdebug-prefix-map=/build/r-base-EawLoD/r-base-4.4.1=/usr/src/r-base-4.4.1-1.2404.0 -Wdate-time -D_FORTIFY_SOURCE=3 -c name.c -o name.o gcc -I"/usr/share/R/include" -DNDEBUG -fpic -g -O2 -fno-omit-frame-pointer -mno-omit-leaf-frame-pointer -ffile-prefix-map=/build/r-base-EawLoD/r-base-4.4.1=. -fstack-protector-strong -fstack-clash-protection -Wformat -Werror=format-security -fcf-protection -fdebug-prefix-map=/build/r-base-EawLoD/r-base-4.4.1=/usr/src/r-base-4.4.1-1.2404.0 -Wdate-time -D_FORTIFY_SOURCE=3 -c utils.c -o utils.o gcc -shared -L/usr/lib/R/lib -Wl,-Bsymbolic-functions -flto=auto -ffat-lto-objects -Wl,-z,relro -o lazyeval.so expr.o init.o interp.o lazy.o name.o utils.o -L/usr/lib/R/lib -lR installing to /home/omnipath/local/R/4.4-3.20/00LOCK-lazyeval/00new/lazyeval/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 (lazyeval) * installing *source* package ‘digest’ ... ** package ‘digest’ successfully unpacked and MD5 sums checked ** using staged installation ** libs using C compiler: ‘gcc (Ubuntu 13.2.0-23ubuntu4) 13.2.0’ using C++ compiler: ‘g++ (Ubuntu 13.2.0-23ubuntu4) 13.2.0’ g++ -std=gnu++17 -I"/usr/share/R/include" -DNDEBUG -I. -fpic -g -O2 -fno-omit-frame-pointer -mno-omit-leaf-frame-pointer -ffile-prefix-map=/build/r-base-EawLoD/r-base-4.4.1=. -fstack-protector-strong -fstack-clash-protection -Wformat -Werror=format-security -fcf-protection -fdebug-prefix-map=/build/r-base-EawLoD/r-base-4.4.1=/usr/src/r-base-4.4.1-1.2404.0 -Wdate-time -D_FORTIFY_SOURCE=3 -c SpookyV2.cpp -o SpookyV2.o gcc -I"/usr/share/R/include" -DNDEBUG -I. -fpic -g -O2 -fno-omit-frame-pointer -mno-omit-leaf-frame-pointer -ffile-prefix-map=/build/r-base-EawLoD/r-base-4.4.1=. -fstack-protector-strong -fstack-clash-protection -Wformat -Werror=format-security -fcf-protection -fdebug-prefix-map=/build/r-base-EawLoD/r-base-4.4.1=/usr/src/r-base-4.4.1-1.2404.0 -Wdate-time -D_FORTIFY_SOURCE=3 -c aes.c -o aes.o gcc -I"/usr/share/R/include" -DNDEBUG -I. -fpic -g -O2 -fno-omit-frame-pointer -mno-omit-leaf-frame-pointer -ffile-prefix-map=/build/r-base-EawLoD/r-base-4.4.1=. -fstack-protector-strong -fstack-clash-protection -Wformat -Werror=format-security -fcf-protection -fdebug-prefix-map=/build/r-base-EawLoD/r-base-4.4.1=/usr/src/r-base-4.4.1-1.2404.0 -Wdate-time -D_FORTIFY_SOURCE=3 -c blake3.c -o blake3.o gcc -I"/usr/share/R/include" -DNDEBUG -I. -fpic -g -O2 -fno-omit-frame-pointer -mno-omit-leaf-frame-pointer -ffile-prefix-map=/build/r-base-EawLoD/r-base-4.4.1=. -fstack-protector-strong -fstack-clash-protection -Wformat -Werror=format-security -fcf-protection -fdebug-prefix-map=/build/r-base-EawLoD/r-base-4.4.1=/usr/src/r-base-4.4.1-1.2404.0 -Wdate-time -D_FORTIFY_SOURCE=3 -c blake3_dispatch.c -o blake3_dispatch.o gcc -I"/usr/share/R/include" -DNDEBUG -I. -fpic -g -O2 -fno-omit-frame-pointer -mno-omit-leaf-frame-pointer -ffile-prefix-map=/build/r-base-EawLoD/r-base-4.4.1=. -fstack-protector-strong -fstack-clash-protection -Wformat -Werror=format-security -fcf-protection -fdebug-prefix-map=/build/r-base-EawLoD/r-base-4.4.1=/usr/src/r-base-4.4.1-1.2404.0 -Wdate-time -D_FORTIFY_SOURCE=3 -c blake3_portable.c -o blake3_portable.o gcc -I"/usr/share/R/include" -DNDEBUG -I. -fpic -g -O2 -fno-omit-frame-pointer -mno-omit-leaf-frame-pointer -ffile-prefix-map=/build/r-base-EawLoD/r-base-4.4.1=. -fstack-protector-strong -fstack-clash-protection -Wformat -Werror=format-security -fcf-protection -fdebug-prefix-map=/build/r-base-EawLoD/r-base-4.4.1=/usr/src/r-base-4.4.1-1.2404.0 -Wdate-time -D_FORTIFY_SOURCE=3 -c crc32.c -o crc32.o g++ -std=gnu++17 -I"/usr/share/R/include" -DNDEBUG -I. -fpic -g -O2 -fno-omit-frame-pointer -mno-omit-leaf-frame-pointer -ffile-prefix-map=/build/r-base-EawLoD/r-base-4.4.1=. -fstack-protector-strong -fstack-clash-protection -Wformat -Werror=format-security -fcf-protection -fdebug-prefix-map=/build/r-base-EawLoD/r-base-4.4.1=/usr/src/r-base-4.4.1-1.2404.0 -Wdate-time -D_FORTIFY_SOURCE=3 -c crc32c.cpp -o crc32c.o g++ -std=gnu++17 -I"/usr/share/R/include" -DNDEBUG -I. -fpic -g -O2 -fno-omit-frame-pointer -mno-omit-leaf-frame-pointer -ffile-prefix-map=/build/r-base-EawLoD/r-base-4.4.1=. -fstack-protector-strong -fstack-clash-protection -Wformat -Werror=format-security -fcf-protection -fdebug-prefix-map=/build/r-base-EawLoD/r-base-4.4.1=/usr/src/r-base-4.4.1-1.2404.0 -Wdate-time -D_FORTIFY_SOURCE=3 -c crc32c_portable.cpp -o crc32c_portable.o gcc -I"/usr/share/R/include" -DNDEBUG -I. -fpic -g -O2 -fno-omit-frame-pointer -mno-omit-leaf-frame-pointer -ffile-prefix-map=/build/r-base-EawLoD/r-base-4.4.1=. -fstack-protector-strong -fstack-clash-protection -Wformat -Werror=format-security -fcf-protection -fdebug-prefix-map=/build/r-base-EawLoD/r-base-4.4.1=/usr/src/r-base-4.4.1-1.2404.0 -Wdate-time -D_FORTIFY_SOURCE=3 -c digest.c -o digest.o gcc -I"/usr/share/R/include" -DNDEBUG -I. -fpic -g -O2 -fno-omit-frame-pointer -mno-omit-leaf-frame-pointer -ffile-prefix-map=/build/r-base-EawLoD/r-base-4.4.1=. -fstack-protector-strong -fstack-clash-protection -Wformat -Werror=format-security -fcf-protection -fdebug-prefix-map=/build/r-base-EawLoD/r-base-4.4.1=/usr/src/r-base-4.4.1-1.2404.0 -Wdate-time -D_FORTIFY_SOURCE=3 -c digest2int.c -o digest2int.o gcc -I"/usr/share/R/include" -DNDEBUG -I. -fpic -g -O2 -fno-omit-frame-pointer -mno-omit-leaf-frame-pointer -ffile-prefix-map=/build/r-base-EawLoD/r-base-4.4.1=. -fstack-protector-strong -fstack-clash-protection -Wformat -Werror=format-security -fcf-protection -fdebug-prefix-map=/build/r-base-EawLoD/r-base-4.4.1=/usr/src/r-base-4.4.1-1.2404.0 -Wdate-time -D_FORTIFY_SOURCE=3 -c init.c -o init.o gcc -I"/usr/share/R/include" -DNDEBUG -I. -fpic -g -O2 -fno-omit-frame-pointer -mno-omit-leaf-frame-pointer -ffile-prefix-map=/build/r-base-EawLoD/r-base-4.4.1=. -fstack-protector-strong -fstack-clash-protection -Wformat -Werror=format-security -fcf-protection -fdebug-prefix-map=/build/r-base-EawLoD/r-base-4.4.1=/usr/src/r-base-4.4.1-1.2404.0 -Wdate-time -D_FORTIFY_SOURCE=3 -c md5.c -o md5.o gcc -I"/usr/share/R/include" -DNDEBUG -I. -fpic -g -O2 -fno-omit-frame-pointer -mno-omit-leaf-frame-pointer -ffile-prefix-map=/build/r-base-EawLoD/r-base-4.4.1=. -fstack-protector-strong -fstack-clash-protection -Wformat -Werror=format-security -fcf-protection -fdebug-prefix-map=/build/r-base-EawLoD/r-base-4.4.1=/usr/src/r-base-4.4.1-1.2404.0 -Wdate-time -D_FORTIFY_SOURCE=3 -c pmurhash.c -o pmurhash.o gcc -I"/usr/share/R/include" -DNDEBUG -I. -fpic -g -O2 -fno-omit-frame-pointer -mno-omit-leaf-frame-pointer -ffile-prefix-map=/build/r-base-EawLoD/r-base-4.4.1=. -fstack-protector-strong -fstack-clash-protection -Wformat -Werror=format-security -fcf-protection -fdebug-prefix-map=/build/r-base-EawLoD/r-base-4.4.1=/usr/src/r-base-4.4.1-1.2404.0 -Wdate-time -D_FORTIFY_SOURCE=3 -c raes.c -o raes.o gcc -I"/usr/share/R/include" -DNDEBUG -I. -fpic -g -O2 -fno-omit-frame-pointer -mno-omit-leaf-frame-pointer -ffile-prefix-map=/build/r-base-EawLoD/r-base-4.4.1=. -fstack-protector-strong -fstack-clash-protection -Wformat -Werror=format-security -fcf-protection -fdebug-prefix-map=/build/r-base-EawLoD/r-base-4.4.1=/usr/src/r-base-4.4.1-1.2404.0 -Wdate-time -D_FORTIFY_SOURCE=3 -c sha1.c -o sha1.o gcc -I"/usr/share/R/include" -DNDEBUG -I. -fpic -g -O2 -fno-omit-frame-pointer -mno-omit-leaf-frame-pointer -ffile-prefix-map=/build/r-base-EawLoD/r-base-4.4.1=. -fstack-protector-strong -fstack-clash-protection -Wformat -Werror=format-security -fcf-protection -fdebug-prefix-map=/build/r-base-EawLoD/r-base-4.4.1=/usr/src/r-base-4.4.1-1.2404.0 -Wdate-time -D_FORTIFY_SOURCE=3 -c sha2.c -o sha2.o gcc -I"/usr/share/R/include" -DNDEBUG -I. -fpic -g -O2 -fno-omit-frame-pointer -mno-omit-leaf-frame-pointer -ffile-prefix-map=/build/r-base-EawLoD/r-base-4.4.1=. -fstack-protector-strong -fstack-clash-protection -Wformat -Werror=format-security -fcf-protection -fdebug-prefix-map=/build/r-base-EawLoD/r-base-4.4.1=/usr/src/r-base-4.4.1-1.2404.0 -Wdate-time -D_FORTIFY_SOURCE=3 -c sha256.c -o sha256.o g++ -std=gnu++17 -I"/usr/share/R/include" -DNDEBUG -I. -fpic -g -O2 -fno-omit-frame-pointer -mno-omit-leaf-frame-pointer -ffile-prefix-map=/build/r-base-EawLoD/r-base-4.4.1=. -fstack-protector-strong -fstack-clash-protection -Wformat -Werror=format-security -fcf-protection -fdebug-prefix-map=/build/r-base-EawLoD/r-base-4.4.1=/usr/src/r-base-4.4.1-1.2404.0 -Wdate-time -D_FORTIFY_SOURCE=3 -c spooky_serialize.cpp -o spooky_serialize.o gcc -I"/usr/share/R/include" -DNDEBUG -I. -fpic -g -O2 -fno-omit-frame-pointer -mno-omit-leaf-frame-pointer -ffile-prefix-map=/build/r-base-EawLoD/r-base-4.4.1=. -fstack-protector-strong -fstack-clash-protection -Wformat -Werror=format-security -fcf-protection -fdebug-prefix-map=/build/r-base-EawLoD/r-base-4.4.1=/usr/src/r-base-4.4.1-1.2404.0 -Wdate-time -D_FORTIFY_SOURCE=3 -c xxhash.c -o xxhash.o g++ -std=gnu++17 -shared -L/usr/lib/R/lib -Wl,-Bsymbolic-functions -flto=auto -ffat-lto-objects -Wl,-z,relro -o digest.so SpookyV2.o aes.o blake3.o blake3_dispatch.o blake3_portable.o crc32.o crc32c.o crc32c_portable.o digest.o digest2int.o init.o md5.o pmurhash.o raes.o sha1.o sha2.o sha256.o spooky_serialize.o xxhash.o -L/usr/lib/R/lib -lR installing to /home/omnipath/local/R/4.4-3.20/00LOCK-digest/00new/digest/libs ** R ** demo ** inst ** byte-compile and prepare package for lazy loading ** help *** installing help indices ** building package indices ** installing vignettes ** testing if installed package can be loaded from temporary location ** checking absolute paths in shared objects and dynamic libraries ** testing if installed package can be loaded from final location ** testing if installed package keeps a record of temporary installation path * DONE (digest) * installing *source* package ‘base64enc’ ... ** package ‘base64enc’ successfully unpacked and MD5 sums checked ** using staged installation ** libs using C compiler: ‘gcc (Ubuntu 13.2.0-23ubuntu4) 13.2.0’ gcc -I"/usr/share/R/include" -DNDEBUG -fpic -g -O2 -fno-omit-frame-pointer -mno-omit-leaf-frame-pointer -ffile-prefix-map=/build/r-base-EawLoD/r-base-4.4.1=. -fstack-protector-strong -fstack-clash-protection -Wformat -Werror=format-security -fcf-protection -fdebug-prefix-map=/build/r-base-EawLoD/r-base-4.4.1=/usr/src/r-base-4.4.1-1.2404.0 -Wdate-time -D_FORTIFY_SOURCE=3 -c base64.c -o base64.o gcc -I"/usr/share/R/include" -DNDEBUG -fpic -g -O2 -fno-omit-frame-pointer -mno-omit-leaf-frame-pointer -ffile-prefix-map=/build/r-base-EawLoD/r-base-4.4.1=. -fstack-protector-strong -fstack-clash-protection -Wformat -Werror=format-security -fcf-protection -fdebug-prefix-map=/build/r-base-EawLoD/r-base-4.4.1=/usr/src/r-base-4.4.1-1.2404.0 -Wdate-time -D_FORTIFY_SOURCE=3 -c uriencode.c -o uriencode.o gcc -I"/usr/share/R/include" -DNDEBUG -fpic -g -O2 -fno-omit-frame-pointer -mno-omit-leaf-frame-pointer -ffile-prefix-map=/build/r-base-EawLoD/r-base-4.4.1=. -fstack-protector-strong -fstack-clash-protection -Wformat -Werror=format-security -fcf-protection -fdebug-prefix-map=/build/r-base-EawLoD/r-base-4.4.1=/usr/src/r-base-4.4.1-1.2404.0 -Wdate-time -D_FORTIFY_SOURCE=3 -c utf8.c -o utf8.o gcc -shared -L/usr/lib/R/lib -Wl,-Bsymbolic-functions -flto=auto -ffat-lto-objects -Wl,-z,relro -o base64enc.so base64.o uriencode.o utf8.o -L/usr/lib/R/lib -lR installing to /home/omnipath/local/R/4.4-3.20/00LOCK-base64enc/00new/base64enc/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 (base64enc) * installing *source* package ‘tinytex’ ... ** package ‘tinytex’ 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 (tinytex) * installing *source* package ‘backports’ ... ** package ‘backports’ successfully unpacked and MD5 sums checked ** using staged installation ** libs using C compiler: ‘gcc (Ubuntu 13.2.0-23ubuntu4) 13.2.0’ gcc -I"/usr/share/R/include" -DNDEBUG -fpic -g -O2 -fno-omit-frame-pointer -mno-omit-leaf-frame-pointer -ffile-prefix-map=/build/r-base-EawLoD/r-base-4.4.1=. -fstack-protector-strong -fstack-clash-protection -Wformat -Werror=format-security -fcf-protection -fdebug-prefix-map=/build/r-base-EawLoD/r-base-4.4.1=/usr/src/r-base-4.4.1-1.2404.0 -Wdate-time -D_FORTIFY_SOURCE=3 -c dotsElt.c -o dotsElt.o gcc -I"/usr/share/R/include" -DNDEBUG -fpic -g -O2 -fno-omit-frame-pointer -mno-omit-leaf-frame-pointer -ffile-prefix-map=/build/r-base-EawLoD/r-base-4.4.1=. -fstack-protector-strong -fstack-clash-protection -Wformat -Werror=format-security -fcf-protection -fdebug-prefix-map=/build/r-base-EawLoD/r-base-4.4.1=/usr/src/r-base-4.4.1-1.2404.0 -Wdate-time -D_FORTIFY_SOURCE=3 -c dotsLength.c -o dotsLength.o gcc -I"/usr/share/R/include" -DNDEBUG -fpic -g -O2 -fno-omit-frame-pointer -mno-omit-leaf-frame-pointer -ffile-prefix-map=/build/r-base-EawLoD/r-base-4.4.1=. -fstack-protector-strong -fstack-clash-protection -Wformat -Werror=format-security -fcf-protection -fdebug-prefix-map=/build/r-base-EawLoD/r-base-4.4.1=/usr/src/r-base-4.4.1-1.2404.0 -Wdate-time -D_FORTIFY_SOURCE=3 -c dotsNames.c -o dotsNames.o gcc -I"/usr/share/R/include" -DNDEBUG -fpic -g -O2 -fno-omit-frame-pointer -mno-omit-leaf-frame-pointer -ffile-prefix-map=/build/r-base-EawLoD/r-base-4.4.1=. -fstack-protector-strong -fstack-clash-protection -Wformat -Werror=format-security -fcf-protection -fdebug-prefix-map=/build/r-base-EawLoD/r-base-4.4.1=/usr/src/r-base-4.4.1-1.2404.0 -Wdate-time -D_FORTIFY_SOURCE=3 -c init.c -o init.o gcc -shared -L/usr/lib/R/lib -Wl,-Bsymbolic-functions -flto=auto -ffat-lto-objects -Wl,-z,relro -o backports.so dotsElt.o dotsLength.o dotsNames.o init.o -L/usr/lib/R/lib -lR installing to /home/omnipath/local/R/4.4-3.20/00LOCK-backports/00new/backports/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 (backports) * installing *source* package ‘timechange’ ... ** package ‘timechange’ successfully unpacked and MD5 sums checked ** using staged installation ** libs using C compiler: ‘gcc (Ubuntu 13.2.0-23ubuntu4) 13.2.0’ using C++ compiler: ‘g++ (Ubuntu 13.2.0-23ubuntu4) 13.2.0’ g++ -std=gnu++17 -I"/usr/share/R/include" -DNDEBUG -I. -I./cctz/src/ -I'/home/omnipath/local/R/4.4-3.20/cpp11/include' -fpic -g -O2 -fno-omit-frame-pointer -mno-omit-leaf-frame-pointer -ffile-prefix-map=/build/r-base-EawLoD/r-base-4.4.1=. -fstack-protector-strong -fstack-clash-protection -Wformat -Werror=format-security -fcf-protection -fdebug-prefix-map=/build/r-base-EawLoD/r-base-4.4.1=/usr/src/r-base-4.4.1-1.2404.0 -Wdate-time -D_FORTIFY_SOURCE=3 -c common.cpp -o common.o g++ -std=gnu++17 -I"/usr/share/R/include" -DNDEBUG -I. -I./cctz/src/ -I'/home/omnipath/local/R/4.4-3.20/cpp11/include' -fpic -g -O2 -fno-omit-frame-pointer -mno-omit-leaf-frame-pointer -ffile-prefix-map=/build/r-base-EawLoD/r-base-4.4.1=. -fstack-protector-strong -fstack-clash-protection -Wformat -Werror=format-security -fcf-protection -fdebug-prefix-map=/build/r-base-EawLoD/r-base-4.4.1=/usr/src/r-base-4.4.1-1.2404.0 -Wdate-time -D_FORTIFY_SOURCE=3 -c cpp11.cpp -o cpp11.o g++ -std=gnu++17 -I"/usr/share/R/include" -DNDEBUG -I. -I./cctz/src/ -I'/home/omnipath/local/R/4.4-3.20/cpp11/include' -fpic -g -O2 -fno-omit-frame-pointer -mno-omit-leaf-frame-pointer -ffile-prefix-map=/build/r-base-EawLoD/r-base-4.4.1=. -fstack-protector-strong -fstack-clash-protection -Wformat -Werror=format-security -fcf-protection -fdebug-prefix-map=/build/r-base-EawLoD/r-base-4.4.1=/usr/src/r-base-4.4.1-1.2404.0 -Wdate-time -D_FORTIFY_SOURCE=3 -c get.cpp -o get.o gcc -I"/usr/share/R/include" -DNDEBUG -I. -I./cctz/src/ -I'/home/omnipath/local/R/4.4-3.20/cpp11/include' -fpic -g -O2 -fno-omit-frame-pointer -mno-omit-leaf-frame-pointer -ffile-prefix-map=/build/r-base-EawLoD/r-base-4.4.1=. -fstack-protector-strong -fstack-clash-protection -Wformat -Werror=format-security -fcf-protection -fdebug-prefix-map=/build/r-base-EawLoD/r-base-4.4.1=/usr/src/r-base-4.4.1-1.2404.0 -Wdate-time -D_FORTIFY_SOURCE=3 -c parse.c -o parse.o g++ -std=gnu++17 -I"/usr/share/R/include" -DNDEBUG -I. -I./cctz/src/ -I'/home/omnipath/local/R/4.4-3.20/cpp11/include' -fpic -g -O2 -fno-omit-frame-pointer -mno-omit-leaf-frame-pointer -ffile-prefix-map=/build/r-base-EawLoD/r-base-4.4.1=. -fstack-protector-strong -fstack-clash-protection -Wformat -Werror=format-security -fcf-protection -fdebug-prefix-map=/build/r-base-EawLoD/r-base-4.4.1=/usr/src/r-base-4.4.1-1.2404.0 -Wdate-time -D_FORTIFY_SOURCE=3 -c round.cpp -o round.o g++ -std=gnu++17 -I"/usr/share/R/include" -DNDEBUG -I. -I./cctz/src/ -I'/home/omnipath/local/R/4.4-3.20/cpp11/include' -fpic -g -O2 -fno-omit-frame-pointer -mno-omit-leaf-frame-pointer -ffile-prefix-map=/build/r-base-EawLoD/r-base-4.4.1=. -fstack-protector-strong -fstack-clash-protection -Wformat -Werror=format-security -fcf-protection -fdebug-prefix-map=/build/r-base-EawLoD/r-base-4.4.1=/usr/src/r-base-4.4.1-1.2404.0 -Wdate-time -D_FORTIFY_SOURCE=3 -c tzone.cpp -o tzone.o g++ -std=gnu++17 -I"/usr/share/R/include" -DNDEBUG -I. -I./cctz/src/ -I'/home/omnipath/local/R/4.4-3.20/cpp11/include' -fpic -g -O2 -fno-omit-frame-pointer -mno-omit-leaf-frame-pointer -ffile-prefix-map=/build/r-base-EawLoD/r-base-4.4.1=. -fstack-protector-strong -fstack-clash-protection -Wformat -Werror=format-security -fcf-protection -fdebug-prefix-map=/build/r-base-EawLoD/r-base-4.4.1=/usr/src/r-base-4.4.1-1.2404.0 -Wdate-time -D_FORTIFY_SOURCE=3 -c update.cpp -o update.o g++ -std=gnu++17 -I"/usr/share/R/include" -DNDEBUG -I. -I./cctz/src/ -I'/home/omnipath/local/R/4.4-3.20/cpp11/include' -fpic -g -O2 -fno-omit-frame-pointer -mno-omit-leaf-frame-pointer -ffile-prefix-map=/build/r-base-EawLoD/r-base-4.4.1=. -fstack-protector-strong -fstack-clash-protection -Wformat -Werror=format-security -fcf-protection -fdebug-prefix-map=/build/r-base-EawLoD/r-base-4.4.1=/usr/src/r-base-4.4.1-1.2404.0 -Wdate-time -D_FORTIFY_SOURCE=3 -c cctz/src/time_zone_fixed.cc -o cctz/src/time_zone_fixed.o g++ -std=gnu++17 -I"/usr/share/R/include" -DNDEBUG -I. -I./cctz/src/ -I'/home/omnipath/local/R/4.4-3.20/cpp11/include' -fpic -g -O2 -fno-omit-frame-pointer -mno-omit-leaf-frame-pointer -ffile-prefix-map=/build/r-base-EawLoD/r-base-4.4.1=. -fstack-protector-strong -fstack-clash-protection -Wformat -Werror=format-security -fcf-protection -fdebug-prefix-map=/build/r-base-EawLoD/r-base-4.4.1=/usr/src/r-base-4.4.1-1.2404.0 -Wdate-time -D_FORTIFY_SOURCE=3 -c cctz/src/time_zone_if.cc -o cctz/src/time_zone_if.o g++ -std=gnu++17 -I"/usr/share/R/include" -DNDEBUG -I. -I./cctz/src/ -I'/home/omnipath/local/R/4.4-3.20/cpp11/include' -fpic -g -O2 -fno-omit-frame-pointer -mno-omit-leaf-frame-pointer -ffile-prefix-map=/build/r-base-EawLoD/r-base-4.4.1=. -fstack-protector-strong -fstack-clash-protection -Wformat -Werror=format-security -fcf-protection -fdebug-prefix-map=/build/r-base-EawLoD/r-base-4.4.1=/usr/src/r-base-4.4.1-1.2404.0 -Wdate-time -D_FORTIFY_SOURCE=3 -c cctz/src/time_zone_impl.cc -o cctz/src/time_zone_impl.o g++ -std=gnu++17 -I"/usr/share/R/include" -DNDEBUG -I. -I./cctz/src/ -I'/home/omnipath/local/R/4.4-3.20/cpp11/include' -fpic -g -O2 -fno-omit-frame-pointer -mno-omit-leaf-frame-pointer -ffile-prefix-map=/build/r-base-EawLoD/r-base-4.4.1=. -fstack-protector-strong -fstack-clash-protection -Wformat -Werror=format-security -fcf-protection -fdebug-prefix-map=/build/r-base-EawLoD/r-base-4.4.1=/usr/src/r-base-4.4.1-1.2404.0 -Wdate-time -D_FORTIFY_SOURCE=3 -c cctz/src/time_zone_info.cc -o cctz/src/time_zone_info.o g++ -std=gnu++17 -I"/usr/share/R/include" -DNDEBUG -I. -I./cctz/src/ -I'/home/omnipath/local/R/4.4-3.20/cpp11/include' -fpic -g -O2 -fno-omit-frame-pointer -mno-omit-leaf-frame-pointer -ffile-prefix-map=/build/r-base-EawLoD/r-base-4.4.1=. -fstack-protector-strong -fstack-clash-protection -Wformat -Werror=format-security -fcf-protection -fdebug-prefix-map=/build/r-base-EawLoD/r-base-4.4.1=/usr/src/r-base-4.4.1-1.2404.0 -Wdate-time -D_FORTIFY_SOURCE=3 -c cctz/src/time_zone_libc.cc -o cctz/src/time_zone_libc.o g++ -std=gnu++17 -I"/usr/share/R/include" -DNDEBUG -I. -I./cctz/src/ -I'/home/omnipath/local/R/4.4-3.20/cpp11/include' -fpic -g -O2 -fno-omit-frame-pointer -mno-omit-leaf-frame-pointer -ffile-prefix-map=/build/r-base-EawLoD/r-base-4.4.1=. -fstack-protector-strong -fstack-clash-protection -Wformat -Werror=format-security -fcf-protection -fdebug-prefix-map=/build/r-base-EawLoD/r-base-4.4.1=/usr/src/r-base-4.4.1-1.2404.0 -Wdate-time -D_FORTIFY_SOURCE=3 -c cctz/src/time_zone_lookup.cc -o cctz/src/time_zone_lookup.o g++ -std=gnu++17 -I"/usr/share/R/include" -DNDEBUG -I. -I./cctz/src/ -I'/home/omnipath/local/R/4.4-3.20/cpp11/include' -fpic -g -O2 -fno-omit-frame-pointer -mno-omit-leaf-frame-pointer -ffile-prefix-map=/build/r-base-EawLoD/r-base-4.4.1=. -fstack-protector-strong -fstack-clash-protection -Wformat -Werror=format-security -fcf-protection -fdebug-prefix-map=/build/r-base-EawLoD/r-base-4.4.1=/usr/src/r-base-4.4.1-1.2404.0 -Wdate-time -D_FORTIFY_SOURCE=3 -c cctz/src/time_zone_posix.cc -o cctz/src/time_zone_posix.o g++ -std=gnu++17 -I"/usr/share/R/include" -DNDEBUG -I. -I./cctz/src/ -I'/home/omnipath/local/R/4.4-3.20/cpp11/include' -fpic -g -O2 -fno-omit-frame-pointer -mno-omit-leaf-frame-pointer -ffile-prefix-map=/build/r-base-EawLoD/r-base-4.4.1=. -fstack-protector-strong -fstack-clash-protection -Wformat -Werror=format-security -fcf-protection -fdebug-prefix-map=/build/r-base-EawLoD/r-base-4.4.1=/usr/src/r-base-4.4.1-1.2404.0 -Wdate-time -D_FORTIFY_SOURCE=3 -c cctz/src/zone_info_source.cc -o cctz/src/zone_info_source.o ar rcs libcctz.a ./cctz/src/time_zone_fixed.o ./cctz/src/time_zone_if.o ./cctz/src/time_zone_impl.o ./cctz/src/time_zone_info.o ./cctz/src/time_zone_libc.o ./cctz/src/time_zone_lookup.o ./cctz/src/time_zone_posix.o ./cctz/src/zone_info_source.o g++ -std=gnu++17 -shared -L/usr/lib/R/lib -Wl,-Bsymbolic-functions -flto=auto -ffat-lto-objects -Wl,-z,relro -o timechange.so common.o cpp11.o get.o parse.o round.o tzone.o update.o -L. -lcctz -L/usr/lib/R/lib -lR installing to /home/omnipath/local/R/4.4-3.20/00LOCK-timechange/00new/timechange/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 (timechange) * installing *source* package ‘Rcpp’ ... ** package ‘Rcpp’ successfully unpacked and MD5 sums checked ** using staged installation ** libs using C++ compiler: ‘g++ (Ubuntu 13.2.0-23ubuntu4) 13.2.0’ g++ -std=gnu++17 -I"/usr/share/R/include" -DNDEBUG -I../inst/include/ -fpic -g -O2 -fno-omit-frame-pointer -mno-omit-leaf-frame-pointer -ffile-prefix-map=/build/r-base-EawLoD/r-base-4.4.1=. -fstack-protector-strong -fstack-clash-protection -Wformat -Werror=format-security -fcf-protection -fdebug-prefix-map=/build/r-base-EawLoD/r-base-4.4.1=/usr/src/r-base-4.4.1-1.2404.0 -Wdate-time -D_FORTIFY_SOURCE=3 -c api.cpp -o api.o g++ -std=gnu++17 -I"/usr/share/R/include" -DNDEBUG -I../inst/include/ -fpic -g -O2 -fno-omit-frame-pointer -mno-omit-leaf-frame-pointer -ffile-prefix-map=/build/r-base-EawLoD/r-base-4.4.1=. -fstack-protector-strong -fstack-clash-protection -Wformat -Werror=format-security -fcf-protection -fdebug-prefix-map=/build/r-base-EawLoD/r-base-4.4.1=/usr/src/r-base-4.4.1-1.2404.0 -Wdate-time -D_FORTIFY_SOURCE=3 -c attributes.cpp -o attributes.o g++ -std=gnu++17 -I"/usr/share/R/include" -DNDEBUG -I../inst/include/ -fpic -g -O2 -fno-omit-frame-pointer -mno-omit-leaf-frame-pointer -ffile-prefix-map=/build/r-base-EawLoD/r-base-4.4.1=. -fstack-protector-strong -fstack-clash-protection -Wformat -Werror=format-security -fcf-protection -fdebug-prefix-map=/build/r-base-EawLoD/r-base-4.4.1=/usr/src/r-base-4.4.1-1.2404.0 -Wdate-time -D_FORTIFY_SOURCE=3 -c barrier.cpp -o barrier.o g++ -std=gnu++17 -I"/usr/share/R/include" -DNDEBUG -I../inst/include/ -fpic -g -O2 -fno-omit-frame-pointer -mno-omit-leaf-frame-pointer -ffile-prefix-map=/build/r-base-EawLoD/r-base-4.4.1=. -fstack-protector-strong -fstack-clash-protection -Wformat -Werror=format-security -fcf-protection -fdebug-prefix-map=/build/r-base-EawLoD/r-base-4.4.1=/usr/src/r-base-4.4.1-1.2404.0 -Wdate-time -D_FORTIFY_SOURCE=3 -c date.cpp -o date.o g++ -std=gnu++17 -I"/usr/share/R/include" -DNDEBUG -I../inst/include/ -fpic -g -O2 -fno-omit-frame-pointer -mno-omit-leaf-frame-pointer -ffile-prefix-map=/build/r-base-EawLoD/r-base-4.4.1=. -fstack-protector-strong -fstack-clash-protection -Wformat -Werror=format-security -fcf-protection -fdebug-prefix-map=/build/r-base-EawLoD/r-base-4.4.1=/usr/src/r-base-4.4.1-1.2404.0 -Wdate-time -D_FORTIFY_SOURCE=3 -c module.cpp -o module.o g++ -std=gnu++17 -I"/usr/share/R/include" -DNDEBUG -I../inst/include/ -fpic -g -O2 -fno-omit-frame-pointer -mno-omit-leaf-frame-pointer -ffile-prefix-map=/build/r-base-EawLoD/r-base-4.4.1=. -fstack-protector-strong -fstack-clash-protection -Wformat -Werror=format-security -fcf-protection -fdebug-prefix-map=/build/r-base-EawLoD/r-base-4.4.1=/usr/src/r-base-4.4.1-1.2404.0 -Wdate-time -D_FORTIFY_SOURCE=3 -c rcpp_init.cpp -o rcpp_init.o g++ -std=gnu++17 -shared -L/usr/lib/R/lib -Wl,-Bsymbolic-functions -flto=auto -ffat-lto-objects -Wl,-z,relro -o Rcpp.so api.o attributes.o barrier.o date.o module.o rcpp_init.o -L/usr/lib/R/lib -lR installing to /home/omnipath/local/R/4.4-3.20/00LOCK-Rcpp/00new/Rcpp/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 (Rcpp) * installing *source* package ‘prettyunits’ ... ** package ‘prettyunits’ 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 (prettyunits) * installing *source* package ‘tzdb’ ... ** package ‘tzdb’ successfully unpacked and MD5 sums checked ** using staged installation ** libs using C++ compiler: ‘g++ (Ubuntu 13.2.0-23ubuntu4) 13.2.0’ g++ -std=gnu++17 -I"/usr/share/R/include" -DNDEBUG -I'/home/omnipath/local/R/4.4-3.20/cpp11/include' -I../inst/include -DINSTALL=dummy -DAUTO_DOWNLOAD=0 -DHAS_REMOTE_API=0 -DUSE_OS_TZDB=0 -DONLY_C_LOCALE=1 -fpic -g -O2 -fno-omit-frame-pointer -mno-omit-leaf-frame-pointer -ffile-prefix-map=/build/r-base-EawLoD/r-base-4.4.1=. -fstack-protector-strong -fstack-clash-protection -Wformat -Werror=format-security -fcf-protection -fdebug-prefix-map=/build/r-base-EawLoD/r-base-4.4.1=/usr/src/r-base-4.4.1-1.2404.0 -Wdate-time -D_FORTIFY_SOURCE=3 -c api.cpp -o api.o g++ -std=gnu++17 -I"/usr/share/R/include" -DNDEBUG -I'/home/omnipath/local/R/4.4-3.20/cpp11/include' -I../inst/include -DINSTALL=dummy -DAUTO_DOWNLOAD=0 -DHAS_REMOTE_API=0 -DUSE_OS_TZDB=0 -DONLY_C_LOCALE=1 -fpic -g -O2 -fno-omit-frame-pointer -mno-omit-leaf-frame-pointer -ffile-prefix-map=/build/r-base-EawLoD/r-base-4.4.1=. -fstack-protector-strong -fstack-clash-protection -Wformat -Werror=format-security -fcf-protection -fdebug-prefix-map=/build/r-base-EawLoD/r-base-4.4.1=/usr/src/r-base-4.4.1-1.2404.0 -Wdate-time -D_FORTIFY_SOURCE=3 -c cpp11.cpp -o cpp11.o g++ -std=gnu++17 -I"/usr/share/R/include" -DNDEBUG -I'/home/omnipath/local/R/4.4-3.20/cpp11/include' -I../inst/include -DINSTALL=dummy -DAUTO_DOWNLOAD=0 -DHAS_REMOTE_API=0 -DUSE_OS_TZDB=0 -DONLY_C_LOCALE=1 -fpic -g -O2 -fno-omit-frame-pointer -mno-omit-leaf-frame-pointer -ffile-prefix-map=/build/r-base-EawLoD/r-base-4.4.1=. -fstack-protector-strong -fstack-clash-protection -Wformat -Werror=format-security -fcf-protection -fdebug-prefix-map=/build/r-base-EawLoD/r-base-4.4.1=/usr/src/r-base-4.4.1-1.2404.0 -Wdate-time -D_FORTIFY_SOURCE=3 -c names.cpp -o names.o g++ -std=gnu++17 -I"/usr/share/R/include" -DNDEBUG -I'/home/omnipath/local/R/4.4-3.20/cpp11/include' -I../inst/include -DINSTALL=dummy -DAUTO_DOWNLOAD=0 -DHAS_REMOTE_API=0 -DUSE_OS_TZDB=0 -DONLY_C_LOCALE=1 -fpic -g -O2 -fno-omit-frame-pointer -mno-omit-leaf-frame-pointer -ffile-prefix-map=/build/r-base-EawLoD/r-base-4.4.1=. -fstack-protector-strong -fstack-clash-protection -Wformat -Werror=format-security -fcf-protection -fdebug-prefix-map=/build/r-base-EawLoD/r-base-4.4.1=/usr/src/r-base-4.4.1-1.2404.0 -Wdate-time -D_FORTIFY_SOURCE=3 -c path.cpp -o path.o g++ -std=gnu++17 -I"/usr/share/R/include" -DNDEBUG -I'/home/omnipath/local/R/4.4-3.20/cpp11/include' -I../inst/include -DINSTALL=dummy -DAUTO_DOWNLOAD=0 -DHAS_REMOTE_API=0 -DUSE_OS_TZDB=0 -DONLY_C_LOCALE=1 -fpic -g -O2 -fno-omit-frame-pointer -mno-omit-leaf-frame-pointer -ffile-prefix-map=/build/r-base-EawLoD/r-base-4.4.1=. -fstack-protector-strong -fstack-clash-protection -Wformat -Werror=format-security -fcf-protection -fdebug-prefix-map=/build/r-base-EawLoD/r-base-4.4.1=/usr/src/r-base-4.4.1-1.2404.0 -Wdate-time -D_FORTIFY_SOURCE=3 -c tz.cpp -o tz.o g++ -std=gnu++17 -I"/usr/share/R/include" -DNDEBUG -I'/home/omnipath/local/R/4.4-3.20/cpp11/include' -I../inst/include -DINSTALL=dummy -DAUTO_DOWNLOAD=0 -DHAS_REMOTE_API=0 -DUSE_OS_TZDB=0 -DONLY_C_LOCALE=1 -fpic -g -O2 -fno-omit-frame-pointer -mno-omit-leaf-frame-pointer -ffile-prefix-map=/build/r-base-EawLoD/r-base-4.4.1=. -fstack-protector-strong -fstack-clash-protection -Wformat -Werror=format-security -fcf-protection -fdebug-prefix-map=/build/r-base-EawLoD/r-base-4.4.1=/usr/src/r-base-4.4.1-1.2404.0 -Wdate-time -D_FORTIFY_SOURCE=3 -c version.cpp -o version.o g++ -std=gnu++17 -shared -L/usr/lib/R/lib -Wl,-Bsymbolic-functions -flto=auto -ffat-lto-objects -Wl,-z,relro -o tzdb.so api.o cpp11.o names.o path.o tz.o version.o -L/usr/lib/R/lib -lR installing to /home/omnipath/local/R/4.4-3.20/00LOCK-tzdb/00new/tzdb/libs ** R ** inst ** byte-compile and prepare package for lazy loading ** help *** installing help indices ** building package indices ** testing if installed package can be loaded from temporary location ** checking absolute paths in shared objects and dynamic libraries ** testing if installed package can be loaded from final location ** testing if installed package keeps a record of temporary installation path * DONE (tzdb) * installing *source* package ‘hms’ ... ** package ‘hms’ 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 (hms) * installing *source* package ‘praise’ ... ** package ‘praise’ 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 (praise) * installing *source* package ‘brio’ ... ** package ‘brio’ successfully unpacked and MD5 sums checked ** using staged installation ** libs using C compiler: ‘gcc (Ubuntu 13.2.0-23ubuntu4) 13.2.0’ gcc -I"/usr/share/R/include" -DNDEBUG -fpic -g -O2 -fno-omit-frame-pointer -mno-omit-leaf-frame-pointer -ffile-prefix-map=/build/r-base-EawLoD/r-base-4.4.1=. -fstack-protector-strong -fstack-clash-protection -Wformat -Werror=format-security -fcf-protection -fdebug-prefix-map=/build/r-base-EawLoD/r-base-4.4.1=/usr/src/r-base-4.4.1-1.2404.0 -Wdate-time -D_FORTIFY_SOURCE=3 -c brio.c -o brio.o gcc -I"/usr/share/R/include" -DNDEBUG -fpic -g -O2 -fno-omit-frame-pointer -mno-omit-leaf-frame-pointer -ffile-prefix-map=/build/r-base-EawLoD/r-base-4.4.1=. -fstack-protector-strong -fstack-clash-protection -Wformat -Werror=format-security -fcf-protection -fdebug-prefix-map=/build/r-base-EawLoD/r-base-4.4.1=/usr/src/r-base-4.4.1-1.2404.0 -Wdate-time -D_FORTIFY_SOURCE=3 -c file_line_endings.c -o file_line_endings.o gcc -I"/usr/share/R/include" -DNDEBUG -fpic -g -O2 -fno-omit-frame-pointer -mno-omit-leaf-frame-pointer -ffile-prefix-map=/build/r-base-EawLoD/r-base-4.4.1=. -fstack-protector-strong -fstack-clash-protection -Wformat -Werror=format-security -fcf-protection -fdebug-prefix-map=/build/r-base-EawLoD/r-base-4.4.1=/usr/src/r-base-4.4.1-1.2404.0 -Wdate-time -D_FORTIFY_SOURCE=3 -c init.c -o init.o gcc -I"/usr/share/R/include" -DNDEBUG -fpic -g -O2 -fno-omit-frame-pointer -mno-omit-leaf-frame-pointer -ffile-prefix-map=/build/r-base-EawLoD/r-base-4.4.1=. -fstack-protector-strong -fstack-clash-protection -Wformat -Werror=format-security -fcf-protection -fdebug-prefix-map=/build/r-base-EawLoD/r-base-4.4.1=/usr/src/r-base-4.4.1-1.2404.0 -Wdate-time -D_FORTIFY_SOURCE=3 -c read_file.c -o read_file.o gcc -I"/usr/share/R/include" -DNDEBUG -fpic -g -O2 -fno-omit-frame-pointer -mno-omit-leaf-frame-pointer -ffile-prefix-map=/build/r-base-EawLoD/r-base-4.4.1=. -fstack-protector-strong -fstack-clash-protection -Wformat -Werror=format-security -fcf-protection -fdebug-prefix-map=/build/r-base-EawLoD/r-base-4.4.1=/usr/src/r-base-4.4.1-1.2404.0 -Wdate-time -D_FORTIFY_SOURCE=3 -c read_file_raw.c -o read_file_raw.o gcc -I"/usr/share/R/include" -DNDEBUG -fpic -g -O2 -fno-omit-frame-pointer -mno-omit-leaf-frame-pointer -ffile-prefix-map=/build/r-base-EawLoD/r-base-4.4.1=. -fstack-protector-strong -fstack-clash-protection -Wformat -Werror=format-security -fcf-protection -fdebug-prefix-map=/build/r-base-EawLoD/r-base-4.4.1=/usr/src/r-base-4.4.1-1.2404.0 -Wdate-time -D_FORTIFY_SOURCE=3 -c read_lines.c -o read_lines.o gcc -I"/usr/share/R/include" -DNDEBUG -fpic -g -O2 -fno-omit-frame-pointer -mno-omit-leaf-frame-pointer -ffile-prefix-map=/build/r-base-EawLoD/r-base-4.4.1=. -fstack-protector-strong -fstack-clash-protection -Wformat -Werror=format-security -fcf-protection -fdebug-prefix-map=/build/r-base-EawLoD/r-base-4.4.1=/usr/src/r-base-4.4.1-1.2404.0 -Wdate-time -D_FORTIFY_SOURCE=3 -c write_file.c -o write_file.o gcc -I"/usr/share/R/include" -DNDEBUG -fpic -g -O2 -fno-omit-frame-pointer -mno-omit-leaf-frame-pointer -ffile-prefix-map=/build/r-base-EawLoD/r-base-4.4.1=. -fstack-protector-strong -fstack-clash-protection -Wformat -Werror=format-security -fcf-protection -fdebug-prefix-map=/build/r-base-EawLoD/r-base-4.4.1=/usr/src/r-base-4.4.1-1.2404.0 -Wdate-time -D_FORTIFY_SOURCE=3 -c write_file_raw.c -o write_file_raw.o gcc -I"/usr/share/R/include" -DNDEBUG -fpic -g -O2 -fno-omit-frame-pointer -mno-omit-leaf-frame-pointer -ffile-prefix-map=/build/r-base-EawLoD/r-base-4.4.1=. -fstack-protector-strong -fstack-clash-protection -Wformat -Werror=format-security -fcf-protection -fdebug-prefix-map=/build/r-base-EawLoD/r-base-4.4.1=/usr/src/r-base-4.4.1-1.2404.0 -Wdate-time -D_FORTIFY_SOURCE=3 -c write_lines.c -o write_lines.o gcc -shared -L/usr/lib/R/lib -Wl,-Bsymbolic-functions -flto=auto -ffat-lto-objects -Wl,-z,relro -o brio.so brio.o file_line_endings.o init.o read_file.o read_file_raw.o read_lines.o write_file.o write_file_raw.o write_lines.o -L/usr/lib/R/lib -lR installing to /home/omnipath/local/R/4.4-3.20/00LOCK-brio/00new/brio/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 (brio) * installing *source* package ‘clipr’ ... ** package ‘clipr’ successfully unpacked and MD5 sums checked ** using staged installation ** R ** inst ** byte-compile and prepare package for lazy loading ** help *** installing help indices ** building package indices ** installing vignettes ** testing if installed package can be loaded from temporary location ** testing if installed package can be loaded from final location ** testing if installed package keeps a record of temporary installation path * DONE (clipr) * installing *source* package ‘sessioninfo’ ... ** package ‘sessioninfo’ 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 (sessioninfo) * installing *source* package ‘rjson’ ... ** package ‘rjson’ successfully unpacked and MD5 sums checked ** using staged installation ** libs using C compiler: ‘gcc (Ubuntu 13.2.0-23ubuntu4) 13.2.0’ using C++ compiler: ‘g++ (Ubuntu 13.2.0-23ubuntu4) 13.2.0’ g++ -std=gnu++17 -I"/usr/share/R/include" -DNDEBUG -fpic -g -O2 -fno-omit-frame-pointer -mno-omit-leaf-frame-pointer -ffile-prefix-map=/build/r-base-EawLoD/r-base-4.4.1=. -fstack-protector-strong -fstack-clash-protection -Wformat -Werror=format-security -fcf-protection -fdebug-prefix-map=/build/r-base-EawLoD/r-base-4.4.1=/usr/src/r-base-4.4.1-1.2404.0 -Wdate-time -D_FORTIFY_SOURCE=3 -c dump.cpp -o dump.o gcc -I"/usr/share/R/include" -DNDEBUG -fpic -g -O2 -fno-omit-frame-pointer -mno-omit-leaf-frame-pointer -ffile-prefix-map=/build/r-base-EawLoD/r-base-4.4.1=. -fstack-protector-strong -fstack-clash-protection -Wformat -Werror=format-security -fcf-protection -fdebug-prefix-map=/build/r-base-EawLoD/r-base-4.4.1=/usr/src/r-base-4.4.1-1.2404.0 -Wdate-time -D_FORTIFY_SOURCE=3 -c parser.c -o parser.o gcc -I"/usr/share/R/include" -DNDEBUG -fpic -g -O2 -fno-omit-frame-pointer -mno-omit-leaf-frame-pointer -ffile-prefix-map=/build/r-base-EawLoD/r-base-4.4.1=. -fstack-protector-strong -fstack-clash-protection -Wformat -Werror=format-security -fcf-protection -fdebug-prefix-map=/build/r-base-EawLoD/r-base-4.4.1=/usr/src/r-base-4.4.1-1.2404.0 -Wdate-time -D_FORTIFY_SOURCE=3 -c register.c -o register.o g++ -std=gnu++17 -shared -L/usr/lib/R/lib -Wl,-Bsymbolic-functions -flto=auto -ffat-lto-objects -Wl,-z,relro -o rjson.so dump.o parser.o register.o -L/usr/lib/R/lib -lR installing to /home/omnipath/local/R/4.4-3.20/00LOCK-rjson/00new/rjson/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 (rjson) * installing *source* package ‘igraph’ ... ** package ‘igraph’ successfully unpacked and MD5 sums checked ** using staged installation libxml2 include directories: -I/usr/include/libxml2 libxml2 library link flags: -lxml2 Using installed GLPK ** libs using C compiler: ‘gcc (Ubuntu 13.2.0-23ubuntu4) 13.2.0’ using C++ compiler: ‘g++ (Ubuntu 13.2.0-23ubuntu4) 13.2.0’ g++ -std=gnu++17 -I"/usr/share/R/include" -DNDEBUG -DUSING_R -I. -Ivendor -Ivendor/cigraph/src -Ivendor/cigraph/include -Ivendor/cigraph/vendor -Ivendor/io/parsers -I/usr/include/libxml2 -DHAVE_LIBXML -DNDEBUG -DNTIMER -DNPRINT -DIGRAPH_THREAD_LOCAL= -DPRPACK_IGRAPH_SUPPORT -DHAVE_GFORTRAN=1 -D_GNU_SOURCE=1 -I'/home/omnipath/local/R/4.4-3.20/cpp11/include' -fvisibility=hidden -fpic -g -O2 -fno-omit-frame-pointer -mno-omit-leaf-frame-pointer -ffile-prefix-map=/build/r-base-EawLoD/r-base-4.4.1=. -fstack-protector-strong -fstack-clash-protection -Wformat -Werror=format-security -fcf-protection -fdebug-prefix-map=/build/r-base-EawLoD/r-base-4.4.1=/usr/src/r-base-4.4.1-1.2404.0 -Wdate-time -D_FORTIFY_SOURCE=3 -c cpp11.cpp -o cpp11.o g++ -std=gnu++17 -I"/usr/share/R/include" -DNDEBUG -DUSING_R -I. -Ivendor -Ivendor/cigraph/src -Ivendor/cigraph/include -Ivendor/cigraph/vendor -Ivendor/io/parsers -I/usr/include/libxml2 -DHAVE_LIBXML -DNDEBUG -DNTIMER -DNPRINT -DIGRAPH_THREAD_LOCAL= -DPRPACK_IGRAPH_SUPPORT -DHAVE_GFORTRAN=1 -D_GNU_SOURCE=1 -I'/home/omnipath/local/R/4.4-3.20/cpp11/include' -fvisibility=hidden -fpic -g -O2 -fno-omit-frame-pointer -mno-omit-leaf-frame-pointer -ffile-prefix-map=/build/r-base-EawLoD/r-base-4.4.1=. -fstack-protector-strong -fstack-clash-protection -Wformat -Werror=format-security -fcf-protection -fdebug-prefix-map=/build/r-base-EawLoD/r-base-4.4.1=/usr/src/r-base-4.4.1-1.2404.0 -Wdate-time -D_FORTIFY_SOURCE=3 -c cpprinterface.cpp -o cpprinterface.o g++ -std=gnu++17 -I"/usr/share/R/include" -DNDEBUG -DUSING_R -I. -Ivendor -Ivendor/cigraph/src -Ivendor/cigraph/include -Ivendor/cigraph/vendor -Ivendor/io/parsers -I/usr/include/libxml2 -DHAVE_LIBXML -DNDEBUG -DNTIMER -DNPRINT -DIGRAPH_THREAD_LOCAL= -DPRPACK_IGRAPH_SUPPORT -DHAVE_GFORTRAN=1 -D_GNU_SOURCE=1 -I'/home/omnipath/local/R/4.4-3.20/cpp11/include' -fvisibility=hidden -fpic -g -O2 -fno-omit-frame-pointer -mno-omit-leaf-frame-pointer -ffile-prefix-map=/build/r-base-EawLoD/r-base-4.4.1=. -fstack-protector-strong -fstack-clash-protection -Wformat -Werror=format-security -fcf-protection -fdebug-prefix-map=/build/r-base-EawLoD/r-base-4.4.1=/usr/src/r-base-4.4.1-1.2404.0 -Wdate-time -D_FORTIFY_SOURCE=3 -c init.cpp -o init.o gcc -I"/usr/share/R/include" -DNDEBUG -DUSING_R -I. -Ivendor -Ivendor/cigraph/src -Ivendor/cigraph/include -Ivendor/cigraph/vendor -Ivendor/io/parsers -I/usr/include/libxml2 -DHAVE_LIBXML -DNDEBUG -DNTIMER -DNPRINT -DIGRAPH_THREAD_LOCAL= -DPRPACK_IGRAPH_SUPPORT -DHAVE_GFORTRAN=1 -D_GNU_SOURCE=1 -I'/home/omnipath/local/R/4.4-3.20/cpp11/include' -fvisibility=hidden -fpic -g -O2 -fno-omit-frame-pointer -mno-omit-leaf-frame-pointer -ffile-prefix-map=/build/r-base-EawLoD/r-base-4.4.1=. -fstack-protector-strong -fstack-clash-protection -Wformat -Werror=format-security -fcf-protection -fdebug-prefix-map=/build/r-base-EawLoD/r-base-4.4.1=/usr/src/r-base-4.4.1-1.2404.0 -Wdate-time -D_FORTIFY_SOURCE=3 -c lazyeval.c -o lazyeval.o gcc -I"/usr/share/R/include" -DNDEBUG -DUSING_R -I. -Ivendor -Ivendor/cigraph/src -Ivendor/cigraph/include -Ivendor/cigraph/vendor -Ivendor/io/parsers -I/usr/include/libxml2 -DHAVE_LIBXML -DNDEBUG -DNTIMER -DNPRINT -DIGRAPH_THREAD_LOCAL= -DPRPACK_IGRAPH_SUPPORT -DHAVE_GFORTRAN=1 -D_GNU_SOURCE=1 -I'/home/omnipath/local/R/4.4-3.20/cpp11/include' -fvisibility=hidden -fpic -g -O2 -fno-omit-frame-pointer -mno-omit-leaf-frame-pointer -ffile-prefix-map=/build/r-base-EawLoD/r-base-4.4.1=. -fstack-protector-strong -fstack-clash-protection -Wformat -Werror=format-security -fcf-protection -fdebug-prefix-map=/build/r-base-EawLoD/r-base-4.4.1=/usr/src/r-base-4.4.1-1.2404.0 -Wdate-time -D_FORTIFY_SOURCE=3 -c rinterface.c -o rinterface.o gcc -I"/usr/share/R/include" -DNDEBUG -DUSING_R -I. -Ivendor -Ivendor/cigraph/src -Ivendor/cigraph/include -Ivendor/cigraph/vendor -Ivendor/io/parsers -I/usr/include/libxml2 -DHAVE_LIBXML -DNDEBUG -DNTIMER -DNPRINT -DIGRAPH_THREAD_LOCAL= -DPRPACK_IGRAPH_SUPPORT -DHAVE_GFORTRAN=1 -D_GNU_SOURCE=1 -I'/home/omnipath/local/R/4.4-3.20/cpp11/include' -fvisibility=hidden -fpic -g -O2 -fno-omit-frame-pointer -mno-omit-leaf-frame-pointer -ffile-prefix-map=/build/r-base-EawLoD/r-base-4.4.1=. -fstack-protector-strong -fstack-clash-protection -Wformat -Werror=format-security -fcf-protection -fdebug-prefix-map=/build/r-base-EawLoD/r-base-4.4.1=/usr/src/r-base-4.4.1-1.2404.0 -Wdate-time -D_FORTIFY_SOURCE=3 -c rinterface_extra.c -o rinterface_extra.o gcc -I"/usr/share/R/include" -DNDEBUG -DUSING_R -I. -Ivendor -Ivendor/cigraph/src -Ivendor/cigraph/include -Ivendor/cigraph/vendor -Ivendor/io/parsers -I/usr/include/libxml2 -DHAVE_LIBXML -DNDEBUG -DNTIMER -DNPRINT -DIGRAPH_THREAD_LOCAL= -DPRPACK_IGRAPH_SUPPORT -DHAVE_GFORTRAN=1 -D_GNU_SOURCE=1 -I'/home/omnipath/local/R/4.4-3.20/cpp11/include' -fvisibility=hidden -fpic -g -O2 -fno-omit-frame-pointer -mno-omit-leaf-frame-pointer -ffile-prefix-map=/build/r-base-EawLoD/r-base-4.4.1=. -fstack-protector-strong -fstack-clash-protection -Wformat -Werror=format-security -fcf-protection -fdebug-prefix-map=/build/r-base-EawLoD/r-base-4.4.1=/usr/src/r-base-4.4.1-1.2404.0 -Wdate-time -D_FORTIFY_SOURCE=3 -c rrandom.c -o rrandom.o g++ -std=gnu++17 -I"/usr/share/R/include" -DNDEBUG -DUSING_R -I. -Ivendor -Ivendor/cigraph/src -Ivendor/cigraph/include -Ivendor/cigraph/vendor -Ivendor/io/parsers -I/usr/include/libxml2 -DHAVE_LIBXML -DNDEBUG -DNTIMER -DNPRINT -DIGRAPH_THREAD_LOCAL= -DPRPACK_IGRAPH_SUPPORT -DHAVE_GFORTRAN=1 -D_GNU_SOURCE=1 -I'/home/omnipath/local/R/4.4-3.20/cpp11/include' -fvisibility=hidden -fpic -g -O2 -fno-omit-frame-pointer -mno-omit-leaf-frame-pointer -ffile-prefix-map=/build/r-base-EawLoD/r-base-4.4.1=. -fstack-protector-strong -fstack-clash-protection -Wformat -Werror=format-security -fcf-protection -fdebug-prefix-map=/build/r-base-EawLoD/r-base-4.4.1=/usr/src/r-base-4.4.1-1.2404.0 -Wdate-time -D_FORTIFY_SOURCE=3 -c simpleraytracer.cpp -o simpleraytracer.o gfortran -fvisibility=hidden -fpic -g -O2 -fno-omit-frame-pointer -mno-omit-leaf-frame-pointer -ffile-prefix-map=/build/r-base-EawLoD/r-base-4.4.1=. -fstack-protector-strong -fstack-clash-protection -fcf-protection -fdebug-prefix-map=/build/r-base-EawLoD/r-base-4.4.1=/usr/src/r-base-4.4.1-1.2404.0 -c vendor/arpack/dgetv0.f -o vendor/arpack/dgetv0.o gfortran -fvisibility=hidden -fpic -g -O2 -fno-omit-frame-pointer -mno-omit-leaf-frame-pointer -ffile-prefix-map=/build/r-base-EawLoD/r-base-4.4.1=. -fstack-protector-strong -fstack-clash-protection -fcf-protection -fdebug-prefix-map=/build/r-base-EawLoD/r-base-4.4.1=/usr/src/r-base-4.4.1-1.2404.0 -c vendor/arpack/dlaqrb.f -o vendor/arpack/dlaqrb.o gfortran -fvisibility=hidden -fpic -g -O2 -fno-omit-frame-pointer -mno-omit-leaf-frame-pointer -ffile-prefix-map=/build/r-base-EawLoD/r-base-4.4.1=. -fstack-protector-strong -fstack-clash-protection -fcf-protection -fdebug-prefix-map=/build/r-base-EawLoD/r-base-4.4.1=/usr/src/r-base-4.4.1-1.2404.0 -c vendor/arpack/dmout.f -o vendor/arpack/dmout.o gfortran -fvisibility=hidden -fpic -g -O2 -fno-omit-frame-pointer -mno-omit-leaf-frame-pointer -ffile-prefix-map=/build/r-base-EawLoD/r-base-4.4.1=. -fstack-protector-strong -fstack-clash-protection -fcf-protection -fdebug-prefix-map=/build/r-base-EawLoD/r-base-4.4.1=/usr/src/r-base-4.4.1-1.2404.0 -c vendor/arpack/dnaitr.f -o vendor/arpack/dnaitr.o gfortran -fvisibility=hidden -fpic -g -O2 -fno-omit-frame-pointer -mno-omit-leaf-frame-pointer -ffile-prefix-map=/build/r-base-EawLoD/r-base-4.4.1=. -fstack-protector-strong -fstack-clash-protection -fcf-protection -fdebug-prefix-map=/build/r-base-EawLoD/r-base-4.4.1=/usr/src/r-base-4.4.1-1.2404.0 -c vendor/arpack/dnapps.f -o vendor/arpack/dnapps.o gfortran -fvisibility=hidden -fpic -g -O2 -fno-omit-frame-pointer -mno-omit-leaf-frame-pointer -ffile-prefix-map=/build/r-base-EawLoD/r-base-4.4.1=. -fstack-protector-strong -fstack-clash-protection -fcf-protection -fdebug-prefix-map=/build/r-base-EawLoD/r-base-4.4.1=/usr/src/r-base-4.4.1-1.2404.0 -c vendor/arpack/dnaup2.f -o vendor/arpack/dnaup2.o gfortran -fvisibility=hidden -fpic -g -O2 -fno-omit-frame-pointer -mno-omit-leaf-frame-pointer -ffile-prefix-map=/build/r-base-EawLoD/r-base-4.4.1=. -fstack-protector-strong -fstack-clash-protection -fcf-protection -fdebug-prefix-map=/build/r-base-EawLoD/r-base-4.4.1=/usr/src/r-base-4.4.1-1.2404.0 -c vendor/arpack/dnaupd.f -o vendor/arpack/dnaupd.o gfortran -fvisibility=hidden -fpic -g -O2 -fno-omit-frame-pointer -mno-omit-leaf-frame-pointer -ffile-prefix-map=/build/r-base-EawLoD/r-base-4.4.1=. -fstack-protector-strong -fstack-clash-protection -fcf-protection -fdebug-prefix-map=/build/r-base-EawLoD/r-base-4.4.1=/usr/src/r-base-4.4.1-1.2404.0 -c vendor/arpack/dnconv.f -o vendor/arpack/dnconv.o gfortran -fvisibility=hidden -fpic -g -O2 -fno-omit-frame-pointer -mno-omit-leaf-frame-pointer -ffile-prefix-map=/build/r-base-EawLoD/r-base-4.4.1=. -fstack-protector-strong -fstack-clash-protection -fcf-protection -fdebug-prefix-map=/build/r-base-EawLoD/r-base-4.4.1=/usr/src/r-base-4.4.1-1.2404.0 -c vendor/arpack/dneigh.f -o vendor/arpack/dneigh.o gfortran -fvisibility=hidden -fpic -g -O2 -fno-omit-frame-pointer -mno-omit-leaf-frame-pointer -ffile-prefix-map=/build/r-base-EawLoD/r-base-4.4.1=. -fstack-protector-strong -fstack-clash-protection -fcf-protection -fdebug-prefix-map=/build/r-base-EawLoD/r-base-4.4.1=/usr/src/r-base-4.4.1-1.2404.0 -c vendor/arpack/dneupd.f -o vendor/arpack/dneupd.o gfortran -fvisibility=hidden -fpic -g -O2 -fno-omit-frame-pointer -mno-omit-leaf-frame-pointer -ffile-prefix-map=/build/r-base-EawLoD/r-base-4.4.1=. -fstack-protector-strong -fstack-clash-protection -fcf-protection -fdebug-prefix-map=/build/r-base-EawLoD/r-base-4.4.1=/usr/src/r-base-4.4.1-1.2404.0 -c vendor/arpack/dngets.f -o vendor/arpack/dngets.o gfortran -fvisibility=hidden -fpic -g -O2 -fno-omit-frame-pointer -mno-omit-leaf-frame-pointer -ffile-prefix-map=/build/r-base-EawLoD/r-base-4.4.1=. -fstack-protector-strong -fstack-clash-protection -fcf-protection -fdebug-prefix-map=/build/r-base-EawLoD/r-base-4.4.1=/usr/src/r-base-4.4.1-1.2404.0 -c vendor/arpack/dsaitr.f -o vendor/arpack/dsaitr.o gfortran -fvisibility=hidden -fpic -g -O2 -fno-omit-frame-pointer -mno-omit-leaf-frame-pointer -ffile-prefix-map=/build/r-base-EawLoD/r-base-4.4.1=. -fstack-protector-strong -fstack-clash-protection -fcf-protection -fdebug-prefix-map=/build/r-base-EawLoD/r-base-4.4.1=/usr/src/r-base-4.4.1-1.2404.0 -c vendor/arpack/dsapps.f -o vendor/arpack/dsapps.o gfortran -fvisibility=hidden -fpic -g -O2 -fno-omit-frame-pointer -mno-omit-leaf-frame-pointer -ffile-prefix-map=/build/r-base-EawLoD/r-base-4.4.1=. -fstack-protector-strong -fstack-clash-protection -fcf-protection -fdebug-prefix-map=/build/r-base-EawLoD/r-base-4.4.1=/usr/src/r-base-4.4.1-1.2404.0 -c vendor/arpack/dsaup2.f -o vendor/arpack/dsaup2.o gfortran -fvisibility=hidden -fpic -g -O2 -fno-omit-frame-pointer -mno-omit-leaf-frame-pointer -ffile-prefix-map=/build/r-base-EawLoD/r-base-4.4.1=. -fstack-protector-strong -fstack-clash-protection -fcf-protection -fdebug-prefix-map=/build/r-base-EawLoD/r-base-4.4.1=/usr/src/r-base-4.4.1-1.2404.0 -c vendor/arpack/dsaupd.f -o vendor/arpack/dsaupd.o gfortran -fvisibility=hidden -fpic -g -O2 -fno-omit-frame-pointer -mno-omit-leaf-frame-pointer -ffile-prefix-map=/build/r-base-EawLoD/r-base-4.4.1=. -fstack-protector-strong -fstack-clash-protection -fcf-protection -fdebug-prefix-map=/build/r-base-EawLoD/r-base-4.4.1=/usr/src/r-base-4.4.1-1.2404.0 -c vendor/arpack/dsconv.f -o vendor/arpack/dsconv.o gfortran -fvisibility=hidden -fpic -g -O2 -fno-omit-frame-pointer -mno-omit-leaf-frame-pointer -ffile-prefix-map=/build/r-base-EawLoD/r-base-4.4.1=. -fstack-protector-strong -fstack-clash-protection -fcf-protection -fdebug-prefix-map=/build/r-base-EawLoD/r-base-4.4.1=/usr/src/r-base-4.4.1-1.2404.0 -c vendor/arpack/dseigt.f -o vendor/arpack/dseigt.o gfortran -fvisibility=hidden -fpic -g -O2 -fno-omit-frame-pointer -mno-omit-leaf-frame-pointer -ffile-prefix-map=/build/r-base-EawLoD/r-base-4.4.1=. -fstack-protector-strong -fstack-clash-protection -fcf-protection -fdebug-prefix-map=/build/r-base-EawLoD/r-base-4.4.1=/usr/src/r-base-4.4.1-1.2404.0 -c vendor/arpack/dsesrt.f -o vendor/arpack/dsesrt.o gfortran -fvisibility=hidden -fpic -g -O2 -fno-omit-frame-pointer -mno-omit-leaf-frame-pointer -ffile-prefix-map=/build/r-base-EawLoD/r-base-4.4.1=. -fstack-protector-strong -fstack-clash-protection -fcf-protection -fdebug-prefix-map=/build/r-base-EawLoD/r-base-4.4.1=/usr/src/r-base-4.4.1-1.2404.0 -c vendor/arpack/dseupd.f -o vendor/arpack/dseupd.o gfortran -fvisibility=hidden -fpic -g -O2 -fno-omit-frame-pointer -mno-omit-leaf-frame-pointer -ffile-prefix-map=/build/r-base-EawLoD/r-base-4.4.1=. -fstack-protector-strong -fstack-clash-protection -fcf-protection -fdebug-prefix-map=/build/r-base-EawLoD/r-base-4.4.1=/usr/src/r-base-4.4.1-1.2404.0 -c vendor/arpack/dsgets.f -o vendor/arpack/dsgets.o gfortran -fvisibility=hidden -fpic -g -O2 -fno-omit-frame-pointer -mno-omit-leaf-frame-pointer -ffile-prefix-map=/build/r-base-EawLoD/r-base-4.4.1=. -fstack-protector-strong -fstack-clash-protection -fcf-protection -fdebug-prefix-map=/build/r-base-EawLoD/r-base-4.4.1=/usr/src/r-base-4.4.1-1.2404.0 -c vendor/arpack/dsortc.f -o vendor/arpack/dsortc.o gfortran -fvisibility=hidden -fpic -g -O2 -fno-omit-frame-pointer -mno-omit-leaf-frame-pointer -ffile-prefix-map=/build/r-base-EawLoD/r-base-4.4.1=. -fstack-protector-strong -fstack-clash-protection -fcf-protection -fdebug-prefix-map=/build/r-base-EawLoD/r-base-4.4.1=/usr/src/r-base-4.4.1-1.2404.0 -c vendor/arpack/dsortr.f -o vendor/arpack/dsortr.o gfortran -fvisibility=hidden -fpic -g -O2 -fno-omit-frame-pointer -mno-omit-leaf-frame-pointer -ffile-prefix-map=/build/r-base-EawLoD/r-base-4.4.1=. -fstack-protector-strong -fstack-clash-protection -fcf-protection -fdebug-prefix-map=/build/r-base-EawLoD/r-base-4.4.1=/usr/src/r-base-4.4.1-1.2404.0 -c vendor/arpack/dstatn.f -o vendor/arpack/dstatn.o gfortran -fvisibility=hidden -fpic -g -O2 -fno-omit-frame-pointer -mno-omit-leaf-frame-pointer -ffile-prefix-map=/build/r-base-EawLoD/r-base-4.4.1=. -fstack-protector-strong -fstack-clash-protection -fcf-protection -fdebug-prefix-map=/build/r-base-EawLoD/r-base-4.4.1=/usr/src/r-base-4.4.1-1.2404.0 -c vendor/arpack/dstats.f -o vendor/arpack/dstats.o gfortran -fvisibility=hidden -fpic -g -O2 -fno-omit-frame-pointer -mno-omit-leaf-frame-pointer -ffile-prefix-map=/build/r-base-EawLoD/r-base-4.4.1=. -fstack-protector-strong -fstack-clash-protection -fcf-protection -fdebug-prefix-map=/build/r-base-EawLoD/r-base-4.4.1=/usr/src/r-base-4.4.1-1.2404.0 -c vendor/arpack/dstqrb.f -o vendor/arpack/dstqrb.o gfortran -fvisibility=hidden -fpic -g -O2 -fno-omit-frame-pointer -mno-omit-leaf-frame-pointer -ffile-prefix-map=/build/r-base-EawLoD/r-base-4.4.1=. -fstack-protector-strong -fstack-clash-protection -fcf-protection -fdebug-prefix-map=/build/r-base-EawLoD/r-base-4.4.1=/usr/src/r-base-4.4.1-1.2404.0 -c vendor/arpack/dvout.f -o vendor/arpack/dvout.o gfortran -fvisibility=hidden -fpic -g -O2 -fno-omit-frame-pointer -mno-omit-leaf-frame-pointer -ffile-prefix-map=/build/r-base-EawLoD/r-base-4.4.1=. -fstack-protector-strong -fstack-clash-protection -fcf-protection -fdebug-prefix-map=/build/r-base-EawLoD/r-base-4.4.1=/usr/src/r-base-4.4.1-1.2404.0 -c vendor/arpack/ivout.f -o vendor/arpack/ivout.o gfortran -fvisibility=hidden -fpic -g -O2 -fno-omit-frame-pointer -mno-omit-leaf-frame-pointer -ffile-prefix-map=/build/r-base-EawLoD/r-base-4.4.1=. -fstack-protector-strong -fstack-clash-protection -fcf-protection -fdebug-prefix-map=/build/r-base-EawLoD/r-base-4.4.1=/usr/src/r-base-4.4.1-1.2404.0 -c vendor/arpack/second.f -o vendor/arpack/second.o gfortran -fvisibility=hidden -fpic -g -O2 -fno-omit-frame-pointer -mno-omit-leaf-frame-pointer -ffile-prefix-map=/build/r-base-EawLoD/r-base-4.4.1=. -fstack-protector-strong -fstack-clash-protection -fcf-protection -fdebug-prefix-map=/build/r-base-EawLoD/r-base-4.4.1=/usr/src/r-base-4.4.1-1.2404.0 -c vendor/arpack/wrap.f -o vendor/arpack/wrap.o gcc -I"/usr/share/R/include" -DNDEBUG -DUSING_R -I. -Ivendor -Ivendor/cigraph/src -Ivendor/cigraph/include -Ivendor/cigraph/vendor -Ivendor/io/parsers -I/usr/include/libxml2 -DHAVE_LIBXML -DNDEBUG -DNTIMER -DNPRINT -DIGRAPH_THREAD_LOCAL= -DPRPACK_IGRAPH_SUPPORT -DHAVE_GFORTRAN=1 -D_GNU_SOURCE=1 -I'/home/omnipath/local/R/4.4-3.20/cpp11/include' -fvisibility=hidden -fpic -g -O2 -fno-omit-frame-pointer -mno-omit-leaf-frame-pointer -ffile-prefix-map=/build/r-base-EawLoD/r-base-4.4.1=. -fstack-protector-strong -fstack-clash-protection -Wformat -Werror=format-security -fcf-protection -fdebug-prefix-map=/build/r-base-EawLoD/r-base-4.4.1=/usr/src/r-base-4.4.1-1.2404.0 -Wdate-time -D_FORTIFY_SOURCE=3 -c vendor/cigraph/src/centrality/betweenness.c -o vendor/cigraph/src/centrality/betweenness.o gcc -I"/usr/share/R/include" -DNDEBUG -DUSING_R -I. -Ivendor -Ivendor/cigraph/src -Ivendor/cigraph/include -Ivendor/cigraph/vendor -Ivendor/io/parsers -I/usr/include/libxml2 -DHAVE_LIBXML -DNDEBUG -DNTIMER -DNPRINT -DIGRAPH_THREAD_LOCAL= -DPRPACK_IGRAPH_SUPPORT -DHAVE_GFORTRAN=1 -D_GNU_SOURCE=1 -I'/home/omnipath/local/R/4.4-3.20/cpp11/include' -fvisibility=hidden -fpic -g -O2 -fno-omit-frame-pointer -mno-omit-leaf-frame-pointer -ffile-prefix-map=/build/r-base-EawLoD/r-base-4.4.1=. -fstack-protector-strong -fstack-clash-protection -Wformat -Werror=format-security -fcf-protection -fdebug-prefix-map=/build/r-base-EawLoD/r-base-4.4.1=/usr/src/r-base-4.4.1-1.2404.0 -Wdate-time -D_FORTIFY_SOURCE=3 -c vendor/cigraph/src/centrality/centrality_other.c -o vendor/cigraph/src/centrality/centrality_other.o gcc -I"/usr/share/R/include" -DNDEBUG -DUSING_R -I. -Ivendor -Ivendor/cigraph/src -Ivendor/cigraph/include -Ivendor/cigraph/vendor -Ivendor/io/parsers -I/usr/include/libxml2 -DHAVE_LIBXML -DNDEBUG -DNTIMER -DNPRINT -DIGRAPH_THREAD_LOCAL= -DPRPACK_IGRAPH_SUPPORT -DHAVE_GFORTRAN=1 -D_GNU_SOURCE=1 -I'/home/omnipath/local/R/4.4-3.20/cpp11/include' -fvisibility=hidden -fpic -g -O2 -fno-omit-frame-pointer -mno-omit-leaf-frame-pointer -ffile-prefix-map=/build/r-base-EawLoD/r-base-4.4.1=. -fstack-protector-strong -fstack-clash-protection -Wformat -Werror=format-security -fcf-protection -fdebug-prefix-map=/build/r-base-EawLoD/r-base-4.4.1=/usr/src/r-base-4.4.1-1.2404.0 -Wdate-time -D_FORTIFY_SOURCE=3 -c vendor/cigraph/src/centrality/centralization.c -o vendor/cigraph/src/centrality/centralization.o gcc -I"/usr/share/R/include" -DNDEBUG -DUSING_R -I. -Ivendor -Ivendor/cigraph/src -Ivendor/cigraph/include -Ivendor/cigraph/vendor -Ivendor/io/parsers -I/usr/include/libxml2 -DHAVE_LIBXML -DNDEBUG -DNTIMER -DNPRINT -DIGRAPH_THREAD_LOCAL= -DPRPACK_IGRAPH_SUPPORT -DHAVE_GFORTRAN=1 -D_GNU_SOURCE=1 -I'/home/omnipath/local/R/4.4-3.20/cpp11/include' -fvisibility=hidden -fpic -g -O2 -fno-omit-frame-pointer -mno-omit-leaf-frame-pointer -ffile-prefix-map=/build/r-base-EawLoD/r-base-4.4.1=. -fstack-protector-strong -fstack-clash-protection -Wformat -Werror=format-security -fcf-protection -fdebug-prefix-map=/build/r-base-EawLoD/r-base-4.4.1=/usr/src/r-base-4.4.1-1.2404.0 -Wdate-time -D_FORTIFY_SOURCE=3 -c vendor/cigraph/src/centrality/closeness.c -o vendor/cigraph/src/centrality/closeness.o gcc -I"/usr/share/R/include" -DNDEBUG -DUSING_R -I. -Ivendor -Ivendor/cigraph/src -Ivendor/cigraph/include -Ivendor/cigraph/vendor -Ivendor/io/parsers -I/usr/include/libxml2 -DHAVE_LIBXML -DNDEBUG -DNTIMER -DNPRINT -DIGRAPH_THREAD_LOCAL= -DPRPACK_IGRAPH_SUPPORT -DHAVE_GFORTRAN=1 -D_GNU_SOURCE=1 -I'/home/omnipath/local/R/4.4-3.20/cpp11/include' -fvisibility=hidden -fpic -g -O2 -fno-omit-frame-pointer -mno-omit-leaf-frame-pointer -ffile-prefix-map=/build/r-base-EawLoD/r-base-4.4.1=. -fstack-protector-strong -fstack-clash-protection -Wformat -Werror=format-security -fcf-protection -fdebug-prefix-map=/build/r-base-EawLoD/r-base-4.4.1=/usr/src/r-base-4.4.1-1.2404.0 -Wdate-time -D_FORTIFY_SOURCE=3 -c vendor/cigraph/src/centrality/coreness.c -o vendor/cigraph/src/centrality/coreness.o gcc -I"/usr/share/R/include" -DNDEBUG -DUSING_R -I. -Ivendor -Ivendor/cigraph/src -Ivendor/cigraph/include -Ivendor/cigraph/vendor -Ivendor/io/parsers -I/usr/include/libxml2 -DHAVE_LIBXML -DNDEBUG -DNTIMER -DNPRINT -DIGRAPH_THREAD_LOCAL= -DPRPACK_IGRAPH_SUPPORT -DHAVE_GFORTRAN=1 -D_GNU_SOURCE=1 -I'/home/omnipath/local/R/4.4-3.20/cpp11/include' -fvisibility=hidden -fpic -g -O2 -fno-omit-frame-pointer -mno-omit-leaf-frame-pointer -ffile-prefix-map=/build/r-base-EawLoD/r-base-4.4.1=. -fstack-protector-strong -fstack-clash-protection -Wformat -Werror=format-security -fcf-protection -fdebug-prefix-map=/build/r-base-EawLoD/r-base-4.4.1=/usr/src/r-base-4.4.1-1.2404.0 -Wdate-time -D_FORTIFY_SOURCE=3 -c vendor/cigraph/src/centrality/eigenvector.c -o vendor/cigraph/src/centrality/eigenvector.o gcc -I"/usr/share/R/include" -DNDEBUG -DUSING_R -I. -Ivendor -Ivendor/cigraph/src -Ivendor/cigraph/include -Ivendor/cigraph/vendor -Ivendor/io/parsers -I/usr/include/libxml2 -DHAVE_LIBXML -DNDEBUG -DNTIMER -DNPRINT -DIGRAPH_THREAD_LOCAL= -DPRPACK_IGRAPH_SUPPORT -DHAVE_GFORTRAN=1 -D_GNU_SOURCE=1 -I'/home/omnipath/local/R/4.4-3.20/cpp11/include' -fvisibility=hidden -fpic -g -O2 -fno-omit-frame-pointer -mno-omit-leaf-frame-pointer -ffile-prefix-map=/build/r-base-EawLoD/r-base-4.4.1=. -fstack-protector-strong -fstack-clash-protection -Wformat -Werror=format-security -fcf-protection -fdebug-prefix-map=/build/r-base-EawLoD/r-base-4.4.1=/usr/src/r-base-4.4.1-1.2404.0 -Wdate-time -D_FORTIFY_SOURCE=3 -c vendor/cigraph/src/centrality/hub_authority.c -o vendor/cigraph/src/centrality/hub_authority.o gcc -I"/usr/share/R/include" -DNDEBUG -DUSING_R -I. -Ivendor -Ivendor/cigraph/src -Ivendor/cigraph/include -Ivendor/cigraph/vendor -Ivendor/io/parsers -I/usr/include/libxml2 -DHAVE_LIBXML -DNDEBUG -DNTIMER -DNPRINT -DIGRAPH_THREAD_LOCAL= -DPRPACK_IGRAPH_SUPPORT -DHAVE_GFORTRAN=1 -D_GNU_SOURCE=1 -I'/home/omnipath/local/R/4.4-3.20/cpp11/include' -fvisibility=hidden -fpic -g -O2 -fno-omit-frame-pointer -mno-omit-leaf-frame-pointer -ffile-prefix-map=/build/r-base-EawLoD/r-base-4.4.1=. -fstack-protector-strong -fstack-clash-protection -Wformat -Werror=format-security -fcf-protection -fdebug-prefix-map=/build/r-base-EawLoD/r-base-4.4.1=/usr/src/r-base-4.4.1-1.2404.0 -Wdate-time -D_FORTIFY_SOURCE=3 -c vendor/cigraph/src/centrality/pagerank.c -o vendor/cigraph/src/centrality/pagerank.o g++ -std=gnu++17 -I"/usr/share/R/include" -DNDEBUG -DUSING_R -I. -Ivendor -Ivendor/cigraph/src -Ivendor/cigraph/include -Ivendor/cigraph/vendor -Ivendor/io/parsers -I/usr/include/libxml2 -DHAVE_LIBXML -DNDEBUG -DNTIMER -DNPRINT -DIGRAPH_THREAD_LOCAL= -DPRPACK_IGRAPH_SUPPORT -DHAVE_GFORTRAN=1 -D_GNU_SOURCE=1 -I'/home/omnipath/local/R/4.4-3.20/cpp11/include' -fvisibility=hidden -fpic -g -O2 -fno-omit-frame-pointer -mno-omit-leaf-frame-pointer -ffile-prefix-map=/build/r-base-EawLoD/r-base-4.4.1=. -fstack-protector-strong -fstack-clash-protection -Wformat -Werror=format-security -fcf-protection -fdebug-prefix-map=/build/r-base-EawLoD/r-base-4.4.1=/usr/src/r-base-4.4.1-1.2404.0 -Wdate-time -D_FORTIFY_SOURCE=3 -c vendor/cigraph/src/centrality/prpack.cpp -o vendor/cigraph/src/centrality/prpack.o g++ -std=gnu++17 -I"/usr/share/R/include" -DNDEBUG -DUSING_R -I. -Ivendor -Ivendor/cigraph/src -Ivendor/cigraph/include -Ivendor/cigraph/vendor -Ivendor/io/parsers -I/usr/include/libxml2 -DHAVE_LIBXML -DNDEBUG -DNTIMER -DNPRINT -DIGRAPH_THREAD_LOCAL= -DPRPACK_IGRAPH_SUPPORT -DHAVE_GFORTRAN=1 -D_GNU_SOURCE=1 -I'/home/omnipath/local/R/4.4-3.20/cpp11/include' -fvisibility=hidden -fpic -g -O2 -fno-omit-frame-pointer -mno-omit-leaf-frame-pointer -ffile-prefix-map=/build/r-base-EawLoD/r-base-4.4.1=. -fstack-protector-strong -fstack-clash-protection -Wformat -Werror=format-security -fcf-protection -fdebug-prefix-map=/build/r-base-EawLoD/r-base-4.4.1=/usr/src/r-base-4.4.1-1.2404.0 -Wdate-time -D_FORTIFY_SOURCE=3 -c vendor/cigraph/src/centrality/prpack/prpack_base_graph.cpp -o vendor/cigraph/src/centrality/prpack/prpack_base_graph.o g++ -std=gnu++17 -I"/usr/share/R/include" -DNDEBUG -DUSING_R -I. -Ivendor -Ivendor/cigraph/src -Ivendor/cigraph/include -Ivendor/cigraph/vendor -Ivendor/io/parsers -I/usr/include/libxml2 -DHAVE_LIBXML -DNDEBUG -DNTIMER -DNPRINT -DIGRAPH_THREAD_LOCAL= -DPRPACK_IGRAPH_SUPPORT -DHAVE_GFORTRAN=1 -D_GNU_SOURCE=1 -I'/home/omnipath/local/R/4.4-3.20/cpp11/include' -fvisibility=hidden -fpic -g -O2 -fno-omit-frame-pointer -mno-omit-leaf-frame-pointer -ffile-prefix-map=/build/r-base-EawLoD/r-base-4.4.1=. -fstack-protector-strong -fstack-clash-protection -Wformat -Werror=format-security -fcf-protection -fdebug-prefix-map=/build/r-base-EawLoD/r-base-4.4.1=/usr/src/r-base-4.4.1-1.2404.0 -Wdate-time -D_FORTIFY_SOURCE=3 -c vendor/cigraph/src/centrality/prpack/prpack_igraph_graph.cpp -o vendor/cigraph/src/centrality/prpack/prpack_igraph_graph.o g++ -std=gnu++17 -I"/usr/share/R/include" -DNDEBUG -DUSING_R -I. -Ivendor -Ivendor/cigraph/src -Ivendor/cigraph/include -Ivendor/cigraph/vendor -Ivendor/io/parsers -I/usr/include/libxml2 -DHAVE_LIBXML -DNDEBUG -DNTIMER -DNPRINT -DIGRAPH_THREAD_LOCAL= -DPRPACK_IGRAPH_SUPPORT -DHAVE_GFORTRAN=1 -D_GNU_SOURCE=1 -I'/home/omnipath/local/R/4.4-3.20/cpp11/include' -fvisibility=hidden -fpic -g -O2 -fno-omit-frame-pointer -mno-omit-leaf-frame-pointer -ffile-prefix-map=/build/r-base-EawLoD/r-base-4.4.1=. -fstack-protector-strong -fstack-clash-protection -Wformat -Werror=format-security -fcf-protection -fdebug-prefix-map=/build/r-base-EawLoD/r-base-4.4.1=/usr/src/r-base-4.4.1-1.2404.0 -Wdate-time -D_FORTIFY_SOURCE=3 -c vendor/cigraph/src/centrality/prpack/prpack_preprocessed_ge_graph.cpp -o vendor/cigraph/src/centrality/prpack/prpack_preprocessed_ge_graph.o g++ -std=gnu++17 -I"/usr/share/R/include" -DNDEBUG -DUSING_R -I. -Ivendor -Ivendor/cigraph/src -Ivendor/cigraph/include -Ivendor/cigraph/vendor -Ivendor/io/parsers -I/usr/include/libxml2 -DHAVE_LIBXML -DNDEBUG -DNTIMER -DNPRINT -DIGRAPH_THREAD_LOCAL= -DPRPACK_IGRAPH_SUPPORT -DHAVE_GFORTRAN=1 -D_GNU_SOURCE=1 -I'/home/omnipath/local/R/4.4-3.20/cpp11/include' -fvisibility=hidden -fpic -g -O2 -fno-omit-frame-pointer -mno-omit-leaf-frame-pointer -ffile-prefix-map=/build/r-base-EawLoD/r-base-4.4.1=. -fstack-protector-strong -fstack-clash-protection -Wformat -Werror=format-security -fcf-protection -fdebug-prefix-map=/build/r-base-EawLoD/r-base-4.4.1=/usr/src/r-base-4.4.1-1.2404.0 -Wdate-time -D_FORTIFY_SOURCE=3 -c vendor/cigraph/src/centrality/prpack/prpack_preprocessed_gs_graph.cpp -o vendor/cigraph/src/centrality/prpack/prpack_preprocessed_gs_graph.o g++ -std=gnu++17 -I"/usr/share/R/include" -DNDEBUG -DUSING_R -I. -Ivendor -Ivendor/cigraph/src -Ivendor/cigraph/include -Ivendor/cigraph/vendor -Ivendor/io/parsers -I/usr/include/libxml2 -DHAVE_LIBXML -DNDEBUG -DNTIMER -DNPRINT -DIGRAPH_THREAD_LOCAL= -DPRPACK_IGRAPH_SUPPORT -DHAVE_GFORTRAN=1 -D_GNU_SOURCE=1 -I'/home/omnipath/local/R/4.4-3.20/cpp11/include' -fvisibility=hidden -fpic -g -O2 -fno-omit-frame-pointer -mno-omit-leaf-frame-pointer -ffile-prefix-map=/build/r-base-EawLoD/r-base-4.4.1=. -fstack-protector-strong -fstack-clash-protection -Wformat -Werror=format-security -fcf-protection -fdebug-prefix-map=/build/r-base-EawLoD/r-base-4.4.1=/usr/src/r-base-4.4.1-1.2404.0 -Wdate-time -D_FORTIFY_SOURCE=3 -c vendor/cigraph/src/centrality/prpack/prpack_preprocessed_scc_graph.cpp -o vendor/cigraph/src/centrality/prpack/prpack_preprocessed_scc_graph.o g++ -std=gnu++17 -I"/usr/share/R/include" -DNDEBUG -DUSING_R -I. -Ivendor -Ivendor/cigraph/src -Ivendor/cigraph/include -Ivendor/cigraph/vendor -Ivendor/io/parsers -I/usr/include/libxml2 -DHAVE_LIBXML -DNDEBUG -DNTIMER -DNPRINT -DIGRAPH_THREAD_LOCAL= -DPRPACK_IGRAPH_SUPPORT -DHAVE_GFORTRAN=1 -D_GNU_SOURCE=1 -I'/home/omnipath/local/R/4.4-3.20/cpp11/include' -fvisibility=hidden -fpic -g -O2 -fno-omit-frame-pointer -mno-omit-leaf-frame-pointer -ffile-prefix-map=/build/r-base-EawLoD/r-base-4.4.1=. -fstack-protector-strong -fstack-clash-protection -Wformat -Werror=format-security -fcf-protection -fdebug-prefix-map=/build/r-base-EawLoD/r-base-4.4.1=/usr/src/r-base-4.4.1-1.2404.0 -Wdate-time -D_FORTIFY_SOURCE=3 -c vendor/cigraph/src/centrality/prpack/prpack_preprocessed_schur_graph.cpp -o vendor/cigraph/src/centrality/prpack/prpack_preprocessed_schur_graph.o g++ -std=gnu++17 -I"/usr/share/R/include" -DNDEBUG -DUSING_R -I. -Ivendor -Ivendor/cigraph/src -Ivendor/cigraph/include -Ivendor/cigraph/vendor -Ivendor/io/parsers -I/usr/include/libxml2 -DHAVE_LIBXML -DNDEBUG -DNTIMER -DNPRINT -DIGRAPH_THREAD_LOCAL= -DPRPACK_IGRAPH_SUPPORT -DHAVE_GFORTRAN=1 -D_GNU_SOURCE=1 -I'/home/omnipath/local/R/4.4-3.20/cpp11/include' -fvisibility=hidden -fpic -g -O2 -fno-omit-frame-pointer -mno-omit-leaf-frame-pointer -ffile-prefix-map=/build/r-base-EawLoD/r-base-4.4.1=. -fstack-protector-strong -fstack-clash-protection -Wformat -Werror=format-security -fcf-protection -fdebug-prefix-map=/build/r-base-EawLoD/r-base-4.4.1=/usr/src/r-base-4.4.1-1.2404.0 -Wdate-time -D_FORTIFY_SOURCE=3 -c vendor/cigraph/src/centrality/prpack/prpack_result.cpp -o vendor/cigraph/src/centrality/prpack/prpack_result.o g++ -std=gnu++17 -I"/usr/share/R/include" -DNDEBUG -DUSING_R -I. -Ivendor -Ivendor/cigraph/src -Ivendor/cigraph/include -Ivendor/cigraph/vendor -Ivendor/io/parsers -I/usr/include/libxml2 -DHAVE_LIBXML -DNDEBUG -DNTIMER -DNPRINT -DIGRAPH_THREAD_LOCAL= -DPRPACK_IGRAPH_SUPPORT -DHAVE_GFORTRAN=1 -D_GNU_SOURCE=1 -I'/home/omnipath/local/R/4.4-3.20/cpp11/include' -fvisibility=hidden -fpic -g -O2 -fno-omit-frame-pointer -mno-omit-leaf-frame-pointer -ffile-prefix-map=/build/r-base-EawLoD/r-base-4.4.1=. -fstack-protector-strong -fstack-clash-protection -Wformat -Werror=format-security -fcf-protection -fdebug-prefix-map=/build/r-base-EawLoD/r-base-4.4.1=/usr/src/r-base-4.4.1-1.2404.0 -Wdate-time -D_FORTIFY_SOURCE=3 -c vendor/cigraph/src/centrality/prpack/prpack_solver.cpp -o vendor/cigraph/src/centrality/prpack/prpack_solver.o g++ -std=gnu++17 -I"/usr/share/R/include" -DNDEBUG -DUSING_R -I. -Ivendor -Ivendor/cigraph/src -Ivendor/cigraph/include -Ivendor/cigraph/vendor -Ivendor/io/parsers -I/usr/include/libxml2 -DHAVE_LIBXML -DNDEBUG -DNTIMER -DNPRINT -DIGRAPH_THREAD_LOCAL= -DPRPACK_IGRAPH_SUPPORT -DHAVE_GFORTRAN=1 -D_GNU_SOURCE=1 -I'/home/omnipath/local/R/4.4-3.20/cpp11/include' -fvisibility=hidden -fpic -g -O2 -fno-omit-frame-pointer -mno-omit-leaf-frame-pointer -ffile-prefix-map=/build/r-base-EawLoD/r-base-4.4.1=. -fstack-protector-strong -fstack-clash-protection -Wformat -Werror=format-security -fcf-protection -fdebug-prefix-map=/build/r-base-EawLoD/r-base-4.4.1=/usr/src/r-base-4.4.1-1.2404.0 -Wdate-time -D_FORTIFY_SOURCE=3 -c vendor/cigraph/src/centrality/prpack/prpack_utils.cpp -o vendor/cigraph/src/centrality/prpack/prpack_utils.o g++ -std=gnu++17 -I"/usr/share/R/include" -DNDEBUG -DUSING_R -I. -Ivendor -Ivendor/cigraph/src -Ivendor/cigraph/include -Ivendor/cigraph/vendor -Ivendor/io/parsers -I/usr/include/libxml2 -DHAVE_LIBXML -DNDEBUG -DNTIMER -DNPRINT -DIGRAPH_THREAD_LOCAL= -DPRPACK_IGRAPH_SUPPORT -DHAVE_GFORTRAN=1 -D_GNU_SOURCE=1 -I'/home/omnipath/local/R/4.4-3.20/cpp11/include' -fvisibility=hidden -fpic -g -O2 -fno-omit-frame-pointer -mno-omit-leaf-frame-pointer -ffile-prefix-map=/build/r-base-EawLoD/r-base-4.4.1=. -fstack-protector-strong -fstack-clash-protection -Wformat -Werror=format-security -fcf-protection -fdebug-prefix-map=/build/r-base-EawLoD/r-base-4.4.1=/usr/src/r-base-4.4.1-1.2404.0 -Wdate-time -D_FORTIFY_SOURCE=3 -c vendor/cigraph/src/centrality/truss.cpp -o vendor/cigraph/src/centrality/truss.o gcc -I"/usr/share/R/include" -DNDEBUG -DUSING_R -I. -Ivendor -Ivendor/cigraph/src -Ivendor/cigraph/include -Ivendor/cigraph/vendor -Ivendor/io/parsers -I/usr/include/libxml2 -DHAVE_LIBXML -DNDEBUG -DNTIMER -DNPRINT -DIGRAPH_THREAD_LOCAL= -DPRPACK_IGRAPH_SUPPORT -DHAVE_GFORTRAN=1 -D_GNU_SOURCE=1 -I'/home/omnipath/local/R/4.4-3.20/cpp11/include' -fvisibility=hidden -fpic -g -O2 -fno-omit-frame-pointer -mno-omit-leaf-frame-pointer -ffile-prefix-map=/build/r-base-EawLoD/r-base-4.4.1=. -fstack-protector-strong -fstack-clash-protection -Wformat -Werror=format-security -fcf-protection -fdebug-prefix-map=/build/r-base-EawLoD/r-base-4.4.1=/usr/src/r-base-4.4.1-1.2404.0 -Wdate-time -D_FORTIFY_SOURCE=3 -c vendor/cigraph/src/cliques/cliquer/cliquer.c -o vendor/cigraph/src/cliques/cliquer/cliquer.o gcc -I"/usr/share/R/include" -DNDEBUG -DUSING_R -I. -Ivendor -Ivendor/cigraph/src -Ivendor/cigraph/include -Ivendor/cigraph/vendor -Ivendor/io/parsers -I/usr/include/libxml2 -DHAVE_LIBXML -DNDEBUG -DNTIMER -DNPRINT -DIGRAPH_THREAD_LOCAL= -DPRPACK_IGRAPH_SUPPORT -DHAVE_GFORTRAN=1 -D_GNU_SOURCE=1 -I'/home/omnipath/local/R/4.4-3.20/cpp11/include' -fvisibility=hidden -fpic -g -O2 -fno-omit-frame-pointer -mno-omit-leaf-frame-pointer -ffile-prefix-map=/build/r-base-EawLoD/r-base-4.4.1=. -fstack-protector-strong -fstack-clash-protection -Wformat -Werror=format-security -fcf-protection -fdebug-prefix-map=/build/r-base-EawLoD/r-base-4.4.1=/usr/src/r-base-4.4.1-1.2404.0 -Wdate-time -D_FORTIFY_SOURCE=3 -c vendor/cigraph/src/cliques/cliquer/cliquer_graph.c -o vendor/cigraph/src/cliques/cliquer/cliquer_graph.o gcc -I"/usr/share/R/include" -DNDEBUG -DUSING_R -I. -Ivendor -Ivendor/cigraph/src -Ivendor/cigraph/include -Ivendor/cigraph/vendor -Ivendor/io/parsers -I/usr/include/libxml2 -DHAVE_LIBXML -DNDEBUG -DNTIMER -DNPRINT -DIGRAPH_THREAD_LOCAL= -DPRPACK_IGRAPH_SUPPORT -DHAVE_GFORTRAN=1 -D_GNU_SOURCE=1 -I'/home/omnipath/local/R/4.4-3.20/cpp11/include' -fvisibility=hidden -fpic -g -O2 -fno-omit-frame-pointer -mno-omit-leaf-frame-pointer -ffile-prefix-map=/build/r-base-EawLoD/r-base-4.4.1=. -fstack-protector-strong -fstack-clash-protection -Wformat -Werror=format-security -fcf-protection -fdebug-prefix-map=/build/r-base-EawLoD/r-base-4.4.1=/usr/src/r-base-4.4.1-1.2404.0 -Wdate-time -D_FORTIFY_SOURCE=3 -c vendor/cigraph/src/cliques/cliquer/reorder.c -o vendor/cigraph/src/cliques/cliquer/reorder.o gcc -I"/usr/share/R/include" -DNDEBUG -DUSING_R -I. -Ivendor -Ivendor/cigraph/src -Ivendor/cigraph/include -Ivendor/cigraph/vendor -Ivendor/io/parsers -I/usr/include/libxml2 -DHAVE_LIBXML -DNDEBUG -DNTIMER -DNPRINT -DIGRAPH_THREAD_LOCAL= -DPRPACK_IGRAPH_SUPPORT -DHAVE_GFORTRAN=1 -D_GNU_SOURCE=1 -I'/home/omnipath/local/R/4.4-3.20/cpp11/include' -fvisibility=hidden -fpic -g -O2 -fno-omit-frame-pointer -mno-omit-leaf-frame-pointer -ffile-prefix-map=/build/r-base-EawLoD/r-base-4.4.1=. -fstack-protector-strong -fstack-clash-protection -Wformat -Werror=format-security -fcf-protection -fdebug-prefix-map=/build/r-base-EawLoD/r-base-4.4.1=/usr/src/r-base-4.4.1-1.2404.0 -Wdate-time -D_FORTIFY_SOURCE=3 -c vendor/cigraph/src/cliques/cliquer_wrapper.c -o vendor/cigraph/src/cliques/cliquer_wrapper.o gcc -I"/usr/share/R/include" -DNDEBUG -DUSING_R -I. -Ivendor -Ivendor/cigraph/src -Ivendor/cigraph/include -Ivendor/cigraph/vendor -Ivendor/io/parsers -I/usr/include/libxml2 -DHAVE_LIBXML -DNDEBUG -DNTIMER -DNPRINT -DIGRAPH_THREAD_LOCAL= -DPRPACK_IGRAPH_SUPPORT -DHAVE_GFORTRAN=1 -D_GNU_SOURCE=1 -I'/home/omnipath/local/R/4.4-3.20/cpp11/include' -fvisibility=hidden -fpic -g -O2 -fno-omit-frame-pointer -mno-omit-leaf-frame-pointer -ffile-prefix-map=/build/r-base-EawLoD/r-base-4.4.1=. -fstack-protector-strong -fstack-clash-protection -Wformat -Werror=format-security -fcf-protection -fdebug-prefix-map=/build/r-base-EawLoD/r-base-4.4.1=/usr/src/r-base-4.4.1-1.2404.0 -Wdate-time -D_FORTIFY_SOURCE=3 -c vendor/cigraph/src/cliques/cliques.c -o vendor/cigraph/src/cliques/cliques.o gcc -I"/usr/share/R/include" -DNDEBUG -DUSING_R -I. -Ivendor -Ivendor/cigraph/src -Ivendor/cigraph/include -Ivendor/cigraph/vendor -Ivendor/io/parsers -I/usr/include/libxml2 -DHAVE_LIBXML -DNDEBUG -DNTIMER -DNPRINT -DIGRAPH_THREAD_LOCAL= -DPRPACK_IGRAPH_SUPPORT -DHAVE_GFORTRAN=1 -D_GNU_SOURCE=1 -I'/home/omnipath/local/R/4.4-3.20/cpp11/include' -fvisibility=hidden -fpic -g -O2 -fno-omit-frame-pointer -mno-omit-leaf-frame-pointer -ffile-prefix-map=/build/r-base-EawLoD/r-base-4.4.1=. -fstack-protector-strong -fstack-clash-protection -Wformat -Werror=format-security -fcf-protection -fdebug-prefix-map=/build/r-base-EawLoD/r-base-4.4.1=/usr/src/r-base-4.4.1-1.2404.0 -Wdate-time -D_FORTIFY_SOURCE=3 -c vendor/cigraph/src/cliques/glet.c -o vendor/cigraph/src/cliques/glet.o gcc -I"/usr/share/R/include" -DNDEBUG -DUSING_R -I. -Ivendor -Ivendor/cigraph/src -Ivendor/cigraph/include -Ivendor/cigraph/vendor -Ivendor/io/parsers -I/usr/include/libxml2 -DHAVE_LIBXML -DNDEBUG -DNTIMER -DNPRINT -DIGRAPH_THREAD_LOCAL= -DPRPACK_IGRAPH_SUPPORT -DHAVE_GFORTRAN=1 -D_GNU_SOURCE=1 -I'/home/omnipath/local/R/4.4-3.20/cpp11/include' -fvisibility=hidden -fpic -g -O2 -fno-omit-frame-pointer -mno-omit-leaf-frame-pointer -ffile-prefix-map=/build/r-base-EawLoD/r-base-4.4.1=. -fstack-protector-strong -fstack-clash-protection -Wformat -Werror=format-security -fcf-protection -fdebug-prefix-map=/build/r-base-EawLoD/r-base-4.4.1=/usr/src/r-base-4.4.1-1.2404.0 -Wdate-time -D_FORTIFY_SOURCE=3 -c vendor/cigraph/src/cliques/maximal_cliques.c -o vendor/cigraph/src/cliques/maximal_cliques.o gcc -I"/usr/share/R/include" -DNDEBUG -DUSING_R -I. -Ivendor -Ivendor/cigraph/src -Ivendor/cigraph/include -Ivendor/cigraph/vendor -Ivendor/io/parsers -I/usr/include/libxml2 -DHAVE_LIBXML -DNDEBUG -DNTIMER -DNPRINT -DIGRAPH_THREAD_LOCAL= -DPRPACK_IGRAPH_SUPPORT -DHAVE_GFORTRAN=1 -D_GNU_SOURCE=1 -I'/home/omnipath/local/R/4.4-3.20/cpp11/include' -fvisibility=hidden -fpic -g -O2 -fno-omit-frame-pointer -mno-omit-leaf-frame-pointer -ffile-prefix-map=/build/r-base-EawLoD/r-base-4.4.1=. -fstack-protector-strong -fstack-clash-protection -Wformat -Werror=format-security -fcf-protection -fdebug-prefix-map=/build/r-base-EawLoD/r-base-4.4.1=/usr/src/r-base-4.4.1-1.2404.0 -Wdate-time -D_FORTIFY_SOURCE=3 -c vendor/cigraph/src/community/community_misc.c -o vendor/cigraph/src/community/community_misc.o gcc -I"/usr/share/R/include" -DNDEBUG -DUSING_R -I. -Ivendor -Ivendor/cigraph/src -Ivendor/cigraph/include -Ivendor/cigraph/vendor -Ivendor/io/parsers -I/usr/include/libxml2 -DHAVE_LIBXML -DNDEBUG -DNTIMER -DNPRINT -DIGRAPH_THREAD_LOCAL= -DPRPACK_IGRAPH_SUPPORT -DHAVE_GFORTRAN=1 -D_GNU_SOURCE=1 -I'/home/omnipath/local/R/4.4-3.20/cpp11/include' -fvisibility=hidden -fpic -g -O2 -fno-omit-frame-pointer -mno-omit-leaf-frame-pointer -ffile-prefix-map=/build/r-base-EawLoD/r-base-4.4.1=. -fstack-protector-strong -fstack-clash-protection -Wformat -Werror=format-security -fcf-protection -fdebug-prefix-map=/build/r-base-EawLoD/r-base-4.4.1=/usr/src/r-base-4.4.1-1.2404.0 -Wdate-time -D_FORTIFY_SOURCE=3 -c vendor/cigraph/src/community/edge_betweenness.c -o vendor/cigraph/src/community/edge_betweenness.o gcc -I"/usr/share/R/include" -DNDEBUG -DUSING_R -I. -Ivendor -Ivendor/cigraph/src -Ivendor/cigraph/include -Ivendor/cigraph/vendor -Ivendor/io/parsers -I/usr/include/libxml2 -DHAVE_LIBXML -DNDEBUG -DNTIMER -DNPRINT -DIGRAPH_THREAD_LOCAL= -DPRPACK_IGRAPH_SUPPORT -DHAVE_GFORTRAN=1 -D_GNU_SOURCE=1 -I'/home/omnipath/local/R/4.4-3.20/cpp11/include' -fvisibility=hidden -fpic -g -O2 -fno-omit-frame-pointer -mno-omit-leaf-frame-pointer -ffile-prefix-map=/build/r-base-EawLoD/r-base-4.4.1=. -fstack-protector-strong -fstack-clash-protection -Wformat -Werror=format-security -fcf-protection -fdebug-prefix-map=/build/r-base-EawLoD/r-base-4.4.1=/usr/src/r-base-4.4.1-1.2404.0 -Wdate-time -D_FORTIFY_SOURCE=3 -c vendor/cigraph/src/community/fast_modularity.c -o vendor/cigraph/src/community/fast_modularity.o gcc -I"/usr/share/R/include" -DNDEBUG -DUSING_R -I. -Ivendor -Ivendor/cigraph/src -Ivendor/cigraph/include -Ivendor/cigraph/vendor -Ivendor/io/parsers -I/usr/include/libxml2 -DHAVE_LIBXML -DNDEBUG -DNTIMER -DNPRINT -DIGRAPH_THREAD_LOCAL= -DPRPACK_IGRAPH_SUPPORT -DHAVE_GFORTRAN=1 -D_GNU_SOURCE=1 -I'/home/omnipath/local/R/4.4-3.20/cpp11/include' -fvisibility=hidden -fpic -g -O2 -fno-omit-frame-pointer -mno-omit-leaf-frame-pointer -ffile-prefix-map=/build/r-base-EawLoD/r-base-4.4.1=. -fstack-protector-strong -fstack-clash-protection -Wformat -Werror=format-security -fcf-protection -fdebug-prefix-map=/build/r-base-EawLoD/r-base-4.4.1=/usr/src/r-base-4.4.1-1.2404.0 -Wdate-time -D_FORTIFY_SOURCE=3 -c vendor/cigraph/src/community/fluid.c -o vendor/cigraph/src/community/fluid.o g++ -std=gnu++17 -I"/usr/share/R/include" -DNDEBUG -DUSING_R -I. -Ivendor -Ivendor/cigraph/src -Ivendor/cigraph/include -Ivendor/cigraph/vendor -Ivendor/io/parsers -I/usr/include/libxml2 -DHAVE_LIBXML -DNDEBUG -DNTIMER -DNPRINT -DIGRAPH_THREAD_LOCAL= -DPRPACK_IGRAPH_SUPPORT -DHAVE_GFORTRAN=1 -D_GNU_SOURCE=1 -I'/home/omnipath/local/R/4.4-3.20/cpp11/include' -fvisibility=hidden -fpic -g -O2 -fno-omit-frame-pointer -mno-omit-leaf-frame-pointer -ffile-prefix-map=/build/r-base-EawLoD/r-base-4.4.1=. -fstack-protector-strong -fstack-clash-protection -Wformat -Werror=format-security -fcf-protection -fdebug-prefix-map=/build/r-base-EawLoD/r-base-4.4.1=/usr/src/r-base-4.4.1-1.2404.0 -Wdate-time -D_FORTIFY_SOURCE=3 -c vendor/cigraph/src/community/infomap/infomap.cc -o vendor/cigraph/src/community/infomap/infomap.o g++ -std=gnu++17 -I"/usr/share/R/include" -DNDEBUG -DUSING_R -I. -Ivendor -Ivendor/cigraph/src -Ivendor/cigraph/include -Ivendor/cigraph/vendor -Ivendor/io/parsers -I/usr/include/libxml2 -DHAVE_LIBXML -DNDEBUG -DNTIMER -DNPRINT -DIGRAPH_THREAD_LOCAL= -DPRPACK_IGRAPH_SUPPORT -DHAVE_GFORTRAN=1 -D_GNU_SOURCE=1 -I'/home/omnipath/local/R/4.4-3.20/cpp11/include' -fvisibility=hidden -fpic -g -O2 -fno-omit-frame-pointer -mno-omit-leaf-frame-pointer -ffile-prefix-map=/build/r-base-EawLoD/r-base-4.4.1=. -fstack-protector-strong -fstack-clash-protection -Wformat -Werror=format-security -fcf-protection -fdebug-prefix-map=/build/r-base-EawLoD/r-base-4.4.1=/usr/src/r-base-4.4.1-1.2404.0 -Wdate-time -D_FORTIFY_SOURCE=3 -c vendor/cigraph/src/community/infomap/infomap_FlowGraph.cc -o vendor/cigraph/src/community/infomap/infomap_FlowGraph.o g++ -std=gnu++17 -I"/usr/share/R/include" -DNDEBUG -DUSING_R -I. -Ivendor -Ivendor/cigraph/src -Ivendor/cigraph/include -Ivendor/cigraph/vendor -Ivendor/io/parsers -I/usr/include/libxml2 -DHAVE_LIBXML -DNDEBUG -DNTIMER -DNPRINT -DIGRAPH_THREAD_LOCAL= -DPRPACK_IGRAPH_SUPPORT -DHAVE_GFORTRAN=1 -D_GNU_SOURCE=1 -I'/home/omnipath/local/R/4.4-3.20/cpp11/include' -fvisibility=hidden -fpic -g -O2 -fno-omit-frame-pointer -mno-omit-leaf-frame-pointer -ffile-prefix-map=/build/r-base-EawLoD/r-base-4.4.1=. -fstack-protector-strong -fstack-clash-protection -Wformat -Werror=format-security -fcf-protection -fdebug-prefix-map=/build/r-base-EawLoD/r-base-4.4.1=/usr/src/r-base-4.4.1-1.2404.0 -Wdate-time -D_FORTIFY_SOURCE=3 -c vendor/cigraph/src/community/infomap/infomap_Greedy.cc -o vendor/cigraph/src/community/infomap/infomap_Greedy.o gcc -I"/usr/share/R/include" -DNDEBUG -DUSING_R -I. -Ivendor -Ivendor/cigraph/src -Ivendor/cigraph/include -Ivendor/cigraph/vendor -Ivendor/io/parsers -I/usr/include/libxml2 -DHAVE_LIBXML -DNDEBUG -DNTIMER -DNPRINT -DIGRAPH_THREAD_LOCAL= -DPRPACK_IGRAPH_SUPPORT -DHAVE_GFORTRAN=1 -D_GNU_SOURCE=1 -I'/home/omnipath/local/R/4.4-3.20/cpp11/include' -fvisibility=hidden -fpic -g -O2 -fno-omit-frame-pointer -mno-omit-leaf-frame-pointer -ffile-prefix-map=/build/r-base-EawLoD/r-base-4.4.1=. -fstack-protector-strong -fstack-clash-protection -Wformat -Werror=format-security -fcf-protection -fdebug-prefix-map=/build/r-base-EawLoD/r-base-4.4.1=/usr/src/r-base-4.4.1-1.2404.0 -Wdate-time -D_FORTIFY_SOURCE=3 -c vendor/cigraph/src/community/label_propagation.c -o vendor/cigraph/src/community/label_propagation.o gcc -I"/usr/share/R/include" -DNDEBUG -DUSING_R -I. -Ivendor -Ivendor/cigraph/src -Ivendor/cigraph/include -Ivendor/cigraph/vendor -Ivendor/io/parsers -I/usr/include/libxml2 -DHAVE_LIBXML -DNDEBUG -DNTIMER -DNPRINT -DIGRAPH_THREAD_LOCAL= -DPRPACK_IGRAPH_SUPPORT -DHAVE_GFORTRAN=1 -D_GNU_SOURCE=1 -I'/home/omnipath/local/R/4.4-3.20/cpp11/include' -fvisibility=hidden -fpic -g -O2 -fno-omit-frame-pointer -mno-omit-leaf-frame-pointer -ffile-prefix-map=/build/r-base-EawLoD/r-base-4.4.1=. -fstack-protector-strong -fstack-clash-protection -Wformat -Werror=format-security -fcf-protection -fdebug-prefix-map=/build/r-base-EawLoD/r-base-4.4.1=/usr/src/r-base-4.4.1-1.2404.0 -Wdate-time -D_FORTIFY_SOURCE=3 -c vendor/cigraph/src/community/leading_eigenvector.c -o vendor/cigraph/src/community/leading_eigenvector.o gcc -I"/usr/share/R/include" -DNDEBUG -DUSING_R -I. -Ivendor -Ivendor/cigraph/src -Ivendor/cigraph/include -Ivendor/cigraph/vendor -Ivendor/io/parsers -I/usr/include/libxml2 -DHAVE_LIBXML -DNDEBUG -DNTIMER -DNPRINT -DIGRAPH_THREAD_LOCAL= -DPRPACK_IGRAPH_SUPPORT -DHAVE_GFORTRAN=1 -D_GNU_SOURCE=1 -I'/home/omnipath/local/R/4.4-3.20/cpp11/include' -fvisibility=hidden -fpic -g -O2 -fno-omit-frame-pointer -mno-omit-leaf-frame-pointer -ffile-prefix-map=/build/r-base-EawLoD/r-base-4.4.1=. -fstack-protector-strong -fstack-clash-protection -Wformat -Werror=format-security -fcf-protection -fdebug-prefix-map=/build/r-base-EawLoD/r-base-4.4.1=/usr/src/r-base-4.4.1-1.2404.0 -Wdate-time -D_FORTIFY_SOURCE=3 -c vendor/cigraph/src/community/leiden.c -o vendor/cigraph/src/community/leiden.o gcc -I"/usr/share/R/include" -DNDEBUG -DUSING_R -I. -Ivendor -Ivendor/cigraph/src -Ivendor/cigraph/include -Ivendor/cigraph/vendor -Ivendor/io/parsers -I/usr/include/libxml2 -DHAVE_LIBXML -DNDEBUG -DNTIMER -DNPRINT -DIGRAPH_THREAD_LOCAL= -DPRPACK_IGRAPH_SUPPORT -DHAVE_GFORTRAN=1 -D_GNU_SOURCE=1 -I'/home/omnipath/local/R/4.4-3.20/cpp11/include' -fvisibility=hidden -fpic -g -O2 -fno-omit-frame-pointer -mno-omit-leaf-frame-pointer -ffile-prefix-map=/build/r-base-EawLoD/r-base-4.4.1=. -fstack-protector-strong -fstack-clash-protection -Wformat -Werror=format-security -fcf-protection -fdebug-prefix-map=/build/r-base-EawLoD/r-base-4.4.1=/usr/src/r-base-4.4.1-1.2404.0 -Wdate-time -D_FORTIFY_SOURCE=3 -c vendor/cigraph/src/community/louvain.c -o vendor/cigraph/src/community/louvain.o gcc -I"/usr/share/R/include" -DNDEBUG -DUSING_R -I. -Ivendor -Ivendor/cigraph/src -Ivendor/cigraph/include -Ivendor/cigraph/vendor -Ivendor/io/parsers -I/usr/include/libxml2 -DHAVE_LIBXML -DNDEBUG -DNTIMER -DNPRINT -DIGRAPH_THREAD_LOCAL= -DPRPACK_IGRAPH_SUPPORT -DHAVE_GFORTRAN=1 -D_GNU_SOURCE=1 -I'/home/omnipath/local/R/4.4-3.20/cpp11/include' -fvisibility=hidden -fpic -g -O2 -fno-omit-frame-pointer -mno-omit-leaf-frame-pointer -ffile-prefix-map=/build/r-base-EawLoD/r-base-4.4.1=. -fstack-protector-strong -fstack-clash-protection -Wformat -Werror=format-security -fcf-protection -fdebug-prefix-map=/build/r-base-EawLoD/r-base-4.4.1=/usr/src/r-base-4.4.1-1.2404.0 -Wdate-time -D_FORTIFY_SOURCE=3 -c vendor/cigraph/src/community/modularity.c -o vendor/cigraph/src/community/modularity.o gcc -I"/usr/share/R/include" -DNDEBUG -DUSING_R -I. -Ivendor -Ivendor/cigraph/src -Ivendor/cigraph/include -Ivendor/cigraph/vendor -Ivendor/io/parsers -I/usr/include/libxml2 -DHAVE_LIBXML -DNDEBUG -DNTIMER -DNPRINT -DIGRAPH_THREAD_LOCAL= -DPRPACK_IGRAPH_SUPPORT -DHAVE_GFORTRAN=1 -D_GNU_SOURCE=1 -I'/home/omnipath/local/R/4.4-3.20/cpp11/include' -fvisibility=hidden -fpic -g -O2 -fno-omit-frame-pointer -mno-omit-leaf-frame-pointer -ffile-prefix-map=/build/r-base-EawLoD/r-base-4.4.1=. -fstack-protector-strong -fstack-clash-protection -Wformat -Werror=format-security -fcf-protection -fdebug-prefix-map=/build/r-base-EawLoD/r-base-4.4.1=/usr/src/r-base-4.4.1-1.2404.0 -Wdate-time -D_FORTIFY_SOURCE=3 -c vendor/cigraph/src/community/optimal_modularity.c -o vendor/cigraph/src/community/optimal_modularity.o g++ -std=gnu++17 -I"/usr/share/R/include" -DNDEBUG -DUSING_R -I. -Ivendor -Ivendor/cigraph/src -Ivendor/cigraph/include -Ivendor/cigraph/vendor -Ivendor/io/parsers -I/usr/include/libxml2 -DHAVE_LIBXML -DNDEBUG -DNTIMER -DNPRINT -DIGRAPH_THREAD_LOCAL= -DPRPACK_IGRAPH_SUPPORT -DHAVE_GFORTRAN=1 -D_GNU_SOURCE=1 -I'/home/omnipath/local/R/4.4-3.20/cpp11/include' -fvisibility=hidden -fpic -g -O2 -fno-omit-frame-pointer -mno-omit-leaf-frame-pointer -ffile-prefix-map=/build/r-base-EawLoD/r-base-4.4.1=. -fstack-protector-strong -fstack-clash-protection -Wformat -Werror=format-security -fcf-protection -fdebug-prefix-map=/build/r-base-EawLoD/r-base-4.4.1=/usr/src/r-base-4.4.1-1.2404.0 -Wdate-time -D_FORTIFY_SOURCE=3 -c vendor/cigraph/src/community/spinglass/NetDataTypes.cpp -o vendor/cigraph/src/community/spinglass/NetDataTypes.o g++ -std=gnu++17 -I"/usr/share/R/include" -DNDEBUG -DUSING_R -I. -Ivendor -Ivendor/cigraph/src -Ivendor/cigraph/include -Ivendor/cigraph/vendor -Ivendor/io/parsers -I/usr/include/libxml2 -DHAVE_LIBXML -DNDEBUG -DNTIMER -DNPRINT -DIGRAPH_THREAD_LOCAL= -DPRPACK_IGRAPH_SUPPORT -DHAVE_GFORTRAN=1 -D_GNU_SOURCE=1 -I'/home/omnipath/local/R/4.4-3.20/cpp11/include' -fvisibility=hidden -fpic -g -O2 -fno-omit-frame-pointer -mno-omit-leaf-frame-pointer -ffile-prefix-map=/build/r-base-EawLoD/r-base-4.4.1=. -fstack-protector-strong -fstack-clash-protection -Wformat -Werror=format-security -fcf-protection -fdebug-prefix-map=/build/r-base-EawLoD/r-base-4.4.1=/usr/src/r-base-4.4.1-1.2404.0 -Wdate-time -D_FORTIFY_SOURCE=3 -c vendor/cigraph/src/community/spinglass/NetRoutines.cpp -o vendor/cigraph/src/community/spinglass/NetRoutines.o g++ -std=gnu++17 -I"/usr/share/R/include" -DNDEBUG -DUSING_R -I. -Ivendor -Ivendor/cigraph/src -Ivendor/cigraph/include -Ivendor/cigraph/vendor -Ivendor/io/parsers -I/usr/include/libxml2 -DHAVE_LIBXML -DNDEBUG -DNTIMER -DNPRINT -DIGRAPH_THREAD_LOCAL= -DPRPACK_IGRAPH_SUPPORT -DHAVE_GFORTRAN=1 -D_GNU_SOURCE=1 -I'/home/omnipath/local/R/4.4-3.20/cpp11/include' -fvisibility=hidden -fpic -g -O2 -fno-omit-frame-pointer -mno-omit-leaf-frame-pointer -ffile-prefix-map=/build/r-base-EawLoD/r-base-4.4.1=. -fstack-protector-strong -fstack-clash-protection -Wformat -Werror=format-security -fcf-protection -fdebug-prefix-map=/build/r-base-EawLoD/r-base-4.4.1=/usr/src/r-base-4.4.1-1.2404.0 -Wdate-time -D_FORTIFY_SOURCE=3 -c vendor/cigraph/src/community/spinglass/clustertool.cpp -o vendor/cigraph/src/community/spinglass/clustertool.o g++ -std=gnu++17 -I"/usr/share/R/include" -DNDEBUG -DUSING_R -I. -Ivendor -Ivendor/cigraph/src -Ivendor/cigraph/include -Ivendor/cigraph/vendor -Ivendor/io/parsers -I/usr/include/libxml2 -DHAVE_LIBXML -DNDEBUG -DNTIMER -DNPRINT -DIGRAPH_THREAD_LOCAL= -DPRPACK_IGRAPH_SUPPORT -DHAVE_GFORTRAN=1 -D_GNU_SOURCE=1 -I'/home/omnipath/local/R/4.4-3.20/cpp11/include' -fvisibility=hidden -fpic -g -O2 -fno-omit-frame-pointer -mno-omit-leaf-frame-pointer -ffile-prefix-map=/build/r-base-EawLoD/r-base-4.4.1=. -fstack-protector-strong -fstack-clash-protection -Wformat -Werror=format-security -fcf-protection -fdebug-prefix-map=/build/r-base-EawLoD/r-base-4.4.1=/usr/src/r-base-4.4.1-1.2404.0 -Wdate-time -D_FORTIFY_SOURCE=3 -c vendor/cigraph/src/community/spinglass/pottsmodel_2.cpp -o vendor/cigraph/src/community/spinglass/pottsmodel_2.o gcc -I"/usr/share/R/include" -DNDEBUG -DUSING_R -I. -Ivendor -Ivendor/cigraph/src -Ivendor/cigraph/include -Ivendor/cigraph/vendor -Ivendor/io/parsers -I/usr/include/libxml2 -DHAVE_LIBXML -DNDEBUG -DNTIMER -DNPRINT -DIGRAPH_THREAD_LOCAL= -DPRPACK_IGRAPH_SUPPORT -DHAVE_GFORTRAN=1 -D_GNU_SOURCE=1 -I'/home/omnipath/local/R/4.4-3.20/cpp11/include' -fvisibility=hidden -fpic -g -O2 -fno-omit-frame-pointer -mno-omit-leaf-frame-pointer -ffile-prefix-map=/build/r-base-EawLoD/r-base-4.4.1=. -fstack-protector-strong -fstack-clash-protection -Wformat -Werror=format-security -fcf-protection -fdebug-prefix-map=/build/r-base-EawLoD/r-base-4.4.1=/usr/src/r-base-4.4.1-1.2404.0 -Wdate-time -D_FORTIFY_SOURCE=3 -c vendor/cigraph/src/community/voronoi.c -o vendor/cigraph/src/community/voronoi.o g++ -std=gnu++17 -I"/usr/share/R/include" -DNDEBUG -DUSING_R -I. -Ivendor -Ivendor/cigraph/src -Ivendor/cigraph/include -Ivendor/cigraph/vendor -Ivendor/io/parsers -I/usr/include/libxml2 -DHAVE_LIBXML -DNDEBUG -DNTIMER -DNPRINT -DIGRAPH_THREAD_LOCAL= -DPRPACK_IGRAPH_SUPPORT -DHAVE_GFORTRAN=1 -D_GNU_SOURCE=1 -I'/home/omnipath/local/R/4.4-3.20/cpp11/include' -fvisibility=hidden -fpic -g -O2 -fno-omit-frame-pointer -mno-omit-leaf-frame-pointer -ffile-prefix-map=/build/r-base-EawLoD/r-base-4.4.1=. -fstack-protector-strong -fstack-clash-protection -Wformat -Werror=format-security -fcf-protection -fdebug-prefix-map=/build/r-base-EawLoD/r-base-4.4.1=/usr/src/r-base-4.4.1-1.2404.0 -Wdate-time -D_FORTIFY_SOURCE=3 -c vendor/cigraph/src/community/walktrap/walktrap.cpp -o vendor/cigraph/src/community/walktrap/walktrap.o g++ -std=gnu++17 -I"/usr/share/R/include" -DNDEBUG -DUSING_R -I. -Ivendor -Ivendor/cigraph/src -Ivendor/cigraph/include -Ivendor/cigraph/vendor -Ivendor/io/parsers -I/usr/include/libxml2 -DHAVE_LIBXML -DNDEBUG -DNTIMER -DNPRINT -DIGRAPH_THREAD_LOCAL= -DPRPACK_IGRAPH_SUPPORT -DHAVE_GFORTRAN=1 -D_GNU_SOURCE=1 -I'/home/omnipath/local/R/4.4-3.20/cpp11/include' -fvisibility=hidden -fpic -g -O2 -fno-omit-frame-pointer -mno-omit-leaf-frame-pointer -ffile-prefix-map=/build/r-base-EawLoD/r-base-4.4.1=. -fstack-protector-strong -fstack-clash-protection -Wformat -Werror=format-security -fcf-protection -fdebug-prefix-map=/build/r-base-EawLoD/r-base-4.4.1=/usr/src/r-base-4.4.1-1.2404.0 -Wdate-time -D_FORTIFY_SOURCE=3 -c vendor/cigraph/src/community/walktrap/walktrap_communities.cpp -o vendor/cigraph/src/community/walktrap/walktrap_communities.o g++ -std=gnu++17 -I"/usr/share/R/include" -DNDEBUG -DUSING_R -I. -Ivendor -Ivendor/cigraph/src -Ivendor/cigraph/include -Ivendor/cigraph/vendor -Ivendor/io/parsers -I/usr/include/libxml2 -DHAVE_LIBXML -DNDEBUG -DNTIMER -DNPRINT -DIGRAPH_THREAD_LOCAL= -DPRPACK_IGRAPH_SUPPORT -DHAVE_GFORTRAN=1 -D_GNU_SOURCE=1 -I'/home/omnipath/local/R/4.4-3.20/cpp11/include' -fvisibility=hidden -fpic -g -O2 -fno-omit-frame-pointer -mno-omit-leaf-frame-pointer -ffile-prefix-map=/build/r-base-EawLoD/r-base-4.4.1=. -fstack-protector-strong -fstack-clash-protection -Wformat -Werror=format-security -fcf-protection -fdebug-prefix-map=/build/r-base-EawLoD/r-base-4.4.1=/usr/src/r-base-4.4.1-1.2404.0 -Wdate-time -D_FORTIFY_SOURCE=3 -c vendor/cigraph/src/community/walktrap/walktrap_graph.cpp -o vendor/cigraph/src/community/walktrap/walktrap_graph.o g++ -std=gnu++17 -I"/usr/share/R/include" -DNDEBUG -DUSING_R -I. -Ivendor -Ivendor/cigraph/src -Ivendor/cigraph/include -Ivendor/cigraph/vendor -Ivendor/io/parsers -I/usr/include/libxml2 -DHAVE_LIBXML -DNDEBUG -DNTIMER -DNPRINT -DIGRAPH_THREAD_LOCAL= -DPRPACK_IGRAPH_SUPPORT -DHAVE_GFORTRAN=1 -D_GNU_SOURCE=1 -I'/home/omnipath/local/R/4.4-3.20/cpp11/include' -fvisibility=hidden -fpic -g -O2 -fno-omit-frame-pointer -mno-omit-leaf-frame-pointer -ffile-prefix-map=/build/r-base-EawLoD/r-base-4.4.1=. -fstack-protector-strong -fstack-clash-protection -Wformat -Werror=format-security -fcf-protection -fdebug-prefix-map=/build/r-base-EawLoD/r-base-4.4.1=/usr/src/r-base-4.4.1-1.2404.0 -Wdate-time -D_FORTIFY_SOURCE=3 -c vendor/cigraph/src/community/walktrap/walktrap_heap.cpp -o vendor/cigraph/src/community/walktrap/walktrap_heap.o gcc -I"/usr/share/R/include" -DNDEBUG -DUSING_R -I. -Ivendor -Ivendor/cigraph/src -Ivendor/cigraph/include -Ivendor/cigraph/vendor -Ivendor/io/parsers -I/usr/include/libxml2 -DHAVE_LIBXML -DNDEBUG -DNTIMER -DNPRINT -DIGRAPH_THREAD_LOCAL= -DPRPACK_IGRAPH_SUPPORT -DHAVE_GFORTRAN=1 -D_GNU_SOURCE=1 -I'/home/omnipath/local/R/4.4-3.20/cpp11/include' -fvisibility=hidden -fpic -g -O2 -fno-omit-frame-pointer -mno-omit-leaf-frame-pointer -ffile-prefix-map=/build/r-base-EawLoD/r-base-4.4.1=. -fstack-protector-strong -fstack-clash-protection -Wformat -Werror=format-security -fcf-protection -fdebug-prefix-map=/build/r-base-EawLoD/r-base-4.4.1=/usr/src/r-base-4.4.1-1.2404.0 -Wdate-time -D_FORTIFY_SOURCE=3 -c vendor/cigraph/src/connectivity/cohesive_blocks.c -o vendor/cigraph/src/connectivity/cohesive_blocks.o gcc -I"/usr/share/R/include" -DNDEBUG -DUSING_R -I. -Ivendor -Ivendor/cigraph/src -Ivendor/cigraph/include -Ivendor/cigraph/vendor -Ivendor/io/parsers -I/usr/include/libxml2 -DHAVE_LIBXML -DNDEBUG -DNTIMER -DNPRINT -DIGRAPH_THREAD_LOCAL= -DPRPACK_IGRAPH_SUPPORT -DHAVE_GFORTRAN=1 -D_GNU_SOURCE=1 -I'/home/omnipath/local/R/4.4-3.20/cpp11/include' -fvisibility=hidden -fpic -g -O2 -fno-omit-frame-pointer -mno-omit-leaf-frame-pointer -ffile-prefix-map=/build/r-base-EawLoD/r-base-4.4.1=. -fstack-protector-strong -fstack-clash-protection -Wformat -Werror=format-security -fcf-protection -fdebug-prefix-map=/build/r-base-EawLoD/r-base-4.4.1=/usr/src/r-base-4.4.1-1.2404.0 -Wdate-time -D_FORTIFY_SOURCE=3 -c vendor/cigraph/src/connectivity/components.c -o vendor/cigraph/src/connectivity/components.o gcc -I"/usr/share/R/include" -DNDEBUG -DUSING_R -I. -Ivendor -Ivendor/cigraph/src -Ivendor/cigraph/include -Ivendor/cigraph/vendor -Ivendor/io/parsers -I/usr/include/libxml2 -DHAVE_LIBXML -DNDEBUG -DNTIMER -DNPRINT -DIGRAPH_THREAD_LOCAL= -DPRPACK_IGRAPH_SUPPORT -DHAVE_GFORTRAN=1 -D_GNU_SOURCE=1 -I'/home/omnipath/local/R/4.4-3.20/cpp11/include' -fvisibility=hidden -fpic -g -O2 -fno-omit-frame-pointer -mno-omit-leaf-frame-pointer -ffile-prefix-map=/build/r-base-EawLoD/r-base-4.4.1=. -fstack-protector-strong -fstack-clash-protection -Wformat -Werror=format-security -fcf-protection -fdebug-prefix-map=/build/r-base-EawLoD/r-base-4.4.1=/usr/src/r-base-4.4.1-1.2404.0 -Wdate-time -D_FORTIFY_SOURCE=3 -c vendor/cigraph/src/connectivity/separators.c -o vendor/cigraph/src/connectivity/separators.o gcc -I"/usr/share/R/include" -DNDEBUG -DUSING_R -I. -Ivendor -Ivendor/cigraph/src -Ivendor/cigraph/include -Ivendor/cigraph/vendor -Ivendor/io/parsers -I/usr/include/libxml2 -DHAVE_LIBXML -DNDEBUG -DNTIMER -DNPRINT -DIGRAPH_THREAD_LOCAL= -DPRPACK_IGRAPH_SUPPORT -DHAVE_GFORTRAN=1 -D_GNU_SOURCE=1 -I'/home/omnipath/local/R/4.4-3.20/cpp11/include' -fvisibility=hidden -fpic -g -O2 -fno-omit-frame-pointer -mno-omit-leaf-frame-pointer -ffile-prefix-map=/build/r-base-EawLoD/r-base-4.4.1=. -fstack-protector-strong -fstack-clash-protection -Wformat -Werror=format-security -fcf-protection -fdebug-prefix-map=/build/r-base-EawLoD/r-base-4.4.1=/usr/src/r-base-4.4.1-1.2404.0 -Wdate-time -D_FORTIFY_SOURCE=3 -c vendor/cigraph/src/constructors/adjacency.c -o vendor/cigraph/src/constructors/adjacency.o gcc -I"/usr/share/R/include" -DNDEBUG -DUSING_R -I. -Ivendor -Ivendor/cigraph/src -Ivendor/cigraph/include -Ivendor/cigraph/vendor -Ivendor/io/parsers -I/usr/include/libxml2 -DHAVE_LIBXML -DNDEBUG -DNTIMER -DNPRINT -DIGRAPH_THREAD_LOCAL= -DPRPACK_IGRAPH_SUPPORT -DHAVE_GFORTRAN=1 -D_GNU_SOURCE=1 -I'/home/omnipath/local/R/4.4-3.20/cpp11/include' -fvisibility=hidden -fpic -g -O2 -fno-omit-frame-pointer -mno-omit-leaf-frame-pointer -ffile-prefix-map=/build/r-base-EawLoD/r-base-4.4.1=. -fstack-protector-strong -fstack-clash-protection -Wformat -Werror=format-security -fcf-protection -fdebug-prefix-map=/build/r-base-EawLoD/r-base-4.4.1=/usr/src/r-base-4.4.1-1.2404.0 -Wdate-time -D_FORTIFY_SOURCE=3 -c vendor/cigraph/src/constructors/atlas.c -o vendor/cigraph/src/constructors/atlas.o gcc -I"/usr/share/R/include" -DNDEBUG -DUSING_R -I. -Ivendor -Ivendor/cigraph/src -Ivendor/cigraph/include -Ivendor/cigraph/vendor -Ivendor/io/parsers -I/usr/include/libxml2 -DHAVE_LIBXML -DNDEBUG -DNTIMER -DNPRINT -DIGRAPH_THREAD_LOCAL= -DPRPACK_IGRAPH_SUPPORT -DHAVE_GFORTRAN=1 -D_GNU_SOURCE=1 -I'/home/omnipath/local/R/4.4-3.20/cpp11/include' -fvisibility=hidden -fpic -g -O2 -fno-omit-frame-pointer -mno-omit-leaf-frame-pointer -ffile-prefix-map=/build/r-base-EawLoD/r-base-4.4.1=. -fstack-protector-strong -fstack-clash-protection -Wformat -Werror=format-security -fcf-protection -fdebug-prefix-map=/build/r-base-EawLoD/r-base-4.4.1=/usr/src/r-base-4.4.1-1.2404.0 -Wdate-time -D_FORTIFY_SOURCE=3 -c vendor/cigraph/src/constructors/basic_constructors.c -o vendor/cigraph/src/constructors/basic_constructors.o gcc -I"/usr/share/R/include" -DNDEBUG -DUSING_R -I. -Ivendor -Ivendor/cigraph/src -Ivendor/cigraph/include -Ivendor/cigraph/vendor -Ivendor/io/parsers -I/usr/include/libxml2 -DHAVE_LIBXML -DNDEBUG -DNTIMER -DNPRINT -DIGRAPH_THREAD_LOCAL= -DPRPACK_IGRAPH_SUPPORT -DHAVE_GFORTRAN=1 -D_GNU_SOURCE=1 -I'/home/omnipath/local/R/4.4-3.20/cpp11/include' -fvisibility=hidden -fpic -g -O2 -fno-omit-frame-pointer -mno-omit-leaf-frame-pointer -ffile-prefix-map=/build/r-base-EawLoD/r-base-4.4.1=. -fstack-protector-strong -fstack-clash-protection -Wformat -Werror=format-security -fcf-protection -fdebug-prefix-map=/build/r-base-EawLoD/r-base-4.4.1=/usr/src/r-base-4.4.1-1.2404.0 -Wdate-time -D_FORTIFY_SOURCE=3 -c vendor/cigraph/src/constructors/circulant.c -o vendor/cigraph/src/constructors/circulant.o gcc -I"/usr/share/R/include" -DNDEBUG -DUSING_R -I. -Ivendor -Ivendor/cigraph/src -Ivendor/cigraph/include -Ivendor/cigraph/vendor -Ivendor/io/parsers -I/usr/include/libxml2 -DHAVE_LIBXML -DNDEBUG -DNTIMER -DNPRINT -DIGRAPH_THREAD_LOCAL= -DPRPACK_IGRAPH_SUPPORT -DHAVE_GFORTRAN=1 -D_GNU_SOURCE=1 -I'/home/omnipath/local/R/4.4-3.20/cpp11/include' -fvisibility=hidden -fpic -g -O2 -fno-omit-frame-pointer -mno-omit-leaf-frame-pointer -ffile-prefix-map=/build/r-base-EawLoD/r-base-4.4.1=. -fstack-protector-strong -fstack-clash-protection -Wformat -Werror=format-security -fcf-protection -fdebug-prefix-map=/build/r-base-EawLoD/r-base-4.4.1=/usr/src/r-base-4.4.1-1.2404.0 -Wdate-time -D_FORTIFY_SOURCE=3 -c vendor/cigraph/src/constructors/de_bruijn.c -o vendor/cigraph/src/constructors/de_bruijn.o gcc -I"/usr/share/R/include" -DNDEBUG -DUSING_R -I. -Ivendor -Ivendor/cigraph/src -Ivendor/cigraph/include -Ivendor/cigraph/vendor -Ivendor/io/parsers -I/usr/include/libxml2 -DHAVE_LIBXML -DNDEBUG -DNTIMER -DNPRINT -DIGRAPH_THREAD_LOCAL= -DPRPACK_IGRAPH_SUPPORT -DHAVE_GFORTRAN=1 -D_GNU_SOURCE=1 -I'/home/omnipath/local/R/4.4-3.20/cpp11/include' -fvisibility=hidden -fpic -g -O2 -fno-omit-frame-pointer -mno-omit-leaf-frame-pointer -ffile-prefix-map=/build/r-base-EawLoD/r-base-4.4.1=. -fstack-protector-strong -fstack-clash-protection -Wformat -Werror=format-security -fcf-protection -fdebug-prefix-map=/build/r-base-EawLoD/r-base-4.4.1=/usr/src/r-base-4.4.1-1.2404.0 -Wdate-time -D_FORTIFY_SOURCE=3 -c vendor/cigraph/src/constructors/famous.c -o vendor/cigraph/src/constructors/famous.o gcc -I"/usr/share/R/include" -DNDEBUG -DUSING_R -I. -Ivendor -Ivendor/cigraph/src -Ivendor/cigraph/include -Ivendor/cigraph/vendor -Ivendor/io/parsers -I/usr/include/libxml2 -DHAVE_LIBXML -DNDEBUG -DNTIMER -DNPRINT -DIGRAPH_THREAD_LOCAL= -DPRPACK_IGRAPH_SUPPORT -DHAVE_GFORTRAN=1 -D_GNU_SOURCE=1 -I'/home/omnipath/local/R/4.4-3.20/cpp11/include' -fvisibility=hidden -fpic -g -O2 -fno-omit-frame-pointer -mno-omit-leaf-frame-pointer -ffile-prefix-map=/build/r-base-EawLoD/r-base-4.4.1=. -fstack-protector-strong -fstack-clash-protection -Wformat -Werror=format-security -fcf-protection -fdebug-prefix-map=/build/r-base-EawLoD/r-base-4.4.1=/usr/src/r-base-4.4.1-1.2404.0 -Wdate-time -D_FORTIFY_SOURCE=3 -c vendor/cigraph/src/constructors/full.c -o vendor/cigraph/src/constructors/full.o gcc -I"/usr/share/R/include" -DNDEBUG -DUSING_R -I. -Ivendor -Ivendor/cigraph/src -Ivendor/cigraph/include -Ivendor/cigraph/vendor -Ivendor/io/parsers -I/usr/include/libxml2 -DHAVE_LIBXML -DNDEBUG -DNTIMER -DNPRINT -DIGRAPH_THREAD_LOCAL= -DPRPACK_IGRAPH_SUPPORT -DHAVE_GFORTRAN=1 -D_GNU_SOURCE=1 -I'/home/omnipath/local/R/4.4-3.20/cpp11/include' -fvisibility=hidden -fpic -g -O2 -fno-omit-frame-pointer -mno-omit-leaf-frame-pointer -ffile-prefix-map=/build/r-base-EawLoD/r-base-4.4.1=. -fstack-protector-strong -fstack-clash-protection -Wformat -Werror=format-security -fcf-protection -fdebug-prefix-map=/build/r-base-EawLoD/r-base-4.4.1=/usr/src/r-base-4.4.1-1.2404.0 -Wdate-time -D_FORTIFY_SOURCE=3 -c vendor/cigraph/src/constructors/generalized_petersen.c -o vendor/cigraph/src/constructors/generalized_petersen.o gcc -I"/usr/share/R/include" -DNDEBUG -DUSING_R -I. -Ivendor -Ivendor/cigraph/src -Ivendor/cigraph/include -Ivendor/cigraph/vendor -Ivendor/io/parsers -I/usr/include/libxml2 -DHAVE_LIBXML -DNDEBUG -DNTIMER -DNPRINT -DIGRAPH_THREAD_LOCAL= -DPRPACK_IGRAPH_SUPPORT -DHAVE_GFORTRAN=1 -D_GNU_SOURCE=1 -I'/home/omnipath/local/R/4.4-3.20/cpp11/include' -fvisibility=hidden -fpic -g -O2 -fno-omit-frame-pointer -mno-omit-leaf-frame-pointer -ffile-prefix-map=/build/r-base-EawLoD/r-base-4.4.1=. -fstack-protector-strong -fstack-clash-protection -Wformat -Werror=format-security -fcf-protection -fdebug-prefix-map=/build/r-base-EawLoD/r-base-4.4.1=/usr/src/r-base-4.4.1-1.2404.0 -Wdate-time -D_FORTIFY_SOURCE=3 -c vendor/cigraph/src/constructors/kautz.c -o vendor/cigraph/src/constructors/kautz.o gcc -I"/usr/share/R/include" -DNDEBUG -DUSING_R -I. -Ivendor -Ivendor/cigraph/src -Ivendor/cigraph/include -Ivendor/cigraph/vendor -Ivendor/io/parsers -I/usr/include/libxml2 -DHAVE_LIBXML -DNDEBUG -DNTIMER -DNPRINT -DIGRAPH_THREAD_LOCAL= -DPRPACK_IGRAPH_SUPPORT -DHAVE_GFORTRAN=1 -D_GNU_SOURCE=1 -I'/home/omnipath/local/R/4.4-3.20/cpp11/include' -fvisibility=hidden -fpic -g -O2 -fno-omit-frame-pointer -mno-omit-leaf-frame-pointer -ffile-prefix-map=/build/r-base-EawLoD/r-base-4.4.1=. -fstack-protector-strong -fstack-clash-protection -Wformat -Werror=format-security -fcf-protection -fdebug-prefix-map=/build/r-base-EawLoD/r-base-4.4.1=/usr/src/r-base-4.4.1-1.2404.0 -Wdate-time -D_FORTIFY_SOURCE=3 -c vendor/cigraph/src/constructors/lattices.c -o vendor/cigraph/src/constructors/lattices.o gcc -I"/usr/share/R/include" -DNDEBUG -DUSING_R -I. -Ivendor -Ivendor/cigraph/src -Ivendor/cigraph/include -Ivendor/cigraph/vendor -Ivendor/io/parsers -I/usr/include/libxml2 -DHAVE_LIBXML -DNDEBUG -DNTIMER -DNPRINT -DIGRAPH_THREAD_LOCAL= -DPRPACK_IGRAPH_SUPPORT -DHAVE_GFORTRAN=1 -D_GNU_SOURCE=1 -I'/home/omnipath/local/R/4.4-3.20/cpp11/include' -fvisibility=hidden -fpic -g -O2 -fno-omit-frame-pointer -mno-omit-leaf-frame-pointer -ffile-prefix-map=/build/r-base-EawLoD/r-base-4.4.1=. -fstack-protector-strong -fstack-clash-protection -Wformat -Werror=format-security -fcf-protection -fdebug-prefix-map=/build/r-base-EawLoD/r-base-4.4.1=/usr/src/r-base-4.4.1-1.2404.0 -Wdate-time -D_FORTIFY_SOURCE=3 -c vendor/cigraph/src/constructors/lcf.c -o vendor/cigraph/src/constructors/lcf.o gcc -I"/usr/share/R/include" -DNDEBUG -DUSING_R -I. -Ivendor -Ivendor/cigraph/src -Ivendor/cigraph/include -Ivendor/cigraph/vendor -Ivendor/io/parsers -I/usr/include/libxml2 -DHAVE_LIBXML -DNDEBUG -DNTIMER -DNPRINT -DIGRAPH_THREAD_LOCAL= -DPRPACK_IGRAPH_SUPPORT -DHAVE_GFORTRAN=1 -D_GNU_SOURCE=1 -I'/home/omnipath/local/R/4.4-3.20/cpp11/include' -fvisibility=hidden -fpic -g -O2 -fno-omit-frame-pointer -mno-omit-leaf-frame-pointer -ffile-prefix-map=/build/r-base-EawLoD/r-base-4.4.1=. -fstack-protector-strong -fstack-clash-protection -Wformat -Werror=format-security -fcf-protection -fdebug-prefix-map=/build/r-base-EawLoD/r-base-4.4.1=/usr/src/r-base-4.4.1-1.2404.0 -Wdate-time -D_FORTIFY_SOURCE=3 -c vendor/cigraph/src/constructors/linegraph.c -o vendor/cigraph/src/constructors/linegraph.o gcc -I"/usr/share/R/include" -DNDEBUG -DUSING_R -I. -Ivendor -Ivendor/cigraph/src -Ivendor/cigraph/include -Ivendor/cigraph/vendor -Ivendor/io/parsers -I/usr/include/libxml2 -DHAVE_LIBXML -DNDEBUG -DNTIMER -DNPRINT -DIGRAPH_THREAD_LOCAL= -DPRPACK_IGRAPH_SUPPORT -DHAVE_GFORTRAN=1 -D_GNU_SOURCE=1 -I'/home/omnipath/local/R/4.4-3.20/cpp11/include' -fvisibility=hidden -fpic -g -O2 -fno-omit-frame-pointer -mno-omit-leaf-frame-pointer -ffile-prefix-map=/build/r-base-EawLoD/r-base-4.4.1=. -fstack-protector-strong -fstack-clash-protection -Wformat -Werror=format-security -fcf-protection -fdebug-prefix-map=/build/r-base-EawLoD/r-base-4.4.1=/usr/src/r-base-4.4.1-1.2404.0 -Wdate-time -D_FORTIFY_SOURCE=3 -c vendor/cigraph/src/constructors/prufer.c -o vendor/cigraph/src/constructors/prufer.o gcc -I"/usr/share/R/include" -DNDEBUG -DUSING_R -I. -Ivendor -Ivendor/cigraph/src -Ivendor/cigraph/include -Ivendor/cigraph/vendor -Ivendor/io/parsers -I/usr/include/libxml2 -DHAVE_LIBXML -DNDEBUG -DNTIMER -DNPRINT -DIGRAPH_THREAD_LOCAL= -DPRPACK_IGRAPH_SUPPORT -DHAVE_GFORTRAN=1 -D_GNU_SOURCE=1 -I'/home/omnipath/local/R/4.4-3.20/cpp11/include' -fvisibility=hidden -fpic -g -O2 -fno-omit-frame-pointer -mno-omit-leaf-frame-pointer -ffile-prefix-map=/build/r-base-EawLoD/r-base-4.4.1=. -fstack-protector-strong -fstack-clash-protection -Wformat -Werror=format-security -fcf-protection -fdebug-prefix-map=/build/r-base-EawLoD/r-base-4.4.1=/usr/src/r-base-4.4.1-1.2404.0 -Wdate-time -D_FORTIFY_SOURCE=3 -c vendor/cigraph/src/constructors/regular.c -o vendor/cigraph/src/constructors/regular.o gcc -I"/usr/share/R/include" -DNDEBUG -DUSING_R -I. -Ivendor -Ivendor/cigraph/src -Ivendor/cigraph/include -Ivendor/cigraph/vendor -Ivendor/io/parsers -I/usr/include/libxml2 -DHAVE_LIBXML -DNDEBUG -DNTIMER -DNPRINT -DIGRAPH_THREAD_LOCAL= -DPRPACK_IGRAPH_SUPPORT -DHAVE_GFORTRAN=1 -D_GNU_SOURCE=1 -I'/home/omnipath/local/R/4.4-3.20/cpp11/include' -fvisibility=hidden -fpic -g -O2 -fno-omit-frame-pointer -mno-omit-leaf-frame-pointer -ffile-prefix-map=/build/r-base-EawLoD/r-base-4.4.1=. -fstack-protector-strong -fstack-clash-protection -Wformat -Werror=format-security -fcf-protection -fdebug-prefix-map=/build/r-base-EawLoD/r-base-4.4.1=/usr/src/r-base-4.4.1-1.2404.0 -Wdate-time -D_FORTIFY_SOURCE=3 -c vendor/cigraph/src/constructors/trees.c -o vendor/cigraph/src/constructors/trees.o gcc -I"/usr/share/R/include" -DNDEBUG -DUSING_R -I. -Ivendor -Ivendor/cigraph/src -Ivendor/cigraph/include -Ivendor/cigraph/vendor -Ivendor/io/parsers -I/usr/include/libxml2 -DHAVE_LIBXML -DNDEBUG -DNTIMER -DNPRINT -DIGRAPH_THREAD_LOCAL= -DPRPACK_IGRAPH_SUPPORT -DHAVE_GFORTRAN=1 -D_GNU_SOURCE=1 -I'/home/omnipath/local/R/4.4-3.20/cpp11/include' -fvisibility=hidden -fpic -g -O2 -fno-omit-frame-pointer -mno-omit-leaf-frame-pointer -ffile-prefix-map=/build/r-base-EawLoD/r-base-4.4.1=. -fstack-protector-strong -fstack-clash-protection -Wformat -Werror=format-security -fcf-protection -fdebug-prefix-map=/build/r-base-EawLoD/r-base-4.4.1=/usr/src/r-base-4.4.1-1.2404.0 -Wdate-time -D_FORTIFY_SOURCE=3 -c vendor/cigraph/src/core/array.c -o vendor/cigraph/src/core/array.o gcc -I"/usr/share/R/include" -DNDEBUG -DUSING_R -I. -Ivendor -Ivendor/cigraph/src -Ivendor/cigraph/include -Ivendor/cigraph/vendor -Ivendor/io/parsers -I/usr/include/libxml2 -DHAVE_LIBXML -DNDEBUG -DNTIMER -DNPRINT -DIGRAPH_THREAD_LOCAL= -DPRPACK_IGRAPH_SUPPORT -DHAVE_GFORTRAN=1 -D_GNU_SOURCE=1 -I'/home/omnipath/local/R/4.4-3.20/cpp11/include' -fvisibility=hidden -fpic -g -O2 -fno-omit-frame-pointer -mno-omit-leaf-frame-pointer -ffile-prefix-map=/build/r-base-EawLoD/r-base-4.4.1=. -fstack-protector-strong -fstack-clash-protection -Wformat -Werror=format-security -fcf-protection -fdebug-prefix-map=/build/r-base-EawLoD/r-base-4.4.1=/usr/src/r-base-4.4.1-1.2404.0 -Wdate-time -D_FORTIFY_SOURCE=3 -c vendor/cigraph/src/core/buckets.c -o vendor/cigraph/src/core/buckets.o gcc -I"/usr/share/R/include" -DNDEBUG -DUSING_R -I. -Ivendor -Ivendor/cigraph/src -Ivendor/cigraph/include -Ivendor/cigraph/vendor -Ivendor/io/parsers -I/usr/include/libxml2 -DHAVE_LIBXML -DNDEBUG -DNTIMER -DNPRINT -DIGRAPH_THREAD_LOCAL= -DPRPACK_IGRAPH_SUPPORT -DHAVE_GFORTRAN=1 -D_GNU_SOURCE=1 -I'/home/omnipath/local/R/4.4-3.20/cpp11/include' -fvisibility=hidden -fpic -g -O2 -fno-omit-frame-pointer -mno-omit-leaf-frame-pointer -ffile-prefix-map=/build/r-base-EawLoD/r-base-4.4.1=. -fstack-protector-strong -fstack-clash-protection -Wformat -Werror=format-security -fcf-protection -fdebug-prefix-map=/build/r-base-EawLoD/r-base-4.4.1=/usr/src/r-base-4.4.1-1.2404.0 -Wdate-time -D_FORTIFY_SOURCE=3 -c vendor/cigraph/src/core/cutheap.c -o vendor/cigraph/src/core/cutheap.o gcc -I"/usr/share/R/include" -DNDEBUG -DUSING_R -I. -Ivendor -Ivendor/cigraph/src -Ivendor/cigraph/include -Ivendor/cigraph/vendor -Ivendor/io/parsers -I/usr/include/libxml2 -DHAVE_LIBXML -DNDEBUG -DNTIMER -DNPRINT -DIGRAPH_THREAD_LOCAL= -DPRPACK_IGRAPH_SUPPORT -DHAVE_GFORTRAN=1 -D_GNU_SOURCE=1 -I'/home/omnipath/local/R/4.4-3.20/cpp11/include' -fvisibility=hidden -fpic -g -O2 -fno-omit-frame-pointer -mno-omit-leaf-frame-pointer -ffile-prefix-map=/build/r-base-EawLoD/r-base-4.4.1=. -fstack-protector-strong -fstack-clash-protection -Wformat -Werror=format-security -fcf-protection -fdebug-prefix-map=/build/r-base-EawLoD/r-base-4.4.1=/usr/src/r-base-4.4.1-1.2404.0 -Wdate-time -D_FORTIFY_SOURCE=3 -c vendor/cigraph/src/core/dqueue.c -o vendor/cigraph/src/core/dqueue.o gcc -I"/usr/share/R/include" -DNDEBUG -DUSING_R -I. -Ivendor -Ivendor/cigraph/src -Ivendor/cigraph/include -Ivendor/cigraph/vendor -Ivendor/io/parsers -I/usr/include/libxml2 -DHAVE_LIBXML -DNDEBUG -DNTIMER -DNPRINT -DIGRAPH_THREAD_LOCAL= -DPRPACK_IGRAPH_SUPPORT -DHAVE_GFORTRAN=1 -D_GNU_SOURCE=1 -I'/home/omnipath/local/R/4.4-3.20/cpp11/include' -fvisibility=hidden -fpic -g -O2 -fno-omit-frame-pointer -mno-omit-leaf-frame-pointer -ffile-prefix-map=/build/r-base-EawLoD/r-base-4.4.1=. -fstack-protector-strong -fstack-clash-protection -Wformat -Werror=format-security -fcf-protection -fdebug-prefix-map=/build/r-base-EawLoD/r-base-4.4.1=/usr/src/r-base-4.4.1-1.2404.0 -Wdate-time -D_FORTIFY_SOURCE=3 -c vendor/cigraph/src/core/error.c -o vendor/cigraph/src/core/error.o gcc -I"/usr/share/R/include" -DNDEBUG -DUSING_R -I. -Ivendor -Ivendor/cigraph/src -Ivendor/cigraph/include -Ivendor/cigraph/vendor -Ivendor/io/parsers -I/usr/include/libxml2 -DHAVE_LIBXML -DNDEBUG -DNTIMER -DNPRINT -DIGRAPH_THREAD_LOCAL= -DPRPACK_IGRAPH_SUPPORT -DHAVE_GFORTRAN=1 -D_GNU_SOURCE=1 -I'/home/omnipath/local/R/4.4-3.20/cpp11/include' -fvisibility=hidden -fpic -g -O2 -fno-omit-frame-pointer -mno-omit-leaf-frame-pointer -ffile-prefix-map=/build/r-base-EawLoD/r-base-4.4.1=. -fstack-protector-strong -fstack-clash-protection -Wformat -Werror=format-security -fcf-protection -fdebug-prefix-map=/build/r-base-EawLoD/r-base-4.4.1=/usr/src/r-base-4.4.1-1.2404.0 -Wdate-time -D_FORTIFY_SOURCE=3 -c vendor/cigraph/src/core/estack.c -o vendor/cigraph/src/core/estack.o gcc -I"/usr/share/R/include" -DNDEBUG -DUSING_R -I. -Ivendor -Ivendor/cigraph/src -Ivendor/cigraph/include -Ivendor/cigraph/vendor -Ivendor/io/parsers -I/usr/include/libxml2 -DHAVE_LIBXML -DNDEBUG -DNTIMER -DNPRINT -DIGRAPH_THREAD_LOCAL= -DPRPACK_IGRAPH_SUPPORT -DHAVE_GFORTRAN=1 -D_GNU_SOURCE=1 -I'/home/omnipath/local/R/4.4-3.20/cpp11/include' -fvisibility=hidden -fpic -g -O2 -fno-omit-frame-pointer -mno-omit-leaf-frame-pointer -ffile-prefix-map=/build/r-base-EawLoD/r-base-4.4.1=. -fstack-protector-strong -fstack-clash-protection -Wformat -Werror=format-security -fcf-protection -fdebug-prefix-map=/build/r-base-EawLoD/r-base-4.4.1=/usr/src/r-base-4.4.1-1.2404.0 -Wdate-time -D_FORTIFY_SOURCE=3 -c vendor/cigraph/src/core/fixed_vectorlist.c -o vendor/cigraph/src/core/fixed_vectorlist.o gcc -I"/usr/share/R/include" -DNDEBUG -DUSING_R -I. -Ivendor -Ivendor/cigraph/src -Ivendor/cigraph/include -Ivendor/cigraph/vendor -Ivendor/io/parsers -I/usr/include/libxml2 -DHAVE_LIBXML -DNDEBUG -DNTIMER -DNPRINT -DIGRAPH_THREAD_LOCAL= -DPRPACK_IGRAPH_SUPPORT -DHAVE_GFORTRAN=1 -D_GNU_SOURCE=1 -I'/home/omnipath/local/R/4.4-3.20/cpp11/include' -fvisibility=hidden -fpic -g -O2 -fno-omit-frame-pointer -mno-omit-leaf-frame-pointer -ffile-prefix-map=/build/r-base-EawLoD/r-base-4.4.1=. -fstack-protector-strong -fstack-clash-protection -Wformat -Werror=format-security -fcf-protection -fdebug-prefix-map=/build/r-base-EawLoD/r-base-4.4.1=/usr/src/r-base-4.4.1-1.2404.0 -Wdate-time -D_FORTIFY_SOURCE=3 -c vendor/cigraph/src/core/genheap.c -o vendor/cigraph/src/core/genheap.o gcc -I"/usr/share/R/include" -DNDEBUG -DUSING_R -I. -Ivendor -Ivendor/cigraph/src -Ivendor/cigraph/include -Ivendor/cigraph/vendor -Ivendor/io/parsers -I/usr/include/libxml2 -DHAVE_LIBXML -DNDEBUG -DNTIMER -DNPRINT -DIGRAPH_THREAD_LOCAL= -DPRPACK_IGRAPH_SUPPORT -DHAVE_GFORTRAN=1 -D_GNU_SOURCE=1 -I'/home/omnipath/local/R/4.4-3.20/cpp11/include' -fvisibility=hidden -fpic -g -O2 -fno-omit-frame-pointer -mno-omit-leaf-frame-pointer -ffile-prefix-map=/build/r-base-EawLoD/r-base-4.4.1=. -fstack-protector-strong -fstack-clash-protection -Wformat -Werror=format-security -fcf-protection -fdebug-prefix-map=/build/r-base-EawLoD/r-base-4.4.1=/usr/src/r-base-4.4.1-1.2404.0 -Wdate-time -D_FORTIFY_SOURCE=3 -c vendor/cigraph/src/core/grid.c -o vendor/cigraph/src/core/grid.o gcc -I"/usr/share/R/include" -DNDEBUG -DUSING_R -I. -Ivendor -Ivendor/cigraph/src -Ivendor/cigraph/include -Ivendor/cigraph/vendor -Ivendor/io/parsers -I/usr/include/libxml2 -DHAVE_LIBXML -DNDEBUG -DNTIMER -DNPRINT -DIGRAPH_THREAD_LOCAL= -DPRPACK_IGRAPH_SUPPORT -DHAVE_GFORTRAN=1 -D_GNU_SOURCE=1 -I'/home/omnipath/local/R/4.4-3.20/cpp11/include' -fvisibility=hidden -fpic -g -O2 -fno-omit-frame-pointer -mno-omit-leaf-frame-pointer -ffile-prefix-map=/build/r-base-EawLoD/r-base-4.4.1=. -fstack-protector-strong -fstack-clash-protection -Wformat -Werror=format-security -fcf-protection -fdebug-prefix-map=/build/r-base-EawLoD/r-base-4.4.1=/usr/src/r-base-4.4.1-1.2404.0 -Wdate-time -D_FORTIFY_SOURCE=3 -c vendor/cigraph/src/core/heap.c -o vendor/cigraph/src/core/heap.o gcc -I"/usr/share/R/include" -DNDEBUG -DUSING_R -I. -Ivendor -Ivendor/cigraph/src -Ivendor/cigraph/include -Ivendor/cigraph/vendor -Ivendor/io/parsers -I/usr/include/libxml2 -DHAVE_LIBXML -DNDEBUG -DNTIMER -DNPRINT -DIGRAPH_THREAD_LOCAL= -DPRPACK_IGRAPH_SUPPORT -DHAVE_GFORTRAN=1 -D_GNU_SOURCE=1 -I'/home/omnipath/local/R/4.4-3.20/cpp11/include' -fvisibility=hidden -fpic -g -O2 -fno-omit-frame-pointer -mno-omit-leaf-frame-pointer -ffile-prefix-map=/build/r-base-EawLoD/r-base-4.4.1=. -fstack-protector-strong -fstack-clash-protection -Wformat -Werror=format-security -fcf-protection -fdebug-prefix-map=/build/r-base-EawLoD/r-base-4.4.1=/usr/src/r-base-4.4.1-1.2404.0 -Wdate-time -D_FORTIFY_SOURCE=3 -c vendor/cigraph/src/core/indheap.c -o vendor/cigraph/src/core/indheap.o gcc -I"/usr/share/R/include" -DNDEBUG -DUSING_R -I. -Ivendor -Ivendor/cigraph/src -Ivendor/cigraph/include -Ivendor/cigraph/vendor -Ivendor/io/parsers -I/usr/include/libxml2 -DHAVE_LIBXML -DNDEBUG -DNTIMER -DNPRINT -DIGRAPH_THREAD_LOCAL= -DPRPACK_IGRAPH_SUPPORT -DHAVE_GFORTRAN=1 -D_GNU_SOURCE=1 -I'/home/omnipath/local/R/4.4-3.20/cpp11/include' -fvisibility=hidden -fpic -g -O2 -fno-omit-frame-pointer -mno-omit-leaf-frame-pointer -ffile-prefix-map=/build/r-base-EawLoD/r-base-4.4.1=. -fstack-protector-strong -fstack-clash-protection -Wformat -Werror=format-security -fcf-protection -fdebug-prefix-map=/build/r-base-EawLoD/r-base-4.4.1=/usr/src/r-base-4.4.1-1.2404.0 -Wdate-time -D_FORTIFY_SOURCE=3 -c vendor/cigraph/src/core/interruption.c -o vendor/cigraph/src/core/interruption.o gcc -I"/usr/share/R/include" -DNDEBUG -DUSING_R -I. -Ivendor -Ivendor/cigraph/src -Ivendor/cigraph/include -Ivendor/cigraph/vendor -Ivendor/io/parsers -I/usr/include/libxml2 -DHAVE_LIBXML -DNDEBUG -DNTIMER -DNPRINT -DIGRAPH_THREAD_LOCAL= -DPRPACK_IGRAPH_SUPPORT -DHAVE_GFORTRAN=1 -D_GNU_SOURCE=1 -I'/home/omnipath/local/R/4.4-3.20/cpp11/include' -fvisibility=hidden -fpic -g -O2 -fno-omit-frame-pointer -mno-omit-leaf-frame-pointer -ffile-prefix-map=/build/r-base-EawLoD/r-base-4.4.1=. -fstack-protector-strong -fstack-clash-protection -Wformat -Werror=format-security -fcf-protection -fdebug-prefix-map=/build/r-base-EawLoD/r-base-4.4.1=/usr/src/r-base-4.4.1-1.2404.0 -Wdate-time -D_FORTIFY_SOURCE=3 -c vendor/cigraph/src/core/marked_queue.c -o vendor/cigraph/src/core/marked_queue.o gcc -I"/usr/share/R/include" -DNDEBUG -DUSING_R -I. -Ivendor -Ivendor/cigraph/src -Ivendor/cigraph/include -Ivendor/cigraph/vendor -Ivendor/io/parsers -I/usr/include/libxml2 -DHAVE_LIBXML -DNDEBUG -DNTIMER -DNPRINT -DIGRAPH_THREAD_LOCAL= -DPRPACK_IGRAPH_SUPPORT -DHAVE_GFORTRAN=1 -D_GNU_SOURCE=1 -I'/home/omnipath/local/R/4.4-3.20/cpp11/include' -fvisibility=hidden -fpic -g -O2 -fno-omit-frame-pointer -mno-omit-leaf-frame-pointer -ffile-prefix-map=/build/r-base-EawLoD/r-base-4.4.1=. -fstack-protector-strong -fstack-clash-protection -Wformat -Werror=format-security -fcf-protection -fdebug-prefix-map=/build/r-base-EawLoD/r-base-4.4.1=/usr/src/r-base-4.4.1-1.2404.0 -Wdate-time -D_FORTIFY_SOURCE=3 -c vendor/cigraph/src/core/matrix.c -o vendor/cigraph/src/core/matrix.o gcc -I"/usr/share/R/include" -DNDEBUG -DUSING_R -I. -Ivendor -Ivendor/cigraph/src -Ivendor/cigraph/include -Ivendor/cigraph/vendor -Ivendor/io/parsers -I/usr/include/libxml2 -DHAVE_LIBXML -DNDEBUG -DNTIMER -DNPRINT -DIGRAPH_THREAD_LOCAL= -DPRPACK_IGRAPH_SUPPORT -DHAVE_GFORTRAN=1 -D_GNU_SOURCE=1 -I'/home/omnipath/local/R/4.4-3.20/cpp11/include' -fvisibility=hidden -fpic -g -O2 -fno-omit-frame-pointer -mno-omit-leaf-frame-pointer -ffile-prefix-map=/build/r-base-EawLoD/r-base-4.4.1=. -fstack-protector-strong -fstack-clash-protection -Wformat -Werror=format-security -fcf-protection -fdebug-prefix-map=/build/r-base-EawLoD/r-base-4.4.1=/usr/src/r-base-4.4.1-1.2404.0 -Wdate-time -D_FORTIFY_SOURCE=3 -c vendor/cigraph/src/core/matrix_list.c -o vendor/cigraph/src/core/matrix_list.o gcc -I"/usr/share/R/include" -DNDEBUG -DUSING_R -I. -Ivendor -Ivendor/cigraph/src -Ivendor/cigraph/include -Ivendor/cigraph/vendor -Ivendor/io/parsers -I/usr/include/libxml2 -DHAVE_LIBXML -DNDEBUG -DNTIMER -DNPRINT -DIGRAPH_THREAD_LOCAL= -DPRPACK_IGRAPH_SUPPORT -DHAVE_GFORTRAN=1 -D_GNU_SOURCE=1 -I'/home/omnipath/local/R/4.4-3.20/cpp11/include' -fvisibility=hidden -fpic -g -O2 -fno-omit-frame-pointer -mno-omit-leaf-frame-pointer -ffile-prefix-map=/build/r-base-EawLoD/r-base-4.4.1=. -fstack-protector-strong -fstack-clash-protection -Wformat -Werror=format-security -fcf-protection -fdebug-prefix-map=/build/r-base-EawLoD/r-base-4.4.1=/usr/src/r-base-4.4.1-1.2404.0 -Wdate-time -D_FORTIFY_SOURCE=3 -c vendor/cigraph/src/core/memory.c -o vendor/cigraph/src/core/memory.o gcc -I"/usr/share/R/include" -DNDEBUG -DUSING_R -I. -Ivendor -Ivendor/cigraph/src -Ivendor/cigraph/include -Ivendor/cigraph/vendor -Ivendor/io/parsers -I/usr/include/libxml2 -DHAVE_LIBXML -DNDEBUG -DNTIMER -DNPRINT -DIGRAPH_THREAD_LOCAL= -DPRPACK_IGRAPH_SUPPORT -DHAVE_GFORTRAN=1 -D_GNU_SOURCE=1 -I'/home/omnipath/local/R/4.4-3.20/cpp11/include' -fvisibility=hidden -fpic -g -O2 -fno-omit-frame-pointer -mno-omit-leaf-frame-pointer -ffile-prefix-map=/build/r-base-EawLoD/r-base-4.4.1=. -fstack-protector-strong -fstack-clash-protection -Wformat -Werror=format-security -fcf-protection -fdebug-prefix-map=/build/r-base-EawLoD/r-base-4.4.1=/usr/src/r-base-4.4.1-1.2404.0 -Wdate-time -D_FORTIFY_SOURCE=3 -c vendor/cigraph/src/core/printing.c -o vendor/cigraph/src/core/printing.o gcc -I"/usr/share/R/include" -DNDEBUG -DUSING_R -I. -Ivendor -Ivendor/cigraph/src -Ivendor/cigraph/include -Ivendor/cigraph/vendor -Ivendor/io/parsers -I/usr/include/libxml2 -DHAVE_LIBXML -DNDEBUG -DNTIMER -DNPRINT -DIGRAPH_THREAD_LOCAL= -DPRPACK_IGRAPH_SUPPORT -DHAVE_GFORTRAN=1 -D_GNU_SOURCE=1 -I'/home/omnipath/local/R/4.4-3.20/cpp11/include' -fvisibility=hidden -fpic -g -O2 -fno-omit-frame-pointer -mno-omit-leaf-frame-pointer -ffile-prefix-map=/build/r-base-EawLoD/r-base-4.4.1=. -fstack-protector-strong -fstack-clash-protection -Wformat -Werror=format-security -fcf-protection -fdebug-prefix-map=/build/r-base-EawLoD/r-base-4.4.1=/usr/src/r-base-4.4.1-1.2404.0 -Wdate-time -D_FORTIFY_SOURCE=3 -c vendor/cigraph/src/core/progress.c -o vendor/cigraph/src/core/progress.o gcc -I"/usr/share/R/include" -DNDEBUG -DUSING_R -I. -Ivendor -Ivendor/cigraph/src -Ivendor/cigraph/include -Ivendor/cigraph/vendor -Ivendor/io/parsers -I/usr/include/libxml2 -DHAVE_LIBXML -DNDEBUG -DNTIMER -DNPRINT -DIGRAPH_THREAD_LOCAL= -DPRPACK_IGRAPH_SUPPORT -DHAVE_GFORTRAN=1 -D_GNU_SOURCE=1 -I'/home/omnipath/local/R/4.4-3.20/cpp11/include' -fvisibility=hidden -fpic -g -O2 -fno-omit-frame-pointer -mno-omit-leaf-frame-pointer -ffile-prefix-map=/build/r-base-EawLoD/r-base-4.4.1=. -fstack-protector-strong -fstack-clash-protection -Wformat -Werror=format-security -fcf-protection -fdebug-prefix-map=/build/r-base-EawLoD/r-base-4.4.1=/usr/src/r-base-4.4.1-1.2404.0 -Wdate-time -D_FORTIFY_SOURCE=3 -c vendor/cigraph/src/core/psumtree.c -o vendor/cigraph/src/core/psumtree.o gcc -I"/usr/share/R/include" -DNDEBUG -DUSING_R -I. -Ivendor -Ivendor/cigraph/src -Ivendor/cigraph/include -Ivendor/cigraph/vendor -Ivendor/io/parsers -I/usr/include/libxml2 -DHAVE_LIBXML -DNDEBUG -DNTIMER -DNPRINT -DIGRAPH_THREAD_LOCAL= -DPRPACK_IGRAPH_SUPPORT -DHAVE_GFORTRAN=1 -D_GNU_SOURCE=1 -I'/home/omnipath/local/R/4.4-3.20/cpp11/include' -fvisibility=hidden -fpic -g -O2 -fno-omit-frame-pointer -mno-omit-leaf-frame-pointer -ffile-prefix-map=/build/r-base-EawLoD/r-base-4.4.1=. -fstack-protector-strong -fstack-clash-protection -Wformat -Werror=format-security -fcf-protection -fdebug-prefix-map=/build/r-base-EawLoD/r-base-4.4.1=/usr/src/r-base-4.4.1-1.2404.0 -Wdate-time -D_FORTIFY_SOURCE=3 -c vendor/cigraph/src/core/set.c -o vendor/cigraph/src/core/set.o gcc -I"/usr/share/R/include" -DNDEBUG -DUSING_R -I. -Ivendor -Ivendor/cigraph/src -Ivendor/cigraph/include -Ivendor/cigraph/vendor -Ivendor/io/parsers -I/usr/include/libxml2 -DHAVE_LIBXML -DNDEBUG -DNTIMER -DNPRINT -DIGRAPH_THREAD_LOCAL= -DPRPACK_IGRAPH_SUPPORT -DHAVE_GFORTRAN=1 -D_GNU_SOURCE=1 -I'/home/omnipath/local/R/4.4-3.20/cpp11/include' -fvisibility=hidden -fpic -g -O2 -fno-omit-frame-pointer -mno-omit-leaf-frame-pointer -ffile-prefix-map=/build/r-base-EawLoD/r-base-4.4.1=. -fstack-protector-strong -fstack-clash-protection -Wformat -Werror=format-security -fcf-protection -fdebug-prefix-map=/build/r-base-EawLoD/r-base-4.4.1=/usr/src/r-base-4.4.1-1.2404.0 -Wdate-time -D_FORTIFY_SOURCE=3 -c vendor/cigraph/src/core/sparsemat.c -o vendor/cigraph/src/core/sparsemat.o gcc -I"/usr/share/R/include" -DNDEBUG -DUSING_R -I. -Ivendor -Ivendor/cigraph/src -Ivendor/cigraph/include -Ivendor/cigraph/vendor -Ivendor/io/parsers -I/usr/include/libxml2 -DHAVE_LIBXML -DNDEBUG -DNTIMER -DNPRINT -DIGRAPH_THREAD_LOCAL= -DPRPACK_IGRAPH_SUPPORT -DHAVE_GFORTRAN=1 -D_GNU_SOURCE=1 -I'/home/omnipath/local/R/4.4-3.20/cpp11/include' -fvisibility=hidden -fpic -g -O2 -fno-omit-frame-pointer -mno-omit-leaf-frame-pointer -ffile-prefix-map=/build/r-base-EawLoD/r-base-4.4.1=. -fstack-protector-strong -fstack-clash-protection -Wformat -Werror=format-security -fcf-protection -fdebug-prefix-map=/build/r-base-EawLoD/r-base-4.4.1=/usr/src/r-base-4.4.1-1.2404.0 -Wdate-time -D_FORTIFY_SOURCE=3 -c vendor/cigraph/src/core/stack.c -o vendor/cigraph/src/core/stack.o gcc -I"/usr/share/R/include" -DNDEBUG -DUSING_R -I. -Ivendor -Ivendor/cigraph/src -Ivendor/cigraph/include -Ivendor/cigraph/vendor -Ivendor/io/parsers -I/usr/include/libxml2 -DHAVE_LIBXML -DNDEBUG -DNTIMER -DNPRINT -DIGRAPH_THREAD_LOCAL= -DPRPACK_IGRAPH_SUPPORT -DHAVE_GFORTRAN=1 -D_GNU_SOURCE=1 -I'/home/omnipath/local/R/4.4-3.20/cpp11/include' -fvisibility=hidden -fpic -g -O2 -fno-omit-frame-pointer -mno-omit-leaf-frame-pointer -ffile-prefix-map=/build/r-base-EawLoD/r-base-4.4.1=. -fstack-protector-strong -fstack-clash-protection -Wformat -Werror=format-security -fcf-protection -fdebug-prefix-map=/build/r-base-EawLoD/r-base-4.4.1=/usr/src/r-base-4.4.1-1.2404.0 -Wdate-time -D_FORTIFY_SOURCE=3 -c vendor/cigraph/src/core/statusbar.c -o vendor/cigraph/src/core/statusbar.o gcc -I"/usr/share/R/include" -DNDEBUG -DUSING_R -I. -Ivendor -Ivendor/cigraph/src -Ivendor/cigraph/include -Ivendor/cigraph/vendor -Ivendor/io/parsers -I/usr/include/libxml2 -DHAVE_LIBXML -DNDEBUG -DNTIMER -DNPRINT -DIGRAPH_THREAD_LOCAL= -DPRPACK_IGRAPH_SUPPORT -DHAVE_GFORTRAN=1 -D_GNU_SOURCE=1 -I'/home/omnipath/local/R/4.4-3.20/cpp11/include' -fvisibility=hidden -fpic -g -O2 -fno-omit-frame-pointer -mno-omit-leaf-frame-pointer -ffile-prefix-map=/build/r-base-EawLoD/r-base-4.4.1=. -fstack-protector-strong -fstack-clash-protection -Wformat -Werror=format-security -fcf-protection -fdebug-prefix-map=/build/r-base-EawLoD/r-base-4.4.1=/usr/src/r-base-4.4.1-1.2404.0 -Wdate-time -D_FORTIFY_SOURCE=3 -c vendor/cigraph/src/core/strvector.c -o vendor/cigraph/src/core/strvector.o gcc -I"/usr/share/R/include" -DNDEBUG -DUSING_R -I. -Ivendor -Ivendor/cigraph/src -Ivendor/cigraph/include -Ivendor/cigraph/vendor -Ivendor/io/parsers -I/usr/include/libxml2 -DHAVE_LIBXML -DNDEBUG -DNTIMER -DNPRINT -DIGRAPH_THREAD_LOCAL= -DPRPACK_IGRAPH_SUPPORT -DHAVE_GFORTRAN=1 -D_GNU_SOURCE=1 -I'/home/omnipath/local/R/4.4-3.20/cpp11/include' -fvisibility=hidden -fpic -g -O2 -fno-omit-frame-pointer -mno-omit-leaf-frame-pointer -ffile-prefix-map=/build/r-base-EawLoD/r-base-4.4.1=. -fstack-protector-strong -fstack-clash-protection -Wformat -Werror=format-security -fcf-protection -fdebug-prefix-map=/build/r-base-EawLoD/r-base-4.4.1=/usr/src/r-base-4.4.1-1.2404.0 -Wdate-time -D_FORTIFY_SOURCE=3 -c vendor/cigraph/src/core/trie.c -o vendor/cigraph/src/core/trie.o gcc -I"/usr/share/R/include" -DNDEBUG -DUSING_R -I. -Ivendor -Ivendor/cigraph/src -Ivendor/cigraph/include -Ivendor/cigraph/vendor -Ivendor/io/parsers -I/usr/include/libxml2 -DHAVE_LIBXML -DNDEBUG -DNTIMER -DNPRINT -DIGRAPH_THREAD_LOCAL= -DPRPACK_IGRAPH_SUPPORT -DHAVE_GFORTRAN=1 -D_GNU_SOURCE=1 -I'/home/omnipath/local/R/4.4-3.20/cpp11/include' -fvisibility=hidden -fpic -g -O2 -fno-omit-frame-pointer -mno-omit-leaf-frame-pointer -ffile-prefix-map=/build/r-base-EawLoD/r-base-4.4.1=. -fstack-protector-strong -fstack-clash-protection -Wformat -Werror=format-security -fcf-protection -fdebug-prefix-map=/build/r-base-EawLoD/r-base-4.4.1=/usr/src/r-base-4.4.1-1.2404.0 -Wdate-time -D_FORTIFY_SOURCE=3 -c vendor/cigraph/src/core/vector.c -o vendor/cigraph/src/core/vector.o gcc -I"/usr/share/R/include" -DNDEBUG -DUSING_R -I. -Ivendor -Ivendor/cigraph/src -Ivendor/cigraph/include -Ivendor/cigraph/vendor -Ivendor/io/parsers -I/usr/include/libxml2 -DHAVE_LIBXML -DNDEBUG -DNTIMER -DNPRINT -DIGRAPH_THREAD_LOCAL= -DPRPACK_IGRAPH_SUPPORT -DHAVE_GFORTRAN=1 -D_GNU_SOURCE=1 -I'/home/omnipath/local/R/4.4-3.20/cpp11/include' -fvisibility=hidden -fpic -g -O2 -fno-omit-frame-pointer -mno-omit-leaf-frame-pointer -ffile-prefix-map=/build/r-base-EawLoD/r-base-4.4.1=. -fstack-protector-strong -fstack-clash-protection -Wformat -Werror=format-security -fcf-protection -fdebug-prefix-map=/build/r-base-EawLoD/r-base-4.4.1=/usr/src/r-base-4.4.1-1.2404.0 -Wdate-time -D_FORTIFY_SOURCE=3 -c vendor/cigraph/src/core/vector_list.c -o vendor/cigraph/src/core/vector_list.o gcc -I"/usr/share/R/include" -DNDEBUG -DUSING_R -I. -Ivendor -Ivendor/cigraph/src -Ivendor/cigraph/include -Ivendor/cigraph/vendor -Ivendor/io/parsers -I/usr/include/libxml2 -DHAVE_LIBXML -DNDEBUG -DNTIMER -DNPRINT -DIGRAPH_THREAD_LOCAL= -DPRPACK_IGRAPH_SUPPORT -DHAVE_GFORTRAN=1 -D_GNU_SOURCE=1 -I'/home/omnipath/local/R/4.4-3.20/cpp11/include' -fvisibility=hidden -fpic -g -O2 -fno-omit-frame-pointer -mno-omit-leaf-frame-pointer -ffile-prefix-map=/build/r-base-EawLoD/r-base-4.4.1=. -fstack-protector-strong -fstack-clash-protection -Wformat -Werror=format-security -fcf-protection -fdebug-prefix-map=/build/r-base-EawLoD/r-base-4.4.1=/usr/src/r-base-4.4.1-1.2404.0 -Wdate-time -D_FORTIFY_SOURCE=3 -c vendor/cigraph/src/core/vector_ptr.c -o vendor/cigraph/src/core/vector_ptr.o gcc -I"/usr/share/R/include" -DNDEBUG -DUSING_R -I. -Ivendor -Ivendor/cigraph/src -Ivendor/cigraph/include -Ivendor/cigraph/vendor -Ivendor/io/parsers -I/usr/include/libxml2 -DHAVE_LIBXML -DNDEBUG -DNTIMER -DNPRINT -DIGRAPH_THREAD_LOCAL= -DPRPACK_IGRAPH_SUPPORT -DHAVE_GFORTRAN=1 -D_GNU_SOURCE=1 -I'/home/omnipath/local/R/4.4-3.20/cpp11/include' -fvisibility=hidden -fpic -g -O2 -fno-omit-frame-pointer -mno-omit-leaf-frame-pointer -ffile-prefix-map=/build/r-base-EawLoD/r-base-4.4.1=. -fstack-protector-strong -fstack-clash-protection -Wformat -Werror=format-security -fcf-protection -fdebug-prefix-map=/build/r-base-EawLoD/r-base-4.4.1=/usr/src/r-base-4.4.1-1.2404.0 -Wdate-time -D_FORTIFY_SOURCE=3 -c vendor/cigraph/src/flow/flow.c -o vendor/cigraph/src/flow/flow.o gcc -I"/usr/share/R/include" -DNDEBUG -DUSING_R -I. -Ivendor -Ivendor/cigraph/src -Ivendor/cigraph/include -Ivendor/cigraph/vendor -Ivendor/io/parsers -I/usr/include/libxml2 -DHAVE_LIBXML -DNDEBUG -DNTIMER -DNPRINT -DIGRAPH_THREAD_LOCAL= -DPRPACK_IGRAPH_SUPPORT -DHAVE_GFORTRAN=1 -D_GNU_SOURCE=1 -I'/home/omnipath/local/R/4.4-3.20/cpp11/include' -fvisibility=hidden -fpic -g -O2 -fno-omit-frame-pointer -mno-omit-leaf-frame-pointer -ffile-prefix-map=/build/r-base-EawLoD/r-base-4.4.1=. -fstack-protector-strong -fstack-clash-protection -Wformat -Werror=format-security -fcf-protection -fdebug-prefix-map=/build/r-base-EawLoD/r-base-4.4.1=/usr/src/r-base-4.4.1-1.2404.0 -Wdate-time -D_FORTIFY_SOURCE=3 -c vendor/cigraph/src/flow/flow_conversion.c -o vendor/cigraph/src/flow/flow_conversion.o gcc -I"/usr/share/R/include" -DNDEBUG -DUSING_R -I. -Ivendor -Ivendor/cigraph/src -Ivendor/cigraph/include -Ivendor/cigraph/vendor -Ivendor/io/parsers -I/usr/include/libxml2 -DHAVE_LIBXML -DNDEBUG -DNTIMER -DNPRINT -DIGRAPH_THREAD_LOCAL= -DPRPACK_IGRAPH_SUPPORT -DHAVE_GFORTRAN=1 -D_GNU_SOURCE=1 -I'/home/omnipath/local/R/4.4-3.20/cpp11/include' -fvisibility=hidden -fpic -g -O2 -fno-omit-frame-pointer -mno-omit-leaf-frame-pointer -ffile-prefix-map=/build/r-base-EawLoD/r-base-4.4.1=. -fstack-protector-strong -fstack-clash-protection -Wformat -Werror=format-security -fcf-protection -fdebug-prefix-map=/build/r-base-EawLoD/r-base-4.4.1=/usr/src/r-base-4.4.1-1.2404.0 -Wdate-time -D_FORTIFY_SOURCE=3 -c vendor/cigraph/src/flow/st-cuts.c -o vendor/cigraph/src/flow/st-cuts.o gcc -I"/usr/share/R/include" -DNDEBUG -DUSING_R -I. -Ivendor -Ivendor/cigraph/src -Ivendor/cigraph/include -Ivendor/cigraph/vendor -Ivendor/io/parsers -I/usr/include/libxml2 -DHAVE_LIBXML -DNDEBUG -DNTIMER -DNPRINT -DIGRAPH_THREAD_LOCAL= -DPRPACK_IGRAPH_SUPPORT -DHAVE_GFORTRAN=1 -D_GNU_SOURCE=1 -I'/home/omnipath/local/R/4.4-3.20/cpp11/include' -fvisibility=hidden -fpic -g -O2 -fno-omit-frame-pointer -mno-omit-leaf-frame-pointer -ffile-prefix-map=/build/r-base-EawLoD/r-base-4.4.1=. -fstack-protector-strong -fstack-clash-protection -Wformat -Werror=format-security -fcf-protection -fdebug-prefix-map=/build/r-base-EawLoD/r-base-4.4.1=/usr/src/r-base-4.4.1-1.2404.0 -Wdate-time -D_FORTIFY_SOURCE=3 -c vendor/cigraph/src/games/barabasi.c -o vendor/cigraph/src/games/barabasi.o gcc -I"/usr/share/R/include" -DNDEBUG -DUSING_R -I. -Ivendor -Ivendor/cigraph/src -Ivendor/cigraph/include -Ivendor/cigraph/vendor -Ivendor/io/parsers -I/usr/include/libxml2 -DHAVE_LIBXML -DNDEBUG -DNTIMER -DNPRINT -DIGRAPH_THREAD_LOCAL= -DPRPACK_IGRAPH_SUPPORT -DHAVE_GFORTRAN=1 -D_GNU_SOURCE=1 -I'/home/omnipath/local/R/4.4-3.20/cpp11/include' -fvisibility=hidden -fpic -g -O2 -fno-omit-frame-pointer -mno-omit-leaf-frame-pointer -ffile-prefix-map=/build/r-base-EawLoD/r-base-4.4.1=. -fstack-protector-strong -fstack-clash-protection -Wformat -Werror=format-security -fcf-protection -fdebug-prefix-map=/build/r-base-EawLoD/r-base-4.4.1=/usr/src/r-base-4.4.1-1.2404.0 -Wdate-time -D_FORTIFY_SOURCE=3 -c vendor/cigraph/src/games/callaway_traits.c -o vendor/cigraph/src/games/callaway_traits.o gcc -I"/usr/share/R/include" -DNDEBUG -DUSING_R -I. -Ivendor -Ivendor/cigraph/src -Ivendor/cigraph/include -Ivendor/cigraph/vendor -Ivendor/io/parsers -I/usr/include/libxml2 -DHAVE_LIBXML -DNDEBUG -DNTIMER -DNPRINT -DIGRAPH_THREAD_LOCAL= -DPRPACK_IGRAPH_SUPPORT -DHAVE_GFORTRAN=1 -D_GNU_SOURCE=1 -I'/home/omnipath/local/R/4.4-3.20/cpp11/include' -fvisibility=hidden -fpic -g -O2 -fno-omit-frame-pointer -mno-omit-leaf-frame-pointer -ffile-prefix-map=/build/r-base-EawLoD/r-base-4.4.1=. -fstack-protector-strong -fstack-clash-protection -Wformat -Werror=format-security -fcf-protection -fdebug-prefix-map=/build/r-base-EawLoD/r-base-4.4.1=/usr/src/r-base-4.4.1-1.2404.0 -Wdate-time -D_FORTIFY_SOURCE=3 -c vendor/cigraph/src/games/citations.c -o vendor/cigraph/src/games/citations.o gcc -I"/usr/share/R/include" -DNDEBUG -DUSING_R -I. -Ivendor -Ivendor/cigraph/src -Ivendor/cigraph/include -Ivendor/cigraph/vendor -Ivendor/io/parsers -I/usr/include/libxml2 -DHAVE_LIBXML -DNDEBUG -DNTIMER -DNPRINT -DIGRAPH_THREAD_LOCAL= -DPRPACK_IGRAPH_SUPPORT -DHAVE_GFORTRAN=1 -D_GNU_SOURCE=1 -I'/home/omnipath/local/R/4.4-3.20/cpp11/include' -fvisibility=hidden -fpic -g -O2 -fno-omit-frame-pointer -mno-omit-leaf-frame-pointer -ffile-prefix-map=/build/r-base-EawLoD/r-base-4.4.1=. -fstack-protector-strong -fstack-clash-protection -Wformat -Werror=format-security -fcf-protection -fdebug-prefix-map=/build/r-base-EawLoD/r-base-4.4.1=/usr/src/r-base-4.4.1-1.2404.0 -Wdate-time -D_FORTIFY_SOURCE=3 -c vendor/cigraph/src/games/correlated.c -o vendor/cigraph/src/games/correlated.o gcc -I"/usr/share/R/include" -DNDEBUG -DUSING_R -I. -Ivendor -Ivendor/cigraph/src -Ivendor/cigraph/include -Ivendor/cigraph/vendor -Ivendor/io/parsers -I/usr/include/libxml2 -DHAVE_LIBXML -DNDEBUG -DNTIMER -DNPRINT -DIGRAPH_THREAD_LOCAL= -DPRPACK_IGRAPH_SUPPORT -DHAVE_GFORTRAN=1 -D_GNU_SOURCE=1 -I'/home/omnipath/local/R/4.4-3.20/cpp11/include' -fvisibility=hidden -fpic -g -O2 -fno-omit-frame-pointer -mno-omit-leaf-frame-pointer -ffile-prefix-map=/build/r-base-EawLoD/r-base-4.4.1=. -fstack-protector-strong -fstack-clash-protection -Wformat -Werror=format-security -fcf-protection -fdebug-prefix-map=/build/r-base-EawLoD/r-base-4.4.1=/usr/src/r-base-4.4.1-1.2404.0 -Wdate-time -D_FORTIFY_SOURCE=3 -c vendor/cigraph/src/games/degree_sequence.c -o vendor/cigraph/src/games/degree_sequence.o g++ -std=gnu++17 -I"/usr/share/R/include" -DNDEBUG -DUSING_R -I. -Ivendor -Ivendor/cigraph/src -Ivendor/cigraph/include -Ivendor/cigraph/vendor -Ivendor/io/parsers -I/usr/include/libxml2 -DHAVE_LIBXML -DNDEBUG -DNTIMER -DNPRINT -DIGRAPH_THREAD_LOCAL= -DPRPACK_IGRAPH_SUPPORT -DHAVE_GFORTRAN=1 -D_GNU_SOURCE=1 -I'/home/omnipath/local/R/4.4-3.20/cpp11/include' -fvisibility=hidden -fpic -g -O2 -fno-omit-frame-pointer -mno-omit-leaf-frame-pointer -ffile-prefix-map=/build/r-base-EawLoD/r-base-4.4.1=. -fstack-protector-strong -fstack-clash-protection -Wformat -Werror=format-security -fcf-protection -fdebug-prefix-map=/build/r-base-EawLoD/r-base-4.4.1=/usr/src/r-base-4.4.1-1.2404.0 -Wdate-time -D_FORTIFY_SOURCE=3 -c vendor/cigraph/src/games/degree_sequence_vl/gengraph_degree_sequence.cpp -o vendor/cigraph/src/games/degree_sequence_vl/gengraph_degree_sequence.o g++ -std=gnu++17 -I"/usr/share/R/include" -DNDEBUG -DUSING_R -I. -Ivendor -Ivendor/cigraph/src -Ivendor/cigraph/include -Ivendor/cigraph/vendor -Ivendor/io/parsers -I/usr/include/libxml2 -DHAVE_LIBXML -DNDEBUG -DNTIMER -DNPRINT -DIGRAPH_THREAD_LOCAL= -DPRPACK_IGRAPH_SUPPORT -DHAVE_GFORTRAN=1 -D_GNU_SOURCE=1 -I'/home/omnipath/local/R/4.4-3.20/cpp11/include' -fvisibility=hidden -fpic -g -O2 -fno-omit-frame-pointer -mno-omit-leaf-frame-pointer -ffile-prefix-map=/build/r-base-EawLoD/r-base-4.4.1=. -fstack-protector-strong -fstack-clash-protection -Wformat -Werror=format-security -fcf-protection -fdebug-prefix-map=/build/r-base-EawLoD/r-base-4.4.1=/usr/src/r-base-4.4.1-1.2404.0 -Wdate-time -D_FORTIFY_SOURCE=3 -c vendor/cigraph/src/games/degree_sequence_vl/gengraph_graph_molloy_hash.cpp -o vendor/cigraph/src/games/degree_sequence_vl/gengraph_graph_molloy_hash.o g++ -std=gnu++17 -I"/usr/share/R/include" -DNDEBUG -DUSING_R -I. -Ivendor -Ivendor/cigraph/src -Ivendor/cigraph/include -Ivendor/cigraph/vendor -Ivendor/io/parsers -I/usr/include/libxml2 -DHAVE_LIBXML -DNDEBUG -DNTIMER -DNPRINT -DIGRAPH_THREAD_LOCAL= -DPRPACK_IGRAPH_SUPPORT -DHAVE_GFORTRAN=1 -D_GNU_SOURCE=1 -I'/home/omnipath/local/R/4.4-3.20/cpp11/include' -fvisibility=hidden -fpic -g -O2 -fno-omit-frame-pointer -mno-omit-leaf-frame-pointer -ffile-prefix-map=/build/r-base-EawLoD/r-base-4.4.1=. -fstack-protector-strong -fstack-clash-protection -Wformat -Werror=format-security -fcf-protection -fdebug-prefix-map=/build/r-base-EawLoD/r-base-4.4.1=/usr/src/r-base-4.4.1-1.2404.0 -Wdate-time -D_FORTIFY_SOURCE=3 -c vendor/cigraph/src/games/degree_sequence_vl/gengraph_graph_molloy_optimized.cpp -o vendor/cigraph/src/games/degree_sequence_vl/gengraph_graph_molloy_optimized.o g++ -std=gnu++17 -I"/usr/share/R/include" -DNDEBUG -DUSING_R -I. -Ivendor -Ivendor/cigraph/src -Ivendor/cigraph/include -Ivendor/cigraph/vendor -Ivendor/io/parsers -I/usr/include/libxml2 -DHAVE_LIBXML -DNDEBUG -DNTIMER -DNPRINT -DIGRAPH_THREAD_LOCAL= -DPRPACK_IGRAPH_SUPPORT -DHAVE_GFORTRAN=1 -D_GNU_SOURCE=1 -I'/home/omnipath/local/R/4.4-3.20/cpp11/include' -fvisibility=hidden -fpic -g -O2 -fno-omit-frame-pointer -mno-omit-leaf-frame-pointer -ffile-prefix-map=/build/r-base-EawLoD/r-base-4.4.1=. -fstack-protector-strong -fstack-clash-protection -Wformat -Werror=format-security -fcf-protection -fdebug-prefix-map=/build/r-base-EawLoD/r-base-4.4.1=/usr/src/r-base-4.4.1-1.2404.0 -Wdate-time -D_FORTIFY_SOURCE=3 -c vendor/cigraph/src/games/degree_sequence_vl/gengraph_mr-connected.cpp -o vendor/cigraph/src/games/degree_sequence_vl/gengraph_mr-connected.o g++ -std=gnu++17 -I"/usr/share/R/include" -DNDEBUG -DUSING_R -I. -Ivendor -Ivendor/cigraph/src -Ivendor/cigraph/include -Ivendor/cigraph/vendor -Ivendor/io/parsers -I/usr/include/libxml2 -DHAVE_LIBXML -DNDEBUG -DNTIMER -DNPRINT -DIGRAPH_THREAD_LOCAL= -DPRPACK_IGRAPH_SUPPORT -DHAVE_GFORTRAN=1 -D_GNU_SOURCE=1 -I'/home/omnipath/local/R/4.4-3.20/cpp11/include' -fvisibility=hidden -fpic -g -O2 -fno-omit-frame-pointer -mno-omit-leaf-frame-pointer -ffile-prefix-map=/build/r-base-EawLoD/r-base-4.4.1=. -fstack-protector-strong -fstack-clash-protection -Wformat -Werror=format-security -fcf-protection -fdebug-prefix-map=/build/r-base-EawLoD/r-base-4.4.1=/usr/src/r-base-4.4.1-1.2404.0 -Wdate-time -D_FORTIFY_SOURCE=3 -c vendor/cigraph/src/games/degree_sequence_vl/gengraph_random.cpp -o vendor/cigraph/src/games/degree_sequence_vl/gengraph_random.o gcc -I"/usr/share/R/include" -DNDEBUG -DUSING_R -I. -Ivendor -Ivendor/cigraph/src -Ivendor/cigraph/include -Ivendor/cigraph/vendor -Ivendor/io/parsers -I/usr/include/libxml2 -DHAVE_LIBXML -DNDEBUG -DNTIMER -DNPRINT -DIGRAPH_THREAD_LOCAL= -DPRPACK_IGRAPH_SUPPORT -DHAVE_GFORTRAN=1 -D_GNU_SOURCE=1 -I'/home/omnipath/local/R/4.4-3.20/cpp11/include' -fvisibility=hidden -fpic -g -O2 -fno-omit-frame-pointer -mno-omit-leaf-frame-pointer -ffile-prefix-map=/build/r-base-EawLoD/r-base-4.4.1=. -fstack-protector-strong -fstack-clash-protection -Wformat -Werror=format-security -fcf-protection -fdebug-prefix-map=/build/r-base-EawLoD/r-base-4.4.1=/usr/src/r-base-4.4.1-1.2404.0 -Wdate-time -D_FORTIFY_SOURCE=3 -c vendor/cigraph/src/games/dotproduct.c -o vendor/cigraph/src/games/dotproduct.o gcc -I"/usr/share/R/include" -DNDEBUG -DUSING_R -I. -Ivendor -Ivendor/cigraph/src -Ivendor/cigraph/include -Ivendor/cigraph/vendor -Ivendor/io/parsers -I/usr/include/libxml2 -DHAVE_LIBXML -DNDEBUG -DNTIMER -DNPRINT -DIGRAPH_THREAD_LOCAL= -DPRPACK_IGRAPH_SUPPORT -DHAVE_GFORTRAN=1 -D_GNU_SOURCE=1 -I'/home/omnipath/local/R/4.4-3.20/cpp11/include' -fvisibility=hidden -fpic -g -O2 -fno-omit-frame-pointer -mno-omit-leaf-frame-pointer -ffile-prefix-map=/build/r-base-EawLoD/r-base-4.4.1=. -fstack-protector-strong -fstack-clash-protection -Wformat -Werror=format-security -fcf-protection -fdebug-prefix-map=/build/r-base-EawLoD/r-base-4.4.1=/usr/src/r-base-4.4.1-1.2404.0 -Wdate-time -D_FORTIFY_SOURCE=3 -c vendor/cigraph/src/games/erdos_renyi.c -o vendor/cigraph/src/games/erdos_renyi.o gcc -I"/usr/share/R/include" -DNDEBUG -DUSING_R -I. -Ivendor -Ivendor/cigraph/src -Ivendor/cigraph/include -Ivendor/cigraph/vendor -Ivendor/io/parsers -I/usr/include/libxml2 -DHAVE_LIBXML -DNDEBUG -DNTIMER -DNPRINT -DIGRAPH_THREAD_LOCAL= -DPRPACK_IGRAPH_SUPPORT -DHAVE_GFORTRAN=1 -D_GNU_SOURCE=1 -I'/home/omnipath/local/R/4.4-3.20/cpp11/include' -fvisibility=hidden -fpic -g -O2 -fno-omit-frame-pointer -mno-omit-leaf-frame-pointer -ffile-prefix-map=/build/r-base-EawLoD/r-base-4.4.1=. -fstack-protector-strong -fstack-clash-protection -Wformat -Werror=format-security -fcf-protection -fdebug-prefix-map=/build/r-base-EawLoD/r-base-4.4.1=/usr/src/r-base-4.4.1-1.2404.0 -Wdate-time -D_FORTIFY_SOURCE=3 -c vendor/cigraph/src/games/establishment.c -o vendor/cigraph/src/games/establishment.o gcc -I"/usr/share/R/include" -DNDEBUG -DUSING_R -I. -Ivendor -Ivendor/cigraph/src -Ivendor/cigraph/include -Ivendor/cigraph/vendor -Ivendor/io/parsers -I/usr/include/libxml2 -DHAVE_LIBXML -DNDEBUG -DNTIMER -DNPRINT -DIGRAPH_THREAD_LOCAL= -DPRPACK_IGRAPH_SUPPORT -DHAVE_GFORTRAN=1 -D_GNU_SOURCE=1 -I'/home/omnipath/local/R/4.4-3.20/cpp11/include' -fvisibility=hidden -fpic -g -O2 -fno-omit-frame-pointer -mno-omit-leaf-frame-pointer -ffile-prefix-map=/build/r-base-EawLoD/r-base-4.4.1=. -fstack-protector-strong -fstack-clash-protection -Wformat -Werror=format-security -fcf-protection -fdebug-prefix-map=/build/r-base-EawLoD/r-base-4.4.1=/usr/src/r-base-4.4.1-1.2404.0 -Wdate-time -D_FORTIFY_SOURCE=3 -c vendor/cigraph/src/games/forestfire.c -o vendor/cigraph/src/games/forestfire.o gcc -I"/usr/share/R/include" -DNDEBUG -DUSING_R -I. -Ivendor -Ivendor/cigraph/src -Ivendor/cigraph/include -Ivendor/cigraph/vendor -Ivendor/io/parsers -I/usr/include/libxml2 -DHAVE_LIBXML -DNDEBUG -DNTIMER -DNPRINT -DIGRAPH_THREAD_LOCAL= -DPRPACK_IGRAPH_SUPPORT -DHAVE_GFORTRAN=1 -D_GNU_SOURCE=1 -I'/home/omnipath/local/R/4.4-3.20/cpp11/include' -fvisibility=hidden -fpic -g -O2 -fno-omit-frame-pointer -mno-omit-leaf-frame-pointer -ffile-prefix-map=/build/r-base-EawLoD/r-base-4.4.1=. -fstack-protector-strong -fstack-clash-protection -Wformat -Werror=format-security -fcf-protection -fdebug-prefix-map=/build/r-base-EawLoD/r-base-4.4.1=/usr/src/r-base-4.4.1-1.2404.0 -Wdate-time -D_FORTIFY_SOURCE=3 -c vendor/cigraph/src/games/grg.c -o vendor/cigraph/src/games/grg.o gcc -I"/usr/share/R/include" -DNDEBUG -DUSING_R -I. -Ivendor -Ivendor/cigraph/src -Ivendor/cigraph/include -Ivendor/cigraph/vendor -Ivendor/io/parsers -I/usr/include/libxml2 -DHAVE_LIBXML -DNDEBUG -DNTIMER -DNPRINT -DIGRAPH_THREAD_LOCAL= -DPRPACK_IGRAPH_SUPPORT -DHAVE_GFORTRAN=1 -D_GNU_SOURCE=1 -I'/home/omnipath/local/R/4.4-3.20/cpp11/include' -fvisibility=hidden -fpic -g -O2 -fno-omit-frame-pointer -mno-omit-leaf-frame-pointer -ffile-prefix-map=/build/r-base-EawLoD/r-base-4.4.1=. -fstack-protector-strong -fstack-clash-protection -Wformat -Werror=format-security -fcf-protection -fdebug-prefix-map=/build/r-base-EawLoD/r-base-4.4.1=/usr/src/r-base-4.4.1-1.2404.0 -Wdate-time -D_FORTIFY_SOURCE=3 -c vendor/cigraph/src/games/growing_random.c -o vendor/cigraph/src/games/growing_random.o gcc -I"/usr/share/R/include" -DNDEBUG -DUSING_R -I. -Ivendor -Ivendor/cigraph/src -Ivendor/cigraph/include -Ivendor/cigraph/vendor -Ivendor/io/parsers -I/usr/include/libxml2 -DHAVE_LIBXML -DNDEBUG -DNTIMER -DNPRINT -DIGRAPH_THREAD_LOCAL= -DPRPACK_IGRAPH_SUPPORT -DHAVE_GFORTRAN=1 -D_GNU_SOURCE=1 -I'/home/omnipath/local/R/4.4-3.20/cpp11/include' -fvisibility=hidden -fpic -g -O2 -fno-omit-frame-pointer -mno-omit-leaf-frame-pointer -ffile-prefix-map=/build/r-base-EawLoD/r-base-4.4.1=. -fstack-protector-strong -fstack-clash-protection -Wformat -Werror=format-security -fcf-protection -fdebug-prefix-map=/build/r-base-EawLoD/r-base-4.4.1=/usr/src/r-base-4.4.1-1.2404.0 -Wdate-time -D_FORTIFY_SOURCE=3 -c vendor/cigraph/src/games/islands.c -o vendor/cigraph/src/games/islands.o gcc -I"/usr/share/R/include" -DNDEBUG -DUSING_R -I. -Ivendor -Ivendor/cigraph/src -Ivendor/cigraph/include -Ivendor/cigraph/vendor -Ivendor/io/parsers -I/usr/include/libxml2 -DHAVE_LIBXML -DNDEBUG -DNTIMER -DNPRINT -DIGRAPH_THREAD_LOCAL= -DPRPACK_IGRAPH_SUPPORT -DHAVE_GFORTRAN=1 -D_GNU_SOURCE=1 -I'/home/omnipath/local/R/4.4-3.20/cpp11/include' -fvisibility=hidden -fpic -g -O2 -fno-omit-frame-pointer -mno-omit-leaf-frame-pointer -ffile-prefix-map=/build/r-base-EawLoD/r-base-4.4.1=. -fstack-protector-strong -fstack-clash-protection -Wformat -Werror=format-security -fcf-protection -fdebug-prefix-map=/build/r-base-EawLoD/r-base-4.4.1=/usr/src/r-base-4.4.1-1.2404.0 -Wdate-time -D_FORTIFY_SOURCE=3 -c vendor/cigraph/src/games/k_regular.c -o vendor/cigraph/src/games/k_regular.o gcc -I"/usr/share/R/include" -DNDEBUG -DUSING_R -I. -Ivendor -Ivendor/cigraph/src -Ivendor/cigraph/include -Ivendor/cigraph/vendor -Ivendor/io/parsers -I/usr/include/libxml2 -DHAVE_LIBXML -DNDEBUG -DNTIMER -DNPRINT -DIGRAPH_THREAD_LOCAL= -DPRPACK_IGRAPH_SUPPORT -DHAVE_GFORTRAN=1 -D_GNU_SOURCE=1 -I'/home/omnipath/local/R/4.4-3.20/cpp11/include' -fvisibility=hidden -fpic -g -O2 -fno-omit-frame-pointer -mno-omit-leaf-frame-pointer -ffile-prefix-map=/build/r-base-EawLoD/r-base-4.4.1=. -fstack-protector-strong -fstack-clash-protection -Wformat -Werror=format-security -fcf-protection -fdebug-prefix-map=/build/r-base-EawLoD/r-base-4.4.1=/usr/src/r-base-4.4.1-1.2404.0 -Wdate-time -D_FORTIFY_SOURCE=3 -c vendor/cigraph/src/games/preference.c -o vendor/cigraph/src/games/preference.o gcc -I"/usr/share/R/include" -DNDEBUG -DUSING_R -I. -Ivendor -Ivendor/cigraph/src -Ivendor/cigraph/include -Ivendor/cigraph/vendor -Ivendor/io/parsers -I/usr/include/libxml2 -DHAVE_LIBXML -DNDEBUG -DNTIMER -DNPRINT -DIGRAPH_THREAD_LOCAL= -DPRPACK_IGRAPH_SUPPORT -DHAVE_GFORTRAN=1 -D_GNU_SOURCE=1 -I'/home/omnipath/local/R/4.4-3.20/cpp11/include' -fvisibility=hidden -fpic -g -O2 -fno-omit-frame-pointer -mno-omit-leaf-frame-pointer -ffile-prefix-map=/build/r-base-EawLoD/r-base-4.4.1=. -fstack-protector-strong -fstack-clash-protection -Wformat -Werror=format-security -fcf-protection -fdebug-prefix-map=/build/r-base-EawLoD/r-base-4.4.1=/usr/src/r-base-4.4.1-1.2404.0 -Wdate-time -D_FORTIFY_SOURCE=3 -c vendor/cigraph/src/games/recent_degree.c -o vendor/cigraph/src/games/recent_degree.o gcc -I"/usr/share/R/include" -DNDEBUG -DUSING_R -I. -Ivendor -Ivendor/cigraph/src -Ivendor/cigraph/include -Ivendor/cigraph/vendor -Ivendor/io/parsers -I/usr/include/libxml2 -DHAVE_LIBXML -DNDEBUG -DNTIMER -DNPRINT -DIGRAPH_THREAD_LOCAL= -DPRPACK_IGRAPH_SUPPORT -DHAVE_GFORTRAN=1 -D_GNU_SOURCE=1 -I'/home/omnipath/local/R/4.4-3.20/cpp11/include' -fvisibility=hidden -fpic -g -O2 -fno-omit-frame-pointer -mno-omit-leaf-frame-pointer -ffile-prefix-map=/build/r-base-EawLoD/r-base-4.4.1=. -fstack-protector-strong -fstack-clash-protection -Wformat -Werror=format-security -fcf-protection -fdebug-prefix-map=/build/r-base-EawLoD/r-base-4.4.1=/usr/src/r-base-4.4.1-1.2404.0 -Wdate-time -D_FORTIFY_SOURCE=3 -c vendor/cigraph/src/games/sbm.c -o vendor/cigraph/src/games/sbm.o gcc -I"/usr/share/R/include" -DNDEBUG -DUSING_R -I. -Ivendor -Ivendor/cigraph/src -Ivendor/cigraph/include -Ivendor/cigraph/vendor -Ivendor/io/parsers -I/usr/include/libxml2 -DHAVE_LIBXML -DNDEBUG -DNTIMER -DNPRINT -DIGRAPH_THREAD_LOCAL= -DPRPACK_IGRAPH_SUPPORT -DHAVE_GFORTRAN=1 -D_GNU_SOURCE=1 -I'/home/omnipath/local/R/4.4-3.20/cpp11/include' -fvisibility=hidden -fpic -g -O2 -fno-omit-frame-pointer -mno-omit-leaf-frame-pointer -ffile-prefix-map=/build/r-base-EawLoD/r-base-4.4.1=. -fstack-protector-strong -fstack-clash-protection -Wformat -Werror=format-security -fcf-protection -fdebug-prefix-map=/build/r-base-EawLoD/r-base-4.4.1=/usr/src/r-base-4.4.1-1.2404.0 -Wdate-time -D_FORTIFY_SOURCE=3 -c vendor/cigraph/src/games/static_fitness.c -o vendor/cigraph/src/games/static_fitness.o gcc -I"/usr/share/R/include" -DNDEBUG -DUSING_R -I. -Ivendor -Ivendor/cigraph/src -Ivendor/cigraph/include -Ivendor/cigraph/vendor -Ivendor/io/parsers -I/usr/include/libxml2 -DHAVE_LIBXML -DNDEBUG -DNTIMER -DNPRINT -DIGRAPH_THREAD_LOCAL= -DPRPACK_IGRAPH_SUPPORT -DHAVE_GFORTRAN=1 -D_GNU_SOURCE=1 -I'/home/omnipath/local/R/4.4-3.20/cpp11/include' -fvisibility=hidden -fpic -g -O2 -fno-omit-frame-pointer -mno-omit-leaf-frame-pointer -ffile-prefix-map=/build/r-base-EawLoD/r-base-4.4.1=. -fstack-protector-strong -fstack-clash-protection -Wformat -Werror=format-security -fcf-protection -fdebug-prefix-map=/build/r-base-EawLoD/r-base-4.4.1=/usr/src/r-base-4.4.1-1.2404.0 -Wdate-time -D_FORTIFY_SOURCE=3 -c vendor/cigraph/src/games/tree.c -o vendor/cigraph/src/games/tree.o gcc -I"/usr/share/R/include" -DNDEBUG -DUSING_R -I. -Ivendor -Ivendor/cigraph/src -Ivendor/cigraph/include -Ivendor/cigraph/vendor -Ivendor/io/parsers -I/usr/include/libxml2 -DHAVE_LIBXML -DNDEBUG -DNTIMER -DNPRINT -DIGRAPH_THREAD_LOCAL= -DPRPACK_IGRAPH_SUPPORT -DHAVE_GFORTRAN=1 -D_GNU_SOURCE=1 -I'/home/omnipath/local/R/4.4-3.20/cpp11/include' -fvisibility=hidden -fpic -g -O2 -fno-omit-frame-pointer -mno-omit-leaf-frame-pointer -ffile-prefix-map=/build/r-base-EawLoD/r-base-4.4.1=. -fstack-protector-strong -fstack-clash-protection -Wformat -Werror=format-security -fcf-protection -fdebug-prefix-map=/build/r-base-EawLoD/r-base-4.4.1=/usr/src/r-base-4.4.1-1.2404.0 -Wdate-time -D_FORTIFY_SOURCE=3 -c vendor/cigraph/src/games/watts_strogatz.c -o vendor/cigraph/src/games/watts_strogatz.o gcc -I"/usr/share/R/include" -DNDEBUG -DUSING_R -I. -Ivendor -Ivendor/cigraph/src -Ivendor/cigraph/include -Ivendor/cigraph/vendor -Ivendor/io/parsers -I/usr/include/libxml2 -DHAVE_LIBXML -DNDEBUG -DNTIMER -DNPRINT -DIGRAPH_THREAD_LOCAL= -DPRPACK_IGRAPH_SUPPORT -DHAVE_GFORTRAN=1 -D_GNU_SOURCE=1 -I'/home/omnipath/local/R/4.4-3.20/cpp11/include' -fvisibility=hidden -fpic -g -O2 -fno-omit-frame-pointer -mno-omit-leaf-frame-pointer -ffile-prefix-map=/build/r-base-EawLoD/r-base-4.4.1=. -fstack-protector-strong -fstack-clash-protection -Wformat -Werror=format-security -fcf-protection -fdebug-prefix-map=/build/r-base-EawLoD/r-base-4.4.1=/usr/src/r-base-4.4.1-1.2404.0 -Wdate-time -D_FORTIFY_SOURCE=3 -c vendor/cigraph/src/graph/adjlist.c -o vendor/cigraph/src/graph/adjlist.o gcc -I"/usr/share/R/include" -DNDEBUG -DUSING_R -I. -Ivendor -Ivendor/cigraph/src -Ivendor/cigraph/include -Ivendor/cigraph/vendor -Ivendor/io/parsers -I/usr/include/libxml2 -DHAVE_LIBXML -DNDEBUG -DNTIMER -DNPRINT -DIGRAPH_THREAD_LOCAL= -DPRPACK_IGRAPH_SUPPORT -DHAVE_GFORTRAN=1 -D_GNU_SOURCE=1 -I'/home/omnipath/local/R/4.4-3.20/cpp11/include' -fvisibility=hidden -fpic -g -O2 -fno-omit-frame-pointer -mno-omit-leaf-frame-pointer -ffile-prefix-map=/build/r-base-EawLoD/r-base-4.4.1=. -fstack-protector-strong -fstack-clash-protection -Wformat -Werror=format-security -fcf-protection -fdebug-prefix-map=/build/r-base-EawLoD/r-base-4.4.1=/usr/src/r-base-4.4.1-1.2404.0 -Wdate-time -D_FORTIFY_SOURCE=3 -c vendor/cigraph/src/graph/attributes.c -o vendor/cigraph/src/graph/attributes.o gcc -I"/usr/share/R/include" -DNDEBUG -DUSING_R -I. -Ivendor -Ivendor/cigraph/src -Ivendor/cigraph/include -Ivendor/cigraph/vendor -Ivendor/io/parsers -I/usr/include/libxml2 -DHAVE_LIBXML -DNDEBUG -DNTIMER -DNPRINT -DIGRAPH_THREAD_LOCAL= -DPRPACK_IGRAPH_SUPPORT -DHAVE_GFORTRAN=1 -D_GNU_SOURCE=1 -I'/home/omnipath/local/R/4.4-3.20/cpp11/include' -fvisibility=hidden -fpic -g -O2 -fno-omit-frame-pointer -mno-omit-leaf-frame-pointer -ffile-prefix-map=/build/r-base-EawLoD/r-base-4.4.1=. -fstack-protector-strong -fstack-clash-protection -Wformat -Werror=format-security -fcf-protection -fdebug-prefix-map=/build/r-base-EawLoD/r-base-4.4.1=/usr/src/r-base-4.4.1-1.2404.0 -Wdate-time -D_FORTIFY_SOURCE=3 -c vendor/cigraph/src/graph/basic_query.c -o vendor/cigraph/src/graph/basic_query.o gcc -I"/usr/share/R/include" -DNDEBUG -DUSING_R -I. -Ivendor -Ivendor/cigraph/src -Ivendor/cigraph/include -Ivendor/cigraph/vendor -Ivendor/io/parsers -I/usr/include/libxml2 -DHAVE_LIBXML -DNDEBUG -DNTIMER -DNPRINT -DIGRAPH_THREAD_LOCAL= -DPRPACK_IGRAPH_SUPPORT -DHAVE_GFORTRAN=1 -D_GNU_SOURCE=1 -I'/home/omnipath/local/R/4.4-3.20/cpp11/include' -fvisibility=hidden -fpic -g -O2 -fno-omit-frame-pointer -mno-omit-leaf-frame-pointer -ffile-prefix-map=/build/r-base-EawLoD/r-base-4.4.1=. -fstack-protector-strong -fstack-clash-protection -Wformat -Werror=format-security -fcf-protection -fdebug-prefix-map=/build/r-base-EawLoD/r-base-4.4.1=/usr/src/r-base-4.4.1-1.2404.0 -Wdate-time -D_FORTIFY_SOURCE=3 -c vendor/cigraph/src/graph/caching.c -o vendor/cigraph/src/graph/caching.o gcc -I"/usr/share/R/include" -DNDEBUG -DUSING_R -I. -Ivendor -Ivendor/cigraph/src -Ivendor/cigraph/include -Ivendor/cigraph/vendor -Ivendor/io/parsers -I/usr/include/libxml2 -DHAVE_LIBXML -DNDEBUG -DNTIMER -DNPRINT -DIGRAPH_THREAD_LOCAL= -DPRPACK_IGRAPH_SUPPORT -DHAVE_GFORTRAN=1 -D_GNU_SOURCE=1 -I'/home/omnipath/local/R/4.4-3.20/cpp11/include' -fvisibility=hidden -fpic -g -O2 -fno-omit-frame-pointer -mno-omit-leaf-frame-pointer -ffile-prefix-map=/build/r-base-EawLoD/r-base-4.4.1=. -fstack-protector-strong -fstack-clash-protection -Wformat -Werror=format-security -fcf-protection -fdebug-prefix-map=/build/r-base-EawLoD/r-base-4.4.1=/usr/src/r-base-4.4.1-1.2404.0 -Wdate-time -D_FORTIFY_SOURCE=3 -c vendor/cigraph/src/graph/cattributes.c -o vendor/cigraph/src/graph/cattributes.o gcc -I"/usr/share/R/include" -DNDEBUG -DUSING_R -I. -Ivendor -Ivendor/cigraph/src -Ivendor/cigraph/include -Ivendor/cigraph/vendor -Ivendor/io/parsers -I/usr/include/libxml2 -DHAVE_LIBXML -DNDEBUG -DNTIMER -DNPRINT -DIGRAPH_THREAD_LOCAL= -DPRPACK_IGRAPH_SUPPORT -DHAVE_GFORTRAN=1 -D_GNU_SOURCE=1 -I'/home/omnipath/local/R/4.4-3.20/cpp11/include' -fvisibility=hidden -fpic -g -O2 -fno-omit-frame-pointer -mno-omit-leaf-frame-pointer -ffile-prefix-map=/build/r-base-EawLoD/r-base-4.4.1=. -fstack-protector-strong -fstack-clash-protection -Wformat -Werror=format-security -fcf-protection -fdebug-prefix-map=/build/r-base-EawLoD/r-base-4.4.1=/usr/src/r-base-4.4.1-1.2404.0 -Wdate-time -D_FORTIFY_SOURCE=3 -c vendor/cigraph/src/graph/graph_list.c -o vendor/cigraph/src/graph/graph_list.o gcc -I"/usr/share/R/include" -DNDEBUG -DUSING_R -I. -Ivendor -Ivendor/cigraph/src -Ivendor/cigraph/include -Ivendor/cigraph/vendor -Ivendor/io/parsers -I/usr/include/libxml2 -DHAVE_LIBXML -DNDEBUG -DNTIMER -DNPRINT -DIGRAPH_THREAD_LOCAL= -DPRPACK_IGRAPH_SUPPORT -DHAVE_GFORTRAN=1 -D_GNU_SOURCE=1 -I'/home/omnipath/local/R/4.4-3.20/cpp11/include' -fvisibility=hidden -fpic -g -O2 -fno-omit-frame-pointer -mno-omit-leaf-frame-pointer -ffile-prefix-map=/build/r-base-EawLoD/r-base-4.4.1=. -fstack-protector-strong -fstack-clash-protection -Wformat -Werror=format-security -fcf-protection -fdebug-prefix-map=/build/r-base-EawLoD/r-base-4.4.1=/usr/src/r-base-4.4.1-1.2404.0 -Wdate-time -D_FORTIFY_SOURCE=3 -c vendor/cigraph/src/graph/iterators.c -o vendor/cigraph/src/graph/iterators.o gcc -I"/usr/share/R/include" -DNDEBUG -DUSING_R -I. -Ivendor -Ivendor/cigraph/src -Ivendor/cigraph/include -Ivendor/cigraph/vendor -Ivendor/io/parsers -I/usr/include/libxml2 -DHAVE_LIBXML -DNDEBUG -DNTIMER -DNPRINT -DIGRAPH_THREAD_LOCAL= -DPRPACK_IGRAPH_SUPPORT -DHAVE_GFORTRAN=1 -D_GNU_SOURCE=1 -I'/home/omnipath/local/R/4.4-3.20/cpp11/include' -fvisibility=hidden -fpic -g -O2 -fno-omit-frame-pointer -mno-omit-leaf-frame-pointer -ffile-prefix-map=/build/r-base-EawLoD/r-base-4.4.1=. -fstack-protector-strong -fstack-clash-protection -Wformat -Werror=format-security -fcf-protection -fdebug-prefix-map=/build/r-base-EawLoD/r-base-4.4.1=/usr/src/r-base-4.4.1-1.2404.0 -Wdate-time -D_FORTIFY_SOURCE=3 -c vendor/cigraph/src/graph/type_common.c -o vendor/cigraph/src/graph/type_common.o gcc -I"/usr/share/R/include" -DNDEBUG -DUSING_R -I. -Ivendor -Ivendor/cigraph/src -Ivendor/cigraph/include -Ivendor/cigraph/vendor -Ivendor/io/parsers -I/usr/include/libxml2 -DHAVE_LIBXML -DNDEBUG -DNTIMER -DNPRINT -DIGRAPH_THREAD_LOCAL= -DPRPACK_IGRAPH_SUPPORT -DHAVE_GFORTRAN=1 -D_GNU_SOURCE=1 -I'/home/omnipath/local/R/4.4-3.20/cpp11/include' -fvisibility=hidden -fpic -g -O2 -fno-omit-frame-pointer -mno-omit-leaf-frame-pointer -ffile-prefix-map=/build/r-base-EawLoD/r-base-4.4.1=. -fstack-protector-strong -fstack-clash-protection -Wformat -Werror=format-security -fcf-protection -fdebug-prefix-map=/build/r-base-EawLoD/r-base-4.4.1=/usr/src/r-base-4.4.1-1.2404.0 -Wdate-time -D_FORTIFY_SOURCE=3 -c vendor/cigraph/src/graph/type_indexededgelist.c -o vendor/cigraph/src/graph/type_indexededgelist.o gcc -I"/usr/share/R/include" -DNDEBUG -DUSING_R -I. -Ivendor -Ivendor/cigraph/src -Ivendor/cigraph/include -Ivendor/cigraph/vendor -Ivendor/io/parsers -I/usr/include/libxml2 -DHAVE_LIBXML -DNDEBUG -DNTIMER -DNPRINT -DIGRAPH_THREAD_LOCAL= -DPRPACK_IGRAPH_SUPPORT -DHAVE_GFORTRAN=1 -D_GNU_SOURCE=1 -I'/home/omnipath/local/R/4.4-3.20/cpp11/include' -fvisibility=hidden -fpic -g -O2 -fno-omit-frame-pointer -mno-omit-leaf-frame-pointer -ffile-prefix-map=/build/r-base-EawLoD/r-base-4.4.1=. -fstack-protector-strong -fstack-clash-protection -Wformat -Werror=format-security -fcf-protection -fdebug-prefix-map=/build/r-base-EawLoD/r-base-4.4.1=/usr/src/r-base-4.4.1-1.2404.0 -Wdate-time -D_FORTIFY_SOURCE=3 -c vendor/cigraph/src/graph/visitors.c -o vendor/cigraph/src/graph/visitors.o g++ -std=gnu++17 -I"/usr/share/R/include" -DNDEBUG -DUSING_R -I. -Ivendor -Ivendor/cigraph/src -Ivendor/cigraph/include -Ivendor/cigraph/vendor -Ivendor/io/parsers -I/usr/include/libxml2 -DHAVE_LIBXML -DNDEBUG -DNTIMER -DNPRINT -DIGRAPH_THREAD_LOCAL= -DPRPACK_IGRAPH_SUPPORT -DHAVE_GFORTRAN=1 -D_GNU_SOURCE=1 -I'/home/omnipath/local/R/4.4-3.20/cpp11/include' -fvisibility=hidden -fpic -g -O2 -fno-omit-frame-pointer -mno-omit-leaf-frame-pointer -ffile-prefix-map=/build/r-base-EawLoD/r-base-4.4.1=. -fstack-protector-strong -fstack-clash-protection -Wformat -Werror=format-security -fcf-protection -fdebug-prefix-map=/build/r-base-EawLoD/r-base-4.4.1=/usr/src/r-base-4.4.1-1.2404.0 -Wdate-time -D_FORTIFY_SOURCE=3 -c vendor/cigraph/src/hrg/hrg.cc -o vendor/cigraph/src/hrg/hrg.o g++ -std=gnu++17 -I"/usr/share/R/include" -DNDEBUG -DUSING_R -I. -Ivendor -Ivendor/cigraph/src -Ivendor/cigraph/include -Ivendor/cigraph/vendor -Ivendor/io/parsers -I/usr/include/libxml2 -DHAVE_LIBXML -DNDEBUG -DNTIMER -DNPRINT -DIGRAPH_THREAD_LOCAL= -DPRPACK_IGRAPH_SUPPORT -DHAVE_GFORTRAN=1 -D_GNU_SOURCE=1 -I'/home/omnipath/local/R/4.4-3.20/cpp11/include' -fvisibility=hidden -fpic -g -O2 -fno-omit-frame-pointer -mno-omit-leaf-frame-pointer -ffile-prefix-map=/build/r-base-EawLoD/r-base-4.4.1=. -fstack-protector-strong -fstack-clash-protection -Wformat -Werror=format-security -fcf-protection -fdebug-prefix-map=/build/r-base-EawLoD/r-base-4.4.1=/usr/src/r-base-4.4.1-1.2404.0 -Wdate-time -D_FORTIFY_SOURCE=3 -c vendor/cigraph/src/hrg/hrg_types.cc -o vendor/cigraph/src/hrg/hrg_types.o gcc -I"/usr/share/R/include" -DNDEBUG -DUSING_R -I. -Ivendor -Ivendor/cigraph/src -Ivendor/cigraph/include -Ivendor/cigraph/vendor -Ivendor/io/parsers -I/usr/include/libxml2 -DHAVE_LIBXML -DNDEBUG -DNTIMER -DNPRINT -DIGRAPH_THREAD_LOCAL= -DPRPACK_IGRAPH_SUPPORT -DHAVE_GFORTRAN=1 -D_GNU_SOURCE=1 -I'/home/omnipath/local/R/4.4-3.20/cpp11/include' -fvisibility=hidden -fpic -g -O2 -fno-omit-frame-pointer -mno-omit-leaf-frame-pointer -ffile-prefix-map=/build/r-base-EawLoD/r-base-4.4.1=. -fstack-protector-strong -fstack-clash-protection -Wformat -Werror=format-security -fcf-protection -fdebug-prefix-map=/build/r-base-EawLoD/r-base-4.4.1=/usr/src/r-base-4.4.1-1.2404.0 -Wdate-time -D_FORTIFY_SOURCE=3 -c vendor/cigraph/src/internal/glpk_support.c -o vendor/cigraph/src/internal/glpk_support.o gcc -I"/usr/share/R/include" -DNDEBUG -DUSING_R -I. -Ivendor -Ivendor/cigraph/src -Ivendor/cigraph/include -Ivendor/cigraph/vendor -Ivendor/io/parsers -I/usr/include/libxml2 -DHAVE_LIBXML -DNDEBUG -DNTIMER -DNPRINT -DIGRAPH_THREAD_LOCAL= -DPRPACK_IGRAPH_SUPPORT -DHAVE_GFORTRAN=1 -D_GNU_SOURCE=1 -I'/home/omnipath/local/R/4.4-3.20/cpp11/include' -fvisibility=hidden -fpic -g -O2 -fno-omit-frame-pointer -mno-omit-leaf-frame-pointer -ffile-prefix-map=/build/r-base-EawLoD/r-base-4.4.1=. -fstack-protector-strong -fstack-clash-protection -Wformat -Werror=format-security -fcf-protection -fdebug-prefix-map=/build/r-base-EawLoD/r-base-4.4.1=/usr/src/r-base-4.4.1-1.2404.0 -Wdate-time -D_FORTIFY_SOURCE=3 -c vendor/cigraph/src/internal/hacks.c -o vendor/cigraph/src/internal/hacks.o gcc -I"/usr/share/R/include" -DNDEBUG -DUSING_R -I. -Ivendor -Ivendor/cigraph/src -Ivendor/cigraph/include -Ivendor/cigraph/vendor -Ivendor/io/parsers -I/usr/include/libxml2 -DHAVE_LIBXML -DNDEBUG -DNTIMER -DNPRINT -DIGRAPH_THREAD_LOCAL= -DPRPACK_IGRAPH_SUPPORT -DHAVE_GFORTRAN=1 -D_GNU_SOURCE=1 -I'/home/omnipath/local/R/4.4-3.20/cpp11/include' -fvisibility=hidden -fpic -g -O2 -fno-omit-frame-pointer -mno-omit-leaf-frame-pointer -ffile-prefix-map=/build/r-base-EawLoD/r-base-4.4.1=. -fstack-protector-strong -fstack-clash-protection -Wformat -Werror=format-security -fcf-protection -fdebug-prefix-map=/build/r-base-EawLoD/r-base-4.4.1=/usr/src/r-base-4.4.1-1.2404.0 -Wdate-time -D_FORTIFY_SOURCE=3 -c vendor/cigraph/src/internal/lsap.c -o vendor/cigraph/src/internal/lsap.o gcc -I"/usr/share/R/include" -DNDEBUG -DUSING_R -I. -Ivendor -Ivendor/cigraph/src -Ivendor/cigraph/include -Ivendor/cigraph/vendor -Ivendor/io/parsers -I/usr/include/libxml2 -DHAVE_LIBXML -DNDEBUG -DNTIMER -DNPRINT -DIGRAPH_THREAD_LOCAL= -DPRPACK_IGRAPH_SUPPORT -DHAVE_GFORTRAN=1 -D_GNU_SOURCE=1 -I'/home/omnipath/local/R/4.4-3.20/cpp11/include' -fvisibility=hidden -fpic -g -O2 -fno-omit-frame-pointer -mno-omit-leaf-frame-pointer -ffile-prefix-map=/build/r-base-EawLoD/r-base-4.4.1=. -fstack-protector-strong -fstack-clash-protection -Wformat -Werror=format-security -fcf-protection -fdebug-prefix-map=/build/r-base-EawLoD/r-base-4.4.1=/usr/src/r-base-4.4.1-1.2404.0 -Wdate-time -D_FORTIFY_SOURCE=3 -c vendor/cigraph/src/internal/qsort.c -o vendor/cigraph/src/internal/qsort.o gcc -I"/usr/share/R/include" -DNDEBUG -DUSING_R -I. -Ivendor -Ivendor/cigraph/src -Ivendor/cigraph/include -Ivendor/cigraph/vendor -Ivendor/io/parsers -I/usr/include/libxml2 -DHAVE_LIBXML -DNDEBUG -DNTIMER -DNPRINT -DIGRAPH_THREAD_LOCAL= -DPRPACK_IGRAPH_SUPPORT -DHAVE_GFORTRAN=1 -D_GNU_SOURCE=1 -I'/home/omnipath/local/R/4.4-3.20/cpp11/include' -fvisibility=hidden -fpic -g -O2 -fno-omit-frame-pointer -mno-omit-leaf-frame-pointer -ffile-prefix-map=/build/r-base-EawLoD/r-base-4.4.1=. -fstack-protector-strong -fstack-clash-protection -Wformat -Werror=format-security -fcf-protection -fdebug-prefix-map=/build/r-base-EawLoD/r-base-4.4.1=/usr/src/r-base-4.4.1-1.2404.0 -Wdate-time -D_FORTIFY_SOURCE=3 -c vendor/cigraph/src/internal/qsort_r.c -o vendor/cigraph/src/internal/qsort_r.o gcc -I"/usr/share/R/include" -DNDEBUG -DUSING_R -I. -Ivendor -Ivendor/cigraph/src -Ivendor/cigraph/include -Ivendor/cigraph/vendor -Ivendor/io/parsers -I/usr/include/libxml2 -DHAVE_LIBXML -DNDEBUG -DNTIMER -DNPRINT -DIGRAPH_THREAD_LOCAL= -DPRPACK_IGRAPH_SUPPORT -DHAVE_GFORTRAN=1 -D_GNU_SOURCE=1 -I'/home/omnipath/local/R/4.4-3.20/cpp11/include' -fvisibility=hidden -fpic -g -O2 -fno-omit-frame-pointer -mno-omit-leaf-frame-pointer -ffile-prefix-map=/build/r-base-EawLoD/r-base-4.4.1=. -fstack-protector-strong -fstack-clash-protection -Wformat -Werror=format-security -fcf-protection -fdebug-prefix-map=/build/r-base-EawLoD/r-base-4.4.1=/usr/src/r-base-4.4.1-1.2404.0 -Wdate-time -D_FORTIFY_SOURCE=3 -c vendor/cigraph/src/internal/utils.c -o vendor/cigraph/src/internal/utils.o gcc -I"/usr/share/R/include" -DNDEBUG -DUSING_R -I. -Ivendor -Ivendor/cigraph/src -Ivendor/cigraph/include -Ivendor/cigraph/vendor -Ivendor/io/parsers -I/usr/include/libxml2 -DHAVE_LIBXML -DNDEBUG -DNTIMER -DNPRINT -DIGRAPH_THREAD_LOCAL= -DPRPACK_IGRAPH_SUPPORT -DHAVE_GFORTRAN=1 -D_GNU_SOURCE=1 -I'/home/omnipath/local/R/4.4-3.20/cpp11/include' -fvisibility=hidden -fpic -g -O2 -fno-omit-frame-pointer -mno-omit-leaf-frame-pointer -ffile-prefix-map=/build/r-base-EawLoD/r-base-4.4.1=. -fstack-protector-strong -fstack-clash-protection -Wformat -Werror=format-security -fcf-protection -fdebug-prefix-map=/build/r-base-EawLoD/r-base-4.4.1=/usr/src/r-base-4.4.1-1.2404.0 -Wdate-time -D_FORTIFY_SOURCE=3 -c vendor/cigraph/src/internal/zeroin.c -o vendor/cigraph/src/internal/zeroin.o gcc -I"/usr/share/R/include" -DNDEBUG -DUSING_R -I. -Ivendor -Ivendor/cigraph/src -Ivendor/cigraph/include -Ivendor/cigraph/vendor -Ivendor/io/parsers -I/usr/include/libxml2 -DHAVE_LIBXML -DNDEBUG -DNTIMER -DNPRINT -DIGRAPH_THREAD_LOCAL= -DPRPACK_IGRAPH_SUPPORT -DHAVE_GFORTRAN=1 -D_GNU_SOURCE=1 -I'/home/omnipath/local/R/4.4-3.20/cpp11/include' -fvisibility=hidden -fpic -g -O2 -fno-omit-frame-pointer -mno-omit-leaf-frame-pointer -ffile-prefix-map=/build/r-base-EawLoD/r-base-4.4.1=. -fstack-protector-strong -fstack-clash-protection -Wformat -Werror=format-security -fcf-protection -fdebug-prefix-map=/build/r-base-EawLoD/r-base-4.4.1=/usr/src/r-base-4.4.1-1.2404.0 -Wdate-time -D_FORTIFY_SOURCE=3 -c vendor/cigraph/src/io/dimacs.c -o vendor/cigraph/src/io/dimacs.o gcc -I"/usr/share/R/include" -DNDEBUG -DUSING_R -I. -Ivendor -Ivendor/cigraph/src -Ivendor/cigraph/include -Ivendor/cigraph/vendor -Ivendor/io/parsers -I/usr/include/libxml2 -DHAVE_LIBXML -DNDEBUG -DNTIMER -DNPRINT -DIGRAPH_THREAD_LOCAL= -DPRPACK_IGRAPH_SUPPORT -DHAVE_GFORTRAN=1 -D_GNU_SOURCE=1 -I'/home/omnipath/local/R/4.4-3.20/cpp11/include' -fvisibility=hidden -fpic -g -O2 -fno-omit-frame-pointer -mno-omit-leaf-frame-pointer -ffile-prefix-map=/build/r-base-EawLoD/r-base-4.4.1=. -fstack-protector-strong -fstack-clash-protection -Wformat -Werror=format-security -fcf-protection -fdebug-prefix-map=/build/r-base-EawLoD/r-base-4.4.1=/usr/src/r-base-4.4.1-1.2404.0 -Wdate-time -D_FORTIFY_SOURCE=3 -c vendor/cigraph/src/io/dl.c -o vendor/cigraph/src/io/dl.o gcc -I"/usr/share/R/include" -DNDEBUG -DUSING_R -I. -Ivendor -Ivendor/cigraph/src -Ivendor/cigraph/include -Ivendor/cigraph/vendor -Ivendor/io/parsers -I/usr/include/libxml2 -DHAVE_LIBXML -DNDEBUG -DNTIMER -DNPRINT -DIGRAPH_THREAD_LOCAL= -DPRPACK_IGRAPH_SUPPORT -DHAVE_GFORTRAN=1 -D_GNU_SOURCE=1 -I'/home/omnipath/local/R/4.4-3.20/cpp11/include' -fvisibility=hidden -fpic -g -O2 -fno-omit-frame-pointer -mno-omit-leaf-frame-pointer -ffile-prefix-map=/build/r-base-EawLoD/r-base-4.4.1=. -fstack-protector-strong -fstack-clash-protection -Wformat -Werror=format-security -fcf-protection -fdebug-prefix-map=/build/r-base-EawLoD/r-base-4.4.1=/usr/src/r-base-4.4.1-1.2404.0 -Wdate-time -D_FORTIFY_SOURCE=3 -c vendor/cigraph/src/io/dot.c -o vendor/cigraph/src/io/dot.o gcc -I"/usr/share/R/include" -DNDEBUG -DUSING_R -I. -Ivendor -Ivendor/cigraph/src -Ivendor/cigraph/include -Ivendor/cigraph/vendor -Ivendor/io/parsers -I/usr/include/libxml2 -DHAVE_LIBXML -DNDEBUG -DNTIMER -DNPRINT -DIGRAPH_THREAD_LOCAL= -DPRPACK_IGRAPH_SUPPORT -DHAVE_GFORTRAN=1 -D_GNU_SOURCE=1 -I'/home/omnipath/local/R/4.4-3.20/cpp11/include' -fvisibility=hidden -fpic -g -O2 -fno-omit-frame-pointer -mno-omit-leaf-frame-pointer -ffile-prefix-map=/build/r-base-EawLoD/r-base-4.4.1=. -fstack-protector-strong -fstack-clash-protection -Wformat -Werror=format-security -fcf-protection -fdebug-prefix-map=/build/r-base-EawLoD/r-base-4.4.1=/usr/src/r-base-4.4.1-1.2404.0 -Wdate-time -D_FORTIFY_SOURCE=3 -c vendor/cigraph/src/io/edgelist.c -o vendor/cigraph/src/io/edgelist.o gcc -I"/usr/share/R/include" -DNDEBUG -DUSING_R -I. -Ivendor -Ivendor/cigraph/src -Ivendor/cigraph/include -Ivendor/cigraph/vendor -Ivendor/io/parsers -I/usr/include/libxml2 -DHAVE_LIBXML -DNDEBUG -DNTIMER -DNPRINT -DIGRAPH_THREAD_LOCAL= -DPRPACK_IGRAPH_SUPPORT -DHAVE_GFORTRAN=1 -D_GNU_SOURCE=1 -I'/home/omnipath/local/R/4.4-3.20/cpp11/include' -fvisibility=hidden -fpic -g -O2 -fno-omit-frame-pointer -mno-omit-leaf-frame-pointer -ffile-prefix-map=/build/r-base-EawLoD/r-base-4.4.1=. -fstack-protector-strong -fstack-clash-protection -Wformat -Werror=format-security -fcf-protection -fdebug-prefix-map=/build/r-base-EawLoD/r-base-4.4.1=/usr/src/r-base-4.4.1-1.2404.0 -Wdate-time -D_FORTIFY_SOURCE=3 -c vendor/cigraph/src/io/gml-tree.c -o vendor/cigraph/src/io/gml-tree.o gcc -I"/usr/share/R/include" -DNDEBUG -DUSING_R -I. -Ivendor -Ivendor/cigraph/src -Ivendor/cigraph/include -Ivendor/cigraph/vendor -Ivendor/io/parsers -I/usr/include/libxml2 -DHAVE_LIBXML -DNDEBUG -DNTIMER -DNPRINT -DIGRAPH_THREAD_LOCAL= -DPRPACK_IGRAPH_SUPPORT -DHAVE_GFORTRAN=1 -D_GNU_SOURCE=1 -I'/home/omnipath/local/R/4.4-3.20/cpp11/include' -fvisibility=hidden -fpic -g -O2 -fno-omit-frame-pointer -mno-omit-leaf-frame-pointer -ffile-prefix-map=/build/r-base-EawLoD/r-base-4.4.1=. -fstack-protector-strong -fstack-clash-protection -Wformat -Werror=format-security -fcf-protection -fdebug-prefix-map=/build/r-base-EawLoD/r-base-4.4.1=/usr/src/r-base-4.4.1-1.2404.0 -Wdate-time -D_FORTIFY_SOURCE=3 -c vendor/cigraph/src/io/gml.c -o vendor/cigraph/src/io/gml.o gcc -I"/usr/share/R/include" -DNDEBUG -DUSING_R -I. -Ivendor -Ivendor/cigraph/src -Ivendor/cigraph/include -Ivendor/cigraph/vendor -Ivendor/io/parsers -I/usr/include/libxml2 -DHAVE_LIBXML -DNDEBUG -DNTIMER -DNPRINT -DIGRAPH_THREAD_LOCAL= -DPRPACK_IGRAPH_SUPPORT -DHAVE_GFORTRAN=1 -D_GNU_SOURCE=1 -I'/home/omnipath/local/R/4.4-3.20/cpp11/include' -fvisibility=hidden -fpic -g -O2 -fno-omit-frame-pointer -mno-omit-leaf-frame-pointer -ffile-prefix-map=/build/r-base-EawLoD/r-base-4.4.1=. -fstack-protector-strong -fstack-clash-protection -Wformat -Werror=format-security -fcf-protection -fdebug-prefix-map=/build/r-base-EawLoD/r-base-4.4.1=/usr/src/r-base-4.4.1-1.2404.0 -Wdate-time -D_FORTIFY_SOURCE=3 -c vendor/cigraph/src/io/graphdb.c -o vendor/cigraph/src/io/graphdb.o gcc -I"/usr/share/R/include" -DNDEBUG -DUSING_R -I. -Ivendor -Ivendor/cigraph/src -Ivendor/cigraph/include -Ivendor/cigraph/vendor -Ivendor/io/parsers -I/usr/include/libxml2 -DHAVE_LIBXML -DNDEBUG -DNTIMER -DNPRINT -DIGRAPH_THREAD_LOCAL= -DPRPACK_IGRAPH_SUPPORT -DHAVE_GFORTRAN=1 -D_GNU_SOURCE=1 -I'/home/omnipath/local/R/4.4-3.20/cpp11/include' -fvisibility=hidden -fpic -g -O2 -fno-omit-frame-pointer -mno-omit-leaf-frame-pointer -ffile-prefix-map=/build/r-base-EawLoD/r-base-4.4.1=. -fstack-protector-strong -fstack-clash-protection -Wformat -Werror=format-security -fcf-protection -fdebug-prefix-map=/build/r-base-EawLoD/r-base-4.4.1=/usr/src/r-base-4.4.1-1.2404.0 -Wdate-time -D_FORTIFY_SOURCE=3 -c vendor/cigraph/src/io/graphml.c -o vendor/cigraph/src/io/graphml.o gcc -I"/usr/share/R/include" -DNDEBUG -DUSING_R -I. -Ivendor -Ivendor/cigraph/src -Ivendor/cigraph/include -Ivendor/cigraph/vendor -Ivendor/io/parsers -I/usr/include/libxml2 -DHAVE_LIBXML -DNDEBUG -DNTIMER -DNPRINT -DIGRAPH_THREAD_LOCAL= -DPRPACK_IGRAPH_SUPPORT -DHAVE_GFORTRAN=1 -D_GNU_SOURCE=1 -I'/home/omnipath/local/R/4.4-3.20/cpp11/include' -fvisibility=hidden -fpic -g -O2 -fno-omit-frame-pointer -mno-omit-leaf-frame-pointer -ffile-prefix-map=/build/r-base-EawLoD/r-base-4.4.1=. -fstack-protector-strong -fstack-clash-protection -Wformat -Werror=format-security -fcf-protection -fdebug-prefix-map=/build/r-base-EawLoD/r-base-4.4.1=/usr/src/r-base-4.4.1-1.2404.0 -Wdate-time -D_FORTIFY_SOURCE=3 -c vendor/cigraph/src/io/leda.c -o vendor/cigraph/src/io/leda.o gcc -I"/usr/share/R/include" -DNDEBUG -DUSING_R -I. -Ivendor -Ivendor/cigraph/src -Ivendor/cigraph/include -Ivendor/cigraph/vendor -Ivendor/io/parsers -I/usr/include/libxml2 -DHAVE_LIBXML -DNDEBUG -DNTIMER -DNPRINT -DIGRAPH_THREAD_LOCAL= -DPRPACK_IGRAPH_SUPPORT -DHAVE_GFORTRAN=1 -D_GNU_SOURCE=1 -I'/home/omnipath/local/R/4.4-3.20/cpp11/include' -fvisibility=hidden -fpic -g -O2 -fno-omit-frame-pointer -mno-omit-leaf-frame-pointer -ffile-prefix-map=/build/r-base-EawLoD/r-base-4.4.1=. -fstack-protector-strong -fstack-clash-protection -Wformat -Werror=format-security -fcf-protection -fdebug-prefix-map=/build/r-base-EawLoD/r-base-4.4.1=/usr/src/r-base-4.4.1-1.2404.0 -Wdate-time -D_FORTIFY_SOURCE=3 -c vendor/cigraph/src/io/lgl.c -o vendor/cigraph/src/io/lgl.o gcc -I"/usr/share/R/include" -DNDEBUG -DUSING_R -I. -Ivendor -Ivendor/cigraph/src -Ivendor/cigraph/include -Ivendor/cigraph/vendor -Ivendor/io/parsers -I/usr/include/libxml2 -DHAVE_LIBXML -DNDEBUG -DNTIMER -DNPRINT -DIGRAPH_THREAD_LOCAL= -DPRPACK_IGRAPH_SUPPORT -DHAVE_GFORTRAN=1 -D_GNU_SOURCE=1 -I'/home/omnipath/local/R/4.4-3.20/cpp11/include' -fvisibility=hidden -fpic -g -O2 -fno-omit-frame-pointer -mno-omit-leaf-frame-pointer -ffile-prefix-map=/build/r-base-EawLoD/r-base-4.4.1=. -fstack-protector-strong -fstack-clash-protection -Wformat -Werror=format-security -fcf-protection -fdebug-prefix-map=/build/r-base-EawLoD/r-base-4.4.1=/usr/src/r-base-4.4.1-1.2404.0 -Wdate-time -D_FORTIFY_SOURCE=3 -c vendor/cigraph/src/io/ncol.c -o vendor/cigraph/src/io/ncol.o gcc -I"/usr/share/R/include" -DNDEBUG -DUSING_R -I. -Ivendor -Ivendor/cigraph/src -Ivendor/cigraph/include -Ivendor/cigraph/vendor -Ivendor/io/parsers -I/usr/include/libxml2 -DHAVE_LIBXML -DNDEBUG -DNTIMER -DNPRINT -DIGRAPH_THREAD_LOCAL= -DPRPACK_IGRAPH_SUPPORT -DHAVE_GFORTRAN=1 -D_GNU_SOURCE=1 -I'/home/omnipath/local/R/4.4-3.20/cpp11/include' -fvisibility=hidden -fpic -g -O2 -fno-omit-frame-pointer -mno-omit-leaf-frame-pointer -ffile-prefix-map=/build/r-base-EawLoD/r-base-4.4.1=. -fstack-protector-strong -fstack-clash-protection -Wformat -Werror=format-security -fcf-protection -fdebug-prefix-map=/build/r-base-EawLoD/r-base-4.4.1=/usr/src/r-base-4.4.1-1.2404.0 -Wdate-time -D_FORTIFY_SOURCE=3 -c vendor/cigraph/src/io/pajek.c -o vendor/cigraph/src/io/pajek.o gcc -I"/usr/share/R/include" -DNDEBUG -DUSING_R -I. -Ivendor -Ivendor/cigraph/src -Ivendor/cigraph/include -Ivendor/cigraph/vendor -Ivendor/io/parsers -I/usr/include/libxml2 -DHAVE_LIBXML -DNDEBUG -DNTIMER -DNPRINT -DIGRAPH_THREAD_LOCAL= -DPRPACK_IGRAPH_SUPPORT -DHAVE_GFORTRAN=1 -D_GNU_SOURCE=1 -I'/home/omnipath/local/R/4.4-3.20/cpp11/include' -fvisibility=hidden -fpic -g -O2 -fno-omit-frame-pointer -mno-omit-leaf-frame-pointer -ffile-prefix-map=/build/r-base-EawLoD/r-base-4.4.1=. -fstack-protector-strong -fstack-clash-protection -Wformat -Werror=format-security -fcf-protection -fdebug-prefix-map=/build/r-base-EawLoD/r-base-4.4.1=/usr/src/r-base-4.4.1-1.2404.0 -Wdate-time -D_FORTIFY_SOURCE=3 -c vendor/cigraph/src/io/parse_utils.c -o vendor/cigraph/src/io/parse_utils.o g++ -std=gnu++17 -I"/usr/share/R/include" -DNDEBUG -DUSING_R -I. -Ivendor -Ivendor/cigraph/src -Ivendor/cigraph/include -Ivendor/cigraph/vendor -Ivendor/io/parsers -I/usr/include/libxml2 -DHAVE_LIBXML -DNDEBUG -DNTIMER -DNPRINT -DIGRAPH_THREAD_LOCAL= -DPRPACK_IGRAPH_SUPPORT -DHAVE_GFORTRAN=1 -D_GNU_SOURCE=1 -I'/home/omnipath/local/R/4.4-3.20/cpp11/include' -fvisibility=hidden -fpic -g -O2 -fno-omit-frame-pointer -mno-omit-leaf-frame-pointer -ffile-prefix-map=/build/r-base-EawLoD/r-base-4.4.1=. -fstack-protector-strong -fstack-clash-protection -Wformat -Werror=format-security -fcf-protection -fdebug-prefix-map=/build/r-base-EawLoD/r-base-4.4.1=/usr/src/r-base-4.4.1-1.2404.0 -Wdate-time -D_FORTIFY_SOURCE=3 -c vendor/cigraph/src/isomorphism/bliss.cc -o vendor/cigraph/src/isomorphism/bliss.o g++ -std=gnu++17 -I"/usr/share/R/include" -DNDEBUG -DUSING_R -I. -Ivendor -Ivendor/cigraph/src -Ivendor/cigraph/include -Ivendor/cigraph/vendor -Ivendor/io/parsers -I/usr/include/libxml2 -DHAVE_LIBXML -DNDEBUG -DNTIMER -DNPRINT -DIGRAPH_THREAD_LOCAL= -DPRPACK_IGRAPH_SUPPORT -DHAVE_GFORTRAN=1 -D_GNU_SOURCE=1 -I'/home/omnipath/local/R/4.4-3.20/cpp11/include' -fvisibility=hidden -fpic -g -O2 -fno-omit-frame-pointer -mno-omit-leaf-frame-pointer -ffile-prefix-map=/build/r-base-EawLoD/r-base-4.4.1=. -fstack-protector-strong -fstack-clash-protection -Wformat -Werror=format-security -fcf-protection -fdebug-prefix-map=/build/r-base-EawLoD/r-base-4.4.1=/usr/src/r-base-4.4.1-1.2404.0 -Wdate-time -D_FORTIFY_SOURCE=3 -c vendor/cigraph/src/isomorphism/bliss/defs.cc -o vendor/cigraph/src/isomorphism/bliss/defs.o g++ -std=gnu++17 -I"/usr/share/R/include" -DNDEBUG -DUSING_R -I. -Ivendor -Ivendor/cigraph/src -Ivendor/cigraph/include -Ivendor/cigraph/vendor -Ivendor/io/parsers -I/usr/include/libxml2 -DHAVE_LIBXML -DNDEBUG -DNTIMER -DNPRINT -DIGRAPH_THREAD_LOCAL= -DPRPACK_IGRAPH_SUPPORT -DHAVE_GFORTRAN=1 -D_GNU_SOURCE=1 -I'/home/omnipath/local/R/4.4-3.20/cpp11/include' -fvisibility=hidden -fpic -g -O2 -fno-omit-frame-pointer -mno-omit-leaf-frame-pointer -ffile-prefix-map=/build/r-base-EawLoD/r-base-4.4.1=. -fstack-protector-strong -fstack-clash-protection -Wformat -Werror=format-security -fcf-protection -fdebug-prefix-map=/build/r-base-EawLoD/r-base-4.4.1=/usr/src/r-base-4.4.1-1.2404.0 -Wdate-time -D_FORTIFY_SOURCE=3 -c vendor/cigraph/src/isomorphism/bliss/graph.cc -o vendor/cigraph/src/isomorphism/bliss/graph.o g++ -std=gnu++17 -I"/usr/share/R/include" -DNDEBUG -DUSING_R -I. -Ivendor -Ivendor/cigraph/src -Ivendor/cigraph/include -Ivendor/cigraph/vendor -Ivendor/io/parsers -I/usr/include/libxml2 -DHAVE_LIBXML -DNDEBUG -DNTIMER -DNPRINT -DIGRAPH_THREAD_LOCAL= -DPRPACK_IGRAPH_SUPPORT -DHAVE_GFORTRAN=1 -D_GNU_SOURCE=1 -I'/home/omnipath/local/R/4.4-3.20/cpp11/include' -fvisibility=hidden -fpic -g -O2 -fno-omit-frame-pointer -mno-omit-leaf-frame-pointer -ffile-prefix-map=/build/r-base-EawLoD/r-base-4.4.1=. -fstack-protector-strong -fstack-clash-protection -Wformat -Werror=format-security -fcf-protection -fdebug-prefix-map=/build/r-base-EawLoD/r-base-4.4.1=/usr/src/r-base-4.4.1-1.2404.0 -Wdate-time -D_FORTIFY_SOURCE=3 -c vendor/cigraph/src/isomorphism/bliss/heap.cc -o vendor/cigraph/src/isomorphism/bliss/heap.o g++ -std=gnu++17 -I"/usr/share/R/include" -DNDEBUG -DUSING_R -I. -Ivendor -Ivendor/cigraph/src -Ivendor/cigraph/include -Ivendor/cigraph/vendor -Ivendor/io/parsers -I/usr/include/libxml2 -DHAVE_LIBXML -DNDEBUG -DNTIMER -DNPRINT -DIGRAPH_THREAD_LOCAL= -DPRPACK_IGRAPH_SUPPORT -DHAVE_GFORTRAN=1 -D_GNU_SOURCE=1 -I'/home/omnipath/local/R/4.4-3.20/cpp11/include' -fvisibility=hidden -fpic -g -O2 -fno-omit-frame-pointer -mno-omit-leaf-frame-pointer -ffile-prefix-map=/build/r-base-EawLoD/r-base-4.4.1=. -fstack-protector-strong -fstack-clash-protection -Wformat -Werror=format-security -fcf-protection -fdebug-prefix-map=/build/r-base-EawLoD/r-base-4.4.1=/usr/src/r-base-4.4.1-1.2404.0 -Wdate-time -D_FORTIFY_SOURCE=3 -c vendor/cigraph/src/isomorphism/bliss/orbit.cc -o vendor/cigraph/src/isomorphism/bliss/orbit.o g++ -std=gnu++17 -I"/usr/share/R/include" -DNDEBUG -DUSING_R -I. -Ivendor -Ivendor/cigraph/src -Ivendor/cigraph/include -Ivendor/cigraph/vendor -Ivendor/io/parsers -I/usr/include/libxml2 -DHAVE_LIBXML -DNDEBUG -DNTIMER -DNPRINT -DIGRAPH_THREAD_LOCAL= -DPRPACK_IGRAPH_SUPPORT -DHAVE_GFORTRAN=1 -D_GNU_SOURCE=1 -I'/home/omnipath/local/R/4.4-3.20/cpp11/include' -fvisibility=hidden -fpic -g -O2 -fno-omit-frame-pointer -mno-omit-leaf-frame-pointer -ffile-prefix-map=/build/r-base-EawLoD/r-base-4.4.1=. -fstack-protector-strong -fstack-clash-protection -Wformat -Werror=format-security -fcf-protection -fdebug-prefix-map=/build/r-base-EawLoD/r-base-4.4.1=/usr/src/r-base-4.4.1-1.2404.0 -Wdate-time -D_FORTIFY_SOURCE=3 -c vendor/cigraph/src/isomorphism/bliss/partition.cc -o vendor/cigraph/src/isomorphism/bliss/partition.o g++ -std=gnu++17 -I"/usr/share/R/include" -DNDEBUG -DUSING_R -I. -Ivendor -Ivendor/cigraph/src -Ivendor/cigraph/include -Ivendor/cigraph/vendor -Ivendor/io/parsers -I/usr/include/libxml2 -DHAVE_LIBXML -DNDEBUG -DNTIMER -DNPRINT -DIGRAPH_THREAD_LOCAL= -DPRPACK_IGRAPH_SUPPORT -DHAVE_GFORTRAN=1 -D_GNU_SOURCE=1 -I'/home/omnipath/local/R/4.4-3.20/cpp11/include' -fvisibility=hidden -fpic -g -O2 -fno-omit-frame-pointer -mno-omit-leaf-frame-pointer -ffile-prefix-map=/build/r-base-EawLoD/r-base-4.4.1=. -fstack-protector-strong -fstack-clash-protection -Wformat -Werror=format-security -fcf-protection -fdebug-prefix-map=/build/r-base-EawLoD/r-base-4.4.1=/usr/src/r-base-4.4.1-1.2404.0 -Wdate-time -D_FORTIFY_SOURCE=3 -c vendor/cigraph/src/isomorphism/bliss/uintseqhash.cc -o vendor/cigraph/src/isomorphism/bliss/uintseqhash.o g++ -std=gnu++17 -I"/usr/share/R/include" -DNDEBUG -DUSING_R -I. -Ivendor -Ivendor/cigraph/src -Ivendor/cigraph/include -Ivendor/cigraph/vendor -Ivendor/io/parsers -I/usr/include/libxml2 -DHAVE_LIBXML -DNDEBUG -DNTIMER -DNPRINT -DIGRAPH_THREAD_LOCAL= -DPRPACK_IGRAPH_SUPPORT -DHAVE_GFORTRAN=1 -D_GNU_SOURCE=1 -I'/home/omnipath/local/R/4.4-3.20/cpp11/include' -fvisibility=hidden -fpic -g -O2 -fno-omit-frame-pointer -mno-omit-leaf-frame-pointer -ffile-prefix-map=/build/r-base-EawLoD/r-base-4.4.1=. -fstack-protector-strong -fstack-clash-protection -Wformat -Werror=format-security -fcf-protection -fdebug-prefix-map=/build/r-base-EawLoD/r-base-4.4.1=/usr/src/r-base-4.4.1-1.2404.0 -Wdate-time -D_FORTIFY_SOURCE=3 -c vendor/cigraph/src/isomorphism/bliss/utils.cc -o vendor/cigraph/src/isomorphism/bliss/utils.o gcc -I"/usr/share/R/include" -DNDEBUG -DUSING_R -I. -Ivendor -Ivendor/cigraph/src -Ivendor/cigraph/include -Ivendor/cigraph/vendor -Ivendor/io/parsers -I/usr/include/libxml2 -DHAVE_LIBXML -DNDEBUG -DNTIMER -DNPRINT -DIGRAPH_THREAD_LOCAL= -DPRPACK_IGRAPH_SUPPORT -DHAVE_GFORTRAN=1 -D_GNU_SOURCE=1 -I'/home/omnipath/local/R/4.4-3.20/cpp11/include' -fvisibility=hidden -fpic -g -O2 -fno-omit-frame-pointer -mno-omit-leaf-frame-pointer -ffile-prefix-map=/build/r-base-EawLoD/r-base-4.4.1=. -fstack-protector-strong -fstack-clash-protection -Wformat -Werror=format-security -fcf-protection -fdebug-prefix-map=/build/r-base-EawLoD/r-base-4.4.1=/usr/src/r-base-4.4.1-1.2404.0 -Wdate-time -D_FORTIFY_SOURCE=3 -c vendor/cigraph/src/isomorphism/isoclasses.c -o vendor/cigraph/src/isomorphism/isoclasses.o gcc -I"/usr/share/R/include" -DNDEBUG -DUSING_R -I. -Ivendor -Ivendor/cigraph/src -Ivendor/cigraph/include -Ivendor/cigraph/vendor -Ivendor/io/parsers -I/usr/include/libxml2 -DHAVE_LIBXML -DNDEBUG -DNTIMER -DNPRINT -DIGRAPH_THREAD_LOCAL= -DPRPACK_IGRAPH_SUPPORT -DHAVE_GFORTRAN=1 -D_GNU_SOURCE=1 -I'/home/omnipath/local/R/4.4-3.20/cpp11/include' -fvisibility=hidden -fpic -g -O2 -fno-omit-frame-pointer -mno-omit-leaf-frame-pointer -ffile-prefix-map=/build/r-base-EawLoD/r-base-4.4.1=. -fstack-protector-strong -fstack-clash-protection -Wformat -Werror=format-security -fcf-protection -fdebug-prefix-map=/build/r-base-EawLoD/r-base-4.4.1=/usr/src/r-base-4.4.1-1.2404.0 -Wdate-time -D_FORTIFY_SOURCE=3 -c vendor/cigraph/src/isomorphism/isomorphism_misc.c -o vendor/cigraph/src/isomorphism/isomorphism_misc.o gcc -I"/usr/share/R/include" -DNDEBUG -DUSING_R -I. -Ivendor -Ivendor/cigraph/src -Ivendor/cigraph/include -Ivendor/cigraph/vendor -Ivendor/io/parsers -I/usr/include/libxml2 -DHAVE_LIBXML -DNDEBUG -DNTIMER -DNPRINT -DIGRAPH_THREAD_LOCAL= -DPRPACK_IGRAPH_SUPPORT -DHAVE_GFORTRAN=1 -D_GNU_SOURCE=1 -I'/home/omnipath/local/R/4.4-3.20/cpp11/include' -fvisibility=hidden -fpic -g -O2 -fno-omit-frame-pointer -mno-omit-leaf-frame-pointer -ffile-prefix-map=/build/r-base-EawLoD/r-base-4.4.1=. -fstack-protector-strong -fstack-clash-protection -Wformat -Werror=format-security -fcf-protection -fdebug-prefix-map=/build/r-base-EawLoD/r-base-4.4.1=/usr/src/r-base-4.4.1-1.2404.0 -Wdate-time -D_FORTIFY_SOURCE=3 -c vendor/cigraph/src/isomorphism/lad.c -o vendor/cigraph/src/isomorphism/lad.o gcc -I"/usr/share/R/include" -DNDEBUG -DUSING_R -I. -Ivendor -Ivendor/cigraph/src -Ivendor/cigraph/include -Ivendor/cigraph/vendor -Ivendor/io/parsers -I/usr/include/libxml2 -DHAVE_LIBXML -DNDEBUG -DNTIMER -DNPRINT -DIGRAPH_THREAD_LOCAL= -DPRPACK_IGRAPH_SUPPORT -DHAVE_GFORTRAN=1 -D_GNU_SOURCE=1 -I'/home/omnipath/local/R/4.4-3.20/cpp11/include' -fvisibility=hidden -fpic -g -O2 -fno-omit-frame-pointer -mno-omit-leaf-frame-pointer -ffile-prefix-map=/build/r-base-EawLoD/r-base-4.4.1=. -fstack-protector-strong -fstack-clash-protection -Wformat -Werror=format-security -fcf-protection -fdebug-prefix-map=/build/r-base-EawLoD/r-base-4.4.1=/usr/src/r-base-4.4.1-1.2404.0 -Wdate-time -D_FORTIFY_SOURCE=3 -c vendor/cigraph/src/isomorphism/queries.c -o vendor/cigraph/src/isomorphism/queries.o gcc -I"/usr/share/R/include" -DNDEBUG -DUSING_R -I. -Ivendor -Ivendor/cigraph/src -Ivendor/cigraph/include -Ivendor/cigraph/vendor -Ivendor/io/parsers -I/usr/include/libxml2 -DHAVE_LIBXML -DNDEBUG -DNTIMER -DNPRINT -DIGRAPH_THREAD_LOCAL= -DPRPACK_IGRAPH_SUPPORT -DHAVE_GFORTRAN=1 -D_GNU_SOURCE=1 -I'/home/omnipath/local/R/4.4-3.20/cpp11/include' -fvisibility=hidden -fpic -g -O2 -fno-omit-frame-pointer -mno-omit-leaf-frame-pointer -ffile-prefix-map=/build/r-base-EawLoD/r-base-4.4.1=. -fstack-protector-strong -fstack-clash-protection -Wformat -Werror=format-security -fcf-protection -fdebug-prefix-map=/build/r-base-EawLoD/r-base-4.4.1=/usr/src/r-base-4.4.1-1.2404.0 -Wdate-time -D_FORTIFY_SOURCE=3 -c vendor/cigraph/src/isomorphism/vf2.c -o vendor/cigraph/src/isomorphism/vf2.o gcc -I"/usr/share/R/include" -DNDEBUG -DUSING_R -I. -Ivendor -Ivendor/cigraph/src -Ivendor/cigraph/include -Ivendor/cigraph/vendor -Ivendor/io/parsers -I/usr/include/libxml2 -DHAVE_LIBXML -DNDEBUG -DNTIMER -DNPRINT -DIGRAPH_THREAD_LOCAL= -DPRPACK_IGRAPH_SUPPORT -DHAVE_GFORTRAN=1 -D_GNU_SOURCE=1 -I'/home/omnipath/local/R/4.4-3.20/cpp11/include' -fvisibility=hidden -fpic -g -O2 -fno-omit-frame-pointer -mno-omit-leaf-frame-pointer -ffile-prefix-map=/build/r-base-EawLoD/r-base-4.4.1=. -fstack-protector-strong -fstack-clash-protection -Wformat -Werror=format-security -fcf-protection -fdebug-prefix-map=/build/r-base-EawLoD/r-base-4.4.1=/usr/src/r-base-4.4.1-1.2404.0 -Wdate-time -D_FORTIFY_SOURCE=3 -c vendor/cigraph/src/layout/circular.c -o vendor/cigraph/src/layout/circular.o gcc -I"/usr/share/R/include" -DNDEBUG -DUSING_R -I. -Ivendor -Ivendor/cigraph/src -Ivendor/cigraph/include -Ivendor/cigraph/vendor -Ivendor/io/parsers -I/usr/include/libxml2 -DHAVE_LIBXML -DNDEBUG -DNTIMER -DNPRINT -DIGRAPH_THREAD_LOCAL= -DPRPACK_IGRAPH_SUPPORT -DHAVE_GFORTRAN=1 -D_GNU_SOURCE=1 -I'/home/omnipath/local/R/4.4-3.20/cpp11/include' -fvisibility=hidden -fpic -g -O2 -fno-omit-frame-pointer -mno-omit-leaf-frame-pointer -ffile-prefix-map=/build/r-base-EawLoD/r-base-4.4.1=. -fstack-protector-strong -fstack-clash-protection -Wformat -Werror=format-security -fcf-protection -fdebug-prefix-map=/build/r-base-EawLoD/r-base-4.4.1=/usr/src/r-base-4.4.1-1.2404.0 -Wdate-time -D_FORTIFY_SOURCE=3 -c vendor/cigraph/src/layout/davidson_harel.c -o vendor/cigraph/src/layout/davidson_harel.o g++ -std=gnu++17 -I"/usr/share/R/include" -DNDEBUG -DUSING_R -I. -Ivendor -Ivendor/cigraph/src -Ivendor/cigraph/include -Ivendor/cigraph/vendor -Ivendor/io/parsers -I/usr/include/libxml2 -DHAVE_LIBXML -DNDEBUG -DNTIMER -DNPRINT -DIGRAPH_THREAD_LOCAL= -DPRPACK_IGRAPH_SUPPORT -DHAVE_GFORTRAN=1 -D_GNU_SOURCE=1 -I'/home/omnipath/local/R/4.4-3.20/cpp11/include' -fvisibility=hidden -fpic -g -O2 -fno-omit-frame-pointer -mno-omit-leaf-frame-pointer -ffile-prefix-map=/build/r-base-EawLoD/r-base-4.4.1=. -fstack-protector-strong -fstack-clash-protection -Wformat -Werror=format-security -fcf-protection -fdebug-prefix-map=/build/r-base-EawLoD/r-base-4.4.1=/usr/src/r-base-4.4.1-1.2404.0 -Wdate-time -D_FORTIFY_SOURCE=3 -c vendor/cigraph/src/layout/drl/DensityGrid.cpp -o vendor/cigraph/src/layout/drl/DensityGrid.o g++ -std=gnu++17 -I"/usr/share/R/include" -DNDEBUG -DUSING_R -I. -Ivendor -Ivendor/cigraph/src -Ivendor/cigraph/include -Ivendor/cigraph/vendor -Ivendor/io/parsers -I/usr/include/libxml2 -DHAVE_LIBXML -DNDEBUG -DNTIMER -DNPRINT -DIGRAPH_THREAD_LOCAL= -DPRPACK_IGRAPH_SUPPORT -DHAVE_GFORTRAN=1 -D_GNU_SOURCE=1 -I'/home/omnipath/local/R/4.4-3.20/cpp11/include' -fvisibility=hidden -fpic -g -O2 -fno-omit-frame-pointer -mno-omit-leaf-frame-pointer -ffile-prefix-map=/build/r-base-EawLoD/r-base-4.4.1=. -fstack-protector-strong -fstack-clash-protection -Wformat -Werror=format-security -fcf-protection -fdebug-prefix-map=/build/r-base-EawLoD/r-base-4.4.1=/usr/src/r-base-4.4.1-1.2404.0 -Wdate-time -D_FORTIFY_SOURCE=3 -c vendor/cigraph/src/layout/drl/DensityGrid_3d.cpp -o vendor/cigraph/src/layout/drl/DensityGrid_3d.o g++ -std=gnu++17 -I"/usr/share/R/include" -DNDEBUG -DUSING_R -I. -Ivendor -Ivendor/cigraph/src -Ivendor/cigraph/include -Ivendor/cigraph/vendor -Ivendor/io/parsers -I/usr/include/libxml2 -DHAVE_LIBXML -DNDEBUG -DNTIMER -DNPRINT -DIGRAPH_THREAD_LOCAL= -DPRPACK_IGRAPH_SUPPORT -DHAVE_GFORTRAN=1 -D_GNU_SOURCE=1 -I'/home/omnipath/local/R/4.4-3.20/cpp11/include' -fvisibility=hidden -fpic -g -O2 -fno-omit-frame-pointer -mno-omit-leaf-frame-pointer -ffile-prefix-map=/build/r-base-EawLoD/r-base-4.4.1=. -fstack-protector-strong -fstack-clash-protection -Wformat -Werror=format-security -fcf-protection -fdebug-prefix-map=/build/r-base-EawLoD/r-base-4.4.1=/usr/src/r-base-4.4.1-1.2404.0 -Wdate-time -D_FORTIFY_SOURCE=3 -c vendor/cigraph/src/layout/drl/drl_graph.cpp -o vendor/cigraph/src/layout/drl/drl_graph.o g++ -std=gnu++17 -I"/usr/share/R/include" -DNDEBUG -DUSING_R -I. -Ivendor -Ivendor/cigraph/src -Ivendor/cigraph/include -Ivendor/cigraph/vendor -Ivendor/io/parsers -I/usr/include/libxml2 -DHAVE_LIBXML -DNDEBUG -DNTIMER -DNPRINT -DIGRAPH_THREAD_LOCAL= -DPRPACK_IGRAPH_SUPPORT -DHAVE_GFORTRAN=1 -D_GNU_SOURCE=1 -I'/home/omnipath/local/R/4.4-3.20/cpp11/include' -fvisibility=hidden -fpic -g -O2 -fno-omit-frame-pointer -mno-omit-leaf-frame-pointer -ffile-prefix-map=/build/r-base-EawLoD/r-base-4.4.1=. -fstack-protector-strong -fstack-clash-protection -Wformat -Werror=format-security -fcf-protection -fdebug-prefix-map=/build/r-base-EawLoD/r-base-4.4.1=/usr/src/r-base-4.4.1-1.2404.0 -Wdate-time -D_FORTIFY_SOURCE=3 -c vendor/cigraph/src/layout/drl/drl_graph_3d.cpp -o vendor/cigraph/src/layout/drl/drl_graph_3d.o g++ -std=gnu++17 -I"/usr/share/R/include" -DNDEBUG -DUSING_R -I. -Ivendor -Ivendor/cigraph/src -Ivendor/cigraph/include -Ivendor/cigraph/vendor -Ivendor/io/parsers -I/usr/include/libxml2 -DHAVE_LIBXML -DNDEBUG -DNTIMER -DNPRINT -DIGRAPH_THREAD_LOCAL= -DPRPACK_IGRAPH_SUPPORT -DHAVE_GFORTRAN=1 -D_GNU_SOURCE=1 -I'/home/omnipath/local/R/4.4-3.20/cpp11/include' -fvisibility=hidden -fpic -g -O2 -fno-omit-frame-pointer -mno-omit-leaf-frame-pointer -ffile-prefix-map=/build/r-base-EawLoD/r-base-4.4.1=. -fstack-protector-strong -fstack-clash-protection -Wformat -Werror=format-security -fcf-protection -fdebug-prefix-map=/build/r-base-EawLoD/r-base-4.4.1=/usr/src/r-base-4.4.1-1.2404.0 -Wdate-time -D_FORTIFY_SOURCE=3 -c vendor/cigraph/src/layout/drl/drl_layout.cpp -o vendor/cigraph/src/layout/drl/drl_layout.o g++ -std=gnu++17 -I"/usr/share/R/include" -DNDEBUG -DUSING_R -I. -Ivendor -Ivendor/cigraph/src -Ivendor/cigraph/include -Ivendor/cigraph/vendor -Ivendor/io/parsers -I/usr/include/libxml2 -DHAVE_LIBXML -DNDEBUG -DNTIMER -DNPRINT -DIGRAPH_THREAD_LOCAL= -DPRPACK_IGRAPH_SUPPORT -DHAVE_GFORTRAN=1 -D_GNU_SOURCE=1 -I'/home/omnipath/local/R/4.4-3.20/cpp11/include' -fvisibility=hidden -fpic -g -O2 -fno-omit-frame-pointer -mno-omit-leaf-frame-pointer -ffile-prefix-map=/build/r-base-EawLoD/r-base-4.4.1=. -fstack-protector-strong -fstack-clash-protection -Wformat -Werror=format-security -fcf-protection -fdebug-prefix-map=/build/r-base-EawLoD/r-base-4.4.1=/usr/src/r-base-4.4.1-1.2404.0 -Wdate-time -D_FORTIFY_SOURCE=3 -c vendor/cigraph/src/layout/drl/drl_layout_3d.cpp -o vendor/cigraph/src/layout/drl/drl_layout_3d.o g++ -std=gnu++17 -I"/usr/share/R/include" -DNDEBUG -DUSING_R -I. -Ivendor -Ivendor/cigraph/src -Ivendor/cigraph/include -Ivendor/cigraph/vendor -Ivendor/io/parsers -I/usr/include/libxml2 -DHAVE_LIBXML -DNDEBUG -DNTIMER -DNPRINT -DIGRAPH_THREAD_LOCAL= -DPRPACK_IGRAPH_SUPPORT -DHAVE_GFORTRAN=1 -D_GNU_SOURCE=1 -I'/home/omnipath/local/R/4.4-3.20/cpp11/include' -fvisibility=hidden -fpic -g -O2 -fno-omit-frame-pointer -mno-omit-leaf-frame-pointer -ffile-prefix-map=/build/r-base-EawLoD/r-base-4.4.1=. -fstack-protector-strong -fstack-clash-protection -Wformat -Werror=format-security -fcf-protection -fdebug-prefix-map=/build/r-base-EawLoD/r-base-4.4.1=/usr/src/r-base-4.4.1-1.2404.0 -Wdate-time -D_FORTIFY_SOURCE=3 -c vendor/cigraph/src/layout/drl/drl_parse.cpp -o vendor/cigraph/src/layout/drl/drl_parse.o gcc -I"/usr/share/R/include" -DNDEBUG -DUSING_R -I. -Ivendor -Ivendor/cigraph/src -Ivendor/cigraph/include -Ivendor/cigraph/vendor -Ivendor/io/parsers -I/usr/include/libxml2 -DHAVE_LIBXML -DNDEBUG -DNTIMER -DNPRINT -DIGRAPH_THREAD_LOCAL= -DPRPACK_IGRAPH_SUPPORT -DHAVE_GFORTRAN=1 -D_GNU_SOURCE=1 -I'/home/omnipath/local/R/4.4-3.20/cpp11/include' -fvisibility=hidden -fpic -g -O2 -fno-omit-frame-pointer -mno-omit-leaf-frame-pointer -ffile-prefix-map=/build/r-base-EawLoD/r-base-4.4.1=. -fstack-protector-strong -fstack-clash-protection -Wformat -Werror=format-security -fcf-protection -fdebug-prefix-map=/build/r-base-EawLoD/r-base-4.4.1=/usr/src/r-base-4.4.1-1.2404.0 -Wdate-time -D_FORTIFY_SOURCE=3 -c vendor/cigraph/src/layout/fruchterman_reingold.c -o vendor/cigraph/src/layout/fruchterman_reingold.o gcc -I"/usr/share/R/include" -DNDEBUG -DUSING_R -I. -Ivendor -Ivendor/cigraph/src -Ivendor/cigraph/include -Ivendor/cigraph/vendor -Ivendor/io/parsers -I/usr/include/libxml2 -DHAVE_LIBXML -DNDEBUG -DNTIMER -DNPRINT -DIGRAPH_THREAD_LOCAL= -DPRPACK_IGRAPH_SUPPORT -DHAVE_GFORTRAN=1 -D_GNU_SOURCE=1 -I'/home/omnipath/local/R/4.4-3.20/cpp11/include' -fvisibility=hidden -fpic -g -O2 -fno-omit-frame-pointer -mno-omit-leaf-frame-pointer -ffile-prefix-map=/build/r-base-EawLoD/r-base-4.4.1=. -fstack-protector-strong -fstack-clash-protection -Wformat -Werror=format-security -fcf-protection -fdebug-prefix-map=/build/r-base-EawLoD/r-base-4.4.1=/usr/src/r-base-4.4.1-1.2404.0 -Wdate-time -D_FORTIFY_SOURCE=3 -c vendor/cigraph/src/layout/gem.c -o vendor/cigraph/src/layout/gem.o gcc -I"/usr/share/R/include" -DNDEBUG -DUSING_R -I. -Ivendor -Ivendor/cigraph/src -Ivendor/cigraph/include -Ivendor/cigraph/vendor -Ivendor/io/parsers -I/usr/include/libxml2 -DHAVE_LIBXML -DNDEBUG -DNTIMER -DNPRINT -DIGRAPH_THREAD_LOCAL= -DPRPACK_IGRAPH_SUPPORT -DHAVE_GFORTRAN=1 -D_GNU_SOURCE=1 -I'/home/omnipath/local/R/4.4-3.20/cpp11/include' -fvisibility=hidden -fpic -g -O2 -fno-omit-frame-pointer -mno-omit-leaf-frame-pointer -ffile-prefix-map=/build/r-base-EawLoD/r-base-4.4.1=. -fstack-protector-strong -fstack-clash-protection -Wformat -Werror=format-security -fcf-protection -fdebug-prefix-map=/build/r-base-EawLoD/r-base-4.4.1=/usr/src/r-base-4.4.1-1.2404.0 -Wdate-time -D_FORTIFY_SOURCE=3 -c vendor/cigraph/src/layout/graphopt.c -o vendor/cigraph/src/layout/graphopt.o gcc -I"/usr/share/R/include" -DNDEBUG -DUSING_R -I. -Ivendor -Ivendor/cigraph/src -Ivendor/cigraph/include -Ivendor/cigraph/vendor -Ivendor/io/parsers -I/usr/include/libxml2 -DHAVE_LIBXML -DNDEBUG -DNTIMER -DNPRINT -DIGRAPH_THREAD_LOCAL= -DPRPACK_IGRAPH_SUPPORT -DHAVE_GFORTRAN=1 -D_GNU_SOURCE=1 -I'/home/omnipath/local/R/4.4-3.20/cpp11/include' -fvisibility=hidden -fpic -g -O2 -fno-omit-frame-pointer -mno-omit-leaf-frame-pointer -ffile-prefix-map=/build/r-base-EawLoD/r-base-4.4.1=. -fstack-protector-strong -fstack-clash-protection -Wformat -Werror=format-security -fcf-protection -fdebug-prefix-map=/build/r-base-EawLoD/r-base-4.4.1=/usr/src/r-base-4.4.1-1.2404.0 -Wdate-time -D_FORTIFY_SOURCE=3 -c vendor/cigraph/src/layout/kamada_kawai.c -o vendor/cigraph/src/layout/kamada_kawai.o gcc -I"/usr/share/R/include" -DNDEBUG -DUSING_R -I. -Ivendor -Ivendor/cigraph/src -Ivendor/cigraph/include -Ivendor/cigraph/vendor -Ivendor/io/parsers -I/usr/include/libxml2 -DHAVE_LIBXML -DNDEBUG -DNTIMER -DNPRINT -DIGRAPH_THREAD_LOCAL= -DPRPACK_IGRAPH_SUPPORT -DHAVE_GFORTRAN=1 -D_GNU_SOURCE=1 -I'/home/omnipath/local/R/4.4-3.20/cpp11/include' -fvisibility=hidden -fpic -g -O2 -fno-omit-frame-pointer -mno-omit-leaf-frame-pointer -ffile-prefix-map=/build/r-base-EawLoD/r-base-4.4.1=. -fstack-protector-strong -fstack-clash-protection -Wformat -Werror=format-security -fcf-protection -fdebug-prefix-map=/build/r-base-EawLoD/r-base-4.4.1=/usr/src/r-base-4.4.1-1.2404.0 -Wdate-time -D_FORTIFY_SOURCE=3 -c vendor/cigraph/src/layout/large_graph.c -o vendor/cigraph/src/layout/large_graph.o gcc -I"/usr/share/R/include" -DNDEBUG -DUSING_R -I. -Ivendor -Ivendor/cigraph/src -Ivendor/cigraph/include -Ivendor/cigraph/vendor -Ivendor/io/parsers -I/usr/include/libxml2 -DHAVE_LIBXML -DNDEBUG -DNTIMER -DNPRINT -DIGRAPH_THREAD_LOCAL= -DPRPACK_IGRAPH_SUPPORT -DHAVE_GFORTRAN=1 -D_GNU_SOURCE=1 -I'/home/omnipath/local/R/4.4-3.20/cpp11/include' -fvisibility=hidden -fpic -g -O2 -fno-omit-frame-pointer -mno-omit-leaf-frame-pointer -ffile-prefix-map=/build/r-base-EawLoD/r-base-4.4.1=. -fstack-protector-strong -fstack-clash-protection -Wformat -Werror=format-security -fcf-protection -fdebug-prefix-map=/build/r-base-EawLoD/r-base-4.4.1=/usr/src/r-base-4.4.1-1.2404.0 -Wdate-time -D_FORTIFY_SOURCE=3 -c vendor/cigraph/src/layout/layout_bipartite.c -o vendor/cigraph/src/layout/layout_bipartite.o gcc -I"/usr/share/R/include" -DNDEBUG -DUSING_R -I. -Ivendor -Ivendor/cigraph/src -Ivendor/cigraph/include -Ivendor/cigraph/vendor -Ivendor/io/parsers -I/usr/include/libxml2 -DHAVE_LIBXML -DNDEBUG -DNTIMER -DNPRINT -DIGRAPH_THREAD_LOCAL= -DPRPACK_IGRAPH_SUPPORT -DHAVE_GFORTRAN=1 -D_GNU_SOURCE=1 -I'/home/omnipath/local/R/4.4-3.20/cpp11/include' -fvisibility=hidden -fpic -g -O2 -fno-omit-frame-pointer -mno-omit-leaf-frame-pointer -ffile-prefix-map=/build/r-base-EawLoD/r-base-4.4.1=. -fstack-protector-strong -fstack-clash-protection -Wformat -Werror=format-security -fcf-protection -fdebug-prefix-map=/build/r-base-EawLoD/r-base-4.4.1=/usr/src/r-base-4.4.1-1.2404.0 -Wdate-time -D_FORTIFY_SOURCE=3 -c vendor/cigraph/src/layout/layout_grid.c -o vendor/cigraph/src/layout/layout_grid.o gcc -I"/usr/share/R/include" -DNDEBUG -DUSING_R -I. -Ivendor -Ivendor/cigraph/src -Ivendor/cigraph/include -Ivendor/cigraph/vendor -Ivendor/io/parsers -I/usr/include/libxml2 -DHAVE_LIBXML -DNDEBUG -DNTIMER -DNPRINT -DIGRAPH_THREAD_LOCAL= -DPRPACK_IGRAPH_SUPPORT -DHAVE_GFORTRAN=1 -D_GNU_SOURCE=1 -I'/home/omnipath/local/R/4.4-3.20/cpp11/include' -fvisibility=hidden -fpic -g -O2 -fno-omit-frame-pointer -mno-omit-leaf-frame-pointer -ffile-prefix-map=/build/r-base-EawLoD/r-base-4.4.1=. -fstack-protector-strong -fstack-clash-protection -Wformat -Werror=format-security -fcf-protection -fdebug-prefix-map=/build/r-base-EawLoD/r-base-4.4.1=/usr/src/r-base-4.4.1-1.2404.0 -Wdate-time -D_FORTIFY_SOURCE=3 -c vendor/cigraph/src/layout/layout_random.c -o vendor/cigraph/src/layout/layout_random.o gcc -I"/usr/share/R/include" -DNDEBUG -DUSING_R -I. -Ivendor -Ivendor/cigraph/src -Ivendor/cigraph/include -Ivendor/cigraph/vendor -Ivendor/io/parsers -I/usr/include/libxml2 -DHAVE_LIBXML -DNDEBUG -DNTIMER -DNPRINT -DIGRAPH_THREAD_LOCAL= -DPRPACK_IGRAPH_SUPPORT -DHAVE_GFORTRAN=1 -D_GNU_SOURCE=1 -I'/home/omnipath/local/R/4.4-3.20/cpp11/include' -fvisibility=hidden -fpic -g -O2 -fno-omit-frame-pointer -mno-omit-leaf-frame-pointer -ffile-prefix-map=/build/r-base-EawLoD/r-base-4.4.1=. -fstack-protector-strong -fstack-clash-protection -Wformat -Werror=format-security -fcf-protection -fdebug-prefix-map=/build/r-base-EawLoD/r-base-4.4.1=/usr/src/r-base-4.4.1-1.2404.0 -Wdate-time -D_FORTIFY_SOURCE=3 -c vendor/cigraph/src/layout/mds.c -o vendor/cigraph/src/layout/mds.o gcc -I"/usr/share/R/include" -DNDEBUG -DUSING_R -I. -Ivendor -Ivendor/cigraph/src -Ivendor/cigraph/include -Ivendor/cigraph/vendor -Ivendor/io/parsers -I/usr/include/libxml2 -DHAVE_LIBXML -DNDEBUG -DNTIMER -DNPRINT -DIGRAPH_THREAD_LOCAL= -DPRPACK_IGRAPH_SUPPORT -DHAVE_GFORTRAN=1 -D_GNU_SOURCE=1 -I'/home/omnipath/local/R/4.4-3.20/cpp11/include' -fvisibility=hidden -fpic -g -O2 -fno-omit-frame-pointer -mno-omit-leaf-frame-pointer -ffile-prefix-map=/build/r-base-EawLoD/r-base-4.4.1=. -fstack-protector-strong -fstack-clash-protection -Wformat -Werror=format-security -fcf-protection -fdebug-prefix-map=/build/r-base-EawLoD/r-base-4.4.1=/usr/src/r-base-4.4.1-1.2404.0 -Wdate-time -D_FORTIFY_SOURCE=3 -c vendor/cigraph/src/layout/merge_dla.c -o vendor/cigraph/src/layout/merge_dla.o gcc -I"/usr/share/R/include" -DNDEBUG -DUSING_R -I. -Ivendor -Ivendor/cigraph/src -Ivendor/cigraph/include -Ivendor/cigraph/vendor -Ivendor/io/parsers -I/usr/include/libxml2 -DHAVE_LIBXML -DNDEBUG -DNTIMER -DNPRINT -DIGRAPH_THREAD_LOCAL= -DPRPACK_IGRAPH_SUPPORT -DHAVE_GFORTRAN=1 -D_GNU_SOURCE=1 -I'/home/omnipath/local/R/4.4-3.20/cpp11/include' -fvisibility=hidden -fpic -g -O2 -fno-omit-frame-pointer -mno-omit-leaf-frame-pointer -ffile-prefix-map=/build/r-base-EawLoD/r-base-4.4.1=. -fstack-protector-strong -fstack-clash-protection -Wformat -Werror=format-security -fcf-protection -fdebug-prefix-map=/build/r-base-EawLoD/r-base-4.4.1=/usr/src/r-base-4.4.1-1.2404.0 -Wdate-time -D_FORTIFY_SOURCE=3 -c vendor/cigraph/src/layout/merge_grid.c -o vendor/cigraph/src/layout/merge_grid.o gcc -I"/usr/share/R/include" -DNDEBUG -DUSING_R -I. -Ivendor -Ivendor/cigraph/src -Ivendor/cigraph/include -Ivendor/cigraph/vendor -Ivendor/io/parsers -I/usr/include/libxml2 -DHAVE_LIBXML -DNDEBUG -DNTIMER -DNPRINT -DIGRAPH_THREAD_LOCAL= -DPRPACK_IGRAPH_SUPPORT -DHAVE_GFORTRAN=1 -D_GNU_SOURCE=1 -I'/home/omnipath/local/R/4.4-3.20/cpp11/include' -fvisibility=hidden -fpic -g -O2 -fno-omit-frame-pointer -mno-omit-leaf-frame-pointer -ffile-prefix-map=/build/r-base-EawLoD/r-base-4.4.1=. -fstack-protector-strong -fstack-clash-protection -Wformat -Werror=format-security -fcf-protection -fdebug-prefix-map=/build/r-base-EawLoD/r-base-4.4.1=/usr/src/r-base-4.4.1-1.2404.0 -Wdate-time -D_FORTIFY_SOURCE=3 -c vendor/cigraph/src/layout/reingold_tilford.c -o vendor/cigraph/src/layout/reingold_tilford.o gcc -I"/usr/share/R/include" -DNDEBUG -DUSING_R -I. -Ivendor -Ivendor/cigraph/src -Ivendor/cigraph/include -Ivendor/cigraph/vendor -Ivendor/io/parsers -I/usr/include/libxml2 -DHAVE_LIBXML -DNDEBUG -DNTIMER -DNPRINT -DIGRAPH_THREAD_LOCAL= -DPRPACK_IGRAPH_SUPPORT -DHAVE_GFORTRAN=1 -D_GNU_SOURCE=1 -I'/home/omnipath/local/R/4.4-3.20/cpp11/include' -fvisibility=hidden -fpic -g -O2 -fno-omit-frame-pointer -mno-omit-leaf-frame-pointer -ffile-prefix-map=/build/r-base-EawLoD/r-base-4.4.1=. -fstack-protector-strong -fstack-clash-protection -Wformat -Werror=format-security -fcf-protection -fdebug-prefix-map=/build/r-base-EawLoD/r-base-4.4.1=/usr/src/r-base-4.4.1-1.2404.0 -Wdate-time -D_FORTIFY_SOURCE=3 -c vendor/cigraph/src/layout/sugiyama.c -o vendor/cigraph/src/layout/sugiyama.o gcc -I"/usr/share/R/include" -DNDEBUG -DUSING_R -I. -Ivendor -Ivendor/cigraph/src -Ivendor/cigraph/include -Ivendor/cigraph/vendor -Ivendor/io/parsers -I/usr/include/libxml2 -DHAVE_LIBXML -DNDEBUG -DNTIMER -DNPRINT -DIGRAPH_THREAD_LOCAL= -DPRPACK_IGRAPH_SUPPORT -DHAVE_GFORTRAN=1 -D_GNU_SOURCE=1 -I'/home/omnipath/local/R/4.4-3.20/cpp11/include' -fvisibility=hidden -fpic -g -O2 -fno-omit-frame-pointer -mno-omit-leaf-frame-pointer -ffile-prefix-map=/build/r-base-EawLoD/r-base-4.4.1=. -fstack-protector-strong -fstack-clash-protection -Wformat -Werror=format-security -fcf-protection -fdebug-prefix-map=/build/r-base-EawLoD/r-base-4.4.1=/usr/src/r-base-4.4.1-1.2404.0 -Wdate-time -D_FORTIFY_SOURCE=3 -c vendor/cigraph/src/layout/umap.c -o vendor/cigraph/src/layout/umap.o gcc -I"/usr/share/R/include" -DNDEBUG -DUSING_R -I. -Ivendor -Ivendor/cigraph/src -Ivendor/cigraph/include -Ivendor/cigraph/vendor -Ivendor/io/parsers -I/usr/include/libxml2 -DHAVE_LIBXML -DNDEBUG -DNTIMER -DNPRINT -DIGRAPH_THREAD_LOCAL= -DPRPACK_IGRAPH_SUPPORT -DHAVE_GFORTRAN=1 -D_GNU_SOURCE=1 -I'/home/omnipath/local/R/4.4-3.20/cpp11/include' -fvisibility=hidden -fpic -g -O2 -fno-omit-frame-pointer -mno-omit-leaf-frame-pointer -ffile-prefix-map=/build/r-base-EawLoD/r-base-4.4.1=. -fstack-protector-strong -fstack-clash-protection -Wformat -Werror=format-security -fcf-protection -fdebug-prefix-map=/build/r-base-EawLoD/r-base-4.4.1=/usr/src/r-base-4.4.1-1.2404.0 -Wdate-time -D_FORTIFY_SOURCE=3 -c vendor/cigraph/src/linalg/arpack.c -o vendor/cigraph/src/linalg/arpack.o gcc -I"/usr/share/R/include" -DNDEBUG -DUSING_R -I. -Ivendor -Ivendor/cigraph/src -Ivendor/cigraph/include -Ivendor/cigraph/vendor -Ivendor/io/parsers -I/usr/include/libxml2 -DHAVE_LIBXML -DNDEBUG -DNTIMER -DNPRINT -DIGRAPH_THREAD_LOCAL= -DPRPACK_IGRAPH_SUPPORT -DHAVE_GFORTRAN=1 -D_GNU_SOURCE=1 -I'/home/omnipath/local/R/4.4-3.20/cpp11/include' -fvisibility=hidden -fpic -g -O2 -fno-omit-frame-pointer -mno-omit-leaf-frame-pointer -ffile-prefix-map=/build/r-base-EawLoD/r-base-4.4.1=. -fstack-protector-strong -fstack-clash-protection -Wformat -Werror=format-security -fcf-protection -fdebug-prefix-map=/build/r-base-EawLoD/r-base-4.4.1=/usr/src/r-base-4.4.1-1.2404.0 -Wdate-time -D_FORTIFY_SOURCE=3 -c vendor/cigraph/src/linalg/blas.c -o vendor/cigraph/src/linalg/blas.o gcc -I"/usr/share/R/include" -DNDEBUG -DUSING_R -I. -Ivendor -Ivendor/cigraph/src -Ivendor/cigraph/include -Ivendor/cigraph/vendor -Ivendor/io/parsers -I/usr/include/libxml2 -DHAVE_LIBXML -DNDEBUG -DNTIMER -DNPRINT -DIGRAPH_THREAD_LOCAL= -DPRPACK_IGRAPH_SUPPORT -DHAVE_GFORTRAN=1 -D_GNU_SOURCE=1 -I'/home/omnipath/local/R/4.4-3.20/cpp11/include' -fvisibility=hidden -fpic -g -O2 -fno-omit-frame-pointer -mno-omit-leaf-frame-pointer -ffile-prefix-map=/build/r-base-EawLoD/r-base-4.4.1=. -fstack-protector-strong -fstack-clash-protection -Wformat -Werror=format-security -fcf-protection -fdebug-prefix-map=/build/r-base-EawLoD/r-base-4.4.1=/usr/src/r-base-4.4.1-1.2404.0 -Wdate-time -D_FORTIFY_SOURCE=3 -c vendor/cigraph/src/linalg/eigen.c -o vendor/cigraph/src/linalg/eigen.o gcc -I"/usr/share/R/include" -DNDEBUG -DUSING_R -I. -Ivendor -Ivendor/cigraph/src -Ivendor/cigraph/include -Ivendor/cigraph/vendor -Ivendor/io/parsers -I/usr/include/libxml2 -DHAVE_LIBXML -DNDEBUG -DNTIMER -DNPRINT -DIGRAPH_THREAD_LOCAL= -DPRPACK_IGRAPH_SUPPORT -DHAVE_GFORTRAN=1 -D_GNU_SOURCE=1 -I'/home/omnipath/local/R/4.4-3.20/cpp11/include' -fvisibility=hidden -fpic -g -O2 -fno-omit-frame-pointer -mno-omit-leaf-frame-pointer -ffile-prefix-map=/build/r-base-EawLoD/r-base-4.4.1=. -fstack-protector-strong -fstack-clash-protection -Wformat -Werror=format-security -fcf-protection -fdebug-prefix-map=/build/r-base-EawLoD/r-base-4.4.1=/usr/src/r-base-4.4.1-1.2404.0 -Wdate-time -D_FORTIFY_SOURCE=3 -c vendor/cigraph/src/linalg/lapack.c -o vendor/cigraph/src/linalg/lapack.o gcc -I"/usr/share/R/include" -DNDEBUG -DUSING_R -I. -Ivendor -Ivendor/cigraph/src -Ivendor/cigraph/include -Ivendor/cigraph/vendor -Ivendor/io/parsers -I/usr/include/libxml2 -DHAVE_LIBXML -DNDEBUG -DNTIMER -DNPRINT -DIGRAPH_THREAD_LOCAL= -DPRPACK_IGRAPH_SUPPORT -DHAVE_GFORTRAN=1 -D_GNU_SOURCE=1 -I'/home/omnipath/local/R/4.4-3.20/cpp11/include' -fvisibility=hidden -fpic -g -O2 -fno-omit-frame-pointer -mno-omit-leaf-frame-pointer -ffile-prefix-map=/build/r-base-EawLoD/r-base-4.4.1=. -fstack-protector-strong -fstack-clash-protection -Wformat -Werror=format-security -fcf-protection -fdebug-prefix-map=/build/r-base-EawLoD/r-base-4.4.1=/usr/src/r-base-4.4.1-1.2404.0 -Wdate-time -D_FORTIFY_SOURCE=3 -c vendor/cigraph/src/math/complex.c -o vendor/cigraph/src/math/complex.o gcc -I"/usr/share/R/include" -DNDEBUG -DUSING_R -I. -Ivendor -Ivendor/cigraph/src -Ivendor/cigraph/include -Ivendor/cigraph/vendor -Ivendor/io/parsers -I/usr/include/libxml2 -DHAVE_LIBXML -DNDEBUG -DNTIMER -DNPRINT -DIGRAPH_THREAD_LOCAL= -DPRPACK_IGRAPH_SUPPORT -DHAVE_GFORTRAN=1 -D_GNU_SOURCE=1 -I'/home/omnipath/local/R/4.4-3.20/cpp11/include' -fvisibility=hidden -fpic -g -O2 -fno-omit-frame-pointer -mno-omit-leaf-frame-pointer -ffile-prefix-map=/build/r-base-EawLoD/r-base-4.4.1=. -fstack-protector-strong -fstack-clash-protection -Wformat -Werror=format-security -fcf-protection -fdebug-prefix-map=/build/r-base-EawLoD/r-base-4.4.1=/usr/src/r-base-4.4.1-1.2404.0 -Wdate-time -D_FORTIFY_SOURCE=3 -c vendor/cigraph/src/math/safe_intop.c -o vendor/cigraph/src/math/safe_intop.o gcc -I"/usr/share/R/include" -DNDEBUG -DUSING_R -I. -Ivendor -Ivendor/cigraph/src -Ivendor/cigraph/include -Ivendor/cigraph/vendor -Ivendor/io/parsers -I/usr/include/libxml2 -DHAVE_LIBXML -DNDEBUG -DNTIMER -DNPRINT -DIGRAPH_THREAD_LOCAL= -DPRPACK_IGRAPH_SUPPORT -DHAVE_GFORTRAN=1 -D_GNU_SOURCE=1 -I'/home/omnipath/local/R/4.4-3.20/cpp11/include' -fvisibility=hidden -fpic -g -O2 -fno-omit-frame-pointer -mno-omit-leaf-frame-pointer -ffile-prefix-map=/build/r-base-EawLoD/r-base-4.4.1=. -fstack-protector-strong -fstack-clash-protection -Wformat -Werror=format-security -fcf-protection -fdebug-prefix-map=/build/r-base-EawLoD/r-base-4.4.1=/usr/src/r-base-4.4.1-1.2404.0 -Wdate-time -D_FORTIFY_SOURCE=3 -c vendor/cigraph/src/math/utils.c -o vendor/cigraph/src/math/utils.o gcc -I"/usr/share/R/include" -DNDEBUG -DUSING_R -I. -Ivendor -Ivendor/cigraph/src -Ivendor/cigraph/include -Ivendor/cigraph/vendor -Ivendor/io/parsers -I/usr/include/libxml2 -DHAVE_LIBXML -DNDEBUG -DNTIMER -DNPRINT -DIGRAPH_THREAD_LOCAL= -DPRPACK_IGRAPH_SUPPORT -DHAVE_GFORTRAN=1 -D_GNU_SOURCE=1 -I'/home/omnipath/local/R/4.4-3.20/cpp11/include' -fvisibility=hidden -fpic -g -O2 -fno-omit-frame-pointer -mno-omit-leaf-frame-pointer -ffile-prefix-map=/build/r-base-EawLoD/r-base-4.4.1=. -fstack-protector-strong -fstack-clash-protection -Wformat -Werror=format-security -fcf-protection -fdebug-prefix-map=/build/r-base-EawLoD/r-base-4.4.1=/usr/src/r-base-4.4.1-1.2404.0 -Wdate-time -D_FORTIFY_SOURCE=3 -c vendor/cigraph/src/misc/bipartite.c -o vendor/cigraph/src/misc/bipartite.o gcc -I"/usr/share/R/include" -DNDEBUG -DUSING_R -I. -Ivendor -Ivendor/cigraph/src -Ivendor/cigraph/include -Ivendor/cigraph/vendor -Ivendor/io/parsers -I/usr/include/libxml2 -DHAVE_LIBXML -DNDEBUG -DNTIMER -DNPRINT -DIGRAPH_THREAD_LOCAL= -DPRPACK_IGRAPH_SUPPORT -DHAVE_GFORTRAN=1 -D_GNU_SOURCE=1 -I'/home/omnipath/local/R/4.4-3.20/cpp11/include' -fvisibility=hidden -fpic -g -O2 -fno-omit-frame-pointer -mno-omit-leaf-frame-pointer -ffile-prefix-map=/build/r-base-EawLoD/r-base-4.4.1=. -fstack-protector-strong -fstack-clash-protection -Wformat -Werror=format-security -fcf-protection -fdebug-prefix-map=/build/r-base-EawLoD/r-base-4.4.1=/usr/src/r-base-4.4.1-1.2404.0 -Wdate-time -D_FORTIFY_SOURCE=3 -c vendor/cigraph/src/misc/chordality.c -o vendor/cigraph/src/misc/chordality.o gcc -I"/usr/share/R/include" -DNDEBUG -DUSING_R -I. -Ivendor -Ivendor/cigraph/src -Ivendor/cigraph/include -Ivendor/cigraph/vendor -Ivendor/io/parsers -I/usr/include/libxml2 -DHAVE_LIBXML -DNDEBUG -DNTIMER -DNPRINT -DIGRAPH_THREAD_LOCAL= -DPRPACK_IGRAPH_SUPPORT -DHAVE_GFORTRAN=1 -D_GNU_SOURCE=1 -I'/home/omnipath/local/R/4.4-3.20/cpp11/include' -fvisibility=hidden -fpic -g -O2 -fno-omit-frame-pointer -mno-omit-leaf-frame-pointer -ffile-prefix-map=/build/r-base-EawLoD/r-base-4.4.1=. -fstack-protector-strong -fstack-clash-protection -Wformat -Werror=format-security -fcf-protection -fdebug-prefix-map=/build/r-base-EawLoD/r-base-4.4.1=/usr/src/r-base-4.4.1-1.2404.0 -Wdate-time -D_FORTIFY_SOURCE=3 -c vendor/cigraph/src/misc/cocitation.c -o vendor/cigraph/src/misc/cocitation.o gcc -I"/usr/share/R/include" -DNDEBUG -DUSING_R -I. -Ivendor -Ivendor/cigraph/src -Ivendor/cigraph/include -Ivendor/cigraph/vendor -Ivendor/io/parsers -I/usr/include/libxml2 -DHAVE_LIBXML -DNDEBUG -DNTIMER -DNPRINT -DIGRAPH_THREAD_LOCAL= -DPRPACK_IGRAPH_SUPPORT -DHAVE_GFORTRAN=1 -D_GNU_SOURCE=1 -I'/home/omnipath/local/R/4.4-3.20/cpp11/include' -fvisibility=hidden -fpic -g -O2 -fno-omit-frame-pointer -mno-omit-leaf-frame-pointer -ffile-prefix-map=/build/r-base-EawLoD/r-base-4.4.1=. -fstack-protector-strong -fstack-clash-protection -Wformat -Werror=format-security -fcf-protection -fdebug-prefix-map=/build/r-base-EawLoD/r-base-4.4.1=/usr/src/r-base-4.4.1-1.2404.0 -Wdate-time -D_FORTIFY_SOURCE=3 -c vendor/cigraph/src/misc/coloring.c -o vendor/cigraph/src/misc/coloring.o gcc -I"/usr/share/R/include" -DNDEBUG -DUSING_R -I. -Ivendor -Ivendor/cigraph/src -Ivendor/cigraph/include -Ivendor/cigraph/vendor -Ivendor/io/parsers -I/usr/include/libxml2 -DHAVE_LIBXML -DNDEBUG -DNTIMER -DNPRINT -DIGRAPH_THREAD_LOCAL= -DPRPACK_IGRAPH_SUPPORT -DHAVE_GFORTRAN=1 -D_GNU_SOURCE=1 -I'/home/omnipath/local/R/4.4-3.20/cpp11/include' -fvisibility=hidden -fpic -g -O2 -fno-omit-frame-pointer -mno-omit-leaf-frame-pointer -ffile-prefix-map=/build/r-base-EawLoD/r-base-4.4.1=. -fstack-protector-strong -fstack-clash-protection -Wformat -Werror=format-security -fcf-protection -fdebug-prefix-map=/build/r-base-EawLoD/r-base-4.4.1=/usr/src/r-base-4.4.1-1.2404.0 -Wdate-time -D_FORTIFY_SOURCE=3 -c vendor/cigraph/src/misc/conversion.c -o vendor/cigraph/src/misc/conversion.o gcc -I"/usr/share/R/include" -DNDEBUG -DUSING_R -I. -Ivendor -Ivendor/cigraph/src -Ivendor/cigraph/include -Ivendor/cigraph/vendor -Ivendor/io/parsers -I/usr/include/libxml2 -DHAVE_LIBXML -DNDEBUG -DNTIMER -DNPRINT -DIGRAPH_THREAD_LOCAL= -DPRPACK_IGRAPH_SUPPORT -DHAVE_GFORTRAN=1 -D_GNU_SOURCE=1 -I'/home/omnipath/local/R/4.4-3.20/cpp11/include' -fvisibility=hidden -fpic -g -O2 -fno-omit-frame-pointer -mno-omit-leaf-frame-pointer -ffile-prefix-map=/build/r-base-EawLoD/r-base-4.4.1=. -fstack-protector-strong -fstack-clash-protection -Wformat -Werror=format-security -fcf-protection -fdebug-prefix-map=/build/r-base-EawLoD/r-base-4.4.1=/usr/src/r-base-4.4.1-1.2404.0 -Wdate-time -D_FORTIFY_SOURCE=3 -c vendor/cigraph/src/misc/cycle_bases.c -o vendor/cigraph/src/misc/cycle_bases.o g++ -std=gnu++17 -I"/usr/share/R/include" -DNDEBUG -DUSING_R -I. -Ivendor -Ivendor/cigraph/src -Ivendor/cigraph/include -Ivendor/cigraph/vendor -Ivendor/io/parsers -I/usr/include/libxml2 -DHAVE_LIBXML -DNDEBUG -DNTIMER -DNPRINT -DIGRAPH_THREAD_LOCAL= -DPRPACK_IGRAPH_SUPPORT -DHAVE_GFORTRAN=1 -D_GNU_SOURCE=1 -I'/home/omnipath/local/R/4.4-3.20/cpp11/include' -fvisibility=hidden -fpic -g -O2 -fno-omit-frame-pointer -mno-omit-leaf-frame-pointer -ffile-prefix-map=/build/r-base-EawLoD/r-base-4.4.1=. -fstack-protector-strong -fstack-clash-protection -Wformat -Werror=format-security -fcf-protection -fdebug-prefix-map=/build/r-base-EawLoD/r-base-4.4.1=/usr/src/r-base-4.4.1-1.2404.0 -Wdate-time -D_FORTIFY_SOURCE=3 -c vendor/cigraph/src/misc/degree_sequence.cpp -o vendor/cigraph/src/misc/degree_sequence.o gcc -I"/usr/share/R/include" -DNDEBUG -DUSING_R -I. -Ivendor -Ivendor/cigraph/src -Ivendor/cigraph/include -Ivendor/cigraph/vendor -Ivendor/io/parsers -I/usr/include/libxml2 -DHAVE_LIBXML -DNDEBUG -DNTIMER -DNPRINT -DIGRAPH_THREAD_LOCAL= -DPRPACK_IGRAPH_SUPPORT -DHAVE_GFORTRAN=1 -D_GNU_SOURCE=1 -I'/home/omnipath/local/R/4.4-3.20/cpp11/include' -fvisibility=hidden -fpic -g -O2 -fno-omit-frame-pointer -mno-omit-leaf-frame-pointer -ffile-prefix-map=/build/r-base-EawLoD/r-base-4.4.1=. -fstack-protector-strong -fstack-clash-protection -Wformat -Werror=format-security -fcf-protection -fdebug-prefix-map=/build/r-base-EawLoD/r-base-4.4.1=/usr/src/r-base-4.4.1-1.2404.0 -Wdate-time -D_FORTIFY_SOURCE=3 -c vendor/cigraph/src/misc/embedding.c -o vendor/cigraph/src/misc/embedding.o gcc -I"/usr/share/R/include" -DNDEBUG -DUSING_R -I. -Ivendor -Ivendor/cigraph/src -Ivendor/cigraph/include -Ivendor/cigraph/vendor -Ivendor/io/parsers -I/usr/include/libxml2 -DHAVE_LIBXML -DNDEBUG -DNTIMER -DNPRINT -DIGRAPH_THREAD_LOCAL= -DPRPACK_IGRAPH_SUPPORT -DHAVE_GFORTRAN=1 -D_GNU_SOURCE=1 -I'/home/omnipath/local/R/4.4-3.20/cpp11/include' -fvisibility=hidden -fpic -g -O2 -fno-omit-frame-pointer -mno-omit-leaf-frame-pointer -ffile-prefix-map=/build/r-base-EawLoD/r-base-4.4.1=. -fstack-protector-strong -fstack-clash-protection -Wformat -Werror=format-security -fcf-protection -fdebug-prefix-map=/build/r-base-EawLoD/r-base-4.4.1=/usr/src/r-base-4.4.1-1.2404.0 -Wdate-time -D_FORTIFY_SOURCE=3 -c vendor/cigraph/src/misc/feedback_arc_set.c -o vendor/cigraph/src/misc/feedback_arc_set.o gcc -I"/usr/share/R/include" -DNDEBUG -DUSING_R -I. -Ivendor -Ivendor/cigraph/src -Ivendor/cigraph/include -Ivendor/cigraph/vendor -Ivendor/io/parsers -I/usr/include/libxml2 -DHAVE_LIBXML -DNDEBUG -DNTIMER -DNPRINT -DIGRAPH_THREAD_LOCAL= -DPRPACK_IGRAPH_SUPPORT -DHAVE_GFORTRAN=1 -D_GNU_SOURCE=1 -I'/home/omnipath/local/R/4.4-3.20/cpp11/include' -fvisibility=hidden -fpic -g -O2 -fno-omit-frame-pointer -mno-omit-leaf-frame-pointer -ffile-prefix-map=/build/r-base-EawLoD/r-base-4.4.1=. -fstack-protector-strong -fstack-clash-protection -Wformat -Werror=format-security -fcf-protection -fdebug-prefix-map=/build/r-base-EawLoD/r-base-4.4.1=/usr/src/r-base-4.4.1-1.2404.0 -Wdate-time -D_FORTIFY_SOURCE=3 -c vendor/cigraph/src/misc/graphicality.c -o vendor/cigraph/src/misc/graphicality.o gcc -I"/usr/share/R/include" -DNDEBUG -DUSING_R -I. -Ivendor -Ivendor/cigraph/src -Ivendor/cigraph/include -Ivendor/cigraph/vendor -Ivendor/io/parsers -I/usr/include/libxml2 -DHAVE_LIBXML -DNDEBUG -DNTIMER -DNPRINT -DIGRAPH_THREAD_LOCAL= -DPRPACK_IGRAPH_SUPPORT -DHAVE_GFORTRAN=1 -D_GNU_SOURCE=1 -I'/home/omnipath/local/R/4.4-3.20/cpp11/include' -fvisibility=hidden -fpic -g -O2 -fno-omit-frame-pointer -mno-omit-leaf-frame-pointer -ffile-prefix-map=/build/r-base-EawLoD/r-base-4.4.1=. -fstack-protector-strong -fstack-clash-protection -Wformat -Werror=format-security -fcf-protection -fdebug-prefix-map=/build/r-base-EawLoD/r-base-4.4.1=/usr/src/r-base-4.4.1-1.2404.0 -Wdate-time -D_FORTIFY_SOURCE=3 -c vendor/cigraph/src/misc/matching.c -o vendor/cigraph/src/misc/matching.o gcc -I"/usr/share/R/include" -DNDEBUG -DUSING_R -I. -Ivendor -Ivendor/cigraph/src -Ivendor/cigraph/include -Ivendor/cigraph/vendor -Ivendor/io/parsers -I/usr/include/libxml2 -DHAVE_LIBXML -DNDEBUG -DNTIMER -DNPRINT -DIGRAPH_THREAD_LOCAL= -DPRPACK_IGRAPH_SUPPORT -DHAVE_GFORTRAN=1 -D_GNU_SOURCE=1 -I'/home/omnipath/local/R/4.4-3.20/cpp11/include' -fvisibility=hidden -fpic -g -O2 -fno-omit-frame-pointer -mno-omit-leaf-frame-pointer -ffile-prefix-map=/build/r-base-EawLoD/r-base-4.4.1=. -fstack-protector-strong -fstack-clash-protection -Wformat -Werror=format-security -fcf-protection -fdebug-prefix-map=/build/r-base-EawLoD/r-base-4.4.1=/usr/src/r-base-4.4.1-1.2404.0 -Wdate-time -D_FORTIFY_SOURCE=3 -c vendor/cigraph/src/misc/microscopic_update.c -o vendor/cigraph/src/misc/microscopic_update.o gcc -I"/usr/share/R/include" -DNDEBUG -DUSING_R -I. -Ivendor -Ivendor/cigraph/src -Ivendor/cigraph/include -Ivendor/cigraph/vendor -Ivendor/io/parsers -I/usr/include/libxml2 -DHAVE_LIBXML -DNDEBUG -DNTIMER -DNPRINT -DIGRAPH_THREAD_LOCAL= -DPRPACK_IGRAPH_SUPPORT -DHAVE_GFORTRAN=1 -D_GNU_SOURCE=1 -I'/home/omnipath/local/R/4.4-3.20/cpp11/include' -fvisibility=hidden -fpic -g -O2 -fno-omit-frame-pointer -mno-omit-leaf-frame-pointer -ffile-prefix-map=/build/r-base-EawLoD/r-base-4.4.1=. -fstack-protector-strong -fstack-clash-protection -Wformat -Werror=format-security -fcf-protection -fdebug-prefix-map=/build/r-base-EawLoD/r-base-4.4.1=/usr/src/r-base-4.4.1-1.2404.0 -Wdate-time -D_FORTIFY_SOURCE=3 -c vendor/cigraph/src/misc/mixing.c -o vendor/cigraph/src/misc/mixing.o gcc -I"/usr/share/R/include" -DNDEBUG -DUSING_R -I. -Ivendor -Ivendor/cigraph/src -Ivendor/cigraph/include -Ivendor/cigraph/vendor -Ivendor/io/parsers -I/usr/include/libxml2 -DHAVE_LIBXML -DNDEBUG -DNTIMER -DNPRINT -DIGRAPH_THREAD_LOCAL= -DPRPACK_IGRAPH_SUPPORT -DHAVE_GFORTRAN=1 -D_GNU_SOURCE=1 -I'/home/omnipath/local/R/4.4-3.20/cpp11/include' -fvisibility=hidden -fpic -g -O2 -fno-omit-frame-pointer -mno-omit-leaf-frame-pointer -ffile-prefix-map=/build/r-base-EawLoD/r-base-4.4.1=. -fstack-protector-strong -fstack-clash-protection -Wformat -Werror=format-security -fcf-protection -fdebug-prefix-map=/build/r-base-EawLoD/r-base-4.4.1=/usr/src/r-base-4.4.1-1.2404.0 -Wdate-time -D_FORTIFY_SOURCE=3 -c vendor/cigraph/src/misc/motifs.c -o vendor/cigraph/src/misc/motifs.o g++ -std=gnu++17 -I"/usr/share/R/include" -DNDEBUG -DUSING_R -I. -Ivendor -Ivendor/cigraph/src -Ivendor/cigraph/include -Ivendor/cigraph/vendor -Ivendor/io/parsers -I/usr/include/libxml2 -DHAVE_LIBXML -DNDEBUG -DNTIMER -DNPRINT -DIGRAPH_THREAD_LOCAL= -DPRPACK_IGRAPH_SUPPORT -DHAVE_GFORTRAN=1 -D_GNU_SOURCE=1 -I'/home/omnipath/local/R/4.4-3.20/cpp11/include' -fvisibility=hidden -fpic -g -O2 -fno-omit-frame-pointer -mno-omit-leaf-frame-pointer -ffile-prefix-map=/build/r-base-EawLoD/r-base-4.4.1=. -fstack-protector-strong -fstack-clash-protection -Wformat -Werror=format-security -fcf-protection -fdebug-prefix-map=/build/r-base-EawLoD/r-base-4.4.1=/usr/src/r-base-4.4.1-1.2404.0 -Wdate-time -D_FORTIFY_SOURCE=3 -c vendor/cigraph/src/misc/order_cycle.cpp -o vendor/cigraph/src/misc/order_cycle.o gcc -I"/usr/share/R/include" -DNDEBUG -DUSING_R -I. -Ivendor -Ivendor/cigraph/src -Ivendor/cigraph/include -Ivendor/cigraph/vendor -Ivendor/io/parsers -I/usr/include/libxml2 -DHAVE_LIBXML -DNDEBUG -DNTIMER -DNPRINT -DIGRAPH_THREAD_LOCAL= -DPRPACK_IGRAPH_SUPPORT -DHAVE_GFORTRAN=1 -D_GNU_SOURCE=1 -I'/home/omnipath/local/R/4.4-3.20/cpp11/include' -fvisibility=hidden -fpic -g -O2 -fno-omit-frame-pointer -mno-omit-leaf-frame-pointer -ffile-prefix-map=/build/r-base-EawLoD/r-base-4.4.1=. -fstack-protector-strong -fstack-clash-protection -Wformat -Werror=format-security -fcf-protection -fdebug-prefix-map=/build/r-base-EawLoD/r-base-4.4.1=/usr/src/r-base-4.4.1-1.2404.0 -Wdate-time -D_FORTIFY_SOURCE=3 -c vendor/cigraph/src/misc/other.c -o vendor/cigraph/src/misc/other.o gcc -I"/usr/share/R/include" -DNDEBUG -DUSING_R -I. -Ivendor -Ivendor/cigraph/src -Ivendor/cigraph/include -Ivendor/cigraph/vendor -Ivendor/io/parsers -I/usr/include/libxml2 -DHAVE_LIBXML -DNDEBUG -DNTIMER -DNPRINT -DIGRAPH_THREAD_LOCAL= -DPRPACK_IGRAPH_SUPPORT -DHAVE_GFORTRAN=1 -D_GNU_SOURCE=1 -I'/home/omnipath/local/R/4.4-3.20/cpp11/include' -fvisibility=hidden -fpic -g -O2 -fno-omit-frame-pointer -mno-omit-leaf-frame-pointer -ffile-prefix-map=/build/r-base-EawLoD/r-base-4.4.1=. -fstack-protector-strong -fstack-clash-protection -Wformat -Werror=format-security -fcf-protection -fdebug-prefix-map=/build/r-base-EawLoD/r-base-4.4.1=/usr/src/r-base-4.4.1-1.2404.0 -Wdate-time -D_FORTIFY_SOURCE=3 -c vendor/cigraph/src/misc/power_law_fit.c -o vendor/cigraph/src/misc/power_law_fit.o gcc -I"/usr/share/R/include" -DNDEBUG -DUSING_R -I. -Ivendor -Ivendor/cigraph/src -Ivendor/cigraph/include -Ivendor/cigraph/vendor -Ivendor/io/parsers -I/usr/include/libxml2 -DHAVE_LIBXML -DNDEBUG -DNTIMER -DNPRINT -DIGRAPH_THREAD_LOCAL= -DPRPACK_IGRAPH_SUPPORT -DHAVE_GFORTRAN=1 -D_GNU_SOURCE=1 -I'/home/omnipath/local/R/4.4-3.20/cpp11/include' -fvisibility=hidden -fpic -g -O2 -fno-omit-frame-pointer -mno-omit-leaf-frame-pointer -ffile-prefix-map=/build/r-base-EawLoD/r-base-4.4.1=. -fstack-protector-strong -fstack-clash-protection -Wformat -Werror=format-security -fcf-protection -fdebug-prefix-map=/build/r-base-EawLoD/r-base-4.4.1=/usr/src/r-base-4.4.1-1.2404.0 -Wdate-time -D_FORTIFY_SOURCE=3 -c vendor/cigraph/src/misc/scan.c -o vendor/cigraph/src/misc/scan.o gcc -I"/usr/share/R/include" -DNDEBUG -DUSING_R -I. -Ivendor -Ivendor/cigraph/src -Ivendor/cigraph/include -Ivendor/cigraph/vendor -Ivendor/io/parsers -I/usr/include/libxml2 -DHAVE_LIBXML -DNDEBUG -DNTIMER -DNPRINT -DIGRAPH_THREAD_LOCAL= -DPRPACK_IGRAPH_SUPPORT -DHAVE_GFORTRAN=1 -D_GNU_SOURCE=1 -I'/home/omnipath/local/R/4.4-3.20/cpp11/include' -fvisibility=hidden -fpic -g -O2 -fno-omit-frame-pointer -mno-omit-leaf-frame-pointer -ffile-prefix-map=/build/r-base-EawLoD/r-base-4.4.1=. -fstack-protector-strong -fstack-clash-protection -Wformat -Werror=format-security -fcf-protection -fdebug-prefix-map=/build/r-base-EawLoD/r-base-4.4.1=/usr/src/r-base-4.4.1-1.2404.0 -Wdate-time -D_FORTIFY_SOURCE=3 -c vendor/cigraph/src/misc/sir.c -o vendor/cigraph/src/misc/sir.o gcc -I"/usr/share/R/include" -DNDEBUG -DUSING_R -I. -Ivendor -Ivendor/cigraph/src -Ivendor/cigraph/include -Ivendor/cigraph/vendor -Ivendor/io/parsers -I/usr/include/libxml2 -DHAVE_LIBXML -DNDEBUG -DNTIMER -DNPRINT -DIGRAPH_THREAD_LOCAL= -DPRPACK_IGRAPH_SUPPORT -DHAVE_GFORTRAN=1 -D_GNU_SOURCE=1 -I'/home/omnipath/local/R/4.4-3.20/cpp11/include' -fvisibility=hidden -fpic -g -O2 -fno-omit-frame-pointer -mno-omit-leaf-frame-pointer -ffile-prefix-map=/build/r-base-EawLoD/r-base-4.4.1=. -fstack-protector-strong -fstack-clash-protection -Wformat -Werror=format-security -fcf-protection -fdebug-prefix-map=/build/r-base-EawLoD/r-base-4.4.1=/usr/src/r-base-4.4.1-1.2404.0 -Wdate-time -D_FORTIFY_SOURCE=3 -c vendor/cigraph/src/misc/spanning_trees.c -o vendor/cigraph/src/misc/spanning_trees.o gcc -I"/usr/share/R/include" -DNDEBUG -DUSING_R -I. -Ivendor -Ivendor/cigraph/src -Ivendor/cigraph/include -Ivendor/cigraph/vendor -Ivendor/io/parsers -I/usr/include/libxml2 -DHAVE_LIBXML -DNDEBUG -DNTIMER -DNPRINT -DIGRAPH_THREAD_LOCAL= -DPRPACK_IGRAPH_SUPPORT -DHAVE_GFORTRAN=1 -D_GNU_SOURCE=1 -I'/home/omnipath/local/R/4.4-3.20/cpp11/include' -fvisibility=hidden -fpic -g -O2 -fno-omit-frame-pointer -mno-omit-leaf-frame-pointer -ffile-prefix-map=/build/r-base-EawLoD/r-base-4.4.1=. -fstack-protector-strong -fstack-clash-protection -Wformat -Werror=format-security -fcf-protection -fdebug-prefix-map=/build/r-base-EawLoD/r-base-4.4.1=/usr/src/r-base-4.4.1-1.2404.0 -Wdate-time -D_FORTIFY_SOURCE=3 -c vendor/cigraph/src/operators/add_edge.c -o vendor/cigraph/src/operators/add_edge.o gcc -I"/usr/share/R/include" -DNDEBUG -DUSING_R -I. -Ivendor -Ivendor/cigraph/src -Ivendor/cigraph/include -Ivendor/cigraph/vendor -Ivendor/io/parsers -I/usr/include/libxml2 -DHAVE_LIBXML -DNDEBUG -DNTIMER -DNPRINT -DIGRAPH_THREAD_LOCAL= -DPRPACK_IGRAPH_SUPPORT -DHAVE_GFORTRAN=1 -D_GNU_SOURCE=1 -I'/home/omnipath/local/R/4.4-3.20/cpp11/include' -fvisibility=hidden -fpic -g -O2 -fno-omit-frame-pointer -mno-omit-leaf-frame-pointer -ffile-prefix-map=/build/r-base-EawLoD/r-base-4.4.1=. -fstack-protector-strong -fstack-clash-protection -Wformat -Werror=format-security -fcf-protection -fdebug-prefix-map=/build/r-base-EawLoD/r-base-4.4.1=/usr/src/r-base-4.4.1-1.2404.0 -Wdate-time -D_FORTIFY_SOURCE=3 -c vendor/cigraph/src/operators/complementer.c -o vendor/cigraph/src/operators/complementer.o gcc -I"/usr/share/R/include" -DNDEBUG -DUSING_R -I. -Ivendor -Ivendor/cigraph/src -Ivendor/cigraph/include -Ivendor/cigraph/vendor -Ivendor/io/parsers -I/usr/include/libxml2 -DHAVE_LIBXML -DNDEBUG -DNTIMER -DNPRINT -DIGRAPH_THREAD_LOCAL= -DPRPACK_IGRAPH_SUPPORT -DHAVE_GFORTRAN=1 -D_GNU_SOURCE=1 -I'/home/omnipath/local/R/4.4-3.20/cpp11/include' -fvisibility=hidden -fpic -g -O2 -fno-omit-frame-pointer -mno-omit-leaf-frame-pointer -ffile-prefix-map=/build/r-base-EawLoD/r-base-4.4.1=. -fstack-protector-strong -fstack-clash-protection -Wformat -Werror=format-security -fcf-protection -fdebug-prefix-map=/build/r-base-EawLoD/r-base-4.4.1=/usr/src/r-base-4.4.1-1.2404.0 -Wdate-time -D_FORTIFY_SOURCE=3 -c vendor/cigraph/src/operators/compose.c -o vendor/cigraph/src/operators/compose.o gcc -I"/usr/share/R/include" -DNDEBUG -DUSING_R -I. -Ivendor -Ivendor/cigraph/src -Ivendor/cigraph/include -Ivendor/cigraph/vendor -Ivendor/io/parsers -I/usr/include/libxml2 -DHAVE_LIBXML -DNDEBUG -DNTIMER -DNPRINT -DIGRAPH_THREAD_LOCAL= -DPRPACK_IGRAPH_SUPPORT -DHAVE_GFORTRAN=1 -D_GNU_SOURCE=1 -I'/home/omnipath/local/R/4.4-3.20/cpp11/include' -fvisibility=hidden -fpic -g -O2 -fno-omit-frame-pointer -mno-omit-leaf-frame-pointer -ffile-prefix-map=/build/r-base-EawLoD/r-base-4.4.1=. -fstack-protector-strong -fstack-clash-protection -Wformat -Werror=format-security -fcf-protection -fdebug-prefix-map=/build/r-base-EawLoD/r-base-4.4.1=/usr/src/r-base-4.4.1-1.2404.0 -Wdate-time -D_FORTIFY_SOURCE=3 -c vendor/cigraph/src/operators/connect_neighborhood.c -o vendor/cigraph/src/operators/connect_neighborhood.o gcc -I"/usr/share/R/include" -DNDEBUG -DUSING_R -I. -Ivendor -Ivendor/cigraph/src -Ivendor/cigraph/include -Ivendor/cigraph/vendor -Ivendor/io/parsers -I/usr/include/libxml2 -DHAVE_LIBXML -DNDEBUG -DNTIMER -DNPRINT -DIGRAPH_THREAD_LOCAL= -DPRPACK_IGRAPH_SUPPORT -DHAVE_GFORTRAN=1 -D_GNU_SOURCE=1 -I'/home/omnipath/local/R/4.4-3.20/cpp11/include' -fvisibility=hidden -fpic -g -O2 -fno-omit-frame-pointer -mno-omit-leaf-frame-pointer -ffile-prefix-map=/build/r-base-EawLoD/r-base-4.4.1=. -fstack-protector-strong -fstack-clash-protection -Wformat -Werror=format-security -fcf-protection -fdebug-prefix-map=/build/r-base-EawLoD/r-base-4.4.1=/usr/src/r-base-4.4.1-1.2404.0 -Wdate-time -D_FORTIFY_SOURCE=3 -c vendor/cigraph/src/operators/contract.c -o vendor/cigraph/src/operators/contract.o gcc -I"/usr/share/R/include" -DNDEBUG -DUSING_R -I. -Ivendor -Ivendor/cigraph/src -Ivendor/cigraph/include -Ivendor/cigraph/vendor -Ivendor/io/parsers -I/usr/include/libxml2 -DHAVE_LIBXML -DNDEBUG -DNTIMER -DNPRINT -DIGRAPH_THREAD_LOCAL= -DPRPACK_IGRAPH_SUPPORT -DHAVE_GFORTRAN=1 -D_GNU_SOURCE=1 -I'/home/omnipath/local/R/4.4-3.20/cpp11/include' -fvisibility=hidden -fpic -g -O2 -fno-omit-frame-pointer -mno-omit-leaf-frame-pointer -ffile-prefix-map=/build/r-base-EawLoD/r-base-4.4.1=. -fstack-protector-strong -fstack-clash-protection -Wformat -Werror=format-security -fcf-protection -fdebug-prefix-map=/build/r-base-EawLoD/r-base-4.4.1=/usr/src/r-base-4.4.1-1.2404.0 -Wdate-time -D_FORTIFY_SOURCE=3 -c vendor/cigraph/src/operators/difference.c -o vendor/cigraph/src/operators/difference.o gcc -I"/usr/share/R/include" -DNDEBUG -DUSING_R -I. -Ivendor -Ivendor/cigraph/src -Ivendor/cigraph/include -Ivendor/cigraph/vendor -Ivendor/io/parsers -I/usr/include/libxml2 -DHAVE_LIBXML -DNDEBUG -DNTIMER -DNPRINT -DIGRAPH_THREAD_LOCAL= -DPRPACK_IGRAPH_SUPPORT -DHAVE_GFORTRAN=1 -D_GNU_SOURCE=1 -I'/home/omnipath/local/R/4.4-3.20/cpp11/include' -fvisibility=hidden -fpic -g -O2 -fno-omit-frame-pointer -mno-omit-leaf-frame-pointer -ffile-prefix-map=/build/r-base-EawLoD/r-base-4.4.1=. -fstack-protector-strong -fstack-clash-protection -Wformat -Werror=format-security -fcf-protection -fdebug-prefix-map=/build/r-base-EawLoD/r-base-4.4.1=/usr/src/r-base-4.4.1-1.2404.0 -Wdate-time -D_FORTIFY_SOURCE=3 -c vendor/cigraph/src/operators/disjoint_union.c -o vendor/cigraph/src/operators/disjoint_union.o gcc -I"/usr/share/R/include" -DNDEBUG -DUSING_R -I. -Ivendor -Ivendor/cigraph/src -Ivendor/cigraph/include -Ivendor/cigraph/vendor -Ivendor/io/parsers -I/usr/include/libxml2 -DHAVE_LIBXML -DNDEBUG -DNTIMER -DNPRINT -DIGRAPH_THREAD_LOCAL= -DPRPACK_IGRAPH_SUPPORT -DHAVE_GFORTRAN=1 -D_GNU_SOURCE=1 -I'/home/omnipath/local/R/4.4-3.20/cpp11/include' -fvisibility=hidden -fpic -g -O2 -fno-omit-frame-pointer -mno-omit-leaf-frame-pointer -ffile-prefix-map=/build/r-base-EawLoD/r-base-4.4.1=. -fstack-protector-strong -fstack-clash-protection -Wformat -Werror=format-security -fcf-protection -fdebug-prefix-map=/build/r-base-EawLoD/r-base-4.4.1=/usr/src/r-base-4.4.1-1.2404.0 -Wdate-time -D_FORTIFY_SOURCE=3 -c vendor/cigraph/src/operators/intersection.c -o vendor/cigraph/src/operators/intersection.o gcc -I"/usr/share/R/include" -DNDEBUG -DUSING_R -I. -Ivendor -Ivendor/cigraph/src -Ivendor/cigraph/include -Ivendor/cigraph/vendor -Ivendor/io/parsers -I/usr/include/libxml2 -DHAVE_LIBXML -DNDEBUG -DNTIMER -DNPRINT -DIGRAPH_THREAD_LOCAL= -DPRPACK_IGRAPH_SUPPORT -DHAVE_GFORTRAN=1 -D_GNU_SOURCE=1 -I'/home/omnipath/local/R/4.4-3.20/cpp11/include' -fvisibility=hidden -fpic -g -O2 -fno-omit-frame-pointer -mno-omit-leaf-frame-pointer -ffile-prefix-map=/build/r-base-EawLoD/r-base-4.4.1=. -fstack-protector-strong -fstack-clash-protection -Wformat -Werror=format-security -fcf-protection -fdebug-prefix-map=/build/r-base-EawLoD/r-base-4.4.1=/usr/src/r-base-4.4.1-1.2404.0 -Wdate-time -D_FORTIFY_SOURCE=3 -c vendor/cigraph/src/operators/join.c -o vendor/cigraph/src/operators/join.o gcc -I"/usr/share/R/include" -DNDEBUG -DUSING_R -I. -Ivendor -Ivendor/cigraph/src -Ivendor/cigraph/include -Ivendor/cigraph/vendor -Ivendor/io/parsers -I/usr/include/libxml2 -DHAVE_LIBXML -DNDEBUG -DNTIMER -DNPRINT -DIGRAPH_THREAD_LOCAL= -DPRPACK_IGRAPH_SUPPORT -DHAVE_GFORTRAN=1 -D_GNU_SOURCE=1 -I'/home/omnipath/local/R/4.4-3.20/cpp11/include' -fvisibility=hidden -fpic -g -O2 -fno-omit-frame-pointer -mno-omit-leaf-frame-pointer -ffile-prefix-map=/build/r-base-EawLoD/r-base-4.4.1=. -fstack-protector-strong -fstack-clash-protection -Wformat -Werror=format-security -fcf-protection -fdebug-prefix-map=/build/r-base-EawLoD/r-base-4.4.1=/usr/src/r-base-4.4.1-1.2404.0 -Wdate-time -D_FORTIFY_SOURCE=3 -c vendor/cigraph/src/operators/misc_internal.c -o vendor/cigraph/src/operators/misc_internal.o gcc -I"/usr/share/R/include" -DNDEBUG -DUSING_R -I. -Ivendor -Ivendor/cigraph/src -Ivendor/cigraph/include -Ivendor/cigraph/vendor -Ivendor/io/parsers -I/usr/include/libxml2 -DHAVE_LIBXML -DNDEBUG -DNTIMER -DNPRINT -DIGRAPH_THREAD_LOCAL= -DPRPACK_IGRAPH_SUPPORT -DHAVE_GFORTRAN=1 -D_GNU_SOURCE=1 -I'/home/omnipath/local/R/4.4-3.20/cpp11/include' -fvisibility=hidden -fpic -g -O2 -fno-omit-frame-pointer -mno-omit-leaf-frame-pointer -ffile-prefix-map=/build/r-base-EawLoD/r-base-4.4.1=. -fstack-protector-strong -fstack-clash-protection -Wformat -Werror=format-security -fcf-protection -fdebug-prefix-map=/build/r-base-EawLoD/r-base-4.4.1=/usr/src/r-base-4.4.1-1.2404.0 -Wdate-time -D_FORTIFY_SOURCE=3 -c vendor/cigraph/src/operators/permute.c -o vendor/cigraph/src/operators/permute.o gcc -I"/usr/share/R/include" -DNDEBUG -DUSING_R -I. -Ivendor -Ivendor/cigraph/src -Ivendor/cigraph/include -Ivendor/cigraph/vendor -Ivendor/io/parsers -I/usr/include/libxml2 -DHAVE_LIBXML -DNDEBUG -DNTIMER -DNPRINT -DIGRAPH_THREAD_LOCAL= -DPRPACK_IGRAPH_SUPPORT -DHAVE_GFORTRAN=1 -D_GNU_SOURCE=1 -I'/home/omnipath/local/R/4.4-3.20/cpp11/include' -fvisibility=hidden -fpic -g -O2 -fno-omit-frame-pointer -mno-omit-leaf-frame-pointer -ffile-prefix-map=/build/r-base-EawLoD/r-base-4.4.1=. -fstack-protector-strong -fstack-clash-protection -Wformat -Werror=format-security -fcf-protection -fdebug-prefix-map=/build/r-base-EawLoD/r-base-4.4.1=/usr/src/r-base-4.4.1-1.2404.0 -Wdate-time -D_FORTIFY_SOURCE=3 -c vendor/cigraph/src/operators/reverse.c -o vendor/cigraph/src/operators/reverse.o gcc -I"/usr/share/R/include" -DNDEBUG -DUSING_R -I. -Ivendor -Ivendor/cigraph/src -Ivendor/cigraph/include -Ivendor/cigraph/vendor -Ivendor/io/parsers -I/usr/include/libxml2 -DHAVE_LIBXML -DNDEBUG -DNTIMER -DNPRINT -DIGRAPH_THREAD_LOCAL= -DPRPACK_IGRAPH_SUPPORT -DHAVE_GFORTRAN=1 -D_GNU_SOURCE=1 -I'/home/omnipath/local/R/4.4-3.20/cpp11/include' -fvisibility=hidden -fpic -g -O2 -fno-omit-frame-pointer -mno-omit-leaf-frame-pointer -ffile-prefix-map=/build/r-base-EawLoD/r-base-4.4.1=. -fstack-protector-strong -fstack-clash-protection -Wformat -Werror=format-security -fcf-protection -fdebug-prefix-map=/build/r-base-EawLoD/r-base-4.4.1=/usr/src/r-base-4.4.1-1.2404.0 -Wdate-time -D_FORTIFY_SOURCE=3 -c vendor/cigraph/src/operators/rewire.c -o vendor/cigraph/src/operators/rewire.o gcc -I"/usr/share/R/include" -DNDEBUG -DUSING_R -I. -Ivendor -Ivendor/cigraph/src -Ivendor/cigraph/include -Ivendor/cigraph/vendor -Ivendor/io/parsers -I/usr/include/libxml2 -DHAVE_LIBXML -DNDEBUG -DNTIMER -DNPRINT -DIGRAPH_THREAD_LOCAL= -DPRPACK_IGRAPH_SUPPORT -DHAVE_GFORTRAN=1 -D_GNU_SOURCE=1 -I'/home/omnipath/local/R/4.4-3.20/cpp11/include' -fvisibility=hidden -fpic -g -O2 -fno-omit-frame-pointer -mno-omit-leaf-frame-pointer -ffile-prefix-map=/build/r-base-EawLoD/r-base-4.4.1=. -fstack-protector-strong -fstack-clash-protection -Wformat -Werror=format-security -fcf-protection -fdebug-prefix-map=/build/r-base-EawLoD/r-base-4.4.1=/usr/src/r-base-4.4.1-1.2404.0 -Wdate-time -D_FORTIFY_SOURCE=3 -c vendor/cigraph/src/operators/rewire_edges.c -o vendor/cigraph/src/operators/rewire_edges.o gcc -I"/usr/share/R/include" -DNDEBUG -DUSING_R -I. -Ivendor -Ivendor/cigraph/src -Ivendor/cigraph/include -Ivendor/cigraph/vendor -Ivendor/io/parsers -I/usr/include/libxml2 -DHAVE_LIBXML -DNDEBUG -DNTIMER -DNPRINT -DIGRAPH_THREAD_LOCAL= -DPRPACK_IGRAPH_SUPPORT -DHAVE_GFORTRAN=1 -D_GNU_SOURCE=1 -I'/home/omnipath/local/R/4.4-3.20/cpp11/include' -fvisibility=hidden -fpic -g -O2 -fno-omit-frame-pointer -mno-omit-leaf-frame-pointer -ffile-prefix-map=/build/r-base-EawLoD/r-base-4.4.1=. -fstack-protector-strong -fstack-clash-protection -Wformat -Werror=format-security -fcf-protection -fdebug-prefix-map=/build/r-base-EawLoD/r-base-4.4.1=/usr/src/r-base-4.4.1-1.2404.0 -Wdate-time -D_FORTIFY_SOURCE=3 -c vendor/cigraph/src/operators/simplify.c -o vendor/cigraph/src/operators/simplify.o gcc -I"/usr/share/R/include" -DNDEBUG -DUSING_R -I. -Ivendor -Ivendor/cigraph/src -Ivendor/cigraph/include -Ivendor/cigraph/vendor -Ivendor/io/parsers -I/usr/include/libxml2 -DHAVE_LIBXML -DNDEBUG -DNTIMER -DNPRINT -DIGRAPH_THREAD_LOCAL= -DPRPACK_IGRAPH_SUPPORT -DHAVE_GFORTRAN=1 -D_GNU_SOURCE=1 -I'/home/omnipath/local/R/4.4-3.20/cpp11/include' -fvisibility=hidden -fpic -g -O2 -fno-omit-frame-pointer -mno-omit-leaf-frame-pointer -ffile-prefix-map=/build/r-base-EawLoD/r-base-4.4.1=. -fstack-protector-strong -fstack-clash-protection -Wformat -Werror=format-security -fcf-protection -fdebug-prefix-map=/build/r-base-EawLoD/r-base-4.4.1=/usr/src/r-base-4.4.1-1.2404.0 -Wdate-time -D_FORTIFY_SOURCE=3 -c vendor/cigraph/src/operators/subgraph.c -o vendor/cigraph/src/operators/subgraph.o gcc -I"/usr/share/R/include" -DNDEBUG -DUSING_R -I. -Ivendor -Ivendor/cigraph/src -Ivendor/cigraph/include -Ivendor/cigraph/vendor -Ivendor/io/parsers -I/usr/include/libxml2 -DHAVE_LIBXML -DNDEBUG -DNTIMER -DNPRINT -DIGRAPH_THREAD_LOCAL= -DPRPACK_IGRAPH_SUPPORT -DHAVE_GFORTRAN=1 -D_GNU_SOURCE=1 -I'/home/omnipath/local/R/4.4-3.20/cpp11/include' -fvisibility=hidden -fpic -g -O2 -fno-omit-frame-pointer -mno-omit-leaf-frame-pointer -ffile-prefix-map=/build/r-base-EawLoD/r-base-4.4.1=. -fstack-protector-strong -fstack-clash-protection -Wformat -Werror=format-security -fcf-protection -fdebug-prefix-map=/build/r-base-EawLoD/r-base-4.4.1=/usr/src/r-base-4.4.1-1.2404.0 -Wdate-time -D_FORTIFY_SOURCE=3 -c vendor/cigraph/src/operators/union.c -o vendor/cigraph/src/operators/union.o gcc -I"/usr/share/R/include" -DNDEBUG -DUSING_R -I. -Ivendor -Ivendor/cigraph/src -Ivendor/cigraph/include -Ivendor/cigraph/vendor -Ivendor/io/parsers -I/usr/include/libxml2 -DHAVE_LIBXML -DNDEBUG -DNTIMER -DNPRINT -DIGRAPH_THREAD_LOCAL= -DPRPACK_IGRAPH_SUPPORT -DHAVE_GFORTRAN=1 -D_GNU_SOURCE=1 -I'/home/omnipath/local/R/4.4-3.20/cpp11/include' -fvisibility=hidden -fpic -g -O2 -fno-omit-frame-pointer -mno-omit-leaf-frame-pointer -ffile-prefix-map=/build/r-base-EawLoD/r-base-4.4.1=. -fstack-protector-strong -fstack-clash-protection -Wformat -Werror=format-security -fcf-protection -fdebug-prefix-map=/build/r-base-EawLoD/r-base-4.4.1=/usr/src/r-base-4.4.1-1.2404.0 -Wdate-time -D_FORTIFY_SOURCE=3 -c vendor/cigraph/src/paths/all_shortest_paths.c -o vendor/cigraph/src/paths/all_shortest_paths.o gcc -I"/usr/share/R/include" -DNDEBUG -DUSING_R -I. -Ivendor -Ivendor/cigraph/src -Ivendor/cigraph/include -Ivendor/cigraph/vendor -Ivendor/io/parsers -I/usr/include/libxml2 -DHAVE_LIBXML -DNDEBUG -DNTIMER -DNPRINT -DIGRAPH_THREAD_LOCAL= -DPRPACK_IGRAPH_SUPPORT -DHAVE_GFORTRAN=1 -D_GNU_SOURCE=1 -I'/home/omnipath/local/R/4.4-3.20/cpp11/include' -fvisibility=hidden -fpic -g -O2 -fno-omit-frame-pointer -mno-omit-leaf-frame-pointer -ffile-prefix-map=/build/r-base-EawLoD/r-base-4.4.1=. -fstack-protector-strong -fstack-clash-protection -Wformat -Werror=format-security -fcf-protection -fdebug-prefix-map=/build/r-base-EawLoD/r-base-4.4.1=/usr/src/r-base-4.4.1-1.2404.0 -Wdate-time -D_FORTIFY_SOURCE=3 -c vendor/cigraph/src/paths/astar.c -o vendor/cigraph/src/paths/astar.o gcc -I"/usr/share/R/include" -DNDEBUG -DUSING_R -I. -Ivendor -Ivendor/cigraph/src -Ivendor/cigraph/include -Ivendor/cigraph/vendor -Ivendor/io/parsers -I/usr/include/libxml2 -DHAVE_LIBXML -DNDEBUG -DNTIMER -DNPRINT -DIGRAPH_THREAD_LOCAL= -DPRPACK_IGRAPH_SUPPORT -DHAVE_GFORTRAN=1 -D_GNU_SOURCE=1 -I'/home/omnipath/local/R/4.4-3.20/cpp11/include' -fvisibility=hidden -fpic -g -O2 -fno-omit-frame-pointer -mno-omit-leaf-frame-pointer -ffile-prefix-map=/build/r-base-EawLoD/r-base-4.4.1=. -fstack-protector-strong -fstack-clash-protection -Wformat -Werror=format-security -fcf-protection -fdebug-prefix-map=/build/r-base-EawLoD/r-base-4.4.1=/usr/src/r-base-4.4.1-1.2404.0 -Wdate-time -D_FORTIFY_SOURCE=3 -c vendor/cigraph/src/paths/bellman_ford.c -o vendor/cigraph/src/paths/bellman_ford.o gcc -I"/usr/share/R/include" -DNDEBUG -DUSING_R -I. -Ivendor -Ivendor/cigraph/src -Ivendor/cigraph/include -Ivendor/cigraph/vendor -Ivendor/io/parsers -I/usr/include/libxml2 -DHAVE_LIBXML -DNDEBUG -DNTIMER -DNPRINT -DIGRAPH_THREAD_LOCAL= -DPRPACK_IGRAPH_SUPPORT -DHAVE_GFORTRAN=1 -D_GNU_SOURCE=1 -I'/home/omnipath/local/R/4.4-3.20/cpp11/include' -fvisibility=hidden -fpic -g -O2 -fno-omit-frame-pointer -mno-omit-leaf-frame-pointer -ffile-prefix-map=/build/r-base-EawLoD/r-base-4.4.1=. -fstack-protector-strong -fstack-clash-protection -Wformat -Werror=format-security -fcf-protection -fdebug-prefix-map=/build/r-base-EawLoD/r-base-4.4.1=/usr/src/r-base-4.4.1-1.2404.0 -Wdate-time -D_FORTIFY_SOURCE=3 -c vendor/cigraph/src/paths/dijkstra.c -o vendor/cigraph/src/paths/dijkstra.o gcc -I"/usr/share/R/include" -DNDEBUG -DUSING_R -I. -Ivendor -Ivendor/cigraph/src -Ivendor/cigraph/include -Ivendor/cigraph/vendor -Ivendor/io/parsers -I/usr/include/libxml2 -DHAVE_LIBXML -DNDEBUG -DNTIMER -DNPRINT -DIGRAPH_THREAD_LOCAL= -DPRPACK_IGRAPH_SUPPORT -DHAVE_GFORTRAN=1 -D_GNU_SOURCE=1 -I'/home/omnipath/local/R/4.4-3.20/cpp11/include' -fvisibility=hidden -fpic -g -O2 -fno-omit-frame-pointer -mno-omit-leaf-frame-pointer -ffile-prefix-map=/build/r-base-EawLoD/r-base-4.4.1=. -fstack-protector-strong -fstack-clash-protection -Wformat -Werror=format-security -fcf-protection -fdebug-prefix-map=/build/r-base-EawLoD/r-base-4.4.1=/usr/src/r-base-4.4.1-1.2404.0 -Wdate-time -D_FORTIFY_SOURCE=3 -c vendor/cigraph/src/paths/distances.c -o vendor/cigraph/src/paths/distances.o gcc -I"/usr/share/R/include" -DNDEBUG -DUSING_R -I. -Ivendor -Ivendor/cigraph/src -Ivendor/cigraph/include -Ivendor/cigraph/vendor -Ivendor/io/parsers -I/usr/include/libxml2 -DHAVE_LIBXML -DNDEBUG -DNTIMER -DNPRINT -DIGRAPH_THREAD_LOCAL= -DPRPACK_IGRAPH_SUPPORT -DHAVE_GFORTRAN=1 -D_GNU_SOURCE=1 -I'/home/omnipath/local/R/4.4-3.20/cpp11/include' -fvisibility=hidden -fpic -g -O2 -fno-omit-frame-pointer -mno-omit-leaf-frame-pointer -ffile-prefix-map=/build/r-base-EawLoD/r-base-4.4.1=. -fstack-protector-strong -fstack-clash-protection -Wformat -Werror=format-security -fcf-protection -fdebug-prefix-map=/build/r-base-EawLoD/r-base-4.4.1=/usr/src/r-base-4.4.1-1.2404.0 -Wdate-time -D_FORTIFY_SOURCE=3 -c vendor/cigraph/src/paths/eulerian.c -o vendor/cigraph/src/paths/eulerian.o gcc -I"/usr/share/R/include" -DNDEBUG -DUSING_R -I. -Ivendor -Ivendor/cigraph/src -Ivendor/cigraph/include -Ivendor/cigraph/vendor -Ivendor/io/parsers -I/usr/include/libxml2 -DHAVE_LIBXML -DNDEBUG -DNTIMER -DNPRINT -DIGRAPH_THREAD_LOCAL= -DPRPACK_IGRAPH_SUPPORT -DHAVE_GFORTRAN=1 -D_GNU_SOURCE=1 -I'/home/omnipath/local/R/4.4-3.20/cpp11/include' -fvisibility=hidden -fpic -g -O2 -fno-omit-frame-pointer -mno-omit-leaf-frame-pointer -ffile-prefix-map=/build/r-base-EawLoD/r-base-4.4.1=. -fstack-protector-strong -fstack-clash-protection -Wformat -Werror=format-security -fcf-protection -fdebug-prefix-map=/build/r-base-EawLoD/r-base-4.4.1=/usr/src/r-base-4.4.1-1.2404.0 -Wdate-time -D_FORTIFY_SOURCE=3 -c vendor/cigraph/src/paths/floyd_warshall.c -o vendor/cigraph/src/paths/floyd_warshall.o gcc -I"/usr/share/R/include" -DNDEBUG -DUSING_R -I. -Ivendor -Ivendor/cigraph/src -Ivendor/cigraph/include -Ivendor/cigraph/vendor -Ivendor/io/parsers -I/usr/include/libxml2 -DHAVE_LIBXML -DNDEBUG -DNTIMER -DNPRINT -DIGRAPH_THREAD_LOCAL= -DPRPACK_IGRAPH_SUPPORT -DHAVE_GFORTRAN=1 -D_GNU_SOURCE=1 -I'/home/omnipath/local/R/4.4-3.20/cpp11/include' -fvisibility=hidden -fpic -g -O2 -fno-omit-frame-pointer -mno-omit-leaf-frame-pointer -ffile-prefix-map=/build/r-base-EawLoD/r-base-4.4.1=. -fstack-protector-strong -fstack-clash-protection -Wformat -Werror=format-security -fcf-protection -fdebug-prefix-map=/build/r-base-EawLoD/r-base-4.4.1=/usr/src/r-base-4.4.1-1.2404.0 -Wdate-time -D_FORTIFY_SOURCE=3 -c vendor/cigraph/src/paths/histogram.c -o vendor/cigraph/src/paths/histogram.o gcc -I"/usr/share/R/include" -DNDEBUG -DUSING_R -I. -Ivendor -Ivendor/cigraph/src -Ivendor/cigraph/include -Ivendor/cigraph/vendor -Ivendor/io/parsers -I/usr/include/libxml2 -DHAVE_LIBXML -DNDEBUG -DNTIMER -DNPRINT -DIGRAPH_THREAD_LOCAL= -DPRPACK_IGRAPH_SUPPORT -DHAVE_GFORTRAN=1 -D_GNU_SOURCE=1 -I'/home/omnipath/local/R/4.4-3.20/cpp11/include' -fvisibility=hidden -fpic -g -O2 -fno-omit-frame-pointer -mno-omit-leaf-frame-pointer -ffile-prefix-map=/build/r-base-EawLoD/r-base-4.4.1=. -fstack-protector-strong -fstack-clash-protection -Wformat -Werror=format-security -fcf-protection -fdebug-prefix-map=/build/r-base-EawLoD/r-base-4.4.1=/usr/src/r-base-4.4.1-1.2404.0 -Wdate-time -D_FORTIFY_SOURCE=3 -c vendor/cigraph/src/paths/johnson.c -o vendor/cigraph/src/paths/johnson.o gcc -I"/usr/share/R/include" -DNDEBUG -DUSING_R -I. -Ivendor -Ivendor/cigraph/src -Ivendor/cigraph/include -Ivendor/cigraph/vendor -Ivendor/io/parsers -I/usr/include/libxml2 -DHAVE_LIBXML -DNDEBUG -DNTIMER -DNPRINT -DIGRAPH_THREAD_LOCAL= -DPRPACK_IGRAPH_SUPPORT -DHAVE_GFORTRAN=1 -D_GNU_SOURCE=1 -I'/home/omnipath/local/R/4.4-3.20/cpp11/include' -fvisibility=hidden -fpic -g -O2 -fno-omit-frame-pointer -mno-omit-leaf-frame-pointer -ffile-prefix-map=/build/r-base-EawLoD/r-base-4.4.1=. -fstack-protector-strong -fstack-clash-protection -Wformat -Werror=format-security -fcf-protection -fdebug-prefix-map=/build/r-base-EawLoD/r-base-4.4.1=/usr/src/r-base-4.4.1-1.2404.0 -Wdate-time -D_FORTIFY_SOURCE=3 -c vendor/cigraph/src/paths/random_walk.c -o vendor/cigraph/src/paths/random_walk.o gcc -I"/usr/share/R/include" -DNDEBUG -DUSING_R -I. -Ivendor -Ivendor/cigraph/src -Ivendor/cigraph/include -Ivendor/cigraph/vendor -Ivendor/io/parsers -I/usr/include/libxml2 -DHAVE_LIBXML -DNDEBUG -DNTIMER -DNPRINT -DIGRAPH_THREAD_LOCAL= -DPRPACK_IGRAPH_SUPPORT -DHAVE_GFORTRAN=1 -D_GNU_SOURCE=1 -I'/home/omnipath/local/R/4.4-3.20/cpp11/include' -fvisibility=hidden -fpic -g -O2 -fno-omit-frame-pointer -mno-omit-leaf-frame-pointer -ffile-prefix-map=/build/r-base-EawLoD/r-base-4.4.1=. -fstack-protector-strong -fstack-clash-protection -Wformat -Werror=format-security -fcf-protection -fdebug-prefix-map=/build/r-base-EawLoD/r-base-4.4.1=/usr/src/r-base-4.4.1-1.2404.0 -Wdate-time -D_FORTIFY_SOURCE=3 -c vendor/cigraph/src/paths/shortest_paths.c -o vendor/cigraph/src/paths/shortest_paths.o gcc -I"/usr/share/R/include" -DNDEBUG -DUSING_R -I. -Ivendor -Ivendor/cigraph/src -Ivendor/cigraph/include -Ivendor/cigraph/vendor -Ivendor/io/parsers -I/usr/include/libxml2 -DHAVE_LIBXML -DNDEBUG -DNTIMER -DNPRINT -DIGRAPH_THREAD_LOCAL= -DPRPACK_IGRAPH_SUPPORT -DHAVE_GFORTRAN=1 -D_GNU_SOURCE=1 -I'/home/omnipath/local/R/4.4-3.20/cpp11/include' -fvisibility=hidden -fpic -g -O2 -fno-omit-frame-pointer -mno-omit-leaf-frame-pointer -ffile-prefix-map=/build/r-base-EawLoD/r-base-4.4.1=. -fstack-protector-strong -fstack-clash-protection -Wformat -Werror=format-security -fcf-protection -fdebug-prefix-map=/build/r-base-EawLoD/r-base-4.4.1=/usr/src/r-base-4.4.1-1.2404.0 -Wdate-time -D_FORTIFY_SOURCE=3 -c vendor/cigraph/src/paths/simple_paths.c -o vendor/cigraph/src/paths/simple_paths.o gcc -I"/usr/share/R/include" -DNDEBUG -DUSING_R -I. -Ivendor -Ivendor/cigraph/src -Ivendor/cigraph/include -Ivendor/cigraph/vendor -Ivendor/io/parsers -I/usr/include/libxml2 -DHAVE_LIBXML -DNDEBUG -DNTIMER -DNPRINT -DIGRAPH_THREAD_LOCAL= -DPRPACK_IGRAPH_SUPPORT -DHAVE_GFORTRAN=1 -D_GNU_SOURCE=1 -I'/home/omnipath/local/R/4.4-3.20/cpp11/include' -fvisibility=hidden -fpic -g -O2 -fno-omit-frame-pointer -mno-omit-leaf-frame-pointer -ffile-prefix-map=/build/r-base-EawLoD/r-base-4.4.1=. -fstack-protector-strong -fstack-clash-protection -Wformat -Werror=format-security -fcf-protection -fdebug-prefix-map=/build/r-base-EawLoD/r-base-4.4.1=/usr/src/r-base-4.4.1-1.2404.0 -Wdate-time -D_FORTIFY_SOURCE=3 -c vendor/cigraph/src/paths/sparsifier.c -o vendor/cigraph/src/paths/sparsifier.o gcc -I"/usr/share/R/include" -DNDEBUG -DUSING_R -I. -Ivendor -Ivendor/cigraph/src -Ivendor/cigraph/include -Ivendor/cigraph/vendor -Ivendor/io/parsers -I/usr/include/libxml2 -DHAVE_LIBXML -DNDEBUG -DNTIMER -DNPRINT -DIGRAPH_THREAD_LOCAL= -DPRPACK_IGRAPH_SUPPORT -DHAVE_GFORTRAN=1 -D_GNU_SOURCE=1 -I'/home/omnipath/local/R/4.4-3.20/cpp11/include' -fvisibility=hidden -fpic -g -O2 -fno-omit-frame-pointer -mno-omit-leaf-frame-pointer -ffile-prefix-map=/build/r-base-EawLoD/r-base-4.4.1=. -fstack-protector-strong -fstack-clash-protection -Wformat -Werror=format-security -fcf-protection -fdebug-prefix-map=/build/r-base-EawLoD/r-base-4.4.1=/usr/src/r-base-4.4.1-1.2404.0 -Wdate-time -D_FORTIFY_SOURCE=3 -c vendor/cigraph/src/paths/unweighted.c -o vendor/cigraph/src/paths/unweighted.o gcc -I"/usr/share/R/include" -DNDEBUG -DUSING_R -I. -Ivendor -Ivendor/cigraph/src -Ivendor/cigraph/include -Ivendor/cigraph/vendor -Ivendor/io/parsers -I/usr/include/libxml2 -DHAVE_LIBXML -DNDEBUG -DNTIMER -DNPRINT -DIGRAPH_THREAD_LOCAL= -DPRPACK_IGRAPH_SUPPORT -DHAVE_GFORTRAN=1 -D_GNU_SOURCE=1 -I'/home/omnipath/local/R/4.4-3.20/cpp11/include' -fvisibility=hidden -fpic -g -O2 -fno-omit-frame-pointer -mno-omit-leaf-frame-pointer -ffile-prefix-map=/build/r-base-EawLoD/r-base-4.4.1=. -fstack-protector-strong -fstack-clash-protection -Wformat -Werror=format-security -fcf-protection -fdebug-prefix-map=/build/r-base-EawLoD/r-base-4.4.1=/usr/src/r-base-4.4.1-1.2404.0 -Wdate-time -D_FORTIFY_SOURCE=3 -c vendor/cigraph/src/paths/voronoi.c -o vendor/cigraph/src/paths/voronoi.o gcc -I"/usr/share/R/include" -DNDEBUG -DUSING_R -I. -Ivendor -Ivendor/cigraph/src -Ivendor/cigraph/include -Ivendor/cigraph/vendor -Ivendor/io/parsers -I/usr/include/libxml2 -DHAVE_LIBXML -DNDEBUG -DNTIMER -DNPRINT -DIGRAPH_THREAD_LOCAL= -DPRPACK_IGRAPH_SUPPORT -DHAVE_GFORTRAN=1 -D_GNU_SOURCE=1 -I'/home/omnipath/local/R/4.4-3.20/cpp11/include' -fvisibility=hidden -fpic -g -O2 -fno-omit-frame-pointer -mno-omit-leaf-frame-pointer -ffile-prefix-map=/build/r-base-EawLoD/r-base-4.4.1=. -fstack-protector-strong -fstack-clash-protection -Wformat -Werror=format-security -fcf-protection -fdebug-prefix-map=/build/r-base-EawLoD/r-base-4.4.1=/usr/src/r-base-4.4.1-1.2404.0 -Wdate-time -D_FORTIFY_SOURCE=3 -c vendor/cigraph/src/paths/widest_paths.c -o vendor/cigraph/src/paths/widest_paths.o gcc -I"/usr/share/R/include" -DNDEBUG -DUSING_R -I. -Ivendor -Ivendor/cigraph/src -Ivendor/cigraph/include -Ivendor/cigraph/vendor -Ivendor/io/parsers -I/usr/include/libxml2 -DHAVE_LIBXML -DNDEBUG -DNTIMER -DNPRINT -DIGRAPH_THREAD_LOCAL= -DPRPACK_IGRAPH_SUPPORT -DHAVE_GFORTRAN=1 -D_GNU_SOURCE=1 -I'/home/omnipath/local/R/4.4-3.20/cpp11/include' -fvisibility=hidden -fpic -g -O2 -fno-omit-frame-pointer -mno-omit-leaf-frame-pointer -ffile-prefix-map=/build/r-base-EawLoD/r-base-4.4.1=. -fstack-protector-strong -fstack-clash-protection -Wformat -Werror=format-security -fcf-protection -fdebug-prefix-map=/build/r-base-EawLoD/r-base-4.4.1=/usr/src/r-base-4.4.1-1.2404.0 -Wdate-time -D_FORTIFY_SOURCE=3 -c vendor/cigraph/src/properties/basic_properties.c -o vendor/cigraph/src/properties/basic_properties.o gcc -I"/usr/share/R/include" -DNDEBUG -DUSING_R -I. -Ivendor -Ivendor/cigraph/src -Ivendor/cigraph/include -Ivendor/cigraph/vendor -Ivendor/io/parsers -I/usr/include/libxml2 -DHAVE_LIBXML -DNDEBUG -DNTIMER -DNPRINT -DIGRAPH_THREAD_LOCAL= -DPRPACK_IGRAPH_SUPPORT -DHAVE_GFORTRAN=1 -D_GNU_SOURCE=1 -I'/home/omnipath/local/R/4.4-3.20/cpp11/include' -fvisibility=hidden -fpic -g -O2 -fno-omit-frame-pointer -mno-omit-leaf-frame-pointer -ffile-prefix-map=/build/r-base-EawLoD/r-base-4.4.1=. -fstack-protector-strong -fstack-clash-protection -Wformat -Werror=format-security -fcf-protection -fdebug-prefix-map=/build/r-base-EawLoD/r-base-4.4.1=/usr/src/r-base-4.4.1-1.2404.0 -Wdate-time -D_FORTIFY_SOURCE=3 -c vendor/cigraph/src/properties/complete.c -o vendor/cigraph/src/properties/complete.o gcc -I"/usr/share/R/include" -DNDEBUG -DUSING_R -I. -Ivendor -Ivendor/cigraph/src -Ivendor/cigraph/include -Ivendor/cigraph/vendor -Ivendor/io/parsers -I/usr/include/libxml2 -DHAVE_LIBXML -DNDEBUG -DNTIMER -DNPRINT -DIGRAPH_THREAD_LOCAL= -DPRPACK_IGRAPH_SUPPORT -DHAVE_GFORTRAN=1 -D_GNU_SOURCE=1 -I'/home/omnipath/local/R/4.4-3.20/cpp11/include' -fvisibility=hidden -fpic -g -O2 -fno-omit-frame-pointer -mno-omit-leaf-frame-pointer -ffile-prefix-map=/build/r-base-EawLoD/r-base-4.4.1=. -fstack-protector-strong -fstack-clash-protection -Wformat -Werror=format-security -fcf-protection -fdebug-prefix-map=/build/r-base-EawLoD/r-base-4.4.1=/usr/src/r-base-4.4.1-1.2404.0 -Wdate-time -D_FORTIFY_SOURCE=3 -c vendor/cigraph/src/properties/constraint.c -o vendor/cigraph/src/properties/constraint.o gcc -I"/usr/share/R/include" -DNDEBUG -DUSING_R -I. -Ivendor -Ivendor/cigraph/src -Ivendor/cigraph/include -Ivendor/cigraph/vendor -Ivendor/io/parsers -I/usr/include/libxml2 -DHAVE_LIBXML -DNDEBUG -DNTIMER -DNPRINT -DIGRAPH_THREAD_LOCAL= -DPRPACK_IGRAPH_SUPPORT -DHAVE_GFORTRAN=1 -D_GNU_SOURCE=1 -I'/home/omnipath/local/R/4.4-3.20/cpp11/include' -fvisibility=hidden -fpic -g -O2 -fno-omit-frame-pointer -mno-omit-leaf-frame-pointer -ffile-prefix-map=/build/r-base-EawLoD/r-base-4.4.1=. -fstack-protector-strong -fstack-clash-protection -Wformat -Werror=format-security -fcf-protection -fdebug-prefix-map=/build/r-base-EawLoD/r-base-4.4.1=/usr/src/r-base-4.4.1-1.2404.0 -Wdate-time -D_FORTIFY_SOURCE=3 -c vendor/cigraph/src/properties/convergence_degree.c -o vendor/cigraph/src/properties/convergence_degree.o gcc -I"/usr/share/R/include" -DNDEBUG -DUSING_R -I. -Ivendor -Ivendor/cigraph/src -Ivendor/cigraph/include -Ivendor/cigraph/vendor -Ivendor/io/parsers -I/usr/include/libxml2 -DHAVE_LIBXML -DNDEBUG -DNTIMER -DNPRINT -DIGRAPH_THREAD_LOCAL= -DPRPACK_IGRAPH_SUPPORT -DHAVE_GFORTRAN=1 -D_GNU_SOURCE=1 -I'/home/omnipath/local/R/4.4-3.20/cpp11/include' -fvisibility=hidden -fpic -g -O2 -fno-omit-frame-pointer -mno-omit-leaf-frame-pointer -ffile-prefix-map=/build/r-base-EawLoD/r-base-4.4.1=. -fstack-protector-strong -fstack-clash-protection -Wformat -Werror=format-security -fcf-protection -fdebug-prefix-map=/build/r-base-EawLoD/r-base-4.4.1=/usr/src/r-base-4.4.1-1.2404.0 -Wdate-time -D_FORTIFY_SOURCE=3 -c vendor/cigraph/src/properties/dag.c -o vendor/cigraph/src/properties/dag.o gcc -I"/usr/share/R/include" -DNDEBUG -DUSING_R -I. -Ivendor -Ivendor/cigraph/src -Ivendor/cigraph/include -Ivendor/cigraph/vendor -Ivendor/io/parsers -I/usr/include/libxml2 -DHAVE_LIBXML -DNDEBUG -DNTIMER -DNPRINT -DIGRAPH_THREAD_LOCAL= -DPRPACK_IGRAPH_SUPPORT -DHAVE_GFORTRAN=1 -D_GNU_SOURCE=1 -I'/home/omnipath/local/R/4.4-3.20/cpp11/include' -fvisibility=hidden -fpic -g -O2 -fno-omit-frame-pointer -mno-omit-leaf-frame-pointer -ffile-prefix-map=/build/r-base-EawLoD/r-base-4.4.1=. -fstack-protector-strong -fstack-clash-protection -Wformat -Werror=format-security -fcf-protection -fdebug-prefix-map=/build/r-base-EawLoD/r-base-4.4.1=/usr/src/r-base-4.4.1-1.2404.0 -Wdate-time -D_FORTIFY_SOURCE=3 -c vendor/cigraph/src/properties/degrees.c -o vendor/cigraph/src/properties/degrees.o gcc -I"/usr/share/R/include" -DNDEBUG -DUSING_R -I. -Ivendor -Ivendor/cigraph/src -Ivendor/cigraph/include -Ivendor/cigraph/vendor -Ivendor/io/parsers -I/usr/include/libxml2 -DHAVE_LIBXML -DNDEBUG -DNTIMER -DNPRINT -DIGRAPH_THREAD_LOCAL= -DPRPACK_IGRAPH_SUPPORT -DHAVE_GFORTRAN=1 -D_GNU_SOURCE=1 -I'/home/omnipath/local/R/4.4-3.20/cpp11/include' -fvisibility=hidden -fpic -g -O2 -fno-omit-frame-pointer -mno-omit-leaf-frame-pointer -ffile-prefix-map=/build/r-base-EawLoD/r-base-4.4.1=. -fstack-protector-strong -fstack-clash-protection -Wformat -Werror=format-security -fcf-protection -fdebug-prefix-map=/build/r-base-EawLoD/r-base-4.4.1=/usr/src/r-base-4.4.1-1.2404.0 -Wdate-time -D_FORTIFY_SOURCE=3 -c vendor/cigraph/src/properties/ecc.c -o vendor/cigraph/src/properties/ecc.o gcc -I"/usr/share/R/include" -DNDEBUG -DUSING_R -I. -Ivendor -Ivendor/cigraph/src -Ivendor/cigraph/include -Ivendor/cigraph/vendor -Ivendor/io/parsers -I/usr/include/libxml2 -DHAVE_LIBXML -DNDEBUG -DNTIMER -DNPRINT -DIGRAPH_THREAD_LOCAL= -DPRPACK_IGRAPH_SUPPORT -DHAVE_GFORTRAN=1 -D_GNU_SOURCE=1 -I'/home/omnipath/local/R/4.4-3.20/cpp11/include' -fvisibility=hidden -fpic -g -O2 -fno-omit-frame-pointer -mno-omit-leaf-frame-pointer -ffile-prefix-map=/build/r-base-EawLoD/r-base-4.4.1=. -fstack-protector-strong -fstack-clash-protection -Wformat -Werror=format-security -fcf-protection -fdebug-prefix-map=/build/r-base-EawLoD/r-base-4.4.1=/usr/src/r-base-4.4.1-1.2404.0 -Wdate-time -D_FORTIFY_SOURCE=3 -c vendor/cigraph/src/properties/girth.c -o vendor/cigraph/src/properties/girth.o gcc -I"/usr/share/R/include" -DNDEBUG -DUSING_R -I. -Ivendor -Ivendor/cigraph/src -Ivendor/cigraph/include -Ivendor/cigraph/vendor -Ivendor/io/parsers -I/usr/include/libxml2 -DHAVE_LIBXML -DNDEBUG -DNTIMER -DNPRINT -DIGRAPH_THREAD_LOCAL= -DPRPACK_IGRAPH_SUPPORT -DHAVE_GFORTRAN=1 -D_GNU_SOURCE=1 -I'/home/omnipath/local/R/4.4-3.20/cpp11/include' -fvisibility=hidden -fpic -g -O2 -fno-omit-frame-pointer -mno-omit-leaf-frame-pointer -ffile-prefix-map=/build/r-base-EawLoD/r-base-4.4.1=. -fstack-protector-strong -fstack-clash-protection -Wformat -Werror=format-security -fcf-protection -fdebug-prefix-map=/build/r-base-EawLoD/r-base-4.4.1=/usr/src/r-base-4.4.1-1.2404.0 -Wdate-time -D_FORTIFY_SOURCE=3 -c vendor/cigraph/src/properties/loops.c -o vendor/cigraph/src/properties/loops.o gcc -I"/usr/share/R/include" -DNDEBUG -DUSING_R -I. -Ivendor -Ivendor/cigraph/src -Ivendor/cigraph/include -Ivendor/cigraph/vendor -Ivendor/io/parsers -I/usr/include/libxml2 -DHAVE_LIBXML -DNDEBUG -DNTIMER -DNPRINT -DIGRAPH_THREAD_LOCAL= -DPRPACK_IGRAPH_SUPPORT -DHAVE_GFORTRAN=1 -D_GNU_SOURCE=1 -I'/home/omnipath/local/R/4.4-3.20/cpp11/include' -fvisibility=hidden -fpic -g -O2 -fno-omit-frame-pointer -mno-omit-leaf-frame-pointer -ffile-prefix-map=/build/r-base-EawLoD/r-base-4.4.1=. -fstack-protector-strong -fstack-clash-protection -Wformat -Werror=format-security -fcf-protection -fdebug-prefix-map=/build/r-base-EawLoD/r-base-4.4.1=/usr/src/r-base-4.4.1-1.2404.0 -Wdate-time -D_FORTIFY_SOURCE=3 -c vendor/cigraph/src/properties/multiplicity.c -o vendor/cigraph/src/properties/multiplicity.o gcc -I"/usr/share/R/include" -DNDEBUG -DUSING_R -I. -Ivendor -Ivendor/cigraph/src -Ivendor/cigraph/include -Ivendor/cigraph/vendor -Ivendor/io/parsers -I/usr/include/libxml2 -DHAVE_LIBXML -DNDEBUG -DNTIMER -DNPRINT -DIGRAPH_THREAD_LOCAL= -DPRPACK_IGRAPH_SUPPORT -DHAVE_GFORTRAN=1 -D_GNU_SOURCE=1 -I'/home/omnipath/local/R/4.4-3.20/cpp11/include' -fvisibility=hidden -fpic -g -O2 -fno-omit-frame-pointer -mno-omit-leaf-frame-pointer -ffile-prefix-map=/build/r-base-EawLoD/r-base-4.4.1=. -fstack-protector-strong -fstack-clash-protection -Wformat -Werror=format-security -fcf-protection -fdebug-prefix-map=/build/r-base-EawLoD/r-base-4.4.1=/usr/src/r-base-4.4.1-1.2404.0 -Wdate-time -D_FORTIFY_SOURCE=3 -c vendor/cigraph/src/properties/neighborhood.c -o vendor/cigraph/src/properties/neighborhood.o gcc -I"/usr/share/R/include" -DNDEBUG -DUSING_R -I. -Ivendor -Ivendor/cigraph/src -Ivendor/cigraph/include -Ivendor/cigraph/vendor -Ivendor/io/parsers -I/usr/include/libxml2 -DHAVE_LIBXML -DNDEBUG -DNTIMER -DNPRINT -DIGRAPH_THREAD_LOCAL= -DPRPACK_IGRAPH_SUPPORT -DHAVE_GFORTRAN=1 -D_GNU_SOURCE=1 -I'/home/omnipath/local/R/4.4-3.20/cpp11/include' -fvisibility=hidden -fpic -g -O2 -fno-omit-frame-pointer -mno-omit-leaf-frame-pointer -ffile-prefix-map=/build/r-base-EawLoD/r-base-4.4.1=. -fstack-protector-strong -fstack-clash-protection -Wformat -Werror=format-security -fcf-protection -fdebug-prefix-map=/build/r-base-EawLoD/r-base-4.4.1=/usr/src/r-base-4.4.1-1.2404.0 -Wdate-time -D_FORTIFY_SOURCE=3 -c vendor/cigraph/src/properties/perfect.c -o vendor/cigraph/src/properties/perfect.o gcc -I"/usr/share/R/include" -DNDEBUG -DUSING_R -I. -Ivendor -Ivendor/cigraph/src -Ivendor/cigraph/include -Ivendor/cigraph/vendor -Ivendor/io/parsers -I/usr/include/libxml2 -DHAVE_LIBXML -DNDEBUG -DNTIMER -DNPRINT -DIGRAPH_THREAD_LOCAL= -DPRPACK_IGRAPH_SUPPORT -DHAVE_GFORTRAN=1 -D_GNU_SOURCE=1 -I'/home/omnipath/local/R/4.4-3.20/cpp11/include' -fvisibility=hidden -fpic -g -O2 -fno-omit-frame-pointer -mno-omit-leaf-frame-pointer -ffile-prefix-map=/build/r-base-EawLoD/r-base-4.4.1=. -fstack-protector-strong -fstack-clash-protection -Wformat -Werror=format-security -fcf-protection -fdebug-prefix-map=/build/r-base-EawLoD/r-base-4.4.1=/usr/src/r-base-4.4.1-1.2404.0 -Wdate-time -D_FORTIFY_SOURCE=3 -c vendor/cigraph/src/properties/spectral.c -o vendor/cigraph/src/properties/spectral.o gcc -I"/usr/share/R/include" -DNDEBUG -DUSING_R -I. -Ivendor -Ivendor/cigraph/src -Ivendor/cigraph/include -Ivendor/cigraph/vendor -Ivendor/io/parsers -I/usr/include/libxml2 -DHAVE_LIBXML -DNDEBUG -DNTIMER -DNPRINT -DIGRAPH_THREAD_LOCAL= -DPRPACK_IGRAPH_SUPPORT -DHAVE_GFORTRAN=1 -D_GNU_SOURCE=1 -I'/home/omnipath/local/R/4.4-3.20/cpp11/include' -fvisibility=hidden -fpic -g -O2 -fno-omit-frame-pointer -mno-omit-leaf-frame-pointer -ffile-prefix-map=/build/r-base-EawLoD/r-base-4.4.1=. -fstack-protector-strong -fstack-clash-protection -Wformat -Werror=format-security -fcf-protection -fdebug-prefix-map=/build/r-base-EawLoD/r-base-4.4.1=/usr/src/r-base-4.4.1-1.2404.0 -Wdate-time -D_FORTIFY_SOURCE=3 -c vendor/cigraph/src/properties/trees.c -o vendor/cigraph/src/properties/trees.o gcc -I"/usr/share/R/include" -DNDEBUG -DUSING_R -I. -Ivendor -Ivendor/cigraph/src -Ivendor/cigraph/include -Ivendor/cigraph/vendor -Ivendor/io/parsers -I/usr/include/libxml2 -DHAVE_LIBXML -DNDEBUG -DNTIMER -DNPRINT -DIGRAPH_THREAD_LOCAL= -DPRPACK_IGRAPH_SUPPORT -DHAVE_GFORTRAN=1 -D_GNU_SOURCE=1 -I'/home/omnipath/local/R/4.4-3.20/cpp11/include' -fvisibility=hidden -fpic -g -O2 -fno-omit-frame-pointer -mno-omit-leaf-frame-pointer -ffile-prefix-map=/build/r-base-EawLoD/r-base-4.4.1=. -fstack-protector-strong -fstack-clash-protection -Wformat -Werror=format-security -fcf-protection -fdebug-prefix-map=/build/r-base-EawLoD/r-base-4.4.1=/usr/src/r-base-4.4.1-1.2404.0 -Wdate-time -D_FORTIFY_SOURCE=3 -c vendor/cigraph/src/properties/triangles.c -o vendor/cigraph/src/properties/triangles.o gcc -I"/usr/share/R/include" -DNDEBUG -DUSING_R -I. -Ivendor -Ivendor/cigraph/src -Ivendor/cigraph/include -Ivendor/cigraph/vendor -Ivendor/io/parsers -I/usr/include/libxml2 -DHAVE_LIBXML -DNDEBUG -DNTIMER -DNPRINT -DIGRAPH_THREAD_LOCAL= -DPRPACK_IGRAPH_SUPPORT -DHAVE_GFORTRAN=1 -D_GNU_SOURCE=1 -I'/home/omnipath/local/R/4.4-3.20/cpp11/include' -fvisibility=hidden -fpic -g -O2 -fno-omit-frame-pointer -mno-omit-leaf-frame-pointer -ffile-prefix-map=/build/r-base-EawLoD/r-base-4.4.1=. -fstack-protector-strong -fstack-clash-protection -Wformat -Werror=format-security -fcf-protection -fdebug-prefix-map=/build/r-base-EawLoD/r-base-4.4.1=/usr/src/r-base-4.4.1-1.2404.0 -Wdate-time -D_FORTIFY_SOURCE=3 -c vendor/cigraph/src/random/random.c -o vendor/cigraph/src/random/random.o gcc -I"/usr/share/R/include" -DNDEBUG -DUSING_R -I. -Ivendor -Ivendor/cigraph/src -Ivendor/cigraph/include -Ivendor/cigraph/vendor -Ivendor/io/parsers -I/usr/include/libxml2 -DHAVE_LIBXML -DNDEBUG -DNTIMER -DNPRINT -DIGRAPH_THREAD_LOCAL= -DPRPACK_IGRAPH_SUPPORT -DHAVE_GFORTRAN=1 -D_GNU_SOURCE=1 -I'/home/omnipath/local/R/4.4-3.20/cpp11/include' -fvisibility=hidden -fpic -g -O2 -fno-omit-frame-pointer -mno-omit-leaf-frame-pointer -ffile-prefix-map=/build/r-base-EawLoD/r-base-4.4.1=. -fstack-protector-strong -fstack-clash-protection -Wformat -Werror=format-security -fcf-protection -fdebug-prefix-map=/build/r-base-EawLoD/r-base-4.4.1=/usr/src/r-base-4.4.1-1.2404.0 -Wdate-time -D_FORTIFY_SOURCE=3 -c vendor/cigraph/src/random/rng_glibc2.c -o vendor/cigraph/src/random/rng_glibc2.o gcc -I"/usr/share/R/include" -DNDEBUG -DUSING_R -I. -Ivendor -Ivendor/cigraph/src -Ivendor/cigraph/include -Ivendor/cigraph/vendor -Ivendor/io/parsers -I/usr/include/libxml2 -DHAVE_LIBXML -DNDEBUG -DNTIMER -DNPRINT -DIGRAPH_THREAD_LOCAL= -DPRPACK_IGRAPH_SUPPORT -DHAVE_GFORTRAN=1 -D_GNU_SOURCE=1 -I'/home/omnipath/local/R/4.4-3.20/cpp11/include' -fvisibility=hidden -fpic -g -O2 -fno-omit-frame-pointer -mno-omit-leaf-frame-pointer -ffile-prefix-map=/build/r-base-EawLoD/r-base-4.4.1=. -fstack-protector-strong -fstack-clash-protection -Wformat -Werror=format-security -fcf-protection -fdebug-prefix-map=/build/r-base-EawLoD/r-base-4.4.1=/usr/src/r-base-4.4.1-1.2404.0 -Wdate-time -D_FORTIFY_SOURCE=3 -c vendor/cigraph/src/random/rng_mt19937.c -o vendor/cigraph/src/random/rng_mt19937.o gcc -I"/usr/share/R/include" -DNDEBUG -DUSING_R -I. -Ivendor -Ivendor/cigraph/src -Ivendor/cigraph/include -Ivendor/cigraph/vendor -Ivendor/io/parsers -I/usr/include/libxml2 -DHAVE_LIBXML -DNDEBUG -DNTIMER -DNPRINT -DIGRAPH_THREAD_LOCAL= -DPRPACK_IGRAPH_SUPPORT -DHAVE_GFORTRAN=1 -D_GNU_SOURCE=1 -I'/home/omnipath/local/R/4.4-3.20/cpp11/include' -fvisibility=hidden -fpic -g -O2 -fno-omit-frame-pointer -mno-omit-leaf-frame-pointer -ffile-prefix-map=/build/r-base-EawLoD/r-base-4.4.1=. -fstack-protector-strong -fstack-clash-protection -Wformat -Werror=format-security -fcf-protection -fdebug-prefix-map=/build/r-base-EawLoD/r-base-4.4.1=/usr/src/r-base-4.4.1-1.2404.0 -Wdate-time -D_FORTIFY_SOURCE=3 -c vendor/cigraph/src/random/rng_pcg32.c -o vendor/cigraph/src/random/rng_pcg32.o gcc -I"/usr/share/R/include" -DNDEBUG -DUSING_R -I. -Ivendor -Ivendor/cigraph/src -Ivendor/cigraph/include -Ivendor/cigraph/vendor -Ivendor/io/parsers -I/usr/include/libxml2 -DHAVE_LIBXML -DNDEBUG -DNTIMER -DNPRINT -DIGRAPH_THREAD_LOCAL= -DPRPACK_IGRAPH_SUPPORT -DHAVE_GFORTRAN=1 -D_GNU_SOURCE=1 -I'/home/omnipath/local/R/4.4-3.20/cpp11/include' -fvisibility=hidden -fpic -g -O2 -fno-omit-frame-pointer -mno-omit-leaf-frame-pointer -ffile-prefix-map=/build/r-base-EawLoD/r-base-4.4.1=. -fstack-protector-strong -fstack-clash-protection -Wformat -Werror=format-security -fcf-protection -fdebug-prefix-map=/build/r-base-EawLoD/r-base-4.4.1=/usr/src/r-base-4.4.1-1.2404.0 -Wdate-time -D_FORTIFY_SOURCE=3 -c vendor/cigraph/src/random/rng_pcg64.c -o vendor/cigraph/src/random/rng_pcg64.o gcc -I"/usr/share/R/include" -DNDEBUG -DUSING_R -I. -Ivendor -Ivendor/cigraph/src -Ivendor/cigraph/include -Ivendor/cigraph/vendor -Ivendor/io/parsers -I/usr/include/libxml2 -DHAVE_LIBXML -DNDEBUG -DNTIMER -DNPRINT -DIGRAPH_THREAD_LOCAL= -DPRPACK_IGRAPH_SUPPORT -DHAVE_GFORTRAN=1 -D_GNU_SOURCE=1 -I'/home/omnipath/local/R/4.4-3.20/cpp11/include' -fvisibility=hidden -fpic -g -O2 -fno-omit-frame-pointer -mno-omit-leaf-frame-pointer -ffile-prefix-map=/build/r-base-EawLoD/r-base-4.4.1=. -fstack-protector-strong -fstack-clash-protection -Wformat -Werror=format-security -fcf-protection -fdebug-prefix-map=/build/r-base-EawLoD/r-base-4.4.1=/usr/src/r-base-4.4.1-1.2404.0 -Wdate-time -D_FORTIFY_SOURCE=3 -c vendor/cigraph/src/version.c -o vendor/cigraph/src/version.o gcc -I"/usr/share/R/include" -DNDEBUG -DUSING_R -I. -Ivendor -Ivendor/cigraph/src -Ivendor/cigraph/include -Ivendor/cigraph/vendor -Ivendor/io/parsers -I/usr/include/libxml2 -DHAVE_LIBXML -DNDEBUG -DNTIMER -DNPRINT -DIGRAPH_THREAD_LOCAL= -DPRPACK_IGRAPH_SUPPORT -DHAVE_GFORTRAN=1 -D_GNU_SOURCE=1 -I'/home/omnipath/local/R/4.4-3.20/cpp11/include' -fvisibility=hidden -fpic -g -O2 -fno-omit-frame-pointer -mno-omit-leaf-frame-pointer -ffile-prefix-map=/build/r-base-EawLoD/r-base-4.4.1=. -fstack-protector-strong -fstack-clash-protection -Wformat -Werror=format-security -fcf-protection -fdebug-prefix-map=/build/r-base-EawLoD/r-base-4.4.1=/usr/src/r-base-4.4.1-1.2404.0 -Wdate-time -D_FORTIFY_SOURCE=3 -c vendor/cigraph/vendor/cs/cs_add.c -o vendor/cigraph/vendor/cs/cs_add.o gcc -I"/usr/share/R/include" -DNDEBUG -DUSING_R -I. -Ivendor -Ivendor/cigraph/src -Ivendor/cigraph/include -Ivendor/cigraph/vendor -Ivendor/io/parsers -I/usr/include/libxml2 -DHAVE_LIBXML -DNDEBUG -DNTIMER -DNPRINT -DIGRAPH_THREAD_LOCAL= -DPRPACK_IGRAPH_SUPPORT -DHAVE_GFORTRAN=1 -D_GNU_SOURCE=1 -I'/home/omnipath/local/R/4.4-3.20/cpp11/include' -fvisibility=hidden -fpic -g -O2 -fno-omit-frame-pointer -mno-omit-leaf-frame-pointer -ffile-prefix-map=/build/r-base-EawLoD/r-base-4.4.1=. -fstack-protector-strong -fstack-clash-protection -Wformat -Werror=format-security -fcf-protection -fdebug-prefix-map=/build/r-base-EawLoD/r-base-4.4.1=/usr/src/r-base-4.4.1-1.2404.0 -Wdate-time -D_FORTIFY_SOURCE=3 -c vendor/cigraph/vendor/cs/cs_amd.c -o vendor/cigraph/vendor/cs/cs_amd.o gcc -I"/usr/share/R/include" -DNDEBUG -DUSING_R -I. -Ivendor -Ivendor/cigraph/src -Ivendor/cigraph/include -Ivendor/cigraph/vendor -Ivendor/io/parsers -I/usr/include/libxml2 -DHAVE_LIBXML -DNDEBUG -DNTIMER -DNPRINT -DIGRAPH_THREAD_LOCAL= -DPRPACK_IGRAPH_SUPPORT -DHAVE_GFORTRAN=1 -D_GNU_SOURCE=1 -I'/home/omnipath/local/R/4.4-3.20/cpp11/include' -fvisibility=hidden -fpic -g -O2 -fno-omit-frame-pointer -mno-omit-leaf-frame-pointer -ffile-prefix-map=/build/r-base-EawLoD/r-base-4.4.1=. -fstack-protector-strong -fstack-clash-protection -Wformat -Werror=format-security -fcf-protection -fdebug-prefix-map=/build/r-base-EawLoD/r-base-4.4.1=/usr/src/r-base-4.4.1-1.2404.0 -Wdate-time -D_FORTIFY_SOURCE=3 -c vendor/cigraph/vendor/cs/cs_chol.c -o vendor/cigraph/vendor/cs/cs_chol.o gcc -I"/usr/share/R/include" -DNDEBUG -DUSING_R -I. -Ivendor -Ivendor/cigraph/src -Ivendor/cigraph/include -Ivendor/cigraph/vendor -Ivendor/io/parsers -I/usr/include/libxml2 -DHAVE_LIBXML -DNDEBUG -DNTIMER -DNPRINT -DIGRAPH_THREAD_LOCAL= -DPRPACK_IGRAPH_SUPPORT -DHAVE_GFORTRAN=1 -D_GNU_SOURCE=1 -I'/home/omnipath/local/R/4.4-3.20/cpp11/include' -fvisibility=hidden -fpic -g -O2 -fno-omit-frame-pointer -mno-omit-leaf-frame-pointer -ffile-prefix-map=/build/r-base-EawLoD/r-base-4.4.1=. -fstack-protector-strong -fstack-clash-protection -Wformat -Werror=format-security -fcf-protection -fdebug-prefix-map=/build/r-base-EawLoD/r-base-4.4.1=/usr/src/r-base-4.4.1-1.2404.0 -Wdate-time -D_FORTIFY_SOURCE=3 -c vendor/cigraph/vendor/cs/cs_cholsol.c -o vendor/cigraph/vendor/cs/cs_cholsol.o gcc -I"/usr/share/R/include" -DNDEBUG -DUSING_R -I. -Ivendor -Ivendor/cigraph/src -Ivendor/cigraph/include -Ivendor/cigraph/vendor -Ivendor/io/parsers -I/usr/include/libxml2 -DHAVE_LIBXML -DNDEBUG -DNTIMER -DNPRINT -DIGRAPH_THREAD_LOCAL= -DPRPACK_IGRAPH_SUPPORT -DHAVE_GFORTRAN=1 -D_GNU_SOURCE=1 -I'/home/omnipath/local/R/4.4-3.20/cpp11/include' -fvisibility=hidden -fpic -g -O2 -fno-omit-frame-pointer -mno-omit-leaf-frame-pointer -ffile-prefix-map=/build/r-base-EawLoD/r-base-4.4.1=. -fstack-protector-strong -fstack-clash-protection -Wformat -Werror=format-security -fcf-protection -fdebug-prefix-map=/build/r-base-EawLoD/r-base-4.4.1=/usr/src/r-base-4.4.1-1.2404.0 -Wdate-time -D_FORTIFY_SOURCE=3 -c vendor/cigraph/vendor/cs/cs_compress.c -o vendor/cigraph/vendor/cs/cs_compress.o gcc -I"/usr/share/R/include" -DNDEBUG -DUSING_R -I. -Ivendor -Ivendor/cigraph/src -Ivendor/cigraph/include -Ivendor/cigraph/vendor -Ivendor/io/parsers -I/usr/include/libxml2 -DHAVE_LIBXML -DNDEBUG -DNTIMER -DNPRINT -DIGRAPH_THREAD_LOCAL= -DPRPACK_IGRAPH_SUPPORT -DHAVE_GFORTRAN=1 -D_GNU_SOURCE=1 -I'/home/omnipath/local/R/4.4-3.20/cpp11/include' -fvisibility=hidden -fpic -g -O2 -fno-omit-frame-pointer -mno-omit-leaf-frame-pointer -ffile-prefix-map=/build/r-base-EawLoD/r-base-4.4.1=. -fstack-protector-strong -fstack-clash-protection -Wformat -Werror=format-security -fcf-protection -fdebug-prefix-map=/build/r-base-EawLoD/r-base-4.4.1=/usr/src/r-base-4.4.1-1.2404.0 -Wdate-time -D_FORTIFY_SOURCE=3 -c vendor/cigraph/vendor/cs/cs_counts.c -o vendor/cigraph/vendor/cs/cs_counts.o gcc -I"/usr/share/R/include" -DNDEBUG -DUSING_R -I. -Ivendor -Ivendor/cigraph/src -Ivendor/cigraph/include -Ivendor/cigraph/vendor -Ivendor/io/parsers -I/usr/include/libxml2 -DHAVE_LIBXML -DNDEBUG -DNTIMER -DNPRINT -DIGRAPH_THREAD_LOCAL= -DPRPACK_IGRAPH_SUPPORT -DHAVE_GFORTRAN=1 -D_GNU_SOURCE=1 -I'/home/omnipath/local/R/4.4-3.20/cpp11/include' -fvisibility=hidden -fpic -g -O2 -fno-omit-frame-pointer -mno-omit-leaf-frame-pointer -ffile-prefix-map=/build/r-base-EawLoD/r-base-4.4.1=. -fstack-protector-strong -fstack-clash-protection -Wformat -Werror=format-security -fcf-protection -fdebug-prefix-map=/build/r-base-EawLoD/r-base-4.4.1=/usr/src/r-base-4.4.1-1.2404.0 -Wdate-time -D_FORTIFY_SOURCE=3 -c vendor/cigraph/vendor/cs/cs_cumsum.c -o vendor/cigraph/vendor/cs/cs_cumsum.o gcc -I"/usr/share/R/include" -DNDEBUG -DUSING_R -I. -Ivendor -Ivendor/cigraph/src -Ivendor/cigraph/include -Ivendor/cigraph/vendor -Ivendor/io/parsers -I/usr/include/libxml2 -DHAVE_LIBXML -DNDEBUG -DNTIMER -DNPRINT -DIGRAPH_THREAD_LOCAL= -DPRPACK_IGRAPH_SUPPORT -DHAVE_GFORTRAN=1 -D_GNU_SOURCE=1 -I'/home/omnipath/local/R/4.4-3.20/cpp11/include' -fvisibility=hidden -fpic -g -O2 -fno-omit-frame-pointer -mno-omit-leaf-frame-pointer -ffile-prefix-map=/build/r-base-EawLoD/r-base-4.4.1=. -fstack-protector-strong -fstack-clash-protection -Wformat -Werror=format-security -fcf-protection -fdebug-prefix-map=/build/r-base-EawLoD/r-base-4.4.1=/usr/src/r-base-4.4.1-1.2404.0 -Wdate-time -D_FORTIFY_SOURCE=3 -c vendor/cigraph/vendor/cs/cs_dfs.c -o vendor/cigraph/vendor/cs/cs_dfs.o gcc -I"/usr/share/R/include" -DNDEBUG -DUSING_R -I. -Ivendor -Ivendor/cigraph/src -Ivendor/cigraph/include -Ivendor/cigraph/vendor -Ivendor/io/parsers -I/usr/include/libxml2 -DHAVE_LIBXML -DNDEBUG -DNTIMER -DNPRINT -DIGRAPH_THREAD_LOCAL= -DPRPACK_IGRAPH_SUPPORT -DHAVE_GFORTRAN=1 -D_GNU_SOURCE=1 -I'/home/omnipath/local/R/4.4-3.20/cpp11/include' -fvisibility=hidden -fpic -g -O2 -fno-omit-frame-pointer -mno-omit-leaf-frame-pointer -ffile-prefix-map=/build/r-base-EawLoD/r-base-4.4.1=. -fstack-protector-strong -fstack-clash-protection -Wformat -Werror=format-security -fcf-protection -fdebug-prefix-map=/build/r-base-EawLoD/r-base-4.4.1=/usr/src/r-base-4.4.1-1.2404.0 -Wdate-time -D_FORTIFY_SOURCE=3 -c vendor/cigraph/vendor/cs/cs_dmperm.c -o vendor/cigraph/vendor/cs/cs_dmperm.o gcc -I"/usr/share/R/include" -DNDEBUG -DUSING_R -I. -Ivendor -Ivendor/cigraph/src -Ivendor/cigraph/include -Ivendor/cigraph/vendor -Ivendor/io/parsers -I/usr/include/libxml2 -DHAVE_LIBXML -DNDEBUG -DNTIMER -DNPRINT -DIGRAPH_THREAD_LOCAL= -DPRPACK_IGRAPH_SUPPORT -DHAVE_GFORTRAN=1 -D_GNU_SOURCE=1 -I'/home/omnipath/local/R/4.4-3.20/cpp11/include' -fvisibility=hidden -fpic -g -O2 -fno-omit-frame-pointer -mno-omit-leaf-frame-pointer -ffile-prefix-map=/build/r-base-EawLoD/r-base-4.4.1=. -fstack-protector-strong -fstack-clash-protection -Wformat -Werror=format-security -fcf-protection -fdebug-prefix-map=/build/r-base-EawLoD/r-base-4.4.1=/usr/src/r-base-4.4.1-1.2404.0 -Wdate-time -D_FORTIFY_SOURCE=3 -c vendor/cigraph/vendor/cs/cs_droptol.c -o vendor/cigraph/vendor/cs/cs_droptol.o gcc -I"/usr/share/R/include" -DNDEBUG -DUSING_R -I. -Ivendor -Ivendor/cigraph/src -Ivendor/cigraph/include -Ivendor/cigraph/vendor -Ivendor/io/parsers -I/usr/include/libxml2 -DHAVE_LIBXML -DNDEBUG -DNTIMER -DNPRINT -DIGRAPH_THREAD_LOCAL= -DPRPACK_IGRAPH_SUPPORT -DHAVE_GFORTRAN=1 -D_GNU_SOURCE=1 -I'/home/omnipath/local/R/4.4-3.20/cpp11/include' -fvisibility=hidden -fpic -g -O2 -fno-omit-frame-pointer -mno-omit-leaf-frame-pointer -ffile-prefix-map=/build/r-base-EawLoD/r-base-4.4.1=. -fstack-protector-strong -fstack-clash-protection -Wformat -Werror=format-security -fcf-protection -fdebug-prefix-map=/build/r-base-EawLoD/r-base-4.4.1=/usr/src/r-base-4.4.1-1.2404.0 -Wdate-time -D_FORTIFY_SOURCE=3 -c vendor/cigraph/vendor/cs/cs_dropzeros.c -o vendor/cigraph/vendor/cs/cs_dropzeros.o gcc -I"/usr/share/R/include" -DNDEBUG -DUSING_R -I. -Ivendor -Ivendor/cigraph/src -Ivendor/cigraph/include -Ivendor/cigraph/vendor -Ivendor/io/parsers -I/usr/include/libxml2 -DHAVE_LIBXML -DNDEBUG -DNTIMER -DNPRINT -DIGRAPH_THREAD_LOCAL= -DPRPACK_IGRAPH_SUPPORT -DHAVE_GFORTRAN=1 -D_GNU_SOURCE=1 -I'/home/omnipath/local/R/4.4-3.20/cpp11/include' -fvisibility=hidden -fpic -g -O2 -fno-omit-frame-pointer -mno-omit-leaf-frame-pointer -ffile-prefix-map=/build/r-base-EawLoD/r-base-4.4.1=. -fstack-protector-strong -fstack-clash-protection -Wformat -Werror=format-security -fcf-protection -fdebug-prefix-map=/build/r-base-EawLoD/r-base-4.4.1=/usr/src/r-base-4.4.1-1.2404.0 -Wdate-time -D_FORTIFY_SOURCE=3 -c vendor/cigraph/vendor/cs/cs_dupl.c -o vendor/cigraph/vendor/cs/cs_dupl.o gcc -I"/usr/share/R/include" -DNDEBUG -DUSING_R -I. -Ivendor -Ivendor/cigraph/src -Ivendor/cigraph/include -Ivendor/cigraph/vendor -Ivendor/io/parsers -I/usr/include/libxml2 -DHAVE_LIBXML -DNDEBUG -DNTIMER -DNPRINT -DIGRAPH_THREAD_LOCAL= -DPRPACK_IGRAPH_SUPPORT -DHAVE_GFORTRAN=1 -D_GNU_SOURCE=1 -I'/home/omnipath/local/R/4.4-3.20/cpp11/include' -fvisibility=hidden -fpic -g -O2 -fno-omit-frame-pointer -mno-omit-leaf-frame-pointer -ffile-prefix-map=/build/r-base-EawLoD/r-base-4.4.1=. -fstack-protector-strong -fstack-clash-protection -Wformat -Werror=format-security -fcf-protection -fdebug-prefix-map=/build/r-base-EawLoD/r-base-4.4.1=/usr/src/r-base-4.4.1-1.2404.0 -Wdate-time -D_FORTIFY_SOURCE=3 -c vendor/cigraph/vendor/cs/cs_entry.c -o vendor/cigraph/vendor/cs/cs_entry.o gcc -I"/usr/share/R/include" -DNDEBUG -DUSING_R -I. -Ivendor -Ivendor/cigraph/src -Ivendor/cigraph/include -Ivendor/cigraph/vendor -Ivendor/io/parsers -I/usr/include/libxml2 -DHAVE_LIBXML -DNDEBUG -DNTIMER -DNPRINT -DIGRAPH_THREAD_LOCAL= -DPRPACK_IGRAPH_SUPPORT -DHAVE_GFORTRAN=1 -D_GNU_SOURCE=1 -I'/home/omnipath/local/R/4.4-3.20/cpp11/include' -fvisibility=hidden -fpic -g -O2 -fno-omit-frame-pointer -mno-omit-leaf-frame-pointer -ffile-prefix-map=/build/r-base-EawLoD/r-base-4.4.1=. -fstack-protector-strong -fstack-clash-protection -Wformat -Werror=format-security -fcf-protection -fdebug-prefix-map=/build/r-base-EawLoD/r-base-4.4.1=/usr/src/r-base-4.4.1-1.2404.0 -Wdate-time -D_FORTIFY_SOURCE=3 -c vendor/cigraph/vendor/cs/cs_ereach.c -o vendor/cigraph/vendor/cs/cs_ereach.o gcc -I"/usr/share/R/include" -DNDEBUG -DUSING_R -I. -Ivendor -Ivendor/cigraph/src -Ivendor/cigraph/include -Ivendor/cigraph/vendor -Ivendor/io/parsers -I/usr/include/libxml2 -DHAVE_LIBXML -DNDEBUG -DNTIMER -DNPRINT -DIGRAPH_THREAD_LOCAL= -DPRPACK_IGRAPH_SUPPORT -DHAVE_GFORTRAN=1 -D_GNU_SOURCE=1 -I'/home/omnipath/local/R/4.4-3.20/cpp11/include' -fvisibility=hidden -fpic -g -O2 -fno-omit-frame-pointer -mno-omit-leaf-frame-pointer -ffile-prefix-map=/build/r-base-EawLoD/r-base-4.4.1=. -fstack-protector-strong -fstack-clash-protection -Wformat -Werror=format-security -fcf-protection -fdebug-prefix-map=/build/r-base-EawLoD/r-base-4.4.1=/usr/src/r-base-4.4.1-1.2404.0 -Wdate-time -D_FORTIFY_SOURCE=3 -c vendor/cigraph/vendor/cs/cs_etree.c -o vendor/cigraph/vendor/cs/cs_etree.o gcc -I"/usr/share/R/include" -DNDEBUG -DUSING_R -I. -Ivendor -Ivendor/cigraph/src -Ivendor/cigraph/include -Ivendor/cigraph/vendor -Ivendor/io/parsers -I/usr/include/libxml2 -DHAVE_LIBXML -DNDEBUG -DNTIMER -DNPRINT -DIGRAPH_THREAD_LOCAL= -DPRPACK_IGRAPH_SUPPORT -DHAVE_GFORTRAN=1 -D_GNU_SOURCE=1 -I'/home/omnipath/local/R/4.4-3.20/cpp11/include' -fvisibility=hidden -fpic -g -O2 -fno-omit-frame-pointer -mno-omit-leaf-frame-pointer -ffile-prefix-map=/build/r-base-EawLoD/r-base-4.4.1=. -fstack-protector-strong -fstack-clash-protection -Wformat -Werror=format-security -fcf-protection -fdebug-prefix-map=/build/r-base-EawLoD/r-base-4.4.1=/usr/src/r-base-4.4.1-1.2404.0 -Wdate-time -D_FORTIFY_SOURCE=3 -c vendor/cigraph/vendor/cs/cs_fkeep.c -o vendor/cigraph/vendor/cs/cs_fkeep.o gcc -I"/usr/share/R/include" -DNDEBUG -DUSING_R -I. -Ivendor -Ivendor/cigraph/src -Ivendor/cigraph/include -Ivendor/cigraph/vendor -Ivendor/io/parsers -I/usr/include/libxml2 -DHAVE_LIBXML -DNDEBUG -DNTIMER -DNPRINT -DIGRAPH_THREAD_LOCAL= -DPRPACK_IGRAPH_SUPPORT -DHAVE_GFORTRAN=1 -D_GNU_SOURCE=1 -I'/home/omnipath/local/R/4.4-3.20/cpp11/include' -fvisibility=hidden -fpic -g -O2 -fno-omit-frame-pointer -mno-omit-leaf-frame-pointer -ffile-prefix-map=/build/r-base-EawLoD/r-base-4.4.1=. -fstack-protector-strong -fstack-clash-protection -Wformat -Werror=format-security -fcf-protection -fdebug-prefix-map=/build/r-base-EawLoD/r-base-4.4.1=/usr/src/r-base-4.4.1-1.2404.0 -Wdate-time -D_FORTIFY_SOURCE=3 -c vendor/cigraph/vendor/cs/cs_gaxpy.c -o vendor/cigraph/vendor/cs/cs_gaxpy.o gcc -I"/usr/share/R/include" -DNDEBUG -DUSING_R -I. -Ivendor -Ivendor/cigraph/src -Ivendor/cigraph/include -Ivendor/cigraph/vendor -Ivendor/io/parsers -I/usr/include/libxml2 -DHAVE_LIBXML -DNDEBUG -DNTIMER -DNPRINT -DIGRAPH_THREAD_LOCAL= -DPRPACK_IGRAPH_SUPPORT -DHAVE_GFORTRAN=1 -D_GNU_SOURCE=1 -I'/home/omnipath/local/R/4.4-3.20/cpp11/include' -fvisibility=hidden -fpic -g -O2 -fno-omit-frame-pointer -mno-omit-leaf-frame-pointer -ffile-prefix-map=/build/r-base-EawLoD/r-base-4.4.1=. -fstack-protector-strong -fstack-clash-protection -Wformat -Werror=format-security -fcf-protection -fdebug-prefix-map=/build/r-base-EawLoD/r-base-4.4.1=/usr/src/r-base-4.4.1-1.2404.0 -Wdate-time -D_FORTIFY_SOURCE=3 -c vendor/cigraph/vendor/cs/cs_happly.c -o vendor/cigraph/vendor/cs/cs_happly.o gcc -I"/usr/share/R/include" -DNDEBUG -DUSING_R -I. -Ivendor -Ivendor/cigraph/src -Ivendor/cigraph/include -Ivendor/cigraph/vendor -Ivendor/io/parsers -I/usr/include/libxml2 -DHAVE_LIBXML -DNDEBUG -DNTIMER -DNPRINT -DIGRAPH_THREAD_LOCAL= -DPRPACK_IGRAPH_SUPPORT -DHAVE_GFORTRAN=1 -D_GNU_SOURCE=1 -I'/home/omnipath/local/R/4.4-3.20/cpp11/include' -fvisibility=hidden -fpic -g -O2 -fno-omit-frame-pointer -mno-omit-leaf-frame-pointer -ffile-prefix-map=/build/r-base-EawLoD/r-base-4.4.1=. -fstack-protector-strong -fstack-clash-protection -Wformat -Werror=format-security -fcf-protection -fdebug-prefix-map=/build/r-base-EawLoD/r-base-4.4.1=/usr/src/r-base-4.4.1-1.2404.0 -Wdate-time -D_FORTIFY_SOURCE=3 -c vendor/cigraph/vendor/cs/cs_house.c -o vendor/cigraph/vendor/cs/cs_house.o gcc -I"/usr/share/R/include" -DNDEBUG -DUSING_R -I. -Ivendor -Ivendor/cigraph/src -Ivendor/cigraph/include -Ivendor/cigraph/vendor -Ivendor/io/parsers -I/usr/include/libxml2 -DHAVE_LIBXML -DNDEBUG -DNTIMER -DNPRINT -DIGRAPH_THREAD_LOCAL= -DPRPACK_IGRAPH_SUPPORT -DHAVE_GFORTRAN=1 -D_GNU_SOURCE=1 -I'/home/omnipath/local/R/4.4-3.20/cpp11/include' -fvisibility=hidden -fpic -g -O2 -fno-omit-frame-pointer -mno-omit-leaf-frame-pointer -ffile-prefix-map=/build/r-base-EawLoD/r-base-4.4.1=. -fstack-protector-strong -fstack-clash-protection -Wformat -Werror=format-security -fcf-protection -fdebug-prefix-map=/build/r-base-EawLoD/r-base-4.4.1=/usr/src/r-base-4.4.1-1.2404.0 -Wdate-time -D_FORTIFY_SOURCE=3 -c vendor/cigraph/vendor/cs/cs_ipvec.c -o vendor/cigraph/vendor/cs/cs_ipvec.o gcc -I"/usr/share/R/include" -DNDEBUG -DUSING_R -I. -Ivendor -Ivendor/cigraph/src -Ivendor/cigraph/include -Ivendor/cigraph/vendor -Ivendor/io/parsers -I/usr/include/libxml2 -DHAVE_LIBXML -DNDEBUG -DNTIMER -DNPRINT -DIGRAPH_THREAD_LOCAL= -DPRPACK_IGRAPH_SUPPORT -DHAVE_GFORTRAN=1 -D_GNU_SOURCE=1 -I'/home/omnipath/local/R/4.4-3.20/cpp11/include' -fvisibility=hidden -fpic -g -O2 -fno-omit-frame-pointer -mno-omit-leaf-frame-pointer -ffile-prefix-map=/build/r-base-EawLoD/r-base-4.4.1=. -fstack-protector-strong -fstack-clash-protection -Wformat -Werror=format-security -fcf-protection -fdebug-prefix-map=/build/r-base-EawLoD/r-base-4.4.1=/usr/src/r-base-4.4.1-1.2404.0 -Wdate-time -D_FORTIFY_SOURCE=3 -c vendor/cigraph/vendor/cs/cs_leaf.c -o vendor/cigraph/vendor/cs/cs_leaf.o gcc -I"/usr/share/R/include" -DNDEBUG -DUSING_R -I. -Ivendor -Ivendor/cigraph/src -Ivendor/cigraph/include -Ivendor/cigraph/vendor -Ivendor/io/parsers -I/usr/include/libxml2 -DHAVE_LIBXML -DNDEBUG -DNTIMER -DNPRINT -DIGRAPH_THREAD_LOCAL= -DPRPACK_IGRAPH_SUPPORT -DHAVE_GFORTRAN=1 -D_GNU_SOURCE=1 -I'/home/omnipath/local/R/4.4-3.20/cpp11/include' -fvisibility=hidden -fpic -g -O2 -fno-omit-frame-pointer -mno-omit-leaf-frame-pointer -ffile-prefix-map=/build/r-base-EawLoD/r-base-4.4.1=. -fstack-protector-strong -fstack-clash-protection -Wformat -Werror=format-security -fcf-protection -fdebug-prefix-map=/build/r-base-EawLoD/r-base-4.4.1=/usr/src/r-base-4.4.1-1.2404.0 -Wdate-time -D_FORTIFY_SOURCE=3 -c vendor/cigraph/vendor/cs/cs_load.c -o vendor/cigraph/vendor/cs/cs_load.o gcc -I"/usr/share/R/include" -DNDEBUG -DUSING_R -I. -Ivendor -Ivendor/cigraph/src -Ivendor/cigraph/include -Ivendor/cigraph/vendor -Ivendor/io/parsers -I/usr/include/libxml2 -DHAVE_LIBXML -DNDEBUG -DNTIMER -DNPRINT -DIGRAPH_THREAD_LOCAL= -DPRPACK_IGRAPH_SUPPORT -DHAVE_GFORTRAN=1 -D_GNU_SOURCE=1 -I'/home/omnipath/local/R/4.4-3.20/cpp11/include' -fvisibility=hidden -fpic -g -O2 -fno-omit-frame-pointer -mno-omit-leaf-frame-pointer -ffile-prefix-map=/build/r-base-EawLoD/r-base-4.4.1=. -fstack-protector-strong -fstack-clash-protection -Wformat -Werror=format-security -fcf-protection -fdebug-prefix-map=/build/r-base-EawLoD/r-base-4.4.1=/usr/src/r-base-4.4.1-1.2404.0 -Wdate-time -D_FORTIFY_SOURCE=3 -c vendor/cigraph/vendor/cs/cs_lsolve.c -o vendor/cigraph/vendor/cs/cs_lsolve.o gcc -I"/usr/share/R/include" -DNDEBUG -DUSING_R -I. -Ivendor -Ivendor/cigraph/src -Ivendor/cigraph/include -Ivendor/cigraph/vendor -Ivendor/io/parsers -I/usr/include/libxml2 -DHAVE_LIBXML -DNDEBUG -DNTIMER -DNPRINT -DIGRAPH_THREAD_LOCAL= -DPRPACK_IGRAPH_SUPPORT -DHAVE_GFORTRAN=1 -D_GNU_SOURCE=1 -I'/home/omnipath/local/R/4.4-3.20/cpp11/include' -fvisibility=hidden -fpic -g -O2 -fno-omit-frame-pointer -mno-omit-leaf-frame-pointer -ffile-prefix-map=/build/r-base-EawLoD/r-base-4.4.1=. -fstack-protector-strong -fstack-clash-protection -Wformat -Werror=format-security -fcf-protection -fdebug-prefix-map=/build/r-base-EawLoD/r-base-4.4.1=/usr/src/r-base-4.4.1-1.2404.0 -Wdate-time -D_FORTIFY_SOURCE=3 -c vendor/cigraph/vendor/cs/cs_ltsolve.c -o vendor/cigraph/vendor/cs/cs_ltsolve.o gcc -I"/usr/share/R/include" -DNDEBUG -DUSING_R -I. -Ivendor -Ivendor/cigraph/src -Ivendor/cigraph/include -Ivendor/cigraph/vendor -Ivendor/io/parsers -I/usr/include/libxml2 -DHAVE_LIBXML -DNDEBUG -DNTIMER -DNPRINT -DIGRAPH_THREAD_LOCAL= -DPRPACK_IGRAPH_SUPPORT -DHAVE_GFORTRAN=1 -D_GNU_SOURCE=1 -I'/home/omnipath/local/R/4.4-3.20/cpp11/include' -fvisibility=hidden -fpic -g -O2 -fno-omit-frame-pointer -mno-omit-leaf-frame-pointer -ffile-prefix-map=/build/r-base-EawLoD/r-base-4.4.1=. -fstack-protector-strong -fstack-clash-protection -Wformat -Werror=format-security -fcf-protection -fdebug-prefix-map=/build/r-base-EawLoD/r-base-4.4.1=/usr/src/r-base-4.4.1-1.2404.0 -Wdate-time -D_FORTIFY_SOURCE=3 -c vendor/cigraph/vendor/cs/cs_lu.c -o vendor/cigraph/vendor/cs/cs_lu.o gcc -I"/usr/share/R/include" -DNDEBUG -DUSING_R -I. -Ivendor -Ivendor/cigraph/src -Ivendor/cigraph/include -Ivendor/cigraph/vendor -Ivendor/io/parsers -I/usr/include/libxml2 -DHAVE_LIBXML -DNDEBUG -DNTIMER -DNPRINT -DIGRAPH_THREAD_LOCAL= -DPRPACK_IGRAPH_SUPPORT -DHAVE_GFORTRAN=1 -D_GNU_SOURCE=1 -I'/home/omnipath/local/R/4.4-3.20/cpp11/include' -fvisibility=hidden -fpic -g -O2 -fno-omit-frame-pointer -mno-omit-leaf-frame-pointer -ffile-prefix-map=/build/r-base-EawLoD/r-base-4.4.1=. -fstack-protector-strong -fstack-clash-protection -Wformat -Werror=format-security -fcf-protection -fdebug-prefix-map=/build/r-base-EawLoD/r-base-4.4.1=/usr/src/r-base-4.4.1-1.2404.0 -Wdate-time -D_FORTIFY_SOURCE=3 -c vendor/cigraph/vendor/cs/cs_lusol.c -o vendor/cigraph/vendor/cs/cs_lusol.o gcc -I"/usr/share/R/include" -DNDEBUG -DUSING_R -I. -Ivendor -Ivendor/cigraph/src -Ivendor/cigraph/include -Ivendor/cigraph/vendor -Ivendor/io/parsers -I/usr/include/libxml2 -DHAVE_LIBXML -DNDEBUG -DNTIMER -DNPRINT -DIGRAPH_THREAD_LOCAL= -DPRPACK_IGRAPH_SUPPORT -DHAVE_GFORTRAN=1 -D_GNU_SOURCE=1 -I'/home/omnipath/local/R/4.4-3.20/cpp11/include' -fvisibility=hidden -fpic -g -O2 -fno-omit-frame-pointer -mno-omit-leaf-frame-pointer -ffile-prefix-map=/build/r-base-EawLoD/r-base-4.4.1=. -fstack-protector-strong -fstack-clash-protection -Wformat -Werror=format-security -fcf-protection -fdebug-prefix-map=/build/r-base-EawLoD/r-base-4.4.1=/usr/src/r-base-4.4.1-1.2404.0 -Wdate-time -D_FORTIFY_SOURCE=3 -c vendor/cigraph/vendor/cs/cs_malloc.c -o vendor/cigraph/vendor/cs/cs_malloc.o gcc -I"/usr/share/R/include" -DNDEBUG -DUSING_R -I. -Ivendor -Ivendor/cigraph/src -Ivendor/cigraph/include -Ivendor/cigraph/vendor -Ivendor/io/parsers -I/usr/include/libxml2 -DHAVE_LIBXML -DNDEBUG -DNTIMER -DNPRINT -DIGRAPH_THREAD_LOCAL= -DPRPACK_IGRAPH_SUPPORT -DHAVE_GFORTRAN=1 -D_GNU_SOURCE=1 -I'/home/omnipath/local/R/4.4-3.20/cpp11/include' -fvisibility=hidden -fpic -g -O2 -fno-omit-frame-pointer -mno-omit-leaf-frame-pointer -ffile-prefix-map=/build/r-base-EawLoD/r-base-4.4.1=. -fstack-protector-strong -fstack-clash-protection -Wformat -Werror=format-security -fcf-protection -fdebug-prefix-map=/build/r-base-EawLoD/r-base-4.4.1=/usr/src/r-base-4.4.1-1.2404.0 -Wdate-time -D_FORTIFY_SOURCE=3 -c vendor/cigraph/vendor/cs/cs_maxtrans.c -o vendor/cigraph/vendor/cs/cs_maxtrans.o gcc -I"/usr/share/R/include" -DNDEBUG -DUSING_R -I. -Ivendor -Ivendor/cigraph/src -Ivendor/cigraph/include -Ivendor/cigraph/vendor -Ivendor/io/parsers -I/usr/include/libxml2 -DHAVE_LIBXML -DNDEBUG -DNTIMER -DNPRINT -DIGRAPH_THREAD_LOCAL= -DPRPACK_IGRAPH_SUPPORT -DHAVE_GFORTRAN=1 -D_GNU_SOURCE=1 -I'/home/omnipath/local/R/4.4-3.20/cpp11/include' -fvisibility=hidden -fpic -g -O2 -fno-omit-frame-pointer -mno-omit-leaf-frame-pointer -ffile-prefix-map=/build/r-base-EawLoD/r-base-4.4.1=. -fstack-protector-strong -fstack-clash-protection -Wformat -Werror=format-security -fcf-protection -fdebug-prefix-map=/build/r-base-EawLoD/r-base-4.4.1=/usr/src/r-base-4.4.1-1.2404.0 -Wdate-time -D_FORTIFY_SOURCE=3 -c vendor/cigraph/vendor/cs/cs_multiply.c -o vendor/cigraph/vendor/cs/cs_multiply.o gcc -I"/usr/share/R/include" -DNDEBUG -DUSING_R -I. -Ivendor -Ivendor/cigraph/src -Ivendor/cigraph/include -Ivendor/cigraph/vendor -Ivendor/io/parsers -I/usr/include/libxml2 -DHAVE_LIBXML -DNDEBUG -DNTIMER -DNPRINT -DIGRAPH_THREAD_LOCAL= -DPRPACK_IGRAPH_SUPPORT -DHAVE_GFORTRAN=1 -D_GNU_SOURCE=1 -I'/home/omnipath/local/R/4.4-3.20/cpp11/include' -fvisibility=hidden -fpic -g -O2 -fno-omit-frame-pointer -mno-omit-leaf-frame-pointer -ffile-prefix-map=/build/r-base-EawLoD/r-base-4.4.1=. -fstack-protector-strong -fstack-clash-protection -Wformat -Werror=format-security -fcf-protection -fdebug-prefix-map=/build/r-base-EawLoD/r-base-4.4.1=/usr/src/r-base-4.4.1-1.2404.0 -Wdate-time -D_FORTIFY_SOURCE=3 -c vendor/cigraph/vendor/cs/cs_norm.c -o vendor/cigraph/vendor/cs/cs_norm.o gcc -I"/usr/share/R/include" -DNDEBUG -DUSING_R -I. -Ivendor -Ivendor/cigraph/src -Ivendor/cigraph/include -Ivendor/cigraph/vendor -Ivendor/io/parsers -I/usr/include/libxml2 -DHAVE_LIBXML -DNDEBUG -DNTIMER -DNPRINT -DIGRAPH_THREAD_LOCAL= -DPRPACK_IGRAPH_SUPPORT -DHAVE_GFORTRAN=1 -D_GNU_SOURCE=1 -I'/home/omnipath/local/R/4.4-3.20/cpp11/include' -fvisibility=hidden -fpic -g -O2 -fno-omit-frame-pointer -mno-omit-leaf-frame-pointer -ffile-prefix-map=/build/r-base-EawLoD/r-base-4.4.1=. -fstack-protector-strong -fstack-clash-protection -Wformat -Werror=format-security -fcf-protection -fdebug-prefix-map=/build/r-base-EawLoD/r-base-4.4.1=/usr/src/r-base-4.4.1-1.2404.0 -Wdate-time -D_FORTIFY_SOURCE=3 -c vendor/cigraph/vendor/cs/cs_permute.c -o vendor/cigraph/vendor/cs/cs_permute.o gcc -I"/usr/share/R/include" -DNDEBUG -DUSING_R -I. -Ivendor -Ivendor/cigraph/src -Ivendor/cigraph/include -Ivendor/cigraph/vendor -Ivendor/io/parsers -I/usr/include/libxml2 -DHAVE_LIBXML -DNDEBUG -DNTIMER -DNPRINT -DIGRAPH_THREAD_LOCAL= -DPRPACK_IGRAPH_SUPPORT -DHAVE_GFORTRAN=1 -D_GNU_SOURCE=1 -I'/home/omnipath/local/R/4.4-3.20/cpp11/include' -fvisibility=hidden -fpic -g -O2 -fno-omit-frame-pointer -mno-omit-leaf-frame-pointer -ffile-prefix-map=/build/r-base-EawLoD/r-base-4.4.1=. -fstack-protector-strong -fstack-clash-protection -Wformat -Werror=format-security -fcf-protection -fdebug-prefix-map=/build/r-base-EawLoD/r-base-4.4.1=/usr/src/r-base-4.4.1-1.2404.0 -Wdate-time -D_FORTIFY_SOURCE=3 -c vendor/cigraph/vendor/cs/cs_pinv.c -o vendor/cigraph/vendor/cs/cs_pinv.o gcc -I"/usr/share/R/include" -DNDEBUG -DUSING_R -I. -Ivendor -Ivendor/cigraph/src -Ivendor/cigraph/include -Ivendor/cigraph/vendor -Ivendor/io/parsers -I/usr/include/libxml2 -DHAVE_LIBXML -DNDEBUG -DNTIMER -DNPRINT -DIGRAPH_THREAD_LOCAL= -DPRPACK_IGRAPH_SUPPORT -DHAVE_GFORTRAN=1 -D_GNU_SOURCE=1 -I'/home/omnipath/local/R/4.4-3.20/cpp11/include' -fvisibility=hidden -fpic -g -O2 -fno-omit-frame-pointer -mno-omit-leaf-frame-pointer -ffile-prefix-map=/build/r-base-EawLoD/r-base-4.4.1=. -fstack-protector-strong -fstack-clash-protection -Wformat -Werror=format-security -fcf-protection -fdebug-prefix-map=/build/r-base-EawLoD/r-base-4.4.1=/usr/src/r-base-4.4.1-1.2404.0 -Wdate-time -D_FORTIFY_SOURCE=3 -c vendor/cigraph/vendor/cs/cs_post.c -o vendor/cigraph/vendor/cs/cs_post.o gcc -I"/usr/share/R/include" -DNDEBUG -DUSING_R -I. -Ivendor -Ivendor/cigraph/src -Ivendor/cigraph/include -Ivendor/cigraph/vendor -Ivendor/io/parsers -I/usr/include/libxml2 -DHAVE_LIBXML -DNDEBUG -DNTIMER -DNPRINT -DIGRAPH_THREAD_LOCAL= -DPRPACK_IGRAPH_SUPPORT -DHAVE_GFORTRAN=1 -D_GNU_SOURCE=1 -I'/home/omnipath/local/R/4.4-3.20/cpp11/include' -fvisibility=hidden -fpic -g -O2 -fno-omit-frame-pointer -mno-omit-leaf-frame-pointer -ffile-prefix-map=/build/r-base-EawLoD/r-base-4.4.1=. -fstack-protector-strong -fstack-clash-protection -Wformat -Werror=format-security -fcf-protection -fdebug-prefix-map=/build/r-base-EawLoD/r-base-4.4.1=/usr/src/r-base-4.4.1-1.2404.0 -Wdate-time -D_FORTIFY_SOURCE=3 -c vendor/cigraph/vendor/cs/cs_print.c -o vendor/cigraph/vendor/cs/cs_print.o gcc -I"/usr/share/R/include" -DNDEBUG -DUSING_R -I. -Ivendor -Ivendor/cigraph/src -Ivendor/cigraph/include -Ivendor/cigraph/vendor -Ivendor/io/parsers -I/usr/include/libxml2 -DHAVE_LIBXML -DNDEBUG -DNTIMER -DNPRINT -DIGRAPH_THREAD_LOCAL= -DPRPACK_IGRAPH_SUPPORT -DHAVE_GFORTRAN=1 -D_GNU_SOURCE=1 -I'/home/omnipath/local/R/4.4-3.20/cpp11/include' -fvisibility=hidden -fpic -g -O2 -fno-omit-frame-pointer -mno-omit-leaf-frame-pointer -ffile-prefix-map=/build/r-base-EawLoD/r-base-4.4.1=. -fstack-protector-strong -fstack-clash-protection -Wformat -Werror=format-security -fcf-protection -fdebug-prefix-map=/build/r-base-EawLoD/r-base-4.4.1=/usr/src/r-base-4.4.1-1.2404.0 -Wdate-time -D_FORTIFY_SOURCE=3 -c vendor/cigraph/vendor/cs/cs_pvec.c -o vendor/cigraph/vendor/cs/cs_pvec.o gcc -I"/usr/share/R/include" -DNDEBUG -DUSING_R -I. -Ivendor -Ivendor/cigraph/src -Ivendor/cigraph/include -Ivendor/cigraph/vendor -Ivendor/io/parsers -I/usr/include/libxml2 -DHAVE_LIBXML -DNDEBUG -DNTIMER -DNPRINT -DIGRAPH_THREAD_LOCAL= -DPRPACK_IGRAPH_SUPPORT -DHAVE_GFORTRAN=1 -D_GNU_SOURCE=1 -I'/home/omnipath/local/R/4.4-3.20/cpp11/include' -fvisibility=hidden -fpic -g -O2 -fno-omit-frame-pointer -mno-omit-leaf-frame-pointer -ffile-prefix-map=/build/r-base-EawLoD/r-base-4.4.1=. -fstack-protector-strong -fstack-clash-protection -Wformat -Werror=format-security -fcf-protection -fdebug-prefix-map=/build/r-base-EawLoD/r-base-4.4.1=/usr/src/r-base-4.4.1-1.2404.0 -Wdate-time -D_FORTIFY_SOURCE=3 -c vendor/cigraph/vendor/cs/cs_qr.c -o vendor/cigraph/vendor/cs/cs_qr.o gcc -I"/usr/share/R/include" -DNDEBUG -DUSING_R -I. -Ivendor -Ivendor/cigraph/src -Ivendor/cigraph/include -Ivendor/cigraph/vendor -Ivendor/io/parsers -I/usr/include/libxml2 -DHAVE_LIBXML -DNDEBUG -DNTIMER -DNPRINT -DIGRAPH_THREAD_LOCAL= -DPRPACK_IGRAPH_SUPPORT -DHAVE_GFORTRAN=1 -D_GNU_SOURCE=1 -I'/home/omnipath/local/R/4.4-3.20/cpp11/include' -fvisibility=hidden -fpic -g -O2 -fno-omit-frame-pointer -mno-omit-leaf-frame-pointer -ffile-prefix-map=/build/r-base-EawLoD/r-base-4.4.1=. -fstack-protector-strong -fstack-clash-protection -Wformat -Werror=format-security -fcf-protection -fdebug-prefix-map=/build/r-base-EawLoD/r-base-4.4.1=/usr/src/r-base-4.4.1-1.2404.0 -Wdate-time -D_FORTIFY_SOURCE=3 -c vendor/cigraph/vendor/cs/cs_qrsol.c -o vendor/cigraph/vendor/cs/cs_qrsol.o gcc -I"/usr/share/R/include" -DNDEBUG -DUSING_R -I. -Ivendor -Ivendor/cigraph/src -Ivendor/cigraph/include -Ivendor/cigraph/vendor -Ivendor/io/parsers -I/usr/include/libxml2 -DHAVE_LIBXML -DNDEBUG -DNTIMER -DNPRINT -DIGRAPH_THREAD_LOCAL= -DPRPACK_IGRAPH_SUPPORT -DHAVE_GFORTRAN=1 -D_GNU_SOURCE=1 -I'/home/omnipath/local/R/4.4-3.20/cpp11/include' -fvisibility=hidden -fpic -g -O2 -fno-omit-frame-pointer -mno-omit-leaf-frame-pointer -ffile-prefix-map=/build/r-base-EawLoD/r-base-4.4.1=. -fstack-protector-strong -fstack-clash-protection -Wformat -Werror=format-security -fcf-protection -fdebug-prefix-map=/build/r-base-EawLoD/r-base-4.4.1=/usr/src/r-base-4.4.1-1.2404.0 -Wdate-time -D_FORTIFY_SOURCE=3 -c vendor/cigraph/vendor/cs/cs_randperm.c -o vendor/cigraph/vendor/cs/cs_randperm.o gcc -I"/usr/share/R/include" -DNDEBUG -DUSING_R -I. -Ivendor -Ivendor/cigraph/src -Ivendor/cigraph/include -Ivendor/cigraph/vendor -Ivendor/io/parsers -I/usr/include/libxml2 -DHAVE_LIBXML -DNDEBUG -DNTIMER -DNPRINT -DIGRAPH_THREAD_LOCAL= -DPRPACK_IGRAPH_SUPPORT -DHAVE_GFORTRAN=1 -D_GNU_SOURCE=1 -I'/home/omnipath/local/R/4.4-3.20/cpp11/include' -fvisibility=hidden -fpic -g -O2 -fno-omit-frame-pointer -mno-omit-leaf-frame-pointer -ffile-prefix-map=/build/r-base-EawLoD/r-base-4.4.1=. -fstack-protector-strong -fstack-clash-protection -Wformat -Werror=format-security -fcf-protection -fdebug-prefix-map=/build/r-base-EawLoD/r-base-4.4.1=/usr/src/r-base-4.4.1-1.2404.0 -Wdate-time -D_FORTIFY_SOURCE=3 -c vendor/cigraph/vendor/cs/cs_reach.c -o vendor/cigraph/vendor/cs/cs_reach.o gcc -I"/usr/share/R/include" -DNDEBUG -DUSING_R -I. -Ivendor -Ivendor/cigraph/src -Ivendor/cigraph/include -Ivendor/cigraph/vendor -Ivendor/io/parsers -I/usr/include/libxml2 -DHAVE_LIBXML -DNDEBUG -DNTIMER -DNPRINT -DIGRAPH_THREAD_LOCAL= -DPRPACK_IGRAPH_SUPPORT -DHAVE_GFORTRAN=1 -D_GNU_SOURCE=1 -I'/home/omnipath/local/R/4.4-3.20/cpp11/include' -fvisibility=hidden -fpic -g -O2 -fno-omit-frame-pointer -mno-omit-leaf-frame-pointer -ffile-prefix-map=/build/r-base-EawLoD/r-base-4.4.1=. -fstack-protector-strong -fstack-clash-protection -Wformat -Werror=format-security -fcf-protection -fdebug-prefix-map=/build/r-base-EawLoD/r-base-4.4.1=/usr/src/r-base-4.4.1-1.2404.0 -Wdate-time -D_FORTIFY_SOURCE=3 -c vendor/cigraph/vendor/cs/cs_scatter.c -o vendor/cigraph/vendor/cs/cs_scatter.o gcc -I"/usr/share/R/include" -DNDEBUG -DUSING_R -I. -Ivendor -Ivendor/cigraph/src -Ivendor/cigraph/include -Ivendor/cigraph/vendor -Ivendor/io/parsers -I/usr/include/libxml2 -DHAVE_LIBXML -DNDEBUG -DNTIMER -DNPRINT -DIGRAPH_THREAD_LOCAL= -DPRPACK_IGRAPH_SUPPORT -DHAVE_GFORTRAN=1 -D_GNU_SOURCE=1 -I'/home/omnipath/local/R/4.4-3.20/cpp11/include' -fvisibility=hidden -fpic -g -O2 -fno-omit-frame-pointer -mno-omit-leaf-frame-pointer -ffile-prefix-map=/build/r-base-EawLoD/r-base-4.4.1=. -fstack-protector-strong -fstack-clash-protection -Wformat -Werror=format-security -fcf-protection -fdebug-prefix-map=/build/r-base-EawLoD/r-base-4.4.1=/usr/src/r-base-4.4.1-1.2404.0 -Wdate-time -D_FORTIFY_SOURCE=3 -c vendor/cigraph/vendor/cs/cs_scc.c -o vendor/cigraph/vendor/cs/cs_scc.o gcc -I"/usr/share/R/include" -DNDEBUG -DUSING_R -I. -Ivendor -Ivendor/cigraph/src -Ivendor/cigraph/include -Ivendor/cigraph/vendor -Ivendor/io/parsers -I/usr/include/libxml2 -DHAVE_LIBXML -DNDEBUG -DNTIMER -DNPRINT -DIGRAPH_THREAD_LOCAL= -DPRPACK_IGRAPH_SUPPORT -DHAVE_GFORTRAN=1 -D_GNU_SOURCE=1 -I'/home/omnipath/local/R/4.4-3.20/cpp11/include' -fvisibility=hidden -fpic -g -O2 -fno-omit-frame-pointer -mno-omit-leaf-frame-pointer -ffile-prefix-map=/build/r-base-EawLoD/r-base-4.4.1=. -fstack-protector-strong -fstack-clash-protection -Wformat -Werror=format-security -fcf-protection -fdebug-prefix-map=/build/r-base-EawLoD/r-base-4.4.1=/usr/src/r-base-4.4.1-1.2404.0 -Wdate-time -D_FORTIFY_SOURCE=3 -c vendor/cigraph/vendor/cs/cs_schol.c -o vendor/cigraph/vendor/cs/cs_schol.o gcc -I"/usr/share/R/include" -DNDEBUG -DUSING_R -I. -Ivendor -Ivendor/cigraph/src -Ivendor/cigraph/include -Ivendor/cigraph/vendor -Ivendor/io/parsers -I/usr/include/libxml2 -DHAVE_LIBXML -DNDEBUG -DNTIMER -DNPRINT -DIGRAPH_THREAD_LOCAL= -DPRPACK_IGRAPH_SUPPORT -DHAVE_GFORTRAN=1 -D_GNU_SOURCE=1 -I'/home/omnipath/local/R/4.4-3.20/cpp11/include' -fvisibility=hidden -fpic -g -O2 -fno-omit-frame-pointer -mno-omit-leaf-frame-pointer -ffile-prefix-map=/build/r-base-EawLoD/r-base-4.4.1=. -fstack-protector-strong -fstack-clash-protection -Wformat -Werror=format-security -fcf-protection -fdebug-prefix-map=/build/r-base-EawLoD/r-base-4.4.1=/usr/src/r-base-4.4.1-1.2404.0 -Wdate-time -D_FORTIFY_SOURCE=3 -c vendor/cigraph/vendor/cs/cs_spsolve.c -o vendor/cigraph/vendor/cs/cs_spsolve.o gcc -I"/usr/share/R/include" -DNDEBUG -DUSING_R -I. -Ivendor -Ivendor/cigraph/src -Ivendor/cigraph/include -Ivendor/cigraph/vendor -Ivendor/io/parsers -I/usr/include/libxml2 -DHAVE_LIBXML -DNDEBUG -DNTIMER -DNPRINT -DIGRAPH_THREAD_LOCAL= -DPRPACK_IGRAPH_SUPPORT -DHAVE_GFORTRAN=1 -D_GNU_SOURCE=1 -I'/home/omnipath/local/R/4.4-3.20/cpp11/include' -fvisibility=hidden -fpic -g -O2 -fno-omit-frame-pointer -mno-omit-leaf-frame-pointer -ffile-prefix-map=/build/r-base-EawLoD/r-base-4.4.1=. -fstack-protector-strong -fstack-clash-protection -Wformat -Werror=format-security -fcf-protection -fdebug-prefix-map=/build/r-base-EawLoD/r-base-4.4.1=/usr/src/r-base-4.4.1-1.2404.0 -Wdate-time -D_FORTIFY_SOURCE=3 -c vendor/cigraph/vendor/cs/cs_sqr.c -o vendor/cigraph/vendor/cs/cs_sqr.o gcc -I"/usr/share/R/include" -DNDEBUG -DUSING_R -I. -Ivendor -Ivendor/cigraph/src -Ivendor/cigraph/include -Ivendor/cigraph/vendor -Ivendor/io/parsers -I/usr/include/libxml2 -DHAVE_LIBXML -DNDEBUG -DNTIMER -DNPRINT -DIGRAPH_THREAD_LOCAL= -DPRPACK_IGRAPH_SUPPORT -DHAVE_GFORTRAN=1 -D_GNU_SOURCE=1 -I'/home/omnipath/local/R/4.4-3.20/cpp11/include' -fvisibility=hidden -fpic -g -O2 -fno-omit-frame-pointer -mno-omit-leaf-frame-pointer -ffile-prefix-map=/build/r-base-EawLoD/r-base-4.4.1=. -fstack-protector-strong -fstack-clash-protection -Wformat -Werror=format-security -fcf-protection -fdebug-prefix-map=/build/r-base-EawLoD/r-base-4.4.1=/usr/src/r-base-4.4.1-1.2404.0 -Wdate-time -D_FORTIFY_SOURCE=3 -c vendor/cigraph/vendor/cs/cs_symperm.c -o vendor/cigraph/vendor/cs/cs_symperm.o gcc -I"/usr/share/R/include" -DNDEBUG -DUSING_R -I. -Ivendor -Ivendor/cigraph/src -Ivendor/cigraph/include -Ivendor/cigraph/vendor -Ivendor/io/parsers -I/usr/include/libxml2 -DHAVE_LIBXML -DNDEBUG -DNTIMER -DNPRINT -DIGRAPH_THREAD_LOCAL= -DPRPACK_IGRAPH_SUPPORT -DHAVE_GFORTRAN=1 -D_GNU_SOURCE=1 -I'/home/omnipath/local/R/4.4-3.20/cpp11/include' -fvisibility=hidden -fpic -g -O2 -fno-omit-frame-pointer -mno-omit-leaf-frame-pointer -ffile-prefix-map=/build/r-base-EawLoD/r-base-4.4.1=. -fstack-protector-strong -fstack-clash-protection -Wformat -Werror=format-security -fcf-protection -fdebug-prefix-map=/build/r-base-EawLoD/r-base-4.4.1=/usr/src/r-base-4.4.1-1.2404.0 -Wdate-time -D_FORTIFY_SOURCE=3 -c vendor/cigraph/vendor/cs/cs_tdfs.c -o vendor/cigraph/vendor/cs/cs_tdfs.o gcc -I"/usr/share/R/include" -DNDEBUG -DUSING_R -I. -Ivendor -Ivendor/cigraph/src -Ivendor/cigraph/include -Ivendor/cigraph/vendor -Ivendor/io/parsers -I/usr/include/libxml2 -DHAVE_LIBXML -DNDEBUG -DNTIMER -DNPRINT -DIGRAPH_THREAD_LOCAL= -DPRPACK_IGRAPH_SUPPORT -DHAVE_GFORTRAN=1 -D_GNU_SOURCE=1 -I'/home/omnipath/local/R/4.4-3.20/cpp11/include' -fvisibility=hidden -fpic -g -O2 -fno-omit-frame-pointer -mno-omit-leaf-frame-pointer -ffile-prefix-map=/build/r-base-EawLoD/r-base-4.4.1=. -fstack-protector-strong -fstack-clash-protection -Wformat -Werror=format-security -fcf-protection -fdebug-prefix-map=/build/r-base-EawLoD/r-base-4.4.1=/usr/src/r-base-4.4.1-1.2404.0 -Wdate-time -D_FORTIFY_SOURCE=3 -c vendor/cigraph/vendor/cs/cs_transpose.c -o vendor/cigraph/vendor/cs/cs_transpose.o gcc -I"/usr/share/R/include" -DNDEBUG -DUSING_R -I. -Ivendor -Ivendor/cigraph/src -Ivendor/cigraph/include -Ivendor/cigraph/vendor -Ivendor/io/parsers -I/usr/include/libxml2 -DHAVE_LIBXML -DNDEBUG -DNTIMER -DNPRINT -DIGRAPH_THREAD_LOCAL= -DPRPACK_IGRAPH_SUPPORT -DHAVE_GFORTRAN=1 -D_GNU_SOURCE=1 -I'/home/omnipath/local/R/4.4-3.20/cpp11/include' -fvisibility=hidden -fpic -g -O2 -fno-omit-frame-pointer -mno-omit-leaf-frame-pointer -ffile-prefix-map=/build/r-base-EawLoD/r-base-4.4.1=. -fstack-protector-strong -fstack-clash-protection -Wformat -Werror=format-security -fcf-protection -fdebug-prefix-map=/build/r-base-EawLoD/r-base-4.4.1=/usr/src/r-base-4.4.1-1.2404.0 -Wdate-time -D_FORTIFY_SOURCE=3 -c vendor/cigraph/vendor/cs/cs_updown.c -o vendor/cigraph/vendor/cs/cs_updown.o gcc -I"/usr/share/R/include" -DNDEBUG -DUSING_R -I. -Ivendor -Ivendor/cigraph/src -Ivendor/cigraph/include -Ivendor/cigraph/vendor -Ivendor/io/parsers -I/usr/include/libxml2 -DHAVE_LIBXML -DNDEBUG -DNTIMER -DNPRINT -DIGRAPH_THREAD_LOCAL= -DPRPACK_IGRAPH_SUPPORT -DHAVE_GFORTRAN=1 -D_GNU_SOURCE=1 -I'/home/omnipath/local/R/4.4-3.20/cpp11/include' -fvisibility=hidden -fpic -g -O2 -fno-omit-frame-pointer -mno-omit-leaf-frame-pointer -ffile-prefix-map=/build/r-base-EawLoD/r-base-4.4.1=. -fstack-protector-strong -fstack-clash-protection -Wformat -Werror=format-security -fcf-protection -fdebug-prefix-map=/build/r-base-EawLoD/r-base-4.4.1=/usr/src/r-base-4.4.1-1.2404.0 -Wdate-time -D_FORTIFY_SOURCE=3 -c vendor/cigraph/vendor/cs/cs_usolve.c -o vendor/cigraph/vendor/cs/cs_usolve.o gcc -I"/usr/share/R/include" -DNDEBUG -DUSING_R -I. -Ivendor -Ivendor/cigraph/src -Ivendor/cigraph/include -Ivendor/cigraph/vendor -Ivendor/io/parsers -I/usr/include/libxml2 -DHAVE_LIBXML -DNDEBUG -DNTIMER -DNPRINT -DIGRAPH_THREAD_LOCAL= -DPRPACK_IGRAPH_SUPPORT -DHAVE_GFORTRAN=1 -D_GNU_SOURCE=1 -I'/home/omnipath/local/R/4.4-3.20/cpp11/include' -fvisibility=hidden -fpic -g -O2 -fno-omit-frame-pointer -mno-omit-leaf-frame-pointer -ffile-prefix-map=/build/r-base-EawLoD/r-base-4.4.1=. -fstack-protector-strong -fstack-clash-protection -Wformat -Werror=format-security -fcf-protection -fdebug-prefix-map=/build/r-base-EawLoD/r-base-4.4.1=/usr/src/r-base-4.4.1-1.2404.0 -Wdate-time -D_FORTIFY_SOURCE=3 -c vendor/cigraph/vendor/cs/cs_util.c -o vendor/cigraph/vendor/cs/cs_util.o gcc -I"/usr/share/R/include" -DNDEBUG -DUSING_R -I. -Ivendor -Ivendor/cigraph/src -Ivendor/cigraph/include -Ivendor/cigraph/vendor -Ivendor/io/parsers -I/usr/include/libxml2 -DHAVE_LIBXML -DNDEBUG -DNTIMER -DNPRINT -DIGRAPH_THREAD_LOCAL= -DPRPACK_IGRAPH_SUPPORT -DHAVE_GFORTRAN=1 -D_GNU_SOURCE=1 -I'/home/omnipath/local/R/4.4-3.20/cpp11/include' -fvisibility=hidden -fpic -g -O2 -fno-omit-frame-pointer -mno-omit-leaf-frame-pointer -ffile-prefix-map=/build/r-base-EawLoD/r-base-4.4.1=. -fstack-protector-strong -fstack-clash-protection -Wformat -Werror=format-security -fcf-protection -fdebug-prefix-map=/build/r-base-EawLoD/r-base-4.4.1=/usr/src/r-base-4.4.1-1.2404.0 -Wdate-time -D_FORTIFY_SOURCE=3 -c vendor/cigraph/vendor/cs/cs_utsolve.c -o vendor/cigraph/vendor/cs/cs_utsolve.o gcc -I"/usr/share/R/include" -DNDEBUG -DUSING_R -I. -Ivendor -Ivendor/cigraph/src -Ivendor/cigraph/include -Ivendor/cigraph/vendor -Ivendor/io/parsers -I/usr/include/libxml2 -DHAVE_LIBXML -DNDEBUG -DNTIMER -DNPRINT -DIGRAPH_THREAD_LOCAL= -DPRPACK_IGRAPH_SUPPORT -DHAVE_GFORTRAN=1 -D_GNU_SOURCE=1 -I'/home/omnipath/local/R/4.4-3.20/cpp11/include' -fvisibility=hidden -fpic -g -O2 -fno-omit-frame-pointer -mno-omit-leaf-frame-pointer -ffile-prefix-map=/build/r-base-EawLoD/r-base-4.4.1=. -fstack-protector-strong -fstack-clash-protection -Wformat -Werror=format-security -fcf-protection -fdebug-prefix-map=/build/r-base-EawLoD/r-base-4.4.1=/usr/src/r-base-4.4.1-1.2404.0 -Wdate-time -D_FORTIFY_SOURCE=3 -c vendor/cigraph/vendor/pcg/pcg-advance-128.c -o vendor/cigraph/vendor/pcg/pcg-advance-128.o gcc -I"/usr/share/R/include" -DNDEBUG -DUSING_R -I. -Ivendor -Ivendor/cigraph/src -Ivendor/cigraph/include -Ivendor/cigraph/vendor -Ivendor/io/parsers -I/usr/include/libxml2 -DHAVE_LIBXML -DNDEBUG -DNTIMER -DNPRINT -DIGRAPH_THREAD_LOCAL= -DPRPACK_IGRAPH_SUPPORT -DHAVE_GFORTRAN=1 -D_GNU_SOURCE=1 -I'/home/omnipath/local/R/4.4-3.20/cpp11/include' -fvisibility=hidden -fpic -g -O2 -fno-omit-frame-pointer -mno-omit-leaf-frame-pointer -ffile-prefix-map=/build/r-base-EawLoD/r-base-4.4.1=. -fstack-protector-strong -fstack-clash-protection -Wformat -Werror=format-security -fcf-protection -fdebug-prefix-map=/build/r-base-EawLoD/r-base-4.4.1=/usr/src/r-base-4.4.1-1.2404.0 -Wdate-time -D_FORTIFY_SOURCE=3 -c vendor/cigraph/vendor/pcg/pcg-advance-64.c -o vendor/cigraph/vendor/pcg/pcg-advance-64.o gcc -I"/usr/share/R/include" -DNDEBUG -DUSING_R -I. -Ivendor -Ivendor/cigraph/src -Ivendor/cigraph/include -Ivendor/cigraph/vendor -Ivendor/io/parsers -I/usr/include/libxml2 -DHAVE_LIBXML -DNDEBUG -DNTIMER -DNPRINT -DIGRAPH_THREAD_LOCAL= -DPRPACK_IGRAPH_SUPPORT -DHAVE_GFORTRAN=1 -D_GNU_SOURCE=1 -I'/home/omnipath/local/R/4.4-3.20/cpp11/include' -fvisibility=hidden -fpic -g -O2 -fno-omit-frame-pointer -mno-omit-leaf-frame-pointer -ffile-prefix-map=/build/r-base-EawLoD/r-base-4.4.1=. -fstack-protector-strong -fstack-clash-protection -Wformat -Werror=format-security -fcf-protection -fdebug-prefix-map=/build/r-base-EawLoD/r-base-4.4.1=/usr/src/r-base-4.4.1-1.2404.0 -Wdate-time -D_FORTIFY_SOURCE=3 -c vendor/cigraph/vendor/pcg/pcg-output-128.c -o vendor/cigraph/vendor/pcg/pcg-output-128.o gcc -I"/usr/share/R/include" -DNDEBUG -DUSING_R -I. -Ivendor -Ivendor/cigraph/src -Ivendor/cigraph/include -Ivendor/cigraph/vendor -Ivendor/io/parsers -I/usr/include/libxml2 -DHAVE_LIBXML -DNDEBUG -DNTIMER -DNPRINT -DIGRAPH_THREAD_LOCAL= -DPRPACK_IGRAPH_SUPPORT -DHAVE_GFORTRAN=1 -D_GNU_SOURCE=1 -I'/home/omnipath/local/R/4.4-3.20/cpp11/include' -fvisibility=hidden -fpic -g -O2 -fno-omit-frame-pointer -mno-omit-leaf-frame-pointer -ffile-prefix-map=/build/r-base-EawLoD/r-base-4.4.1=. -fstack-protector-strong -fstack-clash-protection -Wformat -Werror=format-security -fcf-protection -fdebug-prefix-map=/build/r-base-EawLoD/r-base-4.4.1=/usr/src/r-base-4.4.1-1.2404.0 -Wdate-time -D_FORTIFY_SOURCE=3 -c vendor/cigraph/vendor/pcg/pcg-output-32.c -o vendor/cigraph/vendor/pcg/pcg-output-32.o gcc -I"/usr/share/R/include" -DNDEBUG -DUSING_R -I. -Ivendor -Ivendor/cigraph/src -Ivendor/cigraph/include -Ivendor/cigraph/vendor -Ivendor/io/parsers -I/usr/include/libxml2 -DHAVE_LIBXML -DNDEBUG -DNTIMER -DNPRINT -DIGRAPH_THREAD_LOCAL= -DPRPACK_IGRAPH_SUPPORT -DHAVE_GFORTRAN=1 -D_GNU_SOURCE=1 -I'/home/omnipath/local/R/4.4-3.20/cpp11/include' -fvisibility=hidden -fpic -g -O2 -fno-omit-frame-pointer -mno-omit-leaf-frame-pointer -ffile-prefix-map=/build/r-base-EawLoD/r-base-4.4.1=. -fstack-protector-strong -fstack-clash-protection -Wformat -Werror=format-security -fcf-protection -fdebug-prefix-map=/build/r-base-EawLoD/r-base-4.4.1=/usr/src/r-base-4.4.1-1.2404.0 -Wdate-time -D_FORTIFY_SOURCE=3 -c vendor/cigraph/vendor/pcg/pcg-output-64.c -o vendor/cigraph/vendor/pcg/pcg-output-64.o gcc -I"/usr/share/R/include" -DNDEBUG -DUSING_R -I. -Ivendor -Ivendor/cigraph/src -Ivendor/cigraph/include -Ivendor/cigraph/vendor -Ivendor/io/parsers -I/usr/include/libxml2 -DHAVE_LIBXML -DNDEBUG -DNTIMER -DNPRINT -DIGRAPH_THREAD_LOCAL= -DPRPACK_IGRAPH_SUPPORT -DHAVE_GFORTRAN=1 -D_GNU_SOURCE=1 -I'/home/omnipath/local/R/4.4-3.20/cpp11/include' -fvisibility=hidden -fpic -g -O2 -fno-omit-frame-pointer -mno-omit-leaf-frame-pointer -ffile-prefix-map=/build/r-base-EawLoD/r-base-4.4.1=. -fstack-protector-strong -fstack-clash-protection -Wformat -Werror=format-security -fcf-protection -fdebug-prefix-map=/build/r-base-EawLoD/r-base-4.4.1=/usr/src/r-base-4.4.1-1.2404.0 -Wdate-time -D_FORTIFY_SOURCE=3 -c vendor/cigraph/vendor/pcg/pcg-rngs-128.c -o vendor/cigraph/vendor/pcg/pcg-rngs-128.o gcc -I"/usr/share/R/include" -DNDEBUG -DUSING_R -I. -Ivendor -Ivendor/cigraph/src -Ivendor/cigraph/include -Ivendor/cigraph/vendor -Ivendor/io/parsers -I/usr/include/libxml2 -DHAVE_LIBXML -DNDEBUG -DNTIMER -DNPRINT -DIGRAPH_THREAD_LOCAL= -DPRPACK_IGRAPH_SUPPORT -DHAVE_GFORTRAN=1 -D_GNU_SOURCE=1 -I'/home/omnipath/local/R/4.4-3.20/cpp11/include' -fvisibility=hidden -fpic -g -O2 -fno-omit-frame-pointer -mno-omit-leaf-frame-pointer -ffile-prefix-map=/build/r-base-EawLoD/r-base-4.4.1=. -fstack-protector-strong -fstack-clash-protection -Wformat -Werror=format-security -fcf-protection -fdebug-prefix-map=/build/r-base-EawLoD/r-base-4.4.1=/usr/src/r-base-4.4.1-1.2404.0 -Wdate-time -D_FORTIFY_SOURCE=3 -c vendor/cigraph/vendor/pcg/pcg-rngs-64.c -o vendor/cigraph/vendor/pcg/pcg-rngs-64.o gcc -I"/usr/share/R/include" -DNDEBUG -DUSING_R -I. -Ivendor -Ivendor/cigraph/src -Ivendor/cigraph/include -Ivendor/cigraph/vendor -Ivendor/io/parsers -I/usr/include/libxml2 -DHAVE_LIBXML -DNDEBUG -DNTIMER -DNPRINT -DIGRAPH_THREAD_LOCAL= -DPRPACK_IGRAPH_SUPPORT -DHAVE_GFORTRAN=1 -D_GNU_SOURCE=1 -I'/home/omnipath/local/R/4.4-3.20/cpp11/include' -fvisibility=hidden -fpic -g -O2 -fno-omit-frame-pointer -mno-omit-leaf-frame-pointer -ffile-prefix-map=/build/r-base-EawLoD/r-base-4.4.1=. -fstack-protector-strong -fstack-clash-protection -Wformat -Werror=format-security -fcf-protection -fdebug-prefix-map=/build/r-base-EawLoD/r-base-4.4.1=/usr/src/r-base-4.4.1-1.2404.0 -Wdate-time -D_FORTIFY_SOURCE=3 -c vendor/cigraph/vendor/plfit/gss.c -o vendor/cigraph/vendor/plfit/gss.o gcc -I"/usr/share/R/include" -DNDEBUG -DUSING_R -I. -Ivendor -Ivendor/cigraph/src -Ivendor/cigraph/include -Ivendor/cigraph/vendor -Ivendor/io/parsers -I/usr/include/libxml2 -DHAVE_LIBXML -DNDEBUG -DNTIMER -DNPRINT -DIGRAPH_THREAD_LOCAL= -DPRPACK_IGRAPH_SUPPORT -DHAVE_GFORTRAN=1 -D_GNU_SOURCE=1 -I'/home/omnipath/local/R/4.4-3.20/cpp11/include' -fvisibility=hidden -fpic -g -O2 -fno-omit-frame-pointer -mno-omit-leaf-frame-pointer -ffile-prefix-map=/build/r-base-EawLoD/r-base-4.4.1=. -fstack-protector-strong -fstack-clash-protection -Wformat -Werror=format-security -fcf-protection -fdebug-prefix-map=/build/r-base-EawLoD/r-base-4.4.1=/usr/src/r-base-4.4.1-1.2404.0 -Wdate-time -D_FORTIFY_SOURCE=3 -c vendor/cigraph/vendor/plfit/hzeta.c -o vendor/cigraph/vendor/plfit/hzeta.o gcc -I"/usr/share/R/include" -DNDEBUG -DUSING_R -I. -Ivendor -Ivendor/cigraph/src -Ivendor/cigraph/include -Ivendor/cigraph/vendor -Ivendor/io/parsers -I/usr/include/libxml2 -DHAVE_LIBXML -DNDEBUG -DNTIMER -DNPRINT -DIGRAPH_THREAD_LOCAL= -DPRPACK_IGRAPH_SUPPORT -DHAVE_GFORTRAN=1 -D_GNU_SOURCE=1 -I'/home/omnipath/local/R/4.4-3.20/cpp11/include' -fvisibility=hidden -fpic -g -O2 -fno-omit-frame-pointer -mno-omit-leaf-frame-pointer -ffile-prefix-map=/build/r-base-EawLoD/r-base-4.4.1=. -fstack-protector-strong -fstack-clash-protection -Wformat -Werror=format-security -fcf-protection -fdebug-prefix-map=/build/r-base-EawLoD/r-base-4.4.1=/usr/src/r-base-4.4.1-1.2404.0 -Wdate-time -D_FORTIFY_SOURCE=3 -c vendor/cigraph/vendor/plfit/kolmogorov.c -o vendor/cigraph/vendor/plfit/kolmogorov.o gcc -I"/usr/share/R/include" -DNDEBUG -DUSING_R -I. -Ivendor -Ivendor/cigraph/src -Ivendor/cigraph/include -Ivendor/cigraph/vendor -Ivendor/io/parsers -I/usr/include/libxml2 -DHAVE_LIBXML -DNDEBUG -DNTIMER -DNPRINT -DIGRAPH_THREAD_LOCAL= -DPRPACK_IGRAPH_SUPPORT -DHAVE_GFORTRAN=1 -D_GNU_SOURCE=1 -I'/home/omnipath/local/R/4.4-3.20/cpp11/include' -fvisibility=hidden -fpic -g -O2 -fno-omit-frame-pointer -mno-omit-leaf-frame-pointer -ffile-prefix-map=/build/r-base-EawLoD/r-base-4.4.1=. -fstack-protector-strong -fstack-clash-protection -Wformat -Werror=format-security -fcf-protection -fdebug-prefix-map=/build/r-base-EawLoD/r-base-4.4.1=/usr/src/r-base-4.4.1-1.2404.0 -Wdate-time -D_FORTIFY_SOURCE=3 -c vendor/cigraph/vendor/plfit/lbfgs.c -o vendor/cigraph/vendor/plfit/lbfgs.o gcc -I"/usr/share/R/include" -DNDEBUG -DUSING_R -I. -Ivendor -Ivendor/cigraph/src -Ivendor/cigraph/include -Ivendor/cigraph/vendor -Ivendor/io/parsers -I/usr/include/libxml2 -DHAVE_LIBXML -DNDEBUG -DNTIMER -DNPRINT -DIGRAPH_THREAD_LOCAL= -DPRPACK_IGRAPH_SUPPORT -DHAVE_GFORTRAN=1 -D_GNU_SOURCE=1 -I'/home/omnipath/local/R/4.4-3.20/cpp11/include' -fvisibility=hidden -fpic -g -O2 -fno-omit-frame-pointer -mno-omit-leaf-frame-pointer -ffile-prefix-map=/build/r-base-EawLoD/r-base-4.4.1=. -fstack-protector-strong -fstack-clash-protection -Wformat -Werror=format-security -fcf-protection -fdebug-prefix-map=/build/r-base-EawLoD/r-base-4.4.1=/usr/src/r-base-4.4.1-1.2404.0 -Wdate-time -D_FORTIFY_SOURCE=3 -c vendor/cigraph/vendor/plfit/mt.c -o vendor/cigraph/vendor/plfit/mt.o gcc -I"/usr/share/R/include" -DNDEBUG -DUSING_R -I. -Ivendor -Ivendor/cigraph/src -Ivendor/cigraph/include -Ivendor/cigraph/vendor -Ivendor/io/parsers -I/usr/include/libxml2 -DHAVE_LIBXML -DNDEBUG -DNTIMER -DNPRINT -DIGRAPH_THREAD_LOCAL= -DPRPACK_IGRAPH_SUPPORT -DHAVE_GFORTRAN=1 -D_GNU_SOURCE=1 -I'/home/omnipath/local/R/4.4-3.20/cpp11/include' -fvisibility=hidden -fpic -g -O2 -fno-omit-frame-pointer -mno-omit-leaf-frame-pointer -ffile-prefix-map=/build/r-base-EawLoD/r-base-4.4.1=. -fstack-protector-strong -fstack-clash-protection -Wformat -Werror=format-security -fcf-protection -fdebug-prefix-map=/build/r-base-EawLoD/r-base-4.4.1=/usr/src/r-base-4.4.1-1.2404.0 -Wdate-time -D_FORTIFY_SOURCE=3 -c vendor/cigraph/vendor/plfit/options.c -o vendor/cigraph/vendor/plfit/options.o gcc -I"/usr/share/R/include" -DNDEBUG -DUSING_R -I. -Ivendor -Ivendor/cigraph/src -Ivendor/cigraph/include -Ivendor/cigraph/vendor -Ivendor/io/parsers -I/usr/include/libxml2 -DHAVE_LIBXML -DNDEBUG -DNTIMER -DNPRINT -DIGRAPH_THREAD_LOCAL= -DPRPACK_IGRAPH_SUPPORT -DHAVE_GFORTRAN=1 -D_GNU_SOURCE=1 -I'/home/omnipath/local/R/4.4-3.20/cpp11/include' -fvisibility=hidden -fpic -g -O2 -fno-omit-frame-pointer -mno-omit-leaf-frame-pointer -ffile-prefix-map=/build/r-base-EawLoD/r-base-4.4.1=. -fstack-protector-strong -fstack-clash-protection -Wformat -Werror=format-security -fcf-protection -fdebug-prefix-map=/build/r-base-EawLoD/r-base-4.4.1=/usr/src/r-base-4.4.1-1.2404.0 -Wdate-time -D_FORTIFY_SOURCE=3 -c vendor/cigraph/vendor/plfit/platform.c -o vendor/cigraph/vendor/plfit/platform.o gcc -I"/usr/share/R/include" -DNDEBUG -DUSING_R -I. -Ivendor -Ivendor/cigraph/src -Ivendor/cigraph/include -Ivendor/cigraph/vendor -Ivendor/io/parsers -I/usr/include/libxml2 -DHAVE_LIBXML -DNDEBUG -DNTIMER -DNPRINT -DIGRAPH_THREAD_LOCAL= -DPRPACK_IGRAPH_SUPPORT -DHAVE_GFORTRAN=1 -D_GNU_SOURCE=1 -I'/home/omnipath/local/R/4.4-3.20/cpp11/include' -fvisibility=hidden -fpic -g -O2 -fno-omit-frame-pointer -mno-omit-leaf-frame-pointer -ffile-prefix-map=/build/r-base-EawLoD/r-base-4.4.1=. -fstack-protector-strong -fstack-clash-protection -Wformat -Werror=format-security -fcf-protection -fdebug-prefix-map=/build/r-base-EawLoD/r-base-4.4.1=/usr/src/r-base-4.4.1-1.2404.0 -Wdate-time -D_FORTIFY_SOURCE=3 -c vendor/cigraph/vendor/plfit/plfit.c -o vendor/cigraph/vendor/plfit/plfit.o gcc -I"/usr/share/R/include" -DNDEBUG -DUSING_R -I. -Ivendor -Ivendor/cigraph/src -Ivendor/cigraph/include -Ivendor/cigraph/vendor -Ivendor/io/parsers -I/usr/include/libxml2 -DHAVE_LIBXML -DNDEBUG -DNTIMER -DNPRINT -DIGRAPH_THREAD_LOCAL= -DPRPACK_IGRAPH_SUPPORT -DHAVE_GFORTRAN=1 -D_GNU_SOURCE=1 -I'/home/omnipath/local/R/4.4-3.20/cpp11/include' -fvisibility=hidden -fpic -g -O2 -fno-omit-frame-pointer -mno-omit-leaf-frame-pointer -ffile-prefix-map=/build/r-base-EawLoD/r-base-4.4.1=. -fstack-protector-strong -fstack-clash-protection -Wformat -Werror=format-security -fcf-protection -fdebug-prefix-map=/build/r-base-EawLoD/r-base-4.4.1=/usr/src/r-base-4.4.1-1.2404.0 -Wdate-time -D_FORTIFY_SOURCE=3 -c vendor/cigraph/vendor/plfit/plfit_error.c -o vendor/cigraph/vendor/plfit/plfit_error.o gcc -I"/usr/share/R/include" -DNDEBUG -DUSING_R -I. -Ivendor -Ivendor/cigraph/src -Ivendor/cigraph/include -Ivendor/cigraph/vendor -Ivendor/io/parsers -I/usr/include/libxml2 -DHAVE_LIBXML -DNDEBUG -DNTIMER -DNPRINT -DIGRAPH_THREAD_LOCAL= -DPRPACK_IGRAPH_SUPPORT -DHAVE_GFORTRAN=1 -D_GNU_SOURCE=1 -I'/home/omnipath/local/R/4.4-3.20/cpp11/include' -fvisibility=hidden -fpic -g -O2 -fno-omit-frame-pointer -mno-omit-leaf-frame-pointer -ffile-prefix-map=/build/r-base-EawLoD/r-base-4.4.1=. -fstack-protector-strong -fstack-clash-protection -Wformat -Werror=format-security -fcf-protection -fdebug-prefix-map=/build/r-base-EawLoD/r-base-4.4.1=/usr/src/r-base-4.4.1-1.2404.0 -Wdate-time -D_FORTIFY_SOURCE=3 -c vendor/cigraph/vendor/plfit/rbinom.c -o vendor/cigraph/vendor/plfit/rbinom.o gcc -I"/usr/share/R/include" -DNDEBUG -DUSING_R -I. -Ivendor -Ivendor/cigraph/src -Ivendor/cigraph/include -Ivendor/cigraph/vendor -Ivendor/io/parsers -I/usr/include/libxml2 -DHAVE_LIBXML -DNDEBUG -DNTIMER -DNPRINT -DIGRAPH_THREAD_LOCAL= -DPRPACK_IGRAPH_SUPPORT -DHAVE_GFORTRAN=1 -D_GNU_SOURCE=1 -I'/home/omnipath/local/R/4.4-3.20/cpp11/include' -fvisibility=hidden -fpic -g -O2 -fno-omit-frame-pointer -mno-omit-leaf-frame-pointer -ffile-prefix-map=/build/r-base-EawLoD/r-base-4.4.1=. -fstack-protector-strong -fstack-clash-protection -Wformat -Werror=format-security -fcf-protection -fdebug-prefix-map=/build/r-base-EawLoD/r-base-4.4.1=/usr/src/r-base-4.4.1-1.2404.0 -Wdate-time -D_FORTIFY_SOURCE=3 -c vendor/cigraph/vendor/plfit/sampling.c -o vendor/cigraph/vendor/plfit/sampling.o gcc -I"/usr/share/R/include" -DNDEBUG -DUSING_R -I. -Ivendor -Ivendor/cigraph/src -Ivendor/cigraph/include -Ivendor/cigraph/vendor -Ivendor/io/parsers -I/usr/include/libxml2 -DHAVE_LIBXML -DNDEBUG -DNTIMER -DNPRINT -DIGRAPH_THREAD_LOCAL= -DPRPACK_IGRAPH_SUPPORT -DHAVE_GFORTRAN=1 -D_GNU_SOURCE=1 -I'/home/omnipath/local/R/4.4-3.20/cpp11/include' -fvisibility=hidden -fpic -g -O2 -fno-omit-frame-pointer -mno-omit-leaf-frame-pointer -ffile-prefix-map=/build/r-base-EawLoD/r-base-4.4.1=. -fstack-protector-strong -fstack-clash-protection -Wformat -Werror=format-security -fcf-protection -fdebug-prefix-map=/build/r-base-EawLoD/r-base-4.4.1=/usr/src/r-base-4.4.1-1.2404.0 -Wdate-time -D_FORTIFY_SOURCE=3 -c vendor/io/dl-lexer.c -o vendor/io/dl-lexer.o gcc -I"/usr/share/R/include" -DNDEBUG -DUSING_R -I. -Ivendor -Ivendor/cigraph/src -Ivendor/cigraph/include -Ivendor/cigraph/vendor -Ivendor/io/parsers -I/usr/include/libxml2 -DHAVE_LIBXML -DNDEBUG -DNTIMER -DNPRINT -DIGRAPH_THREAD_LOCAL= -DPRPACK_IGRAPH_SUPPORT -DHAVE_GFORTRAN=1 -D_GNU_SOURCE=1 -I'/home/omnipath/local/R/4.4-3.20/cpp11/include' -fvisibility=hidden -fpic -g -O2 -fno-omit-frame-pointer -mno-omit-leaf-frame-pointer -ffile-prefix-map=/build/r-base-EawLoD/r-base-4.4.1=. -fstack-protector-strong -fstack-clash-protection -Wformat -Werror=format-security -fcf-protection -fdebug-prefix-map=/build/r-base-EawLoD/r-base-4.4.1=/usr/src/r-base-4.4.1-1.2404.0 -Wdate-time -D_FORTIFY_SOURCE=3 -c vendor/io/dl-parser.c -o vendor/io/dl-parser.o gcc -I"/usr/share/R/include" -DNDEBUG -DUSING_R -I. -Ivendor -Ivendor/cigraph/src -Ivendor/cigraph/include -Ivendor/cigraph/vendor -Ivendor/io/parsers -I/usr/include/libxml2 -DHAVE_LIBXML -DNDEBUG -DNTIMER -DNPRINT -DIGRAPH_THREAD_LOCAL= -DPRPACK_IGRAPH_SUPPORT -DHAVE_GFORTRAN=1 -D_GNU_SOURCE=1 -I'/home/omnipath/local/R/4.4-3.20/cpp11/include' -fvisibility=hidden -fpic -g -O2 -fno-omit-frame-pointer -mno-omit-leaf-frame-pointer -ffile-prefix-map=/build/r-base-EawLoD/r-base-4.4.1=. -fstack-protector-strong -fstack-clash-protection -Wformat -Werror=format-security -fcf-protection -fdebug-prefix-map=/build/r-base-EawLoD/r-base-4.4.1=/usr/src/r-base-4.4.1-1.2404.0 -Wdate-time -D_FORTIFY_SOURCE=3 -c vendor/io/gml-lexer.c -o vendor/io/gml-lexer.o gcc -I"/usr/share/R/include" -DNDEBUG -DUSING_R -I. -Ivendor -Ivendor/cigraph/src -Ivendor/cigraph/include -Ivendor/cigraph/vendor -Ivendor/io/parsers -I/usr/include/libxml2 -DHAVE_LIBXML -DNDEBUG -DNTIMER -DNPRINT -DIGRAPH_THREAD_LOCAL= -DPRPACK_IGRAPH_SUPPORT -DHAVE_GFORTRAN=1 -D_GNU_SOURCE=1 -I'/home/omnipath/local/R/4.4-3.20/cpp11/include' -fvisibility=hidden -fpic -g -O2 -fno-omit-frame-pointer -mno-omit-leaf-frame-pointer -ffile-prefix-map=/build/r-base-EawLoD/r-base-4.4.1=. -fstack-protector-strong -fstack-clash-protection -Wformat -Werror=format-security -fcf-protection -fdebug-prefix-map=/build/r-base-EawLoD/r-base-4.4.1=/usr/src/r-base-4.4.1-1.2404.0 -Wdate-time -D_FORTIFY_SOURCE=3 -c vendor/io/gml-parser.c -o vendor/io/gml-parser.o gcc -I"/usr/share/R/include" -DNDEBUG -DUSING_R -I. -Ivendor -Ivendor/cigraph/src -Ivendor/cigraph/include -Ivendor/cigraph/vendor -Ivendor/io/parsers -I/usr/include/libxml2 -DHAVE_LIBXML -DNDEBUG -DNTIMER -DNPRINT -DIGRAPH_THREAD_LOCAL= -DPRPACK_IGRAPH_SUPPORT -DHAVE_GFORTRAN=1 -D_GNU_SOURCE=1 -I'/home/omnipath/local/R/4.4-3.20/cpp11/include' -fvisibility=hidden -fpic -g -O2 -fno-omit-frame-pointer -mno-omit-leaf-frame-pointer -ffile-prefix-map=/build/r-base-EawLoD/r-base-4.4.1=. -fstack-protector-strong -fstack-clash-protection -Wformat -Werror=format-security -fcf-protection -fdebug-prefix-map=/build/r-base-EawLoD/r-base-4.4.1=/usr/src/r-base-4.4.1-1.2404.0 -Wdate-time -D_FORTIFY_SOURCE=3 -c vendor/io/lgl-lexer.c -o vendor/io/lgl-lexer.o gcc -I"/usr/share/R/include" -DNDEBUG -DUSING_R -I. -Ivendor -Ivendor/cigraph/src -Ivendor/cigraph/include -Ivendor/cigraph/vendor -Ivendor/io/parsers -I/usr/include/libxml2 -DHAVE_LIBXML -DNDEBUG -DNTIMER -DNPRINT -DIGRAPH_THREAD_LOCAL= -DPRPACK_IGRAPH_SUPPORT -DHAVE_GFORTRAN=1 -D_GNU_SOURCE=1 -I'/home/omnipath/local/R/4.4-3.20/cpp11/include' -fvisibility=hidden -fpic -g -O2 -fno-omit-frame-pointer -mno-omit-leaf-frame-pointer -ffile-prefix-map=/build/r-base-EawLoD/r-base-4.4.1=. -fstack-protector-strong -fstack-clash-protection -Wformat -Werror=format-security -fcf-protection -fdebug-prefix-map=/build/r-base-EawLoD/r-base-4.4.1=/usr/src/r-base-4.4.1-1.2404.0 -Wdate-time -D_FORTIFY_SOURCE=3 -c vendor/io/lgl-parser.c -o vendor/io/lgl-parser.o gcc -I"/usr/share/R/include" -DNDEBUG -DUSING_R -I. -Ivendor -Ivendor/cigraph/src -Ivendor/cigraph/include -Ivendor/cigraph/vendor -Ivendor/io/parsers -I/usr/include/libxml2 -DHAVE_LIBXML -DNDEBUG -DNTIMER -DNPRINT -DIGRAPH_THREAD_LOCAL= -DPRPACK_IGRAPH_SUPPORT -DHAVE_GFORTRAN=1 -D_GNU_SOURCE=1 -I'/home/omnipath/local/R/4.4-3.20/cpp11/include' -fvisibility=hidden -fpic -g -O2 -fno-omit-frame-pointer -mno-omit-leaf-frame-pointer -ffile-prefix-map=/build/r-base-EawLoD/r-base-4.4.1=. -fstack-protector-strong -fstack-clash-protection -Wformat -Werror=format-security -fcf-protection -fdebug-prefix-map=/build/r-base-EawLoD/r-base-4.4.1=/usr/src/r-base-4.4.1-1.2404.0 -Wdate-time -D_FORTIFY_SOURCE=3 -c vendor/io/ncol-lexer.c -o vendor/io/ncol-lexer.o gcc -I"/usr/share/R/include" -DNDEBUG -DUSING_R -I. -Ivendor -Ivendor/cigraph/src -Ivendor/cigraph/include -Ivendor/cigraph/vendor -Ivendor/io/parsers -I/usr/include/libxml2 -DHAVE_LIBXML -DNDEBUG -DNTIMER -DNPRINT -DIGRAPH_THREAD_LOCAL= -DPRPACK_IGRAPH_SUPPORT -DHAVE_GFORTRAN=1 -D_GNU_SOURCE=1 -I'/home/omnipath/local/R/4.4-3.20/cpp11/include' -fvisibility=hidden -fpic -g -O2 -fno-omit-frame-pointer -mno-omit-leaf-frame-pointer -ffile-prefix-map=/build/r-base-EawLoD/r-base-4.4.1=. -fstack-protector-strong -fstack-clash-protection -Wformat -Werror=format-security -fcf-protection -fdebug-prefix-map=/build/r-base-EawLoD/r-base-4.4.1=/usr/src/r-base-4.4.1-1.2404.0 -Wdate-time -D_FORTIFY_SOURCE=3 -c vendor/io/ncol-parser.c -o vendor/io/ncol-parser.o gcc -I"/usr/share/R/include" -DNDEBUG -DUSING_R -I. -Ivendor -Ivendor/cigraph/src -Ivendor/cigraph/include -Ivendor/cigraph/vendor -Ivendor/io/parsers -I/usr/include/libxml2 -DHAVE_LIBXML -DNDEBUG -DNTIMER -DNPRINT -DIGRAPH_THREAD_LOCAL= -DPRPACK_IGRAPH_SUPPORT -DHAVE_GFORTRAN=1 -D_GNU_SOURCE=1 -I'/home/omnipath/local/R/4.4-3.20/cpp11/include' -fvisibility=hidden -fpic -g -O2 -fno-omit-frame-pointer -mno-omit-leaf-frame-pointer -ffile-prefix-map=/build/r-base-EawLoD/r-base-4.4.1=. -fstack-protector-strong -fstack-clash-protection -Wformat -Werror=format-security -fcf-protection -fdebug-prefix-map=/build/r-base-EawLoD/r-base-4.4.1=/usr/src/r-base-4.4.1-1.2404.0 -Wdate-time -D_FORTIFY_SOURCE=3 -c vendor/io/pajek-lexer.c -o vendor/io/pajek-lexer.o gcc -I"/usr/share/R/include" -DNDEBUG -DUSING_R -I. -Ivendor -Ivendor/cigraph/src -Ivendor/cigraph/include -Ivendor/cigraph/vendor -Ivendor/io/parsers -I/usr/include/libxml2 -DHAVE_LIBXML -DNDEBUG -DNTIMER -DNPRINT -DIGRAPH_THREAD_LOCAL= -DPRPACK_IGRAPH_SUPPORT -DHAVE_GFORTRAN=1 -D_GNU_SOURCE=1 -I'/home/omnipath/local/R/4.4-3.20/cpp11/include' -fvisibility=hidden -fpic -g -O2 -fno-omit-frame-pointer -mno-omit-leaf-frame-pointer -ffile-prefix-map=/build/r-base-EawLoD/r-base-4.4.1=. -fstack-protector-strong -fstack-clash-protection -Wformat -Werror=format-security -fcf-protection -fdebug-prefix-map=/build/r-base-EawLoD/r-base-4.4.1=/usr/src/r-base-4.4.1-1.2404.0 -Wdate-time -D_FORTIFY_SOURCE=3 -c vendor/io/pajek-parser.c -o vendor/io/pajek-parser.o g++ -std=gnu++17 -I"/usr/share/R/include" -DNDEBUG -DUSING_R -I. -Ivendor -Ivendor/cigraph/src -Ivendor/cigraph/include -Ivendor/cigraph/vendor -Ivendor/io/parsers -I/usr/include/libxml2 -DHAVE_LIBXML -DNDEBUG -DNTIMER -DNPRINT -DIGRAPH_THREAD_LOCAL= -DPRPACK_IGRAPH_SUPPORT -DHAVE_GFORTRAN=1 -D_GNU_SOURCE=1 -I'/home/omnipath/local/R/4.4-3.20/cpp11/include' -fvisibility=hidden -fpic -g -O2 -fno-omit-frame-pointer -mno-omit-leaf-frame-pointer -ffile-prefix-map=/build/r-base-EawLoD/r-base-4.4.1=. -fstack-protector-strong -fstack-clash-protection -Wformat -Werror=format-security -fcf-protection -fdebug-prefix-map=/build/r-base-EawLoD/r-base-4.4.1=/usr/src/r-base-4.4.1-1.2404.0 -Wdate-time -D_FORTIFY_SOURCE=3 -c vendor/simpleraytracer/Color.cpp -o vendor/simpleraytracer/Color.o g++ -std=gnu++17 -I"/usr/share/R/include" -DNDEBUG -DUSING_R -I. -Ivendor -Ivendor/cigraph/src -Ivendor/cigraph/include -Ivendor/cigraph/vendor -Ivendor/io/parsers -I/usr/include/libxml2 -DHAVE_LIBXML -DNDEBUG -DNTIMER -DNPRINT -DIGRAPH_THREAD_LOCAL= -DPRPACK_IGRAPH_SUPPORT -DHAVE_GFORTRAN=1 -D_GNU_SOURCE=1 -I'/home/omnipath/local/R/4.4-3.20/cpp11/include' -fvisibility=hidden -fpic -g -O2 -fno-omit-frame-pointer -mno-omit-leaf-frame-pointer -ffile-prefix-map=/build/r-base-EawLoD/r-base-4.4.1=. -fstack-protector-strong -fstack-clash-protection -Wformat -Werror=format-security -fcf-protection -fdebug-prefix-map=/build/r-base-EawLoD/r-base-4.4.1=/usr/src/r-base-4.4.1-1.2404.0 -Wdate-time -D_FORTIFY_SOURCE=3 -c vendor/simpleraytracer/Light.cpp -o vendor/simpleraytracer/Light.o g++ -std=gnu++17 -I"/usr/share/R/include" -DNDEBUG -DUSING_R -I. -Ivendor -Ivendor/cigraph/src -Ivendor/cigraph/include -Ivendor/cigraph/vendor -Ivendor/io/parsers -I/usr/include/libxml2 -DHAVE_LIBXML -DNDEBUG -DNTIMER -DNPRINT -DIGRAPH_THREAD_LOCAL= -DPRPACK_IGRAPH_SUPPORT -DHAVE_GFORTRAN=1 -D_GNU_SOURCE=1 -I'/home/omnipath/local/R/4.4-3.20/cpp11/include' -fvisibility=hidden -fpic -g -O2 -fno-omit-frame-pointer -mno-omit-leaf-frame-pointer -ffile-prefix-map=/build/r-base-EawLoD/r-base-4.4.1=. -fstack-protector-strong -fstack-clash-protection -Wformat -Werror=format-security -fcf-protection -fdebug-prefix-map=/build/r-base-EawLoD/r-base-4.4.1=/usr/src/r-base-4.4.1-1.2404.0 -Wdate-time -D_FORTIFY_SOURCE=3 -c vendor/simpleraytracer/Point.cpp -o vendor/simpleraytracer/Point.o g++ -std=gnu++17 -I"/usr/share/R/include" -DNDEBUG -DUSING_R -I. -Ivendor -Ivendor/cigraph/src -Ivendor/cigraph/include -Ivendor/cigraph/vendor -Ivendor/io/parsers -I/usr/include/libxml2 -DHAVE_LIBXML -DNDEBUG -DNTIMER -DNPRINT -DIGRAPH_THREAD_LOCAL= -DPRPACK_IGRAPH_SUPPORT -DHAVE_GFORTRAN=1 -D_GNU_SOURCE=1 -I'/home/omnipath/local/R/4.4-3.20/cpp11/include' -fvisibility=hidden -fpic -g -O2 -fno-omit-frame-pointer -mno-omit-leaf-frame-pointer -ffile-prefix-map=/build/r-base-EawLoD/r-base-4.4.1=. -fstack-protector-strong -fstack-clash-protection -Wformat -Werror=format-security -fcf-protection -fdebug-prefix-map=/build/r-base-EawLoD/r-base-4.4.1=/usr/src/r-base-4.4.1-1.2404.0 -Wdate-time -D_FORTIFY_SOURCE=3 -c vendor/simpleraytracer/Ray.cpp -o vendor/simpleraytracer/Ray.o g++ -std=gnu++17 -I"/usr/share/R/include" -DNDEBUG -DUSING_R -I. -Ivendor -Ivendor/cigraph/src -Ivendor/cigraph/include -Ivendor/cigraph/vendor -Ivendor/io/parsers -I/usr/include/libxml2 -DHAVE_LIBXML -DNDEBUG -DNTIMER -DNPRINT -DIGRAPH_THREAD_LOCAL= -DPRPACK_IGRAPH_SUPPORT -DHAVE_GFORTRAN=1 -D_GNU_SOURCE=1 -I'/home/omnipath/local/R/4.4-3.20/cpp11/include' -fvisibility=hidden -fpic -g -O2 -fno-omit-frame-pointer -mno-omit-leaf-frame-pointer -ffile-prefix-map=/build/r-base-EawLoD/r-base-4.4.1=. -fstack-protector-strong -fstack-clash-protection -Wformat -Werror=format-security -fcf-protection -fdebug-prefix-map=/build/r-base-EawLoD/r-base-4.4.1=/usr/src/r-base-4.4.1-1.2404.0 -Wdate-time -D_FORTIFY_SOURCE=3 -c vendor/simpleraytracer/RayTracer.cpp -o vendor/simpleraytracer/RayTracer.o g++ -std=gnu++17 -I"/usr/share/R/include" -DNDEBUG -DUSING_R -I. -Ivendor -Ivendor/cigraph/src -Ivendor/cigraph/include -Ivendor/cigraph/vendor -Ivendor/io/parsers -I/usr/include/libxml2 -DHAVE_LIBXML -DNDEBUG -DNTIMER -DNPRINT -DIGRAPH_THREAD_LOCAL= -DPRPACK_IGRAPH_SUPPORT -DHAVE_GFORTRAN=1 -D_GNU_SOURCE=1 -I'/home/omnipath/local/R/4.4-3.20/cpp11/include' -fvisibility=hidden -fpic -g -O2 -fno-omit-frame-pointer -mno-omit-leaf-frame-pointer -ffile-prefix-map=/build/r-base-EawLoD/r-base-4.4.1=. -fstack-protector-strong -fstack-clash-protection -Wformat -Werror=format-security -fcf-protection -fdebug-prefix-map=/build/r-base-EawLoD/r-base-4.4.1=/usr/src/r-base-4.4.1-1.2404.0 -Wdate-time -D_FORTIFY_SOURCE=3 -c vendor/simpleraytracer/RayVector.cpp -o vendor/simpleraytracer/RayVector.o g++ -std=gnu++17 -I"/usr/share/R/include" -DNDEBUG -DUSING_R -I. -Ivendor -Ivendor/cigraph/src -Ivendor/cigraph/include -Ivendor/cigraph/vendor -Ivendor/io/parsers -I/usr/include/libxml2 -DHAVE_LIBXML -DNDEBUG -DNTIMER -DNPRINT -DIGRAPH_THREAD_LOCAL= -DPRPACK_IGRAPH_SUPPORT -DHAVE_GFORTRAN=1 -D_GNU_SOURCE=1 -I'/home/omnipath/local/R/4.4-3.20/cpp11/include' -fvisibility=hidden -fpic -g -O2 -fno-omit-frame-pointer -mno-omit-leaf-frame-pointer -ffile-prefix-map=/build/r-base-EawLoD/r-base-4.4.1=. -fstack-protector-strong -fstack-clash-protection -Wformat -Werror=format-security -fcf-protection -fdebug-prefix-map=/build/r-base-EawLoD/r-base-4.4.1=/usr/src/r-base-4.4.1-1.2404.0 -Wdate-time -D_FORTIFY_SOURCE=3 -c vendor/simpleraytracer/Shape.cpp -o vendor/simpleraytracer/Shape.o g++ -std=gnu++17 -I"/usr/share/R/include" -DNDEBUG -DUSING_R -I. -Ivendor -Ivendor/cigraph/src -Ivendor/cigraph/include -Ivendor/cigraph/vendor -Ivendor/io/parsers -I/usr/include/libxml2 -DHAVE_LIBXML -DNDEBUG -DNTIMER -DNPRINT -DIGRAPH_THREAD_LOCAL= -DPRPACK_IGRAPH_SUPPORT -DHAVE_GFORTRAN=1 -D_GNU_SOURCE=1 -I'/home/omnipath/local/R/4.4-3.20/cpp11/include' -fvisibility=hidden -fpic -g -O2 -fno-omit-frame-pointer -mno-omit-leaf-frame-pointer -ffile-prefix-map=/build/r-base-EawLoD/r-base-4.4.1=. -fstack-protector-strong -fstack-clash-protection -Wformat -Werror=format-security -fcf-protection -fdebug-prefix-map=/build/r-base-EawLoD/r-base-4.4.1=/usr/src/r-base-4.4.1-1.2404.0 -Wdate-time -D_FORTIFY_SOURCE=3 -c vendor/simpleraytracer/Sphere.cpp -o vendor/simpleraytracer/Sphere.o g++ -std=gnu++17 -I"/usr/share/R/include" -DNDEBUG -DUSING_R -I. -Ivendor -Ivendor/cigraph/src -Ivendor/cigraph/include -Ivendor/cigraph/vendor -Ivendor/io/parsers -I/usr/include/libxml2 -DHAVE_LIBXML -DNDEBUG -DNTIMER -DNPRINT -DIGRAPH_THREAD_LOCAL= -DPRPACK_IGRAPH_SUPPORT -DHAVE_GFORTRAN=1 -D_GNU_SOURCE=1 -I'/home/omnipath/local/R/4.4-3.20/cpp11/include' -fvisibility=hidden -fpic -g -O2 -fno-omit-frame-pointer -mno-omit-leaf-frame-pointer -ffile-prefix-map=/build/r-base-EawLoD/r-base-4.4.1=. -fstack-protector-strong -fstack-clash-protection -Wformat -Werror=format-security -fcf-protection -fdebug-prefix-map=/build/r-base-EawLoD/r-base-4.4.1=/usr/src/r-base-4.4.1-1.2404.0 -Wdate-time -D_FORTIFY_SOURCE=3 -c vendor/simpleraytracer/Triangle.cpp -o vendor/simpleraytracer/Triangle.o g++ -std=gnu++17 -I"/usr/share/R/include" -DNDEBUG -DUSING_R -I. -Ivendor -Ivendor/cigraph/src -Ivendor/cigraph/include -Ivendor/cigraph/vendor -Ivendor/io/parsers -I/usr/include/libxml2 -DHAVE_LIBXML -DNDEBUG -DNTIMER -DNPRINT -DIGRAPH_THREAD_LOCAL= -DPRPACK_IGRAPH_SUPPORT -DHAVE_GFORTRAN=1 -D_GNU_SOURCE=1 -I'/home/omnipath/local/R/4.4-3.20/cpp11/include' -fvisibility=hidden -fpic -g -O2 -fno-omit-frame-pointer -mno-omit-leaf-frame-pointer -ffile-prefix-map=/build/r-base-EawLoD/r-base-4.4.1=. -fstack-protector-strong -fstack-clash-protection -Wformat -Werror=format-security -fcf-protection -fdebug-prefix-map=/build/r-base-EawLoD/r-base-4.4.1=/usr/src/r-base-4.4.1-1.2404.0 -Wdate-time -D_FORTIFY_SOURCE=3 -c vendor/simpleraytracer/unit_limiter.cpp -o vendor/simpleraytracer/unit_limiter.o gcc -I"/usr/share/R/include" -DNDEBUG -DUSING_R -I. -Ivendor -Ivendor/cigraph/src -Ivendor/cigraph/include -Ivendor/cigraph/vendor -Ivendor/io/parsers -I/usr/include/libxml2 -DHAVE_LIBXML -DNDEBUG -DNTIMER -DNPRINT -DIGRAPH_THREAD_LOCAL= -DPRPACK_IGRAPH_SUPPORT -DHAVE_GFORTRAN=1 -D_GNU_SOURCE=1 -I'/home/omnipath/local/R/4.4-3.20/cpp11/include' -fvisibility=hidden -fpic -g -O2 -fno-omit-frame-pointer -mno-omit-leaf-frame-pointer -ffile-prefix-map=/build/r-base-EawLoD/r-base-4.4.1=. -fstack-protector-strong -fstack-clash-protection -Wformat -Werror=format-security -fcf-protection -fdebug-prefix-map=/build/r-base-EawLoD/r-base-4.4.1=/usr/src/r-base-4.4.1-1.2404.0 -Wdate-time -D_FORTIFY_SOURCE=3 -c vendor/uuid/R.c -o vendor/uuid/R.o gcc -I"/usr/share/R/include" -DNDEBUG -DUSING_R -I. -Ivendor -Ivendor/cigraph/src -Ivendor/cigraph/include -Ivendor/cigraph/vendor -Ivendor/io/parsers -I/usr/include/libxml2 -DHAVE_LIBXML -DNDEBUG -DNTIMER -DNPRINT -DIGRAPH_THREAD_LOCAL= -DPRPACK_IGRAPH_SUPPORT -DHAVE_GFORTRAN=1 -D_GNU_SOURCE=1 -I'/home/omnipath/local/R/4.4-3.20/cpp11/include' -fvisibility=hidden -fpic -g -O2 -fno-omit-frame-pointer -mno-omit-leaf-frame-pointer -ffile-prefix-map=/build/r-base-EawLoD/r-base-4.4.1=. -fstack-protector-strong -fstack-clash-protection -Wformat -Werror=format-security -fcf-protection -fdebug-prefix-map=/build/r-base-EawLoD/r-base-4.4.1=/usr/src/r-base-4.4.1-1.2404.0 -Wdate-time -D_FORTIFY_SOURCE=3 -c vendor/uuid/clear.c -o vendor/uuid/clear.o gcc -I"/usr/share/R/include" -DNDEBUG -DUSING_R -I. -Ivendor -Ivendor/cigraph/src -Ivendor/cigraph/include -Ivendor/cigraph/vendor -Ivendor/io/parsers -I/usr/include/libxml2 -DHAVE_LIBXML -DNDEBUG -DNTIMER -DNPRINT -DIGRAPH_THREAD_LOCAL= -DPRPACK_IGRAPH_SUPPORT -DHAVE_GFORTRAN=1 -D_GNU_SOURCE=1 -I'/home/omnipath/local/R/4.4-3.20/cpp11/include' -fvisibility=hidden -fpic -g -O2 -fno-omit-frame-pointer -mno-omit-leaf-frame-pointer -ffile-prefix-map=/build/r-base-EawLoD/r-base-4.4.1=. -fstack-protector-strong -fstack-clash-protection -Wformat -Werror=format-security -fcf-protection -fdebug-prefix-map=/build/r-base-EawLoD/r-base-4.4.1=/usr/src/r-base-4.4.1-1.2404.0 -Wdate-time -D_FORTIFY_SOURCE=3 -c vendor/uuid/compare.c -o vendor/uuid/compare.o gcc -I"/usr/share/R/include" -DNDEBUG -DUSING_R -I. -Ivendor -Ivendor/cigraph/src -Ivendor/cigraph/include -Ivendor/cigraph/vendor -Ivendor/io/parsers -I/usr/include/libxml2 -DHAVE_LIBXML -DNDEBUG -DNTIMER -DNPRINT -DIGRAPH_THREAD_LOCAL= -DPRPACK_IGRAPH_SUPPORT -DHAVE_GFORTRAN=1 -D_GNU_SOURCE=1 -I'/home/omnipath/local/R/4.4-3.20/cpp11/include' -fvisibility=hidden -fpic -g -O2 -fno-omit-frame-pointer -mno-omit-leaf-frame-pointer -ffile-prefix-map=/build/r-base-EawLoD/r-base-4.4.1=. -fstack-protector-strong -fstack-clash-protection -Wformat -Werror=format-security -fcf-protection -fdebug-prefix-map=/build/r-base-EawLoD/r-base-4.4.1=/usr/src/r-base-4.4.1-1.2404.0 -Wdate-time -D_FORTIFY_SOURCE=3 -c vendor/uuid/copy.c -o vendor/uuid/copy.o gcc -I"/usr/share/R/include" -DNDEBUG -DUSING_R -I. -Ivendor -Ivendor/cigraph/src -Ivendor/cigraph/include -Ivendor/cigraph/vendor -Ivendor/io/parsers -I/usr/include/libxml2 -DHAVE_LIBXML -DNDEBUG -DNTIMER -DNPRINT -DIGRAPH_THREAD_LOCAL= -DPRPACK_IGRAPH_SUPPORT -DHAVE_GFORTRAN=1 -D_GNU_SOURCE=1 -I'/home/omnipath/local/R/4.4-3.20/cpp11/include' -fvisibility=hidden -fpic -g -O2 -fno-omit-frame-pointer -mno-omit-leaf-frame-pointer -ffile-prefix-map=/build/r-base-EawLoD/r-base-4.4.1=. -fstack-protector-strong -fstack-clash-protection -Wformat -Werror=format-security -fcf-protection -fdebug-prefix-map=/build/r-base-EawLoD/r-base-4.4.1=/usr/src/r-base-4.4.1-1.2404.0 -Wdate-time -D_FORTIFY_SOURCE=3 -c vendor/uuid/gen_uuid.c -o vendor/uuid/gen_uuid.o gcc -I"/usr/share/R/include" -DNDEBUG -DUSING_R -I. -Ivendor -Ivendor/cigraph/src -Ivendor/cigraph/include -Ivendor/cigraph/vendor -Ivendor/io/parsers -I/usr/include/libxml2 -DHAVE_LIBXML -DNDEBUG -DNTIMER -DNPRINT -DIGRAPH_THREAD_LOCAL= -DPRPACK_IGRAPH_SUPPORT -DHAVE_GFORTRAN=1 -D_GNU_SOURCE=1 -I'/home/omnipath/local/R/4.4-3.20/cpp11/include' -fvisibility=hidden -fpic -g -O2 -fno-omit-frame-pointer -mno-omit-leaf-frame-pointer -ffile-prefix-map=/build/r-base-EawLoD/r-base-4.4.1=. -fstack-protector-strong -fstack-clash-protection -Wformat -Werror=format-security -fcf-protection -fdebug-prefix-map=/build/r-base-EawLoD/r-base-4.4.1=/usr/src/r-base-4.4.1-1.2404.0 -Wdate-time -D_FORTIFY_SOURCE=3 -c vendor/uuid/isnull.c -o vendor/uuid/isnull.o gcc -I"/usr/share/R/include" -DNDEBUG -DUSING_R -I. -Ivendor -Ivendor/cigraph/src -Ivendor/cigraph/include -Ivendor/cigraph/vendor -Ivendor/io/parsers -I/usr/include/libxml2 -DHAVE_LIBXML -DNDEBUG -DNTIMER -DNPRINT -DIGRAPH_THREAD_LOCAL= -DPRPACK_IGRAPH_SUPPORT -DHAVE_GFORTRAN=1 -D_GNU_SOURCE=1 -I'/home/omnipath/local/R/4.4-3.20/cpp11/include' -fvisibility=hidden -fpic -g -O2 -fno-omit-frame-pointer -mno-omit-leaf-frame-pointer -ffile-prefix-map=/build/r-base-EawLoD/r-base-4.4.1=. -fstack-protector-strong -fstack-clash-protection -Wformat -Werror=format-security -fcf-protection -fdebug-prefix-map=/build/r-base-EawLoD/r-base-4.4.1=/usr/src/r-base-4.4.1-1.2404.0 -Wdate-time -D_FORTIFY_SOURCE=3 -c vendor/uuid/pack.c -o vendor/uuid/pack.o gcc -I"/usr/share/R/include" -DNDEBUG -DUSING_R -I. -Ivendor -Ivendor/cigraph/src -Ivendor/cigraph/include -Ivendor/cigraph/vendor -Ivendor/io/parsers -I/usr/include/libxml2 -DHAVE_LIBXML -DNDEBUG -DNTIMER -DNPRINT -DIGRAPH_THREAD_LOCAL= -DPRPACK_IGRAPH_SUPPORT -DHAVE_GFORTRAN=1 -D_GNU_SOURCE=1 -I'/home/omnipath/local/R/4.4-3.20/cpp11/include' -fvisibility=hidden -fpic -g -O2 -fno-omit-frame-pointer -mno-omit-leaf-frame-pointer -ffile-prefix-map=/build/r-base-EawLoD/r-base-4.4.1=. -fstack-protector-strong -fstack-clash-protection -Wformat -Werror=format-security -fcf-protection -fdebug-prefix-map=/build/r-base-EawLoD/r-base-4.4.1=/usr/src/r-base-4.4.1-1.2404.0 -Wdate-time -D_FORTIFY_SOURCE=3 -c vendor/uuid/parse.c -o vendor/uuid/parse.o gcc -I"/usr/share/R/include" -DNDEBUG -DUSING_R -I. -Ivendor -Ivendor/cigraph/src -Ivendor/cigraph/include -Ivendor/cigraph/vendor -Ivendor/io/parsers -I/usr/include/libxml2 -DHAVE_LIBXML -DNDEBUG -DNTIMER -DNPRINT -DIGRAPH_THREAD_LOCAL= -DPRPACK_IGRAPH_SUPPORT -DHAVE_GFORTRAN=1 -D_GNU_SOURCE=1 -I'/home/omnipath/local/R/4.4-3.20/cpp11/include' -fvisibility=hidden -fpic -g -O2 -fno-omit-frame-pointer -mno-omit-leaf-frame-pointer -ffile-prefix-map=/build/r-base-EawLoD/r-base-4.4.1=. -fstack-protector-strong -fstack-clash-protection -Wformat -Werror=format-security -fcf-protection -fdebug-prefix-map=/build/r-base-EawLoD/r-base-4.4.1=/usr/src/r-base-4.4.1-1.2404.0 -Wdate-time -D_FORTIFY_SOURCE=3 -c vendor/uuid/unpack.c -o vendor/uuid/unpack.o gcc -I"/usr/share/R/include" -DNDEBUG -DUSING_R -I. -Ivendor -Ivendor/cigraph/src -Ivendor/cigraph/include -Ivendor/cigraph/vendor -Ivendor/io/parsers -I/usr/include/libxml2 -DHAVE_LIBXML -DNDEBUG -DNTIMER -DNPRINT -DIGRAPH_THREAD_LOCAL= -DPRPACK_IGRAPH_SUPPORT -DHAVE_GFORTRAN=1 -D_GNU_SOURCE=1 -I'/home/omnipath/local/R/4.4-3.20/cpp11/include' -fvisibility=hidden -fpic -g -O2 -fno-omit-frame-pointer -mno-omit-leaf-frame-pointer -ffile-prefix-map=/build/r-base-EawLoD/r-base-4.4.1=. -fstack-protector-strong -fstack-clash-protection -Wformat -Werror=format-security -fcf-protection -fdebug-prefix-map=/build/r-base-EawLoD/r-base-4.4.1=/usr/src/r-base-4.4.1-1.2404.0 -Wdate-time -D_FORTIFY_SOURCE=3 -c vendor/uuid/unparse.c -o vendor/uuid/unparse.o gcc -I"/usr/share/R/include" -DNDEBUG -DUSING_R -I. -Ivendor -Ivendor/cigraph/src -Ivendor/cigraph/include -Ivendor/cigraph/vendor -Ivendor/io/parsers -I/usr/include/libxml2 -DHAVE_LIBXML -DNDEBUG -DNTIMER -DNPRINT -DIGRAPH_THREAD_LOCAL= -DPRPACK_IGRAPH_SUPPORT -DHAVE_GFORTRAN=1 -D_GNU_SOURCE=1 -I'/home/omnipath/local/R/4.4-3.20/cpp11/include' -fvisibility=hidden -fpic -g -O2 -fno-omit-frame-pointer -mno-omit-leaf-frame-pointer -ffile-prefix-map=/build/r-base-EawLoD/r-base-4.4.1=. -fstack-protector-strong -fstack-clash-protection -Wformat -Werror=format-security -fcf-protection -fdebug-prefix-map=/build/r-base-EawLoD/r-base-4.4.1=/usr/src/r-base-4.4.1-1.2404.0 -Wdate-time -D_FORTIFY_SOURCE=3 -c vendor/cigraph/vendor/mini-gmp/mini-gmp.c -o vendor/cigraph/vendor/mini-gmp/mini-gmp.o g++ -std=gnu++17 -shared -L/usr/lib/R/lib -Wl,-Bsymbolic-functions -flto=auto -ffat-lto-objects -Wl,-z,relro -o igraph.so cpp11.o cpprinterface.o init.o lazyeval.o rinterface.o rinterface_extra.o rrandom.o simpleraytracer.o vendor/arpack/dgetv0.o vendor/arpack/dlaqrb.o vendor/arpack/dmout.o vendor/arpack/dnaitr.o vendor/arpack/dnapps.o vendor/arpack/dnaup2.o vendor/arpack/dnaupd.o vendor/arpack/dnconv.o vendor/arpack/dneigh.o vendor/arpack/dneupd.o vendor/arpack/dngets.o vendor/arpack/dsaitr.o vendor/arpack/dsapps.o vendor/arpack/dsaup2.o vendor/arpack/dsaupd.o vendor/arpack/dsconv.o vendor/arpack/dseigt.o vendor/arpack/dsesrt.o vendor/arpack/dseupd.o vendor/arpack/dsgets.o vendor/arpack/dsortc.o vendor/arpack/dsortr.o vendor/arpack/dstatn.o vendor/arpack/dstats.o vendor/arpack/dstqrb.o vendor/arpack/dvout.o vendor/arpack/ivout.o vendor/arpack/second.o vendor/arpack/wrap.o vendor/cigraph/src/centrality/betweenness.o vendor/cigraph/src/centrality/centrality_other.o vendor/cigraph/src/centrality/centralization.o vendor/cigraph/src/centrality/closeness.o vendor/cigraph/src/centrality/coreness.o vendor/cigraph/src/centrality/eigenvector.o vendor/cigraph/src/centrality/hub_authority.o vendor/cigraph/src/centrality/pagerank.o vendor/cigraph/src/centrality/prpack.o vendor/cigraph/src/centrality/prpack/prpack_base_graph.o vendor/cigraph/src/centrality/prpack/prpack_igraph_graph.o vendor/cigraph/src/centrality/prpack/prpack_preprocessed_ge_graph.o vendor/cigraph/src/centrality/prpack/prpack_preprocessed_gs_graph.o vendor/cigraph/src/centrality/prpack/prpack_preprocessed_scc_graph.o vendor/cigraph/src/centrality/prpack/prpack_preprocessed_schur_graph.o vendor/cigraph/src/centrality/prpack/prpack_result.o vendor/cigraph/src/centrality/prpack/prpack_solver.o vendor/cigraph/src/centrality/prpack/prpack_utils.o vendor/cigraph/src/centrality/truss.o vendor/cigraph/src/cliques/cliquer/cliquer.o vendor/cigraph/src/cliques/cliquer/cliquer_graph.o vendor/cigraph/src/cliques/cliquer/reorder.o vendor/cigraph/src/cliques/cliquer_wrapper.o vendor/cigraph/src/cliques/cliques.o vendor/cigraph/src/cliques/glet.o vendor/cigraph/src/cliques/maximal_cliques.o vendor/cigraph/src/community/community_misc.o vendor/cigraph/src/community/edge_betweenness.o vendor/cigraph/src/community/fast_modularity.o vendor/cigraph/src/community/fluid.o vendor/cigraph/src/community/infomap/infomap.o vendor/cigraph/src/community/infomap/infomap_FlowGraph.o vendor/cigraph/src/community/infomap/infomap_Greedy.o vendor/cigraph/src/community/label_propagation.o vendor/cigraph/src/community/leading_eigenvector.o vendor/cigraph/src/community/leiden.o vendor/cigraph/src/community/louvain.o vendor/cigraph/src/community/modularity.o vendor/cigraph/src/community/optimal_modularity.o vendor/cigraph/src/community/spinglass/NetDataTypes.o vendor/cigraph/src/community/spinglass/NetRoutines.o vendor/cigraph/src/community/spinglass/clustertool.o vendor/cigraph/src/community/spinglass/pottsmodel_2.o vendor/cigraph/src/community/voronoi.o vendor/cigraph/src/community/walktrap/walktrap.o vendor/cigraph/src/community/walktrap/walktrap_communities.o vendor/cigraph/src/community/walktrap/walktrap_graph.o vendor/cigraph/src/community/walktrap/walktrap_heap.o vendor/cigraph/src/connectivity/cohesive_blocks.o vendor/cigraph/src/connectivity/components.o vendor/cigraph/src/connectivity/separators.o vendor/cigraph/src/constructors/adjacency.o vendor/cigraph/src/constructors/atlas.o vendor/cigraph/src/constructors/basic_constructors.o vendor/cigraph/src/constructors/circulant.o vendor/cigraph/src/constructors/de_bruijn.o vendor/cigraph/src/constructors/famous.o vendor/cigraph/src/constructors/full.o vendor/cigraph/src/constructors/generalized_petersen.o vendor/cigraph/src/constructors/kautz.o vendor/cigraph/src/constructors/lattices.o vendor/cigraph/src/constructors/lcf.o vendor/cigraph/src/constructors/linegraph.o vendor/cigraph/src/constructors/prufer.o vendor/cigraph/src/constructors/regular.o vendor/cigraph/src/constructors/trees.o vendor/cigraph/src/core/array.o vendor/cigraph/src/core/buckets.o vendor/cigraph/src/core/cutheap.o vendor/cigraph/src/core/dqueue.o vendor/cigraph/src/core/error.o vendor/cigraph/src/core/estack.o vendor/cigraph/src/core/fixed_vectorlist.o vendor/cigraph/src/core/genheap.o vendor/cigraph/src/core/grid.o vendor/cigraph/src/core/heap.o vendor/cigraph/src/core/indheap.o vendor/cigraph/src/core/interruption.o vendor/cigraph/src/core/marked_queue.o vendor/cigraph/src/core/matrix.o vendor/cigraph/src/core/matrix_list.o vendor/cigraph/src/core/memory.o vendor/cigraph/src/core/printing.o vendor/cigraph/src/core/progress.o vendor/cigraph/src/core/psumtree.o vendor/cigraph/src/core/set.o vendor/cigraph/src/core/sparsemat.o vendor/cigraph/src/core/stack.o vendor/cigraph/src/core/statusbar.o vendor/cigraph/src/core/strvector.o vendor/cigraph/src/core/trie.o vendor/cigraph/src/core/vector.o vendor/cigraph/src/core/vector_list.o vendor/cigraph/src/core/vector_ptr.o vendor/cigraph/src/flow/flow.o vendor/cigraph/src/flow/flow_conversion.o vendor/cigraph/src/flow/st-cuts.o vendor/cigraph/src/games/barabasi.o vendor/cigraph/src/games/callaway_traits.o vendor/cigraph/src/games/citations.o vendor/cigraph/src/games/correlated.o vendor/cigraph/src/games/degree_sequence.o vendor/cigraph/src/games/degree_sequence_vl/gengraph_degree_sequence.o vendor/cigraph/src/games/degree_sequence_vl/gengraph_graph_molloy_hash.o vendor/cigraph/src/games/degree_sequence_vl/gengraph_graph_molloy_optimized.o vendor/cigraph/src/games/degree_sequence_vl/gengraph_mr-connected.o vendor/cigraph/src/games/degree_sequence_vl/gengraph_random.o vendor/cigraph/src/games/dotproduct.o vendor/cigraph/src/games/erdos_renyi.o vendor/cigraph/src/games/establishment.o vendor/cigraph/src/games/forestfire.o vendor/cigraph/src/games/grg.o vendor/cigraph/src/games/growing_random.o vendor/cigraph/src/games/islands.o vendor/cigraph/src/games/k_regular.o vendor/cigraph/src/games/preference.o vendor/cigraph/src/games/recent_degree.o vendor/cigraph/src/games/sbm.o vendor/cigraph/src/games/static_fitness.o vendor/cigraph/src/games/tree.o vendor/cigraph/src/games/watts_strogatz.o vendor/cigraph/src/graph/adjlist.o vendor/cigraph/src/graph/attributes.o vendor/cigraph/src/graph/basic_query.o vendor/cigraph/src/graph/caching.o vendor/cigraph/src/graph/cattributes.o vendor/cigraph/src/graph/graph_list.o vendor/cigraph/src/graph/iterators.o vendor/cigraph/src/graph/type_common.o vendor/cigraph/src/graph/type_indexededgelist.o vendor/cigraph/src/graph/visitors.o vendor/cigraph/src/hrg/hrg.o vendor/cigraph/src/hrg/hrg_types.o vendor/cigraph/src/internal/glpk_support.o vendor/cigraph/src/internal/hacks.o vendor/cigraph/src/internal/lsap.o vendor/cigraph/src/internal/qsort.o vendor/cigraph/src/internal/qsort_r.o vendor/cigraph/src/internal/utils.o vendor/cigraph/src/internal/zeroin.o vendor/cigraph/src/io/dimacs.o vendor/cigraph/src/io/dl.o vendor/cigraph/src/io/dot.o vendor/cigraph/src/io/edgelist.o vendor/cigraph/src/io/gml-tree.o vendor/cigraph/src/io/gml.o vendor/cigraph/src/io/graphdb.o vendor/cigraph/src/io/graphml.o vendor/cigraph/src/io/leda.o vendor/cigraph/src/io/lgl.o vendor/cigraph/src/io/ncol.o vendor/cigraph/src/io/pajek.o vendor/cigraph/src/io/parse_utils.o vendor/cigraph/src/isomorphism/bliss.o vendor/cigraph/src/isomorphism/bliss/defs.o vendor/cigraph/src/isomorphism/bliss/graph.o vendor/cigraph/src/isomorphism/bliss/heap.o vendor/cigraph/src/isomorphism/bliss/orbit.o vendor/cigraph/src/isomorphism/bliss/partition.o vendor/cigraph/src/isomorphism/bliss/uintseqhash.o vendor/cigraph/src/isomorphism/bliss/utils.o vendor/cigraph/src/isomorphism/isoclasses.o vendor/cigraph/src/isomorphism/isomorphism_misc.o vendor/cigraph/src/isomorphism/lad.o vendor/cigraph/src/isomorphism/queries.o vendor/cigraph/src/isomorphism/vf2.o vendor/cigraph/src/layout/circular.o vendor/cigraph/src/layout/davidson_harel.o vendor/cigraph/src/layout/drl/DensityGrid.o vendor/cigraph/src/layout/drl/DensityGrid_3d.o vendor/cigraph/src/layout/drl/drl_graph.o vendor/cigraph/src/layout/drl/drl_graph_3d.o vendor/cigraph/src/layout/drl/drl_layout.o vendor/cigraph/src/layout/drl/drl_layout_3d.o vendor/cigraph/src/layout/drl/drl_parse.o vendor/cigraph/src/layout/fruchterman_reingold.o vendor/cigraph/src/layout/gem.o vendor/cigraph/src/layout/graphopt.o vendor/cigraph/src/layout/kamada_kawai.o vendor/cigraph/src/layout/large_graph.o vendor/cigraph/src/layout/layout_bipartite.o vendor/cigraph/src/layout/layout_grid.o vendor/cigraph/src/layout/layout_random.o vendor/cigraph/src/layout/mds.o vendor/cigraph/src/layout/merge_dla.o vendor/cigraph/src/layout/merge_grid.o vendor/cigraph/src/layout/reingold_tilford.o vendor/cigraph/src/layout/sugiyama.o vendor/cigraph/src/layout/umap.o vendor/cigraph/src/linalg/arpack.o vendor/cigraph/src/linalg/blas.o vendor/cigraph/src/linalg/eigen.o vendor/cigraph/src/linalg/lapack.o vendor/cigraph/src/math/complex.o vendor/cigraph/src/math/safe_intop.o vendor/cigraph/src/math/utils.o vendor/cigraph/src/misc/bipartite.o vendor/cigraph/src/misc/chordality.o vendor/cigraph/src/misc/cocitation.o vendor/cigraph/src/misc/coloring.o vendor/cigraph/src/misc/conversion.o vendor/cigraph/src/misc/cycle_bases.o vendor/cigraph/src/misc/degree_sequence.o vendor/cigraph/src/misc/embedding.o vendor/cigraph/src/misc/feedback_arc_set.o vendor/cigraph/src/misc/graphicality.o vendor/cigraph/src/misc/matching.o vendor/cigraph/src/misc/microscopic_update.o vendor/cigraph/src/misc/mixing.o vendor/cigraph/src/misc/motifs.o vendor/cigraph/src/misc/order_cycle.o vendor/cigraph/src/misc/other.o vendor/cigraph/src/misc/power_law_fit.o vendor/cigraph/src/misc/scan.o vendor/cigraph/src/misc/sir.o vendor/cigraph/src/misc/spanning_trees.o vendor/cigraph/src/operators/add_edge.o vendor/cigraph/src/operators/complementer.o vendor/cigraph/src/operators/compose.o vendor/cigraph/src/operators/connect_neighborhood.o vendor/cigraph/src/operators/contract.o vendor/cigraph/src/operators/difference.o vendor/cigraph/src/operators/disjoint_union.o vendor/cigraph/src/operators/intersection.o vendor/cigraph/src/operators/join.o vendor/cigraph/src/operators/misc_internal.o vendor/cigraph/src/operators/permute.o vendor/cigraph/src/operators/reverse.o vendor/cigraph/src/operators/rewire.o vendor/cigraph/src/operators/rewire_edges.o vendor/cigraph/src/operators/simplify.o vendor/cigraph/src/operators/subgraph.o vendor/cigraph/src/operators/union.o vendor/cigraph/src/paths/all_shortest_paths.o vendor/cigraph/src/paths/astar.o vendor/cigraph/src/paths/bellman_ford.o vendor/cigraph/src/paths/dijkstra.o vendor/cigraph/src/paths/distances.o vendor/cigraph/src/paths/eulerian.o vendor/cigraph/src/paths/floyd_warshall.o vendor/cigraph/src/paths/histogram.o vendor/cigraph/src/paths/johnson.o vendor/cigraph/src/paths/random_walk.o vendor/cigraph/src/paths/shortest_paths.o vendor/cigraph/src/paths/simple_paths.o vendor/cigraph/src/paths/sparsifier.o vendor/cigraph/src/paths/unweighted.o vendor/cigraph/src/paths/voronoi.o vendor/cigraph/src/paths/widest_paths.o vendor/cigraph/src/properties/basic_properties.o vendor/cigraph/src/properties/complete.o vendor/cigraph/src/properties/constraint.o vendor/cigraph/src/properties/convergence_degree.o vendor/cigraph/src/properties/dag.o vendor/cigraph/src/properties/degrees.o vendor/cigraph/src/properties/ecc.o vendor/cigraph/src/properties/girth.o vendor/cigraph/src/properties/loops.o vendor/cigraph/src/properties/multiplicity.o vendor/cigraph/src/properties/neighborhood.o vendor/cigraph/src/properties/perfect.o vendor/cigraph/src/properties/spectral.o vendor/cigraph/src/properties/trees.o vendor/cigraph/src/properties/triangles.o vendor/cigraph/src/random/random.o vendor/cigraph/src/random/rng_glibc2.o vendor/cigraph/src/random/rng_mt19937.o vendor/cigraph/src/random/rng_pcg32.o vendor/cigraph/src/random/rng_pcg64.o vendor/cigraph/src/version.o vendor/cigraph/vendor/cs/cs_add.o vendor/cigraph/vendor/cs/cs_amd.o vendor/cigraph/vendor/cs/cs_chol.o vendor/cigraph/vendor/cs/cs_cholsol.o vendor/cigraph/vendor/cs/cs_compress.o vendor/cigraph/vendor/cs/cs_counts.o vendor/cigraph/vendor/cs/cs_cumsum.o vendor/cigraph/vendor/cs/cs_dfs.o vendor/cigraph/vendor/cs/cs_dmperm.o vendor/cigraph/vendor/cs/cs_droptol.o vendor/cigraph/vendor/cs/cs_dropzeros.o vendor/cigraph/vendor/cs/cs_dupl.o vendor/cigraph/vendor/cs/cs_entry.o vendor/cigraph/vendor/cs/cs_ereach.o vendor/cigraph/vendor/cs/cs_etree.o vendor/cigraph/vendor/cs/cs_fkeep.o vendor/cigraph/vendor/cs/cs_gaxpy.o vendor/cigraph/vendor/cs/cs_happly.o vendor/cigraph/vendor/cs/cs_house.o vendor/cigraph/vendor/cs/cs_ipvec.o vendor/cigraph/vendor/cs/cs_leaf.o vendor/cigraph/vendor/cs/cs_load.o vendor/cigraph/vendor/cs/cs_lsolve.o vendor/cigraph/vendor/cs/cs_ltsolve.o vendor/cigraph/vendor/cs/cs_lu.o vendor/cigraph/vendor/cs/cs_lusol.o vendor/cigraph/vendor/cs/cs_malloc.o vendor/cigraph/vendor/cs/cs_maxtrans.o vendor/cigraph/vendor/cs/cs_multiply.o vendor/cigraph/vendor/cs/cs_norm.o vendor/cigraph/vendor/cs/cs_permute.o vendor/cigraph/vendor/cs/cs_pinv.o vendor/cigraph/vendor/cs/cs_post.o vendor/cigraph/vendor/cs/cs_print.o vendor/cigraph/vendor/cs/cs_pvec.o vendor/cigraph/vendor/cs/cs_qr.o vendor/cigraph/vendor/cs/cs_qrsol.o vendor/cigraph/vendor/cs/cs_randperm.o vendor/cigraph/vendor/cs/cs_reach.o vendor/cigraph/vendor/cs/cs_scatter.o vendor/cigraph/vendor/cs/cs_scc.o vendor/cigraph/vendor/cs/cs_schol.o vendor/cigraph/vendor/cs/cs_spsolve.o vendor/cigraph/vendor/cs/cs_sqr.o vendor/cigraph/vendor/cs/cs_symperm.o vendor/cigraph/vendor/cs/cs_tdfs.o vendor/cigraph/vendor/cs/cs_transpose.o vendor/cigraph/vendor/cs/cs_updown.o vendor/cigraph/vendor/cs/cs_usolve.o vendor/cigraph/vendor/cs/cs_util.o vendor/cigraph/vendor/cs/cs_utsolve.o vendor/cigraph/vendor/pcg/pcg-advance-128.o vendor/cigraph/vendor/pcg/pcg-advance-64.o vendor/cigraph/vendor/pcg/pcg-output-128.o vendor/cigraph/vendor/pcg/pcg-output-32.o vendor/cigraph/vendor/pcg/pcg-output-64.o vendor/cigraph/vendor/pcg/pcg-rngs-128.o vendor/cigraph/vendor/pcg/pcg-rngs-64.o vendor/cigraph/vendor/plfit/gss.o vendor/cigraph/vendor/plfit/hzeta.o vendor/cigraph/vendor/plfit/kolmogorov.o vendor/cigraph/vendor/plfit/lbfgs.o vendor/cigraph/vendor/plfit/mt.o vendor/cigraph/vendor/plfit/options.o vendor/cigraph/vendor/plfit/platform.o vendor/cigraph/vendor/plfit/plfit.o vendor/cigraph/vendor/plfit/plfit_error.o vendor/cigraph/vendor/plfit/rbinom.o vendor/cigraph/vendor/plfit/sampling.o vendor/io/dl-lexer.o vendor/io/dl-parser.o vendor/io/gml-lexer.o vendor/io/gml-parser.o vendor/io/lgl-lexer.o vendor/io/lgl-parser.o vendor/io/ncol-lexer.o vendor/io/ncol-parser.o vendor/io/pajek-lexer.o vendor/io/pajek-parser.o vendor/simpleraytracer/Color.o vendor/simpleraytracer/Light.o vendor/simpleraytracer/Point.o vendor/simpleraytracer/Ray.o vendor/simpleraytracer/RayTracer.o vendor/simpleraytracer/RayVector.o vendor/simpleraytracer/Shape.o vendor/simpleraytracer/Sphere.o vendor/simpleraytracer/Triangle.o vendor/simpleraytracer/unit_limiter.o vendor/uuid/R.o vendor/uuid/clear.o vendor/uuid/compare.o vendor/uuid/copy.o vendor/uuid/gen_uuid.o vendor/uuid/isnull.o vendor/uuid/pack.o vendor/uuid/parse.o vendor/uuid/unpack.o vendor/uuid/unparse.o vendor/cigraph/vendor/mini-gmp/mini-gmp.o -lxml2 -lglpk -llapack -lblas -lgfortran -lm -lquadmath -L/usr/lib/R/lib -lR installing to /home/omnipath/local/R/4.4-3.20/00LOCK-igraph/00new/igraph/libs ** R ** demo ** inst ** byte-compile and prepare package for lazy loading ** help *** installing help indices *** copying figures ** building package indices ** installing vignettes ** testing if installed package can be loaded from temporary location ** 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 (igraph) * installing *source* package ‘lpSolve’ ... ** package ‘lpSolve’ successfully unpacked and MD5 sums checked ** using staged installation ** libs using C compiler: ‘gcc (Ubuntu 13.2.0-23ubuntu4) 13.2.0’ gcc -I"/usr/share/R/include" -DNDEBUG -I . -DINTEGERTIME -DPARSER_LP -DBUILDING_FOR_R -DYY_NEVER_INTERACTIVE -DUSRDLL -DCLOCKTIME -DRoleIsExternalInvEngine -DINVERSE_ACTIVE=INVERSE_LUSOL -DINLINE=static -DParanoia -fpic -g -O2 -fno-omit-frame-pointer -mno-omit-leaf-frame-pointer -ffile-prefix-map=/build/r-base-EawLoD/r-base-4.4.1=. -fstack-protector-strong -fstack-clash-protection -Wformat -Werror=format-security -fcf-protection -fdebug-prefix-map=/build/r-base-EawLoD/r-base-4.4.1=/usr/src/r-base-4.4.1-1.2404.0 -Wdate-time -D_FORTIFY_SOURCE=3 -c colamd.c -o colamd.o gcc -I"/usr/share/R/include" -DNDEBUG -I . -DINTEGERTIME -DPARSER_LP -DBUILDING_FOR_R -DYY_NEVER_INTERACTIVE -DUSRDLL -DCLOCKTIME -DRoleIsExternalInvEngine -DINVERSE_ACTIVE=INVERSE_LUSOL -DINLINE=static -DParanoia -fpic -g -O2 -fno-omit-frame-pointer -mno-omit-leaf-frame-pointer -ffile-prefix-map=/build/r-base-EawLoD/r-base-4.4.1=. -fstack-protector-strong -fstack-clash-protection -Wformat -Werror=format-security -fcf-protection -fdebug-prefix-map=/build/r-base-EawLoD/r-base-4.4.1=/usr/src/r-base-4.4.1-1.2404.0 -Wdate-time -D_FORTIFY_SOURCE=3 -c commonlib.c -o commonlib.o gcc -I"/usr/share/R/include" -DNDEBUG -I . -DINTEGERTIME -DPARSER_LP -DBUILDING_FOR_R -DYY_NEVER_INTERACTIVE -DUSRDLL -DCLOCKTIME -DRoleIsExternalInvEngine -DINVERSE_ACTIVE=INVERSE_LUSOL -DINLINE=static -DParanoia -fpic -g -O2 -fno-omit-frame-pointer -mno-omit-leaf-frame-pointer -ffile-prefix-map=/build/r-base-EawLoD/r-base-4.4.1=. -fstack-protector-strong -fstack-clash-protection -Wformat -Werror=format-security -fcf-protection -fdebug-prefix-map=/build/r-base-EawLoD/r-base-4.4.1=/usr/src/r-base-4.4.1-1.2404.0 -Wdate-time -D_FORTIFY_SOURCE=3 -c hbio.c -o hbio.o gcc -I"/usr/share/R/include" -DNDEBUG -I . -DINTEGERTIME -DPARSER_LP -DBUILDING_FOR_R -DYY_NEVER_INTERACTIVE -DUSRDLL -DCLOCKTIME -DRoleIsExternalInvEngine -DINVERSE_ACTIVE=INVERSE_LUSOL -DINLINE=static -DParanoia -fpic -g -O2 -fno-omit-frame-pointer -mno-omit-leaf-frame-pointer -ffile-prefix-map=/build/r-base-EawLoD/r-base-4.4.1=. -fstack-protector-strong -fstack-clash-protection -Wformat -Werror=format-security -fcf-protection -fdebug-prefix-map=/build/r-base-EawLoD/r-base-4.4.1=/usr/src/r-base-4.4.1-1.2404.0 -Wdate-time -D_FORTIFY_SOURCE=3 -c ini.c -o ini.o gcc -I"/usr/share/R/include" -DNDEBUG -I . -DINTEGERTIME -DPARSER_LP -DBUILDING_FOR_R -DYY_NEVER_INTERACTIVE -DUSRDLL -DCLOCKTIME -DRoleIsExternalInvEngine -DINVERSE_ACTIVE=INVERSE_LUSOL -DINLINE=static -DParanoia -fpic -g -O2 -fno-omit-frame-pointer -mno-omit-leaf-frame-pointer -ffile-prefix-map=/build/r-base-EawLoD/r-base-4.4.1=. -fstack-protector-strong -fstack-clash-protection -Wformat -Werror=format-security -fcf-protection -fdebug-prefix-map=/build/r-base-EawLoD/r-base-4.4.1=/usr/src/r-base-4.4.1-1.2404.0 -Wdate-time -D_FORTIFY_SOURCE=3 -c init.c -o init.o gcc -I"/usr/share/R/include" -DNDEBUG -I . -DINTEGERTIME -DPARSER_LP -DBUILDING_FOR_R -DYY_NEVER_INTERACTIVE -DUSRDLL -DCLOCKTIME -DRoleIsExternalInvEngine -DINVERSE_ACTIVE=INVERSE_LUSOL -DINLINE=static -DParanoia -fpic -g -O2 -fno-omit-frame-pointer -mno-omit-leaf-frame-pointer -ffile-prefix-map=/build/r-base-EawLoD/r-base-4.4.1=. -fstack-protector-strong -fstack-clash-protection -Wformat -Werror=format-security -fcf-protection -fdebug-prefix-map=/build/r-base-EawLoD/r-base-4.4.1=/usr/src/r-base-4.4.1-1.2404.0 -Wdate-time -D_FORTIFY_SOURCE=3 -c isfixedvar.c -o isfixedvar.o gcc -I"/usr/share/R/include" -DNDEBUG -I . -DINTEGERTIME -DPARSER_LP -DBUILDING_FOR_R -DYY_NEVER_INTERACTIVE -DUSRDLL -DCLOCKTIME -DRoleIsExternalInvEngine -DINVERSE_ACTIVE=INVERSE_LUSOL -DINLINE=static -DParanoia -fpic -g -O2 -fno-omit-frame-pointer -mno-omit-leaf-frame-pointer -ffile-prefix-map=/build/r-base-EawLoD/r-base-4.4.1=. -fstack-protector-strong -fstack-clash-protection -Wformat -Werror=format-security -fcf-protection -fdebug-prefix-map=/build/r-base-EawLoD/r-base-4.4.1=/usr/src/r-base-4.4.1-1.2404.0 -Wdate-time -D_FORTIFY_SOURCE=3 -c lp_Hash.c -o lp_Hash.o gcc -I"/usr/share/R/include" -DNDEBUG -I . -DINTEGERTIME -DPARSER_LP -DBUILDING_FOR_R -DYY_NEVER_INTERACTIVE -DUSRDLL -DCLOCKTIME -DRoleIsExternalInvEngine -DINVERSE_ACTIVE=INVERSE_LUSOL -DINLINE=static -DParanoia -fpic -g -O2 -fno-omit-frame-pointer -mno-omit-leaf-frame-pointer -ffile-prefix-map=/build/r-base-EawLoD/r-base-4.4.1=. -fstack-protector-strong -fstack-clash-protection -Wformat -Werror=format-security -fcf-protection -fdebug-prefix-map=/build/r-base-EawLoD/r-base-4.4.1=/usr/src/r-base-4.4.1-1.2404.0 -Wdate-time -D_FORTIFY_SOURCE=3 -c lp_LUSOL.c -o lp_LUSOL.o gcc -I"/usr/share/R/include" -DNDEBUG -I . -DINTEGERTIME -DPARSER_LP -DBUILDING_FOR_R -DYY_NEVER_INTERACTIVE -DUSRDLL -DCLOCKTIME -DRoleIsExternalInvEngine -DINVERSE_ACTIVE=INVERSE_LUSOL -DINLINE=static -DParanoia -fpic -g -O2 -fno-omit-frame-pointer -mno-omit-leaf-frame-pointer -ffile-prefix-map=/build/r-base-EawLoD/r-base-4.4.1=. -fstack-protector-strong -fstack-clash-protection -Wformat -Werror=format-security -fcf-protection -fdebug-prefix-map=/build/r-base-EawLoD/r-base-4.4.1=/usr/src/r-base-4.4.1-1.2404.0 -Wdate-time -D_FORTIFY_SOURCE=3 -c lp_MDO.c -o lp_MDO.o gcc -I"/usr/share/R/include" -DNDEBUG -I . -DINTEGERTIME -DPARSER_LP -DBUILDING_FOR_R -DYY_NEVER_INTERACTIVE -DUSRDLL -DCLOCKTIME -DRoleIsExternalInvEngine -DINVERSE_ACTIVE=INVERSE_LUSOL -DINLINE=static -DParanoia -fpic -g -O2 -fno-omit-frame-pointer -mno-omit-leaf-frame-pointer -ffile-prefix-map=/build/r-base-EawLoD/r-base-4.4.1=. -fstack-protector-strong -fstack-clash-protection -Wformat -Werror=format-security -fcf-protection -fdebug-prefix-map=/build/r-base-EawLoD/r-base-4.4.1=/usr/src/r-base-4.4.1-1.2404.0 -Wdate-time -D_FORTIFY_SOURCE=3 -c lp_MPS.c -o lp_MPS.o gcc -I"/usr/share/R/include" -DNDEBUG -I . -DINTEGERTIME -DPARSER_LP -DBUILDING_FOR_R -DYY_NEVER_INTERACTIVE -DUSRDLL -DCLOCKTIME -DRoleIsExternalInvEngine -DINVERSE_ACTIVE=INVERSE_LUSOL -DINLINE=static -DParanoia -fpic -g -O2 -fno-omit-frame-pointer -mno-omit-leaf-frame-pointer -ffile-prefix-map=/build/r-base-EawLoD/r-base-4.4.1=. -fstack-protector-strong -fstack-clash-protection -Wformat -Werror=format-security -fcf-protection -fdebug-prefix-map=/build/r-base-EawLoD/r-base-4.4.1=/usr/src/r-base-4.4.1-1.2404.0 -Wdate-time -D_FORTIFY_SOURCE=3 -c lp_SOS.c -o lp_SOS.o gcc -I"/usr/share/R/include" -DNDEBUG -I . -DINTEGERTIME -DPARSER_LP -DBUILDING_FOR_R -DYY_NEVER_INTERACTIVE -DUSRDLL -DCLOCKTIME -DRoleIsExternalInvEngine -DINVERSE_ACTIVE=INVERSE_LUSOL -DINLINE=static -DParanoia -fpic -g -O2 -fno-omit-frame-pointer -mno-omit-leaf-frame-pointer -ffile-prefix-map=/build/r-base-EawLoD/r-base-4.4.1=. -fstack-protector-strong -fstack-clash-protection -Wformat -Werror=format-security -fcf-protection -fdebug-prefix-map=/build/r-base-EawLoD/r-base-4.4.1=/usr/src/r-base-4.4.1-1.2404.0 -Wdate-time -D_FORTIFY_SOURCE=3 -c lp_crash.c -o lp_crash.o gcc -I"/usr/share/R/include" -DNDEBUG -I . -DINTEGERTIME -DPARSER_LP -DBUILDING_FOR_R -DYY_NEVER_INTERACTIVE -DUSRDLL -DCLOCKTIME -DRoleIsExternalInvEngine -DINVERSE_ACTIVE=INVERSE_LUSOL -DINLINE=static -DParanoia -fpic -g -O2 -fno-omit-frame-pointer -mno-omit-leaf-frame-pointer -ffile-prefix-map=/build/r-base-EawLoD/r-base-4.4.1=. -fstack-protector-strong -fstack-clash-protection -Wformat -Werror=format-security -fcf-protection -fdebug-prefix-map=/build/r-base-EawLoD/r-base-4.4.1=/usr/src/r-base-4.4.1-1.2404.0 -Wdate-time -D_FORTIFY_SOURCE=3 -c lp_lib.c -o lp_lib.o gcc -I"/usr/share/R/include" -DNDEBUG -I . -DINTEGERTIME -DPARSER_LP -DBUILDING_FOR_R -DYY_NEVER_INTERACTIVE -DUSRDLL -DCLOCKTIME -DRoleIsExternalInvEngine -DINVERSE_ACTIVE=INVERSE_LUSOL -DINLINE=static -DParanoia -fpic -g -O2 -fno-omit-frame-pointer -mno-omit-leaf-frame-pointer -ffile-prefix-map=/build/r-base-EawLoD/r-base-4.4.1=. -fstack-protector-strong -fstack-clash-protection -Wformat -Werror=format-security -fcf-protection -fdebug-prefix-map=/build/r-base-EawLoD/r-base-4.4.1=/usr/src/r-base-4.4.1-1.2404.0 -Wdate-time -D_FORTIFY_SOURCE=3 -c lp_matrix.c -o lp_matrix.o gcc -I"/usr/share/R/include" -DNDEBUG -I . -DINTEGERTIME -DPARSER_LP -DBUILDING_FOR_R -DYY_NEVER_INTERACTIVE -DUSRDLL -DCLOCKTIME -DRoleIsExternalInvEngine -DINVERSE_ACTIVE=INVERSE_LUSOL -DINLINE=static -DParanoia -fpic -g -O2 -fno-omit-frame-pointer -mno-omit-leaf-frame-pointer -ffile-prefix-map=/build/r-base-EawLoD/r-base-4.4.1=. -fstack-protector-strong -fstack-clash-protection -Wformat -Werror=format-security -fcf-protection -fdebug-prefix-map=/build/r-base-EawLoD/r-base-4.4.1=/usr/src/r-base-4.4.1-1.2404.0 -Wdate-time -D_FORTIFY_SOURCE=3 -c lp_mipbb.c -o lp_mipbb.o gcc -I"/usr/share/R/include" -DNDEBUG -I . -DINTEGERTIME -DPARSER_LP -DBUILDING_FOR_R -DYY_NEVER_INTERACTIVE -DUSRDLL -DCLOCKTIME -DRoleIsExternalInvEngine -DINVERSE_ACTIVE=INVERSE_LUSOL -DINLINE=static -DParanoia -fpic -g -O2 -fno-omit-frame-pointer -mno-omit-leaf-frame-pointer -ffile-prefix-map=/build/r-base-EawLoD/r-base-4.4.1=. -fstack-protector-strong -fstack-clash-protection -Wformat -Werror=format-security -fcf-protection -fdebug-prefix-map=/build/r-base-EawLoD/r-base-4.4.1=/usr/src/r-base-4.4.1-1.2404.0 -Wdate-time -D_FORTIFY_SOURCE=3 -c lp_params.c -o lp_params.o gcc -I"/usr/share/R/include" -DNDEBUG -I . -DINTEGERTIME -DPARSER_LP -DBUILDING_FOR_R -DYY_NEVER_INTERACTIVE -DUSRDLL -DCLOCKTIME -DRoleIsExternalInvEngine -DINVERSE_ACTIVE=INVERSE_LUSOL -DINLINE=static -DParanoia -fpic -g -O2 -fno-omit-frame-pointer -mno-omit-leaf-frame-pointer -ffile-prefix-map=/build/r-base-EawLoD/r-base-4.4.1=. -fstack-protector-strong -fstack-clash-protection -Wformat -Werror=format-security -fcf-protection -fdebug-prefix-map=/build/r-base-EawLoD/r-base-4.4.1=/usr/src/r-base-4.4.1-1.2404.0 -Wdate-time -D_FORTIFY_SOURCE=3 -c lp_presolve.c -o lp_presolve.o gcc -I"/usr/share/R/include" -DNDEBUG -I . -DINTEGERTIME -DPARSER_LP -DBUILDING_FOR_R -DYY_NEVER_INTERACTIVE -DUSRDLL -DCLOCKTIME -DRoleIsExternalInvEngine -DINVERSE_ACTIVE=INVERSE_LUSOL -DINLINE=static -DParanoia -fpic -g -O2 -fno-omit-frame-pointer -mno-omit-leaf-frame-pointer -ffile-prefix-map=/build/r-base-EawLoD/r-base-4.4.1=. -fstack-protector-strong -fstack-clash-protection -Wformat -Werror=format-security -fcf-protection -fdebug-prefix-map=/build/r-base-EawLoD/r-base-4.4.1=/usr/src/r-base-4.4.1-1.2404.0 -Wdate-time -D_FORTIFY_SOURCE=3 -c lp_price.c -o lp_price.o gcc -I"/usr/share/R/include" -DNDEBUG -I . -DINTEGERTIME -DPARSER_LP -DBUILDING_FOR_R -DYY_NEVER_INTERACTIVE -DUSRDLL -DCLOCKTIME -DRoleIsExternalInvEngine -DINVERSE_ACTIVE=INVERSE_LUSOL -DINLINE=static -DParanoia -fpic -g -O2 -fno-omit-frame-pointer -mno-omit-leaf-frame-pointer -ffile-prefix-map=/build/r-base-EawLoD/r-base-4.4.1=. -fstack-protector-strong -fstack-clash-protection -Wformat -Werror=format-security -fcf-protection -fdebug-prefix-map=/build/r-base-EawLoD/r-base-4.4.1=/usr/src/r-base-4.4.1-1.2404.0 -Wdate-time -D_FORTIFY_SOURCE=3 -c lp_pricePSE.c -o lp_pricePSE.o gcc -I"/usr/share/R/include" -DNDEBUG -I . -DINTEGERTIME -DPARSER_LP -DBUILDING_FOR_R -DYY_NEVER_INTERACTIVE -DUSRDLL -DCLOCKTIME -DRoleIsExternalInvEngine -DINVERSE_ACTIVE=INVERSE_LUSOL -DINLINE=static -DParanoia -fpic -g -O2 -fno-omit-frame-pointer -mno-omit-leaf-frame-pointer -ffile-prefix-map=/build/r-base-EawLoD/r-base-4.4.1=. -fstack-protector-strong -fstack-clash-protection -Wformat -Werror=format-security -fcf-protection -fdebug-prefix-map=/build/r-base-EawLoD/r-base-4.4.1=/usr/src/r-base-4.4.1-1.2404.0 -Wdate-time -D_FORTIFY_SOURCE=3 -c lp_report.c -o lp_report.o gcc -I"/usr/share/R/include" -DNDEBUG -I . -DINTEGERTIME -DPARSER_LP -DBUILDING_FOR_R -DYY_NEVER_INTERACTIVE -DUSRDLL -DCLOCKTIME -DRoleIsExternalInvEngine -DINVERSE_ACTIVE=INVERSE_LUSOL -DINLINE=static -DParanoia -fpic -g -O2 -fno-omit-frame-pointer -mno-omit-leaf-frame-pointer -ffile-prefix-map=/build/r-base-EawLoD/r-base-4.4.1=. -fstack-protector-strong -fstack-clash-protection -Wformat -Werror=format-security -fcf-protection -fdebug-prefix-map=/build/r-base-EawLoD/r-base-4.4.1=/usr/src/r-base-4.4.1-1.2404.0 -Wdate-time -D_FORTIFY_SOURCE=3 -c lp_rlp.c -o lp_rlp.o gcc -I"/usr/share/R/include" -DNDEBUG -I . -DINTEGERTIME -DPARSER_LP -DBUILDING_FOR_R -DYY_NEVER_INTERACTIVE -DUSRDLL -DCLOCKTIME -DRoleIsExternalInvEngine -DINVERSE_ACTIVE=INVERSE_LUSOL -DINLINE=static -DParanoia -fpic -g -O2 -fno-omit-frame-pointer -mno-omit-leaf-frame-pointer -ffile-prefix-map=/build/r-base-EawLoD/r-base-4.4.1=. -fstack-protector-strong -fstack-clash-protection -Wformat -Werror=format-security -fcf-protection -fdebug-prefix-map=/build/r-base-EawLoD/r-base-4.4.1=/usr/src/r-base-4.4.1-1.2404.0 -Wdate-time -D_FORTIFY_SOURCE=3 -c lp_scale.c -o lp_scale.o gcc -I"/usr/share/R/include" -DNDEBUG -I . -DINTEGERTIME -DPARSER_LP -DBUILDING_FOR_R -DYY_NEVER_INTERACTIVE -DUSRDLL -DCLOCKTIME -DRoleIsExternalInvEngine -DINVERSE_ACTIVE=INVERSE_LUSOL -DINLINE=static -DParanoia -fpic -g -O2 -fno-omit-frame-pointer -mno-omit-leaf-frame-pointer -ffile-prefix-map=/build/r-base-EawLoD/r-base-4.4.1=. -fstack-protector-strong -fstack-clash-protection -Wformat -Werror=format-security -fcf-protection -fdebug-prefix-map=/build/r-base-EawLoD/r-base-4.4.1=/usr/src/r-base-4.4.1-1.2404.0 -Wdate-time -D_FORTIFY_SOURCE=3 -c lp_simplex.c -o lp_simplex.o gcc -I"/usr/share/R/include" -DNDEBUG -I . -DINTEGERTIME -DPARSER_LP -DBUILDING_FOR_R -DYY_NEVER_INTERACTIVE -DUSRDLL -DCLOCKTIME -DRoleIsExternalInvEngine -DINVERSE_ACTIVE=INVERSE_LUSOL -DINLINE=static -DParanoia -fpic -g -O2 -fno-omit-frame-pointer -mno-omit-leaf-frame-pointer -ffile-prefix-map=/build/r-base-EawLoD/r-base-4.4.1=. -fstack-protector-strong -fstack-clash-protection -Wformat -Werror=format-security -fcf-protection -fdebug-prefix-map=/build/r-base-EawLoD/r-base-4.4.1=/usr/src/r-base-4.4.1-1.2404.0 -Wdate-time -D_FORTIFY_SOURCE=3 -c lp_utils.c -o lp_utils.o gcc -I"/usr/share/R/include" -DNDEBUG -I . -DINTEGERTIME -DPARSER_LP -DBUILDING_FOR_R -DYY_NEVER_INTERACTIVE -DUSRDLL -DCLOCKTIME -DRoleIsExternalInvEngine -DINVERSE_ACTIVE=INVERSE_LUSOL -DINLINE=static -DParanoia -fpic -g -O2 -fno-omit-frame-pointer -mno-omit-leaf-frame-pointer -ffile-prefix-map=/build/r-base-EawLoD/r-base-4.4.1=. -fstack-protector-strong -fstack-clash-protection -Wformat -Werror=format-security -fcf-protection -fdebug-prefix-map=/build/r-base-EawLoD/r-base-4.4.1=/usr/src/r-base-4.4.1-1.2404.0 -Wdate-time -D_FORTIFY_SOURCE=3 -c lp_wlp.c -o lp_wlp.o gcc -I"/usr/share/R/include" -DNDEBUG -I . -DINTEGERTIME -DPARSER_LP -DBUILDING_FOR_R -DYY_NEVER_INTERACTIVE -DUSRDLL -DCLOCKTIME -DRoleIsExternalInvEngine -DINVERSE_ACTIVE=INVERSE_LUSOL -DINLINE=static -DParanoia -fpic -g -O2 -fno-omit-frame-pointer -mno-omit-leaf-frame-pointer -ffile-prefix-map=/build/r-base-EawLoD/r-base-4.4.1=. -fstack-protector-strong -fstack-clash-protection -Wformat -Werror=format-security -fcf-protection -fdebug-prefix-map=/build/r-base-EawLoD/r-base-4.4.1=/usr/src/r-base-4.4.1-1.2404.0 -Wdate-time -D_FORTIFY_SOURCE=3 -c lpslink56.c -o lpslink56.o gcc -I"/usr/share/R/include" -DNDEBUG -I . -DINTEGERTIME -DPARSER_LP -DBUILDING_FOR_R -DYY_NEVER_INTERACTIVE -DUSRDLL -DCLOCKTIME -DRoleIsExternalInvEngine -DINVERSE_ACTIVE=INVERSE_LUSOL -DINLINE=static -DParanoia -fpic -g -O2 -fno-omit-frame-pointer -mno-omit-leaf-frame-pointer -ffile-prefix-map=/build/r-base-EawLoD/r-base-4.4.1=. -fstack-protector-strong -fstack-clash-protection -Wformat -Werror=format-security -fcf-protection -fdebug-prefix-map=/build/r-base-EawLoD/r-base-4.4.1=/usr/src/r-base-4.4.1-1.2404.0 -Wdate-time -D_FORTIFY_SOURCE=3 -c lusol.c -o lusol.o gcc -I"/usr/share/R/include" -DNDEBUG -I . -DINTEGERTIME -DPARSER_LP -DBUILDING_FOR_R -DYY_NEVER_INTERACTIVE -DUSRDLL -DCLOCKTIME -DRoleIsExternalInvEngine -DINVERSE_ACTIVE=INVERSE_LUSOL -DINLINE=static -DParanoia -fpic -g -O2 -fno-omit-frame-pointer -mno-omit-leaf-frame-pointer -ffile-prefix-map=/build/r-base-EawLoD/r-base-4.4.1=. -fstack-protector-strong -fstack-clash-protection -Wformat -Werror=format-security -fcf-protection -fdebug-prefix-map=/build/r-base-EawLoD/r-base-4.4.1=/usr/src/r-base-4.4.1-1.2404.0 -Wdate-time -D_FORTIFY_SOURCE=3 -c lusolio.c -o lusolio.o gcc -I"/usr/share/R/include" -DNDEBUG -I . -DINTEGERTIME -DPARSER_LP -DBUILDING_FOR_R -DYY_NEVER_INTERACTIVE -DUSRDLL -DCLOCKTIME -DRoleIsExternalInvEngine -DINVERSE_ACTIVE=INVERSE_LUSOL -DINLINE=static -DParanoia -fpic -g -O2 -fno-omit-frame-pointer -mno-omit-leaf-frame-pointer -ffile-prefix-map=/build/r-base-EawLoD/r-base-4.4.1=. -fstack-protector-strong -fstack-clash-protection -Wformat -Werror=format-security -fcf-protection -fdebug-prefix-map=/build/r-base-EawLoD/r-base-4.4.1=/usr/src/r-base-4.4.1-1.2404.0 -Wdate-time -D_FORTIFY_SOURCE=3 -c mmio.c -o mmio.o gcc -I"/usr/share/R/include" -DNDEBUG -I . -DINTEGERTIME -DPARSER_LP -DBUILDING_FOR_R -DYY_NEVER_INTERACTIVE -DUSRDLL -DCLOCKTIME -DRoleIsExternalInvEngine -DINVERSE_ACTIVE=INVERSE_LUSOL -DINLINE=static -DParanoia -fpic -g -O2 -fno-omit-frame-pointer -mno-omit-leaf-frame-pointer -ffile-prefix-map=/build/r-base-EawLoD/r-base-4.4.1=. -fstack-protector-strong -fstack-clash-protection -Wformat -Werror=format-security -fcf-protection -fdebug-prefix-map=/build/r-base-EawLoD/r-base-4.4.1=/usr/src/r-base-4.4.1-1.2404.0 -Wdate-time -D_FORTIFY_SOURCE=3 -c myblas.c -o myblas.o gcc -I"/usr/share/R/include" -DNDEBUG -I . -DINTEGERTIME -DPARSER_LP -DBUILDING_FOR_R -DYY_NEVER_INTERACTIVE -DUSRDLL -DCLOCKTIME -DRoleIsExternalInvEngine -DINVERSE_ACTIVE=INVERSE_LUSOL -DINLINE=static -DParanoia -fpic -g -O2 -fno-omit-frame-pointer -mno-omit-leaf-frame-pointer -ffile-prefix-map=/build/r-base-EawLoD/r-base-4.4.1=. -fstack-protector-strong -fstack-clash-protection -Wformat -Werror=format-security -fcf-protection -fdebug-prefix-map=/build/r-base-EawLoD/r-base-4.4.1=/usr/src/r-base-4.4.1-1.2404.0 -Wdate-time -D_FORTIFY_SOURCE=3 -c sparselib.c -o sparselib.o gcc -I"/usr/share/R/include" -DNDEBUG -I . -DINTEGERTIME -DPARSER_LP -DBUILDING_FOR_R -DYY_NEVER_INTERACTIVE -DUSRDLL -DCLOCKTIME -DRoleIsExternalInvEngine -DINVERSE_ACTIVE=INVERSE_LUSOL -DINLINE=static -DParanoia -fpic -g -O2 -fno-omit-frame-pointer -mno-omit-leaf-frame-pointer -ffile-prefix-map=/build/r-base-EawLoD/r-base-4.4.1=. -fstack-protector-strong -fstack-clash-protection -Wformat -Werror=format-security -fcf-protection -fdebug-prefix-map=/build/r-base-EawLoD/r-base-4.4.1=/usr/src/r-base-4.4.1-1.2404.0 -Wdate-time -D_FORTIFY_SOURCE=3 -c yacc_read.c -o yacc_read.o gcc -shared -L/usr/lib/R/lib -Wl,-Bsymbolic-functions -flto=auto -ffat-lto-objects -Wl,-z,relro -o lpSolve.so colamd.o commonlib.o hbio.o ini.o init.o isfixedvar.o lp_Hash.o lp_LUSOL.o lp_MDO.o lp_MPS.o lp_SOS.o lp_crash.o lp_lib.o lp_matrix.o lp_mipbb.o lp_params.o lp_presolve.o lp_price.o lp_pricePSE.o lp_report.o lp_rlp.o lp_scale.o lp_simplex.o lp_utils.o lp_wlp.o lpslink56.o lusol.o lusolio.o mmio.o myblas.o sparselib.o yacc_read.o -L/usr/lib/R/lib -lR installing to /home/omnipath/local/R/4.4-3.20/00LOCK-lpSolve/00new/lpSolve/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 (lpSolve) * installing *source* package ‘diffobj’ ... ** package ‘diffobj’ successfully unpacked and MD5 sums checked ** using staged installation ** libs using C compiler: ‘gcc (Ubuntu 13.2.0-23ubuntu4) 13.2.0’ gcc -I"/usr/share/R/include" -DNDEBUG -fpic -g -O2 -fno-omit-frame-pointer -mno-omit-leaf-frame-pointer -ffile-prefix-map=/build/r-base-EawLoD/r-base-4.4.1=. -fstack-protector-strong -fstack-clash-protection -Wformat -Werror=format-security -fcf-protection -fdebug-prefix-map=/build/r-base-EawLoD/r-base-4.4.1=/usr/src/r-base-4.4.1-1.2404.0 -Wdate-time -D_FORTIFY_SOURCE=3 -c diff.c -o diff.o gcc -I"/usr/share/R/include" -DNDEBUG -fpic -g -O2 -fno-omit-frame-pointer -mno-omit-leaf-frame-pointer -ffile-prefix-map=/build/r-base-EawLoD/r-base-4.4.1=. -fstack-protector-strong -fstack-clash-protection -Wformat -Werror=format-security -fcf-protection -fdebug-prefix-map=/build/r-base-EawLoD/r-base-4.4.1=/usr/src/r-base-4.4.1-1.2404.0 -Wdate-time -D_FORTIFY_SOURCE=3 -c diffobj.c -o diffobj.o gcc -I"/usr/share/R/include" -DNDEBUG -fpic -g -O2 -fno-omit-frame-pointer -mno-omit-leaf-frame-pointer -ffile-prefix-map=/build/r-base-EawLoD/r-base-4.4.1=. -fstack-protector-strong -fstack-clash-protection -Wformat -Werror=format-security -fcf-protection -fdebug-prefix-map=/build/r-base-EawLoD/r-base-4.4.1=/usr/src/r-base-4.4.1-1.2404.0 -Wdate-time -D_FORTIFY_SOURCE=3 -c init.c -o init.o gcc -shared -L/usr/lib/R/lib -Wl,-Bsymbolic-functions -flto=auto -ffat-lto-objects -Wl,-z,relro -o diffobj.so diff.o diffobj.o init.o -L/usr/lib/R/lib -lR installing to /home/omnipath/local/R/4.4-3.20/00LOCK-diffobj/00new/diffobj/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 (diffobj) * installing *source* package ‘pkgbuild’ ... ** package ‘pkgbuild’ 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 (pkgbuild) * installing *source* package ‘htmltools’ ... ** package ‘htmltools’ successfully unpacked and MD5 sums checked ** using staged installation ** libs using C compiler: ‘gcc (Ubuntu 13.2.0-23ubuntu4) 13.2.0’ gcc -I"/usr/share/R/include" -DNDEBUG -fpic -g -O2 -fno-omit-frame-pointer -mno-omit-leaf-frame-pointer -ffile-prefix-map=/build/r-base-EawLoD/r-base-4.4.1=. -fstack-protector-strong -fstack-clash-protection -Wformat -Werror=format-security -fcf-protection -fdebug-prefix-map=/build/r-base-EawLoD/r-base-4.4.1=/usr/src/r-base-4.4.1-1.2404.0 -Wdate-time -D_FORTIFY_SOURCE=3 -c init.c -o init.o gcc -I"/usr/share/R/include" -DNDEBUG -fpic -g -O2 -fno-omit-frame-pointer -mno-omit-leaf-frame-pointer -ffile-prefix-map=/build/r-base-EawLoD/r-base-4.4.1=. -fstack-protector-strong -fstack-clash-protection -Wformat -Werror=format-security -fcf-protection -fdebug-prefix-map=/build/r-base-EawLoD/r-base-4.4.1=/usr/src/r-base-4.4.1-1.2404.0 -Wdate-time -D_FORTIFY_SOURCE=3 -c template.c -o template.o gcc -shared -L/usr/lib/R/lib -Wl,-Bsymbolic-functions -flto=auto -ffat-lto-objects -Wl,-z,relro -o htmltools.so init.o template.o -L/usr/lib/R/lib -lR installing to /home/omnipath/local/R/4.4-3.20/00LOCK-htmltools/00new/htmltools/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 (htmltools) * installing *source* package ‘progress’ ... ** package ‘progress’ 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 ** 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 (progress) * installing *source* package ‘rex’ ... ** package ‘rex’ successfully unpacked and MD5 sums checked ** using staged installation ** R ** inst ** byte-compile and prepare package for lazy loading ** help *** installing help indices ** building package indices ** installing vignettes ** testing if installed package can be loaded from temporary location ** testing if installed package can be loaded from final location ** testing if installed package keeps a record of temporary installation path * DONE (rex) * installing *source* package ‘bibtex’ ... ** package ‘bibtex’ 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 (bibtex) * installing *source* package ‘lubridate’ ... ** package ‘lubridate’ successfully unpacked and MD5 sums checked ** using staged installation ** libs using C compiler: ‘gcc (Ubuntu 13.2.0-23ubuntu4) 13.2.0’ gcc -I"/usr/share/R/include" -DNDEBUG -fpic -g -O2 -fno-omit-frame-pointer -mno-omit-leaf-frame-pointer -ffile-prefix-map=/build/r-base-EawLoD/r-base-4.4.1=. -fstack-protector-strong -fstack-clash-protection -Wformat -Werror=format-security -fcf-protection -fdebug-prefix-map=/build/r-base-EawLoD/r-base-4.4.1=/usr/src/r-base-4.4.1-1.2404.0 -Wdate-time -D_FORTIFY_SOURCE=3 -c datetime.c -o datetime.o gcc -I"/usr/share/R/include" -DNDEBUG -fpic -g -O2 -fno-omit-frame-pointer -mno-omit-leaf-frame-pointer -ffile-prefix-map=/build/r-base-EawLoD/r-base-4.4.1=. -fstack-protector-strong -fstack-clash-protection -Wformat -Werror=format-security -fcf-protection -fdebug-prefix-map=/build/r-base-EawLoD/r-base-4.4.1=/usr/src/r-base-4.4.1-1.2404.0 -Wdate-time -D_FORTIFY_SOURCE=3 -c init.c -o init.o gcc -I"/usr/share/R/include" -DNDEBUG -fpic -g -O2 -fno-omit-frame-pointer -mno-omit-leaf-frame-pointer -ffile-prefix-map=/build/r-base-EawLoD/r-base-4.4.1=. -fstack-protector-strong -fstack-clash-protection -Wformat -Werror=format-security -fcf-protection -fdebug-prefix-map=/build/r-base-EawLoD/r-base-4.4.1=/usr/src/r-base-4.4.1-1.2404.0 -Wdate-time -D_FORTIFY_SOURCE=3 -c period.c -o period.o gcc -I"/usr/share/R/include" -DNDEBUG -fpic -g -O2 -fno-omit-frame-pointer -mno-omit-leaf-frame-pointer -ffile-prefix-map=/build/r-base-EawLoD/r-base-4.4.1=. -fstack-protector-strong -fstack-clash-protection -Wformat -Werror=format-security -fcf-protection -fdebug-prefix-map=/build/r-base-EawLoD/r-base-4.4.1=/usr/src/r-base-4.4.1-1.2404.0 -Wdate-time -D_FORTIFY_SOURCE=3 -c tparse.c -o tparse.o gcc -I"/usr/share/R/include" -DNDEBUG -fpic -g -O2 -fno-omit-frame-pointer -mno-omit-leaf-frame-pointer -ffile-prefix-map=/build/r-base-EawLoD/r-base-4.4.1=. -fstack-protector-strong -fstack-clash-protection -Wformat -Werror=format-security -fcf-protection -fdebug-prefix-map=/build/r-base-EawLoD/r-base-4.4.1=/usr/src/r-base-4.4.1-1.2404.0 -Wdate-time -D_FORTIFY_SOURCE=3 -c utils.c -o utils.o gcc -shared -L/usr/lib/R/lib -Wl,-Bsymbolic-functions -flto=auto -ffat-lto-objects -Wl,-z,relro -o lubridate.so datetime.o init.o period.o tparse.o utils.o -L/usr/lib/R/lib -lR installing to /home/omnipath/local/R/4.4-3.20/00LOCK-lubridate/00new/lubridate/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 (lubridate) * installing *source* package ‘plyr’ ... ** package ‘plyr’ successfully unpacked and MD5 sums checked ** using staged installation ** libs using C compiler: ‘gcc (Ubuntu 13.2.0-23ubuntu4) 13.2.0’ using C++ compiler: ‘g++ (Ubuntu 13.2.0-23ubuntu4) 13.2.0’ g++ -std=gnu++17 -I"/usr/share/R/include" -DNDEBUG -I'/home/omnipath/local/R/4.4-3.20/Rcpp/include' -fpic -g -O2 -fno-omit-frame-pointer -mno-omit-leaf-frame-pointer -ffile-prefix-map=/build/r-base-EawLoD/r-base-4.4.1=. -fstack-protector-strong -fstack-clash-protection -Wformat -Werror=format-security -fcf-protection -fdebug-prefix-map=/build/r-base-EawLoD/r-base-4.4.1=/usr/src/r-base-4.4.1-1.2404.0 -Wdate-time -D_FORTIFY_SOURCE=3 -c RcppExports.cpp -o RcppExports.o gcc -I"/usr/share/R/include" -DNDEBUG -I'/home/omnipath/local/R/4.4-3.20/Rcpp/include' -fpic -g -O2 -fno-omit-frame-pointer -mno-omit-leaf-frame-pointer -ffile-prefix-map=/build/r-base-EawLoD/r-base-4.4.1=. -fstack-protector-strong -fstack-clash-protection -Wformat -Werror=format-security -fcf-protection -fdebug-prefix-map=/build/r-base-EawLoD/r-base-4.4.1=/usr/src/r-base-4.4.1-1.2404.0 -Wdate-time -D_FORTIFY_SOURCE=3 -c loop_apply.c -o loop_apply.o g++ -std=gnu++17 -I"/usr/share/R/include" -DNDEBUG -I'/home/omnipath/local/R/4.4-3.20/Rcpp/include' -fpic -g -O2 -fno-omit-frame-pointer -mno-omit-leaf-frame-pointer -ffile-prefix-map=/build/r-base-EawLoD/r-base-4.4.1=. -fstack-protector-strong -fstack-clash-protection -Wformat -Werror=format-security -fcf-protection -fdebug-prefix-map=/build/r-base-EawLoD/r-base-4.4.1=/usr/src/r-base-4.4.1-1.2404.0 -Wdate-time -D_FORTIFY_SOURCE=3 -c split-numeric.cpp -o split-numeric.o g++ -std=gnu++17 -shared -L/usr/lib/R/lib -Wl,-Bsymbolic-functions -flto=auto -ffat-lto-objects -Wl,-z,relro -o plyr.so RcppExports.o loop_apply.o split-numeric.o -L/usr/lib/R/lib -lR installing to /home/omnipath/local/R/4.4-3.20/00LOCK-plyr/00new/plyr/libs ** R ** data *** moving datasets to lazyload DB ** inst ** byte-compile and prepare package for lazy loading ** help *** installing help indices ** building package indices ** testing if installed package can be loaded from temporary location ** checking absolute paths in shared objects and dynamic libraries ** testing if installed package can be loaded from final location ** testing if installed package keeps a record of temporary installation path * DONE (plyr) * installing *source* package ‘sass’ ... ** package ‘sass’ successfully unpacked and MD5 sums checked ** using staged installation ** libs /usr/share/R/share/make/shlib.mk:18: warning: overriding recipe for target 'shlib-clean' Makevars:12: warning: ignoring old recipe for target 'shlib-clean' using C compiler: ‘gcc (Ubuntu 13.2.0-23ubuntu4) 13.2.0’ using C++ compiler: ‘g++ (Ubuntu 13.2.0-23ubuntu4) 13.2.0’ /usr/share/R/share/make/shlib.mk:18: warning: overriding recipe for target 'shlib-clean' Makevars:12: warning: ignoring old recipe for target 'shlib-clean' gcc -I"/usr/share/R/include" -DNDEBUG -I./libsass/include -fpic -g -O2 -fno-omit-frame-pointer -mno-omit-leaf-frame-pointer -ffile-prefix-map=/build/r-base-EawLoD/r-base-4.4.1=. -fstack-protector-strong -fstack-clash-protection -Wformat -Werror=format-security -fcf-protection -fdebug-prefix-map=/build/r-base-EawLoD/r-base-4.4.1=/usr/src/r-base-4.4.1-1.2404.0 -Wdate-time -D_FORTIFY_SOURCE=3 -c compile.c -o compile.o g++ -std=gnu++17 -I"/usr/share/R/include" -DNDEBUG -I./libsass/include -fpic -g -O2 -fno-omit-frame-pointer -mno-omit-leaf-frame-pointer -ffile-prefix-map=/build/r-base-EawLoD/r-base-4.4.1=. -fstack-protector-strong -fstack-clash-protection -Wformat -Werror=format-security -fcf-protection -fdebug-prefix-map=/build/r-base-EawLoD/r-base-4.4.1=/usr/src/r-base-4.4.1-1.2404.0 -Wdate-time -D_FORTIFY_SOURCE=3 -c init.cpp -o init.o MAKEFLAGS= CC="gcc" CFLAGS="-g -O2 -fno-omit-frame-pointer -mno-omit-leaf-frame-pointer -ffile-prefix-map=/build/r-base-EawLoD/r-base-4.4.1=. -fstack-protector-strong -fstack-clash-protection -Wformat -Werror=format-security -fcf-protection -fdebug-prefix-map=/build/r-base-EawLoD/r-base-4.4.1=/usr/src/r-base-4.4.1-1.2404.0 -Wdate-time -D_FORTIFY_SOURCE=3 " CXX="g++ -std=gnu++17" AR="ar" LDFLAGS="-Wl,-Bsymbolic-functions -flto=auto -ffat-lto-objects -Wl,-z,relro" make -C libsass make[1]: Entering directory '/tmp/RtmpUggGWo/R.INSTALL15caa1bc6540/sass/src/libsass' gcc -g -O2 -fno-omit-frame-pointer -mno-omit-leaf-frame-pointer -ffile-prefix-map=/build/r-base-EawLoD/r-base-4.4.1=. -fstack-protector-strong -fstack-clash-protection -Wformat -Werror=format-security -fcf-protection -fdebug-prefix-map=/build/r-base-EawLoD/r-base-4.4.1=/usr/src/r-base-4.4.1-1.2404.0 -Wdate-time -D_FORTIFY_SOURCE=3 -O2 -I ./include -fPIC -c -o src/cencode.o src/cencode.c g++ -std=gnu++17 -Wall -O2 -std=c++11 -I ./include -fPIC -c -o src/ast.o src/ast.cpp In file included from src/ast.cpp:5: src/ast.hpp:90:18: warning: ‘virtual bool Sass::AST_Node::operator==(const Sass::AST_Node&) const’ was hidden [-Woverloaded-virtual=] 90 | virtual bool operator== (const AST_Node& rhs) const { | ^~~~~~~~ src/ast.hpp:165:18: note: by ‘virtual bool Sass::Expression::operator==(const Sass::Expression&) const’ 165 | virtual bool operator== (const Expression& rhs) const { return false; } | ^~~~~~~~ src/ast.hpp:96:18: warning: ‘virtual bool Sass::AST_Node::operator!=(const Sass::AST_Node&) const’ was hidden [-Woverloaded-virtual=] 96 | virtual bool operator!= (const AST_Node& rhs) const { | ^~~~~~~~ src/ast.hpp:167:17: note: by ‘bool Sass::Expression::operator!=(const Sass::Expression&) const’ 167 | inline bool operator!=(const Expression& rhs) const { return !(rhs == *this); } | ^~~~~~~~ src/ast.hpp:90:18: warning: ‘virtual bool Sass::AST_Node::operator==(const Sass::AST_Node&) const’ was hidden [-Woverloaded-virtual=] 90 | virtual bool operator== (const AST_Node& rhs) const { | ^~~~~~~~ src/ast.hpp:908:10: note: by ‘bool Sass::CssMediaRule::operator==(const Sass::CssMediaRule&) const’ 908 | bool operator== (const CssMediaRule& rhs) const { | ^~~~~~~~ src/ast.hpp:96:18: warning: ‘virtual bool Sass::AST_Node::operator!=(const Sass::AST_Node&) const’ was hidden [-Woverloaded-virtual=] 96 | virtual bool operator!= (const AST_Node& rhs) const { | ^~~~~~~~ src/ast.hpp:911:10: note: by ‘bool Sass::CssMediaRule::operator!=(const Sass::CssMediaRule&) const’ 911 | bool operator!=(const CssMediaRule& rhs) const { | ^~~~~~~~ src/ast.hpp:90:18: warning: ‘virtual bool Sass::AST_Node::operator==(const Sass::AST_Node&) const’ was hidden [-Woverloaded-virtual=] 90 | virtual bool operator== (const AST_Node& rhs) const { | ^~~~~~~~ src/ast.hpp:939:10: note: by ‘bool Sass::CssMediaQuery::operator==(const Sass::CssMediaQuery&) const’ 939 | bool operator== (const CssMediaQuery& rhs) const; | ^~~~~~~~ src/ast.hpp:96:18: warning: ‘virtual bool Sass::AST_Node::operator!=(const Sass::AST_Node&) const’ was hidden [-Woverloaded-virtual=] 96 | virtual bool operator!= (const AST_Node& rhs) const { | ^~~~~~~~ src/ast.hpp:940:10: note: by ‘bool Sass::CssMediaQuery::operator!=(const Sass::CssMediaQuery&) const’ 940 | bool operator!=(const CssMediaQuery& rhs) const { | ^~~~~~~~ src/ast.hpp:165:18: warning: ‘virtual bool Sass::Expression::operator==(const Sass::Expression&) const’ was hidden [-Woverloaded-virtual=] 165 | virtual bool operator== (const Expression& rhs) const { return false; } | ^~~~~~~~ In file included from src/ast.hpp:14: src/ast_def_macros.hpp:105:16: note: by ‘virtual bool Sass::Selector::operator==(const Sass::Selector&) const’ 105 | virtual bool operator==(const klass& rhs) const = 0; \ | ^~~~~~~~ src/ast_selectors.hpp:56:5: note: in expansion of macro ‘ATTACH_VIRTUAL_CMP_OPERATIONS’ 56 | ATTACH_VIRTUAL_CMP_OPERATIONS(Selector) | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~ src/ast.hpp:96:18: warning: ‘virtual bool Sass::AST_Node::operator!=(const Sass::AST_Node&) const’ was hidden [-Woverloaded-virtual=] 96 | virtual bool operator!= (const AST_Node& rhs) const { | ^~~~~~~~ src/ast_def_macros.hpp:106:16: note: by ‘virtual bool Sass::Selector::operator!=(const Sass::Selector&) const’ 106 | virtual bool operator!=(const klass& rhs) const { return !(*this == rhs); }; \ | ^~~~~~~~ src/ast_selectors.hpp:56:5: note: in expansion of macro ‘ATTACH_VIRTUAL_CMP_OPERATIONS’ 56 | ATTACH_VIRTUAL_CMP_OPERATIONS(Selector) | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~ src/ast_def_macros.hpp:106:16: warning: ‘virtual bool Sass::Selector::operator!=(const Sass::Selector&) const’ was hidden [-Woverloaded-virtual=] 106 | virtual bool operator!=(const klass& rhs) const { return !(*this == rhs); }; \ | ^~~~~~~~ src/ast_selectors.hpp:56:5: note: in expansion of macro ‘ATTACH_VIRTUAL_CMP_OPERATIONS’ 56 | ATTACH_VIRTUAL_CMP_OPERATIONS(Selector) | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~ src/ast_def_macros.hpp:106:16: note: by ‘virtual bool Sass::SimpleSelector::operator!=(const Sass::SimpleSelector&) const’ 106 | virtual bool operator!=(const klass& rhs) const { return !(*this == rhs); }; \ | ^~~~~~~~ src/ast_selectors.hpp:139:5: note: in expansion of macro ‘ATTACH_VIRTUAL_CMP_OPERATIONS’ 139 | ATTACH_VIRTUAL_CMP_OPERATIONS(SimpleSelector); | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~ In file included from src/ast.hpp:1055: src/ast_selectors.hpp:137:18: warning: ‘virtual bool Sass::SimpleSelector::operator==(const Sass::CompoundSelector&) const’ was hidden [-Woverloaded-virtual=] 137 | virtual bool operator==(const CompoundSelector& rhs) const; | ^~~~~~~~ src/ast_def_macros.hpp:109:16: note: by ‘Sass::PlaceholderSelector::operator==’ 109 | virtual bool operator==(const klass& rhs) const; \ | ^~~~~~~~ src/ast_selectors.hpp:157:5: note: in expansion of macro ‘ATTACH_CMP_OPERATIONS’ 157 | ATTACH_CMP_OPERATIONS(PlaceholderSelector) | ^~~~~~~~~~~~~~~~~~~~~ src/ast_selectors.hpp:136:18: warning: ‘virtual bool Sass::SimpleSelector::operator==(const Sass::ComplexSelector&) const’ was hidden [-Woverloaded-virtual=] 136 | virtual bool operator==(const ComplexSelector& rhs) const; | ^~~~~~~~ src/ast_def_macros.hpp:109:16: note: by ‘Sass::PlaceholderSelector::operator==’ 109 | virtual bool operator==(const klass& rhs) const; \ | ^~~~~~~~ src/ast_selectors.hpp:157:5: note: in expansion of macro ‘ATTACH_CMP_OPERATIONS’ 157 | ATTACH_CMP_OPERATIONS(PlaceholderSelector) | ^~~~~~~~~~~~~~~~~~~~~ src/ast_selectors.hpp:135:18: warning: ‘virtual bool Sass::SimpleSelector::operator==(const Sass::SelectorList&) const’ was hidden [-Woverloaded-virtual=] 135 | virtual bool operator==(const SelectorList& rhs) const; | ^~~~~~~~ src/ast_def_macros.hpp:109:16: note: by ‘Sass::PlaceholderSelector::operator==’ 109 | virtual bool operator==(const klass& rhs) const; \ | ^~~~~~~~ src/ast_selectors.hpp:157:5: note: in expansion of macro ‘ATTACH_CMP_OPERATIONS’ 157 | ATTACH_CMP_OPERATIONS(PlaceholderSelector) | ^~~~~~~~~~~~~~~~~~~~~ src/ast_selectors.hpp:133:10: warning: ‘virtual bool Sass::SimpleSelector::operator==(const Sass::Selector&) const’ was hidden [-Woverloaded-virtual=] 133 | bool operator==(const Selector& rhs) const final override; | ^~~~~~~~ src/ast_def_macros.hpp:109:16: note: by ‘Sass::PlaceholderSelector::operator==’ 109 | virtual bool operator==(const klass& rhs) const; \ | ^~~~~~~~ src/ast_selectors.hpp:157:5: note: in expansion of macro ‘ATTACH_CMP_OPERATIONS’ 157 | ATTACH_CMP_OPERATIONS(PlaceholderSelector) | ^~~~~~~~~~~~~~~~~~~~~ src/ast_def_macros.hpp:106:16: warning: ‘virtual bool Sass::SimpleSelector::operator!=(const Sass::SimpleSelector&) const’ was hidden [-Woverloaded-virtual=] 106 | virtual bool operator!=(const klass& rhs) const { return !(*this == rhs); }; \ | ^~~~~~~~ src/ast_selectors.hpp:139:5: note: in expansion of macro ‘ATTACH_VIRTUAL_CMP_OPERATIONS’ 139 | ATTACH_VIRTUAL_CMP_OPERATIONS(SimpleSelector); | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~ src/ast_def_macros.hpp:110:16: note: by ‘virtual bool Sass::PlaceholderSelector::operator!=(const Sass::PlaceholderSelector&) const’ 110 | virtual bool operator!=(const klass& rhs) const { return !(*this == rhs); }; \ | ^~~~~~~~ src/ast_selectors.hpp:157:5: note: in expansion of macro ‘ATTACH_CMP_OPERATIONS’ 157 | ATTACH_CMP_OPERATIONS(PlaceholderSelector) | ^~~~~~~~~~~~~~~~~~~~~ src/ast_selectors.hpp:137:18: warning: ‘virtual bool Sass::SimpleSelector::operator==(const Sass::CompoundSelector&) const’ was hidden [-Woverloaded-virtual=] 137 | virtual bool operator==(const CompoundSelector& rhs) const; | ^~~~~~~~ src/ast_def_macros.hpp:109:16: note: by ‘Sass::TypeSelector::operator==’ 109 | virtual bool operator==(const klass& rhs) const; \ | ^~~~~~~~ src/ast_selectors.hpp:174:5: note: in expansion of macro ‘ATTACH_CMP_OPERATIONS’ 174 | ATTACH_CMP_OPERATIONS(TypeSelector) | ^~~~~~~~~~~~~~~~~~~~~ src/ast_selectors.hpp:136:18: warning: ‘virtual bool Sass::SimpleSelector::operator==(const Sass::ComplexSelector&) const’ was hidden [-Woverloaded-virtual=] 136 | virtual bool operator==(const ComplexSelector& rhs) const; | ^~~~~~~~ src/ast_def_macros.hpp:109:16: note: by ‘Sass::TypeSelector::operator==’ 109 | virtual bool operator==(const klass& rhs) const; \ | ^~~~~~~~ src/ast_selectors.hpp:174:5: note: in expansion of macro ‘ATTACH_CMP_OPERATIONS’ 174 | ATTACH_CMP_OPERATIONS(TypeSelector) | ^~~~~~~~~~~~~~~~~~~~~ src/ast_selectors.hpp:135:18: warning: ‘virtual bool Sass::SimpleSelector::operator==(const Sass::SelectorList&) const’ was hidden [-Woverloaded-virtual=] 135 | virtual bool operator==(const SelectorList& rhs) const; | ^~~~~~~~ src/ast_def_macros.hpp:109:16: note: by ‘Sass::TypeSelector::operator==’ 109 | virtual bool operator==(const klass& rhs) const; \ | ^~~~~~~~ src/ast_selectors.hpp:174:5: note: in expansion of macro ‘ATTACH_CMP_OPERATIONS’ 174 | ATTACH_CMP_OPERATIONS(TypeSelector) | ^~~~~~~~~~~~~~~~~~~~~ src/ast_selectors.hpp:133:10: warning: ‘virtual bool Sass::SimpleSelector::operator==(const Sass::Selector&) const’ was hidden [-Woverloaded-virtual=] 133 | bool operator==(const Selector& rhs) const final override; | ^~~~~~~~ src/ast_def_macros.hpp:109:16: note: by ‘Sass::TypeSelector::operator==’ 109 | virtual bool operator==(const klass& rhs) const; \ | ^~~~~~~~ src/ast_selectors.hpp:174:5: note: in expansion of macro ‘ATTACH_CMP_OPERATIONS’ 174 | ATTACH_CMP_OPERATIONS(TypeSelector) | ^~~~~~~~~~~~~~~~~~~~~ src/ast_def_macros.hpp:106:16: warning: ‘virtual bool Sass::SimpleSelector::operator!=(const Sass::SimpleSelector&) const’ was hidden [-Woverloaded-virtual=] 106 | virtual bool operator!=(const klass& rhs) const { return !(*this == rhs); }; \ | ^~~~~~~~ src/ast_selectors.hpp:139:5: note: in expansion of macro ‘ATTACH_VIRTUAL_CMP_OPERATIONS’ 139 | ATTACH_VIRTUAL_CMP_OPERATIONS(SimpleSelector); | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~ src/ast_def_macros.hpp:110:16: note: by ‘virtual bool Sass::TypeSelector::operator!=(const Sass::TypeSelector&) const’ 110 | virtual bool operator!=(const klass& rhs) const { return !(*this == rhs); }; \ | ^~~~~~~~ src/ast_selectors.hpp:174:5: note: in expansion of macro ‘ATTACH_CMP_OPERATIONS’ 174 | ATTACH_CMP_OPERATIONS(TypeSelector) | ^~~~~~~~~~~~~~~~~~~~~ src/ast_selectors.hpp:137:18: warning: ‘virtual bool Sass::SimpleSelector::operator==(const Sass::CompoundSelector&) const’ was hidden [-Woverloaded-virtual=] 137 | virtual bool operator==(const CompoundSelector& rhs) const; | ^~~~~~~~ src/ast_def_macros.hpp:109:16: note: by ‘Sass::ClassSelector::operator==’ 109 | virtual bool operator==(const klass& rhs) const; \ | ^~~~~~~~ src/ast_selectors.hpp:188:5: note: in expansion of macro ‘ATTACH_CMP_OPERATIONS’ 188 | ATTACH_CMP_OPERATIONS(ClassSelector) | ^~~~~~~~~~~~~~~~~~~~~ src/ast_selectors.hpp:136:18: warning: ‘virtual bool Sass::SimpleSelector::operator==(const Sass::ComplexSelector&) const’ was hidden [-Woverloaded-virtual=] 136 | virtual bool operator==(const ComplexSelector& rhs) const; | ^~~~~~~~ src/ast_def_macros.hpp:109:16: note: by ‘Sass::ClassSelector::operator==’ 109 | virtual bool operator==(const klass& rhs) const; \ | ^~~~~~~~ src/ast_selectors.hpp:188:5: note: in expansion of macro ‘ATTACH_CMP_OPERATIONS’ 188 | ATTACH_CMP_OPERATIONS(ClassSelector) | ^~~~~~~~~~~~~~~~~~~~~ src/ast_selectors.hpp:135:18: warning: ‘virtual bool Sass::SimpleSelector::operator==(const Sass::SelectorList&) const’ was hidden [-Woverloaded-virtual=] 135 | virtual bool operator==(const SelectorList& rhs) const; | ^~~~~~~~ src/ast_def_macros.hpp:109:16: note: by ‘Sass::ClassSelector::operator==’ 109 | virtual bool operator==(const klass& rhs) const; \ | ^~~~~~~~ src/ast_selectors.hpp:188:5: note: in expansion of macro ‘ATTACH_CMP_OPERATIONS’ 188 | ATTACH_CMP_OPERATIONS(ClassSelector) | ^~~~~~~~~~~~~~~~~~~~~ src/ast_selectors.hpp:133:10: warning: ‘virtual bool Sass::SimpleSelector::operator==(const Sass::Selector&) const’ was hidden [-Woverloaded-virtual=] 133 | bool operator==(const Selector& rhs) const final override; | ^~~~~~~~ src/ast_def_macros.hpp:109:16: note: by ‘Sass::ClassSelector::operator==’ 109 | virtual bool operator==(const klass& rhs) const; \ | ^~~~~~~~ src/ast_selectors.hpp:188:5: note: in expansion of macro ‘ATTACH_CMP_OPERATIONS’ 188 | ATTACH_CMP_OPERATIONS(ClassSelector) | ^~~~~~~~~~~~~~~~~~~~~ src/ast_def_macros.hpp:106:16: warning: ‘virtual bool Sass::SimpleSelector::operator!=(const Sass::SimpleSelector&) const’ was hidden [-Woverloaded-virtual=] 106 | virtual bool operator!=(const klass& rhs) const { return !(*this == rhs); }; \ | ^~~~~~~~ src/ast_selectors.hpp:139:5: note: in expansion of macro ‘ATTACH_VIRTUAL_CMP_OPERATIONS’ 139 | ATTACH_VIRTUAL_CMP_OPERATIONS(SimpleSelector); | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~ src/ast_def_macros.hpp:110:16: note: by ‘virtual bool Sass::ClassSelector::operator!=(const Sass::ClassSelector&) const’ 110 | virtual bool operator!=(const klass& rhs) const { return !(*this == rhs); }; \ | ^~~~~~~~ src/ast_selectors.hpp:188:5: note: in expansion of macro ‘ATTACH_CMP_OPERATIONS’ 188 | ATTACH_CMP_OPERATIONS(ClassSelector) | ^~~~~~~~~~~~~~~~~~~~~ src/ast_selectors.hpp:137:18: warning: ‘virtual bool Sass::SimpleSelector::operator==(const Sass::CompoundSelector&) const’ was hidden [-Woverloaded-virtual=] 137 | virtual bool operator==(const CompoundSelector& rhs) const; | ^~~~~~~~ src/ast_def_macros.hpp:109:16: note: by ‘Sass::IDSelector::operator==’ 109 | virtual bool operator==(const klass& rhs) const; \ | ^~~~~~~~ src/ast_selectors.hpp:204:5: note: in expansion of macro ‘ATTACH_CMP_OPERATIONS’ 204 | ATTACH_CMP_OPERATIONS(IDSelector) | ^~~~~~~~~~~~~~~~~~~~~ src/ast_selectors.hpp:136:18: warning: ‘virtual bool Sass::SimpleSelector::operator==(const Sass::ComplexSelector&) const’ was hidden [-Woverloaded-virtual=] 136 | virtual bool operator==(const ComplexSelector& rhs) const; | ^~~~~~~~ src/ast_def_macros.hpp:109:16: note: by ‘Sass::IDSelector::operator==’ 109 | virtual bool operator==(const klass& rhs) const; \ | ^~~~~~~~ src/ast_selectors.hpp:204:5: note: in expansion of macro ‘ATTACH_CMP_OPERATIONS’ 204 | ATTACH_CMP_OPERATIONS(IDSelector) | ^~~~~~~~~~~~~~~~~~~~~ src/ast_selectors.hpp:135:18: warning: ‘virtual bool Sass::SimpleSelector::operator==(const Sass::SelectorList&) const’ was hidden [-Woverloaded-virtual=] 135 | virtual bool operator==(const SelectorList& rhs) const; | ^~~~~~~~ src/ast_def_macros.hpp:109:16: note: by ‘Sass::IDSelector::operator==’ 109 | virtual bool operator==(const klass& rhs) const; \ | ^~~~~~~~ src/ast_selectors.hpp:204:5: note: in expansion of macro ‘ATTACH_CMP_OPERATIONS’ 204 | ATTACH_CMP_OPERATIONS(IDSelector) | ^~~~~~~~~~~~~~~~~~~~~ src/ast_selectors.hpp:133:10: warning: ‘virtual bool Sass::SimpleSelector::operator==(const Sass::Selector&) const’ was hidden [-Woverloaded-virtual=] 133 | bool operator==(const Selector& rhs) const final override; | ^~~~~~~~ src/ast_def_macros.hpp:109:16: note: by ‘Sass::IDSelector::operator==’ 109 | virtual bool operator==(const klass& rhs) const; \ | ^~~~~~~~ src/ast_selectors.hpp:204:5: note: in expansion of macro ‘ATTACH_CMP_OPERATIONS’ 204 | ATTACH_CMP_OPERATIONS(IDSelector) | ^~~~~~~~~~~~~~~~~~~~~ src/ast_def_macros.hpp:106:16: warning: ‘virtual bool Sass::SimpleSelector::operator!=(const Sass::SimpleSelector&) const’ was hidden [-Woverloaded-virtual=] 106 | virtual bool operator!=(const klass& rhs) const { return !(*this == rhs); }; \ | ^~~~~~~~ src/ast_selectors.hpp:139:5: note: in expansion of macro ‘ATTACH_VIRTUAL_CMP_OPERATIONS’ 139 | ATTACH_VIRTUAL_CMP_OPERATIONS(SimpleSelector); | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~ src/ast_def_macros.hpp:110:16: note: by ‘virtual bool Sass::IDSelector::operator!=(const Sass::IDSelector&) const’ 110 | virtual bool operator!=(const klass& rhs) const { return !(*this == rhs); }; \ | ^~~~~~~~ src/ast_selectors.hpp:204:5: note: in expansion of macro ‘ATTACH_CMP_OPERATIONS’ 204 | ATTACH_CMP_OPERATIONS(IDSelector) | ^~~~~~~~~~~~~~~~~~~~~ src/ast_selectors.hpp:137:18: warning: ‘virtual bool Sass::SimpleSelector::operator==(const Sass::CompoundSelector&) const’ was hidden [-Woverloaded-virtual=] 137 | virtual bool operator==(const CompoundSelector& rhs) const; | ^~~~~~~~ src/ast_def_macros.hpp:109:16: note: by ‘Sass::AttributeSelector::operator==’ 109 | virtual bool operator==(const klass& rhs) const; \ | ^~~~~~~~ src/ast_selectors.hpp:223:5: note: in expansion of macro ‘ATTACH_CMP_OPERATIONS’ 223 | ATTACH_CMP_OPERATIONS(AttributeSelector) | ^~~~~~~~~~~~~~~~~~~~~ src/ast_selectors.hpp:136:18: warning: ‘virtual bool Sass::SimpleSelector::operator==(const Sass::ComplexSelector&) const’ was hidden [-Woverloaded-virtual=] 136 | virtual bool operator==(const ComplexSelector& rhs) const; | ^~~~~~~~ src/ast_def_macros.hpp:109:16: note: by ‘Sass::AttributeSelector::operator==’ 109 | virtual bool operator==(const klass& rhs) const; \ | ^~~~~~~~ src/ast_selectors.hpp:223:5: note: in expansion of macro ‘ATTACH_CMP_OPERATIONS’ 223 | ATTACH_CMP_OPERATIONS(AttributeSelector) | ^~~~~~~~~~~~~~~~~~~~~ src/ast_selectors.hpp:135:18: warning: ‘virtual bool Sass::SimpleSelector::operator==(const Sass::SelectorList&) const’ was hidden [-Woverloaded-virtual=] 135 | virtual bool operator==(const SelectorList& rhs) const; | ^~~~~~~~ src/ast_def_macros.hpp:109:16: note: by ‘Sass::AttributeSelector::operator==’ 109 | virtual bool operator==(const klass& rhs) const; \ | ^~~~~~~~ src/ast_selectors.hpp:223:5: note: in expansion of macro ‘ATTACH_CMP_OPERATIONS’ 223 | ATTACH_CMP_OPERATIONS(AttributeSelector) | ^~~~~~~~~~~~~~~~~~~~~ src/ast_selectors.hpp:133:10: warning: ‘virtual bool Sass::SimpleSelector::operator==(const Sass::Selector&) const’ was hidden [-Woverloaded-virtual=] 133 | bool operator==(const Selector& rhs) const final override; | ^~~~~~~~ src/ast_def_macros.hpp:109:16: note: by ‘Sass::AttributeSelector::operator==’ 109 | virtual bool operator==(const klass& rhs) const; \ | ^~~~~~~~ src/ast_selectors.hpp:223:5: note: in expansion of macro ‘ATTACH_CMP_OPERATIONS’ 223 | ATTACH_CMP_OPERATIONS(AttributeSelector) | ^~~~~~~~~~~~~~~~~~~~~ src/ast_def_macros.hpp:106:16: warning: ‘virtual bool Sass::SimpleSelector::operator!=(const Sass::SimpleSelector&) const’ was hidden [-Woverloaded-virtual=] 106 | virtual bool operator!=(const klass& rhs) const { return !(*this == rhs); }; \ | ^~~~~~~~ src/ast_selectors.hpp:139:5: note: in expansion of macro ‘ATTACH_VIRTUAL_CMP_OPERATIONS’ 139 | ATTACH_VIRTUAL_CMP_OPERATIONS(SimpleSelector); | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~ src/ast_def_macros.hpp:110:16: note: by ‘virtual bool Sass::AttributeSelector::operator!=(const Sass::AttributeSelector&) const’ 110 | virtual bool operator!=(const klass& rhs) const { return !(*this == rhs); }; \ | ^~~~~~~~ src/ast_selectors.hpp:223:5: note: in expansion of macro ‘ATTACH_CMP_OPERATIONS’ 223 | ATTACH_CMP_OPERATIONS(AttributeSelector) | ^~~~~~~~~~~~~~~~~~~~~ src/ast_def_macros.hpp:106:16: warning: ‘virtual bool Sass::Selector::operator!=(const Sass::Selector&) const’ was hidden [-Woverloaded-virtual=] 106 | virtual bool operator!=(const klass& rhs) const { return !(*this == rhs); }; \ | ^~~~~~~~ src/ast_selectors.hpp:56:5: note: in expansion of macro ‘ATTACH_VIRTUAL_CMP_OPERATIONS’ 56 | ATTACH_VIRTUAL_CMP_OPERATIONS(Selector) | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~ src/ast_def_macros.hpp:110:16: note: by ‘virtual bool Sass::ComplexSelector::operator!=(const Sass::ComplexSelector&) const’ 110 | virtual bool operator!=(const klass& rhs) const { return !(*this == rhs); }; \ | ^~~~~~~~ src/ast_selectors.hpp:310:5: note: in expansion of macro ‘ATTACH_CMP_OPERATIONS’ 310 | ATTACH_CMP_OPERATIONS(ComplexSelector) | ^~~~~~~~~~~~~~~~~~~~~ src/ast_def_macros.hpp:106:16: warning: ‘virtual bool Sass::Selector::operator!=(const Sass::Selector&) const’ was hidden [-Woverloaded-virtual=] 106 | virtual bool operator!=(const klass& rhs) const { return !(*this == rhs); }; \ | ^~~~~~~~ src/ast_selectors.hpp:56:5: note: in expansion of macro ‘ATTACH_VIRTUAL_CMP_OPERATIONS’ 56 | ATTACH_VIRTUAL_CMP_OPERATIONS(Selector) | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~ src/ast_def_macros.hpp:106:16: note: by ‘virtual bool Sass::SelectorComponent::operator!=(const Sass::SelectorComponent&) const’ 106 | virtual bool operator!=(const klass& rhs) const { return !(*this == rhs); }; \ | ^~~~~~~~ src/ast_selectors.hpp:349:5: note: in expansion of macro ‘ATTACH_VIRTUAL_CMP_OPERATIONS’ 349 | ATTACH_VIRTUAL_CMP_OPERATIONS(SelectorComponent); | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~ src/ast_def_macros.hpp:106:16: warning: ‘virtual bool Sass::SelectorComponent::operator!=(const Sass::SelectorComponent&) const’ was hidden [-Woverloaded-virtual=] 106 | virtual bool operator!=(const klass& rhs) const { return !(*this == rhs); }; \ | ^~~~~~~~ src/ast_selectors.hpp:349:5: note: in expansion of macro ‘ATTACH_VIRTUAL_CMP_OPERATIONS’ 349 | ATTACH_VIRTUAL_CMP_OPERATIONS(SelectorComponent); | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~ src/ast_def_macros.hpp:110:16: note: by ‘virtual bool Sass::SelectorCombinator::operator!=(const Sass::SelectorCombinator&) const’ 110 | virtual bool operator!=(const klass& rhs) const { return !(*this == rhs); }; \ | ^~~~~~~~ src/ast_selectors.hpp:407:5: note: in expansion of macro ‘ATTACH_CMP_OPERATIONS’ 407 | ATTACH_CMP_OPERATIONS(SelectorCombinator) | ^~~~~~~~~~~~~~~~~~~~~ g++ -std=gnu++17 -Wall -O2 -std=c++11 -I ./include -fPIC -c -o src/ast_values.o src/ast_values.cpp In file included from src/ast_values.cpp:4: src/ast.hpp:90:18: warning: ‘virtual bool Sass::AST_Node::operator==(const Sass::AST_Node&) const’ was hidden [-Woverloaded-virtual=] 90 | virtual bool operator== (const AST_Node& rhs) const { | ^~~~~~~~ src/ast.hpp:165:18: note: by ‘virtual bool Sass::Expression::operator==(const Sass::Expression&) const’ 165 | virtual bool operator== (const Expression& rhs) const { return false; } | ^~~~~~~~ src/ast.hpp:96:18: warning: ‘virtual bool Sass::AST_Node::operator!=(const Sass::AST_Node&) const’ was hidden [-Woverloaded-virtual=] 96 | virtual bool operator!= (const AST_Node& rhs) const { | ^~~~~~~~ src/ast.hpp:167:17: note: by ‘bool Sass::Expression::operator!=(const Sass::Expression&) const’ 167 | inline bool operator!=(const Expression& rhs) const { return !(rhs == *this); } | ^~~~~~~~ src/ast.hpp:90:18: warning: ‘virtual bool Sass::AST_Node::operator==(const Sass::AST_Node&) const’ was hidden [-Woverloaded-virtual=] 90 | virtual bool operator== (const AST_Node& rhs) const { | ^~~~~~~~ src/ast.hpp:908:10: note: by ‘bool Sass::CssMediaRule::operator==(const Sass::CssMediaRule&) const’ 908 | bool operator== (const CssMediaRule& rhs) const { | ^~~~~~~~ src/ast.hpp:96:18: warning: ‘virtual bool Sass::AST_Node::operator!=(const Sass::AST_Node&) const’ was hidden [-Woverloaded-virtual=] 96 | virtual bool operator!= (const AST_Node& rhs) const { | ^~~~~~~~ src/ast.hpp:911:10: note: by ‘bool Sass::CssMediaRule::operator!=(const Sass::CssMediaRule&) const’ 911 | bool operator!=(const CssMediaRule& rhs) const { | ^~~~~~~~ src/ast.hpp:90:18: warning: ‘virtual bool Sass::AST_Node::operator==(const Sass::AST_Node&) const’ was hidden [-Woverloaded-virtual=] 90 | virtual bool operator== (const AST_Node& rhs) const { | ^~~~~~~~ src/ast.hpp:939:10: note: by ‘bool Sass::CssMediaQuery::operator==(const Sass::CssMediaQuery&) const’ 939 | bool operator== (const CssMediaQuery& rhs) const; | ^~~~~~~~ src/ast.hpp:96:18: warning: ‘virtual bool Sass::AST_Node::operator!=(const Sass::AST_Node&) const’ was hidden [-Woverloaded-virtual=] 96 | virtual bool operator!= (const AST_Node& rhs) const { | ^~~~~~~~ src/ast.hpp:940:10: note: by ‘bool Sass::CssMediaQuery::operator!=(const Sass::CssMediaQuery&) const’ 940 | bool operator!=(const CssMediaQuery& rhs) const { | ^~~~~~~~ src/ast.hpp:165:18: warning: ‘virtual bool Sass::Expression::operator==(const Sass::Expression&) const’ was hidden [-Woverloaded-virtual=] 165 | virtual bool operator== (const Expression& rhs) const { return false; } | ^~~~~~~~ In file included from src/ast.hpp:14: src/ast_def_macros.hpp:105:16: note: by ‘virtual bool Sass::Selector::operator==(const Sass::Selector&) const’ 105 | virtual bool operator==(const klass& rhs) const = 0; \ | ^~~~~~~~ src/ast_selectors.hpp:56:5: note: in expansion of macro ‘ATTACH_VIRTUAL_CMP_OPERATIONS’ 56 | ATTACH_VIRTUAL_CMP_OPERATIONS(Selector) | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~ src/ast.hpp:96:18: warning: ‘virtual bool Sass::AST_Node::operator!=(const Sass::AST_Node&) const’ was hidden [-Woverloaded-virtual=] 96 | virtual bool operator!= (const AST_Node& rhs) const { | ^~~~~~~~ src/ast_def_macros.hpp:106:16: note: by ‘virtual bool Sass::Selector::operator!=(const Sass::Selector&) const’ 106 | virtual bool operator!=(const klass& rhs) const { return !(*this == rhs); }; \ | ^~~~~~~~ src/ast_selectors.hpp:56:5: note: in expansion of macro ‘ATTACH_VIRTUAL_CMP_OPERATIONS’ 56 | ATTACH_VIRTUAL_CMP_OPERATIONS(Selector) | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~ src/ast_def_macros.hpp:106:16: warning: ‘virtual bool Sass::Selector::operator!=(const Sass::Selector&) const’ was hidden [-Woverloaded-virtual=] 106 | virtual bool operator!=(const klass& rhs) const { return !(*this == rhs); }; \ | ^~~~~~~~ src/ast_selectors.hpp:56:5: note: in expansion of macro ‘ATTACH_VIRTUAL_CMP_OPERATIONS’ 56 | ATTACH_VIRTUAL_CMP_OPERATIONS(Selector) | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~ src/ast_def_macros.hpp:106:16: note: by ‘virtual bool Sass::SimpleSelector::operator!=(const Sass::SimpleSelector&) const’ 106 | virtual bool operator!=(const klass& rhs) const { return !(*this == rhs); }; \ | ^~~~~~~~ src/ast_selectors.hpp:139:5: note: in expansion of macro ‘ATTACH_VIRTUAL_CMP_OPERATIONS’ 139 | ATTACH_VIRTUAL_CMP_OPERATIONS(SimpleSelector); | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~ In file included from src/ast.hpp:1055: src/ast_selectors.hpp:137:18: warning: ‘virtual bool Sass::SimpleSelector::operator==(const Sass::CompoundSelector&) const’ was hidden [-Woverloaded-virtual=] 137 | virtual bool operator==(const CompoundSelector& rhs) const; | ^~~~~~~~ src/ast_def_macros.hpp:109:16: note: by ‘Sass::PlaceholderSelector::operator==’ 109 | virtual bool operator==(const klass& rhs) const; \ | ^~~~~~~~ src/ast_selectors.hpp:157:5: note: in expansion of macro ‘ATTACH_CMP_OPERATIONS’ 157 | ATTACH_CMP_OPERATIONS(PlaceholderSelector) | ^~~~~~~~~~~~~~~~~~~~~ src/ast_selectors.hpp:136:18: warning: ‘virtual bool Sass::SimpleSelector::operator==(const Sass::ComplexSelector&) const’ was hidden [-Woverloaded-virtual=] 136 | virtual bool operator==(const ComplexSelector& rhs) const; | ^~~~~~~~ src/ast_def_macros.hpp:109:16: note: by ‘Sass::PlaceholderSelector::operator==’ 109 | virtual bool operator==(const klass& rhs) const; \ | ^~~~~~~~ src/ast_selectors.hpp:157:5: note: in expansion of macro ‘ATTACH_CMP_OPERATIONS’ 157 | ATTACH_CMP_OPERATIONS(PlaceholderSelector) | ^~~~~~~~~~~~~~~~~~~~~ src/ast_selectors.hpp:135:18: warning: ‘virtual bool Sass::SimpleSelector::operator==(const Sass::SelectorList&) const’ was hidden [-Woverloaded-virtual=] 135 | virtual bool operator==(const SelectorList& rhs) const; | ^~~~~~~~ src/ast_def_macros.hpp:109:16: note: by ‘Sass::PlaceholderSelector::operator==’ 109 | virtual bool operator==(const klass& rhs) const; \ | ^~~~~~~~ src/ast_selectors.hpp:157:5: note: in expansion of macro ‘ATTACH_CMP_OPERATIONS’ 157 | ATTACH_CMP_OPERATIONS(PlaceholderSelector) | ^~~~~~~~~~~~~~~~~~~~~ src/ast_selectors.hpp:133:10: warning: ‘virtual bool Sass::SimpleSelector::operator==(const Sass::Selector&) const’ was hidden [-Woverloaded-virtual=] 133 | bool operator==(const Selector& rhs) const final override; | ^~~~~~~~ src/ast_def_macros.hpp:109:16: note: by ‘Sass::PlaceholderSelector::operator==’ 109 | virtual bool operator==(const klass& rhs) const; \ | ^~~~~~~~ src/ast_selectors.hpp:157:5: note: in expansion of macro ‘ATTACH_CMP_OPERATIONS’ 157 | ATTACH_CMP_OPERATIONS(PlaceholderSelector) | ^~~~~~~~~~~~~~~~~~~~~ src/ast_def_macros.hpp:106:16: warning: ‘virtual bool Sass::SimpleSelector::operator!=(const Sass::SimpleSelector&) const’ was hidden [-Woverloaded-virtual=] 106 | virtual bool operator!=(const klass& rhs) const { return !(*this == rhs); }; \ | ^~~~~~~~ src/ast_selectors.hpp:139:5: note: in expansion of macro ‘ATTACH_VIRTUAL_CMP_OPERATIONS’ 139 | ATTACH_VIRTUAL_CMP_OPERATIONS(SimpleSelector); | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~ src/ast_def_macros.hpp:110:16: note: by ‘virtual bool Sass::PlaceholderSelector::operator!=(const Sass::PlaceholderSelector&) const’ 110 | virtual bool operator!=(const klass& rhs) const { return !(*this == rhs); }; \ | ^~~~~~~~ src/ast_selectors.hpp:157:5: note: in expansion of macro ‘ATTACH_CMP_OPERATIONS’ 157 | ATTACH_CMP_OPERATIONS(PlaceholderSelector) | ^~~~~~~~~~~~~~~~~~~~~ src/ast_selectors.hpp:137:18: warning: ‘virtual bool Sass::SimpleSelector::operator==(const Sass::CompoundSelector&) const’ was hidden [-Woverloaded-virtual=] 137 | virtual bool operator==(const CompoundSelector& rhs) const; | ^~~~~~~~ src/ast_def_macros.hpp:109:16: note: by ‘Sass::TypeSelector::operator==’ 109 | virtual bool operator==(const klass& rhs) const; \ | ^~~~~~~~ src/ast_selectors.hpp:174:5: note: in expansion of macro ‘ATTACH_CMP_OPERATIONS’ 174 | ATTACH_CMP_OPERATIONS(TypeSelector) | ^~~~~~~~~~~~~~~~~~~~~ src/ast_selectors.hpp:136:18: warning: ‘virtual bool Sass::SimpleSelector::operator==(const Sass::ComplexSelector&) const’ was hidden [-Woverloaded-virtual=] 136 | virtual bool operator==(const ComplexSelector& rhs) const; | ^~~~~~~~ src/ast_def_macros.hpp:109:16: note: by ‘Sass::TypeSelector::operator==’ 109 | virtual bool operator==(const klass& rhs) const; \ | ^~~~~~~~ src/ast_selectors.hpp:174:5: note: in expansion of macro ‘ATTACH_CMP_OPERATIONS’ 174 | ATTACH_CMP_OPERATIONS(TypeSelector) | ^~~~~~~~~~~~~~~~~~~~~ src/ast_selectors.hpp:135:18: warning: ‘virtual bool Sass::SimpleSelector::operator==(const Sass::SelectorList&) const’ was hidden [-Woverloaded-virtual=] 135 | virtual bool operator==(const SelectorList& rhs) const; | ^~~~~~~~ src/ast_def_macros.hpp:109:16: note: by ‘Sass::TypeSelector::operator==’ 109 | virtual bool operator==(const klass& rhs) const; \ | ^~~~~~~~ src/ast_selectors.hpp:174:5: note: in expansion of macro ‘ATTACH_CMP_OPERATIONS’ 174 | ATTACH_CMP_OPERATIONS(TypeSelector) | ^~~~~~~~~~~~~~~~~~~~~ src/ast_selectors.hpp:133:10: warning: ‘virtual bool Sass::SimpleSelector::operator==(const Sass::Selector&) const’ was hidden [-Woverloaded-virtual=] 133 | bool operator==(const Selector& rhs) const final override; | ^~~~~~~~ src/ast_def_macros.hpp:109:16: note: by ‘Sass::TypeSelector::operator==’ 109 | virtual bool operator==(const klass& rhs) const; \ | ^~~~~~~~ src/ast_selectors.hpp:174:5: note: in expansion of macro ‘ATTACH_CMP_OPERATIONS’ 174 | ATTACH_CMP_OPERATIONS(TypeSelector) | ^~~~~~~~~~~~~~~~~~~~~ src/ast_def_macros.hpp:106:16: warning: ‘virtual bool Sass::SimpleSelector::operator!=(const Sass::SimpleSelector&) const’ was hidden [-Woverloaded-virtual=] 106 | virtual bool operator!=(const klass& rhs) const { return !(*this == rhs); }; \ | ^~~~~~~~ src/ast_selectors.hpp:139:5: note: in expansion of macro ‘ATTACH_VIRTUAL_CMP_OPERATIONS’ 139 | ATTACH_VIRTUAL_CMP_OPERATIONS(SimpleSelector); | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~ src/ast_def_macros.hpp:110:16: note: by ‘virtual bool Sass::TypeSelector::operator!=(const Sass::TypeSelector&) const’ 110 | virtual bool operator!=(const klass& rhs) const { return !(*this == rhs); }; \ | ^~~~~~~~ src/ast_selectors.hpp:174:5: note: in expansion of macro ‘ATTACH_CMP_OPERATIONS’ 174 | ATTACH_CMP_OPERATIONS(TypeSelector) | ^~~~~~~~~~~~~~~~~~~~~ src/ast_selectors.hpp:137:18: warning: ‘virtual bool Sass::SimpleSelector::operator==(const Sass::CompoundSelector&) const’ was hidden [-Woverloaded-virtual=] 137 | virtual bool operator==(const CompoundSelector& rhs) const; | ^~~~~~~~ src/ast_def_macros.hpp:109:16: note: by ‘Sass::ClassSelector::operator==’ 109 | virtual bool operator==(const klass& rhs) const; \ | ^~~~~~~~ src/ast_selectors.hpp:188:5: note: in expansion of macro ‘ATTACH_CMP_OPERATIONS’ 188 | ATTACH_CMP_OPERATIONS(ClassSelector) | ^~~~~~~~~~~~~~~~~~~~~ src/ast_selectors.hpp:136:18: warning: ‘virtual bool Sass::SimpleSelector::operator==(const Sass::ComplexSelector&) const’ was hidden [-Woverloaded-virtual=] 136 | virtual bool operator==(const ComplexSelector& rhs) const; | ^~~~~~~~ src/ast_def_macros.hpp:109:16: note: by ‘Sass::ClassSelector::operator==’ 109 | virtual bool operator==(const klass& rhs) const; \ | ^~~~~~~~ src/ast_selectors.hpp:188:5: note: in expansion of macro ‘ATTACH_CMP_OPERATIONS’ 188 | ATTACH_CMP_OPERATIONS(ClassSelector) | ^~~~~~~~~~~~~~~~~~~~~ src/ast_selectors.hpp:135:18: warning: ‘virtual bool Sass::SimpleSelector::operator==(const Sass::SelectorList&) const’ was hidden [-Woverloaded-virtual=] 135 | virtual bool operator==(const SelectorList& rhs) const; | ^~~~~~~~ src/ast_def_macros.hpp:109:16: note: by ‘Sass::ClassSelector::operator==’ 109 | virtual bool operator==(const klass& rhs) const; \ | ^~~~~~~~ src/ast_selectors.hpp:188:5: note: in expansion of macro ‘ATTACH_CMP_OPERATIONS’ 188 | ATTACH_CMP_OPERATIONS(ClassSelector) | ^~~~~~~~~~~~~~~~~~~~~ src/ast_selectors.hpp:133:10: warning: ‘virtual bool Sass::SimpleSelector::operator==(const Sass::Selector&) const’ was hidden [-Woverloaded-virtual=] 133 | bool operator==(const Selector& rhs) const final override; | ^~~~~~~~ src/ast_def_macros.hpp:109:16: note: by ‘Sass::ClassSelector::operator==’ 109 | virtual bool operator==(const klass& rhs) const; \ | ^~~~~~~~ src/ast_selectors.hpp:188:5: note: in expansion of macro ‘ATTACH_CMP_OPERATIONS’ 188 | ATTACH_CMP_OPERATIONS(ClassSelector) | ^~~~~~~~~~~~~~~~~~~~~ src/ast_def_macros.hpp:106:16: warning: ‘virtual bool Sass::SimpleSelector::operator!=(const Sass::SimpleSelector&) const’ was hidden [-Woverloaded-virtual=] 106 | virtual bool operator!=(const klass& rhs) const { return !(*this == rhs); }; \ | ^~~~~~~~ src/ast_selectors.hpp:139:5: note: in expansion of macro ‘ATTACH_VIRTUAL_CMP_OPERATIONS’ 139 | ATTACH_VIRTUAL_CMP_OPERATIONS(SimpleSelector); | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~ src/ast_def_macros.hpp:110:16: note: by ‘virtual bool Sass::ClassSelector::operator!=(const Sass::ClassSelector&) const’ 110 | virtual bool operator!=(const klass& rhs) const { return !(*this == rhs); }; \ | ^~~~~~~~ src/ast_selectors.hpp:188:5: note: in expansion of macro ‘ATTACH_CMP_OPERATIONS’ 188 | ATTACH_CMP_OPERATIONS(ClassSelector) | ^~~~~~~~~~~~~~~~~~~~~ src/ast_selectors.hpp:137:18: warning: ‘virtual bool Sass::SimpleSelector::operator==(const Sass::CompoundSelector&) const’ was hidden [-Woverloaded-virtual=] 137 | virtual bool operator==(const CompoundSelector& rhs) const; | ^~~~~~~~ src/ast_def_macros.hpp:109:16: note: by ‘Sass::IDSelector::operator==’ 109 | virtual bool operator==(const klass& rhs) const; \ | ^~~~~~~~ src/ast_selectors.hpp:204:5: note: in expansion of macro ‘ATTACH_CMP_OPERATIONS’ 204 | ATTACH_CMP_OPERATIONS(IDSelector) | ^~~~~~~~~~~~~~~~~~~~~ src/ast_selectors.hpp:136:18: warning: ‘virtual bool Sass::SimpleSelector::operator==(const Sass::ComplexSelector&) const’ was hidden [-Woverloaded-virtual=] 136 | virtual bool operator==(const ComplexSelector& rhs) const; | ^~~~~~~~ src/ast_def_macros.hpp:109:16: note: by ‘Sass::IDSelector::operator==’ 109 | virtual bool operator==(const klass& rhs) const; \ | ^~~~~~~~ src/ast_selectors.hpp:204:5: note: in expansion of macro ‘ATTACH_CMP_OPERATIONS’ 204 | ATTACH_CMP_OPERATIONS(IDSelector) | ^~~~~~~~~~~~~~~~~~~~~ src/ast_selectors.hpp:135:18: warning: ‘virtual bool Sass::SimpleSelector::operator==(const Sass::SelectorList&) const’ was hidden [-Woverloaded-virtual=] 135 | virtual bool operator==(const SelectorList& rhs) const; | ^~~~~~~~ src/ast_def_macros.hpp:109:16: note: by ‘Sass::IDSelector::operator==’ 109 | virtual bool operator==(const klass& rhs) const; \ | ^~~~~~~~ src/ast_selectors.hpp:204:5: note: in expansion of macro ‘ATTACH_CMP_OPERATIONS’ 204 | ATTACH_CMP_OPERATIONS(IDSelector) | ^~~~~~~~~~~~~~~~~~~~~ src/ast_selectors.hpp:133:10: warning: ‘virtual bool Sass::SimpleSelector::operator==(const Sass::Selector&) const’ was hidden [-Woverloaded-virtual=] 133 | bool operator==(const Selector& rhs) const final override; | ^~~~~~~~ src/ast_def_macros.hpp:109:16: note: by ‘Sass::IDSelector::operator==’ 109 | virtual bool operator==(const klass& rhs) const; \ | ^~~~~~~~ src/ast_selectors.hpp:204:5: note: in expansion of macro ‘ATTACH_CMP_OPERATIONS’ 204 | ATTACH_CMP_OPERATIONS(IDSelector) | ^~~~~~~~~~~~~~~~~~~~~ src/ast_def_macros.hpp:106:16: warning: ‘virtual bool Sass::SimpleSelector::operator!=(const Sass::SimpleSelector&) const’ was hidden [-Woverloaded-virtual=] 106 | virtual bool operator!=(const klass& rhs) const { return !(*this == rhs); }; \ | ^~~~~~~~ src/ast_selectors.hpp:139:5: note: in expansion of macro ‘ATTACH_VIRTUAL_CMP_OPERATIONS’ 139 | ATTACH_VIRTUAL_CMP_OPERATIONS(SimpleSelector); | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~ src/ast_def_macros.hpp:110:16: note: by ‘virtual bool Sass::IDSelector::operator!=(const Sass::IDSelector&) const’ 110 | virtual bool operator!=(const klass& rhs) const { return !(*this == rhs); }; \ | ^~~~~~~~ src/ast_selectors.hpp:204:5: note: in expansion of macro ‘ATTACH_CMP_OPERATIONS’ 204 | ATTACH_CMP_OPERATIONS(IDSelector) | ^~~~~~~~~~~~~~~~~~~~~ src/ast_selectors.hpp:137:18: warning: ‘virtual bool Sass::SimpleSelector::operator==(const Sass::CompoundSelector&) const’ was hidden [-Woverloaded-virtual=] 137 | virtual bool operator==(const CompoundSelector& rhs) const; | ^~~~~~~~ src/ast_def_macros.hpp:109:16: note: by ‘Sass::AttributeSelector::operator==’ 109 | virtual bool operator==(const klass& rhs) const; \ | ^~~~~~~~ src/ast_selectors.hpp:223:5: note: in expansion of macro ‘ATTACH_CMP_OPERATIONS’ 223 | ATTACH_CMP_OPERATIONS(AttributeSelector) | ^~~~~~~~~~~~~~~~~~~~~ src/ast_selectors.hpp:136:18: warning: ‘virtual bool Sass::SimpleSelector::operator==(const Sass::ComplexSelector&) const’ was hidden [-Woverloaded-virtual=] 136 | virtual bool operator==(const ComplexSelector& rhs) const; | ^~~~~~~~ src/ast_def_macros.hpp:109:16: note: by ‘Sass::AttributeSelector::operator==’ 109 | virtual bool operator==(const klass& rhs) const; \ | ^~~~~~~~ src/ast_selectors.hpp:223:5: note: in expansion of macro ‘ATTACH_CMP_OPERATIONS’ 223 | ATTACH_CMP_OPERATIONS(AttributeSelector) | ^~~~~~~~~~~~~~~~~~~~~ src/ast_selectors.hpp:135:18: warning: ‘virtual bool Sass::SimpleSelector::operator==(const Sass::SelectorList&) const’ was hidden [-Woverloaded-virtual=] 135 | virtual bool operator==(const SelectorList& rhs) const; | ^~~~~~~~ src/ast_def_macros.hpp:109:16: note: by ‘Sass::AttributeSelector::operator==’ 109 | virtual bool operator==(const klass& rhs) const; \ | ^~~~~~~~ src/ast_selectors.hpp:223:5: note: in expansion of macro ‘ATTACH_CMP_OPERATIONS’ 223 | ATTACH_CMP_OPERATIONS(AttributeSelector) | ^~~~~~~~~~~~~~~~~~~~~ src/ast_selectors.hpp:133:10: warning: ‘virtual bool Sass::SimpleSelector::operator==(const Sass::Selector&) const’ was hidden [-Woverloaded-virtual=] 133 | bool operator==(const Selector& rhs) const final override; | ^~~~~~~~ src/ast_def_macros.hpp:109:16: note: by ‘Sass::AttributeSelector::operator==’ 109 | virtual bool operator==(const klass& rhs) const; \ | ^~~~~~~~ src/ast_selectors.hpp:223:5: note: in expansion of macro ‘ATTACH_CMP_OPERATIONS’ 223 | ATTACH_CMP_OPERATIONS(AttributeSelector) | ^~~~~~~~~~~~~~~~~~~~~ src/ast_def_macros.hpp:106:16: warning: ‘virtual bool Sass::SimpleSelector::operator!=(const Sass::SimpleSelector&) const’ was hidden [-Woverloaded-virtual=] 106 | virtual bool operator!=(const klass& rhs) const { return !(*this == rhs); }; \ | ^~~~~~~~ src/ast_selectors.hpp:139:5: note: in expansion of macro ‘ATTACH_VIRTUAL_CMP_OPERATIONS’ 139 | ATTACH_VIRTUAL_CMP_OPERATIONS(SimpleSelector); | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~ src/ast_def_macros.hpp:110:16: note: by ‘virtual bool Sass::AttributeSelector::operator!=(const Sass::AttributeSelector&) const’ 110 | virtual bool operator!=(const klass& rhs) const { return !(*this == rhs); }; \ | ^~~~~~~~ src/ast_selectors.hpp:223:5: note: in expansion of macro ‘ATTACH_CMP_OPERATIONS’ 223 | ATTACH_CMP_OPERATIONS(AttributeSelector) | ^~~~~~~~~~~~~~~~~~~~~ src/ast_def_macros.hpp:106:16: warning: ‘virtual bool Sass::Selector::operator!=(const Sass::Selector&) const’ was hidden [-Woverloaded-virtual=] 106 | virtual bool operator!=(const klass& rhs) const { return !(*this == rhs); }; \ | ^~~~~~~~ src/ast_selectors.hpp:56:5: note: in expansion of macro ‘ATTACH_VIRTUAL_CMP_OPERATIONS’ 56 | ATTACH_VIRTUAL_CMP_OPERATIONS(Selector) | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~ src/ast_def_macros.hpp:110:16: note: by ‘virtual bool Sass::ComplexSelector::operator!=(const Sass::ComplexSelector&) const’ 110 | virtual bool operator!=(const klass& rhs) const { return !(*this == rhs); }; \ | ^~~~~~~~ src/ast_selectors.hpp:310:5: note: in expansion of macro ‘ATTACH_CMP_OPERATIONS’ 310 | ATTACH_CMP_OPERATIONS(ComplexSelector) | ^~~~~~~~~~~~~~~~~~~~~ src/ast_def_macros.hpp:106:16: warning: ‘virtual bool Sass::Selector::operator!=(const Sass::Selector&) const’ was hidden [-Woverloaded-virtual=] 106 | virtual bool operator!=(const klass& rhs) const { return !(*this == rhs); }; \ | ^~~~~~~~ src/ast_selectors.hpp:56:5: note: in expansion of macro ‘ATTACH_VIRTUAL_CMP_OPERATIONS’ 56 | ATTACH_VIRTUAL_CMP_OPERATIONS(Selector) | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~ src/ast_def_macros.hpp:106:16: note: by ‘virtual bool Sass::SelectorComponent::operator!=(const Sass::SelectorComponent&) const’ 106 | virtual bool operator!=(const klass& rhs) const { return !(*this == rhs); }; \ | ^~~~~~~~ src/ast_selectors.hpp:349:5: note: in expansion of macro ‘ATTACH_VIRTUAL_CMP_OPERATIONS’ 349 | ATTACH_VIRTUAL_CMP_OPERATIONS(SelectorComponent); | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~ src/ast_def_macros.hpp:106:16: warning: ‘virtual bool Sass::SelectorComponent::operator!=(const Sass::SelectorComponent&) const’ was hidden [-Woverloaded-virtual=] 106 | virtual bool operator!=(const klass& rhs) const { return !(*this == rhs); }; \ | ^~~~~~~~ src/ast_selectors.hpp:349:5: note: in expansion of macro ‘ATTACH_VIRTUAL_CMP_OPERATIONS’ 349 | ATTACH_VIRTUAL_CMP_OPERATIONS(SelectorComponent); | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~ src/ast_def_macros.hpp:110:16: note: by ‘virtual bool Sass::SelectorCombinator::operator!=(const Sass::SelectorCombinator&) const’ 110 | virtual bool operator!=(const klass& rhs) const { return !(*this == rhs); }; \ | ^~~~~~~~ src/ast_selectors.hpp:407:5: note: in expansion of macro ‘ATTACH_CMP_OPERATIONS’ 407 | ATTACH_CMP_OPERATIONS(SelectorCombinator) | ^~~~~~~~~~~~~~~~~~~~~ g++ -std=gnu++17 -Wall -O2 -std=c++11 -I ./include -fPIC -c -o src/ast_supports.o src/ast_supports.cpp In file included from src/ast_supports.cpp:4: src/ast.hpp:90:18: warning: ‘virtual bool Sass::AST_Node::operator==(const Sass::AST_Node&) const’ was hidden [-Woverloaded-virtual=] 90 | virtual bool operator== (const AST_Node& rhs) const { | ^~~~~~~~ src/ast.hpp:165:18: note: by ‘virtual bool Sass::Expression::operator==(const Sass::Expression&) const’ 165 | virtual bool operator== (const Expression& rhs) const { return false; } | ^~~~~~~~ src/ast.hpp:96:18: warning: ‘virtual bool Sass::AST_Node::operator!=(const Sass::AST_Node&) const’ was hidden [-Woverloaded-virtual=] 96 | virtual bool operator!= (const AST_Node& rhs) const { | ^~~~~~~~ src/ast.hpp:167:17: note: by ‘bool Sass::Expression::operator!=(const Sass::Expression&) const’ 167 | inline bool operator!=(const Expression& rhs) const { return !(rhs == *this); } | ^~~~~~~~ src/ast.hpp:90:18: warning: ‘virtual bool Sass::AST_Node::operator==(const Sass::AST_Node&) const’ was hidden [-Woverloaded-virtual=] 90 | virtual bool operator== (const AST_Node& rhs) const { | ^~~~~~~~ src/ast.hpp:908:10: note: by ‘bool Sass::CssMediaRule::operator==(const Sass::CssMediaRule&) const’ 908 | bool operator== (const CssMediaRule& rhs) const { | ^~~~~~~~ src/ast.hpp:96:18: warning: ‘virtual bool Sass::AST_Node::operator!=(const Sass::AST_Node&) const’ was hidden [-Woverloaded-virtual=] 96 | virtual bool operator!= (const AST_Node& rhs) const { | ^~~~~~~~ src/ast.hpp:911:10: note: by ‘bool Sass::CssMediaRule::operator!=(const Sass::CssMediaRule&) const’ 911 | bool operator!=(const CssMediaRule& rhs) const { | ^~~~~~~~ src/ast.hpp:90:18: warning: ‘virtual bool Sass::AST_Node::operator==(const Sass::AST_Node&) const’ was hidden [-Woverloaded-virtual=] 90 | virtual bool operator== (const AST_Node& rhs) const { | ^~~~~~~~ src/ast.hpp:939:10: note: by ‘bool Sass::CssMediaQuery::operator==(const Sass::CssMediaQuery&) const’ 939 | bool operator== (const CssMediaQuery& rhs) const; | ^~~~~~~~ src/ast.hpp:96:18: warning: ‘virtual bool Sass::AST_Node::operator!=(const Sass::AST_Node&) const’ was hidden [-Woverloaded-virtual=] 96 | virtual bool operator!= (const AST_Node& rhs) const { | ^~~~~~~~ src/ast.hpp:940:10: note: by ‘bool Sass::CssMediaQuery::operator!=(const Sass::CssMediaQuery&) const’ 940 | bool operator!=(const CssMediaQuery& rhs) const { | ^~~~~~~~ src/ast.hpp:165:18: warning: ‘virtual bool Sass::Expression::operator==(const Sass::Expression&) const’ was hidden [-Woverloaded-virtual=] 165 | virtual bool operator== (const Expression& rhs) const { return false; } | ^~~~~~~~ In file included from src/ast.hpp:14: src/ast_def_macros.hpp:105:16: note: by ‘virtual bool Sass::Selector::operator==(const Sass::Selector&) const’ 105 | virtual bool operator==(const klass& rhs) const = 0; \ | ^~~~~~~~ src/ast_selectors.hpp:56:5: note: in expansion of macro ‘ATTACH_VIRTUAL_CMP_OPERATIONS’ 56 | ATTACH_VIRTUAL_CMP_OPERATIONS(Selector) | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~ src/ast.hpp:96:18: warning: ‘virtual bool Sass::AST_Node::operator!=(const Sass::AST_Node&) const’ was hidden [-Woverloaded-virtual=] 96 | virtual bool operator!= (const AST_Node& rhs) const { | ^~~~~~~~ src/ast_def_macros.hpp:106:16: note: by ‘virtual bool Sass::Selector::operator!=(const Sass::Selector&) const’ 106 | virtual bool operator!=(const klass& rhs) const { return !(*this == rhs); }; \ | ^~~~~~~~ src/ast_selectors.hpp:56:5: note: in expansion of macro ‘ATTACH_VIRTUAL_CMP_OPERATIONS’ 56 | ATTACH_VIRTUAL_CMP_OPERATIONS(Selector) | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~ src/ast_def_macros.hpp:106:16: warning: ‘virtual bool Sass::Selector::operator!=(const Sass::Selector&) const’ was hidden [-Woverloaded-virtual=] 106 | virtual bool operator!=(const klass& rhs) const { return !(*this == rhs); }; \ | ^~~~~~~~ src/ast_selectors.hpp:56:5: note: in expansion of macro ‘ATTACH_VIRTUAL_CMP_OPERATIONS’ 56 | ATTACH_VIRTUAL_CMP_OPERATIONS(Selector) | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~ src/ast_def_macros.hpp:106:16: note: by ‘virtual bool Sass::SimpleSelector::operator!=(const Sass::SimpleSelector&) const’ 106 | virtual bool operator!=(const klass& rhs) const { return !(*this == rhs); }; \ | ^~~~~~~~ src/ast_selectors.hpp:139:5: note: in expansion of macro ‘ATTACH_VIRTUAL_CMP_OPERATIONS’ 139 | ATTACH_VIRTUAL_CMP_OPERATIONS(SimpleSelector); | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~ In file included from src/ast.hpp:1055: src/ast_selectors.hpp:137:18: warning: ‘virtual bool Sass::SimpleSelector::operator==(const Sass::CompoundSelector&) const’ was hidden [-Woverloaded-virtual=] 137 | virtual bool operator==(const CompoundSelector& rhs) const; | ^~~~~~~~ src/ast_def_macros.hpp:109:16: note: by ‘Sass::PlaceholderSelector::operator==’ 109 | virtual bool operator==(const klass& rhs) const; \ | ^~~~~~~~ src/ast_selectors.hpp:157:5: note: in expansion of macro ‘ATTACH_CMP_OPERATIONS’ 157 | ATTACH_CMP_OPERATIONS(PlaceholderSelector) | ^~~~~~~~~~~~~~~~~~~~~ src/ast_selectors.hpp:136:18: warning: ‘virtual bool Sass::SimpleSelector::operator==(const Sass::ComplexSelector&) const’ was hidden [-Woverloaded-virtual=] 136 | virtual bool operator==(const ComplexSelector& rhs) const; | ^~~~~~~~ src/ast_def_macros.hpp:109:16: note: by ‘Sass::PlaceholderSelector::operator==’ 109 | virtual bool operator==(const klass& rhs) const; \ | ^~~~~~~~ src/ast_selectors.hpp:157:5: note: in expansion of macro ‘ATTACH_CMP_OPERATIONS’ 157 | ATTACH_CMP_OPERATIONS(PlaceholderSelector) | ^~~~~~~~~~~~~~~~~~~~~ src/ast_selectors.hpp:135:18: warning: ‘virtual bool Sass::SimpleSelector::operator==(const Sass::SelectorList&) const’ was hidden [-Woverloaded-virtual=] 135 | virtual bool operator==(const SelectorList& rhs) const; | ^~~~~~~~ src/ast_def_macros.hpp:109:16: note: by ‘Sass::PlaceholderSelector::operator==’ 109 | virtual bool operator==(const klass& rhs) const; \ | ^~~~~~~~ src/ast_selectors.hpp:157:5: note: in expansion of macro ‘ATTACH_CMP_OPERATIONS’ 157 | ATTACH_CMP_OPERATIONS(PlaceholderSelector) | ^~~~~~~~~~~~~~~~~~~~~ src/ast_selectors.hpp:133:10: warning: ‘virtual bool Sass::SimpleSelector::operator==(const Sass::Selector&) const’ was hidden [-Woverloaded-virtual=] 133 | bool operator==(const Selector& rhs) const final override; | ^~~~~~~~ src/ast_def_macros.hpp:109:16: note: by ‘Sass::PlaceholderSelector::operator==’ 109 | virtual bool operator==(const klass& rhs) const; \ | ^~~~~~~~ src/ast_selectors.hpp:157:5: note: in expansion of macro ‘ATTACH_CMP_OPERATIONS’ 157 | ATTACH_CMP_OPERATIONS(PlaceholderSelector) | ^~~~~~~~~~~~~~~~~~~~~ src/ast_def_macros.hpp:106:16: warning: ‘virtual bool Sass::SimpleSelector::operator!=(const Sass::SimpleSelector&) const’ was hidden [-Woverloaded-virtual=] 106 | virtual bool operator!=(const klass& rhs) const { return !(*this == rhs); }; \ | ^~~~~~~~ src/ast_selectors.hpp:139:5: note: in expansion of macro ‘ATTACH_VIRTUAL_CMP_OPERATIONS’ 139 | ATTACH_VIRTUAL_CMP_OPERATIONS(SimpleSelector); | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~ src/ast_def_macros.hpp:110:16: note: by ‘virtual bool Sass::PlaceholderSelector::operator!=(const Sass::PlaceholderSelector&) const’ 110 | virtual bool operator!=(const klass& rhs) const { return !(*this == rhs); }; \ | ^~~~~~~~ src/ast_selectors.hpp:157:5: note: in expansion of macro ‘ATTACH_CMP_OPERATIONS’ 157 | ATTACH_CMP_OPERATIONS(PlaceholderSelector) | ^~~~~~~~~~~~~~~~~~~~~ src/ast_selectors.hpp:137:18: warning: ‘virtual bool Sass::SimpleSelector::operator==(const Sass::CompoundSelector&) const’ was hidden [-Woverloaded-virtual=] 137 | virtual bool operator==(const CompoundSelector& rhs) const; | ^~~~~~~~ src/ast_def_macros.hpp:109:16: note: by ‘Sass::TypeSelector::operator==’ 109 | virtual bool operator==(const klass& rhs) const; \ | ^~~~~~~~ src/ast_selectors.hpp:174:5: note: in expansion of macro ‘ATTACH_CMP_OPERATIONS’ 174 | ATTACH_CMP_OPERATIONS(TypeSelector) | ^~~~~~~~~~~~~~~~~~~~~ src/ast_selectors.hpp:136:18: warning: ‘virtual bool Sass::SimpleSelector::operator==(const Sass::ComplexSelector&) const’ was hidden [-Woverloaded-virtual=] 136 | virtual bool operator==(const ComplexSelector& rhs) const; | ^~~~~~~~ src/ast_def_macros.hpp:109:16: note: by ‘Sass::TypeSelector::operator==’ 109 | virtual bool operator==(const klass& rhs) const; \ | ^~~~~~~~ src/ast_selectors.hpp:174:5: note: in expansion of macro ‘ATTACH_CMP_OPERATIONS’ 174 | ATTACH_CMP_OPERATIONS(TypeSelector) | ^~~~~~~~~~~~~~~~~~~~~ src/ast_selectors.hpp:135:18: warning: ‘virtual bool Sass::SimpleSelector::operator==(const Sass::SelectorList&) const’ was hidden [-Woverloaded-virtual=] 135 | virtual bool operator==(const SelectorList& rhs) const; | ^~~~~~~~ src/ast_def_macros.hpp:109:16: note: by ‘Sass::TypeSelector::operator==’ 109 | virtual bool operator==(const klass& rhs) const; \ | ^~~~~~~~ src/ast_selectors.hpp:174:5: note: in expansion of macro ‘ATTACH_CMP_OPERATIONS’ 174 | ATTACH_CMP_OPERATIONS(TypeSelector) | ^~~~~~~~~~~~~~~~~~~~~ src/ast_selectors.hpp:133:10: warning: ‘virtual bool Sass::SimpleSelector::operator==(const Sass::Selector&) const’ was hidden [-Woverloaded-virtual=] 133 | bool operator==(const Selector& rhs) const final override; | ^~~~~~~~ src/ast_def_macros.hpp:109:16: note: by ‘Sass::TypeSelector::operator==’ 109 | virtual bool operator==(const klass& rhs) const; \ | ^~~~~~~~ src/ast_selectors.hpp:174:5: note: in expansion of macro ‘ATTACH_CMP_OPERATIONS’ 174 | ATTACH_CMP_OPERATIONS(TypeSelector) | ^~~~~~~~~~~~~~~~~~~~~ src/ast_def_macros.hpp:106:16: warning: ‘virtual bool Sass::SimpleSelector::operator!=(const Sass::SimpleSelector&) const’ was hidden [-Woverloaded-virtual=] 106 | virtual bool operator!=(const klass& rhs) const { return !(*this == rhs); }; \ | ^~~~~~~~ src/ast_selectors.hpp:139:5: note: in expansion of macro ‘ATTACH_VIRTUAL_CMP_OPERATIONS’ 139 | ATTACH_VIRTUAL_CMP_OPERATIONS(SimpleSelector); | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~ src/ast_def_macros.hpp:110:16: note: by ‘virtual bool Sass::TypeSelector::operator!=(const Sass::TypeSelector&) const’ 110 | virtual bool operator!=(const klass& rhs) const { return !(*this == rhs); }; \ | ^~~~~~~~ src/ast_selectors.hpp:174:5: note: in expansion of macro ‘ATTACH_CMP_OPERATIONS’ 174 | ATTACH_CMP_OPERATIONS(TypeSelector) | ^~~~~~~~~~~~~~~~~~~~~ src/ast_selectors.hpp:137:18: warning: ‘virtual bool Sass::SimpleSelector::operator==(const Sass::CompoundSelector&) const’ was hidden [-Woverloaded-virtual=] 137 | virtual bool operator==(const CompoundSelector& rhs) const; | ^~~~~~~~ src/ast_def_macros.hpp:109:16: note: by ‘Sass::ClassSelector::operator==’ 109 | virtual bool operator==(const klass& rhs) const; \ | ^~~~~~~~ src/ast_selectors.hpp:188:5: note: in expansion of macro ‘ATTACH_CMP_OPERATIONS’ 188 | ATTACH_CMP_OPERATIONS(ClassSelector) | ^~~~~~~~~~~~~~~~~~~~~ src/ast_selectors.hpp:136:18: warning: ‘virtual bool Sass::SimpleSelector::operator==(const Sass::ComplexSelector&) const’ was hidden [-Woverloaded-virtual=] 136 | virtual bool operator==(const ComplexSelector& rhs) const; | ^~~~~~~~ src/ast_def_macros.hpp:109:16: note: by ‘Sass::ClassSelector::operator==’ 109 | virtual bool operator==(const klass& rhs) const; \ | ^~~~~~~~ src/ast_selectors.hpp:188:5: note: in expansion of macro ‘ATTACH_CMP_OPERATIONS’ 188 | ATTACH_CMP_OPERATIONS(ClassSelector) | ^~~~~~~~~~~~~~~~~~~~~ src/ast_selectors.hpp:135:18: warning: ‘virtual bool Sass::SimpleSelector::operator==(const Sass::SelectorList&) const’ was hidden [-Woverloaded-virtual=] 135 | virtual bool operator==(const SelectorList& rhs) const; | ^~~~~~~~ src/ast_def_macros.hpp:109:16: note: by ‘Sass::ClassSelector::operator==’ 109 | virtual bool operator==(const klass& rhs) const; \ | ^~~~~~~~ src/ast_selectors.hpp:188:5: note: in expansion of macro ‘ATTACH_CMP_OPERATIONS’ 188 | ATTACH_CMP_OPERATIONS(ClassSelector) | ^~~~~~~~~~~~~~~~~~~~~ src/ast_selectors.hpp:133:10: warning: ‘virtual bool Sass::SimpleSelector::operator==(const Sass::Selector&) const’ was hidden [-Woverloaded-virtual=] 133 | bool operator==(const Selector& rhs) const final override; | ^~~~~~~~ src/ast_def_macros.hpp:109:16: note: by ‘Sass::ClassSelector::operator==’ 109 | virtual bool operator==(const klass& rhs) const; \ | ^~~~~~~~ src/ast_selectors.hpp:188:5: note: in expansion of macro ‘ATTACH_CMP_OPERATIONS’ 188 | ATTACH_CMP_OPERATIONS(ClassSelector) | ^~~~~~~~~~~~~~~~~~~~~ src/ast_def_macros.hpp:106:16: warning: ‘virtual bool Sass::SimpleSelector::operator!=(const Sass::SimpleSelector&) const’ was hidden [-Woverloaded-virtual=] 106 | virtual bool operator!=(const klass& rhs) const { return !(*this == rhs); }; \ | ^~~~~~~~ src/ast_selectors.hpp:139:5: note: in expansion of macro ‘ATTACH_VIRTUAL_CMP_OPERATIONS’ 139 | ATTACH_VIRTUAL_CMP_OPERATIONS(SimpleSelector); | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~ src/ast_def_macros.hpp:110:16: note: by ‘virtual bool Sass::ClassSelector::operator!=(const Sass::ClassSelector&) const’ 110 | virtual bool operator!=(const klass& rhs) const { return !(*this == rhs); }; \ | ^~~~~~~~ src/ast_selectors.hpp:188:5: note: in expansion of macro ‘ATTACH_CMP_OPERATIONS’ 188 | ATTACH_CMP_OPERATIONS(ClassSelector) | ^~~~~~~~~~~~~~~~~~~~~ src/ast_selectors.hpp:137:18: warning: ‘virtual bool Sass::SimpleSelector::operator==(const Sass::CompoundSelector&) const’ was hidden [-Woverloaded-virtual=] 137 | virtual bool operator==(const CompoundSelector& rhs) const; | ^~~~~~~~ src/ast_def_macros.hpp:109:16: note: by ‘Sass::IDSelector::operator==’ 109 | virtual bool operator==(const klass& rhs) const; \ | ^~~~~~~~ src/ast_selectors.hpp:204:5: note: in expansion of macro ‘ATTACH_CMP_OPERATIONS’ 204 | ATTACH_CMP_OPERATIONS(IDSelector) | ^~~~~~~~~~~~~~~~~~~~~ src/ast_selectors.hpp:136:18: warning: ‘virtual bool Sass::SimpleSelector::operator==(const Sass::ComplexSelector&) const’ was hidden [-Woverloaded-virtual=] 136 | virtual bool operator==(const ComplexSelector& rhs) const; | ^~~~~~~~ src/ast_def_macros.hpp:109:16: note: by ‘Sass::IDSelector::operator==’ 109 | virtual bool operator==(const klass& rhs) const; \ | ^~~~~~~~ src/ast_selectors.hpp:204:5: note: in expansion of macro ‘ATTACH_CMP_OPERATIONS’ 204 | ATTACH_CMP_OPERATIONS(IDSelector) | ^~~~~~~~~~~~~~~~~~~~~ src/ast_selectors.hpp:135:18: warning: ‘virtual bool Sass::SimpleSelector::operator==(const Sass::SelectorList&) const’ was hidden [-Woverloaded-virtual=] 135 | virtual bool operator==(const SelectorList& rhs) const; | ^~~~~~~~ src/ast_def_macros.hpp:109:16: note: by ‘Sass::IDSelector::operator==’ 109 | virtual bool operator==(const klass& rhs) const; \ | ^~~~~~~~ src/ast_selectors.hpp:204:5: note: in expansion of macro ‘ATTACH_CMP_OPERATIONS’ 204 | ATTACH_CMP_OPERATIONS(IDSelector) | ^~~~~~~~~~~~~~~~~~~~~ src/ast_selectors.hpp:133:10: warning: ‘virtual bool Sass::SimpleSelector::operator==(const Sass::Selector&) const’ was hidden [-Woverloaded-virtual=] 133 | bool operator==(const Selector& rhs) const final override; | ^~~~~~~~ src/ast_def_macros.hpp:109:16: note: by ‘Sass::IDSelector::operator==’ 109 | virtual bool operator==(const klass& rhs) const; \ | ^~~~~~~~ src/ast_selectors.hpp:204:5: note: in expansion of macro ‘ATTACH_CMP_OPERATIONS’ 204 | ATTACH_CMP_OPERATIONS(IDSelector) | ^~~~~~~~~~~~~~~~~~~~~ src/ast_def_macros.hpp:106:16: warning: ‘virtual bool Sass::SimpleSelector::operator!=(const Sass::SimpleSelector&) const’ was hidden [-Woverloaded-virtual=] 106 | virtual bool operator!=(const klass& rhs) const { return !(*this == rhs); }; \ | ^~~~~~~~ src/ast_selectors.hpp:139:5: note: in expansion of macro ‘ATTACH_VIRTUAL_CMP_OPERATIONS’ 139 | ATTACH_VIRTUAL_CMP_OPERATIONS(SimpleSelector); | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~ src/ast_def_macros.hpp:110:16: note: by ‘virtual bool Sass::IDSelector::operator!=(const Sass::IDSelector&) const’ 110 | virtual bool operator!=(const klass& rhs) const { return !(*this == rhs); }; \ | ^~~~~~~~ src/ast_selectors.hpp:204:5: note: in expansion of macro ‘ATTACH_CMP_OPERATIONS’ 204 | ATTACH_CMP_OPERATIONS(IDSelector) | ^~~~~~~~~~~~~~~~~~~~~ src/ast_selectors.hpp:137:18: warning: ‘virtual bool Sass::SimpleSelector::operator==(const Sass::CompoundSelector&) const’ was hidden [-Woverloaded-virtual=] 137 | virtual bool operator==(const CompoundSelector& rhs) const; | ^~~~~~~~ src/ast_def_macros.hpp:109:16: note: by ‘Sass::AttributeSelector::operator==’ 109 | virtual bool operator==(const klass& rhs) const; \ | ^~~~~~~~ src/ast_selectors.hpp:223:5: note: in expansion of macro ‘ATTACH_CMP_OPERATIONS’ 223 | ATTACH_CMP_OPERATIONS(AttributeSelector) | ^~~~~~~~~~~~~~~~~~~~~ src/ast_selectors.hpp:136:18: warning: ‘virtual bool Sass::SimpleSelector::operator==(const Sass::ComplexSelector&) const’ was hidden [-Woverloaded-virtual=] 136 | virtual bool operator==(const ComplexSelector& rhs) const; | ^~~~~~~~ src/ast_def_macros.hpp:109:16: note: by ‘Sass::AttributeSelector::operator==’ 109 | virtual bool operator==(const klass& rhs) const; \ | ^~~~~~~~ src/ast_selectors.hpp:223:5: note: in expansion of macro ‘ATTACH_CMP_OPERATIONS’ 223 | ATTACH_CMP_OPERATIONS(AttributeSelector) | ^~~~~~~~~~~~~~~~~~~~~ src/ast_selectors.hpp:135:18: warning: ‘virtual bool Sass::SimpleSelector::operator==(const Sass::SelectorList&) const’ was hidden [-Woverloaded-virtual=] 135 | virtual bool operator==(const SelectorList& rhs) const; | ^~~~~~~~ src/ast_def_macros.hpp:109:16: note: by ‘Sass::AttributeSelector::operator==’ 109 | virtual bool operator==(const klass& rhs) const; \ | ^~~~~~~~ src/ast_selectors.hpp:223:5: note: in expansion of macro ‘ATTACH_CMP_OPERATIONS’ 223 | ATTACH_CMP_OPERATIONS(AttributeSelector) | ^~~~~~~~~~~~~~~~~~~~~ src/ast_selectors.hpp:133:10: warning: ‘virtual bool Sass::SimpleSelector::operator==(const Sass::Selector&) const’ was hidden [-Woverloaded-virtual=] 133 | bool operator==(const Selector& rhs) const final override; | ^~~~~~~~ src/ast_def_macros.hpp:109:16: note: by ‘Sass::AttributeSelector::operator==’ 109 | virtual bool operator==(const klass& rhs) const; \ | ^~~~~~~~ src/ast_selectors.hpp:223:5: note: in expansion of macro ‘ATTACH_CMP_OPERATIONS’ 223 | ATTACH_CMP_OPERATIONS(AttributeSelector) | ^~~~~~~~~~~~~~~~~~~~~ src/ast_def_macros.hpp:106:16: warning: ‘virtual bool Sass::SimpleSelector::operator!=(const Sass::SimpleSelector&) const’ was hidden [-Woverloaded-virtual=] 106 | virtual bool operator!=(const klass& rhs) const { return !(*this == rhs); }; \ | ^~~~~~~~ src/ast_selectors.hpp:139:5: note: in expansion of macro ‘ATTACH_VIRTUAL_CMP_OPERATIONS’ 139 | ATTACH_VIRTUAL_CMP_OPERATIONS(SimpleSelector); | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~ src/ast_def_macros.hpp:110:16: note: by ‘virtual bool Sass::AttributeSelector::operator!=(const Sass::AttributeSelector&) const’ 110 | virtual bool operator!=(const klass& rhs) const { return !(*this == rhs); }; \ | ^~~~~~~~ src/ast_selectors.hpp:223:5: note: in expansion of macro ‘ATTACH_CMP_OPERATIONS’ 223 | ATTACH_CMP_OPERATIONS(AttributeSelector) | ^~~~~~~~~~~~~~~~~~~~~ src/ast_def_macros.hpp:106:16: warning: ‘virtual bool Sass::Selector::operator!=(const Sass::Selector&) const’ was hidden [-Woverloaded-virtual=] 106 | virtual bool operator!=(const klass& rhs) const { return !(*this == rhs); }; \ | ^~~~~~~~ src/ast_selectors.hpp:56:5: note: in expansion of macro ‘ATTACH_VIRTUAL_CMP_OPERATIONS’ 56 | ATTACH_VIRTUAL_CMP_OPERATIONS(Selector) | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~ src/ast_def_macros.hpp:110:16: note: by ‘virtual bool Sass::ComplexSelector::operator!=(const Sass::ComplexSelector&) const’ 110 | virtual bool operator!=(const klass& rhs) const { return !(*this == rhs); }; \ | ^~~~~~~~ src/ast_selectors.hpp:310:5: note: in expansion of macro ‘ATTACH_CMP_OPERATIONS’ 310 | ATTACH_CMP_OPERATIONS(ComplexSelector) | ^~~~~~~~~~~~~~~~~~~~~ src/ast_def_macros.hpp:106:16: warning: ‘virtual bool Sass::Selector::operator!=(const Sass::Selector&) const’ was hidden [-Woverloaded-virtual=] 106 | virtual bool operator!=(const klass& rhs) const { return !(*this == rhs); }; \ | ^~~~~~~~ src/ast_selectors.hpp:56:5: note: in expansion of macro ‘ATTACH_VIRTUAL_CMP_OPERATIONS’ 56 | ATTACH_VIRTUAL_CMP_OPERATIONS(Selector) | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~ src/ast_def_macros.hpp:106:16: note: by ‘virtual bool Sass::SelectorComponent::operator!=(const Sass::SelectorComponent&) const’ 106 | virtual bool operator!=(const klass& rhs) const { return !(*this == rhs); }; \ | ^~~~~~~~ src/ast_selectors.hpp:349:5: note: in expansion of macro ‘ATTACH_VIRTUAL_CMP_OPERATIONS’ 349 | ATTACH_VIRTUAL_CMP_OPERATIONS(SelectorComponent); | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~ src/ast_def_macros.hpp:106:16: warning: ‘virtual bool Sass::SelectorComponent::operator!=(const Sass::SelectorComponent&) const’ was hidden [-Woverloaded-virtual=] 106 | virtual bool operator!=(const klass& rhs) const { return !(*this == rhs); }; \ | ^~~~~~~~ src/ast_selectors.hpp:349:5: note: in expansion of macro ‘ATTACH_VIRTUAL_CMP_OPERATIONS’ 349 | ATTACH_VIRTUAL_CMP_OPERATIONS(SelectorComponent); | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~ src/ast_def_macros.hpp:110:16: note: by ‘virtual bool Sass::SelectorCombinator::operator!=(const Sass::SelectorCombinator&) const’ 110 | virtual bool operator!=(const klass& rhs) const { return !(*this == rhs); }; \ | ^~~~~~~~ src/ast_selectors.hpp:407:5: note: in expansion of macro ‘ATTACH_CMP_OPERATIONS’ 407 | ATTACH_CMP_OPERATIONS(SelectorCombinator) | ^~~~~~~~~~~~~~~~~~~~~ g++ -std=gnu++17 -Wall -O2 -std=c++11 -I ./include -fPIC -c -o src/ast_sel_cmp.o src/ast_sel_cmp.cpp In file included from src/ast_selectors.hpp:7, from src/ast_sel_cmp.cpp:5: src/ast.hpp:90:18: warning: ‘virtual bool Sass::AST_Node::operator==(const Sass::AST_Node&) const’ was hidden [-Woverloaded-virtual=] 90 | virtual bool operator== (const AST_Node& rhs) const { | ^~~~~~~~ src/ast.hpp:165:18: note: by ‘virtual bool Sass::Expression::operator==(const Sass::Expression&) const’ 165 | virtual bool operator== (const Expression& rhs) const { return false; } | ^~~~~~~~ src/ast.hpp:96:18: warning: ‘virtual bool Sass::AST_Node::operator!=(const Sass::AST_Node&) const’ was hidden [-Woverloaded-virtual=] 96 | virtual bool operator!= (const AST_Node& rhs) const { | ^~~~~~~~ src/ast.hpp:167:17: note: by ‘bool Sass::Expression::operator!=(const Sass::Expression&) const’ 167 | inline bool operator!=(const Expression& rhs) const { return !(rhs == *this); } | ^~~~~~~~ src/ast.hpp:90:18: warning: ‘virtual bool Sass::AST_Node::operator==(const Sass::AST_Node&) const’ was hidden [-Woverloaded-virtual=] 90 | virtual bool operator== (const AST_Node& rhs) const { | ^~~~~~~~ src/ast.hpp:908:10: note: by ‘bool Sass::CssMediaRule::operator==(const Sass::CssMediaRule&) const’ 908 | bool operator== (const CssMediaRule& rhs) const { | ^~~~~~~~ src/ast.hpp:96:18: warning: ‘virtual bool Sass::AST_Node::operator!=(const Sass::AST_Node&) const’ was hidden [-Woverloaded-virtual=] 96 | virtual bool operator!= (const AST_Node& rhs) const { | ^~~~~~~~ src/ast.hpp:911:10: note: by ‘bool Sass::CssMediaRule::operator!=(const Sass::CssMediaRule&) const’ 911 | bool operator!=(const CssMediaRule& rhs) const { | ^~~~~~~~ src/ast.hpp:90:18: warning: ‘virtual bool Sass::AST_Node::operator==(const Sass::AST_Node&) const’ was hidden [-Woverloaded-virtual=] 90 | virtual bool operator== (const AST_Node& rhs) const { | ^~~~~~~~ src/ast.hpp:939:10: note: by ‘bool Sass::CssMediaQuery::operator==(const Sass::CssMediaQuery&) const’ 939 | bool operator== (const CssMediaQuery& rhs) const; | ^~~~~~~~ src/ast.hpp:96:18: warning: ‘virtual bool Sass::AST_Node::operator!=(const Sass::AST_Node&) const’ was hidden [-Woverloaded-virtual=] 96 | virtual bool operator!= (const AST_Node& rhs) const { | ^~~~~~~~ src/ast.hpp:940:10: note: by ‘bool Sass::CssMediaQuery::operator!=(const Sass::CssMediaQuery&) const’ 940 | bool operator!=(const CssMediaQuery& rhs) const { | ^~~~~~~~ src/ast.hpp:165:18: warning: ‘virtual bool Sass::Expression::operator==(const Sass::Expression&) const’ was hidden [-Woverloaded-virtual=] 165 | virtual bool operator== (const Expression& rhs) const { return false; } | ^~~~~~~~ In file included from src/ast.hpp:14: src/ast_def_macros.hpp:105:16: note: by ‘virtual bool Sass::Selector::operator==(const Sass::Selector&) const’ 105 | virtual bool operator==(const klass& rhs) const = 0; \ | ^~~~~~~~ src/ast_selectors.hpp:56:5: note: in expansion of macro ‘ATTACH_VIRTUAL_CMP_OPERATIONS’ 56 | ATTACH_VIRTUAL_CMP_OPERATIONS(Selector) | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~ src/ast.hpp:96:18: warning: ‘virtual bool Sass::AST_Node::operator!=(const Sass::AST_Node&) const’ was hidden [-Woverloaded-virtual=] 96 | virtual bool operator!= (const AST_Node& rhs) const { | ^~~~~~~~ src/ast_def_macros.hpp:106:16: note: by ‘virtual bool Sass::Selector::operator!=(const Sass::Selector&) const’ 106 | virtual bool operator!=(const klass& rhs) const { return !(*this == rhs); }; \ | ^~~~~~~~ src/ast_selectors.hpp:56:5: note: in expansion of macro ‘ATTACH_VIRTUAL_CMP_OPERATIONS’ 56 | ATTACH_VIRTUAL_CMP_OPERATIONS(Selector) | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~ src/ast_def_macros.hpp:106:16: warning: ‘virtual bool Sass::Selector::operator!=(const Sass::Selector&) const’ was hidden [-Woverloaded-virtual=] 106 | virtual bool operator!=(const klass& rhs) const { return !(*this == rhs); }; \ | ^~~~~~~~ src/ast_selectors.hpp:56:5: note: in expansion of macro ‘ATTACH_VIRTUAL_CMP_OPERATIONS’ 56 | ATTACH_VIRTUAL_CMP_OPERATIONS(Selector) | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~ src/ast_def_macros.hpp:106:16: note: by ‘virtual bool Sass::SimpleSelector::operator!=(const Sass::SimpleSelector&) const’ 106 | virtual bool operator!=(const klass& rhs) const { return !(*this == rhs); }; \ | ^~~~~~~~ src/ast_selectors.hpp:139:5: note: in expansion of macro ‘ATTACH_VIRTUAL_CMP_OPERATIONS’ 139 | ATTACH_VIRTUAL_CMP_OPERATIONS(SimpleSelector); | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~ src/ast_selectors.hpp:137:18: warning: ‘virtual bool Sass::SimpleSelector::operator==(const Sass::CompoundSelector&) const’ was hidden [-Woverloaded-virtual=] 137 | virtual bool operator==(const CompoundSelector& rhs) const; | ^~~~~~~~ src/ast_def_macros.hpp:109:16: note: by ‘Sass::PlaceholderSelector::operator==’ 109 | virtual bool operator==(const klass& rhs) const; \ | ^~~~~~~~ src/ast_selectors.hpp:157:5: note: in expansion of macro ‘ATTACH_CMP_OPERATIONS’ 157 | ATTACH_CMP_OPERATIONS(PlaceholderSelector) | ^~~~~~~~~~~~~~~~~~~~~ src/ast_selectors.hpp:136:18: warning: ‘virtual bool Sass::SimpleSelector::operator==(const Sass::ComplexSelector&) const’ was hidden [-Woverloaded-virtual=] 136 | virtual bool operator==(const ComplexSelector& rhs) const; | ^~~~~~~~ src/ast_def_macros.hpp:109:16: note: by ‘Sass::PlaceholderSelector::operator==’ 109 | virtual bool operator==(const klass& rhs) const; \ | ^~~~~~~~ src/ast_selectors.hpp:157:5: note: in expansion of macro ‘ATTACH_CMP_OPERATIONS’ 157 | ATTACH_CMP_OPERATIONS(PlaceholderSelector) | ^~~~~~~~~~~~~~~~~~~~~ src/ast_selectors.hpp:135:18: warning: ‘virtual bool Sass::SimpleSelector::operator==(const Sass::SelectorList&) const’ was hidden [-Woverloaded-virtual=] 135 | virtual bool operator==(const SelectorList& rhs) const; | ^~~~~~~~ src/ast_def_macros.hpp:109:16: note: by ‘Sass::PlaceholderSelector::operator==’ 109 | virtual bool operator==(const klass& rhs) const; \ | ^~~~~~~~ src/ast_selectors.hpp:157:5: note: in expansion of macro ‘ATTACH_CMP_OPERATIONS’ 157 | ATTACH_CMP_OPERATIONS(PlaceholderSelector) | ^~~~~~~~~~~~~~~~~~~~~ src/ast_selectors.hpp:133:10: warning: ‘virtual bool Sass::SimpleSelector::operator==(const Sass::Selector&) const’ was hidden [-Woverloaded-virtual=] 133 | bool operator==(const Selector& rhs) const final override; | ^~~~~~~~ src/ast_def_macros.hpp:109:16: note: by ‘Sass::PlaceholderSelector::operator==’ 109 | virtual bool operator==(const klass& rhs) const; \ | ^~~~~~~~ src/ast_selectors.hpp:157:5: note: in expansion of macro ‘ATTACH_CMP_OPERATIONS’ 157 | ATTACH_CMP_OPERATIONS(PlaceholderSelector) | ^~~~~~~~~~~~~~~~~~~~~ src/ast_def_macros.hpp:106:16: warning: ‘virtual bool Sass::SimpleSelector::operator!=(const Sass::SimpleSelector&) const’ was hidden [-Woverloaded-virtual=] 106 | virtual bool operator!=(const klass& rhs) const { return !(*this == rhs); }; \ | ^~~~~~~~ src/ast_selectors.hpp:139:5: note: in expansion of macro ‘ATTACH_VIRTUAL_CMP_OPERATIONS’ 139 | ATTACH_VIRTUAL_CMP_OPERATIONS(SimpleSelector); | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~ src/ast_def_macros.hpp:110:16: note: by ‘virtual bool Sass::PlaceholderSelector::operator!=(const Sass::PlaceholderSelector&) const’ 110 | virtual bool operator!=(const klass& rhs) const { return !(*this == rhs); }; \ | ^~~~~~~~ src/ast_selectors.hpp:157:5: note: in expansion of macro ‘ATTACH_CMP_OPERATIONS’ 157 | ATTACH_CMP_OPERATIONS(PlaceholderSelector) | ^~~~~~~~~~~~~~~~~~~~~ src/ast_selectors.hpp:137:18: warning: ‘virtual bool Sass::SimpleSelector::operator==(const Sass::CompoundSelector&) const’ was hidden [-Woverloaded-virtual=] 137 | virtual bool operator==(const CompoundSelector& rhs) const; | ^~~~~~~~ src/ast_def_macros.hpp:109:16: note: by ‘Sass::TypeSelector::operator==’ 109 | virtual bool operator==(const klass& rhs) const; \ | ^~~~~~~~ src/ast_selectors.hpp:174:5: note: in expansion of macro ‘ATTACH_CMP_OPERATIONS’ 174 | ATTACH_CMP_OPERATIONS(TypeSelector) | ^~~~~~~~~~~~~~~~~~~~~ src/ast_selectors.hpp:136:18: warning: ‘virtual bool Sass::SimpleSelector::operator==(const Sass::ComplexSelector&) const’ was hidden [-Woverloaded-virtual=] 136 | virtual bool operator==(const ComplexSelector& rhs) const; | ^~~~~~~~ src/ast_def_macros.hpp:109:16: note: by ‘Sass::TypeSelector::operator==’ 109 | virtual bool operator==(const klass& rhs) const; \ | ^~~~~~~~ src/ast_selectors.hpp:174:5: note: in expansion of macro ‘ATTACH_CMP_OPERATIONS’ 174 | ATTACH_CMP_OPERATIONS(TypeSelector) | ^~~~~~~~~~~~~~~~~~~~~ src/ast_selectors.hpp:135:18: warning: ‘virtual bool Sass::SimpleSelector::operator==(const Sass::SelectorList&) const’ was hidden [-Woverloaded-virtual=] 135 | virtual bool operator==(const SelectorList& rhs) const; | ^~~~~~~~ src/ast_def_macros.hpp:109:16: note: by ‘Sass::TypeSelector::operator==’ 109 | virtual bool operator==(const klass& rhs) const; \ | ^~~~~~~~ src/ast_selectors.hpp:174:5: note: in expansion of macro ‘ATTACH_CMP_OPERATIONS’ 174 | ATTACH_CMP_OPERATIONS(TypeSelector) | ^~~~~~~~~~~~~~~~~~~~~ src/ast_selectors.hpp:133:10: warning: ‘virtual bool Sass::SimpleSelector::operator==(const Sass::Selector&) const’ was hidden [-Woverloaded-virtual=] 133 | bool operator==(const Selector& rhs) const final override; | ^~~~~~~~ src/ast_def_macros.hpp:109:16: note: by ‘Sass::TypeSelector::operator==’ 109 | virtual bool operator==(const klass& rhs) const; \ | ^~~~~~~~ src/ast_selectors.hpp:174:5: note: in expansion of macro ‘ATTACH_CMP_OPERATIONS’ 174 | ATTACH_CMP_OPERATIONS(TypeSelector) | ^~~~~~~~~~~~~~~~~~~~~ src/ast_def_macros.hpp:106:16: warning: ‘virtual bool Sass::SimpleSelector::operator!=(const Sass::SimpleSelector&) const’ was hidden [-Woverloaded-virtual=] 106 | virtual bool operator!=(const klass& rhs) const { return !(*this == rhs); }; \ | ^~~~~~~~ src/ast_selectors.hpp:139:5: note: in expansion of macro ‘ATTACH_VIRTUAL_CMP_OPERATIONS’ 139 | ATTACH_VIRTUAL_CMP_OPERATIONS(SimpleSelector); | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~ src/ast_def_macros.hpp:110:16: note: by ‘virtual bool Sass::TypeSelector::operator!=(const Sass::TypeSelector&) const’ 110 | virtual bool operator!=(const klass& rhs) const { return !(*this == rhs); }; \ | ^~~~~~~~ src/ast_selectors.hpp:174:5: note: in expansion of macro ‘ATTACH_CMP_OPERATIONS’ 174 | ATTACH_CMP_OPERATIONS(TypeSelector) | ^~~~~~~~~~~~~~~~~~~~~ src/ast_selectors.hpp:137:18: warning: ‘virtual bool Sass::SimpleSelector::operator==(const Sass::CompoundSelector&) const’ was hidden [-Woverloaded-virtual=] 137 | virtual bool operator==(const CompoundSelector& rhs) const; | ^~~~~~~~ src/ast_def_macros.hpp:109:16: note: by ‘Sass::ClassSelector::operator==’ 109 | virtual bool operator==(const klass& rhs) const; \ | ^~~~~~~~ src/ast_selectors.hpp:188:5: note: in expansion of macro ‘ATTACH_CMP_OPERATIONS’ 188 | ATTACH_CMP_OPERATIONS(ClassSelector) | ^~~~~~~~~~~~~~~~~~~~~ src/ast_selectors.hpp:136:18: warning: ‘virtual bool Sass::SimpleSelector::operator==(const Sass::ComplexSelector&) const’ was hidden [-Woverloaded-virtual=] 136 | virtual bool operator==(const ComplexSelector& rhs) const; | ^~~~~~~~ src/ast_def_macros.hpp:109:16: note: by ‘Sass::ClassSelector::operator==’ 109 | virtual bool operator==(const klass& rhs) const; \ | ^~~~~~~~ src/ast_selectors.hpp:188:5: note: in expansion of macro ‘ATTACH_CMP_OPERATIONS’ 188 | ATTACH_CMP_OPERATIONS(ClassSelector) | ^~~~~~~~~~~~~~~~~~~~~ src/ast_selectors.hpp:135:18: warning: ‘virtual bool Sass::SimpleSelector::operator==(const Sass::SelectorList&) const’ was hidden [-Woverloaded-virtual=] 135 | virtual bool operator==(const SelectorList& rhs) const; | ^~~~~~~~ src/ast_def_macros.hpp:109:16: note: by ‘Sass::ClassSelector::operator==’ 109 | virtual bool operator==(const klass& rhs) const; \ | ^~~~~~~~ src/ast_selectors.hpp:188:5: note: in expansion of macro ‘ATTACH_CMP_OPERATIONS’ 188 | ATTACH_CMP_OPERATIONS(ClassSelector) | ^~~~~~~~~~~~~~~~~~~~~ src/ast_selectors.hpp:133:10: warning: ‘virtual bool Sass::SimpleSelector::operator==(const Sass::Selector&) const’ was hidden [-Woverloaded-virtual=] 133 | bool operator==(const Selector& rhs) const final override; | ^~~~~~~~ src/ast_def_macros.hpp:109:16: note: by ‘Sass::ClassSelector::operator==’ 109 | virtual bool operator==(const klass& rhs) const; \ | ^~~~~~~~ src/ast_selectors.hpp:188:5: note: in expansion of macro ‘ATTACH_CMP_OPERATIONS’ 188 | ATTACH_CMP_OPERATIONS(ClassSelector) | ^~~~~~~~~~~~~~~~~~~~~ src/ast_def_macros.hpp:106:16: warning: ‘virtual bool Sass::SimpleSelector::operator!=(const Sass::SimpleSelector&) const’ was hidden [-Woverloaded-virtual=] 106 | virtual bool operator!=(const klass& rhs) const { return !(*this == rhs); }; \ | ^~~~~~~~ src/ast_selectors.hpp:139:5: note: in expansion of macro ‘ATTACH_VIRTUAL_CMP_OPERATIONS’ 139 | ATTACH_VIRTUAL_CMP_OPERATIONS(SimpleSelector); | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~ src/ast_def_macros.hpp:110:16: note: by ‘virtual bool Sass::ClassSelector::operator!=(const Sass::ClassSelector&) const’ 110 | virtual bool operator!=(const klass& rhs) const { return !(*this == rhs); }; \ | ^~~~~~~~ src/ast_selectors.hpp:188:5: note: in expansion of macro ‘ATTACH_CMP_OPERATIONS’ 188 | ATTACH_CMP_OPERATIONS(ClassSelector) | ^~~~~~~~~~~~~~~~~~~~~ src/ast_selectors.hpp:137:18: warning: ‘virtual bool Sass::SimpleSelector::operator==(const Sass::CompoundSelector&) const’ was hidden [-Woverloaded-virtual=] 137 | virtual bool operator==(const CompoundSelector& rhs) const; | ^~~~~~~~ src/ast_def_macros.hpp:109:16: note: by ‘Sass::IDSelector::operator==’ 109 | virtual bool operator==(const klass& rhs) const; \ | ^~~~~~~~ src/ast_selectors.hpp:204:5: note: in expansion of macro ‘ATTACH_CMP_OPERATIONS’ 204 | ATTACH_CMP_OPERATIONS(IDSelector) | ^~~~~~~~~~~~~~~~~~~~~ src/ast_selectors.hpp:136:18: warning: ‘virtual bool Sass::SimpleSelector::operator==(const Sass::ComplexSelector&) const’ was hidden [-Woverloaded-virtual=] 136 | virtual bool operator==(const ComplexSelector& rhs) const; | ^~~~~~~~ src/ast_def_macros.hpp:109:16: note: by ‘Sass::IDSelector::operator==’ 109 | virtual bool operator==(const klass& rhs) const; \ | ^~~~~~~~ src/ast_selectors.hpp:204:5: note: in expansion of macro ‘ATTACH_CMP_OPERATIONS’ 204 | ATTACH_CMP_OPERATIONS(IDSelector) | ^~~~~~~~~~~~~~~~~~~~~ src/ast_selectors.hpp:135:18: warning: ‘virtual bool Sass::SimpleSelector::operator==(const Sass::SelectorList&) const’ was hidden [-Woverloaded-virtual=] 135 | virtual bool operator==(const SelectorList& rhs) const; | ^~~~~~~~ src/ast_def_macros.hpp:109:16: note: by ‘Sass::IDSelector::operator==’ 109 | virtual bool operator==(const klass& rhs) const; \ | ^~~~~~~~ src/ast_selectors.hpp:204:5: note: in expansion of macro ‘ATTACH_CMP_OPERATIONS’ 204 | ATTACH_CMP_OPERATIONS(IDSelector) | ^~~~~~~~~~~~~~~~~~~~~ src/ast_selectors.hpp:133:10: warning: ‘virtual bool Sass::SimpleSelector::operator==(const Sass::Selector&) const’ was hidden [-Woverloaded-virtual=] 133 | bool operator==(const Selector& rhs) const final override; | ^~~~~~~~ src/ast_def_macros.hpp:109:16: note: by ‘Sass::IDSelector::operator==’ 109 | virtual bool operator==(const klass& rhs) const; \ | ^~~~~~~~ src/ast_selectors.hpp:204:5: note: in expansion of macro ‘ATTACH_CMP_OPERATIONS’ 204 | ATTACH_CMP_OPERATIONS(IDSelector) | ^~~~~~~~~~~~~~~~~~~~~ src/ast_def_macros.hpp:106:16: warning: ‘virtual bool Sass::SimpleSelector::operator!=(const Sass::SimpleSelector&) const’ was hidden [-Woverloaded-virtual=] 106 | virtual bool operator!=(const klass& rhs) const { return !(*this == rhs); }; \ | ^~~~~~~~ src/ast_selectors.hpp:139:5: note: in expansion of macro ‘ATTACH_VIRTUAL_CMP_OPERATIONS’ 139 | ATTACH_VIRTUAL_CMP_OPERATIONS(SimpleSelector); | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~ src/ast_def_macros.hpp:110:16: note: by ‘virtual bool Sass::IDSelector::operator!=(const Sass::IDSelector&) const’ 110 | virtual bool operator!=(const klass& rhs) const { return !(*this == rhs); }; \ | ^~~~~~~~ src/ast_selectors.hpp:204:5: note: in expansion of macro ‘ATTACH_CMP_OPERATIONS’ 204 | ATTACH_CMP_OPERATIONS(IDSelector) | ^~~~~~~~~~~~~~~~~~~~~ src/ast_selectors.hpp:137:18: warning: ‘virtual bool Sass::SimpleSelector::operator==(const Sass::CompoundSelector&) const’ was hidden [-Woverloaded-virtual=] 137 | virtual bool operator==(const CompoundSelector& rhs) const; | ^~~~~~~~ src/ast_def_macros.hpp:109:16: note: by ‘Sass::AttributeSelector::operator==’ 109 | virtual bool operator==(const klass& rhs) const; \ | ^~~~~~~~ src/ast_selectors.hpp:223:5: note: in expansion of macro ‘ATTACH_CMP_OPERATIONS’ 223 | ATTACH_CMP_OPERATIONS(AttributeSelector) | ^~~~~~~~~~~~~~~~~~~~~ src/ast_selectors.hpp:136:18: warning: ‘virtual bool Sass::SimpleSelector::operator==(const Sass::ComplexSelector&) const’ was hidden [-Woverloaded-virtual=] 136 | virtual bool operator==(const ComplexSelector& rhs) const; | ^~~~~~~~ src/ast_def_macros.hpp:109:16: note: by ‘Sass::AttributeSelector::operator==’ 109 | virtual bool operator==(const klass& rhs) const; \ | ^~~~~~~~ src/ast_selectors.hpp:223:5: note: in expansion of macro ‘ATTACH_CMP_OPERATIONS’ 223 | ATTACH_CMP_OPERATIONS(AttributeSelector) | ^~~~~~~~~~~~~~~~~~~~~ src/ast_selectors.hpp:135:18: warning: ‘virtual bool Sass::SimpleSelector::operator==(const Sass::SelectorList&) const’ was hidden [-Woverloaded-virtual=] 135 | virtual bool operator==(const SelectorList& rhs) const; | ^~~~~~~~ src/ast_def_macros.hpp:109:16: note: by ‘Sass::AttributeSelector::operator==’ 109 | virtual bool operator==(const klass& rhs) const; \ | ^~~~~~~~ src/ast_selectors.hpp:223:5: note: in expansion of macro ‘ATTACH_CMP_OPERATIONS’ 223 | ATTACH_CMP_OPERATIONS(AttributeSelector) | ^~~~~~~~~~~~~~~~~~~~~ src/ast_selectors.hpp:133:10: warning: ‘virtual bool Sass::SimpleSelector::operator==(const Sass::Selector&) const’ was hidden [-Woverloaded-virtual=] 133 | bool operator==(const Selector& rhs) const final override; | ^~~~~~~~ src/ast_def_macros.hpp:109:16: note: by ‘Sass::AttributeSelector::operator==’ 109 | virtual bool operator==(const klass& rhs) const; \ | ^~~~~~~~ src/ast_selectors.hpp:223:5: note: in expansion of macro ‘ATTACH_CMP_OPERATIONS’ 223 | ATTACH_CMP_OPERATIONS(AttributeSelector) | ^~~~~~~~~~~~~~~~~~~~~ src/ast_def_macros.hpp:106:16: warning: ‘virtual bool Sass::SimpleSelector::operator!=(const Sass::SimpleSelector&) const’ was hidden [-Woverloaded-virtual=] 106 | virtual bool operator!=(const klass& rhs) const { return !(*this == rhs); }; \ | ^~~~~~~~ src/ast_selectors.hpp:139:5: note: in expansion of macro ‘ATTACH_VIRTUAL_CMP_OPERATIONS’ 139 | ATTACH_VIRTUAL_CMP_OPERATIONS(SimpleSelector); | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~ src/ast_def_macros.hpp:110:16: note: by ‘virtual bool Sass::AttributeSelector::operator!=(const Sass::AttributeSelector&) const’ 110 | virtual bool operator!=(const klass& rhs) const { return !(*this == rhs); }; \ | ^~~~~~~~ src/ast_selectors.hpp:223:5: note: in expansion of macro ‘ATTACH_CMP_OPERATIONS’ 223 | ATTACH_CMP_OPERATIONS(AttributeSelector) | ^~~~~~~~~~~~~~~~~~~~~ src/ast_def_macros.hpp:106:16: warning: ‘virtual bool Sass::Selector::operator!=(const Sass::Selector&) const’ was hidden [-Woverloaded-virtual=] 106 | virtual bool operator!=(const klass& rhs) const { return !(*this == rhs); }; \ | ^~~~~~~~ src/ast_selectors.hpp:56:5: note: in expansion of macro ‘ATTACH_VIRTUAL_CMP_OPERATIONS’ 56 | ATTACH_VIRTUAL_CMP_OPERATIONS(Selector) | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~ src/ast_def_macros.hpp:110:16: note: by ‘virtual bool Sass::ComplexSelector::operator!=(const Sass::ComplexSelector&) const’ 110 | virtual bool operator!=(const klass& rhs) const { return !(*this == rhs); }; \ | ^~~~~~~~ src/ast_selectors.hpp:310:5: note: in expansion of macro ‘ATTACH_CMP_OPERATIONS’ 310 | ATTACH_CMP_OPERATIONS(ComplexSelector) | ^~~~~~~~~~~~~~~~~~~~~ src/ast_def_macros.hpp:106:16: warning: ‘virtual bool Sass::Selector::operator!=(const Sass::Selector&) const’ was hidden [-Woverloaded-virtual=] 106 | virtual bool operator!=(const klass& rhs) const { return !(*this == rhs); }; \ | ^~~~~~~~ src/ast_selectors.hpp:56:5: note: in expansion of macro ‘ATTACH_VIRTUAL_CMP_OPERATIONS’ 56 | ATTACH_VIRTUAL_CMP_OPERATIONS(Selector) | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~ src/ast_def_macros.hpp:106:16: note: by ‘virtual bool Sass::SelectorComponent::operator!=(const Sass::SelectorComponent&) const’ 106 | virtual bool operator!=(const klass& rhs) const { return !(*this == rhs); }; \ | ^~~~~~~~ src/ast_selectors.hpp:349:5: note: in expansion of macro ‘ATTACH_VIRTUAL_CMP_OPERATIONS’ 349 | ATTACH_VIRTUAL_CMP_OPERATIONS(SelectorComponent); | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~ src/ast_def_macros.hpp:106:16: warning: ‘virtual bool Sass::SelectorComponent::operator!=(const Sass::SelectorComponent&) const’ was hidden [-Woverloaded-virtual=] 106 | virtual bool operator!=(const klass& rhs) const { return !(*this == rhs); }; \ | ^~~~~~~~ src/ast_selectors.hpp:349:5: note: in expansion of macro ‘ATTACH_VIRTUAL_CMP_OPERATIONS’ 349 | ATTACH_VIRTUAL_CMP_OPERATIONS(SelectorComponent); | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~ src/ast_def_macros.hpp:110:16: note: by ‘virtual bool Sass::SelectorCombinator::operator!=(const Sass::SelectorCombinator&) const’ 110 | virtual bool operator!=(const klass& rhs) const { return !(*this == rhs); }; \ | ^~~~~~~~ src/ast_selectors.hpp:407:5: note: in expansion of macro ‘ATTACH_CMP_OPERATIONS’ 407 | ATTACH_CMP_OPERATIONS(SelectorCombinator) | ^~~~~~~~~~~~~~~~~~~~~ g++ -std=gnu++17 -Wall -O2 -std=c++11 -I ./include -fPIC -c -o src/ast_sel_unify.o src/ast_sel_unify.cpp In file included from src/ast_sel_unify.cpp:5: src/ast.hpp:90:18: warning: ‘virtual bool Sass::AST_Node::operator==(const Sass::AST_Node&) const’ was hidden [-Woverloaded-virtual=] 90 | virtual bool operator== (const AST_Node& rhs) const { | ^~~~~~~~ src/ast.hpp:165:18: note: by ‘virtual bool Sass::Expression::operator==(const Sass::Expression&) const’ 165 | virtual bool operator== (const Expression& rhs) const { return false; } | ^~~~~~~~ src/ast.hpp:96:18: warning: ‘virtual bool Sass::AST_Node::operator!=(const Sass::AST_Node&) const’ was hidden [-Woverloaded-virtual=] 96 | virtual bool operator!= (const AST_Node& rhs) const { | ^~~~~~~~ src/ast.hpp:167:17: note: by ‘bool Sass::Expression::operator!=(const Sass::Expression&) const’ 167 | inline bool operator!=(const Expression& rhs) const { return !(rhs == *this); } | ^~~~~~~~ src/ast.hpp:90:18: warning: ‘virtual bool Sass::AST_Node::operator==(const Sass::AST_Node&) const’ was hidden [-Woverloaded-virtual=] 90 | virtual bool operator== (const AST_Node& rhs) const { | ^~~~~~~~ src/ast.hpp:908:10: note: by ‘bool Sass::CssMediaRule::operator==(const Sass::CssMediaRule&) const’ 908 | bool operator== (const CssMediaRule& rhs) const { | ^~~~~~~~ src/ast.hpp:96:18: warning: ‘virtual bool Sass::AST_Node::operator!=(const Sass::AST_Node&) const’ was hidden [-Woverloaded-virtual=] 96 | virtual bool operator!= (const AST_Node& rhs) const { | ^~~~~~~~ src/ast.hpp:911:10: note: by ‘bool Sass::CssMediaRule::operator!=(const Sass::CssMediaRule&) const’ 911 | bool operator!=(const CssMediaRule& rhs) const { | ^~~~~~~~ src/ast.hpp:90:18: warning: ‘virtual bool Sass::AST_Node::operator==(const Sass::AST_Node&) const’ was hidden [-Woverloaded-virtual=] 90 | virtual bool operator== (const AST_Node& rhs) const { | ^~~~~~~~ src/ast.hpp:939:10: note: by ‘bool Sass::CssMediaQuery::operator==(const Sass::CssMediaQuery&) const’ 939 | bool operator== (const CssMediaQuery& rhs) const; | ^~~~~~~~ src/ast.hpp:96:18: warning: ‘virtual bool Sass::AST_Node::operator!=(const Sass::AST_Node&) const’ was hidden [-Woverloaded-virtual=] 96 | virtual bool operator!= (const AST_Node& rhs) const { | ^~~~~~~~ src/ast.hpp:940:10: note: by ‘bool Sass::CssMediaQuery::operator!=(const Sass::CssMediaQuery&) const’ 940 | bool operator!=(const CssMediaQuery& rhs) const { | ^~~~~~~~ src/ast.hpp:165:18: warning: ‘virtual bool Sass::Expression::operator==(const Sass::Expression&) const’ was hidden [-Woverloaded-virtual=] 165 | virtual bool operator== (const Expression& rhs) const { return false; } | ^~~~~~~~ In file included from src/ast.hpp:14: src/ast_def_macros.hpp:105:16: note: by ‘virtual bool Sass::Selector::operator==(const Sass::Selector&) const’ 105 | virtual bool operator==(const klass& rhs) const = 0; \ | ^~~~~~~~ src/ast_selectors.hpp:56:5: note: in expansion of macro ‘ATTACH_VIRTUAL_CMP_OPERATIONS’ 56 | ATTACH_VIRTUAL_CMP_OPERATIONS(Selector) | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~ src/ast.hpp:96:18: warning: ‘virtual bool Sass::AST_Node::operator!=(const Sass::AST_Node&) const’ was hidden [-Woverloaded-virtual=] 96 | virtual bool operator!= (const AST_Node& rhs) const { | ^~~~~~~~ src/ast_def_macros.hpp:106:16: note: by ‘virtual bool Sass::Selector::operator!=(const Sass::Selector&) const’ 106 | virtual bool operator!=(const klass& rhs) const { return !(*this == rhs); }; \ | ^~~~~~~~ src/ast_selectors.hpp:56:5: note: in expansion of macro ‘ATTACH_VIRTUAL_CMP_OPERATIONS’ 56 | ATTACH_VIRTUAL_CMP_OPERATIONS(Selector) | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~ src/ast_def_macros.hpp:106:16: warning: ‘virtual bool Sass::Selector::operator!=(const Sass::Selector&) const’ was hidden [-Woverloaded-virtual=] 106 | virtual bool operator!=(const klass& rhs) const { return !(*this == rhs); }; \ | ^~~~~~~~ src/ast_selectors.hpp:56:5: note: in expansion of macro ‘ATTACH_VIRTUAL_CMP_OPERATIONS’ 56 | ATTACH_VIRTUAL_CMP_OPERATIONS(Selector) | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~ src/ast_def_macros.hpp:106:16: note: by ‘virtual bool Sass::SimpleSelector::operator!=(const Sass::SimpleSelector&) const’ 106 | virtual bool operator!=(const klass& rhs) const { return !(*this == rhs); }; \ | ^~~~~~~~ src/ast_selectors.hpp:139:5: note: in expansion of macro ‘ATTACH_VIRTUAL_CMP_OPERATIONS’ 139 | ATTACH_VIRTUAL_CMP_OPERATIONS(SimpleSelector); | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~ In file included from src/ast.hpp:1055: src/ast_selectors.hpp:137:18: warning: ‘virtual bool Sass::SimpleSelector::operator==(const Sass::CompoundSelector&) const’ was hidden [-Woverloaded-virtual=] 137 | virtual bool operator==(const CompoundSelector& rhs) const; | ^~~~~~~~ src/ast_def_macros.hpp:109:16: note: by ‘Sass::PlaceholderSelector::operator==’ 109 | virtual bool operator==(const klass& rhs) const; \ | ^~~~~~~~ src/ast_selectors.hpp:157:5: note: in expansion of macro ‘ATTACH_CMP_OPERATIONS’ 157 | ATTACH_CMP_OPERATIONS(PlaceholderSelector) | ^~~~~~~~~~~~~~~~~~~~~ src/ast_selectors.hpp:136:18: warning: ‘virtual bool Sass::SimpleSelector::operator==(const Sass::ComplexSelector&) const’ was hidden [-Woverloaded-virtual=] 136 | virtual bool operator==(const ComplexSelector& rhs) const; | ^~~~~~~~ src/ast_def_macros.hpp:109:16: note: by ‘Sass::PlaceholderSelector::operator==’ 109 | virtual bool operator==(const klass& rhs) const; \ | ^~~~~~~~ src/ast_selectors.hpp:157:5: note: in expansion of macro ‘ATTACH_CMP_OPERATIONS’ 157 | ATTACH_CMP_OPERATIONS(PlaceholderSelector) | ^~~~~~~~~~~~~~~~~~~~~ src/ast_selectors.hpp:135:18: warning: ‘virtual bool Sass::SimpleSelector::operator==(const Sass::SelectorList&) const’ was hidden [-Woverloaded-virtual=] 135 | virtual bool operator==(const SelectorList& rhs) const; | ^~~~~~~~ src/ast_def_macros.hpp:109:16: note: by ‘Sass::PlaceholderSelector::operator==’ 109 | virtual bool operator==(const klass& rhs) const; \ | ^~~~~~~~ src/ast_selectors.hpp:157:5: note: in expansion of macro ‘ATTACH_CMP_OPERATIONS’ 157 | ATTACH_CMP_OPERATIONS(PlaceholderSelector) | ^~~~~~~~~~~~~~~~~~~~~ src/ast_selectors.hpp:133:10: warning: ‘virtual bool Sass::SimpleSelector::operator==(const Sass::Selector&) const’ was hidden [-Woverloaded-virtual=] 133 | bool operator==(const Selector& rhs) const final override; | ^~~~~~~~ src/ast_def_macros.hpp:109:16: note: by ‘Sass::PlaceholderSelector::operator==’ 109 | virtual bool operator==(const klass& rhs) const; \ | ^~~~~~~~ src/ast_selectors.hpp:157:5: note: in expansion of macro ‘ATTACH_CMP_OPERATIONS’ 157 | ATTACH_CMP_OPERATIONS(PlaceholderSelector) | ^~~~~~~~~~~~~~~~~~~~~ src/ast_def_macros.hpp:106:16: warning: ‘virtual bool Sass::SimpleSelector::operator!=(const Sass::SimpleSelector&) const’ was hidden [-Woverloaded-virtual=] 106 | virtual bool operator!=(const klass& rhs) const { return !(*this == rhs); }; \ | ^~~~~~~~ src/ast_selectors.hpp:139:5: note: in expansion of macro ‘ATTACH_VIRTUAL_CMP_OPERATIONS’ 139 | ATTACH_VIRTUAL_CMP_OPERATIONS(SimpleSelector); | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~ src/ast_def_macros.hpp:110:16: note: by ‘virtual bool Sass::PlaceholderSelector::operator!=(const Sass::PlaceholderSelector&) const’ 110 | virtual bool operator!=(const klass& rhs) const { return !(*this == rhs); }; \ | ^~~~~~~~ src/ast_selectors.hpp:157:5: note: in expansion of macro ‘ATTACH_CMP_OPERATIONS’ 157 | ATTACH_CMP_OPERATIONS(PlaceholderSelector) | ^~~~~~~~~~~~~~~~~~~~~ src/ast_selectors.hpp:137:18: warning: ‘virtual bool Sass::SimpleSelector::operator==(const Sass::CompoundSelector&) const’ was hidden [-Woverloaded-virtual=] 137 | virtual bool operator==(const CompoundSelector& rhs) const; | ^~~~~~~~ src/ast_def_macros.hpp:109:16: note: by ‘Sass::TypeSelector::operator==’ 109 | virtual bool operator==(const klass& rhs) const; \ | ^~~~~~~~ src/ast_selectors.hpp:174:5: note: in expansion of macro ‘ATTACH_CMP_OPERATIONS’ 174 | ATTACH_CMP_OPERATIONS(TypeSelector) | ^~~~~~~~~~~~~~~~~~~~~ src/ast_selectors.hpp:136:18: warning: ‘virtual bool Sass::SimpleSelector::operator==(const Sass::ComplexSelector&) const’ was hidden [-Woverloaded-virtual=] 136 | virtual bool operator==(const ComplexSelector& rhs) const; | ^~~~~~~~ src/ast_def_macros.hpp:109:16: note: by ‘Sass::TypeSelector::operator==’ 109 | virtual bool operator==(const klass& rhs) const; \ | ^~~~~~~~ src/ast_selectors.hpp:174:5: note: in expansion of macro ‘ATTACH_CMP_OPERATIONS’ 174 | ATTACH_CMP_OPERATIONS(TypeSelector) | ^~~~~~~~~~~~~~~~~~~~~ src/ast_selectors.hpp:135:18: warning: ‘virtual bool Sass::SimpleSelector::operator==(const Sass::SelectorList&) const’ was hidden [-Woverloaded-virtual=] 135 | virtual bool operator==(const SelectorList& rhs) const; | ^~~~~~~~ src/ast_def_macros.hpp:109:16: note: by ‘Sass::TypeSelector::operator==’ 109 | virtual bool operator==(const klass& rhs) const; \ | ^~~~~~~~ src/ast_selectors.hpp:174:5: note: in expansion of macro ‘ATTACH_CMP_OPERATIONS’ 174 | ATTACH_CMP_OPERATIONS(TypeSelector) | ^~~~~~~~~~~~~~~~~~~~~ src/ast_selectors.hpp:133:10: warning: ‘virtual bool Sass::SimpleSelector::operator==(const Sass::Selector&) const’ was hidden [-Woverloaded-virtual=] 133 | bool operator==(const Selector& rhs) const final override; | ^~~~~~~~ src/ast_def_macros.hpp:109:16: note: by ‘Sass::TypeSelector::operator==’ 109 | virtual bool operator==(const klass& rhs) const; \ | ^~~~~~~~ src/ast_selectors.hpp:174:5: note: in expansion of macro ‘ATTACH_CMP_OPERATIONS’ 174 | ATTACH_CMP_OPERATIONS(TypeSelector) | ^~~~~~~~~~~~~~~~~~~~~ src/ast_def_macros.hpp:106:16: warning: ‘virtual bool Sass::SimpleSelector::operator!=(const Sass::SimpleSelector&) const’ was hidden [-Woverloaded-virtual=] 106 | virtual bool operator!=(const klass& rhs) const { return !(*this == rhs); }; \ | ^~~~~~~~ src/ast_selectors.hpp:139:5: note: in expansion of macro ‘ATTACH_VIRTUAL_CMP_OPERATIONS’ 139 | ATTACH_VIRTUAL_CMP_OPERATIONS(SimpleSelector); | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~ src/ast_def_macros.hpp:110:16: note: by ‘virtual bool Sass::TypeSelector::operator!=(const Sass::TypeSelector&) const’ 110 | virtual bool operator!=(const klass& rhs) const { return !(*this == rhs); }; \ | ^~~~~~~~ src/ast_selectors.hpp:174:5: note: in expansion of macro ‘ATTACH_CMP_OPERATIONS’ 174 | ATTACH_CMP_OPERATIONS(TypeSelector) | ^~~~~~~~~~~~~~~~~~~~~ src/ast_selectors.hpp:137:18: warning: ‘virtual bool Sass::SimpleSelector::operator==(const Sass::CompoundSelector&) const’ was hidden [-Woverloaded-virtual=] 137 | virtual bool operator==(const CompoundSelector& rhs) const; | ^~~~~~~~ src/ast_def_macros.hpp:109:16: note: by ‘Sass::ClassSelector::operator==’ 109 | virtual bool operator==(const klass& rhs) const; \ | ^~~~~~~~ src/ast_selectors.hpp:188:5: note: in expansion of macro ‘ATTACH_CMP_OPERATIONS’ 188 | ATTACH_CMP_OPERATIONS(ClassSelector) | ^~~~~~~~~~~~~~~~~~~~~ src/ast_selectors.hpp:136:18: warning: ‘virtual bool Sass::SimpleSelector::operator==(const Sass::ComplexSelector&) const’ was hidden [-Woverloaded-virtual=] 136 | virtual bool operator==(const ComplexSelector& rhs) const; | ^~~~~~~~ src/ast_def_macros.hpp:109:16: note: by ‘Sass::ClassSelector::operator==’ 109 | virtual bool operator==(const klass& rhs) const; \ | ^~~~~~~~ src/ast_selectors.hpp:188:5: note: in expansion of macro ‘ATTACH_CMP_OPERATIONS’ 188 | ATTACH_CMP_OPERATIONS(ClassSelector) | ^~~~~~~~~~~~~~~~~~~~~ src/ast_selectors.hpp:135:18: warning: ‘virtual bool Sass::SimpleSelector::operator==(const Sass::SelectorList&) const’ was hidden [-Woverloaded-virtual=] 135 | virtual bool operator==(const SelectorList& rhs) const; | ^~~~~~~~ src/ast_def_macros.hpp:109:16: note: by ‘Sass::ClassSelector::operator==’ 109 | virtual bool operator==(const klass& rhs) const; \ | ^~~~~~~~ src/ast_selectors.hpp:188:5: note: in expansion of macro ‘ATTACH_CMP_OPERATIONS’ 188 | ATTACH_CMP_OPERATIONS(ClassSelector) | ^~~~~~~~~~~~~~~~~~~~~ src/ast_selectors.hpp:133:10: warning: ‘virtual bool Sass::SimpleSelector::operator==(const Sass::Selector&) const’ was hidden [-Woverloaded-virtual=] 133 | bool operator==(const Selector& rhs) const final override; | ^~~~~~~~ src/ast_def_macros.hpp:109:16: note: by ‘Sass::ClassSelector::operator==’ 109 | virtual bool operator==(const klass& rhs) const; \ | ^~~~~~~~ src/ast_selectors.hpp:188:5: note: in expansion of macro ‘ATTACH_CMP_OPERATIONS’ 188 | ATTACH_CMP_OPERATIONS(ClassSelector) | ^~~~~~~~~~~~~~~~~~~~~ src/ast_def_macros.hpp:106:16: warning: ‘virtual bool Sass::SimpleSelector::operator!=(const Sass::SimpleSelector&) const’ was hidden [-Woverloaded-virtual=] 106 | virtual bool operator!=(const klass& rhs) const { return !(*this == rhs); }; \ | ^~~~~~~~ src/ast_selectors.hpp:139:5: note: in expansion of macro ‘ATTACH_VIRTUAL_CMP_OPERATIONS’ 139 | ATTACH_VIRTUAL_CMP_OPERATIONS(SimpleSelector); | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~ src/ast_def_macros.hpp:110:16: note: by ‘virtual bool Sass::ClassSelector::operator!=(const Sass::ClassSelector&) const’ 110 | virtual bool operator!=(const klass& rhs) const { return !(*this == rhs); }; \ | ^~~~~~~~ src/ast_selectors.hpp:188:5: note: in expansion of macro ‘ATTACH_CMP_OPERATIONS’ 188 | ATTACH_CMP_OPERATIONS(ClassSelector) | ^~~~~~~~~~~~~~~~~~~~~ src/ast_selectors.hpp:137:18: warning: ‘virtual bool Sass::SimpleSelector::operator==(const Sass::CompoundSelector&) const’ was hidden [-Woverloaded-virtual=] 137 | virtual bool operator==(const CompoundSelector& rhs) const; | ^~~~~~~~ src/ast_def_macros.hpp:109:16: note: by ‘Sass::IDSelector::operator==’ 109 | virtual bool operator==(const klass& rhs) const; \ | ^~~~~~~~ src/ast_selectors.hpp:204:5: note: in expansion of macro ‘ATTACH_CMP_OPERATIONS’ 204 | ATTACH_CMP_OPERATIONS(IDSelector) | ^~~~~~~~~~~~~~~~~~~~~ src/ast_selectors.hpp:136:18: warning: ‘virtual bool Sass::SimpleSelector::operator==(const Sass::ComplexSelector&) const’ was hidden [-Woverloaded-virtual=] 136 | virtual bool operator==(const ComplexSelector& rhs) const; | ^~~~~~~~ src/ast_def_macros.hpp:109:16: note: by ‘Sass::IDSelector::operator==’ 109 | virtual bool operator==(const klass& rhs) const; \ | ^~~~~~~~ src/ast_selectors.hpp:204:5: note: in expansion of macro ‘ATTACH_CMP_OPERATIONS’ 204 | ATTACH_CMP_OPERATIONS(IDSelector) | ^~~~~~~~~~~~~~~~~~~~~ src/ast_selectors.hpp:135:18: warning: ‘virtual bool Sass::SimpleSelector::operator==(const Sass::SelectorList&) const’ was hidden [-Woverloaded-virtual=] 135 | virtual bool operator==(const SelectorList& rhs) const; | ^~~~~~~~ src/ast_def_macros.hpp:109:16: note: by ‘Sass::IDSelector::operator==’ 109 | virtual bool operator==(const klass& rhs) const; \ | ^~~~~~~~ src/ast_selectors.hpp:204:5: note: in expansion of macro ‘ATTACH_CMP_OPERATIONS’ 204 | ATTACH_CMP_OPERATIONS(IDSelector) | ^~~~~~~~~~~~~~~~~~~~~ src/ast_selectors.hpp:133:10: warning: ‘virtual bool Sass::SimpleSelector::operator==(const Sass::Selector&) const’ was hidden [-Woverloaded-virtual=] 133 | bool operator==(const Selector& rhs) const final override; | ^~~~~~~~ src/ast_def_macros.hpp:109:16: note: by ‘Sass::IDSelector::operator==’ 109 | virtual bool operator==(const klass& rhs) const; \ | ^~~~~~~~ src/ast_selectors.hpp:204:5: note: in expansion of macro ‘ATTACH_CMP_OPERATIONS’ 204 | ATTACH_CMP_OPERATIONS(IDSelector) | ^~~~~~~~~~~~~~~~~~~~~ src/ast_def_macros.hpp:106:16: warning: ‘virtual bool Sass::SimpleSelector::operator!=(const Sass::SimpleSelector&) const’ was hidden [-Woverloaded-virtual=] 106 | virtual bool operator!=(const klass& rhs) const { return !(*this == rhs); }; \ | ^~~~~~~~ src/ast_selectors.hpp:139:5: note: in expansion of macro ‘ATTACH_VIRTUAL_CMP_OPERATIONS’ 139 | ATTACH_VIRTUAL_CMP_OPERATIONS(SimpleSelector); | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~ src/ast_def_macros.hpp:110:16: note: by ‘virtual bool Sass::IDSelector::operator!=(const Sass::IDSelector&) const’ 110 | virtual bool operator!=(const klass& rhs) const { return !(*this == rhs); }; \ | ^~~~~~~~ src/ast_selectors.hpp:204:5: note: in expansion of macro ‘ATTACH_CMP_OPERATIONS’ 204 | ATTACH_CMP_OPERATIONS(IDSelector) | ^~~~~~~~~~~~~~~~~~~~~ src/ast_selectors.hpp:137:18: warning: ‘virtual bool Sass::SimpleSelector::operator==(const Sass::CompoundSelector&) const’ was hidden [-Woverloaded-virtual=] 137 | virtual bool operator==(const CompoundSelector& rhs) const; | ^~~~~~~~ src/ast_def_macros.hpp:109:16: note: by ‘Sass::AttributeSelector::operator==’ 109 | virtual bool operator==(const klass& rhs) const; \ | ^~~~~~~~ src/ast_selectors.hpp:223:5: note: in expansion of macro ‘ATTACH_CMP_OPERATIONS’ 223 | ATTACH_CMP_OPERATIONS(AttributeSelector) | ^~~~~~~~~~~~~~~~~~~~~ src/ast_selectors.hpp:136:18: warning: ‘virtual bool Sass::SimpleSelector::operator==(const Sass::ComplexSelector&) const’ was hidden [-Woverloaded-virtual=] 136 | virtual bool operator==(const ComplexSelector& rhs) const; | ^~~~~~~~ src/ast_def_macros.hpp:109:16: note: by ‘Sass::AttributeSelector::operator==’ 109 | virtual bool operator==(const klass& rhs) const; \ | ^~~~~~~~ src/ast_selectors.hpp:223:5: note: in expansion of macro ‘ATTACH_CMP_OPERATIONS’ 223 | ATTACH_CMP_OPERATIONS(AttributeSelector) | ^~~~~~~~~~~~~~~~~~~~~ src/ast_selectors.hpp:135:18: warning: ‘virtual bool Sass::SimpleSelector::operator==(const Sass::SelectorList&) const’ was hidden [-Woverloaded-virtual=] 135 | virtual bool operator==(const SelectorList& rhs) const; | ^~~~~~~~ src/ast_def_macros.hpp:109:16: note: by ‘Sass::AttributeSelector::operator==’ 109 | virtual bool operator==(const klass& rhs) const; \ | ^~~~~~~~ src/ast_selectors.hpp:223:5: note: in expansion of macro ‘ATTACH_CMP_OPERATIONS’ 223 | ATTACH_CMP_OPERATIONS(AttributeSelector) | ^~~~~~~~~~~~~~~~~~~~~ src/ast_selectors.hpp:133:10: warning: ‘virtual bool Sass::SimpleSelector::operator==(const Sass::Selector&) const’ was hidden [-Woverloaded-virtual=] 133 | bool operator==(const Selector& rhs) const final override; | ^~~~~~~~ src/ast_def_macros.hpp:109:16: note: by ‘Sass::AttributeSelector::operator==’ 109 | virtual bool operator==(const klass& rhs) const; \ | ^~~~~~~~ src/ast_selectors.hpp:223:5: note: in expansion of macro ‘ATTACH_CMP_OPERATIONS’ 223 | ATTACH_CMP_OPERATIONS(AttributeSelector) | ^~~~~~~~~~~~~~~~~~~~~ src/ast_def_macros.hpp:106:16: warning: ‘virtual bool Sass::SimpleSelector::operator!=(const Sass::SimpleSelector&) const’ was hidden [-Woverloaded-virtual=] 106 | virtual bool operator!=(const klass& rhs) const { return !(*this == rhs); }; \ | ^~~~~~~~ src/ast_selectors.hpp:139:5: note: in expansion of macro ‘ATTACH_VIRTUAL_CMP_OPERATIONS’ 139 | ATTACH_VIRTUAL_CMP_OPERATIONS(SimpleSelector); | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~ src/ast_def_macros.hpp:110:16: note: by ‘virtual bool Sass::AttributeSelector::operator!=(const Sass::AttributeSelector&) const’ 110 | virtual bool operator!=(const klass& rhs) const { return !(*this == rhs); }; \ | ^~~~~~~~ src/ast_selectors.hpp:223:5: note: in expansion of macro ‘ATTACH_CMP_OPERATIONS’ 223 | ATTACH_CMP_OPERATIONS(AttributeSelector) | ^~~~~~~~~~~~~~~~~~~~~ src/ast_def_macros.hpp:106:16: warning: ‘virtual bool Sass::Selector::operator!=(const Sass::Selector&) const’ was hidden [-Woverloaded-virtual=] 106 | virtual bool operator!=(const klass& rhs) const { return !(*this == rhs); }; \ | ^~~~~~~~ src/ast_selectors.hpp:56:5: note: in expansion of macro ‘ATTACH_VIRTUAL_CMP_OPERATIONS’ 56 | ATTACH_VIRTUAL_CMP_OPERATIONS(Selector) | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~ src/ast_def_macros.hpp:110:16: note: by ‘virtual bool Sass::ComplexSelector::operator!=(const Sass::ComplexSelector&) const’ 110 | virtual bool operator!=(const klass& rhs) const { return !(*this == rhs); }; \ | ^~~~~~~~ src/ast_selectors.hpp:310:5: note: in expansion of macro ‘ATTACH_CMP_OPERATIONS’ 310 | ATTACH_CMP_OPERATIONS(ComplexSelector) | ^~~~~~~~~~~~~~~~~~~~~ src/ast_def_macros.hpp:106:16: warning: ‘virtual bool Sass::Selector::operator!=(const Sass::Selector&) const’ was hidden [-Woverloaded-virtual=] 106 | virtual bool operator!=(const klass& rhs) const { return !(*this == rhs); }; \ | ^~~~~~~~ src/ast_selectors.hpp:56:5: note: in expansion of macro ‘ATTACH_VIRTUAL_CMP_OPERATIONS’ 56 | ATTACH_VIRTUAL_CMP_OPERATIONS(Selector) | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~ src/ast_def_macros.hpp:106:16: note: by ‘virtual bool Sass::SelectorComponent::operator!=(const Sass::SelectorComponent&) const’ 106 | virtual bool operator!=(const klass& rhs) const { return !(*this == rhs); }; \ | ^~~~~~~~ src/ast_selectors.hpp:349:5: note: in expansion of macro ‘ATTACH_VIRTUAL_CMP_OPERATIONS’ 349 | ATTACH_VIRTUAL_CMP_OPERATIONS(SelectorComponent); | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~ src/ast_def_macros.hpp:106:16: warning: ‘virtual bool Sass::SelectorComponent::operator!=(const Sass::SelectorComponent&) const’ was hidden [-Woverloaded-virtual=] 106 | virtual bool operator!=(const klass& rhs) const { return !(*this == rhs); }; \ | ^~~~~~~~ src/ast_selectors.hpp:349:5: note: in expansion of macro ‘ATTACH_VIRTUAL_CMP_OPERATIONS’ 349 | ATTACH_VIRTUAL_CMP_OPERATIONS(SelectorComponent); | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~ src/ast_def_macros.hpp:110:16: note: by ‘virtual bool Sass::SelectorCombinator::operator!=(const Sass::SelectorCombinator&) const’ 110 | virtual bool operator!=(const klass& rhs) const { return !(*this == rhs); }; \ | ^~~~~~~~ src/ast_selectors.hpp:407:5: note: in expansion of macro ‘ATTACH_CMP_OPERATIONS’ 407 | ATTACH_CMP_OPERATIONS(SelectorCombinator) | ^~~~~~~~~~~~~~~~~~~~~ g++ -std=gnu++17 -Wall -O2 -std=c++11 -I ./include -fPIC -c -o src/ast_sel_super.o src/ast_sel_super.cpp In file included from src/ast_sel_super.cpp:4: src/ast.hpp:90:18: warning: ‘virtual bool Sass::AST_Node::operator==(const Sass::AST_Node&) const’ was hidden [-Woverloaded-virtual=] 90 | virtual bool operator== (const AST_Node& rhs) const { | ^~~~~~~~ src/ast.hpp:165:18: note: by ‘virtual bool Sass::Expression::operator==(const Sass::Expression&) const’ 165 | virtual bool operator== (const Expression& rhs) const { return false; } | ^~~~~~~~ src/ast.hpp:96:18: warning: ‘virtual bool Sass::AST_Node::operator!=(const Sass::AST_Node&) const’ was hidden [-Woverloaded-virtual=] 96 | virtual bool operator!= (const AST_Node& rhs) const { | ^~~~~~~~ src/ast.hpp:167:17: note: by ‘bool Sass::Expression::operator!=(const Sass::Expression&) const’ 167 | inline bool operator!=(const Expression& rhs) const { return !(rhs == *this); } | ^~~~~~~~ src/ast.hpp:90:18: warning: ‘virtual bool Sass::AST_Node::operator==(const Sass::AST_Node&) const’ was hidden [-Woverloaded-virtual=] 90 | virtual bool operator== (const AST_Node& rhs) const { | ^~~~~~~~ src/ast.hpp:908:10: note: by ‘bool Sass::CssMediaRule::operator==(const Sass::CssMediaRule&) const’ 908 | bool operator== (const CssMediaRule& rhs) const { | ^~~~~~~~ src/ast.hpp:96:18: warning: ‘virtual bool Sass::AST_Node::operator!=(const Sass::AST_Node&) const’ was hidden [-Woverloaded-virtual=] 96 | virtual bool operator!= (const AST_Node& rhs) const { | ^~~~~~~~ src/ast.hpp:911:10: note: by ‘bool Sass::CssMediaRule::operator!=(const Sass::CssMediaRule&) const’ 911 | bool operator!=(const CssMediaRule& rhs) const { | ^~~~~~~~ src/ast.hpp:90:18: warning: ‘virtual bool Sass::AST_Node::operator==(const Sass::AST_Node&) const’ was hidden [-Woverloaded-virtual=] 90 | virtual bool operator== (const AST_Node& rhs) const { | ^~~~~~~~ src/ast.hpp:939:10: note: by ‘bool Sass::CssMediaQuery::operator==(const Sass::CssMediaQuery&) const’ 939 | bool operator== (const CssMediaQuery& rhs) const; | ^~~~~~~~ src/ast.hpp:96:18: warning: ‘virtual bool Sass::AST_Node::operator!=(const Sass::AST_Node&) const’ was hidden [-Woverloaded-virtual=] 96 | virtual bool operator!= (const AST_Node& rhs) const { | ^~~~~~~~ src/ast.hpp:940:10: note: by ‘bool Sass::CssMediaQuery::operator!=(const Sass::CssMediaQuery&) const’ 940 | bool operator!=(const CssMediaQuery& rhs) const { | ^~~~~~~~ src/ast.hpp:165:18: warning: ‘virtual bool Sass::Expression::operator==(const Sass::Expression&) const’ was hidden [-Woverloaded-virtual=] 165 | virtual bool operator== (const Expression& rhs) const { return false; } | ^~~~~~~~ In file included from src/ast.hpp:14: src/ast_def_macros.hpp:105:16: note: by ‘virtual bool Sass::Selector::operator==(const Sass::Selector&) const’ 105 | virtual bool operator==(const klass& rhs) const = 0; \ | ^~~~~~~~ src/ast_selectors.hpp:56:5: note: in expansion of macro ‘ATTACH_VIRTUAL_CMP_OPERATIONS’ 56 | ATTACH_VIRTUAL_CMP_OPERATIONS(Selector) | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~ src/ast.hpp:96:18: warning: ‘virtual bool Sass::AST_Node::operator!=(const Sass::AST_Node&) const’ was hidden [-Woverloaded-virtual=] 96 | virtual bool operator!= (const AST_Node& rhs) const { | ^~~~~~~~ src/ast_def_macros.hpp:106:16: note: by ‘virtual bool Sass::Selector::operator!=(const Sass::Selector&) const’ 106 | virtual bool operator!=(const klass& rhs) const { return !(*this == rhs); }; \ | ^~~~~~~~ src/ast_selectors.hpp:56:5: note: in expansion of macro ‘ATTACH_VIRTUAL_CMP_OPERATIONS’ 56 | ATTACH_VIRTUAL_CMP_OPERATIONS(Selector) | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~ src/ast_def_macros.hpp:106:16: warning: ‘virtual bool Sass::Selector::operator!=(const Sass::Selector&) const’ was hidden [-Woverloaded-virtual=] 106 | virtual bool operator!=(const klass& rhs) const { return !(*this == rhs); }; \ | ^~~~~~~~ src/ast_selectors.hpp:56:5: note: in expansion of macro ‘ATTACH_VIRTUAL_CMP_OPERATIONS’ 56 | ATTACH_VIRTUAL_CMP_OPERATIONS(Selector) | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~ src/ast_def_macros.hpp:106:16: note: by ‘virtual bool Sass::SimpleSelector::operator!=(const Sass::SimpleSelector&) const’ 106 | virtual bool operator!=(const klass& rhs) const { return !(*this == rhs); }; \ | ^~~~~~~~ src/ast_selectors.hpp:139:5: note: in expansion of macro ‘ATTACH_VIRTUAL_CMP_OPERATIONS’ 139 | ATTACH_VIRTUAL_CMP_OPERATIONS(SimpleSelector); | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~ In file included from src/ast.hpp:1055: src/ast_selectors.hpp:137:18: warning: ‘virtual bool Sass::SimpleSelector::operator==(const Sass::CompoundSelector&) const’ was hidden [-Woverloaded-virtual=] 137 | virtual bool operator==(const CompoundSelector& rhs) const; | ^~~~~~~~ src/ast_def_macros.hpp:109:16: note: by ‘Sass::PlaceholderSelector::operator==’ 109 | virtual bool operator==(const klass& rhs) const; \ | ^~~~~~~~ src/ast_selectors.hpp:157:5: note: in expansion of macro ‘ATTACH_CMP_OPERATIONS’ 157 | ATTACH_CMP_OPERATIONS(PlaceholderSelector) | ^~~~~~~~~~~~~~~~~~~~~ src/ast_selectors.hpp:136:18: warning: ‘virtual bool Sass::SimpleSelector::operator==(const Sass::ComplexSelector&) const’ was hidden [-Woverloaded-virtual=] 136 | virtual bool operator==(const ComplexSelector& rhs) const; | ^~~~~~~~ src/ast_def_macros.hpp:109:16: note: by ‘Sass::PlaceholderSelector::operator==’ 109 | virtual bool operator==(const klass& rhs) const; \ | ^~~~~~~~ src/ast_selectors.hpp:157:5: note: in expansion of macro ‘ATTACH_CMP_OPERATIONS’ 157 | ATTACH_CMP_OPERATIONS(PlaceholderSelector) | ^~~~~~~~~~~~~~~~~~~~~ src/ast_selectors.hpp:135:18: warning: ‘virtual bool Sass::SimpleSelector::operator==(const Sass::SelectorList&) const’ was hidden [-Woverloaded-virtual=] 135 | virtual bool operator==(const SelectorList& rhs) const; | ^~~~~~~~ src/ast_def_macros.hpp:109:16: note: by ‘Sass::PlaceholderSelector::operator==’ 109 | virtual bool operator==(const klass& rhs) const; \ | ^~~~~~~~ src/ast_selectors.hpp:157:5: note: in expansion of macro ‘ATTACH_CMP_OPERATIONS’ 157 | ATTACH_CMP_OPERATIONS(PlaceholderSelector) | ^~~~~~~~~~~~~~~~~~~~~ src/ast_selectors.hpp:133:10: warning: ‘virtual bool Sass::SimpleSelector::operator==(const Sass::Selector&) const’ was hidden [-Woverloaded-virtual=] 133 | bool operator==(const Selector& rhs) const final override; | ^~~~~~~~ src/ast_def_macros.hpp:109:16: note: by ‘Sass::PlaceholderSelector::operator==’ 109 | virtual bool operator==(const klass& rhs) const; \ | ^~~~~~~~ src/ast_selectors.hpp:157:5: note: in expansion of macro ‘ATTACH_CMP_OPERATIONS’ 157 | ATTACH_CMP_OPERATIONS(PlaceholderSelector) | ^~~~~~~~~~~~~~~~~~~~~ src/ast_def_macros.hpp:106:16: warning: ‘virtual bool Sass::SimpleSelector::operator!=(const Sass::SimpleSelector&) const’ was hidden [-Woverloaded-virtual=] 106 | virtual bool operator!=(const klass& rhs) const { return !(*this == rhs); }; \ | ^~~~~~~~ src/ast_selectors.hpp:139:5: note: in expansion of macro ‘ATTACH_VIRTUAL_CMP_OPERATIONS’ 139 | ATTACH_VIRTUAL_CMP_OPERATIONS(SimpleSelector); | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~ src/ast_def_macros.hpp:110:16: note: by ‘virtual bool Sass::PlaceholderSelector::operator!=(const Sass::PlaceholderSelector&) const’ 110 | virtual bool operator!=(const klass& rhs) const { return !(*this == rhs); }; \ | ^~~~~~~~ src/ast_selectors.hpp:157:5: note: in expansion of macro ‘ATTACH_CMP_OPERATIONS’ 157 | ATTACH_CMP_OPERATIONS(PlaceholderSelector) | ^~~~~~~~~~~~~~~~~~~~~ src/ast_selectors.hpp:137:18: warning: ‘virtual bool Sass::SimpleSelector::operator==(const Sass::CompoundSelector&) const’ was hidden [-Woverloaded-virtual=] 137 | virtual bool operator==(const CompoundSelector& rhs) const; | ^~~~~~~~ src/ast_def_macros.hpp:109:16: note: by ‘Sass::TypeSelector::operator==’ 109 | virtual bool operator==(const klass& rhs) const; \ | ^~~~~~~~ src/ast_selectors.hpp:174:5: note: in expansion of macro ‘ATTACH_CMP_OPERATIONS’ 174 | ATTACH_CMP_OPERATIONS(TypeSelector) | ^~~~~~~~~~~~~~~~~~~~~ src/ast_selectors.hpp:136:18: warning: ‘virtual bool Sass::SimpleSelector::operator==(const Sass::ComplexSelector&) const’ was hidden [-Woverloaded-virtual=] 136 | virtual bool operator==(const ComplexSelector& rhs) const; | ^~~~~~~~ src/ast_def_macros.hpp:109:16: note: by ‘Sass::TypeSelector::operator==’ 109 | virtual bool operator==(const klass& rhs) const; \ | ^~~~~~~~ src/ast_selectors.hpp:174:5: note: in expansion of macro ‘ATTACH_CMP_OPERATIONS’ 174 | ATTACH_CMP_OPERATIONS(TypeSelector) | ^~~~~~~~~~~~~~~~~~~~~ src/ast_selectors.hpp:135:18: warning: ‘virtual bool Sass::SimpleSelector::operator==(const Sass::SelectorList&) const’ was hidden [-Woverloaded-virtual=] 135 | virtual bool operator==(const SelectorList& rhs) const; | ^~~~~~~~ src/ast_def_macros.hpp:109:16: note: by ‘Sass::TypeSelector::operator==’ 109 | virtual bool operator==(const klass& rhs) const; \ | ^~~~~~~~ src/ast_selectors.hpp:174:5: note: in expansion of macro ‘ATTACH_CMP_OPERATIONS’ 174 | ATTACH_CMP_OPERATIONS(TypeSelector) | ^~~~~~~~~~~~~~~~~~~~~ src/ast_selectors.hpp:133:10: warning: ‘virtual bool Sass::SimpleSelector::operator==(const Sass::Selector&) const’ was hidden [-Woverloaded-virtual=] 133 | bool operator==(const Selector& rhs) const final override; | ^~~~~~~~ src/ast_def_macros.hpp:109:16: note: by ‘Sass::TypeSelector::operator==’ 109 | virtual bool operator==(const klass& rhs) const; \ | ^~~~~~~~ src/ast_selectors.hpp:174:5: note: in expansion of macro ‘ATTACH_CMP_OPERATIONS’ 174 | ATTACH_CMP_OPERATIONS(TypeSelector) | ^~~~~~~~~~~~~~~~~~~~~ src/ast_def_macros.hpp:106:16: warning: ‘virtual bool Sass::SimpleSelector::operator!=(const Sass::SimpleSelector&) const’ was hidden [-Woverloaded-virtual=] 106 | virtual bool operator!=(const klass& rhs) const { return !(*this == rhs); }; \ | ^~~~~~~~ src/ast_selectors.hpp:139:5: note: in expansion of macro ‘ATTACH_VIRTUAL_CMP_OPERATIONS’ 139 | ATTACH_VIRTUAL_CMP_OPERATIONS(SimpleSelector); | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~ src/ast_def_macros.hpp:110:16: note: by ‘virtual bool Sass::TypeSelector::operator!=(const Sass::TypeSelector&) const’ 110 | virtual bool operator!=(const klass& rhs) const { return !(*this == rhs); }; \ | ^~~~~~~~ src/ast_selectors.hpp:174:5: note: in expansion of macro ‘ATTACH_CMP_OPERATIONS’ 174 | ATTACH_CMP_OPERATIONS(TypeSelector) | ^~~~~~~~~~~~~~~~~~~~~ src/ast_selectors.hpp:137:18: warning: ‘virtual bool Sass::SimpleSelector::operator==(const Sass::CompoundSelector&) const’ was hidden [-Woverloaded-virtual=] 137 | virtual bool operator==(const CompoundSelector& rhs) const; | ^~~~~~~~ src/ast_def_macros.hpp:109:16: note: by ‘Sass::ClassSelector::operator==’ 109 | virtual bool operator==(const klass& rhs) const; \ | ^~~~~~~~ src/ast_selectors.hpp:188:5: note: in expansion of macro ‘ATTACH_CMP_OPERATIONS’ 188 | ATTACH_CMP_OPERATIONS(ClassSelector) | ^~~~~~~~~~~~~~~~~~~~~ src/ast_selectors.hpp:136:18: warning: ‘virtual bool Sass::SimpleSelector::operator==(const Sass::ComplexSelector&) const’ was hidden [-Woverloaded-virtual=] 136 | virtual bool operator==(const ComplexSelector& rhs) const; | ^~~~~~~~ src/ast_def_macros.hpp:109:16: note: by ‘Sass::ClassSelector::operator==’ 109 | virtual bool operator==(const klass& rhs) const; \ | ^~~~~~~~ src/ast_selectors.hpp:188:5: note: in expansion of macro ‘ATTACH_CMP_OPERATIONS’ 188 | ATTACH_CMP_OPERATIONS(ClassSelector) | ^~~~~~~~~~~~~~~~~~~~~ src/ast_selectors.hpp:135:18: warning: ‘virtual bool Sass::SimpleSelector::operator==(const Sass::SelectorList&) const’ was hidden [-Woverloaded-virtual=] 135 | virtual bool operator==(const SelectorList& rhs) const; | ^~~~~~~~ src/ast_def_macros.hpp:109:16: note: by ‘Sass::ClassSelector::operator==’ 109 | virtual bool operator==(const klass& rhs) const; \ | ^~~~~~~~ src/ast_selectors.hpp:188:5: note: in expansion of macro ‘ATTACH_CMP_OPERATIONS’ 188 | ATTACH_CMP_OPERATIONS(ClassSelector) | ^~~~~~~~~~~~~~~~~~~~~ src/ast_selectors.hpp:133:10: warning: ‘virtual bool Sass::SimpleSelector::operator==(const Sass::Selector&) const’ was hidden [-Woverloaded-virtual=] 133 | bool operator==(const Selector& rhs) const final override; | ^~~~~~~~ src/ast_def_macros.hpp:109:16: note: by ‘Sass::ClassSelector::operator==’ 109 | virtual bool operator==(const klass& rhs) const; \ | ^~~~~~~~ src/ast_selectors.hpp:188:5: note: in expansion of macro ‘ATTACH_CMP_OPERATIONS’ 188 | ATTACH_CMP_OPERATIONS(ClassSelector) | ^~~~~~~~~~~~~~~~~~~~~ src/ast_def_macros.hpp:106:16: warning: ‘virtual bool Sass::SimpleSelector::operator!=(const Sass::SimpleSelector&) const’ was hidden [-Woverloaded-virtual=] 106 | virtual bool operator!=(const klass& rhs) const { return !(*this == rhs); }; \ | ^~~~~~~~ src/ast_selectors.hpp:139:5: note: in expansion of macro ‘ATTACH_VIRTUAL_CMP_OPERATIONS’ 139 | ATTACH_VIRTUAL_CMP_OPERATIONS(SimpleSelector); | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~ src/ast_def_macros.hpp:110:16: note: by ‘virtual bool Sass::ClassSelector::operator!=(const Sass::ClassSelector&) const’ 110 | virtual bool operator!=(const klass& rhs) const { return !(*this == rhs); }; \ | ^~~~~~~~ src/ast_selectors.hpp:188:5: note: in expansion of macro ‘ATTACH_CMP_OPERATIONS’ 188 | ATTACH_CMP_OPERATIONS(ClassSelector) | ^~~~~~~~~~~~~~~~~~~~~ src/ast_selectors.hpp:137:18: warning: ‘virtual bool Sass::SimpleSelector::operator==(const Sass::CompoundSelector&) const’ was hidden [-Woverloaded-virtual=] 137 | virtual bool operator==(const CompoundSelector& rhs) const; | ^~~~~~~~ src/ast_def_macros.hpp:109:16: note: by ‘Sass::IDSelector::operator==’ 109 | virtual bool operator==(const klass& rhs) const; \ | ^~~~~~~~ src/ast_selectors.hpp:204:5: note: in expansion of macro ‘ATTACH_CMP_OPERATIONS’ 204 | ATTACH_CMP_OPERATIONS(IDSelector) | ^~~~~~~~~~~~~~~~~~~~~ src/ast_selectors.hpp:136:18: warning: ‘virtual bool Sass::SimpleSelector::operator==(const Sass::ComplexSelector&) const’ was hidden [-Woverloaded-virtual=] 136 | virtual bool operator==(const ComplexSelector& rhs) const; | ^~~~~~~~ src/ast_def_macros.hpp:109:16: note: by ‘Sass::IDSelector::operator==’ 109 | virtual bool operator==(const klass& rhs) const; \ | ^~~~~~~~ src/ast_selectors.hpp:204:5: note: in expansion of macro ‘ATTACH_CMP_OPERATIONS’ 204 | ATTACH_CMP_OPERATIONS(IDSelector) | ^~~~~~~~~~~~~~~~~~~~~ src/ast_selectors.hpp:135:18: warning: ‘virtual bool Sass::SimpleSelector::operator==(const Sass::SelectorList&) const’ was hidden [-Woverloaded-virtual=] 135 | virtual bool operator==(const SelectorList& rhs) const; | ^~~~~~~~ src/ast_def_macros.hpp:109:16: note: by ‘Sass::IDSelector::operator==’ 109 | virtual bool operator==(const klass& rhs) const; \ | ^~~~~~~~ src/ast_selectors.hpp:204:5: note: in expansion of macro ‘ATTACH_CMP_OPERATIONS’ 204 | ATTACH_CMP_OPERATIONS(IDSelector) | ^~~~~~~~~~~~~~~~~~~~~ src/ast_selectors.hpp:133:10: warning: ‘virtual bool Sass::SimpleSelector::operator==(const Sass::Selector&) const’ was hidden [-Woverloaded-virtual=] 133 | bool operator==(const Selector& rhs) const final override; | ^~~~~~~~ src/ast_def_macros.hpp:109:16: note: by ‘Sass::IDSelector::operator==’ 109 | virtual bool operator==(const klass& rhs) const; \ | ^~~~~~~~ src/ast_selectors.hpp:204:5: note: in expansion of macro ‘ATTACH_CMP_OPERATIONS’ 204 | ATTACH_CMP_OPERATIONS(IDSelector) | ^~~~~~~~~~~~~~~~~~~~~ src/ast_def_macros.hpp:106:16: warning: ‘virtual bool Sass::SimpleSelector::operator!=(const Sass::SimpleSelector&) const’ was hidden [-Woverloaded-virtual=] 106 | virtual bool operator!=(const klass& rhs) const { return !(*this == rhs); }; \ | ^~~~~~~~ src/ast_selectors.hpp:139:5: note: in expansion of macro ‘ATTACH_VIRTUAL_CMP_OPERATIONS’ 139 | ATTACH_VIRTUAL_CMP_OPERATIONS(SimpleSelector); | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~ src/ast_def_macros.hpp:110:16: note: by ‘virtual bool Sass::IDSelector::operator!=(const Sass::IDSelector&) const’ 110 | virtual bool operator!=(const klass& rhs) const { return !(*this == rhs); }; \ | ^~~~~~~~ src/ast_selectors.hpp:204:5: note: in expansion of macro ‘ATTACH_CMP_OPERATIONS’ 204 | ATTACH_CMP_OPERATIONS(IDSelector) | ^~~~~~~~~~~~~~~~~~~~~ src/ast_selectors.hpp:137:18: warning: ‘virtual bool Sass::SimpleSelector::operator==(const Sass::CompoundSelector&) const’ was hidden [-Woverloaded-virtual=] 137 | virtual bool operator==(const CompoundSelector& rhs) const; | ^~~~~~~~ src/ast_def_macros.hpp:109:16: note: by ‘Sass::AttributeSelector::operator==’ 109 | virtual bool operator==(const klass& rhs) const; \ | ^~~~~~~~ src/ast_selectors.hpp:223:5: note: in expansion of macro ‘ATTACH_CMP_OPERATIONS’ 223 | ATTACH_CMP_OPERATIONS(AttributeSelector) | ^~~~~~~~~~~~~~~~~~~~~ src/ast_selectors.hpp:136:18: warning: ‘virtual bool Sass::SimpleSelector::operator==(const Sass::ComplexSelector&) const’ was hidden [-Woverloaded-virtual=] 136 | virtual bool operator==(const ComplexSelector& rhs) const; | ^~~~~~~~ src/ast_def_macros.hpp:109:16: note: by ‘Sass::AttributeSelector::operator==’ 109 | virtual bool operator==(const klass& rhs) const; \ | ^~~~~~~~ src/ast_selectors.hpp:223:5: note: in expansion of macro ‘ATTACH_CMP_OPERATIONS’ 223 | ATTACH_CMP_OPERATIONS(AttributeSelector) | ^~~~~~~~~~~~~~~~~~~~~ src/ast_selectors.hpp:135:18: warning: ‘virtual bool Sass::SimpleSelector::operator==(const Sass::SelectorList&) const’ was hidden [-Woverloaded-virtual=] 135 | virtual bool operator==(const SelectorList& rhs) const; | ^~~~~~~~ src/ast_def_macros.hpp:109:16: note: by ‘Sass::AttributeSelector::operator==’ 109 | virtual bool operator==(const klass& rhs) const; \ | ^~~~~~~~ src/ast_selectors.hpp:223:5: note: in expansion of macro ‘ATTACH_CMP_OPERATIONS’ 223 | ATTACH_CMP_OPERATIONS(AttributeSelector) | ^~~~~~~~~~~~~~~~~~~~~ src/ast_selectors.hpp:133:10: warning: ‘virtual bool Sass::SimpleSelector::operator==(const Sass::Selector&) const’ was hidden [-Woverloaded-virtual=] 133 | bool operator==(const Selector& rhs) const final override; | ^~~~~~~~ src/ast_def_macros.hpp:109:16: note: by ‘Sass::AttributeSelector::operator==’ 109 | virtual bool operator==(const klass& rhs) const; \ | ^~~~~~~~ src/ast_selectors.hpp:223:5: note: in expansion of macro ‘ATTACH_CMP_OPERATIONS’ 223 | ATTACH_CMP_OPERATIONS(AttributeSelector) | ^~~~~~~~~~~~~~~~~~~~~ src/ast_def_macros.hpp:106:16: warning: ‘virtual bool Sass::SimpleSelector::operator!=(const Sass::SimpleSelector&) const’ was hidden [-Woverloaded-virtual=] 106 | virtual bool operator!=(const klass& rhs) const { return !(*this == rhs); }; \ | ^~~~~~~~ src/ast_selectors.hpp:139:5: note: in expansion of macro ‘ATTACH_VIRTUAL_CMP_OPERATIONS’ 139 | ATTACH_VIRTUAL_CMP_OPERATIONS(SimpleSelector); | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~ src/ast_def_macros.hpp:110:16: note: by ‘virtual bool Sass::AttributeSelector::operator!=(const Sass::AttributeSelector&) const’ 110 | virtual bool operator!=(const klass& rhs) const { return !(*this == rhs); }; \ | ^~~~~~~~ src/ast_selectors.hpp:223:5: note: in expansion of macro ‘ATTACH_CMP_OPERATIONS’ 223 | ATTACH_CMP_OPERATIONS(AttributeSelector) | ^~~~~~~~~~~~~~~~~~~~~ src/ast_def_macros.hpp:106:16: warning: ‘virtual bool Sass::Selector::operator!=(const Sass::Selector&) const’ was hidden [-Woverloaded-virtual=] 106 | virtual bool operator!=(const klass& rhs) const { return !(*this == rhs); }; \ | ^~~~~~~~ src/ast_selectors.hpp:56:5: note: in expansion of macro ‘ATTACH_VIRTUAL_CMP_OPERATIONS’ 56 | ATTACH_VIRTUAL_CMP_OPERATIONS(Selector) | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~ src/ast_def_macros.hpp:110:16: note: by ‘virtual bool Sass::ComplexSelector::operator!=(const Sass::ComplexSelector&) const’ 110 | virtual bool operator!=(const klass& rhs) const { return !(*this == rhs); }; \ | ^~~~~~~~ src/ast_selectors.hpp:310:5: note: in expansion of macro ‘ATTACH_CMP_OPERATIONS’ 310 | ATTACH_CMP_OPERATIONS(ComplexSelector) | ^~~~~~~~~~~~~~~~~~~~~ src/ast_def_macros.hpp:106:16: warning: ‘virtual bool Sass::Selector::operator!=(const Sass::Selector&) const’ was hidden [-Woverloaded-virtual=] 106 | virtual bool operator!=(const klass& rhs) const { return !(*this == rhs); }; \ | ^~~~~~~~ src/ast_selectors.hpp:56:5: note: in expansion of macro ‘ATTACH_VIRTUAL_CMP_OPERATIONS’ 56 | ATTACH_VIRTUAL_CMP_OPERATIONS(Selector) | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~ src/ast_def_macros.hpp:106:16: note: by ‘virtual bool Sass::SelectorComponent::operator!=(const Sass::SelectorComponent&) const’ 106 | virtual bool operator!=(const klass& rhs) const { return !(*this == rhs); }; \ | ^~~~~~~~ src/ast_selectors.hpp:349:5: note: in expansion of macro ‘ATTACH_VIRTUAL_CMP_OPERATIONS’ 349 | ATTACH_VIRTUAL_CMP_OPERATIONS(SelectorComponent); | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~ src/ast_def_macros.hpp:106:16: warning: ‘virtual bool Sass::SelectorComponent::operator!=(const Sass::SelectorComponent&) const’ was hidden [-Woverloaded-virtual=] 106 | virtual bool operator!=(const klass& rhs) const { return !(*this == rhs); }; \ | ^~~~~~~~ src/ast_selectors.hpp:349:5: note: in expansion of macro ‘ATTACH_VIRTUAL_CMP_OPERATIONS’ 349 | ATTACH_VIRTUAL_CMP_OPERATIONS(SelectorComponent); | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~ src/ast_def_macros.hpp:110:16: note: by ‘virtual bool Sass::SelectorCombinator::operator!=(const Sass::SelectorCombinator&) const’ 110 | virtual bool operator!=(const klass& rhs) const { return !(*this == rhs); }; \ | ^~~~~~~~ src/ast_selectors.hpp:407:5: note: in expansion of macro ‘ATTACH_CMP_OPERATIONS’ 407 | ATTACH_CMP_OPERATIONS(SelectorCombinator) | ^~~~~~~~~~~~~~~~~~~~~ g++ -std=gnu++17 -Wall -O2 -std=c++11 -I ./include -fPIC -c -o src/ast_sel_weave.o src/ast_sel_weave.cpp In file included from src/ast_sel_weave.cpp:5: src/ast.hpp:90:18: warning: ‘virtual bool Sass::AST_Node::operator==(const Sass::AST_Node&) const’ was hidden [-Woverloaded-virtual=] 90 | virtual bool operator== (const AST_Node& rhs) const { | ^~~~~~~~ src/ast.hpp:165:18: note: by ‘virtual bool Sass::Expression::operator==(const Sass::Expression&) const’ 165 | virtual bool operator== (const Expression& rhs) const { return false; } | ^~~~~~~~ src/ast.hpp:96:18: warning: ‘virtual bool Sass::AST_Node::operator!=(const Sass::AST_Node&) const’ was hidden [-Woverloaded-virtual=] 96 | virtual bool operator!= (const AST_Node& rhs) const { | ^~~~~~~~ src/ast.hpp:167:17: note: by ‘bool Sass::Expression::operator!=(const Sass::Expression&) const’ 167 | inline bool operator!=(const Expression& rhs) const { return !(rhs == *this); } | ^~~~~~~~ src/ast.hpp:90:18: warning: ‘virtual bool Sass::AST_Node::operator==(const Sass::AST_Node&) const’ was hidden [-Woverloaded-virtual=] 90 | virtual bool operator== (const AST_Node& rhs) const { | ^~~~~~~~ src/ast.hpp:908:10: note: by ‘bool Sass::CssMediaRule::operator==(const Sass::CssMediaRule&) const’ 908 | bool operator== (const CssMediaRule& rhs) const { | ^~~~~~~~ src/ast.hpp:96:18: warning: ‘virtual bool Sass::AST_Node::operator!=(const Sass::AST_Node&) const’ was hidden [-Woverloaded-virtual=] 96 | virtual bool operator!= (const AST_Node& rhs) const { | ^~~~~~~~ src/ast.hpp:911:10: note: by ‘bool Sass::CssMediaRule::operator!=(const Sass::CssMediaRule&) const’ 911 | bool operator!=(const CssMediaRule& rhs) const { | ^~~~~~~~ src/ast.hpp:90:18: warning: ‘virtual bool Sass::AST_Node::operator==(const Sass::AST_Node&) const’ was hidden [-Woverloaded-virtual=] 90 | virtual bool operator== (const AST_Node& rhs) const { | ^~~~~~~~ src/ast.hpp:939:10: note: by ‘bool Sass::CssMediaQuery::operator==(const Sass::CssMediaQuery&) const’ 939 | bool operator== (const CssMediaQuery& rhs) const; | ^~~~~~~~ src/ast.hpp:96:18: warning: ‘virtual bool Sass::AST_Node::operator!=(const Sass::AST_Node&) const’ was hidden [-Woverloaded-virtual=] 96 | virtual bool operator!= (const AST_Node& rhs) const { | ^~~~~~~~ src/ast.hpp:940:10: note: by ‘bool Sass::CssMediaQuery::operator!=(const Sass::CssMediaQuery&) const’ 940 | bool operator!=(const CssMediaQuery& rhs) const { | ^~~~~~~~ src/ast.hpp:165:18: warning: ‘virtual bool Sass::Expression::operator==(const Sass::Expression&) const’ was hidden [-Woverloaded-virtual=] 165 | virtual bool operator== (const Expression& rhs) const { return false; } | ^~~~~~~~ In file included from src/ast.hpp:14: src/ast_def_macros.hpp:105:16: note: by ‘virtual bool Sass::Selector::operator==(const Sass::Selector&) const’ 105 | virtual bool operator==(const klass& rhs) const = 0; \ | ^~~~~~~~ src/ast_selectors.hpp:56:5: note: in expansion of macro ‘ATTACH_VIRTUAL_CMP_OPERATIONS’ 56 | ATTACH_VIRTUAL_CMP_OPERATIONS(Selector) | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~ src/ast.hpp:96:18: warning: ‘virtual bool Sass::AST_Node::operator!=(const Sass::AST_Node&) const’ was hidden [-Woverloaded-virtual=] 96 | virtual bool operator!= (const AST_Node& rhs) const { | ^~~~~~~~ src/ast_def_macros.hpp:106:16: note: by ‘virtual bool Sass::Selector::operator!=(const Sass::Selector&) const’ 106 | virtual bool operator!=(const klass& rhs) const { return !(*this == rhs); }; \ | ^~~~~~~~ src/ast_selectors.hpp:56:5: note: in expansion of macro ‘ATTACH_VIRTUAL_CMP_OPERATIONS’ 56 | ATTACH_VIRTUAL_CMP_OPERATIONS(Selector) | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~ src/ast_def_macros.hpp:106:16: warning: ‘virtual bool Sass::Selector::operator!=(const Sass::Selector&) const’ was hidden [-Woverloaded-virtual=] 106 | virtual bool operator!=(const klass& rhs) const { return !(*this == rhs); }; \ | ^~~~~~~~ src/ast_selectors.hpp:56:5: note: in expansion of macro ‘ATTACH_VIRTUAL_CMP_OPERATIONS’ 56 | ATTACH_VIRTUAL_CMP_OPERATIONS(Selector) | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~ src/ast_def_macros.hpp:106:16: note: by ‘virtual bool Sass::SimpleSelector::operator!=(const Sass::SimpleSelector&) const’ 106 | virtual bool operator!=(const klass& rhs) const { return !(*this == rhs); }; \ | ^~~~~~~~ src/ast_selectors.hpp:139:5: note: in expansion of macro ‘ATTACH_VIRTUAL_CMP_OPERATIONS’ 139 | ATTACH_VIRTUAL_CMP_OPERATIONS(SimpleSelector); | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~ In file included from src/ast.hpp:1055: src/ast_selectors.hpp:137:18: warning: ‘virtual bool Sass::SimpleSelector::operator==(const Sass::CompoundSelector&) const’ was hidden [-Woverloaded-virtual=] 137 | virtual bool operator==(const CompoundSelector& rhs) const; | ^~~~~~~~ src/ast_def_macros.hpp:109:16: note: by ‘Sass::PlaceholderSelector::operator==’ 109 | virtual bool operator==(const klass& rhs) const; \ | ^~~~~~~~ src/ast_selectors.hpp:157:5: note: in expansion of macro ‘ATTACH_CMP_OPERATIONS’ 157 | ATTACH_CMP_OPERATIONS(PlaceholderSelector) | ^~~~~~~~~~~~~~~~~~~~~ src/ast_selectors.hpp:136:18: warning: ‘virtual bool Sass::SimpleSelector::operator==(const Sass::ComplexSelector&) const’ was hidden [-Woverloaded-virtual=] 136 | virtual bool operator==(const ComplexSelector& rhs) const; | ^~~~~~~~ src/ast_def_macros.hpp:109:16: note: by ‘Sass::PlaceholderSelector::operator==’ 109 | virtual bool operator==(const klass& rhs) const; \ | ^~~~~~~~ src/ast_selectors.hpp:157:5: note: in expansion of macro ‘ATTACH_CMP_OPERATIONS’ 157 | ATTACH_CMP_OPERATIONS(PlaceholderSelector) | ^~~~~~~~~~~~~~~~~~~~~ src/ast_selectors.hpp:135:18: warning: ‘virtual bool Sass::SimpleSelector::operator==(const Sass::SelectorList&) const’ was hidden [-Woverloaded-virtual=] 135 | virtual bool operator==(const SelectorList& rhs) const; | ^~~~~~~~ src/ast_def_macros.hpp:109:16: note: by ‘Sass::PlaceholderSelector::operator==’ 109 | virtual bool operator==(const klass& rhs) const; \ | ^~~~~~~~ src/ast_selectors.hpp:157:5: note: in expansion of macro ‘ATTACH_CMP_OPERATIONS’ 157 | ATTACH_CMP_OPERATIONS(PlaceholderSelector) | ^~~~~~~~~~~~~~~~~~~~~ src/ast_selectors.hpp:133:10: warning: ‘virtual bool Sass::SimpleSelector::operator==(const Sass::Selector&) const’ was hidden [-Woverloaded-virtual=] 133 | bool operator==(const Selector& rhs) const final override; | ^~~~~~~~ src/ast_def_macros.hpp:109:16: note: by ‘Sass::PlaceholderSelector::operator==’ 109 | virtual bool operator==(const klass& rhs) const; \ | ^~~~~~~~ src/ast_selectors.hpp:157:5: note: in expansion of macro ‘ATTACH_CMP_OPERATIONS’ 157 | ATTACH_CMP_OPERATIONS(PlaceholderSelector) | ^~~~~~~~~~~~~~~~~~~~~ src/ast_def_macros.hpp:106:16: warning: ‘virtual bool Sass::SimpleSelector::operator!=(const Sass::SimpleSelector&) const’ was hidden [-Woverloaded-virtual=] 106 | virtual bool operator!=(const klass& rhs) const { return !(*this == rhs); }; \ | ^~~~~~~~ src/ast_selectors.hpp:139:5: note: in expansion of macro ‘ATTACH_VIRTUAL_CMP_OPERATIONS’ 139 | ATTACH_VIRTUAL_CMP_OPERATIONS(SimpleSelector); | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~ src/ast_def_macros.hpp:110:16: note: by ‘virtual bool Sass::PlaceholderSelector::operator!=(const Sass::PlaceholderSelector&) const’ 110 | virtual bool operator!=(const klass& rhs) const { return !(*this == rhs); }; \ | ^~~~~~~~ src/ast_selectors.hpp:157:5: note: in expansion of macro ‘ATTACH_CMP_OPERATIONS’ 157 | ATTACH_CMP_OPERATIONS(PlaceholderSelector) | ^~~~~~~~~~~~~~~~~~~~~ src/ast_selectors.hpp:137:18: warning: ‘virtual bool Sass::SimpleSelector::operator==(const Sass::CompoundSelector&) const’ was hidden [-Woverloaded-virtual=] 137 | virtual bool operator==(const CompoundSelector& rhs) const; | ^~~~~~~~ src/ast_def_macros.hpp:109:16: note: by ‘Sass::TypeSelector::operator==’ 109 | virtual bool operator==(const klass& rhs) const; \ | ^~~~~~~~ src/ast_selectors.hpp:174:5: note: in expansion of macro ‘ATTACH_CMP_OPERATIONS’ 174 | ATTACH_CMP_OPERATIONS(TypeSelector) | ^~~~~~~~~~~~~~~~~~~~~ src/ast_selectors.hpp:136:18: warning: ‘virtual bool Sass::SimpleSelector::operator==(const Sass::ComplexSelector&) const’ was hidden [-Woverloaded-virtual=] 136 | virtual bool operator==(const ComplexSelector& rhs) const; | ^~~~~~~~ src/ast_def_macros.hpp:109:16: note: by ‘Sass::TypeSelector::operator==’ 109 | virtual bool operator==(const klass& rhs) const; \ | ^~~~~~~~ src/ast_selectors.hpp:174:5: note: in expansion of macro ‘ATTACH_CMP_OPERATIONS’ 174 | ATTACH_CMP_OPERATIONS(TypeSelector) | ^~~~~~~~~~~~~~~~~~~~~ src/ast_selectors.hpp:135:18: warning: ‘virtual bool Sass::SimpleSelector::operator==(const Sass::SelectorList&) const’ was hidden [-Woverloaded-virtual=] 135 | virtual bool operator==(const SelectorList& rhs) const; | ^~~~~~~~ src/ast_def_macros.hpp:109:16: note: by ‘Sass::TypeSelector::operator==’ 109 | virtual bool operator==(const klass& rhs) const; \ | ^~~~~~~~ src/ast_selectors.hpp:174:5: note: in expansion of macro ‘ATTACH_CMP_OPERATIONS’ 174 | ATTACH_CMP_OPERATIONS(TypeSelector) | ^~~~~~~~~~~~~~~~~~~~~ src/ast_selectors.hpp:133:10: warning: ‘virtual bool Sass::SimpleSelector::operator==(const Sass::Selector&) const’ was hidden [-Woverloaded-virtual=] 133 | bool operator==(const Selector& rhs) const final override; | ^~~~~~~~ src/ast_def_macros.hpp:109:16: note: by ‘Sass::TypeSelector::operator==’ 109 | virtual bool operator==(const klass& rhs) const; \ | ^~~~~~~~ src/ast_selectors.hpp:174:5: note: in expansion of macro ‘ATTACH_CMP_OPERATIONS’ 174 | ATTACH_CMP_OPERATIONS(TypeSelector) | ^~~~~~~~~~~~~~~~~~~~~ src/ast_def_macros.hpp:106:16: warning: ‘virtual bool Sass::SimpleSelector::operator!=(const Sass::SimpleSelector&) const’ was hidden [-Woverloaded-virtual=] 106 | virtual bool operator!=(const klass& rhs) const { return !(*this == rhs); }; \ | ^~~~~~~~ src/ast_selectors.hpp:139:5: note: in expansion of macro ‘ATTACH_VIRTUAL_CMP_OPERATIONS’ 139 | ATTACH_VIRTUAL_CMP_OPERATIONS(SimpleSelector); | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~ src/ast_def_macros.hpp:110:16: note: by ‘virtual bool Sass::TypeSelector::operator!=(const Sass::TypeSelector&) const’ 110 | virtual bool operator!=(const klass& rhs) const { return !(*this == rhs); }; \ | ^~~~~~~~ src/ast_selectors.hpp:174:5: note: in expansion of macro ‘ATTACH_CMP_OPERATIONS’ 174 | ATTACH_CMP_OPERATIONS(TypeSelector) | ^~~~~~~~~~~~~~~~~~~~~ src/ast_selectors.hpp:137:18: warning: ‘virtual bool Sass::SimpleSelector::operator==(const Sass::CompoundSelector&) const’ was hidden [-Woverloaded-virtual=] 137 | virtual bool operator==(const CompoundSelector& rhs) const; | ^~~~~~~~ src/ast_def_macros.hpp:109:16: note: by ‘Sass::ClassSelector::operator==’ 109 | virtual bool operator==(const klass& rhs) const; \ | ^~~~~~~~ src/ast_selectors.hpp:188:5: note: in expansion of macro ‘ATTACH_CMP_OPERATIONS’ 188 | ATTACH_CMP_OPERATIONS(ClassSelector) | ^~~~~~~~~~~~~~~~~~~~~ src/ast_selectors.hpp:136:18: warning: ‘virtual bool Sass::SimpleSelector::operator==(const Sass::ComplexSelector&) const’ was hidden [-Woverloaded-virtual=] 136 | virtual bool operator==(const ComplexSelector& rhs) const; | ^~~~~~~~ src/ast_def_macros.hpp:109:16: note: by ‘Sass::ClassSelector::operator==’ 109 | virtual bool operator==(const klass& rhs) const; \ | ^~~~~~~~ src/ast_selectors.hpp:188:5: note: in expansion of macro ‘ATTACH_CMP_OPERATIONS’ 188 | ATTACH_CMP_OPERATIONS(ClassSelector) | ^~~~~~~~~~~~~~~~~~~~~ src/ast_selectors.hpp:135:18: warning: ‘virtual bool Sass::SimpleSelector::operator==(const Sass::SelectorList&) const’ was hidden [-Woverloaded-virtual=] 135 | virtual bool operator==(const SelectorList& rhs) const; | ^~~~~~~~ src/ast_def_macros.hpp:109:16: note: by ‘Sass::ClassSelector::operator==’ 109 | virtual bool operator==(const klass& rhs) const; \ | ^~~~~~~~ src/ast_selectors.hpp:188:5: note: in expansion of macro ‘ATTACH_CMP_OPERATIONS’ 188 | ATTACH_CMP_OPERATIONS(ClassSelector) | ^~~~~~~~~~~~~~~~~~~~~ src/ast_selectors.hpp:133:10: warning: ‘virtual bool Sass::SimpleSelector::operator==(const Sass::Selector&) const’ was hidden [-Woverloaded-virtual=] 133 | bool operator==(const Selector& rhs) const final override; | ^~~~~~~~ src/ast_def_macros.hpp:109:16: note: by ‘Sass::ClassSelector::operator==’ 109 | virtual bool operator==(const klass& rhs) const; \ | ^~~~~~~~ src/ast_selectors.hpp:188:5: note: in expansion of macro ‘ATTACH_CMP_OPERATIONS’ 188 | ATTACH_CMP_OPERATIONS(ClassSelector) | ^~~~~~~~~~~~~~~~~~~~~ src/ast_def_macros.hpp:106:16: warning: ‘virtual bool Sass::SimpleSelector::operator!=(const Sass::SimpleSelector&) const’ was hidden [-Woverloaded-virtual=] 106 | virtual bool operator!=(const klass& rhs) const { return !(*this == rhs); }; \ | ^~~~~~~~ src/ast_selectors.hpp:139:5: note: in expansion of macro ‘ATTACH_VIRTUAL_CMP_OPERATIONS’ 139 | ATTACH_VIRTUAL_CMP_OPERATIONS(SimpleSelector); | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~ src/ast_def_macros.hpp:110:16: note: by ‘virtual bool Sass::ClassSelector::operator!=(const Sass::ClassSelector&) const’ 110 | virtual bool operator!=(const klass& rhs) const { return !(*this == rhs); }; \ | ^~~~~~~~ src/ast_selectors.hpp:188:5: note: in expansion of macro ‘ATTACH_CMP_OPERATIONS’ 188 | ATTACH_CMP_OPERATIONS(ClassSelector) | ^~~~~~~~~~~~~~~~~~~~~ src/ast_selectors.hpp:137:18: warning: ‘virtual bool Sass::SimpleSelector::operator==(const Sass::CompoundSelector&) const’ was hidden [-Woverloaded-virtual=] 137 | virtual bool operator==(const CompoundSelector& rhs) const; | ^~~~~~~~ src/ast_def_macros.hpp:109:16: note: by ‘Sass::IDSelector::operator==’ 109 | virtual bool operator==(const klass& rhs) const; \ | ^~~~~~~~ src/ast_selectors.hpp:204:5: note: in expansion of macro ‘ATTACH_CMP_OPERATIONS’ 204 | ATTACH_CMP_OPERATIONS(IDSelector) | ^~~~~~~~~~~~~~~~~~~~~ src/ast_selectors.hpp:136:18: warning: ‘virtual bool Sass::SimpleSelector::operator==(const Sass::ComplexSelector&) const’ was hidden [-Woverloaded-virtual=] 136 | virtual bool operator==(const ComplexSelector& rhs) const; | ^~~~~~~~ src/ast_def_macros.hpp:109:16: note: by ‘Sass::IDSelector::operator==’ 109 | virtual bool operator==(const klass& rhs) const; \ | ^~~~~~~~ src/ast_selectors.hpp:204:5: note: in expansion of macro ‘ATTACH_CMP_OPERATIONS’ 204 | ATTACH_CMP_OPERATIONS(IDSelector) | ^~~~~~~~~~~~~~~~~~~~~ src/ast_selectors.hpp:135:18: warning: ‘virtual bool Sass::SimpleSelector::operator==(const Sass::SelectorList&) const’ was hidden [-Woverloaded-virtual=] 135 | virtual bool operator==(const SelectorList& rhs) const; | ^~~~~~~~ src/ast_def_macros.hpp:109:16: note: by ‘Sass::IDSelector::operator==’ 109 | virtual bool operator==(const klass& rhs) const; \ | ^~~~~~~~ src/ast_selectors.hpp:204:5: note: in expansion of macro ‘ATTACH_CMP_OPERATIONS’ 204 | ATTACH_CMP_OPERATIONS(IDSelector) | ^~~~~~~~~~~~~~~~~~~~~ src/ast_selectors.hpp:133:10: warning: ‘virtual bool Sass::SimpleSelector::operator==(const Sass::Selector&) const’ was hidden [-Woverloaded-virtual=] 133 | bool operator==(const Selector& rhs) const final override; | ^~~~~~~~ src/ast_def_macros.hpp:109:16: note: by ‘Sass::IDSelector::operator==’ 109 | virtual bool operator==(const klass& rhs) const; \ | ^~~~~~~~ src/ast_selectors.hpp:204:5: note: in expansion of macro ‘ATTACH_CMP_OPERATIONS’ 204 | ATTACH_CMP_OPERATIONS(IDSelector) | ^~~~~~~~~~~~~~~~~~~~~ src/ast_def_macros.hpp:106:16: warning: ‘virtual bool Sass::SimpleSelector::operator!=(const Sass::SimpleSelector&) const’ was hidden [-Woverloaded-virtual=] 106 | virtual bool operator!=(const klass& rhs) const { return !(*this == rhs); }; \ | ^~~~~~~~ src/ast_selectors.hpp:139:5: note: in expansion of macro ‘ATTACH_VIRTUAL_CMP_OPERATIONS’ 139 | ATTACH_VIRTUAL_CMP_OPERATIONS(SimpleSelector); | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~ src/ast_def_macros.hpp:110:16: note: by ‘virtual bool Sass::IDSelector::operator!=(const Sass::IDSelector&) const’ 110 | virtual bool operator!=(const klass& rhs) const { return !(*this == rhs); }; \ | ^~~~~~~~ src/ast_selectors.hpp:204:5: note: in expansion of macro ‘ATTACH_CMP_OPERATIONS’ 204 | ATTACH_CMP_OPERATIONS(IDSelector) | ^~~~~~~~~~~~~~~~~~~~~ src/ast_selectors.hpp:137:18: warning: ‘virtual bool Sass::SimpleSelector::operator==(const Sass::CompoundSelector&) const’ was hidden [-Woverloaded-virtual=] 137 | virtual bool operator==(const CompoundSelector& rhs) const; | ^~~~~~~~ src/ast_def_macros.hpp:109:16: note: by ‘Sass::AttributeSelector::operator==’ 109 | virtual bool operator==(const klass& rhs) const; \ | ^~~~~~~~ src/ast_selectors.hpp:223:5: note: in expansion of macro ‘ATTACH_CMP_OPERATIONS’ 223 | ATTACH_CMP_OPERATIONS(AttributeSelector) | ^~~~~~~~~~~~~~~~~~~~~ src/ast_selectors.hpp:136:18: warning: ‘virtual bool Sass::SimpleSelector::operator==(const Sass::ComplexSelector&) const’ was hidden [-Woverloaded-virtual=] 136 | virtual bool operator==(const ComplexSelector& rhs) const; | ^~~~~~~~ src/ast_def_macros.hpp:109:16: note: by ‘Sass::AttributeSelector::operator==’ 109 | virtual bool operator==(const klass& rhs) const; \ | ^~~~~~~~ src/ast_selectors.hpp:223:5: note: in expansion of macro ‘ATTACH_CMP_OPERATIONS’ 223 | ATTACH_CMP_OPERATIONS(AttributeSelector) | ^~~~~~~~~~~~~~~~~~~~~ src/ast_selectors.hpp:135:18: warning: ‘virtual bool Sass::SimpleSelector::operator==(const Sass::SelectorList&) const’ was hidden [-Woverloaded-virtual=] 135 | virtual bool operator==(const SelectorList& rhs) const; | ^~~~~~~~ src/ast_def_macros.hpp:109:16: note: by ‘Sass::AttributeSelector::operator==’ 109 | virtual bool operator==(const klass& rhs) const; \ | ^~~~~~~~ src/ast_selectors.hpp:223:5: note: in expansion of macro ‘ATTACH_CMP_OPERATIONS’ 223 | ATTACH_CMP_OPERATIONS(AttributeSelector) | ^~~~~~~~~~~~~~~~~~~~~ src/ast_selectors.hpp:133:10: warning: ‘virtual bool Sass::SimpleSelector::operator==(const Sass::Selector&) const’ was hidden [-Woverloaded-virtual=] 133 | bool operator==(const Selector& rhs) const final override; | ^~~~~~~~ src/ast_def_macros.hpp:109:16: note: by ‘Sass::AttributeSelector::operator==’ 109 | virtual bool operator==(const klass& rhs) const; \ | ^~~~~~~~ src/ast_selectors.hpp:223:5: note: in expansion of macro ‘ATTACH_CMP_OPERATIONS’ 223 | ATTACH_CMP_OPERATIONS(AttributeSelector) | ^~~~~~~~~~~~~~~~~~~~~ src/ast_def_macros.hpp:106:16: warning: ‘virtual bool Sass::SimpleSelector::operator!=(const Sass::SimpleSelector&) const’ was hidden [-Woverloaded-virtual=] 106 | virtual bool operator!=(const klass& rhs) const { return !(*this == rhs); }; \ | ^~~~~~~~ src/ast_selectors.hpp:139:5: note: in expansion of macro ‘ATTACH_VIRTUAL_CMP_OPERATIONS’ 139 | ATTACH_VIRTUAL_CMP_OPERATIONS(SimpleSelector); | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~ src/ast_def_macros.hpp:110:16: note: by ‘virtual bool Sass::AttributeSelector::operator!=(const Sass::AttributeSelector&) const’ 110 | virtual bool operator!=(const klass& rhs) const { return !(*this == rhs); }; \ | ^~~~~~~~ src/ast_selectors.hpp:223:5: note: in expansion of macro ‘ATTACH_CMP_OPERATIONS’ 223 | ATTACH_CMP_OPERATIONS(AttributeSelector) | ^~~~~~~~~~~~~~~~~~~~~ src/ast_def_macros.hpp:106:16: warning: ‘virtual bool Sass::Selector::operator!=(const Sass::Selector&) const’ was hidden [-Woverloaded-virtual=] 106 | virtual bool operator!=(const klass& rhs) const { return !(*this == rhs); }; \ | ^~~~~~~~ src/ast_selectors.hpp:56:5: note: in expansion of macro ‘ATTACH_VIRTUAL_CMP_OPERATIONS’ 56 | ATTACH_VIRTUAL_CMP_OPERATIONS(Selector) | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~ src/ast_def_macros.hpp:110:16: note: by ‘virtual bool Sass::ComplexSelector::operator!=(const Sass::ComplexSelector&) const’ 110 | virtual bool operator!=(const klass& rhs) const { return !(*this == rhs); }; \ | ^~~~~~~~ src/ast_selectors.hpp:310:5: note: in expansion of macro ‘ATTACH_CMP_OPERATIONS’ 310 | ATTACH_CMP_OPERATIONS(ComplexSelector) | ^~~~~~~~~~~~~~~~~~~~~ src/ast_def_macros.hpp:106:16: warning: ‘virtual bool Sass::Selector::operator!=(const Sass::Selector&) const’ was hidden [-Woverloaded-virtual=] 106 | virtual bool operator!=(const klass& rhs) const { return !(*this == rhs); }; \ | ^~~~~~~~ src/ast_selectors.hpp:56:5: note: in expansion of macro ‘ATTACH_VIRTUAL_CMP_OPERATIONS’ 56 | ATTACH_VIRTUAL_CMP_OPERATIONS(Selector) | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~ src/ast_def_macros.hpp:106:16: note: by ‘virtual bool Sass::SelectorComponent::operator!=(const Sass::SelectorComponent&) const’ 106 | virtual bool operator!=(const klass& rhs) const { return !(*this == rhs); }; \ | ^~~~~~~~ src/ast_selectors.hpp:349:5: note: in expansion of macro ‘ATTACH_VIRTUAL_CMP_OPERATIONS’ 349 | ATTACH_VIRTUAL_CMP_OPERATIONS(SelectorComponent); | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~ src/ast_def_macros.hpp:106:16: warning: ‘virtual bool Sass::SelectorComponent::operator!=(const Sass::SelectorComponent&) const’ was hidden [-Woverloaded-virtual=] 106 | virtual bool operator!=(const klass& rhs) const { return !(*this == rhs); }; \ | ^~~~~~~~ src/ast_selectors.hpp:349:5: note: in expansion of macro ‘ATTACH_VIRTUAL_CMP_OPERATIONS’ 349 | ATTACH_VIRTUAL_CMP_OPERATIONS(SelectorComponent); | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~ src/ast_def_macros.hpp:110:16: note: by ‘virtual bool Sass::SelectorCombinator::operator!=(const Sass::SelectorCombinator&) const’ 110 | virtual bool operator!=(const klass& rhs) const { return !(*this == rhs); }; \ | ^~~~~~~~ src/ast_selectors.hpp:407:5: note: in expansion of macro ‘ATTACH_CMP_OPERATIONS’ 407 | ATTACH_CMP_OPERATIONS(SelectorCombinator) | ^~~~~~~~~~~~~~~~~~~~~ g++ -std=gnu++17 -Wall -O2 -std=c++11 -I ./include -fPIC -c -o src/ast_selectors.o src/ast_selectors.cpp In file included from src/ast_selectors.cpp:5: src/ast.hpp:90:18: warning: ‘virtual bool Sass::AST_Node::operator==(const Sass::AST_Node&) const’ was hidden [-Woverloaded-virtual=] 90 | virtual bool operator== (const AST_Node& rhs) const { | ^~~~~~~~ src/ast.hpp:165:18: note: by ‘virtual bool Sass::Expression::operator==(const Sass::Expression&) const’ 165 | virtual bool operator== (const Expression& rhs) const { return false; } | ^~~~~~~~ src/ast.hpp:96:18: warning: ‘virtual bool Sass::AST_Node::operator!=(const Sass::AST_Node&) const’ was hidden [-Woverloaded-virtual=] 96 | virtual bool operator!= (const AST_Node& rhs) const { | ^~~~~~~~ src/ast.hpp:167:17: note: by ‘bool Sass::Expression::operator!=(const Sass::Expression&) const’ 167 | inline bool operator!=(const Expression& rhs) const { return !(rhs == *this); } | ^~~~~~~~ src/ast.hpp:90:18: warning: ‘virtual bool Sass::AST_Node::operator==(const Sass::AST_Node&) const’ was hidden [-Woverloaded-virtual=] 90 | virtual bool operator== (const AST_Node& rhs) const { | ^~~~~~~~ src/ast.hpp:908:10: note: by ‘bool Sass::CssMediaRule::operator==(const Sass::CssMediaRule&) const’ 908 | bool operator== (const CssMediaRule& rhs) const { | ^~~~~~~~ src/ast.hpp:96:18: warning: ‘virtual bool Sass::AST_Node::operator!=(const Sass::AST_Node&) const’ was hidden [-Woverloaded-virtual=] 96 | virtual bool operator!= (const AST_Node& rhs) const { | ^~~~~~~~ src/ast.hpp:911:10: note: by ‘bool Sass::CssMediaRule::operator!=(const Sass::CssMediaRule&) const’ 911 | bool operator!=(const CssMediaRule& rhs) const { | ^~~~~~~~ src/ast.hpp:90:18: warning: ‘virtual bool Sass::AST_Node::operator==(const Sass::AST_Node&) const’ was hidden [-Woverloaded-virtual=] 90 | virtual bool operator== (const AST_Node& rhs) const { | ^~~~~~~~ src/ast.hpp:939:10: note: by ‘bool Sass::CssMediaQuery::operator==(const Sass::CssMediaQuery&) const’ 939 | bool operator== (const CssMediaQuery& rhs) const; | ^~~~~~~~ src/ast.hpp:96:18: warning: ‘virtual bool Sass::AST_Node::operator!=(const Sass::AST_Node&) const’ was hidden [-Woverloaded-virtual=] 96 | virtual bool operator!= (const AST_Node& rhs) const { | ^~~~~~~~ src/ast.hpp:940:10: note: by ‘bool Sass::CssMediaQuery::operator!=(const Sass::CssMediaQuery&) const’ 940 | bool operator!=(const CssMediaQuery& rhs) const { | ^~~~~~~~ src/ast.hpp:165:18: warning: ‘virtual bool Sass::Expression::operator==(const Sass::Expression&) const’ was hidden [-Woverloaded-virtual=] 165 | virtual bool operator== (const Expression& rhs) const { return false; } | ^~~~~~~~ In file included from src/ast.hpp:14: src/ast_def_macros.hpp:105:16: note: by ‘virtual bool Sass::Selector::operator==(const Sass::Selector&) const’ 105 | virtual bool operator==(const klass& rhs) const = 0; \ | ^~~~~~~~ src/ast_selectors.hpp:56:5: note: in expansion of macro ‘ATTACH_VIRTUAL_CMP_OPERATIONS’ 56 | ATTACH_VIRTUAL_CMP_OPERATIONS(Selector) | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~ src/ast.hpp:96:18: warning: ‘virtual bool Sass::AST_Node::operator!=(const Sass::AST_Node&) const’ was hidden [-Woverloaded-virtual=] 96 | virtual bool operator!= (const AST_Node& rhs) const { | ^~~~~~~~ src/ast_def_macros.hpp:106:16: note: by ‘virtual bool Sass::Selector::operator!=(const Sass::Selector&) const’ 106 | virtual bool operator!=(const klass& rhs) const { return !(*this == rhs); }; \ | ^~~~~~~~ src/ast_selectors.hpp:56:5: note: in expansion of macro ‘ATTACH_VIRTUAL_CMP_OPERATIONS’ 56 | ATTACH_VIRTUAL_CMP_OPERATIONS(Selector) | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~ src/ast_def_macros.hpp:106:16: warning: ‘virtual bool Sass::Selector::operator!=(const Sass::Selector&) const’ was hidden [-Woverloaded-virtual=] 106 | virtual bool operator!=(const klass& rhs) const { return !(*this == rhs); }; \ | ^~~~~~~~ src/ast_selectors.hpp:56:5: note: in expansion of macro ‘ATTACH_VIRTUAL_CMP_OPERATIONS’ 56 | ATTACH_VIRTUAL_CMP_OPERATIONS(Selector) | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~ src/ast_def_macros.hpp:106:16: note: by ‘virtual bool Sass::SimpleSelector::operator!=(const Sass::SimpleSelector&) const’ 106 | virtual bool operator!=(const klass& rhs) const { return !(*this == rhs); }; \ | ^~~~~~~~ src/ast_selectors.hpp:139:5: note: in expansion of macro ‘ATTACH_VIRTUAL_CMP_OPERATIONS’ 139 | ATTACH_VIRTUAL_CMP_OPERATIONS(SimpleSelector); | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~ In file included from src/ast.hpp:1055: src/ast_selectors.hpp:137:18: warning: ‘virtual bool Sass::SimpleSelector::operator==(const Sass::CompoundSelector&) const’ was hidden [-Woverloaded-virtual=] 137 | virtual bool operator==(const CompoundSelector& rhs) const; | ^~~~~~~~ src/ast_def_macros.hpp:109:16: note: by ‘Sass::PlaceholderSelector::operator==’ 109 | virtual bool operator==(const klass& rhs) const; \ | ^~~~~~~~ src/ast_selectors.hpp:157:5: note: in expansion of macro ‘ATTACH_CMP_OPERATIONS’ 157 | ATTACH_CMP_OPERATIONS(PlaceholderSelector) | ^~~~~~~~~~~~~~~~~~~~~ src/ast_selectors.hpp:136:18: warning: ‘virtual bool Sass::SimpleSelector::operator==(const Sass::ComplexSelector&) const’ was hidden [-Woverloaded-virtual=] 136 | virtual bool operator==(const ComplexSelector& rhs) const; | ^~~~~~~~ src/ast_def_macros.hpp:109:16: note: by ‘Sass::PlaceholderSelector::operator==’ 109 | virtual bool operator==(const klass& rhs) const; \ | ^~~~~~~~ src/ast_selectors.hpp:157:5: note: in expansion of macro ‘ATTACH_CMP_OPERATIONS’ 157 | ATTACH_CMP_OPERATIONS(PlaceholderSelector) | ^~~~~~~~~~~~~~~~~~~~~ src/ast_selectors.hpp:135:18: warning: ‘virtual bool Sass::SimpleSelector::operator==(const Sass::SelectorList&) const’ was hidden [-Woverloaded-virtual=] 135 | virtual bool operator==(const SelectorList& rhs) const; | ^~~~~~~~ src/ast_def_macros.hpp:109:16: note: by ‘Sass::PlaceholderSelector::operator==’ 109 | virtual bool operator==(const klass& rhs) const; \ | ^~~~~~~~ src/ast_selectors.hpp:157:5: note: in expansion of macro ‘ATTACH_CMP_OPERATIONS’ 157 | ATTACH_CMP_OPERATIONS(PlaceholderSelector) | ^~~~~~~~~~~~~~~~~~~~~ src/ast_selectors.hpp:133:10: warning: ‘virtual bool Sass::SimpleSelector::operator==(const Sass::Selector&) const’ was hidden [-Woverloaded-virtual=] 133 | bool operator==(const Selector& rhs) const final override; | ^~~~~~~~ src/ast_def_macros.hpp:109:16: note: by ‘Sass::PlaceholderSelector::operator==’ 109 | virtual bool operator==(const klass& rhs) const; \ | ^~~~~~~~ src/ast_selectors.hpp:157:5: note: in expansion of macro ‘ATTACH_CMP_OPERATIONS’ 157 | ATTACH_CMP_OPERATIONS(PlaceholderSelector) | ^~~~~~~~~~~~~~~~~~~~~ src/ast_def_macros.hpp:106:16: warning: ‘virtual bool Sass::SimpleSelector::operator!=(const Sass::SimpleSelector&) const’ was hidden [-Woverloaded-virtual=] 106 | virtual bool operator!=(const klass& rhs) const { return !(*this == rhs); }; \ | ^~~~~~~~ src/ast_selectors.hpp:139:5: note: in expansion of macro ‘ATTACH_VIRTUAL_CMP_OPERATIONS’ 139 | ATTACH_VIRTUAL_CMP_OPERATIONS(SimpleSelector); | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~ src/ast_def_macros.hpp:110:16: note: by ‘virtual bool Sass::PlaceholderSelector::operator!=(const Sass::PlaceholderSelector&) const’ 110 | virtual bool operator!=(const klass& rhs) const { return !(*this == rhs); }; \ | ^~~~~~~~ src/ast_selectors.hpp:157:5: note: in expansion of macro ‘ATTACH_CMP_OPERATIONS’ 157 | ATTACH_CMP_OPERATIONS(PlaceholderSelector) | ^~~~~~~~~~~~~~~~~~~~~ src/ast_selectors.hpp:137:18: warning: ‘virtual bool Sass::SimpleSelector::operator==(const Sass::CompoundSelector&) const’ was hidden [-Woverloaded-virtual=] 137 | virtual bool operator==(const CompoundSelector& rhs) const; | ^~~~~~~~ src/ast_def_macros.hpp:109:16: note: by ‘Sass::TypeSelector::operator==’ 109 | virtual bool operator==(const klass& rhs) const; \ | ^~~~~~~~ src/ast_selectors.hpp:174:5: note: in expansion of macro ‘ATTACH_CMP_OPERATIONS’ 174 | ATTACH_CMP_OPERATIONS(TypeSelector) | ^~~~~~~~~~~~~~~~~~~~~ src/ast_selectors.hpp:136:18: warning: ‘virtual bool Sass::SimpleSelector::operator==(const Sass::ComplexSelector&) const’ was hidden [-Woverloaded-virtual=] 136 | virtual bool operator==(const ComplexSelector& rhs) const; | ^~~~~~~~ src/ast_def_macros.hpp:109:16: note: by ‘Sass::TypeSelector::operator==’ 109 | virtual bool operator==(const klass& rhs) const; \ | ^~~~~~~~ src/ast_selectors.hpp:174:5: note: in expansion of macro ‘ATTACH_CMP_OPERATIONS’ 174 | ATTACH_CMP_OPERATIONS(TypeSelector) | ^~~~~~~~~~~~~~~~~~~~~ src/ast_selectors.hpp:135:18: warning: ‘virtual bool Sass::SimpleSelector::operator==(const Sass::SelectorList&) const’ was hidden [-Woverloaded-virtual=] 135 | virtual bool operator==(const SelectorList& rhs) const; | ^~~~~~~~ src/ast_def_macros.hpp:109:16: note: by ‘Sass::TypeSelector::operator==’ 109 | virtual bool operator==(const klass& rhs) const; \ | ^~~~~~~~ src/ast_selectors.hpp:174:5: note: in expansion of macro ‘ATTACH_CMP_OPERATIONS’ 174 | ATTACH_CMP_OPERATIONS(TypeSelector) | ^~~~~~~~~~~~~~~~~~~~~ src/ast_selectors.hpp:133:10: warning: ‘virtual bool Sass::SimpleSelector::operator==(const Sass::Selector&) const’ was hidden [-Woverloaded-virtual=] 133 | bool operator==(const Selector& rhs) const final override; | ^~~~~~~~ src/ast_def_macros.hpp:109:16: note: by ‘Sass::TypeSelector::operator==’ 109 | virtual bool operator==(const klass& rhs) const; \ | ^~~~~~~~ src/ast_selectors.hpp:174:5: note: in expansion of macro ‘ATTACH_CMP_OPERATIONS’ 174 | ATTACH_CMP_OPERATIONS(TypeSelector) | ^~~~~~~~~~~~~~~~~~~~~ src/ast_def_macros.hpp:106:16: warning: ‘virtual bool Sass::SimpleSelector::operator!=(const Sass::SimpleSelector&) const’ was hidden [-Woverloaded-virtual=] 106 | virtual bool operator!=(const klass& rhs) const { return !(*this == rhs); }; \ | ^~~~~~~~ src/ast_selectors.hpp:139:5: note: in expansion of macro ‘ATTACH_VIRTUAL_CMP_OPERATIONS’ 139 | ATTACH_VIRTUAL_CMP_OPERATIONS(SimpleSelector); | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~ src/ast_def_macros.hpp:110:16: note: by ‘virtual bool Sass::TypeSelector::operator!=(const Sass::TypeSelector&) const’ 110 | virtual bool operator!=(const klass& rhs) const { return !(*this == rhs); }; \ | ^~~~~~~~ src/ast_selectors.hpp:174:5: note: in expansion of macro ‘ATTACH_CMP_OPERATIONS’ 174 | ATTACH_CMP_OPERATIONS(TypeSelector) | ^~~~~~~~~~~~~~~~~~~~~ src/ast_selectors.hpp:137:18: warning: ‘virtual bool Sass::SimpleSelector::operator==(const Sass::CompoundSelector&) const’ was hidden [-Woverloaded-virtual=] 137 | virtual bool operator==(const CompoundSelector& rhs) const; | ^~~~~~~~ src/ast_def_macros.hpp:109:16: note: by ‘Sass::ClassSelector::operator==’ 109 | virtual bool operator==(const klass& rhs) const; \ | ^~~~~~~~ src/ast_selectors.hpp:188:5: note: in expansion of macro ‘ATTACH_CMP_OPERATIONS’ 188 | ATTACH_CMP_OPERATIONS(ClassSelector) | ^~~~~~~~~~~~~~~~~~~~~ src/ast_selectors.hpp:136:18: warning: ‘virtual bool Sass::SimpleSelector::operator==(const Sass::ComplexSelector&) const’ was hidden [-Woverloaded-virtual=] 136 | virtual bool operator==(const ComplexSelector& rhs) const; | ^~~~~~~~ src/ast_def_macros.hpp:109:16: note: by ‘Sass::ClassSelector::operator==’ 109 | virtual bool operator==(const klass& rhs) const; \ | ^~~~~~~~ src/ast_selectors.hpp:188:5: note: in expansion of macro ‘ATTACH_CMP_OPERATIONS’ 188 | ATTACH_CMP_OPERATIONS(ClassSelector) | ^~~~~~~~~~~~~~~~~~~~~ src/ast_selectors.hpp:135:18: warning: ‘virtual bool Sass::SimpleSelector::operator==(const Sass::SelectorList&) const’ was hidden [-Woverloaded-virtual=] 135 | virtual bool operator==(const SelectorList& rhs) const; | ^~~~~~~~ src/ast_def_macros.hpp:109:16: note: by ‘Sass::ClassSelector::operator==’ 109 | virtual bool operator==(const klass& rhs) const; \ | ^~~~~~~~ src/ast_selectors.hpp:188:5: note: in expansion of macro ‘ATTACH_CMP_OPERATIONS’ 188 | ATTACH_CMP_OPERATIONS(ClassSelector) | ^~~~~~~~~~~~~~~~~~~~~ src/ast_selectors.hpp:133:10: warning: ‘virtual bool Sass::SimpleSelector::operator==(const Sass::Selector&) const’ was hidden [-Woverloaded-virtual=] 133 | bool operator==(const Selector& rhs) const final override; | ^~~~~~~~ src/ast_def_macros.hpp:109:16: note: by ‘Sass::ClassSelector::operator==’ 109 | virtual bool operator==(const klass& rhs) const; \ | ^~~~~~~~ src/ast_selectors.hpp:188:5: note: in expansion of macro ‘ATTACH_CMP_OPERATIONS’ 188 | ATTACH_CMP_OPERATIONS(ClassSelector) | ^~~~~~~~~~~~~~~~~~~~~ src/ast_def_macros.hpp:106:16: warning: ‘virtual bool Sass::SimpleSelector::operator!=(const Sass::SimpleSelector&) const’ was hidden [-Woverloaded-virtual=] 106 | virtual bool operator!=(const klass& rhs) const { return !(*this == rhs); }; \ | ^~~~~~~~ src/ast_selectors.hpp:139:5: note: in expansion of macro ‘ATTACH_VIRTUAL_CMP_OPERATIONS’ 139 | ATTACH_VIRTUAL_CMP_OPERATIONS(SimpleSelector); | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~ src/ast_def_macros.hpp:110:16: note: by ‘virtual bool Sass::ClassSelector::operator!=(const Sass::ClassSelector&) const’ 110 | virtual bool operator!=(const klass& rhs) const { return !(*this == rhs); }; \ | ^~~~~~~~ src/ast_selectors.hpp:188:5: note: in expansion of macro ‘ATTACH_CMP_OPERATIONS’ 188 | ATTACH_CMP_OPERATIONS(ClassSelector) | ^~~~~~~~~~~~~~~~~~~~~ src/ast_selectors.hpp:137:18: warning: ‘virtual bool Sass::SimpleSelector::operator==(const Sass::CompoundSelector&) const’ was hidden [-Woverloaded-virtual=] 137 | virtual bool operator==(const CompoundSelector& rhs) const; | ^~~~~~~~ src/ast_def_macros.hpp:109:16: note: by ‘Sass::IDSelector::operator==’ 109 | virtual bool operator==(const klass& rhs) const; \ | ^~~~~~~~ src/ast_selectors.hpp:204:5: note: in expansion of macro ‘ATTACH_CMP_OPERATIONS’ 204 | ATTACH_CMP_OPERATIONS(IDSelector) | ^~~~~~~~~~~~~~~~~~~~~ src/ast_selectors.hpp:136:18: warning: ‘virtual bool Sass::SimpleSelector::operator==(const Sass::ComplexSelector&) const’ was hidden [-Woverloaded-virtual=] 136 | virtual bool operator==(const ComplexSelector& rhs) const; | ^~~~~~~~ src/ast_def_macros.hpp:109:16: note: by ‘Sass::IDSelector::operator==’ 109 | virtual bool operator==(const klass& rhs) const; \ | ^~~~~~~~ src/ast_selectors.hpp:204:5: note: in expansion of macro ‘ATTACH_CMP_OPERATIONS’ 204 | ATTACH_CMP_OPERATIONS(IDSelector) | ^~~~~~~~~~~~~~~~~~~~~ src/ast_selectors.hpp:135:18: warning: ‘virtual bool Sass::SimpleSelector::operator==(const Sass::SelectorList&) const’ was hidden [-Woverloaded-virtual=] 135 | virtual bool operator==(const SelectorList& rhs) const; | ^~~~~~~~ src/ast_def_macros.hpp:109:16: note: by ‘Sass::IDSelector::operator==’ 109 | virtual bool operator==(const klass& rhs) const; \ | ^~~~~~~~ src/ast_selectors.hpp:204:5: note: in expansion of macro ‘ATTACH_CMP_OPERATIONS’ 204 | ATTACH_CMP_OPERATIONS(IDSelector) | ^~~~~~~~~~~~~~~~~~~~~ src/ast_selectors.hpp:133:10: warning: ‘virtual bool Sass::SimpleSelector::operator==(const Sass::Selector&) const’ was hidden [-Woverloaded-virtual=] 133 | bool operator==(const Selector& rhs) const final override; | ^~~~~~~~ src/ast_def_macros.hpp:109:16: note: by ‘Sass::IDSelector::operator==’ 109 | virtual bool operator==(const klass& rhs) const; \ | ^~~~~~~~ src/ast_selectors.hpp:204:5: note: in expansion of macro ‘ATTACH_CMP_OPERATIONS’ 204 | ATTACH_CMP_OPERATIONS(IDSelector) | ^~~~~~~~~~~~~~~~~~~~~ src/ast_def_macros.hpp:106:16: warning: ‘virtual bool Sass::SimpleSelector::operator!=(const Sass::SimpleSelector&) const’ was hidden [-Woverloaded-virtual=] 106 | virtual bool operator!=(const klass& rhs) const { return !(*this == rhs); }; \ | ^~~~~~~~ src/ast_selectors.hpp:139:5: note: in expansion of macro ‘ATTACH_VIRTUAL_CMP_OPERATIONS’ 139 | ATTACH_VIRTUAL_CMP_OPERATIONS(SimpleSelector); | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~ src/ast_def_macros.hpp:110:16: note: by ‘virtual bool Sass::IDSelector::operator!=(const Sass::IDSelector&) const’ 110 | virtual bool operator!=(const klass& rhs) const { return !(*this == rhs); }; \ | ^~~~~~~~ src/ast_selectors.hpp:204:5: note: in expansion of macro ‘ATTACH_CMP_OPERATIONS’ 204 | ATTACH_CMP_OPERATIONS(IDSelector) | ^~~~~~~~~~~~~~~~~~~~~ src/ast_selectors.hpp:137:18: warning: ‘virtual bool Sass::SimpleSelector::operator==(const Sass::CompoundSelector&) const’ was hidden [-Woverloaded-virtual=] 137 | virtual bool operator==(const CompoundSelector& rhs) const; | ^~~~~~~~ src/ast_def_macros.hpp:109:16: note: by ‘Sass::AttributeSelector::operator==’ 109 | virtual bool operator==(const klass& rhs) const; \ | ^~~~~~~~ src/ast_selectors.hpp:223:5: note: in expansion of macro ‘ATTACH_CMP_OPERATIONS’ 223 | ATTACH_CMP_OPERATIONS(AttributeSelector) | ^~~~~~~~~~~~~~~~~~~~~ src/ast_selectors.hpp:136:18: warning: ‘virtual bool Sass::SimpleSelector::operator==(const Sass::ComplexSelector&) const’ was hidden [-Woverloaded-virtual=] 136 | virtual bool operator==(const ComplexSelector& rhs) const; | ^~~~~~~~ src/ast_def_macros.hpp:109:16: note: by ‘Sass::AttributeSelector::operator==’ 109 | virtual bool operator==(const klass& rhs) const; \ | ^~~~~~~~ src/ast_selectors.hpp:223:5: note: in expansion of macro ‘ATTACH_CMP_OPERATIONS’ 223 | ATTACH_CMP_OPERATIONS(AttributeSelector) | ^~~~~~~~~~~~~~~~~~~~~ src/ast_selectors.hpp:135:18: warning: ‘virtual bool Sass::SimpleSelector::operator==(const Sass::SelectorList&) const’ was hidden [-Woverloaded-virtual=] 135 | virtual bool operator==(const SelectorList& rhs) const; | ^~~~~~~~ src/ast_def_macros.hpp:109:16: note: by ‘Sass::AttributeSelector::operator==’ 109 | virtual bool operator==(const klass& rhs) const; \ | ^~~~~~~~ src/ast_selectors.hpp:223:5: note: in expansion of macro ‘ATTACH_CMP_OPERATIONS’ 223 | ATTACH_CMP_OPERATIONS(AttributeSelector) | ^~~~~~~~~~~~~~~~~~~~~ src/ast_selectors.hpp:133:10: warning: ‘virtual bool Sass::SimpleSelector::operator==(const Sass::Selector&) const’ was hidden [-Woverloaded-virtual=] 133 | bool operator==(const Selector& rhs) const final override; | ^~~~~~~~ src/ast_def_macros.hpp:109:16: note: by ‘Sass::AttributeSelector::operator==’ 109 | virtual bool operator==(const klass& rhs) const; \ | ^~~~~~~~ src/ast_selectors.hpp:223:5: note: in expansion of macro ‘ATTACH_CMP_OPERATIONS’ 223 | ATTACH_CMP_OPERATIONS(AttributeSelector) | ^~~~~~~~~~~~~~~~~~~~~ src/ast_def_macros.hpp:106:16: warning: ‘virtual bool Sass::SimpleSelector::operator!=(const Sass::SimpleSelector&) const’ was hidden [-Woverloaded-virtual=] 106 | virtual bool operator!=(const klass& rhs) const { return !(*this == rhs); }; \ | ^~~~~~~~ src/ast_selectors.hpp:139:5: note: in expansion of macro ‘ATTACH_VIRTUAL_CMP_OPERATIONS’ 139 | ATTACH_VIRTUAL_CMP_OPERATIONS(SimpleSelector); | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~ src/ast_def_macros.hpp:110:16: note: by ‘virtual bool Sass::AttributeSelector::operator!=(const Sass::AttributeSelector&) const’ 110 | virtual bool operator!=(const klass& rhs) const { return !(*this == rhs); }; \ | ^~~~~~~~ src/ast_selectors.hpp:223:5: note: in expansion of macro ‘ATTACH_CMP_OPERATIONS’ 223 | ATTACH_CMP_OPERATIONS(AttributeSelector) | ^~~~~~~~~~~~~~~~~~~~~ src/ast_def_macros.hpp:106:16: warning: ‘virtual bool Sass::Selector::operator!=(const Sass::Selector&) const’ was hidden [-Woverloaded-virtual=] 106 | virtual bool operator!=(const klass& rhs) const { return !(*this == rhs); }; \ | ^~~~~~~~ src/ast_selectors.hpp:56:5: note: in expansion of macro ‘ATTACH_VIRTUAL_CMP_OPERATIONS’ 56 | ATTACH_VIRTUAL_CMP_OPERATIONS(Selector) | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~ src/ast_def_macros.hpp:110:16: note: by ‘virtual bool Sass::ComplexSelector::operator!=(const Sass::ComplexSelector&) const’ 110 | virtual bool operator!=(const klass& rhs) const { return !(*this == rhs); }; \ | ^~~~~~~~ src/ast_selectors.hpp:310:5: note: in expansion of macro ‘ATTACH_CMP_OPERATIONS’ 310 | ATTACH_CMP_OPERATIONS(ComplexSelector) | ^~~~~~~~~~~~~~~~~~~~~ src/ast_def_macros.hpp:106:16: warning: ‘virtual bool Sass::Selector::operator!=(const Sass::Selector&) const’ was hidden [-Woverloaded-virtual=] 106 | virtual bool operator!=(const klass& rhs) const { return !(*this == rhs); }; \ | ^~~~~~~~ src/ast_selectors.hpp:56:5: note: in expansion of macro ‘ATTACH_VIRTUAL_CMP_OPERATIONS’ 56 | ATTACH_VIRTUAL_CMP_OPERATIONS(Selector) | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~ src/ast_def_macros.hpp:106:16: note: by ‘virtual bool Sass::SelectorComponent::operator!=(const Sass::SelectorComponent&) const’ 106 | virtual bool operator!=(const klass& rhs) const { return !(*this == rhs); }; \ | ^~~~~~~~ src/ast_selectors.hpp:349:5: note: in expansion of macro ‘ATTACH_VIRTUAL_CMP_OPERATIONS’ 349 | ATTACH_VIRTUAL_CMP_OPERATIONS(SelectorComponent); | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~ src/ast_def_macros.hpp:106:16: warning: ‘virtual bool Sass::SelectorComponent::operator!=(const Sass::SelectorComponent&) const’ was hidden [-Woverloaded-virtual=] 106 | virtual bool operator!=(const klass& rhs) const { return !(*this == rhs); }; \ | ^~~~~~~~ src/ast_selectors.hpp:349:5: note: in expansion of macro ‘ATTACH_VIRTUAL_CMP_OPERATIONS’ 349 | ATTACH_VIRTUAL_CMP_OPERATIONS(SelectorComponent); | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~ src/ast_def_macros.hpp:110:16: note: by ‘virtual bool Sass::SelectorCombinator::operator!=(const Sass::SelectorCombinator&) const’ 110 | virtual bool operator!=(const klass& rhs) const { return !(*this == rhs); }; \ | ^~~~~~~~ src/ast_selectors.hpp:407:5: note: in expansion of macro ‘ATTACH_CMP_OPERATIONS’ 407 | ATTACH_CMP_OPERATIONS(SelectorCombinator) | ^~~~~~~~~~~~~~~~~~~~~ g++ -std=gnu++17 -Wall -O2 -std=c++11 -I ./include -fPIC -c -o src/context.o src/context.cpp In file included from src/context.cpp:4: src/ast.hpp:90:18: warning: ‘virtual bool Sass::AST_Node::operator==(const Sass::AST_Node&) const’ was hidden [-Woverloaded-virtual=] 90 | virtual bool operator== (const AST_Node& rhs) const { | ^~~~~~~~ src/ast.hpp:165:18: note: by ‘virtual bool Sass::Expression::operator==(const Sass::Expression&) const’ 165 | virtual bool operator== (const Expression& rhs) const { return false; } | ^~~~~~~~ src/ast.hpp:96:18: warning: ‘virtual bool Sass::AST_Node::operator!=(const Sass::AST_Node&) const’ was hidden [-Woverloaded-virtual=] 96 | virtual bool operator!= (const AST_Node& rhs) const { | ^~~~~~~~ src/ast.hpp:167:17: note: by ‘bool Sass::Expression::operator!=(const Sass::Expression&) const’ 167 | inline bool operator!=(const Expression& rhs) const { return !(rhs == *this); } | ^~~~~~~~ src/ast.hpp:90:18: warning: ‘virtual bool Sass::AST_Node::operator==(const Sass::AST_Node&) const’ was hidden [-Woverloaded-virtual=] 90 | virtual bool operator== (const AST_Node& rhs) const { | ^~~~~~~~ src/ast.hpp:908:10: note: by ‘bool Sass::CssMediaRule::operator==(const Sass::CssMediaRule&) const’ 908 | bool operator== (const CssMediaRule& rhs) const { | ^~~~~~~~ src/ast.hpp:96:18: warning: ‘virtual bool Sass::AST_Node::operator!=(const Sass::AST_Node&) const’ was hidden [-Woverloaded-virtual=] 96 | virtual bool operator!= (const AST_Node& rhs) const { | ^~~~~~~~ src/ast.hpp:911:10: note: by ‘bool Sass::CssMediaRule::operator!=(const Sass::CssMediaRule&) const’ 911 | bool operator!=(const CssMediaRule& rhs) const { | ^~~~~~~~ src/ast.hpp:90:18: warning: ‘virtual bool Sass::AST_Node::operator==(const Sass::AST_Node&) const’ was hidden [-Woverloaded-virtual=] 90 | virtual bool operator== (const AST_Node& rhs) const { | ^~~~~~~~ src/ast.hpp:939:10: note: by ‘bool Sass::CssMediaQuery::operator==(const Sass::CssMediaQuery&) const’ 939 | bool operator== (const CssMediaQuery& rhs) const; | ^~~~~~~~ src/ast.hpp:96:18: warning: ‘virtual bool Sass::AST_Node::operator!=(const Sass::AST_Node&) const’ was hidden [-Woverloaded-virtual=] 96 | virtual bool operator!= (const AST_Node& rhs) const { | ^~~~~~~~ src/ast.hpp:940:10: note: by ‘bool Sass::CssMediaQuery::operator!=(const Sass::CssMediaQuery&) const’ 940 | bool operator!=(const CssMediaQuery& rhs) const { | ^~~~~~~~ src/ast.hpp:165:18: warning: ‘virtual bool Sass::Expression::operator==(const Sass::Expression&) const’ was hidden [-Woverloaded-virtual=] 165 | virtual bool operator== (const Expression& rhs) const { return false; } | ^~~~~~~~ In file included from src/ast.hpp:14: src/ast_def_macros.hpp:105:16: note: by ‘virtual bool Sass::Selector::operator==(const Sass::Selector&) const’ 105 | virtual bool operator==(const klass& rhs) const = 0; \ | ^~~~~~~~ src/ast_selectors.hpp:56:5: note: in expansion of macro ‘ATTACH_VIRTUAL_CMP_OPERATIONS’ 56 | ATTACH_VIRTUAL_CMP_OPERATIONS(Selector) | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~ src/ast.hpp:96:18: warning: ‘virtual bool Sass::AST_Node::operator!=(const Sass::AST_Node&) const’ was hidden [-Woverloaded-virtual=] 96 | virtual bool operator!= (const AST_Node& rhs) const { | ^~~~~~~~ src/ast_def_macros.hpp:106:16: note: by ‘virtual bool Sass::Selector::operator!=(const Sass::Selector&) const’ 106 | virtual bool operator!=(const klass& rhs) const { return !(*this == rhs); }; \ | ^~~~~~~~ src/ast_selectors.hpp:56:5: note: in expansion of macro ‘ATTACH_VIRTUAL_CMP_OPERATIONS’ 56 | ATTACH_VIRTUAL_CMP_OPERATIONS(Selector) | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~ src/ast_def_macros.hpp:106:16: warning: ‘virtual bool Sass::Selector::operator!=(const Sass::Selector&) const’ was hidden [-Woverloaded-virtual=] 106 | virtual bool operator!=(const klass& rhs) const { return !(*this == rhs); }; \ | ^~~~~~~~ src/ast_selectors.hpp:56:5: note: in expansion of macro ‘ATTACH_VIRTUAL_CMP_OPERATIONS’ 56 | ATTACH_VIRTUAL_CMP_OPERATIONS(Selector) | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~ src/ast_def_macros.hpp:106:16: note: by ‘virtual bool Sass::SimpleSelector::operator!=(const Sass::SimpleSelector&) const’ 106 | virtual bool operator!=(const klass& rhs) const { return !(*this == rhs); }; \ | ^~~~~~~~ src/ast_selectors.hpp:139:5: note: in expansion of macro ‘ATTACH_VIRTUAL_CMP_OPERATIONS’ 139 | ATTACH_VIRTUAL_CMP_OPERATIONS(SimpleSelector); | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~ In file included from src/ast.hpp:1055: src/ast_selectors.hpp:137:18: warning: ‘virtual bool Sass::SimpleSelector::operator==(const Sass::CompoundSelector&) const’ was hidden [-Woverloaded-virtual=] 137 | virtual bool operator==(const CompoundSelector& rhs) const; | ^~~~~~~~ src/ast_def_macros.hpp:109:16: note: by ‘Sass::PlaceholderSelector::operator==’ 109 | virtual bool operator==(const klass& rhs) const; \ | ^~~~~~~~ src/ast_selectors.hpp:157:5: note: in expansion of macro ‘ATTACH_CMP_OPERATIONS’ 157 | ATTACH_CMP_OPERATIONS(PlaceholderSelector) | ^~~~~~~~~~~~~~~~~~~~~ src/ast_selectors.hpp:136:18: warning: ‘virtual bool Sass::SimpleSelector::operator==(const Sass::ComplexSelector&) const’ was hidden [-Woverloaded-virtual=] 136 | virtual bool operator==(const ComplexSelector& rhs) const; | ^~~~~~~~ src/ast_def_macros.hpp:109:16: note: by ‘Sass::PlaceholderSelector::operator==’ 109 | virtual bool operator==(const klass& rhs) const; \ | ^~~~~~~~ src/ast_selectors.hpp:157:5: note: in expansion of macro ‘ATTACH_CMP_OPERATIONS’ 157 | ATTACH_CMP_OPERATIONS(PlaceholderSelector) | ^~~~~~~~~~~~~~~~~~~~~ src/ast_selectors.hpp:135:18: warning: ‘virtual bool Sass::SimpleSelector::operator==(const Sass::SelectorList&) const’ was hidden [-Woverloaded-virtual=] 135 | virtual bool operator==(const SelectorList& rhs) const; | ^~~~~~~~ src/ast_def_macros.hpp:109:16: note: by ‘Sass::PlaceholderSelector::operator==’ 109 | virtual bool operator==(const klass& rhs) const; \ | ^~~~~~~~ src/ast_selectors.hpp:157:5: note: in expansion of macro ‘ATTACH_CMP_OPERATIONS’ 157 | ATTACH_CMP_OPERATIONS(PlaceholderSelector) | ^~~~~~~~~~~~~~~~~~~~~ src/ast_selectors.hpp:133:10: warning: ‘virtual bool Sass::SimpleSelector::operator==(const Sass::Selector&) const’ was hidden [-Woverloaded-virtual=] 133 | bool operator==(const Selector& rhs) const final override; | ^~~~~~~~ src/ast_def_macros.hpp:109:16: note: by ‘Sass::PlaceholderSelector::operator==’ 109 | virtual bool operator==(const klass& rhs) const; \ | ^~~~~~~~ src/ast_selectors.hpp:157:5: note: in expansion of macro ‘ATTACH_CMP_OPERATIONS’ 157 | ATTACH_CMP_OPERATIONS(PlaceholderSelector) | ^~~~~~~~~~~~~~~~~~~~~ src/ast_def_macros.hpp:106:16: warning: ‘virtual bool Sass::SimpleSelector::operator!=(const Sass::SimpleSelector&) const’ was hidden [-Woverloaded-virtual=] 106 | virtual bool operator!=(const klass& rhs) const { return !(*this == rhs); }; \ | ^~~~~~~~ src/ast_selectors.hpp:139:5: note: in expansion of macro ‘ATTACH_VIRTUAL_CMP_OPERATIONS’ 139 | ATTACH_VIRTUAL_CMP_OPERATIONS(SimpleSelector); | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~ src/ast_def_macros.hpp:110:16: note: by ‘virtual bool Sass::PlaceholderSelector::operator!=(const Sass::PlaceholderSelector&) const’ 110 | virtual bool operator!=(const klass& rhs) const { return !(*this == rhs); }; \ | ^~~~~~~~ src/ast_selectors.hpp:157:5: note: in expansion of macro ‘ATTACH_CMP_OPERATIONS’ 157 | ATTACH_CMP_OPERATIONS(PlaceholderSelector) | ^~~~~~~~~~~~~~~~~~~~~ src/ast_selectors.hpp:137:18: warning: ‘virtual bool Sass::SimpleSelector::operator==(const Sass::CompoundSelector&) const’ was hidden [-Woverloaded-virtual=] 137 | virtual bool operator==(const CompoundSelector& rhs) const; | ^~~~~~~~ src/ast_def_macros.hpp:109:16: note: by ‘Sass::TypeSelector::operator==’ 109 | virtual bool operator==(const klass& rhs) const; \ | ^~~~~~~~ src/ast_selectors.hpp:174:5: note: in expansion of macro ‘ATTACH_CMP_OPERATIONS’ 174 | ATTACH_CMP_OPERATIONS(TypeSelector) | ^~~~~~~~~~~~~~~~~~~~~ src/ast_selectors.hpp:136:18: warning: ‘virtual bool Sass::SimpleSelector::operator==(const Sass::ComplexSelector&) const’ was hidden [-Woverloaded-virtual=] 136 | virtual bool operator==(const ComplexSelector& rhs) const; | ^~~~~~~~ src/ast_def_macros.hpp:109:16: note: by ‘Sass::TypeSelector::operator==’ 109 | virtual bool operator==(const klass& rhs) const; \ | ^~~~~~~~ src/ast_selectors.hpp:174:5: note: in expansion of macro ‘ATTACH_CMP_OPERATIONS’ 174 | ATTACH_CMP_OPERATIONS(TypeSelector) | ^~~~~~~~~~~~~~~~~~~~~ src/ast_selectors.hpp:135:18: warning: ‘virtual bool Sass::SimpleSelector::operator==(const Sass::SelectorList&) const’ was hidden [-Woverloaded-virtual=] 135 | virtual bool operator==(const SelectorList& rhs) const; | ^~~~~~~~ src/ast_def_macros.hpp:109:16: note: by ‘Sass::TypeSelector::operator==’ 109 | virtual bool operator==(const klass& rhs) const; \ | ^~~~~~~~ src/ast_selectors.hpp:174:5: note: in expansion of macro ‘ATTACH_CMP_OPERATIONS’ 174 | ATTACH_CMP_OPERATIONS(TypeSelector) | ^~~~~~~~~~~~~~~~~~~~~ src/ast_selectors.hpp:133:10: warning: ‘virtual bool Sass::SimpleSelector::operator==(const Sass::Selector&) const’ was hidden [-Woverloaded-virtual=] 133 | bool operator==(const Selector& rhs) const final override; | ^~~~~~~~ src/ast_def_macros.hpp:109:16: note: by ‘Sass::TypeSelector::operator==’ 109 | virtual bool operator==(const klass& rhs) const; \ | ^~~~~~~~ src/ast_selectors.hpp:174:5: note: in expansion of macro ‘ATTACH_CMP_OPERATIONS’ 174 | ATTACH_CMP_OPERATIONS(TypeSelector) | ^~~~~~~~~~~~~~~~~~~~~ src/ast_def_macros.hpp:106:16: warning: ‘virtual bool Sass::SimpleSelector::operator!=(const Sass::SimpleSelector&) const’ was hidden [-Woverloaded-virtual=] 106 | virtual bool operator!=(const klass& rhs) const { return !(*this == rhs); }; \ | ^~~~~~~~ src/ast_selectors.hpp:139:5: note: in expansion of macro ‘ATTACH_VIRTUAL_CMP_OPERATIONS’ 139 | ATTACH_VIRTUAL_CMP_OPERATIONS(SimpleSelector); | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~ src/ast_def_macros.hpp:110:16: note: by ‘virtual bool Sass::TypeSelector::operator!=(const Sass::TypeSelector&) const’ 110 | virtual bool operator!=(const klass& rhs) const { return !(*this == rhs); }; \ | ^~~~~~~~ src/ast_selectors.hpp:174:5: note: in expansion of macro ‘ATTACH_CMP_OPERATIONS’ 174 | ATTACH_CMP_OPERATIONS(TypeSelector) | ^~~~~~~~~~~~~~~~~~~~~ src/ast_selectors.hpp:137:18: warning: ‘virtual bool Sass::SimpleSelector::operator==(const Sass::CompoundSelector&) const’ was hidden [-Woverloaded-virtual=] 137 | virtual bool operator==(const CompoundSelector& rhs) const; | ^~~~~~~~ src/ast_def_macros.hpp:109:16: note: by ‘Sass::ClassSelector::operator==’ 109 | virtual bool operator==(const klass& rhs) const; \ | ^~~~~~~~ src/ast_selectors.hpp:188:5: note: in expansion of macro ‘ATTACH_CMP_OPERATIONS’ 188 | ATTACH_CMP_OPERATIONS(ClassSelector) | ^~~~~~~~~~~~~~~~~~~~~ src/ast_selectors.hpp:136:18: warning: ‘virtual bool Sass::SimpleSelector::operator==(const Sass::ComplexSelector&) const’ was hidden [-Woverloaded-virtual=] 136 | virtual bool operator==(const ComplexSelector& rhs) const; | ^~~~~~~~ src/ast_def_macros.hpp:109:16: note: by ‘Sass::ClassSelector::operator==’ 109 | virtual bool operator==(const klass& rhs) const; \ | ^~~~~~~~ src/ast_selectors.hpp:188:5: note: in expansion of macro ‘ATTACH_CMP_OPERATIONS’ 188 | ATTACH_CMP_OPERATIONS(ClassSelector) | ^~~~~~~~~~~~~~~~~~~~~ src/ast_selectors.hpp:135:18: warning: ‘virtual bool Sass::SimpleSelector::operator==(const Sass::SelectorList&) const’ was hidden [-Woverloaded-virtual=] 135 | virtual bool operator==(const SelectorList& rhs) const; | ^~~~~~~~ src/ast_def_macros.hpp:109:16: note: by ‘Sass::ClassSelector::operator==’ 109 | virtual bool operator==(const klass& rhs) const; \ | ^~~~~~~~ src/ast_selectors.hpp:188:5: note: in expansion of macro ‘ATTACH_CMP_OPERATIONS’ 188 | ATTACH_CMP_OPERATIONS(ClassSelector) | ^~~~~~~~~~~~~~~~~~~~~ src/ast_selectors.hpp:133:10: warning: ‘virtual bool Sass::SimpleSelector::operator==(const Sass::Selector&) const’ was hidden [-Woverloaded-virtual=] 133 | bool operator==(const Selector& rhs) const final override; | ^~~~~~~~ src/ast_def_macros.hpp:109:16: note: by ‘Sass::ClassSelector::operator==’ 109 | virtual bool operator==(const klass& rhs) const; \ | ^~~~~~~~ src/ast_selectors.hpp:188:5: note: in expansion of macro ‘ATTACH_CMP_OPERATIONS’ 188 | ATTACH_CMP_OPERATIONS(ClassSelector) | ^~~~~~~~~~~~~~~~~~~~~ src/ast_def_macros.hpp:106:16: warning: ‘virtual bool Sass::SimpleSelector::operator!=(const Sass::SimpleSelector&) const’ was hidden [-Woverloaded-virtual=] 106 | virtual bool operator!=(const klass& rhs) const { return !(*this == rhs); }; \ | ^~~~~~~~ src/ast_selectors.hpp:139:5: note: in expansion of macro ‘ATTACH_VIRTUAL_CMP_OPERATIONS’ 139 | ATTACH_VIRTUAL_CMP_OPERATIONS(SimpleSelector); | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~ src/ast_def_macros.hpp:110:16: note: by ‘virtual bool Sass::ClassSelector::operator!=(const Sass::ClassSelector&) const’ 110 | virtual bool operator!=(const klass& rhs) const { return !(*this == rhs); }; \ | ^~~~~~~~ src/ast_selectors.hpp:188:5: note: in expansion of macro ‘ATTACH_CMP_OPERATIONS’ 188 | ATTACH_CMP_OPERATIONS(ClassSelector) | ^~~~~~~~~~~~~~~~~~~~~ src/ast_selectors.hpp:137:18: warning: ‘virtual bool Sass::SimpleSelector::operator==(const Sass::CompoundSelector&) const’ was hidden [-Woverloaded-virtual=] 137 | virtual bool operator==(const CompoundSelector& rhs) const; | ^~~~~~~~ src/ast_def_macros.hpp:109:16: note: by ‘Sass::IDSelector::operator==’ 109 | virtual bool operator==(const klass& rhs) const; \ | ^~~~~~~~ src/ast_selectors.hpp:204:5: note: in expansion of macro ‘ATTACH_CMP_OPERATIONS’ 204 | ATTACH_CMP_OPERATIONS(IDSelector) | ^~~~~~~~~~~~~~~~~~~~~ src/ast_selectors.hpp:136:18: warning: ‘virtual bool Sass::SimpleSelector::operator==(const Sass::ComplexSelector&) const’ was hidden [-Woverloaded-virtual=] 136 | virtual bool operator==(const ComplexSelector& rhs) const; | ^~~~~~~~ src/ast_def_macros.hpp:109:16: note: by ‘Sass::IDSelector::operator==’ 109 | virtual bool operator==(const klass& rhs) const; \ | ^~~~~~~~ src/ast_selectors.hpp:204:5: note: in expansion of macro ‘ATTACH_CMP_OPERATIONS’ 204 | ATTACH_CMP_OPERATIONS(IDSelector) | ^~~~~~~~~~~~~~~~~~~~~ src/ast_selectors.hpp:135:18: warning: ‘virtual bool Sass::SimpleSelector::operator==(const Sass::SelectorList&) const’ was hidden [-Woverloaded-virtual=] 135 | virtual bool operator==(const SelectorList& rhs) const; | ^~~~~~~~ src/ast_def_macros.hpp:109:16: note: by ‘Sass::IDSelector::operator==’ 109 | virtual bool operator==(const klass& rhs) const; \ | ^~~~~~~~ src/ast_selectors.hpp:204:5: note: in expansion of macro ‘ATTACH_CMP_OPERATIONS’ 204 | ATTACH_CMP_OPERATIONS(IDSelector) | ^~~~~~~~~~~~~~~~~~~~~ src/ast_selectors.hpp:133:10: warning: ‘virtual bool Sass::SimpleSelector::operator==(const Sass::Selector&) const’ was hidden [-Woverloaded-virtual=] 133 | bool operator==(const Selector& rhs) const final override; | ^~~~~~~~ src/ast_def_macros.hpp:109:16: note: by ‘Sass::IDSelector::operator==’ 109 | virtual bool operator==(const klass& rhs) const; \ | ^~~~~~~~ src/ast_selectors.hpp:204:5: note: in expansion of macro ‘ATTACH_CMP_OPERATIONS’ 204 | ATTACH_CMP_OPERATIONS(IDSelector) | ^~~~~~~~~~~~~~~~~~~~~ src/ast_def_macros.hpp:106:16: warning: ‘virtual bool Sass::SimpleSelector::operator!=(const Sass::SimpleSelector&) const’ was hidden [-Woverloaded-virtual=] 106 | virtual bool operator!=(const klass& rhs) const { return !(*this == rhs); }; \ | ^~~~~~~~ src/ast_selectors.hpp:139:5: note: in expansion of macro ‘ATTACH_VIRTUAL_CMP_OPERATIONS’ 139 | ATTACH_VIRTUAL_CMP_OPERATIONS(SimpleSelector); | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~ src/ast_def_macros.hpp:110:16: note: by ‘virtual bool Sass::IDSelector::operator!=(const Sass::IDSelector&) const’ 110 | virtual bool operator!=(const klass& rhs) const { return !(*this == rhs); }; \ | ^~~~~~~~ src/ast_selectors.hpp:204:5: note: in expansion of macro ‘ATTACH_CMP_OPERATIONS’ 204 | ATTACH_CMP_OPERATIONS(IDSelector) | ^~~~~~~~~~~~~~~~~~~~~ src/ast_selectors.hpp:137:18: warning: ‘virtual bool Sass::SimpleSelector::operator==(const Sass::CompoundSelector&) const’ was hidden [-Woverloaded-virtual=] 137 | virtual bool operator==(const CompoundSelector& rhs) const; | ^~~~~~~~ src/ast_def_macros.hpp:109:16: note: by ‘Sass::AttributeSelector::operator==’ 109 | virtual bool operator==(const klass& rhs) const; \ | ^~~~~~~~ src/ast_selectors.hpp:223:5: note: in expansion of macro ‘ATTACH_CMP_OPERATIONS’ 223 | ATTACH_CMP_OPERATIONS(AttributeSelector) | ^~~~~~~~~~~~~~~~~~~~~ src/ast_selectors.hpp:136:18: warning: ‘virtual bool Sass::SimpleSelector::operator==(const Sass::ComplexSelector&) const’ was hidden [-Woverloaded-virtual=] 136 | virtual bool operator==(const ComplexSelector& rhs) const; | ^~~~~~~~ src/ast_def_macros.hpp:109:16: note: by ‘Sass::AttributeSelector::operator==’ 109 | virtual bool operator==(const klass& rhs) const; \ | ^~~~~~~~ src/ast_selectors.hpp:223:5: note: in expansion of macro ‘ATTACH_CMP_OPERATIONS’ 223 | ATTACH_CMP_OPERATIONS(AttributeSelector) | ^~~~~~~~~~~~~~~~~~~~~ src/ast_selectors.hpp:135:18: warning: ‘virtual bool Sass::SimpleSelector::operator==(const Sass::SelectorList&) const’ was hidden [-Woverloaded-virtual=] 135 | virtual bool operator==(const SelectorList& rhs) const; | ^~~~~~~~ src/ast_def_macros.hpp:109:16: note: by ‘Sass::AttributeSelector::operator==’ 109 | virtual bool operator==(const klass& rhs) const; \ | ^~~~~~~~ src/ast_selectors.hpp:223:5: note: in expansion of macro ‘ATTACH_CMP_OPERATIONS’ 223 | ATTACH_CMP_OPERATIONS(AttributeSelector) | ^~~~~~~~~~~~~~~~~~~~~ src/ast_selectors.hpp:133:10: warning: ‘virtual bool Sass::SimpleSelector::operator==(const Sass::Selector&) const’ was hidden [-Woverloaded-virtual=] 133 | bool operator==(const Selector& rhs) const final override; | ^~~~~~~~ src/ast_def_macros.hpp:109:16: note: by ‘Sass::AttributeSelector::operator==’ 109 | virtual bool operator==(const klass& rhs) const; \ | ^~~~~~~~ src/ast_selectors.hpp:223:5: note: in expansion of macro ‘ATTACH_CMP_OPERATIONS’ 223 | ATTACH_CMP_OPERATIONS(AttributeSelector) | ^~~~~~~~~~~~~~~~~~~~~ src/ast_def_macros.hpp:106:16: warning: ‘virtual bool Sass::SimpleSelector::operator!=(const Sass::SimpleSelector&) const’ was hidden [-Woverloaded-virtual=] 106 | virtual bool operator!=(const klass& rhs) const { return !(*this == rhs); }; \ | ^~~~~~~~ src/ast_selectors.hpp:139:5: note: in expansion of macro ‘ATTACH_VIRTUAL_CMP_OPERATIONS’ 139 | ATTACH_VIRTUAL_CMP_OPERATIONS(SimpleSelector); | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~ src/ast_def_macros.hpp:110:16: note: by ‘virtual bool Sass::AttributeSelector::operator!=(const Sass::AttributeSelector&) const’ 110 | virtual bool operator!=(const klass& rhs) const { return !(*this == rhs); }; \ | ^~~~~~~~ src/ast_selectors.hpp:223:5: note: in expansion of macro ‘ATTACH_CMP_OPERATIONS’ 223 | ATTACH_CMP_OPERATIONS(AttributeSelector) | ^~~~~~~~~~~~~~~~~~~~~ src/ast_def_macros.hpp:106:16: warning: ‘virtual bool Sass::Selector::operator!=(const Sass::Selector&) const’ was hidden [-Woverloaded-virtual=] 106 | virtual bool operator!=(const klass& rhs) const { return !(*this == rhs); }; \ | ^~~~~~~~ src/ast_selectors.hpp:56:5: note: in expansion of macro ‘ATTACH_VIRTUAL_CMP_OPERATIONS’ 56 | ATTACH_VIRTUAL_CMP_OPERATIONS(Selector) | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~ src/ast_def_macros.hpp:110:16: note: by ‘virtual bool Sass::ComplexSelector::operator!=(const Sass::ComplexSelector&) const’ 110 | virtual bool operator!=(const klass& rhs) const { return !(*this == rhs); }; \ | ^~~~~~~~ src/ast_selectors.hpp:310:5: note: in expansion of macro ‘ATTACH_CMP_OPERATIONS’ 310 | ATTACH_CMP_OPERATIONS(ComplexSelector) | ^~~~~~~~~~~~~~~~~~~~~ src/ast_def_macros.hpp:106:16: warning: ‘virtual bool Sass::Selector::operator!=(const Sass::Selector&) const’ was hidden [-Woverloaded-virtual=] 106 | virtual bool operator!=(const klass& rhs) const { return !(*this == rhs); }; \ | ^~~~~~~~ src/ast_selectors.hpp:56:5: note: in expansion of macro ‘ATTACH_VIRTUAL_CMP_OPERATIONS’ 56 | ATTACH_VIRTUAL_CMP_OPERATIONS(Selector) | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~ src/ast_def_macros.hpp:106:16: note: by ‘virtual bool Sass::SelectorComponent::operator!=(const Sass::SelectorComponent&) const’ 106 | virtual bool operator!=(const klass& rhs) const { return !(*this == rhs); }; \ | ^~~~~~~~ src/ast_selectors.hpp:349:5: note: in expansion of macro ‘ATTACH_VIRTUAL_CMP_OPERATIONS’ 349 | ATTACH_VIRTUAL_CMP_OPERATIONS(SelectorComponent); | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~ src/ast_def_macros.hpp:106:16: warning: ‘virtual bool Sass::SelectorComponent::operator!=(const Sass::SelectorComponent&) const’ was hidden [-Woverloaded-virtual=] 106 | virtual bool operator!=(const klass& rhs) const { return !(*this == rhs); }; \ | ^~~~~~~~ src/ast_selectors.hpp:349:5: note: in expansion of macro ‘ATTACH_VIRTUAL_CMP_OPERATIONS’ 349 | ATTACH_VIRTUAL_CMP_OPERATIONS(SelectorComponent); | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~ src/ast_def_macros.hpp:110:16: note: by ‘virtual bool Sass::SelectorCombinator::operator!=(const Sass::SelectorCombinator&) const’ 110 | virtual bool operator!=(const klass& rhs) const { return !(*this == rhs); }; \ | ^~~~~~~~ src/ast_selectors.hpp:407:5: note: in expansion of macro ‘ATTACH_CMP_OPERATIONS’ 407 | ATTACH_CMP_OPERATIONS(SelectorCombinator) | ^~~~~~~~~~~~~~~~~~~~~ In file included from src/ast.hpp:18: src/operation.hpp:206:7: warning: ‘T Sass::Operation_CRTP::operator()(Sass::SelectorCombinator*) [with T = Sass::Expression*; D = Sass::Eval]’ was hidden [-Woverloaded-virtual=] 206 | T operator()(SelectorCombinator* x) { return static_cast(this)->fallback(x); } | ^~~~~~~~ In file included from src/expand.hpp:7, from src/context.cpp:17: src/eval.hpp:96:17: note: by ‘Sass::Eval::operator()’ 96 | Expression* operator()(Parent_Reference*); | ^~~~~~~~ src/operation.hpp:194:7: warning: ‘T Sass::Operation_CRTP::operator()(Sass::Parameters*) [with T = Sass::Expression*; D = Sass::Eval]’ was hidden [-Woverloaded-virtual=] 194 | T operator()(Parameters* x) { return static_cast(this)->fallback(x); } | ^~~~~~~~ src/eval.hpp:96:17: note: by ‘Sass::Eval::operator()’ 96 | Expression* operator()(Parent_Reference*); | ^~~~~~~~ src/operation.hpp:193:7: warning: ‘T Sass::Operation_CRTP::operator()(Sass::Parameter*) [with T = Sass::Expression*; D = Sass::Eval]’ was hidden [-Woverloaded-virtual=] 193 | T operator()(Parameter* x) { return static_cast(this)->fallback(x); } | ^~~~~~~~ src/eval.hpp:96:17: note: by ‘Sass::Eval::operator()’ 96 | Expression* operator()(Parent_Reference*); | ^~~~~~~~ src/operation.hpp:183:7: warning: ‘T Sass::Operation_CRTP::operator()(Sass::SupportsCondition*) [with T = Sass::Expression*; D = Sass::Eval]’ was hidden [-Woverloaded-virtual=] 183 | T operator()(SupportsCondition* x) { return static_cast(this)->fallback(x); } | ^~~~~~~~ src/eval.hpp:96:17: note: by ‘Sass::Eval::operator()’ 96 | Expression* operator()(Parent_Reference*); | ^~~~~~~~ src/operation.hpp:176:7: warning: ‘T Sass::Operation_CRTP::operator()(Sass::Color*) [with T = Sass::Expression*; D = Sass::Eval]’ was hidden [-Woverloaded-virtual=] 176 | T operator()(Color* x) { return static_cast(this)->fallback(x); } | ^~~~~~~~ src/eval.hpp:96:17: note: by ‘Sass::Eval::operator()’ 96 | Expression* operator()(Parent_Reference*); | ^~~~~~~~ src/operation.hpp:173:7: warning: ‘T Sass::Operation_CRTP::operator()(Sass::Custom_Error*) [with T = Sass::Expression*; D = Sass::Eval]’ was hidden [-Woverloaded-virtual=] 173 | T operator()(Custom_Error* x) { return static_cast(this)->fallback(x); } | ^~~~~~~~ src/eval.hpp:96:17: note: by ‘Sass::Eval::operator()’ 96 | Expression* operator()(Parent_Reference*); | ^~~~~~~~ src/operation.hpp:172:7: warning: ‘T Sass::Operation_CRTP::operator()(Sass::Custom_Warning*) [with T = Sass::Expression*; D = Sass::Eval]’ was hidden [-Woverloaded-virtual=] 172 | T operator()(Custom_Warning* x) { return static_cast(this)->fallback(x); } | ^~~~~~~~ src/eval.hpp:96:17: note: by ‘Sass::Eval::operator()’ 96 | Expression* operator()(Parent_Reference*); | ^~~~~~~~ src/operation.hpp:168:7: warning: ‘T Sass::Operation_CRTP::operator()(Sass::Function*) [with T = Sass::Expression*; D = Sass::Eval]’ was hidden [-Woverloaded-virtual=] 168 | T operator()(Function* x) { return static_cast(this)->fallback(x); } | ^~~~~~~~ src/eval.hpp:96:17: note: by ‘Sass::Eval::operator()’ 96 | Expression* operator()(Parent_Reference*); | ^~~~~~~~ src/operation.hpp:163:7: warning: ‘T Sass::Operation_CRTP::operator()(Sass::Mixin_Call*) [with T = Sass::Expression*; D = Sass::Eval]’ was hidden [-Woverloaded-virtual=] 163 | T operator()(Mixin_Call* x) { return static_cast(this)->fallback(x); } | ^~~~~~~~ src/eval.hpp:96:17: note: by ‘Sass::Eval::operator()’ 96 | Expression* operator()(Parent_Reference*); | ^~~~~~~~ src/operation.hpp:162:7: warning: ‘T Sass::Operation_CRTP::operator()(Sass::Definition*) [with T = Sass::Expression*; D = Sass::Eval]’ was hidden [-Woverloaded-virtual=] 162 | T operator()(Definition* x) { return static_cast(this)->fallback(x); } | ^~~~~~~~ src/eval.hpp:96:17: note: by ‘Sass::Eval::operator()’ 96 | Expression* operator()(Parent_Reference*); | ^~~~~~~~ src/operation.hpp:161:7: warning: ‘T Sass::Operation_CRTP::operator()(Sass::ExtendRule*) [with T = Sass::Expression*; D = Sass::Eval]’ was hidden [-Woverloaded-virtual=] 161 | T operator()(ExtendRule* x) { return static_cast(this)->fallback(x); } | ^~~~~~~~ src/eval.hpp:96:17: note: by ‘Sass::Eval::operator()’ 96 | Expression* operator()(Parent_Reference*); | ^~~~~~~~ src/operation.hpp:160:7: warning: ‘T Sass::Operation_CRTP::operator()(Sass::Content*) [with T = Sass::Expression*; D = Sass::Eval]’ was hidden [-Woverloaded-virtual=] 160 | T operator()(Content* x) { return static_cast(this)->fallback(x); } | ^~~~~~~~ src/eval.hpp:96:17: note: by ‘Sass::Eval::operator()’ 96 | Expression* operator()(Parent_Reference*); | ^~~~~~~~ src/operation.hpp:150:7: warning: ‘T Sass::Operation_CRTP::operator()(Sass::Import_Stub*) [with T = Sass::Expression*; D = Sass::Eval]’ was hidden [-Woverloaded-virtual=] 150 | T operator()(Import_Stub* x) { return static_cast(this)->fallback(x); } | ^~~~~~~~ src/eval.hpp:96:17: note: by ‘Sass::Eval::operator()’ 96 | Expression* operator()(Parent_Reference*); | ^~~~~~~~ src/operation.hpp:149:7: warning: ‘T Sass::Operation_CRTP::operator()(Sass::Import*) [with T = Sass::Expression*; D = Sass::Eval]’ was hidden [-Woverloaded-virtual=] 149 | T operator()(Import* x) { return static_cast(this)->fallback(x); } | ^~~~~~~~ src/eval.hpp:96:17: note: by ‘Sass::Eval::operator()’ 96 | Expression* operator()(Parent_Reference*); | ^~~~~~~~ src/operation.hpp:147:7: warning: ‘T Sass::Operation_CRTP::operator()(Sass::Declaration*) [with T = Sass::Expression*; D = Sass::Eval]’ was hidden [-Woverloaded-virtual=] 147 | T operator()(Declaration* x) { return static_cast(this)->fallback(x); } | ^~~~~~~~ src/eval.hpp:96:17: note: by ‘Sass::Eval::operator()’ 96 | Expression* operator()(Parent_Reference*); | ^~~~~~~~ src/operation.hpp:146:7: warning: ‘T Sass::Operation_CRTP::operator()(Sass::Keyframe_Rule*) [with T = Sass::Expression*; D = Sass::Eval]’ was hidden [-Woverloaded-virtual=] 146 | T operator()(Keyframe_Rule* x) { return static_cast(this)->fallback(x); } | ^~~~~~~~ src/eval.hpp:96:17: note: by ‘Sass::Eval::operator()’ 96 | Expression* operator()(Parent_Reference*); | ^~~~~~~~ src/operation.hpp:145:7: warning: ‘T Sass::Operation_CRTP::operator()(Sass::AtRule*) [with T = Sass::Expression*; D = Sass::Eval]’ was hidden [-Woverloaded-virtual=] 145 | T operator()(AtRule* x) { return static_cast(this)->fallback(x); } | ^~~~~~~~ src/eval.hpp:96:17: note: by ‘Sass::Eval::operator()’ 96 | Expression* operator()(Parent_Reference*); | ^~~~~~~~ src/operation.hpp:144:7: warning: ‘T Sass::Operation_CRTP::operator()(Sass::AtRootRule*) [with T = Sass::Expression*; D = Sass::Eval]’ was hidden [-Woverloaded-virtual=] 144 | T operator()(AtRootRule* x) { return static_cast(this)->fallback(x); } | ^~~~~~~~ src/eval.hpp:96:17: note: by ‘Sass::Eval::operator()’ 96 | Expression* operator()(Parent_Reference*); | ^~~~~~~~ src/operation.hpp:143:7: warning: ‘T Sass::Operation_CRTP::operator()(Sass::CssMediaQuery*) [with T = Sass::Expression*; D = Sass::Eval]’ was hidden [-Woverloaded-virtual=] 143 | T operator()(CssMediaQuery* x) { return static_cast(this)->fallback(x); } | ^~~~~~~~ src/eval.hpp:96:17: note: by ‘Sass::Eval::operator()’ 96 | Expression* operator()(Parent_Reference*); | ^~~~~~~~ src/operation.hpp:142:7: warning: ‘T Sass::Operation_CRTP::operator()(Sass::CssMediaRule*) [with T = Sass::Expression*; D = Sass::Eval]’ was hidden [-Woverloaded-virtual=] 142 | T operator()(CssMediaRule* x) { return static_cast(this)->fallback(x); } | ^~~~~~~~ src/eval.hpp:96:17: note: by ‘Sass::Eval::operator()’ 96 | Expression* operator()(Parent_Reference*); | ^~~~~~~~ src/operation.hpp:141:7: warning: ‘T Sass::Operation_CRTP::operator()(Sass::MediaRule*) [with T = Sass::Expression*; D = Sass::Eval]’ was hidden [-Woverloaded-virtual=] 141 | T operator()(MediaRule* x) { return static_cast(this)->fallback(x); } | ^~~~~~~~ src/eval.hpp:96:17: note: by ‘Sass::Eval::operator()’ 96 | Expression* operator()(Parent_Reference*); | ^~~~~~~~ src/operation.hpp:140:7: warning: ‘T Sass::Operation_CRTP::operator()(Sass::SupportsRule*) [with T = Sass::Expression*; D = Sass::Eval]’ was hidden [-Woverloaded-virtual=] 140 | T operator()(SupportsRule* x) { return static_cast(this)->fallback(x); } | ^~~~~~~~ src/eval.hpp:96:17: note: by ‘Sass::Eval::operator()’ 96 | Expression* operator()(Parent_Reference*); | ^~~~~~~~ src/operation.hpp:139:7: warning: ‘T Sass::Operation_CRTP::operator()(Sass::Trace*) [with T = Sass::Expression*; D = Sass::Eval]’ was hidden [-Woverloaded-virtual=] 139 | T operator()(Trace* x) { return static_cast(this)->fallback(x); } | ^~~~~~~~ src/eval.hpp:96:17: note: by ‘Sass::Eval::operator()’ 96 | Expression* operator()(Parent_Reference*); | ^~~~~~~~ src/operation.hpp:138:7: warning: ‘T Sass::Operation_CRTP::operator()(Sass::Bubble*) [with T = Sass::Expression*; D = Sass::Eval]’ was hidden [-Woverloaded-virtual=] 138 | T operator()(Bubble* x) { return static_cast(this)->fallback(x); } | ^~~~~~~~ src/eval.hpp:96:17: note: by ‘Sass::Eval::operator()’ 96 | Expression* operator()(Parent_Reference*); | ^~~~~~~~ src/operation.hpp:137:7: warning: ‘T Sass::Operation_CRTP::operator()(Sass::StyleRule*) [with T = Sass::Expression*; D = Sass::Eval]’ was hidden [-Woverloaded-virtual=] 137 | T operator()(StyleRule* x) { return static_cast(this)->fallback(x); } | ^~~~~~~~ src/eval.hpp:96:17: note: by ‘Sass::Eval::operator()’ 96 | Expression* operator()(Parent_Reference*); | ^~~~~~~~ src/operation.hpp:134:7: warning: ‘T Sass::Operation_CRTP::operator()(Sass::AST_Node*) [with T = Sass::Expression*; D = Sass::Eval]’ was hidden [-Woverloaded-virtual=] 134 | T operator()(AST_Node* x) { return static_cast(this)->fallback(x); } | ^~~~~~~~ src/eval.hpp:96:17: note: by ‘Sass::Eval::operator()’ 96 | Expression* operator()(Parent_Reference*); | ^~~~~~~~ g++ -std=gnu++17 -Wall -O2 -std=c++11 -I ./include -fPIC -c -o src/constants.o src/constants.cpp g++ -std=gnu++17 -Wall -O2 -std=c++11 -I ./include -fPIC -c -o src/fn_utils.o src/fn_utils.cpp In file included from src/parser.hpp:11, from src/fn_utils.cpp:5: src/ast.hpp:90:18: warning: ‘virtual bool Sass::AST_Node::operator==(const Sass::AST_Node&) const’ was hidden [-Woverloaded-virtual=] 90 | virtual bool operator== (const AST_Node& rhs) const { | ^~~~~~~~ src/ast.hpp:165:18: note: by ‘virtual bool Sass::Expression::operator==(const Sass::Expression&) const’ 165 | virtual bool operator== (const Expression& rhs) const { return false; } | ^~~~~~~~ src/ast.hpp:96:18: warning: ‘virtual bool Sass::AST_Node::operator!=(const Sass::AST_Node&) const’ was hidden [-Woverloaded-virtual=] 96 | virtual bool operator!= (const AST_Node& rhs) const { | ^~~~~~~~ src/ast.hpp:167:17: note: by ‘bool Sass::Expression::operator!=(const Sass::Expression&) const’ 167 | inline bool operator!=(const Expression& rhs) const { return !(rhs == *this); } | ^~~~~~~~ src/ast.hpp:90:18: warning: ‘virtual bool Sass::AST_Node::operator==(const Sass::AST_Node&) const’ was hidden [-Woverloaded-virtual=] 90 | virtual bool operator== (const AST_Node& rhs) const { | ^~~~~~~~ src/ast.hpp:908:10: note: by ‘bool Sass::CssMediaRule::operator==(const Sass::CssMediaRule&) const’ 908 | bool operator== (const CssMediaRule& rhs) const { | ^~~~~~~~ src/ast.hpp:96:18: warning: ‘virtual bool Sass::AST_Node::operator!=(const Sass::AST_Node&) const’ was hidden [-Woverloaded-virtual=] 96 | virtual bool operator!= (const AST_Node& rhs) const { | ^~~~~~~~ src/ast.hpp:911:10: note: by ‘bool Sass::CssMediaRule::operator!=(const Sass::CssMediaRule&) const’ 911 | bool operator!=(const CssMediaRule& rhs) const { | ^~~~~~~~ src/ast.hpp:90:18: warning: ‘virtual bool Sass::AST_Node::operator==(const Sass::AST_Node&) const’ was hidden [-Woverloaded-virtual=] 90 | virtual bool operator== (const AST_Node& rhs) const { | ^~~~~~~~ src/ast.hpp:939:10: note: by ‘bool Sass::CssMediaQuery::operator==(const Sass::CssMediaQuery&) const’ 939 | bool operator== (const CssMediaQuery& rhs) const; | ^~~~~~~~ src/ast.hpp:96:18: warning: ‘virtual bool Sass::AST_Node::operator!=(const Sass::AST_Node&) const’ was hidden [-Woverloaded-virtual=] 96 | virtual bool operator!= (const AST_Node& rhs) const { | ^~~~~~~~ src/ast.hpp:940:10: note: by ‘bool Sass::CssMediaQuery::operator!=(const Sass::CssMediaQuery&) const’ 940 | bool operator!=(const CssMediaQuery& rhs) const { | ^~~~~~~~ src/ast.hpp:165:18: warning: ‘virtual bool Sass::Expression::operator==(const Sass::Expression&) const’ was hidden [-Woverloaded-virtual=] 165 | virtual bool operator== (const Expression& rhs) const { return false; } | ^~~~~~~~ In file included from src/ast.hpp:14: src/ast_def_macros.hpp:105:16: note: by ‘virtual bool Sass::Selector::operator==(const Sass::Selector&) const’ 105 | virtual bool operator==(const klass& rhs) const = 0; \ | ^~~~~~~~ src/ast_selectors.hpp:56:5: note: in expansion of macro ‘ATTACH_VIRTUAL_CMP_OPERATIONS’ 56 | ATTACH_VIRTUAL_CMP_OPERATIONS(Selector) | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~ src/ast.hpp:96:18: warning: ‘virtual bool Sass::AST_Node::operator!=(const Sass::AST_Node&) const’ was hidden [-Woverloaded-virtual=] 96 | virtual bool operator!= (const AST_Node& rhs) const { | ^~~~~~~~ src/ast_def_macros.hpp:106:16: note: by ‘virtual bool Sass::Selector::operator!=(const Sass::Selector&) const’ 106 | virtual bool operator!=(const klass& rhs) const { return !(*this == rhs); }; \ | ^~~~~~~~ src/ast_selectors.hpp:56:5: note: in expansion of macro ‘ATTACH_VIRTUAL_CMP_OPERATIONS’ 56 | ATTACH_VIRTUAL_CMP_OPERATIONS(Selector) | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~ src/ast_def_macros.hpp:106:16: warning: ‘virtual bool Sass::Selector::operator!=(const Sass::Selector&) const’ was hidden [-Woverloaded-virtual=] 106 | virtual bool operator!=(const klass& rhs) const { return !(*this == rhs); }; \ | ^~~~~~~~ src/ast_selectors.hpp:56:5: note: in expansion of macro ‘ATTACH_VIRTUAL_CMP_OPERATIONS’ 56 | ATTACH_VIRTUAL_CMP_OPERATIONS(Selector) | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~ src/ast_def_macros.hpp:106:16: note: by ‘virtual bool Sass::SimpleSelector::operator!=(const Sass::SimpleSelector&) const’ 106 | virtual bool operator!=(const klass& rhs) const { return !(*this == rhs); }; \ | ^~~~~~~~ src/ast_selectors.hpp:139:5: note: in expansion of macro ‘ATTACH_VIRTUAL_CMP_OPERATIONS’ 139 | ATTACH_VIRTUAL_CMP_OPERATIONS(SimpleSelector); | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~ In file included from src/ast.hpp:1055: src/ast_selectors.hpp:137:18: warning: ‘virtual bool Sass::SimpleSelector::operator==(const Sass::CompoundSelector&) const’ was hidden [-Woverloaded-virtual=] 137 | virtual bool operator==(const CompoundSelector& rhs) const; | ^~~~~~~~ src/ast_def_macros.hpp:109:16: note: by ‘Sass::PlaceholderSelector::operator==’ 109 | virtual bool operator==(const klass& rhs) const; \ | ^~~~~~~~ src/ast_selectors.hpp:157:5: note: in expansion of macro ‘ATTACH_CMP_OPERATIONS’ 157 | ATTACH_CMP_OPERATIONS(PlaceholderSelector) | ^~~~~~~~~~~~~~~~~~~~~ src/ast_selectors.hpp:136:18: warning: ‘virtual bool Sass::SimpleSelector::operator==(const Sass::ComplexSelector&) const’ was hidden [-Woverloaded-virtual=] 136 | virtual bool operator==(const ComplexSelector& rhs) const; | ^~~~~~~~ src/ast_def_macros.hpp:109:16: note: by ‘Sass::PlaceholderSelector::operator==’ 109 | virtual bool operator==(const klass& rhs) const; \ | ^~~~~~~~ src/ast_selectors.hpp:157:5: note: in expansion of macro ‘ATTACH_CMP_OPERATIONS’ 157 | ATTACH_CMP_OPERATIONS(PlaceholderSelector) | ^~~~~~~~~~~~~~~~~~~~~ src/ast_selectors.hpp:135:18: warning: ‘virtual bool Sass::SimpleSelector::operator==(const Sass::SelectorList&) const’ was hidden [-Woverloaded-virtual=] 135 | virtual bool operator==(const SelectorList& rhs) const; | ^~~~~~~~ src/ast_def_macros.hpp:109:16: note: by ‘Sass::PlaceholderSelector::operator==’ 109 | virtual bool operator==(const klass& rhs) const; \ | ^~~~~~~~ src/ast_selectors.hpp:157:5: note: in expansion of macro ‘ATTACH_CMP_OPERATIONS’ 157 | ATTACH_CMP_OPERATIONS(PlaceholderSelector) | ^~~~~~~~~~~~~~~~~~~~~ src/ast_selectors.hpp:133:10: warning: ‘virtual bool Sass::SimpleSelector::operator==(const Sass::Selector&) const’ was hidden [-Woverloaded-virtual=] 133 | bool operator==(const Selector& rhs) const final override; | ^~~~~~~~ src/ast_def_macros.hpp:109:16: note: by ‘Sass::PlaceholderSelector::operator==’ 109 | virtual bool operator==(const klass& rhs) const; \ | ^~~~~~~~ src/ast_selectors.hpp:157:5: note: in expansion of macro ‘ATTACH_CMP_OPERATIONS’ 157 | ATTACH_CMP_OPERATIONS(PlaceholderSelector) | ^~~~~~~~~~~~~~~~~~~~~ src/ast_def_macros.hpp:106:16: warning: ‘virtual bool Sass::SimpleSelector::operator!=(const Sass::SimpleSelector&) const’ was hidden [-Woverloaded-virtual=] 106 | virtual bool operator!=(const klass& rhs) const { return !(*this == rhs); }; \ | ^~~~~~~~ src/ast_selectors.hpp:139:5: note: in expansion of macro ‘ATTACH_VIRTUAL_CMP_OPERATIONS’ 139 | ATTACH_VIRTUAL_CMP_OPERATIONS(SimpleSelector); | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~ src/ast_def_macros.hpp:110:16: note: by ‘virtual bool Sass::PlaceholderSelector::operator!=(const Sass::PlaceholderSelector&) const’ 110 | virtual bool operator!=(const klass& rhs) const { return !(*this == rhs); }; \ | ^~~~~~~~ src/ast_selectors.hpp:157:5: note: in expansion of macro ‘ATTACH_CMP_OPERATIONS’ 157 | ATTACH_CMP_OPERATIONS(PlaceholderSelector) | ^~~~~~~~~~~~~~~~~~~~~ src/ast_selectors.hpp:137:18: warning: ‘virtual bool Sass::SimpleSelector::operator==(const Sass::CompoundSelector&) const’ was hidden [-Woverloaded-virtual=] 137 | virtual bool operator==(const CompoundSelector& rhs) const; | ^~~~~~~~ src/ast_def_macros.hpp:109:16: note: by ‘Sass::TypeSelector::operator==’ 109 | virtual bool operator==(const klass& rhs) const; \ | ^~~~~~~~ src/ast_selectors.hpp:174:5: note: in expansion of macro ‘ATTACH_CMP_OPERATIONS’ 174 | ATTACH_CMP_OPERATIONS(TypeSelector) | ^~~~~~~~~~~~~~~~~~~~~ src/ast_selectors.hpp:136:18: warning: ‘virtual bool Sass::SimpleSelector::operator==(const Sass::ComplexSelector&) const’ was hidden [-Woverloaded-virtual=] 136 | virtual bool operator==(const ComplexSelector& rhs) const; | ^~~~~~~~ src/ast_def_macros.hpp:109:16: note: by ‘Sass::TypeSelector::operator==’ 109 | virtual bool operator==(const klass& rhs) const; \ | ^~~~~~~~ src/ast_selectors.hpp:174:5: note: in expansion of macro ‘ATTACH_CMP_OPERATIONS’ 174 | ATTACH_CMP_OPERATIONS(TypeSelector) | ^~~~~~~~~~~~~~~~~~~~~ src/ast_selectors.hpp:135:18: warning: ‘virtual bool Sass::SimpleSelector::operator==(const Sass::SelectorList&) const’ was hidden [-Woverloaded-virtual=] 135 | virtual bool operator==(const SelectorList& rhs) const; | ^~~~~~~~ src/ast_def_macros.hpp:109:16: note: by ‘Sass::TypeSelector::operator==’ 109 | virtual bool operator==(const klass& rhs) const; \ | ^~~~~~~~ src/ast_selectors.hpp:174:5: note: in expansion of macro ‘ATTACH_CMP_OPERATIONS’ 174 | ATTACH_CMP_OPERATIONS(TypeSelector) | ^~~~~~~~~~~~~~~~~~~~~ src/ast_selectors.hpp:133:10: warning: ‘virtual bool Sass::SimpleSelector::operator==(const Sass::Selector&) const’ was hidden [-Woverloaded-virtual=] 133 | bool operator==(const Selector& rhs) const final override; | ^~~~~~~~ src/ast_def_macros.hpp:109:16: note: by ‘Sass::TypeSelector::operator==’ 109 | virtual bool operator==(const klass& rhs) const; \ | ^~~~~~~~ src/ast_selectors.hpp:174:5: note: in expansion of macro ‘ATTACH_CMP_OPERATIONS’ 174 | ATTACH_CMP_OPERATIONS(TypeSelector) | ^~~~~~~~~~~~~~~~~~~~~ src/ast_def_macros.hpp:106:16: warning: ‘virtual bool Sass::SimpleSelector::operator!=(const Sass::SimpleSelector&) const’ was hidden [-Woverloaded-virtual=] 106 | virtual bool operator!=(const klass& rhs) const { return !(*this == rhs); }; \ | ^~~~~~~~ src/ast_selectors.hpp:139:5: note: in expansion of macro ‘ATTACH_VIRTUAL_CMP_OPERATIONS’ 139 | ATTACH_VIRTUAL_CMP_OPERATIONS(SimpleSelector); | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~ src/ast_def_macros.hpp:110:16: note: by ‘virtual bool Sass::TypeSelector::operator!=(const Sass::TypeSelector&) const’ 110 | virtual bool operator!=(const klass& rhs) const { return !(*this == rhs); }; \ | ^~~~~~~~ src/ast_selectors.hpp:174:5: note: in expansion of macro ‘ATTACH_CMP_OPERATIONS’ 174 | ATTACH_CMP_OPERATIONS(TypeSelector) | ^~~~~~~~~~~~~~~~~~~~~ src/ast_selectors.hpp:137:18: warning: ‘virtual bool Sass::SimpleSelector::operator==(const Sass::CompoundSelector&) const’ was hidden [-Woverloaded-virtual=] 137 | virtual bool operator==(const CompoundSelector& rhs) const; | ^~~~~~~~ src/ast_def_macros.hpp:109:16: note: by ‘Sass::ClassSelector::operator==’ 109 | virtual bool operator==(const klass& rhs) const; \ | ^~~~~~~~ src/ast_selectors.hpp:188:5: note: in expansion of macro ‘ATTACH_CMP_OPERATIONS’ 188 | ATTACH_CMP_OPERATIONS(ClassSelector) | ^~~~~~~~~~~~~~~~~~~~~ src/ast_selectors.hpp:136:18: warning: ‘virtual bool Sass::SimpleSelector::operator==(const Sass::ComplexSelector&) const’ was hidden [-Woverloaded-virtual=] 136 | virtual bool operator==(const ComplexSelector& rhs) const; | ^~~~~~~~ src/ast_def_macros.hpp:109:16: note: by ‘Sass::ClassSelector::operator==’ 109 | virtual bool operator==(const klass& rhs) const; \ | ^~~~~~~~ src/ast_selectors.hpp:188:5: note: in expansion of macro ‘ATTACH_CMP_OPERATIONS’ 188 | ATTACH_CMP_OPERATIONS(ClassSelector) | ^~~~~~~~~~~~~~~~~~~~~ src/ast_selectors.hpp:135:18: warning: ‘virtual bool Sass::SimpleSelector::operator==(const Sass::SelectorList&) const’ was hidden [-Woverloaded-virtual=] 135 | virtual bool operator==(const SelectorList& rhs) const; | ^~~~~~~~ src/ast_def_macros.hpp:109:16: note: by ‘Sass::ClassSelector::operator==’ 109 | virtual bool operator==(const klass& rhs) const; \ | ^~~~~~~~ src/ast_selectors.hpp:188:5: note: in expansion of macro ‘ATTACH_CMP_OPERATIONS’ 188 | ATTACH_CMP_OPERATIONS(ClassSelector) | ^~~~~~~~~~~~~~~~~~~~~ src/ast_selectors.hpp:133:10: warning: ‘virtual bool Sass::SimpleSelector::operator==(const Sass::Selector&) const’ was hidden [-Woverloaded-virtual=] 133 | bool operator==(const Selector& rhs) const final override; | ^~~~~~~~ src/ast_def_macros.hpp:109:16: note: by ‘Sass::ClassSelector::operator==’ 109 | virtual bool operator==(const klass& rhs) const; \ | ^~~~~~~~ src/ast_selectors.hpp:188:5: note: in expansion of macro ‘ATTACH_CMP_OPERATIONS’ 188 | ATTACH_CMP_OPERATIONS(ClassSelector) | ^~~~~~~~~~~~~~~~~~~~~ src/ast_def_macros.hpp:106:16: warning: ‘virtual bool Sass::SimpleSelector::operator!=(const Sass::SimpleSelector&) const’ was hidden [-Woverloaded-virtual=] 106 | virtual bool operator!=(const klass& rhs) const { return !(*this == rhs); }; \ | ^~~~~~~~ src/ast_selectors.hpp:139:5: note: in expansion of macro ‘ATTACH_VIRTUAL_CMP_OPERATIONS’ 139 | ATTACH_VIRTUAL_CMP_OPERATIONS(SimpleSelector); | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~ src/ast_def_macros.hpp:110:16: note: by ‘virtual bool Sass::ClassSelector::operator!=(const Sass::ClassSelector&) const’ 110 | virtual bool operator!=(const klass& rhs) const { return !(*this == rhs); }; \ | ^~~~~~~~ src/ast_selectors.hpp:188:5: note: in expansion of macro ‘ATTACH_CMP_OPERATIONS’ 188 | ATTACH_CMP_OPERATIONS(ClassSelector) | ^~~~~~~~~~~~~~~~~~~~~ src/ast_selectors.hpp:137:18: warning: ‘virtual bool Sass::SimpleSelector::operator==(const Sass::CompoundSelector&) const’ was hidden [-Woverloaded-virtual=] 137 | virtual bool operator==(const CompoundSelector& rhs) const; | ^~~~~~~~ src/ast_def_macros.hpp:109:16: note: by ‘Sass::IDSelector::operator==’ 109 | virtual bool operator==(const klass& rhs) const; \ | ^~~~~~~~ src/ast_selectors.hpp:204:5: note: in expansion of macro ‘ATTACH_CMP_OPERATIONS’ 204 | ATTACH_CMP_OPERATIONS(IDSelector) | ^~~~~~~~~~~~~~~~~~~~~ src/ast_selectors.hpp:136:18: warning: ‘virtual bool Sass::SimpleSelector::operator==(const Sass::ComplexSelector&) const’ was hidden [-Woverloaded-virtual=] 136 | virtual bool operator==(const ComplexSelector& rhs) const; | ^~~~~~~~ src/ast_def_macros.hpp:109:16: note: by ‘Sass::IDSelector::operator==’ 109 | virtual bool operator==(const klass& rhs) const; \ | ^~~~~~~~ src/ast_selectors.hpp:204:5: note: in expansion of macro ‘ATTACH_CMP_OPERATIONS’ 204 | ATTACH_CMP_OPERATIONS(IDSelector) | ^~~~~~~~~~~~~~~~~~~~~ src/ast_selectors.hpp:135:18: warning: ‘virtual bool Sass::SimpleSelector::operator==(const Sass::SelectorList&) const’ was hidden [-Woverloaded-virtual=] 135 | virtual bool operator==(const SelectorList& rhs) const; | ^~~~~~~~ src/ast_def_macros.hpp:109:16: note: by ‘Sass::IDSelector::operator==’ 109 | virtual bool operator==(const klass& rhs) const; \ | ^~~~~~~~ src/ast_selectors.hpp:204:5: note: in expansion of macro ‘ATTACH_CMP_OPERATIONS’ 204 | ATTACH_CMP_OPERATIONS(IDSelector) | ^~~~~~~~~~~~~~~~~~~~~ src/ast_selectors.hpp:133:10: warning: ‘virtual bool Sass::SimpleSelector::operator==(const Sass::Selector&) const’ was hidden [-Woverloaded-virtual=] 133 | bool operator==(const Selector& rhs) const final override; | ^~~~~~~~ src/ast_def_macros.hpp:109:16: note: by ‘Sass::IDSelector::operator==’ 109 | virtual bool operator==(const klass& rhs) const; \ | ^~~~~~~~ src/ast_selectors.hpp:204:5: note: in expansion of macro ‘ATTACH_CMP_OPERATIONS’ 204 | ATTACH_CMP_OPERATIONS(IDSelector) | ^~~~~~~~~~~~~~~~~~~~~ src/ast_def_macros.hpp:106:16: warning: ‘virtual bool Sass::SimpleSelector::operator!=(const Sass::SimpleSelector&) const’ was hidden [-Woverloaded-virtual=] 106 | virtual bool operator!=(const klass& rhs) const { return !(*this == rhs); }; \ | ^~~~~~~~ src/ast_selectors.hpp:139:5: note: in expansion of macro ‘ATTACH_VIRTUAL_CMP_OPERATIONS’ 139 | ATTACH_VIRTUAL_CMP_OPERATIONS(SimpleSelector); | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~ src/ast_def_macros.hpp:110:16: note: by ‘virtual bool Sass::IDSelector::operator!=(const Sass::IDSelector&) const’ 110 | virtual bool operator!=(const klass& rhs) const { return !(*this == rhs); }; \ | ^~~~~~~~ src/ast_selectors.hpp:204:5: note: in expansion of macro ‘ATTACH_CMP_OPERATIONS’ 204 | ATTACH_CMP_OPERATIONS(IDSelector) | ^~~~~~~~~~~~~~~~~~~~~ src/ast_selectors.hpp:137:18: warning: ‘virtual bool Sass::SimpleSelector::operator==(const Sass::CompoundSelector&) const’ was hidden [-Woverloaded-virtual=] 137 | virtual bool operator==(const CompoundSelector& rhs) const; | ^~~~~~~~ src/ast_def_macros.hpp:109:16: note: by ‘Sass::AttributeSelector::operator==’ 109 | virtual bool operator==(const klass& rhs) const; \ | ^~~~~~~~ src/ast_selectors.hpp:223:5: note: in expansion of macro ‘ATTACH_CMP_OPERATIONS’ 223 | ATTACH_CMP_OPERATIONS(AttributeSelector) | ^~~~~~~~~~~~~~~~~~~~~ src/ast_selectors.hpp:136:18: warning: ‘virtual bool Sass::SimpleSelector::operator==(const Sass::ComplexSelector&) const’ was hidden [-Woverloaded-virtual=] 136 | virtual bool operator==(const ComplexSelector& rhs) const; | ^~~~~~~~ src/ast_def_macros.hpp:109:16: note: by ‘Sass::AttributeSelector::operator==’ 109 | virtual bool operator==(const klass& rhs) const; \ | ^~~~~~~~ src/ast_selectors.hpp:223:5: note: in expansion of macro ‘ATTACH_CMP_OPERATIONS’ 223 | ATTACH_CMP_OPERATIONS(AttributeSelector) | ^~~~~~~~~~~~~~~~~~~~~ src/ast_selectors.hpp:135:18: warning: ‘virtual bool Sass::SimpleSelector::operator==(const Sass::SelectorList&) const’ was hidden [-Woverloaded-virtual=] 135 | virtual bool operator==(const SelectorList& rhs) const; | ^~~~~~~~ src/ast_def_macros.hpp:109:16: note: by ‘Sass::AttributeSelector::operator==’ 109 | virtual bool operator==(const klass& rhs) const; \ | ^~~~~~~~ src/ast_selectors.hpp:223:5: note: in expansion of macro ‘ATTACH_CMP_OPERATIONS’ 223 | ATTACH_CMP_OPERATIONS(AttributeSelector) | ^~~~~~~~~~~~~~~~~~~~~ src/ast_selectors.hpp:133:10: warning: ‘virtual bool Sass::SimpleSelector::operator==(const Sass::Selector&) const’ was hidden [-Woverloaded-virtual=] 133 | bool operator==(const Selector& rhs) const final override; | ^~~~~~~~ src/ast_def_macros.hpp:109:16: note: by ‘Sass::AttributeSelector::operator==’ 109 | virtual bool operator==(const klass& rhs) const; \ | ^~~~~~~~ src/ast_selectors.hpp:223:5: note: in expansion of macro ‘ATTACH_CMP_OPERATIONS’ 223 | ATTACH_CMP_OPERATIONS(AttributeSelector) | ^~~~~~~~~~~~~~~~~~~~~ src/ast_def_macros.hpp:106:16: warning: ‘virtual bool Sass::SimpleSelector::operator!=(const Sass::SimpleSelector&) const’ was hidden [-Woverloaded-virtual=] 106 | virtual bool operator!=(const klass& rhs) const { return !(*this == rhs); }; \ | ^~~~~~~~ src/ast_selectors.hpp:139:5: note: in expansion of macro ‘ATTACH_VIRTUAL_CMP_OPERATIONS’ 139 | ATTACH_VIRTUAL_CMP_OPERATIONS(SimpleSelector); | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~ src/ast_def_macros.hpp:110:16: note: by ‘virtual bool Sass::AttributeSelector::operator!=(const Sass::AttributeSelector&) const’ 110 | virtual bool operator!=(const klass& rhs) const { return !(*this == rhs); }; \ | ^~~~~~~~ src/ast_selectors.hpp:223:5: note: in expansion of macro ‘ATTACH_CMP_OPERATIONS’ 223 | ATTACH_CMP_OPERATIONS(AttributeSelector) | ^~~~~~~~~~~~~~~~~~~~~ src/ast_def_macros.hpp:106:16: warning: ‘virtual bool Sass::Selector::operator!=(const Sass::Selector&) const’ was hidden [-Woverloaded-virtual=] 106 | virtual bool operator!=(const klass& rhs) const { return !(*this == rhs); }; \ | ^~~~~~~~ src/ast_selectors.hpp:56:5: note: in expansion of macro ‘ATTACH_VIRTUAL_CMP_OPERATIONS’ 56 | ATTACH_VIRTUAL_CMP_OPERATIONS(Selector) | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~ src/ast_def_macros.hpp:110:16: note: by ‘virtual bool Sass::ComplexSelector::operator!=(const Sass::ComplexSelector&) const’ 110 | virtual bool operator!=(const klass& rhs) const { return !(*this == rhs); }; \ | ^~~~~~~~ src/ast_selectors.hpp:310:5: note: in expansion of macro ‘ATTACH_CMP_OPERATIONS’ 310 | ATTACH_CMP_OPERATIONS(ComplexSelector) | ^~~~~~~~~~~~~~~~~~~~~ src/ast_def_macros.hpp:106:16: warning: ‘virtual bool Sass::Selector::operator!=(const Sass::Selector&) const’ was hidden [-Woverloaded-virtual=] 106 | virtual bool operator!=(const klass& rhs) const { return !(*this == rhs); }; \ | ^~~~~~~~ src/ast_selectors.hpp:56:5: note: in expansion of macro ‘ATTACH_VIRTUAL_CMP_OPERATIONS’ 56 | ATTACH_VIRTUAL_CMP_OPERATIONS(Selector) | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~ src/ast_def_macros.hpp:106:16: note: by ‘virtual bool Sass::SelectorComponent::operator!=(const Sass::SelectorComponent&) const’ 106 | virtual bool operator!=(const klass& rhs) const { return !(*this == rhs); }; \ | ^~~~~~~~ src/ast_selectors.hpp:349:5: note: in expansion of macro ‘ATTACH_VIRTUAL_CMP_OPERATIONS’ 349 | ATTACH_VIRTUAL_CMP_OPERATIONS(SelectorComponent); | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~ src/ast_def_macros.hpp:106:16: warning: ‘virtual bool Sass::SelectorComponent::operator!=(const Sass::SelectorComponent&) const’ was hidden [-Woverloaded-virtual=] 106 | virtual bool operator!=(const klass& rhs) const { return !(*this == rhs); }; \ | ^~~~~~~~ src/ast_selectors.hpp:349:5: note: in expansion of macro ‘ATTACH_VIRTUAL_CMP_OPERATIONS’ 349 | ATTACH_VIRTUAL_CMP_OPERATIONS(SelectorComponent); | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~ src/ast_def_macros.hpp:110:16: note: by ‘virtual bool Sass::SelectorCombinator::operator!=(const Sass::SelectorCombinator&) const’ 110 | virtual bool operator!=(const klass& rhs) const { return !(*this == rhs); }; \ | ^~~~~~~~ src/ast_selectors.hpp:407:5: note: in expansion of macro ‘ATTACH_CMP_OPERATIONS’ 407 | ATTACH_CMP_OPERATIONS(SelectorCombinator) | ^~~~~~~~~~~~~~~~~~~~~ g++ -std=gnu++17 -Wall -O2 -std=c++11 -I ./include -fPIC -c -o src/fn_miscs.o src/fn_miscs.cpp In file included from src/fn_miscs.cpp:1: src/ast.hpp:90:18: warning: ‘virtual bool Sass::AST_Node::operator==(const Sass::AST_Node&) const’ was hidden [-Woverloaded-virtual=] 90 | virtual bool operator== (const AST_Node& rhs) const { | ^~~~~~~~ src/ast.hpp:165:18: note: by ‘virtual bool Sass::Expression::operator==(const Sass::Expression&) const’ 165 | virtual bool operator== (const Expression& rhs) const { return false; } | ^~~~~~~~ src/ast.hpp:96:18: warning: ‘virtual bool Sass::AST_Node::operator!=(const Sass::AST_Node&) const’ was hidden [-Woverloaded-virtual=] 96 | virtual bool operator!= (const AST_Node& rhs) const { | ^~~~~~~~ src/ast.hpp:167:17: note: by ‘bool Sass::Expression::operator!=(const Sass::Expression&) const’ 167 | inline bool operator!=(const Expression& rhs) const { return !(rhs == *this); } | ^~~~~~~~ src/ast.hpp:90:18: warning: ‘virtual bool Sass::AST_Node::operator==(const Sass::AST_Node&) const’ was hidden [-Woverloaded-virtual=] 90 | virtual bool operator== (const AST_Node& rhs) const { | ^~~~~~~~ src/ast.hpp:908:10: note: by ‘bool Sass::CssMediaRule::operator==(const Sass::CssMediaRule&) const’ 908 | bool operator== (const CssMediaRule& rhs) const { | ^~~~~~~~ src/ast.hpp:96:18: warning: ‘virtual bool Sass::AST_Node::operator!=(const Sass::AST_Node&) const’ was hidden [-Woverloaded-virtual=] 96 | virtual bool operator!= (const AST_Node& rhs) const { | ^~~~~~~~ src/ast.hpp:911:10: note: by ‘bool Sass::CssMediaRule::operator!=(const Sass::CssMediaRule&) const’ 911 | bool operator!=(const CssMediaRule& rhs) const { | ^~~~~~~~ src/ast.hpp:90:18: warning: ‘virtual bool Sass::AST_Node::operator==(const Sass::AST_Node&) const’ was hidden [-Woverloaded-virtual=] 90 | virtual bool operator== (const AST_Node& rhs) const { | ^~~~~~~~ src/ast.hpp:939:10: note: by ‘bool Sass::CssMediaQuery::operator==(const Sass::CssMediaQuery&) const’ 939 | bool operator== (const CssMediaQuery& rhs) const; | ^~~~~~~~ src/ast.hpp:96:18: warning: ‘virtual bool Sass::AST_Node::operator!=(const Sass::AST_Node&) const’ was hidden [-Woverloaded-virtual=] 96 | virtual bool operator!= (const AST_Node& rhs) const { | ^~~~~~~~ src/ast.hpp:940:10: note: by ‘bool Sass::CssMediaQuery::operator!=(const Sass::CssMediaQuery&) const’ 940 | bool operator!=(const CssMediaQuery& rhs) const { | ^~~~~~~~ src/ast.hpp:165:18: warning: ‘virtual bool Sass::Expression::operator==(const Sass::Expression&) const’ was hidden [-Woverloaded-virtual=] 165 | virtual bool operator== (const Expression& rhs) const { return false; } | ^~~~~~~~ In file included from src/ast.hpp:14: src/ast_def_macros.hpp:105:16: note: by ‘virtual bool Sass::Selector::operator==(const Sass::Selector&) const’ 105 | virtual bool operator==(const klass& rhs) const = 0; \ | ^~~~~~~~ src/ast_selectors.hpp:56:5: note: in expansion of macro ‘ATTACH_VIRTUAL_CMP_OPERATIONS’ 56 | ATTACH_VIRTUAL_CMP_OPERATIONS(Selector) | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~ src/ast.hpp:96:18: warning: ‘virtual bool Sass::AST_Node::operator!=(const Sass::AST_Node&) const’ was hidden [-Woverloaded-virtual=] 96 | virtual bool operator!= (const AST_Node& rhs) const { | ^~~~~~~~ src/ast_def_macros.hpp:106:16: note: by ‘virtual bool Sass::Selector::operator!=(const Sass::Selector&) const’ 106 | virtual bool operator!=(const klass& rhs) const { return !(*this == rhs); }; \ | ^~~~~~~~ src/ast_selectors.hpp:56:5: note: in expansion of macro ‘ATTACH_VIRTUAL_CMP_OPERATIONS’ 56 | ATTACH_VIRTUAL_CMP_OPERATIONS(Selector) | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~ src/ast_def_macros.hpp:106:16: warning: ‘virtual bool Sass::Selector::operator!=(const Sass::Selector&) const’ was hidden [-Woverloaded-virtual=] 106 | virtual bool operator!=(const klass& rhs) const { return !(*this == rhs); }; \ | ^~~~~~~~ src/ast_selectors.hpp:56:5: note: in expansion of macro ‘ATTACH_VIRTUAL_CMP_OPERATIONS’ 56 | ATTACH_VIRTUAL_CMP_OPERATIONS(Selector) | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~ src/ast_def_macros.hpp:106:16: note: by ‘virtual bool Sass::SimpleSelector::operator!=(const Sass::SimpleSelector&) const’ 106 | virtual bool operator!=(const klass& rhs) const { return !(*this == rhs); }; \ | ^~~~~~~~ src/ast_selectors.hpp:139:5: note: in expansion of macro ‘ATTACH_VIRTUAL_CMP_OPERATIONS’ 139 | ATTACH_VIRTUAL_CMP_OPERATIONS(SimpleSelector); | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~ In file included from src/ast.hpp:1055: src/ast_selectors.hpp:137:18: warning: ‘virtual bool Sass::SimpleSelector::operator==(const Sass::CompoundSelector&) const’ was hidden [-Woverloaded-virtual=] 137 | virtual bool operator==(const CompoundSelector& rhs) const; | ^~~~~~~~ src/ast_def_macros.hpp:109:16: note: by ‘Sass::PlaceholderSelector::operator==’ 109 | virtual bool operator==(const klass& rhs) const; \ | ^~~~~~~~ src/ast_selectors.hpp:157:5: note: in expansion of macro ‘ATTACH_CMP_OPERATIONS’ 157 | ATTACH_CMP_OPERATIONS(PlaceholderSelector) | ^~~~~~~~~~~~~~~~~~~~~ src/ast_selectors.hpp:136:18: warning: ‘virtual bool Sass::SimpleSelector::operator==(const Sass::ComplexSelector&) const’ was hidden [-Woverloaded-virtual=] 136 | virtual bool operator==(const ComplexSelector& rhs) const; | ^~~~~~~~ src/ast_def_macros.hpp:109:16: note: by ‘Sass::PlaceholderSelector::operator==’ 109 | virtual bool operator==(const klass& rhs) const; \ | ^~~~~~~~ src/ast_selectors.hpp:157:5: note: in expansion of macro ‘ATTACH_CMP_OPERATIONS’ 157 | ATTACH_CMP_OPERATIONS(PlaceholderSelector) | ^~~~~~~~~~~~~~~~~~~~~ src/ast_selectors.hpp:135:18: warning: ‘virtual bool Sass::SimpleSelector::operator==(const Sass::SelectorList&) const’ was hidden [-Woverloaded-virtual=] 135 | virtual bool operator==(const SelectorList& rhs) const; | ^~~~~~~~ src/ast_def_macros.hpp:109:16: note: by ‘Sass::PlaceholderSelector::operator==’ 109 | virtual bool operator==(const klass& rhs) const; \ | ^~~~~~~~ src/ast_selectors.hpp:157:5: note: in expansion of macro ‘ATTACH_CMP_OPERATIONS’ 157 | ATTACH_CMP_OPERATIONS(PlaceholderSelector) | ^~~~~~~~~~~~~~~~~~~~~ src/ast_selectors.hpp:133:10: warning: ‘virtual bool Sass::SimpleSelector::operator==(const Sass::Selector&) const’ was hidden [-Woverloaded-virtual=] 133 | bool operator==(const Selector& rhs) const final override; | ^~~~~~~~ src/ast_def_macros.hpp:109:16: note: by ‘Sass::PlaceholderSelector::operator==’ 109 | virtual bool operator==(const klass& rhs) const; \ | ^~~~~~~~ src/ast_selectors.hpp:157:5: note: in expansion of macro ‘ATTACH_CMP_OPERATIONS’ 157 | ATTACH_CMP_OPERATIONS(PlaceholderSelector) | ^~~~~~~~~~~~~~~~~~~~~ src/ast_def_macros.hpp:106:16: warning: ‘virtual bool Sass::SimpleSelector::operator!=(const Sass::SimpleSelector&) const’ was hidden [-Woverloaded-virtual=] 106 | virtual bool operator!=(const klass& rhs) const { return !(*this == rhs); }; \ | ^~~~~~~~ src/ast_selectors.hpp:139:5: note: in expansion of macro ‘ATTACH_VIRTUAL_CMP_OPERATIONS’ 139 | ATTACH_VIRTUAL_CMP_OPERATIONS(SimpleSelector); | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~ src/ast_def_macros.hpp:110:16: note: by ‘virtual bool Sass::PlaceholderSelector::operator!=(const Sass::PlaceholderSelector&) const’ 110 | virtual bool operator!=(const klass& rhs) const { return !(*this == rhs); }; \ | ^~~~~~~~ src/ast_selectors.hpp:157:5: note: in expansion of macro ‘ATTACH_CMP_OPERATIONS’ 157 | ATTACH_CMP_OPERATIONS(PlaceholderSelector) | ^~~~~~~~~~~~~~~~~~~~~ src/ast_selectors.hpp:137:18: warning: ‘virtual bool Sass::SimpleSelector::operator==(const Sass::CompoundSelector&) const’ was hidden [-Woverloaded-virtual=] 137 | virtual bool operator==(const CompoundSelector& rhs) const; | ^~~~~~~~ src/ast_def_macros.hpp:109:16: note: by ‘Sass::TypeSelector::operator==’ 109 | virtual bool operator==(const klass& rhs) const; \ | ^~~~~~~~ src/ast_selectors.hpp:174:5: note: in expansion of macro ‘ATTACH_CMP_OPERATIONS’ 174 | ATTACH_CMP_OPERATIONS(TypeSelector) | ^~~~~~~~~~~~~~~~~~~~~ src/ast_selectors.hpp:136:18: warning: ‘virtual bool Sass::SimpleSelector::operator==(const Sass::ComplexSelector&) const’ was hidden [-Woverloaded-virtual=] 136 | virtual bool operator==(const ComplexSelector& rhs) const; | ^~~~~~~~ src/ast_def_macros.hpp:109:16: note: by ‘Sass::TypeSelector::operator==’ 109 | virtual bool operator==(const klass& rhs) const; \ | ^~~~~~~~ src/ast_selectors.hpp:174:5: note: in expansion of macro ‘ATTACH_CMP_OPERATIONS’ 174 | ATTACH_CMP_OPERATIONS(TypeSelector) | ^~~~~~~~~~~~~~~~~~~~~ src/ast_selectors.hpp:135:18: warning: ‘virtual bool Sass::SimpleSelector::operator==(const Sass::SelectorList&) const’ was hidden [-Woverloaded-virtual=] 135 | virtual bool operator==(const SelectorList& rhs) const; | ^~~~~~~~ src/ast_def_macros.hpp:109:16: note: by ‘Sass::TypeSelector::operator==’ 109 | virtual bool operator==(const klass& rhs) const; \ | ^~~~~~~~ src/ast_selectors.hpp:174:5: note: in expansion of macro ‘ATTACH_CMP_OPERATIONS’ 174 | ATTACH_CMP_OPERATIONS(TypeSelector) | ^~~~~~~~~~~~~~~~~~~~~ src/ast_selectors.hpp:133:10: warning: ‘virtual bool Sass::SimpleSelector::operator==(const Sass::Selector&) const’ was hidden [-Woverloaded-virtual=] 133 | bool operator==(const Selector& rhs) const final override; | ^~~~~~~~ src/ast_def_macros.hpp:109:16: note: by ‘Sass::TypeSelector::operator==’ 109 | virtual bool operator==(const klass& rhs) const; \ | ^~~~~~~~ src/ast_selectors.hpp:174:5: note: in expansion of macro ‘ATTACH_CMP_OPERATIONS’ 174 | ATTACH_CMP_OPERATIONS(TypeSelector) | ^~~~~~~~~~~~~~~~~~~~~ src/ast_def_macros.hpp:106:16: warning: ‘virtual bool Sass::SimpleSelector::operator!=(const Sass::SimpleSelector&) const’ was hidden [-Woverloaded-virtual=] 106 | virtual bool operator!=(const klass& rhs) const { return !(*this == rhs); }; \ | ^~~~~~~~ src/ast_selectors.hpp:139:5: note: in expansion of macro ‘ATTACH_VIRTUAL_CMP_OPERATIONS’ 139 | ATTACH_VIRTUAL_CMP_OPERATIONS(SimpleSelector); | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~ src/ast_def_macros.hpp:110:16: note: by ‘virtual bool Sass::TypeSelector::operator!=(const Sass::TypeSelector&) const’ 110 | virtual bool operator!=(const klass& rhs) const { return !(*this == rhs); }; \ | ^~~~~~~~ src/ast_selectors.hpp:174:5: note: in expansion of macro ‘ATTACH_CMP_OPERATIONS’ 174 | ATTACH_CMP_OPERATIONS(TypeSelector) | ^~~~~~~~~~~~~~~~~~~~~ src/ast_selectors.hpp:137:18: warning: ‘virtual bool Sass::SimpleSelector::operator==(const Sass::CompoundSelector&) const’ was hidden [-Woverloaded-virtual=] 137 | virtual bool operator==(const CompoundSelector& rhs) const; | ^~~~~~~~ src/ast_def_macros.hpp:109:16: note: by ‘Sass::ClassSelector::operator==’ 109 | virtual bool operator==(const klass& rhs) const; \ | ^~~~~~~~ src/ast_selectors.hpp:188:5: note: in expansion of macro ‘ATTACH_CMP_OPERATIONS’ 188 | ATTACH_CMP_OPERATIONS(ClassSelector) | ^~~~~~~~~~~~~~~~~~~~~ src/ast_selectors.hpp:136:18: warning: ‘virtual bool Sass::SimpleSelector::operator==(const Sass::ComplexSelector&) const’ was hidden [-Woverloaded-virtual=] 136 | virtual bool operator==(const ComplexSelector& rhs) const; | ^~~~~~~~ src/ast_def_macros.hpp:109:16: note: by ‘Sass::ClassSelector::operator==’ 109 | virtual bool operator==(const klass& rhs) const; \ | ^~~~~~~~ src/ast_selectors.hpp:188:5: note: in expansion of macro ‘ATTACH_CMP_OPERATIONS’ 188 | ATTACH_CMP_OPERATIONS(ClassSelector) | ^~~~~~~~~~~~~~~~~~~~~ src/ast_selectors.hpp:135:18: warning: ‘virtual bool Sass::SimpleSelector::operator==(const Sass::SelectorList&) const’ was hidden [-Woverloaded-virtual=] 135 | virtual bool operator==(const SelectorList& rhs) const; | ^~~~~~~~ src/ast_def_macros.hpp:109:16: note: by ‘Sass::ClassSelector::operator==’ 109 | virtual bool operator==(const klass& rhs) const; \ | ^~~~~~~~ src/ast_selectors.hpp:188:5: note: in expansion of macro ‘ATTACH_CMP_OPERATIONS’ 188 | ATTACH_CMP_OPERATIONS(ClassSelector) | ^~~~~~~~~~~~~~~~~~~~~ src/ast_selectors.hpp:133:10: warning: ‘virtual bool Sass::SimpleSelector::operator==(const Sass::Selector&) const’ was hidden [-Woverloaded-virtual=] 133 | bool operator==(const Selector& rhs) const final override; | ^~~~~~~~ src/ast_def_macros.hpp:109:16: note: by ‘Sass::ClassSelector::operator==’ 109 | virtual bool operator==(const klass& rhs) const; \ | ^~~~~~~~ src/ast_selectors.hpp:188:5: note: in expansion of macro ‘ATTACH_CMP_OPERATIONS’ 188 | ATTACH_CMP_OPERATIONS(ClassSelector) | ^~~~~~~~~~~~~~~~~~~~~ src/ast_def_macros.hpp:106:16: warning: ‘virtual bool Sass::SimpleSelector::operator!=(const Sass::SimpleSelector&) const’ was hidden [-Woverloaded-virtual=] 106 | virtual bool operator!=(const klass& rhs) const { return !(*this == rhs); }; \ | ^~~~~~~~ src/ast_selectors.hpp:139:5: note: in expansion of macro ‘ATTACH_VIRTUAL_CMP_OPERATIONS’ 139 | ATTACH_VIRTUAL_CMP_OPERATIONS(SimpleSelector); | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~ src/ast_def_macros.hpp:110:16: note: by ‘virtual bool Sass::ClassSelector::operator!=(const Sass::ClassSelector&) const’ 110 | virtual bool operator!=(const klass& rhs) const { return !(*this == rhs); }; \ | ^~~~~~~~ src/ast_selectors.hpp:188:5: note: in expansion of macro ‘ATTACH_CMP_OPERATIONS’ 188 | ATTACH_CMP_OPERATIONS(ClassSelector) | ^~~~~~~~~~~~~~~~~~~~~ src/ast_selectors.hpp:137:18: warning: ‘virtual bool Sass::SimpleSelector::operator==(const Sass::CompoundSelector&) const’ was hidden [-Woverloaded-virtual=] 137 | virtual bool operator==(const CompoundSelector& rhs) const; | ^~~~~~~~ src/ast_def_macros.hpp:109:16: note: by ‘Sass::IDSelector::operator==’ 109 | virtual bool operator==(const klass& rhs) const; \ | ^~~~~~~~ src/ast_selectors.hpp:204:5: note: in expansion of macro ‘ATTACH_CMP_OPERATIONS’ 204 | ATTACH_CMP_OPERATIONS(IDSelector) | ^~~~~~~~~~~~~~~~~~~~~ src/ast_selectors.hpp:136:18: warning: ‘virtual bool Sass::SimpleSelector::operator==(const Sass::ComplexSelector&) const’ was hidden [-Woverloaded-virtual=] 136 | virtual bool operator==(const ComplexSelector& rhs) const; | ^~~~~~~~ src/ast_def_macros.hpp:109:16: note: by ‘Sass::IDSelector::operator==’ 109 | virtual bool operator==(const klass& rhs) const; \ | ^~~~~~~~ src/ast_selectors.hpp:204:5: note: in expansion of macro ‘ATTACH_CMP_OPERATIONS’ 204 | ATTACH_CMP_OPERATIONS(IDSelector) | ^~~~~~~~~~~~~~~~~~~~~ src/ast_selectors.hpp:135:18: warning: ‘virtual bool Sass::SimpleSelector::operator==(const Sass::SelectorList&) const’ was hidden [-Woverloaded-virtual=] 135 | virtual bool operator==(const SelectorList& rhs) const; | ^~~~~~~~ src/ast_def_macros.hpp:109:16: note: by ‘Sass::IDSelector::operator==’ 109 | virtual bool operator==(const klass& rhs) const; \ | ^~~~~~~~ src/ast_selectors.hpp:204:5: note: in expansion of macro ‘ATTACH_CMP_OPERATIONS’ 204 | ATTACH_CMP_OPERATIONS(IDSelector) | ^~~~~~~~~~~~~~~~~~~~~ src/ast_selectors.hpp:133:10: warning: ‘virtual bool Sass::SimpleSelector::operator==(const Sass::Selector&) const’ was hidden [-Woverloaded-virtual=] 133 | bool operator==(const Selector& rhs) const final override; | ^~~~~~~~ src/ast_def_macros.hpp:109:16: note: by ‘Sass::IDSelector::operator==’ 109 | virtual bool operator==(const klass& rhs) const; \ | ^~~~~~~~ src/ast_selectors.hpp:204:5: note: in expansion of macro ‘ATTACH_CMP_OPERATIONS’ 204 | ATTACH_CMP_OPERATIONS(IDSelector) | ^~~~~~~~~~~~~~~~~~~~~ src/ast_def_macros.hpp:106:16: warning: ‘virtual bool Sass::SimpleSelector::operator!=(const Sass::SimpleSelector&) const’ was hidden [-Woverloaded-virtual=] 106 | virtual bool operator!=(const klass& rhs) const { return !(*this == rhs); }; \ | ^~~~~~~~ src/ast_selectors.hpp:139:5: note: in expansion of macro ‘ATTACH_VIRTUAL_CMP_OPERATIONS’ 139 | ATTACH_VIRTUAL_CMP_OPERATIONS(SimpleSelector); | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~ src/ast_def_macros.hpp:110:16: note: by ‘virtual bool Sass::IDSelector::operator!=(const Sass::IDSelector&) const’ 110 | virtual bool operator!=(const klass& rhs) const { return !(*this == rhs); }; \ | ^~~~~~~~ src/ast_selectors.hpp:204:5: note: in expansion of macro ‘ATTACH_CMP_OPERATIONS’ 204 | ATTACH_CMP_OPERATIONS(IDSelector) | ^~~~~~~~~~~~~~~~~~~~~ src/ast_selectors.hpp:137:18: warning: ‘virtual bool Sass::SimpleSelector::operator==(const Sass::CompoundSelector&) const’ was hidden [-Woverloaded-virtual=] 137 | virtual bool operator==(const CompoundSelector& rhs) const; | ^~~~~~~~ src/ast_def_macros.hpp:109:16: note: by ‘Sass::AttributeSelector::operator==’ 109 | virtual bool operator==(const klass& rhs) const; \ | ^~~~~~~~ src/ast_selectors.hpp:223:5: note: in expansion of macro ‘ATTACH_CMP_OPERATIONS’ 223 | ATTACH_CMP_OPERATIONS(AttributeSelector) | ^~~~~~~~~~~~~~~~~~~~~ src/ast_selectors.hpp:136:18: warning: ‘virtual bool Sass::SimpleSelector::operator==(const Sass::ComplexSelector&) const’ was hidden [-Woverloaded-virtual=] 136 | virtual bool operator==(const ComplexSelector& rhs) const; | ^~~~~~~~ src/ast_def_macros.hpp:109:16: note: by ‘Sass::AttributeSelector::operator==’ 109 | virtual bool operator==(const klass& rhs) const; \ | ^~~~~~~~ src/ast_selectors.hpp:223:5: note: in expansion of macro ‘ATTACH_CMP_OPERATIONS’ 223 | ATTACH_CMP_OPERATIONS(AttributeSelector) | ^~~~~~~~~~~~~~~~~~~~~ src/ast_selectors.hpp:135:18: warning: ‘virtual bool Sass::SimpleSelector::operator==(const Sass::SelectorList&) const’ was hidden [-Woverloaded-virtual=] 135 | virtual bool operator==(const SelectorList& rhs) const; | ^~~~~~~~ src/ast_def_macros.hpp:109:16: note: by ‘Sass::AttributeSelector::operator==’ 109 | virtual bool operator==(const klass& rhs) const; \ | ^~~~~~~~ src/ast_selectors.hpp:223:5: note: in expansion of macro ‘ATTACH_CMP_OPERATIONS’ 223 | ATTACH_CMP_OPERATIONS(AttributeSelector) | ^~~~~~~~~~~~~~~~~~~~~ src/ast_selectors.hpp:133:10: warning: ‘virtual bool Sass::SimpleSelector::operator==(const Sass::Selector&) const’ was hidden [-Woverloaded-virtual=] 133 | bool operator==(const Selector& rhs) const final override; | ^~~~~~~~ src/ast_def_macros.hpp:109:16: note: by ‘Sass::AttributeSelector::operator==’ 109 | virtual bool operator==(const klass& rhs) const; \ | ^~~~~~~~ src/ast_selectors.hpp:223:5: note: in expansion of macro ‘ATTACH_CMP_OPERATIONS’ 223 | ATTACH_CMP_OPERATIONS(AttributeSelector) | ^~~~~~~~~~~~~~~~~~~~~ src/ast_def_macros.hpp:106:16: warning: ‘virtual bool Sass::SimpleSelector::operator!=(const Sass::SimpleSelector&) const’ was hidden [-Woverloaded-virtual=] 106 | virtual bool operator!=(const klass& rhs) const { return !(*this == rhs); }; \ | ^~~~~~~~ src/ast_selectors.hpp:139:5: note: in expansion of macro ‘ATTACH_VIRTUAL_CMP_OPERATIONS’ 139 | ATTACH_VIRTUAL_CMP_OPERATIONS(SimpleSelector); | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~ src/ast_def_macros.hpp:110:16: note: by ‘virtual bool Sass::AttributeSelector::operator!=(const Sass::AttributeSelector&) const’ 110 | virtual bool operator!=(const klass& rhs) const { return !(*this == rhs); }; \ | ^~~~~~~~ src/ast_selectors.hpp:223:5: note: in expansion of macro ‘ATTACH_CMP_OPERATIONS’ 223 | ATTACH_CMP_OPERATIONS(AttributeSelector) | ^~~~~~~~~~~~~~~~~~~~~ src/ast_def_macros.hpp:106:16: warning: ‘virtual bool Sass::Selector::operator!=(const Sass::Selector&) const’ was hidden [-Woverloaded-virtual=] 106 | virtual bool operator!=(const klass& rhs) const { return !(*this == rhs); }; \ | ^~~~~~~~ src/ast_selectors.hpp:56:5: note: in expansion of macro ‘ATTACH_VIRTUAL_CMP_OPERATIONS’ 56 | ATTACH_VIRTUAL_CMP_OPERATIONS(Selector) | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~ src/ast_def_macros.hpp:110:16: note: by ‘virtual bool Sass::ComplexSelector::operator!=(const Sass::ComplexSelector&) const’ 110 | virtual bool operator!=(const klass& rhs) const { return !(*this == rhs); }; \ | ^~~~~~~~ src/ast_selectors.hpp:310:5: note: in expansion of macro ‘ATTACH_CMP_OPERATIONS’ 310 | ATTACH_CMP_OPERATIONS(ComplexSelector) | ^~~~~~~~~~~~~~~~~~~~~ src/ast_def_macros.hpp:106:16: warning: ‘virtual bool Sass::Selector::operator!=(const Sass::Selector&) const’ was hidden [-Woverloaded-virtual=] 106 | virtual bool operator!=(const klass& rhs) const { return !(*this == rhs); }; \ | ^~~~~~~~ src/ast_selectors.hpp:56:5: note: in expansion of macro ‘ATTACH_VIRTUAL_CMP_OPERATIONS’ 56 | ATTACH_VIRTUAL_CMP_OPERATIONS(Selector) | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~ src/ast_def_macros.hpp:106:16: note: by ‘virtual bool Sass::SelectorComponent::operator!=(const Sass::SelectorComponent&) const’ 106 | virtual bool operator!=(const klass& rhs) const { return !(*this == rhs); }; \ | ^~~~~~~~ src/ast_selectors.hpp:349:5: note: in expansion of macro ‘ATTACH_VIRTUAL_CMP_OPERATIONS’ 349 | ATTACH_VIRTUAL_CMP_OPERATIONS(SelectorComponent); | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~ src/ast_def_macros.hpp:106:16: warning: ‘virtual bool Sass::SelectorComponent::operator!=(const Sass::SelectorComponent&) const’ was hidden [-Woverloaded-virtual=] 106 | virtual bool operator!=(const klass& rhs) const { return !(*this == rhs); }; \ | ^~~~~~~~ src/ast_selectors.hpp:349:5: note: in expansion of macro ‘ATTACH_VIRTUAL_CMP_OPERATIONS’ 349 | ATTACH_VIRTUAL_CMP_OPERATIONS(SelectorComponent); | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~ src/ast_def_macros.hpp:110:16: note: by ‘virtual bool Sass::SelectorCombinator::operator!=(const Sass::SelectorCombinator&) const’ 110 | virtual bool operator!=(const klass& rhs) const { return !(*this == rhs); }; \ | ^~~~~~~~ src/ast_selectors.hpp:407:5: note: in expansion of macro ‘ATTACH_CMP_OPERATIONS’ 407 | ATTACH_CMP_OPERATIONS(SelectorCombinator) | ^~~~~~~~~~~~~~~~~~~~~ In file included from src/ast.hpp:18: src/operation.hpp:206:7: warning: ‘T Sass::Operation_CRTP::operator()(Sass::SelectorCombinator*) [with T = Sass::Expression*; D = Sass::Eval]’ was hidden [-Woverloaded-virtual=] 206 | T operator()(SelectorCombinator* x) { return static_cast(this)->fallback(x); } | ^~~~~~~~ In file included from src/expand.hpp:7, from src/fn_miscs.cpp:2: src/eval.hpp:96:17: note: by ‘Sass::Eval::operator()’ 96 | Expression* operator()(Parent_Reference*); | ^~~~~~~~ src/operation.hpp:194:7: warning: ‘T Sass::Operation_CRTP::operator()(Sass::Parameters*) [with T = Sass::Expression*; D = Sass::Eval]’ was hidden [-Woverloaded-virtual=] 194 | T operator()(Parameters* x) { return static_cast(this)->fallback(x); } | ^~~~~~~~ src/eval.hpp:96:17: note: by ‘Sass::Eval::operator()’ 96 | Expression* operator()(Parent_Reference*); | ^~~~~~~~ src/operation.hpp:193:7: warning: ‘T Sass::Operation_CRTP::operator()(Sass::Parameter*) [with T = Sass::Expression*; D = Sass::Eval]’ was hidden [-Woverloaded-virtual=] 193 | T operator()(Parameter* x) { return static_cast(this)->fallback(x); } | ^~~~~~~~ src/eval.hpp:96:17: note: by ‘Sass::Eval::operator()’ 96 | Expression* operator()(Parent_Reference*); | ^~~~~~~~ src/operation.hpp:183:7: warning: ‘T Sass::Operation_CRTP::operator()(Sass::SupportsCondition*) [with T = Sass::Expression*; D = Sass::Eval]’ was hidden [-Woverloaded-virtual=] 183 | T operator()(SupportsCondition* x) { return static_cast(this)->fallback(x); } | ^~~~~~~~ src/eval.hpp:96:17: note: by ‘Sass::Eval::operator()’ 96 | Expression* operator()(Parent_Reference*); | ^~~~~~~~ src/operation.hpp:176:7: warning: ‘T Sass::Operation_CRTP::operator()(Sass::Color*) [with T = Sass::Expression*; D = Sass::Eval]’ was hidden [-Woverloaded-virtual=] 176 | T operator()(Color* x) { return static_cast(this)->fallback(x); } | ^~~~~~~~ src/eval.hpp:96:17: note: by ‘Sass::Eval::operator()’ 96 | Expression* operator()(Parent_Reference*); | ^~~~~~~~ src/operation.hpp:173:7: warning: ‘T Sass::Operation_CRTP::operator()(Sass::Custom_Error*) [with T = Sass::Expression*; D = Sass::Eval]’ was hidden [-Woverloaded-virtual=] 173 | T operator()(Custom_Error* x) { return static_cast(this)->fallback(x); } | ^~~~~~~~ src/eval.hpp:96:17: note: by ‘Sass::Eval::operator()’ 96 | Expression* operator()(Parent_Reference*); | ^~~~~~~~ src/operation.hpp:172:7: warning: ‘T Sass::Operation_CRTP::operator()(Sass::Custom_Warning*) [with T = Sass::Expression*; D = Sass::Eval]’ was hidden [-Woverloaded-virtual=] 172 | T operator()(Custom_Warning* x) { return static_cast(this)->fallback(x); } | ^~~~~~~~ src/eval.hpp:96:17: note: by ‘Sass::Eval::operator()’ 96 | Expression* operator()(Parent_Reference*); | ^~~~~~~~ src/operation.hpp:168:7: warning: ‘T Sass::Operation_CRTP::operator()(Sass::Function*) [with T = Sass::Expression*; D = Sass::Eval]’ was hidden [-Woverloaded-virtual=] 168 | T operator()(Function* x) { return static_cast(this)->fallback(x); } | ^~~~~~~~ src/eval.hpp:96:17: note: by ‘Sass::Eval::operator()’ 96 | Expression* operator()(Parent_Reference*); | ^~~~~~~~ src/operation.hpp:163:7: warning: ‘T Sass::Operation_CRTP::operator()(Sass::Mixin_Call*) [with T = Sass::Expression*; D = Sass::Eval]’ was hidden [-Woverloaded-virtual=] 163 | T operator()(Mixin_Call* x) { return static_cast(this)->fallback(x); } | ^~~~~~~~ src/eval.hpp:96:17: note: by ‘Sass::Eval::operator()’ 96 | Expression* operator()(Parent_Reference*); | ^~~~~~~~ src/operation.hpp:162:7: warning: ‘T Sass::Operation_CRTP::operator()(Sass::Definition*) [with T = Sass::Expression*; D = Sass::Eval]’ was hidden [-Woverloaded-virtual=] 162 | T operator()(Definition* x) { return static_cast(this)->fallback(x); } | ^~~~~~~~ src/eval.hpp:96:17: note: by ‘Sass::Eval::operator()’ 96 | Expression* operator()(Parent_Reference*); | ^~~~~~~~ src/operation.hpp:161:7: warning: ‘T Sass::Operation_CRTP::operator()(Sass::ExtendRule*) [with T = Sass::Expression*; D = Sass::Eval]’ was hidden [-Woverloaded-virtual=] 161 | T operator()(ExtendRule* x) { return static_cast(this)->fallback(x); } | ^~~~~~~~ src/eval.hpp:96:17: note: by ‘Sass::Eval::operator()’ 96 | Expression* operator()(Parent_Reference*); | ^~~~~~~~ src/operation.hpp:160:7: warning: ‘T Sass::Operation_CRTP::operator()(Sass::Content*) [with T = Sass::Expression*; D = Sass::Eval]’ was hidden [-Woverloaded-virtual=] 160 | T operator()(Content* x) { return static_cast(this)->fallback(x); } | ^~~~~~~~ src/eval.hpp:96:17: note: by ‘Sass::Eval::operator()’ 96 | Expression* operator()(Parent_Reference*); | ^~~~~~~~ src/operation.hpp:150:7: warning: ‘T Sass::Operation_CRTP::operator()(Sass::Import_Stub*) [with T = Sass::Expression*; D = Sass::Eval]’ was hidden [-Woverloaded-virtual=] 150 | T operator()(Import_Stub* x) { return static_cast(this)->fallback(x); } | ^~~~~~~~ src/eval.hpp:96:17: note: by ‘Sass::Eval::operator()’ 96 | Expression* operator()(Parent_Reference*); | ^~~~~~~~ src/operation.hpp:149:7: warning: ‘T Sass::Operation_CRTP::operator()(Sass::Import*) [with T = Sass::Expression*; D = Sass::Eval]’ was hidden [-Woverloaded-virtual=] 149 | T operator()(Import* x) { return static_cast(this)->fallback(x); } | ^~~~~~~~ src/eval.hpp:96:17: note: by ‘Sass::Eval::operator()’ 96 | Expression* operator()(Parent_Reference*); | ^~~~~~~~ src/operation.hpp:147:7: warning: ‘T Sass::Operation_CRTP::operator()(Sass::Declaration*) [with T = Sass::Expression*; D = Sass::Eval]’ was hidden [-Woverloaded-virtual=] 147 | T operator()(Declaration* x) { return static_cast(this)->fallback(x); } | ^~~~~~~~ src/eval.hpp:96:17: note: by ‘Sass::Eval::operator()’ 96 | Expression* operator()(Parent_Reference*); | ^~~~~~~~ src/operation.hpp:146:7: warning: ‘T Sass::Operation_CRTP::operator()(Sass::Keyframe_Rule*) [with T = Sass::Expression*; D = Sass::Eval]’ was hidden [-Woverloaded-virtual=] 146 | T operator()(Keyframe_Rule* x) { return static_cast(this)->fallback(x); } | ^~~~~~~~ src/eval.hpp:96:17: note: by ‘Sass::Eval::operator()’ 96 | Expression* operator()(Parent_Reference*); | ^~~~~~~~ src/operation.hpp:145:7: warning: ‘T Sass::Operation_CRTP::operator()(Sass::AtRule*) [with T = Sass::Expression*; D = Sass::Eval]’ was hidden [-Woverloaded-virtual=] 145 | T operator()(AtRule* x) { return static_cast(this)->fallback(x); } | ^~~~~~~~ src/eval.hpp:96:17: note: by ‘Sass::Eval::operator()’ 96 | Expression* operator()(Parent_Reference*); | ^~~~~~~~ src/operation.hpp:144:7: warning: ‘T Sass::Operation_CRTP::operator()(Sass::AtRootRule*) [with T = Sass::Expression*; D = Sass::Eval]’ was hidden [-Woverloaded-virtual=] 144 | T operator()(AtRootRule* x) { return static_cast(this)->fallback(x); } | ^~~~~~~~ src/eval.hpp:96:17: note: by ‘Sass::Eval::operator()’ 96 | Expression* operator()(Parent_Reference*); | ^~~~~~~~ src/operation.hpp:143:7: warning: ‘T Sass::Operation_CRTP::operator()(Sass::CssMediaQuery*) [with T = Sass::Expression*; D = Sass::Eval]’ was hidden [-Woverloaded-virtual=] 143 | T operator()(CssMediaQuery* x) { return static_cast(this)->fallback(x); } | ^~~~~~~~ src/eval.hpp:96:17: note: by ‘Sass::Eval::operator()’ 96 | Expression* operator()(Parent_Reference*); | ^~~~~~~~ src/operation.hpp:142:7: warning: ‘T Sass::Operation_CRTP::operator()(Sass::CssMediaRule*) [with T = Sass::Expression*; D = Sass::Eval]’ was hidden [-Woverloaded-virtual=] 142 | T operator()(CssMediaRule* x) { return static_cast(this)->fallback(x); } | ^~~~~~~~ src/eval.hpp:96:17: note: by ‘Sass::Eval::operator()’ 96 | Expression* operator()(Parent_Reference*); | ^~~~~~~~ src/operation.hpp:141:7: warning: ‘T Sass::Operation_CRTP::operator()(Sass::MediaRule*) [with T = Sass::Expression*; D = Sass::Eval]’ was hidden [-Woverloaded-virtual=] 141 | T operator()(MediaRule* x) { return static_cast(this)->fallback(x); } | ^~~~~~~~ src/eval.hpp:96:17: note: by ‘Sass::Eval::operator()’ 96 | Expression* operator()(Parent_Reference*); | ^~~~~~~~ src/operation.hpp:140:7: warning: ‘T Sass::Operation_CRTP::operator()(Sass::SupportsRule*) [with T = Sass::Expression*; D = Sass::Eval]’ was hidden [-Woverloaded-virtual=] 140 | T operator()(SupportsRule* x) { return static_cast(this)->fallback(x); } | ^~~~~~~~ src/eval.hpp:96:17: note: by ‘Sass::Eval::operator()’ 96 | Expression* operator()(Parent_Reference*); | ^~~~~~~~ src/operation.hpp:139:7: warning: ‘T Sass::Operation_CRTP::operator()(Sass::Trace*) [with T = Sass::Expression*; D = Sass::Eval]’ was hidden [-Woverloaded-virtual=] 139 | T operator()(Trace* x) { return static_cast(this)->fallback(x); } | ^~~~~~~~ src/eval.hpp:96:17: note: by ‘Sass::Eval::operator()’ 96 | Expression* operator()(Parent_Reference*); | ^~~~~~~~ src/operation.hpp:138:7: warning: ‘T Sass::Operation_CRTP::operator()(Sass::Bubble*) [with T = Sass::Expression*; D = Sass::Eval]’ was hidden [-Woverloaded-virtual=] 138 | T operator()(Bubble* x) { return static_cast(this)->fallback(x); } | ^~~~~~~~ src/eval.hpp:96:17: note: by ‘Sass::Eval::operator()’ 96 | Expression* operator()(Parent_Reference*); | ^~~~~~~~ src/operation.hpp:137:7: warning: ‘T Sass::Operation_CRTP::operator()(Sass::StyleRule*) [with T = Sass::Expression*; D = Sass::Eval]’ was hidden [-Woverloaded-virtual=] 137 | T operator()(StyleRule* x) { return static_cast(this)->fallback(x); } | ^~~~~~~~ src/eval.hpp:96:17: note: by ‘Sass::Eval::operator()’ 96 | Expression* operator()(Parent_Reference*); | ^~~~~~~~ src/operation.hpp:134:7: warning: ‘T Sass::Operation_CRTP::operator()(Sass::AST_Node*) [with T = Sass::Expression*; D = Sass::Eval]’ was hidden [-Woverloaded-virtual=] 134 | T operator()(AST_Node* x) { return static_cast(this)->fallback(x); } | ^~~~~~~~ src/eval.hpp:96:17: note: by ‘Sass::Eval::operator()’ 96 | Expression* operator()(Parent_Reference*); | ^~~~~~~~ g++ -std=gnu++17 -Wall -O2 -std=c++11 -I ./include -fPIC -c -o src/fn_maps.o src/fn_maps.cpp In file included from src/values.hpp:4, from src/operators.hpp:4, from src/fn_maps.cpp:1: src/ast.hpp:90:18: warning: ‘virtual bool Sass::AST_Node::operator==(const Sass::AST_Node&) const’ was hidden [-Woverloaded-virtual=] 90 | virtual bool operator== (const AST_Node& rhs) const { | ^~~~~~~~ src/ast.hpp:165:18: note: by ‘virtual bool Sass::Expression::operator==(const Sass::Expression&) const’ 165 | virtual bool operator== (const Expression& rhs) const { return false; } | ^~~~~~~~ src/ast.hpp:96:18: warning: ‘virtual bool Sass::AST_Node::operator!=(const Sass::AST_Node&) const’ was hidden [-Woverloaded-virtual=] 96 | virtual bool operator!= (const AST_Node& rhs) const { | ^~~~~~~~ src/ast.hpp:167:17: note: by ‘bool Sass::Expression::operator!=(const Sass::Expression&) const’ 167 | inline bool operator!=(const Expression& rhs) const { return !(rhs == *this); } | ^~~~~~~~ src/ast.hpp:90:18: warning: ‘virtual bool Sass::AST_Node::operator==(const Sass::AST_Node&) const’ was hidden [-Woverloaded-virtual=] 90 | virtual bool operator== (const AST_Node& rhs) const { | ^~~~~~~~ src/ast.hpp:908:10: note: by ‘bool Sass::CssMediaRule::operator==(const Sass::CssMediaRule&) const’ 908 | bool operator== (const CssMediaRule& rhs) const { | ^~~~~~~~ src/ast.hpp:96:18: warning: ‘virtual bool Sass::AST_Node::operator!=(const Sass::AST_Node&) const’ was hidden [-Woverloaded-virtual=] 96 | virtual bool operator!= (const AST_Node& rhs) const { | ^~~~~~~~ src/ast.hpp:911:10: note: by ‘bool Sass::CssMediaRule::operator!=(const Sass::CssMediaRule&) const’ 911 | bool operator!=(const CssMediaRule& rhs) const { | ^~~~~~~~ src/ast.hpp:90:18: warning: ‘virtual bool Sass::AST_Node::operator==(const Sass::AST_Node&) const’ was hidden [-Woverloaded-virtual=] 90 | virtual bool operator== (const AST_Node& rhs) const { | ^~~~~~~~ src/ast.hpp:939:10: note: by ‘bool Sass::CssMediaQuery::operator==(const Sass::CssMediaQuery&) const’ 939 | bool operator== (const CssMediaQuery& rhs) const; | ^~~~~~~~ src/ast.hpp:96:18: warning: ‘virtual bool Sass::AST_Node::operator!=(const Sass::AST_Node&) const’ was hidden [-Woverloaded-virtual=] 96 | virtual bool operator!= (const AST_Node& rhs) const { | ^~~~~~~~ src/ast.hpp:940:10: note: by ‘bool Sass::CssMediaQuery::operator!=(const Sass::CssMediaQuery&) const’ 940 | bool operator!=(const CssMediaQuery& rhs) const { | ^~~~~~~~ src/ast.hpp:165:18: warning: ‘virtual bool Sass::Expression::operator==(const Sass::Expression&) const’ was hidden [-Woverloaded-virtual=] 165 | virtual bool operator== (const Expression& rhs) const { return false; } | ^~~~~~~~ In file included from src/ast.hpp:14: src/ast_def_macros.hpp:105:16: note: by ‘virtual bool Sass::Selector::operator==(const Sass::Selector&) const’ 105 | virtual bool operator==(const klass& rhs) const = 0; \ | ^~~~~~~~ src/ast_selectors.hpp:56:5: note: in expansion of macro ‘ATTACH_VIRTUAL_CMP_OPERATIONS’ 56 | ATTACH_VIRTUAL_CMP_OPERATIONS(Selector) | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~ src/ast.hpp:96:18: warning: ‘virtual bool Sass::AST_Node::operator!=(const Sass::AST_Node&) const’ was hidden [-Woverloaded-virtual=] 96 | virtual bool operator!= (const AST_Node& rhs) const { | ^~~~~~~~ src/ast_def_macros.hpp:106:16: note: by ‘virtual bool Sass::Selector::operator!=(const Sass::Selector&) const’ 106 | virtual bool operator!=(const klass& rhs) const { return !(*this == rhs); }; \ | ^~~~~~~~ src/ast_selectors.hpp:56:5: note: in expansion of macro ‘ATTACH_VIRTUAL_CMP_OPERATIONS’ 56 | ATTACH_VIRTUAL_CMP_OPERATIONS(Selector) | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~ src/ast_def_macros.hpp:106:16: warning: ‘virtual bool Sass::Selector::operator!=(const Sass::Selector&) const’ was hidden [-Woverloaded-virtual=] 106 | virtual bool operator!=(const klass& rhs) const { return !(*this == rhs); }; \ | ^~~~~~~~ src/ast_selectors.hpp:56:5: note: in expansion of macro ‘ATTACH_VIRTUAL_CMP_OPERATIONS’ 56 | ATTACH_VIRTUAL_CMP_OPERATIONS(Selector) | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~ src/ast_def_macros.hpp:106:16: note: by ‘virtual bool Sass::SimpleSelector::operator!=(const Sass::SimpleSelector&) const’ 106 | virtual bool operator!=(const klass& rhs) const { return !(*this == rhs); }; \ | ^~~~~~~~ src/ast_selectors.hpp:139:5: note: in expansion of macro ‘ATTACH_VIRTUAL_CMP_OPERATIONS’ 139 | ATTACH_VIRTUAL_CMP_OPERATIONS(SimpleSelector); | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~ In file included from src/ast.hpp:1055: src/ast_selectors.hpp:137:18: warning: ‘virtual bool Sass::SimpleSelector::operator==(const Sass::CompoundSelector&) const’ was hidden [-Woverloaded-virtual=] 137 | virtual bool operator==(const CompoundSelector& rhs) const; | ^~~~~~~~ src/ast_def_macros.hpp:109:16: note: by ‘Sass::PlaceholderSelector::operator==’ 109 | virtual bool operator==(const klass& rhs) const; \ | ^~~~~~~~ src/ast_selectors.hpp:157:5: note: in expansion of macro ‘ATTACH_CMP_OPERATIONS’ 157 | ATTACH_CMP_OPERATIONS(PlaceholderSelector) | ^~~~~~~~~~~~~~~~~~~~~ src/ast_selectors.hpp:136:18: warning: ‘virtual bool Sass::SimpleSelector::operator==(const Sass::ComplexSelector&) const’ was hidden [-Woverloaded-virtual=] 136 | virtual bool operator==(const ComplexSelector& rhs) const; | ^~~~~~~~ src/ast_def_macros.hpp:109:16: note: by ‘Sass::PlaceholderSelector::operator==’ 109 | virtual bool operator==(const klass& rhs) const; \ | ^~~~~~~~ src/ast_selectors.hpp:157:5: note: in expansion of macro ‘ATTACH_CMP_OPERATIONS’ 157 | ATTACH_CMP_OPERATIONS(PlaceholderSelector) | ^~~~~~~~~~~~~~~~~~~~~ src/ast_selectors.hpp:135:18: warning: ‘virtual bool Sass::SimpleSelector::operator==(const Sass::SelectorList&) const’ was hidden [-Woverloaded-virtual=] 135 | virtual bool operator==(const SelectorList& rhs) const; | ^~~~~~~~ src/ast_def_macros.hpp:109:16: note: by ‘Sass::PlaceholderSelector::operator==’ 109 | virtual bool operator==(const klass& rhs) const; \ | ^~~~~~~~ src/ast_selectors.hpp:157:5: note: in expansion of macro ‘ATTACH_CMP_OPERATIONS’ 157 | ATTACH_CMP_OPERATIONS(PlaceholderSelector) | ^~~~~~~~~~~~~~~~~~~~~ src/ast_selectors.hpp:133:10: warning: ‘virtual bool Sass::SimpleSelector::operator==(const Sass::Selector&) const’ was hidden [-Woverloaded-virtual=] 133 | bool operator==(const Selector& rhs) const final override; | ^~~~~~~~ src/ast_def_macros.hpp:109:16: note: by ‘Sass::PlaceholderSelector::operator==’ 109 | virtual bool operator==(const klass& rhs) const; \ | ^~~~~~~~ src/ast_selectors.hpp:157:5: note: in expansion of macro ‘ATTACH_CMP_OPERATIONS’ 157 | ATTACH_CMP_OPERATIONS(PlaceholderSelector) | ^~~~~~~~~~~~~~~~~~~~~ src/ast_def_macros.hpp:106:16: warning: ‘virtual bool Sass::SimpleSelector::operator!=(const Sass::SimpleSelector&) const’ was hidden [-Woverloaded-virtual=] 106 | virtual bool operator!=(const klass& rhs) const { return !(*this == rhs); }; \ | ^~~~~~~~ src/ast_selectors.hpp:139:5: note: in expansion of macro ‘ATTACH_VIRTUAL_CMP_OPERATIONS’ 139 | ATTACH_VIRTUAL_CMP_OPERATIONS(SimpleSelector); | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~ src/ast_def_macros.hpp:110:16: note: by ‘virtual bool Sass::PlaceholderSelector::operator!=(const Sass::PlaceholderSelector&) const’ 110 | virtual bool operator!=(const klass& rhs) const { return !(*this == rhs); }; \ | ^~~~~~~~ src/ast_selectors.hpp:157:5: note: in expansion of macro ‘ATTACH_CMP_OPERATIONS’ 157 | ATTACH_CMP_OPERATIONS(PlaceholderSelector) | ^~~~~~~~~~~~~~~~~~~~~ src/ast_selectors.hpp:137:18: warning: ‘virtual bool Sass::SimpleSelector::operator==(const Sass::CompoundSelector&) const’ was hidden [-Woverloaded-virtual=] 137 | virtual bool operator==(const CompoundSelector& rhs) const; | ^~~~~~~~ src/ast_def_macros.hpp:109:16: note: by ‘Sass::TypeSelector::operator==’ 109 | virtual bool operator==(const klass& rhs) const; \ | ^~~~~~~~ src/ast_selectors.hpp:174:5: note: in expansion of macro ‘ATTACH_CMP_OPERATIONS’ 174 | ATTACH_CMP_OPERATIONS(TypeSelector) | ^~~~~~~~~~~~~~~~~~~~~ src/ast_selectors.hpp:136:18: warning: ‘virtual bool Sass::SimpleSelector::operator==(const Sass::ComplexSelector&) const’ was hidden [-Woverloaded-virtual=] 136 | virtual bool operator==(const ComplexSelector& rhs) const; | ^~~~~~~~ src/ast_def_macros.hpp:109:16: note: by ‘Sass::TypeSelector::operator==’ 109 | virtual bool operator==(const klass& rhs) const; \ | ^~~~~~~~ src/ast_selectors.hpp:174:5: note: in expansion of macro ‘ATTACH_CMP_OPERATIONS’ 174 | ATTACH_CMP_OPERATIONS(TypeSelector) | ^~~~~~~~~~~~~~~~~~~~~ src/ast_selectors.hpp:135:18: warning: ‘virtual bool Sass::SimpleSelector::operator==(const Sass::SelectorList&) const’ was hidden [-Woverloaded-virtual=] 135 | virtual bool operator==(const SelectorList& rhs) const; | ^~~~~~~~ src/ast_def_macros.hpp:109:16: note: by ‘Sass::TypeSelector::operator==’ 109 | virtual bool operator==(const klass& rhs) const; \ | ^~~~~~~~ src/ast_selectors.hpp:174:5: note: in expansion of macro ‘ATTACH_CMP_OPERATIONS’ 174 | ATTACH_CMP_OPERATIONS(TypeSelector) | ^~~~~~~~~~~~~~~~~~~~~ src/ast_selectors.hpp:133:10: warning: ‘virtual bool Sass::SimpleSelector::operator==(const Sass::Selector&) const’ was hidden [-Woverloaded-virtual=] 133 | bool operator==(const Selector& rhs) const final override; | ^~~~~~~~ src/ast_def_macros.hpp:109:16: note: by ‘Sass::TypeSelector::operator==’ 109 | virtual bool operator==(const klass& rhs) const; \ | ^~~~~~~~ src/ast_selectors.hpp:174:5: note: in expansion of macro ‘ATTACH_CMP_OPERATIONS’ 174 | ATTACH_CMP_OPERATIONS(TypeSelector) | ^~~~~~~~~~~~~~~~~~~~~ src/ast_def_macros.hpp:106:16: warning: ‘virtual bool Sass::SimpleSelector::operator!=(const Sass::SimpleSelector&) const’ was hidden [-Woverloaded-virtual=] 106 | virtual bool operator!=(const klass& rhs) const { return !(*this == rhs); }; \ | ^~~~~~~~ src/ast_selectors.hpp:139:5: note: in expansion of macro ‘ATTACH_VIRTUAL_CMP_OPERATIONS’ 139 | ATTACH_VIRTUAL_CMP_OPERATIONS(SimpleSelector); | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~ src/ast_def_macros.hpp:110:16: note: by ‘virtual bool Sass::TypeSelector::operator!=(const Sass::TypeSelector&) const’ 110 | virtual bool operator!=(const klass& rhs) const { return !(*this == rhs); }; \ | ^~~~~~~~ src/ast_selectors.hpp:174:5: note: in expansion of macro ‘ATTACH_CMP_OPERATIONS’ 174 | ATTACH_CMP_OPERATIONS(TypeSelector) | ^~~~~~~~~~~~~~~~~~~~~ src/ast_selectors.hpp:137:18: warning: ‘virtual bool Sass::SimpleSelector::operator==(const Sass::CompoundSelector&) const’ was hidden [-Woverloaded-virtual=] 137 | virtual bool operator==(const CompoundSelector& rhs) const; | ^~~~~~~~ src/ast_def_macros.hpp:109:16: note: by ‘Sass::ClassSelector::operator==’ 109 | virtual bool operator==(const klass& rhs) const; \ | ^~~~~~~~ src/ast_selectors.hpp:188:5: note: in expansion of macro ‘ATTACH_CMP_OPERATIONS’ 188 | ATTACH_CMP_OPERATIONS(ClassSelector) | ^~~~~~~~~~~~~~~~~~~~~ src/ast_selectors.hpp:136:18: warning: ‘virtual bool Sass::SimpleSelector::operator==(const Sass::ComplexSelector&) const’ was hidden [-Woverloaded-virtual=] 136 | virtual bool operator==(const ComplexSelector& rhs) const; | ^~~~~~~~ src/ast_def_macros.hpp:109:16: note: by ‘Sass::ClassSelector::operator==’ 109 | virtual bool operator==(const klass& rhs) const; \ | ^~~~~~~~ src/ast_selectors.hpp:188:5: note: in expansion of macro ‘ATTACH_CMP_OPERATIONS’ 188 | ATTACH_CMP_OPERATIONS(ClassSelector) | ^~~~~~~~~~~~~~~~~~~~~ src/ast_selectors.hpp:135:18: warning: ‘virtual bool Sass::SimpleSelector::operator==(const Sass::SelectorList&) const’ was hidden [-Woverloaded-virtual=] 135 | virtual bool operator==(const SelectorList& rhs) const; | ^~~~~~~~ src/ast_def_macros.hpp:109:16: note: by ‘Sass::ClassSelector::operator==’ 109 | virtual bool operator==(const klass& rhs) const; \ | ^~~~~~~~ src/ast_selectors.hpp:188:5: note: in expansion of macro ‘ATTACH_CMP_OPERATIONS’ 188 | ATTACH_CMP_OPERATIONS(ClassSelector) | ^~~~~~~~~~~~~~~~~~~~~ src/ast_selectors.hpp:133:10: warning: ‘virtual bool Sass::SimpleSelector::operator==(const Sass::Selector&) const’ was hidden [-Woverloaded-virtual=] 133 | bool operator==(const Selector& rhs) const final override; | ^~~~~~~~ src/ast_def_macros.hpp:109:16: note: by ‘Sass::ClassSelector::operator==’ 109 | virtual bool operator==(const klass& rhs) const; \ | ^~~~~~~~ src/ast_selectors.hpp:188:5: note: in expansion of macro ‘ATTACH_CMP_OPERATIONS’ 188 | ATTACH_CMP_OPERATIONS(ClassSelector) | ^~~~~~~~~~~~~~~~~~~~~ src/ast_def_macros.hpp:106:16: warning: ‘virtual bool Sass::SimpleSelector::operator!=(const Sass::SimpleSelector&) const’ was hidden [-Woverloaded-virtual=] 106 | virtual bool operator!=(const klass& rhs) const { return !(*this == rhs); }; \ | ^~~~~~~~ src/ast_selectors.hpp:139:5: note: in expansion of macro ‘ATTACH_VIRTUAL_CMP_OPERATIONS’ 139 | ATTACH_VIRTUAL_CMP_OPERATIONS(SimpleSelector); | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~ src/ast_def_macros.hpp:110:16: note: by ‘virtual bool Sass::ClassSelector::operator!=(const Sass::ClassSelector&) const’ 110 | virtual bool operator!=(const klass& rhs) const { return !(*this == rhs); }; \ | ^~~~~~~~ src/ast_selectors.hpp:188:5: note: in expansion of macro ‘ATTACH_CMP_OPERATIONS’ 188 | ATTACH_CMP_OPERATIONS(ClassSelector) | ^~~~~~~~~~~~~~~~~~~~~ src/ast_selectors.hpp:137:18: warning: ‘virtual bool Sass::SimpleSelector::operator==(const Sass::CompoundSelector&) const’ was hidden [-Woverloaded-virtual=] 137 | virtual bool operator==(const CompoundSelector& rhs) const; | ^~~~~~~~ src/ast_def_macros.hpp:109:16: note: by ‘Sass::IDSelector::operator==’ 109 | virtual bool operator==(const klass& rhs) const; \ | ^~~~~~~~ src/ast_selectors.hpp:204:5: note: in expansion of macro ‘ATTACH_CMP_OPERATIONS’ 204 | ATTACH_CMP_OPERATIONS(IDSelector) | ^~~~~~~~~~~~~~~~~~~~~ src/ast_selectors.hpp:136:18: warning: ‘virtual bool Sass::SimpleSelector::operator==(const Sass::ComplexSelector&) const’ was hidden [-Woverloaded-virtual=] 136 | virtual bool operator==(const ComplexSelector& rhs) const; | ^~~~~~~~ src/ast_def_macros.hpp:109:16: note: by ‘Sass::IDSelector::operator==’ 109 | virtual bool operator==(const klass& rhs) const; \ | ^~~~~~~~ src/ast_selectors.hpp:204:5: note: in expansion of macro ‘ATTACH_CMP_OPERATIONS’ 204 | ATTACH_CMP_OPERATIONS(IDSelector) | ^~~~~~~~~~~~~~~~~~~~~ src/ast_selectors.hpp:135:18: warning: ‘virtual bool Sass::SimpleSelector::operator==(const Sass::SelectorList&) const’ was hidden [-Woverloaded-virtual=] 135 | virtual bool operator==(const SelectorList& rhs) const; | ^~~~~~~~ src/ast_def_macros.hpp:109:16: note: by ‘Sass::IDSelector::operator==’ 109 | virtual bool operator==(const klass& rhs) const; \ | ^~~~~~~~ src/ast_selectors.hpp:204:5: note: in expansion of macro ‘ATTACH_CMP_OPERATIONS’ 204 | ATTACH_CMP_OPERATIONS(IDSelector) | ^~~~~~~~~~~~~~~~~~~~~ src/ast_selectors.hpp:133:10: warning: ‘virtual bool Sass::SimpleSelector::operator==(const Sass::Selector&) const’ was hidden [-Woverloaded-virtual=] 133 | bool operator==(const Selector& rhs) const final override; | ^~~~~~~~ src/ast_def_macros.hpp:109:16: note: by ‘Sass::IDSelector::operator==’ 109 | virtual bool operator==(const klass& rhs) const; \ | ^~~~~~~~ src/ast_selectors.hpp:204:5: note: in expansion of macro ‘ATTACH_CMP_OPERATIONS’ 204 | ATTACH_CMP_OPERATIONS(IDSelector) | ^~~~~~~~~~~~~~~~~~~~~ src/ast_def_macros.hpp:106:16: warning: ‘virtual bool Sass::SimpleSelector::operator!=(const Sass::SimpleSelector&) const’ was hidden [-Woverloaded-virtual=] 106 | virtual bool operator!=(const klass& rhs) const { return !(*this == rhs); }; \ | ^~~~~~~~ src/ast_selectors.hpp:139:5: note: in expansion of macro ‘ATTACH_VIRTUAL_CMP_OPERATIONS’ 139 | ATTACH_VIRTUAL_CMP_OPERATIONS(SimpleSelector); | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~ src/ast_def_macros.hpp:110:16: note: by ‘virtual bool Sass::IDSelector::operator!=(const Sass::IDSelector&) const’ 110 | virtual bool operator!=(const klass& rhs) const { return !(*this == rhs); }; \ | ^~~~~~~~ src/ast_selectors.hpp:204:5: note: in expansion of macro ‘ATTACH_CMP_OPERATIONS’ 204 | ATTACH_CMP_OPERATIONS(IDSelector) | ^~~~~~~~~~~~~~~~~~~~~ src/ast_selectors.hpp:137:18: warning: ‘virtual bool Sass::SimpleSelector::operator==(const Sass::CompoundSelector&) const’ was hidden [-Woverloaded-virtual=] 137 | virtual bool operator==(const CompoundSelector& rhs) const; | ^~~~~~~~ src/ast_def_macros.hpp:109:16: note: by ‘Sass::AttributeSelector::operator==’ 109 | virtual bool operator==(const klass& rhs) const; \ | ^~~~~~~~ src/ast_selectors.hpp:223:5: note: in expansion of macro ‘ATTACH_CMP_OPERATIONS’ 223 | ATTACH_CMP_OPERATIONS(AttributeSelector) | ^~~~~~~~~~~~~~~~~~~~~ src/ast_selectors.hpp:136:18: warning: ‘virtual bool Sass::SimpleSelector::operator==(const Sass::ComplexSelector&) const’ was hidden [-Woverloaded-virtual=] 136 | virtual bool operator==(const ComplexSelector& rhs) const; | ^~~~~~~~ src/ast_def_macros.hpp:109:16: note: by ‘Sass::AttributeSelector::operator==’ 109 | virtual bool operator==(const klass& rhs) const; \ | ^~~~~~~~ src/ast_selectors.hpp:223:5: note: in expansion of macro ‘ATTACH_CMP_OPERATIONS’ 223 | ATTACH_CMP_OPERATIONS(AttributeSelector) | ^~~~~~~~~~~~~~~~~~~~~ src/ast_selectors.hpp:135:18: warning: ‘virtual bool Sass::SimpleSelector::operator==(const Sass::SelectorList&) const’ was hidden [-Woverloaded-virtual=] 135 | virtual bool operator==(const SelectorList& rhs) const; | ^~~~~~~~ src/ast_def_macros.hpp:109:16: note: by ‘Sass::AttributeSelector::operator==’ 109 | virtual bool operator==(const klass& rhs) const; \ | ^~~~~~~~ src/ast_selectors.hpp:223:5: note: in expansion of macro ‘ATTACH_CMP_OPERATIONS’ 223 | ATTACH_CMP_OPERATIONS(AttributeSelector) | ^~~~~~~~~~~~~~~~~~~~~ src/ast_selectors.hpp:133:10: warning: ‘virtual bool Sass::SimpleSelector::operator==(const Sass::Selector&) const’ was hidden [-Woverloaded-virtual=] 133 | bool operator==(const Selector& rhs) const final override; | ^~~~~~~~ src/ast_def_macros.hpp:109:16: note: by ‘Sass::AttributeSelector::operator==’ 109 | virtual bool operator==(const klass& rhs) const; \ | ^~~~~~~~ src/ast_selectors.hpp:223:5: note: in expansion of macro ‘ATTACH_CMP_OPERATIONS’ 223 | ATTACH_CMP_OPERATIONS(AttributeSelector) | ^~~~~~~~~~~~~~~~~~~~~ src/ast_def_macros.hpp:106:16: warning: ‘virtual bool Sass::SimpleSelector::operator!=(const Sass::SimpleSelector&) const’ was hidden [-Woverloaded-virtual=] 106 | virtual bool operator!=(const klass& rhs) const { return !(*this == rhs); }; \ | ^~~~~~~~ src/ast_selectors.hpp:139:5: note: in expansion of macro ‘ATTACH_VIRTUAL_CMP_OPERATIONS’ 139 | ATTACH_VIRTUAL_CMP_OPERATIONS(SimpleSelector); | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~ src/ast_def_macros.hpp:110:16: note: by ‘virtual bool Sass::AttributeSelector::operator!=(const Sass::AttributeSelector&) const’ 110 | virtual bool operator!=(const klass& rhs) const { return !(*this == rhs); }; \ | ^~~~~~~~ src/ast_selectors.hpp:223:5: note: in expansion of macro ‘ATTACH_CMP_OPERATIONS’ 223 | ATTACH_CMP_OPERATIONS(AttributeSelector) | ^~~~~~~~~~~~~~~~~~~~~ src/ast_def_macros.hpp:106:16: warning: ‘virtual bool Sass::Selector::operator!=(const Sass::Selector&) const’ was hidden [-Woverloaded-virtual=] 106 | virtual bool operator!=(const klass& rhs) const { return !(*this == rhs); }; \ | ^~~~~~~~ src/ast_selectors.hpp:56:5: note: in expansion of macro ‘ATTACH_VIRTUAL_CMP_OPERATIONS’ 56 | ATTACH_VIRTUAL_CMP_OPERATIONS(Selector) | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~ src/ast_def_macros.hpp:110:16: note: by ‘virtual bool Sass::ComplexSelector::operator!=(const Sass::ComplexSelector&) const’ 110 | virtual bool operator!=(const klass& rhs) const { return !(*this == rhs); }; \ | ^~~~~~~~ src/ast_selectors.hpp:310:5: note: in expansion of macro ‘ATTACH_CMP_OPERATIONS’ 310 | ATTACH_CMP_OPERATIONS(ComplexSelector) | ^~~~~~~~~~~~~~~~~~~~~ src/ast_def_macros.hpp:106:16: warning: ‘virtual bool Sass::Selector::operator!=(const Sass::Selector&) const’ was hidden [-Woverloaded-virtual=] 106 | virtual bool operator!=(const klass& rhs) const { return !(*this == rhs); }; \ | ^~~~~~~~ src/ast_selectors.hpp:56:5: note: in expansion of macro ‘ATTACH_VIRTUAL_CMP_OPERATIONS’ 56 | ATTACH_VIRTUAL_CMP_OPERATIONS(Selector) | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~ src/ast_def_macros.hpp:106:16: note: by ‘virtual bool Sass::SelectorComponent::operator!=(const Sass::SelectorComponent&) const’ 106 | virtual bool operator!=(const klass& rhs) const { return !(*this == rhs); }; \ | ^~~~~~~~ src/ast_selectors.hpp:349:5: note: in expansion of macro ‘ATTACH_VIRTUAL_CMP_OPERATIONS’ 349 | ATTACH_VIRTUAL_CMP_OPERATIONS(SelectorComponent); | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~ src/ast_def_macros.hpp:106:16: warning: ‘virtual bool Sass::SelectorComponent::operator!=(const Sass::SelectorComponent&) const’ was hidden [-Woverloaded-virtual=] 106 | virtual bool operator!=(const klass& rhs) const { return !(*this == rhs); }; \ | ^~~~~~~~ src/ast_selectors.hpp:349:5: note: in expansion of macro ‘ATTACH_VIRTUAL_CMP_OPERATIONS’ 349 | ATTACH_VIRTUAL_CMP_OPERATIONS(SelectorComponent); | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~ src/ast_def_macros.hpp:110:16: note: by ‘virtual bool Sass::SelectorCombinator::operator!=(const Sass::SelectorCombinator&) const’ 110 | virtual bool operator!=(const klass& rhs) const { return !(*this == rhs); }; \ | ^~~~~~~~ src/ast_selectors.hpp:407:5: note: in expansion of macro ‘ATTACH_CMP_OPERATIONS’ 407 | ATTACH_CMP_OPERATIONS(SelectorCombinator) | ^~~~~~~~~~~~~~~~~~~~~ g++ -std=gnu++17 -Wall -O2 -std=c++11 -I ./include -fPIC -c -o src/fn_lists.o src/fn_lists.cpp In file included from src/values.hpp:4, from src/operators.hpp:4, from src/fn_lists.cpp:6: src/ast.hpp:90:18: warning: ‘virtual bool Sass::AST_Node::operator==(const Sass::AST_Node&) const’ was hidden [-Woverloaded-virtual=] 90 | virtual bool operator== (const AST_Node& rhs) const { | ^~~~~~~~ src/ast.hpp:165:18: note: by ‘virtual bool Sass::Expression::operator==(const Sass::Expression&) const’ 165 | virtual bool operator== (const Expression& rhs) const { return false; } | ^~~~~~~~ src/ast.hpp:96:18: warning: ‘virtual bool Sass::AST_Node::operator!=(const Sass::AST_Node&) const’ was hidden [-Woverloaded-virtual=] 96 | virtual bool operator!= (const AST_Node& rhs) const { | ^~~~~~~~ src/ast.hpp:167:17: note: by ‘bool Sass::Expression::operator!=(const Sass::Expression&) const’ 167 | inline bool operator!=(const Expression& rhs) const { return !(rhs == *this); } | ^~~~~~~~ src/ast.hpp:90:18: warning: ‘virtual bool Sass::AST_Node::operator==(const Sass::AST_Node&) const’ was hidden [-Woverloaded-virtual=] 90 | virtual bool operator== (const AST_Node& rhs) const { | ^~~~~~~~ src/ast.hpp:908:10: note: by ‘bool Sass::CssMediaRule::operator==(const Sass::CssMediaRule&) const’ 908 | bool operator== (const CssMediaRule& rhs) const { | ^~~~~~~~ src/ast.hpp:96:18: warning: ‘virtual bool Sass::AST_Node::operator!=(const Sass::AST_Node&) const’ was hidden [-Woverloaded-virtual=] 96 | virtual bool operator!= (const AST_Node& rhs) const { | ^~~~~~~~ src/ast.hpp:911:10: note: by ‘bool Sass::CssMediaRule::operator!=(const Sass::CssMediaRule&) const’ 911 | bool operator!=(const CssMediaRule& rhs) const { | ^~~~~~~~ src/ast.hpp:90:18: warning: ‘virtual bool Sass::AST_Node::operator==(const Sass::AST_Node&) const’ was hidden [-Woverloaded-virtual=] 90 | virtual bool operator== (const AST_Node& rhs) const { | ^~~~~~~~ src/ast.hpp:939:10: note: by ‘bool Sass::CssMediaQuery::operator==(const Sass::CssMediaQuery&) const’ 939 | bool operator== (const CssMediaQuery& rhs) const; | ^~~~~~~~ src/ast.hpp:96:18: warning: ‘virtual bool Sass::AST_Node::operator!=(const Sass::AST_Node&) const’ was hidden [-Woverloaded-virtual=] 96 | virtual bool operator!= (const AST_Node& rhs) const { | ^~~~~~~~ src/ast.hpp:940:10: note: by ‘bool Sass::CssMediaQuery::operator!=(const Sass::CssMediaQuery&) const’ 940 | bool operator!=(const CssMediaQuery& rhs) const { | ^~~~~~~~ src/ast.hpp:165:18: warning: ‘virtual bool Sass::Expression::operator==(const Sass::Expression&) const’ was hidden [-Woverloaded-virtual=] 165 | virtual bool operator== (const Expression& rhs) const { return false; } | ^~~~~~~~ In file included from src/operation.hpp:15, from src/listize.hpp:9, from src/fn_lists.cpp:5: src/ast_def_macros.hpp:105:16: note: by ‘virtual bool Sass::Selector::operator==(const Sass::Selector&) const’ 105 | virtual bool operator==(const klass& rhs) const = 0; \ | ^~~~~~~~ src/ast_selectors.hpp:56:5: note: in expansion of macro ‘ATTACH_VIRTUAL_CMP_OPERATIONS’ 56 | ATTACH_VIRTUAL_CMP_OPERATIONS(Selector) | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~ src/ast.hpp:96:18: warning: ‘virtual bool Sass::AST_Node::operator!=(const Sass::AST_Node&) const’ was hidden [-Woverloaded-virtual=] 96 | virtual bool operator!= (const AST_Node& rhs) const { | ^~~~~~~~ src/ast_def_macros.hpp:106:16: note: by ‘virtual bool Sass::Selector::operator!=(const Sass::Selector&) const’ 106 | virtual bool operator!=(const klass& rhs) const { return !(*this == rhs); }; \ | ^~~~~~~~ src/ast_selectors.hpp:56:5: note: in expansion of macro ‘ATTACH_VIRTUAL_CMP_OPERATIONS’ 56 | ATTACH_VIRTUAL_CMP_OPERATIONS(Selector) | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~ src/ast_def_macros.hpp:106:16: warning: ‘virtual bool Sass::Selector::operator!=(const Sass::Selector&) const’ was hidden [-Woverloaded-virtual=] 106 | virtual bool operator!=(const klass& rhs) const { return !(*this == rhs); }; \ | ^~~~~~~~ src/ast_selectors.hpp:56:5: note: in expansion of macro ‘ATTACH_VIRTUAL_CMP_OPERATIONS’ 56 | ATTACH_VIRTUAL_CMP_OPERATIONS(Selector) | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~ src/ast_def_macros.hpp:106:16: note: by ‘virtual bool Sass::SimpleSelector::operator!=(const Sass::SimpleSelector&) const’ 106 | virtual bool operator!=(const klass& rhs) const { return !(*this == rhs); }; \ | ^~~~~~~~ src/ast_selectors.hpp:139:5: note: in expansion of macro ‘ATTACH_VIRTUAL_CMP_OPERATIONS’ 139 | ATTACH_VIRTUAL_CMP_OPERATIONS(SimpleSelector); | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~ In file included from src/ast.hpp:1055: src/ast_selectors.hpp:137:18: warning: ‘virtual bool Sass::SimpleSelector::operator==(const Sass::CompoundSelector&) const’ was hidden [-Woverloaded-virtual=] 137 | virtual bool operator==(const CompoundSelector& rhs) const; | ^~~~~~~~ src/ast_def_macros.hpp:109:16: note: by ‘Sass::PlaceholderSelector::operator==’ 109 | virtual bool operator==(const klass& rhs) const; \ | ^~~~~~~~ src/ast_selectors.hpp:157:5: note: in expansion of macro ‘ATTACH_CMP_OPERATIONS’ 157 | ATTACH_CMP_OPERATIONS(PlaceholderSelector) | ^~~~~~~~~~~~~~~~~~~~~ src/ast_selectors.hpp:136:18: warning: ‘virtual bool Sass::SimpleSelector::operator==(const Sass::ComplexSelector&) const’ was hidden [-Woverloaded-virtual=] 136 | virtual bool operator==(const ComplexSelector& rhs) const; | ^~~~~~~~ src/ast_def_macros.hpp:109:16: note: by ‘Sass::PlaceholderSelector::operator==’ 109 | virtual bool operator==(const klass& rhs) const; \ | ^~~~~~~~ src/ast_selectors.hpp:157:5: note: in expansion of macro ‘ATTACH_CMP_OPERATIONS’ 157 | ATTACH_CMP_OPERATIONS(PlaceholderSelector) | ^~~~~~~~~~~~~~~~~~~~~ src/ast_selectors.hpp:135:18: warning: ‘virtual bool Sass::SimpleSelector::operator==(const Sass::SelectorList&) const’ was hidden [-Woverloaded-virtual=] 135 | virtual bool operator==(const SelectorList& rhs) const; | ^~~~~~~~ src/ast_def_macros.hpp:109:16: note: by ‘Sass::PlaceholderSelector::operator==’ 109 | virtual bool operator==(const klass& rhs) const; \ | ^~~~~~~~ src/ast_selectors.hpp:157:5: note: in expansion of macro ‘ATTACH_CMP_OPERATIONS’ 157 | ATTACH_CMP_OPERATIONS(PlaceholderSelector) | ^~~~~~~~~~~~~~~~~~~~~ src/ast_selectors.hpp:133:10: warning: ‘virtual bool Sass::SimpleSelector::operator==(const Sass::Selector&) const’ was hidden [-Woverloaded-virtual=] 133 | bool operator==(const Selector& rhs) const final override; | ^~~~~~~~ src/ast_def_macros.hpp:109:16: note: by ‘Sass::PlaceholderSelector::operator==’ 109 | virtual bool operator==(const klass& rhs) const; \ | ^~~~~~~~ src/ast_selectors.hpp:157:5: note: in expansion of macro ‘ATTACH_CMP_OPERATIONS’ 157 | ATTACH_CMP_OPERATIONS(PlaceholderSelector) | ^~~~~~~~~~~~~~~~~~~~~ src/ast_def_macros.hpp:106:16: warning: ‘virtual bool Sass::SimpleSelector::operator!=(const Sass::SimpleSelector&) const’ was hidden [-Woverloaded-virtual=] 106 | virtual bool operator!=(const klass& rhs) const { return !(*this == rhs); }; \ | ^~~~~~~~ src/ast_selectors.hpp:139:5: note: in expansion of macro ‘ATTACH_VIRTUAL_CMP_OPERATIONS’ 139 | ATTACH_VIRTUAL_CMP_OPERATIONS(SimpleSelector); | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~ src/ast_def_macros.hpp:110:16: note: by ‘virtual bool Sass::PlaceholderSelector::operator!=(const Sass::PlaceholderSelector&) const’ 110 | virtual bool operator!=(const klass& rhs) const { return !(*this == rhs); }; \ | ^~~~~~~~ src/ast_selectors.hpp:157:5: note: in expansion of macro ‘ATTACH_CMP_OPERATIONS’ 157 | ATTACH_CMP_OPERATIONS(PlaceholderSelector) | ^~~~~~~~~~~~~~~~~~~~~ src/ast_selectors.hpp:137:18: warning: ‘virtual bool Sass::SimpleSelector::operator==(const Sass::CompoundSelector&) const’ was hidden [-Woverloaded-virtual=] 137 | virtual bool operator==(const CompoundSelector& rhs) const; | ^~~~~~~~ src/ast_def_macros.hpp:109:16: note: by ‘Sass::TypeSelector::operator==’ 109 | virtual bool operator==(const klass& rhs) const; \ | ^~~~~~~~ src/ast_selectors.hpp:174:5: note: in expansion of macro ‘ATTACH_CMP_OPERATIONS’ 174 | ATTACH_CMP_OPERATIONS(TypeSelector) | ^~~~~~~~~~~~~~~~~~~~~ src/ast_selectors.hpp:136:18: warning: ‘virtual bool Sass::SimpleSelector::operator==(const Sass::ComplexSelector&) const’ was hidden [-Woverloaded-virtual=] 136 | virtual bool operator==(const ComplexSelector& rhs) const; | ^~~~~~~~ src/ast_def_macros.hpp:109:16: note: by ‘Sass::TypeSelector::operator==’ 109 | virtual bool operator==(const klass& rhs) const; \ | ^~~~~~~~ src/ast_selectors.hpp:174:5: note: in expansion of macro ‘ATTACH_CMP_OPERATIONS’ 174 | ATTACH_CMP_OPERATIONS(TypeSelector) | ^~~~~~~~~~~~~~~~~~~~~ src/ast_selectors.hpp:135:18: warning: ‘virtual bool Sass::SimpleSelector::operator==(const Sass::SelectorList&) const’ was hidden [-Woverloaded-virtual=] 135 | virtual bool operator==(const SelectorList& rhs) const; | ^~~~~~~~ src/ast_def_macros.hpp:109:16: note: by ‘Sass::TypeSelector::operator==’ 109 | virtual bool operator==(const klass& rhs) const; \ | ^~~~~~~~ src/ast_selectors.hpp:174:5: note: in expansion of macro ‘ATTACH_CMP_OPERATIONS’ 174 | ATTACH_CMP_OPERATIONS(TypeSelector) | ^~~~~~~~~~~~~~~~~~~~~ src/ast_selectors.hpp:133:10: warning: ‘virtual bool Sass::SimpleSelector::operator==(const Sass::Selector&) const’ was hidden [-Woverloaded-virtual=] 133 | bool operator==(const Selector& rhs) const final override; | ^~~~~~~~ src/ast_def_macros.hpp:109:16: note: by ‘Sass::TypeSelector::operator==’ 109 | virtual bool operator==(const klass& rhs) const; \ | ^~~~~~~~ src/ast_selectors.hpp:174:5: note: in expansion of macro ‘ATTACH_CMP_OPERATIONS’ 174 | ATTACH_CMP_OPERATIONS(TypeSelector) | ^~~~~~~~~~~~~~~~~~~~~ src/ast_def_macros.hpp:106:16: warning: ‘virtual bool Sass::SimpleSelector::operator!=(const Sass::SimpleSelector&) const’ was hidden [-Woverloaded-virtual=] 106 | virtual bool operator!=(const klass& rhs) const { return !(*this == rhs); }; \ | ^~~~~~~~ src/ast_selectors.hpp:139:5: note: in expansion of macro ‘ATTACH_VIRTUAL_CMP_OPERATIONS’ 139 | ATTACH_VIRTUAL_CMP_OPERATIONS(SimpleSelector); | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~ src/ast_def_macros.hpp:110:16: note: by ‘virtual bool Sass::TypeSelector::operator!=(const Sass::TypeSelector&) const’ 110 | virtual bool operator!=(const klass& rhs) const { return !(*this == rhs); }; \ | ^~~~~~~~ src/ast_selectors.hpp:174:5: note: in expansion of macro ‘ATTACH_CMP_OPERATIONS’ 174 | ATTACH_CMP_OPERATIONS(TypeSelector) | ^~~~~~~~~~~~~~~~~~~~~ src/ast_selectors.hpp:137:18: warning: ‘virtual bool Sass::SimpleSelector::operator==(const Sass::CompoundSelector&) const’ was hidden [-Woverloaded-virtual=] 137 | virtual bool operator==(const CompoundSelector& rhs) const; | ^~~~~~~~ src/ast_def_macros.hpp:109:16: note: by ‘Sass::ClassSelector::operator==’ 109 | virtual bool operator==(const klass& rhs) const; \ | ^~~~~~~~ src/ast_selectors.hpp:188:5: note: in expansion of macro ‘ATTACH_CMP_OPERATIONS’ 188 | ATTACH_CMP_OPERATIONS(ClassSelector) | ^~~~~~~~~~~~~~~~~~~~~ src/ast_selectors.hpp:136:18: warning: ‘virtual bool Sass::SimpleSelector::operator==(const Sass::ComplexSelector&) const’ was hidden [-Woverloaded-virtual=] 136 | virtual bool operator==(const ComplexSelector& rhs) const; | ^~~~~~~~ src/ast_def_macros.hpp:109:16: note: by ‘Sass::ClassSelector::operator==’ 109 | virtual bool operator==(const klass& rhs) const; \ | ^~~~~~~~ src/ast_selectors.hpp:188:5: note: in expansion of macro ‘ATTACH_CMP_OPERATIONS’ 188 | ATTACH_CMP_OPERATIONS(ClassSelector) | ^~~~~~~~~~~~~~~~~~~~~ src/ast_selectors.hpp:135:18: warning: ‘virtual bool Sass::SimpleSelector::operator==(const Sass::SelectorList&) const’ was hidden [-Woverloaded-virtual=] 135 | virtual bool operator==(const SelectorList& rhs) const; | ^~~~~~~~ src/ast_def_macros.hpp:109:16: note: by ‘Sass::ClassSelector::operator==’ 109 | virtual bool operator==(const klass& rhs) const; \ | ^~~~~~~~ src/ast_selectors.hpp:188:5: note: in expansion of macro ‘ATTACH_CMP_OPERATIONS’ 188 | ATTACH_CMP_OPERATIONS(ClassSelector) | ^~~~~~~~~~~~~~~~~~~~~ src/ast_selectors.hpp:133:10: warning: ‘virtual bool Sass::SimpleSelector::operator==(const Sass::Selector&) const’ was hidden [-Woverloaded-virtual=] 133 | bool operator==(const Selector& rhs) const final override; | ^~~~~~~~ src/ast_def_macros.hpp:109:16: note: by ‘Sass::ClassSelector::operator==’ 109 | virtual bool operator==(const klass& rhs) const; \ | ^~~~~~~~ src/ast_selectors.hpp:188:5: note: in expansion of macro ‘ATTACH_CMP_OPERATIONS’ 188 | ATTACH_CMP_OPERATIONS(ClassSelector) | ^~~~~~~~~~~~~~~~~~~~~ src/ast_def_macros.hpp:106:16: warning: ‘virtual bool Sass::SimpleSelector::operator!=(const Sass::SimpleSelector&) const’ was hidden [-Woverloaded-virtual=] 106 | virtual bool operator!=(const klass& rhs) const { return !(*this == rhs); }; \ | ^~~~~~~~ src/ast_selectors.hpp:139:5: note: in expansion of macro ‘ATTACH_VIRTUAL_CMP_OPERATIONS’ 139 | ATTACH_VIRTUAL_CMP_OPERATIONS(SimpleSelector); | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~ src/ast_def_macros.hpp:110:16: note: by ‘virtual bool Sass::ClassSelector::operator!=(const Sass::ClassSelector&) const’ 110 | virtual bool operator!=(const klass& rhs) const { return !(*this == rhs); }; \ | ^~~~~~~~ src/ast_selectors.hpp:188:5: note: in expansion of macro ‘ATTACH_CMP_OPERATIONS’ 188 | ATTACH_CMP_OPERATIONS(ClassSelector) | ^~~~~~~~~~~~~~~~~~~~~ src/ast_selectors.hpp:137:18: warning: ‘virtual bool Sass::SimpleSelector::operator==(const Sass::CompoundSelector&) const’ was hidden [-Woverloaded-virtual=] 137 | virtual bool operator==(const CompoundSelector& rhs) const; | ^~~~~~~~ src/ast_def_macros.hpp:109:16: note: by ‘Sass::IDSelector::operator==’ 109 | virtual bool operator==(const klass& rhs) const; \ | ^~~~~~~~ src/ast_selectors.hpp:204:5: note: in expansion of macro ‘ATTACH_CMP_OPERATIONS’ 204 | ATTACH_CMP_OPERATIONS(IDSelector) | ^~~~~~~~~~~~~~~~~~~~~ src/ast_selectors.hpp:136:18: warning: ‘virtual bool Sass::SimpleSelector::operator==(const Sass::ComplexSelector&) const’ was hidden [-Woverloaded-virtual=] 136 | virtual bool operator==(const ComplexSelector& rhs) const; | ^~~~~~~~ src/ast_def_macros.hpp:109:16: note: by ‘Sass::IDSelector::operator==’ 109 | virtual bool operator==(const klass& rhs) const; \ | ^~~~~~~~ src/ast_selectors.hpp:204:5: note: in expansion of macro ‘ATTACH_CMP_OPERATIONS’ 204 | ATTACH_CMP_OPERATIONS(IDSelector) | ^~~~~~~~~~~~~~~~~~~~~ src/ast_selectors.hpp:135:18: warning: ‘virtual bool Sass::SimpleSelector::operator==(const Sass::SelectorList&) const’ was hidden [-Woverloaded-virtual=] 135 | virtual bool operator==(const SelectorList& rhs) const; | ^~~~~~~~ src/ast_def_macros.hpp:109:16: note: by ‘Sass::IDSelector::operator==’ 109 | virtual bool operator==(const klass& rhs) const; \ | ^~~~~~~~ src/ast_selectors.hpp:204:5: note: in expansion of macro ‘ATTACH_CMP_OPERATIONS’ 204 | ATTACH_CMP_OPERATIONS(IDSelector) | ^~~~~~~~~~~~~~~~~~~~~ src/ast_selectors.hpp:133:10: warning: ‘virtual bool Sass::SimpleSelector::operator==(const Sass::Selector&) const’ was hidden [-Woverloaded-virtual=] 133 | bool operator==(const Selector& rhs) const final override; | ^~~~~~~~ src/ast_def_macros.hpp:109:16: note: by ‘Sass::IDSelector::operator==’ 109 | virtual bool operator==(const klass& rhs) const; \ | ^~~~~~~~ src/ast_selectors.hpp:204:5: note: in expansion of macro ‘ATTACH_CMP_OPERATIONS’ 204 | ATTACH_CMP_OPERATIONS(IDSelector) | ^~~~~~~~~~~~~~~~~~~~~ src/ast_def_macros.hpp:106:16: warning: ‘virtual bool Sass::SimpleSelector::operator!=(const Sass::SimpleSelector&) const’ was hidden [-Woverloaded-virtual=] 106 | virtual bool operator!=(const klass& rhs) const { return !(*this == rhs); }; \ | ^~~~~~~~ src/ast_selectors.hpp:139:5: note: in expansion of macro ‘ATTACH_VIRTUAL_CMP_OPERATIONS’ 139 | ATTACH_VIRTUAL_CMP_OPERATIONS(SimpleSelector); | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~ src/ast_def_macros.hpp:110:16: note: by ‘virtual bool Sass::IDSelector::operator!=(const Sass::IDSelector&) const’ 110 | virtual bool operator!=(const klass& rhs) const { return !(*this == rhs); }; \ | ^~~~~~~~ src/ast_selectors.hpp:204:5: note: in expansion of macro ‘ATTACH_CMP_OPERATIONS’ 204 | ATTACH_CMP_OPERATIONS(IDSelector) | ^~~~~~~~~~~~~~~~~~~~~ src/ast_selectors.hpp:137:18: warning: ‘virtual bool Sass::SimpleSelector::operator==(const Sass::CompoundSelector&) const’ was hidden [-Woverloaded-virtual=] 137 | virtual bool operator==(const CompoundSelector& rhs) const; | ^~~~~~~~ src/ast_def_macros.hpp:109:16: note: by ‘Sass::AttributeSelector::operator==’ 109 | virtual bool operator==(const klass& rhs) const; \ | ^~~~~~~~ src/ast_selectors.hpp:223:5: note: in expansion of macro ‘ATTACH_CMP_OPERATIONS’ 223 | ATTACH_CMP_OPERATIONS(AttributeSelector) | ^~~~~~~~~~~~~~~~~~~~~ src/ast_selectors.hpp:136:18: warning: ‘virtual bool Sass::SimpleSelector::operator==(const Sass::ComplexSelector&) const’ was hidden [-Woverloaded-virtual=] 136 | virtual bool operator==(const ComplexSelector& rhs) const; | ^~~~~~~~ src/ast_def_macros.hpp:109:16: note: by ‘Sass::AttributeSelector::operator==’ 109 | virtual bool operator==(const klass& rhs) const; \ | ^~~~~~~~ src/ast_selectors.hpp:223:5: note: in expansion of macro ‘ATTACH_CMP_OPERATIONS’ 223 | ATTACH_CMP_OPERATIONS(AttributeSelector) | ^~~~~~~~~~~~~~~~~~~~~ src/ast_selectors.hpp:135:18: warning: ‘virtual bool Sass::SimpleSelector::operator==(const Sass::SelectorList&) const’ was hidden [-Woverloaded-virtual=] 135 | virtual bool operator==(const SelectorList& rhs) const; | ^~~~~~~~ src/ast_def_macros.hpp:109:16: note: by ‘Sass::AttributeSelector::operator==’ 109 | virtual bool operator==(const klass& rhs) const; \ | ^~~~~~~~ src/ast_selectors.hpp:223:5: note: in expansion of macro ‘ATTACH_CMP_OPERATIONS’ 223 | ATTACH_CMP_OPERATIONS(AttributeSelector) | ^~~~~~~~~~~~~~~~~~~~~ src/ast_selectors.hpp:133:10: warning: ‘virtual bool Sass::SimpleSelector::operator==(const Sass::Selector&) const’ was hidden [-Woverloaded-virtual=] 133 | bool operator==(const Selector& rhs) const final override; | ^~~~~~~~ src/ast_def_macros.hpp:109:16: note: by ‘Sass::AttributeSelector::operator==’ 109 | virtual bool operator==(const klass& rhs) const; \ | ^~~~~~~~ src/ast_selectors.hpp:223:5: note: in expansion of macro ‘ATTACH_CMP_OPERATIONS’ 223 | ATTACH_CMP_OPERATIONS(AttributeSelector) | ^~~~~~~~~~~~~~~~~~~~~ src/ast_def_macros.hpp:106:16: warning: ‘virtual bool Sass::SimpleSelector::operator!=(const Sass::SimpleSelector&) const’ was hidden [-Woverloaded-virtual=] 106 | virtual bool operator!=(const klass& rhs) const { return !(*this == rhs); }; \ | ^~~~~~~~ src/ast_selectors.hpp:139:5: note: in expansion of macro ‘ATTACH_VIRTUAL_CMP_OPERATIONS’ 139 | ATTACH_VIRTUAL_CMP_OPERATIONS(SimpleSelector); | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~ src/ast_def_macros.hpp:110:16: note: by ‘virtual bool Sass::AttributeSelector::operator!=(const Sass::AttributeSelector&) const’ 110 | virtual bool operator!=(const klass& rhs) const { return !(*this == rhs); }; \ | ^~~~~~~~ src/ast_selectors.hpp:223:5: note: in expansion of macro ‘ATTACH_CMP_OPERATIONS’ 223 | ATTACH_CMP_OPERATIONS(AttributeSelector) | ^~~~~~~~~~~~~~~~~~~~~ src/ast_def_macros.hpp:106:16: warning: ‘virtual bool Sass::Selector::operator!=(const Sass::Selector&) const’ was hidden [-Woverloaded-virtual=] 106 | virtual bool operator!=(const klass& rhs) const { return !(*this == rhs); }; \ | ^~~~~~~~ src/ast_selectors.hpp:56:5: note: in expansion of macro ‘ATTACH_VIRTUAL_CMP_OPERATIONS’ 56 | ATTACH_VIRTUAL_CMP_OPERATIONS(Selector) | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~ src/ast_def_macros.hpp:110:16: note: by ‘virtual bool Sass::ComplexSelector::operator!=(const Sass::ComplexSelector&) const’ 110 | virtual bool operator!=(const klass& rhs) const { return !(*this == rhs); }; \ | ^~~~~~~~ src/ast_selectors.hpp:310:5: note: in expansion of macro ‘ATTACH_CMP_OPERATIONS’ 310 | ATTACH_CMP_OPERATIONS(ComplexSelector) | ^~~~~~~~~~~~~~~~~~~~~ src/ast_def_macros.hpp:106:16: warning: ‘virtual bool Sass::Selector::operator!=(const Sass::Selector&) const’ was hidden [-Woverloaded-virtual=] 106 | virtual bool operator!=(const klass& rhs) const { return !(*this == rhs); }; \ | ^~~~~~~~ src/ast_selectors.hpp:56:5: note: in expansion of macro ‘ATTACH_VIRTUAL_CMP_OPERATIONS’ 56 | ATTACH_VIRTUAL_CMP_OPERATIONS(Selector) | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~ src/ast_def_macros.hpp:106:16: note: by ‘virtual bool Sass::SelectorComponent::operator!=(const Sass::SelectorComponent&) const’ 106 | virtual bool operator!=(const klass& rhs) const { return !(*this == rhs); }; \ | ^~~~~~~~ src/ast_selectors.hpp:349:5: note: in expansion of macro ‘ATTACH_VIRTUAL_CMP_OPERATIONS’ 349 | ATTACH_VIRTUAL_CMP_OPERATIONS(SelectorComponent); | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~ src/ast_def_macros.hpp:106:16: warning: ‘virtual bool Sass::SelectorComponent::operator!=(const Sass::SelectorComponent&) const’ was hidden [-Woverloaded-virtual=] 106 | virtual bool operator!=(const klass& rhs) const { return !(*this == rhs); }; \ | ^~~~~~~~ src/ast_selectors.hpp:349:5: note: in expansion of macro ‘ATTACH_VIRTUAL_CMP_OPERATIONS’ 349 | ATTACH_VIRTUAL_CMP_OPERATIONS(SelectorComponent); | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~ src/ast_def_macros.hpp:110:16: note: by ‘virtual bool Sass::SelectorCombinator::operator!=(const Sass::SelectorCombinator&) const’ 110 | virtual bool operator!=(const klass& rhs) const { return !(*this == rhs); }; \ | ^~~~~~~~ src/ast_selectors.hpp:407:5: note: in expansion of macro ‘ATTACH_CMP_OPERATIONS’ 407 | ATTACH_CMP_OPERATIONS(SelectorCombinator) | ^~~~~~~~~~~~~~~~~~~~~ g++ -std=gnu++17 -Wall -O2 -std=c++11 -I ./include -fPIC -c -o src/fn_colors.o src/fn_colors.cpp In file included from src/fn_colors.cpp:6: src/ast.hpp:90:18: warning: ‘virtual bool Sass::AST_Node::operator==(const Sass::AST_Node&) const’ was hidden [-Woverloaded-virtual=] 90 | virtual bool operator== (const AST_Node& rhs) const { | ^~~~~~~~ src/ast.hpp:165:18: note: by ‘virtual bool Sass::Expression::operator==(const Sass::Expression&) const’ 165 | virtual bool operator== (const Expression& rhs) const { return false; } | ^~~~~~~~ src/ast.hpp:96:18: warning: ‘virtual bool Sass::AST_Node::operator!=(const Sass::AST_Node&) const’ was hidden [-Woverloaded-virtual=] 96 | virtual bool operator!= (const AST_Node& rhs) const { | ^~~~~~~~ src/ast.hpp:167:17: note: by ‘bool Sass::Expression::operator!=(const Sass::Expression&) const’ 167 | inline bool operator!=(const Expression& rhs) const { return !(rhs == *this); } | ^~~~~~~~ src/ast.hpp:90:18: warning: ‘virtual bool Sass::AST_Node::operator==(const Sass::AST_Node&) const’ was hidden [-Woverloaded-virtual=] 90 | virtual bool operator== (const AST_Node& rhs) const { | ^~~~~~~~ src/ast.hpp:908:10: note: by ‘bool Sass::CssMediaRule::operator==(const Sass::CssMediaRule&) const’ 908 | bool operator== (const CssMediaRule& rhs) const { | ^~~~~~~~ src/ast.hpp:96:18: warning: ‘virtual bool Sass::AST_Node::operator!=(const Sass::AST_Node&) const’ was hidden [-Woverloaded-virtual=] 96 | virtual bool operator!= (const AST_Node& rhs) const { | ^~~~~~~~ src/ast.hpp:911:10: note: by ‘bool Sass::CssMediaRule::operator!=(const Sass::CssMediaRule&) const’ 911 | bool operator!=(const CssMediaRule& rhs) const { | ^~~~~~~~ src/ast.hpp:90:18: warning: ‘virtual bool Sass::AST_Node::operator==(const Sass::AST_Node&) const’ was hidden [-Woverloaded-virtual=] 90 | virtual bool operator== (const AST_Node& rhs) const { | ^~~~~~~~ src/ast.hpp:939:10: note: by ‘bool Sass::CssMediaQuery::operator==(const Sass::CssMediaQuery&) const’ 939 | bool operator== (const CssMediaQuery& rhs) const; | ^~~~~~~~ src/ast.hpp:96:18: warning: ‘virtual bool Sass::AST_Node::operator!=(const Sass::AST_Node&) const’ was hidden [-Woverloaded-virtual=] 96 | virtual bool operator!= (const AST_Node& rhs) const { | ^~~~~~~~ src/ast.hpp:940:10: note: by ‘bool Sass::CssMediaQuery::operator!=(const Sass::CssMediaQuery&) const’ 940 | bool operator!=(const CssMediaQuery& rhs) const { | ^~~~~~~~ src/ast.hpp:165:18: warning: ‘virtual bool Sass::Expression::operator==(const Sass::Expression&) const’ was hidden [-Woverloaded-virtual=] 165 | virtual bool operator== (const Expression& rhs) const { return false; } | ^~~~~~~~ In file included from src/ast.hpp:14: src/ast_def_macros.hpp:105:16: note: by ‘virtual bool Sass::Selector::operator==(const Sass::Selector&) const’ 105 | virtual bool operator==(const klass& rhs) const = 0; \ | ^~~~~~~~ src/ast_selectors.hpp:56:5: note: in expansion of macro ‘ATTACH_VIRTUAL_CMP_OPERATIONS’ 56 | ATTACH_VIRTUAL_CMP_OPERATIONS(Selector) | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~ src/ast.hpp:96:18: warning: ‘virtual bool Sass::AST_Node::operator!=(const Sass::AST_Node&) const’ was hidden [-Woverloaded-virtual=] 96 | virtual bool operator!= (const AST_Node& rhs) const { | ^~~~~~~~ src/ast_def_macros.hpp:106:16: note: by ‘virtual bool Sass::Selector::operator!=(const Sass::Selector&) const’ 106 | virtual bool operator!=(const klass& rhs) const { return !(*this == rhs); }; \ | ^~~~~~~~ src/ast_selectors.hpp:56:5: note: in expansion of macro ‘ATTACH_VIRTUAL_CMP_OPERATIONS’ 56 | ATTACH_VIRTUAL_CMP_OPERATIONS(Selector) | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~ src/ast_def_macros.hpp:106:16: warning: ‘virtual bool Sass::Selector::operator!=(const Sass::Selector&) const’ was hidden [-Woverloaded-virtual=] 106 | virtual bool operator!=(const klass& rhs) const { return !(*this == rhs); }; \ | ^~~~~~~~ src/ast_selectors.hpp:56:5: note: in expansion of macro ‘ATTACH_VIRTUAL_CMP_OPERATIONS’ 56 | ATTACH_VIRTUAL_CMP_OPERATIONS(Selector) | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~ src/ast_def_macros.hpp:106:16: note: by ‘virtual bool Sass::SimpleSelector::operator!=(const Sass::SimpleSelector&) const’ 106 | virtual bool operator!=(const klass& rhs) const { return !(*this == rhs); }; \ | ^~~~~~~~ src/ast_selectors.hpp:139:5: note: in expansion of macro ‘ATTACH_VIRTUAL_CMP_OPERATIONS’ 139 | ATTACH_VIRTUAL_CMP_OPERATIONS(SimpleSelector); | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~ In file included from src/ast.hpp:1055: src/ast_selectors.hpp:137:18: warning: ‘virtual bool Sass::SimpleSelector::operator==(const Sass::CompoundSelector&) const’ was hidden [-Woverloaded-virtual=] 137 | virtual bool operator==(const CompoundSelector& rhs) const; | ^~~~~~~~ src/ast_def_macros.hpp:109:16: note: by ‘Sass::PlaceholderSelector::operator==’ 109 | virtual bool operator==(const klass& rhs) const; \ | ^~~~~~~~ src/ast_selectors.hpp:157:5: note: in expansion of macro ‘ATTACH_CMP_OPERATIONS’ 157 | ATTACH_CMP_OPERATIONS(PlaceholderSelector) | ^~~~~~~~~~~~~~~~~~~~~ src/ast_selectors.hpp:136:18: warning: ‘virtual bool Sass::SimpleSelector::operator==(const Sass::ComplexSelector&) const’ was hidden [-Woverloaded-virtual=] 136 | virtual bool operator==(const ComplexSelector& rhs) const; | ^~~~~~~~ src/ast_def_macros.hpp:109:16: note: by ‘Sass::PlaceholderSelector::operator==’ 109 | virtual bool operator==(const klass& rhs) const; \ | ^~~~~~~~ src/ast_selectors.hpp:157:5: note: in expansion of macro ‘ATTACH_CMP_OPERATIONS’ 157 | ATTACH_CMP_OPERATIONS(PlaceholderSelector) | ^~~~~~~~~~~~~~~~~~~~~ src/ast_selectors.hpp:135:18: warning: ‘virtual bool Sass::SimpleSelector::operator==(const Sass::SelectorList&) const’ was hidden [-Woverloaded-virtual=] 135 | virtual bool operator==(const SelectorList& rhs) const; | ^~~~~~~~ src/ast_def_macros.hpp:109:16: note: by ‘Sass::PlaceholderSelector::operator==’ 109 | virtual bool operator==(const klass& rhs) const; \ | ^~~~~~~~ src/ast_selectors.hpp:157:5: note: in expansion of macro ‘ATTACH_CMP_OPERATIONS’ 157 | ATTACH_CMP_OPERATIONS(PlaceholderSelector) | ^~~~~~~~~~~~~~~~~~~~~ src/ast_selectors.hpp:133:10: warning: ‘virtual bool Sass::SimpleSelector::operator==(const Sass::Selector&) const’ was hidden [-Woverloaded-virtual=] 133 | bool operator==(const Selector& rhs) const final override; | ^~~~~~~~ src/ast_def_macros.hpp:109:16: note: by ‘Sass::PlaceholderSelector::operator==’ 109 | virtual bool operator==(const klass& rhs) const; \ | ^~~~~~~~ src/ast_selectors.hpp:157:5: note: in expansion of macro ‘ATTACH_CMP_OPERATIONS’ 157 | ATTACH_CMP_OPERATIONS(PlaceholderSelector) | ^~~~~~~~~~~~~~~~~~~~~ src/ast_def_macros.hpp:106:16: warning: ‘virtual bool Sass::SimpleSelector::operator!=(const Sass::SimpleSelector&) const’ was hidden [-Woverloaded-virtual=] 106 | virtual bool operator!=(const klass& rhs) const { return !(*this == rhs); }; \ | ^~~~~~~~ src/ast_selectors.hpp:139:5: note: in expansion of macro ‘ATTACH_VIRTUAL_CMP_OPERATIONS’ 139 | ATTACH_VIRTUAL_CMP_OPERATIONS(SimpleSelector); | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~ src/ast_def_macros.hpp:110:16: note: by ‘virtual bool Sass::PlaceholderSelector::operator!=(const Sass::PlaceholderSelector&) const’ 110 | virtual bool operator!=(const klass& rhs) const { return !(*this == rhs); }; \ | ^~~~~~~~ src/ast_selectors.hpp:157:5: note: in expansion of macro ‘ATTACH_CMP_OPERATIONS’ 157 | ATTACH_CMP_OPERATIONS(PlaceholderSelector) | ^~~~~~~~~~~~~~~~~~~~~ src/ast_selectors.hpp:137:18: warning: ‘virtual bool Sass::SimpleSelector::operator==(const Sass::CompoundSelector&) const’ was hidden [-Woverloaded-virtual=] 137 | virtual bool operator==(const CompoundSelector& rhs) const; | ^~~~~~~~ src/ast_def_macros.hpp:109:16: note: by ‘Sass::TypeSelector::operator==’ 109 | virtual bool operator==(const klass& rhs) const; \ | ^~~~~~~~ src/ast_selectors.hpp:174:5: note: in expansion of macro ‘ATTACH_CMP_OPERATIONS’ 174 | ATTACH_CMP_OPERATIONS(TypeSelector) | ^~~~~~~~~~~~~~~~~~~~~ src/ast_selectors.hpp:136:18: warning: ‘virtual bool Sass::SimpleSelector::operator==(const Sass::ComplexSelector&) const’ was hidden [-Woverloaded-virtual=] 136 | virtual bool operator==(const ComplexSelector& rhs) const; | ^~~~~~~~ src/ast_def_macros.hpp:109:16: note: by ‘Sass::TypeSelector::operator==’ 109 | virtual bool operator==(const klass& rhs) const; \ | ^~~~~~~~ src/ast_selectors.hpp:174:5: note: in expansion of macro ‘ATTACH_CMP_OPERATIONS’ 174 | ATTACH_CMP_OPERATIONS(TypeSelector) | ^~~~~~~~~~~~~~~~~~~~~ src/ast_selectors.hpp:135:18: warning: ‘virtual bool Sass::SimpleSelector::operator==(const Sass::SelectorList&) const’ was hidden [-Woverloaded-virtual=] 135 | virtual bool operator==(const SelectorList& rhs) const; | ^~~~~~~~ src/ast_def_macros.hpp:109:16: note: by ‘Sass::TypeSelector::operator==’ 109 | virtual bool operator==(const klass& rhs) const; \ | ^~~~~~~~ src/ast_selectors.hpp:174:5: note: in expansion of macro ‘ATTACH_CMP_OPERATIONS’ 174 | ATTACH_CMP_OPERATIONS(TypeSelector) | ^~~~~~~~~~~~~~~~~~~~~ src/ast_selectors.hpp:133:10: warning: ‘virtual bool Sass::SimpleSelector::operator==(const Sass::Selector&) const’ was hidden [-Woverloaded-virtual=] 133 | bool operator==(const Selector& rhs) const final override; | ^~~~~~~~ src/ast_def_macros.hpp:109:16: note: by ‘Sass::TypeSelector::operator==’ 109 | virtual bool operator==(const klass& rhs) const; \ | ^~~~~~~~ src/ast_selectors.hpp:174:5: note: in expansion of macro ‘ATTACH_CMP_OPERATIONS’ 174 | ATTACH_CMP_OPERATIONS(TypeSelector) | ^~~~~~~~~~~~~~~~~~~~~ src/ast_def_macros.hpp:106:16: warning: ‘virtual bool Sass::SimpleSelector::operator!=(const Sass::SimpleSelector&) const’ was hidden [-Woverloaded-virtual=] 106 | virtual bool operator!=(const klass& rhs) const { return !(*this == rhs); }; \ | ^~~~~~~~ src/ast_selectors.hpp:139:5: note: in expansion of macro ‘ATTACH_VIRTUAL_CMP_OPERATIONS’ 139 | ATTACH_VIRTUAL_CMP_OPERATIONS(SimpleSelector); | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~ src/ast_def_macros.hpp:110:16: note: by ‘virtual bool Sass::TypeSelector::operator!=(const Sass::TypeSelector&) const’ 110 | virtual bool operator!=(const klass& rhs) const { return !(*this == rhs); }; \ | ^~~~~~~~ src/ast_selectors.hpp:174:5: note: in expansion of macro ‘ATTACH_CMP_OPERATIONS’ 174 | ATTACH_CMP_OPERATIONS(TypeSelector) | ^~~~~~~~~~~~~~~~~~~~~ src/ast_selectors.hpp:137:18: warning: ‘virtual bool Sass::SimpleSelector::operator==(const Sass::CompoundSelector&) const’ was hidden [-Woverloaded-virtual=] 137 | virtual bool operator==(const CompoundSelector& rhs) const; | ^~~~~~~~ src/ast_def_macros.hpp:109:16: note: by ‘Sass::ClassSelector::operator==’ 109 | virtual bool operator==(const klass& rhs) const; \ | ^~~~~~~~ src/ast_selectors.hpp:188:5: note: in expansion of macro ‘ATTACH_CMP_OPERATIONS’ 188 | ATTACH_CMP_OPERATIONS(ClassSelector) | ^~~~~~~~~~~~~~~~~~~~~ src/ast_selectors.hpp:136:18: warning: ‘virtual bool Sass::SimpleSelector::operator==(const Sass::ComplexSelector&) const’ was hidden [-Woverloaded-virtual=] 136 | virtual bool operator==(const ComplexSelector& rhs) const; | ^~~~~~~~ src/ast_def_macros.hpp:109:16: note: by ‘Sass::ClassSelector::operator==’ 109 | virtual bool operator==(const klass& rhs) const; \ | ^~~~~~~~ src/ast_selectors.hpp:188:5: note: in expansion of macro ‘ATTACH_CMP_OPERATIONS’ 188 | ATTACH_CMP_OPERATIONS(ClassSelector) | ^~~~~~~~~~~~~~~~~~~~~ src/ast_selectors.hpp:135:18: warning: ‘virtual bool Sass::SimpleSelector::operator==(const Sass::SelectorList&) const’ was hidden [-Woverloaded-virtual=] 135 | virtual bool operator==(const SelectorList& rhs) const; | ^~~~~~~~ src/ast_def_macros.hpp:109:16: note: by ‘Sass::ClassSelector::operator==’ 109 | virtual bool operator==(const klass& rhs) const; \ | ^~~~~~~~ src/ast_selectors.hpp:188:5: note: in expansion of macro ‘ATTACH_CMP_OPERATIONS’ 188 | ATTACH_CMP_OPERATIONS(ClassSelector) | ^~~~~~~~~~~~~~~~~~~~~ src/ast_selectors.hpp:133:10: warning: ‘virtual bool Sass::SimpleSelector::operator==(const Sass::Selector&) const’ was hidden [-Woverloaded-virtual=] 133 | bool operator==(const Selector& rhs) const final override; | ^~~~~~~~ src/ast_def_macros.hpp:109:16: note: by ‘Sass::ClassSelector::operator==’ 109 | virtual bool operator==(const klass& rhs) const; \ | ^~~~~~~~ src/ast_selectors.hpp:188:5: note: in expansion of macro ‘ATTACH_CMP_OPERATIONS’ 188 | ATTACH_CMP_OPERATIONS(ClassSelector) | ^~~~~~~~~~~~~~~~~~~~~ src/ast_def_macros.hpp:106:16: warning: ‘virtual bool Sass::SimpleSelector::operator!=(const Sass::SimpleSelector&) const’ was hidden [-Woverloaded-virtual=] 106 | virtual bool operator!=(const klass& rhs) const { return !(*this == rhs); }; \ | ^~~~~~~~ src/ast_selectors.hpp:139:5: note: in expansion of macro ‘ATTACH_VIRTUAL_CMP_OPERATIONS’ 139 | ATTACH_VIRTUAL_CMP_OPERATIONS(SimpleSelector); | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~ src/ast_def_macros.hpp:110:16: note: by ‘virtual bool Sass::ClassSelector::operator!=(const Sass::ClassSelector&) const’ 110 | virtual bool operator!=(const klass& rhs) const { return !(*this == rhs); }; \ | ^~~~~~~~ src/ast_selectors.hpp:188:5: note: in expansion of macro ‘ATTACH_CMP_OPERATIONS’ 188 | ATTACH_CMP_OPERATIONS(ClassSelector) | ^~~~~~~~~~~~~~~~~~~~~ src/ast_selectors.hpp:137:18: warning: ‘virtual bool Sass::SimpleSelector::operator==(const Sass::CompoundSelector&) const’ was hidden [-Woverloaded-virtual=] 137 | virtual bool operator==(const CompoundSelector& rhs) const; | ^~~~~~~~ src/ast_def_macros.hpp:109:16: note: by ‘Sass::IDSelector::operator==’ 109 | virtual bool operator==(const klass& rhs) const; \ | ^~~~~~~~ src/ast_selectors.hpp:204:5: note: in expansion of macro ‘ATTACH_CMP_OPERATIONS’ 204 | ATTACH_CMP_OPERATIONS(IDSelector) | ^~~~~~~~~~~~~~~~~~~~~ src/ast_selectors.hpp:136:18: warning: ‘virtual bool Sass::SimpleSelector::operator==(const Sass::ComplexSelector&) const’ was hidden [-Woverloaded-virtual=] 136 | virtual bool operator==(const ComplexSelector& rhs) const; | ^~~~~~~~ src/ast_def_macros.hpp:109:16: note: by ‘Sass::IDSelector::operator==’ 109 | virtual bool operator==(const klass& rhs) const; \ | ^~~~~~~~ src/ast_selectors.hpp:204:5: note: in expansion of macro ‘ATTACH_CMP_OPERATIONS’ 204 | ATTACH_CMP_OPERATIONS(IDSelector) | ^~~~~~~~~~~~~~~~~~~~~ src/ast_selectors.hpp:135:18: warning: ‘virtual bool Sass::SimpleSelector::operator==(const Sass::SelectorList&) const’ was hidden [-Woverloaded-virtual=] 135 | virtual bool operator==(const SelectorList& rhs) const; | ^~~~~~~~ src/ast_def_macros.hpp:109:16: note: by ‘Sass::IDSelector::operator==’ 109 | virtual bool operator==(const klass& rhs) const; \ | ^~~~~~~~ src/ast_selectors.hpp:204:5: note: in expansion of macro ‘ATTACH_CMP_OPERATIONS’ 204 | ATTACH_CMP_OPERATIONS(IDSelector) | ^~~~~~~~~~~~~~~~~~~~~ src/ast_selectors.hpp:133:10: warning: ‘virtual bool Sass::SimpleSelector::operator==(const Sass::Selector&) const’ was hidden [-Woverloaded-virtual=] 133 | bool operator==(const Selector& rhs) const final override; | ^~~~~~~~ src/ast_def_macros.hpp:109:16: note: by ‘Sass::IDSelector::operator==’ 109 | virtual bool operator==(const klass& rhs) const; \ | ^~~~~~~~ src/ast_selectors.hpp:204:5: note: in expansion of macro ‘ATTACH_CMP_OPERATIONS’ 204 | ATTACH_CMP_OPERATIONS(IDSelector) | ^~~~~~~~~~~~~~~~~~~~~ src/ast_def_macros.hpp:106:16: warning: ‘virtual bool Sass::SimpleSelector::operator!=(const Sass::SimpleSelector&) const’ was hidden [-Woverloaded-virtual=] 106 | virtual bool operator!=(const klass& rhs) const { return !(*this == rhs); }; \ | ^~~~~~~~ src/ast_selectors.hpp:139:5: note: in expansion of macro ‘ATTACH_VIRTUAL_CMP_OPERATIONS’ 139 | ATTACH_VIRTUAL_CMP_OPERATIONS(SimpleSelector); | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~ src/ast_def_macros.hpp:110:16: note: by ‘virtual bool Sass::IDSelector::operator!=(const Sass::IDSelector&) const’ 110 | virtual bool operator!=(const klass& rhs) const { return !(*this == rhs); }; \ | ^~~~~~~~ src/ast_selectors.hpp:204:5: note: in expansion of macro ‘ATTACH_CMP_OPERATIONS’ 204 | ATTACH_CMP_OPERATIONS(IDSelector) | ^~~~~~~~~~~~~~~~~~~~~ src/ast_selectors.hpp:137:18: warning: ‘virtual bool Sass::SimpleSelector::operator==(const Sass::CompoundSelector&) const’ was hidden [-Woverloaded-virtual=] 137 | virtual bool operator==(const CompoundSelector& rhs) const; | ^~~~~~~~ src/ast_def_macros.hpp:109:16: note: by ‘Sass::AttributeSelector::operator==’ 109 | virtual bool operator==(const klass& rhs) const; \ | ^~~~~~~~ src/ast_selectors.hpp:223:5: note: in expansion of macro ‘ATTACH_CMP_OPERATIONS’ 223 | ATTACH_CMP_OPERATIONS(AttributeSelector) | ^~~~~~~~~~~~~~~~~~~~~ src/ast_selectors.hpp:136:18: warning: ‘virtual bool Sass::SimpleSelector::operator==(const Sass::ComplexSelector&) const’ was hidden [-Woverloaded-virtual=] 136 | virtual bool operator==(const ComplexSelector& rhs) const; | ^~~~~~~~ src/ast_def_macros.hpp:109:16: note: by ‘Sass::AttributeSelector::operator==’ 109 | virtual bool operator==(const klass& rhs) const; \ | ^~~~~~~~ src/ast_selectors.hpp:223:5: note: in expansion of macro ‘ATTACH_CMP_OPERATIONS’ 223 | ATTACH_CMP_OPERATIONS(AttributeSelector) | ^~~~~~~~~~~~~~~~~~~~~ src/ast_selectors.hpp:135:18: warning: ‘virtual bool Sass::SimpleSelector::operator==(const Sass::SelectorList&) const’ was hidden [-Woverloaded-virtual=] 135 | virtual bool operator==(const SelectorList& rhs) const; | ^~~~~~~~ src/ast_def_macros.hpp:109:16: note: by ‘Sass::AttributeSelector::operator==’ 109 | virtual bool operator==(const klass& rhs) const; \ | ^~~~~~~~ src/ast_selectors.hpp:223:5: note: in expansion of macro ‘ATTACH_CMP_OPERATIONS’ 223 | ATTACH_CMP_OPERATIONS(AttributeSelector) | ^~~~~~~~~~~~~~~~~~~~~ src/ast_selectors.hpp:133:10: warning: ‘virtual bool Sass::SimpleSelector::operator==(const Sass::Selector&) const’ was hidden [-Woverloaded-virtual=] 133 | bool operator==(const Selector& rhs) const final override; | ^~~~~~~~ src/ast_def_macros.hpp:109:16: note: by ‘Sass::AttributeSelector::operator==’ 109 | virtual bool operator==(const klass& rhs) const; \ | ^~~~~~~~ src/ast_selectors.hpp:223:5: note: in expansion of macro ‘ATTACH_CMP_OPERATIONS’ 223 | ATTACH_CMP_OPERATIONS(AttributeSelector) | ^~~~~~~~~~~~~~~~~~~~~ src/ast_def_macros.hpp:106:16: warning: ‘virtual bool Sass::SimpleSelector::operator!=(const Sass::SimpleSelector&) const’ was hidden [-Woverloaded-virtual=] 106 | virtual bool operator!=(const klass& rhs) const { return !(*this == rhs); }; \ | ^~~~~~~~ src/ast_selectors.hpp:139:5: note: in expansion of macro ‘ATTACH_VIRTUAL_CMP_OPERATIONS’ 139 | ATTACH_VIRTUAL_CMP_OPERATIONS(SimpleSelector); | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~ src/ast_def_macros.hpp:110:16: note: by ‘virtual bool Sass::AttributeSelector::operator!=(const Sass::AttributeSelector&) const’ 110 | virtual bool operator!=(const klass& rhs) const { return !(*this == rhs); }; \ | ^~~~~~~~ src/ast_selectors.hpp:223:5: note: in expansion of macro ‘ATTACH_CMP_OPERATIONS’ 223 | ATTACH_CMP_OPERATIONS(AttributeSelector) | ^~~~~~~~~~~~~~~~~~~~~ src/ast_def_macros.hpp:106:16: warning: ‘virtual bool Sass::Selector::operator!=(const Sass::Selector&) const’ was hidden [-Woverloaded-virtual=] 106 | virtual bool operator!=(const klass& rhs) const { return !(*this == rhs); }; \ | ^~~~~~~~ src/ast_selectors.hpp:56:5: note: in expansion of macro ‘ATTACH_VIRTUAL_CMP_OPERATIONS’ 56 | ATTACH_VIRTUAL_CMP_OPERATIONS(Selector) | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~ src/ast_def_macros.hpp:110:16: note: by ‘virtual bool Sass::ComplexSelector::operator!=(const Sass::ComplexSelector&) const’ 110 | virtual bool operator!=(const klass& rhs) const { return !(*this == rhs); }; \ | ^~~~~~~~ src/ast_selectors.hpp:310:5: note: in expansion of macro ‘ATTACH_CMP_OPERATIONS’ 310 | ATTACH_CMP_OPERATIONS(ComplexSelector) | ^~~~~~~~~~~~~~~~~~~~~ src/ast_def_macros.hpp:106:16: warning: ‘virtual bool Sass::Selector::operator!=(const Sass::Selector&) const’ was hidden [-Woverloaded-virtual=] 106 | virtual bool operator!=(const klass& rhs) const { return !(*this == rhs); }; \ | ^~~~~~~~ src/ast_selectors.hpp:56:5: note: in expansion of macro ‘ATTACH_VIRTUAL_CMP_OPERATIONS’ 56 | ATTACH_VIRTUAL_CMP_OPERATIONS(Selector) | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~ src/ast_def_macros.hpp:106:16: note: by ‘virtual bool Sass::SelectorComponent::operator!=(const Sass::SelectorComponent&) const’ 106 | virtual bool operator!=(const klass& rhs) const { return !(*this == rhs); }; \ | ^~~~~~~~ src/ast_selectors.hpp:349:5: note: in expansion of macro ‘ATTACH_VIRTUAL_CMP_OPERATIONS’ 349 | ATTACH_VIRTUAL_CMP_OPERATIONS(SelectorComponent); | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~ src/ast_def_macros.hpp:106:16: warning: ‘virtual bool Sass::SelectorComponent::operator!=(const Sass::SelectorComponent&) const’ was hidden [-Woverloaded-virtual=] 106 | virtual bool operator!=(const klass& rhs) const { return !(*this == rhs); }; \ | ^~~~~~~~ src/ast_selectors.hpp:349:5: note: in expansion of macro ‘ATTACH_VIRTUAL_CMP_OPERATIONS’ 349 | ATTACH_VIRTUAL_CMP_OPERATIONS(SelectorComponent); | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~ src/ast_def_macros.hpp:110:16: note: by ‘virtual bool Sass::SelectorCombinator::operator!=(const Sass::SelectorCombinator&) const’ 110 | virtual bool operator!=(const klass& rhs) const { return !(*this == rhs); }; \ | ^~~~~~~~ src/ast_selectors.hpp:407:5: note: in expansion of macro ‘ATTACH_CMP_OPERATIONS’ 407 | ATTACH_CMP_OPERATIONS(SelectorCombinator) | ^~~~~~~~~~~~~~~~~~~~~ g++ -std=gnu++17 -Wall -O2 -std=c++11 -I ./include -fPIC -c -o src/fn_numbers.o src/fn_numbers.cpp In file included from src/fn_numbers.cpp:15: src/ast.hpp:90:18: warning: ‘virtual bool Sass::AST_Node::operator==(const Sass::AST_Node&) const’ was hidden [-Woverloaded-virtual=] 90 | virtual bool operator== (const AST_Node& rhs) const { | ^~~~~~~~ src/ast.hpp:165:18: note: by ‘virtual bool Sass::Expression::operator==(const Sass::Expression&) const’ 165 | virtual bool operator== (const Expression& rhs) const { return false; } | ^~~~~~~~ src/ast.hpp:96:18: warning: ‘virtual bool Sass::AST_Node::operator!=(const Sass::AST_Node&) const’ was hidden [-Woverloaded-virtual=] 96 | virtual bool operator!= (const AST_Node& rhs) const { | ^~~~~~~~ src/ast.hpp:167:17: note: by ‘bool Sass::Expression::operator!=(const Sass::Expression&) const’ 167 | inline bool operator!=(const Expression& rhs) const { return !(rhs == *this); } | ^~~~~~~~ src/ast.hpp:90:18: warning: ‘virtual bool Sass::AST_Node::operator==(const Sass::AST_Node&) const’ was hidden [-Woverloaded-virtual=] 90 | virtual bool operator== (const AST_Node& rhs) const { | ^~~~~~~~ src/ast.hpp:908:10: note: by ‘bool Sass::CssMediaRule::operator==(const Sass::CssMediaRule&) const’ 908 | bool operator== (const CssMediaRule& rhs) const { | ^~~~~~~~ src/ast.hpp:96:18: warning: ‘virtual bool Sass::AST_Node::operator!=(const Sass::AST_Node&) const’ was hidden [-Woverloaded-virtual=] 96 | virtual bool operator!= (const AST_Node& rhs) const { | ^~~~~~~~ src/ast.hpp:911:10: note: by ‘bool Sass::CssMediaRule::operator!=(const Sass::CssMediaRule&) const’ 911 | bool operator!=(const CssMediaRule& rhs) const { | ^~~~~~~~ src/ast.hpp:90:18: warning: ‘virtual bool Sass::AST_Node::operator==(const Sass::AST_Node&) const’ was hidden [-Woverloaded-virtual=] 90 | virtual bool operator== (const AST_Node& rhs) const { | ^~~~~~~~ src/ast.hpp:939:10: note: by ‘bool Sass::CssMediaQuery::operator==(const Sass::CssMediaQuery&) const’ 939 | bool operator== (const CssMediaQuery& rhs) const; | ^~~~~~~~ src/ast.hpp:96:18: warning: ‘virtual bool Sass::AST_Node::operator!=(const Sass::AST_Node&) const’ was hidden [-Woverloaded-virtual=] 96 | virtual bool operator!= (const AST_Node& rhs) const { | ^~~~~~~~ src/ast.hpp:940:10: note: by ‘bool Sass::CssMediaQuery::operator!=(const Sass::CssMediaQuery&) const’ 940 | bool operator!=(const CssMediaQuery& rhs) const { | ^~~~~~~~ src/ast.hpp:165:18: warning: ‘virtual bool Sass::Expression::operator==(const Sass::Expression&) const’ was hidden [-Woverloaded-virtual=] 165 | virtual bool operator== (const Expression& rhs) const { return false; } | ^~~~~~~~ In file included from src/ast.hpp:14: src/ast_def_macros.hpp:105:16: note: by ‘virtual bool Sass::Selector::operator==(const Sass::Selector&) const’ 105 | virtual bool operator==(const klass& rhs) const = 0; \ | ^~~~~~~~ src/ast_selectors.hpp:56:5: note: in expansion of macro ‘ATTACH_VIRTUAL_CMP_OPERATIONS’ 56 | ATTACH_VIRTUAL_CMP_OPERATIONS(Selector) | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~ src/ast.hpp:96:18: warning: ‘virtual bool Sass::AST_Node::operator!=(const Sass::AST_Node&) const’ was hidden [-Woverloaded-virtual=] 96 | virtual bool operator!= (const AST_Node& rhs) const { | ^~~~~~~~ src/ast_def_macros.hpp:106:16: note: by ‘virtual bool Sass::Selector::operator!=(const Sass::Selector&) const’ 106 | virtual bool operator!=(const klass& rhs) const { return !(*this == rhs); }; \ | ^~~~~~~~ src/ast_selectors.hpp:56:5: note: in expansion of macro ‘ATTACH_VIRTUAL_CMP_OPERATIONS’ 56 | ATTACH_VIRTUAL_CMP_OPERATIONS(Selector) | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~ src/ast_def_macros.hpp:106:16: warning: ‘virtual bool Sass::Selector::operator!=(const Sass::Selector&) const’ was hidden [-Woverloaded-virtual=] 106 | virtual bool operator!=(const klass& rhs) const { return !(*this == rhs); }; \ | ^~~~~~~~ src/ast_selectors.hpp:56:5: note: in expansion of macro ‘ATTACH_VIRTUAL_CMP_OPERATIONS’ 56 | ATTACH_VIRTUAL_CMP_OPERATIONS(Selector) | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~ src/ast_def_macros.hpp:106:16: note: by ‘virtual bool Sass::SimpleSelector::operator!=(const Sass::SimpleSelector&) const’ 106 | virtual bool operator!=(const klass& rhs) const { return !(*this == rhs); }; \ | ^~~~~~~~ src/ast_selectors.hpp:139:5: note: in expansion of macro ‘ATTACH_VIRTUAL_CMP_OPERATIONS’ 139 | ATTACH_VIRTUAL_CMP_OPERATIONS(SimpleSelector); | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~ In file included from src/ast.hpp:1055: src/ast_selectors.hpp:137:18: warning: ‘virtual bool Sass::SimpleSelector::operator==(const Sass::CompoundSelector&) const’ was hidden [-Woverloaded-virtual=] 137 | virtual bool operator==(const CompoundSelector& rhs) const; | ^~~~~~~~ src/ast_def_macros.hpp:109:16: note: by ‘Sass::PlaceholderSelector::operator==’ 109 | virtual bool operator==(const klass& rhs) const; \ | ^~~~~~~~ src/ast_selectors.hpp:157:5: note: in expansion of macro ‘ATTACH_CMP_OPERATIONS’ 157 | ATTACH_CMP_OPERATIONS(PlaceholderSelector) | ^~~~~~~~~~~~~~~~~~~~~ src/ast_selectors.hpp:136:18: warning: ‘virtual bool Sass::SimpleSelector::operator==(const Sass::ComplexSelector&) const’ was hidden [-Woverloaded-virtual=] 136 | virtual bool operator==(const ComplexSelector& rhs) const; | ^~~~~~~~ src/ast_def_macros.hpp:109:16: note: by ‘Sass::PlaceholderSelector::operator==’ 109 | virtual bool operator==(const klass& rhs) const; \ | ^~~~~~~~ src/ast_selectors.hpp:157:5: note: in expansion of macro ‘ATTACH_CMP_OPERATIONS’ 157 | ATTACH_CMP_OPERATIONS(PlaceholderSelector) | ^~~~~~~~~~~~~~~~~~~~~ src/ast_selectors.hpp:135:18: warning: ‘virtual bool Sass::SimpleSelector::operator==(const Sass::SelectorList&) const’ was hidden [-Woverloaded-virtual=] 135 | virtual bool operator==(const SelectorList& rhs) const; | ^~~~~~~~ src/ast_def_macros.hpp:109:16: note: by ‘Sass::PlaceholderSelector::operator==’ 109 | virtual bool operator==(const klass& rhs) const; \ | ^~~~~~~~ src/ast_selectors.hpp:157:5: note: in expansion of macro ‘ATTACH_CMP_OPERATIONS’ 157 | ATTACH_CMP_OPERATIONS(PlaceholderSelector) | ^~~~~~~~~~~~~~~~~~~~~ src/ast_selectors.hpp:133:10: warning: ‘virtual bool Sass::SimpleSelector::operator==(const Sass::Selector&) const’ was hidden [-Woverloaded-virtual=] 133 | bool operator==(const Selector& rhs) const final override; | ^~~~~~~~ src/ast_def_macros.hpp:109:16: note: by ‘Sass::PlaceholderSelector::operator==’ 109 | virtual bool operator==(const klass& rhs) const; \ | ^~~~~~~~ src/ast_selectors.hpp:157:5: note: in expansion of macro ‘ATTACH_CMP_OPERATIONS’ 157 | ATTACH_CMP_OPERATIONS(PlaceholderSelector) | ^~~~~~~~~~~~~~~~~~~~~ src/ast_def_macros.hpp:106:16: warning: ‘virtual bool Sass::SimpleSelector::operator!=(const Sass::SimpleSelector&) const’ was hidden [-Woverloaded-virtual=] 106 | virtual bool operator!=(const klass& rhs) const { return !(*this == rhs); }; \ | ^~~~~~~~ src/ast_selectors.hpp:139:5: note: in expansion of macro ‘ATTACH_VIRTUAL_CMP_OPERATIONS’ 139 | ATTACH_VIRTUAL_CMP_OPERATIONS(SimpleSelector); | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~ src/ast_def_macros.hpp:110:16: note: by ‘virtual bool Sass::PlaceholderSelector::operator!=(const Sass::PlaceholderSelector&) const’ 110 | virtual bool operator!=(const klass& rhs) const { return !(*this == rhs); }; \ | ^~~~~~~~ src/ast_selectors.hpp:157:5: note: in expansion of macro ‘ATTACH_CMP_OPERATIONS’ 157 | ATTACH_CMP_OPERATIONS(PlaceholderSelector) | ^~~~~~~~~~~~~~~~~~~~~ src/ast_selectors.hpp:137:18: warning: ‘virtual bool Sass::SimpleSelector::operator==(const Sass::CompoundSelector&) const’ was hidden [-Woverloaded-virtual=] 137 | virtual bool operator==(const CompoundSelector& rhs) const; | ^~~~~~~~ src/ast_def_macros.hpp:109:16: note: by ‘Sass::TypeSelector::operator==’ 109 | virtual bool operator==(const klass& rhs) const; \ | ^~~~~~~~ src/ast_selectors.hpp:174:5: note: in expansion of macro ‘ATTACH_CMP_OPERATIONS’ 174 | ATTACH_CMP_OPERATIONS(TypeSelector) | ^~~~~~~~~~~~~~~~~~~~~ src/ast_selectors.hpp:136:18: warning: ‘virtual bool Sass::SimpleSelector::operator==(const Sass::ComplexSelector&) const’ was hidden [-Woverloaded-virtual=] 136 | virtual bool operator==(const ComplexSelector& rhs) const; | ^~~~~~~~ src/ast_def_macros.hpp:109:16: note: by ‘Sass::TypeSelector::operator==’ 109 | virtual bool operator==(const klass& rhs) const; \ | ^~~~~~~~ src/ast_selectors.hpp:174:5: note: in expansion of macro ‘ATTACH_CMP_OPERATIONS’ 174 | ATTACH_CMP_OPERATIONS(TypeSelector) | ^~~~~~~~~~~~~~~~~~~~~ src/ast_selectors.hpp:135:18: warning: ‘virtual bool Sass::SimpleSelector::operator==(const Sass::SelectorList&) const’ was hidden [-Woverloaded-virtual=] 135 | virtual bool operator==(const SelectorList& rhs) const; | ^~~~~~~~ src/ast_def_macros.hpp:109:16: note: by ‘Sass::TypeSelector::operator==’ 109 | virtual bool operator==(const klass& rhs) const; \ | ^~~~~~~~ src/ast_selectors.hpp:174:5: note: in expansion of macro ‘ATTACH_CMP_OPERATIONS’ 174 | ATTACH_CMP_OPERATIONS(TypeSelector) | ^~~~~~~~~~~~~~~~~~~~~ src/ast_selectors.hpp:133:10: warning: ‘virtual bool Sass::SimpleSelector::operator==(const Sass::Selector&) const’ was hidden [-Woverloaded-virtual=] 133 | bool operator==(const Selector& rhs) const final override; | ^~~~~~~~ src/ast_def_macros.hpp:109:16: note: by ‘Sass::TypeSelector::operator==’ 109 | virtual bool operator==(const klass& rhs) const; \ | ^~~~~~~~ src/ast_selectors.hpp:174:5: note: in expansion of macro ‘ATTACH_CMP_OPERATIONS’ 174 | ATTACH_CMP_OPERATIONS(TypeSelector) | ^~~~~~~~~~~~~~~~~~~~~ src/ast_def_macros.hpp:106:16: warning: ‘virtual bool Sass::SimpleSelector::operator!=(const Sass::SimpleSelector&) const’ was hidden [-Woverloaded-virtual=] 106 | virtual bool operator!=(const klass& rhs) const { return !(*this == rhs); }; \ | ^~~~~~~~ src/ast_selectors.hpp:139:5: note: in expansion of macro ‘ATTACH_VIRTUAL_CMP_OPERATIONS’ 139 | ATTACH_VIRTUAL_CMP_OPERATIONS(SimpleSelector); | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~ src/ast_def_macros.hpp:110:16: note: by ‘virtual bool Sass::TypeSelector::operator!=(const Sass::TypeSelector&) const’ 110 | virtual bool operator!=(const klass& rhs) const { return !(*this == rhs); }; \ | ^~~~~~~~ src/ast_selectors.hpp:174:5: note: in expansion of macro ‘ATTACH_CMP_OPERATIONS’ 174 | ATTACH_CMP_OPERATIONS(TypeSelector) | ^~~~~~~~~~~~~~~~~~~~~ src/ast_selectors.hpp:137:18: warning: ‘virtual bool Sass::SimpleSelector::operator==(const Sass::CompoundSelector&) const’ was hidden [-Woverloaded-virtual=] 137 | virtual bool operator==(const CompoundSelector& rhs) const; | ^~~~~~~~ src/ast_def_macros.hpp:109:16: note: by ‘Sass::ClassSelector::operator==’ 109 | virtual bool operator==(const klass& rhs) const; \ | ^~~~~~~~ src/ast_selectors.hpp:188:5: note: in expansion of macro ‘ATTACH_CMP_OPERATIONS’ 188 | ATTACH_CMP_OPERATIONS(ClassSelector) | ^~~~~~~~~~~~~~~~~~~~~ src/ast_selectors.hpp:136:18: warning: ‘virtual bool Sass::SimpleSelector::operator==(const Sass::ComplexSelector&) const’ was hidden [-Woverloaded-virtual=] 136 | virtual bool operator==(const ComplexSelector& rhs) const; | ^~~~~~~~ src/ast_def_macros.hpp:109:16: note: by ‘Sass::ClassSelector::operator==’ 109 | virtual bool operator==(const klass& rhs) const; \ | ^~~~~~~~ src/ast_selectors.hpp:188:5: note: in expansion of macro ‘ATTACH_CMP_OPERATIONS’ 188 | ATTACH_CMP_OPERATIONS(ClassSelector) | ^~~~~~~~~~~~~~~~~~~~~ src/ast_selectors.hpp:135:18: warning: ‘virtual bool Sass::SimpleSelector::operator==(const Sass::SelectorList&) const’ was hidden [-Woverloaded-virtual=] 135 | virtual bool operator==(const SelectorList& rhs) const; | ^~~~~~~~ src/ast_def_macros.hpp:109:16: note: by ‘Sass::ClassSelector::operator==’ 109 | virtual bool operator==(const klass& rhs) const; \ | ^~~~~~~~ src/ast_selectors.hpp:188:5: note: in expansion of macro ‘ATTACH_CMP_OPERATIONS’ 188 | ATTACH_CMP_OPERATIONS(ClassSelector) | ^~~~~~~~~~~~~~~~~~~~~ src/ast_selectors.hpp:133:10: warning: ‘virtual bool Sass::SimpleSelector::operator==(const Sass::Selector&) const’ was hidden [-Woverloaded-virtual=] 133 | bool operator==(const Selector& rhs) const final override; | ^~~~~~~~ src/ast_def_macros.hpp:109:16: note: by ‘Sass::ClassSelector::operator==’ 109 | virtual bool operator==(const klass& rhs) const; \ | ^~~~~~~~ src/ast_selectors.hpp:188:5: note: in expansion of macro ‘ATTACH_CMP_OPERATIONS’ 188 | ATTACH_CMP_OPERATIONS(ClassSelector) | ^~~~~~~~~~~~~~~~~~~~~ src/ast_def_macros.hpp:106:16: warning: ‘virtual bool Sass::SimpleSelector::operator!=(const Sass::SimpleSelector&) const’ was hidden [-Woverloaded-virtual=] 106 | virtual bool operator!=(const klass& rhs) const { return !(*this == rhs); }; \ | ^~~~~~~~ src/ast_selectors.hpp:139:5: note: in expansion of macro ‘ATTACH_VIRTUAL_CMP_OPERATIONS’ 139 | ATTACH_VIRTUAL_CMP_OPERATIONS(SimpleSelector); | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~ src/ast_def_macros.hpp:110:16: note: by ‘virtual bool Sass::ClassSelector::operator!=(const Sass::ClassSelector&) const’ 110 | virtual bool operator!=(const klass& rhs) const { return !(*this == rhs); }; \ | ^~~~~~~~ src/ast_selectors.hpp:188:5: note: in expansion of macro ‘ATTACH_CMP_OPERATIONS’ 188 | ATTACH_CMP_OPERATIONS(ClassSelector) | ^~~~~~~~~~~~~~~~~~~~~ src/ast_selectors.hpp:137:18: warning: ‘virtual bool Sass::SimpleSelector::operator==(const Sass::CompoundSelector&) const’ was hidden [-Woverloaded-virtual=] 137 | virtual bool operator==(const CompoundSelector& rhs) const; | ^~~~~~~~ src/ast_def_macros.hpp:109:16: note: by ‘Sass::IDSelector::operator==’ 109 | virtual bool operator==(const klass& rhs) const; \ | ^~~~~~~~ src/ast_selectors.hpp:204:5: note: in expansion of macro ‘ATTACH_CMP_OPERATIONS’ 204 | ATTACH_CMP_OPERATIONS(IDSelector) | ^~~~~~~~~~~~~~~~~~~~~ src/ast_selectors.hpp:136:18: warning: ‘virtual bool Sass::SimpleSelector::operator==(const Sass::ComplexSelector&) const’ was hidden [-Woverloaded-virtual=] 136 | virtual bool operator==(const ComplexSelector& rhs) const; | ^~~~~~~~ src/ast_def_macros.hpp:109:16: note: by ‘Sass::IDSelector::operator==’ 109 | virtual bool operator==(const klass& rhs) const; \ | ^~~~~~~~ src/ast_selectors.hpp:204:5: note: in expansion of macro ‘ATTACH_CMP_OPERATIONS’ 204 | ATTACH_CMP_OPERATIONS(IDSelector) | ^~~~~~~~~~~~~~~~~~~~~ src/ast_selectors.hpp:135:18: warning: ‘virtual bool Sass::SimpleSelector::operator==(const Sass::SelectorList&) const’ was hidden [-Woverloaded-virtual=] 135 | virtual bool operator==(const SelectorList& rhs) const; | ^~~~~~~~ src/ast_def_macros.hpp:109:16: note: by ‘Sass::IDSelector::operator==’ 109 | virtual bool operator==(const klass& rhs) const; \ | ^~~~~~~~ src/ast_selectors.hpp:204:5: note: in expansion of macro ‘ATTACH_CMP_OPERATIONS’ 204 | ATTACH_CMP_OPERATIONS(IDSelector) | ^~~~~~~~~~~~~~~~~~~~~ src/ast_selectors.hpp:133:10: warning: ‘virtual bool Sass::SimpleSelector::operator==(const Sass::Selector&) const’ was hidden [-Woverloaded-virtual=] 133 | bool operator==(const Selector& rhs) const final override; | ^~~~~~~~ src/ast_def_macros.hpp:109:16: note: by ‘Sass::IDSelector::operator==’ 109 | virtual bool operator==(const klass& rhs) const; \ | ^~~~~~~~ src/ast_selectors.hpp:204:5: note: in expansion of macro ‘ATTACH_CMP_OPERATIONS’ 204 | ATTACH_CMP_OPERATIONS(IDSelector) | ^~~~~~~~~~~~~~~~~~~~~ src/ast_def_macros.hpp:106:16: warning: ‘virtual bool Sass::SimpleSelector::operator!=(const Sass::SimpleSelector&) const’ was hidden [-Woverloaded-virtual=] 106 | virtual bool operator!=(const klass& rhs) const { return !(*this == rhs); }; \ | ^~~~~~~~ src/ast_selectors.hpp:139:5: note: in expansion of macro ‘ATTACH_VIRTUAL_CMP_OPERATIONS’ 139 | ATTACH_VIRTUAL_CMP_OPERATIONS(SimpleSelector); | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~ src/ast_def_macros.hpp:110:16: note: by ‘virtual bool Sass::IDSelector::operator!=(const Sass::IDSelector&) const’ 110 | virtual bool operator!=(const klass& rhs) const { return !(*this == rhs); }; \ | ^~~~~~~~ src/ast_selectors.hpp:204:5: note: in expansion of macro ‘ATTACH_CMP_OPERATIONS’ 204 | ATTACH_CMP_OPERATIONS(IDSelector) | ^~~~~~~~~~~~~~~~~~~~~ src/ast_selectors.hpp:137:18: warning: ‘virtual bool Sass::SimpleSelector::operator==(const Sass::CompoundSelector&) const’ was hidden [-Woverloaded-virtual=] 137 | virtual bool operator==(const CompoundSelector& rhs) const; | ^~~~~~~~ src/ast_def_macros.hpp:109:16: note: by ‘Sass::AttributeSelector::operator==’ 109 | virtual bool operator==(const klass& rhs) const; \ | ^~~~~~~~ src/ast_selectors.hpp:223:5: note: in expansion of macro ‘ATTACH_CMP_OPERATIONS’ 223 | ATTACH_CMP_OPERATIONS(AttributeSelector) | ^~~~~~~~~~~~~~~~~~~~~ src/ast_selectors.hpp:136:18: warning: ‘virtual bool Sass::SimpleSelector::operator==(const Sass::ComplexSelector&) const’ was hidden [-Woverloaded-virtual=] 136 | virtual bool operator==(const ComplexSelector& rhs) const; | ^~~~~~~~ src/ast_def_macros.hpp:109:16: note: by ‘Sass::AttributeSelector::operator==’ 109 | virtual bool operator==(const klass& rhs) const; \ | ^~~~~~~~ src/ast_selectors.hpp:223:5: note: in expansion of macro ‘ATTACH_CMP_OPERATIONS’ 223 | ATTACH_CMP_OPERATIONS(AttributeSelector) | ^~~~~~~~~~~~~~~~~~~~~ src/ast_selectors.hpp:135:18: warning: ‘virtual bool Sass::SimpleSelector::operator==(const Sass::SelectorList&) const’ was hidden [-Woverloaded-virtual=] 135 | virtual bool operator==(const SelectorList& rhs) const; | ^~~~~~~~ src/ast_def_macros.hpp:109:16: note: by ‘Sass::AttributeSelector::operator==’ 109 | virtual bool operator==(const klass& rhs) const; \ | ^~~~~~~~ src/ast_selectors.hpp:223:5: note: in expansion of macro ‘ATTACH_CMP_OPERATIONS’ 223 | ATTACH_CMP_OPERATIONS(AttributeSelector) | ^~~~~~~~~~~~~~~~~~~~~ src/ast_selectors.hpp:133:10: warning: ‘virtual bool Sass::SimpleSelector::operator==(const Sass::Selector&) const’ was hidden [-Woverloaded-virtual=] 133 | bool operator==(const Selector& rhs) const final override; | ^~~~~~~~ src/ast_def_macros.hpp:109:16: note: by ‘Sass::AttributeSelector::operator==’ 109 | virtual bool operator==(const klass& rhs) const; \ | ^~~~~~~~ src/ast_selectors.hpp:223:5: note: in expansion of macro ‘ATTACH_CMP_OPERATIONS’ 223 | ATTACH_CMP_OPERATIONS(AttributeSelector) | ^~~~~~~~~~~~~~~~~~~~~ src/ast_def_macros.hpp:106:16: warning: ‘virtual bool Sass::SimpleSelector::operator!=(const Sass::SimpleSelector&) const’ was hidden [-Woverloaded-virtual=] 106 | virtual bool operator!=(const klass& rhs) const { return !(*this == rhs); }; \ | ^~~~~~~~ src/ast_selectors.hpp:139:5: note: in expansion of macro ‘ATTACH_VIRTUAL_CMP_OPERATIONS’ 139 | ATTACH_VIRTUAL_CMP_OPERATIONS(SimpleSelector); | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~ src/ast_def_macros.hpp:110:16: note: by ‘virtual bool Sass::AttributeSelector::operator!=(const Sass::AttributeSelector&) const’ 110 | virtual bool operator!=(const klass& rhs) const { return !(*this == rhs); }; \ | ^~~~~~~~ src/ast_selectors.hpp:223:5: note: in expansion of macro ‘ATTACH_CMP_OPERATIONS’ 223 | ATTACH_CMP_OPERATIONS(AttributeSelector) | ^~~~~~~~~~~~~~~~~~~~~ src/ast_def_macros.hpp:106:16: warning: ‘virtual bool Sass::Selector::operator!=(const Sass::Selector&) const’ was hidden [-Woverloaded-virtual=] 106 | virtual bool operator!=(const klass& rhs) const { return !(*this == rhs); }; \ | ^~~~~~~~ src/ast_selectors.hpp:56:5: note: in expansion of macro ‘ATTACH_VIRTUAL_CMP_OPERATIONS’ 56 | ATTACH_VIRTUAL_CMP_OPERATIONS(Selector) | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~ src/ast_def_macros.hpp:110:16: note: by ‘virtual bool Sass::ComplexSelector::operator!=(const Sass::ComplexSelector&) const’ 110 | virtual bool operator!=(const klass& rhs) const { return !(*this == rhs); }; \ | ^~~~~~~~ src/ast_selectors.hpp:310:5: note: in expansion of macro ‘ATTACH_CMP_OPERATIONS’ 310 | ATTACH_CMP_OPERATIONS(ComplexSelector) | ^~~~~~~~~~~~~~~~~~~~~ src/ast_def_macros.hpp:106:16: warning: ‘virtual bool Sass::Selector::operator!=(const Sass::Selector&) const’ was hidden [-Woverloaded-virtual=] 106 | virtual bool operator!=(const klass& rhs) const { return !(*this == rhs); }; \ | ^~~~~~~~ src/ast_selectors.hpp:56:5: note: in expansion of macro ‘ATTACH_VIRTUAL_CMP_OPERATIONS’ 56 | ATTACH_VIRTUAL_CMP_OPERATIONS(Selector) | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~ src/ast_def_macros.hpp:106:16: note: by ‘virtual bool Sass::SelectorComponent::operator!=(const Sass::SelectorComponent&) const’ 106 | virtual bool operator!=(const klass& rhs) const { return !(*this == rhs); }; \ | ^~~~~~~~ src/ast_selectors.hpp:349:5: note: in expansion of macro ‘ATTACH_VIRTUAL_CMP_OPERATIONS’ 349 | ATTACH_VIRTUAL_CMP_OPERATIONS(SelectorComponent); | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~ src/ast_def_macros.hpp:106:16: warning: ‘virtual bool Sass::SelectorComponent::operator!=(const Sass::SelectorComponent&) const’ was hidden [-Woverloaded-virtual=] 106 | virtual bool operator!=(const klass& rhs) const { return !(*this == rhs); }; \ | ^~~~~~~~ src/ast_selectors.hpp:349:5: note: in expansion of macro ‘ATTACH_VIRTUAL_CMP_OPERATIONS’ 349 | ATTACH_VIRTUAL_CMP_OPERATIONS(SelectorComponent); | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~ src/ast_def_macros.hpp:110:16: note: by ‘virtual bool Sass::SelectorCombinator::operator!=(const Sass::SelectorCombinator&) const’ 110 | virtual bool operator!=(const klass& rhs) const { return !(*this == rhs); }; \ | ^~~~~~~~ src/ast_selectors.hpp:407:5: note: in expansion of macro ‘ATTACH_CMP_OPERATIONS’ 407 | ATTACH_CMP_OPERATIONS(SelectorCombinator) | ^~~~~~~~~~~~~~~~~~~~~ g++ -std=gnu++17 -Wall -O2 -std=c++11 -I ./include -fPIC -c -o src/fn_strings.o src/fn_strings.cpp In file included from src/fn_strings.cpp:6: src/ast.hpp:90:18: warning: ‘virtual bool Sass::AST_Node::operator==(const Sass::AST_Node&) const’ was hidden [-Woverloaded-virtual=] 90 | virtual bool operator== (const AST_Node& rhs) const { | ^~~~~~~~ src/ast.hpp:165:18: note: by ‘virtual bool Sass::Expression::operator==(const Sass::Expression&) const’ 165 | virtual bool operator== (const Expression& rhs) const { return false; } | ^~~~~~~~ src/ast.hpp:96:18: warning: ‘virtual bool Sass::AST_Node::operator!=(const Sass::AST_Node&) const’ was hidden [-Woverloaded-virtual=] 96 | virtual bool operator!= (const AST_Node& rhs) const { | ^~~~~~~~ src/ast.hpp:167:17: note: by ‘bool Sass::Expression::operator!=(const Sass::Expression&) const’ 167 | inline bool operator!=(const Expression& rhs) const { return !(rhs == *this); } | ^~~~~~~~ src/ast.hpp:90:18: warning: ‘virtual bool Sass::AST_Node::operator==(const Sass::AST_Node&) const’ was hidden [-Woverloaded-virtual=] 90 | virtual bool operator== (const AST_Node& rhs) const { | ^~~~~~~~ src/ast.hpp:908:10: note: by ‘bool Sass::CssMediaRule::operator==(const Sass::CssMediaRule&) const’ 908 | bool operator== (const CssMediaRule& rhs) const { | ^~~~~~~~ src/ast.hpp:96:18: warning: ‘virtual bool Sass::AST_Node::operator!=(const Sass::AST_Node&) const’ was hidden [-Woverloaded-virtual=] 96 | virtual bool operator!= (const AST_Node& rhs) const { | ^~~~~~~~ src/ast.hpp:911:10: note: by ‘bool Sass::CssMediaRule::operator!=(const Sass::CssMediaRule&) const’ 911 | bool operator!=(const CssMediaRule& rhs) const { | ^~~~~~~~ src/ast.hpp:90:18: warning: ‘virtual bool Sass::AST_Node::operator==(const Sass::AST_Node&) const’ was hidden [-Woverloaded-virtual=] 90 | virtual bool operator== (const AST_Node& rhs) const { | ^~~~~~~~ src/ast.hpp:939:10: note: by ‘bool Sass::CssMediaQuery::operator==(const Sass::CssMediaQuery&) const’ 939 | bool operator== (const CssMediaQuery& rhs) const; | ^~~~~~~~ src/ast.hpp:96:18: warning: ‘virtual bool Sass::AST_Node::operator!=(const Sass::AST_Node&) const’ was hidden [-Woverloaded-virtual=] 96 | virtual bool operator!= (const AST_Node& rhs) const { | ^~~~~~~~ src/ast.hpp:940:10: note: by ‘bool Sass::CssMediaQuery::operator!=(const Sass::CssMediaQuery&) const’ 940 | bool operator!=(const CssMediaQuery& rhs) const { | ^~~~~~~~ src/ast.hpp:165:18: warning: ‘virtual bool Sass::Expression::operator==(const Sass::Expression&) const’ was hidden [-Woverloaded-virtual=] 165 | virtual bool operator== (const Expression& rhs) const { return false; } | ^~~~~~~~ In file included from src/ast.hpp:14: src/ast_def_macros.hpp:105:16: note: by ‘virtual bool Sass::Selector::operator==(const Sass::Selector&) const’ 105 | virtual bool operator==(const klass& rhs) const = 0; \ | ^~~~~~~~ src/ast_selectors.hpp:56:5: note: in expansion of macro ‘ATTACH_VIRTUAL_CMP_OPERATIONS’ 56 | ATTACH_VIRTUAL_CMP_OPERATIONS(Selector) | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~ src/ast.hpp:96:18: warning: ‘virtual bool Sass::AST_Node::operator!=(const Sass::AST_Node&) const’ was hidden [-Woverloaded-virtual=] 96 | virtual bool operator!= (const AST_Node& rhs) const { | ^~~~~~~~ src/ast_def_macros.hpp:106:16: note: by ‘virtual bool Sass::Selector::operator!=(const Sass::Selector&) const’ 106 | virtual bool operator!=(const klass& rhs) const { return !(*this == rhs); }; \ | ^~~~~~~~ src/ast_selectors.hpp:56:5: note: in expansion of macro ‘ATTACH_VIRTUAL_CMP_OPERATIONS’ 56 | ATTACH_VIRTUAL_CMP_OPERATIONS(Selector) | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~ src/ast_def_macros.hpp:106:16: warning: ‘virtual bool Sass::Selector::operator!=(const Sass::Selector&) const’ was hidden [-Woverloaded-virtual=] 106 | virtual bool operator!=(const klass& rhs) const { return !(*this == rhs); }; \ | ^~~~~~~~ src/ast_selectors.hpp:56:5: note: in expansion of macro ‘ATTACH_VIRTUAL_CMP_OPERATIONS’ 56 | ATTACH_VIRTUAL_CMP_OPERATIONS(Selector) | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~ src/ast_def_macros.hpp:106:16: note: by ‘virtual bool Sass::SimpleSelector::operator!=(const Sass::SimpleSelector&) const’ 106 | virtual bool operator!=(const klass& rhs) const { return !(*this == rhs); }; \ | ^~~~~~~~ src/ast_selectors.hpp:139:5: note: in expansion of macro ‘ATTACH_VIRTUAL_CMP_OPERATIONS’ 139 | ATTACH_VIRTUAL_CMP_OPERATIONS(SimpleSelector); | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~ In file included from src/ast.hpp:1055: src/ast_selectors.hpp:137:18: warning: ‘virtual bool Sass::SimpleSelector::operator==(const Sass::CompoundSelector&) const’ was hidden [-Woverloaded-virtual=] 137 | virtual bool operator==(const CompoundSelector& rhs) const; | ^~~~~~~~ src/ast_def_macros.hpp:109:16: note: by ‘Sass::PlaceholderSelector::operator==’ 109 | virtual bool operator==(const klass& rhs) const; \ | ^~~~~~~~ src/ast_selectors.hpp:157:5: note: in expansion of macro ‘ATTACH_CMP_OPERATIONS’ 157 | ATTACH_CMP_OPERATIONS(PlaceholderSelector) | ^~~~~~~~~~~~~~~~~~~~~ src/ast_selectors.hpp:136:18: warning: ‘virtual bool Sass::SimpleSelector::operator==(const Sass::ComplexSelector&) const’ was hidden [-Woverloaded-virtual=] 136 | virtual bool operator==(const ComplexSelector& rhs) const; | ^~~~~~~~ src/ast_def_macros.hpp:109:16: note: by ‘Sass::PlaceholderSelector::operator==’ 109 | virtual bool operator==(const klass& rhs) const; \ | ^~~~~~~~ src/ast_selectors.hpp:157:5: note: in expansion of macro ‘ATTACH_CMP_OPERATIONS’ 157 | ATTACH_CMP_OPERATIONS(PlaceholderSelector) | ^~~~~~~~~~~~~~~~~~~~~ src/ast_selectors.hpp:135:18: warning: ‘virtual bool Sass::SimpleSelector::operator==(const Sass::SelectorList&) const’ was hidden [-Woverloaded-virtual=] 135 | virtual bool operator==(const SelectorList& rhs) const; | ^~~~~~~~ src/ast_def_macros.hpp:109:16: note: by ‘Sass::PlaceholderSelector::operator==’ 109 | virtual bool operator==(const klass& rhs) const; \ | ^~~~~~~~ src/ast_selectors.hpp:157:5: note: in expansion of macro ‘ATTACH_CMP_OPERATIONS’ 157 | ATTACH_CMP_OPERATIONS(PlaceholderSelector) | ^~~~~~~~~~~~~~~~~~~~~ src/ast_selectors.hpp:133:10: warning: ‘virtual bool Sass::SimpleSelector::operator==(const Sass::Selector&) const’ was hidden [-Woverloaded-virtual=] 133 | bool operator==(const Selector& rhs) const final override; | ^~~~~~~~ src/ast_def_macros.hpp:109:16: note: by ‘Sass::PlaceholderSelector::operator==’ 109 | virtual bool operator==(const klass& rhs) const; \ | ^~~~~~~~ src/ast_selectors.hpp:157:5: note: in expansion of macro ‘ATTACH_CMP_OPERATIONS’ 157 | ATTACH_CMP_OPERATIONS(PlaceholderSelector) | ^~~~~~~~~~~~~~~~~~~~~ src/ast_def_macros.hpp:106:16: warning: ‘virtual bool Sass::SimpleSelector::operator!=(const Sass::SimpleSelector&) const’ was hidden [-Woverloaded-virtual=] 106 | virtual bool operator!=(const klass& rhs) const { return !(*this == rhs); }; \ | ^~~~~~~~ src/ast_selectors.hpp:139:5: note: in expansion of macro ‘ATTACH_VIRTUAL_CMP_OPERATIONS’ 139 | ATTACH_VIRTUAL_CMP_OPERATIONS(SimpleSelector); | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~ src/ast_def_macros.hpp:110:16: note: by ‘virtual bool Sass::PlaceholderSelector::operator!=(const Sass::PlaceholderSelector&) const’ 110 | virtual bool operator!=(const klass& rhs) const { return !(*this == rhs); }; \ | ^~~~~~~~ src/ast_selectors.hpp:157:5: note: in expansion of macro ‘ATTACH_CMP_OPERATIONS’ 157 | ATTACH_CMP_OPERATIONS(PlaceholderSelector) | ^~~~~~~~~~~~~~~~~~~~~ src/ast_selectors.hpp:137:18: warning: ‘virtual bool Sass::SimpleSelector::operator==(const Sass::CompoundSelector&) const’ was hidden [-Woverloaded-virtual=] 137 | virtual bool operator==(const CompoundSelector& rhs) const; | ^~~~~~~~ src/ast_def_macros.hpp:109:16: note: by ‘Sass::TypeSelector::operator==’ 109 | virtual bool operator==(const klass& rhs) const; \ | ^~~~~~~~ src/ast_selectors.hpp:174:5: note: in expansion of macro ‘ATTACH_CMP_OPERATIONS’ 174 | ATTACH_CMP_OPERATIONS(TypeSelector) | ^~~~~~~~~~~~~~~~~~~~~ src/ast_selectors.hpp:136:18: warning: ‘virtual bool Sass::SimpleSelector::operator==(const Sass::ComplexSelector&) const’ was hidden [-Woverloaded-virtual=] 136 | virtual bool operator==(const ComplexSelector& rhs) const; | ^~~~~~~~ src/ast_def_macros.hpp:109:16: note: by ‘Sass::TypeSelector::operator==’ 109 | virtual bool operator==(const klass& rhs) const; \ | ^~~~~~~~ src/ast_selectors.hpp:174:5: note: in expansion of macro ‘ATTACH_CMP_OPERATIONS’ 174 | ATTACH_CMP_OPERATIONS(TypeSelector) | ^~~~~~~~~~~~~~~~~~~~~ src/ast_selectors.hpp:135:18: warning: ‘virtual bool Sass::SimpleSelector::operator==(const Sass::SelectorList&) const’ was hidden [-Woverloaded-virtual=] 135 | virtual bool operator==(const SelectorList& rhs) const; | ^~~~~~~~ src/ast_def_macros.hpp:109:16: note: by ‘Sass::TypeSelector::operator==’ 109 | virtual bool operator==(const klass& rhs) const; \ | ^~~~~~~~ src/ast_selectors.hpp:174:5: note: in expansion of macro ‘ATTACH_CMP_OPERATIONS’ 174 | ATTACH_CMP_OPERATIONS(TypeSelector) | ^~~~~~~~~~~~~~~~~~~~~ src/ast_selectors.hpp:133:10: warning: ‘virtual bool Sass::SimpleSelector::operator==(const Sass::Selector&) const’ was hidden [-Woverloaded-virtual=] 133 | bool operator==(const Selector& rhs) const final override; | ^~~~~~~~ src/ast_def_macros.hpp:109:16: note: by ‘Sass::TypeSelector::operator==’ 109 | virtual bool operator==(const klass& rhs) const; \ | ^~~~~~~~ src/ast_selectors.hpp:174:5: note: in expansion of macro ‘ATTACH_CMP_OPERATIONS’ 174 | ATTACH_CMP_OPERATIONS(TypeSelector) | ^~~~~~~~~~~~~~~~~~~~~ src/ast_def_macros.hpp:106:16: warning: ‘virtual bool Sass::SimpleSelector::operator!=(const Sass::SimpleSelector&) const’ was hidden [-Woverloaded-virtual=] 106 | virtual bool operator!=(const klass& rhs) const { return !(*this == rhs); }; \ | ^~~~~~~~ src/ast_selectors.hpp:139:5: note: in expansion of macro ‘ATTACH_VIRTUAL_CMP_OPERATIONS’ 139 | ATTACH_VIRTUAL_CMP_OPERATIONS(SimpleSelector); | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~ src/ast_def_macros.hpp:110:16: note: by ‘virtual bool Sass::TypeSelector::operator!=(const Sass::TypeSelector&) const’ 110 | virtual bool operator!=(const klass& rhs) const { return !(*this == rhs); }; \ | ^~~~~~~~ src/ast_selectors.hpp:174:5: note: in expansion of macro ‘ATTACH_CMP_OPERATIONS’ 174 | ATTACH_CMP_OPERATIONS(TypeSelector) | ^~~~~~~~~~~~~~~~~~~~~ src/ast_selectors.hpp:137:18: warning: ‘virtual bool Sass::SimpleSelector::operator==(const Sass::CompoundSelector&) const’ was hidden [-Woverloaded-virtual=] 137 | virtual bool operator==(const CompoundSelector& rhs) const; | ^~~~~~~~ src/ast_def_macros.hpp:109:16: note: by ‘Sass::ClassSelector::operator==’ 109 | virtual bool operator==(const klass& rhs) const; \ | ^~~~~~~~ src/ast_selectors.hpp:188:5: note: in expansion of macro ‘ATTACH_CMP_OPERATIONS’ 188 | ATTACH_CMP_OPERATIONS(ClassSelector) | ^~~~~~~~~~~~~~~~~~~~~ src/ast_selectors.hpp:136:18: warning: ‘virtual bool Sass::SimpleSelector::operator==(const Sass::ComplexSelector&) const’ was hidden [-Woverloaded-virtual=] 136 | virtual bool operator==(const ComplexSelector& rhs) const; | ^~~~~~~~ src/ast_def_macros.hpp:109:16: note: by ‘Sass::ClassSelector::operator==’ 109 | virtual bool operator==(const klass& rhs) const; \ | ^~~~~~~~ src/ast_selectors.hpp:188:5: note: in expansion of macro ‘ATTACH_CMP_OPERATIONS’ 188 | ATTACH_CMP_OPERATIONS(ClassSelector) | ^~~~~~~~~~~~~~~~~~~~~ src/ast_selectors.hpp:135:18: warning: ‘virtual bool Sass::SimpleSelector::operator==(const Sass::SelectorList&) const’ was hidden [-Woverloaded-virtual=] 135 | virtual bool operator==(const SelectorList& rhs) const; | ^~~~~~~~ src/ast_def_macros.hpp:109:16: note: by ‘Sass::ClassSelector::operator==’ 109 | virtual bool operator==(const klass& rhs) const; \ | ^~~~~~~~ src/ast_selectors.hpp:188:5: note: in expansion of macro ‘ATTACH_CMP_OPERATIONS’ 188 | ATTACH_CMP_OPERATIONS(ClassSelector) | ^~~~~~~~~~~~~~~~~~~~~ src/ast_selectors.hpp:133:10: warning: ‘virtual bool Sass::SimpleSelector::operator==(const Sass::Selector&) const’ was hidden [-Woverloaded-virtual=] 133 | bool operator==(const Selector& rhs) const final override; | ^~~~~~~~ src/ast_def_macros.hpp:109:16: note: by ‘Sass::ClassSelector::operator==’ 109 | virtual bool operator==(const klass& rhs) const; \ | ^~~~~~~~ src/ast_selectors.hpp:188:5: note: in expansion of macro ‘ATTACH_CMP_OPERATIONS’ 188 | ATTACH_CMP_OPERATIONS(ClassSelector) | ^~~~~~~~~~~~~~~~~~~~~ src/ast_def_macros.hpp:106:16: warning: ‘virtual bool Sass::SimpleSelector::operator!=(const Sass::SimpleSelector&) const’ was hidden [-Woverloaded-virtual=] 106 | virtual bool operator!=(const klass& rhs) const { return !(*this == rhs); }; \ | ^~~~~~~~ src/ast_selectors.hpp:139:5: note: in expansion of macro ‘ATTACH_VIRTUAL_CMP_OPERATIONS’ 139 | ATTACH_VIRTUAL_CMP_OPERATIONS(SimpleSelector); | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~ src/ast_def_macros.hpp:110:16: note: by ‘virtual bool Sass::ClassSelector::operator!=(const Sass::ClassSelector&) const’ 110 | virtual bool operator!=(const klass& rhs) const { return !(*this == rhs); }; \ | ^~~~~~~~ src/ast_selectors.hpp:188:5: note: in expansion of macro ‘ATTACH_CMP_OPERATIONS’ 188 | ATTACH_CMP_OPERATIONS(ClassSelector) | ^~~~~~~~~~~~~~~~~~~~~ src/ast_selectors.hpp:137:18: warning: ‘virtual bool Sass::SimpleSelector::operator==(const Sass::CompoundSelector&) const’ was hidden [-Woverloaded-virtual=] 137 | virtual bool operator==(const CompoundSelector& rhs) const; | ^~~~~~~~ src/ast_def_macros.hpp:109:16: note: by ‘Sass::IDSelector::operator==’ 109 | virtual bool operator==(const klass& rhs) const; \ | ^~~~~~~~ src/ast_selectors.hpp:204:5: note: in expansion of macro ‘ATTACH_CMP_OPERATIONS’ 204 | ATTACH_CMP_OPERATIONS(IDSelector) | ^~~~~~~~~~~~~~~~~~~~~ src/ast_selectors.hpp:136:18: warning: ‘virtual bool Sass::SimpleSelector::operator==(const Sass::ComplexSelector&) const’ was hidden [-Woverloaded-virtual=] 136 | virtual bool operator==(const ComplexSelector& rhs) const; | ^~~~~~~~ src/ast_def_macros.hpp:109:16: note: by ‘Sass::IDSelector::operator==’ 109 | virtual bool operator==(const klass& rhs) const; \ | ^~~~~~~~ src/ast_selectors.hpp:204:5: note: in expansion of macro ‘ATTACH_CMP_OPERATIONS’ 204 | ATTACH_CMP_OPERATIONS(IDSelector) | ^~~~~~~~~~~~~~~~~~~~~ src/ast_selectors.hpp:135:18: warning: ‘virtual bool Sass::SimpleSelector::operator==(const Sass::SelectorList&) const’ was hidden [-Woverloaded-virtual=] 135 | virtual bool operator==(const SelectorList& rhs) const; | ^~~~~~~~ src/ast_def_macros.hpp:109:16: note: by ‘Sass::IDSelector::operator==’ 109 | virtual bool operator==(const klass& rhs) const; \ | ^~~~~~~~ src/ast_selectors.hpp:204:5: note: in expansion of macro ‘ATTACH_CMP_OPERATIONS’ 204 | ATTACH_CMP_OPERATIONS(IDSelector) | ^~~~~~~~~~~~~~~~~~~~~ src/ast_selectors.hpp:133:10: warning: ‘virtual bool Sass::SimpleSelector::operator==(const Sass::Selector&) const’ was hidden [-Woverloaded-virtual=] 133 | bool operator==(const Selector& rhs) const final override; | ^~~~~~~~ src/ast_def_macros.hpp:109:16: note: by ‘Sass::IDSelector::operator==’ 109 | virtual bool operator==(const klass& rhs) const; \ | ^~~~~~~~ src/ast_selectors.hpp:204:5: note: in expansion of macro ‘ATTACH_CMP_OPERATIONS’ 204 | ATTACH_CMP_OPERATIONS(IDSelector) | ^~~~~~~~~~~~~~~~~~~~~ src/ast_def_macros.hpp:106:16: warning: ‘virtual bool Sass::SimpleSelector::operator!=(const Sass::SimpleSelector&) const’ was hidden [-Woverloaded-virtual=] 106 | virtual bool operator!=(const klass& rhs) const { return !(*this == rhs); }; \ | ^~~~~~~~ src/ast_selectors.hpp:139:5: note: in expansion of macro ‘ATTACH_VIRTUAL_CMP_OPERATIONS’ 139 | ATTACH_VIRTUAL_CMP_OPERATIONS(SimpleSelector); | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~ src/ast_def_macros.hpp:110:16: note: by ‘virtual bool Sass::IDSelector::operator!=(const Sass::IDSelector&) const’ 110 | virtual bool operator!=(const klass& rhs) const { return !(*this == rhs); }; \ | ^~~~~~~~ src/ast_selectors.hpp:204:5: note: in expansion of macro ‘ATTACH_CMP_OPERATIONS’ 204 | ATTACH_CMP_OPERATIONS(IDSelector) | ^~~~~~~~~~~~~~~~~~~~~ src/ast_selectors.hpp:137:18: warning: ‘virtual bool Sass::SimpleSelector::operator==(const Sass::CompoundSelector&) const’ was hidden [-Woverloaded-virtual=] 137 | virtual bool operator==(const CompoundSelector& rhs) const; | ^~~~~~~~ src/ast_def_macros.hpp:109:16: note: by ‘Sass::AttributeSelector::operator==’ 109 | virtual bool operator==(const klass& rhs) const; \ | ^~~~~~~~ src/ast_selectors.hpp:223:5: note: in expansion of macro ‘ATTACH_CMP_OPERATIONS’ 223 | ATTACH_CMP_OPERATIONS(AttributeSelector) | ^~~~~~~~~~~~~~~~~~~~~ src/ast_selectors.hpp:136:18: warning: ‘virtual bool Sass::SimpleSelector::operator==(const Sass::ComplexSelector&) const’ was hidden [-Woverloaded-virtual=] 136 | virtual bool operator==(const ComplexSelector& rhs) const; | ^~~~~~~~ src/ast_def_macros.hpp:109:16: note: by ‘Sass::AttributeSelector::operator==’ 109 | virtual bool operator==(const klass& rhs) const; \ | ^~~~~~~~ src/ast_selectors.hpp:223:5: note: in expansion of macro ‘ATTACH_CMP_OPERATIONS’ 223 | ATTACH_CMP_OPERATIONS(AttributeSelector) | ^~~~~~~~~~~~~~~~~~~~~ src/ast_selectors.hpp:135:18: warning: ‘virtual bool Sass::SimpleSelector::operator==(const Sass::SelectorList&) const’ was hidden [-Woverloaded-virtual=] 135 | virtual bool operator==(const SelectorList& rhs) const; | ^~~~~~~~ src/ast_def_macros.hpp:109:16: note: by ‘Sass::AttributeSelector::operator==’ 109 | virtual bool operator==(const klass& rhs) const; \ | ^~~~~~~~ src/ast_selectors.hpp:223:5: note: in expansion of macro ‘ATTACH_CMP_OPERATIONS’ 223 | ATTACH_CMP_OPERATIONS(AttributeSelector) | ^~~~~~~~~~~~~~~~~~~~~ src/ast_selectors.hpp:133:10: warning: ‘virtual bool Sass::SimpleSelector::operator==(const Sass::Selector&) const’ was hidden [-Woverloaded-virtual=] 133 | bool operator==(const Selector& rhs) const final override; | ^~~~~~~~ src/ast_def_macros.hpp:109:16: note: by ‘Sass::AttributeSelector::operator==’ 109 | virtual bool operator==(const klass& rhs) const; \ | ^~~~~~~~ src/ast_selectors.hpp:223:5: note: in expansion of macro ‘ATTACH_CMP_OPERATIONS’ 223 | ATTACH_CMP_OPERATIONS(AttributeSelector) | ^~~~~~~~~~~~~~~~~~~~~ src/ast_def_macros.hpp:106:16: warning: ‘virtual bool Sass::SimpleSelector::operator!=(const Sass::SimpleSelector&) const’ was hidden [-Woverloaded-virtual=] 106 | virtual bool operator!=(const klass& rhs) const { return !(*this == rhs); }; \ | ^~~~~~~~ src/ast_selectors.hpp:139:5: note: in expansion of macro ‘ATTACH_VIRTUAL_CMP_OPERATIONS’ 139 | ATTACH_VIRTUAL_CMP_OPERATIONS(SimpleSelector); | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~ src/ast_def_macros.hpp:110:16: note: by ‘virtual bool Sass::AttributeSelector::operator!=(const Sass::AttributeSelector&) const’ 110 | virtual bool operator!=(const klass& rhs) const { return !(*this == rhs); }; \ | ^~~~~~~~ src/ast_selectors.hpp:223:5: note: in expansion of macro ‘ATTACH_CMP_OPERATIONS’ 223 | ATTACH_CMP_OPERATIONS(AttributeSelector) | ^~~~~~~~~~~~~~~~~~~~~ src/ast_def_macros.hpp:106:16: warning: ‘virtual bool Sass::Selector::operator!=(const Sass::Selector&) const’ was hidden [-Woverloaded-virtual=] 106 | virtual bool operator!=(const klass& rhs) const { return !(*this == rhs); }; \ | ^~~~~~~~ src/ast_selectors.hpp:56:5: note: in expansion of macro ‘ATTACH_VIRTUAL_CMP_OPERATIONS’ 56 | ATTACH_VIRTUAL_CMP_OPERATIONS(Selector) | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~ src/ast_def_macros.hpp:110:16: note: by ‘virtual bool Sass::ComplexSelector::operator!=(const Sass::ComplexSelector&) const’ 110 | virtual bool operator!=(const klass& rhs) const { return !(*this == rhs); }; \ | ^~~~~~~~ src/ast_selectors.hpp:310:5: note: in expansion of macro ‘ATTACH_CMP_OPERATIONS’ 310 | ATTACH_CMP_OPERATIONS(ComplexSelector) | ^~~~~~~~~~~~~~~~~~~~~ src/ast_def_macros.hpp:106:16: warning: ‘virtual bool Sass::Selector::operator!=(const Sass::Selector&) const’ was hidden [-Woverloaded-virtual=] 106 | virtual bool operator!=(const klass& rhs) const { return !(*this == rhs); }; \ | ^~~~~~~~ src/ast_selectors.hpp:56:5: note: in expansion of macro ‘ATTACH_VIRTUAL_CMP_OPERATIONS’ 56 | ATTACH_VIRTUAL_CMP_OPERATIONS(Selector) | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~ src/ast_def_macros.hpp:106:16: note: by ‘virtual bool Sass::SelectorComponent::operator!=(const Sass::SelectorComponent&) const’ 106 | virtual bool operator!=(const klass& rhs) const { return !(*this == rhs); }; \ | ^~~~~~~~ src/ast_selectors.hpp:349:5: note: in expansion of macro ‘ATTACH_VIRTUAL_CMP_OPERATIONS’ 349 | ATTACH_VIRTUAL_CMP_OPERATIONS(SelectorComponent); | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~ src/ast_def_macros.hpp:106:16: warning: ‘virtual bool Sass::SelectorComponent::operator!=(const Sass::SelectorComponent&) const’ was hidden [-Woverloaded-virtual=] 106 | virtual bool operator!=(const klass& rhs) const { return !(*this == rhs); }; \ | ^~~~~~~~ src/ast_selectors.hpp:349:5: note: in expansion of macro ‘ATTACH_VIRTUAL_CMP_OPERATIONS’ 349 | ATTACH_VIRTUAL_CMP_OPERATIONS(SelectorComponent); | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~ src/ast_def_macros.hpp:110:16: note: by ‘virtual bool Sass::SelectorCombinator::operator!=(const Sass::SelectorCombinator&) const’ 110 | virtual bool operator!=(const klass& rhs) const { return !(*this == rhs); }; \ | ^~~~~~~~ src/ast_selectors.hpp:407:5: note: in expansion of macro ‘ATTACH_CMP_OPERATIONS’ 407 | ATTACH_CMP_OPERATIONS(SelectorCombinator) | ^~~~~~~~~~~~~~~~~~~~~ g++ -std=gnu++17 -Wall -O2 -std=c++11 -I ./include -fPIC -c -o src/fn_selectors.o src/fn_selectors.cpp In file included from src/parser.hpp:11, from src/fn_selectors.cpp:3: src/ast.hpp:90:18: warning: ‘virtual bool Sass::AST_Node::operator==(const Sass::AST_Node&) const’ was hidden [-Woverloaded-virtual=] 90 | virtual bool operator== (const AST_Node& rhs) const { | ^~~~~~~~ src/ast.hpp:165:18: note: by ‘virtual bool Sass::Expression::operator==(const Sass::Expression&) const’ 165 | virtual bool operator== (const Expression& rhs) const { return false; } | ^~~~~~~~ src/ast.hpp:96:18: warning: ‘virtual bool Sass::AST_Node::operator!=(const Sass::AST_Node&) const’ was hidden [-Woverloaded-virtual=] 96 | virtual bool operator!= (const AST_Node& rhs) const { | ^~~~~~~~ src/ast.hpp:167:17: note: by ‘bool Sass::Expression::operator!=(const Sass::Expression&) const’ 167 | inline bool operator!=(const Expression& rhs) const { return !(rhs == *this); } | ^~~~~~~~ src/ast.hpp:90:18: warning: ‘virtual bool Sass::AST_Node::operator==(const Sass::AST_Node&) const’ was hidden [-Woverloaded-virtual=] 90 | virtual bool operator== (const AST_Node& rhs) const { | ^~~~~~~~ src/ast.hpp:908:10: note: by ‘bool Sass::CssMediaRule::operator==(const Sass::CssMediaRule&) const’ 908 | bool operator== (const CssMediaRule& rhs) const { | ^~~~~~~~ src/ast.hpp:96:18: warning: ‘virtual bool Sass::AST_Node::operator!=(const Sass::AST_Node&) const’ was hidden [-Woverloaded-virtual=] 96 | virtual bool operator!= (const AST_Node& rhs) const { | ^~~~~~~~ src/ast.hpp:911:10: note: by ‘bool Sass::CssMediaRule::operator!=(const Sass::CssMediaRule&) const’ 911 | bool operator!=(const CssMediaRule& rhs) const { | ^~~~~~~~ src/ast.hpp:90:18: warning: ‘virtual bool Sass::AST_Node::operator==(const Sass::AST_Node&) const’ was hidden [-Woverloaded-virtual=] 90 | virtual bool operator== (const AST_Node& rhs) const { | ^~~~~~~~ src/ast.hpp:939:10: note: by ‘bool Sass::CssMediaQuery::operator==(const Sass::CssMediaQuery&) const’ 939 | bool operator== (const CssMediaQuery& rhs) const; | ^~~~~~~~ src/ast.hpp:96:18: warning: ‘virtual bool Sass::AST_Node::operator!=(const Sass::AST_Node&) const’ was hidden [-Woverloaded-virtual=] 96 | virtual bool operator!= (const AST_Node& rhs) const { | ^~~~~~~~ src/ast.hpp:940:10: note: by ‘bool Sass::CssMediaQuery::operator!=(const Sass::CssMediaQuery&) const’ 940 | bool operator!=(const CssMediaQuery& rhs) const { | ^~~~~~~~ src/ast.hpp:165:18: warning: ‘virtual bool Sass::Expression::operator==(const Sass::Expression&) const’ was hidden [-Woverloaded-virtual=] 165 | virtual bool operator== (const Expression& rhs) const { return false; } | ^~~~~~~~ In file included from src/ast.hpp:14: src/ast_def_macros.hpp:105:16: note: by ‘virtual bool Sass::Selector::operator==(const Sass::Selector&) const’ 105 | virtual bool operator==(const klass& rhs) const = 0; \ | ^~~~~~~~ src/ast_selectors.hpp:56:5: note: in expansion of macro ‘ATTACH_VIRTUAL_CMP_OPERATIONS’ 56 | ATTACH_VIRTUAL_CMP_OPERATIONS(Selector) | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~ src/ast.hpp:96:18: warning: ‘virtual bool Sass::AST_Node::operator!=(const Sass::AST_Node&) const’ was hidden [-Woverloaded-virtual=] 96 | virtual bool operator!= (const AST_Node& rhs) const { | ^~~~~~~~ src/ast_def_macros.hpp:106:16: note: by ‘virtual bool Sass::Selector::operator!=(const Sass::Selector&) const’ 106 | virtual bool operator!=(const klass& rhs) const { return !(*this == rhs); }; \ | ^~~~~~~~ src/ast_selectors.hpp:56:5: note: in expansion of macro ‘ATTACH_VIRTUAL_CMP_OPERATIONS’ 56 | ATTACH_VIRTUAL_CMP_OPERATIONS(Selector) | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~ src/ast_def_macros.hpp:106:16: warning: ‘virtual bool Sass::Selector::operator!=(const Sass::Selector&) const’ was hidden [-Woverloaded-virtual=] 106 | virtual bool operator!=(const klass& rhs) const { return !(*this == rhs); }; \ | ^~~~~~~~ src/ast_selectors.hpp:56:5: note: in expansion of macro ‘ATTACH_VIRTUAL_CMP_OPERATIONS’ 56 | ATTACH_VIRTUAL_CMP_OPERATIONS(Selector) | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~ src/ast_def_macros.hpp:106:16: note: by ‘virtual bool Sass::SimpleSelector::operator!=(const Sass::SimpleSelector&) const’ 106 | virtual bool operator!=(const klass& rhs) const { return !(*this == rhs); }; \ | ^~~~~~~~ src/ast_selectors.hpp:139:5: note: in expansion of macro ‘ATTACH_VIRTUAL_CMP_OPERATIONS’ 139 | ATTACH_VIRTUAL_CMP_OPERATIONS(SimpleSelector); | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~ In file included from src/ast.hpp:1055: src/ast_selectors.hpp:137:18: warning: ‘virtual bool Sass::SimpleSelector::operator==(const Sass::CompoundSelector&) const’ was hidden [-Woverloaded-virtual=] 137 | virtual bool operator==(const CompoundSelector& rhs) const; | ^~~~~~~~ src/ast_def_macros.hpp:109:16: note: by ‘Sass::PlaceholderSelector::operator==’ 109 | virtual bool operator==(const klass& rhs) const; \ | ^~~~~~~~ src/ast_selectors.hpp:157:5: note: in expansion of macro ‘ATTACH_CMP_OPERATIONS’ 157 | ATTACH_CMP_OPERATIONS(PlaceholderSelector) | ^~~~~~~~~~~~~~~~~~~~~ src/ast_selectors.hpp:136:18: warning: ‘virtual bool Sass::SimpleSelector::operator==(const Sass::ComplexSelector&) const’ was hidden [-Woverloaded-virtual=] 136 | virtual bool operator==(const ComplexSelector& rhs) const; | ^~~~~~~~ src/ast_def_macros.hpp:109:16: note: by ‘Sass::PlaceholderSelector::operator==’ 109 | virtual bool operator==(const klass& rhs) const; \ | ^~~~~~~~ src/ast_selectors.hpp:157:5: note: in expansion of macro ‘ATTACH_CMP_OPERATIONS’ 157 | ATTACH_CMP_OPERATIONS(PlaceholderSelector) | ^~~~~~~~~~~~~~~~~~~~~ src/ast_selectors.hpp:135:18: warning: ‘virtual bool Sass::SimpleSelector::operator==(const Sass::SelectorList&) const’ was hidden [-Woverloaded-virtual=] 135 | virtual bool operator==(const SelectorList& rhs) const; | ^~~~~~~~ src/ast_def_macros.hpp:109:16: note: by ‘Sass::PlaceholderSelector::operator==’ 109 | virtual bool operator==(const klass& rhs) const; \ | ^~~~~~~~ src/ast_selectors.hpp:157:5: note: in expansion of macro ‘ATTACH_CMP_OPERATIONS’ 157 | ATTACH_CMP_OPERATIONS(PlaceholderSelector) | ^~~~~~~~~~~~~~~~~~~~~ src/ast_selectors.hpp:133:10: warning: ‘virtual bool Sass::SimpleSelector::operator==(const Sass::Selector&) const’ was hidden [-Woverloaded-virtual=] 133 | bool operator==(const Selector& rhs) const final override; | ^~~~~~~~ src/ast_def_macros.hpp:109:16: note: by ‘Sass::PlaceholderSelector::operator==’ 109 | virtual bool operator==(const klass& rhs) const; \ | ^~~~~~~~ src/ast_selectors.hpp:157:5: note: in expansion of macro ‘ATTACH_CMP_OPERATIONS’ 157 | ATTACH_CMP_OPERATIONS(PlaceholderSelector) | ^~~~~~~~~~~~~~~~~~~~~ src/ast_def_macros.hpp:106:16: warning: ‘virtual bool Sass::SimpleSelector::operator!=(const Sass::SimpleSelector&) const’ was hidden [-Woverloaded-virtual=] 106 | virtual bool operator!=(const klass& rhs) const { return !(*this == rhs); }; \ | ^~~~~~~~ src/ast_selectors.hpp:139:5: note: in expansion of macro ‘ATTACH_VIRTUAL_CMP_OPERATIONS’ 139 | ATTACH_VIRTUAL_CMP_OPERATIONS(SimpleSelector); | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~ src/ast_def_macros.hpp:110:16: note: by ‘virtual bool Sass::PlaceholderSelector::operator!=(const Sass::PlaceholderSelector&) const’ 110 | virtual bool operator!=(const klass& rhs) const { return !(*this == rhs); }; \ | ^~~~~~~~ src/ast_selectors.hpp:157:5: note: in expansion of macro ‘ATTACH_CMP_OPERATIONS’ 157 | ATTACH_CMP_OPERATIONS(PlaceholderSelector) | ^~~~~~~~~~~~~~~~~~~~~ src/ast_selectors.hpp:137:18: warning: ‘virtual bool Sass::SimpleSelector::operator==(const Sass::CompoundSelector&) const’ was hidden [-Woverloaded-virtual=] 137 | virtual bool operator==(const CompoundSelector& rhs) const; | ^~~~~~~~ src/ast_def_macros.hpp:109:16: note: by ‘Sass::TypeSelector::operator==’ 109 | virtual bool operator==(const klass& rhs) const; \ | ^~~~~~~~ src/ast_selectors.hpp:174:5: note: in expansion of macro ‘ATTACH_CMP_OPERATIONS’ 174 | ATTACH_CMP_OPERATIONS(TypeSelector) | ^~~~~~~~~~~~~~~~~~~~~ src/ast_selectors.hpp:136:18: warning: ‘virtual bool Sass::SimpleSelector::operator==(const Sass::ComplexSelector&) const’ was hidden [-Woverloaded-virtual=] 136 | virtual bool operator==(const ComplexSelector& rhs) const; | ^~~~~~~~ src/ast_def_macros.hpp:109:16: note: by ‘Sass::TypeSelector::operator==’ 109 | virtual bool operator==(const klass& rhs) const; \ | ^~~~~~~~ src/ast_selectors.hpp:174:5: note: in expansion of macro ‘ATTACH_CMP_OPERATIONS’ 174 | ATTACH_CMP_OPERATIONS(TypeSelector) | ^~~~~~~~~~~~~~~~~~~~~ src/ast_selectors.hpp:135:18: warning: ‘virtual bool Sass::SimpleSelector::operator==(const Sass::SelectorList&) const’ was hidden [-Woverloaded-virtual=] 135 | virtual bool operator==(const SelectorList& rhs) const; | ^~~~~~~~ src/ast_def_macros.hpp:109:16: note: by ‘Sass::TypeSelector::operator==’ 109 | virtual bool operator==(const klass& rhs) const; \ | ^~~~~~~~ src/ast_selectors.hpp:174:5: note: in expansion of macro ‘ATTACH_CMP_OPERATIONS’ 174 | ATTACH_CMP_OPERATIONS(TypeSelector) | ^~~~~~~~~~~~~~~~~~~~~ src/ast_selectors.hpp:133:10: warning: ‘virtual bool Sass::SimpleSelector::operator==(const Sass::Selector&) const’ was hidden [-Woverloaded-virtual=] 133 | bool operator==(const Selector& rhs) const final override; | ^~~~~~~~ src/ast_def_macros.hpp:109:16: note: by ‘Sass::TypeSelector::operator==’ 109 | virtual bool operator==(const klass& rhs) const; \ | ^~~~~~~~ src/ast_selectors.hpp:174:5: note: in expansion of macro ‘ATTACH_CMP_OPERATIONS’ 174 | ATTACH_CMP_OPERATIONS(TypeSelector) | ^~~~~~~~~~~~~~~~~~~~~ src/ast_def_macros.hpp:106:16: warning: ‘virtual bool Sass::SimpleSelector::operator!=(const Sass::SimpleSelector&) const’ was hidden [-Woverloaded-virtual=] 106 | virtual bool operator!=(const klass& rhs) const { return !(*this == rhs); }; \ | ^~~~~~~~ src/ast_selectors.hpp:139:5: note: in expansion of macro ‘ATTACH_VIRTUAL_CMP_OPERATIONS’ 139 | ATTACH_VIRTUAL_CMP_OPERATIONS(SimpleSelector); | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~ src/ast_def_macros.hpp:110:16: note: by ‘virtual bool Sass::TypeSelector::operator!=(const Sass::TypeSelector&) const’ 110 | virtual bool operator!=(const klass& rhs) const { return !(*this == rhs); }; \ | ^~~~~~~~ src/ast_selectors.hpp:174:5: note: in expansion of macro ‘ATTACH_CMP_OPERATIONS’ 174 | ATTACH_CMP_OPERATIONS(TypeSelector) | ^~~~~~~~~~~~~~~~~~~~~ src/ast_selectors.hpp:137:18: warning: ‘virtual bool Sass::SimpleSelector::operator==(const Sass::CompoundSelector&) const’ was hidden [-Woverloaded-virtual=] 137 | virtual bool operator==(const CompoundSelector& rhs) const; | ^~~~~~~~ src/ast_def_macros.hpp:109:16: note: by ‘Sass::ClassSelector::operator==’ 109 | virtual bool operator==(const klass& rhs) const; \ | ^~~~~~~~ src/ast_selectors.hpp:188:5: note: in expansion of macro ‘ATTACH_CMP_OPERATIONS’ 188 | ATTACH_CMP_OPERATIONS(ClassSelector) | ^~~~~~~~~~~~~~~~~~~~~ src/ast_selectors.hpp:136:18: warning: ‘virtual bool Sass::SimpleSelector::operator==(const Sass::ComplexSelector&) const’ was hidden [-Woverloaded-virtual=] 136 | virtual bool operator==(const ComplexSelector& rhs) const; | ^~~~~~~~ src/ast_def_macros.hpp:109:16: note: by ‘Sass::ClassSelector::operator==’ 109 | virtual bool operator==(const klass& rhs) const; \ | ^~~~~~~~ src/ast_selectors.hpp:188:5: note: in expansion of macro ‘ATTACH_CMP_OPERATIONS’ 188 | ATTACH_CMP_OPERATIONS(ClassSelector) | ^~~~~~~~~~~~~~~~~~~~~ src/ast_selectors.hpp:135:18: warning: ‘virtual bool Sass::SimpleSelector::operator==(const Sass::SelectorList&) const’ was hidden [-Woverloaded-virtual=] 135 | virtual bool operator==(const SelectorList& rhs) const; | ^~~~~~~~ src/ast_def_macros.hpp:109:16: note: by ‘Sass::ClassSelector::operator==’ 109 | virtual bool operator==(const klass& rhs) const; \ | ^~~~~~~~ src/ast_selectors.hpp:188:5: note: in expansion of macro ‘ATTACH_CMP_OPERATIONS’ 188 | ATTACH_CMP_OPERATIONS(ClassSelector) | ^~~~~~~~~~~~~~~~~~~~~ src/ast_selectors.hpp:133:10: warning: ‘virtual bool Sass::SimpleSelector::operator==(const Sass::Selector&) const’ was hidden [-Woverloaded-virtual=] 133 | bool operator==(const Selector& rhs) const final override; | ^~~~~~~~ src/ast_def_macros.hpp:109:16: note: by ‘Sass::ClassSelector::operator==’ 109 | virtual bool operator==(const klass& rhs) const; \ | ^~~~~~~~ src/ast_selectors.hpp:188:5: note: in expansion of macro ‘ATTACH_CMP_OPERATIONS’ 188 | ATTACH_CMP_OPERATIONS(ClassSelector) | ^~~~~~~~~~~~~~~~~~~~~ src/ast_def_macros.hpp:106:16: warning: ‘virtual bool Sass::SimpleSelector::operator!=(const Sass::SimpleSelector&) const’ was hidden [-Woverloaded-virtual=] 106 | virtual bool operator!=(const klass& rhs) const { return !(*this == rhs); }; \ | ^~~~~~~~ src/ast_selectors.hpp:139:5: note: in expansion of macro ‘ATTACH_VIRTUAL_CMP_OPERATIONS’ 139 | ATTACH_VIRTUAL_CMP_OPERATIONS(SimpleSelector); | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~ src/ast_def_macros.hpp:110:16: note: by ‘virtual bool Sass::ClassSelector::operator!=(const Sass::ClassSelector&) const’ 110 | virtual bool operator!=(const klass& rhs) const { return !(*this == rhs); }; \ | ^~~~~~~~ src/ast_selectors.hpp:188:5: note: in expansion of macro ‘ATTACH_CMP_OPERATIONS’ 188 | ATTACH_CMP_OPERATIONS(ClassSelector) | ^~~~~~~~~~~~~~~~~~~~~ src/ast_selectors.hpp:137:18: warning: ‘virtual bool Sass::SimpleSelector::operator==(const Sass::CompoundSelector&) const’ was hidden [-Woverloaded-virtual=] 137 | virtual bool operator==(const CompoundSelector& rhs) const; | ^~~~~~~~ src/ast_def_macros.hpp:109:16: note: by ‘Sass::IDSelector::operator==’ 109 | virtual bool operator==(const klass& rhs) const; \ | ^~~~~~~~ src/ast_selectors.hpp:204:5: note: in expansion of macro ‘ATTACH_CMP_OPERATIONS’ 204 | ATTACH_CMP_OPERATIONS(IDSelector) | ^~~~~~~~~~~~~~~~~~~~~ src/ast_selectors.hpp:136:18: warning: ‘virtual bool Sass::SimpleSelector::operator==(const Sass::ComplexSelector&) const’ was hidden [-Woverloaded-virtual=] 136 | virtual bool operator==(const ComplexSelector& rhs) const; | ^~~~~~~~ src/ast_def_macros.hpp:109:16: note: by ‘Sass::IDSelector::operator==’ 109 | virtual bool operator==(const klass& rhs) const; \ | ^~~~~~~~ src/ast_selectors.hpp:204:5: note: in expansion of macro ‘ATTACH_CMP_OPERATIONS’ 204 | ATTACH_CMP_OPERATIONS(IDSelector) | ^~~~~~~~~~~~~~~~~~~~~ src/ast_selectors.hpp:135:18: warning: ‘virtual bool Sass::SimpleSelector::operator==(const Sass::SelectorList&) const’ was hidden [-Woverloaded-virtual=] 135 | virtual bool operator==(const SelectorList& rhs) const; | ^~~~~~~~ src/ast_def_macros.hpp:109:16: note: by ‘Sass::IDSelector::operator==’ 109 | virtual bool operator==(const klass& rhs) const; \ | ^~~~~~~~ src/ast_selectors.hpp:204:5: note: in expansion of macro ‘ATTACH_CMP_OPERATIONS’ 204 | ATTACH_CMP_OPERATIONS(IDSelector) | ^~~~~~~~~~~~~~~~~~~~~ src/ast_selectors.hpp:133:10: warning: ‘virtual bool Sass::SimpleSelector::operator==(const Sass::Selector&) const’ was hidden [-Woverloaded-virtual=] 133 | bool operator==(const Selector& rhs) const final override; | ^~~~~~~~ src/ast_def_macros.hpp:109:16: note: by ‘Sass::IDSelector::operator==’ 109 | virtual bool operator==(const klass& rhs) const; \ | ^~~~~~~~ src/ast_selectors.hpp:204:5: note: in expansion of macro ‘ATTACH_CMP_OPERATIONS’ 204 | ATTACH_CMP_OPERATIONS(IDSelector) | ^~~~~~~~~~~~~~~~~~~~~ src/ast_def_macros.hpp:106:16: warning: ‘virtual bool Sass::SimpleSelector::operator!=(const Sass::SimpleSelector&) const’ was hidden [-Woverloaded-virtual=] 106 | virtual bool operator!=(const klass& rhs) const { return !(*this == rhs); }; \ | ^~~~~~~~ src/ast_selectors.hpp:139:5: note: in expansion of macro ‘ATTACH_VIRTUAL_CMP_OPERATIONS’ 139 | ATTACH_VIRTUAL_CMP_OPERATIONS(SimpleSelector); | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~ src/ast_def_macros.hpp:110:16: note: by ‘virtual bool Sass::IDSelector::operator!=(const Sass::IDSelector&) const’ 110 | virtual bool operator!=(const klass& rhs) const { return !(*this == rhs); }; \ | ^~~~~~~~ src/ast_selectors.hpp:204:5: note: in expansion of macro ‘ATTACH_CMP_OPERATIONS’ 204 | ATTACH_CMP_OPERATIONS(IDSelector) | ^~~~~~~~~~~~~~~~~~~~~ src/ast_selectors.hpp:137:18: warning: ‘virtual bool Sass::SimpleSelector::operator==(const Sass::CompoundSelector&) const’ was hidden [-Woverloaded-virtual=] 137 | virtual bool operator==(const CompoundSelector& rhs) const; | ^~~~~~~~ src/ast_def_macros.hpp:109:16: note: by ‘Sass::AttributeSelector::operator==’ 109 | virtual bool operator==(const klass& rhs) const; \ | ^~~~~~~~ src/ast_selectors.hpp:223:5: note: in expansion of macro ‘ATTACH_CMP_OPERATIONS’ 223 | ATTACH_CMP_OPERATIONS(AttributeSelector) | ^~~~~~~~~~~~~~~~~~~~~ src/ast_selectors.hpp:136:18: warning: ‘virtual bool Sass::SimpleSelector::operator==(const Sass::ComplexSelector&) const’ was hidden [-Woverloaded-virtual=] 136 | virtual bool operator==(const ComplexSelector& rhs) const; | ^~~~~~~~ src/ast_def_macros.hpp:109:16: note: by ‘Sass::AttributeSelector::operator==’ 109 | virtual bool operator==(const klass& rhs) const; \ | ^~~~~~~~ src/ast_selectors.hpp:223:5: note: in expansion of macro ‘ATTACH_CMP_OPERATIONS’ 223 | ATTACH_CMP_OPERATIONS(AttributeSelector) | ^~~~~~~~~~~~~~~~~~~~~ src/ast_selectors.hpp:135:18: warning: ‘virtual bool Sass::SimpleSelector::operator==(const Sass::SelectorList&) const’ was hidden [-Woverloaded-virtual=] 135 | virtual bool operator==(const SelectorList& rhs) const; | ^~~~~~~~ src/ast_def_macros.hpp:109:16: note: by ‘Sass::AttributeSelector::operator==’ 109 | virtual bool operator==(const klass& rhs) const; \ | ^~~~~~~~ src/ast_selectors.hpp:223:5: note: in expansion of macro ‘ATTACH_CMP_OPERATIONS’ 223 | ATTACH_CMP_OPERATIONS(AttributeSelector) | ^~~~~~~~~~~~~~~~~~~~~ src/ast_selectors.hpp:133:10: warning: ‘virtual bool Sass::SimpleSelector::operator==(const Sass::Selector&) const’ was hidden [-Woverloaded-virtual=] 133 | bool operator==(const Selector& rhs) const final override; | ^~~~~~~~ src/ast_def_macros.hpp:109:16: note: by ‘Sass::AttributeSelector::operator==’ 109 | virtual bool operator==(const klass& rhs) const; \ | ^~~~~~~~ src/ast_selectors.hpp:223:5: note: in expansion of macro ‘ATTACH_CMP_OPERATIONS’ 223 | ATTACH_CMP_OPERATIONS(AttributeSelector) | ^~~~~~~~~~~~~~~~~~~~~ src/ast_def_macros.hpp:106:16: warning: ‘virtual bool Sass::SimpleSelector::operator!=(const Sass::SimpleSelector&) const’ was hidden [-Woverloaded-virtual=] 106 | virtual bool operator!=(const klass& rhs) const { return !(*this == rhs); }; \ | ^~~~~~~~ src/ast_selectors.hpp:139:5: note: in expansion of macro ‘ATTACH_VIRTUAL_CMP_OPERATIONS’ 139 | ATTACH_VIRTUAL_CMP_OPERATIONS(SimpleSelector); | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~ src/ast_def_macros.hpp:110:16: note: by ‘virtual bool Sass::AttributeSelector::operator!=(const Sass::AttributeSelector&) const’ 110 | virtual bool operator!=(const klass& rhs) const { return !(*this == rhs); }; \ | ^~~~~~~~ src/ast_selectors.hpp:223:5: note: in expansion of macro ‘ATTACH_CMP_OPERATIONS’ 223 | ATTACH_CMP_OPERATIONS(AttributeSelector) | ^~~~~~~~~~~~~~~~~~~~~ src/ast_def_macros.hpp:106:16: warning: ‘virtual bool Sass::Selector::operator!=(const Sass::Selector&) const’ was hidden [-Woverloaded-virtual=] 106 | virtual bool operator!=(const klass& rhs) const { return !(*this == rhs); }; \ | ^~~~~~~~ src/ast_selectors.hpp:56:5: note: in expansion of macro ‘ATTACH_VIRTUAL_CMP_OPERATIONS’ 56 | ATTACH_VIRTUAL_CMP_OPERATIONS(Selector) | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~ src/ast_def_macros.hpp:110:16: note: by ‘virtual bool Sass::ComplexSelector::operator!=(const Sass::ComplexSelector&) const’ 110 | virtual bool operator!=(const klass& rhs) const { return !(*this == rhs); }; \ | ^~~~~~~~ src/ast_selectors.hpp:310:5: note: in expansion of macro ‘ATTACH_CMP_OPERATIONS’ 310 | ATTACH_CMP_OPERATIONS(ComplexSelector) | ^~~~~~~~~~~~~~~~~~~~~ src/ast_def_macros.hpp:106:16: warning: ‘virtual bool Sass::Selector::operator!=(const Sass::Selector&) const’ was hidden [-Woverloaded-virtual=] 106 | virtual bool operator!=(const klass& rhs) const { return !(*this == rhs); }; \ | ^~~~~~~~ src/ast_selectors.hpp:56:5: note: in expansion of macro ‘ATTACH_VIRTUAL_CMP_OPERATIONS’ 56 | ATTACH_VIRTUAL_CMP_OPERATIONS(Selector) | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~ src/ast_def_macros.hpp:106:16: note: by ‘virtual bool Sass::SelectorComponent::operator!=(const Sass::SelectorComponent&) const’ 106 | virtual bool operator!=(const klass& rhs) const { return !(*this == rhs); }; \ | ^~~~~~~~ src/ast_selectors.hpp:349:5: note: in expansion of macro ‘ATTACH_VIRTUAL_CMP_OPERATIONS’ 349 | ATTACH_VIRTUAL_CMP_OPERATIONS(SelectorComponent); | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~ src/ast_def_macros.hpp:106:16: warning: ‘virtual bool Sass::SelectorComponent::operator!=(const Sass::SelectorComponent&) const’ was hidden [-Woverloaded-virtual=] 106 | virtual bool operator!=(const klass& rhs) const { return !(*this == rhs); }; \ | ^~~~~~~~ src/ast_selectors.hpp:349:5: note: in expansion of macro ‘ATTACH_VIRTUAL_CMP_OPERATIONS’ 349 | ATTACH_VIRTUAL_CMP_OPERATIONS(SelectorComponent); | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~ src/ast_def_macros.hpp:110:16: note: by ‘virtual bool Sass::SelectorCombinator::operator!=(const Sass::SelectorCombinator&) const’ 110 | virtual bool operator!=(const klass& rhs) const { return !(*this == rhs); }; \ | ^~~~~~~~ src/ast_selectors.hpp:407:5: note: in expansion of macro ‘ATTACH_CMP_OPERATIONS’ 407 | ATTACH_CMP_OPERATIONS(SelectorCombinator) | ^~~~~~~~~~~~~~~~~~~~~ g++ -std=gnu++17 -Wall -O2 -std=c++11 -I ./include -fPIC -c -o src/color_maps.o src/color_maps.cpp In file included from src/color_maps.cpp:5: src/ast.hpp:90:18: warning: ‘virtual bool Sass::AST_Node::operator==(const Sass::AST_Node&) const’ was hidden [-Woverloaded-virtual=] 90 | virtual bool operator== (const AST_Node& rhs) const { | ^~~~~~~~ src/ast.hpp:165:18: note: by ‘virtual bool Sass::Expression::operator==(const Sass::Expression&) const’ 165 | virtual bool operator== (const Expression& rhs) const { return false; } | ^~~~~~~~ src/ast.hpp:96:18: warning: ‘virtual bool Sass::AST_Node::operator!=(const Sass::AST_Node&) const’ was hidden [-Woverloaded-virtual=] 96 | virtual bool operator!= (const AST_Node& rhs) const { | ^~~~~~~~ src/ast.hpp:167:17: note: by ‘bool Sass::Expression::operator!=(const Sass::Expression&) const’ 167 | inline bool operator!=(const Expression& rhs) const { return !(rhs == *this); } | ^~~~~~~~ src/ast.hpp:90:18: warning: ‘virtual bool Sass::AST_Node::operator==(const Sass::AST_Node&) const’ was hidden [-Woverloaded-virtual=] 90 | virtual bool operator== (const AST_Node& rhs) const { | ^~~~~~~~ src/ast.hpp:908:10: note: by ‘bool Sass::CssMediaRule::operator==(const Sass::CssMediaRule&) const’ 908 | bool operator== (const CssMediaRule& rhs) const { | ^~~~~~~~ src/ast.hpp:96:18: warning: ‘virtual bool Sass::AST_Node::operator!=(const Sass::AST_Node&) const’ was hidden [-Woverloaded-virtual=] 96 | virtual bool operator!= (const AST_Node& rhs) const { | ^~~~~~~~ src/ast.hpp:911:10: note: by ‘bool Sass::CssMediaRule::operator!=(const Sass::CssMediaRule&) const’ 911 | bool operator!=(const CssMediaRule& rhs) const { | ^~~~~~~~ src/ast.hpp:90:18: warning: ‘virtual bool Sass::AST_Node::operator==(const Sass::AST_Node&) const’ was hidden [-Woverloaded-virtual=] 90 | virtual bool operator== (const AST_Node& rhs) const { | ^~~~~~~~ src/ast.hpp:939:10: note: by ‘bool Sass::CssMediaQuery::operator==(const Sass::CssMediaQuery&) const’ 939 | bool operator== (const CssMediaQuery& rhs) const; | ^~~~~~~~ src/ast.hpp:96:18: warning: ‘virtual bool Sass::AST_Node::operator!=(const Sass::AST_Node&) const’ was hidden [-Woverloaded-virtual=] 96 | virtual bool operator!= (const AST_Node& rhs) const { | ^~~~~~~~ src/ast.hpp:940:10: note: by ‘bool Sass::CssMediaQuery::operator!=(const Sass::CssMediaQuery&) const’ 940 | bool operator!=(const CssMediaQuery& rhs) const { | ^~~~~~~~ src/ast.hpp:165:18: warning: ‘virtual bool Sass::Expression::operator==(const Sass::Expression&) const’ was hidden [-Woverloaded-virtual=] 165 | virtual bool operator== (const Expression& rhs) const { return false; } | ^~~~~~~~ In file included from src/ast.hpp:14: src/ast_def_macros.hpp:105:16: note: by ‘virtual bool Sass::Selector::operator==(const Sass::Selector&) const’ 105 | virtual bool operator==(const klass& rhs) const = 0; \ | ^~~~~~~~ src/ast_selectors.hpp:56:5: note: in expansion of macro ‘ATTACH_VIRTUAL_CMP_OPERATIONS’ 56 | ATTACH_VIRTUAL_CMP_OPERATIONS(Selector) | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~ src/ast.hpp:96:18: warning: ‘virtual bool Sass::AST_Node::operator!=(const Sass::AST_Node&) const’ was hidden [-Woverloaded-virtual=] 96 | virtual bool operator!= (const AST_Node& rhs) const { | ^~~~~~~~ src/ast_def_macros.hpp:106:16: note: by ‘virtual bool Sass::Selector::operator!=(const Sass::Selector&) const’ 106 | virtual bool operator!=(const klass& rhs) const { return !(*this == rhs); }; \ | ^~~~~~~~ src/ast_selectors.hpp:56:5: note: in expansion of macro ‘ATTACH_VIRTUAL_CMP_OPERATIONS’ 56 | ATTACH_VIRTUAL_CMP_OPERATIONS(Selector) | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~ src/ast_def_macros.hpp:106:16: warning: ‘virtual bool Sass::Selector::operator!=(const Sass::Selector&) const’ was hidden [-Woverloaded-virtual=] 106 | virtual bool operator!=(const klass& rhs) const { return !(*this == rhs); }; \ | ^~~~~~~~ src/ast_selectors.hpp:56:5: note: in expansion of macro ‘ATTACH_VIRTUAL_CMP_OPERATIONS’ 56 | ATTACH_VIRTUAL_CMP_OPERATIONS(Selector) | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~ src/ast_def_macros.hpp:106:16: note: by ‘virtual bool Sass::SimpleSelector::operator!=(const Sass::SimpleSelector&) const’ 106 | virtual bool operator!=(const klass& rhs) const { return !(*this == rhs); }; \ | ^~~~~~~~ src/ast_selectors.hpp:139:5: note: in expansion of macro ‘ATTACH_VIRTUAL_CMP_OPERATIONS’ 139 | ATTACH_VIRTUAL_CMP_OPERATIONS(SimpleSelector); | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~ In file included from src/ast.hpp:1055: src/ast_selectors.hpp:137:18: warning: ‘virtual bool Sass::SimpleSelector::operator==(const Sass::CompoundSelector&) const’ was hidden [-Woverloaded-virtual=] 137 | virtual bool operator==(const CompoundSelector& rhs) const; | ^~~~~~~~ src/ast_def_macros.hpp:109:16: note: by ‘Sass::PlaceholderSelector::operator==’ 109 | virtual bool operator==(const klass& rhs) const; \ | ^~~~~~~~ src/ast_selectors.hpp:157:5: note: in expansion of macro ‘ATTACH_CMP_OPERATIONS’ 157 | ATTACH_CMP_OPERATIONS(PlaceholderSelector) | ^~~~~~~~~~~~~~~~~~~~~ src/ast_selectors.hpp:136:18: warning: ‘virtual bool Sass::SimpleSelector::operator==(const Sass::ComplexSelector&) const’ was hidden [-Woverloaded-virtual=] 136 | virtual bool operator==(const ComplexSelector& rhs) const; | ^~~~~~~~ src/ast_def_macros.hpp:109:16: note: by ‘Sass::PlaceholderSelector::operator==’ 109 | virtual bool operator==(const klass& rhs) const; \ | ^~~~~~~~ src/ast_selectors.hpp:157:5: note: in expansion of macro ‘ATTACH_CMP_OPERATIONS’ 157 | ATTACH_CMP_OPERATIONS(PlaceholderSelector) | ^~~~~~~~~~~~~~~~~~~~~ src/ast_selectors.hpp:135:18: warning: ‘virtual bool Sass::SimpleSelector::operator==(const Sass::SelectorList&) const’ was hidden [-Woverloaded-virtual=] 135 | virtual bool operator==(const SelectorList& rhs) const; | ^~~~~~~~ src/ast_def_macros.hpp:109:16: note: by ‘Sass::PlaceholderSelector::operator==’ 109 | virtual bool operator==(const klass& rhs) const; \ | ^~~~~~~~ src/ast_selectors.hpp:157:5: note: in expansion of macro ‘ATTACH_CMP_OPERATIONS’ 157 | ATTACH_CMP_OPERATIONS(PlaceholderSelector) | ^~~~~~~~~~~~~~~~~~~~~ src/ast_selectors.hpp:133:10: warning: ‘virtual bool Sass::SimpleSelector::operator==(const Sass::Selector&) const’ was hidden [-Woverloaded-virtual=] 133 | bool operator==(const Selector& rhs) const final override; | ^~~~~~~~ src/ast_def_macros.hpp:109:16: note: by ‘Sass::PlaceholderSelector::operator==’ 109 | virtual bool operator==(const klass& rhs) const; \ | ^~~~~~~~ src/ast_selectors.hpp:157:5: note: in expansion of macro ‘ATTACH_CMP_OPERATIONS’ 157 | ATTACH_CMP_OPERATIONS(PlaceholderSelector) | ^~~~~~~~~~~~~~~~~~~~~ src/ast_def_macros.hpp:106:16: warning: ‘virtual bool Sass::SimpleSelector::operator!=(const Sass::SimpleSelector&) const’ was hidden [-Woverloaded-virtual=] 106 | virtual bool operator!=(const klass& rhs) const { return !(*this == rhs); }; \ | ^~~~~~~~ src/ast_selectors.hpp:139:5: note: in expansion of macro ‘ATTACH_VIRTUAL_CMP_OPERATIONS’ 139 | ATTACH_VIRTUAL_CMP_OPERATIONS(SimpleSelector); | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~ src/ast_def_macros.hpp:110:16: note: by ‘virtual bool Sass::PlaceholderSelector::operator!=(const Sass::PlaceholderSelector&) const’ 110 | virtual bool operator!=(const klass& rhs) const { return !(*this == rhs); }; \ | ^~~~~~~~ src/ast_selectors.hpp:157:5: note: in expansion of macro ‘ATTACH_CMP_OPERATIONS’ 157 | ATTACH_CMP_OPERATIONS(PlaceholderSelector) | ^~~~~~~~~~~~~~~~~~~~~ src/ast_selectors.hpp:137:18: warning: ‘virtual bool Sass::SimpleSelector::operator==(const Sass::CompoundSelector&) const’ was hidden [-Woverloaded-virtual=] 137 | virtual bool operator==(const CompoundSelector& rhs) const; | ^~~~~~~~ src/ast_def_macros.hpp:109:16: note: by ‘Sass::TypeSelector::operator==’ 109 | virtual bool operator==(const klass& rhs) const; \ | ^~~~~~~~ src/ast_selectors.hpp:174:5: note: in expansion of macro ‘ATTACH_CMP_OPERATIONS’ 174 | ATTACH_CMP_OPERATIONS(TypeSelector) | ^~~~~~~~~~~~~~~~~~~~~ src/ast_selectors.hpp:136:18: warning: ‘virtual bool Sass::SimpleSelector::operator==(const Sass::ComplexSelector&) const’ was hidden [-Woverloaded-virtual=] 136 | virtual bool operator==(const ComplexSelector& rhs) const; | ^~~~~~~~ src/ast_def_macros.hpp:109:16: note: by ‘Sass::TypeSelector::operator==’ 109 | virtual bool operator==(const klass& rhs) const; \ | ^~~~~~~~ src/ast_selectors.hpp:174:5: note: in expansion of macro ‘ATTACH_CMP_OPERATIONS’ 174 | ATTACH_CMP_OPERATIONS(TypeSelector) | ^~~~~~~~~~~~~~~~~~~~~ src/ast_selectors.hpp:135:18: warning: ‘virtual bool Sass::SimpleSelector::operator==(const Sass::SelectorList&) const’ was hidden [-Woverloaded-virtual=] 135 | virtual bool operator==(const SelectorList& rhs) const; | ^~~~~~~~ src/ast_def_macros.hpp:109:16: note: by ‘Sass::TypeSelector::operator==’ 109 | virtual bool operator==(const klass& rhs) const; \ | ^~~~~~~~ src/ast_selectors.hpp:174:5: note: in expansion of macro ‘ATTACH_CMP_OPERATIONS’ 174 | ATTACH_CMP_OPERATIONS(TypeSelector) | ^~~~~~~~~~~~~~~~~~~~~ src/ast_selectors.hpp:133:10: warning: ‘virtual bool Sass::SimpleSelector::operator==(const Sass::Selector&) const’ was hidden [-Woverloaded-virtual=] 133 | bool operator==(const Selector& rhs) const final override; | ^~~~~~~~ src/ast_def_macros.hpp:109:16: note: by ‘Sass::TypeSelector::operator==’ 109 | virtual bool operator==(const klass& rhs) const; \ | ^~~~~~~~ src/ast_selectors.hpp:174:5: note: in expansion of macro ‘ATTACH_CMP_OPERATIONS’ 174 | ATTACH_CMP_OPERATIONS(TypeSelector) | ^~~~~~~~~~~~~~~~~~~~~ src/ast_def_macros.hpp:106:16: warning: ‘virtual bool Sass::SimpleSelector::operator!=(const Sass::SimpleSelector&) const’ was hidden [-Woverloaded-virtual=] 106 | virtual bool operator!=(const klass& rhs) const { return !(*this == rhs); }; \ | ^~~~~~~~ src/ast_selectors.hpp:139:5: note: in expansion of macro ‘ATTACH_VIRTUAL_CMP_OPERATIONS’ 139 | ATTACH_VIRTUAL_CMP_OPERATIONS(SimpleSelector); | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~ src/ast_def_macros.hpp:110:16: note: by ‘virtual bool Sass::TypeSelector::operator!=(const Sass::TypeSelector&) const’ 110 | virtual bool operator!=(const klass& rhs) const { return !(*this == rhs); }; \ | ^~~~~~~~ src/ast_selectors.hpp:174:5: note: in expansion of macro ‘ATTACH_CMP_OPERATIONS’ 174 | ATTACH_CMP_OPERATIONS(TypeSelector) | ^~~~~~~~~~~~~~~~~~~~~ src/ast_selectors.hpp:137:18: warning: ‘virtual bool Sass::SimpleSelector::operator==(const Sass::CompoundSelector&) const’ was hidden [-Woverloaded-virtual=] 137 | virtual bool operator==(const CompoundSelector& rhs) const; | ^~~~~~~~ src/ast_def_macros.hpp:109:16: note: by ‘Sass::ClassSelector::operator==’ 109 | virtual bool operator==(const klass& rhs) const; \ | ^~~~~~~~ src/ast_selectors.hpp:188:5: note: in expansion of macro ‘ATTACH_CMP_OPERATIONS’ 188 | ATTACH_CMP_OPERATIONS(ClassSelector) | ^~~~~~~~~~~~~~~~~~~~~ src/ast_selectors.hpp:136:18: warning: ‘virtual bool Sass::SimpleSelector::operator==(const Sass::ComplexSelector&) const’ was hidden [-Woverloaded-virtual=] 136 | virtual bool operator==(const ComplexSelector& rhs) const; | ^~~~~~~~ src/ast_def_macros.hpp:109:16: note: by ‘Sass::ClassSelector::operator==’ 109 | virtual bool operator==(const klass& rhs) const; \ | ^~~~~~~~ src/ast_selectors.hpp:188:5: note: in expansion of macro ‘ATTACH_CMP_OPERATIONS’ 188 | ATTACH_CMP_OPERATIONS(ClassSelector) | ^~~~~~~~~~~~~~~~~~~~~ src/ast_selectors.hpp:135:18: warning: ‘virtual bool Sass::SimpleSelector::operator==(const Sass::SelectorList&) const’ was hidden [-Woverloaded-virtual=] 135 | virtual bool operator==(const SelectorList& rhs) const; | ^~~~~~~~ src/ast_def_macros.hpp:109:16: note: by ‘Sass::ClassSelector::operator==’ 109 | virtual bool operator==(const klass& rhs) const; \ | ^~~~~~~~ src/ast_selectors.hpp:188:5: note: in expansion of macro ‘ATTACH_CMP_OPERATIONS’ 188 | ATTACH_CMP_OPERATIONS(ClassSelector) | ^~~~~~~~~~~~~~~~~~~~~ src/ast_selectors.hpp:133:10: warning: ‘virtual bool Sass::SimpleSelector::operator==(const Sass::Selector&) const’ was hidden [-Woverloaded-virtual=] 133 | bool operator==(const Selector& rhs) const final override; | ^~~~~~~~ src/ast_def_macros.hpp:109:16: note: by ‘Sass::ClassSelector::operator==’ 109 | virtual bool operator==(const klass& rhs) const; \ | ^~~~~~~~ src/ast_selectors.hpp:188:5: note: in expansion of macro ‘ATTACH_CMP_OPERATIONS’ 188 | ATTACH_CMP_OPERATIONS(ClassSelector) | ^~~~~~~~~~~~~~~~~~~~~ src/ast_def_macros.hpp:106:16: warning: ‘virtual bool Sass::SimpleSelector::operator!=(const Sass::SimpleSelector&) const’ was hidden [-Woverloaded-virtual=] 106 | virtual bool operator!=(const klass& rhs) const { return !(*this == rhs); }; \ | ^~~~~~~~ src/ast_selectors.hpp:139:5: note: in expansion of macro ‘ATTACH_VIRTUAL_CMP_OPERATIONS’ 139 | ATTACH_VIRTUAL_CMP_OPERATIONS(SimpleSelector); | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~ src/ast_def_macros.hpp:110:16: note: by ‘virtual bool Sass::ClassSelector::operator!=(const Sass::ClassSelector&) const’ 110 | virtual bool operator!=(const klass& rhs) const { return !(*this == rhs); }; \ | ^~~~~~~~ src/ast_selectors.hpp:188:5: note: in expansion of macro ‘ATTACH_CMP_OPERATIONS’ 188 | ATTACH_CMP_OPERATIONS(ClassSelector) | ^~~~~~~~~~~~~~~~~~~~~ src/ast_selectors.hpp:137:18: warning: ‘virtual bool Sass::SimpleSelector::operator==(const Sass::CompoundSelector&) const’ was hidden [-Woverloaded-virtual=] 137 | virtual bool operator==(const CompoundSelector& rhs) const; | ^~~~~~~~ src/ast_def_macros.hpp:109:16: note: by ‘Sass::IDSelector::operator==’ 109 | virtual bool operator==(const klass& rhs) const; \ | ^~~~~~~~ src/ast_selectors.hpp:204:5: note: in expansion of macro ‘ATTACH_CMP_OPERATIONS’ 204 | ATTACH_CMP_OPERATIONS(IDSelector) | ^~~~~~~~~~~~~~~~~~~~~ src/ast_selectors.hpp:136:18: warning: ‘virtual bool Sass::SimpleSelector::operator==(const Sass::ComplexSelector&) const’ was hidden [-Woverloaded-virtual=] 136 | virtual bool operator==(const ComplexSelector& rhs) const; | ^~~~~~~~ src/ast_def_macros.hpp:109:16: note: by ‘Sass::IDSelector::operator==’ 109 | virtual bool operator==(const klass& rhs) const; \ | ^~~~~~~~ src/ast_selectors.hpp:204:5: note: in expansion of macro ‘ATTACH_CMP_OPERATIONS’ 204 | ATTACH_CMP_OPERATIONS(IDSelector) | ^~~~~~~~~~~~~~~~~~~~~ src/ast_selectors.hpp:135:18: warning: ‘virtual bool Sass::SimpleSelector::operator==(const Sass::SelectorList&) const’ was hidden [-Woverloaded-virtual=] 135 | virtual bool operator==(const SelectorList& rhs) const; | ^~~~~~~~ src/ast_def_macros.hpp:109:16: note: by ‘Sass::IDSelector::operator==’ 109 | virtual bool operator==(const klass& rhs) const; \ | ^~~~~~~~ src/ast_selectors.hpp:204:5: note: in expansion of macro ‘ATTACH_CMP_OPERATIONS’ 204 | ATTACH_CMP_OPERATIONS(IDSelector) | ^~~~~~~~~~~~~~~~~~~~~ src/ast_selectors.hpp:133:10: warning: ‘virtual bool Sass::SimpleSelector::operator==(const Sass::Selector&) const’ was hidden [-Woverloaded-virtual=] 133 | bool operator==(const Selector& rhs) const final override; | ^~~~~~~~ src/ast_def_macros.hpp:109:16: note: by ‘Sass::IDSelector::operator==’ 109 | virtual bool operator==(const klass& rhs) const; \ | ^~~~~~~~ src/ast_selectors.hpp:204:5: note: in expansion of macro ‘ATTACH_CMP_OPERATIONS’ 204 | ATTACH_CMP_OPERATIONS(IDSelector) | ^~~~~~~~~~~~~~~~~~~~~ src/ast_def_macros.hpp:106:16: warning: ‘virtual bool Sass::SimpleSelector::operator!=(const Sass::SimpleSelector&) const’ was hidden [-Woverloaded-virtual=] 106 | virtual bool operator!=(const klass& rhs) const { return !(*this == rhs); }; \ | ^~~~~~~~ src/ast_selectors.hpp:139:5: note: in expansion of macro ‘ATTACH_VIRTUAL_CMP_OPERATIONS’ 139 | ATTACH_VIRTUAL_CMP_OPERATIONS(SimpleSelector); | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~ src/ast_def_macros.hpp:110:16: note: by ‘virtual bool Sass::IDSelector::operator!=(const Sass::IDSelector&) const’ 110 | virtual bool operator!=(const klass& rhs) const { return !(*this == rhs); }; \ | ^~~~~~~~ src/ast_selectors.hpp:204:5: note: in expansion of macro ‘ATTACH_CMP_OPERATIONS’ 204 | ATTACH_CMP_OPERATIONS(IDSelector) | ^~~~~~~~~~~~~~~~~~~~~ src/ast_selectors.hpp:137:18: warning: ‘virtual bool Sass::SimpleSelector::operator==(const Sass::CompoundSelector&) const’ was hidden [-Woverloaded-virtual=] 137 | virtual bool operator==(const CompoundSelector& rhs) const; | ^~~~~~~~ src/ast_def_macros.hpp:109:16: note: by ‘Sass::AttributeSelector::operator==’ 109 | virtual bool operator==(const klass& rhs) const; \ | ^~~~~~~~ src/ast_selectors.hpp:223:5: note: in expansion of macro ‘ATTACH_CMP_OPERATIONS’ 223 | ATTACH_CMP_OPERATIONS(AttributeSelector) | ^~~~~~~~~~~~~~~~~~~~~ src/ast_selectors.hpp:136:18: warning: ‘virtual bool Sass::SimpleSelector::operator==(const Sass::ComplexSelector&) const’ was hidden [-Woverloaded-virtual=] 136 | virtual bool operator==(const ComplexSelector& rhs) const; | ^~~~~~~~ src/ast_def_macros.hpp:109:16: note: by ‘Sass::AttributeSelector::operator==’ 109 | virtual bool operator==(const klass& rhs) const; \ | ^~~~~~~~ src/ast_selectors.hpp:223:5: note: in expansion of macro ‘ATTACH_CMP_OPERATIONS’ 223 | ATTACH_CMP_OPERATIONS(AttributeSelector) | ^~~~~~~~~~~~~~~~~~~~~ src/ast_selectors.hpp:135:18: warning: ‘virtual bool Sass::SimpleSelector::operator==(const Sass::SelectorList&) const’ was hidden [-Woverloaded-virtual=] 135 | virtual bool operator==(const SelectorList& rhs) const; | ^~~~~~~~ src/ast_def_macros.hpp:109:16: note: by ‘Sass::AttributeSelector::operator==’ 109 | virtual bool operator==(const klass& rhs) const; \ | ^~~~~~~~ src/ast_selectors.hpp:223:5: note: in expansion of macro ‘ATTACH_CMP_OPERATIONS’ 223 | ATTACH_CMP_OPERATIONS(AttributeSelector) | ^~~~~~~~~~~~~~~~~~~~~ src/ast_selectors.hpp:133:10: warning: ‘virtual bool Sass::SimpleSelector::operator==(const Sass::Selector&) const’ was hidden [-Woverloaded-virtual=] 133 | bool operator==(const Selector& rhs) const final override; | ^~~~~~~~ src/ast_def_macros.hpp:109:16: note: by ‘Sass::AttributeSelector::operator==’ 109 | virtual bool operator==(const klass& rhs) const; \ | ^~~~~~~~ src/ast_selectors.hpp:223:5: note: in expansion of macro ‘ATTACH_CMP_OPERATIONS’ 223 | ATTACH_CMP_OPERATIONS(AttributeSelector) | ^~~~~~~~~~~~~~~~~~~~~ src/ast_def_macros.hpp:106:16: warning: ‘virtual bool Sass::SimpleSelector::operator!=(const Sass::SimpleSelector&) const’ was hidden [-Woverloaded-virtual=] 106 | virtual bool operator!=(const klass& rhs) const { return !(*this == rhs); }; \ | ^~~~~~~~ src/ast_selectors.hpp:139:5: note: in expansion of macro ‘ATTACH_VIRTUAL_CMP_OPERATIONS’ 139 | ATTACH_VIRTUAL_CMP_OPERATIONS(SimpleSelector); | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~ src/ast_def_macros.hpp:110:16: note: by ‘virtual bool Sass::AttributeSelector::operator!=(const Sass::AttributeSelector&) const’ 110 | virtual bool operator!=(const klass& rhs) const { return !(*this == rhs); }; \ | ^~~~~~~~ src/ast_selectors.hpp:223:5: note: in expansion of macro ‘ATTACH_CMP_OPERATIONS’ 223 | ATTACH_CMP_OPERATIONS(AttributeSelector) | ^~~~~~~~~~~~~~~~~~~~~ src/ast_def_macros.hpp:106:16: warning: ‘virtual bool Sass::Selector::operator!=(const Sass::Selector&) const’ was hidden [-Woverloaded-virtual=] 106 | virtual bool operator!=(const klass& rhs) const { return !(*this == rhs); }; \ | ^~~~~~~~ src/ast_selectors.hpp:56:5: note: in expansion of macro ‘ATTACH_VIRTUAL_CMP_OPERATIONS’ 56 | ATTACH_VIRTUAL_CMP_OPERATIONS(Selector) | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~ src/ast_def_macros.hpp:110:16: note: by ‘virtual bool Sass::ComplexSelector::operator!=(const Sass::ComplexSelector&) const’ 110 | virtual bool operator!=(const klass& rhs) const { return !(*this == rhs); }; \ | ^~~~~~~~ src/ast_selectors.hpp:310:5: note: in expansion of macro ‘ATTACH_CMP_OPERATIONS’ 310 | ATTACH_CMP_OPERATIONS(ComplexSelector) | ^~~~~~~~~~~~~~~~~~~~~ src/ast_def_macros.hpp:106:16: warning: ‘virtual bool Sass::Selector::operator!=(const Sass::Selector&) const’ was hidden [-Woverloaded-virtual=] 106 | virtual bool operator!=(const klass& rhs) const { return !(*this == rhs); }; \ | ^~~~~~~~ src/ast_selectors.hpp:56:5: note: in expansion of macro ‘ATTACH_VIRTUAL_CMP_OPERATIONS’ 56 | ATTACH_VIRTUAL_CMP_OPERATIONS(Selector) | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~ src/ast_def_macros.hpp:106:16: note: by ‘virtual bool Sass::SelectorComponent::operator!=(const Sass::SelectorComponent&) const’ 106 | virtual bool operator!=(const klass& rhs) const { return !(*this == rhs); }; \ | ^~~~~~~~ src/ast_selectors.hpp:349:5: note: in expansion of macro ‘ATTACH_VIRTUAL_CMP_OPERATIONS’ 349 | ATTACH_VIRTUAL_CMP_OPERATIONS(SelectorComponent); | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~ src/ast_def_macros.hpp:106:16: warning: ‘virtual bool Sass::SelectorComponent::operator!=(const Sass::SelectorComponent&) const’ was hidden [-Woverloaded-virtual=] 106 | virtual bool operator!=(const klass& rhs) const { return !(*this == rhs); }; \ | ^~~~~~~~ src/ast_selectors.hpp:349:5: note: in expansion of macro ‘ATTACH_VIRTUAL_CMP_OPERATIONS’ 349 | ATTACH_VIRTUAL_CMP_OPERATIONS(SelectorComponent); | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~ src/ast_def_macros.hpp:110:16: note: by ‘virtual bool Sass::SelectorCombinator::operator!=(const Sass::SelectorCombinator&) const’ 110 | virtual bool operator!=(const klass& rhs) const { return !(*this == rhs); }; \ | ^~~~~~~~ src/ast_selectors.hpp:407:5: note: in expansion of macro ‘ATTACH_CMP_OPERATIONS’ 407 | ATTACH_CMP_OPERATIONS(SelectorCombinator) | ^~~~~~~~~~~~~~~~~~~~~ g++ -std=gnu++17 -Wall -O2 -std=c++11 -I ./include -fPIC -c -o src/environment.o src/environment.cpp In file included from src/environment.cpp:2: src/ast.hpp:90:18: warning: ‘virtual bool Sass::AST_Node::operator==(const Sass::AST_Node&) const’ was hidden [-Woverloaded-virtual=] 90 | virtual bool operator== (const AST_Node& rhs) const { | ^~~~~~~~ src/ast.hpp:165:18: note: by ‘virtual bool Sass::Expression::operator==(const Sass::Expression&) const’ 165 | virtual bool operator== (const Expression& rhs) const { return false; } | ^~~~~~~~ src/ast.hpp:96:18: warning: ‘virtual bool Sass::AST_Node::operator!=(const Sass::AST_Node&) const’ was hidden [-Woverloaded-virtual=] 96 | virtual bool operator!= (const AST_Node& rhs) const { | ^~~~~~~~ src/ast.hpp:167:17: note: by ‘bool Sass::Expression::operator!=(const Sass::Expression&) const’ 167 | inline bool operator!=(const Expression& rhs) const { return !(rhs == *this); } | ^~~~~~~~ src/ast.hpp:90:18: warning: ‘virtual bool Sass::AST_Node::operator==(const Sass::AST_Node&) const’ was hidden [-Woverloaded-virtual=] 90 | virtual bool operator== (const AST_Node& rhs) const { | ^~~~~~~~ src/ast.hpp:908:10: note: by ‘bool Sass::CssMediaRule::operator==(const Sass::CssMediaRule&) const’ 908 | bool operator== (const CssMediaRule& rhs) const { | ^~~~~~~~ src/ast.hpp:96:18: warning: ‘virtual bool Sass::AST_Node::operator!=(const Sass::AST_Node&) const’ was hidden [-Woverloaded-virtual=] 96 | virtual bool operator!= (const AST_Node& rhs) const { | ^~~~~~~~ src/ast.hpp:911:10: note: by ‘bool Sass::CssMediaRule::operator!=(const Sass::CssMediaRule&) const’ 911 | bool operator!=(const CssMediaRule& rhs) const { | ^~~~~~~~ src/ast.hpp:90:18: warning: ‘virtual bool Sass::AST_Node::operator==(const Sass::AST_Node&) const’ was hidden [-Woverloaded-virtual=] 90 | virtual bool operator== (const AST_Node& rhs) const { | ^~~~~~~~ src/ast.hpp:939:10: note: by ‘bool Sass::CssMediaQuery::operator==(const Sass::CssMediaQuery&) const’ 939 | bool operator== (const CssMediaQuery& rhs) const; | ^~~~~~~~ src/ast.hpp:96:18: warning: ‘virtual bool Sass::AST_Node::operator!=(const Sass::AST_Node&) const’ was hidden [-Woverloaded-virtual=] 96 | virtual bool operator!= (const AST_Node& rhs) const { | ^~~~~~~~ src/ast.hpp:940:10: note: by ‘bool Sass::CssMediaQuery::operator!=(const Sass::CssMediaQuery&) const’ 940 | bool operator!=(const CssMediaQuery& rhs) const { | ^~~~~~~~ src/ast.hpp:165:18: warning: ‘virtual bool Sass::Expression::operator==(const Sass::Expression&) const’ was hidden [-Woverloaded-virtual=] 165 | virtual bool operator== (const Expression& rhs) const { return false; } | ^~~~~~~~ In file included from src/ast.hpp:14: src/ast_def_macros.hpp:105:16: note: by ‘virtual bool Sass::Selector::operator==(const Sass::Selector&) const’ 105 | virtual bool operator==(const klass& rhs) const = 0; \ | ^~~~~~~~ src/ast_selectors.hpp:56:5: note: in expansion of macro ‘ATTACH_VIRTUAL_CMP_OPERATIONS’ 56 | ATTACH_VIRTUAL_CMP_OPERATIONS(Selector) | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~ src/ast.hpp:96:18: warning: ‘virtual bool Sass::AST_Node::operator!=(const Sass::AST_Node&) const’ was hidden [-Woverloaded-virtual=] 96 | virtual bool operator!= (const AST_Node& rhs) const { | ^~~~~~~~ src/ast_def_macros.hpp:106:16: note: by ‘virtual bool Sass::Selector::operator!=(const Sass::Selector&) const’ 106 | virtual bool operator!=(const klass& rhs) const { return !(*this == rhs); }; \ | ^~~~~~~~ src/ast_selectors.hpp:56:5: note: in expansion of macro ‘ATTACH_VIRTUAL_CMP_OPERATIONS’ 56 | ATTACH_VIRTUAL_CMP_OPERATIONS(Selector) | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~ src/ast_def_macros.hpp:106:16: warning: ‘virtual bool Sass::Selector::operator!=(const Sass::Selector&) const’ was hidden [-Woverloaded-virtual=] 106 | virtual bool operator!=(const klass& rhs) const { return !(*this == rhs); }; \ | ^~~~~~~~ src/ast_selectors.hpp:56:5: note: in expansion of macro ‘ATTACH_VIRTUAL_CMP_OPERATIONS’ 56 | ATTACH_VIRTUAL_CMP_OPERATIONS(Selector) | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~ src/ast_def_macros.hpp:106:16: note: by ‘virtual bool Sass::SimpleSelector::operator!=(const Sass::SimpleSelector&) const’ 106 | virtual bool operator!=(const klass& rhs) const { return !(*this == rhs); }; \ | ^~~~~~~~ src/ast_selectors.hpp:139:5: note: in expansion of macro ‘ATTACH_VIRTUAL_CMP_OPERATIONS’ 139 | ATTACH_VIRTUAL_CMP_OPERATIONS(SimpleSelector); | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~ In file included from src/ast.hpp:1055: src/ast_selectors.hpp:137:18: warning: ‘virtual bool Sass::SimpleSelector::operator==(const Sass::CompoundSelector&) const’ was hidden [-Woverloaded-virtual=] 137 | virtual bool operator==(const CompoundSelector& rhs) const; | ^~~~~~~~ src/ast_def_macros.hpp:109:16: note: by ‘Sass::PlaceholderSelector::operator==’ 109 | virtual bool operator==(const klass& rhs) const; \ | ^~~~~~~~ src/ast_selectors.hpp:157:5: note: in expansion of macro ‘ATTACH_CMP_OPERATIONS’ 157 | ATTACH_CMP_OPERATIONS(PlaceholderSelector) | ^~~~~~~~~~~~~~~~~~~~~ src/ast_selectors.hpp:136:18: warning: ‘virtual bool Sass::SimpleSelector::operator==(const Sass::ComplexSelector&) const’ was hidden [-Woverloaded-virtual=] 136 | virtual bool operator==(const ComplexSelector& rhs) const; | ^~~~~~~~ src/ast_def_macros.hpp:109:16: note: by ‘Sass::PlaceholderSelector::operator==’ 109 | virtual bool operator==(const klass& rhs) const; \ | ^~~~~~~~ src/ast_selectors.hpp:157:5: note: in expansion of macro ‘ATTACH_CMP_OPERATIONS’ 157 | ATTACH_CMP_OPERATIONS(PlaceholderSelector) | ^~~~~~~~~~~~~~~~~~~~~ src/ast_selectors.hpp:135:18: warning: ‘virtual bool Sass::SimpleSelector::operator==(const Sass::SelectorList&) const’ was hidden [-Woverloaded-virtual=] 135 | virtual bool operator==(const SelectorList& rhs) const; | ^~~~~~~~ src/ast_def_macros.hpp:109:16: note: by ‘Sass::PlaceholderSelector::operator==’ 109 | virtual bool operator==(const klass& rhs) const; \ | ^~~~~~~~ src/ast_selectors.hpp:157:5: note: in expansion of macro ‘ATTACH_CMP_OPERATIONS’ 157 | ATTACH_CMP_OPERATIONS(PlaceholderSelector) | ^~~~~~~~~~~~~~~~~~~~~ src/ast_selectors.hpp:133:10: warning: ‘virtual bool Sass::SimpleSelector::operator==(const Sass::Selector&) const’ was hidden [-Woverloaded-virtual=] 133 | bool operator==(const Selector& rhs) const final override; | ^~~~~~~~ src/ast_def_macros.hpp:109:16: note: by ‘Sass::PlaceholderSelector::operator==’ 109 | virtual bool operator==(const klass& rhs) const; \ | ^~~~~~~~ src/ast_selectors.hpp:157:5: note: in expansion of macro ‘ATTACH_CMP_OPERATIONS’ 157 | ATTACH_CMP_OPERATIONS(PlaceholderSelector) | ^~~~~~~~~~~~~~~~~~~~~ src/ast_def_macros.hpp:106:16: warning: ‘virtual bool Sass::SimpleSelector::operator!=(const Sass::SimpleSelector&) const’ was hidden [-Woverloaded-virtual=] 106 | virtual bool operator!=(const klass& rhs) const { return !(*this == rhs); }; \ | ^~~~~~~~ src/ast_selectors.hpp:139:5: note: in expansion of macro ‘ATTACH_VIRTUAL_CMP_OPERATIONS’ 139 | ATTACH_VIRTUAL_CMP_OPERATIONS(SimpleSelector); | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~ src/ast_def_macros.hpp:110:16: note: by ‘virtual bool Sass::PlaceholderSelector::operator!=(const Sass::PlaceholderSelector&) const’ 110 | virtual bool operator!=(const klass& rhs) const { return !(*this == rhs); }; \ | ^~~~~~~~ src/ast_selectors.hpp:157:5: note: in expansion of macro ‘ATTACH_CMP_OPERATIONS’ 157 | ATTACH_CMP_OPERATIONS(PlaceholderSelector) | ^~~~~~~~~~~~~~~~~~~~~ src/ast_selectors.hpp:137:18: warning: ‘virtual bool Sass::SimpleSelector::operator==(const Sass::CompoundSelector&) const’ was hidden [-Woverloaded-virtual=] 137 | virtual bool operator==(const CompoundSelector& rhs) const; | ^~~~~~~~ src/ast_def_macros.hpp:109:16: note: by ‘Sass::TypeSelector::operator==’ 109 | virtual bool operator==(const klass& rhs) const; \ | ^~~~~~~~ src/ast_selectors.hpp:174:5: note: in expansion of macro ‘ATTACH_CMP_OPERATIONS’ 174 | ATTACH_CMP_OPERATIONS(TypeSelector) | ^~~~~~~~~~~~~~~~~~~~~ src/ast_selectors.hpp:136:18: warning: ‘virtual bool Sass::SimpleSelector::operator==(const Sass::ComplexSelector&) const’ was hidden [-Woverloaded-virtual=] 136 | virtual bool operator==(const ComplexSelector& rhs) const; | ^~~~~~~~ src/ast_def_macros.hpp:109:16: note: by ‘Sass::TypeSelector::operator==’ 109 | virtual bool operator==(const klass& rhs) const; \ | ^~~~~~~~ src/ast_selectors.hpp:174:5: note: in expansion of macro ‘ATTACH_CMP_OPERATIONS’ 174 | ATTACH_CMP_OPERATIONS(TypeSelector) | ^~~~~~~~~~~~~~~~~~~~~ src/ast_selectors.hpp:135:18: warning: ‘virtual bool Sass::SimpleSelector::operator==(const Sass::SelectorList&) const’ was hidden [-Woverloaded-virtual=] 135 | virtual bool operator==(const SelectorList& rhs) const; | ^~~~~~~~ src/ast_def_macros.hpp:109:16: note: by ‘Sass::TypeSelector::operator==’ 109 | virtual bool operator==(const klass& rhs) const; \ | ^~~~~~~~ src/ast_selectors.hpp:174:5: note: in expansion of macro ‘ATTACH_CMP_OPERATIONS’ 174 | ATTACH_CMP_OPERATIONS(TypeSelector) | ^~~~~~~~~~~~~~~~~~~~~ src/ast_selectors.hpp:133:10: warning: ‘virtual bool Sass::SimpleSelector::operator==(const Sass::Selector&) const’ was hidden [-Woverloaded-virtual=] 133 | bool operator==(const Selector& rhs) const final override; | ^~~~~~~~ src/ast_def_macros.hpp:109:16: note: by ‘Sass::TypeSelector::operator==’ 109 | virtual bool operator==(const klass& rhs) const; \ | ^~~~~~~~ src/ast_selectors.hpp:174:5: note: in expansion of macro ‘ATTACH_CMP_OPERATIONS’ 174 | ATTACH_CMP_OPERATIONS(TypeSelector) | ^~~~~~~~~~~~~~~~~~~~~ src/ast_def_macros.hpp:106:16: warning: ‘virtual bool Sass::SimpleSelector::operator!=(const Sass::SimpleSelector&) const’ was hidden [-Woverloaded-virtual=] 106 | virtual bool operator!=(const klass& rhs) const { return !(*this == rhs); }; \ | ^~~~~~~~ src/ast_selectors.hpp:139:5: note: in expansion of macro ‘ATTACH_VIRTUAL_CMP_OPERATIONS’ 139 | ATTACH_VIRTUAL_CMP_OPERATIONS(SimpleSelector); | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~ src/ast_def_macros.hpp:110:16: note: by ‘virtual bool Sass::TypeSelector::operator!=(const Sass::TypeSelector&) const’ 110 | virtual bool operator!=(const klass& rhs) const { return !(*this == rhs); }; \ | ^~~~~~~~ src/ast_selectors.hpp:174:5: note: in expansion of macro ‘ATTACH_CMP_OPERATIONS’ 174 | ATTACH_CMP_OPERATIONS(TypeSelector) | ^~~~~~~~~~~~~~~~~~~~~ src/ast_selectors.hpp:137:18: warning: ‘virtual bool Sass::SimpleSelector::operator==(const Sass::CompoundSelector&) const’ was hidden [-Woverloaded-virtual=] 137 | virtual bool operator==(const CompoundSelector& rhs) const; | ^~~~~~~~ src/ast_def_macros.hpp:109:16: note: by ‘Sass::ClassSelector::operator==’ 109 | virtual bool operator==(const klass& rhs) const; \ | ^~~~~~~~ src/ast_selectors.hpp:188:5: note: in expansion of macro ‘ATTACH_CMP_OPERATIONS’ 188 | ATTACH_CMP_OPERATIONS(ClassSelector) | ^~~~~~~~~~~~~~~~~~~~~ src/ast_selectors.hpp:136:18: warning: ‘virtual bool Sass::SimpleSelector::operator==(const Sass::ComplexSelector&) const’ was hidden [-Woverloaded-virtual=] 136 | virtual bool operator==(const ComplexSelector& rhs) const; | ^~~~~~~~ src/ast_def_macros.hpp:109:16: note: by ‘Sass::ClassSelector::operator==’ 109 | virtual bool operator==(const klass& rhs) const; \ | ^~~~~~~~ src/ast_selectors.hpp:188:5: note: in expansion of macro ‘ATTACH_CMP_OPERATIONS’ 188 | ATTACH_CMP_OPERATIONS(ClassSelector) | ^~~~~~~~~~~~~~~~~~~~~ src/ast_selectors.hpp:135:18: warning: ‘virtual bool Sass::SimpleSelector::operator==(const Sass::SelectorList&) const’ was hidden [-Woverloaded-virtual=] 135 | virtual bool operator==(const SelectorList& rhs) const; | ^~~~~~~~ src/ast_def_macros.hpp:109:16: note: by ‘Sass::ClassSelector::operator==’ 109 | virtual bool operator==(const klass& rhs) const; \ | ^~~~~~~~ src/ast_selectors.hpp:188:5: note: in expansion of macro ‘ATTACH_CMP_OPERATIONS’ 188 | ATTACH_CMP_OPERATIONS(ClassSelector) | ^~~~~~~~~~~~~~~~~~~~~ src/ast_selectors.hpp:133:10: warning: ‘virtual bool Sass::SimpleSelector::operator==(const Sass::Selector&) const’ was hidden [-Woverloaded-virtual=] 133 | bool operator==(const Selector& rhs) const final override; | ^~~~~~~~ src/ast_def_macros.hpp:109:16: note: by ‘Sass::ClassSelector::operator==’ 109 | virtual bool operator==(const klass& rhs) const; \ | ^~~~~~~~ src/ast_selectors.hpp:188:5: note: in expansion of macro ‘ATTACH_CMP_OPERATIONS’ 188 | ATTACH_CMP_OPERATIONS(ClassSelector) | ^~~~~~~~~~~~~~~~~~~~~ src/ast_def_macros.hpp:106:16: warning: ‘virtual bool Sass::SimpleSelector::operator!=(const Sass::SimpleSelector&) const’ was hidden [-Woverloaded-virtual=] 106 | virtual bool operator!=(const klass& rhs) const { return !(*this == rhs); }; \ | ^~~~~~~~ src/ast_selectors.hpp:139:5: note: in expansion of macro ‘ATTACH_VIRTUAL_CMP_OPERATIONS’ 139 | ATTACH_VIRTUAL_CMP_OPERATIONS(SimpleSelector); | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~ src/ast_def_macros.hpp:110:16: note: by ‘virtual bool Sass::ClassSelector::operator!=(const Sass::ClassSelector&) const’ 110 | virtual bool operator!=(const klass& rhs) const { return !(*this == rhs); }; \ | ^~~~~~~~ src/ast_selectors.hpp:188:5: note: in expansion of macro ‘ATTACH_CMP_OPERATIONS’ 188 | ATTACH_CMP_OPERATIONS(ClassSelector) | ^~~~~~~~~~~~~~~~~~~~~ src/ast_selectors.hpp:137:18: warning: ‘virtual bool Sass::SimpleSelector::operator==(const Sass::CompoundSelector&) const’ was hidden [-Woverloaded-virtual=] 137 | virtual bool operator==(const CompoundSelector& rhs) const; | ^~~~~~~~ src/ast_def_macros.hpp:109:16: note: by ‘Sass::IDSelector::operator==’ 109 | virtual bool operator==(const klass& rhs) const; \ | ^~~~~~~~ src/ast_selectors.hpp:204:5: note: in expansion of macro ‘ATTACH_CMP_OPERATIONS’ 204 | ATTACH_CMP_OPERATIONS(IDSelector) | ^~~~~~~~~~~~~~~~~~~~~ src/ast_selectors.hpp:136:18: warning: ‘virtual bool Sass::SimpleSelector::operator==(const Sass::ComplexSelector&) const’ was hidden [-Woverloaded-virtual=] 136 | virtual bool operator==(const ComplexSelector& rhs) const; | ^~~~~~~~ src/ast_def_macros.hpp:109:16: note: by ‘Sass::IDSelector::operator==’ 109 | virtual bool operator==(const klass& rhs) const; \ | ^~~~~~~~ src/ast_selectors.hpp:204:5: note: in expansion of macro ‘ATTACH_CMP_OPERATIONS’ 204 | ATTACH_CMP_OPERATIONS(IDSelector) | ^~~~~~~~~~~~~~~~~~~~~ src/ast_selectors.hpp:135:18: warning: ‘virtual bool Sass::SimpleSelector::operator==(const Sass::SelectorList&) const’ was hidden [-Woverloaded-virtual=] 135 | virtual bool operator==(const SelectorList& rhs) const; | ^~~~~~~~ src/ast_def_macros.hpp:109:16: note: by ‘Sass::IDSelector::operator==’ 109 | virtual bool operator==(const klass& rhs) const; \ | ^~~~~~~~ src/ast_selectors.hpp:204:5: note: in expansion of macro ‘ATTACH_CMP_OPERATIONS’ 204 | ATTACH_CMP_OPERATIONS(IDSelector) | ^~~~~~~~~~~~~~~~~~~~~ src/ast_selectors.hpp:133:10: warning: ‘virtual bool Sass::SimpleSelector::operator==(const Sass::Selector&) const’ was hidden [-Woverloaded-virtual=] 133 | bool operator==(const Selector& rhs) const final override; | ^~~~~~~~ src/ast_def_macros.hpp:109:16: note: by ‘Sass::IDSelector::operator==’ 109 | virtual bool operator==(const klass& rhs) const; \ | ^~~~~~~~ src/ast_selectors.hpp:204:5: note: in expansion of macro ‘ATTACH_CMP_OPERATIONS’ 204 | ATTACH_CMP_OPERATIONS(IDSelector) | ^~~~~~~~~~~~~~~~~~~~~ src/ast_def_macros.hpp:106:16: warning: ‘virtual bool Sass::SimpleSelector::operator!=(const Sass::SimpleSelector&) const’ was hidden [-Woverloaded-virtual=] 106 | virtual bool operator!=(const klass& rhs) const { return !(*this == rhs); }; \ | ^~~~~~~~ src/ast_selectors.hpp:139:5: note: in expansion of macro ‘ATTACH_VIRTUAL_CMP_OPERATIONS’ 139 | ATTACH_VIRTUAL_CMP_OPERATIONS(SimpleSelector); | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~ src/ast_def_macros.hpp:110:16: note: by ‘virtual bool Sass::IDSelector::operator!=(const Sass::IDSelector&) const’ 110 | virtual bool operator!=(const klass& rhs) const { return !(*this == rhs); }; \ | ^~~~~~~~ src/ast_selectors.hpp:204:5: note: in expansion of macro ‘ATTACH_CMP_OPERATIONS’ 204 | ATTACH_CMP_OPERATIONS(IDSelector) | ^~~~~~~~~~~~~~~~~~~~~ src/ast_selectors.hpp:137:18: warning: ‘virtual bool Sass::SimpleSelector::operator==(const Sass::CompoundSelector&) const’ was hidden [-Woverloaded-virtual=] 137 | virtual bool operator==(const CompoundSelector& rhs) const; | ^~~~~~~~ src/ast_def_macros.hpp:109:16: note: by ‘Sass::AttributeSelector::operator==’ 109 | virtual bool operator==(const klass& rhs) const; \ | ^~~~~~~~ src/ast_selectors.hpp:223:5: note: in expansion of macro ‘ATTACH_CMP_OPERATIONS’ 223 | ATTACH_CMP_OPERATIONS(AttributeSelector) | ^~~~~~~~~~~~~~~~~~~~~ src/ast_selectors.hpp:136:18: warning: ‘virtual bool Sass::SimpleSelector::operator==(const Sass::ComplexSelector&) const’ was hidden [-Woverloaded-virtual=] 136 | virtual bool operator==(const ComplexSelector& rhs) const; | ^~~~~~~~ src/ast_def_macros.hpp:109:16: note: by ‘Sass::AttributeSelector::operator==’ 109 | virtual bool operator==(const klass& rhs) const; \ | ^~~~~~~~ src/ast_selectors.hpp:223:5: note: in expansion of macro ‘ATTACH_CMP_OPERATIONS’ 223 | ATTACH_CMP_OPERATIONS(AttributeSelector) | ^~~~~~~~~~~~~~~~~~~~~ src/ast_selectors.hpp:135:18: warning: ‘virtual bool Sass::SimpleSelector::operator==(const Sass::SelectorList&) const’ was hidden [-Woverloaded-virtual=] 135 | virtual bool operator==(const SelectorList& rhs) const; | ^~~~~~~~ src/ast_def_macros.hpp:109:16: note: by ‘Sass::AttributeSelector::operator==’ 109 | virtual bool operator==(const klass& rhs) const; \ | ^~~~~~~~ src/ast_selectors.hpp:223:5: note: in expansion of macro ‘ATTACH_CMP_OPERATIONS’ 223 | ATTACH_CMP_OPERATIONS(AttributeSelector) | ^~~~~~~~~~~~~~~~~~~~~ src/ast_selectors.hpp:133:10: warning: ‘virtual bool Sass::SimpleSelector::operator==(const Sass::Selector&) const’ was hidden [-Woverloaded-virtual=] 133 | bool operator==(const Selector& rhs) const final override; | ^~~~~~~~ src/ast_def_macros.hpp:109:16: note: by ‘Sass::AttributeSelector::operator==’ 109 | virtual bool operator==(const klass& rhs) const; \ | ^~~~~~~~ src/ast_selectors.hpp:223:5: note: in expansion of macro ‘ATTACH_CMP_OPERATIONS’ 223 | ATTACH_CMP_OPERATIONS(AttributeSelector) | ^~~~~~~~~~~~~~~~~~~~~ src/ast_def_macros.hpp:106:16: warning: ‘virtual bool Sass::SimpleSelector::operator!=(const Sass::SimpleSelector&) const’ was hidden [-Woverloaded-virtual=] 106 | virtual bool operator!=(const klass& rhs) const { return !(*this == rhs); }; \ | ^~~~~~~~ src/ast_selectors.hpp:139:5: note: in expansion of macro ‘ATTACH_VIRTUAL_CMP_OPERATIONS’ 139 | ATTACH_VIRTUAL_CMP_OPERATIONS(SimpleSelector); | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~ src/ast_def_macros.hpp:110:16: note: by ‘virtual bool Sass::AttributeSelector::operator!=(const Sass::AttributeSelector&) const’ 110 | virtual bool operator!=(const klass& rhs) const { return !(*this == rhs); }; \ | ^~~~~~~~ src/ast_selectors.hpp:223:5: note: in expansion of macro ‘ATTACH_CMP_OPERATIONS’ 223 | ATTACH_CMP_OPERATIONS(AttributeSelector) | ^~~~~~~~~~~~~~~~~~~~~ src/ast_def_macros.hpp:106:16: warning: ‘virtual bool Sass::Selector::operator!=(const Sass::Selector&) const’ was hidden [-Woverloaded-virtual=] 106 | virtual bool operator!=(const klass& rhs) const { return !(*this == rhs); }; \ | ^~~~~~~~ src/ast_selectors.hpp:56:5: note: in expansion of macro ‘ATTACH_VIRTUAL_CMP_OPERATIONS’ 56 | ATTACH_VIRTUAL_CMP_OPERATIONS(Selector) | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~ src/ast_def_macros.hpp:110:16: note: by ‘virtual bool Sass::ComplexSelector::operator!=(const Sass::ComplexSelector&) const’ 110 | virtual bool operator!=(const klass& rhs) const { return !(*this == rhs); }; \ | ^~~~~~~~ src/ast_selectors.hpp:310:5: note: in expansion of macro ‘ATTACH_CMP_OPERATIONS’ 310 | ATTACH_CMP_OPERATIONS(ComplexSelector) | ^~~~~~~~~~~~~~~~~~~~~ src/ast_def_macros.hpp:106:16: warning: ‘virtual bool Sass::Selector::operator!=(const Sass::Selector&) const’ was hidden [-Woverloaded-virtual=] 106 | virtual bool operator!=(const klass& rhs) const { return !(*this == rhs); }; \ | ^~~~~~~~ src/ast_selectors.hpp:56:5: note: in expansion of macro ‘ATTACH_VIRTUAL_CMP_OPERATIONS’ 56 | ATTACH_VIRTUAL_CMP_OPERATIONS(Selector) | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~ src/ast_def_macros.hpp:106:16: note: by ‘virtual bool Sass::SelectorComponent::operator!=(const Sass::SelectorComponent&) const’ 106 | virtual bool operator!=(const klass& rhs) const { return !(*this == rhs); }; \ | ^~~~~~~~ src/ast_selectors.hpp:349:5: note: in expansion of macro ‘ATTACH_VIRTUAL_CMP_OPERATIONS’ 349 | ATTACH_VIRTUAL_CMP_OPERATIONS(SelectorComponent); | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~ src/ast_def_macros.hpp:106:16: warning: ‘virtual bool Sass::SelectorComponent::operator!=(const Sass::SelectorComponent&) const’ was hidden [-Woverloaded-virtual=] 106 | virtual bool operator!=(const klass& rhs) const { return !(*this == rhs); }; \ | ^~~~~~~~ src/ast_selectors.hpp:349:5: note: in expansion of macro ‘ATTACH_VIRTUAL_CMP_OPERATIONS’ 349 | ATTACH_VIRTUAL_CMP_OPERATIONS(SelectorComponent); | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~ src/ast_def_macros.hpp:110:16: note: by ‘virtual bool Sass::SelectorCombinator::operator!=(const Sass::SelectorCombinator&) const’ 110 | virtual bool operator!=(const klass& rhs) const { return !(*this == rhs); }; \ | ^~~~~~~~ src/ast_selectors.hpp:407:5: note: in expansion of macro ‘ATTACH_CMP_OPERATIONS’ 407 | ATTACH_CMP_OPERATIONS(SelectorCombinator) | ^~~~~~~~~~~~~~~~~~~~~ g++ -std=gnu++17 -Wall -O2 -std=c++11 -I ./include -fPIC -c -o src/ast_fwd_decl.o src/ast_fwd_decl.cpp In file included from src/ast_fwd_decl.cpp:1: src/ast.hpp:90:18: warning: ‘virtual bool Sass::AST_Node::operator==(const Sass::AST_Node&) const’ was hidden [-Woverloaded-virtual=] 90 | virtual bool operator== (const AST_Node& rhs) const { | ^~~~~~~~ src/ast.hpp:165:18: note: by ‘virtual bool Sass::Expression::operator==(const Sass::Expression&) const’ 165 | virtual bool operator== (const Expression& rhs) const { return false; } | ^~~~~~~~ src/ast.hpp:96:18: warning: ‘virtual bool Sass::AST_Node::operator!=(const Sass::AST_Node&) const’ was hidden [-Woverloaded-virtual=] 96 | virtual bool operator!= (const AST_Node& rhs) const { | ^~~~~~~~ src/ast.hpp:167:17: note: by ‘bool Sass::Expression::operator!=(const Sass::Expression&) const’ 167 | inline bool operator!=(const Expression& rhs) const { return !(rhs == *this); } | ^~~~~~~~ src/ast.hpp:90:18: warning: ‘virtual bool Sass::AST_Node::operator==(const Sass::AST_Node&) const’ was hidden [-Woverloaded-virtual=] 90 | virtual bool operator== (const AST_Node& rhs) const { | ^~~~~~~~ src/ast.hpp:908:10: note: by ‘bool Sass::CssMediaRule::operator==(const Sass::CssMediaRule&) const’ 908 | bool operator== (const CssMediaRule& rhs) const { | ^~~~~~~~ src/ast.hpp:96:18: warning: ‘virtual bool Sass::AST_Node::operator!=(const Sass::AST_Node&) const’ was hidden [-Woverloaded-virtual=] 96 | virtual bool operator!= (const AST_Node& rhs) const { | ^~~~~~~~ src/ast.hpp:911:10: note: by ‘bool Sass::CssMediaRule::operator!=(const Sass::CssMediaRule&) const’ 911 | bool operator!=(const CssMediaRule& rhs) const { | ^~~~~~~~ src/ast.hpp:90:18: warning: ‘virtual bool Sass::AST_Node::operator==(const Sass::AST_Node&) const’ was hidden [-Woverloaded-virtual=] 90 | virtual bool operator== (const AST_Node& rhs) const { | ^~~~~~~~ src/ast.hpp:939:10: note: by ‘bool Sass::CssMediaQuery::operator==(const Sass::CssMediaQuery&) const’ 939 | bool operator== (const CssMediaQuery& rhs) const; | ^~~~~~~~ src/ast.hpp:96:18: warning: ‘virtual bool Sass::AST_Node::operator!=(const Sass::AST_Node&) const’ was hidden [-Woverloaded-virtual=] 96 | virtual bool operator!= (const AST_Node& rhs) const { | ^~~~~~~~ src/ast.hpp:940:10: note: by ‘bool Sass::CssMediaQuery::operator!=(const Sass::CssMediaQuery&) const’ 940 | bool operator!=(const CssMediaQuery& rhs) const { | ^~~~~~~~ src/ast.hpp:165:18: warning: ‘virtual bool Sass::Expression::operator==(const Sass::Expression&) const’ was hidden [-Woverloaded-virtual=] 165 | virtual bool operator== (const Expression& rhs) const { return false; } | ^~~~~~~~ In file included from src/ast.hpp:14: src/ast_def_macros.hpp:105:16: note: by ‘virtual bool Sass::Selector::operator==(const Sass::Selector&) const’ 105 | virtual bool operator==(const klass& rhs) const = 0; \ | ^~~~~~~~ src/ast_selectors.hpp:56:5: note: in expansion of macro ‘ATTACH_VIRTUAL_CMP_OPERATIONS’ 56 | ATTACH_VIRTUAL_CMP_OPERATIONS(Selector) | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~ src/ast.hpp:96:18: warning: ‘virtual bool Sass::AST_Node::operator!=(const Sass::AST_Node&) const’ was hidden [-Woverloaded-virtual=] 96 | virtual bool operator!= (const AST_Node& rhs) const { | ^~~~~~~~ src/ast_def_macros.hpp:106:16: note: by ‘virtual bool Sass::Selector::operator!=(const Sass::Selector&) const’ 106 | virtual bool operator!=(const klass& rhs) const { return !(*this == rhs); }; \ | ^~~~~~~~ src/ast_selectors.hpp:56:5: note: in expansion of macro ‘ATTACH_VIRTUAL_CMP_OPERATIONS’ 56 | ATTACH_VIRTUAL_CMP_OPERATIONS(Selector) | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~ src/ast_def_macros.hpp:106:16: warning: ‘virtual bool Sass::Selector::operator!=(const Sass::Selector&) const’ was hidden [-Woverloaded-virtual=] 106 | virtual bool operator!=(const klass& rhs) const { return !(*this == rhs); }; \ | ^~~~~~~~ src/ast_selectors.hpp:56:5: note: in expansion of macro ‘ATTACH_VIRTUAL_CMP_OPERATIONS’ 56 | ATTACH_VIRTUAL_CMP_OPERATIONS(Selector) | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~ src/ast_def_macros.hpp:106:16: note: by ‘virtual bool Sass::SimpleSelector::operator!=(const Sass::SimpleSelector&) const’ 106 | virtual bool operator!=(const klass& rhs) const { return !(*this == rhs); }; \ | ^~~~~~~~ src/ast_selectors.hpp:139:5: note: in expansion of macro ‘ATTACH_VIRTUAL_CMP_OPERATIONS’ 139 | ATTACH_VIRTUAL_CMP_OPERATIONS(SimpleSelector); | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~ In file included from src/ast.hpp:1055: src/ast_selectors.hpp:137:18: warning: ‘virtual bool Sass::SimpleSelector::operator==(const Sass::CompoundSelector&) const’ was hidden [-Woverloaded-virtual=] 137 | virtual bool operator==(const CompoundSelector& rhs) const; | ^~~~~~~~ src/ast_def_macros.hpp:109:16: note: by ‘Sass::PlaceholderSelector::operator==’ 109 | virtual bool operator==(const klass& rhs) const; \ | ^~~~~~~~ src/ast_selectors.hpp:157:5: note: in expansion of macro ‘ATTACH_CMP_OPERATIONS’ 157 | ATTACH_CMP_OPERATIONS(PlaceholderSelector) | ^~~~~~~~~~~~~~~~~~~~~ src/ast_selectors.hpp:136:18: warning: ‘virtual bool Sass::SimpleSelector::operator==(const Sass::ComplexSelector&) const’ was hidden [-Woverloaded-virtual=] 136 | virtual bool operator==(const ComplexSelector& rhs) const; | ^~~~~~~~ src/ast_def_macros.hpp:109:16: note: by ‘Sass::PlaceholderSelector::operator==’ 109 | virtual bool operator==(const klass& rhs) const; \ | ^~~~~~~~ src/ast_selectors.hpp:157:5: note: in expansion of macro ‘ATTACH_CMP_OPERATIONS’ 157 | ATTACH_CMP_OPERATIONS(PlaceholderSelector) | ^~~~~~~~~~~~~~~~~~~~~ src/ast_selectors.hpp:135:18: warning: ‘virtual bool Sass::SimpleSelector::operator==(const Sass::SelectorList&) const’ was hidden [-Woverloaded-virtual=] 135 | virtual bool operator==(const SelectorList& rhs) const; | ^~~~~~~~ src/ast_def_macros.hpp:109:16: note: by ‘Sass::PlaceholderSelector::operator==’ 109 | virtual bool operator==(const klass& rhs) const; \ | ^~~~~~~~ src/ast_selectors.hpp:157:5: note: in expansion of macro ‘ATTACH_CMP_OPERATIONS’ 157 | ATTACH_CMP_OPERATIONS(PlaceholderSelector) | ^~~~~~~~~~~~~~~~~~~~~ src/ast_selectors.hpp:133:10: warning: ‘virtual bool Sass::SimpleSelector::operator==(const Sass::Selector&) const’ was hidden [-Woverloaded-virtual=] 133 | bool operator==(const Selector& rhs) const final override; | ^~~~~~~~ src/ast_def_macros.hpp:109:16: note: by ‘Sass::PlaceholderSelector::operator==’ 109 | virtual bool operator==(const klass& rhs) const; \ | ^~~~~~~~ src/ast_selectors.hpp:157:5: note: in expansion of macro ‘ATTACH_CMP_OPERATIONS’ 157 | ATTACH_CMP_OPERATIONS(PlaceholderSelector) | ^~~~~~~~~~~~~~~~~~~~~ src/ast_def_macros.hpp:106:16: warning: ‘virtual bool Sass::SimpleSelector::operator!=(const Sass::SimpleSelector&) const’ was hidden [-Woverloaded-virtual=] 106 | virtual bool operator!=(const klass& rhs) const { return !(*this == rhs); }; \ | ^~~~~~~~ src/ast_selectors.hpp:139:5: note: in expansion of macro ‘ATTACH_VIRTUAL_CMP_OPERATIONS’ 139 | ATTACH_VIRTUAL_CMP_OPERATIONS(SimpleSelector); | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~ src/ast_def_macros.hpp:110:16: note: by ‘virtual bool Sass::PlaceholderSelector::operator!=(const Sass::PlaceholderSelector&) const’ 110 | virtual bool operator!=(const klass& rhs) const { return !(*this == rhs); }; \ | ^~~~~~~~ src/ast_selectors.hpp:157:5: note: in expansion of macro ‘ATTACH_CMP_OPERATIONS’ 157 | ATTACH_CMP_OPERATIONS(PlaceholderSelector) | ^~~~~~~~~~~~~~~~~~~~~ src/ast_selectors.hpp:137:18: warning: ‘virtual bool Sass::SimpleSelector::operator==(const Sass::CompoundSelector&) const’ was hidden [-Woverloaded-virtual=] 137 | virtual bool operator==(const CompoundSelector& rhs) const; | ^~~~~~~~ src/ast_def_macros.hpp:109:16: note: by ‘Sass::TypeSelector::operator==’ 109 | virtual bool operator==(const klass& rhs) const; \ | ^~~~~~~~ src/ast_selectors.hpp:174:5: note: in expansion of macro ‘ATTACH_CMP_OPERATIONS’ 174 | ATTACH_CMP_OPERATIONS(TypeSelector) | ^~~~~~~~~~~~~~~~~~~~~ src/ast_selectors.hpp:136:18: warning: ‘virtual bool Sass::SimpleSelector::operator==(const Sass::ComplexSelector&) const’ was hidden [-Woverloaded-virtual=] 136 | virtual bool operator==(const ComplexSelector& rhs) const; | ^~~~~~~~ src/ast_def_macros.hpp:109:16: note: by ‘Sass::TypeSelector::operator==’ 109 | virtual bool operator==(const klass& rhs) const; \ | ^~~~~~~~ src/ast_selectors.hpp:174:5: note: in expansion of macro ‘ATTACH_CMP_OPERATIONS’ 174 | ATTACH_CMP_OPERATIONS(TypeSelector) | ^~~~~~~~~~~~~~~~~~~~~ src/ast_selectors.hpp:135:18: warning: ‘virtual bool Sass::SimpleSelector::operator==(const Sass::SelectorList&) const’ was hidden [-Woverloaded-virtual=] 135 | virtual bool operator==(const SelectorList& rhs) const; | ^~~~~~~~ src/ast_def_macros.hpp:109:16: note: by ‘Sass::TypeSelector::operator==’ 109 | virtual bool operator==(const klass& rhs) const; \ | ^~~~~~~~ src/ast_selectors.hpp:174:5: note: in expansion of macro ‘ATTACH_CMP_OPERATIONS’ 174 | ATTACH_CMP_OPERATIONS(TypeSelector) | ^~~~~~~~~~~~~~~~~~~~~ src/ast_selectors.hpp:133:10: warning: ‘virtual bool Sass::SimpleSelector::operator==(const Sass::Selector&) const’ was hidden [-Woverloaded-virtual=] 133 | bool operator==(const Selector& rhs) const final override; | ^~~~~~~~ src/ast_def_macros.hpp:109:16: note: by ‘Sass::TypeSelector::operator==’ 109 | virtual bool operator==(const klass& rhs) const; \ | ^~~~~~~~ src/ast_selectors.hpp:174:5: note: in expansion of macro ‘ATTACH_CMP_OPERATIONS’ 174 | ATTACH_CMP_OPERATIONS(TypeSelector) | ^~~~~~~~~~~~~~~~~~~~~ src/ast_def_macros.hpp:106:16: warning: ‘virtual bool Sass::SimpleSelector::operator!=(const Sass::SimpleSelector&) const’ was hidden [-Woverloaded-virtual=] 106 | virtual bool operator!=(const klass& rhs) const { return !(*this == rhs); }; \ | ^~~~~~~~ src/ast_selectors.hpp:139:5: note: in expansion of macro ‘ATTACH_VIRTUAL_CMP_OPERATIONS’ 139 | ATTACH_VIRTUAL_CMP_OPERATIONS(SimpleSelector); | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~ src/ast_def_macros.hpp:110:16: note: by ‘virtual bool Sass::TypeSelector::operator!=(const Sass::TypeSelector&) const’ 110 | virtual bool operator!=(const klass& rhs) const { return !(*this == rhs); }; \ | ^~~~~~~~ src/ast_selectors.hpp:174:5: note: in expansion of macro ‘ATTACH_CMP_OPERATIONS’ 174 | ATTACH_CMP_OPERATIONS(TypeSelector) | ^~~~~~~~~~~~~~~~~~~~~ src/ast_selectors.hpp:137:18: warning: ‘virtual bool Sass::SimpleSelector::operator==(const Sass::CompoundSelector&) const’ was hidden [-Woverloaded-virtual=] 137 | virtual bool operator==(const CompoundSelector& rhs) const; | ^~~~~~~~ src/ast_def_macros.hpp:109:16: note: by ‘Sass::ClassSelector::operator==’ 109 | virtual bool operator==(const klass& rhs) const; \ | ^~~~~~~~ src/ast_selectors.hpp:188:5: note: in expansion of macro ‘ATTACH_CMP_OPERATIONS’ 188 | ATTACH_CMP_OPERATIONS(ClassSelector) | ^~~~~~~~~~~~~~~~~~~~~ src/ast_selectors.hpp:136:18: warning: ‘virtual bool Sass::SimpleSelector::operator==(const Sass::ComplexSelector&) const’ was hidden [-Woverloaded-virtual=] 136 | virtual bool operator==(const ComplexSelector& rhs) const; | ^~~~~~~~ src/ast_def_macros.hpp:109:16: note: by ‘Sass::ClassSelector::operator==’ 109 | virtual bool operator==(const klass& rhs) const; \ | ^~~~~~~~ src/ast_selectors.hpp:188:5: note: in expansion of macro ‘ATTACH_CMP_OPERATIONS’ 188 | ATTACH_CMP_OPERATIONS(ClassSelector) | ^~~~~~~~~~~~~~~~~~~~~ src/ast_selectors.hpp:135:18: warning: ‘virtual bool Sass::SimpleSelector::operator==(const Sass::SelectorList&) const’ was hidden [-Woverloaded-virtual=] 135 | virtual bool operator==(const SelectorList& rhs) const; | ^~~~~~~~ src/ast_def_macros.hpp:109:16: note: by ‘Sass::ClassSelector::operator==’ 109 | virtual bool operator==(const klass& rhs) const; \ | ^~~~~~~~ src/ast_selectors.hpp:188:5: note: in expansion of macro ‘ATTACH_CMP_OPERATIONS’ 188 | ATTACH_CMP_OPERATIONS(ClassSelector) | ^~~~~~~~~~~~~~~~~~~~~ src/ast_selectors.hpp:133:10: warning: ‘virtual bool Sass::SimpleSelector::operator==(const Sass::Selector&) const’ was hidden [-Woverloaded-virtual=] 133 | bool operator==(const Selector& rhs) const final override; | ^~~~~~~~ src/ast_def_macros.hpp:109:16: note: by ‘Sass::ClassSelector::operator==’ 109 | virtual bool operator==(const klass& rhs) const; \ | ^~~~~~~~ src/ast_selectors.hpp:188:5: note: in expansion of macro ‘ATTACH_CMP_OPERATIONS’ 188 | ATTACH_CMP_OPERATIONS(ClassSelector) | ^~~~~~~~~~~~~~~~~~~~~ src/ast_def_macros.hpp:106:16: warning: ‘virtual bool Sass::SimpleSelector::operator!=(const Sass::SimpleSelector&) const’ was hidden [-Woverloaded-virtual=] 106 | virtual bool operator!=(const klass& rhs) const { return !(*this == rhs); }; \ | ^~~~~~~~ src/ast_selectors.hpp:139:5: note: in expansion of macro ‘ATTACH_VIRTUAL_CMP_OPERATIONS’ 139 | ATTACH_VIRTUAL_CMP_OPERATIONS(SimpleSelector); | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~ src/ast_def_macros.hpp:110:16: note: by ‘virtual bool Sass::ClassSelector::operator!=(const Sass::ClassSelector&) const’ 110 | virtual bool operator!=(const klass& rhs) const { return !(*this == rhs); }; \ | ^~~~~~~~ src/ast_selectors.hpp:188:5: note: in expansion of macro ‘ATTACH_CMP_OPERATIONS’ 188 | ATTACH_CMP_OPERATIONS(ClassSelector) | ^~~~~~~~~~~~~~~~~~~~~ src/ast_selectors.hpp:137:18: warning: ‘virtual bool Sass::SimpleSelector::operator==(const Sass::CompoundSelector&) const’ was hidden [-Woverloaded-virtual=] 137 | virtual bool operator==(const CompoundSelector& rhs) const; | ^~~~~~~~ src/ast_def_macros.hpp:109:16: note: by ‘Sass::IDSelector::operator==’ 109 | virtual bool operator==(const klass& rhs) const; \ | ^~~~~~~~ src/ast_selectors.hpp:204:5: note: in expansion of macro ‘ATTACH_CMP_OPERATIONS’ 204 | ATTACH_CMP_OPERATIONS(IDSelector) | ^~~~~~~~~~~~~~~~~~~~~ src/ast_selectors.hpp:136:18: warning: ‘virtual bool Sass::SimpleSelector::operator==(const Sass::ComplexSelector&) const’ was hidden [-Woverloaded-virtual=] 136 | virtual bool operator==(const ComplexSelector& rhs) const; | ^~~~~~~~ src/ast_def_macros.hpp:109:16: note: by ‘Sass::IDSelector::operator==’ 109 | virtual bool operator==(const klass& rhs) const; \ | ^~~~~~~~ src/ast_selectors.hpp:204:5: note: in expansion of macro ‘ATTACH_CMP_OPERATIONS’ 204 | ATTACH_CMP_OPERATIONS(IDSelector) | ^~~~~~~~~~~~~~~~~~~~~ src/ast_selectors.hpp:135:18: warning: ‘virtual bool Sass::SimpleSelector::operator==(const Sass::SelectorList&) const’ was hidden [-Woverloaded-virtual=] 135 | virtual bool operator==(const SelectorList& rhs) const; | ^~~~~~~~ src/ast_def_macros.hpp:109:16: note: by ‘Sass::IDSelector::operator==’ 109 | virtual bool operator==(const klass& rhs) const; \ | ^~~~~~~~ src/ast_selectors.hpp:204:5: note: in expansion of macro ‘ATTACH_CMP_OPERATIONS’ 204 | ATTACH_CMP_OPERATIONS(IDSelector) | ^~~~~~~~~~~~~~~~~~~~~ src/ast_selectors.hpp:133:10: warning: ‘virtual bool Sass::SimpleSelector::operator==(const Sass::Selector&) const’ was hidden [-Woverloaded-virtual=] 133 | bool operator==(const Selector& rhs) const final override; | ^~~~~~~~ src/ast_def_macros.hpp:109:16: note: by ‘Sass::IDSelector::operator==’ 109 | virtual bool operator==(const klass& rhs) const; \ | ^~~~~~~~ src/ast_selectors.hpp:204:5: note: in expansion of macro ‘ATTACH_CMP_OPERATIONS’ 204 | ATTACH_CMP_OPERATIONS(IDSelector) | ^~~~~~~~~~~~~~~~~~~~~ src/ast_def_macros.hpp:106:16: warning: ‘virtual bool Sass::SimpleSelector::operator!=(const Sass::SimpleSelector&) const’ was hidden [-Woverloaded-virtual=] 106 | virtual bool operator!=(const klass& rhs) const { return !(*this == rhs); }; \ | ^~~~~~~~ src/ast_selectors.hpp:139:5: note: in expansion of macro ‘ATTACH_VIRTUAL_CMP_OPERATIONS’ 139 | ATTACH_VIRTUAL_CMP_OPERATIONS(SimpleSelector); | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~ src/ast_def_macros.hpp:110:16: note: by ‘virtual bool Sass::IDSelector::operator!=(const Sass::IDSelector&) const’ 110 | virtual bool operator!=(const klass& rhs) const { return !(*this == rhs); }; \ | ^~~~~~~~ src/ast_selectors.hpp:204:5: note: in expansion of macro ‘ATTACH_CMP_OPERATIONS’ 204 | ATTACH_CMP_OPERATIONS(IDSelector) | ^~~~~~~~~~~~~~~~~~~~~ src/ast_selectors.hpp:137:18: warning: ‘virtual bool Sass::SimpleSelector::operator==(const Sass::CompoundSelector&) const’ was hidden [-Woverloaded-virtual=] 137 | virtual bool operator==(const CompoundSelector& rhs) const; | ^~~~~~~~ src/ast_def_macros.hpp:109:16: note: by ‘Sass::AttributeSelector::operator==’ 109 | virtual bool operator==(const klass& rhs) const; \ | ^~~~~~~~ src/ast_selectors.hpp:223:5: note: in expansion of macro ‘ATTACH_CMP_OPERATIONS’ 223 | ATTACH_CMP_OPERATIONS(AttributeSelector) | ^~~~~~~~~~~~~~~~~~~~~ src/ast_selectors.hpp:136:18: warning: ‘virtual bool Sass::SimpleSelector::operator==(const Sass::ComplexSelector&) const’ was hidden [-Woverloaded-virtual=] 136 | virtual bool operator==(const ComplexSelector& rhs) const; | ^~~~~~~~ src/ast_def_macros.hpp:109:16: note: by ‘Sass::AttributeSelector::operator==’ 109 | virtual bool operator==(const klass& rhs) const; \ | ^~~~~~~~ src/ast_selectors.hpp:223:5: note: in expansion of macro ‘ATTACH_CMP_OPERATIONS’ 223 | ATTACH_CMP_OPERATIONS(AttributeSelector) | ^~~~~~~~~~~~~~~~~~~~~ src/ast_selectors.hpp:135:18: warning: ‘virtual bool Sass::SimpleSelector::operator==(const Sass::SelectorList&) const’ was hidden [-Woverloaded-virtual=] 135 | virtual bool operator==(const SelectorList& rhs) const; | ^~~~~~~~ src/ast_def_macros.hpp:109:16: note: by ‘Sass::AttributeSelector::operator==’ 109 | virtual bool operator==(const klass& rhs) const; \ | ^~~~~~~~ src/ast_selectors.hpp:223:5: note: in expansion of macro ‘ATTACH_CMP_OPERATIONS’ 223 | ATTACH_CMP_OPERATIONS(AttributeSelector) | ^~~~~~~~~~~~~~~~~~~~~ src/ast_selectors.hpp:133:10: warning: ‘virtual bool Sass::SimpleSelector::operator==(const Sass::Selector&) const’ was hidden [-Woverloaded-virtual=] 133 | bool operator==(const Selector& rhs) const final override; | ^~~~~~~~ src/ast_def_macros.hpp:109:16: note: by ‘Sass::AttributeSelector::operator==’ 109 | virtual bool operator==(const klass& rhs) const; \ | ^~~~~~~~ src/ast_selectors.hpp:223:5: note: in expansion of macro ‘ATTACH_CMP_OPERATIONS’ 223 | ATTACH_CMP_OPERATIONS(AttributeSelector) | ^~~~~~~~~~~~~~~~~~~~~ src/ast_def_macros.hpp:106:16: warning: ‘virtual bool Sass::SimpleSelector::operator!=(const Sass::SimpleSelector&) const’ was hidden [-Woverloaded-virtual=] 106 | virtual bool operator!=(const klass& rhs) const { return !(*this == rhs); }; \ | ^~~~~~~~ src/ast_selectors.hpp:139:5: note: in expansion of macro ‘ATTACH_VIRTUAL_CMP_OPERATIONS’ 139 | ATTACH_VIRTUAL_CMP_OPERATIONS(SimpleSelector); | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~ src/ast_def_macros.hpp:110:16: note: by ‘virtual bool Sass::AttributeSelector::operator!=(const Sass::AttributeSelector&) const’ 110 | virtual bool operator!=(const klass& rhs) const { return !(*this == rhs); }; \ | ^~~~~~~~ src/ast_selectors.hpp:223:5: note: in expansion of macro ‘ATTACH_CMP_OPERATIONS’ 223 | ATTACH_CMP_OPERATIONS(AttributeSelector) | ^~~~~~~~~~~~~~~~~~~~~ src/ast_def_macros.hpp:106:16: warning: ‘virtual bool Sass::Selector::operator!=(const Sass::Selector&) const’ was hidden [-Woverloaded-virtual=] 106 | virtual bool operator!=(const klass& rhs) const { return !(*this == rhs); }; \ | ^~~~~~~~ src/ast_selectors.hpp:56:5: note: in expansion of macro ‘ATTACH_VIRTUAL_CMP_OPERATIONS’ 56 | ATTACH_VIRTUAL_CMP_OPERATIONS(Selector) | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~ src/ast_def_macros.hpp:110:16: note: by ‘virtual bool Sass::ComplexSelector::operator!=(const Sass::ComplexSelector&) const’ 110 | virtual bool operator!=(const klass& rhs) const { return !(*this == rhs); }; \ | ^~~~~~~~ src/ast_selectors.hpp:310:5: note: in expansion of macro ‘ATTACH_CMP_OPERATIONS’ 310 | ATTACH_CMP_OPERATIONS(ComplexSelector) | ^~~~~~~~~~~~~~~~~~~~~ src/ast_def_macros.hpp:106:16: warning: ‘virtual bool Sass::Selector::operator!=(const Sass::Selector&) const’ was hidden [-Woverloaded-virtual=] 106 | virtual bool operator!=(const klass& rhs) const { return !(*this == rhs); }; \ | ^~~~~~~~ src/ast_selectors.hpp:56:5: note: in expansion of macro ‘ATTACH_VIRTUAL_CMP_OPERATIONS’ 56 | ATTACH_VIRTUAL_CMP_OPERATIONS(Selector) | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~ src/ast_def_macros.hpp:106:16: note: by ‘virtual bool Sass::SelectorComponent::operator!=(const Sass::SelectorComponent&) const’ 106 | virtual bool operator!=(const klass& rhs) const { return !(*this == rhs); }; \ | ^~~~~~~~ src/ast_selectors.hpp:349:5: note: in expansion of macro ‘ATTACH_VIRTUAL_CMP_OPERATIONS’ 349 | ATTACH_VIRTUAL_CMP_OPERATIONS(SelectorComponent); | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~ src/ast_def_macros.hpp:106:16: warning: ‘virtual bool Sass::SelectorComponent::operator!=(const Sass::SelectorComponent&) const’ was hidden [-Woverloaded-virtual=] 106 | virtual bool operator!=(const klass& rhs) const { return !(*this == rhs); }; \ | ^~~~~~~~ src/ast_selectors.hpp:349:5: note: in expansion of macro ‘ATTACH_VIRTUAL_CMP_OPERATIONS’ 349 | ATTACH_VIRTUAL_CMP_OPERATIONS(SelectorComponent); | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~ src/ast_def_macros.hpp:110:16: note: by ‘virtual bool Sass::SelectorCombinator::operator!=(const Sass::SelectorCombinator&) const’ 110 | virtual bool operator!=(const klass& rhs) const { return !(*this == rhs); }; \ | ^~~~~~~~ src/ast_selectors.hpp:407:5: note: in expansion of macro ‘ATTACH_CMP_OPERATIONS’ 407 | ATTACH_CMP_OPERATIONS(SelectorCombinator) | ^~~~~~~~~~~~~~~~~~~~~ g++ -std=gnu++17 -Wall -O2 -std=c++11 -I ./include -fPIC -c -o src/bind.o src/bind.cpp In file included from src/bind.cpp:3: src/ast.hpp:90:18: warning: ‘virtual bool Sass::AST_Node::operator==(const Sass::AST_Node&) const’ was hidden [-Woverloaded-virtual=] 90 | virtual bool operator== (const AST_Node& rhs) const { | ^~~~~~~~ src/ast.hpp:165:18: note: by ‘virtual bool Sass::Expression::operator==(const Sass::Expression&) const’ 165 | virtual bool operator== (const Expression& rhs) const { return false; } | ^~~~~~~~ src/ast.hpp:96:18: warning: ‘virtual bool Sass::AST_Node::operator!=(const Sass::AST_Node&) const’ was hidden [-Woverloaded-virtual=] 96 | virtual bool operator!= (const AST_Node& rhs) const { | ^~~~~~~~ src/ast.hpp:167:17: note: by ‘bool Sass::Expression::operator!=(const Sass::Expression&) const’ 167 | inline bool operator!=(const Expression& rhs) const { return !(rhs == *this); } | ^~~~~~~~ src/ast.hpp:90:18: warning: ‘virtual bool Sass::AST_Node::operator==(const Sass::AST_Node&) const’ was hidden [-Woverloaded-virtual=] 90 | virtual bool operator== (const AST_Node& rhs) const { | ^~~~~~~~ src/ast.hpp:908:10: note: by ‘bool Sass::CssMediaRule::operator==(const Sass::CssMediaRule&) const’ 908 | bool operator== (const CssMediaRule& rhs) const { | ^~~~~~~~ src/ast.hpp:96:18: warning: ‘virtual bool Sass::AST_Node::operator!=(const Sass::AST_Node&) const’ was hidden [-Woverloaded-virtual=] 96 | virtual bool operator!= (const AST_Node& rhs) const { | ^~~~~~~~ src/ast.hpp:911:10: note: by ‘bool Sass::CssMediaRule::operator!=(const Sass::CssMediaRule&) const’ 911 | bool operator!=(const CssMediaRule& rhs) const { | ^~~~~~~~ src/ast.hpp:90:18: warning: ‘virtual bool Sass::AST_Node::operator==(const Sass::AST_Node&) const’ was hidden [-Woverloaded-virtual=] 90 | virtual bool operator== (const AST_Node& rhs) const { | ^~~~~~~~ src/ast.hpp:939:10: note: by ‘bool Sass::CssMediaQuery::operator==(const Sass::CssMediaQuery&) const’ 939 | bool operator== (const CssMediaQuery& rhs) const; | ^~~~~~~~ src/ast.hpp:96:18: warning: ‘virtual bool Sass::AST_Node::operator!=(const Sass::AST_Node&) const’ was hidden [-Woverloaded-virtual=] 96 | virtual bool operator!= (const AST_Node& rhs) const { | ^~~~~~~~ src/ast.hpp:940:10: note: by ‘bool Sass::CssMediaQuery::operator!=(const Sass::CssMediaQuery&) const’ 940 | bool operator!=(const CssMediaQuery& rhs) const { | ^~~~~~~~ src/ast.hpp:165:18: warning: ‘virtual bool Sass::Expression::operator==(const Sass::Expression&) const’ was hidden [-Woverloaded-virtual=] 165 | virtual bool operator== (const Expression& rhs) const { return false; } | ^~~~~~~~ In file included from src/environment.hpp:11, from src/bind.hpp:6, from src/bind.cpp:2: src/ast_def_macros.hpp:105:16: note: by ‘virtual bool Sass::Selector::operator==(const Sass::Selector&) const’ 105 | virtual bool operator==(const klass& rhs) const = 0; \ | ^~~~~~~~ src/ast_selectors.hpp:56:5: note: in expansion of macro ‘ATTACH_VIRTUAL_CMP_OPERATIONS’ 56 | ATTACH_VIRTUAL_CMP_OPERATIONS(Selector) | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~ src/ast.hpp:96:18: warning: ‘virtual bool Sass::AST_Node::operator!=(const Sass::AST_Node&) const’ was hidden [-Woverloaded-virtual=] 96 | virtual bool operator!= (const AST_Node& rhs) const { | ^~~~~~~~ src/ast_def_macros.hpp:106:16: note: by ‘virtual bool Sass::Selector::operator!=(const Sass::Selector&) const’ 106 | virtual bool operator!=(const klass& rhs) const { return !(*this == rhs); }; \ | ^~~~~~~~ src/ast_selectors.hpp:56:5: note: in expansion of macro ‘ATTACH_VIRTUAL_CMP_OPERATIONS’ 56 | ATTACH_VIRTUAL_CMP_OPERATIONS(Selector) | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~ src/ast_def_macros.hpp:106:16: warning: ‘virtual bool Sass::Selector::operator!=(const Sass::Selector&) const’ was hidden [-Woverloaded-virtual=] 106 | virtual bool operator!=(const klass& rhs) const { return !(*this == rhs); }; \ | ^~~~~~~~ src/ast_selectors.hpp:56:5: note: in expansion of macro ‘ATTACH_VIRTUAL_CMP_OPERATIONS’ 56 | ATTACH_VIRTUAL_CMP_OPERATIONS(Selector) | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~ src/ast_def_macros.hpp:106:16: note: by ‘virtual bool Sass::SimpleSelector::operator!=(const Sass::SimpleSelector&) const’ 106 | virtual bool operator!=(const klass& rhs) const { return !(*this == rhs); }; \ | ^~~~~~~~ src/ast_selectors.hpp:139:5: note: in expansion of macro ‘ATTACH_VIRTUAL_CMP_OPERATIONS’ 139 | ATTACH_VIRTUAL_CMP_OPERATIONS(SimpleSelector); | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~ In file included from src/ast.hpp:1055: src/ast_selectors.hpp:137:18: warning: ‘virtual bool Sass::SimpleSelector::operator==(const Sass::CompoundSelector&) const’ was hidden [-Woverloaded-virtual=] 137 | virtual bool operator==(const CompoundSelector& rhs) const; | ^~~~~~~~ src/ast_def_macros.hpp:109:16: note: by ‘Sass::PlaceholderSelector::operator==’ 109 | virtual bool operator==(const klass& rhs) const; \ | ^~~~~~~~ src/ast_selectors.hpp:157:5: note: in expansion of macro ‘ATTACH_CMP_OPERATIONS’ 157 | ATTACH_CMP_OPERATIONS(PlaceholderSelector) | ^~~~~~~~~~~~~~~~~~~~~ src/ast_selectors.hpp:136:18: warning: ‘virtual bool Sass::SimpleSelector::operator==(const Sass::ComplexSelector&) const’ was hidden [-Woverloaded-virtual=] 136 | virtual bool operator==(const ComplexSelector& rhs) const; | ^~~~~~~~ src/ast_def_macros.hpp:109:16: note: by ‘Sass::PlaceholderSelector::operator==’ 109 | virtual bool operator==(const klass& rhs) const; \ | ^~~~~~~~ src/ast_selectors.hpp:157:5: note: in expansion of macro ‘ATTACH_CMP_OPERATIONS’ 157 | ATTACH_CMP_OPERATIONS(PlaceholderSelector) | ^~~~~~~~~~~~~~~~~~~~~ src/ast_selectors.hpp:135:18: warning: ‘virtual bool Sass::SimpleSelector::operator==(const Sass::SelectorList&) const’ was hidden [-Woverloaded-virtual=] 135 | virtual bool operator==(const SelectorList& rhs) const; | ^~~~~~~~ src/ast_def_macros.hpp:109:16: note: by ‘Sass::PlaceholderSelector::operator==’ 109 | virtual bool operator==(const klass& rhs) const; \ | ^~~~~~~~ src/ast_selectors.hpp:157:5: note: in expansion of macro ‘ATTACH_CMP_OPERATIONS’ 157 | ATTACH_CMP_OPERATIONS(PlaceholderSelector) | ^~~~~~~~~~~~~~~~~~~~~ src/ast_selectors.hpp:133:10: warning: ‘virtual bool Sass::SimpleSelector::operator==(const Sass::Selector&) const’ was hidden [-Woverloaded-virtual=] 133 | bool operator==(const Selector& rhs) const final override; | ^~~~~~~~ src/ast_def_macros.hpp:109:16: note: by ‘Sass::PlaceholderSelector::operator==’ 109 | virtual bool operator==(const klass& rhs) const; \ | ^~~~~~~~ src/ast_selectors.hpp:157:5: note: in expansion of macro ‘ATTACH_CMP_OPERATIONS’ 157 | ATTACH_CMP_OPERATIONS(PlaceholderSelector) | ^~~~~~~~~~~~~~~~~~~~~ src/ast_def_macros.hpp:106:16: warning: ‘virtual bool Sass::SimpleSelector::operator!=(const Sass::SimpleSelector&) const’ was hidden [-Woverloaded-virtual=] 106 | virtual bool operator!=(const klass& rhs) const { return !(*this == rhs); }; \ | ^~~~~~~~ src/ast_selectors.hpp:139:5: note: in expansion of macro ‘ATTACH_VIRTUAL_CMP_OPERATIONS’ 139 | ATTACH_VIRTUAL_CMP_OPERATIONS(SimpleSelector); | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~ src/ast_def_macros.hpp:110:16: note: by ‘virtual bool Sass::PlaceholderSelector::operator!=(const Sass::PlaceholderSelector&) const’ 110 | virtual bool operator!=(const klass& rhs) const { return !(*this == rhs); }; \ | ^~~~~~~~ src/ast_selectors.hpp:157:5: note: in expansion of macro ‘ATTACH_CMP_OPERATIONS’ 157 | ATTACH_CMP_OPERATIONS(PlaceholderSelector) | ^~~~~~~~~~~~~~~~~~~~~ src/ast_selectors.hpp:137:18: warning: ‘virtual bool Sass::SimpleSelector::operator==(const Sass::CompoundSelector&) const’ was hidden [-Woverloaded-virtual=] 137 | virtual bool operator==(const CompoundSelector& rhs) const; | ^~~~~~~~ src/ast_def_macros.hpp:109:16: note: by ‘Sass::TypeSelector::operator==’ 109 | virtual bool operator==(const klass& rhs) const; \ | ^~~~~~~~ src/ast_selectors.hpp:174:5: note: in expansion of macro ‘ATTACH_CMP_OPERATIONS’ 174 | ATTACH_CMP_OPERATIONS(TypeSelector) | ^~~~~~~~~~~~~~~~~~~~~ src/ast_selectors.hpp:136:18: warning: ‘virtual bool Sass::SimpleSelector::operator==(const Sass::ComplexSelector&) const’ was hidden [-Woverloaded-virtual=] 136 | virtual bool operator==(const ComplexSelector& rhs) const; | ^~~~~~~~ src/ast_def_macros.hpp:109:16: note: by ‘Sass::TypeSelector::operator==’ 109 | virtual bool operator==(const klass& rhs) const; \ | ^~~~~~~~ src/ast_selectors.hpp:174:5: note: in expansion of macro ‘ATTACH_CMP_OPERATIONS’ 174 | ATTACH_CMP_OPERATIONS(TypeSelector) | ^~~~~~~~~~~~~~~~~~~~~ src/ast_selectors.hpp:135:18: warning: ‘virtual bool Sass::SimpleSelector::operator==(const Sass::SelectorList&) const’ was hidden [-Woverloaded-virtual=] 135 | virtual bool operator==(const SelectorList& rhs) const; | ^~~~~~~~ src/ast_def_macros.hpp:109:16: note: by ‘Sass::TypeSelector::operator==’ 109 | virtual bool operator==(const klass& rhs) const; \ | ^~~~~~~~ src/ast_selectors.hpp:174:5: note: in expansion of macro ‘ATTACH_CMP_OPERATIONS’ 174 | ATTACH_CMP_OPERATIONS(TypeSelector) | ^~~~~~~~~~~~~~~~~~~~~ src/ast_selectors.hpp:133:10: warning: ‘virtual bool Sass::SimpleSelector::operator==(const Sass::Selector&) const’ was hidden [-Woverloaded-virtual=] 133 | bool operator==(const Selector& rhs) const final override; | ^~~~~~~~ src/ast_def_macros.hpp:109:16: note: by ‘Sass::TypeSelector::operator==’ 109 | virtual bool operator==(const klass& rhs) const; \ | ^~~~~~~~ src/ast_selectors.hpp:174:5: note: in expansion of macro ‘ATTACH_CMP_OPERATIONS’ 174 | ATTACH_CMP_OPERATIONS(TypeSelector) | ^~~~~~~~~~~~~~~~~~~~~ src/ast_def_macros.hpp:106:16: warning: ‘virtual bool Sass::SimpleSelector::operator!=(const Sass::SimpleSelector&) const’ was hidden [-Woverloaded-virtual=] 106 | virtual bool operator!=(const klass& rhs) const { return !(*this == rhs); }; \ | ^~~~~~~~ src/ast_selectors.hpp:139:5: note: in expansion of macro ‘ATTACH_VIRTUAL_CMP_OPERATIONS’ 139 | ATTACH_VIRTUAL_CMP_OPERATIONS(SimpleSelector); | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~ src/ast_def_macros.hpp:110:16: note: by ‘virtual bool Sass::TypeSelector::operator!=(const Sass::TypeSelector&) const’ 110 | virtual bool operator!=(const klass& rhs) const { return !(*this == rhs); }; \ | ^~~~~~~~ src/ast_selectors.hpp:174:5: note: in expansion of macro ‘ATTACH_CMP_OPERATIONS’ 174 | ATTACH_CMP_OPERATIONS(TypeSelector) | ^~~~~~~~~~~~~~~~~~~~~ src/ast_selectors.hpp:137:18: warning: ‘virtual bool Sass::SimpleSelector::operator==(const Sass::CompoundSelector&) const’ was hidden [-Woverloaded-virtual=] 137 | virtual bool operator==(const CompoundSelector& rhs) const; | ^~~~~~~~ src/ast_def_macros.hpp:109:16: note: by ‘Sass::ClassSelector::operator==’ 109 | virtual bool operator==(const klass& rhs) const; \ | ^~~~~~~~ src/ast_selectors.hpp:188:5: note: in expansion of macro ‘ATTACH_CMP_OPERATIONS’ 188 | ATTACH_CMP_OPERATIONS(ClassSelector) | ^~~~~~~~~~~~~~~~~~~~~ src/ast_selectors.hpp:136:18: warning: ‘virtual bool Sass::SimpleSelector::operator==(const Sass::ComplexSelector&) const’ was hidden [-Woverloaded-virtual=] 136 | virtual bool operator==(const ComplexSelector& rhs) const; | ^~~~~~~~ src/ast_def_macros.hpp:109:16: note: by ‘Sass::ClassSelector::operator==’ 109 | virtual bool operator==(const klass& rhs) const; \ | ^~~~~~~~ src/ast_selectors.hpp:188:5: note: in expansion of macro ‘ATTACH_CMP_OPERATIONS’ 188 | ATTACH_CMP_OPERATIONS(ClassSelector) | ^~~~~~~~~~~~~~~~~~~~~ src/ast_selectors.hpp:135:18: warning: ‘virtual bool Sass::SimpleSelector::operator==(const Sass::SelectorList&) const’ was hidden [-Woverloaded-virtual=] 135 | virtual bool operator==(const SelectorList& rhs) const; | ^~~~~~~~ src/ast_def_macros.hpp:109:16: note: by ‘Sass::ClassSelector::operator==’ 109 | virtual bool operator==(const klass& rhs) const; \ | ^~~~~~~~ src/ast_selectors.hpp:188:5: note: in expansion of macro ‘ATTACH_CMP_OPERATIONS’ 188 | ATTACH_CMP_OPERATIONS(ClassSelector) | ^~~~~~~~~~~~~~~~~~~~~ src/ast_selectors.hpp:133:10: warning: ‘virtual bool Sass::SimpleSelector::operator==(const Sass::Selector&) const’ was hidden [-Woverloaded-virtual=] 133 | bool operator==(const Selector& rhs) const final override; | ^~~~~~~~ src/ast_def_macros.hpp:109:16: note: by ‘Sass::ClassSelector::operator==’ 109 | virtual bool operator==(const klass& rhs) const; \ | ^~~~~~~~ src/ast_selectors.hpp:188:5: note: in expansion of macro ‘ATTACH_CMP_OPERATIONS’ 188 | ATTACH_CMP_OPERATIONS(ClassSelector) | ^~~~~~~~~~~~~~~~~~~~~ src/ast_def_macros.hpp:106:16: warning: ‘virtual bool Sass::SimpleSelector::operator!=(const Sass::SimpleSelector&) const’ was hidden [-Woverloaded-virtual=] 106 | virtual bool operator!=(const klass& rhs) const { return !(*this == rhs); }; \ | ^~~~~~~~ src/ast_selectors.hpp:139:5: note: in expansion of macro ‘ATTACH_VIRTUAL_CMP_OPERATIONS’ 139 | ATTACH_VIRTUAL_CMP_OPERATIONS(SimpleSelector); | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~ src/ast_def_macros.hpp:110:16: note: by ‘virtual bool Sass::ClassSelector::operator!=(const Sass::ClassSelector&) const’ 110 | virtual bool operator!=(const klass& rhs) const { return !(*this == rhs); }; \ | ^~~~~~~~ src/ast_selectors.hpp:188:5: note: in expansion of macro ‘ATTACH_CMP_OPERATIONS’ 188 | ATTACH_CMP_OPERATIONS(ClassSelector) | ^~~~~~~~~~~~~~~~~~~~~ src/ast_selectors.hpp:137:18: warning: ‘virtual bool Sass::SimpleSelector::operator==(const Sass::CompoundSelector&) const’ was hidden [-Woverloaded-virtual=] 137 | virtual bool operator==(const CompoundSelector& rhs) const; | ^~~~~~~~ src/ast_def_macros.hpp:109:16: note: by ‘Sass::IDSelector::operator==’ 109 | virtual bool operator==(const klass& rhs) const; \ | ^~~~~~~~ src/ast_selectors.hpp:204:5: note: in expansion of macro ‘ATTACH_CMP_OPERATIONS’ 204 | ATTACH_CMP_OPERATIONS(IDSelector) | ^~~~~~~~~~~~~~~~~~~~~ src/ast_selectors.hpp:136:18: warning: ‘virtual bool Sass::SimpleSelector::operator==(const Sass::ComplexSelector&) const’ was hidden [-Woverloaded-virtual=] 136 | virtual bool operator==(const ComplexSelector& rhs) const; | ^~~~~~~~ src/ast_def_macros.hpp:109:16: note: by ‘Sass::IDSelector::operator==’ 109 | virtual bool operator==(const klass& rhs) const; \ | ^~~~~~~~ src/ast_selectors.hpp:204:5: note: in expansion of macro ‘ATTACH_CMP_OPERATIONS’ 204 | ATTACH_CMP_OPERATIONS(IDSelector) | ^~~~~~~~~~~~~~~~~~~~~ src/ast_selectors.hpp:135:18: warning: ‘virtual bool Sass::SimpleSelector::operator==(const Sass::SelectorList&) const’ was hidden [-Woverloaded-virtual=] 135 | virtual bool operator==(const SelectorList& rhs) const; | ^~~~~~~~ src/ast_def_macros.hpp:109:16: note: by ‘Sass::IDSelector::operator==’ 109 | virtual bool operator==(const klass& rhs) const; \ | ^~~~~~~~ src/ast_selectors.hpp:204:5: note: in expansion of macro ‘ATTACH_CMP_OPERATIONS’ 204 | ATTACH_CMP_OPERATIONS(IDSelector) | ^~~~~~~~~~~~~~~~~~~~~ src/ast_selectors.hpp:133:10: warning: ‘virtual bool Sass::SimpleSelector::operator==(const Sass::Selector&) const’ was hidden [-Woverloaded-virtual=] 133 | bool operator==(const Selector& rhs) const final override; | ^~~~~~~~ src/ast_def_macros.hpp:109:16: note: by ‘Sass::IDSelector::operator==’ 109 | virtual bool operator==(const klass& rhs) const; \ | ^~~~~~~~ src/ast_selectors.hpp:204:5: note: in expansion of macro ‘ATTACH_CMP_OPERATIONS’ 204 | ATTACH_CMP_OPERATIONS(IDSelector) | ^~~~~~~~~~~~~~~~~~~~~ src/ast_def_macros.hpp:106:16: warning: ‘virtual bool Sass::SimpleSelector::operator!=(const Sass::SimpleSelector&) const’ was hidden [-Woverloaded-virtual=] 106 | virtual bool operator!=(const klass& rhs) const { return !(*this == rhs); }; \ | ^~~~~~~~ src/ast_selectors.hpp:139:5: note: in expansion of macro ‘ATTACH_VIRTUAL_CMP_OPERATIONS’ 139 | ATTACH_VIRTUAL_CMP_OPERATIONS(SimpleSelector); | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~ src/ast_def_macros.hpp:110:16: note: by ‘virtual bool Sass::IDSelector::operator!=(const Sass::IDSelector&) const’ 110 | virtual bool operator!=(const klass& rhs) const { return !(*this == rhs); }; \ | ^~~~~~~~ src/ast_selectors.hpp:204:5: note: in expansion of macro ‘ATTACH_CMP_OPERATIONS’ 204 | ATTACH_CMP_OPERATIONS(IDSelector) | ^~~~~~~~~~~~~~~~~~~~~ src/ast_selectors.hpp:137:18: warning: ‘virtual bool Sass::SimpleSelector::operator==(const Sass::CompoundSelector&) const’ was hidden [-Woverloaded-virtual=] 137 | virtual bool operator==(const CompoundSelector& rhs) const; | ^~~~~~~~ src/ast_def_macros.hpp:109:16: note: by ‘Sass::AttributeSelector::operator==’ 109 | virtual bool operator==(const klass& rhs) const; \ | ^~~~~~~~ src/ast_selectors.hpp:223:5: note: in expansion of macro ‘ATTACH_CMP_OPERATIONS’ 223 | ATTACH_CMP_OPERATIONS(AttributeSelector) | ^~~~~~~~~~~~~~~~~~~~~ src/ast_selectors.hpp:136:18: warning: ‘virtual bool Sass::SimpleSelector::operator==(const Sass::ComplexSelector&) const’ was hidden [-Woverloaded-virtual=] 136 | virtual bool operator==(const ComplexSelector& rhs) const; | ^~~~~~~~ src/ast_def_macros.hpp:109:16: note: by ‘Sass::AttributeSelector::operator==’ 109 | virtual bool operator==(const klass& rhs) const; \ | ^~~~~~~~ src/ast_selectors.hpp:223:5: note: in expansion of macro ‘ATTACH_CMP_OPERATIONS’ 223 | ATTACH_CMP_OPERATIONS(AttributeSelector) | ^~~~~~~~~~~~~~~~~~~~~ src/ast_selectors.hpp:135:18: warning: ‘virtual bool Sass::SimpleSelector::operator==(const Sass::SelectorList&) const’ was hidden [-Woverloaded-virtual=] 135 | virtual bool operator==(const SelectorList& rhs) const; | ^~~~~~~~ src/ast_def_macros.hpp:109:16: note: by ‘Sass::AttributeSelector::operator==’ 109 | virtual bool operator==(const klass& rhs) const; \ | ^~~~~~~~ src/ast_selectors.hpp:223:5: note: in expansion of macro ‘ATTACH_CMP_OPERATIONS’ 223 | ATTACH_CMP_OPERATIONS(AttributeSelector) | ^~~~~~~~~~~~~~~~~~~~~ src/ast_selectors.hpp:133:10: warning: ‘virtual bool Sass::SimpleSelector::operator==(const Sass::Selector&) const’ was hidden [-Woverloaded-virtual=] 133 | bool operator==(const Selector& rhs) const final override; | ^~~~~~~~ src/ast_def_macros.hpp:109:16: note: by ‘Sass::AttributeSelector::operator==’ 109 | virtual bool operator==(const klass& rhs) const; \ | ^~~~~~~~ src/ast_selectors.hpp:223:5: note: in expansion of macro ‘ATTACH_CMP_OPERATIONS’ 223 | ATTACH_CMP_OPERATIONS(AttributeSelector) | ^~~~~~~~~~~~~~~~~~~~~ src/ast_def_macros.hpp:106:16: warning: ‘virtual bool Sass::SimpleSelector::operator!=(const Sass::SimpleSelector&) const’ was hidden [-Woverloaded-virtual=] 106 | virtual bool operator!=(const klass& rhs) const { return !(*this == rhs); }; \ | ^~~~~~~~ src/ast_selectors.hpp:139:5: note: in expansion of macro ‘ATTACH_VIRTUAL_CMP_OPERATIONS’ 139 | ATTACH_VIRTUAL_CMP_OPERATIONS(SimpleSelector); | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~ src/ast_def_macros.hpp:110:16: note: by ‘virtual bool Sass::AttributeSelector::operator!=(const Sass::AttributeSelector&) const’ 110 | virtual bool operator!=(const klass& rhs) const { return !(*this == rhs); }; \ | ^~~~~~~~ src/ast_selectors.hpp:223:5: note: in expansion of macro ‘ATTACH_CMP_OPERATIONS’ 223 | ATTACH_CMP_OPERATIONS(AttributeSelector) | ^~~~~~~~~~~~~~~~~~~~~ src/ast_def_macros.hpp:106:16: warning: ‘virtual bool Sass::Selector::operator!=(const Sass::Selector&) const’ was hidden [-Woverloaded-virtual=] 106 | virtual bool operator!=(const klass& rhs) const { return !(*this == rhs); }; \ | ^~~~~~~~ src/ast_selectors.hpp:56:5: note: in expansion of macro ‘ATTACH_VIRTUAL_CMP_OPERATIONS’ 56 | ATTACH_VIRTUAL_CMP_OPERATIONS(Selector) | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~ src/ast_def_macros.hpp:110:16: note: by ‘virtual bool Sass::ComplexSelector::operator!=(const Sass::ComplexSelector&) const’ 110 | virtual bool operator!=(const klass& rhs) const { return !(*this == rhs); }; \ | ^~~~~~~~ src/ast_selectors.hpp:310:5: note: in expansion of macro ‘ATTACH_CMP_OPERATIONS’ 310 | ATTACH_CMP_OPERATIONS(ComplexSelector) | ^~~~~~~~~~~~~~~~~~~~~ src/ast_def_macros.hpp:106:16: warning: ‘virtual bool Sass::Selector::operator!=(const Sass::Selector&) const’ was hidden [-Woverloaded-virtual=] 106 | virtual bool operator!=(const klass& rhs) const { return !(*this == rhs); }; \ | ^~~~~~~~ src/ast_selectors.hpp:56:5: note: in expansion of macro ‘ATTACH_VIRTUAL_CMP_OPERATIONS’ 56 | ATTACH_VIRTUAL_CMP_OPERATIONS(Selector) | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~ src/ast_def_macros.hpp:106:16: note: by ‘virtual bool Sass::SelectorComponent::operator!=(const Sass::SelectorComponent&) const’ 106 | virtual bool operator!=(const klass& rhs) const { return !(*this == rhs); }; \ | ^~~~~~~~ src/ast_selectors.hpp:349:5: note: in expansion of macro ‘ATTACH_VIRTUAL_CMP_OPERATIONS’ 349 | ATTACH_VIRTUAL_CMP_OPERATIONS(SelectorComponent); | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~ src/ast_def_macros.hpp:106:16: warning: ‘virtual bool Sass::SelectorComponent::operator!=(const Sass::SelectorComponent&) const’ was hidden [-Woverloaded-virtual=] 106 | virtual bool operator!=(const klass& rhs) const { return !(*this == rhs); }; \ | ^~~~~~~~ src/ast_selectors.hpp:349:5: note: in expansion of macro ‘ATTACH_VIRTUAL_CMP_OPERATIONS’ 349 | ATTACH_VIRTUAL_CMP_OPERATIONS(SelectorComponent); | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~ src/ast_def_macros.hpp:110:16: note: by ‘virtual bool Sass::SelectorCombinator::operator!=(const Sass::SelectorCombinator&) const’ 110 | virtual bool operator!=(const klass& rhs) const { return !(*this == rhs); }; \ | ^~~~~~~~ src/ast_selectors.hpp:407:5: note: in expansion of macro ‘ATTACH_CMP_OPERATIONS’ 407 | ATTACH_CMP_OPERATIONS(SelectorCombinator) | ^~~~~~~~~~~~~~~~~~~~~ In file included from src/ast.hpp:18: src/operation.hpp:206:7: warning: ‘T Sass::Operation_CRTP::operator()(Sass::SelectorCombinator*) [with T = Sass::Expression*; D = Sass::Eval]’ was hidden [-Woverloaded-virtual=] 206 | T operator()(SelectorCombinator* x) { return static_cast(this)->fallback(x); } | ^~~~~~~~ In file included from src/expand.hpp:7, from src/bind.cpp:6: src/eval.hpp:96:17: note: by ‘Sass::Eval::operator()’ 96 | Expression* operator()(Parent_Reference*); | ^~~~~~~~ src/operation.hpp:194:7: warning: ‘T Sass::Operation_CRTP::operator()(Sass::Parameters*) [with T = Sass::Expression*; D = Sass::Eval]’ was hidden [-Woverloaded-virtual=] 194 | T operator()(Parameters* x) { return static_cast(this)->fallback(x); } | ^~~~~~~~ src/eval.hpp:96:17: note: by ‘Sass::Eval::operator()’ 96 | Expression* operator()(Parent_Reference*); | ^~~~~~~~ src/operation.hpp:193:7: warning: ‘T Sass::Operation_CRTP::operator()(Sass::Parameter*) [with T = Sass::Expression*; D = Sass::Eval]’ was hidden [-Woverloaded-virtual=] 193 | T operator()(Parameter* x) { return static_cast(this)->fallback(x); } | ^~~~~~~~ src/eval.hpp:96:17: note: by ‘Sass::Eval::operator()’ 96 | Expression* operator()(Parent_Reference*); | ^~~~~~~~ src/operation.hpp:183:7: warning: ‘T Sass::Operation_CRTP::operator()(Sass::SupportsCondition*) [with T = Sass::Expression*; D = Sass::Eval]’ was hidden [-Woverloaded-virtual=] 183 | T operator()(SupportsCondition* x) { return static_cast(this)->fallback(x); } | ^~~~~~~~ src/eval.hpp:96:17: note: by ‘Sass::Eval::operator()’ 96 | Expression* operator()(Parent_Reference*); | ^~~~~~~~ src/operation.hpp:176:7: warning: ‘T Sass::Operation_CRTP::operator()(Sass::Color*) [with T = Sass::Expression*; D = Sass::Eval]’ was hidden [-Woverloaded-virtual=] 176 | T operator()(Color* x) { return static_cast(this)->fallback(x); } | ^~~~~~~~ src/eval.hpp:96:17: note: by ‘Sass::Eval::operator()’ 96 | Expression* operator()(Parent_Reference*); | ^~~~~~~~ src/operation.hpp:173:7: warning: ‘T Sass::Operation_CRTP::operator()(Sass::Custom_Error*) [with T = Sass::Expression*; D = Sass::Eval]’ was hidden [-Woverloaded-virtual=] 173 | T operator()(Custom_Error* x) { return static_cast(this)->fallback(x); } | ^~~~~~~~ src/eval.hpp:96:17: note: by ‘Sass::Eval::operator()’ 96 | Expression* operator()(Parent_Reference*); | ^~~~~~~~ src/operation.hpp:172:7: warning: ‘T Sass::Operation_CRTP::operator()(Sass::Custom_Warning*) [with T = Sass::Expression*; D = Sass::Eval]’ was hidden [-Woverloaded-virtual=] 172 | T operator()(Custom_Warning* x) { return static_cast(this)->fallback(x); } | ^~~~~~~~ src/eval.hpp:96:17: note: by ‘Sass::Eval::operator()’ 96 | Expression* operator()(Parent_Reference*); | ^~~~~~~~ src/operation.hpp:168:7: warning: ‘T Sass::Operation_CRTP::operator()(Sass::Function*) [with T = Sass::Expression*; D = Sass::Eval]’ was hidden [-Woverloaded-virtual=] 168 | T operator()(Function* x) { return static_cast(this)->fallback(x); } | ^~~~~~~~ src/eval.hpp:96:17: note: by ‘Sass::Eval::operator()’ 96 | Expression* operator()(Parent_Reference*); | ^~~~~~~~ src/operation.hpp:163:7: warning: ‘T Sass::Operation_CRTP::operator()(Sass::Mixin_Call*) [with T = Sass::Expression*; D = Sass::Eval]’ was hidden [-Woverloaded-virtual=] 163 | T operator()(Mixin_Call* x) { return static_cast(this)->fallback(x); } | ^~~~~~~~ src/eval.hpp:96:17: note: by ‘Sass::Eval::operator()’ 96 | Expression* operator()(Parent_Reference*); | ^~~~~~~~ src/operation.hpp:162:7: warning: ‘T Sass::Operation_CRTP::operator()(Sass::Definition*) [with T = Sass::Expression*; D = Sass::Eval]’ was hidden [-Woverloaded-virtual=] 162 | T operator()(Definition* x) { return static_cast(this)->fallback(x); } | ^~~~~~~~ src/eval.hpp:96:17: note: by ‘Sass::Eval::operator()’ 96 | Expression* operator()(Parent_Reference*); | ^~~~~~~~ src/operation.hpp:161:7: warning: ‘T Sass::Operation_CRTP::operator()(Sass::ExtendRule*) [with T = Sass::Expression*; D = Sass::Eval]’ was hidden [-Woverloaded-virtual=] 161 | T operator()(ExtendRule* x) { return static_cast(this)->fallback(x); } | ^~~~~~~~ src/eval.hpp:96:17: note: by ‘Sass::Eval::operator()’ 96 | Expression* operator()(Parent_Reference*); | ^~~~~~~~ src/operation.hpp:160:7: warning: ‘T Sass::Operation_CRTP::operator()(Sass::Content*) [with T = Sass::Expression*; D = Sass::Eval]’ was hidden [-Woverloaded-virtual=] 160 | T operator()(Content* x) { return static_cast(this)->fallback(x); } | ^~~~~~~~ src/eval.hpp:96:17: note: by ‘Sass::Eval::operator()’ 96 | Expression* operator()(Parent_Reference*); | ^~~~~~~~ src/operation.hpp:150:7: warning: ‘T Sass::Operation_CRTP::operator()(Sass::Import_Stub*) [with T = Sass::Expression*; D = Sass::Eval]’ was hidden [-Woverloaded-virtual=] 150 | T operator()(Import_Stub* x) { return static_cast(this)->fallback(x); } | ^~~~~~~~ src/eval.hpp:96:17: note: by ‘Sass::Eval::operator()’ 96 | Expression* operator()(Parent_Reference*); | ^~~~~~~~ src/operation.hpp:149:7: warning: ‘T Sass::Operation_CRTP::operator()(Sass::Import*) [with T = Sass::Expression*; D = Sass::Eval]’ was hidden [-Woverloaded-virtual=] 149 | T operator()(Import* x) { return static_cast(this)->fallback(x); } | ^~~~~~~~ src/eval.hpp:96:17: note: by ‘Sass::Eval::operator()’ 96 | Expression* operator()(Parent_Reference*); | ^~~~~~~~ src/operation.hpp:147:7: warning: ‘T Sass::Operation_CRTP::operator()(Sass::Declaration*) [with T = Sass::Expression*; D = Sass::Eval]’ was hidden [-Woverloaded-virtual=] 147 | T operator()(Declaration* x) { return static_cast(this)->fallback(x); } | ^~~~~~~~ src/eval.hpp:96:17: note: by ‘Sass::Eval::operator()’ 96 | Expression* operator()(Parent_Reference*); | ^~~~~~~~ src/operation.hpp:146:7: warning: ‘T Sass::Operation_CRTP::operator()(Sass::Keyframe_Rule*) [with T = Sass::Expression*; D = Sass::Eval]’ was hidden [-Woverloaded-virtual=] 146 | T operator()(Keyframe_Rule* x) { return static_cast(this)->fallback(x); } | ^~~~~~~~ src/eval.hpp:96:17: note: by ‘Sass::Eval::operator()’ 96 | Expression* operator()(Parent_Reference*); | ^~~~~~~~ src/operation.hpp:145:7: warning: ‘T Sass::Operation_CRTP::operator()(Sass::AtRule*) [with T = Sass::Expression*; D = Sass::Eval]’ was hidden [-Woverloaded-virtual=] 145 | T operator()(AtRule* x) { return static_cast(this)->fallback(x); } | ^~~~~~~~ src/eval.hpp:96:17: note: by ‘Sass::Eval::operator()’ 96 | Expression* operator()(Parent_Reference*); | ^~~~~~~~ src/operation.hpp:144:7: warning: ‘T Sass::Operation_CRTP::operator()(Sass::AtRootRule*) [with T = Sass::Expression*; D = Sass::Eval]’ was hidden [-Woverloaded-virtual=] 144 | T operator()(AtRootRule* x) { return static_cast(this)->fallback(x); } | ^~~~~~~~ src/eval.hpp:96:17: note: by ‘Sass::Eval::operator()’ 96 | Expression* operator()(Parent_Reference*); | ^~~~~~~~ src/operation.hpp:143:7: warning: ‘T Sass::Operation_CRTP::operator()(Sass::CssMediaQuery*) [with T = Sass::Expression*; D = Sass::Eval]’ was hidden [-Woverloaded-virtual=] 143 | T operator()(CssMediaQuery* x) { return static_cast(this)->fallback(x); } | ^~~~~~~~ src/eval.hpp:96:17: note: by ‘Sass::Eval::operator()’ 96 | Expression* operator()(Parent_Reference*); | ^~~~~~~~ src/operation.hpp:142:7: warning: ‘T Sass::Operation_CRTP::operator()(Sass::CssMediaRule*) [with T = Sass::Expression*; D = Sass::Eval]’ was hidden [-Woverloaded-virtual=] 142 | T operator()(CssMediaRule* x) { return static_cast(this)->fallback(x); } | ^~~~~~~~ src/eval.hpp:96:17: note: by ‘Sass::Eval::operator()’ 96 | Expression* operator()(Parent_Reference*); | ^~~~~~~~ src/operation.hpp:141:7: warning: ‘T Sass::Operation_CRTP::operator()(Sass::MediaRule*) [with T = Sass::Expression*; D = Sass::Eval]’ was hidden [-Woverloaded-virtual=] 141 | T operator()(MediaRule* x) { return static_cast(this)->fallback(x); } | ^~~~~~~~ src/eval.hpp:96:17: note: by ‘Sass::Eval::operator()’ 96 | Expression* operator()(Parent_Reference*); | ^~~~~~~~ src/operation.hpp:140:7: warning: ‘T Sass::Operation_CRTP::operator()(Sass::SupportsRule*) [with T = Sass::Expression*; D = Sass::Eval]’ was hidden [-Woverloaded-virtual=] 140 | T operator()(SupportsRule* x) { return static_cast(this)->fallback(x); } | ^~~~~~~~ src/eval.hpp:96:17: note: by ‘Sass::Eval::operator()’ 96 | Expression* operator()(Parent_Reference*); | ^~~~~~~~ src/operation.hpp:139:7: warning: ‘T Sass::Operation_CRTP::operator()(Sass::Trace*) [with T = Sass::Expression*; D = Sass::Eval]’ was hidden [-Woverloaded-virtual=] 139 | T operator()(Trace* x) { return static_cast(this)->fallback(x); } | ^~~~~~~~ src/eval.hpp:96:17: note: by ‘Sass::Eval::operator()’ 96 | Expression* operator()(Parent_Reference*); | ^~~~~~~~ src/operation.hpp:138:7: warning: ‘T Sass::Operation_CRTP::operator()(Sass::Bubble*) [with T = Sass::Expression*; D = Sass::Eval]’ was hidden [-Woverloaded-virtual=] 138 | T operator()(Bubble* x) { return static_cast(this)->fallback(x); } | ^~~~~~~~ src/eval.hpp:96:17: note: by ‘Sass::Eval::operator()’ 96 | Expression* operator()(Parent_Reference*); | ^~~~~~~~ src/operation.hpp:137:7: warning: ‘T Sass::Operation_CRTP::operator()(Sass::StyleRule*) [with T = Sass::Expression*; D = Sass::Eval]’ was hidden [-Woverloaded-virtual=] 137 | T operator()(StyleRule* x) { return static_cast(this)->fallback(x); } | ^~~~~~~~ src/eval.hpp:96:17: note: by ‘Sass::Eval::operator()’ 96 | Expression* operator()(Parent_Reference*); | ^~~~~~~~ src/operation.hpp:134:7: warning: ‘T Sass::Operation_CRTP::operator()(Sass::AST_Node*) [with T = Sass::Expression*; D = Sass::Eval]’ was hidden [-Woverloaded-virtual=] 134 | T operator()(AST_Node* x) { return static_cast(this)->fallback(x); } | ^~~~~~~~ src/eval.hpp:96:17: note: by ‘Sass::Eval::operator()’ 96 | Expression* operator()(Parent_Reference*); | ^~~~~~~~ g++ -std=gnu++17 -Wall -O2 -std=c++11 -I ./include -fPIC -c -o src/file.o src/file.cpp In file included from src/context.hpp:7, from src/file.cpp:21: src/ast.hpp:90:18: warning: ‘virtual bool Sass::AST_Node::operator==(const Sass::AST_Node&) const’ was hidden [-Woverloaded-virtual=] 90 | virtual bool operator== (const AST_Node& rhs) const { | ^~~~~~~~ src/ast.hpp:165:18: note: by ‘virtual bool Sass::Expression::operator==(const Sass::Expression&) const’ 165 | virtual bool operator== (const Expression& rhs) const { return false; } | ^~~~~~~~ src/ast.hpp:96:18: warning: ‘virtual bool Sass::AST_Node::operator!=(const Sass::AST_Node&) const’ was hidden [-Woverloaded-virtual=] 96 | virtual bool operator!= (const AST_Node& rhs) const { | ^~~~~~~~ src/ast.hpp:167:17: note: by ‘bool Sass::Expression::operator!=(const Sass::Expression&) const’ 167 | inline bool operator!=(const Expression& rhs) const { return !(rhs == *this); } | ^~~~~~~~ src/ast.hpp:90:18: warning: ‘virtual bool Sass::AST_Node::operator==(const Sass::AST_Node&) const’ was hidden [-Woverloaded-virtual=] 90 | virtual bool operator== (const AST_Node& rhs) const { | ^~~~~~~~ src/ast.hpp:908:10: note: by ‘bool Sass::CssMediaRule::operator==(const Sass::CssMediaRule&) const’ 908 | bool operator== (const CssMediaRule& rhs) const { | ^~~~~~~~ src/ast.hpp:96:18: warning: ‘virtual bool Sass::AST_Node::operator!=(const Sass::AST_Node&) const’ was hidden [-Woverloaded-virtual=] 96 | virtual bool operator!= (const AST_Node& rhs) const { | ^~~~~~~~ src/ast.hpp:911:10: note: by ‘bool Sass::CssMediaRule::operator!=(const Sass::CssMediaRule&) const’ 911 | bool operator!=(const CssMediaRule& rhs) const { | ^~~~~~~~ src/ast.hpp:90:18: warning: ‘virtual bool Sass::AST_Node::operator==(const Sass::AST_Node&) const’ was hidden [-Woverloaded-virtual=] 90 | virtual bool operator== (const AST_Node& rhs) const { | ^~~~~~~~ src/ast.hpp:939:10: note: by ‘bool Sass::CssMediaQuery::operator==(const Sass::CssMediaQuery&) const’ 939 | bool operator== (const CssMediaQuery& rhs) const; | ^~~~~~~~ src/ast.hpp:96:18: warning: ‘virtual bool Sass::AST_Node::operator!=(const Sass::AST_Node&) const’ was hidden [-Woverloaded-virtual=] 96 | virtual bool operator!= (const AST_Node& rhs) const { | ^~~~~~~~ src/ast.hpp:940:10: note: by ‘bool Sass::CssMediaQuery::operator!=(const Sass::CssMediaQuery&) const’ 940 | bool operator!=(const CssMediaQuery& rhs) const { | ^~~~~~~~ src/ast.hpp:165:18: warning: ‘virtual bool Sass::Expression::operator==(const Sass::Expression&) const’ was hidden [-Woverloaded-virtual=] 165 | virtual bool operator== (const Expression& rhs) const { return false; } | ^~~~~~~~ In file included from src/ast.hpp:14: src/ast_def_macros.hpp:105:16: note: by ‘virtual bool Sass::Selector::operator==(const Sass::Selector&) const’ 105 | virtual bool operator==(const klass& rhs) const = 0; \ | ^~~~~~~~ src/ast_selectors.hpp:56:5: note: in expansion of macro ‘ATTACH_VIRTUAL_CMP_OPERATIONS’ 56 | ATTACH_VIRTUAL_CMP_OPERATIONS(Selector) | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~ src/ast.hpp:96:18: warning: ‘virtual bool Sass::AST_Node::operator!=(const Sass::AST_Node&) const’ was hidden [-Woverloaded-virtual=] 96 | virtual bool operator!= (const AST_Node& rhs) const { | ^~~~~~~~ src/ast_def_macros.hpp:106:16: note: by ‘virtual bool Sass::Selector::operator!=(const Sass::Selector&) const’ 106 | virtual bool operator!=(const klass& rhs) const { return !(*this == rhs); }; \ | ^~~~~~~~ src/ast_selectors.hpp:56:5: note: in expansion of macro ‘ATTACH_VIRTUAL_CMP_OPERATIONS’ 56 | ATTACH_VIRTUAL_CMP_OPERATIONS(Selector) | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~ src/ast_def_macros.hpp:106:16: warning: ‘virtual bool Sass::Selector::operator!=(const Sass::Selector&) const’ was hidden [-Woverloaded-virtual=] 106 | virtual bool operator!=(const klass& rhs) const { return !(*this == rhs); }; \ | ^~~~~~~~ src/ast_selectors.hpp:56:5: note: in expansion of macro ‘ATTACH_VIRTUAL_CMP_OPERATIONS’ 56 | ATTACH_VIRTUAL_CMP_OPERATIONS(Selector) | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~ src/ast_def_macros.hpp:106:16: note: by ‘virtual bool Sass::SimpleSelector::operator!=(const Sass::SimpleSelector&) const’ 106 | virtual bool operator!=(const klass& rhs) const { return !(*this == rhs); }; \ | ^~~~~~~~ src/ast_selectors.hpp:139:5: note: in expansion of macro ‘ATTACH_VIRTUAL_CMP_OPERATIONS’ 139 | ATTACH_VIRTUAL_CMP_OPERATIONS(SimpleSelector); | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~ In file included from src/ast.hpp:1055: src/ast_selectors.hpp:137:18: warning: ‘virtual bool Sass::SimpleSelector::operator==(const Sass::CompoundSelector&) const’ was hidden [-Woverloaded-virtual=] 137 | virtual bool operator==(const CompoundSelector& rhs) const; | ^~~~~~~~ src/ast_def_macros.hpp:109:16: note: by ‘Sass::PlaceholderSelector::operator==’ 109 | virtual bool operator==(const klass& rhs) const; \ | ^~~~~~~~ src/ast_selectors.hpp:157:5: note: in expansion of macro ‘ATTACH_CMP_OPERATIONS’ 157 | ATTACH_CMP_OPERATIONS(PlaceholderSelector) | ^~~~~~~~~~~~~~~~~~~~~ src/ast_selectors.hpp:136:18: warning: ‘virtual bool Sass::SimpleSelector::operator==(const Sass::ComplexSelector&) const’ was hidden [-Woverloaded-virtual=] 136 | virtual bool operator==(const ComplexSelector& rhs) const; | ^~~~~~~~ src/ast_def_macros.hpp:109:16: note: by ‘Sass::PlaceholderSelector::operator==’ 109 | virtual bool operator==(const klass& rhs) const; \ | ^~~~~~~~ src/ast_selectors.hpp:157:5: note: in expansion of macro ‘ATTACH_CMP_OPERATIONS’ 157 | ATTACH_CMP_OPERATIONS(PlaceholderSelector) | ^~~~~~~~~~~~~~~~~~~~~ src/ast_selectors.hpp:135:18: warning: ‘virtual bool Sass::SimpleSelector::operator==(const Sass::SelectorList&) const’ was hidden [-Woverloaded-virtual=] 135 | virtual bool operator==(const SelectorList& rhs) const; | ^~~~~~~~ src/ast_def_macros.hpp:109:16: note: by ‘Sass::PlaceholderSelector::operator==’ 109 | virtual bool operator==(const klass& rhs) const; \ | ^~~~~~~~ src/ast_selectors.hpp:157:5: note: in expansion of macro ‘ATTACH_CMP_OPERATIONS’ 157 | ATTACH_CMP_OPERATIONS(PlaceholderSelector) | ^~~~~~~~~~~~~~~~~~~~~ src/ast_selectors.hpp:133:10: warning: ‘virtual bool Sass::SimpleSelector::operator==(const Sass::Selector&) const’ was hidden [-Woverloaded-virtual=] 133 | bool operator==(const Selector& rhs) const final override; | ^~~~~~~~ src/ast_def_macros.hpp:109:16: note: by ‘Sass::PlaceholderSelector::operator==’ 109 | virtual bool operator==(const klass& rhs) const; \ | ^~~~~~~~ src/ast_selectors.hpp:157:5: note: in expansion of macro ‘ATTACH_CMP_OPERATIONS’ 157 | ATTACH_CMP_OPERATIONS(PlaceholderSelector) | ^~~~~~~~~~~~~~~~~~~~~ src/ast_def_macros.hpp:106:16: warning: ‘virtual bool Sass::SimpleSelector::operator!=(const Sass::SimpleSelector&) const’ was hidden [-Woverloaded-virtual=] 106 | virtual bool operator!=(const klass& rhs) const { return !(*this == rhs); }; \ | ^~~~~~~~ src/ast_selectors.hpp:139:5: note: in expansion of macro ‘ATTACH_VIRTUAL_CMP_OPERATIONS’ 139 | ATTACH_VIRTUAL_CMP_OPERATIONS(SimpleSelector); | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~ src/ast_def_macros.hpp:110:16: note: by ‘virtual bool Sass::PlaceholderSelector::operator!=(const Sass::PlaceholderSelector&) const’ 110 | virtual bool operator!=(const klass& rhs) const { return !(*this == rhs); }; \ | ^~~~~~~~ src/ast_selectors.hpp:157:5: note: in expansion of macro ‘ATTACH_CMP_OPERATIONS’ 157 | ATTACH_CMP_OPERATIONS(PlaceholderSelector) | ^~~~~~~~~~~~~~~~~~~~~ src/ast_selectors.hpp:137:18: warning: ‘virtual bool Sass::SimpleSelector::operator==(const Sass::CompoundSelector&) const’ was hidden [-Woverloaded-virtual=] 137 | virtual bool operator==(const CompoundSelector& rhs) const; | ^~~~~~~~ src/ast_def_macros.hpp:109:16: note: by ‘Sass::TypeSelector::operator==’ 109 | virtual bool operator==(const klass& rhs) const; \ | ^~~~~~~~ src/ast_selectors.hpp:174:5: note: in expansion of macro ‘ATTACH_CMP_OPERATIONS’ 174 | ATTACH_CMP_OPERATIONS(TypeSelector) | ^~~~~~~~~~~~~~~~~~~~~ src/ast_selectors.hpp:136:18: warning: ‘virtual bool Sass::SimpleSelector::operator==(const Sass::ComplexSelector&) const’ was hidden [-Woverloaded-virtual=] 136 | virtual bool operator==(const ComplexSelector& rhs) const; | ^~~~~~~~ src/ast_def_macros.hpp:109:16: note: by ‘Sass::TypeSelector::operator==’ 109 | virtual bool operator==(const klass& rhs) const; \ | ^~~~~~~~ src/ast_selectors.hpp:174:5: note: in expansion of macro ‘ATTACH_CMP_OPERATIONS’ 174 | ATTACH_CMP_OPERATIONS(TypeSelector) | ^~~~~~~~~~~~~~~~~~~~~ src/ast_selectors.hpp:135:18: warning: ‘virtual bool Sass::SimpleSelector::operator==(const Sass::SelectorList&) const’ was hidden [-Woverloaded-virtual=] 135 | virtual bool operator==(const SelectorList& rhs) const; | ^~~~~~~~ src/ast_def_macros.hpp:109:16: note: by ‘Sass::TypeSelector::operator==’ 109 | virtual bool operator==(const klass& rhs) const; \ | ^~~~~~~~ src/ast_selectors.hpp:174:5: note: in expansion of macro ‘ATTACH_CMP_OPERATIONS’ 174 | ATTACH_CMP_OPERATIONS(TypeSelector) | ^~~~~~~~~~~~~~~~~~~~~ src/ast_selectors.hpp:133:10: warning: ‘virtual bool Sass::SimpleSelector::operator==(const Sass::Selector&) const’ was hidden [-Woverloaded-virtual=] 133 | bool operator==(const Selector& rhs) const final override; | ^~~~~~~~ src/ast_def_macros.hpp:109:16: note: by ‘Sass::TypeSelector::operator==’ 109 | virtual bool operator==(const klass& rhs) const; \ | ^~~~~~~~ src/ast_selectors.hpp:174:5: note: in expansion of macro ‘ATTACH_CMP_OPERATIONS’ 174 | ATTACH_CMP_OPERATIONS(TypeSelector) | ^~~~~~~~~~~~~~~~~~~~~ src/ast_def_macros.hpp:106:16: warning: ‘virtual bool Sass::SimpleSelector::operator!=(const Sass::SimpleSelector&) const’ was hidden [-Woverloaded-virtual=] 106 | virtual bool operator!=(const klass& rhs) const { return !(*this == rhs); }; \ | ^~~~~~~~ src/ast_selectors.hpp:139:5: note: in expansion of macro ‘ATTACH_VIRTUAL_CMP_OPERATIONS’ 139 | ATTACH_VIRTUAL_CMP_OPERATIONS(SimpleSelector); | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~ src/ast_def_macros.hpp:110:16: note: by ‘virtual bool Sass::TypeSelector::operator!=(const Sass::TypeSelector&) const’ 110 | virtual bool operator!=(const klass& rhs) const { return !(*this == rhs); }; \ | ^~~~~~~~ src/ast_selectors.hpp:174:5: note: in expansion of macro ‘ATTACH_CMP_OPERATIONS’ 174 | ATTACH_CMP_OPERATIONS(TypeSelector) | ^~~~~~~~~~~~~~~~~~~~~ src/ast_selectors.hpp:137:18: warning: ‘virtual bool Sass::SimpleSelector::operator==(const Sass::CompoundSelector&) const’ was hidden [-Woverloaded-virtual=] 137 | virtual bool operator==(const CompoundSelector& rhs) const; | ^~~~~~~~ src/ast_def_macros.hpp:109:16: note: by ‘Sass::ClassSelector::operator==’ 109 | virtual bool operator==(const klass& rhs) const; \ | ^~~~~~~~ src/ast_selectors.hpp:188:5: note: in expansion of macro ‘ATTACH_CMP_OPERATIONS’ 188 | ATTACH_CMP_OPERATIONS(ClassSelector) | ^~~~~~~~~~~~~~~~~~~~~ src/ast_selectors.hpp:136:18: warning: ‘virtual bool Sass::SimpleSelector::operator==(const Sass::ComplexSelector&) const’ was hidden [-Woverloaded-virtual=] 136 | virtual bool operator==(const ComplexSelector& rhs) const; | ^~~~~~~~ src/ast_def_macros.hpp:109:16: note: by ‘Sass::ClassSelector::operator==’ 109 | virtual bool operator==(const klass& rhs) const; \ | ^~~~~~~~ src/ast_selectors.hpp:188:5: note: in expansion of macro ‘ATTACH_CMP_OPERATIONS’ 188 | ATTACH_CMP_OPERATIONS(ClassSelector) | ^~~~~~~~~~~~~~~~~~~~~ src/ast_selectors.hpp:135:18: warning: ‘virtual bool Sass::SimpleSelector::operator==(const Sass::SelectorList&) const’ was hidden [-Woverloaded-virtual=] 135 | virtual bool operator==(const SelectorList& rhs) const; | ^~~~~~~~ src/ast_def_macros.hpp:109:16: note: by ‘Sass::ClassSelector::operator==’ 109 | virtual bool operator==(const klass& rhs) const; \ | ^~~~~~~~ src/ast_selectors.hpp:188:5: note: in expansion of macro ‘ATTACH_CMP_OPERATIONS’ 188 | ATTACH_CMP_OPERATIONS(ClassSelector) | ^~~~~~~~~~~~~~~~~~~~~ src/ast_selectors.hpp:133:10: warning: ‘virtual bool Sass::SimpleSelector::operator==(const Sass::Selector&) const’ was hidden [-Woverloaded-virtual=] 133 | bool operator==(const Selector& rhs) const final override; | ^~~~~~~~ src/ast_def_macros.hpp:109:16: note: by ‘Sass::ClassSelector::operator==’ 109 | virtual bool operator==(const klass& rhs) const; \ | ^~~~~~~~ src/ast_selectors.hpp:188:5: note: in expansion of macro ‘ATTACH_CMP_OPERATIONS’ 188 | ATTACH_CMP_OPERATIONS(ClassSelector) | ^~~~~~~~~~~~~~~~~~~~~ src/ast_def_macros.hpp:106:16: warning: ‘virtual bool Sass::SimpleSelector::operator!=(const Sass::SimpleSelector&) const’ was hidden [-Woverloaded-virtual=] 106 | virtual bool operator!=(const klass& rhs) const { return !(*this == rhs); }; \ | ^~~~~~~~ src/ast_selectors.hpp:139:5: note: in expansion of macro ‘ATTACH_VIRTUAL_CMP_OPERATIONS’ 139 | ATTACH_VIRTUAL_CMP_OPERATIONS(SimpleSelector); | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~ src/ast_def_macros.hpp:110:16: note: by ‘virtual bool Sass::ClassSelector::operator!=(const Sass::ClassSelector&) const’ 110 | virtual bool operator!=(const klass& rhs) const { return !(*this == rhs); }; \ | ^~~~~~~~ src/ast_selectors.hpp:188:5: note: in expansion of macro ‘ATTACH_CMP_OPERATIONS’ 188 | ATTACH_CMP_OPERATIONS(ClassSelector) | ^~~~~~~~~~~~~~~~~~~~~ src/ast_selectors.hpp:137:18: warning: ‘virtual bool Sass::SimpleSelector::operator==(const Sass::CompoundSelector&) const’ was hidden [-Woverloaded-virtual=] 137 | virtual bool operator==(const CompoundSelector& rhs) const; | ^~~~~~~~ src/ast_def_macros.hpp:109:16: note: by ‘Sass::IDSelector::operator==’ 109 | virtual bool operator==(const klass& rhs) const; \ | ^~~~~~~~ src/ast_selectors.hpp:204:5: note: in expansion of macro ‘ATTACH_CMP_OPERATIONS’ 204 | ATTACH_CMP_OPERATIONS(IDSelector) | ^~~~~~~~~~~~~~~~~~~~~ src/ast_selectors.hpp:136:18: warning: ‘virtual bool Sass::SimpleSelector::operator==(const Sass::ComplexSelector&) const’ was hidden [-Woverloaded-virtual=] 136 | virtual bool operator==(const ComplexSelector& rhs) const; | ^~~~~~~~ src/ast_def_macros.hpp:109:16: note: by ‘Sass::IDSelector::operator==’ 109 | virtual bool operator==(const klass& rhs) const; \ | ^~~~~~~~ src/ast_selectors.hpp:204:5: note: in expansion of macro ‘ATTACH_CMP_OPERATIONS’ 204 | ATTACH_CMP_OPERATIONS(IDSelector) | ^~~~~~~~~~~~~~~~~~~~~ src/ast_selectors.hpp:135:18: warning: ‘virtual bool Sass::SimpleSelector::operator==(const Sass::SelectorList&) const’ was hidden [-Woverloaded-virtual=] 135 | virtual bool operator==(const SelectorList& rhs) const; | ^~~~~~~~ src/ast_def_macros.hpp:109:16: note: by ‘Sass::IDSelector::operator==’ 109 | virtual bool operator==(const klass& rhs) const; \ | ^~~~~~~~ src/ast_selectors.hpp:204:5: note: in expansion of macro ‘ATTACH_CMP_OPERATIONS’ 204 | ATTACH_CMP_OPERATIONS(IDSelector) | ^~~~~~~~~~~~~~~~~~~~~ src/ast_selectors.hpp:133:10: warning: ‘virtual bool Sass::SimpleSelector::operator==(const Sass::Selector&) const’ was hidden [-Woverloaded-virtual=] 133 | bool operator==(const Selector& rhs) const final override; | ^~~~~~~~ src/ast_def_macros.hpp:109:16: note: by ‘Sass::IDSelector::operator==’ 109 | virtual bool operator==(const klass& rhs) const; \ | ^~~~~~~~ src/ast_selectors.hpp:204:5: note: in expansion of macro ‘ATTACH_CMP_OPERATIONS’ 204 | ATTACH_CMP_OPERATIONS(IDSelector) | ^~~~~~~~~~~~~~~~~~~~~ src/ast_def_macros.hpp:106:16: warning: ‘virtual bool Sass::SimpleSelector::operator!=(const Sass::SimpleSelector&) const’ was hidden [-Woverloaded-virtual=] 106 | virtual bool operator!=(const klass& rhs) const { return !(*this == rhs); }; \ | ^~~~~~~~ src/ast_selectors.hpp:139:5: note: in expansion of macro ‘ATTACH_VIRTUAL_CMP_OPERATIONS’ 139 | ATTACH_VIRTUAL_CMP_OPERATIONS(SimpleSelector); | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~ src/ast_def_macros.hpp:110:16: note: by ‘virtual bool Sass::IDSelector::operator!=(const Sass::IDSelector&) const’ 110 | virtual bool operator!=(const klass& rhs) const { return !(*this == rhs); }; \ | ^~~~~~~~ src/ast_selectors.hpp:204:5: note: in expansion of macro ‘ATTACH_CMP_OPERATIONS’ 204 | ATTACH_CMP_OPERATIONS(IDSelector) | ^~~~~~~~~~~~~~~~~~~~~ src/ast_selectors.hpp:137:18: warning: ‘virtual bool Sass::SimpleSelector::operator==(const Sass::CompoundSelector&) const’ was hidden [-Woverloaded-virtual=] 137 | virtual bool operator==(const CompoundSelector& rhs) const; | ^~~~~~~~ src/ast_def_macros.hpp:109:16: note: by ‘Sass::AttributeSelector::operator==’ 109 | virtual bool operator==(const klass& rhs) const; \ | ^~~~~~~~ src/ast_selectors.hpp:223:5: note: in expansion of macro ‘ATTACH_CMP_OPERATIONS’ 223 | ATTACH_CMP_OPERATIONS(AttributeSelector) | ^~~~~~~~~~~~~~~~~~~~~ src/ast_selectors.hpp:136:18: warning: ‘virtual bool Sass::SimpleSelector::operator==(const Sass::ComplexSelector&) const’ was hidden [-Woverloaded-virtual=] 136 | virtual bool operator==(const ComplexSelector& rhs) const; | ^~~~~~~~ src/ast_def_macros.hpp:109:16: note: by ‘Sass::AttributeSelector::operator==’ 109 | virtual bool operator==(const klass& rhs) const; \ | ^~~~~~~~ src/ast_selectors.hpp:223:5: note: in expansion of macro ‘ATTACH_CMP_OPERATIONS’ 223 | ATTACH_CMP_OPERATIONS(AttributeSelector) | ^~~~~~~~~~~~~~~~~~~~~ src/ast_selectors.hpp:135:18: warning: ‘virtual bool Sass::SimpleSelector::operator==(const Sass::SelectorList&) const’ was hidden [-Woverloaded-virtual=] 135 | virtual bool operator==(const SelectorList& rhs) const; | ^~~~~~~~ src/ast_def_macros.hpp:109:16: note: by ‘Sass::AttributeSelector::operator==’ 109 | virtual bool operator==(const klass& rhs) const; \ | ^~~~~~~~ src/ast_selectors.hpp:223:5: note: in expansion of macro ‘ATTACH_CMP_OPERATIONS’ 223 | ATTACH_CMP_OPERATIONS(AttributeSelector) | ^~~~~~~~~~~~~~~~~~~~~ src/ast_selectors.hpp:133:10: warning: ‘virtual bool Sass::SimpleSelector::operator==(const Sass::Selector&) const’ was hidden [-Woverloaded-virtual=] 133 | bool operator==(const Selector& rhs) const final override; | ^~~~~~~~ src/ast_def_macros.hpp:109:16: note: by ‘Sass::AttributeSelector::operator==’ 109 | virtual bool operator==(const klass& rhs) const; \ | ^~~~~~~~ src/ast_selectors.hpp:223:5: note: in expansion of macro ‘ATTACH_CMP_OPERATIONS’ 223 | ATTACH_CMP_OPERATIONS(AttributeSelector) | ^~~~~~~~~~~~~~~~~~~~~ src/ast_def_macros.hpp:106:16: warning: ‘virtual bool Sass::SimpleSelector::operator!=(const Sass::SimpleSelector&) const’ was hidden [-Woverloaded-virtual=] 106 | virtual bool operator!=(const klass& rhs) const { return !(*this == rhs); }; \ | ^~~~~~~~ src/ast_selectors.hpp:139:5: note: in expansion of macro ‘ATTACH_VIRTUAL_CMP_OPERATIONS’ 139 | ATTACH_VIRTUAL_CMP_OPERATIONS(SimpleSelector); | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~ src/ast_def_macros.hpp:110:16: note: by ‘virtual bool Sass::AttributeSelector::operator!=(const Sass::AttributeSelector&) const’ 110 | virtual bool operator!=(const klass& rhs) const { return !(*this == rhs); }; \ | ^~~~~~~~ src/ast_selectors.hpp:223:5: note: in expansion of macro ‘ATTACH_CMP_OPERATIONS’ 223 | ATTACH_CMP_OPERATIONS(AttributeSelector) | ^~~~~~~~~~~~~~~~~~~~~ src/ast_def_macros.hpp:106:16: warning: ‘virtual bool Sass::Selector::operator!=(const Sass::Selector&) const’ was hidden [-Woverloaded-virtual=] 106 | virtual bool operator!=(const klass& rhs) const { return !(*this == rhs); }; \ | ^~~~~~~~ src/ast_selectors.hpp:56:5: note: in expansion of macro ‘ATTACH_VIRTUAL_CMP_OPERATIONS’ 56 | ATTACH_VIRTUAL_CMP_OPERATIONS(Selector) | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~ src/ast_def_macros.hpp:110:16: note: by ‘virtual bool Sass::ComplexSelector::operator!=(const Sass::ComplexSelector&) const’ 110 | virtual bool operator!=(const klass& rhs) const { return !(*this == rhs); }; \ | ^~~~~~~~ src/ast_selectors.hpp:310:5: note: in expansion of macro ‘ATTACH_CMP_OPERATIONS’ 310 | ATTACH_CMP_OPERATIONS(ComplexSelector) | ^~~~~~~~~~~~~~~~~~~~~ src/ast_def_macros.hpp:106:16: warning: ‘virtual bool Sass::Selector::operator!=(const Sass::Selector&) const’ was hidden [-Woverloaded-virtual=] 106 | virtual bool operator!=(const klass& rhs) const { return !(*this == rhs); }; \ | ^~~~~~~~ src/ast_selectors.hpp:56:5: note: in expansion of macro ‘ATTACH_VIRTUAL_CMP_OPERATIONS’ 56 | ATTACH_VIRTUAL_CMP_OPERATIONS(Selector) | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~ src/ast_def_macros.hpp:106:16: note: by ‘virtual bool Sass::SelectorComponent::operator!=(const Sass::SelectorComponent&) const’ 106 | virtual bool operator!=(const klass& rhs) const { return !(*this == rhs); }; \ | ^~~~~~~~ src/ast_selectors.hpp:349:5: note: in expansion of macro ‘ATTACH_VIRTUAL_CMP_OPERATIONS’ 349 | ATTACH_VIRTUAL_CMP_OPERATIONS(SelectorComponent); | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~ src/ast_def_macros.hpp:106:16: warning: ‘virtual bool Sass::SelectorComponent::operator!=(const Sass::SelectorComponent&) const’ was hidden [-Woverloaded-virtual=] 106 | virtual bool operator!=(const klass& rhs) const { return !(*this == rhs); }; \ | ^~~~~~~~ src/ast_selectors.hpp:349:5: note: in expansion of macro ‘ATTACH_VIRTUAL_CMP_OPERATIONS’ 349 | ATTACH_VIRTUAL_CMP_OPERATIONS(SelectorComponent); | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~ src/ast_def_macros.hpp:110:16: note: by ‘virtual bool Sass::SelectorCombinator::operator!=(const Sass::SelectorCombinator&) const’ 110 | virtual bool operator!=(const klass& rhs) const { return !(*this == rhs); }; \ | ^~~~~~~~ src/ast_selectors.hpp:407:5: note: in expansion of macro ‘ATTACH_CMP_OPERATIONS’ 407 | ATTACH_CMP_OPERATIONS(SelectorCombinator) | ^~~~~~~~~~~~~~~~~~~~~ g++ -std=gnu++17 -Wall -O2 -std=c++11 -I ./include -fPIC -c -o src/util.o src/util.cpp In file included from src/util.cpp:3: src/ast.hpp:90:18: warning: ‘virtual bool Sass::AST_Node::operator==(const Sass::AST_Node&) const’ was hidden [-Woverloaded-virtual=] 90 | virtual bool operator== (const AST_Node& rhs) const { | ^~~~~~~~ src/ast.hpp:165:18: note: by ‘virtual bool Sass::Expression::operator==(const Sass::Expression&) const’ 165 | virtual bool operator== (const Expression& rhs) const { return false; } | ^~~~~~~~ src/ast.hpp:96:18: warning: ‘virtual bool Sass::AST_Node::operator!=(const Sass::AST_Node&) const’ was hidden [-Woverloaded-virtual=] 96 | virtual bool operator!= (const AST_Node& rhs) const { | ^~~~~~~~ src/ast.hpp:167:17: note: by ‘bool Sass::Expression::operator!=(const Sass::Expression&) const’ 167 | inline bool operator!=(const Expression& rhs) const { return !(rhs == *this); } | ^~~~~~~~ src/ast.hpp:90:18: warning: ‘virtual bool Sass::AST_Node::operator==(const Sass::AST_Node&) const’ was hidden [-Woverloaded-virtual=] 90 | virtual bool operator== (const AST_Node& rhs) const { | ^~~~~~~~ src/ast.hpp:908:10: note: by ‘bool Sass::CssMediaRule::operator==(const Sass::CssMediaRule&) const’ 908 | bool operator== (const CssMediaRule& rhs) const { | ^~~~~~~~ src/ast.hpp:96:18: warning: ‘virtual bool Sass::AST_Node::operator!=(const Sass::AST_Node&) const’ was hidden [-Woverloaded-virtual=] 96 | virtual bool operator!= (const AST_Node& rhs) const { | ^~~~~~~~ src/ast.hpp:911:10: note: by ‘bool Sass::CssMediaRule::operator!=(const Sass::CssMediaRule&) const’ 911 | bool operator!=(const CssMediaRule& rhs) const { | ^~~~~~~~ src/ast.hpp:90:18: warning: ‘virtual bool Sass::AST_Node::operator==(const Sass::AST_Node&) const’ was hidden [-Woverloaded-virtual=] 90 | virtual bool operator== (const AST_Node& rhs) const { | ^~~~~~~~ src/ast.hpp:939:10: note: by ‘bool Sass::CssMediaQuery::operator==(const Sass::CssMediaQuery&) const’ 939 | bool operator== (const CssMediaQuery& rhs) const; | ^~~~~~~~ src/ast.hpp:96:18: warning: ‘virtual bool Sass::AST_Node::operator!=(const Sass::AST_Node&) const’ was hidden [-Woverloaded-virtual=] 96 | virtual bool operator!= (const AST_Node& rhs) const { | ^~~~~~~~ src/ast.hpp:940:10: note: by ‘bool Sass::CssMediaQuery::operator!=(const Sass::CssMediaQuery&) const’ 940 | bool operator!=(const CssMediaQuery& rhs) const { | ^~~~~~~~ src/ast.hpp:165:18: warning: ‘virtual bool Sass::Expression::operator==(const Sass::Expression&) const’ was hidden [-Woverloaded-virtual=] 165 | virtual bool operator== (const Expression& rhs) const { return false; } | ^~~~~~~~ In file included from src/ast.hpp:14: src/ast_def_macros.hpp:105:16: note: by ‘virtual bool Sass::Selector::operator==(const Sass::Selector&) const’ 105 | virtual bool operator==(const klass& rhs) const = 0; \ | ^~~~~~~~ src/ast_selectors.hpp:56:5: note: in expansion of macro ‘ATTACH_VIRTUAL_CMP_OPERATIONS’ 56 | ATTACH_VIRTUAL_CMP_OPERATIONS(Selector) | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~ src/ast.hpp:96:18: warning: ‘virtual bool Sass::AST_Node::operator!=(const Sass::AST_Node&) const’ was hidden [-Woverloaded-virtual=] 96 | virtual bool operator!= (const AST_Node& rhs) const { | ^~~~~~~~ src/ast_def_macros.hpp:106:16: note: by ‘virtual bool Sass::Selector::operator!=(const Sass::Selector&) const’ 106 | virtual bool operator!=(const klass& rhs) const { return !(*this == rhs); }; \ | ^~~~~~~~ src/ast_selectors.hpp:56:5: note: in expansion of macro ‘ATTACH_VIRTUAL_CMP_OPERATIONS’ 56 | ATTACH_VIRTUAL_CMP_OPERATIONS(Selector) | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~ src/ast_def_macros.hpp:106:16: warning: ‘virtual bool Sass::Selector::operator!=(const Sass::Selector&) const’ was hidden [-Woverloaded-virtual=] 106 | virtual bool operator!=(const klass& rhs) const { return !(*this == rhs); }; \ | ^~~~~~~~ src/ast_selectors.hpp:56:5: note: in expansion of macro ‘ATTACH_VIRTUAL_CMP_OPERATIONS’ 56 | ATTACH_VIRTUAL_CMP_OPERATIONS(Selector) | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~ src/ast_def_macros.hpp:106:16: note: by ‘virtual bool Sass::SimpleSelector::operator!=(const Sass::SimpleSelector&) const’ 106 | virtual bool operator!=(const klass& rhs) const { return !(*this == rhs); }; \ | ^~~~~~~~ src/ast_selectors.hpp:139:5: note: in expansion of macro ‘ATTACH_VIRTUAL_CMP_OPERATIONS’ 139 | ATTACH_VIRTUAL_CMP_OPERATIONS(SimpleSelector); | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~ In file included from src/ast.hpp:1055: src/ast_selectors.hpp:137:18: warning: ‘virtual bool Sass::SimpleSelector::operator==(const Sass::CompoundSelector&) const’ was hidden [-Woverloaded-virtual=] 137 | virtual bool operator==(const CompoundSelector& rhs) const; | ^~~~~~~~ src/ast_def_macros.hpp:109:16: note: by ‘Sass::PlaceholderSelector::operator==’ 109 | virtual bool operator==(const klass& rhs) const; \ | ^~~~~~~~ src/ast_selectors.hpp:157:5: note: in expansion of macro ‘ATTACH_CMP_OPERATIONS’ 157 | ATTACH_CMP_OPERATIONS(PlaceholderSelector) | ^~~~~~~~~~~~~~~~~~~~~ src/ast_selectors.hpp:136:18: warning: ‘virtual bool Sass::SimpleSelector::operator==(const Sass::ComplexSelector&) const’ was hidden [-Woverloaded-virtual=] 136 | virtual bool operator==(const ComplexSelector& rhs) const; | ^~~~~~~~ src/ast_def_macros.hpp:109:16: note: by ‘Sass::PlaceholderSelector::operator==’ 109 | virtual bool operator==(const klass& rhs) const; \ | ^~~~~~~~ src/ast_selectors.hpp:157:5: note: in expansion of macro ‘ATTACH_CMP_OPERATIONS’ 157 | ATTACH_CMP_OPERATIONS(PlaceholderSelector) | ^~~~~~~~~~~~~~~~~~~~~ src/ast_selectors.hpp:135:18: warning: ‘virtual bool Sass::SimpleSelector::operator==(const Sass::SelectorList&) const’ was hidden [-Woverloaded-virtual=] 135 | virtual bool operator==(const SelectorList& rhs) const; | ^~~~~~~~ src/ast_def_macros.hpp:109:16: note: by ‘Sass::PlaceholderSelector::operator==’ 109 | virtual bool operator==(const klass& rhs) const; \ | ^~~~~~~~ src/ast_selectors.hpp:157:5: note: in expansion of macro ‘ATTACH_CMP_OPERATIONS’ 157 | ATTACH_CMP_OPERATIONS(PlaceholderSelector) | ^~~~~~~~~~~~~~~~~~~~~ src/ast_selectors.hpp:133:10: warning: ‘virtual bool Sass::SimpleSelector::operator==(const Sass::Selector&) const’ was hidden [-Woverloaded-virtual=] 133 | bool operator==(const Selector& rhs) const final override; | ^~~~~~~~ src/ast_def_macros.hpp:109:16: note: by ‘Sass::PlaceholderSelector::operator==’ 109 | virtual bool operator==(const klass& rhs) const; \ | ^~~~~~~~ src/ast_selectors.hpp:157:5: note: in expansion of macro ‘ATTACH_CMP_OPERATIONS’ 157 | ATTACH_CMP_OPERATIONS(PlaceholderSelector) | ^~~~~~~~~~~~~~~~~~~~~ src/ast_def_macros.hpp:106:16: warning: ‘virtual bool Sass::SimpleSelector::operator!=(const Sass::SimpleSelector&) const’ was hidden [-Woverloaded-virtual=] 106 | virtual bool operator!=(const klass& rhs) const { return !(*this == rhs); }; \ | ^~~~~~~~ src/ast_selectors.hpp:139:5: note: in expansion of macro ‘ATTACH_VIRTUAL_CMP_OPERATIONS’ 139 | ATTACH_VIRTUAL_CMP_OPERATIONS(SimpleSelector); | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~ src/ast_def_macros.hpp:110:16: note: by ‘virtual bool Sass::PlaceholderSelector::operator!=(const Sass::PlaceholderSelector&) const’ 110 | virtual bool operator!=(const klass& rhs) const { return !(*this == rhs); }; \ | ^~~~~~~~ src/ast_selectors.hpp:157:5: note: in expansion of macro ‘ATTACH_CMP_OPERATIONS’ 157 | ATTACH_CMP_OPERATIONS(PlaceholderSelector) | ^~~~~~~~~~~~~~~~~~~~~ src/ast_selectors.hpp:137:18: warning: ‘virtual bool Sass::SimpleSelector::operator==(const Sass::CompoundSelector&) const’ was hidden [-Woverloaded-virtual=] 137 | virtual bool operator==(const CompoundSelector& rhs) const; | ^~~~~~~~ src/ast_def_macros.hpp:109:16: note: by ‘Sass::TypeSelector::operator==’ 109 | virtual bool operator==(const klass& rhs) const; \ | ^~~~~~~~ src/ast_selectors.hpp:174:5: note: in expansion of macro ‘ATTACH_CMP_OPERATIONS’ 174 | ATTACH_CMP_OPERATIONS(TypeSelector) | ^~~~~~~~~~~~~~~~~~~~~ src/ast_selectors.hpp:136:18: warning: ‘virtual bool Sass::SimpleSelector::operator==(const Sass::ComplexSelector&) const’ was hidden [-Woverloaded-virtual=] 136 | virtual bool operator==(const ComplexSelector& rhs) const; | ^~~~~~~~ src/ast_def_macros.hpp:109:16: note: by ‘Sass::TypeSelector::operator==’ 109 | virtual bool operator==(const klass& rhs) const; \ | ^~~~~~~~ src/ast_selectors.hpp:174:5: note: in expansion of macro ‘ATTACH_CMP_OPERATIONS’ 174 | ATTACH_CMP_OPERATIONS(TypeSelector) | ^~~~~~~~~~~~~~~~~~~~~ src/ast_selectors.hpp:135:18: warning: ‘virtual bool Sass::SimpleSelector::operator==(const Sass::SelectorList&) const’ was hidden [-Woverloaded-virtual=] 135 | virtual bool operator==(const SelectorList& rhs) const; | ^~~~~~~~ src/ast_def_macros.hpp:109:16: note: by ‘Sass::TypeSelector::operator==’ 109 | virtual bool operator==(const klass& rhs) const; \ | ^~~~~~~~ src/ast_selectors.hpp:174:5: note: in expansion of macro ‘ATTACH_CMP_OPERATIONS’ 174 | ATTACH_CMP_OPERATIONS(TypeSelector) | ^~~~~~~~~~~~~~~~~~~~~ src/ast_selectors.hpp:133:10: warning: ‘virtual bool Sass::SimpleSelector::operator==(const Sass::Selector&) const’ was hidden [-Woverloaded-virtual=] 133 | bool operator==(const Selector& rhs) const final override; | ^~~~~~~~ src/ast_def_macros.hpp:109:16: note: by ‘Sass::TypeSelector::operator==’ 109 | virtual bool operator==(const klass& rhs) const; \ | ^~~~~~~~ src/ast_selectors.hpp:174:5: note: in expansion of macro ‘ATTACH_CMP_OPERATIONS’ 174 | ATTACH_CMP_OPERATIONS(TypeSelector) | ^~~~~~~~~~~~~~~~~~~~~ src/ast_def_macros.hpp:106:16: warning: ‘virtual bool Sass::SimpleSelector::operator!=(const Sass::SimpleSelector&) const’ was hidden [-Woverloaded-virtual=] 106 | virtual bool operator!=(const klass& rhs) const { return !(*this == rhs); }; \ | ^~~~~~~~ src/ast_selectors.hpp:139:5: note: in expansion of macro ‘ATTACH_VIRTUAL_CMP_OPERATIONS’ 139 | ATTACH_VIRTUAL_CMP_OPERATIONS(SimpleSelector); | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~ src/ast_def_macros.hpp:110:16: note: by ‘virtual bool Sass::TypeSelector::operator!=(const Sass::TypeSelector&) const’ 110 | virtual bool operator!=(const klass& rhs) const { return !(*this == rhs); }; \ | ^~~~~~~~ src/ast_selectors.hpp:174:5: note: in expansion of macro ‘ATTACH_CMP_OPERATIONS’ 174 | ATTACH_CMP_OPERATIONS(TypeSelector) | ^~~~~~~~~~~~~~~~~~~~~ src/ast_selectors.hpp:137:18: warning: ‘virtual bool Sass::SimpleSelector::operator==(const Sass::CompoundSelector&) const’ was hidden [-Woverloaded-virtual=] 137 | virtual bool operator==(const CompoundSelector& rhs) const; | ^~~~~~~~ src/ast_def_macros.hpp:109:16: note: by ‘Sass::ClassSelector::operator==’ 109 | virtual bool operator==(const klass& rhs) const; \ | ^~~~~~~~ src/ast_selectors.hpp:188:5: note: in expansion of macro ‘ATTACH_CMP_OPERATIONS’ 188 | ATTACH_CMP_OPERATIONS(ClassSelector) | ^~~~~~~~~~~~~~~~~~~~~ src/ast_selectors.hpp:136:18: warning: ‘virtual bool Sass::SimpleSelector::operator==(const Sass::ComplexSelector&) const’ was hidden [-Woverloaded-virtual=] 136 | virtual bool operator==(const ComplexSelector& rhs) const; | ^~~~~~~~ src/ast_def_macros.hpp:109:16: note: by ‘Sass::ClassSelector::operator==’ 109 | virtual bool operator==(const klass& rhs) const; \ | ^~~~~~~~ src/ast_selectors.hpp:188:5: note: in expansion of macro ‘ATTACH_CMP_OPERATIONS’ 188 | ATTACH_CMP_OPERATIONS(ClassSelector) | ^~~~~~~~~~~~~~~~~~~~~ src/ast_selectors.hpp:135:18: warning: ‘virtual bool Sass::SimpleSelector::operator==(const Sass::SelectorList&) const’ was hidden [-Woverloaded-virtual=] 135 | virtual bool operator==(const SelectorList& rhs) const; | ^~~~~~~~ src/ast_def_macros.hpp:109:16: note: by ‘Sass::ClassSelector::operator==’ 109 | virtual bool operator==(const klass& rhs) const; \ | ^~~~~~~~ src/ast_selectors.hpp:188:5: note: in expansion of macro ‘ATTACH_CMP_OPERATIONS’ 188 | ATTACH_CMP_OPERATIONS(ClassSelector) | ^~~~~~~~~~~~~~~~~~~~~ src/ast_selectors.hpp:133:10: warning: ‘virtual bool Sass::SimpleSelector::operator==(const Sass::Selector&) const’ was hidden [-Woverloaded-virtual=] 133 | bool operator==(const Selector& rhs) const final override; | ^~~~~~~~ src/ast_def_macros.hpp:109:16: note: by ‘Sass::ClassSelector::operator==’ 109 | virtual bool operator==(const klass& rhs) const; \ | ^~~~~~~~ src/ast_selectors.hpp:188:5: note: in expansion of macro ‘ATTACH_CMP_OPERATIONS’ 188 | ATTACH_CMP_OPERATIONS(ClassSelector) | ^~~~~~~~~~~~~~~~~~~~~ src/ast_def_macros.hpp:106:16: warning: ‘virtual bool Sass::SimpleSelector::operator!=(const Sass::SimpleSelector&) const’ was hidden [-Woverloaded-virtual=] 106 | virtual bool operator!=(const klass& rhs) const { return !(*this == rhs); }; \ | ^~~~~~~~ src/ast_selectors.hpp:139:5: note: in expansion of macro ‘ATTACH_VIRTUAL_CMP_OPERATIONS’ 139 | ATTACH_VIRTUAL_CMP_OPERATIONS(SimpleSelector); | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~ src/ast_def_macros.hpp:110:16: note: by ‘virtual bool Sass::ClassSelector::operator!=(const Sass::ClassSelector&) const’ 110 | virtual bool operator!=(const klass& rhs) const { return !(*this == rhs); }; \ | ^~~~~~~~ src/ast_selectors.hpp:188:5: note: in expansion of macro ‘ATTACH_CMP_OPERATIONS’ 188 | ATTACH_CMP_OPERATIONS(ClassSelector) | ^~~~~~~~~~~~~~~~~~~~~ src/ast_selectors.hpp:137:18: warning: ‘virtual bool Sass::SimpleSelector::operator==(const Sass::CompoundSelector&) const’ was hidden [-Woverloaded-virtual=] 137 | virtual bool operator==(const CompoundSelector& rhs) const; | ^~~~~~~~ src/ast_def_macros.hpp:109:16: note: by ‘Sass::IDSelector::operator==’ 109 | virtual bool operator==(const klass& rhs) const; \ | ^~~~~~~~ src/ast_selectors.hpp:204:5: note: in expansion of macro ‘ATTACH_CMP_OPERATIONS’ 204 | ATTACH_CMP_OPERATIONS(IDSelector) | ^~~~~~~~~~~~~~~~~~~~~ src/ast_selectors.hpp:136:18: warning: ‘virtual bool Sass::SimpleSelector::operator==(const Sass::ComplexSelector&) const’ was hidden [-Woverloaded-virtual=] 136 | virtual bool operator==(const ComplexSelector& rhs) const; | ^~~~~~~~ src/ast_def_macros.hpp:109:16: note: by ‘Sass::IDSelector::operator==’ 109 | virtual bool operator==(const klass& rhs) const; \ | ^~~~~~~~ src/ast_selectors.hpp:204:5: note: in expansion of macro ‘ATTACH_CMP_OPERATIONS’ 204 | ATTACH_CMP_OPERATIONS(IDSelector) | ^~~~~~~~~~~~~~~~~~~~~ src/ast_selectors.hpp:135:18: warning: ‘virtual bool Sass::SimpleSelector::operator==(const Sass::SelectorList&) const’ was hidden [-Woverloaded-virtual=] 135 | virtual bool operator==(const SelectorList& rhs) const; | ^~~~~~~~ src/ast_def_macros.hpp:109:16: note: by ‘Sass::IDSelector::operator==’ 109 | virtual bool operator==(const klass& rhs) const; \ | ^~~~~~~~ src/ast_selectors.hpp:204:5: note: in expansion of macro ‘ATTACH_CMP_OPERATIONS’ 204 | ATTACH_CMP_OPERATIONS(IDSelector) | ^~~~~~~~~~~~~~~~~~~~~ src/ast_selectors.hpp:133:10: warning: ‘virtual bool Sass::SimpleSelector::operator==(const Sass::Selector&) const’ was hidden [-Woverloaded-virtual=] 133 | bool operator==(const Selector& rhs) const final override; | ^~~~~~~~ src/ast_def_macros.hpp:109:16: note: by ‘Sass::IDSelector::operator==’ 109 | virtual bool operator==(const klass& rhs) const; \ | ^~~~~~~~ src/ast_selectors.hpp:204:5: note: in expansion of macro ‘ATTACH_CMP_OPERATIONS’ 204 | ATTACH_CMP_OPERATIONS(IDSelector) | ^~~~~~~~~~~~~~~~~~~~~ src/ast_def_macros.hpp:106:16: warning: ‘virtual bool Sass::SimpleSelector::operator!=(const Sass::SimpleSelector&) const’ was hidden [-Woverloaded-virtual=] 106 | virtual bool operator!=(const klass& rhs) const { return !(*this == rhs); }; \ | ^~~~~~~~ src/ast_selectors.hpp:139:5: note: in expansion of macro ‘ATTACH_VIRTUAL_CMP_OPERATIONS’ 139 | ATTACH_VIRTUAL_CMP_OPERATIONS(SimpleSelector); | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~ src/ast_def_macros.hpp:110:16: note: by ‘virtual bool Sass::IDSelector::operator!=(const Sass::IDSelector&) const’ 110 | virtual bool operator!=(const klass& rhs) const { return !(*this == rhs); }; \ | ^~~~~~~~ src/ast_selectors.hpp:204:5: note: in expansion of macro ‘ATTACH_CMP_OPERATIONS’ 204 | ATTACH_CMP_OPERATIONS(IDSelector) | ^~~~~~~~~~~~~~~~~~~~~ src/ast_selectors.hpp:137:18: warning: ‘virtual bool Sass::SimpleSelector::operator==(const Sass::CompoundSelector&) const’ was hidden [-Woverloaded-virtual=] 137 | virtual bool operator==(const CompoundSelector& rhs) const; | ^~~~~~~~ src/ast_def_macros.hpp:109:16: note: by ‘Sass::AttributeSelector::operator==’ 109 | virtual bool operator==(const klass& rhs) const; \ | ^~~~~~~~ src/ast_selectors.hpp:223:5: note: in expansion of macro ‘ATTACH_CMP_OPERATIONS’ 223 | ATTACH_CMP_OPERATIONS(AttributeSelector) | ^~~~~~~~~~~~~~~~~~~~~ src/ast_selectors.hpp:136:18: warning: ‘virtual bool Sass::SimpleSelector::operator==(const Sass::ComplexSelector&) const’ was hidden [-Woverloaded-virtual=] 136 | virtual bool operator==(const ComplexSelector& rhs) const; | ^~~~~~~~ src/ast_def_macros.hpp:109:16: note: by ‘Sass::AttributeSelector::operator==’ 109 | virtual bool operator==(const klass& rhs) const; \ | ^~~~~~~~ src/ast_selectors.hpp:223:5: note: in expansion of macro ‘ATTACH_CMP_OPERATIONS’ 223 | ATTACH_CMP_OPERATIONS(AttributeSelector) | ^~~~~~~~~~~~~~~~~~~~~ src/ast_selectors.hpp:135:18: warning: ‘virtual bool Sass::SimpleSelector::operator==(const Sass::SelectorList&) const’ was hidden [-Woverloaded-virtual=] 135 | virtual bool operator==(const SelectorList& rhs) const; | ^~~~~~~~ src/ast_def_macros.hpp:109:16: note: by ‘Sass::AttributeSelector::operator==’ 109 | virtual bool operator==(const klass& rhs) const; \ | ^~~~~~~~ src/ast_selectors.hpp:223:5: note: in expansion of macro ‘ATTACH_CMP_OPERATIONS’ 223 | ATTACH_CMP_OPERATIONS(AttributeSelector) | ^~~~~~~~~~~~~~~~~~~~~ src/ast_selectors.hpp:133:10: warning: ‘virtual bool Sass::SimpleSelector::operator==(const Sass::Selector&) const’ was hidden [-Woverloaded-virtual=] 133 | bool operator==(const Selector& rhs) const final override; | ^~~~~~~~ src/ast_def_macros.hpp:109:16: note: by ‘Sass::AttributeSelector::operator==’ 109 | virtual bool operator==(const klass& rhs) const; \ | ^~~~~~~~ src/ast_selectors.hpp:223:5: note: in expansion of macro ‘ATTACH_CMP_OPERATIONS’ 223 | ATTACH_CMP_OPERATIONS(AttributeSelector) | ^~~~~~~~~~~~~~~~~~~~~ src/ast_def_macros.hpp:106:16: warning: ‘virtual bool Sass::SimpleSelector::operator!=(const Sass::SimpleSelector&) const’ was hidden [-Woverloaded-virtual=] 106 | virtual bool operator!=(const klass& rhs) const { return !(*this == rhs); }; \ | ^~~~~~~~ src/ast_selectors.hpp:139:5: note: in expansion of macro ‘ATTACH_VIRTUAL_CMP_OPERATIONS’ 139 | ATTACH_VIRTUAL_CMP_OPERATIONS(SimpleSelector); | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~ src/ast_def_macros.hpp:110:16: note: by ‘virtual bool Sass::AttributeSelector::operator!=(const Sass::AttributeSelector&) const’ 110 | virtual bool operator!=(const klass& rhs) const { return !(*this == rhs); }; \ | ^~~~~~~~ src/ast_selectors.hpp:223:5: note: in expansion of macro ‘ATTACH_CMP_OPERATIONS’ 223 | ATTACH_CMP_OPERATIONS(AttributeSelector) | ^~~~~~~~~~~~~~~~~~~~~ src/ast_def_macros.hpp:106:16: warning: ‘virtual bool Sass::Selector::operator!=(const Sass::Selector&) const’ was hidden [-Woverloaded-virtual=] 106 | virtual bool operator!=(const klass& rhs) const { return !(*this == rhs); }; \ | ^~~~~~~~ src/ast_selectors.hpp:56:5: note: in expansion of macro ‘ATTACH_VIRTUAL_CMP_OPERATIONS’ 56 | ATTACH_VIRTUAL_CMP_OPERATIONS(Selector) | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~ src/ast_def_macros.hpp:110:16: note: by ‘virtual bool Sass::ComplexSelector::operator!=(const Sass::ComplexSelector&) const’ 110 | virtual bool operator!=(const klass& rhs) const { return !(*this == rhs); }; \ | ^~~~~~~~ src/ast_selectors.hpp:310:5: note: in expansion of macro ‘ATTACH_CMP_OPERATIONS’ 310 | ATTACH_CMP_OPERATIONS(ComplexSelector) | ^~~~~~~~~~~~~~~~~~~~~ src/ast_def_macros.hpp:106:16: warning: ‘virtual bool Sass::Selector::operator!=(const Sass::Selector&) const’ was hidden [-Woverloaded-virtual=] 106 | virtual bool operator!=(const klass& rhs) const { return !(*this == rhs); }; \ | ^~~~~~~~ src/ast_selectors.hpp:56:5: note: in expansion of macro ‘ATTACH_VIRTUAL_CMP_OPERATIONS’ 56 | ATTACH_VIRTUAL_CMP_OPERATIONS(Selector) | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~ src/ast_def_macros.hpp:106:16: note: by ‘virtual bool Sass::SelectorComponent::operator!=(const Sass::SelectorComponent&) const’ 106 | virtual bool operator!=(const klass& rhs) const { return !(*this == rhs); }; \ | ^~~~~~~~ src/ast_selectors.hpp:349:5: note: in expansion of macro ‘ATTACH_VIRTUAL_CMP_OPERATIONS’ 349 | ATTACH_VIRTUAL_CMP_OPERATIONS(SelectorComponent); | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~ src/ast_def_macros.hpp:106:16: warning: ‘virtual bool Sass::SelectorComponent::operator!=(const Sass::SelectorComponent&) const’ was hidden [-Woverloaded-virtual=] 106 | virtual bool operator!=(const klass& rhs) const { return !(*this == rhs); }; \ | ^~~~~~~~ src/ast_selectors.hpp:349:5: note: in expansion of macro ‘ATTACH_VIRTUAL_CMP_OPERATIONS’ 349 | ATTACH_VIRTUAL_CMP_OPERATIONS(SelectorComponent); | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~ src/ast_def_macros.hpp:110:16: note: by ‘virtual bool Sass::SelectorCombinator::operator!=(const Sass::SelectorCombinator&) const’ 110 | virtual bool operator!=(const klass& rhs) const { return !(*this == rhs); }; \ | ^~~~~~~~ src/ast_selectors.hpp:407:5: note: in expansion of macro ‘ATTACH_CMP_OPERATIONS’ 407 | ATTACH_CMP_OPERATIONS(SelectorCombinator) | ^~~~~~~~~~~~~~~~~~~~~ g++ -std=gnu++17 -Wall -O2 -std=c++11 -I ./include -fPIC -c -o src/util_string.o src/util_string.cpp g++ -std=gnu++17 -Wall -O2 -std=c++11 -I ./include -fPIC -c -o src/json.o src/json.cpp g++ -std=gnu++17 -Wall -O2 -std=c++11 -I ./include -fPIC -c -o src/units.o src/units.cpp g++ -std=gnu++17 -Wall -O2 -std=c++11 -I ./include -fPIC -c -o src/values.o src/values.cpp In file included from src/values.hpp:4, from src/values.cpp:6: src/ast.hpp:90:18: warning: ‘virtual bool Sass::AST_Node::operator==(const Sass::AST_Node&) const’ was hidden [-Woverloaded-virtual=] 90 | virtual bool operator== (const AST_Node& rhs) const { | ^~~~~~~~ src/ast.hpp:165:18: note: by ‘virtual bool Sass::Expression::operator==(const Sass::Expression&) const’ 165 | virtual bool operator== (const Expression& rhs) const { return false; } | ^~~~~~~~ src/ast.hpp:96:18: warning: ‘virtual bool Sass::AST_Node::operator!=(const Sass::AST_Node&) const’ was hidden [-Woverloaded-virtual=] 96 | virtual bool operator!= (const AST_Node& rhs) const { | ^~~~~~~~ src/ast.hpp:167:17: note: by ‘bool Sass::Expression::operator!=(const Sass::Expression&) const’ 167 | inline bool operator!=(const Expression& rhs) const { return !(rhs == *this); } | ^~~~~~~~ src/ast.hpp:90:18: warning: ‘virtual bool Sass::AST_Node::operator==(const Sass::AST_Node&) const’ was hidden [-Woverloaded-virtual=] 90 | virtual bool operator== (const AST_Node& rhs) const { | ^~~~~~~~ src/ast.hpp:908:10: note: by ‘bool Sass::CssMediaRule::operator==(const Sass::CssMediaRule&) const’ 908 | bool operator== (const CssMediaRule& rhs) const { | ^~~~~~~~ src/ast.hpp:96:18: warning: ‘virtual bool Sass::AST_Node::operator!=(const Sass::AST_Node&) const’ was hidden [-Woverloaded-virtual=] 96 | virtual bool operator!= (const AST_Node& rhs) const { | ^~~~~~~~ src/ast.hpp:911:10: note: by ‘bool Sass::CssMediaRule::operator!=(const Sass::CssMediaRule&) const’ 911 | bool operator!=(const CssMediaRule& rhs) const { | ^~~~~~~~ src/ast.hpp:90:18: warning: ‘virtual bool Sass::AST_Node::operator==(const Sass::AST_Node&) const’ was hidden [-Woverloaded-virtual=] 90 | virtual bool operator== (const AST_Node& rhs) const { | ^~~~~~~~ src/ast.hpp:939:10: note: by ‘bool Sass::CssMediaQuery::operator==(const Sass::CssMediaQuery&) const’ 939 | bool operator== (const CssMediaQuery& rhs) const; | ^~~~~~~~ src/ast.hpp:96:18: warning: ‘virtual bool Sass::AST_Node::operator!=(const Sass::AST_Node&) const’ was hidden [-Woverloaded-virtual=] 96 | virtual bool operator!= (const AST_Node& rhs) const { | ^~~~~~~~ src/ast.hpp:940:10: note: by ‘bool Sass::CssMediaQuery::operator!=(const Sass::CssMediaQuery&) const’ 940 | bool operator!=(const CssMediaQuery& rhs) const { | ^~~~~~~~ src/ast.hpp:165:18: warning: ‘virtual bool Sass::Expression::operator==(const Sass::Expression&) const’ was hidden [-Woverloaded-virtual=] 165 | virtual bool operator== (const Expression& rhs) const { return false; } | ^~~~~~~~ In file included from src/ast.hpp:14: src/ast_def_macros.hpp:105:16: note: by ‘virtual bool Sass::Selector::operator==(const Sass::Selector&) const’ 105 | virtual bool operator==(const klass& rhs) const = 0; \ | ^~~~~~~~ src/ast_selectors.hpp:56:5: note: in expansion of macro ‘ATTACH_VIRTUAL_CMP_OPERATIONS’ 56 | ATTACH_VIRTUAL_CMP_OPERATIONS(Selector) | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~ src/ast.hpp:96:18: warning: ‘virtual bool Sass::AST_Node::operator!=(const Sass::AST_Node&) const’ was hidden [-Woverloaded-virtual=] 96 | virtual bool operator!= (const AST_Node& rhs) const { | ^~~~~~~~ src/ast_def_macros.hpp:106:16: note: by ‘virtual bool Sass::Selector::operator!=(const Sass::Selector&) const’ 106 | virtual bool operator!=(const klass& rhs) const { return !(*this == rhs); }; \ | ^~~~~~~~ src/ast_selectors.hpp:56:5: note: in expansion of macro ‘ATTACH_VIRTUAL_CMP_OPERATIONS’ 56 | ATTACH_VIRTUAL_CMP_OPERATIONS(Selector) | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~ src/ast_def_macros.hpp:106:16: warning: ‘virtual bool Sass::Selector::operator!=(const Sass::Selector&) const’ was hidden [-Woverloaded-virtual=] 106 | virtual bool operator!=(const klass& rhs) const { return !(*this == rhs); }; \ | ^~~~~~~~ src/ast_selectors.hpp:56:5: note: in expansion of macro ‘ATTACH_VIRTUAL_CMP_OPERATIONS’ 56 | ATTACH_VIRTUAL_CMP_OPERATIONS(Selector) | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~ src/ast_def_macros.hpp:106:16: note: by ‘virtual bool Sass::SimpleSelector::operator!=(const Sass::SimpleSelector&) const’ 106 | virtual bool operator!=(const klass& rhs) const { return !(*this == rhs); }; \ | ^~~~~~~~ src/ast_selectors.hpp:139:5: note: in expansion of macro ‘ATTACH_VIRTUAL_CMP_OPERATIONS’ 139 | ATTACH_VIRTUAL_CMP_OPERATIONS(SimpleSelector); | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~ In file included from src/ast.hpp:1055: src/ast_selectors.hpp:137:18: warning: ‘virtual bool Sass::SimpleSelector::operator==(const Sass::CompoundSelector&) const’ was hidden [-Woverloaded-virtual=] 137 | virtual bool operator==(const CompoundSelector& rhs) const; | ^~~~~~~~ src/ast_def_macros.hpp:109:16: note: by ‘Sass::PlaceholderSelector::operator==’ 109 | virtual bool operator==(const klass& rhs) const; \ | ^~~~~~~~ src/ast_selectors.hpp:157:5: note: in expansion of macro ‘ATTACH_CMP_OPERATIONS’ 157 | ATTACH_CMP_OPERATIONS(PlaceholderSelector) | ^~~~~~~~~~~~~~~~~~~~~ src/ast_selectors.hpp:136:18: warning: ‘virtual bool Sass::SimpleSelector::operator==(const Sass::ComplexSelector&) const’ was hidden [-Woverloaded-virtual=] 136 | virtual bool operator==(const ComplexSelector& rhs) const; | ^~~~~~~~ src/ast_def_macros.hpp:109:16: note: by ‘Sass::PlaceholderSelector::operator==’ 109 | virtual bool operator==(const klass& rhs) const; \ | ^~~~~~~~ src/ast_selectors.hpp:157:5: note: in expansion of macro ‘ATTACH_CMP_OPERATIONS’ 157 | ATTACH_CMP_OPERATIONS(PlaceholderSelector) | ^~~~~~~~~~~~~~~~~~~~~ src/ast_selectors.hpp:135:18: warning: ‘virtual bool Sass::SimpleSelector::operator==(const Sass::SelectorList&) const’ was hidden [-Woverloaded-virtual=] 135 | virtual bool operator==(const SelectorList& rhs) const; | ^~~~~~~~ src/ast_def_macros.hpp:109:16: note: by ‘Sass::PlaceholderSelector::operator==’ 109 | virtual bool operator==(const klass& rhs) const; \ | ^~~~~~~~ src/ast_selectors.hpp:157:5: note: in expansion of macro ‘ATTACH_CMP_OPERATIONS’ 157 | ATTACH_CMP_OPERATIONS(PlaceholderSelector) | ^~~~~~~~~~~~~~~~~~~~~ src/ast_selectors.hpp:133:10: warning: ‘virtual bool Sass::SimpleSelector::operator==(const Sass::Selector&) const’ was hidden [-Woverloaded-virtual=] 133 | bool operator==(const Selector& rhs) const final override; | ^~~~~~~~ src/ast_def_macros.hpp:109:16: note: by ‘Sass::PlaceholderSelector::operator==’ 109 | virtual bool operator==(const klass& rhs) const; \ | ^~~~~~~~ src/ast_selectors.hpp:157:5: note: in expansion of macro ‘ATTACH_CMP_OPERATIONS’ 157 | ATTACH_CMP_OPERATIONS(PlaceholderSelector) | ^~~~~~~~~~~~~~~~~~~~~ src/ast_def_macros.hpp:106:16: warning: ‘virtual bool Sass::SimpleSelector::operator!=(const Sass::SimpleSelector&) const’ was hidden [-Woverloaded-virtual=] 106 | virtual bool operator!=(const klass& rhs) const { return !(*this == rhs); }; \ | ^~~~~~~~ src/ast_selectors.hpp:139:5: note: in expansion of macro ‘ATTACH_VIRTUAL_CMP_OPERATIONS’ 139 | ATTACH_VIRTUAL_CMP_OPERATIONS(SimpleSelector); | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~ src/ast_def_macros.hpp:110:16: note: by ‘virtual bool Sass::PlaceholderSelector::operator!=(const Sass::PlaceholderSelector&) const’ 110 | virtual bool operator!=(const klass& rhs) const { return !(*this == rhs); }; \ | ^~~~~~~~ src/ast_selectors.hpp:157:5: note: in expansion of macro ‘ATTACH_CMP_OPERATIONS’ 157 | ATTACH_CMP_OPERATIONS(PlaceholderSelector) | ^~~~~~~~~~~~~~~~~~~~~ src/ast_selectors.hpp:137:18: warning: ‘virtual bool Sass::SimpleSelector::operator==(const Sass::CompoundSelector&) const’ was hidden [-Woverloaded-virtual=] 137 | virtual bool operator==(const CompoundSelector& rhs) const; | ^~~~~~~~ src/ast_def_macros.hpp:109:16: note: by ‘Sass::TypeSelector::operator==’ 109 | virtual bool operator==(const klass& rhs) const; \ | ^~~~~~~~ src/ast_selectors.hpp:174:5: note: in expansion of macro ‘ATTACH_CMP_OPERATIONS’ 174 | ATTACH_CMP_OPERATIONS(TypeSelector) | ^~~~~~~~~~~~~~~~~~~~~ src/ast_selectors.hpp:136:18: warning: ‘virtual bool Sass::SimpleSelector::operator==(const Sass::ComplexSelector&) const’ was hidden [-Woverloaded-virtual=] 136 | virtual bool operator==(const ComplexSelector& rhs) const; | ^~~~~~~~ src/ast_def_macros.hpp:109:16: note: by ‘Sass::TypeSelector::operator==’ 109 | virtual bool operator==(const klass& rhs) const; \ | ^~~~~~~~ src/ast_selectors.hpp:174:5: note: in expansion of macro ‘ATTACH_CMP_OPERATIONS’ 174 | ATTACH_CMP_OPERATIONS(TypeSelector) | ^~~~~~~~~~~~~~~~~~~~~ src/ast_selectors.hpp:135:18: warning: ‘virtual bool Sass::SimpleSelector::operator==(const Sass::SelectorList&) const’ was hidden [-Woverloaded-virtual=] 135 | virtual bool operator==(const SelectorList& rhs) const; | ^~~~~~~~ src/ast_def_macros.hpp:109:16: note: by ‘Sass::TypeSelector::operator==’ 109 | virtual bool operator==(const klass& rhs) const; \ | ^~~~~~~~ src/ast_selectors.hpp:174:5: note: in expansion of macro ‘ATTACH_CMP_OPERATIONS’ 174 | ATTACH_CMP_OPERATIONS(TypeSelector) | ^~~~~~~~~~~~~~~~~~~~~ src/ast_selectors.hpp:133:10: warning: ‘virtual bool Sass::SimpleSelector::operator==(const Sass::Selector&) const’ was hidden [-Woverloaded-virtual=] 133 | bool operator==(const Selector& rhs) const final override; | ^~~~~~~~ src/ast_def_macros.hpp:109:16: note: by ‘Sass::TypeSelector::operator==’ 109 | virtual bool operator==(const klass& rhs) const; \ | ^~~~~~~~ src/ast_selectors.hpp:174:5: note: in expansion of macro ‘ATTACH_CMP_OPERATIONS’ 174 | ATTACH_CMP_OPERATIONS(TypeSelector) | ^~~~~~~~~~~~~~~~~~~~~ src/ast_def_macros.hpp:106:16: warning: ‘virtual bool Sass::SimpleSelector::operator!=(const Sass::SimpleSelector&) const’ was hidden [-Woverloaded-virtual=] 106 | virtual bool operator!=(const klass& rhs) const { return !(*this == rhs); }; \ | ^~~~~~~~ src/ast_selectors.hpp:139:5: note: in expansion of macro ‘ATTACH_VIRTUAL_CMP_OPERATIONS’ 139 | ATTACH_VIRTUAL_CMP_OPERATIONS(SimpleSelector); | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~ src/ast_def_macros.hpp:110:16: note: by ‘virtual bool Sass::TypeSelector::operator!=(const Sass::TypeSelector&) const’ 110 | virtual bool operator!=(const klass& rhs) const { return !(*this == rhs); }; \ | ^~~~~~~~ src/ast_selectors.hpp:174:5: note: in expansion of macro ‘ATTACH_CMP_OPERATIONS’ 174 | ATTACH_CMP_OPERATIONS(TypeSelector) | ^~~~~~~~~~~~~~~~~~~~~ src/ast_selectors.hpp:137:18: warning: ‘virtual bool Sass::SimpleSelector::operator==(const Sass::CompoundSelector&) const’ was hidden [-Woverloaded-virtual=] 137 | virtual bool operator==(const CompoundSelector& rhs) const; | ^~~~~~~~ src/ast_def_macros.hpp:109:16: note: by ‘Sass::ClassSelector::operator==’ 109 | virtual bool operator==(const klass& rhs) const; \ | ^~~~~~~~ src/ast_selectors.hpp:188:5: note: in expansion of macro ‘ATTACH_CMP_OPERATIONS’ 188 | ATTACH_CMP_OPERATIONS(ClassSelector) | ^~~~~~~~~~~~~~~~~~~~~ src/ast_selectors.hpp:136:18: warning: ‘virtual bool Sass::SimpleSelector::operator==(const Sass::ComplexSelector&) const’ was hidden [-Woverloaded-virtual=] 136 | virtual bool operator==(const ComplexSelector& rhs) const; | ^~~~~~~~ src/ast_def_macros.hpp:109:16: note: by ‘Sass::ClassSelector::operator==’ 109 | virtual bool operator==(const klass& rhs) const; \ | ^~~~~~~~ src/ast_selectors.hpp:188:5: note: in expansion of macro ‘ATTACH_CMP_OPERATIONS’ 188 | ATTACH_CMP_OPERATIONS(ClassSelector) | ^~~~~~~~~~~~~~~~~~~~~ src/ast_selectors.hpp:135:18: warning: ‘virtual bool Sass::SimpleSelector::operator==(const Sass::SelectorList&) const’ was hidden [-Woverloaded-virtual=] 135 | virtual bool operator==(const SelectorList& rhs) const; | ^~~~~~~~ src/ast_def_macros.hpp:109:16: note: by ‘Sass::ClassSelector::operator==’ 109 | virtual bool operator==(const klass& rhs) const; \ | ^~~~~~~~ src/ast_selectors.hpp:188:5: note: in expansion of macro ‘ATTACH_CMP_OPERATIONS’ 188 | ATTACH_CMP_OPERATIONS(ClassSelector) | ^~~~~~~~~~~~~~~~~~~~~ src/ast_selectors.hpp:133:10: warning: ‘virtual bool Sass::SimpleSelector::operator==(const Sass::Selector&) const’ was hidden [-Woverloaded-virtual=] 133 | bool operator==(const Selector& rhs) const final override; | ^~~~~~~~ src/ast_def_macros.hpp:109:16: note: by ‘Sass::ClassSelector::operator==’ 109 | virtual bool operator==(const klass& rhs) const; \ | ^~~~~~~~ src/ast_selectors.hpp:188:5: note: in expansion of macro ‘ATTACH_CMP_OPERATIONS’ 188 | ATTACH_CMP_OPERATIONS(ClassSelector) | ^~~~~~~~~~~~~~~~~~~~~ src/ast_def_macros.hpp:106:16: warning: ‘virtual bool Sass::SimpleSelector::operator!=(const Sass::SimpleSelector&) const’ was hidden [-Woverloaded-virtual=] 106 | virtual bool operator!=(const klass& rhs) const { return !(*this == rhs); }; \ | ^~~~~~~~ src/ast_selectors.hpp:139:5: note: in expansion of macro ‘ATTACH_VIRTUAL_CMP_OPERATIONS’ 139 | ATTACH_VIRTUAL_CMP_OPERATIONS(SimpleSelector); | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~ src/ast_def_macros.hpp:110:16: note: by ‘virtual bool Sass::ClassSelector::operator!=(const Sass::ClassSelector&) const’ 110 | virtual bool operator!=(const klass& rhs) const { return !(*this == rhs); }; \ | ^~~~~~~~ src/ast_selectors.hpp:188:5: note: in expansion of macro ‘ATTACH_CMP_OPERATIONS’ 188 | ATTACH_CMP_OPERATIONS(ClassSelector) | ^~~~~~~~~~~~~~~~~~~~~ src/ast_selectors.hpp:137:18: warning: ‘virtual bool Sass::SimpleSelector::operator==(const Sass::CompoundSelector&) const’ was hidden [-Woverloaded-virtual=] 137 | virtual bool operator==(const CompoundSelector& rhs) const; | ^~~~~~~~ src/ast_def_macros.hpp:109:16: note: by ‘Sass::IDSelector::operator==’ 109 | virtual bool operator==(const klass& rhs) const; \ | ^~~~~~~~ src/ast_selectors.hpp:204:5: note: in expansion of macro ‘ATTACH_CMP_OPERATIONS’ 204 | ATTACH_CMP_OPERATIONS(IDSelector) | ^~~~~~~~~~~~~~~~~~~~~ src/ast_selectors.hpp:136:18: warning: ‘virtual bool Sass::SimpleSelector::operator==(const Sass::ComplexSelector&) const’ was hidden [-Woverloaded-virtual=] 136 | virtual bool operator==(const ComplexSelector& rhs) const; | ^~~~~~~~ src/ast_def_macros.hpp:109:16: note: by ‘Sass::IDSelector::operator==’ 109 | virtual bool operator==(const klass& rhs) const; \ | ^~~~~~~~ src/ast_selectors.hpp:204:5: note: in expansion of macro ‘ATTACH_CMP_OPERATIONS’ 204 | ATTACH_CMP_OPERATIONS(IDSelector) | ^~~~~~~~~~~~~~~~~~~~~ src/ast_selectors.hpp:135:18: warning: ‘virtual bool Sass::SimpleSelector::operator==(const Sass::SelectorList&) const’ was hidden [-Woverloaded-virtual=] 135 | virtual bool operator==(const SelectorList& rhs) const; | ^~~~~~~~ src/ast_def_macros.hpp:109:16: note: by ‘Sass::IDSelector::operator==’ 109 | virtual bool operator==(const klass& rhs) const; \ | ^~~~~~~~ src/ast_selectors.hpp:204:5: note: in expansion of macro ‘ATTACH_CMP_OPERATIONS’ 204 | ATTACH_CMP_OPERATIONS(IDSelector) | ^~~~~~~~~~~~~~~~~~~~~ src/ast_selectors.hpp:133:10: warning: ‘virtual bool Sass::SimpleSelector::operator==(const Sass::Selector&) const’ was hidden [-Woverloaded-virtual=] 133 | bool operator==(const Selector& rhs) const final override; | ^~~~~~~~ src/ast_def_macros.hpp:109:16: note: by ‘Sass::IDSelector::operator==’ 109 | virtual bool operator==(const klass& rhs) const; \ | ^~~~~~~~ src/ast_selectors.hpp:204:5: note: in expansion of macro ‘ATTACH_CMP_OPERATIONS’ 204 | ATTACH_CMP_OPERATIONS(IDSelector) | ^~~~~~~~~~~~~~~~~~~~~ src/ast_def_macros.hpp:106:16: warning: ‘virtual bool Sass::SimpleSelector::operator!=(const Sass::SimpleSelector&) const’ was hidden [-Woverloaded-virtual=] 106 | virtual bool operator!=(const klass& rhs) const { return !(*this == rhs); }; \ | ^~~~~~~~ src/ast_selectors.hpp:139:5: note: in expansion of macro ‘ATTACH_VIRTUAL_CMP_OPERATIONS’ 139 | ATTACH_VIRTUAL_CMP_OPERATIONS(SimpleSelector); | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~ src/ast_def_macros.hpp:110:16: note: by ‘virtual bool Sass::IDSelector::operator!=(const Sass::IDSelector&) const’ 110 | virtual bool operator!=(const klass& rhs) const { return !(*this == rhs); }; \ | ^~~~~~~~ src/ast_selectors.hpp:204:5: note: in expansion of macro ‘ATTACH_CMP_OPERATIONS’ 204 | ATTACH_CMP_OPERATIONS(IDSelector) | ^~~~~~~~~~~~~~~~~~~~~ src/ast_selectors.hpp:137:18: warning: ‘virtual bool Sass::SimpleSelector::operator==(const Sass::CompoundSelector&) const’ was hidden [-Woverloaded-virtual=] 137 | virtual bool operator==(const CompoundSelector& rhs) const; | ^~~~~~~~ src/ast_def_macros.hpp:109:16: note: by ‘Sass::AttributeSelector::operator==’ 109 | virtual bool operator==(const klass& rhs) const; \ | ^~~~~~~~ src/ast_selectors.hpp:223:5: note: in expansion of macro ‘ATTACH_CMP_OPERATIONS’ 223 | ATTACH_CMP_OPERATIONS(AttributeSelector) | ^~~~~~~~~~~~~~~~~~~~~ src/ast_selectors.hpp:136:18: warning: ‘virtual bool Sass::SimpleSelector::operator==(const Sass::ComplexSelector&) const’ was hidden [-Woverloaded-virtual=] 136 | virtual bool operator==(const ComplexSelector& rhs) const; | ^~~~~~~~ src/ast_def_macros.hpp:109:16: note: by ‘Sass::AttributeSelector::operator==’ 109 | virtual bool operator==(const klass& rhs) const; \ | ^~~~~~~~ src/ast_selectors.hpp:223:5: note: in expansion of macro ‘ATTACH_CMP_OPERATIONS’ 223 | ATTACH_CMP_OPERATIONS(AttributeSelector) | ^~~~~~~~~~~~~~~~~~~~~ src/ast_selectors.hpp:135:18: warning: ‘virtual bool Sass::SimpleSelector::operator==(const Sass::SelectorList&) const’ was hidden [-Woverloaded-virtual=] 135 | virtual bool operator==(const SelectorList& rhs) const; | ^~~~~~~~ src/ast_def_macros.hpp:109:16: note: by ‘Sass::AttributeSelector::operator==’ 109 | virtual bool operator==(const klass& rhs) const; \ | ^~~~~~~~ src/ast_selectors.hpp:223:5: note: in expansion of macro ‘ATTACH_CMP_OPERATIONS’ 223 | ATTACH_CMP_OPERATIONS(AttributeSelector) | ^~~~~~~~~~~~~~~~~~~~~ src/ast_selectors.hpp:133:10: warning: ‘virtual bool Sass::SimpleSelector::operator==(const Sass::Selector&) const’ was hidden [-Woverloaded-virtual=] 133 | bool operator==(const Selector& rhs) const final override; | ^~~~~~~~ src/ast_def_macros.hpp:109:16: note: by ‘Sass::AttributeSelector::operator==’ 109 | virtual bool operator==(const klass& rhs) const; \ | ^~~~~~~~ src/ast_selectors.hpp:223:5: note: in expansion of macro ‘ATTACH_CMP_OPERATIONS’ 223 | ATTACH_CMP_OPERATIONS(AttributeSelector) | ^~~~~~~~~~~~~~~~~~~~~ src/ast_def_macros.hpp:106:16: warning: ‘virtual bool Sass::SimpleSelector::operator!=(const Sass::SimpleSelector&) const’ was hidden [-Woverloaded-virtual=] 106 | virtual bool operator!=(const klass& rhs) const { return !(*this == rhs); }; \ | ^~~~~~~~ src/ast_selectors.hpp:139:5: note: in expansion of macro ‘ATTACH_VIRTUAL_CMP_OPERATIONS’ 139 | ATTACH_VIRTUAL_CMP_OPERATIONS(SimpleSelector); | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~ src/ast_def_macros.hpp:110:16: note: by ‘virtual bool Sass::AttributeSelector::operator!=(const Sass::AttributeSelector&) const’ 110 | virtual bool operator!=(const klass& rhs) const { return !(*this == rhs); }; \ | ^~~~~~~~ src/ast_selectors.hpp:223:5: note: in expansion of macro ‘ATTACH_CMP_OPERATIONS’ 223 | ATTACH_CMP_OPERATIONS(AttributeSelector) | ^~~~~~~~~~~~~~~~~~~~~ src/ast_def_macros.hpp:106:16: warning: ‘virtual bool Sass::Selector::operator!=(const Sass::Selector&) const’ was hidden [-Woverloaded-virtual=] 106 | virtual bool operator!=(const klass& rhs) const { return !(*this == rhs); }; \ | ^~~~~~~~ src/ast_selectors.hpp:56:5: note: in expansion of macro ‘ATTACH_VIRTUAL_CMP_OPERATIONS’ 56 | ATTACH_VIRTUAL_CMP_OPERATIONS(Selector) | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~ src/ast_def_macros.hpp:110:16: note: by ‘virtual bool Sass::ComplexSelector::operator!=(const Sass::ComplexSelector&) const’ 110 | virtual bool operator!=(const klass& rhs) const { return !(*this == rhs); }; \ | ^~~~~~~~ src/ast_selectors.hpp:310:5: note: in expansion of macro ‘ATTACH_CMP_OPERATIONS’ 310 | ATTACH_CMP_OPERATIONS(ComplexSelector) | ^~~~~~~~~~~~~~~~~~~~~ src/ast_def_macros.hpp:106:16: warning: ‘virtual bool Sass::Selector::operator!=(const Sass::Selector&) const’ was hidden [-Woverloaded-virtual=] 106 | virtual bool operator!=(const klass& rhs) const { return !(*this == rhs); }; \ | ^~~~~~~~ src/ast_selectors.hpp:56:5: note: in expansion of macro ‘ATTACH_VIRTUAL_CMP_OPERATIONS’ 56 | ATTACH_VIRTUAL_CMP_OPERATIONS(Selector) | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~ src/ast_def_macros.hpp:106:16: note: by ‘virtual bool Sass::SelectorComponent::operator!=(const Sass::SelectorComponent&) const’ 106 | virtual bool operator!=(const klass& rhs) const { return !(*this == rhs); }; \ | ^~~~~~~~ src/ast_selectors.hpp:349:5: note: in expansion of macro ‘ATTACH_VIRTUAL_CMP_OPERATIONS’ 349 | ATTACH_VIRTUAL_CMP_OPERATIONS(SelectorComponent); | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~ src/ast_def_macros.hpp:106:16: warning: ‘virtual bool Sass::SelectorComponent::operator!=(const Sass::SelectorComponent&) const’ was hidden [-Woverloaded-virtual=] 106 | virtual bool operator!=(const klass& rhs) const { return !(*this == rhs); }; \ | ^~~~~~~~ src/ast_selectors.hpp:349:5: note: in expansion of macro ‘ATTACH_VIRTUAL_CMP_OPERATIONS’ 349 | ATTACH_VIRTUAL_CMP_OPERATIONS(SelectorComponent); | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~ src/ast_def_macros.hpp:110:16: note: by ‘virtual bool Sass::SelectorCombinator::operator!=(const Sass::SelectorCombinator&) const’ 110 | virtual bool operator!=(const klass& rhs) const { return !(*this == rhs); }; \ | ^~~~~~~~ src/ast_selectors.hpp:407:5: note: in expansion of macro ‘ATTACH_CMP_OPERATIONS’ 407 | ATTACH_CMP_OPERATIONS(SelectorCombinator) | ^~~~~~~~~~~~~~~~~~~~~ g++ -std=gnu++17 -Wall -O2 -std=c++11 -I ./include -fPIC -c -o src/plugins.o src/plugins.cpp g++ -std=gnu++17 -Wall -O2 -std=c++11 -I ./include -fPIC -c -o src/source.o src/source.cpp g++ -std=gnu++17 -Wall -O2 -std=c++11 -I ./include -fPIC -c -o src/position.o src/position.cpp g++ -std=gnu++17 -Wall -O2 -std=c++11 -I ./include -fPIC -c -o src/lexer.o src/lexer.cpp g++ -std=gnu++17 -Wall -O2 -std=c++11 -I ./include -fPIC -c -o src/parser.o src/parser.cpp In file included from src/parser.hpp:11, from src/parser.cpp:5: src/ast.hpp:90:18: warning: ‘virtual bool Sass::AST_Node::operator==(const Sass::AST_Node&) const’ was hidden [-Woverloaded-virtual=] 90 | virtual bool operator== (const AST_Node& rhs) const { | ^~~~~~~~ src/ast.hpp:165:18: note: by ‘virtual bool Sass::Expression::operator==(const Sass::Expression&) const’ 165 | virtual bool operator== (const Expression& rhs) const { return false; } | ^~~~~~~~ src/ast.hpp:96:18: warning: ‘virtual bool Sass::AST_Node::operator!=(const Sass::AST_Node&) const’ was hidden [-Woverloaded-virtual=] 96 | virtual bool operator!= (const AST_Node& rhs) const { | ^~~~~~~~ src/ast.hpp:167:17: note: by ‘bool Sass::Expression::operator!=(const Sass::Expression&) const’ 167 | inline bool operator!=(const Expression& rhs) const { return !(rhs == *this); } | ^~~~~~~~ src/ast.hpp:90:18: warning: ‘virtual bool Sass::AST_Node::operator==(const Sass::AST_Node&) const’ was hidden [-Woverloaded-virtual=] 90 | virtual bool operator== (const AST_Node& rhs) const { | ^~~~~~~~ src/ast.hpp:908:10: note: by ‘bool Sass::CssMediaRule::operator==(const Sass::CssMediaRule&) const’ 908 | bool operator== (const CssMediaRule& rhs) const { | ^~~~~~~~ src/ast.hpp:96:18: warning: ‘virtual bool Sass::AST_Node::operator!=(const Sass::AST_Node&) const’ was hidden [-Woverloaded-virtual=] 96 | virtual bool operator!= (const AST_Node& rhs) const { | ^~~~~~~~ src/ast.hpp:911:10: note: by ‘bool Sass::CssMediaRule::operator!=(const Sass::CssMediaRule&) const’ 911 | bool operator!=(const CssMediaRule& rhs) const { | ^~~~~~~~ src/ast.hpp:90:18: warning: ‘virtual bool Sass::AST_Node::operator==(const Sass::AST_Node&) const’ was hidden [-Woverloaded-virtual=] 90 | virtual bool operator== (const AST_Node& rhs) const { | ^~~~~~~~ src/ast.hpp:939:10: note: by ‘bool Sass::CssMediaQuery::operator==(const Sass::CssMediaQuery&) const’ 939 | bool operator== (const CssMediaQuery& rhs) const; | ^~~~~~~~ src/ast.hpp:96:18: warning: ‘virtual bool Sass::AST_Node::operator!=(const Sass::AST_Node&) const’ was hidden [-Woverloaded-virtual=] 96 | virtual bool operator!= (const AST_Node& rhs) const { | ^~~~~~~~ src/ast.hpp:940:10: note: by ‘bool Sass::CssMediaQuery::operator!=(const Sass::CssMediaQuery&) const’ 940 | bool operator!=(const CssMediaQuery& rhs) const { | ^~~~~~~~ src/ast.hpp:165:18: warning: ‘virtual bool Sass::Expression::operator==(const Sass::Expression&) const’ was hidden [-Woverloaded-virtual=] 165 | virtual bool operator== (const Expression& rhs) const { return false; } | ^~~~~~~~ In file included from src/ast.hpp:14: src/ast_def_macros.hpp:105:16: note: by ‘virtual bool Sass::Selector::operator==(const Sass::Selector&) const’ 105 | virtual bool operator==(const klass& rhs) const = 0; \ | ^~~~~~~~ src/ast_selectors.hpp:56:5: note: in expansion of macro ‘ATTACH_VIRTUAL_CMP_OPERATIONS’ 56 | ATTACH_VIRTUAL_CMP_OPERATIONS(Selector) | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~ src/ast.hpp:96:18: warning: ‘virtual bool Sass::AST_Node::operator!=(const Sass::AST_Node&) const’ was hidden [-Woverloaded-virtual=] 96 | virtual bool operator!= (const AST_Node& rhs) const { | ^~~~~~~~ src/ast_def_macros.hpp:106:16: note: by ‘virtual bool Sass::Selector::operator!=(const Sass::Selector&) const’ 106 | virtual bool operator!=(const klass& rhs) const { return !(*this == rhs); }; \ | ^~~~~~~~ src/ast_selectors.hpp:56:5: note: in expansion of macro ‘ATTACH_VIRTUAL_CMP_OPERATIONS’ 56 | ATTACH_VIRTUAL_CMP_OPERATIONS(Selector) | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~ src/ast_def_macros.hpp:106:16: warning: ‘virtual bool Sass::Selector::operator!=(const Sass::Selector&) const’ was hidden [-Woverloaded-virtual=] 106 | virtual bool operator!=(const klass& rhs) const { return !(*this == rhs); }; \ | ^~~~~~~~ src/ast_selectors.hpp:56:5: note: in expansion of macro ‘ATTACH_VIRTUAL_CMP_OPERATIONS’ 56 | ATTACH_VIRTUAL_CMP_OPERATIONS(Selector) | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~ src/ast_def_macros.hpp:106:16: note: by ‘virtual bool Sass::SimpleSelector::operator!=(const Sass::SimpleSelector&) const’ 106 | virtual bool operator!=(const klass& rhs) const { return !(*this == rhs); }; \ | ^~~~~~~~ src/ast_selectors.hpp:139:5: note: in expansion of macro ‘ATTACH_VIRTUAL_CMP_OPERATIONS’ 139 | ATTACH_VIRTUAL_CMP_OPERATIONS(SimpleSelector); | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~ In file included from src/ast.hpp:1055: src/ast_selectors.hpp:137:18: warning: ‘virtual bool Sass::SimpleSelector::operator==(const Sass::CompoundSelector&) const’ was hidden [-Woverloaded-virtual=] 137 | virtual bool operator==(const CompoundSelector& rhs) const; | ^~~~~~~~ src/ast_def_macros.hpp:109:16: note: by ‘Sass::PlaceholderSelector::operator==’ 109 | virtual bool operator==(const klass& rhs) const; \ | ^~~~~~~~ src/ast_selectors.hpp:157:5: note: in expansion of macro ‘ATTACH_CMP_OPERATIONS’ 157 | ATTACH_CMP_OPERATIONS(PlaceholderSelector) | ^~~~~~~~~~~~~~~~~~~~~ src/ast_selectors.hpp:136:18: warning: ‘virtual bool Sass::SimpleSelector::operator==(const Sass::ComplexSelector&) const’ was hidden [-Woverloaded-virtual=] 136 | virtual bool operator==(const ComplexSelector& rhs) const; | ^~~~~~~~ src/ast_def_macros.hpp:109:16: note: by ‘Sass::PlaceholderSelector::operator==’ 109 | virtual bool operator==(const klass& rhs) const; \ | ^~~~~~~~ src/ast_selectors.hpp:157:5: note: in expansion of macro ‘ATTACH_CMP_OPERATIONS’ 157 | ATTACH_CMP_OPERATIONS(PlaceholderSelector) | ^~~~~~~~~~~~~~~~~~~~~ src/ast_selectors.hpp:135:18: warning: ‘virtual bool Sass::SimpleSelector::operator==(const Sass::SelectorList&) const’ was hidden [-Woverloaded-virtual=] 135 | virtual bool operator==(const SelectorList& rhs) const; | ^~~~~~~~ src/ast_def_macros.hpp:109:16: note: by ‘Sass::PlaceholderSelector::operator==’ 109 | virtual bool operator==(const klass& rhs) const; \ | ^~~~~~~~ src/ast_selectors.hpp:157:5: note: in expansion of macro ‘ATTACH_CMP_OPERATIONS’ 157 | ATTACH_CMP_OPERATIONS(PlaceholderSelector) | ^~~~~~~~~~~~~~~~~~~~~ src/ast_selectors.hpp:133:10: warning: ‘virtual bool Sass::SimpleSelector::operator==(const Sass::Selector&) const’ was hidden [-Woverloaded-virtual=] 133 | bool operator==(const Selector& rhs) const final override; | ^~~~~~~~ src/ast_def_macros.hpp:109:16: note: by ‘Sass::PlaceholderSelector::operator==’ 109 | virtual bool operator==(const klass& rhs) const; \ | ^~~~~~~~ src/ast_selectors.hpp:157:5: note: in expansion of macro ‘ATTACH_CMP_OPERATIONS’ 157 | ATTACH_CMP_OPERATIONS(PlaceholderSelector) | ^~~~~~~~~~~~~~~~~~~~~ src/ast_def_macros.hpp:106:16: warning: ‘virtual bool Sass::SimpleSelector::operator!=(const Sass::SimpleSelector&) const’ was hidden [-Woverloaded-virtual=] 106 | virtual bool operator!=(const klass& rhs) const { return !(*this == rhs); }; \ | ^~~~~~~~ src/ast_selectors.hpp:139:5: note: in expansion of macro ‘ATTACH_VIRTUAL_CMP_OPERATIONS’ 139 | ATTACH_VIRTUAL_CMP_OPERATIONS(SimpleSelector); | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~ src/ast_def_macros.hpp:110:16: note: by ‘virtual bool Sass::PlaceholderSelector::operator!=(const Sass::PlaceholderSelector&) const’ 110 | virtual bool operator!=(const klass& rhs) const { return !(*this == rhs); }; \ | ^~~~~~~~ src/ast_selectors.hpp:157:5: note: in expansion of macro ‘ATTACH_CMP_OPERATIONS’ 157 | ATTACH_CMP_OPERATIONS(PlaceholderSelector) | ^~~~~~~~~~~~~~~~~~~~~ src/ast_selectors.hpp:137:18: warning: ‘virtual bool Sass::SimpleSelector::operator==(const Sass::CompoundSelector&) const’ was hidden [-Woverloaded-virtual=] 137 | virtual bool operator==(const CompoundSelector& rhs) const; | ^~~~~~~~ src/ast_def_macros.hpp:109:16: note: by ‘Sass::TypeSelector::operator==’ 109 | virtual bool operator==(const klass& rhs) const; \ | ^~~~~~~~ src/ast_selectors.hpp:174:5: note: in expansion of macro ‘ATTACH_CMP_OPERATIONS’ 174 | ATTACH_CMP_OPERATIONS(TypeSelector) | ^~~~~~~~~~~~~~~~~~~~~ src/ast_selectors.hpp:136:18: warning: ‘virtual bool Sass::SimpleSelector::operator==(const Sass::ComplexSelector&) const’ was hidden [-Woverloaded-virtual=] 136 | virtual bool operator==(const ComplexSelector& rhs) const; | ^~~~~~~~ src/ast_def_macros.hpp:109:16: note: by ‘Sass::TypeSelector::operator==’ 109 | virtual bool operator==(const klass& rhs) const; \ | ^~~~~~~~ src/ast_selectors.hpp:174:5: note: in expansion of macro ‘ATTACH_CMP_OPERATIONS’ 174 | ATTACH_CMP_OPERATIONS(TypeSelector) | ^~~~~~~~~~~~~~~~~~~~~ src/ast_selectors.hpp:135:18: warning: ‘virtual bool Sass::SimpleSelector::operator==(const Sass::SelectorList&) const’ was hidden [-Woverloaded-virtual=] 135 | virtual bool operator==(const SelectorList& rhs) const; | ^~~~~~~~ src/ast_def_macros.hpp:109:16: note: by ‘Sass::TypeSelector::operator==’ 109 | virtual bool operator==(const klass& rhs) const; \ | ^~~~~~~~ src/ast_selectors.hpp:174:5: note: in expansion of macro ‘ATTACH_CMP_OPERATIONS’ 174 | ATTACH_CMP_OPERATIONS(TypeSelector) | ^~~~~~~~~~~~~~~~~~~~~ src/ast_selectors.hpp:133:10: warning: ‘virtual bool Sass::SimpleSelector::operator==(const Sass::Selector&) const’ was hidden [-Woverloaded-virtual=] 133 | bool operator==(const Selector& rhs) const final override; | ^~~~~~~~ src/ast_def_macros.hpp:109:16: note: by ‘Sass::TypeSelector::operator==’ 109 | virtual bool operator==(const klass& rhs) const; \ | ^~~~~~~~ src/ast_selectors.hpp:174:5: note: in expansion of macro ‘ATTACH_CMP_OPERATIONS’ 174 | ATTACH_CMP_OPERATIONS(TypeSelector) | ^~~~~~~~~~~~~~~~~~~~~ src/ast_def_macros.hpp:106:16: warning: ‘virtual bool Sass::SimpleSelector::operator!=(const Sass::SimpleSelector&) const’ was hidden [-Woverloaded-virtual=] 106 | virtual bool operator!=(const klass& rhs) const { return !(*this == rhs); }; \ | ^~~~~~~~ src/ast_selectors.hpp:139:5: note: in expansion of macro ‘ATTACH_VIRTUAL_CMP_OPERATIONS’ 139 | ATTACH_VIRTUAL_CMP_OPERATIONS(SimpleSelector); | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~ src/ast_def_macros.hpp:110:16: note: by ‘virtual bool Sass::TypeSelector::operator!=(const Sass::TypeSelector&) const’ 110 | virtual bool operator!=(const klass& rhs) const { return !(*this == rhs); }; \ | ^~~~~~~~ src/ast_selectors.hpp:174:5: note: in expansion of macro ‘ATTACH_CMP_OPERATIONS’ 174 | ATTACH_CMP_OPERATIONS(TypeSelector) | ^~~~~~~~~~~~~~~~~~~~~ src/ast_selectors.hpp:137:18: warning: ‘virtual bool Sass::SimpleSelector::operator==(const Sass::CompoundSelector&) const’ was hidden [-Woverloaded-virtual=] 137 | virtual bool operator==(const CompoundSelector& rhs) const; | ^~~~~~~~ src/ast_def_macros.hpp:109:16: note: by ‘Sass::ClassSelector::operator==’ 109 | virtual bool operator==(const klass& rhs) const; \ | ^~~~~~~~ src/ast_selectors.hpp:188:5: note: in expansion of macro ‘ATTACH_CMP_OPERATIONS’ 188 | ATTACH_CMP_OPERATIONS(ClassSelector) | ^~~~~~~~~~~~~~~~~~~~~ src/ast_selectors.hpp:136:18: warning: ‘virtual bool Sass::SimpleSelector::operator==(const Sass::ComplexSelector&) const’ was hidden [-Woverloaded-virtual=] 136 | virtual bool operator==(const ComplexSelector& rhs) const; | ^~~~~~~~ src/ast_def_macros.hpp:109:16: note: by ‘Sass::ClassSelector::operator==’ 109 | virtual bool operator==(const klass& rhs) const; \ | ^~~~~~~~ src/ast_selectors.hpp:188:5: note: in expansion of macro ‘ATTACH_CMP_OPERATIONS’ 188 | ATTACH_CMP_OPERATIONS(ClassSelector) | ^~~~~~~~~~~~~~~~~~~~~ src/ast_selectors.hpp:135:18: warning: ‘virtual bool Sass::SimpleSelector::operator==(const Sass::SelectorList&) const’ was hidden [-Woverloaded-virtual=] 135 | virtual bool operator==(const SelectorList& rhs) const; | ^~~~~~~~ src/ast_def_macros.hpp:109:16: note: by ‘Sass::ClassSelector::operator==’ 109 | virtual bool operator==(const klass& rhs) const; \ | ^~~~~~~~ src/ast_selectors.hpp:188:5: note: in expansion of macro ‘ATTACH_CMP_OPERATIONS’ 188 | ATTACH_CMP_OPERATIONS(ClassSelector) | ^~~~~~~~~~~~~~~~~~~~~ src/ast_selectors.hpp:133:10: warning: ‘virtual bool Sass::SimpleSelector::operator==(const Sass::Selector&) const’ was hidden [-Woverloaded-virtual=] 133 | bool operator==(const Selector& rhs) const final override; | ^~~~~~~~ src/ast_def_macros.hpp:109:16: note: by ‘Sass::ClassSelector::operator==’ 109 | virtual bool operator==(const klass& rhs) const; \ | ^~~~~~~~ src/ast_selectors.hpp:188:5: note: in expansion of macro ‘ATTACH_CMP_OPERATIONS’ 188 | ATTACH_CMP_OPERATIONS(ClassSelector) | ^~~~~~~~~~~~~~~~~~~~~ src/ast_def_macros.hpp:106:16: warning: ‘virtual bool Sass::SimpleSelector::operator!=(const Sass::SimpleSelector&) const’ was hidden [-Woverloaded-virtual=] 106 | virtual bool operator!=(const klass& rhs) const { return !(*this == rhs); }; \ | ^~~~~~~~ src/ast_selectors.hpp:139:5: note: in expansion of macro ‘ATTACH_VIRTUAL_CMP_OPERATIONS’ 139 | ATTACH_VIRTUAL_CMP_OPERATIONS(SimpleSelector); | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~ src/ast_def_macros.hpp:110:16: note: by ‘virtual bool Sass::ClassSelector::operator!=(const Sass::ClassSelector&) const’ 110 | virtual bool operator!=(const klass& rhs) const { return !(*this == rhs); }; \ | ^~~~~~~~ src/ast_selectors.hpp:188:5: note: in expansion of macro ‘ATTACH_CMP_OPERATIONS’ 188 | ATTACH_CMP_OPERATIONS(ClassSelector) | ^~~~~~~~~~~~~~~~~~~~~ src/ast_selectors.hpp:137:18: warning: ‘virtual bool Sass::SimpleSelector::operator==(const Sass::CompoundSelector&) const’ was hidden [-Woverloaded-virtual=] 137 | virtual bool operator==(const CompoundSelector& rhs) const; | ^~~~~~~~ src/ast_def_macros.hpp:109:16: note: by ‘Sass::IDSelector::operator==’ 109 | virtual bool operator==(const klass& rhs) const; \ | ^~~~~~~~ src/ast_selectors.hpp:204:5: note: in expansion of macro ‘ATTACH_CMP_OPERATIONS’ 204 | ATTACH_CMP_OPERATIONS(IDSelector) | ^~~~~~~~~~~~~~~~~~~~~ src/ast_selectors.hpp:136:18: warning: ‘virtual bool Sass::SimpleSelector::operator==(const Sass::ComplexSelector&) const’ was hidden [-Woverloaded-virtual=] 136 | virtual bool operator==(const ComplexSelector& rhs) const; | ^~~~~~~~ src/ast_def_macros.hpp:109:16: note: by ‘Sass::IDSelector::operator==’ 109 | virtual bool operator==(const klass& rhs) const; \ | ^~~~~~~~ src/ast_selectors.hpp:204:5: note: in expansion of macro ‘ATTACH_CMP_OPERATIONS’ 204 | ATTACH_CMP_OPERATIONS(IDSelector) | ^~~~~~~~~~~~~~~~~~~~~ src/ast_selectors.hpp:135:18: warning: ‘virtual bool Sass::SimpleSelector::operator==(const Sass::SelectorList&) const’ was hidden [-Woverloaded-virtual=] 135 | virtual bool operator==(const SelectorList& rhs) const; | ^~~~~~~~ src/ast_def_macros.hpp:109:16: note: by ‘Sass::IDSelector::operator==’ 109 | virtual bool operator==(const klass& rhs) const; \ | ^~~~~~~~ src/ast_selectors.hpp:204:5: note: in expansion of macro ‘ATTACH_CMP_OPERATIONS’ 204 | ATTACH_CMP_OPERATIONS(IDSelector) | ^~~~~~~~~~~~~~~~~~~~~ src/ast_selectors.hpp:133:10: warning: ‘virtual bool Sass::SimpleSelector::operator==(const Sass::Selector&) const’ was hidden [-Woverloaded-virtual=] 133 | bool operator==(const Selector& rhs) const final override; | ^~~~~~~~ src/ast_def_macros.hpp:109:16: note: by ‘Sass::IDSelector::operator==’ 109 | virtual bool operator==(const klass& rhs) const; \ | ^~~~~~~~ src/ast_selectors.hpp:204:5: note: in expansion of macro ‘ATTACH_CMP_OPERATIONS’ 204 | ATTACH_CMP_OPERATIONS(IDSelector) | ^~~~~~~~~~~~~~~~~~~~~ src/ast_def_macros.hpp:106:16: warning: ‘virtual bool Sass::SimpleSelector::operator!=(const Sass::SimpleSelector&) const’ was hidden [-Woverloaded-virtual=] 106 | virtual bool operator!=(const klass& rhs) const { return !(*this == rhs); }; \ | ^~~~~~~~ src/ast_selectors.hpp:139:5: note: in expansion of macro ‘ATTACH_VIRTUAL_CMP_OPERATIONS’ 139 | ATTACH_VIRTUAL_CMP_OPERATIONS(SimpleSelector); | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~ src/ast_def_macros.hpp:110:16: note: by ‘virtual bool Sass::IDSelector::operator!=(const Sass::IDSelector&) const’ 110 | virtual bool operator!=(const klass& rhs) const { return !(*this == rhs); }; \ | ^~~~~~~~ src/ast_selectors.hpp:204:5: note: in expansion of macro ‘ATTACH_CMP_OPERATIONS’ 204 | ATTACH_CMP_OPERATIONS(IDSelector) | ^~~~~~~~~~~~~~~~~~~~~ src/ast_selectors.hpp:137:18: warning: ‘virtual bool Sass::SimpleSelector::operator==(const Sass::CompoundSelector&) const’ was hidden [-Woverloaded-virtual=] 137 | virtual bool operator==(const CompoundSelector& rhs) const; | ^~~~~~~~ src/ast_def_macros.hpp:109:16: note: by ‘Sass::AttributeSelector::operator==’ 109 | virtual bool operator==(const klass& rhs) const; \ | ^~~~~~~~ src/ast_selectors.hpp:223:5: note: in expansion of macro ‘ATTACH_CMP_OPERATIONS’ 223 | ATTACH_CMP_OPERATIONS(AttributeSelector) | ^~~~~~~~~~~~~~~~~~~~~ src/ast_selectors.hpp:136:18: warning: ‘virtual bool Sass::SimpleSelector::operator==(const Sass::ComplexSelector&) const’ was hidden [-Woverloaded-virtual=] 136 | virtual bool operator==(const ComplexSelector& rhs) const; | ^~~~~~~~ src/ast_def_macros.hpp:109:16: note: by ‘Sass::AttributeSelector::operator==’ 109 | virtual bool operator==(const klass& rhs) const; \ | ^~~~~~~~ src/ast_selectors.hpp:223:5: note: in expansion of macro ‘ATTACH_CMP_OPERATIONS’ 223 | ATTACH_CMP_OPERATIONS(AttributeSelector) | ^~~~~~~~~~~~~~~~~~~~~ src/ast_selectors.hpp:135:18: warning: ‘virtual bool Sass::SimpleSelector::operator==(const Sass::SelectorList&) const’ was hidden [-Woverloaded-virtual=] 135 | virtual bool operator==(const SelectorList& rhs) const; | ^~~~~~~~ src/ast_def_macros.hpp:109:16: note: by ‘Sass::AttributeSelector::operator==’ 109 | virtual bool operator==(const klass& rhs) const; \ | ^~~~~~~~ src/ast_selectors.hpp:223:5: note: in expansion of macro ‘ATTACH_CMP_OPERATIONS’ 223 | ATTACH_CMP_OPERATIONS(AttributeSelector) | ^~~~~~~~~~~~~~~~~~~~~ src/ast_selectors.hpp:133:10: warning: ‘virtual bool Sass::SimpleSelector::operator==(const Sass::Selector&) const’ was hidden [-Woverloaded-virtual=] 133 | bool operator==(const Selector& rhs) const final override; | ^~~~~~~~ src/ast_def_macros.hpp:109:16: note: by ‘Sass::AttributeSelector::operator==’ 109 | virtual bool operator==(const klass& rhs) const; \ | ^~~~~~~~ src/ast_selectors.hpp:223:5: note: in expansion of macro ‘ATTACH_CMP_OPERATIONS’ 223 | ATTACH_CMP_OPERATIONS(AttributeSelector) | ^~~~~~~~~~~~~~~~~~~~~ src/ast_def_macros.hpp:106:16: warning: ‘virtual bool Sass::SimpleSelector::operator!=(const Sass::SimpleSelector&) const’ was hidden [-Woverloaded-virtual=] 106 | virtual bool operator!=(const klass& rhs) const { return !(*this == rhs); }; \ | ^~~~~~~~ src/ast_selectors.hpp:139:5: note: in expansion of macro ‘ATTACH_VIRTUAL_CMP_OPERATIONS’ 139 | ATTACH_VIRTUAL_CMP_OPERATIONS(SimpleSelector); | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~ src/ast_def_macros.hpp:110:16: note: by ‘virtual bool Sass::AttributeSelector::operator!=(const Sass::AttributeSelector&) const’ 110 | virtual bool operator!=(const klass& rhs) const { return !(*this == rhs); }; \ | ^~~~~~~~ src/ast_selectors.hpp:223:5: note: in expansion of macro ‘ATTACH_CMP_OPERATIONS’ 223 | ATTACH_CMP_OPERATIONS(AttributeSelector) | ^~~~~~~~~~~~~~~~~~~~~ src/ast_def_macros.hpp:106:16: warning: ‘virtual bool Sass::Selector::operator!=(const Sass::Selector&) const’ was hidden [-Woverloaded-virtual=] 106 | virtual bool operator!=(const klass& rhs) const { return !(*this == rhs); }; \ | ^~~~~~~~ src/ast_selectors.hpp:56:5: note: in expansion of macro ‘ATTACH_VIRTUAL_CMP_OPERATIONS’ 56 | ATTACH_VIRTUAL_CMP_OPERATIONS(Selector) | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~ src/ast_def_macros.hpp:110:16: note: by ‘virtual bool Sass::ComplexSelector::operator!=(const Sass::ComplexSelector&) const’ 110 | virtual bool operator!=(const klass& rhs) const { return !(*this == rhs); }; \ | ^~~~~~~~ src/ast_selectors.hpp:310:5: note: in expansion of macro ‘ATTACH_CMP_OPERATIONS’ 310 | ATTACH_CMP_OPERATIONS(ComplexSelector) | ^~~~~~~~~~~~~~~~~~~~~ src/ast_def_macros.hpp:106:16: warning: ‘virtual bool Sass::Selector::operator!=(const Sass::Selector&) const’ was hidden [-Woverloaded-virtual=] 106 | virtual bool operator!=(const klass& rhs) const { return !(*this == rhs); }; \ | ^~~~~~~~ src/ast_selectors.hpp:56:5: note: in expansion of macro ‘ATTACH_VIRTUAL_CMP_OPERATIONS’ 56 | ATTACH_VIRTUAL_CMP_OPERATIONS(Selector) | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~ src/ast_def_macros.hpp:106:16: note: by ‘virtual bool Sass::SelectorComponent::operator!=(const Sass::SelectorComponent&) const’ 106 | virtual bool operator!=(const klass& rhs) const { return !(*this == rhs); }; \ | ^~~~~~~~ src/ast_selectors.hpp:349:5: note: in expansion of macro ‘ATTACH_VIRTUAL_CMP_OPERATIONS’ 349 | ATTACH_VIRTUAL_CMP_OPERATIONS(SelectorComponent); | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~ src/ast_def_macros.hpp:106:16: warning: ‘virtual bool Sass::SelectorComponent::operator!=(const Sass::SelectorComponent&) const’ was hidden [-Woverloaded-virtual=] 106 | virtual bool operator!=(const klass& rhs) const { return !(*this == rhs); }; \ | ^~~~~~~~ src/ast_selectors.hpp:349:5: note: in expansion of macro ‘ATTACH_VIRTUAL_CMP_OPERATIONS’ 349 | ATTACH_VIRTUAL_CMP_OPERATIONS(SelectorComponent); | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~ src/ast_def_macros.hpp:110:16: note: by ‘virtual bool Sass::SelectorCombinator::operator!=(const Sass::SelectorCombinator&) const’ 110 | virtual bool operator!=(const klass& rhs) const { return !(*this == rhs); }; \ | ^~~~~~~~ src/ast_selectors.hpp:407:5: note: in expansion of macro ‘ATTACH_CMP_OPERATIONS’ 407 | ATTACH_CMP_OPERATIONS(SelectorCombinator) | ^~~~~~~~~~~~~~~~~~~~~ g++ -std=gnu++17 -Wall -O2 -std=c++11 -I ./include -fPIC -c -o src/parser_selectors.o src/parser_selectors.cpp In file included from src/parser.hpp:11, from src/parser_selectors.cpp:5: src/ast.hpp:90:18: warning: ‘virtual bool Sass::AST_Node::operator==(const Sass::AST_Node&) const’ was hidden [-Woverloaded-virtual=] 90 | virtual bool operator== (const AST_Node& rhs) const { | ^~~~~~~~ src/ast.hpp:165:18: note: by ‘virtual bool Sass::Expression::operator==(const Sass::Expression&) const’ 165 | virtual bool operator== (const Expression& rhs) const { return false; } | ^~~~~~~~ src/ast.hpp:96:18: warning: ‘virtual bool Sass::AST_Node::operator!=(const Sass::AST_Node&) const’ was hidden [-Woverloaded-virtual=] 96 | virtual bool operator!= (const AST_Node& rhs) const { | ^~~~~~~~ src/ast.hpp:167:17: note: by ‘bool Sass::Expression::operator!=(const Sass::Expression&) const’ 167 | inline bool operator!=(const Expression& rhs) const { return !(rhs == *this); } | ^~~~~~~~ src/ast.hpp:90:18: warning: ‘virtual bool Sass::AST_Node::operator==(const Sass::AST_Node&) const’ was hidden [-Woverloaded-virtual=] 90 | virtual bool operator== (const AST_Node& rhs) const { | ^~~~~~~~ src/ast.hpp:908:10: note: by ‘bool Sass::CssMediaRule::operator==(const Sass::CssMediaRule&) const’ 908 | bool operator== (const CssMediaRule& rhs) const { | ^~~~~~~~ src/ast.hpp:96:18: warning: ‘virtual bool Sass::AST_Node::operator!=(const Sass::AST_Node&) const’ was hidden [-Woverloaded-virtual=] 96 | virtual bool operator!= (const AST_Node& rhs) const { | ^~~~~~~~ src/ast.hpp:911:10: note: by ‘bool Sass::CssMediaRule::operator!=(const Sass::CssMediaRule&) const’ 911 | bool operator!=(const CssMediaRule& rhs) const { | ^~~~~~~~ src/ast.hpp:90:18: warning: ‘virtual bool Sass::AST_Node::operator==(const Sass::AST_Node&) const’ was hidden [-Woverloaded-virtual=] 90 | virtual bool operator== (const AST_Node& rhs) const { | ^~~~~~~~ src/ast.hpp:939:10: note: by ‘bool Sass::CssMediaQuery::operator==(const Sass::CssMediaQuery&) const’ 939 | bool operator== (const CssMediaQuery& rhs) const; | ^~~~~~~~ src/ast.hpp:96:18: warning: ‘virtual bool Sass::AST_Node::operator!=(const Sass::AST_Node&) const’ was hidden [-Woverloaded-virtual=] 96 | virtual bool operator!= (const AST_Node& rhs) const { | ^~~~~~~~ src/ast.hpp:940:10: note: by ‘bool Sass::CssMediaQuery::operator!=(const Sass::CssMediaQuery&) const’ 940 | bool operator!=(const CssMediaQuery& rhs) const { | ^~~~~~~~ src/ast.hpp:165:18: warning: ‘virtual bool Sass::Expression::operator==(const Sass::Expression&) const’ was hidden [-Woverloaded-virtual=] 165 | virtual bool operator== (const Expression& rhs) const { return false; } | ^~~~~~~~ In file included from src/ast.hpp:14: src/ast_def_macros.hpp:105:16: note: by ‘virtual bool Sass::Selector::operator==(const Sass::Selector&) const’ 105 | virtual bool operator==(const klass& rhs) const = 0; \ | ^~~~~~~~ src/ast_selectors.hpp:56:5: note: in expansion of macro ‘ATTACH_VIRTUAL_CMP_OPERATIONS’ 56 | ATTACH_VIRTUAL_CMP_OPERATIONS(Selector) | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~ src/ast.hpp:96:18: warning: ‘virtual bool Sass::AST_Node::operator!=(const Sass::AST_Node&) const’ was hidden [-Woverloaded-virtual=] 96 | virtual bool operator!= (const AST_Node& rhs) const { | ^~~~~~~~ src/ast_def_macros.hpp:106:16: note: by ‘virtual bool Sass::Selector::operator!=(const Sass::Selector&) const’ 106 | virtual bool operator!=(const klass& rhs) const { return !(*this == rhs); }; \ | ^~~~~~~~ src/ast_selectors.hpp:56:5: note: in expansion of macro ‘ATTACH_VIRTUAL_CMP_OPERATIONS’ 56 | ATTACH_VIRTUAL_CMP_OPERATIONS(Selector) | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~ src/ast_def_macros.hpp:106:16: warning: ‘virtual bool Sass::Selector::operator!=(const Sass::Selector&) const’ was hidden [-Woverloaded-virtual=] 106 | virtual bool operator!=(const klass& rhs) const { return !(*this == rhs); }; \ | ^~~~~~~~ src/ast_selectors.hpp:56:5: note: in expansion of macro ‘ATTACH_VIRTUAL_CMP_OPERATIONS’ 56 | ATTACH_VIRTUAL_CMP_OPERATIONS(Selector) | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~ src/ast_def_macros.hpp:106:16: note: by ‘virtual bool Sass::SimpleSelector::operator!=(const Sass::SimpleSelector&) const’ 106 | virtual bool operator!=(const klass& rhs) const { return !(*this == rhs); }; \ | ^~~~~~~~ src/ast_selectors.hpp:139:5: note: in expansion of macro ‘ATTACH_VIRTUAL_CMP_OPERATIONS’ 139 | ATTACH_VIRTUAL_CMP_OPERATIONS(SimpleSelector); | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~ In file included from src/ast.hpp:1055: src/ast_selectors.hpp:137:18: warning: ‘virtual bool Sass::SimpleSelector::operator==(const Sass::CompoundSelector&) const’ was hidden [-Woverloaded-virtual=] 137 | virtual bool operator==(const CompoundSelector& rhs) const; | ^~~~~~~~ src/ast_def_macros.hpp:109:16: note: by ‘Sass::PlaceholderSelector::operator==’ 109 | virtual bool operator==(const klass& rhs) const; \ | ^~~~~~~~ src/ast_selectors.hpp:157:5: note: in expansion of macro ‘ATTACH_CMP_OPERATIONS’ 157 | ATTACH_CMP_OPERATIONS(PlaceholderSelector) | ^~~~~~~~~~~~~~~~~~~~~ src/ast_selectors.hpp:136:18: warning: ‘virtual bool Sass::SimpleSelector::operator==(const Sass::ComplexSelector&) const’ was hidden [-Woverloaded-virtual=] 136 | virtual bool operator==(const ComplexSelector& rhs) const; | ^~~~~~~~ src/ast_def_macros.hpp:109:16: note: by ‘Sass::PlaceholderSelector::operator==’ 109 | virtual bool operator==(const klass& rhs) const; \ | ^~~~~~~~ src/ast_selectors.hpp:157:5: note: in expansion of macro ‘ATTACH_CMP_OPERATIONS’ 157 | ATTACH_CMP_OPERATIONS(PlaceholderSelector) | ^~~~~~~~~~~~~~~~~~~~~ src/ast_selectors.hpp:135:18: warning: ‘virtual bool Sass::SimpleSelector::operator==(const Sass::SelectorList&) const’ was hidden [-Woverloaded-virtual=] 135 | virtual bool operator==(const SelectorList& rhs) const; | ^~~~~~~~ src/ast_def_macros.hpp:109:16: note: by ‘Sass::PlaceholderSelector::operator==’ 109 | virtual bool operator==(const klass& rhs) const; \ | ^~~~~~~~ src/ast_selectors.hpp:157:5: note: in expansion of macro ‘ATTACH_CMP_OPERATIONS’ 157 | ATTACH_CMP_OPERATIONS(PlaceholderSelector) | ^~~~~~~~~~~~~~~~~~~~~ src/ast_selectors.hpp:133:10: warning: ‘virtual bool Sass::SimpleSelector::operator==(const Sass::Selector&) const’ was hidden [-Woverloaded-virtual=] 133 | bool operator==(const Selector& rhs) const final override; | ^~~~~~~~ src/ast_def_macros.hpp:109:16: note: by ‘Sass::PlaceholderSelector::operator==’ 109 | virtual bool operator==(const klass& rhs) const; \ | ^~~~~~~~ src/ast_selectors.hpp:157:5: note: in expansion of macro ‘ATTACH_CMP_OPERATIONS’ 157 | ATTACH_CMP_OPERATIONS(PlaceholderSelector) | ^~~~~~~~~~~~~~~~~~~~~ src/ast_def_macros.hpp:106:16: warning: ‘virtual bool Sass::SimpleSelector::operator!=(const Sass::SimpleSelector&) const’ was hidden [-Woverloaded-virtual=] 106 | virtual bool operator!=(const klass& rhs) const { return !(*this == rhs); }; \ | ^~~~~~~~ src/ast_selectors.hpp:139:5: note: in expansion of macro ‘ATTACH_VIRTUAL_CMP_OPERATIONS’ 139 | ATTACH_VIRTUAL_CMP_OPERATIONS(SimpleSelector); | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~ src/ast_def_macros.hpp:110:16: note: by ‘virtual bool Sass::PlaceholderSelector::operator!=(const Sass::PlaceholderSelector&) const’ 110 | virtual bool operator!=(const klass& rhs) const { return !(*this == rhs); }; \ | ^~~~~~~~ src/ast_selectors.hpp:157:5: note: in expansion of macro ‘ATTACH_CMP_OPERATIONS’ 157 | ATTACH_CMP_OPERATIONS(PlaceholderSelector) | ^~~~~~~~~~~~~~~~~~~~~ src/ast_selectors.hpp:137:18: warning: ‘virtual bool Sass::SimpleSelector::operator==(const Sass::CompoundSelector&) const’ was hidden [-Woverloaded-virtual=] 137 | virtual bool operator==(const CompoundSelector& rhs) const; | ^~~~~~~~ src/ast_def_macros.hpp:109:16: note: by ‘Sass::TypeSelector::operator==’ 109 | virtual bool operator==(const klass& rhs) const; \ | ^~~~~~~~ src/ast_selectors.hpp:174:5: note: in expansion of macro ‘ATTACH_CMP_OPERATIONS’ 174 | ATTACH_CMP_OPERATIONS(TypeSelector) | ^~~~~~~~~~~~~~~~~~~~~ src/ast_selectors.hpp:136:18: warning: ‘virtual bool Sass::SimpleSelector::operator==(const Sass::ComplexSelector&) const’ was hidden [-Woverloaded-virtual=] 136 | virtual bool operator==(const ComplexSelector& rhs) const; | ^~~~~~~~ src/ast_def_macros.hpp:109:16: note: by ‘Sass::TypeSelector::operator==’ 109 | virtual bool operator==(const klass& rhs) const; \ | ^~~~~~~~ src/ast_selectors.hpp:174:5: note: in expansion of macro ‘ATTACH_CMP_OPERATIONS’ 174 | ATTACH_CMP_OPERATIONS(TypeSelector) | ^~~~~~~~~~~~~~~~~~~~~ src/ast_selectors.hpp:135:18: warning: ‘virtual bool Sass::SimpleSelector::operator==(const Sass::SelectorList&) const’ was hidden [-Woverloaded-virtual=] 135 | virtual bool operator==(const SelectorList& rhs) const; | ^~~~~~~~ src/ast_def_macros.hpp:109:16: note: by ‘Sass::TypeSelector::operator==’ 109 | virtual bool operator==(const klass& rhs) const; \ | ^~~~~~~~ src/ast_selectors.hpp:174:5: note: in expansion of macro ‘ATTACH_CMP_OPERATIONS’ 174 | ATTACH_CMP_OPERATIONS(TypeSelector) | ^~~~~~~~~~~~~~~~~~~~~ src/ast_selectors.hpp:133:10: warning: ‘virtual bool Sass::SimpleSelector::operator==(const Sass::Selector&) const’ was hidden [-Woverloaded-virtual=] 133 | bool operator==(const Selector& rhs) const final override; | ^~~~~~~~ src/ast_def_macros.hpp:109:16: note: by ‘Sass::TypeSelector::operator==’ 109 | virtual bool operator==(const klass& rhs) const; \ | ^~~~~~~~ src/ast_selectors.hpp:174:5: note: in expansion of macro ‘ATTACH_CMP_OPERATIONS’ 174 | ATTACH_CMP_OPERATIONS(TypeSelector) | ^~~~~~~~~~~~~~~~~~~~~ src/ast_def_macros.hpp:106:16: warning: ‘virtual bool Sass::SimpleSelector::operator!=(const Sass::SimpleSelector&) const’ was hidden [-Woverloaded-virtual=] 106 | virtual bool operator!=(const klass& rhs) const { return !(*this == rhs); }; \ | ^~~~~~~~ src/ast_selectors.hpp:139:5: note: in expansion of macro ‘ATTACH_VIRTUAL_CMP_OPERATIONS’ 139 | ATTACH_VIRTUAL_CMP_OPERATIONS(SimpleSelector); | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~ src/ast_def_macros.hpp:110:16: note: by ‘virtual bool Sass::TypeSelector::operator!=(const Sass::TypeSelector&) const’ 110 | virtual bool operator!=(const klass& rhs) const { return !(*this == rhs); }; \ | ^~~~~~~~ src/ast_selectors.hpp:174:5: note: in expansion of macro ‘ATTACH_CMP_OPERATIONS’ 174 | ATTACH_CMP_OPERATIONS(TypeSelector) | ^~~~~~~~~~~~~~~~~~~~~ src/ast_selectors.hpp:137:18: warning: ‘virtual bool Sass::SimpleSelector::operator==(const Sass::CompoundSelector&) const’ was hidden [-Woverloaded-virtual=] 137 | virtual bool operator==(const CompoundSelector& rhs) const; | ^~~~~~~~ src/ast_def_macros.hpp:109:16: note: by ‘Sass::ClassSelector::operator==’ 109 | virtual bool operator==(const klass& rhs) const; \ | ^~~~~~~~ src/ast_selectors.hpp:188:5: note: in expansion of macro ‘ATTACH_CMP_OPERATIONS’ 188 | ATTACH_CMP_OPERATIONS(ClassSelector) | ^~~~~~~~~~~~~~~~~~~~~ src/ast_selectors.hpp:136:18: warning: ‘virtual bool Sass::SimpleSelector::operator==(const Sass::ComplexSelector&) const’ was hidden [-Woverloaded-virtual=] 136 | virtual bool operator==(const ComplexSelector& rhs) const; | ^~~~~~~~ src/ast_def_macros.hpp:109:16: note: by ‘Sass::ClassSelector::operator==’ 109 | virtual bool operator==(const klass& rhs) const; \ | ^~~~~~~~ src/ast_selectors.hpp:188:5: note: in expansion of macro ‘ATTACH_CMP_OPERATIONS’ 188 | ATTACH_CMP_OPERATIONS(ClassSelector) | ^~~~~~~~~~~~~~~~~~~~~ src/ast_selectors.hpp:135:18: warning: ‘virtual bool Sass::SimpleSelector::operator==(const Sass::SelectorList&) const’ was hidden [-Woverloaded-virtual=] 135 | virtual bool operator==(const SelectorList& rhs) const; | ^~~~~~~~ src/ast_def_macros.hpp:109:16: note: by ‘Sass::ClassSelector::operator==’ 109 | virtual bool operator==(const klass& rhs) const; \ | ^~~~~~~~ src/ast_selectors.hpp:188:5: note: in expansion of macro ‘ATTACH_CMP_OPERATIONS’ 188 | ATTACH_CMP_OPERATIONS(ClassSelector) | ^~~~~~~~~~~~~~~~~~~~~ src/ast_selectors.hpp:133:10: warning: ‘virtual bool Sass::SimpleSelector::operator==(const Sass::Selector&) const’ was hidden [-Woverloaded-virtual=] 133 | bool operator==(const Selector& rhs) const final override; | ^~~~~~~~ src/ast_def_macros.hpp:109:16: note: by ‘Sass::ClassSelector::operator==’ 109 | virtual bool operator==(const klass& rhs) const; \ | ^~~~~~~~ src/ast_selectors.hpp:188:5: note: in expansion of macro ‘ATTACH_CMP_OPERATIONS’ 188 | ATTACH_CMP_OPERATIONS(ClassSelector) | ^~~~~~~~~~~~~~~~~~~~~ src/ast_def_macros.hpp:106:16: warning: ‘virtual bool Sass::SimpleSelector::operator!=(const Sass::SimpleSelector&) const’ was hidden [-Woverloaded-virtual=] 106 | virtual bool operator!=(const klass& rhs) const { return !(*this == rhs); }; \ | ^~~~~~~~ src/ast_selectors.hpp:139:5: note: in expansion of macro ‘ATTACH_VIRTUAL_CMP_OPERATIONS’ 139 | ATTACH_VIRTUAL_CMP_OPERATIONS(SimpleSelector); | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~ src/ast_def_macros.hpp:110:16: note: by ‘virtual bool Sass::ClassSelector::operator!=(const Sass::ClassSelector&) const’ 110 | virtual bool operator!=(const klass& rhs) const { return !(*this == rhs); }; \ | ^~~~~~~~ src/ast_selectors.hpp:188:5: note: in expansion of macro ‘ATTACH_CMP_OPERATIONS’ 188 | ATTACH_CMP_OPERATIONS(ClassSelector) | ^~~~~~~~~~~~~~~~~~~~~ src/ast_selectors.hpp:137:18: warning: ‘virtual bool Sass::SimpleSelector::operator==(const Sass::CompoundSelector&) const’ was hidden [-Woverloaded-virtual=] 137 | virtual bool operator==(const CompoundSelector& rhs) const; | ^~~~~~~~ src/ast_def_macros.hpp:109:16: note: by ‘Sass::IDSelector::operator==’ 109 | virtual bool operator==(const klass& rhs) const; \ | ^~~~~~~~ src/ast_selectors.hpp:204:5: note: in expansion of macro ‘ATTACH_CMP_OPERATIONS’ 204 | ATTACH_CMP_OPERATIONS(IDSelector) | ^~~~~~~~~~~~~~~~~~~~~ src/ast_selectors.hpp:136:18: warning: ‘virtual bool Sass::SimpleSelector::operator==(const Sass::ComplexSelector&) const’ was hidden [-Woverloaded-virtual=] 136 | virtual bool operator==(const ComplexSelector& rhs) const; | ^~~~~~~~ src/ast_def_macros.hpp:109:16: note: by ‘Sass::IDSelector::operator==’ 109 | virtual bool operator==(const klass& rhs) const; \ | ^~~~~~~~ src/ast_selectors.hpp:204:5: note: in expansion of macro ‘ATTACH_CMP_OPERATIONS’ 204 | ATTACH_CMP_OPERATIONS(IDSelector) | ^~~~~~~~~~~~~~~~~~~~~ src/ast_selectors.hpp:135:18: warning: ‘virtual bool Sass::SimpleSelector::operator==(const Sass::SelectorList&) const’ was hidden [-Woverloaded-virtual=] 135 | virtual bool operator==(const SelectorList& rhs) const; | ^~~~~~~~ src/ast_def_macros.hpp:109:16: note: by ‘Sass::IDSelector::operator==’ 109 | virtual bool operator==(const klass& rhs) const; \ | ^~~~~~~~ src/ast_selectors.hpp:204:5: note: in expansion of macro ‘ATTACH_CMP_OPERATIONS’ 204 | ATTACH_CMP_OPERATIONS(IDSelector) | ^~~~~~~~~~~~~~~~~~~~~ src/ast_selectors.hpp:133:10: warning: ‘virtual bool Sass::SimpleSelector::operator==(const Sass::Selector&) const’ was hidden [-Woverloaded-virtual=] 133 | bool operator==(const Selector& rhs) const final override; | ^~~~~~~~ src/ast_def_macros.hpp:109:16: note: by ‘Sass::IDSelector::operator==’ 109 | virtual bool operator==(const klass& rhs) const; \ | ^~~~~~~~ src/ast_selectors.hpp:204:5: note: in expansion of macro ‘ATTACH_CMP_OPERATIONS’ 204 | ATTACH_CMP_OPERATIONS(IDSelector) | ^~~~~~~~~~~~~~~~~~~~~ src/ast_def_macros.hpp:106:16: warning: ‘virtual bool Sass::SimpleSelector::operator!=(const Sass::SimpleSelector&) const’ was hidden [-Woverloaded-virtual=] 106 | virtual bool operator!=(const klass& rhs) const { return !(*this == rhs); }; \ | ^~~~~~~~ src/ast_selectors.hpp:139:5: note: in expansion of macro ‘ATTACH_VIRTUAL_CMP_OPERATIONS’ 139 | ATTACH_VIRTUAL_CMP_OPERATIONS(SimpleSelector); | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~ src/ast_def_macros.hpp:110:16: note: by ‘virtual bool Sass::IDSelector::operator!=(const Sass::IDSelector&) const’ 110 | virtual bool operator!=(const klass& rhs) const { return !(*this == rhs); }; \ | ^~~~~~~~ src/ast_selectors.hpp:204:5: note: in expansion of macro ‘ATTACH_CMP_OPERATIONS’ 204 | ATTACH_CMP_OPERATIONS(IDSelector) | ^~~~~~~~~~~~~~~~~~~~~ src/ast_selectors.hpp:137:18: warning: ‘virtual bool Sass::SimpleSelector::operator==(const Sass::CompoundSelector&) const’ was hidden [-Woverloaded-virtual=] 137 | virtual bool operator==(const CompoundSelector& rhs) const; | ^~~~~~~~ src/ast_def_macros.hpp:109:16: note: by ‘Sass::AttributeSelector::operator==’ 109 | virtual bool operator==(const klass& rhs) const; \ | ^~~~~~~~ src/ast_selectors.hpp:223:5: note: in expansion of macro ‘ATTACH_CMP_OPERATIONS’ 223 | ATTACH_CMP_OPERATIONS(AttributeSelector) | ^~~~~~~~~~~~~~~~~~~~~ src/ast_selectors.hpp:136:18: warning: ‘virtual bool Sass::SimpleSelector::operator==(const Sass::ComplexSelector&) const’ was hidden [-Woverloaded-virtual=] 136 | virtual bool operator==(const ComplexSelector& rhs) const; | ^~~~~~~~ src/ast_def_macros.hpp:109:16: note: by ‘Sass::AttributeSelector::operator==’ 109 | virtual bool operator==(const klass& rhs) const; \ | ^~~~~~~~ src/ast_selectors.hpp:223:5: note: in expansion of macro ‘ATTACH_CMP_OPERATIONS’ 223 | ATTACH_CMP_OPERATIONS(AttributeSelector) | ^~~~~~~~~~~~~~~~~~~~~ src/ast_selectors.hpp:135:18: warning: ‘virtual bool Sass::SimpleSelector::operator==(const Sass::SelectorList&) const’ was hidden [-Woverloaded-virtual=] 135 | virtual bool operator==(const SelectorList& rhs) const; | ^~~~~~~~ src/ast_def_macros.hpp:109:16: note: by ‘Sass::AttributeSelector::operator==’ 109 | virtual bool operator==(const klass& rhs) const; \ | ^~~~~~~~ src/ast_selectors.hpp:223:5: note: in expansion of macro ‘ATTACH_CMP_OPERATIONS’ 223 | ATTACH_CMP_OPERATIONS(AttributeSelector) | ^~~~~~~~~~~~~~~~~~~~~ src/ast_selectors.hpp:133:10: warning: ‘virtual bool Sass::SimpleSelector::operator==(const Sass::Selector&) const’ was hidden [-Woverloaded-virtual=] 133 | bool operator==(const Selector& rhs) const final override; | ^~~~~~~~ src/ast_def_macros.hpp:109:16: note: by ‘Sass::AttributeSelector::operator==’ 109 | virtual bool operator==(const klass& rhs) const; \ | ^~~~~~~~ src/ast_selectors.hpp:223:5: note: in expansion of macro ‘ATTACH_CMP_OPERATIONS’ 223 | ATTACH_CMP_OPERATIONS(AttributeSelector) | ^~~~~~~~~~~~~~~~~~~~~ src/ast_def_macros.hpp:106:16: warning: ‘virtual bool Sass::SimpleSelector::operator!=(const Sass::SimpleSelector&) const’ was hidden [-Woverloaded-virtual=] 106 | virtual bool operator!=(const klass& rhs) const { return !(*this == rhs); }; \ | ^~~~~~~~ src/ast_selectors.hpp:139:5: note: in expansion of macro ‘ATTACH_VIRTUAL_CMP_OPERATIONS’ 139 | ATTACH_VIRTUAL_CMP_OPERATIONS(SimpleSelector); | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~ src/ast_def_macros.hpp:110:16: note: by ‘virtual bool Sass::AttributeSelector::operator!=(const Sass::AttributeSelector&) const’ 110 | virtual bool operator!=(const klass& rhs) const { return !(*this == rhs); }; \ | ^~~~~~~~ src/ast_selectors.hpp:223:5: note: in expansion of macro ‘ATTACH_CMP_OPERATIONS’ 223 | ATTACH_CMP_OPERATIONS(AttributeSelector) | ^~~~~~~~~~~~~~~~~~~~~ src/ast_def_macros.hpp:106:16: warning: ‘virtual bool Sass::Selector::operator!=(const Sass::Selector&) const’ was hidden [-Woverloaded-virtual=] 106 | virtual bool operator!=(const klass& rhs) const { return !(*this == rhs); }; \ | ^~~~~~~~ src/ast_selectors.hpp:56:5: note: in expansion of macro ‘ATTACH_VIRTUAL_CMP_OPERATIONS’ 56 | ATTACH_VIRTUAL_CMP_OPERATIONS(Selector) | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~ src/ast_def_macros.hpp:110:16: note: by ‘virtual bool Sass::ComplexSelector::operator!=(const Sass::ComplexSelector&) const’ 110 | virtual bool operator!=(const klass& rhs) const { return !(*this == rhs); }; \ | ^~~~~~~~ src/ast_selectors.hpp:310:5: note: in expansion of macro ‘ATTACH_CMP_OPERATIONS’ 310 | ATTACH_CMP_OPERATIONS(ComplexSelector) | ^~~~~~~~~~~~~~~~~~~~~ src/ast_def_macros.hpp:106:16: warning: ‘virtual bool Sass::Selector::operator!=(const Sass::Selector&) const’ was hidden [-Woverloaded-virtual=] 106 | virtual bool operator!=(const klass& rhs) const { return !(*this == rhs); }; \ | ^~~~~~~~ src/ast_selectors.hpp:56:5: note: in expansion of macro ‘ATTACH_VIRTUAL_CMP_OPERATIONS’ 56 | ATTACH_VIRTUAL_CMP_OPERATIONS(Selector) | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~ src/ast_def_macros.hpp:106:16: note: by ‘virtual bool Sass::SelectorComponent::operator!=(const Sass::SelectorComponent&) const’ 106 | virtual bool operator!=(const klass& rhs) const { return !(*this == rhs); }; \ | ^~~~~~~~ src/ast_selectors.hpp:349:5: note: in expansion of macro ‘ATTACH_VIRTUAL_CMP_OPERATIONS’ 349 | ATTACH_VIRTUAL_CMP_OPERATIONS(SelectorComponent); | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~ src/ast_def_macros.hpp:106:16: warning: ‘virtual bool Sass::SelectorComponent::operator!=(const Sass::SelectorComponent&) const’ was hidden [-Woverloaded-virtual=] 106 | virtual bool operator!=(const klass& rhs) const { return !(*this == rhs); }; \ | ^~~~~~~~ src/ast_selectors.hpp:349:5: note: in expansion of macro ‘ATTACH_VIRTUAL_CMP_OPERATIONS’ 349 | ATTACH_VIRTUAL_CMP_OPERATIONS(SelectorComponent); | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~ src/ast_def_macros.hpp:110:16: note: by ‘virtual bool Sass::SelectorCombinator::operator!=(const Sass::SelectorCombinator&) const’ 110 | virtual bool operator!=(const klass& rhs) const { return !(*this == rhs); }; \ | ^~~~~~~~ src/ast_selectors.hpp:407:5: note: in expansion of macro ‘ATTACH_CMP_OPERATIONS’ 407 | ATTACH_CMP_OPERATIONS(SelectorCombinator) | ^~~~~~~~~~~~~~~~~~~~~ g++ -std=gnu++17 -Wall -O2 -std=c++11 -I ./include -fPIC -c -o src/prelexer.o src/prelexer.cpp g++ -std=gnu++17 -Wall -O2 -std=c++11 -I ./include -fPIC -c -o src/eval.o src/eval.cpp In file included from src/eval.hpp:7, from src/eval.cpp:13: src/ast.hpp:90:18: warning: ‘virtual bool Sass::AST_Node::operator==(const Sass::AST_Node&) const’ was hidden [-Woverloaded-virtual=] 90 | virtual bool operator== (const AST_Node& rhs) const { | ^~~~~~~~ src/ast.hpp:165:18: note: by ‘virtual bool Sass::Expression::operator==(const Sass::Expression&) const’ 165 | virtual bool operator== (const Expression& rhs) const { return false; } | ^~~~~~~~ src/ast.hpp:96:18: warning: ‘virtual bool Sass::AST_Node::operator!=(const Sass::AST_Node&) const’ was hidden [-Woverloaded-virtual=] 96 | virtual bool operator!= (const AST_Node& rhs) const { | ^~~~~~~~ src/ast.hpp:167:17: note: by ‘bool Sass::Expression::operator!=(const Sass::Expression&) const’ 167 | inline bool operator!=(const Expression& rhs) const { return !(rhs == *this); } | ^~~~~~~~ src/ast.hpp:90:18: warning: ‘virtual bool Sass::AST_Node::operator==(const Sass::AST_Node&) const’ was hidden [-Woverloaded-virtual=] 90 | virtual bool operator== (const AST_Node& rhs) const { | ^~~~~~~~ src/ast.hpp:908:10: note: by ‘bool Sass::CssMediaRule::operator==(const Sass::CssMediaRule&) const’ 908 | bool operator== (const CssMediaRule& rhs) const { | ^~~~~~~~ src/ast.hpp:96:18: warning: ‘virtual bool Sass::AST_Node::operator!=(const Sass::AST_Node&) const’ was hidden [-Woverloaded-virtual=] 96 | virtual bool operator!= (const AST_Node& rhs) const { | ^~~~~~~~ src/ast.hpp:911:10: note: by ‘bool Sass::CssMediaRule::operator!=(const Sass::CssMediaRule&) const’ 911 | bool operator!=(const CssMediaRule& rhs) const { | ^~~~~~~~ src/ast.hpp:90:18: warning: ‘virtual bool Sass::AST_Node::operator==(const Sass::AST_Node&) const’ was hidden [-Woverloaded-virtual=] 90 | virtual bool operator== (const AST_Node& rhs) const { | ^~~~~~~~ src/ast.hpp:939:10: note: by ‘bool Sass::CssMediaQuery::operator==(const Sass::CssMediaQuery&) const’ 939 | bool operator== (const CssMediaQuery& rhs) const; | ^~~~~~~~ src/ast.hpp:96:18: warning: ‘virtual bool Sass::AST_Node::operator!=(const Sass::AST_Node&) const’ was hidden [-Woverloaded-virtual=] 96 | virtual bool operator!= (const AST_Node& rhs) const { | ^~~~~~~~ src/ast.hpp:940:10: note: by ‘bool Sass::CssMediaQuery::operator!=(const Sass::CssMediaQuery&) const’ 940 | bool operator!=(const CssMediaQuery& rhs) const { | ^~~~~~~~ src/ast.hpp:165:18: warning: ‘virtual bool Sass::Expression::operator==(const Sass::Expression&) const’ was hidden [-Woverloaded-virtual=] 165 | virtual bool operator== (const Expression& rhs) const { return false; } | ^~~~~~~~ In file included from src/ast.hpp:14: src/ast_def_macros.hpp:105:16: note: by ‘virtual bool Sass::Selector::operator==(const Sass::Selector&) const’ 105 | virtual bool operator==(const klass& rhs) const = 0; \ | ^~~~~~~~ src/ast_selectors.hpp:56:5: note: in expansion of macro ‘ATTACH_VIRTUAL_CMP_OPERATIONS’ 56 | ATTACH_VIRTUAL_CMP_OPERATIONS(Selector) | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~ src/ast.hpp:96:18: warning: ‘virtual bool Sass::AST_Node::operator!=(const Sass::AST_Node&) const’ was hidden [-Woverloaded-virtual=] 96 | virtual bool operator!= (const AST_Node& rhs) const { | ^~~~~~~~ src/ast_def_macros.hpp:106:16: note: by ‘virtual bool Sass::Selector::operator!=(const Sass::Selector&) const’ 106 | virtual bool operator!=(const klass& rhs) const { return !(*this == rhs); }; \ | ^~~~~~~~ src/ast_selectors.hpp:56:5: note: in expansion of macro ‘ATTACH_VIRTUAL_CMP_OPERATIONS’ 56 | ATTACH_VIRTUAL_CMP_OPERATIONS(Selector) | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~ src/ast_def_macros.hpp:106:16: warning: ‘virtual bool Sass::Selector::operator!=(const Sass::Selector&) const’ was hidden [-Woverloaded-virtual=] 106 | virtual bool operator!=(const klass& rhs) const { return !(*this == rhs); }; \ | ^~~~~~~~ src/ast_selectors.hpp:56:5: note: in expansion of macro ‘ATTACH_VIRTUAL_CMP_OPERATIONS’ 56 | ATTACH_VIRTUAL_CMP_OPERATIONS(Selector) | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~ src/ast_def_macros.hpp:106:16: note: by ‘virtual bool Sass::SimpleSelector::operator!=(const Sass::SimpleSelector&) const’ 106 | virtual bool operator!=(const klass& rhs) const { return !(*this == rhs); }; \ | ^~~~~~~~ src/ast_selectors.hpp:139:5: note: in expansion of macro ‘ATTACH_VIRTUAL_CMP_OPERATIONS’ 139 | ATTACH_VIRTUAL_CMP_OPERATIONS(SimpleSelector); | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~ In file included from src/ast.hpp:1055: src/ast_selectors.hpp:137:18: warning: ‘virtual bool Sass::SimpleSelector::operator==(const Sass::CompoundSelector&) const’ was hidden [-Woverloaded-virtual=] 137 | virtual bool operator==(const CompoundSelector& rhs) const; | ^~~~~~~~ src/ast_def_macros.hpp:109:16: note: by ‘Sass::PlaceholderSelector::operator==’ 109 | virtual bool operator==(const klass& rhs) const; \ | ^~~~~~~~ src/ast_selectors.hpp:157:5: note: in expansion of macro ‘ATTACH_CMP_OPERATIONS’ 157 | ATTACH_CMP_OPERATIONS(PlaceholderSelector) | ^~~~~~~~~~~~~~~~~~~~~ src/ast_selectors.hpp:136:18: warning: ‘virtual bool Sass::SimpleSelector::operator==(const Sass::ComplexSelector&) const’ was hidden [-Woverloaded-virtual=] 136 | virtual bool operator==(const ComplexSelector& rhs) const; | ^~~~~~~~ src/ast_def_macros.hpp:109:16: note: by ‘Sass::PlaceholderSelector::operator==’ 109 | virtual bool operator==(const klass& rhs) const; \ | ^~~~~~~~ src/ast_selectors.hpp:157:5: note: in expansion of macro ‘ATTACH_CMP_OPERATIONS’ 157 | ATTACH_CMP_OPERATIONS(PlaceholderSelector) | ^~~~~~~~~~~~~~~~~~~~~ src/ast_selectors.hpp:135:18: warning: ‘virtual bool Sass::SimpleSelector::operator==(const Sass::SelectorList&) const’ was hidden [-Woverloaded-virtual=] 135 | virtual bool operator==(const SelectorList& rhs) const; | ^~~~~~~~ src/ast_def_macros.hpp:109:16: note: by ‘Sass::PlaceholderSelector::operator==’ 109 | virtual bool operator==(const klass& rhs) const; \ | ^~~~~~~~ src/ast_selectors.hpp:157:5: note: in expansion of macro ‘ATTACH_CMP_OPERATIONS’ 157 | ATTACH_CMP_OPERATIONS(PlaceholderSelector) | ^~~~~~~~~~~~~~~~~~~~~ src/ast_selectors.hpp:133:10: warning: ‘virtual bool Sass::SimpleSelector::operator==(const Sass::Selector&) const’ was hidden [-Woverloaded-virtual=] 133 | bool operator==(const Selector& rhs) const final override; | ^~~~~~~~ src/ast_def_macros.hpp:109:16: note: by ‘Sass::PlaceholderSelector::operator==’ 109 | virtual bool operator==(const klass& rhs) const; \ | ^~~~~~~~ src/ast_selectors.hpp:157:5: note: in expansion of macro ‘ATTACH_CMP_OPERATIONS’ 157 | ATTACH_CMP_OPERATIONS(PlaceholderSelector) | ^~~~~~~~~~~~~~~~~~~~~ src/ast_def_macros.hpp:106:16: warning: ‘virtual bool Sass::SimpleSelector::operator!=(const Sass::SimpleSelector&) const’ was hidden [-Woverloaded-virtual=] 106 | virtual bool operator!=(const klass& rhs) const { return !(*this == rhs); }; \ | ^~~~~~~~ src/ast_selectors.hpp:139:5: note: in expansion of macro ‘ATTACH_VIRTUAL_CMP_OPERATIONS’ 139 | ATTACH_VIRTUAL_CMP_OPERATIONS(SimpleSelector); | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~ src/ast_def_macros.hpp:110:16: note: by ‘virtual bool Sass::PlaceholderSelector::operator!=(const Sass::PlaceholderSelector&) const’ 110 | virtual bool operator!=(const klass& rhs) const { return !(*this == rhs); }; \ | ^~~~~~~~ src/ast_selectors.hpp:157:5: note: in expansion of macro ‘ATTACH_CMP_OPERATIONS’ 157 | ATTACH_CMP_OPERATIONS(PlaceholderSelector) | ^~~~~~~~~~~~~~~~~~~~~ src/ast_selectors.hpp:137:18: warning: ‘virtual bool Sass::SimpleSelector::operator==(const Sass::CompoundSelector&) const’ was hidden [-Woverloaded-virtual=] 137 | virtual bool operator==(const CompoundSelector& rhs) const; | ^~~~~~~~ src/ast_def_macros.hpp:109:16: note: by ‘Sass::TypeSelector::operator==’ 109 | virtual bool operator==(const klass& rhs) const; \ | ^~~~~~~~ src/ast_selectors.hpp:174:5: note: in expansion of macro ‘ATTACH_CMP_OPERATIONS’ 174 | ATTACH_CMP_OPERATIONS(TypeSelector) | ^~~~~~~~~~~~~~~~~~~~~ src/ast_selectors.hpp:136:18: warning: ‘virtual bool Sass::SimpleSelector::operator==(const Sass::ComplexSelector&) const’ was hidden [-Woverloaded-virtual=] 136 | virtual bool operator==(const ComplexSelector& rhs) const; | ^~~~~~~~ src/ast_def_macros.hpp:109:16: note: by ‘Sass::TypeSelector::operator==’ 109 | virtual bool operator==(const klass& rhs) const; \ | ^~~~~~~~ src/ast_selectors.hpp:174:5: note: in expansion of macro ‘ATTACH_CMP_OPERATIONS’ 174 | ATTACH_CMP_OPERATIONS(TypeSelector) | ^~~~~~~~~~~~~~~~~~~~~ src/ast_selectors.hpp:135:18: warning: ‘virtual bool Sass::SimpleSelector::operator==(const Sass::SelectorList&) const’ was hidden [-Woverloaded-virtual=] 135 | virtual bool operator==(const SelectorList& rhs) const; | ^~~~~~~~ src/ast_def_macros.hpp:109:16: note: by ‘Sass::TypeSelector::operator==’ 109 | virtual bool operator==(const klass& rhs) const; \ | ^~~~~~~~ src/ast_selectors.hpp:174:5: note: in expansion of macro ‘ATTACH_CMP_OPERATIONS’ 174 | ATTACH_CMP_OPERATIONS(TypeSelector) | ^~~~~~~~~~~~~~~~~~~~~ src/ast_selectors.hpp:133:10: warning: ‘virtual bool Sass::SimpleSelector::operator==(const Sass::Selector&) const’ was hidden [-Woverloaded-virtual=] 133 | bool operator==(const Selector& rhs) const final override; | ^~~~~~~~ src/ast_def_macros.hpp:109:16: note: by ‘Sass::TypeSelector::operator==’ 109 | virtual bool operator==(const klass& rhs) const; \ | ^~~~~~~~ src/ast_selectors.hpp:174:5: note: in expansion of macro ‘ATTACH_CMP_OPERATIONS’ 174 | ATTACH_CMP_OPERATIONS(TypeSelector) | ^~~~~~~~~~~~~~~~~~~~~ src/ast_def_macros.hpp:106:16: warning: ‘virtual bool Sass::SimpleSelector::operator!=(const Sass::SimpleSelector&) const’ was hidden [-Woverloaded-virtual=] 106 | virtual bool operator!=(const klass& rhs) const { return !(*this == rhs); }; \ | ^~~~~~~~ src/ast_selectors.hpp:139:5: note: in expansion of macro ‘ATTACH_VIRTUAL_CMP_OPERATIONS’ 139 | ATTACH_VIRTUAL_CMP_OPERATIONS(SimpleSelector); | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~ src/ast_def_macros.hpp:110:16: note: by ‘virtual bool Sass::TypeSelector::operator!=(const Sass::TypeSelector&) const’ 110 | virtual bool operator!=(const klass& rhs) const { return !(*this == rhs); }; \ | ^~~~~~~~ src/ast_selectors.hpp:174:5: note: in expansion of macro ‘ATTACH_CMP_OPERATIONS’ 174 | ATTACH_CMP_OPERATIONS(TypeSelector) | ^~~~~~~~~~~~~~~~~~~~~ src/ast_selectors.hpp:137:18: warning: ‘virtual bool Sass::SimpleSelector::operator==(const Sass::CompoundSelector&) const’ was hidden [-Woverloaded-virtual=] 137 | virtual bool operator==(const CompoundSelector& rhs) const; | ^~~~~~~~ src/ast_def_macros.hpp:109:16: note: by ‘Sass::ClassSelector::operator==’ 109 | virtual bool operator==(const klass& rhs) const; \ | ^~~~~~~~ src/ast_selectors.hpp:188:5: note: in expansion of macro ‘ATTACH_CMP_OPERATIONS’ 188 | ATTACH_CMP_OPERATIONS(ClassSelector) | ^~~~~~~~~~~~~~~~~~~~~ src/ast_selectors.hpp:136:18: warning: ‘virtual bool Sass::SimpleSelector::operator==(const Sass::ComplexSelector&) const’ was hidden [-Woverloaded-virtual=] 136 | virtual bool operator==(const ComplexSelector& rhs) const; | ^~~~~~~~ src/ast_def_macros.hpp:109:16: note: by ‘Sass::ClassSelector::operator==’ 109 | virtual bool operator==(const klass& rhs) const; \ | ^~~~~~~~ src/ast_selectors.hpp:188:5: note: in expansion of macro ‘ATTACH_CMP_OPERATIONS’ 188 | ATTACH_CMP_OPERATIONS(ClassSelector) | ^~~~~~~~~~~~~~~~~~~~~ src/ast_selectors.hpp:135:18: warning: ‘virtual bool Sass::SimpleSelector::operator==(const Sass::SelectorList&) const’ was hidden [-Woverloaded-virtual=] 135 | virtual bool operator==(const SelectorList& rhs) const; | ^~~~~~~~ src/ast_def_macros.hpp:109:16: note: by ‘Sass::ClassSelector::operator==’ 109 | virtual bool operator==(const klass& rhs) const; \ | ^~~~~~~~ src/ast_selectors.hpp:188:5: note: in expansion of macro ‘ATTACH_CMP_OPERATIONS’ 188 | ATTACH_CMP_OPERATIONS(ClassSelector) | ^~~~~~~~~~~~~~~~~~~~~ src/ast_selectors.hpp:133:10: warning: ‘virtual bool Sass::SimpleSelector::operator==(const Sass::Selector&) const’ was hidden [-Woverloaded-virtual=] 133 | bool operator==(const Selector& rhs) const final override; | ^~~~~~~~ src/ast_def_macros.hpp:109:16: note: by ‘Sass::ClassSelector::operator==’ 109 | virtual bool operator==(const klass& rhs) const; \ | ^~~~~~~~ src/ast_selectors.hpp:188:5: note: in expansion of macro ‘ATTACH_CMP_OPERATIONS’ 188 | ATTACH_CMP_OPERATIONS(ClassSelector) | ^~~~~~~~~~~~~~~~~~~~~ src/ast_def_macros.hpp:106:16: warning: ‘virtual bool Sass::SimpleSelector::operator!=(const Sass::SimpleSelector&) const’ was hidden [-Woverloaded-virtual=] 106 | virtual bool operator!=(const klass& rhs) const { return !(*this == rhs); }; \ | ^~~~~~~~ src/ast_selectors.hpp:139:5: note: in expansion of macro ‘ATTACH_VIRTUAL_CMP_OPERATIONS’ 139 | ATTACH_VIRTUAL_CMP_OPERATIONS(SimpleSelector); | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~ src/ast_def_macros.hpp:110:16: note: by ‘virtual bool Sass::ClassSelector::operator!=(const Sass::ClassSelector&) const’ 110 | virtual bool operator!=(const klass& rhs) const { return !(*this == rhs); }; \ | ^~~~~~~~ src/ast_selectors.hpp:188:5: note: in expansion of macro ‘ATTACH_CMP_OPERATIONS’ 188 | ATTACH_CMP_OPERATIONS(ClassSelector) | ^~~~~~~~~~~~~~~~~~~~~ src/ast_selectors.hpp:137:18: warning: ‘virtual bool Sass::SimpleSelector::operator==(const Sass::CompoundSelector&) const’ was hidden [-Woverloaded-virtual=] 137 | virtual bool operator==(const CompoundSelector& rhs) const; | ^~~~~~~~ src/ast_def_macros.hpp:109:16: note: by ‘Sass::IDSelector::operator==’ 109 | virtual bool operator==(const klass& rhs) const; \ | ^~~~~~~~ src/ast_selectors.hpp:204:5: note: in expansion of macro ‘ATTACH_CMP_OPERATIONS’ 204 | ATTACH_CMP_OPERATIONS(IDSelector) | ^~~~~~~~~~~~~~~~~~~~~ src/ast_selectors.hpp:136:18: warning: ‘virtual bool Sass::SimpleSelector::operator==(const Sass::ComplexSelector&) const’ was hidden [-Woverloaded-virtual=] 136 | virtual bool operator==(const ComplexSelector& rhs) const; | ^~~~~~~~ src/ast_def_macros.hpp:109:16: note: by ‘Sass::IDSelector::operator==’ 109 | virtual bool operator==(const klass& rhs) const; \ | ^~~~~~~~ src/ast_selectors.hpp:204:5: note: in expansion of macro ‘ATTACH_CMP_OPERATIONS’ 204 | ATTACH_CMP_OPERATIONS(IDSelector) | ^~~~~~~~~~~~~~~~~~~~~ src/ast_selectors.hpp:135:18: warning: ‘virtual bool Sass::SimpleSelector::operator==(const Sass::SelectorList&) const’ was hidden [-Woverloaded-virtual=] 135 | virtual bool operator==(const SelectorList& rhs) const; | ^~~~~~~~ src/ast_def_macros.hpp:109:16: note: by ‘Sass::IDSelector::operator==’ 109 | virtual bool operator==(const klass& rhs) const; \ | ^~~~~~~~ src/ast_selectors.hpp:204:5: note: in expansion of macro ‘ATTACH_CMP_OPERATIONS’ 204 | ATTACH_CMP_OPERATIONS(IDSelector) | ^~~~~~~~~~~~~~~~~~~~~ src/ast_selectors.hpp:133:10: warning: ‘virtual bool Sass::SimpleSelector::operator==(const Sass::Selector&) const’ was hidden [-Woverloaded-virtual=] 133 | bool operator==(const Selector& rhs) const final override; | ^~~~~~~~ src/ast_def_macros.hpp:109:16: note: by ‘Sass::IDSelector::operator==’ 109 | virtual bool operator==(const klass& rhs) const; \ | ^~~~~~~~ src/ast_selectors.hpp:204:5: note: in expansion of macro ‘ATTACH_CMP_OPERATIONS’ 204 | ATTACH_CMP_OPERATIONS(IDSelector) | ^~~~~~~~~~~~~~~~~~~~~ src/ast_def_macros.hpp:106:16: warning: ‘virtual bool Sass::SimpleSelector::operator!=(const Sass::SimpleSelector&) const’ was hidden [-Woverloaded-virtual=] 106 | virtual bool operator!=(const klass& rhs) const { return !(*this == rhs); }; \ | ^~~~~~~~ src/ast_selectors.hpp:139:5: note: in expansion of macro ‘ATTACH_VIRTUAL_CMP_OPERATIONS’ 139 | ATTACH_VIRTUAL_CMP_OPERATIONS(SimpleSelector); | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~ src/ast_def_macros.hpp:110:16: note: by ‘virtual bool Sass::IDSelector::operator!=(const Sass::IDSelector&) const’ 110 | virtual bool operator!=(const klass& rhs) const { return !(*this == rhs); }; \ | ^~~~~~~~ src/ast_selectors.hpp:204:5: note: in expansion of macro ‘ATTACH_CMP_OPERATIONS’ 204 | ATTACH_CMP_OPERATIONS(IDSelector) | ^~~~~~~~~~~~~~~~~~~~~ src/ast_selectors.hpp:137:18: warning: ‘virtual bool Sass::SimpleSelector::operator==(const Sass::CompoundSelector&) const’ was hidden [-Woverloaded-virtual=] 137 | virtual bool operator==(const CompoundSelector& rhs) const; | ^~~~~~~~ src/ast_def_macros.hpp:109:16: note: by ‘Sass::AttributeSelector::operator==’ 109 | virtual bool operator==(const klass& rhs) const; \ | ^~~~~~~~ src/ast_selectors.hpp:223:5: note: in expansion of macro ‘ATTACH_CMP_OPERATIONS’ 223 | ATTACH_CMP_OPERATIONS(AttributeSelector) | ^~~~~~~~~~~~~~~~~~~~~ src/ast_selectors.hpp:136:18: warning: ‘virtual bool Sass::SimpleSelector::operator==(const Sass::ComplexSelector&) const’ was hidden [-Woverloaded-virtual=] 136 | virtual bool operator==(const ComplexSelector& rhs) const; | ^~~~~~~~ src/ast_def_macros.hpp:109:16: note: by ‘Sass::AttributeSelector::operator==’ 109 | virtual bool operator==(const klass& rhs) const; \ | ^~~~~~~~ src/ast_selectors.hpp:223:5: note: in expansion of macro ‘ATTACH_CMP_OPERATIONS’ 223 | ATTACH_CMP_OPERATIONS(AttributeSelector) | ^~~~~~~~~~~~~~~~~~~~~ src/ast_selectors.hpp:135:18: warning: ‘virtual bool Sass::SimpleSelector::operator==(const Sass::SelectorList&) const’ was hidden [-Woverloaded-virtual=] 135 | virtual bool operator==(const SelectorList& rhs) const; | ^~~~~~~~ src/ast_def_macros.hpp:109:16: note: by ‘Sass::AttributeSelector::operator==’ 109 | virtual bool operator==(const klass& rhs) const; \ | ^~~~~~~~ src/ast_selectors.hpp:223:5: note: in expansion of macro ‘ATTACH_CMP_OPERATIONS’ 223 | ATTACH_CMP_OPERATIONS(AttributeSelector) | ^~~~~~~~~~~~~~~~~~~~~ src/ast_selectors.hpp:133:10: warning: ‘virtual bool Sass::SimpleSelector::operator==(const Sass::Selector&) const’ was hidden [-Woverloaded-virtual=] 133 | bool operator==(const Selector& rhs) const final override; | ^~~~~~~~ src/ast_def_macros.hpp:109:16: note: by ‘Sass::AttributeSelector::operator==’ 109 | virtual bool operator==(const klass& rhs) const; \ | ^~~~~~~~ src/ast_selectors.hpp:223:5: note: in expansion of macro ‘ATTACH_CMP_OPERATIONS’ 223 | ATTACH_CMP_OPERATIONS(AttributeSelector) | ^~~~~~~~~~~~~~~~~~~~~ src/ast_def_macros.hpp:106:16: warning: ‘virtual bool Sass::SimpleSelector::operator!=(const Sass::SimpleSelector&) const’ was hidden [-Woverloaded-virtual=] 106 | virtual bool operator!=(const klass& rhs) const { return !(*this == rhs); }; \ | ^~~~~~~~ src/ast_selectors.hpp:139:5: note: in expansion of macro ‘ATTACH_VIRTUAL_CMP_OPERATIONS’ 139 | ATTACH_VIRTUAL_CMP_OPERATIONS(SimpleSelector); | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~ src/ast_def_macros.hpp:110:16: note: by ‘virtual bool Sass::AttributeSelector::operator!=(const Sass::AttributeSelector&) const’ 110 | virtual bool operator!=(const klass& rhs) const { return !(*this == rhs); }; \ | ^~~~~~~~ src/ast_selectors.hpp:223:5: note: in expansion of macro ‘ATTACH_CMP_OPERATIONS’ 223 | ATTACH_CMP_OPERATIONS(AttributeSelector) | ^~~~~~~~~~~~~~~~~~~~~ src/ast_def_macros.hpp:106:16: warning: ‘virtual bool Sass::Selector::operator!=(const Sass::Selector&) const’ was hidden [-Woverloaded-virtual=] 106 | virtual bool operator!=(const klass& rhs) const { return !(*this == rhs); }; \ | ^~~~~~~~ src/ast_selectors.hpp:56:5: note: in expansion of macro ‘ATTACH_VIRTUAL_CMP_OPERATIONS’ 56 | ATTACH_VIRTUAL_CMP_OPERATIONS(Selector) | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~ src/ast_def_macros.hpp:110:16: note: by ‘virtual bool Sass::ComplexSelector::operator!=(const Sass::ComplexSelector&) const’ 110 | virtual bool operator!=(const klass& rhs) const { return !(*this == rhs); }; \ | ^~~~~~~~ src/ast_selectors.hpp:310:5: note: in expansion of macro ‘ATTACH_CMP_OPERATIONS’ 310 | ATTACH_CMP_OPERATIONS(ComplexSelector) | ^~~~~~~~~~~~~~~~~~~~~ src/ast_def_macros.hpp:106:16: warning: ‘virtual bool Sass::Selector::operator!=(const Sass::Selector&) const’ was hidden [-Woverloaded-virtual=] 106 | virtual bool operator!=(const klass& rhs) const { return !(*this == rhs); }; \ | ^~~~~~~~ src/ast_selectors.hpp:56:5: note: in expansion of macro ‘ATTACH_VIRTUAL_CMP_OPERATIONS’ 56 | ATTACH_VIRTUAL_CMP_OPERATIONS(Selector) | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~ src/ast_def_macros.hpp:106:16: note: by ‘virtual bool Sass::SelectorComponent::operator!=(const Sass::SelectorComponent&) const’ 106 | virtual bool operator!=(const klass& rhs) const { return !(*this == rhs); }; \ | ^~~~~~~~ src/ast_selectors.hpp:349:5: note: in expansion of macro ‘ATTACH_VIRTUAL_CMP_OPERATIONS’ 349 | ATTACH_VIRTUAL_CMP_OPERATIONS(SelectorComponent); | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~ src/ast_def_macros.hpp:106:16: warning: ‘virtual bool Sass::SelectorComponent::operator!=(const Sass::SelectorComponent&) const’ was hidden [-Woverloaded-virtual=] 106 | virtual bool operator!=(const klass& rhs) const { return !(*this == rhs); }; \ | ^~~~~~~~ src/ast_selectors.hpp:349:5: note: in expansion of macro ‘ATTACH_VIRTUAL_CMP_OPERATIONS’ 349 | ATTACH_VIRTUAL_CMP_OPERATIONS(SelectorComponent); | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~ src/ast_def_macros.hpp:110:16: note: by ‘virtual bool Sass::SelectorCombinator::operator!=(const Sass::SelectorCombinator&) const’ 110 | virtual bool operator!=(const klass& rhs) const { return !(*this == rhs); }; \ | ^~~~~~~~ src/ast_selectors.hpp:407:5: note: in expansion of macro ‘ATTACH_CMP_OPERATIONS’ 407 | ATTACH_CMP_OPERATIONS(SelectorCombinator) | ^~~~~~~~~~~~~~~~~~~~~ In file included from src/ast.hpp:18: src/operation.hpp:206:7: warning: ‘T Sass::Operation_CRTP::operator()(Sass::SelectorCombinator*) [with T = Sass::Expression*; D = Sass::Eval]’ was hidden [-Woverloaded-virtual=] 206 | T operator()(SelectorCombinator* x) { return static_cast(this)->fallback(x); } | ^~~~~~~~ src/eval.hpp:96:17: note: by ‘Sass::Eval::operator()’ 96 | Expression* operator()(Parent_Reference*); | ^~~~~~~~ src/operation.hpp:194:7: warning: ‘T Sass::Operation_CRTP::operator()(Sass::Parameters*) [with T = Sass::Expression*; D = Sass::Eval]’ was hidden [-Woverloaded-virtual=] 194 | T operator()(Parameters* x) { return static_cast(this)->fallback(x); } | ^~~~~~~~ src/eval.hpp:96:17: note: by ‘Sass::Eval::operator()’ 96 | Expression* operator()(Parent_Reference*); | ^~~~~~~~ src/operation.hpp:193:7: warning: ‘T Sass::Operation_CRTP::operator()(Sass::Parameter*) [with T = Sass::Expression*; D = Sass::Eval]’ was hidden [-Woverloaded-virtual=] 193 | T operator()(Parameter* x) { return static_cast(this)->fallback(x); } | ^~~~~~~~ src/eval.hpp:96:17: note: by ‘Sass::Eval::operator()’ 96 | Expression* operator()(Parent_Reference*); | ^~~~~~~~ src/operation.hpp:183:7: warning: ‘T Sass::Operation_CRTP::operator()(Sass::SupportsCondition*) [with T = Sass::Expression*; D = Sass::Eval]’ was hidden [-Woverloaded-virtual=] 183 | T operator()(SupportsCondition* x) { return static_cast(this)->fallback(x); } | ^~~~~~~~ src/eval.hpp:96:17: note: by ‘Sass::Eval::operator()’ 96 | Expression* operator()(Parent_Reference*); | ^~~~~~~~ src/operation.hpp:176:7: warning: ‘T Sass::Operation_CRTP::operator()(Sass::Color*) [with T = Sass::Expression*; D = Sass::Eval]’ was hidden [-Woverloaded-virtual=] 176 | T operator()(Color* x) { return static_cast(this)->fallback(x); } | ^~~~~~~~ src/eval.hpp:96:17: note: by ‘Sass::Eval::operator()’ 96 | Expression* operator()(Parent_Reference*); | ^~~~~~~~ src/operation.hpp:173:7: warning: ‘T Sass::Operation_CRTP::operator()(Sass::Custom_Error*) [with T = Sass::Expression*; D = Sass::Eval]’ was hidden [-Woverloaded-virtual=] 173 | T operator()(Custom_Error* x) { return static_cast(this)->fallback(x); } | ^~~~~~~~ src/eval.hpp:96:17: note: by ‘Sass::Eval::operator()’ 96 | Expression* operator()(Parent_Reference*); | ^~~~~~~~ src/operation.hpp:172:7: warning: ‘T Sass::Operation_CRTP::operator()(Sass::Custom_Warning*) [with T = Sass::Expression*; D = Sass::Eval]’ was hidden [-Woverloaded-virtual=] 172 | T operator()(Custom_Warning* x) { return static_cast(this)->fallback(x); } | ^~~~~~~~ src/eval.hpp:96:17: note: by ‘Sass::Eval::operator()’ 96 | Expression* operator()(Parent_Reference*); | ^~~~~~~~ src/operation.hpp:168:7: warning: ‘T Sass::Operation_CRTP::operator()(Sass::Function*) [with T = Sass::Expression*; D = Sass::Eval]’ was hidden [-Woverloaded-virtual=] 168 | T operator()(Function* x) { return static_cast(this)->fallback(x); } | ^~~~~~~~ src/eval.hpp:96:17: note: by ‘Sass::Eval::operator()’ 96 | Expression* operator()(Parent_Reference*); | ^~~~~~~~ src/operation.hpp:163:7: warning: ‘T Sass::Operation_CRTP::operator()(Sass::Mixin_Call*) [with T = Sass::Expression*; D = Sass::Eval]’ was hidden [-Woverloaded-virtual=] 163 | T operator()(Mixin_Call* x) { return static_cast(this)->fallback(x); } | ^~~~~~~~ src/eval.hpp:96:17: note: by ‘Sass::Eval::operator()’ 96 | Expression* operator()(Parent_Reference*); | ^~~~~~~~ src/operation.hpp:162:7: warning: ‘T Sass::Operation_CRTP::operator()(Sass::Definition*) [with T = Sass::Expression*; D = Sass::Eval]’ was hidden [-Woverloaded-virtual=] 162 | T operator()(Definition* x) { return static_cast(this)->fallback(x); } | ^~~~~~~~ src/eval.hpp:96:17: note: by ‘Sass::Eval::operator()’ 96 | Expression* operator()(Parent_Reference*); | ^~~~~~~~ src/operation.hpp:161:7: warning: ‘T Sass::Operation_CRTP::operator()(Sass::ExtendRule*) [with T = Sass::Expression*; D = Sass::Eval]’ was hidden [-Woverloaded-virtual=] 161 | T operator()(ExtendRule* x) { return static_cast(this)->fallback(x); } | ^~~~~~~~ src/eval.hpp:96:17: note: by ‘Sass::Eval::operator()’ 96 | Expression* operator()(Parent_Reference*); | ^~~~~~~~ src/operation.hpp:160:7: warning: ‘T Sass::Operation_CRTP::operator()(Sass::Content*) [with T = Sass::Expression*; D = Sass::Eval]’ was hidden [-Woverloaded-virtual=] 160 | T operator()(Content* x) { return static_cast(this)->fallback(x); } | ^~~~~~~~ src/eval.hpp:96:17: note: by ‘Sass::Eval::operator()’ 96 | Expression* operator()(Parent_Reference*); | ^~~~~~~~ src/operation.hpp:150:7: warning: ‘T Sass::Operation_CRTP::operator()(Sass::Import_Stub*) [with T = Sass::Expression*; D = Sass::Eval]’ was hidden [-Woverloaded-virtual=] 150 | T operator()(Import_Stub* x) { return static_cast(this)->fallback(x); } | ^~~~~~~~ src/eval.hpp:96:17: note: by ‘Sass::Eval::operator()’ 96 | Expression* operator()(Parent_Reference*); | ^~~~~~~~ src/operation.hpp:149:7: warning: ‘T Sass::Operation_CRTP::operator()(Sass::Import*) [with T = Sass::Expression*; D = Sass::Eval]’ was hidden [-Woverloaded-virtual=] 149 | T operator()(Import* x) { return static_cast(this)->fallback(x); } | ^~~~~~~~ src/eval.hpp:96:17: note: by ‘Sass::Eval::operator()’ 96 | Expression* operator()(Parent_Reference*); | ^~~~~~~~ src/operation.hpp:147:7: warning: ‘T Sass::Operation_CRTP::operator()(Sass::Declaration*) [with T = Sass::Expression*; D = Sass::Eval]’ was hidden [-Woverloaded-virtual=] 147 | T operator()(Declaration* x) { return static_cast(this)->fallback(x); } | ^~~~~~~~ src/eval.hpp:96:17: note: by ‘Sass::Eval::operator()’ 96 | Expression* operator()(Parent_Reference*); | ^~~~~~~~ src/operation.hpp:146:7: warning: ‘T Sass::Operation_CRTP::operator()(Sass::Keyframe_Rule*) [with T = Sass::Expression*; D = Sass::Eval]’ was hidden [-Woverloaded-virtual=] 146 | T operator()(Keyframe_Rule* x) { return static_cast(this)->fallback(x); } | ^~~~~~~~ src/eval.hpp:96:17: note: by ‘Sass::Eval::operator()’ 96 | Expression* operator()(Parent_Reference*); | ^~~~~~~~ src/operation.hpp:145:7: warning: ‘T Sass::Operation_CRTP::operator()(Sass::AtRule*) [with T = Sass::Expression*; D = Sass::Eval]’ was hidden [-Woverloaded-virtual=] 145 | T operator()(AtRule* x) { return static_cast(this)->fallback(x); } | ^~~~~~~~ src/eval.hpp:96:17: note: by ‘Sass::Eval::operator()’ 96 | Expression* operator()(Parent_Reference*); | ^~~~~~~~ src/operation.hpp:144:7: warning: ‘T Sass::Operation_CRTP::operator()(Sass::AtRootRule*) [with T = Sass::Expression*; D = Sass::Eval]’ was hidden [-Woverloaded-virtual=] 144 | T operator()(AtRootRule* x) { return static_cast(this)->fallback(x); } | ^~~~~~~~ src/eval.hpp:96:17: note: by ‘Sass::Eval::operator()’ 96 | Expression* operator()(Parent_Reference*); | ^~~~~~~~ src/operation.hpp:143:7: warning: ‘T Sass::Operation_CRTP::operator()(Sass::CssMediaQuery*) [with T = Sass::Expression*; D = Sass::Eval]’ was hidden [-Woverloaded-virtual=] 143 | T operator()(CssMediaQuery* x) { return static_cast(this)->fallback(x); } | ^~~~~~~~ src/eval.hpp:96:17: note: by ‘Sass::Eval::operator()’ 96 | Expression* operator()(Parent_Reference*); | ^~~~~~~~ src/operation.hpp:142:7: warning: ‘T Sass::Operation_CRTP::operator()(Sass::CssMediaRule*) [with T = Sass::Expression*; D = Sass::Eval]’ was hidden [-Woverloaded-virtual=] 142 | T operator()(CssMediaRule* x) { return static_cast(this)->fallback(x); } | ^~~~~~~~ src/eval.hpp:96:17: note: by ‘Sass::Eval::operator()’ 96 | Expression* operator()(Parent_Reference*); | ^~~~~~~~ src/operation.hpp:141:7: warning: ‘T Sass::Operation_CRTP::operator()(Sass::MediaRule*) [with T = Sass::Expression*; D = Sass::Eval]’ was hidden [-Woverloaded-virtual=] 141 | T operator()(MediaRule* x) { return static_cast(this)->fallback(x); } | ^~~~~~~~ src/eval.hpp:96:17: note: by ‘Sass::Eval::operator()’ 96 | Expression* operator()(Parent_Reference*); | ^~~~~~~~ src/operation.hpp:140:7: warning: ‘T Sass::Operation_CRTP::operator()(Sass::SupportsRule*) [with T = Sass::Expression*; D = Sass::Eval]’ was hidden [-Woverloaded-virtual=] 140 | T operator()(SupportsRule* x) { return static_cast(this)->fallback(x); } | ^~~~~~~~ src/eval.hpp:96:17: note: by ‘Sass::Eval::operator()’ 96 | Expression* operator()(Parent_Reference*); | ^~~~~~~~ src/operation.hpp:139:7: warning: ‘T Sass::Operation_CRTP::operator()(Sass::Trace*) [with T = Sass::Expression*; D = Sass::Eval]’ was hidden [-Woverloaded-virtual=] 139 | T operator()(Trace* x) { return static_cast(this)->fallback(x); } | ^~~~~~~~ src/eval.hpp:96:17: note: by ‘Sass::Eval::operator()’ 96 | Expression* operator()(Parent_Reference*); | ^~~~~~~~ src/operation.hpp:138:7: warning: ‘T Sass::Operation_CRTP::operator()(Sass::Bubble*) [with T = Sass::Expression*; D = Sass::Eval]’ was hidden [-Woverloaded-virtual=] 138 | T operator()(Bubble* x) { return static_cast(this)->fallback(x); } | ^~~~~~~~ src/eval.hpp:96:17: note: by ‘Sass::Eval::operator()’ 96 | Expression* operator()(Parent_Reference*); | ^~~~~~~~ src/operation.hpp:137:7: warning: ‘T Sass::Operation_CRTP::operator()(Sass::StyleRule*) [with T = Sass::Expression*; D = Sass::Eval]’ was hidden [-Woverloaded-virtual=] 137 | T operator()(StyleRule* x) { return static_cast(this)->fallback(x); } | ^~~~~~~~ src/eval.hpp:96:17: note: by ‘Sass::Eval::operator()’ 96 | Expression* operator()(Parent_Reference*); | ^~~~~~~~ src/operation.hpp:134:7: warning: ‘T Sass::Operation_CRTP::operator()(Sass::AST_Node*) [with T = Sass::Expression*; D = Sass::Eval]’ was hidden [-Woverloaded-virtual=] 134 | T operator()(AST_Node* x) { return static_cast(this)->fallback(x); } | ^~~~~~~~ src/eval.hpp:96:17: note: by ‘Sass::Eval::operator()’ 96 | Expression* operator()(Parent_Reference*); | ^~~~~~~~ g++ -std=gnu++17 -Wall -O2 -std=c++11 -I ./include -fPIC -c -o src/eval_selectors.o src/eval_selectors.cpp In file included from src/expand.hpp:6, from src/eval_selectors.cpp:4: src/ast.hpp:90:18: warning: ‘virtual bool Sass::AST_Node::operator==(const Sass::AST_Node&) const’ was hidden [-Woverloaded-virtual=] 90 | virtual bool operator== (const AST_Node& rhs) const { | ^~~~~~~~ src/ast.hpp:165:18: note: by ‘virtual bool Sass::Expression::operator==(const Sass::Expression&) const’ 165 | virtual bool operator== (const Expression& rhs) const { return false; } | ^~~~~~~~ src/ast.hpp:96:18: warning: ‘virtual bool Sass::AST_Node::operator!=(const Sass::AST_Node&) const’ was hidden [-Woverloaded-virtual=] 96 | virtual bool operator!= (const AST_Node& rhs) const { | ^~~~~~~~ src/ast.hpp:167:17: note: by ‘bool Sass::Expression::operator!=(const Sass::Expression&) const’ 167 | inline bool operator!=(const Expression& rhs) const { return !(rhs == *this); } | ^~~~~~~~ src/ast.hpp:90:18: warning: ‘virtual bool Sass::AST_Node::operator==(const Sass::AST_Node&) const’ was hidden [-Woverloaded-virtual=] 90 | virtual bool operator== (const AST_Node& rhs) const { | ^~~~~~~~ src/ast.hpp:908:10: note: by ‘bool Sass::CssMediaRule::operator==(const Sass::CssMediaRule&) const’ 908 | bool operator== (const CssMediaRule& rhs) const { | ^~~~~~~~ src/ast.hpp:96:18: warning: ‘virtual bool Sass::AST_Node::operator!=(const Sass::AST_Node&) const’ was hidden [-Woverloaded-virtual=] 96 | virtual bool operator!= (const AST_Node& rhs) const { | ^~~~~~~~ src/ast.hpp:911:10: note: by ‘bool Sass::CssMediaRule::operator!=(const Sass::CssMediaRule&) const’ 911 | bool operator!=(const CssMediaRule& rhs) const { | ^~~~~~~~ src/ast.hpp:90:18: warning: ‘virtual bool Sass::AST_Node::operator==(const Sass::AST_Node&) const’ was hidden [-Woverloaded-virtual=] 90 | virtual bool operator== (const AST_Node& rhs) const { | ^~~~~~~~ src/ast.hpp:939:10: note: by ‘bool Sass::CssMediaQuery::operator==(const Sass::CssMediaQuery&) const’ 939 | bool operator== (const CssMediaQuery& rhs) const; | ^~~~~~~~ src/ast.hpp:96:18: warning: ‘virtual bool Sass::AST_Node::operator!=(const Sass::AST_Node&) const’ was hidden [-Woverloaded-virtual=] 96 | virtual bool operator!= (const AST_Node& rhs) const { | ^~~~~~~~ src/ast.hpp:940:10: note: by ‘bool Sass::CssMediaQuery::operator!=(const Sass::CssMediaQuery&) const’ 940 | bool operator!=(const CssMediaQuery& rhs) const { | ^~~~~~~~ src/ast.hpp:165:18: warning: ‘virtual bool Sass::Expression::operator==(const Sass::Expression&) const’ was hidden [-Woverloaded-virtual=] 165 | virtual bool operator== (const Expression& rhs) const { return false; } | ^~~~~~~~ In file included from src/ast.hpp:14: src/ast_def_macros.hpp:105:16: note: by ‘virtual bool Sass::Selector::operator==(const Sass::Selector&) const’ 105 | virtual bool operator==(const klass& rhs) const = 0; \ | ^~~~~~~~ src/ast_selectors.hpp:56:5: note: in expansion of macro ‘ATTACH_VIRTUAL_CMP_OPERATIONS’ 56 | ATTACH_VIRTUAL_CMP_OPERATIONS(Selector) | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~ src/ast.hpp:96:18: warning: ‘virtual bool Sass::AST_Node::operator!=(const Sass::AST_Node&) const’ was hidden [-Woverloaded-virtual=] 96 | virtual bool operator!= (const AST_Node& rhs) const { | ^~~~~~~~ src/ast_def_macros.hpp:106:16: note: by ‘virtual bool Sass::Selector::operator!=(const Sass::Selector&) const’ 106 | virtual bool operator!=(const klass& rhs) const { return !(*this == rhs); }; \ | ^~~~~~~~ src/ast_selectors.hpp:56:5: note: in expansion of macro ‘ATTACH_VIRTUAL_CMP_OPERATIONS’ 56 | ATTACH_VIRTUAL_CMP_OPERATIONS(Selector) | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~ src/ast_def_macros.hpp:106:16: warning: ‘virtual bool Sass::Selector::operator!=(const Sass::Selector&) const’ was hidden [-Woverloaded-virtual=] 106 | virtual bool operator!=(const klass& rhs) const { return !(*this == rhs); }; \ | ^~~~~~~~ src/ast_selectors.hpp:56:5: note: in expansion of macro ‘ATTACH_VIRTUAL_CMP_OPERATIONS’ 56 | ATTACH_VIRTUAL_CMP_OPERATIONS(Selector) | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~ src/ast_def_macros.hpp:106:16: note: by ‘virtual bool Sass::SimpleSelector::operator!=(const Sass::SimpleSelector&) const’ 106 | virtual bool operator!=(const klass& rhs) const { return !(*this == rhs); }; \ | ^~~~~~~~ src/ast_selectors.hpp:139:5: note: in expansion of macro ‘ATTACH_VIRTUAL_CMP_OPERATIONS’ 139 | ATTACH_VIRTUAL_CMP_OPERATIONS(SimpleSelector); | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~ In file included from src/ast.hpp:1055: src/ast_selectors.hpp:137:18: warning: ‘virtual bool Sass::SimpleSelector::operator==(const Sass::CompoundSelector&) const’ was hidden [-Woverloaded-virtual=] 137 | virtual bool operator==(const CompoundSelector& rhs) const; | ^~~~~~~~ src/ast_def_macros.hpp:109:16: note: by ‘Sass::PlaceholderSelector::operator==’ 109 | virtual bool operator==(const klass& rhs) const; \ | ^~~~~~~~ src/ast_selectors.hpp:157:5: note: in expansion of macro ‘ATTACH_CMP_OPERATIONS’ 157 | ATTACH_CMP_OPERATIONS(PlaceholderSelector) | ^~~~~~~~~~~~~~~~~~~~~ src/ast_selectors.hpp:136:18: warning: ‘virtual bool Sass::SimpleSelector::operator==(const Sass::ComplexSelector&) const’ was hidden [-Woverloaded-virtual=] 136 | virtual bool operator==(const ComplexSelector& rhs) const; | ^~~~~~~~ src/ast_def_macros.hpp:109:16: note: by ‘Sass::PlaceholderSelector::operator==’ 109 | virtual bool operator==(const klass& rhs) const; \ | ^~~~~~~~ src/ast_selectors.hpp:157:5: note: in expansion of macro ‘ATTACH_CMP_OPERATIONS’ 157 | ATTACH_CMP_OPERATIONS(PlaceholderSelector) | ^~~~~~~~~~~~~~~~~~~~~ src/ast_selectors.hpp:135:18: warning: ‘virtual bool Sass::SimpleSelector::operator==(const Sass::SelectorList&) const’ was hidden [-Woverloaded-virtual=] 135 | virtual bool operator==(const SelectorList& rhs) const; | ^~~~~~~~ src/ast_def_macros.hpp:109:16: note: by ‘Sass::PlaceholderSelector::operator==’ 109 | virtual bool operator==(const klass& rhs) const; \ | ^~~~~~~~ src/ast_selectors.hpp:157:5: note: in expansion of macro ‘ATTACH_CMP_OPERATIONS’ 157 | ATTACH_CMP_OPERATIONS(PlaceholderSelector) | ^~~~~~~~~~~~~~~~~~~~~ src/ast_selectors.hpp:133:10: warning: ‘virtual bool Sass::SimpleSelector::operator==(const Sass::Selector&) const’ was hidden [-Woverloaded-virtual=] 133 | bool operator==(const Selector& rhs) const final override; | ^~~~~~~~ src/ast_def_macros.hpp:109:16: note: by ‘Sass::PlaceholderSelector::operator==’ 109 | virtual bool operator==(const klass& rhs) const; \ | ^~~~~~~~ src/ast_selectors.hpp:157:5: note: in expansion of macro ‘ATTACH_CMP_OPERATIONS’ 157 | ATTACH_CMP_OPERATIONS(PlaceholderSelector) | ^~~~~~~~~~~~~~~~~~~~~ src/ast_def_macros.hpp:106:16: warning: ‘virtual bool Sass::SimpleSelector::operator!=(const Sass::SimpleSelector&) const’ was hidden [-Woverloaded-virtual=] 106 | virtual bool operator!=(const klass& rhs) const { return !(*this == rhs); }; \ | ^~~~~~~~ src/ast_selectors.hpp:139:5: note: in expansion of macro ‘ATTACH_VIRTUAL_CMP_OPERATIONS’ 139 | ATTACH_VIRTUAL_CMP_OPERATIONS(SimpleSelector); | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~ src/ast_def_macros.hpp:110:16: note: by ‘virtual bool Sass::PlaceholderSelector::operator!=(const Sass::PlaceholderSelector&) const’ 110 | virtual bool operator!=(const klass& rhs) const { return !(*this == rhs); }; \ | ^~~~~~~~ src/ast_selectors.hpp:157:5: note: in expansion of macro ‘ATTACH_CMP_OPERATIONS’ 157 | ATTACH_CMP_OPERATIONS(PlaceholderSelector) | ^~~~~~~~~~~~~~~~~~~~~ src/ast_selectors.hpp:137:18: warning: ‘virtual bool Sass::SimpleSelector::operator==(const Sass::CompoundSelector&) const’ was hidden [-Woverloaded-virtual=] 137 | virtual bool operator==(const CompoundSelector& rhs) const; | ^~~~~~~~ src/ast_def_macros.hpp:109:16: note: by ‘Sass::TypeSelector::operator==’ 109 | virtual bool operator==(const klass& rhs) const; \ | ^~~~~~~~ src/ast_selectors.hpp:174:5: note: in expansion of macro ‘ATTACH_CMP_OPERATIONS’ 174 | ATTACH_CMP_OPERATIONS(TypeSelector) | ^~~~~~~~~~~~~~~~~~~~~ src/ast_selectors.hpp:136:18: warning: ‘virtual bool Sass::SimpleSelector::operator==(const Sass::ComplexSelector&) const’ was hidden [-Woverloaded-virtual=] 136 | virtual bool operator==(const ComplexSelector& rhs) const; | ^~~~~~~~ src/ast_def_macros.hpp:109:16: note: by ‘Sass::TypeSelector::operator==’ 109 | virtual bool operator==(const klass& rhs) const; \ | ^~~~~~~~ src/ast_selectors.hpp:174:5: note: in expansion of macro ‘ATTACH_CMP_OPERATIONS’ 174 | ATTACH_CMP_OPERATIONS(TypeSelector) | ^~~~~~~~~~~~~~~~~~~~~ src/ast_selectors.hpp:135:18: warning: ‘virtual bool Sass::SimpleSelector::operator==(const Sass::SelectorList&) const’ was hidden [-Woverloaded-virtual=] 135 | virtual bool operator==(const SelectorList& rhs) const; | ^~~~~~~~ src/ast_def_macros.hpp:109:16: note: by ‘Sass::TypeSelector::operator==’ 109 | virtual bool operator==(const klass& rhs) const; \ | ^~~~~~~~ src/ast_selectors.hpp:174:5: note: in expansion of macro ‘ATTACH_CMP_OPERATIONS’ 174 | ATTACH_CMP_OPERATIONS(TypeSelector) | ^~~~~~~~~~~~~~~~~~~~~ src/ast_selectors.hpp:133:10: warning: ‘virtual bool Sass::SimpleSelector::operator==(const Sass::Selector&) const’ was hidden [-Woverloaded-virtual=] 133 | bool operator==(const Selector& rhs) const final override; | ^~~~~~~~ src/ast_def_macros.hpp:109:16: note: by ‘Sass::TypeSelector::operator==’ 109 | virtual bool operator==(const klass& rhs) const; \ | ^~~~~~~~ src/ast_selectors.hpp:174:5: note: in expansion of macro ‘ATTACH_CMP_OPERATIONS’ 174 | ATTACH_CMP_OPERATIONS(TypeSelector) | ^~~~~~~~~~~~~~~~~~~~~ src/ast_def_macros.hpp:106:16: warning: ‘virtual bool Sass::SimpleSelector::operator!=(const Sass::SimpleSelector&) const’ was hidden [-Woverloaded-virtual=] 106 | virtual bool operator!=(const klass& rhs) const { return !(*this == rhs); }; \ | ^~~~~~~~ src/ast_selectors.hpp:139:5: note: in expansion of macro ‘ATTACH_VIRTUAL_CMP_OPERATIONS’ 139 | ATTACH_VIRTUAL_CMP_OPERATIONS(SimpleSelector); | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~ src/ast_def_macros.hpp:110:16: note: by ‘virtual bool Sass::TypeSelector::operator!=(const Sass::TypeSelector&) const’ 110 | virtual bool operator!=(const klass& rhs) const { return !(*this == rhs); }; \ | ^~~~~~~~ src/ast_selectors.hpp:174:5: note: in expansion of macro ‘ATTACH_CMP_OPERATIONS’ 174 | ATTACH_CMP_OPERATIONS(TypeSelector) | ^~~~~~~~~~~~~~~~~~~~~ src/ast_selectors.hpp:137:18: warning: ‘virtual bool Sass::SimpleSelector::operator==(const Sass::CompoundSelector&) const’ was hidden [-Woverloaded-virtual=] 137 | virtual bool operator==(const CompoundSelector& rhs) const; | ^~~~~~~~ src/ast_def_macros.hpp:109:16: note: by ‘Sass::ClassSelector::operator==’ 109 | virtual bool operator==(const klass& rhs) const; \ | ^~~~~~~~ src/ast_selectors.hpp:188:5: note: in expansion of macro ‘ATTACH_CMP_OPERATIONS’ 188 | ATTACH_CMP_OPERATIONS(ClassSelector) | ^~~~~~~~~~~~~~~~~~~~~ src/ast_selectors.hpp:136:18: warning: ‘virtual bool Sass::SimpleSelector::operator==(const Sass::ComplexSelector&) const’ was hidden [-Woverloaded-virtual=] 136 | virtual bool operator==(const ComplexSelector& rhs) const; | ^~~~~~~~ src/ast_def_macros.hpp:109:16: note: by ‘Sass::ClassSelector::operator==’ 109 | virtual bool operator==(const klass& rhs) const; \ | ^~~~~~~~ src/ast_selectors.hpp:188:5: note: in expansion of macro ‘ATTACH_CMP_OPERATIONS’ 188 | ATTACH_CMP_OPERATIONS(ClassSelector) | ^~~~~~~~~~~~~~~~~~~~~ src/ast_selectors.hpp:135:18: warning: ‘virtual bool Sass::SimpleSelector::operator==(const Sass::SelectorList&) const’ was hidden [-Woverloaded-virtual=] 135 | virtual bool operator==(const SelectorList& rhs) const; | ^~~~~~~~ src/ast_def_macros.hpp:109:16: note: by ‘Sass::ClassSelector::operator==’ 109 | virtual bool operator==(const klass& rhs) const; \ | ^~~~~~~~ src/ast_selectors.hpp:188:5: note: in expansion of macro ‘ATTACH_CMP_OPERATIONS’ 188 | ATTACH_CMP_OPERATIONS(ClassSelector) | ^~~~~~~~~~~~~~~~~~~~~ src/ast_selectors.hpp:133:10: warning: ‘virtual bool Sass::SimpleSelector::operator==(const Sass::Selector&) const’ was hidden [-Woverloaded-virtual=] 133 | bool operator==(const Selector& rhs) const final override; | ^~~~~~~~ src/ast_def_macros.hpp:109:16: note: by ‘Sass::ClassSelector::operator==’ 109 | virtual bool operator==(const klass& rhs) const; \ | ^~~~~~~~ src/ast_selectors.hpp:188:5: note: in expansion of macro ‘ATTACH_CMP_OPERATIONS’ 188 | ATTACH_CMP_OPERATIONS(ClassSelector) | ^~~~~~~~~~~~~~~~~~~~~ src/ast_def_macros.hpp:106:16: warning: ‘virtual bool Sass::SimpleSelector::operator!=(const Sass::SimpleSelector&) const’ was hidden [-Woverloaded-virtual=] 106 | virtual bool operator!=(const klass& rhs) const { return !(*this == rhs); }; \ | ^~~~~~~~ src/ast_selectors.hpp:139:5: note: in expansion of macro ‘ATTACH_VIRTUAL_CMP_OPERATIONS’ 139 | ATTACH_VIRTUAL_CMP_OPERATIONS(SimpleSelector); | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~ src/ast_def_macros.hpp:110:16: note: by ‘virtual bool Sass::ClassSelector::operator!=(const Sass::ClassSelector&) const’ 110 | virtual bool operator!=(const klass& rhs) const { return !(*this == rhs); }; \ | ^~~~~~~~ src/ast_selectors.hpp:188:5: note: in expansion of macro ‘ATTACH_CMP_OPERATIONS’ 188 | ATTACH_CMP_OPERATIONS(ClassSelector) | ^~~~~~~~~~~~~~~~~~~~~ src/ast_selectors.hpp:137:18: warning: ‘virtual bool Sass::SimpleSelector::operator==(const Sass::CompoundSelector&) const’ was hidden [-Woverloaded-virtual=] 137 | virtual bool operator==(const CompoundSelector& rhs) const; | ^~~~~~~~ src/ast_def_macros.hpp:109:16: note: by ‘Sass::IDSelector::operator==’ 109 | virtual bool operator==(const klass& rhs) const; \ | ^~~~~~~~ src/ast_selectors.hpp:204:5: note: in expansion of macro ‘ATTACH_CMP_OPERATIONS’ 204 | ATTACH_CMP_OPERATIONS(IDSelector) | ^~~~~~~~~~~~~~~~~~~~~ src/ast_selectors.hpp:136:18: warning: ‘virtual bool Sass::SimpleSelector::operator==(const Sass::ComplexSelector&) const’ was hidden [-Woverloaded-virtual=] 136 | virtual bool operator==(const ComplexSelector& rhs) const; | ^~~~~~~~ src/ast_def_macros.hpp:109:16: note: by ‘Sass::IDSelector::operator==’ 109 | virtual bool operator==(const klass& rhs) const; \ | ^~~~~~~~ src/ast_selectors.hpp:204:5: note: in expansion of macro ‘ATTACH_CMP_OPERATIONS’ 204 | ATTACH_CMP_OPERATIONS(IDSelector) | ^~~~~~~~~~~~~~~~~~~~~ src/ast_selectors.hpp:135:18: warning: ‘virtual bool Sass::SimpleSelector::operator==(const Sass::SelectorList&) const’ was hidden [-Woverloaded-virtual=] 135 | virtual bool operator==(const SelectorList& rhs) const; | ^~~~~~~~ src/ast_def_macros.hpp:109:16: note: by ‘Sass::IDSelector::operator==’ 109 | virtual bool operator==(const klass& rhs) const; \ | ^~~~~~~~ src/ast_selectors.hpp:204:5: note: in expansion of macro ‘ATTACH_CMP_OPERATIONS’ 204 | ATTACH_CMP_OPERATIONS(IDSelector) | ^~~~~~~~~~~~~~~~~~~~~ src/ast_selectors.hpp:133:10: warning: ‘virtual bool Sass::SimpleSelector::operator==(const Sass::Selector&) const’ was hidden [-Woverloaded-virtual=] 133 | bool operator==(const Selector& rhs) const final override; | ^~~~~~~~ src/ast_def_macros.hpp:109:16: note: by ‘Sass::IDSelector::operator==’ 109 | virtual bool operator==(const klass& rhs) const; \ | ^~~~~~~~ src/ast_selectors.hpp:204:5: note: in expansion of macro ‘ATTACH_CMP_OPERATIONS’ 204 | ATTACH_CMP_OPERATIONS(IDSelector) | ^~~~~~~~~~~~~~~~~~~~~ src/ast_def_macros.hpp:106:16: warning: ‘virtual bool Sass::SimpleSelector::operator!=(const Sass::SimpleSelector&) const’ was hidden [-Woverloaded-virtual=] 106 | virtual bool operator!=(const klass& rhs) const { return !(*this == rhs); }; \ | ^~~~~~~~ src/ast_selectors.hpp:139:5: note: in expansion of macro ‘ATTACH_VIRTUAL_CMP_OPERATIONS’ 139 | ATTACH_VIRTUAL_CMP_OPERATIONS(SimpleSelector); | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~ src/ast_def_macros.hpp:110:16: note: by ‘virtual bool Sass::IDSelector::operator!=(const Sass::IDSelector&) const’ 110 | virtual bool operator!=(const klass& rhs) const { return !(*this == rhs); }; \ | ^~~~~~~~ src/ast_selectors.hpp:204:5: note: in expansion of macro ‘ATTACH_CMP_OPERATIONS’ 204 | ATTACH_CMP_OPERATIONS(IDSelector) | ^~~~~~~~~~~~~~~~~~~~~ src/ast_selectors.hpp:137:18: warning: ‘virtual bool Sass::SimpleSelector::operator==(const Sass::CompoundSelector&) const’ was hidden [-Woverloaded-virtual=] 137 | virtual bool operator==(const CompoundSelector& rhs) const; | ^~~~~~~~ src/ast_def_macros.hpp:109:16: note: by ‘Sass::AttributeSelector::operator==’ 109 | virtual bool operator==(const klass& rhs) const; \ | ^~~~~~~~ src/ast_selectors.hpp:223:5: note: in expansion of macro ‘ATTACH_CMP_OPERATIONS’ 223 | ATTACH_CMP_OPERATIONS(AttributeSelector) | ^~~~~~~~~~~~~~~~~~~~~ src/ast_selectors.hpp:136:18: warning: ‘virtual bool Sass::SimpleSelector::operator==(const Sass::ComplexSelector&) const’ was hidden [-Woverloaded-virtual=] 136 | virtual bool operator==(const ComplexSelector& rhs) const; | ^~~~~~~~ src/ast_def_macros.hpp:109:16: note: by ‘Sass::AttributeSelector::operator==’ 109 | virtual bool operator==(const klass& rhs) const; \ | ^~~~~~~~ src/ast_selectors.hpp:223:5: note: in expansion of macro ‘ATTACH_CMP_OPERATIONS’ 223 | ATTACH_CMP_OPERATIONS(AttributeSelector) | ^~~~~~~~~~~~~~~~~~~~~ src/ast_selectors.hpp:135:18: warning: ‘virtual bool Sass::SimpleSelector::operator==(const Sass::SelectorList&) const’ was hidden [-Woverloaded-virtual=] 135 | virtual bool operator==(const SelectorList& rhs) const; | ^~~~~~~~ src/ast_def_macros.hpp:109:16: note: by ‘Sass::AttributeSelector::operator==’ 109 | virtual bool operator==(const klass& rhs) const; \ | ^~~~~~~~ src/ast_selectors.hpp:223:5: note: in expansion of macro ‘ATTACH_CMP_OPERATIONS’ 223 | ATTACH_CMP_OPERATIONS(AttributeSelector) | ^~~~~~~~~~~~~~~~~~~~~ src/ast_selectors.hpp:133:10: warning: ‘virtual bool Sass::SimpleSelector::operator==(const Sass::Selector&) const’ was hidden [-Woverloaded-virtual=] 133 | bool operator==(const Selector& rhs) const final override; | ^~~~~~~~ src/ast_def_macros.hpp:109:16: note: by ‘Sass::AttributeSelector::operator==’ 109 | virtual bool operator==(const klass& rhs) const; \ | ^~~~~~~~ src/ast_selectors.hpp:223:5: note: in expansion of macro ‘ATTACH_CMP_OPERATIONS’ 223 | ATTACH_CMP_OPERATIONS(AttributeSelector) | ^~~~~~~~~~~~~~~~~~~~~ src/ast_def_macros.hpp:106:16: warning: ‘virtual bool Sass::SimpleSelector::operator!=(const Sass::SimpleSelector&) const’ was hidden [-Woverloaded-virtual=] 106 | virtual bool operator!=(const klass& rhs) const { return !(*this == rhs); }; \ | ^~~~~~~~ src/ast_selectors.hpp:139:5: note: in expansion of macro ‘ATTACH_VIRTUAL_CMP_OPERATIONS’ 139 | ATTACH_VIRTUAL_CMP_OPERATIONS(SimpleSelector); | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~ src/ast_def_macros.hpp:110:16: note: by ‘virtual bool Sass::AttributeSelector::operator!=(const Sass::AttributeSelector&) const’ 110 | virtual bool operator!=(const klass& rhs) const { return !(*this == rhs); }; \ | ^~~~~~~~ src/ast_selectors.hpp:223:5: note: in expansion of macro ‘ATTACH_CMP_OPERATIONS’ 223 | ATTACH_CMP_OPERATIONS(AttributeSelector) | ^~~~~~~~~~~~~~~~~~~~~ src/ast_def_macros.hpp:106:16: warning: ‘virtual bool Sass::Selector::operator!=(const Sass::Selector&) const’ was hidden [-Woverloaded-virtual=] 106 | virtual bool operator!=(const klass& rhs) const { return !(*this == rhs); }; \ | ^~~~~~~~ src/ast_selectors.hpp:56:5: note: in expansion of macro ‘ATTACH_VIRTUAL_CMP_OPERATIONS’ 56 | ATTACH_VIRTUAL_CMP_OPERATIONS(Selector) | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~ src/ast_def_macros.hpp:110:16: note: by ‘virtual bool Sass::ComplexSelector::operator!=(const Sass::ComplexSelector&) const’ 110 | virtual bool operator!=(const klass& rhs) const { return !(*this == rhs); }; \ | ^~~~~~~~ src/ast_selectors.hpp:310:5: note: in expansion of macro ‘ATTACH_CMP_OPERATIONS’ 310 | ATTACH_CMP_OPERATIONS(ComplexSelector) | ^~~~~~~~~~~~~~~~~~~~~ src/ast_def_macros.hpp:106:16: warning: ‘virtual bool Sass::Selector::operator!=(const Sass::Selector&) const’ was hidden [-Woverloaded-virtual=] 106 | virtual bool operator!=(const klass& rhs) const { return !(*this == rhs); }; \ | ^~~~~~~~ src/ast_selectors.hpp:56:5: note: in expansion of macro ‘ATTACH_VIRTUAL_CMP_OPERATIONS’ 56 | ATTACH_VIRTUAL_CMP_OPERATIONS(Selector) | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~ src/ast_def_macros.hpp:106:16: note: by ‘virtual bool Sass::SelectorComponent::operator!=(const Sass::SelectorComponent&) const’ 106 | virtual bool operator!=(const klass& rhs) const { return !(*this == rhs); }; \ | ^~~~~~~~ src/ast_selectors.hpp:349:5: note: in expansion of macro ‘ATTACH_VIRTUAL_CMP_OPERATIONS’ 349 | ATTACH_VIRTUAL_CMP_OPERATIONS(SelectorComponent); | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~ src/ast_def_macros.hpp:106:16: warning: ‘virtual bool Sass::SelectorComponent::operator!=(const Sass::SelectorComponent&) const’ was hidden [-Woverloaded-virtual=] 106 | virtual bool operator!=(const klass& rhs) const { return !(*this == rhs); }; \ | ^~~~~~~~ src/ast_selectors.hpp:349:5: note: in expansion of macro ‘ATTACH_VIRTUAL_CMP_OPERATIONS’ 349 | ATTACH_VIRTUAL_CMP_OPERATIONS(SelectorComponent); | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~ src/ast_def_macros.hpp:110:16: note: by ‘virtual bool Sass::SelectorCombinator::operator!=(const Sass::SelectorCombinator&) const’ 110 | virtual bool operator!=(const klass& rhs) const { return !(*this == rhs); }; \ | ^~~~~~~~ src/ast_selectors.hpp:407:5: note: in expansion of macro ‘ATTACH_CMP_OPERATIONS’ 407 | ATTACH_CMP_OPERATIONS(SelectorCombinator) | ^~~~~~~~~~~~~~~~~~~~~ In file included from src/ast.hpp:18: src/operation.hpp:206:7: warning: ‘T Sass::Operation_CRTP::operator()(Sass::SelectorCombinator*) [with T = Sass::Expression*; D = Sass::Eval]’ was hidden [-Woverloaded-virtual=] 206 | T operator()(SelectorCombinator* x) { return static_cast(this)->fallback(x); } | ^~~~~~~~ In file included from src/expand.hpp:7: src/eval.hpp:96:17: note: by ‘Sass::Eval::operator()’ 96 | Expression* operator()(Parent_Reference*); | ^~~~~~~~ src/operation.hpp:194:7: warning: ‘T Sass::Operation_CRTP::operator()(Sass::Parameters*) [with T = Sass::Expression*; D = Sass::Eval]’ was hidden [-Woverloaded-virtual=] 194 | T operator()(Parameters* x) { return static_cast(this)->fallback(x); } | ^~~~~~~~ src/eval.hpp:96:17: note: by ‘Sass::Eval::operator()’ 96 | Expression* operator()(Parent_Reference*); | ^~~~~~~~ src/operation.hpp:193:7: warning: ‘T Sass::Operation_CRTP::operator()(Sass::Parameter*) [with T = Sass::Expression*; D = Sass::Eval]’ was hidden [-Woverloaded-virtual=] 193 | T operator()(Parameter* x) { return static_cast(this)->fallback(x); } | ^~~~~~~~ src/eval.hpp:96:17: note: by ‘Sass::Eval::operator()’ 96 | Expression* operator()(Parent_Reference*); | ^~~~~~~~ src/operation.hpp:183:7: warning: ‘T Sass::Operation_CRTP::operator()(Sass::SupportsCondition*) [with T = Sass::Expression*; D = Sass::Eval]’ was hidden [-Woverloaded-virtual=] 183 | T operator()(SupportsCondition* x) { return static_cast(this)->fallback(x); } | ^~~~~~~~ src/eval.hpp:96:17: note: by ‘Sass::Eval::operator()’ 96 | Expression* operator()(Parent_Reference*); | ^~~~~~~~ src/operation.hpp:176:7: warning: ‘T Sass::Operation_CRTP::operator()(Sass::Color*) [with T = Sass::Expression*; D = Sass::Eval]’ was hidden [-Woverloaded-virtual=] 176 | T operator()(Color* x) { return static_cast(this)->fallback(x); } | ^~~~~~~~ src/eval.hpp:96:17: note: by ‘Sass::Eval::operator()’ 96 | Expression* operator()(Parent_Reference*); | ^~~~~~~~ src/operation.hpp:173:7: warning: ‘T Sass::Operation_CRTP::operator()(Sass::Custom_Error*) [with T = Sass::Expression*; D = Sass::Eval]’ was hidden [-Woverloaded-virtual=] 173 | T operator()(Custom_Error* x) { return static_cast(this)->fallback(x); } | ^~~~~~~~ src/eval.hpp:96:17: note: by ‘Sass::Eval::operator()’ 96 | Expression* operator()(Parent_Reference*); | ^~~~~~~~ src/operation.hpp:172:7: warning: ‘T Sass::Operation_CRTP::operator()(Sass::Custom_Warning*) [with T = Sass::Expression*; D = Sass::Eval]’ was hidden [-Woverloaded-virtual=] 172 | T operator()(Custom_Warning* x) { return static_cast(this)->fallback(x); } | ^~~~~~~~ src/eval.hpp:96:17: note: by ‘Sass::Eval::operator()’ 96 | Expression* operator()(Parent_Reference*); | ^~~~~~~~ src/operation.hpp:168:7: warning: ‘T Sass::Operation_CRTP::operator()(Sass::Function*) [with T = Sass::Expression*; D = Sass::Eval]’ was hidden [-Woverloaded-virtual=] 168 | T operator()(Function* x) { return static_cast(this)->fallback(x); } | ^~~~~~~~ src/eval.hpp:96:17: note: by ‘Sass::Eval::operator()’ 96 | Expression* operator()(Parent_Reference*); | ^~~~~~~~ src/operation.hpp:163:7: warning: ‘T Sass::Operation_CRTP::operator()(Sass::Mixin_Call*) [with T = Sass::Expression*; D = Sass::Eval]’ was hidden [-Woverloaded-virtual=] 163 | T operator()(Mixin_Call* x) { return static_cast(this)->fallback(x); } | ^~~~~~~~ src/eval.hpp:96:17: note: by ‘Sass::Eval::operator()’ 96 | Expression* operator()(Parent_Reference*); | ^~~~~~~~ src/operation.hpp:162:7: warning: ‘T Sass::Operation_CRTP::operator()(Sass::Definition*) [with T = Sass::Expression*; D = Sass::Eval]’ was hidden [-Woverloaded-virtual=] 162 | T operator()(Definition* x) { return static_cast(this)->fallback(x); } | ^~~~~~~~ src/eval.hpp:96:17: note: by ‘Sass::Eval::operator()’ 96 | Expression* operator()(Parent_Reference*); | ^~~~~~~~ src/operation.hpp:161:7: warning: ‘T Sass::Operation_CRTP::operator()(Sass::ExtendRule*) [with T = Sass::Expression*; D = Sass::Eval]’ was hidden [-Woverloaded-virtual=] 161 | T operator()(ExtendRule* x) { return static_cast(this)->fallback(x); } | ^~~~~~~~ src/eval.hpp:96:17: note: by ‘Sass::Eval::operator()’ 96 | Expression* operator()(Parent_Reference*); | ^~~~~~~~ src/operation.hpp:160:7: warning: ‘T Sass::Operation_CRTP::operator()(Sass::Content*) [with T = Sass::Expression*; D = Sass::Eval]’ was hidden [-Woverloaded-virtual=] 160 | T operator()(Content* x) { return static_cast(this)->fallback(x); } | ^~~~~~~~ src/eval.hpp:96:17: note: by ‘Sass::Eval::operator()’ 96 | Expression* operator()(Parent_Reference*); | ^~~~~~~~ src/operation.hpp:150:7: warning: ‘T Sass::Operation_CRTP::operator()(Sass::Import_Stub*) [with T = Sass::Expression*; D = Sass::Eval]’ was hidden [-Woverloaded-virtual=] 150 | T operator()(Import_Stub* x) { return static_cast(this)->fallback(x); } | ^~~~~~~~ src/eval.hpp:96:17: note: by ‘Sass::Eval::operator()’ 96 | Expression* operator()(Parent_Reference*); | ^~~~~~~~ src/operation.hpp:149:7: warning: ‘T Sass::Operation_CRTP::operator()(Sass::Import*) [with T = Sass::Expression*; D = Sass::Eval]’ was hidden [-Woverloaded-virtual=] 149 | T operator()(Import* x) { return static_cast(this)->fallback(x); } | ^~~~~~~~ src/eval.hpp:96:17: note: by ‘Sass::Eval::operator()’ 96 | Expression* operator()(Parent_Reference*); | ^~~~~~~~ src/operation.hpp:147:7: warning: ‘T Sass::Operation_CRTP::operator()(Sass::Declaration*) [with T = Sass::Expression*; D = Sass::Eval]’ was hidden [-Woverloaded-virtual=] 147 | T operator()(Declaration* x) { return static_cast(this)->fallback(x); } | ^~~~~~~~ src/eval.hpp:96:17: note: by ‘Sass::Eval::operator()’ 96 | Expression* operator()(Parent_Reference*); | ^~~~~~~~ src/operation.hpp:146:7: warning: ‘T Sass::Operation_CRTP::operator()(Sass::Keyframe_Rule*) [with T = Sass::Expression*; D = Sass::Eval]’ was hidden [-Woverloaded-virtual=] 146 | T operator()(Keyframe_Rule* x) { return static_cast(this)->fallback(x); } | ^~~~~~~~ src/eval.hpp:96:17: note: by ‘Sass::Eval::operator()’ 96 | Expression* operator()(Parent_Reference*); | ^~~~~~~~ src/operation.hpp:145:7: warning: ‘T Sass::Operation_CRTP::operator()(Sass::AtRule*) [with T = Sass::Expression*; D = Sass::Eval]’ was hidden [-Woverloaded-virtual=] 145 | T operator()(AtRule* x) { return static_cast(this)->fallback(x); } | ^~~~~~~~ src/eval.hpp:96:17: note: by ‘Sass::Eval::operator()’ 96 | Expression* operator()(Parent_Reference*); | ^~~~~~~~ src/operation.hpp:144:7: warning: ‘T Sass::Operation_CRTP::operator()(Sass::AtRootRule*) [with T = Sass::Expression*; D = Sass::Eval]’ was hidden [-Woverloaded-virtual=] 144 | T operator()(AtRootRule* x) { return static_cast(this)->fallback(x); } | ^~~~~~~~ src/eval.hpp:96:17: note: by ‘Sass::Eval::operator()’ 96 | Expression* operator()(Parent_Reference*); | ^~~~~~~~ src/operation.hpp:143:7: warning: ‘T Sass::Operation_CRTP::operator()(Sass::CssMediaQuery*) [with T = Sass::Expression*; D = Sass::Eval]’ was hidden [-Woverloaded-virtual=] 143 | T operator()(CssMediaQuery* x) { return static_cast(this)->fallback(x); } | ^~~~~~~~ src/eval.hpp:96:17: note: by ‘Sass::Eval::operator()’ 96 | Expression* operator()(Parent_Reference*); | ^~~~~~~~ src/operation.hpp:142:7: warning: ‘T Sass::Operation_CRTP::operator()(Sass::CssMediaRule*) [with T = Sass::Expression*; D = Sass::Eval]’ was hidden [-Woverloaded-virtual=] 142 | T operator()(CssMediaRule* x) { return static_cast(this)->fallback(x); } | ^~~~~~~~ src/eval.hpp:96:17: note: by ‘Sass::Eval::operator()’ 96 | Expression* operator()(Parent_Reference*); | ^~~~~~~~ src/operation.hpp:141:7: warning: ‘T Sass::Operation_CRTP::operator()(Sass::MediaRule*) [with T = Sass::Expression*; D = Sass::Eval]’ was hidden [-Woverloaded-virtual=] 141 | T operator()(MediaRule* x) { return static_cast(this)->fallback(x); } | ^~~~~~~~ src/eval.hpp:96:17: note: by ‘Sass::Eval::operator()’ 96 | Expression* operator()(Parent_Reference*); | ^~~~~~~~ src/operation.hpp:140:7: warning: ‘T Sass::Operation_CRTP::operator()(Sass::SupportsRule*) [with T = Sass::Expression*; D = Sass::Eval]’ was hidden [-Woverloaded-virtual=] 140 | T operator()(SupportsRule* x) { return static_cast(this)->fallback(x); } | ^~~~~~~~ src/eval.hpp:96:17: note: by ‘Sass::Eval::operator()’ 96 | Expression* operator()(Parent_Reference*); | ^~~~~~~~ src/operation.hpp:139:7: warning: ‘T Sass::Operation_CRTP::operator()(Sass::Trace*) [with T = Sass::Expression*; D = Sass::Eval]’ was hidden [-Woverloaded-virtual=] 139 | T operator()(Trace* x) { return static_cast(this)->fallback(x); } | ^~~~~~~~ src/eval.hpp:96:17: note: by ‘Sass::Eval::operator()’ 96 | Expression* operator()(Parent_Reference*); | ^~~~~~~~ src/operation.hpp:138:7: warning: ‘T Sass::Operation_CRTP::operator()(Sass::Bubble*) [with T = Sass::Expression*; D = Sass::Eval]’ was hidden [-Woverloaded-virtual=] 138 | T operator()(Bubble* x) { return static_cast(this)->fallback(x); } | ^~~~~~~~ src/eval.hpp:96:17: note: by ‘Sass::Eval::operator()’ 96 | Expression* operator()(Parent_Reference*); | ^~~~~~~~ src/operation.hpp:137:7: warning: ‘T Sass::Operation_CRTP::operator()(Sass::StyleRule*) [with T = Sass::Expression*; D = Sass::Eval]’ was hidden [-Woverloaded-virtual=] 137 | T operator()(StyleRule* x) { return static_cast(this)->fallback(x); } | ^~~~~~~~ src/eval.hpp:96:17: note: by ‘Sass::Eval::operator()’ 96 | Expression* operator()(Parent_Reference*); | ^~~~~~~~ src/operation.hpp:134:7: warning: ‘T Sass::Operation_CRTP::operator()(Sass::AST_Node*) [with T = Sass::Expression*; D = Sass::Eval]’ was hidden [-Woverloaded-virtual=] 134 | T operator()(AST_Node* x) { return static_cast(this)->fallback(x); } | ^~~~~~~~ src/eval.hpp:96:17: note: by ‘Sass::Eval::operator()’ 96 | Expression* operator()(Parent_Reference*); | ^~~~~~~~ g++ -std=gnu++17 -Wall -O2 -std=c++11 -I ./include -fPIC -c -o src/expand.o src/expand.cpp In file included from src/expand.cpp:8: src/ast.hpp:90:18: warning: ‘virtual bool Sass::AST_Node::operator==(const Sass::AST_Node&) const’ was hidden [-Woverloaded-virtual=] 90 | virtual bool operator== (const AST_Node& rhs) const { | ^~~~~~~~ src/ast.hpp:165:18: note: by ‘virtual bool Sass::Expression::operator==(const Sass::Expression&) const’ 165 | virtual bool operator== (const Expression& rhs) const { return false; } | ^~~~~~~~ src/ast.hpp:96:18: warning: ‘virtual bool Sass::AST_Node::operator!=(const Sass::AST_Node&) const’ was hidden [-Woverloaded-virtual=] 96 | virtual bool operator!= (const AST_Node& rhs) const { | ^~~~~~~~ src/ast.hpp:167:17: note: by ‘bool Sass::Expression::operator!=(const Sass::Expression&) const’ 167 | inline bool operator!=(const Expression& rhs) const { return !(rhs == *this); } | ^~~~~~~~ src/ast.hpp:90:18: warning: ‘virtual bool Sass::AST_Node::operator==(const Sass::AST_Node&) const’ was hidden [-Woverloaded-virtual=] 90 | virtual bool operator== (const AST_Node& rhs) const { | ^~~~~~~~ src/ast.hpp:908:10: note: by ‘bool Sass::CssMediaRule::operator==(const Sass::CssMediaRule&) const’ 908 | bool operator== (const CssMediaRule& rhs) const { | ^~~~~~~~ src/ast.hpp:96:18: warning: ‘virtual bool Sass::AST_Node::operator!=(const Sass::AST_Node&) const’ was hidden [-Woverloaded-virtual=] 96 | virtual bool operator!= (const AST_Node& rhs) const { | ^~~~~~~~ src/ast.hpp:911:10: note: by ‘bool Sass::CssMediaRule::operator!=(const Sass::CssMediaRule&) const’ 911 | bool operator!=(const CssMediaRule& rhs) const { | ^~~~~~~~ src/ast.hpp:90:18: warning: ‘virtual bool Sass::AST_Node::operator==(const Sass::AST_Node&) const’ was hidden [-Woverloaded-virtual=] 90 | virtual bool operator== (const AST_Node& rhs) const { | ^~~~~~~~ src/ast.hpp:939:10: note: by ‘bool Sass::CssMediaQuery::operator==(const Sass::CssMediaQuery&) const’ 939 | bool operator== (const CssMediaQuery& rhs) const; | ^~~~~~~~ src/ast.hpp:96:18: warning: ‘virtual bool Sass::AST_Node::operator!=(const Sass::AST_Node&) const’ was hidden [-Woverloaded-virtual=] 96 | virtual bool operator!= (const AST_Node& rhs) const { | ^~~~~~~~ src/ast.hpp:940:10: note: by ‘bool Sass::CssMediaQuery::operator!=(const Sass::CssMediaQuery&) const’ 940 | bool operator!=(const CssMediaQuery& rhs) const { | ^~~~~~~~ src/ast.hpp:165:18: warning: ‘virtual bool Sass::Expression::operator==(const Sass::Expression&) const’ was hidden [-Woverloaded-virtual=] 165 | virtual bool operator== (const Expression& rhs) const { return false; } | ^~~~~~~~ In file included from src/ast.hpp:14: src/ast_def_macros.hpp:105:16: note: by ‘virtual bool Sass::Selector::operator==(const Sass::Selector&) const’ 105 | virtual bool operator==(const klass& rhs) const = 0; \ | ^~~~~~~~ src/ast_selectors.hpp:56:5: note: in expansion of macro ‘ATTACH_VIRTUAL_CMP_OPERATIONS’ 56 | ATTACH_VIRTUAL_CMP_OPERATIONS(Selector) | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~ src/ast.hpp:96:18: warning: ‘virtual bool Sass::AST_Node::operator!=(const Sass::AST_Node&) const’ was hidden [-Woverloaded-virtual=] 96 | virtual bool operator!= (const AST_Node& rhs) const { | ^~~~~~~~ src/ast_def_macros.hpp:106:16: note: by ‘virtual bool Sass::Selector::operator!=(const Sass::Selector&) const’ 106 | virtual bool operator!=(const klass& rhs) const { return !(*this == rhs); }; \ | ^~~~~~~~ src/ast_selectors.hpp:56:5: note: in expansion of macro ‘ATTACH_VIRTUAL_CMP_OPERATIONS’ 56 | ATTACH_VIRTUAL_CMP_OPERATIONS(Selector) | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~ src/ast_def_macros.hpp:106:16: warning: ‘virtual bool Sass::Selector::operator!=(const Sass::Selector&) const’ was hidden [-Woverloaded-virtual=] 106 | virtual bool operator!=(const klass& rhs) const { return !(*this == rhs); }; \ | ^~~~~~~~ src/ast_selectors.hpp:56:5: note: in expansion of macro ‘ATTACH_VIRTUAL_CMP_OPERATIONS’ 56 | ATTACH_VIRTUAL_CMP_OPERATIONS(Selector) | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~ src/ast_def_macros.hpp:106:16: note: by ‘virtual bool Sass::SimpleSelector::operator!=(const Sass::SimpleSelector&) const’ 106 | virtual bool operator!=(const klass& rhs) const { return !(*this == rhs); }; \ | ^~~~~~~~ src/ast_selectors.hpp:139:5: note: in expansion of macro ‘ATTACH_VIRTUAL_CMP_OPERATIONS’ 139 | ATTACH_VIRTUAL_CMP_OPERATIONS(SimpleSelector); | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~ In file included from src/ast.hpp:1055: src/ast_selectors.hpp:137:18: warning: ‘virtual bool Sass::SimpleSelector::operator==(const Sass::CompoundSelector&) const’ was hidden [-Woverloaded-virtual=] 137 | virtual bool operator==(const CompoundSelector& rhs) const; | ^~~~~~~~ src/ast_def_macros.hpp:109:16: note: by ‘Sass::PlaceholderSelector::operator==’ 109 | virtual bool operator==(const klass& rhs) const; \ | ^~~~~~~~ src/ast_selectors.hpp:157:5: note: in expansion of macro ‘ATTACH_CMP_OPERATIONS’ 157 | ATTACH_CMP_OPERATIONS(PlaceholderSelector) | ^~~~~~~~~~~~~~~~~~~~~ src/ast_selectors.hpp:136:18: warning: ‘virtual bool Sass::SimpleSelector::operator==(const Sass::ComplexSelector&) const’ was hidden [-Woverloaded-virtual=] 136 | virtual bool operator==(const ComplexSelector& rhs) const; | ^~~~~~~~ src/ast_def_macros.hpp:109:16: note: by ‘Sass::PlaceholderSelector::operator==’ 109 | virtual bool operator==(const klass& rhs) const; \ | ^~~~~~~~ src/ast_selectors.hpp:157:5: note: in expansion of macro ‘ATTACH_CMP_OPERATIONS’ 157 | ATTACH_CMP_OPERATIONS(PlaceholderSelector) | ^~~~~~~~~~~~~~~~~~~~~ src/ast_selectors.hpp:135:18: warning: ‘virtual bool Sass::SimpleSelector::operator==(const Sass::SelectorList&) const’ was hidden [-Woverloaded-virtual=] 135 | virtual bool operator==(const SelectorList& rhs) const; | ^~~~~~~~ src/ast_def_macros.hpp:109:16: note: by ‘Sass::PlaceholderSelector::operator==’ 109 | virtual bool operator==(const klass& rhs) const; \ | ^~~~~~~~ src/ast_selectors.hpp:157:5: note: in expansion of macro ‘ATTACH_CMP_OPERATIONS’ 157 | ATTACH_CMP_OPERATIONS(PlaceholderSelector) | ^~~~~~~~~~~~~~~~~~~~~ src/ast_selectors.hpp:133:10: warning: ‘virtual bool Sass::SimpleSelector::operator==(const Sass::Selector&) const’ was hidden [-Woverloaded-virtual=] 133 | bool operator==(const Selector& rhs) const final override; | ^~~~~~~~ src/ast_def_macros.hpp:109:16: note: by ‘Sass::PlaceholderSelector::operator==’ 109 | virtual bool operator==(const klass& rhs) const; \ | ^~~~~~~~ src/ast_selectors.hpp:157:5: note: in expansion of macro ‘ATTACH_CMP_OPERATIONS’ 157 | ATTACH_CMP_OPERATIONS(PlaceholderSelector) | ^~~~~~~~~~~~~~~~~~~~~ src/ast_def_macros.hpp:106:16: warning: ‘virtual bool Sass::SimpleSelector::operator!=(const Sass::SimpleSelector&) const’ was hidden [-Woverloaded-virtual=] 106 | virtual bool operator!=(const klass& rhs) const { return !(*this == rhs); }; \ | ^~~~~~~~ src/ast_selectors.hpp:139:5: note: in expansion of macro ‘ATTACH_VIRTUAL_CMP_OPERATIONS’ 139 | ATTACH_VIRTUAL_CMP_OPERATIONS(SimpleSelector); | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~ src/ast_def_macros.hpp:110:16: note: by ‘virtual bool Sass::PlaceholderSelector::operator!=(const Sass::PlaceholderSelector&) const’ 110 | virtual bool operator!=(const klass& rhs) const { return !(*this == rhs); }; \ | ^~~~~~~~ src/ast_selectors.hpp:157:5: note: in expansion of macro ‘ATTACH_CMP_OPERATIONS’ 157 | ATTACH_CMP_OPERATIONS(PlaceholderSelector) | ^~~~~~~~~~~~~~~~~~~~~ src/ast_selectors.hpp:137:18: warning: ‘virtual bool Sass::SimpleSelector::operator==(const Sass::CompoundSelector&) const’ was hidden [-Woverloaded-virtual=] 137 | virtual bool operator==(const CompoundSelector& rhs) const; | ^~~~~~~~ src/ast_def_macros.hpp:109:16: note: by ‘Sass::TypeSelector::operator==’ 109 | virtual bool operator==(const klass& rhs) const; \ | ^~~~~~~~ src/ast_selectors.hpp:174:5: note: in expansion of macro ‘ATTACH_CMP_OPERATIONS’ 174 | ATTACH_CMP_OPERATIONS(TypeSelector) | ^~~~~~~~~~~~~~~~~~~~~ src/ast_selectors.hpp:136:18: warning: ‘virtual bool Sass::SimpleSelector::operator==(const Sass::ComplexSelector&) const’ was hidden [-Woverloaded-virtual=] 136 | virtual bool operator==(const ComplexSelector& rhs) const; | ^~~~~~~~ src/ast_def_macros.hpp:109:16: note: by ‘Sass::TypeSelector::operator==’ 109 | virtual bool operator==(const klass& rhs) const; \ | ^~~~~~~~ src/ast_selectors.hpp:174:5: note: in expansion of macro ‘ATTACH_CMP_OPERATIONS’ 174 | ATTACH_CMP_OPERATIONS(TypeSelector) | ^~~~~~~~~~~~~~~~~~~~~ src/ast_selectors.hpp:135:18: warning: ‘virtual bool Sass::SimpleSelector::operator==(const Sass::SelectorList&) const’ was hidden [-Woverloaded-virtual=] 135 | virtual bool operator==(const SelectorList& rhs) const; | ^~~~~~~~ src/ast_def_macros.hpp:109:16: note: by ‘Sass::TypeSelector::operator==’ 109 | virtual bool operator==(const klass& rhs) const; \ | ^~~~~~~~ src/ast_selectors.hpp:174:5: note: in expansion of macro ‘ATTACH_CMP_OPERATIONS’ 174 | ATTACH_CMP_OPERATIONS(TypeSelector) | ^~~~~~~~~~~~~~~~~~~~~ src/ast_selectors.hpp:133:10: warning: ‘virtual bool Sass::SimpleSelector::operator==(const Sass::Selector&) const’ was hidden [-Woverloaded-virtual=] 133 | bool operator==(const Selector& rhs) const final override; | ^~~~~~~~ src/ast_def_macros.hpp:109:16: note: by ‘Sass::TypeSelector::operator==’ 109 | virtual bool operator==(const klass& rhs) const; \ | ^~~~~~~~ src/ast_selectors.hpp:174:5: note: in expansion of macro ‘ATTACH_CMP_OPERATIONS’ 174 | ATTACH_CMP_OPERATIONS(TypeSelector) | ^~~~~~~~~~~~~~~~~~~~~ src/ast_def_macros.hpp:106:16: warning: ‘virtual bool Sass::SimpleSelector::operator!=(const Sass::SimpleSelector&) const’ was hidden [-Woverloaded-virtual=] 106 | virtual bool operator!=(const klass& rhs) const { return !(*this == rhs); }; \ | ^~~~~~~~ src/ast_selectors.hpp:139:5: note: in expansion of macro ‘ATTACH_VIRTUAL_CMP_OPERATIONS’ 139 | ATTACH_VIRTUAL_CMP_OPERATIONS(SimpleSelector); | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~ src/ast_def_macros.hpp:110:16: note: by ‘virtual bool Sass::TypeSelector::operator!=(const Sass::TypeSelector&) const’ 110 | virtual bool operator!=(const klass& rhs) const { return !(*this == rhs); }; \ | ^~~~~~~~ src/ast_selectors.hpp:174:5: note: in expansion of macro ‘ATTACH_CMP_OPERATIONS’ 174 | ATTACH_CMP_OPERATIONS(TypeSelector) | ^~~~~~~~~~~~~~~~~~~~~ src/ast_selectors.hpp:137:18: warning: ‘virtual bool Sass::SimpleSelector::operator==(const Sass::CompoundSelector&) const’ was hidden [-Woverloaded-virtual=] 137 | virtual bool operator==(const CompoundSelector& rhs) const; | ^~~~~~~~ src/ast_def_macros.hpp:109:16: note: by ‘Sass::ClassSelector::operator==’ 109 | virtual bool operator==(const klass& rhs) const; \ | ^~~~~~~~ src/ast_selectors.hpp:188:5: note: in expansion of macro ‘ATTACH_CMP_OPERATIONS’ 188 | ATTACH_CMP_OPERATIONS(ClassSelector) | ^~~~~~~~~~~~~~~~~~~~~ src/ast_selectors.hpp:136:18: warning: ‘virtual bool Sass::SimpleSelector::operator==(const Sass::ComplexSelector&) const’ was hidden [-Woverloaded-virtual=] 136 | virtual bool operator==(const ComplexSelector& rhs) const; | ^~~~~~~~ src/ast_def_macros.hpp:109:16: note: by ‘Sass::ClassSelector::operator==’ 109 | virtual bool operator==(const klass& rhs) const; \ | ^~~~~~~~ src/ast_selectors.hpp:188:5: note: in expansion of macro ‘ATTACH_CMP_OPERATIONS’ 188 | ATTACH_CMP_OPERATIONS(ClassSelector) | ^~~~~~~~~~~~~~~~~~~~~ src/ast_selectors.hpp:135:18: warning: ‘virtual bool Sass::SimpleSelector::operator==(const Sass::SelectorList&) const’ was hidden [-Woverloaded-virtual=] 135 | virtual bool operator==(const SelectorList& rhs) const; | ^~~~~~~~ src/ast_def_macros.hpp:109:16: note: by ‘Sass::ClassSelector::operator==’ 109 | virtual bool operator==(const klass& rhs) const; \ | ^~~~~~~~ src/ast_selectors.hpp:188:5: note: in expansion of macro ‘ATTACH_CMP_OPERATIONS’ 188 | ATTACH_CMP_OPERATIONS(ClassSelector) | ^~~~~~~~~~~~~~~~~~~~~ src/ast_selectors.hpp:133:10: warning: ‘virtual bool Sass::SimpleSelector::operator==(const Sass::Selector&) const’ was hidden [-Woverloaded-virtual=] 133 | bool operator==(const Selector& rhs) const final override; | ^~~~~~~~ src/ast_def_macros.hpp:109:16: note: by ‘Sass::ClassSelector::operator==’ 109 | virtual bool operator==(const klass& rhs) const; \ | ^~~~~~~~ src/ast_selectors.hpp:188:5: note: in expansion of macro ‘ATTACH_CMP_OPERATIONS’ 188 | ATTACH_CMP_OPERATIONS(ClassSelector) | ^~~~~~~~~~~~~~~~~~~~~ src/ast_def_macros.hpp:106:16: warning: ‘virtual bool Sass::SimpleSelector::operator!=(const Sass::SimpleSelector&) const’ was hidden [-Woverloaded-virtual=] 106 | virtual bool operator!=(const klass& rhs) const { return !(*this == rhs); }; \ | ^~~~~~~~ src/ast_selectors.hpp:139:5: note: in expansion of macro ‘ATTACH_VIRTUAL_CMP_OPERATIONS’ 139 | ATTACH_VIRTUAL_CMP_OPERATIONS(SimpleSelector); | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~ src/ast_def_macros.hpp:110:16: note: by ‘virtual bool Sass::ClassSelector::operator!=(const Sass::ClassSelector&) const’ 110 | virtual bool operator!=(const klass& rhs) const { return !(*this == rhs); }; \ | ^~~~~~~~ src/ast_selectors.hpp:188:5: note: in expansion of macro ‘ATTACH_CMP_OPERATIONS’ 188 | ATTACH_CMP_OPERATIONS(ClassSelector) | ^~~~~~~~~~~~~~~~~~~~~ src/ast_selectors.hpp:137:18: warning: ‘virtual bool Sass::SimpleSelector::operator==(const Sass::CompoundSelector&) const’ was hidden [-Woverloaded-virtual=] 137 | virtual bool operator==(const CompoundSelector& rhs) const; | ^~~~~~~~ src/ast_def_macros.hpp:109:16: note: by ‘Sass::IDSelector::operator==’ 109 | virtual bool operator==(const klass& rhs) const; \ | ^~~~~~~~ src/ast_selectors.hpp:204:5: note: in expansion of macro ‘ATTACH_CMP_OPERATIONS’ 204 | ATTACH_CMP_OPERATIONS(IDSelector) | ^~~~~~~~~~~~~~~~~~~~~ src/ast_selectors.hpp:136:18: warning: ‘virtual bool Sass::SimpleSelector::operator==(const Sass::ComplexSelector&) const’ was hidden [-Woverloaded-virtual=] 136 | virtual bool operator==(const ComplexSelector& rhs) const; | ^~~~~~~~ src/ast_def_macros.hpp:109:16: note: by ‘Sass::IDSelector::operator==’ 109 | virtual bool operator==(const klass& rhs) const; \ | ^~~~~~~~ src/ast_selectors.hpp:204:5: note: in expansion of macro ‘ATTACH_CMP_OPERATIONS’ 204 | ATTACH_CMP_OPERATIONS(IDSelector) | ^~~~~~~~~~~~~~~~~~~~~ src/ast_selectors.hpp:135:18: warning: ‘virtual bool Sass::SimpleSelector::operator==(const Sass::SelectorList&) const’ was hidden [-Woverloaded-virtual=] 135 | virtual bool operator==(const SelectorList& rhs) const; | ^~~~~~~~ src/ast_def_macros.hpp:109:16: note: by ‘Sass::IDSelector::operator==’ 109 | virtual bool operator==(const klass& rhs) const; \ | ^~~~~~~~ src/ast_selectors.hpp:204:5: note: in expansion of macro ‘ATTACH_CMP_OPERATIONS’ 204 | ATTACH_CMP_OPERATIONS(IDSelector) | ^~~~~~~~~~~~~~~~~~~~~ src/ast_selectors.hpp:133:10: warning: ‘virtual bool Sass::SimpleSelector::operator==(const Sass::Selector&) const’ was hidden [-Woverloaded-virtual=] 133 | bool operator==(const Selector& rhs) const final override; | ^~~~~~~~ src/ast_def_macros.hpp:109:16: note: by ‘Sass::IDSelector::operator==’ 109 | virtual bool operator==(const klass& rhs) const; \ | ^~~~~~~~ src/ast_selectors.hpp:204:5: note: in expansion of macro ‘ATTACH_CMP_OPERATIONS’ 204 | ATTACH_CMP_OPERATIONS(IDSelector) | ^~~~~~~~~~~~~~~~~~~~~ src/ast_def_macros.hpp:106:16: warning: ‘virtual bool Sass::SimpleSelector::operator!=(const Sass::SimpleSelector&) const’ was hidden [-Woverloaded-virtual=] 106 | virtual bool operator!=(const klass& rhs) const { return !(*this == rhs); }; \ | ^~~~~~~~ src/ast_selectors.hpp:139:5: note: in expansion of macro ‘ATTACH_VIRTUAL_CMP_OPERATIONS’ 139 | ATTACH_VIRTUAL_CMP_OPERATIONS(SimpleSelector); | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~ src/ast_def_macros.hpp:110:16: note: by ‘virtual bool Sass::IDSelector::operator!=(const Sass::IDSelector&) const’ 110 | virtual bool operator!=(const klass& rhs) const { return !(*this == rhs); }; \ | ^~~~~~~~ src/ast_selectors.hpp:204:5: note: in expansion of macro ‘ATTACH_CMP_OPERATIONS’ 204 | ATTACH_CMP_OPERATIONS(IDSelector) | ^~~~~~~~~~~~~~~~~~~~~ src/ast_selectors.hpp:137:18: warning: ‘virtual bool Sass::SimpleSelector::operator==(const Sass::CompoundSelector&) const’ was hidden [-Woverloaded-virtual=] 137 | virtual bool operator==(const CompoundSelector& rhs) const; | ^~~~~~~~ src/ast_def_macros.hpp:109:16: note: by ‘Sass::AttributeSelector::operator==’ 109 | virtual bool operator==(const klass& rhs) const; \ | ^~~~~~~~ src/ast_selectors.hpp:223:5: note: in expansion of macro ‘ATTACH_CMP_OPERATIONS’ 223 | ATTACH_CMP_OPERATIONS(AttributeSelector) | ^~~~~~~~~~~~~~~~~~~~~ src/ast_selectors.hpp:136:18: warning: ‘virtual bool Sass::SimpleSelector::operator==(const Sass::ComplexSelector&) const’ was hidden [-Woverloaded-virtual=] 136 | virtual bool operator==(const ComplexSelector& rhs) const; | ^~~~~~~~ src/ast_def_macros.hpp:109:16: note: by ‘Sass::AttributeSelector::operator==’ 109 | virtual bool operator==(const klass& rhs) const; \ | ^~~~~~~~ src/ast_selectors.hpp:223:5: note: in expansion of macro ‘ATTACH_CMP_OPERATIONS’ 223 | ATTACH_CMP_OPERATIONS(AttributeSelector) | ^~~~~~~~~~~~~~~~~~~~~ src/ast_selectors.hpp:135:18: warning: ‘virtual bool Sass::SimpleSelector::operator==(const Sass::SelectorList&) const’ was hidden [-Woverloaded-virtual=] 135 | virtual bool operator==(const SelectorList& rhs) const; | ^~~~~~~~ src/ast_def_macros.hpp:109:16: note: by ‘Sass::AttributeSelector::operator==’ 109 | virtual bool operator==(const klass& rhs) const; \ | ^~~~~~~~ src/ast_selectors.hpp:223:5: note: in expansion of macro ‘ATTACH_CMP_OPERATIONS’ 223 | ATTACH_CMP_OPERATIONS(AttributeSelector) | ^~~~~~~~~~~~~~~~~~~~~ src/ast_selectors.hpp:133:10: warning: ‘virtual bool Sass::SimpleSelector::operator==(const Sass::Selector&) const’ was hidden [-Woverloaded-virtual=] 133 | bool operator==(const Selector& rhs) const final override; | ^~~~~~~~ src/ast_def_macros.hpp:109:16: note: by ‘Sass::AttributeSelector::operator==’ 109 | virtual bool operator==(const klass& rhs) const; \ | ^~~~~~~~ src/ast_selectors.hpp:223:5: note: in expansion of macro ‘ATTACH_CMP_OPERATIONS’ 223 | ATTACH_CMP_OPERATIONS(AttributeSelector) | ^~~~~~~~~~~~~~~~~~~~~ src/ast_def_macros.hpp:106:16: warning: ‘virtual bool Sass::SimpleSelector::operator!=(const Sass::SimpleSelector&) const’ was hidden [-Woverloaded-virtual=] 106 | virtual bool operator!=(const klass& rhs) const { return !(*this == rhs); }; \ | ^~~~~~~~ src/ast_selectors.hpp:139:5: note: in expansion of macro ‘ATTACH_VIRTUAL_CMP_OPERATIONS’ 139 | ATTACH_VIRTUAL_CMP_OPERATIONS(SimpleSelector); | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~ src/ast_def_macros.hpp:110:16: note: by ‘virtual bool Sass::AttributeSelector::operator!=(const Sass::AttributeSelector&) const’ 110 | virtual bool operator!=(const klass& rhs) const { return !(*this == rhs); }; \ | ^~~~~~~~ src/ast_selectors.hpp:223:5: note: in expansion of macro ‘ATTACH_CMP_OPERATIONS’ 223 | ATTACH_CMP_OPERATIONS(AttributeSelector) | ^~~~~~~~~~~~~~~~~~~~~ src/ast_def_macros.hpp:106:16: warning: ‘virtual bool Sass::Selector::operator!=(const Sass::Selector&) const’ was hidden [-Woverloaded-virtual=] 106 | virtual bool operator!=(const klass& rhs) const { return !(*this == rhs); }; \ | ^~~~~~~~ src/ast_selectors.hpp:56:5: note: in expansion of macro ‘ATTACH_VIRTUAL_CMP_OPERATIONS’ 56 | ATTACH_VIRTUAL_CMP_OPERATIONS(Selector) | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~ src/ast_def_macros.hpp:110:16: note: by ‘virtual bool Sass::ComplexSelector::operator!=(const Sass::ComplexSelector&) const’ 110 | virtual bool operator!=(const klass& rhs) const { return !(*this == rhs); }; \ | ^~~~~~~~ src/ast_selectors.hpp:310:5: note: in expansion of macro ‘ATTACH_CMP_OPERATIONS’ 310 | ATTACH_CMP_OPERATIONS(ComplexSelector) | ^~~~~~~~~~~~~~~~~~~~~ src/ast_def_macros.hpp:106:16: warning: ‘virtual bool Sass::Selector::operator!=(const Sass::Selector&) const’ was hidden [-Woverloaded-virtual=] 106 | virtual bool operator!=(const klass& rhs) const { return !(*this == rhs); }; \ | ^~~~~~~~ src/ast_selectors.hpp:56:5: note: in expansion of macro ‘ATTACH_VIRTUAL_CMP_OPERATIONS’ 56 | ATTACH_VIRTUAL_CMP_OPERATIONS(Selector) | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~ src/ast_def_macros.hpp:106:16: note: by ‘virtual bool Sass::SelectorComponent::operator!=(const Sass::SelectorComponent&) const’ 106 | virtual bool operator!=(const klass& rhs) const { return !(*this == rhs); }; \ | ^~~~~~~~ src/ast_selectors.hpp:349:5: note: in expansion of macro ‘ATTACH_VIRTUAL_CMP_OPERATIONS’ 349 | ATTACH_VIRTUAL_CMP_OPERATIONS(SelectorComponent); | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~ src/ast_def_macros.hpp:106:16: warning: ‘virtual bool Sass::SelectorComponent::operator!=(const Sass::SelectorComponent&) const’ was hidden [-Woverloaded-virtual=] 106 | virtual bool operator!=(const klass& rhs) const { return !(*this == rhs); }; \ | ^~~~~~~~ src/ast_selectors.hpp:349:5: note: in expansion of macro ‘ATTACH_VIRTUAL_CMP_OPERATIONS’ 349 | ATTACH_VIRTUAL_CMP_OPERATIONS(SelectorComponent); | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~ src/ast_def_macros.hpp:110:16: note: by ‘virtual bool Sass::SelectorCombinator::operator!=(const Sass::SelectorCombinator&) const’ 110 | virtual bool operator!=(const klass& rhs) const { return !(*this == rhs); }; \ | ^~~~~~~~ src/ast_selectors.hpp:407:5: note: in expansion of macro ‘ATTACH_CMP_OPERATIONS’ 407 | ATTACH_CMP_OPERATIONS(SelectorCombinator) | ^~~~~~~~~~~~~~~~~~~~~ In file included from src/ast.hpp:18: src/operation.hpp:206:7: warning: ‘T Sass::Operation_CRTP::operator()(Sass::SelectorCombinator*) [with T = Sass::Expression*; D = Sass::Eval]’ was hidden [-Woverloaded-virtual=] 206 | T operator()(SelectorCombinator* x) { return static_cast(this)->fallback(x); } | ^~~~~~~~ In file included from src/expand.hpp:7, from src/expand.cpp:9: src/eval.hpp:96:17: note: by ‘Sass::Eval::operator()’ 96 | Expression* operator()(Parent_Reference*); | ^~~~~~~~ src/operation.hpp:194:7: warning: ‘T Sass::Operation_CRTP::operator()(Sass::Parameters*) [with T = Sass::Expression*; D = Sass::Eval]’ was hidden [-Woverloaded-virtual=] 194 | T operator()(Parameters* x) { return static_cast(this)->fallback(x); } | ^~~~~~~~ src/eval.hpp:96:17: note: by ‘Sass::Eval::operator()’ 96 | Expression* operator()(Parent_Reference*); | ^~~~~~~~ src/operation.hpp:193:7: warning: ‘T Sass::Operation_CRTP::operator()(Sass::Parameter*) [with T = Sass::Expression*; D = Sass::Eval]’ was hidden [-Woverloaded-virtual=] 193 | T operator()(Parameter* x) { return static_cast(this)->fallback(x); } | ^~~~~~~~ src/eval.hpp:96:17: note: by ‘Sass::Eval::operator()’ 96 | Expression* operator()(Parent_Reference*); | ^~~~~~~~ src/operation.hpp:183:7: warning: ‘T Sass::Operation_CRTP::operator()(Sass::SupportsCondition*) [with T = Sass::Expression*; D = Sass::Eval]’ was hidden [-Woverloaded-virtual=] 183 | T operator()(SupportsCondition* x) { return static_cast(this)->fallback(x); } | ^~~~~~~~ src/eval.hpp:96:17: note: by ‘Sass::Eval::operator()’ 96 | Expression* operator()(Parent_Reference*); | ^~~~~~~~ src/operation.hpp:176:7: warning: ‘T Sass::Operation_CRTP::operator()(Sass::Color*) [with T = Sass::Expression*; D = Sass::Eval]’ was hidden [-Woverloaded-virtual=] 176 | T operator()(Color* x) { return static_cast(this)->fallback(x); } | ^~~~~~~~ src/eval.hpp:96:17: note: by ‘Sass::Eval::operator()’ 96 | Expression* operator()(Parent_Reference*); | ^~~~~~~~ src/operation.hpp:173:7: warning: ‘T Sass::Operation_CRTP::operator()(Sass::Custom_Error*) [with T = Sass::Expression*; D = Sass::Eval]’ was hidden [-Woverloaded-virtual=] 173 | T operator()(Custom_Error* x) { return static_cast(this)->fallback(x); } | ^~~~~~~~ src/eval.hpp:96:17: note: by ‘Sass::Eval::operator()’ 96 | Expression* operator()(Parent_Reference*); | ^~~~~~~~ src/operation.hpp:172:7: warning: ‘T Sass::Operation_CRTP::operator()(Sass::Custom_Warning*) [with T = Sass::Expression*; D = Sass::Eval]’ was hidden [-Woverloaded-virtual=] 172 | T operator()(Custom_Warning* x) { return static_cast(this)->fallback(x); } | ^~~~~~~~ src/eval.hpp:96:17: note: by ‘Sass::Eval::operator()’ 96 | Expression* operator()(Parent_Reference*); | ^~~~~~~~ src/operation.hpp:168:7: warning: ‘T Sass::Operation_CRTP::operator()(Sass::Function*) [with T = Sass::Expression*; D = Sass::Eval]’ was hidden [-Woverloaded-virtual=] 168 | T operator()(Function* x) { return static_cast(this)->fallback(x); } | ^~~~~~~~ src/eval.hpp:96:17: note: by ‘Sass::Eval::operator()’ 96 | Expression* operator()(Parent_Reference*); | ^~~~~~~~ src/operation.hpp:163:7: warning: ‘T Sass::Operation_CRTP::operator()(Sass::Mixin_Call*) [with T = Sass::Expression*; D = Sass::Eval]’ was hidden [-Woverloaded-virtual=] 163 | T operator()(Mixin_Call* x) { return static_cast(this)->fallback(x); } | ^~~~~~~~ src/eval.hpp:96:17: note: by ‘Sass::Eval::operator()’ 96 | Expression* operator()(Parent_Reference*); | ^~~~~~~~ src/operation.hpp:162:7: warning: ‘T Sass::Operation_CRTP::operator()(Sass::Definition*) [with T = Sass::Expression*; D = Sass::Eval]’ was hidden [-Woverloaded-virtual=] 162 | T operator()(Definition* x) { return static_cast(this)->fallback(x); } | ^~~~~~~~ src/eval.hpp:96:17: note: by ‘Sass::Eval::operator()’ 96 | Expression* operator()(Parent_Reference*); | ^~~~~~~~ src/operation.hpp:161:7: warning: ‘T Sass::Operation_CRTP::operator()(Sass::ExtendRule*) [with T = Sass::Expression*; D = Sass::Eval]’ was hidden [-Woverloaded-virtual=] 161 | T operator()(ExtendRule* x) { return static_cast(this)->fallback(x); } | ^~~~~~~~ src/eval.hpp:96:17: note: by ‘Sass::Eval::operator()’ 96 | Expression* operator()(Parent_Reference*); | ^~~~~~~~ src/operation.hpp:160:7: warning: ‘T Sass::Operation_CRTP::operator()(Sass::Content*) [with T = Sass::Expression*; D = Sass::Eval]’ was hidden [-Woverloaded-virtual=] 160 | T operator()(Content* x) { return static_cast(this)->fallback(x); } | ^~~~~~~~ src/eval.hpp:96:17: note: by ‘Sass::Eval::operator()’ 96 | Expression* operator()(Parent_Reference*); | ^~~~~~~~ src/operation.hpp:150:7: warning: ‘T Sass::Operation_CRTP::operator()(Sass::Import_Stub*) [with T = Sass::Expression*; D = Sass::Eval]’ was hidden [-Woverloaded-virtual=] 150 | T operator()(Import_Stub* x) { return static_cast(this)->fallback(x); } | ^~~~~~~~ src/eval.hpp:96:17: note: by ‘Sass::Eval::operator()’ 96 | Expression* operator()(Parent_Reference*); | ^~~~~~~~ src/operation.hpp:149:7: warning: ‘T Sass::Operation_CRTP::operator()(Sass::Import*) [with T = Sass::Expression*; D = Sass::Eval]’ was hidden [-Woverloaded-virtual=] 149 | T operator()(Import* x) { return static_cast(this)->fallback(x); } | ^~~~~~~~ src/eval.hpp:96:17: note: by ‘Sass::Eval::operator()’ 96 | Expression* operator()(Parent_Reference*); | ^~~~~~~~ src/operation.hpp:147:7: warning: ‘T Sass::Operation_CRTP::operator()(Sass::Declaration*) [with T = Sass::Expression*; D = Sass::Eval]’ was hidden [-Woverloaded-virtual=] 147 | T operator()(Declaration* x) { return static_cast(this)->fallback(x); } | ^~~~~~~~ src/eval.hpp:96:17: note: by ‘Sass::Eval::operator()’ 96 | Expression* operator()(Parent_Reference*); | ^~~~~~~~ src/operation.hpp:146:7: warning: ‘T Sass::Operation_CRTP::operator()(Sass::Keyframe_Rule*) [with T = Sass::Expression*; D = Sass::Eval]’ was hidden [-Woverloaded-virtual=] 146 | T operator()(Keyframe_Rule* x) { return static_cast(this)->fallback(x); } | ^~~~~~~~ src/eval.hpp:96:17: note: by ‘Sass::Eval::operator()’ 96 | Expression* operator()(Parent_Reference*); | ^~~~~~~~ src/operation.hpp:145:7: warning: ‘T Sass::Operation_CRTP::operator()(Sass::AtRule*) [with T = Sass::Expression*; D = Sass::Eval]’ was hidden [-Woverloaded-virtual=] 145 | T operator()(AtRule* x) { return static_cast(this)->fallback(x); } | ^~~~~~~~ src/eval.hpp:96:17: note: by ‘Sass::Eval::operator()’ 96 | Expression* operator()(Parent_Reference*); | ^~~~~~~~ src/operation.hpp:144:7: warning: ‘T Sass::Operation_CRTP::operator()(Sass::AtRootRule*) [with T = Sass::Expression*; D = Sass::Eval]’ was hidden [-Woverloaded-virtual=] 144 | T operator()(AtRootRule* x) { return static_cast(this)->fallback(x); } | ^~~~~~~~ src/eval.hpp:96:17: note: by ‘Sass::Eval::operator()’ 96 | Expression* operator()(Parent_Reference*); | ^~~~~~~~ src/operation.hpp:143:7: warning: ‘T Sass::Operation_CRTP::operator()(Sass::CssMediaQuery*) [with T = Sass::Expression*; D = Sass::Eval]’ was hidden [-Woverloaded-virtual=] 143 | T operator()(CssMediaQuery* x) { return static_cast(this)->fallback(x); } | ^~~~~~~~ src/eval.hpp:96:17: note: by ‘Sass::Eval::operator()’ 96 | Expression* operator()(Parent_Reference*); | ^~~~~~~~ src/operation.hpp:142:7: warning: ‘T Sass::Operation_CRTP::operator()(Sass::CssMediaRule*) [with T = Sass::Expression*; D = Sass::Eval]’ was hidden [-Woverloaded-virtual=] 142 | T operator()(CssMediaRule* x) { return static_cast(this)->fallback(x); } | ^~~~~~~~ src/eval.hpp:96:17: note: by ‘Sass::Eval::operator()’ 96 | Expression* operator()(Parent_Reference*); | ^~~~~~~~ src/operation.hpp:141:7: warning: ‘T Sass::Operation_CRTP::operator()(Sass::MediaRule*) [with T = Sass::Expression*; D = Sass::Eval]’ was hidden [-Woverloaded-virtual=] 141 | T operator()(MediaRule* x) { return static_cast(this)->fallback(x); } | ^~~~~~~~ src/eval.hpp:96:17: note: by ‘Sass::Eval::operator()’ 96 | Expression* operator()(Parent_Reference*); | ^~~~~~~~ src/operation.hpp:140:7: warning: ‘T Sass::Operation_CRTP::operator()(Sass::SupportsRule*) [with T = Sass::Expression*; D = Sass::Eval]’ was hidden [-Woverloaded-virtual=] 140 | T operator()(SupportsRule* x) { return static_cast(this)->fallback(x); } | ^~~~~~~~ src/eval.hpp:96:17: note: by ‘Sass::Eval::operator()’ 96 | Expression* operator()(Parent_Reference*); | ^~~~~~~~ src/operation.hpp:139:7: warning: ‘T Sass::Operation_CRTP::operator()(Sass::Trace*) [with T = Sass::Expression*; D = Sass::Eval]’ was hidden [-Woverloaded-virtual=] 139 | T operator()(Trace* x) { return static_cast(this)->fallback(x); } | ^~~~~~~~ src/eval.hpp:96:17: note: by ‘Sass::Eval::operator()’ 96 | Expression* operator()(Parent_Reference*); | ^~~~~~~~ src/operation.hpp:138:7: warning: ‘T Sass::Operation_CRTP::operator()(Sass::Bubble*) [with T = Sass::Expression*; D = Sass::Eval]’ was hidden [-Woverloaded-virtual=] 138 | T operator()(Bubble* x) { return static_cast(this)->fallback(x); } | ^~~~~~~~ src/eval.hpp:96:17: note: by ‘Sass::Eval::operator()’ 96 | Expression* operator()(Parent_Reference*); | ^~~~~~~~ src/operation.hpp:137:7: warning: ‘T Sass::Operation_CRTP::operator()(Sass::StyleRule*) [with T = Sass::Expression*; D = Sass::Eval]’ was hidden [-Woverloaded-virtual=] 137 | T operator()(StyleRule* x) { return static_cast(this)->fallback(x); } | ^~~~~~~~ src/eval.hpp:96:17: note: by ‘Sass::Eval::operator()’ 96 | Expression* operator()(Parent_Reference*); | ^~~~~~~~ src/operation.hpp:134:7: warning: ‘T Sass::Operation_CRTP::operator()(Sass::AST_Node*) [with T = Sass::Expression*; D = Sass::Eval]’ was hidden [-Woverloaded-virtual=] 134 | T operator()(AST_Node* x) { return static_cast(this)->fallback(x); } | ^~~~~~~~ src/eval.hpp:96:17: note: by ‘Sass::Eval::operator()’ 96 | Expression* operator()(Parent_Reference*); | ^~~~~~~~ g++ -std=gnu++17 -Wall -O2 -std=c++11 -I ./include -fPIC -c -o src/listize.o src/listize.cpp In file included from src/context.hpp:7, from src/listize.cpp:10: src/ast.hpp:90:18: warning: ‘virtual bool Sass::AST_Node::operator==(const Sass::AST_Node&) const’ was hidden [-Woverloaded-virtual=] 90 | virtual bool operator== (const AST_Node& rhs) const { | ^~~~~~~~ src/ast.hpp:165:18: note: by ‘virtual bool Sass::Expression::operator==(const Sass::Expression&) const’ 165 | virtual bool operator== (const Expression& rhs) const { return false; } | ^~~~~~~~ src/ast.hpp:96:18: warning: ‘virtual bool Sass::AST_Node::operator!=(const Sass::AST_Node&) const’ was hidden [-Woverloaded-virtual=] 96 | virtual bool operator!= (const AST_Node& rhs) const { | ^~~~~~~~ src/ast.hpp:167:17: note: by ‘bool Sass::Expression::operator!=(const Sass::Expression&) const’ 167 | inline bool operator!=(const Expression& rhs) const { return !(rhs == *this); } | ^~~~~~~~ src/ast.hpp:90:18: warning: ‘virtual bool Sass::AST_Node::operator==(const Sass::AST_Node&) const’ was hidden [-Woverloaded-virtual=] 90 | virtual bool operator== (const AST_Node& rhs) const { | ^~~~~~~~ src/ast.hpp:908:10: note: by ‘bool Sass::CssMediaRule::operator==(const Sass::CssMediaRule&) const’ 908 | bool operator== (const CssMediaRule& rhs) const { | ^~~~~~~~ src/ast.hpp:96:18: warning: ‘virtual bool Sass::AST_Node::operator!=(const Sass::AST_Node&) const’ was hidden [-Woverloaded-virtual=] 96 | virtual bool operator!= (const AST_Node& rhs) const { | ^~~~~~~~ src/ast.hpp:911:10: note: by ‘bool Sass::CssMediaRule::operator!=(const Sass::CssMediaRule&) const’ 911 | bool operator!=(const CssMediaRule& rhs) const { | ^~~~~~~~ src/ast.hpp:90:18: warning: ‘virtual bool Sass::AST_Node::operator==(const Sass::AST_Node&) const’ was hidden [-Woverloaded-virtual=] 90 | virtual bool operator== (const AST_Node& rhs) const { | ^~~~~~~~ src/ast.hpp:939:10: note: by ‘bool Sass::CssMediaQuery::operator==(const Sass::CssMediaQuery&) const’ 939 | bool operator== (const CssMediaQuery& rhs) const; | ^~~~~~~~ src/ast.hpp:96:18: warning: ‘virtual bool Sass::AST_Node::operator!=(const Sass::AST_Node&) const’ was hidden [-Woverloaded-virtual=] 96 | virtual bool operator!= (const AST_Node& rhs) const { | ^~~~~~~~ src/ast.hpp:940:10: note: by ‘bool Sass::CssMediaQuery::operator!=(const Sass::CssMediaQuery&) const’ 940 | bool operator!=(const CssMediaQuery& rhs) const { | ^~~~~~~~ src/ast.hpp:165:18: warning: ‘virtual bool Sass::Expression::operator==(const Sass::Expression&) const’ was hidden [-Woverloaded-virtual=] 165 | virtual bool operator== (const Expression& rhs) const { return false; } | ^~~~~~~~ In file included from src/operation.hpp:15, from src/listize.hpp:9, from src/listize.cpp:9: src/ast_def_macros.hpp:105:16: note: by ‘virtual bool Sass::Selector::operator==(const Sass::Selector&) const’ 105 | virtual bool operator==(const klass& rhs) const = 0; \ | ^~~~~~~~ src/ast_selectors.hpp:56:5: note: in expansion of macro ‘ATTACH_VIRTUAL_CMP_OPERATIONS’ 56 | ATTACH_VIRTUAL_CMP_OPERATIONS(Selector) | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~ src/ast.hpp:96:18: warning: ‘virtual bool Sass::AST_Node::operator!=(const Sass::AST_Node&) const’ was hidden [-Woverloaded-virtual=] 96 | virtual bool operator!= (const AST_Node& rhs) const { | ^~~~~~~~ src/ast_def_macros.hpp:106:16: note: by ‘virtual bool Sass::Selector::operator!=(const Sass::Selector&) const’ 106 | virtual bool operator!=(const klass& rhs) const { return !(*this == rhs); }; \ | ^~~~~~~~ src/ast_selectors.hpp:56:5: note: in expansion of macro ‘ATTACH_VIRTUAL_CMP_OPERATIONS’ 56 | ATTACH_VIRTUAL_CMP_OPERATIONS(Selector) | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~ src/ast_def_macros.hpp:106:16: warning: ‘virtual bool Sass::Selector::operator!=(const Sass::Selector&) const’ was hidden [-Woverloaded-virtual=] 106 | virtual bool operator!=(const klass& rhs) const { return !(*this == rhs); }; \ | ^~~~~~~~ src/ast_selectors.hpp:56:5: note: in expansion of macro ‘ATTACH_VIRTUAL_CMP_OPERATIONS’ 56 | ATTACH_VIRTUAL_CMP_OPERATIONS(Selector) | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~ src/ast_def_macros.hpp:106:16: note: by ‘virtual bool Sass::SimpleSelector::operator!=(const Sass::SimpleSelector&) const’ 106 | virtual bool operator!=(const klass& rhs) const { return !(*this == rhs); }; \ | ^~~~~~~~ src/ast_selectors.hpp:139:5: note: in expansion of macro ‘ATTACH_VIRTUAL_CMP_OPERATIONS’ 139 | ATTACH_VIRTUAL_CMP_OPERATIONS(SimpleSelector); | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~ In file included from src/ast.hpp:1055: src/ast_selectors.hpp:137:18: warning: ‘virtual bool Sass::SimpleSelector::operator==(const Sass::CompoundSelector&) const’ was hidden [-Woverloaded-virtual=] 137 | virtual bool operator==(const CompoundSelector& rhs) const; | ^~~~~~~~ src/ast_def_macros.hpp:109:16: note: by ‘Sass::PlaceholderSelector::operator==’ 109 | virtual bool operator==(const klass& rhs) const; \ | ^~~~~~~~ src/ast_selectors.hpp:157:5: note: in expansion of macro ‘ATTACH_CMP_OPERATIONS’ 157 | ATTACH_CMP_OPERATIONS(PlaceholderSelector) | ^~~~~~~~~~~~~~~~~~~~~ src/ast_selectors.hpp:136:18: warning: ‘virtual bool Sass::SimpleSelector::operator==(const Sass::ComplexSelector&) const’ was hidden [-Woverloaded-virtual=] 136 | virtual bool operator==(const ComplexSelector& rhs) const; | ^~~~~~~~ src/ast_def_macros.hpp:109:16: note: by ‘Sass::PlaceholderSelector::operator==’ 109 | virtual bool operator==(const klass& rhs) const; \ | ^~~~~~~~ src/ast_selectors.hpp:157:5: note: in expansion of macro ‘ATTACH_CMP_OPERATIONS’ 157 | ATTACH_CMP_OPERATIONS(PlaceholderSelector) | ^~~~~~~~~~~~~~~~~~~~~ src/ast_selectors.hpp:135:18: warning: ‘virtual bool Sass::SimpleSelector::operator==(const Sass::SelectorList&) const’ was hidden [-Woverloaded-virtual=] 135 | virtual bool operator==(const SelectorList& rhs) const; | ^~~~~~~~ src/ast_def_macros.hpp:109:16: note: by ‘Sass::PlaceholderSelector::operator==’ 109 | virtual bool operator==(const klass& rhs) const; \ | ^~~~~~~~ src/ast_selectors.hpp:157:5: note: in expansion of macro ‘ATTACH_CMP_OPERATIONS’ 157 | ATTACH_CMP_OPERATIONS(PlaceholderSelector) | ^~~~~~~~~~~~~~~~~~~~~ src/ast_selectors.hpp:133:10: warning: ‘virtual bool Sass::SimpleSelector::operator==(const Sass::Selector&) const’ was hidden [-Woverloaded-virtual=] 133 | bool operator==(const Selector& rhs) const final override; | ^~~~~~~~ src/ast_def_macros.hpp:109:16: note: by ‘Sass::PlaceholderSelector::operator==’ 109 | virtual bool operator==(const klass& rhs) const; \ | ^~~~~~~~ src/ast_selectors.hpp:157:5: note: in expansion of macro ‘ATTACH_CMP_OPERATIONS’ 157 | ATTACH_CMP_OPERATIONS(PlaceholderSelector) | ^~~~~~~~~~~~~~~~~~~~~ src/ast_def_macros.hpp:106:16: warning: ‘virtual bool Sass::SimpleSelector::operator!=(const Sass::SimpleSelector&) const’ was hidden [-Woverloaded-virtual=] 106 | virtual bool operator!=(const klass& rhs) const { return !(*this == rhs); }; \ | ^~~~~~~~ src/ast_selectors.hpp:139:5: note: in expansion of macro ‘ATTACH_VIRTUAL_CMP_OPERATIONS’ 139 | ATTACH_VIRTUAL_CMP_OPERATIONS(SimpleSelector); | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~ src/ast_def_macros.hpp:110:16: note: by ‘virtual bool Sass::PlaceholderSelector::operator!=(const Sass::PlaceholderSelector&) const’ 110 | virtual bool operator!=(const klass& rhs) const { return !(*this == rhs); }; \ | ^~~~~~~~ src/ast_selectors.hpp:157:5: note: in expansion of macro ‘ATTACH_CMP_OPERATIONS’ 157 | ATTACH_CMP_OPERATIONS(PlaceholderSelector) | ^~~~~~~~~~~~~~~~~~~~~ src/ast_selectors.hpp:137:18: warning: ‘virtual bool Sass::SimpleSelector::operator==(const Sass::CompoundSelector&) const’ was hidden [-Woverloaded-virtual=] 137 | virtual bool operator==(const CompoundSelector& rhs) const; | ^~~~~~~~ src/ast_def_macros.hpp:109:16: note: by ‘Sass::TypeSelector::operator==’ 109 | virtual bool operator==(const klass& rhs) const; \ | ^~~~~~~~ src/ast_selectors.hpp:174:5: note: in expansion of macro ‘ATTACH_CMP_OPERATIONS’ 174 | ATTACH_CMP_OPERATIONS(TypeSelector) | ^~~~~~~~~~~~~~~~~~~~~ src/ast_selectors.hpp:136:18: warning: ‘virtual bool Sass::SimpleSelector::operator==(const Sass::ComplexSelector&) const’ was hidden [-Woverloaded-virtual=] 136 | virtual bool operator==(const ComplexSelector& rhs) const; | ^~~~~~~~ src/ast_def_macros.hpp:109:16: note: by ‘Sass::TypeSelector::operator==’ 109 | virtual bool operator==(const klass& rhs) const; \ | ^~~~~~~~ src/ast_selectors.hpp:174:5: note: in expansion of macro ‘ATTACH_CMP_OPERATIONS’ 174 | ATTACH_CMP_OPERATIONS(TypeSelector) | ^~~~~~~~~~~~~~~~~~~~~ src/ast_selectors.hpp:135:18: warning: ‘virtual bool Sass::SimpleSelector::operator==(const Sass::SelectorList&) const’ was hidden [-Woverloaded-virtual=] 135 | virtual bool operator==(const SelectorList& rhs) const; | ^~~~~~~~ src/ast_def_macros.hpp:109:16: note: by ‘Sass::TypeSelector::operator==’ 109 | virtual bool operator==(const klass& rhs) const; \ | ^~~~~~~~ src/ast_selectors.hpp:174:5: note: in expansion of macro ‘ATTACH_CMP_OPERATIONS’ 174 | ATTACH_CMP_OPERATIONS(TypeSelector) | ^~~~~~~~~~~~~~~~~~~~~ src/ast_selectors.hpp:133:10: warning: ‘virtual bool Sass::SimpleSelector::operator==(const Sass::Selector&) const’ was hidden [-Woverloaded-virtual=] 133 | bool operator==(const Selector& rhs) const final override; | ^~~~~~~~ src/ast_def_macros.hpp:109:16: note: by ‘Sass::TypeSelector::operator==’ 109 | virtual bool operator==(const klass& rhs) const; \ | ^~~~~~~~ src/ast_selectors.hpp:174:5: note: in expansion of macro ‘ATTACH_CMP_OPERATIONS’ 174 | ATTACH_CMP_OPERATIONS(TypeSelector) | ^~~~~~~~~~~~~~~~~~~~~ src/ast_def_macros.hpp:106:16: warning: ‘virtual bool Sass::SimpleSelector::operator!=(const Sass::SimpleSelector&) const’ was hidden [-Woverloaded-virtual=] 106 | virtual bool operator!=(const klass& rhs) const { return !(*this == rhs); }; \ | ^~~~~~~~ src/ast_selectors.hpp:139:5: note: in expansion of macro ‘ATTACH_VIRTUAL_CMP_OPERATIONS’ 139 | ATTACH_VIRTUAL_CMP_OPERATIONS(SimpleSelector); | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~ src/ast_def_macros.hpp:110:16: note: by ‘virtual bool Sass::TypeSelector::operator!=(const Sass::TypeSelector&) const’ 110 | virtual bool operator!=(const klass& rhs) const { return !(*this == rhs); }; \ | ^~~~~~~~ src/ast_selectors.hpp:174:5: note: in expansion of macro ‘ATTACH_CMP_OPERATIONS’ 174 | ATTACH_CMP_OPERATIONS(TypeSelector) | ^~~~~~~~~~~~~~~~~~~~~ src/ast_selectors.hpp:137:18: warning: ‘virtual bool Sass::SimpleSelector::operator==(const Sass::CompoundSelector&) const’ was hidden [-Woverloaded-virtual=] 137 | virtual bool operator==(const CompoundSelector& rhs) const; | ^~~~~~~~ src/ast_def_macros.hpp:109:16: note: by ‘Sass::ClassSelector::operator==’ 109 | virtual bool operator==(const klass& rhs) const; \ | ^~~~~~~~ src/ast_selectors.hpp:188:5: note: in expansion of macro ‘ATTACH_CMP_OPERATIONS’ 188 | ATTACH_CMP_OPERATIONS(ClassSelector) | ^~~~~~~~~~~~~~~~~~~~~ src/ast_selectors.hpp:136:18: warning: ‘virtual bool Sass::SimpleSelector::operator==(const Sass::ComplexSelector&) const’ was hidden [-Woverloaded-virtual=] 136 | virtual bool operator==(const ComplexSelector& rhs) const; | ^~~~~~~~ src/ast_def_macros.hpp:109:16: note: by ‘Sass::ClassSelector::operator==’ 109 | virtual bool operator==(const klass& rhs) const; \ | ^~~~~~~~ src/ast_selectors.hpp:188:5: note: in expansion of macro ‘ATTACH_CMP_OPERATIONS’ 188 | ATTACH_CMP_OPERATIONS(ClassSelector) | ^~~~~~~~~~~~~~~~~~~~~ src/ast_selectors.hpp:135:18: warning: ‘virtual bool Sass::SimpleSelector::operator==(const Sass::SelectorList&) const’ was hidden [-Woverloaded-virtual=] 135 | virtual bool operator==(const SelectorList& rhs) const; | ^~~~~~~~ src/ast_def_macros.hpp:109:16: note: by ‘Sass::ClassSelector::operator==’ 109 | virtual bool operator==(const klass& rhs) const; \ | ^~~~~~~~ src/ast_selectors.hpp:188:5: note: in expansion of macro ‘ATTACH_CMP_OPERATIONS’ 188 | ATTACH_CMP_OPERATIONS(ClassSelector) | ^~~~~~~~~~~~~~~~~~~~~ src/ast_selectors.hpp:133:10: warning: ‘virtual bool Sass::SimpleSelector::operator==(const Sass::Selector&) const’ was hidden [-Woverloaded-virtual=] 133 | bool operator==(const Selector& rhs) const final override; | ^~~~~~~~ src/ast_def_macros.hpp:109:16: note: by ‘Sass::ClassSelector::operator==’ 109 | virtual bool operator==(const klass& rhs) const; \ | ^~~~~~~~ src/ast_selectors.hpp:188:5: note: in expansion of macro ‘ATTACH_CMP_OPERATIONS’ 188 | ATTACH_CMP_OPERATIONS(ClassSelector) | ^~~~~~~~~~~~~~~~~~~~~ src/ast_def_macros.hpp:106:16: warning: ‘virtual bool Sass::SimpleSelector::operator!=(const Sass::SimpleSelector&) const’ was hidden [-Woverloaded-virtual=] 106 | virtual bool operator!=(const klass& rhs) const { return !(*this == rhs); }; \ | ^~~~~~~~ src/ast_selectors.hpp:139:5: note: in expansion of macro ‘ATTACH_VIRTUAL_CMP_OPERATIONS’ 139 | ATTACH_VIRTUAL_CMP_OPERATIONS(SimpleSelector); | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~ src/ast_def_macros.hpp:110:16: note: by ‘virtual bool Sass::ClassSelector::operator!=(const Sass::ClassSelector&) const’ 110 | virtual bool operator!=(const klass& rhs) const { return !(*this == rhs); }; \ | ^~~~~~~~ src/ast_selectors.hpp:188:5: note: in expansion of macro ‘ATTACH_CMP_OPERATIONS’ 188 | ATTACH_CMP_OPERATIONS(ClassSelector) | ^~~~~~~~~~~~~~~~~~~~~ src/ast_selectors.hpp:137:18: warning: ‘virtual bool Sass::SimpleSelector::operator==(const Sass::CompoundSelector&) const’ was hidden [-Woverloaded-virtual=] 137 | virtual bool operator==(const CompoundSelector& rhs) const; | ^~~~~~~~ src/ast_def_macros.hpp:109:16: note: by ‘Sass::IDSelector::operator==’ 109 | virtual bool operator==(const klass& rhs) const; \ | ^~~~~~~~ src/ast_selectors.hpp:204:5: note: in expansion of macro ‘ATTACH_CMP_OPERATIONS’ 204 | ATTACH_CMP_OPERATIONS(IDSelector) | ^~~~~~~~~~~~~~~~~~~~~ src/ast_selectors.hpp:136:18: warning: ‘virtual bool Sass::SimpleSelector::operator==(const Sass::ComplexSelector&) const’ was hidden [-Woverloaded-virtual=] 136 | virtual bool operator==(const ComplexSelector& rhs) const; | ^~~~~~~~ src/ast_def_macros.hpp:109:16: note: by ‘Sass::IDSelector::operator==’ 109 | virtual bool operator==(const klass& rhs) const; \ | ^~~~~~~~ src/ast_selectors.hpp:204:5: note: in expansion of macro ‘ATTACH_CMP_OPERATIONS’ 204 | ATTACH_CMP_OPERATIONS(IDSelector) | ^~~~~~~~~~~~~~~~~~~~~ src/ast_selectors.hpp:135:18: warning: ‘virtual bool Sass::SimpleSelector::operator==(const Sass::SelectorList&) const’ was hidden [-Woverloaded-virtual=] 135 | virtual bool operator==(const SelectorList& rhs) const; | ^~~~~~~~ src/ast_def_macros.hpp:109:16: note: by ‘Sass::IDSelector::operator==’ 109 | virtual bool operator==(const klass& rhs) const; \ | ^~~~~~~~ src/ast_selectors.hpp:204:5: note: in expansion of macro ‘ATTACH_CMP_OPERATIONS’ 204 | ATTACH_CMP_OPERATIONS(IDSelector) | ^~~~~~~~~~~~~~~~~~~~~ src/ast_selectors.hpp:133:10: warning: ‘virtual bool Sass::SimpleSelector::operator==(const Sass::Selector&) const’ was hidden [-Woverloaded-virtual=] 133 | bool operator==(const Selector& rhs) const final override; | ^~~~~~~~ src/ast_def_macros.hpp:109:16: note: by ‘Sass::IDSelector::operator==’ 109 | virtual bool operator==(const klass& rhs) const; \ | ^~~~~~~~ src/ast_selectors.hpp:204:5: note: in expansion of macro ‘ATTACH_CMP_OPERATIONS’ 204 | ATTACH_CMP_OPERATIONS(IDSelector) | ^~~~~~~~~~~~~~~~~~~~~ src/ast_def_macros.hpp:106:16: warning: ‘virtual bool Sass::SimpleSelector::operator!=(const Sass::SimpleSelector&) const’ was hidden [-Woverloaded-virtual=] 106 | virtual bool operator!=(const klass& rhs) const { return !(*this == rhs); }; \ | ^~~~~~~~ src/ast_selectors.hpp:139:5: note: in expansion of macro ‘ATTACH_VIRTUAL_CMP_OPERATIONS’ 139 | ATTACH_VIRTUAL_CMP_OPERATIONS(SimpleSelector); | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~ src/ast_def_macros.hpp:110:16: note: by ‘virtual bool Sass::IDSelector::operator!=(const Sass::IDSelector&) const’ 110 | virtual bool operator!=(const klass& rhs) const { return !(*this == rhs); }; \ | ^~~~~~~~ src/ast_selectors.hpp:204:5: note: in expansion of macro ‘ATTACH_CMP_OPERATIONS’ 204 | ATTACH_CMP_OPERATIONS(IDSelector) | ^~~~~~~~~~~~~~~~~~~~~ src/ast_selectors.hpp:137:18: warning: ‘virtual bool Sass::SimpleSelector::operator==(const Sass::CompoundSelector&) const’ was hidden [-Woverloaded-virtual=] 137 | virtual bool operator==(const CompoundSelector& rhs) const; | ^~~~~~~~ src/ast_def_macros.hpp:109:16: note: by ‘Sass::AttributeSelector::operator==’ 109 | virtual bool operator==(const klass& rhs) const; \ | ^~~~~~~~ src/ast_selectors.hpp:223:5: note: in expansion of macro ‘ATTACH_CMP_OPERATIONS’ 223 | ATTACH_CMP_OPERATIONS(AttributeSelector) | ^~~~~~~~~~~~~~~~~~~~~ src/ast_selectors.hpp:136:18: warning: ‘virtual bool Sass::SimpleSelector::operator==(const Sass::ComplexSelector&) const’ was hidden [-Woverloaded-virtual=] 136 | virtual bool operator==(const ComplexSelector& rhs) const; | ^~~~~~~~ src/ast_def_macros.hpp:109:16: note: by ‘Sass::AttributeSelector::operator==’ 109 | virtual bool operator==(const klass& rhs) const; \ | ^~~~~~~~ src/ast_selectors.hpp:223:5: note: in expansion of macro ‘ATTACH_CMP_OPERATIONS’ 223 | ATTACH_CMP_OPERATIONS(AttributeSelector) | ^~~~~~~~~~~~~~~~~~~~~ src/ast_selectors.hpp:135:18: warning: ‘virtual bool Sass::SimpleSelector::operator==(const Sass::SelectorList&) const’ was hidden [-Woverloaded-virtual=] 135 | virtual bool operator==(const SelectorList& rhs) const; | ^~~~~~~~ src/ast_def_macros.hpp:109:16: note: by ‘Sass::AttributeSelector::operator==’ 109 | virtual bool operator==(const klass& rhs) const; \ | ^~~~~~~~ src/ast_selectors.hpp:223:5: note: in expansion of macro ‘ATTACH_CMP_OPERATIONS’ 223 | ATTACH_CMP_OPERATIONS(AttributeSelector) | ^~~~~~~~~~~~~~~~~~~~~ src/ast_selectors.hpp:133:10: warning: ‘virtual bool Sass::SimpleSelector::operator==(const Sass::Selector&) const’ was hidden [-Woverloaded-virtual=] 133 | bool operator==(const Selector& rhs) const final override; | ^~~~~~~~ src/ast_def_macros.hpp:109:16: note: by ‘Sass::AttributeSelector::operator==’ 109 | virtual bool operator==(const klass& rhs) const; \ | ^~~~~~~~ src/ast_selectors.hpp:223:5: note: in expansion of macro ‘ATTACH_CMP_OPERATIONS’ 223 | ATTACH_CMP_OPERATIONS(AttributeSelector) | ^~~~~~~~~~~~~~~~~~~~~ src/ast_def_macros.hpp:106:16: warning: ‘virtual bool Sass::SimpleSelector::operator!=(const Sass::SimpleSelector&) const’ was hidden [-Woverloaded-virtual=] 106 | virtual bool operator!=(const klass& rhs) const { return !(*this == rhs); }; \ | ^~~~~~~~ src/ast_selectors.hpp:139:5: note: in expansion of macro ‘ATTACH_VIRTUAL_CMP_OPERATIONS’ 139 | ATTACH_VIRTUAL_CMP_OPERATIONS(SimpleSelector); | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~ src/ast_def_macros.hpp:110:16: note: by ‘virtual bool Sass::AttributeSelector::operator!=(const Sass::AttributeSelector&) const’ 110 | virtual bool operator!=(const klass& rhs) const { return !(*this == rhs); }; \ | ^~~~~~~~ src/ast_selectors.hpp:223:5: note: in expansion of macro ‘ATTACH_CMP_OPERATIONS’ 223 | ATTACH_CMP_OPERATIONS(AttributeSelector) | ^~~~~~~~~~~~~~~~~~~~~ src/ast_def_macros.hpp:106:16: warning: ‘virtual bool Sass::Selector::operator!=(const Sass::Selector&) const’ was hidden [-Woverloaded-virtual=] 106 | virtual bool operator!=(const klass& rhs) const { return !(*this == rhs); }; \ | ^~~~~~~~ src/ast_selectors.hpp:56:5: note: in expansion of macro ‘ATTACH_VIRTUAL_CMP_OPERATIONS’ 56 | ATTACH_VIRTUAL_CMP_OPERATIONS(Selector) | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~ src/ast_def_macros.hpp:110:16: note: by ‘virtual bool Sass::ComplexSelector::operator!=(const Sass::ComplexSelector&) const’ 110 | virtual bool operator!=(const klass& rhs) const { return !(*this == rhs); }; \ | ^~~~~~~~ src/ast_selectors.hpp:310:5: note: in expansion of macro ‘ATTACH_CMP_OPERATIONS’ 310 | ATTACH_CMP_OPERATIONS(ComplexSelector) | ^~~~~~~~~~~~~~~~~~~~~ src/ast_def_macros.hpp:106:16: warning: ‘virtual bool Sass::Selector::operator!=(const Sass::Selector&) const’ was hidden [-Woverloaded-virtual=] 106 | virtual bool operator!=(const klass& rhs) const { return !(*this == rhs); }; \ | ^~~~~~~~ src/ast_selectors.hpp:56:5: note: in expansion of macro ‘ATTACH_VIRTUAL_CMP_OPERATIONS’ 56 | ATTACH_VIRTUAL_CMP_OPERATIONS(Selector) | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~ src/ast_def_macros.hpp:106:16: note: by ‘virtual bool Sass::SelectorComponent::operator!=(const Sass::SelectorComponent&) const’ 106 | virtual bool operator!=(const klass& rhs) const { return !(*this == rhs); }; \ | ^~~~~~~~ src/ast_selectors.hpp:349:5: note: in expansion of macro ‘ATTACH_VIRTUAL_CMP_OPERATIONS’ 349 | ATTACH_VIRTUAL_CMP_OPERATIONS(SelectorComponent); | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~ src/ast_def_macros.hpp:106:16: warning: ‘virtual bool Sass::SelectorComponent::operator!=(const Sass::SelectorComponent&) const’ was hidden [-Woverloaded-virtual=] 106 | virtual bool operator!=(const klass& rhs) const { return !(*this == rhs); }; \ | ^~~~~~~~ src/ast_selectors.hpp:349:5: note: in expansion of macro ‘ATTACH_VIRTUAL_CMP_OPERATIONS’ 349 | ATTACH_VIRTUAL_CMP_OPERATIONS(SelectorComponent); | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~ src/ast_def_macros.hpp:110:16: note: by ‘virtual bool Sass::SelectorCombinator::operator!=(const Sass::SelectorCombinator&) const’ 110 | virtual bool operator!=(const klass& rhs) const { return !(*this == rhs); }; \ | ^~~~~~~~ src/ast_selectors.hpp:407:5: note: in expansion of macro ‘ATTACH_CMP_OPERATIONS’ 407 | ATTACH_CMP_OPERATIONS(SelectorCombinator) | ^~~~~~~~~~~~~~~~~~~~~ g++ -std=gnu++17 -Wall -O2 -std=c++11 -I ./include -fPIC -c -o src/cssize.o src/cssize.cpp In file included from src/cssize.hpp:4, from src/cssize.cpp:9: src/ast.hpp:90:18: warning: ‘virtual bool Sass::AST_Node::operator==(const Sass::AST_Node&) const’ was hidden [-Woverloaded-virtual=] 90 | virtual bool operator== (const AST_Node& rhs) const { | ^~~~~~~~ src/ast.hpp:165:18: note: by ‘virtual bool Sass::Expression::operator==(const Sass::Expression&) const’ 165 | virtual bool operator== (const Expression& rhs) const { return false; } | ^~~~~~~~ src/ast.hpp:96:18: warning: ‘virtual bool Sass::AST_Node::operator!=(const Sass::AST_Node&) const’ was hidden [-Woverloaded-virtual=] 96 | virtual bool operator!= (const AST_Node& rhs) const { | ^~~~~~~~ src/ast.hpp:167:17: note: by ‘bool Sass::Expression::operator!=(const Sass::Expression&) const’ 167 | inline bool operator!=(const Expression& rhs) const { return !(rhs == *this); } | ^~~~~~~~ src/ast.hpp:90:18: warning: ‘virtual bool Sass::AST_Node::operator==(const Sass::AST_Node&) const’ was hidden [-Woverloaded-virtual=] 90 | virtual bool operator== (const AST_Node& rhs) const { | ^~~~~~~~ src/ast.hpp:908:10: note: by ‘bool Sass::CssMediaRule::operator==(const Sass::CssMediaRule&) const’ 908 | bool operator== (const CssMediaRule& rhs) const { | ^~~~~~~~ src/ast.hpp:96:18: warning: ‘virtual bool Sass::AST_Node::operator!=(const Sass::AST_Node&) const’ was hidden [-Woverloaded-virtual=] 96 | virtual bool operator!= (const AST_Node& rhs) const { | ^~~~~~~~ src/ast.hpp:911:10: note: by ‘bool Sass::CssMediaRule::operator!=(const Sass::CssMediaRule&) const’ 911 | bool operator!=(const CssMediaRule& rhs) const { | ^~~~~~~~ src/ast.hpp:90:18: warning: ‘virtual bool Sass::AST_Node::operator==(const Sass::AST_Node&) const’ was hidden [-Woverloaded-virtual=] 90 | virtual bool operator== (const AST_Node& rhs) const { | ^~~~~~~~ src/ast.hpp:939:10: note: by ‘bool Sass::CssMediaQuery::operator==(const Sass::CssMediaQuery&) const’ 939 | bool operator== (const CssMediaQuery& rhs) const; | ^~~~~~~~ src/ast.hpp:96:18: warning: ‘virtual bool Sass::AST_Node::operator!=(const Sass::AST_Node&) const’ was hidden [-Woverloaded-virtual=] 96 | virtual bool operator!= (const AST_Node& rhs) const { | ^~~~~~~~ src/ast.hpp:940:10: note: by ‘bool Sass::CssMediaQuery::operator!=(const Sass::CssMediaQuery&) const’ 940 | bool operator!=(const CssMediaQuery& rhs) const { | ^~~~~~~~ src/ast.hpp:165:18: warning: ‘virtual bool Sass::Expression::operator==(const Sass::Expression&) const’ was hidden [-Woverloaded-virtual=] 165 | virtual bool operator== (const Expression& rhs) const { return false; } | ^~~~~~~~ In file included from src/ast.hpp:14: src/ast_def_macros.hpp:105:16: note: by ‘virtual bool Sass::Selector::operator==(const Sass::Selector&) const’ 105 | virtual bool operator==(const klass& rhs) const = 0; \ | ^~~~~~~~ src/ast_selectors.hpp:56:5: note: in expansion of macro ‘ATTACH_VIRTUAL_CMP_OPERATIONS’ 56 | ATTACH_VIRTUAL_CMP_OPERATIONS(Selector) | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~ src/ast.hpp:96:18: warning: ‘virtual bool Sass::AST_Node::operator!=(const Sass::AST_Node&) const’ was hidden [-Woverloaded-virtual=] 96 | virtual bool operator!= (const AST_Node& rhs) const { | ^~~~~~~~ src/ast_def_macros.hpp:106:16: note: by ‘virtual bool Sass::Selector::operator!=(const Sass::Selector&) const’ 106 | virtual bool operator!=(const klass& rhs) const { return !(*this == rhs); }; \ | ^~~~~~~~ src/ast_selectors.hpp:56:5: note: in expansion of macro ‘ATTACH_VIRTUAL_CMP_OPERATIONS’ 56 | ATTACH_VIRTUAL_CMP_OPERATIONS(Selector) | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~ src/ast_def_macros.hpp:106:16: warning: ‘virtual bool Sass::Selector::operator!=(const Sass::Selector&) const’ was hidden [-Woverloaded-virtual=] 106 | virtual bool operator!=(const klass& rhs) const { return !(*this == rhs); }; \ | ^~~~~~~~ src/ast_selectors.hpp:56:5: note: in expansion of macro ‘ATTACH_VIRTUAL_CMP_OPERATIONS’ 56 | ATTACH_VIRTUAL_CMP_OPERATIONS(Selector) | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~ src/ast_def_macros.hpp:106:16: note: by ‘virtual bool Sass::SimpleSelector::operator!=(const Sass::SimpleSelector&) const’ 106 | virtual bool operator!=(const klass& rhs) const { return !(*this == rhs); }; \ | ^~~~~~~~ src/ast_selectors.hpp:139:5: note: in expansion of macro ‘ATTACH_VIRTUAL_CMP_OPERATIONS’ 139 | ATTACH_VIRTUAL_CMP_OPERATIONS(SimpleSelector); | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~ In file included from src/ast.hpp:1055: src/ast_selectors.hpp:137:18: warning: ‘virtual bool Sass::SimpleSelector::operator==(const Sass::CompoundSelector&) const’ was hidden [-Woverloaded-virtual=] 137 | virtual bool operator==(const CompoundSelector& rhs) const; | ^~~~~~~~ src/ast_def_macros.hpp:109:16: note: by ‘Sass::PlaceholderSelector::operator==’ 109 | virtual bool operator==(const klass& rhs) const; \ | ^~~~~~~~ src/ast_selectors.hpp:157:5: note: in expansion of macro ‘ATTACH_CMP_OPERATIONS’ 157 | ATTACH_CMP_OPERATIONS(PlaceholderSelector) | ^~~~~~~~~~~~~~~~~~~~~ src/ast_selectors.hpp:136:18: warning: ‘virtual bool Sass::SimpleSelector::operator==(const Sass::ComplexSelector&) const’ was hidden [-Woverloaded-virtual=] 136 | virtual bool operator==(const ComplexSelector& rhs) const; | ^~~~~~~~ src/ast_def_macros.hpp:109:16: note: by ‘Sass::PlaceholderSelector::operator==’ 109 | virtual bool operator==(const klass& rhs) const; \ | ^~~~~~~~ src/ast_selectors.hpp:157:5: note: in expansion of macro ‘ATTACH_CMP_OPERATIONS’ 157 | ATTACH_CMP_OPERATIONS(PlaceholderSelector) | ^~~~~~~~~~~~~~~~~~~~~ src/ast_selectors.hpp:135:18: warning: ‘virtual bool Sass::SimpleSelector::operator==(const Sass::SelectorList&) const’ was hidden [-Woverloaded-virtual=] 135 | virtual bool operator==(const SelectorList& rhs) const; | ^~~~~~~~ src/ast_def_macros.hpp:109:16: note: by ‘Sass::PlaceholderSelector::operator==’ 109 | virtual bool operator==(const klass& rhs) const; \ | ^~~~~~~~ src/ast_selectors.hpp:157:5: note: in expansion of macro ‘ATTACH_CMP_OPERATIONS’ 157 | ATTACH_CMP_OPERATIONS(PlaceholderSelector) | ^~~~~~~~~~~~~~~~~~~~~ src/ast_selectors.hpp:133:10: warning: ‘virtual bool Sass::SimpleSelector::operator==(const Sass::Selector&) const’ was hidden [-Woverloaded-virtual=] 133 | bool operator==(const Selector& rhs) const final override; | ^~~~~~~~ src/ast_def_macros.hpp:109:16: note: by ‘Sass::PlaceholderSelector::operator==’ 109 | virtual bool operator==(const klass& rhs) const; \ | ^~~~~~~~ src/ast_selectors.hpp:157:5: note: in expansion of macro ‘ATTACH_CMP_OPERATIONS’ 157 | ATTACH_CMP_OPERATIONS(PlaceholderSelector) | ^~~~~~~~~~~~~~~~~~~~~ src/ast_def_macros.hpp:106:16: warning: ‘virtual bool Sass::SimpleSelector::operator!=(const Sass::SimpleSelector&) const’ was hidden [-Woverloaded-virtual=] 106 | virtual bool operator!=(const klass& rhs) const { return !(*this == rhs); }; \ | ^~~~~~~~ src/ast_selectors.hpp:139:5: note: in expansion of macro ‘ATTACH_VIRTUAL_CMP_OPERATIONS’ 139 | ATTACH_VIRTUAL_CMP_OPERATIONS(SimpleSelector); | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~ src/ast_def_macros.hpp:110:16: note: by ‘virtual bool Sass::PlaceholderSelector::operator!=(const Sass::PlaceholderSelector&) const’ 110 | virtual bool operator!=(const klass& rhs) const { return !(*this == rhs); }; \ | ^~~~~~~~ src/ast_selectors.hpp:157:5: note: in expansion of macro ‘ATTACH_CMP_OPERATIONS’ 157 | ATTACH_CMP_OPERATIONS(PlaceholderSelector) | ^~~~~~~~~~~~~~~~~~~~~ src/ast_selectors.hpp:137:18: warning: ‘virtual bool Sass::SimpleSelector::operator==(const Sass::CompoundSelector&) const’ was hidden [-Woverloaded-virtual=] 137 | virtual bool operator==(const CompoundSelector& rhs) const; | ^~~~~~~~ src/ast_def_macros.hpp:109:16: note: by ‘Sass::TypeSelector::operator==’ 109 | virtual bool operator==(const klass& rhs) const; \ | ^~~~~~~~ src/ast_selectors.hpp:174:5: note: in expansion of macro ‘ATTACH_CMP_OPERATIONS’ 174 | ATTACH_CMP_OPERATIONS(TypeSelector) | ^~~~~~~~~~~~~~~~~~~~~ src/ast_selectors.hpp:136:18: warning: ‘virtual bool Sass::SimpleSelector::operator==(const Sass::ComplexSelector&) const’ was hidden [-Woverloaded-virtual=] 136 | virtual bool operator==(const ComplexSelector& rhs) const; | ^~~~~~~~ src/ast_def_macros.hpp:109:16: note: by ‘Sass::TypeSelector::operator==’ 109 | virtual bool operator==(const klass& rhs) const; \ | ^~~~~~~~ src/ast_selectors.hpp:174:5: note: in expansion of macro ‘ATTACH_CMP_OPERATIONS’ 174 | ATTACH_CMP_OPERATIONS(TypeSelector) | ^~~~~~~~~~~~~~~~~~~~~ src/ast_selectors.hpp:135:18: warning: ‘virtual bool Sass::SimpleSelector::operator==(const Sass::SelectorList&) const’ was hidden [-Woverloaded-virtual=] 135 | virtual bool operator==(const SelectorList& rhs) const; | ^~~~~~~~ src/ast_def_macros.hpp:109:16: note: by ‘Sass::TypeSelector::operator==’ 109 | virtual bool operator==(const klass& rhs) const; \ | ^~~~~~~~ src/ast_selectors.hpp:174:5: note: in expansion of macro ‘ATTACH_CMP_OPERATIONS’ 174 | ATTACH_CMP_OPERATIONS(TypeSelector) | ^~~~~~~~~~~~~~~~~~~~~ src/ast_selectors.hpp:133:10: warning: ‘virtual bool Sass::SimpleSelector::operator==(const Sass::Selector&) const’ was hidden [-Woverloaded-virtual=] 133 | bool operator==(const Selector& rhs) const final override; | ^~~~~~~~ src/ast_def_macros.hpp:109:16: note: by ‘Sass::TypeSelector::operator==’ 109 | virtual bool operator==(const klass& rhs) const; \ | ^~~~~~~~ src/ast_selectors.hpp:174:5: note: in expansion of macro ‘ATTACH_CMP_OPERATIONS’ 174 | ATTACH_CMP_OPERATIONS(TypeSelector) | ^~~~~~~~~~~~~~~~~~~~~ src/ast_def_macros.hpp:106:16: warning: ‘virtual bool Sass::SimpleSelector::operator!=(const Sass::SimpleSelector&) const’ was hidden [-Woverloaded-virtual=] 106 | virtual bool operator!=(const klass& rhs) const { return !(*this == rhs); }; \ | ^~~~~~~~ src/ast_selectors.hpp:139:5: note: in expansion of macro ‘ATTACH_VIRTUAL_CMP_OPERATIONS’ 139 | ATTACH_VIRTUAL_CMP_OPERATIONS(SimpleSelector); | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~ src/ast_def_macros.hpp:110:16: note: by ‘virtual bool Sass::TypeSelector::operator!=(const Sass::TypeSelector&) const’ 110 | virtual bool operator!=(const klass& rhs) const { return !(*this == rhs); }; \ | ^~~~~~~~ src/ast_selectors.hpp:174:5: note: in expansion of macro ‘ATTACH_CMP_OPERATIONS’ 174 | ATTACH_CMP_OPERATIONS(TypeSelector) | ^~~~~~~~~~~~~~~~~~~~~ src/ast_selectors.hpp:137:18: warning: ‘virtual bool Sass::SimpleSelector::operator==(const Sass::CompoundSelector&) const’ was hidden [-Woverloaded-virtual=] 137 | virtual bool operator==(const CompoundSelector& rhs) const; | ^~~~~~~~ src/ast_def_macros.hpp:109:16: note: by ‘Sass::ClassSelector::operator==’ 109 | virtual bool operator==(const klass& rhs) const; \ | ^~~~~~~~ src/ast_selectors.hpp:188:5: note: in expansion of macro ‘ATTACH_CMP_OPERATIONS’ 188 | ATTACH_CMP_OPERATIONS(ClassSelector) | ^~~~~~~~~~~~~~~~~~~~~ src/ast_selectors.hpp:136:18: warning: ‘virtual bool Sass::SimpleSelector::operator==(const Sass::ComplexSelector&) const’ was hidden [-Woverloaded-virtual=] 136 | virtual bool operator==(const ComplexSelector& rhs) const; | ^~~~~~~~ src/ast_def_macros.hpp:109:16: note: by ‘Sass::ClassSelector::operator==’ 109 | virtual bool operator==(const klass& rhs) const; \ | ^~~~~~~~ src/ast_selectors.hpp:188:5: note: in expansion of macro ‘ATTACH_CMP_OPERATIONS’ 188 | ATTACH_CMP_OPERATIONS(ClassSelector) | ^~~~~~~~~~~~~~~~~~~~~ src/ast_selectors.hpp:135:18: warning: ‘virtual bool Sass::SimpleSelector::operator==(const Sass::SelectorList&) const’ was hidden [-Woverloaded-virtual=] 135 | virtual bool operator==(const SelectorList& rhs) const; | ^~~~~~~~ src/ast_def_macros.hpp:109:16: note: by ‘Sass::ClassSelector::operator==’ 109 | virtual bool operator==(const klass& rhs) const; \ | ^~~~~~~~ src/ast_selectors.hpp:188:5: note: in expansion of macro ‘ATTACH_CMP_OPERATIONS’ 188 | ATTACH_CMP_OPERATIONS(ClassSelector) | ^~~~~~~~~~~~~~~~~~~~~ src/ast_selectors.hpp:133:10: warning: ‘virtual bool Sass::SimpleSelector::operator==(const Sass::Selector&) const’ was hidden [-Woverloaded-virtual=] 133 | bool operator==(const Selector& rhs) const final override; | ^~~~~~~~ src/ast_def_macros.hpp:109:16: note: by ‘Sass::ClassSelector::operator==’ 109 | virtual bool operator==(const klass& rhs) const; \ | ^~~~~~~~ src/ast_selectors.hpp:188:5: note: in expansion of macro ‘ATTACH_CMP_OPERATIONS’ 188 | ATTACH_CMP_OPERATIONS(ClassSelector) | ^~~~~~~~~~~~~~~~~~~~~ src/ast_def_macros.hpp:106:16: warning: ‘virtual bool Sass::SimpleSelector::operator!=(const Sass::SimpleSelector&) const’ was hidden [-Woverloaded-virtual=] 106 | virtual bool operator!=(const klass& rhs) const { return !(*this == rhs); }; \ | ^~~~~~~~ src/ast_selectors.hpp:139:5: note: in expansion of macro ‘ATTACH_VIRTUAL_CMP_OPERATIONS’ 139 | ATTACH_VIRTUAL_CMP_OPERATIONS(SimpleSelector); | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~ src/ast_def_macros.hpp:110:16: note: by ‘virtual bool Sass::ClassSelector::operator!=(const Sass::ClassSelector&) const’ 110 | virtual bool operator!=(const klass& rhs) const { return !(*this == rhs); }; \ | ^~~~~~~~ src/ast_selectors.hpp:188:5: note: in expansion of macro ‘ATTACH_CMP_OPERATIONS’ 188 | ATTACH_CMP_OPERATIONS(ClassSelector) | ^~~~~~~~~~~~~~~~~~~~~ src/ast_selectors.hpp:137:18: warning: ‘virtual bool Sass::SimpleSelector::operator==(const Sass::CompoundSelector&) const’ was hidden [-Woverloaded-virtual=] 137 | virtual bool operator==(const CompoundSelector& rhs) const; | ^~~~~~~~ src/ast_def_macros.hpp:109:16: note: by ‘Sass::IDSelector::operator==’ 109 | virtual bool operator==(const klass& rhs) const; \ | ^~~~~~~~ src/ast_selectors.hpp:204:5: note: in expansion of macro ‘ATTACH_CMP_OPERATIONS’ 204 | ATTACH_CMP_OPERATIONS(IDSelector) | ^~~~~~~~~~~~~~~~~~~~~ src/ast_selectors.hpp:136:18: warning: ‘virtual bool Sass::SimpleSelector::operator==(const Sass::ComplexSelector&) const’ was hidden [-Woverloaded-virtual=] 136 | virtual bool operator==(const ComplexSelector& rhs) const; | ^~~~~~~~ src/ast_def_macros.hpp:109:16: note: by ‘Sass::IDSelector::operator==’ 109 | virtual bool operator==(const klass& rhs) const; \ | ^~~~~~~~ src/ast_selectors.hpp:204:5: note: in expansion of macro ‘ATTACH_CMP_OPERATIONS’ 204 | ATTACH_CMP_OPERATIONS(IDSelector) | ^~~~~~~~~~~~~~~~~~~~~ src/ast_selectors.hpp:135:18: warning: ‘virtual bool Sass::SimpleSelector::operator==(const Sass::SelectorList&) const’ was hidden [-Woverloaded-virtual=] 135 | virtual bool operator==(const SelectorList& rhs) const; | ^~~~~~~~ src/ast_def_macros.hpp:109:16: note: by ‘Sass::IDSelector::operator==’ 109 | virtual bool operator==(const klass& rhs) const; \ | ^~~~~~~~ src/ast_selectors.hpp:204:5: note: in expansion of macro ‘ATTACH_CMP_OPERATIONS’ 204 | ATTACH_CMP_OPERATIONS(IDSelector) | ^~~~~~~~~~~~~~~~~~~~~ src/ast_selectors.hpp:133:10: warning: ‘virtual bool Sass::SimpleSelector::operator==(const Sass::Selector&) const’ was hidden [-Woverloaded-virtual=] 133 | bool operator==(const Selector& rhs) const final override; | ^~~~~~~~ src/ast_def_macros.hpp:109:16: note: by ‘Sass::IDSelector::operator==’ 109 | virtual bool operator==(const klass& rhs) const; \ | ^~~~~~~~ src/ast_selectors.hpp:204:5: note: in expansion of macro ‘ATTACH_CMP_OPERATIONS’ 204 | ATTACH_CMP_OPERATIONS(IDSelector) | ^~~~~~~~~~~~~~~~~~~~~ src/ast_def_macros.hpp:106:16: warning: ‘virtual bool Sass::SimpleSelector::operator!=(const Sass::SimpleSelector&) const’ was hidden [-Woverloaded-virtual=] 106 | virtual bool operator!=(const klass& rhs) const { return !(*this == rhs); }; \ | ^~~~~~~~ src/ast_selectors.hpp:139:5: note: in expansion of macro ‘ATTACH_VIRTUAL_CMP_OPERATIONS’ 139 | ATTACH_VIRTUAL_CMP_OPERATIONS(SimpleSelector); | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~ src/ast_def_macros.hpp:110:16: note: by ‘virtual bool Sass::IDSelector::operator!=(const Sass::IDSelector&) const’ 110 | virtual bool operator!=(const klass& rhs) const { return !(*this == rhs); }; \ | ^~~~~~~~ src/ast_selectors.hpp:204:5: note: in expansion of macro ‘ATTACH_CMP_OPERATIONS’ 204 | ATTACH_CMP_OPERATIONS(IDSelector) | ^~~~~~~~~~~~~~~~~~~~~ src/ast_selectors.hpp:137:18: warning: ‘virtual bool Sass::SimpleSelector::operator==(const Sass::CompoundSelector&) const’ was hidden [-Woverloaded-virtual=] 137 | virtual bool operator==(const CompoundSelector& rhs) const; | ^~~~~~~~ src/ast_def_macros.hpp:109:16: note: by ‘Sass::AttributeSelector::operator==’ 109 | virtual bool operator==(const klass& rhs) const; \ | ^~~~~~~~ src/ast_selectors.hpp:223:5: note: in expansion of macro ‘ATTACH_CMP_OPERATIONS’ 223 | ATTACH_CMP_OPERATIONS(AttributeSelector) | ^~~~~~~~~~~~~~~~~~~~~ src/ast_selectors.hpp:136:18: warning: ‘virtual bool Sass::SimpleSelector::operator==(const Sass::ComplexSelector&) const’ was hidden [-Woverloaded-virtual=] 136 | virtual bool operator==(const ComplexSelector& rhs) const; | ^~~~~~~~ src/ast_def_macros.hpp:109:16: note: by ‘Sass::AttributeSelector::operator==’ 109 | virtual bool operator==(const klass& rhs) const; \ | ^~~~~~~~ src/ast_selectors.hpp:223:5: note: in expansion of macro ‘ATTACH_CMP_OPERATIONS’ 223 | ATTACH_CMP_OPERATIONS(AttributeSelector) | ^~~~~~~~~~~~~~~~~~~~~ src/ast_selectors.hpp:135:18: warning: ‘virtual bool Sass::SimpleSelector::operator==(const Sass::SelectorList&) const’ was hidden [-Woverloaded-virtual=] 135 | virtual bool operator==(const SelectorList& rhs) const; | ^~~~~~~~ src/ast_def_macros.hpp:109:16: note: by ‘Sass::AttributeSelector::operator==’ 109 | virtual bool operator==(const klass& rhs) const; \ | ^~~~~~~~ src/ast_selectors.hpp:223:5: note: in expansion of macro ‘ATTACH_CMP_OPERATIONS’ 223 | ATTACH_CMP_OPERATIONS(AttributeSelector) | ^~~~~~~~~~~~~~~~~~~~~ src/ast_selectors.hpp:133:10: warning: ‘virtual bool Sass::SimpleSelector::operator==(const Sass::Selector&) const’ was hidden [-Woverloaded-virtual=] 133 | bool operator==(const Selector& rhs) const final override; | ^~~~~~~~ src/ast_def_macros.hpp:109:16: note: by ‘Sass::AttributeSelector::operator==’ 109 | virtual bool operator==(const klass& rhs) const; \ | ^~~~~~~~ src/ast_selectors.hpp:223:5: note: in expansion of macro ‘ATTACH_CMP_OPERATIONS’ 223 | ATTACH_CMP_OPERATIONS(AttributeSelector) | ^~~~~~~~~~~~~~~~~~~~~ src/ast_def_macros.hpp:106:16: warning: ‘virtual bool Sass::SimpleSelector::operator!=(const Sass::SimpleSelector&) const’ was hidden [-Woverloaded-virtual=] 106 | virtual bool operator!=(const klass& rhs) const { return !(*this == rhs); }; \ | ^~~~~~~~ src/ast_selectors.hpp:139:5: note: in expansion of macro ‘ATTACH_VIRTUAL_CMP_OPERATIONS’ 139 | ATTACH_VIRTUAL_CMP_OPERATIONS(SimpleSelector); | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~ src/ast_def_macros.hpp:110:16: note: by ‘virtual bool Sass::AttributeSelector::operator!=(const Sass::AttributeSelector&) const’ 110 | virtual bool operator!=(const klass& rhs) const { return !(*this == rhs); }; \ | ^~~~~~~~ src/ast_selectors.hpp:223:5: note: in expansion of macro ‘ATTACH_CMP_OPERATIONS’ 223 | ATTACH_CMP_OPERATIONS(AttributeSelector) | ^~~~~~~~~~~~~~~~~~~~~ src/ast_def_macros.hpp:106:16: warning: ‘virtual bool Sass::Selector::operator!=(const Sass::Selector&) const’ was hidden [-Woverloaded-virtual=] 106 | virtual bool operator!=(const klass& rhs) const { return !(*this == rhs); }; \ | ^~~~~~~~ src/ast_selectors.hpp:56:5: note: in expansion of macro ‘ATTACH_VIRTUAL_CMP_OPERATIONS’ 56 | ATTACH_VIRTUAL_CMP_OPERATIONS(Selector) | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~ src/ast_def_macros.hpp:110:16: note: by ‘virtual bool Sass::ComplexSelector::operator!=(const Sass::ComplexSelector&) const’ 110 | virtual bool operator!=(const klass& rhs) const { return !(*this == rhs); }; \ | ^~~~~~~~ src/ast_selectors.hpp:310:5: note: in expansion of macro ‘ATTACH_CMP_OPERATIONS’ 310 | ATTACH_CMP_OPERATIONS(ComplexSelector) | ^~~~~~~~~~~~~~~~~~~~~ src/ast_def_macros.hpp:106:16: warning: ‘virtual bool Sass::Selector::operator!=(const Sass::Selector&) const’ was hidden [-Woverloaded-virtual=] 106 | virtual bool operator!=(const klass& rhs) const { return !(*this == rhs); }; \ | ^~~~~~~~ src/ast_selectors.hpp:56:5: note: in expansion of macro ‘ATTACH_VIRTUAL_CMP_OPERATIONS’ 56 | ATTACH_VIRTUAL_CMP_OPERATIONS(Selector) | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~ src/ast_def_macros.hpp:106:16: note: by ‘virtual bool Sass::SelectorComponent::operator!=(const Sass::SelectorComponent&) const’ 106 | virtual bool operator!=(const klass& rhs) const { return !(*this == rhs); }; \ | ^~~~~~~~ src/ast_selectors.hpp:349:5: note: in expansion of macro ‘ATTACH_VIRTUAL_CMP_OPERATIONS’ 349 | ATTACH_VIRTUAL_CMP_OPERATIONS(SelectorComponent); | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~ src/ast_def_macros.hpp:106:16: warning: ‘virtual bool Sass::SelectorComponent::operator!=(const Sass::SelectorComponent&) const’ was hidden [-Woverloaded-virtual=] 106 | virtual bool operator!=(const klass& rhs) const { return !(*this == rhs); }; \ | ^~~~~~~~ src/ast_selectors.hpp:349:5: note: in expansion of macro ‘ATTACH_VIRTUAL_CMP_OPERATIONS’ 349 | ATTACH_VIRTUAL_CMP_OPERATIONS(SelectorComponent); | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~ src/ast_def_macros.hpp:110:16: note: by ‘virtual bool Sass::SelectorCombinator::operator!=(const Sass::SelectorCombinator&) const’ 110 | virtual bool operator!=(const klass& rhs) const { return !(*this == rhs); }; \ | ^~~~~~~~ src/ast_selectors.hpp:407:5: note: in expansion of macro ‘ATTACH_CMP_OPERATIONS’ 407 | ATTACH_CMP_OPERATIONS(SelectorCombinator) | ^~~~~~~~~~~~~~~~~~~~~ g++ -std=gnu++17 -Wall -O2 -std=c++11 -I ./include -fPIC -c -o src/extender.o src/extender.cpp In file included from src/extender.cpp:4: src/ast.hpp:90:18: warning: ‘virtual bool Sass::AST_Node::operator==(const Sass::AST_Node&) const’ was hidden [-Woverloaded-virtual=] 90 | virtual bool operator== (const AST_Node& rhs) const { | ^~~~~~~~ src/ast.hpp:165:18: note: by ‘virtual bool Sass::Expression::operator==(const Sass::Expression&) const’ 165 | virtual bool operator== (const Expression& rhs) const { return false; } | ^~~~~~~~ src/ast.hpp:96:18: warning: ‘virtual bool Sass::AST_Node::operator!=(const Sass::AST_Node&) const’ was hidden [-Woverloaded-virtual=] 96 | virtual bool operator!= (const AST_Node& rhs) const { | ^~~~~~~~ src/ast.hpp:167:17: note: by ‘bool Sass::Expression::operator!=(const Sass::Expression&) const’ 167 | inline bool operator!=(const Expression& rhs) const { return !(rhs == *this); } | ^~~~~~~~ src/ast.hpp:90:18: warning: ‘virtual bool Sass::AST_Node::operator==(const Sass::AST_Node&) const’ was hidden [-Woverloaded-virtual=] 90 | virtual bool operator== (const AST_Node& rhs) const { | ^~~~~~~~ src/ast.hpp:908:10: note: by ‘bool Sass::CssMediaRule::operator==(const Sass::CssMediaRule&) const’ 908 | bool operator== (const CssMediaRule& rhs) const { | ^~~~~~~~ src/ast.hpp:96:18: warning: ‘virtual bool Sass::AST_Node::operator!=(const Sass::AST_Node&) const’ was hidden [-Woverloaded-virtual=] 96 | virtual bool operator!= (const AST_Node& rhs) const { | ^~~~~~~~ src/ast.hpp:911:10: note: by ‘bool Sass::CssMediaRule::operator!=(const Sass::CssMediaRule&) const’ 911 | bool operator!=(const CssMediaRule& rhs) const { | ^~~~~~~~ src/ast.hpp:90:18: warning: ‘virtual bool Sass::AST_Node::operator==(const Sass::AST_Node&) const’ was hidden [-Woverloaded-virtual=] 90 | virtual bool operator== (const AST_Node& rhs) const { | ^~~~~~~~ src/ast.hpp:939:10: note: by ‘bool Sass::CssMediaQuery::operator==(const Sass::CssMediaQuery&) const’ 939 | bool operator== (const CssMediaQuery& rhs) const; | ^~~~~~~~ src/ast.hpp:96:18: warning: ‘virtual bool Sass::AST_Node::operator!=(const Sass::AST_Node&) const’ was hidden [-Woverloaded-virtual=] 96 | virtual bool operator!= (const AST_Node& rhs) const { | ^~~~~~~~ src/ast.hpp:940:10: note: by ‘bool Sass::CssMediaQuery::operator!=(const Sass::CssMediaQuery&) const’ 940 | bool operator!=(const CssMediaQuery& rhs) const { | ^~~~~~~~ src/ast.hpp:165:18: warning: ‘virtual bool Sass::Expression::operator==(const Sass::Expression&) const’ was hidden [-Woverloaded-virtual=] 165 | virtual bool operator== (const Expression& rhs) const { return false; } | ^~~~~~~~ In file included from src/ast.hpp:14: src/ast_def_macros.hpp:105:16: note: by ‘virtual bool Sass::Selector::operator==(const Sass::Selector&) const’ 105 | virtual bool operator==(const klass& rhs) const = 0; \ | ^~~~~~~~ src/ast_selectors.hpp:56:5: note: in expansion of macro ‘ATTACH_VIRTUAL_CMP_OPERATIONS’ 56 | ATTACH_VIRTUAL_CMP_OPERATIONS(Selector) | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~ src/ast.hpp:96:18: warning: ‘virtual bool Sass::AST_Node::operator!=(const Sass::AST_Node&) const’ was hidden [-Woverloaded-virtual=] 96 | virtual bool operator!= (const AST_Node& rhs) const { | ^~~~~~~~ src/ast_def_macros.hpp:106:16: note: by ‘virtual bool Sass::Selector::operator!=(const Sass::Selector&) const’ 106 | virtual bool operator!=(const klass& rhs) const { return !(*this == rhs); }; \ | ^~~~~~~~ src/ast_selectors.hpp:56:5: note: in expansion of macro ‘ATTACH_VIRTUAL_CMP_OPERATIONS’ 56 | ATTACH_VIRTUAL_CMP_OPERATIONS(Selector) | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~ src/ast_def_macros.hpp:106:16: warning: ‘virtual bool Sass::Selector::operator!=(const Sass::Selector&) const’ was hidden [-Woverloaded-virtual=] 106 | virtual bool operator!=(const klass& rhs) const { return !(*this == rhs); }; \ | ^~~~~~~~ src/ast_selectors.hpp:56:5: note: in expansion of macro ‘ATTACH_VIRTUAL_CMP_OPERATIONS’ 56 | ATTACH_VIRTUAL_CMP_OPERATIONS(Selector) | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~ src/ast_def_macros.hpp:106:16: note: by ‘virtual bool Sass::SimpleSelector::operator!=(const Sass::SimpleSelector&) const’ 106 | virtual bool operator!=(const klass& rhs) const { return !(*this == rhs); }; \ | ^~~~~~~~ src/ast_selectors.hpp:139:5: note: in expansion of macro ‘ATTACH_VIRTUAL_CMP_OPERATIONS’ 139 | ATTACH_VIRTUAL_CMP_OPERATIONS(SimpleSelector); | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~ In file included from src/ast.hpp:1055: src/ast_selectors.hpp:137:18: warning: ‘virtual bool Sass::SimpleSelector::operator==(const Sass::CompoundSelector&) const’ was hidden [-Woverloaded-virtual=] 137 | virtual bool operator==(const CompoundSelector& rhs) const; | ^~~~~~~~ src/ast_def_macros.hpp:109:16: note: by ‘Sass::PlaceholderSelector::operator==’ 109 | virtual bool operator==(const klass& rhs) const; \ | ^~~~~~~~ src/ast_selectors.hpp:157:5: note: in expansion of macro ‘ATTACH_CMP_OPERATIONS’ 157 | ATTACH_CMP_OPERATIONS(PlaceholderSelector) | ^~~~~~~~~~~~~~~~~~~~~ src/ast_selectors.hpp:136:18: warning: ‘virtual bool Sass::SimpleSelector::operator==(const Sass::ComplexSelector&) const’ was hidden [-Woverloaded-virtual=] 136 | virtual bool operator==(const ComplexSelector& rhs) const; | ^~~~~~~~ src/ast_def_macros.hpp:109:16: note: by ‘Sass::PlaceholderSelector::operator==’ 109 | virtual bool operator==(const klass& rhs) const; \ | ^~~~~~~~ src/ast_selectors.hpp:157:5: note: in expansion of macro ‘ATTACH_CMP_OPERATIONS’ 157 | ATTACH_CMP_OPERATIONS(PlaceholderSelector) | ^~~~~~~~~~~~~~~~~~~~~ src/ast_selectors.hpp:135:18: warning: ‘virtual bool Sass::SimpleSelector::operator==(const Sass::SelectorList&) const’ was hidden [-Woverloaded-virtual=] 135 | virtual bool operator==(const SelectorList& rhs) const; | ^~~~~~~~ src/ast_def_macros.hpp:109:16: note: by ‘Sass::PlaceholderSelector::operator==’ 109 | virtual bool operator==(const klass& rhs) const; \ | ^~~~~~~~ src/ast_selectors.hpp:157:5: note: in expansion of macro ‘ATTACH_CMP_OPERATIONS’ 157 | ATTACH_CMP_OPERATIONS(PlaceholderSelector) | ^~~~~~~~~~~~~~~~~~~~~ src/ast_selectors.hpp:133:10: warning: ‘virtual bool Sass::SimpleSelector::operator==(const Sass::Selector&) const’ was hidden [-Woverloaded-virtual=] 133 | bool operator==(const Selector& rhs) const final override; | ^~~~~~~~ src/ast_def_macros.hpp:109:16: note: by ‘Sass::PlaceholderSelector::operator==’ 109 | virtual bool operator==(const klass& rhs) const; \ | ^~~~~~~~ src/ast_selectors.hpp:157:5: note: in expansion of macro ‘ATTACH_CMP_OPERATIONS’ 157 | ATTACH_CMP_OPERATIONS(PlaceholderSelector) | ^~~~~~~~~~~~~~~~~~~~~ src/ast_def_macros.hpp:106:16: warning: ‘virtual bool Sass::SimpleSelector::operator!=(const Sass::SimpleSelector&) const’ was hidden [-Woverloaded-virtual=] 106 | virtual bool operator!=(const klass& rhs) const { return !(*this == rhs); }; \ | ^~~~~~~~ src/ast_selectors.hpp:139:5: note: in expansion of macro ‘ATTACH_VIRTUAL_CMP_OPERATIONS’ 139 | ATTACH_VIRTUAL_CMP_OPERATIONS(SimpleSelector); | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~ src/ast_def_macros.hpp:110:16: note: by ‘virtual bool Sass::PlaceholderSelector::operator!=(const Sass::PlaceholderSelector&) const’ 110 | virtual bool operator!=(const klass& rhs) const { return !(*this == rhs); }; \ | ^~~~~~~~ src/ast_selectors.hpp:157:5: note: in expansion of macro ‘ATTACH_CMP_OPERATIONS’ 157 | ATTACH_CMP_OPERATIONS(PlaceholderSelector) | ^~~~~~~~~~~~~~~~~~~~~ src/ast_selectors.hpp:137:18: warning: ‘virtual bool Sass::SimpleSelector::operator==(const Sass::CompoundSelector&) const’ was hidden [-Woverloaded-virtual=] 137 | virtual bool operator==(const CompoundSelector& rhs) const; | ^~~~~~~~ src/ast_def_macros.hpp:109:16: note: by ‘Sass::TypeSelector::operator==’ 109 | virtual bool operator==(const klass& rhs) const; \ | ^~~~~~~~ src/ast_selectors.hpp:174:5: note: in expansion of macro ‘ATTACH_CMP_OPERATIONS’ 174 | ATTACH_CMP_OPERATIONS(TypeSelector) | ^~~~~~~~~~~~~~~~~~~~~ src/ast_selectors.hpp:136:18: warning: ‘virtual bool Sass::SimpleSelector::operator==(const Sass::ComplexSelector&) const’ was hidden [-Woverloaded-virtual=] 136 | virtual bool operator==(const ComplexSelector& rhs) const; | ^~~~~~~~ src/ast_def_macros.hpp:109:16: note: by ‘Sass::TypeSelector::operator==’ 109 | virtual bool operator==(const klass& rhs) const; \ | ^~~~~~~~ src/ast_selectors.hpp:174:5: note: in expansion of macro ‘ATTACH_CMP_OPERATIONS’ 174 | ATTACH_CMP_OPERATIONS(TypeSelector) | ^~~~~~~~~~~~~~~~~~~~~ src/ast_selectors.hpp:135:18: warning: ‘virtual bool Sass::SimpleSelector::operator==(const Sass::SelectorList&) const’ was hidden [-Woverloaded-virtual=] 135 | virtual bool operator==(const SelectorList& rhs) const; | ^~~~~~~~ src/ast_def_macros.hpp:109:16: note: by ‘Sass::TypeSelector::operator==’ 109 | virtual bool operator==(const klass& rhs) const; \ | ^~~~~~~~ src/ast_selectors.hpp:174:5: note: in expansion of macro ‘ATTACH_CMP_OPERATIONS’ 174 | ATTACH_CMP_OPERATIONS(TypeSelector) | ^~~~~~~~~~~~~~~~~~~~~ src/ast_selectors.hpp:133:10: warning: ‘virtual bool Sass::SimpleSelector::operator==(const Sass::Selector&) const’ was hidden [-Woverloaded-virtual=] 133 | bool operator==(const Selector& rhs) const final override; | ^~~~~~~~ src/ast_def_macros.hpp:109:16: note: by ‘Sass::TypeSelector::operator==’ 109 | virtual bool operator==(const klass& rhs) const; \ | ^~~~~~~~ src/ast_selectors.hpp:174:5: note: in expansion of macro ‘ATTACH_CMP_OPERATIONS’ 174 | ATTACH_CMP_OPERATIONS(TypeSelector) | ^~~~~~~~~~~~~~~~~~~~~ src/ast_def_macros.hpp:106:16: warning: ‘virtual bool Sass::SimpleSelector::operator!=(const Sass::SimpleSelector&) const’ was hidden [-Woverloaded-virtual=] 106 | virtual bool operator!=(const klass& rhs) const { return !(*this == rhs); }; \ | ^~~~~~~~ src/ast_selectors.hpp:139:5: note: in expansion of macro ‘ATTACH_VIRTUAL_CMP_OPERATIONS’ 139 | ATTACH_VIRTUAL_CMP_OPERATIONS(SimpleSelector); | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~ src/ast_def_macros.hpp:110:16: note: by ‘virtual bool Sass::TypeSelector::operator!=(const Sass::TypeSelector&) const’ 110 | virtual bool operator!=(const klass& rhs) const { return !(*this == rhs); }; \ | ^~~~~~~~ src/ast_selectors.hpp:174:5: note: in expansion of macro ‘ATTACH_CMP_OPERATIONS’ 174 | ATTACH_CMP_OPERATIONS(TypeSelector) | ^~~~~~~~~~~~~~~~~~~~~ src/ast_selectors.hpp:137:18: warning: ‘virtual bool Sass::SimpleSelector::operator==(const Sass::CompoundSelector&) const’ was hidden [-Woverloaded-virtual=] 137 | virtual bool operator==(const CompoundSelector& rhs) const; | ^~~~~~~~ src/ast_def_macros.hpp:109:16: note: by ‘Sass::ClassSelector::operator==’ 109 | virtual bool operator==(const klass& rhs) const; \ | ^~~~~~~~ src/ast_selectors.hpp:188:5: note: in expansion of macro ‘ATTACH_CMP_OPERATIONS’ 188 | ATTACH_CMP_OPERATIONS(ClassSelector) | ^~~~~~~~~~~~~~~~~~~~~ src/ast_selectors.hpp:136:18: warning: ‘virtual bool Sass::SimpleSelector::operator==(const Sass::ComplexSelector&) const’ was hidden [-Woverloaded-virtual=] 136 | virtual bool operator==(const ComplexSelector& rhs) const; | ^~~~~~~~ src/ast_def_macros.hpp:109:16: note: by ‘Sass::ClassSelector::operator==’ 109 | virtual bool operator==(const klass& rhs) const; \ | ^~~~~~~~ src/ast_selectors.hpp:188:5: note: in expansion of macro ‘ATTACH_CMP_OPERATIONS’ 188 | ATTACH_CMP_OPERATIONS(ClassSelector) | ^~~~~~~~~~~~~~~~~~~~~ src/ast_selectors.hpp:135:18: warning: ‘virtual bool Sass::SimpleSelector::operator==(const Sass::SelectorList&) const’ was hidden [-Woverloaded-virtual=] 135 | virtual bool operator==(const SelectorList& rhs) const; | ^~~~~~~~ src/ast_def_macros.hpp:109:16: note: by ‘Sass::ClassSelector::operator==’ 109 | virtual bool operator==(const klass& rhs) const; \ | ^~~~~~~~ src/ast_selectors.hpp:188:5: note: in expansion of macro ‘ATTACH_CMP_OPERATIONS’ 188 | ATTACH_CMP_OPERATIONS(ClassSelector) | ^~~~~~~~~~~~~~~~~~~~~ src/ast_selectors.hpp:133:10: warning: ‘virtual bool Sass::SimpleSelector::operator==(const Sass::Selector&) const’ was hidden [-Woverloaded-virtual=] 133 | bool operator==(const Selector& rhs) const final override; | ^~~~~~~~ src/ast_def_macros.hpp:109:16: note: by ‘Sass::ClassSelector::operator==’ 109 | virtual bool operator==(const klass& rhs) const; \ | ^~~~~~~~ src/ast_selectors.hpp:188:5: note: in expansion of macro ‘ATTACH_CMP_OPERATIONS’ 188 | ATTACH_CMP_OPERATIONS(ClassSelector) | ^~~~~~~~~~~~~~~~~~~~~ src/ast_def_macros.hpp:106:16: warning: ‘virtual bool Sass::SimpleSelector::operator!=(const Sass::SimpleSelector&) const’ was hidden [-Woverloaded-virtual=] 106 | virtual bool operator!=(const klass& rhs) const { return !(*this == rhs); }; \ | ^~~~~~~~ src/ast_selectors.hpp:139:5: note: in expansion of macro ‘ATTACH_VIRTUAL_CMP_OPERATIONS’ 139 | ATTACH_VIRTUAL_CMP_OPERATIONS(SimpleSelector); | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~ src/ast_def_macros.hpp:110:16: note: by ‘virtual bool Sass::ClassSelector::operator!=(const Sass::ClassSelector&) const’ 110 | virtual bool operator!=(const klass& rhs) const { return !(*this == rhs); }; \ | ^~~~~~~~ src/ast_selectors.hpp:188:5: note: in expansion of macro ‘ATTACH_CMP_OPERATIONS’ 188 | ATTACH_CMP_OPERATIONS(ClassSelector) | ^~~~~~~~~~~~~~~~~~~~~ src/ast_selectors.hpp:137:18: warning: ‘virtual bool Sass::SimpleSelector::operator==(const Sass::CompoundSelector&) const’ was hidden [-Woverloaded-virtual=] 137 | virtual bool operator==(const CompoundSelector& rhs) const; | ^~~~~~~~ src/ast_def_macros.hpp:109:16: note: by ‘Sass::IDSelector::operator==’ 109 | virtual bool operator==(const klass& rhs) const; \ | ^~~~~~~~ src/ast_selectors.hpp:204:5: note: in expansion of macro ‘ATTACH_CMP_OPERATIONS’ 204 | ATTACH_CMP_OPERATIONS(IDSelector) | ^~~~~~~~~~~~~~~~~~~~~ src/ast_selectors.hpp:136:18: warning: ‘virtual bool Sass::SimpleSelector::operator==(const Sass::ComplexSelector&) const’ was hidden [-Woverloaded-virtual=] 136 | virtual bool operator==(const ComplexSelector& rhs) const; | ^~~~~~~~ src/ast_def_macros.hpp:109:16: note: by ‘Sass::IDSelector::operator==’ 109 | virtual bool operator==(const klass& rhs) const; \ | ^~~~~~~~ src/ast_selectors.hpp:204:5: note: in expansion of macro ‘ATTACH_CMP_OPERATIONS’ 204 | ATTACH_CMP_OPERATIONS(IDSelector) | ^~~~~~~~~~~~~~~~~~~~~ src/ast_selectors.hpp:135:18: warning: ‘virtual bool Sass::SimpleSelector::operator==(const Sass::SelectorList&) const’ was hidden [-Woverloaded-virtual=] 135 | virtual bool operator==(const SelectorList& rhs) const; | ^~~~~~~~ src/ast_def_macros.hpp:109:16: note: by ‘Sass::IDSelector::operator==’ 109 | virtual bool operator==(const klass& rhs) const; \ | ^~~~~~~~ src/ast_selectors.hpp:204:5: note: in expansion of macro ‘ATTACH_CMP_OPERATIONS’ 204 | ATTACH_CMP_OPERATIONS(IDSelector) | ^~~~~~~~~~~~~~~~~~~~~ src/ast_selectors.hpp:133:10: warning: ‘virtual bool Sass::SimpleSelector::operator==(const Sass::Selector&) const’ was hidden [-Woverloaded-virtual=] 133 | bool operator==(const Selector& rhs) const final override; | ^~~~~~~~ src/ast_def_macros.hpp:109:16: note: by ‘Sass::IDSelector::operator==’ 109 | virtual bool operator==(const klass& rhs) const; \ | ^~~~~~~~ src/ast_selectors.hpp:204:5: note: in expansion of macro ‘ATTACH_CMP_OPERATIONS’ 204 | ATTACH_CMP_OPERATIONS(IDSelector) | ^~~~~~~~~~~~~~~~~~~~~ src/ast_def_macros.hpp:106:16: warning: ‘virtual bool Sass::SimpleSelector::operator!=(const Sass::SimpleSelector&) const’ was hidden [-Woverloaded-virtual=] 106 | virtual bool operator!=(const klass& rhs) const { return !(*this == rhs); }; \ | ^~~~~~~~ src/ast_selectors.hpp:139:5: note: in expansion of macro ‘ATTACH_VIRTUAL_CMP_OPERATIONS’ 139 | ATTACH_VIRTUAL_CMP_OPERATIONS(SimpleSelector); | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~ src/ast_def_macros.hpp:110:16: note: by ‘virtual bool Sass::IDSelector::operator!=(const Sass::IDSelector&) const’ 110 | virtual bool operator!=(const klass& rhs) const { return !(*this == rhs); }; \ | ^~~~~~~~ src/ast_selectors.hpp:204:5: note: in expansion of macro ‘ATTACH_CMP_OPERATIONS’ 204 | ATTACH_CMP_OPERATIONS(IDSelector) | ^~~~~~~~~~~~~~~~~~~~~ src/ast_selectors.hpp:137:18: warning: ‘virtual bool Sass::SimpleSelector::operator==(const Sass::CompoundSelector&) const’ was hidden [-Woverloaded-virtual=] 137 | virtual bool operator==(const CompoundSelector& rhs) const; | ^~~~~~~~ src/ast_def_macros.hpp:109:16: note: by ‘Sass::AttributeSelector::operator==’ 109 | virtual bool operator==(const klass& rhs) const; \ | ^~~~~~~~ src/ast_selectors.hpp:223:5: note: in expansion of macro ‘ATTACH_CMP_OPERATIONS’ 223 | ATTACH_CMP_OPERATIONS(AttributeSelector) | ^~~~~~~~~~~~~~~~~~~~~ src/ast_selectors.hpp:136:18: warning: ‘virtual bool Sass::SimpleSelector::operator==(const Sass::ComplexSelector&) const’ was hidden [-Woverloaded-virtual=] 136 | virtual bool operator==(const ComplexSelector& rhs) const; | ^~~~~~~~ src/ast_def_macros.hpp:109:16: note: by ‘Sass::AttributeSelector::operator==’ 109 | virtual bool operator==(const klass& rhs) const; \ | ^~~~~~~~ src/ast_selectors.hpp:223:5: note: in expansion of macro ‘ATTACH_CMP_OPERATIONS’ 223 | ATTACH_CMP_OPERATIONS(AttributeSelector) | ^~~~~~~~~~~~~~~~~~~~~ src/ast_selectors.hpp:135:18: warning: ‘virtual bool Sass::SimpleSelector::operator==(const Sass::SelectorList&) const’ was hidden [-Woverloaded-virtual=] 135 | virtual bool operator==(const SelectorList& rhs) const; | ^~~~~~~~ src/ast_def_macros.hpp:109:16: note: by ‘Sass::AttributeSelector::operator==’ 109 | virtual bool operator==(const klass& rhs) const; \ | ^~~~~~~~ src/ast_selectors.hpp:223:5: note: in expansion of macro ‘ATTACH_CMP_OPERATIONS’ 223 | ATTACH_CMP_OPERATIONS(AttributeSelector) | ^~~~~~~~~~~~~~~~~~~~~ src/ast_selectors.hpp:133:10: warning: ‘virtual bool Sass::SimpleSelector::operator==(const Sass::Selector&) const’ was hidden [-Woverloaded-virtual=] 133 | bool operator==(const Selector& rhs) const final override; | ^~~~~~~~ src/ast_def_macros.hpp:109:16: note: by ‘Sass::AttributeSelector::operator==’ 109 | virtual bool operator==(const klass& rhs) const; \ | ^~~~~~~~ src/ast_selectors.hpp:223:5: note: in expansion of macro ‘ATTACH_CMP_OPERATIONS’ 223 | ATTACH_CMP_OPERATIONS(AttributeSelector) | ^~~~~~~~~~~~~~~~~~~~~ src/ast_def_macros.hpp:106:16: warning: ‘virtual bool Sass::SimpleSelector::operator!=(const Sass::SimpleSelector&) const’ was hidden [-Woverloaded-virtual=] 106 | virtual bool operator!=(const klass& rhs) const { return !(*this == rhs); }; \ | ^~~~~~~~ src/ast_selectors.hpp:139:5: note: in expansion of macro ‘ATTACH_VIRTUAL_CMP_OPERATIONS’ 139 | ATTACH_VIRTUAL_CMP_OPERATIONS(SimpleSelector); | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~ src/ast_def_macros.hpp:110:16: note: by ‘virtual bool Sass::AttributeSelector::operator!=(const Sass::AttributeSelector&) const’ 110 | virtual bool operator!=(const klass& rhs) const { return !(*this == rhs); }; \ | ^~~~~~~~ src/ast_selectors.hpp:223:5: note: in expansion of macro ‘ATTACH_CMP_OPERATIONS’ 223 | ATTACH_CMP_OPERATIONS(AttributeSelector) | ^~~~~~~~~~~~~~~~~~~~~ src/ast_def_macros.hpp:106:16: warning: ‘virtual bool Sass::Selector::operator!=(const Sass::Selector&) const’ was hidden [-Woverloaded-virtual=] 106 | virtual bool operator!=(const klass& rhs) const { return !(*this == rhs); }; \ | ^~~~~~~~ src/ast_selectors.hpp:56:5: note: in expansion of macro ‘ATTACH_VIRTUAL_CMP_OPERATIONS’ 56 | ATTACH_VIRTUAL_CMP_OPERATIONS(Selector) | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~ src/ast_def_macros.hpp:110:16: note: by ‘virtual bool Sass::ComplexSelector::operator!=(const Sass::ComplexSelector&) const’ 110 | virtual bool operator!=(const klass& rhs) const { return !(*this == rhs); }; \ | ^~~~~~~~ src/ast_selectors.hpp:310:5: note: in expansion of macro ‘ATTACH_CMP_OPERATIONS’ 310 | ATTACH_CMP_OPERATIONS(ComplexSelector) | ^~~~~~~~~~~~~~~~~~~~~ src/ast_def_macros.hpp:106:16: warning: ‘virtual bool Sass::Selector::operator!=(const Sass::Selector&) const’ was hidden [-Woverloaded-virtual=] 106 | virtual bool operator!=(const klass& rhs) const { return !(*this == rhs); }; \ | ^~~~~~~~ src/ast_selectors.hpp:56:5: note: in expansion of macro ‘ATTACH_VIRTUAL_CMP_OPERATIONS’ 56 | ATTACH_VIRTUAL_CMP_OPERATIONS(Selector) | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~ src/ast_def_macros.hpp:106:16: note: by ‘virtual bool Sass::SelectorComponent::operator!=(const Sass::SelectorComponent&) const’ 106 | virtual bool operator!=(const klass& rhs) const { return !(*this == rhs); }; \ | ^~~~~~~~ src/ast_selectors.hpp:349:5: note: in expansion of macro ‘ATTACH_VIRTUAL_CMP_OPERATIONS’ 349 | ATTACH_VIRTUAL_CMP_OPERATIONS(SelectorComponent); | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~ src/ast_def_macros.hpp:106:16: warning: ‘virtual bool Sass::SelectorComponent::operator!=(const Sass::SelectorComponent&) const’ was hidden [-Woverloaded-virtual=] 106 | virtual bool operator!=(const klass& rhs) const { return !(*this == rhs); }; \ | ^~~~~~~~ src/ast_selectors.hpp:349:5: note: in expansion of macro ‘ATTACH_VIRTUAL_CMP_OPERATIONS’ 349 | ATTACH_VIRTUAL_CMP_OPERATIONS(SelectorComponent); | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~ src/ast_def_macros.hpp:110:16: note: by ‘virtual bool Sass::SelectorCombinator::operator!=(const Sass::SelectorCombinator&) const’ 110 | virtual bool operator!=(const klass& rhs) const { return !(*this == rhs); }; \ | ^~~~~~~~ src/ast_selectors.hpp:407:5: note: in expansion of macro ‘ATTACH_CMP_OPERATIONS’ 407 | ATTACH_CMP_OPERATIONS(SelectorCombinator) | ^~~~~~~~~~~~~~~~~~~~~ g++ -std=gnu++17 -Wall -O2 -std=c++11 -I ./include -fPIC -c -o src/extension.o src/extension.cpp In file included from src/extension.cpp:7: src/ast.hpp:90:18: warning: ‘virtual bool Sass::AST_Node::operator==(const Sass::AST_Node&) const’ was hidden [-Woverloaded-virtual=] 90 | virtual bool operator== (const AST_Node& rhs) const { | ^~~~~~~~ src/ast.hpp:165:18: note: by ‘virtual bool Sass::Expression::operator==(const Sass::Expression&) const’ 165 | virtual bool operator== (const Expression& rhs) const { return false; } | ^~~~~~~~ src/ast.hpp:96:18: warning: ‘virtual bool Sass::AST_Node::operator!=(const Sass::AST_Node&) const’ was hidden [-Woverloaded-virtual=] 96 | virtual bool operator!= (const AST_Node& rhs) const { | ^~~~~~~~ src/ast.hpp:167:17: note: by ‘bool Sass::Expression::operator!=(const Sass::Expression&) const’ 167 | inline bool operator!=(const Expression& rhs) const { return !(rhs == *this); } | ^~~~~~~~ src/ast.hpp:90:18: warning: ‘virtual bool Sass::AST_Node::operator==(const Sass::AST_Node&) const’ was hidden [-Woverloaded-virtual=] 90 | virtual bool operator== (const AST_Node& rhs) const { | ^~~~~~~~ src/ast.hpp:908:10: note: by ‘bool Sass::CssMediaRule::operator==(const Sass::CssMediaRule&) const’ 908 | bool operator== (const CssMediaRule& rhs) const { | ^~~~~~~~ src/ast.hpp:96:18: warning: ‘virtual bool Sass::AST_Node::operator!=(const Sass::AST_Node&) const’ was hidden [-Woverloaded-virtual=] 96 | virtual bool operator!= (const AST_Node& rhs) const { | ^~~~~~~~ src/ast.hpp:911:10: note: by ‘bool Sass::CssMediaRule::operator!=(const Sass::CssMediaRule&) const’ 911 | bool operator!=(const CssMediaRule& rhs) const { | ^~~~~~~~ src/ast.hpp:90:18: warning: ‘virtual bool Sass::AST_Node::operator==(const Sass::AST_Node&) const’ was hidden [-Woverloaded-virtual=] 90 | virtual bool operator== (const AST_Node& rhs) const { | ^~~~~~~~ src/ast.hpp:939:10: note: by ‘bool Sass::CssMediaQuery::operator==(const Sass::CssMediaQuery&) const’ 939 | bool operator== (const CssMediaQuery& rhs) const; | ^~~~~~~~ src/ast.hpp:96:18: warning: ‘virtual bool Sass::AST_Node::operator!=(const Sass::AST_Node&) const’ was hidden [-Woverloaded-virtual=] 96 | virtual bool operator!= (const AST_Node& rhs) const { | ^~~~~~~~ src/ast.hpp:940:10: note: by ‘bool Sass::CssMediaQuery::operator!=(const Sass::CssMediaQuery&) const’ 940 | bool operator!=(const CssMediaQuery& rhs) const { | ^~~~~~~~ src/ast.hpp:165:18: warning: ‘virtual bool Sass::Expression::operator==(const Sass::Expression&) const’ was hidden [-Woverloaded-virtual=] 165 | virtual bool operator== (const Expression& rhs) const { return false; } | ^~~~~~~~ In file included from src/ast.hpp:14: src/ast_def_macros.hpp:105:16: note: by ‘virtual bool Sass::Selector::operator==(const Sass::Selector&) const’ 105 | virtual bool operator==(const klass& rhs) const = 0; \ | ^~~~~~~~ src/ast_selectors.hpp:56:5: note: in expansion of macro ‘ATTACH_VIRTUAL_CMP_OPERATIONS’ 56 | ATTACH_VIRTUAL_CMP_OPERATIONS(Selector) | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~ src/ast.hpp:96:18: warning: ‘virtual bool Sass::AST_Node::operator!=(const Sass::AST_Node&) const’ was hidden [-Woverloaded-virtual=] 96 | virtual bool operator!= (const AST_Node& rhs) const { | ^~~~~~~~ src/ast_def_macros.hpp:106:16: note: by ‘virtual bool Sass::Selector::operator!=(const Sass::Selector&) const’ 106 | virtual bool operator!=(const klass& rhs) const { return !(*this == rhs); }; \ | ^~~~~~~~ src/ast_selectors.hpp:56:5: note: in expansion of macro ‘ATTACH_VIRTUAL_CMP_OPERATIONS’ 56 | ATTACH_VIRTUAL_CMP_OPERATIONS(Selector) | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~ src/ast_def_macros.hpp:106:16: warning: ‘virtual bool Sass::Selector::operator!=(const Sass::Selector&) const’ was hidden [-Woverloaded-virtual=] 106 | virtual bool operator!=(const klass& rhs) const { return !(*this == rhs); }; \ | ^~~~~~~~ src/ast_selectors.hpp:56:5: note: in expansion of macro ‘ATTACH_VIRTUAL_CMP_OPERATIONS’ 56 | ATTACH_VIRTUAL_CMP_OPERATIONS(Selector) | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~ src/ast_def_macros.hpp:106:16: note: by ‘virtual bool Sass::SimpleSelector::operator!=(const Sass::SimpleSelector&) const’ 106 | virtual bool operator!=(const klass& rhs) const { return !(*this == rhs); }; \ | ^~~~~~~~ src/ast_selectors.hpp:139:5: note: in expansion of macro ‘ATTACH_VIRTUAL_CMP_OPERATIONS’ 139 | ATTACH_VIRTUAL_CMP_OPERATIONS(SimpleSelector); | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~ In file included from src/ast.hpp:1055: src/ast_selectors.hpp:137:18: warning: ‘virtual bool Sass::SimpleSelector::operator==(const Sass::CompoundSelector&) const’ was hidden [-Woverloaded-virtual=] 137 | virtual bool operator==(const CompoundSelector& rhs) const; | ^~~~~~~~ src/ast_def_macros.hpp:109:16: note: by ‘Sass::PlaceholderSelector::operator==’ 109 | virtual bool operator==(const klass& rhs) const; \ | ^~~~~~~~ src/ast_selectors.hpp:157:5: note: in expansion of macro ‘ATTACH_CMP_OPERATIONS’ 157 | ATTACH_CMP_OPERATIONS(PlaceholderSelector) | ^~~~~~~~~~~~~~~~~~~~~ src/ast_selectors.hpp:136:18: warning: ‘virtual bool Sass::SimpleSelector::operator==(const Sass::ComplexSelector&) const’ was hidden [-Woverloaded-virtual=] 136 | virtual bool operator==(const ComplexSelector& rhs) const; | ^~~~~~~~ src/ast_def_macros.hpp:109:16: note: by ‘Sass::PlaceholderSelector::operator==’ 109 | virtual bool operator==(const klass& rhs) const; \ | ^~~~~~~~ src/ast_selectors.hpp:157:5: note: in expansion of macro ‘ATTACH_CMP_OPERATIONS’ 157 | ATTACH_CMP_OPERATIONS(PlaceholderSelector) | ^~~~~~~~~~~~~~~~~~~~~ src/ast_selectors.hpp:135:18: warning: ‘virtual bool Sass::SimpleSelector::operator==(const Sass::SelectorList&) const’ was hidden [-Woverloaded-virtual=] 135 | virtual bool operator==(const SelectorList& rhs) const; | ^~~~~~~~ src/ast_def_macros.hpp:109:16: note: by ‘Sass::PlaceholderSelector::operator==’ 109 | virtual bool operator==(const klass& rhs) const; \ | ^~~~~~~~ src/ast_selectors.hpp:157:5: note: in expansion of macro ‘ATTACH_CMP_OPERATIONS’ 157 | ATTACH_CMP_OPERATIONS(PlaceholderSelector) | ^~~~~~~~~~~~~~~~~~~~~ src/ast_selectors.hpp:133:10: warning: ‘virtual bool Sass::SimpleSelector::operator==(const Sass::Selector&) const’ was hidden [-Woverloaded-virtual=] 133 | bool operator==(const Selector& rhs) const final override; | ^~~~~~~~ src/ast_def_macros.hpp:109:16: note: by ‘Sass::PlaceholderSelector::operator==’ 109 | virtual bool operator==(const klass& rhs) const; \ | ^~~~~~~~ src/ast_selectors.hpp:157:5: note: in expansion of macro ‘ATTACH_CMP_OPERATIONS’ 157 | ATTACH_CMP_OPERATIONS(PlaceholderSelector) | ^~~~~~~~~~~~~~~~~~~~~ src/ast_def_macros.hpp:106:16: warning: ‘virtual bool Sass::SimpleSelector::operator!=(const Sass::SimpleSelector&) const’ was hidden [-Woverloaded-virtual=] 106 | virtual bool operator!=(const klass& rhs) const { return !(*this == rhs); }; \ | ^~~~~~~~ src/ast_selectors.hpp:139:5: note: in expansion of macro ‘ATTACH_VIRTUAL_CMP_OPERATIONS’ 139 | ATTACH_VIRTUAL_CMP_OPERATIONS(SimpleSelector); | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~ src/ast_def_macros.hpp:110:16: note: by ‘virtual bool Sass::PlaceholderSelector::operator!=(const Sass::PlaceholderSelector&) const’ 110 | virtual bool operator!=(const klass& rhs) const { return !(*this == rhs); }; \ | ^~~~~~~~ src/ast_selectors.hpp:157:5: note: in expansion of macro ‘ATTACH_CMP_OPERATIONS’ 157 | ATTACH_CMP_OPERATIONS(PlaceholderSelector) | ^~~~~~~~~~~~~~~~~~~~~ src/ast_selectors.hpp:137:18: warning: ‘virtual bool Sass::SimpleSelector::operator==(const Sass::CompoundSelector&) const’ was hidden [-Woverloaded-virtual=] 137 | virtual bool operator==(const CompoundSelector& rhs) const; | ^~~~~~~~ src/ast_def_macros.hpp:109:16: note: by ‘Sass::TypeSelector::operator==’ 109 | virtual bool operator==(const klass& rhs) const; \ | ^~~~~~~~ src/ast_selectors.hpp:174:5: note: in expansion of macro ‘ATTACH_CMP_OPERATIONS’ 174 | ATTACH_CMP_OPERATIONS(TypeSelector) | ^~~~~~~~~~~~~~~~~~~~~ src/ast_selectors.hpp:136:18: warning: ‘virtual bool Sass::SimpleSelector::operator==(const Sass::ComplexSelector&) const’ was hidden [-Woverloaded-virtual=] 136 | virtual bool operator==(const ComplexSelector& rhs) const; | ^~~~~~~~ src/ast_def_macros.hpp:109:16: note: by ‘Sass::TypeSelector::operator==’ 109 | virtual bool operator==(const klass& rhs) const; \ | ^~~~~~~~ src/ast_selectors.hpp:174:5: note: in expansion of macro ‘ATTACH_CMP_OPERATIONS’ 174 | ATTACH_CMP_OPERATIONS(TypeSelector) | ^~~~~~~~~~~~~~~~~~~~~ src/ast_selectors.hpp:135:18: warning: ‘virtual bool Sass::SimpleSelector::operator==(const Sass::SelectorList&) const’ was hidden [-Woverloaded-virtual=] 135 | virtual bool operator==(const SelectorList& rhs) const; | ^~~~~~~~ src/ast_def_macros.hpp:109:16: note: by ‘Sass::TypeSelector::operator==’ 109 | virtual bool operator==(const klass& rhs) const; \ | ^~~~~~~~ src/ast_selectors.hpp:174:5: note: in expansion of macro ‘ATTACH_CMP_OPERATIONS’ 174 | ATTACH_CMP_OPERATIONS(TypeSelector) | ^~~~~~~~~~~~~~~~~~~~~ src/ast_selectors.hpp:133:10: warning: ‘virtual bool Sass::SimpleSelector::operator==(const Sass::Selector&) const’ was hidden [-Woverloaded-virtual=] 133 | bool operator==(const Selector& rhs) const final override; | ^~~~~~~~ src/ast_def_macros.hpp:109:16: note: by ‘Sass::TypeSelector::operator==’ 109 | virtual bool operator==(const klass& rhs) const; \ | ^~~~~~~~ src/ast_selectors.hpp:174:5: note: in expansion of macro ‘ATTACH_CMP_OPERATIONS’ 174 | ATTACH_CMP_OPERATIONS(TypeSelector) | ^~~~~~~~~~~~~~~~~~~~~ src/ast_def_macros.hpp:106:16: warning: ‘virtual bool Sass::SimpleSelector::operator!=(const Sass::SimpleSelector&) const’ was hidden [-Woverloaded-virtual=] 106 | virtual bool operator!=(const klass& rhs) const { return !(*this == rhs); }; \ | ^~~~~~~~ src/ast_selectors.hpp:139:5: note: in expansion of macro ‘ATTACH_VIRTUAL_CMP_OPERATIONS’ 139 | ATTACH_VIRTUAL_CMP_OPERATIONS(SimpleSelector); | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~ src/ast_def_macros.hpp:110:16: note: by ‘virtual bool Sass::TypeSelector::operator!=(const Sass::TypeSelector&) const’ 110 | virtual bool operator!=(const klass& rhs) const { return !(*this == rhs); }; \ | ^~~~~~~~ src/ast_selectors.hpp:174:5: note: in expansion of macro ‘ATTACH_CMP_OPERATIONS’ 174 | ATTACH_CMP_OPERATIONS(TypeSelector) | ^~~~~~~~~~~~~~~~~~~~~ src/ast_selectors.hpp:137:18: warning: ‘virtual bool Sass::SimpleSelector::operator==(const Sass::CompoundSelector&) const’ was hidden [-Woverloaded-virtual=] 137 | virtual bool operator==(const CompoundSelector& rhs) const; | ^~~~~~~~ src/ast_def_macros.hpp:109:16: note: by ‘Sass::ClassSelector::operator==’ 109 | virtual bool operator==(const klass& rhs) const; \ | ^~~~~~~~ src/ast_selectors.hpp:188:5: note: in expansion of macro ‘ATTACH_CMP_OPERATIONS’ 188 | ATTACH_CMP_OPERATIONS(ClassSelector) | ^~~~~~~~~~~~~~~~~~~~~ src/ast_selectors.hpp:136:18: warning: ‘virtual bool Sass::SimpleSelector::operator==(const Sass::ComplexSelector&) const’ was hidden [-Woverloaded-virtual=] 136 | virtual bool operator==(const ComplexSelector& rhs) const; | ^~~~~~~~ src/ast_def_macros.hpp:109:16: note: by ‘Sass::ClassSelector::operator==’ 109 | virtual bool operator==(const klass& rhs) const; \ | ^~~~~~~~ src/ast_selectors.hpp:188:5: note: in expansion of macro ‘ATTACH_CMP_OPERATIONS’ 188 | ATTACH_CMP_OPERATIONS(ClassSelector) | ^~~~~~~~~~~~~~~~~~~~~ src/ast_selectors.hpp:135:18: warning: ‘virtual bool Sass::SimpleSelector::operator==(const Sass::SelectorList&) const’ was hidden [-Woverloaded-virtual=] 135 | virtual bool operator==(const SelectorList& rhs) const; | ^~~~~~~~ src/ast_def_macros.hpp:109:16: note: by ‘Sass::ClassSelector::operator==’ 109 | virtual bool operator==(const klass& rhs) const; \ | ^~~~~~~~ src/ast_selectors.hpp:188:5: note: in expansion of macro ‘ATTACH_CMP_OPERATIONS’ 188 | ATTACH_CMP_OPERATIONS(ClassSelector) | ^~~~~~~~~~~~~~~~~~~~~ src/ast_selectors.hpp:133:10: warning: ‘virtual bool Sass::SimpleSelector::operator==(const Sass::Selector&) const’ was hidden [-Woverloaded-virtual=] 133 | bool operator==(const Selector& rhs) const final override; | ^~~~~~~~ src/ast_def_macros.hpp:109:16: note: by ‘Sass::ClassSelector::operator==’ 109 | virtual bool operator==(const klass& rhs) const; \ | ^~~~~~~~ src/ast_selectors.hpp:188:5: note: in expansion of macro ‘ATTACH_CMP_OPERATIONS’ 188 | ATTACH_CMP_OPERATIONS(ClassSelector) | ^~~~~~~~~~~~~~~~~~~~~ src/ast_def_macros.hpp:106:16: warning: ‘virtual bool Sass::SimpleSelector::operator!=(const Sass::SimpleSelector&) const’ was hidden [-Woverloaded-virtual=] 106 | virtual bool operator!=(const klass& rhs) const { return !(*this == rhs); }; \ | ^~~~~~~~ src/ast_selectors.hpp:139:5: note: in expansion of macro ‘ATTACH_VIRTUAL_CMP_OPERATIONS’ 139 | ATTACH_VIRTUAL_CMP_OPERATIONS(SimpleSelector); | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~ src/ast_def_macros.hpp:110:16: note: by ‘virtual bool Sass::ClassSelector::operator!=(const Sass::ClassSelector&) const’ 110 | virtual bool operator!=(const klass& rhs) const { return !(*this == rhs); }; \ | ^~~~~~~~ src/ast_selectors.hpp:188:5: note: in expansion of macro ‘ATTACH_CMP_OPERATIONS’ 188 | ATTACH_CMP_OPERATIONS(ClassSelector) | ^~~~~~~~~~~~~~~~~~~~~ src/ast_selectors.hpp:137:18: warning: ‘virtual bool Sass::SimpleSelector::operator==(const Sass::CompoundSelector&) const’ was hidden [-Woverloaded-virtual=] 137 | virtual bool operator==(const CompoundSelector& rhs) const; | ^~~~~~~~ src/ast_def_macros.hpp:109:16: note: by ‘Sass::IDSelector::operator==’ 109 | virtual bool operator==(const klass& rhs) const; \ | ^~~~~~~~ src/ast_selectors.hpp:204:5: note: in expansion of macro ‘ATTACH_CMP_OPERATIONS’ 204 | ATTACH_CMP_OPERATIONS(IDSelector) | ^~~~~~~~~~~~~~~~~~~~~ src/ast_selectors.hpp:136:18: warning: ‘virtual bool Sass::SimpleSelector::operator==(const Sass::ComplexSelector&) const’ was hidden [-Woverloaded-virtual=] 136 | virtual bool operator==(const ComplexSelector& rhs) const; | ^~~~~~~~ src/ast_def_macros.hpp:109:16: note: by ‘Sass::IDSelector::operator==’ 109 | virtual bool operator==(const klass& rhs) const; \ | ^~~~~~~~ src/ast_selectors.hpp:204:5: note: in expansion of macro ‘ATTACH_CMP_OPERATIONS’ 204 | ATTACH_CMP_OPERATIONS(IDSelector) | ^~~~~~~~~~~~~~~~~~~~~ src/ast_selectors.hpp:135:18: warning: ‘virtual bool Sass::SimpleSelector::operator==(const Sass::SelectorList&) const’ was hidden [-Woverloaded-virtual=] 135 | virtual bool operator==(const SelectorList& rhs) const; | ^~~~~~~~ src/ast_def_macros.hpp:109:16: note: by ‘Sass::IDSelector::operator==’ 109 | virtual bool operator==(const klass& rhs) const; \ | ^~~~~~~~ src/ast_selectors.hpp:204:5: note: in expansion of macro ‘ATTACH_CMP_OPERATIONS’ 204 | ATTACH_CMP_OPERATIONS(IDSelector) | ^~~~~~~~~~~~~~~~~~~~~ src/ast_selectors.hpp:133:10: warning: ‘virtual bool Sass::SimpleSelector::operator==(const Sass::Selector&) const’ was hidden [-Woverloaded-virtual=] 133 | bool operator==(const Selector& rhs) const final override; | ^~~~~~~~ src/ast_def_macros.hpp:109:16: note: by ‘Sass::IDSelector::operator==’ 109 | virtual bool operator==(const klass& rhs) const; \ | ^~~~~~~~ src/ast_selectors.hpp:204:5: note: in expansion of macro ‘ATTACH_CMP_OPERATIONS’ 204 | ATTACH_CMP_OPERATIONS(IDSelector) | ^~~~~~~~~~~~~~~~~~~~~ src/ast_def_macros.hpp:106:16: warning: ‘virtual bool Sass::SimpleSelector::operator!=(const Sass::SimpleSelector&) const’ was hidden [-Woverloaded-virtual=] 106 | virtual bool operator!=(const klass& rhs) const { return !(*this == rhs); }; \ | ^~~~~~~~ src/ast_selectors.hpp:139:5: note: in expansion of macro ‘ATTACH_VIRTUAL_CMP_OPERATIONS’ 139 | ATTACH_VIRTUAL_CMP_OPERATIONS(SimpleSelector); | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~ src/ast_def_macros.hpp:110:16: note: by ‘virtual bool Sass::IDSelector::operator!=(const Sass::IDSelector&) const’ 110 | virtual bool operator!=(const klass& rhs) const { return !(*this == rhs); }; \ | ^~~~~~~~ src/ast_selectors.hpp:204:5: note: in expansion of macro ‘ATTACH_CMP_OPERATIONS’ 204 | ATTACH_CMP_OPERATIONS(IDSelector) | ^~~~~~~~~~~~~~~~~~~~~ src/ast_selectors.hpp:137:18: warning: ‘virtual bool Sass::SimpleSelector::operator==(const Sass::CompoundSelector&) const’ was hidden [-Woverloaded-virtual=] 137 | virtual bool operator==(const CompoundSelector& rhs) const; | ^~~~~~~~ src/ast_def_macros.hpp:109:16: note: by ‘Sass::AttributeSelector::operator==’ 109 | virtual bool operator==(const klass& rhs) const; \ | ^~~~~~~~ src/ast_selectors.hpp:223:5: note: in expansion of macro ‘ATTACH_CMP_OPERATIONS’ 223 | ATTACH_CMP_OPERATIONS(AttributeSelector) | ^~~~~~~~~~~~~~~~~~~~~ src/ast_selectors.hpp:136:18: warning: ‘virtual bool Sass::SimpleSelector::operator==(const Sass::ComplexSelector&) const’ was hidden [-Woverloaded-virtual=] 136 | virtual bool operator==(const ComplexSelector& rhs) const; | ^~~~~~~~ src/ast_def_macros.hpp:109:16: note: by ‘Sass::AttributeSelector::operator==’ 109 | virtual bool operator==(const klass& rhs) const; \ | ^~~~~~~~ src/ast_selectors.hpp:223:5: note: in expansion of macro ‘ATTACH_CMP_OPERATIONS’ 223 | ATTACH_CMP_OPERATIONS(AttributeSelector) | ^~~~~~~~~~~~~~~~~~~~~ src/ast_selectors.hpp:135:18: warning: ‘virtual bool Sass::SimpleSelector::operator==(const Sass::SelectorList&) const’ was hidden [-Woverloaded-virtual=] 135 | virtual bool operator==(const SelectorList& rhs) const; | ^~~~~~~~ src/ast_def_macros.hpp:109:16: note: by ‘Sass::AttributeSelector::operator==’ 109 | virtual bool operator==(const klass& rhs) const; \ | ^~~~~~~~ src/ast_selectors.hpp:223:5: note: in expansion of macro ‘ATTACH_CMP_OPERATIONS’ 223 | ATTACH_CMP_OPERATIONS(AttributeSelector) | ^~~~~~~~~~~~~~~~~~~~~ src/ast_selectors.hpp:133:10: warning: ‘virtual bool Sass::SimpleSelector::operator==(const Sass::Selector&) const’ was hidden [-Woverloaded-virtual=] 133 | bool operator==(const Selector& rhs) const final override; | ^~~~~~~~ src/ast_def_macros.hpp:109:16: note: by ‘Sass::AttributeSelector::operator==’ 109 | virtual bool operator==(const klass& rhs) const; \ | ^~~~~~~~ src/ast_selectors.hpp:223:5: note: in expansion of macro ‘ATTACH_CMP_OPERATIONS’ 223 | ATTACH_CMP_OPERATIONS(AttributeSelector) | ^~~~~~~~~~~~~~~~~~~~~ src/ast_def_macros.hpp:106:16: warning: ‘virtual bool Sass::SimpleSelector::operator!=(const Sass::SimpleSelector&) const’ was hidden [-Woverloaded-virtual=] 106 | virtual bool operator!=(const klass& rhs) const { return !(*this == rhs); }; \ | ^~~~~~~~ src/ast_selectors.hpp:139:5: note: in expansion of macro ‘ATTACH_VIRTUAL_CMP_OPERATIONS’ 139 | ATTACH_VIRTUAL_CMP_OPERATIONS(SimpleSelector); | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~ src/ast_def_macros.hpp:110:16: note: by ‘virtual bool Sass::AttributeSelector::operator!=(const Sass::AttributeSelector&) const’ 110 | virtual bool operator!=(const klass& rhs) const { return !(*this == rhs); }; \ | ^~~~~~~~ src/ast_selectors.hpp:223:5: note: in expansion of macro ‘ATTACH_CMP_OPERATIONS’ 223 | ATTACH_CMP_OPERATIONS(AttributeSelector) | ^~~~~~~~~~~~~~~~~~~~~ src/ast_def_macros.hpp:106:16: warning: ‘virtual bool Sass::Selector::operator!=(const Sass::Selector&) const’ was hidden [-Woverloaded-virtual=] 106 | virtual bool operator!=(const klass& rhs) const { return !(*this == rhs); }; \ | ^~~~~~~~ src/ast_selectors.hpp:56:5: note: in expansion of macro ‘ATTACH_VIRTUAL_CMP_OPERATIONS’ 56 | ATTACH_VIRTUAL_CMP_OPERATIONS(Selector) | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~ src/ast_def_macros.hpp:110:16: note: by ‘virtual bool Sass::ComplexSelector::operator!=(const Sass::ComplexSelector&) const’ 110 | virtual bool operator!=(const klass& rhs) const { return !(*this == rhs); }; \ | ^~~~~~~~ src/ast_selectors.hpp:310:5: note: in expansion of macro ‘ATTACH_CMP_OPERATIONS’ 310 | ATTACH_CMP_OPERATIONS(ComplexSelector) | ^~~~~~~~~~~~~~~~~~~~~ src/ast_def_macros.hpp:106:16: warning: ‘virtual bool Sass::Selector::operator!=(const Sass::Selector&) const’ was hidden [-Woverloaded-virtual=] 106 | virtual bool operator!=(const klass& rhs) const { return !(*this == rhs); }; \ | ^~~~~~~~ src/ast_selectors.hpp:56:5: note: in expansion of macro ‘ATTACH_VIRTUAL_CMP_OPERATIONS’ 56 | ATTACH_VIRTUAL_CMP_OPERATIONS(Selector) | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~ src/ast_def_macros.hpp:106:16: note: by ‘virtual bool Sass::SelectorComponent::operator!=(const Sass::SelectorComponent&) const’ 106 | virtual bool operator!=(const klass& rhs) const { return !(*this == rhs); }; \ | ^~~~~~~~ src/ast_selectors.hpp:349:5: note: in expansion of macro ‘ATTACH_VIRTUAL_CMP_OPERATIONS’ 349 | ATTACH_VIRTUAL_CMP_OPERATIONS(SelectorComponent); | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~ src/ast_def_macros.hpp:106:16: warning: ‘virtual bool Sass::SelectorComponent::operator!=(const Sass::SelectorComponent&) const’ was hidden [-Woverloaded-virtual=] 106 | virtual bool operator!=(const klass& rhs) const { return !(*this == rhs); }; \ | ^~~~~~~~ src/ast_selectors.hpp:349:5: note: in expansion of macro ‘ATTACH_VIRTUAL_CMP_OPERATIONS’ 349 | ATTACH_VIRTUAL_CMP_OPERATIONS(SelectorComponent); | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~ src/ast_def_macros.hpp:110:16: note: by ‘virtual bool Sass::SelectorCombinator::operator!=(const Sass::SelectorCombinator&) const’ 110 | virtual bool operator!=(const klass& rhs) const { return !(*this == rhs); }; \ | ^~~~~~~~ src/ast_selectors.hpp:407:5: note: in expansion of macro ‘ATTACH_CMP_OPERATIONS’ 407 | ATTACH_CMP_OPERATIONS(SelectorCombinator) | ^~~~~~~~~~~~~~~~~~~~~ g++ -std=gnu++17 -Wall -O2 -std=c++11 -I ./include -fPIC -c -o src/stylesheet.o src/stylesheet.cpp g++ -std=gnu++17 -Wall -O2 -std=c++11 -I ./include -fPIC -c -o src/output.o src/output.cpp In file included from src/output.cpp:5: src/ast.hpp:90:18: warning: ‘virtual bool Sass::AST_Node::operator==(const Sass::AST_Node&) const’ was hidden [-Woverloaded-virtual=] 90 | virtual bool operator== (const AST_Node& rhs) const { | ^~~~~~~~ src/ast.hpp:165:18: note: by ‘virtual bool Sass::Expression::operator==(const Sass::Expression&) const’ 165 | virtual bool operator== (const Expression& rhs) const { return false; } | ^~~~~~~~ src/ast.hpp:96:18: warning: ‘virtual bool Sass::AST_Node::operator!=(const Sass::AST_Node&) const’ was hidden [-Woverloaded-virtual=] 96 | virtual bool operator!= (const AST_Node& rhs) const { | ^~~~~~~~ src/ast.hpp:167:17: note: by ‘bool Sass::Expression::operator!=(const Sass::Expression&) const’ 167 | inline bool operator!=(const Expression& rhs) const { return !(rhs == *this); } | ^~~~~~~~ src/ast.hpp:90:18: warning: ‘virtual bool Sass::AST_Node::operator==(const Sass::AST_Node&) const’ was hidden [-Woverloaded-virtual=] 90 | virtual bool operator== (const AST_Node& rhs) const { | ^~~~~~~~ src/ast.hpp:908:10: note: by ‘bool Sass::CssMediaRule::operator==(const Sass::CssMediaRule&) const’ 908 | bool operator== (const CssMediaRule& rhs) const { | ^~~~~~~~ src/ast.hpp:96:18: warning: ‘virtual bool Sass::AST_Node::operator!=(const Sass::AST_Node&) const’ was hidden [-Woverloaded-virtual=] 96 | virtual bool operator!= (const AST_Node& rhs) const { | ^~~~~~~~ src/ast.hpp:911:10: note: by ‘bool Sass::CssMediaRule::operator!=(const Sass::CssMediaRule&) const’ 911 | bool operator!=(const CssMediaRule& rhs) const { | ^~~~~~~~ src/ast.hpp:90:18: warning: ‘virtual bool Sass::AST_Node::operator==(const Sass::AST_Node&) const’ was hidden [-Woverloaded-virtual=] 90 | virtual bool operator== (const AST_Node& rhs) const { | ^~~~~~~~ src/ast.hpp:939:10: note: by ‘bool Sass::CssMediaQuery::operator==(const Sass::CssMediaQuery&) const’ 939 | bool operator== (const CssMediaQuery& rhs) const; | ^~~~~~~~ src/ast.hpp:96:18: warning: ‘virtual bool Sass::AST_Node::operator!=(const Sass::AST_Node&) const’ was hidden [-Woverloaded-virtual=] 96 | virtual bool operator!= (const AST_Node& rhs) const { | ^~~~~~~~ src/ast.hpp:940:10: note: by ‘bool Sass::CssMediaQuery::operator!=(const Sass::CssMediaQuery&) const’ 940 | bool operator!=(const CssMediaQuery& rhs) const { | ^~~~~~~~ src/ast.hpp:165:18: warning: ‘virtual bool Sass::Expression::operator==(const Sass::Expression&) const’ was hidden [-Woverloaded-virtual=] 165 | virtual bool operator== (const Expression& rhs) const { return false; } | ^~~~~~~~ In file included from src/ast.hpp:14: src/ast_def_macros.hpp:105:16: note: by ‘virtual bool Sass::Selector::operator==(const Sass::Selector&) const’ 105 | virtual bool operator==(const klass& rhs) const = 0; \ | ^~~~~~~~ src/ast_selectors.hpp:56:5: note: in expansion of macro ‘ATTACH_VIRTUAL_CMP_OPERATIONS’ 56 | ATTACH_VIRTUAL_CMP_OPERATIONS(Selector) | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~ src/ast.hpp:96:18: warning: ‘virtual bool Sass::AST_Node::operator!=(const Sass::AST_Node&) const’ was hidden [-Woverloaded-virtual=] 96 | virtual bool operator!= (const AST_Node& rhs) const { | ^~~~~~~~ src/ast_def_macros.hpp:106:16: note: by ‘virtual bool Sass::Selector::operator!=(const Sass::Selector&) const’ 106 | virtual bool operator!=(const klass& rhs) const { return !(*this == rhs); }; \ | ^~~~~~~~ src/ast_selectors.hpp:56:5: note: in expansion of macro ‘ATTACH_VIRTUAL_CMP_OPERATIONS’ 56 | ATTACH_VIRTUAL_CMP_OPERATIONS(Selector) | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~ src/ast_def_macros.hpp:106:16: warning: ‘virtual bool Sass::Selector::operator!=(const Sass::Selector&) const’ was hidden [-Woverloaded-virtual=] 106 | virtual bool operator!=(const klass& rhs) const { return !(*this == rhs); }; \ | ^~~~~~~~ src/ast_selectors.hpp:56:5: note: in expansion of macro ‘ATTACH_VIRTUAL_CMP_OPERATIONS’ 56 | ATTACH_VIRTUAL_CMP_OPERATIONS(Selector) | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~ src/ast_def_macros.hpp:106:16: note: by ‘virtual bool Sass::SimpleSelector::operator!=(const Sass::SimpleSelector&) const’ 106 | virtual bool operator!=(const klass& rhs) const { return !(*this == rhs); }; \ | ^~~~~~~~ src/ast_selectors.hpp:139:5: note: in expansion of macro ‘ATTACH_VIRTUAL_CMP_OPERATIONS’ 139 | ATTACH_VIRTUAL_CMP_OPERATIONS(SimpleSelector); | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~ In file included from src/ast.hpp:1055: src/ast_selectors.hpp:137:18: warning: ‘virtual bool Sass::SimpleSelector::operator==(const Sass::CompoundSelector&) const’ was hidden [-Woverloaded-virtual=] 137 | virtual bool operator==(const CompoundSelector& rhs) const; | ^~~~~~~~ src/ast_def_macros.hpp:109:16: note: by ‘Sass::PlaceholderSelector::operator==’ 109 | virtual bool operator==(const klass& rhs) const; \ | ^~~~~~~~ src/ast_selectors.hpp:157:5: note: in expansion of macro ‘ATTACH_CMP_OPERATIONS’ 157 | ATTACH_CMP_OPERATIONS(PlaceholderSelector) | ^~~~~~~~~~~~~~~~~~~~~ src/ast_selectors.hpp:136:18: warning: ‘virtual bool Sass::SimpleSelector::operator==(const Sass::ComplexSelector&) const’ was hidden [-Woverloaded-virtual=] 136 | virtual bool operator==(const ComplexSelector& rhs) const; | ^~~~~~~~ src/ast_def_macros.hpp:109:16: note: by ‘Sass::PlaceholderSelector::operator==’ 109 | virtual bool operator==(const klass& rhs) const; \ | ^~~~~~~~ src/ast_selectors.hpp:157:5: note: in expansion of macro ‘ATTACH_CMP_OPERATIONS’ 157 | ATTACH_CMP_OPERATIONS(PlaceholderSelector) | ^~~~~~~~~~~~~~~~~~~~~ src/ast_selectors.hpp:135:18: warning: ‘virtual bool Sass::SimpleSelector::operator==(const Sass::SelectorList&) const’ was hidden [-Woverloaded-virtual=] 135 | virtual bool operator==(const SelectorList& rhs) const; | ^~~~~~~~ src/ast_def_macros.hpp:109:16: note: by ‘Sass::PlaceholderSelector::operator==’ 109 | virtual bool operator==(const klass& rhs) const; \ | ^~~~~~~~ src/ast_selectors.hpp:157:5: note: in expansion of macro ‘ATTACH_CMP_OPERATIONS’ 157 | ATTACH_CMP_OPERATIONS(PlaceholderSelector) | ^~~~~~~~~~~~~~~~~~~~~ src/ast_selectors.hpp:133:10: warning: ‘virtual bool Sass::SimpleSelector::operator==(const Sass::Selector&) const’ was hidden [-Woverloaded-virtual=] 133 | bool operator==(const Selector& rhs) const final override; | ^~~~~~~~ src/ast_def_macros.hpp:109:16: note: by ‘Sass::PlaceholderSelector::operator==’ 109 | virtual bool operator==(const klass& rhs) const; \ | ^~~~~~~~ src/ast_selectors.hpp:157:5: note: in expansion of macro ‘ATTACH_CMP_OPERATIONS’ 157 | ATTACH_CMP_OPERATIONS(PlaceholderSelector) | ^~~~~~~~~~~~~~~~~~~~~ src/ast_def_macros.hpp:106:16: warning: ‘virtual bool Sass::SimpleSelector::operator!=(const Sass::SimpleSelector&) const’ was hidden [-Woverloaded-virtual=] 106 | virtual bool operator!=(const klass& rhs) const { return !(*this == rhs); }; \ | ^~~~~~~~ src/ast_selectors.hpp:139:5: note: in expansion of macro ‘ATTACH_VIRTUAL_CMP_OPERATIONS’ 139 | ATTACH_VIRTUAL_CMP_OPERATIONS(SimpleSelector); | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~ src/ast_def_macros.hpp:110:16: note: by ‘virtual bool Sass::PlaceholderSelector::operator!=(const Sass::PlaceholderSelector&) const’ 110 | virtual bool operator!=(const klass& rhs) const { return !(*this == rhs); }; \ | ^~~~~~~~ src/ast_selectors.hpp:157:5: note: in expansion of macro ‘ATTACH_CMP_OPERATIONS’ 157 | ATTACH_CMP_OPERATIONS(PlaceholderSelector) | ^~~~~~~~~~~~~~~~~~~~~ src/ast_selectors.hpp:137:18: warning: ‘virtual bool Sass::SimpleSelector::operator==(const Sass::CompoundSelector&) const’ was hidden [-Woverloaded-virtual=] 137 | virtual bool operator==(const CompoundSelector& rhs) const; | ^~~~~~~~ src/ast_def_macros.hpp:109:16: note: by ‘Sass::TypeSelector::operator==’ 109 | virtual bool operator==(const klass& rhs) const; \ | ^~~~~~~~ src/ast_selectors.hpp:174:5: note: in expansion of macro ‘ATTACH_CMP_OPERATIONS’ 174 | ATTACH_CMP_OPERATIONS(TypeSelector) | ^~~~~~~~~~~~~~~~~~~~~ src/ast_selectors.hpp:136:18: warning: ‘virtual bool Sass::SimpleSelector::operator==(const Sass::ComplexSelector&) const’ was hidden [-Woverloaded-virtual=] 136 | virtual bool operator==(const ComplexSelector& rhs) const; | ^~~~~~~~ src/ast_def_macros.hpp:109:16: note: by ‘Sass::TypeSelector::operator==’ 109 | virtual bool operator==(const klass& rhs) const; \ | ^~~~~~~~ src/ast_selectors.hpp:174:5: note: in expansion of macro ‘ATTACH_CMP_OPERATIONS’ 174 | ATTACH_CMP_OPERATIONS(TypeSelector) | ^~~~~~~~~~~~~~~~~~~~~ src/ast_selectors.hpp:135:18: warning: ‘virtual bool Sass::SimpleSelector::operator==(const Sass::SelectorList&) const’ was hidden [-Woverloaded-virtual=] 135 | virtual bool operator==(const SelectorList& rhs) const; | ^~~~~~~~ src/ast_def_macros.hpp:109:16: note: by ‘Sass::TypeSelector::operator==’ 109 | virtual bool operator==(const klass& rhs) const; \ | ^~~~~~~~ src/ast_selectors.hpp:174:5: note: in expansion of macro ‘ATTACH_CMP_OPERATIONS’ 174 | ATTACH_CMP_OPERATIONS(TypeSelector) | ^~~~~~~~~~~~~~~~~~~~~ src/ast_selectors.hpp:133:10: warning: ‘virtual bool Sass::SimpleSelector::operator==(const Sass::Selector&) const’ was hidden [-Woverloaded-virtual=] 133 | bool operator==(const Selector& rhs) const final override; | ^~~~~~~~ src/ast_def_macros.hpp:109:16: note: by ‘Sass::TypeSelector::operator==’ 109 | virtual bool operator==(const klass& rhs) const; \ | ^~~~~~~~ src/ast_selectors.hpp:174:5: note: in expansion of macro ‘ATTACH_CMP_OPERATIONS’ 174 | ATTACH_CMP_OPERATIONS(TypeSelector) | ^~~~~~~~~~~~~~~~~~~~~ src/ast_def_macros.hpp:106:16: warning: ‘virtual bool Sass::SimpleSelector::operator!=(const Sass::SimpleSelector&) const’ was hidden [-Woverloaded-virtual=] 106 | virtual bool operator!=(const klass& rhs) const { return !(*this == rhs); }; \ | ^~~~~~~~ src/ast_selectors.hpp:139:5: note: in expansion of macro ‘ATTACH_VIRTUAL_CMP_OPERATIONS’ 139 | ATTACH_VIRTUAL_CMP_OPERATIONS(SimpleSelector); | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~ src/ast_def_macros.hpp:110:16: note: by ‘virtual bool Sass::TypeSelector::operator!=(const Sass::TypeSelector&) const’ 110 | virtual bool operator!=(const klass& rhs) const { return !(*this == rhs); }; \ | ^~~~~~~~ src/ast_selectors.hpp:174:5: note: in expansion of macro ‘ATTACH_CMP_OPERATIONS’ 174 | ATTACH_CMP_OPERATIONS(TypeSelector) | ^~~~~~~~~~~~~~~~~~~~~ src/ast_selectors.hpp:137:18: warning: ‘virtual bool Sass::SimpleSelector::operator==(const Sass::CompoundSelector&) const’ was hidden [-Woverloaded-virtual=] 137 | virtual bool operator==(const CompoundSelector& rhs) const; | ^~~~~~~~ src/ast_def_macros.hpp:109:16: note: by ‘Sass::ClassSelector::operator==’ 109 | virtual bool operator==(const klass& rhs) const; \ | ^~~~~~~~ src/ast_selectors.hpp:188:5: note: in expansion of macro ‘ATTACH_CMP_OPERATIONS’ 188 | ATTACH_CMP_OPERATIONS(ClassSelector) | ^~~~~~~~~~~~~~~~~~~~~ src/ast_selectors.hpp:136:18: warning: ‘virtual bool Sass::SimpleSelector::operator==(const Sass::ComplexSelector&) const’ was hidden [-Woverloaded-virtual=] 136 | virtual bool operator==(const ComplexSelector& rhs) const; | ^~~~~~~~ src/ast_def_macros.hpp:109:16: note: by ‘Sass::ClassSelector::operator==’ 109 | virtual bool operator==(const klass& rhs) const; \ | ^~~~~~~~ src/ast_selectors.hpp:188:5: note: in expansion of macro ‘ATTACH_CMP_OPERATIONS’ 188 | ATTACH_CMP_OPERATIONS(ClassSelector) | ^~~~~~~~~~~~~~~~~~~~~ src/ast_selectors.hpp:135:18: warning: ‘virtual bool Sass::SimpleSelector::operator==(const Sass::SelectorList&) const’ was hidden [-Woverloaded-virtual=] 135 | virtual bool operator==(const SelectorList& rhs) const; | ^~~~~~~~ src/ast_def_macros.hpp:109:16: note: by ‘Sass::ClassSelector::operator==’ 109 | virtual bool operator==(const klass& rhs) const; \ | ^~~~~~~~ src/ast_selectors.hpp:188:5: note: in expansion of macro ‘ATTACH_CMP_OPERATIONS’ 188 | ATTACH_CMP_OPERATIONS(ClassSelector) | ^~~~~~~~~~~~~~~~~~~~~ src/ast_selectors.hpp:133:10: warning: ‘virtual bool Sass::SimpleSelector::operator==(const Sass::Selector&) const’ was hidden [-Woverloaded-virtual=] 133 | bool operator==(const Selector& rhs) const final override; | ^~~~~~~~ src/ast_def_macros.hpp:109:16: note: by ‘Sass::ClassSelector::operator==’ 109 | virtual bool operator==(const klass& rhs) const; \ | ^~~~~~~~ src/ast_selectors.hpp:188:5: note: in expansion of macro ‘ATTACH_CMP_OPERATIONS’ 188 | ATTACH_CMP_OPERATIONS(ClassSelector) | ^~~~~~~~~~~~~~~~~~~~~ src/ast_def_macros.hpp:106:16: warning: ‘virtual bool Sass::SimpleSelector::operator!=(const Sass::SimpleSelector&) const’ was hidden [-Woverloaded-virtual=] 106 | virtual bool operator!=(const klass& rhs) const { return !(*this == rhs); }; \ | ^~~~~~~~ src/ast_selectors.hpp:139:5: note: in expansion of macro ‘ATTACH_VIRTUAL_CMP_OPERATIONS’ 139 | ATTACH_VIRTUAL_CMP_OPERATIONS(SimpleSelector); | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~ src/ast_def_macros.hpp:110:16: note: by ‘virtual bool Sass::ClassSelector::operator!=(const Sass::ClassSelector&) const’ 110 | virtual bool operator!=(const klass& rhs) const { return !(*this == rhs); }; \ | ^~~~~~~~ src/ast_selectors.hpp:188:5: note: in expansion of macro ‘ATTACH_CMP_OPERATIONS’ 188 | ATTACH_CMP_OPERATIONS(ClassSelector) | ^~~~~~~~~~~~~~~~~~~~~ src/ast_selectors.hpp:137:18: warning: ‘virtual bool Sass::SimpleSelector::operator==(const Sass::CompoundSelector&) const’ was hidden [-Woverloaded-virtual=] 137 | virtual bool operator==(const CompoundSelector& rhs) const; | ^~~~~~~~ src/ast_def_macros.hpp:109:16: note: by ‘Sass::IDSelector::operator==’ 109 | virtual bool operator==(const klass& rhs) const; \ | ^~~~~~~~ src/ast_selectors.hpp:204:5: note: in expansion of macro ‘ATTACH_CMP_OPERATIONS’ 204 | ATTACH_CMP_OPERATIONS(IDSelector) | ^~~~~~~~~~~~~~~~~~~~~ src/ast_selectors.hpp:136:18: warning: ‘virtual bool Sass::SimpleSelector::operator==(const Sass::ComplexSelector&) const’ was hidden [-Woverloaded-virtual=] 136 | virtual bool operator==(const ComplexSelector& rhs) const; | ^~~~~~~~ src/ast_def_macros.hpp:109:16: note: by ‘Sass::IDSelector::operator==’ 109 | virtual bool operator==(const klass& rhs) const; \ | ^~~~~~~~ src/ast_selectors.hpp:204:5: note: in expansion of macro ‘ATTACH_CMP_OPERATIONS’ 204 | ATTACH_CMP_OPERATIONS(IDSelector) | ^~~~~~~~~~~~~~~~~~~~~ src/ast_selectors.hpp:135:18: warning: ‘virtual bool Sass::SimpleSelector::operator==(const Sass::SelectorList&) const’ was hidden [-Woverloaded-virtual=] 135 | virtual bool operator==(const SelectorList& rhs) const; | ^~~~~~~~ src/ast_def_macros.hpp:109:16: note: by ‘Sass::IDSelector::operator==’ 109 | virtual bool operator==(const klass& rhs) const; \ | ^~~~~~~~ src/ast_selectors.hpp:204:5: note: in expansion of macro ‘ATTACH_CMP_OPERATIONS’ 204 | ATTACH_CMP_OPERATIONS(IDSelector) | ^~~~~~~~~~~~~~~~~~~~~ src/ast_selectors.hpp:133:10: warning: ‘virtual bool Sass::SimpleSelector::operator==(const Sass::Selector&) const’ was hidden [-Woverloaded-virtual=] 133 | bool operator==(const Selector& rhs) const final override; | ^~~~~~~~ src/ast_def_macros.hpp:109:16: note: by ‘Sass::IDSelector::operator==’ 109 | virtual bool operator==(const klass& rhs) const; \ | ^~~~~~~~ src/ast_selectors.hpp:204:5: note: in expansion of macro ‘ATTACH_CMP_OPERATIONS’ 204 | ATTACH_CMP_OPERATIONS(IDSelector) | ^~~~~~~~~~~~~~~~~~~~~ src/ast_def_macros.hpp:106:16: warning: ‘virtual bool Sass::SimpleSelector::operator!=(const Sass::SimpleSelector&) const’ was hidden [-Woverloaded-virtual=] 106 | virtual bool operator!=(const klass& rhs) const { return !(*this == rhs); }; \ | ^~~~~~~~ src/ast_selectors.hpp:139:5: note: in expansion of macro ‘ATTACH_VIRTUAL_CMP_OPERATIONS’ 139 | ATTACH_VIRTUAL_CMP_OPERATIONS(SimpleSelector); | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~ src/ast_def_macros.hpp:110:16: note: by ‘virtual bool Sass::IDSelector::operator!=(const Sass::IDSelector&) const’ 110 | virtual bool operator!=(const klass& rhs) const { return !(*this == rhs); }; \ | ^~~~~~~~ src/ast_selectors.hpp:204:5: note: in expansion of macro ‘ATTACH_CMP_OPERATIONS’ 204 | ATTACH_CMP_OPERATIONS(IDSelector) | ^~~~~~~~~~~~~~~~~~~~~ src/ast_selectors.hpp:137:18: warning: ‘virtual bool Sass::SimpleSelector::operator==(const Sass::CompoundSelector&) const’ was hidden [-Woverloaded-virtual=] 137 | virtual bool operator==(const CompoundSelector& rhs) const; | ^~~~~~~~ src/ast_def_macros.hpp:109:16: note: by ‘Sass::AttributeSelector::operator==’ 109 | virtual bool operator==(const klass& rhs) const; \ | ^~~~~~~~ src/ast_selectors.hpp:223:5: note: in expansion of macro ‘ATTACH_CMP_OPERATIONS’ 223 | ATTACH_CMP_OPERATIONS(AttributeSelector) | ^~~~~~~~~~~~~~~~~~~~~ src/ast_selectors.hpp:136:18: warning: ‘virtual bool Sass::SimpleSelector::operator==(const Sass::ComplexSelector&) const’ was hidden [-Woverloaded-virtual=] 136 | virtual bool operator==(const ComplexSelector& rhs) const; | ^~~~~~~~ src/ast_def_macros.hpp:109:16: note: by ‘Sass::AttributeSelector::operator==’ 109 | virtual bool operator==(const klass& rhs) const; \ | ^~~~~~~~ src/ast_selectors.hpp:223:5: note: in expansion of macro ‘ATTACH_CMP_OPERATIONS’ 223 | ATTACH_CMP_OPERATIONS(AttributeSelector) | ^~~~~~~~~~~~~~~~~~~~~ src/ast_selectors.hpp:135:18: warning: ‘virtual bool Sass::SimpleSelector::operator==(const Sass::SelectorList&) const’ was hidden [-Woverloaded-virtual=] 135 | virtual bool operator==(const SelectorList& rhs) const; | ^~~~~~~~ src/ast_def_macros.hpp:109:16: note: by ‘Sass::AttributeSelector::operator==’ 109 | virtual bool operator==(const klass& rhs) const; \ | ^~~~~~~~ src/ast_selectors.hpp:223:5: note: in expansion of macro ‘ATTACH_CMP_OPERATIONS’ 223 | ATTACH_CMP_OPERATIONS(AttributeSelector) | ^~~~~~~~~~~~~~~~~~~~~ src/ast_selectors.hpp:133:10: warning: ‘virtual bool Sass::SimpleSelector::operator==(const Sass::Selector&) const’ was hidden [-Woverloaded-virtual=] 133 | bool operator==(const Selector& rhs) const final override; | ^~~~~~~~ src/ast_def_macros.hpp:109:16: note: by ‘Sass::AttributeSelector::operator==’ 109 | virtual bool operator==(const klass& rhs) const; \ | ^~~~~~~~ src/ast_selectors.hpp:223:5: note: in expansion of macro ‘ATTACH_CMP_OPERATIONS’ 223 | ATTACH_CMP_OPERATIONS(AttributeSelector) | ^~~~~~~~~~~~~~~~~~~~~ src/ast_def_macros.hpp:106:16: warning: ‘virtual bool Sass::SimpleSelector::operator!=(const Sass::SimpleSelector&) const’ was hidden [-Woverloaded-virtual=] 106 | virtual bool operator!=(const klass& rhs) const { return !(*this == rhs); }; \ | ^~~~~~~~ src/ast_selectors.hpp:139:5: note: in expansion of macro ‘ATTACH_VIRTUAL_CMP_OPERATIONS’ 139 | ATTACH_VIRTUAL_CMP_OPERATIONS(SimpleSelector); | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~ src/ast_def_macros.hpp:110:16: note: by ‘virtual bool Sass::AttributeSelector::operator!=(const Sass::AttributeSelector&) const’ 110 | virtual bool operator!=(const klass& rhs) const { return !(*this == rhs); }; \ | ^~~~~~~~ src/ast_selectors.hpp:223:5: note: in expansion of macro ‘ATTACH_CMP_OPERATIONS’ 223 | ATTACH_CMP_OPERATIONS(AttributeSelector) | ^~~~~~~~~~~~~~~~~~~~~ src/ast_def_macros.hpp:106:16: warning: ‘virtual bool Sass::Selector::operator!=(const Sass::Selector&) const’ was hidden [-Woverloaded-virtual=] 106 | virtual bool operator!=(const klass& rhs) const { return !(*this == rhs); }; \ | ^~~~~~~~ src/ast_selectors.hpp:56:5: note: in expansion of macro ‘ATTACH_VIRTUAL_CMP_OPERATIONS’ 56 | ATTACH_VIRTUAL_CMP_OPERATIONS(Selector) | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~ src/ast_def_macros.hpp:110:16: note: by ‘virtual bool Sass::ComplexSelector::operator!=(const Sass::ComplexSelector&) const’ 110 | virtual bool operator!=(const klass& rhs) const { return !(*this == rhs); }; \ | ^~~~~~~~ src/ast_selectors.hpp:310:5: note: in expansion of macro ‘ATTACH_CMP_OPERATIONS’ 310 | ATTACH_CMP_OPERATIONS(ComplexSelector) | ^~~~~~~~~~~~~~~~~~~~~ src/ast_def_macros.hpp:106:16: warning: ‘virtual bool Sass::Selector::operator!=(const Sass::Selector&) const’ was hidden [-Woverloaded-virtual=] 106 | virtual bool operator!=(const klass& rhs) const { return !(*this == rhs); }; \ | ^~~~~~~~ src/ast_selectors.hpp:56:5: note: in expansion of macro ‘ATTACH_VIRTUAL_CMP_OPERATIONS’ 56 | ATTACH_VIRTUAL_CMP_OPERATIONS(Selector) | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~ src/ast_def_macros.hpp:106:16: note: by ‘virtual bool Sass::SelectorComponent::operator!=(const Sass::SelectorComponent&) const’ 106 | virtual bool operator!=(const klass& rhs) const { return !(*this == rhs); }; \ | ^~~~~~~~ src/ast_selectors.hpp:349:5: note: in expansion of macro ‘ATTACH_VIRTUAL_CMP_OPERATIONS’ 349 | ATTACH_VIRTUAL_CMP_OPERATIONS(SelectorComponent); | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~ src/ast_def_macros.hpp:106:16: warning: ‘virtual bool Sass::SelectorComponent::operator!=(const Sass::SelectorComponent&) const’ was hidden [-Woverloaded-virtual=] 106 | virtual bool operator!=(const klass& rhs) const { return !(*this == rhs); }; \ | ^~~~~~~~ src/ast_selectors.hpp:349:5: note: in expansion of macro ‘ATTACH_VIRTUAL_CMP_OPERATIONS’ 349 | ATTACH_VIRTUAL_CMP_OPERATIONS(SelectorComponent); | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~ src/ast_def_macros.hpp:110:16: note: by ‘virtual bool Sass::SelectorCombinator::operator!=(const Sass::SelectorCombinator&) const’ 110 | virtual bool operator!=(const klass& rhs) const { return !(*this == rhs); }; \ | ^~~~~~~~ src/ast_selectors.hpp:407:5: note: in expansion of macro ‘ATTACH_CMP_OPERATIONS’ 407 | ATTACH_CMP_OPERATIONS(SelectorCombinator) | ^~~~~~~~~~~~~~~~~~~~~ g++ -std=gnu++17 -Wall -O2 -std=c++11 -I ./include -fPIC -c -o src/inspect.o src/inspect.cpp In file included from src/inspect.cpp:12: src/ast.hpp:90:18: warning: ‘virtual bool Sass::AST_Node::operator==(const Sass::AST_Node&) const’ was hidden [-Woverloaded-virtual=] 90 | virtual bool operator== (const AST_Node& rhs) const { | ^~~~~~~~ src/ast.hpp:165:18: note: by ‘virtual bool Sass::Expression::operator==(const Sass::Expression&) const’ 165 | virtual bool operator== (const Expression& rhs) const { return false; } | ^~~~~~~~ src/ast.hpp:96:18: warning: ‘virtual bool Sass::AST_Node::operator!=(const Sass::AST_Node&) const’ was hidden [-Woverloaded-virtual=] 96 | virtual bool operator!= (const AST_Node& rhs) const { | ^~~~~~~~ src/ast.hpp:167:17: note: by ‘bool Sass::Expression::operator!=(const Sass::Expression&) const’ 167 | inline bool operator!=(const Expression& rhs) const { return !(rhs == *this); } | ^~~~~~~~ src/ast.hpp:90:18: warning: ‘virtual bool Sass::AST_Node::operator==(const Sass::AST_Node&) const’ was hidden [-Woverloaded-virtual=] 90 | virtual bool operator== (const AST_Node& rhs) const { | ^~~~~~~~ src/ast.hpp:908:10: note: by ‘bool Sass::CssMediaRule::operator==(const Sass::CssMediaRule&) const’ 908 | bool operator== (const CssMediaRule& rhs) const { | ^~~~~~~~ src/ast.hpp:96:18: warning: ‘virtual bool Sass::AST_Node::operator!=(const Sass::AST_Node&) const’ was hidden [-Woverloaded-virtual=] 96 | virtual bool operator!= (const AST_Node& rhs) const { | ^~~~~~~~ src/ast.hpp:911:10: note: by ‘bool Sass::CssMediaRule::operator!=(const Sass::CssMediaRule&) const’ 911 | bool operator!=(const CssMediaRule& rhs) const { | ^~~~~~~~ src/ast.hpp:90:18: warning: ‘virtual bool Sass::AST_Node::operator==(const Sass::AST_Node&) const’ was hidden [-Woverloaded-virtual=] 90 | virtual bool operator== (const AST_Node& rhs) const { | ^~~~~~~~ src/ast.hpp:939:10: note: by ‘bool Sass::CssMediaQuery::operator==(const Sass::CssMediaQuery&) const’ 939 | bool operator== (const CssMediaQuery& rhs) const; | ^~~~~~~~ src/ast.hpp:96:18: warning: ‘virtual bool Sass::AST_Node::operator!=(const Sass::AST_Node&) const’ was hidden [-Woverloaded-virtual=] 96 | virtual bool operator!= (const AST_Node& rhs) const { | ^~~~~~~~ src/ast.hpp:940:10: note: by ‘bool Sass::CssMediaQuery::operator!=(const Sass::CssMediaQuery&) const’ 940 | bool operator!=(const CssMediaQuery& rhs) const { | ^~~~~~~~ src/ast.hpp:165:18: warning: ‘virtual bool Sass::Expression::operator==(const Sass::Expression&) const’ was hidden [-Woverloaded-virtual=] 165 | virtual bool operator== (const Expression& rhs) const { return false; } | ^~~~~~~~ In file included from src/ast.hpp:14: src/ast_def_macros.hpp:105:16: note: by ‘virtual bool Sass::Selector::operator==(const Sass::Selector&) const’ 105 | virtual bool operator==(const klass& rhs) const = 0; \ | ^~~~~~~~ src/ast_selectors.hpp:56:5: note: in expansion of macro ‘ATTACH_VIRTUAL_CMP_OPERATIONS’ 56 | ATTACH_VIRTUAL_CMP_OPERATIONS(Selector) | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~ src/ast.hpp:96:18: warning: ‘virtual bool Sass::AST_Node::operator!=(const Sass::AST_Node&) const’ was hidden [-Woverloaded-virtual=] 96 | virtual bool operator!= (const AST_Node& rhs) const { | ^~~~~~~~ src/ast_def_macros.hpp:106:16: note: by ‘virtual bool Sass::Selector::operator!=(const Sass::Selector&) const’ 106 | virtual bool operator!=(const klass& rhs) const { return !(*this == rhs); }; \ | ^~~~~~~~ src/ast_selectors.hpp:56:5: note: in expansion of macro ‘ATTACH_VIRTUAL_CMP_OPERATIONS’ 56 | ATTACH_VIRTUAL_CMP_OPERATIONS(Selector) | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~ src/ast_def_macros.hpp:106:16: warning: ‘virtual bool Sass::Selector::operator!=(const Sass::Selector&) const’ was hidden [-Woverloaded-virtual=] 106 | virtual bool operator!=(const klass& rhs) const { return !(*this == rhs); }; \ | ^~~~~~~~ src/ast_selectors.hpp:56:5: note: in expansion of macro ‘ATTACH_VIRTUAL_CMP_OPERATIONS’ 56 | ATTACH_VIRTUAL_CMP_OPERATIONS(Selector) | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~ src/ast_def_macros.hpp:106:16: note: by ‘virtual bool Sass::SimpleSelector::operator!=(const Sass::SimpleSelector&) const’ 106 | virtual bool operator!=(const klass& rhs) const { return !(*this == rhs); }; \ | ^~~~~~~~ src/ast_selectors.hpp:139:5: note: in expansion of macro ‘ATTACH_VIRTUAL_CMP_OPERATIONS’ 139 | ATTACH_VIRTUAL_CMP_OPERATIONS(SimpleSelector); | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~ In file included from src/ast.hpp:1055: src/ast_selectors.hpp:137:18: warning: ‘virtual bool Sass::SimpleSelector::operator==(const Sass::CompoundSelector&) const’ was hidden [-Woverloaded-virtual=] 137 | virtual bool operator==(const CompoundSelector& rhs) const; | ^~~~~~~~ src/ast_def_macros.hpp:109:16: note: by ‘Sass::PlaceholderSelector::operator==’ 109 | virtual bool operator==(const klass& rhs) const; \ | ^~~~~~~~ src/ast_selectors.hpp:157:5: note: in expansion of macro ‘ATTACH_CMP_OPERATIONS’ 157 | ATTACH_CMP_OPERATIONS(PlaceholderSelector) | ^~~~~~~~~~~~~~~~~~~~~ src/ast_selectors.hpp:136:18: warning: ‘virtual bool Sass::SimpleSelector::operator==(const Sass::ComplexSelector&) const’ was hidden [-Woverloaded-virtual=] 136 | virtual bool operator==(const ComplexSelector& rhs) const; | ^~~~~~~~ src/ast_def_macros.hpp:109:16: note: by ‘Sass::PlaceholderSelector::operator==’ 109 | virtual bool operator==(const klass& rhs) const; \ | ^~~~~~~~ src/ast_selectors.hpp:157:5: note: in expansion of macro ‘ATTACH_CMP_OPERATIONS’ 157 | ATTACH_CMP_OPERATIONS(PlaceholderSelector) | ^~~~~~~~~~~~~~~~~~~~~ src/ast_selectors.hpp:135:18: warning: ‘virtual bool Sass::SimpleSelector::operator==(const Sass::SelectorList&) const’ was hidden [-Woverloaded-virtual=] 135 | virtual bool operator==(const SelectorList& rhs) const; | ^~~~~~~~ src/ast_def_macros.hpp:109:16: note: by ‘Sass::PlaceholderSelector::operator==’ 109 | virtual bool operator==(const klass& rhs) const; \ | ^~~~~~~~ src/ast_selectors.hpp:157:5: note: in expansion of macro ‘ATTACH_CMP_OPERATIONS’ 157 | ATTACH_CMP_OPERATIONS(PlaceholderSelector) | ^~~~~~~~~~~~~~~~~~~~~ src/ast_selectors.hpp:133:10: warning: ‘virtual bool Sass::SimpleSelector::operator==(const Sass::Selector&) const’ was hidden [-Woverloaded-virtual=] 133 | bool operator==(const Selector& rhs) const final override; | ^~~~~~~~ src/ast_def_macros.hpp:109:16: note: by ‘Sass::PlaceholderSelector::operator==’ 109 | virtual bool operator==(const klass& rhs) const; \ | ^~~~~~~~ src/ast_selectors.hpp:157:5: note: in expansion of macro ‘ATTACH_CMP_OPERATIONS’ 157 | ATTACH_CMP_OPERATIONS(PlaceholderSelector) | ^~~~~~~~~~~~~~~~~~~~~ src/ast_def_macros.hpp:106:16: warning: ‘virtual bool Sass::SimpleSelector::operator!=(const Sass::SimpleSelector&) const’ was hidden [-Woverloaded-virtual=] 106 | virtual bool operator!=(const klass& rhs) const { return !(*this == rhs); }; \ | ^~~~~~~~ src/ast_selectors.hpp:139:5: note: in expansion of macro ‘ATTACH_VIRTUAL_CMP_OPERATIONS’ 139 | ATTACH_VIRTUAL_CMP_OPERATIONS(SimpleSelector); | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~ src/ast_def_macros.hpp:110:16: note: by ‘virtual bool Sass::PlaceholderSelector::operator!=(const Sass::PlaceholderSelector&) const’ 110 | virtual bool operator!=(const klass& rhs) const { return !(*this == rhs); }; \ | ^~~~~~~~ src/ast_selectors.hpp:157:5: note: in expansion of macro ‘ATTACH_CMP_OPERATIONS’ 157 | ATTACH_CMP_OPERATIONS(PlaceholderSelector) | ^~~~~~~~~~~~~~~~~~~~~ src/ast_selectors.hpp:137:18: warning: ‘virtual bool Sass::SimpleSelector::operator==(const Sass::CompoundSelector&) const’ was hidden [-Woverloaded-virtual=] 137 | virtual bool operator==(const CompoundSelector& rhs) const; | ^~~~~~~~ src/ast_def_macros.hpp:109:16: note: by ‘Sass::TypeSelector::operator==’ 109 | virtual bool operator==(const klass& rhs) const; \ | ^~~~~~~~ src/ast_selectors.hpp:174:5: note: in expansion of macro ‘ATTACH_CMP_OPERATIONS’ 174 | ATTACH_CMP_OPERATIONS(TypeSelector) | ^~~~~~~~~~~~~~~~~~~~~ src/ast_selectors.hpp:136:18: warning: ‘virtual bool Sass::SimpleSelector::operator==(const Sass::ComplexSelector&) const’ was hidden [-Woverloaded-virtual=] 136 | virtual bool operator==(const ComplexSelector& rhs) const; | ^~~~~~~~ src/ast_def_macros.hpp:109:16: note: by ‘Sass::TypeSelector::operator==’ 109 | virtual bool operator==(const klass& rhs) const; \ | ^~~~~~~~ src/ast_selectors.hpp:174:5: note: in expansion of macro ‘ATTACH_CMP_OPERATIONS’ 174 | ATTACH_CMP_OPERATIONS(TypeSelector) | ^~~~~~~~~~~~~~~~~~~~~ src/ast_selectors.hpp:135:18: warning: ‘virtual bool Sass::SimpleSelector::operator==(const Sass::SelectorList&) const’ was hidden [-Woverloaded-virtual=] 135 | virtual bool operator==(const SelectorList& rhs) const; | ^~~~~~~~ src/ast_def_macros.hpp:109:16: note: by ‘Sass::TypeSelector::operator==’ 109 | virtual bool operator==(const klass& rhs) const; \ | ^~~~~~~~ src/ast_selectors.hpp:174:5: note: in expansion of macro ‘ATTACH_CMP_OPERATIONS’ 174 | ATTACH_CMP_OPERATIONS(TypeSelector) | ^~~~~~~~~~~~~~~~~~~~~ src/ast_selectors.hpp:133:10: warning: ‘virtual bool Sass::SimpleSelector::operator==(const Sass::Selector&) const’ was hidden [-Woverloaded-virtual=] 133 | bool operator==(const Selector& rhs) const final override; | ^~~~~~~~ src/ast_def_macros.hpp:109:16: note: by ‘Sass::TypeSelector::operator==’ 109 | virtual bool operator==(const klass& rhs) const; \ | ^~~~~~~~ src/ast_selectors.hpp:174:5: note: in expansion of macro ‘ATTACH_CMP_OPERATIONS’ 174 | ATTACH_CMP_OPERATIONS(TypeSelector) | ^~~~~~~~~~~~~~~~~~~~~ src/ast_def_macros.hpp:106:16: warning: ‘virtual bool Sass::SimpleSelector::operator!=(const Sass::SimpleSelector&) const’ was hidden [-Woverloaded-virtual=] 106 | virtual bool operator!=(const klass& rhs) const { return !(*this == rhs); }; \ | ^~~~~~~~ src/ast_selectors.hpp:139:5: note: in expansion of macro ‘ATTACH_VIRTUAL_CMP_OPERATIONS’ 139 | ATTACH_VIRTUAL_CMP_OPERATIONS(SimpleSelector); | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~ src/ast_def_macros.hpp:110:16: note: by ‘virtual bool Sass::TypeSelector::operator!=(const Sass::TypeSelector&) const’ 110 | virtual bool operator!=(const klass& rhs) const { return !(*this == rhs); }; \ | ^~~~~~~~ src/ast_selectors.hpp:174:5: note: in expansion of macro ‘ATTACH_CMP_OPERATIONS’ 174 | ATTACH_CMP_OPERATIONS(TypeSelector) | ^~~~~~~~~~~~~~~~~~~~~ src/ast_selectors.hpp:137:18: warning: ‘virtual bool Sass::SimpleSelector::operator==(const Sass::CompoundSelector&) const’ was hidden [-Woverloaded-virtual=] 137 | virtual bool operator==(const CompoundSelector& rhs) const; | ^~~~~~~~ src/ast_def_macros.hpp:109:16: note: by ‘Sass::ClassSelector::operator==’ 109 | virtual bool operator==(const klass& rhs) const; \ | ^~~~~~~~ src/ast_selectors.hpp:188:5: note: in expansion of macro ‘ATTACH_CMP_OPERATIONS’ 188 | ATTACH_CMP_OPERATIONS(ClassSelector) | ^~~~~~~~~~~~~~~~~~~~~ src/ast_selectors.hpp:136:18: warning: ‘virtual bool Sass::SimpleSelector::operator==(const Sass::ComplexSelector&) const’ was hidden [-Woverloaded-virtual=] 136 | virtual bool operator==(const ComplexSelector& rhs) const; | ^~~~~~~~ src/ast_def_macros.hpp:109:16: note: by ‘Sass::ClassSelector::operator==’ 109 | virtual bool operator==(const klass& rhs) const; \ | ^~~~~~~~ src/ast_selectors.hpp:188:5: note: in expansion of macro ‘ATTACH_CMP_OPERATIONS’ 188 | ATTACH_CMP_OPERATIONS(ClassSelector) | ^~~~~~~~~~~~~~~~~~~~~ src/ast_selectors.hpp:135:18: warning: ‘virtual bool Sass::SimpleSelector::operator==(const Sass::SelectorList&) const’ was hidden [-Woverloaded-virtual=] 135 | virtual bool operator==(const SelectorList& rhs) const; | ^~~~~~~~ src/ast_def_macros.hpp:109:16: note: by ‘Sass::ClassSelector::operator==’ 109 | virtual bool operator==(const klass& rhs) const; \ | ^~~~~~~~ src/ast_selectors.hpp:188:5: note: in expansion of macro ‘ATTACH_CMP_OPERATIONS’ 188 | ATTACH_CMP_OPERATIONS(ClassSelector) | ^~~~~~~~~~~~~~~~~~~~~ src/ast_selectors.hpp:133:10: warning: ‘virtual bool Sass::SimpleSelector::operator==(const Sass::Selector&) const’ was hidden [-Woverloaded-virtual=] 133 | bool operator==(const Selector& rhs) const final override; | ^~~~~~~~ src/ast_def_macros.hpp:109:16: note: by ‘Sass::ClassSelector::operator==’ 109 | virtual bool operator==(const klass& rhs) const; \ | ^~~~~~~~ src/ast_selectors.hpp:188:5: note: in expansion of macro ‘ATTACH_CMP_OPERATIONS’ 188 | ATTACH_CMP_OPERATIONS(ClassSelector) | ^~~~~~~~~~~~~~~~~~~~~ src/ast_def_macros.hpp:106:16: warning: ‘virtual bool Sass::SimpleSelector::operator!=(const Sass::SimpleSelector&) const’ was hidden [-Woverloaded-virtual=] 106 | virtual bool operator!=(const klass& rhs) const { return !(*this == rhs); }; \ | ^~~~~~~~ src/ast_selectors.hpp:139:5: note: in expansion of macro ‘ATTACH_VIRTUAL_CMP_OPERATIONS’ 139 | ATTACH_VIRTUAL_CMP_OPERATIONS(SimpleSelector); | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~ src/ast_def_macros.hpp:110:16: note: by ‘virtual bool Sass::ClassSelector::operator!=(const Sass::ClassSelector&) const’ 110 | virtual bool operator!=(const klass& rhs) const { return !(*this == rhs); }; \ | ^~~~~~~~ src/ast_selectors.hpp:188:5: note: in expansion of macro ‘ATTACH_CMP_OPERATIONS’ 188 | ATTACH_CMP_OPERATIONS(ClassSelector) | ^~~~~~~~~~~~~~~~~~~~~ src/ast_selectors.hpp:137:18: warning: ‘virtual bool Sass::SimpleSelector::operator==(const Sass::CompoundSelector&) const’ was hidden [-Woverloaded-virtual=] 137 | virtual bool operator==(const CompoundSelector& rhs) const; | ^~~~~~~~ src/ast_def_macros.hpp:109:16: note: by ‘Sass::IDSelector::operator==’ 109 | virtual bool operator==(const klass& rhs) const; \ | ^~~~~~~~ src/ast_selectors.hpp:204:5: note: in expansion of macro ‘ATTACH_CMP_OPERATIONS’ 204 | ATTACH_CMP_OPERATIONS(IDSelector) | ^~~~~~~~~~~~~~~~~~~~~ src/ast_selectors.hpp:136:18: warning: ‘virtual bool Sass::SimpleSelector::operator==(const Sass::ComplexSelector&) const’ was hidden [-Woverloaded-virtual=] 136 | virtual bool operator==(const ComplexSelector& rhs) const; | ^~~~~~~~ src/ast_def_macros.hpp:109:16: note: by ‘Sass::IDSelector::operator==’ 109 | virtual bool operator==(const klass& rhs) const; \ | ^~~~~~~~ src/ast_selectors.hpp:204:5: note: in expansion of macro ‘ATTACH_CMP_OPERATIONS’ 204 | ATTACH_CMP_OPERATIONS(IDSelector) | ^~~~~~~~~~~~~~~~~~~~~ src/ast_selectors.hpp:135:18: warning: ‘virtual bool Sass::SimpleSelector::operator==(const Sass::SelectorList&) const’ was hidden [-Woverloaded-virtual=] 135 | virtual bool operator==(const SelectorList& rhs) const; | ^~~~~~~~ src/ast_def_macros.hpp:109:16: note: by ‘Sass::IDSelector::operator==’ 109 | virtual bool operator==(const klass& rhs) const; \ | ^~~~~~~~ src/ast_selectors.hpp:204:5: note: in expansion of macro ‘ATTACH_CMP_OPERATIONS’ 204 | ATTACH_CMP_OPERATIONS(IDSelector) | ^~~~~~~~~~~~~~~~~~~~~ src/ast_selectors.hpp:133:10: warning: ‘virtual bool Sass::SimpleSelector::operator==(const Sass::Selector&) const’ was hidden [-Woverloaded-virtual=] 133 | bool operator==(const Selector& rhs) const final override; | ^~~~~~~~ src/ast_def_macros.hpp:109:16: note: by ‘Sass::IDSelector::operator==’ 109 | virtual bool operator==(const klass& rhs) const; \ | ^~~~~~~~ src/ast_selectors.hpp:204:5: note: in expansion of macro ‘ATTACH_CMP_OPERATIONS’ 204 | ATTACH_CMP_OPERATIONS(IDSelector) | ^~~~~~~~~~~~~~~~~~~~~ src/ast_def_macros.hpp:106:16: warning: ‘virtual bool Sass::SimpleSelector::operator!=(const Sass::SimpleSelector&) const’ was hidden [-Woverloaded-virtual=] 106 | virtual bool operator!=(const klass& rhs) const { return !(*this == rhs); }; \ | ^~~~~~~~ src/ast_selectors.hpp:139:5: note: in expansion of macro ‘ATTACH_VIRTUAL_CMP_OPERATIONS’ 139 | ATTACH_VIRTUAL_CMP_OPERATIONS(SimpleSelector); | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~ src/ast_def_macros.hpp:110:16: note: by ‘virtual bool Sass::IDSelector::operator!=(const Sass::IDSelector&) const’ 110 | virtual bool operator!=(const klass& rhs) const { return !(*this == rhs); }; \ | ^~~~~~~~ src/ast_selectors.hpp:204:5: note: in expansion of macro ‘ATTACH_CMP_OPERATIONS’ 204 | ATTACH_CMP_OPERATIONS(IDSelector) | ^~~~~~~~~~~~~~~~~~~~~ src/ast_selectors.hpp:137:18: warning: ‘virtual bool Sass::SimpleSelector::operator==(const Sass::CompoundSelector&) const’ was hidden [-Woverloaded-virtual=] 137 | virtual bool operator==(const CompoundSelector& rhs) const; | ^~~~~~~~ src/ast_def_macros.hpp:109:16: note: by ‘Sass::AttributeSelector::operator==’ 109 | virtual bool operator==(const klass& rhs) const; \ | ^~~~~~~~ src/ast_selectors.hpp:223:5: note: in expansion of macro ‘ATTACH_CMP_OPERATIONS’ 223 | ATTACH_CMP_OPERATIONS(AttributeSelector) | ^~~~~~~~~~~~~~~~~~~~~ src/ast_selectors.hpp:136:18: warning: ‘virtual bool Sass::SimpleSelector::operator==(const Sass::ComplexSelector&) const’ was hidden [-Woverloaded-virtual=] 136 | virtual bool operator==(const ComplexSelector& rhs) const; | ^~~~~~~~ src/ast_def_macros.hpp:109:16: note: by ‘Sass::AttributeSelector::operator==’ 109 | virtual bool operator==(const klass& rhs) const; \ | ^~~~~~~~ src/ast_selectors.hpp:223:5: note: in expansion of macro ‘ATTACH_CMP_OPERATIONS’ 223 | ATTACH_CMP_OPERATIONS(AttributeSelector) | ^~~~~~~~~~~~~~~~~~~~~ src/ast_selectors.hpp:135:18: warning: ‘virtual bool Sass::SimpleSelector::operator==(const Sass::SelectorList&) const’ was hidden [-Woverloaded-virtual=] 135 | virtual bool operator==(const SelectorList& rhs) const; | ^~~~~~~~ src/ast_def_macros.hpp:109:16: note: by ‘Sass::AttributeSelector::operator==’ 109 | virtual bool operator==(const klass& rhs) const; \ | ^~~~~~~~ src/ast_selectors.hpp:223:5: note: in expansion of macro ‘ATTACH_CMP_OPERATIONS’ 223 | ATTACH_CMP_OPERATIONS(AttributeSelector) | ^~~~~~~~~~~~~~~~~~~~~ src/ast_selectors.hpp:133:10: warning: ‘virtual bool Sass::SimpleSelector::operator==(const Sass::Selector&) const’ was hidden [-Woverloaded-virtual=] 133 | bool operator==(const Selector& rhs) const final override; | ^~~~~~~~ src/ast_def_macros.hpp:109:16: note: by ‘Sass::AttributeSelector::operator==’ 109 | virtual bool operator==(const klass& rhs) const; \ | ^~~~~~~~ src/ast_selectors.hpp:223:5: note: in expansion of macro ‘ATTACH_CMP_OPERATIONS’ 223 | ATTACH_CMP_OPERATIONS(AttributeSelector) | ^~~~~~~~~~~~~~~~~~~~~ src/ast_def_macros.hpp:106:16: warning: ‘virtual bool Sass::SimpleSelector::operator!=(const Sass::SimpleSelector&) const’ was hidden [-Woverloaded-virtual=] 106 | virtual bool operator!=(const klass& rhs) const { return !(*this == rhs); }; \ | ^~~~~~~~ src/ast_selectors.hpp:139:5: note: in expansion of macro ‘ATTACH_VIRTUAL_CMP_OPERATIONS’ 139 | ATTACH_VIRTUAL_CMP_OPERATIONS(SimpleSelector); | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~ src/ast_def_macros.hpp:110:16: note: by ‘virtual bool Sass::AttributeSelector::operator!=(const Sass::AttributeSelector&) const’ 110 | virtual bool operator!=(const klass& rhs) const { return !(*this == rhs); }; \ | ^~~~~~~~ src/ast_selectors.hpp:223:5: note: in expansion of macro ‘ATTACH_CMP_OPERATIONS’ 223 | ATTACH_CMP_OPERATIONS(AttributeSelector) | ^~~~~~~~~~~~~~~~~~~~~ src/ast_def_macros.hpp:106:16: warning: ‘virtual bool Sass::Selector::operator!=(const Sass::Selector&) const’ was hidden [-Woverloaded-virtual=] 106 | virtual bool operator!=(const klass& rhs) const { return !(*this == rhs); }; \ | ^~~~~~~~ src/ast_selectors.hpp:56:5: note: in expansion of macro ‘ATTACH_VIRTUAL_CMP_OPERATIONS’ 56 | ATTACH_VIRTUAL_CMP_OPERATIONS(Selector) | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~ src/ast_def_macros.hpp:110:16: note: by ‘virtual bool Sass::ComplexSelector::operator!=(const Sass::ComplexSelector&) const’ 110 | virtual bool operator!=(const klass& rhs) const { return !(*this == rhs); }; \ | ^~~~~~~~ src/ast_selectors.hpp:310:5: note: in expansion of macro ‘ATTACH_CMP_OPERATIONS’ 310 | ATTACH_CMP_OPERATIONS(ComplexSelector) | ^~~~~~~~~~~~~~~~~~~~~ src/ast_def_macros.hpp:106:16: warning: ‘virtual bool Sass::Selector::operator!=(const Sass::Selector&) const’ was hidden [-Woverloaded-virtual=] 106 | virtual bool operator!=(const klass& rhs) const { return !(*this == rhs); }; \ | ^~~~~~~~ src/ast_selectors.hpp:56:5: note: in expansion of macro ‘ATTACH_VIRTUAL_CMP_OPERATIONS’ 56 | ATTACH_VIRTUAL_CMP_OPERATIONS(Selector) | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~ src/ast_def_macros.hpp:106:16: note: by ‘virtual bool Sass::SelectorComponent::operator!=(const Sass::SelectorComponent&) const’ 106 | virtual bool operator!=(const klass& rhs) const { return !(*this == rhs); }; \ | ^~~~~~~~ src/ast_selectors.hpp:349:5: note: in expansion of macro ‘ATTACH_VIRTUAL_CMP_OPERATIONS’ 349 | ATTACH_VIRTUAL_CMP_OPERATIONS(SelectorComponent); | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~ src/ast_def_macros.hpp:106:16: warning: ‘virtual bool Sass::SelectorComponent::operator!=(const Sass::SelectorComponent&) const’ was hidden [-Woverloaded-virtual=] 106 | virtual bool operator!=(const klass& rhs) const { return !(*this == rhs); }; \ | ^~~~~~~~ src/ast_selectors.hpp:349:5: note: in expansion of macro ‘ATTACH_VIRTUAL_CMP_OPERATIONS’ 349 | ATTACH_VIRTUAL_CMP_OPERATIONS(SelectorComponent); | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~ src/ast_def_macros.hpp:110:16: note: by ‘virtual bool Sass::SelectorCombinator::operator!=(const Sass::SelectorCombinator&) const’ 110 | virtual bool operator!=(const klass& rhs) const { return !(*this == rhs); }; \ | ^~~~~~~~ src/ast_selectors.hpp:407:5: note: in expansion of macro ‘ATTACH_CMP_OPERATIONS’ 407 | ATTACH_CMP_OPERATIONS(SelectorCombinator) | ^~~~~~~~~~~~~~~~~~~~~ g++ -std=gnu++17 -Wall -O2 -std=c++11 -I ./include -fPIC -c -o src/emitter.o src/emitter.cpp g++ -std=gnu++17 -Wall -O2 -std=c++11 -I ./include -fPIC -c -o src/check_nesting.o src/check_nesting.cpp In file included from src/check_nesting.cpp:4: src/ast.hpp:90:18: warning: ‘virtual bool Sass::AST_Node::operator==(const Sass::AST_Node&) const’ was hidden [-Woverloaded-virtual=] 90 | virtual bool operator== (const AST_Node& rhs) const { | ^~~~~~~~ src/ast.hpp:165:18: note: by ‘virtual bool Sass::Expression::operator==(const Sass::Expression&) const’ 165 | virtual bool operator== (const Expression& rhs) const { return false; } | ^~~~~~~~ src/ast.hpp:96:18: warning: ‘virtual bool Sass::AST_Node::operator!=(const Sass::AST_Node&) const’ was hidden [-Woverloaded-virtual=] 96 | virtual bool operator!= (const AST_Node& rhs) const { | ^~~~~~~~ src/ast.hpp:167:17: note: by ‘bool Sass::Expression::operator!=(const Sass::Expression&) const’ 167 | inline bool operator!=(const Expression& rhs) const { return !(rhs == *this); } | ^~~~~~~~ src/ast.hpp:90:18: warning: ‘virtual bool Sass::AST_Node::operator==(const Sass::AST_Node&) const’ was hidden [-Woverloaded-virtual=] 90 | virtual bool operator== (const AST_Node& rhs) const { | ^~~~~~~~ src/ast.hpp:908:10: note: by ‘bool Sass::CssMediaRule::operator==(const Sass::CssMediaRule&) const’ 908 | bool operator== (const CssMediaRule& rhs) const { | ^~~~~~~~ src/ast.hpp:96:18: warning: ‘virtual bool Sass::AST_Node::operator!=(const Sass::AST_Node&) const’ was hidden [-Woverloaded-virtual=] 96 | virtual bool operator!= (const AST_Node& rhs) const { | ^~~~~~~~ src/ast.hpp:911:10: note: by ‘bool Sass::CssMediaRule::operator!=(const Sass::CssMediaRule&) const’ 911 | bool operator!=(const CssMediaRule& rhs) const { | ^~~~~~~~ src/ast.hpp:90:18: warning: ‘virtual bool Sass::AST_Node::operator==(const Sass::AST_Node&) const’ was hidden [-Woverloaded-virtual=] 90 | virtual bool operator== (const AST_Node& rhs) const { | ^~~~~~~~ src/ast.hpp:939:10: note: by ‘bool Sass::CssMediaQuery::operator==(const Sass::CssMediaQuery&) const’ 939 | bool operator== (const CssMediaQuery& rhs) const; | ^~~~~~~~ src/ast.hpp:96:18: warning: ‘virtual bool Sass::AST_Node::operator!=(const Sass::AST_Node&) const’ was hidden [-Woverloaded-virtual=] 96 | virtual bool operator!= (const AST_Node& rhs) const { | ^~~~~~~~ src/ast.hpp:940:10: note: by ‘bool Sass::CssMediaQuery::operator!=(const Sass::CssMediaQuery&) const’ 940 | bool operator!=(const CssMediaQuery& rhs) const { | ^~~~~~~~ src/ast.hpp:165:18: warning: ‘virtual bool Sass::Expression::operator==(const Sass::Expression&) const’ was hidden [-Woverloaded-virtual=] 165 | virtual bool operator== (const Expression& rhs) const { return false; } | ^~~~~~~~ In file included from src/ast.hpp:14: src/ast_def_macros.hpp:105:16: note: by ‘virtual bool Sass::Selector::operator==(const Sass::Selector&) const’ 105 | virtual bool operator==(const klass& rhs) const = 0; \ | ^~~~~~~~ src/ast_selectors.hpp:56:5: note: in expansion of macro ‘ATTACH_VIRTUAL_CMP_OPERATIONS’ 56 | ATTACH_VIRTUAL_CMP_OPERATIONS(Selector) | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~ src/ast.hpp:96:18: warning: ‘virtual bool Sass::AST_Node::operator!=(const Sass::AST_Node&) const’ was hidden [-Woverloaded-virtual=] 96 | virtual bool operator!= (const AST_Node& rhs) const { | ^~~~~~~~ src/ast_def_macros.hpp:106:16: note: by ‘virtual bool Sass::Selector::operator!=(const Sass::Selector&) const’ 106 | virtual bool operator!=(const klass& rhs) const { return !(*this == rhs); }; \ | ^~~~~~~~ src/ast_selectors.hpp:56:5: note: in expansion of macro ‘ATTACH_VIRTUAL_CMP_OPERATIONS’ 56 | ATTACH_VIRTUAL_CMP_OPERATIONS(Selector) | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~ src/ast_def_macros.hpp:106:16: warning: ‘virtual bool Sass::Selector::operator!=(const Sass::Selector&) const’ was hidden [-Woverloaded-virtual=] 106 | virtual bool operator!=(const klass& rhs) const { return !(*this == rhs); }; \ | ^~~~~~~~ src/ast_selectors.hpp:56:5: note: in expansion of macro ‘ATTACH_VIRTUAL_CMP_OPERATIONS’ 56 | ATTACH_VIRTUAL_CMP_OPERATIONS(Selector) | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~ src/ast_def_macros.hpp:106:16: note: by ‘virtual bool Sass::SimpleSelector::operator!=(const Sass::SimpleSelector&) const’ 106 | virtual bool operator!=(const klass& rhs) const { return !(*this == rhs); }; \ | ^~~~~~~~ src/ast_selectors.hpp:139:5: note: in expansion of macro ‘ATTACH_VIRTUAL_CMP_OPERATIONS’ 139 | ATTACH_VIRTUAL_CMP_OPERATIONS(SimpleSelector); | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~ In file included from src/ast.hpp:1055: src/ast_selectors.hpp:137:18: warning: ‘virtual bool Sass::SimpleSelector::operator==(const Sass::CompoundSelector&) const’ was hidden [-Woverloaded-virtual=] 137 | virtual bool operator==(const CompoundSelector& rhs) const; | ^~~~~~~~ src/ast_def_macros.hpp:109:16: note: by ‘Sass::PlaceholderSelector::operator==’ 109 | virtual bool operator==(const klass& rhs) const; \ | ^~~~~~~~ src/ast_selectors.hpp:157:5: note: in expansion of macro ‘ATTACH_CMP_OPERATIONS’ 157 | ATTACH_CMP_OPERATIONS(PlaceholderSelector) | ^~~~~~~~~~~~~~~~~~~~~ src/ast_selectors.hpp:136:18: warning: ‘virtual bool Sass::SimpleSelector::operator==(const Sass::ComplexSelector&) const’ was hidden [-Woverloaded-virtual=] 136 | virtual bool operator==(const ComplexSelector& rhs) const; | ^~~~~~~~ src/ast_def_macros.hpp:109:16: note: by ‘Sass::PlaceholderSelector::operator==’ 109 | virtual bool operator==(const klass& rhs) const; \ | ^~~~~~~~ src/ast_selectors.hpp:157:5: note: in expansion of macro ‘ATTACH_CMP_OPERATIONS’ 157 | ATTACH_CMP_OPERATIONS(PlaceholderSelector) | ^~~~~~~~~~~~~~~~~~~~~ src/ast_selectors.hpp:135:18: warning: ‘virtual bool Sass::SimpleSelector::operator==(const Sass::SelectorList&) const’ was hidden [-Woverloaded-virtual=] 135 | virtual bool operator==(const SelectorList& rhs) const; | ^~~~~~~~ src/ast_def_macros.hpp:109:16: note: by ‘Sass::PlaceholderSelector::operator==’ 109 | virtual bool operator==(const klass& rhs) const; \ | ^~~~~~~~ src/ast_selectors.hpp:157:5: note: in expansion of macro ‘ATTACH_CMP_OPERATIONS’ 157 | ATTACH_CMP_OPERATIONS(PlaceholderSelector) | ^~~~~~~~~~~~~~~~~~~~~ src/ast_selectors.hpp:133:10: warning: ‘virtual bool Sass::SimpleSelector::operator==(const Sass::Selector&) const’ was hidden [-Woverloaded-virtual=] 133 | bool operator==(const Selector& rhs) const final override; | ^~~~~~~~ src/ast_def_macros.hpp:109:16: note: by ‘Sass::PlaceholderSelector::operator==’ 109 | virtual bool operator==(const klass& rhs) const; \ | ^~~~~~~~ src/ast_selectors.hpp:157:5: note: in expansion of macro ‘ATTACH_CMP_OPERATIONS’ 157 | ATTACH_CMP_OPERATIONS(PlaceholderSelector) | ^~~~~~~~~~~~~~~~~~~~~ src/ast_def_macros.hpp:106:16: warning: ‘virtual bool Sass::SimpleSelector::operator!=(const Sass::SimpleSelector&) const’ was hidden [-Woverloaded-virtual=] 106 | virtual bool operator!=(const klass& rhs) const { return !(*this == rhs); }; \ | ^~~~~~~~ src/ast_selectors.hpp:139:5: note: in expansion of macro ‘ATTACH_VIRTUAL_CMP_OPERATIONS’ 139 | ATTACH_VIRTUAL_CMP_OPERATIONS(SimpleSelector); | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~ src/ast_def_macros.hpp:110:16: note: by ‘virtual bool Sass::PlaceholderSelector::operator!=(const Sass::PlaceholderSelector&) const’ 110 | virtual bool operator!=(const klass& rhs) const { return !(*this == rhs); }; \ | ^~~~~~~~ src/ast_selectors.hpp:157:5: note: in expansion of macro ‘ATTACH_CMP_OPERATIONS’ 157 | ATTACH_CMP_OPERATIONS(PlaceholderSelector) | ^~~~~~~~~~~~~~~~~~~~~ src/ast_selectors.hpp:137:18: warning: ‘virtual bool Sass::SimpleSelector::operator==(const Sass::CompoundSelector&) const’ was hidden [-Woverloaded-virtual=] 137 | virtual bool operator==(const CompoundSelector& rhs) const; | ^~~~~~~~ src/ast_def_macros.hpp:109:16: note: by ‘Sass::TypeSelector::operator==’ 109 | virtual bool operator==(const klass& rhs) const; \ | ^~~~~~~~ src/ast_selectors.hpp:174:5: note: in expansion of macro ‘ATTACH_CMP_OPERATIONS’ 174 | ATTACH_CMP_OPERATIONS(TypeSelector) | ^~~~~~~~~~~~~~~~~~~~~ src/ast_selectors.hpp:136:18: warning: ‘virtual bool Sass::SimpleSelector::operator==(const Sass::ComplexSelector&) const’ was hidden [-Woverloaded-virtual=] 136 | virtual bool operator==(const ComplexSelector& rhs) const; | ^~~~~~~~ src/ast_def_macros.hpp:109:16: note: by ‘Sass::TypeSelector::operator==’ 109 | virtual bool operator==(const klass& rhs) const; \ | ^~~~~~~~ src/ast_selectors.hpp:174:5: note: in expansion of macro ‘ATTACH_CMP_OPERATIONS’ 174 | ATTACH_CMP_OPERATIONS(TypeSelector) | ^~~~~~~~~~~~~~~~~~~~~ src/ast_selectors.hpp:135:18: warning: ‘virtual bool Sass::SimpleSelector::operator==(const Sass::SelectorList&) const’ was hidden [-Woverloaded-virtual=] 135 | virtual bool operator==(const SelectorList& rhs) const; | ^~~~~~~~ src/ast_def_macros.hpp:109:16: note: by ‘Sass::TypeSelector::operator==’ 109 | virtual bool operator==(const klass& rhs) const; \ | ^~~~~~~~ src/ast_selectors.hpp:174:5: note: in expansion of macro ‘ATTACH_CMP_OPERATIONS’ 174 | ATTACH_CMP_OPERATIONS(TypeSelector) | ^~~~~~~~~~~~~~~~~~~~~ src/ast_selectors.hpp:133:10: warning: ‘virtual bool Sass::SimpleSelector::operator==(const Sass::Selector&) const’ was hidden [-Woverloaded-virtual=] 133 | bool operator==(const Selector& rhs) const final override; | ^~~~~~~~ src/ast_def_macros.hpp:109:16: note: by ‘Sass::TypeSelector::operator==’ 109 | virtual bool operator==(const klass& rhs) const; \ | ^~~~~~~~ src/ast_selectors.hpp:174:5: note: in expansion of macro ‘ATTACH_CMP_OPERATIONS’ 174 | ATTACH_CMP_OPERATIONS(TypeSelector) | ^~~~~~~~~~~~~~~~~~~~~ src/ast_def_macros.hpp:106:16: warning: ‘virtual bool Sass::SimpleSelector::operator!=(const Sass::SimpleSelector&) const’ was hidden [-Woverloaded-virtual=] 106 | virtual bool operator!=(const klass& rhs) const { return !(*this == rhs); }; \ | ^~~~~~~~ src/ast_selectors.hpp:139:5: note: in expansion of macro ‘ATTACH_VIRTUAL_CMP_OPERATIONS’ 139 | ATTACH_VIRTUAL_CMP_OPERATIONS(SimpleSelector); | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~ src/ast_def_macros.hpp:110:16: note: by ‘virtual bool Sass::TypeSelector::operator!=(const Sass::TypeSelector&) const’ 110 | virtual bool operator!=(const klass& rhs) const { return !(*this == rhs); }; \ | ^~~~~~~~ src/ast_selectors.hpp:174:5: note: in expansion of macro ‘ATTACH_CMP_OPERATIONS’ 174 | ATTACH_CMP_OPERATIONS(TypeSelector) | ^~~~~~~~~~~~~~~~~~~~~ src/ast_selectors.hpp:137:18: warning: ‘virtual bool Sass::SimpleSelector::operator==(const Sass::CompoundSelector&) const’ was hidden [-Woverloaded-virtual=] 137 | virtual bool operator==(const CompoundSelector& rhs) const; | ^~~~~~~~ src/ast_def_macros.hpp:109:16: note: by ‘Sass::ClassSelector::operator==’ 109 | virtual bool operator==(const klass& rhs) const; \ | ^~~~~~~~ src/ast_selectors.hpp:188:5: note: in expansion of macro ‘ATTACH_CMP_OPERATIONS’ 188 | ATTACH_CMP_OPERATIONS(ClassSelector) | ^~~~~~~~~~~~~~~~~~~~~ src/ast_selectors.hpp:136:18: warning: ‘virtual bool Sass::SimpleSelector::operator==(const Sass::ComplexSelector&) const’ was hidden [-Woverloaded-virtual=] 136 | virtual bool operator==(const ComplexSelector& rhs) const; | ^~~~~~~~ src/ast_def_macros.hpp:109:16: note: by ‘Sass::ClassSelector::operator==’ 109 | virtual bool operator==(const klass& rhs) const; \ | ^~~~~~~~ src/ast_selectors.hpp:188:5: note: in expansion of macro ‘ATTACH_CMP_OPERATIONS’ 188 | ATTACH_CMP_OPERATIONS(ClassSelector) | ^~~~~~~~~~~~~~~~~~~~~ src/ast_selectors.hpp:135:18: warning: ‘virtual bool Sass::SimpleSelector::operator==(const Sass::SelectorList&) const’ was hidden [-Woverloaded-virtual=] 135 | virtual bool operator==(const SelectorList& rhs) const; | ^~~~~~~~ src/ast_def_macros.hpp:109:16: note: by ‘Sass::ClassSelector::operator==’ 109 | virtual bool operator==(const klass& rhs) const; \ | ^~~~~~~~ src/ast_selectors.hpp:188:5: note: in expansion of macro ‘ATTACH_CMP_OPERATIONS’ 188 | ATTACH_CMP_OPERATIONS(ClassSelector) | ^~~~~~~~~~~~~~~~~~~~~ src/ast_selectors.hpp:133:10: warning: ‘virtual bool Sass::SimpleSelector::operator==(const Sass::Selector&) const’ was hidden [-Woverloaded-virtual=] 133 | bool operator==(const Selector& rhs) const final override; | ^~~~~~~~ src/ast_def_macros.hpp:109:16: note: by ‘Sass::ClassSelector::operator==’ 109 | virtual bool operator==(const klass& rhs) const; \ | ^~~~~~~~ src/ast_selectors.hpp:188:5: note: in expansion of macro ‘ATTACH_CMP_OPERATIONS’ 188 | ATTACH_CMP_OPERATIONS(ClassSelector) | ^~~~~~~~~~~~~~~~~~~~~ src/ast_def_macros.hpp:106:16: warning: ‘virtual bool Sass::SimpleSelector::operator!=(const Sass::SimpleSelector&) const’ was hidden [-Woverloaded-virtual=] 106 | virtual bool operator!=(const klass& rhs) const { return !(*this == rhs); }; \ | ^~~~~~~~ src/ast_selectors.hpp:139:5: note: in expansion of macro ‘ATTACH_VIRTUAL_CMP_OPERATIONS’ 139 | ATTACH_VIRTUAL_CMP_OPERATIONS(SimpleSelector); | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~ src/ast_def_macros.hpp:110:16: note: by ‘virtual bool Sass::ClassSelector::operator!=(const Sass::ClassSelector&) const’ 110 | virtual bool operator!=(const klass& rhs) const { return !(*this == rhs); }; \ | ^~~~~~~~ src/ast_selectors.hpp:188:5: note: in expansion of macro ‘ATTACH_CMP_OPERATIONS’ 188 | ATTACH_CMP_OPERATIONS(ClassSelector) | ^~~~~~~~~~~~~~~~~~~~~ src/ast_selectors.hpp:137:18: warning: ‘virtual bool Sass::SimpleSelector::operator==(const Sass::CompoundSelector&) const’ was hidden [-Woverloaded-virtual=] 137 | virtual bool operator==(const CompoundSelector& rhs) const; | ^~~~~~~~ src/ast_def_macros.hpp:109:16: note: by ‘Sass::IDSelector::operator==’ 109 | virtual bool operator==(const klass& rhs) const; \ | ^~~~~~~~ src/ast_selectors.hpp:204:5: note: in expansion of macro ‘ATTACH_CMP_OPERATIONS’ 204 | ATTACH_CMP_OPERATIONS(IDSelector) | ^~~~~~~~~~~~~~~~~~~~~ src/ast_selectors.hpp:136:18: warning: ‘virtual bool Sass::SimpleSelector::operator==(const Sass::ComplexSelector&) const’ was hidden [-Woverloaded-virtual=] 136 | virtual bool operator==(const ComplexSelector& rhs) const; | ^~~~~~~~ src/ast_def_macros.hpp:109:16: note: by ‘Sass::IDSelector::operator==’ 109 | virtual bool operator==(const klass& rhs) const; \ | ^~~~~~~~ src/ast_selectors.hpp:204:5: note: in expansion of macro ‘ATTACH_CMP_OPERATIONS’ 204 | ATTACH_CMP_OPERATIONS(IDSelector) | ^~~~~~~~~~~~~~~~~~~~~ src/ast_selectors.hpp:135:18: warning: ‘virtual bool Sass::SimpleSelector::operator==(const Sass::SelectorList&) const’ was hidden [-Woverloaded-virtual=] 135 | virtual bool operator==(const SelectorList& rhs) const; | ^~~~~~~~ src/ast_def_macros.hpp:109:16: note: by ‘Sass::IDSelector::operator==’ 109 | virtual bool operator==(const klass& rhs) const; \ | ^~~~~~~~ src/ast_selectors.hpp:204:5: note: in expansion of macro ‘ATTACH_CMP_OPERATIONS’ 204 | ATTACH_CMP_OPERATIONS(IDSelector) | ^~~~~~~~~~~~~~~~~~~~~ src/ast_selectors.hpp:133:10: warning: ‘virtual bool Sass::SimpleSelector::operator==(const Sass::Selector&) const’ was hidden [-Woverloaded-virtual=] 133 | bool operator==(const Selector& rhs) const final override; | ^~~~~~~~ src/ast_def_macros.hpp:109:16: note: by ‘Sass::IDSelector::operator==’ 109 | virtual bool operator==(const klass& rhs) const; \ | ^~~~~~~~ src/ast_selectors.hpp:204:5: note: in expansion of macro ‘ATTACH_CMP_OPERATIONS’ 204 | ATTACH_CMP_OPERATIONS(IDSelector) | ^~~~~~~~~~~~~~~~~~~~~ src/ast_def_macros.hpp:106:16: warning: ‘virtual bool Sass::SimpleSelector::operator!=(const Sass::SimpleSelector&) const’ was hidden [-Woverloaded-virtual=] 106 | virtual bool operator!=(const klass& rhs) const { return !(*this == rhs); }; \ | ^~~~~~~~ src/ast_selectors.hpp:139:5: note: in expansion of macro ‘ATTACH_VIRTUAL_CMP_OPERATIONS’ 139 | ATTACH_VIRTUAL_CMP_OPERATIONS(SimpleSelector); | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~ src/ast_def_macros.hpp:110:16: note: by ‘virtual bool Sass::IDSelector::operator!=(const Sass::IDSelector&) const’ 110 | virtual bool operator!=(const klass& rhs) const { return !(*this == rhs); }; \ | ^~~~~~~~ src/ast_selectors.hpp:204:5: note: in expansion of macro ‘ATTACH_CMP_OPERATIONS’ 204 | ATTACH_CMP_OPERATIONS(IDSelector) | ^~~~~~~~~~~~~~~~~~~~~ src/ast_selectors.hpp:137:18: warning: ‘virtual bool Sass::SimpleSelector::operator==(const Sass::CompoundSelector&) const’ was hidden [-Woverloaded-virtual=] 137 | virtual bool operator==(const CompoundSelector& rhs) const; | ^~~~~~~~ src/ast_def_macros.hpp:109:16: note: by ‘Sass::AttributeSelector::operator==’ 109 | virtual bool operator==(const klass& rhs) const; \ | ^~~~~~~~ src/ast_selectors.hpp:223:5: note: in expansion of macro ‘ATTACH_CMP_OPERATIONS’ 223 | ATTACH_CMP_OPERATIONS(AttributeSelector) | ^~~~~~~~~~~~~~~~~~~~~ src/ast_selectors.hpp:136:18: warning: ‘virtual bool Sass::SimpleSelector::operator==(const Sass::ComplexSelector&) const’ was hidden [-Woverloaded-virtual=] 136 | virtual bool operator==(const ComplexSelector& rhs) const; | ^~~~~~~~ src/ast_def_macros.hpp:109:16: note: by ‘Sass::AttributeSelector::operator==’ 109 | virtual bool operator==(const klass& rhs) const; \ | ^~~~~~~~ src/ast_selectors.hpp:223:5: note: in expansion of macro ‘ATTACH_CMP_OPERATIONS’ 223 | ATTACH_CMP_OPERATIONS(AttributeSelector) | ^~~~~~~~~~~~~~~~~~~~~ src/ast_selectors.hpp:135:18: warning: ‘virtual bool Sass::SimpleSelector::operator==(const Sass::SelectorList&) const’ was hidden [-Woverloaded-virtual=] 135 | virtual bool operator==(const SelectorList& rhs) const; | ^~~~~~~~ src/ast_def_macros.hpp:109:16: note: by ‘Sass::AttributeSelector::operator==’ 109 | virtual bool operator==(const klass& rhs) const; \ | ^~~~~~~~ src/ast_selectors.hpp:223:5: note: in expansion of macro ‘ATTACH_CMP_OPERATIONS’ 223 | ATTACH_CMP_OPERATIONS(AttributeSelector) | ^~~~~~~~~~~~~~~~~~~~~ src/ast_selectors.hpp:133:10: warning: ‘virtual bool Sass::SimpleSelector::operator==(const Sass::Selector&) const’ was hidden [-Woverloaded-virtual=] 133 | bool operator==(const Selector& rhs) const final override; | ^~~~~~~~ src/ast_def_macros.hpp:109:16: note: by ‘Sass::AttributeSelector::operator==’ 109 | virtual bool operator==(const klass& rhs) const; \ | ^~~~~~~~ src/ast_selectors.hpp:223:5: note: in expansion of macro ‘ATTACH_CMP_OPERATIONS’ 223 | ATTACH_CMP_OPERATIONS(AttributeSelector) | ^~~~~~~~~~~~~~~~~~~~~ src/ast_def_macros.hpp:106:16: warning: ‘virtual bool Sass::SimpleSelector::operator!=(const Sass::SimpleSelector&) const’ was hidden [-Woverloaded-virtual=] 106 | virtual bool operator!=(const klass& rhs) const { return !(*this == rhs); }; \ | ^~~~~~~~ src/ast_selectors.hpp:139:5: note: in expansion of macro ‘ATTACH_VIRTUAL_CMP_OPERATIONS’ 139 | ATTACH_VIRTUAL_CMP_OPERATIONS(SimpleSelector); | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~ src/ast_def_macros.hpp:110:16: note: by ‘virtual bool Sass::AttributeSelector::operator!=(const Sass::AttributeSelector&) const’ 110 | virtual bool operator!=(const klass& rhs) const { return !(*this == rhs); }; \ | ^~~~~~~~ src/ast_selectors.hpp:223:5: note: in expansion of macro ‘ATTACH_CMP_OPERATIONS’ 223 | ATTACH_CMP_OPERATIONS(AttributeSelector) | ^~~~~~~~~~~~~~~~~~~~~ src/ast_def_macros.hpp:106:16: warning: ‘virtual bool Sass::Selector::operator!=(const Sass::Selector&) const’ was hidden [-Woverloaded-virtual=] 106 | virtual bool operator!=(const klass& rhs) const { return !(*this == rhs); }; \ | ^~~~~~~~ src/ast_selectors.hpp:56:5: note: in expansion of macro ‘ATTACH_VIRTUAL_CMP_OPERATIONS’ 56 | ATTACH_VIRTUAL_CMP_OPERATIONS(Selector) | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~ src/ast_def_macros.hpp:110:16: note: by ‘virtual bool Sass::ComplexSelector::operator!=(const Sass::ComplexSelector&) const’ 110 | virtual bool operator!=(const klass& rhs) const { return !(*this == rhs); }; \ | ^~~~~~~~ src/ast_selectors.hpp:310:5: note: in expansion of macro ‘ATTACH_CMP_OPERATIONS’ 310 | ATTACH_CMP_OPERATIONS(ComplexSelector) | ^~~~~~~~~~~~~~~~~~~~~ src/ast_def_macros.hpp:106:16: warning: ‘virtual bool Sass::Selector::operator!=(const Sass::Selector&) const’ was hidden [-Woverloaded-virtual=] 106 | virtual bool operator!=(const klass& rhs) const { return !(*this == rhs); }; \ | ^~~~~~~~ src/ast_selectors.hpp:56:5: note: in expansion of macro ‘ATTACH_VIRTUAL_CMP_OPERATIONS’ 56 | ATTACH_VIRTUAL_CMP_OPERATIONS(Selector) | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~ src/ast_def_macros.hpp:106:16: note: by ‘virtual bool Sass::SelectorComponent::operator!=(const Sass::SelectorComponent&) const’ 106 | virtual bool operator!=(const klass& rhs) const { return !(*this == rhs); }; \ | ^~~~~~~~ src/ast_selectors.hpp:349:5: note: in expansion of macro ‘ATTACH_VIRTUAL_CMP_OPERATIONS’ 349 | ATTACH_VIRTUAL_CMP_OPERATIONS(SelectorComponent); | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~ src/ast_def_macros.hpp:106:16: warning: ‘virtual bool Sass::SelectorComponent::operator!=(const Sass::SelectorComponent&) const’ was hidden [-Woverloaded-virtual=] 106 | virtual bool operator!=(const klass& rhs) const { return !(*this == rhs); }; \ | ^~~~~~~~ src/ast_selectors.hpp:349:5: note: in expansion of macro ‘ATTACH_VIRTUAL_CMP_OPERATIONS’ 349 | ATTACH_VIRTUAL_CMP_OPERATIONS(SelectorComponent); | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~ src/ast_def_macros.hpp:110:16: note: by ‘virtual bool Sass::SelectorCombinator::operator!=(const Sass::SelectorCombinator&) const’ 110 | virtual bool operator!=(const klass& rhs) const { return !(*this == rhs); }; \ | ^~~~~~~~ src/ast_selectors.hpp:407:5: note: in expansion of macro ‘ATTACH_CMP_OPERATIONS’ 407 | ATTACH_CMP_OPERATIONS(SelectorCombinator) | ^~~~~~~~~~~~~~~~~~~~~ g++ -std=gnu++17 -Wall -O2 -std=c++11 -I ./include -fPIC -c -o src/remove_placeholders.o src/remove_placeholders.cpp In file included from src/remove_placeholders.cpp:4: src/ast.hpp:90:18: warning: ‘virtual bool Sass::AST_Node::operator==(const Sass::AST_Node&) const’ was hidden [-Woverloaded-virtual=] 90 | virtual bool operator== (const AST_Node& rhs) const { | ^~~~~~~~ src/ast.hpp:165:18: note: by ‘virtual bool Sass::Expression::operator==(const Sass::Expression&) const’ 165 | virtual bool operator== (const Expression& rhs) const { return false; } | ^~~~~~~~ src/ast.hpp:96:18: warning: ‘virtual bool Sass::AST_Node::operator!=(const Sass::AST_Node&) const’ was hidden [-Woverloaded-virtual=] 96 | virtual bool operator!= (const AST_Node& rhs) const { | ^~~~~~~~ src/ast.hpp:167:17: note: by ‘bool Sass::Expression::operator!=(const Sass::Expression&) const’ 167 | inline bool operator!=(const Expression& rhs) const { return !(rhs == *this); } | ^~~~~~~~ src/ast.hpp:90:18: warning: ‘virtual bool Sass::AST_Node::operator==(const Sass::AST_Node&) const’ was hidden [-Woverloaded-virtual=] 90 | virtual bool operator== (const AST_Node& rhs) const { | ^~~~~~~~ src/ast.hpp:908:10: note: by ‘bool Sass::CssMediaRule::operator==(const Sass::CssMediaRule&) const’ 908 | bool operator== (const CssMediaRule& rhs) const { | ^~~~~~~~ src/ast.hpp:96:18: warning: ‘virtual bool Sass::AST_Node::operator!=(const Sass::AST_Node&) const’ was hidden [-Woverloaded-virtual=] 96 | virtual bool operator!= (const AST_Node& rhs) const { | ^~~~~~~~ src/ast.hpp:911:10: note: by ‘bool Sass::CssMediaRule::operator!=(const Sass::CssMediaRule&) const’ 911 | bool operator!=(const CssMediaRule& rhs) const { | ^~~~~~~~ src/ast.hpp:90:18: warning: ‘virtual bool Sass::AST_Node::operator==(const Sass::AST_Node&) const’ was hidden [-Woverloaded-virtual=] 90 | virtual bool operator== (const AST_Node& rhs) const { | ^~~~~~~~ src/ast.hpp:939:10: note: by ‘bool Sass::CssMediaQuery::operator==(const Sass::CssMediaQuery&) const’ 939 | bool operator== (const CssMediaQuery& rhs) const; | ^~~~~~~~ src/ast.hpp:96:18: warning: ‘virtual bool Sass::AST_Node::operator!=(const Sass::AST_Node&) const’ was hidden [-Woverloaded-virtual=] 96 | virtual bool operator!= (const AST_Node& rhs) const { | ^~~~~~~~ src/ast.hpp:940:10: note: by ‘bool Sass::CssMediaQuery::operator!=(const Sass::CssMediaQuery&) const’ 940 | bool operator!=(const CssMediaQuery& rhs) const { | ^~~~~~~~ src/ast.hpp:165:18: warning: ‘virtual bool Sass::Expression::operator==(const Sass::Expression&) const’ was hidden [-Woverloaded-virtual=] 165 | virtual bool operator== (const Expression& rhs) const { return false; } | ^~~~~~~~ In file included from src/ast.hpp:14: src/ast_def_macros.hpp:105:16: note: by ‘virtual bool Sass::Selector::operator==(const Sass::Selector&) const’ 105 | virtual bool operator==(const klass& rhs) const = 0; \ | ^~~~~~~~ src/ast_selectors.hpp:56:5: note: in expansion of macro ‘ATTACH_VIRTUAL_CMP_OPERATIONS’ 56 | ATTACH_VIRTUAL_CMP_OPERATIONS(Selector) | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~ src/ast.hpp:96:18: warning: ‘virtual bool Sass::AST_Node::operator!=(const Sass::AST_Node&) const’ was hidden [-Woverloaded-virtual=] 96 | virtual bool operator!= (const AST_Node& rhs) const { | ^~~~~~~~ src/ast_def_macros.hpp:106:16: note: by ‘virtual bool Sass::Selector::operator!=(const Sass::Selector&) const’ 106 | virtual bool operator!=(const klass& rhs) const { return !(*this == rhs); }; \ | ^~~~~~~~ src/ast_selectors.hpp:56:5: note: in expansion of macro ‘ATTACH_VIRTUAL_CMP_OPERATIONS’ 56 | ATTACH_VIRTUAL_CMP_OPERATIONS(Selector) | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~ src/ast_def_macros.hpp:106:16: warning: ‘virtual bool Sass::Selector::operator!=(const Sass::Selector&) const’ was hidden [-Woverloaded-virtual=] 106 | virtual bool operator!=(const klass& rhs) const { return !(*this == rhs); }; \ | ^~~~~~~~ src/ast_selectors.hpp:56:5: note: in expansion of macro ‘ATTACH_VIRTUAL_CMP_OPERATIONS’ 56 | ATTACH_VIRTUAL_CMP_OPERATIONS(Selector) | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~ src/ast_def_macros.hpp:106:16: note: by ‘virtual bool Sass::SimpleSelector::operator!=(const Sass::SimpleSelector&) const’ 106 | virtual bool operator!=(const klass& rhs) const { return !(*this == rhs); }; \ | ^~~~~~~~ src/ast_selectors.hpp:139:5: note: in expansion of macro ‘ATTACH_VIRTUAL_CMP_OPERATIONS’ 139 | ATTACH_VIRTUAL_CMP_OPERATIONS(SimpleSelector); | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~ In file included from src/ast.hpp:1055: src/ast_selectors.hpp:137:18: warning: ‘virtual bool Sass::SimpleSelector::operator==(const Sass::CompoundSelector&) const’ was hidden [-Woverloaded-virtual=] 137 | virtual bool operator==(const CompoundSelector& rhs) const; | ^~~~~~~~ src/ast_def_macros.hpp:109:16: note: by ‘Sass::PlaceholderSelector::operator==’ 109 | virtual bool operator==(const klass& rhs) const; \ | ^~~~~~~~ src/ast_selectors.hpp:157:5: note: in expansion of macro ‘ATTACH_CMP_OPERATIONS’ 157 | ATTACH_CMP_OPERATIONS(PlaceholderSelector) | ^~~~~~~~~~~~~~~~~~~~~ src/ast_selectors.hpp:136:18: warning: ‘virtual bool Sass::SimpleSelector::operator==(const Sass::ComplexSelector&) const’ was hidden [-Woverloaded-virtual=] 136 | virtual bool operator==(const ComplexSelector& rhs) const; | ^~~~~~~~ src/ast_def_macros.hpp:109:16: note: by ‘Sass::PlaceholderSelector::operator==’ 109 | virtual bool operator==(const klass& rhs) const; \ | ^~~~~~~~ src/ast_selectors.hpp:157:5: note: in expansion of macro ‘ATTACH_CMP_OPERATIONS’ 157 | ATTACH_CMP_OPERATIONS(PlaceholderSelector) | ^~~~~~~~~~~~~~~~~~~~~ src/ast_selectors.hpp:135:18: warning: ‘virtual bool Sass::SimpleSelector::operator==(const Sass::SelectorList&) const’ was hidden [-Woverloaded-virtual=] 135 | virtual bool operator==(const SelectorList& rhs) const; | ^~~~~~~~ src/ast_def_macros.hpp:109:16: note: by ‘Sass::PlaceholderSelector::operator==’ 109 | virtual bool operator==(const klass& rhs) const; \ | ^~~~~~~~ src/ast_selectors.hpp:157:5: note: in expansion of macro ‘ATTACH_CMP_OPERATIONS’ 157 | ATTACH_CMP_OPERATIONS(PlaceholderSelector) | ^~~~~~~~~~~~~~~~~~~~~ src/ast_selectors.hpp:133:10: warning: ‘virtual bool Sass::SimpleSelector::operator==(const Sass::Selector&) const’ was hidden [-Woverloaded-virtual=] 133 | bool operator==(const Selector& rhs) const final override; | ^~~~~~~~ src/ast_def_macros.hpp:109:16: note: by ‘Sass::PlaceholderSelector::operator==’ 109 | virtual bool operator==(const klass& rhs) const; \ | ^~~~~~~~ src/ast_selectors.hpp:157:5: note: in expansion of macro ‘ATTACH_CMP_OPERATIONS’ 157 | ATTACH_CMP_OPERATIONS(PlaceholderSelector) | ^~~~~~~~~~~~~~~~~~~~~ src/ast_def_macros.hpp:106:16: warning: ‘virtual bool Sass::SimpleSelector::operator!=(const Sass::SimpleSelector&) const’ was hidden [-Woverloaded-virtual=] 106 | virtual bool operator!=(const klass& rhs) const { return !(*this == rhs); }; \ | ^~~~~~~~ src/ast_selectors.hpp:139:5: note: in expansion of macro ‘ATTACH_VIRTUAL_CMP_OPERATIONS’ 139 | ATTACH_VIRTUAL_CMP_OPERATIONS(SimpleSelector); | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~ src/ast_def_macros.hpp:110:16: note: by ‘virtual bool Sass::PlaceholderSelector::operator!=(const Sass::PlaceholderSelector&) const’ 110 | virtual bool operator!=(const klass& rhs) const { return !(*this == rhs); }; \ | ^~~~~~~~ src/ast_selectors.hpp:157:5: note: in expansion of macro ‘ATTACH_CMP_OPERATIONS’ 157 | ATTACH_CMP_OPERATIONS(PlaceholderSelector) | ^~~~~~~~~~~~~~~~~~~~~ src/ast_selectors.hpp:137:18: warning: ‘virtual bool Sass::SimpleSelector::operator==(const Sass::CompoundSelector&) const’ was hidden [-Woverloaded-virtual=] 137 | virtual bool operator==(const CompoundSelector& rhs) const; | ^~~~~~~~ src/ast_def_macros.hpp:109:16: note: by ‘Sass::TypeSelector::operator==’ 109 | virtual bool operator==(const klass& rhs) const; \ | ^~~~~~~~ src/ast_selectors.hpp:174:5: note: in expansion of macro ‘ATTACH_CMP_OPERATIONS’ 174 | ATTACH_CMP_OPERATIONS(TypeSelector) | ^~~~~~~~~~~~~~~~~~~~~ src/ast_selectors.hpp:136:18: warning: ‘virtual bool Sass::SimpleSelector::operator==(const Sass::ComplexSelector&) const’ was hidden [-Woverloaded-virtual=] 136 | virtual bool operator==(const ComplexSelector& rhs) const; | ^~~~~~~~ src/ast_def_macros.hpp:109:16: note: by ‘Sass::TypeSelector::operator==’ 109 | virtual bool operator==(const klass& rhs) const; \ | ^~~~~~~~ src/ast_selectors.hpp:174:5: note: in expansion of macro ‘ATTACH_CMP_OPERATIONS’ 174 | ATTACH_CMP_OPERATIONS(TypeSelector) | ^~~~~~~~~~~~~~~~~~~~~ src/ast_selectors.hpp:135:18: warning: ‘virtual bool Sass::SimpleSelector::operator==(const Sass::SelectorList&) const’ was hidden [-Woverloaded-virtual=] 135 | virtual bool operator==(const SelectorList& rhs) const; | ^~~~~~~~ src/ast_def_macros.hpp:109:16: note: by ‘Sass::TypeSelector::operator==’ 109 | virtual bool operator==(const klass& rhs) const; \ | ^~~~~~~~ src/ast_selectors.hpp:174:5: note: in expansion of macro ‘ATTACH_CMP_OPERATIONS’ 174 | ATTACH_CMP_OPERATIONS(TypeSelector) | ^~~~~~~~~~~~~~~~~~~~~ src/ast_selectors.hpp:133:10: warning: ‘virtual bool Sass::SimpleSelector::operator==(const Sass::Selector&) const’ was hidden [-Woverloaded-virtual=] 133 | bool operator==(const Selector& rhs) const final override; | ^~~~~~~~ src/ast_def_macros.hpp:109:16: note: by ‘Sass::TypeSelector::operator==’ 109 | virtual bool operator==(const klass& rhs) const; \ | ^~~~~~~~ src/ast_selectors.hpp:174:5: note: in expansion of macro ‘ATTACH_CMP_OPERATIONS’ 174 | ATTACH_CMP_OPERATIONS(TypeSelector) | ^~~~~~~~~~~~~~~~~~~~~ src/ast_def_macros.hpp:106:16: warning: ‘virtual bool Sass::SimpleSelector::operator!=(const Sass::SimpleSelector&) const’ was hidden [-Woverloaded-virtual=] 106 | virtual bool operator!=(const klass& rhs) const { return !(*this == rhs); }; \ | ^~~~~~~~ src/ast_selectors.hpp:139:5: note: in expansion of macro ‘ATTACH_VIRTUAL_CMP_OPERATIONS’ 139 | ATTACH_VIRTUAL_CMP_OPERATIONS(SimpleSelector); | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~ src/ast_def_macros.hpp:110:16: note: by ‘virtual bool Sass::TypeSelector::operator!=(const Sass::TypeSelector&) const’ 110 | virtual bool operator!=(const klass& rhs) const { return !(*this == rhs); }; \ | ^~~~~~~~ src/ast_selectors.hpp:174:5: note: in expansion of macro ‘ATTACH_CMP_OPERATIONS’ 174 | ATTACH_CMP_OPERATIONS(TypeSelector) | ^~~~~~~~~~~~~~~~~~~~~ src/ast_selectors.hpp:137:18: warning: ‘virtual bool Sass::SimpleSelector::operator==(const Sass::CompoundSelector&) const’ was hidden [-Woverloaded-virtual=] 137 | virtual bool operator==(const CompoundSelector& rhs) const; | ^~~~~~~~ src/ast_def_macros.hpp:109:16: note: by ‘Sass::ClassSelector::operator==’ 109 | virtual bool operator==(const klass& rhs) const; \ | ^~~~~~~~ src/ast_selectors.hpp:188:5: note: in expansion of macro ‘ATTACH_CMP_OPERATIONS’ 188 | ATTACH_CMP_OPERATIONS(ClassSelector) | ^~~~~~~~~~~~~~~~~~~~~ src/ast_selectors.hpp:136:18: warning: ‘virtual bool Sass::SimpleSelector::operator==(const Sass::ComplexSelector&) const’ was hidden [-Woverloaded-virtual=] 136 | virtual bool operator==(const ComplexSelector& rhs) const; | ^~~~~~~~ src/ast_def_macros.hpp:109:16: note: by ‘Sass::ClassSelector::operator==’ 109 | virtual bool operator==(const klass& rhs) const; \ | ^~~~~~~~ src/ast_selectors.hpp:188:5: note: in expansion of macro ‘ATTACH_CMP_OPERATIONS’ 188 | ATTACH_CMP_OPERATIONS(ClassSelector) | ^~~~~~~~~~~~~~~~~~~~~ src/ast_selectors.hpp:135:18: warning: ‘virtual bool Sass::SimpleSelector::operator==(const Sass::SelectorList&) const’ was hidden [-Woverloaded-virtual=] 135 | virtual bool operator==(const SelectorList& rhs) const; | ^~~~~~~~ src/ast_def_macros.hpp:109:16: note: by ‘Sass::ClassSelector::operator==’ 109 | virtual bool operator==(const klass& rhs) const; \ | ^~~~~~~~ src/ast_selectors.hpp:188:5: note: in expansion of macro ‘ATTACH_CMP_OPERATIONS’ 188 | ATTACH_CMP_OPERATIONS(ClassSelector) | ^~~~~~~~~~~~~~~~~~~~~ src/ast_selectors.hpp:133:10: warning: ‘virtual bool Sass::SimpleSelector::operator==(const Sass::Selector&) const’ was hidden [-Woverloaded-virtual=] 133 | bool operator==(const Selector& rhs) const final override; | ^~~~~~~~ src/ast_def_macros.hpp:109:16: note: by ‘Sass::ClassSelector::operator==’ 109 | virtual bool operator==(const klass& rhs) const; \ | ^~~~~~~~ src/ast_selectors.hpp:188:5: note: in expansion of macro ‘ATTACH_CMP_OPERATIONS’ 188 | ATTACH_CMP_OPERATIONS(ClassSelector) | ^~~~~~~~~~~~~~~~~~~~~ src/ast_def_macros.hpp:106:16: warning: ‘virtual bool Sass::SimpleSelector::operator!=(const Sass::SimpleSelector&) const’ was hidden [-Woverloaded-virtual=] 106 | virtual bool operator!=(const klass& rhs) const { return !(*this == rhs); }; \ | ^~~~~~~~ src/ast_selectors.hpp:139:5: note: in expansion of macro ‘ATTACH_VIRTUAL_CMP_OPERATIONS’ 139 | ATTACH_VIRTUAL_CMP_OPERATIONS(SimpleSelector); | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~ src/ast_def_macros.hpp:110:16: note: by ‘virtual bool Sass::ClassSelector::operator!=(const Sass::ClassSelector&) const’ 110 | virtual bool operator!=(const klass& rhs) const { return !(*this == rhs); }; \ | ^~~~~~~~ src/ast_selectors.hpp:188:5: note: in expansion of macro ‘ATTACH_CMP_OPERATIONS’ 188 | ATTACH_CMP_OPERATIONS(ClassSelector) | ^~~~~~~~~~~~~~~~~~~~~ src/ast_selectors.hpp:137:18: warning: ‘virtual bool Sass::SimpleSelector::operator==(const Sass::CompoundSelector&) const’ was hidden [-Woverloaded-virtual=] 137 | virtual bool operator==(const CompoundSelector& rhs) const; | ^~~~~~~~ src/ast_def_macros.hpp:109:16: note: by ‘Sass::IDSelector::operator==’ 109 | virtual bool operator==(const klass& rhs) const; \ | ^~~~~~~~ src/ast_selectors.hpp:204:5: note: in expansion of macro ‘ATTACH_CMP_OPERATIONS’ 204 | ATTACH_CMP_OPERATIONS(IDSelector) | ^~~~~~~~~~~~~~~~~~~~~ src/ast_selectors.hpp:136:18: warning: ‘virtual bool Sass::SimpleSelector::operator==(const Sass::ComplexSelector&) const’ was hidden [-Woverloaded-virtual=] 136 | virtual bool operator==(const ComplexSelector& rhs) const; | ^~~~~~~~ src/ast_def_macros.hpp:109:16: note: by ‘Sass::IDSelector::operator==’ 109 | virtual bool operator==(const klass& rhs) const; \ | ^~~~~~~~ src/ast_selectors.hpp:204:5: note: in expansion of macro ‘ATTACH_CMP_OPERATIONS’ 204 | ATTACH_CMP_OPERATIONS(IDSelector) | ^~~~~~~~~~~~~~~~~~~~~ src/ast_selectors.hpp:135:18: warning: ‘virtual bool Sass::SimpleSelector::operator==(const Sass::SelectorList&) const’ was hidden [-Woverloaded-virtual=] 135 | virtual bool operator==(const SelectorList& rhs) const; | ^~~~~~~~ src/ast_def_macros.hpp:109:16: note: by ‘Sass::IDSelector::operator==’ 109 | virtual bool operator==(const klass& rhs) const; \ | ^~~~~~~~ src/ast_selectors.hpp:204:5: note: in expansion of macro ‘ATTACH_CMP_OPERATIONS’ 204 | ATTACH_CMP_OPERATIONS(IDSelector) | ^~~~~~~~~~~~~~~~~~~~~ src/ast_selectors.hpp:133:10: warning: ‘virtual bool Sass::SimpleSelector::operator==(const Sass::Selector&) const’ was hidden [-Woverloaded-virtual=] 133 | bool operator==(const Selector& rhs) const final override; | ^~~~~~~~ src/ast_def_macros.hpp:109:16: note: by ‘Sass::IDSelector::operator==’ 109 | virtual bool operator==(const klass& rhs) const; \ | ^~~~~~~~ src/ast_selectors.hpp:204:5: note: in expansion of macro ‘ATTACH_CMP_OPERATIONS’ 204 | ATTACH_CMP_OPERATIONS(IDSelector) | ^~~~~~~~~~~~~~~~~~~~~ src/ast_def_macros.hpp:106:16: warning: ‘virtual bool Sass::SimpleSelector::operator!=(const Sass::SimpleSelector&) const’ was hidden [-Woverloaded-virtual=] 106 | virtual bool operator!=(const klass& rhs) const { return !(*this == rhs); }; \ | ^~~~~~~~ src/ast_selectors.hpp:139:5: note: in expansion of macro ‘ATTACH_VIRTUAL_CMP_OPERATIONS’ 139 | ATTACH_VIRTUAL_CMP_OPERATIONS(SimpleSelector); | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~ src/ast_def_macros.hpp:110:16: note: by ‘virtual bool Sass::IDSelector::operator!=(const Sass::IDSelector&) const’ 110 | virtual bool operator!=(const klass& rhs) const { return !(*this == rhs); }; \ | ^~~~~~~~ src/ast_selectors.hpp:204:5: note: in expansion of macro ‘ATTACH_CMP_OPERATIONS’ 204 | ATTACH_CMP_OPERATIONS(IDSelector) | ^~~~~~~~~~~~~~~~~~~~~ src/ast_selectors.hpp:137:18: warning: ‘virtual bool Sass::SimpleSelector::operator==(const Sass::CompoundSelector&) const’ was hidden [-Woverloaded-virtual=] 137 | virtual bool operator==(const CompoundSelector& rhs) const; | ^~~~~~~~ src/ast_def_macros.hpp:109:16: note: by ‘Sass::AttributeSelector::operator==’ 109 | virtual bool operator==(const klass& rhs) const; \ | ^~~~~~~~ src/ast_selectors.hpp:223:5: note: in expansion of macro ‘ATTACH_CMP_OPERATIONS’ 223 | ATTACH_CMP_OPERATIONS(AttributeSelector) | ^~~~~~~~~~~~~~~~~~~~~ src/ast_selectors.hpp:136:18: warning: ‘virtual bool Sass::SimpleSelector::operator==(const Sass::ComplexSelector&) const’ was hidden [-Woverloaded-virtual=] 136 | virtual bool operator==(const ComplexSelector& rhs) const; | ^~~~~~~~ src/ast_def_macros.hpp:109:16: note: by ‘Sass::AttributeSelector::operator==’ 109 | virtual bool operator==(const klass& rhs) const; \ | ^~~~~~~~ src/ast_selectors.hpp:223:5: note: in expansion of macro ‘ATTACH_CMP_OPERATIONS’ 223 | ATTACH_CMP_OPERATIONS(AttributeSelector) | ^~~~~~~~~~~~~~~~~~~~~ src/ast_selectors.hpp:135:18: warning: ‘virtual bool Sass::SimpleSelector::operator==(const Sass::SelectorList&) const’ was hidden [-Woverloaded-virtual=] 135 | virtual bool operator==(const SelectorList& rhs) const; | ^~~~~~~~ src/ast_def_macros.hpp:109:16: note: by ‘Sass::AttributeSelector::operator==’ 109 | virtual bool operator==(const klass& rhs) const; \ | ^~~~~~~~ src/ast_selectors.hpp:223:5: note: in expansion of macro ‘ATTACH_CMP_OPERATIONS’ 223 | ATTACH_CMP_OPERATIONS(AttributeSelector) | ^~~~~~~~~~~~~~~~~~~~~ src/ast_selectors.hpp:133:10: warning: ‘virtual bool Sass::SimpleSelector::operator==(const Sass::Selector&) const’ was hidden [-Woverloaded-virtual=] 133 | bool operator==(const Selector& rhs) const final override; | ^~~~~~~~ src/ast_def_macros.hpp:109:16: note: by ‘Sass::AttributeSelector::operator==’ 109 | virtual bool operator==(const klass& rhs) const; \ | ^~~~~~~~ src/ast_selectors.hpp:223:5: note: in expansion of macro ‘ATTACH_CMP_OPERATIONS’ 223 | ATTACH_CMP_OPERATIONS(AttributeSelector) | ^~~~~~~~~~~~~~~~~~~~~ src/ast_def_macros.hpp:106:16: warning: ‘virtual bool Sass::SimpleSelector::operator!=(const Sass::SimpleSelector&) const’ was hidden [-Woverloaded-virtual=] 106 | virtual bool operator!=(const klass& rhs) const { return !(*this == rhs); }; \ | ^~~~~~~~ src/ast_selectors.hpp:139:5: note: in expansion of macro ‘ATTACH_VIRTUAL_CMP_OPERATIONS’ 139 | ATTACH_VIRTUAL_CMP_OPERATIONS(SimpleSelector); | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~ src/ast_def_macros.hpp:110:16: note: by ‘virtual bool Sass::AttributeSelector::operator!=(const Sass::AttributeSelector&) const’ 110 | virtual bool operator!=(const klass& rhs) const { return !(*this == rhs); }; \ | ^~~~~~~~ src/ast_selectors.hpp:223:5: note: in expansion of macro ‘ATTACH_CMP_OPERATIONS’ 223 | ATTACH_CMP_OPERATIONS(AttributeSelector) | ^~~~~~~~~~~~~~~~~~~~~ src/ast_def_macros.hpp:106:16: warning: ‘virtual bool Sass::Selector::operator!=(const Sass::Selector&) const’ was hidden [-Woverloaded-virtual=] 106 | virtual bool operator!=(const klass& rhs) const { return !(*this == rhs); }; \ | ^~~~~~~~ src/ast_selectors.hpp:56:5: note: in expansion of macro ‘ATTACH_VIRTUAL_CMP_OPERATIONS’ 56 | ATTACH_VIRTUAL_CMP_OPERATIONS(Selector) | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~ src/ast_def_macros.hpp:110:16: note: by ‘virtual bool Sass::ComplexSelector::operator!=(const Sass::ComplexSelector&) const’ 110 | virtual bool operator!=(const klass& rhs) const { return !(*this == rhs); }; \ | ^~~~~~~~ src/ast_selectors.hpp:310:5: note: in expansion of macro ‘ATTACH_CMP_OPERATIONS’ 310 | ATTACH_CMP_OPERATIONS(ComplexSelector) | ^~~~~~~~~~~~~~~~~~~~~ src/ast_def_macros.hpp:106:16: warning: ‘virtual bool Sass::Selector::operator!=(const Sass::Selector&) const’ was hidden [-Woverloaded-virtual=] 106 | virtual bool operator!=(const klass& rhs) const { return !(*this == rhs); }; \ | ^~~~~~~~ src/ast_selectors.hpp:56:5: note: in expansion of macro ‘ATTACH_VIRTUAL_CMP_OPERATIONS’ 56 | ATTACH_VIRTUAL_CMP_OPERATIONS(Selector) | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~ src/ast_def_macros.hpp:106:16: note: by ‘virtual bool Sass::SelectorComponent::operator!=(const Sass::SelectorComponent&) const’ 106 | virtual bool operator!=(const klass& rhs) const { return !(*this == rhs); }; \ | ^~~~~~~~ src/ast_selectors.hpp:349:5: note: in expansion of macro ‘ATTACH_VIRTUAL_CMP_OPERATIONS’ 349 | ATTACH_VIRTUAL_CMP_OPERATIONS(SelectorComponent); | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~ src/ast_def_macros.hpp:106:16: warning: ‘virtual bool Sass::SelectorComponent::operator!=(const Sass::SelectorComponent&) const’ was hidden [-Woverloaded-virtual=] 106 | virtual bool operator!=(const klass& rhs) const { return !(*this == rhs); }; \ | ^~~~~~~~ src/ast_selectors.hpp:349:5: note: in expansion of macro ‘ATTACH_VIRTUAL_CMP_OPERATIONS’ 349 | ATTACH_VIRTUAL_CMP_OPERATIONS(SelectorComponent); | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~ src/ast_def_macros.hpp:110:16: note: by ‘virtual bool Sass::SelectorCombinator::operator!=(const Sass::SelectorCombinator&) const’ 110 | virtual bool operator!=(const klass& rhs) const { return !(*this == rhs); }; \ | ^~~~~~~~ src/ast_selectors.hpp:407:5: note: in expansion of macro ‘ATTACH_CMP_OPERATIONS’ 407 | ATTACH_CMP_OPERATIONS(SelectorCombinator) | ^~~~~~~~~~~~~~~~~~~~~ g++ -std=gnu++17 -Wall -O2 -std=c++11 -I ./include -fPIC -c -o src/sass.o src/sass.cpp In file included from src/context.hpp:7, from src/sass.cpp:13: src/ast.hpp:90:18: warning: ‘virtual bool Sass::AST_Node::operator==(const Sass::AST_Node&) const’ was hidden [-Woverloaded-virtual=] 90 | virtual bool operator== (const AST_Node& rhs) const { | ^~~~~~~~ src/ast.hpp:165:18: note: by ‘virtual bool Sass::Expression::operator==(const Sass::Expression&) const’ 165 | virtual bool operator== (const Expression& rhs) const { return false; } | ^~~~~~~~ src/ast.hpp:96:18: warning: ‘virtual bool Sass::AST_Node::operator!=(const Sass::AST_Node&) const’ was hidden [-Woverloaded-virtual=] 96 | virtual bool operator!= (const AST_Node& rhs) const { | ^~~~~~~~ src/ast.hpp:167:17: note: by ‘bool Sass::Expression::operator!=(const Sass::Expression&) const’ 167 | inline bool operator!=(const Expression& rhs) const { return !(rhs == *this); } | ^~~~~~~~ src/ast.hpp:90:18: warning: ‘virtual bool Sass::AST_Node::operator==(const Sass::AST_Node&) const’ was hidden [-Woverloaded-virtual=] 90 | virtual bool operator== (const AST_Node& rhs) const { | ^~~~~~~~ src/ast.hpp:908:10: note: by ‘bool Sass::CssMediaRule::operator==(const Sass::CssMediaRule&) const’ 908 | bool operator== (const CssMediaRule& rhs) const { | ^~~~~~~~ src/ast.hpp:96:18: warning: ‘virtual bool Sass::AST_Node::operator!=(const Sass::AST_Node&) const’ was hidden [-Woverloaded-virtual=] 96 | virtual bool operator!= (const AST_Node& rhs) const { | ^~~~~~~~ src/ast.hpp:911:10: note: by ‘bool Sass::CssMediaRule::operator!=(const Sass::CssMediaRule&) const’ 911 | bool operator!=(const CssMediaRule& rhs) const { | ^~~~~~~~ src/ast.hpp:90:18: warning: ‘virtual bool Sass::AST_Node::operator==(const Sass::AST_Node&) const’ was hidden [-Woverloaded-virtual=] 90 | virtual bool operator== (const AST_Node& rhs) const { | ^~~~~~~~ src/ast.hpp:939:10: note: by ‘bool Sass::CssMediaQuery::operator==(const Sass::CssMediaQuery&) const’ 939 | bool operator== (const CssMediaQuery& rhs) const; | ^~~~~~~~ src/ast.hpp:96:18: warning: ‘virtual bool Sass::AST_Node::operator!=(const Sass::AST_Node&) const’ was hidden [-Woverloaded-virtual=] 96 | virtual bool operator!= (const AST_Node& rhs) const { | ^~~~~~~~ src/ast.hpp:940:10: note: by ‘bool Sass::CssMediaQuery::operator!=(const Sass::CssMediaQuery&) const’ 940 | bool operator!=(const CssMediaQuery& rhs) const { | ^~~~~~~~ src/ast.hpp:165:18: warning: ‘virtual bool Sass::Expression::operator==(const Sass::Expression&) const’ was hidden [-Woverloaded-virtual=] 165 | virtual bool operator== (const Expression& rhs) const { return false; } | ^~~~~~~~ In file included from src/ast.hpp:14: src/ast_def_macros.hpp:105:16: note: by ‘virtual bool Sass::Selector::operator==(const Sass::Selector&) const’ 105 | virtual bool operator==(const klass& rhs) const = 0; \ | ^~~~~~~~ src/ast_selectors.hpp:56:5: note: in expansion of macro ‘ATTACH_VIRTUAL_CMP_OPERATIONS’ 56 | ATTACH_VIRTUAL_CMP_OPERATIONS(Selector) | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~ src/ast.hpp:96:18: warning: ‘virtual bool Sass::AST_Node::operator!=(const Sass::AST_Node&) const’ was hidden [-Woverloaded-virtual=] 96 | virtual bool operator!= (const AST_Node& rhs) const { | ^~~~~~~~ src/ast_def_macros.hpp:106:16: note: by ‘virtual bool Sass::Selector::operator!=(const Sass::Selector&) const’ 106 | virtual bool operator!=(const klass& rhs) const { return !(*this == rhs); }; \ | ^~~~~~~~ src/ast_selectors.hpp:56:5: note: in expansion of macro ‘ATTACH_VIRTUAL_CMP_OPERATIONS’ 56 | ATTACH_VIRTUAL_CMP_OPERATIONS(Selector) | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~ src/ast_def_macros.hpp:106:16: warning: ‘virtual bool Sass::Selector::operator!=(const Sass::Selector&) const’ was hidden [-Woverloaded-virtual=] 106 | virtual bool operator!=(const klass& rhs) const { return !(*this == rhs); }; \ | ^~~~~~~~ src/ast_selectors.hpp:56:5: note: in expansion of macro ‘ATTACH_VIRTUAL_CMP_OPERATIONS’ 56 | ATTACH_VIRTUAL_CMP_OPERATIONS(Selector) | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~ src/ast_def_macros.hpp:106:16: note: by ‘virtual bool Sass::SimpleSelector::operator!=(const Sass::SimpleSelector&) const’ 106 | virtual bool operator!=(const klass& rhs) const { return !(*this == rhs); }; \ | ^~~~~~~~ src/ast_selectors.hpp:139:5: note: in expansion of macro ‘ATTACH_VIRTUAL_CMP_OPERATIONS’ 139 | ATTACH_VIRTUAL_CMP_OPERATIONS(SimpleSelector); | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~ In file included from src/ast.hpp:1055: src/ast_selectors.hpp:137:18: warning: ‘virtual bool Sass::SimpleSelector::operator==(const Sass::CompoundSelector&) const’ was hidden [-Woverloaded-virtual=] 137 | virtual bool operator==(const CompoundSelector& rhs) const; | ^~~~~~~~ src/ast_def_macros.hpp:109:16: note: by ‘Sass::PlaceholderSelector::operator==’ 109 | virtual bool operator==(const klass& rhs) const; \ | ^~~~~~~~ src/ast_selectors.hpp:157:5: note: in expansion of macro ‘ATTACH_CMP_OPERATIONS’ 157 | ATTACH_CMP_OPERATIONS(PlaceholderSelector) | ^~~~~~~~~~~~~~~~~~~~~ src/ast_selectors.hpp:136:18: warning: ‘virtual bool Sass::SimpleSelector::operator==(const Sass::ComplexSelector&) const’ was hidden [-Woverloaded-virtual=] 136 | virtual bool operator==(const ComplexSelector& rhs) const; | ^~~~~~~~ src/ast_def_macros.hpp:109:16: note: by ‘Sass::PlaceholderSelector::operator==’ 109 | virtual bool operator==(const klass& rhs) const; \ | ^~~~~~~~ src/ast_selectors.hpp:157:5: note: in expansion of macro ‘ATTACH_CMP_OPERATIONS’ 157 | ATTACH_CMP_OPERATIONS(PlaceholderSelector) | ^~~~~~~~~~~~~~~~~~~~~ src/ast_selectors.hpp:135:18: warning: ‘virtual bool Sass::SimpleSelector::operator==(const Sass::SelectorList&) const’ was hidden [-Woverloaded-virtual=] 135 | virtual bool operator==(const SelectorList& rhs) const; | ^~~~~~~~ src/ast_def_macros.hpp:109:16: note: by ‘Sass::PlaceholderSelector::operator==’ 109 | virtual bool operator==(const klass& rhs) const; \ | ^~~~~~~~ src/ast_selectors.hpp:157:5: note: in expansion of macro ‘ATTACH_CMP_OPERATIONS’ 157 | ATTACH_CMP_OPERATIONS(PlaceholderSelector) | ^~~~~~~~~~~~~~~~~~~~~ src/ast_selectors.hpp:133:10: warning: ‘virtual bool Sass::SimpleSelector::operator==(const Sass::Selector&) const’ was hidden [-Woverloaded-virtual=] 133 | bool operator==(const Selector& rhs) const final override; | ^~~~~~~~ src/ast_def_macros.hpp:109:16: note: by ‘Sass::PlaceholderSelector::operator==’ 109 | virtual bool operator==(const klass& rhs) const; \ | ^~~~~~~~ src/ast_selectors.hpp:157:5: note: in expansion of macro ‘ATTACH_CMP_OPERATIONS’ 157 | ATTACH_CMP_OPERATIONS(PlaceholderSelector) | ^~~~~~~~~~~~~~~~~~~~~ src/ast_def_macros.hpp:106:16: warning: ‘virtual bool Sass::SimpleSelector::operator!=(const Sass::SimpleSelector&) const’ was hidden [-Woverloaded-virtual=] 106 | virtual bool operator!=(const klass& rhs) const { return !(*this == rhs); }; \ | ^~~~~~~~ src/ast_selectors.hpp:139:5: note: in expansion of macro ‘ATTACH_VIRTUAL_CMP_OPERATIONS’ 139 | ATTACH_VIRTUAL_CMP_OPERATIONS(SimpleSelector); | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~ src/ast_def_macros.hpp:110:16: note: by ‘virtual bool Sass::PlaceholderSelector::operator!=(const Sass::PlaceholderSelector&) const’ 110 | virtual bool operator!=(const klass& rhs) const { return !(*this == rhs); }; \ | ^~~~~~~~ src/ast_selectors.hpp:157:5: note: in expansion of macro ‘ATTACH_CMP_OPERATIONS’ 157 | ATTACH_CMP_OPERATIONS(PlaceholderSelector) | ^~~~~~~~~~~~~~~~~~~~~ src/ast_selectors.hpp:137:18: warning: ‘virtual bool Sass::SimpleSelector::operator==(const Sass::CompoundSelector&) const’ was hidden [-Woverloaded-virtual=] 137 | virtual bool operator==(const CompoundSelector& rhs) const; | ^~~~~~~~ src/ast_def_macros.hpp:109:16: note: by ‘Sass::TypeSelector::operator==’ 109 | virtual bool operator==(const klass& rhs) const; \ | ^~~~~~~~ src/ast_selectors.hpp:174:5: note: in expansion of macro ‘ATTACH_CMP_OPERATIONS’ 174 | ATTACH_CMP_OPERATIONS(TypeSelector) | ^~~~~~~~~~~~~~~~~~~~~ src/ast_selectors.hpp:136:18: warning: ‘virtual bool Sass::SimpleSelector::operator==(const Sass::ComplexSelector&) const’ was hidden [-Woverloaded-virtual=] 136 | virtual bool operator==(const ComplexSelector& rhs) const; | ^~~~~~~~ src/ast_def_macros.hpp:109:16: note: by ‘Sass::TypeSelector::operator==’ 109 | virtual bool operator==(const klass& rhs) const; \ | ^~~~~~~~ src/ast_selectors.hpp:174:5: note: in expansion of macro ‘ATTACH_CMP_OPERATIONS’ 174 | ATTACH_CMP_OPERATIONS(TypeSelector) | ^~~~~~~~~~~~~~~~~~~~~ src/ast_selectors.hpp:135:18: warning: ‘virtual bool Sass::SimpleSelector::operator==(const Sass::SelectorList&) const’ was hidden [-Woverloaded-virtual=] 135 | virtual bool operator==(const SelectorList& rhs) const; | ^~~~~~~~ src/ast_def_macros.hpp:109:16: note: by ‘Sass::TypeSelector::operator==’ 109 | virtual bool operator==(const klass& rhs) const; \ | ^~~~~~~~ src/ast_selectors.hpp:174:5: note: in expansion of macro ‘ATTACH_CMP_OPERATIONS’ 174 | ATTACH_CMP_OPERATIONS(TypeSelector) | ^~~~~~~~~~~~~~~~~~~~~ src/ast_selectors.hpp:133:10: warning: ‘virtual bool Sass::SimpleSelector::operator==(const Sass::Selector&) const’ was hidden [-Woverloaded-virtual=] 133 | bool operator==(const Selector& rhs) const final override; | ^~~~~~~~ src/ast_def_macros.hpp:109:16: note: by ‘Sass::TypeSelector::operator==’ 109 | virtual bool operator==(const klass& rhs) const; \ | ^~~~~~~~ src/ast_selectors.hpp:174:5: note: in expansion of macro ‘ATTACH_CMP_OPERATIONS’ 174 | ATTACH_CMP_OPERATIONS(TypeSelector) | ^~~~~~~~~~~~~~~~~~~~~ src/ast_def_macros.hpp:106:16: warning: ‘virtual bool Sass::SimpleSelector::operator!=(const Sass::SimpleSelector&) const’ was hidden [-Woverloaded-virtual=] 106 | virtual bool operator!=(const klass& rhs) const { return !(*this == rhs); }; \ | ^~~~~~~~ src/ast_selectors.hpp:139:5: note: in expansion of macro ‘ATTACH_VIRTUAL_CMP_OPERATIONS’ 139 | ATTACH_VIRTUAL_CMP_OPERATIONS(SimpleSelector); | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~ src/ast_def_macros.hpp:110:16: note: by ‘virtual bool Sass::TypeSelector::operator!=(const Sass::TypeSelector&) const’ 110 | virtual bool operator!=(const klass& rhs) const { return !(*this == rhs); }; \ | ^~~~~~~~ src/ast_selectors.hpp:174:5: note: in expansion of macro ‘ATTACH_CMP_OPERATIONS’ 174 | ATTACH_CMP_OPERATIONS(TypeSelector) | ^~~~~~~~~~~~~~~~~~~~~ src/ast_selectors.hpp:137:18: warning: ‘virtual bool Sass::SimpleSelector::operator==(const Sass::CompoundSelector&) const’ was hidden [-Woverloaded-virtual=] 137 | virtual bool operator==(const CompoundSelector& rhs) const; | ^~~~~~~~ src/ast_def_macros.hpp:109:16: note: by ‘Sass::ClassSelector::operator==’ 109 | virtual bool operator==(const klass& rhs) const; \ | ^~~~~~~~ src/ast_selectors.hpp:188:5: note: in expansion of macro ‘ATTACH_CMP_OPERATIONS’ 188 | ATTACH_CMP_OPERATIONS(ClassSelector) | ^~~~~~~~~~~~~~~~~~~~~ src/ast_selectors.hpp:136:18: warning: ‘virtual bool Sass::SimpleSelector::operator==(const Sass::ComplexSelector&) const’ was hidden [-Woverloaded-virtual=] 136 | virtual bool operator==(const ComplexSelector& rhs) const; | ^~~~~~~~ src/ast_def_macros.hpp:109:16: note: by ‘Sass::ClassSelector::operator==’ 109 | virtual bool operator==(const klass& rhs) const; \ | ^~~~~~~~ src/ast_selectors.hpp:188:5: note: in expansion of macro ‘ATTACH_CMP_OPERATIONS’ 188 | ATTACH_CMP_OPERATIONS(ClassSelector) | ^~~~~~~~~~~~~~~~~~~~~ src/ast_selectors.hpp:135:18: warning: ‘virtual bool Sass::SimpleSelector::operator==(const Sass::SelectorList&) const’ was hidden [-Woverloaded-virtual=] 135 | virtual bool operator==(const SelectorList& rhs) const; | ^~~~~~~~ src/ast_def_macros.hpp:109:16: note: by ‘Sass::ClassSelector::operator==’ 109 | virtual bool operator==(const klass& rhs) const; \ | ^~~~~~~~ src/ast_selectors.hpp:188:5: note: in expansion of macro ‘ATTACH_CMP_OPERATIONS’ 188 | ATTACH_CMP_OPERATIONS(ClassSelector) | ^~~~~~~~~~~~~~~~~~~~~ src/ast_selectors.hpp:133:10: warning: ‘virtual bool Sass::SimpleSelector::operator==(const Sass::Selector&) const’ was hidden [-Woverloaded-virtual=] 133 | bool operator==(const Selector& rhs) const final override; | ^~~~~~~~ src/ast_def_macros.hpp:109:16: note: by ‘Sass::ClassSelector::operator==’ 109 | virtual bool operator==(const klass& rhs) const; \ | ^~~~~~~~ src/ast_selectors.hpp:188:5: note: in expansion of macro ‘ATTACH_CMP_OPERATIONS’ 188 | ATTACH_CMP_OPERATIONS(ClassSelector) | ^~~~~~~~~~~~~~~~~~~~~ src/ast_def_macros.hpp:106:16: warning: ‘virtual bool Sass::SimpleSelector::operator!=(const Sass::SimpleSelector&) const’ was hidden [-Woverloaded-virtual=] 106 | virtual bool operator!=(const klass& rhs) const { return !(*this == rhs); }; \ | ^~~~~~~~ src/ast_selectors.hpp:139:5: note: in expansion of macro ‘ATTACH_VIRTUAL_CMP_OPERATIONS’ 139 | ATTACH_VIRTUAL_CMP_OPERATIONS(SimpleSelector); | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~ src/ast_def_macros.hpp:110:16: note: by ‘virtual bool Sass::ClassSelector::operator!=(const Sass::ClassSelector&) const’ 110 | virtual bool operator!=(const klass& rhs) const { return !(*this == rhs); }; \ | ^~~~~~~~ src/ast_selectors.hpp:188:5: note: in expansion of macro ‘ATTACH_CMP_OPERATIONS’ 188 | ATTACH_CMP_OPERATIONS(ClassSelector) | ^~~~~~~~~~~~~~~~~~~~~ src/ast_selectors.hpp:137:18: warning: ‘virtual bool Sass::SimpleSelector::operator==(const Sass::CompoundSelector&) const’ was hidden [-Woverloaded-virtual=] 137 | virtual bool operator==(const CompoundSelector& rhs) const; | ^~~~~~~~ src/ast_def_macros.hpp:109:16: note: by ‘Sass::IDSelector::operator==’ 109 | virtual bool operator==(const klass& rhs) const; \ | ^~~~~~~~ src/ast_selectors.hpp:204:5: note: in expansion of macro ‘ATTACH_CMP_OPERATIONS’ 204 | ATTACH_CMP_OPERATIONS(IDSelector) | ^~~~~~~~~~~~~~~~~~~~~ src/ast_selectors.hpp:136:18: warning: ‘virtual bool Sass::SimpleSelector::operator==(const Sass::ComplexSelector&) const’ was hidden [-Woverloaded-virtual=] 136 | virtual bool operator==(const ComplexSelector& rhs) const; | ^~~~~~~~ src/ast_def_macros.hpp:109:16: note: by ‘Sass::IDSelector::operator==’ 109 | virtual bool operator==(const klass& rhs) const; \ | ^~~~~~~~ src/ast_selectors.hpp:204:5: note: in expansion of macro ‘ATTACH_CMP_OPERATIONS’ 204 | ATTACH_CMP_OPERATIONS(IDSelector) | ^~~~~~~~~~~~~~~~~~~~~ src/ast_selectors.hpp:135:18: warning: ‘virtual bool Sass::SimpleSelector::operator==(const Sass::SelectorList&) const’ was hidden [-Woverloaded-virtual=] 135 | virtual bool operator==(const SelectorList& rhs) const; | ^~~~~~~~ src/ast_def_macros.hpp:109:16: note: by ‘Sass::IDSelector::operator==’ 109 | virtual bool operator==(const klass& rhs) const; \ | ^~~~~~~~ src/ast_selectors.hpp:204:5: note: in expansion of macro ‘ATTACH_CMP_OPERATIONS’ 204 | ATTACH_CMP_OPERATIONS(IDSelector) | ^~~~~~~~~~~~~~~~~~~~~ src/ast_selectors.hpp:133:10: warning: ‘virtual bool Sass::SimpleSelector::operator==(const Sass::Selector&) const’ was hidden [-Woverloaded-virtual=] 133 | bool operator==(const Selector& rhs) const final override; | ^~~~~~~~ src/ast_def_macros.hpp:109:16: note: by ‘Sass::IDSelector::operator==’ 109 | virtual bool operator==(const klass& rhs) const; \ | ^~~~~~~~ src/ast_selectors.hpp:204:5: note: in expansion of macro ‘ATTACH_CMP_OPERATIONS’ 204 | ATTACH_CMP_OPERATIONS(IDSelector) | ^~~~~~~~~~~~~~~~~~~~~ src/ast_def_macros.hpp:106:16: warning: ‘virtual bool Sass::SimpleSelector::operator!=(const Sass::SimpleSelector&) const’ was hidden [-Woverloaded-virtual=] 106 | virtual bool operator!=(const klass& rhs) const { return !(*this == rhs); }; \ | ^~~~~~~~ src/ast_selectors.hpp:139:5: note: in expansion of macro ‘ATTACH_VIRTUAL_CMP_OPERATIONS’ 139 | ATTACH_VIRTUAL_CMP_OPERATIONS(SimpleSelector); | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~ src/ast_def_macros.hpp:110:16: note: by ‘virtual bool Sass::IDSelector::operator!=(const Sass::IDSelector&) const’ 110 | virtual bool operator!=(const klass& rhs) const { return !(*this == rhs); }; \ | ^~~~~~~~ src/ast_selectors.hpp:204:5: note: in expansion of macro ‘ATTACH_CMP_OPERATIONS’ 204 | ATTACH_CMP_OPERATIONS(IDSelector) | ^~~~~~~~~~~~~~~~~~~~~ src/ast_selectors.hpp:137:18: warning: ‘virtual bool Sass::SimpleSelector::operator==(const Sass::CompoundSelector&) const’ was hidden [-Woverloaded-virtual=] 137 | virtual bool operator==(const CompoundSelector& rhs) const; | ^~~~~~~~ src/ast_def_macros.hpp:109:16: note: by ‘Sass::AttributeSelector::operator==’ 109 | virtual bool operator==(const klass& rhs) const; \ | ^~~~~~~~ src/ast_selectors.hpp:223:5: note: in expansion of macro ‘ATTACH_CMP_OPERATIONS’ 223 | ATTACH_CMP_OPERATIONS(AttributeSelector) | ^~~~~~~~~~~~~~~~~~~~~ src/ast_selectors.hpp:136:18: warning: ‘virtual bool Sass::SimpleSelector::operator==(const Sass::ComplexSelector&) const’ was hidden [-Woverloaded-virtual=] 136 | virtual bool operator==(const ComplexSelector& rhs) const; | ^~~~~~~~ src/ast_def_macros.hpp:109:16: note: by ‘Sass::AttributeSelector::operator==’ 109 | virtual bool operator==(const klass& rhs) const; \ | ^~~~~~~~ src/ast_selectors.hpp:223:5: note: in expansion of macro ‘ATTACH_CMP_OPERATIONS’ 223 | ATTACH_CMP_OPERATIONS(AttributeSelector) | ^~~~~~~~~~~~~~~~~~~~~ src/ast_selectors.hpp:135:18: warning: ‘virtual bool Sass::SimpleSelector::operator==(const Sass::SelectorList&) const’ was hidden [-Woverloaded-virtual=] 135 | virtual bool operator==(const SelectorList& rhs) const; | ^~~~~~~~ src/ast_def_macros.hpp:109:16: note: by ‘Sass::AttributeSelector::operator==’ 109 | virtual bool operator==(const klass& rhs) const; \ | ^~~~~~~~ src/ast_selectors.hpp:223:5: note: in expansion of macro ‘ATTACH_CMP_OPERATIONS’ 223 | ATTACH_CMP_OPERATIONS(AttributeSelector) | ^~~~~~~~~~~~~~~~~~~~~ src/ast_selectors.hpp:133:10: warning: ‘virtual bool Sass::SimpleSelector::operator==(const Sass::Selector&) const’ was hidden [-Woverloaded-virtual=] 133 | bool operator==(const Selector& rhs) const final override; | ^~~~~~~~ src/ast_def_macros.hpp:109:16: note: by ‘Sass::AttributeSelector::operator==’ 109 | virtual bool operator==(const klass& rhs) const; \ | ^~~~~~~~ src/ast_selectors.hpp:223:5: note: in expansion of macro ‘ATTACH_CMP_OPERATIONS’ 223 | ATTACH_CMP_OPERATIONS(AttributeSelector) | ^~~~~~~~~~~~~~~~~~~~~ src/ast_def_macros.hpp:106:16: warning: ‘virtual bool Sass::SimpleSelector::operator!=(const Sass::SimpleSelector&) const’ was hidden [-Woverloaded-virtual=] 106 | virtual bool operator!=(const klass& rhs) const { return !(*this == rhs); }; \ | ^~~~~~~~ src/ast_selectors.hpp:139:5: note: in expansion of macro ‘ATTACH_VIRTUAL_CMP_OPERATIONS’ 139 | ATTACH_VIRTUAL_CMP_OPERATIONS(SimpleSelector); | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~ src/ast_def_macros.hpp:110:16: note: by ‘virtual bool Sass::AttributeSelector::operator!=(const Sass::AttributeSelector&) const’ 110 | virtual bool operator!=(const klass& rhs) const { return !(*this == rhs); }; \ | ^~~~~~~~ src/ast_selectors.hpp:223:5: note: in expansion of macro ‘ATTACH_CMP_OPERATIONS’ 223 | ATTACH_CMP_OPERATIONS(AttributeSelector) | ^~~~~~~~~~~~~~~~~~~~~ src/ast_def_macros.hpp:106:16: warning: ‘virtual bool Sass::Selector::operator!=(const Sass::Selector&) const’ was hidden [-Woverloaded-virtual=] 106 | virtual bool operator!=(const klass& rhs) const { return !(*this == rhs); }; \ | ^~~~~~~~ src/ast_selectors.hpp:56:5: note: in expansion of macro ‘ATTACH_VIRTUAL_CMP_OPERATIONS’ 56 | ATTACH_VIRTUAL_CMP_OPERATIONS(Selector) | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~ src/ast_def_macros.hpp:110:16: note: by ‘virtual bool Sass::ComplexSelector::operator!=(const Sass::ComplexSelector&) const’ 110 | virtual bool operator!=(const klass& rhs) const { return !(*this == rhs); }; \ | ^~~~~~~~ src/ast_selectors.hpp:310:5: note: in expansion of macro ‘ATTACH_CMP_OPERATIONS’ 310 | ATTACH_CMP_OPERATIONS(ComplexSelector) | ^~~~~~~~~~~~~~~~~~~~~ src/ast_def_macros.hpp:106:16: warning: ‘virtual bool Sass::Selector::operator!=(const Sass::Selector&) const’ was hidden [-Woverloaded-virtual=] 106 | virtual bool operator!=(const klass& rhs) const { return !(*this == rhs); }; \ | ^~~~~~~~ src/ast_selectors.hpp:56:5: note: in expansion of macro ‘ATTACH_VIRTUAL_CMP_OPERATIONS’ 56 | ATTACH_VIRTUAL_CMP_OPERATIONS(Selector) | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~ src/ast_def_macros.hpp:106:16: note: by ‘virtual bool Sass::SelectorComponent::operator!=(const Sass::SelectorComponent&) const’ 106 | virtual bool operator!=(const klass& rhs) const { return !(*this == rhs); }; \ | ^~~~~~~~ src/ast_selectors.hpp:349:5: note: in expansion of macro ‘ATTACH_VIRTUAL_CMP_OPERATIONS’ 349 | ATTACH_VIRTUAL_CMP_OPERATIONS(SelectorComponent); | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~ src/ast_def_macros.hpp:106:16: warning: ‘virtual bool Sass::SelectorComponent::operator!=(const Sass::SelectorComponent&) const’ was hidden [-Woverloaded-virtual=] 106 | virtual bool operator!=(const klass& rhs) const { return !(*this == rhs); }; \ | ^~~~~~~~ src/ast_selectors.hpp:349:5: note: in expansion of macro ‘ATTACH_VIRTUAL_CMP_OPERATIONS’ 349 | ATTACH_VIRTUAL_CMP_OPERATIONS(SelectorComponent); | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~ src/ast_def_macros.hpp:110:16: note: by ‘virtual bool Sass::SelectorCombinator::operator!=(const Sass::SelectorCombinator&) const’ 110 | virtual bool operator!=(const klass& rhs) const { return !(*this == rhs); }; \ | ^~~~~~~~ src/ast_selectors.hpp:407:5: note: in expansion of macro ‘ATTACH_CMP_OPERATIONS’ 407 | ATTACH_CMP_OPERATIONS(SelectorCombinator) | ^~~~~~~~~~~~~~~~~~~~~ g++ -std=gnu++17 -Wall -O2 -std=c++11 -I ./include -fPIC -c -o src/sass_values.o src/sass_values.cpp In file included from src/eval.hpp:7, from src/sass_values.cpp:8: src/ast.hpp:90:18: warning: ‘virtual bool Sass::AST_Node::operator==(const Sass::AST_Node&) const’ was hidden [-Woverloaded-virtual=] 90 | virtual bool operator== (const AST_Node& rhs) const { | ^~~~~~~~ src/ast.hpp:165:18: note: by ‘virtual bool Sass::Expression::operator==(const Sass::Expression&) const’ 165 | virtual bool operator== (const Expression& rhs) const { return false; } | ^~~~~~~~ src/ast.hpp:96:18: warning: ‘virtual bool Sass::AST_Node::operator!=(const Sass::AST_Node&) const’ was hidden [-Woverloaded-virtual=] 96 | virtual bool operator!= (const AST_Node& rhs) const { | ^~~~~~~~ src/ast.hpp:167:17: note: by ‘bool Sass::Expression::operator!=(const Sass::Expression&) const’ 167 | inline bool operator!=(const Expression& rhs) const { return !(rhs == *this); } | ^~~~~~~~ src/ast.hpp:90:18: warning: ‘virtual bool Sass::AST_Node::operator==(const Sass::AST_Node&) const’ was hidden [-Woverloaded-virtual=] 90 | virtual bool operator== (const AST_Node& rhs) const { | ^~~~~~~~ src/ast.hpp:908:10: note: by ‘bool Sass::CssMediaRule::operator==(const Sass::CssMediaRule&) const’ 908 | bool operator== (const CssMediaRule& rhs) const { | ^~~~~~~~ src/ast.hpp:96:18: warning: ‘virtual bool Sass::AST_Node::operator!=(const Sass::AST_Node&) const’ was hidden [-Woverloaded-virtual=] 96 | virtual bool operator!= (const AST_Node& rhs) const { | ^~~~~~~~ src/ast.hpp:911:10: note: by ‘bool Sass::CssMediaRule::operator!=(const Sass::CssMediaRule&) const’ 911 | bool operator!=(const CssMediaRule& rhs) const { | ^~~~~~~~ src/ast.hpp:90:18: warning: ‘virtual bool Sass::AST_Node::operator==(const Sass::AST_Node&) const’ was hidden [-Woverloaded-virtual=] 90 | virtual bool operator== (const AST_Node& rhs) const { | ^~~~~~~~ src/ast.hpp:939:10: note: by ‘bool Sass::CssMediaQuery::operator==(const Sass::CssMediaQuery&) const’ 939 | bool operator== (const CssMediaQuery& rhs) const; | ^~~~~~~~ src/ast.hpp:96:18: warning: ‘virtual bool Sass::AST_Node::operator!=(const Sass::AST_Node&) const’ was hidden [-Woverloaded-virtual=] 96 | virtual bool operator!= (const AST_Node& rhs) const { | ^~~~~~~~ src/ast.hpp:940:10: note: by ‘bool Sass::CssMediaQuery::operator!=(const Sass::CssMediaQuery&) const’ 940 | bool operator!=(const CssMediaQuery& rhs) const { | ^~~~~~~~ src/ast.hpp:165:18: warning: ‘virtual bool Sass::Expression::operator==(const Sass::Expression&) const’ was hidden [-Woverloaded-virtual=] 165 | virtual bool operator== (const Expression& rhs) const { return false; } | ^~~~~~~~ In file included from src/ast.hpp:14: src/ast_def_macros.hpp:105:16: note: by ‘virtual bool Sass::Selector::operator==(const Sass::Selector&) const’ 105 | virtual bool operator==(const klass& rhs) const = 0; \ | ^~~~~~~~ src/ast_selectors.hpp:56:5: note: in expansion of macro ‘ATTACH_VIRTUAL_CMP_OPERATIONS’ 56 | ATTACH_VIRTUAL_CMP_OPERATIONS(Selector) | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~ src/ast.hpp:96:18: warning: ‘virtual bool Sass::AST_Node::operator!=(const Sass::AST_Node&) const’ was hidden [-Woverloaded-virtual=] 96 | virtual bool operator!= (const AST_Node& rhs) const { | ^~~~~~~~ src/ast_def_macros.hpp:106:16: note: by ‘virtual bool Sass::Selector::operator!=(const Sass::Selector&) const’ 106 | virtual bool operator!=(const klass& rhs) const { return !(*this == rhs); }; \ | ^~~~~~~~ src/ast_selectors.hpp:56:5: note: in expansion of macro ‘ATTACH_VIRTUAL_CMP_OPERATIONS’ 56 | ATTACH_VIRTUAL_CMP_OPERATIONS(Selector) | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~ src/ast_def_macros.hpp:106:16: warning: ‘virtual bool Sass::Selector::operator!=(const Sass::Selector&) const’ was hidden [-Woverloaded-virtual=] 106 | virtual bool operator!=(const klass& rhs) const { return !(*this == rhs); }; \ | ^~~~~~~~ src/ast_selectors.hpp:56:5: note: in expansion of macro ‘ATTACH_VIRTUAL_CMP_OPERATIONS’ 56 | ATTACH_VIRTUAL_CMP_OPERATIONS(Selector) | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~ src/ast_def_macros.hpp:106:16: note: by ‘virtual bool Sass::SimpleSelector::operator!=(const Sass::SimpleSelector&) const’ 106 | virtual bool operator!=(const klass& rhs) const { return !(*this == rhs); }; \ | ^~~~~~~~ src/ast_selectors.hpp:139:5: note: in expansion of macro ‘ATTACH_VIRTUAL_CMP_OPERATIONS’ 139 | ATTACH_VIRTUAL_CMP_OPERATIONS(SimpleSelector); | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~ In file included from src/ast.hpp:1055: src/ast_selectors.hpp:137:18: warning: ‘virtual bool Sass::SimpleSelector::operator==(const Sass::CompoundSelector&) const’ was hidden [-Woverloaded-virtual=] 137 | virtual bool operator==(const CompoundSelector& rhs) const; | ^~~~~~~~ src/ast_def_macros.hpp:109:16: note: by ‘Sass::PlaceholderSelector::operator==’ 109 | virtual bool operator==(const klass& rhs) const; \ | ^~~~~~~~ src/ast_selectors.hpp:157:5: note: in expansion of macro ‘ATTACH_CMP_OPERATIONS’ 157 | ATTACH_CMP_OPERATIONS(PlaceholderSelector) | ^~~~~~~~~~~~~~~~~~~~~ src/ast_selectors.hpp:136:18: warning: ‘virtual bool Sass::SimpleSelector::operator==(const Sass::ComplexSelector&) const’ was hidden [-Woverloaded-virtual=] 136 | virtual bool operator==(const ComplexSelector& rhs) const; | ^~~~~~~~ src/ast_def_macros.hpp:109:16: note: by ‘Sass::PlaceholderSelector::operator==’ 109 | virtual bool operator==(const klass& rhs) const; \ | ^~~~~~~~ src/ast_selectors.hpp:157:5: note: in expansion of macro ‘ATTACH_CMP_OPERATIONS’ 157 | ATTACH_CMP_OPERATIONS(PlaceholderSelector) | ^~~~~~~~~~~~~~~~~~~~~ src/ast_selectors.hpp:135:18: warning: ‘virtual bool Sass::SimpleSelector::operator==(const Sass::SelectorList&) const’ was hidden [-Woverloaded-virtual=] 135 | virtual bool operator==(const SelectorList& rhs) const; | ^~~~~~~~ src/ast_def_macros.hpp:109:16: note: by ‘Sass::PlaceholderSelector::operator==’ 109 | virtual bool operator==(const klass& rhs) const; \ | ^~~~~~~~ src/ast_selectors.hpp:157:5: note: in expansion of macro ‘ATTACH_CMP_OPERATIONS’ 157 | ATTACH_CMP_OPERATIONS(PlaceholderSelector) | ^~~~~~~~~~~~~~~~~~~~~ src/ast_selectors.hpp:133:10: warning: ‘virtual bool Sass::SimpleSelector::operator==(const Sass::Selector&) const’ was hidden [-Woverloaded-virtual=] 133 | bool operator==(const Selector& rhs) const final override; | ^~~~~~~~ src/ast_def_macros.hpp:109:16: note: by ‘Sass::PlaceholderSelector::operator==’ 109 | virtual bool operator==(const klass& rhs) const; \ | ^~~~~~~~ src/ast_selectors.hpp:157:5: note: in expansion of macro ‘ATTACH_CMP_OPERATIONS’ 157 | ATTACH_CMP_OPERATIONS(PlaceholderSelector) | ^~~~~~~~~~~~~~~~~~~~~ src/ast_def_macros.hpp:106:16: warning: ‘virtual bool Sass::SimpleSelector::operator!=(const Sass::SimpleSelector&) const’ was hidden [-Woverloaded-virtual=] 106 | virtual bool operator!=(const klass& rhs) const { return !(*this == rhs); }; \ | ^~~~~~~~ src/ast_selectors.hpp:139:5: note: in expansion of macro ‘ATTACH_VIRTUAL_CMP_OPERATIONS’ 139 | ATTACH_VIRTUAL_CMP_OPERATIONS(SimpleSelector); | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~ src/ast_def_macros.hpp:110:16: note: by ‘virtual bool Sass::PlaceholderSelector::operator!=(const Sass::PlaceholderSelector&) const’ 110 | virtual bool operator!=(const klass& rhs) const { return !(*this == rhs); }; \ | ^~~~~~~~ src/ast_selectors.hpp:157:5: note: in expansion of macro ‘ATTACH_CMP_OPERATIONS’ 157 | ATTACH_CMP_OPERATIONS(PlaceholderSelector) | ^~~~~~~~~~~~~~~~~~~~~ src/ast_selectors.hpp:137:18: warning: ‘virtual bool Sass::SimpleSelector::operator==(const Sass::CompoundSelector&) const’ was hidden [-Woverloaded-virtual=] 137 | virtual bool operator==(const CompoundSelector& rhs) const; | ^~~~~~~~ src/ast_def_macros.hpp:109:16: note: by ‘Sass::TypeSelector::operator==’ 109 | virtual bool operator==(const klass& rhs) const; \ | ^~~~~~~~ src/ast_selectors.hpp:174:5: note: in expansion of macro ‘ATTACH_CMP_OPERATIONS’ 174 | ATTACH_CMP_OPERATIONS(TypeSelector) | ^~~~~~~~~~~~~~~~~~~~~ src/ast_selectors.hpp:136:18: warning: ‘virtual bool Sass::SimpleSelector::operator==(const Sass::ComplexSelector&) const’ was hidden [-Woverloaded-virtual=] 136 | virtual bool operator==(const ComplexSelector& rhs) const; | ^~~~~~~~ src/ast_def_macros.hpp:109:16: note: by ‘Sass::TypeSelector::operator==’ 109 | virtual bool operator==(const klass& rhs) const; \ | ^~~~~~~~ src/ast_selectors.hpp:174:5: note: in expansion of macro ‘ATTACH_CMP_OPERATIONS’ 174 | ATTACH_CMP_OPERATIONS(TypeSelector) | ^~~~~~~~~~~~~~~~~~~~~ src/ast_selectors.hpp:135:18: warning: ‘virtual bool Sass::SimpleSelector::operator==(const Sass::SelectorList&) const’ was hidden [-Woverloaded-virtual=] 135 | virtual bool operator==(const SelectorList& rhs) const; | ^~~~~~~~ src/ast_def_macros.hpp:109:16: note: by ‘Sass::TypeSelector::operator==’ 109 | virtual bool operator==(const klass& rhs) const; \ | ^~~~~~~~ src/ast_selectors.hpp:174:5: note: in expansion of macro ‘ATTACH_CMP_OPERATIONS’ 174 | ATTACH_CMP_OPERATIONS(TypeSelector) | ^~~~~~~~~~~~~~~~~~~~~ src/ast_selectors.hpp:133:10: warning: ‘virtual bool Sass::SimpleSelector::operator==(const Sass::Selector&) const’ was hidden [-Woverloaded-virtual=] 133 | bool operator==(const Selector& rhs) const final override; | ^~~~~~~~ src/ast_def_macros.hpp:109:16: note: by ‘Sass::TypeSelector::operator==’ 109 | virtual bool operator==(const klass& rhs) const; \ | ^~~~~~~~ src/ast_selectors.hpp:174:5: note: in expansion of macro ‘ATTACH_CMP_OPERATIONS’ 174 | ATTACH_CMP_OPERATIONS(TypeSelector) | ^~~~~~~~~~~~~~~~~~~~~ src/ast_def_macros.hpp:106:16: warning: ‘virtual bool Sass::SimpleSelector::operator!=(const Sass::SimpleSelector&) const’ was hidden [-Woverloaded-virtual=] 106 | virtual bool operator!=(const klass& rhs) const { return !(*this == rhs); }; \ | ^~~~~~~~ src/ast_selectors.hpp:139:5: note: in expansion of macro ‘ATTACH_VIRTUAL_CMP_OPERATIONS’ 139 | ATTACH_VIRTUAL_CMP_OPERATIONS(SimpleSelector); | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~ src/ast_def_macros.hpp:110:16: note: by ‘virtual bool Sass::TypeSelector::operator!=(const Sass::TypeSelector&) const’ 110 | virtual bool operator!=(const klass& rhs) const { return !(*this == rhs); }; \ | ^~~~~~~~ src/ast_selectors.hpp:174:5: note: in expansion of macro ‘ATTACH_CMP_OPERATIONS’ 174 | ATTACH_CMP_OPERATIONS(TypeSelector) | ^~~~~~~~~~~~~~~~~~~~~ src/ast_selectors.hpp:137:18: warning: ‘virtual bool Sass::SimpleSelector::operator==(const Sass::CompoundSelector&) const’ was hidden [-Woverloaded-virtual=] 137 | virtual bool operator==(const CompoundSelector& rhs) const; | ^~~~~~~~ src/ast_def_macros.hpp:109:16: note: by ‘Sass::ClassSelector::operator==’ 109 | virtual bool operator==(const klass& rhs) const; \ | ^~~~~~~~ src/ast_selectors.hpp:188:5: note: in expansion of macro ‘ATTACH_CMP_OPERATIONS’ 188 | ATTACH_CMP_OPERATIONS(ClassSelector) | ^~~~~~~~~~~~~~~~~~~~~ src/ast_selectors.hpp:136:18: warning: ‘virtual bool Sass::SimpleSelector::operator==(const Sass::ComplexSelector&) const’ was hidden [-Woverloaded-virtual=] 136 | virtual bool operator==(const ComplexSelector& rhs) const; | ^~~~~~~~ src/ast_def_macros.hpp:109:16: note: by ‘Sass::ClassSelector::operator==’ 109 | virtual bool operator==(const klass& rhs) const; \ | ^~~~~~~~ src/ast_selectors.hpp:188:5: note: in expansion of macro ‘ATTACH_CMP_OPERATIONS’ 188 | ATTACH_CMP_OPERATIONS(ClassSelector) | ^~~~~~~~~~~~~~~~~~~~~ src/ast_selectors.hpp:135:18: warning: ‘virtual bool Sass::SimpleSelector::operator==(const Sass::SelectorList&) const’ was hidden [-Woverloaded-virtual=] 135 | virtual bool operator==(const SelectorList& rhs) const; | ^~~~~~~~ src/ast_def_macros.hpp:109:16: note: by ‘Sass::ClassSelector::operator==’ 109 | virtual bool operator==(const klass& rhs) const; \ | ^~~~~~~~ src/ast_selectors.hpp:188:5: note: in expansion of macro ‘ATTACH_CMP_OPERATIONS’ 188 | ATTACH_CMP_OPERATIONS(ClassSelector) | ^~~~~~~~~~~~~~~~~~~~~ src/ast_selectors.hpp:133:10: warning: ‘virtual bool Sass::SimpleSelector::operator==(const Sass::Selector&) const’ was hidden [-Woverloaded-virtual=] 133 | bool operator==(const Selector& rhs) const final override; | ^~~~~~~~ src/ast_def_macros.hpp:109:16: note: by ‘Sass::ClassSelector::operator==’ 109 | virtual bool operator==(const klass& rhs) const; \ | ^~~~~~~~ src/ast_selectors.hpp:188:5: note: in expansion of macro ‘ATTACH_CMP_OPERATIONS’ 188 | ATTACH_CMP_OPERATIONS(ClassSelector) | ^~~~~~~~~~~~~~~~~~~~~ src/ast_def_macros.hpp:106:16: warning: ‘virtual bool Sass::SimpleSelector::operator!=(const Sass::SimpleSelector&) const’ was hidden [-Woverloaded-virtual=] 106 | virtual bool operator!=(const klass& rhs) const { return !(*this == rhs); }; \ | ^~~~~~~~ src/ast_selectors.hpp:139:5: note: in expansion of macro ‘ATTACH_VIRTUAL_CMP_OPERATIONS’ 139 | ATTACH_VIRTUAL_CMP_OPERATIONS(SimpleSelector); | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~ src/ast_def_macros.hpp:110:16: note: by ‘virtual bool Sass::ClassSelector::operator!=(const Sass::ClassSelector&) const’ 110 | virtual bool operator!=(const klass& rhs) const { return !(*this == rhs); }; \ | ^~~~~~~~ src/ast_selectors.hpp:188:5: note: in expansion of macro ‘ATTACH_CMP_OPERATIONS’ 188 | ATTACH_CMP_OPERATIONS(ClassSelector) | ^~~~~~~~~~~~~~~~~~~~~ src/ast_selectors.hpp:137:18: warning: ‘virtual bool Sass::SimpleSelector::operator==(const Sass::CompoundSelector&) const’ was hidden [-Woverloaded-virtual=] 137 | virtual bool operator==(const CompoundSelector& rhs) const; | ^~~~~~~~ src/ast_def_macros.hpp:109:16: note: by ‘Sass::IDSelector::operator==’ 109 | virtual bool operator==(const klass& rhs) const; \ | ^~~~~~~~ src/ast_selectors.hpp:204:5: note: in expansion of macro ‘ATTACH_CMP_OPERATIONS’ 204 | ATTACH_CMP_OPERATIONS(IDSelector) | ^~~~~~~~~~~~~~~~~~~~~ src/ast_selectors.hpp:136:18: warning: ‘virtual bool Sass::SimpleSelector::operator==(const Sass::ComplexSelector&) const’ was hidden [-Woverloaded-virtual=] 136 | virtual bool operator==(const ComplexSelector& rhs) const; | ^~~~~~~~ src/ast_def_macros.hpp:109:16: note: by ‘Sass::IDSelector::operator==’ 109 | virtual bool operator==(const klass& rhs) const; \ | ^~~~~~~~ src/ast_selectors.hpp:204:5: note: in expansion of macro ‘ATTACH_CMP_OPERATIONS’ 204 | ATTACH_CMP_OPERATIONS(IDSelector) | ^~~~~~~~~~~~~~~~~~~~~ src/ast_selectors.hpp:135:18: warning: ‘virtual bool Sass::SimpleSelector::operator==(const Sass::SelectorList&) const’ was hidden [-Woverloaded-virtual=] 135 | virtual bool operator==(const SelectorList& rhs) const; | ^~~~~~~~ src/ast_def_macros.hpp:109:16: note: by ‘Sass::IDSelector::operator==’ 109 | virtual bool operator==(const klass& rhs) const; \ | ^~~~~~~~ src/ast_selectors.hpp:204:5: note: in expansion of macro ‘ATTACH_CMP_OPERATIONS’ 204 | ATTACH_CMP_OPERATIONS(IDSelector) | ^~~~~~~~~~~~~~~~~~~~~ src/ast_selectors.hpp:133:10: warning: ‘virtual bool Sass::SimpleSelector::operator==(const Sass::Selector&) const’ was hidden [-Woverloaded-virtual=] 133 | bool operator==(const Selector& rhs) const final override; | ^~~~~~~~ src/ast_def_macros.hpp:109:16: note: by ‘Sass::IDSelector::operator==’ 109 | virtual bool operator==(const klass& rhs) const; \ | ^~~~~~~~ src/ast_selectors.hpp:204:5: note: in expansion of macro ‘ATTACH_CMP_OPERATIONS’ 204 | ATTACH_CMP_OPERATIONS(IDSelector) | ^~~~~~~~~~~~~~~~~~~~~ src/ast_def_macros.hpp:106:16: warning: ‘virtual bool Sass::SimpleSelector::operator!=(const Sass::SimpleSelector&) const’ was hidden [-Woverloaded-virtual=] 106 | virtual bool operator!=(const klass& rhs) const { return !(*this == rhs); }; \ | ^~~~~~~~ src/ast_selectors.hpp:139:5: note: in expansion of macro ‘ATTACH_VIRTUAL_CMP_OPERATIONS’ 139 | ATTACH_VIRTUAL_CMP_OPERATIONS(SimpleSelector); | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~ src/ast_def_macros.hpp:110:16: note: by ‘virtual bool Sass::IDSelector::operator!=(const Sass::IDSelector&) const’ 110 | virtual bool operator!=(const klass& rhs) const { return !(*this == rhs); }; \ | ^~~~~~~~ src/ast_selectors.hpp:204:5: note: in expansion of macro ‘ATTACH_CMP_OPERATIONS’ 204 | ATTACH_CMP_OPERATIONS(IDSelector) | ^~~~~~~~~~~~~~~~~~~~~ src/ast_selectors.hpp:137:18: warning: ‘virtual bool Sass::SimpleSelector::operator==(const Sass::CompoundSelector&) const’ was hidden [-Woverloaded-virtual=] 137 | virtual bool operator==(const CompoundSelector& rhs) const; | ^~~~~~~~ src/ast_def_macros.hpp:109:16: note: by ‘Sass::AttributeSelector::operator==’ 109 | virtual bool operator==(const klass& rhs) const; \ | ^~~~~~~~ src/ast_selectors.hpp:223:5: note: in expansion of macro ‘ATTACH_CMP_OPERATIONS’ 223 | ATTACH_CMP_OPERATIONS(AttributeSelector) | ^~~~~~~~~~~~~~~~~~~~~ src/ast_selectors.hpp:136:18: warning: ‘virtual bool Sass::SimpleSelector::operator==(const Sass::ComplexSelector&) const’ was hidden [-Woverloaded-virtual=] 136 | virtual bool operator==(const ComplexSelector& rhs) const; | ^~~~~~~~ src/ast_def_macros.hpp:109:16: note: by ‘Sass::AttributeSelector::operator==’ 109 | virtual bool operator==(const klass& rhs) const; \ | ^~~~~~~~ src/ast_selectors.hpp:223:5: note: in expansion of macro ‘ATTACH_CMP_OPERATIONS’ 223 | ATTACH_CMP_OPERATIONS(AttributeSelector) | ^~~~~~~~~~~~~~~~~~~~~ src/ast_selectors.hpp:135:18: warning: ‘virtual bool Sass::SimpleSelector::operator==(const Sass::SelectorList&) const’ was hidden [-Woverloaded-virtual=] 135 | virtual bool operator==(const SelectorList& rhs) const; | ^~~~~~~~ src/ast_def_macros.hpp:109:16: note: by ‘Sass::AttributeSelector::operator==’ 109 | virtual bool operator==(const klass& rhs) const; \ | ^~~~~~~~ src/ast_selectors.hpp:223:5: note: in expansion of macro ‘ATTACH_CMP_OPERATIONS’ 223 | ATTACH_CMP_OPERATIONS(AttributeSelector) | ^~~~~~~~~~~~~~~~~~~~~ src/ast_selectors.hpp:133:10: warning: ‘virtual bool Sass::SimpleSelector::operator==(const Sass::Selector&) const’ was hidden [-Woverloaded-virtual=] 133 | bool operator==(const Selector& rhs) const final override; | ^~~~~~~~ src/ast_def_macros.hpp:109:16: note: by ‘Sass::AttributeSelector::operator==’ 109 | virtual bool operator==(const klass& rhs) const; \ | ^~~~~~~~ src/ast_selectors.hpp:223:5: note: in expansion of macro ‘ATTACH_CMP_OPERATIONS’ 223 | ATTACH_CMP_OPERATIONS(AttributeSelector) | ^~~~~~~~~~~~~~~~~~~~~ src/ast_def_macros.hpp:106:16: warning: ‘virtual bool Sass::SimpleSelector::operator!=(const Sass::SimpleSelector&) const’ was hidden [-Woverloaded-virtual=] 106 | virtual bool operator!=(const klass& rhs) const { return !(*this == rhs); }; \ | ^~~~~~~~ src/ast_selectors.hpp:139:5: note: in expansion of macro ‘ATTACH_VIRTUAL_CMP_OPERATIONS’ 139 | ATTACH_VIRTUAL_CMP_OPERATIONS(SimpleSelector); | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~ src/ast_def_macros.hpp:110:16: note: by ‘virtual bool Sass::AttributeSelector::operator!=(const Sass::AttributeSelector&) const’ 110 | virtual bool operator!=(const klass& rhs) const { return !(*this == rhs); }; \ | ^~~~~~~~ src/ast_selectors.hpp:223:5: note: in expansion of macro ‘ATTACH_CMP_OPERATIONS’ 223 | ATTACH_CMP_OPERATIONS(AttributeSelector) | ^~~~~~~~~~~~~~~~~~~~~ src/ast_def_macros.hpp:106:16: warning: ‘virtual bool Sass::Selector::operator!=(const Sass::Selector&) const’ was hidden [-Woverloaded-virtual=] 106 | virtual bool operator!=(const klass& rhs) const { return !(*this == rhs); }; \ | ^~~~~~~~ src/ast_selectors.hpp:56:5: note: in expansion of macro ‘ATTACH_VIRTUAL_CMP_OPERATIONS’ 56 | ATTACH_VIRTUAL_CMP_OPERATIONS(Selector) | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~ src/ast_def_macros.hpp:110:16: note: by ‘virtual bool Sass::ComplexSelector::operator!=(const Sass::ComplexSelector&) const’ 110 | virtual bool operator!=(const klass& rhs) const { return !(*this == rhs); }; \ | ^~~~~~~~ src/ast_selectors.hpp:310:5: note: in expansion of macro ‘ATTACH_CMP_OPERATIONS’ 310 | ATTACH_CMP_OPERATIONS(ComplexSelector) | ^~~~~~~~~~~~~~~~~~~~~ src/ast_def_macros.hpp:106:16: warning: ‘virtual bool Sass::Selector::operator!=(const Sass::Selector&) const’ was hidden [-Woverloaded-virtual=] 106 | virtual bool operator!=(const klass& rhs) const { return !(*this == rhs); }; \ | ^~~~~~~~ src/ast_selectors.hpp:56:5: note: in expansion of macro ‘ATTACH_VIRTUAL_CMP_OPERATIONS’ 56 | ATTACH_VIRTUAL_CMP_OPERATIONS(Selector) | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~ src/ast_def_macros.hpp:106:16: note: by ‘virtual bool Sass::SelectorComponent::operator!=(const Sass::SelectorComponent&) const’ 106 | virtual bool operator!=(const klass& rhs) const { return !(*this == rhs); }; \ | ^~~~~~~~ src/ast_selectors.hpp:349:5: note: in expansion of macro ‘ATTACH_VIRTUAL_CMP_OPERATIONS’ 349 | ATTACH_VIRTUAL_CMP_OPERATIONS(SelectorComponent); | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~ src/ast_def_macros.hpp:106:16: warning: ‘virtual bool Sass::SelectorComponent::operator!=(const Sass::SelectorComponent&) const’ was hidden [-Woverloaded-virtual=] 106 | virtual bool operator!=(const klass& rhs) const { return !(*this == rhs); }; \ | ^~~~~~~~ src/ast_selectors.hpp:349:5: note: in expansion of macro ‘ATTACH_VIRTUAL_CMP_OPERATIONS’ 349 | ATTACH_VIRTUAL_CMP_OPERATIONS(SelectorComponent); | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~ src/ast_def_macros.hpp:110:16: note: by ‘virtual bool Sass::SelectorCombinator::operator!=(const Sass::SelectorCombinator&) const’ 110 | virtual bool operator!=(const klass& rhs) const { return !(*this == rhs); }; \ | ^~~~~~~~ src/ast_selectors.hpp:407:5: note: in expansion of macro ‘ATTACH_CMP_OPERATIONS’ 407 | ATTACH_CMP_OPERATIONS(SelectorCombinator) | ^~~~~~~~~~~~~~~~~~~~~ In file included from src/ast.hpp:18: src/operation.hpp:206:7: warning: ‘T Sass::Operation_CRTP::operator()(Sass::SelectorCombinator*) [with T = Sass::Expression*; D = Sass::Eval]’ was hidden [-Woverloaded-virtual=] 206 | T operator()(SelectorCombinator* x) { return static_cast(this)->fallback(x); } | ^~~~~~~~ src/eval.hpp:96:17: note: by ‘Sass::Eval::operator()’ 96 | Expression* operator()(Parent_Reference*); | ^~~~~~~~ src/operation.hpp:194:7: warning: ‘T Sass::Operation_CRTP::operator()(Sass::Parameters*) [with T = Sass::Expression*; D = Sass::Eval]’ was hidden [-Woverloaded-virtual=] 194 | T operator()(Parameters* x) { return static_cast(this)->fallback(x); } | ^~~~~~~~ src/eval.hpp:96:17: note: by ‘Sass::Eval::operator()’ 96 | Expression* operator()(Parent_Reference*); | ^~~~~~~~ src/operation.hpp:193:7: warning: ‘T Sass::Operation_CRTP::operator()(Sass::Parameter*) [with T = Sass::Expression*; D = Sass::Eval]’ was hidden [-Woverloaded-virtual=] 193 | T operator()(Parameter* x) { return static_cast(this)->fallback(x); } | ^~~~~~~~ src/eval.hpp:96:17: note: by ‘Sass::Eval::operator()’ 96 | Expression* operator()(Parent_Reference*); | ^~~~~~~~ src/operation.hpp:183:7: warning: ‘T Sass::Operation_CRTP::operator()(Sass::SupportsCondition*) [with T = Sass::Expression*; D = Sass::Eval]’ was hidden [-Woverloaded-virtual=] 183 | T operator()(SupportsCondition* x) { return static_cast(this)->fallback(x); } | ^~~~~~~~ src/eval.hpp:96:17: note: by ‘Sass::Eval::operator()’ 96 | Expression* operator()(Parent_Reference*); | ^~~~~~~~ src/operation.hpp:176:7: warning: ‘T Sass::Operation_CRTP::operator()(Sass::Color*) [with T = Sass::Expression*; D = Sass::Eval]’ was hidden [-Woverloaded-virtual=] 176 | T operator()(Color* x) { return static_cast(this)->fallback(x); } | ^~~~~~~~ src/eval.hpp:96:17: note: by ‘Sass::Eval::operator()’ 96 | Expression* operator()(Parent_Reference*); | ^~~~~~~~ src/operation.hpp:173:7: warning: ‘T Sass::Operation_CRTP::operator()(Sass::Custom_Error*) [with T = Sass::Expression*; D = Sass::Eval]’ was hidden [-Woverloaded-virtual=] 173 | T operator()(Custom_Error* x) { return static_cast(this)->fallback(x); } | ^~~~~~~~ src/eval.hpp:96:17: note: by ‘Sass::Eval::operator()’ 96 | Expression* operator()(Parent_Reference*); | ^~~~~~~~ src/operation.hpp:172:7: warning: ‘T Sass::Operation_CRTP::operator()(Sass::Custom_Warning*) [with T = Sass::Expression*; D = Sass::Eval]’ was hidden [-Woverloaded-virtual=] 172 | T operator()(Custom_Warning* x) { return static_cast(this)->fallback(x); } | ^~~~~~~~ src/eval.hpp:96:17: note: by ‘Sass::Eval::operator()’ 96 | Expression* operator()(Parent_Reference*); | ^~~~~~~~ src/operation.hpp:168:7: warning: ‘T Sass::Operation_CRTP::operator()(Sass::Function*) [with T = Sass::Expression*; D = Sass::Eval]’ was hidden [-Woverloaded-virtual=] 168 | T operator()(Function* x) { return static_cast(this)->fallback(x); } | ^~~~~~~~ src/eval.hpp:96:17: note: by ‘Sass::Eval::operator()’ 96 | Expression* operator()(Parent_Reference*); | ^~~~~~~~ src/operation.hpp:163:7: warning: ‘T Sass::Operation_CRTP::operator()(Sass::Mixin_Call*) [with T = Sass::Expression*; D = Sass::Eval]’ was hidden [-Woverloaded-virtual=] 163 | T operator()(Mixin_Call* x) { return static_cast(this)->fallback(x); } | ^~~~~~~~ src/eval.hpp:96:17: note: by ‘Sass::Eval::operator()’ 96 | Expression* operator()(Parent_Reference*); | ^~~~~~~~ src/operation.hpp:162:7: warning: ‘T Sass::Operation_CRTP::operator()(Sass::Definition*) [with T = Sass::Expression*; D = Sass::Eval]’ was hidden [-Woverloaded-virtual=] 162 | T operator()(Definition* x) { return static_cast(this)->fallback(x); } | ^~~~~~~~ src/eval.hpp:96:17: note: by ‘Sass::Eval::operator()’ 96 | Expression* operator()(Parent_Reference*); | ^~~~~~~~ src/operation.hpp:161:7: warning: ‘T Sass::Operation_CRTP::operator()(Sass::ExtendRule*) [with T = Sass::Expression*; D = Sass::Eval]’ was hidden [-Woverloaded-virtual=] 161 | T operator()(ExtendRule* x) { return static_cast(this)->fallback(x); } | ^~~~~~~~ src/eval.hpp:96:17: note: by ‘Sass::Eval::operator()’ 96 | Expression* operator()(Parent_Reference*); | ^~~~~~~~ src/operation.hpp:160:7: warning: ‘T Sass::Operation_CRTP::operator()(Sass::Content*) [with T = Sass::Expression*; D = Sass::Eval]’ was hidden [-Woverloaded-virtual=] 160 | T operator()(Content* x) { return static_cast(this)->fallback(x); } | ^~~~~~~~ src/eval.hpp:96:17: note: by ‘Sass::Eval::operator()’ 96 | Expression* operator()(Parent_Reference*); | ^~~~~~~~ src/operation.hpp:150:7: warning: ‘T Sass::Operation_CRTP::operator()(Sass::Import_Stub*) [with T = Sass::Expression*; D = Sass::Eval]’ was hidden [-Woverloaded-virtual=] 150 | T operator()(Import_Stub* x) { return static_cast(this)->fallback(x); } | ^~~~~~~~ src/eval.hpp:96:17: note: by ‘Sass::Eval::operator()’ 96 | Expression* operator()(Parent_Reference*); | ^~~~~~~~ src/operation.hpp:149:7: warning: ‘T Sass::Operation_CRTP::operator()(Sass::Import*) [with T = Sass::Expression*; D = Sass::Eval]’ was hidden [-Woverloaded-virtual=] 149 | T operator()(Import* x) { return static_cast(this)->fallback(x); } | ^~~~~~~~ src/eval.hpp:96:17: note: by ‘Sass::Eval::operator()’ 96 | Expression* operator()(Parent_Reference*); | ^~~~~~~~ src/operation.hpp:147:7: warning: ‘T Sass::Operation_CRTP::operator()(Sass::Declaration*) [with T = Sass::Expression*; D = Sass::Eval]’ was hidden [-Woverloaded-virtual=] 147 | T operator()(Declaration* x) { return static_cast(this)->fallback(x); } | ^~~~~~~~ src/eval.hpp:96:17: note: by ‘Sass::Eval::operator()’ 96 | Expression* operator()(Parent_Reference*); | ^~~~~~~~ src/operation.hpp:146:7: warning: ‘T Sass::Operation_CRTP::operator()(Sass::Keyframe_Rule*) [with T = Sass::Expression*; D = Sass::Eval]’ was hidden [-Woverloaded-virtual=] 146 | T operator()(Keyframe_Rule* x) { return static_cast(this)->fallback(x); } | ^~~~~~~~ src/eval.hpp:96:17: note: by ‘Sass::Eval::operator()’ 96 | Expression* operator()(Parent_Reference*); | ^~~~~~~~ src/operation.hpp:145:7: warning: ‘T Sass::Operation_CRTP::operator()(Sass::AtRule*) [with T = Sass::Expression*; D = Sass::Eval]’ was hidden [-Woverloaded-virtual=] 145 | T operator()(AtRule* x) { return static_cast(this)->fallback(x); } | ^~~~~~~~ src/eval.hpp:96:17: note: by ‘Sass::Eval::operator()’ 96 | Expression* operator()(Parent_Reference*); | ^~~~~~~~ src/operation.hpp:144:7: warning: ‘T Sass::Operation_CRTP::operator()(Sass::AtRootRule*) [with T = Sass::Expression*; D = Sass::Eval]’ was hidden [-Woverloaded-virtual=] 144 | T operator()(AtRootRule* x) { return static_cast(this)->fallback(x); } | ^~~~~~~~ src/eval.hpp:96:17: note: by ‘Sass::Eval::operator()’ 96 | Expression* operator()(Parent_Reference*); | ^~~~~~~~ src/operation.hpp:143:7: warning: ‘T Sass::Operation_CRTP::operator()(Sass::CssMediaQuery*) [with T = Sass::Expression*; D = Sass::Eval]’ was hidden [-Woverloaded-virtual=] 143 | T operator()(CssMediaQuery* x) { return static_cast(this)->fallback(x); } | ^~~~~~~~ src/eval.hpp:96:17: note: by ‘Sass::Eval::operator()’ 96 | Expression* operator()(Parent_Reference*); | ^~~~~~~~ src/operation.hpp:142:7: warning: ‘T Sass::Operation_CRTP::operator()(Sass::CssMediaRule*) [with T = Sass::Expression*; D = Sass::Eval]’ was hidden [-Woverloaded-virtual=] 142 | T operator()(CssMediaRule* x) { return static_cast(this)->fallback(x); } | ^~~~~~~~ src/eval.hpp:96:17: note: by ‘Sass::Eval::operator()’ 96 | Expression* operator()(Parent_Reference*); | ^~~~~~~~ src/operation.hpp:141:7: warning: ‘T Sass::Operation_CRTP::operator()(Sass::MediaRule*) [with T = Sass::Expression*; D = Sass::Eval]’ was hidden [-Woverloaded-virtual=] 141 | T operator()(MediaRule* x) { return static_cast(this)->fallback(x); } | ^~~~~~~~ src/eval.hpp:96:17: note: by ‘Sass::Eval::operator()’ 96 | Expression* operator()(Parent_Reference*); | ^~~~~~~~ src/operation.hpp:140:7: warning: ‘T Sass::Operation_CRTP::operator()(Sass::SupportsRule*) [with T = Sass::Expression*; D = Sass::Eval]’ was hidden [-Woverloaded-virtual=] 140 | T operator()(SupportsRule* x) { return static_cast(this)->fallback(x); } | ^~~~~~~~ src/eval.hpp:96:17: note: by ‘Sass::Eval::operator()’ 96 | Expression* operator()(Parent_Reference*); | ^~~~~~~~ src/operation.hpp:139:7: warning: ‘T Sass::Operation_CRTP::operator()(Sass::Trace*) [with T = Sass::Expression*; D = Sass::Eval]’ was hidden [-Woverloaded-virtual=] 139 | T operator()(Trace* x) { return static_cast(this)->fallback(x); } | ^~~~~~~~ src/eval.hpp:96:17: note: by ‘Sass::Eval::operator()’ 96 | Expression* operator()(Parent_Reference*); | ^~~~~~~~ src/operation.hpp:138:7: warning: ‘T Sass::Operation_CRTP::operator()(Sass::Bubble*) [with T = Sass::Expression*; D = Sass::Eval]’ was hidden [-Woverloaded-virtual=] 138 | T operator()(Bubble* x) { return static_cast(this)->fallback(x); } | ^~~~~~~~ src/eval.hpp:96:17: note: by ‘Sass::Eval::operator()’ 96 | Expression* operator()(Parent_Reference*); | ^~~~~~~~ src/operation.hpp:137:7: warning: ‘T Sass::Operation_CRTP::operator()(Sass::StyleRule*) [with T = Sass::Expression*; D = Sass::Eval]’ was hidden [-Woverloaded-virtual=] 137 | T operator()(StyleRule* x) { return static_cast(this)->fallback(x); } | ^~~~~~~~ src/eval.hpp:96:17: note: by ‘Sass::Eval::operator()’ 96 | Expression* operator()(Parent_Reference*); | ^~~~~~~~ src/operation.hpp:134:7: warning: ‘T Sass::Operation_CRTP::operator()(Sass::AST_Node*) [with T = Sass::Expression*; D = Sass::Eval]’ was hidden [-Woverloaded-virtual=] 134 | T operator()(AST_Node* x) { return static_cast(this)->fallback(x); } | ^~~~~~~~ src/eval.hpp:96:17: note: by ‘Sass::Eval::operator()’ 96 | Expression* operator()(Parent_Reference*); | ^~~~~~~~ g++ -std=gnu++17 -Wall -O2 -std=c++11 -I ./include -fPIC -c -o src/sass_context.o src/sass_context.cpp In file included from src/sass_context.cpp:4: src/ast.hpp:90:18: warning: ‘virtual bool Sass::AST_Node::operator==(const Sass::AST_Node&) const’ was hidden [-Woverloaded-virtual=] 90 | virtual bool operator== (const AST_Node& rhs) const { | ^~~~~~~~ src/ast.hpp:165:18: note: by ‘virtual bool Sass::Expression::operator==(const Sass::Expression&) const’ 165 | virtual bool operator== (const Expression& rhs) const { return false; } | ^~~~~~~~ src/ast.hpp:96:18: warning: ‘virtual bool Sass::AST_Node::operator!=(const Sass::AST_Node&) const’ was hidden [-Woverloaded-virtual=] 96 | virtual bool operator!= (const AST_Node& rhs) const { | ^~~~~~~~ src/ast.hpp:167:17: note: by ‘bool Sass::Expression::operator!=(const Sass::Expression&) const’ 167 | inline bool operator!=(const Expression& rhs) const { return !(rhs == *this); } | ^~~~~~~~ src/ast.hpp:90:18: warning: ‘virtual bool Sass::AST_Node::operator==(const Sass::AST_Node&) const’ was hidden [-Woverloaded-virtual=] 90 | virtual bool operator== (const AST_Node& rhs) const { | ^~~~~~~~ src/ast.hpp:908:10: note: by ‘bool Sass::CssMediaRule::operator==(const Sass::CssMediaRule&) const’ 908 | bool operator== (const CssMediaRule& rhs) const { | ^~~~~~~~ src/ast.hpp:96:18: warning: ‘virtual bool Sass::AST_Node::operator!=(const Sass::AST_Node&) const’ was hidden [-Woverloaded-virtual=] 96 | virtual bool operator!= (const AST_Node& rhs) const { | ^~~~~~~~ src/ast.hpp:911:10: note: by ‘bool Sass::CssMediaRule::operator!=(const Sass::CssMediaRule&) const’ 911 | bool operator!=(const CssMediaRule& rhs) const { | ^~~~~~~~ src/ast.hpp:90:18: warning: ‘virtual bool Sass::AST_Node::operator==(const Sass::AST_Node&) const’ was hidden [-Woverloaded-virtual=] 90 | virtual bool operator== (const AST_Node& rhs) const { | ^~~~~~~~ src/ast.hpp:939:10: note: by ‘bool Sass::CssMediaQuery::operator==(const Sass::CssMediaQuery&) const’ 939 | bool operator== (const CssMediaQuery& rhs) const; | ^~~~~~~~ src/ast.hpp:96:18: warning: ‘virtual bool Sass::AST_Node::operator!=(const Sass::AST_Node&) const’ was hidden [-Woverloaded-virtual=] 96 | virtual bool operator!= (const AST_Node& rhs) const { | ^~~~~~~~ src/ast.hpp:940:10: note: by ‘bool Sass::CssMediaQuery::operator!=(const Sass::CssMediaQuery&) const’ 940 | bool operator!=(const CssMediaQuery& rhs) const { | ^~~~~~~~ src/ast.hpp:165:18: warning: ‘virtual bool Sass::Expression::operator==(const Sass::Expression&) const’ was hidden [-Woverloaded-virtual=] 165 | virtual bool operator== (const Expression& rhs) const { return false; } | ^~~~~~~~ In file included from src/ast.hpp:14: src/ast_def_macros.hpp:105:16: note: by ‘virtual bool Sass::Selector::operator==(const Sass::Selector&) const’ 105 | virtual bool operator==(const klass& rhs) const = 0; \ | ^~~~~~~~ src/ast_selectors.hpp:56:5: note: in expansion of macro ‘ATTACH_VIRTUAL_CMP_OPERATIONS’ 56 | ATTACH_VIRTUAL_CMP_OPERATIONS(Selector) | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~ src/ast.hpp:96:18: warning: ‘virtual bool Sass::AST_Node::operator!=(const Sass::AST_Node&) const’ was hidden [-Woverloaded-virtual=] 96 | virtual bool operator!= (const AST_Node& rhs) const { | ^~~~~~~~ src/ast_def_macros.hpp:106:16: note: by ‘virtual bool Sass::Selector::operator!=(const Sass::Selector&) const’ 106 | virtual bool operator!=(const klass& rhs) const { return !(*this == rhs); }; \ | ^~~~~~~~ src/ast_selectors.hpp:56:5: note: in expansion of macro ‘ATTACH_VIRTUAL_CMP_OPERATIONS’ 56 | ATTACH_VIRTUAL_CMP_OPERATIONS(Selector) | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~ src/ast_def_macros.hpp:106:16: warning: ‘virtual bool Sass::Selector::operator!=(const Sass::Selector&) const’ was hidden [-Woverloaded-virtual=] 106 | virtual bool operator!=(const klass& rhs) const { return !(*this == rhs); }; \ | ^~~~~~~~ src/ast_selectors.hpp:56:5: note: in expansion of macro ‘ATTACH_VIRTUAL_CMP_OPERATIONS’ 56 | ATTACH_VIRTUAL_CMP_OPERATIONS(Selector) | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~ src/ast_def_macros.hpp:106:16: note: by ‘virtual bool Sass::SimpleSelector::operator!=(const Sass::SimpleSelector&) const’ 106 | virtual bool operator!=(const klass& rhs) const { return !(*this == rhs); }; \ | ^~~~~~~~ src/ast_selectors.hpp:139:5: note: in expansion of macro ‘ATTACH_VIRTUAL_CMP_OPERATIONS’ 139 | ATTACH_VIRTUAL_CMP_OPERATIONS(SimpleSelector); | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~ In file included from src/ast.hpp:1055: src/ast_selectors.hpp:137:18: warning: ‘virtual bool Sass::SimpleSelector::operator==(const Sass::CompoundSelector&) const’ was hidden [-Woverloaded-virtual=] 137 | virtual bool operator==(const CompoundSelector& rhs) const; | ^~~~~~~~ src/ast_def_macros.hpp:109:16: note: by ‘Sass::PlaceholderSelector::operator==’ 109 | virtual bool operator==(const klass& rhs) const; \ | ^~~~~~~~ src/ast_selectors.hpp:157:5: note: in expansion of macro ‘ATTACH_CMP_OPERATIONS’ 157 | ATTACH_CMP_OPERATIONS(PlaceholderSelector) | ^~~~~~~~~~~~~~~~~~~~~ src/ast_selectors.hpp:136:18: warning: ‘virtual bool Sass::SimpleSelector::operator==(const Sass::ComplexSelector&) const’ was hidden [-Woverloaded-virtual=] 136 | virtual bool operator==(const ComplexSelector& rhs) const; | ^~~~~~~~ src/ast_def_macros.hpp:109:16: note: by ‘Sass::PlaceholderSelector::operator==’ 109 | virtual bool operator==(const klass& rhs) const; \ | ^~~~~~~~ src/ast_selectors.hpp:157:5: note: in expansion of macro ‘ATTACH_CMP_OPERATIONS’ 157 | ATTACH_CMP_OPERATIONS(PlaceholderSelector) | ^~~~~~~~~~~~~~~~~~~~~ src/ast_selectors.hpp:135:18: warning: ‘virtual bool Sass::SimpleSelector::operator==(const Sass::SelectorList&) const’ was hidden [-Woverloaded-virtual=] 135 | virtual bool operator==(const SelectorList& rhs) const; | ^~~~~~~~ src/ast_def_macros.hpp:109:16: note: by ‘Sass::PlaceholderSelector::operator==’ 109 | virtual bool operator==(const klass& rhs) const; \ | ^~~~~~~~ src/ast_selectors.hpp:157:5: note: in expansion of macro ‘ATTACH_CMP_OPERATIONS’ 157 | ATTACH_CMP_OPERATIONS(PlaceholderSelector) | ^~~~~~~~~~~~~~~~~~~~~ src/ast_selectors.hpp:133:10: warning: ‘virtual bool Sass::SimpleSelector::operator==(const Sass::Selector&) const’ was hidden [-Woverloaded-virtual=] 133 | bool operator==(const Selector& rhs) const final override; | ^~~~~~~~ src/ast_def_macros.hpp:109:16: note: by ‘Sass::PlaceholderSelector::operator==’ 109 | virtual bool operator==(const klass& rhs) const; \ | ^~~~~~~~ src/ast_selectors.hpp:157:5: note: in expansion of macro ‘ATTACH_CMP_OPERATIONS’ 157 | ATTACH_CMP_OPERATIONS(PlaceholderSelector) | ^~~~~~~~~~~~~~~~~~~~~ src/ast_def_macros.hpp:106:16: warning: ‘virtual bool Sass::SimpleSelector::operator!=(const Sass::SimpleSelector&) const’ was hidden [-Woverloaded-virtual=] 106 | virtual bool operator!=(const klass& rhs) const { return !(*this == rhs); }; \ | ^~~~~~~~ src/ast_selectors.hpp:139:5: note: in expansion of macro ‘ATTACH_VIRTUAL_CMP_OPERATIONS’ 139 | ATTACH_VIRTUAL_CMP_OPERATIONS(SimpleSelector); | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~ src/ast_def_macros.hpp:110:16: note: by ‘virtual bool Sass::PlaceholderSelector::operator!=(const Sass::PlaceholderSelector&) const’ 110 | virtual bool operator!=(const klass& rhs) const { return !(*this == rhs); }; \ | ^~~~~~~~ src/ast_selectors.hpp:157:5: note: in expansion of macro ‘ATTACH_CMP_OPERATIONS’ 157 | ATTACH_CMP_OPERATIONS(PlaceholderSelector) | ^~~~~~~~~~~~~~~~~~~~~ src/ast_selectors.hpp:137:18: warning: ‘virtual bool Sass::SimpleSelector::operator==(const Sass::CompoundSelector&) const’ was hidden [-Woverloaded-virtual=] 137 | virtual bool operator==(const CompoundSelector& rhs) const; | ^~~~~~~~ src/ast_def_macros.hpp:109:16: note: by ‘Sass::TypeSelector::operator==’ 109 | virtual bool operator==(const klass& rhs) const; \ | ^~~~~~~~ src/ast_selectors.hpp:174:5: note: in expansion of macro ‘ATTACH_CMP_OPERATIONS’ 174 | ATTACH_CMP_OPERATIONS(TypeSelector) | ^~~~~~~~~~~~~~~~~~~~~ src/ast_selectors.hpp:136:18: warning: ‘virtual bool Sass::SimpleSelector::operator==(const Sass::ComplexSelector&) const’ was hidden [-Woverloaded-virtual=] 136 | virtual bool operator==(const ComplexSelector& rhs) const; | ^~~~~~~~ src/ast_def_macros.hpp:109:16: note: by ‘Sass::TypeSelector::operator==’ 109 | virtual bool operator==(const klass& rhs) const; \ | ^~~~~~~~ src/ast_selectors.hpp:174:5: note: in expansion of macro ‘ATTACH_CMP_OPERATIONS’ 174 | ATTACH_CMP_OPERATIONS(TypeSelector) | ^~~~~~~~~~~~~~~~~~~~~ src/ast_selectors.hpp:135:18: warning: ‘virtual bool Sass::SimpleSelector::operator==(const Sass::SelectorList&) const’ was hidden [-Woverloaded-virtual=] 135 | virtual bool operator==(const SelectorList& rhs) const; | ^~~~~~~~ src/ast_def_macros.hpp:109:16: note: by ‘Sass::TypeSelector::operator==’ 109 | virtual bool operator==(const klass& rhs) const; \ | ^~~~~~~~ src/ast_selectors.hpp:174:5: note: in expansion of macro ‘ATTACH_CMP_OPERATIONS’ 174 | ATTACH_CMP_OPERATIONS(TypeSelector) | ^~~~~~~~~~~~~~~~~~~~~ src/ast_selectors.hpp:133:10: warning: ‘virtual bool Sass::SimpleSelector::operator==(const Sass::Selector&) const’ was hidden [-Woverloaded-virtual=] 133 | bool operator==(const Selector& rhs) const final override; | ^~~~~~~~ src/ast_def_macros.hpp:109:16: note: by ‘Sass::TypeSelector::operator==’ 109 | virtual bool operator==(const klass& rhs) const; \ | ^~~~~~~~ src/ast_selectors.hpp:174:5: note: in expansion of macro ‘ATTACH_CMP_OPERATIONS’ 174 | ATTACH_CMP_OPERATIONS(TypeSelector) | ^~~~~~~~~~~~~~~~~~~~~ src/ast_def_macros.hpp:106:16: warning: ‘virtual bool Sass::SimpleSelector::operator!=(const Sass::SimpleSelector&) const’ was hidden [-Woverloaded-virtual=] 106 | virtual bool operator!=(const klass& rhs) const { return !(*this == rhs); }; \ | ^~~~~~~~ src/ast_selectors.hpp:139:5: note: in expansion of macro ‘ATTACH_VIRTUAL_CMP_OPERATIONS’ 139 | ATTACH_VIRTUAL_CMP_OPERATIONS(SimpleSelector); | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~ src/ast_def_macros.hpp:110:16: note: by ‘virtual bool Sass::TypeSelector::operator!=(const Sass::TypeSelector&) const’ 110 | virtual bool operator!=(const klass& rhs) const { return !(*this == rhs); }; \ | ^~~~~~~~ src/ast_selectors.hpp:174:5: note: in expansion of macro ‘ATTACH_CMP_OPERATIONS’ 174 | ATTACH_CMP_OPERATIONS(TypeSelector) | ^~~~~~~~~~~~~~~~~~~~~ src/ast_selectors.hpp:137:18: warning: ‘virtual bool Sass::SimpleSelector::operator==(const Sass::CompoundSelector&) const’ was hidden [-Woverloaded-virtual=] 137 | virtual bool operator==(const CompoundSelector& rhs) const; | ^~~~~~~~ src/ast_def_macros.hpp:109:16: note: by ‘Sass::ClassSelector::operator==’ 109 | virtual bool operator==(const klass& rhs) const; \ | ^~~~~~~~ src/ast_selectors.hpp:188:5: note: in expansion of macro ‘ATTACH_CMP_OPERATIONS’ 188 | ATTACH_CMP_OPERATIONS(ClassSelector) | ^~~~~~~~~~~~~~~~~~~~~ src/ast_selectors.hpp:136:18: warning: ‘virtual bool Sass::SimpleSelector::operator==(const Sass::ComplexSelector&) const’ was hidden [-Woverloaded-virtual=] 136 | virtual bool operator==(const ComplexSelector& rhs) const; | ^~~~~~~~ src/ast_def_macros.hpp:109:16: note: by ‘Sass::ClassSelector::operator==’ 109 | virtual bool operator==(const klass& rhs) const; \ | ^~~~~~~~ src/ast_selectors.hpp:188:5: note: in expansion of macro ‘ATTACH_CMP_OPERATIONS’ 188 | ATTACH_CMP_OPERATIONS(ClassSelector) | ^~~~~~~~~~~~~~~~~~~~~ src/ast_selectors.hpp:135:18: warning: ‘virtual bool Sass::SimpleSelector::operator==(const Sass::SelectorList&) const’ was hidden [-Woverloaded-virtual=] 135 | virtual bool operator==(const SelectorList& rhs) const; | ^~~~~~~~ src/ast_def_macros.hpp:109:16: note: by ‘Sass::ClassSelector::operator==’ 109 | virtual bool operator==(const klass& rhs) const; \ | ^~~~~~~~ src/ast_selectors.hpp:188:5: note: in expansion of macro ‘ATTACH_CMP_OPERATIONS’ 188 | ATTACH_CMP_OPERATIONS(ClassSelector) | ^~~~~~~~~~~~~~~~~~~~~ src/ast_selectors.hpp:133:10: warning: ‘virtual bool Sass::SimpleSelector::operator==(const Sass::Selector&) const’ was hidden [-Woverloaded-virtual=] 133 | bool operator==(const Selector& rhs) const final override; | ^~~~~~~~ src/ast_def_macros.hpp:109:16: note: by ‘Sass::ClassSelector::operator==’ 109 | virtual bool operator==(const klass& rhs) const; \ | ^~~~~~~~ src/ast_selectors.hpp:188:5: note: in expansion of macro ‘ATTACH_CMP_OPERATIONS’ 188 | ATTACH_CMP_OPERATIONS(ClassSelector) | ^~~~~~~~~~~~~~~~~~~~~ src/ast_def_macros.hpp:106:16: warning: ‘virtual bool Sass::SimpleSelector::operator!=(const Sass::SimpleSelector&) const’ was hidden [-Woverloaded-virtual=] 106 | virtual bool operator!=(const klass& rhs) const { return !(*this == rhs); }; \ | ^~~~~~~~ src/ast_selectors.hpp:139:5: note: in expansion of macro ‘ATTACH_VIRTUAL_CMP_OPERATIONS’ 139 | ATTACH_VIRTUAL_CMP_OPERATIONS(SimpleSelector); | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~ src/ast_def_macros.hpp:110:16: note: by ‘virtual bool Sass::ClassSelector::operator!=(const Sass::ClassSelector&) const’ 110 | virtual bool operator!=(const klass& rhs) const { return !(*this == rhs); }; \ | ^~~~~~~~ src/ast_selectors.hpp:188:5: note: in expansion of macro ‘ATTACH_CMP_OPERATIONS’ 188 | ATTACH_CMP_OPERATIONS(ClassSelector) | ^~~~~~~~~~~~~~~~~~~~~ src/ast_selectors.hpp:137:18: warning: ‘virtual bool Sass::SimpleSelector::operator==(const Sass::CompoundSelector&) const’ was hidden [-Woverloaded-virtual=] 137 | virtual bool operator==(const CompoundSelector& rhs) const; | ^~~~~~~~ src/ast_def_macros.hpp:109:16: note: by ‘Sass::IDSelector::operator==’ 109 | virtual bool operator==(const klass& rhs) const; \ | ^~~~~~~~ src/ast_selectors.hpp:204:5: note: in expansion of macro ‘ATTACH_CMP_OPERATIONS’ 204 | ATTACH_CMP_OPERATIONS(IDSelector) | ^~~~~~~~~~~~~~~~~~~~~ src/ast_selectors.hpp:136:18: warning: ‘virtual bool Sass::SimpleSelector::operator==(const Sass::ComplexSelector&) const’ was hidden [-Woverloaded-virtual=] 136 | virtual bool operator==(const ComplexSelector& rhs) const; | ^~~~~~~~ src/ast_def_macros.hpp:109:16: note: by ‘Sass::IDSelector::operator==’ 109 | virtual bool operator==(const klass& rhs) const; \ | ^~~~~~~~ src/ast_selectors.hpp:204:5: note: in expansion of macro ‘ATTACH_CMP_OPERATIONS’ 204 | ATTACH_CMP_OPERATIONS(IDSelector) | ^~~~~~~~~~~~~~~~~~~~~ src/ast_selectors.hpp:135:18: warning: ‘virtual bool Sass::SimpleSelector::operator==(const Sass::SelectorList&) const’ was hidden [-Woverloaded-virtual=] 135 | virtual bool operator==(const SelectorList& rhs) const; | ^~~~~~~~ src/ast_def_macros.hpp:109:16: note: by ‘Sass::IDSelector::operator==’ 109 | virtual bool operator==(const klass& rhs) const; \ | ^~~~~~~~ src/ast_selectors.hpp:204:5: note: in expansion of macro ‘ATTACH_CMP_OPERATIONS’ 204 | ATTACH_CMP_OPERATIONS(IDSelector) | ^~~~~~~~~~~~~~~~~~~~~ src/ast_selectors.hpp:133:10: warning: ‘virtual bool Sass::SimpleSelector::operator==(const Sass::Selector&) const’ was hidden [-Woverloaded-virtual=] 133 | bool operator==(const Selector& rhs) const final override; | ^~~~~~~~ src/ast_def_macros.hpp:109:16: note: by ‘Sass::IDSelector::operator==’ 109 | virtual bool operator==(const klass& rhs) const; \ | ^~~~~~~~ src/ast_selectors.hpp:204:5: note: in expansion of macro ‘ATTACH_CMP_OPERATIONS’ 204 | ATTACH_CMP_OPERATIONS(IDSelector) | ^~~~~~~~~~~~~~~~~~~~~ src/ast_def_macros.hpp:106:16: warning: ‘virtual bool Sass::SimpleSelector::operator!=(const Sass::SimpleSelector&) const’ was hidden [-Woverloaded-virtual=] 106 | virtual bool operator!=(const klass& rhs) const { return !(*this == rhs); }; \ | ^~~~~~~~ src/ast_selectors.hpp:139:5: note: in expansion of macro ‘ATTACH_VIRTUAL_CMP_OPERATIONS’ 139 | ATTACH_VIRTUAL_CMP_OPERATIONS(SimpleSelector); | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~ src/ast_def_macros.hpp:110:16: note: by ‘virtual bool Sass::IDSelector::operator!=(const Sass::IDSelector&) const’ 110 | virtual bool operator!=(const klass& rhs) const { return !(*this == rhs); }; \ | ^~~~~~~~ src/ast_selectors.hpp:204:5: note: in expansion of macro ‘ATTACH_CMP_OPERATIONS’ 204 | ATTACH_CMP_OPERATIONS(IDSelector) | ^~~~~~~~~~~~~~~~~~~~~ src/ast_selectors.hpp:137:18: warning: ‘virtual bool Sass::SimpleSelector::operator==(const Sass::CompoundSelector&) const’ was hidden [-Woverloaded-virtual=] 137 | virtual bool operator==(const CompoundSelector& rhs) const; | ^~~~~~~~ src/ast_def_macros.hpp:109:16: note: by ‘Sass::AttributeSelector::operator==’ 109 | virtual bool operator==(const klass& rhs) const; \ | ^~~~~~~~ src/ast_selectors.hpp:223:5: note: in expansion of macro ‘ATTACH_CMP_OPERATIONS’ 223 | ATTACH_CMP_OPERATIONS(AttributeSelector) | ^~~~~~~~~~~~~~~~~~~~~ src/ast_selectors.hpp:136:18: warning: ‘virtual bool Sass::SimpleSelector::operator==(const Sass::ComplexSelector&) const’ was hidden [-Woverloaded-virtual=] 136 | virtual bool operator==(const ComplexSelector& rhs) const; | ^~~~~~~~ src/ast_def_macros.hpp:109:16: note: by ‘Sass::AttributeSelector::operator==’ 109 | virtual bool operator==(const klass& rhs) const; \ | ^~~~~~~~ src/ast_selectors.hpp:223:5: note: in expansion of macro ‘ATTACH_CMP_OPERATIONS’ 223 | ATTACH_CMP_OPERATIONS(AttributeSelector) | ^~~~~~~~~~~~~~~~~~~~~ src/ast_selectors.hpp:135:18: warning: ‘virtual bool Sass::SimpleSelector::operator==(const Sass::SelectorList&) const’ was hidden [-Woverloaded-virtual=] 135 | virtual bool operator==(const SelectorList& rhs) const; | ^~~~~~~~ src/ast_def_macros.hpp:109:16: note: by ‘Sass::AttributeSelector::operator==’ 109 | virtual bool operator==(const klass& rhs) const; \ | ^~~~~~~~ src/ast_selectors.hpp:223:5: note: in expansion of macro ‘ATTACH_CMP_OPERATIONS’ 223 | ATTACH_CMP_OPERATIONS(AttributeSelector) | ^~~~~~~~~~~~~~~~~~~~~ src/ast_selectors.hpp:133:10: warning: ‘virtual bool Sass::SimpleSelector::operator==(const Sass::Selector&) const’ was hidden [-Woverloaded-virtual=] 133 | bool operator==(const Selector& rhs) const final override; | ^~~~~~~~ src/ast_def_macros.hpp:109:16: note: by ‘Sass::AttributeSelector::operator==’ 109 | virtual bool operator==(const klass& rhs) const; \ | ^~~~~~~~ src/ast_selectors.hpp:223:5: note: in expansion of macro ‘ATTACH_CMP_OPERATIONS’ 223 | ATTACH_CMP_OPERATIONS(AttributeSelector) | ^~~~~~~~~~~~~~~~~~~~~ src/ast_def_macros.hpp:106:16: warning: ‘virtual bool Sass::SimpleSelector::operator!=(const Sass::SimpleSelector&) const’ was hidden [-Woverloaded-virtual=] 106 | virtual bool operator!=(const klass& rhs) const { return !(*this == rhs); }; \ | ^~~~~~~~ src/ast_selectors.hpp:139:5: note: in expansion of macro ‘ATTACH_VIRTUAL_CMP_OPERATIONS’ 139 | ATTACH_VIRTUAL_CMP_OPERATIONS(SimpleSelector); | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~ src/ast_def_macros.hpp:110:16: note: by ‘virtual bool Sass::AttributeSelector::operator!=(const Sass::AttributeSelector&) const’ 110 | virtual bool operator!=(const klass& rhs) const { return !(*this == rhs); }; \ | ^~~~~~~~ src/ast_selectors.hpp:223:5: note: in expansion of macro ‘ATTACH_CMP_OPERATIONS’ 223 | ATTACH_CMP_OPERATIONS(AttributeSelector) | ^~~~~~~~~~~~~~~~~~~~~ src/ast_def_macros.hpp:106:16: warning: ‘virtual bool Sass::Selector::operator!=(const Sass::Selector&) const’ was hidden [-Woverloaded-virtual=] 106 | virtual bool operator!=(const klass& rhs) const { return !(*this == rhs); }; \ | ^~~~~~~~ src/ast_selectors.hpp:56:5: note: in expansion of macro ‘ATTACH_VIRTUAL_CMP_OPERATIONS’ 56 | ATTACH_VIRTUAL_CMP_OPERATIONS(Selector) | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~ src/ast_def_macros.hpp:110:16: note: by ‘virtual bool Sass::ComplexSelector::operator!=(const Sass::ComplexSelector&) const’ 110 | virtual bool operator!=(const klass& rhs) const { return !(*this == rhs); }; \ | ^~~~~~~~ src/ast_selectors.hpp:310:5: note: in expansion of macro ‘ATTACH_CMP_OPERATIONS’ 310 | ATTACH_CMP_OPERATIONS(ComplexSelector) | ^~~~~~~~~~~~~~~~~~~~~ src/ast_def_macros.hpp:106:16: warning: ‘virtual bool Sass::Selector::operator!=(const Sass::Selector&) const’ was hidden [-Woverloaded-virtual=] 106 | virtual bool operator!=(const klass& rhs) const { return !(*this == rhs); }; \ | ^~~~~~~~ src/ast_selectors.hpp:56:5: note: in expansion of macro ‘ATTACH_VIRTUAL_CMP_OPERATIONS’ 56 | ATTACH_VIRTUAL_CMP_OPERATIONS(Selector) | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~ src/ast_def_macros.hpp:106:16: note: by ‘virtual bool Sass::SelectorComponent::operator!=(const Sass::SelectorComponent&) const’ 106 | virtual bool operator!=(const klass& rhs) const { return !(*this == rhs); }; \ | ^~~~~~~~ src/ast_selectors.hpp:349:5: note: in expansion of macro ‘ATTACH_VIRTUAL_CMP_OPERATIONS’ 349 | ATTACH_VIRTUAL_CMP_OPERATIONS(SelectorComponent); | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~ src/ast_def_macros.hpp:106:16: warning: ‘virtual bool Sass::SelectorComponent::operator!=(const Sass::SelectorComponent&) const’ was hidden [-Woverloaded-virtual=] 106 | virtual bool operator!=(const klass& rhs) const { return !(*this == rhs); }; \ | ^~~~~~~~ src/ast_selectors.hpp:349:5: note: in expansion of macro ‘ATTACH_VIRTUAL_CMP_OPERATIONS’ 349 | ATTACH_VIRTUAL_CMP_OPERATIONS(SelectorComponent); | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~ src/ast_def_macros.hpp:110:16: note: by ‘virtual bool Sass::SelectorCombinator::operator!=(const Sass::SelectorCombinator&) const’ 110 | virtual bool operator!=(const klass& rhs) const { return !(*this == rhs); }; \ | ^~~~~~~~ src/ast_selectors.hpp:407:5: note: in expansion of macro ‘ATTACH_CMP_OPERATIONS’ 407 | ATTACH_CMP_OPERATIONS(SelectorCombinator) | ^~~~~~~~~~~~~~~~~~~~~ g++ -std=gnu++17 -Wall -O2 -std=c++11 -I ./include -fPIC -c -o src/sass_functions.o src/sass_functions.cpp In file included from src/context.hpp:7, from src/sass_functions.cpp:7: src/ast.hpp:90:18: warning: ‘virtual bool Sass::AST_Node::operator==(const Sass::AST_Node&) const’ was hidden [-Woverloaded-virtual=] 90 | virtual bool operator== (const AST_Node& rhs) const { | ^~~~~~~~ src/ast.hpp:165:18: note: by ‘virtual bool Sass::Expression::operator==(const Sass::Expression&) const’ 165 | virtual bool operator== (const Expression& rhs) const { return false; } | ^~~~~~~~ src/ast.hpp:96:18: warning: ‘virtual bool Sass::AST_Node::operator!=(const Sass::AST_Node&) const’ was hidden [-Woverloaded-virtual=] 96 | virtual bool operator!= (const AST_Node& rhs) const { | ^~~~~~~~ src/ast.hpp:167:17: note: by ‘bool Sass::Expression::operator!=(const Sass::Expression&) const’ 167 | inline bool operator!=(const Expression& rhs) const { return !(rhs == *this); } | ^~~~~~~~ src/ast.hpp:90:18: warning: ‘virtual bool Sass::AST_Node::operator==(const Sass::AST_Node&) const’ was hidden [-Woverloaded-virtual=] 90 | virtual bool operator== (const AST_Node& rhs) const { | ^~~~~~~~ src/ast.hpp:908:10: note: by ‘bool Sass::CssMediaRule::operator==(const Sass::CssMediaRule&) const’ 908 | bool operator== (const CssMediaRule& rhs) const { | ^~~~~~~~ src/ast.hpp:96:18: warning: ‘virtual bool Sass::AST_Node::operator!=(const Sass::AST_Node&) const’ was hidden [-Woverloaded-virtual=] 96 | virtual bool operator!= (const AST_Node& rhs) const { | ^~~~~~~~ src/ast.hpp:911:10: note: by ‘bool Sass::CssMediaRule::operator!=(const Sass::CssMediaRule&) const’ 911 | bool operator!=(const CssMediaRule& rhs) const { | ^~~~~~~~ src/ast.hpp:90:18: warning: ‘virtual bool Sass::AST_Node::operator==(const Sass::AST_Node&) const’ was hidden [-Woverloaded-virtual=] 90 | virtual bool operator== (const AST_Node& rhs) const { | ^~~~~~~~ src/ast.hpp:939:10: note: by ‘bool Sass::CssMediaQuery::operator==(const Sass::CssMediaQuery&) const’ 939 | bool operator== (const CssMediaQuery& rhs) const; | ^~~~~~~~ src/ast.hpp:96:18: warning: ‘virtual bool Sass::AST_Node::operator!=(const Sass::AST_Node&) const’ was hidden [-Woverloaded-virtual=] 96 | virtual bool operator!= (const AST_Node& rhs) const { | ^~~~~~~~ src/ast.hpp:940:10: note: by ‘bool Sass::CssMediaQuery::operator!=(const Sass::CssMediaQuery&) const’ 940 | bool operator!=(const CssMediaQuery& rhs) const { | ^~~~~~~~ src/ast.hpp:165:18: warning: ‘virtual bool Sass::Expression::operator==(const Sass::Expression&) const’ was hidden [-Woverloaded-virtual=] 165 | virtual bool operator== (const Expression& rhs) const { return false; } | ^~~~~~~~ In file included from src/ast.hpp:14: src/ast_def_macros.hpp:105:16: note: by ‘virtual bool Sass::Selector::operator==(const Sass::Selector&) const’ 105 | virtual bool operator==(const klass& rhs) const = 0; \ | ^~~~~~~~ src/ast_selectors.hpp:56:5: note: in expansion of macro ‘ATTACH_VIRTUAL_CMP_OPERATIONS’ 56 | ATTACH_VIRTUAL_CMP_OPERATIONS(Selector) | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~ src/ast.hpp:96:18: warning: ‘virtual bool Sass::AST_Node::operator!=(const Sass::AST_Node&) const’ was hidden [-Woverloaded-virtual=] 96 | virtual bool operator!= (const AST_Node& rhs) const { | ^~~~~~~~ src/ast_def_macros.hpp:106:16: note: by ‘virtual bool Sass::Selector::operator!=(const Sass::Selector&) const’ 106 | virtual bool operator!=(const klass& rhs) const { return !(*this == rhs); }; \ | ^~~~~~~~ src/ast_selectors.hpp:56:5: note: in expansion of macro ‘ATTACH_VIRTUAL_CMP_OPERATIONS’ 56 | ATTACH_VIRTUAL_CMP_OPERATIONS(Selector) | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~ src/ast_def_macros.hpp:106:16: warning: ‘virtual bool Sass::Selector::operator!=(const Sass::Selector&) const’ was hidden [-Woverloaded-virtual=] 106 | virtual bool operator!=(const klass& rhs) const { return !(*this == rhs); }; \ | ^~~~~~~~ src/ast_selectors.hpp:56:5: note: in expansion of macro ‘ATTACH_VIRTUAL_CMP_OPERATIONS’ 56 | ATTACH_VIRTUAL_CMP_OPERATIONS(Selector) | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~ src/ast_def_macros.hpp:106:16: note: by ‘virtual bool Sass::SimpleSelector::operator!=(const Sass::SimpleSelector&) const’ 106 | virtual bool operator!=(const klass& rhs) const { return !(*this == rhs); }; \ | ^~~~~~~~ src/ast_selectors.hpp:139:5: note: in expansion of macro ‘ATTACH_VIRTUAL_CMP_OPERATIONS’ 139 | ATTACH_VIRTUAL_CMP_OPERATIONS(SimpleSelector); | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~ In file included from src/ast.hpp:1055: src/ast_selectors.hpp:137:18: warning: ‘virtual bool Sass::SimpleSelector::operator==(const Sass::CompoundSelector&) const’ was hidden [-Woverloaded-virtual=] 137 | virtual bool operator==(const CompoundSelector& rhs) const; | ^~~~~~~~ src/ast_def_macros.hpp:109:16: note: by ‘Sass::PlaceholderSelector::operator==’ 109 | virtual bool operator==(const klass& rhs) const; \ | ^~~~~~~~ src/ast_selectors.hpp:157:5: note: in expansion of macro ‘ATTACH_CMP_OPERATIONS’ 157 | ATTACH_CMP_OPERATIONS(PlaceholderSelector) | ^~~~~~~~~~~~~~~~~~~~~ src/ast_selectors.hpp:136:18: warning: ‘virtual bool Sass::SimpleSelector::operator==(const Sass::ComplexSelector&) const’ was hidden [-Woverloaded-virtual=] 136 | virtual bool operator==(const ComplexSelector& rhs) const; | ^~~~~~~~ src/ast_def_macros.hpp:109:16: note: by ‘Sass::PlaceholderSelector::operator==’ 109 | virtual bool operator==(const klass& rhs) const; \ | ^~~~~~~~ src/ast_selectors.hpp:157:5: note: in expansion of macro ‘ATTACH_CMP_OPERATIONS’ 157 | ATTACH_CMP_OPERATIONS(PlaceholderSelector) | ^~~~~~~~~~~~~~~~~~~~~ src/ast_selectors.hpp:135:18: warning: ‘virtual bool Sass::SimpleSelector::operator==(const Sass::SelectorList&) const’ was hidden [-Woverloaded-virtual=] 135 | virtual bool operator==(const SelectorList& rhs) const; | ^~~~~~~~ src/ast_def_macros.hpp:109:16: note: by ‘Sass::PlaceholderSelector::operator==’ 109 | virtual bool operator==(const klass& rhs) const; \ | ^~~~~~~~ src/ast_selectors.hpp:157:5: note: in expansion of macro ‘ATTACH_CMP_OPERATIONS’ 157 | ATTACH_CMP_OPERATIONS(PlaceholderSelector) | ^~~~~~~~~~~~~~~~~~~~~ src/ast_selectors.hpp:133:10: warning: ‘virtual bool Sass::SimpleSelector::operator==(const Sass::Selector&) const’ was hidden [-Woverloaded-virtual=] 133 | bool operator==(const Selector& rhs) const final override; | ^~~~~~~~ src/ast_def_macros.hpp:109:16: note: by ‘Sass::PlaceholderSelector::operator==’ 109 | virtual bool operator==(const klass& rhs) const; \ | ^~~~~~~~ src/ast_selectors.hpp:157:5: note: in expansion of macro ‘ATTACH_CMP_OPERATIONS’ 157 | ATTACH_CMP_OPERATIONS(PlaceholderSelector) | ^~~~~~~~~~~~~~~~~~~~~ src/ast_def_macros.hpp:106:16: warning: ‘virtual bool Sass::SimpleSelector::operator!=(const Sass::SimpleSelector&) const’ was hidden [-Woverloaded-virtual=] 106 | virtual bool operator!=(const klass& rhs) const { return !(*this == rhs); }; \ | ^~~~~~~~ src/ast_selectors.hpp:139:5: note: in expansion of macro ‘ATTACH_VIRTUAL_CMP_OPERATIONS’ 139 | ATTACH_VIRTUAL_CMP_OPERATIONS(SimpleSelector); | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~ src/ast_def_macros.hpp:110:16: note: by ‘virtual bool Sass::PlaceholderSelector::operator!=(const Sass::PlaceholderSelector&) const’ 110 | virtual bool operator!=(const klass& rhs) const { return !(*this == rhs); }; \ | ^~~~~~~~ src/ast_selectors.hpp:157:5: note: in expansion of macro ‘ATTACH_CMP_OPERATIONS’ 157 | ATTACH_CMP_OPERATIONS(PlaceholderSelector) | ^~~~~~~~~~~~~~~~~~~~~ src/ast_selectors.hpp:137:18: warning: ‘virtual bool Sass::SimpleSelector::operator==(const Sass::CompoundSelector&) const’ was hidden [-Woverloaded-virtual=] 137 | virtual bool operator==(const CompoundSelector& rhs) const; | ^~~~~~~~ src/ast_def_macros.hpp:109:16: note: by ‘Sass::TypeSelector::operator==’ 109 | virtual bool operator==(const klass& rhs) const; \ | ^~~~~~~~ src/ast_selectors.hpp:174:5: note: in expansion of macro ‘ATTACH_CMP_OPERATIONS’ 174 | ATTACH_CMP_OPERATIONS(TypeSelector) | ^~~~~~~~~~~~~~~~~~~~~ src/ast_selectors.hpp:136:18: warning: ‘virtual bool Sass::SimpleSelector::operator==(const Sass::ComplexSelector&) const’ was hidden [-Woverloaded-virtual=] 136 | virtual bool operator==(const ComplexSelector& rhs) const; | ^~~~~~~~ src/ast_def_macros.hpp:109:16: note: by ‘Sass::TypeSelector::operator==’ 109 | virtual bool operator==(const klass& rhs) const; \ | ^~~~~~~~ src/ast_selectors.hpp:174:5: note: in expansion of macro ‘ATTACH_CMP_OPERATIONS’ 174 | ATTACH_CMP_OPERATIONS(TypeSelector) | ^~~~~~~~~~~~~~~~~~~~~ src/ast_selectors.hpp:135:18: warning: ‘virtual bool Sass::SimpleSelector::operator==(const Sass::SelectorList&) const’ was hidden [-Woverloaded-virtual=] 135 | virtual bool operator==(const SelectorList& rhs) const; | ^~~~~~~~ src/ast_def_macros.hpp:109:16: note: by ‘Sass::TypeSelector::operator==’ 109 | virtual bool operator==(const klass& rhs) const; \ | ^~~~~~~~ src/ast_selectors.hpp:174:5: note: in expansion of macro ‘ATTACH_CMP_OPERATIONS’ 174 | ATTACH_CMP_OPERATIONS(TypeSelector) | ^~~~~~~~~~~~~~~~~~~~~ src/ast_selectors.hpp:133:10: warning: ‘virtual bool Sass::SimpleSelector::operator==(const Sass::Selector&) const’ was hidden [-Woverloaded-virtual=] 133 | bool operator==(const Selector& rhs) const final override; | ^~~~~~~~ src/ast_def_macros.hpp:109:16: note: by ‘Sass::TypeSelector::operator==’ 109 | virtual bool operator==(const klass& rhs) const; \ | ^~~~~~~~ src/ast_selectors.hpp:174:5: note: in expansion of macro ‘ATTACH_CMP_OPERATIONS’ 174 | ATTACH_CMP_OPERATIONS(TypeSelector) | ^~~~~~~~~~~~~~~~~~~~~ src/ast_def_macros.hpp:106:16: warning: ‘virtual bool Sass::SimpleSelector::operator!=(const Sass::SimpleSelector&) const’ was hidden [-Woverloaded-virtual=] 106 | virtual bool operator!=(const klass& rhs) const { return !(*this == rhs); }; \ | ^~~~~~~~ src/ast_selectors.hpp:139:5: note: in expansion of macro ‘ATTACH_VIRTUAL_CMP_OPERATIONS’ 139 | ATTACH_VIRTUAL_CMP_OPERATIONS(SimpleSelector); | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~ src/ast_def_macros.hpp:110:16: note: by ‘virtual bool Sass::TypeSelector::operator!=(const Sass::TypeSelector&) const’ 110 | virtual bool operator!=(const klass& rhs) const { return !(*this == rhs); }; \ | ^~~~~~~~ src/ast_selectors.hpp:174:5: note: in expansion of macro ‘ATTACH_CMP_OPERATIONS’ 174 | ATTACH_CMP_OPERATIONS(TypeSelector) | ^~~~~~~~~~~~~~~~~~~~~ src/ast_selectors.hpp:137:18: warning: ‘virtual bool Sass::SimpleSelector::operator==(const Sass::CompoundSelector&) const’ was hidden [-Woverloaded-virtual=] 137 | virtual bool operator==(const CompoundSelector& rhs) const; | ^~~~~~~~ src/ast_def_macros.hpp:109:16: note: by ‘Sass::ClassSelector::operator==’ 109 | virtual bool operator==(const klass& rhs) const; \ | ^~~~~~~~ src/ast_selectors.hpp:188:5: note: in expansion of macro ‘ATTACH_CMP_OPERATIONS’ 188 | ATTACH_CMP_OPERATIONS(ClassSelector) | ^~~~~~~~~~~~~~~~~~~~~ src/ast_selectors.hpp:136:18: warning: ‘virtual bool Sass::SimpleSelector::operator==(const Sass::ComplexSelector&) const’ was hidden [-Woverloaded-virtual=] 136 | virtual bool operator==(const ComplexSelector& rhs) const; | ^~~~~~~~ src/ast_def_macros.hpp:109:16: note: by ‘Sass::ClassSelector::operator==’ 109 | virtual bool operator==(const klass& rhs) const; \ | ^~~~~~~~ src/ast_selectors.hpp:188:5: note: in expansion of macro ‘ATTACH_CMP_OPERATIONS’ 188 | ATTACH_CMP_OPERATIONS(ClassSelector) | ^~~~~~~~~~~~~~~~~~~~~ src/ast_selectors.hpp:135:18: warning: ‘virtual bool Sass::SimpleSelector::operator==(const Sass::SelectorList&) const’ was hidden [-Woverloaded-virtual=] 135 | virtual bool operator==(const SelectorList& rhs) const; | ^~~~~~~~ src/ast_def_macros.hpp:109:16: note: by ‘Sass::ClassSelector::operator==’ 109 | virtual bool operator==(const klass& rhs) const; \ | ^~~~~~~~ src/ast_selectors.hpp:188:5: note: in expansion of macro ‘ATTACH_CMP_OPERATIONS’ 188 | ATTACH_CMP_OPERATIONS(ClassSelector) | ^~~~~~~~~~~~~~~~~~~~~ src/ast_selectors.hpp:133:10: warning: ‘virtual bool Sass::SimpleSelector::operator==(const Sass::Selector&) const’ was hidden [-Woverloaded-virtual=] 133 | bool operator==(const Selector& rhs) const final override; | ^~~~~~~~ src/ast_def_macros.hpp:109:16: note: by ‘Sass::ClassSelector::operator==’ 109 | virtual bool operator==(const klass& rhs) const; \ | ^~~~~~~~ src/ast_selectors.hpp:188:5: note: in expansion of macro ‘ATTACH_CMP_OPERATIONS’ 188 | ATTACH_CMP_OPERATIONS(ClassSelector) | ^~~~~~~~~~~~~~~~~~~~~ src/ast_def_macros.hpp:106:16: warning: ‘virtual bool Sass::SimpleSelector::operator!=(const Sass::SimpleSelector&) const’ was hidden [-Woverloaded-virtual=] 106 | virtual bool operator!=(const klass& rhs) const { return !(*this == rhs); }; \ | ^~~~~~~~ src/ast_selectors.hpp:139:5: note: in expansion of macro ‘ATTACH_VIRTUAL_CMP_OPERATIONS’ 139 | ATTACH_VIRTUAL_CMP_OPERATIONS(SimpleSelector); | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~ src/ast_def_macros.hpp:110:16: note: by ‘virtual bool Sass::ClassSelector::operator!=(const Sass::ClassSelector&) const’ 110 | virtual bool operator!=(const klass& rhs) const { return !(*this == rhs); }; \ | ^~~~~~~~ src/ast_selectors.hpp:188:5: note: in expansion of macro ‘ATTACH_CMP_OPERATIONS’ 188 | ATTACH_CMP_OPERATIONS(ClassSelector) | ^~~~~~~~~~~~~~~~~~~~~ src/ast_selectors.hpp:137:18: warning: ‘virtual bool Sass::SimpleSelector::operator==(const Sass::CompoundSelector&) const’ was hidden [-Woverloaded-virtual=] 137 | virtual bool operator==(const CompoundSelector& rhs) const; | ^~~~~~~~ src/ast_def_macros.hpp:109:16: note: by ‘Sass::IDSelector::operator==’ 109 | virtual bool operator==(const klass& rhs) const; \ | ^~~~~~~~ src/ast_selectors.hpp:204:5: note: in expansion of macro ‘ATTACH_CMP_OPERATIONS’ 204 | ATTACH_CMP_OPERATIONS(IDSelector) | ^~~~~~~~~~~~~~~~~~~~~ src/ast_selectors.hpp:136:18: warning: ‘virtual bool Sass::SimpleSelector::operator==(const Sass::ComplexSelector&) const’ was hidden [-Woverloaded-virtual=] 136 | virtual bool operator==(const ComplexSelector& rhs) const; | ^~~~~~~~ src/ast_def_macros.hpp:109:16: note: by ‘Sass::IDSelector::operator==’ 109 | virtual bool operator==(const klass& rhs) const; \ | ^~~~~~~~ src/ast_selectors.hpp:204:5: note: in expansion of macro ‘ATTACH_CMP_OPERATIONS’ 204 | ATTACH_CMP_OPERATIONS(IDSelector) | ^~~~~~~~~~~~~~~~~~~~~ src/ast_selectors.hpp:135:18: warning: ‘virtual bool Sass::SimpleSelector::operator==(const Sass::SelectorList&) const’ was hidden [-Woverloaded-virtual=] 135 | virtual bool operator==(const SelectorList& rhs) const; | ^~~~~~~~ src/ast_def_macros.hpp:109:16: note: by ‘Sass::IDSelector::operator==’ 109 | virtual bool operator==(const klass& rhs) const; \ | ^~~~~~~~ src/ast_selectors.hpp:204:5: note: in expansion of macro ‘ATTACH_CMP_OPERATIONS’ 204 | ATTACH_CMP_OPERATIONS(IDSelector) | ^~~~~~~~~~~~~~~~~~~~~ src/ast_selectors.hpp:133:10: warning: ‘virtual bool Sass::SimpleSelector::operator==(const Sass::Selector&) const’ was hidden [-Woverloaded-virtual=] 133 | bool operator==(const Selector& rhs) const final override; | ^~~~~~~~ src/ast_def_macros.hpp:109:16: note: by ‘Sass::IDSelector::operator==’ 109 | virtual bool operator==(const klass& rhs) const; \ | ^~~~~~~~ src/ast_selectors.hpp:204:5: note: in expansion of macro ‘ATTACH_CMP_OPERATIONS’ 204 | ATTACH_CMP_OPERATIONS(IDSelector) | ^~~~~~~~~~~~~~~~~~~~~ src/ast_def_macros.hpp:106:16: warning: ‘virtual bool Sass::SimpleSelector::operator!=(const Sass::SimpleSelector&) const’ was hidden [-Woverloaded-virtual=] 106 | virtual bool operator!=(const klass& rhs) const { return !(*this == rhs); }; \ | ^~~~~~~~ src/ast_selectors.hpp:139:5: note: in expansion of macro ‘ATTACH_VIRTUAL_CMP_OPERATIONS’ 139 | ATTACH_VIRTUAL_CMP_OPERATIONS(SimpleSelector); | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~ src/ast_def_macros.hpp:110:16: note: by ‘virtual bool Sass::IDSelector::operator!=(const Sass::IDSelector&) const’ 110 | virtual bool operator!=(const klass& rhs) const { return !(*this == rhs); }; \ | ^~~~~~~~ src/ast_selectors.hpp:204:5: note: in expansion of macro ‘ATTACH_CMP_OPERATIONS’ 204 | ATTACH_CMP_OPERATIONS(IDSelector) | ^~~~~~~~~~~~~~~~~~~~~ src/ast_selectors.hpp:137:18: warning: ‘virtual bool Sass::SimpleSelector::operator==(const Sass::CompoundSelector&) const’ was hidden [-Woverloaded-virtual=] 137 | virtual bool operator==(const CompoundSelector& rhs) const; | ^~~~~~~~ src/ast_def_macros.hpp:109:16: note: by ‘Sass::AttributeSelector::operator==’ 109 | virtual bool operator==(const klass& rhs) const; \ | ^~~~~~~~ src/ast_selectors.hpp:223:5: note: in expansion of macro ‘ATTACH_CMP_OPERATIONS’ 223 | ATTACH_CMP_OPERATIONS(AttributeSelector) | ^~~~~~~~~~~~~~~~~~~~~ src/ast_selectors.hpp:136:18: warning: ‘virtual bool Sass::SimpleSelector::operator==(const Sass::ComplexSelector&) const’ was hidden [-Woverloaded-virtual=] 136 | virtual bool operator==(const ComplexSelector& rhs) const; | ^~~~~~~~ src/ast_def_macros.hpp:109:16: note: by ‘Sass::AttributeSelector::operator==’ 109 | virtual bool operator==(const klass& rhs) const; \ | ^~~~~~~~ src/ast_selectors.hpp:223:5: note: in expansion of macro ‘ATTACH_CMP_OPERATIONS’ 223 | ATTACH_CMP_OPERATIONS(AttributeSelector) | ^~~~~~~~~~~~~~~~~~~~~ src/ast_selectors.hpp:135:18: warning: ‘virtual bool Sass::SimpleSelector::operator==(const Sass::SelectorList&) const’ was hidden [-Woverloaded-virtual=] 135 | virtual bool operator==(const SelectorList& rhs) const; | ^~~~~~~~ src/ast_def_macros.hpp:109:16: note: by ‘Sass::AttributeSelector::operator==’ 109 | virtual bool operator==(const klass& rhs) const; \ | ^~~~~~~~ src/ast_selectors.hpp:223:5: note: in expansion of macro ‘ATTACH_CMP_OPERATIONS’ 223 | ATTACH_CMP_OPERATIONS(AttributeSelector) | ^~~~~~~~~~~~~~~~~~~~~ src/ast_selectors.hpp:133:10: warning: ‘virtual bool Sass::SimpleSelector::operator==(const Sass::Selector&) const’ was hidden [-Woverloaded-virtual=] 133 | bool operator==(const Selector& rhs) const final override; | ^~~~~~~~ src/ast_def_macros.hpp:109:16: note: by ‘Sass::AttributeSelector::operator==’ 109 | virtual bool operator==(const klass& rhs) const; \ | ^~~~~~~~ src/ast_selectors.hpp:223:5: note: in expansion of macro ‘ATTACH_CMP_OPERATIONS’ 223 | ATTACH_CMP_OPERATIONS(AttributeSelector) | ^~~~~~~~~~~~~~~~~~~~~ src/ast_def_macros.hpp:106:16: warning: ‘virtual bool Sass::SimpleSelector::operator!=(const Sass::SimpleSelector&) const’ was hidden [-Woverloaded-virtual=] 106 | virtual bool operator!=(const klass& rhs) const { return !(*this == rhs); }; \ | ^~~~~~~~ src/ast_selectors.hpp:139:5: note: in expansion of macro ‘ATTACH_VIRTUAL_CMP_OPERATIONS’ 139 | ATTACH_VIRTUAL_CMP_OPERATIONS(SimpleSelector); | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~ src/ast_def_macros.hpp:110:16: note: by ‘virtual bool Sass::AttributeSelector::operator!=(const Sass::AttributeSelector&) const’ 110 | virtual bool operator!=(const klass& rhs) const { return !(*this == rhs); }; \ | ^~~~~~~~ src/ast_selectors.hpp:223:5: note: in expansion of macro ‘ATTACH_CMP_OPERATIONS’ 223 | ATTACH_CMP_OPERATIONS(AttributeSelector) | ^~~~~~~~~~~~~~~~~~~~~ src/ast_def_macros.hpp:106:16: warning: ‘virtual bool Sass::Selector::operator!=(const Sass::Selector&) const’ was hidden [-Woverloaded-virtual=] 106 | virtual bool operator!=(const klass& rhs) const { return !(*this == rhs); }; \ | ^~~~~~~~ src/ast_selectors.hpp:56:5: note: in expansion of macro ‘ATTACH_VIRTUAL_CMP_OPERATIONS’ 56 | ATTACH_VIRTUAL_CMP_OPERATIONS(Selector) | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~ src/ast_def_macros.hpp:110:16: note: by ‘virtual bool Sass::ComplexSelector::operator!=(const Sass::ComplexSelector&) const’ 110 | virtual bool operator!=(const klass& rhs) const { return !(*this == rhs); }; \ | ^~~~~~~~ src/ast_selectors.hpp:310:5: note: in expansion of macro ‘ATTACH_CMP_OPERATIONS’ 310 | ATTACH_CMP_OPERATIONS(ComplexSelector) | ^~~~~~~~~~~~~~~~~~~~~ src/ast_def_macros.hpp:106:16: warning: ‘virtual bool Sass::Selector::operator!=(const Sass::Selector&) const’ was hidden [-Woverloaded-virtual=] 106 | virtual bool operator!=(const klass& rhs) const { return !(*this == rhs); }; \ | ^~~~~~~~ src/ast_selectors.hpp:56:5: note: in expansion of macro ‘ATTACH_VIRTUAL_CMP_OPERATIONS’ 56 | ATTACH_VIRTUAL_CMP_OPERATIONS(Selector) | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~ src/ast_def_macros.hpp:106:16: note: by ‘virtual bool Sass::SelectorComponent::operator!=(const Sass::SelectorComponent&) const’ 106 | virtual bool operator!=(const klass& rhs) const { return !(*this == rhs); }; \ | ^~~~~~~~ src/ast_selectors.hpp:349:5: note: in expansion of macro ‘ATTACH_VIRTUAL_CMP_OPERATIONS’ 349 | ATTACH_VIRTUAL_CMP_OPERATIONS(SelectorComponent); | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~ src/ast_def_macros.hpp:106:16: warning: ‘virtual bool Sass::SelectorComponent::operator!=(const Sass::SelectorComponent&) const’ was hidden [-Woverloaded-virtual=] 106 | virtual bool operator!=(const klass& rhs) const { return !(*this == rhs); }; \ | ^~~~~~~~ src/ast_selectors.hpp:349:5: note: in expansion of macro ‘ATTACH_VIRTUAL_CMP_OPERATIONS’ 349 | ATTACH_VIRTUAL_CMP_OPERATIONS(SelectorComponent); | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~ src/ast_def_macros.hpp:110:16: note: by ‘virtual bool Sass::SelectorCombinator::operator!=(const Sass::SelectorCombinator&) const’ 110 | virtual bool operator!=(const klass& rhs) const { return !(*this == rhs); }; \ | ^~~~~~~~ src/ast_selectors.hpp:407:5: note: in expansion of macro ‘ATTACH_CMP_OPERATIONS’ 407 | ATTACH_CMP_OPERATIONS(SelectorCombinator) | ^~~~~~~~~~~~~~~~~~~~~ g++ -std=gnu++17 -Wall -O2 -std=c++11 -I ./include -fPIC -c -o src/sass2scss.o src/sass2scss.cpp g++ -std=gnu++17 -Wall -O2 -std=c++11 -I ./include -fPIC -c -o src/backtrace.o src/backtrace.cpp g++ -std=gnu++17 -Wall -O2 -std=c++11 -I ./include -fPIC -c -o src/operators.o src/operators.cpp In file included from src/values.hpp:4, from src/operators.hpp:4, from src/operators.cpp:6: src/ast.hpp:90:18: warning: ‘virtual bool Sass::AST_Node::operator==(const Sass::AST_Node&) const’ was hidden [-Woverloaded-virtual=] 90 | virtual bool operator== (const AST_Node& rhs) const { | ^~~~~~~~ src/ast.hpp:165:18: note: by ‘virtual bool Sass::Expression::operator==(const Sass::Expression&) const’ 165 | virtual bool operator== (const Expression& rhs) const { return false; } | ^~~~~~~~ src/ast.hpp:96:18: warning: ‘virtual bool Sass::AST_Node::operator!=(const Sass::AST_Node&) const’ was hidden [-Woverloaded-virtual=] 96 | virtual bool operator!= (const AST_Node& rhs) const { | ^~~~~~~~ src/ast.hpp:167:17: note: by ‘bool Sass::Expression::operator!=(const Sass::Expression&) const’ 167 | inline bool operator!=(const Expression& rhs) const { return !(rhs == *this); } | ^~~~~~~~ src/ast.hpp:90:18: warning: ‘virtual bool Sass::AST_Node::operator==(const Sass::AST_Node&) const’ was hidden [-Woverloaded-virtual=] 90 | virtual bool operator== (const AST_Node& rhs) const { | ^~~~~~~~ src/ast.hpp:908:10: note: by ‘bool Sass::CssMediaRule::operator==(const Sass::CssMediaRule&) const’ 908 | bool operator== (const CssMediaRule& rhs) const { | ^~~~~~~~ src/ast.hpp:96:18: warning: ‘virtual bool Sass::AST_Node::operator!=(const Sass::AST_Node&) const’ was hidden [-Woverloaded-virtual=] 96 | virtual bool operator!= (const AST_Node& rhs) const { | ^~~~~~~~ src/ast.hpp:911:10: note: by ‘bool Sass::CssMediaRule::operator!=(const Sass::CssMediaRule&) const’ 911 | bool operator!=(const CssMediaRule& rhs) const { | ^~~~~~~~ src/ast.hpp:90:18: warning: ‘virtual bool Sass::AST_Node::operator==(const Sass::AST_Node&) const’ was hidden [-Woverloaded-virtual=] 90 | virtual bool operator== (const AST_Node& rhs) const { | ^~~~~~~~ src/ast.hpp:939:10: note: by ‘bool Sass::CssMediaQuery::operator==(const Sass::CssMediaQuery&) const’ 939 | bool operator== (const CssMediaQuery& rhs) const; | ^~~~~~~~ src/ast.hpp:96:18: warning: ‘virtual bool Sass::AST_Node::operator!=(const Sass::AST_Node&) const’ was hidden [-Woverloaded-virtual=] 96 | virtual bool operator!= (const AST_Node& rhs) const { | ^~~~~~~~ src/ast.hpp:940:10: note: by ‘bool Sass::CssMediaQuery::operator!=(const Sass::CssMediaQuery&) const’ 940 | bool operator!=(const CssMediaQuery& rhs) const { | ^~~~~~~~ src/ast.hpp:165:18: warning: ‘virtual bool Sass::Expression::operator==(const Sass::Expression&) const’ was hidden [-Woverloaded-virtual=] 165 | virtual bool operator== (const Expression& rhs) const { return false; } | ^~~~~~~~ In file included from src/ast.hpp:14: src/ast_def_macros.hpp:105:16: note: by ‘virtual bool Sass::Selector::operator==(const Sass::Selector&) const’ 105 | virtual bool operator==(const klass& rhs) const = 0; \ | ^~~~~~~~ src/ast_selectors.hpp:56:5: note: in expansion of macro ‘ATTACH_VIRTUAL_CMP_OPERATIONS’ 56 | ATTACH_VIRTUAL_CMP_OPERATIONS(Selector) | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~ src/ast.hpp:96:18: warning: ‘virtual bool Sass::AST_Node::operator!=(const Sass::AST_Node&) const’ was hidden [-Woverloaded-virtual=] 96 | virtual bool operator!= (const AST_Node& rhs) const { | ^~~~~~~~ src/ast_def_macros.hpp:106:16: note: by ‘virtual bool Sass::Selector::operator!=(const Sass::Selector&) const’ 106 | virtual bool operator!=(const klass& rhs) const { return !(*this == rhs); }; \ | ^~~~~~~~ src/ast_selectors.hpp:56:5: note: in expansion of macro ‘ATTACH_VIRTUAL_CMP_OPERATIONS’ 56 | ATTACH_VIRTUAL_CMP_OPERATIONS(Selector) | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~ src/ast_def_macros.hpp:106:16: warning: ‘virtual bool Sass::Selector::operator!=(const Sass::Selector&) const’ was hidden [-Woverloaded-virtual=] 106 | virtual bool operator!=(const klass& rhs) const { return !(*this == rhs); }; \ | ^~~~~~~~ src/ast_selectors.hpp:56:5: note: in expansion of macro ‘ATTACH_VIRTUAL_CMP_OPERATIONS’ 56 | ATTACH_VIRTUAL_CMP_OPERATIONS(Selector) | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~ src/ast_def_macros.hpp:106:16: note: by ‘virtual bool Sass::SimpleSelector::operator!=(const Sass::SimpleSelector&) const’ 106 | virtual bool operator!=(const klass& rhs) const { return !(*this == rhs); }; \ | ^~~~~~~~ src/ast_selectors.hpp:139:5: note: in expansion of macro ‘ATTACH_VIRTUAL_CMP_OPERATIONS’ 139 | ATTACH_VIRTUAL_CMP_OPERATIONS(SimpleSelector); | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~ In file included from src/ast.hpp:1055: src/ast_selectors.hpp:137:18: warning: ‘virtual bool Sass::SimpleSelector::operator==(const Sass::CompoundSelector&) const’ was hidden [-Woverloaded-virtual=] 137 | virtual bool operator==(const CompoundSelector& rhs) const; | ^~~~~~~~ src/ast_def_macros.hpp:109:16: note: by ‘Sass::PlaceholderSelector::operator==’ 109 | virtual bool operator==(const klass& rhs) const; \ | ^~~~~~~~ src/ast_selectors.hpp:157:5: note: in expansion of macro ‘ATTACH_CMP_OPERATIONS’ 157 | ATTACH_CMP_OPERATIONS(PlaceholderSelector) | ^~~~~~~~~~~~~~~~~~~~~ src/ast_selectors.hpp:136:18: warning: ‘virtual bool Sass::SimpleSelector::operator==(const Sass::ComplexSelector&) const’ was hidden [-Woverloaded-virtual=] 136 | virtual bool operator==(const ComplexSelector& rhs) const; | ^~~~~~~~ src/ast_def_macros.hpp:109:16: note: by ‘Sass::PlaceholderSelector::operator==’ 109 | virtual bool operator==(const klass& rhs) const; \ | ^~~~~~~~ src/ast_selectors.hpp:157:5: note: in expansion of macro ‘ATTACH_CMP_OPERATIONS’ 157 | ATTACH_CMP_OPERATIONS(PlaceholderSelector) | ^~~~~~~~~~~~~~~~~~~~~ src/ast_selectors.hpp:135:18: warning: ‘virtual bool Sass::SimpleSelector::operator==(const Sass::SelectorList&) const’ was hidden [-Woverloaded-virtual=] 135 | virtual bool operator==(const SelectorList& rhs) const; | ^~~~~~~~ src/ast_def_macros.hpp:109:16: note: by ‘Sass::PlaceholderSelector::operator==’ 109 | virtual bool operator==(const klass& rhs) const; \ | ^~~~~~~~ src/ast_selectors.hpp:157:5: note: in expansion of macro ‘ATTACH_CMP_OPERATIONS’ 157 | ATTACH_CMP_OPERATIONS(PlaceholderSelector) | ^~~~~~~~~~~~~~~~~~~~~ src/ast_selectors.hpp:133:10: warning: ‘virtual bool Sass::SimpleSelector::operator==(const Sass::Selector&) const’ was hidden [-Woverloaded-virtual=] 133 | bool operator==(const Selector& rhs) const final override; | ^~~~~~~~ src/ast_def_macros.hpp:109:16: note: by ‘Sass::PlaceholderSelector::operator==’ 109 | virtual bool operator==(const klass& rhs) const; \ | ^~~~~~~~ src/ast_selectors.hpp:157:5: note: in expansion of macro ‘ATTACH_CMP_OPERATIONS’ 157 | ATTACH_CMP_OPERATIONS(PlaceholderSelector) | ^~~~~~~~~~~~~~~~~~~~~ src/ast_def_macros.hpp:106:16: warning: ‘virtual bool Sass::SimpleSelector::operator!=(const Sass::SimpleSelector&) const’ was hidden [-Woverloaded-virtual=] 106 | virtual bool operator!=(const klass& rhs) const { return !(*this == rhs); }; \ | ^~~~~~~~ src/ast_selectors.hpp:139:5: note: in expansion of macro ‘ATTACH_VIRTUAL_CMP_OPERATIONS’ 139 | ATTACH_VIRTUAL_CMP_OPERATIONS(SimpleSelector); | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~ src/ast_def_macros.hpp:110:16: note: by ‘virtual bool Sass::PlaceholderSelector::operator!=(const Sass::PlaceholderSelector&) const’ 110 | virtual bool operator!=(const klass& rhs) const { return !(*this == rhs); }; \ | ^~~~~~~~ src/ast_selectors.hpp:157:5: note: in expansion of macro ‘ATTACH_CMP_OPERATIONS’ 157 | ATTACH_CMP_OPERATIONS(PlaceholderSelector) | ^~~~~~~~~~~~~~~~~~~~~ src/ast_selectors.hpp:137:18: warning: ‘virtual bool Sass::SimpleSelector::operator==(const Sass::CompoundSelector&) const’ was hidden [-Woverloaded-virtual=] 137 | virtual bool operator==(const CompoundSelector& rhs) const; | ^~~~~~~~ src/ast_def_macros.hpp:109:16: note: by ‘Sass::TypeSelector::operator==’ 109 | virtual bool operator==(const klass& rhs) const; \ | ^~~~~~~~ src/ast_selectors.hpp:174:5: note: in expansion of macro ‘ATTACH_CMP_OPERATIONS’ 174 | ATTACH_CMP_OPERATIONS(TypeSelector) | ^~~~~~~~~~~~~~~~~~~~~ src/ast_selectors.hpp:136:18: warning: ‘virtual bool Sass::SimpleSelector::operator==(const Sass::ComplexSelector&) const’ was hidden [-Woverloaded-virtual=] 136 | virtual bool operator==(const ComplexSelector& rhs) const; | ^~~~~~~~ src/ast_def_macros.hpp:109:16: note: by ‘Sass::TypeSelector::operator==’ 109 | virtual bool operator==(const klass& rhs) const; \ | ^~~~~~~~ src/ast_selectors.hpp:174:5: note: in expansion of macro ‘ATTACH_CMP_OPERATIONS’ 174 | ATTACH_CMP_OPERATIONS(TypeSelector) | ^~~~~~~~~~~~~~~~~~~~~ src/ast_selectors.hpp:135:18: warning: ‘virtual bool Sass::SimpleSelector::operator==(const Sass::SelectorList&) const’ was hidden [-Woverloaded-virtual=] 135 | virtual bool operator==(const SelectorList& rhs) const; | ^~~~~~~~ src/ast_def_macros.hpp:109:16: note: by ‘Sass::TypeSelector::operator==’ 109 | virtual bool operator==(const klass& rhs) const; \ | ^~~~~~~~ src/ast_selectors.hpp:174:5: note: in expansion of macro ‘ATTACH_CMP_OPERATIONS’ 174 | ATTACH_CMP_OPERATIONS(TypeSelector) | ^~~~~~~~~~~~~~~~~~~~~ src/ast_selectors.hpp:133:10: warning: ‘virtual bool Sass::SimpleSelector::operator==(const Sass::Selector&) const’ was hidden [-Woverloaded-virtual=] 133 | bool operator==(const Selector& rhs) const final override; | ^~~~~~~~ src/ast_def_macros.hpp:109:16: note: by ‘Sass::TypeSelector::operator==’ 109 | virtual bool operator==(const klass& rhs) const; \ | ^~~~~~~~ src/ast_selectors.hpp:174:5: note: in expansion of macro ‘ATTACH_CMP_OPERATIONS’ 174 | ATTACH_CMP_OPERATIONS(TypeSelector) | ^~~~~~~~~~~~~~~~~~~~~ src/ast_def_macros.hpp:106:16: warning: ‘virtual bool Sass::SimpleSelector::operator!=(const Sass::SimpleSelector&) const’ was hidden [-Woverloaded-virtual=] 106 | virtual bool operator!=(const klass& rhs) const { return !(*this == rhs); }; \ | ^~~~~~~~ src/ast_selectors.hpp:139:5: note: in expansion of macro ‘ATTACH_VIRTUAL_CMP_OPERATIONS’ 139 | ATTACH_VIRTUAL_CMP_OPERATIONS(SimpleSelector); | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~ src/ast_def_macros.hpp:110:16: note: by ‘virtual bool Sass::TypeSelector::operator!=(const Sass::TypeSelector&) const’ 110 | virtual bool operator!=(const klass& rhs) const { return !(*this == rhs); }; \ | ^~~~~~~~ src/ast_selectors.hpp:174:5: note: in expansion of macro ‘ATTACH_CMP_OPERATIONS’ 174 | ATTACH_CMP_OPERATIONS(TypeSelector) | ^~~~~~~~~~~~~~~~~~~~~ src/ast_selectors.hpp:137:18: warning: ‘virtual bool Sass::SimpleSelector::operator==(const Sass::CompoundSelector&) const’ was hidden [-Woverloaded-virtual=] 137 | virtual bool operator==(const CompoundSelector& rhs) const; | ^~~~~~~~ src/ast_def_macros.hpp:109:16: note: by ‘Sass::ClassSelector::operator==’ 109 | virtual bool operator==(const klass& rhs) const; \ | ^~~~~~~~ src/ast_selectors.hpp:188:5: note: in expansion of macro ‘ATTACH_CMP_OPERATIONS’ 188 | ATTACH_CMP_OPERATIONS(ClassSelector) | ^~~~~~~~~~~~~~~~~~~~~ src/ast_selectors.hpp:136:18: warning: ‘virtual bool Sass::SimpleSelector::operator==(const Sass::ComplexSelector&) const’ was hidden [-Woverloaded-virtual=] 136 | virtual bool operator==(const ComplexSelector& rhs) const; | ^~~~~~~~ src/ast_def_macros.hpp:109:16: note: by ‘Sass::ClassSelector::operator==’ 109 | virtual bool operator==(const klass& rhs) const; \ | ^~~~~~~~ src/ast_selectors.hpp:188:5: note: in expansion of macro ‘ATTACH_CMP_OPERATIONS’ 188 | ATTACH_CMP_OPERATIONS(ClassSelector) | ^~~~~~~~~~~~~~~~~~~~~ src/ast_selectors.hpp:135:18: warning: ‘virtual bool Sass::SimpleSelector::operator==(const Sass::SelectorList&) const’ was hidden [-Woverloaded-virtual=] 135 | virtual bool operator==(const SelectorList& rhs) const; | ^~~~~~~~ src/ast_def_macros.hpp:109:16: note: by ‘Sass::ClassSelector::operator==’ 109 | virtual bool operator==(const klass& rhs) const; \ | ^~~~~~~~ src/ast_selectors.hpp:188:5: note: in expansion of macro ‘ATTACH_CMP_OPERATIONS’ 188 | ATTACH_CMP_OPERATIONS(ClassSelector) | ^~~~~~~~~~~~~~~~~~~~~ src/ast_selectors.hpp:133:10: warning: ‘virtual bool Sass::SimpleSelector::operator==(const Sass::Selector&) const’ was hidden [-Woverloaded-virtual=] 133 | bool operator==(const Selector& rhs) const final override; | ^~~~~~~~ src/ast_def_macros.hpp:109:16: note: by ‘Sass::ClassSelector::operator==’ 109 | virtual bool operator==(const klass& rhs) const; \ | ^~~~~~~~ src/ast_selectors.hpp:188:5: note: in expansion of macro ‘ATTACH_CMP_OPERATIONS’ 188 | ATTACH_CMP_OPERATIONS(ClassSelector) | ^~~~~~~~~~~~~~~~~~~~~ src/ast_def_macros.hpp:106:16: warning: ‘virtual bool Sass::SimpleSelector::operator!=(const Sass::SimpleSelector&) const’ was hidden [-Woverloaded-virtual=] 106 | virtual bool operator!=(const klass& rhs) const { return !(*this == rhs); }; \ | ^~~~~~~~ src/ast_selectors.hpp:139:5: note: in expansion of macro ‘ATTACH_VIRTUAL_CMP_OPERATIONS’ 139 | ATTACH_VIRTUAL_CMP_OPERATIONS(SimpleSelector); | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~ src/ast_def_macros.hpp:110:16: note: by ‘virtual bool Sass::ClassSelector::operator!=(const Sass::ClassSelector&) const’ 110 | virtual bool operator!=(const klass& rhs) const { return !(*this == rhs); }; \ | ^~~~~~~~ src/ast_selectors.hpp:188:5: note: in expansion of macro ‘ATTACH_CMP_OPERATIONS’ 188 | ATTACH_CMP_OPERATIONS(ClassSelector) | ^~~~~~~~~~~~~~~~~~~~~ src/ast_selectors.hpp:137:18: warning: ‘virtual bool Sass::SimpleSelector::operator==(const Sass::CompoundSelector&) const’ was hidden [-Woverloaded-virtual=] 137 | virtual bool operator==(const CompoundSelector& rhs) const; | ^~~~~~~~ src/ast_def_macros.hpp:109:16: note: by ‘Sass::IDSelector::operator==’ 109 | virtual bool operator==(const klass& rhs) const; \ | ^~~~~~~~ src/ast_selectors.hpp:204:5: note: in expansion of macro ‘ATTACH_CMP_OPERATIONS’ 204 | ATTACH_CMP_OPERATIONS(IDSelector) | ^~~~~~~~~~~~~~~~~~~~~ src/ast_selectors.hpp:136:18: warning: ‘virtual bool Sass::SimpleSelector::operator==(const Sass::ComplexSelector&) const’ was hidden [-Woverloaded-virtual=] 136 | virtual bool operator==(const ComplexSelector& rhs) const; | ^~~~~~~~ src/ast_def_macros.hpp:109:16: note: by ‘Sass::IDSelector::operator==’ 109 | virtual bool operator==(const klass& rhs) const; \ | ^~~~~~~~ src/ast_selectors.hpp:204:5: note: in expansion of macro ‘ATTACH_CMP_OPERATIONS’ 204 | ATTACH_CMP_OPERATIONS(IDSelector) | ^~~~~~~~~~~~~~~~~~~~~ src/ast_selectors.hpp:135:18: warning: ‘virtual bool Sass::SimpleSelector::operator==(const Sass::SelectorList&) const’ was hidden [-Woverloaded-virtual=] 135 | virtual bool operator==(const SelectorList& rhs) const; | ^~~~~~~~ src/ast_def_macros.hpp:109:16: note: by ‘Sass::IDSelector::operator==’ 109 | virtual bool operator==(const klass& rhs) const; \ | ^~~~~~~~ src/ast_selectors.hpp:204:5: note: in expansion of macro ‘ATTACH_CMP_OPERATIONS’ 204 | ATTACH_CMP_OPERATIONS(IDSelector) | ^~~~~~~~~~~~~~~~~~~~~ src/ast_selectors.hpp:133:10: warning: ‘virtual bool Sass::SimpleSelector::operator==(const Sass::Selector&) const’ was hidden [-Woverloaded-virtual=] 133 | bool operator==(const Selector& rhs) const final override; | ^~~~~~~~ src/ast_def_macros.hpp:109:16: note: by ‘Sass::IDSelector::operator==’ 109 | virtual bool operator==(const klass& rhs) const; \ | ^~~~~~~~ src/ast_selectors.hpp:204:5: note: in expansion of macro ‘ATTACH_CMP_OPERATIONS’ 204 | ATTACH_CMP_OPERATIONS(IDSelector) | ^~~~~~~~~~~~~~~~~~~~~ src/ast_def_macros.hpp:106:16: warning: ‘virtual bool Sass::SimpleSelector::operator!=(const Sass::SimpleSelector&) const’ was hidden [-Woverloaded-virtual=] 106 | virtual bool operator!=(const klass& rhs) const { return !(*this == rhs); }; \ | ^~~~~~~~ src/ast_selectors.hpp:139:5: note: in expansion of macro ‘ATTACH_VIRTUAL_CMP_OPERATIONS’ 139 | ATTACH_VIRTUAL_CMP_OPERATIONS(SimpleSelector); | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~ src/ast_def_macros.hpp:110:16: note: by ‘virtual bool Sass::IDSelector::operator!=(const Sass::IDSelector&) const’ 110 | virtual bool operator!=(const klass& rhs) const { return !(*this == rhs); }; \ | ^~~~~~~~ src/ast_selectors.hpp:204:5: note: in expansion of macro ‘ATTACH_CMP_OPERATIONS’ 204 | ATTACH_CMP_OPERATIONS(IDSelector) | ^~~~~~~~~~~~~~~~~~~~~ src/ast_selectors.hpp:137:18: warning: ‘virtual bool Sass::SimpleSelector::operator==(const Sass::CompoundSelector&) const’ was hidden [-Woverloaded-virtual=] 137 | virtual bool operator==(const CompoundSelector& rhs) const; | ^~~~~~~~ src/ast_def_macros.hpp:109:16: note: by ‘Sass::AttributeSelector::operator==’ 109 | virtual bool operator==(const klass& rhs) const; \ | ^~~~~~~~ src/ast_selectors.hpp:223:5: note: in expansion of macro ‘ATTACH_CMP_OPERATIONS’ 223 | ATTACH_CMP_OPERATIONS(AttributeSelector) | ^~~~~~~~~~~~~~~~~~~~~ src/ast_selectors.hpp:136:18: warning: ‘virtual bool Sass::SimpleSelector::operator==(const Sass::ComplexSelector&) const’ was hidden [-Woverloaded-virtual=] 136 | virtual bool operator==(const ComplexSelector& rhs) const; | ^~~~~~~~ src/ast_def_macros.hpp:109:16: note: by ‘Sass::AttributeSelector::operator==’ 109 | virtual bool operator==(const klass& rhs) const; \ | ^~~~~~~~ src/ast_selectors.hpp:223:5: note: in expansion of macro ‘ATTACH_CMP_OPERATIONS’ 223 | ATTACH_CMP_OPERATIONS(AttributeSelector) | ^~~~~~~~~~~~~~~~~~~~~ src/ast_selectors.hpp:135:18: warning: ‘virtual bool Sass::SimpleSelector::operator==(const Sass::SelectorList&) const’ was hidden [-Woverloaded-virtual=] 135 | virtual bool operator==(const SelectorList& rhs) const; | ^~~~~~~~ src/ast_def_macros.hpp:109:16: note: by ‘Sass::AttributeSelector::operator==’ 109 | virtual bool operator==(const klass& rhs) const; \ | ^~~~~~~~ src/ast_selectors.hpp:223:5: note: in expansion of macro ‘ATTACH_CMP_OPERATIONS’ 223 | ATTACH_CMP_OPERATIONS(AttributeSelector) | ^~~~~~~~~~~~~~~~~~~~~ src/ast_selectors.hpp:133:10: warning: ‘virtual bool Sass::SimpleSelector::operator==(const Sass::Selector&) const’ was hidden [-Woverloaded-virtual=] 133 | bool operator==(const Selector& rhs) const final override; | ^~~~~~~~ src/ast_def_macros.hpp:109:16: note: by ‘Sass::AttributeSelector::operator==’ 109 | virtual bool operator==(const klass& rhs) const; \ | ^~~~~~~~ src/ast_selectors.hpp:223:5: note: in expansion of macro ‘ATTACH_CMP_OPERATIONS’ 223 | ATTACH_CMP_OPERATIONS(AttributeSelector) | ^~~~~~~~~~~~~~~~~~~~~ src/ast_def_macros.hpp:106:16: warning: ‘virtual bool Sass::SimpleSelector::operator!=(const Sass::SimpleSelector&) const’ was hidden [-Woverloaded-virtual=] 106 | virtual bool operator!=(const klass& rhs) const { return !(*this == rhs); }; \ | ^~~~~~~~ src/ast_selectors.hpp:139:5: note: in expansion of macro ‘ATTACH_VIRTUAL_CMP_OPERATIONS’ 139 | ATTACH_VIRTUAL_CMP_OPERATIONS(SimpleSelector); | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~ src/ast_def_macros.hpp:110:16: note: by ‘virtual bool Sass::AttributeSelector::operator!=(const Sass::AttributeSelector&) const’ 110 | virtual bool operator!=(const klass& rhs) const { return !(*this == rhs); }; \ | ^~~~~~~~ src/ast_selectors.hpp:223:5: note: in expansion of macro ‘ATTACH_CMP_OPERATIONS’ 223 | ATTACH_CMP_OPERATIONS(AttributeSelector) | ^~~~~~~~~~~~~~~~~~~~~ src/ast_def_macros.hpp:106:16: warning: ‘virtual bool Sass::Selector::operator!=(const Sass::Selector&) const’ was hidden [-Woverloaded-virtual=] 106 | virtual bool operator!=(const klass& rhs) const { return !(*this == rhs); }; \ | ^~~~~~~~ src/ast_selectors.hpp:56:5: note: in expansion of macro ‘ATTACH_VIRTUAL_CMP_OPERATIONS’ 56 | ATTACH_VIRTUAL_CMP_OPERATIONS(Selector) | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~ src/ast_def_macros.hpp:110:16: note: by ‘virtual bool Sass::ComplexSelector::operator!=(const Sass::ComplexSelector&) const’ 110 | virtual bool operator!=(const klass& rhs) const { return !(*this == rhs); }; \ | ^~~~~~~~ src/ast_selectors.hpp:310:5: note: in expansion of macro ‘ATTACH_CMP_OPERATIONS’ 310 | ATTACH_CMP_OPERATIONS(ComplexSelector) | ^~~~~~~~~~~~~~~~~~~~~ src/ast_def_macros.hpp:106:16: warning: ‘virtual bool Sass::Selector::operator!=(const Sass::Selector&) const’ was hidden [-Woverloaded-virtual=] 106 | virtual bool operator!=(const klass& rhs) const { return !(*this == rhs); }; \ | ^~~~~~~~ src/ast_selectors.hpp:56:5: note: in expansion of macro ‘ATTACH_VIRTUAL_CMP_OPERATIONS’ 56 | ATTACH_VIRTUAL_CMP_OPERATIONS(Selector) | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~ src/ast_def_macros.hpp:106:16: note: by ‘virtual bool Sass::SelectorComponent::operator!=(const Sass::SelectorComponent&) const’ 106 | virtual bool operator!=(const klass& rhs) const { return !(*this == rhs); }; \ | ^~~~~~~~ src/ast_selectors.hpp:349:5: note: in expansion of macro ‘ATTACH_VIRTUAL_CMP_OPERATIONS’ 349 | ATTACH_VIRTUAL_CMP_OPERATIONS(SelectorComponent); | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~ src/ast_def_macros.hpp:106:16: warning: ‘virtual bool Sass::SelectorComponent::operator!=(const Sass::SelectorComponent&) const’ was hidden [-Woverloaded-virtual=] 106 | virtual bool operator!=(const klass& rhs) const { return !(*this == rhs); }; \ | ^~~~~~~~ src/ast_selectors.hpp:349:5: note: in expansion of macro ‘ATTACH_VIRTUAL_CMP_OPERATIONS’ 349 | ATTACH_VIRTUAL_CMP_OPERATIONS(SelectorComponent); | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~ src/ast_def_macros.hpp:110:16: note: by ‘virtual bool Sass::SelectorCombinator::operator!=(const Sass::SelectorCombinator&) const’ 110 | virtual bool operator!=(const klass& rhs) const { return !(*this == rhs); }; \ | ^~~~~~~~ src/ast_selectors.hpp:407:5: note: in expansion of macro ‘ATTACH_CMP_OPERATIONS’ 407 | ATTACH_CMP_OPERATIONS(SelectorCombinator) | ^~~~~~~~~~~~~~~~~~~~~ g++ -std=gnu++17 -Wall -O2 -std=c++11 -I ./include -fPIC -c -o src/ast2c.o src/ast2c.cpp In file included from src/ast2c.cpp:6: src/ast.hpp:90:18: warning: ‘virtual bool Sass::AST_Node::operator==(const Sass::AST_Node&) const’ was hidden [-Woverloaded-virtual=] 90 | virtual bool operator== (const AST_Node& rhs) const { | ^~~~~~~~ src/ast.hpp:165:18: note: by ‘virtual bool Sass::Expression::operator==(const Sass::Expression&) const’ 165 | virtual bool operator== (const Expression& rhs) const { return false; } | ^~~~~~~~ src/ast.hpp:96:18: warning: ‘virtual bool Sass::AST_Node::operator!=(const Sass::AST_Node&) const’ was hidden [-Woverloaded-virtual=] 96 | virtual bool operator!= (const AST_Node& rhs) const { | ^~~~~~~~ src/ast.hpp:167:17: note: by ‘bool Sass::Expression::operator!=(const Sass::Expression&) const’ 167 | inline bool operator!=(const Expression& rhs) const { return !(rhs == *this); } | ^~~~~~~~ src/ast.hpp:90:18: warning: ‘virtual bool Sass::AST_Node::operator==(const Sass::AST_Node&) const’ was hidden [-Woverloaded-virtual=] 90 | virtual bool operator== (const AST_Node& rhs) const { | ^~~~~~~~ src/ast.hpp:908:10: note: by ‘bool Sass::CssMediaRule::operator==(const Sass::CssMediaRule&) const’ 908 | bool operator== (const CssMediaRule& rhs) const { | ^~~~~~~~ src/ast.hpp:96:18: warning: ‘virtual bool Sass::AST_Node::operator!=(const Sass::AST_Node&) const’ was hidden [-Woverloaded-virtual=] 96 | virtual bool operator!= (const AST_Node& rhs) const { | ^~~~~~~~ src/ast.hpp:911:10: note: by ‘bool Sass::CssMediaRule::operator!=(const Sass::CssMediaRule&) const’ 911 | bool operator!=(const CssMediaRule& rhs) const { | ^~~~~~~~ src/ast.hpp:90:18: warning: ‘virtual bool Sass::AST_Node::operator==(const Sass::AST_Node&) const’ was hidden [-Woverloaded-virtual=] 90 | virtual bool operator== (const AST_Node& rhs) const { | ^~~~~~~~ src/ast.hpp:939:10: note: by ‘bool Sass::CssMediaQuery::operator==(const Sass::CssMediaQuery&) const’ 939 | bool operator== (const CssMediaQuery& rhs) const; | ^~~~~~~~ src/ast.hpp:96:18: warning: ‘virtual bool Sass::AST_Node::operator!=(const Sass::AST_Node&) const’ was hidden [-Woverloaded-virtual=] 96 | virtual bool operator!= (const AST_Node& rhs) const { | ^~~~~~~~ src/ast.hpp:940:10: note: by ‘bool Sass::CssMediaQuery::operator!=(const Sass::CssMediaQuery&) const’ 940 | bool operator!=(const CssMediaQuery& rhs) const { | ^~~~~~~~ src/ast.hpp:165:18: warning: ‘virtual bool Sass::Expression::operator==(const Sass::Expression&) const’ was hidden [-Woverloaded-virtual=] 165 | virtual bool operator== (const Expression& rhs) const { return false; } | ^~~~~~~~ In file included from src/operation.hpp:15, from src/ast2c.hpp:5, from src/ast2c.cpp:5: src/ast_def_macros.hpp:105:16: note: by ‘virtual bool Sass::Selector::operator==(const Sass::Selector&) const’ 105 | virtual bool operator==(const klass& rhs) const = 0; \ | ^~~~~~~~ src/ast_selectors.hpp:56:5: note: in expansion of macro ‘ATTACH_VIRTUAL_CMP_OPERATIONS’ 56 | ATTACH_VIRTUAL_CMP_OPERATIONS(Selector) | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~ src/ast.hpp:96:18: warning: ‘virtual bool Sass::AST_Node::operator!=(const Sass::AST_Node&) const’ was hidden [-Woverloaded-virtual=] 96 | virtual bool operator!= (const AST_Node& rhs) const { | ^~~~~~~~ src/ast_def_macros.hpp:106:16: note: by ‘virtual bool Sass::Selector::operator!=(const Sass::Selector&) const’ 106 | virtual bool operator!=(const klass& rhs) const { return !(*this == rhs); }; \ | ^~~~~~~~ src/ast_selectors.hpp:56:5: note: in expansion of macro ‘ATTACH_VIRTUAL_CMP_OPERATIONS’ 56 | ATTACH_VIRTUAL_CMP_OPERATIONS(Selector) | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~ src/ast_def_macros.hpp:106:16: warning: ‘virtual bool Sass::Selector::operator!=(const Sass::Selector&) const’ was hidden [-Woverloaded-virtual=] 106 | virtual bool operator!=(const klass& rhs) const { return !(*this == rhs); }; \ | ^~~~~~~~ src/ast_selectors.hpp:56:5: note: in expansion of macro ‘ATTACH_VIRTUAL_CMP_OPERATIONS’ 56 | ATTACH_VIRTUAL_CMP_OPERATIONS(Selector) | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~ src/ast_def_macros.hpp:106:16: note: by ‘virtual bool Sass::SimpleSelector::operator!=(const Sass::SimpleSelector&) const’ 106 | virtual bool operator!=(const klass& rhs) const { return !(*this == rhs); }; \ | ^~~~~~~~ src/ast_selectors.hpp:139:5: note: in expansion of macro ‘ATTACH_VIRTUAL_CMP_OPERATIONS’ 139 | ATTACH_VIRTUAL_CMP_OPERATIONS(SimpleSelector); | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~ In file included from src/ast.hpp:1055: src/ast_selectors.hpp:137:18: warning: ‘virtual bool Sass::SimpleSelector::operator==(const Sass::CompoundSelector&) const’ was hidden [-Woverloaded-virtual=] 137 | virtual bool operator==(const CompoundSelector& rhs) const; | ^~~~~~~~ src/ast_def_macros.hpp:109:16: note: by ‘Sass::PlaceholderSelector::operator==’ 109 | virtual bool operator==(const klass& rhs) const; \ | ^~~~~~~~ src/ast_selectors.hpp:157:5: note: in expansion of macro ‘ATTACH_CMP_OPERATIONS’ 157 | ATTACH_CMP_OPERATIONS(PlaceholderSelector) | ^~~~~~~~~~~~~~~~~~~~~ src/ast_selectors.hpp:136:18: warning: ‘virtual bool Sass::SimpleSelector::operator==(const Sass::ComplexSelector&) const’ was hidden [-Woverloaded-virtual=] 136 | virtual bool operator==(const ComplexSelector& rhs) const; | ^~~~~~~~ src/ast_def_macros.hpp:109:16: note: by ‘Sass::PlaceholderSelector::operator==’ 109 | virtual bool operator==(const klass& rhs) const; \ | ^~~~~~~~ src/ast_selectors.hpp:157:5: note: in expansion of macro ‘ATTACH_CMP_OPERATIONS’ 157 | ATTACH_CMP_OPERATIONS(PlaceholderSelector) | ^~~~~~~~~~~~~~~~~~~~~ src/ast_selectors.hpp:135:18: warning: ‘virtual bool Sass::SimpleSelector::operator==(const Sass::SelectorList&) const’ was hidden [-Woverloaded-virtual=] 135 | virtual bool operator==(const SelectorList& rhs) const; | ^~~~~~~~ src/ast_def_macros.hpp:109:16: note: by ‘Sass::PlaceholderSelector::operator==’ 109 | virtual bool operator==(const klass& rhs) const; \ | ^~~~~~~~ src/ast_selectors.hpp:157:5: note: in expansion of macro ‘ATTACH_CMP_OPERATIONS’ 157 | ATTACH_CMP_OPERATIONS(PlaceholderSelector) | ^~~~~~~~~~~~~~~~~~~~~ src/ast_selectors.hpp:133:10: warning: ‘virtual bool Sass::SimpleSelector::operator==(const Sass::Selector&) const’ was hidden [-Woverloaded-virtual=] 133 | bool operator==(const Selector& rhs) const final override; | ^~~~~~~~ src/ast_def_macros.hpp:109:16: note: by ‘Sass::PlaceholderSelector::operator==’ 109 | virtual bool operator==(const klass& rhs) const; \ | ^~~~~~~~ src/ast_selectors.hpp:157:5: note: in expansion of macro ‘ATTACH_CMP_OPERATIONS’ 157 | ATTACH_CMP_OPERATIONS(PlaceholderSelector) | ^~~~~~~~~~~~~~~~~~~~~ src/ast_def_macros.hpp:106:16: warning: ‘virtual bool Sass::SimpleSelector::operator!=(const Sass::SimpleSelector&) const’ was hidden [-Woverloaded-virtual=] 106 | virtual bool operator!=(const klass& rhs) const { return !(*this == rhs); }; \ | ^~~~~~~~ src/ast_selectors.hpp:139:5: note: in expansion of macro ‘ATTACH_VIRTUAL_CMP_OPERATIONS’ 139 | ATTACH_VIRTUAL_CMP_OPERATIONS(SimpleSelector); | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~ src/ast_def_macros.hpp:110:16: note: by ‘virtual bool Sass::PlaceholderSelector::operator!=(const Sass::PlaceholderSelector&) const’ 110 | virtual bool operator!=(const klass& rhs) const { return !(*this == rhs); }; \ | ^~~~~~~~ src/ast_selectors.hpp:157:5: note: in expansion of macro ‘ATTACH_CMP_OPERATIONS’ 157 | ATTACH_CMP_OPERATIONS(PlaceholderSelector) | ^~~~~~~~~~~~~~~~~~~~~ src/ast_selectors.hpp:137:18: warning: ‘virtual bool Sass::SimpleSelector::operator==(const Sass::CompoundSelector&) const’ was hidden [-Woverloaded-virtual=] 137 | virtual bool operator==(const CompoundSelector& rhs) const; | ^~~~~~~~ src/ast_def_macros.hpp:109:16: note: by ‘Sass::TypeSelector::operator==’ 109 | virtual bool operator==(const klass& rhs) const; \ | ^~~~~~~~ src/ast_selectors.hpp:174:5: note: in expansion of macro ‘ATTACH_CMP_OPERATIONS’ 174 | ATTACH_CMP_OPERATIONS(TypeSelector) | ^~~~~~~~~~~~~~~~~~~~~ src/ast_selectors.hpp:136:18: warning: ‘virtual bool Sass::SimpleSelector::operator==(const Sass::ComplexSelector&) const’ was hidden [-Woverloaded-virtual=] 136 | virtual bool operator==(const ComplexSelector& rhs) const; | ^~~~~~~~ src/ast_def_macros.hpp:109:16: note: by ‘Sass::TypeSelector::operator==’ 109 | virtual bool operator==(const klass& rhs) const; \ | ^~~~~~~~ src/ast_selectors.hpp:174:5: note: in expansion of macro ‘ATTACH_CMP_OPERATIONS’ 174 | ATTACH_CMP_OPERATIONS(TypeSelector) | ^~~~~~~~~~~~~~~~~~~~~ src/ast_selectors.hpp:135:18: warning: ‘virtual bool Sass::SimpleSelector::operator==(const Sass::SelectorList&) const’ was hidden [-Woverloaded-virtual=] 135 | virtual bool operator==(const SelectorList& rhs) const; | ^~~~~~~~ src/ast_def_macros.hpp:109:16: note: by ‘Sass::TypeSelector::operator==’ 109 | virtual bool operator==(const klass& rhs) const; \ | ^~~~~~~~ src/ast_selectors.hpp:174:5: note: in expansion of macro ‘ATTACH_CMP_OPERATIONS’ 174 | ATTACH_CMP_OPERATIONS(TypeSelector) | ^~~~~~~~~~~~~~~~~~~~~ src/ast_selectors.hpp:133:10: warning: ‘virtual bool Sass::SimpleSelector::operator==(const Sass::Selector&) const’ was hidden [-Woverloaded-virtual=] 133 | bool operator==(const Selector& rhs) const final override; | ^~~~~~~~ src/ast_def_macros.hpp:109:16: note: by ‘Sass::TypeSelector::operator==’ 109 | virtual bool operator==(const klass& rhs) const; \ | ^~~~~~~~ src/ast_selectors.hpp:174:5: note: in expansion of macro ‘ATTACH_CMP_OPERATIONS’ 174 | ATTACH_CMP_OPERATIONS(TypeSelector) | ^~~~~~~~~~~~~~~~~~~~~ src/ast_def_macros.hpp:106:16: warning: ‘virtual bool Sass::SimpleSelector::operator!=(const Sass::SimpleSelector&) const’ was hidden [-Woverloaded-virtual=] 106 | virtual bool operator!=(const klass& rhs) const { return !(*this == rhs); }; \ | ^~~~~~~~ src/ast_selectors.hpp:139:5: note: in expansion of macro ‘ATTACH_VIRTUAL_CMP_OPERATIONS’ 139 | ATTACH_VIRTUAL_CMP_OPERATIONS(SimpleSelector); | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~ src/ast_def_macros.hpp:110:16: note: by ‘virtual bool Sass::TypeSelector::operator!=(const Sass::TypeSelector&) const’ 110 | virtual bool operator!=(const klass& rhs) const { return !(*this == rhs); }; \ | ^~~~~~~~ src/ast_selectors.hpp:174:5: note: in expansion of macro ‘ATTACH_CMP_OPERATIONS’ 174 | ATTACH_CMP_OPERATIONS(TypeSelector) | ^~~~~~~~~~~~~~~~~~~~~ src/ast_selectors.hpp:137:18: warning: ‘virtual bool Sass::SimpleSelector::operator==(const Sass::CompoundSelector&) const’ was hidden [-Woverloaded-virtual=] 137 | virtual bool operator==(const CompoundSelector& rhs) const; | ^~~~~~~~ src/ast_def_macros.hpp:109:16: note: by ‘Sass::ClassSelector::operator==’ 109 | virtual bool operator==(const klass& rhs) const; \ | ^~~~~~~~ src/ast_selectors.hpp:188:5: note: in expansion of macro ‘ATTACH_CMP_OPERATIONS’ 188 | ATTACH_CMP_OPERATIONS(ClassSelector) | ^~~~~~~~~~~~~~~~~~~~~ src/ast_selectors.hpp:136:18: warning: ‘virtual bool Sass::SimpleSelector::operator==(const Sass::ComplexSelector&) const’ was hidden [-Woverloaded-virtual=] 136 | virtual bool operator==(const ComplexSelector& rhs) const; | ^~~~~~~~ src/ast_def_macros.hpp:109:16: note: by ‘Sass::ClassSelector::operator==’ 109 | virtual bool operator==(const klass& rhs) const; \ | ^~~~~~~~ src/ast_selectors.hpp:188:5: note: in expansion of macro ‘ATTACH_CMP_OPERATIONS’ 188 | ATTACH_CMP_OPERATIONS(ClassSelector) | ^~~~~~~~~~~~~~~~~~~~~ src/ast_selectors.hpp:135:18: warning: ‘virtual bool Sass::SimpleSelector::operator==(const Sass::SelectorList&) const’ was hidden [-Woverloaded-virtual=] 135 | virtual bool operator==(const SelectorList& rhs) const; | ^~~~~~~~ src/ast_def_macros.hpp:109:16: note: by ‘Sass::ClassSelector::operator==’ 109 | virtual bool operator==(const klass& rhs) const; \ | ^~~~~~~~ src/ast_selectors.hpp:188:5: note: in expansion of macro ‘ATTACH_CMP_OPERATIONS’ 188 | ATTACH_CMP_OPERATIONS(ClassSelector) | ^~~~~~~~~~~~~~~~~~~~~ src/ast_selectors.hpp:133:10: warning: ‘virtual bool Sass::SimpleSelector::operator==(const Sass::Selector&) const’ was hidden [-Woverloaded-virtual=] 133 | bool operator==(const Selector& rhs) const final override; | ^~~~~~~~ src/ast_def_macros.hpp:109:16: note: by ‘Sass::ClassSelector::operator==’ 109 | virtual bool operator==(const klass& rhs) const; \ | ^~~~~~~~ src/ast_selectors.hpp:188:5: note: in expansion of macro ‘ATTACH_CMP_OPERATIONS’ 188 | ATTACH_CMP_OPERATIONS(ClassSelector) | ^~~~~~~~~~~~~~~~~~~~~ src/ast_def_macros.hpp:106:16: warning: ‘virtual bool Sass::SimpleSelector::operator!=(const Sass::SimpleSelector&) const’ was hidden [-Woverloaded-virtual=] 106 | virtual bool operator!=(const klass& rhs) const { return !(*this == rhs); }; \ | ^~~~~~~~ src/ast_selectors.hpp:139:5: note: in expansion of macro ‘ATTACH_VIRTUAL_CMP_OPERATIONS’ 139 | ATTACH_VIRTUAL_CMP_OPERATIONS(SimpleSelector); | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~ src/ast_def_macros.hpp:110:16: note: by ‘virtual bool Sass::ClassSelector::operator!=(const Sass::ClassSelector&) const’ 110 | virtual bool operator!=(const klass& rhs) const { return !(*this == rhs); }; \ | ^~~~~~~~ src/ast_selectors.hpp:188:5: note: in expansion of macro ‘ATTACH_CMP_OPERATIONS’ 188 | ATTACH_CMP_OPERATIONS(ClassSelector) | ^~~~~~~~~~~~~~~~~~~~~ src/ast_selectors.hpp:137:18: warning: ‘virtual bool Sass::SimpleSelector::operator==(const Sass::CompoundSelector&) const’ was hidden [-Woverloaded-virtual=] 137 | virtual bool operator==(const CompoundSelector& rhs) const; | ^~~~~~~~ src/ast_def_macros.hpp:109:16: note: by ‘Sass::IDSelector::operator==’ 109 | virtual bool operator==(const klass& rhs) const; \ | ^~~~~~~~ src/ast_selectors.hpp:204:5: note: in expansion of macro ‘ATTACH_CMP_OPERATIONS’ 204 | ATTACH_CMP_OPERATIONS(IDSelector) | ^~~~~~~~~~~~~~~~~~~~~ src/ast_selectors.hpp:136:18: warning: ‘virtual bool Sass::SimpleSelector::operator==(const Sass::ComplexSelector&) const’ was hidden [-Woverloaded-virtual=] 136 | virtual bool operator==(const ComplexSelector& rhs) const; | ^~~~~~~~ src/ast_def_macros.hpp:109:16: note: by ‘Sass::IDSelector::operator==’ 109 | virtual bool operator==(const klass& rhs) const; \ | ^~~~~~~~ src/ast_selectors.hpp:204:5: note: in expansion of macro ‘ATTACH_CMP_OPERATIONS’ 204 | ATTACH_CMP_OPERATIONS(IDSelector) | ^~~~~~~~~~~~~~~~~~~~~ src/ast_selectors.hpp:135:18: warning: ‘virtual bool Sass::SimpleSelector::operator==(const Sass::SelectorList&) const’ was hidden [-Woverloaded-virtual=] 135 | virtual bool operator==(const SelectorList& rhs) const; | ^~~~~~~~ src/ast_def_macros.hpp:109:16: note: by ‘Sass::IDSelector::operator==’ 109 | virtual bool operator==(const klass& rhs) const; \ | ^~~~~~~~ src/ast_selectors.hpp:204:5: note: in expansion of macro ‘ATTACH_CMP_OPERATIONS’ 204 | ATTACH_CMP_OPERATIONS(IDSelector) | ^~~~~~~~~~~~~~~~~~~~~ src/ast_selectors.hpp:133:10: warning: ‘virtual bool Sass::SimpleSelector::operator==(const Sass::Selector&) const’ was hidden [-Woverloaded-virtual=] 133 | bool operator==(const Selector& rhs) const final override; | ^~~~~~~~ src/ast_def_macros.hpp:109:16: note: by ‘Sass::IDSelector::operator==’ 109 | virtual bool operator==(const klass& rhs) const; \ | ^~~~~~~~ src/ast_selectors.hpp:204:5: note: in expansion of macro ‘ATTACH_CMP_OPERATIONS’ 204 | ATTACH_CMP_OPERATIONS(IDSelector) | ^~~~~~~~~~~~~~~~~~~~~ src/ast_def_macros.hpp:106:16: warning: ‘virtual bool Sass::SimpleSelector::operator!=(const Sass::SimpleSelector&) const’ was hidden [-Woverloaded-virtual=] 106 | virtual bool operator!=(const klass& rhs) const { return !(*this == rhs); }; \ | ^~~~~~~~ src/ast_selectors.hpp:139:5: note: in expansion of macro ‘ATTACH_VIRTUAL_CMP_OPERATIONS’ 139 | ATTACH_VIRTUAL_CMP_OPERATIONS(SimpleSelector); | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~ src/ast_def_macros.hpp:110:16: note: by ‘virtual bool Sass::IDSelector::operator!=(const Sass::IDSelector&) const’ 110 | virtual bool operator!=(const klass& rhs) const { return !(*this == rhs); }; \ | ^~~~~~~~ src/ast_selectors.hpp:204:5: note: in expansion of macro ‘ATTACH_CMP_OPERATIONS’ 204 | ATTACH_CMP_OPERATIONS(IDSelector) | ^~~~~~~~~~~~~~~~~~~~~ src/ast_selectors.hpp:137:18: warning: ‘virtual bool Sass::SimpleSelector::operator==(const Sass::CompoundSelector&) const’ was hidden [-Woverloaded-virtual=] 137 | virtual bool operator==(const CompoundSelector& rhs) const; | ^~~~~~~~ src/ast_def_macros.hpp:109:16: note: by ‘Sass::AttributeSelector::operator==’ 109 | virtual bool operator==(const klass& rhs) const; \ | ^~~~~~~~ src/ast_selectors.hpp:223:5: note: in expansion of macro ‘ATTACH_CMP_OPERATIONS’ 223 | ATTACH_CMP_OPERATIONS(AttributeSelector) | ^~~~~~~~~~~~~~~~~~~~~ src/ast_selectors.hpp:136:18: warning: ‘virtual bool Sass::SimpleSelector::operator==(const Sass::ComplexSelector&) const’ was hidden [-Woverloaded-virtual=] 136 | virtual bool operator==(const ComplexSelector& rhs) const; | ^~~~~~~~ src/ast_def_macros.hpp:109:16: note: by ‘Sass::AttributeSelector::operator==’ 109 | virtual bool operator==(const klass& rhs) const; \ | ^~~~~~~~ src/ast_selectors.hpp:223:5: note: in expansion of macro ‘ATTACH_CMP_OPERATIONS’ 223 | ATTACH_CMP_OPERATIONS(AttributeSelector) | ^~~~~~~~~~~~~~~~~~~~~ src/ast_selectors.hpp:135:18: warning: ‘virtual bool Sass::SimpleSelector::operator==(const Sass::SelectorList&) const’ was hidden [-Woverloaded-virtual=] 135 | virtual bool operator==(const SelectorList& rhs) const; | ^~~~~~~~ src/ast_def_macros.hpp:109:16: note: by ‘Sass::AttributeSelector::operator==’ 109 | virtual bool operator==(const klass& rhs) const; \ | ^~~~~~~~ src/ast_selectors.hpp:223:5: note: in expansion of macro ‘ATTACH_CMP_OPERATIONS’ 223 | ATTACH_CMP_OPERATIONS(AttributeSelector) | ^~~~~~~~~~~~~~~~~~~~~ src/ast_selectors.hpp:133:10: warning: ‘virtual bool Sass::SimpleSelector::operator==(const Sass::Selector&) const’ was hidden [-Woverloaded-virtual=] 133 | bool operator==(const Selector& rhs) const final override; | ^~~~~~~~ src/ast_def_macros.hpp:109:16: note: by ‘Sass::AttributeSelector::operator==’ 109 | virtual bool operator==(const klass& rhs) const; \ | ^~~~~~~~ src/ast_selectors.hpp:223:5: note: in expansion of macro ‘ATTACH_CMP_OPERATIONS’ 223 | ATTACH_CMP_OPERATIONS(AttributeSelector) | ^~~~~~~~~~~~~~~~~~~~~ src/ast_def_macros.hpp:106:16: warning: ‘virtual bool Sass::SimpleSelector::operator!=(const Sass::SimpleSelector&) const’ was hidden [-Woverloaded-virtual=] 106 | virtual bool operator!=(const klass& rhs) const { return !(*this == rhs); }; \ | ^~~~~~~~ src/ast_selectors.hpp:139:5: note: in expansion of macro ‘ATTACH_VIRTUAL_CMP_OPERATIONS’ 139 | ATTACH_VIRTUAL_CMP_OPERATIONS(SimpleSelector); | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~ src/ast_def_macros.hpp:110:16: note: by ‘virtual bool Sass::AttributeSelector::operator!=(const Sass::AttributeSelector&) const’ 110 | virtual bool operator!=(const klass& rhs) const { return !(*this == rhs); }; \ | ^~~~~~~~ src/ast_selectors.hpp:223:5: note: in expansion of macro ‘ATTACH_CMP_OPERATIONS’ 223 | ATTACH_CMP_OPERATIONS(AttributeSelector) | ^~~~~~~~~~~~~~~~~~~~~ src/ast_def_macros.hpp:106:16: warning: ‘virtual bool Sass::Selector::operator!=(const Sass::Selector&) const’ was hidden [-Woverloaded-virtual=] 106 | virtual bool operator!=(const klass& rhs) const { return !(*this == rhs); }; \ | ^~~~~~~~ src/ast_selectors.hpp:56:5: note: in expansion of macro ‘ATTACH_VIRTUAL_CMP_OPERATIONS’ 56 | ATTACH_VIRTUAL_CMP_OPERATIONS(Selector) | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~ src/ast_def_macros.hpp:110:16: note: by ‘virtual bool Sass::ComplexSelector::operator!=(const Sass::ComplexSelector&) const’ 110 | virtual bool operator!=(const klass& rhs) const { return !(*this == rhs); }; \ | ^~~~~~~~ src/ast_selectors.hpp:310:5: note: in expansion of macro ‘ATTACH_CMP_OPERATIONS’ 310 | ATTACH_CMP_OPERATIONS(ComplexSelector) | ^~~~~~~~~~~~~~~~~~~~~ src/ast_def_macros.hpp:106:16: warning: ‘virtual bool Sass::Selector::operator!=(const Sass::Selector&) const’ was hidden [-Woverloaded-virtual=] 106 | virtual bool operator!=(const klass& rhs) const { return !(*this == rhs); }; \ | ^~~~~~~~ src/ast_selectors.hpp:56:5: note: in expansion of macro ‘ATTACH_VIRTUAL_CMP_OPERATIONS’ 56 | ATTACH_VIRTUAL_CMP_OPERATIONS(Selector) | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~ src/ast_def_macros.hpp:106:16: note: by ‘virtual bool Sass::SelectorComponent::operator!=(const Sass::SelectorComponent&) const’ 106 | virtual bool operator!=(const klass& rhs) const { return !(*this == rhs); }; \ | ^~~~~~~~ src/ast_selectors.hpp:349:5: note: in expansion of macro ‘ATTACH_VIRTUAL_CMP_OPERATIONS’ 349 | ATTACH_VIRTUAL_CMP_OPERATIONS(SelectorComponent); | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~ src/ast_def_macros.hpp:106:16: warning: ‘virtual bool Sass::SelectorComponent::operator!=(const Sass::SelectorComponent&) const’ was hidden [-Woverloaded-virtual=] 106 | virtual bool operator!=(const klass& rhs) const { return !(*this == rhs); }; \ | ^~~~~~~~ src/ast_selectors.hpp:349:5: note: in expansion of macro ‘ATTACH_VIRTUAL_CMP_OPERATIONS’ 349 | ATTACH_VIRTUAL_CMP_OPERATIONS(SelectorComponent); | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~ src/ast_def_macros.hpp:110:16: note: by ‘virtual bool Sass::SelectorCombinator::operator!=(const Sass::SelectorCombinator&) const’ 110 | virtual bool operator!=(const klass& rhs) const { return !(*this == rhs); }; \ | ^~~~~~~~ src/ast_selectors.hpp:407:5: note: in expansion of macro ‘ATTACH_CMP_OPERATIONS’ 407 | ATTACH_CMP_OPERATIONS(SelectorCombinator) | ^~~~~~~~~~~~~~~~~~~~~ g++ -std=gnu++17 -Wall -O2 -std=c++11 -I ./include -fPIC -c -o src/c2ast.o src/c2ast.cpp In file included from src/c2ast.cpp:1: src/ast.hpp:90:18: warning: ‘virtual bool Sass::AST_Node::operator==(const Sass::AST_Node&) const’ was hidden [-Woverloaded-virtual=] 90 | virtual bool operator== (const AST_Node& rhs) const { | ^~~~~~~~ src/ast.hpp:165:18: note: by ‘virtual bool Sass::Expression::operator==(const Sass::Expression&) const’ 165 | virtual bool operator== (const Expression& rhs) const { return false; } | ^~~~~~~~ src/ast.hpp:96:18: warning: ‘virtual bool Sass::AST_Node::operator!=(const Sass::AST_Node&) const’ was hidden [-Woverloaded-virtual=] 96 | virtual bool operator!= (const AST_Node& rhs) const { | ^~~~~~~~ src/ast.hpp:167:17: note: by ‘bool Sass::Expression::operator!=(const Sass::Expression&) const’ 167 | inline bool operator!=(const Expression& rhs) const { return !(rhs == *this); } | ^~~~~~~~ src/ast.hpp:90:18: warning: ‘virtual bool Sass::AST_Node::operator==(const Sass::AST_Node&) const’ was hidden [-Woverloaded-virtual=] 90 | virtual bool operator== (const AST_Node& rhs) const { | ^~~~~~~~ src/ast.hpp:908:10: note: by ‘bool Sass::CssMediaRule::operator==(const Sass::CssMediaRule&) const’ 908 | bool operator== (const CssMediaRule& rhs) const { | ^~~~~~~~ src/ast.hpp:96:18: warning: ‘virtual bool Sass::AST_Node::operator!=(const Sass::AST_Node&) const’ was hidden [-Woverloaded-virtual=] 96 | virtual bool operator!= (const AST_Node& rhs) const { | ^~~~~~~~ src/ast.hpp:911:10: note: by ‘bool Sass::CssMediaRule::operator!=(const Sass::CssMediaRule&) const’ 911 | bool operator!=(const CssMediaRule& rhs) const { | ^~~~~~~~ src/ast.hpp:90:18: warning: ‘virtual bool Sass::AST_Node::operator==(const Sass::AST_Node&) const’ was hidden [-Woverloaded-virtual=] 90 | virtual bool operator== (const AST_Node& rhs) const { | ^~~~~~~~ src/ast.hpp:939:10: note: by ‘bool Sass::CssMediaQuery::operator==(const Sass::CssMediaQuery&) const’ 939 | bool operator== (const CssMediaQuery& rhs) const; | ^~~~~~~~ src/ast.hpp:96:18: warning: ‘virtual bool Sass::AST_Node::operator!=(const Sass::AST_Node&) const’ was hidden [-Woverloaded-virtual=] 96 | virtual bool operator!= (const AST_Node& rhs) const { | ^~~~~~~~ src/ast.hpp:940:10: note: by ‘bool Sass::CssMediaQuery::operator!=(const Sass::CssMediaQuery&) const’ 940 | bool operator!=(const CssMediaQuery& rhs) const { | ^~~~~~~~ src/ast.hpp:165:18: warning: ‘virtual bool Sass::Expression::operator==(const Sass::Expression&) const’ was hidden [-Woverloaded-virtual=] 165 | virtual bool operator== (const Expression& rhs) const { return false; } | ^~~~~~~~ In file included from src/ast.hpp:14: src/ast_def_macros.hpp:105:16: note: by ‘virtual bool Sass::Selector::operator==(const Sass::Selector&) const’ 105 | virtual bool operator==(const klass& rhs) const = 0; \ | ^~~~~~~~ src/ast_selectors.hpp:56:5: note: in expansion of macro ‘ATTACH_VIRTUAL_CMP_OPERATIONS’ 56 | ATTACH_VIRTUAL_CMP_OPERATIONS(Selector) | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~ src/ast.hpp:96:18: warning: ‘virtual bool Sass::AST_Node::operator!=(const Sass::AST_Node&) const’ was hidden [-Woverloaded-virtual=] 96 | virtual bool operator!= (const AST_Node& rhs) const { | ^~~~~~~~ src/ast_def_macros.hpp:106:16: note: by ‘virtual bool Sass::Selector::operator!=(const Sass::Selector&) const’ 106 | virtual bool operator!=(const klass& rhs) const { return !(*this == rhs); }; \ | ^~~~~~~~ src/ast_selectors.hpp:56:5: note: in expansion of macro ‘ATTACH_VIRTUAL_CMP_OPERATIONS’ 56 | ATTACH_VIRTUAL_CMP_OPERATIONS(Selector) | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~ src/ast_def_macros.hpp:106:16: warning: ‘virtual bool Sass::Selector::operator!=(const Sass::Selector&) const’ was hidden [-Woverloaded-virtual=] 106 | virtual bool operator!=(const klass& rhs) const { return !(*this == rhs); }; \ | ^~~~~~~~ src/ast_selectors.hpp:56:5: note: in expansion of macro ‘ATTACH_VIRTUAL_CMP_OPERATIONS’ 56 | ATTACH_VIRTUAL_CMP_OPERATIONS(Selector) | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~ src/ast_def_macros.hpp:106:16: note: by ‘virtual bool Sass::SimpleSelector::operator!=(const Sass::SimpleSelector&) const’ 106 | virtual bool operator!=(const klass& rhs) const { return !(*this == rhs); }; \ | ^~~~~~~~ src/ast_selectors.hpp:139:5: note: in expansion of macro ‘ATTACH_VIRTUAL_CMP_OPERATIONS’ 139 | ATTACH_VIRTUAL_CMP_OPERATIONS(SimpleSelector); | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~ In file included from src/ast.hpp:1055: src/ast_selectors.hpp:137:18: warning: ‘virtual bool Sass::SimpleSelector::operator==(const Sass::CompoundSelector&) const’ was hidden [-Woverloaded-virtual=] 137 | virtual bool operator==(const CompoundSelector& rhs) const; | ^~~~~~~~ src/ast_def_macros.hpp:109:16: note: by ‘Sass::PlaceholderSelector::operator==’ 109 | virtual bool operator==(const klass& rhs) const; \ | ^~~~~~~~ src/ast_selectors.hpp:157:5: note: in expansion of macro ‘ATTACH_CMP_OPERATIONS’ 157 | ATTACH_CMP_OPERATIONS(PlaceholderSelector) | ^~~~~~~~~~~~~~~~~~~~~ src/ast_selectors.hpp:136:18: warning: ‘virtual bool Sass::SimpleSelector::operator==(const Sass::ComplexSelector&) const’ was hidden [-Woverloaded-virtual=] 136 | virtual bool operator==(const ComplexSelector& rhs) const; | ^~~~~~~~ src/ast_def_macros.hpp:109:16: note: by ‘Sass::PlaceholderSelector::operator==’ 109 | virtual bool operator==(const klass& rhs) const; \ | ^~~~~~~~ src/ast_selectors.hpp:157:5: note: in expansion of macro ‘ATTACH_CMP_OPERATIONS’ 157 | ATTACH_CMP_OPERATIONS(PlaceholderSelector) | ^~~~~~~~~~~~~~~~~~~~~ src/ast_selectors.hpp:135:18: warning: ‘virtual bool Sass::SimpleSelector::operator==(const Sass::SelectorList&) const’ was hidden [-Woverloaded-virtual=] 135 | virtual bool operator==(const SelectorList& rhs) const; | ^~~~~~~~ src/ast_def_macros.hpp:109:16: note: by ‘Sass::PlaceholderSelector::operator==’ 109 | virtual bool operator==(const klass& rhs) const; \ | ^~~~~~~~ src/ast_selectors.hpp:157:5: note: in expansion of macro ‘ATTACH_CMP_OPERATIONS’ 157 | ATTACH_CMP_OPERATIONS(PlaceholderSelector) | ^~~~~~~~~~~~~~~~~~~~~ src/ast_selectors.hpp:133:10: warning: ‘virtual bool Sass::SimpleSelector::operator==(const Sass::Selector&) const’ was hidden [-Woverloaded-virtual=] 133 | bool operator==(const Selector& rhs) const final override; | ^~~~~~~~ src/ast_def_macros.hpp:109:16: note: by ‘Sass::PlaceholderSelector::operator==’ 109 | virtual bool operator==(const klass& rhs) const; \ | ^~~~~~~~ src/ast_selectors.hpp:157:5: note: in expansion of macro ‘ATTACH_CMP_OPERATIONS’ 157 | ATTACH_CMP_OPERATIONS(PlaceholderSelector) | ^~~~~~~~~~~~~~~~~~~~~ src/ast_def_macros.hpp:106:16: warning: ‘virtual bool Sass::SimpleSelector::operator!=(const Sass::SimpleSelector&) const’ was hidden [-Woverloaded-virtual=] 106 | virtual bool operator!=(const klass& rhs) const { return !(*this == rhs); }; \ | ^~~~~~~~ src/ast_selectors.hpp:139:5: note: in expansion of macro ‘ATTACH_VIRTUAL_CMP_OPERATIONS’ 139 | ATTACH_VIRTUAL_CMP_OPERATIONS(SimpleSelector); | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~ src/ast_def_macros.hpp:110:16: note: by ‘virtual bool Sass::PlaceholderSelector::operator!=(const Sass::PlaceholderSelector&) const’ 110 | virtual bool operator!=(const klass& rhs) const { return !(*this == rhs); }; \ | ^~~~~~~~ src/ast_selectors.hpp:157:5: note: in expansion of macro ‘ATTACH_CMP_OPERATIONS’ 157 | ATTACH_CMP_OPERATIONS(PlaceholderSelector) | ^~~~~~~~~~~~~~~~~~~~~ src/ast_selectors.hpp:137:18: warning: ‘virtual bool Sass::SimpleSelector::operator==(const Sass::CompoundSelector&) const’ was hidden [-Woverloaded-virtual=] 137 | virtual bool operator==(const CompoundSelector& rhs) const; | ^~~~~~~~ src/ast_def_macros.hpp:109:16: note: by ‘Sass::TypeSelector::operator==’ 109 | virtual bool operator==(const klass& rhs) const; \ | ^~~~~~~~ src/ast_selectors.hpp:174:5: note: in expansion of macro ‘ATTACH_CMP_OPERATIONS’ 174 | ATTACH_CMP_OPERATIONS(TypeSelector) | ^~~~~~~~~~~~~~~~~~~~~ src/ast_selectors.hpp:136:18: warning: ‘virtual bool Sass::SimpleSelector::operator==(const Sass::ComplexSelector&) const’ was hidden [-Woverloaded-virtual=] 136 | virtual bool operator==(const ComplexSelector& rhs) const; | ^~~~~~~~ src/ast_def_macros.hpp:109:16: note: by ‘Sass::TypeSelector::operator==’ 109 | virtual bool operator==(const klass& rhs) const; \ | ^~~~~~~~ src/ast_selectors.hpp:174:5: note: in expansion of macro ‘ATTACH_CMP_OPERATIONS’ 174 | ATTACH_CMP_OPERATIONS(TypeSelector) | ^~~~~~~~~~~~~~~~~~~~~ src/ast_selectors.hpp:135:18: warning: ‘virtual bool Sass::SimpleSelector::operator==(const Sass::SelectorList&) const’ was hidden [-Woverloaded-virtual=] 135 | virtual bool operator==(const SelectorList& rhs) const; | ^~~~~~~~ src/ast_def_macros.hpp:109:16: note: by ‘Sass::TypeSelector::operator==’ 109 | virtual bool operator==(const klass& rhs) const; \ | ^~~~~~~~ src/ast_selectors.hpp:174:5: note: in expansion of macro ‘ATTACH_CMP_OPERATIONS’ 174 | ATTACH_CMP_OPERATIONS(TypeSelector) | ^~~~~~~~~~~~~~~~~~~~~ src/ast_selectors.hpp:133:10: warning: ‘virtual bool Sass::SimpleSelector::operator==(const Sass::Selector&) const’ was hidden [-Woverloaded-virtual=] 133 | bool operator==(const Selector& rhs) const final override; | ^~~~~~~~ src/ast_def_macros.hpp:109:16: note: by ‘Sass::TypeSelector::operator==’ 109 | virtual bool operator==(const klass& rhs) const; \ | ^~~~~~~~ src/ast_selectors.hpp:174:5: note: in expansion of macro ‘ATTACH_CMP_OPERATIONS’ 174 | ATTACH_CMP_OPERATIONS(TypeSelector) | ^~~~~~~~~~~~~~~~~~~~~ src/ast_def_macros.hpp:106:16: warning: ‘virtual bool Sass::SimpleSelector::operator!=(const Sass::SimpleSelector&) const’ was hidden [-Woverloaded-virtual=] 106 | virtual bool operator!=(const klass& rhs) const { return !(*this == rhs); }; \ | ^~~~~~~~ src/ast_selectors.hpp:139:5: note: in expansion of macro ‘ATTACH_VIRTUAL_CMP_OPERATIONS’ 139 | ATTACH_VIRTUAL_CMP_OPERATIONS(SimpleSelector); | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~ src/ast_def_macros.hpp:110:16: note: by ‘virtual bool Sass::TypeSelector::operator!=(const Sass::TypeSelector&) const’ 110 | virtual bool operator!=(const klass& rhs) const { return !(*this == rhs); }; \ | ^~~~~~~~ src/ast_selectors.hpp:174:5: note: in expansion of macro ‘ATTACH_CMP_OPERATIONS’ 174 | ATTACH_CMP_OPERATIONS(TypeSelector) | ^~~~~~~~~~~~~~~~~~~~~ src/ast_selectors.hpp:137:18: warning: ‘virtual bool Sass::SimpleSelector::operator==(const Sass::CompoundSelector&) const’ was hidden [-Woverloaded-virtual=] 137 | virtual bool operator==(const CompoundSelector& rhs) const; | ^~~~~~~~ src/ast_def_macros.hpp:109:16: note: by ‘Sass::ClassSelector::operator==’ 109 | virtual bool operator==(const klass& rhs) const; \ | ^~~~~~~~ src/ast_selectors.hpp:188:5: note: in expansion of macro ‘ATTACH_CMP_OPERATIONS’ 188 | ATTACH_CMP_OPERATIONS(ClassSelector) | ^~~~~~~~~~~~~~~~~~~~~ src/ast_selectors.hpp:136:18: warning: ‘virtual bool Sass::SimpleSelector::operator==(const Sass::ComplexSelector&) const’ was hidden [-Woverloaded-virtual=] 136 | virtual bool operator==(const ComplexSelector& rhs) const; | ^~~~~~~~ src/ast_def_macros.hpp:109:16: note: by ‘Sass::ClassSelector::operator==’ 109 | virtual bool operator==(const klass& rhs) const; \ | ^~~~~~~~ src/ast_selectors.hpp:188:5: note: in expansion of macro ‘ATTACH_CMP_OPERATIONS’ 188 | ATTACH_CMP_OPERATIONS(ClassSelector) | ^~~~~~~~~~~~~~~~~~~~~ src/ast_selectors.hpp:135:18: warning: ‘virtual bool Sass::SimpleSelector::operator==(const Sass::SelectorList&) const’ was hidden [-Woverloaded-virtual=] 135 | virtual bool operator==(const SelectorList& rhs) const; | ^~~~~~~~ src/ast_def_macros.hpp:109:16: note: by ‘Sass::ClassSelector::operator==’ 109 | virtual bool operator==(const klass& rhs) const; \ | ^~~~~~~~ src/ast_selectors.hpp:188:5: note: in expansion of macro ‘ATTACH_CMP_OPERATIONS’ 188 | ATTACH_CMP_OPERATIONS(ClassSelector) | ^~~~~~~~~~~~~~~~~~~~~ src/ast_selectors.hpp:133:10: warning: ‘virtual bool Sass::SimpleSelector::operator==(const Sass::Selector&) const’ was hidden [-Woverloaded-virtual=] 133 | bool operator==(const Selector& rhs) const final override; | ^~~~~~~~ src/ast_def_macros.hpp:109:16: note: by ‘Sass::ClassSelector::operator==’ 109 | virtual bool operator==(const klass& rhs) const; \ | ^~~~~~~~ src/ast_selectors.hpp:188:5: note: in expansion of macro ‘ATTACH_CMP_OPERATIONS’ 188 | ATTACH_CMP_OPERATIONS(ClassSelector) | ^~~~~~~~~~~~~~~~~~~~~ src/ast_def_macros.hpp:106:16: warning: ‘virtual bool Sass::SimpleSelector::operator!=(const Sass::SimpleSelector&) const’ was hidden [-Woverloaded-virtual=] 106 | virtual bool operator!=(const klass& rhs) const { return !(*this == rhs); }; \ | ^~~~~~~~ src/ast_selectors.hpp:139:5: note: in expansion of macro ‘ATTACH_VIRTUAL_CMP_OPERATIONS’ 139 | ATTACH_VIRTUAL_CMP_OPERATIONS(SimpleSelector); | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~ src/ast_def_macros.hpp:110:16: note: by ‘virtual bool Sass::ClassSelector::operator!=(const Sass::ClassSelector&) const’ 110 | virtual bool operator!=(const klass& rhs) const { return !(*this == rhs); }; \ | ^~~~~~~~ src/ast_selectors.hpp:188:5: note: in expansion of macro ‘ATTACH_CMP_OPERATIONS’ 188 | ATTACH_CMP_OPERATIONS(ClassSelector) | ^~~~~~~~~~~~~~~~~~~~~ src/ast_selectors.hpp:137:18: warning: ‘virtual bool Sass::SimpleSelector::operator==(const Sass::CompoundSelector&) const’ was hidden [-Woverloaded-virtual=] 137 | virtual bool operator==(const CompoundSelector& rhs) const; | ^~~~~~~~ src/ast_def_macros.hpp:109:16: note: by ‘Sass::IDSelector::operator==’ 109 | virtual bool operator==(const klass& rhs) const; \ | ^~~~~~~~ src/ast_selectors.hpp:204:5: note: in expansion of macro ‘ATTACH_CMP_OPERATIONS’ 204 | ATTACH_CMP_OPERATIONS(IDSelector) | ^~~~~~~~~~~~~~~~~~~~~ src/ast_selectors.hpp:136:18: warning: ‘virtual bool Sass::SimpleSelector::operator==(const Sass::ComplexSelector&) const’ was hidden [-Woverloaded-virtual=] 136 | virtual bool operator==(const ComplexSelector& rhs) const; | ^~~~~~~~ src/ast_def_macros.hpp:109:16: note: by ‘Sass::IDSelector::operator==’ 109 | virtual bool operator==(const klass& rhs) const; \ | ^~~~~~~~ src/ast_selectors.hpp:204:5: note: in expansion of macro ‘ATTACH_CMP_OPERATIONS’ 204 | ATTACH_CMP_OPERATIONS(IDSelector) | ^~~~~~~~~~~~~~~~~~~~~ src/ast_selectors.hpp:135:18: warning: ‘virtual bool Sass::SimpleSelector::operator==(const Sass::SelectorList&) const’ was hidden [-Woverloaded-virtual=] 135 | virtual bool operator==(const SelectorList& rhs) const; | ^~~~~~~~ src/ast_def_macros.hpp:109:16: note: by ‘Sass::IDSelector::operator==’ 109 | virtual bool operator==(const klass& rhs) const; \ | ^~~~~~~~ src/ast_selectors.hpp:204:5: note: in expansion of macro ‘ATTACH_CMP_OPERATIONS’ 204 | ATTACH_CMP_OPERATIONS(IDSelector) | ^~~~~~~~~~~~~~~~~~~~~ src/ast_selectors.hpp:133:10: warning: ‘virtual bool Sass::SimpleSelector::operator==(const Sass::Selector&) const’ was hidden [-Woverloaded-virtual=] 133 | bool operator==(const Selector& rhs) const final override; | ^~~~~~~~ src/ast_def_macros.hpp:109:16: note: by ‘Sass::IDSelector::operator==’ 109 | virtual bool operator==(const klass& rhs) const; \ | ^~~~~~~~ src/ast_selectors.hpp:204:5: note: in expansion of macro ‘ATTACH_CMP_OPERATIONS’ 204 | ATTACH_CMP_OPERATIONS(IDSelector) | ^~~~~~~~~~~~~~~~~~~~~ src/ast_def_macros.hpp:106:16: warning: ‘virtual bool Sass::SimpleSelector::operator!=(const Sass::SimpleSelector&) const’ was hidden [-Woverloaded-virtual=] 106 | virtual bool operator!=(const klass& rhs) const { return !(*this == rhs); }; \ | ^~~~~~~~ src/ast_selectors.hpp:139:5: note: in expansion of macro ‘ATTACH_VIRTUAL_CMP_OPERATIONS’ 139 | ATTACH_VIRTUAL_CMP_OPERATIONS(SimpleSelector); | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~ src/ast_def_macros.hpp:110:16: note: by ‘virtual bool Sass::IDSelector::operator!=(const Sass::IDSelector&) const’ 110 | virtual bool operator!=(const klass& rhs) const { return !(*this == rhs); }; \ | ^~~~~~~~ src/ast_selectors.hpp:204:5: note: in expansion of macro ‘ATTACH_CMP_OPERATIONS’ 204 | ATTACH_CMP_OPERATIONS(IDSelector) | ^~~~~~~~~~~~~~~~~~~~~ src/ast_selectors.hpp:137:18: warning: ‘virtual bool Sass::SimpleSelector::operator==(const Sass::CompoundSelector&) const’ was hidden [-Woverloaded-virtual=] 137 | virtual bool operator==(const CompoundSelector& rhs) const; | ^~~~~~~~ src/ast_def_macros.hpp:109:16: note: by ‘Sass::AttributeSelector::operator==’ 109 | virtual bool operator==(const klass& rhs) const; \ | ^~~~~~~~ src/ast_selectors.hpp:223:5: note: in expansion of macro ‘ATTACH_CMP_OPERATIONS’ 223 | ATTACH_CMP_OPERATIONS(AttributeSelector) | ^~~~~~~~~~~~~~~~~~~~~ src/ast_selectors.hpp:136:18: warning: ‘virtual bool Sass::SimpleSelector::operator==(const Sass::ComplexSelector&) const’ was hidden [-Woverloaded-virtual=] 136 | virtual bool operator==(const ComplexSelector& rhs) const; | ^~~~~~~~ src/ast_def_macros.hpp:109:16: note: by ‘Sass::AttributeSelector::operator==’ 109 | virtual bool operator==(const klass& rhs) const; \ | ^~~~~~~~ src/ast_selectors.hpp:223:5: note: in expansion of macro ‘ATTACH_CMP_OPERATIONS’ 223 | ATTACH_CMP_OPERATIONS(AttributeSelector) | ^~~~~~~~~~~~~~~~~~~~~ src/ast_selectors.hpp:135:18: warning: ‘virtual bool Sass::SimpleSelector::operator==(const Sass::SelectorList&) const’ was hidden [-Woverloaded-virtual=] 135 | virtual bool operator==(const SelectorList& rhs) const; | ^~~~~~~~ src/ast_def_macros.hpp:109:16: note: by ‘Sass::AttributeSelector::operator==’ 109 | virtual bool operator==(const klass& rhs) const; \ | ^~~~~~~~ src/ast_selectors.hpp:223:5: note: in expansion of macro ‘ATTACH_CMP_OPERATIONS’ 223 | ATTACH_CMP_OPERATIONS(AttributeSelector) | ^~~~~~~~~~~~~~~~~~~~~ src/ast_selectors.hpp:133:10: warning: ‘virtual bool Sass::SimpleSelector::operator==(const Sass::Selector&) const’ was hidden [-Woverloaded-virtual=] 133 | bool operator==(const Selector& rhs) const final override; | ^~~~~~~~ src/ast_def_macros.hpp:109:16: note: by ‘Sass::AttributeSelector::operator==’ 109 | virtual bool operator==(const klass& rhs) const; \ | ^~~~~~~~ src/ast_selectors.hpp:223:5: note: in expansion of macro ‘ATTACH_CMP_OPERATIONS’ 223 | ATTACH_CMP_OPERATIONS(AttributeSelector) | ^~~~~~~~~~~~~~~~~~~~~ src/ast_def_macros.hpp:106:16: warning: ‘virtual bool Sass::SimpleSelector::operator!=(const Sass::SimpleSelector&) const’ was hidden [-Woverloaded-virtual=] 106 | virtual bool operator!=(const klass& rhs) const { return !(*this == rhs); }; \ | ^~~~~~~~ src/ast_selectors.hpp:139:5: note: in expansion of macro ‘ATTACH_VIRTUAL_CMP_OPERATIONS’ 139 | ATTACH_VIRTUAL_CMP_OPERATIONS(SimpleSelector); | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~ src/ast_def_macros.hpp:110:16: note: by ‘virtual bool Sass::AttributeSelector::operator!=(const Sass::AttributeSelector&) const’ 110 | virtual bool operator!=(const klass& rhs) const { return !(*this == rhs); }; \ | ^~~~~~~~ src/ast_selectors.hpp:223:5: note: in expansion of macro ‘ATTACH_CMP_OPERATIONS’ 223 | ATTACH_CMP_OPERATIONS(AttributeSelector) | ^~~~~~~~~~~~~~~~~~~~~ src/ast_def_macros.hpp:106:16: warning: ‘virtual bool Sass::Selector::operator!=(const Sass::Selector&) const’ was hidden [-Woverloaded-virtual=] 106 | virtual bool operator!=(const klass& rhs) const { return !(*this == rhs); }; \ | ^~~~~~~~ src/ast_selectors.hpp:56:5: note: in expansion of macro ‘ATTACH_VIRTUAL_CMP_OPERATIONS’ 56 | ATTACH_VIRTUAL_CMP_OPERATIONS(Selector) | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~ src/ast_def_macros.hpp:110:16: note: by ‘virtual bool Sass::ComplexSelector::operator!=(const Sass::ComplexSelector&) const’ 110 | virtual bool operator!=(const klass& rhs) const { return !(*this == rhs); }; \ | ^~~~~~~~ src/ast_selectors.hpp:310:5: note: in expansion of macro ‘ATTACH_CMP_OPERATIONS’ 310 | ATTACH_CMP_OPERATIONS(ComplexSelector) | ^~~~~~~~~~~~~~~~~~~~~ src/ast_def_macros.hpp:106:16: warning: ‘virtual bool Sass::Selector::operator!=(const Sass::Selector&) const’ was hidden [-Woverloaded-virtual=] 106 | virtual bool operator!=(const klass& rhs) const { return !(*this == rhs); }; \ | ^~~~~~~~ src/ast_selectors.hpp:56:5: note: in expansion of macro ‘ATTACH_VIRTUAL_CMP_OPERATIONS’ 56 | ATTACH_VIRTUAL_CMP_OPERATIONS(Selector) | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~ src/ast_def_macros.hpp:106:16: note: by ‘virtual bool Sass::SelectorComponent::operator!=(const Sass::SelectorComponent&) const’ 106 | virtual bool operator!=(const klass& rhs) const { return !(*this == rhs); }; \ | ^~~~~~~~ src/ast_selectors.hpp:349:5: note: in expansion of macro ‘ATTACH_VIRTUAL_CMP_OPERATIONS’ 349 | ATTACH_VIRTUAL_CMP_OPERATIONS(SelectorComponent); | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~ src/ast_def_macros.hpp:106:16: warning: ‘virtual bool Sass::SelectorComponent::operator!=(const Sass::SelectorComponent&) const’ was hidden [-Woverloaded-virtual=] 106 | virtual bool operator!=(const klass& rhs) const { return !(*this == rhs); }; \ | ^~~~~~~~ src/ast_selectors.hpp:349:5: note: in expansion of macro ‘ATTACH_VIRTUAL_CMP_OPERATIONS’ 349 | ATTACH_VIRTUAL_CMP_OPERATIONS(SelectorComponent); | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~ src/ast_def_macros.hpp:110:16: note: by ‘virtual bool Sass::SelectorCombinator::operator!=(const Sass::SelectorCombinator&) const’ 110 | virtual bool operator!=(const klass& rhs) const { return !(*this == rhs); }; \ | ^~~~~~~~ src/ast_selectors.hpp:407:5: note: in expansion of macro ‘ATTACH_CMP_OPERATIONS’ 407 | ATTACH_CMP_OPERATIONS(SelectorCombinator) | ^~~~~~~~~~~~~~~~~~~~~ g++ -std=gnu++17 -Wall -O2 -std=c++11 -I ./include -fPIC -c -o src/to_value.o src/to_value.cpp In file included from src/to_value.cpp:5: src/ast.hpp:90:18: warning: ‘virtual bool Sass::AST_Node::operator==(const Sass::AST_Node&) const’ was hidden [-Woverloaded-virtual=] 90 | virtual bool operator== (const AST_Node& rhs) const { | ^~~~~~~~ src/ast.hpp:165:18: note: by ‘virtual bool Sass::Expression::operator==(const Sass::Expression&) const’ 165 | virtual bool operator== (const Expression& rhs) const { return false; } | ^~~~~~~~ src/ast.hpp:96:18: warning: ‘virtual bool Sass::AST_Node::operator!=(const Sass::AST_Node&) const’ was hidden [-Woverloaded-virtual=] 96 | virtual bool operator!= (const AST_Node& rhs) const { | ^~~~~~~~ src/ast.hpp:167:17: note: by ‘bool Sass::Expression::operator!=(const Sass::Expression&) const’ 167 | inline bool operator!=(const Expression& rhs) const { return !(rhs == *this); } | ^~~~~~~~ src/ast.hpp:90:18: warning: ‘virtual bool Sass::AST_Node::operator==(const Sass::AST_Node&) const’ was hidden [-Woverloaded-virtual=] 90 | virtual bool operator== (const AST_Node& rhs) const { | ^~~~~~~~ src/ast.hpp:908:10: note: by ‘bool Sass::CssMediaRule::operator==(const Sass::CssMediaRule&) const’ 908 | bool operator== (const CssMediaRule& rhs) const { | ^~~~~~~~ src/ast.hpp:96:18: warning: ‘virtual bool Sass::AST_Node::operator!=(const Sass::AST_Node&) const’ was hidden [-Woverloaded-virtual=] 96 | virtual bool operator!= (const AST_Node& rhs) const { | ^~~~~~~~ src/ast.hpp:911:10: note: by ‘bool Sass::CssMediaRule::operator!=(const Sass::CssMediaRule&) const’ 911 | bool operator!=(const CssMediaRule& rhs) const { | ^~~~~~~~ src/ast.hpp:90:18: warning: ‘virtual bool Sass::AST_Node::operator==(const Sass::AST_Node&) const’ was hidden [-Woverloaded-virtual=] 90 | virtual bool operator== (const AST_Node& rhs) const { | ^~~~~~~~ src/ast.hpp:939:10: note: by ‘bool Sass::CssMediaQuery::operator==(const Sass::CssMediaQuery&) const’ 939 | bool operator== (const CssMediaQuery& rhs) const; | ^~~~~~~~ src/ast.hpp:96:18: warning: ‘virtual bool Sass::AST_Node::operator!=(const Sass::AST_Node&) const’ was hidden [-Woverloaded-virtual=] 96 | virtual bool operator!= (const AST_Node& rhs) const { | ^~~~~~~~ src/ast.hpp:940:10: note: by ‘bool Sass::CssMediaQuery::operator!=(const Sass::CssMediaQuery&) const’ 940 | bool operator!=(const CssMediaQuery& rhs) const { | ^~~~~~~~ src/ast.hpp:165:18: warning: ‘virtual bool Sass::Expression::operator==(const Sass::Expression&) const’ was hidden [-Woverloaded-virtual=] 165 | virtual bool operator== (const Expression& rhs) const { return false; } | ^~~~~~~~ In file included from src/ast.hpp:14: src/ast_def_macros.hpp:105:16: note: by ‘virtual bool Sass::Selector::operator==(const Sass::Selector&) const’ 105 | virtual bool operator==(const klass& rhs) const = 0; \ | ^~~~~~~~ src/ast_selectors.hpp:56:5: note: in expansion of macro ‘ATTACH_VIRTUAL_CMP_OPERATIONS’ 56 | ATTACH_VIRTUAL_CMP_OPERATIONS(Selector) | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~ src/ast.hpp:96:18: warning: ‘virtual bool Sass::AST_Node::operator!=(const Sass::AST_Node&) const’ was hidden [-Woverloaded-virtual=] 96 | virtual bool operator!= (const AST_Node& rhs) const { | ^~~~~~~~ src/ast_def_macros.hpp:106:16: note: by ‘virtual bool Sass::Selector::operator!=(const Sass::Selector&) const’ 106 | virtual bool operator!=(const klass& rhs) const { return !(*this == rhs); }; \ | ^~~~~~~~ src/ast_selectors.hpp:56:5: note: in expansion of macro ‘ATTACH_VIRTUAL_CMP_OPERATIONS’ 56 | ATTACH_VIRTUAL_CMP_OPERATIONS(Selector) | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~ src/ast_def_macros.hpp:106:16: warning: ‘virtual bool Sass::Selector::operator!=(const Sass::Selector&) const’ was hidden [-Woverloaded-virtual=] 106 | virtual bool operator!=(const klass& rhs) const { return !(*this == rhs); }; \ | ^~~~~~~~ src/ast_selectors.hpp:56:5: note: in expansion of macro ‘ATTACH_VIRTUAL_CMP_OPERATIONS’ 56 | ATTACH_VIRTUAL_CMP_OPERATIONS(Selector) | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~ src/ast_def_macros.hpp:106:16: note: by ‘virtual bool Sass::SimpleSelector::operator!=(const Sass::SimpleSelector&) const’ 106 | virtual bool operator!=(const klass& rhs) const { return !(*this == rhs); }; \ | ^~~~~~~~ src/ast_selectors.hpp:139:5: note: in expansion of macro ‘ATTACH_VIRTUAL_CMP_OPERATIONS’ 139 | ATTACH_VIRTUAL_CMP_OPERATIONS(SimpleSelector); | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~ In file included from src/ast.hpp:1055: src/ast_selectors.hpp:137:18: warning: ‘virtual bool Sass::SimpleSelector::operator==(const Sass::CompoundSelector&) const’ was hidden [-Woverloaded-virtual=] 137 | virtual bool operator==(const CompoundSelector& rhs) const; | ^~~~~~~~ src/ast_def_macros.hpp:109:16: note: by ‘Sass::PlaceholderSelector::operator==’ 109 | virtual bool operator==(const klass& rhs) const; \ | ^~~~~~~~ src/ast_selectors.hpp:157:5: note: in expansion of macro ‘ATTACH_CMP_OPERATIONS’ 157 | ATTACH_CMP_OPERATIONS(PlaceholderSelector) | ^~~~~~~~~~~~~~~~~~~~~ src/ast_selectors.hpp:136:18: warning: ‘virtual bool Sass::SimpleSelector::operator==(const Sass::ComplexSelector&) const’ was hidden [-Woverloaded-virtual=] 136 | virtual bool operator==(const ComplexSelector& rhs) const; | ^~~~~~~~ src/ast_def_macros.hpp:109:16: note: by ‘Sass::PlaceholderSelector::operator==’ 109 | virtual bool operator==(const klass& rhs) const; \ | ^~~~~~~~ src/ast_selectors.hpp:157:5: note: in expansion of macro ‘ATTACH_CMP_OPERATIONS’ 157 | ATTACH_CMP_OPERATIONS(PlaceholderSelector) | ^~~~~~~~~~~~~~~~~~~~~ src/ast_selectors.hpp:135:18: warning: ‘virtual bool Sass::SimpleSelector::operator==(const Sass::SelectorList&) const’ was hidden [-Woverloaded-virtual=] 135 | virtual bool operator==(const SelectorList& rhs) const; | ^~~~~~~~ src/ast_def_macros.hpp:109:16: note: by ‘Sass::PlaceholderSelector::operator==’ 109 | virtual bool operator==(const klass& rhs) const; \ | ^~~~~~~~ src/ast_selectors.hpp:157:5: note: in expansion of macro ‘ATTACH_CMP_OPERATIONS’ 157 | ATTACH_CMP_OPERATIONS(PlaceholderSelector) | ^~~~~~~~~~~~~~~~~~~~~ src/ast_selectors.hpp:133:10: warning: ‘virtual bool Sass::SimpleSelector::operator==(const Sass::Selector&) const’ was hidden [-Woverloaded-virtual=] 133 | bool operator==(const Selector& rhs) const final override; | ^~~~~~~~ src/ast_def_macros.hpp:109:16: note: by ‘Sass::PlaceholderSelector::operator==’ 109 | virtual bool operator==(const klass& rhs) const; \ | ^~~~~~~~ src/ast_selectors.hpp:157:5: note: in expansion of macro ‘ATTACH_CMP_OPERATIONS’ 157 | ATTACH_CMP_OPERATIONS(PlaceholderSelector) | ^~~~~~~~~~~~~~~~~~~~~ src/ast_def_macros.hpp:106:16: warning: ‘virtual bool Sass::SimpleSelector::operator!=(const Sass::SimpleSelector&) const’ was hidden [-Woverloaded-virtual=] 106 | virtual bool operator!=(const klass& rhs) const { return !(*this == rhs); }; \ | ^~~~~~~~ src/ast_selectors.hpp:139:5: note: in expansion of macro ‘ATTACH_VIRTUAL_CMP_OPERATIONS’ 139 | ATTACH_VIRTUAL_CMP_OPERATIONS(SimpleSelector); | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~ src/ast_def_macros.hpp:110:16: note: by ‘virtual bool Sass::PlaceholderSelector::operator!=(const Sass::PlaceholderSelector&) const’ 110 | virtual bool operator!=(const klass& rhs) const { return !(*this == rhs); }; \ | ^~~~~~~~ src/ast_selectors.hpp:157:5: note: in expansion of macro ‘ATTACH_CMP_OPERATIONS’ 157 | ATTACH_CMP_OPERATIONS(PlaceholderSelector) | ^~~~~~~~~~~~~~~~~~~~~ src/ast_selectors.hpp:137:18: warning: ‘virtual bool Sass::SimpleSelector::operator==(const Sass::CompoundSelector&) const’ was hidden [-Woverloaded-virtual=] 137 | virtual bool operator==(const CompoundSelector& rhs) const; | ^~~~~~~~ src/ast_def_macros.hpp:109:16: note: by ‘Sass::TypeSelector::operator==’ 109 | virtual bool operator==(const klass& rhs) const; \ | ^~~~~~~~ src/ast_selectors.hpp:174:5: note: in expansion of macro ‘ATTACH_CMP_OPERATIONS’ 174 | ATTACH_CMP_OPERATIONS(TypeSelector) | ^~~~~~~~~~~~~~~~~~~~~ src/ast_selectors.hpp:136:18: warning: ‘virtual bool Sass::SimpleSelector::operator==(const Sass::ComplexSelector&) const’ was hidden [-Woverloaded-virtual=] 136 | virtual bool operator==(const ComplexSelector& rhs) const; | ^~~~~~~~ src/ast_def_macros.hpp:109:16: note: by ‘Sass::TypeSelector::operator==’ 109 | virtual bool operator==(const klass& rhs) const; \ | ^~~~~~~~ src/ast_selectors.hpp:174:5: note: in expansion of macro ‘ATTACH_CMP_OPERATIONS’ 174 | ATTACH_CMP_OPERATIONS(TypeSelector) | ^~~~~~~~~~~~~~~~~~~~~ src/ast_selectors.hpp:135:18: warning: ‘virtual bool Sass::SimpleSelector::operator==(const Sass::SelectorList&) const’ was hidden [-Woverloaded-virtual=] 135 | virtual bool operator==(const SelectorList& rhs) const; | ^~~~~~~~ src/ast_def_macros.hpp:109:16: note: by ‘Sass::TypeSelector::operator==’ 109 | virtual bool operator==(const klass& rhs) const; \ | ^~~~~~~~ src/ast_selectors.hpp:174:5: note: in expansion of macro ‘ATTACH_CMP_OPERATIONS’ 174 | ATTACH_CMP_OPERATIONS(TypeSelector) | ^~~~~~~~~~~~~~~~~~~~~ src/ast_selectors.hpp:133:10: warning: ‘virtual bool Sass::SimpleSelector::operator==(const Sass::Selector&) const’ was hidden [-Woverloaded-virtual=] 133 | bool operator==(const Selector& rhs) const final override; | ^~~~~~~~ src/ast_def_macros.hpp:109:16: note: by ‘Sass::TypeSelector::operator==’ 109 | virtual bool operator==(const klass& rhs) const; \ | ^~~~~~~~ src/ast_selectors.hpp:174:5: note: in expansion of macro ‘ATTACH_CMP_OPERATIONS’ 174 | ATTACH_CMP_OPERATIONS(TypeSelector) | ^~~~~~~~~~~~~~~~~~~~~ src/ast_def_macros.hpp:106:16: warning: ‘virtual bool Sass::SimpleSelector::operator!=(const Sass::SimpleSelector&) const’ was hidden [-Woverloaded-virtual=] 106 | virtual bool operator!=(const klass& rhs) const { return !(*this == rhs); }; \ | ^~~~~~~~ src/ast_selectors.hpp:139:5: note: in expansion of macro ‘ATTACH_VIRTUAL_CMP_OPERATIONS’ 139 | ATTACH_VIRTUAL_CMP_OPERATIONS(SimpleSelector); | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~ src/ast_def_macros.hpp:110:16: note: by ‘virtual bool Sass::TypeSelector::operator!=(const Sass::TypeSelector&) const’ 110 | virtual bool operator!=(const klass& rhs) const { return !(*this == rhs); }; \ | ^~~~~~~~ src/ast_selectors.hpp:174:5: note: in expansion of macro ‘ATTACH_CMP_OPERATIONS’ 174 | ATTACH_CMP_OPERATIONS(TypeSelector) | ^~~~~~~~~~~~~~~~~~~~~ src/ast_selectors.hpp:137:18: warning: ‘virtual bool Sass::SimpleSelector::operator==(const Sass::CompoundSelector&) const’ was hidden [-Woverloaded-virtual=] 137 | virtual bool operator==(const CompoundSelector& rhs) const; | ^~~~~~~~ src/ast_def_macros.hpp:109:16: note: by ‘Sass::ClassSelector::operator==’ 109 | virtual bool operator==(const klass& rhs) const; \ | ^~~~~~~~ src/ast_selectors.hpp:188:5: note: in expansion of macro ‘ATTACH_CMP_OPERATIONS’ 188 | ATTACH_CMP_OPERATIONS(ClassSelector) | ^~~~~~~~~~~~~~~~~~~~~ src/ast_selectors.hpp:136:18: warning: ‘virtual bool Sass::SimpleSelector::operator==(const Sass::ComplexSelector&) const’ was hidden [-Woverloaded-virtual=] 136 | virtual bool operator==(const ComplexSelector& rhs) const; | ^~~~~~~~ src/ast_def_macros.hpp:109:16: note: by ‘Sass::ClassSelector::operator==’ 109 | virtual bool operator==(const klass& rhs) const; \ | ^~~~~~~~ src/ast_selectors.hpp:188:5: note: in expansion of macro ‘ATTACH_CMP_OPERATIONS’ 188 | ATTACH_CMP_OPERATIONS(ClassSelector) | ^~~~~~~~~~~~~~~~~~~~~ src/ast_selectors.hpp:135:18: warning: ‘virtual bool Sass::SimpleSelector::operator==(const Sass::SelectorList&) const’ was hidden [-Woverloaded-virtual=] 135 | virtual bool operator==(const SelectorList& rhs) const; | ^~~~~~~~ src/ast_def_macros.hpp:109:16: note: by ‘Sass::ClassSelector::operator==’ 109 | virtual bool operator==(const klass& rhs) const; \ | ^~~~~~~~ src/ast_selectors.hpp:188:5: note: in expansion of macro ‘ATTACH_CMP_OPERATIONS’ 188 | ATTACH_CMP_OPERATIONS(ClassSelector) | ^~~~~~~~~~~~~~~~~~~~~ src/ast_selectors.hpp:133:10: warning: ‘virtual bool Sass::SimpleSelector::operator==(const Sass::Selector&) const’ was hidden [-Woverloaded-virtual=] 133 | bool operator==(const Selector& rhs) const final override; | ^~~~~~~~ src/ast_def_macros.hpp:109:16: note: by ‘Sass::ClassSelector::operator==’ 109 | virtual bool operator==(const klass& rhs) const; \ | ^~~~~~~~ src/ast_selectors.hpp:188:5: note: in expansion of macro ‘ATTACH_CMP_OPERATIONS’ 188 | ATTACH_CMP_OPERATIONS(ClassSelector) | ^~~~~~~~~~~~~~~~~~~~~ src/ast_def_macros.hpp:106:16: warning: ‘virtual bool Sass::SimpleSelector::operator!=(const Sass::SimpleSelector&) const’ was hidden [-Woverloaded-virtual=] 106 | virtual bool operator!=(const klass& rhs) const { return !(*this == rhs); }; \ | ^~~~~~~~ src/ast_selectors.hpp:139:5: note: in expansion of macro ‘ATTACH_VIRTUAL_CMP_OPERATIONS’ 139 | ATTACH_VIRTUAL_CMP_OPERATIONS(SimpleSelector); | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~ src/ast_def_macros.hpp:110:16: note: by ‘virtual bool Sass::ClassSelector::operator!=(const Sass::ClassSelector&) const’ 110 | virtual bool operator!=(const klass& rhs) const { return !(*this == rhs); }; \ | ^~~~~~~~ src/ast_selectors.hpp:188:5: note: in expansion of macro ‘ATTACH_CMP_OPERATIONS’ 188 | ATTACH_CMP_OPERATIONS(ClassSelector) | ^~~~~~~~~~~~~~~~~~~~~ src/ast_selectors.hpp:137:18: warning: ‘virtual bool Sass::SimpleSelector::operator==(const Sass::CompoundSelector&) const’ was hidden [-Woverloaded-virtual=] 137 | virtual bool operator==(const CompoundSelector& rhs) const; | ^~~~~~~~ src/ast_def_macros.hpp:109:16: note: by ‘Sass::IDSelector::operator==’ 109 | virtual bool operator==(const klass& rhs) const; \ | ^~~~~~~~ src/ast_selectors.hpp:204:5: note: in expansion of macro ‘ATTACH_CMP_OPERATIONS’ 204 | ATTACH_CMP_OPERATIONS(IDSelector) | ^~~~~~~~~~~~~~~~~~~~~ src/ast_selectors.hpp:136:18: warning: ‘virtual bool Sass::SimpleSelector::operator==(const Sass::ComplexSelector&) const’ was hidden [-Woverloaded-virtual=] 136 | virtual bool operator==(const ComplexSelector& rhs) const; | ^~~~~~~~ src/ast_def_macros.hpp:109:16: note: by ‘Sass::IDSelector::operator==’ 109 | virtual bool operator==(const klass& rhs) const; \ | ^~~~~~~~ src/ast_selectors.hpp:204:5: note: in expansion of macro ‘ATTACH_CMP_OPERATIONS’ 204 | ATTACH_CMP_OPERATIONS(IDSelector) | ^~~~~~~~~~~~~~~~~~~~~ src/ast_selectors.hpp:135:18: warning: ‘virtual bool Sass::SimpleSelector::operator==(const Sass::SelectorList&) const’ was hidden [-Woverloaded-virtual=] 135 | virtual bool operator==(const SelectorList& rhs) const; | ^~~~~~~~ src/ast_def_macros.hpp:109:16: note: by ‘Sass::IDSelector::operator==’ 109 | virtual bool operator==(const klass& rhs) const; \ | ^~~~~~~~ src/ast_selectors.hpp:204:5: note: in expansion of macro ‘ATTACH_CMP_OPERATIONS’ 204 | ATTACH_CMP_OPERATIONS(IDSelector) | ^~~~~~~~~~~~~~~~~~~~~ src/ast_selectors.hpp:133:10: warning: ‘virtual bool Sass::SimpleSelector::operator==(const Sass::Selector&) const’ was hidden [-Woverloaded-virtual=] 133 | bool operator==(const Selector& rhs) const final override; | ^~~~~~~~ src/ast_def_macros.hpp:109:16: note: by ‘Sass::IDSelector::operator==’ 109 | virtual bool operator==(const klass& rhs) const; \ | ^~~~~~~~ src/ast_selectors.hpp:204:5: note: in expansion of macro ‘ATTACH_CMP_OPERATIONS’ 204 | ATTACH_CMP_OPERATIONS(IDSelector) | ^~~~~~~~~~~~~~~~~~~~~ src/ast_def_macros.hpp:106:16: warning: ‘virtual bool Sass::SimpleSelector::operator!=(const Sass::SimpleSelector&) const’ was hidden [-Woverloaded-virtual=] 106 | virtual bool operator!=(const klass& rhs) const { return !(*this == rhs); }; \ | ^~~~~~~~ src/ast_selectors.hpp:139:5: note: in expansion of macro ‘ATTACH_VIRTUAL_CMP_OPERATIONS’ 139 | ATTACH_VIRTUAL_CMP_OPERATIONS(SimpleSelector); | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~ src/ast_def_macros.hpp:110:16: note: by ‘virtual bool Sass::IDSelector::operator!=(const Sass::IDSelector&) const’ 110 | virtual bool operator!=(const klass& rhs) const { return !(*this == rhs); }; \ | ^~~~~~~~ src/ast_selectors.hpp:204:5: note: in expansion of macro ‘ATTACH_CMP_OPERATIONS’ 204 | ATTACH_CMP_OPERATIONS(IDSelector) | ^~~~~~~~~~~~~~~~~~~~~ src/ast_selectors.hpp:137:18: warning: ‘virtual bool Sass::SimpleSelector::operator==(const Sass::CompoundSelector&) const’ was hidden [-Woverloaded-virtual=] 137 | virtual bool operator==(const CompoundSelector& rhs) const; | ^~~~~~~~ src/ast_def_macros.hpp:109:16: note: by ‘Sass::AttributeSelector::operator==’ 109 | virtual bool operator==(const klass& rhs) const; \ | ^~~~~~~~ src/ast_selectors.hpp:223:5: note: in expansion of macro ‘ATTACH_CMP_OPERATIONS’ 223 | ATTACH_CMP_OPERATIONS(AttributeSelector) | ^~~~~~~~~~~~~~~~~~~~~ src/ast_selectors.hpp:136:18: warning: ‘virtual bool Sass::SimpleSelector::operator==(const Sass::ComplexSelector&) const’ was hidden [-Woverloaded-virtual=] 136 | virtual bool operator==(const ComplexSelector& rhs) const; | ^~~~~~~~ src/ast_def_macros.hpp:109:16: note: by ‘Sass::AttributeSelector::operator==’ 109 | virtual bool operator==(const klass& rhs) const; \ | ^~~~~~~~ src/ast_selectors.hpp:223:5: note: in expansion of macro ‘ATTACH_CMP_OPERATIONS’ 223 | ATTACH_CMP_OPERATIONS(AttributeSelector) | ^~~~~~~~~~~~~~~~~~~~~ src/ast_selectors.hpp:135:18: warning: ‘virtual bool Sass::SimpleSelector::operator==(const Sass::SelectorList&) const’ was hidden [-Woverloaded-virtual=] 135 | virtual bool operator==(const SelectorList& rhs) const; | ^~~~~~~~ src/ast_def_macros.hpp:109:16: note: by ‘Sass::AttributeSelector::operator==’ 109 | virtual bool operator==(const klass& rhs) const; \ | ^~~~~~~~ src/ast_selectors.hpp:223:5: note: in expansion of macro ‘ATTACH_CMP_OPERATIONS’ 223 | ATTACH_CMP_OPERATIONS(AttributeSelector) | ^~~~~~~~~~~~~~~~~~~~~ src/ast_selectors.hpp:133:10: warning: ‘virtual bool Sass::SimpleSelector::operator==(const Sass::Selector&) const’ was hidden [-Woverloaded-virtual=] 133 | bool operator==(const Selector& rhs) const final override; | ^~~~~~~~ src/ast_def_macros.hpp:109:16: note: by ‘Sass::AttributeSelector::operator==’ 109 | virtual bool operator==(const klass& rhs) const; \ | ^~~~~~~~ src/ast_selectors.hpp:223:5: note: in expansion of macro ‘ATTACH_CMP_OPERATIONS’ 223 | ATTACH_CMP_OPERATIONS(AttributeSelector) | ^~~~~~~~~~~~~~~~~~~~~ src/ast_def_macros.hpp:106:16: warning: ‘virtual bool Sass::SimpleSelector::operator!=(const Sass::SimpleSelector&) const’ was hidden [-Woverloaded-virtual=] 106 | virtual bool operator!=(const klass& rhs) const { return !(*this == rhs); }; \ | ^~~~~~~~ src/ast_selectors.hpp:139:5: note: in expansion of macro ‘ATTACH_VIRTUAL_CMP_OPERATIONS’ 139 | ATTACH_VIRTUAL_CMP_OPERATIONS(SimpleSelector); | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~ src/ast_def_macros.hpp:110:16: note: by ‘virtual bool Sass::AttributeSelector::operator!=(const Sass::AttributeSelector&) const’ 110 | virtual bool operator!=(const klass& rhs) const { return !(*this == rhs); }; \ | ^~~~~~~~ src/ast_selectors.hpp:223:5: note: in expansion of macro ‘ATTACH_CMP_OPERATIONS’ 223 | ATTACH_CMP_OPERATIONS(AttributeSelector) | ^~~~~~~~~~~~~~~~~~~~~ src/ast_def_macros.hpp:106:16: warning: ‘virtual bool Sass::Selector::operator!=(const Sass::Selector&) const’ was hidden [-Woverloaded-virtual=] 106 | virtual bool operator!=(const klass& rhs) const { return !(*this == rhs); }; \ | ^~~~~~~~ src/ast_selectors.hpp:56:5: note: in expansion of macro ‘ATTACH_VIRTUAL_CMP_OPERATIONS’ 56 | ATTACH_VIRTUAL_CMP_OPERATIONS(Selector) | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~ src/ast_def_macros.hpp:110:16: note: by ‘virtual bool Sass::ComplexSelector::operator!=(const Sass::ComplexSelector&) const’ 110 | virtual bool operator!=(const klass& rhs) const { return !(*this == rhs); }; \ | ^~~~~~~~ src/ast_selectors.hpp:310:5: note: in expansion of macro ‘ATTACH_CMP_OPERATIONS’ 310 | ATTACH_CMP_OPERATIONS(ComplexSelector) | ^~~~~~~~~~~~~~~~~~~~~ src/ast_def_macros.hpp:106:16: warning: ‘virtual bool Sass::Selector::operator!=(const Sass::Selector&) const’ was hidden [-Woverloaded-virtual=] 106 | virtual bool operator!=(const klass& rhs) const { return !(*this == rhs); }; \ | ^~~~~~~~ src/ast_selectors.hpp:56:5: note: in expansion of macro ‘ATTACH_VIRTUAL_CMP_OPERATIONS’ 56 | ATTACH_VIRTUAL_CMP_OPERATIONS(Selector) | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~ src/ast_def_macros.hpp:106:16: note: by ‘virtual bool Sass::SelectorComponent::operator!=(const Sass::SelectorComponent&) const’ 106 | virtual bool operator!=(const klass& rhs) const { return !(*this == rhs); }; \ | ^~~~~~~~ src/ast_selectors.hpp:349:5: note: in expansion of macro ‘ATTACH_VIRTUAL_CMP_OPERATIONS’ 349 | ATTACH_VIRTUAL_CMP_OPERATIONS(SelectorComponent); | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~ src/ast_def_macros.hpp:106:16: warning: ‘virtual bool Sass::SelectorComponent::operator!=(const Sass::SelectorComponent&) const’ was hidden [-Woverloaded-virtual=] 106 | virtual bool operator!=(const klass& rhs) const { return !(*this == rhs); }; \ | ^~~~~~~~ src/ast_selectors.hpp:349:5: note: in expansion of macro ‘ATTACH_VIRTUAL_CMP_OPERATIONS’ 349 | ATTACH_VIRTUAL_CMP_OPERATIONS(SelectorComponent); | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~ src/ast_def_macros.hpp:110:16: note: by ‘virtual bool Sass::SelectorCombinator::operator!=(const Sass::SelectorCombinator&) const’ 110 | virtual bool operator!=(const klass& rhs) const { return !(*this == rhs); }; \ | ^~~~~~~~ src/ast_selectors.hpp:407:5: note: in expansion of macro ‘ATTACH_CMP_OPERATIONS’ 407 | ATTACH_CMP_OPERATIONS(SelectorCombinator) | ^~~~~~~~~~~~~~~~~~~~~ g++ -std=gnu++17 -Wall -O2 -std=c++11 -I ./include -fPIC -c -o src/source_map.o src/source_map.cpp In file included from src/source_map.cpp:10: src/ast.hpp:90:18: warning: ‘virtual bool Sass::AST_Node::operator==(const Sass::AST_Node&) const’ was hidden [-Woverloaded-virtual=] 90 | virtual bool operator== (const AST_Node& rhs) const { | ^~~~~~~~ src/ast.hpp:165:18: note: by ‘virtual bool Sass::Expression::operator==(const Sass::Expression&) const’ 165 | virtual bool operator== (const Expression& rhs) const { return false; } | ^~~~~~~~ src/ast.hpp:96:18: warning: ‘virtual bool Sass::AST_Node::operator!=(const Sass::AST_Node&) const’ was hidden [-Woverloaded-virtual=] 96 | virtual bool operator!= (const AST_Node& rhs) const { | ^~~~~~~~ src/ast.hpp:167:17: note: by ‘bool Sass::Expression::operator!=(const Sass::Expression&) const’ 167 | inline bool operator!=(const Expression& rhs) const { return !(rhs == *this); } | ^~~~~~~~ src/ast.hpp:90:18: warning: ‘virtual bool Sass::AST_Node::operator==(const Sass::AST_Node&) const’ was hidden [-Woverloaded-virtual=] 90 | virtual bool operator== (const AST_Node& rhs) const { | ^~~~~~~~ src/ast.hpp:908:10: note: by ‘bool Sass::CssMediaRule::operator==(const Sass::CssMediaRule&) const’ 908 | bool operator== (const CssMediaRule& rhs) const { | ^~~~~~~~ src/ast.hpp:96:18: warning: ‘virtual bool Sass::AST_Node::operator!=(const Sass::AST_Node&) const’ was hidden [-Woverloaded-virtual=] 96 | virtual bool operator!= (const AST_Node& rhs) const { | ^~~~~~~~ src/ast.hpp:911:10: note: by ‘bool Sass::CssMediaRule::operator!=(const Sass::CssMediaRule&) const’ 911 | bool operator!=(const CssMediaRule& rhs) const { | ^~~~~~~~ src/ast.hpp:90:18: warning: ‘virtual bool Sass::AST_Node::operator==(const Sass::AST_Node&) const’ was hidden [-Woverloaded-virtual=] 90 | virtual bool operator== (const AST_Node& rhs) const { | ^~~~~~~~ src/ast.hpp:939:10: note: by ‘bool Sass::CssMediaQuery::operator==(const Sass::CssMediaQuery&) const’ 939 | bool operator== (const CssMediaQuery& rhs) const; | ^~~~~~~~ src/ast.hpp:96:18: warning: ‘virtual bool Sass::AST_Node::operator!=(const Sass::AST_Node&) const’ was hidden [-Woverloaded-virtual=] 96 | virtual bool operator!= (const AST_Node& rhs) const { | ^~~~~~~~ src/ast.hpp:940:10: note: by ‘bool Sass::CssMediaQuery::operator!=(const Sass::CssMediaQuery&) const’ 940 | bool operator!=(const CssMediaQuery& rhs) const { | ^~~~~~~~ src/ast.hpp:165:18: warning: ‘virtual bool Sass::Expression::operator==(const Sass::Expression&) const’ was hidden [-Woverloaded-virtual=] 165 | virtual bool operator== (const Expression& rhs) const { return false; } | ^~~~~~~~ In file included from src/ast.hpp:14: src/ast_def_macros.hpp:105:16: note: by ‘virtual bool Sass::Selector::operator==(const Sass::Selector&) const’ 105 | virtual bool operator==(const klass& rhs) const = 0; \ | ^~~~~~~~ src/ast_selectors.hpp:56:5: note: in expansion of macro ‘ATTACH_VIRTUAL_CMP_OPERATIONS’ 56 | ATTACH_VIRTUAL_CMP_OPERATIONS(Selector) | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~ src/ast.hpp:96:18: warning: ‘virtual bool Sass::AST_Node::operator!=(const Sass::AST_Node&) const’ was hidden [-Woverloaded-virtual=] 96 | virtual bool operator!= (const AST_Node& rhs) const { | ^~~~~~~~ src/ast_def_macros.hpp:106:16: note: by ‘virtual bool Sass::Selector::operator!=(const Sass::Selector&) const’ 106 | virtual bool operator!=(const klass& rhs) const { return !(*this == rhs); }; \ | ^~~~~~~~ src/ast_selectors.hpp:56:5: note: in expansion of macro ‘ATTACH_VIRTUAL_CMP_OPERATIONS’ 56 | ATTACH_VIRTUAL_CMP_OPERATIONS(Selector) | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~ src/ast_def_macros.hpp:106:16: warning: ‘virtual bool Sass::Selector::operator!=(const Sass::Selector&) const’ was hidden [-Woverloaded-virtual=] 106 | virtual bool operator!=(const klass& rhs) const { return !(*this == rhs); }; \ | ^~~~~~~~ src/ast_selectors.hpp:56:5: note: in expansion of macro ‘ATTACH_VIRTUAL_CMP_OPERATIONS’ 56 | ATTACH_VIRTUAL_CMP_OPERATIONS(Selector) | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~ src/ast_def_macros.hpp:106:16: note: by ‘virtual bool Sass::SimpleSelector::operator!=(const Sass::SimpleSelector&) const’ 106 | virtual bool operator!=(const klass& rhs) const { return !(*this == rhs); }; \ | ^~~~~~~~ src/ast_selectors.hpp:139:5: note: in expansion of macro ‘ATTACH_VIRTUAL_CMP_OPERATIONS’ 139 | ATTACH_VIRTUAL_CMP_OPERATIONS(SimpleSelector); | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~ In file included from src/ast.hpp:1055: src/ast_selectors.hpp:137:18: warning: ‘virtual bool Sass::SimpleSelector::operator==(const Sass::CompoundSelector&) const’ was hidden [-Woverloaded-virtual=] 137 | virtual bool operator==(const CompoundSelector& rhs) const; | ^~~~~~~~ src/ast_def_macros.hpp:109:16: note: by ‘Sass::PlaceholderSelector::operator==’ 109 | virtual bool operator==(const klass& rhs) const; \ | ^~~~~~~~ src/ast_selectors.hpp:157:5: note: in expansion of macro ‘ATTACH_CMP_OPERATIONS’ 157 | ATTACH_CMP_OPERATIONS(PlaceholderSelector) | ^~~~~~~~~~~~~~~~~~~~~ src/ast_selectors.hpp:136:18: warning: ‘virtual bool Sass::SimpleSelector::operator==(const Sass::ComplexSelector&) const’ was hidden [-Woverloaded-virtual=] 136 | virtual bool operator==(const ComplexSelector& rhs) const; | ^~~~~~~~ src/ast_def_macros.hpp:109:16: note: by ‘Sass::PlaceholderSelector::operator==’ 109 | virtual bool operator==(const klass& rhs) const; \ | ^~~~~~~~ src/ast_selectors.hpp:157:5: note: in expansion of macro ‘ATTACH_CMP_OPERATIONS’ 157 | ATTACH_CMP_OPERATIONS(PlaceholderSelector) | ^~~~~~~~~~~~~~~~~~~~~ src/ast_selectors.hpp:135:18: warning: ‘virtual bool Sass::SimpleSelector::operator==(const Sass::SelectorList&) const’ was hidden [-Woverloaded-virtual=] 135 | virtual bool operator==(const SelectorList& rhs) const; | ^~~~~~~~ src/ast_def_macros.hpp:109:16: note: by ‘Sass::PlaceholderSelector::operator==’ 109 | virtual bool operator==(const klass& rhs) const; \ | ^~~~~~~~ src/ast_selectors.hpp:157:5: note: in expansion of macro ‘ATTACH_CMP_OPERATIONS’ 157 | ATTACH_CMP_OPERATIONS(PlaceholderSelector) | ^~~~~~~~~~~~~~~~~~~~~ src/ast_selectors.hpp:133:10: warning: ‘virtual bool Sass::SimpleSelector::operator==(const Sass::Selector&) const’ was hidden [-Woverloaded-virtual=] 133 | bool operator==(const Selector& rhs) const final override; | ^~~~~~~~ src/ast_def_macros.hpp:109:16: note: by ‘Sass::PlaceholderSelector::operator==’ 109 | virtual bool operator==(const klass& rhs) const; \ | ^~~~~~~~ src/ast_selectors.hpp:157:5: note: in expansion of macro ‘ATTACH_CMP_OPERATIONS’ 157 | ATTACH_CMP_OPERATIONS(PlaceholderSelector) | ^~~~~~~~~~~~~~~~~~~~~ src/ast_def_macros.hpp:106:16: warning: ‘virtual bool Sass::SimpleSelector::operator!=(const Sass::SimpleSelector&) const’ was hidden [-Woverloaded-virtual=] 106 | virtual bool operator!=(const klass& rhs) const { return !(*this == rhs); }; \ | ^~~~~~~~ src/ast_selectors.hpp:139:5: note: in expansion of macro ‘ATTACH_VIRTUAL_CMP_OPERATIONS’ 139 | ATTACH_VIRTUAL_CMP_OPERATIONS(SimpleSelector); | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~ src/ast_def_macros.hpp:110:16: note: by ‘virtual bool Sass::PlaceholderSelector::operator!=(const Sass::PlaceholderSelector&) const’ 110 | virtual bool operator!=(const klass& rhs) const { return !(*this == rhs); }; \ | ^~~~~~~~ src/ast_selectors.hpp:157:5: note: in expansion of macro ‘ATTACH_CMP_OPERATIONS’ 157 | ATTACH_CMP_OPERATIONS(PlaceholderSelector) | ^~~~~~~~~~~~~~~~~~~~~ src/ast_selectors.hpp:137:18: warning: ‘virtual bool Sass::SimpleSelector::operator==(const Sass::CompoundSelector&) const’ was hidden [-Woverloaded-virtual=] 137 | virtual bool operator==(const CompoundSelector& rhs) const; | ^~~~~~~~ src/ast_def_macros.hpp:109:16: note: by ‘Sass::TypeSelector::operator==’ 109 | virtual bool operator==(const klass& rhs) const; \ | ^~~~~~~~ src/ast_selectors.hpp:174:5: note: in expansion of macro ‘ATTACH_CMP_OPERATIONS’ 174 | ATTACH_CMP_OPERATIONS(TypeSelector) | ^~~~~~~~~~~~~~~~~~~~~ src/ast_selectors.hpp:136:18: warning: ‘virtual bool Sass::SimpleSelector::operator==(const Sass::ComplexSelector&) const’ was hidden [-Woverloaded-virtual=] 136 | virtual bool operator==(const ComplexSelector& rhs) const; | ^~~~~~~~ src/ast_def_macros.hpp:109:16: note: by ‘Sass::TypeSelector::operator==’ 109 | virtual bool operator==(const klass& rhs) const; \ | ^~~~~~~~ src/ast_selectors.hpp:174:5: note: in expansion of macro ‘ATTACH_CMP_OPERATIONS’ 174 | ATTACH_CMP_OPERATIONS(TypeSelector) | ^~~~~~~~~~~~~~~~~~~~~ src/ast_selectors.hpp:135:18: warning: ‘virtual bool Sass::SimpleSelector::operator==(const Sass::SelectorList&) const’ was hidden [-Woverloaded-virtual=] 135 | virtual bool operator==(const SelectorList& rhs) const; | ^~~~~~~~ src/ast_def_macros.hpp:109:16: note: by ‘Sass::TypeSelector::operator==’ 109 | virtual bool operator==(const klass& rhs) const; \ | ^~~~~~~~ src/ast_selectors.hpp:174:5: note: in expansion of macro ‘ATTACH_CMP_OPERATIONS’ 174 | ATTACH_CMP_OPERATIONS(TypeSelector) | ^~~~~~~~~~~~~~~~~~~~~ src/ast_selectors.hpp:133:10: warning: ‘virtual bool Sass::SimpleSelector::operator==(const Sass::Selector&) const’ was hidden [-Woverloaded-virtual=] 133 | bool operator==(const Selector& rhs) const final override; | ^~~~~~~~ src/ast_def_macros.hpp:109:16: note: by ‘Sass::TypeSelector::operator==’ 109 | virtual bool operator==(const klass& rhs) const; \ | ^~~~~~~~ src/ast_selectors.hpp:174:5: note: in expansion of macro ‘ATTACH_CMP_OPERATIONS’ 174 | ATTACH_CMP_OPERATIONS(TypeSelector) | ^~~~~~~~~~~~~~~~~~~~~ src/ast_def_macros.hpp:106:16: warning: ‘virtual bool Sass::SimpleSelector::operator!=(const Sass::SimpleSelector&) const’ was hidden [-Woverloaded-virtual=] 106 | virtual bool operator!=(const klass& rhs) const { return !(*this == rhs); }; \ | ^~~~~~~~ src/ast_selectors.hpp:139:5: note: in expansion of macro ‘ATTACH_VIRTUAL_CMP_OPERATIONS’ 139 | ATTACH_VIRTUAL_CMP_OPERATIONS(SimpleSelector); | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~ src/ast_def_macros.hpp:110:16: note: by ‘virtual bool Sass::TypeSelector::operator!=(const Sass::TypeSelector&) const’ 110 | virtual bool operator!=(const klass& rhs) const { return !(*this == rhs); }; \ | ^~~~~~~~ src/ast_selectors.hpp:174:5: note: in expansion of macro ‘ATTACH_CMP_OPERATIONS’ 174 | ATTACH_CMP_OPERATIONS(TypeSelector) | ^~~~~~~~~~~~~~~~~~~~~ src/ast_selectors.hpp:137:18: warning: ‘virtual bool Sass::SimpleSelector::operator==(const Sass::CompoundSelector&) const’ was hidden [-Woverloaded-virtual=] 137 | virtual bool operator==(const CompoundSelector& rhs) const; | ^~~~~~~~ src/ast_def_macros.hpp:109:16: note: by ‘Sass::ClassSelector::operator==’ 109 | virtual bool operator==(const klass& rhs) const; \ | ^~~~~~~~ src/ast_selectors.hpp:188:5: note: in expansion of macro ‘ATTACH_CMP_OPERATIONS’ 188 | ATTACH_CMP_OPERATIONS(ClassSelector) | ^~~~~~~~~~~~~~~~~~~~~ src/ast_selectors.hpp:136:18: warning: ‘virtual bool Sass::SimpleSelector::operator==(const Sass::ComplexSelector&) const’ was hidden [-Woverloaded-virtual=] 136 | virtual bool operator==(const ComplexSelector& rhs) const; | ^~~~~~~~ src/ast_def_macros.hpp:109:16: note: by ‘Sass::ClassSelector::operator==’ 109 | virtual bool operator==(const klass& rhs) const; \ | ^~~~~~~~ src/ast_selectors.hpp:188:5: note: in expansion of macro ‘ATTACH_CMP_OPERATIONS’ 188 | ATTACH_CMP_OPERATIONS(ClassSelector) | ^~~~~~~~~~~~~~~~~~~~~ src/ast_selectors.hpp:135:18: warning: ‘virtual bool Sass::SimpleSelector::operator==(const Sass::SelectorList&) const’ was hidden [-Woverloaded-virtual=] 135 | virtual bool operator==(const SelectorList& rhs) const; | ^~~~~~~~ src/ast_def_macros.hpp:109:16: note: by ‘Sass::ClassSelector::operator==’ 109 | virtual bool operator==(const klass& rhs) const; \ | ^~~~~~~~ src/ast_selectors.hpp:188:5: note: in expansion of macro ‘ATTACH_CMP_OPERATIONS’ 188 | ATTACH_CMP_OPERATIONS(ClassSelector) | ^~~~~~~~~~~~~~~~~~~~~ src/ast_selectors.hpp:133:10: warning: ‘virtual bool Sass::SimpleSelector::operator==(const Sass::Selector&) const’ was hidden [-Woverloaded-virtual=] 133 | bool operator==(const Selector& rhs) const final override; | ^~~~~~~~ src/ast_def_macros.hpp:109:16: note: by ‘Sass::ClassSelector::operator==’ 109 | virtual bool operator==(const klass& rhs) const; \ | ^~~~~~~~ src/ast_selectors.hpp:188:5: note: in expansion of macro ‘ATTACH_CMP_OPERATIONS’ 188 | ATTACH_CMP_OPERATIONS(ClassSelector) | ^~~~~~~~~~~~~~~~~~~~~ src/ast_def_macros.hpp:106:16: warning: ‘virtual bool Sass::SimpleSelector::operator!=(const Sass::SimpleSelector&) const’ was hidden [-Woverloaded-virtual=] 106 | virtual bool operator!=(const klass& rhs) const { return !(*this == rhs); }; \ | ^~~~~~~~ src/ast_selectors.hpp:139:5: note: in expansion of macro ‘ATTACH_VIRTUAL_CMP_OPERATIONS’ 139 | ATTACH_VIRTUAL_CMP_OPERATIONS(SimpleSelector); | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~ src/ast_def_macros.hpp:110:16: note: by ‘virtual bool Sass::ClassSelector::operator!=(const Sass::ClassSelector&) const’ 110 | virtual bool operator!=(const klass& rhs) const { return !(*this == rhs); }; \ | ^~~~~~~~ src/ast_selectors.hpp:188:5: note: in expansion of macro ‘ATTACH_CMP_OPERATIONS’ 188 | ATTACH_CMP_OPERATIONS(ClassSelector) | ^~~~~~~~~~~~~~~~~~~~~ src/ast_selectors.hpp:137:18: warning: ‘virtual bool Sass::SimpleSelector::operator==(const Sass::CompoundSelector&) const’ was hidden [-Woverloaded-virtual=] 137 | virtual bool operator==(const CompoundSelector& rhs) const; | ^~~~~~~~ src/ast_def_macros.hpp:109:16: note: by ‘Sass::IDSelector::operator==’ 109 | virtual bool operator==(const klass& rhs) const; \ | ^~~~~~~~ src/ast_selectors.hpp:204:5: note: in expansion of macro ‘ATTACH_CMP_OPERATIONS’ 204 | ATTACH_CMP_OPERATIONS(IDSelector) | ^~~~~~~~~~~~~~~~~~~~~ src/ast_selectors.hpp:136:18: warning: ‘virtual bool Sass::SimpleSelector::operator==(const Sass::ComplexSelector&) const’ was hidden [-Woverloaded-virtual=] 136 | virtual bool operator==(const ComplexSelector& rhs) const; | ^~~~~~~~ src/ast_def_macros.hpp:109:16: note: by ‘Sass::IDSelector::operator==’ 109 | virtual bool operator==(const klass& rhs) const; \ | ^~~~~~~~ src/ast_selectors.hpp:204:5: note: in expansion of macro ‘ATTACH_CMP_OPERATIONS’ 204 | ATTACH_CMP_OPERATIONS(IDSelector) | ^~~~~~~~~~~~~~~~~~~~~ src/ast_selectors.hpp:135:18: warning: ‘virtual bool Sass::SimpleSelector::operator==(const Sass::SelectorList&) const’ was hidden [-Woverloaded-virtual=] 135 | virtual bool operator==(const SelectorList& rhs) const; | ^~~~~~~~ src/ast_def_macros.hpp:109:16: note: by ‘Sass::IDSelector::operator==’ 109 | virtual bool operator==(const klass& rhs) const; \ | ^~~~~~~~ src/ast_selectors.hpp:204:5: note: in expansion of macro ‘ATTACH_CMP_OPERATIONS’ 204 | ATTACH_CMP_OPERATIONS(IDSelector) | ^~~~~~~~~~~~~~~~~~~~~ src/ast_selectors.hpp:133:10: warning: ‘virtual bool Sass::SimpleSelector::operator==(const Sass::Selector&) const’ was hidden [-Woverloaded-virtual=] 133 | bool operator==(const Selector& rhs) const final override; | ^~~~~~~~ src/ast_def_macros.hpp:109:16: note: by ‘Sass::IDSelector::operator==’ 109 | virtual bool operator==(const klass& rhs) const; \ | ^~~~~~~~ src/ast_selectors.hpp:204:5: note: in expansion of macro ‘ATTACH_CMP_OPERATIONS’ 204 | ATTACH_CMP_OPERATIONS(IDSelector) | ^~~~~~~~~~~~~~~~~~~~~ src/ast_def_macros.hpp:106:16: warning: ‘virtual bool Sass::SimpleSelector::operator!=(const Sass::SimpleSelector&) const’ was hidden [-Woverloaded-virtual=] 106 | virtual bool operator!=(const klass& rhs) const { return !(*this == rhs); }; \ | ^~~~~~~~ src/ast_selectors.hpp:139:5: note: in expansion of macro ‘ATTACH_VIRTUAL_CMP_OPERATIONS’ 139 | ATTACH_VIRTUAL_CMP_OPERATIONS(SimpleSelector); | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~ src/ast_def_macros.hpp:110:16: note: by ‘virtual bool Sass::IDSelector::operator!=(const Sass::IDSelector&) const’ 110 | virtual bool operator!=(const klass& rhs) const { return !(*this == rhs); }; \ | ^~~~~~~~ src/ast_selectors.hpp:204:5: note: in expansion of macro ‘ATTACH_CMP_OPERATIONS’ 204 | ATTACH_CMP_OPERATIONS(IDSelector) | ^~~~~~~~~~~~~~~~~~~~~ src/ast_selectors.hpp:137:18: warning: ‘virtual bool Sass::SimpleSelector::operator==(const Sass::CompoundSelector&) const’ was hidden [-Woverloaded-virtual=] 137 | virtual bool operator==(const CompoundSelector& rhs) const; | ^~~~~~~~ src/ast_def_macros.hpp:109:16: note: by ‘Sass::AttributeSelector::operator==’ 109 | virtual bool operator==(const klass& rhs) const; \ | ^~~~~~~~ src/ast_selectors.hpp:223:5: note: in expansion of macro ‘ATTACH_CMP_OPERATIONS’ 223 | ATTACH_CMP_OPERATIONS(AttributeSelector) | ^~~~~~~~~~~~~~~~~~~~~ src/ast_selectors.hpp:136:18: warning: ‘virtual bool Sass::SimpleSelector::operator==(const Sass::ComplexSelector&) const’ was hidden [-Woverloaded-virtual=] 136 | virtual bool operator==(const ComplexSelector& rhs) const; | ^~~~~~~~ src/ast_def_macros.hpp:109:16: note: by ‘Sass::AttributeSelector::operator==’ 109 | virtual bool operator==(const klass& rhs) const; \ | ^~~~~~~~ src/ast_selectors.hpp:223:5: note: in expansion of macro ‘ATTACH_CMP_OPERATIONS’ 223 | ATTACH_CMP_OPERATIONS(AttributeSelector) | ^~~~~~~~~~~~~~~~~~~~~ src/ast_selectors.hpp:135:18: warning: ‘virtual bool Sass::SimpleSelector::operator==(const Sass::SelectorList&) const’ was hidden [-Woverloaded-virtual=] 135 | virtual bool operator==(const SelectorList& rhs) const; | ^~~~~~~~ src/ast_def_macros.hpp:109:16: note: by ‘Sass::AttributeSelector::operator==’ 109 | virtual bool operator==(const klass& rhs) const; \ | ^~~~~~~~ src/ast_selectors.hpp:223:5: note: in expansion of macro ‘ATTACH_CMP_OPERATIONS’ 223 | ATTACH_CMP_OPERATIONS(AttributeSelector) | ^~~~~~~~~~~~~~~~~~~~~ src/ast_selectors.hpp:133:10: warning: ‘virtual bool Sass::SimpleSelector::operator==(const Sass::Selector&) const’ was hidden [-Woverloaded-virtual=] 133 | bool operator==(const Selector& rhs) const final override; | ^~~~~~~~ src/ast_def_macros.hpp:109:16: note: by ‘Sass::AttributeSelector::operator==’ 109 | virtual bool operator==(const klass& rhs) const; \ | ^~~~~~~~ src/ast_selectors.hpp:223:5: note: in expansion of macro ‘ATTACH_CMP_OPERATIONS’ 223 | ATTACH_CMP_OPERATIONS(AttributeSelector) | ^~~~~~~~~~~~~~~~~~~~~ src/ast_def_macros.hpp:106:16: warning: ‘virtual bool Sass::SimpleSelector::operator!=(const Sass::SimpleSelector&) const’ was hidden [-Woverloaded-virtual=] 106 | virtual bool operator!=(const klass& rhs) const { return !(*this == rhs); }; \ | ^~~~~~~~ src/ast_selectors.hpp:139:5: note: in expansion of macro ‘ATTACH_VIRTUAL_CMP_OPERATIONS’ 139 | ATTACH_VIRTUAL_CMP_OPERATIONS(SimpleSelector); | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~ src/ast_def_macros.hpp:110:16: note: by ‘virtual bool Sass::AttributeSelector::operator!=(const Sass::AttributeSelector&) const’ 110 | virtual bool operator!=(const klass& rhs) const { return !(*this == rhs); }; \ | ^~~~~~~~ src/ast_selectors.hpp:223:5: note: in expansion of macro ‘ATTACH_CMP_OPERATIONS’ 223 | ATTACH_CMP_OPERATIONS(AttributeSelector) | ^~~~~~~~~~~~~~~~~~~~~ src/ast_def_macros.hpp:106:16: warning: ‘virtual bool Sass::Selector::operator!=(const Sass::Selector&) const’ was hidden [-Woverloaded-virtual=] 106 | virtual bool operator!=(const klass& rhs) const { return !(*this == rhs); }; \ | ^~~~~~~~ src/ast_selectors.hpp:56:5: note: in expansion of macro ‘ATTACH_VIRTUAL_CMP_OPERATIONS’ 56 | ATTACH_VIRTUAL_CMP_OPERATIONS(Selector) | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~ src/ast_def_macros.hpp:110:16: note: by ‘virtual bool Sass::ComplexSelector::operator!=(const Sass::ComplexSelector&) const’ 110 | virtual bool operator!=(const klass& rhs) const { return !(*this == rhs); }; \ | ^~~~~~~~ src/ast_selectors.hpp:310:5: note: in expansion of macro ‘ATTACH_CMP_OPERATIONS’ 310 | ATTACH_CMP_OPERATIONS(ComplexSelector) | ^~~~~~~~~~~~~~~~~~~~~ src/ast_def_macros.hpp:106:16: warning: ‘virtual bool Sass::Selector::operator!=(const Sass::Selector&) const’ was hidden [-Woverloaded-virtual=] 106 | virtual bool operator!=(const klass& rhs) const { return !(*this == rhs); }; \ | ^~~~~~~~ src/ast_selectors.hpp:56:5: note: in expansion of macro ‘ATTACH_VIRTUAL_CMP_OPERATIONS’ 56 | ATTACH_VIRTUAL_CMP_OPERATIONS(Selector) | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~ src/ast_def_macros.hpp:106:16: note: by ‘virtual bool Sass::SelectorComponent::operator!=(const Sass::SelectorComponent&) const’ 106 | virtual bool operator!=(const klass& rhs) const { return !(*this == rhs); }; \ | ^~~~~~~~ src/ast_selectors.hpp:349:5: note: in expansion of macro ‘ATTACH_VIRTUAL_CMP_OPERATIONS’ 349 | ATTACH_VIRTUAL_CMP_OPERATIONS(SelectorComponent); | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~ src/ast_def_macros.hpp:106:16: warning: ‘virtual bool Sass::SelectorComponent::operator!=(const Sass::SelectorComponent&) const’ was hidden [-Woverloaded-virtual=] 106 | virtual bool operator!=(const klass& rhs) const { return !(*this == rhs); }; \ | ^~~~~~~~ src/ast_selectors.hpp:349:5: note: in expansion of macro ‘ATTACH_VIRTUAL_CMP_OPERATIONS’ 349 | ATTACH_VIRTUAL_CMP_OPERATIONS(SelectorComponent); | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~ src/ast_def_macros.hpp:110:16: note: by ‘virtual bool Sass::SelectorCombinator::operator!=(const Sass::SelectorCombinator&) const’ 110 | virtual bool operator!=(const klass& rhs) const { return !(*this == rhs); }; \ | ^~~~~~~~ src/ast_selectors.hpp:407:5: note: in expansion of macro ‘ATTACH_CMP_OPERATIONS’ 407 | ATTACH_CMP_OPERATIONS(SelectorCombinator) | ^~~~~~~~~~~~~~~~~~~~~ g++ -std=gnu++17 -Wall -O2 -std=c++11 -I ./include -fPIC -c -o src/error_handling.o src/error_handling.cpp In file included from src/error_handling.cpp:5: src/ast.hpp:90:18: warning: ‘virtual bool Sass::AST_Node::operator==(const Sass::AST_Node&) const’ was hidden [-Woverloaded-virtual=] 90 | virtual bool operator== (const AST_Node& rhs) const { | ^~~~~~~~ src/ast.hpp:165:18: note: by ‘virtual bool Sass::Expression::operator==(const Sass::Expression&) const’ 165 | virtual bool operator== (const Expression& rhs) const { return false; } | ^~~~~~~~ src/ast.hpp:96:18: warning: ‘virtual bool Sass::AST_Node::operator!=(const Sass::AST_Node&) const’ was hidden [-Woverloaded-virtual=] 96 | virtual bool operator!= (const AST_Node& rhs) const { | ^~~~~~~~ src/ast.hpp:167:17: note: by ‘bool Sass::Expression::operator!=(const Sass::Expression&) const’ 167 | inline bool operator!=(const Expression& rhs) const { return !(rhs == *this); } | ^~~~~~~~ src/ast.hpp:90:18: warning: ‘virtual bool Sass::AST_Node::operator==(const Sass::AST_Node&) const’ was hidden [-Woverloaded-virtual=] 90 | virtual bool operator== (const AST_Node& rhs) const { | ^~~~~~~~ src/ast.hpp:908:10: note: by ‘bool Sass::CssMediaRule::operator==(const Sass::CssMediaRule&) const’ 908 | bool operator== (const CssMediaRule& rhs) const { | ^~~~~~~~ src/ast.hpp:96:18: warning: ‘virtual bool Sass::AST_Node::operator!=(const Sass::AST_Node&) const’ was hidden [-Woverloaded-virtual=] 96 | virtual bool operator!= (const AST_Node& rhs) const { | ^~~~~~~~ src/ast.hpp:911:10: note: by ‘bool Sass::CssMediaRule::operator!=(const Sass::CssMediaRule&) const’ 911 | bool operator!=(const CssMediaRule& rhs) const { | ^~~~~~~~ src/ast.hpp:90:18: warning: ‘virtual bool Sass::AST_Node::operator==(const Sass::AST_Node&) const’ was hidden [-Woverloaded-virtual=] 90 | virtual bool operator== (const AST_Node& rhs) const { | ^~~~~~~~ src/ast.hpp:939:10: note: by ‘bool Sass::CssMediaQuery::operator==(const Sass::CssMediaQuery&) const’ 939 | bool operator== (const CssMediaQuery& rhs) const; | ^~~~~~~~ src/ast.hpp:96:18: warning: ‘virtual bool Sass::AST_Node::operator!=(const Sass::AST_Node&) const’ was hidden [-Woverloaded-virtual=] 96 | virtual bool operator!= (const AST_Node& rhs) const { | ^~~~~~~~ src/ast.hpp:940:10: note: by ‘bool Sass::CssMediaQuery::operator!=(const Sass::CssMediaQuery&) const’ 940 | bool operator!=(const CssMediaQuery& rhs) const { | ^~~~~~~~ src/ast.hpp:165:18: warning: ‘virtual bool Sass::Expression::operator==(const Sass::Expression&) const’ was hidden [-Woverloaded-virtual=] 165 | virtual bool operator== (const Expression& rhs) const { return false; } | ^~~~~~~~ In file included from src/ast.hpp:14: src/ast_def_macros.hpp:105:16: note: by ‘virtual bool Sass::Selector::operator==(const Sass::Selector&) const’ 105 | virtual bool operator==(const klass& rhs) const = 0; \ | ^~~~~~~~ src/ast_selectors.hpp:56:5: note: in expansion of macro ‘ATTACH_VIRTUAL_CMP_OPERATIONS’ 56 | ATTACH_VIRTUAL_CMP_OPERATIONS(Selector) | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~ src/ast.hpp:96:18: warning: ‘virtual bool Sass::AST_Node::operator!=(const Sass::AST_Node&) const’ was hidden [-Woverloaded-virtual=] 96 | virtual bool operator!= (const AST_Node& rhs) const { | ^~~~~~~~ src/ast_def_macros.hpp:106:16: note: by ‘virtual bool Sass::Selector::operator!=(const Sass::Selector&) const’ 106 | virtual bool operator!=(const klass& rhs) const { return !(*this == rhs); }; \ | ^~~~~~~~ src/ast_selectors.hpp:56:5: note: in expansion of macro ‘ATTACH_VIRTUAL_CMP_OPERATIONS’ 56 | ATTACH_VIRTUAL_CMP_OPERATIONS(Selector) | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~ src/ast_def_macros.hpp:106:16: warning: ‘virtual bool Sass::Selector::operator!=(const Sass::Selector&) const’ was hidden [-Woverloaded-virtual=] 106 | virtual bool operator!=(const klass& rhs) const { return !(*this == rhs); }; \ | ^~~~~~~~ src/ast_selectors.hpp:56:5: note: in expansion of macro ‘ATTACH_VIRTUAL_CMP_OPERATIONS’ 56 | ATTACH_VIRTUAL_CMP_OPERATIONS(Selector) | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~ src/ast_def_macros.hpp:106:16: note: by ‘virtual bool Sass::SimpleSelector::operator!=(const Sass::SimpleSelector&) const’ 106 | virtual bool operator!=(const klass& rhs) const { return !(*this == rhs); }; \ | ^~~~~~~~ src/ast_selectors.hpp:139:5: note: in expansion of macro ‘ATTACH_VIRTUAL_CMP_OPERATIONS’ 139 | ATTACH_VIRTUAL_CMP_OPERATIONS(SimpleSelector); | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~ In file included from src/ast.hpp:1055: src/ast_selectors.hpp:137:18: warning: ‘virtual bool Sass::SimpleSelector::operator==(const Sass::CompoundSelector&) const’ was hidden [-Woverloaded-virtual=] 137 | virtual bool operator==(const CompoundSelector& rhs) const; | ^~~~~~~~ src/ast_def_macros.hpp:109:16: note: by ‘Sass::PlaceholderSelector::operator==’ 109 | virtual bool operator==(const klass& rhs) const; \ | ^~~~~~~~ src/ast_selectors.hpp:157:5: note: in expansion of macro ‘ATTACH_CMP_OPERATIONS’ 157 | ATTACH_CMP_OPERATIONS(PlaceholderSelector) | ^~~~~~~~~~~~~~~~~~~~~ src/ast_selectors.hpp:136:18: warning: ‘virtual bool Sass::SimpleSelector::operator==(const Sass::ComplexSelector&) const’ was hidden [-Woverloaded-virtual=] 136 | virtual bool operator==(const ComplexSelector& rhs) const; | ^~~~~~~~ src/ast_def_macros.hpp:109:16: note: by ‘Sass::PlaceholderSelector::operator==’ 109 | virtual bool operator==(const klass& rhs) const; \ | ^~~~~~~~ src/ast_selectors.hpp:157:5: note: in expansion of macro ‘ATTACH_CMP_OPERATIONS’ 157 | ATTACH_CMP_OPERATIONS(PlaceholderSelector) | ^~~~~~~~~~~~~~~~~~~~~ src/ast_selectors.hpp:135:18: warning: ‘virtual bool Sass::SimpleSelector::operator==(const Sass::SelectorList&) const’ was hidden [-Woverloaded-virtual=] 135 | virtual bool operator==(const SelectorList& rhs) const; | ^~~~~~~~ src/ast_def_macros.hpp:109:16: note: by ‘Sass::PlaceholderSelector::operator==’ 109 | virtual bool operator==(const klass& rhs) const; \ | ^~~~~~~~ src/ast_selectors.hpp:157:5: note: in expansion of macro ‘ATTACH_CMP_OPERATIONS’ 157 | ATTACH_CMP_OPERATIONS(PlaceholderSelector) | ^~~~~~~~~~~~~~~~~~~~~ src/ast_selectors.hpp:133:10: warning: ‘virtual bool Sass::SimpleSelector::operator==(const Sass::Selector&) const’ was hidden [-Woverloaded-virtual=] 133 | bool operator==(const Selector& rhs) const final override; | ^~~~~~~~ src/ast_def_macros.hpp:109:16: note: by ‘Sass::PlaceholderSelector::operator==’ 109 | virtual bool operator==(const klass& rhs) const; \ | ^~~~~~~~ src/ast_selectors.hpp:157:5: note: in expansion of macro ‘ATTACH_CMP_OPERATIONS’ 157 | ATTACH_CMP_OPERATIONS(PlaceholderSelector) | ^~~~~~~~~~~~~~~~~~~~~ src/ast_def_macros.hpp:106:16: warning: ‘virtual bool Sass::SimpleSelector::operator!=(const Sass::SimpleSelector&) const’ was hidden [-Woverloaded-virtual=] 106 | virtual bool operator!=(const klass& rhs) const { return !(*this == rhs); }; \ | ^~~~~~~~ src/ast_selectors.hpp:139:5: note: in expansion of macro ‘ATTACH_VIRTUAL_CMP_OPERATIONS’ 139 | ATTACH_VIRTUAL_CMP_OPERATIONS(SimpleSelector); | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~ src/ast_def_macros.hpp:110:16: note: by ‘virtual bool Sass::PlaceholderSelector::operator!=(const Sass::PlaceholderSelector&) const’ 110 | virtual bool operator!=(const klass& rhs) const { return !(*this == rhs); }; \ | ^~~~~~~~ src/ast_selectors.hpp:157:5: note: in expansion of macro ‘ATTACH_CMP_OPERATIONS’ 157 | ATTACH_CMP_OPERATIONS(PlaceholderSelector) | ^~~~~~~~~~~~~~~~~~~~~ src/ast_selectors.hpp:137:18: warning: ‘virtual bool Sass::SimpleSelector::operator==(const Sass::CompoundSelector&) const’ was hidden [-Woverloaded-virtual=] 137 | virtual bool operator==(const CompoundSelector& rhs) const; | ^~~~~~~~ src/ast_def_macros.hpp:109:16: note: by ‘Sass::TypeSelector::operator==’ 109 | virtual bool operator==(const klass& rhs) const; \ | ^~~~~~~~ src/ast_selectors.hpp:174:5: note: in expansion of macro ‘ATTACH_CMP_OPERATIONS’ 174 | ATTACH_CMP_OPERATIONS(TypeSelector) | ^~~~~~~~~~~~~~~~~~~~~ src/ast_selectors.hpp:136:18: warning: ‘virtual bool Sass::SimpleSelector::operator==(const Sass::ComplexSelector&) const’ was hidden [-Woverloaded-virtual=] 136 | virtual bool operator==(const ComplexSelector& rhs) const; | ^~~~~~~~ src/ast_def_macros.hpp:109:16: note: by ‘Sass::TypeSelector::operator==’ 109 | virtual bool operator==(const klass& rhs) const; \ | ^~~~~~~~ src/ast_selectors.hpp:174:5: note: in expansion of macro ‘ATTACH_CMP_OPERATIONS’ 174 | ATTACH_CMP_OPERATIONS(TypeSelector) | ^~~~~~~~~~~~~~~~~~~~~ src/ast_selectors.hpp:135:18: warning: ‘virtual bool Sass::SimpleSelector::operator==(const Sass::SelectorList&) const’ was hidden [-Woverloaded-virtual=] 135 | virtual bool operator==(const SelectorList& rhs) const; | ^~~~~~~~ src/ast_def_macros.hpp:109:16: note: by ‘Sass::TypeSelector::operator==’ 109 | virtual bool operator==(const klass& rhs) const; \ | ^~~~~~~~ src/ast_selectors.hpp:174:5: note: in expansion of macro ‘ATTACH_CMP_OPERATIONS’ 174 | ATTACH_CMP_OPERATIONS(TypeSelector) | ^~~~~~~~~~~~~~~~~~~~~ src/ast_selectors.hpp:133:10: warning: ‘virtual bool Sass::SimpleSelector::operator==(const Sass::Selector&) const’ was hidden [-Woverloaded-virtual=] 133 | bool operator==(const Selector& rhs) const final override; | ^~~~~~~~ src/ast_def_macros.hpp:109:16: note: by ‘Sass::TypeSelector::operator==’ 109 | virtual bool operator==(const klass& rhs) const; \ | ^~~~~~~~ src/ast_selectors.hpp:174:5: note: in expansion of macro ‘ATTACH_CMP_OPERATIONS’ 174 | ATTACH_CMP_OPERATIONS(TypeSelector) | ^~~~~~~~~~~~~~~~~~~~~ src/ast_def_macros.hpp:106:16: warning: ‘virtual bool Sass::SimpleSelector::operator!=(const Sass::SimpleSelector&) const’ was hidden [-Woverloaded-virtual=] 106 | virtual bool operator!=(const klass& rhs) const { return !(*this == rhs); }; \ | ^~~~~~~~ src/ast_selectors.hpp:139:5: note: in expansion of macro ‘ATTACH_VIRTUAL_CMP_OPERATIONS’ 139 | ATTACH_VIRTUAL_CMP_OPERATIONS(SimpleSelector); | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~ src/ast_def_macros.hpp:110:16: note: by ‘virtual bool Sass::TypeSelector::operator!=(const Sass::TypeSelector&) const’ 110 | virtual bool operator!=(const klass& rhs) const { return !(*this == rhs); }; \ | ^~~~~~~~ src/ast_selectors.hpp:174:5: note: in expansion of macro ‘ATTACH_CMP_OPERATIONS’ 174 | ATTACH_CMP_OPERATIONS(TypeSelector) | ^~~~~~~~~~~~~~~~~~~~~ src/ast_selectors.hpp:137:18: warning: ‘virtual bool Sass::SimpleSelector::operator==(const Sass::CompoundSelector&) const’ was hidden [-Woverloaded-virtual=] 137 | virtual bool operator==(const CompoundSelector& rhs) const; | ^~~~~~~~ src/ast_def_macros.hpp:109:16: note: by ‘Sass::ClassSelector::operator==’ 109 | virtual bool operator==(const klass& rhs) const; \ | ^~~~~~~~ src/ast_selectors.hpp:188:5: note: in expansion of macro ‘ATTACH_CMP_OPERATIONS’ 188 | ATTACH_CMP_OPERATIONS(ClassSelector) | ^~~~~~~~~~~~~~~~~~~~~ src/ast_selectors.hpp:136:18: warning: ‘virtual bool Sass::SimpleSelector::operator==(const Sass::ComplexSelector&) const’ was hidden [-Woverloaded-virtual=] 136 | virtual bool operator==(const ComplexSelector& rhs) const; | ^~~~~~~~ src/ast_def_macros.hpp:109:16: note: by ‘Sass::ClassSelector::operator==’ 109 | virtual bool operator==(const klass& rhs) const; \ | ^~~~~~~~ src/ast_selectors.hpp:188:5: note: in expansion of macro ‘ATTACH_CMP_OPERATIONS’ 188 | ATTACH_CMP_OPERATIONS(ClassSelector) | ^~~~~~~~~~~~~~~~~~~~~ src/ast_selectors.hpp:135:18: warning: ‘virtual bool Sass::SimpleSelector::operator==(const Sass::SelectorList&) const’ was hidden [-Woverloaded-virtual=] 135 | virtual bool operator==(const SelectorList& rhs) const; | ^~~~~~~~ src/ast_def_macros.hpp:109:16: note: by ‘Sass::ClassSelector::operator==’ 109 | virtual bool operator==(const klass& rhs) const; \ | ^~~~~~~~ src/ast_selectors.hpp:188:5: note: in expansion of macro ‘ATTACH_CMP_OPERATIONS’ 188 | ATTACH_CMP_OPERATIONS(ClassSelector) | ^~~~~~~~~~~~~~~~~~~~~ src/ast_selectors.hpp:133:10: warning: ‘virtual bool Sass::SimpleSelector::operator==(const Sass::Selector&) const’ was hidden [-Woverloaded-virtual=] 133 | bool operator==(const Selector& rhs) const final override; | ^~~~~~~~ src/ast_def_macros.hpp:109:16: note: by ‘Sass::ClassSelector::operator==’ 109 | virtual bool operator==(const klass& rhs) const; \ | ^~~~~~~~ src/ast_selectors.hpp:188:5: note: in expansion of macro ‘ATTACH_CMP_OPERATIONS’ 188 | ATTACH_CMP_OPERATIONS(ClassSelector) | ^~~~~~~~~~~~~~~~~~~~~ src/ast_def_macros.hpp:106:16: warning: ‘virtual bool Sass::SimpleSelector::operator!=(const Sass::SimpleSelector&) const’ was hidden [-Woverloaded-virtual=] 106 | virtual bool operator!=(const klass& rhs) const { return !(*this == rhs); }; \ | ^~~~~~~~ src/ast_selectors.hpp:139:5: note: in expansion of macro ‘ATTACH_VIRTUAL_CMP_OPERATIONS’ 139 | ATTACH_VIRTUAL_CMP_OPERATIONS(SimpleSelector); | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~ src/ast_def_macros.hpp:110:16: note: by ‘virtual bool Sass::ClassSelector::operator!=(const Sass::ClassSelector&) const’ 110 | virtual bool operator!=(const klass& rhs) const { return !(*this == rhs); }; \ | ^~~~~~~~ src/ast_selectors.hpp:188:5: note: in expansion of macro ‘ATTACH_CMP_OPERATIONS’ 188 | ATTACH_CMP_OPERATIONS(ClassSelector) | ^~~~~~~~~~~~~~~~~~~~~ src/ast_selectors.hpp:137:18: warning: ‘virtual bool Sass::SimpleSelector::operator==(const Sass::CompoundSelector&) const’ was hidden [-Woverloaded-virtual=] 137 | virtual bool operator==(const CompoundSelector& rhs) const; | ^~~~~~~~ src/ast_def_macros.hpp:109:16: note: by ‘Sass::IDSelector::operator==’ 109 | virtual bool operator==(const klass& rhs) const; \ | ^~~~~~~~ src/ast_selectors.hpp:204:5: note: in expansion of macro ‘ATTACH_CMP_OPERATIONS’ 204 | ATTACH_CMP_OPERATIONS(IDSelector) | ^~~~~~~~~~~~~~~~~~~~~ src/ast_selectors.hpp:136:18: warning: ‘virtual bool Sass::SimpleSelector::operator==(const Sass::ComplexSelector&) const’ was hidden [-Woverloaded-virtual=] 136 | virtual bool operator==(const ComplexSelector& rhs) const; | ^~~~~~~~ src/ast_def_macros.hpp:109:16: note: by ‘Sass::IDSelector::operator==’ 109 | virtual bool operator==(const klass& rhs) const; \ | ^~~~~~~~ src/ast_selectors.hpp:204:5: note: in expansion of macro ‘ATTACH_CMP_OPERATIONS’ 204 | ATTACH_CMP_OPERATIONS(IDSelector) | ^~~~~~~~~~~~~~~~~~~~~ src/ast_selectors.hpp:135:18: warning: ‘virtual bool Sass::SimpleSelector::operator==(const Sass::SelectorList&) const’ was hidden [-Woverloaded-virtual=] 135 | virtual bool operator==(const SelectorList& rhs) const; | ^~~~~~~~ src/ast_def_macros.hpp:109:16: note: by ‘Sass::IDSelector::operator==’ 109 | virtual bool operator==(const klass& rhs) const; \ | ^~~~~~~~ src/ast_selectors.hpp:204:5: note: in expansion of macro ‘ATTACH_CMP_OPERATIONS’ 204 | ATTACH_CMP_OPERATIONS(IDSelector) | ^~~~~~~~~~~~~~~~~~~~~ src/ast_selectors.hpp:133:10: warning: ‘virtual bool Sass::SimpleSelector::operator==(const Sass::Selector&) const’ was hidden [-Woverloaded-virtual=] 133 | bool operator==(const Selector& rhs) const final override; | ^~~~~~~~ src/ast_def_macros.hpp:109:16: note: by ‘Sass::IDSelector::operator==’ 109 | virtual bool operator==(const klass& rhs) const; \ | ^~~~~~~~ src/ast_selectors.hpp:204:5: note: in expansion of macro ‘ATTACH_CMP_OPERATIONS’ 204 | ATTACH_CMP_OPERATIONS(IDSelector) | ^~~~~~~~~~~~~~~~~~~~~ src/ast_def_macros.hpp:106:16: warning: ‘virtual bool Sass::SimpleSelector::operator!=(const Sass::SimpleSelector&) const’ was hidden [-Woverloaded-virtual=] 106 | virtual bool operator!=(const klass& rhs) const { return !(*this == rhs); }; \ | ^~~~~~~~ src/ast_selectors.hpp:139:5: note: in expansion of macro ‘ATTACH_VIRTUAL_CMP_OPERATIONS’ 139 | ATTACH_VIRTUAL_CMP_OPERATIONS(SimpleSelector); | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~ src/ast_def_macros.hpp:110:16: note: by ‘virtual bool Sass::IDSelector::operator!=(const Sass::IDSelector&) const’ 110 | virtual bool operator!=(const klass& rhs) const { return !(*this == rhs); }; \ | ^~~~~~~~ src/ast_selectors.hpp:204:5: note: in expansion of macro ‘ATTACH_CMP_OPERATIONS’ 204 | ATTACH_CMP_OPERATIONS(IDSelector) | ^~~~~~~~~~~~~~~~~~~~~ src/ast_selectors.hpp:137:18: warning: ‘virtual bool Sass::SimpleSelector::operator==(const Sass::CompoundSelector&) const’ was hidden [-Woverloaded-virtual=] 137 | virtual bool operator==(const CompoundSelector& rhs) const; | ^~~~~~~~ src/ast_def_macros.hpp:109:16: note: by ‘Sass::AttributeSelector::operator==’ 109 | virtual bool operator==(const klass& rhs) const; \ | ^~~~~~~~ src/ast_selectors.hpp:223:5: note: in expansion of macro ‘ATTACH_CMP_OPERATIONS’ 223 | ATTACH_CMP_OPERATIONS(AttributeSelector) | ^~~~~~~~~~~~~~~~~~~~~ src/ast_selectors.hpp:136:18: warning: ‘virtual bool Sass::SimpleSelector::operator==(const Sass::ComplexSelector&) const’ was hidden [-Woverloaded-virtual=] 136 | virtual bool operator==(const ComplexSelector& rhs) const; | ^~~~~~~~ src/ast_def_macros.hpp:109:16: note: by ‘Sass::AttributeSelector::operator==’ 109 | virtual bool operator==(const klass& rhs) const; \ | ^~~~~~~~ src/ast_selectors.hpp:223:5: note: in expansion of macro ‘ATTACH_CMP_OPERATIONS’ 223 | ATTACH_CMP_OPERATIONS(AttributeSelector) | ^~~~~~~~~~~~~~~~~~~~~ src/ast_selectors.hpp:135:18: warning: ‘virtual bool Sass::SimpleSelector::operator==(const Sass::SelectorList&) const’ was hidden [-Woverloaded-virtual=] 135 | virtual bool operator==(const SelectorList& rhs) const; | ^~~~~~~~ src/ast_def_macros.hpp:109:16: note: by ‘Sass::AttributeSelector::operator==’ 109 | virtual bool operator==(const klass& rhs) const; \ | ^~~~~~~~ src/ast_selectors.hpp:223:5: note: in expansion of macro ‘ATTACH_CMP_OPERATIONS’ 223 | ATTACH_CMP_OPERATIONS(AttributeSelector) | ^~~~~~~~~~~~~~~~~~~~~ src/ast_selectors.hpp:133:10: warning: ‘virtual bool Sass::SimpleSelector::operator==(const Sass::Selector&) const’ was hidden [-Woverloaded-virtual=] 133 | bool operator==(const Selector& rhs) const final override; | ^~~~~~~~ src/ast_def_macros.hpp:109:16: note: by ‘Sass::AttributeSelector::operator==’ 109 | virtual bool operator==(const klass& rhs) const; \ | ^~~~~~~~ src/ast_selectors.hpp:223:5: note: in expansion of macro ‘ATTACH_CMP_OPERATIONS’ 223 | ATTACH_CMP_OPERATIONS(AttributeSelector) | ^~~~~~~~~~~~~~~~~~~~~ src/ast_def_macros.hpp:106:16: warning: ‘virtual bool Sass::SimpleSelector::operator!=(const Sass::SimpleSelector&) const’ was hidden [-Woverloaded-virtual=] 106 | virtual bool operator!=(const klass& rhs) const { return !(*this == rhs); }; \ | ^~~~~~~~ src/ast_selectors.hpp:139:5: note: in expansion of macro ‘ATTACH_VIRTUAL_CMP_OPERATIONS’ 139 | ATTACH_VIRTUAL_CMP_OPERATIONS(SimpleSelector); | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~ src/ast_def_macros.hpp:110:16: note: by ‘virtual bool Sass::AttributeSelector::operator!=(const Sass::AttributeSelector&) const’ 110 | virtual bool operator!=(const klass& rhs) const { return !(*this == rhs); }; \ | ^~~~~~~~ src/ast_selectors.hpp:223:5: note: in expansion of macro ‘ATTACH_CMP_OPERATIONS’ 223 | ATTACH_CMP_OPERATIONS(AttributeSelector) | ^~~~~~~~~~~~~~~~~~~~~ src/ast_def_macros.hpp:106:16: warning: ‘virtual bool Sass::Selector::operator!=(const Sass::Selector&) const’ was hidden [-Woverloaded-virtual=] 106 | virtual bool operator!=(const klass& rhs) const { return !(*this == rhs); }; \ | ^~~~~~~~ src/ast_selectors.hpp:56:5: note: in expansion of macro ‘ATTACH_VIRTUAL_CMP_OPERATIONS’ 56 | ATTACH_VIRTUAL_CMP_OPERATIONS(Selector) | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~ src/ast_def_macros.hpp:110:16: note: by ‘virtual bool Sass::ComplexSelector::operator!=(const Sass::ComplexSelector&) const’ 110 | virtual bool operator!=(const klass& rhs) const { return !(*this == rhs); }; \ | ^~~~~~~~ src/ast_selectors.hpp:310:5: note: in expansion of macro ‘ATTACH_CMP_OPERATIONS’ 310 | ATTACH_CMP_OPERATIONS(ComplexSelector) | ^~~~~~~~~~~~~~~~~~~~~ src/ast_def_macros.hpp:106:16: warning: ‘virtual bool Sass::Selector::operator!=(const Sass::Selector&) const’ was hidden [-Woverloaded-virtual=] 106 | virtual bool operator!=(const klass& rhs) const { return !(*this == rhs); }; \ | ^~~~~~~~ src/ast_selectors.hpp:56:5: note: in expansion of macro ‘ATTACH_VIRTUAL_CMP_OPERATIONS’ 56 | ATTACH_VIRTUAL_CMP_OPERATIONS(Selector) | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~ src/ast_def_macros.hpp:106:16: note: by ‘virtual bool Sass::SelectorComponent::operator!=(const Sass::SelectorComponent&) const’ 106 | virtual bool operator!=(const klass& rhs) const { return !(*this == rhs); }; \ | ^~~~~~~~ src/ast_selectors.hpp:349:5: note: in expansion of macro ‘ATTACH_VIRTUAL_CMP_OPERATIONS’ 349 | ATTACH_VIRTUAL_CMP_OPERATIONS(SelectorComponent); | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~ src/ast_def_macros.hpp:106:16: warning: ‘virtual bool Sass::SelectorComponent::operator!=(const Sass::SelectorComponent&) const’ was hidden [-Woverloaded-virtual=] 106 | virtual bool operator!=(const klass& rhs) const { return !(*this == rhs); }; \ | ^~~~~~~~ src/ast_selectors.hpp:349:5: note: in expansion of macro ‘ATTACH_VIRTUAL_CMP_OPERATIONS’ 349 | ATTACH_VIRTUAL_CMP_OPERATIONS(SelectorComponent); | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~ src/ast_def_macros.hpp:110:16: note: by ‘virtual bool Sass::SelectorCombinator::operator!=(const Sass::SelectorCombinator&) const’ 110 | virtual bool operator!=(const klass& rhs) const { return !(*this == rhs); }; \ | ^~~~~~~~ src/ast_selectors.hpp:407:5: note: in expansion of macro ‘ATTACH_CMP_OPERATIONS’ 407 | ATTACH_CMP_OPERATIONS(SelectorCombinator) | ^~~~~~~~~~~~~~~~~~~~~ g++ -std=gnu++17 -Wall -O2 -std=c++11 -I ./include -fPIC -c -o src/memory/allocator.o src/memory/allocator.cpp g++ -std=gnu++17 -Wall -O2 -std=c++11 -I ./include -fPIC -c -o src/memory/shared_ptr.o src/memory/shared_ptr.cpp g++ -std=gnu++17 -Wall -O2 -std=c++11 -I ./include -fPIC -c -o src/utf8_string.o src/utf8_string.cpp g++ -std=gnu++17 -Wall -O2 -std=c++11 -I ./include -fPIC -c -o src/base64vlq.o src/base64vlq.cpp mkdir lib ar rcvs lib/libsass.a src/cencode.o src/ast.o src/ast_values.o src/ast_supports.o src/ast_sel_cmp.o src/ast_sel_unify.o src/ast_sel_super.o src/ast_sel_weave.o src/ast_selectors.o src/context.o src/constants.o src/fn_utils.o src/fn_miscs.o src/fn_maps.o src/fn_lists.o src/fn_colors.o src/fn_numbers.o src/fn_strings.o src/fn_selectors.o src/color_maps.o src/environment.o src/ast_fwd_decl.o src/bind.o src/file.o src/util.o src/util_string.o src/json.o src/units.o src/values.o src/plugins.o src/source.o src/position.o src/lexer.o src/parser.o src/parser_selectors.o src/prelexer.o src/eval.o src/eval_selectors.o src/expand.o src/listize.o src/cssize.o src/extender.o src/extension.o src/stylesheet.o src/output.o src/inspect.o src/emitter.o src/check_nesting.o src/remove_placeholders.o src/sass.o src/sass_values.o src/sass_context.o src/sass_functions.o src/sass2scss.o src/backtrace.o src/operators.o src/ast2c.o src/c2ast.o src/to_value.o src/source_map.o src/error_handling.o src/memory/allocator.o src/memory/shared_ptr.o src/utf8_string.o src/base64vlq.o a - src/cencode.o a - src/ast.o a - src/ast_values.o a - src/ast_supports.o a - src/ast_sel_cmp.o a - src/ast_sel_unify.o a - src/ast_sel_super.o a - src/ast_sel_weave.o a - src/ast_selectors.o a - src/context.o a - src/constants.o a - src/fn_utils.o a - src/fn_miscs.o a - src/fn_maps.o a - src/fn_lists.o a - src/fn_colors.o a - src/fn_numbers.o a - src/fn_strings.o a - src/fn_selectors.o a - src/color_maps.o a - src/environment.o a - src/ast_fwd_decl.o a - src/bind.o a - src/file.o a - src/util.o a - src/util_string.o a - src/json.o a - src/units.o a - src/values.o a - src/plugins.o a - src/source.o a - src/position.o a - src/lexer.o a - src/parser.o a - src/parser_selectors.o a - src/prelexer.o a - src/eval.o a - src/eval_selectors.o a - src/expand.o a - src/listize.o a - src/cssize.o a - src/extender.o a - src/extension.o a - src/stylesheet.o a - src/output.o a - src/inspect.o a - src/emitter.o a - src/check_nesting.o a - src/remove_placeholders.o a - src/sass.o a - src/sass_values.o a - src/sass_context.o a - src/sass_functions.o a - src/sass2scss.o a - src/backtrace.o a - src/operators.o a - src/ast2c.o a - src/c2ast.o a - src/to_value.o a - src/source_map.o a - src/error_handling.o a - src/memory/allocator.o a - src/memory/shared_ptr.o a - src/utf8_string.o a - src/base64vlq.o make[1]: Leaving directory '/tmp/RtmpUggGWo/R.INSTALL15caa1bc6540/sass/src/libsass' g++ -std=gnu++17 -shared -L/usr/lib/R/lib -Wl,-Bsymbolic-functions -flto=auto -ffat-lto-objects -Wl,-z,relro -o sass.so compile.o init.o ./libsass/lib/libsass.a -L/usr/lib/R/lib -lR installing to /home/omnipath/local/R/4.4-3.20/00LOCK-sass/00new/sass/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 (sass) * installing *source* package ‘jquerylib’ ... ** package ‘jquerylib’ 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 (jquerylib) * installing *source* package ‘fontawesome’ ... ** package ‘fontawesome’ 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 ** 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 (fontawesome) * installing *source* package ‘waldo’ ... ** package ‘waldo’ 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 (waldo) * installing *source* package ‘pkgload’ ... ** package ‘pkgload’ 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 (pkgload) * installing *source* package ‘vroom’ ... ** package ‘vroom’ successfully unpacked and MD5 sums checked ** using staged installation ** libs using C compiler: ‘gcc (Ubuntu 13.2.0-23ubuntu4) 13.2.0’ using C++ compiler: ‘g++ (Ubuntu 13.2.0-23ubuntu4) 13.2.0’ g++ -std=gnu++17 -I"/usr/share/R/include" -DNDEBUG -Imio/include -DWIN32_LEAN_AND_MEAN -Ispdlog/include -DFMT_HEADER_ONLY -I'/home/omnipath/local/R/4.4-3.20/cpp11/include' -I'/home/omnipath/local/R/4.4-3.20/progress/include' -I'/home/omnipath/local/R/4.4-3.20/tzdb/include' -fpic -g -O2 -fno-omit-frame-pointer -mno-omit-leaf-frame-pointer -ffile-prefix-map=/build/r-base-EawLoD/r-base-4.4.1=. -fstack-protector-strong -fstack-clash-protection -Wformat -Werror=format-security -fcf-protection -fdebug-prefix-map=/build/r-base-EawLoD/r-base-4.4.1=/usr/src/r-base-4.4.1-1.2404.0 -Wdate-time -D_FORTIFY_SOURCE=3 -c Iconv.cpp -o Iconv.o g++ -std=gnu++17 -I"/usr/share/R/include" -DNDEBUG -Imio/include -DWIN32_LEAN_AND_MEAN -Ispdlog/include -DFMT_HEADER_ONLY -I'/home/omnipath/local/R/4.4-3.20/cpp11/include' -I'/home/omnipath/local/R/4.4-3.20/progress/include' -I'/home/omnipath/local/R/4.4-3.20/tzdb/include' -fpic -g -O2 -fno-omit-frame-pointer -mno-omit-leaf-frame-pointer -ffile-prefix-map=/build/r-base-EawLoD/r-base-4.4.1=. -fstack-protector-strong -fstack-clash-protection -Wformat -Werror=format-security -fcf-protection -fdebug-prefix-map=/build/r-base-EawLoD/r-base-4.4.1=/usr/src/r-base-4.4.1-1.2404.0 -Wdate-time -D_FORTIFY_SOURCE=3 -c LocaleInfo.cpp -o LocaleInfo.o g++ -std=gnu++17 -I"/usr/share/R/include" -DNDEBUG -Imio/include -DWIN32_LEAN_AND_MEAN -Ispdlog/include -DFMT_HEADER_ONLY -I'/home/omnipath/local/R/4.4-3.20/cpp11/include' -I'/home/omnipath/local/R/4.4-3.20/progress/include' -I'/home/omnipath/local/R/4.4-3.20/tzdb/include' -fpic -g -O2 -fno-omit-frame-pointer -mno-omit-leaf-frame-pointer -ffile-prefix-map=/build/r-base-EawLoD/r-base-4.4.1=. -fstack-protector-strong -fstack-clash-protection -Wformat -Werror=format-security -fcf-protection -fdebug-prefix-map=/build/r-base-EawLoD/r-base-4.4.1=/usr/src/r-base-4.4.1-1.2404.0 -Wdate-time -D_FORTIFY_SOURCE=3 -c altrep.cc -o altrep.o g++ -std=gnu++17 -I"/usr/share/R/include" -DNDEBUG -Imio/include -DWIN32_LEAN_AND_MEAN -Ispdlog/include -DFMT_HEADER_ONLY -I'/home/omnipath/local/R/4.4-3.20/cpp11/include' -I'/home/omnipath/local/R/4.4-3.20/progress/include' -I'/home/omnipath/local/R/4.4-3.20/tzdb/include' -fpic -g -O2 -fno-omit-frame-pointer -mno-omit-leaf-frame-pointer -ffile-prefix-map=/build/r-base-EawLoD/r-base-4.4.1=. -fstack-protector-strong -fstack-clash-protection -Wformat -Werror=format-security -fcf-protection -fdebug-prefix-map=/build/r-base-EawLoD/r-base-4.4.1=/usr/src/r-base-4.4.1-1.2404.0 -Wdate-time -D_FORTIFY_SOURCE=3 -c cpp11.cpp -o cpp11.o g++ -std=gnu++17 -I"/usr/share/R/include" -DNDEBUG -Imio/include -DWIN32_LEAN_AND_MEAN -Ispdlog/include -DFMT_HEADER_ONLY -I'/home/omnipath/local/R/4.4-3.20/cpp11/include' -I'/home/omnipath/local/R/4.4-3.20/progress/include' -I'/home/omnipath/local/R/4.4-3.20/tzdb/include' -fpic -g -O2 -fno-omit-frame-pointer -mno-omit-leaf-frame-pointer -ffile-prefix-map=/build/r-base-EawLoD/r-base-4.4.1=. -fstack-protector-strong -fstack-clash-protection -Wformat -Werror=format-security -fcf-protection -fdebug-prefix-map=/build/r-base-EawLoD/r-base-4.4.1=/usr/src/r-base-4.4.1-1.2404.0 -Wdate-time -D_FORTIFY_SOURCE=3 -c delimited_index.cc -o delimited_index.o g++ -std=gnu++17 -I"/usr/share/R/include" -DNDEBUG -Imio/include -DWIN32_LEAN_AND_MEAN -Ispdlog/include -DFMT_HEADER_ONLY -I'/home/omnipath/local/R/4.4-3.20/cpp11/include' -I'/home/omnipath/local/R/4.4-3.20/progress/include' -I'/home/omnipath/local/R/4.4-3.20/tzdb/include' -fpic -g -O2 -fno-omit-frame-pointer -mno-omit-leaf-frame-pointer -ffile-prefix-map=/build/r-base-EawLoD/r-base-4.4.1=. -fstack-protector-strong -fstack-clash-protection -Wformat -Werror=format-security -fcf-protection -fdebug-prefix-map=/build/r-base-EawLoD/r-base-4.4.1=/usr/src/r-base-4.4.1-1.2404.0 -Wdate-time -D_FORTIFY_SOURCE=3 -c delimited_index_connection.cc -o delimited_index_connection.o g++ -std=gnu++17 -I"/usr/share/R/include" -DNDEBUG -Imio/include -DWIN32_LEAN_AND_MEAN -Ispdlog/include -DFMT_HEADER_ONLY -I'/home/omnipath/local/R/4.4-3.20/cpp11/include' -I'/home/omnipath/local/R/4.4-3.20/progress/include' -I'/home/omnipath/local/R/4.4-3.20/tzdb/include' -fpic -g -O2 -fno-omit-frame-pointer -mno-omit-leaf-frame-pointer -ffile-prefix-map=/build/r-base-EawLoD/r-base-4.4.1=. -fstack-protector-strong -fstack-clash-protection -Wformat -Werror=format-security -fcf-protection -fdebug-prefix-map=/build/r-base-EawLoD/r-base-4.4.1=/usr/src/r-base-4.4.1-1.2404.0 -Wdate-time -D_FORTIFY_SOURCE=3 -c fixed_width_index_connection.cc -o fixed_width_index_connection.o g++ -std=gnu++17 -I"/usr/share/R/include" -DNDEBUG -Imio/include -DWIN32_LEAN_AND_MEAN -Ispdlog/include -DFMT_HEADER_ONLY -I'/home/omnipath/local/R/4.4-3.20/cpp11/include' -I'/home/omnipath/local/R/4.4-3.20/progress/include' -I'/home/omnipath/local/R/4.4-3.20/tzdb/include' -fpic -g -O2 -fno-omit-frame-pointer -mno-omit-leaf-frame-pointer -ffile-prefix-map=/build/r-base-EawLoD/r-base-4.4.1=. -fstack-protector-strong -fstack-clash-protection -Wformat -Werror=format-security -fcf-protection -fdebug-prefix-map=/build/r-base-EawLoD/r-base-4.4.1=/usr/src/r-base-4.4.1-1.2404.0 -Wdate-time -D_FORTIFY_SOURCE=3 -c gen.cc -o gen.o gcc -I"/usr/share/R/include" -DNDEBUG -Imio/include -DWIN32_LEAN_AND_MEAN -Ispdlog/include -DFMT_HEADER_ONLY -I'/home/omnipath/local/R/4.4-3.20/cpp11/include' -I'/home/omnipath/local/R/4.4-3.20/progress/include' -I'/home/omnipath/local/R/4.4-3.20/tzdb/include' -fpic -g -O2 -fno-omit-frame-pointer -mno-omit-leaf-frame-pointer -ffile-prefix-map=/build/r-base-EawLoD/r-base-4.4.1=. -fstack-protector-strong -fstack-clash-protection -Wformat -Werror=format-security -fcf-protection -fdebug-prefix-map=/build/r-base-EawLoD/r-base-4.4.1=/usr/src/r-base-4.4.1-1.2404.0 -Wdate-time -D_FORTIFY_SOURCE=3 -c grisu3.c -o grisu3.o g++ -std=gnu++17 -I"/usr/share/R/include" -DNDEBUG -Imio/include -DWIN32_LEAN_AND_MEAN -Ispdlog/include -DFMT_HEADER_ONLY -I'/home/omnipath/local/R/4.4-3.20/cpp11/include' -I'/home/omnipath/local/R/4.4-3.20/progress/include' -I'/home/omnipath/local/R/4.4-3.20/tzdb/include' -fpic -g -O2 -fno-omit-frame-pointer -mno-omit-leaf-frame-pointer -ffile-prefix-map=/build/r-base-EawLoD/r-base-4.4.1=. -fstack-protector-strong -fstack-clash-protection -Wformat -Werror=format-security -fcf-protection -fdebug-prefix-map=/build/r-base-EawLoD/r-base-4.4.1=/usr/src/r-base-4.4.1-1.2404.0 -Wdate-time -D_FORTIFY_SOURCE=3 -c guess_type.cc -o guess_type.o g++ -std=gnu++17 -I"/usr/share/R/include" -DNDEBUG -Imio/include -DWIN32_LEAN_AND_MEAN -Ispdlog/include -DFMT_HEADER_ONLY -I'/home/omnipath/local/R/4.4-3.20/cpp11/include' -I'/home/omnipath/local/R/4.4-3.20/progress/include' -I'/home/omnipath/local/R/4.4-3.20/tzdb/include' -fpic -g -O2 -fno-omit-frame-pointer -mno-omit-leaf-frame-pointer -ffile-prefix-map=/build/r-base-EawLoD/r-base-4.4.1=. -fstack-protector-strong -fstack-clash-protection -Wformat -Werror=format-security -fcf-protection -fdebug-prefix-map=/build/r-base-EawLoD/r-base-4.4.1=/usr/src/r-base-4.4.1-1.2404.0 -Wdate-time -D_FORTIFY_SOURCE=3 -c iconv_file.cc -o iconv_file.o g++ -std=gnu++17 -I"/usr/share/R/include" -DNDEBUG -Imio/include -DWIN32_LEAN_AND_MEAN -Ispdlog/include -DFMT_HEADER_ONLY -I'/home/omnipath/local/R/4.4-3.20/cpp11/include' -I'/home/omnipath/local/R/4.4-3.20/progress/include' -I'/home/omnipath/local/R/4.4-3.20/tzdb/include' -fpic -g -O2 -fno-omit-frame-pointer -mno-omit-leaf-frame-pointer -ffile-prefix-map=/build/r-base-EawLoD/r-base-4.4.1=. -fstack-protector-strong -fstack-clash-protection -Wformat -Werror=format-security -fcf-protection -fdebug-prefix-map=/build/r-base-EawLoD/r-base-4.4.1=/usr/src/r-base-4.4.1-1.2404.0 -Wdate-time -D_FORTIFY_SOURCE=3 -c index_collection.cc -o index_collection.o g++ -std=gnu++17 -I"/usr/share/R/include" -DNDEBUG -Imio/include -DWIN32_LEAN_AND_MEAN -Ispdlog/include -DFMT_HEADER_ONLY -I'/home/omnipath/local/R/4.4-3.20/cpp11/include' -I'/home/omnipath/local/R/4.4-3.20/progress/include' -I'/home/omnipath/local/R/4.4-3.20/tzdb/include' -fpic -g -O2 -fno-omit-frame-pointer -mno-omit-leaf-frame-pointer -ffile-prefix-map=/build/r-base-EawLoD/r-base-4.4.1=. -fstack-protector-strong -fstack-clash-protection -Wformat -Werror=format-security -fcf-protection -fdebug-prefix-map=/build/r-base-EawLoD/r-base-4.4.1=/usr/src/r-base-4.4.1-1.2404.0 -Wdate-time -D_FORTIFY_SOURCE=3 -c vroom.cc -o vroom.o g++ -std=gnu++17 -I"/usr/share/R/include" -DNDEBUG -Imio/include -DWIN32_LEAN_AND_MEAN -Ispdlog/include -DFMT_HEADER_ONLY -I'/home/omnipath/local/R/4.4-3.20/cpp11/include' -I'/home/omnipath/local/R/4.4-3.20/progress/include' -I'/home/omnipath/local/R/4.4-3.20/tzdb/include' -fpic -g -O2 -fno-omit-frame-pointer -mno-omit-leaf-frame-pointer -ffile-prefix-map=/build/r-base-EawLoD/r-base-4.4.1=. -fstack-protector-strong -fstack-clash-protection -Wformat -Werror=format-security -fcf-protection -fdebug-prefix-map=/build/r-base-EawLoD/r-base-4.4.1=/usr/src/r-base-4.4.1-1.2404.0 -Wdate-time -D_FORTIFY_SOURCE=3 -c vroom_big_int.cc -o vroom_big_int.o g++ -std=gnu++17 -I"/usr/share/R/include" -DNDEBUG -Imio/include -DWIN32_LEAN_AND_MEAN -Ispdlog/include -DFMT_HEADER_ONLY -I'/home/omnipath/local/R/4.4-3.20/cpp11/include' -I'/home/omnipath/local/R/4.4-3.20/progress/include' -I'/home/omnipath/local/R/4.4-3.20/tzdb/include' -fpic -g -O2 -fno-omit-frame-pointer -mno-omit-leaf-frame-pointer -ffile-prefix-map=/build/r-base-EawLoD/r-base-4.4.1=. -fstack-protector-strong -fstack-clash-protection -Wformat -Werror=format-security -fcf-protection -fdebug-prefix-map=/build/r-base-EawLoD/r-base-4.4.1=/usr/src/r-base-4.4.1-1.2404.0 -Wdate-time -D_FORTIFY_SOURCE=3 -c vroom_chr.cc -o vroom_chr.o g++ -std=gnu++17 -I"/usr/share/R/include" -DNDEBUG -Imio/include -DWIN32_LEAN_AND_MEAN -Ispdlog/include -DFMT_HEADER_ONLY -I'/home/omnipath/local/R/4.4-3.20/cpp11/include' -I'/home/omnipath/local/R/4.4-3.20/progress/include' -I'/home/omnipath/local/R/4.4-3.20/tzdb/include' -fpic -g -O2 -fno-omit-frame-pointer -mno-omit-leaf-frame-pointer -ffile-prefix-map=/build/r-base-EawLoD/r-base-4.4.1=. -fstack-protector-strong -fstack-clash-protection -Wformat -Werror=format-security -fcf-protection -fdebug-prefix-map=/build/r-base-EawLoD/r-base-4.4.1=/usr/src/r-base-4.4.1-1.2404.0 -Wdate-time -D_FORTIFY_SOURCE=3 -c vroom_date.cc -o vroom_date.o g++ -std=gnu++17 -I"/usr/share/R/include" -DNDEBUG -Imio/include -DWIN32_LEAN_AND_MEAN -Ispdlog/include -DFMT_HEADER_ONLY -I'/home/omnipath/local/R/4.4-3.20/cpp11/include' -I'/home/omnipath/local/R/4.4-3.20/progress/include' -I'/home/omnipath/local/R/4.4-3.20/tzdb/include' -fpic -g -O2 -fno-omit-frame-pointer -mno-omit-leaf-frame-pointer -ffile-prefix-map=/build/r-base-EawLoD/r-base-4.4.1=. -fstack-protector-strong -fstack-clash-protection -Wformat -Werror=format-security -fcf-protection -fdebug-prefix-map=/build/r-base-EawLoD/r-base-4.4.1=/usr/src/r-base-4.4.1-1.2404.0 -Wdate-time -D_FORTIFY_SOURCE=3 -c vroom_dbl.cc -o vroom_dbl.o g++ -std=gnu++17 -I"/usr/share/R/include" -DNDEBUG -Imio/include -DWIN32_LEAN_AND_MEAN -Ispdlog/include -DFMT_HEADER_ONLY -I'/home/omnipath/local/R/4.4-3.20/cpp11/include' -I'/home/omnipath/local/R/4.4-3.20/progress/include' -I'/home/omnipath/local/R/4.4-3.20/tzdb/include' -fpic -g -O2 -fno-omit-frame-pointer -mno-omit-leaf-frame-pointer -ffile-prefix-map=/build/r-base-EawLoD/r-base-4.4.1=. -fstack-protector-strong -fstack-clash-protection -Wformat -Werror=format-security -fcf-protection -fdebug-prefix-map=/build/r-base-EawLoD/r-base-4.4.1=/usr/src/r-base-4.4.1-1.2404.0 -Wdate-time -D_FORTIFY_SOURCE=3 -c vroom_dttm.cc -o vroom_dttm.o g++ -std=gnu++17 -I"/usr/share/R/include" -DNDEBUG -Imio/include -DWIN32_LEAN_AND_MEAN -Ispdlog/include -DFMT_HEADER_ONLY -I'/home/omnipath/local/R/4.4-3.20/cpp11/include' -I'/home/omnipath/local/R/4.4-3.20/progress/include' -I'/home/omnipath/local/R/4.4-3.20/tzdb/include' -fpic -g -O2 -fno-omit-frame-pointer -mno-omit-leaf-frame-pointer -ffile-prefix-map=/build/r-base-EawLoD/r-base-4.4.1=. -fstack-protector-strong -fstack-clash-protection -Wformat -Werror=format-security -fcf-protection -fdebug-prefix-map=/build/r-base-EawLoD/r-base-4.4.1=/usr/src/r-base-4.4.1-1.2404.0 -Wdate-time -D_FORTIFY_SOURCE=3 -c vroom_errors.cpp -o vroom_errors.o g++ -std=gnu++17 -I"/usr/share/R/include" -DNDEBUG -Imio/include -DWIN32_LEAN_AND_MEAN -Ispdlog/include -DFMT_HEADER_ONLY -I'/home/omnipath/local/R/4.4-3.20/cpp11/include' -I'/home/omnipath/local/R/4.4-3.20/progress/include' -I'/home/omnipath/local/R/4.4-3.20/tzdb/include' -fpic -g -O2 -fno-omit-frame-pointer -mno-omit-leaf-frame-pointer -ffile-prefix-map=/build/r-base-EawLoD/r-base-4.4.1=. -fstack-protector-strong -fstack-clash-protection -Wformat -Werror=format-security -fcf-protection -fdebug-prefix-map=/build/r-base-EawLoD/r-base-4.4.1=/usr/src/r-base-4.4.1-1.2404.0 -Wdate-time -D_FORTIFY_SOURCE=3 -c vroom_fct.cc -o vroom_fct.o g++ -std=gnu++17 -I"/usr/share/R/include" -DNDEBUG -Imio/include -DWIN32_LEAN_AND_MEAN -Ispdlog/include -DFMT_HEADER_ONLY -I'/home/omnipath/local/R/4.4-3.20/cpp11/include' -I'/home/omnipath/local/R/4.4-3.20/progress/include' -I'/home/omnipath/local/R/4.4-3.20/tzdb/include' -fpic -g -O2 -fno-omit-frame-pointer -mno-omit-leaf-frame-pointer -ffile-prefix-map=/build/r-base-EawLoD/r-base-4.4.1=. -fstack-protector-strong -fstack-clash-protection -Wformat -Werror=format-security -fcf-protection -fdebug-prefix-map=/build/r-base-EawLoD/r-base-4.4.1=/usr/src/r-base-4.4.1-1.2404.0 -Wdate-time -D_FORTIFY_SOURCE=3 -c vroom_fwf.cc -o vroom_fwf.o g++ -std=gnu++17 -I"/usr/share/R/include" -DNDEBUG -Imio/include -DWIN32_LEAN_AND_MEAN -Ispdlog/include -DFMT_HEADER_ONLY -I'/home/omnipath/local/R/4.4-3.20/cpp11/include' -I'/home/omnipath/local/R/4.4-3.20/progress/include' -I'/home/omnipath/local/R/4.4-3.20/tzdb/include' -fpic -g -O2 -fno-omit-frame-pointer -mno-omit-leaf-frame-pointer -ffile-prefix-map=/build/r-base-EawLoD/r-base-4.4.1=. -fstack-protector-strong -fstack-clash-protection -Wformat -Werror=format-security -fcf-protection -fdebug-prefix-map=/build/r-base-EawLoD/r-base-4.4.1=/usr/src/r-base-4.4.1-1.2404.0 -Wdate-time -D_FORTIFY_SOURCE=3 -c vroom_int.cc -o vroom_int.o g++ -std=gnu++17 -I"/usr/share/R/include" -DNDEBUG -Imio/include -DWIN32_LEAN_AND_MEAN -Ispdlog/include -DFMT_HEADER_ONLY -I'/home/omnipath/local/R/4.4-3.20/cpp11/include' -I'/home/omnipath/local/R/4.4-3.20/progress/include' -I'/home/omnipath/local/R/4.4-3.20/tzdb/include' -fpic -g -O2 -fno-omit-frame-pointer -mno-omit-leaf-frame-pointer -ffile-prefix-map=/build/r-base-EawLoD/r-base-4.4.1=. -fstack-protector-strong -fstack-clash-protection -Wformat -Werror=format-security -fcf-protection -fdebug-prefix-map=/build/r-base-EawLoD/r-base-4.4.1=/usr/src/r-base-4.4.1-1.2404.0 -Wdate-time -D_FORTIFY_SOURCE=3 -c vroom_num.cc -o vroom_num.o g++ -std=gnu++17 -I"/usr/share/R/include" -DNDEBUG -Imio/include -DWIN32_LEAN_AND_MEAN -Ispdlog/include -DFMT_HEADER_ONLY -I'/home/omnipath/local/R/4.4-3.20/cpp11/include' -I'/home/omnipath/local/R/4.4-3.20/progress/include' -I'/home/omnipath/local/R/4.4-3.20/tzdb/include' -fpic -g -O2 -fno-omit-frame-pointer -mno-omit-leaf-frame-pointer -ffile-prefix-map=/build/r-base-EawLoD/r-base-4.4.1=. -fstack-protector-strong -fstack-clash-protection -Wformat -Werror=format-security -fcf-protection -fdebug-prefix-map=/build/r-base-EawLoD/r-base-4.4.1=/usr/src/r-base-4.4.1-1.2404.0 -Wdate-time -D_FORTIFY_SOURCE=3 -c vroom_rle.cc -o vroom_rle.o g++ -std=gnu++17 -I"/usr/share/R/include" -DNDEBUG -Imio/include -DWIN32_LEAN_AND_MEAN -Ispdlog/include -DFMT_HEADER_ONLY -I'/home/omnipath/local/R/4.4-3.20/cpp11/include' -I'/home/omnipath/local/R/4.4-3.20/progress/include' -I'/home/omnipath/local/R/4.4-3.20/tzdb/include' -fpic -g -O2 -fno-omit-frame-pointer -mno-omit-leaf-frame-pointer -ffile-prefix-map=/build/r-base-EawLoD/r-base-4.4.1=. -fstack-protector-strong -fstack-clash-protection -Wformat -Werror=format-security -fcf-protection -fdebug-prefix-map=/build/r-base-EawLoD/r-base-4.4.1=/usr/src/r-base-4.4.1-1.2404.0 -Wdate-time -D_FORTIFY_SOURCE=3 -c vroom_time.cc -o vroom_time.o g++ -std=gnu++17 -I"/usr/share/R/include" -DNDEBUG -Imio/include -DWIN32_LEAN_AND_MEAN -Ispdlog/include -DFMT_HEADER_ONLY -I'/home/omnipath/local/R/4.4-3.20/cpp11/include' -I'/home/omnipath/local/R/4.4-3.20/progress/include' -I'/home/omnipath/local/R/4.4-3.20/tzdb/include' -fpic -g -O2 -fno-omit-frame-pointer -mno-omit-leaf-frame-pointer -ffile-prefix-map=/build/r-base-EawLoD/r-base-4.4.1=. -fstack-protector-strong -fstack-clash-protection -Wformat -Werror=format-security -fcf-protection -fdebug-prefix-map=/build/r-base-EawLoD/r-base-4.4.1=/usr/src/r-base-4.4.1-1.2404.0 -Wdate-time -D_FORTIFY_SOURCE=3 -c vroom_write.cc -o vroom_write.o g++ -std=gnu++17 -shared -L/usr/lib/R/lib -Wl,-Bsymbolic-functions -flto=auto -ffat-lto-objects -Wl,-z,relro -o vroom.so Iconv.o LocaleInfo.o altrep.o cpp11.o delimited_index.o delimited_index_connection.o fixed_width_index_connection.o gen.o grisu3.o guess_type.o iconv_file.o index_collection.o vroom.o vroom_big_int.o vroom_chr.o vroom_date.o vroom_dbl.o vroom_dttm.o vroom_errors.o vroom_fct.o vroom_fwf.o vroom_int.o vroom_num.o vroom_rle.o vroom_time.o vroom_write.o -L/usr/lib/R/lib -lR installing to /home/omnipath/local/R/4.4-3.20/00LOCK-vroom/00new/vroom/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 (vroom) * installing *source* package ‘covr’ ... ** package ‘covr’ successfully unpacked and MD5 sums checked ** using staged installation ** libs using C compiler: ‘gcc (Ubuntu 13.2.0-23ubuntu4) 13.2.0’ gcc -I"/usr/share/R/include" -DNDEBUG -fpic -g -O2 -fno-omit-frame-pointer -mno-omit-leaf-frame-pointer -ffile-prefix-map=/build/r-base-EawLoD/r-base-4.4.1=. -fstack-protector-strong -fstack-clash-protection -Wformat -Werror=format-security -fcf-protection -fdebug-prefix-map=/build/r-base-EawLoD/r-base-4.4.1=/usr/src/r-base-4.4.1-1.2404.0 -Wdate-time -D_FORTIFY_SOURCE=3 -c reassign.c -o reassign.o gcc -shared -L/usr/lib/R/lib -Wl,-Bsymbolic-functions -flto=auto -ffat-lto-objects -Wl,-z,relro -o covr.so reassign.o -L/usr/lib/R/lib -lR installing to /home/omnipath/local/R/4.4-3.20/00LOCK-covr/00new/covr/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 (covr) * installing *source* package ‘RefManageR’ ... ** package ‘RefManageR’ successfully unpacked and MD5 sums checked ** using staged installation ** R ** inst ** byte-compile and prepare package for lazy loading ** help *** installing help indices ** building package indices ** installing vignettes ** testing if installed package can be loaded from temporary location ** testing if installed package can be loaded from final location ** testing if installed package keeps a record of temporary installation path * DONE (RefManageR) * installing *source* package ‘bslib’ ... ** package ‘bslib’ 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 ** 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 (bslib) * installing *source* package ‘testthat’ ... ** package ‘testthat’ successfully unpacked and MD5 sums checked ** using staged installation ** libs using C compiler: ‘gcc (Ubuntu 13.2.0-23ubuntu4) 13.2.0’ using C++ compiler: ‘g++ (Ubuntu 13.2.0-23ubuntu4) 13.2.0’ gcc -I"/usr/share/R/include" -DNDEBUG -I../inst/include -DCOMPILING_TESTTHAT -fpic -g -O2 -fno-omit-frame-pointer -mno-omit-leaf-frame-pointer -ffile-prefix-map=/build/r-base-EawLoD/r-base-4.4.1=. -fstack-protector-strong -fstack-clash-protection -Wformat -Werror=format-security -fcf-protection -fdebug-prefix-map=/build/r-base-EawLoD/r-base-4.4.1=/usr/src/r-base-4.4.1-1.2404.0 -Wdate-time -D_FORTIFY_SOURCE=3 -c init.c -o init.o gcc -I"/usr/share/R/include" -DNDEBUG -I../inst/include -DCOMPILING_TESTTHAT -fpic -g -O2 -fno-omit-frame-pointer -mno-omit-leaf-frame-pointer -ffile-prefix-map=/build/r-base-EawLoD/r-base-4.4.1=. -fstack-protector-strong -fstack-clash-protection -Wformat -Werror=format-security -fcf-protection -fdebug-prefix-map=/build/r-base-EawLoD/r-base-4.4.1=/usr/src/r-base-4.4.1-1.2404.0 -Wdate-time -D_FORTIFY_SOURCE=3 -c reassign.c -o reassign.o g++ -std=gnu++17 -I"/usr/share/R/include" -DNDEBUG -I../inst/include -DCOMPILING_TESTTHAT -fpic -g -O2 -fno-omit-frame-pointer -mno-omit-leaf-frame-pointer -ffile-prefix-map=/build/r-base-EawLoD/r-base-4.4.1=. -fstack-protector-strong -fstack-clash-protection -Wformat -Werror=format-security -fcf-protection -fdebug-prefix-map=/build/r-base-EawLoD/r-base-4.4.1=/usr/src/r-base-4.4.1-1.2404.0 -Wdate-time -D_FORTIFY_SOURCE=3 -c test-catch.cpp -o test-catch.o g++ -std=gnu++17 -I"/usr/share/R/include" -DNDEBUG -I../inst/include -DCOMPILING_TESTTHAT -fpic -g -O2 -fno-omit-frame-pointer -mno-omit-leaf-frame-pointer -ffile-prefix-map=/build/r-base-EawLoD/r-base-4.4.1=. -fstack-protector-strong -fstack-clash-protection -Wformat -Werror=format-security -fcf-protection -fdebug-prefix-map=/build/r-base-EawLoD/r-base-4.4.1=/usr/src/r-base-4.4.1-1.2404.0 -Wdate-time -D_FORTIFY_SOURCE=3 -c test-example.cpp -o test-example.o g++ -std=gnu++17 -I"/usr/share/R/include" -DNDEBUG -I../inst/include -DCOMPILING_TESTTHAT -fpic -g -O2 -fno-omit-frame-pointer -mno-omit-leaf-frame-pointer -ffile-prefix-map=/build/r-base-EawLoD/r-base-4.4.1=. -fstack-protector-strong -fstack-clash-protection -Wformat -Werror=format-security -fcf-protection -fdebug-prefix-map=/build/r-base-EawLoD/r-base-4.4.1=/usr/src/r-base-4.4.1-1.2404.0 -Wdate-time -D_FORTIFY_SOURCE=3 -c test-runner.cpp -o test-runner.o g++ -std=gnu++17 -shared -L/usr/lib/R/lib -Wl,-Bsymbolic-functions -flto=auto -ffat-lto-objects -Wl,-z,relro -o testthat.so init.o reassign.o test-catch.o test-example.o test-runner.o -L/usr/lib/R/lib -lR installing to /home/omnipath/local/R/4.4-3.20/00LOCK-testthat/00new/testthat/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 (testthat) * installing *source* package ‘readr’ ... ** package ‘readr’ successfully unpacked and MD5 sums checked ** using staged installation ** libs using C compiler: ‘gcc (Ubuntu 13.2.0-23ubuntu4) 13.2.0’ using C++ compiler: ‘g++ (Ubuntu 13.2.0-23ubuntu4) 13.2.0’ g++ -std=gnu++17 -I"/usr/share/R/include" -DNDEBUG -I'/home/omnipath/local/R/4.4-3.20/cpp11/include' -I'/home/omnipath/local/R/4.4-3.20/tzdb/include' -fpic -g -O2 -fno-omit-frame-pointer -mno-omit-leaf-frame-pointer -ffile-prefix-map=/build/r-base-EawLoD/r-base-4.4.1=. -fstack-protector-strong -fstack-clash-protection -Wformat -Werror=format-security -fcf-protection -fdebug-prefix-map=/build/r-base-EawLoD/r-base-4.4.1=/usr/src/r-base-4.4.1-1.2404.0 -Wdate-time -D_FORTIFY_SOURCE=3 -c Collector.cpp -o Collector.o g++ -std=gnu++17 -I"/usr/share/R/include" -DNDEBUG -I'/home/omnipath/local/R/4.4-3.20/cpp11/include' -I'/home/omnipath/local/R/4.4-3.20/tzdb/include' -fpic -g -O2 -fno-omit-frame-pointer -mno-omit-leaf-frame-pointer -ffile-prefix-map=/build/r-base-EawLoD/r-base-4.4.1=. -fstack-protector-strong -fstack-clash-protection -Wformat -Werror=format-security -fcf-protection -fdebug-prefix-map=/build/r-base-EawLoD/r-base-4.4.1=/usr/src/r-base-4.4.1-1.2404.0 -Wdate-time -D_FORTIFY_SOURCE=3 -c CollectorGuess.cpp -o CollectorGuess.o g++ -std=gnu++17 -I"/usr/share/R/include" -DNDEBUG -I'/home/omnipath/local/R/4.4-3.20/cpp11/include' -I'/home/omnipath/local/R/4.4-3.20/tzdb/include' -fpic -g -O2 -fno-omit-frame-pointer -mno-omit-leaf-frame-pointer -ffile-prefix-map=/build/r-base-EawLoD/r-base-4.4.1=. -fstack-protector-strong -fstack-clash-protection -Wformat -Werror=format-security -fcf-protection -fdebug-prefix-map=/build/r-base-EawLoD/r-base-4.4.1=/usr/src/r-base-4.4.1-1.2404.0 -Wdate-time -D_FORTIFY_SOURCE=3 -c Iconv.cpp -o Iconv.o g++ -std=gnu++17 -I"/usr/share/R/include" -DNDEBUG -I'/home/omnipath/local/R/4.4-3.20/cpp11/include' -I'/home/omnipath/local/R/4.4-3.20/tzdb/include' -fpic -g -O2 -fno-omit-frame-pointer -mno-omit-leaf-frame-pointer -ffile-prefix-map=/build/r-base-EawLoD/r-base-4.4.1=. -fstack-protector-strong -fstack-clash-protection -Wformat -Werror=format-security -fcf-protection -fdebug-prefix-map=/build/r-base-EawLoD/r-base-4.4.1=/usr/src/r-base-4.4.1-1.2404.0 -Wdate-time -D_FORTIFY_SOURCE=3 -c LocaleInfo.cpp -o LocaleInfo.o g++ -std=gnu++17 -I"/usr/share/R/include" -DNDEBUG -I'/home/omnipath/local/R/4.4-3.20/cpp11/include' -I'/home/omnipath/local/R/4.4-3.20/tzdb/include' -fpic -g -O2 -fno-omit-frame-pointer -mno-omit-leaf-frame-pointer -ffile-prefix-map=/build/r-base-EawLoD/r-base-4.4.1=. -fstack-protector-strong -fstack-clash-protection -Wformat -Werror=format-security -fcf-protection -fdebug-prefix-map=/build/r-base-EawLoD/r-base-4.4.1=/usr/src/r-base-4.4.1-1.2404.0 -Wdate-time -D_FORTIFY_SOURCE=3 -c Reader.cpp -o Reader.o g++ -std=gnu++17 -I"/usr/share/R/include" -DNDEBUG -I'/home/omnipath/local/R/4.4-3.20/cpp11/include' -I'/home/omnipath/local/R/4.4-3.20/tzdb/include' -fpic -g -O2 -fno-omit-frame-pointer -mno-omit-leaf-frame-pointer -ffile-prefix-map=/build/r-base-EawLoD/r-base-4.4.1=. -fstack-protector-strong -fstack-clash-protection -Wformat -Werror=format-security -fcf-protection -fdebug-prefix-map=/build/r-base-EawLoD/r-base-4.4.1=/usr/src/r-base-4.4.1-1.2404.0 -Wdate-time -D_FORTIFY_SOURCE=3 -c Source.cpp -o Source.o g++ -std=gnu++17 -I"/usr/share/R/include" -DNDEBUG -I'/home/omnipath/local/R/4.4-3.20/cpp11/include' -I'/home/omnipath/local/R/4.4-3.20/tzdb/include' -fpic -g -O2 -fno-omit-frame-pointer -mno-omit-leaf-frame-pointer -ffile-prefix-map=/build/r-base-EawLoD/r-base-4.4.1=. -fstack-protector-strong -fstack-clash-protection -Wformat -Werror=format-security -fcf-protection -fdebug-prefix-map=/build/r-base-EawLoD/r-base-4.4.1=/usr/src/r-base-4.4.1-1.2404.0 -Wdate-time -D_FORTIFY_SOURCE=3 -c Tokenizer.cpp -o Tokenizer.o g++ -std=gnu++17 -I"/usr/share/R/include" -DNDEBUG -I'/home/omnipath/local/R/4.4-3.20/cpp11/include' -I'/home/omnipath/local/R/4.4-3.20/tzdb/include' -fpic -g -O2 -fno-omit-frame-pointer -mno-omit-leaf-frame-pointer -ffile-prefix-map=/build/r-base-EawLoD/r-base-4.4.1=. -fstack-protector-strong -fstack-clash-protection -Wformat -Werror=format-security -fcf-protection -fdebug-prefix-map=/build/r-base-EawLoD/r-base-4.4.1=/usr/src/r-base-4.4.1-1.2404.0 -Wdate-time -D_FORTIFY_SOURCE=3 -c TokenizerDelim.cpp -o TokenizerDelim.o g++ -std=gnu++17 -I"/usr/share/R/include" -DNDEBUG -I'/home/omnipath/local/R/4.4-3.20/cpp11/include' -I'/home/omnipath/local/R/4.4-3.20/tzdb/include' -fpic -g -O2 -fno-omit-frame-pointer -mno-omit-leaf-frame-pointer -ffile-prefix-map=/build/r-base-EawLoD/r-base-4.4.1=. -fstack-protector-strong -fstack-clash-protection -Wformat -Werror=format-security -fcf-protection -fdebug-prefix-map=/build/r-base-EawLoD/r-base-4.4.1=/usr/src/r-base-4.4.1-1.2404.0 -Wdate-time -D_FORTIFY_SOURCE=3 -c TokenizerFwf.cpp -o TokenizerFwf.o g++ -std=gnu++17 -I"/usr/share/R/include" -DNDEBUG -I'/home/omnipath/local/R/4.4-3.20/cpp11/include' -I'/home/omnipath/local/R/4.4-3.20/tzdb/include' -fpic -g -O2 -fno-omit-frame-pointer -mno-omit-leaf-frame-pointer -ffile-prefix-map=/build/r-base-EawLoD/r-base-4.4.1=. -fstack-protector-strong -fstack-clash-protection -Wformat -Werror=format-security -fcf-protection -fdebug-prefix-map=/build/r-base-EawLoD/r-base-4.4.1=/usr/src/r-base-4.4.1-1.2404.0 -Wdate-time -D_FORTIFY_SOURCE=3 -c TokenizerWs.cpp -o TokenizerWs.o g++ -std=gnu++17 -I"/usr/share/R/include" -DNDEBUG -I'/home/omnipath/local/R/4.4-3.20/cpp11/include' -I'/home/omnipath/local/R/4.4-3.20/tzdb/include' -fpic -g -O2 -fno-omit-frame-pointer -mno-omit-leaf-frame-pointer -ffile-prefix-map=/build/r-base-EawLoD/r-base-4.4.1=. -fstack-protector-strong -fstack-clash-protection -Wformat -Werror=format-security -fcf-protection -fdebug-prefix-map=/build/r-base-EawLoD/r-base-4.4.1=/usr/src/r-base-4.4.1-1.2404.0 -Wdate-time -D_FORTIFY_SOURCE=3 -c connection.cpp -o connection.o g++ -std=gnu++17 -I"/usr/share/R/include" -DNDEBUG -I'/home/omnipath/local/R/4.4-3.20/cpp11/include' -I'/home/omnipath/local/R/4.4-3.20/tzdb/include' -fpic -g -O2 -fno-omit-frame-pointer -mno-omit-leaf-frame-pointer -ffile-prefix-map=/build/r-base-EawLoD/r-base-4.4.1=. -fstack-protector-strong -fstack-clash-protection -Wformat -Werror=format-security -fcf-protection -fdebug-prefix-map=/build/r-base-EawLoD/r-base-4.4.1=/usr/src/r-base-4.4.1-1.2404.0 -Wdate-time -D_FORTIFY_SOURCE=3 -c cpp11.cpp -o cpp11.o g++ -std=gnu++17 -I"/usr/share/R/include" -DNDEBUG -I'/home/omnipath/local/R/4.4-3.20/cpp11/include' -I'/home/omnipath/local/R/4.4-3.20/tzdb/include' -fpic -g -O2 -fno-omit-frame-pointer -mno-omit-leaf-frame-pointer -ffile-prefix-map=/build/r-base-EawLoD/r-base-4.4.1=. -fstack-protector-strong -fstack-clash-protection -Wformat -Werror=format-security -fcf-protection -fdebug-prefix-map=/build/r-base-EawLoD/r-base-4.4.1=/usr/src/r-base-4.4.1-1.2404.0 -Wdate-time -D_FORTIFY_SOURCE=3 -c datetime.cpp -o datetime.o gcc -I"/usr/share/R/include" -DNDEBUG -I'/home/omnipath/local/R/4.4-3.20/cpp11/include' -I'/home/omnipath/local/R/4.4-3.20/tzdb/include' -fpic -g -O2 -fno-omit-frame-pointer -mno-omit-leaf-frame-pointer -ffile-prefix-map=/build/r-base-EawLoD/r-base-4.4.1=. -fstack-protector-strong -fstack-clash-protection -Wformat -Werror=format-security -fcf-protection -fdebug-prefix-map=/build/r-base-EawLoD/r-base-4.4.1=/usr/src/r-base-4.4.1-1.2404.0 -Wdate-time -D_FORTIFY_SOURCE=3 -c grisu3.c -o grisu3.o gcc -I"/usr/share/R/include" -DNDEBUG -I'/home/omnipath/local/R/4.4-3.20/cpp11/include' -I'/home/omnipath/local/R/4.4-3.20/tzdb/include' -fpic -g -O2 -fno-omit-frame-pointer -mno-omit-leaf-frame-pointer -ffile-prefix-map=/build/r-base-EawLoD/r-base-4.4.1=. -fstack-protector-strong -fstack-clash-protection -Wformat -Werror=format-security -fcf-protection -fdebug-prefix-map=/build/r-base-EawLoD/r-base-4.4.1=/usr/src/r-base-4.4.1-1.2404.0 -Wdate-time -D_FORTIFY_SOURCE=3 -c init.c -o init.o g++ -std=gnu++17 -I"/usr/share/R/include" -DNDEBUG -I'/home/omnipath/local/R/4.4-3.20/cpp11/include' -I'/home/omnipath/local/R/4.4-3.20/tzdb/include' -fpic -g -O2 -fno-omit-frame-pointer -mno-omit-leaf-frame-pointer -ffile-prefix-map=/build/r-base-EawLoD/r-base-4.4.1=. -fstack-protector-strong -fstack-clash-protection -Wformat -Werror=format-security -fcf-protection -fdebug-prefix-map=/build/r-base-EawLoD/r-base-4.4.1=/usr/src/r-base-4.4.1-1.2404.0 -Wdate-time -D_FORTIFY_SOURCE=3 -c parse.cpp -o parse.o g++ -std=gnu++17 -I"/usr/share/R/include" -DNDEBUG -I'/home/omnipath/local/R/4.4-3.20/cpp11/include' -I'/home/omnipath/local/R/4.4-3.20/tzdb/include' -fpic -g -O2 -fno-omit-frame-pointer -mno-omit-leaf-frame-pointer -ffile-prefix-map=/build/r-base-EawLoD/r-base-4.4.1=. -fstack-protector-strong -fstack-clash-protection -Wformat -Werror=format-security -fcf-protection -fdebug-prefix-map=/build/r-base-EawLoD/r-base-4.4.1=/usr/src/r-base-4.4.1-1.2404.0 -Wdate-time -D_FORTIFY_SOURCE=3 -c read.cpp -o read.o g++ -std=gnu++17 -I"/usr/share/R/include" -DNDEBUG -I'/home/omnipath/local/R/4.4-3.20/cpp11/include' -I'/home/omnipath/local/R/4.4-3.20/tzdb/include' -fpic -g -O2 -fno-omit-frame-pointer -mno-omit-leaf-frame-pointer -ffile-prefix-map=/build/r-base-EawLoD/r-base-4.4.1=. -fstack-protector-strong -fstack-clash-protection -Wformat -Werror=format-security -fcf-protection -fdebug-prefix-map=/build/r-base-EawLoD/r-base-4.4.1=/usr/src/r-base-4.4.1-1.2404.0 -Wdate-time -D_FORTIFY_SOURCE=3 -c type_convert.cpp -o type_convert.o g++ -std=gnu++17 -I"/usr/share/R/include" -DNDEBUG -I'/home/omnipath/local/R/4.4-3.20/cpp11/include' -I'/home/omnipath/local/R/4.4-3.20/tzdb/include' -fpic -g -O2 -fno-omit-frame-pointer -mno-omit-leaf-frame-pointer -ffile-prefix-map=/build/r-base-EawLoD/r-base-4.4.1=. -fstack-protector-strong -fstack-clash-protection -Wformat -Werror=format-security -fcf-protection -fdebug-prefix-map=/build/r-base-EawLoD/r-base-4.4.1=/usr/src/r-base-4.4.1-1.2404.0 -Wdate-time -D_FORTIFY_SOURCE=3 -c write.cpp -o write.o g++ -std=gnu++17 -I"/usr/share/R/include" -DNDEBUG -I'/home/omnipath/local/R/4.4-3.20/cpp11/include' -I'/home/omnipath/local/R/4.4-3.20/tzdb/include' -fpic -g -O2 -fno-omit-frame-pointer -mno-omit-leaf-frame-pointer -ffile-prefix-map=/build/r-base-EawLoD/r-base-4.4.1=. -fstack-protector-strong -fstack-clash-protection -Wformat -Werror=format-security -fcf-protection -fdebug-prefix-map=/build/r-base-EawLoD/r-base-4.4.1=/usr/src/r-base-4.4.1-1.2404.0 -Wdate-time -D_FORTIFY_SOURCE=3 -c write_delim.cpp -o write_delim.o g++ -std=gnu++17 -shared -L/usr/lib/R/lib -Wl,-Bsymbolic-functions -flto=auto -ffat-lto-objects -Wl,-z,relro -o readr.so Collector.o CollectorGuess.o Iconv.o LocaleInfo.o Reader.o Source.o Tokenizer.o TokenizerDelim.o TokenizerFwf.o TokenizerWs.o connection.o cpp11.o datetime.o grisu3.o init.o parse.o read.o type_convert.o write.o write_delim.o -L/usr/lib/R/lib -lR installing to /home/omnipath/local/R/4.4-3.20/00LOCK-readr/00new/readr/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 (readr) * installing *source* package ‘rmarkdown’ ... ** package ‘rmarkdown’ 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 (rmarkdown) * installing *source* package ‘bookdown’ ... ** package ‘bookdown’ 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 (bookdown) * installing *source* package ‘BiocStyle’ ... ** using staged installation ** R ** inst ** byte-compile and prepare package for lazy loading ** help *** installing help indices ** building package indices ** installing vignettes ** testing if installed package can be loaded from temporary location ** testing if installed package can be loaded from final location ** testing if installed package keeps a record of temporary installation path * DONE (BiocStyle) The downloaded source packages are in ‘/tmp/RtmpSoQTSW/downloaded_packages’ [ Finished: 2024-08-15 23:58:48 CEST ]